3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "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
24 #define CALL_PEEP(o) CALL_FPTR(PL_peepp)(aTHX_ o)
26 #if defined(PL_OP_SLAB_ALLOC)
28 #ifndef PERL_SLAB_SIZE
29 #define PERL_SLAB_SIZE 2048
32 #define NewOp(m,var,c,type) \
33 STMT_START { var = (type *) Slab_Alloc(m,c*sizeof(type)); } STMT_END
35 #define FreeOp(p) Slab_Free(p)
38 S_Slab_Alloc(pTHX_ int m, size_t sz)
41 * To make incrementing use count easy PL_OpSlab is an I32 *
42 * To make inserting the link to slab PL_OpPtr is I32 **
43 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
44 * Add an overhead for pointer to slab and round up as a number of pointers
46 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
47 if ((PL_OpSpace -= sz) < 0) {
48 PL_OpPtr = (I32 **) PerlMemShared_malloc(PERL_SLAB_SIZE*sizeof(I32*));
52 Zero(PL_OpPtr,PERL_SLAB_SIZE,I32 **);
53 /* We reserve the 0'th I32 sized chunk as a use count */
54 PL_OpSlab = (I32 *) PL_OpPtr;
55 /* Reduce size by the use count word, and by the size we need.
56 * Latter is to mimic the '-=' in the if() above
58 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
59 /* Allocation pointer starts at the top.
60 Theory: because we build leaves before trunk allocating at end
61 means that at run time access is cache friendly upward
63 PL_OpPtr += PERL_SLAB_SIZE;
65 assert( PL_OpSpace >= 0 );
66 /* Move the allocation pointer down */
68 assert( PL_OpPtr > (I32 **) PL_OpSlab );
69 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
70 (*PL_OpSlab)++; /* Increment use count of slab */
71 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
72 assert( *PL_OpSlab > 0 );
73 return (void *)(PL_OpPtr + 1);
77 S_Slab_Free(pTHX_ void *op)
79 I32 **ptr = (I32 **) op;
81 assert( ptr-1 > (I32 **) slab );
82 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
86 #define PerlMemShared PerlMem
89 PerlMemShared_free(slab);
90 if (slab == PL_OpSlab) {
97 #define NewOp(m, var, c, type) Newz(m, var, c, type)
98 #define FreeOp(p) Safefree(p)
101 * In the following definition, the ", Nullop" is just to make the compiler
102 * think the expression is of the right type: croak actually does a Siglongjmp.
104 #define CHECKOP(type,o) \
105 ((PL_op_mask && PL_op_mask[type]) \
106 ? ( op_free((OP*)o), \
107 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
109 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
111 #define PAD_MAX 999999999
112 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
115 S_gv_ename(pTHX_ GV *gv)
118 SV* tmpsv = sv_newmortal();
119 gv_efullname3(tmpsv, gv, Nullch);
120 return SvPV(tmpsv,n_a);
124 S_no_fh_allowed(pTHX_ OP *o)
126 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
132 S_too_few_arguments(pTHX_ OP *o, char *name)
134 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
139 S_too_many_arguments(pTHX_ OP *o, char *name)
141 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
146 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
148 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
149 (int)n, name, t, OP_DESC(kid)));
153 S_no_bareword_allowed(pTHX_ OP *o)
155 qerror(Perl_mess(aTHX_
156 "Bareword \"%s\" not allowed while \"strict subs\" in use",
157 SvPV_nolen(cSVOPo_sv)));
160 /* "register" allocation */
163 Perl_pad_allocmy(pTHX_ char *name)
168 if (!(PL_in_my == KEY_our ||
170 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
171 (name[1] == '_' && (int)strlen(name) > 2)))
173 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
174 /* 1999-02-27 mjd@plover.com */
176 p = strchr(name, '\0');
177 /* The next block assumes the buffer is at least 205 chars
178 long. At present, it's always at least 256 chars. */
180 strcpy(name+200, "...");
186 /* Move everything else down one character */
187 for (; p-name > 2; p--)
189 name[2] = toCTRL(name[1]);
192 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
194 if (ckWARN(WARN_MISC) && AvFILLp(PL_comppad_name) >= 0) {
195 SV **svp = AvARRAY(PL_comppad_name);
196 HV *ourstash = (PL_curstash ? PL_curstash : PL_defstash);
197 PADOFFSET top = AvFILLp(PL_comppad_name);
198 for (off = top; off > PL_comppad_name_floor; off--) {
200 && sv != &PL_sv_undef
201 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
202 && (PL_in_my != KEY_our
203 || ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash))
204 && strEQ(name, SvPVX(sv)))
206 Perl_warner(aTHX_ packWARN(WARN_MISC),
207 "\"%s\" variable %s masks earlier declaration in same %s",
208 (PL_in_my == KEY_our ? "our" : "my"),
210 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
215 if (PL_in_my == KEY_our) {
218 && sv != &PL_sv_undef
219 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
220 && ((SvFLAGS(sv) & SVpad_OUR) && GvSTASH(sv) == ourstash)
221 && strEQ(name, SvPVX(sv)))
223 Perl_warner(aTHX_ packWARN(WARN_MISC),
224 "\"our\" variable %s redeclared", name);
225 Perl_warner(aTHX_ packWARN(WARN_MISC),
226 "\t(Did you mean \"local\" instead of \"our\"?)\n");
229 } while ( off-- > 0 );
232 off = pad_alloc(OP_PADSV, SVs_PADMY);
234 sv_upgrade(sv, SVt_PVNV);
236 if (PL_in_my_stash) {
238 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"%s\"",
239 name, PL_in_my == KEY_our ? "our" : "my"));
240 SvFLAGS(sv) |= SVpad_TYPED;
241 (void)SvUPGRADE(sv, SVt_PVMG);
242 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
244 if (PL_in_my == KEY_our) {
245 (void)SvUPGRADE(sv, SVt_PVGV);
246 GvSTASH(sv) = (HV*)SvREFCNT_inc(PL_curstash ? (SV*)PL_curstash : (SV*)PL_defstash);
247 SvFLAGS(sv) |= SVpad_OUR;
249 av_store(PL_comppad_name, off, sv);
250 SvNVX(sv) = (NV)PAD_MAX;
251 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
252 if (!PL_min_intro_pending)
253 PL_min_intro_pending = off;
254 PL_max_intro_pending = off;
256 av_store(PL_comppad, off, (SV*)newAV());
257 else if (*name == '%')
258 av_store(PL_comppad, off, (SV*)newHV());
259 SvPADMY_on(PL_curpad[off]);
264 S_pad_addlex(pTHX_ SV *proto_namesv)
266 SV *namesv = NEWSV(1103,0);
267 PADOFFSET newoff = pad_alloc(OP_PADSV, SVs_PADMY);
268 sv_upgrade(namesv, SVt_PVNV);
269 sv_setpv(namesv, SvPVX(proto_namesv));
270 av_store(PL_comppad_name, newoff, namesv);
271 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
272 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
273 SvFAKE_on(namesv); /* A ref, not a real var */
274 if (SvFLAGS(proto_namesv) & SVpad_OUR) { /* An "our" variable */
275 SvFLAGS(namesv) |= SVpad_OUR;
276 (void)SvUPGRADE(namesv, SVt_PVGV);
277 GvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)GvSTASH(proto_namesv));
279 if (SvFLAGS(proto_namesv) & SVpad_TYPED) { /* A typed lexical */
280 SvFLAGS(namesv) |= SVpad_TYPED;
281 (void)SvUPGRADE(namesv, SVt_PVMG);
282 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(proto_namesv));
287 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
290 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
291 I32 cx_ix, I32 saweval, U32 flags)
297 register PERL_CONTEXT *cx;
299 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
300 AV *curlist = CvPADLIST(cv);
301 SV **svp = av_fetch(curlist, 0, FALSE);
304 if (!svp || *svp == &PL_sv_undef)
307 svp = AvARRAY(curname);
308 for (off = AvFILLp(curname); off > 0; off--) {
309 if ((sv = svp[off]) &&
310 sv != &PL_sv_undef &&
312 seq > I_32(SvNVX(sv)) &&
313 strEQ(SvPVX(sv), name))
324 return 0; /* don't clone from inactive stack frame */
328 oldpad = (AV*)AvARRAY(curlist)[depth];
329 oldsv = *av_fetch(oldpad, off, TRUE);
330 if (!newoff) { /* Not a mere clone operation. */
331 newoff = pad_addlex(sv);
332 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
333 /* "It's closures all the way down." */
334 CvCLONE_on(PL_compcv);
336 if (CvANON(PL_compcv))
337 oldsv = Nullsv; /* no need to keep ref */
342 bcv && bcv != cv && !CvCLONE(bcv);
343 bcv = CvOUTSIDE(bcv))
346 /* install the missing pad entry in intervening
347 * nested subs and mark them cloneable.
348 * XXX fix pad_foo() to not use globals */
349 AV *ocomppad_name = PL_comppad_name;
350 AV *ocomppad = PL_comppad;
351 SV **ocurpad = PL_curpad;
352 AV *padlist = CvPADLIST(bcv);
353 PL_comppad_name = (AV*)AvARRAY(padlist)[0];
354 PL_comppad = (AV*)AvARRAY(padlist)[1];
355 PL_curpad = AvARRAY(PL_comppad);
357 PL_comppad_name = ocomppad_name;
358 PL_comppad = ocomppad;
363 if (ckWARN(WARN_CLOSURE)
364 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
366 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
367 "Variable \"%s\" may be unavailable",
375 else if (!CvUNIQUE(PL_compcv)) {
376 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv)
377 && !(SvFLAGS(sv) & SVpad_OUR))
379 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
380 "Variable \"%s\" will not stay shared", name);
384 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
390 if (flags & FINDLEX_NOSEARCH)
393 /* Nothing in current lexical context--try eval's context, if any.
394 * This is necessary to let the perldb get at lexically scoped variables.
395 * XXX This will also probably interact badly with eval tree caching.
398 for (i = cx_ix; i >= 0; i--) {
400 switch (CxTYPE(cx)) {
402 if (i == 0 && saweval) {
403 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
407 switch (cx->blk_eval.old_op_type) {
409 if (CxREALEVAL(cx)) {
412 seq = cxstack[i].blk_oldcop->cop_seq;
413 startcv = cxstack[i].blk_eval.cv;
414 if (startcv && CvOUTSIDE(startcv)) {
415 off = pad_findlex(name, newoff, seq, CvOUTSIDE(startcv),
417 if (off) /* continue looking if not found here */
424 /* require/do must have their own scope */
433 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
434 saweval = i; /* so we know where we were called from */
435 seq = cxstack[i].blk_oldcop->cop_seq;
438 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
446 Perl_pad_findmy(pTHX_ char *name)
451 SV **svp = AvARRAY(PL_comppad_name);
452 U32 seq = PL_cop_seqmax;
456 #ifdef USE_5005THREADS
458 * Special case to get lexical (and hence per-thread) @_.
459 * XXX I need to find out how to tell at parse-time whether use
460 * of @_ should refer to a lexical (from a sub) or defgv (global
461 * scope and maybe weird sub-ish things like formats). See
462 * startsub in perly.y. It's possible that @_ could be lexical
463 * (at least from subs) even in non-threaded perl.
465 if (strEQ(name, "@_"))
466 return 0; /* success. (NOT_IN_PAD indicates failure) */
467 #endif /* USE_5005THREADS */
469 /* The one we're looking for is probably just before comppad_name_fill. */
470 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
471 if ((sv = svp[off]) &&
472 sv != &PL_sv_undef &&
475 seq > I_32(SvNVX(sv)))) &&
476 strEQ(SvPVX(sv), name))
478 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
479 return (PADOFFSET)off;
480 pendoff = off; /* this pending def. will override import */
484 outside = CvOUTSIDE(PL_compcv);
486 /* Check if if we're compiling an eval'', and adjust seq to be the
487 * eval's seq number. This depends on eval'' having a non-null
488 * CvOUTSIDE() while it is being compiled. The eval'' itself is
489 * identified by CvEVAL being true and CvGV being null. */
490 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
491 cx = &cxstack[cxstack_ix];
493 seq = cx->blk_oldcop->cop_seq;
496 /* See if it's in a nested scope */
497 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
499 /* If there is a pending local definition, this new alias must die */
501 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
502 return off; /* pad_findlex returns 0 for failure...*/
504 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
508 Perl_pad_leavemy(pTHX_ I32 fill)
511 SV **svp = AvARRAY(PL_comppad_name);
513 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
514 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
515 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
516 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "%s never introduced", SvPVX(sv));
519 /* "Deintroduce" my variables that are leaving with this scope. */
520 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
521 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
522 SvIVX(sv) = PL_cop_seqmax;
527 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
532 if (AvARRAY(PL_comppad) != PL_curpad)
533 Perl_croak(aTHX_ "panic: pad_alloc");
534 if (PL_pad_reset_pending)
536 if (tmptype & SVs_PADMY) {
538 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
539 } while (SvPADBUSY(sv)); /* need a fresh one */
540 retval = AvFILLp(PL_comppad);
543 SV **names = AvARRAY(PL_comppad_name);
544 SSize_t names_fill = AvFILLp(PL_comppad_name);
547 * "foreach" index vars temporarily become aliases to non-"my"
548 * values. Thus we must skip, not just pad values that are
549 * marked as current pad values, but also those with names.
551 if (++PL_padix <= names_fill &&
552 (sv = names[PL_padix]) && sv != &PL_sv_undef)
554 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
555 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) &&
556 !IS_PADGV(sv) && !IS_PADCONST(sv))
561 SvFLAGS(sv) |= tmptype;
562 PL_curpad = AvARRAY(PL_comppad);
563 #ifdef USE_5005THREADS
564 DEBUG_X(PerlIO_printf(Perl_debug_log,
565 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
566 PTR2UV(thr), PTR2UV(PL_curpad),
567 (long) retval, PL_op_name[optype]));
569 DEBUG_X(PerlIO_printf(Perl_debug_log,
570 "Pad 0x%"UVxf" alloc %ld for %s\n",
572 (long) retval, PL_op_name[optype]));
573 #endif /* USE_5005THREADS */
574 return (PADOFFSET)retval;
578 Perl_pad_sv(pTHX_ PADOFFSET po)
580 #ifdef USE_5005THREADS
581 DEBUG_X(PerlIO_printf(Perl_debug_log,
582 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
583 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
586 Perl_croak(aTHX_ "panic: pad_sv po");
587 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
588 PTR2UV(PL_curpad), (IV)po));
589 #endif /* USE_5005THREADS */
590 return PL_curpad[po]; /* eventually we'll turn this into a macro */
594 Perl_pad_free(pTHX_ PADOFFSET po)
598 if (AvARRAY(PL_comppad) != PL_curpad)
599 Perl_croak(aTHX_ "panic: pad_free curpad");
601 Perl_croak(aTHX_ "panic: pad_free po");
602 #ifdef USE_5005THREADS
603 DEBUG_X(PerlIO_printf(Perl_debug_log,
604 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
605 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
607 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
608 PTR2UV(PL_curpad), (IV)po));
609 #endif /* USE_5005THREADS */
610 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef) {
611 SvPADTMP_off(PL_curpad[po]);
613 SvREADONLY_off(PL_curpad[po]); /* could be a freed constant */
616 if ((I32)po < PL_padix)
621 Perl_pad_swipe(pTHX_ PADOFFSET po)
623 if (AvARRAY(PL_comppad) != PL_curpad)
624 Perl_croak(aTHX_ "panic: pad_swipe curpad");
626 Perl_croak(aTHX_ "panic: pad_swipe po");
627 #ifdef USE_5005THREADS
628 DEBUG_X(PerlIO_printf(Perl_debug_log,
629 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
630 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
632 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
633 PTR2UV(PL_curpad), (IV)po));
634 #endif /* USE_5005THREADS */
635 SvPADTMP_off(PL_curpad[po]);
636 PL_curpad[po] = NEWSV(1107,0);
637 SvPADTMP_on(PL_curpad[po]);
638 if ((I32)po < PL_padix)
642 /* XXX pad_reset() is currently disabled because it results in serious bugs.
643 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
644 * on the stack by OPs that use them, there are several ways to get an alias
645 * to a shared TARG. Such an alias will change randomly and unpredictably.
646 * We avoid doing this until we can think of a Better Way.
651 #ifdef USE_BROKEN_PAD_RESET
654 if (AvARRAY(PL_comppad) != PL_curpad)
655 Perl_croak(aTHX_ "panic: pad_reset curpad");
656 #ifdef USE_5005THREADS
657 DEBUG_X(PerlIO_printf(Perl_debug_log,
658 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
659 PTR2UV(thr), PTR2UV(PL_curpad)));
661 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
663 #endif /* USE_5005THREADS */
664 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
665 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
666 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
667 SvPADTMP_off(PL_curpad[po]);
669 PL_padix = PL_padix_floor;
672 PL_pad_reset_pending = FALSE;
675 #ifdef USE_5005THREADS
676 /* find_threadsv is not reentrant */
678 Perl_find_threadsv(pTHX_ const char *name)
683 /* We currently only handle names of a single character */
684 p = strchr(PL_threadsv_names, *name);
687 key = p - PL_threadsv_names;
688 MUTEX_LOCK(&thr->mutex);
689 svp = av_fetch(thr->threadsv, key, FALSE);
691 MUTEX_UNLOCK(&thr->mutex);
693 SV *sv = NEWSV(0, 0);
694 av_store(thr->threadsv, key, sv);
695 thr->threadsvp = AvARRAY(thr->threadsv);
696 MUTEX_UNLOCK(&thr->mutex);
698 * Some magic variables used to be automagically initialised
699 * in gv_fetchpv. Those which are now per-thread magicals get
700 * initialised here instead.
706 sv_setpv(sv, "\034");
707 sv_magic(sv, 0, PERL_MAGIC_sv, name, 1);
712 PL_sawampersand = TRUE;
726 /* XXX %! tied to Errno.pm needs to be added here.
727 * See gv_fetchpv(). */
731 sv_magic(sv, 0, PERL_MAGIC_sv, name, 1);
733 DEBUG_S(PerlIO_printf(Perl_error_log,
734 "find_threadsv: new SV %p for $%s%c\n",
735 sv, (*name < 32) ? "^" : "",
736 (*name < 32) ? toCTRL(*name) : *name));
740 #endif /* USE_5005THREADS */
745 Perl_op_free(pTHX_ OP *o)
747 register OP *kid, *nextkid;
750 if (!o || o->op_seq == (U16)-1)
753 if (o->op_private & OPpREFCOUNTED) {
754 switch (o->op_type) {
762 if (OpREFCNT_dec(o)) {
773 if (o->op_flags & OPf_KIDS) {
774 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
775 nextkid = kid->op_sibling; /* Get before next freeing kid */
783 /* COP* is not cleared by op_clear() so that we may track line
784 * numbers etc even after null() */
785 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
793 Perl_op_clear(pTHX_ OP *o)
796 switch (o->op_type) {
797 case OP_NULL: /* Was holding old type, if any. */
798 case OP_ENTEREVAL: /* Was holding hints. */
799 #ifdef USE_5005THREADS
800 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
804 #ifdef USE_5005THREADS
806 if (!(o->op_flags & OPf_SPECIAL))
809 #endif /* USE_5005THREADS */
811 if (!(o->op_flags & OPf_REF)
812 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
819 if (cPADOPo->op_padix > 0) {
822 pad_swipe(cPADOPo->op_padix);
823 /* No GvIN_PAD_off(gv) here, because other references may still
824 * exist on the pad */
827 cPADOPo->op_padix = 0;
830 SvREFCNT_dec(cSVOPo->op_sv);
831 cSVOPo->op_sv = Nullsv;
834 case OP_METHOD_NAMED:
836 SvREFCNT_dec(cSVOPo->op_sv);
837 cSVOPo->op_sv = Nullsv;
843 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
847 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
848 SvREFCNT_dec(cSVOPo->op_sv);
849 cSVOPo->op_sv = Nullsv;
852 Safefree(cPVOPo->op_pv);
853 cPVOPo->op_pv = Nullch;
857 op_free(cPMOPo->op_pmreplroot);
861 if (INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot)) {
863 GV *gv = (GV*)PL_curpad[INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot)];
864 pad_swipe(INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot));
865 /* No GvIN_PAD_off(gv) here, because other references may still
866 * exist on the pad */
871 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
878 HV *pmstash = PmopSTASH(cPMOPo);
879 if (pmstash && SvREFCNT(pmstash)) {
880 PMOP *pmop = HvPMROOT(pmstash);
881 PMOP *lastpmop = NULL;
883 if (cPMOPo == pmop) {
885 lastpmop->op_pmnext = pmop->op_pmnext;
887 HvPMROOT(pmstash) = pmop->op_pmnext;
891 pmop = pmop->op_pmnext;
894 PmopSTASH_free(cPMOPo);
896 cPMOPo->op_pmreplroot = Nullop;
897 /* we use the "SAFE" version of the PM_ macros here
898 * since sv_clean_all might release some PMOPs
899 * after PL_regex_padav has been cleared
900 * and the clearing of PL_regex_padav needs to
901 * happen before sv_clean_all
903 ReREFCNT_dec(PM_GETRE_SAFE(cPMOPo));
904 PM_SETRE_SAFE(cPMOPo, (REGEXP*)NULL);
906 if(PL_regex_pad) { /* We could be in destruction */
907 av_push((AV*) PL_regex_pad[0],(SV*) PL_regex_pad[(cPMOPo)->op_pmoffset]);
908 SvREPADTMP_on(PL_regex_pad[(cPMOPo)->op_pmoffset]);
909 PM_SETRE(cPMOPo, (cPMOPo)->op_pmoffset);
916 if (o->op_targ > 0) {
917 pad_free(o->op_targ);
923 S_cop_free(pTHX_ COP* cop)
925 Safefree(cop->cop_label); /* FIXME: treaddead ??? */
928 if (! specialWARN(cop->cop_warnings))
929 SvREFCNT_dec(cop->cop_warnings);
930 if (! specialCopIO(cop->cop_io)) {
934 char *s = SvPV(cop->cop_io,len);
935 Perl_warn(aTHX_ "io='%.*s'",(int) len,s); /* ??? --jhi */
938 SvREFCNT_dec(cop->cop_io);
944 Perl_op_null(pTHX_ OP *o)
946 if (o->op_type == OP_NULL)
949 o->op_targ = o->op_type;
950 o->op_type = OP_NULL;
951 o->op_ppaddr = PL_ppaddr[OP_NULL];
954 /* Contextualizers */
956 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
959 Perl_linklist(pTHX_ OP *o)
966 /* establish postfix order */
967 if (cUNOPo->op_first) {
968 o->op_next = LINKLIST(cUNOPo->op_first);
969 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
971 kid->op_next = LINKLIST(kid->op_sibling);
983 Perl_scalarkids(pTHX_ OP *o)
986 if (o && o->op_flags & OPf_KIDS) {
987 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
994 S_scalarboolean(pTHX_ OP *o)
996 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
997 if (ckWARN(WARN_SYNTAX)) {
998 line_t oldline = CopLINE(PL_curcop);
1000 if (PL_copline != NOLINE)
1001 CopLINE_set(PL_curcop, PL_copline);
1002 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
1003 CopLINE_set(PL_curcop, oldline);
1010 Perl_scalar(pTHX_ OP *o)
1014 /* assumes no premature commitment */
1015 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1016 || o->op_type == OP_RETURN)
1021 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
1023 switch (o->op_type) {
1025 scalar(cBINOPo->op_first);
1030 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1034 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1035 if (!kPMOP->op_pmreplroot)
1036 deprecate_old("implicit split to @_");
1044 if (o->op_flags & OPf_KIDS) {
1045 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1051 kid = cLISTOPo->op_first;
1053 while ((kid = kid->op_sibling)) {
1054 if (kid->op_sibling)
1059 WITH_THR(PL_curcop = &PL_compiling);
1064 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1065 if (kid->op_sibling)
1070 WITH_THR(PL_curcop = &PL_compiling);
1073 if (ckWARN(WARN_VOID))
1074 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
1080 Perl_scalarvoid(pTHX_ OP *o)
1087 if (o->op_type == OP_NEXTSTATE
1088 || o->op_type == OP_SETSTATE
1089 || o->op_type == OP_DBSTATE
1090 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1091 || o->op_targ == OP_SETSTATE
1092 || o->op_targ == OP_DBSTATE)))
1093 PL_curcop = (COP*)o; /* for warning below */
1095 /* assumes no premature commitment */
1096 want = o->op_flags & OPf_WANT;
1097 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
1098 || o->op_type == OP_RETURN)
1103 if ((o->op_private & OPpTARGET_MY)
1104 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1106 return scalar(o); /* As if inside SASSIGN */
1109 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1111 switch (o->op_type) {
1113 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1117 if (o->op_flags & OPf_STACKED)
1121 if (o->op_private == 4)
1163 case OP_GETSOCKNAME:
1164 case OP_GETPEERNAME:
1169 case OP_GETPRIORITY:
1192 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1193 useless = OP_DESC(o);
1200 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1201 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1202 useless = "a variable";
1207 if (cSVOPo->op_private & OPpCONST_STRICT)
1208 no_bareword_allowed(o);
1210 if (ckWARN(WARN_VOID)) {
1211 useless = "a constant";
1212 /* the constants 0 and 1 are permitted as they are
1213 conventionally used as dummies in constructs like
1214 1 while some_condition_with_side_effects; */
1215 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1217 else if (SvPOK(sv)) {
1218 /* perl4's way of mixing documentation and code
1219 (before the invention of POD) was based on a
1220 trick to mix nroff and perl code. The trick was
1221 built upon these three nroff macros being used in
1222 void context. The pink camel has the details in
1223 the script wrapman near page 319. */
1224 if (strnEQ(SvPVX(sv), "di", 2) ||
1225 strnEQ(SvPVX(sv), "ds", 2) ||
1226 strnEQ(SvPVX(sv), "ig", 2))
1231 op_null(o); /* don't execute or even remember it */
1235 o->op_type = OP_PREINC; /* pre-increment is faster */
1236 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1240 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1241 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1247 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1252 if (o->op_flags & OPf_STACKED)
1259 if (!(o->op_flags & OPf_KIDS))
1268 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1275 /* all requires must return a boolean value */
1276 o->op_flags &= ~OPf_WANT;
1281 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1282 if (!kPMOP->op_pmreplroot)
1283 deprecate_old("implicit split to @_");
1287 if (useless && ckWARN(WARN_VOID))
1288 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1293 Perl_listkids(pTHX_ OP *o)
1296 if (o && o->op_flags & OPf_KIDS) {
1297 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1304 Perl_list(pTHX_ OP *o)
1308 /* assumes no premature commitment */
1309 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1310 || o->op_type == OP_RETURN)
1315 if ((o->op_private & OPpTARGET_MY)
1316 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1318 return o; /* As if inside SASSIGN */
1321 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1323 switch (o->op_type) {
1326 list(cBINOPo->op_first);
1331 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1339 if (!(o->op_flags & OPf_KIDS))
1341 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1342 list(cBINOPo->op_first);
1343 return gen_constant_list(o);
1350 kid = cLISTOPo->op_first;
1352 while ((kid = kid->op_sibling)) {
1353 if (kid->op_sibling)
1358 WITH_THR(PL_curcop = &PL_compiling);
1362 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1363 if (kid->op_sibling)
1368 WITH_THR(PL_curcop = &PL_compiling);
1371 /* all requires must return a boolean value */
1372 o->op_flags &= ~OPf_WANT;
1379 Perl_scalarseq(pTHX_ OP *o)
1384 if (o->op_type == OP_LINESEQ ||
1385 o->op_type == OP_SCOPE ||
1386 o->op_type == OP_LEAVE ||
1387 o->op_type == OP_LEAVETRY)
1389 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1390 if (kid->op_sibling) {
1394 PL_curcop = &PL_compiling;
1396 o->op_flags &= ~OPf_PARENS;
1397 if (PL_hints & HINT_BLOCK_SCOPE)
1398 o->op_flags |= OPf_PARENS;
1401 o = newOP(OP_STUB, 0);
1406 S_modkids(pTHX_ OP *o, I32 type)
1409 if (o && o->op_flags & OPf_KIDS) {
1410 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1417 Perl_mod(pTHX_ OP *o, I32 type)
1422 if (!o || PL_error_count)
1425 if ((o->op_private & OPpTARGET_MY)
1426 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1431 switch (o->op_type) {
1436 if (!(o->op_private & (OPpCONST_ARYBASE)))
1438 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1439 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1443 SAVEI32(PL_compiling.cop_arybase);
1444 PL_compiling.cop_arybase = 0;
1446 else if (type == OP_REFGEN)
1449 Perl_croak(aTHX_ "That use of $[ is unsupported");
1452 if (o->op_flags & OPf_PARENS)
1456 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1457 !(o->op_flags & OPf_STACKED)) {
1458 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1459 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1460 assert(cUNOPo->op_first->op_type == OP_NULL);
1461 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1464 else if (o->op_private & OPpENTERSUB_NOMOD)
1466 else { /* lvalue subroutine call */
1467 o->op_private |= OPpLVAL_INTRO;
1468 PL_modcount = RETURN_UNLIMITED_NUMBER;
1469 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1470 /* Backward compatibility mode: */
1471 o->op_private |= OPpENTERSUB_INARGS;
1474 else { /* Compile-time error message: */
1475 OP *kid = cUNOPo->op_first;
1479 if (kid->op_type == OP_PUSHMARK)
1481 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1483 "panic: unexpected lvalue entersub "
1484 "args: type/targ %ld:%"UVuf,
1485 (long)kid->op_type, (UV)kid->op_targ);
1486 kid = kLISTOP->op_first;
1488 while (kid->op_sibling)
1489 kid = kid->op_sibling;
1490 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1492 if (kid->op_type == OP_METHOD_NAMED
1493 || kid->op_type == OP_METHOD)
1497 NewOp(1101, newop, 1, UNOP);
1498 newop->op_type = OP_RV2CV;
1499 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1500 newop->op_first = Nullop;
1501 newop->op_next = (OP*)newop;
1502 kid->op_sibling = (OP*)newop;
1503 newop->op_private |= OPpLVAL_INTRO;
1507 if (kid->op_type != OP_RV2CV)
1509 "panic: unexpected lvalue entersub "
1510 "entry via type/targ %ld:%"UVuf,
1511 (long)kid->op_type, (UV)kid->op_targ);
1512 kid->op_private |= OPpLVAL_INTRO;
1513 break; /* Postpone until runtime */
1517 kid = kUNOP->op_first;
1518 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1519 kid = kUNOP->op_first;
1520 if (kid->op_type == OP_NULL)
1522 "Unexpected constant lvalue entersub "
1523 "entry via type/targ %ld:%"UVuf,
1524 (long)kid->op_type, (UV)kid->op_targ);
1525 if (kid->op_type != OP_GV) {
1526 /* Restore RV2CV to check lvalueness */
1528 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1529 okid->op_next = kid->op_next;
1530 kid->op_next = okid;
1533 okid->op_next = Nullop;
1534 okid->op_type = OP_RV2CV;
1536 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1537 okid->op_private |= OPpLVAL_INTRO;
1541 cv = GvCV(kGVOP_gv);
1551 /* grep, foreach, subcalls, refgen */
1552 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1554 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1555 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1557 : (o->op_type == OP_ENTERSUB
1558 ? "non-lvalue subroutine call"
1560 type ? PL_op_desc[type] : "local"));
1574 case OP_RIGHT_SHIFT:
1583 if (!(o->op_flags & OPf_STACKED))
1589 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1595 if (!type && cUNOPo->op_first->op_type != OP_GV)
1596 Perl_croak(aTHX_ "Can't localize through a reference");
1597 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1598 PL_modcount = RETURN_UNLIMITED_NUMBER;
1599 return o; /* Treat \(@foo) like ordinary list. */
1603 if (scalar_mod_type(o, type))
1605 ref(cUNOPo->op_first, o->op_type);
1609 if (type == OP_LEAVESUBLV)
1610 o->op_private |= OPpMAYBE_LVSUB;
1616 PL_modcount = RETURN_UNLIMITED_NUMBER;
1619 if (!type && cUNOPo->op_first->op_type != OP_GV)
1620 Perl_croak(aTHX_ "Can't localize through a reference");
1621 ref(cUNOPo->op_first, o->op_type);
1625 PL_hints |= HINT_BLOCK_SCOPE;
1635 PL_modcount = RETURN_UNLIMITED_NUMBER;
1636 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1637 return o; /* Treat \(@foo) like ordinary list. */
1638 if (scalar_mod_type(o, type))
1640 if (type == OP_LEAVESUBLV)
1641 o->op_private |= OPpMAYBE_LVSUB;
1646 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1647 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1650 #ifdef USE_5005THREADS
1652 PL_modcount++; /* XXX ??? */
1654 #endif /* USE_5005THREADS */
1660 if (type != OP_SASSIGN)
1664 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1669 if (type == OP_LEAVESUBLV)
1670 o->op_private |= OPpMAYBE_LVSUB;
1672 pad_free(o->op_targ);
1673 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1674 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1675 if (o->op_flags & OPf_KIDS)
1676 mod(cBINOPo->op_first->op_sibling, type);
1681 ref(cBINOPo->op_first, o->op_type);
1682 if (type == OP_ENTERSUB &&
1683 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1684 o->op_private |= OPpLVAL_DEFER;
1685 if (type == OP_LEAVESUBLV)
1686 o->op_private |= OPpMAYBE_LVSUB;
1694 if (o->op_flags & OPf_KIDS)
1695 mod(cLISTOPo->op_last, type);
1699 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1701 else if (!(o->op_flags & OPf_KIDS))
1703 if (o->op_targ != OP_LIST) {
1704 mod(cBINOPo->op_first, type);
1709 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1714 if (type != OP_LEAVESUBLV)
1716 break; /* mod()ing was handled by ck_return() */
1719 /* [20011101.069] File test operators interpret OPf_REF to mean that
1720 their argument is a filehandle; thus \stat(".") should not set
1722 if (type == OP_REFGEN &&
1723 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1726 if (type != OP_LEAVESUBLV)
1727 o->op_flags |= OPf_MOD;
1729 if (type == OP_AASSIGN || type == OP_SASSIGN)
1730 o->op_flags |= OPf_SPECIAL|OPf_REF;
1732 o->op_private |= OPpLVAL_INTRO;
1733 o->op_flags &= ~OPf_SPECIAL;
1734 PL_hints |= HINT_BLOCK_SCOPE;
1736 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1737 && type != OP_LEAVESUBLV)
1738 o->op_flags |= OPf_REF;
1743 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1747 if (o->op_type == OP_RV2GV)
1771 case OP_RIGHT_SHIFT:
1790 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1792 switch (o->op_type) {
1800 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1813 Perl_refkids(pTHX_ OP *o, I32 type)
1816 if (o && o->op_flags & OPf_KIDS) {
1817 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1824 Perl_ref(pTHX_ OP *o, I32 type)
1828 if (!o || PL_error_count)
1831 switch (o->op_type) {
1833 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1834 !(o->op_flags & OPf_STACKED)) {
1835 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1836 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1837 assert(cUNOPo->op_first->op_type == OP_NULL);
1838 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1839 o->op_flags |= OPf_SPECIAL;
1844 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1848 if (type == OP_DEFINED)
1849 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1850 ref(cUNOPo->op_first, o->op_type);
1853 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1854 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1855 : type == OP_RV2HV ? OPpDEREF_HV
1857 o->op_flags |= OPf_MOD;
1862 o->op_flags |= OPf_MOD; /* XXX ??? */
1867 o->op_flags |= OPf_REF;
1870 if (type == OP_DEFINED)
1871 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1872 ref(cUNOPo->op_first, o->op_type);
1877 o->op_flags |= OPf_REF;
1882 if (!(o->op_flags & OPf_KIDS))
1884 ref(cBINOPo->op_first, type);
1888 ref(cBINOPo->op_first, o->op_type);
1889 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1890 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1891 : type == OP_RV2HV ? OPpDEREF_HV
1893 o->op_flags |= OPf_MOD;
1901 if (!(o->op_flags & OPf_KIDS))
1903 ref(cLISTOPo->op_last, type);
1913 S_dup_attrlist(pTHX_ OP *o)
1917 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1918 * where the first kid is OP_PUSHMARK and the remaining ones
1919 * are OP_CONST. We need to push the OP_CONST values.
1921 if (o->op_type == OP_CONST)
1922 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1924 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1925 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1926 if (o->op_type == OP_CONST)
1927 rop = append_elem(OP_LIST, rop,
1928 newSVOP(OP_CONST, o->op_flags,
1929 SvREFCNT_inc(cSVOPo->op_sv)));
1936 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1940 /* fake up C<use attributes $pkg,$rv,@attrs> */
1941 ENTER; /* need to protect against side-effects of 'use' */
1944 stashsv = newSVpv(HvNAME(stash), 0);
1946 stashsv = &PL_sv_no;
1948 #define ATTRSMODULE "attributes"
1949 #define ATTRSMODULE_PM "attributes.pm"
1953 /* Don't force the C<use> if we don't need it. */
1954 svp = hv_fetch(GvHVn(PL_incgv), ATTRSMODULE_PM,
1955 sizeof(ATTRSMODULE_PM)-1, 0);
1956 if (svp && *svp != &PL_sv_undef)
1957 ; /* already in %INC */
1959 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1960 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1964 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1965 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1967 prepend_elem(OP_LIST,
1968 newSVOP(OP_CONST, 0, stashsv),
1969 prepend_elem(OP_LIST,
1970 newSVOP(OP_CONST, 0,
1972 dup_attrlist(attrs))));
1978 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1980 OP *pack, *imop, *arg;
1986 assert(target->op_type == OP_PADSV ||
1987 target->op_type == OP_PADHV ||
1988 target->op_type == OP_PADAV);
1990 /* Ensure that attributes.pm is loaded. */
1991 apply_attrs(stash, pad_sv(target->op_targ), attrs, TRUE);
1993 /* Need package name for method call. */
1994 pack = newSVOP(OP_CONST, 0, newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1996 /* Build up the real arg-list. */
1998 stashsv = newSVpv(HvNAME(stash), 0);
2000 stashsv = &PL_sv_no;
2001 arg = newOP(OP_PADSV, 0);
2002 arg->op_targ = target->op_targ;
2003 arg = prepend_elem(OP_LIST,
2004 newSVOP(OP_CONST, 0, stashsv),
2005 prepend_elem(OP_LIST,
2006 newUNOP(OP_REFGEN, 0,
2007 mod(arg, OP_REFGEN)),
2008 dup_attrlist(attrs)));
2010 /* Fake up a method call to import */
2011 meth = newSVpvn("import", 6);
2012 (void)SvUPGRADE(meth, SVt_PVIV);
2013 (void)SvIOK_on(meth);
2014 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
2015 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2016 append_elem(OP_LIST,
2017 prepend_elem(OP_LIST, pack, list(arg)),
2018 newSVOP(OP_METHOD_NAMED, 0, meth)));
2019 imop->op_private |= OPpENTERSUB_NOMOD;
2021 /* Combine the ops. */
2022 *imopsp = append_elem(OP_LIST, *imopsp, imop);
2026 =notfor apidoc apply_attrs_string
2028 Attempts to apply a list of attributes specified by the C<attrstr> and
2029 C<len> arguments to the subroutine identified by the C<cv> argument which
2030 is expected to be associated with the package identified by the C<stashpv>
2031 argument (see L<attributes>). It gets this wrong, though, in that it
2032 does not correctly identify the boundaries of the individual attribute
2033 specifications within C<attrstr>. This is not really intended for the
2034 public API, but has to be listed here for systems such as AIX which
2035 need an explicit export list for symbols. (It's called from XS code
2036 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2037 to respect attribute syntax properly would be welcome.
2043 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
2044 char *attrstr, STRLEN len)
2049 len = strlen(attrstr);
2053 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2055 char *sstr = attrstr;
2056 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2057 attrs = append_elem(OP_LIST, attrs,
2058 newSVOP(OP_CONST, 0,
2059 newSVpvn(sstr, attrstr-sstr)));
2063 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2064 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
2065 Nullsv, prepend_elem(OP_LIST,
2066 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2067 prepend_elem(OP_LIST,
2068 newSVOP(OP_CONST, 0,
2074 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2079 if (!o || PL_error_count)
2083 if (type == OP_LIST) {
2084 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2085 my_kid(kid, attrs, imopsp);
2086 } else if (type == OP_UNDEF) {
2088 } else if (type == OP_RV2SV || /* "our" declaration */
2090 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2091 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2092 yyerror(Perl_form(aTHX_ "Can't declare %s in my", OP_DESC(o)));
2095 GV *gv = cGVOPx_gv(cUNOPo->op_first);
2097 PL_in_my_stash = Nullhv;
2098 apply_attrs(GvSTASH(gv),
2099 (type == OP_RV2SV ? GvSV(gv) :
2100 type == OP_RV2AV ? (SV*)GvAV(gv) :
2101 type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)gv),
2104 o->op_private |= OPpOUR_INTRO;
2107 else if (type != OP_PADSV &&
2110 type != OP_PUSHMARK)
2112 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2114 PL_in_my == KEY_our ? "our" : "my"));
2117 else if (attrs && type != OP_PUSHMARK) {
2122 PL_in_my_stash = Nullhv;
2124 /* check for C<my Dog $spot> when deciding package */
2125 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
2126 if (namesvp && *namesvp && (SvFLAGS(*namesvp) & SVpad_TYPED))
2127 stash = SvSTASH(*namesvp);
2129 stash = PL_curstash;
2130 apply_attrs_my(stash, o, attrs, imopsp);
2132 o->op_flags |= OPf_MOD;
2133 o->op_private |= OPpLVAL_INTRO;
2138 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2141 int maybe_scalar = 0;
2143 if (o->op_flags & OPf_PARENS)
2149 o = my_kid(o, attrs, &rops);
2151 if (maybe_scalar && o->op_type == OP_PADSV) {
2152 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
2153 o->op_private |= OPpLVAL_INTRO;
2156 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
2159 PL_in_my_stash = Nullhv;
2164 Perl_my(pTHX_ OP *o)
2166 return my_attrs(o, Nullop);
2170 Perl_sawparens(pTHX_ OP *o)
2173 o->op_flags |= OPf_PARENS;
2178 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2182 if (ckWARN(WARN_MISC) &&
2183 (left->op_type == OP_RV2AV ||
2184 left->op_type == OP_RV2HV ||
2185 left->op_type == OP_PADAV ||
2186 left->op_type == OP_PADHV)) {
2187 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
2188 right->op_type == OP_TRANS)
2189 ? right->op_type : OP_MATCH];
2190 const char *sample = ((left->op_type == OP_RV2AV ||
2191 left->op_type == OP_PADAV)
2192 ? "@array" : "%hash");
2193 Perl_warner(aTHX_ packWARN(WARN_MISC),
2194 "Applying %s to %s will act on scalar(%s)",
2195 desc, sample, sample);
2198 if (right->op_type == OP_CONST &&
2199 cSVOPx(right)->op_private & OPpCONST_BARE &&
2200 cSVOPx(right)->op_private & OPpCONST_STRICT)
2202 no_bareword_allowed(right);
2205 if (!(right->op_flags & OPf_STACKED) &&
2206 (right->op_type == OP_MATCH ||
2207 right->op_type == OP_SUBST ||
2208 right->op_type == OP_TRANS)) {
2209 right->op_flags |= OPf_STACKED;
2210 if (right->op_type != OP_MATCH &&
2211 ! (right->op_type == OP_TRANS &&
2212 right->op_private & OPpTRANS_IDENTICAL))
2213 left = mod(left, right->op_type);
2214 if (right->op_type == OP_TRANS)
2215 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
2217 o = prepend_elem(right->op_type, scalar(left), right);
2219 return newUNOP(OP_NOT, 0, scalar(o));
2223 return bind_match(type, left,
2224 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
2228 Perl_invert(pTHX_ OP *o)
2232 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
2233 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2237 Perl_scope(pTHX_ OP *o)
2240 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2241 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2242 o->op_type = OP_LEAVE;
2243 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2246 if (o->op_type == OP_LINESEQ) {
2248 o->op_type = OP_SCOPE;
2249 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2250 kid = ((LISTOP*)o)->op_first;
2251 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
2255 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
2262 Perl_save_hints(pTHX)
2265 SAVESPTR(GvHV(PL_hintgv));
2266 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
2267 SAVEFREESV(GvHV(PL_hintgv));
2271 Perl_block_start(pTHX_ int full)
2273 int retval = PL_savestack_ix;
2275 SAVEI32(PL_comppad_name_floor);
2276 PL_comppad_name_floor = AvFILLp(PL_comppad_name);
2278 PL_comppad_name_fill = PL_comppad_name_floor;
2279 if (PL_comppad_name_floor < 0)
2280 PL_comppad_name_floor = 0;
2281 SAVEI32(PL_min_intro_pending);
2282 SAVEI32(PL_max_intro_pending);
2283 PL_min_intro_pending = 0;
2284 SAVEI32(PL_comppad_name_fill);
2285 SAVEI32(PL_padix_floor);
2286 PL_padix_floor = PL_padix;
2287 PL_pad_reset_pending = FALSE;
2289 PL_hints &= ~HINT_BLOCK_SCOPE;
2290 SAVESPTR(PL_compiling.cop_warnings);
2291 if (! specialWARN(PL_compiling.cop_warnings)) {
2292 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
2293 SAVEFREESV(PL_compiling.cop_warnings) ;
2295 SAVESPTR(PL_compiling.cop_io);
2296 if (! specialCopIO(PL_compiling.cop_io)) {
2297 PL_compiling.cop_io = newSVsv(PL_compiling.cop_io) ;
2298 SAVEFREESV(PL_compiling.cop_io) ;
2304 Perl_block_end(pTHX_ I32 floor, OP *seq)
2306 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2307 line_t copline = PL_copline;
2308 /* there should be a nextstate in every block */
2309 OP* retval = seq ? scalarseq(seq) : newSTATEOP(0, Nullch, seq);
2310 PL_copline = copline; /* XXX newSTATEOP may reset PL_copline */
2312 PL_pad_reset_pending = FALSE;
2313 PL_compiling.op_private = PL_hints;
2315 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2316 pad_leavemy(PL_comppad_name_fill);
2324 #ifdef USE_5005THREADS
2325 OP *o = newOP(OP_THREADSV, 0);
2326 o->op_targ = find_threadsv("_");
2329 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2330 #endif /* USE_5005THREADS */
2334 Perl_newPROG(pTHX_ OP *o)
2339 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2340 ((PL_in_eval & EVAL_KEEPERR)
2341 ? OPf_SPECIAL : 0), o);
2342 PL_eval_start = linklist(PL_eval_root);
2343 PL_eval_root->op_private |= OPpREFCOUNTED;
2344 OpREFCNT_set(PL_eval_root, 1);
2345 PL_eval_root->op_next = 0;
2346 CALL_PEEP(PL_eval_start);
2351 PL_main_root = scope(sawparens(scalarvoid(o)));
2352 PL_curcop = &PL_compiling;
2353 PL_main_start = LINKLIST(PL_main_root);
2354 PL_main_root->op_private |= OPpREFCOUNTED;
2355 OpREFCNT_set(PL_main_root, 1);
2356 PL_main_root->op_next = 0;
2357 CALL_PEEP(PL_main_start);
2360 /* Register with debugger */
2362 CV *cv = get_cv("DB::postponed", FALSE);
2366 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2368 call_sv((SV*)cv, G_DISCARD);
2375 Perl_localize(pTHX_ OP *o, I32 lex)
2377 if (o->op_flags & OPf_PARENS)
2380 if (ckWARN(WARN_PARENTHESIS)
2381 && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',')
2383 char *s = PL_bufptr;
2385 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s) || strchr("@$%, ", *s)))
2388 if (*s == ';' || *s == '=')
2389 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2390 "Parentheses missing around \"%s\" list",
2391 lex ? (PL_in_my == KEY_our ? "our" : "my") : "local");
2397 o = mod(o, OP_NULL); /* a bit kludgey */
2399 PL_in_my_stash = Nullhv;
2404 Perl_jmaybe(pTHX_ OP *o)
2406 if (o->op_type == OP_LIST) {
2408 #ifdef USE_5005THREADS
2409 o2 = newOP(OP_THREADSV, 0);
2410 o2->op_targ = find_threadsv(";");
2412 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2413 #endif /* USE_5005THREADS */
2414 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2420 Perl_fold_constants(pTHX_ register OP *o)
2423 I32 type = o->op_type;
2426 if (PL_opargs[type] & OA_RETSCALAR)
2428 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2429 o->op_targ = pad_alloc(type, SVs_PADTMP);
2431 /* integerize op, unless it happens to be C<-foo>.
2432 * XXX should pp_i_negate() do magic string negation instead? */
2433 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2434 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2435 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2437 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2440 if (!(PL_opargs[type] & OA_FOLDCONST))
2445 /* XXX might want a ck_negate() for this */
2446 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2458 /* XXX what about the numeric ops? */
2459 if (PL_hints & HINT_LOCALE)
2464 goto nope; /* Don't try to run w/ errors */
2466 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2467 if ((curop->op_type != OP_CONST ||
2468 (curop->op_private & OPpCONST_BARE)) &&
2469 curop->op_type != OP_LIST &&
2470 curop->op_type != OP_SCALAR &&
2471 curop->op_type != OP_NULL &&
2472 curop->op_type != OP_PUSHMARK)
2478 curop = LINKLIST(o);
2482 sv = *(PL_stack_sp--);
2483 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2484 pad_swipe(o->op_targ);
2485 else if (SvTEMP(sv)) { /* grab mortal temp? */
2486 (void)SvREFCNT_inc(sv);
2490 if (type == OP_RV2GV)
2491 return newGVOP(OP_GV, 0, (GV*)sv);
2493 /* try to smush double to int, but don't smush -2.0 to -2 */
2494 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2497 #ifdef PERL_PRESERVE_IVUV
2498 /* Only bother to attempt to fold to IV if
2499 most operators will benefit */
2503 return newSVOP(OP_CONST, 0, sv);
2511 Perl_gen_constant_list(pTHX_ register OP *o)
2514 I32 oldtmps_floor = PL_tmps_floor;
2518 return o; /* Don't attempt to run with errors */
2520 PL_op = curop = LINKLIST(o);
2527 PL_tmps_floor = oldtmps_floor;
2529 o->op_type = OP_RV2AV;
2530 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2531 o->op_seq = 0; /* needs to be revisited in peep() */
2532 curop = ((UNOP*)o)->op_first;
2533 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2540 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2542 if (!o || o->op_type != OP_LIST)
2543 o = newLISTOP(OP_LIST, 0, o, Nullop);
2545 o->op_flags &= ~OPf_WANT;
2547 if (!(PL_opargs[type] & OA_MARK))
2548 op_null(cLISTOPo->op_first);
2551 o->op_ppaddr = PL_ppaddr[type];
2552 o->op_flags |= flags;
2554 o = CHECKOP(type, o);
2555 if (o->op_type != type)
2558 return fold_constants(o);
2561 /* List constructors */
2564 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2572 if (first->op_type != type
2573 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2575 return newLISTOP(type, 0, first, last);
2578 if (first->op_flags & OPf_KIDS)
2579 ((LISTOP*)first)->op_last->op_sibling = last;
2581 first->op_flags |= OPf_KIDS;
2582 ((LISTOP*)first)->op_first = last;
2584 ((LISTOP*)first)->op_last = last;
2589 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2597 if (first->op_type != type)
2598 return prepend_elem(type, (OP*)first, (OP*)last);
2600 if (last->op_type != type)
2601 return append_elem(type, (OP*)first, (OP*)last);
2603 first->op_last->op_sibling = last->op_first;
2604 first->op_last = last->op_last;
2605 first->op_flags |= (last->op_flags & OPf_KIDS);
2613 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2621 if (last->op_type == type) {
2622 if (type == OP_LIST) { /* already a PUSHMARK there */
2623 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2624 ((LISTOP*)last)->op_first->op_sibling = first;
2625 if (!(first->op_flags & OPf_PARENS))
2626 last->op_flags &= ~OPf_PARENS;
2629 if (!(last->op_flags & OPf_KIDS)) {
2630 ((LISTOP*)last)->op_last = first;
2631 last->op_flags |= OPf_KIDS;
2633 first->op_sibling = ((LISTOP*)last)->op_first;
2634 ((LISTOP*)last)->op_first = first;
2636 last->op_flags |= OPf_KIDS;
2640 return newLISTOP(type, 0, first, last);
2646 Perl_newNULLLIST(pTHX)
2648 return newOP(OP_STUB, 0);
2652 Perl_force_list(pTHX_ OP *o)
2654 if (!o || o->op_type != OP_LIST)
2655 o = newLISTOP(OP_LIST, 0, o, Nullop);
2661 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2665 NewOp(1101, listop, 1, LISTOP);
2667 listop->op_type = type;
2668 listop->op_ppaddr = PL_ppaddr[type];
2671 listop->op_flags = flags;
2675 else if (!first && last)
2678 first->op_sibling = last;
2679 listop->op_first = first;
2680 listop->op_last = last;
2681 if (type == OP_LIST) {
2683 pushop = newOP(OP_PUSHMARK, 0);
2684 pushop->op_sibling = first;
2685 listop->op_first = pushop;
2686 listop->op_flags |= OPf_KIDS;
2688 listop->op_last = pushop;
2695 Perl_newOP(pTHX_ I32 type, I32 flags)
2698 NewOp(1101, o, 1, OP);
2700 o->op_ppaddr = PL_ppaddr[type];
2701 o->op_flags = flags;
2704 o->op_private = 0 + (flags >> 8);
2705 if (PL_opargs[type] & OA_RETSCALAR)
2707 if (PL_opargs[type] & OA_TARGET)
2708 o->op_targ = pad_alloc(type, SVs_PADTMP);
2709 return CHECKOP(type, o);
2713 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2718 first = newOP(OP_STUB, 0);
2719 if (PL_opargs[type] & OA_MARK)
2720 first = force_list(first);
2722 NewOp(1101, unop, 1, UNOP);
2723 unop->op_type = type;
2724 unop->op_ppaddr = PL_ppaddr[type];
2725 unop->op_first = first;
2726 unop->op_flags = flags | OPf_KIDS;
2727 unop->op_private = 1 | (flags >> 8);
2728 unop = (UNOP*) CHECKOP(type, unop);
2732 return fold_constants((OP *) unop);
2736 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2739 NewOp(1101, binop, 1, BINOP);
2742 first = newOP(OP_NULL, 0);
2744 binop->op_type = type;
2745 binop->op_ppaddr = PL_ppaddr[type];
2746 binop->op_first = first;
2747 binop->op_flags = flags | OPf_KIDS;
2750 binop->op_private = 1 | (flags >> 8);
2753 binop->op_private = 2 | (flags >> 8);
2754 first->op_sibling = last;
2757 binop = (BINOP*)CHECKOP(type, binop);
2758 if (binop->op_next || binop->op_type != type)
2761 binop->op_last = binop->op_first->op_sibling;
2763 return fold_constants((OP *)binop);
2767 uvcompare(const void *a, const void *b)
2769 if (*((UV *)a) < (*(UV *)b))
2771 if (*((UV *)a) > (*(UV *)b))
2773 if (*((UV *)a+1) < (*(UV *)b+1))
2775 if (*((UV *)a+1) > (*(UV *)b+1))
2781 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2783 SV *tstr = ((SVOP*)expr)->op_sv;
2784 SV *rstr = ((SVOP*)repl)->op_sv;
2787 U8 *t = (U8*)SvPV(tstr, tlen);
2788 U8 *r = (U8*)SvPV(rstr, rlen);
2795 register short *tbl;
2797 PL_hints |= HINT_BLOCK_SCOPE;
2798 complement = o->op_private & OPpTRANS_COMPLEMENT;
2799 del = o->op_private & OPpTRANS_DELETE;
2800 squash = o->op_private & OPpTRANS_SQUASH;
2803 o->op_private |= OPpTRANS_FROM_UTF;
2806 o->op_private |= OPpTRANS_TO_UTF;
2808 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2809 SV* listsv = newSVpvn("# comment\n",10);
2811 U8* tend = t + tlen;
2812 U8* rend = r + rlen;
2826 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2827 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2833 tsave = t = bytes_to_utf8(t, &len);
2836 if (!to_utf && rlen) {
2838 rsave = r = bytes_to_utf8(r, &len);
2842 /* There are several snags with this code on EBCDIC:
2843 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
2844 2. scan_const() in toke.c has encoded chars in native encoding which makes
2845 ranges at least in EBCDIC 0..255 range the bottom odd.
2849 U8 tmpbuf[UTF8_MAXLEN+1];
2852 New(1109, cp, 2*tlen, UV);
2854 transv = newSVpvn("",0);
2856 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, 0);
2858 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
2860 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, 0);
2864 cp[2*i+1] = cp[2*i];
2868 qsort(cp, i, 2*sizeof(UV), uvcompare);
2869 for (j = 0; j < i; j++) {
2871 diff = val - nextmin;
2873 t = uvuni_to_utf8(tmpbuf,nextmin);
2874 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2876 U8 range_mark = UTF_TO_NATIVE(0xff);
2877 t = uvuni_to_utf8(tmpbuf, val - 1);
2878 sv_catpvn(transv, (char *)&range_mark, 1);
2879 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2886 t = uvuni_to_utf8(tmpbuf,nextmin);
2887 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2889 U8 range_mark = UTF_TO_NATIVE(0xff);
2890 sv_catpvn(transv, (char *)&range_mark, 1);
2892 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
2893 UNICODE_ALLOW_SUPER);
2894 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2895 t = (U8*)SvPVX(transv);
2896 tlen = SvCUR(transv);
2900 else if (!rlen && !del) {
2901 r = t; rlen = tlen; rend = tend;
2904 if ((!rlen && !del) || t == r ||
2905 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2907 o->op_private |= OPpTRANS_IDENTICAL;
2911 while (t < tend || tfirst <= tlast) {
2912 /* see if we need more "t" chars */
2913 if (tfirst > tlast) {
2914 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, 0);
2916 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
2918 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, 0);
2925 /* now see if we need more "r" chars */
2926 if (rfirst > rlast) {
2928 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, 0);
2930 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
2932 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, 0);
2941 rfirst = rlast = 0xffffffff;
2945 /* now see which range will peter our first, if either. */
2946 tdiff = tlast - tfirst;
2947 rdiff = rlast - rfirst;
2954 if (rfirst == 0xffffffff) {
2955 diff = tdiff; /* oops, pretend rdiff is infinite */
2957 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2958 (long)tfirst, (long)tlast);
2960 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2964 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2965 (long)tfirst, (long)(tfirst + diff),
2968 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2969 (long)tfirst, (long)rfirst);
2971 if (rfirst + diff > max)
2972 max = rfirst + diff;
2974 grows = (tfirst < rfirst &&
2975 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
2987 else if (max > 0xff)
2992 Safefree(cPVOPo->op_pv);
2993 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2994 SvREFCNT_dec(listsv);
2996 SvREFCNT_dec(transv);
2998 if (!del && havefinal && rlen)
2999 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
3000 newSVuv((UV)final), 0);
3003 o->op_private |= OPpTRANS_GROWS;
3015 tbl = (short*)cPVOPo->op_pv;
3017 Zero(tbl, 256, short);
3018 for (i = 0; i < tlen; i++)
3020 for (i = 0, j = 0; i < 256; i++) {
3031 if (i < 128 && r[j] >= 128)
3041 o->op_private |= OPpTRANS_IDENTICAL;
3046 cPVOPo->op_pv = (char*)Renew(tbl, 0x101+rlen-j, short);
3047 tbl[0x100] = rlen - j;
3048 for (i=0; i < rlen - j; i++)
3049 tbl[0x101+i] = r[j+i];
3053 if (!rlen && !del) {
3056 o->op_private |= OPpTRANS_IDENTICAL;
3058 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3059 o->op_private |= OPpTRANS_IDENTICAL;
3061 for (i = 0; i < 256; i++)
3063 for (i = 0, j = 0; i < tlen; i++,j++) {
3066 if (tbl[t[i]] == -1)
3072 if (tbl[t[i]] == -1) {
3073 if (t[i] < 128 && r[j] >= 128)
3080 o->op_private |= OPpTRANS_GROWS;
3088 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3092 NewOp(1101, pmop, 1, PMOP);
3093 pmop->op_type = type;
3094 pmop->op_ppaddr = PL_ppaddr[type];
3095 pmop->op_flags = flags;
3096 pmop->op_private = 0 | (flags >> 8);
3098 if (PL_hints & HINT_RE_TAINT)
3099 pmop->op_pmpermflags |= PMf_RETAINT;
3100 if (PL_hints & HINT_LOCALE)
3101 pmop->op_pmpermflags |= PMf_LOCALE;
3102 pmop->op_pmflags = pmop->op_pmpermflags;
3107 if(av_len((AV*) PL_regex_pad[0]) > -1) {
3108 repointer = av_pop((AV*)PL_regex_pad[0]);
3109 pmop->op_pmoffset = SvIV(repointer);
3110 SvREPADTMP_off(repointer);
3111 sv_setiv(repointer,0);
3113 repointer = newSViv(0);
3114 av_push(PL_regex_padav,SvREFCNT_inc(repointer));
3115 pmop->op_pmoffset = av_len(PL_regex_padav);
3116 PL_regex_pad = AvARRAY(PL_regex_padav);
3121 /* link into pm list */
3122 if (type != OP_TRANS && PL_curstash) {
3123 pmop->op_pmnext = HvPMROOT(PL_curstash);
3124 HvPMROOT(PL_curstash) = pmop;
3125 PmopSTASH_set(pmop,PL_curstash);
3132 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
3136 I32 repl_has_vars = 0;
3138 if (o->op_type == OP_TRANS)
3139 return pmtrans(o, expr, repl);
3141 PL_hints |= HINT_BLOCK_SCOPE;
3144 if (expr->op_type == OP_CONST) {
3146 SV *pat = ((SVOP*)expr)->op_sv;
3147 char *p = SvPV(pat, plen);
3148 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
3149 sv_setpvn(pat, "\\s+", 3);
3150 p = SvPV(pat, plen);
3151 pm->op_pmflags |= PMf_SKIPWHITE;
3154 pm->op_pmdynflags |= PMdf_UTF8;
3155 PM_SETRE(pm, CALLREGCOMP(aTHX_ p, p + plen, pm));
3156 if (strEQ("\\s+", PM_GETRE(pm)->precomp))
3157 pm->op_pmflags |= PMf_WHITE;
3161 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3162 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3164 : OP_REGCMAYBE),0,expr);
3166 NewOp(1101, rcop, 1, LOGOP);
3167 rcop->op_type = OP_REGCOMP;
3168 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3169 rcop->op_first = scalar(expr);
3170 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
3171 ? (OPf_SPECIAL | OPf_KIDS)
3173 rcop->op_private = 1;
3176 /* establish postfix order */
3177 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3179 rcop->op_next = expr;
3180 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3183 rcop->op_next = LINKLIST(expr);
3184 expr->op_next = (OP*)rcop;
3187 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3192 if (pm->op_pmflags & PMf_EVAL) {
3194 if (CopLINE(PL_curcop) < PL_multi_end)
3195 CopLINE_set(PL_curcop, PL_multi_end);
3197 #ifdef USE_5005THREADS
3198 else if (repl->op_type == OP_THREADSV
3199 && strchr("&`'123456789+",
3200 PL_threadsv_names[repl->op_targ]))
3204 #endif /* USE_5005THREADS */
3205 else if (repl->op_type == OP_CONST)
3209 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3210 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3211 #ifdef USE_5005THREADS
3212 if (curop->op_type == OP_THREADSV) {
3214 if (strchr("&`'123456789+", curop->op_private))
3218 if (curop->op_type == OP_GV) {
3219 GV *gv = cGVOPx_gv(curop);
3221 if (strchr("&`'123456789+", *GvENAME(gv)))
3224 #endif /* USE_5005THREADS */
3225 else if (curop->op_type == OP_RV2CV)
3227 else if (curop->op_type == OP_RV2SV ||
3228 curop->op_type == OP_RV2AV ||
3229 curop->op_type == OP_RV2HV ||
3230 curop->op_type == OP_RV2GV) {
3231 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3234 else if (curop->op_type == OP_PADSV ||
3235 curop->op_type == OP_PADAV ||
3236 curop->op_type == OP_PADHV ||
3237 curop->op_type == OP_PADANY) {
3240 else if (curop->op_type == OP_PUSHRE)
3241 ; /* Okay here, dangerous in newASSIGNOP */
3251 || PM_GETRE(pm)->reganch & ROPT_EVAL_SEEN))) {
3252 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3253 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
3254 prepend_elem(o->op_type, scalar(repl), o);
3257 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3258 pm->op_pmflags |= PMf_MAYBE_CONST;
3259 pm->op_pmpermflags |= PMf_MAYBE_CONST;
3261 NewOp(1101, rcop, 1, LOGOP);
3262 rcop->op_type = OP_SUBSTCONT;
3263 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3264 rcop->op_first = scalar(repl);
3265 rcop->op_flags |= OPf_KIDS;
3266 rcop->op_private = 1;
3269 /* establish postfix order */
3270 rcop->op_next = LINKLIST(repl);
3271 repl->op_next = (OP*)rcop;
3273 pm->op_pmreplroot = scalar((OP*)rcop);
3274 pm->op_pmreplstart = LINKLIST(rcop);
3283 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3286 NewOp(1101, svop, 1, SVOP);
3287 svop->op_type = type;
3288 svop->op_ppaddr = PL_ppaddr[type];
3290 svop->op_next = (OP*)svop;
3291 svop->op_flags = flags;
3292 if (PL_opargs[type] & OA_RETSCALAR)
3294 if (PL_opargs[type] & OA_TARGET)
3295 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3296 return CHECKOP(type, svop);
3300 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3303 NewOp(1101, padop, 1, PADOP);
3304 padop->op_type = type;
3305 padop->op_ppaddr = PL_ppaddr[type];
3306 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3307 SvREFCNT_dec(PL_curpad[padop->op_padix]);
3308 PL_curpad[padop->op_padix] = sv;
3310 padop->op_next = (OP*)padop;
3311 padop->op_flags = flags;
3312 if (PL_opargs[type] & OA_RETSCALAR)
3314 if (PL_opargs[type] & OA_TARGET)
3315 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3316 return CHECKOP(type, padop);
3320 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3324 return newPADOP(type, flags, SvREFCNT_inc(gv));
3326 return newSVOP(type, flags, SvREFCNT_inc(gv));
3331 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3334 NewOp(1101, pvop, 1, PVOP);
3335 pvop->op_type = type;
3336 pvop->op_ppaddr = PL_ppaddr[type];
3338 pvop->op_next = (OP*)pvop;
3339 pvop->op_flags = flags;
3340 if (PL_opargs[type] & OA_RETSCALAR)
3342 if (PL_opargs[type] & OA_TARGET)
3343 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3344 return CHECKOP(type, pvop);
3348 Perl_package(pTHX_ OP *o)
3352 save_hptr(&PL_curstash);
3353 save_item(PL_curstname);
3358 name = SvPV(sv, len);
3359 PL_curstash = gv_stashpvn(name,len,TRUE);
3360 sv_setpvn(PL_curstname, name, len);
3364 deprecate("\"package\" with no arguments");
3365 sv_setpv(PL_curstname,"<none>");
3366 PL_curstash = Nullhv;
3368 PL_hints |= HINT_BLOCK_SCOPE;
3369 PL_copline = NOLINE;
3374 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3379 char *packname = Nullch;
3383 if (id->op_type != OP_CONST)
3384 Perl_croak(aTHX_ "Module name must be constant");
3388 if (version != Nullop) {
3389 SV *vesv = ((SVOP*)version)->op_sv;
3391 if (arg == Nullop && !SvNIOKp(vesv)) {
3398 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3399 Perl_croak(aTHX_ "Version number must be constant number");
3401 /* Make copy of id so we don't free it twice */
3402 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3404 /* Fake up a method call to VERSION */
3405 meth = newSVpvn("VERSION",7);
3406 sv_upgrade(meth, SVt_PVIV);
3407 (void)SvIOK_on(meth);
3408 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3409 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3410 append_elem(OP_LIST,
3411 prepend_elem(OP_LIST, pack, list(version)),
3412 newSVOP(OP_METHOD_NAMED, 0, meth)));
3416 /* Fake up an import/unimport */
3417 if (arg && arg->op_type == OP_STUB)
3418 imop = arg; /* no import on explicit () */
3419 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3420 imop = Nullop; /* use 5.0; */
3425 /* Make copy of id so we don't free it twice */
3426 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3428 /* Fake up a method call to import/unimport */
3429 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);;
3430 (void)SvUPGRADE(meth, SVt_PVIV);
3431 (void)SvIOK_on(meth);
3432 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3433 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3434 append_elem(OP_LIST,
3435 prepend_elem(OP_LIST, pack, list(arg)),
3436 newSVOP(OP_METHOD_NAMED, 0, meth)));
3439 if (ckWARN(WARN_MISC) &&
3440 imop && (imop != arg) && /* no warning on use 5.0; or explicit () */
3441 SvPOK(packsv = ((SVOP*)id)->op_sv))
3443 /* BEGIN will free the ops, so we need to make a copy */
3444 packlen = SvCUR(packsv);
3445 packname = savepvn(SvPVX(packsv), packlen);
3448 /* Fake up the BEGIN {}, which does its thing immediately. */
3450 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3453 append_elem(OP_LINESEQ,
3454 append_elem(OP_LINESEQ,
3455 newSTATEOP(0, Nullch, newUNOP(OP_REQUIRE, 0, id)),
3456 newSTATEOP(0, Nullch, veop)),
3457 newSTATEOP(0, Nullch, imop) ));
3460 /* The "did you use incorrect case?" warning used to be here.
3461 * The problem is that on case-insensitive filesystems one
3462 * might get false positives for "use" (and "require"):
3463 * "use Strict" or "require CARP" will work. This causes
3464 * portability problems for the script: in case-strict
3465 * filesystems the script will stop working.
3467 * The "incorrect case" warning checked whether "use Foo"
3468 * imported "Foo" to your namespace, but that is wrong, too:
3469 * there is no requirement nor promise in the language that
3470 * a Foo.pm should or would contain anything in package "Foo".
3472 * There is very little Configure-wise that can be done, either:
3473 * the case-sensitivity of the build filesystem of Perl does not
3474 * help in guessing the case-sensitivity of the runtime environment.
3479 PL_hints |= HINT_BLOCK_SCOPE;
3480 PL_copline = NOLINE;
3485 =head1 Embedding Functions
3487 =for apidoc load_module
3489 Loads the module whose name is pointed to by the string part of name.
3490 Note that the actual module name, not its filename, should be given.
3491 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3492 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3493 (or 0 for no flags). ver, if specified, provides version semantics
3494 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3495 arguments can be used to specify arguments to the module's import()
3496 method, similar to C<use Foo::Bar VERSION LIST>.
3501 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3504 va_start(args, ver);
3505 vload_module(flags, name, ver, &args);
3509 #ifdef PERL_IMPLICIT_CONTEXT
3511 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3515 va_start(args, ver);
3516 vload_module(flags, name, ver, &args);
3522 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3524 OP *modname, *veop, *imop;
3526 modname = newSVOP(OP_CONST, 0, name);
3527 modname->op_private |= OPpCONST_BARE;
3529 veop = newSVOP(OP_CONST, 0, ver);
3533 if (flags & PERL_LOADMOD_NOIMPORT) {
3534 imop = sawparens(newNULLLIST());
3536 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3537 imop = va_arg(*args, OP*);
3542 sv = va_arg(*args, SV*);
3544 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3545 sv = va_arg(*args, SV*);
3549 line_t ocopline = PL_copline;
3550 int oexpect = PL_expect;
3552 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3553 veop, modname, imop);
3554 PL_expect = oexpect;
3555 PL_copline = ocopline;
3560 Perl_dofile(pTHX_ OP *term)
3565 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3566 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
3567 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3569 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
3570 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3571 append_elem(OP_LIST, term,
3572 scalar(newUNOP(OP_RV2CV, 0,
3577 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3583 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3585 return newBINOP(OP_LSLICE, flags,
3586 list(force_list(subscript)),
3587 list(force_list(listval)) );
3591 S_list_assignment(pTHX_ register OP *o)
3596 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3597 o = cUNOPo->op_first;
3599 if (o->op_type == OP_COND_EXPR) {
3600 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3601 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3606 yyerror("Assignment to both a list and a scalar");
3610 if (o->op_type == OP_LIST &&
3611 (o->op_flags & OPf_WANT) == OPf_WANT_SCALAR &&
3612 o->op_private & OPpLVAL_INTRO)
3615 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3616 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3617 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3620 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3623 if (o->op_type == OP_RV2SV)
3630 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3635 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3636 return newLOGOP(optype, 0,
3637 mod(scalar(left), optype),
3638 newUNOP(OP_SASSIGN, 0, scalar(right)));
3641 return newBINOP(optype, OPf_STACKED,
3642 mod(scalar(left), optype), scalar(right));
3646 if (list_assignment(left)) {
3650 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3651 left = mod(left, OP_AASSIGN);
3659 curop = list(force_list(left));
3660 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3661 o->op_private = 0 | (flags >> 8);
3662 for (curop = ((LISTOP*)curop)->op_first;
3663 curop; curop = curop->op_sibling)
3665 if (curop->op_type == OP_RV2HV &&
3666 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3667 o->op_private |= OPpASSIGN_HASH;
3671 if (!(left->op_private & OPpLVAL_INTRO)) {
3674 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3675 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3676 if (curop->op_type == OP_GV) {
3677 GV *gv = cGVOPx_gv(curop);
3678 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3680 SvCUR(gv) = PL_generation;
3682 else if (curop->op_type == OP_PADSV ||
3683 curop->op_type == OP_PADAV ||
3684 curop->op_type == OP_PADHV ||
3685 curop->op_type == OP_PADANY) {
3686 SV **svp = AvARRAY(PL_comppad_name);
3687 SV *sv = svp[curop->op_targ];
3688 if (SvCUR(sv) == PL_generation)
3690 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3692 else if (curop->op_type == OP_RV2CV)
3694 else if (curop->op_type == OP_RV2SV ||
3695 curop->op_type == OP_RV2AV ||
3696 curop->op_type == OP_RV2HV ||
3697 curop->op_type == OP_RV2GV) {
3698 if (lastop->op_type != OP_GV) /* funny deref? */
3701 else if (curop->op_type == OP_PUSHRE) {
3702 if (((PMOP*)curop)->op_pmreplroot) {
3704 GV *gv = (GV*)PL_curpad[INT2PTR(PADOFFSET,((PMOP*)curop)->op_pmreplroot)];
3706 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3708 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3710 SvCUR(gv) = PL_generation;
3719 o->op_private |= OPpASSIGN_COMMON;
3721 if (right && right->op_type == OP_SPLIT) {
3723 if ((tmpop = ((LISTOP*)right)->op_first) &&
3724 tmpop->op_type == OP_PUSHRE)
3726 PMOP *pm = (PMOP*)tmpop;
3727 if (left->op_type == OP_RV2AV &&
3728 !(left->op_private & OPpLVAL_INTRO) &&
3729 !(o->op_private & OPpASSIGN_COMMON) )
3731 tmpop = ((UNOP*)left)->op_first;
3732 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3734 pm->op_pmreplroot = INT2PTR(OP*, cPADOPx(tmpop)->op_padix);
3735 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3737 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3738 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3740 pm->op_pmflags |= PMf_ONCE;
3741 tmpop = cUNOPo->op_first; /* to list (nulled) */
3742 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3743 tmpop->op_sibling = Nullop; /* don't free split */
3744 right->op_next = tmpop->op_next; /* fix starting loc */
3745 op_free(o); /* blow off assign */
3746 right->op_flags &= ~OPf_WANT;
3747 /* "I don't know and I don't care." */
3752 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
3753 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3755 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3757 sv_setiv(sv, PL_modcount+1);
3765 right = newOP(OP_UNDEF, 0);
3766 if (right->op_type == OP_READLINE) {
3767 right->op_flags |= OPf_STACKED;
3768 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3771 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3772 o = newBINOP(OP_SASSIGN, flags,
3773 scalar(right), mod(scalar(left), OP_SASSIGN) );
3785 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3787 U32 seq = intro_my();
3790 NewOp(1101, cop, 1, COP);
3791 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3792 cop->op_type = OP_DBSTATE;
3793 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3796 cop->op_type = OP_NEXTSTATE;
3797 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3799 cop->op_flags = flags;
3800 cop->op_private = (PL_hints & HINT_PRIVATE_MASK);
3802 cop->op_private |= NATIVE_HINTS;
3804 PL_compiling.op_private = cop->op_private;
3805 cop->op_next = (OP*)cop;
3808 cop->cop_label = label;
3809 PL_hints |= HINT_BLOCK_SCOPE;
3812 cop->cop_arybase = PL_curcop->cop_arybase;
3813 if (specialWARN(PL_curcop->cop_warnings))
3814 cop->cop_warnings = PL_curcop->cop_warnings ;
3816 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3817 if (specialCopIO(PL_curcop->cop_io))
3818 cop->cop_io = PL_curcop->cop_io;
3820 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3823 if (PL_copline == NOLINE)
3824 CopLINE_set(cop, CopLINE(PL_curcop));
3826 CopLINE_set(cop, PL_copline);
3827 PL_copline = NOLINE;
3830 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3832 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3834 CopSTASH_set(cop, PL_curstash);
3836 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3837 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3838 if (svp && *svp != &PL_sv_undef ) {
3839 (void)SvIOK_on(*svp);
3840 SvIVX(*svp) = PTR2IV(cop);
3844 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3847 /* "Introduce" my variables to visible status. */
3855 if (! PL_min_intro_pending)
3856 return PL_cop_seqmax;
3858 svp = AvARRAY(PL_comppad_name);
3859 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3860 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3861 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3862 SvNVX(sv) = (NV)PL_cop_seqmax;
3865 PL_min_intro_pending = 0;
3866 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3867 return PL_cop_seqmax++;
3871 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3873 return new_logop(type, flags, &first, &other);
3877 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3881 OP *first = *firstp;
3882 OP *other = *otherp;
3884 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3885 return newBINOP(type, flags, scalar(first), scalar(other));
3887 scalarboolean(first);
3888 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3889 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3890 if (type == OP_AND || type == OP_OR) {
3896 first = *firstp = cUNOPo->op_first;
3898 first->op_next = o->op_next;
3899 cUNOPo->op_first = Nullop;
3903 if (first->op_type == OP_CONST) {
3904 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3905 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
3906 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3917 else if (first->op_type == OP_WANTARRAY) {
3923 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3924 OP *k1 = ((UNOP*)first)->op_first;
3925 OP *k2 = k1->op_sibling;
3927 switch (first->op_type)
3930 if (k2 && k2->op_type == OP_READLINE
3931 && (k2->op_flags & OPf_STACKED)
3932 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3934 warnop = k2->op_type;
3939 if (k1->op_type == OP_READDIR
3940 || k1->op_type == OP_GLOB
3941 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3942 || k1->op_type == OP_EACH)
3944 warnop = ((k1->op_type == OP_NULL)
3945 ? k1->op_targ : k1->op_type);
3950 line_t oldline = CopLINE(PL_curcop);
3951 CopLINE_set(PL_curcop, PL_copline);
3952 Perl_warner(aTHX_ packWARN(WARN_MISC),
3953 "Value of %s%s can be \"0\"; test with defined()",
3955 ((warnop == OP_READLINE || warnop == OP_GLOB)
3956 ? " construct" : "() operator"));
3957 CopLINE_set(PL_curcop, oldline);
3964 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3965 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3967 NewOp(1101, logop, 1, LOGOP);
3969 logop->op_type = type;
3970 logop->op_ppaddr = PL_ppaddr[type];
3971 logop->op_first = first;
3972 logop->op_flags = flags | OPf_KIDS;
3973 logop->op_other = LINKLIST(other);
3974 logop->op_private = 1 | (flags >> 8);
3976 /* establish postfix order */
3977 logop->op_next = LINKLIST(first);
3978 first->op_next = (OP*)logop;
3979 first->op_sibling = other;
3981 o = newUNOP(OP_NULL, 0, (OP*)logop);
3988 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3995 return newLOGOP(OP_AND, 0, first, trueop);
3997 return newLOGOP(OP_OR, 0, first, falseop);
3999 scalarboolean(first);
4000 if (first->op_type == OP_CONST) {
4001 if (SvTRUE(((SVOP*)first)->op_sv)) {
4012 else if (first->op_type == OP_WANTARRAY) {
4016 NewOp(1101, logop, 1, LOGOP);
4017 logop->op_type = OP_COND_EXPR;
4018 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4019 logop->op_first = first;
4020 logop->op_flags = flags | OPf_KIDS;
4021 logop->op_private = 1 | (flags >> 8);
4022 logop->op_other = LINKLIST(trueop);
4023 logop->op_next = LINKLIST(falseop);
4026 /* establish postfix order */
4027 start = LINKLIST(first);
4028 first->op_next = (OP*)logop;
4030 first->op_sibling = trueop;
4031 trueop->op_sibling = falseop;
4032 o = newUNOP(OP_NULL, 0, (OP*)logop);
4034 trueop->op_next = falseop->op_next = o;
4041 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4049 NewOp(1101, range, 1, LOGOP);
4051 range->op_type = OP_RANGE;
4052 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4053 range->op_first = left;
4054 range->op_flags = OPf_KIDS;
4055 leftstart = LINKLIST(left);
4056 range->op_other = LINKLIST(right);
4057 range->op_private = 1 | (flags >> 8);
4059 left->op_sibling = right;
4061 range->op_next = (OP*)range;
4062 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4063 flop = newUNOP(OP_FLOP, 0, flip);
4064 o = newUNOP(OP_NULL, 0, flop);
4066 range->op_next = leftstart;
4068 left->op_next = flip;
4069 right->op_next = flop;
4071 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4072 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4073 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4074 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4076 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4077 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4080 if (!flip->op_private || !flop->op_private)
4081 linklist(o); /* blow off optimizer unless constant */
4087 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4091 int once = block && block->op_flags & OPf_SPECIAL &&
4092 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4095 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4096 return block; /* do {} while 0 does once */
4097 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4098 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4099 expr = newUNOP(OP_DEFINED, 0,
4100 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4101 } else if (expr->op_flags & OPf_KIDS) {
4102 OP *k1 = ((UNOP*)expr)->op_first;
4103 OP *k2 = (k1) ? k1->op_sibling : NULL;
4104 switch (expr->op_type) {
4106 if (k2 && k2->op_type == OP_READLINE
4107 && (k2->op_flags & OPf_STACKED)
4108 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4109 expr = newUNOP(OP_DEFINED, 0, expr);
4113 if (k1->op_type == OP_READDIR
4114 || k1->op_type == OP_GLOB
4115 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4116 || k1->op_type == OP_EACH)
4117 expr = newUNOP(OP_DEFINED, 0, expr);
4123 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4124 o = new_logop(OP_AND, 0, &expr, &listop);
4127 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4129 if (once && o != listop)
4130 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4133 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4135 o->op_flags |= flags;
4137 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4142 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
4150 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4151 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
4152 expr = newUNOP(OP_DEFINED, 0,
4153 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4154 } else if (expr && (expr->op_flags & OPf_KIDS)) {
4155 OP *k1 = ((UNOP*)expr)->op_first;
4156 OP *k2 = (k1) ? k1->op_sibling : NULL;
4157 switch (expr->op_type) {
4159 if (k2 && k2->op_type == OP_READLINE
4160 && (k2->op_flags & OPf_STACKED)
4161 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4162 expr = newUNOP(OP_DEFINED, 0, expr);
4166 if (k1->op_type == OP_READDIR
4167 || k1->op_type == OP_GLOB
4168 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4169 || k1->op_type == OP_EACH)
4170 expr = newUNOP(OP_DEFINED, 0, expr);
4176 block = newOP(OP_NULL, 0);
4178 block = scope(block);
4182 next = LINKLIST(cont);
4185 OP *unstack = newOP(OP_UNSTACK, 0);
4188 cont = append_elem(OP_LINESEQ, cont, unstack);
4189 if ((line_t)whileline != NOLINE) {
4190 PL_copline = whileline;
4191 cont = append_elem(OP_LINESEQ, cont,
4192 newSTATEOP(0, Nullch, Nullop));
4196 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4197 redo = LINKLIST(listop);
4200 PL_copline = whileline;
4202 o = new_logop(OP_AND, 0, &expr, &listop);
4203 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4204 op_free(expr); /* oops, it's a while (0) */
4206 return Nullop; /* listop already freed by new_logop */
4209 ((LISTOP*)listop)->op_last->op_next =
4210 (o == listop ? redo : LINKLIST(o));
4216 NewOp(1101,loop,1,LOOP);
4217 loop->op_type = OP_ENTERLOOP;
4218 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4219 loop->op_private = 0;
4220 loop->op_next = (OP*)loop;
4223 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4225 loop->op_redoop = redo;
4226 loop->op_lastop = o;
4227 o->op_private |= loopflags;
4230 loop->op_nextop = next;
4232 loop->op_nextop = o;
4234 o->op_flags |= flags;
4235 o->op_private |= (flags >> 8);
4240 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
4248 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4249 sv->op_type = OP_RV2GV;
4250 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4252 else if (sv->op_type == OP_PADSV) { /* private variable */
4253 padoff = sv->op_targ;
4258 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
4259 padoff = sv->op_targ;
4261 iterflags |= OPf_SPECIAL;
4266 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4269 #ifdef USE_5005THREADS
4270 padoff = find_threadsv("_");
4271 iterflags |= OPf_SPECIAL;
4273 sv = newGVOP(OP_GV, 0, PL_defgv);
4276 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4277 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4278 iterflags |= OPf_STACKED;
4280 else if (expr->op_type == OP_NULL &&
4281 (expr->op_flags & OPf_KIDS) &&
4282 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4284 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4285 * set the STACKED flag to indicate that these values are to be
4286 * treated as min/max values by 'pp_iterinit'.
4288 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4289 LOGOP* range = (LOGOP*) flip->op_first;
4290 OP* left = range->op_first;
4291 OP* right = left->op_sibling;
4294 range->op_flags &= ~OPf_KIDS;
4295 range->op_first = Nullop;
4297 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4298 listop->op_first->op_next = range->op_next;
4299 left->op_next = range->op_other;
4300 right->op_next = (OP*)listop;
4301 listop->op_next = listop->op_first;
4304 expr = (OP*)(listop);
4306 iterflags |= OPf_STACKED;
4309 expr = mod(force_list(expr), OP_GREPSTART);
4313 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4314 append_elem(OP_LIST, expr, scalar(sv))));
4315 assert(!loop->op_next);
4316 #ifdef PL_OP_SLAB_ALLOC
4319 NewOp(1234,tmp,1,LOOP);
4320 Copy(loop,tmp,1,LOOP);
4325 Renew(loop, 1, LOOP);
4327 loop->op_targ = padoff;
4328 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4329 PL_copline = forline;
4330 return newSTATEOP(0, label, wop);
4334 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4339 if (type != OP_GOTO || label->op_type == OP_CONST) {
4340 /* "last()" means "last" */
4341 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4342 o = newOP(type, OPf_SPECIAL);
4344 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4345 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4351 if (label->op_type == OP_ENTERSUB)
4352 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4353 o = newUNOP(type, OPf_STACKED, label);
4355 PL_hints |= HINT_BLOCK_SCOPE;
4360 Perl_cv_undef(pTHX_ CV *cv)
4362 #ifdef USE_5005THREADS
4364 MUTEX_DESTROY(CvMUTEXP(cv));
4365 Safefree(CvMUTEXP(cv));
4368 #endif /* USE_5005THREADS */
4371 if (CvFILE(cv) && !CvXSUB(cv)) {
4372 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
4373 Safefree(CvFILE(cv));
4378 if (!CvXSUB(cv) && CvROOT(cv)) {
4379 #ifdef USE_5005THREADS
4380 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4381 Perl_croak(aTHX_ "Can't undef active subroutine");
4384 Perl_croak(aTHX_ "Can't undef active subroutine");
4385 #endif /* USE_5005THREADS */
4388 SAVEVPTR(PL_curpad);
4391 op_free(CvROOT(cv));
4392 CvROOT(cv) = Nullop;
4395 SvPOK_off((SV*)cv); /* forget prototype */
4397 /* Since closure prototypes have the same lifetime as the containing
4398 * CV, they don't hold a refcount on the outside CV. This avoids
4399 * the refcount loop between the outer CV (which keeps a refcount to
4400 * the closure prototype in the pad entry for pp_anoncode()) and the
4401 * closure prototype, and the ensuing memory leak. --GSAR */
4402 if (!CvANON(cv) || CvCLONED(cv))
4403 SvREFCNT_dec(CvOUTSIDE(cv));
4404 CvOUTSIDE(cv) = Nullcv;
4406 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4409 if (CvPADLIST(cv)) {
4410 /* may be during global destruction */
4411 if (SvREFCNT(CvPADLIST(cv))) {
4412 I32 i = AvFILLp(CvPADLIST(cv));
4414 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4415 SV* sv = svp ? *svp : Nullsv;
4418 if (sv == (SV*)PL_comppad_name)
4419 PL_comppad_name = Nullav;
4420 else if (sv == (SV*)PL_comppad) {
4421 PL_comppad = Nullav;
4422 PL_curpad = Null(SV**);
4426 SvREFCNT_dec((SV*)CvPADLIST(cv));
4428 CvPADLIST(cv) = Nullav;
4436 #ifdef DEBUG_CLOSURES
4438 S_cv_dump(pTHX_ CV *cv)
4441 CV *outside = CvOUTSIDE(cv);
4442 AV* padlist = CvPADLIST(cv);
4449 PerlIO_printf(Perl_debug_log,
4450 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4452 (CvANON(cv) ? "ANON"
4453 : (cv == PL_main_cv) ? "MAIN"
4454 : CvUNIQUE(cv) ? "UNIQUE"
4455 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4458 : CvANON(outside) ? "ANON"
4459 : (outside == PL_main_cv) ? "MAIN"
4460 : CvUNIQUE(outside) ? "UNIQUE"
4461 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4466 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4467 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4468 pname = AvARRAY(pad_name);
4469 ppad = AvARRAY(pad);
4471 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4472 if (SvPOK(pname[ix]))
4473 PerlIO_printf(Perl_debug_log,
4474 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4475 (int)ix, PTR2UV(ppad[ix]),
4476 SvFAKE(pname[ix]) ? "FAKE " : "",
4478 (IV)I_32(SvNVX(pname[ix])),
4481 #endif /* DEBUGGING */
4483 #endif /* DEBUG_CLOSURES */
4486 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4490 AV* protopadlist = CvPADLIST(proto);
4491 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4492 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4493 SV** pname = AvARRAY(protopad_name);
4494 SV** ppad = AvARRAY(protopad);
4495 I32 fname = AvFILLp(protopad_name);
4496 I32 fpad = AvFILLp(protopad);
4500 assert(!CvUNIQUE(proto));
4504 SAVESPTR(PL_comppad_name);
4505 SAVESPTR(PL_compcv);
4507 cv = PL_compcv = (CV*)NEWSV(1104,0);
4508 sv_upgrade((SV *)cv, SvTYPE(proto));
4509 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4512 #ifdef USE_5005THREADS
4513 New(666, CvMUTEXP(cv), 1, perl_mutex);
4514 MUTEX_INIT(CvMUTEXP(cv));
4516 #endif /* USE_5005THREADS */
4518 CvFILE(cv) = CvXSUB(proto) ? CvFILE(proto)
4519 : savepv(CvFILE(proto));
4521 CvFILE(cv) = CvFILE(proto);
4523 CvGV(cv) = CvGV(proto);
4524 CvSTASH(cv) = CvSTASH(proto);
4525 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
4526 CvSTART(cv) = CvSTART(proto);
4528 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4531 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4533 PL_comppad_name = newAV();
4534 for (ix = fname; ix >= 0; ix--)
4535 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4537 PL_comppad = newAV();
4539 comppadlist = newAV();
4540 AvREAL_off(comppadlist);
4541 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4542 av_store(comppadlist, 1, (SV*)PL_comppad);
4543 CvPADLIST(cv) = comppadlist;
4544 av_fill(PL_comppad, AvFILLp(protopad));
4545 PL_curpad = AvARRAY(PL_comppad);
4547 av = newAV(); /* will be @_ */
4549 av_store(PL_comppad, 0, (SV*)av);
4550 AvFLAGS(av) = AVf_REIFY;
4552 for (ix = fpad; ix > 0; ix--) {
4553 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4554 if (namesv && namesv != &PL_sv_undef) {
4555 char *name = SvPVX(namesv); /* XXX */
4556 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4557 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4558 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4560 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4562 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4564 else { /* our own lexical */
4567 /* anon code -- we'll come back for it */
4568 sv = SvREFCNT_inc(ppad[ix]);
4570 else if (*name == '@')
4572 else if (*name == '%')
4581 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4582 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4585 SV* sv = NEWSV(0,0);
4591 /* Now that vars are all in place, clone nested closures. */
4593 for (ix = fpad; ix > 0; ix--) {
4594 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4596 && namesv != &PL_sv_undef
4597 && !(SvFLAGS(namesv) & SVf_FAKE)
4598 && *SvPVX(namesv) == '&'
4599 && CvCLONE(ppad[ix]))
4601 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4602 SvREFCNT_dec(ppad[ix]);
4605 PL_curpad[ix] = (SV*)kid;
4609 #ifdef DEBUG_CLOSURES
4610 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4612 PerlIO_printf(Perl_debug_log, " from:\n");
4614 PerlIO_printf(Perl_debug_log, " to:\n");
4621 SV* const_sv = op_const_sv(CvSTART(cv), cv);
4623 /* constant sub () { $x } closing over $x - see lib/constant.pm */
4625 cv = newCONSTSUB(CvSTASH(proto), 0, const_sv);
4632 Perl_cv_clone(pTHX_ CV *proto)
4635 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4636 cv = cv_clone2(proto, CvOUTSIDE(proto));
4637 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4642 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4644 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4645 SV* msg = sv_newmortal();
4649 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4650 sv_setpv(msg, "Prototype mismatch:");
4652 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4654 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4655 sv_catpv(msg, " vs ");
4657 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4659 sv_catpv(msg, "none");
4660 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, msg);
4664 static void const_sv_xsub(pTHX_ CV* cv);
4668 =head1 Optree Manipulation Functions
4670 =for apidoc cv_const_sv
4672 If C<cv> is a constant sub eligible for inlining. returns the constant
4673 value returned by the sub. Otherwise, returns NULL.
4675 Constant subs can be created with C<newCONSTSUB> or as described in
4676 L<perlsub/"Constant Functions">.
4681 Perl_cv_const_sv(pTHX_ CV *cv)
4683 if (!cv || !CvCONST(cv))
4685 return (SV*)CvXSUBANY(cv).any_ptr;
4689 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4696 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4697 o = cLISTOPo->op_first->op_sibling;
4699 for (; o; o = o->op_next) {
4700 OPCODE type = o->op_type;
4702 if (sv && o->op_next == o)
4704 if (o->op_next != o) {
4705 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4707 if (type == OP_DBSTATE)
4710 if (type == OP_LEAVESUB || type == OP_RETURN)
4714 if (type == OP_CONST && cSVOPo->op_sv)
4716 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4717 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4718 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4722 /* We get here only from cv_clone2() while creating a closure.
4723 Copy the const value here instead of in cv_clone2 so that
4724 SvREADONLY_on doesn't lead to problems when leaving
4729 if (!SvREADONLY(sv) && SvREFCNT(sv) > 1)
4741 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4751 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4755 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4757 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4761 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4767 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4772 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4773 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4774 SV *sv = sv_newmortal();
4775 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
4776 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
4777 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4782 gv = gv_fetchpv(name ? name : (aname ? aname :
4783 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__")),
4784 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4794 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4795 maximum a prototype before. */
4796 if (SvTYPE(gv) > SVt_NULL) {
4797 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4798 && ckWARN_d(WARN_PROTOTYPE))
4800 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
4802 cv_ckproto((CV*)gv, NULL, ps);
4805 sv_setpv((SV*)gv, ps);
4807 sv_setiv((SV*)gv, -1);
4808 SvREFCNT_dec(PL_compcv);
4809 cv = PL_compcv = NULL;
4810 PL_sub_generation++;
4814 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4816 #ifdef GV_UNIQUE_CHECK
4817 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
4818 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
4822 if (!block || !ps || *ps || attrs)
4825 const_sv = op_const_sv(block, Nullcv);
4828 bool exists = CvROOT(cv) || CvXSUB(cv);
4830 #ifdef GV_UNIQUE_CHECK
4831 if (exists && GvUNIQUE(gv)) {
4832 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
4836 /* if the subroutine doesn't exist and wasn't pre-declared
4837 * with a prototype, assume it will be AUTOLOADed,
4838 * skipping the prototype check
4840 if (exists || SvPOK(cv))
4841 cv_ckproto(cv, gv, ps);
4842 /* already defined (or promised)? */
4843 if (exists || GvASSUMECV(gv)) {
4844 if (!block && !attrs) {
4845 if (CvFLAGS(PL_compcv)) {
4846 /* might have had built-in attrs applied */
4847 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4849 /* just a "sub foo;" when &foo is already defined */
4850 SAVEFREESV(PL_compcv);
4853 /* ahem, death to those who redefine active sort subs */
4854 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4855 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4857 if (ckWARN(WARN_REDEFINE)
4859 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4861 line_t oldline = CopLINE(PL_curcop);
4862 if (PL_copline != NOLINE)
4863 CopLINE_set(PL_curcop, PL_copline);
4864 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4865 CvCONST(cv) ? "Constant subroutine %s redefined"
4866 : "Subroutine %s redefined", name);
4867 CopLINE_set(PL_curcop, oldline);
4875 SvREFCNT_inc(const_sv);
4877 assert(!CvROOT(cv) && !CvCONST(cv));
4878 sv_setpv((SV*)cv, ""); /* prototype is "" */
4879 CvXSUBANY(cv).any_ptr = const_sv;
4880 CvXSUB(cv) = const_sv_xsub;
4885 cv = newCONSTSUB(NULL, name, const_sv);
4888 SvREFCNT_dec(PL_compcv);
4890 PL_sub_generation++;
4897 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4898 * before we clobber PL_compcv.
4902 /* Might have had built-in attributes applied -- propagate them. */
4903 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4904 if (CvGV(cv) && GvSTASH(CvGV(cv)))
4905 stash = GvSTASH(CvGV(cv));
4906 else if (CvSTASH(cv))
4907 stash = CvSTASH(cv);
4909 stash = PL_curstash;
4912 /* possibly about to re-define existing subr -- ignore old cv */
4913 rcv = (SV*)PL_compcv;
4914 if (name && GvSTASH(gv))
4915 stash = GvSTASH(gv);
4917 stash = PL_curstash;
4919 apply_attrs(stash, rcv, attrs, FALSE);
4921 if (cv) { /* must reuse cv if autoloaded */
4923 /* got here with just attrs -- work done, so bug out */
4924 SAVEFREESV(PL_compcv);
4928 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4929 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4930 CvOUTSIDE(PL_compcv) = 0;
4931 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4932 CvPADLIST(PL_compcv) = 0;
4933 /* inner references to PL_compcv must be fixed up ... */
4935 AV *padlist = CvPADLIST(cv);
4936 AV *comppad_name = (AV*)AvARRAY(padlist)[0];
4937 AV *comppad = (AV*)AvARRAY(padlist)[1];
4938 SV **namepad = AvARRAY(comppad_name);
4939 SV **curpad = AvARRAY(comppad);
4940 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
4941 SV *namesv = namepad[ix];
4942 if (namesv && namesv != &PL_sv_undef
4943 && *SvPVX(namesv) == '&')
4945 CV *innercv = (CV*)curpad[ix];
4946 if (CvOUTSIDE(innercv) == PL_compcv) {
4947 CvOUTSIDE(innercv) = cv;
4948 if (!CvANON(innercv) || CvCLONED(innercv)) {
4949 (void)SvREFCNT_inc(cv);
4950 SvREFCNT_dec(PL_compcv);
4956 /* ... before we throw it away */
4957 SvREFCNT_dec(PL_compcv);
4958 if (PERLDB_INTER)/* Advice debugger on the new sub. */
4959 ++PL_sub_generation;
4966 PL_sub_generation++;
4970 CvFILE_set_from_cop(cv, PL_curcop);
4971 CvSTASH(cv) = PL_curstash;
4972 #ifdef USE_5005THREADS
4974 if (!CvMUTEXP(cv)) {
4975 New(666, CvMUTEXP(cv), 1, perl_mutex);
4976 MUTEX_INIT(CvMUTEXP(cv));
4978 #endif /* USE_5005THREADS */
4981 sv_setpv((SV*)cv, ps);
4983 if (PL_error_count) {
4987 char *s = strrchr(name, ':');
4989 if (strEQ(s, "BEGIN")) {
4991 "BEGIN not safe after errors--compilation aborted";
4992 if (PL_in_eval & EVAL_KEEPERR)
4993 Perl_croak(aTHX_ not_safe);
4995 /* force display of errors found but not reported */
4996 sv_catpv(ERRSV, not_safe);
4997 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
5005 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
5006 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
5009 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5010 mod(scalarseq(block), OP_LEAVESUBLV));
5013 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5015 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5016 OpREFCNT_set(CvROOT(cv), 1);
5017 CvSTART(cv) = LINKLIST(CvROOT(cv));
5018 CvROOT(cv)->op_next = 0;
5019 CALL_PEEP(CvSTART(cv));
5021 /* now that optimizer has done its work, adjust pad values */
5023 SV **namep = AvARRAY(PL_comppad_name);
5024 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5027 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
5030 * The only things that a clonable function needs in its
5031 * pad are references to outer lexicals and anonymous subs.
5032 * The rest are created anew during cloning.
5034 if (!((namesv = namep[ix]) != Nullsv &&
5035 namesv != &PL_sv_undef &&
5037 *SvPVX(namesv) == '&')))
5039 SvREFCNT_dec(PL_curpad[ix]);
5040 PL_curpad[ix] = Nullsv;
5043 assert(!CvCONST(cv));
5044 if (ps && !*ps && op_const_sv(block, cv))
5048 AV *av = newAV(); /* Will be @_ */
5050 av_store(PL_comppad, 0, (SV*)av);
5051 AvFLAGS(av) = AVf_REIFY;
5053 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5054 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
5056 if (!SvPADMY(PL_curpad[ix]))
5057 SvPADTMP_on(PL_curpad[ix]);
5061 /* If a potential closure prototype, don't keep a refcount on outer CV.
5062 * This is okay as the lifetime of the prototype is tied to the
5063 * lifetime of the outer CV. Avoids memory leak due to reference
5066 SvREFCNT_dec(CvOUTSIDE(cv));
5068 if (name || aname) {
5070 char *tname = (name ? name : aname);
5072 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5073 SV *sv = NEWSV(0,0);
5074 SV *tmpstr = sv_newmortal();
5075 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
5079 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5081 (long)PL_subline, (long)CopLINE(PL_curcop));
5082 gv_efullname3(tmpstr, gv, Nullch);
5083 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
5084 hv = GvHVn(db_postponed);
5085 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
5086 && (pcv = GvCV(db_postponed)))
5092 call_sv((SV*)pcv, G_DISCARD);
5096 if ((s = strrchr(tname,':')))
5101 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
5104 if (strEQ(s, "BEGIN")) {
5105 I32 oldscope = PL_scopestack_ix;
5107 SAVECOPFILE(&PL_compiling);
5108 SAVECOPLINE(&PL_compiling);
5111 PL_beginav = newAV();
5112 DEBUG_x( dump_sub(gv) );
5113 av_push(PL_beginav, (SV*)cv);
5114 GvCV(gv) = 0; /* cv has been hijacked */
5115 call_list(oldscope, PL_beginav);
5117 PL_curcop = &PL_compiling;
5118 PL_compiling.op_private = PL_hints;
5121 else if (strEQ(s, "END") && !PL_error_count) {
5124 DEBUG_x( dump_sub(gv) );
5125 av_unshift(PL_endav, 1);
5126 av_store(PL_endav, 0, (SV*)cv);
5127 GvCV(gv) = 0; /* cv has been hijacked */
5129 else if (strEQ(s, "CHECK") && !PL_error_count) {
5131 PL_checkav = newAV();
5132 DEBUG_x( dump_sub(gv) );
5133 if (PL_main_start && ckWARN(WARN_VOID))
5134 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
5135 av_unshift(PL_checkav, 1);
5136 av_store(PL_checkav, 0, (SV*)cv);
5137 GvCV(gv) = 0; /* cv has been hijacked */
5139 else if (strEQ(s, "INIT") && !PL_error_count) {
5141 PL_initav = newAV();
5142 DEBUG_x( dump_sub(gv) );
5143 if (PL_main_start && ckWARN(WARN_VOID))
5144 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
5145 av_push(PL_initav, (SV*)cv);
5146 GvCV(gv) = 0; /* cv has been hijacked */
5151 PL_copline = NOLINE;
5156 /* XXX unsafe for threads if eval_owner isn't held */
5158 =for apidoc newCONSTSUB
5160 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5161 eligible for inlining at compile-time.
5167 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
5173 SAVECOPLINE(PL_curcop);
5174 CopLINE_set(PL_curcop, PL_copline);
5177 PL_hints &= ~HINT_BLOCK_SCOPE;
5180 SAVESPTR(PL_curstash);
5181 SAVECOPSTASH(PL_curcop);
5182 PL_curstash = stash;
5183 CopSTASH_set(PL_curcop,stash);
5186 cv = newXS(name, const_sv_xsub, __FILE__);
5187 CvXSUBANY(cv).any_ptr = sv;
5189 sv_setpv((SV*)cv, ""); /* prototype is "" */
5197 =for apidoc U||newXS
5199 Used by C<xsubpp> to hook up XSUBs as Perl subs.
5205 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
5207 GV *gv = gv_fetchpv(name ? name :
5208 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5209 GV_ADDMULTI, SVt_PVCV);
5212 if ((cv = (name ? GvCV(gv) : Nullcv))) {
5214 /* just a cached method */
5218 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
5219 /* already defined (or promised) */
5220 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
5221 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
5222 line_t oldline = CopLINE(PL_curcop);
5223 if (PL_copline != NOLINE)
5224 CopLINE_set(PL_curcop, PL_copline);
5225 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5226 CvCONST(cv) ? "Constant subroutine %s redefined"
5227 : "Subroutine %s redefined"
5229 CopLINE_set(PL_curcop, oldline);
5236 if (cv) /* must reuse cv if autoloaded */
5239 cv = (CV*)NEWSV(1105,0);
5240 sv_upgrade((SV *)cv, SVt_PVCV);
5244 PL_sub_generation++;
5248 #ifdef USE_5005THREADS
5249 New(666, CvMUTEXP(cv), 1, perl_mutex);
5250 MUTEX_INIT(CvMUTEXP(cv));
5252 #endif /* USE_5005THREADS */
5253 (void)gv_fetchfile(filename);
5254 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
5255 an external constant string */
5256 CvXSUB(cv) = subaddr;
5259 char *s = strrchr(name,':');
5265 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
5268 if (strEQ(s, "BEGIN")) {
5270 PL_beginav = newAV();
5271 av_push(PL_beginav, (SV*)cv);
5272 GvCV(gv) = 0; /* cv has been hijacked */
5274 else if (strEQ(s, "END")) {
5277 av_unshift(PL_endav, 1);
5278 av_store(PL_endav, 0, (SV*)cv);
5279 GvCV(gv) = 0; /* cv has been hijacked */
5281 else if (strEQ(s, "CHECK")) {
5283 PL_checkav = newAV();
5284 if (PL_main_start && ckWARN(WARN_VOID))
5285 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
5286 av_unshift(PL_checkav, 1);
5287 av_store(PL_checkav, 0, (SV*)cv);
5288 GvCV(gv) = 0; /* cv has been hijacked */
5290 else if (strEQ(s, "INIT")) {
5292 PL_initav = newAV();
5293 if (PL_main_start && ckWARN(WARN_VOID))
5294 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
5295 av_push(PL_initav, (SV*)cv);
5296 GvCV(gv) = 0; /* cv has been hijacked */
5307 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
5316 name = SvPVx(cSVOPo->op_sv, n_a);
5319 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
5320 #ifdef GV_UNIQUE_CHECK
5322 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
5326 if ((cv = GvFORM(gv))) {
5327 if (ckWARN(WARN_REDEFINE)) {
5328 line_t oldline = CopLINE(PL_curcop);
5329 if (PL_copline != NOLINE)
5330 CopLINE_set(PL_curcop, PL_copline);
5331 Perl_warner(aTHX_ packWARN(WARN_REDEFINE), "Format %s redefined",name);
5332 CopLINE_set(PL_curcop, oldline);
5339 CvFILE_set_from_cop(cv, PL_curcop);
5341 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5342 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
5343 SvPADTMP_on(PL_curpad[ix]);
5346 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
5347 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5348 OpREFCNT_set(CvROOT(cv), 1);
5349 CvSTART(cv) = LINKLIST(CvROOT(cv));
5350 CvROOT(cv)->op_next = 0;
5351 CALL_PEEP(CvSTART(cv));
5353 PL_copline = NOLINE;
5358 Perl_newANONLIST(pTHX_ OP *o)
5360 return newUNOP(OP_REFGEN, 0,
5361 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
5365 Perl_newANONHASH(pTHX_ OP *o)
5367 return newUNOP(OP_REFGEN, 0,
5368 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
5372 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
5374 return newANONATTRSUB(floor, proto, Nullop, block);
5378 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
5380 return newUNOP(OP_REFGEN, 0,
5381 newSVOP(OP_ANONCODE, 0,
5382 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5386 Perl_oopsAV(pTHX_ OP *o)
5388 switch (o->op_type) {
5390 o->op_type = OP_PADAV;
5391 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5392 return ref(o, OP_RV2AV);
5395 o->op_type = OP_RV2AV;
5396 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5401 if (ckWARN_d(WARN_INTERNAL))
5402 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
5409 Perl_oopsHV(pTHX_ OP *o)
5411 switch (o->op_type) {
5414 o->op_type = OP_PADHV;
5415 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5416 return ref(o, OP_RV2HV);
5420 o->op_type = OP_RV2HV;
5421 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5426 if (ckWARN_d(WARN_INTERNAL))
5427 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
5434 Perl_newAVREF(pTHX_ OP *o)
5436 if (o->op_type == OP_PADANY) {
5437 o->op_type = OP_PADAV;
5438 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5441 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
5442 && ckWARN(WARN_DEPRECATED)) {
5443 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
5444 "Using an array as a reference is deprecated");
5446 return newUNOP(OP_RV2AV, 0, scalar(o));
5450 Perl_newGVREF(pTHX_ I32 type, OP *o)
5452 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5453 return newUNOP(OP_NULL, 0, o);
5454 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5458 Perl_newHVREF(pTHX_ OP *o)
5460 if (o->op_type == OP_PADANY) {
5461 o->op_type = OP_PADHV;
5462 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5465 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
5466 && ckWARN(WARN_DEPRECATED)) {
5467 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
5468 "Using a hash as a reference is deprecated");
5470 return newUNOP(OP_RV2HV, 0, scalar(o));
5474 Perl_oopsCV(pTHX_ OP *o)
5476 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5482 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5484 return newUNOP(OP_RV2CV, flags, scalar(o));
5488 Perl_newSVREF(pTHX_ OP *o)
5490 if (o->op_type == OP_PADANY) {
5491 o->op_type = OP_PADSV;
5492 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5495 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5496 o->op_flags |= OPpDONE_SVREF;
5499 return newUNOP(OP_RV2SV, 0, scalar(o));
5502 /* Check routines. */
5505 Perl_ck_anoncode(pTHX_ OP *o)
5510 name = NEWSV(1106,0);
5511 sv_upgrade(name, SVt_PVNV);
5512 sv_setpvn(name, "&", 1);
5515 ix = pad_alloc(o->op_type, SVs_PADMY);
5516 av_store(PL_comppad_name, ix, name);
5517 av_store(PL_comppad, ix, cSVOPo->op_sv);
5518 SvPADMY_on(cSVOPo->op_sv);
5519 cSVOPo->op_sv = Nullsv;
5520 cSVOPo->op_targ = ix;
5525 Perl_ck_bitop(pTHX_ OP *o)
5527 o->op_private = PL_hints;
5532 Perl_ck_concat(pTHX_ OP *o)
5534 if (cUNOPo->op_first->op_type == OP_CONCAT)
5535 o->op_flags |= OPf_STACKED;
5540 Perl_ck_spair(pTHX_ OP *o)
5542 if (o->op_flags & OPf_KIDS) {
5545 OPCODE type = o->op_type;
5546 o = modkids(ck_fun(o), type);
5547 kid = cUNOPo->op_first;
5548 newop = kUNOP->op_first->op_sibling;
5550 (newop->op_sibling ||
5551 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5552 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5553 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5557 op_free(kUNOP->op_first);
5558 kUNOP->op_first = newop;
5560 o->op_ppaddr = PL_ppaddr[++o->op_type];
5565 Perl_ck_delete(pTHX_ OP *o)
5569 if (o->op_flags & OPf_KIDS) {
5570 OP *kid = cUNOPo->op_first;
5571 switch (kid->op_type) {
5573 o->op_flags |= OPf_SPECIAL;
5576 o->op_private |= OPpSLICE;
5579 o->op_flags |= OPf_SPECIAL;
5584 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5593 Perl_ck_die(pTHX_ OP *o)
5596 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
5602 Perl_ck_eof(pTHX_ OP *o)
5604 I32 type = o->op_type;
5606 if (o->op_flags & OPf_KIDS) {
5607 if (cLISTOPo->op_first->op_type == OP_STUB) {
5609 o = newUNOP(type, OPf_SPECIAL,
5610 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5618 Perl_ck_eval(pTHX_ OP *o)
5620 PL_hints |= HINT_BLOCK_SCOPE;
5621 if (o->op_flags & OPf_KIDS) {
5622 SVOP *kid = (SVOP*)cUNOPo->op_first;
5625 o->op_flags &= ~OPf_KIDS;
5628 else if (kid->op_type == OP_LINESEQ) {
5631 kid->op_next = o->op_next;
5632 cUNOPo->op_first = 0;
5635 NewOp(1101, enter, 1, LOGOP);
5636 enter->op_type = OP_ENTERTRY;
5637 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5638 enter->op_private = 0;
5640 /* establish postfix order */
5641 enter->op_next = (OP*)enter;
5643 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5644 o->op_type = OP_LEAVETRY;
5645 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5646 enter->op_other = o;
5654 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5656 o->op_targ = (PADOFFSET)PL_hints;
5661 Perl_ck_exit(pTHX_ OP *o)
5664 HV *table = GvHV(PL_hintgv);
5666 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5667 if (svp && *svp && SvTRUE(*svp))
5668 o->op_private |= OPpEXIT_VMSISH;
5670 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
5676 Perl_ck_exec(pTHX_ OP *o)
5679 if (o->op_flags & OPf_STACKED) {
5681 kid = cUNOPo->op_first->op_sibling;
5682 if (kid->op_type == OP_RV2GV)
5691 Perl_ck_exists(pTHX_ OP *o)
5694 if (o->op_flags & OPf_KIDS) {
5695 OP *kid = cUNOPo->op_first;
5696 if (kid->op_type == OP_ENTERSUB) {
5697 (void) ref(kid, o->op_type);
5698 if (kid->op_type != OP_RV2CV && !PL_error_count)
5699 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5701 o->op_private |= OPpEXISTS_SUB;
5703 else if (kid->op_type == OP_AELEM)
5704 o->op_flags |= OPf_SPECIAL;
5705 else if (kid->op_type != OP_HELEM)
5706 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5715 Perl_ck_gvconst(pTHX_ register OP *o)
5717 o = fold_constants(o);
5718 if (o->op_type == OP_CONST)
5725 Perl_ck_rvconst(pTHX_ register OP *o)
5727 SVOP *kid = (SVOP*)cUNOPo->op_first;
5729 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5730 if (kid->op_type == OP_CONST) {
5734 SV *kidsv = kid->op_sv;
5737 /* Is it a constant from cv_const_sv()? */
5738 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5739 SV *rsv = SvRV(kidsv);
5740 int svtype = SvTYPE(rsv);
5741 char *badtype = Nullch;
5743 switch (o->op_type) {
5745 if (svtype > SVt_PVMG)
5746 badtype = "a SCALAR";
5749 if (svtype != SVt_PVAV)
5750 badtype = "an ARRAY";
5753 if (svtype != SVt_PVHV) {
5754 if (svtype == SVt_PVAV) { /* pseudohash? */
5755 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5756 if (ksv && SvROK(*ksv)
5757 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5766 if (svtype != SVt_PVCV)
5771 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5774 name = SvPV(kidsv, n_a);
5775 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5776 char *badthing = Nullch;
5777 switch (o->op_type) {
5779 badthing = "a SCALAR";
5782 badthing = "an ARRAY";
5785 badthing = "a HASH";
5790 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5794 * This is a little tricky. We only want to add the symbol if we
5795 * didn't add it in the lexer. Otherwise we get duplicate strict
5796 * warnings. But if we didn't add it in the lexer, we must at
5797 * least pretend like we wanted to add it even if it existed before,
5798 * or we get possible typo warnings. OPpCONST_ENTERED says
5799 * whether the lexer already added THIS instance of this symbol.
5801 iscv = (o->op_type == OP_RV2CV) * 2;
5803 gv = gv_fetchpv(name,
5804 iscv | !(kid->op_private & OPpCONST_ENTERED),
5807 : o->op_type == OP_RV2SV
5809 : o->op_type == OP_RV2AV
5811 : o->op_type == OP_RV2HV
5814 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5816 kid->op_type = OP_GV;
5817 SvREFCNT_dec(kid->op_sv);
5819 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5820 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5821 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5823 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5825 kid->op_sv = SvREFCNT_inc(gv);
5827 kid->op_private = 0;
5828 kid->op_ppaddr = PL_ppaddr[OP_GV];
5835 Perl_ck_ftst(pTHX_ OP *o)
5837 I32 type = o->op_type;
5839 if (o->op_flags & OPf_REF) {
5842 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5843 SVOP *kid = (SVOP*)cUNOPo->op_first;
5845 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5847 OP *newop = newGVOP(type, OPf_REF,
5848 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5855 if (type == OP_FTTTY)
5856 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5859 o = newUNOP(type, 0, newDEFSVOP());
5865 Perl_ck_fun(pTHX_ OP *o)
5871 int type = o->op_type;
5872 register I32 oa = PL_opargs[type] >> OASHIFT;
5874 if (o->op_flags & OPf_STACKED) {
5875 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5878 return no_fh_allowed(o);
5881 if (o->op_flags & OPf_KIDS) {
5883 tokid = &cLISTOPo->op_first;
5884 kid = cLISTOPo->op_first;
5885 if (kid->op_type == OP_PUSHMARK ||
5886 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5888 tokid = &kid->op_sibling;
5889 kid = kid->op_sibling;
5891 if (!kid && PL_opargs[type] & OA_DEFGV)
5892 *tokid = kid = newDEFSVOP();
5896 sibl = kid->op_sibling;
5899 /* list seen where single (scalar) arg expected? */
5900 if (numargs == 1 && !(oa >> 4)
5901 && kid->op_type == OP_LIST && type != OP_SCALAR)
5903 return too_many_arguments(o,PL_op_desc[type]);
5916 if ((type == OP_PUSH || type == OP_UNSHIFT)
5917 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
5918 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5919 "Useless use of %s with no values",
5922 if (kid->op_type == OP_CONST &&
5923 (kid->op_private & OPpCONST_BARE))
5925 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5926 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5927 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5928 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5929 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5930 "Array @%s missing the @ in argument %"IVdf" of %s()",
5931 name, (IV)numargs, PL_op_desc[type]);
5934 kid->op_sibling = sibl;
5937 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5938 bad_type(numargs, "array", PL_op_desc[type], kid);
5942 if (kid->op_type == OP_CONST &&
5943 (kid->op_private & OPpCONST_BARE))
5945 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5946 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5947 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5948 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5949 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5950 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5951 name, (IV)numargs, PL_op_desc[type]);
5954 kid->op_sibling = sibl;
5957 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5958 bad_type(numargs, "hash", PL_op_desc[type], kid);
5963 OP *newop = newUNOP(OP_NULL, 0, kid);
5964 kid->op_sibling = 0;
5966 newop->op_next = newop;
5968 kid->op_sibling = sibl;
5973 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5974 if (kid->op_type == OP_CONST &&
5975 (kid->op_private & OPpCONST_BARE))
5977 OP *newop = newGVOP(OP_GV, 0,
5978 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5980 if (!(o->op_private & 1) && /* if not unop */
5981 kid == cLISTOPo->op_last)
5982 cLISTOPo->op_last = newop;
5986 else if (kid->op_type == OP_READLINE) {
5987 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5988 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
5991 I32 flags = OPf_SPECIAL;
5995 /* is this op a FH constructor? */
5996 if (is_handle_constructor(o,numargs)) {
5997 char *name = Nullch;
6001 /* Set a flag to tell rv2gv to vivify
6002 * need to "prove" flag does not mean something
6003 * else already - NI-S 1999/05/07
6006 if (kid->op_type == OP_PADSV) {
6007 SV **namep = av_fetch(PL_comppad_name,
6009 if (namep && *namep)
6010 name = SvPV(*namep, len);
6012 else if (kid->op_type == OP_RV2SV
6013 && kUNOP->op_first->op_type == OP_GV)
6015 GV *gv = cGVOPx_gv(kUNOP->op_first);
6017 len = GvNAMELEN(gv);
6019 else if (kid->op_type == OP_AELEM
6020 || kid->op_type == OP_HELEM)
6022 name = "__ANONIO__";
6028 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
6029 namesv = PL_curpad[targ];
6030 (void)SvUPGRADE(namesv, SVt_PV);
6032 sv_setpvn(namesv, "$", 1);
6033 sv_catpvn(namesv, name, len);
6036 kid->op_sibling = 0;
6037 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
6038 kid->op_targ = targ;
6039 kid->op_private |= priv;
6041 kid->op_sibling = sibl;
6047 mod(scalar(kid), type);
6051 tokid = &kid->op_sibling;
6052 kid = kid->op_sibling;
6054 o->op_private |= numargs;
6056 return too_many_arguments(o,OP_DESC(o));
6059 else if (PL_opargs[type] & OA_DEFGV) {
6061 return newUNOP(type, 0, newDEFSVOP());
6065 while (oa & OA_OPTIONAL)
6067 if (oa && oa != OA_LIST)
6068 return too_few_arguments(o,OP_DESC(o));
6074 Perl_ck_glob(pTHX_ OP *o)
6079 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
6080 append_elem(OP_GLOB, o, newDEFSVOP());
6082 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV))
6083 && GvCVu(gv) && GvIMPORTED_CV(gv)))
6085 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
6088 #if !defined(PERL_EXTERNAL_GLOB)
6089 /* XXX this can be tightened up and made more failsafe. */
6093 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
6094 newSVpvn("File::Glob", 10), Nullsv, Nullsv, Nullsv);
6095 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
6096 glob_gv = gv_fetchpv("File::Glob::csh_glob", FALSE, SVt_PVCV);
6097 GvCV(gv) = GvCV(glob_gv);
6098 SvREFCNT_inc((SV*)GvCV(gv));
6099 GvIMPORTED_CV_on(gv);
6102 #endif /* PERL_EXTERNAL_GLOB */
6104 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
6105 append_elem(OP_GLOB, o,
6106 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
6107 o->op_type = OP_LIST;
6108 o->op_ppaddr = PL_ppaddr[OP_LIST];
6109 cLISTOPo->op_first->op_type = OP_PUSHMARK;
6110 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
6111 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
6112 append_elem(OP_LIST, o,
6113 scalar(newUNOP(OP_RV2CV, 0,
6114 newGVOP(OP_GV, 0, gv)))));
6115 o = newUNOP(OP_NULL, 0, ck_subr(o));
6116 o->op_targ = OP_GLOB; /* hint at what it used to be */
6119 gv = newGVgen("main");
6121 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
6127 Perl_ck_grep(pTHX_ OP *o)
6131 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
6133 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
6134 NewOp(1101, gwop, 1, LOGOP);
6136 if (o->op_flags & OPf_STACKED) {
6139 kid = cLISTOPo->op_first->op_sibling;
6140 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
6143 kid->op_next = (OP*)gwop;
6144 o->op_flags &= ~OPf_STACKED;
6146 kid = cLISTOPo->op_first->op_sibling;
6147 if (type == OP_MAPWHILE)
6154 kid = cLISTOPo->op_first->op_sibling;
6155 if (kid->op_type != OP_NULL)
6156 Perl_croak(aTHX_ "panic: ck_grep");
6157 kid = kUNOP->op_first;
6159 gwop->op_type = type;
6160 gwop->op_ppaddr = PL_ppaddr[type];
6161 gwop->op_first = listkids(o);
6162 gwop->op_flags |= OPf_KIDS;
6163 gwop->op_private = 1;
6164 gwop->op_other = LINKLIST(kid);
6165 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
6166 kid->op_next = (OP*)gwop;
6168 kid = cLISTOPo->op_first->op_sibling;
6169 if (!kid || !kid->op_sibling)
6170 return too_few_arguments(o,OP_DESC(o));
6171 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
6172 mod(kid, OP_GREPSTART);
6178 Perl_ck_index(pTHX_ OP *o)
6180 if (o->op_flags & OPf_KIDS) {
6181 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6183 kid = kid->op_sibling; /* get past "big" */
6184 if (kid && kid->op_type == OP_CONST)
6185 fbm_compile(((SVOP*)kid)->op_sv, 0);
6191 Perl_ck_lengthconst(pTHX_ OP *o)
6193 /* XXX length optimization goes here */
6198 Perl_ck_lfun(pTHX_ OP *o)
6200 OPCODE type = o->op_type;
6201 return modkids(ck_fun(o), type);
6205 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
6207 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
6208 switch (cUNOPo->op_first->op_type) {
6210 /* This is needed for
6211 if (defined %stash::)
6212 to work. Do not break Tk.
6214 break; /* Globals via GV can be undef */
6216 case OP_AASSIGN: /* Is this a good idea? */
6217 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6218 "defined(@array) is deprecated");
6219 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6220 "\t(Maybe you should just omit the defined()?)\n");
6223 /* This is needed for
6224 if (defined %stash::)
6225 to work. Do not break Tk.
6227 break; /* Globals via GV can be undef */
6229 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6230 "defined(%%hash) is deprecated");
6231 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6232 "\t(Maybe you should just omit the defined()?)\n");
6243 Perl_ck_rfun(pTHX_ OP *o)
6245 OPCODE type = o->op_type;
6246 return refkids(ck_fun(o), type);
6250 Perl_ck_listiob(pTHX_ OP *o)
6254 kid = cLISTOPo->op_first;
6257 kid = cLISTOPo->op_first;
6259 if (kid->op_type == OP_PUSHMARK)
6260 kid = kid->op_sibling;
6261 if (kid && o->op_flags & OPf_STACKED)
6262 kid = kid->op_sibling;
6263 else if (kid && !kid->op_sibling) { /* print HANDLE; */
6264 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
6265 o->op_flags |= OPf_STACKED; /* make it a filehandle */
6266 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
6267 cLISTOPo->op_first->op_sibling = kid;
6268 cLISTOPo->op_last = kid;
6269 kid = kid->op_sibling;
6274 append_elem(o->op_type, o, newDEFSVOP());
6280 Perl_ck_sassign(pTHX_ OP *o)
6282 OP *kid = cLISTOPo->op_first;
6283 /* has a disposable target? */
6284 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
6285 && !(kid->op_flags & OPf_STACKED)
6286 /* Cannot steal the second time! */
6287 && !(kid->op_private & OPpTARGET_MY))
6289 OP *kkid = kid->op_sibling;
6291 /* Can just relocate the target. */
6292 if (kkid && kkid->op_type == OP_PADSV
6293 && !(kkid->op_private & OPpLVAL_INTRO))
6295 kid->op_targ = kkid->op_targ;
6297 /* Now we do not need PADSV and SASSIGN. */
6298 kid->op_sibling = o->op_sibling; /* NULL */
6299 cLISTOPo->op_first = NULL;
6302 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
6310 Perl_ck_match(pTHX_ OP *o)
6312 o->op_private |= OPpRUNTIME;
6317 Perl_ck_method(pTHX_ OP *o)
6319 OP *kid = cUNOPo->op_first;
6320 if (kid->op_type == OP_CONST) {
6321 SV* sv = kSVOP->op_sv;
6322 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
6324 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
6325 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
6328 kSVOP->op_sv = Nullsv;
6330 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
6339 Perl_ck_null(pTHX_ OP *o)
6345 Perl_ck_open(pTHX_ OP *o)
6347 HV *table = GvHV(PL_hintgv);
6351 svp = hv_fetch(table, "open_IN", 7, FALSE);
6353 mode = mode_from_discipline(*svp);
6354 if (mode & O_BINARY)
6355 o->op_private |= OPpOPEN_IN_RAW;
6356 else if (mode & O_TEXT)
6357 o->op_private |= OPpOPEN_IN_CRLF;
6360 svp = hv_fetch(table, "open_OUT", 8, FALSE);
6362 mode = mode_from_discipline(*svp);
6363 if (mode & O_BINARY)
6364 o->op_private |= OPpOPEN_OUT_RAW;
6365 else if (mode & O_TEXT)
6366 o->op_private |= OPpOPEN_OUT_CRLF;
6369 if (o->op_type == OP_BACKTICK)
6375 Perl_ck_repeat(pTHX_ OP *o)
6377 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
6378 o->op_private |= OPpREPEAT_DOLIST;
6379 cBINOPo->op_first = force_list(cBINOPo->op_first);
6387 Perl_ck_require(pTHX_ OP *o)
6391 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6392 SVOP *kid = (SVOP*)cUNOPo->op_first;
6394 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6396 for (s = SvPVX(kid->op_sv); *s; s++) {
6397 if (*s == ':' && s[1] == ':') {
6399 Move(s+2, s+1, strlen(s+2)+1, char);
6400 --SvCUR(kid->op_sv);
6403 if (SvREADONLY(kid->op_sv)) {
6404 SvREADONLY_off(kid->op_sv);
6405 sv_catpvn(kid->op_sv, ".pm", 3);
6406 SvREADONLY_on(kid->op_sv);
6409 sv_catpvn(kid->op_sv, ".pm", 3);
6413 /* handle override, if any */
6414 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
6415 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
6416 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
6418 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
6419 OP *kid = cUNOPo->op_first;
6420 cUNOPo->op_first = 0;
6422 return ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
6423 append_elem(OP_LIST, kid,
6424 scalar(newUNOP(OP_RV2CV, 0,
6433 Perl_ck_return(pTHX_ OP *o)
6436 if (CvLVALUE(PL_compcv)) {
6437 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
6438 mod(kid, OP_LEAVESUBLV);
6445 Perl_ck_retarget(pTHX_ OP *o)
6447 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6454 Perl_ck_select(pTHX_ OP *o)
6457 if (o->op_flags & OPf_KIDS) {
6458 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6459 if (kid && kid->op_sibling) {
6460 o->op_type = OP_SSELECT;
6461 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6463 return fold_constants(o);
6467 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6468 if (kid && kid->op_type == OP_RV2GV)
6469 kid->op_private &= ~HINT_STRICT_REFS;
6474 Perl_ck_shift(pTHX_ OP *o)
6476 I32 type = o->op_type;
6478 if (!(o->op_flags & OPf_KIDS)) {
6482 #ifdef USE_5005THREADS
6483 if (!CvUNIQUE(PL_compcv)) {
6484 argop = newOP(OP_PADAV, OPf_REF);
6485 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6488 argop = newUNOP(OP_RV2AV, 0,
6489 scalar(newGVOP(OP_GV, 0,
6490 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6493 argop = newUNOP(OP_RV2AV, 0,
6494 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6495 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6496 #endif /* USE_5005THREADS */
6497 return newUNOP(type, 0, scalar(argop));
6499 return scalar(modkids(ck_fun(o), type));
6503 Perl_ck_sort(pTHX_ OP *o)
6507 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6509 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6510 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6512 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6514 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6516 if (kid->op_type == OP_SCOPE) {
6520 else if (kid->op_type == OP_LEAVE) {
6521 if (o->op_type == OP_SORT) {
6522 op_null(kid); /* wipe out leave */
6525 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6526 if (k->op_next == kid)
6528 /* don't descend into loops */
6529 else if (k->op_type == OP_ENTERLOOP
6530 || k->op_type == OP_ENTERITER)
6532 k = cLOOPx(k)->op_lastop;
6537 kid->op_next = 0; /* just disconnect the leave */
6538 k = kLISTOP->op_first;
6543 if (o->op_type == OP_SORT) {
6544 /* provide scalar context for comparison function/block */
6550 o->op_flags |= OPf_SPECIAL;
6552 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6555 firstkid = firstkid->op_sibling;
6558 /* provide list context for arguments */
6559 if (o->op_type == OP_SORT)
6566 S_simplify_sort(pTHX_ OP *o)
6568 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6572 if (!(o->op_flags & OPf_STACKED))
6574 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6575 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6576 kid = kUNOP->op_first; /* get past null */
6577 if (kid->op_type != OP_SCOPE)
6579 kid = kLISTOP->op_last; /* get past scope */
6580 switch(kid->op_type) {
6588 k = kid; /* remember this node*/
6589 if (kBINOP->op_first->op_type != OP_RV2SV)
6591 kid = kBINOP->op_first; /* get past cmp */
6592 if (kUNOP->op_first->op_type != OP_GV)
6594 kid = kUNOP->op_first; /* get past rv2sv */
6596 if (GvSTASH(gv) != PL_curstash)
6598 if (strEQ(GvNAME(gv), "a"))
6600 else if (strEQ(GvNAME(gv), "b"))
6604 kid = k; /* back to cmp */
6605 if (kBINOP->op_last->op_type != OP_RV2SV)
6607 kid = kBINOP->op_last; /* down to 2nd arg */
6608 if (kUNOP->op_first->op_type != OP_GV)
6610 kid = kUNOP->op_first; /* get past rv2sv */
6612 if (GvSTASH(gv) != PL_curstash
6614 ? strNE(GvNAME(gv), "a")
6615 : strNE(GvNAME(gv), "b")))
6617 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6619 o->op_private |= OPpSORT_REVERSE;
6620 if (k->op_type == OP_NCMP)
6621 o->op_private |= OPpSORT_NUMERIC;
6622 if (k->op_type == OP_I_NCMP)
6623 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6624 kid = cLISTOPo->op_first->op_sibling;
6625 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6626 op_free(kid); /* then delete it */
6630 Perl_ck_split(pTHX_ OP *o)
6634 if (o->op_flags & OPf_STACKED)
6635 return no_fh_allowed(o);
6637 kid = cLISTOPo->op_first;
6638 if (kid->op_type != OP_NULL)
6639 Perl_croak(aTHX_ "panic: ck_split");
6640 kid = kid->op_sibling;
6641 op_free(cLISTOPo->op_first);
6642 cLISTOPo->op_first = kid;
6644 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6645 cLISTOPo->op_last = kid; /* There was only one element previously */
6648 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6649 OP *sibl = kid->op_sibling;
6650 kid->op_sibling = 0;
6651 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6652 if (cLISTOPo->op_first == cLISTOPo->op_last)
6653 cLISTOPo->op_last = kid;
6654 cLISTOPo->op_first = kid;
6655 kid->op_sibling = sibl;
6658 kid->op_type = OP_PUSHRE;
6659 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6661 if (ckWARN(WARN_REGEXP) && ((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
6662 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
6663 "Use of /g modifier is meaningless in split");
6666 if (!kid->op_sibling)
6667 append_elem(OP_SPLIT, o, newDEFSVOP());
6669 kid = kid->op_sibling;
6672 if (!kid->op_sibling)
6673 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6675 kid = kid->op_sibling;
6678 if (kid->op_sibling)
6679 return too_many_arguments(o,OP_DESC(o));
6685 Perl_ck_join(pTHX_ OP *o)
6687 if (ckWARN(WARN_SYNTAX)) {
6688 OP *kid = cLISTOPo->op_first->op_sibling;
6689 if (kid && kid->op_type == OP_MATCH) {
6690 char *pmstr = "STRING";
6691 if (PM_GETRE(kPMOP))
6692 pmstr = PM_GETRE(kPMOP)->precomp;
6693 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6694 "/%s/ should probably be written as \"%s\"",
6702 Perl_ck_subr(pTHX_ OP *o)
6704 OP *prev = ((cUNOPo->op_first->op_sibling)
6705 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6706 OP *o2 = prev->op_sibling;
6713 I32 contextclass = 0;
6717 o->op_private |= OPpENTERSUB_HASTARG;
6718 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6719 if (cvop->op_type == OP_RV2CV) {
6721 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6722 op_null(cvop); /* disable rv2cv */
6723 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6724 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6725 GV *gv = cGVOPx_gv(tmpop);
6728 tmpop->op_private |= OPpEARLY_CV;
6729 else if (SvPOK(cv)) {
6730 namegv = CvANON(cv) ? gv : CvGV(cv);
6731 proto = SvPV((SV*)cv, n_a);
6735 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6736 if (o2->op_type == OP_CONST)
6737 o2->op_private &= ~OPpCONST_STRICT;
6738 else if (o2->op_type == OP_LIST) {
6739 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6740 if (o && o->op_type == OP_CONST)
6741 o->op_private &= ~OPpCONST_STRICT;
6744 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6745 if (PERLDB_SUB && PL_curstash != PL_debstash)
6746 o->op_private |= OPpENTERSUB_DB;
6747 while (o2 != cvop) {
6751 return too_many_arguments(o, gv_ename(namegv));
6769 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6771 arg == 1 ? "block or sub {}" : "sub {}",
6772 gv_ename(namegv), o2);
6775 /* '*' allows any scalar type, including bareword */
6778 if (o2->op_type == OP_RV2GV)
6779 goto wrapref; /* autoconvert GLOB -> GLOBref */
6780 else if (o2->op_type == OP_CONST)
6781 o2->op_private &= ~OPpCONST_STRICT;
6782 else if (o2->op_type == OP_ENTERSUB) {
6783 /* accidental subroutine, revert to bareword */
6784 OP *gvop = ((UNOP*)o2)->op_first;
6785 if (gvop && gvop->op_type == OP_NULL) {
6786 gvop = ((UNOP*)gvop)->op_first;
6788 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6791 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6792 (gvop = ((UNOP*)gvop)->op_first) &&
6793 gvop->op_type == OP_GV)
6795 GV *gv = cGVOPx_gv(gvop);
6796 OP *sibling = o2->op_sibling;
6797 SV *n = newSVpvn("",0);
6799 gv_fullname3(n, gv, "");
6800 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6801 sv_chop(n, SvPVX(n)+6);
6802 o2 = newSVOP(OP_CONST, 0, n);
6803 prev->op_sibling = o2;
6804 o2->op_sibling = sibling;
6820 if (contextclass++ == 0) {
6821 e = strchr(proto, ']');
6822 if (!e || e == proto)
6835 while (*--p != '[');
6836 bad_type(arg, Perl_form(aTHX_ "one of %s", p),
6837 gv_ename(namegv), o2);
6843 if (o2->op_type == OP_RV2GV)
6846 bad_type(arg, "symbol", gv_ename(namegv), o2);
6849 if (o2->op_type == OP_ENTERSUB)
6852 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6855 if (o2->op_type == OP_RV2SV ||
6856 o2->op_type == OP_PADSV ||
6857 o2->op_type == OP_HELEM ||
6858 o2->op_type == OP_AELEM ||
6859 o2->op_type == OP_THREADSV)
6862 bad_type(arg, "scalar", gv_ename(namegv), o2);
6865 if (o2->op_type == OP_RV2AV ||
6866 o2->op_type == OP_PADAV)
6869 bad_type(arg, "array", gv_ename(namegv), o2);
6872 if (o2->op_type == OP_RV2HV ||
6873 o2->op_type == OP_PADHV)
6876 bad_type(arg, "hash", gv_ename(namegv), o2);
6881 OP* sib = kid->op_sibling;
6882 kid->op_sibling = 0;
6883 o2 = newUNOP(OP_REFGEN, 0, kid);
6884 o2->op_sibling = sib;
6885 prev->op_sibling = o2;
6887 if (contextclass && e) {
6902 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6903 gv_ename(namegv), SvPV((SV*)cv, n_a));
6908 mod(o2, OP_ENTERSUB);
6910 o2 = o2->op_sibling;
6912 if (proto && !optional &&
6913 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6914 return too_few_arguments(o, gv_ename(namegv));
6919 Perl_ck_svconst(pTHX_ OP *o)
6921 SvREADONLY_on(cSVOPo->op_sv);
6926 Perl_ck_trunc(pTHX_ OP *o)
6928 if (o->op_flags & OPf_KIDS) {
6929 SVOP *kid = (SVOP*)cUNOPo->op_first;
6931 if (kid->op_type == OP_NULL)
6932 kid = (SVOP*)kid->op_sibling;
6933 if (kid && kid->op_type == OP_CONST &&
6934 (kid->op_private & OPpCONST_BARE))
6936 o->op_flags |= OPf_SPECIAL;
6937 kid->op_private &= ~OPpCONST_STRICT;
6944 Perl_ck_substr(pTHX_ OP *o)
6947 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6948 OP *kid = cLISTOPo->op_first;
6950 if (kid->op_type == OP_NULL)
6951 kid = kid->op_sibling;
6953 kid->op_flags |= OPf_MOD;
6959 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6962 Perl_peep(pTHX_ register OP *o)
6964 register OP* oldop = 0;
6967 if (!o || o->op_seq)
6971 SAVEVPTR(PL_curcop);
6972 for (; o; o = o->op_next) {
6978 switch (o->op_type) {
6982 PL_curcop = ((COP*)o); /* for warnings */
6983 o->op_seq = PL_op_seqmax++;
6987 if (cSVOPo->op_private & OPpCONST_STRICT)
6988 no_bareword_allowed(o);
6990 /* Relocate sv to the pad for thread safety.
6991 * Despite being a "constant", the SV is written to,
6992 * for reference counts, sv_upgrade() etc. */
6994 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6995 if (SvPADTMP(cSVOPo->op_sv)) {
6996 /* If op_sv is already a PADTMP then it is being used by
6997 * some pad, so make a copy. */
6998 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6999 SvREADONLY_on(PL_curpad[ix]);
7000 SvREFCNT_dec(cSVOPo->op_sv);
7003 SvREFCNT_dec(PL_curpad[ix]);
7004 SvPADTMP_on(cSVOPo->op_sv);
7005 PL_curpad[ix] = cSVOPo->op_sv;
7006 /* XXX I don't know how this isn't readonly already. */
7007 SvREADONLY_on(PL_curpad[ix]);
7009 cSVOPo->op_sv = Nullsv;
7013 o->op_seq = PL_op_seqmax++;
7017 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
7018 if (o->op_next->op_private & OPpTARGET_MY) {
7019 if (o->op_flags & OPf_STACKED) /* chained concats */
7020 goto ignore_optimization;
7022 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
7023 o->op_targ = o->op_next->op_targ;
7024 o->op_next->op_targ = 0;
7025 o->op_private |= OPpTARGET_MY;
7028 op_null(o->op_next);
7030 ignore_optimization:
7031 o->op_seq = PL_op_seqmax++;
7034 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
7035 o->op_seq = PL_op_seqmax++;
7036 break; /* Scalar stub must produce undef. List stub is noop */
7040 if (o->op_targ == OP_NEXTSTATE
7041 || o->op_targ == OP_DBSTATE
7042 || o->op_targ == OP_SETSTATE)
7044 PL_curcop = ((COP*)o);
7046 /* XXX: We avoid setting op_seq here to prevent later calls
7047 to peep() from mistakenly concluding that optimisation
7048 has already occurred. This doesn't fix the real problem,
7049 though (See 20010220.007). AMS 20010719 */
7050 if (oldop && o->op_next) {
7051 oldop->op_next = o->op_next;
7059 if (oldop && o->op_next) {
7060 oldop->op_next = o->op_next;
7063 o->op_seq = PL_op_seqmax++;
7067 if (o->op_next->op_type == OP_RV2SV) {
7068 if (!(o->op_next->op_private & OPpDEREF)) {
7069 op_null(o->op_next);
7070 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
7072 o->op_next = o->op_next->op_next;
7073 o->op_type = OP_GVSV;
7074 o->op_ppaddr = PL_ppaddr[OP_GVSV];
7077 else if (o->op_next->op_type == OP_RV2AV) {
7078 OP* pop = o->op_next->op_next;
7080 if (pop && pop->op_type == OP_CONST &&
7081 (PL_op = pop->op_next) &&
7082 pop->op_next->op_type == OP_AELEM &&
7083 !(pop->op_next->op_private &
7084 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
7085 (i = SvIV(((SVOP*)pop)->op_sv) - PL_curcop->cop_arybase)
7090 op_null(o->op_next);
7091 op_null(pop->op_next);
7093 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
7094 o->op_next = pop->op_next->op_next;
7095 o->op_type = OP_AELEMFAST;
7096 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
7097 o->op_private = (U8)i;
7102 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
7104 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
7105 /* XXX could check prototype here instead of just carping */
7106 SV *sv = sv_newmortal();
7107 gv_efullname3(sv, gv, Nullch);
7108 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
7109 "%s() called too early to check prototype",
7113 else if (o->op_next->op_type == OP_READLINE
7114 && o->op_next->op_next->op_type == OP_CONCAT
7115 && (o->op_next->op_next->op_flags & OPf_STACKED))
7117 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
7118 o->op_type = OP_RCATLINE;
7119 o->op_flags |= OPf_STACKED;
7120 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
7121 op_null(o->op_next->op_next);
7122 op_null(o->op_next);
7125 o->op_seq = PL_op_seqmax++;
7136 o->op_seq = PL_op_seqmax++;
7137 while (cLOGOP->op_other->op_type == OP_NULL)
7138 cLOGOP->op_other = cLOGOP->op_other->op_next;
7139 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
7144 o->op_seq = PL_op_seqmax++;
7145 while (cLOOP->op_redoop->op_type == OP_NULL)
7146 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
7147 peep(cLOOP->op_redoop);
7148 while (cLOOP->op_nextop->op_type == OP_NULL)
7149 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
7150 peep(cLOOP->op_nextop);
7151 while (cLOOP->op_lastop->op_type == OP_NULL)
7152 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
7153 peep(cLOOP->op_lastop);
7159 o->op_seq = PL_op_seqmax++;
7160 while (cPMOP->op_pmreplstart &&
7161 cPMOP->op_pmreplstart->op_type == OP_NULL)
7162 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
7163 peep(cPMOP->op_pmreplstart);
7167 o->op_seq = PL_op_seqmax++;
7168 if (ckWARN(WARN_SYNTAX) && o->op_next
7169 && o->op_next->op_type == OP_NEXTSTATE) {
7170 if (o->op_next->op_sibling &&
7171 o->op_next->op_sibling->op_type != OP_EXIT &&
7172 o->op_next->op_sibling->op_type != OP_WARN &&
7173 o->op_next->op_sibling->op_type != OP_DIE) {
7174 line_t oldline = CopLINE(PL_curcop);
7176 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
7177 Perl_warner(aTHX_ packWARN(WARN_EXEC),
7178 "Statement unlikely to be reached");
7179 Perl_warner(aTHX_ packWARN(WARN_EXEC),
7180 "\t(Maybe you meant system() when you said exec()?)\n");
7181 CopLINE_set(PL_curcop, oldline);
7190 SV **svp, **indsvp, *sv;
7195 o->op_seq = PL_op_seqmax++;
7197 if (((BINOP*)o)->op_last->op_type != OP_CONST)
7200 /* Make the CONST have a shared SV */
7201 svp = cSVOPx_svp(((BINOP*)o)->op_last);
7202 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
7203 key = SvPV(sv, keylen);
7204 lexname = newSVpvn_share(key,
7205 SvUTF8(sv) ? -(I32)keylen : keylen,
7211 if ((o->op_private & (OPpLVAL_INTRO)))
7214 rop = (UNOP*)((BINOP*)o)->op_first;
7215 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
7217 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
7218 if (!(SvFLAGS(lexname) & SVpad_TYPED))
7220 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
7221 if (!fields || !GvHV(*fields))
7223 key = SvPV(*svp, keylen);
7224 indsvp = hv_fetch(GvHV(*fields), key,
7225 SvUTF8(*svp) ? -(I32)keylen : keylen, FALSE);
7227 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
7228 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
7230 ind = SvIV(*indsvp);
7232 Perl_croak(aTHX_ "Bad index while coercing array into hash");
7233 rop->op_type = OP_RV2AV;
7234 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
7235 o->op_type = OP_AELEM;
7236 o->op_ppaddr = PL_ppaddr[OP_AELEM];
7238 if (SvREADONLY(*svp))
7240 SvFLAGS(sv) |= (SvFLAGS(*svp)
7241 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
7251 SV **svp, **indsvp, *sv;
7255 SVOP *first_key_op, *key_op;
7257 o->op_seq = PL_op_seqmax++;
7258 if ((o->op_private & (OPpLVAL_INTRO))
7259 /* I bet there's always a pushmark... */
7260 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
7261 /* hmmm, no optimization if list contains only one key. */
7263 rop = (UNOP*)((LISTOP*)o)->op_last;
7264 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
7266 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
7267 if (!(SvFLAGS(lexname) & SVpad_TYPED))
7269 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
7270 if (!fields || !GvHV(*fields))
7272 /* Again guessing that the pushmark can be jumped over.... */
7273 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
7274 ->op_first->op_sibling;
7275 /* Check that the key list contains only constants. */
7276 for (key_op = first_key_op; key_op;
7277 key_op = (SVOP*)key_op->op_sibling)
7278 if (key_op->op_type != OP_CONST)
7282 rop->op_type = OP_RV2AV;
7283 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
7284 o->op_type = OP_ASLICE;
7285 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
7286 for (key_op = first_key_op; key_op;
7287 key_op = (SVOP*)key_op->op_sibling) {
7288 svp = cSVOPx_svp(key_op);
7289 key = SvPV(*svp, keylen);
7290 indsvp = hv_fetch(GvHV(*fields), key,
7291 SvUTF8(*svp) ? -(I32)keylen : keylen, FALSE);
7293 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
7294 "in variable %s of type %s",
7295 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
7297 ind = SvIV(*indsvp);
7299 Perl_croak(aTHX_ "Bad index while coercing array into hash");
7301 if (SvREADONLY(*svp))
7303 SvFLAGS(sv) |= (SvFLAGS(*svp)
7304 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
7312 o->op_seq = PL_op_seqmax++;
7322 char* Perl_custom_op_name(pTHX_ OP* o)
7324 IV index = PTR2IV(o->op_ppaddr);
7328 if (!PL_custom_op_names) /* This probably shouldn't happen */
7329 return PL_op_name[OP_CUSTOM];
7331 keysv = sv_2mortal(newSViv(index));
7333 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
7335 return PL_op_name[OP_CUSTOM]; /* Don't know who you are */
7337 return SvPV_nolen(HeVAL(he));
7340 char* Perl_custom_op_desc(pTHX_ OP* o)
7342 IV index = PTR2IV(o->op_ppaddr);
7346 if (!PL_custom_op_descs)
7347 return PL_op_desc[OP_CUSTOM];
7349 keysv = sv_2mortal(newSViv(index));
7351 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
7353 return PL_op_desc[OP_CUSTOM];
7355 return SvPV_nolen(HeVAL(he));
7361 /* Efficient sub that returns a constant scalar value. */
7363 const_sv_xsub(pTHX_ CV* cv)
7368 Perl_croak(aTHX_ "usage: %s::%s()",
7369 HvNAME(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
7373 ST(0) = (SV*)XSANY.any_ptr;