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));
277 /* User-defined locales may include arbitrary characters */
278 if (! numeric_standard)
285 xs = SvPV(arg, arglen);
287 if (strEQ(f,"%s")) { /* some printfs fail on >128 chars */
288 break; /* so handle simple cases */
290 else if (f[1] == '-') {
291 char *mp = strchr(f, '.');
295 I32 max = atoi(mp+1);
304 else if (isDIGIT(f[1])) {
305 char *mp = strchr(f, '.');
309 I32 max = atoi(mp+1);
318 strcpy(tokenbuf+64,f); /* sprintf($s,...$s...) */
320 (void)sprintf(buf,tokenbuf+64,xs);
325 /* end of switch, copy results */
327 if (xs == buf && xlen >= sizeof(buf)) { /* Ooops! */
328 PerlIO_puts(PerlIO_stderr(),"panic: sprintf overflow - memory corrupted!\n");
331 SvGROW(sv, SvCUR(sv) + (f - s) + xlen + 1 + pre + post);
332 sv_catpvn(sv, s, f - s);
334 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, pre);
337 sv_catpvn(sv, xs, xlen);
339 repeatcpy(SvPVX(sv) + SvCUR(sv), " ", 1, post);
343 break; /* break from for loop */
346 sv_catpvn(sv, s, t - s);
354 SV *targ = LvTARG(sv);
357 register unsigned char *s;
358 register unsigned long lval;
365 s = (unsigned char*)SvPV_force(targ, targlen);
366 lval = U_L(SvNV(sv));
367 offset = LvTARGOFF(sv);
368 size = LvTARGLEN(sv);
370 len = (offset + size + 7) / 8;
372 s = (unsigned char*)SvGROW(targ, len + 1);
373 (void)memzero(s + targlen, len - targlen + 1);
374 SvCUR_set(targ, len);
378 mask = (1 << size) - 1;
382 s[offset] &= ~(mask << size);
383 s[offset] |= lval << size;
388 s[offset] = lval & 255;
389 else if (size == 16) {
390 s[offset] = (lval >> 8) & 255;
391 s[offset+1] = lval & 255;
393 else if (size == 32) {
394 s[offset] = (lval >> 24) & 255;
395 s[offset+1] = (lval >> 16) & 255;
396 s[offset+2] = (lval >> 8) & 255;
397 s[offset+3] = lval & 255;
410 if (SvTYPE(sv) == SVt_PVAV) {
415 for (i = 0; i <= max; i++) {
416 sv = (SV*)av_fetch(av, i, FALSE);
417 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
422 if (SvTYPE(sv) == SVt_PVHV) {
425 (void)hv_iterinit(hv);
427 while (entry = hv_iternext(hv))
428 do_chop(astr,hv_iterval(hv,entry));
432 if (len && !SvPOK(sv))
433 s = SvPV_force(sv, len);
436 sv_setpvn(astr, s, 1);
442 sv_setpvn(astr, "", 0);
457 if (SvTYPE(sv) == SVt_PVAV) {
462 for (i = 0; i <= max; i++) {
463 sv = (SV*)av_fetch(av, i, FALSE);
464 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
465 count += do_chomp(sv);
469 if (SvTYPE(sv) == SVt_PVHV) {
472 (void)hv_iterinit(hv);
474 while (entry = hv_iternext(hv))
475 count += do_chomp(hv_iterval(hv,entry));
479 if (len && !SvPOKp(sv))
480 s = SvPV_force(sv, len);
487 while (len && s[-1] == '\n') {
495 char *rsptr = SvPV(rs, rslen);
506 if (memcmp(s, rsptr, rslen))
521 do_vop(optype,sv,left,right)
535 register char *lc = SvPV(left, leftlen);
536 register char *rc = SvPV(right, rightlen);
542 dc = SvPV_force(sv,na);
543 len = leftlen < rightlen ? leftlen : rightlen;
545 if (SvCUR(sv) < len) {
546 dc = SvGROW(sv,len + 1);
547 (void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
550 (void)SvPOK_only(sv);
552 if (len >= sizeof(long)*4 &&
553 !((long)dc % sizeof(long)) &&
554 !((long)lc % sizeof(long)) &&
555 !((long)rc % sizeof(long))) /* It's almost always aligned... */
557 I32 remainder = len % (sizeof(long)*4);
558 len /= (sizeof(long)*4);
567 *dl++ = *ll++ & *rl++;
568 *dl++ = *ll++ & *rl++;
569 *dl++ = *ll++ & *rl++;
570 *dl++ = *ll++ & *rl++;
575 *dl++ = *ll++ ^ *rl++;
576 *dl++ = *ll++ ^ *rl++;
577 *dl++ = *ll++ ^ *rl++;
578 *dl++ = *ll++ ^ *rl++;
583 *dl++ = *ll++ | *rl++;
584 *dl++ = *ll++ | *rl++;
585 *dl++ = *ll++ | *rl++;
586 *dl++ = *ll++ | *rl++;
601 *dc++ = *lc++ & *rc++;
605 *dc++ = *lc++ ^ *rc++;
609 *dc++ = *lc++ | *rc++;
613 sv_catpvn(sv, rsave + len, rightlen - len);
614 else if (leftlen > len)
615 sv_catpvn(sv, lsave + len, leftlen - len);
631 I32 dokeys = (op->op_type == OP_KEYS);
632 I32 dovalues = (op->op_type == OP_VALUES);
634 if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV)
635 dokeys = dovalues = TRUE;
638 if (op->op_flags & OPf_MOD) { /* lvalue */
639 dTARGET; /* make sure to clear its target here */
640 if (SvTYPE(TARG) == SVt_PVLV)
641 LvTARG(TARG) = Nullsv;
647 (void)hv_iterinit(hv); /* always reset iterator regardless */
649 if (GIMME != G_ARRAY) {
653 if (op->op_flags & OPf_MOD) { /* lvalue */
654 if (SvTYPE(TARG) < SVt_PVLV) {
655 sv_upgrade(TARG, SVt_PVLV);
656 sv_magic(TARG, Nullsv, 'k', Nullch, 0);
659 LvTARG(TARG) = (SV*)hv;
664 if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
669 while (entry = hv_iternext(hv)) {
677 /* Guess how much room we need. hv_max may be a few too many. Oh well. */
678 EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
680 PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
681 while (entry = hv_iternext(hv)) {
684 XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
686 tmpstr = NEWSV(45,0);
688 sv_setsv(tmpstr,hv_iterval(hv,entry));
691 sprintf(buf,"%d%%%d=%d\n", HeHASH(entry),
692 HvMAX(hv)+1, HeHASH(entry) & HvMAX(hv));
693 sv_setpv(tmpstr,buf);
695 XPUSHs(sv_2mortal(tmpstr));