forked from mirrors/linux
		
	 df65bba1dc
			
		
	
	
		df65bba1dc
		
	
	
	
	
		
			
			For code that needs the ultimate performance (it can inline the @cmp function too) or simply needs to avoid calling external functions for whatever reason, provide an __always_inline variant of bsearch(). [ tglx: Renamed to __inline_bsearch() as suggested by Andy ] Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Alexandre Chartre <alexandre.chartre@oracle.com> Acked-by: Andy Lutomirski <luto@kernel.org> Link: https://lkml.kernel.org/r/20200505135313.624443814@linutronix.de
		
			
				
	
	
		
			32 lines
		
	
	
	
		
			624 B
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			32 lines
		
	
	
	
		
			624 B
		
	
	
	
		
			C
		
	
	
	
	
	
| /* SPDX-License-Identifier: GPL-2.0 */
 | |
| #ifndef _LINUX_BSEARCH_H
 | |
| #define _LINUX_BSEARCH_H
 | |
| 
 | |
| #include <linux/types.h>
 | |
| 
 | |
| static __always_inline
 | |
| void *__inline_bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp)
 | |
| {
 | |
| 	const char *pivot;
 | |
| 	int result;
 | |
| 
 | |
| 	while (num > 0) {
 | |
| 		pivot = base + (num >> 1) * size;
 | |
| 		result = cmp(key, pivot);
 | |
| 
 | |
| 		if (result == 0)
 | |
| 			return (void *)pivot;
 | |
| 
 | |
| 		if (result > 0) {
 | |
| 			base = pivot + size;
 | |
| 			num--;
 | |
| 		}
 | |
| 		num >>= 1;
 | |
| 	}
 | |
| 
 | |
| 	return NULL;
 | |
| }
 | |
| 
 | |
| extern void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp);
 | |
| 
 | |
| #endif /* _LINUX_BSEARCH_H */
 |