Searched refs:find_next_bit (Results 1 – 8 of 8) sorted by relevance
| /include/linux/ |
| A D | find.h | 49 #ifndef find_next_bit
60 unsigned long find_next_bit(const unsigned long *addr, unsigned long size, in find_next_bit() function
455 unsigned long bit = find_next_bit(addr, size, offset); in find_next_bit_wrap()
477 bit = find_next_bit(bitmap, size, n); in __for_each_wrap()
486 bit = find_next_bit(bitmap, start, n); in __for_each_wrap()
518 return find_next_bit(addr, size, offset); in find_next_bit_le()
605 for (; (bit) = find_next_bit((addr), (size), (bit)), (bit) < (size); (bit)++)
625 (b) = find_next_bit((addr), (size), b), \
639 (b) = find_next_bit((addr), (size), (b)), \
654 (e) = find_next_bit((addr), (size), (b) + 1), \
[all …]
|
| A D | sbitmap.h | 266 nr = find_next_bit(&word, depth, nr); in __sbitmap_for_each_set()
|
| A D | bitmap.h | 641 *rs = find_next_bit(bitmap, end, *rs); in bitmap_next_set_region()
676 if (find_next_bit(bitmap, pos + len, pos) < pos + len) in bitmap_allocate_region()
|
| A D | nodemask.h | 259 return min_t(unsigned int, MAX_NUMNODES, find_next_bit(srcp->bits, MAX_NUMNODES, n+1)); in __next_node()
|
| A D | cpumask.h | 235 return find_next_bit(cpumask_bits(srcp), small_cpumask_bits, n + 1); in cpumask_next()
|
| A D | xarray.h | 1759 return find_next_bit(addr, XA_CHUNK_SIZE, offset); in xas_find_chunk()
|
| A D | mmzone.h | 2111 bit = find_next_bit(usage->subsection_map, SUBSECTIONS_PER_SECTION, idx); in pfn_section_first_valid()
|
| A D | netdevice.h | 4043 return find_next_bit(srcp, nr_bits, n + 1); in netif_attrmask_next()
4069 return find_next_bit(src1p, nr_bits, n + 1); in netif_attrmask_next_and()
4071 return find_next_bit(src2p, nr_bits, n + 1); in netif_attrmask_next_and()
|
Completed in 54 milliseconds