Blame view
lib/bsearch.c
1.22 KB
a10e763b8 treewide: Replace... |
1 |
// SPDX-License-Identifier: GPL-2.0-only |
1a94dc35b lib: Add generic ... |
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 lib: Add generic ... |
7 |
*/ |
8bc3bcc93 lib: reduce the u... |
8 |
#include <linux/export.h> |
1a94dc35b lib: Add generic ... |
9 |
#include <linux/bsearch.h> |
02106f883 kprobes: Prohibit... |
10 |
#include <linux/kprobes.h> |
1a94dc35b lib: Add generic ... |
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
/* * 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(). */ |
df65bba1d lib/bsearch: Prov... |
30 |
void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp) |
1a94dc35b lib: Add generic ... |
31 |
{ |
df65bba1d lib/bsearch: Prov... |
32 |
return __inline_bsearch(key, base, num, size, cmp); |
1a94dc35b lib: Add generic ... |
33 34 |
} EXPORT_SYMBOL(bsearch); |
02106f883 kprobes: Prohibit... |
35 |
NOKPROBE_SYMBOL(bsearch); |