Home
last modified time | relevance | path

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

/openbmc/linux/drivers/vfio/
H A Diova_bitmap.c406 unsigned long cur_bit = ((iova - mapped->iova) >> in iova_bitmap_set() local
413 unsigned int page_idx = cur_bit / BITS_PER_PAGE; in iova_bitmap_set()
414 unsigned int offset = cur_bit % BITS_PER_PAGE; in iova_bitmap_set()
416 last_bit - cur_bit + 1); in iova_bitmap_set()
425 cur_bit += nbits; in iova_bitmap_set()
426 } while (cur_bit <= last_bit); in iova_bitmap_set()
/openbmc/linux/drivers/net/ethernet/broadcom/bnx2x/
H A Dbnx2x_main.c4604 u32 cur_bit; in bnx2x_check_blocks_with_parity0() local
4658 sig &= ~cur_bit; in bnx2x_check_blocks_with_parity0()
4669 u32 cur_bit; in bnx2x_check_blocks_with_parity1() local
4679 switch (cur_bit) { in bnx2x_check_blocks_with_parity1()
4802 sig &= ~cur_bit; in bnx2x_check_blocks_with_parity1()
4812 u32 cur_bit; in bnx2x_check_blocks_with_parity2() local
4876 sig &= ~cur_bit; in bnx2x_check_blocks_with_parity2()
4888 u32 cur_bit; in bnx2x_check_blocks_with_parity3() local
4925 sig &= ~cur_bit; in bnx2x_check_blocks_with_parity3()
4935 u32 cur_bit; in 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()
/openbmc/linux/fs/btrfs/
H A Ddisk-io.c526 int cur_bit = 0; in btree_dirty_folio() local
541 for (cur_bit = spi->dirty_offset; in btree_dirty_folio()
542 cur_bit < spi->dirty_offset + spi->bitmap_nr_bits; in btree_dirty_folio()
543 cur_bit++) { in btree_dirty_folio()
548 if (!test_bit(cur_bit, subpage->bitmaps)) { in btree_dirty_folio()
553 cur = page_start + cur_bit * fs_info->sectorsize; in btree_dirty_folio()
562 cur_bit += (fs_info->nodesize >> fs_info->sectorsize_bits) - 1; in btree_dirty_folio()