1 /* $Header: doarg.c,v 3.0.1.6 90/08/09 02:48:38 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 3.0.1.6 90/08/09 02:48:38 lwall
10 * patch19: fixed double include of <signal.h>
11 * patch19: pack/unpack can now do native float and double
12 * patch19: pack/unpack can now have absolute and negative positioning
13 * patch19: pack/unpack can now have use * to specify all the rest of input
14 * patch19: unpack can do checksumming
15 * patch19: $< and $> better supported on machines without setreuid
16 * patch19: Added support for linked-in C subroutines
18 * Revision 3.0.1.5 90/03/27 15:39:03 lwall
19 * patch16: MSDOS support
20 * patch16: support for machines that can't cast negative floats to unsigned ints
21 * patch16: sprintf($s,...,$s,...) didn't work
23 * Revision 3.0.1.4 90/03/12 16:28:42 lwall
24 * patch13: pack of ascii strings could call str_ncat() with negative length
25 * patch13: printf("%s", *foo) was busted
27 * Revision 3.0.1.3 90/02/28 16:56:58 lwall
28 * patch9: split now can split into more than 10000 elements
29 * patch9: sped up pack and unpack
30 * patch9: pack of unsigned ints and longs blew up some places
31 * patch9: sun3 can't cast negative float to unsigned int or long
32 * patch9: local($.) didn't work
33 * patch9: grep(s/foo/bar/, @abc = @xyz) modified @xyz rather than @abc
34 * patch9: syscall returned stack size rather than value of system call
36 * Revision 3.0.1.2 89/12/21 19:52:15 lwall
37 * patch7: a pattern wouldn't match a null string before the first character
38 * patch7: certain patterns didn't match correctly at end of string
40 * Revision 3.0.1.1 89/11/11 04:17:20 lwall
41 * patch2: printf %c, %D, %X and %O didn't work right
42 * patch2: printf of unsigned vs signed needed separate casts on some machines
44 * Revision 3.0 89/10/18 15:10:41 lwall
56 extern unsigned char fold[];
61 #pragma function(memcmp)
62 #endif /* BUGGY_MSC */
73 register char *s = str_get(str);
74 char *strend = s + str->str_cur;
80 int maxiters = (strend - s) + 10;
86 rspat = spat = arg[2].arg_ptr.arg_spat;
88 fatal("panic: do_subst");
89 else if (spat->spat_runtime) {
91 (void)eval(spat->spat_runtime,G_SCALAR,sp);
92 m = str_get(dstr = stack->ary_array[sp+1]);
94 if (spat->spat_regexp)
95 regfree(spat->spat_regexp);
96 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
97 spat->spat_flags & SPAT_FOLD);
98 if (spat->spat_flags & SPAT_KEEP) {
99 arg_free(spat->spat_runtime); /* it won't change, so */
100 spat->spat_runtime = Nullarg; /* no point compiling again */
105 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
108 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
110 if (!*spat->spat_regexp->precomp && lastspat)
114 if (hint < s || hint > strend)
115 fatal("panic: hint in do_match");
118 if (spat->spat_regexp->regback >= 0) {
119 s -= spat->spat_regexp->regback;
126 else if (spat->spat_short) {
127 if (spat->spat_flags & SPAT_SCANFIRST) {
128 if (str->str_pok & SP_STUDIED) {
129 if (screamfirst[spat->spat_short->str_rare] < 0)
131 else if (!(s = screaminstr(str,spat->spat_short)))
135 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
139 if (s && spat->spat_regexp->regback >= 0) {
140 ++spat->spat_short->str_u.str_useful;
141 s -= spat->spat_regexp->regback;
148 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
149 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
151 if (--spat->spat_short->str_u.str_useful < 0) {
152 str_free(spat->spat_short);
153 spat->spat_short = Nullstr; /* opt is being useless */
156 once = ((rspat->spat_flags & SPAT_ONCE) != 0);
157 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
158 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
159 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
160 else { /* constant over loop, anyway */
161 (void)eval(rspat->spat_repl,G_SCALAR,sp);
162 dstr = stack->ary_array[sp+1];
165 clen = dstr->str_cur;
166 if (clen <= spat->spat_slen + spat->spat_regexp->regback) {
167 /* can do inplace substitution */
168 if (regexec(spat->spat_regexp, s, strend, orig, 0,
169 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
170 if (spat->spat_regexp->subbase) /* oops, no we can't */
174 str->str_pok = SP_VALID; /* disable possible screamer */
176 m = spat->spat_regexp->startp[0];
177 d = spat->spat_regexp->endp[0];
179 if (m - s > strend - d) { /* faster to shorten from end */
181 (void)bcopy(c, m, clen);
186 (void)bcopy(d, m, i);
190 str->str_cur = m - s;
192 str_numset(arg->arg_ptr.arg_str, 1.0);
193 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
196 else if (i = m - s) { /* faster from front */
204 (void)bcopy(c, m, clen);
206 str_numset(arg->arg_ptr.arg_str, 1.0);
207 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
213 (void)bcopy(c,d,clen);
215 str_numset(arg->arg_ptr.arg_str, 1.0);
216 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
222 str_numset(arg->arg_ptr.arg_str, 1.0);
223 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
229 if (iters++ > maxiters)
230 fatal("Substitution loop");
231 m = spat->spat_regexp->startp[0];
238 (void)bcopy(c,d,clen);
241 s = spat->spat_regexp->endp[0];
242 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
243 Nullstr, TRUE)); /* (don't match same null twice) */
246 str->str_cur = d - str->str_ptr + i;
247 (void)bcopy(s,d,i+1); /* include the Null */
250 str_numset(arg->arg_ptr.arg_str, (double)iters);
251 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
254 str_numset(arg->arg_ptr.arg_str, 0.0);
255 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
261 if (regexec(spat->spat_regexp, s, strend, orig, 0,
262 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
264 dstr = Str_new(25,str_len(str));
265 str_nset(dstr,m,s-m);
266 if (spat->spat_regexp->subbase)
270 if (iters++ > maxiters)
271 fatal("Substitution loop");
272 if (spat->spat_regexp->subbase
273 && spat->spat_regexp->subbase != orig) {
276 orig = spat->spat_regexp->subbase;
278 strend = s + (strend - m);
280 m = spat->spat_regexp->startp[0];
281 str_ncat(dstr,s,m-s);
282 s = spat->spat_regexp->endp[0];
285 str_ncat(dstr,c,clen);
288 (void)eval(rspat->spat_repl,G_SCALAR,sp);
289 str_scat(dstr,stack->ary_array[sp+1]);
293 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
295 str_ncat(dstr,s,strend - s);
296 str_replace(str,dstr);
298 str_numset(arg->arg_ptr.arg_str, (double)iters);
299 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
302 str_numset(arg->arg_ptr.arg_str, 0.0);
303 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
307 ++spat->spat_short->str_u.str_useful;
308 str_numset(arg->arg_ptr.arg_str, 0.0);
309 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
313 #pragma intrinsic(memcmp)
314 #endif /* BUGGY_MSC */
323 register int matches = 0;
327 tbl = arg[2].arg_ptr.arg_cval;
329 send = s + str->str_cur;
331 fatal("panic: do_trans");
338 if (ch = tbl[*s & 0377]) {
353 register STR **st = stack->ary_array;
354 register int sp = arglast[1];
355 register int items = arglast[2] - sp;
356 register char *delim = str_get(st[sp]);
357 int delimlen = st[sp]->str_cur;
364 for (; items > 0; items--,st++) {
365 str_ncat(str,delim,delimlen);
376 register STR **st = stack->ary_array;
377 register int sp = arglast[1];
379 register char *pat = str_get(st[sp]);
380 register char *patend = pat + st[sp]->str_cur;
384 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
385 static char *space10 = " ";
387 /* These must not be in registers: */
393 unsigned long aulong;
398 items = arglast[2] - sp;
401 while (pat < patend) {
402 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
405 len = index("@Xxu",datumtype) ? 0 : items;
408 else if (isdigit(*pat)) {
410 while (isdigit(*pat))
411 len = (len * 10) + (*pat++ - '0');
419 fatal("% may only be used in unpack");
431 if (str->str_cur < 0)
432 fatal("X outside of string");
433 str->str_ptr[str->str_cur] = '\0';
438 str_ncat(str,null10,10);
441 str_ncat(str,null10,len);
446 aptr = str_get(fromstr);
448 len = fromstr->str_cur;
449 if (fromstr->str_cur > len)
450 str_ncat(str,aptr,len);
452 str_ncat(str,aptr,fromstr->str_cur);
453 len -= fromstr->str_cur;
454 if (datumtype == 'A') {
456 str_ncat(str,space10,10);
459 str_ncat(str,space10,len);
463 str_ncat(str,null10,10);
466 str_ncat(str,null10,len);
474 aint = (int)str_gnum(fromstr);
476 str_ncat(str,&achar,sizeof(char));
479 /* Float and double added by gnb@melba.bby.oz.au 22/11/89 */
484 afloat = (float)str_gnum(fromstr);
485 str_ncat(str, (char *)&afloat, sizeof (float));
492 adouble = (double)str_gnum(fromstr);
493 str_ncat(str, (char *)&adouble, sizeof (double));
499 ashort = (short)str_gnum(fromstr);
501 ashort = htons(ashort);
503 str_ncat(str,(char*)&ashort,sizeof(short));
510 ashort = (short)str_gnum(fromstr);
511 str_ncat(str,(char*)&ashort,sizeof(short));
517 auint = U_I(str_gnum(fromstr));
518 str_ncat(str,(char*)&auint,sizeof(unsigned int));
524 aint = (int)str_gnum(fromstr);
525 str_ncat(str,(char*)&aint,sizeof(int));
531 along = (long)str_gnum(fromstr);
533 along = htonl(along);
535 str_ncat(str,(char*)&along,sizeof(long));
541 aulong = U_L(str_gnum(fromstr));
542 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
548 along = (long)str_gnum(fromstr);
549 str_ncat(str,(char*)&along,sizeof(long));
555 aptr = str_get(fromstr);
556 str_ncat(str,(char*)&aptr,sizeof(char*));
561 aptr = str_get(fromstr);
562 aint = fromstr->str_cur;
563 STR_GROW(str,aint * 4 / 3);
575 doencodes(str, aptr, todo);
586 doencodes(str, s, len)
594 str_ncat(str, hunk, 1);
597 hunk[0] = ' ' + (077 & (*s >> 2));
598 hunk[1] = ' ' + (077 & ((*s << 4) & 060 | (s[1] >> 4) & 017));
599 hunk[2] = ' ' + (077 & ((s[1] << 2) & 074 | (s[2] >> 6) & 03));
600 hunk[3] = ' ' + (077 & (s[2] & 077));
601 str_ncat(str, hunk, 4);
605 str_ncat(str, "\n", 1);
609 do_sprintf(str,len,sarg)
618 static STR *sargnull = &str_no;
626 len--; /* don't count pattern string */
627 origs = s = str_get(*sarg);
628 send = s + (*sarg)->str_cur;
630 for ( ; s < send; len--) {
631 if (len <= 0 || !*sarg) {
636 for (t = s; t < send && *t != '%'; t++) ;
638 break; /* not enough % patterns, oh well */
639 for (t++; *sarg && t < send && t != s; t++) {
644 (void)sprintf(buf,s);
649 case '0': case '1': case '2': case '3': case '4':
650 case '5': case '6': case '7': case '8': case '9':
651 case '.': case '#': case '-': case '+':
659 xlen = (int)str_gnum(*(sarg++));
660 if (strEQ(t-2,"%c")) { /* some printfs fail on null chars */
662 str_ncat(str,s,t - s - 2);
663 str_ncat(str,buf,1); /* so handle simple case */
667 (void)sprintf(buf,s,xlen);
678 (void)sprintf(buf,s,(long)str_gnum(*(sarg++)));
680 (void)sprintf(buf,s,(int)str_gnum(*(sarg++)));
687 case 'x': case 'o': case 'u':
690 value = str_gnum(*(sarg++));
692 (void)sprintf(buf,s,U_L(value));
694 (void)sprintf(buf,s,U_I(value));
698 case 'E': case 'e': case 'f': case 'G': case 'g':
701 (void)sprintf(buf,s,str_gnum(*(sarg++)));
709 xlen = (*sarg)->str_cur;
710 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B'
711 && xlen == sizeof(STBP) && strlen(xs) < xlen) {
712 xs = stab_name(((STAB*)(*sarg))); /* a stab value! */
713 sprintf(tokenbuf,"*%s",xs); /* reformat to non-binary */
715 xlen = strlen(tokenbuf);
717 if (strEQ(t-2,"%s")) { /* some printfs fail on >128 chars */
719 str_ncat(str,s,t - s - 2);
721 str_ncat(str,xs,xlen); /* so handle simple case */
724 if (origs == xs) { /* sprintf($s,...$s...) */
725 strcpy(tokenbuf+64,s);
729 (void)sprintf(buf,s,xs);
737 if (s < t && t >= send) {
745 (void)sprintf(buf,s,0,0,0,0);
756 register STR **st = stack->ary_array;
757 register int sp = arglast[1];
758 register int items = arglast[2] - sp;
759 register STR *str = &str_undef;
761 for (st += ++sp; items > 0; items--,st++) {
765 (void)apush(ary,str);
771 do_unshift(ary,arglast)
775 register STR **st = stack->ary_array;
776 register int sp = arglast[1];
777 register int items = arglast[2] - sp;
783 for (st += ++sp; i < items; i++,st++) {
786 (void)astore(ary,i,str);
791 do_subr(arg,gimme,arglast)
796 register STR **st = stack->ary_array;
797 register int sp = arglast[1];
798 register int items = arglast[2] - sp;
802 char *oldfile = filename;
803 int oldsave = savestack->ary_fill;
804 int oldtmps_base = tmps_base;
806 if ((arg[1].arg_type & A_MASK) == A_WORD)
807 stab = arg[1].arg_ptr.arg_stab;
809 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
812 stab = stabent(str_get(tmpstr),TRUE);
817 fatal("Undefined subroutine called");
820 sub = stab_sub(stab);
822 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
824 st[sp] = arg->arg_ptr.arg_str;
825 if ((arg[2].arg_type & A_MASK) == A_NULL)
827 return sub->usersub(sub->userindex,sp,items);
829 if ((arg[2].arg_type & A_MASK) != A_NULL) {
830 savearray = stab_xarray(defstab);
831 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
833 savelong(&sub->depth);
835 if (sub->depth >= 2) { /* save temporaries on recursion? */
836 if (sub->depth == 100 && dowarn)
837 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
838 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
840 filename = sub->filename;
841 tmps_base = tmps_max;
842 sp = cmd_exec(sub->cmd,gimme,--sp); /* so do it already */
843 st = stack->ary_array;
845 if ((arg[2].arg_type & A_MASK) != A_NULL) {
846 afree(stab_xarray(defstab)); /* put back old $_[] */
847 stab_xarray(defstab) = savearray;
850 tmps_base = oldtmps_base;
851 if (savestack->ary_fill > oldsave) {
852 for (items = arglast[0] + 1; items <= sp; items++)
853 st[items] = str_static(st[items]);
854 /* in case restore wipes old str */
855 restorelist(oldsave);
861 do_dbsubr(arg,gimme,arglast)
866 register STR **st = stack->ary_array;
867 register int sp = arglast[1];
868 register int items = arglast[2] - sp;
873 char *oldfile = filename;
874 int oldsave = savestack->ary_fill;
875 int oldtmps_base = tmps_base;
877 if ((arg[1].arg_type & A_MASK) == A_WORD)
878 stab = arg[1].arg_ptr.arg_stab;
880 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
883 stab = stabent(str_get(tmpstr),TRUE);
888 fatal("Undefined subroutine called");
891 /* begin differences */
892 str = stab_val(DBsub);
894 str_set(str,stab_name(stab));
895 sub = stab_sub(DBsub);
897 fatal("No DBsub routine");
898 /* end differences */
899 if ((arg[2].arg_type & A_MASK) != A_NULL) {
900 savearray = stab_xarray(defstab);
901 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
903 savelong(&sub->depth);
905 if (sub->depth >= 2) { /* save temporaries on recursion? */
906 if (sub->depth == 100 && dowarn)
907 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
908 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
910 filename = sub->filename;
911 tmps_base = tmps_max;
912 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
913 st = stack->ary_array;
915 if ((arg[2].arg_type & A_MASK) != A_NULL) {
916 afree(stab_xarray(defstab)); /* put back old $_[] */
917 stab_xarray(defstab) = savearray;
920 tmps_base = oldtmps_base;
921 if (savestack->ary_fill > oldsave) {
922 for (items = arglast[0] + 1; items <= sp; items++)
923 st[items] = str_static(st[items]);
924 /* in case restore wipes old str */
925 restorelist(oldsave);
931 do_assign(arg,gimme,arglast)
937 register STR **st = stack->ary_array;
938 STR **firstrelem = st + arglast[1] + 1;
939 STR **firstlelem = st + arglast[0] + 1;
940 STR **lastrelem = st + arglast[2];
941 STR **lastlelem = st + arglast[1];
942 register STR **relem;
943 register STR **lelem;
947 register int makelocal;
951 makelocal = (arg->arg_flags & AF_LOCAL);
952 localizing = makelocal;
953 delaymagic = DM_DELAY; /* catch simultaneous items */
955 /* If there's a common identifier on both sides we have to take
956 * special care that assigning the identifier on the left doesn't
957 * clobber a value on the right that's used later in the list.
959 if (arg->arg_flags & AF_COMMON) {
960 for (relem = firstrelem; relem <= lastrelem; relem++) {
962 *relem = str_static(str);
969 while (lelem <= lastlelem) {
971 if (str->str_state >= SS_HASH) {
972 if (str->str_state == SS_ARY) {
974 ary = saveary(str->str_u.str_stab);
976 ary = stab_array(str->str_u.str_stab);
980 while (relem <= lastrelem) { /* gobble up all the rest */
983 str_sset(str,*relem);
985 (void)astore(ary,i++,str);
988 else if (str->str_state == SS_HASH) {
993 hash = savehash(str->str_u.str_stab);
995 hash = stab_hash(str->str_u.str_stab);
998 while (relem < lastrelem) { /* gobble up all the rest */
1002 str = &str_no, relem++;
1003 tmps = str_get(str);
1004 tmpstr = Str_new(29,0);
1006 str_sset(tmpstr,*relem); /* value */
1007 *(relem++) = tmpstr;
1008 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
1012 fatal("panic: do_assign");
1017 if (relem <= lastrelem) {
1018 str_sset(str, *relem);
1022 str_nset(str, "", 0);
1023 if (gimme == G_ARRAY) {
1024 i = ++lastrelem - firstrelem;
1025 relem++; /* tacky, I suppose */
1026 astore(stack,i,str);
1027 if (st != stack->ary_array) {
1028 st = stack->ary_array;
1029 firstrelem = st + arglast[1] + 1;
1030 firstlelem = st + arglast[0] + 1;
1031 lastlelem = st + arglast[1];
1033 relem = lastrelem + 1;
1040 if (delaymagic > 1) {
1041 if (delaymagic & DM_REUID) {
1045 if (uid != euid || setuid(uid) < 0)
1046 fatal("No setreuid available");
1049 if (delaymagic & DM_REGID) {
1053 if (gid != egid || setgid(gid) < 0)
1054 fatal("No setregid available");
1060 if (gimme == G_ARRAY) {
1061 i = lastrelem - firstrelem + 1;
1063 Copy(firstrelem, firstlelem, i, STR*);
1064 return arglast[0] + i;
1067 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
1068 *firstlelem = arg->arg_ptr.arg_str;
1069 return arglast[0] + 1;
1074 do_study(str,arg,gimme,arglast)
1080 register unsigned char *s;
1081 register int pos = str->str_cur;
1083 register int *sfirst;
1084 register int *snext;
1085 static int maxscream = -1;
1086 static STR *lastscream = Nullstr;
1088 int retarg = arglast[0] + 1;
1091 s = (unsigned char*)(str_get(str));
1093 s = Null(unsigned char*);
1096 lastscream->str_pok &= ~SP_STUDIED;
1102 if (pos > maxscream) {
1103 if (maxscream < 0) {
1104 maxscream = pos + 80;
1105 New(301,screamfirst, 256, int);
1106 New(302,screamnext, maxscream, int);
1109 maxscream = pos + pos / 4;
1110 Renew(screamnext, maxscream, int);
1114 sfirst = screamfirst;
1117 if (!sfirst || !snext)
1118 fatal("do_study: out of memory");
1120 for (ch = 256; ch; --ch)
1124 while (--pos >= 0) {
1126 if (sfirst[ch] >= 0)
1127 snext[pos] = sfirst[ch] - pos;
1132 /* If there were any case insensitive searches, we must assume they
1133 * all are. This speeds up insensitive searches much more than
1134 * it slows down sensitive ones.
1137 sfirst[fold[ch]] = pos;
1140 str->str_pok |= SP_STUDIED;
1143 str_numset(arg->arg_ptr.arg_str,(double)retval);
1144 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1149 do_defined(str,arg,gimme,arglast)
1156 register int retarg = arglast[0] + 1;
1159 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1160 fatal("Illegal argument to defined()");
1161 arg = arg[1].arg_ptr.arg_arg;
1162 type = arg->arg_type;
1164 if (type == O_ARRAY || type == O_LARRAY)
1165 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
1166 else if (type == O_HASH || type == O_LHASH)
1167 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
1168 else if (type == O_ASLICE || type == O_LASLICE)
1169 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
1170 else if (type == O_HSLICE || type == O_LHSLICE)
1171 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
1172 else if (type == O_SUBR || type == O_DBSUBR)
1173 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1176 str_numset(str,(double)retval);
1177 stack->ary_array[retarg] = str;
1182 do_undef(str,arg,gimme,arglast)
1189 register STAB *stab;
1190 int retarg = arglast[0] + 1;
1192 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1193 fatal("Illegal argument to undef()");
1194 arg = arg[1].arg_ptr.arg_arg;
1195 type = arg->arg_type;
1197 if (type == O_ARRAY || type == O_LARRAY) {
1198 stab = arg[1].arg_ptr.arg_stab;
1199 afree(stab_xarray(stab));
1200 stab_xarray(stab) = Null(ARRAY*);
1202 else if (type == O_HASH || type == O_LHASH) {
1203 stab = arg[1].arg_ptr.arg_stab;
1204 (void)hfree(stab_xhash(stab));
1205 stab_xhash(stab) = Null(HASH*);
1207 else if (type == O_SUBR || type == O_DBSUBR) {
1208 stab = arg[1].arg_ptr.arg_stab;
1209 cmd_free(stab_sub(stab)->cmd);
1210 afree(stab_sub(stab)->tosave);
1211 Safefree(stab_sub(stab));
1212 stab_sub(stab) = Null(SUBR*);
1215 fatal("Can't undefine that kind of object");
1216 str_numset(str,0.0);
1217 stack->ary_array[retarg] = str;
1222 do_vec(lvalue,astr,arglast)
1227 STR **st = stack->ary_array;
1228 int sp = arglast[0];
1229 register STR *str = st[++sp];
1230 register int offset = (int)str_gnum(st[++sp]);
1231 register int size = (int)str_gnum(st[++sp]);
1232 unsigned char *s = (unsigned char*)str_get(str);
1233 unsigned long retnum;
1237 offset *= size; /* turn into bit offset */
1238 len = (offset + size + 7) / 8;
1239 if (offset < 0 || size < 1)
1241 else if (!lvalue && len > str->str_cur)
1244 if (len > str->str_cur) {
1246 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1249 s = (unsigned char*)str_get(str);
1251 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1256 else if (size == 16)
1257 retnum = (s[offset] << 8) + s[offset+1];
1258 else if (size == 32)
1259 retnum = (s[offset] << 24) + (s[offset + 1] << 16) +
1260 (s[offset + 2] << 8) + s[offset+3];
1263 if (lvalue) { /* it's an lvalue! */
1264 struct lstring *lstr = (struct lstring*)astr;
1266 astr->str_magic = str;
1267 st[sp]->str_rare = 'v';
1268 lstr->lstr_offset = offset;
1269 lstr->lstr_len = size;
1273 str_numset(astr,(double)retnum);
1283 struct lstring *lstr = (struct lstring*)str;
1284 register int offset;
1286 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1287 register unsigned long lval = U_L(str_gnum(str));
1291 str->str_magic = Nullstr;
1292 offset = lstr->lstr_offset;
1293 size = lstr->lstr_len;
1295 mask = (1 << size) - 1;
1299 s[offset] &= ~(mask << size);
1300 s[offset] |= lval << size;
1304 s[offset] = lval & 255;
1305 else if (size == 16) {
1306 s[offset] = (lval >> 8) & 255;
1307 s[offset+1] = lval & 255;
1309 else if (size == 32) {
1310 s[offset] = (lval >> 24) & 255;
1311 s[offset+1] = (lval >> 16) & 255;
1312 s[offset+2] = (lval >> 8) & 255;
1313 s[offset+3] = lval & 255;
1322 register char *tmps;
1330 if (str->str_state == SS_ARY) {
1331 ary = stab_array(str->str_u.str_stab);
1332 for (i = 0; i <= ary->ary_fill; i++)
1333 do_chop(astr,ary->ary_array[i]);
1336 if (str->str_state == SS_HASH) {
1337 hash = stab_hash(str->str_u.str_stab);
1338 (void)hiterinit(hash);
1339 while (entry = hiternext(hash))
1340 do_chop(astr,hiterval(hash,entry));
1343 tmps = str_get(str);
1346 tmps += str->str_cur - (str->str_cur != 0);
1347 str_nset(astr,tmps,1); /* remember last char */
1348 *tmps = '\0'; /* wipe it out */
1349 str->str_cur = tmps - str->str_ptr;
1353 do_vop(optype,str,left,right)
1358 register char *s = str_get(str);
1359 register char *l = str_get(left);
1360 register char *r = str_get(right);
1363 len = left->str_cur;
1364 if (len > right->str_cur)
1365 len = right->str_cur;
1366 if (str->str_cur > len)
1368 else if (str->str_cur < len) {
1370 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1388 if (right->str_cur > len)
1389 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1390 else if (left->str_cur > len)
1391 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1400 register STR **st = stack->ary_array;
1401 register int sp = arglast[1];
1402 register int items = arglast[2] - sp;
1409 for (st += ++sp; items--; st++)
1410 tainted |= (*st)->str_tainted;
1411 st = stack->ary_array;
1413 items = arglast[2] - sp;
1416 taintproper("Insecure dependency in syscall");
1418 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1419 * or where sizeof(long) != sizeof(char*). But such machines will
1420 * not likely have syscall implemented either, so who cares?
1423 if (st[++sp]->str_nok || !i)
1424 arg[i++] = (long)str_gnum(st[sp]);
1427 arg[i++] = (long)st[sp]->str_ptr;
1431 items = arglast[2] - sp;
1434 fatal("Too few args to syscall");
1436 retval = syscall(arg[0]);
1439 retval = syscall(arg[0],arg[1]);
1442 retval = syscall(arg[0],arg[1],arg[2]);
1445 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1448 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1451 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1454 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1457 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1463 fatal("syscall() unimplemented");