| /Linux-v5.4/include/asm-generic/bitops/ | 
| D | find.h | 5 #ifndef find_next_bit15 extern unsigned long find_next_bit(const unsigned long *addr, unsigned long
 75 #define find_first_bit(addr, size) find_next_bit((addr), (size), 0)
 
 | 
| D | le.h | 21 	return find_next_bit(addr, size, offset);  in find_next_bit_le()
 | 
| /Linux-v5.4/tools/include/linux/ | 
| D | bitops.h | 38 	     (bit) = find_next_bit((addr), (size), (bit) + 1))47 	for ((bit) = find_next_bit((addr), (size), (bit));	\
 49 	     (bit) = find_next_bit((addr), (size), (bit) + 1))
 
 | 
| /Linux-v5.4/tools/lib/ | 
| D | find_bit.c | 21 #if !defined(find_next_bit) || !defined(find_next_zero_bit) || \64 #ifndef find_next_bit
 68 unsigned long find_next_bit(const unsigned long *addr, unsigned long size,  in find_next_bit()  function
 
 | 
| D | bitmap.c | 42 		cur = find_next_bit(bitmap, nbits, cur + 1);  in bitmap_scnprintf()
 | 
| /Linux-v5.4/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()
 | 
| /Linux-v5.4/tools/include/asm-generic/bitops/ | 
| D | find.h | 5 #ifndef find_next_bit15 extern unsigned long find_next_bit(const unsigned long *addr, unsigned long
 
 | 
| /Linux-v5.4/arch/unicore32/include/asm/ | 
| D | bitops.h | 39 #define find_next_bit		find_next_bit  macro
 | 
| /Linux-v5.4/include/linux/ | 
| D | bitops.h | 31 	     (bit) = find_next_bit((addr), (size), (bit) + 1))35 	for ((bit) = find_next_bit((addr), (size), (bit));	\
 37 	     (bit) = find_next_bit((addr), (size), (bit) + 1))
 
 | 
| /Linux-v5.4/arch/unicore32/lib/ | 
| D | findbit.S | 74 ENTRY(find_next_bit)85 ENDPROC(find_next_bit)
 
 | 
| /Linux-v5.4/mm/ | 
| D | percpu-stats.c | 89 			end = find_next_bit(chunk->bound_map, last_alloc,  in chunk_map_stats()93 			end = find_next_bit(chunk->alloc_map, last_alloc,  in chunk_map_stats()
 
 | 
| /Linux-v5.4/arch/mips/kvm/ | 
| D | interrupt.c | 220 		priority = find_next_bit(pending_clr,  in kvm_mips_deliver_interrupts()232 		priority = find_next_bit(pending,  in kvm_mips_deliver_interrupts()
 
 | 
| /Linux-v5.4/arch/arm/include/asm/ | 
| D | bitops.h | 203 #define find_next_bit(p,sz,off)		_find_next_bit_le(p,sz,off)  macro212 #define find_next_bit(p,sz,off)		_find_next_bit_be(p,sz,off)  macro
 
 | 
| /Linux-v5.4/arch/unicore32/kernel/ | 
| D | ksyms.c | 26 EXPORT_SYMBOL(find_next_bit);
 | 
| /Linux-v5.4/arch/m68k/include/asm/ | 
| D | bitops.h | 398 static inline int find_next_bit(const unsigned long *vaddr, int size,  in find_next_bit()  function426 #define find_next_bit find_next_bit  macro
 
 | 
| /Linux-v5.4/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()
 
 | 
| /Linux-v5.4/arch/powerpc/platforms/pasemi/ | 
| D | dma_lib.c | 120 	bit = find_next_bit(txch_free, MAX_TXCH, start);  in pasemi_alloc_tx_chan()378 	bit = find_next_bit(flags_free, MAX_FLAGS, 0);  in pasemi_dma_alloc_flag()
 443 	bit = find_next_bit(fun_free, MAX_FLAGS, 0);  in pasemi_dma_alloc_fun()
 
 | 
| /Linux-v5.4/drivers/iio/dummy/ | 
| D | iio_simple_dummy_buffer.c | 78 			j = find_next_bit(indio_dev->active_scan_mask,  in iio_simple_dummy_trigger_h()
 | 
| /Linux-v5.4/fs/ocfs2/dlm/ | 
| D | dlmdomain.c | 538 	while ((node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES,  in __dlm_print_nodes()614 		node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES, node + 1);  in dlm_begin_exit_domain()
 639 	while ((node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES,  in dlm_leave_domain()
 1050 	if (find_next_bit(node_map, O2NM_MAX_NODES, 0) >= O2NM_MAX_NODES)  in dlm_send_regions()
 1073 	while ((i = find_next_bit(node_map, O2NM_MAX_NODES,  in dlm_send_regions()
 1222 	if (find_next_bit(node_map, O2NM_MAX_NODES, 0) >= O2NM_MAX_NODES)  in dlm_send_nodeinfo()
 1251 	while ((i = find_next_bit(node_map, O2NM_MAX_NODES,  in dlm_send_nodeinfo()
 1395 	while ((node = find_next_bit(node_map, O2NM_MAX_NODES,  in dlm_send_join_cancels()
 1535 	while ((node = find_next_bit(node_map, O2NM_MAX_NODES,  in dlm_send_join_asserts()
 1619 	while ((node = find_next_bit(ctxt->live_map, O2NM_MAX_NODES,  in dlm_try_to_join_domain()
 
 | 
| D | dlmmaster.c | 866 		bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0);  in dlm_get_lock_resource()917 		bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0);  in dlm_get_lock_resource()
 1084 			bit = find_next_bit(mle->maybe_map, O2NM_MAX_NODES, 0);  in dlm_wait_for_lock_mastery()
 1190 	bit = find_next_bit(iter->diff_bm, O2NM_MAX_NODES,  in dlm_bitmap_diff_iter_next()
 1239 				int lowest = find_next_bit(mle->maybe_map,  in dlm_restart_lock_mastery()
 1249 					lowest = find_next_bit(mle->maybe_map,  in dlm_restart_lock_mastery()
 1800 		int bit = find_next_bit (mle->maybe_map, O2NM_MAX_NODES, 0);  in dlm_assert_master_handler()
 1916 			while ((nn = find_next_bit (mle->response_map, O2NM_MAX_NODES,  in dlm_assert_master_handler()
 2110 			bit = find_next_bit(nodemap, O2NM_MAX_NODES,  in dlm_assert_master_worker()
 2526 		node_ref = find_next_bit(res->refmap, O2NM_MAX_NODES, 0);  in dlm_is_lockres_migratable()
 [all …]
 
 | 
| /Linux-v5.4/arch/hexagon/kernel/ | 
| D | smp.c | 43 		msg = find_next_bit(ops, BITS_PER_LONG, msg+1);  in __handle_ipi()
 | 
| /Linux-v5.4/arch/ia64/include/asm/ | 
| D | mmu_context.h | 96 			ia64_ctx.limit = find_next_bit(ia64_ctx.bitmap,  in get_mmu_context()
 | 
| /Linux-v5.4/security/selinux/ss/ | 
| D | ebitmap.h | 71 	ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1);  in ebitmap_next_positive()
 |