1 /* $Header: doarg.c,v 4.0 91/03/20 01:06:42 lwall Locked $
3 * Copyright (c) 1989, Larry Wall
5 * You may distribute under the terms of the GNU General Public License
6 * as specified in the README file that comes with the perl 3.0 kit.
9 * Revision 4.0 91/03/20 01:06:42 lwall
17 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
21 extern unsigned char fold[];
24 extern char **environ;
25 #endif /* ! __STDC__ */
28 #pragma function(memcmp)
29 #endif /* BUGGY_MSC */
40 register char *s = str_get(str);
41 char *strend = s + str->str_cur;
47 int maxiters = (strend - s) + 10;
53 rspat = spat = arg[2].arg_ptr.arg_spat;
55 fatal("panic: do_subst");
56 else if (spat->spat_runtime) {
58 (void)eval(spat->spat_runtime,G_SCALAR,sp);
59 m = str_get(dstr = stack->ary_array[sp+1]);
61 if (spat->spat_regexp) {
62 regfree(spat->spat_regexp);
63 spat->spat_regexp = Null(REGEXP*); /* required if regcomp pukes */
65 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
66 spat->spat_flags & SPAT_FOLD);
67 if (spat->spat_flags & SPAT_KEEP) {
68 arg_free(spat->spat_runtime); /* it won't change, so */
69 spat->spat_runtime = Nullarg; /* no point compiling again */
74 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
77 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
79 if (!*spat->spat_regexp->precomp && lastspat)
83 if (hint < s || hint > strend)
84 fatal("panic: hint in do_match");
87 if (spat->spat_regexp->regback >= 0) {
88 s -= spat->spat_regexp->regback;
95 else if (spat->spat_short) {
96 if (spat->spat_flags & SPAT_SCANFIRST) {
97 if (str->str_pok & SP_STUDIED) {
98 if (screamfirst[spat->spat_short->str_rare] < 0)
100 else if (!(s = screaminstr(str,spat->spat_short)))
104 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
108 if (s && spat->spat_regexp->regback >= 0) {
109 ++spat->spat_short->str_u.str_useful;
110 s -= spat->spat_regexp->regback;
117 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
118 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
120 if (--spat->spat_short->str_u.str_useful < 0) {
121 str_free(spat->spat_short);
122 spat->spat_short = Nullstr; /* opt is being useless */
125 once = ((rspat->spat_flags & SPAT_ONCE) != 0);
126 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
127 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
128 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
129 else { /* constant over loop, anyway */
130 (void)eval(rspat->spat_repl,G_SCALAR,sp);
131 dstr = stack->ary_array[sp+1];
134 clen = dstr->str_cur;
135 if (clen <= spat->spat_slen + (int)spat->spat_regexp->regback) {
136 /* can do inplace substitution */
137 if (regexec(spat->spat_regexp, s, strend, orig, 0,
138 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
139 if (spat->spat_regexp->subbase) /* oops, no we can't */
143 str->str_pok = SP_VALID; /* disable possible screamer */
145 m = spat->spat_regexp->startp[0];
146 d = spat->spat_regexp->endp[0];
148 if (m - s > strend - d) { /* faster to shorten from end */
150 (void)bcopy(c, m, clen);
155 (void)bcopy(d, m, i);
159 str->str_cur = m - s;
161 str_numset(arg->arg_ptr.arg_str, 1.0);
162 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
165 else if (i = m - s) { /* faster from front */
173 (void)bcopy(c, m, clen);
175 str_numset(arg->arg_ptr.arg_str, 1.0);
176 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
182 (void)bcopy(c,d,clen);
184 str_numset(arg->arg_ptr.arg_str, 1.0);
185 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
191 str_numset(arg->arg_ptr.arg_str, 1.0);
192 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
198 if (iters++ > maxiters)
199 fatal("Substitution loop");
200 m = spat->spat_regexp->startp[0];
207 (void)bcopy(c,d,clen);
210 s = spat->spat_regexp->endp[0];
211 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
212 Nullstr, TRUE)); /* (don't match same null twice) */
215 str->str_cur = d - str->str_ptr + i;
216 (void)bcopy(s,d,i+1); /* include the Null */
219 str_numset(arg->arg_ptr.arg_str, (double)iters);
220 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
223 str_numset(arg->arg_ptr.arg_str, 0.0);
224 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
230 if (regexec(spat->spat_regexp, s, strend, orig, 0,
231 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
233 dstr = Str_new(25,str_len(str));
234 str_nset(dstr,m,s-m);
235 if (spat->spat_regexp->subbase)
239 if (iters++ > maxiters)
240 fatal("Substitution loop");
241 if (spat->spat_regexp->subbase
242 && spat->spat_regexp->subbase != orig) {
245 orig = spat->spat_regexp->subbase;
247 strend = s + (strend - m);
249 m = spat->spat_regexp->startp[0];
250 str_ncat(dstr,s,m-s);
251 s = spat->spat_regexp->endp[0];
254 str_ncat(dstr,c,clen);
257 char *mysubbase = spat->spat_regexp->subbase;
259 spat->spat_regexp->subbase = Nullch; /* so recursion works */
260 (void)eval(rspat->spat_repl,G_SCALAR,sp);
261 str_scat(dstr,stack->ary_array[sp+1]);
262 if (spat->spat_regexp->subbase)
263 Safefree(spat->spat_regexp->subbase);
264 spat->spat_regexp->subbase = mysubbase;
268 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
270 str_ncat(dstr,s,strend - s);
271 str_replace(str,dstr);
273 str_numset(arg->arg_ptr.arg_str, (double)iters);
274 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
277 str_numset(arg->arg_ptr.arg_str, 0.0);
278 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
282 ++spat->spat_short->str_u.str_useful;
283 str_numset(arg->arg_ptr.arg_str, 0.0);
284 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
288 #pragma intrinsic(memcmp)
289 #endif /* BUGGY_MSC */
298 register int matches = 0;
302 register int squash = arg[2].arg_len & 1;
304 tbl = (short*) arg[2].arg_ptr.arg_cval;
306 send = s + str->str_cur;
308 fatal("panic: do_trans");
314 if (!arg[2].arg_len) {
316 if ((ch = tbl[*s & 0377]) >= 0) {
326 if ((ch = tbl[*s & 0377]) >= 0) {
328 if (matches++ && squash) {
337 else if (ch == -1) /* -1 is unmapped character */
338 *d++ = *s; /* -2 is delete character */
341 matches += send - d; /* account for disappeared chars */
343 str->str_cur = d - str->str_ptr;
354 register STR **st = stack->ary_array;
355 register int sp = arglast[1];
356 register int items = arglast[2] - sp;
357 register char *delim = str_get(st[sp]);
358 int delimlen = st[sp]->str_cur;
362 str_sset(str, *st++);
366 for (; items > 0; items--,st++) {
367 str_ncat(str,delim,delimlen);
372 for (; items > 0; items--,st++)
383 register STR **st = stack->ary_array;
384 register int sp = arglast[1];
386 register char *pat = str_get(st[sp]);
387 register char *patend = pat + st[sp]->str_cur;
391 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
392 static char *space10 = " ";
394 /* These must not be in registers: */
400 unsigned long aulong;
405 items = arglast[2] - sp;
408 while (pat < patend) {
409 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
412 len = index("@Xxu",datumtype) ? 0 : items;
415 else if (isdigit(*pat)) {
417 while (isdigit(*pat))
418 len = (len * 10) + (*pat++ - '0');
426 fatal("% may only be used in unpack");
437 if (str->str_cur < len)
438 fatal("X outside of string");
440 str->str_ptr[str->str_cur] = '\0';
445 str_ncat(str,null10,10);
448 str_ncat(str,null10,len);
453 aptr = str_get(fromstr);
455 len = fromstr->str_cur;
456 if (fromstr->str_cur > len)
457 str_ncat(str,aptr,len);
459 str_ncat(str,aptr,fromstr->str_cur);
460 len -= fromstr->str_cur;
461 if (datumtype == 'A') {
463 str_ncat(str,space10,10);
466 str_ncat(str,space10,len);
470 str_ncat(str,null10,10);
473 str_ncat(str,null10,len);
481 int saveitems = items;
484 aptr = str_get(fromstr);
486 len = fromstr->str_cur;
489 str->str_cur += (len+7)/8;
490 STR_GROW(str, str->str_cur + 1);
491 aptr = str->str_ptr + aint;
492 if (len > fromstr->str_cur)
493 len = fromstr->str_cur;
496 if (datumtype == 'B') {
497 for (len = 0; len++ < aint;) {
502 *aptr++ = items & 0xff;
508 for (len = 0; len++ < aint;) {
514 *aptr++ = items & 0xff;
520 if (datumtype == 'B')
521 items <<= 7 - (aint & 7);
523 items >>= 7 - (aint & 7);
524 *aptr++ = items & 0xff;
526 pat = str->str_ptr + str->str_cur;
538 int saveitems = items;
541 aptr = str_get(fromstr);
543 len = fromstr->str_cur;
546 str->str_cur += (len+1)/2;
547 STR_GROW(str, str->str_cur + 1);
548 aptr = str->str_ptr + aint;
549 if (len > fromstr->str_cur)
550 len = fromstr->str_cur;
553 if (datumtype == 'H') {
554 for (len = 0; len++ < aint;) {
556 items |= ((*pat++ & 15) + 9) & 15;
558 items |= *pat++ & 15;
562 *aptr++ = items & 0xff;
568 for (len = 0; len++ < aint;) {
570 items |= (((*pat++ & 15) + 9) & 15) << 4;
572 items |= (*pat++ & 15) << 4;
576 *aptr++ = items & 0xff;
582 *aptr++ = items & 0xff;
583 pat = str->str_ptr + str->str_cur;
595 aint = (int)str_gnum(fromstr);
597 str_ncat(str,&achar,sizeof(char));
600 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
605 afloat = (float)str_gnum(fromstr);
606 str_ncat(str, (char *)&afloat, sizeof (float));
613 adouble = (double)str_gnum(fromstr);
614 str_ncat(str, (char *)&adouble, sizeof (double));
620 ashort = (short)str_gnum(fromstr);
622 ashort = htons(ashort);
624 str_ncat(str,(char*)&ashort,sizeof(short));
631 ashort = (short)str_gnum(fromstr);
632 str_ncat(str,(char*)&ashort,sizeof(short));
638 auint = U_I(str_gnum(fromstr));
639 str_ncat(str,(char*)&auint,sizeof(unsigned int));
645 aint = (int)str_gnum(fromstr);
646 str_ncat(str,(char*)&aint,sizeof(int));
652 aulong = U_L(str_gnum(fromstr));
654 aulong = htonl(aulong);
656 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
662 aulong = U_L(str_gnum(fromstr));
663 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
669 along = (long)str_gnum(fromstr);
670 str_ncat(str,(char*)&along,sizeof(long));
676 aptr = str_get(fromstr);
677 str_ncat(str,(char*)&aptr,sizeof(char*));
682 aptr = str_get(fromstr);
683 aint = fromstr->str_cur;
684 STR_GROW(str,aint * 4 / 3);
696 doencodes(str, aptr, todo);
707 doencodes(str, s, len)
715 str_ncat(str, hunk, 1);
718 hunk[0] = ' ' + (077 & (*s >> 2));
719 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
720 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
721 hunk[3] = ' ' + (077 & (s[2] & 077));
722 str_ncat(str, hunk, 4);
726 for (s = str->str_ptr; *s; s++) {
730 str_ncat(str, "\n", 1);
734 do_sprintf(str,len,sarg)
744 static STR *sargnull = &str_no;
752 len--; /* don't count pattern string */
753 origs = t = s = str_get(*sarg);
754 send = s + (*sarg)->str_cur;
757 if (len <= 0 || !*sarg) {
761 for ( ; t < send && *t != '%'; t++) ;
763 break; /* end of format string, ignore extra args */
768 for (t++; t < send; t++) {
777 case '0': case '1': case '2': case '3': case '4':
778 case '5': case '6': case '7': case '8': case '9':
779 case '.': case '#': case '-': case '+': case ' ':
787 xlen = (int)str_gnum(*(sarg++));
788 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
794 (void)sprintf(xs,f,xlen);
805 (void)sprintf(xs,f,(long)str_gnum(*(sarg++)));
807 (void)sprintf(xs,f,(int)str_gnum(*(sarg++)));
813 case 'x': case 'o': case 'u':
816 value = str_gnum(*(sarg++));
818 (void)sprintf(xs,f,U_L(value));
820 (void)sprintf(xs,f,U_I(value));
823 case 'E': case 'e': case 'f': case 'G': case 'g':
826 (void)sprintf(xs,f,str_gnum(*(sarg++)));
833 xlen = (*sarg)->str_cur;
834 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B'
835 && xlen == sizeof(STBP) && strlen(xs) < xlen) {
836 STR *tmpstr = Str_new(24,0);
838 stab_fullname(tmpstr, ((STAB*)(*sarg))); /* a stab value! */
839 sprintf(tokenbuf,"*%s",tmpstr->str_ptr);
840 /* reformat to non-binary */
842 xlen = strlen(tokenbuf);
846 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
847 break; /* so handle simple case */
849 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
851 (void)sprintf(buf,tokenbuf+64,xs);
856 /* end of switch, copy results */
858 STR_GROW(str, str->str_cur + (f - s) + len + 1);
859 str_ncat(str, s, f - s);
860 str_ncat(str, xs, xlen);
862 break; /* break from for loop */
865 str_ncat(str, s, t - s);
874 register STR **st = stack->ary_array;
875 register int sp = arglast[1];
876 register int items = arglast[2] - sp;
877 register STR *str = &str_undef;
879 for (st += ++sp; items > 0; items--,st++) {
883 (void)apush(ary,str);
889 do_unshift(ary,arglast)
893 register STR **st = stack->ary_array;
894 register int sp = arglast[1];
895 register int items = arglast[2] - sp;
901 for (st += ++sp; i < items; i++,st++) {
904 (void)astore(ary,i,str);
909 do_subr(arg,gimme,arglast)
914 register STR **st = stack->ary_array;
915 register int sp = arglast[1];
916 register int items = arglast[2] - sp;
920 int oldsave = savestack->ary_fill;
921 int oldtmps_base = tmps_base;
922 int hasargs = ((arg[2].arg_type & A_MASK) != A_NULL);
925 if ((arg[1].arg_type & A_MASK) == A_WORD)
926 stab = arg[1].arg_ptr.arg_stab;
928 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
931 stab = stabent(str_get(tmpstr),TRUE);
936 fatal("Undefined subroutine called");
937 if (arg->arg_type == O_DBSUBR && !sub->usersub) {
938 str = stab_val(DBsub);
940 stab_fullname(str,stab);
941 sub = stab_sub(DBsub);
943 fatal("No DBsub routine");
946 if (!(sub = stab_sub(stab))) {
947 STR *tmpstr = arg[0].arg_ptr.arg_str;
949 stab_fullname(tmpstr, stab);
950 fatal("Undefined subroutine \"%s\" called",tmpstr->str_ptr);
953 str = Str_new(15, sizeof(CSV));
954 str->str_state = SS_SCSV;
955 (void)apush(savestack,str);
956 csv = (CSV*)str->str_ptr;
959 csv->curcsv = curcsv;
960 csv->curcmd = curcmd;
961 csv->depth = sub->depth;
962 csv->wantarray = gimme;
963 csv->hasargs = hasargs;
967 csv->savearray = Null(ARRAY*);;
968 csv->argarray = Null(ARRAY*);
969 st[sp] = arg->arg_ptr.arg_str;
972 return (*sub->usersub)(sub->userindex,sp,items);
975 csv->savearray = stab_xarray(defstab);
976 csv->argarray = afake(defstab, items, &st[sp+1]);
977 stab_xarray(defstab) = csv->argarray;
980 if (sub->depth >= 2) { /* save temporaries on recursion? */
981 if (sub->depth == 100 && dowarn)
982 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
983 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
985 tmps_base = tmps_max;
986 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
987 st = stack->ary_array;
989 tmps_base = oldtmps_base;
990 for (items = arglast[0] + 1; items <= sp; items++)
991 st[items] = str_mortal(st[items]);
992 /* in case restore wipes old str */
993 restorelist(oldsave);
998 do_assign(arg,gimme,arglast)
1004 register STR **st = stack->ary_array;
1005 STR **firstrelem = st + arglast[1] + 1;
1006 STR **firstlelem = st + arglast[0] + 1;
1007 STR **lastrelem = st + arglast[2];
1008 STR **lastlelem = st + arglast[1];
1009 register STR **relem;
1010 register STR **lelem;
1013 register ARRAY *ary;
1014 register int makelocal;
1018 makelocal = (arg->arg_flags & AF_LOCAL);
1019 localizing = makelocal;
1020 delaymagic = DM_DELAY; /* catch simultaneous items */
1022 /* If there's a common identifier on both sides we have to take
1023 * special care that assigning the identifier on the left doesn't
1024 * clobber a value on the right that's used later in the list.
1026 if (arg->arg_flags & AF_COMMON) {
1027 for (relem = firstrelem; relem <= lastrelem; relem++) {
1029 *relem = str_mortal(str);
1036 while (lelem <= lastlelem) {
1038 if (str->str_state >= SS_HASH) {
1039 if (str->str_state == SS_ARY) {
1041 ary = saveary(str->str_u.str_stab);
1043 ary = stab_array(str->str_u.str_stab);
1047 while (relem <= lastrelem) { /* gobble up all the rest */
1048 str = Str_new(28,0);
1050 str_sset(str,*relem);
1052 (void)astore(ary,i++,str);
1055 else if (str->str_state == SS_HASH) {
1059 STAB *tmpstab = str->str_u.str_stab;
1062 hash = savehash(str->str_u.str_stab);
1064 hash = stab_hash(str->str_u.str_stab);
1065 if (tmpstab == envstab) {
1067 environ[0] = Nullch;
1069 else if (tmpstab == sigstab) {
1074 for (i = 1; i < NSIG; i++)
1075 signal(i, SIG_DFL); /* crunch, crunch, crunch */
1078 else if (hash->tbl_dbm)
1081 hclear(hash, magic == 'D'); /* wipe any dbm file too */
1084 while (relem < lastrelem) { /* gobble up all the rest */
1088 str = &str_no, relem++;
1089 tmps = str_get(str);
1090 tmpstr = Str_new(29,0);
1092 str_sset(tmpstr,*relem); /* value */
1093 *(relem++) = tmpstr;
1094 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
1096 str_magic(tmpstr, tmpstab, magic, tmps, str->str_cur);
1097 stabset(tmpstr->str_magic, tmpstr);
1102 fatal("panic: do_assign");
1107 if (relem <= lastrelem) {
1108 str_sset(str, *relem);
1112 str_sset(str, &str_undef);
1113 if (gimme == G_ARRAY) {
1114 i = ++lastrelem - firstrelem;
1115 relem++; /* tacky, I suppose */
1116 astore(stack,i,str);
1117 if (st != stack->ary_array) {
1118 st = stack->ary_array;
1119 firstrelem = st + arglast[1] + 1;
1120 firstlelem = st + arglast[0] + 1;
1121 lastlelem = st + arglast[1];
1123 relem = lastrelem + 1;
1130 if (delaymagic > 1) {
1131 if (delaymagic & DM_REUID) {
1135 if (uid != euid || setuid(uid) < 0)
1136 fatal("No setreuid available");
1139 if (delaymagic & DM_REGID) {
1143 if (gid != egid || setgid(gid) < 0)
1144 fatal("No setregid available");
1150 if (gimme == G_ARRAY) {
1151 i = lastrelem - firstrelem + 1;
1153 Copy(firstrelem, firstlelem, i, STR*);
1154 return arglast[0] + i;
1157 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
1158 *firstlelem = arg->arg_ptr.arg_str;
1159 return arglast[0] + 1;
1164 do_study(str,arg,gimme,arglast)
1170 register unsigned char *s;
1171 register int pos = str->str_cur;
1173 register int *sfirst;
1174 register int *snext;
1175 static int maxscream = -1;
1176 static STR *lastscream = Nullstr;
1178 int retarg = arglast[0] + 1;
1181 s = (unsigned char*)(str_get(str));
1183 s = Null(unsigned char*);
1186 lastscream->str_pok &= ~SP_STUDIED;
1192 if (pos > maxscream) {
1193 if (maxscream < 0) {
1194 maxscream = pos + 80;
1195 New(301,screamfirst, 256, int);
1196 New(302,screamnext, maxscream, int);
1199 maxscream = pos + pos / 4;
1200 Renew(screamnext, maxscream, int);
1204 sfirst = screamfirst;
1207 if (!sfirst || !snext)
1208 fatal("do_study: out of memory");
1210 for (ch = 256; ch; --ch)
1214 while (--pos >= 0) {
1216 if (sfirst[ch] >= 0)
1217 snext[pos] = sfirst[ch] - pos;
1222 /* If there were any case insensitive searches, we must assume they
1223 * all are. This speeds up insensitive searches much more than
1224 * it slows down sensitive ones.
1227 sfirst[fold[ch]] = pos;
1230 str->str_pok |= SP_STUDIED;
1233 str_numset(arg->arg_ptr.arg_str,(double)retval);
1234 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1239 do_defined(str,arg,gimme,arglast)
1246 register int retarg = arglast[0] + 1;
1251 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1252 fatal("Illegal argument to defined()");
1253 arg = arg[1].arg_ptr.arg_arg;
1254 type = arg->arg_type;
1256 if (type == O_SUBR || type == O_DBSUBR)
1257 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1258 else if (type == O_ARRAY || type == O_LARRAY ||
1259 type == O_ASLICE || type == O_LASLICE )
1260 retval = ((ary = stab_xarray(arg[1].arg_ptr.arg_stab)) != 0
1261 && ary->ary_max >= 0 );
1262 else if (type == O_HASH || type == O_LHASH ||
1263 type == O_HSLICE || type == O_LHSLICE )
1264 retval = ((hash = stab_xhash(arg[1].arg_ptr.arg_stab)) != 0
1265 && hash->tbl_array);
1268 str_numset(str,(double)retval);
1269 stack->ary_array[retarg] = str;
1274 do_undef(str,arg,gimme,arglast)
1281 register STAB *stab;
1282 int retarg = arglast[0] + 1;
1284 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1285 fatal("Illegal argument to undef()");
1286 arg = arg[1].arg_ptr.arg_arg;
1287 type = arg->arg_type;
1289 if (type == O_ARRAY || type == O_LARRAY) {
1290 stab = arg[1].arg_ptr.arg_stab;
1291 afree(stab_xarray(stab));
1292 stab_xarray(stab) = Null(ARRAY*);
1294 else if (type == O_HASH || type == O_LHASH) {
1295 stab = arg[1].arg_ptr.arg_stab;
1296 if (stab == envstab)
1297 environ[0] = Nullch;
1298 else if (stab == sigstab) {
1301 for (i = 1; i < NSIG; i++)
1302 signal(i, SIG_DFL); /* munch, munch, munch */
1304 (void)hfree(stab_xhash(stab), TRUE);
1305 stab_xhash(stab) = Null(HASH*);
1307 else if (type == O_SUBR || type == O_DBSUBR) {
1308 stab = arg[1].arg_ptr.arg_stab;
1309 if (stab_sub(stab)) {
1310 cmd_free(stab_sub(stab)->cmd);
1311 stab_sub(stab)->cmd = Nullcmd;
1312 afree(stab_sub(stab)->tosave);
1313 Safefree(stab_sub(stab));
1314 stab_sub(stab) = Null(SUBR*);
1318 fatal("Can't undefine that kind of object");
1319 str_numset(str,0.0);
1320 stack->ary_array[retarg] = str;
1325 do_vec(lvalue,astr,arglast)
1330 STR **st = stack->ary_array;
1331 int sp = arglast[0];
1332 register STR *str = st[++sp];
1333 register int offset = (int)str_gnum(st[++sp]);
1334 register int size = (int)str_gnum(st[++sp]);
1335 unsigned char *s = (unsigned char*)str_get(str);
1336 unsigned long retnum;
1340 offset *= size; /* turn into bit offset */
1341 len = (offset + size + 7) / 8;
1342 if (offset < 0 || size < 1)
1344 else if (!lvalue && len > str->str_cur)
1347 if (len > str->str_cur) {
1349 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1352 s = (unsigned char*)str_get(str);
1354 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1359 else if (size == 16)
1360 retnum = (s[offset] << 8) + s[offset+1];
1361 else if (size == 32)
1362 retnum = (s[offset] << 24) + (s[offset + 1] << 16) +
1363 (s[offset + 2] << 8) + s[offset+3];
1366 if (lvalue) { /* it's an lvalue! */
1367 struct lstring *lstr = (struct lstring*)astr;
1369 astr->str_magic = str;
1370 st[sp]->str_rare = 'v';
1371 lstr->lstr_offset = offset;
1372 lstr->lstr_len = size;
1376 str_numset(astr,(double)retnum);
1386 struct lstring *lstr = (struct lstring*)str;
1387 register int offset;
1389 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1390 register unsigned long lval = U_L(str_gnum(str));
1394 str->str_magic = Nullstr;
1395 offset = lstr->lstr_offset;
1396 size = lstr->lstr_len;
1398 mask = (1 << size) - 1;
1402 s[offset] &= ~(mask << size);
1403 s[offset] |= lval << size;
1407 s[offset] = lval & 255;
1408 else if (size == 16) {
1409 s[offset] = (lval >> 8) & 255;
1410 s[offset+1] = lval & 255;
1412 else if (size == 32) {
1413 s[offset] = (lval >> 24) & 255;
1414 s[offset+1] = (lval >> 16) & 255;
1415 s[offset+2] = (lval >> 8) & 255;
1416 s[offset+3] = lval & 255;
1425 register char *tmps;
1433 if (str->str_state == SS_ARY) {
1434 ary = stab_array(str->str_u.str_stab);
1435 for (i = 0; i <= ary->ary_fill; i++)
1436 do_chop(astr,ary->ary_array[i]);
1439 if (str->str_state == SS_HASH) {
1440 hash = stab_hash(str->str_u.str_stab);
1441 (void)hiterinit(hash);
1442 while (entry = hiternext(hash))
1443 do_chop(astr,hiterval(hash,entry));
1446 tmps = str_get(str);
1449 tmps += str->str_cur - (str->str_cur != 0);
1450 str_nset(astr,tmps,1); /* remember last char */
1451 *tmps = '\0'; /* wipe it out */
1452 str->str_cur = tmps - str->str_ptr;
1457 do_vop(optype,str,left,right)
1463 register char *l = str_get(left);
1464 register char *r = str_get(right);
1467 len = left->str_cur;
1468 if (len > right->str_cur)
1469 len = right->str_cur;
1470 if (str->str_cur > len)
1472 else if (str->str_cur < len) {
1474 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1496 if (right->str_cur > len)
1497 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1498 else if (left->str_cur > len)
1499 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1508 register STR **st = stack->ary_array;
1509 register int sp = arglast[1];
1510 register int items = arglast[2] - sp;
1517 for (st += ++sp; items--; st++)
1518 tainted |= (*st)->str_tainted;
1519 st = stack->ary_array;
1521 items = arglast[2] - sp;
1524 taintproper("Insecure dependency in syscall");
1526 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1527 * or where sizeof(long) != sizeof(char*). But such machines will
1528 * not likely have syscall implemented either, so who cares?
1531 if (st[++sp]->str_nok || !i)
1532 arg[i++] = (long)str_gnum(st[sp]);
1535 arg[i++] = (long)st[sp]->str_ptr;
1539 items = arglast[2] - sp;
1542 fatal("Too few args to syscall");
1544 retval = syscall(arg[0]);
1547 retval = syscall(arg[0],arg[1]);
1550 retval = syscall(arg[0],arg[1],arg[2]);
1553 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1556 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1559 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1562 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1565 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1571 fatal("syscall() unimplemented");