Searched refs:bits_per_word (Results 1 – 3 of 3) sorted by relevance
16 #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
207 tag += (index << bt->bits_per_word); in __bt_get()216 last_tag = (index << bt->bits_per_word); in __bt_get()441 off += (1 << bt->bits_per_word); in bt_for_each()464 off += (1 << bt->bits_per_word); in bt_tags_for_each()524 unsigned int tags_per_word = 1U << bt->bits_per_word; in bt_update_count()548 bt->bits_per_word = ilog2(BITS_PER_LONG); in bt_alloc()557 tags_per_word = (1 << bt->bits_per_word); in bt_alloc()567 bt->bits_per_word--; in bt_alloc()568 tags_per_word = (1 << bt->bits_per_word); in bt_alloc()718 tags->bitmap_tags.bits_per_word); in blk_mq_tag_sysfs_show()
55 return &hctx->ctx_map.map[ctx->index_hw / hctx->ctx_map.bits_per_word]; in get_bm()59 ((ctx)->index_hw & ((hctx)->ctx_map.bits_per_word - 1))720 off = i * hctx->ctx_map.bits_per_word; in flush_busy_ctxs()1572 bitmap->bits_per_word = bpw; in blk_mq_alloc_bitmap()1582 bitmap->map[i].depth = min(total, bitmap->bits_per_word); in blk_mq_alloc_bitmap()1879 map->size = DIV_ROUND_UP(hctx->nr_ctx, map->bits_per_word); in blk_mq_map_swqueue()