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
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
|
/* $RCSfile: str.c,v $$Revision: 1.1.1.1 $$Date: 1993/08/23 21:30:09 $
*
* Copyright (c) 1991, Larry Wall
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
*
* $Log: str.c,v $
* Revision 1.1.1.1 1993/08/23 21:30:09 nate
* PERL!
*
* Revision 4.0.1.1 91/06/07 12:20:08 lwall
* patch4: new copyright notice
*
* Revision 4.0 91/03/20 01:58:15 lwall
* 4.0 baseline.
*
*/
#include "handy.h"
#include "EXTERN.h"
#include "util.h"
#include "a2p.h"
str_numset(str,num)
register STR *str;
double num;
{
str->str_nval = num;
str->str_pok = 0; /* invalidate pointer */
str->str_nok = 1; /* validate number */
}
char *
str_2ptr(str)
register STR *str;
{
register char *s;
if (!str)
return "";
GROWSTR(&(str->str_ptr), &(str->str_len), 24);
s = str->str_ptr;
if (str->str_nok) {
sprintf(s,"%.20g",str->str_nval);
while (*s) s++;
}
*s = '\0';
str->str_cur = s - str->str_ptr;
str->str_pok = 1;
#ifdef DEBUGGING
if (debug & 32)
fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
#endif
return str->str_ptr;
}
double
str_2num(str)
register STR *str;
{
if (!str)
return 0.0;
if (str->str_len && str->str_pok)
str->str_nval = atof(str->str_ptr);
else
str->str_nval = 0.0;
str->str_nok = 1;
#ifdef DEBUGGING
if (debug & 32)
fprintf(stderr,"0x%lx num(%g)\n",str,str->str_nval);
#endif
return str->str_nval;
}
str_sset(dstr,sstr)
STR *dstr;
register STR *sstr;
{
if (!sstr)
str_nset(dstr,No,0);
else if (sstr->str_nok)
str_numset(dstr,sstr->str_nval);
else if (sstr->str_pok)
str_nset(dstr,sstr->str_ptr,sstr->str_cur);
else
str_nset(dstr,"",0);
}
str_nset(str,ptr,len)
register STR *str;
register char *ptr;
register int len;
{
GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
bcopy(ptr,str->str_ptr,len);
str->str_cur = len;
*(str->str_ptr+str->str_cur) = '\0';
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
}
str_set(str,ptr)
register STR *str;
register char *ptr;
{
register int len;
if (!ptr)
ptr = "";
len = strlen(ptr);
GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
bcopy(ptr,str->str_ptr,len+1);
str->str_cur = len;
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
}
str_chop(str,ptr) /* like set but assuming ptr is in str */
register STR *str;
register char *ptr;
{
if (!(str->str_pok))
str_2ptr(str);
str->str_cur -= (ptr - str->str_ptr);
bcopy(ptr,str->str_ptr, str->str_cur + 1);
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
}
str_ncat(str,ptr,len)
register STR *str;
register char *ptr;
register int len;
{
if (!(str->str_pok))
str_2ptr(str);
GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
bcopy(ptr,str->str_ptr+str->str_cur,len);
str->str_cur += len;
*(str->str_ptr+str->str_cur) = '\0';
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
}
str_scat(dstr,sstr)
STR *dstr;
register STR *sstr;
{
if (!(sstr->str_pok))
str_2ptr(sstr);
if (sstr)
str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
}
str_cat(str,ptr)
register STR *str;
register char *ptr;
{
register int len;
if (!ptr)
return;
if (!(str->str_pok))
str_2ptr(str);
len = strlen(ptr);
GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
bcopy(ptr,str->str_ptr+str->str_cur,len+1);
str->str_cur += len;
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
}
char *
str_append_till(str,from,delim,keeplist)
register STR *str;
register char *from;
register int delim;
char *keeplist;
{
register char *to;
register int len;
if (!from)
return Nullch;
len = strlen(from);
GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
to = str->str_ptr+str->str_cur;
for (; *from; from++,to++) {
if (*from == '\\' && from[1] && delim != '\\') {
if (!keeplist) {
if (from[1] == delim || from[1] == '\\')
from++;
else
*to++ = *from++;
}
else if (index(keeplist,from[1]))
*to++ = *from++;
else
from++;
}
else if (*from == delim)
break;
*to = *from;
}
*to = '\0';
str->str_cur = to - str->str_ptr;
return from;
}
STR *
str_new(len)
int len;
{
register STR *str;
if (freestrroot) {
str = freestrroot;
freestrroot = str->str_link.str_next;
}
else {
str = (STR *) safemalloc(sizeof(STR));
bzero((char*)str,sizeof(STR));
}
if (len)
GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
return str;
}
void
str_grow(str,len)
register STR *str;
int len;
{
if (len && str)
GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
}
/* make str point to what nstr did */
void
str_replace(str,nstr)
register STR *str;
register STR *nstr;
{
safefree(str->str_ptr);
str->str_ptr = nstr->str_ptr;
str->str_len = nstr->str_len;
str->str_cur = nstr->str_cur;
str->str_pok = nstr->str_pok;
if (str->str_nok = nstr->str_nok)
str->str_nval = nstr->str_nval;
safefree((char*)nstr);
}
void
str_free(str)
register STR *str;
{
if (!str)
return;
if (str->str_len)
str->str_ptr[0] = '\0';
str->str_cur = 0;
str->str_nok = 0;
str->str_pok = 0;
str->str_link.str_next = freestrroot;
freestrroot = str;
}
str_len(str)
register STR *str;
{
if (!str)
return 0;
if (!(str->str_pok))
str_2ptr(str);
if (str->str_len)
return str->str_cur;
else
return 0;
}
char *
str_gets(str,fp)
register STR *str;
register FILE *fp;
{
#ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
register char *bp; /* we're going to steal some values */
register int cnt; /* from the stdio struct and put EVERYTHING */
register STDCHAR *ptr; /* in the innermost loop into registers */
register char newline = '\n'; /* (assuming at least 6 registers) */
int i;
int bpx;
cnt = fp->_cnt; /* get count into register */
str->str_nok = 0; /* invalidate number */
str->str_pok = 1; /* validate pointer */
if (str->str_len <= cnt) /* make sure we have the room */
GROWSTR(&(str->str_ptr), &(str->str_len), cnt+1);
bp = str->str_ptr; /* move these two too to registers */
ptr = fp->_ptr;
for (;;) {
while (--cnt >= 0) {
if ((*bp++ = *ptr++) == newline)
if (bp <= str->str_ptr || bp[-2] != '\\')
goto thats_all_folks;
else {
line++;
bp -= 2;
}
}
fp->_cnt = cnt; /* deregisterize cnt and ptr */
fp->_ptr = ptr;
i = _filbuf(fp); /* get more characters */
cnt = fp->_cnt;
ptr = fp->_ptr; /* reregisterize cnt and ptr */
bpx = bp - str->str_ptr; /* prepare for possible relocation */
GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + cnt + 1);
bp = str->str_ptr + bpx; /* reconstitute our pointer */
if (i == newline) { /* all done for now? */
*bp++ = i;
goto thats_all_folks;
}
else if (i == EOF) /* all done for ever? */
goto thats_all_folks;
*bp++ = i; /* now go back to screaming loop */
}
thats_all_folks:
fp->_cnt = cnt; /* put these back or we're in trouble */
fp->_ptr = ptr;
*bp = '\0';
str->str_cur = bp - str->str_ptr; /* set length */
#else /* !STDSTDIO */ /* The big, slow, and stupid way */
static char buf[4192];
if (fgets(buf, sizeof buf, fp) != Nullch)
str_set(str, buf);
else
str_set(str, No);
#endif /* STDSTDIO */
return str->str_cur ? str->str_ptr : Nullch;
}
void
str_inc(str)
register STR *str;
{
register char *d;
if (!str)
return;
if (str->str_nok) {
str->str_nval += 1.0;
str->str_pok = 0;
return;
}
if (!str->str_pok) {
str->str_nval = 1.0;
str->str_nok = 1;
return;
}
for (d = str->str_ptr; *d && *d != '.'; d++) ;
d--;
if (!isdigit(*str->str_ptr) || !isdigit(*d) ) {
str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
return;
}
while (d >= str->str_ptr) {
if (++*d <= '9')
return;
*(d--) = '0';
}
/* oh,oh, the number grew */
GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + 2);
str->str_cur++;
for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
*d = d[-1];
*d = '1';
}
void
str_dec(str)
register STR *str;
{
register char *d;
if (!str)
return;
if (str->str_nok) {
str->str_nval -= 1.0;
str->str_pok = 0;
return;
}
if (!str->str_pok) {
str->str_nval = -1.0;
str->str_nok = 1;
return;
}
for (d = str->str_ptr; *d && *d != '.'; d++) ;
d--;
if (!isdigit(*str->str_ptr) || !isdigit(*d) || (*d == '0' && d == str->str_ptr)) {
str_numset(str,atof(str->str_ptr) - 1.0); /* punt */
return;
}
while (d >= str->str_ptr) {
if (--*d >= '0')
return;
*(d--) = '9';
}
}
/* make a string that will exist for the duration of the expression eval */
STR *
str_mortal(oldstr)
STR *oldstr;
{
register STR *str = str_new(0);
static long tmps_size = -1;
str_sset(str,oldstr);
if (++tmps_max > tmps_size) {
tmps_size = tmps_max;
if (!(tmps_size & 127)) {
if (tmps_size)
tmps_list = (STR**)saferealloc((char*)tmps_list,
(tmps_size + 128) * sizeof(STR*) );
else
tmps_list = (STR**)safemalloc(128 * sizeof(char*));
}
}
tmps_list[tmps_max] = str;
return str;
}
STR *
str_make(s)
char *s;
{
register STR *str = str_new(0);
str_set(str,s);
return str;
}
STR *
str_nmake(n)
double n;
{
register STR *str = str_new(0);
str_numset(str,n);
return str;
}
|