1 /* $RCSfile: doarg.c,v $$Revision: 4.0.1.2 $$Date: 91/06/07 10:42:17 $
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.2 91/06/07 10:42:17 lwall
10 * patch4: new copyright notice
11 * patch4: // wouldn't use previous pattern if it started with a null character
12 * patch4: //o and s///o now optimize themselves fully at runtime
13 * patch4: added global modifier for pattern matches
14 * patch4: undef @array disabled "@array" interpolation
15 * patch4: chop("") was returning "\0" rather than ""
16 * patch4: vector logical operations &, | and ^ sometimes returned null string
17 * patch4: syscall couldn't pass numbers with most significant bit set on sparcs
19 * Revision 4.0.1.1 91/04/11 17:40:14 lwall
20 * patch1: fixed undefined environ problem
21 * patch1: fixed debugger coredump on subroutines
23 * Revision 4.0 91/03/20 01:06:42 lwall
31 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
35 extern unsigned char fold[];
38 #pragma function(memcmp)
39 #endif /* BUGGY_MSC */
50 register char *s = str_get(str);
51 char *strend = s + str->str_cur;
57 int maxiters = (strend - s) + 10;
63 rspat = spat = arg[2].arg_ptr.arg_spat;
65 fatal("panic: do_subst");
66 else if (spat->spat_runtime) {
68 (void)eval(spat->spat_runtime,G_SCALAR,sp);
69 m = str_get(dstr = stack->ary_array[sp+1]);
71 if (spat->spat_regexp) {
72 regfree(spat->spat_regexp);
73 spat->spat_regexp = Null(REGEXP*); /* required if regcomp pukes */
75 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
76 spat->spat_flags & SPAT_FOLD);
77 if (spat->spat_flags & SPAT_KEEP) {
78 arg_free(spat->spat_runtime); /* it won't change, so */
79 spat->spat_runtime = Nullarg; /* no point compiling again */
80 scanconst(spat, m, dstr->str_cur);
82 if (curcmd->c_expr && (curcmd->c_flags & CF_OPTIMIZE) == CFT_EVAL) {
83 curcmd->c_flags &= ~CF_OPTIMIZE;
84 opt_arg(curcmd, 1, curcmd->c_type == C_EXPR);
90 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
93 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
95 if (!spat->spat_regexp->prelen && lastspat)
99 if (hint < s || hint > strend)
100 fatal("panic: hint in do_match");
103 if (spat->spat_regexp->regback >= 0) {
104 s -= spat->spat_regexp->regback;
111 else if (spat->spat_short) {
112 if (spat->spat_flags & SPAT_SCANFIRST) {
113 if (str->str_pok & SP_STUDIED) {
114 if (screamfirst[spat->spat_short->str_rare] < 0)
116 else if (!(s = screaminstr(str,spat->spat_short)))
120 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
124 if (s && spat->spat_regexp->regback >= 0) {
125 ++spat->spat_short->str_u.str_useful;
126 s -= spat->spat_regexp->regback;
133 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
134 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
136 if (--spat->spat_short->str_u.str_useful < 0) {
137 str_free(spat->spat_short);
138 spat->spat_short = Nullstr; /* opt is being useless */
141 once = !(rspat->spat_flags & SPAT_GLOBAL);
142 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
143 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
144 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
145 else { /* constant over loop, anyway */
146 (void)eval(rspat->spat_repl,G_SCALAR,sp);
147 dstr = stack->ary_array[sp+1];
150 clen = dstr->str_cur;
151 if (clen <= spat->spat_slen + (int)spat->spat_regexp->regback) {
152 /* can do inplace substitution */
153 if (regexec(spat->spat_regexp, s, strend, orig, 0,
154 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
155 if (spat->spat_regexp->subbase) /* oops, no we can't */
159 str->str_pok = SP_VALID; /* disable possible screamer */
161 m = spat->spat_regexp->startp[0];
162 d = spat->spat_regexp->endp[0];
164 if (m - s > strend - d) { /* faster to shorten from end */
166 (void)bcopy(c, m, clen);
171 (void)bcopy(d, m, i);
175 str->str_cur = m - s;
177 str_numset(arg->arg_ptr.arg_str, 1.0);
178 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
181 else if (i = m - s) { /* faster from front */
189 (void)bcopy(c, m, clen);
191 str_numset(arg->arg_ptr.arg_str, 1.0);
192 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
198 (void)bcopy(c,d,clen);
200 str_numset(arg->arg_ptr.arg_str, 1.0);
201 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
207 str_numset(arg->arg_ptr.arg_str, 1.0);
208 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
214 if (iters++ > maxiters)
215 fatal("Substitution loop");
216 m = spat->spat_regexp->startp[0];
223 (void)bcopy(c,d,clen);
226 s = spat->spat_regexp->endp[0];
227 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
228 Nullstr, TRUE)); /* (don't match same null twice) */
231 str->str_cur = d - str->str_ptr + i;
232 (void)bcopy(s,d,i+1); /* include the Null */
235 str_numset(arg->arg_ptr.arg_str, (double)iters);
236 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
239 str_numset(arg->arg_ptr.arg_str, 0.0);
240 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
246 if (regexec(spat->spat_regexp, s, strend, orig, 0,
247 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
249 dstr = Str_new(25,str_len(str));
250 str_nset(dstr,m,s-m);
251 if (spat->spat_regexp->subbase)
255 if (iters++ > maxiters)
256 fatal("Substitution loop");
257 if (spat->spat_regexp->subbase
258 && spat->spat_regexp->subbase != orig) {
261 orig = spat->spat_regexp->subbase;
263 strend = s + (strend - m);
265 m = spat->spat_regexp->startp[0];
266 str_ncat(dstr,s,m-s);
267 s = spat->spat_regexp->endp[0];
270 str_ncat(dstr,c,clen);
273 char *mysubbase = spat->spat_regexp->subbase;
275 spat->spat_regexp->subbase = Nullch; /* so recursion works */
276 (void)eval(rspat->spat_repl,G_SCALAR,sp);
277 str_scat(dstr,stack->ary_array[sp+1]);
278 if (spat->spat_regexp->subbase)
279 Safefree(spat->spat_regexp->subbase);
280 spat->spat_regexp->subbase = mysubbase;
284 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
286 str_ncat(dstr,s,strend - s);
287 str_replace(str,dstr);
289 str_numset(arg->arg_ptr.arg_str, (double)iters);
290 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
293 str_numset(arg->arg_ptr.arg_str, 0.0);
294 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
298 ++spat->spat_short->str_u.str_useful;
299 str_numset(arg->arg_ptr.arg_str, 0.0);
300 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
304 #pragma intrinsic(memcmp)
305 #endif /* BUGGY_MSC */
314 register int matches = 0;
318 register int squash = arg[2].arg_len & 1;
320 tbl = (short*) arg[2].arg_ptr.arg_cval;
322 send = s + str->str_cur;
324 fatal("panic: do_trans");
330 if (!arg[2].arg_len) {
332 if ((ch = tbl[*s & 0377]) >= 0) {
342 if ((ch = tbl[*s & 0377]) >= 0) {
344 if (matches++ && squash) {
353 else if (ch == -1) /* -1 is unmapped character */
354 *d++ = *s; /* -2 is delete character */
357 matches += send - d; /* account for disappeared chars */
359 str->str_cur = d - str->str_ptr;
370 register STR **st = stack->ary_array;
371 register int sp = arglast[1];
372 register int items = arglast[2] - sp;
373 register char *delim = str_get(st[sp]);
374 int delimlen = st[sp]->str_cur;
378 str_sset(str, *st++);
382 for (; items > 0; items--,st++) {
383 str_ncat(str,delim,delimlen);
388 for (; items > 0; items--,st++)
399 register STR **st = stack->ary_array;
400 register int sp = arglast[1];
402 register char *pat = str_get(st[sp]);
403 register char *patend = pat + st[sp]->str_cur;
407 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
408 static char *space10 = " ";
410 /* These must not be in registers: */
416 unsigned long aulong;
421 items = arglast[2] - sp;
424 while (pat < patend) {
425 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
428 len = index("@Xxu",datumtype) ? 0 : items;
431 else if (isdigit(*pat)) {
433 while (isdigit(*pat))
434 len = (len * 10) + (*pat++ - '0');
442 fatal("% may only be used in unpack");
453 if (str->str_cur < len)
454 fatal("X outside of string");
456 str->str_ptr[str->str_cur] = '\0';
461 str_ncat(str,null10,10);
464 str_ncat(str,null10,len);
469 aptr = str_get(fromstr);
471 len = fromstr->str_cur;
472 if (fromstr->str_cur > len)
473 str_ncat(str,aptr,len);
475 str_ncat(str,aptr,fromstr->str_cur);
476 len -= fromstr->str_cur;
477 if (datumtype == 'A') {
479 str_ncat(str,space10,10);
482 str_ncat(str,space10,len);
486 str_ncat(str,null10,10);
489 str_ncat(str,null10,len);
497 int saveitems = items;
500 aptr = str_get(fromstr);
502 len = fromstr->str_cur;
505 str->str_cur += (len+7)/8;
506 STR_GROW(str, str->str_cur + 1);
507 aptr = str->str_ptr + aint;
508 if (len > fromstr->str_cur)
509 len = fromstr->str_cur;
512 if (datumtype == 'B') {
513 for (len = 0; len++ < aint;) {
518 *aptr++ = items & 0xff;
524 for (len = 0; len++ < aint;) {
530 *aptr++ = items & 0xff;
536 if (datumtype == 'B')
537 items <<= 7 - (aint & 7);
539 items >>= 7 - (aint & 7);
540 *aptr++ = items & 0xff;
542 pat = str->str_ptr + str->str_cur;
554 int saveitems = items;
557 aptr = str_get(fromstr);
559 len = fromstr->str_cur;
562 str->str_cur += (len+1)/2;
563 STR_GROW(str, str->str_cur + 1);
564 aptr = str->str_ptr + aint;
565 if (len > fromstr->str_cur)
566 len = fromstr->str_cur;
569 if (datumtype == 'H') {
570 for (len = 0; len++ < aint;) {
572 items |= ((*pat++ & 15) + 9) & 15;
574 items |= *pat++ & 15;
578 *aptr++ = items & 0xff;
584 for (len = 0; len++ < aint;) {
586 items |= (((*pat++ & 15) + 9) & 15) << 4;
588 items |= (*pat++ & 15) << 4;
592 *aptr++ = items & 0xff;
598 *aptr++ = items & 0xff;
599 pat = str->str_ptr + str->str_cur;
611 aint = (int)str_gnum(fromstr);
613 str_ncat(str,&achar,sizeof(char));
616 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
621 afloat = (float)str_gnum(fromstr);
622 str_ncat(str, (char *)&afloat, sizeof (float));
629 adouble = (double)str_gnum(fromstr);
630 str_ncat(str, (char *)&adouble, sizeof (double));
636 ashort = (short)str_gnum(fromstr);
638 ashort = htons(ashort);
640 str_ncat(str,(char*)&ashort,sizeof(short));
647 ashort = (short)str_gnum(fromstr);
648 str_ncat(str,(char*)&ashort,sizeof(short));
654 auint = U_I(str_gnum(fromstr));
655 str_ncat(str,(char*)&auint,sizeof(unsigned int));
661 aint = (int)str_gnum(fromstr);
662 str_ncat(str,(char*)&aint,sizeof(int));
668 aulong = U_L(str_gnum(fromstr));
670 aulong = htonl(aulong);
672 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
678 aulong = U_L(str_gnum(fromstr));
679 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
685 along = (long)str_gnum(fromstr);
686 str_ncat(str,(char*)&along,sizeof(long));
692 aptr = str_get(fromstr);
693 str_ncat(str,(char*)&aptr,sizeof(char*));
698 aptr = str_get(fromstr);
699 aint = fromstr->str_cur;
700 STR_GROW(str,aint * 4 / 3);
712 doencodes(str, aptr, todo);
723 doencodes(str, s, len)
731 str_ncat(str, hunk, 1);
734 hunk[0] = ' ' + (077 & (*s >> 2));
735 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
736 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
737 hunk[3] = ' ' + (077 & (s[2] & 077));
738 str_ncat(str, hunk, 4);
742 for (s = str->str_ptr; *s; s++) {
746 str_ncat(str, "\n", 1);
750 do_sprintf(str,len,sarg)
760 static STR *sargnull = &str_no;
768 len--; /* don't count pattern string */
769 origs = t = s = str_get(*sarg);
770 send = s + (*sarg)->str_cur;
773 if (len <= 0 || !*sarg) {
777 for ( ; t < send && *t != '%'; t++) ;
779 break; /* end of format string, ignore extra args */
784 for (t++; t < send; t++) {
793 case '0': case '1': case '2': case '3': case '4':
794 case '5': case '6': case '7': case '8': case '9':
795 case '.': case '#': case '-': case '+': case ' ':
803 xlen = (int)str_gnum(*(sarg++));
804 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
810 (void)sprintf(xs,f,xlen);
821 (void)sprintf(xs,f,(long)str_gnum(*(sarg++)));
823 (void)sprintf(xs,f,(int)str_gnum(*(sarg++)));
829 case 'x': case 'o': case 'u':
832 value = str_gnum(*(sarg++));
834 (void)sprintf(xs,f,U_L(value));
836 (void)sprintf(xs,f,U_I(value));
839 case 'E': case 'e': case 'f': case 'G': case 'g':
842 (void)sprintf(xs,f,str_gnum(*(sarg++)));
849 xlen = (*sarg)->str_cur;
850 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B' && xs[3] == '\0'
851 && xlen == sizeof(STBP)) {
852 STR *tmpstr = Str_new(24,0);
854 stab_fullname(tmpstr, ((STAB*)(*sarg))); /* a stab value! */
855 sprintf(tokenbuf,"*%s",tmpstr->str_ptr);
856 /* reformat to non-binary */
858 xlen = strlen(tokenbuf);
862 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
863 break; /* so handle simple case */
865 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
867 (void)sprintf(buf,tokenbuf+64,xs);
872 /* end of switch, copy results */
874 STR_GROW(str, str->str_cur + (f - s) + len + 1);
875 str_ncat(str, s, f - s);
876 str_ncat(str, xs, xlen);
878 break; /* break from for loop */
881 str_ncat(str, s, t - s);
890 register STR **st = stack->ary_array;
891 register int sp = arglast[1];
892 register int items = arglast[2] - sp;
893 register STR *str = &str_undef;
895 for (st += ++sp; items > 0; items--,st++) {
899 (void)apush(ary,str);
905 do_unshift(ary,arglast)
909 register STR **st = stack->ary_array;
910 register int sp = arglast[1];
911 register int items = arglast[2] - sp;
917 for (st += ++sp; i < items; i++,st++) {
920 (void)astore(ary,i,str);
925 do_subr(arg,gimme,arglast)
930 register STR **st = stack->ary_array;
931 register int sp = arglast[1];
932 register int items = arglast[2] - sp;
936 int oldsave = savestack->ary_fill;
937 int oldtmps_base = tmps_base;
938 int hasargs = ((arg[2].arg_type & A_MASK) != A_NULL);
941 if ((arg[1].arg_type & A_MASK) == A_WORD)
942 stab = arg[1].arg_ptr.arg_stab;
944 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
947 stab = stabent(str_get(tmpstr),TRUE);
952 fatal("Undefined subroutine called");
953 if (!(sub = stab_sub(stab))) {
954 STR *tmpstr = arg[0].arg_ptr.arg_str;
956 stab_fullname(tmpstr, stab);
957 fatal("Undefined subroutine \"%s\" called",tmpstr->str_ptr);
959 if (arg->arg_type == O_DBSUBR && !sub->usersub) {
960 str = stab_val(DBsub);
962 stab_fullname(str,stab);
963 sub = stab_sub(DBsub);
965 fatal("No DBsub routine");
967 str = Str_new(15, sizeof(CSV));
968 str->str_state = SS_SCSV;
969 (void)apush(savestack,str);
970 csv = (CSV*)str->str_ptr;
973 csv->curcsv = curcsv;
974 csv->curcmd = curcmd;
975 csv->depth = sub->depth;
976 csv->wantarray = gimme;
977 csv->hasargs = hasargs;
981 csv->savearray = Null(ARRAY*);;
982 csv->argarray = Null(ARRAY*);
983 st[sp] = arg->arg_ptr.arg_str;
986 return (*sub->usersub)(sub->userindex,sp,items);
989 csv->savearray = stab_xarray(defstab);
990 csv->argarray = afake(defstab, items, &st[sp+1]);
991 stab_xarray(defstab) = csv->argarray;
994 if (sub->depth >= 2) { /* save temporaries on recursion? */
995 if (sub->depth == 100 && dowarn)
996 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
997 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
999 tmps_base = tmps_max;
1000 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
1001 st = stack->ary_array;
1003 tmps_base = oldtmps_base;
1004 for (items = arglast[0] + 1; items <= sp; items++)
1005 st[items] = str_mortal(st[items]);
1006 /* in case restore wipes old str */
1007 restorelist(oldsave);
1012 do_assign(arg,gimme,arglast)
1018 register STR **st = stack->ary_array;
1019 STR **firstrelem = st + arglast[1] + 1;
1020 STR **firstlelem = st + arglast[0] + 1;
1021 STR **lastrelem = st + arglast[2];
1022 STR **lastlelem = st + arglast[1];
1023 register STR **relem;
1024 register STR **lelem;
1027 register ARRAY *ary;
1028 register int makelocal;
1032 makelocal = (arg->arg_flags & AF_LOCAL);
1033 localizing = makelocal;
1034 delaymagic = DM_DELAY; /* catch simultaneous items */
1036 /* If there's a common identifier on both sides we have to take
1037 * special care that assigning the identifier on the left doesn't
1038 * clobber a value on the right that's used later in the list.
1040 if (arg->arg_flags & AF_COMMON) {
1041 for (relem = firstrelem; relem <= lastrelem; relem++) {
1043 *relem = str_mortal(str);
1050 while (lelem <= lastlelem) {
1052 if (str->str_state >= SS_HASH) {
1053 if (str->str_state == SS_ARY) {
1055 ary = saveary(str->str_u.str_stab);
1057 ary = stab_array(str->str_u.str_stab);
1061 while (relem <= lastrelem) { /* gobble up all the rest */
1062 str = Str_new(28,0);
1064 str_sset(str,*relem);
1066 (void)astore(ary,i++,str);
1069 else if (str->str_state == SS_HASH) {
1073 STAB *tmpstab = str->str_u.str_stab;
1076 hash = savehash(str->str_u.str_stab);
1078 hash = stab_hash(str->str_u.str_stab);
1079 if (tmpstab == envstab) {
1081 environ[0] = Nullch;
1083 else if (tmpstab == sigstab) {
1088 for (i = 1; i < NSIG; i++)
1089 signal(i, SIG_DFL); /* crunch, crunch, crunch */
1092 else if (hash->tbl_dbm)
1095 hclear(hash, magic == 'D'); /* wipe any dbm file too */
1098 while (relem < lastrelem) { /* gobble up all the rest */
1102 str = &str_no, relem++;
1103 tmps = str_get(str);
1104 tmpstr = Str_new(29,0);
1106 str_sset(tmpstr,*relem); /* value */
1107 *(relem++) = tmpstr;
1108 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
1110 str_magic(tmpstr, tmpstab, magic, tmps, str->str_cur);
1111 stabset(tmpstr->str_magic, tmpstr);
1116 fatal("panic: do_assign");
1121 if (relem <= lastrelem) {
1122 str_sset(str, *relem);
1126 str_sset(str, &str_undef);
1127 if (gimme == G_ARRAY) {
1128 i = ++lastrelem - firstrelem;
1129 relem++; /* tacky, I suppose */
1130 astore(stack,i,str);
1131 if (st != stack->ary_array) {
1132 st = stack->ary_array;
1133 firstrelem = st + arglast[1] + 1;
1134 firstlelem = st + arglast[0] + 1;
1135 lastlelem = st + arglast[1];
1137 relem = lastrelem + 1;
1144 if (delaymagic > 1) {
1145 if (delaymagic & DM_REUID) {
1149 if (uid != euid || setuid(uid) < 0)
1150 fatal("No setreuid available");
1153 if (delaymagic & DM_REGID) {
1157 if (gid != egid || setgid(gid) < 0)
1158 fatal("No setregid available");
1164 if (gimme == G_ARRAY) {
1165 i = lastrelem - firstrelem + 1;
1167 Copy(firstrelem, firstlelem, i, STR*);
1168 return arglast[0] + i;
1171 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
1172 *firstlelem = arg->arg_ptr.arg_str;
1173 return arglast[0] + 1;
1178 do_study(str,arg,gimme,arglast)
1184 register unsigned char *s;
1185 register int pos = str->str_cur;
1187 register int *sfirst;
1188 register int *snext;
1189 static int maxscream = -1;
1190 static STR *lastscream = Nullstr;
1192 int retarg = arglast[0] + 1;
1195 s = (unsigned char*)(str_get(str));
1197 s = Null(unsigned char*);
1200 lastscream->str_pok &= ~SP_STUDIED;
1206 if (pos > maxscream) {
1207 if (maxscream < 0) {
1208 maxscream = pos + 80;
1209 New(301,screamfirst, 256, int);
1210 New(302,screamnext, maxscream, int);
1213 maxscream = pos + pos / 4;
1214 Renew(screamnext, maxscream, int);
1218 sfirst = screamfirst;
1221 if (!sfirst || !snext)
1222 fatal("do_study: out of memory");
1224 for (ch = 256; ch; --ch)
1228 while (--pos >= 0) {
1230 if (sfirst[ch] >= 0)
1231 snext[pos] = sfirst[ch] - pos;
1236 /* If there were any case insensitive searches, we must assume they
1237 * all are. This speeds up insensitive searches much more than
1238 * it slows down sensitive ones.
1241 sfirst[fold[ch]] = pos;
1244 str->str_pok |= SP_STUDIED;
1247 str_numset(arg->arg_ptr.arg_str,(double)retval);
1248 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1253 do_defined(str,arg,gimme,arglast)
1260 register int retarg = arglast[0] + 1;
1265 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1266 fatal("Illegal argument to defined()");
1267 arg = arg[1].arg_ptr.arg_arg;
1268 type = arg->arg_type;
1270 if (type == O_SUBR || type == O_DBSUBR)
1271 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1272 else if (type == O_ARRAY || type == O_LARRAY ||
1273 type == O_ASLICE || type == O_LASLICE )
1274 retval = ((ary = stab_xarray(arg[1].arg_ptr.arg_stab)) != 0
1275 && ary->ary_max >= 0 );
1276 else if (type == O_HASH || type == O_LHASH ||
1277 type == O_HSLICE || type == O_LHSLICE )
1278 retval = ((hash = stab_xhash(arg[1].arg_ptr.arg_stab)) != 0
1279 && hash->tbl_array);
1282 str_numset(str,(double)retval);
1283 stack->ary_array[retarg] = str;
1288 do_undef(str,arg,gimme,arglast)
1295 register STAB *stab;
1296 int retarg = arglast[0] + 1;
1298 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1299 fatal("Illegal argument to undef()");
1300 arg = arg[1].arg_ptr.arg_arg;
1301 type = arg->arg_type;
1303 if (type == O_ARRAY || type == O_LARRAY) {
1304 stab = arg[1].arg_ptr.arg_stab;
1305 afree(stab_xarray(stab));
1306 stab_xarray(stab) = anew(stab); /* so "@array" still works */
1308 else if (type == O_HASH || type == O_LHASH) {
1309 stab = arg[1].arg_ptr.arg_stab;
1310 if (stab == envstab)
1311 environ[0] = Nullch;
1312 else if (stab == sigstab) {
1315 for (i = 1; i < NSIG; i++)
1316 signal(i, SIG_DFL); /* munch, munch, munch */
1318 (void)hfree(stab_xhash(stab), TRUE);
1319 stab_xhash(stab) = Null(HASH*);
1321 else if (type == O_SUBR || type == O_DBSUBR) {
1322 stab = arg[1].arg_ptr.arg_stab;
1323 if (stab_sub(stab)) {
1324 cmd_free(stab_sub(stab)->cmd);
1325 stab_sub(stab)->cmd = Nullcmd;
1326 afree(stab_sub(stab)->tosave);
1327 Safefree(stab_sub(stab));
1328 stab_sub(stab) = Null(SUBR*);
1332 fatal("Can't undefine that kind of object");
1333 str_numset(str,0.0);
1334 stack->ary_array[retarg] = str;
1339 do_vec(lvalue,astr,arglast)
1344 STR **st = stack->ary_array;
1345 int sp = arglast[0];
1346 register STR *str = st[++sp];
1347 register int offset = (int)str_gnum(st[++sp]);
1348 register int size = (int)str_gnum(st[++sp]);
1349 unsigned char *s = (unsigned char*)str_get(str);
1350 unsigned long retnum;
1354 offset *= size; /* turn into bit offset */
1355 len = (offset + size + 7) / 8;
1356 if (offset < 0 || size < 1)
1358 else if (!lvalue && len > str->str_cur)
1361 if (len > str->str_cur) {
1363 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1366 s = (unsigned char*)str_get(str);
1368 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1373 else if (size == 16)
1374 retnum = (s[offset] << 8) + s[offset+1];
1375 else if (size == 32)
1376 retnum = (s[offset] << 24) + (s[offset + 1] << 16) +
1377 (s[offset + 2] << 8) + s[offset+3];
1380 if (lvalue) { /* it's an lvalue! */
1381 struct lstring *lstr = (struct lstring*)astr;
1383 astr->str_magic = str;
1384 st[sp]->str_rare = 'v';
1385 lstr->lstr_offset = offset;
1386 lstr->lstr_len = size;
1390 str_numset(astr,(double)retnum);
1400 struct lstring *lstr = (struct lstring*)str;
1401 register int offset;
1403 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1404 register unsigned long lval = U_L(str_gnum(str));
1408 str->str_magic = Nullstr;
1409 offset = lstr->lstr_offset;
1410 size = lstr->lstr_len;
1412 mask = (1 << size) - 1;
1416 s[offset] &= ~(mask << size);
1417 s[offset] |= lval << size;
1421 s[offset] = lval & 255;
1422 else if (size == 16) {
1423 s[offset] = (lval >> 8) & 255;
1424 s[offset+1] = lval & 255;
1426 else if (size == 32) {
1427 s[offset] = (lval >> 24) & 255;
1428 s[offset+1] = (lval >> 16) & 255;
1429 s[offset+2] = (lval >> 8) & 255;
1430 s[offset+3] = lval & 255;
1439 register char *tmps;
1447 if (str->str_state == SS_ARY) {
1448 ary = stab_array(str->str_u.str_stab);
1449 for (i = 0; i <= ary->ary_fill; i++)
1450 do_chop(astr,ary->ary_array[i]);
1453 if (str->str_state == SS_HASH) {
1454 hash = stab_hash(str->str_u.str_stab);
1455 (void)hiterinit(hash);
1456 while (entry = hiternext(hash))
1457 do_chop(astr,hiterval(hash,entry));
1460 tmps = str_get(str);
1461 if (tmps && str->str_cur) {
1462 tmps += str->str_cur - 1;
1463 str_nset(astr,tmps,1); /* remember last char */
1464 *tmps = '\0'; /* wipe it out */
1465 str->str_cur = tmps - str->str_ptr;
1470 str_nset(astr,"",0);
1473 do_vop(optype,str,left,right)
1479 register char *l = str_get(left);
1480 register char *r = str_get(right);
1483 len = left->str_cur;
1484 if (len > right->str_cur)
1485 len = right->str_cur;
1486 if (str->str_cur > len)
1488 else if (str->str_cur < len) {
1490 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1514 if (right->str_cur > len)
1515 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1516 else if (left->str_cur > len)
1517 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1526 register STR **st = stack->ary_array;
1527 register int sp = arglast[1];
1528 register int items = arglast[2] - sp;
1529 unsigned long arg[8];
1535 for (st += ++sp; items--; st++)
1536 tainted |= (*st)->str_tainted;
1537 st = stack->ary_array;
1539 items = arglast[2] - sp;
1542 taintproper("Insecure dependency in syscall");
1544 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1545 * or where sizeof(long) != sizeof(char*). But such machines will
1546 * not likely have syscall implemented either, so who cares?
1549 if (st[++sp]->str_nok || !i)
1550 arg[i++] = (unsigned long)str_gnum(st[sp]);
1553 arg[i++] = (unsigned long)st[sp]->str_ptr;
1557 items = arglast[2] - sp;
1560 fatal("Too few args to syscall");
1562 retval = syscall(arg[0]);
1565 retval = syscall(arg[0],arg[1]);
1568 retval = syscall(arg[0],arg[1],arg[2]);
1571 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1574 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1577 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1580 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1583 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1589 fatal("syscall() unimplemented");