1 /* $RCSfile: str.c,v $$Revision: 4.0.1.4 $$Date: 91/11/05 18:40:51 $
3 * Copyright (c) 1991, Larry Wall
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.
9 * Revision 4.0.1.4 91/11/05 18:40:51 lwall
10 * patch11: $foo .= <BAR> could overrun malloced memory
11 * patch11: \$ didn't always make it through double-quoter to regexp routines
12 * patch11: prepared for ctype implementations that don't define isascii()
14 * Revision 4.0.1.3 91/06/10 01:27:54 lwall
15 * patch10: $) and $| incorrectly handled in run-time patterns
17 * Revision 4.0.1.2 91/06/07 11:58:13 lwall
18 * patch4: new copyright notice
19 * patch4: taint check on undefined string could cause core dump
21 * Revision 4.0.1.1 91/04/12 09:15:30 lwall
22 * patch1: fixed undefined environ problem
23 * patch1: substr($ENV{"PATH"},0,0) = "/foo:" didn't modify environment
24 * patch1: $foo .= <BAR> could cause core dump for certain lengths of $foo
26 * Revision 4.0 91/03/20 01:39:55 lwall
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 */
90 register char *s = str->str_ptr;
93 if (newlen >= 0x10000) {
94 fprintf(stderr, "Allocation too large: %lx\n", newlen);
98 if (str->str_state == SS_INCR) { /* data before str_ptr? */
99 str->str_len += str->str_u.str_useful;
100 str->str_ptr -= str->str_u.str_useful;
101 str->str_u.str_useful = 0L;
102 bcopy(s, str->str_ptr, str->str_cur+1);
104 str->str_state = SS_NORM; /* normal again */
105 if (newlen > str->str_len)
106 newlen += 10 * (newlen - str->str_cur); /* avoid copy each time */
108 if (newlen > str->str_len) { /* need more room? */
110 Renew(s,newlen,char);
112 New(703,s,newlen,char);
114 str->str_len = newlen;
124 str->str_pok = 0; /* invalidate pointer */
125 if (str->str_state == SS_INCR)
128 str->str_u.str_nval = num;
129 str->str_state = SS_NORM;
130 str->str_nok = 1; /* validate number */
132 str->str_tainted = tainted;
148 olderrno = errno; /* some Xenix systems wipe out errno here */
149 #if defined(scs) && defined(ns32000)
150 gcvt(str->str_u.str_nval,20,s);
153 if (str->str_u.str_nval == 0.0)
157 (void)sprintf(s,"%.20g",str->str_u.str_nval);
167 if (str == &str_undef)
170 warn("Use of uninitialized variable");
175 str->str_cur = s - str->str_ptr;
179 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
190 if (str->str_state == SS_INCR)
191 Str_Grow(str,0); /* just force copy down */
192 str->str_state = SS_NORM;
193 if (str->str_len && str->str_pok)
194 str->str_u.str_nval = atof(str->str_ptr);
196 if (str == &str_undef)
199 warn("Use of uninitialized variable");
200 str->str_u.str_nval = 0.0;
205 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_u.str_nval);
207 return str->str_u.str_nval;
210 /* Note: str_sset() should not be called with a source string that needs
211 * be reused, since it may destroy the source string if it is marked
221 tainted |= sstr->str_tainted;
223 if (sstr == dstr || dstr == &str_undef)
226 dstr->str_pok = dstr->str_nok = 0;
227 else if (sstr->str_pok) {
230 * Check to see if we can just swipe the string. If so, it's a
231 * possible small lose on short strings, but a big win on long ones.
232 * It might even be a win on short strings if dstr->str_ptr
233 * has to be allocated and sstr->str_ptr has to be freed.
236 if (sstr->str_pok & SP_TEMP) { /* slated for free anyway? */
238 if (dstr->str_state == SS_INCR)
239 dstr->str_ptr -= dstr->str_u.str_useful;
240 Safefree(dstr->str_ptr);
242 dstr->str_ptr = sstr->str_ptr;
243 dstr->str_len = sstr->str_len;
244 dstr->str_cur = sstr->str_cur;
245 dstr->str_state = sstr->str_state;
246 dstr->str_pok = sstr->str_pok & ~SP_TEMP;
248 dstr->str_tainted = sstr->str_tainted;
250 sstr->str_ptr = Nullch;
252 sstr->str_pok = 0; /* wipe out any weird flags */
253 sstr->str_state = 0; /* so sstr frees uneventfully */
255 else { /* have to copy actual string */
257 if (dstr->str_state == SS_INCR) {
261 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
264 if (dstr->str_nok = sstr->str_nok)
265 dstr->str_u.str_nval = sstr->str_u.str_nval;
268 dstr->str_u = sstr->str_u;
270 dstr->str_u.str_nval = sstr->str_u.str_nval;
272 if (dstr->str_cur == sizeof(STBP)) {
273 char *tmps = dstr->str_ptr;
275 if (*tmps == 'S' && bcmp(tmps,"StB",4) == 0) {
276 if (!dstr->str_magic) {
277 dstr->str_magic = str_smake(sstr->str_magic);
278 dstr->str_magic->str_rare = 'X';
284 else if (sstr->str_nok)
285 str_numset(dstr,sstr->str_u.str_nval);
287 if (dstr->str_state == SS_INCR)
288 Str_Grow(dstr,0); /* just force copy down */
291 dstr->str_u = sstr->str_u;
293 dstr->str_u.str_nval = sstr->str_u.str_nval;
295 dstr->str_pok = dstr->str_nok = 0;
299 str_nset(str,ptr,len)
304 if (str == &str_undef)
306 STR_GROW(str, len + 1);
308 (void)bcopy(ptr,str->str_ptr,len);
310 *(str->str_ptr+str->str_cur) = '\0';
311 str->str_nok = 0; /* invalidate number */
312 str->str_pok = 1; /* validate pointer */
314 str->str_tainted = tainted;
324 if (str == &str_undef)
329 STR_GROW(str, len + 1);
330 (void)bcopy(ptr,str->str_ptr,len+1);
332 str->str_nok = 0; /* invalidate number */
333 str->str_pok = 1; /* validate pointer */
335 str->str_tainted = tainted;
339 str_chop(str,ptr) /* like set but assuming ptr is in str */
343 register STRLEN delta;
345 if (!ptr || !(str->str_pok))
347 delta = ptr - str->str_ptr;
348 str->str_len -= delta;
349 str->str_cur -= delta;
350 str->str_ptr += delta;
351 if (str->str_state == SS_INCR)
352 str->str_u.str_useful += delta;
354 str->str_u.str_useful = delta;
355 str->str_state = SS_INCR;
357 str->str_nok = 0; /* invalidate number */
358 str->str_pok = 1; /* validate pointer (and unstudy str) */
361 str_ncat(str,ptr,len)
366 if (str == &str_undef)
370 STR_GROW(str, str->str_cur + len + 1);
371 (void)bcopy(ptr,str->str_ptr+str->str_cur,len);
373 *(str->str_ptr+str->str_cur) = '\0';
374 str->str_nok = 0; /* invalidate number */
375 str->str_pok = 1; /* validate pointer */
377 str->str_tainted |= tainted;
388 tainted |= sstr->str_tainted;
390 if (!(sstr->str_pok))
391 (void)str_2ptr(sstr);
393 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
402 if (str == &str_undef)
409 STR_GROW(str, str->str_cur + len + 1);
410 (void)bcopy(ptr,str->str_ptr+str->str_cur,len+1);
412 str->str_nok = 0; /* invalidate number */
413 str->str_pok = 1; /* validate pointer */
415 str->str_tainted |= tainted;
420 str_append_till(str,from,fromend,delim,keeplist)
423 register char *fromend;
430 if (str == &str_undef)
434 len = fromend - from;
435 STR_GROW(str, str->str_cur + len + 1);
436 str->str_nok = 0; /* invalidate number */
437 str->str_pok = 1; /* validate pointer */
438 to = str->str_ptr+str->str_cur;
439 for (; from < fromend; from++,to++) {
440 if (*from == '\\' && from+1 < fromend && delim != '\\') {
442 if (from[1] == delim || from[1] == '\\')
447 else if (from[1] && index(keeplist,from[1]))
452 else if (*from == delim)
457 str->str_cur = to - str->str_ptr;
474 freestrroot = str->str_magic;
475 str->str_magic = Nullstr;
476 str->str_state = SS_NORM;
479 Newz(700+x,str,1,STR);
482 STR_GROW(str, len + 1);
487 str_magic(str, stab, how, name, namlen)
494 if (str == &str_undef || str->str_magic)
496 str->str_magic = Str_new(75,namlen);
497 str = str->str_magic;
498 str->str_u.str_stab = stab;
501 str_nset(str,name,namlen);
505 str_insert(bigstr,offset,len,little,littlelen)
514 register char *midend;
515 register char *bigend;
518 if (bigstr == &str_undef)
521 bigstr->str_pok = SP_VALID; /* disable possible screamer */
524 if (i > 0) { /* string might grow */
525 STR_GROW(bigstr, bigstr->str_cur + i + 1);
526 big = bigstr->str_ptr;
527 mid = big + offset + len;
528 midend = bigend = big + bigstr->str_cur;
531 while (midend > mid) /* shove everything down */
532 *--bigend = *--midend;
533 (void)bcopy(little,big+offset,littlelen);
534 bigstr->str_cur += i;
539 (void)bcopy(little,bigstr->str_ptr+offset,len);
544 big = bigstr->str_ptr;
547 bigend = big + bigstr->str_cur;
550 fatal("panic: str_insert");
552 if (mid - big > bigend - midend) { /* faster to shorten from end */
554 (void)bcopy(little, mid, littlelen);
559 (void)bcopy(midend, mid, i);
563 bigstr->str_cur = mid - big;
566 else if (i = mid - big) { /* faster from front */
569 str_chop(bigstr,midend-i);
574 (void)bcopy(little, mid, littlelen);
576 else if (littlelen) {
578 str_chop(bigstr,midend);
579 (void)bcopy(little,midend,littlelen);
582 str_chop(bigstr,midend);
587 /* make str point to what nstr did */
590 str_replace(str,nstr)
594 if (str == &str_undef)
596 if (str->str_state == SS_INCR)
597 Str_Grow(str,0); /* just force copy down */
598 if (nstr->str_state == SS_INCR)
601 Safefree(str->str_ptr);
602 str->str_ptr = nstr->str_ptr;
603 str->str_len = nstr->str_len;
604 str->str_cur = nstr->str_cur;
605 str->str_pok = nstr->str_pok;
606 str->str_nok = nstr->str_nok;
608 str->str_u = nstr->str_u;
610 str->str_u.str_nval = nstr->str_u.str_nval;
613 str->str_tainted = nstr->str_tainted;
616 str_free(nstr->str_magic);
624 if (!str || str == &str_undef)
626 if (str->str_state) {
627 if (str->str_state == SS_FREE) /* already freed */
629 if (str->str_state == SS_INCR && !(str->str_pok & 2)) {
630 str->str_ptr -= str->str_u.str_useful;
631 str->str_len += str->str_u.str_useful;
635 str_free(str->str_magic);
636 str->str_magic = freestrroot;
639 Safefree(str->str_ptr);
640 str->str_ptr = Nullch;
642 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
643 arg_free(str->str_u.str_args);
647 if (str->str_len > 127) { /* next user not likely to want more */
648 Safefree(str->str_ptr); /* so give it back to malloc */
649 str->str_ptr = Nullch;
653 str->str_ptr[0] = '\0';
655 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
656 arg_free(str->str_u.str_args);
660 str->str_state = SS_FREE;
662 str->str_tainted = 0;
665 #endif /* LEAKTEST */
686 if (!str1 || str1 == &str_undef)
687 return (str2 == Nullstr || str2 == &str_undef || !str2->str_cur);
688 if (!str2 || str2 == &str_undef)
689 return !str1->str_cur;
692 (void)str_2ptr(str1);
694 (void)str_2ptr(str2);
696 if (str1->str_cur != str2->str_cur)
699 return !bcmp(str1->str_ptr, str2->str_ptr, str1->str_cur);
708 if (!str1 || str1 == &str_undef)
709 return (str2 == Nullstr || str2 == &str_undef || !str2->str_cur)?0:-1;
710 if (!str2 || str2 == &str_undef)
711 return str1->str_cur != 0;
714 (void)str_2ptr(str1);
716 (void)str_2ptr(str2);
718 if (str1->str_cur < str2->str_cur) {
720 if (retval = memcmp(str1->str_ptr, str2->str_ptr, str1->str_cur))
721 return retval < 0 ? -1 : 1;
726 else if (retval = memcmp(str1->str_ptr, str2->str_ptr, str2->str_cur))
727 return retval < 0 ? -1 : 1;
728 else if (str1->str_cur == str2->str_cur)
735 str_gets(str,fp,append)
740 register char *bp; /* we're going to steal some values */
741 register int cnt; /* from the stdio struct and put EVERYTHING */
742 register STDCHAR *ptr; /* in the innermost loop into registers */
743 register int newline = rschar;/* (assuming >= 6 registers) */
748 if (str == &str_undef)
750 #ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
751 cnt = fp->_cnt; /* get count into register */
752 str->str_nok = 0; /* invalidate number */
753 str->str_pok = 1; /* validate pointer */
754 if (str->str_len - append <= cnt + 1) { /* make sure we have the room */
755 if (cnt > 80 && str->str_len > append) {
756 shortbuffered = cnt - str->str_len + append + 1;
757 cnt -= shortbuffered;
761 STR_GROW(str, append+cnt+2);/* (remembering cnt can be -1) */
766 bp = str->str_ptr + append; /* move these two too to registers */
770 while (--cnt >= 0) { /* this */ /* eat */
771 if ((*bp++ = *ptr++) == newline) /* really */ /* dust */
772 goto thats_all_folks; /* screams */ /* sed :-) */
775 if (shortbuffered) { /* oh well, must extend */
778 bpx = bp - str->str_ptr; /* prepare for possible relocation */
780 STR_GROW(str, str->str_len + append + cnt + 2);
781 bp = str->str_ptr + bpx; /* reconstitute our pointer */
785 fp->_cnt = cnt; /* deregisterize cnt and ptr */
787 i = _filbuf(fp); /* get more characters */
789 ptr = fp->_ptr; /* reregisterize cnt and ptr */
791 bpx = bp - str->str_ptr; /* prepare for possible relocation */
793 STR_GROW(str, bpx + cnt + 2);
794 bp = str->str_ptr + bpx; /* reconstitute our pointer */
796 if (i == newline) { /* all done for now? */
798 goto thats_all_folks;
800 else if (i == EOF) /* all done for ever? */
801 goto thats_really_all_folks;
802 *bp++ = i; /* now go back to screaming loop */
806 if (rslen > 1 && (bp - str->str_ptr < rslen || bcmp(bp - rslen, rs, rslen)))
807 goto screamer; /* go back to the fray */
808 thats_really_all_folks:
810 cnt += shortbuffered;
811 fp->_cnt = cnt; /* put these back or we're in trouble */
814 str->str_cur = bp - str->str_ptr; /* set length */
816 #else /* !STDSTDIO */ /* The big, slow, and stupid way */
819 static char buf[8192];
820 char * bpe = buf + sizeof(buf) - 3;
824 while ((i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe) ;
831 if (i != EOF /* joy */
837 (str->str_cur < rslen
839 bcmp(str->str_ptr + str->str_cur - rslen, rs, rslen)
850 #endif /* STDSTDIO */
852 return str->str_cur - append ? str->str_ptr : Nullch;
861 CMD *oldcurcmd = curcmd;
862 int oldperldb = perldb;
866 str_sset(linestr,str);
868 oldoldbufptr = oldbufptr = bufptr = str_get(linestr);
869 bufend = bufptr + linestr->str_cur;
870 if (++loop_ptr >= loop_max) {
872 Renew(loop_stack, loop_max, struct loop);
874 loop_stack[loop_ptr].loop_label = "_EVAL_";
875 loop_stack[loop_ptr].loop_sp = 0;
878 deb("(Pushing label #%d _EVAL_)\n", loop_ptr);
881 if (setjmp(loop_stack[loop_ptr].loop_env)) {
885 fatal("%s\n",stab_val(stabent("@",TRUE))->str_ptr);
889 char *tmps = loop_stack[loop_ptr].loop_label;
890 deb("(Popping label #%d %s)\n",loop_ptr,
897 curcmd->c_line = oldcurcmd->c_line;
902 if (retval || error_count)
903 fatal("Invalid component in string or format");
906 if (cmd->c_type != C_EXPR || cmd->c_next || arg->arg_type != O_LIST)
907 fatal("panic: error in parselist %d %x %d", cmd->c_type,
908 cmd->c_next, arg ? arg->arg_type : -1);
918 register char *s = str_get(src);
919 register char *send = s + src->str_cur;
924 register int brackets;
930 toparse = Str_new(76,0);
934 str_nset(toparse,"",0);
937 if (*s == '\\' && s[1] && index("$@[{\\]}lLuUE",s[1])) {
938 str_ncat(str, t, s - t);
941 str_ncat(str, "$c", 2);
942 sawcase = (*s != 'E');
945 if (*nointrp) { /* in a regular expression */
946 if (*s == '@') /* always strip \@ */ /*SUPPRESS 530*/
948 else if (*s == '$') {
949 if (s+1 >= send || index(nointrp, s[1]))
950 str_ncat(str,s-1,1); /* only strip \$ for vars */
952 else /* don't strip \\, \[, \{ etc. */
955 str_ncat(str, "$b", 2);
961 else if (*s == '$' && s+1 < send && *nointrp && index(nointrp,s[1])) {
962 str_ncat(str, t, s - t);
963 str_ncat(str, "$b", 2);
968 else if ((*s == '@' || *s == '$') && s+1 < send) {
971 if (*s == '$' && s[1] == '#' && (isALPHA(s[2]) || s[2] == '_'))
973 s = scanident(s,send,tokenbuf);
975 (!(stab = stabent(tokenbuf,FALSE)) ||
976 (*s == '{' ? !stab_xhash(stab) : !stab_xarray(stab)) )) {
979 continue; /* grandfather @ from old scripts */
981 str_ncat(str,"$a",2);
982 str_ncat(toparse,",",1);
983 if (t[1] != '{' && (*s == '[' || *s == '{' /* }} */ ) &&
984 (stab = stabent(tokenbuf,FALSE)) &&
985 ((*s == '[') ? (stab_xarray(stab) != 0) : (stab_xhash(stab) != 0)) ) {
1008 s = cpytill(tokenbuf,s+1,send,*s,&len);
1010 fatal("Unterminated string");
1015 } while (brackets > 0 && s < send);
1017 fatal("Unmatched brackets in string");
1018 if (*nointrp) { /* we're in a regular expression */
1020 if (*d == '{' && s[-1] == '}') { /* maybe {n,m} */
1022 if (isDIGIT(*d)) { /* matches /^{\d,?\d*}$/ */
1028 s = checkpoint; /* Is {n,m}! Backoff! */
1031 else if (*d == '[' && s[-1] == ']') { /* char class? */
1032 int weight = 2; /* let's weigh the evidence */
1034 unsigned char un_char = 0, last_un_char;
1036 Zero(seen,256,char);
1040 else if (d[1] == '$')
1042 if (isDIGIT(d[1])) {
1044 if (isDIGIT(d[2]) && !d[3])
1050 for (d++; d < s; d++) {
1051 last_un_char = un_char;
1052 un_char = (unsigned char)*d;
1056 weight -= seen[un_char] * 10;
1057 if (isALNUM(d[1])) {
1058 d = scanident(d,s,tokenbuf);
1059 if (stabent(tokenbuf,FALSE))
1064 else if (*d == '$' && d[1] &&
1065 index("[#!%*<>()-=",d[1])) {
1066 if (!d[2] || /*{*/ index("])} =",d[2]))
1075 if (index("wds",d[1]))
1077 else if (seen['\''] || seen['"'])
1079 else if (index("rnftb",d[1]))
1081 else if (isDIGIT(d[1])) {
1083 while (d[1] && isDIGIT(d[1]))
1091 if (last_un_char < (unsigned char) d[1]
1093 if (index("aA01! ",last_un_char))
1095 if (index("zZ79~",d[1]))
1101 if (isALPHA(*d) && d[1] && isALPHA(d[1])) {
1103 if (yylex() != WORD)
1107 if (un_char == last_un_char + 1)
1109 weight -= seen[un_char];
1116 fprintf(stderr,"[%s] weight %d\n",
1117 checkpoint+1,weight);
1120 if (weight >= 0) /* probably a character class */
1126 str_ncat(toparse, "join($\",", 8);
1127 if (t[1] == '{' && s[-1] == '}') {
1128 str_ncat(toparse, t, 1);
1129 str_ncat(toparse, t+2, s - t - 3);
1132 str_ncat(toparse, t, s - t);
1134 str_ncat(toparse, ")", 1);
1140 str_ncat(str,t,s-t);
1142 str_ncat(str, "$cE", 3);
1143 if (toparse->str_ptr && *toparse->str_ptr == ',') {
1144 *toparse->str_ptr = '(';
1145 str_ncat(toparse,",$$);",5);
1146 str->str_u.str_args = parselist(toparse);
1147 str->str_u.str_args->arg_len--; /* ignore $$ reference */
1150 str->str_u.str_args = Nullarg;
1152 str->str_pok |= SP_INTRP;
1154 str_replace(src,str);
1165 register char *send;
1166 register STR **elem;
1173 if (str == &str_undef)
1175 if (!(src->str_pok & SP_INTRP)) {
1176 int oldsave = savestack->ary_fill;
1178 (void)savehptr(&curstash);
1179 curstash = curcmd->c_stash; /* so stabent knows right package */
1181 restorelist(oldsave);
1183 s = src->str_ptr; /* assumed valid since str_pok set */
1185 send = s + src->str_cur;
1187 if (src->str_u.str_args) {
1188 (void)eval(src->str_u.str_args,G_ARRAY,sp);
1189 /* Assuming we have correct # of args */
1190 elem = stack->ary_array + sp;
1195 if (*s == '$' && s+1 < send) {
1197 str_ncat(str,t,s-t);
1200 fatal("panic: unknown interp cookie\n");
1203 str_scat(str,*++elem);
1206 str_ncat(str,++s,1);
1209 if (docase && str->str_cur >= docase) {
1210 char *b = str->str_ptr + --docase;
1213 lcase(b, str->str_ptr + str->str_cur);
1215 ucase(b, str->str_ptr + str->str_cur);
1217 if (u) /* note that l & u are independent of L & U */
1223 docase = str->str_cur + 1;
1242 docase = L = U = l = u = 0;
1253 str_ncat(str,t,s-t);
1259 register char *send;
1270 register char *send;
1285 if (!str || str == &str_undef)
1288 str->str_u.str_nval += 1.0;
1292 if (!str->str_pok || !*str->str_ptr) {
1293 str->str_u.str_nval = 1.0;
1299 while (isALPHA(*d)) d++;
1300 while (isDIGIT(*d)) d++;
1302 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
1306 while (d >= str->str_ptr) {
1316 *(d--) -= 'z' - 'a' + 1;
1319 /* oh,oh, the number grew */
1320 STR_GROW(str, str->str_cur + 2);
1322 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
1334 if (!str || str == &str_undef)
1337 str->str_u.str_nval -= 1.0;
1341 if (!str->str_pok) {
1342 str->str_u.str_nval = -1.0;
1346 str_numset(str,atof(str->str_ptr) - 1.0);
1349 /* Make a string that will exist for the duration of the expression
1350 * evaluation. Actually, it may have to last longer than that, but
1351 * hopefully cmd_exec won't free it until it has been assigned to a
1352 * permanent location. */
1354 static long tmps_size = -1;
1360 register STR *str = Str_new(78,0);
1362 str_sset(str,oldstr);
1363 if (++tmps_max > tmps_size) {
1364 tmps_size = tmps_max;
1365 if (!(tmps_size & 127)) {
1367 Renew(tmps_list, tmps_size + 128, STR*);
1369 New(702,tmps_list, 128, STR*);
1372 tmps_list[tmps_max] = str;
1374 str->str_pok |= SP_TEMP;
1378 /* same thing without the copying */
1384 if (str == &str_undef)
1386 if (++tmps_max > tmps_size) {
1387 tmps_size = tmps_max;
1388 if (!(tmps_size & 127)) {
1390 Renew(tmps_list, tmps_size + 128, STR*);
1392 New(704,tmps_list, 128, STR*);
1395 tmps_list[tmps_max] = str;
1397 str->str_pok |= SP_TEMP;
1406 register STR *str = Str_new(79,0);
1410 str_nset(str,s,len);
1418 register STR *str = Str_new(80,0);
1424 /* make an exact duplicate of old */
1430 register STR *new = Str_new(81,0);
1434 if (old->str_state == SS_FREE) {
1435 warn("semi-panic: attempt to dup freed string");
1438 if (old->str_state == SS_INCR && !(old->str_pok & 2))
1441 Safefree(new->str_ptr);
1442 Copy(old,new,1,STR);
1444 new->str_ptr = nsavestr(old->str_ptr,old->str_len);
1445 new->str_pok &= ~SP_TEMP;
1454 register HENT *entry;
1455 register STAB *stab;
1458 register SPAT *spat;
1461 if (!*s) { /* reset ?? searches */
1462 for (spat = stash->tbl_spatroot;
1464 spat = spat->spat_next) {
1465 spat->spat_flags &= ~SPAT_USED;
1470 /* reset variables */
1472 if (!stash->tbl_array)
1480 for ( ; i <= max; i++) {
1481 for (entry = stash->tbl_array[i];
1483 entry = entry->hent_next) {
1484 stab = (STAB*)entry->hent_val;
1485 str = stab_val(stab);
1489 str->str_tainted = tainted;
1491 if (str->str_ptr != Nullch)
1492 str->str_ptr[0] = '\0';
1493 if (stab_xarray(stab)) {
1494 aclear(stab_xarray(stab));
1496 if (stab_xhash(stab)) {
1497 hclear(stab_xhash(stab), FALSE);
1498 if (stab == envstab)
1499 environ[0] = Nullch;
1512 fprintf(stderr,"%s %d %d %d\n",s,tainted,uid, euid);
1514 if (tainted && (!euid || euid != uid || egid != gid)) {
1524 register STR *envstr;
1526 envstr = hfetch(stab_hash(envstab),"PATH",4,FALSE);
1527 if (envstr == &str_undef || envstr->str_tainted) {
1529 if (envstr->str_tainted == 2)
1530 taintproper("Insecure directory in PATH");
1532 taintproper("Insecure PATH");
1534 envstr = hfetch(stab_hash(envstab),"IFS",3,FALSE);
1535 if (envstr != &str_undef && envstr->str_tainted) {
1537 taintproper("Insecure IFS");