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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
|
/*-
* Copyright (c) 2012,2013 Kai Wang
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "ld.h"
#include "ld_strtab.h"
ELFTC_VCSID("$Id: ld_strtab.c 3279 2015-12-11 21:39:16Z kaiwang27 $");
#define _DEFAULT_STRTAB_SIZE 512
struct ld_str {
char *s;
size_t off, len;
UT_hash_handle hh;
};
struct ld_strtab {
struct ld_str *st_pool;
char *st_buf;
size_t st_cap;
size_t st_size;
unsigned char st_suffix;
};
static void _resize_strtab(struct ld *ld, struct ld_strtab *st,
size_t newsize);
struct ld_strtab *
ld_strtab_alloc(struct ld *ld, unsigned char suffix)
{
struct ld_strtab *st;
if ((st = calloc(1, sizeof(*st))) == NULL)
ld_fatal_std(ld, "calloc");
st->st_size = 0;
if (suffix) {
st->st_suffix = 1;
st->st_cap = _DEFAULT_STRTAB_SIZE;
if ((st->st_buf = calloc(1, st->st_cap)) == NULL)
ld_fatal_std(ld, "calloc");
ld_strtab_insert(ld, st, "");
} else
st->st_size = 1;
return (st);
}
void
ld_strtab_free(struct ld_strtab *st)
{
struct ld_str *str, *tmp;
if (st == NULL)
return;
if (st->st_pool != NULL) {
HASH_ITER(hh, st->st_pool, str, tmp) {
HASH_DELETE(hh, st->st_pool, str);
free(str->s);
free(str);
}
}
free(st->st_buf);
free(st);
}
char *
ld_strtab_getbuf(struct ld *ld, struct ld_strtab *st)
{
struct ld_str *str, *tmp;
char *p, *end;
assert(st != NULL);
if (st->st_suffix)
return (st->st_buf);
if (st->st_buf == NULL) {
if ((st->st_buf = malloc(st->st_size)) == NULL)
ld_fatal_std(ld, "malloc");
/* Flatten the string hash table. */
p = st->st_buf;
end = p + st->st_size;
*p++ = '\0';
HASH_ITER(hh, st->st_pool, str, tmp) {
memcpy(p, str->s, str->len);
p[str->len] = '\0';
p += str->len + 1;
}
assert(p == end);
}
return (st->st_buf);
}
size_t
ld_strtab_getsize(struct ld_strtab *st)
{
return (st->st_size);
}
static void
_resize_strtab(struct ld *ld, struct ld_strtab *st, size_t newsize)
{
assert(st != NULL && st->st_suffix);
if ((st->st_buf = realloc(st->st_buf, newsize)) == NULL)
ld_fatal_std(ld, "realloc");
st->st_cap = newsize;
}
size_t
ld_strtab_insert_no_suffix(struct ld *ld, struct ld_strtab *st, char *s)
{
struct ld_str *str;
assert(st != NULL && st->st_suffix == 0);
if (s == NULL)
return (0);
if (*s == '\0')
return (0);
HASH_FIND_STR(st->st_pool, s, str);
if (str != NULL)
return (str->off);
if ((str = calloc(1, sizeof(*str))) == NULL)
ld_fatal_std(ld, "calloc");
if ((str->s = strdup(s)) == NULL)
ld_fatal_std(ld, "strdup");
str->len = strlen(s);
HASH_ADD_KEYPTR(hh, st->st_pool, str->s, str->len, str);
str->off = st->st_size;
st->st_size += str->len + 1;
return (str->off);
}
void
ld_strtab_insert(struct ld *ld, struct ld_strtab *st, const char *s)
{
const char *r;
char *b, *c;
size_t len, slen;
int append;
assert(st != NULL && st->st_buf != NULL && st->st_suffix);
if (s == NULL)
return;
slen = strlen(s);
append = 0;
b = st->st_buf;
for (c = b; c < b + st->st_size;) {
len = strlen(c);
if (!append && len >= slen) {
r = c + (len - slen);
if (strcmp(r, s) == 0)
return;
} else if (len < slen && len != 0) {
r = s + (slen - len);
if (strcmp(c, r) == 0) {
st->st_size -= len + 1;
memmove(c, c + len + 1, st->st_size - (c - b));
append = 1;
continue;
}
}
c += len + 1;
}
while (st->st_size + slen + 1 >= st->st_cap)
_resize_strtab(ld, st, st->st_cap * 2);
b = st->st_buf;
strncpy(&b[st->st_size], s, slen);
b[st->st_size + slen] = '\0';
st->st_size += slen + 1;
}
size_t
ld_strtab_lookup(struct ld_strtab *st, const char *s)
{
const char *b, *c, *r;
size_t len, slen;
assert(st != NULL && st->st_buf != NULL && st->st_suffix);
if (s == NULL)
return (0);
slen = strlen(s);
b = st->st_buf;
for (c = b; c < b + st->st_size;) {
len = strlen(c);
if (len >= slen) {
r = c + (len - slen);
if (strcmp(r, s) == 0)
return (r - b);
}
c += len + 1;
}
return (-1);
}
|
