1 /* $RCSfile: doarg.c,v $$Revision: 4.0.1.7 $$Date: 92/06/11 21:07:11 $
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.7 92/06/11 21:07:11 lwall
10 * patch34: join with null list attempted negative allocation
11 * patch34: sprintf("%6.4s", "abcdefg") didn't print "abcd "
13 * Revision 4.0.1.6 92/06/08 12:34:30 lwall
14 * patch20: removed implicit int declarations on funcions
15 * patch20: pattern modifiers i and o didn't interact right
16 * patch20: join() now pre-extends target string to avoid excessive copying
17 * patch20: fixed confusion between a *var's real name and its effective name
18 * patch20: subroutines didn't localize $`, $&, $', $1 et al correctly
19 * patch20: usersub routines didn't reclaim temp values soon enough
20 * patch20: ($<,$>) = ... didn't work on some architectures
21 * patch20: added Atari ST portability
23 * Revision 4.0.1.5 91/11/11 16:31:58 lwall
24 * patch19: added little-endian pack/unpack options
26 * Revision 4.0.1.4 91/11/05 16:35:06 lwall
27 * patch11: /$foo/o optimizer could access deallocated data
28 * patch11: minimum match length calculation in regexp is now cumulative
29 * patch11: added some support for 64-bit integers
30 * patch11: prepared for ctype implementations that don't define isascii()
31 * patch11: sprintf() now supports any length of s field
32 * patch11: indirect subroutine calls through magic vars (e.g. &$1) didn't work
33 * patch11: defined(&$foo) and undef(&$foo) didn't work
35 * Revision 4.0.1.3 91/06/10 01:18:41 lwall
36 * patch10: pack(hh,1) dumped core
38 * Revision 4.0.1.2 91/06/07 10:42:17 lwall
39 * patch4: new copyright notice
40 * patch4: // wouldn't use previous pattern if it started with a null character
41 * patch4: //o and s///o now optimize themselves fully at runtime
42 * patch4: added global modifier for pattern matches
43 * patch4: undef @array disabled "@array" interpolation
44 * patch4: chop("") was returning "\0" rather than ""
45 * patch4: vector logical operations &, | and ^ sometimes returned null string
46 * patch4: syscall couldn't pass numbers with most significant bit set on sparcs
48 * Revision 4.0.1.1 91/04/11 17:40:14 lwall
49 * patch1: fixed undefined environ problem
50 * patch1: fixed debugger coredump on subroutines
52 * Revision 4.0 91/03/20 01:06:42 lwall
60 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
64 extern unsigned char fold[];
67 #pragma function(memcmp)
68 #endif /* BUGGY_MSC */
70 static void doencodes();
81 register char *s = str_get(str);
82 char *strend = s + str->str_cur;
88 int maxiters = (strend - s) + 10;
94 rspat = spat = arg[2].arg_ptr.arg_spat;
96 fatal("panic: do_subst");
97 else if (spat->spat_runtime) {
99 (void)eval(spat->spat_runtime,G_SCALAR,sp);
100 m = str_get(dstr = stack->ary_array[sp+1]);
102 if (spat->spat_regexp) {
103 regfree(spat->spat_regexp);
104 spat->spat_regexp = Null(REGEXP*); /* required if regcomp pukes */
106 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
107 spat->spat_flags & SPAT_FOLD);
108 if (spat->spat_flags & SPAT_KEEP) {
109 if (!(spat->spat_flags & SPAT_FOLD))
110 scanconst(spat, m, dstr->str_cur);
111 arg_free(spat->spat_runtime); /* it won't change, so */
112 spat->spat_runtime = Nullarg; /* no point compiling again */
114 if (curcmd->c_expr && (curcmd->c_flags & CF_OPTIMIZE) == CFT_EVAL) {
115 curcmd->c_flags &= ~CF_OPTIMIZE;
116 opt_arg(curcmd, 1, curcmd->c_type == C_EXPR);
122 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
125 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
127 if (!spat->spat_regexp->prelen && lastspat)
131 if (hint < s || hint > strend)
132 fatal("panic: hint in do_match");
135 if (spat->spat_regexp->regback >= 0) {
136 s -= spat->spat_regexp->regback;
143 else if (spat->spat_short) {
144 if (spat->spat_flags & SPAT_SCANFIRST) {
145 if (str->str_pok & SP_STUDIED) {
146 if (screamfirst[spat->spat_short->str_rare] < 0)
148 else if (!(s = screaminstr(str,spat->spat_short)))
152 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
156 if (s && spat->spat_regexp->regback >= 0) {
157 ++spat->spat_short->str_u.str_useful;
158 s -= spat->spat_regexp->regback;
165 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
166 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
168 if (--spat->spat_short->str_u.str_useful < 0) {
169 str_free(spat->spat_short);
170 spat->spat_short = Nullstr; /* opt is being useless */
173 once = !(rspat->spat_flags & SPAT_GLOBAL);
174 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
175 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
176 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
177 else { /* constant over loop, anyway */
178 (void)eval(rspat->spat_repl,G_SCALAR,sp);
179 dstr = stack->ary_array[sp+1];
182 clen = dstr->str_cur;
183 if (clen <= spat->spat_regexp->minlen) {
184 /* can do inplace substitution */
185 if (regexec(spat->spat_regexp, s, strend, orig, 0,
186 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
187 if (spat->spat_regexp->subbase) /* oops, no we can't */
191 str->str_pok = SP_VALID; /* disable possible screamer */
193 m = spat->spat_regexp->startp[0];
194 d = spat->spat_regexp->endp[0];
196 if (m - s > strend - d) { /* faster to shorten from end */
198 Copy(c, m, clen, char);
207 str->str_cur = m - s;
209 str_numset(arg->arg_ptr.arg_str, 1.0);
210 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
214 else if (i = m - s) { /* faster from front */
222 Copy(c, m, clen, char);
224 str_numset(arg->arg_ptr.arg_str, 1.0);
225 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
233 str_numset(arg->arg_ptr.arg_str, 1.0);
234 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
240 str_numset(arg->arg_ptr.arg_str, 1.0);
241 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
247 if (iters++ > maxiters)
248 fatal("Substitution loop");
249 m = spat->spat_regexp->startp[0];
260 s = spat->spat_regexp->endp[0];
261 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
262 Nullstr, TRUE)); /* (don't match same null twice) */
265 str->str_cur = d - str->str_ptr + i;
266 Move(s,d,i+1,char); /* include the Null */
269 str_numset(arg->arg_ptr.arg_str, (double)iters);
270 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
273 str_numset(arg->arg_ptr.arg_str, 0.0);
274 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
280 if (regexec(spat->spat_regexp, s, strend, orig, 0,
281 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
283 dstr = Str_new(25,str_len(str));
284 str_nset(dstr,m,s-m);
285 if (spat->spat_regexp->subbase)
289 if (iters++ > maxiters)
290 fatal("Substitution loop");
291 if (spat->spat_regexp->subbase
292 && spat->spat_regexp->subbase != orig) {
295 orig = spat->spat_regexp->subbase;
297 strend = s + (strend - m);
299 m = spat->spat_regexp->startp[0];
300 str_ncat(dstr,s,m-s);
301 s = spat->spat_regexp->endp[0];
304 str_ncat(dstr,c,clen);
307 char *mysubbase = spat->spat_regexp->subbase;
309 spat->spat_regexp->subbase = Nullch; /* so recursion works */
310 (void)eval(rspat->spat_repl,G_SCALAR,sp);
311 str_scat(dstr,stack->ary_array[sp+1]);
312 if (spat->spat_regexp->subbase)
313 Safefree(spat->spat_regexp->subbase);
314 spat->spat_regexp->subbase = mysubbase;
318 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
320 str_ncat(dstr,s,strend - s);
321 str_replace(str,dstr);
323 str_numset(arg->arg_ptr.arg_str, (double)iters);
324 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
327 str_numset(arg->arg_ptr.arg_str, 0.0);
328 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
332 ++spat->spat_short->str_u.str_useful;
333 str_numset(arg->arg_ptr.arg_str, 0.0);
334 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
338 #pragma intrinsic(memcmp)
339 #endif /* BUGGY_MSC */
348 register int matches = 0;
352 register int squash = arg[2].arg_len & 1;
354 tbl = (short*) arg[2].arg_ptr.arg_cval;
356 send = s + str->str_cur;
358 fatal("panic: do_trans");
364 if (!arg[2].arg_len) {
366 if ((ch = tbl[*s & 0377]) >= 0) {
376 if ((ch = tbl[*s & 0377]) >= 0) {
378 if (matches++ && squash) {
387 else if (ch == -1) /* -1 is unmapped character */
388 *d++ = *s; /* -2 is delete character */
391 matches += send - d; /* account for disappeared chars */
393 str->str_cur = d - str->str_ptr;
404 register STR **st = stack->ary_array;
406 register int items = arglast[2] - sp;
407 register char *delim = str_get(st[sp]);
409 int delimlen = st[sp]->str_cur;
413 len = (items > 0 ? (delimlen * (items - 1) ) : 0);
414 if (str->str_len < len + items) { /* current length is way too short */
415 while (items-- > 0) {
417 len += (*st)->str_cur;
420 STR_GROW(str, len + 1); /* so try to pre-extend */
422 items = arglast[2] - sp;
427 str_sset(str, *st++);
432 for (; items > 0; items--,st++) {
433 str_ncat(str,delim,len);
438 for (; items > 0; items--,st++)
449 register STR **st = stack->ary_array;
450 register int sp = arglast[1];
452 register char *pat = str_get(st[sp]);
453 register char *patend = pat + st[sp]->str_cur;
458 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
459 static char *space10 = " ";
461 /* These must not be in registers: */
467 unsigned long aulong;
470 unsigned quad auquad;
476 items = arglast[2] - sp;
479 while (pat < patend) {
480 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
483 len = index("@Xxu",datumtype) ? 0 : items;
486 else if (isDIGIT(*pat)) {
488 while (isDIGIT(*pat))
489 len = (len * 10) + (*pat++ - '0');
497 fatal("% may only be used in unpack");
508 if (str->str_cur < len)
509 fatal("X outside of string");
511 str->str_ptr[str->str_cur] = '\0';
516 str_ncat(str,null10,10);
519 str_ncat(str,null10,len);
524 aptr = str_get(fromstr);
526 len = fromstr->str_cur;
527 if (fromstr->str_cur > len)
528 str_ncat(str,aptr,len);
530 str_ncat(str,aptr,fromstr->str_cur);
531 len -= fromstr->str_cur;
532 if (datumtype == 'A') {
534 str_ncat(str,space10,10);
537 str_ncat(str,space10,len);
541 str_ncat(str,null10,10);
544 str_ncat(str,null10,len);
556 aptr = str_get(fromstr);
558 len = fromstr->str_cur;
561 str->str_cur += (len+7)/8;
562 STR_GROW(str, str->str_cur + 1);
563 aptr = str->str_ptr + aint;
564 if (len > fromstr->str_cur)
565 len = fromstr->str_cur;
568 if (datumtype == 'B') {
569 for (len = 0; len++ < aint;) {
574 *aptr++ = items & 0xff;
580 for (len = 0; len++ < aint;) {
586 *aptr++ = items & 0xff;
592 if (datumtype == 'B')
593 items <<= 7 - (aint & 7);
595 items >>= 7 - (aint & 7);
596 *aptr++ = items & 0xff;
598 pat = str->str_ptr + str->str_cur;
614 aptr = str_get(fromstr);
616 len = fromstr->str_cur;
619 str->str_cur += (len+1)/2;
620 STR_GROW(str, str->str_cur + 1);
621 aptr = str->str_ptr + aint;
622 if (len > fromstr->str_cur)
623 len = fromstr->str_cur;
626 if (datumtype == 'H') {
627 for (len = 0; len++ < aint;) {
629 items |= ((*pat++ & 15) + 9) & 15;
631 items |= *pat++ & 15;
635 *aptr++ = items & 0xff;
641 for (len = 0; len++ < aint;) {
643 items |= (((*pat++ & 15) + 9) & 15) << 4;
645 items |= (*pat++ & 15) << 4;
649 *aptr++ = items & 0xff;
655 *aptr++ = items & 0xff;
656 pat = str->str_ptr + str->str_cur;
668 aint = (int)str_gnum(fromstr);
670 str_ncat(str,&achar,sizeof(char));
673 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
678 afloat = (float)str_gnum(fromstr);
679 str_ncat(str, (char *)&afloat, sizeof (float));
686 adouble = (double)str_gnum(fromstr);
687 str_ncat(str, (char *)&adouble, sizeof (double));
693 ashort = (short)str_gnum(fromstr);
695 ashort = htons(ashort);
697 str_ncat(str,(char*)&ashort,sizeof(short));
703 ashort = (short)str_gnum(fromstr);
705 ashort = htovs(ashort);
707 str_ncat(str,(char*)&ashort,sizeof(short));
714 ashort = (short)str_gnum(fromstr);
715 str_ncat(str,(char*)&ashort,sizeof(short));
721 auint = U_I(str_gnum(fromstr));
722 str_ncat(str,(char*)&auint,sizeof(unsigned int));
728 aint = (int)str_gnum(fromstr);
729 str_ncat(str,(char*)&aint,sizeof(int));
735 aulong = U_L(str_gnum(fromstr));
737 aulong = htonl(aulong);
739 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
745 aulong = U_L(str_gnum(fromstr));
747 aulong = htovl(aulong);
749 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
755 aulong = U_L(str_gnum(fromstr));
756 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
762 along = (long)str_gnum(fromstr);
763 str_ncat(str,(char*)&along,sizeof(long));
770 auquad = (unsigned quad)str_gnum(fromstr);
771 str_ncat(str,(char*)&auquad,sizeof(unsigned quad));
777 aquad = (quad)str_gnum(fromstr);
778 str_ncat(str,(char*)&aquad,sizeof(quad));
785 aptr = str_get(fromstr);
786 str_ncat(str,(char*)&aptr,sizeof(char*));
791 aptr = str_get(fromstr);
792 aint = fromstr->str_cur;
793 STR_GROW(str,aint * 4 / 3);
805 doencodes(str, aptr, todo);
817 doencodes(str, s, len)
825 str_ncat(str, hunk, 1);
828 hunk[0] = ' ' + (077 & (*s >> 2));
829 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
830 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
831 hunk[3] = ' ' + (077 & (s[2] & 077));
832 str_ncat(str, hunk, 4);
836 for (s = str->str_ptr; *s; s++) {
840 str_ncat(str, "\n", 1);
844 do_sprintf(str,len,sarg)
857 static STR *sargnull = &str_no;
867 len--; /* don't count pattern string */
868 t = s = str_get(*sarg);
869 send = s + (*sarg)->str_cur;
874 if (len <= 0 || !(arg = *sarg++))
878 for ( ; t < send && *t != '%'; t++) ;
880 break; /* end of format string, ignore extra args */
889 for (t++; t < send; t++) {
898 case '0': case '1': case '2': case '3': case '4':
899 case '5': case '6': case '7': case '8': case '9':
900 case '.': case '#': case '-': case '+': case ' ':
914 xlen = (int)str_gnum(arg);
915 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
921 (void)sprintf(xs,f,xlen);
933 (void)sprintf(buf,s,(quad)str_gnum(arg));
937 (void)sprintf(xs,f,(long)str_gnum(arg));
939 (void)sprintf(xs,f,(int)str_gnum(arg));
945 case 'x': case 'o': case 'u':
948 value = str_gnum(arg);
951 (void)sprintf(buf,s,(unsigned quad)value);
955 (void)sprintf(xs,f,U_L(value));
957 (void)sprintf(xs,f,U_I(value));
960 case 'E': case 'e': case 'f': case 'G': case 'g':
963 (void)sprintf(xs,f,str_gnum(arg));
971 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B' && xs[3] == '\0'
972 && xlen == sizeof(STBP)) {
973 STR *tmpstr = Str_new(24,0);
975 stab_efullname(tmpstr, ((STAB*)arg)); /* a stab value! */
976 sprintf(tokenbuf,"*%s",tmpstr->str_ptr);
977 /* reformat to non-binary */
979 xlen = strlen(tokenbuf);
982 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
983 break; /* so handle simple cases */
985 else if (f[1] == '-') {
986 char *mp = index(f, '.');
990 int max = atoi(mp+1);
999 else if (isDIGIT(f[1])) {
1000 char *mp = index(f, '.');
1001 int min = atoi(f+1);
1004 int max = atoi(mp+1);
1013 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
1015 (void)sprintf(buf,tokenbuf+64,xs);
1020 /* end of switch, copy results */
1022 STR_GROW(str, str->str_cur + (f - s) + xlen + 1 + pre + post);
1023 str_ncat(str, s, f - s);
1025 repeatcpy(str->str_ptr + str->str_cur, " ", 1, pre);
1026 str->str_cur += pre;
1028 str_ncat(str, xs, xlen);
1030 repeatcpy(str->str_ptr + str->str_cur, " ", 1, post);
1031 str->str_cur += post;
1034 break; /* break from for loop */
1037 str_ncat(str, s, t - s);
1042 do_push(ary,arglast)
1043 register ARRAY *ary;
1046 register STR **st = stack->ary_array;
1047 register int sp = arglast[1];
1048 register int items = arglast[2] - sp;
1049 register STR *str = &str_undef;
1051 for (st += ++sp; items > 0; items--,st++) {
1052 str = Str_new(26,0);
1055 (void)apush(ary,str);
1061 do_unshift(ary,arglast)
1062 register ARRAY *ary;
1065 register STR **st = stack->ary_array;
1066 register int sp = arglast[1];
1067 register int items = arglast[2] - sp;
1071 aunshift(ary,items);
1073 for (st += ++sp; i < items; i++,st++) {
1074 str = Str_new(27,0);
1076 (void)astore(ary,i,str);
1081 do_subr(arg,gimme,arglast)
1086 register STR **st = stack->ary_array;
1087 register int sp = arglast[1];
1088 register int items = arglast[2] - sp;
1090 SPAT * VOLATILE oldspat = curspat;
1093 int oldsave = savestack->ary_fill;
1094 int oldtmps_base = tmps_base;
1095 int hasargs = ((arg[2].arg_type & A_MASK) != A_NULL);
1098 if ((arg[1].arg_type & A_MASK) == A_WORD)
1099 stab = arg[1].arg_ptr.arg_stab;
1101 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1104 stab = stabent(str_get(tmpstr),TRUE);
1109 fatal("Undefined subroutine called");
1110 if (!(sub = stab_sub(stab))) {
1111 STR *tmpstr = arg[0].arg_ptr.arg_str;
1113 stab_efullname(tmpstr, stab);
1114 fatal("Undefined subroutine \"%s\" called",tmpstr->str_ptr);
1116 if (arg->arg_type == O_DBSUBR && !sub->usersub) {
1117 str = stab_val(DBsub);
1119 stab_efullname(str,stab);
1120 sub = stab_sub(DBsub);
1122 fatal("No DBsub routine");
1124 str = Str_new(15, sizeof(CSV));
1125 str->str_state = SS_SCSV;
1126 (void)apush(savestack,str);
1127 csv = (CSV*)str->str_ptr;
1130 csv->curcsv = curcsv;
1131 csv->curcmd = curcmd;
1132 csv->depth = sub->depth;
1133 csv->wantarray = gimme;
1134 csv->hasargs = hasargs;
1136 tmps_base = tmps_max;
1139 csv->savearray = Null(ARRAY*);;
1140 csv->argarray = Null(ARRAY*);
1141 st[sp] = arg->arg_ptr.arg_str;
1144 sp = (*sub->usersub)(sub->userindex,sp,items);
1148 csv->savearray = stab_xarray(defstab);
1149 csv->argarray = afake(defstab, items, &st[sp+1]);
1150 stab_xarray(defstab) = csv->argarray;
1153 if (sub->depth >= 2) { /* save temporaries on recursion? */
1154 if (sub->depth == 100 && dowarn)
1155 warn("Deep recursion on subroutine \"%s\"",stab_ename(stab));
1156 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
1158 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
1161 st = stack->ary_array;
1162 tmps_base = oldtmps_base;
1163 for (items = arglast[0] + 1; items <= sp; items++)
1164 st[items] = str_mortal(st[items]);
1165 /* in case restore wipes old str */
1166 restorelist(oldsave);
1172 do_assign(arg,gimme,arglast)
1178 register STR **st = stack->ary_array;
1179 STR **firstrelem = st + arglast[1] + 1;
1180 STR **firstlelem = st + arglast[0] + 1;
1181 STR **lastrelem = st + arglast[2];
1182 STR **lastlelem = st + arglast[1];
1183 register STR **relem;
1184 register STR **lelem;
1187 register ARRAY *ary;
1188 register int makelocal;
1192 makelocal = (arg->arg_flags & AF_LOCAL) != 0;
1193 localizing = makelocal;
1194 delaymagic = DM_DELAY; /* catch simultaneous items */
1196 /* If there's a common identifier on both sides we have to take
1197 * special care that assigning the identifier on the left doesn't
1198 * clobber a value on the right that's used later in the list.
1200 if (arg->arg_flags & AF_COMMON) {
1201 for (relem = firstrelem; relem <= lastrelem; relem++) {
1204 *relem = str_mortal(str);
1211 while (lelem <= lastlelem) {
1213 if (str->str_state >= SS_HASH) {
1214 if (str->str_state == SS_ARY) {
1216 ary = saveary(str->str_u.str_stab);
1218 ary = stab_array(str->str_u.str_stab);
1222 while (relem <= lastrelem) { /* gobble up all the rest */
1223 str = Str_new(28,0);
1225 str_sset(str,*relem);
1227 (void)astore(ary,i++,str);
1230 else if (str->str_state == SS_HASH) {
1234 STAB *tmpstab = str->str_u.str_stab;
1237 hash = savehash(str->str_u.str_stab);
1239 hash = stab_hash(str->str_u.str_stab);
1240 if (tmpstab == envstab) {
1242 environ[0] = Nullch;
1244 else if (tmpstab == sigstab) {
1249 for (i = 1; i < NSIG; i++)
1250 signal(i, SIG_DFL); /* crunch, crunch, crunch */
1253 else if (hash->tbl_dbm)
1256 hclear(hash, magic == 'D'); /* wipe any dbm file too */
1259 while (relem < lastrelem) { /* gobble up all the rest */
1263 str = &str_no, relem++;
1264 tmps = str_get(str);
1265 tmpstr = Str_new(29,0);
1267 str_sset(tmpstr,*relem); /* value */
1268 *(relem++) = tmpstr;
1269 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
1271 str_magic(tmpstr, tmpstab, magic, tmps, str->str_cur);
1272 stabset(tmpstr->str_magic, tmpstr);
1277 fatal("panic: do_assign");
1282 if (relem <= lastrelem) {
1283 str_sset(str, *relem);
1287 str_sset(str, &str_undef);
1288 if (gimme == G_ARRAY) {
1289 i = ++lastrelem - firstrelem;
1290 relem++; /* tacky, I suppose */
1291 astore(stack,i,str);
1292 if (st != stack->ary_array) {
1293 st = stack->ary_array;
1294 firstrelem = st + arglast[1] + 1;
1295 firstlelem = st + arglast[0] + 1;
1296 lastlelem = st + arglast[1];
1298 relem = lastrelem + 1;
1305 if (delaymagic & ~DM_DELAY) {
1306 if (delaymagic & DM_UID) {
1308 (void)setreuid(uid,euid);
1309 #else /* not HAS_SETREUID */
1311 if ((delaymagic & DM_UID) == DM_RUID) {
1313 delaymagic =~ DM_RUID;
1315 #endif /* HAS_SETRUID */
1317 if ((delaymagic & DM_UID) == DM_EUID) {
1319 delaymagic =~ DM_EUID;
1321 #endif /* HAS_SETEUID */
1322 if (delaymagic & DM_UID) {
1324 fatal("No setreuid available");
1327 #endif /* not HAS_SETREUID */
1328 uid = (int)getuid();
1329 euid = (int)geteuid();
1331 if (delaymagic & DM_GID) {
1333 (void)setregid(gid,egid);
1334 #else /* not HAS_SETREGID */
1336 if ((delaymagic & DM_GID) == DM_RGID) {
1338 delaymagic =~ DM_RGID;
1340 #endif /* HAS_SETRGID */
1342 if ((delaymagic & DM_GID) == DM_EGID) {
1344 delaymagic =~ DM_EGID;
1346 #endif /* HAS_SETEGID */
1347 if (delaymagic & DM_GID) {
1349 fatal("No setregid available");
1352 #endif /* not HAS_SETREGID */
1353 gid = (int)getgid();
1354 egid = (int)getegid();
1359 if (gimme == G_ARRAY) {
1360 i = lastrelem - firstrelem + 1;
1362 Copy(firstrelem, firstlelem, i, STR*);
1363 return arglast[0] + i;
1366 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
1367 *firstlelem = arg->arg_ptr.arg_str;
1368 return arglast[0] + 1;
1372 int /*SUPPRESS 590*/
1373 do_study(str,arg,gimme,arglast)
1379 register unsigned char *s;
1380 register int pos = str->str_cur;
1382 register int *sfirst;
1383 register int *snext;
1384 static int maxscream = -1;
1385 static STR *lastscream = Nullstr;
1387 int retarg = arglast[0] + 1;
1390 s = (unsigned char*)(str_get(str));
1392 s = Null(unsigned char*);
1395 lastscream->str_pok &= ~SP_STUDIED;
1401 if (pos > maxscream) {
1402 if (maxscream < 0) {
1403 maxscream = pos + 80;
1404 New(301,screamfirst, 256, int);
1405 New(302,screamnext, maxscream, int);
1408 maxscream = pos + pos / 4;
1409 Renew(screamnext, maxscream, int);
1413 sfirst = screamfirst;
1416 if (!sfirst || !snext)
1417 fatal("do_study: out of memory");
1419 for (ch = 256; ch; --ch)
1423 while (--pos >= 0) {
1425 if (sfirst[ch] >= 0)
1426 snext[pos] = sfirst[ch] - pos;
1431 /* If there were any case insensitive searches, we must assume they
1432 * all are. This speeds up insensitive searches much more than
1433 * it slows down sensitive ones.
1436 sfirst[fold[ch]] = pos;
1439 str->str_pok |= SP_STUDIED;
1442 str_numset(arg->arg_ptr.arg_str,(double)retval);
1443 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1447 int /*SUPPRESS 590*/
1448 do_defined(str,arg,gimme,arglast)
1455 register int retarg = arglast[0] + 1;
1460 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1461 fatal("Illegal argument to defined()");
1462 arg = arg[1].arg_ptr.arg_arg;
1463 type = arg->arg_type;
1465 if (type == O_SUBR || type == O_DBSUBR) {
1466 if ((arg[1].arg_type & A_MASK) == A_WORD)
1467 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1469 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1471 retval = tmpstr && stab_sub(stabent(str_get(tmpstr),TRUE)) != 0;
1474 else if (type == O_ARRAY || type == O_LARRAY ||
1475 type == O_ASLICE || type == O_LASLICE )
1476 retval = ((ary = stab_xarray(arg[1].arg_ptr.arg_stab)) != 0
1477 && ary->ary_max >= 0 );
1478 else if (type == O_HASH || type == O_LHASH ||
1479 type == O_HSLICE || type == O_LHSLICE )
1480 retval = ((hash = stab_xhash(arg[1].arg_ptr.arg_stab)) != 0
1481 && hash->tbl_array);
1484 str_numset(str,(double)retval);
1485 stack->ary_array[retarg] = str;
1489 int /*SUPPRESS 590*/
1490 do_undef(str,arg,gimme,arglast)
1497 register STAB *stab;
1498 int retarg = arglast[0] + 1;
1500 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1501 fatal("Illegal argument to undef()");
1502 arg = arg[1].arg_ptr.arg_arg;
1503 type = arg->arg_type;
1505 if (type == O_ARRAY || type == O_LARRAY) {
1506 stab = arg[1].arg_ptr.arg_stab;
1507 afree(stab_xarray(stab));
1508 stab_xarray(stab) = anew(stab); /* so "@array" still works */
1510 else if (type == O_HASH || type == O_LHASH) {
1511 stab = arg[1].arg_ptr.arg_stab;
1512 if (stab == envstab)
1513 environ[0] = Nullch;
1514 else if (stab == sigstab) {
1517 for (i = 1; i < NSIG; i++)
1518 signal(i, SIG_DFL); /* munch, munch, munch */
1520 (void)hfree(stab_xhash(stab), TRUE);
1521 stab_xhash(stab) = Null(HASH*);
1523 else if (type == O_SUBR || type == O_DBSUBR) {
1524 stab = arg[1].arg_ptr.arg_stab;
1525 if ((arg[1].arg_type & A_MASK) != A_WORD) {
1526 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1529 stab = stabent(str_get(tmpstr),TRUE);
1533 if (stab && stab_sub(stab)) {
1534 cmd_free(stab_sub(stab)->cmd);
1535 stab_sub(stab)->cmd = Nullcmd;
1536 afree(stab_sub(stab)->tosave);
1537 Safefree(stab_sub(stab));
1538 stab_sub(stab) = Null(SUBR*);
1542 fatal("Can't undefine that kind of object");
1543 str_numset(str,0.0);
1544 stack->ary_array[retarg] = str;
1549 do_vec(lvalue,astr,arglast)
1554 STR **st = stack->ary_array;
1555 int sp = arglast[0];
1556 register STR *str = st[++sp];
1557 register int offset = (int)str_gnum(st[++sp]);
1558 register int size = (int)str_gnum(st[++sp]);
1559 unsigned char *s = (unsigned char*)str_get(str);
1560 unsigned long retnum;
1564 offset *= size; /* turn into bit offset */
1565 len = (offset + size + 7) / 8;
1566 if (offset < 0 || size < 1)
1568 else if (!lvalue && len > str->str_cur)
1571 if (len > str->str_cur) {
1573 (void)memzero(str->str_ptr + str->str_cur, len - str->str_cur);
1576 s = (unsigned char*)str_get(str);
1578 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1583 else if (size == 16)
1584 retnum = ((unsigned long) s[offset] << 8) + s[offset+1];
1585 else if (size == 32)
1586 retnum = ((unsigned long) s[offset] << 24) +
1587 ((unsigned long) s[offset + 1] << 16) +
1588 (s[offset + 2] << 8) + s[offset+3];
1591 if (lvalue) { /* it's an lvalue! */
1592 struct lstring *lstr = (struct lstring*)astr;
1594 astr->str_magic = str;
1595 st[sp]->str_rare = 'v';
1596 lstr->lstr_offset = offset;
1597 lstr->lstr_len = size;
1601 str_numset(astr,(double)retnum);
1611 struct lstring *lstr = (struct lstring*)str;
1612 register int offset;
1614 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1615 register unsigned long lval = U_L(str_gnum(str));
1619 str->str_magic = Nullstr;
1620 offset = lstr->lstr_offset;
1621 size = lstr->lstr_len;
1623 mask = (1 << size) - 1;
1627 s[offset] &= ~(mask << size);
1628 s[offset] |= lval << size;
1632 s[offset] = lval & 255;
1633 else if (size == 16) {
1634 s[offset] = (lval >> 8) & 255;
1635 s[offset+1] = lval & 255;
1637 else if (size == 32) {
1638 s[offset] = (lval >> 24) & 255;
1639 s[offset+1] = (lval >> 16) & 255;
1640 s[offset+2] = (lval >> 8) & 255;
1641 s[offset+3] = lval & 255;
1651 register char *tmps;
1659 if (str->str_state == SS_ARY) {
1660 ary = stab_array(str->str_u.str_stab);
1661 for (i = 0; i <= ary->ary_fill; i++)
1662 do_chop(astr,ary->ary_array[i]);
1665 if (str->str_state == SS_HASH) {
1666 hash = stab_hash(str->str_u.str_stab);
1667 (void)hiterinit(hash);
1669 while (entry = hiternext(hash))
1670 do_chop(astr,hiterval(hash,entry));
1673 tmps = str_get(str);
1674 if (tmps && str->str_cur) {
1675 tmps += str->str_cur - 1;
1676 str_nset(astr,tmps,1); /* remember last char */
1677 *tmps = '\0'; /* wipe it out */
1678 str->str_cur = tmps - str->str_ptr;
1683 str_nset(astr,"",0);
1687 do_vop(optype,str,left,right)
1693 register char *l = str_get(left);
1694 register char *r = str_get(right);
1697 len = left->str_cur;
1698 if (len > right->str_cur)
1699 len = right->str_cur;
1700 if (str->str_cur > len)
1702 else if (str->str_cur < len) {
1704 (void)memzero(str->str_ptr + str->str_cur, len - str->str_cur);
1728 if (right->str_cur > len)
1729 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1730 else if (left->str_cur > len)
1731 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1740 register STR **st = stack->ary_array;
1741 register int sp = arglast[1];
1742 register int items = arglast[2] - sp;
1744 unsigned long arg[14]; /* yes, we really need that many ! */
1746 unsigned long arg[8];
1753 for (st += ++sp; items--; st++)
1754 tainted |= (*st)->str_tainted;
1755 st = stack->ary_array;
1757 items = arglast[2] - sp;
1760 taintproper("Insecure dependency in syscall");
1762 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1763 * or where sizeof(long) != sizeof(char*). But such machines will
1764 * not likely have syscall implemented either, so who cares?
1767 if (st[++sp]->str_nok || !i)
1768 arg[i++] = (unsigned long)str_gnum(st[sp]);
1771 arg[i++] = (unsigned long)st[sp]->str_ptr;
1775 items = arglast[2] - sp;
1778 fatal("Too few args to syscall");
1780 retval = syscall(arg[0]);
1783 retval = syscall(arg[0],arg[1]);
1786 retval = syscall(arg[0],arg[1],arg[2]);
1789 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1792 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1795 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1798 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1801 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1806 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1810 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1811 arg[7], arg[8], arg[9]);
1814 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1815 arg[7], arg[8], arg[9], arg[10]);
1818 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1819 arg[7], arg[8], arg[9], arg[10], arg[11]);
1822 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1823 arg[7], arg[8], arg[9], arg[10], arg[11], arg[12]);
1826 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1827 arg[7], arg[8], arg[9], arg[10], arg[11], arg[12], arg[13]);
1829 #endif /* atarist */
1833 fatal("syscall() unimplemented");