1 /* $Header: str.c,v 3.0.1.3 89/11/17 15:38:23 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.3 89/11/17 15:38:23 lwall
10 * patch5: some machines typedef unchar too
11 * patch5: substitution on leading components occasionally caused <> corruption
13 * Revision 3.0.1.2 89/11/11 04:56:22 lwall
14 * patch2: uchar gives Crays fits
16 * Revision 3.0.1.1 89/10/26 23:23:41 lwall
17 * patch1: string ordering tests were wrong
18 * patch1: $/ now works even when STDSTDIO undefined
20 * Revision 3.0 89/10/18 15:23:38 lwall
29 extern char **environ;
37 tainted |= str->str_tainted;
39 return str->str_pok ? str->str_ptr : str_2ptr(str);
43 /* dlb ... guess we have a "crippled cc".
44 * dlb the following functions are usually macros.
51 if (*Str->str_ptr > '0' ||
53 (Str->str_cur && *Str->str_ptr != '0'))
58 return (Str->str_u.str_nval != 0.0);
68 tainted |= Str->str_tainted;
71 return Str->str_u.str_nval;
75 /* dlb ... end of crutch */
82 register char *s = str->str_ptr;
84 if (str->str_state == SS_INCR) { /* data before str_ptr? */
85 str->str_len += str->str_u.str_useful;
86 str->str_ptr -= str->str_u.str_useful;
87 str->str_u.str_useful = 0L;
88 bcopy(s, str->str_ptr, str->str_cur+1);
90 str->str_state = SS_NORM; /* normal again */
91 if (newlen > str->str_len)
92 newlen += 10 * (newlen - str->str_cur); /* avoid copy each time */
94 if (newlen > str->str_len) { /* need more room? */
98 New(703,s,newlen,char);
100 str->str_len = newlen;
109 str->str_u.str_nval = num;
110 str->str_state = SS_NORM;
111 str->str_pok = 0; /* invalidate pointer */
112 str->str_nok = 1; /* validate number */
114 str->str_tainted = tainted;
132 olderrno = errno; /* some Xenix systems wipe out errno here */
133 #if defined(scs) && defined(ns32000)
134 gcvt(str->str_u.str_nval,20,s);
137 if (str->str_u.str_nval == 0.0)
141 (void)sprintf(s,"%.20g",str->str_u.str_nval);
147 if (str == &str_undef)
150 warn("Use of uninitialized variable");
155 str->str_cur = s - str->str_ptr;
159 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
170 str->str_state = SS_NORM;
171 if (str->str_len && str->str_pok)
172 str->str_u.str_nval = atof(str->str_ptr);
174 if (str == &str_undef)
177 warn("Use of uninitialized variable");
178 str->str_u.str_nval = 0.0;
183 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_u.str_nval);
185 return str->str_u.str_nval;
193 tainted |= sstr->str_tainted;
196 dstr->str_pok = dstr->str_nok = 0;
197 else if (sstr->str_pok) {
198 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
200 dstr->str_u.str_nval = sstr->str_u.str_nval;
202 dstr->str_state = SS_NORM;
204 else if (sstr->str_cur == sizeof(STBP)) {
205 char *tmps = sstr->str_ptr;
207 if (*tmps == 'S' && bcmp(tmps,"Stab",4) == 0) {
208 dstr->str_magic = str_smake(sstr->str_magic);
209 dstr->str_magic->str_rare = 'X';
213 else if (sstr->str_nok)
214 str_numset(dstr,sstr->str_u.str_nval);
216 dstr->str_pok = dstr->str_nok = 0;
219 str_nset(str,ptr,len)
224 STR_GROW(str, len + 1);
225 (void)bcopy(ptr,str->str_ptr,len);
227 *(str->str_ptr+str->str_cur) = '\0';
228 str->str_nok = 0; /* invalidate number */
229 str->str_pok = 1; /* validate pointer */
231 str->str_tainted = tainted;
244 STR_GROW(str, len + 1);
245 (void)bcopy(ptr,str->str_ptr,len+1);
247 str->str_nok = 0; /* invalidate number */
248 str->str_pok = 1; /* validate pointer */
250 str->str_tainted = tainted;
254 str_chop(str,ptr) /* like set but assuming ptr is in str */
261 fatal("str_chop: internal inconsistency");
262 delta = ptr - str->str_ptr;
263 str->str_len -= delta;
264 str->str_cur -= delta;
265 str->str_ptr += delta;
266 if (str->str_state == SS_INCR)
267 str->str_u.str_useful += delta;
269 str->str_u.str_useful = delta;
270 str->str_state = SS_INCR;
272 str->str_nok = 0; /* invalidate number */
273 str->str_pok = 1; /* validate pointer (and unstudy str) */
276 str_ncat(str,ptr,len)
283 STR_GROW(str, str->str_cur + len + 1);
284 (void)bcopy(ptr,str->str_ptr+str->str_cur,len);
286 *(str->str_ptr+str->str_cur) = '\0';
287 str->str_nok = 0; /* invalidate number */
288 str->str_pok = 1; /* validate pointer */
290 str->str_tainted |= tainted;
299 tainted |= sstr->str_tainted;
303 if (!(sstr->str_pok))
304 (void)str_2ptr(sstr);
306 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
320 STR_GROW(str, str->str_cur + len + 1);
321 (void)bcopy(ptr,str->str_ptr+str->str_cur,len+1);
323 str->str_nok = 0; /* invalidate number */
324 str->str_pok = 1; /* validate pointer */
326 str->str_tainted |= tainted;
331 str_append_till(str,from,fromend,delim,keeplist)
334 register char *fromend;
343 len = fromend - from;
344 STR_GROW(str, str->str_cur + len + 1);
345 str->str_nok = 0; /* invalidate number */
346 str->str_pok = 1; /* validate pointer */
347 to = str->str_ptr+str->str_cur;
348 for (; from < fromend; from++,to++) {
349 if (*from == '\\' && from+1 < fromend && delim != '\\') {
351 if (from[1] == delim || from[1] == '\\')
356 else if (from[1] && index(keeplist,from[1]))
361 else if (*from == delim)
366 str->str_cur = to - str->str_ptr;
383 freestrroot = str->str_magic;
384 str->str_magic = Nullstr;
385 str->str_state = SS_NORM;
388 Newz(700+x,str,1,STR);
391 STR_GROW(str, len + 1);
396 str_magic(str, stab, how, name, namlen)
405 str->str_magic = Str_new(75,namlen);
406 str = str->str_magic;
407 str->str_u.str_stab = stab;
410 str_nset(str,name,namlen);
414 str_insert(bigstr,offset,len,little,littlelen)
423 register char *midend;
424 register char *bigend;
428 if (i > 0) { /* string might grow */
429 STR_GROW(bigstr, bigstr->str_cur + i + 1);
430 big = bigstr->str_ptr;
431 mid = big + offset + len;
432 midend = bigend = big + bigstr->str_cur;
435 while (midend > mid) /* shove everything down */
436 *--bigend = *--midend;
437 (void)bcopy(little,big+offset,littlelen);
438 bigstr->str_cur += i;
442 (void)bcopy(little,bigstr->str_ptr+offset,len);
446 big = bigstr->str_ptr;
449 bigend = big + bigstr->str_cur;
452 fatal("panic: str_insert");
454 bigstr->str_pok = SP_VALID; /* disable possible screamer */
456 if (mid - big > bigend - midend) { /* faster to shorten from end */
458 (void)bcopy(little, mid, littlelen);
463 (void)bcopy(midend, mid, i);
467 bigstr->str_cur = mid - big;
469 else if (i = mid - big) { /* faster from front */
472 str_chop(bigstr,midend-i);
477 (void)bcopy(little, mid, littlelen);
479 else if (littlelen) {
481 str_chop(bigstr,midend);
482 (void)bcopy(little,midend,littlelen);
485 str_chop(bigstr,midend);
490 /* make str point to what nstr did */
493 str_replace(str,nstr)
497 if (str->str_state == SS_INCR)
498 str_grow(str,0); /* just force copy down */
499 if (nstr->str_state == SS_INCR)
502 Safefree(str->str_ptr);
503 str->str_ptr = nstr->str_ptr;
504 str->str_len = nstr->str_len;
505 str->str_cur = nstr->str_cur;
506 str->str_pok = nstr->str_pok;
507 str->str_nok = nstr->str_nok;
509 str->str_u = nstr->str_u;
511 str->str_u.str_nval = nstr->str_u.str_nval;
514 str->str_tainted = nstr->str_tainted;
525 if (str->str_state) {
526 if (str->str_state == SS_FREE) /* already freed */
528 if (str->str_state == SS_INCR && !(str->str_pok & 2)) {
529 str->str_ptr -= str->str_u.str_useful;
530 str->str_len += str->str_u.str_useful;
534 str_free(str->str_magic);
537 Safefree(str->str_ptr);
538 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
539 arg_free(str->str_u.str_args);
543 if (str->str_len > 127) { /* next user not likely to want more */
544 Safefree(str->str_ptr); /* so give it back to malloc */
545 str->str_ptr = Nullch;
549 str->str_ptr[0] = '\0';
551 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
552 arg_free(str->str_u.str_args);
556 str->str_state = SS_FREE;
558 str->str_tainted = 0;
560 str->str_magic = freestrroot;
562 #endif /* LEAKTEST */
583 return str2 == Nullstr;
588 (void)str_2ptr(str1);
590 (void)str_2ptr(str2);
592 if (str1->str_cur != str2->str_cur)
595 return !bcmp(str1->str_ptr, str2->str_ptr, str1->str_cur);
605 return str2 == Nullstr;
610 (void)str_2ptr(str1);
612 (void)str_2ptr(str2);
614 if (str1->str_cur < str2->str_cur) {
615 if (retval = memcmp(str1->str_ptr, str2->str_ptr, str1->str_cur))
620 else if (retval = memcmp(str1->str_ptr, str2->str_ptr, str2->str_cur))
622 else if (str1->str_cur == str2->str_cur)
629 str_gets(str,fp,append)
634 register char *bp; /* we're going to steal some values */
635 register int cnt; /* from the stdio struct and put EVERYTHING */
636 register STDCHAR *ptr; /* in the innermost loop into registers */
637 register char newline = record_separator;/* (assuming >= 6 registers) */
641 register int get_paragraph;
642 register char *oldbp;
644 if (get_paragraph = !rslen) { /* yes, that's an assignment */
646 oldbp = Nullch; /* remember last \n position (none) */
648 #ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
650 cnt = fp->_cnt; /* get count into register */
651 str->str_nok = 0; /* invalidate number */
652 str->str_pok = 1; /* validate pointer */
653 if (str->str_len <= cnt + 1) /* make sure we have the room */
654 STR_GROW(str, append+cnt+2); /* (remembering cnt can be -1) */
655 bp = str->str_ptr + append; /* move these two too to registers */
659 while (--cnt >= 0) { /* this */ /* eat */
660 if ((*bp++ = *ptr++) == newline) /* really */ /* dust */
661 goto thats_all_folks; /* screams */ /* sed :-) */
664 fp->_cnt = cnt; /* deregisterize cnt and ptr */
666 i = _filbuf(fp); /* get more characters */
668 ptr = fp->_ptr; /* reregisterize cnt and ptr */
670 bpx = bp - str->str_ptr; /* prepare for possible relocation */
671 if (get_paragraph && oldbp)
672 obpx = oldbp - str->str_ptr;
674 STR_GROW(str, bpx + cnt + 2);
675 bp = str->str_ptr + bpx; /* reconstitute our pointer */
676 if (get_paragraph && oldbp)
677 oldbp = str->str_ptr + obpx;
679 if (i == newline) { /* all done for now? */
681 goto thats_all_folks;
683 else if (i == EOF) /* all done for ever? */
684 goto thats_really_all_folks;
685 *bp++ = i; /* now go back to screaming loop */
689 if (get_paragraph && bp - 1 != oldbp) {
690 oldbp = bp; /* remember where this newline was */
691 goto screamer; /* and go back to the fray */
693 thats_really_all_folks:
694 fp->_cnt = cnt; /* put these back or we're in trouble */
697 str->str_cur = bp - str->str_ptr; /* set length */
699 #else /* !STDSTDIO */ /* The big, slow, and stupid way */
702 static char buf[8192];
703 char * bpe = buf + sizeof(buf) - 3;
708 while ((i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe);
709 if (i == newline && get_paragraph &&
710 (i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe)
718 if (i != newline && i != EOF) {
724 #endif /* STDSTDIO */
726 return str->str_cur - append ? str->str_ptr : Nullch;
735 line_t oldline = line;
738 str_sset(linestr,str);
740 oldoldbufptr = oldbufptr = bufptr = str_get(linestr);
741 bufend = bufptr + linestr->str_cur;
742 if (setjmp(eval_env)) {
744 fatal("%s\n",stab_val(stabent("@",TRUE))->str_ptr);
749 if (retval || error_count)
750 fatal("Invalid component in string or format");
753 if (cmd->c_type != C_EXPR || cmd->c_next || arg->arg_type != O_LIST)
754 fatal("panic: error in parselist %d %x %d", cmd->c_type,
755 cmd->c_next, arg ? arg->arg_type : -1);
765 register char *s = str_get(src);
766 register char *send = s + src->str_cur;
771 register int brackets;
776 toparse = Str_new(76,0);
780 str_nset(toparse,"",0);
783 if (*s == '\\' && s[1] && index("$@[{\\]}",s[1])) {
784 str_ncat(str, t, s - t);
786 if (*nointrp && s+1 < send)
787 if (*s != '@' && (*s != '$' || index(nointrp,s[1])))
789 str_ncat(str, "$b", 2);
794 else if ((*s == '@' || (*s == '$' && !index(nointrp,s[1]))) &&
798 if (*s == '$' && s[1] == '#' && isalpha(s[2]) || s[2] == '_')
800 s = scanreg(s,send,tokenbuf);
802 (!(stab = stabent(tokenbuf,FALSE)) || !stab_xarray(stab)) ) {
805 continue; /* grandfather @ from old scripts */
807 str_ncat(str,"$a",2);
808 str_ncat(toparse,",",1);
809 if (t[1] != '{' && (*s == '[' || *s == '{' /* }} */ ) &&
810 (stab = stabent(tokenbuf,FALSE)) &&
811 ((*s == '[') ? (stab_xarray(stab) != 0) : (stab_xhash(stab) != 0)) ) {
825 s = cpytill(tokenbuf,s+1,send,*s,&len);
827 fatal("Unterminated string");
832 } while (brackets > 0 && s < send);
834 fatal("Unmatched brackets in string");
835 if (*nointrp) { /* we're in a regular expression */
837 if (*d == '{' && s[-1] == '}') { /* maybe {n,m} */
839 if (isdigit(*d)) { /* matches /^{\d,?\d*}$/ */
845 s = checkpoint; /* Is {n,m}! Backoff! */
848 else if (*d == '[' && s[-1] == ']') { /* char class? */
849 int weight = 2; /* let's weigh the evidence */
851 unsigned char un_char = 0, last_un_char;
857 else if (d[1] == '$')
861 if (isdigit(d[2]) && !d[3])
867 for (d++; d < s; d++) {
868 last_un_char = un_char;
869 un_char = (unsigned char)*d;
873 weight -= seen[un_char] * 10;
874 if (isalpha(d[1]) || isdigit(d[1]) ||
876 d = scanreg(d,s,tokenbuf);
877 if (stabent(tokenbuf,FALSE))
882 else if (*d == '$' && d[1] &&
883 index("[#!%*<>()-=",d[1])) {
884 if (!d[2] || /*{*/ index("])} =",d[2]))
893 if (index("wds",d[1]))
895 else if (seen['\''] || seen['"'])
897 else if (index("rnftb",d[1]))
899 else if (isdigit(d[1])) {
901 while (d[1] && isdigit(d[1]))
909 if (last_un_char < d[1] || d[1] == '\\') {
910 if (index("aA01! ",last_un_char))
912 if (index("zZ79~",d[1]))
918 if (isalpha(*d) && d[1] && isalpha(d[1])) {
924 if (un_char == last_un_char + 1)
926 weight -= seen[un_char];
933 fprintf(stderr,"[%s] weight %d\n",
934 checkpoint+1,weight);
937 if (weight >= 0) /* probably a character class */
943 str_ncat(toparse, "join($\",", 8);
944 if (t[1] == '{' && s[-1] == '}') {
945 str_ncat(toparse, t, 1);
946 str_ncat(toparse, t+2, s - t - 3);
949 str_ncat(toparse, t, s - t);
951 str_ncat(toparse, ")", 1);
958 if (toparse->str_ptr && *toparse->str_ptr == ',') {
959 *toparse->str_ptr = '(';
960 str_ncat(toparse,",$$);",5);
961 str->str_u.str_args = parselist(toparse);
962 str->str_u.str_args->arg_len--; /* ignore $$ reference */
965 str->str_u.str_args = Nullarg;
967 str->str_pok |= SP_INTRP;
969 str_replace(src,str);
983 if (!(src->str_pok & SP_INTRP)) {
984 int oldsave = savestack->ary_fill;
986 (void)savehptr(&curstash);
987 curstash = src->str_u.str_hash; /* so stabent knows right package */
989 restorelist(oldsave);
991 s = src->str_ptr; /* assumed valid since str_pok set */
993 send = s + src->str_cur;
995 if (src->str_u.str_args) {
996 (void)eval(src->str_u.str_args,G_ARRAY,sp);
997 /* Assuming we have correct # of args */
998 elem = stack->ary_array + sp;
1003 if (*s == '$' && s+1 < send) {
1004 str_ncat(str,t,s-t);
1007 str_scat(str,*++elem);
1010 str_ncat(str,++s,1);
1018 str_ncat(str,t,s-t);
1031 str->str_u.str_nval += 1.0;
1035 if (!str->str_pok || !*str->str_ptr) {
1036 str->str_u.str_nval = 1.0;
1042 while (isalpha(*d)) d++;
1043 while (isdigit(*d)) d++;
1045 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
1049 while (d >= str->str_ptr) {
1059 *(d--) -= 'z' - 'a' + 1;
1062 /* oh,oh, the number grew */
1063 STR_GROW(str, str->str_cur + 2);
1065 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
1080 str->str_u.str_nval -= 1.0;
1084 if (!str->str_pok) {
1085 str->str_u.str_nval = -1.0;
1089 str_numset(str,atof(str->str_ptr) - 1.0);
1092 /* Make a string that will exist for the duration of the expression
1093 * evaluation. Actually, it may have to last longer than that, but
1094 * hopefully cmd_exec won't free it until it has been assigned to a
1095 * permanent location. */
1097 static long tmps_size = -1;
1103 register STR *str = Str_new(78,0);
1105 str_sset(str,oldstr);
1106 if (++tmps_max > tmps_size) {
1107 tmps_size = tmps_max;
1108 if (!(tmps_size & 127)) {
1110 Renew(tmps_list, tmps_size + 128, STR*);
1112 New(702,tmps_list, 128, STR*);
1115 tmps_list[tmps_max] = str;
1119 /* same thing without the copying */
1125 if (++tmps_max > tmps_size) {
1126 tmps_size = tmps_max;
1127 if (!(tmps_size & 127)) {
1129 Renew(tmps_list, tmps_size + 128, STR*);
1131 New(704,tmps_list, 128, STR*);
1134 tmps_list[tmps_max] = str;
1143 register STR *str = Str_new(79,0);
1147 str_nset(str,s,len);
1155 register STR *str = Str_new(80,0);
1161 /* make an exact duplicate of old */
1167 register STR *new = Str_new(81,0);
1171 if (old->str_state == SS_FREE) {
1172 warn("semi-panic: attempt to dup freed string");
1175 if (old->str_state == SS_INCR && !(old->str_pok & 2))
1178 Safefree(new->str_ptr);
1179 Copy(old,new,1,STR);
1181 new->str_ptr = nsavestr(old->str_ptr,old->str_len);
1189 register HENT *entry;
1190 register STAB *stab;
1193 register SPAT *spat;
1196 if (!*s) { /* reset ?? searches */
1197 for (spat = stash->tbl_spatroot;
1199 spat = spat->spat_next) {
1200 spat->spat_flags &= ~SPAT_USED;
1205 /* reset variables */
1213 for ( ; i <= max; i++) {
1214 for (entry = stash->tbl_array[i];
1216 entry = entry->hent_next) {
1217 stab = (STAB*)entry->hent_val;
1218 str = stab_val(stab);
1222 str->str_tainted = tainted;
1224 if (str->str_ptr != Nullch)
1225 str->str_ptr[0] = '\0';
1226 if (stab_xarray(stab)) {
1227 aclear(stab_xarray(stab));
1229 if (stab_xhash(stab)) {
1230 hclear(stab_xhash(stab));
1231 if (stab == envstab)
1232 environ[0] = Nullch;
1245 fprintf(stderr,"%s %d %d %d\n",s,tainted,uid, euid);
1247 if (tainted && (!euid || euid != uid)) {
1257 register STR *envstr;
1259 envstr = hfetch(stab_hash(envstab),"PATH",4,FALSE);
1260 if (!envstr || envstr->str_tainted) {
1262 taintproper("Insecure PATH");
1264 envstr = hfetch(stab_hash(envstab),"IFS",3,FALSE);
1265 if (envstr && envstr->str_tainted) {
1267 taintproper("Insecure IFS");