Lines Matching defs:bit
7 * A set bit at layer N indicates a full word at layer N-1, and so forth. As
12 * Axmaps get pretty close to optimal (1 bit per block) space usage, since
142 unsigned int bit = index & BLOCKS_PER_UNIT_MASK;
146 if (func(al, offset, bit, data))
163 unsigned int bit = index & BLOCKS_PER_UNIT_MASK;
167 if (func(al, offset, bit, data))
175 unsigned int bit, void *unused)
177 if (!(al->map[offset] & (1UL << bit)))
180 al->map[offset] &= ~(1UL << bit);
217 unsigned int bit, void *__data)
223 nr_bits = min(data->nr_bits, BLOCKS_PER_UNIT - bit);
225 mask = bit_masks[nr_bits] << bit;
319 unsigned int bit, void *unused)
321 return (al->map[offset] & (1UL << bit)) != 0;
340 * Start at the bottom, then converge towards first free bit at the top
358 * First free bit here is our index into the first
359 * free bit at the next higher level
384 uint64_t bit;
388 unsigned int bit, void *__data)
391 uint64_t mask = ~bit_masks[(data->bit + 1) & BLOCKS_PER_UNIT_MASK];
402 data->bit = (data->bit + BLOCKS_PER_UNIT - 1) / BLOCKS_PER_UNIT;
407 * 'bit_nr' is already set. Find the next free bit after this one.
411 struct axmap_next_free_data data = { .level = -1U, .bit = bit_nr, };
