1 /* $Header: str.c,v 3.0.1.4 89/12/21 20:21:35 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.4 89/12/21 20:21:35 lwall
10 * patch7: errno may now be a macro with an lvalue
11 * patch7: made nested or recursive foreach work right
13 * Revision 3.0.1.3 89/11/17 15:38:23 lwall
14 * patch5: some machines typedef unchar too
15 * patch5: substitution on leading components occasionally caused <> corruption
17 * Revision 3.0.1.2 89/11/11 04:56:22 lwall
18 * patch2: uchar gives Crays fits
20 * Revision 3.0.1.1 89/10/26 23:23:41 lwall
21 * patch1: string ordering tests were wrong
22 * patch1: $/ now works even when STDSTDIO undefined
24 * Revision 3.0 89/10/18 15:23:38 lwall
33 extern char **environ;
41 tainted |= str->str_tainted;
43 return str->str_pok ? str->str_ptr : str_2ptr(str);
47 /* dlb ... guess we have a "crippled cc".
48 * dlb the following functions are usually macros.
55 if (*Str->str_ptr > '0' ||
57 (Str->str_cur && *Str->str_ptr != '0'))
62 return (Str->str_u.str_nval != 0.0);
72 tainted |= Str->str_tainted;
75 return Str->str_u.str_nval;
79 /* dlb ... end of crutch */
86 register char *s = str->str_ptr;
88 if (str->str_state == SS_INCR) { /* data before str_ptr? */
89 str->str_len += str->str_u.str_useful;
90 str->str_ptr -= str->str_u.str_useful;
91 str->str_u.str_useful = 0L;
92 bcopy(s, str->str_ptr, str->str_cur+1);
94 str->str_state = SS_NORM; /* normal again */
95 if (newlen > str->str_len)
96 newlen += 10 * (newlen - str->str_cur); /* avoid copy each time */
98 if (newlen > str->str_len) { /* need more room? */
100 Renew(s,newlen,char);
102 New(703,s,newlen,char);
104 str->str_len = newlen;
113 str->str_u.str_nval = num;
114 str->str_state = SS_NORM;
115 str->str_pok = 0; /* invalidate pointer */
116 str->str_nok = 1; /* validate number */
118 str->str_tainted = tainted;
134 olderrno = errno; /* some Xenix systems wipe out errno here */
135 #if defined(scs) && defined(ns32000)
136 gcvt(str->str_u.str_nval,20,s);
139 if (str->str_u.str_nval == 0.0)
143 (void)sprintf(s,"%.20g",str->str_u.str_nval);
149 if (str == &str_undef)
152 warn("Use of uninitialized variable");
157 str->str_cur = s - str->str_ptr;
161 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
172 str->str_state = SS_NORM;
173 if (str->str_len && str->str_pok)
174 str->str_u.str_nval = atof(str->str_ptr);
176 if (str == &str_undef)
179 warn("Use of uninitialized variable");
180 str->str_u.str_nval = 0.0;
185 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_u.str_nval);
187 return str->str_u.str_nval;
195 tainted |= sstr->str_tainted;
198 dstr->str_pok = dstr->str_nok = 0;
199 else if (sstr->str_pok) {
200 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
202 dstr->str_u.str_nval = sstr->str_u.str_nval;
204 dstr->str_state = SS_NORM;
206 else if (sstr->str_cur == sizeof(STBP)) {
207 char *tmps = sstr->str_ptr;
209 if (*tmps == 'S' && bcmp(tmps,"Stab",4) == 0) {
210 dstr->str_magic = str_smake(sstr->str_magic);
211 dstr->str_magic->str_rare = 'X';
215 else if (sstr->str_nok)
216 str_numset(dstr,sstr->str_u.str_nval);
219 dstr->str_u = sstr->str_u;
221 dstr->str_u.str_nval = sstr->str_u.str_nval;
223 dstr->str_pok = dstr->str_nok = 0;
227 str_nset(str,ptr,len)
232 STR_GROW(str, len + 1);
233 (void)bcopy(ptr,str->str_ptr,len);
235 *(str->str_ptr+str->str_cur) = '\0';
236 str->str_nok = 0; /* invalidate number */
237 str->str_pok = 1; /* validate pointer */
239 str->str_tainted = tainted;
252 STR_GROW(str, len + 1);
253 (void)bcopy(ptr,str->str_ptr,len+1);
255 str->str_nok = 0; /* invalidate number */
256 str->str_pok = 1; /* validate pointer */
258 str->str_tainted = tainted;
262 str_chop(str,ptr) /* like set but assuming ptr is in str */
269 fatal("str_chop: internal inconsistency");
270 delta = ptr - str->str_ptr;
271 str->str_len -= delta;
272 str->str_cur -= delta;
273 str->str_ptr += delta;
274 if (str->str_state == SS_INCR)
275 str->str_u.str_useful += delta;
277 str->str_u.str_useful = delta;
278 str->str_state = SS_INCR;
280 str->str_nok = 0; /* invalidate number */
281 str->str_pok = 1; /* validate pointer (and unstudy str) */
284 str_ncat(str,ptr,len)
291 STR_GROW(str, str->str_cur + len + 1);
292 (void)bcopy(ptr,str->str_ptr+str->str_cur,len);
294 *(str->str_ptr+str->str_cur) = '\0';
295 str->str_nok = 0; /* invalidate number */
296 str->str_pok = 1; /* validate pointer */
298 str->str_tainted |= tainted;
307 tainted |= sstr->str_tainted;
311 if (!(sstr->str_pok))
312 (void)str_2ptr(sstr);
314 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
328 STR_GROW(str, str->str_cur + len + 1);
329 (void)bcopy(ptr,str->str_ptr+str->str_cur,len+1);
331 str->str_nok = 0; /* invalidate number */
332 str->str_pok = 1; /* validate pointer */
334 str->str_tainted |= tainted;
339 str_append_till(str,from,fromend,delim,keeplist)
342 register char *fromend;
351 len = fromend - from;
352 STR_GROW(str, str->str_cur + len + 1);
353 str->str_nok = 0; /* invalidate number */
354 str->str_pok = 1; /* validate pointer */
355 to = str->str_ptr+str->str_cur;
356 for (; from < fromend; from++,to++) {
357 if (*from == '\\' && from+1 < fromend && delim != '\\') {
359 if (from[1] == delim || from[1] == '\\')
364 else if (from[1] && index(keeplist,from[1]))
369 else if (*from == delim)
374 str->str_cur = to - str->str_ptr;
391 freestrroot = str->str_magic;
392 str->str_magic = Nullstr;
393 str->str_state = SS_NORM;
396 Newz(700+x,str,1,STR);
399 STR_GROW(str, len + 1);
404 str_magic(str, stab, how, name, namlen)
413 str->str_magic = Str_new(75,namlen);
414 str = str->str_magic;
415 str->str_u.str_stab = stab;
418 str_nset(str,name,namlen);
422 str_insert(bigstr,offset,len,little,littlelen)
431 register char *midend;
432 register char *bigend;
436 if (i > 0) { /* string might grow */
437 STR_GROW(bigstr, bigstr->str_cur + i + 1);
438 big = bigstr->str_ptr;
439 mid = big + offset + len;
440 midend = bigend = big + bigstr->str_cur;
443 while (midend > mid) /* shove everything down */
444 *--bigend = *--midend;
445 (void)bcopy(little,big+offset,littlelen);
446 bigstr->str_cur += i;
450 (void)bcopy(little,bigstr->str_ptr+offset,len);
454 big = bigstr->str_ptr;
457 bigend = big + bigstr->str_cur;
460 fatal("panic: str_insert");
462 bigstr->str_pok = SP_VALID; /* disable possible screamer */
464 if (mid - big > bigend - midend) { /* faster to shorten from end */
466 (void)bcopy(little, mid, littlelen);
471 (void)bcopy(midend, mid, i);
475 bigstr->str_cur = mid - big;
477 else if (i = mid - big) { /* faster from front */
480 str_chop(bigstr,midend-i);
485 (void)bcopy(little, mid, littlelen);
487 else if (littlelen) {
489 str_chop(bigstr,midend);
490 (void)bcopy(little,midend,littlelen);
493 str_chop(bigstr,midend);
498 /* make str point to what nstr did */
501 str_replace(str,nstr)
505 if (str->str_state == SS_INCR)
506 str_grow(str,0); /* just force copy down */
507 if (nstr->str_state == SS_INCR)
510 Safefree(str->str_ptr);
511 str->str_ptr = nstr->str_ptr;
512 str->str_len = nstr->str_len;
513 str->str_cur = nstr->str_cur;
514 str->str_pok = nstr->str_pok;
515 str->str_nok = nstr->str_nok;
517 str->str_u = nstr->str_u;
519 str->str_u.str_nval = nstr->str_u.str_nval;
522 str->str_tainted = nstr->str_tainted;
533 if (str->str_state) {
534 if (str->str_state == SS_FREE) /* already freed */
536 if (str->str_state == SS_INCR && !(str->str_pok & 2)) {
537 str->str_ptr -= str->str_u.str_useful;
538 str->str_len += str->str_u.str_useful;
542 str_free(str->str_magic);
545 Safefree(str->str_ptr);
546 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
547 arg_free(str->str_u.str_args);
551 if (str->str_len > 127) { /* next user not likely to want more */
552 Safefree(str->str_ptr); /* so give it back to malloc */
553 str->str_ptr = Nullch;
557 str->str_ptr[0] = '\0';
559 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
560 arg_free(str->str_u.str_args);
564 str->str_state = SS_FREE;
566 str->str_tainted = 0;
568 str->str_magic = freestrroot;
570 #endif /* LEAKTEST */
591 return str2 == Nullstr;
596 (void)str_2ptr(str1);
598 (void)str_2ptr(str2);
600 if (str1->str_cur != str2->str_cur)
603 return !bcmp(str1->str_ptr, str2->str_ptr, str1->str_cur);
613 return str2 == Nullstr;
618 (void)str_2ptr(str1);
620 (void)str_2ptr(str2);
622 if (str1->str_cur < str2->str_cur) {
623 if (retval = memcmp(str1->str_ptr, str2->str_ptr, str1->str_cur))
628 else if (retval = memcmp(str1->str_ptr, str2->str_ptr, str2->str_cur))
630 else if (str1->str_cur == str2->str_cur)
637 str_gets(str,fp,append)
642 register char *bp; /* we're going to steal some values */
643 register int cnt; /* from the stdio struct and put EVERYTHING */
644 register STDCHAR *ptr; /* in the innermost loop into registers */
645 register char newline = record_separator;/* (assuming >= 6 registers) */
649 register int get_paragraph;
650 register char *oldbp;
652 if (get_paragraph = !rslen) { /* yes, that's an assignment */
654 oldbp = Nullch; /* remember last \n position (none) */
656 #ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
658 cnt = fp->_cnt; /* get count into register */
659 str->str_nok = 0; /* invalidate number */
660 str->str_pok = 1; /* validate pointer */
661 if (str->str_len <= cnt + 1) /* make sure we have the room */
662 STR_GROW(str, append+cnt+2); /* (remembering cnt can be -1) */
663 bp = str->str_ptr + append; /* move these two too to registers */
667 while (--cnt >= 0) { /* this */ /* eat */
668 if ((*bp++ = *ptr++) == newline) /* really */ /* dust */
669 goto thats_all_folks; /* screams */ /* sed :-) */
672 fp->_cnt = cnt; /* deregisterize cnt and ptr */
674 i = _filbuf(fp); /* get more characters */
676 ptr = fp->_ptr; /* reregisterize cnt and ptr */
678 bpx = bp - str->str_ptr; /* prepare for possible relocation */
679 if (get_paragraph && oldbp)
680 obpx = oldbp - str->str_ptr;
682 STR_GROW(str, bpx + cnt + 2);
683 bp = str->str_ptr + bpx; /* reconstitute our pointer */
684 if (get_paragraph && oldbp)
685 oldbp = str->str_ptr + obpx;
687 if (i == newline) { /* all done for now? */
689 goto thats_all_folks;
691 else if (i == EOF) /* all done for ever? */
692 goto thats_really_all_folks;
693 *bp++ = i; /* now go back to screaming loop */
697 if (get_paragraph && bp - 1 != oldbp) {
698 oldbp = bp; /* remember where this newline was */
699 goto screamer; /* and go back to the fray */
701 thats_really_all_folks:
702 fp->_cnt = cnt; /* put these back or we're in trouble */
705 str->str_cur = bp - str->str_ptr; /* set length */
707 #else /* !STDSTDIO */ /* The big, slow, and stupid way */
710 static char buf[8192];
711 char * bpe = buf + sizeof(buf) - 3;
716 while ((i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe);
717 if (i == newline && get_paragraph &&
718 (i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe)
726 if (i != newline && i != EOF) {
732 #endif /* STDSTDIO */
734 return str->str_cur - append ? str->str_ptr : Nullch;
743 line_t oldline = line;
746 str_sset(linestr,str);
748 oldoldbufptr = oldbufptr = bufptr = str_get(linestr);
749 bufend = bufptr + linestr->str_cur;
750 if (setjmp(eval_env)) {
752 fatal("%s\n",stab_val(stabent("@",TRUE))->str_ptr);
757 if (retval || error_count)
758 fatal("Invalid component in string or format");
761 if (cmd->c_type != C_EXPR || cmd->c_next || arg->arg_type != O_LIST)
762 fatal("panic: error in parselist %d %x %d", cmd->c_type,
763 cmd->c_next, arg ? arg->arg_type : -1);
773 register char *s = str_get(src);
774 register char *send = s + src->str_cur;
779 register int brackets;
784 toparse = Str_new(76,0);
788 str_nset(toparse,"",0);
791 if (*s == '\\' && s[1] && index("$@[{\\]}",s[1])) {
792 str_ncat(str, t, s - t);
794 if (*nointrp && s+1 < send)
795 if (*s != '@' && (*s != '$' || index(nointrp,s[1])))
797 str_ncat(str, "$b", 2);
802 else if ((*s == '@' || (*s == '$' && !index(nointrp,s[1]))) &&
806 if (*s == '$' && s[1] == '#' && isalpha(s[2]) || s[2] == '_')
808 s = scanreg(s,send,tokenbuf);
810 (!(stab = stabent(tokenbuf,FALSE)) || !stab_xarray(stab)) ) {
813 continue; /* grandfather @ from old scripts */
815 str_ncat(str,"$a",2);
816 str_ncat(toparse,",",1);
817 if (t[1] != '{' && (*s == '[' || *s == '{' /* }} */ ) &&
818 (stab = stabent(tokenbuf,FALSE)) &&
819 ((*s == '[') ? (stab_xarray(stab) != 0) : (stab_xhash(stab) != 0)) ) {
833 s = cpytill(tokenbuf,s+1,send,*s,&len);
835 fatal("Unterminated string");
840 } while (brackets > 0 && s < send);
842 fatal("Unmatched brackets in string");
843 if (*nointrp) { /* we're in a regular expression */
845 if (*d == '{' && s[-1] == '}') { /* maybe {n,m} */
847 if (isdigit(*d)) { /* matches /^{\d,?\d*}$/ */
853 s = checkpoint; /* Is {n,m}! Backoff! */
856 else if (*d == '[' && s[-1] == ']') { /* char class? */
857 int weight = 2; /* let's weigh the evidence */
859 unsigned char un_char = 0, last_un_char;
865 else if (d[1] == '$')
869 if (isdigit(d[2]) && !d[3])
875 for (d++; d < s; d++) {
876 last_un_char = un_char;
877 un_char = (unsigned char)*d;
881 weight -= seen[un_char] * 10;
882 if (isalpha(d[1]) || isdigit(d[1]) ||
884 d = scanreg(d,s,tokenbuf);
885 if (stabent(tokenbuf,FALSE))
890 else if (*d == '$' && d[1] &&
891 index("[#!%*<>()-=",d[1])) {
892 if (!d[2] || /*{*/ index("])} =",d[2]))
901 if (index("wds",d[1]))
903 else if (seen['\''] || seen['"'])
905 else if (index("rnftb",d[1]))
907 else if (isdigit(d[1])) {
909 while (d[1] && isdigit(d[1]))
917 if (last_un_char < d[1] || d[1] == '\\') {
918 if (index("aA01! ",last_un_char))
920 if (index("zZ79~",d[1]))
926 if (isalpha(*d) && d[1] && isalpha(d[1])) {
932 if (un_char == last_un_char + 1)
934 weight -= seen[un_char];
941 fprintf(stderr,"[%s] weight %d\n",
942 checkpoint+1,weight);
945 if (weight >= 0) /* probably a character class */
951 str_ncat(toparse, "join($\",", 8);
952 if (t[1] == '{' && s[-1] == '}') {
953 str_ncat(toparse, t, 1);
954 str_ncat(toparse, t+2, s - t - 3);
957 str_ncat(toparse, t, s - t);
959 str_ncat(toparse, ")", 1);
966 if (toparse->str_ptr && *toparse->str_ptr == ',') {
967 *toparse->str_ptr = '(';
968 str_ncat(toparse,",$$);",5);
969 str->str_u.str_args = parselist(toparse);
970 str->str_u.str_args->arg_len--; /* ignore $$ reference */
973 str->str_u.str_args = Nullarg;
975 str->str_pok |= SP_INTRP;
977 str_replace(src,str);
991 if (!(src->str_pok & SP_INTRP)) {
992 int oldsave = savestack->ary_fill;
994 (void)savehptr(&curstash);
995 curstash = src->str_u.str_hash; /* so stabent knows right package */
997 restorelist(oldsave);
999 s = src->str_ptr; /* assumed valid since str_pok set */
1001 send = s + src->str_cur;
1003 if (src->str_u.str_args) {
1004 (void)eval(src->str_u.str_args,G_ARRAY,sp);
1005 /* Assuming we have correct # of args */
1006 elem = stack->ary_array + sp;
1011 if (*s == '$' && s+1 < send) {
1012 str_ncat(str,t,s-t);
1015 str_scat(str,*++elem);
1018 str_ncat(str,++s,1);
1026 str_ncat(str,t,s-t);
1039 str->str_u.str_nval += 1.0;
1043 if (!str->str_pok || !*str->str_ptr) {
1044 str->str_u.str_nval = 1.0;
1050 while (isalpha(*d)) d++;
1051 while (isdigit(*d)) d++;
1053 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
1057 while (d >= str->str_ptr) {
1067 *(d--) -= 'z' - 'a' + 1;
1070 /* oh,oh, the number grew */
1071 STR_GROW(str, str->str_cur + 2);
1073 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
1088 str->str_u.str_nval -= 1.0;
1092 if (!str->str_pok) {
1093 str->str_u.str_nval = -1.0;
1097 str_numset(str,atof(str->str_ptr) - 1.0);
1100 /* Make a string that will exist for the duration of the expression
1101 * evaluation. Actually, it may have to last longer than that, but
1102 * hopefully cmd_exec won't free it until it has been assigned to a
1103 * permanent location. */
1105 static long tmps_size = -1;
1111 register STR *str = Str_new(78,0);
1113 str_sset(str,oldstr);
1114 if (++tmps_max > tmps_size) {
1115 tmps_size = tmps_max;
1116 if (!(tmps_size & 127)) {
1118 Renew(tmps_list, tmps_size + 128, STR*);
1120 New(702,tmps_list, 128, STR*);
1123 tmps_list[tmps_max] = str;
1127 /* same thing without the copying */
1133 if (++tmps_max > tmps_size) {
1134 tmps_size = tmps_max;
1135 if (!(tmps_size & 127)) {
1137 Renew(tmps_list, tmps_size + 128, STR*);
1139 New(704,tmps_list, 128, STR*);
1142 tmps_list[tmps_max] = str;
1151 register STR *str = Str_new(79,0);
1155 str_nset(str,s,len);
1163 register STR *str = Str_new(80,0);
1169 /* make an exact duplicate of old */
1175 register STR *new = Str_new(81,0);
1179 if (old->str_state == SS_FREE) {
1180 warn("semi-panic: attempt to dup freed string");
1183 if (old->str_state == SS_INCR && !(old->str_pok & 2))
1186 Safefree(new->str_ptr);
1187 Copy(old,new,1,STR);
1189 new->str_ptr = nsavestr(old->str_ptr,old->str_len);
1197 register HENT *entry;
1198 register STAB *stab;
1201 register SPAT *spat;
1204 if (!*s) { /* reset ?? searches */
1205 for (spat = stash->tbl_spatroot;
1207 spat = spat->spat_next) {
1208 spat->spat_flags &= ~SPAT_USED;
1213 /* reset variables */
1221 for ( ; i <= max; i++) {
1222 for (entry = stash->tbl_array[i];
1224 entry = entry->hent_next) {
1225 stab = (STAB*)entry->hent_val;
1226 str = stab_val(stab);
1230 str->str_tainted = tainted;
1232 if (str->str_ptr != Nullch)
1233 str->str_ptr[0] = '\0';
1234 if (stab_xarray(stab)) {
1235 aclear(stab_xarray(stab));
1237 if (stab_xhash(stab)) {
1238 hclear(stab_xhash(stab));
1239 if (stab == envstab)
1240 environ[0] = Nullch;
1253 fprintf(stderr,"%s %d %d %d\n",s,tainted,uid, euid);
1255 if (tainted && (!euid || euid != uid)) {
1265 register STR *envstr;
1267 envstr = hfetch(stab_hash(envstab),"PATH",4,FALSE);
1268 if (!envstr || envstr->str_tainted) {
1270 taintproper("Insecure PATH");
1272 envstr = hfetch(stab_hash(envstab),"IFS",3,FALSE);
1273 if (envstr && envstr->str_tainted) {
1275 taintproper("Insecure IFS");