bsearch.c 1.2 KB

123456789101112131415161718192021222324252627282930313233343536
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * A generic implementation of binary search for the Linux kernel
  4. *
  5. * Copyright (C) 2008-2009 Ksplice, Inc.
  6. * Author: Tim Abbott <tabbott@ksplice.com>
  7. */
  8. #include <linux/export.h>
  9. #include <linux/bsearch.h>
  10. #include <linux/kprobes.h>
  11. /*
  12. * bsearch - binary search an array of elements
  13. * @key: pointer to item being searched for
  14. * @base: pointer to first element to search
  15. * @num: number of elements
  16. * @size: size of each element
  17. * @cmp: pointer to comparison function
  18. *
  19. * This function does a binary search on the given array. The
  20. * contents of the array should already be in ascending sorted order
  21. * under the provided comparison function.
  22. *
  23. * Note that the key need not have the same type as the elements in
  24. * the array, e.g. key could be a string and the comparison function
  25. * could compare the string with the struct's name field. However, if
  26. * the key and elements in the array are of the same type, you can use
  27. * the same comparison function for both sort() and bsearch().
  28. */
  29. void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp)
  30. {
  31. return __inline_bsearch(key, base, num, size, cmp);
  32. }
  33. EXPORT_SYMBOL(bsearch);
  34. NOKPROBE_SYMBOL(bsearch);