3 * Copyright (c) 1991-1997, 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)
150 char *pat = SvPV(*sarg, patlen);
151 bool do_taint = FALSE;
153 sv_vsetpvfn(sv, pat, patlen, Null(va_list*), sarg + 1, len - 1, &do_taint);
163 SV *targ = LvTARG(sv);
166 register unsigned char *s;
167 register unsigned long lval;
174 s = (unsigned char*)SvPV_force(targ, targlen);
175 lval = U_L(SvNV(sv));
176 offset = LvTARGOFF(sv);
177 size = LvTARGLEN(sv);
179 len = (offset + size + 7) / 8;
181 s = (unsigned char*)SvGROW(targ, len + 1);
182 (void)memzero(s + targlen, len - targlen + 1);
183 SvCUR_set(targ, len);
187 mask = (1 << size) - 1;
191 s[offset] &= ~(mask << size);
192 s[offset] |= lval << size;
197 s[offset] = lval & 255;
198 else if (size == 16) {
199 s[offset] = (lval >> 8) & 255;
200 s[offset+1] = lval & 255;
202 else if (size == 32) {
203 s[offset] = (lval >> 24) & 255;
204 s[offset+1] = (lval >> 16) & 255;
205 s[offset+2] = (lval >> 8) & 255;
206 s[offset+3] = lval & 255;
219 if (SvTYPE(sv) == SVt_PVAV) {
224 for (i = 0; i <= max; i++) {
225 sv = (SV*)av_fetch(av, i, FALSE);
226 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
231 if (SvTYPE(sv) == SVt_PVHV) {
234 (void)hv_iterinit(hv);
236 while (entry = hv_iternext(hv))
237 do_chop(astr,hv_iterval(hv,entry));
241 if (len && !SvPOK(sv))
242 s = SvPV_force(sv, len);
245 sv_setpvn(astr, s, 1);
251 sv_setpvn(astr, "", 0);
266 if (SvTYPE(sv) == SVt_PVAV) {
271 for (i = 0; i <= max; i++) {
272 sv = (SV*)av_fetch(av, i, FALSE);
273 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
274 count += do_chomp(sv);
278 if (SvTYPE(sv) == SVt_PVHV) {
281 (void)hv_iterinit(hv);
283 while (entry = hv_iternext(hv))
284 count += do_chomp(hv_iterval(hv,entry));
288 if (len && !SvPOKp(sv))
289 s = SvPV_force(sv, len);
296 while (len && s[-1] == '\n') {
304 char *rsptr = SvPV(rs, rslen);
315 if (memNE(s, rsptr, rslen))
330 do_vop(optype,sv,left,right)
351 if (sv != left || (optype != OP_BIT_AND && !SvOK(sv) && !SvGMAGICAL(sv)))
352 sv_setpvn(sv, "", 0); /* avoid undef warning on |= and ^= */
353 lsave = lc = SvPV(left, leftlen);
354 rsave = rc = SvPV(right, rightlen);
355 len = leftlen < rightlen ? leftlen : rightlen;
357 if (SvOK(sv) || SvTYPE(sv) > SVt_PVMG) {
358 dc = SvPV_force(sv, na);
359 if (SvCUR(sv) < len) {
360 dc = SvGROW(sv, len + 1);
361 (void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
365 I32 needlen = ((optype == OP_BIT_AND)
366 ? len : (leftlen > rightlen ? leftlen : rightlen));
367 Newz(801, dc, needlen + 1, char);
368 (void)sv_usepvn(sv, dc, needlen);
369 dc = SvPVX(sv); /* sv_usepvn() calls Renew() */
372 (void)SvPOK_only(sv);
374 if (len >= sizeof(long)*4 &&
375 !((long)dc % sizeof(long)) &&
376 !((long)lc % sizeof(long)) &&
377 !((long)rc % sizeof(long))) /* It's almost always aligned... */
379 I32 remainder = len % (sizeof(long)*4);
380 len /= (sizeof(long)*4);
389 *dl++ = *ll++ & *rl++;
390 *dl++ = *ll++ & *rl++;
391 *dl++ = *ll++ & *rl++;
392 *dl++ = *ll++ & *rl++;
397 *dl++ = *ll++ ^ *rl++;
398 *dl++ = *ll++ ^ *rl++;
399 *dl++ = *ll++ ^ *rl++;
400 *dl++ = *ll++ ^ *rl++;
405 *dl++ = *ll++ | *rl++;
406 *dl++ = *ll++ | *rl++;
407 *dl++ = *ll++ | *rl++;
408 *dl++ = *ll++ | *rl++;
423 *dc++ = *lc++ & *rc++;
427 *dc++ = *lc++ ^ *rc++;
431 *dc++ = *lc++ | *rc++;
435 sv_catpvn(sv, rsave + len, rightlen - len);
436 else if (leftlen > len)
437 sv_catpvn(sv, lsave + len, leftlen - len);
454 I32 dokeys = (op->op_type == OP_KEYS);
455 I32 dovalues = (op->op_type == OP_VALUES);
457 if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV)
458 dokeys = dovalues = TRUE;
461 if (op->op_flags & OPf_MOD) { /* lvalue */
462 dTARGET; /* make sure to clear its target here */
463 if (SvTYPE(TARG) == SVt_PVLV)
464 LvTARG(TARG) = Nullsv;
470 (void)hv_iterinit(hv); /* always reset iterator regardless */
475 if (gimme == G_SCALAR) {
479 if (op->op_flags & OPf_MOD) { /* lvalue */
480 if (SvTYPE(TARG) < SVt_PVLV) {
481 sv_upgrade(TARG, SVt_PVLV);
482 sv_magic(TARG, Nullsv, 'k', Nullch, 0);
485 LvTARG(TARG) = (SV*)hv;
490 if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
495 while (entry = hv_iternext(hv)) {
503 /* Guess how much room we need. hv_max may be a few too many. Oh well. */
504 EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
506 PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
507 while (entry = hv_iternext(hv)) {
510 XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
512 tmpstr = sv_newmortal();
514 sv_setsv(tmpstr,hv_iterval(hv,entry));
515 DEBUG_H(sv_setpvf(tmpstr, "%lu%%%d=%lu",
516 (unsigned long)HeHASH(entry),
518 (unsigned long)(HeHASH(entry) & HvMAX(hv))));