1 /* $RCSfile: doarg.c,v $$Revision: 4.0.1.6 $$Date: 92/06/08 12:34:30 $
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.6 92/06/08 12:34:30 lwall
10 * patch20: removed implicit int declarations on funcions
11 * patch20: pattern modifiers i and o didn't interact right
12 * patch20: join() now pre-extends target string to avoid excessive copying
13 * patch20: fixed confusion between a *var's real name and its effective name
14 * patch20: subroutines didn't localize $`, $&, $', $1 et al correctly
15 * patch20: usersub routines didn't reclaim temp values soon enough
16 * patch20: ($<,$>) = ... didn't work on some architectures
17 * patch20: added Atari ST portability
19 * Revision 4.0.1.5 91/11/11 16:31:58 lwall
20 * patch19: added little-endian pack/unpack options
22 * Revision 4.0.1.4 91/11/05 16:35:06 lwall
23 * patch11: /$foo/o optimizer could access deallocated data
24 * patch11: minimum match length calculation in regexp is now cumulative
25 * patch11: added some support for 64-bit integers
26 * patch11: prepared for ctype implementations that don't define isascii()
27 * patch11: sprintf() now supports any length of s field
28 * patch11: indirect subroutine calls through magic vars (e.g. &$1) didn't work
29 * patch11: defined(&$foo) and undef(&$foo) didn't work
31 * Revision 4.0.1.3 91/06/10 01:18:41 lwall
32 * patch10: pack(hh,1) dumped core
34 * Revision 4.0.1.2 91/06/07 10:42:17 lwall
35 * patch4: new copyright notice
36 * patch4: // wouldn't use previous pattern if it started with a null character
37 * patch4: //o and s///o now optimize themselves fully at runtime
38 * patch4: added global modifier for pattern matches
39 * patch4: undef @array disabled "@array" interpolation
40 * patch4: chop("") was returning "\0" rather than ""
41 * patch4: vector logical operations &, | and ^ sometimes returned null string
42 * patch4: syscall couldn't pass numbers with most significant bit set on sparcs
44 * Revision 4.0.1.1 91/04/11 17:40:14 lwall
45 * patch1: fixed undefined environ problem
46 * patch1: fixed debugger coredump on subroutines
48 * Revision 4.0 91/03/20 01:06:42 lwall
56 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
60 extern unsigned char fold[];
63 #pragma function(memcmp)
64 #endif /* BUGGY_MSC */
66 static void doencodes();
77 register char *s = str_get(str);
78 char *strend = s + str->str_cur;
84 int maxiters = (strend - s) + 10;
90 rspat = spat = arg[2].arg_ptr.arg_spat;
92 fatal("panic: do_subst");
93 else if (spat->spat_runtime) {
95 (void)eval(spat->spat_runtime,G_SCALAR,sp);
96 m = str_get(dstr = stack->ary_array[sp+1]);
98 if (spat->spat_regexp) {
99 regfree(spat->spat_regexp);
100 spat->spat_regexp = Null(REGEXP*); /* required if regcomp pukes */
102 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
103 spat->spat_flags & SPAT_FOLD);
104 if (spat->spat_flags & SPAT_KEEP) {
105 if (!(spat->spat_flags & SPAT_FOLD))
106 scanconst(spat, m, dstr->str_cur);
107 arg_free(spat->spat_runtime); /* it won't change, so */
108 spat->spat_runtime = Nullarg; /* no point compiling again */
110 if (curcmd->c_expr && (curcmd->c_flags & CF_OPTIMIZE) == CFT_EVAL) {
111 curcmd->c_flags &= ~CF_OPTIMIZE;
112 opt_arg(curcmd, 1, curcmd->c_type == C_EXPR);
118 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
121 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
123 if (!spat->spat_regexp->prelen && lastspat)
127 if (hint < s || hint > strend)
128 fatal("panic: hint in do_match");
131 if (spat->spat_regexp->regback >= 0) {
132 s -= spat->spat_regexp->regback;
139 else if (spat->spat_short) {
140 if (spat->spat_flags & SPAT_SCANFIRST) {
141 if (str->str_pok & SP_STUDIED) {
142 if (screamfirst[spat->spat_short->str_rare] < 0)
144 else if (!(s = screaminstr(str,spat->spat_short)))
148 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
152 if (s && spat->spat_regexp->regback >= 0) {
153 ++spat->spat_short->str_u.str_useful;
154 s -= spat->spat_regexp->regback;
161 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
162 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
164 if (--spat->spat_short->str_u.str_useful < 0) {
165 str_free(spat->spat_short);
166 spat->spat_short = Nullstr; /* opt is being useless */
169 once = !(rspat->spat_flags & SPAT_GLOBAL);
170 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
171 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
172 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
173 else { /* constant over loop, anyway */
174 (void)eval(rspat->spat_repl,G_SCALAR,sp);
175 dstr = stack->ary_array[sp+1];
178 clen = dstr->str_cur;
179 if (clen <= spat->spat_regexp->minlen) {
180 /* can do inplace substitution */
181 if (regexec(spat->spat_regexp, s, strend, orig, 0,
182 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
183 if (spat->spat_regexp->subbase) /* oops, no we can't */
187 str->str_pok = SP_VALID; /* disable possible screamer */
189 m = spat->spat_regexp->startp[0];
190 d = spat->spat_regexp->endp[0];
192 if (m - s > strend - d) { /* faster to shorten from end */
194 Copy(c, m, clen, char);
203 str->str_cur = m - s;
205 str_numset(arg->arg_ptr.arg_str, 1.0);
206 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
210 else if (i = m - s) { /* faster from front */
218 Copy(c, m, clen, char);
220 str_numset(arg->arg_ptr.arg_str, 1.0);
221 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
229 str_numset(arg->arg_ptr.arg_str, 1.0);
230 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
236 str_numset(arg->arg_ptr.arg_str, 1.0);
237 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
243 if (iters++ > maxiters)
244 fatal("Substitution loop");
245 m = spat->spat_regexp->startp[0];
256 s = spat->spat_regexp->endp[0];
257 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
258 Nullstr, TRUE)); /* (don't match same null twice) */
261 str->str_cur = d - str->str_ptr + i;
262 Move(s,d,i+1,char); /* include the Null */
265 str_numset(arg->arg_ptr.arg_str, (double)iters);
266 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
269 str_numset(arg->arg_ptr.arg_str, 0.0);
270 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
276 if (regexec(spat->spat_regexp, s, strend, orig, 0,
277 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
279 dstr = Str_new(25,str_len(str));
280 str_nset(dstr,m,s-m);
281 if (spat->spat_regexp->subbase)
285 if (iters++ > maxiters)
286 fatal("Substitution loop");
287 if (spat->spat_regexp->subbase
288 && spat->spat_regexp->subbase != orig) {
291 orig = spat->spat_regexp->subbase;
293 strend = s + (strend - m);
295 m = spat->spat_regexp->startp[0];
296 str_ncat(dstr,s,m-s);
297 s = spat->spat_regexp->endp[0];
300 str_ncat(dstr,c,clen);
303 char *mysubbase = spat->spat_regexp->subbase;
305 spat->spat_regexp->subbase = Nullch; /* so recursion works */
306 (void)eval(rspat->spat_repl,G_SCALAR,sp);
307 str_scat(dstr,stack->ary_array[sp+1]);
308 if (spat->spat_regexp->subbase)
309 Safefree(spat->spat_regexp->subbase);
310 spat->spat_regexp->subbase = mysubbase;
314 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
316 str_ncat(dstr,s,strend - s);
317 str_replace(str,dstr);
319 str_numset(arg->arg_ptr.arg_str, (double)iters);
320 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
323 str_numset(arg->arg_ptr.arg_str, 0.0);
324 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
328 ++spat->spat_short->str_u.str_useful;
329 str_numset(arg->arg_ptr.arg_str, 0.0);
330 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
334 #pragma intrinsic(memcmp)
335 #endif /* BUGGY_MSC */
344 register int matches = 0;
348 register int squash = arg[2].arg_len & 1;
350 tbl = (short*) arg[2].arg_ptr.arg_cval;
352 send = s + str->str_cur;
354 fatal("panic: do_trans");
360 if (!arg[2].arg_len) {
362 if ((ch = tbl[*s & 0377]) >= 0) {
372 if ((ch = tbl[*s & 0377]) >= 0) {
374 if (matches++ && squash) {
383 else if (ch == -1) /* -1 is unmapped character */
384 *d++ = *s; /* -2 is delete character */
387 matches += send - d; /* account for disappeared chars */
389 str->str_cur = d - str->str_ptr;
400 register STR **st = stack->ary_array;
402 register int items = arglast[2] - sp;
403 register char *delim = str_get(st[sp]);
405 int delimlen = st[sp]->str_cur;
409 len = delimlen * (items - 1);
410 if (str->str_len < len + items) { /* current length is way too short */
411 while (items-- > 0) {
413 len += (*st)->str_cur;
416 STR_GROW(str, len + 1); /* so try to pre-extend */
418 items = arglast[2] - sp;
423 str_sset(str, *st++);
428 for (; items > 0; items--,st++) {
429 str_ncat(str,delim,len);
434 for (; items > 0; items--,st++)
445 register STR **st = stack->ary_array;
446 register int sp = arglast[1];
448 register char *pat = str_get(st[sp]);
449 register char *patend = pat + st[sp]->str_cur;
454 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
455 static char *space10 = " ";
457 /* These must not be in registers: */
463 unsigned long aulong;
466 unsigned quad auquad;
472 items = arglast[2] - sp;
475 while (pat < patend) {
476 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
479 len = index("@Xxu",datumtype) ? 0 : items;
482 else if (isDIGIT(*pat)) {
484 while (isDIGIT(*pat))
485 len = (len * 10) + (*pat++ - '0');
493 fatal("% may only be used in unpack");
504 if (str->str_cur < len)
505 fatal("X outside of string");
507 str->str_ptr[str->str_cur] = '\0';
512 str_ncat(str,null10,10);
515 str_ncat(str,null10,len);
520 aptr = str_get(fromstr);
522 len = fromstr->str_cur;
523 if (fromstr->str_cur > len)
524 str_ncat(str,aptr,len);
526 str_ncat(str,aptr,fromstr->str_cur);
527 len -= fromstr->str_cur;
528 if (datumtype == 'A') {
530 str_ncat(str,space10,10);
533 str_ncat(str,space10,len);
537 str_ncat(str,null10,10);
540 str_ncat(str,null10,len);
552 aptr = str_get(fromstr);
554 len = fromstr->str_cur;
557 str->str_cur += (len+7)/8;
558 STR_GROW(str, str->str_cur + 1);
559 aptr = str->str_ptr + aint;
560 if (len > fromstr->str_cur)
561 len = fromstr->str_cur;
564 if (datumtype == 'B') {
565 for (len = 0; len++ < aint;) {
570 *aptr++ = items & 0xff;
576 for (len = 0; len++ < aint;) {
582 *aptr++ = items & 0xff;
588 if (datumtype == 'B')
589 items <<= 7 - (aint & 7);
591 items >>= 7 - (aint & 7);
592 *aptr++ = items & 0xff;
594 pat = str->str_ptr + str->str_cur;
610 aptr = str_get(fromstr);
612 len = fromstr->str_cur;
615 str->str_cur += (len+1)/2;
616 STR_GROW(str, str->str_cur + 1);
617 aptr = str->str_ptr + aint;
618 if (len > fromstr->str_cur)
619 len = fromstr->str_cur;
622 if (datumtype == 'H') {
623 for (len = 0; len++ < aint;) {
625 items |= ((*pat++ & 15) + 9) & 15;
627 items |= *pat++ & 15;
631 *aptr++ = items & 0xff;
637 for (len = 0; len++ < aint;) {
639 items |= (((*pat++ & 15) + 9) & 15) << 4;
641 items |= (*pat++ & 15) << 4;
645 *aptr++ = items & 0xff;
651 *aptr++ = items & 0xff;
652 pat = str->str_ptr + str->str_cur;
664 aint = (int)str_gnum(fromstr);
666 str_ncat(str,&achar,sizeof(char));
669 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
674 afloat = (float)str_gnum(fromstr);
675 str_ncat(str, (char *)&afloat, sizeof (float));
682 adouble = (double)str_gnum(fromstr);
683 str_ncat(str, (char *)&adouble, sizeof (double));
689 ashort = (short)str_gnum(fromstr);
691 ashort = htons(ashort);
693 str_ncat(str,(char*)&ashort,sizeof(short));
699 ashort = (short)str_gnum(fromstr);
701 ashort = htovs(ashort);
703 str_ncat(str,(char*)&ashort,sizeof(short));
710 ashort = (short)str_gnum(fromstr);
711 str_ncat(str,(char*)&ashort,sizeof(short));
717 auint = U_I(str_gnum(fromstr));
718 str_ncat(str,(char*)&auint,sizeof(unsigned int));
724 aint = (int)str_gnum(fromstr);
725 str_ncat(str,(char*)&aint,sizeof(int));
731 aulong = U_L(str_gnum(fromstr));
733 aulong = htonl(aulong);
735 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
741 aulong = U_L(str_gnum(fromstr));
743 aulong = htovl(aulong);
745 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
751 aulong = U_L(str_gnum(fromstr));
752 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
758 along = (long)str_gnum(fromstr);
759 str_ncat(str,(char*)&along,sizeof(long));
766 auquad = (unsigned quad)str_gnum(fromstr);
767 str_ncat(str,(char*)&auquad,sizeof(unsigned quad));
773 aquad = (quad)str_gnum(fromstr);
774 str_ncat(str,(char*)&aquad,sizeof(quad));
781 aptr = str_get(fromstr);
782 str_ncat(str,(char*)&aptr,sizeof(char*));
787 aptr = str_get(fromstr);
788 aint = fromstr->str_cur;
789 STR_GROW(str,aint * 4 / 3);
801 doencodes(str, aptr, todo);
813 doencodes(str, s, len)
821 str_ncat(str, hunk, 1);
824 hunk[0] = ' ' + (077 & (*s >> 2));
825 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
826 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
827 hunk[3] = ' ' + (077 & (s[2] & 077));
828 str_ncat(str, hunk, 4);
832 for (s = str->str_ptr; *s; s++) {
836 str_ncat(str, "\n", 1);
840 do_sprintf(str,len,sarg)
853 static STR *sargnull = &str_no;
863 len--; /* don't count pattern string */
864 t = s = str_get(*sarg);
865 send = s + (*sarg)->str_cur;
870 if (len <= 0 || !(arg = *sarg++))
874 for ( ; t < send && *t != '%'; t++) ;
876 break; /* end of format string, ignore extra args */
885 for (t++; t < send; t++) {
894 case '0': case '1': case '2': case '3': case '4':
895 case '5': case '6': case '7': case '8': case '9':
896 case '.': case '#': case '-': case '+': case ' ':
910 xlen = (int)str_gnum(arg);
911 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
917 (void)sprintf(xs,f,xlen);
929 (void)sprintf(buf,s,(quad)str_gnum(arg));
933 (void)sprintf(xs,f,(long)str_gnum(arg));
935 (void)sprintf(xs,f,(int)str_gnum(arg));
941 case 'x': case 'o': case 'u':
944 value = str_gnum(arg);
947 (void)sprintf(buf,s,(unsigned quad)value);
951 (void)sprintf(xs,f,U_L(value));
953 (void)sprintf(xs,f,U_I(value));
956 case 'E': case 'e': case 'f': case 'G': case 'g':
959 (void)sprintf(xs,f,str_gnum(arg));
967 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B' && xs[3] == '\0'
968 && xlen == sizeof(STBP)) {
969 STR *tmpstr = Str_new(24,0);
971 stab_efullname(tmpstr, ((STAB*)arg)); /* a stab value! */
972 sprintf(tokenbuf,"*%s",tmpstr->str_ptr);
973 /* reformat to non-binary */
975 xlen = strlen(tokenbuf);
978 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
979 break; /* so handle simple cases */
981 else if (f[1] == '-') {
982 char *mp = index(f, '.');
988 int max = atoi(mp+1);
995 else if (isDIGIT(f[1])) {
996 char *mp = index(f, '.');
1002 int max = atoi(mp+1);
1009 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
1011 (void)sprintf(buf,tokenbuf+64,xs);
1016 /* end of switch, copy results */
1018 STR_GROW(str, str->str_cur + (f - s) + xlen + 1 + pre + post);
1019 str_ncat(str, s, f - s);
1021 repeatcpy(str->str_ptr + str->str_cur, " ", 1, pre);
1022 str->str_cur += pre;
1024 str_ncat(str, xs, xlen);
1026 repeatcpy(str->str_ptr + str->str_cur, " ", 1, post);
1027 str->str_cur += post;
1030 break; /* break from for loop */
1033 str_ncat(str, s, t - s);
1038 do_push(ary,arglast)
1039 register ARRAY *ary;
1042 register STR **st = stack->ary_array;
1043 register int sp = arglast[1];
1044 register int items = arglast[2] - sp;
1045 register STR *str = &str_undef;
1047 for (st += ++sp; items > 0; items--,st++) {
1048 str = Str_new(26,0);
1051 (void)apush(ary,str);
1057 do_unshift(ary,arglast)
1058 register ARRAY *ary;
1061 register STR **st = stack->ary_array;
1062 register int sp = arglast[1];
1063 register int items = arglast[2] - sp;
1067 aunshift(ary,items);
1069 for (st += ++sp; i < items; i++,st++) {
1070 str = Str_new(27,0);
1072 (void)astore(ary,i,str);
1077 do_subr(arg,gimme,arglast)
1082 register STR **st = stack->ary_array;
1083 register int sp = arglast[1];
1084 register int items = arglast[2] - sp;
1086 SPAT * VOLATILE oldspat = curspat;
1089 int oldsave = savestack->ary_fill;
1090 int oldtmps_base = tmps_base;
1091 int hasargs = ((arg[2].arg_type & A_MASK) != A_NULL);
1094 if ((arg[1].arg_type & A_MASK) == A_WORD)
1095 stab = arg[1].arg_ptr.arg_stab;
1097 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1100 stab = stabent(str_get(tmpstr),TRUE);
1105 fatal("Undefined subroutine called");
1106 if (!(sub = stab_sub(stab))) {
1107 STR *tmpstr = arg[0].arg_ptr.arg_str;
1109 stab_efullname(tmpstr, stab);
1110 fatal("Undefined subroutine \"%s\" called",tmpstr->str_ptr);
1112 if (arg->arg_type == O_DBSUBR && !sub->usersub) {
1113 str = stab_val(DBsub);
1115 stab_efullname(str,stab);
1116 sub = stab_sub(DBsub);
1118 fatal("No DBsub routine");
1120 str = Str_new(15, sizeof(CSV));
1121 str->str_state = SS_SCSV;
1122 (void)apush(savestack,str);
1123 csv = (CSV*)str->str_ptr;
1126 csv->curcsv = curcsv;
1127 csv->curcmd = curcmd;
1128 csv->depth = sub->depth;
1129 csv->wantarray = gimme;
1130 csv->hasargs = hasargs;
1132 tmps_base = tmps_max;
1135 csv->savearray = Null(ARRAY*);;
1136 csv->argarray = Null(ARRAY*);
1137 st[sp] = arg->arg_ptr.arg_str;
1140 sp = (*sub->usersub)(sub->userindex,sp,items);
1144 csv->savearray = stab_xarray(defstab);
1145 csv->argarray = afake(defstab, items, &st[sp+1]);
1146 stab_xarray(defstab) = csv->argarray;
1149 if (sub->depth >= 2) { /* save temporaries on recursion? */
1150 if (sub->depth == 100 && dowarn)
1151 warn("Deep recursion on subroutine \"%s\"",stab_ename(stab));
1152 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
1154 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
1157 st = stack->ary_array;
1158 tmps_base = oldtmps_base;
1159 for (items = arglast[0] + 1; items <= sp; items++)
1160 st[items] = str_mortal(st[items]);
1161 /* in case restore wipes old str */
1162 restorelist(oldsave);
1168 do_assign(arg,gimme,arglast)
1174 register STR **st = stack->ary_array;
1175 STR **firstrelem = st + arglast[1] + 1;
1176 STR **firstlelem = st + arglast[0] + 1;
1177 STR **lastrelem = st + arglast[2];
1178 STR **lastlelem = st + arglast[1];
1179 register STR **relem;
1180 register STR **lelem;
1183 register ARRAY *ary;
1184 register int makelocal;
1188 makelocal = (arg->arg_flags & AF_LOCAL) != 0;
1189 localizing = makelocal;
1190 delaymagic = DM_DELAY; /* catch simultaneous items */
1192 /* If there's a common identifier on both sides we have to take
1193 * special care that assigning the identifier on the left doesn't
1194 * clobber a value on the right that's used later in the list.
1196 if (arg->arg_flags & AF_COMMON) {
1197 for (relem = firstrelem; relem <= lastrelem; relem++) {
1200 *relem = str_mortal(str);
1207 while (lelem <= lastlelem) {
1209 if (str->str_state >= SS_HASH) {
1210 if (str->str_state == SS_ARY) {
1212 ary = saveary(str->str_u.str_stab);
1214 ary = stab_array(str->str_u.str_stab);
1218 while (relem <= lastrelem) { /* gobble up all the rest */
1219 str = Str_new(28,0);
1221 str_sset(str,*relem);
1223 (void)astore(ary,i++,str);
1226 else if (str->str_state == SS_HASH) {
1230 STAB *tmpstab = str->str_u.str_stab;
1233 hash = savehash(str->str_u.str_stab);
1235 hash = stab_hash(str->str_u.str_stab);
1236 if (tmpstab == envstab) {
1238 environ[0] = Nullch;
1240 else if (tmpstab == sigstab) {
1245 for (i = 1; i < NSIG; i++)
1246 signal(i, SIG_DFL); /* crunch, crunch, crunch */
1249 else if (hash->tbl_dbm)
1252 hclear(hash, magic == 'D'); /* wipe any dbm file too */
1255 while (relem < lastrelem) { /* gobble up all the rest */
1259 str = &str_no, relem++;
1260 tmps = str_get(str);
1261 tmpstr = Str_new(29,0);
1263 str_sset(tmpstr,*relem); /* value */
1264 *(relem++) = tmpstr;
1265 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
1267 str_magic(tmpstr, tmpstab, magic, tmps, str->str_cur);
1268 stabset(tmpstr->str_magic, tmpstr);
1273 fatal("panic: do_assign");
1278 if (relem <= lastrelem) {
1279 str_sset(str, *relem);
1283 str_sset(str, &str_undef);
1284 if (gimme == G_ARRAY) {
1285 i = ++lastrelem - firstrelem;
1286 relem++; /* tacky, I suppose */
1287 astore(stack,i,str);
1288 if (st != stack->ary_array) {
1289 st = stack->ary_array;
1290 firstrelem = st + arglast[1] + 1;
1291 firstlelem = st + arglast[0] + 1;
1292 lastlelem = st + arglast[1];
1294 relem = lastrelem + 1;
1301 if (delaymagic & ~DM_DELAY) {
1302 if (delaymagic & DM_UID) {
1304 (void)setreuid(uid,euid);
1305 #else /* not HAS_SETREUID */
1307 if ((delaymagic & DM_UID) == DM_RUID) {
1309 delaymagic =~ DM_RUID;
1311 #endif /* HAS_SETRUID */
1313 if ((delaymagic & DM_UID) == DM_EUID) {
1315 delaymagic =~ DM_EUID;
1317 #endif /* HAS_SETEUID */
1318 if (delaymagic & DM_UID) {
1320 fatal("No setreuid available");
1323 #endif /* not HAS_SETREUID */
1324 uid = (int)getuid();
1325 euid = (int)geteuid();
1327 if (delaymagic & DM_GID) {
1329 (void)setregid(gid,egid);
1330 #else /* not HAS_SETREGID */
1332 if ((delaymagic & DM_GID) == DM_RGID) {
1334 delaymagic =~ DM_RGID;
1336 #endif /* HAS_SETRGID */
1338 if ((delaymagic & DM_GID) == DM_EGID) {
1340 delaymagic =~ DM_EGID;
1342 #endif /* HAS_SETEGID */
1343 if (delaymagic & DM_GID) {
1345 fatal("No setregid available");
1348 #endif /* not HAS_SETREGID */
1349 gid = (int)getgid();
1350 egid = (int)getegid();
1355 if (gimme == G_ARRAY) {
1356 i = lastrelem - firstrelem + 1;
1358 Copy(firstrelem, firstlelem, i, STR*);
1359 return arglast[0] + i;
1362 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
1363 *firstlelem = arg->arg_ptr.arg_str;
1364 return arglast[0] + 1;
1368 int /*SUPPRESS 590*/
1369 do_study(str,arg,gimme,arglast)
1375 register unsigned char *s;
1376 register int pos = str->str_cur;
1378 register int *sfirst;
1379 register int *snext;
1380 static int maxscream = -1;
1381 static STR *lastscream = Nullstr;
1383 int retarg = arglast[0] + 1;
1386 s = (unsigned char*)(str_get(str));
1388 s = Null(unsigned char*);
1391 lastscream->str_pok &= ~SP_STUDIED;
1397 if (pos > maxscream) {
1398 if (maxscream < 0) {
1399 maxscream = pos + 80;
1400 New(301,screamfirst, 256, int);
1401 New(302,screamnext, maxscream, int);
1404 maxscream = pos + pos / 4;
1405 Renew(screamnext, maxscream, int);
1409 sfirst = screamfirst;
1412 if (!sfirst || !snext)
1413 fatal("do_study: out of memory");
1415 for (ch = 256; ch; --ch)
1419 while (--pos >= 0) {
1421 if (sfirst[ch] >= 0)
1422 snext[pos] = sfirst[ch] - pos;
1427 /* If there were any case insensitive searches, we must assume they
1428 * all are. This speeds up insensitive searches much more than
1429 * it slows down sensitive ones.
1432 sfirst[fold[ch]] = pos;
1435 str->str_pok |= SP_STUDIED;
1438 str_numset(arg->arg_ptr.arg_str,(double)retval);
1439 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1443 int /*SUPPRESS 590*/
1444 do_defined(str,arg,gimme,arglast)
1451 register int retarg = arglast[0] + 1;
1456 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1457 fatal("Illegal argument to defined()");
1458 arg = arg[1].arg_ptr.arg_arg;
1459 type = arg->arg_type;
1461 if (type == O_SUBR || type == O_DBSUBR) {
1462 if ((arg[1].arg_type & A_MASK) == A_WORD)
1463 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1465 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1467 retval = tmpstr && stab_sub(stabent(str_get(tmpstr),TRUE)) != 0;
1470 else if (type == O_ARRAY || type == O_LARRAY ||
1471 type == O_ASLICE || type == O_LASLICE )
1472 retval = ((ary = stab_xarray(arg[1].arg_ptr.arg_stab)) != 0
1473 && ary->ary_max >= 0 );
1474 else if (type == O_HASH || type == O_LHASH ||
1475 type == O_HSLICE || type == O_LHSLICE )
1476 retval = ((hash = stab_xhash(arg[1].arg_ptr.arg_stab)) != 0
1477 && hash->tbl_array);
1480 str_numset(str,(double)retval);
1481 stack->ary_array[retarg] = str;
1485 int /*SUPPRESS 590*/
1486 do_undef(str,arg,gimme,arglast)
1493 register STAB *stab;
1494 int retarg = arglast[0] + 1;
1496 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1497 fatal("Illegal argument to undef()");
1498 arg = arg[1].arg_ptr.arg_arg;
1499 type = arg->arg_type;
1501 if (type == O_ARRAY || type == O_LARRAY) {
1502 stab = arg[1].arg_ptr.arg_stab;
1503 afree(stab_xarray(stab));
1504 stab_xarray(stab) = anew(stab); /* so "@array" still works */
1506 else if (type == O_HASH || type == O_LHASH) {
1507 stab = arg[1].arg_ptr.arg_stab;
1508 if (stab == envstab)
1509 environ[0] = Nullch;
1510 else if (stab == sigstab) {
1513 for (i = 1; i < NSIG; i++)
1514 signal(i, SIG_DFL); /* munch, munch, munch */
1516 (void)hfree(stab_xhash(stab), TRUE);
1517 stab_xhash(stab) = Null(HASH*);
1519 else if (type == O_SUBR || type == O_DBSUBR) {
1520 stab = arg[1].arg_ptr.arg_stab;
1521 if ((arg[1].arg_type & A_MASK) != A_WORD) {
1522 STR *tmpstr = STAB_STR(arg[1].arg_ptr.arg_stab);
1525 stab = stabent(str_get(tmpstr),TRUE);
1529 if (stab && stab_sub(stab)) {
1530 cmd_free(stab_sub(stab)->cmd);
1531 stab_sub(stab)->cmd = Nullcmd;
1532 afree(stab_sub(stab)->tosave);
1533 Safefree(stab_sub(stab));
1534 stab_sub(stab) = Null(SUBR*);
1538 fatal("Can't undefine that kind of object");
1539 str_numset(str,0.0);
1540 stack->ary_array[retarg] = str;
1545 do_vec(lvalue,astr,arglast)
1550 STR **st = stack->ary_array;
1551 int sp = arglast[0];
1552 register STR *str = st[++sp];
1553 register int offset = (int)str_gnum(st[++sp]);
1554 register int size = (int)str_gnum(st[++sp]);
1555 unsigned char *s = (unsigned char*)str_get(str);
1556 unsigned long retnum;
1560 offset *= size; /* turn into bit offset */
1561 len = (offset + size + 7) / 8;
1562 if (offset < 0 || size < 1)
1564 else if (!lvalue && len > str->str_cur)
1567 if (len > str->str_cur) {
1569 (void)memzero(str->str_ptr + str->str_cur, len - str->str_cur);
1572 s = (unsigned char*)str_get(str);
1574 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1579 else if (size == 16)
1580 retnum = ((unsigned long) s[offset] << 8) + s[offset+1];
1581 else if (size == 32)
1582 retnum = ((unsigned long) s[offset] << 24) +
1583 ((unsigned long) s[offset + 1] << 16) +
1584 (s[offset + 2] << 8) + s[offset+3];
1587 if (lvalue) { /* it's an lvalue! */
1588 struct lstring *lstr = (struct lstring*)astr;
1590 astr->str_magic = str;
1591 st[sp]->str_rare = 'v';
1592 lstr->lstr_offset = offset;
1593 lstr->lstr_len = size;
1597 str_numset(astr,(double)retnum);
1607 struct lstring *lstr = (struct lstring*)str;
1608 register int offset;
1610 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1611 register unsigned long lval = U_L(str_gnum(str));
1615 str->str_magic = Nullstr;
1616 offset = lstr->lstr_offset;
1617 size = lstr->lstr_len;
1619 mask = (1 << size) - 1;
1623 s[offset] &= ~(mask << size);
1624 s[offset] |= lval << size;
1628 s[offset] = lval & 255;
1629 else if (size == 16) {
1630 s[offset] = (lval >> 8) & 255;
1631 s[offset+1] = lval & 255;
1633 else if (size == 32) {
1634 s[offset] = (lval >> 24) & 255;
1635 s[offset+1] = (lval >> 16) & 255;
1636 s[offset+2] = (lval >> 8) & 255;
1637 s[offset+3] = lval & 255;
1647 register char *tmps;
1655 if (str->str_state == SS_ARY) {
1656 ary = stab_array(str->str_u.str_stab);
1657 for (i = 0; i <= ary->ary_fill; i++)
1658 do_chop(astr,ary->ary_array[i]);
1661 if (str->str_state == SS_HASH) {
1662 hash = stab_hash(str->str_u.str_stab);
1663 (void)hiterinit(hash);
1665 while (entry = hiternext(hash))
1666 do_chop(astr,hiterval(hash,entry));
1669 tmps = str_get(str);
1670 if (tmps && str->str_cur) {
1671 tmps += str->str_cur - 1;
1672 str_nset(astr,tmps,1); /* remember last char */
1673 *tmps = '\0'; /* wipe it out */
1674 str->str_cur = tmps - str->str_ptr;
1679 str_nset(astr,"",0);
1683 do_vop(optype,str,left,right)
1689 register char *l = str_get(left);
1690 register char *r = str_get(right);
1693 len = left->str_cur;
1694 if (len > right->str_cur)
1695 len = right->str_cur;
1696 if (str->str_cur > len)
1698 else if (str->str_cur < len) {
1700 (void)memzero(str->str_ptr + str->str_cur, len - str->str_cur);
1724 if (right->str_cur > len)
1725 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1726 else if (left->str_cur > len)
1727 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1736 register STR **st = stack->ary_array;
1737 register int sp = arglast[1];
1738 register int items = arglast[2] - sp;
1740 unsigned long arg[14]; /* yes, we really need that many ! */
1742 unsigned long arg[8];
1749 for (st += ++sp; items--; st++)
1750 tainted |= (*st)->str_tainted;
1751 st = stack->ary_array;
1753 items = arglast[2] - sp;
1756 taintproper("Insecure dependency in syscall");
1758 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1759 * or where sizeof(long) != sizeof(char*). But such machines will
1760 * not likely have syscall implemented either, so who cares?
1763 if (st[++sp]->str_nok || !i)
1764 arg[i++] = (unsigned long)str_gnum(st[sp]);
1767 arg[i++] = (unsigned long)st[sp]->str_ptr;
1771 items = arglast[2] - sp;
1774 fatal("Too few args to syscall");
1776 retval = syscall(arg[0]);
1779 retval = syscall(arg[0],arg[1]);
1782 retval = syscall(arg[0],arg[1],arg[2]);
1785 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1788 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1791 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1794 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1797 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1802 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],
1807 arg[7], arg[8], arg[9]);
1810 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1811 arg[7], arg[8], arg[9], arg[10]);
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], arg[11]);
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], arg[12]);
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], arg[13]);
1825 #endif /* atarist */
1829 fatal("syscall() unimplemented");