Lines Matching refs:k

585 	int mxsize, cmd_size, k;  in sg_write()  local
686 k = sg_common_write(sfp, srp, cmnd, sfp->timeout, blocking); in sg_write()
687 return (k < 0) ? k : count; in sg_write()
695 int k; in sg_new_write() local
755 k = sg_common_write(sfp, srp, cmnd, timeout, blocking); in sg_new_write()
756 if (k < 0) in sg_new_write()
757 return k; in sg_new_write()
767 int k, at_head; in sg_common_write() local
783 k = sg_start_req(srp, cmnd); in sg_common_write()
784 if (k) { in sg_common_write()
786 "sg_common_write: start_req err=%d\n", k)); in sg_common_write()
788 return k; /* probably out of space --> ENOMEM */ in sg_common_write()
1202 int k, length; in sg_vma_fault() local
1215 for (k = 0; k < rsv_schp->k_use_sg && sa < vma->vm_end; k++) { in sg_vma_fault()
1219 struct page *page = nth_page(rsv_schp->pages[k], in sg_vma_fault()
1242 int k, length; in sg_mmap() local
1258 for (k = 0; k < rsv_schp->k_use_sg && sa < vma->vm_end; k++) { in sg_mmap()
1406 u32 k; in sg_alloc() local
1432 k = error; in sg_alloc()
1435 "sg_alloc: dev=%d \n", k)); in sg_alloc()
1436 sprintf(disk->disk_name, "sg%d", k); in sg_alloc()
1437 disk->first_minor = k; in sg_alloc()
1446 sdp->index = k; in sg_alloc()
1827 int ret_sz = 0, i, k, rem_sz, num, mx_sc_elems; in sg_build_indirect() local
1866 for (k = 0, rem_sz = blk_size; rem_sz > 0 && k < mx_sc_elems; in sg_build_indirect()
1867 k++, rem_sz -= ret_sz) { in sg_build_indirect()
1872 schp->pages[k] = alloc_pages(gfp_mask, order); in sg_build_indirect()
1873 if (!schp->pages[k]) in sg_build_indirect()
1885 k, num, ret_sz)); in sg_build_indirect()
1889 schp->k_use_sg = k; in sg_build_indirect()
1892 k, rem_sz)); in sg_build_indirect()
1899 for (i = 0; i < k; i++) in sg_build_indirect()
1915 int k; in sg_remove_scat() local
1917 for (k = 0; k < schp->k_use_sg && schp->pages[k]; k++) { in sg_remove_scat()
1921 k, schp->pages[k])); in sg_remove_scat()
1922 __free_pages(schp->pages[k], schp->page_order); in sg_remove_scat()
1935 int k, num; in sg_read_oxfer() local
1944 for (k = 0; k < schp->k_use_sg && schp->pages[k]; k++) { in sg_read_oxfer()
1946 if (__copy_to_user(outp, page_address(schp->pages[k]), in sg_read_oxfer()
1951 if (__copy_to_user(outp, page_address(schp->pages[k]), in sg_read_oxfer()
1987 int k, num, rem; in sg_link_reserve() local
1995 for (k = 0; k < rsv_schp->k_use_sg; k++) { in sg_link_reserve()
1997 req_schp->k_use_sg = k + 1; in sg_link_reserve()
2008 if (k >= rsv_schp->k_use_sg) in sg_link_reserve()
2053 int k; in sg_add_request() local
2069 for (k = 0; k < SG_MAX_QUEUE; ++k, ++rp) { in sg_add_request()
2073 if (k < SG_MAX_QUEUE) { in sg_add_request()
2232 int *k = data; in sg_idr_max_id() local
2234 if (*k < id) in sg_idr_max_id()
2235 *k = id; in sg_idr_max_id()
2243 int k = -1; in sg_last_dev() local
2247 idr_for_each(&sg_index_idr, sg_idr_max_id, &k); in sg_last_dev()
2249 return k + 1; /* origin 1 */ in sg_last_dev()
2404 int k; in sg_proc_init() local
2409 for (k = 0; k < num_leaves; ++k) { in sg_proc_init()
2410 const struct sg_proc_leaf *leaf = &sg_proc_leaf_arr[k]; in sg_proc_init()
2420 int k; in sg_proc_cleanup() local
2425 for (k = 0; k < num_leaves; ++k) in sg_proc_cleanup()
2426 remove_proc_entry(sg_proc_leaf_arr[k].name, sg_proc_sgp); in sg_proc_cleanup()
2468 unsigned long k = ULONG_MAX; in sg_proc_write_dressz() local
2473 err = kstrtoul_from_user(buffer, count, 0, &k); in sg_proc_write_dressz()
2476 if (k <= 1048576) { /* limit "big buff" to 1 MB */ in sg_proc_write_dressz()
2477 sg_big_buff = k; in sg_proc_write_dressz()
2597 int k, m, new_interface, blen, usg; in sg_proc_debug_helper() local
2604 k = 0; in sg_proc_debug_helper()
2606 k++; in sg_proc_debug_helper()
2609 "(res)sgat=%d low_dma=%d\n", k, in sg_proc_debug_helper()