32 lines
668 B
C
32 lines
668 B
C
/*
|
|
* This file is part of the UCB release of Plan 9. It is subject to the license
|
|
* terms in the LICENSE file found in the top-level directory of this
|
|
* distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
|
|
* part of the UCB release of Plan 9, including this file, may be copied,
|
|
* modified, propagated, or distributed except according to the terms contained
|
|
* in the LICENSE file.
|
|
*/
|
|
|
|
#include <u.h>
|
|
#include <libc.h>
|
|
|
|
Rune*
|
|
_runebsearch(Rune c, Rune *t, int n, int ne)
|
|
{
|
|
Rune *p;
|
|
int m;
|
|
|
|
while(n > 1) {
|
|
m = n/2;
|
|
p = t + m*ne;
|
|
if(c >= p[0]) {
|
|
t = p;
|
|
n = n-m;
|
|
} else
|
|
n = m;
|
|
}
|
|
if(n && c >= t[0])
|
|
return t;
|
|
return 0;
|
|
}
|