1 /* $Header: doarg.c,v 3.0.1.4 90/03/12 16:28: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 3.0.1.4 90/03/12 16:28:42 lwall
10 * patch13: pack of ascii strings could call str_ncat() with negative length
11 * patch13: printf("%s", *foo) was busted
13 * Revision 3.0.1.3 90/02/28 16:56:58 lwall
14 * patch9: split now can split into more than 10000 elements
15 * patch9: sped up pack and unpack
16 * patch9: pack of unsigned ints and longs blew up some places
17 * patch9: sun3 can't cast negative float to unsigned int or long
18 * patch9: local($.) didn't work
19 * patch9: grep(s/foo/bar/, @abc = @xyz) modified @xyz rather than @abc
20 * patch9: syscall returned stack size rather than value of system call
22 * Revision 3.0.1.2 89/12/21 19:52:15 lwall
23 * patch7: a pattern wouldn't match a null string before the first character
24 * patch7: certain patterns didn't match correctly at end of string
26 * Revision 3.0.1.1 89/11/11 04:17:20 lwall
27 * patch2: printf %c, %D, %X and %O didn't work right
28 * patch2: printf of unsigned vs signed needed separate casts on some machines
30 * Revision 3.0 89/10/18 15:10:41 lwall
40 extern unsigned char fold[];
53 register char *s = str_get(str);
54 char *strend = s + str->str_cur;
60 int maxiters = (strend - s) + 10;
66 rspat = spat = arg[2].arg_ptr.arg_spat;
68 fatal("panic: do_subst");
69 else if (spat->spat_runtime) {
71 (void)eval(spat->spat_runtime,G_SCALAR,sp);
72 m = str_get(dstr = stack->ary_array[sp+1]);
74 if (spat->spat_regexp)
75 regfree(spat->spat_regexp);
76 spat->spat_regexp = regcomp(m,m+dstr->str_cur,
77 spat->spat_flags & SPAT_FOLD,1);
78 if (spat->spat_flags & SPAT_KEEP) {
79 arg_free(spat->spat_runtime); /* it won't change, so */
80 spat->spat_runtime = Nullarg; /* no point compiling again */
85 deb("2.SPAT /%s/\n",spat->spat_regexp->precomp);
88 safebase = ((!spat->spat_regexp || !spat->spat_regexp->nparens) &&
90 if (!*spat->spat_regexp->precomp && lastspat)
94 if (hint < s || hint > strend)
95 fatal("panic: hint in do_match");
98 if (spat->spat_regexp->regback >= 0) {
99 s -= spat->spat_regexp->regback;
106 else if (spat->spat_short) {
107 if (spat->spat_flags & SPAT_SCANFIRST) {
108 if (str->str_pok & SP_STUDIED) {
109 if (screamfirst[spat->spat_short->str_rare] < 0)
111 else if (!(s = screaminstr(str,spat->spat_short)))
115 else if (!(s = fbminstr((unsigned char*)s, (unsigned char*)strend,
119 if (s && spat->spat_regexp->regback >= 0) {
120 ++spat->spat_short->str_u.str_useful;
121 s -= spat->spat_regexp->regback;
128 else if (!multiline && (*spat->spat_short->str_ptr != *s ||
129 bcmp(spat->spat_short->str_ptr, s, spat->spat_slen) ))
131 if (--spat->spat_short->str_u.str_useful < 0) {
132 str_free(spat->spat_short);
133 spat->spat_short = Nullstr; /* opt is being useless */
136 once = ((rspat->spat_flags & SPAT_ONCE) != 0);
137 if (rspat->spat_flags & SPAT_CONST) { /* known replacement string? */
138 if ((rspat->spat_repl[1].arg_type & A_MASK) == A_SINGLE)
139 dstr = rspat->spat_repl[1].arg_ptr.arg_str;
140 else { /* constant over loop, anyway */
141 (void)eval(rspat->spat_repl,G_SCALAR,sp);
142 dstr = stack->ary_array[sp+1];
145 clen = dstr->str_cur;
146 if (clen <= spat->spat_slen + spat->spat_regexp->regback) {
147 /* can do inplace substitution */
148 if (regexec(spat->spat_regexp, s, strend, orig, 0,
149 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
150 if (spat->spat_regexp->subbase) /* oops, no we can't */
154 str->str_pok = SP_VALID; /* disable possible screamer */
156 m = spat->spat_regexp->startp[0];
157 d = spat->spat_regexp->endp[0];
159 if (m - s > strend - d) { /* faster to shorten from end */
161 (void)bcopy(c, m, clen);
166 (void)bcopy(d, m, i);
170 str->str_cur = m - s;
172 str_numset(arg->arg_ptr.arg_str, 1.0);
173 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
176 else if (i = m - s) { /* faster from front */
184 (void)bcopy(c, m, clen);
186 str_numset(arg->arg_ptr.arg_str, 1.0);
187 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
193 (void)bcopy(c,d,clen);
195 str_numset(arg->arg_ptr.arg_str, 1.0);
196 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
202 str_numset(arg->arg_ptr.arg_str, 1.0);
203 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
209 if (iters++ > maxiters)
210 fatal("Substitution loop");
211 m = spat->spat_regexp->startp[0];
218 (void)bcopy(c,d,clen);
221 s = spat->spat_regexp->endp[0];
222 } while (regexec(spat->spat_regexp, s, strend, orig, s == m,
223 Nullstr, TRUE)); /* (don't match same null twice) */
226 str->str_cur = d - str->str_ptr + i;
227 (void)bcopy(s,d,i+1); /* include the Null */
230 str_numset(arg->arg_ptr.arg_str, (double)iters);
231 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
234 str_numset(arg->arg_ptr.arg_str, 0.0);
235 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
241 if (regexec(spat->spat_regexp, s, strend, orig, 0,
242 str->str_pok & SP_STUDIED ? str : Nullstr, safebase)) {
244 dstr = Str_new(25,str_len(str));
245 str_nset(dstr,m,s-m);
246 if (spat->spat_regexp->subbase)
250 if (iters++ > maxiters)
251 fatal("Substitution loop");
252 if (spat->spat_regexp->subbase
253 && spat->spat_regexp->subbase != orig) {
256 orig = spat->spat_regexp->subbase;
258 strend = s + (strend - m);
260 m = spat->spat_regexp->startp[0];
261 str_ncat(dstr,s,m-s);
262 s = spat->spat_regexp->endp[0];
265 str_ncat(dstr,c,clen);
268 (void)eval(rspat->spat_repl,G_SCALAR,sp);
269 str_scat(dstr,stack->ary_array[sp+1]);
273 } while (regexec(spat->spat_regexp, s, strend, orig, s == m, Nullstr,
275 str_ncat(dstr,s,strend - s);
276 str_replace(str,dstr);
278 str_numset(arg->arg_ptr.arg_str, (double)iters);
279 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
282 str_numset(arg->arg_ptr.arg_str, 0.0);
283 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
287 ++spat->spat_short->str_u.str_useful;
288 str_numset(arg->arg_ptr.arg_str, 0.0);
289 stack->ary_array[++sp] = arg->arg_ptr.arg_str;
300 register int matches = 0;
304 tbl = arg[2].arg_ptr.arg_cval;
306 send = s + str->str_cur;
308 fatal("panic: do_trans");
315 if (ch = tbl[*s & 0377]) {
330 register STR **st = stack->ary_array;
331 register int sp = arglast[1];
332 register int items = arglast[2] - sp;
333 register char *delim = str_get(st[sp]);
334 int delimlen = st[sp]->str_cur;
341 for (; items > 0; items--,st++) {
342 str_ncat(str,delim,delimlen);
353 register STR **st = stack->ary_array;
354 register int sp = arglast[1];
356 register char *pat = str_get(st[sp]);
357 register char *patend = pat + st[sp]->str_cur;
361 static char *null10 = "\0\0\0\0\0\0\0\0\0\0";
362 static char *space10 = " ";
364 /* These must not be in registers: */
370 unsigned long aulong;
373 items = arglast[2] - sp;
376 while (pat < patend) {
377 #define NEXTFROM (items-- > 0 ? *st++ : &str_no)
381 while (isdigit(*pat))
382 len = (len * 10) + (*pat++ - '0');
391 str_ncat(str,null10,10);
394 str_ncat(str,null10,len);
399 aptr = str_get(fromstr);
400 if (fromstr->str_cur > len)
401 str_ncat(str,aptr,len);
403 str_ncat(str,aptr,fromstr->str_cur);
404 len -= fromstr->str_cur;
405 if (datumtype == 'A') {
407 str_ncat(str,space10,10);
410 str_ncat(str,space10,len);
414 str_ncat(str,null10,10);
417 str_ncat(str,null10,len);
425 aint = (int)str_gnum(fromstr);
427 str_ncat(str,&achar,sizeof(char));
433 ashort = (short)str_gnum(fromstr);
435 ashort = htons(ashort);
437 str_ncat(str,(char*)&ashort,sizeof(short));
444 ashort = (short)str_gnum(fromstr);
445 str_ncat(str,(char*)&ashort,sizeof(short));
451 auint = (unsigned int)str_gnum(fromstr);
452 str_ncat(str,(char*)&auint,sizeof(unsigned int));
458 aint = (int)str_gnum(fromstr);
459 str_ncat(str,(char*)&aint,sizeof(int));
465 along = (long)str_gnum(fromstr);
467 along = htonl(along);
469 str_ncat(str,(char*)&along,sizeof(long));
475 aulong = (unsigned long)str_gnum(fromstr);
476 str_ncat(str,(char*)&aulong,sizeof(unsigned long));
482 along = (long)str_gnum(fromstr);
483 str_ncat(str,(char*)&along,sizeof(long));
489 aptr = str_get(fromstr);
490 str_ncat(str,(char*)&aptr,sizeof(char*));
500 do_sprintf(str,len,sarg)
509 static STR *sargnull = &str_no;
516 len--; /* don't count pattern string */
518 send = s + (*sarg)->str_cur;
520 for ( ; s < send; len--) {
521 if (len <= 0 || !*sarg) {
526 for (t = s; t < send && *t != '%'; t++) ;
528 break; /* not enough % patterns, oh well */
529 for (t++; *sarg && t < send && t != s; t++) {
534 (void)sprintf(buf,s);
539 case '0': case '1': case '2': case '3': case '4':
540 case '5': case '6': case '7': case '8': case '9':
541 case '.': case '#': case '-': case '+':
549 xlen = (int)str_gnum(*(sarg++));
550 if (strEQ(t-2,"%c")) { /* some printfs fail on null chars */
552 str_ncat(str,s,t - s - 2);
553 str_ncat(str,buf,1); /* so handle simple case */
557 (void)sprintf(buf,s,xlen);
568 (void)sprintf(buf,s,(long)str_gnum(*(sarg++)));
570 (void)sprintf(buf,s,(int)str_gnum(*(sarg++)));
577 case 'x': case 'o': case 'u':
580 value = str_gnum(*(sarg++));
581 #if defined(sun) && !defined(sparc)
582 if (value < 0.0) { /* sigh */
584 (void)sprintf(buf,s,(long)value);
586 (void)sprintf(buf,s,(int)value);
591 (void)sprintf(buf,s,(unsigned long)value);
593 (void)sprintf(buf,s,(unsigned int)value);
597 case 'E': case 'e': case 'f': case 'G': case 'g':
600 (void)sprintf(buf,s,str_gnum(*(sarg++)));
608 xlen = (*sarg)->str_cur;
609 if (*xs == 'S' && xs[1] == 't' && xs[2] == 'B'
610 && xlen == sizeof(STBP) && strlen(xs) < xlen) {
611 xs = stab_name(((STAB*)(*sarg))); /* a stab value! */
612 sprintf(tokenbuf,"*%s",xs); /* reformat to non-binary */
614 xlen = strlen(tokenbuf);
616 if (strEQ(t-2,"%s")) { /* some printfs fail on >128 chars */
618 str_ncat(str,s,t - s - 2);
619 str_ncat(str,xs,xlen); /* so handle simple case */
622 (void)sprintf(buf,s,xs);
629 if (s < t && t >= send) {
637 (void)sprintf(buf,s,0,0,0,0);
648 register STR **st = stack->ary_array;
649 register int sp = arglast[1];
650 register int items = arglast[2] - sp;
651 register STR *str = &str_undef;
653 for (st += ++sp; items > 0; items--,st++) {
657 (void)apush(ary,str);
663 do_unshift(ary,arglast)
667 register STR **st = stack->ary_array;
668 register int sp = arglast[1];
669 register int items = arglast[2] - sp;
675 for (st += ++sp; i < items; i++,st++) {
678 (void)astore(ary,i,str);
683 do_subr(arg,gimme,arglast)
688 register STR **st = stack->ary_array;
689 register int sp = arglast[1];
690 register int items = arglast[2] - sp;
694 char *oldfile = filename;
695 int oldsave = savestack->ary_fill;
696 int oldtmps_base = tmps_base;
698 if ((arg[1].arg_type & A_MASK) == A_WORD)
699 stab = arg[1].arg_ptr.arg_stab;
701 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
704 stab = stabent(str_get(tmpstr),TRUE);
709 fatal("Undefined subroutine called");
710 sub = stab_sub(stab);
712 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
713 if ((arg[2].arg_type & A_MASK) != A_NULL) {
714 savearray = stab_xarray(defstab);
715 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
717 savelong(&sub->depth);
721 if (sub->depth >= 2) { /* save temporaries on recursion? */
722 if (sub->depth == 100 && dowarn)
723 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
724 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
726 filename = sub->filename;
727 tmps_base = tmps_max;
728 sp = cmd_exec(sub->cmd,gimme,--sp); /* so do it already */
729 st = stack->ary_array;
731 if ((arg[2].arg_type & A_MASK) != A_NULL) {
732 afree(stab_xarray(defstab)); /* put back old $_[] */
733 stab_xarray(defstab) = savearray;
736 tmps_base = oldtmps_base;
737 if (savestack->ary_fill > oldsave) {
738 for (items = arglast[0] + 1; items <= sp; items++)
739 st[items] = str_static(st[items]);
740 /* in case restore wipes old str */
741 restorelist(oldsave);
747 do_dbsubr(arg,gimme,arglast)
752 register STR **st = stack->ary_array;
753 register int sp = arglast[1];
754 register int items = arglast[2] - sp;
759 char *oldfile = filename;
760 int oldsave = savestack->ary_fill;
761 int oldtmps_base = tmps_base;
763 if ((arg[1].arg_type & A_MASK) == A_WORD)
764 stab = arg[1].arg_ptr.arg_stab;
766 STR *tmpstr = stab_val(arg[1].arg_ptr.arg_stab);
769 stab = stabent(str_get(tmpstr),TRUE);
774 fatal("Undefined subroutine called");
775 sub = stab_sub(stab);
777 fatal("Undefined subroutine \"%s\" called", stab_name(stab));
778 /* begin differences */
779 str = stab_val(DBsub);
781 str_set(str,stab_name(stab));
782 sub = stab_sub(DBsub);
784 fatal("No DBsub routine");
785 /* end differences */
786 if ((arg[2].arg_type & A_MASK) != A_NULL) {
787 savearray = stab_xarray(defstab);
788 stab_xarray(defstab) = afake(defstab, items, &st[sp+1]);
790 savelong(&sub->depth);
794 if (sub->depth >= 2) { /* save temporaries on recursion? */
795 if (sub->depth == 100 && dowarn)
796 warn("Deep recursion on subroutine \"%s\"",stab_name(stab));
797 savelist(sub->tosave->ary_array,sub->tosave->ary_fill);
799 filename = sub->filename;
800 tmps_base = tmps_max;
801 sp = cmd_exec(sub->cmd,gimme, --sp); /* so do it already */
802 st = stack->ary_array;
804 if ((arg[2].arg_type & A_MASK) != A_NULL) {
805 afree(stab_xarray(defstab)); /* put back old $_[] */
806 stab_xarray(defstab) = savearray;
809 tmps_base = oldtmps_base;
810 if (savestack->ary_fill > oldsave) {
811 for (items = arglast[0] + 1; items <= sp; items++)
812 st[items] = str_static(st[items]);
813 /* in case restore wipes old str */
814 restorelist(oldsave);
820 do_assign(arg,gimme,arglast)
826 register STR **st = stack->ary_array;
827 STR **firstrelem = st + arglast[1] + 1;
828 STR **firstlelem = st + arglast[0] + 1;
829 STR **lastrelem = st + arglast[2];
830 STR **lastlelem = st + arglast[1];
831 register STR **relem;
832 register STR **lelem;
836 register int makelocal;
840 makelocal = (arg->arg_flags & AF_LOCAL);
841 localizing = makelocal;
842 delaymagic = DM_DELAY; /* catch simultaneous items */
844 /* If there's a common identifier on both sides we have to take
845 * special care that assigning the identifier on the left doesn't
846 * clobber a value on the right that's used later in the list.
848 if (arg->arg_flags & AF_COMMON) {
849 for (relem = firstrelem; relem <= lastrelem; relem++) {
851 *relem = str_static(str);
858 while (lelem <= lastlelem) {
860 if (str->str_state >= SS_HASH) {
861 if (str->str_state == SS_ARY) {
863 ary = saveary(str->str_u.str_stab);
865 ary = stab_array(str->str_u.str_stab);
869 while (relem <= lastrelem) { /* gobble up all the rest */
872 str_sset(str,*relem);
874 (void)astore(ary,i++,str);
877 else if (str->str_state == SS_HASH) {
882 hash = savehash(str->str_u.str_stab);
884 hash = stab_hash(str->str_u.str_stab);
887 while (relem < lastrelem) { /* gobble up all the rest */
891 str = &str_no, relem++;
893 tmpstr = Str_new(29,0);
895 str_sset(tmpstr,*relem); /* value */
897 (void)hstore(hash,tmps,str->str_cur,tmpstr,0);
901 fatal("panic: do_assign");
906 if (relem <= lastrelem) {
907 str_sset(str, *relem);
911 str_nset(str, "", 0);
912 if (gimme == G_ARRAY) {
913 i = ++lastrelem - firstrelem;
914 relem++; /* tacky, I suppose */
916 if (st != stack->ary_array) {
917 st = stack->ary_array;
918 firstrelem = st + arglast[1] + 1;
919 firstlelem = st + arglast[0] + 1;
920 lastlelem = st + arglast[1];
922 relem = lastrelem + 1;
929 if (delaymagic > 1) {
931 if (delaymagic & DM_REUID)
935 if (delaymagic & DM_REGID)
941 if (gimme == G_ARRAY) {
942 i = lastrelem - firstrelem + 1;
944 Copy(firstrelem, firstlelem, i, STR*);
945 return arglast[0] + i;
948 str_numset(arg->arg_ptr.arg_str,(double)(arglast[2] - arglast[1]));
949 *firstlelem = arg->arg_ptr.arg_str;
950 return arglast[0] + 1;
955 do_study(str,arg,gimme,arglast)
961 register unsigned char *s;
962 register int pos = str->str_cur;
964 register int *sfirst;
966 static int maxscream = -1;
967 static STR *lastscream = Nullstr;
969 int retarg = arglast[0] + 1;
972 s = (unsigned char*)(str_get(str));
974 s = Null(unsigned char*);
977 lastscream->str_pok &= ~SP_STUDIED;
983 if (pos > maxscream) {
985 maxscream = pos + 80;
986 New(301,screamfirst, 256, int);
987 New(302,screamnext, maxscream, int);
990 maxscream = pos + pos / 4;
991 Renew(screamnext, maxscream, int);
995 sfirst = screamfirst;
998 if (!sfirst || !snext)
999 fatal("do_study: out of memory");
1001 for (ch = 256; ch; --ch)
1005 while (--pos >= 0) {
1007 if (sfirst[ch] >= 0)
1008 snext[pos] = sfirst[ch] - pos;
1013 /* If there were any case insensitive searches, we must assume they
1014 * all are. This speeds up insensitive searches much more than
1015 * it slows down sensitive ones.
1018 sfirst[fold[ch]] = pos;
1021 str->str_pok |= SP_STUDIED;
1024 str_numset(arg->arg_ptr.arg_str,(double)retval);
1025 stack->ary_array[retarg] = arg->arg_ptr.arg_str;
1030 do_defined(str,arg,gimme,arglast)
1037 register int retarg = arglast[0] + 1;
1040 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1041 fatal("Illegal argument to defined()");
1042 arg = arg[1].arg_ptr.arg_arg;
1043 type = arg->arg_type;
1045 if (type == O_ARRAY || type == O_LARRAY)
1046 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
1047 else if (type == O_HASH || type == O_LHASH)
1048 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
1049 else if (type == O_SUBR || type == O_DBSUBR)
1050 retval = stab_sub(arg[1].arg_ptr.arg_stab) != 0;
1051 else if (type == O_ASLICE || type == O_LASLICE)
1052 retval = stab_xarray(arg[1].arg_ptr.arg_stab) != 0;
1053 else if (type == O_HSLICE || type == O_LHSLICE)
1054 retval = stab_xhash(arg[1].arg_ptr.arg_stab) != 0;
1057 str_numset(str,(double)retval);
1058 stack->ary_array[retarg] = str;
1063 do_undef(str,arg,gimme,arglast)
1070 register STAB *stab;
1071 int retarg = arglast[0] + 1;
1073 if ((arg[1].arg_type & A_MASK) != A_LEXPR)
1074 fatal("Illegal argument to undef()");
1075 arg = arg[1].arg_ptr.arg_arg;
1076 type = arg->arg_type;
1078 if (type == O_ARRAY || type == O_LARRAY) {
1079 stab = arg[1].arg_ptr.arg_stab;
1080 afree(stab_xarray(stab));
1081 stab_xarray(stab) = Null(ARRAY*);
1083 else if (type == O_HASH || type == O_LHASH) {
1084 stab = arg[1].arg_ptr.arg_stab;
1085 (void)hfree(stab_xhash(stab));
1086 stab_xhash(stab) = Null(HASH*);
1088 else if (type == O_SUBR || type == O_DBSUBR) {
1089 stab = arg[1].arg_ptr.arg_stab;
1090 cmd_free(stab_sub(stab)->cmd);
1091 afree(stab_sub(stab)->tosave);
1092 Safefree(stab_sub(stab));
1093 stab_sub(stab) = Null(SUBR*);
1096 fatal("Can't undefine that kind of object");
1097 str_numset(str,0.0);
1098 stack->ary_array[retarg] = str;
1103 do_vec(lvalue,astr,arglast)
1108 STR **st = stack->ary_array;
1109 int sp = arglast[0];
1110 register STR *str = st[++sp];
1111 register int offset = (int)str_gnum(st[++sp]);
1112 register int size = (int)str_gnum(st[++sp]);
1113 unsigned char *s = (unsigned char*)str_get(str);
1114 unsigned long retnum;
1118 offset *= size; /* turn into bit offset */
1119 len = (offset + size + 7) / 8;
1120 if (offset < 0 || size < 1)
1122 else if (!lvalue && len > str->str_cur)
1125 if (len > str->str_cur) {
1127 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1130 s = (unsigned char*)str_get(str);
1132 retnum = (s[offset >> 3] >> (offset & 7)) & ((1 << size) - 1);
1137 else if (size == 16)
1138 retnum = (s[offset] << 8) + s[offset+1];
1139 else if (size == 32)
1140 retnum = (s[offset] << 24) + (s[offset + 1] << 16) +
1141 (s[offset + 2] << 8) + s[offset+3];
1144 if (lvalue) { /* it's an lvalue! */
1145 struct lstring *lstr = (struct lstring*)astr;
1147 astr->str_magic = str;
1148 st[sp]->str_rare = 'v';
1149 lstr->lstr_offset = offset;
1150 lstr->lstr_len = size;
1154 str_numset(astr,(double)retnum);
1164 struct lstring *lstr = (struct lstring*)str;
1165 register int offset;
1167 register unsigned char *s = (unsigned char*)mstr->str_ptr;
1168 register unsigned long lval = (unsigned long)str_gnum(str);
1172 str->str_magic = Nullstr;
1173 offset = lstr->lstr_offset;
1174 size = lstr->lstr_len;
1176 mask = (1 << size) - 1;
1180 s[offset] &= ~(mask << size);
1181 s[offset] |= lval << size;
1185 s[offset] = lval & 255;
1186 else if (size == 16) {
1187 s[offset] = (lval >> 8) & 255;
1188 s[offset+1] = lval & 255;
1190 else if (size == 32) {
1191 s[offset] = (lval >> 24) & 255;
1192 s[offset+1] = (lval >> 16) & 255;
1193 s[offset+2] = (lval >> 8) & 255;
1194 s[offset+3] = lval & 255;
1203 register char *tmps;
1211 if (str->str_state == SS_ARY) {
1212 ary = stab_array(str->str_u.str_stab);
1213 for (i = 0; i <= ary->ary_fill; i++)
1214 do_chop(astr,ary->ary_array[i]);
1217 if (str->str_state == SS_HASH) {
1218 hash = stab_hash(str->str_u.str_stab);
1219 (void)hiterinit(hash);
1220 while (entry = hiternext(hash))
1221 do_chop(astr,hiterval(hash,entry));
1224 tmps = str_get(str);
1227 tmps += str->str_cur - (str->str_cur != 0);
1228 str_nset(astr,tmps,1); /* remember last char */
1229 *tmps = '\0'; /* wipe it out */
1230 str->str_cur = tmps - str->str_ptr;
1234 do_vop(optype,str,left,right)
1239 register char *s = str_get(str);
1240 register char *l = str_get(left);
1241 register char *r = str_get(right);
1244 len = left->str_cur;
1245 if (len > right->str_cur)
1246 len = right->str_cur;
1247 if (str->str_cur > len)
1249 else if (str->str_cur < len) {
1251 (void)bzero(str->str_ptr + str->str_cur, len - str->str_cur);
1269 if (right->str_cur > len)
1270 str_ncat(str,right->str_ptr+len,right->str_cur - len);
1271 else if (left->str_cur > len)
1272 str_ncat(str,left->str_ptr+len,left->str_cur - len);
1281 register STR **st = stack->ary_array;
1282 register int sp = arglast[1];
1283 register int items = arglast[2] - sp;
1290 for (st += ++sp; items--; st++)
1291 tainted |= (*st)->str_tainted;
1292 st = stack->ary_array;
1294 items = arglast[2] - sp;
1297 taintproper("Insecure dependency in syscall");
1299 /* This probably won't work on machines where sizeof(long) != sizeof(int)
1300 * or where sizeof(long) != sizeof(char*). But such machines will
1301 * not likely have syscall implemented either, so who cares?
1304 if (st[++sp]->str_nok || !i)
1305 arg[i++] = (long)str_gnum(st[sp]);
1308 arg[i++] = (long)st[sp]->str_ptr;
1312 items = arglast[2] - sp;
1315 fatal("Too few args to syscall");
1317 retval = syscall(arg[0]);
1320 retval = syscall(arg[0],arg[1]);
1323 retval = syscall(arg[0],arg[1],arg[2]);
1326 retval = syscall(arg[0],arg[1],arg[2],arg[3]);
1329 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]);
1332 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]);
1335 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]);
1338 retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6],
1344 fatal("syscall() unimplemented");