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)
22 #pragma function(memcmp)
23 #endif /* BUGGY_MSC */
26 #pragma intrinsic(memcmp)
27 #endif /* BUGGY_MSC */
39 register I32 matches = 0;
40 register I32 squash = op->op_private & OPpTRANS_SQUASH;
45 tbl = (short*)cPVOP->op_pv;
46 s = (U8*)SvPV(sv, len);
50 s = (U8*)SvPV_force(sv, len);
54 croak("panic: do_trans");
55 DEBUG_t( deb("2.TBL\n"));
56 if (!op->op_private) {
58 if ((ch = tbl[*s]) >= 0) {
68 if ((ch = tbl[*s]) >= 0) {
70 if (matches++ && squash) {
79 else if (ch == -1) /* -1 is unmapped character */
80 *d++ = *s; /* -2 is delete character */
83 matches += send - d; /* account for disappeared chars */
85 SvCUR_set(sv, d - (U8*)SvPVX(sv));
92 do_join(sv,del,mark,sp)
99 register I32 items = sp - mark;
102 register char *delim = SvPV(del, delimlen);
106 len = (items > 0 ? (delimlen * (items - 1) ) : 0);
107 if (SvTYPE(sv) < SVt_PV)
108 sv_upgrade(sv, SVt_PV);
109 if (SvLEN(sv) < len + items) { /* current length is way too short */
110 while (items-- > 0) {
117 SvGROW(sv, len + 1); /* so try to pre-extend */
128 s = SvPV(*mark, tmplen);
129 sv_setpvn(sv, s, tmplen);
139 for (; items > 0; items--,mark++) {
140 sv_catpvn(sv,delim,len);
145 for (; items > 0; items--,mark++)
152 do_sprintf(sv,len,sarg)
163 #endif /* HAS_QUAD */
175 len--; /* don't count pattern string */
176 t = s = SvPV(*sarg, arglen); /* XXX Don't know t is writeable */
182 if (len <= 0 || !(arg = *sarg++))
186 for ( ; t < send && *t != '%'; t++) ;
188 break; /* end of run_format string, ignore extra args */
194 #endif /* HAS_QUAD */
197 for (t++; t < send; t++) {
207 croak("Use of %c in printf format not supported", *t);
209 case '0': case '1': case '2': case '3': case '4':
210 case '5': case '6': case '7': case '8': case '9':
211 case '.': case '#': case '-': case '+': case ' ':
226 if (strEQ(f,"%c")) { /* some printfs fail on null chars */
232 (void)sprintf(xs,f,xlen);
244 (void)sprintf(buf,s,(Quad_t)SvNV(arg));
248 (void)sprintf(xs,f,(long)SvNV(arg));
250 (void)sprintf(xs,f,SvIV(arg));
256 case 'x': case 'o': case 'u':
262 (void)sprintf(buf,s,(unsigned Quad_t)value);
266 (void)sprintf(xs,f,U_L(value));
268 (void)sprintf(xs,f,U_I(value));
271 case 'E': case 'e': case 'f': case 'G': case 'g':
274 (void)sprintf(xs,f,SvNV(arg));
278 * User-defined locales may include arbitrary characters.
279 * And, unfortunately, some system may alloc the "C" locale
280 * to be overridden by a malicious user.
282 if (op->op_type == OP_SPRINTF)
284 #endif /* LC_NUMERIC */
289 xs = SvPV(arg, arglen);
291 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
292 break; /* so handle simple cases */
294 else if (f[1] == '-') {
295 char *mp = strchr(f, '.');
299 I32 max = atoi(mp+1);
308 else if (isDIGIT(f[1])) {
309 char *mp = strchr(f, '.');
313 I32 max = atoi(mp+1);
322 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
324 (void)sprintf(buf,tokenbuf+64,xs);
329 /* end of switch, copy results */
331 if (xs == buf && xlen >= sizeof(buf)) { /* Ooops! */
332 PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
335 SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
336 sv_catpvn(sv, s, f - s);
338 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
341 sv_catpvn(sv, xs, xlen);
343 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
347 break; /* break from for loop */
350 sv_catpvn(sv, s, t - s);
358 SV *targ = LvTARG(sv);
361 register unsigned char *s;
362 register unsigned long lval;
369 s = (unsigned char*)SvPV_force(targ, targlen);
370 lval = U_L(SvNV(sv));
371 offset = LvTARGOFF(sv);
372 size = LvTARGLEN(sv);
374 len = (offset + size + 7) / 8;
376 s = (unsigned char*)SvGROW(targ, len + 1);
377 (void)memzero(s + targlen, len - targlen + 1);
378 SvCUR_set(targ, len);
382 mask = (1 << size) - 1;
386 s[offset] &= ~(mask << size);
387 s[offset] |= lval << size;
392 s[offset] = lval & 255;
393 else if (size == 16) {
394 s[offset] = (lval >> 8) & 255;
395 s[offset+1] = lval & 255;
397 else if (size == 32) {
398 s[offset] = (lval >> 24) & 255;
399 s[offset+1] = (lval >> 16) & 255;
400 s[offset+2] = (lval >> 8) & 255;
401 s[offset+3] = lval & 255;
414 if (SvTYPE(sv) == SVt_PVAV) {
419 for (i = 0; i <= max; i++) {
420 sv = (SV*)av_fetch(av, i, FALSE);
421 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
426 if (SvTYPE(sv) == SVt_PVHV) {
429 (void)hv_iterinit(hv);
431 while (entry = hv_iternext(hv))
432 do_chop(astr,hv_iterval(hv,entry));
436 if (len && !SvPOK(sv))
437 s = SvPV_force(sv, len);
440 sv_setpvn(astr, s, 1);
446 sv_setpvn(astr, "", 0);
461 if (SvTYPE(sv) == SVt_PVAV) {
466 for (i = 0; i <= max; i++) {
467 sv = (SV*)av_fetch(av, i, FALSE);
468 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
469 count += do_chomp(sv);
473 if (SvTYPE(sv) == SVt_PVHV) {
476 (void)hv_iterinit(hv);
478 while (entry = hv_iternext(hv))
479 count += do_chomp(hv_iterval(hv,entry));
483 if (len && !SvPOKp(sv))
484 s = SvPV_force(sv, len);
491 while (len && s[-1] == '\n') {
499 char *rsptr = SvPV(rs, rslen);
510 if (memcmp(s, rsptr, rslen))
525 do_vop(optype,sv,left,right)
539 register char *lc = SvPV(left, leftlen);
540 register char *rc = SvPV(right, rightlen);
546 len = leftlen < rightlen ? leftlen : rightlen;
549 dc = SvPV_force(sv, na);
550 if (SvCUR(sv) < len) {
551 dc = SvGROW(sv, len + 1);
552 (void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
556 I32 needlen = ((optype == OP_BIT_AND)
557 ? len : (leftlen > rightlen ? leftlen : rightlen));
558 Newz(801, dc, needlen + 1, char);
559 (void)sv_usepvn(sv, dc, needlen);
560 dc = SvPVX(sv); /* sv_usepvn() calls Renew() */
563 (void)SvPOK_only(sv);
565 if (len >= sizeof(long)*4 &&
566 !((long)dc % sizeof(long)) &&
567 !((long)lc % sizeof(long)) &&
568 !((long)rc % sizeof(long))) /* It's almost always aligned... */
570 I32 remainder = len % (sizeof(long)*4);
571 len /= (sizeof(long)*4);
580 *dl++ = *ll++ & *rl++;
581 *dl++ = *ll++ & *rl++;
582 *dl++ = *ll++ & *rl++;
583 *dl++ = *ll++ & *rl++;
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++;
614 *dc++ = *lc++ & *rc++;
618 *dc++ = *lc++ ^ *rc++;
622 *dc++ = *lc++ | *rc++;
626 sv_catpvn(sv, rsave + len, rightlen - len);
627 else if (leftlen > len)
628 sv_catpvn(sv, lsave + len, leftlen - len);
644 I32 dokeys = (op->op_type == OP_KEYS);
645 I32 dovalues = (op->op_type == OP_VALUES);
647 if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV)
648 dokeys = dovalues = TRUE;
651 if (op->op_flags & OPf_MOD) { /* lvalue */
652 dTARGET; /* make sure to clear its target here */
653 if (SvTYPE(TARG) == SVt_PVLV)
654 LvTARG(TARG) = Nullsv;
660 (void)hv_iterinit(hv); /* always reset iterator regardless */
662 if (GIMME != G_ARRAY) {
666 if (op->op_flags & OPf_MOD) { /* lvalue */
667 if (SvTYPE(TARG) < SVt_PVLV) {
668 sv_upgrade(TARG, SVt_PVLV);
669 sv_magic(TARG, Nullsv, 'k', Nullch, 0);
672 LvTARG(TARG) = (SV*)hv;
677 if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
682 while (entry = hv_iternext(hv)) {
690 /* Guess how much room we need. hv_max may be a few too many. Oh well. */
691 EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
693 PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
694 while (entry = hv_iternext(hv)) {
697 XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
699 tmpstr = NEWSV(45,0);
701 sv_setsv(tmpstr,hv_iterval(hv,entry));
704 sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
705 HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
706 sv_setpv(tmpstr,buf);
708 XPUSHs(sv_2mortal(tmpstr));