1 /* $Header: doarg.c,v 3.0 89/10/18 15:10:41 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 89/10/18 15:10:41 lwall
19 extern unsigned char fold[];
32 register char *s = str_get(str);
33 char *strend = s + str->str_cur;
44 rspat = spat = arg[2].arg_ptr.arg_spat;
46 fatal("panic: do_subst");
47 else if (spat->spat_runtime) {
49 (void)eval(spat->spat_runtime,G_SCALAR,sp);
50 m = str_get(dstr = stack->ary_array[sp+1]);
52 if (spat->spat_regexp)
53 regfree(spat->spat_regexp);
54 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
55 spat->spat_flags & SPAT_FOLD,1);
56 if (spat->spat_flags & SPAT_KEEP) {
57 arg_free(spat->spat_runtime); /* it won't change, so */
58 spat->spat_runtime = Nullarg; /* no point compiling again */
63 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
66 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
68 if (!*spat->spat_regexp->precomp && lastspat)
72 if (hint < s || hint > strend)
73 fatal("panic: hint in do_match");
76 if (spat->spat_regexp->regback >= 0) {
77 s -= spat->spat_regexp->regback;
84 else if (spat->spat_short) {
85 if (spat->spat_flags & SPAT_SCANFIRST) {
86 if (str->str_pok & SP_STUDIED) {
87 if (screamfirst[spat->spat_short->str_rare] < 0)
89 else if (!(s = screaminstr(str,spat->spat_short)))
93 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
97 if (s && spat->spat_regexp->regback >= 0) {
98 ++spat->spat_short->str_u.str_useful;
99 s -= spat->spat_regexp->regback;
106 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
107 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
109 if (--spat->spat_short->str_u.str_useful < 0) {
110 str_free(spat->spat_short);
111 spat->spat_short = Nullstr; /* opt is being useless */
114 once = ((rspat->spat_flags & SPAT_ONCE) != 0);
115 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
116 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
117 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
118 else { /* constant over loop, anyway */
119 (void)eval(rspat->spat_repl,G_SCALAR,sp);
120 dstr = stack->ary_array[sp+1];
123 clen = dstr->str_cur;
124 if (clen <= spat->spat_slen + spat->spat_regexp->regback) {
125 /* can do inplace substitution */
126 if (regexec(spat->spat_regexp, s, strend, orig, 1,
127 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
128 if (spat->spat_regexp->subbase) /* oops, no we can't */
132 str->str_pok = SP_VALID; /* disable possible screamer */
134 m = spat->spat_regexp->startp[0];
135 d = spat->spat_regexp->endp[0];
137 if (m - s > strend - d) { /* faster to shorten from end */
139 (void)bcopy(c, m, clen);
144 (void)bcopy(d, m, i);
148 str->str_cur = m - s;
150 str_numset(arg->arg_ptr.arg_str, 1.0);
151 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
154 else if (i = m - s) { /* faster from front */
162 (void)bcopy(c, m, clen);
164 str_numset(arg->arg_ptr.arg_str, 1.0);
165 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
171 (void)bcopy(c,d,clen);
173 str_numset(arg->arg_ptr.arg_str, 1.0);
174 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
180 str_numset(arg->arg_ptr.arg_str, 1.0);
181 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
188 fatal("Substitution loop");
189 m = spat->spat_regexp->startp[0];
196 (void)bcopy(c,d,clen);
199 s = spat->spat_regexp->endp[0];
200 } while (regexec(spat->spat_regexp, s, strend, orig, 1, Nullstr,
204 str->str_cur = d - str->str_ptr + i;
205 (void)bcopy(s,d,i+1); /* include the Null */
208 str_numset(arg->arg_ptr.arg_str, (double)iters);
209 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
212 str_numset(arg->arg_ptr.arg_str, 0.0);
213 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
219 if (regexec(spat->spat_regexp, s, strend, orig, 1,
220 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
222 dstr = Str_new(25,str_len(str));
223 str_nset(dstr,m,s-m);
224 if (spat->spat_regexp->subbase)
229 fatal("Substitution loop");
230 if (spat->spat_regexp->subbase
231 && spat->spat_regexp->subbase != orig) {
234 orig = spat->spat_regexp->subbase;
236 strend = s + (strend - m);
238 m = spat->spat_regexp->startp[0];
239 str_ncat(dstr,s,m-s);
240 s = spat->spat_regexp->endp[0];
243 str_ncat(dstr,c,clen);
246 (void)eval(rspat->spat_repl,G_SCALAR,sp);
247 str_scat(dstr,stack->ary_array[sp+1]);
251 } while (regexec(spat->spat_regexp, s, strend, orig, 1, Nullstr,
253 str_ncat(dstr,s,strend - s);
254 str_replace(str,dstr);
256 str_numset(arg->arg_ptr.arg_str, (double)iters);
257 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
260 str_numset(arg->arg_ptr.arg_str, 0.0);
261 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
265 ++spat->spat_short->str_u.str_useful;
266 str_numset(arg->arg_ptr.arg_str, 0.0);
267 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
278 register int matches = 0;
282 tbl = arg[2].arg_ptr.arg_cval;
284 send = s + str->str_cur;
286 fatal("panic: do_trans");
293 if (ch = tbl[*s & 0377]) {
308 register STR **st = stack->ary_array;
309 register int sp = arglast[1];
310 register int items = arglast[2] - sp;
311 register char *delim = str_get(st[sp]);
312 int delimlen = st[sp]->str_cur;
319 for (; items > 0; items--,st++) {
320 str_ncat(str,delim,delimlen);
331 register STR **st = stack->ary_array;
332 register int sp = arglast[1];
334 register char *pat = str_get(st[sp]);
335 register char *patend = pat + st[sp]->str_cur;
339 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
340 static char *space10 = " ";
342 /* These must not be in registers: */
349 items = arglast[2] - sp;
352 while (pat < patend) {
353 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
357 while (isdigit(*pat))
367 str_ncat(str,null10,10);
370 str_ncat(str,null10,len);
375 aptr = str_get(fromstr);
376 if (fromstr->str_cur > len)
377 str_ncat(str,aptr,len);
379 str_ncat(str,aptr,fromstr->str_cur);
380 len -= fromstr->str_cur;
381 if (datumtype == 'A') {
383 str_ncat(str,space10,10);
386 str_ncat(str,space10,len);
390 str_ncat(str,null10,10);
393 str_ncat(str,null10,len);
400 aint = (int)str_gnum(fromstr);
402 str_ncat(str,&achar,sizeof(char));
408 ashort = (short)str_gnum(fromstr);
410 ashort = htons(ashort);
412 str_ncat(str,(char*)&ashort,sizeof(short));
419 ashort = (short)str_gnum(fromstr);
420 str_ncat(str,(char*)&ashort,sizeof(short));
427 aint = (int)str_gnum(fromstr);
428 str_ncat(str,(char*)&aint,sizeof(int));
434 along = (long)str_gnum(fromstr);
436 along = htonl(along);
438 str_ncat(str,(char*)&along,sizeof(long));
445 along = (long)str_gnum(fromstr);
446 str_ncat(str,(char*)&along,sizeof(long));
452 aptr = str_get(fromstr);
453 str_ncat(str,(char*)&aptr,sizeof(char*));
463 do_sprintf(str,len,sarg)
472 static STR *sargnull = &str_no;
478 len--; /* don't count pattern string */
480 send = s + (*sarg)->str_cur;
482 for ( ; s < send; len--) {
483 if (len <= 0 || !*sarg) {
488 for (t = s; t < send && *t != '%'; t++) ;
490 break; /* not enough % patterns, oh well */
491 for (t++; *sarg && t < send && t != s; t++) {
496 (void)sprintf(buf,s);
501 case '0': case '1': case '2': case '3': case '4':
502 case '5': case '6': case '7': case '8': case '9':
503 case '.': case '#': case '-': case '+':
508 case 'D': case 'X': case 'O':
512 *buf = (int)str_gnum(*(sarg++));
513 str_ncat(str,buf,1); /* force even if null */
517 case 'd': case 'x': case 'o': case 'u':
521 (void)sprintf(buf,s,(long)str_gnum(*(sarg++)));
523 (void)sprintf(buf,s,(int)str_gnum(*(sarg++)));
527 case 'E': case 'e': case 'f': case 'G': case 'g':
530 (void)sprintf(buf,s,str_gnum(*(sarg++)));
538 xlen = (*sarg)->str_cur;
539 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'a' && xs[3] == 'b'
540 && xlen == sizeof(STBP) && strlen(xs) < xlen) {
541 xs = stab_name(((STAB*)(*sarg))); /* a stab value! */
542 sprintf(tokenbuf,"*%s",xs); /* reformat to non-binary */
544 xlen = strlen(tokenbuf);
546 if (strEQ(t-2,"%s")) { /* some printfs fail on >128 chars */
548 str_ncat(str,s,t - s - 2);
549 str_ncat(str,xs,xlen); /* so handle simple case */
552 (void)sprintf(buf,s,xs);
559 if (s < t && t >= send) {
567 (void)sprintf(buf,s,0,0,0,0);
578 register STR **st = stack->ary_array;
579 register int sp = arglast[1];
580 register int items = arglast[2] - sp;
581 register STR *str = &str_undef;
583 for (st += ++sp; items > 0; items--,st++) {
587 (void)apush(ary,str);
593 do_unshift(ary,arglast)
597 register STR **st = stack->ary_array;
598 register int sp = arglast[1];
599 register int items = arglast[2] - sp;
605 for (st += ++sp; i < items; i++,st++) {
608 (void)astore(ary,i,str);
613 do_subr(arg,gimme,arglast)
618 register STR **st = stack->ary_array;
619 register int sp = arglast[1];
620 register int items = arglast[2] - sp;
624 char *oldfile = filename;
625 int oldsave = savestack->ary_fill;
626 int oldtmps_base = tmps_base;
628 if ((arg[1].arg_type & A_MASK) == A_WORD)
629 stab = arg[1].arg_ptr.arg_stab;
631 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
634 stab = stabent(str_get(tmpstr),TRUE);
639 fatal("Undefined subroutine called");
640 sub = stab_sub(stab);
642 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
643 if ((arg[2].arg_type & A_MASK) != A_NULL) {
644 savearray = stab_xarray(defstab);
645 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
647 savelong(&sub->depth);
651 if (sub->depth >= 2) { /* save temporaries on recursion? */
652 if (sub->depth == 100 && dowarn)
653 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
654 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
656 filename = sub->filename;
657 tmps_base = tmps_max;
658 sp = cmd_exec(sub->cmd,gimme,--sp); /* so do it already */
659 st = stack->ary_array;
661 if ((arg[2].arg_type & A_MASK) != A_NULL) {
662 afree(stab_xarray(defstab)); /* put back old $_[] */
663 stab_xarray(defstab) = savearray;
666 tmps_base = oldtmps_base;
667 if (savestack->ary_fill > oldsave) {
668 for (items = arglast[0] + 1; items <= sp; items++)
669 st[items] = str_static(st[items]);
670 /* in case restore wipes old str */
671 restorelist(oldsave);
677 do_dbsubr(arg,gimme,arglast)
682 register STR **st = stack->ary_array;
683 register int sp = arglast[1];
684 register int items = arglast[2] - sp;
689 char *oldfile = filename;
690 int oldsave = savestack->ary_fill;
691 int oldtmps_base = tmps_base;
693 if ((arg[1].arg_type & A_MASK) == A_WORD)
694 stab = arg[1].arg_ptr.arg_stab;
696 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
699 stab = stabent(str_get(tmpstr),TRUE);
704 fatal("Undefined subroutine called");
705 sub = stab_sub(stab);
707 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
708 /* begin differences */
709 str = stab_val(DBsub);
711 str_set(str,stab_name(stab));
712 sub = stab_sub(DBsub);
714 fatal("No DBsub routine");
715 /* end differences */
716 if ((arg[2].arg_type & A_MASK) != A_NULL) {
717 savearray = stab_xarray(defstab);
718 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
720 savelong(&sub->depth);
724 if (sub->depth >= 2) { /* save temporaries on recursion? */
725 if (sub->depth == 100 && dowarn)
726 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
727 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
729 filename = sub->filename;
730 tmps_base = tmps_max;
731 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
732 st = stack->ary_array;
734 if ((arg[2].arg_type & A_MASK) != A_NULL) {
735 afree(stab_xarray(defstab)); /* put back old $_[] */
736 stab_xarray(defstab) = savearray;
739 tmps_base = oldtmps_base;
740 if (savestack->ary_fill > oldsave) {
741 for (items = arglast[0] + 1; items <= sp; items++)
742 st[items] = str_static(st[items]);
743 /* in case restore wipes old str */
744 restorelist(oldsave);
750 do_assign(arg,gimme,arglast)
756 register STR **st = stack->ary_array;
757 STR **firstrelem = st + arglast[1] + 1;
758 STR **firstlelem = st + arglast[0] + 1;
759 STR **lastrelem = st + arglast[2];
760 STR **lastlelem = st + arglast[1];
761 register STR **relem;
762 register STR **lelem;
766 register int makelocal;
770 makelocal = (arg->arg_flags & AF_LOCAL);
771 delaymagic = DM_DELAY; /* catch simultaneous items */
773 /* If there's a common identifier on both sides we have to take
774 * special care that assigning the identifier on the left doesn't
775 * clobber a value on the right that's used later in the list.
777 if (arg->arg_flags & AF_COMMON) {
778 for (relem = firstrelem; relem <= lastrelem; relem++) {
780 *relem = str_static(str);
787 while (lelem <= lastlelem) {
789 if (str->str_state >= SS_HASH) {
790 if (str->str_state == SS_ARY) {
792 ary = saveary(str->str_u.str_stab);
794 ary = stab_array(str->str_u.str_stab);
798 while (relem <= lastrelem) { /* gobble up all the rest */
801 str_sset(str,*(relem++));
804 (void)astore(ary,i++,str);
807 else if (str->str_state == SS_HASH) {
812 hash = savehash(str->str_u.str_stab);
814 hash = stab_hash(str->str_u.str_stab);
817 while (relem < lastrelem) { /* gobble up all the rest */
821 str = &str_no, relem++;
823 tmpstr = Str_new(29,0);
825 str_sset(tmpstr,*(relem++)); /* value */
828 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
832 fatal("panic: do_assign");
837 if (relem <= lastrelem)
838 str_sset(str, *(relem++));
840 str_nset(str, "", 0);
844 if (delaymagic > 1) {
846 if (delaymagic & DM_REUID)
850 if (delaymagic & DM_REGID)
855 if (gimme == G_ARRAY) {
856 i = lastrelem - firstrelem + 1;
858 Copy(firstrelem, firstlelem, i, STR*);
859 return arglast[0] + i;
862 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
863 *firstlelem = arg->arg_ptr.arg_str;
864 return arglast[0] + 1;
869 do_study(str,arg,gimme,arglast)
875 register unsigned char *s;
876 register int pos = str->str_cur;
878 register int *sfirst;
880 static int maxscream = -1;
881 static STR *lastscream = Nullstr;
883 int retarg = arglast[0] + 1;
886 s = (unsigned char*)(str_get(str));
888 s = Null(unsigned char*);
891 lastscream->str_pok &= ~SP_STUDIED;
897 if (pos > maxscream) {
899 maxscream = pos + 80;
900 New(301,screamfirst, 256, int);
901 New(302,screamnext, maxscream, int);
904 maxscream = pos + pos / 4;
905 Renew(screamnext, maxscream, int);
909 sfirst = screamfirst;
912 if (!sfirst || !snext)
913 fatal("do_study: out of memory");
915 for (ch = 256; ch; --ch)
922 snext[pos] = sfirst[ch] - pos;
927 /* If there were any case insensitive searches, we must assume they
928 * all are. This speeds up insensitive searches much more than
929 * it slows down sensitive ones.
932 sfirst[fold[ch]] = pos;
935 str->str_pok |= SP_STUDIED;
938 str_numset(arg->arg_ptr.arg_str,(double)retval);
939 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
944 do_defined(str,arg,gimme,arglast)
951 register int retarg = arglast[0] + 1;
954 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
955 fatal("Illegal argument to defined()");
956 arg = arg[1].arg_ptr.arg_arg;
957 type = arg->arg_type;
959 if (type == O_ARRAY || type == O_LARRAY)
960 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
961 else if (type == O_HASH || type == O_LHASH)
962 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
963 else if (type == O_SUBR || type == O_DBSUBR)
964 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
965 else if (type == O_ASLICE || type == O_LASLICE)
966 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
967 else if (type == O_HSLICE || type == O_LHSLICE)
968 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
971 str_numset(str,(double)retval);
972 stack->ary_array[retarg] = str;
977 do_undef(str,arg,gimme,arglast)
985 int retarg = arglast[0] + 1;
987 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
988 fatal("Illegal argument to undef()");
989 arg = arg[1].arg_ptr.arg_arg;
990 type = arg->arg_type;
992 if (type == O_ARRAY || type == O_LARRAY) {
993 stab = arg[1].arg_ptr.arg_stab;
994 afree(stab_xarray(stab));
995 stab_xarray(stab) = Null(ARRAY*);
997 else if (type == O_HASH || type == O_LHASH) {
998 stab = arg[1].arg_ptr.arg_stab;
999 (void)hfree(stab_xhash(stab));
1000 stab_xhash(stab) = Null(HASH*);
1002 else if (type == O_SUBR || type == O_DBSUBR) {
1003 stab = arg[1].arg_ptr.arg_stab;
1004 cmd_free(stab_sub(stab)->cmd);
1005 afree(stab_sub(stab)->tosave);
1006 Safefree(stab_sub(stab));
1007 stab_sub(stab) = Null(SUBR*);
1010 fatal("Can't undefine that kind of object");
1011 str_numset(str,0.0);
1012 stack->ary_array[retarg] = str;
1017 do_vec(lvalue,astr,arglast)
1022 STR **st = stack->ary_array;
1023 int sp = arglast[0];
1024 register STR *str = st[++sp];
1025 register int offset = (int)str_gnum(st[++sp]);
1026 register int size = (int)str_gnum(st[++sp]);
1027 unsigned char *s = (unsigned char*)str_get(str);
1028 unsigned long retnum;
1032 offset *= size; /* turn into bit offset */
1033 len = (offset + size + 7) / 8;
1034 if (offset < 0 || size < 1)
1036 else if (!lvalue && len > str->str_cur)
1039 if (len > str->str_cur) {
1041 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1044 s = (unsigned char*)str_get(str);
1046 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1051 else if (size == 16)
1052 retnum = (s[offset] << 8) + s[offset+1];
1053 else if (size == 32)
1054 retnum = (s[offset] << 24) + (s[offset + 1] << 16) +
1055 (s[offset + 2] << 8) + s[offset+3];
1058 if (lvalue) { /* it's an lvalue! */
1059 struct lstring *lstr = (struct lstring*)astr;
1061 astr->str_magic = str;
1062 st[sp]->str_rare = 'v';
1063 lstr->lstr_offset = offset;
1064 lstr->lstr_len = size;
1068 str_numset(astr,(double)retnum);
1078 struct lstring *lstr = (struct lstring*)str;
1079 register int offset;
1081 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1082 register unsigned long lval = (unsigned long)str_gnum(str);
1086 str->str_magic = Nullstr;
1087 offset = lstr->lstr_offset;
1088 size = lstr->lstr_len;
1090 mask = (1 << size) - 1;
1094 s[offset] &= ~(mask << size);
1095 s[offset] |= lval << size;
1099 s[offset] = lval & 255;
1100 else if (size == 16) {
1101 s[offset] = (lval >> 8) & 255;
1102 s[offset+1] = lval & 255;
1104 else if (size == 32) {
1105 s[offset] = (lval >> 24) & 255;
1106 s[offset+1] = (lval >> 16) & 255;
1107 s[offset+2] = (lval >> 8) & 255;
1108 s[offset+3] = lval & 255;
1117 register char *tmps;
1125 if (str->str_state == SS_ARY) {
1126 ary = stab_array(str->str_u.str_stab);
1127 for (i = 0; i <= ary->ary_fill; i++)
1128 do_chop(astr,ary->ary_array[i]);
1131 if (str->str_state == SS_HASH) {
1132 hash = stab_hash(str->str_u.str_stab);
1133 (void)hiterinit(hash);
1134 while (entry = hiternext(hash))
1135 do_chop(astr,hiterval(hash,entry));
1138 tmps = str_get(str);
1141 tmps += str->str_cur - (str->str_cur != 0);
1142 str_nset(astr,tmps,1); /* remember last char */
1143 *tmps = '\0'; /* wipe it out */
1144 str->str_cur = tmps - str->str_ptr;
1148 do_vop(optype,str,left,right)
1153 register char *s = str_get(str);
1154 register char *l = str_get(left);
1155 register char *r = str_get(right);
1158 len = left->str_cur;
1159 if (len > right->str_cur)
1160 len = right->str_cur;
1161 if (str->str_cur > len)
1163 else if (str->str_cur < len) {
1165 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1183 if (right->str_cur > len)
1184 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1185 else if (left->str_cur > len)
1186 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1195 register STR **st = stack->ary_array;
1196 register int sp = arglast[1];
1197 register int items = arglast[2] - sp;
1204 for (st += ++sp; items--; st++)
1205 tainted |= (*st)->str_tainted;
1206 st = stack->ary_array;
1208 items = arglast[2] - sp;
1211 taintproper("Insecure dependency in syscall");
1213 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1214 * or where sizeof(long) != sizeof(char*). But such machines will
1215 * not likely have syscall implemented either, so who cares?
1218 if (st[++sp]->str_nok || !i)
1219 arg[i++] = (long)str_gnum(st[sp]);
1222 arg[i++] = (long)st[sp]->str_ptr;
1226 items = arglast[2] - sp;
1229 fatal("Too few args to syscall");
1231 retval = syscall(arg[0]);
1234 retval = syscall(arg[0],arg[1]);
1237 retval = syscall(arg[0],arg[1],arg[2]);
1240 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1243 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1246 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1249 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1252 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1256 st[sp] = str_static(&str_undef);
1257 str_numset(st[sp], (double)retval);
1260 fatal("syscall() unimplemented");