perl5.000 patch.0e: fix various non-broken things in the x2p/ directory
[p5sagit/p5-mst-13.2.git] / x2p / str.c
CommitLineData
79072805 1/* $RCSfile: str.c,v $$Revision: 4.1 $$Date: 92/08/07 18:29:26 $
a687059c 2 *
d48672a2 3 * Copyright (c) 1991, Larry Wall
a687059c 4 *
d48672a2 5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
8d063cd8 7 *
8 * $Log: str.c,v $
8d063cd8 9 */
10
8d063cd8 11#include "EXTERN.h"
8d063cd8 12#include "a2p.h"
9c8d0b29 13#include "util.h"
8d063cd8 14
9c8d0b29 15void
8d063cd8 16str_numset(str,num)
17register STR *str;
18double num;
19{
20 str->str_nval = num;
21 str->str_pok = 0; /* invalidate pointer */
22 str->str_nok = 1; /* validate number */
23}
24
25char *
26str_2ptr(str)
27register STR *str;
28{
29 register char *s;
30
31 if (!str)
32 return "";
33 GROWSTR(&(str->str_ptr), &(str->str_len), 24);
34 s = str->str_ptr;
35 if (str->str_nok) {
36 sprintf(s,"%.20g",str->str_nval);
37 while (*s) s++;
38 }
39 *s = '\0';
40 str->str_cur = s - str->str_ptr;
41 str->str_pok = 1;
42#ifdef DEBUGGING
43 if (debug & 32)
44 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
45#endif
46 return str->str_ptr;
47}
48
49double
50str_2num(str)
51register STR *str;
52{
53 if (!str)
54 return 0.0;
55 if (str->str_len && str->str_pok)
56 str->str_nval = atof(str->str_ptr);
57 else
58 str->str_nval = 0.0;
59 str->str_nok = 1;
60#ifdef DEBUGGING
61 if (debug & 32)
62 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_nval);
63#endif
64 return str->str_nval;
65}
66
9c8d0b29 67void
8d063cd8 68str_sset(dstr,sstr)
69STR *dstr;
70register STR *sstr;
71{
72 if (!sstr)
73 str_nset(dstr,No,0);
74 else if (sstr->str_nok)
75 str_numset(dstr,sstr->str_nval);
76 else if (sstr->str_pok)
77 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
78 else
79 str_nset(dstr,"",0);
80}
81
9c8d0b29 82void
8d063cd8 83str_nset(str,ptr,len)
84register STR *str;
85register char *ptr;
86register int len;
87{
88 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
89 bcopy(ptr,str->str_ptr,len);
90 str->str_cur = len;
91 *(str->str_ptr+str->str_cur) = '\0';
92 str->str_nok = 0; /* invalidate number */
93 str->str_pok = 1; /* validate pointer */
94}
95
9c8d0b29 96void
8d063cd8 97str_set(str,ptr)
98register STR *str;
99register char *ptr;
100{
101 register int len;
102
103 if (!ptr)
104 ptr = "";
105 len = strlen(ptr);
106 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
107 bcopy(ptr,str->str_ptr,len+1);
108 str->str_cur = len;
109 str->str_nok = 0; /* invalidate number */
110 str->str_pok = 1; /* validate pointer */
111}
112
9c8d0b29 113void
8d063cd8 114str_chop(str,ptr) /* like set but assuming ptr is in str */
115register STR *str;
116register char *ptr;
117{
118 if (!(str->str_pok))
119 str_2ptr(str);
120 str->str_cur -= (ptr - str->str_ptr);
121 bcopy(ptr,str->str_ptr, str->str_cur + 1);
122 str->str_nok = 0; /* invalidate number */
123 str->str_pok = 1; /* validate pointer */
124}
125
9c8d0b29 126void
8d063cd8 127str_ncat(str,ptr,len)
128register STR *str;
129register char *ptr;
130register int len;
131{
132 if (!(str->str_pok))
133 str_2ptr(str);
134 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
135 bcopy(ptr,str->str_ptr+str->str_cur,len);
136 str->str_cur += len;
137 *(str->str_ptr+str->str_cur) = '\0';
138 str->str_nok = 0; /* invalidate number */
139 str->str_pok = 1; /* validate pointer */
140}
141
9c8d0b29 142void
8d063cd8 143str_scat(dstr,sstr)
144STR *dstr;
145register STR *sstr;
146{
147 if (!(sstr->str_pok))
148 str_2ptr(sstr);
149 if (sstr)
150 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
151}
152
9c8d0b29 153void
8d063cd8 154str_cat(str,ptr)
155register STR *str;
156register char *ptr;
157{
158 register int len;
159
160 if (!ptr)
161 return;
162 if (!(str->str_pok))
163 str_2ptr(str);
164 len = strlen(ptr);
165 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
166 bcopy(ptr,str->str_ptr+str->str_cur,len+1);
167 str->str_cur += len;
168 str->str_nok = 0; /* invalidate number */
169 str->str_pok = 1; /* validate pointer */
170}
171
172char *
173str_append_till(str,from,delim,keeplist)
174register STR *str;
175register char *from;
176register int delim;
177char *keeplist;
178{
179 register char *to;
180 register int len;
181
182 if (!from)
183 return Nullch;
184 len = strlen(from);
185 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
186 str->str_nok = 0; /* invalidate number */
187 str->str_pok = 1; /* validate pointer */
188 to = str->str_ptr+str->str_cur;
189 for (; *from; from++,to++) {
190 if (*from == '\\' && from[1] && delim != '\\') {
191 if (!keeplist) {
192 if (from[1] == delim || from[1] == '\\')
193 from++;
194 else
195 *to++ = *from++;
196 }
a0d0e21e 197 else if (strchr(keeplist,from[1]))
8d063cd8 198 *to++ = *from++;
199 else
200 from++;
201 }
202 else if (*from == delim)
203 break;
204 *to = *from;
205 }
206 *to = '\0';
207 str->str_cur = to - str->str_ptr;
208 return from;
209}
210
211STR *
212str_new(len)
213int len;
214{
215 register STR *str;
216
217 if (freestrroot) {
218 str = freestrroot;
219 freestrroot = str->str_link.str_next;
220 }
221 else {
222 str = (STR *) safemalloc(sizeof(STR));
223 bzero((char*)str,sizeof(STR));
224 }
225 if (len)
226 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
227 return str;
228}
229
230void
231str_grow(str,len)
232register STR *str;
233int len;
234{
235 if (len && str)
236 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
237}
238
239/* make str point to what nstr did */
240
241void
242str_replace(str,nstr)
243register STR *str;
244register STR *nstr;
245{
9c8d0b29 246 Safefree(str->str_ptr);
8d063cd8 247 str->str_ptr = nstr->str_ptr;
248 str->str_len = nstr->str_len;
249 str->str_cur = nstr->str_cur;
250 str->str_pok = nstr->str_pok;
251 if (str->str_nok = nstr->str_nok)
252 str->str_nval = nstr->str_nval;
253 safefree((char*)nstr);
254}
255
256void
257str_free(str)
258register STR *str;
259{
260 if (!str)
261 return;
262 if (str->str_len)
263 str->str_ptr[0] = '\0';
264 str->str_cur = 0;
265 str->str_nok = 0;
266 str->str_pok = 0;
267 str->str_link.str_next = freestrroot;
268 freestrroot = str;
269}
270
9c8d0b29 271int
8d063cd8 272str_len(str)
273register STR *str;
274{
275 if (!str)
276 return 0;
277 if (!(str->str_pok))
278 str_2ptr(str);
279 if (str->str_len)
280 return str->str_cur;
281 else
282 return 0;
283}
284
285char *
286str_gets(str,fp)
287register STR *str;
288register FILE *fp;
289{
85e6fe83 290#ifdef USE_STD_STDIO /* Here is some breathtakingly efficient cheating */
8d063cd8 291
292 register char *bp; /* we're going to steal some values */
293 register int cnt; /* from the stdio struct and put EVERYTHING */
378cc40b 294 register STDCHAR *ptr; /* in the innermost loop into registers */
8d063cd8 295 register char newline = '\n'; /* (assuming at least 6 registers) */
296 int i;
297 int bpx;
298
299 cnt = fp->_cnt; /* get count into register */
300 str->str_nok = 0; /* invalidate number */
301 str->str_pok = 1; /* validate pointer */
302 if (str->str_len <= cnt) /* make sure we have the room */
303 GROWSTR(&(str->str_ptr), &(str->str_len), cnt+1);
304 bp = str->str_ptr; /* move these two too to registers */
305 ptr = fp->_ptr;
306 for (;;) {
378cc40b 307 while (--cnt >= 0) {
308 if ((*bp++ = *ptr++) == newline)
309 if (bp <= str->str_ptr || bp[-2] != '\\')
310 goto thats_all_folks;
311 else {
312 line++;
313 bp -= 2;
314 }
8d063cd8 315 }
316
317 fp->_cnt = cnt; /* deregisterize cnt and ptr */
318 fp->_ptr = ptr;
319 i = _filbuf(fp); /* get more characters */
320 cnt = fp->_cnt;
321 ptr = fp->_ptr; /* reregisterize cnt and ptr */
322
323 bpx = bp - str->str_ptr; /* prepare for possible relocation */
324 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + cnt + 1);
325 bp = str->str_ptr + bpx; /* reconstitute our pointer */
326
327 if (i == newline) { /* all done for now? */
328 *bp++ = i;
329 goto thats_all_folks;
330 }
331 else if (i == EOF) /* all done for ever? */
332 goto thats_all_folks;
333 *bp++ = i; /* now go back to screaming loop */
334 }
335
336thats_all_folks:
337 fp->_cnt = cnt; /* put these back or we're in trouble */
338 fp->_ptr = ptr;
339 *bp = '\0';
340 str->str_cur = bp - str->str_ptr; /* set length */
341
85e6fe83 342#else /* !USE_STD_STDIO */ /* The big, slow, and stupid way */
8d063cd8 343
344 static char buf[4192];
345
346 if (fgets(buf, sizeof buf, fp) != Nullch)
347 str_set(str, buf);
348 else
349 str_set(str, No);
350
85e6fe83 351#endif /* USE_STD_STDIO */
8d063cd8 352
353 return str->str_cur ? str->str_ptr : Nullch;
354}
355
356void
357str_inc(str)
358register STR *str;
359{
360 register char *d;
361
362 if (!str)
363 return;
364 if (str->str_nok) {
365 str->str_nval += 1.0;
366 str->str_pok = 0;
367 return;
368 }
369 if (!str->str_pok) {
370 str->str_nval = 1.0;
371 str->str_nok = 1;
372 return;
373 }
374 for (d = str->str_ptr; *d && *d != '.'; d++) ;
375 d--;
376 if (!isdigit(*str->str_ptr) || !isdigit(*d) ) {
377 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
378 return;
379 }
380 while (d >= str->str_ptr) {
381 if (++*d <= '9')
382 return;
383 *(d--) = '0';
384 }
385 /* oh,oh, the number grew */
386 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + 2);
387 str->str_cur++;
388 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
389 *d = d[-1];
390 *d = '1';
391}
392
393void
394str_dec(str)
395register STR *str;
396{
397 register char *d;
398
399 if (!str)
400 return;
401 if (str->str_nok) {
402 str->str_nval -= 1.0;
403 str->str_pok = 0;
404 return;
405 }
406 if (!str->str_pok) {
407 str->str_nval = -1.0;
408 str->str_nok = 1;
409 return;
410 }
411 for (d = str->str_ptr; *d && *d != '.'; d++) ;
412 d--;
413 if (!isdigit(*str->str_ptr) || !isdigit(*d) || (*d == '0' && d == str->str_ptr)) {
414 str_numset(str,atof(str->str_ptr) - 1.0); /* punt */
415 return;
416 }
417 while (d >= str->str_ptr) {
418 if (--*d >= '0')
419 return;
420 *(d--) = '9';
421 }
422}
423
424/* make a string that will exist for the duration of the expression eval */
425
426STR *
fe14fcc3 427str_mortal(oldstr)
8d063cd8 428STR *oldstr;
429{
430 register STR *str = str_new(0);
431 static long tmps_size = -1;
432
433 str_sset(str,oldstr);
434 if (++tmps_max > tmps_size) {
435 tmps_size = tmps_max;
436 if (!(tmps_size & 127)) {
437 if (tmps_size)
438 tmps_list = (STR**)saferealloc((char*)tmps_list,
439 (tmps_size + 128) * sizeof(STR*) );
440 else
441 tmps_list = (STR**)safemalloc(128 * sizeof(char*));
442 }
443 }
444 tmps_list[tmps_max] = str;
445 return str;
446}
447
448STR *
449str_make(s)
450char *s;
451{
452 register STR *str = str_new(0);
453
454 str_set(str,s);
455 return str;
456}
457
458STR *
459str_nmake(n)
460double n;
461{
462 register STR *str = str_new(0);
463
464 str_numset(str,n);
465 return str;
466}