Searched refs:find_next_bit (Results 1 – 9 of 9) sorted by relevance
| /lib/ |
| D | find_bit.c | 20 #if !defined(find_next_bit) || !defined(find_next_zero_bit) || \
63 #ifndef find_next_bit
67 unsigned long find_next_bit(const unsigned long *addr, unsigned long size, in find_next_bit() function
72 EXPORT_SYMBOL(find_next_bit);
|
| D | cpumask.c | 22 return find_next_bit(cpumask_bits(srcp), nr_cpumask_bits, n + 1); in cpumask_next()
|
| D | find_bit_benchmark.c | 59 i = find_next_bit(bitmap, BITMAP_LEN, i) + 1; in test_find_next_bit()
|
| D | genalloc.c | 253 bit = find_next_bit(chunk->bits, end_bit, 0); in gen_pool_destroy()
758 unsigned long next_bit = find_next_bit(map, size, index + nr); in gen_pool_best_fit()
|
| D | bitmap.c | 342 i = find_next_bit(map, end, index); in bitmap_find_next_zero_area_off()
753 pos = find_next_bit(buf, nbits, pos + 1)) in bitmap_ord_to_pos()
|
| D | test_bitmap.c | 357 next_bit = find_next_bit(bmap2, in test_bitmap_arr32()
|
| D | xarray.c | 134 if (find_next_bit(marks, limit, xas->xa_offset + 1) == limit) in xas_squash_marks()
|
| D | vsprintf.c | 1226 cur = find_next_bit(bitmap, nr_bits, cur + 1); in bitmap_list_string()
|
| /lib/math/ |
| D | prime_numbers.c | 146 for (y = 2UL; y < sz; y = find_next_bit(new->primes, sz, y + 1)) in expand_to_next_prime()
203 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
|