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)
164 len--; /* don't count pattern string */
165 t = s = SvPV(*sarg, arglen); /* XXX Don't know t is writeable */
171 if (len <= 0 || !(arg = *sarg++))
175 for ( ; t < send && *t != '%'; t++) ;
177 break; /* end of run_format string, ignore extra args */
183 for (t++; t < send; t++) {
193 croak("Use of %c in printf format not supported", *t);
195 case '0': case '1': case '2': case '3': case '4':
196 case '5': case '6': case '7': case '8': case '9':
197 case '.': case '#': case '-': case '+': case ' ':
214 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
220 (void)sprintf(xs,f,xlen);
234 /* perl.h says that if quad is available, IV is quad */
235 (void)sprintf(xs,f,(Quad_t)SvIV(arg));
239 (void)sprintf(xs,f,(long)SvIV(arg));
242 (void)sprintf(xs,f,(int)SvIV(arg));
245 (void)sprintf(xs,f,(short)SvIV(arg));
253 case 'x': case 'o': case 'u':
259 /* perl.h says that if quad is available, UV is quad */
260 (void)sprintf(xs,f,(unsigned Quad_t)SvUV(arg));
264 (void)sprintf(xs,f,(unsigned long)SvUV(arg));
267 (void)sprintf(xs,f,(unsigned int)SvUV(arg));
270 (void)sprintf(xs,f,(unsigned short)SvUV(arg));
275 case 'E': case 'e': case 'f': case 'G': case 'g':
278 (void)sprintf(xs,f,SvNV(arg));
282 * User-defined locales may include arbitrary characters.
283 * And, unfortunately, some system may alloc the "C" locale
284 * to be overridden by a malicious user.
286 if (op->op_type == OP_SPRINTF)
288 #endif /* LC_NUMERIC */
293 xs = SvPV(arg, arglen);
295 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
296 break; /* so handle simple cases */
298 else if (f[1] == '-') {
299 char *mp = strchr(f, '.');
303 I32 max = atoi(mp+1);
312 else if (isDIGIT(f[1])) {
313 char *mp = strchr(f, '.');
317 I32 max = atoi(mp+1);
326 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
328 (void)sprintf(buf,tokenbuf+64,xs);
333 /* end of switch, copy results */
335 if (xs == buf && xlen >= sizeof(buf)) { /* Ooops! */
336 PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
339 SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
340 sv_catpvn(sv, s, f - s);
342 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
345 sv_catpvn(sv, xs, xlen);
347 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
351 break; /* break from for loop */
354 sv_catpvn(sv, s, t - s);
362 SV *targ = LvTARG(sv);
365 register unsigned char *s;
366 register unsigned long lval;
373 s = (unsigned char*)SvPV_force(targ, targlen);
374 lval = U_L(SvNV(sv));
375 offset = LvTARGOFF(sv);
376 size = LvTARGLEN(sv);
378 len = (offset + size + 7) / 8;
380 s = (unsigned char*)SvGROW(targ, len + 1);
381 (void)memzero(s + targlen, len - targlen + 1);
382 SvCUR_set(targ, len);
386 mask = (1 << size) - 1;
390 s[offset] &= ~(mask << size);
391 s[offset] |= lval << size;
396 s[offset] = lval & 255;
397 else if (size == 16) {
398 s[offset] = (lval >> 8) & 255;
399 s[offset+1] = lval & 255;
401 else if (size == 32) {
402 s[offset] = (lval >> 24) & 255;
403 s[offset+1] = (lval >> 16) & 255;
404 s[offset+2] = (lval >> 8) & 255;
405 s[offset+3] = lval & 255;
418 if (SvTYPE(sv) == SVt_PVAV) {
423 for (i = 0; i <= max; i++) {
424 sv = (SV*)av_fetch(av, i, FALSE);
425 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
430 if (SvTYPE(sv) == SVt_PVHV) {
433 (void)hv_iterinit(hv);
435 while (entry = hv_iternext(hv))
436 do_chop(astr,hv_iterval(hv,entry));
440 if (len && !SvPOK(sv))
441 s = SvPV_force(sv, len);
444 sv_setpvn(astr, s, 1);
450 sv_setpvn(astr, "", 0);
465 if (SvTYPE(sv) == SVt_PVAV) {
470 for (i = 0; i <= max; i++) {
471 sv = (SV*)av_fetch(av, i, FALSE);
472 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
473 count += do_chomp(sv);
477 if (SvTYPE(sv) == SVt_PVHV) {
480 (void)hv_iterinit(hv);
482 while (entry = hv_iternext(hv))
483 count += do_chomp(hv_iterval(hv,entry));
487 if (len && !SvPOKp(sv))
488 s = SvPV_force(sv, len);
495 while (len && s[-1] == '\n') {
503 char *rsptr = SvPV(rs, rslen);
514 if (memNE(s, rsptr, rslen))
529 do_vop(optype,sv,left,right)
550 if (sv != left || (optype != OP_BIT_AND && !SvOK(sv) && !SvGMAGICAL(sv)))
551 sv_setpvn(sv, "", 0); /* avoid undef warning on |= and ^= */
552 lsave = lc = SvPV(left, leftlen);
553 rsave = rc = SvPV(right, rightlen);
554 len = leftlen < rightlen ? leftlen : rightlen;
556 if (SvOK(sv) || SvTYPE(sv) > SVt_PVMG) {
557 dc = SvPV_force(sv, na);
558 if (SvCUR(sv) < len) {
559 dc = SvGROW(sv, len + 1);
560 (void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
564 I32 needlen = ((optype == OP_BIT_AND)
565 ? len : (leftlen > rightlen ? leftlen : rightlen));
566 Newz(801, dc, needlen + 1, char);
567 (void)sv_usepvn(sv, dc, needlen);
568 dc = SvPVX(sv); /* sv_usepvn() calls Renew() */
571 (void)SvPOK_only(sv);
573 if (len >= sizeof(long)*4 &&
574 !((long)dc % sizeof(long)) &&
575 !((long)lc % sizeof(long)) &&
576 !((long)rc % sizeof(long))) /* It's almost always aligned... */
578 I32 remainder = len % (sizeof(long)*4);
579 len /= (sizeof(long)*4);
588 *dl++ = *ll++ & *rl++;
589 *dl++ = *ll++ & *rl++;
590 *dl++ = *ll++ & *rl++;
591 *dl++ = *ll++ & *rl++;
596 *dl++ = *ll++ ^ *rl++;
597 *dl++ = *ll++ ^ *rl++;
598 *dl++ = *ll++ ^ *rl++;
599 *dl++ = *ll++ ^ *rl++;
604 *dl++ = *ll++ | *rl++;
605 *dl++ = *ll++ | *rl++;
606 *dl++ = *ll++ | *rl++;
607 *dl++ = *ll++ | *rl++;
622 *dc++ = *lc++ & *rc++;
626 *dc++ = *lc++ ^ *rc++;
630 *dc++ = *lc++ | *rc++;
634 sv_catpvn(sv, rsave + len, rightlen - len);
635 else if (leftlen > len)
636 sv_catpvn(sv, lsave + len, leftlen - len);
652 I32 dokeys = (op->op_type == OP_KEYS);
653 I32 dovalues = (op->op_type == OP_VALUES);
655 if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV)
656 dokeys = dovalues = TRUE;
659 if (op->op_flags & OPf_MOD) { /* lvalue */
660 dTARGET; /* make sure to clear its target here */
661 if (SvTYPE(TARG) == SVt_PVLV)
662 LvTARG(TARG) = Nullsv;
668 (void)hv_iterinit(hv); /* always reset iterator regardless */
670 if (op->op_private & OPpLEAVE_VOID)
673 if (GIMME != G_ARRAY) {
677 if (op->op_flags & OPf_MOD) { /* lvalue */
678 if (SvTYPE(TARG) < SVt_PVLV) {
679 sv_upgrade(TARG, SVt_PVLV);
680 sv_magic(TARG, Nullsv, 'k', Nullch, 0);
683 LvTARG(TARG) = (SV*)hv;
688 if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
693 while (entry = hv_iternext(hv)) {
701 /* Guess how much room we need. hv_max may be a few too many. Oh well. */
702 EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
704 PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
705 while (entry = hv_iternext(hv)) {
708 XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
710 tmpstr = NEWSV(45,0);
712 sv_setsv(tmpstr,hv_iterval(hv,entry));
715 sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
716 HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
717 sv_setpv(tmpstr,buf);
719 XPUSHs(sv_2mortal(tmpstr));