Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
O
OpenXG UE
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Michael Black
OpenXG UE
Commits
025cc6bb
Commit
025cc6bb
authored
Sep 27, 2016
by
Cedric Roux
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
delete bsearch.c and bsearch.h from source tree
they are not referenced in CMakeLists.txt (so says grep)
parent
09feaadb
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
0 additions
and
66 deletions
+0
-66
openair2/RRC/LITE/MESSAGES/bsearch.c
openair2/RRC/LITE/MESSAGES/bsearch.c
+0
-57
openair2/RRC/LITE/MESSAGES/bsearch.h
openair2/RRC/LITE/MESSAGES/bsearch.h
+0
-9
No files found.
openair2/RRC/LITE/MESSAGES/bsearch.c
deleted
100644 → 0
View file @
09feaadb
/*
* 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);
openair2/RRC/LITE/MESSAGES/bsearch.h
deleted
100644 → 0
View file @
09feaadb
#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 */
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment