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; (I32)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 &&
311 seq <= (U32)SvIVX(sv) &&
312 seq > (U32)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 &&
474 (seq <= (U32)SvIVX(sv) &&
475 seq > (U32)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 */
781 type = (OPCODE)o->op_targ;
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 = (U8)(PL_hints & HINT_PRIVATE_MASK);
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);
2550 o->op_type = (OPCODE)type;
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 = (OPCODE)type;
2668 listop->op_ppaddr = PL_ppaddr[type];
2671 listop->op_flags = (U8)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);
2699 o->op_type = (OPCODE)type;
2700 o->op_ppaddr = PL_ppaddr[type];
2701 o->op_flags = (U8)flags;
2704 o->op_private = (U8)(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 = (OPCODE)type;
2724 unop->op_ppaddr = PL_ppaddr[type];
2725 unop->op_first = first;
2726 unop->op_flags = flags | OPf_KIDS;
2727 unop->op_private = (U8)(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 = (OPCODE)type;
2745 binop->op_ppaddr = PL_ppaddr[type];
2746 binop->op_first = first;
2747 binop->op_flags = flags | OPf_KIDS;
2750 binop->op_private = (U8)(1 | (flags >> 8));
2753 binop->op_private = (U8)(2 | (flags >> 8));
2754 first->op_sibling = last;
2757 binop = (BINOP*)CHECKOP(type, binop);
2758 if (binop->op_next || binop->op_type != (OPCODE)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 < (I32)tlen; i++)
3020 for (i = 0, j = 0; i < 256; i++) {
3022 if (j >= (I32)rlen) {
3031 if (i < 128 && r[j] >= 128)
3041 o->op_private |= OPpTRANS_IDENTICAL;
3043 else if (j >= (I32)rlen)
3046 cPVOPo->op_pv = (char*)Renew(tbl, 0x101+rlen-j, short);
3047 tbl[0x100] = rlen - j;
3048 for (i=0; i < (I32)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 < (I32)tlen; i++,j++) {
3064 if (j >= (I32)rlen) {
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 = (OPCODE)type;
3094 pmop->op_ppaddr = PL_ppaddr[type];
3095 pmop->op_flags = (U8)flags;
3096 pmop->op_private = (U8)(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, (line_t)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 = (OPCODE)type;
3288 svop->op_ppaddr = PL_ppaddr[type];
3290 svop->op_next = (OP*)svop;
3291 svop->op_flags = (U8)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 = (OPCODE)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 = (U8)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 = (OPCODE)type;
3336 pvop->op_ppaddr = PL_ppaddr[type];
3338 pvop->op_next = (OP*)pvop;
3339 pvop->op_flags = (U8)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)
3380 if (id->op_type != OP_CONST)
3381 Perl_croak(aTHX_ "Module name must be constant");
3385 if (version != Nullop) {
3386 SV *vesv = ((SVOP*)version)->op_sv;
3388 if (arg == Nullop && !SvNIOKp(vesv)) {
3395 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3396 Perl_croak(aTHX_ "Version number must be constant number");
3398 /* Make copy of id so we don't free it twice */
3399 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3401 /* Fake up a method call to VERSION */
3402 meth = newSVpvn("VERSION",7);
3403 sv_upgrade(meth, SVt_PVIV);
3404 (void)SvIOK_on(meth);
3405 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3406 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3407 append_elem(OP_LIST,
3408 prepend_elem(OP_LIST, pack, list(version)),
3409 newSVOP(OP_METHOD_NAMED, 0, meth)));
3413 /* Fake up an import/unimport */
3414 if (arg && arg->op_type == OP_STUB)
3415 imop = arg; /* no import on explicit () */
3416 else if (SvNIOKp(((SVOP*)id)->op_sv)) {
3417 imop = Nullop; /* use 5.0; */
3422 /* Make copy of id so we don't free it twice */
3423 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3425 /* Fake up a method call to import/unimport */
3426 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);
3427 (void)SvUPGRADE(meth, SVt_PVIV);
3428 (void)SvIOK_on(meth);
3429 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
3430 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3431 append_elem(OP_LIST,
3432 prepend_elem(OP_LIST, pack, list(arg)),
3433 newSVOP(OP_METHOD_NAMED, 0, meth)));
3436 /* Fake up the BEGIN {}, which does its thing immediately. */
3438 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3441 append_elem(OP_LINESEQ,
3442 append_elem(OP_LINESEQ,
3443 newSTATEOP(0, Nullch, newUNOP(OP_REQUIRE, 0, id)),
3444 newSTATEOP(0, Nullch, veop)),
3445 newSTATEOP(0, Nullch, imop) ));
3447 /* The "did you use incorrect case?" warning used to be here.
3448 * The problem is that on case-insensitive filesystems one
3449 * might get false positives for "use" (and "require"):
3450 * "use Strict" or "require CARP" will work. This causes
3451 * portability problems for the script: in case-strict
3452 * filesystems the script will stop working.
3454 * The "incorrect case" warning checked whether "use Foo"
3455 * imported "Foo" to your namespace, but that is wrong, too:
3456 * there is no requirement nor promise in the language that
3457 * a Foo.pm should or would contain anything in package "Foo".
3459 * There is very little Configure-wise that can be done, either:
3460 * the case-sensitivity of the build filesystem of Perl does not
3461 * help in guessing the case-sensitivity of the runtime environment.
3464 PL_hints |= HINT_BLOCK_SCOPE;
3465 PL_copline = NOLINE;
3470 =head1 Embedding Functions
3472 =for apidoc load_module
3474 Loads the module whose name is pointed to by the string part of name.
3475 Note that the actual module name, not its filename, should be given.
3476 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3477 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3478 (or 0 for no flags). ver, if specified, provides version semantics
3479 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3480 arguments can be used to specify arguments to the module's import()
3481 method, similar to C<use Foo::Bar VERSION LIST>.
3486 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3489 va_start(args, ver);
3490 vload_module(flags, name, ver, &args);
3494 #ifdef PERL_IMPLICIT_CONTEXT
3496 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3500 va_start(args, ver);
3501 vload_module(flags, name, ver, &args);
3507 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3509 OP *modname, *veop, *imop;
3511 modname = newSVOP(OP_CONST, 0, name);
3512 modname->op_private |= OPpCONST_BARE;
3514 veop = newSVOP(OP_CONST, 0, ver);
3518 if (flags & PERL_LOADMOD_NOIMPORT) {
3519 imop = sawparens(newNULLLIST());
3521 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3522 imop = va_arg(*args, OP*);
3527 sv = va_arg(*args, SV*);
3529 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3530 sv = va_arg(*args, SV*);
3534 line_t ocopline = PL_copline;
3535 int oexpect = PL_expect;
3537 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3538 veop, modname, imop);
3539 PL_expect = oexpect;
3540 PL_copline = ocopline;
3545 Perl_dofile(pTHX_ OP *term)
3550 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3551 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
3552 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3554 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
3555 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3556 append_elem(OP_LIST, term,
3557 scalar(newUNOP(OP_RV2CV, 0,
3562 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3568 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3570 return newBINOP(OP_LSLICE, flags,
3571 list(force_list(subscript)),
3572 list(force_list(listval)) );
3576 S_list_assignment(pTHX_ register OP *o)
3581 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3582 o = cUNOPo->op_first;
3584 if (o->op_type == OP_COND_EXPR) {
3585 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3586 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3591 yyerror("Assignment to both a list and a scalar");
3595 if (o->op_type == OP_LIST &&
3596 (o->op_flags & OPf_WANT) == OPf_WANT_SCALAR &&
3597 o->op_private & OPpLVAL_INTRO)
3600 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3601 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3602 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3605 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3608 if (o->op_type == OP_RV2SV)
3615 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3620 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3621 return newLOGOP(optype, 0,
3622 mod(scalar(left), optype),
3623 newUNOP(OP_SASSIGN, 0, scalar(right)));
3626 return newBINOP(optype, OPf_STACKED,
3627 mod(scalar(left), optype), scalar(right));
3631 if (list_assignment(left)) {
3635 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3636 left = mod(left, OP_AASSIGN);
3644 curop = list(force_list(left));
3645 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3646 o->op_private = (U8)(0 | (flags >> 8));
3647 for (curop = ((LISTOP*)curop)->op_first;
3648 curop; curop = curop->op_sibling)
3650 if (curop->op_type == OP_RV2HV &&
3651 ((UNOP*)curop)->op_first->op_type != OP_GV) {
3652 o->op_private |= OPpASSIGN_HASH;
3656 if (!(left->op_private & OPpLVAL_INTRO)) {
3659 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3660 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3661 if (curop->op_type == OP_GV) {
3662 GV *gv = cGVOPx_gv(curop);
3663 if (gv == PL_defgv || (int)SvCUR(gv) == PL_generation)
3665 SvCUR(gv) = PL_generation;
3667 else if (curop->op_type == OP_PADSV ||
3668 curop->op_type == OP_PADAV ||
3669 curop->op_type == OP_PADHV ||
3670 curop->op_type == OP_PADANY) {
3671 SV **svp = AvARRAY(PL_comppad_name);
3672 SV *sv = svp[curop->op_targ];
3673 if ((int)SvCUR(sv) == PL_generation)
3675 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3677 else if (curop->op_type == OP_RV2CV)
3679 else if (curop->op_type == OP_RV2SV ||
3680 curop->op_type == OP_RV2AV ||
3681 curop->op_type == OP_RV2HV ||
3682 curop->op_type == OP_RV2GV) {
3683 if (lastop->op_type != OP_GV) /* funny deref? */
3686 else if (curop->op_type == OP_PUSHRE) {
3687 if (((PMOP*)curop)->op_pmreplroot) {
3689 GV *gv = (GV*)PL_curpad[INT2PTR(PADOFFSET,((PMOP*)curop)->op_pmreplroot)];
3691 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3693 if (gv == PL_defgv || (int)SvCUR(gv) == PL_generation)
3695 SvCUR(gv) = PL_generation;
3704 o->op_private |= OPpASSIGN_COMMON;
3706 if (right && right->op_type == OP_SPLIT) {
3708 if ((tmpop = ((LISTOP*)right)->op_first) &&
3709 tmpop->op_type == OP_PUSHRE)
3711 PMOP *pm = (PMOP*)tmpop;
3712 if (left->op_type == OP_RV2AV &&
3713 !(left->op_private & OPpLVAL_INTRO) &&
3714 !(o->op_private & OPpASSIGN_COMMON) )
3716 tmpop = ((UNOP*)left)->op_first;
3717 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3719 pm->op_pmreplroot = INT2PTR(OP*, cPADOPx(tmpop)->op_padix);
3720 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3722 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3723 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3725 pm->op_pmflags |= PMf_ONCE;
3726 tmpop = cUNOPo->op_first; /* to list (nulled) */
3727 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3728 tmpop->op_sibling = Nullop; /* don't free split */
3729 right->op_next = tmpop->op_next; /* fix starting loc */
3730 op_free(o); /* blow off assign */
3731 right->op_flags &= ~OPf_WANT;
3732 /* "I don't know and I don't care." */
3737 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
3738 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3740 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3742 sv_setiv(sv, PL_modcount+1);
3750 right = newOP(OP_UNDEF, 0);
3751 if (right->op_type == OP_READLINE) {
3752 right->op_flags |= OPf_STACKED;
3753 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3756 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3757 o = newBINOP(OP_SASSIGN, flags,
3758 scalar(right), mod(scalar(left), OP_SASSIGN) );
3770 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3772 U32 seq = intro_my();
3775 NewOp(1101, cop, 1, COP);
3776 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3777 cop->op_type = OP_DBSTATE;
3778 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3781 cop->op_type = OP_NEXTSTATE;
3782 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3784 cop->op_flags = (U8)flags;
3785 cop->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
3787 cop->op_private |= NATIVE_HINTS;
3789 PL_compiling.op_private = cop->op_private;
3790 cop->op_next = (OP*)cop;
3793 cop->cop_label = label;
3794 PL_hints |= HINT_BLOCK_SCOPE;
3797 cop->cop_arybase = PL_curcop->cop_arybase;
3798 if (specialWARN(PL_curcop->cop_warnings))
3799 cop->cop_warnings = PL_curcop->cop_warnings ;
3801 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3802 if (specialCopIO(PL_curcop->cop_io))
3803 cop->cop_io = PL_curcop->cop_io;
3805 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3808 if (PL_copline == NOLINE)
3809 CopLINE_set(cop, CopLINE(PL_curcop));
3811 CopLINE_set(cop, PL_copline);
3812 PL_copline = NOLINE;
3815 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3817 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3819 CopSTASH_set(cop, PL_curstash);
3821 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3822 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3823 if (svp && *svp != &PL_sv_undef ) {
3824 (void)SvIOK_on(*svp);
3825 SvIVX(*svp) = PTR2IV(cop);
3829 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3832 /* "Introduce" my variables to visible status. */
3840 if (! PL_min_intro_pending)
3841 return PL_cop_seqmax;
3843 svp = AvARRAY(PL_comppad_name);
3844 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3845 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3846 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3847 SvNVX(sv) = (NV)PL_cop_seqmax;
3850 PL_min_intro_pending = 0;
3851 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3852 return PL_cop_seqmax++;
3856 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3858 return new_logop(type, flags, &first, &other);
3862 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3866 OP *first = *firstp;
3867 OP *other = *otherp;
3869 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3870 return newBINOP(type, flags, scalar(first), scalar(other));
3872 scalarboolean(first);
3873 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3874 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3875 if (type == OP_AND || type == OP_OR) {
3881 first = *firstp = cUNOPo->op_first;
3883 first->op_next = o->op_next;
3884 cUNOPo->op_first = Nullop;
3888 if (first->op_type == OP_CONST) {
3889 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3890 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
3891 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3902 else if (first->op_type == OP_WANTARRAY) {
3903 /* XXX true only if this result will be returned, else should
3904 propagate outer context */
3910 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3911 OP *k1 = ((UNOP*)first)->op_first;
3912 OP *k2 = k1->op_sibling;
3914 switch (first->op_type)
3917 if (k2 && k2->op_type == OP_READLINE
3918 && (k2->op_flags & OPf_STACKED)
3919 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3921 warnop = k2->op_type;
3926 if (k1->op_type == OP_READDIR
3927 || k1->op_type == OP_GLOB
3928 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3929 || k1->op_type == OP_EACH)
3931 warnop = ((k1->op_type == OP_NULL)
3932 ? (OPCODE)k1->op_targ : k1->op_type);
3937 line_t oldline = CopLINE(PL_curcop);
3938 CopLINE_set(PL_curcop, PL_copline);
3939 Perl_warner(aTHX_ packWARN(WARN_MISC),
3940 "Value of %s%s can be \"0\"; test with defined()",
3942 ((warnop == OP_READLINE || warnop == OP_GLOB)
3943 ? " construct" : "() operator"));
3944 CopLINE_set(PL_curcop, oldline);
3951 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3952 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3954 NewOp(1101, logop, 1, LOGOP);
3956 logop->op_type = (OPCODE)type;
3957 logop->op_ppaddr = PL_ppaddr[type];
3958 logop->op_first = first;
3959 logop->op_flags = flags | OPf_KIDS;
3960 logop->op_other = LINKLIST(other);
3961 logop->op_private = (U8)(1 | (flags >> 8));
3963 /* establish postfix order */
3964 logop->op_next = LINKLIST(first);
3965 first->op_next = (OP*)logop;
3966 first->op_sibling = other;
3968 o = newUNOP(OP_NULL, 0, (OP*)logop);
3975 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3982 return newLOGOP(OP_AND, 0, first, trueop);
3984 return newLOGOP(OP_OR, 0, first, falseop);
3986 scalarboolean(first);
3987 if (first->op_type == OP_CONST) {
3988 if (SvTRUE(((SVOP*)first)->op_sv)) {
3999 else if (first->op_type == OP_WANTARRAY) {
4000 /* XXX true only if this result will be returned, else should
4001 propagate outer context */
4005 NewOp(1101, logop, 1, LOGOP);
4006 logop->op_type = OP_COND_EXPR;
4007 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4008 logop->op_first = first;
4009 logop->op_flags = flags | OPf_KIDS;
4010 logop->op_private = (U8)(1 | (flags >> 8));
4011 logop->op_other = LINKLIST(trueop);
4012 logop->op_next = LINKLIST(falseop);
4015 /* establish postfix order */
4016 start = LINKLIST(first);
4017 first->op_next = (OP*)logop;
4019 first->op_sibling = trueop;
4020 trueop->op_sibling = falseop;
4021 o = newUNOP(OP_NULL, 0, (OP*)logop);
4023 trueop->op_next = falseop->op_next = o;
4030 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4038 NewOp(1101, range, 1, LOGOP);
4040 range->op_type = OP_RANGE;
4041 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4042 range->op_first = left;
4043 range->op_flags = OPf_KIDS;
4044 leftstart = LINKLIST(left);
4045 range->op_other = LINKLIST(right);
4046 range->op_private = (U8)(1 | (flags >> 8));
4048 left->op_sibling = right;
4050 range->op_next = (OP*)range;
4051 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4052 flop = newUNOP(OP_FLOP, 0, flip);
4053 o = newUNOP(OP_NULL, 0, flop);
4055 range->op_next = leftstart;
4057 left->op_next = flip;
4058 right->op_next = flop;
4060 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4061 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4062 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4063 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4065 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4066 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4069 if (!flip->op_private || !flop->op_private)
4070 linklist(o); /* blow off optimizer unless constant */
4076 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4080 int once = block && block->op_flags & OPf_SPECIAL &&
4081 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4084 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4085 return block; /* do {} while 0 does once */
4086 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4087 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4088 expr = newUNOP(OP_DEFINED, 0,
4089 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4090 } else if (expr->op_flags & OPf_KIDS) {
4091 OP *k1 = ((UNOP*)expr)->op_first;
4092 OP *k2 = (k1) ? k1->op_sibling : NULL;
4093 switch (expr->op_type) {
4095 if (k2 && k2->op_type == OP_READLINE
4096 && (k2->op_flags & OPf_STACKED)
4097 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4098 expr = newUNOP(OP_DEFINED, 0, expr);
4102 if (k1->op_type == OP_READDIR
4103 || k1->op_type == OP_GLOB
4104 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4105 || k1->op_type == OP_EACH)
4106 expr = newUNOP(OP_DEFINED, 0, expr);
4112 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4113 o = new_logop(OP_AND, 0, &expr, &listop);
4116 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4118 if (once && o != listop)
4119 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4122 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4124 o->op_flags |= flags;
4126 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4131 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
4139 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4140 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
4141 expr = newUNOP(OP_DEFINED, 0,
4142 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4143 } else if (expr && (expr->op_flags & OPf_KIDS)) {
4144 OP *k1 = ((UNOP*)expr)->op_first;
4145 OP *k2 = (k1) ? k1->op_sibling : NULL;
4146 switch (expr->op_type) {
4148 if (k2 && k2->op_type == OP_READLINE
4149 && (k2->op_flags & OPf_STACKED)
4150 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4151 expr = newUNOP(OP_DEFINED, 0, expr);
4155 if (k1->op_type == OP_READDIR
4156 || k1->op_type == OP_GLOB
4157 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4158 || k1->op_type == OP_EACH)
4159 expr = newUNOP(OP_DEFINED, 0, expr);
4165 block = newOP(OP_NULL, 0);
4167 block = scope(block);
4171 next = LINKLIST(cont);
4174 OP *unstack = newOP(OP_UNSTACK, 0);
4177 cont = append_elem(OP_LINESEQ, cont, unstack);
4178 if ((line_t)whileline != NOLINE) {
4179 PL_copline = (line_t)whileline;
4180 cont = append_elem(OP_LINESEQ, cont,
4181 newSTATEOP(0, Nullch, Nullop));
4185 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4186 redo = LINKLIST(listop);
4189 PL_copline = (line_t)whileline;
4191 o = new_logop(OP_AND, 0, &expr, &listop);
4192 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4193 op_free(expr); /* oops, it's a while (0) */
4195 return Nullop; /* listop already freed by new_logop */
4198 ((LISTOP*)listop)->op_last->op_next =
4199 (o == listop ? redo : LINKLIST(o));
4205 NewOp(1101,loop,1,LOOP);
4206 loop->op_type = OP_ENTERLOOP;
4207 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4208 loop->op_private = 0;
4209 loop->op_next = (OP*)loop;
4212 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4214 loop->op_redoop = redo;
4215 loop->op_lastop = o;
4216 o->op_private |= loopflags;
4219 loop->op_nextop = next;
4221 loop->op_nextop = o;
4223 o->op_flags |= flags;
4224 o->op_private |= (flags >> 8);
4229 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
4233 PADOFFSET padoff = 0;
4237 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4238 sv->op_type = OP_RV2GV;
4239 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4241 else if (sv->op_type == OP_PADSV) { /* private variable */
4242 padoff = sv->op_targ;
4247 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
4248 padoff = sv->op_targ;
4250 iterflags |= OPf_SPECIAL;
4255 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4258 #ifdef USE_5005THREADS
4259 padoff = find_threadsv("_");
4260 iterflags |= OPf_SPECIAL;
4262 sv = newGVOP(OP_GV, 0, PL_defgv);
4265 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4266 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4267 iterflags |= OPf_STACKED;
4269 else if (expr->op_type == OP_NULL &&
4270 (expr->op_flags & OPf_KIDS) &&
4271 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4273 /* Basically turn for($x..$y) into the same as for($x,$y), but we
4274 * set the STACKED flag to indicate that these values are to be
4275 * treated as min/max values by 'pp_iterinit'.
4277 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
4278 LOGOP* range = (LOGOP*) flip->op_first;
4279 OP* left = range->op_first;
4280 OP* right = left->op_sibling;
4283 range->op_flags &= ~OPf_KIDS;
4284 range->op_first = Nullop;
4286 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
4287 listop->op_first->op_next = range->op_next;
4288 left->op_next = range->op_other;
4289 right->op_next = (OP*)listop;
4290 listop->op_next = listop->op_first;
4293 expr = (OP*)(listop);
4295 iterflags |= OPf_STACKED;
4298 expr = mod(force_list(expr), OP_GREPSTART);
4302 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
4303 append_elem(OP_LIST, expr, scalar(sv))));
4304 assert(!loop->op_next);
4305 #ifdef PL_OP_SLAB_ALLOC
4308 NewOp(1234,tmp,1,LOOP);
4309 Copy(loop,tmp,1,LOOP);
4314 Renew(loop, 1, LOOP);
4316 loop->op_targ = padoff;
4317 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
4318 PL_copline = forline;
4319 return newSTATEOP(0, label, wop);
4323 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
4328 if (type != OP_GOTO || label->op_type == OP_CONST) {
4329 /* "last()" means "last" */
4330 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
4331 o = newOP(type, OPf_SPECIAL);
4333 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
4334 ? SvPVx(((SVOP*)label)->op_sv, n_a)
4340 if (label->op_type == OP_ENTERSUB)
4341 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
4342 o = newUNOP(type, OPf_STACKED, label);
4344 PL_hints |= HINT_BLOCK_SCOPE;
4349 Perl_cv_undef(pTHX_ CV *cv)
4351 #ifdef USE_5005THREADS
4353 MUTEX_DESTROY(CvMUTEXP(cv));
4354 Safefree(CvMUTEXP(cv));
4357 #endif /* USE_5005THREADS */
4360 if (CvFILE(cv) && !CvXSUB(cv)) {
4361 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
4362 Safefree(CvFILE(cv));
4367 if (!CvXSUB(cv) && CvROOT(cv)) {
4368 #ifdef USE_5005THREADS
4369 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
4370 Perl_croak(aTHX_ "Can't undef active subroutine");
4373 Perl_croak(aTHX_ "Can't undef active subroutine");
4374 #endif /* USE_5005THREADS */
4377 SAVEVPTR(PL_curpad);
4380 op_free(CvROOT(cv));
4381 CvROOT(cv) = Nullop;
4384 SvPOK_off((SV*)cv); /* forget prototype */
4386 /* Since closure prototypes have the same lifetime as the containing
4387 * CV, they don't hold a refcount on the outside CV. This avoids
4388 * the refcount loop between the outer CV (which keeps a refcount to
4389 * the closure prototype in the pad entry for pp_anoncode()) and the
4390 * closure prototype, and the ensuing memory leak. --GSAR */
4391 if (!CvANON(cv) || CvCLONED(cv))
4392 SvREFCNT_dec(CvOUTSIDE(cv));
4393 CvOUTSIDE(cv) = Nullcv;
4395 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
4398 if (CvPADLIST(cv)) {
4399 /* may be during global destruction */
4400 if (SvREFCNT(CvPADLIST(cv))) {
4401 I32 i = AvFILLp(CvPADLIST(cv));
4403 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
4404 SV* sv = svp ? *svp : Nullsv;
4407 if (sv == (SV*)PL_comppad_name)
4408 PL_comppad_name = Nullav;
4409 else if (sv == (SV*)PL_comppad) {
4410 PL_comppad = Nullav;
4411 PL_curpad = Null(SV**);
4415 SvREFCNT_dec((SV*)CvPADLIST(cv));
4417 CvPADLIST(cv) = Nullav;
4425 #ifdef DEBUG_CLOSURES
4427 S_cv_dump(pTHX_ CV *cv)
4430 CV *outside = CvOUTSIDE(cv);
4431 AV* padlist = CvPADLIST(cv);
4438 PerlIO_printf(Perl_debug_log,
4439 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
4441 (CvANON(cv) ? "ANON"
4442 : (cv == PL_main_cv) ? "MAIN"
4443 : CvUNIQUE(cv) ? "UNIQUE"
4444 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
4447 : CvANON(outside) ? "ANON"
4448 : (outside == PL_main_cv) ? "MAIN"
4449 : CvUNIQUE(outside) ? "UNIQUE"
4450 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
4455 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
4456 pad = (AV*)*av_fetch(padlist, 1, FALSE);
4457 pname = AvARRAY(pad_name);
4458 ppad = AvARRAY(pad);
4460 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
4461 if (SvPOK(pname[ix]))
4462 PerlIO_printf(Perl_debug_log,
4463 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
4464 (int)ix, PTR2UV(ppad[ix]),
4465 SvFAKE(pname[ix]) ? "FAKE " : "",
4467 (IV)I_32(SvNVX(pname[ix])),
4470 #endif /* DEBUGGING */
4472 #endif /* DEBUG_CLOSURES */
4475 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4479 AV* protopadlist = CvPADLIST(proto);
4480 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4481 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4482 SV** pname = AvARRAY(protopad_name);
4483 SV** ppad = AvARRAY(protopad);
4484 I32 fname = AvFILLp(protopad_name);
4485 I32 fpad = AvFILLp(protopad);
4489 assert(!CvUNIQUE(proto));
4493 SAVESPTR(PL_comppad_name);
4494 SAVESPTR(PL_compcv);
4496 cv = PL_compcv = (CV*)NEWSV(1104,0);
4497 sv_upgrade((SV *)cv, SvTYPE(proto));
4498 CvFLAGS(cv) = CvFLAGS(proto) & ~CVf_CLONE;
4501 #ifdef USE_5005THREADS
4502 New(666, CvMUTEXP(cv), 1, perl_mutex);
4503 MUTEX_INIT(CvMUTEXP(cv));
4505 #endif /* USE_5005THREADS */
4507 CvFILE(cv) = CvXSUB(proto) ? CvFILE(proto)
4508 : savepv(CvFILE(proto));
4510 CvFILE(cv) = CvFILE(proto);
4512 CvGV(cv) = CvGV(proto);
4513 CvSTASH(cv) = CvSTASH(proto);
4514 CvROOT(cv) = OpREFCNT_inc(CvROOT(proto));
4515 CvSTART(cv) = CvSTART(proto);
4517 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4520 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4522 PL_comppad_name = newAV();
4523 for (ix = fname; ix >= 0; ix--)
4524 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4526 PL_comppad = newAV();
4528 comppadlist = newAV();
4529 AvREAL_off(comppadlist);
4530 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4531 av_store(comppadlist, 1, (SV*)PL_comppad);
4532 CvPADLIST(cv) = comppadlist;
4533 av_fill(PL_comppad, AvFILLp(protopad));
4534 PL_curpad = AvARRAY(PL_comppad);
4536 av = newAV(); /* will be @_ */
4538 av_store(PL_comppad, 0, (SV*)av);
4539 AvFLAGS(av) = AVf_REIFY;
4541 for (ix = fpad; ix > 0; ix--) {
4542 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4543 if (namesv && namesv != &PL_sv_undef) {
4544 char *name = SvPVX(namesv); /* XXX */
4545 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4546 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4547 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4549 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4551 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4553 else { /* our own lexical */
4556 /* anon code -- we'll come back for it */
4557 sv = SvREFCNT_inc(ppad[ix]);
4559 else if (*name == '@')
4561 else if (*name == '%')
4570 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4571 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4574 SV* sv = NEWSV(0,0);
4580 /* Now that vars are all in place, clone nested closures. */
4582 for (ix = fpad; ix > 0; ix--) {
4583 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4585 && namesv != &PL_sv_undef
4586 && !(SvFLAGS(namesv) & SVf_FAKE)
4587 && *SvPVX(namesv) == '&'
4588 && CvCLONE(ppad[ix]))
4590 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4591 SvREFCNT_dec(ppad[ix]);
4594 PL_curpad[ix] = (SV*)kid;
4598 #ifdef DEBUG_CLOSURES
4599 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4601 PerlIO_printf(Perl_debug_log, " from:\n");
4603 PerlIO_printf(Perl_debug_log, " to:\n");
4610 SV* const_sv = op_const_sv(CvSTART(cv), cv);
4612 /* constant sub () { $x } closing over $x - see lib/constant.pm */
4614 cv = newCONSTSUB(CvSTASH(proto), 0, const_sv);
4621 Perl_cv_clone(pTHX_ CV *proto)
4624 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4625 cv = cv_clone2(proto, CvOUTSIDE(proto));
4626 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4631 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4633 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
4634 SV* msg = sv_newmortal();
4638 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4639 sv_setpv(msg, "Prototype mismatch:");
4641 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
4643 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4644 sv_catpv(msg, " vs ");
4646 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4648 sv_catpv(msg, "none");
4649 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, msg);
4653 static void const_sv_xsub(pTHX_ CV* cv);
4657 =head1 Optree Manipulation Functions
4659 =for apidoc cv_const_sv
4661 If C<cv> is a constant sub eligible for inlining. returns the constant
4662 value returned by the sub. Otherwise, returns NULL.
4664 Constant subs can be created with C<newCONSTSUB> or as described in
4665 L<perlsub/"Constant Functions">.
4670 Perl_cv_const_sv(pTHX_ CV *cv)
4672 if (!cv || !CvCONST(cv))
4674 return (SV*)CvXSUBANY(cv).any_ptr;
4678 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4685 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4686 o = cLISTOPo->op_first->op_sibling;
4688 for (; o; o = o->op_next) {
4689 OPCODE type = o->op_type;
4691 if (sv && o->op_next == o)
4693 if (o->op_next != o) {
4694 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4696 if (type == OP_DBSTATE)
4699 if (type == OP_LEAVESUB || type == OP_RETURN)
4703 if (type == OP_CONST && cSVOPo->op_sv)
4705 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4706 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4707 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4711 /* We get here only from cv_clone2() while creating a closure.
4712 Copy the const value here instead of in cv_clone2 so that
4713 SvREADONLY_on doesn't lead to problems when leaving
4718 if (!SvREADONLY(sv) && SvREFCNT(sv) > 1)
4730 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4740 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4744 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4746 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4750 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4756 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4761 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4762 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4763 SV *sv = sv_newmortal();
4764 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
4765 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
4766 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4771 gv = gv_fetchpv(name ? name : (aname ? aname :
4772 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__")),
4773 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4783 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4784 maximum a prototype before. */
4785 if (SvTYPE(gv) > SVt_NULL) {
4786 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4787 && ckWARN_d(WARN_PROTOTYPE))
4789 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
4791 cv_ckproto((CV*)gv, NULL, ps);
4794 sv_setpv((SV*)gv, ps);
4796 sv_setiv((SV*)gv, -1);
4797 SvREFCNT_dec(PL_compcv);
4798 cv = PL_compcv = NULL;
4799 PL_sub_generation++;
4803 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4805 #ifdef GV_UNIQUE_CHECK
4806 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
4807 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
4811 if (!block || !ps || *ps || attrs)
4814 const_sv = op_const_sv(block, Nullcv);
4817 bool exists = CvROOT(cv) || CvXSUB(cv);
4819 #ifdef GV_UNIQUE_CHECK
4820 if (exists && GvUNIQUE(gv)) {
4821 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
4825 /* if the subroutine doesn't exist and wasn't pre-declared
4826 * with a prototype, assume it will be AUTOLOADed,
4827 * skipping the prototype check
4829 if (exists || SvPOK(cv))
4830 cv_ckproto(cv, gv, ps);
4831 /* already defined (or promised)? */
4832 if (exists || GvASSUMECV(gv)) {
4833 if (!block && !attrs) {
4834 if (CvFLAGS(PL_compcv)) {
4835 /* might have had built-in attrs applied */
4836 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4838 /* just a "sub foo;" when &foo is already defined */
4839 SAVEFREESV(PL_compcv);
4842 /* ahem, death to those who redefine active sort subs */
4843 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4844 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4846 if (ckWARN(WARN_REDEFINE)
4848 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4850 line_t oldline = CopLINE(PL_curcop);
4851 if (PL_copline != NOLINE)
4852 CopLINE_set(PL_curcop, PL_copline);
4853 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4854 CvCONST(cv) ? "Constant subroutine %s redefined"
4855 : "Subroutine %s redefined", name);
4856 CopLINE_set(PL_curcop, oldline);
4864 SvREFCNT_inc(const_sv);
4866 assert(!CvROOT(cv) && !CvCONST(cv));
4867 sv_setpv((SV*)cv, ""); /* prototype is "" */
4868 CvXSUBANY(cv).any_ptr = const_sv;
4869 CvXSUB(cv) = const_sv_xsub;
4874 cv = newCONSTSUB(NULL, name, const_sv);
4877 SvREFCNT_dec(PL_compcv);
4879 PL_sub_generation++;
4886 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4887 * before we clobber PL_compcv.
4891 /* Might have had built-in attributes applied -- propagate them. */
4892 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4893 if (CvGV(cv) && GvSTASH(CvGV(cv)))
4894 stash = GvSTASH(CvGV(cv));
4895 else if (CvSTASH(cv))
4896 stash = CvSTASH(cv);
4898 stash = PL_curstash;
4901 /* possibly about to re-define existing subr -- ignore old cv */
4902 rcv = (SV*)PL_compcv;
4903 if (name && GvSTASH(gv))
4904 stash = GvSTASH(gv);
4906 stash = PL_curstash;
4908 apply_attrs(stash, rcv, attrs, FALSE);
4910 if (cv) { /* must reuse cv if autoloaded */
4912 /* got here with just attrs -- work done, so bug out */
4913 SAVEFREESV(PL_compcv);
4917 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4918 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4919 CvOUTSIDE(PL_compcv) = 0;
4920 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4921 CvPADLIST(PL_compcv) = 0;
4922 /* inner references to PL_compcv must be fixed up ... */
4924 AV *padlist = CvPADLIST(cv);
4925 AV *comppad_name = (AV*)AvARRAY(padlist)[0];
4926 AV *comppad = (AV*)AvARRAY(padlist)[1];
4927 SV **namepad = AvARRAY(comppad_name);
4928 SV **curpad = AvARRAY(comppad);
4929 for (ix = AvFILLp(comppad_name); ix > 0; ix--) {
4930 SV *namesv = namepad[ix];
4931 if (namesv && namesv != &PL_sv_undef
4932 && *SvPVX(namesv) == '&')
4934 CV *innercv = (CV*)curpad[ix];
4935 if (CvOUTSIDE(innercv) == PL_compcv) {
4936 CvOUTSIDE(innercv) = cv;
4937 if (!CvANON(innercv) || CvCLONED(innercv)) {
4938 (void)SvREFCNT_inc(cv);
4939 SvREFCNT_dec(PL_compcv);
4945 /* ... before we throw it away */
4946 SvREFCNT_dec(PL_compcv);
4947 if (PERLDB_INTER)/* Advice debugger on the new sub. */
4948 ++PL_sub_generation;
4955 PL_sub_generation++;
4959 CvFILE_set_from_cop(cv, PL_curcop);
4960 CvSTASH(cv) = PL_curstash;
4961 #ifdef USE_5005THREADS
4963 if (!CvMUTEXP(cv)) {
4964 New(666, CvMUTEXP(cv), 1, perl_mutex);
4965 MUTEX_INIT(CvMUTEXP(cv));
4967 #endif /* USE_5005THREADS */
4970 sv_setpv((SV*)cv, ps);
4972 if (PL_error_count) {
4976 char *s = strrchr(name, ':');
4978 if (strEQ(s, "BEGIN")) {
4980 "BEGIN not safe after errors--compilation aborted";
4981 if (PL_in_eval & EVAL_KEEPERR)
4982 Perl_croak(aTHX_ not_safe);
4984 /* force display of errors found but not reported */
4985 sv_catpv(ERRSV, not_safe);
4986 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4994 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4995 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4998 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
4999 mod(scalarseq(block), OP_LEAVESUBLV));
5002 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5004 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5005 OpREFCNT_set(CvROOT(cv), 1);
5006 CvSTART(cv) = LINKLIST(CvROOT(cv));
5007 CvROOT(cv)->op_next = 0;
5008 CALL_PEEP(CvSTART(cv));
5010 /* now that optimizer has done its work, adjust pad values */
5012 SV **namep = AvARRAY(PL_comppad_name);
5013 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5016 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
5019 * The only things that a clonable function needs in its
5020 * pad are references to outer lexicals and anonymous subs.
5021 * The rest are created anew during cloning.
5023 if (!((namesv = namep[ix]) != Nullsv &&
5024 namesv != &PL_sv_undef &&
5026 *SvPVX(namesv) == '&')))
5028 SvREFCNT_dec(PL_curpad[ix]);
5029 PL_curpad[ix] = Nullsv;
5032 assert(!CvCONST(cv));
5033 if (ps && !*ps && op_const_sv(block, cv))
5037 AV *av = newAV(); /* Will be @_ */
5039 av_store(PL_comppad, 0, (SV*)av);
5040 AvFLAGS(av) = AVf_REIFY;
5042 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5043 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
5045 if (!SvPADMY(PL_curpad[ix]))
5046 SvPADTMP_on(PL_curpad[ix]);
5050 /* If a potential closure prototype, don't keep a refcount on outer CV.
5051 * This is okay as the lifetime of the prototype is tied to the
5052 * lifetime of the outer CV. Avoids memory leak due to reference
5055 SvREFCNT_dec(CvOUTSIDE(cv));
5057 if (name || aname) {
5059 char *tname = (name ? name : aname);
5061 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5062 SV *sv = NEWSV(0,0);
5063 SV *tmpstr = sv_newmortal();
5064 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
5068 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5070 (long)PL_subline, (long)CopLINE(PL_curcop));
5071 gv_efullname3(tmpstr, gv, Nullch);
5072 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
5073 hv = GvHVn(db_postponed);
5074 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
5075 && (pcv = GvCV(db_postponed)))
5081 call_sv((SV*)pcv, G_DISCARD);
5085 if ((s = strrchr(tname,':')))
5090 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
5093 if (strEQ(s, "BEGIN")) {
5094 I32 oldscope = PL_scopestack_ix;
5096 SAVECOPFILE(&PL_compiling);
5097 SAVECOPLINE(&PL_compiling);
5100 PL_beginav = newAV();
5101 DEBUG_x( dump_sub(gv) );
5102 av_push(PL_beginav, (SV*)cv);
5103 GvCV(gv) = 0; /* cv has been hijacked */
5104 call_list(oldscope, PL_beginav);
5106 PL_curcop = &PL_compiling;
5107 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
5110 else if (strEQ(s, "END") && !PL_error_count) {
5113 DEBUG_x( dump_sub(gv) );
5114 av_unshift(PL_endav, 1);
5115 av_store(PL_endav, 0, (SV*)cv);
5116 GvCV(gv) = 0; /* cv has been hijacked */
5118 else if (strEQ(s, "CHECK") && !PL_error_count) {
5120 PL_checkav = newAV();
5121 DEBUG_x( dump_sub(gv) );
5122 if (PL_main_start && ckWARN(WARN_VOID))
5123 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
5124 av_unshift(PL_checkav, 1);
5125 av_store(PL_checkav, 0, (SV*)cv);
5126 GvCV(gv) = 0; /* cv has been hijacked */
5128 else if (strEQ(s, "INIT") && !PL_error_count) {
5130 PL_initav = newAV();
5131 DEBUG_x( dump_sub(gv) );
5132 if (PL_main_start && ckWARN(WARN_VOID))
5133 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
5134 av_push(PL_initav, (SV*)cv);
5135 GvCV(gv) = 0; /* cv has been hijacked */
5140 PL_copline = NOLINE;
5145 /* XXX unsafe for threads if eval_owner isn't held */
5147 =for apidoc newCONSTSUB
5149 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5150 eligible for inlining at compile-time.
5156 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
5162 SAVECOPLINE(PL_curcop);
5163 CopLINE_set(PL_curcop, PL_copline);
5166 PL_hints &= ~HINT_BLOCK_SCOPE;
5169 SAVESPTR(PL_curstash);
5170 SAVECOPSTASH(PL_curcop);
5171 PL_curstash = stash;
5172 CopSTASH_set(PL_curcop,stash);
5175 cv = newXS(name, const_sv_xsub, __FILE__);
5176 CvXSUBANY(cv).any_ptr = sv;
5178 sv_setpv((SV*)cv, ""); /* prototype is "" */
5186 =for apidoc U||newXS
5188 Used by C<xsubpp> to hook up XSUBs as Perl subs.
5194 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
5196 GV *gv = gv_fetchpv(name ? name :
5197 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5198 GV_ADDMULTI, SVt_PVCV);
5201 if ((cv = (name ? GvCV(gv) : Nullcv))) {
5203 /* just a cached method */
5207 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
5208 /* already defined (or promised) */
5209 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
5210 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
5211 line_t oldline = CopLINE(PL_curcop);
5212 if (PL_copline != NOLINE)
5213 CopLINE_set(PL_curcop, PL_copline);
5214 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5215 CvCONST(cv) ? "Constant subroutine %s redefined"
5216 : "Subroutine %s redefined"
5218 CopLINE_set(PL_curcop, oldline);
5225 if (cv) /* must reuse cv if autoloaded */
5228 cv = (CV*)NEWSV(1105,0);
5229 sv_upgrade((SV *)cv, SVt_PVCV);
5233 PL_sub_generation++;
5237 #ifdef USE_5005THREADS
5238 New(666, CvMUTEXP(cv), 1, perl_mutex);
5239 MUTEX_INIT(CvMUTEXP(cv));
5241 #endif /* USE_5005THREADS */
5242 (void)gv_fetchfile(filename);
5243 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
5244 an external constant string */
5245 CvXSUB(cv) = subaddr;
5248 char *s = strrchr(name,':');
5254 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
5257 if (strEQ(s, "BEGIN")) {
5259 PL_beginav = newAV();
5260 av_push(PL_beginav, (SV*)cv);
5261 GvCV(gv) = 0; /* cv has been hijacked */
5263 else if (strEQ(s, "END")) {
5266 av_unshift(PL_endav, 1);
5267 av_store(PL_endav, 0, (SV*)cv);
5268 GvCV(gv) = 0; /* cv has been hijacked */
5270 else if (strEQ(s, "CHECK")) {
5272 PL_checkav = newAV();
5273 if (PL_main_start && ckWARN(WARN_VOID))
5274 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
5275 av_unshift(PL_checkav, 1);
5276 av_store(PL_checkav, 0, (SV*)cv);
5277 GvCV(gv) = 0; /* cv has been hijacked */
5279 else if (strEQ(s, "INIT")) {
5281 PL_initav = newAV();
5282 if (PL_main_start && ckWARN(WARN_VOID))
5283 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
5284 av_push(PL_initav, (SV*)cv);
5285 GvCV(gv) = 0; /* cv has been hijacked */
5296 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
5305 name = SvPVx(cSVOPo->op_sv, n_a);
5308 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
5309 #ifdef GV_UNIQUE_CHECK
5311 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
5315 if ((cv = GvFORM(gv))) {
5316 if (ckWARN(WARN_REDEFINE)) {
5317 line_t oldline = CopLINE(PL_curcop);
5318 if (PL_copline != NOLINE)
5319 CopLINE_set(PL_curcop, PL_copline);
5320 Perl_warner(aTHX_ packWARN(WARN_REDEFINE), "Format %s redefined",name);
5321 CopLINE_set(PL_curcop, oldline);
5328 CvFILE_set_from_cop(cv, PL_curcop);
5330 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
5331 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
5332 SvPADTMP_on(PL_curpad[ix]);
5335 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
5336 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5337 OpREFCNT_set(CvROOT(cv), 1);
5338 CvSTART(cv) = LINKLIST(CvROOT(cv));
5339 CvROOT(cv)->op_next = 0;
5340 CALL_PEEP(CvSTART(cv));
5342 PL_copline = NOLINE;
5347 Perl_newANONLIST(pTHX_ OP *o)
5349 return newUNOP(OP_REFGEN, 0,
5350 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
5354 Perl_newANONHASH(pTHX_ OP *o)
5356 return newUNOP(OP_REFGEN, 0,
5357 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
5361 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
5363 return newANONATTRSUB(floor, proto, Nullop, block);
5367 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
5369 return newUNOP(OP_REFGEN, 0,
5370 newSVOP(OP_ANONCODE, 0,
5371 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
5375 Perl_oopsAV(pTHX_ OP *o)
5377 switch (o->op_type) {
5379 o->op_type = OP_PADAV;
5380 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5381 return ref(o, OP_RV2AV);
5384 o->op_type = OP_RV2AV;
5385 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
5390 if (ckWARN_d(WARN_INTERNAL))
5391 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
5398 Perl_oopsHV(pTHX_ OP *o)
5400 switch (o->op_type) {
5403 o->op_type = OP_PADHV;
5404 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5405 return ref(o, OP_RV2HV);
5409 o->op_type = OP_RV2HV;
5410 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
5415 if (ckWARN_d(WARN_INTERNAL))
5416 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
5423 Perl_newAVREF(pTHX_ OP *o)
5425 if (o->op_type == OP_PADANY) {
5426 o->op_type = OP_PADAV;
5427 o->op_ppaddr = PL_ppaddr[OP_PADAV];
5430 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
5431 && ckWARN(WARN_DEPRECATED)) {
5432 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
5433 "Using an array as a reference is deprecated");
5435 return newUNOP(OP_RV2AV, 0, scalar(o));
5439 Perl_newGVREF(pTHX_ I32 type, OP *o)
5441 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
5442 return newUNOP(OP_NULL, 0, o);
5443 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
5447 Perl_newHVREF(pTHX_ OP *o)
5449 if (o->op_type == OP_PADANY) {
5450 o->op_type = OP_PADHV;
5451 o->op_ppaddr = PL_ppaddr[OP_PADHV];
5454 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
5455 && ckWARN(WARN_DEPRECATED)) {
5456 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
5457 "Using a hash as a reference is deprecated");
5459 return newUNOP(OP_RV2HV, 0, scalar(o));
5463 Perl_oopsCV(pTHX_ OP *o)
5465 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5471 Perl_newCVREF(pTHX_ I32 flags, OP *o)
5473 return newUNOP(OP_RV2CV, flags, scalar(o));
5477 Perl_newSVREF(pTHX_ OP *o)
5479 if (o->op_type == OP_PADANY) {
5480 o->op_type = OP_PADSV;
5481 o->op_ppaddr = PL_ppaddr[OP_PADSV];
5484 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
5485 o->op_flags |= OPpDONE_SVREF;
5488 return newUNOP(OP_RV2SV, 0, scalar(o));
5491 /* Check routines. */
5494 Perl_ck_anoncode(pTHX_ OP *o)
5499 name = NEWSV(1106,0);
5500 sv_upgrade(name, SVt_PVNV);
5501 sv_setpvn(name, "&", 1);
5504 ix = pad_alloc(o->op_type, SVs_PADMY);
5505 av_store(PL_comppad_name, ix, name);
5506 av_store(PL_comppad, ix, cSVOPo->op_sv);
5507 SvPADMY_on(cSVOPo->op_sv);
5508 cSVOPo->op_sv = Nullsv;
5509 cSVOPo->op_targ = ix;
5514 Perl_ck_bitop(pTHX_ OP *o)
5516 o->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
5521 Perl_ck_concat(pTHX_ OP *o)
5523 if (cUNOPo->op_first->op_type == OP_CONCAT)
5524 o->op_flags |= OPf_STACKED;
5529 Perl_ck_spair(pTHX_ OP *o)
5531 if (o->op_flags & OPf_KIDS) {
5534 OPCODE type = o->op_type;
5535 o = modkids(ck_fun(o), type);
5536 kid = cUNOPo->op_first;
5537 newop = kUNOP->op_first->op_sibling;
5539 (newop->op_sibling ||
5540 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
5541 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
5542 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
5546 op_free(kUNOP->op_first);
5547 kUNOP->op_first = newop;
5549 o->op_ppaddr = PL_ppaddr[++o->op_type];
5554 Perl_ck_delete(pTHX_ OP *o)
5558 if (o->op_flags & OPf_KIDS) {
5559 OP *kid = cUNOPo->op_first;
5560 switch (kid->op_type) {
5562 o->op_flags |= OPf_SPECIAL;
5565 o->op_private |= OPpSLICE;
5568 o->op_flags |= OPf_SPECIAL;
5573 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
5582 Perl_ck_die(pTHX_ OP *o)
5585 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
5591 Perl_ck_eof(pTHX_ OP *o)
5593 I32 type = o->op_type;
5595 if (o->op_flags & OPf_KIDS) {
5596 if (cLISTOPo->op_first->op_type == OP_STUB) {
5598 o = newUNOP(type, OPf_SPECIAL,
5599 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
5607 Perl_ck_eval(pTHX_ OP *o)
5609 PL_hints |= HINT_BLOCK_SCOPE;
5610 if (o->op_flags & OPf_KIDS) {
5611 SVOP *kid = (SVOP*)cUNOPo->op_first;
5614 o->op_flags &= ~OPf_KIDS;
5617 else if (kid->op_type == OP_LINESEQ) {
5620 kid->op_next = o->op_next;
5621 cUNOPo->op_first = 0;
5624 NewOp(1101, enter, 1, LOGOP);
5625 enter->op_type = OP_ENTERTRY;
5626 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
5627 enter->op_private = 0;
5629 /* establish postfix order */
5630 enter->op_next = (OP*)enter;
5632 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
5633 o->op_type = OP_LEAVETRY;
5634 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
5635 enter->op_other = o;
5643 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
5645 o->op_targ = (PADOFFSET)PL_hints;
5650 Perl_ck_exit(pTHX_ OP *o)
5653 HV *table = GvHV(PL_hintgv);
5655 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
5656 if (svp && *svp && SvTRUE(*svp))
5657 o->op_private |= OPpEXIT_VMSISH;
5659 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
5665 Perl_ck_exec(pTHX_ OP *o)
5668 if (o->op_flags & OPf_STACKED) {
5670 kid = cUNOPo->op_first->op_sibling;
5671 if (kid->op_type == OP_RV2GV)
5680 Perl_ck_exists(pTHX_ OP *o)
5683 if (o->op_flags & OPf_KIDS) {
5684 OP *kid = cUNOPo->op_first;
5685 if (kid->op_type == OP_ENTERSUB) {
5686 (void) ref(kid, o->op_type);
5687 if (kid->op_type != OP_RV2CV && !PL_error_count)
5688 Perl_croak(aTHX_ "%s argument is not a subroutine name",
5690 o->op_private |= OPpEXISTS_SUB;
5692 else if (kid->op_type == OP_AELEM)
5693 o->op_flags |= OPf_SPECIAL;
5694 else if (kid->op_type != OP_HELEM)
5695 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
5704 Perl_ck_gvconst(pTHX_ register OP *o)
5706 o = fold_constants(o);
5707 if (o->op_type == OP_CONST)
5714 Perl_ck_rvconst(pTHX_ register OP *o)
5716 SVOP *kid = (SVOP*)cUNOPo->op_first;
5718 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5719 if (kid->op_type == OP_CONST) {
5723 SV *kidsv = kid->op_sv;
5726 /* Is it a constant from cv_const_sv()? */
5727 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5728 SV *rsv = SvRV(kidsv);
5729 int svtype = SvTYPE(rsv);
5730 char *badtype = Nullch;
5732 switch (o->op_type) {
5734 if (svtype > SVt_PVMG)
5735 badtype = "a SCALAR";
5738 if (svtype != SVt_PVAV)
5739 badtype = "an ARRAY";
5742 if (svtype != SVt_PVHV) {
5743 if (svtype == SVt_PVAV) { /* pseudohash? */
5744 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5745 if (ksv && SvROK(*ksv)
5746 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5755 if (svtype != SVt_PVCV)
5760 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5763 name = SvPV(kidsv, n_a);
5764 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5765 char *badthing = Nullch;
5766 switch (o->op_type) {
5768 badthing = "a SCALAR";
5771 badthing = "an ARRAY";
5774 badthing = "a HASH";
5779 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5783 * This is a little tricky. We only want to add the symbol if we
5784 * didn't add it in the lexer. Otherwise we get duplicate strict
5785 * warnings. But if we didn't add it in the lexer, we must at
5786 * least pretend like we wanted to add it even if it existed before,
5787 * or we get possible typo warnings. OPpCONST_ENTERED says
5788 * whether the lexer already added THIS instance of this symbol.
5790 iscv = (o->op_type == OP_RV2CV) * 2;
5792 gv = gv_fetchpv(name,
5793 iscv | !(kid->op_private & OPpCONST_ENTERED),
5796 : o->op_type == OP_RV2SV
5798 : o->op_type == OP_RV2AV
5800 : o->op_type == OP_RV2HV
5803 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5805 kid->op_type = OP_GV;
5806 SvREFCNT_dec(kid->op_sv);
5808 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5809 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5810 SvREFCNT_dec(PL_curpad[kPADOP->op_padix]);
5812 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5814 kid->op_sv = SvREFCNT_inc(gv);
5816 kid->op_private = 0;
5817 kid->op_ppaddr = PL_ppaddr[OP_GV];
5824 Perl_ck_ftst(pTHX_ OP *o)
5826 I32 type = o->op_type;
5828 if (o->op_flags & OPf_REF) {
5831 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5832 SVOP *kid = (SVOP*)cUNOPo->op_first;
5834 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5836 OP *newop = newGVOP(type, OPf_REF,
5837 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5844 if (type == OP_FTTTY)
5845 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5848 o = newUNOP(type, 0, newDEFSVOP());
5854 Perl_ck_fun(pTHX_ OP *o)
5860 int type = o->op_type;
5861 register I32 oa = PL_opargs[type] >> OASHIFT;
5863 if (o->op_flags & OPf_STACKED) {
5864 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5867 return no_fh_allowed(o);
5870 if (o->op_flags & OPf_KIDS) {
5872 tokid = &cLISTOPo->op_first;
5873 kid = cLISTOPo->op_first;
5874 if (kid->op_type == OP_PUSHMARK ||
5875 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5877 tokid = &kid->op_sibling;
5878 kid = kid->op_sibling;
5880 if (!kid && PL_opargs[type] & OA_DEFGV)
5881 *tokid = kid = newDEFSVOP();
5885 sibl = kid->op_sibling;
5888 /* list seen where single (scalar) arg expected? */
5889 if (numargs == 1 && !(oa >> 4)
5890 && kid->op_type == OP_LIST && type != OP_SCALAR)
5892 return too_many_arguments(o,PL_op_desc[type]);
5905 if ((type == OP_PUSH || type == OP_UNSHIFT)
5906 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
5907 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5908 "Useless use of %s with no values",
5911 if (kid->op_type == OP_CONST &&
5912 (kid->op_private & OPpCONST_BARE))
5914 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5915 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5916 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5917 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5918 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5919 "Array @%s missing the @ in argument %"IVdf" of %s()",
5920 name, (IV)numargs, PL_op_desc[type]);
5923 kid->op_sibling = sibl;
5926 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5927 bad_type(numargs, "array", PL_op_desc[type], kid);
5931 if (kid->op_type == OP_CONST &&
5932 (kid->op_private & OPpCONST_BARE))
5934 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5935 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5936 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5937 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5938 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5939 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5940 name, (IV)numargs, PL_op_desc[type]);
5943 kid->op_sibling = sibl;
5946 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5947 bad_type(numargs, "hash", PL_op_desc[type], kid);
5952 OP *newop = newUNOP(OP_NULL, 0, kid);
5953 kid->op_sibling = 0;
5955 newop->op_next = newop;
5957 kid->op_sibling = sibl;
5962 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5963 if (kid->op_type == OP_CONST &&
5964 (kid->op_private & OPpCONST_BARE))
5966 OP *newop = newGVOP(OP_GV, 0,
5967 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5969 if (!(o->op_private & 1) && /* if not unop */
5970 kid == cLISTOPo->op_last)
5971 cLISTOPo->op_last = newop;
5975 else if (kid->op_type == OP_READLINE) {
5976 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5977 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
5980 I32 flags = OPf_SPECIAL;
5984 /* is this op a FH constructor? */
5985 if (is_handle_constructor(o,numargs)) {
5986 char *name = Nullch;
5990 /* Set a flag to tell rv2gv to vivify
5991 * need to "prove" flag does not mean something
5992 * else already - NI-S 1999/05/07
5995 if (kid->op_type == OP_PADSV) {
5996 SV **namep = av_fetch(PL_comppad_name,
5998 if (namep && *namep)
5999 name = SvPV(*namep, len);
6001 else if (kid->op_type == OP_RV2SV
6002 && kUNOP->op_first->op_type == OP_GV)
6004 GV *gv = cGVOPx_gv(kUNOP->op_first);
6006 len = GvNAMELEN(gv);
6008 else if (kid->op_type == OP_AELEM
6009 || kid->op_type == OP_HELEM)
6011 name = "__ANONIO__";
6017 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
6018 namesv = PL_curpad[targ];
6019 (void)SvUPGRADE(namesv, SVt_PV);
6021 sv_setpvn(namesv, "$", 1);
6022 sv_catpvn(namesv, name, len);
6025 kid->op_sibling = 0;
6026 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
6027 kid->op_targ = targ;
6028 kid->op_private |= priv;
6030 kid->op_sibling = sibl;
6036 mod(scalar(kid), type);
6040 tokid = &kid->op_sibling;
6041 kid = kid->op_sibling;
6043 o->op_private |= numargs;
6045 return too_many_arguments(o,OP_DESC(o));
6048 else if (PL_opargs[type] & OA_DEFGV) {
6050 return newUNOP(type, 0, newDEFSVOP());
6054 while (oa & OA_OPTIONAL)
6056 if (oa && oa != OA_LIST)
6057 return too_few_arguments(o,OP_DESC(o));
6063 Perl_ck_glob(pTHX_ OP *o)
6068 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
6069 append_elem(OP_GLOB, o, newDEFSVOP());
6071 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV))
6072 && GvCVu(gv) && GvIMPORTED_CV(gv)))
6074 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
6077 #if !defined(PERL_EXTERNAL_GLOB)
6078 /* XXX this can be tightened up and made more failsafe. */
6082 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
6083 newSVpvn("File::Glob", 10), Nullsv, Nullsv, Nullsv);
6084 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
6085 glob_gv = gv_fetchpv("File::Glob::csh_glob", FALSE, SVt_PVCV);
6086 GvCV(gv) = GvCV(glob_gv);
6087 SvREFCNT_inc((SV*)GvCV(gv));
6088 GvIMPORTED_CV_on(gv);
6091 #endif /* PERL_EXTERNAL_GLOB */
6093 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
6094 append_elem(OP_GLOB, o,
6095 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
6096 o->op_type = OP_LIST;
6097 o->op_ppaddr = PL_ppaddr[OP_LIST];
6098 cLISTOPo->op_first->op_type = OP_PUSHMARK;
6099 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
6100 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
6101 append_elem(OP_LIST, o,
6102 scalar(newUNOP(OP_RV2CV, 0,
6103 newGVOP(OP_GV, 0, gv)))));
6104 o = newUNOP(OP_NULL, 0, ck_subr(o));
6105 o->op_targ = OP_GLOB; /* hint at what it used to be */
6108 gv = newGVgen("main");
6110 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
6116 Perl_ck_grep(pTHX_ OP *o)
6120 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
6122 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
6123 NewOp(1101, gwop, 1, LOGOP);
6125 if (o->op_flags & OPf_STACKED) {
6128 kid = cLISTOPo->op_first->op_sibling;
6129 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
6132 kid->op_next = (OP*)gwop;
6133 o->op_flags &= ~OPf_STACKED;
6135 kid = cLISTOPo->op_first->op_sibling;
6136 if (type == OP_MAPWHILE)
6143 kid = cLISTOPo->op_first->op_sibling;
6144 if (kid->op_type != OP_NULL)
6145 Perl_croak(aTHX_ "panic: ck_grep");
6146 kid = kUNOP->op_first;
6148 gwop->op_type = type;
6149 gwop->op_ppaddr = PL_ppaddr[type];
6150 gwop->op_first = listkids(o);
6151 gwop->op_flags |= OPf_KIDS;
6152 gwop->op_private = 1;
6153 gwop->op_other = LINKLIST(kid);
6154 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
6155 kid->op_next = (OP*)gwop;
6157 kid = cLISTOPo->op_first->op_sibling;
6158 if (!kid || !kid->op_sibling)
6159 return too_few_arguments(o,OP_DESC(o));
6160 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
6161 mod(kid, OP_GREPSTART);
6167 Perl_ck_index(pTHX_ OP *o)
6169 if (o->op_flags & OPf_KIDS) {
6170 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6172 kid = kid->op_sibling; /* get past "big" */
6173 if (kid && kid->op_type == OP_CONST)
6174 fbm_compile(((SVOP*)kid)->op_sv, 0);
6180 Perl_ck_lengthconst(pTHX_ OP *o)
6182 /* XXX length optimization goes here */
6187 Perl_ck_lfun(pTHX_ OP *o)
6189 OPCODE type = o->op_type;
6190 return modkids(ck_fun(o), type);
6194 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
6196 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
6197 switch (cUNOPo->op_first->op_type) {
6199 /* This is needed for
6200 if (defined %stash::)
6201 to work. Do not break Tk.
6203 break; /* Globals via GV can be undef */
6205 case OP_AASSIGN: /* Is this a good idea? */
6206 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6207 "defined(@array) is deprecated");
6208 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6209 "\t(Maybe you should just omit the defined()?)\n");
6212 /* This is needed for
6213 if (defined %stash::)
6214 to work. Do not break Tk.
6216 break; /* Globals via GV can be undef */
6218 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6219 "defined(%%hash) is deprecated");
6220 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6221 "\t(Maybe you should just omit the defined()?)\n");
6232 Perl_ck_rfun(pTHX_ OP *o)
6234 OPCODE type = o->op_type;
6235 return refkids(ck_fun(o), type);
6239 Perl_ck_listiob(pTHX_ OP *o)
6243 kid = cLISTOPo->op_first;
6246 kid = cLISTOPo->op_first;
6248 if (kid->op_type == OP_PUSHMARK)
6249 kid = kid->op_sibling;
6250 if (kid && o->op_flags & OPf_STACKED)
6251 kid = kid->op_sibling;
6252 else if (kid && !kid->op_sibling) { /* print HANDLE; */
6253 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
6254 o->op_flags |= OPf_STACKED; /* make it a filehandle */
6255 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
6256 cLISTOPo->op_first->op_sibling = kid;
6257 cLISTOPo->op_last = kid;
6258 kid = kid->op_sibling;
6263 append_elem(o->op_type, o, newDEFSVOP());
6269 Perl_ck_sassign(pTHX_ OP *o)
6271 OP *kid = cLISTOPo->op_first;
6272 /* has a disposable target? */
6273 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
6274 && !(kid->op_flags & OPf_STACKED)
6275 /* Cannot steal the second time! */
6276 && !(kid->op_private & OPpTARGET_MY))
6278 OP *kkid = kid->op_sibling;
6280 /* Can just relocate the target. */
6281 if (kkid && kkid->op_type == OP_PADSV
6282 && !(kkid->op_private & OPpLVAL_INTRO))
6284 kid->op_targ = kkid->op_targ;
6286 /* Now we do not need PADSV and SASSIGN. */
6287 kid->op_sibling = o->op_sibling; /* NULL */
6288 cLISTOPo->op_first = NULL;
6291 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
6299 Perl_ck_match(pTHX_ OP *o)
6301 o->op_private |= OPpRUNTIME;
6306 Perl_ck_method(pTHX_ OP *o)
6308 OP *kid = cUNOPo->op_first;
6309 if (kid->op_type == OP_CONST) {
6310 SV* sv = kSVOP->op_sv;
6311 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
6313 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
6314 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
6317 kSVOP->op_sv = Nullsv;
6319 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
6328 Perl_ck_null(pTHX_ OP *o)
6334 Perl_ck_open(pTHX_ OP *o)
6336 HV *table = GvHV(PL_hintgv);
6340 svp = hv_fetch(table, "open_IN", 7, FALSE);
6342 mode = mode_from_discipline(*svp);
6343 if (mode & O_BINARY)
6344 o->op_private |= OPpOPEN_IN_RAW;
6345 else if (mode & O_TEXT)
6346 o->op_private |= OPpOPEN_IN_CRLF;
6349 svp = hv_fetch(table, "open_OUT", 8, FALSE);
6351 mode = mode_from_discipline(*svp);
6352 if (mode & O_BINARY)
6353 o->op_private |= OPpOPEN_OUT_RAW;
6354 else if (mode & O_TEXT)
6355 o->op_private |= OPpOPEN_OUT_CRLF;
6358 if (o->op_type == OP_BACKTICK)
6364 Perl_ck_repeat(pTHX_ OP *o)
6366 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
6367 o->op_private |= OPpREPEAT_DOLIST;
6368 cBINOPo->op_first = force_list(cBINOPo->op_first);
6376 Perl_ck_require(pTHX_ OP *o)
6380 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
6381 SVOP *kid = (SVOP*)cUNOPo->op_first;
6383 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6385 for (s = SvPVX(kid->op_sv); *s; s++) {
6386 if (*s == ':' && s[1] == ':') {
6388 Move(s+2, s+1, strlen(s+2)+1, char);
6389 --SvCUR(kid->op_sv);
6392 if (SvREADONLY(kid->op_sv)) {
6393 SvREADONLY_off(kid->op_sv);
6394 sv_catpvn(kid->op_sv, ".pm", 3);
6395 SvREADONLY_on(kid->op_sv);
6398 sv_catpvn(kid->op_sv, ".pm", 3);
6402 /* handle override, if any */
6403 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
6404 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
6405 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
6407 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
6408 OP *kid = cUNOPo->op_first;
6409 cUNOPo->op_first = 0;
6411 return ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
6412 append_elem(OP_LIST, kid,
6413 scalar(newUNOP(OP_RV2CV, 0,
6422 Perl_ck_return(pTHX_ OP *o)
6425 if (CvLVALUE(PL_compcv)) {
6426 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
6427 mod(kid, OP_LEAVESUBLV);
6434 Perl_ck_retarget(pTHX_ OP *o)
6436 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
6443 Perl_ck_select(pTHX_ OP *o)
6446 if (o->op_flags & OPf_KIDS) {
6447 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6448 if (kid && kid->op_sibling) {
6449 o->op_type = OP_SSELECT;
6450 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
6452 return fold_constants(o);
6456 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6457 if (kid && kid->op_type == OP_RV2GV)
6458 kid->op_private &= ~HINT_STRICT_REFS;
6463 Perl_ck_shift(pTHX_ OP *o)
6465 I32 type = o->op_type;
6467 if (!(o->op_flags & OPf_KIDS)) {
6471 #ifdef USE_5005THREADS
6472 if (!CvUNIQUE(PL_compcv)) {
6473 argop = newOP(OP_PADAV, OPf_REF);
6474 argop->op_targ = 0; /* PL_curpad[0] is @_ */
6477 argop = newUNOP(OP_RV2AV, 0,
6478 scalar(newGVOP(OP_GV, 0,
6479 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6482 argop = newUNOP(OP_RV2AV, 0,
6483 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
6484 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
6485 #endif /* USE_5005THREADS */
6486 return newUNOP(type, 0, scalar(argop));
6488 return scalar(modkids(ck_fun(o), type));
6492 Perl_ck_sort(pTHX_ OP *o)
6496 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
6498 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6499 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
6501 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
6503 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
6505 if (kid->op_type == OP_SCOPE) {
6509 else if (kid->op_type == OP_LEAVE) {
6510 if (o->op_type == OP_SORT) {
6511 op_null(kid); /* wipe out leave */
6514 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
6515 if (k->op_next == kid)
6517 /* don't descend into loops */
6518 else if (k->op_type == OP_ENTERLOOP
6519 || k->op_type == OP_ENTERITER)
6521 k = cLOOPx(k)->op_lastop;
6526 kid->op_next = 0; /* just disconnect the leave */
6527 k = kLISTOP->op_first;
6532 if (o->op_type == OP_SORT) {
6533 /* provide scalar context for comparison function/block */
6539 o->op_flags |= OPf_SPECIAL;
6541 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
6544 firstkid = firstkid->op_sibling;
6547 /* provide list context for arguments */
6548 if (o->op_type == OP_SORT)
6555 S_simplify_sort(pTHX_ OP *o)
6557 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
6561 if (!(o->op_flags & OPf_STACKED))
6563 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
6564 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
6565 kid = kUNOP->op_first; /* get past null */
6566 if (kid->op_type != OP_SCOPE)
6568 kid = kLISTOP->op_last; /* get past scope */
6569 switch(kid->op_type) {
6577 k = kid; /* remember this node*/
6578 if (kBINOP->op_first->op_type != OP_RV2SV)
6580 kid = kBINOP->op_first; /* get past cmp */
6581 if (kUNOP->op_first->op_type != OP_GV)
6583 kid = kUNOP->op_first; /* get past rv2sv */
6585 if (GvSTASH(gv) != PL_curstash)
6587 if (strEQ(GvNAME(gv), "a"))
6589 else if (strEQ(GvNAME(gv), "b"))
6593 kid = k; /* back to cmp */
6594 if (kBINOP->op_last->op_type != OP_RV2SV)
6596 kid = kBINOP->op_last; /* down to 2nd arg */
6597 if (kUNOP->op_first->op_type != OP_GV)
6599 kid = kUNOP->op_first; /* get past rv2sv */
6601 if (GvSTASH(gv) != PL_curstash
6603 ? strNE(GvNAME(gv), "a")
6604 : strNE(GvNAME(gv), "b")))
6606 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
6608 o->op_private |= OPpSORT_REVERSE;
6609 if (k->op_type == OP_NCMP)
6610 o->op_private |= OPpSORT_NUMERIC;
6611 if (k->op_type == OP_I_NCMP)
6612 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
6613 kid = cLISTOPo->op_first->op_sibling;
6614 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
6615 op_free(kid); /* then delete it */
6619 Perl_ck_split(pTHX_ OP *o)
6623 if (o->op_flags & OPf_STACKED)
6624 return no_fh_allowed(o);
6626 kid = cLISTOPo->op_first;
6627 if (kid->op_type != OP_NULL)
6628 Perl_croak(aTHX_ "panic: ck_split");
6629 kid = kid->op_sibling;
6630 op_free(cLISTOPo->op_first);
6631 cLISTOPo->op_first = kid;
6633 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
6634 cLISTOPo->op_last = kid; /* There was only one element previously */
6637 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
6638 OP *sibl = kid->op_sibling;
6639 kid->op_sibling = 0;
6640 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
6641 if (cLISTOPo->op_first == cLISTOPo->op_last)
6642 cLISTOPo->op_last = kid;
6643 cLISTOPo->op_first = kid;
6644 kid->op_sibling = sibl;
6647 kid->op_type = OP_PUSHRE;
6648 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
6650 if (ckWARN(WARN_REGEXP) && ((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
6651 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
6652 "Use of /g modifier is meaningless in split");
6655 if (!kid->op_sibling)
6656 append_elem(OP_SPLIT, o, newDEFSVOP());
6658 kid = kid->op_sibling;
6661 if (!kid->op_sibling)
6662 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
6664 kid = kid->op_sibling;
6667 if (kid->op_sibling)
6668 return too_many_arguments(o,OP_DESC(o));
6674 Perl_ck_join(pTHX_ OP *o)
6676 if (ckWARN(WARN_SYNTAX)) {
6677 OP *kid = cLISTOPo->op_first->op_sibling;
6678 if (kid && kid->op_type == OP_MATCH) {
6679 char *pmstr = "STRING";
6680 if (PM_GETRE(kPMOP))
6681 pmstr = PM_GETRE(kPMOP)->precomp;
6682 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6683 "/%s/ should probably be written as \"%s\"",
6691 Perl_ck_subr(pTHX_ OP *o)
6693 OP *prev = ((cUNOPo->op_first->op_sibling)
6694 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6695 OP *o2 = prev->op_sibling;
6702 I32 contextclass = 0;
6706 o->op_private |= OPpENTERSUB_HASTARG;
6707 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6708 if (cvop->op_type == OP_RV2CV) {
6710 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6711 op_null(cvop); /* disable rv2cv */
6712 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6713 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6714 GV *gv = cGVOPx_gv(tmpop);
6717 tmpop->op_private |= OPpEARLY_CV;
6718 else if (SvPOK(cv)) {
6719 namegv = CvANON(cv) ? gv : CvGV(cv);
6720 proto = SvPV((SV*)cv, n_a);
6724 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6725 if (o2->op_type == OP_CONST)
6726 o2->op_private &= ~OPpCONST_STRICT;
6727 else if (o2->op_type == OP_LIST) {
6728 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6729 if (o && o->op_type == OP_CONST)
6730 o->op_private &= ~OPpCONST_STRICT;
6733 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6734 if (PERLDB_SUB && PL_curstash != PL_debstash)
6735 o->op_private |= OPpENTERSUB_DB;
6736 while (o2 != cvop) {
6740 return too_many_arguments(o, gv_ename(namegv));
6758 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6760 arg == 1 ? "block or sub {}" : "sub {}",
6761 gv_ename(namegv), o2);
6764 /* '*' allows any scalar type, including bareword */
6767 if (o2->op_type == OP_RV2GV)
6768 goto wrapref; /* autoconvert GLOB -> GLOBref */
6769 else if (o2->op_type == OP_CONST)
6770 o2->op_private &= ~OPpCONST_STRICT;
6771 else if (o2->op_type == OP_ENTERSUB) {
6772 /* accidental subroutine, revert to bareword */
6773 OP *gvop = ((UNOP*)o2)->op_first;
6774 if (gvop && gvop->op_type == OP_NULL) {
6775 gvop = ((UNOP*)gvop)->op_first;
6777 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6780 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6781 (gvop = ((UNOP*)gvop)->op_first) &&
6782 gvop->op_type == OP_GV)
6784 GV *gv = cGVOPx_gv(gvop);
6785 OP *sibling = o2->op_sibling;
6786 SV *n = newSVpvn("",0);
6788 gv_fullname3(n, gv, "");
6789 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6790 sv_chop(n, SvPVX(n)+6);
6791 o2 = newSVOP(OP_CONST, 0, n);
6792 prev->op_sibling = o2;
6793 o2->op_sibling = sibling;
6809 if (contextclass++ == 0) {
6810 e = strchr(proto, ']');
6811 if (!e || e == proto)
6824 while (*--p != '[');
6825 bad_type(arg, Perl_form(aTHX_ "one of %s", p),
6826 gv_ename(namegv), o2);
6832 if (o2->op_type == OP_RV2GV)
6835 bad_type(arg, "symbol", gv_ename(namegv), o2);
6838 if (o2->op_type == OP_ENTERSUB)
6841 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6844 if (o2->op_type == OP_RV2SV ||
6845 o2->op_type == OP_PADSV ||
6846 o2->op_type == OP_HELEM ||
6847 o2->op_type == OP_AELEM ||
6848 o2->op_type == OP_THREADSV)
6851 bad_type(arg, "scalar", gv_ename(namegv), o2);
6854 if (o2->op_type == OP_RV2AV ||
6855 o2->op_type == OP_PADAV)
6858 bad_type(arg, "array", gv_ename(namegv), o2);
6861 if (o2->op_type == OP_RV2HV ||
6862 o2->op_type == OP_PADHV)
6865 bad_type(arg, "hash", gv_ename(namegv), o2);
6870 OP* sib = kid->op_sibling;
6871 kid->op_sibling = 0;
6872 o2 = newUNOP(OP_REFGEN, 0, kid);
6873 o2->op_sibling = sib;
6874 prev->op_sibling = o2;
6876 if (contextclass && e) {
6891 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6892 gv_ename(namegv), SvPV((SV*)cv, n_a));
6897 mod(o2, OP_ENTERSUB);
6899 o2 = o2->op_sibling;
6901 if (proto && !optional &&
6902 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6903 return too_few_arguments(o, gv_ename(namegv));
6908 Perl_ck_svconst(pTHX_ OP *o)
6910 SvREADONLY_on(cSVOPo->op_sv);
6915 Perl_ck_trunc(pTHX_ OP *o)
6917 if (o->op_flags & OPf_KIDS) {
6918 SVOP *kid = (SVOP*)cUNOPo->op_first;
6920 if (kid->op_type == OP_NULL)
6921 kid = (SVOP*)kid->op_sibling;
6922 if (kid && kid->op_type == OP_CONST &&
6923 (kid->op_private & OPpCONST_BARE))
6925 o->op_flags |= OPf_SPECIAL;
6926 kid->op_private &= ~OPpCONST_STRICT;
6933 Perl_ck_substr(pTHX_ OP *o)
6936 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6937 OP *kid = cLISTOPo->op_first;
6939 if (kid->op_type == OP_NULL)
6940 kid = kid->op_sibling;
6942 kid->op_flags |= OPf_MOD;
6948 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6951 Perl_peep(pTHX_ register OP *o)
6953 register OP* oldop = 0;
6956 if (!o || o->op_seq)
6960 SAVEVPTR(PL_curcop);
6961 for (; o; o = o->op_next) {
6967 switch (o->op_type) {
6971 PL_curcop = ((COP*)o); /* for warnings */
6972 o->op_seq = PL_op_seqmax++;
6976 if (cSVOPo->op_private & OPpCONST_STRICT)
6977 no_bareword_allowed(o);
6979 /* Relocate sv to the pad for thread safety.
6980 * Despite being a "constant", the SV is written to,
6981 * for reference counts, sv_upgrade() etc. */
6983 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6984 if (SvPADTMP(cSVOPo->op_sv)) {
6985 /* If op_sv is already a PADTMP then it is being used by
6986 * some pad, so make a copy. */
6987 sv_setsv(PL_curpad[ix],cSVOPo->op_sv);
6988 SvREADONLY_on(PL_curpad[ix]);
6989 SvREFCNT_dec(cSVOPo->op_sv);
6992 SvREFCNT_dec(PL_curpad[ix]);
6993 SvPADTMP_on(cSVOPo->op_sv);
6994 PL_curpad[ix] = cSVOPo->op_sv;
6995 /* XXX I don't know how this isn't readonly already. */
6996 SvREADONLY_on(PL_curpad[ix]);
6998 cSVOPo->op_sv = Nullsv;
7002 o->op_seq = PL_op_seqmax++;
7006 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
7007 if (o->op_next->op_private & OPpTARGET_MY) {
7008 if (o->op_flags & OPf_STACKED) /* chained concats */
7009 goto ignore_optimization;
7011 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
7012 o->op_targ = o->op_next->op_targ;
7013 o->op_next->op_targ = 0;
7014 o->op_private |= OPpTARGET_MY;
7017 op_null(o->op_next);
7019 ignore_optimization:
7020 o->op_seq = PL_op_seqmax++;
7023 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
7024 o->op_seq = PL_op_seqmax++;
7025 break; /* Scalar stub must produce undef. List stub is noop */
7029 if (o->op_targ == OP_NEXTSTATE
7030 || o->op_targ == OP_DBSTATE
7031 || o->op_targ == OP_SETSTATE)
7033 PL_curcop = ((COP*)o);
7035 /* XXX: We avoid setting op_seq here to prevent later calls
7036 to peep() from mistakenly concluding that optimisation
7037 has already occurred. This doesn't fix the real problem,
7038 though (See 20010220.007). AMS 20010719 */
7039 if (oldop && o->op_next) {
7040 oldop->op_next = o->op_next;
7048 if (oldop && o->op_next) {
7049 oldop->op_next = o->op_next;
7052 o->op_seq = PL_op_seqmax++;
7056 if (o->op_next->op_type == OP_RV2SV) {
7057 if (!(o->op_next->op_private & OPpDEREF)) {
7058 op_null(o->op_next);
7059 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
7061 o->op_next = o->op_next->op_next;
7062 o->op_type = OP_GVSV;
7063 o->op_ppaddr = PL_ppaddr[OP_GVSV];
7066 else if (o->op_next->op_type == OP_RV2AV) {
7067 OP* pop = o->op_next->op_next;
7069 if (pop && pop->op_type == OP_CONST &&
7070 (PL_op = pop->op_next) &&
7071 pop->op_next->op_type == OP_AELEM &&
7072 !(pop->op_next->op_private &
7073 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
7074 (i = SvIV(((SVOP*)pop)->op_sv) - PL_curcop->cop_arybase)
7079 op_null(o->op_next);
7080 op_null(pop->op_next);
7082 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
7083 o->op_next = pop->op_next->op_next;
7084 o->op_type = OP_AELEMFAST;
7085 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
7086 o->op_private = (U8)i;
7091 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
7093 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
7094 /* XXX could check prototype here instead of just carping */
7095 SV *sv = sv_newmortal();
7096 gv_efullname3(sv, gv, Nullch);
7097 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
7098 "%s() called too early to check prototype",
7102 else if (o->op_next->op_type == OP_READLINE
7103 && o->op_next->op_next->op_type == OP_CONCAT
7104 && (o->op_next->op_next->op_flags & OPf_STACKED))
7106 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
7107 o->op_type = OP_RCATLINE;
7108 o->op_flags |= OPf_STACKED;
7109 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
7110 op_null(o->op_next->op_next);
7111 op_null(o->op_next);
7114 o->op_seq = PL_op_seqmax++;
7125 o->op_seq = PL_op_seqmax++;
7126 while (cLOGOP->op_other->op_type == OP_NULL)
7127 cLOGOP->op_other = cLOGOP->op_other->op_next;
7128 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
7133 o->op_seq = PL_op_seqmax++;
7134 while (cLOOP->op_redoop->op_type == OP_NULL)
7135 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
7136 peep(cLOOP->op_redoop);
7137 while (cLOOP->op_nextop->op_type == OP_NULL)
7138 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
7139 peep(cLOOP->op_nextop);
7140 while (cLOOP->op_lastop->op_type == OP_NULL)
7141 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
7142 peep(cLOOP->op_lastop);
7148 o->op_seq = PL_op_seqmax++;
7149 while (cPMOP->op_pmreplstart &&
7150 cPMOP->op_pmreplstart->op_type == OP_NULL)
7151 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
7152 peep(cPMOP->op_pmreplstart);
7156 o->op_seq = PL_op_seqmax++;
7157 if (ckWARN(WARN_SYNTAX) && o->op_next
7158 && o->op_next->op_type == OP_NEXTSTATE) {
7159 if (o->op_next->op_sibling &&
7160 o->op_next->op_sibling->op_type != OP_EXIT &&
7161 o->op_next->op_sibling->op_type != OP_WARN &&
7162 o->op_next->op_sibling->op_type != OP_DIE) {
7163 line_t oldline = CopLINE(PL_curcop);
7165 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
7166 Perl_warner(aTHX_ packWARN(WARN_EXEC),
7167 "Statement unlikely to be reached");
7168 Perl_warner(aTHX_ packWARN(WARN_EXEC),
7169 "\t(Maybe you meant system() when you said exec()?)\n");
7170 CopLINE_set(PL_curcop, oldline);
7179 SV **svp, **indsvp, *sv;
7184 o->op_seq = PL_op_seqmax++;
7186 if (((BINOP*)o)->op_last->op_type != OP_CONST)
7189 /* Make the CONST have a shared SV */
7190 svp = cSVOPx_svp(((BINOP*)o)->op_last);
7191 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
7192 key = SvPV(sv, keylen);
7193 lexname = newSVpvn_share(key,
7194 SvUTF8(sv) ? -(I32)keylen : keylen,
7200 if ((o->op_private & (OPpLVAL_INTRO)))
7203 rop = (UNOP*)((BINOP*)o)->op_first;
7204 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
7206 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
7207 if (!(SvFLAGS(lexname) & SVpad_TYPED))
7209 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
7210 if (!fields || !GvHV(*fields))
7212 key = SvPV(*svp, keylen);
7213 indsvp = hv_fetch(GvHV(*fields), key,
7214 SvUTF8(*svp) ? -(I32)keylen : keylen, FALSE);
7216 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
7217 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
7219 ind = SvIV(*indsvp);
7221 Perl_croak(aTHX_ "Bad index while coercing array into hash");
7222 rop->op_type = OP_RV2AV;
7223 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
7224 o->op_type = OP_AELEM;
7225 o->op_ppaddr = PL_ppaddr[OP_AELEM];
7227 if (SvREADONLY(*svp))
7229 SvFLAGS(sv) |= (SvFLAGS(*svp)
7230 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
7240 SV **svp, **indsvp, *sv;
7244 SVOP *first_key_op, *key_op;
7246 o->op_seq = PL_op_seqmax++;
7247 if ((o->op_private & (OPpLVAL_INTRO))
7248 /* I bet there's always a pushmark... */
7249 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
7250 /* hmmm, no optimization if list contains only one key. */
7252 rop = (UNOP*)((LISTOP*)o)->op_last;
7253 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
7255 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
7256 if (!(SvFLAGS(lexname) & SVpad_TYPED))
7258 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
7259 if (!fields || !GvHV(*fields))
7261 /* Again guessing that the pushmark can be jumped over.... */
7262 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
7263 ->op_first->op_sibling;
7264 /* Check that the key list contains only constants. */
7265 for (key_op = first_key_op; key_op;
7266 key_op = (SVOP*)key_op->op_sibling)
7267 if (key_op->op_type != OP_CONST)
7271 rop->op_type = OP_RV2AV;
7272 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
7273 o->op_type = OP_ASLICE;
7274 o->op_ppaddr = PL_ppaddr[OP_ASLICE];
7275 for (key_op = first_key_op; key_op;
7276 key_op = (SVOP*)key_op->op_sibling) {
7277 svp = cSVOPx_svp(key_op);
7278 key = SvPV(*svp, keylen);
7279 indsvp = hv_fetch(GvHV(*fields), key,
7280 SvUTF8(*svp) ? -(I32)keylen : keylen, FALSE);
7282 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" "
7283 "in variable %s of type %s",
7284 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
7286 ind = SvIV(*indsvp);
7288 Perl_croak(aTHX_ "Bad index while coercing array into hash");
7290 if (SvREADONLY(*svp))
7292 SvFLAGS(sv) |= (SvFLAGS(*svp)
7293 & (SVs_PADBUSY|SVs_PADTMP|SVs_PADMY));
7301 o->op_seq = PL_op_seqmax++;
7311 char* Perl_custom_op_name(pTHX_ OP* o)
7313 IV index = PTR2IV(o->op_ppaddr);
7317 if (!PL_custom_op_names) /* This probably shouldn't happen */
7318 return PL_op_name[OP_CUSTOM];
7320 keysv = sv_2mortal(newSViv(index));
7322 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
7324 return PL_op_name[OP_CUSTOM]; /* Don't know who you are */
7326 return SvPV_nolen(HeVAL(he));
7329 char* Perl_custom_op_desc(pTHX_ OP* o)
7331 IV index = PTR2IV(o->op_ppaddr);
7335 if (!PL_custom_op_descs)
7336 return PL_op_desc[OP_CUSTOM];
7338 keysv = sv_2mortal(newSViv(index));
7340 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
7342 return PL_op_desc[OP_CUSTOM];
7344 return SvPV_nolen(HeVAL(he));
7350 /* Efficient sub that returns a constant scalar value. */
7352 const_sv_xsub(pTHX_ CV* cv)
7357 Perl_croak(aTHX_ "usage: %s::%s()",
7358 HvNAME(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
7362 ST(0) = (SV*)XSANY.any_ptr;