| 1 | /* op.c |
| 2 | * |
| 3 | * Copyright (c) 1991-1997, Larry Wall |
| 4 | * |
| 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. |
| 7 | * |
| 8 | */ |
| 9 | |
| 10 | /* |
| 11 | * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was |
| 12 | * our Mr. Bilbo's first cousin on the mother's side (her mother being the |
| 13 | * youngest of the Old Took's daughters); and Mr. Drogo was his second |
| 14 | * cousin. So Mr. Frodo is his first *and* second cousin, once removed |
| 15 | * either way, as the saying is, if you follow me." --the Gaffer |
| 16 | */ |
| 17 | |
| 18 | #include "EXTERN.h" |
| 19 | #include "perl.h" |
| 20 | |
| 21 | #ifdef PERL_OBJECT |
| 22 | #define CHECKCALL this->*check |
| 23 | #else |
| 24 | #define CHECKCALL *check |
| 25 | #endif |
| 26 | |
| 27 | /* |
| 28 | * In the following definition, the ", Nullop" is just to make the compiler |
| 29 | * think the expression is of the right type: croak actually does a Siglongjmp. |
| 30 | */ |
| 31 | #define CHECKOP(type,o) \ |
| 32 | ((op_mask && op_mask[type]) \ |
| 33 | ? ( op_free((OP*)o), \ |
| 34 | croak("%s trapped by operation mask", op_desc[type]), \ |
| 35 | Nullop ) \ |
| 36 | : (CHECKCALL[type])((OP*)o)) |
| 37 | |
| 38 | static bool scalar_mod_type _((OP *o, I32 type)); |
| 39 | #ifndef PERL_OBJECT |
| 40 | static I32 list_assignment _((OP *o)); |
| 41 | static void bad_type _((I32 n, char *t, char *name, OP *kid)); |
| 42 | static OP *modkids _((OP *o, I32 type)); |
| 43 | static OP *no_fh_allowed _((OP *o)); |
| 44 | static OP *scalarboolean _((OP *o)); |
| 45 | static OP *too_few_arguments _((OP *o, char* name)); |
| 46 | static OP *too_many_arguments _((OP *o, char* name)); |
| 47 | static void null _((OP* o)); |
| 48 | static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq, |
| 49 | CV* startcv, I32 cx_ix)); |
| 50 | static OP *newDEFSVOP _((void)); |
| 51 | static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp)); |
| 52 | #endif |
| 53 | |
| 54 | STATIC char* |
| 55 | gv_ename(GV *gv) |
| 56 | { |
| 57 | SV* tmpsv = sv_newmortal(); |
| 58 | gv_efullname3(tmpsv, gv, Nullch); |
| 59 | return SvPV(tmpsv,na); |
| 60 | } |
| 61 | |
| 62 | STATIC OP * |
| 63 | no_fh_allowed(OP *o) |
| 64 | { |
| 65 | yyerror(form("Missing comma after first argument to %s function", |
| 66 | op_desc[o->op_type])); |
| 67 | return o; |
| 68 | } |
| 69 | |
| 70 | STATIC OP * |
| 71 | too_few_arguments(OP *o, char *name) |
| 72 | { |
| 73 | yyerror(form("Not enough arguments for %s", name)); |
| 74 | return o; |
| 75 | } |
| 76 | |
| 77 | STATIC OP * |
| 78 | too_many_arguments(OP *o, char *name) |
| 79 | { |
| 80 | yyerror(form("Too many arguments for %s", name)); |
| 81 | return o; |
| 82 | } |
| 83 | |
| 84 | STATIC void |
| 85 | bad_type(I32 n, char *t, char *name, OP *kid) |
| 86 | { |
| 87 | yyerror(form("Type of arg %d to %s must be %s (not %s)", |
| 88 | (int)n, name, t, op_desc[kid->op_type])); |
| 89 | } |
| 90 | |
| 91 | void |
| 92 | assertref(OP *o) |
| 93 | { |
| 94 | int type = o->op_type; |
| 95 | if (type != OP_AELEM && type != OP_HELEM) { |
| 96 | yyerror(form("Can't use subscript on %s", op_desc[type])); |
| 97 | if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) { |
| 98 | dTHR; |
| 99 | SV *msg = sv_2mortal( |
| 100 | newSVpvf("(Did you mean $ or @ instead of %c?)\n", |
| 101 | type == OP_ENTERSUB ? '&' : '%')); |
| 102 | if (in_eval & 2) |
| 103 | warn("%_", msg); |
| 104 | else if (in_eval) |
| 105 | sv_catsv(GvSV(errgv), msg); |
| 106 | else |
| 107 | PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg)); |
| 108 | } |
| 109 | } |
| 110 | } |
| 111 | |
| 112 | /* "register" allocation */ |
| 113 | |
| 114 | PADOFFSET |
| 115 | pad_allocmy(char *name) |
| 116 | { |
| 117 | dTHR; |
| 118 | PADOFFSET off; |
| 119 | SV *sv; |
| 120 | |
| 121 | if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) { |
| 122 | if (!isPRINT(name[1])) { |
| 123 | name[3] = '\0'; |
| 124 | name[2] = toCTRL(name[1]); |
| 125 | name[1] = '^'; |
| 126 | } |
| 127 | croak("Can't use global %s in \"my\"",name); |
| 128 | } |
| 129 | if (dowarn && AvFILLp(comppad_name) >= 0) { |
| 130 | SV **svp = AvARRAY(comppad_name); |
| 131 | for (off = AvFILLp(comppad_name); off > comppad_name_floor; off--) { |
| 132 | if ((sv = svp[off]) |
| 133 | && sv != &sv_undef |
| 134 | && SvIVX(sv) == 999999999 /* var is in open scope */ |
| 135 | && strEQ(name, SvPVX(sv))) |
| 136 | { |
| 137 | warn("\"my\" variable %s masks earlier declaration in same scope", name); |
| 138 | break; |
| 139 | } |
| 140 | } |
| 141 | } |
| 142 | off = pad_alloc(OP_PADSV, SVs_PADMY); |
| 143 | sv = NEWSV(1102,0); |
| 144 | sv_upgrade(sv, SVt_PVNV); |
| 145 | sv_setpv(sv, name); |
| 146 | if (in_my_stash) { |
| 147 | if (*name != '$') |
| 148 | croak("Can't declare class for non-scalar %s in \"my\"",name); |
| 149 | SvOBJECT_on(sv); |
| 150 | (void)SvUPGRADE(sv, SVt_PVMG); |
| 151 | SvSTASH(sv) = (HV*)SvREFCNT_inc(in_my_stash); |
| 152 | sv_objcount++; |
| 153 | } |
| 154 | av_store(comppad_name, off, sv); |
| 155 | SvNVX(sv) = (double)999999999; |
| 156 | SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */ |
| 157 | if (!min_intro_pending) |
| 158 | min_intro_pending = off; |
| 159 | max_intro_pending = off; |
| 160 | if (*name == '@') |
| 161 | av_store(comppad, off, (SV*)newAV()); |
| 162 | else if (*name == '%') |
| 163 | av_store(comppad, off, (SV*)newHV()); |
| 164 | SvPADMY_on(curpad[off]); |
| 165 | return off; |
| 166 | } |
| 167 | |
| 168 | STATIC PADOFFSET |
| 169 | pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix) |
| 170 | { |
| 171 | dTHR; |
| 172 | CV *cv; |
| 173 | I32 off; |
| 174 | SV *sv; |
| 175 | register I32 i; |
| 176 | register PERL_CONTEXT *cx; |
| 177 | int saweval; |
| 178 | |
| 179 | for (cv = startcv; cv; cv = CvOUTSIDE(cv)) { |
| 180 | AV *curlist = CvPADLIST(cv); |
| 181 | SV **svp = av_fetch(curlist, 0, FALSE); |
| 182 | AV *curname; |
| 183 | |
| 184 | if (!svp || *svp == &sv_undef) |
| 185 | continue; |
| 186 | curname = (AV*)*svp; |
| 187 | svp = AvARRAY(curname); |
| 188 | for (off = AvFILLp(curname); off > 0; off--) { |
| 189 | if ((sv = svp[off]) && |
| 190 | sv != &sv_undef && |
| 191 | seq <= SvIVX(sv) && |
| 192 | seq > I_32(SvNVX(sv)) && |
| 193 | strEQ(SvPVX(sv), name)) |
| 194 | { |
| 195 | I32 depth; |
| 196 | AV *oldpad; |
| 197 | SV *oldsv; |
| 198 | |
| 199 | depth = CvDEPTH(cv); |
| 200 | if (!depth) { |
| 201 | if (newoff) { |
| 202 | if (SvFAKE(sv)) |
| 203 | continue; |
| 204 | return 0; /* don't clone from inactive stack frame */ |
| 205 | } |
| 206 | depth = 1; |
| 207 | } |
| 208 | oldpad = (AV*)*av_fetch(curlist, depth, FALSE); |
| 209 | oldsv = *av_fetch(oldpad, off, TRUE); |
| 210 | if (!newoff) { /* Not a mere clone operation. */ |
| 211 | SV *namesv = NEWSV(1103,0); |
| 212 | newoff = pad_alloc(OP_PADSV, SVs_PADMY); |
| 213 | sv_upgrade(namesv, SVt_PVNV); |
| 214 | sv_setpv(namesv, name); |
| 215 | av_store(comppad_name, newoff, namesv); |
| 216 | SvNVX(namesv) = (double)curcop->cop_seq; |
| 217 | SvIVX(namesv) = 999999999; /* A ref, intro immediately */ |
| 218 | SvFAKE_on(namesv); /* A ref, not a real var */ |
| 219 | if (CvANON(compcv) || SvTYPE(compcv) == SVt_PVFM) { |
| 220 | /* "It's closures all the way down." */ |
| 221 | CvCLONE_on(compcv); |
| 222 | if (cv == startcv) { |
| 223 | if (CvANON(compcv)) |
| 224 | oldsv = Nullsv; /* no need to keep ref */ |
| 225 | } |
| 226 | else { |
| 227 | CV *bcv; |
| 228 | for (bcv = startcv; |
| 229 | bcv && bcv != cv && !CvCLONE(bcv); |
| 230 | bcv = CvOUTSIDE(bcv)) { |
| 231 | if (CvANON(bcv)) |
| 232 | CvCLONE_on(bcv); |
| 233 | else { |
| 234 | if (dowarn && !CvUNIQUE(cv)) |
| 235 | warn( |
| 236 | "Variable \"%s\" may be unavailable", |
| 237 | name); |
| 238 | break; |
| 239 | } |
| 240 | } |
| 241 | } |
| 242 | } |
| 243 | else if (!CvUNIQUE(compcv)) { |
| 244 | if (dowarn && !SvFAKE(sv) && !CvUNIQUE(cv)) |
| 245 | warn("Variable \"%s\" will not stay shared", name); |
| 246 | } |
| 247 | } |
| 248 | av_store(comppad, newoff, SvREFCNT_inc(oldsv)); |
| 249 | return newoff; |
| 250 | } |
| 251 | } |
| 252 | } |
| 253 | |
| 254 | /* Nothing in current lexical context--try eval's context, if any. |
| 255 | * This is necessary to let the perldb get at lexically scoped variables. |
| 256 | * XXX This will also probably interact badly with eval tree caching. |
| 257 | */ |
| 258 | |
| 259 | saweval = 0; |
| 260 | for (i = cx_ix; i >= 0; i--) { |
| 261 | cx = &cxstack[i]; |
| 262 | switch (cx->cx_type) { |
| 263 | default: |
| 264 | if (i == 0 && saweval) { |
| 265 | seq = cxstack[saweval].blk_oldcop->cop_seq; |
| 266 | return pad_findlex(name, newoff, seq, main_cv, 0); |
| 267 | } |
| 268 | break; |
| 269 | case CXt_EVAL: |
| 270 | switch (cx->blk_eval.old_op_type) { |
| 271 | case OP_ENTEREVAL: |
| 272 | saweval = i; |
| 273 | break; |
| 274 | case OP_REQUIRE: |
| 275 | /* require must have its own scope */ |
| 276 | return 0; |
| 277 | } |
| 278 | break; |
| 279 | case CXt_SUB: |
| 280 | if (!saweval) |
| 281 | return 0; |
| 282 | cv = cx->blk_sub.cv; |
| 283 | if (debstash && CvSTASH(cv) == debstash) { /* ignore DB'* scope */ |
| 284 | saweval = i; /* so we know where we were called from */ |
| 285 | continue; |
| 286 | } |
| 287 | seq = cxstack[saweval].blk_oldcop->cop_seq; |
| 288 | return pad_findlex(name, newoff, seq, cv, i-1); |
| 289 | } |
| 290 | } |
| 291 | |
| 292 | return 0; |
| 293 | } |
| 294 | |
| 295 | PADOFFSET |
| 296 | pad_findmy(char *name) |
| 297 | { |
| 298 | dTHR; |
| 299 | I32 off; |
| 300 | I32 pendoff = 0; |
| 301 | SV *sv; |
| 302 | SV **svp = AvARRAY(comppad_name); |
| 303 | U32 seq = cop_seqmax; |
| 304 | |
| 305 | #ifdef USE_THREADS |
| 306 | /* |
| 307 | * Special case to get lexical (and hence per-thread) @_. |
| 308 | * XXX I need to find out how to tell at parse-time whether use |
| 309 | * of @_ should refer to a lexical (from a sub) or defgv (global |
| 310 | * scope and maybe weird sub-ish things like formats). See |
| 311 | * startsub in perly.y. It's possible that @_ could be lexical |
| 312 | * (at least from subs) even in non-threaded perl. |
| 313 | */ |
| 314 | if (strEQ(name, "@_")) |
| 315 | return 0; /* success. (NOT_IN_PAD indicates failure) */ |
| 316 | #endif /* USE_THREADS */ |
| 317 | |
| 318 | /* The one we're looking for is probably just before comppad_name_fill. */ |
| 319 | for (off = AvFILLp(comppad_name); off > 0; off--) { |
| 320 | if ((sv = svp[off]) && |
| 321 | sv != &sv_undef && |
| 322 | (!SvIVX(sv) || |
| 323 | (seq <= SvIVX(sv) && |
| 324 | seq > I_32(SvNVX(sv)))) && |
| 325 | strEQ(SvPVX(sv), name)) |
| 326 | { |
| 327 | if (SvIVX(sv)) |
| 328 | return (PADOFFSET)off; |
| 329 | pendoff = off; /* this pending def. will override import */ |
| 330 | } |
| 331 | } |
| 332 | |
| 333 | /* See if it's in a nested scope */ |
| 334 | off = pad_findlex(name, 0, seq, CvOUTSIDE(compcv), cxstack_ix); |
| 335 | if (off) { |
| 336 | /* If there is a pending local definition, this new alias must die */ |
| 337 | if (pendoff) |
| 338 | SvIVX(AvARRAY(comppad_name)[off]) = seq; |
| 339 | return off; /* pad_findlex returns 0 for failure...*/ |
| 340 | } |
| 341 | return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */ |
| 342 | } |
| 343 | |
| 344 | void |
| 345 | pad_leavemy(I32 fill) |
| 346 | { |
| 347 | I32 off; |
| 348 | SV **svp = AvARRAY(comppad_name); |
| 349 | SV *sv; |
| 350 | if (min_intro_pending && fill < min_intro_pending) { |
| 351 | for (off = max_intro_pending; off >= min_intro_pending; off--) { |
| 352 | if ((sv = svp[off]) && sv != &sv_undef) |
| 353 | warn("%s never introduced", SvPVX(sv)); |
| 354 | } |
| 355 | } |
| 356 | /* "Deintroduce" my variables that are leaving with this scope. */ |
| 357 | for (off = AvFILLp(comppad_name); off > fill; off--) { |
| 358 | if ((sv = svp[off]) && sv != &sv_undef && SvIVX(sv) == 999999999) |
| 359 | SvIVX(sv) = cop_seqmax; |
| 360 | } |
| 361 | } |
| 362 | |
| 363 | PADOFFSET |
| 364 | pad_alloc(I32 optype, U32 tmptype) |
| 365 | { |
| 366 | dTHR; |
| 367 | SV *sv; |
| 368 | I32 retval; |
| 369 | |
| 370 | if (AvARRAY(comppad) != curpad) |
| 371 | croak("panic: pad_alloc"); |
| 372 | if (pad_reset_pending) |
| 373 | pad_reset(); |
| 374 | if (tmptype & SVs_PADMY) { |
| 375 | do { |
| 376 | sv = *av_fetch(comppad, AvFILLp(comppad) + 1, TRUE); |
| 377 | } while (SvPADBUSY(sv)); /* need a fresh one */ |
| 378 | retval = AvFILLp(comppad); |
| 379 | } |
| 380 | else { |
| 381 | SV **names = AvARRAY(comppad_name); |
| 382 | SSize_t names_fill = AvFILLp(comppad_name); |
| 383 | for (;;) { |
| 384 | /* |
| 385 | * "foreach" index vars temporarily become aliases to non-"my" |
| 386 | * values. Thus we must skip, not just pad values that are |
| 387 | * marked as current pad values, but also those with names. |
| 388 | */ |
| 389 | if (++padix <= names_fill && |
| 390 | (sv = names[padix]) && sv != &sv_undef) |
| 391 | continue; |
| 392 | sv = *av_fetch(comppad, padix, TRUE); |
| 393 | if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY))) |
| 394 | break; |
| 395 | } |
| 396 | retval = padix; |
| 397 | } |
| 398 | SvFLAGS(sv) |= tmptype; |
| 399 | curpad = AvARRAY(comppad); |
| 400 | #ifdef USE_THREADS |
| 401 | DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n", |
| 402 | (unsigned long) thr, (unsigned long) curpad, |
| 403 | (long) retval, op_name[optype])); |
| 404 | #else |
| 405 | DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n", |
| 406 | (unsigned long) curpad, |
| 407 | (long) retval, op_name[optype])); |
| 408 | #endif /* USE_THREADS */ |
| 409 | return (PADOFFSET)retval; |
| 410 | } |
| 411 | |
| 412 | SV * |
| 413 | pad_sv(PADOFFSET po) |
| 414 | { |
| 415 | dTHR; |
| 416 | #ifdef USE_THREADS |
| 417 | DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n", |
| 418 | (unsigned long) thr, (unsigned long) curpad, po)); |
| 419 | #else |
| 420 | if (!po) |
| 421 | croak("panic: pad_sv po"); |
| 422 | DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n", |
| 423 | (unsigned long) curpad, po)); |
| 424 | #endif /* USE_THREADS */ |
| 425 | return curpad[po]; /* eventually we'll turn this into a macro */ |
| 426 | } |
| 427 | |
| 428 | void |
| 429 | pad_free(PADOFFSET po) |
| 430 | { |
| 431 | dTHR; |
| 432 | if (!curpad) |
| 433 | return; |
| 434 | if (AvARRAY(comppad) != curpad) |
| 435 | croak("panic: pad_free curpad"); |
| 436 | if (!po) |
| 437 | croak("panic: pad_free po"); |
| 438 | #ifdef USE_THREADS |
| 439 | DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n", |
| 440 | (unsigned long) thr, (unsigned long) curpad, po)); |
| 441 | #else |
| 442 | DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n", |
| 443 | (unsigned long) curpad, po)); |
| 444 | #endif /* USE_THREADS */ |
| 445 | if (curpad[po] && curpad[po] != &sv_undef) |
| 446 | SvPADTMP_off(curpad[po]); |
| 447 | if ((I32)po < padix) |
| 448 | padix = po - 1; |
| 449 | } |
| 450 | |
| 451 | void |
| 452 | pad_swipe(PADOFFSET po) |
| 453 | { |
| 454 | dTHR; |
| 455 | if (AvARRAY(comppad) != curpad) |
| 456 | croak("panic: pad_swipe curpad"); |
| 457 | if (!po) |
| 458 | croak("panic: pad_swipe po"); |
| 459 | #ifdef USE_THREADS |
| 460 | DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n", |
| 461 | (unsigned long) thr, (unsigned long) curpad, po)); |
| 462 | #else |
| 463 | DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n", |
| 464 | (unsigned long) curpad, po)); |
| 465 | #endif /* USE_THREADS */ |
| 466 | SvPADTMP_off(curpad[po]); |
| 467 | curpad[po] = NEWSV(1107,0); |
| 468 | SvPADTMP_on(curpad[po]); |
| 469 | if ((I32)po < padix) |
| 470 | padix = po - 1; |
| 471 | } |
| 472 | |
| 473 | /* XXX pad_reset() is currently disabled because it results in serious bugs. |
| 474 | * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed |
| 475 | * on the stack by OPs that use them, there are several ways to get an alias |
| 476 | * to a shared TARG. Such an alias will change randomly and unpredictably. |
| 477 | * We avoid doing this until we can think of a Better Way. |
| 478 | * GSAR 97-10-29 */ |
| 479 | void |
| 480 | pad_reset(void) |
| 481 | { |
| 482 | #ifdef USE_BROKEN_PAD_RESET |
| 483 | dTHR; |
| 484 | register I32 po; |
| 485 | |
| 486 | if (AvARRAY(comppad) != curpad) |
| 487 | croak("panic: pad_reset curpad"); |
| 488 | #ifdef USE_THREADS |
| 489 | DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n", |
| 490 | (unsigned long) thr, (unsigned long) curpad)); |
| 491 | #else |
| 492 | DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n", |
| 493 | (unsigned long) curpad)); |
| 494 | #endif /* USE_THREADS */ |
| 495 | if (!tainting) { /* Can't mix tainted and non-tainted temporaries. */ |
| 496 | for (po = AvMAX(comppad); po > padix_floor; po--) { |
| 497 | if (curpad[po] && !SvIMMORTAL(curpad[po])) |
| 498 | SvPADTMP_off(curpad[po]); |
| 499 | } |
| 500 | padix = padix_floor; |
| 501 | } |
| 502 | #endif |
| 503 | pad_reset_pending = FALSE; |
| 504 | } |
| 505 | |
| 506 | #ifdef USE_THREADS |
| 507 | /* find_threadsv is not reentrant */ |
| 508 | PADOFFSET |
| 509 | find_threadsv(char *name) |
| 510 | { |
| 511 | dTHR; |
| 512 | char *p; |
| 513 | PADOFFSET key; |
| 514 | SV **svp; |
| 515 | /* We currently only handle names of a single character */ |
| 516 | p = strchr(threadsv_names, *name); |
| 517 | if (!p) |
| 518 | return NOT_IN_PAD; |
| 519 | key = p - threadsv_names; |
| 520 | svp = av_fetch(thr->threadsv, key, FALSE); |
| 521 | if (!svp) { |
| 522 | SV *sv = NEWSV(0, 0); |
| 523 | av_store(thr->threadsv, key, sv); |
| 524 | thr->threadsvp = AvARRAY(thr->threadsv); |
| 525 | /* |
| 526 | * Some magic variables used to be automagically initialised |
| 527 | * in gv_fetchpv. Those which are now per-thread magicals get |
| 528 | * initialised here instead. |
| 529 | */ |
| 530 | switch (*name) { |
| 531 | case '_': |
| 532 | break; |
| 533 | case ';': |
| 534 | sv_setpv(sv, "\034"); |
| 535 | sv_magic(sv, 0, 0, name, 1); |
| 536 | break; |
| 537 | case '&': |
| 538 | case '`': |
| 539 | case '\'': |
| 540 | sawampersand = TRUE; |
| 541 | SvREADONLY_on(sv); |
| 542 | /* FALL THROUGH */ |
| 543 | |
| 544 | /* XXX %! tied to Errno.pm needs to be added here. |
| 545 | * See gv_fetchpv(). */ |
| 546 | /* case '!': */ |
| 547 | |
| 548 | default: |
| 549 | sv_magic(sv, 0, 0, name, 1); |
| 550 | } |
| 551 | DEBUG_L(PerlIO_printf(PerlIO_stderr(), |
| 552 | "find_threadsv: new SV %p for $%s%c\n", |
| 553 | sv, (*name < 32) ? "^" : "", |
| 554 | (*name < 32) ? toCTRL(*name) : *name)); |
| 555 | } |
| 556 | return key; |
| 557 | } |
| 558 | #endif /* USE_THREADS */ |
| 559 | |
| 560 | /* Destructor */ |
| 561 | |
| 562 | void |
| 563 | op_free(OP *o) |
| 564 | { |
| 565 | register OP *kid, *nextkid; |
| 566 | |
| 567 | if (!o || o->op_seq == (U16)-1) |
| 568 | return; |
| 569 | |
| 570 | if (o->op_flags & OPf_KIDS) { |
| 571 | for (kid = cUNOPo->op_first; kid; kid = nextkid) { |
| 572 | nextkid = kid->op_sibling; /* Get before next freeing kid */ |
| 573 | op_free(kid); |
| 574 | } |
| 575 | } |
| 576 | |
| 577 | switch (o->op_type) { |
| 578 | case OP_NULL: |
| 579 | o->op_targ = 0; /* Was holding old type, if any. */ |
| 580 | break; |
| 581 | case OP_ENTEREVAL: |
| 582 | o->op_targ = 0; /* Was holding hints. */ |
| 583 | break; |
| 584 | #ifdef USE_THREADS |
| 585 | case OP_THREADSV: |
| 586 | o->op_targ = 0; /* Was holding index into thr->threadsv AV. */ |
| 587 | break; |
| 588 | #endif /* USE_THREADS */ |
| 589 | default: |
| 590 | if (!(o->op_flags & OPf_REF) |
| 591 | || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst))) |
| 592 | break; |
| 593 | /* FALL THROUGH */ |
| 594 | case OP_GVSV: |
| 595 | case OP_GV: |
| 596 | case OP_AELEMFAST: |
| 597 | SvREFCNT_dec(cGVOPo->op_gv); |
| 598 | break; |
| 599 | case OP_NEXTSTATE: |
| 600 | case OP_DBSTATE: |
| 601 | Safefree(cCOPo->cop_label); |
| 602 | SvREFCNT_dec(cCOPo->cop_filegv); |
| 603 | break; |
| 604 | case OP_CONST: |
| 605 | SvREFCNT_dec(cSVOPo->op_sv); |
| 606 | break; |
| 607 | case OP_GOTO: |
| 608 | case OP_NEXT: |
| 609 | case OP_LAST: |
| 610 | case OP_REDO: |
| 611 | if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS)) |
| 612 | break; |
| 613 | /* FALL THROUGH */ |
| 614 | case OP_TRANS: |
| 615 | Safefree(cPVOPo->op_pv); |
| 616 | break; |
| 617 | case OP_SUBST: |
| 618 | op_free(cPMOPo->op_pmreplroot); |
| 619 | /* FALL THROUGH */ |
| 620 | case OP_PUSHRE: |
| 621 | case OP_MATCH: |
| 622 | ReREFCNT_dec(cPMOPo->op_pmregexp); |
| 623 | break; |
| 624 | } |
| 625 | |
| 626 | if (o->op_targ > 0) |
| 627 | pad_free(o->op_targ); |
| 628 | |
| 629 | Safefree(o); |
| 630 | } |
| 631 | |
| 632 | STATIC void |
| 633 | null(OP *o) |
| 634 | { |
| 635 | if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0) |
| 636 | pad_free(o->op_targ); |
| 637 | o->op_targ = o->op_type; |
| 638 | o->op_type = OP_NULL; |
| 639 | o->op_ppaddr = ppaddr[OP_NULL]; |
| 640 | } |
| 641 | |
| 642 | /* Contextualizers */ |
| 643 | |
| 644 | #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o)) |
| 645 | |
| 646 | OP * |
| 647 | linklist(OP *o) |
| 648 | { |
| 649 | register OP *kid; |
| 650 | |
| 651 | if (o->op_next) |
| 652 | return o->op_next; |
| 653 | |
| 654 | /* establish postfix order */ |
| 655 | if (cUNOPo->op_first) { |
| 656 | o->op_next = LINKLIST(cUNOPo->op_first); |
| 657 | for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) { |
| 658 | if (kid->op_sibling) |
| 659 | kid->op_next = LINKLIST(kid->op_sibling); |
| 660 | else |
| 661 | kid->op_next = o; |
| 662 | } |
| 663 | } |
| 664 | else |
| 665 | o->op_next = o; |
| 666 | |
| 667 | return o->op_next; |
| 668 | } |
| 669 | |
| 670 | OP * |
| 671 | scalarkids(OP *o) |
| 672 | { |
| 673 | OP *kid; |
| 674 | if (o && o->op_flags & OPf_KIDS) { |
| 675 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 676 | scalar(kid); |
| 677 | } |
| 678 | return o; |
| 679 | } |
| 680 | |
| 681 | STATIC OP * |
| 682 | scalarboolean(OP *o) |
| 683 | { |
| 684 | if (dowarn && |
| 685 | o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) { |
| 686 | dTHR; |
| 687 | line_t oldline = curcop->cop_line; |
| 688 | |
| 689 | if (copline != NOLINE) |
| 690 | curcop->cop_line = copline; |
| 691 | warn("Found = in conditional, should be =="); |
| 692 | curcop->cop_line = oldline; |
| 693 | } |
| 694 | return scalar(o); |
| 695 | } |
| 696 | |
| 697 | OP * |
| 698 | scalar(OP *o) |
| 699 | { |
| 700 | OP *kid; |
| 701 | |
| 702 | /* assumes no premature commitment */ |
| 703 | if (!o || (o->op_flags & OPf_WANT) || error_count |
| 704 | || o->op_type == OP_RETURN) |
| 705 | return o; |
| 706 | |
| 707 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR; |
| 708 | |
| 709 | switch (o->op_type) { |
| 710 | case OP_REPEAT: |
| 711 | if (o->op_private & OPpREPEAT_DOLIST) |
| 712 | null(((LISTOP*)cBINOPo->op_first)->op_first); |
| 713 | scalar(cBINOPo->op_first); |
| 714 | break; |
| 715 | case OP_OR: |
| 716 | case OP_AND: |
| 717 | case OP_COND_EXPR: |
| 718 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
| 719 | scalar(kid); |
| 720 | break; |
| 721 | case OP_SPLIT: |
| 722 | if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) { |
| 723 | if (!kPMOP->op_pmreplroot) |
| 724 | deprecate("implicit split to @_"); |
| 725 | } |
| 726 | /* FALL THROUGH */ |
| 727 | case OP_MATCH: |
| 728 | case OP_SUBST: |
| 729 | case OP_NULL: |
| 730 | default: |
| 731 | if (o->op_flags & OPf_KIDS) { |
| 732 | for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) |
| 733 | scalar(kid); |
| 734 | } |
| 735 | break; |
| 736 | case OP_LEAVE: |
| 737 | case OP_LEAVETRY: |
| 738 | kid = cLISTOPo->op_first; |
| 739 | scalar(kid); |
| 740 | while (kid = kid->op_sibling) { |
| 741 | if (kid->op_sibling) |
| 742 | scalarvoid(kid); |
| 743 | else |
| 744 | scalar(kid); |
| 745 | } |
| 746 | WITH_THR(curcop = &compiling); |
| 747 | break; |
| 748 | case OP_SCOPE: |
| 749 | case OP_LINESEQ: |
| 750 | case OP_LIST: |
| 751 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) { |
| 752 | if (kid->op_sibling) |
| 753 | scalarvoid(kid); |
| 754 | else |
| 755 | scalar(kid); |
| 756 | } |
| 757 | WITH_THR(curcop = &compiling); |
| 758 | break; |
| 759 | } |
| 760 | return o; |
| 761 | } |
| 762 | |
| 763 | OP * |
| 764 | scalarvoid(OP *o) |
| 765 | { |
| 766 | OP *kid; |
| 767 | char* useless = 0; |
| 768 | SV* sv; |
| 769 | |
| 770 | /* assumes no premature commitment */ |
| 771 | if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || error_count |
| 772 | || o->op_type == OP_RETURN) |
| 773 | return o; |
| 774 | |
| 775 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID; |
| 776 | |
| 777 | switch (o->op_type) { |
| 778 | default: |
| 779 | if (!(opargs[o->op_type] & OA_FOLDCONST)) |
| 780 | break; |
| 781 | /* FALL THROUGH */ |
| 782 | case OP_REPEAT: |
| 783 | if (o->op_flags & OPf_STACKED) |
| 784 | break; |
| 785 | /* FALL THROUGH */ |
| 786 | case OP_GVSV: |
| 787 | case OP_WANTARRAY: |
| 788 | case OP_GV: |
| 789 | case OP_PADSV: |
| 790 | case OP_PADAV: |
| 791 | case OP_PADHV: |
| 792 | case OP_PADANY: |
| 793 | case OP_AV2ARYLEN: |
| 794 | case OP_REF: |
| 795 | case OP_REFGEN: |
| 796 | case OP_SREFGEN: |
| 797 | case OP_DEFINED: |
| 798 | case OP_HEX: |
| 799 | case OP_OCT: |
| 800 | case OP_LENGTH: |
| 801 | case OP_SUBSTR: |
| 802 | case OP_VEC: |
| 803 | case OP_INDEX: |
| 804 | case OP_RINDEX: |
| 805 | case OP_SPRINTF: |
| 806 | case OP_AELEM: |
| 807 | case OP_AELEMFAST: |
| 808 | case OP_ASLICE: |
| 809 | case OP_HELEM: |
| 810 | case OP_HSLICE: |
| 811 | case OP_UNPACK: |
| 812 | case OP_PACK: |
| 813 | case OP_JOIN: |
| 814 | case OP_LSLICE: |
| 815 | case OP_ANONLIST: |
| 816 | case OP_ANONHASH: |
| 817 | case OP_SORT: |
| 818 | case OP_REVERSE: |
| 819 | case OP_RANGE: |
| 820 | case OP_FLIP: |
| 821 | case OP_FLOP: |
| 822 | case OP_CALLER: |
| 823 | case OP_FILENO: |
| 824 | case OP_EOF: |
| 825 | case OP_TELL: |
| 826 | case OP_GETSOCKNAME: |
| 827 | case OP_GETPEERNAME: |
| 828 | case OP_READLINK: |
| 829 | case OP_TELLDIR: |
| 830 | case OP_GETPPID: |
| 831 | case OP_GETPGRP: |
| 832 | case OP_GETPRIORITY: |
| 833 | case OP_TIME: |
| 834 | case OP_TMS: |
| 835 | case OP_LOCALTIME: |
| 836 | case OP_GMTIME: |
| 837 | case OP_GHBYNAME: |
| 838 | case OP_GHBYADDR: |
| 839 | case OP_GHOSTENT: |
| 840 | case OP_GNBYNAME: |
| 841 | case OP_GNBYADDR: |
| 842 | case OP_GNETENT: |
| 843 | case OP_GPBYNAME: |
| 844 | case OP_GPBYNUMBER: |
| 845 | case OP_GPROTOENT: |
| 846 | case OP_GSBYNAME: |
| 847 | case OP_GSBYPORT: |
| 848 | case OP_GSERVENT: |
| 849 | case OP_GPWNAM: |
| 850 | case OP_GPWUID: |
| 851 | case OP_GGRNAM: |
| 852 | case OP_GGRGID: |
| 853 | case OP_GETLOGIN: |
| 854 | if (!(o->op_private & OPpLVAL_INTRO)) |
| 855 | useless = op_desc[o->op_type]; |
| 856 | break; |
| 857 | |
| 858 | case OP_RV2GV: |
| 859 | case OP_RV2SV: |
| 860 | case OP_RV2AV: |
| 861 | case OP_RV2HV: |
| 862 | if (!(o->op_private & OPpLVAL_INTRO) && |
| 863 | (!o->op_sibling || o->op_sibling->op_type != OP_READLINE)) |
| 864 | useless = "a variable"; |
| 865 | break; |
| 866 | |
| 867 | case OP_NEXTSTATE: |
| 868 | case OP_DBSTATE: |
| 869 | WITH_THR(curcop = ((COP*)o)); /* for warning below */ |
| 870 | break; |
| 871 | |
| 872 | case OP_CONST: |
| 873 | sv = cSVOPo->op_sv; |
| 874 | if (dowarn) { |
| 875 | useless = "a constant"; |
| 876 | if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0)) |
| 877 | useless = 0; |
| 878 | else if (SvPOK(sv)) { |
| 879 | if (strnEQ(SvPVX(sv), "di", 2) || |
| 880 | strnEQ(SvPVX(sv), "ds", 2) || |
| 881 | strnEQ(SvPVX(sv), "ig", 2)) |
| 882 | useless = 0; |
| 883 | } |
| 884 | } |
| 885 | null(o); /* don't execute a constant */ |
| 886 | SvREFCNT_dec(sv); /* don't even remember it */ |
| 887 | break; |
| 888 | |
| 889 | case OP_POSTINC: |
| 890 | o->op_type = OP_PREINC; /* pre-increment is faster */ |
| 891 | o->op_ppaddr = ppaddr[OP_PREINC]; |
| 892 | break; |
| 893 | |
| 894 | case OP_POSTDEC: |
| 895 | o->op_type = OP_PREDEC; /* pre-decrement is faster */ |
| 896 | o->op_ppaddr = ppaddr[OP_PREDEC]; |
| 897 | break; |
| 898 | |
| 899 | case OP_OR: |
| 900 | case OP_AND: |
| 901 | case OP_COND_EXPR: |
| 902 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
| 903 | scalarvoid(kid); |
| 904 | break; |
| 905 | |
| 906 | case OP_NULL: |
| 907 | if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE) |
| 908 | WITH_THR(curcop = ((COP*)o)); /* for warning below */ |
| 909 | if (o->op_flags & OPf_STACKED) |
| 910 | break; |
| 911 | /* FALL THROUGH */ |
| 912 | case OP_ENTERTRY: |
| 913 | case OP_ENTER: |
| 914 | case OP_SCALAR: |
| 915 | if (!(o->op_flags & OPf_KIDS)) |
| 916 | break; |
| 917 | /* FALL THROUGH */ |
| 918 | case OP_SCOPE: |
| 919 | case OP_LEAVE: |
| 920 | case OP_LEAVETRY: |
| 921 | case OP_LEAVELOOP: |
| 922 | case OP_LINESEQ: |
| 923 | case OP_LIST: |
| 924 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 925 | scalarvoid(kid); |
| 926 | break; |
| 927 | case OP_ENTEREVAL: |
| 928 | scalarkids(o); |
| 929 | break; |
| 930 | case OP_REQUIRE: |
| 931 | /* all requires must return a boolean value */ |
| 932 | o->op_flags &= ~OPf_WANT; |
| 933 | return scalar(o); |
| 934 | case OP_SPLIT: |
| 935 | if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) { |
| 936 | if (!kPMOP->op_pmreplroot) |
| 937 | deprecate("implicit split to @_"); |
| 938 | } |
| 939 | break; |
| 940 | } |
| 941 | if (useless && dowarn) |
| 942 | warn("Useless use of %s in void context", useless); |
| 943 | return o; |
| 944 | } |
| 945 | |
| 946 | OP * |
| 947 | listkids(OP *o) |
| 948 | { |
| 949 | OP *kid; |
| 950 | if (o && o->op_flags & OPf_KIDS) { |
| 951 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 952 | list(kid); |
| 953 | } |
| 954 | return o; |
| 955 | } |
| 956 | |
| 957 | OP * |
| 958 | list(OP *o) |
| 959 | { |
| 960 | OP *kid; |
| 961 | |
| 962 | /* assumes no premature commitment */ |
| 963 | if (!o || (o->op_flags & OPf_WANT) || error_count |
| 964 | || o->op_type == OP_RETURN) |
| 965 | return o; |
| 966 | |
| 967 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST; |
| 968 | |
| 969 | switch (o->op_type) { |
| 970 | case OP_FLOP: |
| 971 | case OP_REPEAT: |
| 972 | list(cBINOPo->op_first); |
| 973 | break; |
| 974 | case OP_OR: |
| 975 | case OP_AND: |
| 976 | case OP_COND_EXPR: |
| 977 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
| 978 | list(kid); |
| 979 | break; |
| 980 | default: |
| 981 | case OP_MATCH: |
| 982 | case OP_SUBST: |
| 983 | case OP_NULL: |
| 984 | if (!(o->op_flags & OPf_KIDS)) |
| 985 | break; |
| 986 | if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) { |
| 987 | list(cBINOPo->op_first); |
| 988 | return gen_constant_list(o); |
| 989 | } |
| 990 | case OP_LIST: |
| 991 | listkids(o); |
| 992 | break; |
| 993 | case OP_LEAVE: |
| 994 | case OP_LEAVETRY: |
| 995 | kid = cLISTOPo->op_first; |
| 996 | list(kid); |
| 997 | while (kid = kid->op_sibling) { |
| 998 | if (kid->op_sibling) |
| 999 | scalarvoid(kid); |
| 1000 | else |
| 1001 | list(kid); |
| 1002 | } |
| 1003 | WITH_THR(curcop = &compiling); |
| 1004 | break; |
| 1005 | case OP_SCOPE: |
| 1006 | case OP_LINESEQ: |
| 1007 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) { |
| 1008 | if (kid->op_sibling) |
| 1009 | scalarvoid(kid); |
| 1010 | else |
| 1011 | list(kid); |
| 1012 | } |
| 1013 | WITH_THR(curcop = &compiling); |
| 1014 | break; |
| 1015 | case OP_REQUIRE: |
| 1016 | /* all requires must return a boolean value */ |
| 1017 | o->op_flags &= ~OPf_WANT; |
| 1018 | return scalar(o); |
| 1019 | } |
| 1020 | return o; |
| 1021 | } |
| 1022 | |
| 1023 | OP * |
| 1024 | scalarseq(OP *o) |
| 1025 | { |
| 1026 | OP *kid; |
| 1027 | |
| 1028 | if (o) { |
| 1029 | if (o->op_type == OP_LINESEQ || |
| 1030 | o->op_type == OP_SCOPE || |
| 1031 | o->op_type == OP_LEAVE || |
| 1032 | o->op_type == OP_LEAVETRY) |
| 1033 | { |
| 1034 | dTHR; |
| 1035 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) { |
| 1036 | if (kid->op_sibling) { |
| 1037 | scalarvoid(kid); |
| 1038 | } |
| 1039 | } |
| 1040 | curcop = &compiling; |
| 1041 | } |
| 1042 | o->op_flags &= ~OPf_PARENS; |
| 1043 | if (hints & HINT_BLOCK_SCOPE) |
| 1044 | o->op_flags |= OPf_PARENS; |
| 1045 | } |
| 1046 | else |
| 1047 | o = newOP(OP_STUB, 0); |
| 1048 | return o; |
| 1049 | } |
| 1050 | |
| 1051 | STATIC OP * |
| 1052 | modkids(OP *o, I32 type) |
| 1053 | { |
| 1054 | OP *kid; |
| 1055 | if (o && o->op_flags & OPf_KIDS) { |
| 1056 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 1057 | mod(kid, type); |
| 1058 | } |
| 1059 | return o; |
| 1060 | } |
| 1061 | |
| 1062 | OP * |
| 1063 | mod(OP *o, I32 type) |
| 1064 | { |
| 1065 | dTHR; |
| 1066 | OP *kid; |
| 1067 | SV *sv; |
| 1068 | |
| 1069 | if (!o || error_count) |
| 1070 | return o; |
| 1071 | |
| 1072 | switch (o->op_type) { |
| 1073 | case OP_UNDEF: |
| 1074 | modcount++; |
| 1075 | return o; |
| 1076 | case OP_CONST: |
| 1077 | if (!(o->op_private & (OPpCONST_ARYBASE))) |
| 1078 | goto nomod; |
| 1079 | if (eval_start && eval_start->op_type == OP_CONST) { |
| 1080 | compiling.cop_arybase = (I32)SvIV(((SVOP*)eval_start)->op_sv); |
| 1081 | eval_start = 0; |
| 1082 | } |
| 1083 | else if (!type) { |
| 1084 | SAVEI32(compiling.cop_arybase); |
| 1085 | compiling.cop_arybase = 0; |
| 1086 | } |
| 1087 | else if (type == OP_REFGEN) |
| 1088 | goto nomod; |
| 1089 | else |
| 1090 | croak("That use of $[ is unsupported"); |
| 1091 | break; |
| 1092 | case OP_STUB: |
| 1093 | if (o->op_flags & OPf_PARENS) |
| 1094 | break; |
| 1095 | goto nomod; |
| 1096 | case OP_ENTERSUB: |
| 1097 | if ((type == OP_UNDEF || type == OP_REFGEN) && |
| 1098 | !(o->op_flags & OPf_STACKED)) { |
| 1099 | o->op_type = OP_RV2CV; /* entersub => rv2cv */ |
| 1100 | o->op_ppaddr = ppaddr[OP_RV2CV]; |
| 1101 | assert(cUNOPo->op_first->op_type == OP_NULL); |
| 1102 | null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */ |
| 1103 | break; |
| 1104 | } |
| 1105 | /* FALL THROUGH */ |
| 1106 | default: |
| 1107 | nomod: |
| 1108 | /* grep, foreach, subcalls, refgen */ |
| 1109 | if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) |
| 1110 | break; |
| 1111 | yyerror(form("Can't modify %s in %s", |
| 1112 | op_desc[o->op_type], |
| 1113 | type ? op_desc[type] : "local")); |
| 1114 | return o; |
| 1115 | |
| 1116 | case OP_PREINC: |
| 1117 | case OP_PREDEC: |
| 1118 | case OP_POW: |
| 1119 | case OP_MULTIPLY: |
| 1120 | case OP_DIVIDE: |
| 1121 | case OP_MODULO: |
| 1122 | case OP_REPEAT: |
| 1123 | case OP_ADD: |
| 1124 | case OP_SUBTRACT: |
| 1125 | case OP_CONCAT: |
| 1126 | case OP_LEFT_SHIFT: |
| 1127 | case OP_RIGHT_SHIFT: |
| 1128 | case OP_BIT_AND: |
| 1129 | case OP_BIT_XOR: |
| 1130 | case OP_BIT_OR: |
| 1131 | case OP_I_MULTIPLY: |
| 1132 | case OP_I_DIVIDE: |
| 1133 | case OP_I_MODULO: |
| 1134 | case OP_I_ADD: |
| 1135 | case OP_I_SUBTRACT: |
| 1136 | if (!(o->op_flags & OPf_STACKED)) |
| 1137 | goto nomod; |
| 1138 | modcount++; |
| 1139 | break; |
| 1140 | |
| 1141 | case OP_COND_EXPR: |
| 1142 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
| 1143 | mod(kid, type); |
| 1144 | break; |
| 1145 | |
| 1146 | case OP_RV2AV: |
| 1147 | case OP_RV2HV: |
| 1148 | if (!type && cUNOPo->op_first->op_type != OP_GV) |
| 1149 | croak("Can't localize through a reference"); |
| 1150 | if (type == OP_REFGEN && o->op_flags & OPf_PARENS) { |
| 1151 | modcount = 10000; |
| 1152 | return o; /* Treat \(@foo) like ordinary list. */ |
| 1153 | } |
| 1154 | /* FALL THROUGH */ |
| 1155 | case OP_RV2GV: |
| 1156 | if (scalar_mod_type(o, type)) |
| 1157 | goto nomod; |
| 1158 | ref(cUNOPo->op_first, o->op_type); |
| 1159 | /* FALL THROUGH */ |
| 1160 | case OP_AASSIGN: |
| 1161 | case OP_ASLICE: |
| 1162 | case OP_HSLICE: |
| 1163 | case OP_NEXTSTATE: |
| 1164 | case OP_DBSTATE: |
| 1165 | case OP_REFGEN: |
| 1166 | case OP_CHOMP: |
| 1167 | modcount = 10000; |
| 1168 | break; |
| 1169 | case OP_RV2SV: |
| 1170 | if (!type && cUNOPo->op_first->op_type != OP_GV) |
| 1171 | croak("Can't localize through a reference"); |
| 1172 | ref(cUNOPo->op_first, o->op_type); |
| 1173 | /* FALL THROUGH */ |
| 1174 | case OP_GV: |
| 1175 | case OP_AV2ARYLEN: |
| 1176 | hints |= HINT_BLOCK_SCOPE; |
| 1177 | case OP_SASSIGN: |
| 1178 | case OP_AELEMFAST: |
| 1179 | modcount++; |
| 1180 | break; |
| 1181 | |
| 1182 | case OP_PADAV: |
| 1183 | case OP_PADHV: |
| 1184 | modcount = 10000; |
| 1185 | if (type == OP_REFGEN && o->op_flags & OPf_PARENS) |
| 1186 | return o; /* Treat \(@foo) like ordinary list. */ |
| 1187 | if (scalar_mod_type(o, type)) |
| 1188 | goto nomod; |
| 1189 | /* FALL THROUGH */ |
| 1190 | case OP_PADSV: |
| 1191 | modcount++; |
| 1192 | if (!type) |
| 1193 | croak("Can't localize lexical variable %s", |
| 1194 | SvPV(*av_fetch(comppad_name, o->op_targ, 4), na)); |
| 1195 | break; |
| 1196 | |
| 1197 | #ifdef USE_THREADS |
| 1198 | case OP_THREADSV: |
| 1199 | modcount++; /* XXX ??? */ |
| 1200 | break; |
| 1201 | #endif /* USE_THREADS */ |
| 1202 | |
| 1203 | case OP_PUSHMARK: |
| 1204 | break; |
| 1205 | |
| 1206 | case OP_KEYS: |
| 1207 | if (type != OP_SASSIGN) |
| 1208 | goto nomod; |
| 1209 | /* FALL THROUGH */ |
| 1210 | case OP_POS: |
| 1211 | case OP_VEC: |
| 1212 | case OP_SUBSTR: |
| 1213 | pad_free(o->op_targ); |
| 1214 | o->op_targ = pad_alloc(o->op_type, SVs_PADMY); |
| 1215 | assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL); |
| 1216 | if (o->op_flags & OPf_KIDS) |
| 1217 | mod(cBINOPo->op_first->op_sibling, type); |
| 1218 | break; |
| 1219 | |
| 1220 | case OP_AELEM: |
| 1221 | case OP_HELEM: |
| 1222 | ref(cBINOPo->op_first, o->op_type); |
| 1223 | if (type == OP_ENTERSUB && |
| 1224 | !(o->op_private & (OPpLVAL_INTRO | OPpDEREF))) |
| 1225 | o->op_private |= OPpLVAL_DEFER; |
| 1226 | modcount++; |
| 1227 | break; |
| 1228 | |
| 1229 | case OP_SCOPE: |
| 1230 | case OP_LEAVE: |
| 1231 | case OP_ENTER: |
| 1232 | if (o->op_flags & OPf_KIDS) |
| 1233 | mod(cLISTOPo->op_last, type); |
| 1234 | break; |
| 1235 | |
| 1236 | case OP_NULL: |
| 1237 | if (!(o->op_flags & OPf_KIDS)) |
| 1238 | break; |
| 1239 | if (o->op_targ != OP_LIST) { |
| 1240 | mod(cBINOPo->op_first, type); |
| 1241 | break; |
| 1242 | } |
| 1243 | /* FALL THROUGH */ |
| 1244 | case OP_LIST: |
| 1245 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 1246 | mod(kid, type); |
| 1247 | break; |
| 1248 | } |
| 1249 | o->op_flags |= OPf_MOD; |
| 1250 | |
| 1251 | if (type == OP_AASSIGN || type == OP_SASSIGN) |
| 1252 | o->op_flags |= OPf_SPECIAL|OPf_REF; |
| 1253 | else if (!type) { |
| 1254 | o->op_private |= OPpLVAL_INTRO; |
| 1255 | o->op_flags &= ~OPf_SPECIAL; |
| 1256 | hints |= HINT_BLOCK_SCOPE; |
| 1257 | } |
| 1258 | else if (type != OP_GREPSTART && type != OP_ENTERSUB) |
| 1259 | o->op_flags |= OPf_REF; |
| 1260 | return o; |
| 1261 | } |
| 1262 | |
| 1263 | static bool |
| 1264 | scalar_mod_type(OP *o, I32 type) |
| 1265 | { |
| 1266 | switch (type) { |
| 1267 | case OP_SASSIGN: |
| 1268 | if (o->op_type == OP_RV2GV) |
| 1269 | return FALSE; |
| 1270 | /* FALL THROUGH */ |
| 1271 | case OP_PREINC: |
| 1272 | case OP_PREDEC: |
| 1273 | case OP_POSTINC: |
| 1274 | case OP_POSTDEC: |
| 1275 | case OP_I_PREINC: |
| 1276 | case OP_I_PREDEC: |
| 1277 | case OP_I_POSTINC: |
| 1278 | case OP_I_POSTDEC: |
| 1279 | case OP_POW: |
| 1280 | case OP_MULTIPLY: |
| 1281 | case OP_DIVIDE: |
| 1282 | case OP_MODULO: |
| 1283 | case OP_REPEAT: |
| 1284 | case OP_ADD: |
| 1285 | case OP_SUBTRACT: |
| 1286 | case OP_I_MULTIPLY: |
| 1287 | case OP_I_DIVIDE: |
| 1288 | case OP_I_MODULO: |
| 1289 | case OP_I_ADD: |
| 1290 | case OP_I_SUBTRACT: |
| 1291 | case OP_LEFT_SHIFT: |
| 1292 | case OP_RIGHT_SHIFT: |
| 1293 | case OP_BIT_AND: |
| 1294 | case OP_BIT_XOR: |
| 1295 | case OP_BIT_OR: |
| 1296 | case OP_CONCAT: |
| 1297 | case OP_SUBST: |
| 1298 | case OP_TRANS: |
| 1299 | case OP_ANDASSIGN: /* may work later */ |
| 1300 | case OP_ORASSIGN: /* may work later */ |
| 1301 | return TRUE; |
| 1302 | default: |
| 1303 | return FALSE; |
| 1304 | } |
| 1305 | } |
| 1306 | |
| 1307 | OP * |
| 1308 | refkids(OP *o, I32 type) |
| 1309 | { |
| 1310 | OP *kid; |
| 1311 | if (o && o->op_flags & OPf_KIDS) { |
| 1312 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 1313 | ref(kid, type); |
| 1314 | } |
| 1315 | return o; |
| 1316 | } |
| 1317 | |
| 1318 | OP * |
| 1319 | ref(OP *o, I32 type) |
| 1320 | { |
| 1321 | OP *kid; |
| 1322 | |
| 1323 | if (!o || error_count) |
| 1324 | return o; |
| 1325 | |
| 1326 | switch (o->op_type) { |
| 1327 | case OP_ENTERSUB: |
| 1328 | if ((type == OP_DEFINED || type == OP_LOCK) && |
| 1329 | !(o->op_flags & OPf_STACKED)) { |
| 1330 | o->op_type = OP_RV2CV; /* entersub => rv2cv */ |
| 1331 | o->op_ppaddr = ppaddr[OP_RV2CV]; |
| 1332 | assert(cUNOPo->op_first->op_type == OP_NULL); |
| 1333 | null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */ |
| 1334 | o->op_flags |= OPf_SPECIAL; |
| 1335 | } |
| 1336 | break; |
| 1337 | |
| 1338 | case OP_COND_EXPR: |
| 1339 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
| 1340 | ref(kid, type); |
| 1341 | break; |
| 1342 | case OP_RV2SV: |
| 1343 | ref(cUNOPo->op_first, o->op_type); |
| 1344 | /* FALL THROUGH */ |
| 1345 | case OP_PADSV: |
| 1346 | if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) { |
| 1347 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
| 1348 | : type == OP_RV2HV ? OPpDEREF_HV |
| 1349 | : OPpDEREF_SV); |
| 1350 | o->op_flags |= OPf_MOD; |
| 1351 | } |
| 1352 | break; |
| 1353 | |
| 1354 | case OP_THREADSV: |
| 1355 | o->op_flags |= OPf_MOD; /* XXX ??? */ |
| 1356 | break; |
| 1357 | |
| 1358 | case OP_RV2AV: |
| 1359 | case OP_RV2HV: |
| 1360 | o->op_flags |= OPf_REF; |
| 1361 | /* FALL THROUGH */ |
| 1362 | case OP_RV2GV: |
| 1363 | ref(cUNOPo->op_first, o->op_type); |
| 1364 | break; |
| 1365 | |
| 1366 | case OP_PADAV: |
| 1367 | case OP_PADHV: |
| 1368 | o->op_flags |= OPf_REF; |
| 1369 | break; |
| 1370 | |
| 1371 | case OP_SCALAR: |
| 1372 | case OP_NULL: |
| 1373 | if (!(o->op_flags & OPf_KIDS)) |
| 1374 | break; |
| 1375 | ref(cBINOPo->op_first, type); |
| 1376 | break; |
| 1377 | case OP_AELEM: |
| 1378 | case OP_HELEM: |
| 1379 | ref(cBINOPo->op_first, o->op_type); |
| 1380 | if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) { |
| 1381 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
| 1382 | : type == OP_RV2HV ? OPpDEREF_HV |
| 1383 | : OPpDEREF_SV); |
| 1384 | o->op_flags |= OPf_MOD; |
| 1385 | } |
| 1386 | break; |
| 1387 | |
| 1388 | case OP_SCOPE: |
| 1389 | case OP_LEAVE: |
| 1390 | case OP_ENTER: |
| 1391 | case OP_LIST: |
| 1392 | if (!(o->op_flags & OPf_KIDS)) |
| 1393 | break; |
| 1394 | ref(cLISTOPo->op_last, type); |
| 1395 | break; |
| 1396 | default: |
| 1397 | break; |
| 1398 | } |
| 1399 | return scalar(o); |
| 1400 | |
| 1401 | } |
| 1402 | |
| 1403 | OP * |
| 1404 | my(OP *o) |
| 1405 | { |
| 1406 | OP *kid; |
| 1407 | I32 type; |
| 1408 | |
| 1409 | if (!o || error_count) |
| 1410 | return o; |
| 1411 | |
| 1412 | type = o->op_type; |
| 1413 | if (type == OP_LIST) { |
| 1414 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 1415 | my(kid); |
| 1416 | } else if (type == OP_UNDEF) { |
| 1417 | return o; |
| 1418 | } else if (type != OP_PADSV && |
| 1419 | type != OP_PADAV && |
| 1420 | type != OP_PADHV && |
| 1421 | type != OP_PUSHMARK) |
| 1422 | { |
| 1423 | yyerror(form("Can't declare %s in my", op_desc[o->op_type])); |
| 1424 | return o; |
| 1425 | } |
| 1426 | o->op_flags |= OPf_MOD; |
| 1427 | o->op_private |= OPpLVAL_INTRO; |
| 1428 | return o; |
| 1429 | } |
| 1430 | |
| 1431 | OP * |
| 1432 | sawparens(OP *o) |
| 1433 | { |
| 1434 | if (o) |
| 1435 | o->op_flags |= OPf_PARENS; |
| 1436 | return o; |
| 1437 | } |
| 1438 | |
| 1439 | OP * |
| 1440 | bind_match(I32 type, OP *left, OP *right) |
| 1441 | { |
| 1442 | OP *o; |
| 1443 | |
| 1444 | if (dowarn && |
| 1445 | (left->op_type == OP_RV2AV || |
| 1446 | left->op_type == OP_RV2HV || |
| 1447 | left->op_type == OP_PADAV || |
| 1448 | left->op_type == OP_PADHV)) { |
| 1449 | char *desc = op_desc[(right->op_type == OP_SUBST || |
| 1450 | right->op_type == OP_TRANS) |
| 1451 | ? right->op_type : OP_MATCH]; |
| 1452 | char *sample = ((left->op_type == OP_RV2AV || |
| 1453 | left->op_type == OP_PADAV) |
| 1454 | ? "@array" : "%hash"); |
| 1455 | warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample); |
| 1456 | } |
| 1457 | |
| 1458 | if (right->op_type == OP_MATCH || |
| 1459 | right->op_type == OP_SUBST || |
| 1460 | right->op_type == OP_TRANS) { |
| 1461 | right->op_flags |= OPf_STACKED; |
| 1462 | if (right->op_type != OP_MATCH) |
| 1463 | left = mod(left, right->op_type); |
| 1464 | if (right->op_type == OP_TRANS) |
| 1465 | o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right); |
| 1466 | else |
| 1467 | o = prepend_elem(right->op_type, scalar(left), right); |
| 1468 | if (type == OP_NOT) |
| 1469 | return newUNOP(OP_NOT, 0, scalar(o)); |
| 1470 | return o; |
| 1471 | } |
| 1472 | else |
| 1473 | return bind_match(type, left, |
| 1474 | pmruntime(newPMOP(OP_MATCH, 0), right, Nullop)); |
| 1475 | } |
| 1476 | |
| 1477 | OP * |
| 1478 | invert(OP *o) |
| 1479 | { |
| 1480 | if (!o) |
| 1481 | return o; |
| 1482 | /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */ |
| 1483 | return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o)); |
| 1484 | } |
| 1485 | |
| 1486 | OP * |
| 1487 | scope(OP *o) |
| 1488 | { |
| 1489 | if (o) { |
| 1490 | if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || tainting) { |
| 1491 | o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o); |
| 1492 | o->op_type = OP_LEAVE; |
| 1493 | o->op_ppaddr = ppaddr[OP_LEAVE]; |
| 1494 | } |
| 1495 | else { |
| 1496 | if (o->op_type == OP_LINESEQ) { |
| 1497 | OP *kid; |
| 1498 | o->op_type = OP_SCOPE; |
| 1499 | o->op_ppaddr = ppaddr[OP_SCOPE]; |
| 1500 | kid = ((LISTOP*)o)->op_first; |
| 1501 | if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){ |
| 1502 | SvREFCNT_dec(((COP*)kid)->cop_filegv); |
| 1503 | null(kid); |
| 1504 | } |
| 1505 | } |
| 1506 | else |
| 1507 | o = newLISTOP(OP_SCOPE, 0, o, Nullop); |
| 1508 | } |
| 1509 | } |
| 1510 | return o; |
| 1511 | } |
| 1512 | |
| 1513 | int |
| 1514 | block_start(int full) |
| 1515 | { |
| 1516 | dTHR; |
| 1517 | int retval = savestack_ix; |
| 1518 | SAVEI32(comppad_name_floor); |
| 1519 | if (full) { |
| 1520 | if ((comppad_name_fill = AvFILLp(comppad_name)) > 0) |
| 1521 | comppad_name_floor = comppad_name_fill; |
| 1522 | else |
| 1523 | comppad_name_floor = 0; |
| 1524 | } |
| 1525 | SAVEI32(min_intro_pending); |
| 1526 | SAVEI32(max_intro_pending); |
| 1527 | min_intro_pending = 0; |
| 1528 | SAVEI32(comppad_name_fill); |
| 1529 | SAVEI32(padix_floor); |
| 1530 | padix_floor = padix; |
| 1531 | pad_reset_pending = FALSE; |
| 1532 | SAVEI32(hints); |
| 1533 | hints &= ~HINT_BLOCK_SCOPE; |
| 1534 | return retval; |
| 1535 | } |
| 1536 | |
| 1537 | OP* |
| 1538 | block_end(I32 floor, OP *seq) |
| 1539 | { |
| 1540 | dTHR; |
| 1541 | int needblockscope = hints & HINT_BLOCK_SCOPE; |
| 1542 | OP* retval = scalarseq(seq); |
| 1543 | LEAVE_SCOPE(floor); |
| 1544 | pad_reset_pending = FALSE; |
| 1545 | if (needblockscope) |
| 1546 | hints |= HINT_BLOCK_SCOPE; /* propagate out */ |
| 1547 | pad_leavemy(comppad_name_fill); |
| 1548 | cop_seqmax++; |
| 1549 | return retval; |
| 1550 | } |
| 1551 | |
| 1552 | STATIC OP * |
| 1553 | newDEFSVOP(void) |
| 1554 | { |
| 1555 | #ifdef USE_THREADS |
| 1556 | OP *o = newOP(OP_THREADSV, 0); |
| 1557 | o->op_targ = find_threadsv("_"); |
| 1558 | return o; |
| 1559 | #else |
| 1560 | return newSVREF(newGVOP(OP_GV, 0, defgv)); |
| 1561 | #endif /* USE_THREADS */ |
| 1562 | } |
| 1563 | |
| 1564 | void |
| 1565 | newPROG(OP *o) |
| 1566 | { |
| 1567 | dTHR; |
| 1568 | if (in_eval) { |
| 1569 | eval_root = newUNOP(OP_LEAVEEVAL, ((in_eval & 4) ? OPf_SPECIAL : 0), o); |
| 1570 | eval_start = linklist(eval_root); |
| 1571 | eval_root->op_next = 0; |
| 1572 | peep(eval_start); |
| 1573 | } |
| 1574 | else { |
| 1575 | if (!o) |
| 1576 | return; |
| 1577 | main_root = scope(sawparens(scalarvoid(o))); |
| 1578 | curcop = &compiling; |
| 1579 | main_start = LINKLIST(main_root); |
| 1580 | main_root->op_next = 0; |
| 1581 | peep(main_start); |
| 1582 | compcv = 0; |
| 1583 | |
| 1584 | /* Register with debugger */ |
| 1585 | if (PERLDB_INTER) { |
| 1586 | CV *cv = perl_get_cv("DB::postponed", FALSE); |
| 1587 | if (cv) { |
| 1588 | dSP; |
| 1589 | PUSHMARK(SP); |
| 1590 | XPUSHs((SV*)compiling.cop_filegv); |
| 1591 | PUTBACK; |
| 1592 | perl_call_sv((SV*)cv, G_DISCARD); |
| 1593 | } |
| 1594 | } |
| 1595 | } |
| 1596 | } |
| 1597 | |
| 1598 | OP * |
| 1599 | localize(OP *o, I32 lex) |
| 1600 | { |
| 1601 | if (o->op_flags & OPf_PARENS) |
| 1602 | list(o); |
| 1603 | else { |
| 1604 | if (dowarn && bufptr > oldbufptr && bufptr[-1] == ',') { |
| 1605 | char *s; |
| 1606 | for (s = bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ; |
| 1607 | if (*s == ';' || *s == '=') |
| 1608 | warn("Parens missing around \"%s\" list", lex ? "my" : "local"); |
| 1609 | } |
| 1610 | } |
| 1611 | in_my = FALSE; |
| 1612 | in_my_stash = Nullhv; |
| 1613 | if (lex) |
| 1614 | return my(o); |
| 1615 | else |
| 1616 | return mod(o, OP_NULL); /* a bit kludgey */ |
| 1617 | } |
| 1618 | |
| 1619 | OP * |
| 1620 | jmaybe(OP *o) |
| 1621 | { |
| 1622 | if (o->op_type == OP_LIST) { |
| 1623 | OP *o2; |
| 1624 | #ifdef USE_THREADS |
| 1625 | o2 = newOP(OP_THREADSV, 0); |
| 1626 | o2->op_targ = find_threadsv(";"); |
| 1627 | #else |
| 1628 | o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))), |
| 1629 | #endif /* USE_THREADS */ |
| 1630 | o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o)); |
| 1631 | } |
| 1632 | return o; |
| 1633 | } |
| 1634 | |
| 1635 | OP * |
| 1636 | fold_constants(register OP *o) |
| 1637 | { |
| 1638 | dTHR; |
| 1639 | register OP *curop; |
| 1640 | I32 type = o->op_type; |
| 1641 | SV *sv; |
| 1642 | |
| 1643 | if (opargs[type] & OA_RETSCALAR) |
| 1644 | scalar(o); |
| 1645 | if (opargs[type] & OA_TARGET) |
| 1646 | o->op_targ = pad_alloc(type, SVs_PADTMP); |
| 1647 | |
| 1648 | if ((opargs[type] & OA_OTHERINT) && (hints & HINT_INTEGER)) |
| 1649 | o->op_ppaddr = ppaddr[type = ++(o->op_type)]; |
| 1650 | |
| 1651 | if (!(opargs[type] & OA_FOLDCONST)) |
| 1652 | goto nope; |
| 1653 | |
| 1654 | switch (type) { |
| 1655 | case OP_SPRINTF: |
| 1656 | case OP_UCFIRST: |
| 1657 | case OP_LCFIRST: |
| 1658 | case OP_UC: |
| 1659 | case OP_LC: |
| 1660 | case OP_SLT: |
| 1661 | case OP_SGT: |
| 1662 | case OP_SLE: |
| 1663 | case OP_SGE: |
| 1664 | case OP_SCMP: |
| 1665 | |
| 1666 | if (o->op_private & OPpLOCALE) |
| 1667 | goto nope; |
| 1668 | } |
| 1669 | |
| 1670 | if (error_count) |
| 1671 | goto nope; /* Don't try to run w/ errors */ |
| 1672 | |
| 1673 | for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) { |
| 1674 | if (curop->op_type != OP_CONST && |
| 1675 | curop->op_type != OP_LIST && |
| 1676 | curop->op_type != OP_SCALAR && |
| 1677 | curop->op_type != OP_NULL && |
| 1678 | curop->op_type != OP_PUSHMARK) { |
| 1679 | goto nope; |
| 1680 | } |
| 1681 | } |
| 1682 | |
| 1683 | curop = LINKLIST(o); |
| 1684 | o->op_next = 0; |
| 1685 | op = curop; |
| 1686 | CALLRUNOPS(); |
| 1687 | sv = *(stack_sp--); |
| 1688 | if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */ |
| 1689 | pad_swipe(o->op_targ); |
| 1690 | else if (SvTEMP(sv)) { /* grab mortal temp? */ |
| 1691 | (void)SvREFCNT_inc(sv); |
| 1692 | SvTEMP_off(sv); |
| 1693 | } |
| 1694 | op_free(o); |
| 1695 | if (type == OP_RV2GV) |
| 1696 | return newGVOP(OP_GV, 0, (GV*)sv); |
| 1697 | else { |
| 1698 | /* try to smush double to int, but don't smush -2.0 to -2 */ |
| 1699 | if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK && |
| 1700 | type != OP_NEGATE) |
| 1701 | { |
| 1702 | IV iv = SvIV(sv); |
| 1703 | if ((double)iv == SvNV(sv)) { |
| 1704 | SvREFCNT_dec(sv); |
| 1705 | sv = newSViv(iv); |
| 1706 | } |
| 1707 | else |
| 1708 | SvIOK_off(sv); /* undo SvIV() damage */ |
| 1709 | } |
| 1710 | return newSVOP(OP_CONST, 0, sv); |
| 1711 | } |
| 1712 | |
| 1713 | nope: |
| 1714 | if (!(opargs[type] & OA_OTHERINT)) |
| 1715 | return o; |
| 1716 | |
| 1717 | if (!(hints & HINT_INTEGER)) { |
| 1718 | if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS)) |
| 1719 | return o; |
| 1720 | |
| 1721 | for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) { |
| 1722 | if (curop->op_type == OP_CONST) { |
| 1723 | if (SvIOK(((SVOP*)curop)->op_sv)) |
| 1724 | continue; |
| 1725 | return o; |
| 1726 | } |
| 1727 | if (opargs[curop->op_type] & OA_RETINTEGER) |
| 1728 | continue; |
| 1729 | return o; |
| 1730 | } |
| 1731 | o->op_ppaddr = ppaddr[++(o->op_type)]; |
| 1732 | } |
| 1733 | |
| 1734 | return o; |
| 1735 | } |
| 1736 | |
| 1737 | OP * |
| 1738 | gen_constant_list(register OP *o) |
| 1739 | { |
| 1740 | dTHR; |
| 1741 | register OP *curop; |
| 1742 | I32 oldtmps_floor = tmps_floor; |
| 1743 | |
| 1744 | list(o); |
| 1745 | if (error_count) |
| 1746 | return o; /* Don't attempt to run with errors */ |
| 1747 | |
| 1748 | op = curop = LINKLIST(o); |
| 1749 | o->op_next = 0; |
| 1750 | pp_pushmark(ARGS); |
| 1751 | CALLRUNOPS(); |
| 1752 | op = curop; |
| 1753 | pp_anonlist(ARGS); |
| 1754 | tmps_floor = oldtmps_floor; |
| 1755 | |
| 1756 | o->op_type = OP_RV2AV; |
| 1757 | o->op_ppaddr = ppaddr[OP_RV2AV]; |
| 1758 | curop = ((UNOP*)o)->op_first; |
| 1759 | ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*stack_sp--)); |
| 1760 | op_free(curop); |
| 1761 | linklist(o); |
| 1762 | return list(o); |
| 1763 | } |
| 1764 | |
| 1765 | OP * |
| 1766 | convert(I32 type, I32 flags, OP *o) |
| 1767 | { |
| 1768 | OP *kid; |
| 1769 | OP *last = 0; |
| 1770 | |
| 1771 | if (!o || o->op_type != OP_LIST) |
| 1772 | o = newLISTOP(OP_LIST, 0, o, Nullop); |
| 1773 | else |
| 1774 | o->op_flags &= ~OPf_WANT; |
| 1775 | |
| 1776 | if (!(opargs[type] & OA_MARK)) |
| 1777 | null(cLISTOPo->op_first); |
| 1778 | |
| 1779 | o->op_type = type; |
| 1780 | o->op_ppaddr = ppaddr[type]; |
| 1781 | o->op_flags |= flags; |
| 1782 | |
| 1783 | o = CHECKOP(type, o); |
| 1784 | if (o->op_type != type) |
| 1785 | return o; |
| 1786 | |
| 1787 | if (cLISTOPo->op_children < 7) { |
| 1788 | /* XXX do we really need to do this if we're done appending?? */ |
| 1789 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
| 1790 | last = kid; |
| 1791 | cLISTOPo->op_last = last; /* in case check substituted last arg */ |
| 1792 | } |
| 1793 | |
| 1794 | return fold_constants(o); |
| 1795 | } |
| 1796 | |
| 1797 | /* List constructors */ |
| 1798 | |
| 1799 | OP * |
| 1800 | append_elem(I32 type, OP *first, OP *last) |
| 1801 | { |
| 1802 | if (!first) |
| 1803 | return last; |
| 1804 | |
| 1805 | if (!last) |
| 1806 | return first; |
| 1807 | |
| 1808 | if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS) |
| 1809 | return newLISTOP(type, 0, first, last); |
| 1810 | |
| 1811 | if (first->op_flags & OPf_KIDS) |
| 1812 | ((LISTOP*)first)->op_last->op_sibling = last; |
| 1813 | else { |
| 1814 | first->op_flags |= OPf_KIDS; |
| 1815 | ((LISTOP*)first)->op_first = last; |
| 1816 | } |
| 1817 | ((LISTOP*)first)->op_last = last; |
| 1818 | ((LISTOP*)first)->op_children++; |
| 1819 | return first; |
| 1820 | } |
| 1821 | |
| 1822 | OP * |
| 1823 | append_list(I32 type, LISTOP *first, LISTOP *last) |
| 1824 | { |
| 1825 | if (!first) |
| 1826 | return (OP*)last; |
| 1827 | |
| 1828 | if (!last) |
| 1829 | return (OP*)first; |
| 1830 | |
| 1831 | if (first->op_type != type) |
| 1832 | return prepend_elem(type, (OP*)first, (OP*)last); |
| 1833 | |
| 1834 | if (last->op_type != type) |
| 1835 | return append_elem(type, (OP*)first, (OP*)last); |
| 1836 | |
| 1837 | first->op_last->op_sibling = last->op_first; |
| 1838 | first->op_last = last->op_last; |
| 1839 | first->op_children += last->op_children; |
| 1840 | if (first->op_children) |
| 1841 | last->op_flags |= OPf_KIDS; |
| 1842 | |
| 1843 | Safefree(last); |
| 1844 | return (OP*)first; |
| 1845 | } |
| 1846 | |
| 1847 | OP * |
| 1848 | prepend_elem(I32 type, OP *first, OP *last) |
| 1849 | { |
| 1850 | if (!first) |
| 1851 | return last; |
| 1852 | |
| 1853 | if (!last) |
| 1854 | return first; |
| 1855 | |
| 1856 | if (last->op_type == type) { |
| 1857 | if (type == OP_LIST) { /* already a PUSHMARK there */ |
| 1858 | first->op_sibling = ((LISTOP*)last)->op_first->op_sibling; |
| 1859 | ((LISTOP*)last)->op_first->op_sibling = first; |
| 1860 | } |
| 1861 | else { |
| 1862 | if (!(last->op_flags & OPf_KIDS)) { |
| 1863 | ((LISTOP*)last)->op_last = first; |
| 1864 | last->op_flags |= OPf_KIDS; |
| 1865 | } |
| 1866 | first->op_sibling = ((LISTOP*)last)->op_first; |
| 1867 | ((LISTOP*)last)->op_first = first; |
| 1868 | } |
| 1869 | ((LISTOP*)last)->op_children++; |
| 1870 | return last; |
| 1871 | } |
| 1872 | |
| 1873 | return newLISTOP(type, 0, first, last); |
| 1874 | } |
| 1875 | |
| 1876 | /* Constructors */ |
| 1877 | |
| 1878 | OP * |
| 1879 | newNULLLIST(void) |
| 1880 | { |
| 1881 | return newOP(OP_STUB, 0); |
| 1882 | } |
| 1883 | |
| 1884 | OP * |
| 1885 | force_list(OP *o) |
| 1886 | { |
| 1887 | if (!o || o->op_type != OP_LIST) |
| 1888 | o = newLISTOP(OP_LIST, 0, o, Nullop); |
| 1889 | null(o); |
| 1890 | return o; |
| 1891 | } |
| 1892 | |
| 1893 | OP * |
| 1894 | newLISTOP(I32 type, I32 flags, OP *first, OP *last) |
| 1895 | { |
| 1896 | LISTOP *listop; |
| 1897 | |
| 1898 | Newz(1101, listop, 1, LISTOP); |
| 1899 | |
| 1900 | listop->op_type = type; |
| 1901 | listop->op_ppaddr = ppaddr[type]; |
| 1902 | listop->op_children = (first != 0) + (last != 0); |
| 1903 | listop->op_flags = flags; |
| 1904 | |
| 1905 | if (!last && first) |
| 1906 | last = first; |
| 1907 | else if (!first && last) |
| 1908 | first = last; |
| 1909 | else if (first) |
| 1910 | first->op_sibling = last; |
| 1911 | listop->op_first = first; |
| 1912 | listop->op_last = last; |
| 1913 | if (type == OP_LIST) { |
| 1914 | OP* pushop; |
| 1915 | pushop = newOP(OP_PUSHMARK, 0); |
| 1916 | pushop->op_sibling = first; |
| 1917 | listop->op_first = pushop; |
| 1918 | listop->op_flags |= OPf_KIDS; |
| 1919 | if (!last) |
| 1920 | listop->op_last = pushop; |
| 1921 | } |
| 1922 | else if (listop->op_children) |
| 1923 | listop->op_flags |= OPf_KIDS; |
| 1924 | |
| 1925 | return (OP*)listop; |
| 1926 | } |
| 1927 | |
| 1928 | OP * |
| 1929 | newOP(I32 type, I32 flags) |
| 1930 | { |
| 1931 | OP *o; |
| 1932 | Newz(1101, o, 1, OP); |
| 1933 | o->op_type = type; |
| 1934 | o->op_ppaddr = ppaddr[type]; |
| 1935 | o->op_flags = flags; |
| 1936 | |
| 1937 | o->op_next = o; |
| 1938 | o->op_private = 0 + (flags >> 8); |
| 1939 | if (opargs[type] & OA_RETSCALAR) |
| 1940 | scalar(o); |
| 1941 | if (opargs[type] & OA_TARGET) |
| 1942 | o->op_targ = pad_alloc(type, SVs_PADTMP); |
| 1943 | return CHECKOP(type, o); |
| 1944 | } |
| 1945 | |
| 1946 | OP * |
| 1947 | newUNOP(I32 type, I32 flags, OP *first) |
| 1948 | { |
| 1949 | UNOP *unop; |
| 1950 | |
| 1951 | if (!first) |
| 1952 | first = newOP(OP_STUB, 0); |
| 1953 | if (opargs[type] & OA_MARK) |
| 1954 | first = force_list(first); |
| 1955 | |
| 1956 | Newz(1101, unop, 1, UNOP); |
| 1957 | unop->op_type = type; |
| 1958 | unop->op_ppaddr = ppaddr[type]; |
| 1959 | unop->op_first = first; |
| 1960 | unop->op_flags = flags | OPf_KIDS; |
| 1961 | unop->op_private = 1 | (flags >> 8); |
| 1962 | #if 1 |
| 1963 | if(type == OP_STUDY && first->op_type == OP_MATCH) { |
| 1964 | first->op_type = OP_PUSHRE; |
| 1965 | first->op_ppaddr = ppaddr[OP_PUSHRE]; |
| 1966 | } |
| 1967 | #endif |
| 1968 | unop = (UNOP*) CHECKOP(type, unop); |
| 1969 | if (unop->op_next) |
| 1970 | return (OP*)unop; |
| 1971 | |
| 1972 | return fold_constants((OP *) unop); |
| 1973 | } |
| 1974 | |
| 1975 | OP * |
| 1976 | newBINOP(I32 type, I32 flags, OP *first, OP *last) |
| 1977 | { |
| 1978 | BINOP *binop; |
| 1979 | Newz(1101, binop, 1, BINOP); |
| 1980 | |
| 1981 | if (!first) |
| 1982 | first = newOP(OP_NULL, 0); |
| 1983 | |
| 1984 | binop->op_type = type; |
| 1985 | binop->op_ppaddr = ppaddr[type]; |
| 1986 | binop->op_first = first; |
| 1987 | binop->op_flags = flags | OPf_KIDS; |
| 1988 | if (!last) { |
| 1989 | last = first; |
| 1990 | binop->op_private = 1 | (flags >> 8); |
| 1991 | } |
| 1992 | else { |
| 1993 | binop->op_private = 2 | (flags >> 8); |
| 1994 | first->op_sibling = last; |
| 1995 | } |
| 1996 | |
| 1997 | binop = (BINOP*)CHECKOP(type, binop); |
| 1998 | if (binop->op_next) |
| 1999 | return (OP*)binop; |
| 2000 | |
| 2001 | binop->op_last = last = binop->op_first->op_sibling; |
| 2002 | |
| 2003 | return fold_constants((OP *)binop); |
| 2004 | } |
| 2005 | |
| 2006 | OP * |
| 2007 | pmtrans(OP *o, OP *expr, OP *repl) |
| 2008 | { |
| 2009 | SV *tstr = ((SVOP*)expr)->op_sv; |
| 2010 | SV *rstr = ((SVOP*)repl)->op_sv; |
| 2011 | STRLEN tlen; |
| 2012 | STRLEN rlen; |
| 2013 | register U8 *t = (U8*)SvPV(tstr, tlen); |
| 2014 | register U8 *r = (U8*)SvPV(rstr, rlen); |
| 2015 | register I32 i; |
| 2016 | register I32 j; |
| 2017 | I32 Delete; |
| 2018 | I32 complement; |
| 2019 | I32 squash; |
| 2020 | register short *tbl; |
| 2021 | |
| 2022 | tbl = (short*)cPVOPo->op_pv; |
| 2023 | complement = o->op_private & OPpTRANS_COMPLEMENT; |
| 2024 | Delete = o->op_private & OPpTRANS_DELETE; |
| 2025 | squash = o->op_private & OPpTRANS_SQUASH; |
| 2026 | |
| 2027 | if (complement) { |
| 2028 | Zero(tbl, 256, short); |
| 2029 | for (i = 0; i < tlen; i++) |
| 2030 | tbl[t[i]] = -1; |
| 2031 | for (i = 0, j = 0; i < 256; i++) { |
| 2032 | if (!tbl[i]) { |
| 2033 | if (j >= rlen) { |
| 2034 | if (Delete) |
| 2035 | tbl[i] = -2; |
| 2036 | else if (rlen) |
| 2037 | tbl[i] = r[j-1]; |
| 2038 | else |
| 2039 | tbl[i] = i; |
| 2040 | } |
| 2041 | else |
| 2042 | tbl[i] = r[j++]; |
| 2043 | } |
| 2044 | } |
| 2045 | } |
| 2046 | else { |
| 2047 | if (!rlen && !Delete) { |
| 2048 | r = t; rlen = tlen; |
| 2049 | if (!squash) |
| 2050 | o->op_private |= OPpTRANS_COUNTONLY; |
| 2051 | } |
| 2052 | for (i = 0; i < 256; i++) |
| 2053 | tbl[i] = -1; |
| 2054 | for (i = 0, j = 0; i < tlen; i++,j++) { |
| 2055 | if (j >= rlen) { |
| 2056 | if (Delete) { |
| 2057 | if (tbl[t[i]] == -1) |
| 2058 | tbl[t[i]] = -2; |
| 2059 | continue; |
| 2060 | } |
| 2061 | --j; |
| 2062 | } |
| 2063 | if (tbl[t[i]] == -1) |
| 2064 | tbl[t[i]] = r[j]; |
| 2065 | } |
| 2066 | } |
| 2067 | op_free(expr); |
| 2068 | op_free(repl); |
| 2069 | |
| 2070 | return o; |
| 2071 | } |
| 2072 | |
| 2073 | OP * |
| 2074 | newPMOP(I32 type, I32 flags) |
| 2075 | { |
| 2076 | dTHR; |
| 2077 | PMOP *pmop; |
| 2078 | |
| 2079 | Newz(1101, pmop, 1, PMOP); |
| 2080 | pmop->op_type = type; |
| 2081 | pmop->op_ppaddr = ppaddr[type]; |
| 2082 | pmop->op_flags = flags; |
| 2083 | pmop->op_private = 0 | (flags >> 8); |
| 2084 | |
| 2085 | if (hints & HINT_LOCALE) |
| 2086 | pmop->op_pmpermflags = (pmop->op_pmflags |= PMf_LOCALE); |
| 2087 | |
| 2088 | /* link into pm list */ |
| 2089 | if (type != OP_TRANS && curstash) { |
| 2090 | pmop->op_pmnext = HvPMROOT(curstash); |
| 2091 | HvPMROOT(curstash) = pmop; |
| 2092 | } |
| 2093 | |
| 2094 | return (OP*)pmop; |
| 2095 | } |
| 2096 | |
| 2097 | OP * |
| 2098 | pmruntime(OP *o, OP *expr, OP *repl) |
| 2099 | { |
| 2100 | PMOP *pm; |
| 2101 | LOGOP *rcop; |
| 2102 | I32 repl_has_vars = 0; |
| 2103 | |
| 2104 | if (o->op_type == OP_TRANS) |
| 2105 | return pmtrans(o, expr, repl); |
| 2106 | |
| 2107 | hints |= HINT_BLOCK_SCOPE; |
| 2108 | pm = (PMOP*)o; |
| 2109 | |
| 2110 | if (expr->op_type == OP_CONST) { |
| 2111 | STRLEN plen; |
| 2112 | SV *pat = ((SVOP*)expr)->op_sv; |
| 2113 | char *p = SvPV(pat, plen); |
| 2114 | if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) { |
| 2115 | sv_setpvn(pat, "\\s+", 3); |
| 2116 | p = SvPV(pat, plen); |
| 2117 | pm->op_pmflags |= PMf_SKIPWHITE; |
| 2118 | } |
| 2119 | pm->op_pmregexp = pregcomp(p, p + plen, pm); |
| 2120 | if (strEQ("\\s+", pm->op_pmregexp->precomp)) |
| 2121 | pm->op_pmflags |= PMf_WHITE; |
| 2122 | op_free(expr); |
| 2123 | } |
| 2124 | else { |
| 2125 | if (pm->op_pmflags & PMf_KEEP) |
| 2126 | expr = newUNOP(OP_REGCMAYBE,0,expr); |
| 2127 | |
| 2128 | Newz(1101, rcop, 1, LOGOP); |
| 2129 | rcop->op_type = OP_REGCOMP; |
| 2130 | rcop->op_ppaddr = ppaddr[OP_REGCOMP]; |
| 2131 | rcop->op_first = scalar(expr); |
| 2132 | rcop->op_flags |= OPf_KIDS; |
| 2133 | rcop->op_private = 1; |
| 2134 | rcop->op_other = o; |
| 2135 | |
| 2136 | /* establish postfix order */ |
| 2137 | if (pm->op_pmflags & PMf_KEEP) { |
| 2138 | LINKLIST(expr); |
| 2139 | rcop->op_next = expr; |
| 2140 | ((UNOP*)expr)->op_first->op_next = (OP*)rcop; |
| 2141 | } |
| 2142 | else { |
| 2143 | rcop->op_next = LINKLIST(expr); |
| 2144 | expr->op_next = (OP*)rcop; |
| 2145 | } |
| 2146 | |
| 2147 | prepend_elem(o->op_type, scalar((OP*)rcop), o); |
| 2148 | } |
| 2149 | |
| 2150 | if (repl) { |
| 2151 | OP *curop; |
| 2152 | if (pm->op_pmflags & PMf_EVAL) |
| 2153 | curop = 0; |
| 2154 | #ifdef USE_THREADS |
| 2155 | else if (repl->op_type == OP_THREADSV |
| 2156 | && strchr("&`'123456789+", |
| 2157 | threadsv_names[repl->op_targ])) |
| 2158 | { |
| 2159 | curop = 0; |
| 2160 | } |
| 2161 | #endif /* USE_THREADS */ |
| 2162 | else if (repl->op_type == OP_CONST) |
| 2163 | curop = repl; |
| 2164 | else { |
| 2165 | OP *lastop = 0; |
| 2166 | for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) { |
| 2167 | if (opargs[curop->op_type] & OA_DANGEROUS) { |
| 2168 | #ifdef USE_THREADS |
| 2169 | if (curop->op_type == OP_THREADSV) { |
| 2170 | repl_has_vars = 1; |
| 2171 | if (strchr("&`'123456789+", curop->op_private)) |
| 2172 | break; |
| 2173 | } |
| 2174 | #else |
| 2175 | if (curop->op_type == OP_GV) { |
| 2176 | GV *gv = ((GVOP*)curop)->op_gv; |
| 2177 | repl_has_vars = 1; |
| 2178 | if (strchr("&`'123456789+", *GvENAME(gv))) |
| 2179 | break; |
| 2180 | } |
| 2181 | #endif /* USE_THREADS */ |
| 2182 | else if (curop->op_type == OP_RV2CV) |
| 2183 | break; |
| 2184 | else if (curop->op_type == OP_RV2SV || |
| 2185 | curop->op_type == OP_RV2AV || |
| 2186 | curop->op_type == OP_RV2HV || |
| 2187 | curop->op_type == OP_RV2GV) { |
| 2188 | if (lastop && lastop->op_type != OP_GV) /*funny deref?*/ |
| 2189 | break; |
| 2190 | } |
| 2191 | else if (curop->op_type == OP_PADSV || |
| 2192 | curop->op_type == OP_PADAV || |
| 2193 | curop->op_type == OP_PADHV || |
| 2194 | curop->op_type == OP_PADANY) { |
| 2195 | repl_has_vars = 1; |
| 2196 | } |
| 2197 | else |
| 2198 | break; |
| 2199 | } |
| 2200 | lastop = curop; |
| 2201 | } |
| 2202 | } |
| 2203 | if (curop == repl |
| 2204 | && !(repl_has_vars |
| 2205 | && (!pm->op_pmregexp |
| 2206 | || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) { |
| 2207 | pm->op_pmflags |= PMf_CONST; /* const for long enough */ |
| 2208 | pm->op_pmpermflags |= PMf_CONST; /* const for long enough */ |
| 2209 | prepend_elem(o->op_type, scalar(repl), o); |
| 2210 | } |
| 2211 | else { |
| 2212 | if (curop == repl && !pm->op_pmregexp) { /* Has variables. */ |
| 2213 | pm->op_pmflags |= PMf_MAYBE_CONST; |
| 2214 | pm->op_pmpermflags |= PMf_MAYBE_CONST; |
| 2215 | } |
| 2216 | Newz(1101, rcop, 1, LOGOP); |
| 2217 | rcop->op_type = OP_SUBSTCONT; |
| 2218 | rcop->op_ppaddr = ppaddr[OP_SUBSTCONT]; |
| 2219 | rcop->op_first = scalar(repl); |
| 2220 | rcop->op_flags |= OPf_KIDS; |
| 2221 | rcop->op_private = 1; |
| 2222 | rcop->op_other = o; |
| 2223 | |
| 2224 | /* establish postfix order */ |
| 2225 | rcop->op_next = LINKLIST(repl); |
| 2226 | repl->op_next = (OP*)rcop; |
| 2227 | |
| 2228 | pm->op_pmreplroot = scalar((OP*)rcop); |
| 2229 | pm->op_pmreplstart = LINKLIST(rcop); |
| 2230 | rcop->op_next = 0; |
| 2231 | } |
| 2232 | } |
| 2233 | |
| 2234 | return (OP*)pm; |
| 2235 | } |
| 2236 | |
| 2237 | OP * |
| 2238 | newSVOP(I32 type, I32 flags, SV *sv) |
| 2239 | { |
| 2240 | SVOP *svop; |
| 2241 | Newz(1101, svop, 1, SVOP); |
| 2242 | svop->op_type = type; |
| 2243 | svop->op_ppaddr = ppaddr[type]; |
| 2244 | svop->op_sv = sv; |
| 2245 | svop->op_next = (OP*)svop; |
| 2246 | svop->op_flags = flags; |
| 2247 | if (opargs[type] & OA_RETSCALAR) |
| 2248 | scalar((OP*)svop); |
| 2249 | if (opargs[type] & OA_TARGET) |
| 2250 | svop->op_targ = pad_alloc(type, SVs_PADTMP); |
| 2251 | return CHECKOP(type, svop); |
| 2252 | } |
| 2253 | |
| 2254 | OP * |
| 2255 | newGVOP(I32 type, I32 flags, GV *gv) |
| 2256 | { |
| 2257 | dTHR; |
| 2258 | GVOP *gvop; |
| 2259 | Newz(1101, gvop, 1, GVOP); |
| 2260 | gvop->op_type = type; |
| 2261 | gvop->op_ppaddr = ppaddr[type]; |
| 2262 | gvop->op_gv = (GV*)SvREFCNT_inc(gv); |
| 2263 | gvop->op_next = (OP*)gvop; |
| 2264 | gvop->op_flags = flags; |
| 2265 | if (opargs[type] & OA_RETSCALAR) |
| 2266 | scalar((OP*)gvop); |
| 2267 | if (opargs[type] & OA_TARGET) |
| 2268 | gvop->op_targ = pad_alloc(type, SVs_PADTMP); |
| 2269 | return CHECKOP(type, gvop); |
| 2270 | } |
| 2271 | |
| 2272 | OP * |
| 2273 | newPVOP(I32 type, I32 flags, char *pv) |
| 2274 | { |
| 2275 | PVOP *pvop; |
| 2276 | Newz(1101, pvop, 1, PVOP); |
| 2277 | pvop->op_type = type; |
| 2278 | pvop->op_ppaddr = ppaddr[type]; |
| 2279 | pvop->op_pv = pv; |
| 2280 | pvop->op_next = (OP*)pvop; |
| 2281 | pvop->op_flags = flags; |
| 2282 | if (opargs[type] & OA_RETSCALAR) |
| 2283 | scalar((OP*)pvop); |
| 2284 | if (opargs[type] & OA_TARGET) |
| 2285 | pvop->op_targ = pad_alloc(type, SVs_PADTMP); |
| 2286 | return CHECKOP(type, pvop); |
| 2287 | } |
| 2288 | |
| 2289 | void |
| 2290 | package(OP *o) |
| 2291 | { |
| 2292 | dTHR; |
| 2293 | SV *sv; |
| 2294 | |
| 2295 | save_hptr(&curstash); |
| 2296 | save_item(curstname); |
| 2297 | if (o) { |
| 2298 | STRLEN len; |
| 2299 | char *name; |
| 2300 | sv = cSVOPo->op_sv; |
| 2301 | name = SvPV(sv, len); |
| 2302 | curstash = gv_stashpvn(name,len,TRUE); |
| 2303 | sv_setpvn(curstname, name, len); |
| 2304 | op_free(o); |
| 2305 | } |
| 2306 | else { |
| 2307 | sv_setpv(curstname,"<none>"); |
| 2308 | curstash = Nullhv; |
| 2309 | } |
| 2310 | copline = NOLINE; |
| 2311 | expect = XSTATE; |
| 2312 | } |
| 2313 | |
| 2314 | void |
| 2315 | utilize(int aver, I32 floor, OP *version, OP *id, OP *arg) |
| 2316 | { |
| 2317 | OP *pack; |
| 2318 | OP *meth; |
| 2319 | OP *rqop; |
| 2320 | OP *imop; |
| 2321 | OP *veop; |
| 2322 | |
| 2323 | if (id->op_type != OP_CONST) |
| 2324 | croak("Module name must be constant"); |
| 2325 | |
| 2326 | veop = Nullop; |
| 2327 | |
| 2328 | if(version != Nullop) { |
| 2329 | SV *vesv = ((SVOP*)version)->op_sv; |
| 2330 | |
| 2331 | if (arg == Nullop && !SvNIOK(vesv)) { |
| 2332 | arg = version; |
| 2333 | } |
| 2334 | else { |
| 2335 | OP *pack; |
| 2336 | OP *meth; |
| 2337 | |
| 2338 | if (version->op_type != OP_CONST || !SvNIOK(vesv)) |
| 2339 | croak("Version number must be constant number"); |
| 2340 | |
| 2341 | /* Make copy of id so we don't free it twice */ |
| 2342 | pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv)); |
| 2343 | |
| 2344 | /* Fake up a method call to VERSION */ |
| 2345 | meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7)); |
| 2346 | veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL, |
| 2347 | append_elem(OP_LIST, |
| 2348 | prepend_elem(OP_LIST, pack, list(version)), |
| 2349 | newUNOP(OP_METHOD, 0, meth))); |
| 2350 | } |
| 2351 | } |
| 2352 | |
| 2353 | /* Fake up an import/unimport */ |
| 2354 | if (arg && arg->op_type == OP_STUB) |
| 2355 | imop = arg; /* no import on explicit () */ |
| 2356 | else if(SvNIOK(((SVOP*)id)->op_sv)) { |
| 2357 | imop = Nullop; /* use 5.0; */ |
| 2358 | } |
| 2359 | else { |
| 2360 | /* Make copy of id so we don't free it twice */ |
| 2361 | pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv)); |
| 2362 | meth = newSVOP(OP_CONST, 0, |
| 2363 | aver |
| 2364 | ? newSVpv("import", 6) |
| 2365 | : newSVpv("unimport", 8) |
| 2366 | ); |
| 2367 | imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL, |
| 2368 | append_elem(OP_LIST, |
| 2369 | prepend_elem(OP_LIST, pack, list(arg)), |
| 2370 | newUNOP(OP_METHOD, 0, meth))); |
| 2371 | } |
| 2372 | |
| 2373 | /* Fake up a require */ |
| 2374 | rqop = newUNOP(OP_REQUIRE, 0, id); |
| 2375 | |
| 2376 | /* Fake up the BEGIN {}, which does its thing immediately. */ |
| 2377 | newSUB(floor, |
| 2378 | newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)), |
| 2379 | Nullop, |
| 2380 | append_elem(OP_LINESEQ, |
| 2381 | append_elem(OP_LINESEQ, |
| 2382 | newSTATEOP(0, Nullch, rqop), |
| 2383 | newSTATEOP(0, Nullch, veop)), |
| 2384 | newSTATEOP(0, Nullch, imop) )); |
| 2385 | |
| 2386 | copline = NOLINE; |
| 2387 | expect = XSTATE; |
| 2388 | } |
| 2389 | |
| 2390 | OP * |
| 2391 | newSLICEOP(I32 flags, OP *subscript, OP *listval) |
| 2392 | { |
| 2393 | return newBINOP(OP_LSLICE, flags, |
| 2394 | list(force_list(subscript)), |
| 2395 | list(force_list(listval)) ); |
| 2396 | } |
| 2397 | |
| 2398 | STATIC I32 |
| 2399 | list_assignment(register OP *o) |
| 2400 | { |
| 2401 | if (!o) |
| 2402 | return TRUE; |
| 2403 | |
| 2404 | if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS) |
| 2405 | o = cUNOPo->op_first; |
| 2406 | |
| 2407 | if (o->op_type == OP_COND_EXPR) { |
| 2408 | I32 t = list_assignment(cCONDOPo->op_first->op_sibling); |
| 2409 | I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling); |
| 2410 | |
| 2411 | if (t && f) |
| 2412 | return TRUE; |
| 2413 | if (t || f) |
| 2414 | yyerror("Assignment to both a list and a scalar"); |
| 2415 | return FALSE; |
| 2416 | } |
| 2417 | |
| 2418 | if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS || |
| 2419 | o->op_type == OP_RV2AV || o->op_type == OP_RV2HV || |
| 2420 | o->op_type == OP_ASLICE || o->op_type == OP_HSLICE) |
| 2421 | return TRUE; |
| 2422 | |
| 2423 | if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) |
| 2424 | return TRUE; |
| 2425 | |
| 2426 | if (o->op_type == OP_RV2SV) |
| 2427 | return FALSE; |
| 2428 | |
| 2429 | return FALSE; |
| 2430 | } |
| 2431 | |
| 2432 | OP * |
| 2433 | newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right) |
| 2434 | { |
| 2435 | OP *o; |
| 2436 | |
| 2437 | if (optype) { |
| 2438 | if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) { |
| 2439 | return newLOGOP(optype, 0, |
| 2440 | mod(scalar(left), optype), |
| 2441 | newUNOP(OP_SASSIGN, 0, scalar(right))); |
| 2442 | } |
| 2443 | else { |
| 2444 | return newBINOP(optype, OPf_STACKED, |
| 2445 | mod(scalar(left), optype), scalar(right)); |
| 2446 | } |
| 2447 | } |
| 2448 | |
| 2449 | if (list_assignment(left)) { |
| 2450 | dTHR; |
| 2451 | modcount = 0; |
| 2452 | eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/ |
| 2453 | left = mod(left, OP_AASSIGN); |
| 2454 | if (eval_start) |
| 2455 | eval_start = 0; |
| 2456 | else { |
| 2457 | op_free(left); |
| 2458 | op_free(right); |
| 2459 | return Nullop; |
| 2460 | } |
| 2461 | o = newBINOP(OP_AASSIGN, flags, |
| 2462 | list(force_list(right)), |
| 2463 | list(force_list(left)) ); |
| 2464 | o->op_private = 0 | (flags >> 8); |
| 2465 | if (!(left->op_private & OPpLVAL_INTRO)) { |
| 2466 | OP *curop; |
| 2467 | OP *lastop = o; |
| 2468 | generation++; |
| 2469 | for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) { |
| 2470 | if (opargs[curop->op_type] & OA_DANGEROUS) { |
| 2471 | if (curop->op_type == OP_GV) { |
| 2472 | GV *gv = ((GVOP*)curop)->op_gv; |
| 2473 | if (gv == defgv || SvCUR(gv) == generation) |
| 2474 | break; |
| 2475 | SvCUR(gv) = generation; |
| 2476 | } |
| 2477 | else if (curop->op_type == OP_PADSV || |
| 2478 | curop->op_type == OP_PADAV || |
| 2479 | curop->op_type == OP_PADHV || |
| 2480 | curop->op_type == OP_PADANY) { |
| 2481 | SV **svp = AvARRAY(comppad_name); |
| 2482 | SV *sv = svp[curop->op_targ]; |
| 2483 | if (SvCUR(sv) == generation) |
| 2484 | break; |
| 2485 | SvCUR(sv) = generation; /* (SvCUR not used any more) */ |
| 2486 | } |
| 2487 | else if (curop->op_type == OP_RV2CV) |
| 2488 | break; |
| 2489 | else if (curop->op_type == OP_RV2SV || |
| 2490 | curop->op_type == OP_RV2AV || |
| 2491 | curop->op_type == OP_RV2HV || |
| 2492 | curop->op_type == OP_RV2GV) { |
| 2493 | if (lastop->op_type != OP_GV) /* funny deref? */ |
| 2494 | break; |
| 2495 | } |
| 2496 | else |
| 2497 | break; |
| 2498 | } |
| 2499 | lastop = curop; |
| 2500 | } |
| 2501 | if (curop != o) |
| 2502 | o->op_private = OPpASSIGN_COMMON; |
| 2503 | } |
| 2504 | if (right && right->op_type == OP_SPLIT) { |
| 2505 | OP* tmpop; |
| 2506 | if ((tmpop = ((LISTOP*)right)->op_first) && |
| 2507 | tmpop->op_type == OP_PUSHRE) |
| 2508 | { |
| 2509 | PMOP *pm = (PMOP*)tmpop; |
| 2510 | if (left->op_type == OP_RV2AV && |
| 2511 | !(left->op_private & OPpLVAL_INTRO) && |
| 2512 | !(o->op_private & OPpASSIGN_COMMON) ) |
| 2513 | { |
| 2514 | tmpop = ((UNOP*)left)->op_first; |
| 2515 | if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) { |
| 2516 | pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv; |
| 2517 | pm->op_pmflags |= PMf_ONCE; |
| 2518 | tmpop = cUNOPo->op_first; /* to list (nulled) */ |
| 2519 | tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */ |
| 2520 | tmpop->op_sibling = Nullop; /* don't free split */ |
| 2521 | right->op_next = tmpop->op_next; /* fix starting loc */ |
| 2522 | op_free(o); /* blow off assign */ |
| 2523 | right->op_flags &= ~OPf_WANT; |
| 2524 | /* "I don't know and I don't care." */ |
| 2525 | return right; |
| 2526 | } |
| 2527 | } |
| 2528 | else { |
| 2529 | if (modcount < 10000 && |
| 2530 | ((LISTOP*)right)->op_last->op_type == OP_CONST) |
| 2531 | { |
| 2532 | SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv; |
| 2533 | if (SvIVX(sv) == 0) |
| 2534 | sv_setiv(sv, modcount+1); |
| 2535 | } |
| 2536 | } |
| 2537 | } |
| 2538 | } |
| 2539 | return o; |
| 2540 | } |
| 2541 | if (!right) |
| 2542 | right = newOP(OP_UNDEF, 0); |
| 2543 | if (right->op_type == OP_READLINE) { |
| 2544 | right->op_flags |= OPf_STACKED; |
| 2545 | return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right)); |
| 2546 | } |
| 2547 | else { |
| 2548 | eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/ |
| 2549 | o = newBINOP(OP_SASSIGN, flags, |
| 2550 | scalar(right), mod(scalar(left), OP_SASSIGN) ); |
| 2551 | if (eval_start) |
| 2552 | eval_start = 0; |
| 2553 | else { |
| 2554 | op_free(o); |
| 2555 | return Nullop; |
| 2556 | } |
| 2557 | } |
| 2558 | return o; |
| 2559 | } |
| 2560 | |
| 2561 | OP * |
| 2562 | newSTATEOP(I32 flags, char *label, OP *o) |
| 2563 | { |
| 2564 | dTHR; |
| 2565 | U32 seq = intro_my(); |
| 2566 | register COP *cop; |
| 2567 | |
| 2568 | Newz(1101, cop, 1, COP); |
| 2569 | if (PERLDB_LINE && curcop->cop_line && curstash != debstash) { |
| 2570 | cop->op_type = OP_DBSTATE; |
| 2571 | cop->op_ppaddr = ppaddr[ OP_DBSTATE ]; |
| 2572 | } |
| 2573 | else { |
| 2574 | cop->op_type = OP_NEXTSTATE; |
| 2575 | cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ]; |
| 2576 | } |
| 2577 | cop->op_flags = flags; |
| 2578 | cop->op_private = 0 | (flags >> 8); |
| 2579 | #ifdef NATIVE_HINTS |
| 2580 | cop->op_private |= NATIVE_HINTS; |
| 2581 | #endif |
| 2582 | cop->op_next = (OP*)cop; |
| 2583 | |
| 2584 | if (label) { |
| 2585 | cop->cop_label = label; |
| 2586 | hints |= HINT_BLOCK_SCOPE; |
| 2587 | } |
| 2588 | cop->cop_seq = seq; |
| 2589 | cop->cop_arybase = curcop->cop_arybase; |
| 2590 | |
| 2591 | if (copline == NOLINE) |
| 2592 | cop->cop_line = curcop->cop_line; |
| 2593 | else { |
| 2594 | cop->cop_line = copline; |
| 2595 | copline = NOLINE; |
| 2596 | } |
| 2597 | cop->cop_filegv = (GV*)SvREFCNT_inc(curcop->cop_filegv); |
| 2598 | cop->cop_stash = curstash; |
| 2599 | |
| 2600 | if (PERLDB_LINE && curstash != debstash) { |
| 2601 | SV **svp = av_fetch(GvAV(curcop->cop_filegv),(I32)cop->cop_line, FALSE); |
| 2602 | if (svp && *svp != &sv_undef && !SvIOK(*svp)) { |
| 2603 | (void)SvIOK_on(*svp); |
| 2604 | SvIVX(*svp) = 1; |
| 2605 | SvSTASH(*svp) = (HV*)cop; |
| 2606 | } |
| 2607 | } |
| 2608 | |
| 2609 | return prepend_elem(OP_LINESEQ, (OP*)cop, o); |
| 2610 | } |
| 2611 | |
| 2612 | /* "Introduce" my variables to visible status. */ |
| 2613 | U32 |
| 2614 | intro_my(void) |
| 2615 | { |
| 2616 | SV **svp; |
| 2617 | SV *sv; |
| 2618 | I32 i; |
| 2619 | |
| 2620 | if (! min_intro_pending) |
| 2621 | return cop_seqmax; |
| 2622 | |
| 2623 | svp = AvARRAY(comppad_name); |
| 2624 | for (i = min_intro_pending; i <= max_intro_pending; i++) { |
| 2625 | if ((sv = svp[i]) && sv != &sv_undef && !SvIVX(sv)) { |
| 2626 | SvIVX(sv) = 999999999; /* Don't know scope end yet. */ |
| 2627 | SvNVX(sv) = (double)cop_seqmax; |
| 2628 | } |
| 2629 | } |
| 2630 | min_intro_pending = 0; |
| 2631 | comppad_name_fill = max_intro_pending; /* Needn't search higher */ |
| 2632 | return cop_seqmax++; |
| 2633 | } |
| 2634 | |
| 2635 | OP * |
| 2636 | newLOGOP(I32 type, I32 flags, OP *first, OP *other) |
| 2637 | { |
| 2638 | return new_logop(type, flags, &first, &other); |
| 2639 | } |
| 2640 | |
| 2641 | STATIC OP * |
| 2642 | new_logop(I32 type, I32 flags, OP** firstp, OP** otherp) |
| 2643 | { |
| 2644 | dTHR; |
| 2645 | LOGOP *logop; |
| 2646 | OP *o; |
| 2647 | OP *first = *firstp; |
| 2648 | OP *other = *otherp; |
| 2649 | |
| 2650 | if (type == OP_XOR) /* Not short circuit, but here by precedence. */ |
| 2651 | return newBINOP(type, flags, scalar(first), scalar(other)); |
| 2652 | |
| 2653 | scalarboolean(first); |
| 2654 | /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */ |
| 2655 | if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) { |
| 2656 | if (type == OP_AND || type == OP_OR) { |
| 2657 | if (type == OP_AND) |
| 2658 | type = OP_OR; |
| 2659 | else |
| 2660 | type = OP_AND; |
| 2661 | o = first; |
| 2662 | first = *firstp = cUNOPo->op_first; |
| 2663 | if (o->op_next) |
| 2664 | first->op_next = o->op_next; |
| 2665 | cUNOPo->op_first = Nullop; |
| 2666 | op_free(o); |
| 2667 | } |
| 2668 | } |
| 2669 | if (first->op_type == OP_CONST) { |
| 2670 | if (dowarn && (first->op_private & OPpCONST_BARE)) |
| 2671 | warn("Probable precedence problem on %s", op_desc[type]); |
| 2672 | if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) { |
| 2673 | op_free(first); |
| 2674 | *firstp = Nullop; |
| 2675 | return other; |
| 2676 | } |
| 2677 | else { |
| 2678 | op_free(other); |
| 2679 | *otherp = Nullop; |
| 2680 | return first; |
| 2681 | } |
| 2682 | } |
| 2683 | else if (first->op_type == OP_WANTARRAY) { |
| 2684 | if (type == OP_AND) |
| 2685 | list(other); |
| 2686 | else |
| 2687 | scalar(other); |
| 2688 | } |
| 2689 | else if (dowarn && (first->op_flags & OPf_KIDS)) { |
| 2690 | OP *k1 = ((UNOP*)first)->op_first; |
| 2691 | OP *k2 = k1->op_sibling; |
| 2692 | OPCODE warnop = 0; |
| 2693 | switch (first->op_type) |
| 2694 | { |
| 2695 | case OP_NULL: |
| 2696 | if (k2 && k2->op_type == OP_READLINE |
| 2697 | && (k2->op_flags & OPf_STACKED) |
| 2698 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
| 2699 | warnop = k2->op_type; |
| 2700 | break; |
| 2701 | |
| 2702 | case OP_SASSIGN: |
| 2703 | if (k1->op_type == OP_READDIR |
| 2704 | || k1->op_type == OP_GLOB |
| 2705 | || k1->op_type == OP_EACH) |
| 2706 | warnop = k1->op_type; |
| 2707 | break; |
| 2708 | } |
| 2709 | if (warnop) { |
| 2710 | line_t oldline = curcop->cop_line; |
| 2711 | curcop->cop_line = copline; |
| 2712 | warn("Value of %s%s can be \"0\"; test with defined()", |
| 2713 | op_desc[warnop], |
| 2714 | ((warnop == OP_READLINE || warnop == OP_GLOB) |
| 2715 | ? " construct" : "() operator")); |
| 2716 | curcop->cop_line = oldline; |
| 2717 | } |
| 2718 | } |
| 2719 | |
| 2720 | if (!other) |
| 2721 | return first; |
| 2722 | |
| 2723 | if (type == OP_ANDASSIGN || type == OP_ORASSIGN) |
| 2724 | other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */ |
| 2725 | |
| 2726 | Newz(1101, logop, 1, LOGOP); |
| 2727 | |
| 2728 | logop->op_type = type; |
| 2729 | logop->op_ppaddr = ppaddr[type]; |
| 2730 | logop->op_first = first; |
| 2731 | logop->op_flags = flags | OPf_KIDS; |
| 2732 | logop->op_other = LINKLIST(other); |
| 2733 | logop->op_private = 1 | (flags >> 8); |
| 2734 | |
| 2735 | /* establish postfix order */ |
| 2736 | logop->op_next = LINKLIST(first); |
| 2737 | first->op_next = (OP*)logop; |
| 2738 | first->op_sibling = other; |
| 2739 | |
| 2740 | o = newUNOP(OP_NULL, 0, (OP*)logop); |
| 2741 | other->op_next = o; |
| 2742 | |
| 2743 | return o; |
| 2744 | } |
| 2745 | |
| 2746 | OP * |
| 2747 | newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop) |
| 2748 | { |
| 2749 | dTHR; |
| 2750 | CONDOP *condop; |
| 2751 | OP *o; |
| 2752 | |
| 2753 | if (!falseop) |
| 2754 | return newLOGOP(OP_AND, 0, first, trueop); |
| 2755 | if (!trueop) |
| 2756 | return newLOGOP(OP_OR, 0, first, falseop); |
| 2757 | |
| 2758 | scalarboolean(first); |
| 2759 | if (first->op_type == OP_CONST) { |
| 2760 | if (SvTRUE(((SVOP*)first)->op_sv)) { |
| 2761 | op_free(first); |
| 2762 | op_free(falseop); |
| 2763 | return trueop; |
| 2764 | } |
| 2765 | else { |
| 2766 | op_free(first); |
| 2767 | op_free(trueop); |
| 2768 | return falseop; |
| 2769 | } |
| 2770 | } |
| 2771 | else if (first->op_type == OP_WANTARRAY) { |
| 2772 | list(trueop); |
| 2773 | scalar(falseop); |
| 2774 | } |
| 2775 | Newz(1101, condop, 1, CONDOP); |
| 2776 | |
| 2777 | condop->op_type = OP_COND_EXPR; |
| 2778 | condop->op_ppaddr = ppaddr[OP_COND_EXPR]; |
| 2779 | condop->op_first = first; |
| 2780 | condop->op_flags = flags | OPf_KIDS; |
| 2781 | condop->op_true = LINKLIST(trueop); |
| 2782 | condop->op_false = LINKLIST(falseop); |
| 2783 | condop->op_private = 1 | (flags >> 8); |
| 2784 | |
| 2785 | /* establish postfix order */ |
| 2786 | condop->op_next = LINKLIST(first); |
| 2787 | first->op_next = (OP*)condop; |
| 2788 | |
| 2789 | first->op_sibling = trueop; |
| 2790 | trueop->op_sibling = falseop; |
| 2791 | o = newUNOP(OP_NULL, 0, (OP*)condop); |
| 2792 | |
| 2793 | trueop->op_next = o; |
| 2794 | falseop->op_next = o; |
| 2795 | |
| 2796 | return o; |
| 2797 | } |
| 2798 | |
| 2799 | OP * |
| 2800 | newRANGE(I32 flags, OP *left, OP *right) |
| 2801 | { |
| 2802 | dTHR; |
| 2803 | CONDOP *condop; |
| 2804 | OP *flip; |
| 2805 | OP *flop; |
| 2806 | OP *o; |
| 2807 | |
| 2808 | Newz(1101, condop, 1, CONDOP); |
| 2809 | |
| 2810 | condop->op_type = OP_RANGE; |
| 2811 | condop->op_ppaddr = ppaddr[OP_RANGE]; |
| 2812 | condop->op_first = left; |
| 2813 | condop->op_flags = OPf_KIDS; |
| 2814 | condop->op_true = LINKLIST(left); |
| 2815 | condop->op_false = LINKLIST(right); |
| 2816 | condop->op_private = 1 | (flags >> 8); |
| 2817 | |
| 2818 | left->op_sibling = right; |
| 2819 | |
| 2820 | condop->op_next = (OP*)condop; |
| 2821 | flip = newUNOP(OP_FLIP, flags, (OP*)condop); |
| 2822 | flop = newUNOP(OP_FLOP, 0, flip); |
| 2823 | o = newUNOP(OP_NULL, 0, flop); |
| 2824 | linklist(flop); |
| 2825 | |
| 2826 | left->op_next = flip; |
| 2827 | right->op_next = flop; |
| 2828 | |
| 2829 | condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY); |
| 2830 | sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV); |
| 2831 | flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY); |
| 2832 | sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV); |
| 2833 | |
| 2834 | flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0; |
| 2835 | flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0; |
| 2836 | |
| 2837 | flip->op_next = o; |
| 2838 | if (!flip->op_private || !flop->op_private) |
| 2839 | linklist(o); /* blow off optimizer unless constant */ |
| 2840 | |
| 2841 | return o; |
| 2842 | } |
| 2843 | |
| 2844 | OP * |
| 2845 | newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block) |
| 2846 | { |
| 2847 | dTHR; |
| 2848 | OP* listop; |
| 2849 | OP* o; |
| 2850 | int once = block && block->op_flags & OPf_SPECIAL && |
| 2851 | (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL); |
| 2852 | |
| 2853 | if (expr) { |
| 2854 | if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv)) |
| 2855 | return block; /* do {} while 0 does once */ |
| 2856 | if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB |
| 2857 | || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) { |
| 2858 | expr = newUNOP(OP_DEFINED, 0, |
| 2859 | newASSIGNOP(0, newDEFSVOP(), 0, expr) ); |
| 2860 | } else if (expr->op_flags & OPf_KIDS) { |
| 2861 | OP *k1 = ((UNOP*)expr)->op_first; |
| 2862 | OP *k2 = (k1) ? k1->op_sibling : NULL; |
| 2863 | switch (expr->op_type) { |
| 2864 | case OP_NULL: |
| 2865 | if (k2 && k2->op_type == OP_READLINE |
| 2866 | && (k2->op_flags & OPf_STACKED) |
| 2867 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
| 2868 | expr = newUNOP(OP_DEFINED, 0, expr); |
| 2869 | break; |
| 2870 | |
| 2871 | case OP_SASSIGN: |
| 2872 | if (k1->op_type == OP_READDIR |
| 2873 | || k1->op_type == OP_GLOB |
| 2874 | || k1->op_type == OP_EACH) |
| 2875 | expr = newUNOP(OP_DEFINED, 0, expr); |
| 2876 | break; |
| 2877 | } |
| 2878 | } |
| 2879 | } |
| 2880 | |
| 2881 | listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0)); |
| 2882 | o = new_logop(OP_AND, 0, &expr, &listop); |
| 2883 | |
| 2884 | if (listop) |
| 2885 | ((LISTOP*)listop)->op_last->op_next = LINKLIST(o); |
| 2886 | |
| 2887 | if (once && o != listop) |
| 2888 | o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other; |
| 2889 | |
| 2890 | if (o == listop) |
| 2891 | o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */ |
| 2892 | |
| 2893 | o->op_flags |= flags; |
| 2894 | o = scope(o); |
| 2895 | o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/ |
| 2896 | return o; |
| 2897 | } |
| 2898 | |
| 2899 | OP * |
| 2900 | newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont) |
| 2901 | { |
| 2902 | dTHR; |
| 2903 | OP *redo; |
| 2904 | OP *next = 0; |
| 2905 | OP *listop; |
| 2906 | OP *o; |
| 2907 | OP *condop; |
| 2908 | |
| 2909 | if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB |
| 2910 | || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) { |
| 2911 | expr = newUNOP(OP_DEFINED, 0, |
| 2912 | newASSIGNOP(0, newDEFSVOP(), 0, expr) ); |
| 2913 | } else if (expr && (expr->op_flags & OPf_KIDS)) { |
| 2914 | OP *k1 = ((UNOP*)expr)->op_first; |
| 2915 | OP *k2 = (k1) ? k1->op_sibling : NULL; |
| 2916 | switch (expr->op_type) { |
| 2917 | case OP_NULL: |
| 2918 | if (k2 && k2->op_type == OP_READLINE |
| 2919 | && (k2->op_flags & OPf_STACKED) |
| 2920 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
| 2921 | expr = newUNOP(OP_DEFINED, 0, expr); |
| 2922 | break; |
| 2923 | |
| 2924 | case OP_SASSIGN: |
| 2925 | if (k1->op_type == OP_READDIR |
| 2926 | || k1->op_type == OP_GLOB |
| 2927 | || k1->op_type == OP_EACH) |
| 2928 | expr = newUNOP(OP_DEFINED, 0, expr); |
| 2929 | break; |
| 2930 | } |
| 2931 | } |
| 2932 | |
| 2933 | if (!block) |
| 2934 | block = newOP(OP_NULL, 0); |
| 2935 | |
| 2936 | if (cont) |
| 2937 | next = LINKLIST(cont); |
| 2938 | if (expr) { |
| 2939 | cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0)); |
| 2940 | if ((line_t)whileline != NOLINE) { |
| 2941 | copline = whileline; |
| 2942 | cont = append_elem(OP_LINESEQ, cont, |
| 2943 | newSTATEOP(0, Nullch, Nullop)); |
| 2944 | } |
| 2945 | } |
| 2946 | |
| 2947 | listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont); |
| 2948 | redo = LINKLIST(listop); |
| 2949 | |
| 2950 | if (expr) { |
| 2951 | copline = whileline; |
| 2952 | scalar(listop); |
| 2953 | o = new_logop(OP_AND, 0, &expr, &listop); |
| 2954 | if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) { |
| 2955 | op_free(expr); /* oops, it's a while (0) */ |
| 2956 | op_free((OP*)loop); |
| 2957 | return Nullop; /* listop already freed by new_logop */ |
| 2958 | } |
| 2959 | if (listop) |
| 2960 | ((LISTOP*)listop)->op_last->op_next = condop = |
| 2961 | (o == listop ? redo : LINKLIST(o)); |
| 2962 | if (!next) |
| 2963 | next = condop; |
| 2964 | } |
| 2965 | else |
| 2966 | o = listop; |
| 2967 | |
| 2968 | if (!loop) { |
| 2969 | Newz(1101,loop,1,LOOP); |
| 2970 | loop->op_type = OP_ENTERLOOP; |
| 2971 | loop->op_ppaddr = ppaddr[OP_ENTERLOOP]; |
| 2972 | loop->op_private = 0; |
| 2973 | loop->op_next = (OP*)loop; |
| 2974 | } |
| 2975 | |
| 2976 | o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o); |
| 2977 | |
| 2978 | loop->op_redoop = redo; |
| 2979 | loop->op_lastop = o; |
| 2980 | |
| 2981 | if (next) |
| 2982 | loop->op_nextop = next; |
| 2983 | else |
| 2984 | loop->op_nextop = o; |
| 2985 | |
| 2986 | o->op_flags |= flags; |
| 2987 | o->op_private |= (flags >> 8); |
| 2988 | return o; |
| 2989 | } |
| 2990 | |
| 2991 | OP * |
| 2992 | newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont) |
| 2993 | { |
| 2994 | LOOP *loop; |
| 2995 | OP *wop; |
| 2996 | int padoff = 0; |
| 2997 | I32 iterflags = 0; |
| 2998 | |
| 2999 | if (sv) { |
| 3000 | if (sv->op_type == OP_RV2SV) { /* symbol table variable */ |
| 3001 | sv->op_type = OP_RV2GV; |
| 3002 | sv->op_ppaddr = ppaddr[OP_RV2GV]; |
| 3003 | } |
| 3004 | else if (sv->op_type == OP_PADSV) { /* private variable */ |
| 3005 | padoff = sv->op_targ; |
| 3006 | op_free(sv); |
| 3007 | sv = Nullop; |
| 3008 | } |
| 3009 | else if (sv->op_type == OP_THREADSV) { /* per-thread variable */ |
| 3010 | padoff = sv->op_targ; |
| 3011 | iterflags |= OPf_SPECIAL; |
| 3012 | op_free(sv); |
| 3013 | sv = Nullop; |
| 3014 | } |
| 3015 | else |
| 3016 | croak("Can't use %s for loop variable", op_desc[sv->op_type]); |
| 3017 | } |
| 3018 | else { |
| 3019 | #ifdef USE_THREADS |
| 3020 | padoff = find_threadsv("_"); |
| 3021 | iterflags |= OPf_SPECIAL; |
| 3022 | #else |
| 3023 | sv = newGVOP(OP_GV, 0, defgv); |
| 3024 | #endif |
| 3025 | } |
| 3026 | if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) { |
| 3027 | expr = scalar(ref(expr, OP_ITER)); |
| 3028 | iterflags |= OPf_STACKED; |
| 3029 | } |
| 3030 | loop = (LOOP*)list(convert(OP_ENTERITER, iterflags, |
| 3031 | append_elem(OP_LIST, mod(force_list(expr), OP_GREPSTART), |
| 3032 | scalar(sv)))); |
| 3033 | assert(!loop->op_next); |
| 3034 | Renew(loop, 1, LOOP); |
| 3035 | loop->op_targ = padoff; |
| 3036 | wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont); |
| 3037 | copline = forline; |
| 3038 | return newSTATEOP(0, label, wop); |
| 3039 | } |
| 3040 | |
| 3041 | OP* |
| 3042 | newLOOPEX(I32 type, OP *label) |
| 3043 | { |
| 3044 | dTHR; |
| 3045 | OP *o; |
| 3046 | if (type != OP_GOTO || label->op_type == OP_CONST) { |
| 3047 | /* "last()" means "last" */ |
| 3048 | if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) |
| 3049 | o = newOP(type, OPf_SPECIAL); |
| 3050 | else { |
| 3051 | o = newPVOP(type, 0, savepv(label->op_type == OP_CONST |
| 3052 | ? SvPVx(((SVOP*)label)->op_sv, na) |
| 3053 | : "")); |
| 3054 | } |
| 3055 | op_free(label); |
| 3056 | } |
| 3057 | else { |
| 3058 | if (label->op_type == OP_ENTERSUB) |
| 3059 | label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN)); |
| 3060 | o = newUNOP(type, OPf_STACKED, label); |
| 3061 | } |
| 3062 | hints |= HINT_BLOCK_SCOPE; |
| 3063 | return o; |
| 3064 | } |
| 3065 | |
| 3066 | void |
| 3067 | cv_undef(CV *cv) |
| 3068 | { |
| 3069 | dTHR; |
| 3070 | #ifdef USE_THREADS |
| 3071 | if (CvMUTEXP(cv)) { |
| 3072 | MUTEX_DESTROY(CvMUTEXP(cv)); |
| 3073 | Safefree(CvMUTEXP(cv)); |
| 3074 | CvMUTEXP(cv) = 0; |
| 3075 | } |
| 3076 | #endif /* USE_THREADS */ |
| 3077 | |
| 3078 | if (!CvXSUB(cv) && CvROOT(cv)) { |
| 3079 | #ifdef USE_THREADS |
| 3080 | if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr)) |
| 3081 | croak("Can't undef active subroutine"); |
| 3082 | #else |
| 3083 | if (CvDEPTH(cv)) |
| 3084 | croak("Can't undef active subroutine"); |
| 3085 | #endif /* USE_THREADS */ |
| 3086 | ENTER; |
| 3087 | |
| 3088 | SAVESPTR(curpad); |
| 3089 | curpad = 0; |
| 3090 | |
| 3091 | if (!CvCLONED(cv)) |
| 3092 | op_free(CvROOT(cv)); |
| 3093 | CvROOT(cv) = Nullop; |
| 3094 | LEAVE; |
| 3095 | } |
| 3096 | SvPOK_off((SV*)cv); /* forget prototype */ |
| 3097 | CvFLAGS(cv) = 0; |
| 3098 | SvREFCNT_dec(CvGV(cv)); |
| 3099 | CvGV(cv) = Nullgv; |
| 3100 | SvREFCNT_dec(CvOUTSIDE(cv)); |
| 3101 | CvOUTSIDE(cv) = Nullcv; |
| 3102 | if (CvPADLIST(cv)) { |
| 3103 | /* may be during global destruction */ |
| 3104 | if (SvREFCNT(CvPADLIST(cv))) { |
| 3105 | I32 i = AvFILLp(CvPADLIST(cv)); |
| 3106 | while (i >= 0) { |
| 3107 | SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE); |
| 3108 | SV* sv = svp ? *svp : Nullsv; |
| 3109 | if (!sv) |
| 3110 | continue; |
| 3111 | if (sv == (SV*)comppad_name) |
| 3112 | comppad_name = Nullav; |
| 3113 | else if (sv == (SV*)comppad) { |
| 3114 | comppad = Nullav; |
| 3115 | curpad = Null(SV**); |
| 3116 | } |
| 3117 | SvREFCNT_dec(sv); |
| 3118 | } |
| 3119 | SvREFCNT_dec((SV*)CvPADLIST(cv)); |
| 3120 | } |
| 3121 | CvPADLIST(cv) = Nullav; |
| 3122 | } |
| 3123 | } |
| 3124 | |
| 3125 | #ifdef DEBUG_CLOSURES |
| 3126 | STATIC void |
| 3127 | cv_dump(cv) |
| 3128 | CV* cv; |
| 3129 | { |
| 3130 | CV *outside = CvOUTSIDE(cv); |
| 3131 | AV* padlist = CvPADLIST(cv); |
| 3132 | AV* pad_name; |
| 3133 | AV* pad; |
| 3134 | SV** pname; |
| 3135 | SV** ppad; |
| 3136 | I32 ix; |
| 3137 | |
| 3138 | PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n", |
| 3139 | cv, |
| 3140 | (CvANON(cv) ? "ANON" |
| 3141 | : (cv == main_cv) ? "MAIN" |
| 3142 | : CvUNIQUE(outside) ? "UNIQUE" |
| 3143 | : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"), |
| 3144 | outside, |
| 3145 | (!outside ? "null" |
| 3146 | : CvANON(outside) ? "ANON" |
| 3147 | : (outside == main_cv) ? "MAIN" |
| 3148 | : CvUNIQUE(outside) ? "UNIQUE" |
| 3149 | : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED")); |
| 3150 | |
| 3151 | if (!padlist) |
| 3152 | return; |
| 3153 | |
| 3154 | pad_name = (AV*)*av_fetch(padlist, 0, FALSE); |
| 3155 | pad = (AV*)*av_fetch(padlist, 1, FALSE); |
| 3156 | pname = AvARRAY(pad_name); |
| 3157 | ppad = AvARRAY(pad); |
| 3158 | |
| 3159 | for (ix = 1; ix <= AvFILLp(pad_name); ix++) { |
| 3160 | if (SvPOK(pname[ix])) |
| 3161 | PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n", |
| 3162 | ix, ppad[ix], |
| 3163 | SvFAKE(pname[ix]) ? "FAKE " : "", |
| 3164 | SvPVX(pname[ix]), |
| 3165 | (long)I_32(SvNVX(pname[ix])), |
| 3166 | (long)SvIVX(pname[ix])); |
| 3167 | } |
| 3168 | } |
| 3169 | #endif /* DEBUG_CLOSURES */ |
| 3170 | |
| 3171 | STATIC CV * |
| 3172 | cv_clone2(CV *proto, CV *outside) |
| 3173 | { |
| 3174 | dTHR; |
| 3175 | AV* av; |
| 3176 | I32 ix; |
| 3177 | AV* protopadlist = CvPADLIST(proto); |
| 3178 | AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE); |
| 3179 | AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE); |
| 3180 | SV** pname = AvARRAY(protopad_name); |
| 3181 | SV** ppad = AvARRAY(protopad); |
| 3182 | I32 fname = AvFILLp(protopad_name); |
| 3183 | I32 fpad = AvFILLp(protopad); |
| 3184 | AV* comppadlist; |
| 3185 | CV* cv; |
| 3186 | |
| 3187 | assert(!CvUNIQUE(proto)); |
| 3188 | |
| 3189 | ENTER; |
| 3190 | SAVESPTR(curpad); |
| 3191 | SAVESPTR(comppad); |
| 3192 | SAVESPTR(comppad_name); |
| 3193 | SAVESPTR(compcv); |
| 3194 | |
| 3195 | cv = compcv = (CV*)NEWSV(1104,0); |
| 3196 | sv_upgrade((SV *)cv, SvTYPE(proto)); |
| 3197 | CvCLONED_on(cv); |
| 3198 | if (CvANON(proto)) |
| 3199 | CvANON_on(cv); |
| 3200 | |
| 3201 | #ifdef USE_THREADS |
| 3202 | New(666, CvMUTEXP(cv), 1, perl_mutex); |
| 3203 | MUTEX_INIT(CvMUTEXP(cv)); |
| 3204 | CvOWNER(cv) = 0; |
| 3205 | #endif /* USE_THREADS */ |
| 3206 | CvFILEGV(cv) = CvFILEGV(proto); |
| 3207 | CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto)); |
| 3208 | CvSTASH(cv) = CvSTASH(proto); |
| 3209 | CvROOT(cv) = CvROOT(proto); |
| 3210 | CvSTART(cv) = CvSTART(proto); |
| 3211 | if (outside) |
| 3212 | CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside); |
| 3213 | |
| 3214 | if (SvPOK(proto)) |
| 3215 | sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto)); |
| 3216 | |
| 3217 | comppad_name = newAV(); |
| 3218 | for (ix = fname; ix >= 0; ix--) |
| 3219 | av_store(comppad_name, ix, SvREFCNT_inc(pname[ix])); |
| 3220 | |
| 3221 | comppad = newAV(); |
| 3222 | |
| 3223 | comppadlist = newAV(); |
| 3224 | AvREAL_off(comppadlist); |
| 3225 | av_store(comppadlist, 0, (SV*)comppad_name); |
| 3226 | av_store(comppadlist, 1, (SV*)comppad); |
| 3227 | CvPADLIST(cv) = comppadlist; |
| 3228 | av_fill(comppad, AvFILLp(protopad)); |
| 3229 | curpad = AvARRAY(comppad); |
| 3230 | |
| 3231 | av = newAV(); /* will be @_ */ |
| 3232 | av_extend(av, 0); |
| 3233 | av_store(comppad, 0, (SV*)av); |
| 3234 | AvFLAGS(av) = AVf_REIFY; |
| 3235 | |
| 3236 | for (ix = fpad; ix > 0; ix--) { |
| 3237 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
| 3238 | if (namesv && namesv != &sv_undef) { |
| 3239 | char *name = SvPVX(namesv); /* XXX */ |
| 3240 | if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */ |
| 3241 | I32 off = pad_findlex(name, ix, SvIVX(namesv), |
| 3242 | CvOUTSIDE(cv), cxstack_ix); |
| 3243 | if (!off) |
| 3244 | curpad[ix] = SvREFCNT_inc(ppad[ix]); |
| 3245 | else if (off != ix) |
| 3246 | croak("panic: cv_clone: %s", name); |
| 3247 | } |
| 3248 | else { /* our own lexical */ |
| 3249 | SV* sv; |
| 3250 | if (*name == '&') { |
| 3251 | /* anon code -- we'll come back for it */ |
| 3252 | sv = SvREFCNT_inc(ppad[ix]); |
| 3253 | } |
| 3254 | else if (*name == '@') |
| 3255 | sv = (SV*)newAV(); |
| 3256 | else if (*name == '%') |
| 3257 | sv = (SV*)newHV(); |
| 3258 | else |
| 3259 | sv = NEWSV(0,0); |
| 3260 | if (!SvPADBUSY(sv)) |
| 3261 | SvPADMY_on(sv); |
| 3262 | curpad[ix] = sv; |
| 3263 | } |
| 3264 | } |
| 3265 | else { |
| 3266 | SV* sv = NEWSV(0,0); |
| 3267 | SvPADTMP_on(sv); |
| 3268 | curpad[ix] = sv; |
| 3269 | } |
| 3270 | } |
| 3271 | |
| 3272 | /* Now that vars are all in place, clone nested closures. */ |
| 3273 | |
| 3274 | for (ix = fpad; ix > 0; ix--) { |
| 3275 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
| 3276 | if (namesv |
| 3277 | && namesv != &sv_undef |
| 3278 | && !(SvFLAGS(namesv) & SVf_FAKE) |
| 3279 | && *SvPVX(namesv) == '&' |
| 3280 | && CvCLONE(ppad[ix])) |
| 3281 | { |
| 3282 | CV *kid = cv_clone2((CV*)ppad[ix], cv); |
| 3283 | SvREFCNT_dec(ppad[ix]); |
| 3284 | CvCLONE_on(kid); |
| 3285 | SvPADMY_on(kid); |
| 3286 | curpad[ix] = (SV*)kid; |
| 3287 | } |
| 3288 | } |
| 3289 | |
| 3290 | #ifdef DEBUG_CLOSURES |
| 3291 | PerlIO_printf(Perl_debug_log, "Cloned inside:\n"); |
| 3292 | cv_dump(outside); |
| 3293 | PerlIO_printf(Perl_debug_log, " from:\n"); |
| 3294 | cv_dump(proto); |
| 3295 | PerlIO_printf(Perl_debug_log, " to:\n"); |
| 3296 | cv_dump(cv); |
| 3297 | #endif |
| 3298 | |
| 3299 | LEAVE; |
| 3300 | return cv; |
| 3301 | } |
| 3302 | |
| 3303 | CV * |
| 3304 | cv_clone(CV *proto) |
| 3305 | { |
| 3306 | return cv_clone2(proto, CvOUTSIDE(proto)); |
| 3307 | } |
| 3308 | |
| 3309 | void |
| 3310 | cv_ckproto(CV *cv, GV *gv, char *p) |
| 3311 | { |
| 3312 | if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) { |
| 3313 | SV* msg = sv_newmortal(); |
| 3314 | SV* name = Nullsv; |
| 3315 | |
| 3316 | if (gv) |
| 3317 | gv_efullname3(name = sv_newmortal(), gv, Nullch); |
| 3318 | sv_setpv(msg, "Prototype mismatch:"); |
| 3319 | if (name) |
| 3320 | sv_catpvf(msg, " sub %_", name); |
| 3321 | if (SvPOK(cv)) |
| 3322 | sv_catpvf(msg, " (%s)", SvPVX(cv)); |
| 3323 | sv_catpv(msg, " vs "); |
| 3324 | if (p) |
| 3325 | sv_catpvf(msg, "(%s)", p); |
| 3326 | else |
| 3327 | sv_catpv(msg, "none"); |
| 3328 | warn("%_", msg); |
| 3329 | } |
| 3330 | } |
| 3331 | |
| 3332 | SV * |
| 3333 | cv_const_sv(CV *cv) |
| 3334 | { |
| 3335 | if (!cv || !SvPOK(cv) || SvCUR(cv)) |
| 3336 | return Nullsv; |
| 3337 | return op_const_sv(CvSTART(cv), cv); |
| 3338 | } |
| 3339 | |
| 3340 | SV * |
| 3341 | op_const_sv(OP *o, CV *cv) |
| 3342 | { |
| 3343 | SV *sv = Nullsv; |
| 3344 | |
| 3345 | if(!o) |
| 3346 | return Nullsv; |
| 3347 | |
| 3348 | if(o->op_type == OP_LINESEQ && cLISTOPo->op_first) |
| 3349 | o = cLISTOPo->op_first->op_sibling; |
| 3350 | |
| 3351 | for (; o; o = o->op_next) { |
| 3352 | OPCODE type = o->op_type; |
| 3353 | |
| 3354 | if(sv && o->op_next == o) |
| 3355 | return sv; |
| 3356 | if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK) |
| 3357 | continue; |
| 3358 | if (type == OP_LEAVESUB || type == OP_RETURN) |
| 3359 | break; |
| 3360 | if (sv) |
| 3361 | return Nullsv; |
| 3362 | if (type == OP_CONST) |
| 3363 | sv = cSVOPo->op_sv; |
| 3364 | else if (type == OP_PADSV && cv) { |
| 3365 | AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]); |
| 3366 | sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv; |
| 3367 | if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1)) |
| 3368 | return Nullsv; |
| 3369 | } |
| 3370 | else |
| 3371 | return Nullsv; |
| 3372 | } |
| 3373 | if (sv) |
| 3374 | SvREADONLY_on(sv); |
| 3375 | return sv; |
| 3376 | } |
| 3377 | |
| 3378 | CV * |
| 3379 | newSUB(I32 floor, OP *o, OP *proto, OP *block) |
| 3380 | { |
| 3381 | dTHR; |
| 3382 | char *name = o ? SvPVx(cSVOPo->op_sv, na) : Nullch; |
| 3383 | GV *gv = gv_fetchpv(name ? name : "__ANON__", |
| 3384 | GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV); |
| 3385 | char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, na) : Nullch; |
| 3386 | register CV *cv; |
| 3387 | I32 ix; |
| 3388 | |
| 3389 | if (o) |
| 3390 | SAVEFREEOP(o); |
| 3391 | if (proto) |
| 3392 | SAVEFREEOP(proto); |
| 3393 | |
| 3394 | if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had |
| 3395 | maximum a prototype before. */ |
| 3396 | if (SvTYPE(gv) > SVt_NULL) { |
| 3397 | if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)) |
| 3398 | warn("Runaway prototype"); |
| 3399 | cv_ckproto((CV*)gv, NULL, ps); |
| 3400 | } |
| 3401 | if (ps) |
| 3402 | sv_setpv((SV*)gv, ps); |
| 3403 | else |
| 3404 | sv_setiv((SV*)gv, -1); |
| 3405 | SvREFCNT_dec(compcv); |
| 3406 | cv = compcv = NULL; |
| 3407 | sub_generation++; |
| 3408 | goto noblock; |
| 3409 | } |
| 3410 | |
| 3411 | if (!name || GvCVGEN(gv)) |
| 3412 | cv = Nullcv; |
| 3413 | else if (cv = GvCV(gv)) { |
| 3414 | cv_ckproto(cv, gv, ps); |
| 3415 | /* already defined (or promised)? */ |
| 3416 | if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) { |
| 3417 | SV* const_sv; |
| 3418 | bool const_changed = TRUE; |
| 3419 | if (!block) { |
| 3420 | /* just a "sub foo;" when &foo is already defined */ |
| 3421 | SAVEFREESV(compcv); |
| 3422 | goto done; |
| 3423 | } |
| 3424 | /* ahem, death to those who redefine active sort subs */ |
| 3425 | if (curstackinfo->si_type == SI_SORT && sortcop == CvSTART(cv)) |
| 3426 | croak("Can't redefine active sort subroutine %s", name); |
| 3427 | if(const_sv = cv_const_sv(cv)) |
| 3428 | const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv)); |
| 3429 | if ((const_sv && const_changed) || dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv)) |
| 3430 | && HvNAME(GvSTASH(CvGV(cv))) |
| 3431 | && strEQ(HvNAME(GvSTASH(CvGV(cv))), |
| 3432 | "autouse"))) { |
| 3433 | line_t oldline = curcop->cop_line; |
| 3434 | curcop->cop_line = copline; |
| 3435 | warn(const_sv ? "Constant subroutine %s redefined" |
| 3436 | : "Subroutine %s redefined", name); |
| 3437 | curcop->cop_line = oldline; |
| 3438 | } |
| 3439 | SvREFCNT_dec(cv); |
| 3440 | cv = Nullcv; |
| 3441 | } |
| 3442 | } |
| 3443 | if (cv) { /* must reuse cv if autoloaded */ |
| 3444 | cv_undef(cv); |
| 3445 | CvFLAGS(cv) = CvFLAGS(compcv); |
| 3446 | CvOUTSIDE(cv) = CvOUTSIDE(compcv); |
| 3447 | CvOUTSIDE(compcv) = 0; |
| 3448 | CvPADLIST(cv) = CvPADLIST(compcv); |
| 3449 | CvPADLIST(compcv) = 0; |
| 3450 | if (SvREFCNT(compcv) > 1) /* XXX Make closures transit through stub. */ |
| 3451 | CvOUTSIDE(compcv) = (CV*)SvREFCNT_inc((SV*)cv); |
| 3452 | SvREFCNT_dec(compcv); |
| 3453 | } |
| 3454 | else { |
| 3455 | cv = compcv; |
| 3456 | if (name) { |
| 3457 | GvCV(gv) = cv; |
| 3458 | GvCVGEN(gv) = 0; |
| 3459 | sub_generation++; |
| 3460 | } |
| 3461 | } |
| 3462 | CvGV(cv) = (GV*)SvREFCNT_inc(gv); |
| 3463 | CvFILEGV(cv) = curcop->cop_filegv; |
| 3464 | CvSTASH(cv) = curstash; |
| 3465 | #ifdef USE_THREADS |
| 3466 | CvOWNER(cv) = 0; |
| 3467 | New(666, CvMUTEXP(cv), 1, perl_mutex); |
| 3468 | MUTEX_INIT(CvMUTEXP(cv)); |
| 3469 | #endif /* USE_THREADS */ |
| 3470 | |
| 3471 | if (ps) |
| 3472 | sv_setpv((SV*)cv, ps); |
| 3473 | |
| 3474 | if (error_count) { |
| 3475 | op_free(block); |
| 3476 | block = Nullop; |
| 3477 | if (name) { |
| 3478 | char *s = strrchr(name, ':'); |
| 3479 | s = s ? s+1 : name; |
| 3480 | if (strEQ(s, "BEGIN")) { |
| 3481 | char *not_safe = |
| 3482 | "BEGIN not safe after errors--compilation aborted"; |
| 3483 | if (in_eval & 4) |
| 3484 | croak(not_safe); |
| 3485 | else { |
| 3486 | /* force display of errors found but not reported */ |
| 3487 | sv_catpv(ERRSV, not_safe); |
| 3488 | croak("%s", SvPVx(ERRSV, na)); |
| 3489 | } |
| 3490 | } |
| 3491 | } |
| 3492 | } |
| 3493 | if (!block) { |
| 3494 | noblock: |
| 3495 | copline = NOLINE; |
| 3496 | LEAVE_SCOPE(floor); |
| 3497 | return cv; |
| 3498 | } |
| 3499 | |
| 3500 | if (AvFILLp(comppad_name) < AvFILLp(comppad)) |
| 3501 | av_store(comppad_name, AvFILLp(comppad), Nullsv); |
| 3502 | |
| 3503 | if (CvCLONE(cv)) { |
| 3504 | SV **namep = AvARRAY(comppad_name); |
| 3505 | for (ix = AvFILLp(comppad); ix > 0; ix--) { |
| 3506 | SV *namesv; |
| 3507 | |
| 3508 | if (SvIMMORTAL(curpad[ix])) |
| 3509 | continue; |
| 3510 | /* |
| 3511 | * The only things that a clonable function needs in its |
| 3512 | * pad are references to outer lexicals and anonymous subs. |
| 3513 | * The rest are created anew during cloning. |
| 3514 | */ |
| 3515 | if (!((namesv = namep[ix]) != Nullsv && |
| 3516 | namesv != &sv_undef && |
| 3517 | (SvFAKE(namesv) || |
| 3518 | *SvPVX(namesv) == '&'))) |
| 3519 | { |
| 3520 | SvREFCNT_dec(curpad[ix]); |
| 3521 | curpad[ix] = Nullsv; |
| 3522 | } |
| 3523 | } |
| 3524 | } |
| 3525 | else { |
| 3526 | AV *av = newAV(); /* Will be @_ */ |
| 3527 | av_extend(av, 0); |
| 3528 | av_store(comppad, 0, (SV*)av); |
| 3529 | AvFLAGS(av) = AVf_REIFY; |
| 3530 | |
| 3531 | for (ix = AvFILLp(comppad); ix > 0; ix--) { |
| 3532 | if (SvIMMORTAL(curpad[ix])) |
| 3533 | continue; |
| 3534 | if (!SvPADMY(curpad[ix])) |
| 3535 | SvPADTMP_on(curpad[ix]); |
| 3536 | } |
| 3537 | } |
| 3538 | |
| 3539 | CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block)); |
| 3540 | CvSTART(cv) = LINKLIST(CvROOT(cv)); |
| 3541 | CvROOT(cv)->op_next = 0; |
| 3542 | peep(CvSTART(cv)); |
| 3543 | |
| 3544 | if (name) { |
| 3545 | char *s; |
| 3546 | |
| 3547 | if (PERLDB_SUBLINE && curstash != debstash) { |
| 3548 | SV *sv = NEWSV(0,0); |
| 3549 | SV *tmpstr = sv_newmortal(); |
| 3550 | GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV); |
| 3551 | CV *cv; |
| 3552 | HV *hv; |
| 3553 | |
| 3554 | sv_setpvf(sv, "%_:%ld-%ld", |
| 3555 | GvSV(curcop->cop_filegv), |
| 3556 | (long)subline, (long)curcop->cop_line); |
| 3557 | gv_efullname3(tmpstr, gv, Nullch); |
| 3558 | hv_store(GvHV(DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0); |
| 3559 | hv = GvHVn(db_postponed); |
| 3560 | if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr)) |
| 3561 | && (cv = GvCV(db_postponed))) { |
| 3562 | dSP; |
| 3563 | PUSHMARK(SP); |
| 3564 | XPUSHs(tmpstr); |
| 3565 | PUTBACK; |
| 3566 | perl_call_sv((SV*)cv, G_DISCARD); |
| 3567 | } |
| 3568 | } |
| 3569 | |
| 3570 | if ((s = strrchr(name,':'))) |
| 3571 | s++; |
| 3572 | else |
| 3573 | s = name; |
| 3574 | if (strEQ(s, "BEGIN")) { |
| 3575 | I32 oldscope = scopestack_ix; |
| 3576 | ENTER; |
| 3577 | SAVESPTR(compiling.cop_filegv); |
| 3578 | SAVEI16(compiling.cop_line); |
| 3579 | save_svref(&rs); |
| 3580 | sv_setsv(rs, nrs); |
| 3581 | |
| 3582 | if (!beginav) |
| 3583 | beginav = newAV(); |
| 3584 | DEBUG_x( dump_sub(gv) ); |
| 3585 | av_push(beginav, (SV *)cv); |
| 3586 | GvCV(gv) = 0; |
| 3587 | call_list(oldscope, beginav); |
| 3588 | |
| 3589 | curcop = &compiling; |
| 3590 | LEAVE; |
| 3591 | } |
| 3592 | else if (strEQ(s, "END") && !error_count) { |
| 3593 | if (!endav) |
| 3594 | endav = newAV(); |
| 3595 | av_unshift(endav, 1); |
| 3596 | av_store(endav, 0, (SV *)cv); |
| 3597 | GvCV(gv) = 0; |
| 3598 | } |
| 3599 | else if (strEQ(s, "INIT") && !error_count) { |
| 3600 | if (!initav) |
| 3601 | initav = newAV(); |
| 3602 | av_push(initav, SvREFCNT_inc(cv)); |
| 3603 | } |
| 3604 | } |
| 3605 | |
| 3606 | done: |
| 3607 | copline = NOLINE; |
| 3608 | LEAVE_SCOPE(floor); |
| 3609 | return cv; |
| 3610 | } |
| 3611 | |
| 3612 | void |
| 3613 | newCONSTSUB(HV *stash, char *name, SV *sv) |
| 3614 | { |
| 3615 | dTHR; |
| 3616 | U32 oldhints = hints; |
| 3617 | HV *old_cop_stash = curcop->cop_stash; |
| 3618 | HV *old_curstash = curstash; |
| 3619 | line_t oldline = curcop->cop_line; |
| 3620 | curcop->cop_line = copline; |
| 3621 | |
| 3622 | hints &= ~HINT_BLOCK_SCOPE; |
| 3623 | if(stash) |
| 3624 | curstash = curcop->cop_stash = stash; |
| 3625 | |
| 3626 | newSUB( |
| 3627 | start_subparse(FALSE, 0), |
| 3628 | newSVOP(OP_CONST, 0, newSVpv(name,0)), |
| 3629 | newSVOP(OP_CONST, 0, &sv_no), /* SvPV(&sv_no) == "" -- GMB */ |
| 3630 | newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv)) |
| 3631 | ); |
| 3632 | |
| 3633 | hints = oldhints; |
| 3634 | curcop->cop_stash = old_cop_stash; |
| 3635 | curstash = old_curstash; |
| 3636 | curcop->cop_line = oldline; |
| 3637 | } |
| 3638 | |
| 3639 | CV * |
| 3640 | newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename) |
| 3641 | { |
| 3642 | dTHR; |
| 3643 | GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV); |
| 3644 | register CV *cv; |
| 3645 | |
| 3646 | if (cv = (name ? GvCV(gv) : Nullcv)) { |
| 3647 | if (GvCVGEN(gv)) { |
| 3648 | /* just a cached method */ |
| 3649 | SvREFCNT_dec(cv); |
| 3650 | cv = 0; |
| 3651 | } |
| 3652 | else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) { |
| 3653 | /* already defined (or promised) */ |
| 3654 | if (dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv)) |
| 3655 | && HvNAME(GvSTASH(CvGV(cv))) |
| 3656 | && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) { |
| 3657 | line_t oldline = curcop->cop_line; |
| 3658 | curcop->cop_line = copline; |
| 3659 | warn("Subroutine %s redefined",name); |
| 3660 | curcop->cop_line = oldline; |
| 3661 | } |
| 3662 | SvREFCNT_dec(cv); |
| 3663 | cv = 0; |
| 3664 | } |
| 3665 | } |
| 3666 | |
| 3667 | if (cv) /* must reuse cv if autoloaded */ |
| 3668 | cv_undef(cv); |
| 3669 | else { |
| 3670 | cv = (CV*)NEWSV(1105,0); |
| 3671 | sv_upgrade((SV *)cv, SVt_PVCV); |
| 3672 | if (name) { |
| 3673 | GvCV(gv) = cv; |
| 3674 | GvCVGEN(gv) = 0; |
| 3675 | sub_generation++; |
| 3676 | } |
| 3677 | } |
| 3678 | CvGV(cv) = (GV*)SvREFCNT_inc(gv); |
| 3679 | #ifdef USE_THREADS |
| 3680 | New(666, CvMUTEXP(cv), 1, perl_mutex); |
| 3681 | MUTEX_INIT(CvMUTEXP(cv)); |
| 3682 | CvOWNER(cv) = 0; |
| 3683 | #endif /* USE_THREADS */ |
| 3684 | CvFILEGV(cv) = gv_fetchfile(filename); |
| 3685 | CvXSUB(cv) = subaddr; |
| 3686 | |
| 3687 | if (name) { |
| 3688 | char *s = strrchr(name,':'); |
| 3689 | if (s) |
| 3690 | s++; |
| 3691 | else |
| 3692 | s = name; |
| 3693 | if (strEQ(s, "BEGIN")) { |
| 3694 | if (!beginav) |
| 3695 | beginav = newAV(); |
| 3696 | av_push(beginav, (SV *)cv); |
| 3697 | GvCV(gv) = 0; |
| 3698 | } |
| 3699 | else if (strEQ(s, "END")) { |
| 3700 | if (!endav) |
| 3701 | endav = newAV(); |
| 3702 | av_unshift(endav, 1); |
| 3703 | av_store(endav, 0, (SV *)cv); |
| 3704 | GvCV(gv) = 0; |
| 3705 | } |
| 3706 | else if (strEQ(s, "INIT")) { |
| 3707 | if (!initav) |
| 3708 | initav = newAV(); |
| 3709 | av_push(initav, (SV *)cv); |
| 3710 | } |
| 3711 | } |
| 3712 | else |
| 3713 | CvANON_on(cv); |
| 3714 | |
| 3715 | return cv; |
| 3716 | } |
| 3717 | |
| 3718 | void |
| 3719 | newFORM(I32 floor, OP *o, OP *block) |
| 3720 | { |
| 3721 | dTHR; |
| 3722 | register CV *cv; |
| 3723 | char *name; |
| 3724 | GV *gv; |
| 3725 | I32 ix; |
| 3726 | |
| 3727 | if (o) |
| 3728 | name = SvPVx(cSVOPo->op_sv, na); |
| 3729 | else |
| 3730 | name = "STDOUT"; |
| 3731 | gv = gv_fetchpv(name,TRUE, SVt_PVFM); |
| 3732 | GvMULTI_on(gv); |
| 3733 | if (cv = GvFORM(gv)) { |
| 3734 | if (dowarn) { |
| 3735 | line_t oldline = curcop->cop_line; |
| 3736 | |
| 3737 | curcop->cop_line = copline; |
| 3738 | warn("Format %s redefined",name); |
| 3739 | curcop->cop_line = oldline; |
| 3740 | } |
| 3741 | SvREFCNT_dec(cv); |
| 3742 | } |
| 3743 | cv = compcv; |
| 3744 | GvFORM(gv) = cv; |
| 3745 | CvGV(cv) = (GV*)SvREFCNT_inc(gv); |
| 3746 | CvFILEGV(cv) = curcop->cop_filegv; |
| 3747 | |
| 3748 | for (ix = AvFILLp(comppad); ix > 0; ix--) { |
| 3749 | if (!SvPADMY(curpad[ix]) && !SvIMMORTAL(curpad[ix])) |
| 3750 | SvPADTMP_on(curpad[ix]); |
| 3751 | } |
| 3752 | |
| 3753 | CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block)); |
| 3754 | CvSTART(cv) = LINKLIST(CvROOT(cv)); |
| 3755 | CvROOT(cv)->op_next = 0; |
| 3756 | peep(CvSTART(cv)); |
| 3757 | op_free(o); |
| 3758 | copline = NOLINE; |
| 3759 | LEAVE_SCOPE(floor); |
| 3760 | } |
| 3761 | |
| 3762 | OP * |
| 3763 | newANONLIST(OP *o) |
| 3764 | { |
| 3765 | return newUNOP(OP_REFGEN, 0, |
| 3766 | mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN)); |
| 3767 | } |
| 3768 | |
| 3769 | OP * |
| 3770 | newANONHASH(OP *o) |
| 3771 | { |
| 3772 | return newUNOP(OP_REFGEN, 0, |
| 3773 | mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN)); |
| 3774 | } |
| 3775 | |
| 3776 | OP * |
| 3777 | newANONSUB(I32 floor, OP *proto, OP *block) |
| 3778 | { |
| 3779 | return newUNOP(OP_REFGEN, 0, |
| 3780 | newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block))); |
| 3781 | } |
| 3782 | |
| 3783 | OP * |
| 3784 | oopsAV(OP *o) |
| 3785 | { |
| 3786 | switch (o->op_type) { |
| 3787 | case OP_PADSV: |
| 3788 | o->op_type = OP_PADAV; |
| 3789 | o->op_ppaddr = ppaddr[OP_PADAV]; |
| 3790 | return ref(newUNOP(OP_RV2AV, 0, scalar(o)), OP_RV2AV); |
| 3791 | |
| 3792 | case OP_RV2SV: |
| 3793 | o->op_type = OP_RV2AV; |
| 3794 | o->op_ppaddr = ppaddr[OP_RV2AV]; |
| 3795 | ref(o, OP_RV2AV); |
| 3796 | break; |
| 3797 | |
| 3798 | default: |
| 3799 | warn("oops: oopsAV"); |
| 3800 | break; |
| 3801 | } |
| 3802 | return o; |
| 3803 | } |
| 3804 | |
| 3805 | OP * |
| 3806 | oopsHV(OP *o) |
| 3807 | { |
| 3808 | switch (o->op_type) { |
| 3809 | case OP_PADSV: |
| 3810 | case OP_PADAV: |
| 3811 | o->op_type = OP_PADHV; |
| 3812 | o->op_ppaddr = ppaddr[OP_PADHV]; |
| 3813 | return ref(newUNOP(OP_RV2HV, 0, scalar(o)), OP_RV2HV); |
| 3814 | |
| 3815 | case OP_RV2SV: |
| 3816 | case OP_RV2AV: |
| 3817 | o->op_type = OP_RV2HV; |
| 3818 | o->op_ppaddr = ppaddr[OP_RV2HV]; |
| 3819 | ref(o, OP_RV2HV); |
| 3820 | break; |
| 3821 | |
| 3822 | default: |
| 3823 | warn("oops: oopsHV"); |
| 3824 | break; |
| 3825 | } |
| 3826 | return o; |
| 3827 | } |
| 3828 | |
| 3829 | OP * |
| 3830 | newAVREF(OP *o) |
| 3831 | { |
| 3832 | if (o->op_type == OP_PADANY) { |
| 3833 | o->op_type = OP_PADAV; |
| 3834 | o->op_ppaddr = ppaddr[OP_PADAV]; |
| 3835 | return o; |
| 3836 | } |
| 3837 | return newUNOP(OP_RV2AV, 0, scalar(o)); |
| 3838 | } |
| 3839 | |
| 3840 | OP * |
| 3841 | newGVREF(I32 type, OP *o) |
| 3842 | { |
| 3843 | if (type == OP_MAPSTART) |
| 3844 | return newUNOP(OP_NULL, 0, o); |
| 3845 | return ref(newUNOP(OP_RV2GV, OPf_REF, o), type); |
| 3846 | } |
| 3847 | |
| 3848 | OP * |
| 3849 | newHVREF(OP *o) |
| 3850 | { |
| 3851 | if (o->op_type == OP_PADANY) { |
| 3852 | o->op_type = OP_PADHV; |
| 3853 | o->op_ppaddr = ppaddr[OP_PADHV]; |
| 3854 | return o; |
| 3855 | } |
| 3856 | return newUNOP(OP_RV2HV, 0, scalar(o)); |
| 3857 | } |
| 3858 | |
| 3859 | OP * |
| 3860 | oopsCV(OP *o) |
| 3861 | { |
| 3862 | croak("NOT IMPL LINE %d",__LINE__); |
| 3863 | /* STUB */ |
| 3864 | return o; |
| 3865 | } |
| 3866 | |
| 3867 | OP * |
| 3868 | newCVREF(I32 flags, OP *o) |
| 3869 | { |
| 3870 | return newUNOP(OP_RV2CV, flags, scalar(o)); |
| 3871 | } |
| 3872 | |
| 3873 | OP * |
| 3874 | newSVREF(OP *o) |
| 3875 | { |
| 3876 | if (o->op_type == OP_PADANY) { |
| 3877 | o->op_type = OP_PADSV; |
| 3878 | o->op_ppaddr = ppaddr[OP_PADSV]; |
| 3879 | return o; |
| 3880 | } |
| 3881 | else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) { |
| 3882 | o->op_flags |= OPpDONE_SVREF; |
| 3883 | return o; |
| 3884 | } |
| 3885 | return newUNOP(OP_RV2SV, 0, scalar(o)); |
| 3886 | } |
| 3887 | |
| 3888 | /* Check routines. */ |
| 3889 | |
| 3890 | OP * |
| 3891 | ck_anoncode(OP *o) |
| 3892 | { |
| 3893 | PADOFFSET ix; |
| 3894 | SV* name; |
| 3895 | |
| 3896 | name = NEWSV(1106,0); |
| 3897 | sv_upgrade(name, SVt_PVNV); |
| 3898 | sv_setpvn(name, "&", 1); |
| 3899 | SvIVX(name) = -1; |
| 3900 | SvNVX(name) = 1; |
| 3901 | ix = pad_alloc(o->op_type, SVs_PADMY); |
| 3902 | av_store(comppad_name, ix, name); |
| 3903 | av_store(comppad, ix, cSVOPo->op_sv); |
| 3904 | SvPADMY_on(cSVOPo->op_sv); |
| 3905 | cSVOPo->op_sv = Nullsv; |
| 3906 | cSVOPo->op_targ = ix; |
| 3907 | return o; |
| 3908 | } |
| 3909 | |
| 3910 | OP * |
| 3911 | ck_bitop(OP *o) |
| 3912 | { |
| 3913 | o->op_private = hints; |
| 3914 | return o; |
| 3915 | } |
| 3916 | |
| 3917 | OP * |
| 3918 | ck_concat(OP *o) |
| 3919 | { |
| 3920 | if (cUNOPo->op_first->op_type == OP_CONCAT) |
| 3921 | o->op_flags |= OPf_STACKED; |
| 3922 | return o; |
| 3923 | } |
| 3924 | |
| 3925 | OP * |
| 3926 | ck_spair(OP *o) |
| 3927 | { |
| 3928 | if (o->op_flags & OPf_KIDS) { |
| 3929 | OP* newop; |
| 3930 | OP* kid; |
| 3931 | OPCODE type = o->op_type; |
| 3932 | o = modkids(ck_fun(o), type); |
| 3933 | kid = cUNOPo->op_first; |
| 3934 | newop = kUNOP->op_first->op_sibling; |
| 3935 | if (newop && |
| 3936 | (newop->op_sibling || |
| 3937 | !(opargs[newop->op_type] & OA_RETSCALAR) || |
| 3938 | newop->op_type == OP_PADAV || newop->op_type == OP_PADHV || |
| 3939 | newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) { |
| 3940 | |
| 3941 | return o; |
| 3942 | } |
| 3943 | op_free(kUNOP->op_first); |
| 3944 | kUNOP->op_first = newop; |
| 3945 | } |
| 3946 | o->op_ppaddr = ppaddr[++o->op_type]; |
| 3947 | return ck_fun(o); |
| 3948 | } |
| 3949 | |
| 3950 | OP * |
| 3951 | ck_delete(OP *o) |
| 3952 | { |
| 3953 | o = ck_fun(o); |
| 3954 | o->op_private = 0; |
| 3955 | if (o->op_flags & OPf_KIDS) { |
| 3956 | OP *kid = cUNOPo->op_first; |
| 3957 | if (kid->op_type == OP_HSLICE) |
| 3958 | o->op_private |= OPpSLICE; |
| 3959 | else if (kid->op_type != OP_HELEM) |
| 3960 | croak("%s argument is not a HASH element or slice", |
| 3961 | op_desc[o->op_type]); |
| 3962 | null(kid); |
| 3963 | } |
| 3964 | return o; |
| 3965 | } |
| 3966 | |
| 3967 | OP * |
| 3968 | ck_eof(OP *o) |
| 3969 | { |
| 3970 | I32 type = o->op_type; |
| 3971 | |
| 3972 | if (o->op_flags & OPf_KIDS) { |
| 3973 | if (cLISTOPo->op_first->op_type == OP_STUB) { |
| 3974 | op_free(o); |
| 3975 | o = newUNOP(type, OPf_SPECIAL, |
| 3976 | newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV))); |
| 3977 | } |
| 3978 | return ck_fun(o); |
| 3979 | } |
| 3980 | return o; |
| 3981 | } |
| 3982 | |
| 3983 | OP * |
| 3984 | ck_eval(OP *o) |
| 3985 | { |
| 3986 | hints |= HINT_BLOCK_SCOPE; |
| 3987 | if (o->op_flags & OPf_KIDS) { |
| 3988 | SVOP *kid = (SVOP*)cUNOPo->op_first; |
| 3989 | |
| 3990 | if (!kid) { |
| 3991 | o->op_flags &= ~OPf_KIDS; |
| 3992 | null(o); |
| 3993 | } |
| 3994 | else if (kid->op_type == OP_LINESEQ) { |
| 3995 | LOGOP *enter; |
| 3996 | |
| 3997 | kid->op_next = o->op_next; |
| 3998 | cUNOPo->op_first = 0; |
| 3999 | op_free(o); |
| 4000 | |
| 4001 | Newz(1101, enter, 1, LOGOP); |
| 4002 | enter->op_type = OP_ENTERTRY; |
| 4003 | enter->op_ppaddr = ppaddr[OP_ENTERTRY]; |
| 4004 | enter->op_private = 0; |
| 4005 | |
| 4006 | /* establish postfix order */ |
| 4007 | enter->op_next = (OP*)enter; |
| 4008 | |
| 4009 | o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid); |
| 4010 | o->op_type = OP_LEAVETRY; |
| 4011 | o->op_ppaddr = ppaddr[OP_LEAVETRY]; |
| 4012 | enter->op_other = o; |
| 4013 | return o; |
| 4014 | } |
| 4015 | else |
| 4016 | scalar((OP*)kid); |
| 4017 | } |
| 4018 | else { |
| 4019 | op_free(o); |
| 4020 | o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP()); |
| 4021 | } |
| 4022 | o->op_targ = (PADOFFSET)hints; |
| 4023 | return o; |
| 4024 | } |
| 4025 | |
| 4026 | OP * |
| 4027 | ck_exec(OP *o) |
| 4028 | { |
| 4029 | OP *kid; |
| 4030 | if (o->op_flags & OPf_STACKED) { |
| 4031 | o = ck_fun(o); |
| 4032 | kid = cUNOPo->op_first->op_sibling; |
| 4033 | if (kid->op_type == OP_RV2GV) |
| 4034 | null(kid); |
| 4035 | } |
| 4036 | else |
| 4037 | o = listkids(o); |
| 4038 | return o; |
| 4039 | } |
| 4040 | |
| 4041 | OP * |
| 4042 | ck_exists(OP *o) |
| 4043 | { |
| 4044 | o = ck_fun(o); |
| 4045 | if (o->op_flags & OPf_KIDS) { |
| 4046 | OP *kid = cUNOPo->op_first; |
| 4047 | if (kid->op_type != OP_HELEM) |
| 4048 | croak("%s argument is not a HASH element", op_desc[o->op_type]); |
| 4049 | null(kid); |
| 4050 | } |
| 4051 | return o; |
| 4052 | } |
| 4053 | |
| 4054 | OP * |
| 4055 | ck_gvconst(register OP *o) |
| 4056 | { |
| 4057 | o = fold_constants(o); |
| 4058 | if (o->op_type == OP_CONST) |
| 4059 | o->op_type = OP_GV; |
| 4060 | return o; |
| 4061 | } |
| 4062 | |
| 4063 | OP * |
| 4064 | ck_rvconst(register OP *o) |
| 4065 | { |
| 4066 | dTHR; |
| 4067 | SVOP *kid = (SVOP*)cUNOPo->op_first; |
| 4068 | |
| 4069 | o->op_private |= (hints & HINT_STRICT_REFS); |
| 4070 | if (kid->op_type == OP_CONST) { |
| 4071 | char *name; |
| 4072 | int iscv; |
| 4073 | GV *gv; |
| 4074 | |
| 4075 | name = SvPV(kid->op_sv, na); |
| 4076 | if ((hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) { |
| 4077 | char *badthing = Nullch; |
| 4078 | switch (o->op_type) { |
| 4079 | case OP_RV2SV: |
| 4080 | badthing = "a SCALAR"; |
| 4081 | break; |
| 4082 | case OP_RV2AV: |
| 4083 | badthing = "an ARRAY"; |
| 4084 | break; |
| 4085 | case OP_RV2HV: |
| 4086 | badthing = "a HASH"; |
| 4087 | break; |
| 4088 | } |
| 4089 | if (badthing) |
| 4090 | croak( |
| 4091 | "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use", |
| 4092 | name, badthing); |
| 4093 | } |
| 4094 | /* |
| 4095 | * This is a little tricky. We only want to add the symbol if we |
| 4096 | * didn't add it in the lexer. Otherwise we get duplicate strict |
| 4097 | * warnings. But if we didn't add it in the lexer, we must at |
| 4098 | * least pretend like we wanted to add it even if it existed before, |
| 4099 | * or we get possible typo warnings. OPpCONST_ENTERED says |
| 4100 | * whether the lexer already added THIS instance of this symbol. |
| 4101 | */ |
| 4102 | iscv = (o->op_type == OP_RV2CV) * 2; |
| 4103 | do { |
| 4104 | gv = gv_fetchpv(name, |
| 4105 | iscv | !(kid->op_private & OPpCONST_ENTERED), |
| 4106 | iscv |
| 4107 | ? SVt_PVCV |
| 4108 | : o->op_type == OP_RV2SV |
| 4109 | ? SVt_PV |
| 4110 | : o->op_type == OP_RV2AV |
| 4111 | ? SVt_PVAV |
| 4112 | : o->op_type == OP_RV2HV |
| 4113 | ? SVt_PVHV |
| 4114 | : SVt_PVGV); |
| 4115 | } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++); |
| 4116 | if (gv) { |
| 4117 | kid->op_type = OP_GV; |
| 4118 | SvREFCNT_dec(kid->op_sv); |
| 4119 | kid->op_sv = SvREFCNT_inc(gv); |
| 4120 | } |
| 4121 | } |
| 4122 | return o; |
| 4123 | } |
| 4124 | |
| 4125 | OP * |
| 4126 | ck_ftst(OP *o) |
| 4127 | { |
| 4128 | dTHR; |
| 4129 | I32 type = o->op_type; |
| 4130 | |
| 4131 | if (o->op_flags & OPf_REF) |
| 4132 | return o; |
| 4133 | |
| 4134 | if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) { |
| 4135 | SVOP *kid = (SVOP*)cUNOPo->op_first; |
| 4136 | |
| 4137 | if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) { |
| 4138 | OP *newop = newGVOP(type, OPf_REF, |
| 4139 | gv_fetchpv(SvPVx(kid->op_sv, na), TRUE, SVt_PVIO)); |
| 4140 | op_free(o); |
| 4141 | return newop; |
| 4142 | } |
| 4143 | } |
| 4144 | else { |
| 4145 | op_free(o); |
| 4146 | if (type == OP_FTTTY) |
| 4147 | return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE, |
| 4148 | SVt_PVIO)); |
| 4149 | else |
| 4150 | return newUNOP(type, 0, newDEFSVOP()); |
| 4151 | } |
| 4152 | return o; |
| 4153 | } |
| 4154 | |
| 4155 | OP * |
| 4156 | ck_fun(OP *o) |
| 4157 | { |
| 4158 | dTHR; |
| 4159 | register OP *kid; |
| 4160 | OP **tokid; |
| 4161 | OP *sibl; |
| 4162 | I32 numargs = 0; |
| 4163 | int type = o->op_type; |
| 4164 | register I32 oa = opargs[type] >> OASHIFT; |
| 4165 | |
| 4166 | if (o->op_flags & OPf_STACKED) { |
| 4167 | if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL)) |
| 4168 | oa &= ~OA_OPTIONAL; |
| 4169 | else |
| 4170 | return no_fh_allowed(o); |
| 4171 | } |
| 4172 | |
| 4173 | if (o->op_flags & OPf_KIDS) { |
| 4174 | tokid = &cLISTOPo->op_first; |
| 4175 | kid = cLISTOPo->op_first; |
| 4176 | if (kid->op_type == OP_PUSHMARK || |
| 4177 | kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK) |
| 4178 | { |
| 4179 | tokid = &kid->op_sibling; |
| 4180 | kid = kid->op_sibling; |
| 4181 | } |
| 4182 | if (!kid && opargs[type] & OA_DEFGV) |
| 4183 | *tokid = kid = newDEFSVOP(); |
| 4184 | |
| 4185 | while (oa && kid) { |
| 4186 | numargs++; |
| 4187 | sibl = kid->op_sibling; |
| 4188 | switch (oa & 7) { |
| 4189 | case OA_SCALAR: |
| 4190 | scalar(kid); |
| 4191 | break; |
| 4192 | case OA_LIST: |
| 4193 | if (oa < 16) { |
| 4194 | kid = 0; |
| 4195 | continue; |
| 4196 | } |
| 4197 | else |
| 4198 | list(kid); |
| 4199 | break; |
| 4200 | case OA_AVREF: |
| 4201 | if (kid->op_type == OP_CONST && |
| 4202 | (kid->op_private & OPpCONST_BARE)) { |
| 4203 | char *name = SvPVx(((SVOP*)kid)->op_sv, na); |
| 4204 | OP *newop = newAVREF(newGVOP(OP_GV, 0, |
| 4205 | gv_fetchpv(name, TRUE, SVt_PVAV) )); |
| 4206 | if (dowarn) |
| 4207 | warn("Array @%s missing the @ in argument %ld of %s()", |
| 4208 | name, (long)numargs, op_desc[type]); |
| 4209 | op_free(kid); |
| 4210 | kid = newop; |
| 4211 | kid->op_sibling = sibl; |
| 4212 | *tokid = kid; |
| 4213 | } |
| 4214 | else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV) |
| 4215 | bad_type(numargs, "array", op_desc[o->op_type], kid); |
| 4216 | mod(kid, type); |
| 4217 | break; |
| 4218 | case OA_HVREF: |
| 4219 | if (kid->op_type == OP_CONST && |
| 4220 | (kid->op_private & OPpCONST_BARE)) { |
| 4221 | char *name = SvPVx(((SVOP*)kid)->op_sv, na); |
| 4222 | OP *newop = newHVREF(newGVOP(OP_GV, 0, |
| 4223 | gv_fetchpv(name, TRUE, SVt_PVHV) )); |
| 4224 | if (dowarn) |
| 4225 | warn("Hash %%%s missing the %% in argument %ld of %s()", |
| 4226 | name, (long)numargs, op_desc[type]); |
| 4227 | op_free(kid); |
| 4228 | kid = newop; |
| 4229 | kid->op_sibling = sibl; |
| 4230 | *tokid = kid; |
| 4231 | } |
| 4232 | else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV) |
| 4233 | bad_type(numargs, "hash", op_desc[o->op_type], kid); |
| 4234 | mod(kid, type); |
| 4235 | break; |
| 4236 | case OA_CVREF: |
| 4237 | { |
| 4238 | OP *newop = newUNOP(OP_NULL, 0, kid); |
| 4239 | kid->op_sibling = 0; |
| 4240 | linklist(kid); |
| 4241 | newop->op_next = newop; |
| 4242 | kid = newop; |
| 4243 | kid->op_sibling = sibl; |
| 4244 | *tokid = kid; |
| 4245 | } |
| 4246 | break; |
| 4247 | case OA_FILEREF: |
| 4248 | if (kid->op_type != OP_GV) { |
| 4249 | if (kid->op_type == OP_CONST && |
| 4250 | (kid->op_private & OPpCONST_BARE)) { |
| 4251 | OP *newop = newGVOP(OP_GV, 0, |
| 4252 | gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, na), TRUE, |
| 4253 | SVt_PVIO) ); |
| 4254 | op_free(kid); |
| 4255 | kid = newop; |
| 4256 | } |
| 4257 | else { |
| 4258 | kid->op_sibling = 0; |
| 4259 | kid = newUNOP(OP_RV2GV, 0, scalar(kid)); |
| 4260 | } |
| 4261 | kid->op_sibling = sibl; |
| 4262 | *tokid = kid; |
| 4263 | } |
| 4264 | scalar(kid); |
| 4265 | break; |
| 4266 | case OA_SCALARREF: |
| 4267 | mod(scalar(kid), type); |
| 4268 | break; |
| 4269 | } |
| 4270 | oa >>= 4; |
| 4271 | tokid = &kid->op_sibling; |
| 4272 | kid = kid->op_sibling; |
| 4273 | } |
| 4274 | o->op_private |= numargs; |
| 4275 | if (kid) |
| 4276 | return too_many_arguments(o,op_desc[o->op_type]); |
| 4277 | listkids(o); |
| 4278 | } |
| 4279 | else if (opargs[type] & OA_DEFGV) { |
| 4280 | op_free(o); |
| 4281 | return newUNOP(type, 0, newDEFSVOP()); |
| 4282 | } |
| 4283 | |
| 4284 | if (oa) { |
| 4285 | while (oa & OA_OPTIONAL) |
| 4286 | oa >>= 4; |
| 4287 | if (oa && oa != OA_LIST) |
| 4288 | return too_few_arguments(o,op_desc[o->op_type]); |
| 4289 | } |
| 4290 | return o; |
| 4291 | } |
| 4292 | |
| 4293 | OP * |
| 4294 | ck_glob(OP *o) |
| 4295 | { |
| 4296 | GV *gv; |
| 4297 | |
| 4298 | if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling) |
| 4299 | append_elem(OP_GLOB, o, newDEFSVOP()); |
| 4300 | |
| 4301 | if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv))) |
| 4302 | gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV); |
| 4303 | |
| 4304 | if (gv && GvIMPORTED_CV(gv)) { |
| 4305 | static int glob_index; |
| 4306 | |
| 4307 | append_elem(OP_GLOB, o, |
| 4308 | newSVOP(OP_CONST, 0, newSViv(glob_index++))); |
| 4309 | o->op_type = OP_LIST; |
| 4310 | o->op_ppaddr = ppaddr[OP_LIST]; |
| 4311 | cLISTOPo->op_first->op_type = OP_PUSHMARK; |
| 4312 | cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK]; |
| 4313 | o = newUNOP(OP_ENTERSUB, OPf_STACKED, |
| 4314 | append_elem(OP_LIST, o, |
| 4315 | scalar(newUNOP(OP_RV2CV, 0, |
| 4316 | newGVOP(OP_GV, 0, gv))))); |
| 4317 | o = newUNOP(OP_NULL, 0, ck_subr(o)); |
| 4318 | o->op_targ = OP_GLOB; /* hint at what it used to be */ |
| 4319 | return o; |
| 4320 | } |
| 4321 | gv = newGVgen("main"); |
| 4322 | gv_IOadd(gv); |
| 4323 | append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv)); |
| 4324 | scalarkids(o); |
| 4325 | return ck_fun(o); |
| 4326 | } |
| 4327 | |
| 4328 | OP * |
| 4329 | ck_grep(OP *o) |
| 4330 | { |
| 4331 | LOGOP *gwop; |
| 4332 | OP *kid; |
| 4333 | OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE; |
| 4334 | |
| 4335 | o->op_ppaddr = ppaddr[OP_GREPSTART]; |
| 4336 | Newz(1101, gwop, 1, LOGOP); |
| 4337 | |
| 4338 | if (o->op_flags & OPf_STACKED) { |
| 4339 | OP* k; |
| 4340 | o = ck_sort(o); |
| 4341 | kid = cLISTOPo->op_first->op_sibling; |
| 4342 | for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) { |
| 4343 | kid = k; |
| 4344 | } |
| 4345 | kid->op_next = (OP*)gwop; |
| 4346 | o->op_flags &= ~OPf_STACKED; |
| 4347 | } |
| 4348 | kid = cLISTOPo->op_first->op_sibling; |
| 4349 | if (type == OP_MAPWHILE) |
| 4350 | list(kid); |
| 4351 | else |
| 4352 | scalar(kid); |
| 4353 | o = ck_fun(o); |
| 4354 | if (error_count) |
| 4355 | return o; |
| 4356 | kid = cLISTOPo->op_first->op_sibling; |
| 4357 | if (kid->op_type != OP_NULL) |
| 4358 | croak("panic: ck_grep"); |
| 4359 | kid = kUNOP->op_first; |
| 4360 | |
| 4361 | gwop->op_type = type; |
| 4362 | gwop->op_ppaddr = ppaddr[type]; |
| 4363 | gwop->op_first = listkids(o); |
| 4364 | gwop->op_flags |= OPf_KIDS; |
| 4365 | gwop->op_private = 1; |
| 4366 | gwop->op_other = LINKLIST(kid); |
| 4367 | gwop->op_targ = pad_alloc(type, SVs_PADTMP); |
| 4368 | kid->op_next = (OP*)gwop; |
| 4369 | |
| 4370 | kid = cLISTOPo->op_first->op_sibling; |
| 4371 | if (!kid || !kid->op_sibling) |
| 4372 | return too_few_arguments(o,op_desc[o->op_type]); |
| 4373 | for (kid = kid->op_sibling; kid; kid = kid->op_sibling) |
| 4374 | mod(kid, OP_GREPSTART); |
| 4375 | |
| 4376 | return (OP*)gwop; |
| 4377 | } |
| 4378 | |
| 4379 | OP * |
| 4380 | ck_index(OP *o) |
| 4381 | { |
| 4382 | if (o->op_flags & OPf_KIDS) { |
| 4383 | OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
| 4384 | if (kid && kid->op_type == OP_CONST) |
| 4385 | fbm_compile(((SVOP*)kid)->op_sv, 0); |
| 4386 | } |
| 4387 | return ck_fun(o); |
| 4388 | } |
| 4389 | |
| 4390 | OP * |
| 4391 | ck_lengthconst(OP *o) |
| 4392 | { |
| 4393 | /* XXX length optimization goes here */ |
| 4394 | return ck_fun(o); |
| 4395 | } |
| 4396 | |
| 4397 | OP * |
| 4398 | ck_lfun(OP *o) |
| 4399 | { |
| 4400 | OPCODE type = o->op_type; |
| 4401 | return modkids(ck_fun(o), type); |
| 4402 | } |
| 4403 | |
| 4404 | OP * |
| 4405 | ck_rfun(OP *o) |
| 4406 | { |
| 4407 | OPCODE type = o->op_type; |
| 4408 | return refkids(ck_fun(o), type); |
| 4409 | } |
| 4410 | |
| 4411 | OP * |
| 4412 | ck_listiob(OP *o) |
| 4413 | { |
| 4414 | register OP *kid; |
| 4415 | |
| 4416 | kid = cLISTOPo->op_first; |
| 4417 | if (!kid) { |
| 4418 | o = force_list(o); |
| 4419 | kid = cLISTOPo->op_first; |
| 4420 | } |
| 4421 | if (kid->op_type == OP_PUSHMARK) |
| 4422 | kid = kid->op_sibling; |
| 4423 | if (kid && o->op_flags & OPf_STACKED) |
| 4424 | kid = kid->op_sibling; |
| 4425 | else if (kid && !kid->op_sibling) { /* print HANDLE; */ |
| 4426 | if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) { |
| 4427 | o->op_flags |= OPf_STACKED; /* make it a filehandle */ |
| 4428 | kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid)); |
| 4429 | cLISTOPo->op_first->op_sibling = kid; |
| 4430 | cLISTOPo->op_last = kid; |
| 4431 | kid = kid->op_sibling; |
| 4432 | } |
| 4433 | } |
| 4434 | |
| 4435 | if (!kid) |
| 4436 | append_elem(o->op_type, o, newDEFSVOP()); |
| 4437 | |
| 4438 | o = listkids(o); |
| 4439 | |
| 4440 | o->op_private = 0; |
| 4441 | #ifdef USE_LOCALE |
| 4442 | if (hints & HINT_LOCALE) |
| 4443 | o->op_private |= OPpLOCALE; |
| 4444 | #endif |
| 4445 | |
| 4446 | return o; |
| 4447 | } |
| 4448 | |
| 4449 | OP * |
| 4450 | ck_fun_locale(OP *o) |
| 4451 | { |
| 4452 | o = ck_fun(o); |
| 4453 | |
| 4454 | o->op_private = 0; |
| 4455 | #ifdef USE_LOCALE |
| 4456 | if (hints & HINT_LOCALE) |
| 4457 | o->op_private |= OPpLOCALE; |
| 4458 | #endif |
| 4459 | |
| 4460 | return o; |
| 4461 | } |
| 4462 | |
| 4463 | OP * |
| 4464 | ck_scmp(OP *o) |
| 4465 | { |
| 4466 | o->op_private = 0; |
| 4467 | #ifdef USE_LOCALE |
| 4468 | if (hints & HINT_LOCALE) |
| 4469 | o->op_private |= OPpLOCALE; |
| 4470 | #endif |
| 4471 | |
| 4472 | return o; |
| 4473 | } |
| 4474 | |
| 4475 | OP * |
| 4476 | ck_match(OP *o) |
| 4477 | { |
| 4478 | o->op_private |= OPpRUNTIME; |
| 4479 | return o; |
| 4480 | } |
| 4481 | |
| 4482 | OP * |
| 4483 | ck_null(OP *o) |
| 4484 | { |
| 4485 | return o; |
| 4486 | } |
| 4487 | |
| 4488 | OP * |
| 4489 | ck_repeat(OP *o) |
| 4490 | { |
| 4491 | if (cBINOPo->op_first->op_flags & OPf_PARENS) { |
| 4492 | o->op_private |= OPpREPEAT_DOLIST; |
| 4493 | cBINOPo->op_first = force_list(cBINOPo->op_first); |
| 4494 | } |
| 4495 | else |
| 4496 | scalar(o); |
| 4497 | return o; |
| 4498 | } |
| 4499 | |
| 4500 | OP * |
| 4501 | ck_require(OP *o) |
| 4502 | { |
| 4503 | if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */ |
| 4504 | SVOP *kid = (SVOP*)cUNOPo->op_first; |
| 4505 | |
| 4506 | if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) { |
| 4507 | char *s; |
| 4508 | for (s = SvPVX(kid->op_sv); *s; s++) { |
| 4509 | if (*s == ':' && s[1] == ':') { |
| 4510 | *s = '/'; |
| 4511 | Move(s+2, s+1, strlen(s+2)+1, char); |
| 4512 | --SvCUR(kid->op_sv); |
| 4513 | } |
| 4514 | } |
| 4515 | sv_catpvn(kid->op_sv, ".pm", 3); |
| 4516 | } |
| 4517 | } |
| 4518 | return ck_fun(o); |
| 4519 | } |
| 4520 | |
| 4521 | OP * |
| 4522 | ck_retarget(OP *o) |
| 4523 | { |
| 4524 | croak("NOT IMPL LINE %d",__LINE__); |
| 4525 | /* STUB */ |
| 4526 | return o; |
| 4527 | } |
| 4528 | |
| 4529 | OP * |
| 4530 | ck_select(OP *o) |
| 4531 | { |
| 4532 | OP* kid; |
| 4533 | if (o->op_flags & OPf_KIDS) { |
| 4534 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
| 4535 | if (kid && kid->op_sibling) { |
| 4536 | o->op_type = OP_SSELECT; |
| 4537 | o->op_ppaddr = ppaddr[OP_SSELECT]; |
| 4538 | o = ck_fun(o); |
| 4539 | return fold_constants(o); |
| 4540 | } |
| 4541 | } |
| 4542 | o = ck_fun(o); |
| 4543 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
| 4544 | if (kid && kid->op_type == OP_RV2GV) |
| 4545 | kid->op_private &= ~HINT_STRICT_REFS; |
| 4546 | return o; |
| 4547 | } |
| 4548 | |
| 4549 | OP * |
| 4550 | ck_shift(OP *o) |
| 4551 | { |
| 4552 | I32 type = o->op_type; |
| 4553 | |
| 4554 | if (!(o->op_flags & OPf_KIDS)) { |
| 4555 | OP *argop; |
| 4556 | |
| 4557 | op_free(o); |
| 4558 | #ifdef USE_THREADS |
| 4559 | if (!CvUNIQUE(compcv)) { |
| 4560 | argop = newOP(OP_PADAV, OPf_REF); |
| 4561 | argop->op_targ = 0; /* curpad[0] is @_ */ |
| 4562 | } |
| 4563 | else { |
| 4564 | argop = newUNOP(OP_RV2AV, 0, |
| 4565 | scalar(newGVOP(OP_GV, 0, |
| 4566 | gv_fetchpv("ARGV", TRUE, SVt_PVAV)))); |
| 4567 | } |
| 4568 | #else |
| 4569 | argop = newUNOP(OP_RV2AV, 0, |
| 4570 | scalar(newGVOP(OP_GV, 0, !CvUNIQUE(compcv) ? |
| 4571 | defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV)))); |
| 4572 | #endif /* USE_THREADS */ |
| 4573 | return newUNOP(type, 0, scalar(argop)); |
| 4574 | } |
| 4575 | return scalar(modkids(ck_fun(o), type)); |
| 4576 | } |
| 4577 | |
| 4578 | OP * |
| 4579 | ck_sort(OP *o) |
| 4580 | { |
| 4581 | o->op_private = 0; |
| 4582 | #ifdef USE_LOCALE |
| 4583 | if (hints & HINT_LOCALE) |
| 4584 | o->op_private |= OPpLOCALE; |
| 4585 | #endif |
| 4586 | |
| 4587 | if (o->op_flags & OPf_STACKED) { |
| 4588 | OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
| 4589 | OP *k; |
| 4590 | kid = kUNOP->op_first; /* get past rv2gv */ |
| 4591 | |
| 4592 | if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) { |
| 4593 | linklist(kid); |
| 4594 | if (kid->op_type == OP_SCOPE) { |
| 4595 | k = kid->op_next; |
| 4596 | kid->op_next = 0; |
| 4597 | } |
| 4598 | else if (kid->op_type == OP_LEAVE) { |
| 4599 | if (o->op_type == OP_SORT) { |
| 4600 | null(kid); /* wipe out leave */ |
| 4601 | kid->op_next = kid; |
| 4602 | |
| 4603 | for (k = kLISTOP->op_first->op_next; k; k = k->op_next) { |
| 4604 | if (k->op_next == kid) |
| 4605 | k->op_next = 0; |
| 4606 | } |
| 4607 | } |
| 4608 | else |
| 4609 | kid->op_next = 0; /* just disconnect the leave */ |
| 4610 | k = kLISTOP->op_first; |
| 4611 | } |
| 4612 | peep(k); |
| 4613 | |
| 4614 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
| 4615 | null(kid); /* wipe out rv2gv */ |
| 4616 | if (o->op_type == OP_SORT) |
| 4617 | kid->op_next = kid; |
| 4618 | else |
| 4619 | kid->op_next = k; |
| 4620 | o->op_flags |= OPf_SPECIAL; |
| 4621 | } |
| 4622 | } |
| 4623 | |
| 4624 | return o; |
| 4625 | } |
| 4626 | |
| 4627 | OP * |
| 4628 | ck_split(OP *o) |
| 4629 | { |
| 4630 | register OP *kid; |
| 4631 | |
| 4632 | if (o->op_flags & OPf_STACKED) |
| 4633 | return no_fh_allowed(o); |
| 4634 | |
| 4635 | kid = cLISTOPo->op_first; |
| 4636 | if (kid->op_type != OP_NULL) |
| 4637 | croak("panic: ck_split"); |
| 4638 | kid = kid->op_sibling; |
| 4639 | op_free(cLISTOPo->op_first); |
| 4640 | cLISTOPo->op_first = kid; |
| 4641 | if (!kid) { |
| 4642 | cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1)); |
| 4643 | cLISTOPo->op_last = kid; /* There was only one element previously */ |
| 4644 | } |
| 4645 | |
| 4646 | if (kid->op_type != OP_MATCH) { |
| 4647 | OP *sibl = kid->op_sibling; |
| 4648 | kid->op_sibling = 0; |
| 4649 | kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop); |
| 4650 | if (cLISTOPo->op_first == cLISTOPo->op_last) |
| 4651 | cLISTOPo->op_last = kid; |
| 4652 | cLISTOPo->op_first = kid; |
| 4653 | kid->op_sibling = sibl; |
| 4654 | } |
| 4655 | |
| 4656 | kid->op_type = OP_PUSHRE; |
| 4657 | kid->op_ppaddr = ppaddr[OP_PUSHRE]; |
| 4658 | scalar(kid); |
| 4659 | |
| 4660 | if (!kid->op_sibling) |
| 4661 | append_elem(OP_SPLIT, o, newDEFSVOP()); |
| 4662 | |
| 4663 | kid = kid->op_sibling; |
| 4664 | scalar(kid); |
| 4665 | |
| 4666 | if (!kid->op_sibling) |
| 4667 | append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0))); |
| 4668 | |
| 4669 | kid = kid->op_sibling; |
| 4670 | scalar(kid); |
| 4671 | |
| 4672 | if (kid->op_sibling) |
| 4673 | return too_many_arguments(o,op_desc[o->op_type]); |
| 4674 | |
| 4675 | return o; |
| 4676 | } |
| 4677 | |
| 4678 | OP * |
| 4679 | ck_subr(OP *o) |
| 4680 | { |
| 4681 | dTHR; |
| 4682 | OP *prev = ((cUNOPo->op_first->op_sibling) |
| 4683 | ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first; |
| 4684 | OP *o2 = prev->op_sibling; |
| 4685 | OP *cvop; |
| 4686 | char *proto = 0; |
| 4687 | CV *cv = 0; |
| 4688 | GV *namegv = 0; |
| 4689 | int optional = 0; |
| 4690 | I32 arg = 0; |
| 4691 | |
| 4692 | for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ; |
| 4693 | if (cvop->op_type == OP_RV2CV) { |
| 4694 | SVOP* tmpop; |
| 4695 | o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER); |
| 4696 | null(cvop); /* disable rv2cv */ |
| 4697 | tmpop = (SVOP*)((UNOP*)cvop)->op_first; |
| 4698 | if (tmpop->op_type == OP_GV) { |
| 4699 | cv = GvCVu(tmpop->op_sv); |
| 4700 | if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) { |
| 4701 | namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv); |
| 4702 | proto = SvPV((SV*)cv, na); |
| 4703 | } |
| 4704 | } |
| 4705 | } |
| 4706 | o->op_private |= (hints & HINT_STRICT_REFS); |
| 4707 | if (PERLDB_SUB && curstash != debstash) |
| 4708 | o->op_private |= OPpENTERSUB_DB; |
| 4709 | while (o2 != cvop) { |
| 4710 | if (proto) { |
| 4711 | switch (*proto) { |
| 4712 | case '\0': |
| 4713 | return too_many_arguments(o, gv_ename(namegv)); |
| 4714 | case ';': |
| 4715 | optional = 1; |
| 4716 | proto++; |
| 4717 | continue; |
| 4718 | case '$': |
| 4719 | proto++; |
| 4720 | arg++; |
| 4721 | scalar(o2); |
| 4722 | break; |
| 4723 | case '%': |
| 4724 | case '@': |
| 4725 | list(o2); |
| 4726 | arg++; |
| 4727 | break; |
| 4728 | case '&': |
| 4729 | proto++; |
| 4730 | arg++; |
| 4731 | if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF) |
| 4732 | bad_type(arg, "block", gv_ename(namegv), o2); |
| 4733 | break; |
| 4734 | case '*': |
| 4735 | proto++; |
| 4736 | arg++; |
| 4737 | if (o2->op_type == OP_RV2GV) |
| 4738 | goto wrapref; |
| 4739 | { |
| 4740 | OP* kid = o2; |
| 4741 | OP* sib = kid->op_sibling; |
| 4742 | kid->op_sibling = 0; |
| 4743 | o2 = newUNOP(OP_RV2GV, 0, kid); |
| 4744 | o2->op_sibling = sib; |
| 4745 | prev->op_sibling = o2; |
| 4746 | } |
| 4747 | goto wrapref; |
| 4748 | case '\\': |
| 4749 | proto++; |
| 4750 | arg++; |
| 4751 | switch (*proto++) { |
| 4752 | case '*': |
| 4753 | if (o2->op_type != OP_RV2GV) |
| 4754 | bad_type(arg, "symbol", gv_ename(namegv), o2); |
| 4755 | goto wrapref; |
| 4756 | case '&': |
| 4757 | if (o2->op_type != OP_RV2CV) |
| 4758 | bad_type(arg, "sub", gv_ename(namegv), o2); |
| 4759 | goto wrapref; |
| 4760 | case '$': |
| 4761 | if (o2->op_type != OP_RV2SV && o2->op_type != OP_PADSV) |
| 4762 | bad_type(arg, "scalar", gv_ename(namegv), o2); |
| 4763 | goto wrapref; |
| 4764 | case '@': |
| 4765 | if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV) |
| 4766 | bad_type(arg, "array", gv_ename(namegv), o2); |
| 4767 | goto wrapref; |
| 4768 | case '%': |
| 4769 | if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV) |
| 4770 | bad_type(arg, "hash", gv_ename(namegv), o2); |
| 4771 | wrapref: |
| 4772 | { |
| 4773 | OP* kid = o2; |
| 4774 | OP* sib = kid->op_sibling; |
| 4775 | kid->op_sibling = 0; |
| 4776 | o2 = newUNOP(OP_REFGEN, 0, kid); |
| 4777 | o2->op_sibling = sib; |
| 4778 | prev->op_sibling = o2; |
| 4779 | } |
| 4780 | break; |
| 4781 | default: goto oops; |
| 4782 | } |
| 4783 | break; |
| 4784 | case ' ': |
| 4785 | proto++; |
| 4786 | continue; |
| 4787 | default: |
| 4788 | oops: |
| 4789 | croak("Malformed prototype for %s: %s", |
| 4790 | gv_ename(namegv), SvPV((SV*)cv, na)); |
| 4791 | } |
| 4792 | } |
| 4793 | else |
| 4794 | list(o2); |
| 4795 | mod(o2, OP_ENTERSUB); |
| 4796 | prev = o2; |
| 4797 | o2 = o2->op_sibling; |
| 4798 | } |
| 4799 | if (proto && !optional && |
| 4800 | (*proto && *proto != '@' && *proto != '%' && *proto != ';')) |
| 4801 | return too_few_arguments(o, gv_ename(namegv)); |
| 4802 | return o; |
| 4803 | } |
| 4804 | |
| 4805 | OP * |
| 4806 | ck_svconst(OP *o) |
| 4807 | { |
| 4808 | SvREADONLY_on(cSVOPo->op_sv); |
| 4809 | return o; |
| 4810 | } |
| 4811 | |
| 4812 | OP * |
| 4813 | ck_trunc(OP *o) |
| 4814 | { |
| 4815 | if (o->op_flags & OPf_KIDS) { |
| 4816 | SVOP *kid = (SVOP*)cUNOPo->op_first; |
| 4817 | |
| 4818 | if (kid->op_type == OP_NULL) |
| 4819 | kid = (SVOP*)kid->op_sibling; |
| 4820 | if (kid && |
| 4821 | kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) |
| 4822 | o->op_flags |= OPf_SPECIAL; |
| 4823 | } |
| 4824 | return ck_fun(o); |
| 4825 | } |
| 4826 | |
| 4827 | /* A peephole optimizer. We visit the ops in the order they're to execute. */ |
| 4828 | |
| 4829 | void |
| 4830 | peep(register OP *o) |
| 4831 | { |
| 4832 | dTHR; |
| 4833 | register OP* oldop = 0; |
| 4834 | if (!o || o->op_seq) |
| 4835 | return; |
| 4836 | ENTER; |
| 4837 | SAVEOP(); |
| 4838 | SAVESPTR(curcop); |
| 4839 | for (; o; o = o->op_next) { |
| 4840 | if (o->op_seq) |
| 4841 | break; |
| 4842 | if (!op_seqmax) |
| 4843 | op_seqmax++; |
| 4844 | op = o; |
| 4845 | switch (o->op_type) { |
| 4846 | case OP_NEXTSTATE: |
| 4847 | case OP_DBSTATE: |
| 4848 | curcop = ((COP*)o); /* for warnings */ |
| 4849 | o->op_seq = op_seqmax++; |
| 4850 | break; |
| 4851 | |
| 4852 | case OP_CONCAT: |
| 4853 | case OP_CONST: |
| 4854 | case OP_JOIN: |
| 4855 | case OP_UC: |
| 4856 | case OP_UCFIRST: |
| 4857 | case OP_LC: |
| 4858 | case OP_LCFIRST: |
| 4859 | case OP_QUOTEMETA: |
| 4860 | if (o->op_next && o->op_next->op_type == OP_STRINGIFY) |
| 4861 | null(o->op_next); |
| 4862 | o->op_seq = op_seqmax++; |
| 4863 | break; |
| 4864 | case OP_STUB: |
| 4865 | if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) { |
| 4866 | o->op_seq = op_seqmax++; |
| 4867 | break; /* Scalar stub must produce undef. List stub is noop */ |
| 4868 | } |
| 4869 | goto nothin; |
| 4870 | case OP_NULL: |
| 4871 | if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE) |
| 4872 | curcop = ((COP*)o); |
| 4873 | goto nothin; |
| 4874 | case OP_SCALAR: |
| 4875 | case OP_LINESEQ: |
| 4876 | case OP_SCOPE: |
| 4877 | nothin: |
| 4878 | if (oldop && o->op_next) { |
| 4879 | oldop->op_next = o->op_next; |
| 4880 | continue; |
| 4881 | } |
| 4882 | o->op_seq = op_seqmax++; |
| 4883 | break; |
| 4884 | |
| 4885 | case OP_GV: |
| 4886 | if (o->op_next->op_type == OP_RV2SV) { |
| 4887 | if (!(o->op_next->op_private & OPpDEREF)) { |
| 4888 | null(o->op_next); |
| 4889 | o->op_private |= o->op_next->op_private & OPpLVAL_INTRO; |
| 4890 | o->op_next = o->op_next->op_next; |
| 4891 | o->op_type = OP_GVSV; |
| 4892 | o->op_ppaddr = ppaddr[OP_GVSV]; |
| 4893 | } |
| 4894 | } |
| 4895 | else if (o->op_next->op_type == OP_RV2AV) { |
| 4896 | OP* pop = o->op_next->op_next; |
| 4897 | IV i; |
| 4898 | if (pop->op_type == OP_CONST && |
| 4899 | (op = pop->op_next) && |
| 4900 | pop->op_next->op_type == OP_AELEM && |
| 4901 | !(pop->op_next->op_private & |
| 4902 | (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) && |
| 4903 | (i = SvIV(((SVOP*)pop)->op_sv) - compiling.cop_arybase) |
| 4904 | <= 255 && |
| 4905 | i >= 0) |
| 4906 | { |
| 4907 | SvREFCNT_dec(((SVOP*)pop)->op_sv); |
| 4908 | null(o->op_next); |
| 4909 | null(pop->op_next); |
| 4910 | null(pop); |
| 4911 | o->op_flags |= pop->op_next->op_flags & OPf_MOD; |
| 4912 | o->op_next = pop->op_next->op_next; |
| 4913 | o->op_type = OP_AELEMFAST; |
| 4914 | o->op_ppaddr = ppaddr[OP_AELEMFAST]; |
| 4915 | o->op_private = (U8)i; |
| 4916 | GvAVn(((GVOP*)o)->op_gv); |
| 4917 | } |
| 4918 | } |
| 4919 | o->op_seq = op_seqmax++; |
| 4920 | break; |
| 4921 | |
| 4922 | case OP_PADAV: |
| 4923 | if (o->op_next->op_type == OP_RV2AV |
| 4924 | && (o->op_next->op_flags && OPf_REF)) |
| 4925 | { |
| 4926 | null(o->op_next); |
| 4927 | o->op_next = o->op_next->op_next; |
| 4928 | } |
| 4929 | break; |
| 4930 | |
| 4931 | case OP_PADHV: |
| 4932 | if (o->op_next->op_type == OP_RV2HV |
| 4933 | && (o->op_next->op_flags && OPf_REF)) |
| 4934 | { |
| 4935 | null(o->op_next); |
| 4936 | o->op_next = o->op_next->op_next; |
| 4937 | } |
| 4938 | break; |
| 4939 | |
| 4940 | case OP_MAPWHILE: |
| 4941 | case OP_GREPWHILE: |
| 4942 | case OP_AND: |
| 4943 | case OP_OR: |
| 4944 | o->op_seq = op_seqmax++; |
| 4945 | while (cLOGOP->op_other->op_type == OP_NULL) |
| 4946 | cLOGOP->op_other = cLOGOP->op_other->op_next; |
| 4947 | peep(cLOGOP->op_other); |
| 4948 | break; |
| 4949 | |
| 4950 | case OP_COND_EXPR: |
| 4951 | o->op_seq = op_seqmax++; |
| 4952 | peep(cCONDOP->op_true); |
| 4953 | peep(cCONDOP->op_false); |
| 4954 | break; |
| 4955 | |
| 4956 | case OP_ENTERLOOP: |
| 4957 | o->op_seq = op_seqmax++; |
| 4958 | peep(cLOOP->op_redoop); |
| 4959 | peep(cLOOP->op_nextop); |
| 4960 | peep(cLOOP->op_lastop); |
| 4961 | break; |
| 4962 | |
| 4963 | case OP_MATCH: |
| 4964 | case OP_SUBST: |
| 4965 | o->op_seq = op_seqmax++; |
| 4966 | peep(cPMOP->op_pmreplstart); |
| 4967 | break; |
| 4968 | |
| 4969 | case OP_EXEC: |
| 4970 | o->op_seq = op_seqmax++; |
| 4971 | if (dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) { |
| 4972 | if (o->op_next->op_sibling && |
| 4973 | o->op_next->op_sibling->op_type != OP_EXIT && |
| 4974 | o->op_next->op_sibling->op_type != OP_WARN && |
| 4975 | o->op_next->op_sibling->op_type != OP_DIE) { |
| 4976 | line_t oldline = curcop->cop_line; |
| 4977 | |
| 4978 | curcop->cop_line = ((COP*)o->op_next)->cop_line; |
| 4979 | warn("Statement unlikely to be reached"); |
| 4980 | warn("(Maybe you meant system() when you said exec()?)\n"); |
| 4981 | curcop->cop_line = oldline; |
| 4982 | } |
| 4983 | } |
| 4984 | break; |
| 4985 | |
| 4986 | case OP_HELEM: { |
| 4987 | UNOP *rop; |
| 4988 | SV *lexname; |
| 4989 | GV **fields; |
| 4990 | SV **svp, **indsvp; |
| 4991 | I32 ind; |
| 4992 | char *key; |
| 4993 | STRLEN keylen; |
| 4994 | |
| 4995 | if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO) |
| 4996 | || ((BINOP*)o)->op_last->op_type != OP_CONST) |
| 4997 | break; |
| 4998 | rop = (UNOP*)((BINOP*)o)->op_first; |
| 4999 | if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV) |
| 5000 | break; |
| 5001 | lexname = *av_fetch(comppad_name, rop->op_first->op_targ, TRUE); |
| 5002 | if (!SvOBJECT(lexname)) |
| 5003 | break; |
| 5004 | fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE); |
| 5005 | if (!fields || !GvHV(*fields)) |
| 5006 | break; |
| 5007 | svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv; |
| 5008 | key = SvPV(*svp, keylen); |
| 5009 | indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE); |
| 5010 | if (!indsvp) { |
| 5011 | croak("No such field \"%s\" in variable %s of type %s", |
| 5012 | key, SvPV(lexname, na), HvNAME(SvSTASH(lexname))); |
| 5013 | } |
| 5014 | ind = SvIV(*indsvp); |
| 5015 | if (ind < 1) |
| 5016 | croak("Bad index while coercing array into hash"); |
| 5017 | rop->op_type = OP_RV2AV; |
| 5018 | rop->op_ppaddr = ppaddr[OP_RV2AV]; |
| 5019 | o->op_type = OP_AELEM; |
| 5020 | o->op_ppaddr = ppaddr[OP_AELEM]; |
| 5021 | SvREFCNT_dec(*svp); |
| 5022 | *svp = newSViv(ind); |
| 5023 | break; |
| 5024 | } |
| 5025 | |
| 5026 | default: |
| 5027 | o->op_seq = op_seqmax++; |
| 5028 | break; |
| 5029 | } |
| 5030 | oldop = o; |
| 5031 | } |
| 5032 | LEAVE; |
| 5033 | } |