Lines Matching refs:bit
62 unsigned int bit) in ebitmap_next_positive() argument
66 ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1); in ebitmap_next_positive()
79 #define EBITMAP_NODE_INDEX(node, bit) \ argument
80 (((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)
81 #define EBITMAP_NODE_OFFSET(node, bit) \ argument
82 (((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)
85 unsigned int bit) in ebitmap_node_get_bit() argument
87 unsigned int index = EBITMAP_NODE_INDEX(n, bit); in ebitmap_node_get_bit()
88 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit); in ebitmap_node_get_bit()
97 unsigned int bit) in ebitmap_node_set_bit() argument
99 unsigned int index = EBITMAP_NODE_INDEX(n, bit); in ebitmap_node_set_bit()
100 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit); in ebitmap_node_set_bit()
107 unsigned int bit) in ebitmap_node_clr_bit() argument
109 unsigned int index = EBITMAP_NODE_INDEX(n, bit); in ebitmap_node_clr_bit()
110 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit); in ebitmap_node_clr_bit()
116 #define ebitmap_for_each_positive_bit(e, n, bit) \ argument
117 for ( bit = ebitmap_start_positive(e, &n); \
118 bit < ebitmap_length(e); \
119 bit = ebitmap_next_positive(e, &n, bit) ) \
124 int ebitmap_get_bit(struct ebitmap *e, unsigned long bit);
125 int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value);