3 * Copyright (c) 1991-1994, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "'So that was the job I felt I had to do when I started,' thought Sam."
17 #if !defined(NSIG) || defined(M_UNIX) || defined(M_XENIX)
31 register I32 matches = 0;
32 register I32 squash = op->op_private & OPpTRANS_SQUASH;
37 tbl = (short*)cPVOP->op_pv;
38 s = (U8*)SvPV(sv, len);
42 s = (U8*)SvPV_force(sv, len);
46 croak("panic: do_trans");
47 DEBUG_t( deb("2.TBL\n"));
48 if (!op->op_private) {
50 if ((ch = tbl[*s]) >= 0) {
60 if ((ch = tbl[*s]) >= 0) {
62 if (matches++ && squash) {
71 else if (ch == -1) /* -1 is unmapped character */
72 *d++ = *s; /* -2 is delete character */
75 matches += send - d; /* account for disappeared chars */
77 SvCUR_set(sv, d - (U8*)SvPVX(sv));
84 do_join(sv,del,mark,sp)
91 register I32 items = sp - mark;
94 register char *delim = SvPV(del, delimlen);
98 len = (items > 0 ? (delimlen * (items - 1) ) : 0);
99 if (SvTYPE(sv) < SVt_PV)
100 sv_upgrade(sv, SVt_PV);
101 if (SvLEN(sv) < len + items) { /* current length is way too short */
102 while (items-- > 0) {
109 SvGROW(sv, len + 1); /* so try to pre-extend */
120 s = SvPV(*mark, tmplen);
121 sv_setpvn(sv, s, tmplen);
131 for (; items > 0; items--,mark++) {
132 sv_catpvn(sv,delim,len);
137 for (; items > 0; items--,mark++)
144 do_sprintf(sv,len,sarg)
155 #endif /* HAS_QUAD */
167 len--; /* don't count pattern string */
168 t = s = SvPV(*sarg, arglen); /* XXX Don't know t is writeable */
174 if (len <= 0 || !(arg = *sarg++))
178 for ( ; t < send && *t != '%'; t++) ;
180 break; /* end of run_format string, ignore extra args */
186 #endif /* HAS_QUAD */
189 for (t++; t < send; t++) {
199 croak("Use of %c in printf format not supported", *t);
201 case '0': case '1': case '2': case '3': case '4':
202 case '5': case '6': case '7': case '8': case '9':
203 case '.': case '#': case '-': case '+': case ' ':
218 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
224 (void)sprintf(xs,f,xlen);
236 (void)sprintf(buf,s,(Quad_t)SvNV(arg));
240 (void)sprintf(xs,f,(long)SvNV(arg));
242 (void)sprintf(xs,f,SvIV(arg));
248 case 'x': case 'o': case 'u':
254 (void)sprintf(buf,s,(unsigned Quad_t)value);
258 (void)sprintf(xs,f,U_L(value));
260 (void)sprintf(xs,f,U_I(value));
263 case 'E': case 'e': case 'f': case 'G': case 'g':
266 (void)sprintf(xs,f,SvNV(arg));
270 * User-defined locales may include arbitrary characters.
271 * And, unfortunately, some system may alloc the "C" locale
272 * to be overridden by a malicious user.
274 if (op->op_type == OP_SPRINTF)
276 #endif /* LC_NUMERIC */
281 xs = SvPV(arg, arglen);
283 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
284 break; /* so handle simple cases */
286 else if (f[1] == '-') {
287 char *mp = strchr(f, '.');
291 I32 max = atoi(mp+1);
300 else if (isDIGIT(f[1])) {
301 char *mp = strchr(f, '.');
305 I32 max = atoi(mp+1);
314 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
316 (void)sprintf(buf,tokenbuf+64,xs);
321 /* end of switch, copy results */
323 if (xs == buf && xlen >= sizeof(buf)) { /* Ooops! */
324 PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
327 SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
328 sv_catpvn(sv, s, f - s);
330 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
333 sv_catpvn(sv, xs, xlen);
335 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
339 break; /* break from for loop */
342 sv_catpvn(sv, s, t - s);
350 SV *targ = LvTARG(sv);
353 register unsigned char *s;
354 register unsigned long lval;
361 s = (unsigned char*)SvPV_force(targ, targlen);
362 lval = U_L(SvNV(sv));
363 offset = LvTARGOFF(sv);
364 size = LvTARGLEN(sv);
366 len = (offset + size + 7) / 8;
368 s = (unsigned char*)SvGROW(targ, len + 1);
369 (void)memzero(s + targlen, len - targlen + 1);
370 SvCUR_set(targ, len);
374 mask = (1 << size) - 1;
378 s[offset] &= ~(mask << size);
379 s[offset] |= lval << size;
384 s[offset] = lval & 255;
385 else if (size == 16) {
386 s[offset] = (lval >> 8) & 255;
387 s[offset+1] = lval & 255;
389 else if (size == 32) {
390 s[offset] = (lval >> 24) & 255;
391 s[offset+1] = (lval >> 16) & 255;
392 s[offset+2] = (lval >> 8) & 255;
393 s[offset+3] = lval & 255;
406 if (SvTYPE(sv) == SVt_PVAV) {
411 for (i = 0; i <= max; i++) {
412 sv = (SV*)av_fetch(av, i, FALSE);
413 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
418 if (SvTYPE(sv) == SVt_PVHV) {
421 (void)hv_iterinit(hv);
423 while (entry = hv_iternext(hv))
424 do_chop(astr,hv_iterval(hv,entry));
428 if (len && !SvPOK(sv))
429 s = SvPV_force(sv, len);
432 sv_setpvn(astr, s, 1);
438 sv_setpvn(astr, "", 0);
453 if (SvTYPE(sv) == SVt_PVAV) {
458 for (i = 0; i <= max; i++) {
459 sv = (SV*)av_fetch(av, i, FALSE);
460 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
461 count += do_chomp(sv);
465 if (SvTYPE(sv) == SVt_PVHV) {
468 (void)hv_iterinit(hv);
470 while (entry = hv_iternext(hv))
471 count += do_chomp(hv_iterval(hv,entry));
475 if (len && !SvPOKp(sv))
476 s = SvPV_force(sv, len);
483 while (len && s[-1] == '\n') {
491 char *rsptr = SvPV(rs, rslen);
502 if (memNE(s, rsptr, rslen))
517 do_vop(optype,sv,left,right)
538 if (sv != left || (optype != OP_BIT_AND && !SvOK(sv) && !SvGMAGICAL(sv)))
539 sv_setpvn(sv, "", 0); /* avoid undef warning on |= and ^= */
540 lsave = lc = SvPV(left, leftlen);
541 rsave = rc = SvPV(right, rightlen);
542 len = leftlen < rightlen ? leftlen : rightlen;
544 if (SvOK(sv) || SvTYPE(sv) > SVt_PVMG) {
545 dc = SvPV_force(sv, na);
546 if (SvCUR(sv) < len) {
547 dc = SvGROW(sv, len + 1);
548 (void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
552 I32 needlen = ((optype == OP_BIT_AND)
553 ? len : (leftlen > rightlen ? leftlen : rightlen));
554 Newz(801, dc, needlen + 1, char);
555 (void)sv_usepvn(sv, dc, needlen);
556 dc = SvPVX(sv); /* sv_usepvn() calls Renew() */
559 (void)SvPOK_only(sv);
561 if (len >= sizeof(long)*4 &&
562 !((long)dc % sizeof(long)) &&
563 !((long)lc % sizeof(long)) &&
564 !((long)rc % sizeof(long))) /* It's almost always aligned... */
566 I32 remainder = len % (sizeof(long)*4);
567 len /= (sizeof(long)*4);
576 *dl++ = *ll++ & *rl++;
577 *dl++ = *ll++ & *rl++;
578 *dl++ = *ll++ & *rl++;
579 *dl++ = *ll++ & *rl++;
584 *dl++ = *ll++ ^ *rl++;
585 *dl++ = *ll++ ^ *rl++;
586 *dl++ = *ll++ ^ *rl++;
587 *dl++ = *ll++ ^ *rl++;
592 *dl++ = *ll++ | *rl++;
593 *dl++ = *ll++ | *rl++;
594 *dl++ = *ll++ | *rl++;
595 *dl++ = *ll++ | *rl++;
610 *dc++ = *lc++ & *rc++;
614 *dc++ = *lc++ ^ *rc++;
618 *dc++ = *lc++ | *rc++;
622 sv_catpvn(sv, rsave + len, rightlen - len);
623 else if (leftlen > len)
624 sv_catpvn(sv, lsave + len, leftlen - len);
640 I32 dokeys = (op->op_type == OP_KEYS);
641 I32 dovalues = (op->op_type == OP_VALUES);
643 if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV)
644 dokeys = dovalues = TRUE;
647 if (op->op_flags & OPf_MOD) { /* lvalue */
648 dTARGET; /* make sure to clear its target here */
649 if (SvTYPE(TARG) == SVt_PVLV)
650 LvTARG(TARG) = Nullsv;
656 (void)hv_iterinit(hv); /* always reset iterator regardless */
658 if (GIMME != G_ARRAY) {
662 if (op->op_flags & OPf_MOD) { /* lvalue */
663 if (SvTYPE(TARG) < SVt_PVLV) {
664 sv_upgrade(TARG, SVt_PVLV);
665 sv_magic(TARG, Nullsv, 'k', Nullch, 0);
668 LvTARG(TARG) = (SV*)hv;
673 if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
678 while (entry = hv_iternext(hv)) {
686 /* Guess how much room we need. hv_max may be a few too many. Oh well. */
687 EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
689 PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
690 while (entry = hv_iternext(hv)) {
693 XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
695 tmpstr = NEWSV(45,0);
697 sv_setsv(tmpstr,hv_iterval(hv,entry));
700 sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
701 HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
702 sv_setpv(tmpstr,buf);
704 XPUSHs(sv_2mortal(tmpstr));