mirror of
				git://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
				synced 2025-10-31 16:54:21 +00:00 
			
		
		
		
	 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
		
			
				
	
	
		
			36 lines
		
	
	
	
		
			1.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			36 lines
		
	
	
	
		
			1.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| // SPDX-License-Identifier: GPL-2.0-only
 | |
| /*
 | |
|  * A generic implementation of binary search for the Linux kernel
 | |
|  *
 | |
|  * Copyright (C) 2008-2009 Ksplice, Inc.
 | |
|  * Author: Tim Abbott <tabbott@ksplice.com>
 | |
|  */
 | |
| 
 | |
| #include <linux/export.h>
 | |
| #include <linux/bsearch.h>
 | |
| #include <linux/kprobes.h>
 | |
| 
 | |
| /*
 | |
|  * bsearch - binary search an array of elements
 | |
|  * @key: pointer to item being searched for
 | |
|  * @base: pointer to first element to search
 | |
|  * @num: number of elements
 | |
|  * @size: size of each element
 | |
|  * @cmp: pointer to comparison function
 | |
|  *
 | |
|  * This function does a binary search on the given array.  The
 | |
|  * contents of the array should already be in ascending sorted order
 | |
|  * under the provided comparison function.
 | |
|  *
 | |
|  * Note that the key need not have the same type as the elements in
 | |
|  * the array, e.g. key could be a string and the comparison function
 | |
|  * could compare the string with the struct's name field.  However, if
 | |
|  * the key and elements in the array are of the same type, you can use
 | |
|  * the same comparison function for both sort() and bsearch().
 | |
|  */
 | |
| void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp)
 | |
| {
 | |
| 	return __inline_bsearch(key, base, num, size, cmp);
 | |
| }
 | |
| EXPORT_SYMBOL(bsearch);
 | |
| NOKPROBE_SYMBOL(bsearch);
 |