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;
215 else if (i = m - s) { /* faster from front */
223 Copy(c, m, clen, char);
225 str_numset(arg->arg_ptr.arg_str, 1.0);
226 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
235 str_numset(arg->arg_ptr.arg_str, 1.0);
236 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
243 str_numset(arg->arg_ptr.arg_str, 1.0);
244 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
251 if (iters++ > maxiters)
252 fatal("Substitution loop");
253 m = spat->spat_regexp->startp[0];
264 s = spat->spat_regexp->endp[0];
265 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
266 Nullstr, TRUE)); /* (don't match same null twice) */
269 str->str_cur = d - str->str_ptr + i;
270 Move(s,d,i+1,char); /* include the Null */
273 str_numset(arg->arg_ptr.arg_str, (double)iters);
274 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
278 str_numset(arg->arg_ptr.arg_str, 0.0);
279 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
285 if (regexec(spat->spat_regexp, s, strend, orig, 0,
286 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
288 dstr = Str_new(25,str_len(str));
289 str_nset(dstr,m,s-m);
290 if (spat->spat_regexp->subbase)
294 if (iters++ > maxiters)
295 fatal("Substitution loop");
296 if (spat->spat_regexp->subbase
297 && spat->spat_regexp->subbase != orig) {
300 orig = spat->spat_regexp->subbase;
302 strend = s + (strend - m);
304 m = spat->spat_regexp->startp[0];
305 str_ncat(dstr,s,m-s);
306 s = spat->spat_regexp->endp[0];
309 str_ncat(dstr,c,clen);
312 char *mysubbase = spat->spat_regexp->subbase;
314 spat->spat_regexp->subbase = Nullch; /* so recursion works */
315 (void)eval(rspat->spat_repl,G_SCALAR,sp);
316 str_scat(dstr,stack->ary_array[sp+1]);
317 if (spat->spat_regexp->subbase)
318 Safefree(spat->spat_regexp->subbase);
319 spat->spat_regexp->subbase = mysubbase;
323 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
325 str_ncat(dstr,s,strend - s);
326 str_replace(str,dstr);
328 str_numset(arg->arg_ptr.arg_str, (double)iters);
329 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
333 str_numset(arg->arg_ptr.arg_str, 0.0);
334 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
338 ++spat->spat_short->str_u.str_useful;
339 str_numset(arg->arg_ptr.arg_str, 0.0);
340 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
344 #pragma intrinsic(memcmp)
345 #endif /* BUGGY_MSC */
354 register int matches = 0;
358 register int squash = arg[2].arg_len & 1;
360 tbl = (short*) arg[2].arg_ptr.arg_cval;
362 send = s + str->str_cur;
364 fatal("panic: do_trans");
370 if (!arg[2].arg_len) {
372 if ((ch = tbl[*s & 0377]) >= 0) {
382 if ((ch = tbl[*s & 0377]) >= 0) {
384 if (matches++ && squash) {
393 else if (ch == -1) /* -1 is unmapped character */
394 *d++ = *s; /* -2 is delete character */
397 matches += send - d; /* account for disappeared chars */
399 str->str_cur = d - str->str_ptr;
410 register STR **st = stack->ary_array;
412 register int items = arglast[2] - sp;
413 register char *delim = str_get(st[sp]);
415 int delimlen = st[sp]->str_cur;
419 len = (items > 0 ? (delimlen * (items - 1) ) : 0);
420 if (str->str_len < len + items) { /* current length is way too short */
421 while (items-- > 0) {
423 len += (*st)->str_cur;
426 STR_GROW(str, len + 1); /* so try to pre-extend */
428 items = arglast[2] - sp;
433 str_sset(str, *st++);
438 for (; items > 0; items--,st++) {
439 str_ncat(str,delim,len);
444 for (; items > 0; items--,st++)
455 register STR **st = stack->ary_array;
456 register int sp = arglast[1];
458 register char *pat = str_get(st[sp]);
459 register char *patend = pat + st[sp]->str_cur;
464 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
465 static char *space10 = " ";
467 /* These must not be in registers: */
473 unsigned long aulong;
476 unsigned quad auquad;
482 items = arglast[2] - sp;
485 while (pat < patend) {
486 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
489 len = index("@Xxu",datumtype) ? 0 : items;
492 else if (isDIGIT(*pat)) {
494 while (isDIGIT(*pat))
495 len = (len * 10) + (*pat++ - '0');
503 fatal("% may only be used in unpack");
514 if (str->str_cur < len)
515 fatal("X outside of string");
517 str->str_ptr[str->str_cur] = '\0';
522 str_ncat(str,null10,10);
525 str_ncat(str,null10,len);
530 aptr = str_get(fromstr);
532 len = fromstr->str_cur;
533 if (fromstr->str_cur > len)
534 str_ncat(str,aptr,len);
536 str_ncat(str,aptr,fromstr->str_cur);
537 len -= fromstr->str_cur;
538 if (datumtype == 'A') {
540 str_ncat(str,space10,10);
543 str_ncat(str,space10,len);
547 str_ncat(str,null10,10);
550 str_ncat(str,null10,len);
562 aptr = str_get(fromstr);
564 len = fromstr->str_cur;
567 str->str_cur += (len+7)/8;
568 STR_GROW(str, str->str_cur + 1);
569 aptr = str->str_ptr + aint;
570 if (len > fromstr->str_cur)
571 len = fromstr->str_cur;
574 if (datumtype == 'B') {
575 for (len = 0; len++ < aint;) {
580 *aptr++ = items & 0xff;
586 for (len = 0; len++ < aint;) {
592 *aptr++ = items & 0xff;
598 if (datumtype == 'B')
599 items <<= 7 - (aint & 7);
601 items >>= 7 - (aint & 7);
602 *aptr++ = items & 0xff;
604 pat = str->str_ptr + str->str_cur;
620 aptr = str_get(fromstr);
622 len = fromstr->str_cur;
625 str->str_cur += (len+1)/2;
626 STR_GROW(str, str->str_cur + 1);
627 aptr = str->str_ptr + aint;
628 if (len > fromstr->str_cur)
629 len = fromstr->str_cur;
632 if (datumtype == 'H') {
633 for (len = 0; len++ < aint;) {
635 items |= ((*pat++ & 15) + 9) & 15;
637 items |= *pat++ & 15;
641 *aptr++ = items & 0xff;
647 for (len = 0; len++ < aint;) {
649 items |= (((*pat++ & 15) + 9) & 15) << 4;
651 items |= (*pat++ & 15) << 4;
655 *aptr++ = items & 0xff;
661 *aptr++ = items & 0xff;
662 pat = str->str_ptr + str->str_cur;
674 aint = (int)str_gnum(fromstr);
676 str_ncat(str,&achar,sizeof(char));
679 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
684 afloat = (float)str_gnum(fromstr);
685 str_ncat(str, (char *)&afloat, sizeof (float));
692 adouble = (double)str_gnum(fromstr);
693 str_ncat(str, (char *)&adouble, sizeof (double));
699 ashort = (short)str_gnum(fromstr);
701 ashort = htons(ashort);
703 str_ncat(str,(char*)&ashort,sizeof(short));
709 ashort = (short)str_gnum(fromstr);
711 ashort = htovs(ashort);
713 str_ncat(str,(char*)&ashort,sizeof(short));
720 ashort = (short)str_gnum(fromstr);
721 str_ncat(str,(char*)&ashort,sizeof(short));
727 auint = U_I(str_gnum(fromstr));
728 str_ncat(str,(char*)&auint,sizeof(unsigned int));
734 aint = (int)str_gnum(fromstr);
735 str_ncat(str,(char*)&aint,sizeof(int));
741 aulong = U_L(str_gnum(fromstr));
743 aulong = htonl(aulong);
745 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
751 aulong = U_L(str_gnum(fromstr));
753 aulong = htovl(aulong);
755 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
761 aulong = U_L(str_gnum(fromstr));
762 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
768 along = (long)str_gnum(fromstr);
769 str_ncat(str,(char*)&along,sizeof(long));
776 auquad = (unsigned quad)str_gnum(fromstr);
777 str_ncat(str,(char*)&auquad,sizeof(unsigned quad));
783 aquad = (quad)str_gnum(fromstr);
784 str_ncat(str,(char*)&aquad,sizeof(quad));
791 aptr = str_get(fromstr);
792 str_ncat(str,(char*)&aptr,sizeof(char*));
797 aptr = str_get(fromstr);
798 aint = fromstr->str_cur;
799 STR_GROW(str,aint * 4 / 3);
811 doencodes(str, aptr, todo);
823 doencodes(str, s, len)
831 str_ncat(str, hunk, 1);
834 hunk[0] = ' ' + (077 & (*s >> 2));
835 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
836 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
837 hunk[3] = ' ' + (077 & (s[2] & 077));
838 str_ncat(str, hunk, 4);
842 for (s = str->str_ptr; *s; s++) {
846 str_ncat(str, "\n", 1);
850 do_sprintf(str,len,sarg)
863 static STR *sargnull = &str_no;
873 len--; /* don't count pattern string */
874 t = s = str_get(*sarg);
875 send = s + (*sarg)->str_cur;
880 if (len <= 0 || !(arg = *sarg++))
884 for ( ; t < send && *t != '%'; t++) ;
886 break; /* end of format string, ignore extra args */
895 for (t++; t < send; t++) {
904 case '0': case '1': case '2': case '3': case '4':
905 case '5': case '6': case '7': case '8': case '9':
906 case '.': case '#': case '-': case '+': case ' ':
920 xlen = (int)str_gnum(arg);
921 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
927 (void)sprintf(xs,f,xlen);
939 (void)sprintf(buf,s,(quad)str_gnum(arg));
943 (void)sprintf(xs,f,(long)str_gnum(arg));
945 (void)sprintf(xs,f,(int)str_gnum(arg));
951 case 'x': case 'o': case 'u':
954 value = str_gnum(arg);
957 (void)sprintf(buf,s,(unsigned quad)value);
961 (void)sprintf(xs,f,U_L(value));
963 (void)sprintf(xs,f,U_I(value));
966 case 'E': case 'e': case 'f': case 'G': case 'g':
969 (void)sprintf(xs,f,str_gnum(arg));
977 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B' && xs[3] == '\0'
978 && xlen == sizeof(STBP)) {
979 STR *tmpstr = Str_new(24,0);
981 stab_efullname(tmpstr, ((STAB*)arg)); /* a stab value! */
982 sprintf(tokenbuf,"*%s",tmpstr->str_ptr);
983 /* reformat to non-binary */
985 xlen = strlen(tokenbuf);
988 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
989 break; /* so handle simple cases */
991 else if (f[1] == '-') {
992 char *mp = index(f, '.');
996 int max = atoi(mp+1);
1005 else if (isDIGIT(f[1])) {
1006 char *mp = index(f, '.');
1007 int min = atoi(f+1);
1010 int max = atoi(mp+1);
1019 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
1021 (void)sprintf(buf,tokenbuf+64,xs);
1026 /* end of switch, copy results */
1028 STR_GROW(str, str->str_cur + (f - s) + xlen + 1 + pre + post);
1029 str_ncat(str, s, f - s);
1031 repeatcpy(str->str_ptr + str->str_cur, " ", 1, pre);
1032 str->str_cur += pre;
1034 str_ncat(str, xs, xlen);
1036 repeatcpy(str->str_ptr + str->str_cur, " ", 1, post);
1037 str->str_cur += post;
1040 break; /* break from for loop */
1043 str_ncat(str, s, t - s);
1048 do_push(ary,arglast)
1049 register ARRAY *ary;
1052 register STR **st = stack->ary_array;
1053 register int sp = arglast[1];
1054 register int items = arglast[2] - sp;
1055 register STR *str = &str_undef;
1057 for (st += ++sp; items > 0; items--,st++) {
1058 str = Str_new(26,0);
1061 (void)apush(ary,str);
1067 do_unshift(ary,arglast)
1068 register ARRAY *ary;
1071 register STR **st = stack->ary_array;
1072 register int sp = arglast[1];
1073 register int items = arglast[2] - sp;
1077 aunshift(ary,items);
1079 for (st += ++sp; i < items; i++,st++) {
1080 str = Str_new(27,0);
1082 (void)astore(ary,i,str);
1087 do_subr(arg,gimme,arglast)
1092 register STR **st = stack->ary_array;
1093 register int sp = arglast[1];
1094 register int items = arglast[2] - sp;
1096 SPAT * VOLATILE oldspat = curspat;
1099 int oldsave = savestack->ary_fill;
1100 int oldtmps_base = tmps_base;
1101 int hasargs = ((arg[2].arg_type & A_MASK) != A_NULL);
1104 if ((arg[1].arg_type & A_MASK) == A_WORD)
1105 stab = arg[1].arg_ptr.arg_stab;
1107 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1110 stab = stabent(str_get(tmpstr),TRUE);
1115 fatal("Undefined subroutine called");
1116 if (!(sub = stab_sub(stab))) {
1117 STR *tmpstr = arg[0].arg_ptr.arg_str;
1119 stab_efullname(tmpstr, stab);
1120 fatal("Undefined subroutine \"%s\" called",tmpstr->str_ptr);
1122 if (arg->arg_type == O_DBSUBR && !sub->usersub) {
1123 str = stab_val(DBsub);
1125 stab_efullname(str,stab);
1126 sub = stab_sub(DBsub);
1128 fatal("No DBsub routine");
1130 str = Str_new(15, sizeof(CSV));
1131 str->str_state = SS_SCSV;
1132 (void)apush(savestack,str);
1133 csv = (CSV*)str->str_ptr;
1136 csv->curcsv = curcsv;
1137 csv->curcmd = curcmd;
1138 csv->depth = sub->depth;
1139 csv->wantarray = gimme;
1140 csv->hasargs = hasargs;
1142 tmps_base = tmps_max;
1145 csv->savearray = Null(ARRAY*);;
1146 csv->argarray = Null(ARRAY*);
1147 st[sp] = arg->arg_ptr.arg_str;
1150 sp = (*sub->usersub)(sub->userindex,sp,items);
1154 csv->savearray = stab_xarray(defstab);
1155 csv->argarray = afake(defstab, items, &st[sp+1]);
1156 stab_xarray(defstab) = csv->argarray;
1159 if (sub->depth >= 2) { /* save temporaries on recursion? */
1160 if (sub->depth == 100 && dowarn)
1161 warn("Deep recursion on subroutine \"%s\"",stab_ename(stab));
1162 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
1164 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
1167 st = stack->ary_array;
1168 tmps_base = oldtmps_base;
1169 for (items = arglast[0] + 1; items <= sp; items++)
1170 st[items] = str_mortal(st[items]);
1171 /* in case restore wipes old str */
1172 restorelist(oldsave);
1178 do_assign(arg,gimme,arglast)
1184 register STR **st = stack->ary_array;
1185 STR **firstrelem = st + arglast[1] + 1;
1186 STR **firstlelem = st + arglast[0] + 1;
1187 STR **lastrelem = st + arglast[2];
1188 STR **lastlelem = st + arglast[1];
1189 register STR **relem;
1190 register STR **lelem;
1193 register ARRAY *ary;
1194 register int makelocal;
1198 makelocal = (arg->arg_flags & AF_LOCAL) != 0;
1199 localizing = makelocal;
1200 delaymagic = DM_DELAY; /* catch simultaneous items */
1202 /* If there's a common identifier on both sides we have to take
1203 * special care that assigning the identifier on the left doesn't
1204 * clobber a value on the right that's used later in the list.
1206 if (arg->arg_flags & AF_COMMON) {
1207 for (relem = firstrelem; relem <= lastrelem; relem++) {
1210 *relem = str_mortal(str);
1217 while (lelem <= lastlelem) {
1219 if (str->str_state >= SS_HASH) {
1220 if (str->str_state == SS_ARY) {
1222 ary = saveary(str->str_u.str_stab);
1224 ary = stab_array(str->str_u.str_stab);
1228 while (relem <= lastrelem) { /* gobble up all the rest */
1229 str = Str_new(28,0);
1231 str_sset(str,*relem);
1233 (void)astore(ary,i++,str);
1236 else if (str->str_state == SS_HASH) {
1240 STAB *tmpstab = str->str_u.str_stab;
1243 hash = savehash(str->str_u.str_stab);
1245 hash = stab_hash(str->str_u.str_stab);
1246 if (tmpstab == envstab) {
1248 environ[0] = Nullch;
1250 else if (tmpstab == sigstab) {
1255 for (i = 1; i < NSIG; i++)
1256 signal(i, SIG_DFL); /* crunch, crunch, crunch */
1259 else if (hash->tbl_dbm)
1262 hclear(hash, magic == 'D'); /* wipe any dbm file too */
1265 while (relem < lastrelem) { /* gobble up all the rest */
1269 str = &str_no, relem++;
1270 tmps = str_get(str);
1271 tmpstr = Str_new(29,0);
1273 str_sset(tmpstr,*relem); /* value */
1274 *(relem++) = tmpstr;
1275 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
1277 str_magic(tmpstr, tmpstab, magic, tmps, str->str_cur);
1278 stabset(tmpstr->str_magic, tmpstr);
1283 fatal("panic: do_assign");
1288 if (relem <= lastrelem) {
1289 str_sset(str, *relem);
1293 str_sset(str, &str_undef);
1294 if (gimme == G_ARRAY) {
1295 i = ++lastrelem - firstrelem;
1296 relem++; /* tacky, I suppose */
1297 astore(stack,i,str);
1298 if (st != stack->ary_array) {
1299 st = stack->ary_array;
1300 firstrelem = st + arglast[1] + 1;
1301 firstlelem = st + arglast[0] + 1;
1302 lastlelem = st + arglast[1];
1304 relem = lastrelem + 1;
1311 if (delaymagic & ~DM_DELAY) {
1312 if (delaymagic & DM_UID) {
1314 (void)setreuid(uid,euid);
1315 #else /* not HAS_SETREUID */
1317 if ((delaymagic & DM_UID) == DM_RUID) {
1319 delaymagic =~ DM_RUID;
1321 #endif /* HAS_SETRUID */
1323 if ((delaymagic & DM_UID) == DM_EUID) {
1325 delaymagic =~ DM_EUID;
1327 #endif /* HAS_SETEUID */
1328 if (delaymagic & DM_UID) {
1330 fatal("No setreuid available");
1333 #endif /* not HAS_SETREUID */
1334 uid = (int)getuid();
1335 euid = (int)geteuid();
1337 if (delaymagic & DM_GID) {
1339 (void)setregid(gid,egid);
1340 #else /* not HAS_SETREGID */
1342 if ((delaymagic & DM_GID) == DM_RGID) {
1344 delaymagic =~ DM_RGID;
1346 #endif /* HAS_SETRGID */
1348 if ((delaymagic & DM_GID) == DM_EGID) {
1350 delaymagic =~ DM_EGID;
1352 #endif /* HAS_SETEGID */
1353 if (delaymagic & DM_GID) {
1355 fatal("No setregid available");
1358 #endif /* not HAS_SETREGID */
1359 gid = (int)getgid();
1360 egid = (int)getegid();
1365 if (gimme == G_ARRAY) {
1366 i = lastrelem - firstrelem + 1;
1368 Copy(firstrelem, firstlelem, i, STR*);
1369 return arglast[0] + i;
1372 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
1373 *firstlelem = arg->arg_ptr.arg_str;
1374 return arglast[0] + 1;
1378 int /*SUPPRESS 590*/
1379 do_study(str,arg,gimme,arglast)
1385 register unsigned char *s;
1386 register int pos = str->str_cur;
1388 register int *sfirst;
1389 register int *snext;
1390 static int maxscream = -1;
1391 static STR *lastscream = Nullstr;
1393 int retarg = arglast[0] + 1;
1396 s = (unsigned char*)(str_get(str));
1398 s = Null(unsigned char*);
1401 lastscream->str_pok &= ~SP_STUDIED;
1407 if (pos > maxscream) {
1408 if (maxscream < 0) {
1409 maxscream = pos + 80;
1410 New(301,screamfirst, 256, int);
1411 New(302,screamnext, maxscream, int);
1414 maxscream = pos + pos / 4;
1415 Renew(screamnext, maxscream, int);
1419 sfirst = screamfirst;
1422 if (!sfirst || !snext)
1423 fatal("do_study: out of memory");
1425 for (ch = 256; ch; --ch)
1429 while (--pos >= 0) {
1431 if (sfirst[ch] >= 0)
1432 snext[pos] = sfirst[ch] - pos;
1437 /* If there were any case insensitive searches, we must assume they
1438 * all are. This speeds up insensitive searches much more than
1439 * it slows down sensitive ones.
1442 sfirst[fold[ch]] = pos;
1445 str->str_pok |= SP_STUDIED;
1448 str_numset(arg->arg_ptr.arg_str,(double)retval);
1449 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1453 int /*SUPPRESS 590*/
1454 do_defined(str,arg,gimme,arglast)
1461 register int retarg = arglast[0] + 1;
1466 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1467 fatal("Illegal argument to defined()");
1468 arg = arg[1].arg_ptr.arg_arg;
1469 type = arg->arg_type;
1471 if (type == O_SUBR || type == O_DBSUBR) {
1472 if ((arg[1].arg_type & A_MASK) == A_WORD)
1473 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1475 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1477 retval = tmpstr && stab_sub(stabent(str_get(tmpstr),TRUE)) != 0;
1480 else if (type == O_ARRAY || type == O_LARRAY ||
1481 type == O_ASLICE || type == O_LASLICE )
1482 retval = ((ary = stab_xarray(arg[1].arg_ptr.arg_stab)) != 0
1483 && ary->ary_max >= 0 );
1484 else if (type == O_HASH || type == O_LHASH ||
1485 type == O_HSLICE || type == O_LHSLICE )
1486 retval = ((hash = stab_xhash(arg[1].arg_ptr.arg_stab)) != 0
1487 && hash->tbl_array);
1490 str_numset(str,(double)retval);
1491 stack->ary_array[retarg] = str;
1495 int /*SUPPRESS 590*/
1496 do_undef(str,arg,gimme,arglast)
1503 register STAB *stab;
1504 int retarg = arglast[0] + 1;
1506 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1507 fatal("Illegal argument to undef()");
1508 arg = arg[1].arg_ptr.arg_arg;
1509 type = arg->arg_type;
1511 if (type == O_ARRAY || type == O_LARRAY) {
1512 stab = arg[1].arg_ptr.arg_stab;
1513 afree(stab_xarray(stab));
1514 stab_xarray(stab) = anew(stab); /* so "@array" still works */
1516 else if (type == O_HASH || type == O_LHASH) {
1517 stab = arg[1].arg_ptr.arg_stab;
1518 if (stab == envstab)
1519 environ[0] = Nullch;
1520 else if (stab == sigstab) {
1523 for (i = 1; i < NSIG; i++)
1524 signal(i, SIG_DFL); /* munch, munch, munch */
1526 (void)hfree(stab_xhash(stab), TRUE);
1527 stab_xhash(stab) = Null(HASH*);
1529 else if (type == O_SUBR || type == O_DBSUBR) {
1530 stab = arg[1].arg_ptr.arg_stab;
1531 if ((arg[1].arg_type & A_MASK) != A_WORD) {
1532 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1535 stab = stabent(str_get(tmpstr),TRUE);
1539 if (stab && stab_sub(stab)) {
1540 cmd_free(stab_sub(stab)->cmd);
1541 stab_sub(stab)->cmd = Nullcmd;
1542 afree(stab_sub(stab)->tosave);
1543 Safefree(stab_sub(stab));
1544 stab_sub(stab) = Null(SUBR*);
1548 fatal("Can't undefine that kind of object");
1549 str_numset(str,0.0);
1550 stack->ary_array[retarg] = str;
1555 do_vec(lvalue,astr,arglast)
1560 STR **st = stack->ary_array;
1561 int sp = arglast[0];
1562 register STR *str = st[++sp];
1563 register int offset = (int)str_gnum(st[++sp]);
1564 register int size = (int)str_gnum(st[++sp]);
1565 unsigned char *s = (unsigned char*)str_get(str);
1566 unsigned long retnum;
1570 offset *= size; /* turn into bit offset */
1571 len = (offset + size + 7) / 8;
1572 if (offset < 0 || size < 1)
1574 else if (!lvalue && len > str->str_cur)
1577 if (len > str->str_cur) {
1579 (void)memzero(str->str_ptr + str->str_cur, len - str->str_cur);
1582 s = (unsigned char*)str_get(str);
1584 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1589 else if (size == 16)
1590 retnum = ((unsigned long) s[offset] << 8) + s[offset+1];
1591 else if (size == 32)
1592 retnum = ((unsigned long) s[offset] << 24) +
1593 ((unsigned long) s[offset + 1] << 16) +
1594 (s[offset + 2] << 8) + s[offset+3];
1597 if (lvalue) { /* it's an lvalue! */
1598 struct lstring *lstr = (struct lstring*)astr;
1600 astr->str_magic = str;
1601 st[sp]->str_rare = 'v';
1602 lstr->lstr_offset = offset;
1603 lstr->lstr_len = size;
1607 str_numset(astr,(double)retnum);
1617 struct lstring *lstr = (struct lstring*)str;
1618 register int offset;
1620 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1621 register unsigned long lval = U_L(str_gnum(str));
1625 str->str_magic = Nullstr;
1626 offset = lstr->lstr_offset;
1627 size = lstr->lstr_len;
1629 mask = (1 << size) - 1;
1633 s[offset] &= ~(mask << size);
1634 s[offset] |= lval << size;
1638 s[offset] = lval & 255;
1639 else if (size == 16) {
1640 s[offset] = (lval >> 8) & 255;
1641 s[offset+1] = lval & 255;
1643 else if (size == 32) {
1644 s[offset] = (lval >> 24) & 255;
1645 s[offset+1] = (lval >> 16) & 255;
1646 s[offset+2] = (lval >> 8) & 255;
1647 s[offset+3] = lval & 255;
1657 register char *tmps;
1665 if (str->str_state == SS_ARY) {
1666 ary = stab_array(str->str_u.str_stab);
1667 for (i = 0; i <= ary->ary_fill; i++)
1668 do_chop(astr,ary->ary_array[i]);
1671 if (str->str_state == SS_HASH) {
1672 hash = stab_hash(str->str_u.str_stab);
1673 (void)hiterinit(hash);
1675 while (entry = hiternext(hash))
1676 do_chop(astr,hiterval(hash,entry));
1679 tmps = str_get(str);
1680 if (tmps && str->str_cur) {
1681 tmps += str->str_cur - 1;
1682 str_nset(astr,tmps,1); /* remember last char */
1683 *tmps = '\0'; /* wipe it out */
1684 str->str_cur = tmps - str->str_ptr;
1689 str_nset(astr,"",0);
1693 do_vop(optype,str,left,right)
1699 register char *l = str_get(left);
1700 register char *r = str_get(right);
1703 len = left->str_cur;
1704 if (len > right->str_cur)
1705 len = right->str_cur;
1706 if (str->str_cur > len)
1708 else if (str->str_cur < len) {
1710 (void)memzero(str->str_ptr + str->str_cur, len - str->str_cur);
1734 if (right->str_cur > len)
1735 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1736 else if (left->str_cur > len)
1737 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1746 register STR **st = stack->ary_array;
1747 register int sp = arglast[1];
1748 register int items = arglast[2] - sp;
1750 unsigned long arg[14]; /* yes, we really need that many ! */
1752 unsigned long arg[8];
1759 for (st += ++sp; items--; st++)
1760 tainted |= (*st)->str_tainted;
1761 st = stack->ary_array;
1763 items = arglast[2] - sp;
1766 taintproper("Insecure dependency in syscall");
1768 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1769 * or where sizeof(long) != sizeof(char*). But such machines will
1770 * not likely have syscall implemented either, so who cares?
1773 if (st[++sp]->str_nok || !i)
1774 arg[i++] = (unsigned long)str_gnum(st[sp]);
1777 arg[i++] = (unsigned long)st[sp]->str_ptr;
1781 items = arglast[2] - sp;
1784 fatal("Too few args to syscall");
1786 retval = syscall(arg[0]);
1789 retval = syscall(arg[0],arg[1]);
1792 retval = syscall(arg[0],arg[1],arg[2]);
1795 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1798 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1801 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1804 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1807 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1812 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1816 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1817 arg[7], arg[8], arg[9]);
1820 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1821 arg[7], arg[8], arg[9], arg[10]);
1824 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1825 arg[7], arg[8], arg[9], arg[10], arg[11]);
1828 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1829 arg[7], arg[8], arg[9], arg[10], arg[11], arg[12]);
1832 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1833 arg[7], arg[8], arg[9], arg[10], arg[11], arg[12], arg[13]);
1835 #endif /* atarist */
1839 fatal("syscall() unimplemented");