1 /* $Header: doarg.c,v 3.0.1.1 89/11/11 04:17:20 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.1 89/11/11 04:17:20 lwall
10 * patch2: printf %c, %D, %X and %O didn't work right
11 * patch2: printf of unsigned vs signed needed separate casts on some machines
13 * Revision 3.0 89/10/18 15:10:41 lwall
23 extern unsigned char fold[];
36 register char *s = str_get(str);
37 char *strend = s + str->str_cur;
48 rspat = spat = arg[2].arg_ptr.arg_spat;
50 fatal("panic: do_subst");
51 else if (spat->spat_runtime) {
53 (void)eval(spat->spat_runtime,G_SCALAR,sp);
54 m = str_get(dstr = stack->ary_array[sp+1]);
56 if (spat->spat_regexp)
57 regfree(spat->spat_regexp);
58 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
59 spat->spat_flags & SPAT_FOLD,1);
60 if (spat->spat_flags & SPAT_KEEP) {
61 arg_free(spat->spat_runtime); /* it won't change, so */
62 spat->spat_runtime = Nullarg; /* no point compiling again */
67 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
70 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
72 if (!*spat->spat_regexp->precomp && lastspat)
76 if (hint < s || hint > strend)
77 fatal("panic: hint in do_match");
80 if (spat->spat_regexp->regback >= 0) {
81 s -= spat->spat_regexp->regback;
88 else if (spat->spat_short) {
89 if (spat->spat_flags & SPAT_SCANFIRST) {
90 if (str->str_pok & SP_STUDIED) {
91 if (screamfirst[spat->spat_short->str_rare] < 0)
93 else if (!(s = screaminstr(str,spat->spat_short)))
97 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
101 if (s && spat->spat_regexp->regback >= 0) {
102 ++spat->spat_short->str_u.str_useful;
103 s -= spat->spat_regexp->regback;
110 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
111 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
113 if (--spat->spat_short->str_u.str_useful < 0) {
114 str_free(spat->spat_short);
115 spat->spat_short = Nullstr; /* opt is being useless */
118 once = ((rspat->spat_flags & SPAT_ONCE) != 0);
119 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
120 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
121 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
122 else { /* constant over loop, anyway */
123 (void)eval(rspat->spat_repl,G_SCALAR,sp);
124 dstr = stack->ary_array[sp+1];
127 clen = dstr->str_cur;
128 if (clen <= spat->spat_slen + spat->spat_regexp->regback) {
129 /* can do inplace substitution */
130 if (regexec(spat->spat_regexp, s, strend, orig, 1,
131 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
132 if (spat->spat_regexp->subbase) /* oops, no we can't */
136 str->str_pok = SP_VALID; /* disable possible screamer */
138 m = spat->spat_regexp->startp[0];
139 d = spat->spat_regexp->endp[0];
141 if (m - s > strend - d) { /* faster to shorten from end */
143 (void)bcopy(c, m, clen);
148 (void)bcopy(d, m, i);
152 str->str_cur = m - s;
154 str_numset(arg->arg_ptr.arg_str, 1.0);
155 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
158 else if (i = m - s) { /* faster from front */
166 (void)bcopy(c, m, clen);
168 str_numset(arg->arg_ptr.arg_str, 1.0);
169 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
175 (void)bcopy(c,d,clen);
177 str_numset(arg->arg_ptr.arg_str, 1.0);
178 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
184 str_numset(arg->arg_ptr.arg_str, 1.0);
185 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
192 fatal("Substitution loop");
193 m = spat->spat_regexp->startp[0];
200 (void)bcopy(c,d,clen);
203 s = spat->spat_regexp->endp[0];
204 } while (regexec(spat->spat_regexp, s, strend, orig, 1, Nullstr,
208 str->str_cur = d - str->str_ptr + i;
209 (void)bcopy(s,d,i+1); /* include the Null */
212 str_numset(arg->arg_ptr.arg_str, (double)iters);
213 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
216 str_numset(arg->arg_ptr.arg_str, 0.0);
217 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
223 if (regexec(spat->spat_regexp, s, strend, orig, 1,
224 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
226 dstr = Str_new(25,str_len(str));
227 str_nset(dstr,m,s-m);
228 if (spat->spat_regexp->subbase)
233 fatal("Substitution loop");
234 if (spat->spat_regexp->subbase
235 && spat->spat_regexp->subbase != orig) {
238 orig = spat->spat_regexp->subbase;
240 strend = s + (strend - m);
242 m = spat->spat_regexp->startp[0];
243 str_ncat(dstr,s,m-s);
244 s = spat->spat_regexp->endp[0];
247 str_ncat(dstr,c,clen);
250 (void)eval(rspat->spat_repl,G_SCALAR,sp);
251 str_scat(dstr,stack->ary_array[sp+1]);
255 } while (regexec(spat->spat_regexp, s, strend, orig, 1, Nullstr,
257 str_ncat(dstr,s,strend - s);
258 str_replace(str,dstr);
260 str_numset(arg->arg_ptr.arg_str, (double)iters);
261 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
264 str_numset(arg->arg_ptr.arg_str, 0.0);
265 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
269 ++spat->spat_short->str_u.str_useful;
270 str_numset(arg->arg_ptr.arg_str, 0.0);
271 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
282 register int matches = 0;
286 tbl = arg[2].arg_ptr.arg_cval;
288 send = s + str->str_cur;
290 fatal("panic: do_trans");
297 if (ch = tbl[*s & 0377]) {
312 register STR **st = stack->ary_array;
313 register int sp = arglast[1];
314 register int items = arglast[2] - sp;
315 register char *delim = str_get(st[sp]);
316 int delimlen = st[sp]->str_cur;
323 for (; items > 0; items--,st++) {
324 str_ncat(str,delim,delimlen);
335 register STR **st = stack->ary_array;
336 register int sp = arglast[1];
338 register char *pat = str_get(st[sp]);
339 register char *patend = pat + st[sp]->str_cur;
343 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
344 static char *space10 = " ";
346 /* These must not be in registers: */
353 items = arglast[2] - sp;
356 while (pat < patend) {
357 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
361 while (isdigit(*pat))
371 str_ncat(str,null10,10);
374 str_ncat(str,null10,len);
379 aptr = str_get(fromstr);
380 if (fromstr->str_cur > len)
381 str_ncat(str,aptr,len);
383 str_ncat(str,aptr,fromstr->str_cur);
384 len -= fromstr->str_cur;
385 if (datumtype == 'A') {
387 str_ncat(str,space10,10);
390 str_ncat(str,space10,len);
394 str_ncat(str,null10,10);
397 str_ncat(str,null10,len);
404 aint = (int)str_gnum(fromstr);
406 str_ncat(str,&achar,sizeof(char));
412 ashort = (short)str_gnum(fromstr);
414 ashort = htons(ashort);
416 str_ncat(str,(char*)&ashort,sizeof(short));
423 ashort = (short)str_gnum(fromstr);
424 str_ncat(str,(char*)&ashort,sizeof(short));
431 aint = (int)str_gnum(fromstr);
432 str_ncat(str,(char*)&aint,sizeof(int));
438 along = (long)str_gnum(fromstr);
440 along = htonl(along);
442 str_ncat(str,(char*)&along,sizeof(long));
449 along = (long)str_gnum(fromstr);
450 str_ncat(str,(char*)&along,sizeof(long));
456 aptr = str_get(fromstr);
457 str_ncat(str,(char*)&aptr,sizeof(char*));
467 do_sprintf(str,len,sarg)
476 static STR *sargnull = &str_no;
482 len--; /* don't count pattern string */
484 send = s + (*sarg)->str_cur;
486 for ( ; s < send; len--) {
487 if (len <= 0 || !*sarg) {
492 for (t = s; t < send && *t != '%'; t++) ;
494 break; /* not enough % patterns, oh well */
495 for (t++; *sarg && t < send && t != s; t++) {
500 (void)sprintf(buf,s);
505 case '0': case '1': case '2': case '3': case '4':
506 case '5': case '6': case '7': case '8': case '9':
507 case '.': case '#': case '-': case '+':
515 xlen = (int)str_gnum(*(sarg++));
516 if (strEQ(t-2,"%c")) { /* some printfs fail on null chars */
518 str_ncat(str,s,t - s - 2);
519 str_ncat(str,buf,1); /* so handle simple case */
523 (void)sprintf(buf,s,xlen);
534 (void)sprintf(buf,s,(long)str_gnum(*(sarg++)));
536 (void)sprintf(buf,s,(int)str_gnum(*(sarg++)));
543 case 'x': case 'o': case 'u':
547 (void)sprintf(buf,s,(unsigned long)str_gnum(*(sarg++)));
549 (void)sprintf(buf,s,(unsigned int)str_gnum(*(sarg++)));
553 case 'E': case 'e': case 'f': case 'G': case 'g':
556 (void)sprintf(buf,s,str_gnum(*(sarg++)));
564 xlen = (*sarg)->str_cur;
565 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'a' && xs[3] == 'b'
566 && xlen == sizeof(STBP) && strlen(xs) < xlen) {
567 xs = stab_name(((STAB*)(*sarg))); /* a stab value! */
568 sprintf(tokenbuf,"*%s",xs); /* reformat to non-binary */
570 xlen = strlen(tokenbuf);
572 if (strEQ(t-2,"%s")) { /* some printfs fail on >128 chars */
574 str_ncat(str,s,t - s - 2);
575 str_ncat(str,xs,xlen); /* so handle simple case */
578 (void)sprintf(buf,s,xs);
585 if (s < t && t >= send) {
593 (void)sprintf(buf,s,0,0,0,0);
604 register STR **st = stack->ary_array;
605 register int sp = arglast[1];
606 register int items = arglast[2] - sp;
607 register STR *str = &str_undef;
609 for (st += ++sp; items > 0; items--,st++) {
613 (void)apush(ary,str);
619 do_unshift(ary,arglast)
623 register STR **st = stack->ary_array;
624 register int sp = arglast[1];
625 register int items = arglast[2] - sp;
631 for (st += ++sp; i < items; i++,st++) {
634 (void)astore(ary,i,str);
639 do_subr(arg,gimme,arglast)
644 register STR **st = stack->ary_array;
645 register int sp = arglast[1];
646 register int items = arglast[2] - sp;
650 char *oldfile = filename;
651 int oldsave = savestack->ary_fill;
652 int oldtmps_base = tmps_base;
654 if ((arg[1].arg_type & A_MASK) == A_WORD)
655 stab = arg[1].arg_ptr.arg_stab;
657 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
660 stab = stabent(str_get(tmpstr),TRUE);
665 fatal("Undefined subroutine called");
666 sub = stab_sub(stab);
668 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
669 if ((arg[2].arg_type & A_MASK) != A_NULL) {
670 savearray = stab_xarray(defstab);
671 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
673 savelong(&sub->depth);
677 if (sub->depth >= 2) { /* save temporaries on recursion? */
678 if (sub->depth == 100 && dowarn)
679 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
680 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
682 filename = sub->filename;
683 tmps_base = tmps_max;
684 sp = cmd_exec(sub->cmd,gimme,--sp); /* so do it already */
685 st = stack->ary_array;
687 if ((arg[2].arg_type & A_MASK) != A_NULL) {
688 afree(stab_xarray(defstab)); /* put back old $_[] */
689 stab_xarray(defstab) = savearray;
692 tmps_base = oldtmps_base;
693 if (savestack->ary_fill > oldsave) {
694 for (items = arglast[0] + 1; items <= sp; items++)
695 st[items] = str_static(st[items]);
696 /* in case restore wipes old str */
697 restorelist(oldsave);
703 do_dbsubr(arg,gimme,arglast)
708 register STR **st = stack->ary_array;
709 register int sp = arglast[1];
710 register int items = arglast[2] - sp;
715 char *oldfile = filename;
716 int oldsave = savestack->ary_fill;
717 int oldtmps_base = tmps_base;
719 if ((arg[1].arg_type & A_MASK) == A_WORD)
720 stab = arg[1].arg_ptr.arg_stab;
722 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
725 stab = stabent(str_get(tmpstr),TRUE);
730 fatal("Undefined subroutine called");
731 sub = stab_sub(stab);
733 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
734 /* begin differences */
735 str = stab_val(DBsub);
737 str_set(str,stab_name(stab));
738 sub = stab_sub(DBsub);
740 fatal("No DBsub routine");
741 /* end differences */
742 if ((arg[2].arg_type & A_MASK) != A_NULL) {
743 savearray = stab_xarray(defstab);
744 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
746 savelong(&sub->depth);
750 if (sub->depth >= 2) { /* save temporaries on recursion? */
751 if (sub->depth == 100 && dowarn)
752 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
753 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
755 filename = sub->filename;
756 tmps_base = tmps_max;
757 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
758 st = stack->ary_array;
760 if ((arg[2].arg_type & A_MASK) != A_NULL) {
761 afree(stab_xarray(defstab)); /* put back old $_[] */
762 stab_xarray(defstab) = savearray;
765 tmps_base = oldtmps_base;
766 if (savestack->ary_fill > oldsave) {
767 for (items = arglast[0] + 1; items <= sp; items++)
768 st[items] = str_static(st[items]);
769 /* in case restore wipes old str */
770 restorelist(oldsave);
776 do_assign(arg,gimme,arglast)
782 register STR **st = stack->ary_array;
783 STR **firstrelem = st + arglast[1] + 1;
784 STR **firstlelem = st + arglast[0] + 1;
785 STR **lastrelem = st + arglast[2];
786 STR **lastlelem = st + arglast[1];
787 register STR **relem;
788 register STR **lelem;
792 register int makelocal;
796 makelocal = (arg->arg_flags & AF_LOCAL);
797 delaymagic = DM_DELAY; /* catch simultaneous items */
799 /* If there's a common identifier on both sides we have to take
800 * special care that assigning the identifier on the left doesn't
801 * clobber a value on the right that's used later in the list.
803 if (arg->arg_flags & AF_COMMON) {
804 for (relem = firstrelem; relem <= lastrelem; relem++) {
806 *relem = str_static(str);
813 while (lelem <= lastlelem) {
815 if (str->str_state >= SS_HASH) {
816 if (str->str_state == SS_ARY) {
818 ary = saveary(str->str_u.str_stab);
820 ary = stab_array(str->str_u.str_stab);
824 while (relem <= lastrelem) { /* gobble up all the rest */
827 str_sset(str,*(relem++));
830 (void)astore(ary,i++,str);
833 else if (str->str_state == SS_HASH) {
838 hash = savehash(str->str_u.str_stab);
840 hash = stab_hash(str->str_u.str_stab);
843 while (relem < lastrelem) { /* gobble up all the rest */
847 str = &str_no, relem++;
849 tmpstr = Str_new(29,0);
851 str_sset(tmpstr,*(relem++)); /* value */
854 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
858 fatal("panic: do_assign");
863 if (relem <= lastrelem)
864 str_sset(str, *(relem++));
866 str_nset(str, "", 0);
870 if (delaymagic > 1) {
872 if (delaymagic & DM_REUID)
876 if (delaymagic & DM_REGID)
881 if (gimme == G_ARRAY) {
882 i = lastrelem - firstrelem + 1;
884 Copy(firstrelem, firstlelem, i, STR*);
885 return arglast[0] + i;
888 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
889 *firstlelem = arg->arg_ptr.arg_str;
890 return arglast[0] + 1;
895 do_study(str,arg,gimme,arglast)
901 register unsigned char *s;
902 register int pos = str->str_cur;
904 register int *sfirst;
906 static int maxscream = -1;
907 static STR *lastscream = Nullstr;
909 int retarg = arglast[0] + 1;
912 s = (unsigned char*)(str_get(str));
914 s = Null(unsigned char*);
917 lastscream->str_pok &= ~SP_STUDIED;
923 if (pos > maxscream) {
925 maxscream = pos + 80;
926 New(301,screamfirst, 256, int);
927 New(302,screamnext, maxscream, int);
930 maxscream = pos + pos / 4;
931 Renew(screamnext, maxscream, int);
935 sfirst = screamfirst;
938 if (!sfirst || !snext)
939 fatal("do_study: out of memory");
941 for (ch = 256; ch; --ch)
948 snext[pos] = sfirst[ch] - pos;
953 /* If there were any case insensitive searches, we must assume they
954 * all are. This speeds up insensitive searches much more than
955 * it slows down sensitive ones.
958 sfirst[fold[ch]] = pos;
961 str->str_pok |= SP_STUDIED;
964 str_numset(arg->arg_ptr.arg_str,(double)retval);
965 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
970 do_defined(str,arg,gimme,arglast)
977 register int retarg = arglast[0] + 1;
980 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
981 fatal("Illegal argument to defined()");
982 arg = arg[1].arg_ptr.arg_arg;
983 type = arg->arg_type;
985 if (type == O_ARRAY || type == O_LARRAY)
986 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
987 else if (type == O_HASH || type == O_LHASH)
988 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
989 else if (type == O_SUBR || type == O_DBSUBR)
990 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
991 else if (type == O_ASLICE || type == O_LASLICE)
992 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
993 else if (type == O_HSLICE || type == O_LHSLICE)
994 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
997 str_numset(str,(double)retval);
998 stack->ary_array[retarg] = str;
1003 do_undef(str,arg,gimme,arglast)
1010 register STAB *stab;
1011 int retarg = arglast[0] + 1;
1013 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1014 fatal("Illegal argument to undef()");
1015 arg = arg[1].arg_ptr.arg_arg;
1016 type = arg->arg_type;
1018 if (type == O_ARRAY || type == O_LARRAY) {
1019 stab = arg[1].arg_ptr.arg_stab;
1020 afree(stab_xarray(stab));
1021 stab_xarray(stab) = Null(ARRAY*);
1023 else if (type == O_HASH || type == O_LHASH) {
1024 stab = arg[1].arg_ptr.arg_stab;
1025 (void)hfree(stab_xhash(stab));
1026 stab_xhash(stab) = Null(HASH*);
1028 else if (type == O_SUBR || type == O_DBSUBR) {
1029 stab = arg[1].arg_ptr.arg_stab;
1030 cmd_free(stab_sub(stab)->cmd);
1031 afree(stab_sub(stab)->tosave);
1032 Safefree(stab_sub(stab));
1033 stab_sub(stab) = Null(SUBR*);
1036 fatal("Can't undefine that kind of object");
1037 str_numset(str,0.0);
1038 stack->ary_array[retarg] = str;
1043 do_vec(lvalue,astr,arglast)
1048 STR **st = stack->ary_array;
1049 int sp = arglast[0];
1050 register STR *str = st[++sp];
1051 register int offset = (int)str_gnum(st[++sp]);
1052 register int size = (int)str_gnum(st[++sp]);
1053 unsigned char *s = (unsigned char*)str_get(str);
1054 unsigned long retnum;
1058 offset *= size; /* turn into bit offset */
1059 len = (offset + size + 7) / 8;
1060 if (offset < 0 || size < 1)
1062 else if (!lvalue && len > str->str_cur)
1065 if (len > str->str_cur) {
1067 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1070 s = (unsigned char*)str_get(str);
1072 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1077 else if (size == 16)
1078 retnum = (s[offset] << 8) + s[offset+1];
1079 else if (size == 32)
1080 retnum = (s[offset] << 24) + (s[offset + 1] << 16) +
1081 (s[offset + 2] << 8) + s[offset+3];
1084 if (lvalue) { /* it's an lvalue! */
1085 struct lstring *lstr = (struct lstring*)astr;
1087 astr->str_magic = str;
1088 st[sp]->str_rare = 'v';
1089 lstr->lstr_offset = offset;
1090 lstr->lstr_len = size;
1094 str_numset(astr,(double)retnum);
1104 struct lstring *lstr = (struct lstring*)str;
1105 register int offset;
1107 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1108 register unsigned long lval = (unsigned long)str_gnum(str);
1112 str->str_magic = Nullstr;
1113 offset = lstr->lstr_offset;
1114 size = lstr->lstr_len;
1116 mask = (1 << size) - 1;
1120 s[offset] &= ~(mask << size);
1121 s[offset] |= lval << size;
1125 s[offset] = lval & 255;
1126 else if (size == 16) {
1127 s[offset] = (lval >> 8) & 255;
1128 s[offset+1] = lval & 255;
1130 else if (size == 32) {
1131 s[offset] = (lval >> 24) & 255;
1132 s[offset+1] = (lval >> 16) & 255;
1133 s[offset+2] = (lval >> 8) & 255;
1134 s[offset+3] = lval & 255;
1143 register char *tmps;
1151 if (str->str_state == SS_ARY) {
1152 ary = stab_array(str->str_u.str_stab);
1153 for (i = 0; i <= ary->ary_fill; i++)
1154 do_chop(astr,ary->ary_array[i]);
1157 if (str->str_state == SS_HASH) {
1158 hash = stab_hash(str->str_u.str_stab);
1159 (void)hiterinit(hash);
1160 while (entry = hiternext(hash))
1161 do_chop(astr,hiterval(hash,entry));
1164 tmps = str_get(str);
1167 tmps += str->str_cur - (str->str_cur != 0);
1168 str_nset(astr,tmps,1); /* remember last char */
1169 *tmps = '\0'; /* wipe it out */
1170 str->str_cur = tmps - str->str_ptr;
1174 do_vop(optype,str,left,right)
1179 register char *s = str_get(str);
1180 register char *l = str_get(left);
1181 register char *r = str_get(right);
1184 len = left->str_cur;
1185 if (len > right->str_cur)
1186 len = right->str_cur;
1187 if (str->str_cur > len)
1189 else if (str->str_cur < len) {
1191 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1209 if (right->str_cur > len)
1210 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1211 else if (left->str_cur > len)
1212 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1221 register STR **st = stack->ary_array;
1222 register int sp = arglast[1];
1223 register int items = arglast[2] - sp;
1230 for (st += ++sp; items--; st++)
1231 tainted |= (*st)->str_tainted;
1232 st = stack->ary_array;
1234 items = arglast[2] - sp;
1237 taintproper("Insecure dependency in syscall");
1239 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1240 * or where sizeof(long) != sizeof(char*). But such machines will
1241 * not likely have syscall implemented either, so who cares?
1244 if (st[++sp]->str_nok || !i)
1245 arg[i++] = (long)str_gnum(st[sp]);
1248 arg[i++] = (long)st[sp]->str_ptr;
1252 items = arglast[2] - sp;
1255 fatal("Too few args to syscall");
1257 retval = syscall(arg[0]);
1260 retval = syscall(arg[0],arg[1]);
1263 retval = syscall(arg[0],arg[1],arg[2]);
1266 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1269 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1272 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1275 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1278 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1282 st[sp] = str_static(&str_undef);
1283 str_numset(st[sp], (double)retval);
1286 fatal("syscall() unimplemented");