1 /* $Header: str.c,v 3.0 89/10/18 15:35:18 lwall Locked $
3 * Copyright (c) 1989, Larry Wall
5 * You may distribute under the terms of the GNU General Public License
6 * as specified in the README file that comes with the perl 3.0 kit.
9 * Revision 3.0 89/10/18 15:35:18 lwall
24 str->str_pok = 0; /* invalidate pointer */
25 str->str_nok = 1; /* validate number */
36 GROWSTR(&(str->str_ptr), &(str->str_len), 24);
39 sprintf(s,"%.20g",str->str_nval);
43 str->str_cur = s - str->str_ptr;
47 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
58 if (str->str_len && str->str_pok)
59 str->str_nval = atof(str->str_ptr);
65 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_nval);
76 else if (sstr->str_nok)
77 str_numset(dstr,sstr->str_nval);
78 else if (sstr->str_pok)
79 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
89 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
90 bcopy(ptr,str->str_ptr,len);
92 *(str->str_ptr+str->str_cur) = '\0';
93 str->str_nok = 0; /* invalidate number */
94 str->str_pok = 1; /* validate pointer */
106 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
107 bcopy(ptr,str->str_ptr,len+1);
109 str->str_nok = 0; /* invalidate number */
110 str->str_pok = 1; /* validate pointer */
113 str_chop(str,ptr) /* like set but assuming ptr is in str */
119 str->str_cur -= (ptr - str->str_ptr);
120 bcopy(ptr,str->str_ptr, str->str_cur + 1);
121 str->str_nok = 0; /* invalidate number */
122 str->str_pok = 1; /* validate pointer */
125 str_ncat(str,ptr,len)
132 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
133 bcopy(ptr,str->str_ptr+str->str_cur,len);
135 *(str->str_ptr+str->str_cur) = '\0';
136 str->str_nok = 0; /* invalidate number */
137 str->str_pok = 1; /* validate pointer */
144 if (!(sstr->str_pok))
147 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
161 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
162 bcopy(ptr,str->str_ptr+str->str_cur,len+1);
164 str->str_nok = 0; /* invalidate number */
165 str->str_pok = 1; /* validate pointer */
169 str_append_till(str,from,delim,keeplist)
181 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + len + 1);
182 str->str_nok = 0; /* invalidate number */
183 str->str_pok = 1; /* validate pointer */
184 to = str->str_ptr+str->str_cur;
185 for (; *from; from++,to++) {
186 if (*from == '\\' && from[1] && delim != '\\') {
188 if (from[1] == delim || from[1] == '\\')
193 else if (index(keeplist,from[1]))
198 else if (*from == delim)
203 str->str_cur = to - str->str_ptr;
215 freestrroot = str->str_link.str_next;
218 str = (STR *) safemalloc(sizeof(STR));
219 bzero((char*)str,sizeof(STR));
222 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
232 GROWSTR(&(str->str_ptr), &(str->str_len), len + 1);
235 /* make str point to what nstr did */
238 str_replace(str,nstr)
242 safefree(str->str_ptr);
243 str->str_ptr = nstr->str_ptr;
244 str->str_len = nstr->str_len;
245 str->str_cur = nstr->str_cur;
246 str->str_pok = nstr->str_pok;
247 if (str->str_nok = nstr->str_nok)
248 str->str_nval = nstr->str_nval;
249 safefree((char*)nstr);
259 str->str_ptr[0] = '\0';
263 str->str_link.str_next = freestrroot;
285 #ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
287 register char *bp; /* we're going to steal some values */
288 register int cnt; /* from the stdio struct and put EVERYTHING */
289 register STDCHAR *ptr; /* in the innermost loop into registers */
290 register char newline = '\n'; /* (assuming at least 6 registers) */
294 cnt = fp->_cnt; /* get count into register */
295 str->str_nok = 0; /* invalidate number */
296 str->str_pok = 1; /* validate pointer */
297 if (str->str_len <= cnt) /* make sure we have the room */
298 GROWSTR(&(str->str_ptr), &(str->str_len), cnt+1);
299 bp = str->str_ptr; /* move these two too to registers */
303 if ((*bp++ = *ptr++) == newline)
304 if (bp <= str->str_ptr || bp[-2] != '\\')
305 goto thats_all_folks;
312 fp->_cnt = cnt; /* deregisterize cnt and ptr */
314 i = _filbuf(fp); /* get more characters */
316 ptr = fp->_ptr; /* reregisterize cnt and ptr */
318 bpx = bp - str->str_ptr; /* prepare for possible relocation */
319 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + cnt + 1);
320 bp = str->str_ptr + bpx; /* reconstitute our pointer */
322 if (i == newline) { /* all done for now? */
324 goto thats_all_folks;
326 else if (i == EOF) /* all done for ever? */
327 goto thats_all_folks;
328 *bp++ = i; /* now go back to screaming loop */
332 fp->_cnt = cnt; /* put these back or we're in trouble */
335 str->str_cur = bp - str->str_ptr; /* set length */
337 #else /* !STDSTDIO */ /* The big, slow, and stupid way */
339 static char buf[4192];
341 if (fgets(buf, sizeof buf, fp) != Nullch)
346 #endif /* STDSTDIO */
348 return str->str_cur ? str->str_ptr : Nullch;
360 str->str_nval += 1.0;
369 for (d = str->str_ptr; *d && *d != '.'; d++) ;
371 if (!isdigit(*str->str_ptr) || !isdigit(*d) ) {
372 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
375 while (d >= str->str_ptr) {
380 /* oh,oh, the number grew */
381 GROWSTR(&(str->str_ptr), &(str->str_len), str->str_cur + 2);
383 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
397 str->str_nval -= 1.0;
402 str->str_nval = -1.0;
406 for (d = str->str_ptr; *d && *d != '.'; d++) ;
408 if (!isdigit(*str->str_ptr) || !isdigit(*d) || (*d == '0' && d == str->str_ptr)) {
409 str_numset(str,atof(str->str_ptr) - 1.0); /* punt */
412 while (d >= str->str_ptr) {
419 /* make a string that will exist for the duration of the expression eval */
425 register STR *str = str_new(0);
426 static long tmps_size = -1;
428 str_sset(str,oldstr);
429 if (++tmps_max > tmps_size) {
430 tmps_size = tmps_max;
431 if (!(tmps_size & 127)) {
433 tmps_list = (STR**)saferealloc((char*)tmps_list,
434 (tmps_size + 128) * sizeof(STR*) );
436 tmps_list = (STR**)safemalloc(128 * sizeof(char*));
439 tmps_list[tmps_max] = str;
447 register STR *str = str_new(0);
457 register STR *str = str_new(0);