Blame view
lib/bsearch.c
1.42 KB
a10e763b8
|
1 |
// SPDX-License-Identifier: GPL-2.0-only |
1a94dc35b
|
2 3 4 5 6 |
/* * A generic implementation of binary search for the Linux kernel * * Copyright (C) 2008-2009 Ksplice, Inc. * Author: Tim Abbott <tabbott@ksplice.com> |
1a94dc35b
|
7 |
*/ |
8bc3bcc93
|
8 |
#include <linux/export.h> |
1a94dc35b
|
9 |
#include <linux/bsearch.h> |
02106f883
|
10 |
#include <linux/kprobes.h> |
1a94dc35b
|
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
/* * 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, |
e8877ec5d
|
31 |
cmp_func_t cmp) |
1a94dc35b
|
32 |
{ |
166a0f780
|
33 |
const char *pivot; |
1a94dc35b
|
34 |
int result; |
166a0f780
|
35 36 37 |
while (num > 0) { pivot = base + (num >> 1) * size; result = cmp(key, pivot); |
1a94dc35b
|
38 |
|
166a0f780
|
39 40 41 42 43 44 45 46 |
if (result == 0) return (void *)pivot; if (result > 0) { base = pivot + size; num--; } num >>= 1; |
1a94dc35b
|
47 48 49 50 51 |
} return NULL; } EXPORT_SYMBOL(bsearch); |
02106f883
|
52 |
NOKPROBE_SYMBOL(bsearch); |