2 /* $Header: str.c,v 4.0 91/03/20 01:39:55 lwall Locked $
4 * Copyright (c) 1989, Larry Wall
6 * You may distribute under the terms of the GNU General Public License
7 * as specified in the README file that comes with the perl 3.0 kit.
10 * Revision 4.0 91/03/20 01:39:55 lwall
20 extern char **environ;
21 #endif /* ! __STDC__ */
29 tainted |= str->str_tainted;
31 return str->str_pok ? str->str_ptr : str_2ptr(str);
35 /* dlb ... guess we have a "crippled cc".
36 * dlb the following functions are usually macros.
43 if (*Str->str_ptr > '0' ||
45 (Str->str_cur && *Str->str_ptr != '0'))
50 return (Str->str_u.str_nval != 0.0);
60 tainted |= Str->str_tainted;
63 return Str->str_u.str_nval;
67 /* dlb ... end of crutch */
78 register char *s = str->str_ptr;
81 if (newlen >= 0x10000) {
82 fprintf(stderr, "Allocation too large: %lx\n", newlen);
86 if (str->str_state == SS_INCR) { /* data before str_ptr? */
87 str->str_len += str->str_u.str_useful;
88 str->str_ptr -= str->str_u.str_useful;
89 str->str_u.str_useful = 0L;
90 bcopy(s, str->str_ptr, str->str_cur+1);
92 str->str_state = SS_NORM; /* normal again */
93 if (newlen > str->str_len)
94 newlen += 10 * (newlen - str->str_cur); /* avoid copy each time */
96 if (newlen > str->str_len) { /* need more room? */
100 New(703,s,newlen,char);
102 str->str_len = newlen;
112 str->str_pok = 0; /* invalidate pointer */
113 if (str->str_state == SS_INCR)
116 str->str_u.str_nval = num;
117 str->str_state = SS_NORM;
118 str->str_nok = 1; /* validate number */
120 str->str_tainted = tainted;
136 olderrno = errno; /* some Xenix systems wipe out errno here */
137 #if defined(scs) && defined(ns32000)
138 gcvt(str->str_u.str_nval,20,s);
141 if (str->str_u.str_nval == 0.0)
145 (void)sprintf(s,"%.20g",str->str_u.str_nval);
155 if (str == &str_undef)
158 warn("Use of uninitialized variable");
163 str->str_cur = s - str->str_ptr;
167 fprintf(stderr,"0x%lx ptr(%s)\n",str,str->str_ptr);
178 if (str->str_state == SS_INCR)
179 Str_Grow(str,0); /* just force copy down */
180 str->str_state = SS_NORM;
181 if (str->str_len && str->str_pok)
182 str->str_u.str_nval = atof(str->str_ptr);
184 if (str == &str_undef)
187 warn("Use of uninitialized variable");
188 str->str_u.str_nval = 0.0;
193 fprintf(stderr,"0x%lx num(%g)\n",str,str->str_u.str_nval);
195 return str->str_u.str_nval;
198 /* Note: str_sset() should not be called with a source string that needs
199 * be reused, since it may destroy the source string if it is marked
209 tainted |= sstr->str_tainted;
211 if (sstr == dstr || dstr == &str_undef)
214 dstr->str_pok = dstr->str_nok = 0;
215 else if (sstr->str_pok) {
218 * Check to see if we can just swipe the string. If so, it's a
219 * possible small lose on short strings, but a big win on long ones.
220 * It might even be a win on short strings if dstr->str_ptr
221 * has to be allocated and sstr->str_ptr has to be freed.
224 if (sstr->str_pok & SP_TEMP) { /* slated for free anyway? */
226 if (dstr->str_state == SS_INCR)
227 dstr->str_ptr -= dstr->str_u.str_useful;
228 Safefree(dstr->str_ptr);
230 dstr->str_ptr = sstr->str_ptr;
231 dstr->str_len = sstr->str_len;
232 dstr->str_cur = sstr->str_cur;
233 dstr->str_state = sstr->str_state;
234 dstr->str_pok = sstr->str_pok & ~SP_TEMP;
236 dstr->str_tainted = sstr->str_tainted;
238 sstr->str_ptr = Nullch;
240 sstr->str_pok = 0; /* wipe out any weird flags */
241 sstr->str_state = 0; /* so sstr frees uneventfully */
243 else { /* have to copy actual string */
245 if (dstr->str_state == SS_INCR) {
249 str_nset(dstr,sstr->str_ptr,sstr->str_cur);
251 if (dstr->str_nok = sstr->str_nok)
252 dstr->str_u.str_nval = sstr->str_u.str_nval;
255 dstr->str_u = sstr->str_u;
257 dstr->str_u.str_nval = sstr->str_u.str_nval;
259 if (dstr->str_cur == sizeof(STBP)) {
260 char *tmps = dstr->str_ptr;
262 if (*tmps == 'S' && bcmp(tmps,"StB",4) == 0) {
263 if (!dstr->str_magic) {
264 dstr->str_magic = str_smake(sstr->str_magic);
265 dstr->str_magic->str_rare = 'X';
271 else if (sstr->str_nok)
272 str_numset(dstr,sstr->str_u.str_nval);
274 if (dstr->str_state == SS_INCR)
275 Str_Grow(dstr,0); /* just force copy down */
278 dstr->str_u = sstr->str_u;
280 dstr->str_u.str_nval = sstr->str_u.str_nval;
282 dstr->str_pok = dstr->str_nok = 0;
286 str_nset(str,ptr,len)
291 if (str == &str_undef)
293 STR_GROW(str, len + 1);
295 (void)bcopy(ptr,str->str_ptr,len);
297 *(str->str_ptr+str->str_cur) = '\0';
298 str->str_nok = 0; /* invalidate number */
299 str->str_pok = 1; /* validate pointer */
301 str->str_tainted = tainted;
311 if (str == &str_undef)
316 STR_GROW(str, len + 1);
317 (void)bcopy(ptr,str->str_ptr,len+1);
319 str->str_nok = 0; /* invalidate number */
320 str->str_pok = 1; /* validate pointer */
322 str->str_tainted = tainted;
326 str_chop(str,ptr) /* like set but assuming ptr is in str */
330 register STRLEN delta;
332 if (!ptr || !(str->str_pok))
334 delta = ptr - str->str_ptr;
335 str->str_len -= delta;
336 str->str_cur -= delta;
337 str->str_ptr += delta;
338 if (str->str_state == SS_INCR)
339 str->str_u.str_useful += delta;
341 str->str_u.str_useful = delta;
342 str->str_state = SS_INCR;
344 str->str_nok = 0; /* invalidate number */
345 str->str_pok = 1; /* validate pointer (and unstudy str) */
348 str_ncat(str,ptr,len)
353 if (str == &str_undef)
357 STR_GROW(str, str->str_cur + len + 1);
358 (void)bcopy(ptr,str->str_ptr+str->str_cur,len);
360 *(str->str_ptr+str->str_cur) = '\0';
361 str->str_nok = 0; /* invalidate number */
362 str->str_pok = 1; /* validate pointer */
364 str->str_tainted |= tainted;
373 tainted |= sstr->str_tainted;
377 if (!(sstr->str_pok))
378 (void)str_2ptr(sstr);
380 str_ncat(dstr,sstr->str_ptr,sstr->str_cur);
389 if (str == &str_undef)
396 STR_GROW(str, str->str_cur + len + 1);
397 (void)bcopy(ptr,str->str_ptr+str->str_cur,len+1);
399 str->str_nok = 0; /* invalidate number */
400 str->str_pok = 1; /* validate pointer */
402 str->str_tainted |= tainted;
407 str_append_till(str,from,fromend,delim,keeplist)
410 register char *fromend;
417 if (str == &str_undef)
421 len = fromend - from;
422 STR_GROW(str, str->str_cur + len + 1);
423 str->str_nok = 0; /* invalidate number */
424 str->str_pok = 1; /* validate pointer */
425 to = str->str_ptr+str->str_cur;
426 for (; from < fromend; from++,to++) {
427 if (*from == '\\' && from+1 < fromend && delim != '\\') {
429 if (from[1] == delim || from[1] == '\\')
434 else if (from[1] && index(keeplist,from[1]))
439 else if (*from == delim)
444 str->str_cur = to - str->str_ptr;
461 freestrroot = str->str_magic;
462 str->str_magic = Nullstr;
463 str->str_state = SS_NORM;
466 Newz(700+x,str,1,STR);
469 STR_GROW(str, len + 1);
474 str_magic(str, stab, how, name, namlen)
481 if (str == &str_undef || str->str_magic)
483 str->str_magic = Str_new(75,namlen);
484 str = str->str_magic;
485 str->str_u.str_stab = stab;
488 str_nset(str,name,namlen);
492 str_insert(bigstr,offset,len,little,littlelen)
501 register char *midend;
502 register char *bigend;
505 if (bigstr == &str_undef)
508 bigstr->str_pok = SP_VALID; /* disable possible screamer */
511 if (i > 0) { /* string might grow */
512 STR_GROW(bigstr, bigstr->str_cur + i + 1);
513 big = bigstr->str_ptr;
514 mid = big + offset + len;
515 midend = bigend = big + bigstr->str_cur;
518 while (midend > mid) /* shove everything down */
519 *--bigend = *--midend;
520 (void)bcopy(little,big+offset,littlelen);
521 bigstr->str_cur += i;
525 (void)bcopy(little,bigstr->str_ptr+offset,len);
529 big = bigstr->str_ptr;
532 bigend = big + bigstr->str_cur;
535 fatal("panic: str_insert");
537 if (mid - big > bigend - midend) { /* faster to shorten from end */
539 (void)bcopy(little, mid, littlelen);
544 (void)bcopy(midend, mid, i);
548 bigstr->str_cur = mid - big;
550 else if (i = mid - big) { /* faster from front */
553 str_chop(bigstr,midend-i);
558 (void)bcopy(little, mid, littlelen);
560 else if (littlelen) {
562 str_chop(bigstr,midend);
563 (void)bcopy(little,midend,littlelen);
566 str_chop(bigstr,midend);
571 /* make str point to what nstr did */
574 str_replace(str,nstr)
578 if (str == &str_undef)
580 if (str->str_state == SS_INCR)
581 Str_Grow(str,0); /* just force copy down */
582 if (nstr->str_state == SS_INCR)
585 Safefree(str->str_ptr);
586 str->str_ptr = nstr->str_ptr;
587 str->str_len = nstr->str_len;
588 str->str_cur = nstr->str_cur;
589 str->str_pok = nstr->str_pok;
590 str->str_nok = nstr->str_nok;
592 str->str_u = nstr->str_u;
594 str->str_u.str_nval = nstr->str_u.str_nval;
597 str->str_tainted = nstr->str_tainted;
600 str_free(nstr->str_magic);
608 if (!str || str == &str_undef)
610 if (str->str_state) {
611 if (str->str_state == SS_FREE) /* already freed */
613 if (str->str_state == SS_INCR && !(str->str_pok & 2)) {
614 str->str_ptr -= str->str_u.str_useful;
615 str->str_len += str->str_u.str_useful;
619 str_free(str->str_magic);
620 str->str_magic = freestrroot;
623 Safefree(str->str_ptr);
624 str->str_ptr = Nullch;
626 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
627 arg_free(str->str_u.str_args);
631 if (str->str_len > 127) { /* next user not likely to want more */
632 Safefree(str->str_ptr); /* so give it back to malloc */
633 str->str_ptr = Nullch;
637 str->str_ptr[0] = '\0';
639 if ((str->str_pok & SP_INTRP) && str->str_u.str_args)
640 arg_free(str->str_u.str_args);
644 str->str_state = SS_FREE;
646 str->str_tainted = 0;
649 #endif /* LEAKTEST */
670 if (!str1 || str1 == &str_undef)
671 return (str2 == Nullstr || str2 == &str_undef || !str2->str_cur);
672 if (!str2 || str2 == &str_undef)
673 return !str1->str_cur;
676 (void)str_2ptr(str1);
678 (void)str_2ptr(str2);
680 if (str1->str_cur != str2->str_cur)
683 return !bcmp(str1->str_ptr, str2->str_ptr, str1->str_cur);
692 if (!str1 || str1 == &str_undef)
693 return (str2 == Nullstr || str2 == &str_undef || !str2->str_cur)?0:-1;
694 if (!str2 || str2 == &str_undef)
695 return str1->str_cur != 0;
698 (void)str_2ptr(str1);
700 (void)str_2ptr(str2);
702 if (str1->str_cur < str2->str_cur) {
703 if (retval = memcmp(str1->str_ptr, str2->str_ptr, str1->str_cur))
704 return retval < 0 ? -1 : 1;
708 else if (retval = memcmp(str1->str_ptr, str2->str_ptr, str2->str_cur))
709 return retval < 0 ? -1 : 1;
710 else if (str1->str_cur == str2->str_cur)
717 str_gets(str,fp,append)
722 register char *bp; /* we're going to steal some values */
723 register int cnt; /* from the stdio struct and put EVERYTHING */
724 register STDCHAR *ptr; /* in the innermost loop into registers */
725 register int newline = rschar;/* (assuming >= 6 registers) */
730 if (str == &str_undef)
732 #ifdef STDSTDIO /* Here is some breathtakingly efficient cheating */
733 cnt = fp->_cnt; /* get count into register */
734 str->str_nok = 0; /* invalidate number */
735 str->str_pok = 1; /* validate pointer */
736 if (str->str_len <= cnt + 1) { /* make sure we have the room */
737 if (cnt > 80 && str->str_len > 0) {
738 shortbuffered = cnt - str->str_len + 1;
739 cnt = str->str_len - 1;
743 STR_GROW(str, append+cnt+2);/* (remembering cnt can be -1) */
748 bp = str->str_ptr + append; /* move these two too to registers */
752 while (--cnt >= 0) { /* this */ /* eat */
753 if ((*bp++ = *ptr++) == newline) /* really */ /* dust */
754 goto thats_all_folks; /* screams */ /* sed :-) */
757 if (shortbuffered) { /* oh well, must extend */
760 bpx = bp - str->str_ptr; /* prepare for possible relocation */
762 STR_GROW(str, str->str_len + append + cnt + 2);
763 bp = str->str_ptr + bpx; /* reconstitute our pointer */
767 fp->_cnt = cnt; /* deregisterize cnt and ptr */
769 i = _filbuf(fp); /* get more characters */
771 ptr = fp->_ptr; /* reregisterize cnt and ptr */
773 bpx = bp - str->str_ptr; /* prepare for possible relocation */
775 STR_GROW(str, bpx + cnt + 2);
776 bp = str->str_ptr + bpx; /* reconstitute our pointer */
778 if (i == newline) { /* all done for now? */
780 goto thats_all_folks;
782 else if (i == EOF) /* all done for ever? */
783 goto thats_really_all_folks;
784 *bp++ = i; /* now go back to screaming loop */
788 if (rslen > 1 && (bp - str->str_ptr < rslen || bcmp(bp - rslen, rs, rslen)))
789 goto screamer; /* go back to the fray */
790 thats_really_all_folks:
792 cnt += shortbuffered;
793 fp->_cnt = cnt; /* put these back or we're in trouble */
796 str->str_cur = bp - str->str_ptr; /* set length */
798 #else /* !STDSTDIO */ /* The big, slow, and stupid way */
801 static char buf[8192];
802 char * bpe = buf + sizeof(buf) - 3;
806 while ((i = getc(fp)) != EOF && (*bp++ = i) != newline && bp < bpe) ;
813 if (i != EOF /* joy */
819 (str->str_cur < rslen
821 bcmp(str->str_ptr + str->str_cur - rslen, rs, rslen)
832 #endif /* STDSTDIO */
834 return str->str_cur - append ? str->str_ptr : Nullch;
843 CMD *oldcurcmd = curcmd;
844 int oldperldb = perldb;
848 str_sset(linestr,str);
850 oldoldbufptr = oldbufptr = bufptr = str_get(linestr);
851 bufend = bufptr + linestr->str_cur;
852 if (++loop_ptr >= loop_max) {
854 Renew(loop_stack, loop_max, struct loop);
856 loop_stack[loop_ptr].loop_label = "_EVAL_";
857 loop_stack[loop_ptr].loop_sp = 0;
860 deb("(Pushing label #%d _EVAL_)\n", loop_ptr);
863 if (setjmp(loop_stack[loop_ptr].loop_env)) {
867 fatal("%s\n",stab_val(stabent("@",TRUE))->str_ptr);
871 char *tmps = loop_stack[loop_ptr].loop_label;
872 deb("(Popping label #%d %s)\n",loop_ptr,
879 curcmd->c_line = oldcurcmd->c_line;
884 if (retval || error_count)
885 fatal("Invalid component in string or format");
888 if (cmd->c_type != C_EXPR || cmd->c_next || arg->arg_type != O_LIST)
889 fatal("panic: error in parselist %d %x %d", cmd->c_type,
890 cmd->c_next, arg ? arg->arg_type : -1);
900 register char *s = str_get(src);
901 register char *send = s + src->str_cur;
906 register int brackets;
912 toparse = Str_new(76,0);
916 str_nset(toparse,"",0);
919 if (*s == '\\' && s[1] && index("$@[{\\]}lLuUE",s[1])) {
920 str_ncat(str, t, s - t);
923 str_ncat(str, "$c", 2);
924 sawcase = (*s != 'E');
927 if (*nointrp && s+1 < send)
928 if (*s != '@' && (*s != '$' || index(nointrp,s[1])))
930 str_ncat(str, "$b", 2);
936 else if ((*s == '@' || (*s == '$' && !index(nointrp,s[1]))) &&
940 if (*s == '$' && s[1] == '#' && (isalpha(s[2]) || s[2] == '_'))
942 s = scanident(s,send,tokenbuf);
944 (!(stab = stabent(tokenbuf,FALSE)) ||
945 (*s == '{' ? !stab_xhash(stab) : !stab_xarray(stab)) )) {
948 continue; /* grandfather @ from old scripts */
950 str_ncat(str,"$a",2);
951 str_ncat(toparse,",",1);
952 if (t[1] != '{' && (*s == '[' || *s == '{' /* }} */ ) &&
953 (stab = stabent(tokenbuf,FALSE)) &&
954 ((*s == '[') ? (stab_xarray(stab) != 0) : (stab_xhash(stab) != 0)) ) {
976 s = cpytill(tokenbuf,s+1,send,*s,&len);
978 fatal("Unterminated string");
983 } while (brackets > 0 && s < send);
985 fatal("Unmatched brackets in string");
986 if (*nointrp) { /* we're in a regular expression */
988 if (*d == '{' && s[-1] == '}') { /* maybe {n,m} */
990 if (isdigit(*d)) { /* matches /^{\d,?\d*}$/ */
996 s = checkpoint; /* Is {n,m}! Backoff! */
999 else if (*d == '[' && s[-1] == ']') { /* char class? */
1000 int weight = 2; /* let's weigh the evidence */
1002 unsigned char un_char = 0, last_un_char;
1004 Zero(seen,256,char);
1008 else if (d[1] == '$')
1010 if (isdigit(d[1])) {
1012 if (isdigit(d[2]) && !d[3])
1018 for (d++; d < s; d++) {
1019 last_un_char = un_char;
1020 un_char = (unsigned char)*d;
1024 weight -= seen[un_char] * 10;
1025 if (isalpha(d[1]) || isdigit(d[1]) ||
1027 d = scanident(d,s,tokenbuf);
1028 if (stabent(tokenbuf,FALSE))
1033 else if (*d == '$' && d[1] &&
1034 index("[#!%*<>()-=",d[1])) {
1035 if (!d[2] || /*{*/ index("])} =",d[2]))
1044 if (index("wds",d[1]))
1046 else if (seen['\''] || seen['"'])
1048 else if (index("rnftb",d[1]))
1050 else if (isdigit(d[1])) {
1052 while (d[1] && isdigit(d[1]))
1060 if (last_un_char < (unsigned char) d[1]
1062 if (index("aA01! ",last_un_char))
1064 if (index("zZ79~",d[1]))
1070 if (isalpha(*d) && d[1] && isalpha(d[1])) {
1072 if (yylex() != WORD)
1076 if (un_char == last_un_char + 1)
1078 weight -= seen[un_char];
1085 fprintf(stderr,"[%s] weight %d\n",
1086 checkpoint+1,weight);
1089 if (weight >= 0) /* probably a character class */
1095 str_ncat(toparse, "join($\",", 8);
1096 if (t[1] == '{' && s[-1] == '}') {
1097 str_ncat(toparse, t, 1);
1098 str_ncat(toparse, t+2, s - t - 3);
1101 str_ncat(toparse, t, s - t);
1103 str_ncat(toparse, ")", 1);
1109 str_ncat(str,t,s-t);
1111 str_ncat(str, "$cE", 3);
1112 if (toparse->str_ptr && *toparse->str_ptr == ',') {
1113 *toparse->str_ptr = '(';
1114 str_ncat(toparse,",$$);",5);
1115 str->str_u.str_args = parselist(toparse);
1116 str->str_u.str_args->arg_len--; /* ignore $$ reference */
1119 str->str_u.str_args = Nullarg;
1121 str->str_pok |= SP_INTRP;
1123 str_replace(src,str);
1134 register char *send;
1135 register STR **elem;
1142 if (str == &str_undef)
1144 if (!(src->str_pok & SP_INTRP)) {
1145 int oldsave = savestack->ary_fill;
1147 (void)savehptr(&curstash);
1148 curstash = curcmd->c_stash; /* so stabent knows right package */
1150 restorelist(oldsave);
1152 s = src->str_ptr; /* assumed valid since str_pok set */
1154 send = s + src->str_cur;
1156 if (src->str_u.str_args) {
1157 (void)eval(src->str_u.str_args,G_ARRAY,sp);
1158 /* Assuming we have correct # of args */
1159 elem = stack->ary_array + sp;
1164 if (*s == '$' && s+1 < send) {
1166 str_ncat(str,t,s-t);
1169 str_scat(str,*++elem);
1172 str_ncat(str,++s,1);
1175 if (docase && str->str_cur >= docase) {
1176 char *b = str->str_ptr + --docase;
1179 lcase(b, str->str_ptr + str->str_cur);
1181 ucase(b, str->str_ptr + str->str_cur);
1183 if (u) /* note that l & u are independent of L & U */
1189 docase = str->str_cur + 1;
1208 docase = L = U = l = u = 0;
1219 str_ncat(str,t,s-t);
1225 register char *send;
1228 if (isascii(*s) && islower(*s))
1236 register char *send;
1239 if (isascii(*s) && isupper(*s))
1251 if (!str || str == &str_undef)
1254 str->str_u.str_nval += 1.0;
1258 if (!str->str_pok || !*str->str_ptr) {
1259 str->str_u.str_nval = 1.0;
1265 while (isalpha(*d)) d++;
1266 while (isdigit(*d)) d++;
1268 str_numset(str,atof(str->str_ptr) + 1.0); /* punt */
1272 while (d >= str->str_ptr) {
1282 *(d--) -= 'z' - 'a' + 1;
1285 /* oh,oh, the number grew */
1286 STR_GROW(str, str->str_cur + 2);
1288 for (d = str->str_ptr + str->str_cur; d > str->str_ptr; d--)
1300 if (!str || str == &str_undef)
1303 str->str_u.str_nval -= 1.0;
1307 if (!str->str_pok) {
1308 str->str_u.str_nval = -1.0;
1312 str_numset(str,atof(str->str_ptr) - 1.0);
1315 /* Make a string that will exist for the duration of the expression
1316 * evaluation. Actually, it may have to last longer than that, but
1317 * hopefully cmd_exec won't free it until it has been assigned to a
1318 * permanent location. */
1320 static long tmps_size = -1;
1326 register STR *str = Str_new(78,0);
1328 str_sset(str,oldstr);
1329 if (++tmps_max > tmps_size) {
1330 tmps_size = tmps_max;
1331 if (!(tmps_size & 127)) {
1333 Renew(tmps_list, tmps_size + 128, STR*);
1335 New(702,tmps_list, 128, STR*);
1338 tmps_list[tmps_max] = str;
1340 str->str_pok |= SP_TEMP;
1344 /* same thing without the copying */
1350 if (str == &str_undef)
1352 if (++tmps_max > tmps_size) {
1353 tmps_size = tmps_max;
1354 if (!(tmps_size & 127)) {
1356 Renew(tmps_list, tmps_size + 128, STR*);
1358 New(704,tmps_list, 128, STR*);
1361 tmps_list[tmps_max] = str;
1363 str->str_pok |= SP_TEMP;
1372 register STR *str = Str_new(79,0);
1376 str_nset(str,s,len);
1384 register STR *str = Str_new(80,0);
1390 /* make an exact duplicate of old */
1396 register STR *new = Str_new(81,0);
1400 if (old->str_state == SS_FREE) {
1401 warn("semi-panic: attempt to dup freed string");
1404 if (old->str_state == SS_INCR && !(old->str_pok & 2))
1407 Safefree(new->str_ptr);
1408 Copy(old,new,1,STR);
1410 new->str_ptr = nsavestr(old->str_ptr,old->str_len);
1411 new->str_pok &= ~SP_TEMP;
1420 register HENT *entry;
1421 register STAB *stab;
1424 register SPAT *spat;
1427 if (!*s) { /* reset ?? searches */
1428 for (spat = stash->tbl_spatroot;
1430 spat = spat->spat_next) {
1431 spat->spat_flags &= ~SPAT_USED;
1436 /* reset variables */
1438 if (!stash->tbl_array)
1446 for ( ; i <= max; i++) {
1447 for (entry = stash->tbl_array[i];
1449 entry = entry->hent_next) {
1450 stab = (STAB*)entry->hent_val;
1451 str = stab_val(stab);
1455 str->str_tainted = tainted;
1457 if (str->str_ptr != Nullch)
1458 str->str_ptr[0] = '\0';
1459 if (stab_xarray(stab)) {
1460 aclear(stab_xarray(stab));
1462 if (stab_xhash(stab)) {
1463 hclear(stab_xhash(stab), FALSE);
1464 if (stab == envstab)
1465 environ[0] = Nullch;
1478 fprintf(stderr,"%s %d %d %d\n",s,tainted,uid, euid);
1480 if (tainted && (!euid || euid != uid || egid != gid)) {
1490 register STR *envstr;
1492 envstr = hfetch(stab_hash(envstab),"PATH",4,FALSE);
1493 if (envstr == &str_undef || envstr->str_tainted) {
1495 if (envstr->str_tainted == 2)
1496 taintproper("Insecure directory in PATH");
1498 taintproper("Insecure PATH");
1500 envstr = hfetch(stab_hash(envstab),"IFS",3,FALSE);
1501 if (envstr != &str_undef && envstr->str_tainted) {
1503 taintproper("Insecure IFS");