Home
last modified time | relevance | path

Searched refs:cur_bit (Results 1 – 4 of 4) sorted by relevance

/linux/drivers/iommu/iommufd/
H A Diova_bitmap.c405 unsigned long cur_bit, last_bit, last_page_idx; in iova_bitmap_set() local
419 cur_bit = ((iova - mapped->iova) >> in iova_bitmap_set()
425 unsigned int page_idx = cur_bit / BITS_PER_PAGE; in iova_bitmap_set()
426 unsigned int offset = cur_bit % BITS_PER_PAGE; in iova_bitmap_set()
428 last_bit - cur_bit + 1); in iova_bitmap_set()
433 ((last_bit - cur_bit + 1) << mapped->pgshift); in iova_bitmap_set()
443 cur_bit += nbits; in iova_bitmap_set()
444 } while (cur_bit <= last_bit); in iova_bitmap_set()
/linux/drivers/net/ethernet/broadcom/bnx2x/
H A Dbnx2x_main.c4607 u32 cur_bit; in bnx2x_check_blocks_with_parity0() local
4614 cur_bit = (0x1UL << i); in bnx2x_check_blocks_with_parity0()
4615 if (sig & cur_bit) { in bnx2x_check_blocks_with_parity0()
4619 switch (cur_bit) { in bnx2x_check_blocks_with_parity0()
4661 sig &= ~cur_bit; in bnx2x_check_blocks_with_parity0()
4672 u32 cur_bit; in bnx2x_check_blocks_with_parity1() local
4679 cur_bit = (0x1UL << i); in bnx2x_check_blocks_with_parity1()
4680 if (sig & cur_bit) { in bnx2x_check_blocks_with_parity1()
4682 switch (cur_bit) { in bnx2x_check_blocks_with_parity1()
4805 sig &= ~cur_bit; in bnx2x_check_blocks_with_parity1()
4815 u32 cur_bit; bnx2x_check_blocks_with_parity2() local
4891 u32 cur_bit; bnx2x_check_blocks_with_parity3() local
4938 u32 cur_bit; bnx2x_check_blocks_with_parity4() local
[all...]
H A Dbnx2x_sp.c2784 int cur_bit = j + BIT_VEC64_ELEM_SZ * i; in bnx2x_mcast_get_next_bin() local
2786 vec, cur_bit)) { in bnx2x_mcast_get_next_bin()
2787 return cur_bit; in bnx2x_mcast_get_next_bin()
2806 int cur_bit = bnx2x_mcast_get_next_bin(o, 0); in bnx2x_mcast_clear_first_bin() local
2808 if (cur_bit >= 0) in bnx2x_mcast_clear_first_bin()
2809 BIT_VEC64_CLEAR_BIT(o->registry.aprox_match.vec, cur_bit); in bnx2x_mcast_clear_first_bin()
2811 return cur_bit; in bnx2x_mcast_clear_first_bin()
/linux/fs/btrfs/
H A Ddisk-io.c539 int cur_bit = 0; in btree_dirty_folio()
554 for (cur_bit = spi->dirty_offset; in btree_dirty_folio()
555 cur_bit < spi->dirty_offset + spi->bitmap_nr_bits;
556 cur_bit++) {
561 if (!test_bit(cur_bit, subpage->bitmaps)) {
566 cur = page_start + (cur_bit << fs_info->sectorsize_bits);
575 cur_bit += (fs_info->nodesize >> fs_info->sectorsize_bits) - 1; in btrfs_find_create_tree_block()
515 int cur_bit = 0; btree_dirty_folio() local