0001
0002 #ifndef _LINUX_BSEARCH_H
0003 #define _LINUX_BSEARCH_H
0004
0005 #include <linux/types.h>
0006
0007 static __always_inline
0008 void *__inline_bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp)
0009 {
0010 const char *pivot;
0011 int result;
0012
0013 while (num > 0) {
0014 pivot = base + (num >> 1) * size;
0015 result = cmp(key, pivot);
0016
0017 if (result == 0)
0018 return (void *)pivot;
0019
0020 if (result > 0) {
0021 base = pivot + size;
0022 num--;
0023 }
0024 num >>= 1;
0025 }
0026
0027 return NULL;
0028 }
0029
0030 extern void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp);
0031
0032 #endif