1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/****************************************************************
Copyright (C) 1997 Lucent Technologies
All Rights Reserved
Permission to use, copy, modify, and distribute this software and
its documentation for any purpose and without fee is hereby
granted, provided that the above copyright notice appear in all
copies and that both that the copyright notice and this
permission notice and warranty disclaimer appear in supporting
documentation, and that the name of Lucent or any of its entities
not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission.
LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
THIS SOFTWARE.
****************************************************************/
/* Binary search for keywords. */
/* Assuming
*
* typedef struct { char *name; ... } option_word;
* option_word keywords[] = { ... };
*
* b_search has calling sequence
*
* b_search((char *)keywords, (int)sizeof(option_word),
* (int)(number of keywords = sizeof(keywords)/sizeof(option_word),
* char **sp, char **peq)
*
* where *sp is a string that may contain a keyword.
* No keyword ==> b_search returns 0 with **sp = 0.
* Bad keyword ==> b_search returns 0 with *sp = the bad keyword.
* Keyword matched ==> b_search returns the matched option_word*,
* sets *sp to the next token (skipping '=' if present), and sets
* *peq to "=" if '=' is present and to " " otherwise.
*/
#ifdef __cplusplus
extern "C" {
#endif
#ifdef Use_tolower
#include "ctype.h"
#define Tolower(x) tolower(x)
#else
static unsigned char lc[256];
static void
lc_init(void)
{
int i;
const char *s;
for(i = 0; i < 256; i++)
lc[i] = i;
for(s = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; *s; s++)
lc[(int)*s] = *s + 'a' - 'A';
}
#define Tolower(x) lc[x]
#endif
void *
b_search_ASL(void *ow, int owsize, int n, char **sp, char **peq)
{
int c, c1, c2, n1;
char *s, *s1, *s2;
void *ow1;
static char Blank[] = " ", Eq[] = "=";
#ifndef Use_tolower
static int first = 1;
if (first) {
lc_init();
first = 0;
}
#endif
for(s = *sp; (c = *(unsigned char *)s) <= ' '; s++)
if (!c)
goto no_ow1;
/* binary search */
while(n > 0) {
ow1 = (char*)ow + (n1 = n >> 1)*owsize;
s2 = *(char **)ow1;
for(s1 = s;; s1++) {
c1 = Tolower(*(unsigned char *)s1);
if (!(c2 = *s2++)) {
if (c1 <= ' ' || c1 == '=')
goto found;
break;
}
if (c1 != c2)
break;
}
if (c1 == '=' || c1 < c2)
n = n1;
else {
n -= n1 + 1;
ow = (char*)ow1 + owsize;
}
continue;
found:
*peq = Blank;
while(*s1 && *s1 <= ' ')
s1++;
if (*s1 == '=') {
*peq = Eq;
while(*++s1 && *s1 <= ' ');
}
*sp = s1;
return ow1;
}
no_ow1:
ow1 = 0;
*sp = s;
return 0;
}
#ifdef __cplusplus
}
#endif
|
