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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (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 2008 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
#include <sys/types.h>
#include <stdio.h>
#include <ctype.h>
#include "s_string.h"
#include <stdlib.h>
/* global to this file */
#define STRLEN 128UL
#define STRALLOC 128UL
#define MAXINCR 250000UL
/* buffer pool for allocating string structures */
typedef struct {
string s[STRALLOC];
size_t o;
} stralloc;
static stralloc *freep = NULL;
/* pool of freed strings */
static string *freed = NULL;
static string *s_alloc(void);
static void s_simplegrow(string *, size_t);
void
s_free(string *sp)
{
if (sp != NULL) {
sp->ptr = (char *)freed;
freed = sp;
}
}
/* allocate a string head */
static string *
s_alloc(void)
{
if (freep == NULL || freep->o >= STRALLOC) {
freep = (stralloc *)malloc(sizeof (stralloc));
if (freep == NULL) {
perror("allocating string");
exit(1);
}
freep->o = (size_t)0;
}
return (&(freep->s[freep->o++]));
}
/* create a new `short' string */
string *
s_new(void)
{
string *sp;
if (freed != NULL) {
sp = freed;
/*LINTED*/
freed = (string *)(freed->ptr);
sp->ptr = sp->base;
return (sp);
}
sp = s_alloc();
sp->base = sp->ptr = malloc(STRLEN);
if (sp->base == NULL) {
perror("allocating string");
exit(1);
}
sp->end = sp->base + STRLEN;
s_terminate(sp);
return (sp);
}
/* grow a string's allocation by at least `incr' bytes */
static void
s_simplegrow(string *sp, size_t incr)
{
char *cp;
size_t size;
/*
* take a larger increment to avoid mallocing too often
*/
if (((sp->end - sp->base) < incr) && (MAXINCR < incr))
size = (sp->end - sp->base) + incr;
else if ((sp->end - sp->base) > MAXINCR)
size = (sp->end - sp->base) + MAXINCR;
else
size = (size_t)2 * (sp->end - sp->base);
cp = realloc(sp->base, size);
if (cp == NULL) {
perror("string:");
exit(1);
}
sp->ptr = (sp->ptr - sp->base) + cp;
sp->end = cp + size;
sp->base = cp;
}
/* grow a string's allocation */
int
s_grow(string *sp, int c)
{
s_simplegrow(sp, (size_t)2);
s_putc(sp, c);
return (c);
}
/* return a string containing a character array (this had better not grow) */
string *
s_array(char *cp, size_t len)
{
string *sp = s_alloc();
sp->base = sp->ptr = cp;
sp->end = sp->base + len;
return (sp);
}
/* return a string containing a copy of the passed char array */
string*
s_copy(char *cp)
{
string *sp;
size_t len;
sp = s_alloc();
len = strlen(cp)+1;
sp->base = malloc(len);
if (sp->base == NULL) {
perror("string:");
exit(1);
}
sp->end = sp->base + len; /* point past end of allocation */
(void) strcpy(sp->base, cp);
sp->ptr = sp->end - (size_t)1; /* point to NULL terminator */
return (sp);
}
/* convert string to lower case */
void
s_tolower(string *sp)
{
char *cp;
for (cp = sp->ptr; *cp; cp++)
*cp = tolower(*cp);
}
void
s_skipwhite(string *sp)
{
while (isspace(*sp->ptr))
s_skipc(sp);
}
/* append a char array to a string */
string *
s_append(string *to, char *from)
{
if (to == NULL)
to = s_new();
if (from == NULL)
return (to);
for (; *from; from++)
s_putc(to, (int)(unsigned int)*from);
s_terminate(to);
return (to);
}
/*
* Append a logical input sequence into a string. Ignore blank and
* comment lines. Backslash preceding newline indicates continuation.
* The `lineortoken' variable indicates whether the sequence to beinput
* is a whitespace delimited token or a whole line.
*
* FILE *fp; stream to read from
* string *to; where to put token
* int lineortoken; how the sequence terminates
*
* Returns a pointer to the string or NULL. Trailing newline is stripped off.
*/
string *
s_seq_read(FILE *fp, string *to, int lineortoken)
{
int c;
int done = 0;
if (feof(fp))
return (NULL);
/* get rid of leading goo */
do {
c = getc(fp);
switch (c) {
case EOF:
if (to != NULL)
s_terminate(to);
return (NULL);
case '#':
/*LINTED*/
while ((c = getc(fp)) != '\n' && c != EOF)
continue;
break;
case ' ':
case '\t':
case '\n':
case '\r':
case '\f':
break;
default:
done = 1;
break;
}
} while (!done);
if (to == NULL)
to = s_new();
/* gather up a sequence */
for (;;) {
switch (c) {
case '\\':
c = getc(fp);
if (c != '\n') {
s_putc(to, (int)(unsigned int)'\\');
s_putc(to, c);
}
break;
case EOF:
case '\r':
case '\f':
case '\n':
s_terminate(to);
return (to);
case ' ':
case '\t':
if (lineortoken == TOKEN) {
s_terminate(to);
return (to);
}
/* fall through */
default:
s_putc(to, c);
break;
}
c = getc(fp);
}
}
string *
s_tok(string *from, char *split)
{
char *splitend = strpbrk(from->ptr, split);
if (splitend) {
string *to = s_new();
for (; from->ptr < splitend; ) {
s_putc(to, (int)(unsigned int)*from->ptr);
from->ptr++;
}
s_terminate(to);
s_restart(to);
/* LINT: warning due to lint bug */
from->ptr += strspn(from->ptr, split);
return (to);
}
else if (from->ptr[0]) {
string *to = s_clone(from);
while (*from->ptr)
from->ptr++;
return (to);
}
else
return (NULL);
}
/*
* Append an input line to a string.
*
* Returns a pointer to the string (or NULL).
* Trailing newline is left on.
*/
char *
s_read_line(FILE *fp, string *to)
{
int c;
size_t len = 0;
s_terminate(to);
/* end of input */
if (feof(fp) || (c = getc(fp)) == EOF)
return (NULL);
/* gather up a line */
for (; ; ) {
len++;
switch (c) {
case EOF:
s_terminate(to);
return (to->ptr - len);
case '\n':
s_putc(to, (int)(unsigned int)'\n');
s_terminate(to);
return (to->ptr - len);
default:
s_putc(to, c);
break;
}
c = getc(fp);
}
}
/*
* Read till eof
*/
size_t
s_read_to_eof(FILE *fp, string *to)
{
size_t got;
size_t have;
s_terminate(to);
for (; ; ) {
if (feof(fp))
break;
/* allocate room for a full buffer */
have = to->end - to->ptr;
if (have < 4096UL)
s_simplegrow(to, (size_t)4096);
/* get a buffers worth */
have = to->end - to->ptr;
got = fread(to->ptr, (size_t)1, have, fp);
if (got == (size_t)0)
break;
/* LINT: warning due to lint bug */
to->ptr += got;
}
/* null terminate the line */
s_terminate(to);
return (to->ptr - to->base);
}
/*
* Get the next field from a string. The field is delimited by white space,
* single or double quotes.
*
* string *from; string to parse
* string *to; where to put parsed token
*/
string *
s_parse(string *from, string *to)
{
while (isspace(*from->ptr))
from->ptr++;
if (*from->ptr == '\0')
return (NULL);
if (to == NULL)
to = s_new();
if (*from->ptr == '\'') {
from->ptr++;
for (; *from->ptr != '\'' && *from->ptr != '\0'; from->ptr++)
s_putc(to, (int)(unsigned int)*from->ptr);
if (*from->ptr == '\'')
from->ptr++;
} else if (*from->ptr == '"') {
from->ptr++;
for (; *from->ptr != '"' && *from->ptr != '\0'; from->ptr++)
s_putc(to, (int)(unsigned int)*from->ptr);
if (*from->ptr == '"')
from->ptr++;
} else {
for (; !isspace(*from->ptr) && *from->ptr != '\0'; from->ptr++)
s_putc(to, (int)(unsigned int)*from->ptr);
}
s_terminate(to);
return (to);
}
|