diff options
| author | Thomas Gleixner <tglx@linutronix.de> | 2020-06-11 15:17:57 +0200 | 
|---|---|---|
| committer | Thomas Gleixner <tglx@linutronix.de> | 2020-06-11 15:17:57 +0200 | 
| commit | f77d26a9fc525286bcef3d4f98b52e17482cf49c (patch) | |
| tree | 6b179c9aa84787773cb601a14a64255e2912154b /lib/bsearch.c | |
| parent | b6bea24d41519e8c31e4798f1c1a3f67e540c5d0 (diff) | |
| parent | f0178fc01fe46bab6a95415f5647d1a74efcad1b (diff) | |
Merge branch 'x86/entry' into ras/core
to fixup conflicts in arch/x86/kernel/cpu/mce/core.c so MCE specific follow
up patches can be applied without creating a horrible merge conflict
afterwards.
Diffstat (limited to 'lib/bsearch.c')
| -rw-r--r-- | lib/bsearch.c | 22 | 
1 files changed, 2 insertions, 20 deletions
diff --git a/lib/bsearch.c b/lib/bsearch.c index 8b3aae5ae77a..bf86aa66f2b2 100644 --- a/lib/bsearch.c +++ b/lib/bsearch.c @@ -28,27 +28,9 @@   * 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) +void *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; +	return __inline_bsearch(key, base, num, size, cmp);  }  EXPORT_SYMBOL(bsearch);  NOKPROBE_SYMBOL(bsearch);  | 
