Home
last modified time | relevance | path

Searched refs:j (Results 1 – 7 of 7) sorted by relevance

/block/
Dt10-pi.c150 unsigned int j; in t10_pi_type1_prepare() local
154 for (j = 0; j < iv.bv_len; j += tuple_sz) { in t10_pi_type1_prepare()
196 unsigned int j; in t10_pi_type1_complete() local
200 for (j = 0; j < iv.bv_len && intervals; j += tuple_sz) { in t10_pi_type1_complete()
Dblk-map.c239 int j; in bio_map_user_iov() local
265 j = 0; in bio_map_user_iov()
267 for (j = 0; j < npages; j++) { in bio_map_user_iov()
268 struct page *page = pages[j]; in bio_map_user_iov()
291 while (j < npages) in bio_map_user_iov()
292 put_page(pages[j++]); in bio_map_user_iov()
Dblk-mq.c2450 unsigned int i, j, entries_per_page, max_order = 4; in blk_mq_alloc_rqs() local
2505 for (j = 0; j < to_do; j++) { in blk_mq_alloc_rqs()
2835 unsigned int i, j; in blk_mq_init_cpu_queues() local
2853 for (j = 0; j < set->nr_maps; j++) { in blk_mq_init_cpu_queues()
2854 hctx = blk_mq_map_queue_type(q, j, i); in blk_mq_init_cpu_queues()
2896 unsigned int i, j, hctx_idx; in blk_mq_map_swqueue() local
2915 for (j = 0; j < set->nr_maps; j++) { in blk_mq_map_swqueue()
2916 if (!set->map[j].nr_queues) { in blk_mq_map_swqueue()
2917 ctx->hctxs[j] = blk_mq_map_queue_type(q, in blk_mq_map_swqueue()
2921 hctx_idx = set->map[j].mq_map[i]; in blk_mq_map_swqueue()
[all …]
Dblk-timeout.c104 static inline unsigned long blk_round_jiffies(unsigned long j) in blk_round_jiffies() argument
106 return (j + blk_timeout_mask) + 1; in blk_round_jiffies()
Dblk-mq-sysfs.c190 int i, j, ret; in blk_mq_register_hctx() local
207 hctx_for_each_ctx(hctx, ctx, j) { in blk_mq_register_hctx()
208 if (j < i) in blk_mq_register_hctx()
Dblk-crypto-fallback.c273 unsigned int i, j; in blk_crypto_fallback_encrypt_bio() local
336 for (j = 0; j < enc_bvec->bv_len; j += data_unit_size) { in blk_crypto_fallback_encrypt_bio()
Dbfq-iosched.c2520 int i, j; in bfq_end_wr_async_queues() local
2523 for (j = 0; j < IOPRIO_NR_LEVELS; j++) in bfq_end_wr_async_queues()
2524 if (bfqg->async_bfqq[i][j]) in bfq_end_wr_async_queues()
2525 bfq_bfqq_end_wr(bfqg->async_bfqq[i][j]); in bfq_end_wr_async_queues()
6819 int i, j; in bfq_put_async_queues() local
6822 for (j = 0; j < IOPRIO_NR_LEVELS; j++) in bfq_put_async_queues()
6823 __bfq_put_async_bfqq(bfqd, &bfqg->async_bfqq[i][j]); in bfq_put_async_queues()
6835 unsigned int i, j, min_shallow = UINT_MAX; in bfq_update_depths() local
6869 for (j = 0; j < 2; j++) in bfq_update_depths()
6870 min_shallow = min(min_shallow, bfqd->word_depths[i][j]); in bfq_update_depths()