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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright (c) 2000-2001 by Sun Microsystems, Inc.
* All rights reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* String list maintenance and binary search routines
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define ALLOCCHUNK 128
struct itemlist {
char **items;
int nallocated;
int nused;
int sorted;
};
#include "binsearch.h"
itemlist
new_itemlist(void)
{
itemlist x = malloc(sizeof (struct itemlist));
x->nallocated = x->nused = 0;
x->sorted = 1;
x->items = 0;
return (x);
}
void
item_add(itemlist l, char *s)
{
if (l->nallocated < 0) {
char **new;
l->nallocated = l->nused + ALLOCCHUNK;
new = malloc(sizeof (char *) * l->nused);
memcpy(new, l->items, l->nused * sizeof (char *));
l->items = new;
} else if (l->nallocated == l->nused) {
if (l->nallocated)
l->nallocated *= 2;
else
l->nallocated = ALLOCCHUNK;
l->items = realloc(l->items, sizeof (char *) * l->nallocated);
}
l->items[l->nused++] = s;
l->sorted = l->nused <= 1;
}
void
item_add_list(itemlist l, char **s, int n, int alloc)
{
if (l->nallocated == 0) {
l->items = s;
l->nallocated = alloc ? n : -1;
l->nused = n;
l->sorted = 0;
} else {
int i;
for (i = 0; i < n; i++)
item_add(l, s[i]);
if (alloc)
free(s);
}
}
int
item_addfile(itemlist l, const char *fname)
{
FILE *f = fopen(fname, "r");
char buf[10240];
if (f == NULL)
return (-1);
while (fgets(buf, sizeof (buf), f) != NULL) {
if (buf[0] == '#' || buf[0] == '\n')
continue;
buf[strlen(buf)-1] = '\0';
item_add(l, strdup(buf));
}
fclose(f);
return (0);
}
static int
xcmp(const void *s1, const void *s2)
{
return (strcmp(*(char **)s1, *(char **)s2));
}
int
item_search(itemlist l, const char *s)
{
int lo = 0;
int hi = l->nused - 1;
if (!l->sorted) {
qsort(l->items, l->nused, sizeof (char *), xcmp);
l->sorted = 1;
}
while (lo <= hi) {
int mid = (lo + hi) / 2;
int res = strcmp(s, l->items[mid]);
if (res == 0)
return (mid);
else if (res < 0)
hi = mid - 1;
else
lo = mid + 1;
}
return (-1);
}
char
*item_get(itemlist l, int i)
{
if (i >= l->nused || i < 0)
return (NULL);
else
return (l->items[i]);
}
|
