From 5ab5c3ebbdd097e1c9387721920cda44e0f37244 Mon Sep 17 00:00:00 2001
From: Cedric Roux <cedric.roux@eurecom.fr>
Date: Tue, 27 Sep 2016 17:01:54 +0200
Subject: [PATCH] delete bsearch.c and bsearch.h from source tree
they are not referenced in CMakeLists.txt (so says grep)
---
openair2/RRC/LITE/MESSAGES/bsearch.c | 57 ----------------------------
openair2/RRC/LITE/MESSAGES/bsearch.h | 9 -----
2 files changed, 66 deletions(-)
delete mode 100644 openair2/RRC/LITE/MESSAGES/bsearch.c
delete mode 100644 openair2/RRC/LITE/MESSAGES/bsearch.h
diff --git a/openair2/RRC/LITE/MESSAGES/bsearch.c b/openair2/RRC/LITE/MESSAGES/bsearch.c
deleted file mode 100644
index 9f54633d6e..0000000000
--- a/openair2/RRC/LITE/MESSAGES/bsearch.c
+++ /dev/null
@@ -1,57 +0,0 @@
-/*
- * A generic implementation of binary search for the Linux kernel
- *
- * Copyright (C) 2008-2009 Ksplice, Inc.
- * Author: Tim Abbott <tabbott@ksplice.com>
- *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License as
- * published by the Free Software Foundation; version 2.
- */
-
-#include <linux/module.h>
-#include "bsearch.h"
-
-/*
- * bsearch - binary search an array of elements
- * @key: pointer to item being searched for
- * @base: pointer to data to sort
- * @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,
- int (*cmp)(const void *key, const void *elt))
-{
- int start = 0, end = num - 1, mid, result;
-
- if (num == 0) {
- return NULL;
- }
-
- while (start <= end) {
- mid = (start + end) / 2;
- result = cmp(key, base + mid * size);
-
- if (result < 0) {
- end = mid - 1;
- } else if (result > 0) {
- start = mid + 1;
- } else {
- return (void *)base + mid * size;
- }
- }
-
- return NULL;
-}
-//EXPORT_SYMBOL(bsearch);
diff --git a/openair2/RRC/LITE/MESSAGES/bsearch.h b/openair2/RRC/LITE/MESSAGES/bsearch.h
deleted file mode 100644
index fb769a2bf4..0000000000
--- a/openair2/RRC/LITE/MESSAGES/bsearch.h
+++ /dev/null
@@ -1,9 +0,0 @@
-#ifndef _LINUX_BSEARCH_H
-#define _LINUX_BSEARCH_H
-
-#include <linux/types.h>
-
-void *bsearch(const void *key, const void *base, size_t num, size_t size,
- int (*cmp)(const void *key, const void *elt));
-
-#endif /* _LINUX_BSEARCH_H */
--
GitLab