1 /* $Header: str.c,v 3.0.1.5 90/02/28 18:30:38 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.1.5 90/02/28 18:30:38 lwall
10 * patch9: you may now undef $/ to have no input record separator
11 * patch9: nested evals clobbered their longjmp environment
12 * patch9: sometimes perl thought ordinary data was a symbol table entry
13 * patch9: insufficient space allocated for numeric string on sun4
14 * patch9: underscore in an array name in a double-quoted string not recognized
15 * patch9: "@foo{}" not recognized unless %foo defined
16 * patch9: "$foo[$[]" gives error
18 * Revision 3.0.1.4 89/12/21 20:21:35 lwall
19 * patch7: errno may now be a macro with an lvalue
20 * patch7: made nested or recursive foreach work right
22 * Revision 3.0.1.3 89/11/17 15:38:23 lwall
23 * patch5: some machines typedef unchar too
24 * patch5: substitution on leading components occasionally caused <> corruption
26 * Revision 3.0.1.2 89/11/11 04:56:22 lwall
27 * patch2: uchar gives Crays fits
29 * Revision 3.0.1.1 89/10/26 23:23:41 lwall
30 * patch1: string ordering tests were wrong
31 * patch1: $/ now works even when STDSTDIO undefined
33 * Revision 3.0 89/10/18 15:23:38 lwall
42 extern char **environ;
50 tainted |= str->str_tainted;
52 return str->str_pok ? str->str_ptr : str_2ptr(str);
56 /* dlb ... guess we have a "crippled cc".
57 * dlb the following functions are usually macros.
64 if (*Str->str_ptr > '0' ||
66 (Str->str_cur && *Str->str_ptr != '0'))
71 return (Str->str_u.str_nval != 0.0);
81 tainted |= Str->str_tainted;
84 return Str->str_u.str_nval;
88 /* dlb ... end of crutch */
95 register char *s = str->str_ptr;
97 if (str->str_state == SS_INCR) { /* data before str_ptr? */
98 str->str_len += str->str_u.str_useful;
99 str->str_ptr -= str->str_u.str_useful;
100 str->str_u.str_useful = 0L;
101 bcopy(s, str->str_ptr, str->str_cur+1);
103 str->str_state = SS_NORM; /* normal again */
104 if (newlen > str->str_len)
105 newlen += 10 * (newlen - str->str_cur); /* avoid copy each time */
107 if (newlen > str->str_len) { /* need more room? */
109 Renew(s,newlen,char);
111 New(703,s,newlen,char);
113 str->str_len = newlen;
122 str->str_u.str_nval = num;
123 str->str_state = SS_NORM;
124 str->str_pok = 0; /* invalidate pointer */
125 str->str_nok = 1; /* validate number */
127 str->str_tainted = tainted;
141 /* this is a problem on the sun 4... 24 bytes is not always enough and the
142 exponent blows away the malloc stack
143 PEJ Wed Jan 31 18:41:34 CST 1990
151 olderrno = errno; /* some Xenix systems wipe out errno here */
152 #if defined(scs) && defined(ns32000)
153 gcvt(str->str_u.str_nval,20,s);
156 if (str->str_u.str_nval == 0.0)
160 (void)sprintf(s,"%.20g",str->str_u.str_nval);
170 if (str == &str_undef)
173 warn("Use of uninitialized variable");
182 str->str_cur = s - str->str_ptr;
186 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
197 str->str_state = SS_NORM;
198 if (str->str_len && str->str_pok)
199 str->str_u.str_nval = atof(str->str_ptr);
201 if (str == &str_undef)
204 warn("Use of uninitialized variable");
205 str->str_u.str_nval = 0.0;
210 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_u.str_nval);
212 return str->str_u.str_nval;
220 tainted |= sstr->str_tainted;
225 dstr->str_pok = dstr->str_nok = 0;
226 else if (sstr->str_pok) {
227 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
229 dstr->str_u.str_nval = sstr->str_u.str_nval;
231 dstr->str_state = SS_NORM;
233 else if (sstr->str_cur == sizeof(STBP)) {
234 char *tmps = sstr->str_ptr;
236 if (*tmps == 'S' && bcmp(tmps,"StB",4) == 0) {
237 dstr->str_magic = str_smake(sstr->str_magic);
238 dstr->str_magic->str_rare = 'X';
242 else if (sstr->str_nok)
243 str_numset(dstr,sstr->str_u.str_nval);
246 dstr->str_u = sstr->str_u;
248 dstr->str_u.str_nval = sstr->str_u.str_nval;
250 dstr->str_pok = dstr->str_nok = 0;
254 str_nset(str,ptr,len)
259 STR_GROW(str, len + 1);
260 (void)bcopy(ptr,str->str_ptr,len);
262 *(str->str_ptr+str->str_cur) = '\0';
263 str->str_nok = 0; /* invalidate number */
264 str->str_pok = 1; /* validate pointer */
266 str->str_tainted = tainted;
279 STR_GROW(str, len + 1);
280 (void)bcopy(ptr,str->str_ptr,len+1);
282 str->str_nok = 0; /* invalidate number */
283 str->str_pok = 1; /* validate pointer */
285 str->str_tainted = tainted;
289 str_chop(str,ptr) /* like set but assuming ptr is in str */
296 fatal("str_chop: internal inconsistency");
297 delta = ptr - str->str_ptr;
298 str->str_len -= delta;
299 str->str_cur -= delta;
300 str->str_ptr += delta;
301 if (str->str_state == SS_INCR)
302 str->str_u.str_useful += delta;
304 str->str_u.str_useful = delta;
305 str->str_state = SS_INCR;
307 str->str_nok = 0; /* invalidate number */
308 str->str_pok = 1; /* validate pointer (and unstudy str) */
311 str_ncat(str,ptr,len)
318 STR_GROW(str, str->str_cur + len + 1);
319 (void)bcopy(ptr,str->str_ptr+str->str_cur,len);
321 *(str->str_ptr+str->str_cur) = '\0';
322 str->str_nok = 0; /* invalidate number */
323 str->str_pok = 1; /* validate pointer */
325 str->str_tainted |= tainted;
334 tainted |= sstr->str_tainted;
338 if (!(sstr->str_pok))
339 (void)str_2ptr(sstr);
341 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
355 STR_GROW(str, str->str_cur + len + 1);
356 (void)bcopy(ptr,str->str_ptr+str->str_cur,len+1);
358 str->str_nok = 0; /* invalidate number */
359 str->str_pok = 1; /* validate pointer */
361 str->str_tainted |= tainted;
366 str_append_till(str,from,fromend,delim,keeplist)
369 register char *fromend;
378 len = fromend - from;
379 STR_GROW(str, str->str_cur + len + 1);
380 str->str_nok = 0; /* invalidate number */
381 str->str_pok = 1; /* validate pointer */
382 to = str->str_ptr+str->str_cur;
383 for (; from < fromend; from++,to++) {
384 if (*from == '\\' && from+1 < fromend && delim != '\\') {
386 if (from[1] == delim || from[1] == '\\')
391 else if (from[1] && index(keeplist,from[1]))
396 else if (*from == delim)
401 str->str_cur = to - str->str_ptr;
418 freestrroot = str->str_magic;
419 str->str_magic = Nullstr;
420 str->str_state = SS_NORM;
423 Newz(700+x,str,1,STR);
426 STR_GROW(str, len + 1);
431 str_magic(str, stab, how, name, namlen)
440 str->str_magic = Str_new(75,namlen);
441 str = str->str_magic;
442 str->str_u.str_stab = stab;
445 str_nset(str,name,namlen);
449 str_insert(bigstr,offset,len,little,littlelen)
458 register char *midend;
459 register char *bigend;
463 if (i > 0) { /* string might grow */
464 STR_GROW(bigstr, bigstr->str_cur + i + 1);
465 big = bigstr->str_ptr;
466 mid = big + offset + len;
467 midend = bigend = big + bigstr->str_cur;
470 while (midend > mid) /* shove everything down */
471 *--bigend = *--midend;
472 (void)bcopy(little,big+offset,littlelen);
473 bigstr->str_cur += i;
477 (void)bcopy(little,bigstr->str_ptr+offset,len);
481 big = bigstr->str_ptr;
484 bigend = big + bigstr->str_cur;
487 fatal("panic: str_insert");
489 bigstr->str_pok = SP_VALID; /* disable possible screamer */
491 if (mid - big > bigend - midend) { /* faster to shorten from end */
493 (void)bcopy(little, mid, littlelen);
498 (void)bcopy(midend, mid, i);
502 bigstr->str_cur = mid - big;
504 else if (i = mid - big) { /* faster from front */
507 str_chop(bigstr,midend-i);
512 (void)bcopy(little, mid, littlelen);
514 else if (littlelen) {
516 str_chop(bigstr,midend);
517 (void)bcopy(little,midend,littlelen);
520 str_chop(bigstr,midend);
525 /* make str point to what nstr did */
528 str_replace(str,nstr)
532 if (str->str_state == SS_INCR)
533 str_grow(str,0); /* just force copy down */
534 if (nstr->str_state == SS_INCR)
537 Safefree(str->str_ptr);
538 str->str_ptr = nstr->str_ptr;
539 str->str_len = nstr->str_len;
540 str->str_cur = nstr->str_cur;
541 str->str_pok = nstr->str_pok;
542 str->str_nok = nstr->str_nok;
544 str->str_u = nstr->str_u;
546 str->str_u.str_nval = nstr->str_u.str_nval;
549 str->str_tainted = nstr->str_tainted;
560 if (str->str_state) {
561 if (str->str_state == SS_FREE) /* already freed */
563 if (str->str_state == SS_INCR && !(str->str_pok & 2)) {
564 str->str_ptr -= str->str_u.str_useful;
565 str->str_len += str->str_u.str_useful;
569 str_free(str->str_magic);
572 Safefree(str->str_ptr);
573 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
574 arg_free(str->str_u.str_args);
578 if (str->str_len > 127) { /* next user not likely to want more */
579 Safefree(str->str_ptr); /* so give it back to malloc */
580 str->str_ptr = Nullch;
584 str->str_ptr[0] = '\0';
586 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
587 arg_free(str->str_u.str_args);
591 str->str_state = SS_FREE;
593 str->str_tainted = 0;
595 str->str_magic = freestrroot;
597 #endif /* LEAKTEST */
618 return str2 == Nullstr;
623 (void)str_2ptr(str1);
625 (void)str_2ptr(str2);
627 if (str1->str_cur != str2->str_cur)
630 return !bcmp(str1->str_ptr, str2->str_ptr, str1->str_cur);
640 return str2 == Nullstr;
645 (void)str_2ptr(str1);
647 (void)str_2ptr(str2);
649 if (str1->str_cur < str2->str_cur) {
650 if (retval = memcmp(str1->str_ptr, str2->str_ptr, str1->str_cur))
655 else if (retval = memcmp(str1->str_ptr, str2->str_ptr, str2->str_cur))
657 else if (str1->str_cur == str2->str_cur)
664 str_gets(str,fp,append)
669 register char *bp; /* we're going to steal some values */
670 register int cnt; /* from the stdio struct and put EVERYTHING */
671 register STDCHAR *ptr; /* in the innermost loop into registers */
672 register int newline = record_separator;/* (assuming >= 6 registers) */
676 register int get_paragraph;
677 register char *oldbp;
679 if (get_paragraph = !rslen) { /* yes, that's an assignment */
681 oldbp = Nullch; /* remember last \n position (none) */
683 #ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
685 cnt = fp->_cnt; /* get count into register */
686 str->str_nok = 0; /* invalidate number */
687 str->str_pok = 1; /* validate pointer */
688 if (str->str_len <= cnt + 1) /* make sure we have the room */
689 STR_GROW(str, append+cnt+2); /* (remembering cnt can be -1) */
690 bp = str->str_ptr + append; /* move these two too to registers */
694 while (--cnt >= 0) { /* this */ /* eat */
695 if ((*bp++ = *ptr++) == newline) /* really */ /* dust */
696 goto thats_all_folks; /* screams */ /* sed :-) */
699 fp->_cnt = cnt; /* deregisterize cnt and ptr */
701 i = _filbuf(fp); /* get more characters */
703 ptr = fp->_ptr; /* reregisterize cnt and ptr */
705 bpx = bp - str->str_ptr; /* prepare for possible relocation */
706 if (get_paragraph && oldbp)
707 obpx = oldbp - str->str_ptr;
709 STR_GROW(str, bpx + cnt + 2);
710 bp = str->str_ptr + bpx; /* reconstitute our pointer */
711 if (get_paragraph && oldbp)
712 oldbp = str->str_ptr + obpx;
714 if (i == newline) { /* all done for now? */
716 goto thats_all_folks;
718 else if (i == EOF) /* all done for ever? */
719 goto thats_really_all_folks;
720 *bp++ = i; /* now go back to screaming loop */
724 if (get_paragraph && bp - 1 != oldbp) {
725 oldbp = bp; /* remember where this newline was */
726 goto screamer; /* and go back to the fray */
728 thats_really_all_folks:
729 fp->_cnt = cnt; /* put these back or we're in trouble */
732 str->str_cur = bp - str->str_ptr; /* set length */
734 #else /* !STDSTDIO */ /* The big, slow, and stupid way */
737 static char buf[8192];
738 char * bpe = buf + sizeof(buf) - 3;
743 while ((i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe);
744 if (i == newline && get_paragraph &&
745 (i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe)
753 if (i != newline && i != EOF) {
759 #endif /* STDSTDIO */
761 return str->str_cur - append ? str->str_ptr : Nullch;
770 line_t oldline = line;
774 str_sset(linestr,str);
776 oldoldbufptr = oldbufptr = bufptr = str_get(linestr);
777 bufend = bufptr + linestr->str_cur;
778 if (++loop_ptr >= loop_max) {
780 Renew(loop_stack, loop_max, struct loop);
782 loop_stack[loop_ptr].loop_label = "_EVAL_";
783 loop_stack[loop_ptr].loop_sp = 0;
786 deb("(Pushing label #%d _EVAL_)\n", loop_ptr);
789 if (setjmp(loop_stack[loop_ptr].loop_env)) {
792 fatal("%s\n",stab_val(stabent("@",TRUE))->str_ptr);
796 tmps = loop_stack[loop_ptr].loop_label;
797 deb("(Popping label #%d %s)\n",loop_ptr,
805 if (retval || error_count)
806 fatal("Invalid component in string or format");
809 if (cmd->c_type != C_EXPR || cmd->c_next || arg->arg_type != O_LIST)
810 fatal("panic: error in parselist %d %x %d", cmd->c_type,
811 cmd->c_next, arg ? arg->arg_type : -1);
821 register char *s = str_get(src);
822 register char *send = s + src->str_cur;
827 register int brackets;
832 toparse = Str_new(76,0);
836 str_nset(toparse,"",0);
839 if (*s == '\\' && s[1] && index("$@[{\\]}",s[1])) {
840 str_ncat(str, t, s - t);
842 if (*nointrp && s+1 < send)
843 if (*s != '@' && (*s != '$' || index(nointrp,s[1])))
845 str_ncat(str, "$b", 2);
850 else if ((*s == '@' || (*s == '$' && !index(nointrp,s[1]))) &&
854 if (*s == '$' && s[1] == '#' && (isalpha(s[2]) || s[2] == '_'))
856 s = scanreg(s,send,tokenbuf);
858 (!(stab = stabent(tokenbuf,FALSE)) ||
859 (*s == '{' ? !stab_xhash(stab) : !stab_xarray(stab)) )) {
862 continue; /* grandfather @ from old scripts */
864 str_ncat(str,"$a",2);
865 str_ncat(toparse,",",1);
866 if (t[1] != '{' && (*s == '[' || *s == '{' /* }} */ ) &&
867 (stab = stabent(tokenbuf,FALSE)) &&
868 ((*s == '[') ? (stab_xarray(stab) != 0) : (stab_xhash(stab) != 0)) ) {
890 s = cpytill(tokenbuf,s+1,send,*s,&len);
892 fatal("Unterminated string");
897 } while (brackets > 0 && s < send);
899 fatal("Unmatched brackets in string");
900 if (*nointrp) { /* we're in a regular expression */
902 if (*d == '{' && s[-1] == '}') { /* maybe {n,m} */
904 if (isdigit(*d)) { /* matches /^{\d,?\d*}$/ */
910 s = checkpoint; /* Is {n,m}! Backoff! */
913 else if (*d == '[' && s[-1] == ']') { /* char class? */
914 int weight = 2; /* let's weigh the evidence */
916 unsigned char un_char = 0, last_un_char;
922 else if (d[1] == '$')
926 if (isdigit(d[2]) && !d[3])
932 for (d++; d < s; d++) {
933 last_un_char = un_char;
934 un_char = (unsigned char)*d;
938 weight -= seen[un_char] * 10;
939 if (isalpha(d[1]) || isdigit(d[1]) ||
941 d = scanreg(d,s,tokenbuf);
942 if (stabent(tokenbuf,FALSE))
947 else if (*d == '$' && d[1] &&
948 index("[#!%*<>()-=",d[1])) {
949 if (!d[2] || /*{*/ index("])} =",d[2]))
958 if (index("wds",d[1]))
960 else if (seen['\''] || seen['"'])
962 else if (index("rnftb",d[1]))
964 else if (isdigit(d[1])) {
966 while (d[1] && isdigit(d[1]))
974 if (last_un_char < d[1] || d[1] == '\\') {
975 if (index("aA01! ",last_un_char))
977 if (index("zZ79~",d[1]))
983 if (isalpha(*d) && d[1] && isalpha(d[1])) {
989 if (un_char == last_un_char + 1)
991 weight -= seen[un_char];
998 fprintf(stderr,"[%s] weight %d\n",
999 checkpoint+1,weight);
1002 if (weight >= 0) /* probably a character class */
1008 str_ncat(toparse, "join($\",", 8);
1009 if (t[1] == '{' && s[-1] == '}') {
1010 str_ncat(toparse, t, 1);
1011 str_ncat(toparse, t+2, s - t - 3);
1014 str_ncat(toparse, t, s - t);
1016 str_ncat(toparse, ")", 1);
1022 str_ncat(str,t,s-t);
1023 if (toparse->str_ptr && *toparse->str_ptr == ',') {
1024 *toparse->str_ptr = '(';
1025 str_ncat(toparse,",$$);",5);
1026 str->str_u.str_args = parselist(toparse);
1027 str->str_u.str_args->arg_len--; /* ignore $$ reference */
1030 str->str_u.str_args = Nullarg;
1032 str->str_pok |= SP_INTRP;
1034 str_replace(src,str);
1045 register char *send;
1046 register STR **elem;
1048 if (!(src->str_pok & SP_INTRP)) {
1049 int oldsave = savestack->ary_fill;
1051 (void)savehptr(&curstash);
1052 curstash = src->str_u.str_hash; /* so stabent knows right package */
1054 restorelist(oldsave);
1056 s = src->str_ptr; /* assumed valid since str_pok set */
1058 send = s + src->str_cur;
1060 if (src->str_u.str_args) {
1061 (void)eval(src->str_u.str_args,G_ARRAY,sp);
1062 /* Assuming we have correct # of args */
1063 elem = stack->ary_array + sp;
1068 if (*s == '$' && s+1 < send) {
1069 str_ncat(str,t,s-t);
1072 str_scat(str,*++elem);
1075 str_ncat(str,++s,1);
1083 str_ncat(str,t,s-t);
1096 str->str_u.str_nval += 1.0;
1100 if (!str->str_pok || !*str->str_ptr) {
1101 str->str_u.str_nval = 1.0;
1107 while (isalpha(*d)) d++;
1108 while (isdigit(*d)) d++;
1110 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
1114 while (d >= str->str_ptr) {
1124 *(d--) -= 'z' - 'a' + 1;
1127 /* oh,oh, the number grew */
1128 STR_GROW(str, str->str_cur + 2);
1130 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
1145 str->str_u.str_nval -= 1.0;
1149 if (!str->str_pok) {
1150 str->str_u.str_nval = -1.0;
1154 str_numset(str,atof(str->str_ptr) - 1.0);
1157 /* Make a string that will exist for the duration of the expression
1158 * evaluation. Actually, it may have to last longer than that, but
1159 * hopefully cmd_exec won't free it until it has been assigned to a
1160 * permanent location. */
1162 static long tmps_size = -1;
1168 register STR *str = Str_new(78,0);
1170 str_sset(str,oldstr);
1171 if (++tmps_max > tmps_size) {
1172 tmps_size = tmps_max;
1173 if (!(tmps_size & 127)) {
1175 Renew(tmps_list, tmps_size + 128, STR*);
1177 New(702,tmps_list, 128, STR*);
1180 tmps_list[tmps_max] = str;
1184 /* same thing without the copying */
1190 if (++tmps_max > tmps_size) {
1191 tmps_size = tmps_max;
1192 if (!(tmps_size & 127)) {
1194 Renew(tmps_list, tmps_size + 128, STR*);
1196 New(704,tmps_list, 128, STR*);
1199 tmps_list[tmps_max] = str;
1208 register STR *str = Str_new(79,0);
1212 str_nset(str,s,len);
1220 register STR *str = Str_new(80,0);
1226 /* make an exact duplicate of old */
1232 register STR *new = Str_new(81,0);
1236 if (old->str_state == SS_FREE) {
1237 warn("semi-panic: attempt to dup freed string");
1240 if (old->str_state == SS_INCR && !(old->str_pok & 2))
1243 Safefree(new->str_ptr);
1244 Copy(old,new,1,STR);
1246 new->str_ptr = nsavestr(old->str_ptr,old->str_len);
1254 register HENT *entry;
1255 register STAB *stab;
1258 register SPAT *spat;
1261 if (!*s) { /* reset ?? searches */
1262 for (spat = stash->tbl_spatroot;
1264 spat = spat->spat_next) {
1265 spat->spat_flags &= ~SPAT_USED;
1270 /* reset variables */
1278 for ( ; i <= max; i++) {
1279 for (entry = stash->tbl_array[i];
1281 entry = entry->hent_next) {
1282 stab = (STAB*)entry->hent_val;
1283 str = stab_val(stab);
1287 str->str_tainted = tainted;
1289 if (str->str_ptr != Nullch)
1290 str->str_ptr[0] = '\0';
1291 if (stab_xarray(stab)) {
1292 aclear(stab_xarray(stab));
1294 if (stab_xhash(stab)) {
1295 hclear(stab_xhash(stab));
1296 if (stab == envstab)
1297 environ[0] = Nullch;
1310 fprintf(stderr,"%s %d %d %d\n",s,tainted,uid, euid);
1312 if (tainted && (!euid || euid != uid)) {
1322 register STR *envstr;
1324 envstr = hfetch(stab_hash(envstab),"PATH",4,FALSE);
1325 if (!envstr || envstr->str_tainted) {
1327 taintproper("Insecure PATH");
1329 envstr = hfetch(stab_hash(envstab),"IFS",3,FALSE);
1330 if (envstr && envstr->str_tainted) {
1332 taintproper("Insecure IFS");