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)
32 register I32 matches = 0;
33 register I32 squash = op->op_private & OPpTRANS_SQUASH;
38 tbl = (short*)cPVOP->op_pv;
39 s = (U8*)SvPV(sv, len);
43 s = (U8*)SvPV_force(sv, len);
47 croak("panic: do_trans");
48 DEBUG_t( deb("2.TBL\n"));
49 if (!op->op_private) {
51 if ((ch = tbl[*s]) >= 0) {
61 if ((ch = tbl[*s]) >= 0) {
63 if (matches++ && squash) {
72 else if (ch == -1) /* -1 is unmapped character */
73 *d++ = *s; /* -2 is delete character */
76 matches += send - d; /* account for disappeared chars */
78 SvCUR_set(sv, d - (U8*)SvPVX(sv));
85 do_join(sv,del,mark,sp)
92 register I32 items = sp - mark;
95 register char *delim = SvPV(del, delimlen);
99 len = (items > 0 ? (delimlen * (items - 1) ) : 0);
100 if (SvTYPE(sv) < SVt_PV)
101 sv_upgrade(sv, SVt_PV);
102 if (SvLEN(sv) < len + items) { /* current length is way too short */
103 while (items-- > 0) {
110 SvGROW(sv, len + 1); /* so try to pre-extend */
121 s = SvPV(*mark, tmplen);
122 sv_setpvn(sv, s, tmplen);
132 for (; items > 0; items--,mark++) {
133 sv_catpvn(sv,delim,len);
138 for (; items > 0; items--,mark++)
145 do_sprintf(sv,len,sarg)
151 char *pat = SvPV(*sarg, patlen);
152 bool do_taint = FALSE;
154 sv_vsetpvfn(sv, pat, patlen, Null(va_list*), sarg + 1, len - 1, &do_taint);
164 SV *targ = LvTARG(sv);
167 register unsigned char *s;
168 register unsigned long lval;
175 s = (unsigned char*)SvPV_force(targ, targlen);
176 lval = U_L(SvNV(sv));
177 offset = LvTARGOFF(sv);
178 size = LvTARGLEN(sv);
180 len = (offset + size + 7) / 8;
182 s = (unsigned char*)SvGROW(targ, len + 1);
183 (void)memzero(s + targlen, len - targlen + 1);
184 SvCUR_set(targ, len);
188 mask = (1 << size) - 1;
192 s[offset] &= ~(mask << size);
193 s[offset] |= lval << size;
198 s[offset] = lval & 255;
199 else if (size == 16) {
200 s[offset] = (lval >> 8) & 255;
201 s[offset+1] = lval & 255;
203 else if (size == 32) {
204 s[offset] = (lval >> 24) & 255;
205 s[offset+1] = (lval >> 16) & 255;
206 s[offset+2] = (lval >> 8) & 255;
207 s[offset+3] = lval & 255;
220 if (SvTYPE(sv) == SVt_PVAV) {
225 for (i = 0; i <= max; i++) {
226 sv = (SV*)av_fetch(av, i, FALSE);
227 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
232 if (SvTYPE(sv) == SVt_PVHV) {
235 (void)hv_iterinit(hv);
237 while (entry = hv_iternext(hv))
238 do_chop(astr,hv_iterval(hv,entry));
242 if (len && !SvPOK(sv))
243 s = SvPV_force(sv, len);
246 sv_setpvn(astr, s, 1);
252 sv_setpvn(astr, "", 0);
267 if (SvTYPE(sv) == SVt_PVAV) {
272 for (i = 0; i <= max; i++) {
273 sv = (SV*)av_fetch(av, i, FALSE);
274 if (sv && ((sv = *(SV**)sv), sv != &sv_undef))
275 count += do_chomp(sv);
279 if (SvTYPE(sv) == SVt_PVHV) {
282 (void)hv_iterinit(hv);
284 while (entry = hv_iternext(hv))
285 count += do_chomp(hv_iterval(hv,entry));
289 if (len && !SvPOKp(sv))
290 s = SvPV_force(sv, len);
297 while (len && s[-1] == '\n') {
305 char *rsptr = SvPV(rs, rslen);
316 if (memNE(s, rsptr, rslen))
331 do_vop(optype,sv,left,right)
352 if (sv != left || (optype != OP_BIT_AND && !SvOK(sv) && !SvGMAGICAL(sv)))
353 sv_setpvn(sv, "", 0); /* avoid undef warning on |= and ^= */
354 lsave = lc = SvPV(left, leftlen);
355 rsave = rc = SvPV(right, rightlen);
356 len = leftlen < rightlen ? leftlen : rightlen;
358 if (SvOK(sv) || SvTYPE(sv) > SVt_PVMG) {
359 dc = SvPV_force(sv, na);
360 if (SvCUR(sv) < len) {
361 dc = SvGROW(sv, len + 1);
362 (void)memzero(dc + SvCUR(sv), len - SvCUR(sv) + 1);
366 I32 needlen = ((optype == OP_BIT_AND)
367 ? len : (leftlen > rightlen ? leftlen : rightlen));
368 Newz(801, dc, needlen + 1, char);
369 (void)sv_usepvn(sv, dc, needlen);
370 dc = SvPVX(sv); /* sv_usepvn() calls Renew() */
373 (void)SvPOK_only(sv);
375 if (len >= sizeof(long)*4 &&
376 !((long)dc % sizeof(long)) &&
377 !((long)lc % sizeof(long)) &&
378 !((long)rc % sizeof(long))) /* It's almost always aligned... */
380 I32 remainder = len % (sizeof(long)*4);
381 len /= (sizeof(long)*4);
390 *dl++ = *ll++ & *rl++;
391 *dl++ = *ll++ & *rl++;
392 *dl++ = *ll++ & *rl++;
393 *dl++ = *ll++ & *rl++;
398 *dl++ = *ll++ ^ *rl++;
399 *dl++ = *ll++ ^ *rl++;
400 *dl++ = *ll++ ^ *rl++;
401 *dl++ = *ll++ ^ *rl++;
406 *dl++ = *ll++ | *rl++;
407 *dl++ = *ll++ | *rl++;
408 *dl++ = *ll++ | *rl++;
409 *dl++ = *ll++ | *rl++;
424 *dc++ = *lc++ & *rc++;
428 *dc++ = *lc++ ^ *rc++;
432 *dc++ = *lc++ | *rc++;
436 sv_catpvn(sv, rsave + len, rightlen - len);
437 else if (leftlen > len)
438 sv_catpvn(sv, lsave + len, leftlen - len);
455 I32 dokeys = (op->op_type == OP_KEYS);
456 I32 dovalues = (op->op_type == OP_VALUES);
457 I32 realhv = (SvTYPE(hv) == SVt_PVHV);
459 if (op->op_type == OP_RV2HV || op->op_type == OP_PADHV)
460 dokeys = dovalues = TRUE;
463 if (op->op_flags & OPf_MOD) { /* lvalue */
464 dTARGET; /* make sure to clear its target here */
465 if (SvTYPE(TARG) == SVt_PVLV)
466 LvTARG(TARG) = Nullsv;
473 (void)hv_iterinit(hv); /* always reset iterator regardless */
475 (void)avhv_iterinit((AV*)hv);
480 if (gimme == G_SCALAR) {
484 if (op->op_flags & OPf_MOD) { /* lvalue */
485 if (SvTYPE(TARG) < SVt_PVLV) {
486 sv_upgrade(TARG, SVt_PVLV);
487 sv_magic(TARG, Nullsv, 'k', Nullch, 0);
490 LvTARG(TARG) = (SV*)hv;
495 if (!SvRMAGICAL(hv) || !mg_find((SV*)hv,'P'))
500 while (entry = realhv ? hv_iternext(hv) : avhv_iternext((AV*)hv)) {
508 /* Guess how much room we need. hv_max may be a few too many. Oh well. */
509 EXTEND(sp, HvMAX(hv) * (dokeys + dovalues));
511 PUTBACK; /* hv_iternext and hv_iterval might clobber stack_sp */
512 while (entry = realhv ? hv_iternext(hv) : avhv_iternext((AV*)hv)) {
515 XPUSHs(hv_iterkeysv(entry)); /* won't clobber stack_sp */
517 tmpstr = sv_newmortal();
519 sv_setsv(tmpstr,realhv ?
520 hv_iterval(hv,entry) : avhv_iterval((AV*)hv,entry));
521 DEBUG_H(sv_setpvf(tmpstr, "%lu%%%d=%lu",
522 (unsigned long)HeHASH(entry),
524 (unsigned long)(HeHASH(entry) & HvMAX(hv))));