Home
last modified time | relevance | path

Searched refs:bits_per_word (Results 1 – 3 of 3) sorted by relevance

/block/
Dblk-mq-tag.h16 #define TAG_TO_INDEX(bt, tag) ((tag) >> (bt)->bits_per_word)
17 #define TAG_TO_BIT(bt, tag) ((tag) & ((1 << (bt)->bits_per_word) - 1))
22 unsigned int bits_per_word; member
Dblk-mq-tag.c192 tag += (index << bt->bits_per_word); in __bt_get()
411 off += (1 << bt->bits_per_word); in bt_for_each()
443 unsigned int tags_per_word = 1U << bt->bits_per_word; in bt_update_count()
467 bt->bits_per_word = ilog2(BITS_PER_LONG); in bt_alloc()
476 tags_per_word = (1 << bt->bits_per_word); in bt_alloc()
486 bt->bits_per_word--; in bt_alloc()
487 tags_per_word = (1 << bt->bits_per_word); in bt_alloc()
600 tags->bitmap_tags.bits_per_word); in blk_mq_tag_sysfs_show()
Dblk-mq.c54 return &hctx->ctx_map.map[ctx->index_hw / hctx->ctx_map.bits_per_word]; in get_bm()
58 ((ctx)->index_hw & ((hctx)->ctx_map.bits_per_word - 1))
651 off = i * hctx->ctx_map.bits_per_word; in flush_busy_ctxs()
1401 bitmap->bits_per_word = bpw; in blk_mq_alloc_bitmap()
1413 bitmap->map[i].depth = min(total, bitmap->bits_per_word); in blk_mq_alloc_bitmap()