3 * Copyright (c) 1991-1999, 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
23 /* #define PL_OP_SLAB_ALLOC */
27 # define OP_REFCNT_LOCK NOOP
28 # define OP_REFCNT_UNLOCK NOOP
29 # define OpREFCNT_set(o,n) ((o)->op_targ = (n))
30 # define OpREFCNT_dec(o) (--(o)->op_targ)
32 # define OP_REFCNT_LOCK NOOP
33 # define OP_REFCNT_UNLOCK NOOP
34 # define OpREFCNT_set(o,n) NOOP
35 # define OpREFCNT_dec(o) 0
38 #ifdef PL_OP_SLAB_ALLOC
39 #define SLAB_SIZE 8192
40 static char *PL_OpPtr = NULL;
41 static int PL_OpSpace = 0;
42 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
43 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
45 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
49 S_Slab_Alloc(pTHX_ int m, size_t sz)
51 Newz(m,PL_OpPtr,SLAB_SIZE,char);
52 PL_OpSpace = SLAB_SIZE - sz;
53 return PL_OpPtr += PL_OpSpace;
57 #define NewOp(m, var, c, type) Newz(m, var, c, type)
60 * In the following definition, the ", Nullop" is just to make the compiler
61 * think the expression is of the right type: croak actually does a Siglongjmp.
63 #define CHECKOP(type,o) \
64 ((PL_op_mask && PL_op_mask[type]) \
65 ? ( op_free((OP*)o), \
66 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
68 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
70 #define PAD_MAX 999999999
73 S_gv_ename(pTHX_ GV *gv)
76 SV* tmpsv = sv_newmortal();
77 gv_efullname3(tmpsv, gv, Nullch);
78 return SvPV(tmpsv,n_a);
82 S_no_fh_allowed(pTHX_ OP *o)
84 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
85 PL_op_desc[o->op_type]));
90 S_too_few_arguments(pTHX_ OP *o, char *name)
92 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
97 S_too_many_arguments(pTHX_ OP *o, char *name)
99 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
104 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
106 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
107 (int)n, name, t, PL_op_desc[kid->op_type]));
111 S_no_bareword_allowed(pTHX_ OP *o)
113 qerror(Perl_mess(aTHX_
114 "Bareword \"%s\" not allowed while \"strict subs\" in use",
115 SvPV_nolen(cSVOPo_sv)));
118 /* "register" allocation */
121 Perl_pad_allocmy(pTHX_ char *name)
128 PL_in_my == KEY_our ||
130 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
131 name[1] == '_' && (int)strlen(name) > 2 ))
133 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
134 /* 1999-02-27 mjd@plover.com */
136 p = strchr(name, '\0');
137 /* The next block assumes the buffer is at least 205 chars
138 long. At present, it's always at least 256 chars. */
140 strcpy(name+200, "...");
146 /* Move everything else down one character */
147 for (; p-name > 2; p--)
149 name[2] = toCTRL(name[1]);
152 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
154 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
155 SV **svp = AvARRAY(PL_comppad_name);
156 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
158 && sv != &PL_sv_undef
159 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
160 && strEQ(name, SvPVX(sv)))
162 Perl_warner(aTHX_ WARN_UNSAFE,
163 "\"%s\" variable %s masks earlier declaration in same %s",
164 (PL_in_my == KEY_our ? "our" : "my"),
166 (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
171 off = pad_alloc(OP_PADSV, SVs_PADMY);
173 sv_upgrade(sv, SVt_PVNV);
175 if (PL_in_my_stash) {
177 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
180 (void)SvUPGRADE(sv, SVt_PVMG);
181 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
184 if (PL_in_my == KEY_our)
185 SvFLAGS(sv) |= SVpad_OUR;
186 av_store(PL_comppad_name, off, sv);
187 SvNVX(sv) = (NV)PAD_MAX;
188 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
189 if (!PL_min_intro_pending)
190 PL_min_intro_pending = off;
191 PL_max_intro_pending = off;
193 av_store(PL_comppad, off, (SV*)newAV());
194 else if (*name == '%')
195 av_store(PL_comppad, off, (SV*)newHV());
196 SvPADMY_on(PL_curpad[off]);
200 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
203 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
204 I32 cx_ix, I32 saweval, U32 flags)
211 register PERL_CONTEXT *cx;
213 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
214 AV *curlist = CvPADLIST(cv);
215 SV **svp = av_fetch(curlist, 0, FALSE);
218 if (!svp || *svp == &PL_sv_undef)
221 svp = AvARRAY(curname);
222 for (off = AvFILLp(curname); off > 0; off--) {
223 if ((sv = svp[off]) &&
224 sv != &PL_sv_undef &&
226 seq > I_32(SvNVX(sv)) &&
227 strEQ(SvPVX(sv), name))
238 return 0; /* don't clone from inactive stack frame */
242 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
243 oldsv = *av_fetch(oldpad, off, TRUE);
244 if (!newoff) { /* Not a mere clone operation. */
245 SV *namesv = NEWSV(1103,0);
246 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
247 sv_upgrade(namesv, SVt_PVNV);
248 sv_setpv(namesv, name);
249 av_store(PL_comppad_name, newoff, namesv);
250 SvNVX(namesv) = (NV)PL_curcop->cop_seq;
251 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
252 SvFAKE_on(namesv); /* A ref, not a real var */
253 if (SvFLAGS(sv) & SVpad_OUR)/* An "our" variable */
254 SvFLAGS(namesv) |= SVpad_OUR;
255 if (SvOBJECT(sv)) { /* A typed var */
257 (void)SvUPGRADE(namesv, SVt_PVMG);
258 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
261 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
262 /* "It's closures all the way down." */
263 CvCLONE_on(PL_compcv);
265 if (CvANON(PL_compcv))
266 oldsv = Nullsv; /* no need to keep ref */
271 bcv && bcv != cv && !CvCLONE(bcv);
272 bcv = CvOUTSIDE(bcv))
277 if (ckWARN(WARN_CLOSURE)
278 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
280 Perl_warner(aTHX_ WARN_CLOSURE,
281 "Variable \"%s\" may be unavailable",
289 else if (!CvUNIQUE(PL_compcv)) {
290 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
291 Perl_warner(aTHX_ WARN_CLOSURE,
292 "Variable \"%s\" will not stay shared", name);
295 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
301 if (flags & FINDLEX_NOSEARCH)
304 /* Nothing in current lexical context--try eval's context, if any.
305 * This is necessary to let the perldb get at lexically scoped variables.
306 * XXX This will also probably interact badly with eval tree caching.
309 for (i = cx_ix; i >= 0; i--) {
311 switch (CxTYPE(cx)) {
313 if (i == 0 && saweval) {
314 seq = cxstack[saweval].blk_oldcop->cop_seq;
315 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
319 switch (cx->blk_eval.old_op_type) {
325 /* require must have its own scope */
334 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
335 saweval = i; /* so we know where we were called from */
338 seq = cxstack[saweval].blk_oldcop->cop_seq;
339 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
347 Perl_pad_findmy(pTHX_ char *name)
353 SV **svp = AvARRAY(PL_comppad_name);
354 U32 seq = PL_cop_seqmax;
360 * Special case to get lexical (and hence per-thread) @_.
361 * XXX I need to find out how to tell at parse-time whether use
362 * of @_ should refer to a lexical (from a sub) or defgv (global
363 * scope and maybe weird sub-ish things like formats). See
364 * startsub in perly.y. It's possible that @_ could be lexical
365 * (at least from subs) even in non-threaded perl.
367 if (strEQ(name, "@_"))
368 return 0; /* success. (NOT_IN_PAD indicates failure) */
369 #endif /* USE_THREADS */
371 /* The one we're looking for is probably just before comppad_name_fill. */
372 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
373 if ((sv = svp[off]) &&
374 sv != &PL_sv_undef &&
377 seq > I_32(SvNVX(sv)))) &&
378 strEQ(SvPVX(sv), name))
380 if (SvIVX(sv) || SvFLAGS(sv) & SVpad_OUR)
381 return (PADOFFSET)off;
382 pendoff = off; /* this pending def. will override import */
386 outside = CvOUTSIDE(PL_compcv);
388 /* Check if if we're compiling an eval'', and adjust seq to be the
389 * eval's seq number. This depends on eval'' having a non-null
390 * CvOUTSIDE() while it is being compiled. The eval'' itself is
391 * identified by CvEVAL being true and CvGV being null. */
392 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
393 cx = &cxstack[cxstack_ix];
395 seq = cx->blk_oldcop->cop_seq;
398 /* See if it's in a nested scope */
399 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
401 /* If there is a pending local definition, this new alias must die */
403 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
404 return off; /* pad_findlex returns 0 for failure...*/
406 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
410 Perl_pad_leavemy(pTHX_ I32 fill)
414 SV **svp = AvARRAY(PL_comppad_name);
416 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
417 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
418 if ((sv = svp[off]) && sv != &PL_sv_undef && ckWARN_d(WARN_INTERNAL))
419 Perl_warner(aTHX_ WARN_INTERNAL, "%s never introduced", SvPVX(sv));
422 /* "Deintroduce" my variables that are leaving with this scope. */
423 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
424 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
425 SvIVX(sv) = PL_cop_seqmax;
430 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
436 if (AvARRAY(PL_comppad) != PL_curpad)
437 Perl_croak(aTHX_ "panic: pad_alloc");
438 if (PL_pad_reset_pending)
440 if (tmptype & SVs_PADMY) {
442 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
443 } while (SvPADBUSY(sv)); /* need a fresh one */
444 retval = AvFILLp(PL_comppad);
447 SV **names = AvARRAY(PL_comppad_name);
448 SSize_t names_fill = AvFILLp(PL_comppad_name);
451 * "foreach" index vars temporarily become aliases to non-"my"
452 * values. Thus we must skip, not just pad values that are
453 * marked as current pad values, but also those with names.
455 if (++PL_padix <= names_fill &&
456 (sv = names[PL_padix]) && sv != &PL_sv_undef)
458 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
459 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)) && !IS_PADGV(sv))
464 SvFLAGS(sv) |= tmptype;
465 PL_curpad = AvARRAY(PL_comppad);
467 DEBUG_X(PerlIO_printf(Perl_debug_log,
468 "0x%"UVxf" Pad 0x%"UVxf" alloc %ld for %s\n",
469 PTR2UV(thr), PTR2UV(PL_curpad),
470 (long) retval, PL_op_name[optype]));
472 DEBUG_X(PerlIO_printf(Perl_debug_log,
473 "Pad 0x%"UVxf" alloc %ld for %s\n",
475 (long) retval, PL_op_name[optype]));
476 #endif /* USE_THREADS */
477 return (PADOFFSET)retval;
481 Perl_pad_sv(pTHX_ PADOFFSET po)
485 DEBUG_X(PerlIO_printf(Perl_debug_log,
486 "0x%"UVxf" Pad 0x%"UVxf" sv %"IVdf"\n",
487 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
490 Perl_croak(aTHX_ "panic: pad_sv po");
491 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" sv %"IVdf"\n",
492 PTR2UV(PL_curpad), (IV)po));
493 #endif /* USE_THREADS */
494 return PL_curpad[po]; /* eventually we'll turn this into a macro */
498 Perl_pad_free(pTHX_ PADOFFSET po)
503 if (AvARRAY(PL_comppad) != PL_curpad)
504 Perl_croak(aTHX_ "panic: pad_free curpad");
506 Perl_croak(aTHX_ "panic: pad_free po");
508 DEBUG_X(PerlIO_printf(Perl_debug_log,
509 "0x%"UVxf" Pad 0x%"UVxf" free %"IVdf"\n",
510 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
512 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" free %"IVdf"\n",
513 PTR2UV(PL_curpad), (IV)po));
514 #endif /* USE_THREADS */
515 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
516 SvPADTMP_off(PL_curpad[po]);
517 if ((I32)po < PL_padix)
522 Perl_pad_swipe(pTHX_ PADOFFSET po)
525 if (AvARRAY(PL_comppad) != PL_curpad)
526 Perl_croak(aTHX_ "panic: pad_swipe curpad");
528 Perl_croak(aTHX_ "panic: pad_swipe po");
530 DEBUG_X(PerlIO_printf(Perl_debug_log,
531 "0x%"UVxf" Pad 0x%"UVxf" swipe %"IVdf"\n",
532 PTR2UV(thr), PTR2UV(PL_curpad), (IV)po));
534 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" swipe %"IVdf"\n",
535 PTR2UV(PL_curpad), (IV)po));
536 #endif /* USE_THREADS */
537 SvPADTMP_off(PL_curpad[po]);
538 PL_curpad[po] = NEWSV(1107,0);
539 SvPADTMP_on(PL_curpad[po]);
540 if ((I32)po < PL_padix)
544 /* XXX pad_reset() is currently disabled because it results in serious bugs.
545 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
546 * on the stack by OPs that use them, there are several ways to get an alias
547 * to a shared TARG. Such an alias will change randomly and unpredictably.
548 * We avoid doing this until we can think of a Better Way.
553 #ifdef USE_BROKEN_PAD_RESET
557 if (AvARRAY(PL_comppad) != PL_curpad)
558 Perl_croak(aTHX_ "panic: pad_reset curpad");
560 DEBUG_X(PerlIO_printf(Perl_debug_log,
561 "0x%"UVxf" Pad 0x%"UVxf" reset\n",
562 PTR2UV(thr), PTR2UV(PL_curpad)));
564 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%"UVxf" reset\n",
566 #endif /* USE_THREADS */
567 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
568 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
569 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
570 SvPADTMP_off(PL_curpad[po]);
572 PL_padix = PL_padix_floor;
575 PL_pad_reset_pending = FALSE;
579 /* find_threadsv is not reentrant */
581 Perl_find_threadsv(pTHX_ const char *name)
587 /* We currently only handle names of a single character */
588 p = strchr(PL_threadsv_names, *name);
591 key = p - PL_threadsv_names;
592 MUTEX_LOCK(&thr->mutex);
593 svp = av_fetch(thr->threadsv, key, FALSE);
595 MUTEX_UNLOCK(&thr->mutex);
597 SV *sv = NEWSV(0, 0);
598 av_store(thr->threadsv, key, sv);
599 thr->threadsvp = AvARRAY(thr->threadsv);
600 MUTEX_UNLOCK(&thr->mutex);
602 * Some magic variables used to be automagically initialised
603 * in gv_fetchpv. Those which are now per-thread magicals get
604 * initialised here instead.
610 sv_setpv(sv, "\034");
611 sv_magic(sv, 0, 0, name, 1);
616 PL_sawampersand = TRUE;
630 /* XXX %! tied to Errno.pm needs to be added here.
631 * See gv_fetchpv(). */
635 sv_magic(sv, 0, 0, name, 1);
637 DEBUG_S(PerlIO_printf(Perl_error_log,
638 "find_threadsv: new SV %p for $%s%c\n",
639 sv, (*name < 32) ? "^" : "",
640 (*name < 32) ? toCTRL(*name) : *name));
644 #endif /* USE_THREADS */
649 Perl_op_free(pTHX_ OP *o)
651 register OP *kid, *nextkid;
654 if (!o || o->op_seq == (U16)-1)
657 if (o->op_private & OPpREFCOUNTED) {
658 switch (o->op_type) {
666 if (OpREFCNT_dec(o)) {
677 if (o->op_flags & OPf_KIDS) {
678 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
679 nextkid = kid->op_sibling; /* Get before next freeing kid */
687 /* COP* is not cleared by op_clear() so that we may track line
688 * numbers etc even after null() */
689 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
694 #ifdef PL_OP_SLAB_ALLOC
695 if ((char *) o == PL_OpPtr)
704 S_op_clear(pTHX_ OP *o)
706 switch (o->op_type) {
707 case OP_NULL: /* Was holding old type, if any. */
708 case OP_ENTEREVAL: /* Was holding hints. */
710 case OP_THREADSV: /* Was holding index into thr->threadsv AV. */
716 if (!(o->op_flags & OPf_SPECIAL))
719 #endif /* USE_THREADS */
721 if (!(o->op_flags & OPf_REF)
722 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
729 if (cPADOPo->op_padix > 0) {
732 pad_swipe(cPADOPo->op_padix);
733 /* No GvIN_PAD_off(gv) here, because other references may still
734 * exist on the pad */
737 cPADOPo->op_padix = 0;
740 SvREFCNT_dec(cSVOPo->op_sv);
741 cSVOPo->op_sv = Nullsv;
745 SvREFCNT_dec(cSVOPo->op_sv);
746 cSVOPo->op_sv = Nullsv;
752 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
756 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
757 SvREFCNT_dec(cSVOPo->op_sv);
758 cSVOPo->op_sv = Nullsv;
761 Safefree(cPVOPo->op_pv);
762 cPVOPo->op_pv = Nullch;
766 op_free(cPMOPo->op_pmreplroot);
770 if ((PADOFFSET)cPMOPo->op_pmreplroot) {
772 GV *gv = (GV*)PL_curpad[(PADOFFSET)cPMOPo->op_pmreplroot];
773 pad_swipe((PADOFFSET)cPMOPo->op_pmreplroot);
774 /* No GvIN_PAD_off(gv) here, because other references may still
775 * exist on the pad */
780 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
786 cPMOPo->op_pmreplroot = Nullop;
787 ReREFCNT_dec(cPMOPo->op_pmregexp);
788 cPMOPo->op_pmregexp = (REGEXP*)NULL;
792 if (o->op_targ > 0) {
793 pad_free(o->op_targ);
799 S_cop_free(pTHX_ COP* cop)
801 Safefree(cop->cop_label);
803 Safefree(CopFILE(cop)); /* XXXXX share in a pvtable? */
804 Safefree(CopSTASHPV(cop)); /* XXXXX share in a pvtable? */
806 /* NOTE: COP.cop_stash is not refcounted */
807 SvREFCNT_dec(CopFILEGV(cop));
809 if (! specialWARN(cop->cop_warnings))
810 SvREFCNT_dec(cop->cop_warnings);
816 if (o->op_type == OP_NULL)
819 o->op_targ = o->op_type;
820 o->op_type = OP_NULL;
821 o->op_ppaddr = PL_ppaddr[OP_NULL];
824 /* Contextualizers */
826 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
829 Perl_linklist(pTHX_ OP *o)
836 /* establish postfix order */
837 if (cUNOPo->op_first) {
838 o->op_next = LINKLIST(cUNOPo->op_first);
839 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
841 kid->op_next = LINKLIST(kid->op_sibling);
853 Perl_scalarkids(pTHX_ OP *o)
856 if (o && o->op_flags & OPf_KIDS) {
857 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
864 S_scalarboolean(pTHX_ OP *o)
866 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
868 if (ckWARN(WARN_SYNTAX)) {
869 line_t oldline = CopLINE(PL_curcop);
871 if (PL_copline != NOLINE)
872 CopLINE_set(PL_curcop, PL_copline);
873 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
874 CopLINE_set(PL_curcop, oldline);
881 Perl_scalar(pTHX_ OP *o)
885 /* assumes no premature commitment */
886 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
887 || o->op_type == OP_RETURN)
892 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
894 switch (o->op_type) {
896 if (o->op_private & OPpREPEAT_DOLIST)
897 null(((LISTOP*)cBINOPo->op_first)->op_first);
898 scalar(cBINOPo->op_first);
903 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
907 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
908 if (!kPMOP->op_pmreplroot)
909 deprecate("implicit split to @_");
917 if (o->op_flags & OPf_KIDS) {
918 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
924 kid = cLISTOPo->op_first;
926 while (kid = kid->op_sibling) {
932 WITH_THR(PL_curcop = &PL_compiling);
937 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
943 WITH_THR(PL_curcop = &PL_compiling);
950 Perl_scalarvoid(pTHX_ OP *o)
957 if (o->op_type == OP_NEXTSTATE
958 || o->op_type == OP_SETSTATE
959 || o->op_type == OP_DBSTATE
960 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
961 || o->op_targ == OP_SETSTATE
962 || o->op_targ == OP_DBSTATE)))
965 PL_curcop = (COP*)o; /* for warning below */
968 /* assumes no premature commitment */
969 want = o->op_flags & OPf_WANT;
970 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
971 || o->op_type == OP_RETURN)
976 if ((o->op_private & OPpTARGET_MY)
977 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
979 return scalar(o); /* As if inside SASSIGN */
982 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
984 switch (o->op_type) {
986 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
990 if (o->op_flags & OPf_STACKED)
994 if (o->op_private == 4)
1036 case OP_GETSOCKNAME:
1037 case OP_GETPEERNAME:
1042 case OP_GETPRIORITY:
1065 if (!(o->op_private & OPpLVAL_INTRO))
1066 useless = PL_op_desc[o->op_type];
1073 if (!(o->op_private & OPpLVAL_INTRO) &&
1074 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1075 useless = "a variable";
1080 if (cSVOPo->op_private & OPpCONST_STRICT)
1081 no_bareword_allowed(o);
1084 if (ckWARN(WARN_VOID)) {
1085 useless = "a constant";
1086 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1088 else if (SvPOK(sv)) {
1089 if (strnEQ(SvPVX(sv), "di", 2) ||
1090 strnEQ(SvPVX(sv), "ds", 2) ||
1091 strnEQ(SvPVX(sv), "ig", 2))
1096 null(o); /* don't execute or even remember it */
1100 o->op_type = OP_PREINC; /* pre-increment is faster */
1101 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1105 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1106 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1112 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1117 if (o->op_flags & OPf_STACKED)
1125 if (!(o->op_flags & OPf_KIDS))
1134 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1141 /* all requires must return a boolean value */
1142 o->op_flags &= ~OPf_WANT;
1145 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1146 if (!kPMOP->op_pmreplroot)
1147 deprecate("implicit split to @_");
1153 if (ckWARN(WARN_VOID))
1154 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1160 Perl_listkids(pTHX_ OP *o)
1163 if (o && o->op_flags & OPf_KIDS) {
1164 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1171 Perl_list(pTHX_ OP *o)
1175 /* assumes no premature commitment */
1176 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1177 || o->op_type == OP_RETURN)
1182 if ((o->op_private & OPpTARGET_MY)
1183 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1185 return o; /* As if inside SASSIGN */
1188 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1190 switch (o->op_type) {
1193 list(cBINOPo->op_first);
1198 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1206 if (!(o->op_flags & OPf_KIDS))
1208 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1209 list(cBINOPo->op_first);
1210 return gen_constant_list(o);
1217 kid = cLISTOPo->op_first;
1219 while (kid = kid->op_sibling) {
1220 if (kid->op_sibling)
1225 WITH_THR(PL_curcop = &PL_compiling);
1229 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1230 if (kid->op_sibling)
1235 WITH_THR(PL_curcop = &PL_compiling);
1238 /* all requires must return a boolean value */
1239 o->op_flags &= ~OPf_WANT;
1246 Perl_scalarseq(pTHX_ OP *o)
1251 if (o->op_type == OP_LINESEQ ||
1252 o->op_type == OP_SCOPE ||
1253 o->op_type == OP_LEAVE ||
1254 o->op_type == OP_LEAVETRY)
1257 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1258 if (kid->op_sibling) {
1262 PL_curcop = &PL_compiling;
1264 o->op_flags &= ~OPf_PARENS;
1265 if (PL_hints & HINT_BLOCK_SCOPE)
1266 o->op_flags |= OPf_PARENS;
1269 o = newOP(OP_STUB, 0);
1274 S_modkids(pTHX_ OP *o, I32 type)
1277 if (o && o->op_flags & OPf_KIDS) {
1278 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1285 Perl_mod(pTHX_ OP *o, I32 type)
1292 if (!o || PL_error_count)
1295 if ((o->op_private & OPpTARGET_MY)
1296 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1301 switch (o->op_type) {
1306 if (!(o->op_private & (OPpCONST_ARYBASE)))
1308 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1309 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
1313 SAVEI32(PL_compiling.cop_arybase);
1314 PL_compiling.cop_arybase = 0;
1316 else if (type == OP_REFGEN)
1319 Perl_croak(aTHX_ "That use of $[ is unsupported");
1322 if (o->op_flags & OPf_PARENS)
1326 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1327 !(o->op_flags & OPf_STACKED)) {
1328 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1329 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1330 assert(cUNOPo->op_first->op_type == OP_NULL);
1331 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1334 else { /* lvalue subroutine call */
1335 o->op_private |= OPpLVAL_INTRO;
1336 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1337 /* Backward compatibility mode: */
1338 o->op_private |= OPpENTERSUB_INARGS;
1341 else { /* Compile-time error message: */
1342 OP *kid = cUNOPo->op_first;
1346 if (kid->op_type == OP_PUSHMARK)
1348 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1350 "panic: unexpected lvalue entersub "
1351 "args: type/targ %ld:%ld",
1352 (long)kid->op_type,kid->op_targ);
1353 kid = kLISTOP->op_first;
1355 while (kid->op_sibling)
1356 kid = kid->op_sibling;
1357 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1359 if (kid->op_type == OP_METHOD_NAMED
1360 || kid->op_type == OP_METHOD)
1364 if (kid->op_sibling || kid->op_next != kid) {
1365 yyerror("panic: unexpected optree near method call");
1369 NewOp(1101, newop, 1, OP);
1370 newop->op_type = OP_RV2CV;
1371 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1372 newop->op_next = newop;
1373 kid->op_sibling = newop;
1374 newop->op_private |= OPpLVAL_INTRO;
1378 if (kid->op_type != OP_RV2CV)
1380 "panic: unexpected lvalue entersub "
1381 "entry via type/targ %ld:%ld",
1382 (long)kid->op_type,kid->op_targ);
1383 kid->op_private |= OPpLVAL_INTRO;
1384 break; /* Postpone until runtime */
1388 kid = kUNOP->op_first;
1389 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1390 kid = kUNOP->op_first;
1391 if (kid->op_type == OP_NULL)
1393 "Unexpected constant lvalue entersub "
1394 "entry via type/targ %ld:%ld",
1395 (long)kid->op_type,kid->op_targ);
1396 if (kid->op_type != OP_GV) {
1397 /* Restore RV2CV to check lvalueness */
1399 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1400 okid->op_next = kid->op_next;
1401 kid->op_next = okid;
1404 okid->op_next = Nullop;
1405 okid->op_type = OP_RV2CV;
1407 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1408 okid->op_private |= OPpLVAL_INTRO;
1412 cv = GvCV(kGVOP_gv);
1422 /* grep, foreach, subcalls, refgen */
1423 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1425 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1426 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1428 : (o->op_type == OP_ENTERSUB
1429 ? "non-lvalue subroutine call"
1430 : PL_op_desc[o->op_type])),
1431 type ? PL_op_desc[type] : "local"));
1445 case OP_RIGHT_SHIFT:
1454 if (!(o->op_flags & OPf_STACKED))
1460 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1466 if (!type && cUNOPo->op_first->op_type != OP_GV)
1467 Perl_croak(aTHX_ "Can't localize through a reference");
1468 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1469 PL_modcount = 10000;
1470 return o; /* Treat \(@foo) like ordinary list. */
1474 if (scalar_mod_type(o, type))
1476 ref(cUNOPo->op_first, o->op_type);
1485 PL_modcount = 10000;
1488 if (!type && cUNOPo->op_first->op_type != OP_GV)
1489 Perl_croak(aTHX_ "Can't localize through a reference");
1490 ref(cUNOPo->op_first, o->op_type);
1494 PL_hints |= HINT_BLOCK_SCOPE;
1504 PL_modcount = 10000;
1505 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1506 return o; /* Treat \(@foo) like ordinary list. */
1507 if (scalar_mod_type(o, type))
1513 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1514 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1519 PL_modcount++; /* XXX ??? */
1521 #endif /* USE_THREADS */
1527 if (type != OP_SASSIGN)
1531 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1537 pad_free(o->op_targ);
1538 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1539 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1540 if (o->op_flags & OPf_KIDS)
1541 mod(cBINOPo->op_first->op_sibling, type);
1546 ref(cBINOPo->op_first, o->op_type);
1547 if (type == OP_ENTERSUB &&
1548 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1549 o->op_private |= OPpLVAL_DEFER;
1556 if (o->op_flags & OPf_KIDS)
1557 mod(cLISTOPo->op_last, type);
1561 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1563 else if (!(o->op_flags & OPf_KIDS))
1565 if (o->op_targ != OP_LIST) {
1566 mod(cBINOPo->op_first, type);
1571 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1575 o->op_flags |= OPf_MOD;
1577 if (type == OP_AASSIGN || type == OP_SASSIGN)
1578 o->op_flags |= OPf_SPECIAL|OPf_REF;
1580 o->op_private |= OPpLVAL_INTRO;
1581 o->op_flags &= ~OPf_SPECIAL;
1582 PL_hints |= HINT_BLOCK_SCOPE;
1584 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1585 o->op_flags |= OPf_REF;
1590 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1594 if (o->op_type == OP_RV2GV)
1618 case OP_RIGHT_SHIFT:
1637 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1639 switch (o->op_type) {
1647 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1660 Perl_refkids(pTHX_ OP *o, I32 type)
1663 if (o && o->op_flags & OPf_KIDS) {
1664 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1671 Perl_ref(pTHX_ OP *o, I32 type)
1675 if (!o || PL_error_count)
1678 switch (o->op_type) {
1680 if ((type == OP_DEFINED || type == OP_LOCK) &&
1681 !(o->op_flags & OPf_STACKED)) {
1682 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1683 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1684 assert(cUNOPo->op_first->op_type == OP_NULL);
1685 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1686 o->op_flags |= OPf_SPECIAL;
1691 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1695 if (type == OP_DEFINED)
1696 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1697 ref(cUNOPo->op_first, o->op_type);
1700 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1701 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1702 : type == OP_RV2HV ? OPpDEREF_HV
1704 o->op_flags |= OPf_MOD;
1709 o->op_flags |= OPf_MOD; /* XXX ??? */
1714 o->op_flags |= OPf_REF;
1717 if (type == OP_DEFINED)
1718 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1719 ref(cUNOPo->op_first, o->op_type);
1724 o->op_flags |= OPf_REF;
1729 if (!(o->op_flags & OPf_KIDS))
1731 ref(cBINOPo->op_first, type);
1735 ref(cBINOPo->op_first, o->op_type);
1736 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1737 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1738 : type == OP_RV2HV ? OPpDEREF_HV
1740 o->op_flags |= OPf_MOD;
1748 if (!(o->op_flags & OPf_KIDS))
1750 ref(cLISTOPo->op_last, type);
1760 S_dup_attrlist(pTHX_ OP *o)
1764 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1765 * where the first kid is OP_PUSHMARK and the remaining ones
1766 * are OP_CONST. We need to push the OP_CONST values.
1768 if (o->op_type == OP_CONST)
1769 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1771 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1772 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1773 if (o->op_type == OP_CONST)
1774 rop = append_elem(OP_LIST, rop,
1775 newSVOP(OP_CONST, o->op_flags,
1776 SvREFCNT_inc(cSVOPo->op_sv)));
1783 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
1785 OP *modname; /* for 'use' */
1788 /* fake up C<use attributes $pkg,$rv,@attrs> */
1789 ENTER; /* need to protect against side-effects of 'use' */
1791 if (stash && HvNAME(stash))
1792 stashsv = newSVpv(HvNAME(stash), 0);
1794 stashsv = &PL_sv_no;
1795 #define ATTRSMODULE "attributes"
1796 modname = newSVOP(OP_CONST, 0,
1797 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1798 modname->op_private |= OPpCONST_BARE;
1799 /* that flag is required to make 'use' work right */
1800 utilize(1, start_subparse(FALSE, 0),
1801 Nullop, /* version */
1803 prepend_elem(OP_LIST,
1804 newSVOP(OP_CONST, 0, stashsv),
1805 prepend_elem(OP_LIST,
1806 newSVOP(OP_CONST, 0, newRV(target)),
1807 dup_attrlist(attrs))));
1812 S_my_kid(pTHX_ OP *o, OP *attrs)
1817 if (!o || PL_error_count)
1821 if (type == OP_LIST) {
1822 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1824 } else if (type == OP_UNDEF) {
1826 } else if (type == OP_RV2SV || /* "our" declaration */
1828 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1830 } else if (type != OP_PADSV &&
1833 type != OP_PUSHMARK)
1835 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1838 else if (attrs && type != OP_PUSHMARK) {
1843 /* check for C<my Dog $spot> when deciding package */
1844 namesvp = av_fetch(PL_comppad_name, o->op_targ, FALSE);
1845 if (namesvp && *namesvp && SvOBJECT(*namesvp) && HvNAME(SvSTASH(*namesvp)))
1846 stash = SvSTASH(*namesvp);
1848 stash = PL_curstash;
1849 padsv = PAD_SV(o->op_targ);
1850 apply_attrs(stash, padsv, attrs);
1852 o->op_flags |= OPf_MOD;
1853 o->op_private |= OPpLVAL_INTRO;
1858 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1860 if (o->op_flags & OPf_PARENS)
1863 PL_in_my_stash = Nullhv;
1866 return my_kid(o, attrs);
1870 Perl_my(pTHX_ OP *o)
1872 return my_kid(o, Nullop);
1876 Perl_sawparens(pTHX_ OP *o)
1879 o->op_flags |= OPf_PARENS;
1884 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1889 if (ckWARN(WARN_UNSAFE) &&
1890 (left->op_type == OP_RV2AV ||
1891 left->op_type == OP_RV2HV ||
1892 left->op_type == OP_PADAV ||
1893 left->op_type == OP_PADHV)) {
1894 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1895 right->op_type == OP_TRANS)
1896 ? right->op_type : OP_MATCH];
1897 const char *sample = ((left->op_type == OP_RV2AV ||
1898 left->op_type == OP_PADAV)
1899 ? "@array" : "%hash");
1900 Perl_warner(aTHX_ WARN_UNSAFE,
1901 "Applying %s to %s will act on scalar(%s)",
1902 desc, sample, sample);
1905 if (right->op_type == OP_MATCH ||
1906 right->op_type == OP_SUBST ||
1907 right->op_type == OP_TRANS) {
1908 right->op_flags |= OPf_STACKED;
1909 if (right->op_type != OP_MATCH)
1910 left = mod(left, right->op_type);
1911 if (right->op_type == OP_TRANS)
1912 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1914 o = prepend_elem(right->op_type, scalar(left), right);
1916 return newUNOP(OP_NOT, 0, scalar(o));
1920 return bind_match(type, left,
1921 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1925 Perl_invert(pTHX_ OP *o)
1929 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1930 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1934 Perl_scope(pTHX_ OP *o)
1937 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1938 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1939 o->op_type = OP_LEAVE;
1940 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1943 if (o->op_type == OP_LINESEQ) {
1945 o->op_type = OP_SCOPE;
1946 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1947 kid = ((LISTOP*)o)->op_first;
1948 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1952 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1959 Perl_save_hints(pTHX)
1962 SAVESPTR(GvHV(PL_hintgv));
1963 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1964 SAVEFREESV(GvHV(PL_hintgv));
1968 Perl_block_start(pTHX_ int full)
1971 int retval = PL_savestack_ix;
1973 SAVEI32(PL_comppad_name_floor);
1975 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1976 PL_comppad_name_floor = PL_comppad_name_fill;
1978 PL_comppad_name_floor = 0;
1980 SAVEI32(PL_min_intro_pending);
1981 SAVEI32(PL_max_intro_pending);
1982 PL_min_intro_pending = 0;
1983 SAVEI32(PL_comppad_name_fill);
1984 SAVEI32(PL_padix_floor);
1985 PL_padix_floor = PL_padix;
1986 PL_pad_reset_pending = FALSE;
1988 PL_hints &= ~HINT_BLOCK_SCOPE;
1989 SAVESPTR(PL_compiling.cop_warnings);
1990 if (! specialWARN(PL_compiling.cop_warnings)) {
1991 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1992 SAVEFREESV(PL_compiling.cop_warnings) ;
2000 Perl_block_end(pTHX_ I32 floor, OP *seq)
2003 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2004 OP* retval = scalarseq(seq);
2006 PL_pad_reset_pending = FALSE;
2007 PL_compiling.op_private = PL_hints;
2009 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2010 pad_leavemy(PL_comppad_name_fill);
2019 OP *o = newOP(OP_THREADSV, 0);
2020 o->op_targ = find_threadsv("_");
2023 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2024 #endif /* USE_THREADS */
2028 Perl_newPROG(pTHX_ OP *o)
2034 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2035 ((PL_in_eval & EVAL_KEEPERR)
2036 ? OPf_SPECIAL : 0), o);
2037 PL_eval_start = linklist(PL_eval_root);
2038 PL_eval_root->op_private |= OPpREFCOUNTED;
2039 OpREFCNT_set(PL_eval_root, 1);
2040 PL_eval_root->op_next = 0;
2041 peep(PL_eval_start);
2046 PL_main_root = scope(sawparens(scalarvoid(o)));
2047 PL_curcop = &PL_compiling;
2048 PL_main_start = LINKLIST(PL_main_root);
2049 PL_main_root->op_private |= OPpREFCOUNTED;
2050 OpREFCNT_set(PL_main_root, 1);
2051 PL_main_root->op_next = 0;
2052 peep(PL_main_start);
2055 /* Register with debugger */
2057 CV *cv = get_cv("DB::postponed", FALSE);
2061 XPUSHs((SV*)CopFILEGV(&PL_compiling));
2063 call_sv((SV*)cv, G_DISCARD);
2070 Perl_localize(pTHX_ OP *o, I32 lex)
2072 if (o->op_flags & OPf_PARENS)
2076 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
2078 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
2079 if (*s == ';' || *s == '=')
2080 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
2081 lex ? "my" : "local");
2085 PL_in_my_stash = Nullhv;
2089 return mod(o, OP_NULL); /* a bit kludgey */
2093 Perl_jmaybe(pTHX_ OP *o)
2095 if (o->op_type == OP_LIST) {
2098 o2 = newOP(OP_THREADSV, 0);
2099 o2->op_targ = find_threadsv(";");
2101 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
2102 #endif /* USE_THREADS */
2103 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2109 Perl_fold_constants(pTHX_ register OP *o)
2113 I32 type = o->op_type;
2116 if (PL_opargs[type] & OA_RETSCALAR)
2118 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2119 o->op_targ = pad_alloc(type, SVs_PADTMP);
2121 /* integerize op, unless it happens to be C<-foo>.
2122 * XXX should pp_i_negate() do magic string negation instead? */
2123 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2124 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2125 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2127 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2130 if (!(PL_opargs[type] & OA_FOLDCONST))
2135 /* XXX might want a ck_negate() for this */
2136 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2149 if (o->op_private & OPpLOCALE)
2154 goto nope; /* Don't try to run w/ errors */
2156 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2157 if ((curop->op_type != OP_CONST ||
2158 (curop->op_private & OPpCONST_BARE)) &&
2159 curop->op_type != OP_LIST &&
2160 curop->op_type != OP_SCALAR &&
2161 curop->op_type != OP_NULL &&
2162 curop->op_type != OP_PUSHMARK)
2168 curop = LINKLIST(o);
2172 sv = *(PL_stack_sp--);
2173 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2174 pad_swipe(o->op_targ);
2175 else if (SvTEMP(sv)) { /* grab mortal temp? */
2176 (void)SvREFCNT_inc(sv);
2180 if (type == OP_RV2GV)
2181 return newGVOP(OP_GV, 0, (GV*)sv);
2183 /* try to smush double to int, but don't smush -2.0 to -2 */
2184 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
2188 if ((NV)iv == SvNV(sv)) {
2193 SvIOK_off(sv); /* undo SvIV() damage */
2195 return newSVOP(OP_CONST, 0, sv);
2199 if (!(PL_opargs[type] & OA_OTHERINT))
2202 if (!(PL_hints & HINT_INTEGER)) {
2203 if (type == OP_MODULO
2204 || type == OP_DIVIDE
2205 || !(o->op_flags & OPf_KIDS))
2210 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
2211 if (curop->op_type == OP_CONST) {
2212 if (SvIOK(((SVOP*)curop)->op_sv))
2216 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
2220 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
2227 Perl_gen_constant_list(pTHX_ register OP *o)
2231 I32 oldtmps_floor = PL_tmps_floor;
2235 return o; /* Don't attempt to run with errors */
2237 PL_op = curop = LINKLIST(o);
2244 PL_tmps_floor = oldtmps_floor;
2246 o->op_type = OP_RV2AV;
2247 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2248 curop = ((UNOP*)o)->op_first;
2249 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2256 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2261 if (!o || o->op_type != OP_LIST)
2262 o = newLISTOP(OP_LIST, 0, o, Nullop);
2264 o->op_flags &= ~OPf_WANT;
2266 if (!(PL_opargs[type] & OA_MARK))
2267 null(cLISTOPo->op_first);
2270 o->op_ppaddr = PL_ppaddr[type];
2271 o->op_flags |= flags;
2273 o = CHECKOP(type, o);
2274 if (o->op_type != type)
2277 if (cLISTOPo->op_children < 7) {
2278 /* XXX do we really need to do this if we're done appending?? */
2279 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2281 cLISTOPo->op_last = last; /* in case check substituted last arg */
2284 return fold_constants(o);
2287 /* List constructors */
2290 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2298 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2299 return newLISTOP(type, 0, first, last);
2301 if (first->op_flags & OPf_KIDS)
2302 ((LISTOP*)first)->op_last->op_sibling = last;
2304 first->op_flags |= OPf_KIDS;
2305 ((LISTOP*)first)->op_first = last;
2307 ((LISTOP*)first)->op_last = last;
2308 ((LISTOP*)first)->op_children++;
2313 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2321 if (first->op_type != type)
2322 return prepend_elem(type, (OP*)first, (OP*)last);
2324 if (last->op_type != type)
2325 return append_elem(type, (OP*)first, (OP*)last);
2327 first->op_last->op_sibling = last->op_first;
2328 first->op_last = last->op_last;
2329 first->op_children += last->op_children;
2330 if (first->op_children)
2331 first->op_flags |= OPf_KIDS;
2333 #ifdef PL_OP_SLAB_ALLOC
2341 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2349 if (last->op_type == type) {
2350 if (type == OP_LIST) { /* already a PUSHMARK there */
2351 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2352 ((LISTOP*)last)->op_first->op_sibling = first;
2355 if (!(last->op_flags & OPf_KIDS)) {
2356 ((LISTOP*)last)->op_last = first;
2357 last->op_flags |= OPf_KIDS;
2359 first->op_sibling = ((LISTOP*)last)->op_first;
2360 ((LISTOP*)last)->op_first = first;
2362 ((LISTOP*)last)->op_children++;
2366 return newLISTOP(type, 0, first, last);
2372 Perl_newNULLLIST(pTHX)
2374 return newOP(OP_STUB, 0);
2378 Perl_force_list(pTHX_ OP *o)
2380 if (!o || o->op_type != OP_LIST)
2381 o = newLISTOP(OP_LIST, 0, o, Nullop);
2387 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2391 NewOp(1101, listop, 1, LISTOP);
2393 listop->op_type = type;
2394 listop->op_ppaddr = PL_ppaddr[type];
2395 listop->op_children = (first != 0) + (last != 0);
2396 listop->op_flags = flags;
2400 else if (!first && last)
2403 first->op_sibling = last;
2404 listop->op_first = first;
2405 listop->op_last = last;
2406 if (type == OP_LIST) {
2408 pushop = newOP(OP_PUSHMARK, 0);
2409 pushop->op_sibling = first;
2410 listop->op_first = pushop;
2411 listop->op_flags |= OPf_KIDS;
2413 listop->op_last = pushop;
2415 else if (listop->op_children)
2416 listop->op_flags |= OPf_KIDS;
2422 Perl_newOP(pTHX_ I32 type, I32 flags)
2425 NewOp(1101, o, 1, OP);
2427 o->op_ppaddr = PL_ppaddr[type];
2428 o->op_flags = flags;
2431 o->op_private = 0 + (flags >> 8);
2432 if (PL_opargs[type] & OA_RETSCALAR)
2434 if (PL_opargs[type] & OA_TARGET)
2435 o->op_targ = pad_alloc(type, SVs_PADTMP);
2436 return CHECKOP(type, o);
2440 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2445 first = newOP(OP_STUB, 0);
2446 if (PL_opargs[type] & OA_MARK)
2447 first = force_list(first);
2449 NewOp(1101, unop, 1, UNOP);
2450 unop->op_type = type;
2451 unop->op_ppaddr = PL_ppaddr[type];
2452 unop->op_first = first;
2453 unop->op_flags = flags | OPf_KIDS;
2454 unop->op_private = 1 | (flags >> 8);
2455 unop = (UNOP*) CHECKOP(type, unop);
2459 return fold_constants((OP *) unop);
2463 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2466 NewOp(1101, binop, 1, BINOP);
2469 first = newOP(OP_NULL, 0);
2471 binop->op_type = type;
2472 binop->op_ppaddr = PL_ppaddr[type];
2473 binop->op_first = first;
2474 binop->op_flags = flags | OPf_KIDS;
2477 binop->op_private = 1 | (flags >> 8);
2480 binop->op_private = 2 | (flags >> 8);
2481 first->op_sibling = last;
2484 binop = (BINOP*)CHECKOP(type, binop);
2485 if (binop->op_next || binop->op_type != type)
2488 binop->op_last = binop->op_first->op_sibling;
2490 return fold_constants((OP *)binop);
2494 utf8compare(const void *a, const void *b)
2497 for (i = 0; i < 10; i++) {
2498 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2500 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2507 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2509 SV *tstr = ((SVOP*)expr)->op_sv;
2510 SV *rstr = ((SVOP*)repl)->op_sv;
2513 register U8 *t = (U8*)SvPV(tstr, tlen);
2514 register U8 *r = (U8*)SvPV(rstr, rlen);
2520 register short *tbl;
2522 complement = o->op_private & OPpTRANS_COMPLEMENT;
2523 del = o->op_private & OPpTRANS_DELETE;
2524 squash = o->op_private & OPpTRANS_SQUASH;
2526 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2527 SV* listsv = newSVpvn("# comment\n",10);
2529 U8* tend = t + tlen;
2530 U8* rend = r + rlen;
2546 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2547 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2553 New(1109, cp, tlen, U8*);
2555 transv = newSVpvn("",0);
2564 qsort(cp, i, sizeof(U8*), utf8compare);
2565 for (j = 0; j < i; j++) {
2567 UV val = utf8_to_uv(s, &ulen);
2569 diff = val - nextmin;
2571 t = uv_to_utf8(tmpbuf,nextmin);
2572 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2574 t = uv_to_utf8(tmpbuf, val - 1);
2575 sv_catpvn(transv, "\377", 1);
2576 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2580 val = utf8_to_uv(s+1, &ulen);
2584 t = uv_to_utf8(tmpbuf,nextmin);
2585 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2586 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2587 sv_catpvn(transv, "\377", 1);
2588 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2589 t = (U8*)SvPVX(transv);
2590 tlen = SvCUR(transv);
2593 else if (!rlen && !del) {
2594 r = t; rlen = tlen; rend = tend;
2597 if (to_utf && from_utf) { /* only counting characters */
2598 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2599 o->op_private |= OPpTRANS_IDENTICAL;
2601 else { /* straight latin-1 translation */
2602 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2603 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2604 o->op_private |= OPpTRANS_IDENTICAL;
2608 while (t < tend || tfirst <= tlast) {
2609 /* see if we need more "t" chars */
2610 if (tfirst > tlast) {
2611 tfirst = (I32)utf8_to_uv(t, &ulen);
2613 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2614 tlast = (I32)utf8_to_uv(++t, &ulen);
2621 /* now see if we need more "r" chars */
2622 if (rfirst > rlast) {
2624 rfirst = (I32)utf8_to_uv(r, &ulen);
2626 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2627 rlast = (I32)utf8_to_uv(++r, &ulen);
2636 rfirst = rlast = 0xffffffff;
2640 /* now see which range will peter our first, if either. */
2641 tdiff = tlast - tfirst;
2642 rdiff = rlast - rfirst;
2649 if (rfirst == 0xffffffff) {
2650 diff = tdiff; /* oops, pretend rdiff is infinite */
2652 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2654 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2658 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2660 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2662 if (rfirst + diff > max)
2663 max = rfirst + diff;
2668 else if (rfirst <= 0x800)
2669 grows |= (tfirst < 0x80);
2670 else if (rfirst <= 0x10000)
2671 grows |= (tfirst < 0x800);
2672 else if (rfirst <= 0x200000)
2673 grows |= (tfirst < 0x10000);
2674 else if (rfirst <= 0x4000000)
2675 grows |= (tfirst < 0x200000);
2676 else if (rfirst <= 0x80000000)
2677 grows |= (tfirst < 0x4000000);
2689 else if (max > 0xff)
2694 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2695 SvREFCNT_dec(listsv);
2697 SvREFCNT_dec(transv);
2699 if (!del && havefinal)
2700 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2702 if (grows && to_utf)
2703 o->op_private |= OPpTRANS_GROWS;
2710 tbl = (short*)cPVOPo->op_pv;
2712 Zero(tbl, 256, short);
2713 for (i = 0; i < tlen; i++)
2715 for (i = 0, j = 0; i < 256; i++) {
2731 if (!rlen && !del) {
2734 o->op_private |= OPpTRANS_IDENTICAL;
2736 for (i = 0; i < 256; i++)
2738 for (i = 0, j = 0; i < tlen; i++,j++) {
2741 if (tbl[t[i]] == -1)
2747 if (tbl[t[i]] == -1)
2758 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2763 NewOp(1101, pmop, 1, PMOP);
2764 pmop->op_type = type;
2765 pmop->op_ppaddr = PL_ppaddr[type];
2766 pmop->op_flags = flags;
2767 pmop->op_private = 0 | (flags >> 8);
2769 if (PL_hints & HINT_RE_TAINT)
2770 pmop->op_pmpermflags |= PMf_RETAINT;
2771 if (PL_hints & HINT_LOCALE)
2772 pmop->op_pmpermflags |= PMf_LOCALE;
2773 pmop->op_pmflags = pmop->op_pmpermflags;
2775 /* link into pm list */
2776 if (type != OP_TRANS && PL_curstash) {
2777 pmop->op_pmnext = HvPMROOT(PL_curstash);
2778 HvPMROOT(PL_curstash) = pmop;
2785 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2790 I32 repl_has_vars = 0;
2792 if (o->op_type == OP_TRANS)
2793 return pmtrans(o, expr, repl);
2795 PL_hints |= HINT_BLOCK_SCOPE;
2798 if (expr->op_type == OP_CONST) {
2800 SV *pat = ((SVOP*)expr)->op_sv;
2801 char *p = SvPV(pat, plen);
2802 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2803 sv_setpvn(pat, "\\s+", 3);
2804 p = SvPV(pat, plen);
2805 pm->op_pmflags |= PMf_SKIPWHITE;
2807 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2808 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2809 pm->op_pmflags |= PMf_WHITE;
2813 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2814 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2816 : OP_REGCMAYBE),0,expr);
2818 NewOp(1101, rcop, 1, LOGOP);
2819 rcop->op_type = OP_REGCOMP;
2820 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2821 rcop->op_first = scalar(expr);
2822 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2823 ? (OPf_SPECIAL | OPf_KIDS)
2825 rcop->op_private = 1;
2828 /* establish postfix order */
2829 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2831 rcop->op_next = expr;
2832 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2835 rcop->op_next = LINKLIST(expr);
2836 expr->op_next = (OP*)rcop;
2839 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2844 if (pm->op_pmflags & PMf_EVAL) {
2846 if (CopLINE(PL_curcop) < PL_multi_end)
2847 CopLINE_set(PL_curcop, PL_multi_end);
2850 else if (repl->op_type == OP_THREADSV
2851 && strchr("&`'123456789+",
2852 PL_threadsv_names[repl->op_targ]))
2856 #endif /* USE_THREADS */
2857 else if (repl->op_type == OP_CONST)
2861 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2862 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2864 if (curop->op_type == OP_THREADSV) {
2866 if (strchr("&`'123456789+", curop->op_private))
2870 if (curop->op_type == OP_GV) {
2871 GV *gv = cGVOPx_gv(curop);
2873 if (strchr("&`'123456789+", *GvENAME(gv)))
2876 #endif /* USE_THREADS */
2877 else if (curop->op_type == OP_RV2CV)
2879 else if (curop->op_type == OP_RV2SV ||
2880 curop->op_type == OP_RV2AV ||
2881 curop->op_type == OP_RV2HV ||
2882 curop->op_type == OP_RV2GV) {
2883 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2886 else if (curop->op_type == OP_PADSV ||
2887 curop->op_type == OP_PADAV ||
2888 curop->op_type == OP_PADHV ||
2889 curop->op_type == OP_PADANY) {
2892 else if (curop->op_type == OP_PUSHRE)
2893 ; /* Okay here, dangerous in newASSIGNOP */
2902 && (!pm->op_pmregexp
2903 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2904 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2905 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2906 prepend_elem(o->op_type, scalar(repl), o);
2909 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2910 pm->op_pmflags |= PMf_MAYBE_CONST;
2911 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2913 NewOp(1101, rcop, 1, LOGOP);
2914 rcop->op_type = OP_SUBSTCONT;
2915 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2916 rcop->op_first = scalar(repl);
2917 rcop->op_flags |= OPf_KIDS;
2918 rcop->op_private = 1;
2921 /* establish postfix order */
2922 rcop->op_next = LINKLIST(repl);
2923 repl->op_next = (OP*)rcop;
2925 pm->op_pmreplroot = scalar((OP*)rcop);
2926 pm->op_pmreplstart = LINKLIST(rcop);
2935 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2938 NewOp(1101, svop, 1, SVOP);
2939 svop->op_type = type;
2940 svop->op_ppaddr = PL_ppaddr[type];
2942 svop->op_next = (OP*)svop;
2943 svop->op_flags = flags;
2944 if (PL_opargs[type] & OA_RETSCALAR)
2946 if (PL_opargs[type] & OA_TARGET)
2947 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2948 return CHECKOP(type, svop);
2952 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2955 NewOp(1101, padop, 1, PADOP);
2956 padop->op_type = type;
2957 padop->op_ppaddr = PL_ppaddr[type];
2958 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2959 SvREFCNT_dec(PL_curpad[padop->op_padix]);
2960 PL_curpad[padop->op_padix] = sv;
2962 padop->op_next = (OP*)padop;
2963 padop->op_flags = flags;
2964 if (PL_opargs[type] & OA_RETSCALAR)
2966 if (PL_opargs[type] & OA_TARGET)
2967 padop->op_targ = pad_alloc(type, SVs_PADTMP);
2968 return CHECKOP(type, padop);
2972 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2977 return newPADOP(type, flags, SvREFCNT_inc(gv));
2979 return newSVOP(type, flags, SvREFCNT_inc(gv));
2984 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2987 NewOp(1101, pvop, 1, PVOP);
2988 pvop->op_type = type;
2989 pvop->op_ppaddr = PL_ppaddr[type];
2991 pvop->op_next = (OP*)pvop;
2992 pvop->op_flags = flags;
2993 if (PL_opargs[type] & OA_RETSCALAR)
2995 if (PL_opargs[type] & OA_TARGET)
2996 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2997 return CHECKOP(type, pvop);
3001 Perl_package(pTHX_ OP *o)
3006 save_hptr(&PL_curstash);
3007 save_item(PL_curstname);
3012 name = SvPV(sv, len);
3013 PL_curstash = gv_stashpvn(name,len,TRUE);
3014 sv_setpvn(PL_curstname, name, len);
3018 sv_setpv(PL_curstname,"<none>");
3019 PL_curstash = Nullhv;
3021 PL_hints |= HINT_BLOCK_SCOPE;
3022 PL_copline = NOLINE;
3027 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
3036 if (id->op_type != OP_CONST)
3037 Perl_croak(aTHX_ "Module name must be constant");
3041 if(version != Nullop) {
3042 SV *vesv = ((SVOP*)version)->op_sv;
3044 if (arg == Nullop && !SvNIOK(vesv)) {
3050 if (version->op_type != OP_CONST || !SvNIOK(vesv))
3051 Perl_croak(aTHX_ "Version number must be constant number");
3053 /* Make copy of id so we don't free it twice */
3054 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3056 /* Fake up a method call to VERSION */
3057 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3058 append_elem(OP_LIST,
3059 prepend_elem(OP_LIST, pack, list(version)),
3060 newSVOP(OP_METHOD_NAMED, 0,
3061 newSVpvn("VERSION", 7))));
3065 /* Fake up an import/unimport */
3066 if (arg && arg->op_type == OP_STUB)
3067 imop = arg; /* no import on explicit () */
3068 else if(SvNIOK(((SVOP*)id)->op_sv)) {
3069 imop = Nullop; /* use 5.0; */
3072 /* Make copy of id so we don't free it twice */
3073 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
3074 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3075 append_elem(OP_LIST,
3076 prepend_elem(OP_LIST, pack, list(arg)),
3077 newSVOP(OP_METHOD_NAMED, 0,
3078 aver ? newSVpvn("import", 6)
3079 : newSVpvn("unimport", 8))));
3082 /* Fake up a require, handle override, if any */
3083 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
3084 if (!(gv && GvIMPORTED_CV(gv)))
3085 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
3087 if (gv && GvIMPORTED_CV(gv)) {
3088 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3089 append_elem(OP_LIST, id,
3090 scalar(newUNOP(OP_RV2CV, 0,
3095 rqop = newUNOP(OP_REQUIRE, 0, id);
3098 /* Fake up the BEGIN {}, which does its thing immediately. */
3100 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
3103 append_elem(OP_LINESEQ,
3104 append_elem(OP_LINESEQ,
3105 newSTATEOP(0, Nullch, rqop),
3106 newSTATEOP(0, Nullch, veop)),
3107 newSTATEOP(0, Nullch, imop) ));
3109 PL_hints |= HINT_BLOCK_SCOPE;
3110 PL_copline = NOLINE;
3115 Perl_dofile(pTHX_ OP *term)
3120 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3121 if (!(gv && GvIMPORTED_CV(gv)))
3122 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3124 if (gv && GvIMPORTED_CV(gv)) {
3125 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3126 append_elem(OP_LIST, term,
3127 scalar(newUNOP(OP_RV2CV, 0,
3132 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3138 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3140 return newBINOP(OP_LSLICE, flags,
3141 list(force_list(subscript)),
3142 list(force_list(listval)) );
3146 S_list_assignment(pTHX_ register OP *o)
3151 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3152 o = cUNOPo->op_first;
3154 if (o->op_type == OP_COND_EXPR) {
3155 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3156 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3161 yyerror("Assignment to both a list and a scalar");
3165 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3166 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3167 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3170 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3173 if (o->op_type == OP_RV2SV)
3180 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3185 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
3186 return newLOGOP(optype, 0,
3187 mod(scalar(left), optype),
3188 newUNOP(OP_SASSIGN, 0, scalar(right)));
3191 return newBINOP(optype, OPf_STACKED,
3192 mod(scalar(left), optype), scalar(right));
3196 if (list_assignment(left)) {
3199 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3200 left = mod(left, OP_AASSIGN);
3208 o = newBINOP(OP_AASSIGN, flags,
3209 list(force_list(right)),
3210 list(force_list(left)) );
3211 o->op_private = 0 | (flags >> 8);
3212 if (!(left->op_private & OPpLVAL_INTRO)) {
3216 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3217 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3218 if (curop->op_type == OP_GV) {
3219 GV *gv = cGVOPx_gv(curop);
3220 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3222 SvCUR(gv) = PL_generation;
3224 else if (curop->op_type == OP_PADSV ||
3225 curop->op_type == OP_PADAV ||
3226 curop->op_type == OP_PADHV ||
3227 curop->op_type == OP_PADANY) {
3228 SV **svp = AvARRAY(PL_comppad_name);
3229 SV *sv = svp[curop->op_targ];
3230 if (SvCUR(sv) == PL_generation)
3232 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
3234 else if (curop->op_type == OP_RV2CV)
3236 else if (curop->op_type == OP_RV2SV ||
3237 curop->op_type == OP_RV2AV ||
3238 curop->op_type == OP_RV2HV ||
3239 curop->op_type == OP_RV2GV) {
3240 if (lastop->op_type != OP_GV) /* funny deref? */
3243 else if (curop->op_type == OP_PUSHRE) {
3244 if (((PMOP*)curop)->op_pmreplroot) {
3245 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3246 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
3248 SvCUR(gv) = PL_generation;
3257 o->op_private = OPpASSIGN_COMMON;
3259 if (right && right->op_type == OP_SPLIT) {
3261 if ((tmpop = ((LISTOP*)right)->op_first) &&
3262 tmpop->op_type == OP_PUSHRE)
3264 PMOP *pm = (PMOP*)tmpop;
3265 if (left->op_type == OP_RV2AV &&
3266 !(left->op_private & OPpLVAL_INTRO) &&
3267 !(o->op_private & OPpASSIGN_COMMON) )
3269 tmpop = ((UNOP*)left)->op_first;
3270 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3272 pm->op_pmreplroot = (OP*)cPADOPx(tmpop)->op_padix;
3273 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3275 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3276 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3278 pm->op_pmflags |= PMf_ONCE;
3279 tmpop = cUNOPo->op_first; /* to list (nulled) */
3280 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3281 tmpop->op_sibling = Nullop; /* don't free split */
3282 right->op_next = tmpop->op_next; /* fix starting loc */
3283 op_free(o); /* blow off assign */
3284 right->op_flags &= ~OPf_WANT;
3285 /* "I don't know and I don't care." */
3290 if (PL_modcount < 10000 &&
3291 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3293 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3295 sv_setiv(sv, PL_modcount+1);
3303 right = newOP(OP_UNDEF, 0);
3304 if (right->op_type == OP_READLINE) {
3305 right->op_flags |= OPf_STACKED;
3306 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3309 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3310 o = newBINOP(OP_SASSIGN, flags,
3311 scalar(right), mod(scalar(left), OP_SASSIGN) );
3323 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3326 U32 seq = intro_my();
3329 NewOp(1101, cop, 1, COP);
3330 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3331 cop->op_type = OP_DBSTATE;
3332 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3335 cop->op_type = OP_NEXTSTATE;
3336 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3338 cop->op_flags = flags;
3339 cop->op_private = (PL_hints & HINT_UTF8);
3341 cop->op_private |= NATIVE_HINTS;
3343 PL_compiling.op_private = cop->op_private;
3344 cop->op_next = (OP*)cop;
3347 cop->cop_label = label;
3348 PL_hints |= HINT_BLOCK_SCOPE;
3351 cop->cop_arybase = PL_curcop->cop_arybase;
3352 if (specialWARN(PL_curcop->cop_warnings))
3353 cop->cop_warnings = PL_curcop->cop_warnings ;
3355 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3358 if (PL_copline == NOLINE)
3359 CopLINE_set(cop, CopLINE(PL_curcop));
3361 CopLINE_set(cop, PL_copline);
3362 PL_copline = NOLINE;
3365 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXXXX share in a pvtable? */
3367 CopFILEGV_set(cop, (GV*)SvREFCNT_inc(CopFILEGV(PL_curcop)));
3369 CopSTASH_set(cop, PL_curstash);
3371 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3372 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3373 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3374 (void)SvIOK_on(*svp);
3375 SvIVX(*svp) = PTR2IV(cop);
3379 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3382 /* "Introduce" my variables to visible status. */
3390 if (! PL_min_intro_pending)
3391 return PL_cop_seqmax;
3393 svp = AvARRAY(PL_comppad_name);
3394 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3395 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3396 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3397 SvNVX(sv) = (NV)PL_cop_seqmax;
3400 PL_min_intro_pending = 0;
3401 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3402 return PL_cop_seqmax++;
3406 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3408 return new_logop(type, flags, &first, &other);
3412 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3417 OP *first = *firstp;
3418 OP *other = *otherp;
3420 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3421 return newBINOP(type, flags, scalar(first), scalar(other));
3423 scalarboolean(first);
3424 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3425 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3426 if (type == OP_AND || type == OP_OR) {
3432 first = *firstp = cUNOPo->op_first;
3434 first->op_next = o->op_next;
3435 cUNOPo->op_first = Nullop;
3439 if (first->op_type == OP_CONST) {
3440 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3441 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3443 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3454 else if (first->op_type == OP_WANTARRAY) {
3460 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3461 OP *k1 = ((UNOP*)first)->op_first;
3462 OP *k2 = k1->op_sibling;
3464 switch (first->op_type)
3467 if (k2 && k2->op_type == OP_READLINE
3468 && (k2->op_flags & OPf_STACKED)
3469 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3471 warnop = k2->op_type;
3476 if (k1->op_type == OP_READDIR
3477 || k1->op_type == OP_GLOB
3478 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3479 || k1->op_type == OP_EACH)
3481 warnop = ((k1->op_type == OP_NULL)
3482 ? k1->op_targ : k1->op_type);
3487 line_t oldline = CopLINE(PL_curcop);
3488 CopLINE_set(PL_curcop, PL_copline);
3489 Perl_warner(aTHX_ WARN_UNSAFE,
3490 "Value of %s%s can be \"0\"; test with defined()",
3492 ((warnop == OP_READLINE || warnop == OP_GLOB)
3493 ? " construct" : "() operator"));
3494 CopLINE_set(PL_curcop, oldline);
3501 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3502 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3504 NewOp(1101, logop, 1, LOGOP);
3506 logop->op_type = type;
3507 logop->op_ppaddr = PL_ppaddr[type];
3508 logop->op_first = first;
3509 logop->op_flags = flags | OPf_KIDS;
3510 logop->op_other = LINKLIST(other);
3511 logop->op_private = 1 | (flags >> 8);
3513 /* establish postfix order */
3514 logop->op_next = LINKLIST(first);
3515 first->op_next = (OP*)logop;
3516 first->op_sibling = other;
3518 o = newUNOP(OP_NULL, 0, (OP*)logop);
3525 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3533 return newLOGOP(OP_AND, 0, first, trueop);
3535 return newLOGOP(OP_OR, 0, first, falseop);
3537 scalarboolean(first);
3538 if (first->op_type == OP_CONST) {
3539 if (SvTRUE(((SVOP*)first)->op_sv)) {
3550 else if (first->op_type == OP_WANTARRAY) {
3554 NewOp(1101, logop, 1, LOGOP);
3555 logop->op_type = OP_COND_EXPR;
3556 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3557 logop->op_first = first;
3558 logop->op_flags = flags | OPf_KIDS;
3559 logop->op_private = 1 | (flags >> 8);
3560 logop->op_other = LINKLIST(trueop);
3561 logop->op_next = LINKLIST(falseop);
3564 /* establish postfix order */
3565 start = LINKLIST(first);
3566 first->op_next = (OP*)logop;
3568 first->op_sibling = trueop;
3569 trueop->op_sibling = falseop;
3570 o = newUNOP(OP_NULL, 0, (OP*)logop);
3572 trueop->op_next = falseop->op_next = o;
3579 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3588 NewOp(1101, range, 1, LOGOP);
3590 range->op_type = OP_RANGE;
3591 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3592 range->op_first = left;
3593 range->op_flags = OPf_KIDS;
3594 leftstart = LINKLIST(left);
3595 range->op_other = LINKLIST(right);
3596 range->op_private = 1 | (flags >> 8);
3598 left->op_sibling = right;
3600 range->op_next = (OP*)range;
3601 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3602 flop = newUNOP(OP_FLOP, 0, flip);
3603 o = newUNOP(OP_NULL, 0, flop);
3605 range->op_next = leftstart;
3607 left->op_next = flip;
3608 right->op_next = flop;
3610 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3611 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3612 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3613 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3615 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3616 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3619 if (!flip->op_private || !flop->op_private)
3620 linklist(o); /* blow off optimizer unless constant */
3626 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3631 int once = block && block->op_flags & OPf_SPECIAL &&
3632 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3635 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3636 return block; /* do {} while 0 does once */
3637 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3638 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3639 expr = newUNOP(OP_DEFINED, 0,
3640 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3641 } else if (expr->op_flags & OPf_KIDS) {
3642 OP *k1 = ((UNOP*)expr)->op_first;
3643 OP *k2 = (k1) ? k1->op_sibling : NULL;
3644 switch (expr->op_type) {
3646 if (k2 && k2->op_type == OP_READLINE
3647 && (k2->op_flags & OPf_STACKED)
3648 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3649 expr = newUNOP(OP_DEFINED, 0, expr);
3653 if (k1->op_type == OP_READDIR
3654 || k1->op_type == OP_GLOB
3655 || (k1->op_type == OP_NULL && k1->op_targ == OP_NULL)
3656 || k1->op_type == OP_EACH)
3657 expr = newUNOP(OP_DEFINED, 0, expr);
3663 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3664 o = new_logop(OP_AND, 0, &expr, &listop);
3667 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3669 if (once && o != listop)
3670 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3673 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3675 o->op_flags |= flags;
3677 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3682 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3691 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3692 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3693 expr = newUNOP(OP_DEFINED, 0,
3694 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3695 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3696 OP *k1 = ((UNOP*)expr)->op_first;
3697 OP *k2 = (k1) ? k1->op_sibling : NULL;
3698 switch (expr->op_type) {
3700 if (k2 && k2->op_type == OP_READLINE
3701 && (k2->op_flags & OPf_STACKED)
3702 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3703 expr = newUNOP(OP_DEFINED, 0, expr);
3707 if (k1->op_type == OP_READDIR
3708 || k1->op_type == OP_GLOB
3709 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3710 || k1->op_type == OP_EACH)
3711 expr = newUNOP(OP_DEFINED, 0, expr);
3717 block = newOP(OP_NULL, 0);
3720 next = LINKLIST(cont);
3722 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3723 if ((line_t)whileline != NOLINE) {
3724 PL_copline = whileline;
3725 cont = append_elem(OP_LINESEQ, cont,
3726 newSTATEOP(0, Nullch, Nullop));
3730 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3731 redo = LINKLIST(listop);
3734 PL_copline = whileline;
3736 o = new_logop(OP_AND, 0, &expr, &listop);
3737 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3738 op_free(expr); /* oops, it's a while (0) */
3740 return Nullop; /* listop already freed by new_logop */
3743 ((LISTOP*)listop)->op_last->op_next = condop =
3744 (o == listop ? redo : LINKLIST(o));
3752 NewOp(1101,loop,1,LOOP);
3753 loop->op_type = OP_ENTERLOOP;
3754 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3755 loop->op_private = 0;
3756 loop->op_next = (OP*)loop;
3759 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3761 loop->op_redoop = redo;
3762 loop->op_lastop = o;
3765 loop->op_nextop = next;
3767 loop->op_nextop = o;
3769 o->op_flags |= flags;
3770 o->op_private |= (flags >> 8);
3775 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3784 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3785 sv->op_type = OP_RV2GV;
3786 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3788 else if (sv->op_type == OP_PADSV) { /* private variable */
3789 padoff = sv->op_targ;
3794 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3795 padoff = sv->op_targ;
3797 iterflags |= OPf_SPECIAL;
3802 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3806 padoff = find_threadsv("_");
3807 iterflags |= OPf_SPECIAL;
3809 sv = newGVOP(OP_GV, 0, PL_defgv);
3812 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3813 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3814 iterflags |= OPf_STACKED;
3816 else if (expr->op_type == OP_NULL &&
3817 (expr->op_flags & OPf_KIDS) &&
3818 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3820 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3821 * set the STACKED flag to indicate that these values are to be
3822 * treated as min/max values by 'pp_iterinit'.
3824 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3825 LOGOP* range = (LOGOP*) flip->op_first;
3826 OP* left = range->op_first;
3827 OP* right = left->op_sibling;
3830 range->op_flags &= ~OPf_KIDS;
3831 range->op_first = Nullop;
3833 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3834 listop->op_first->op_next = range->op_next;
3835 left->op_next = range->op_other;
3836 right->op_next = (OP*)listop;
3837 listop->op_next = listop->op_first;
3840 expr = (OP*)(listop);
3842 iterflags |= OPf_STACKED;
3845 expr = mod(force_list(expr), OP_GREPSTART);
3849 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3850 append_elem(OP_LIST, expr, scalar(sv))));
3851 assert(!loop->op_next);
3852 #ifdef PL_OP_SLAB_ALLOC
3853 NewOp(1234,tmp,1,LOOP);
3854 Copy(loop,tmp,1,LOOP);
3857 Renew(loop, 1, LOOP);
3859 loop->op_targ = padoff;
3860 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3861 PL_copline = forline;
3862 return newSTATEOP(0, label, wop);
3866 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3872 if (type != OP_GOTO || label->op_type == OP_CONST) {
3873 /* "last()" means "last" */
3874 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3875 o = newOP(type, OPf_SPECIAL);
3877 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3878 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3884 if (label->op_type == OP_ENTERSUB)
3885 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3886 o = newUNOP(type, OPf_STACKED, label);
3888 PL_hints |= HINT_BLOCK_SCOPE;
3893 Perl_cv_undef(pTHX_ CV *cv)
3898 MUTEX_DESTROY(CvMUTEXP(cv));
3899 Safefree(CvMUTEXP(cv));
3902 #endif /* USE_THREADS */
3904 if (!CvXSUB(cv) && CvROOT(cv)) {
3906 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3907 Perl_croak(aTHX_ "Can't undef active subroutine");
3910 Perl_croak(aTHX_ "Can't undef active subroutine");
3911 #endif /* USE_THREADS */
3914 SAVEVPTR(PL_curpad);
3918 op_free(CvROOT(cv));
3919 CvROOT(cv) = Nullop;
3922 SvPOK_off((SV*)cv); /* forget prototype */
3924 SvREFCNT_dec(CvGV(cv));
3926 SvREFCNT_dec(CvOUTSIDE(cv));
3927 CvOUTSIDE(cv) = Nullcv;
3928 if (CvPADLIST(cv)) {
3929 /* may be during global destruction */
3930 if (SvREFCNT(CvPADLIST(cv))) {
3931 I32 i = AvFILLp(CvPADLIST(cv));
3933 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3934 SV* sv = svp ? *svp : Nullsv;
3937 if (sv == (SV*)PL_comppad_name)
3938 PL_comppad_name = Nullav;
3939 else if (sv == (SV*)PL_comppad) {
3940 PL_comppad = Nullav;
3941 PL_curpad = Null(SV**);
3945 SvREFCNT_dec((SV*)CvPADLIST(cv));
3947 CvPADLIST(cv) = Nullav;
3952 S_cv_dump(pTHX_ CV *cv)
3955 CV *outside = CvOUTSIDE(cv);
3956 AV* padlist = CvPADLIST(cv);
3963 PerlIO_printf(Perl_debug_log,
3964 "\tCV=0x%"UVxf" (%s), OUTSIDE=0x%"UVxf" (%s)\n",
3966 (CvANON(cv) ? "ANON"
3967 : (cv == PL_main_cv) ? "MAIN"
3968 : CvUNIQUE(cv) ? "UNIQUE"
3969 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3972 : CvANON(outside) ? "ANON"
3973 : (outside == PL_main_cv) ? "MAIN"
3974 : CvUNIQUE(outside) ? "UNIQUE"
3975 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3980 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3981 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3982 pname = AvARRAY(pad_name);
3983 ppad = AvARRAY(pad);
3985 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3986 if (SvPOK(pname[ix]))
3987 PerlIO_printf(Perl_debug_log,
3988 "\t%4d. 0x%"UVxf" (%s\"%s\" %"IVdf"-%"IVdf")\n",
3989 ix, PTR2UV(ppad[ix]),
3990 SvFAKE(pname[ix]) ? "FAKE " : "",
3992 (IV)I_32(SvNVX(pname[ix])),
3995 #endif /* DEBUGGING */
3999 S_cv_clone2(pTHX_ CV *proto, CV *outside)
4004 AV* protopadlist = CvPADLIST(proto);
4005 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
4006 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
4007 SV** pname = AvARRAY(protopad_name);
4008 SV** ppad = AvARRAY(protopad);
4009 I32 fname = AvFILLp(protopad_name);
4010 I32 fpad = AvFILLp(protopad);
4014 assert(!CvUNIQUE(proto));
4017 SAVEVPTR(PL_curpad);
4018 SAVESPTR(PL_comppad);
4019 SAVESPTR(PL_comppad_name);
4020 SAVESPTR(PL_compcv);
4022 cv = PL_compcv = (CV*)NEWSV(1104,0);
4023 sv_upgrade((SV *)cv, SvTYPE(proto));
4029 New(666, CvMUTEXP(cv), 1, perl_mutex);
4030 MUTEX_INIT(CvMUTEXP(cv));
4032 #endif /* USE_THREADS */
4033 CvFILE(cv) = CvFILE(proto);
4034 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
4035 CvSTASH(cv) = CvSTASH(proto);
4036 CvROOT(cv) = CvROOT(proto);
4037 CvSTART(cv) = CvSTART(proto);
4039 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
4042 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
4044 PL_comppad_name = newAV();
4045 for (ix = fname; ix >= 0; ix--)
4046 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
4048 PL_comppad = newAV();
4050 comppadlist = newAV();
4051 AvREAL_off(comppadlist);
4052 av_store(comppadlist, 0, (SV*)PL_comppad_name);
4053 av_store(comppadlist, 1, (SV*)PL_comppad);
4054 CvPADLIST(cv) = comppadlist;
4055 av_fill(PL_comppad, AvFILLp(protopad));
4056 PL_curpad = AvARRAY(PL_comppad);
4058 av = newAV(); /* will be @_ */
4060 av_store(PL_comppad, 0, (SV*)av);
4061 AvFLAGS(av) = AVf_REIFY;
4063 for (ix = fpad; ix > 0; ix--) {
4064 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4065 if (namesv && namesv != &PL_sv_undef) {
4066 char *name = SvPVX(namesv); /* XXX */
4067 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
4068 I32 off = pad_findlex(name, ix, SvIVX(namesv),
4069 CvOUTSIDE(cv), cxstack_ix, 0, 0);
4071 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4073 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
4075 else { /* our own lexical */
4078 /* anon code -- we'll come back for it */
4079 sv = SvREFCNT_inc(ppad[ix]);
4081 else if (*name == '@')
4083 else if (*name == '%')
4092 else if (IS_PADGV(ppad[ix]) || IS_PADCONST(ppad[ix])) {
4093 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
4096 SV* sv = NEWSV(0,0);
4102 /* Now that vars are all in place, clone nested closures. */
4104 for (ix = fpad; ix > 0; ix--) {
4105 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
4107 && namesv != &PL_sv_undef
4108 && !(SvFLAGS(namesv) & SVf_FAKE)
4109 && *SvPVX(namesv) == '&'
4110 && CvCLONE(ppad[ix]))
4112 CV *kid = cv_clone2((CV*)ppad[ix], cv);
4113 SvREFCNT_dec(ppad[ix]);
4116 PL_curpad[ix] = (SV*)kid;
4120 #ifdef DEBUG_CLOSURES
4121 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
4123 PerlIO_printf(Perl_debug_log, " from:\n");
4125 PerlIO_printf(Perl_debug_log, " to:\n");
4134 Perl_cv_clone(pTHX_ CV *proto)
4137 LOCK_CRED_MUTEX; /* XXX create separate mutex */
4138 cv = cv_clone2(proto, CvOUTSIDE(proto));
4139 UNLOCK_CRED_MUTEX; /* XXX create separate mutex */
4144 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
4148 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_UNSAFE)) {
4149 SV* msg = sv_newmortal();
4153 gv_efullname3(name = sv_newmortal(), gv, Nullch);
4154 sv_setpv(msg, "Prototype mismatch:");
4156 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
4158 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
4159 sv_catpv(msg, " vs ");
4161 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
4163 sv_catpv(msg, "none");
4164 Perl_warner(aTHX_ WARN_UNSAFE, "%_", msg);
4169 Perl_cv_const_sv(pTHX_ CV *cv)
4171 if (!cv || !SvPOK(cv) || SvCUR(cv))
4173 return op_const_sv(CvSTART(cv), cv);
4177 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
4184 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
4185 o = cLISTOPo->op_first->op_sibling;
4187 for (; o; o = o->op_next) {
4188 OPCODE type = o->op_type;
4190 if (sv && o->op_next == o)
4192 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
4194 if (type == OP_LEAVESUB || type == OP_RETURN)
4198 if (type == OP_CONST && cSVOPo->op_sv)
4200 else if ((type == OP_PADSV || type == OP_CONST) && cv) {
4201 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
4202 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
4203 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
4215 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4225 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4229 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4231 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4235 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4239 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4240 GV *gv = gv_fetchpv(name ? name : "__ANON__",
4241 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4243 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4254 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4255 maximum a prototype before. */
4256 if (SvTYPE(gv) > SVt_NULL) {
4257 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4258 && ckWARN_d(WARN_UNSAFE))
4260 Perl_warner(aTHX_ WARN_UNSAFE, "Runaway prototype");
4262 cv_ckproto((CV*)gv, NULL, ps);
4265 sv_setpv((SV*)gv, ps);
4267 sv_setiv((SV*)gv, -1);
4268 SvREFCNT_dec(PL_compcv);
4269 cv = PL_compcv = NULL;
4270 PL_sub_generation++;
4274 if (!name || GvCVGEN(gv))
4276 else if (cv = GvCV(gv)) {
4277 cv_ckproto(cv, gv, ps);
4278 /* already defined (or promised)? */
4279 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4281 bool const_changed = TRUE;
4282 if (!block && !attrs) {
4283 /* just a "sub foo;" when &foo is already defined */
4284 SAVEFREESV(PL_compcv);
4287 /* ahem, death to those who redefine active sort subs */
4288 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4289 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4292 if(const_sv = cv_const_sv(cv))
4293 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
4294 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
4295 && !(CvGV(cv) && GvSTASH(CvGV(cv))
4296 && HvNAME(GvSTASH(CvGV(cv)))
4297 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
4299 line_t oldline = CopLINE(PL_curcop);
4300 CopLINE_set(PL_curcop, PL_copline);
4301 Perl_warner(aTHX_ WARN_REDEFINE,
4302 const_sv ? "Constant subroutine %s redefined"
4303 : "Subroutine %s redefined", name);
4304 CopLINE_set(PL_curcop, oldline);
4315 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4316 * before we clobber PL_compcv.
4320 if (CvGV(cv) && GvSTASH(CvGV(cv)) && HvNAME(GvSTASH(CvGV(cv))))
4321 stash = GvSTASH(CvGV(cv));
4322 else if (CvSTASH(cv) && HvNAME(CvSTASH(cv)))
4323 stash = CvSTASH(cv);
4325 stash = PL_curstash;
4328 /* possibly about to re-define existing subr -- ignore old cv */
4329 rcv = (SV*)PL_compcv;
4330 if (name && GvSTASH(gv) && HvNAME(GvSTASH(gv)))
4331 stash = GvSTASH(gv);
4333 stash = PL_curstash;
4335 apply_attrs(stash, rcv, attrs);
4337 if (cv) { /* must reuse cv if autoloaded */
4339 /* got here with just attrs -- work done, so bug out */
4340 SAVEFREESV(PL_compcv);
4344 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4345 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4346 CvOUTSIDE(PL_compcv) = 0;
4347 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4348 CvPADLIST(PL_compcv) = 0;
4349 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
4350 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
4351 SvREFCNT_dec(PL_compcv);
4358 PL_sub_generation++;
4361 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4362 CvFILE(cv) = CopFILE(PL_curcop);
4363 CvSTASH(cv) = PL_curstash;
4366 if (!CvMUTEXP(cv)) {
4367 New(666, CvMUTEXP(cv), 1, perl_mutex);
4368 MUTEX_INIT(CvMUTEXP(cv));
4370 #endif /* USE_THREADS */
4373 sv_setpv((SV*)cv, ps);
4375 if (PL_error_count) {
4379 char *s = strrchr(name, ':');
4381 if (strEQ(s, "BEGIN")) {
4383 "BEGIN not safe after errors--compilation aborted";
4384 if (PL_in_eval & EVAL_KEEPERR)
4385 Perl_croak(aTHX_ not_safe);
4387 /* force display of errors found but not reported */
4388 sv_catpv(ERRSV, not_safe);
4389 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4396 PL_copline = NOLINE;
4401 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4402 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4405 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, scalarseq(block));
4408 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4410 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4411 OpREFCNT_set(CvROOT(cv), 1);
4412 CvSTART(cv) = LINKLIST(CvROOT(cv));
4413 CvROOT(cv)->op_next = 0;
4416 /* now that optimizer has done its work, adjust pad values */
4418 SV **namep = AvARRAY(PL_comppad_name);
4419 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4422 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4425 * The only things that a clonable function needs in its
4426 * pad are references to outer lexicals and anonymous subs.
4427 * The rest are created anew during cloning.
4429 if (!((namesv = namep[ix]) != Nullsv &&
4430 namesv != &PL_sv_undef &&
4432 *SvPVX(namesv) == '&')))
4434 SvREFCNT_dec(PL_curpad[ix]);
4435 PL_curpad[ix] = Nullsv;
4440 AV *av = newAV(); /* Will be @_ */
4442 av_store(PL_comppad, 0, (SV*)av);
4443 AvFLAGS(av) = AVf_REIFY;
4445 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4446 if (SvIMMORTAL(PL_curpad[ix]) || IS_PADGV(PL_curpad[ix]) || IS_PADCONST(PL_curpad[ix]))
4448 if (!SvPADMY(PL_curpad[ix]))
4449 SvPADTMP_on(PL_curpad[ix]);
4456 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4457 SV *sv = NEWSV(0,0);
4458 SV *tmpstr = sv_newmortal();
4459 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4463 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4465 (long)PL_subline, (long)CopLINE(PL_curcop));
4466 gv_efullname3(tmpstr, gv, Nullch);
4467 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4468 hv = GvHVn(db_postponed);
4469 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4470 && (cv = GvCV(db_postponed))) {
4475 call_sv((SV*)cv, G_DISCARD);
4479 if ((s = strrchr(name,':')))
4484 if (*s != 'B' && *s != 'E' && *s != 'S' && *s != 'I')
4487 if (strEQ(s, "BEGIN")) {
4488 I32 oldscope = PL_scopestack_ix;
4490 SAVECOPFILE(&PL_compiling);
4491 SAVECOPLINE(&PL_compiling);
4493 sv_setsv(PL_rs, PL_nrs);
4496 PL_beginav = newAV();
4497 DEBUG_x( dump_sub(gv) );
4498 av_push(PL_beginav, SvREFCNT_inc(cv));
4500 call_list(oldscope, PL_beginav);
4502 PL_curcop = &PL_compiling;
4503 PL_compiling.op_private = PL_hints;
4506 else if (strEQ(s, "END") && !PL_error_count) {
4509 DEBUG_x( dump_sub(gv) );
4510 av_unshift(PL_endav, 1);
4511 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4514 else if (strEQ(s, "STOP") && !PL_error_count) {
4516 PL_stopav = newAV();
4517 DEBUG_x( dump_sub(gv) );
4518 av_unshift(PL_stopav, 1);
4519 av_store(PL_stopav, 0, SvREFCNT_inc(cv));
4522 else if (strEQ(s, "INIT") && !PL_error_count) {
4524 PL_initav = newAV();
4525 DEBUG_x( dump_sub(gv) );
4526 av_push(PL_initav, SvREFCNT_inc(cv));
4532 PL_copline = NOLINE;
4537 /* XXX unsafe for threads if eval_owner isn't held */
4539 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4544 SAVECOPLINE(PL_curcop);
4547 CopLINE_set(PL_curcop, PL_copline);
4548 PL_hints &= ~HINT_BLOCK_SCOPE;
4551 SAVESPTR(PL_curstash);
4552 SAVECOPSTASH(PL_curcop);
4553 PL_curstash = stash;
4555 CopSTASHPV(PL_curcop) = stash ? HvNAME(stash) : Nullch;
4557 CopSTASH(PL_curcop) = stash;
4562 start_subparse(FALSE, 0),
4563 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4564 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4566 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4573 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4576 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4579 if (cv = (name ? GvCV(gv) : Nullcv)) {
4581 /* just a cached method */
4585 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4586 /* already defined (or promised) */
4587 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4588 && HvNAME(GvSTASH(CvGV(cv)))
4589 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4590 line_t oldline = CopLINE(PL_curcop);
4591 if (PL_copline != NOLINE)
4592 CopLINE_set(PL_curcop, PL_copline);
4593 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4594 CopLINE_set(PL_curcop, oldline);
4601 if (cv) /* must reuse cv if autoloaded */
4604 cv = (CV*)NEWSV(1105,0);
4605 sv_upgrade((SV *)cv, SVt_PVCV);
4609 PL_sub_generation++;
4612 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4614 New(666, CvMUTEXP(cv), 1, perl_mutex);
4615 MUTEX_INIT(CvMUTEXP(cv));
4617 #endif /* USE_THREADS */
4618 (void)gv_fetchfile(filename);
4619 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4620 an external constant string */
4621 CvXSUB(cv) = subaddr;
4624 char *s = strrchr(name,':');
4630 if (*s != 'B' && *s != 'E' && *s != 'S' && *s != 'I')
4633 if (strEQ(s, "BEGIN")) {
4635 PL_beginav = newAV();
4636 av_push(PL_beginav, SvREFCNT_inc(cv));
4639 else if (strEQ(s, "END")) {
4642 av_unshift(PL_endav, 1);
4643 av_store(PL_endav, 0, SvREFCNT_inc(cv));
4646 else if (strEQ(s, "STOP")) {
4648 PL_stopav = newAV();
4649 av_unshift(PL_stopav, 1);
4650 av_store(PL_stopav, 0, SvREFCNT_inc(cv));
4653 else if (strEQ(s, "INIT")) {
4655 PL_initav = newAV();
4656 av_push(PL_initav, SvREFCNT_inc(cv));
4668 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4678 name = SvPVx(cSVOPo->op_sv, n_a);
4681 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4683 if (cv = GvFORM(gv)) {
4684 if (ckWARN(WARN_REDEFINE)) {
4685 line_t oldline = CopLINE(PL_curcop);
4687 CopLINE_set(PL_curcop, PL_copline);
4688 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4689 CopLINE_set(PL_curcop, oldline);
4695 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4696 CvFILE(cv) = CopFILE(PL_curcop);
4698 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4699 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4700 SvPADTMP_on(PL_curpad[ix]);
4703 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4704 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4705 OpREFCNT_set(CvROOT(cv), 1);
4706 CvSTART(cv) = LINKLIST(CvROOT(cv));
4707 CvROOT(cv)->op_next = 0;
4710 PL_copline = NOLINE;
4715 Perl_newANONLIST(pTHX_ OP *o)
4717 return newUNOP(OP_REFGEN, 0,
4718 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4722 Perl_newANONHASH(pTHX_ OP *o)
4724 return newUNOP(OP_REFGEN, 0,
4725 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4729 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4731 return newANONATTRSUB(floor, proto, Nullop, block);
4735 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4737 return newUNOP(OP_REFGEN, 0,
4738 newSVOP(OP_ANONCODE, 0,
4739 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4743 Perl_oopsAV(pTHX_ OP *o)
4745 switch (o->op_type) {
4747 o->op_type = OP_PADAV;
4748 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4749 return ref(o, OP_RV2AV);
4752 o->op_type = OP_RV2AV;
4753 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4758 if (ckWARN_d(WARN_INTERNAL))
4759 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsAV");
4766 Perl_oopsHV(pTHX_ OP *o)
4770 switch (o->op_type) {
4773 o->op_type = OP_PADHV;
4774 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4775 return ref(o, OP_RV2HV);
4779 o->op_type = OP_RV2HV;
4780 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4785 if (ckWARN_d(WARN_INTERNAL))
4786 Perl_warner(aTHX_ WARN_INTERNAL, "oops: oopsHV");
4793 Perl_newAVREF(pTHX_ OP *o)
4795 if (o->op_type == OP_PADANY) {
4796 o->op_type = OP_PADAV;
4797 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4800 return newUNOP(OP_RV2AV, 0, scalar(o));
4804 Perl_newGVREF(pTHX_ I32 type, OP *o)
4806 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4807 return newUNOP(OP_NULL, 0, o);
4808 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4812 Perl_newHVREF(pTHX_ OP *o)
4814 if (o->op_type == OP_PADANY) {
4815 o->op_type = OP_PADHV;
4816 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4819 return newUNOP(OP_RV2HV, 0, scalar(o));
4823 Perl_oopsCV(pTHX_ OP *o)
4825 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4831 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4833 return newUNOP(OP_RV2CV, flags, scalar(o));
4837 Perl_newSVREF(pTHX_ OP *o)
4839 if (o->op_type == OP_PADANY) {
4840 o->op_type = OP_PADSV;
4841 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4844 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4845 o->op_flags |= OPpDONE_SVREF;
4848 return newUNOP(OP_RV2SV, 0, scalar(o));
4851 /* Check routines. */
4854 Perl_ck_anoncode(pTHX_ OP *o)
4859 name = NEWSV(1106,0);
4860 sv_upgrade(name, SVt_PVNV);
4861 sv_setpvn(name, "&", 1);
4864 ix = pad_alloc(o->op_type, SVs_PADMY);
4865 av_store(PL_comppad_name, ix, name);
4866 av_store(PL_comppad, ix, cSVOPo->op_sv);
4867 SvPADMY_on(cSVOPo->op_sv);
4868 cSVOPo->op_sv = Nullsv;
4869 cSVOPo->op_targ = ix;
4874 Perl_ck_bitop(pTHX_ OP *o)
4876 o->op_private = PL_hints;
4881 Perl_ck_concat(pTHX_ OP *o)
4883 if (cUNOPo->op_first->op_type == OP_CONCAT)
4884 o->op_flags |= OPf_STACKED;
4889 Perl_ck_spair(pTHX_ OP *o)
4891 if (o->op_flags & OPf_KIDS) {
4894 OPCODE type = o->op_type;
4895 o = modkids(ck_fun(o), type);
4896 kid = cUNOPo->op_first;
4897 newop = kUNOP->op_first->op_sibling;
4899 (newop->op_sibling ||
4900 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4901 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4902 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4906 op_free(kUNOP->op_first);
4907 kUNOP->op_first = newop;
4909 o->op_ppaddr = PL_ppaddr[++o->op_type];
4914 Perl_ck_delete(pTHX_ OP *o)
4918 if (o->op_flags & OPf_KIDS) {
4919 OP *kid = cUNOPo->op_first;
4920 if (kid->op_type == OP_HSLICE)
4921 o->op_private |= OPpSLICE;
4922 else if (kid->op_type != OP_HELEM)
4923 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4924 PL_op_desc[o->op_type]);
4931 Perl_ck_eof(pTHX_ OP *o)
4933 I32 type = o->op_type;
4935 if (o->op_flags & OPf_KIDS) {
4936 if (cLISTOPo->op_first->op_type == OP_STUB) {
4938 o = newUNOP(type, OPf_SPECIAL,
4939 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4947 Perl_ck_eval(pTHX_ OP *o)
4949 PL_hints |= HINT_BLOCK_SCOPE;
4950 if (o->op_flags & OPf_KIDS) {
4951 SVOP *kid = (SVOP*)cUNOPo->op_first;
4954 o->op_flags &= ~OPf_KIDS;
4957 else if (kid->op_type == OP_LINESEQ) {
4960 kid->op_next = o->op_next;
4961 cUNOPo->op_first = 0;
4964 NewOp(1101, enter, 1, LOGOP);
4965 enter->op_type = OP_ENTERTRY;
4966 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4967 enter->op_private = 0;
4969 /* establish postfix order */
4970 enter->op_next = (OP*)enter;
4972 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4973 o->op_type = OP_LEAVETRY;
4974 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4975 enter->op_other = o;
4983 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4985 o->op_targ = (PADOFFSET)PL_hints;
4990 Perl_ck_exec(pTHX_ OP *o)
4993 if (o->op_flags & OPf_STACKED) {
4995 kid = cUNOPo->op_first->op_sibling;
4996 if (kid->op_type == OP_RV2GV)
5005 Perl_ck_exists(pTHX_ OP *o)
5008 if (o->op_flags & OPf_KIDS) {
5009 OP *kid = cUNOPo->op_first;
5010 if (kid->op_type != OP_HELEM)
5011 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
5019 Perl_ck_gvconst(pTHX_ register OP *o)
5021 o = fold_constants(o);
5022 if (o->op_type == OP_CONST)
5029 Perl_ck_rvconst(pTHX_ register OP *o)
5032 SVOP *kid = (SVOP*)cUNOPo->op_first;
5034 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5035 if (kid->op_type == OP_CONST) {
5039 SV *kidsv = kid->op_sv;
5042 /* Is it a constant from cv_const_sv()? */
5043 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
5044 SV *rsv = SvRV(kidsv);
5045 int svtype = SvTYPE(rsv);
5046 char *badtype = Nullch;
5048 switch (o->op_type) {
5050 if (svtype > SVt_PVMG)
5051 badtype = "a SCALAR";
5054 if (svtype != SVt_PVAV)
5055 badtype = "an ARRAY";
5058 if (svtype != SVt_PVHV) {
5059 if (svtype == SVt_PVAV) { /* pseudohash? */
5060 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
5061 if (ksv && SvROK(*ksv)
5062 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
5071 if (svtype != SVt_PVCV)
5076 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5079 name = SvPV(kidsv, n_a);
5080 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5081 char *badthing = Nullch;
5082 switch (o->op_type) {
5084 badthing = "a SCALAR";
5087 badthing = "an ARRAY";
5090 badthing = "a HASH";
5095 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5099 * This is a little tricky. We only want to add the symbol if we
5100 * didn't add it in the lexer. Otherwise we get duplicate strict
5101 * warnings. But if we didn't add it in the lexer, we must at
5102 * least pretend like we wanted to add it even if it existed before,
5103 * or we get possible typo warnings. OPpCONST_ENTERED says
5104 * whether the lexer already added THIS instance of this symbol.
5106 iscv = (o->op_type == OP_RV2CV) * 2;
5108 gv = gv_fetchpv(name,
5109 iscv | !(kid->op_private & OPpCONST_ENTERED),
5112 : o->op_type == OP_RV2SV
5114 : o->op_type == OP_RV2AV
5116 : o->op_type == OP_RV2HV
5119 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5121 kid->op_type = OP_GV;
5122 SvREFCNT_dec(kid->op_sv);
5124 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5125 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5127 PL_curpad[kPADOP->op_padix] = SvREFCNT_inc(gv);
5129 kid->op_sv = SvREFCNT_inc(gv);
5131 kid->op_ppaddr = PL_ppaddr[OP_GV];
5138 Perl_ck_ftst(pTHX_ OP *o)
5141 I32 type = o->op_type;
5143 if (o->op_flags & OPf_REF) {
5146 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5147 SVOP *kid = (SVOP*)cUNOPo->op_first;
5149 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5151 OP *newop = newGVOP(type, OPf_REF,
5152 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5159 if (type == OP_FTTTY)
5160 o = newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
5163 o = newUNOP(type, 0, newDEFSVOP());
5166 if (type == OP_FTTEXT || type == OP_FTBINARY) {
5168 if (PL_hints & HINT_LOCALE)
5169 o->op_private |= OPpLOCALE;
5176 Perl_ck_fun(pTHX_ OP *o)
5183 int type = o->op_type;
5184 register I32 oa = PL_opargs[type] >> OASHIFT;
5186 if (o->op_flags & OPf_STACKED) {
5187 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5190 return no_fh_allowed(o);
5193 if (o->op_flags & OPf_KIDS) {
5195 tokid = &cLISTOPo->op_first;
5196 kid = cLISTOPo->op_first;
5197 if (kid->op_type == OP_PUSHMARK ||
5198 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
5200 tokid = &kid->op_sibling;
5201 kid = kid->op_sibling;
5203 if (!kid && PL_opargs[type] & OA_DEFGV)
5204 *tokid = kid = newDEFSVOP();
5208 sibl = kid->op_sibling;
5211 /* list seen where single (scalar) arg expected? */
5212 if (numargs == 1 && !(oa >> 4)
5213 && kid->op_type == OP_LIST && type != OP_SCALAR)
5215 return too_many_arguments(o,PL_op_desc[type]);
5228 if (kid->op_type == OP_CONST &&
5229 (kid->op_private & OPpCONST_BARE))
5231 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5232 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5233 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5234 if (ckWARN(WARN_SYNTAX))
5235 Perl_warner(aTHX_ WARN_SYNTAX,
5236 "Array @%s missing the @ in argument %"IVdf" of %s()",
5237 name, (IV)numargs, PL_op_desc[type]);
5240 kid->op_sibling = sibl;
5243 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5244 bad_type(numargs, "array", PL_op_desc[type], kid);
5248 if (kid->op_type == OP_CONST &&
5249 (kid->op_private & OPpCONST_BARE))
5251 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5252 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5253 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5254 if (ckWARN(WARN_SYNTAX))
5255 Perl_warner(aTHX_ WARN_SYNTAX,
5256 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5257 name, (IV)numargs, PL_op_desc[type]);
5260 kid->op_sibling = sibl;
5263 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5264 bad_type(numargs, "hash", PL_op_desc[type], kid);
5269 OP *newop = newUNOP(OP_NULL, 0, kid);
5270 kid->op_sibling = 0;
5272 newop->op_next = newop;
5274 kid->op_sibling = sibl;
5279 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5280 if (kid->op_type == OP_CONST &&
5281 (kid->op_private & OPpCONST_BARE))
5283 OP *newop = newGVOP(OP_GV, 0,
5284 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5289 else if (kid->op_type == OP_READLINE) {
5290 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5291 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
5294 I32 flags = OPf_SPECIAL;
5298 /* is this op a FH constructor? */
5299 if (is_handle_constructor(o,numargs)) {
5300 char *name = Nullch;
5304 /* Set a flag to tell rv2gv to vivify
5305 * need to "prove" flag does not mean something
5306 * else already - NI-S 1999/05/07
5309 if (kid->op_type == OP_PADSV) {
5310 SV **namep = av_fetch(PL_comppad_name,
5312 if (namep && *namep)
5313 name = SvPV(*namep, len);
5315 else if (kid->op_type == OP_RV2SV
5316 && kUNOP->op_first->op_type == OP_GV)
5318 GV *gv = cGVOPx_gv(kUNOP->op_first);
5320 len = GvNAMELEN(gv);
5324 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5325 namesv = PL_curpad[targ];
5326 SvUPGRADE(namesv, SVt_PV);
5328 sv_setpvn(namesv, "$", 1);
5329 sv_catpvn(namesv, name, len);
5332 kid->op_sibling = 0;
5333 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5334 kid->op_targ = targ;
5335 kid->op_private |= priv;
5337 kid->op_sibling = sibl;
5343 mod(scalar(kid), type);
5347 tokid = &kid->op_sibling;
5348 kid = kid->op_sibling;
5350 o->op_private |= numargs;
5352 return too_many_arguments(o,PL_op_desc[o->op_type]);
5355 else if (PL_opargs[type] & OA_DEFGV) {
5357 return newUNOP(type, 0, newDEFSVOP());
5361 while (oa & OA_OPTIONAL)
5363 if (oa && oa != OA_LIST)
5364 return too_few_arguments(o,PL_op_desc[o->op_type]);
5370 Perl_ck_glob(pTHX_ OP *o)
5374 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5375 append_elem(OP_GLOB, o, newDEFSVOP());
5377 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
5378 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5380 #if !defined(PERL_EXTERNAL_GLOB)
5381 /* XXX this can be tightened up and made more failsafe. */
5383 OP *modname = newSVOP(OP_CONST, 0, newSVpvn("File::Glob", 10));
5384 modname->op_private |= OPpCONST_BARE;
5386 utilize(1, start_subparse(FALSE, 0), Nullop, modname,
5387 newSVOP(OP_CONST, 0, newSVpvn(":globally", 9)));
5388 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5391 #endif /* PERL_EXTERNAL_GLOB */
5393 if (gv && GvIMPORTED_CV(gv)) {
5394 append_elem(OP_GLOB, o,
5395 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5396 o->op_type = OP_LIST;
5397 o->op_ppaddr = PL_ppaddr[OP_LIST];
5398 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5399 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5400 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5401 append_elem(OP_LIST, o,
5402 scalar(newUNOP(OP_RV2CV, 0,
5403 newGVOP(OP_GV, 0, gv)))));
5404 o = newUNOP(OP_NULL, 0, ck_subr(o));
5405 o->op_targ = OP_GLOB; /* hint at what it used to be */
5408 gv = newGVgen("main");
5410 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5416 Perl_ck_grep(pTHX_ OP *o)
5420 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5422 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5423 NewOp(1101, gwop, 1, LOGOP);
5425 if (o->op_flags & OPf_STACKED) {
5428 kid = cLISTOPo->op_first->op_sibling;
5429 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5432 kid->op_next = (OP*)gwop;
5433 o->op_flags &= ~OPf_STACKED;
5435 kid = cLISTOPo->op_first->op_sibling;
5436 if (type == OP_MAPWHILE)
5443 kid = cLISTOPo->op_first->op_sibling;
5444 if (kid->op_type != OP_NULL)
5445 Perl_croak(aTHX_ "panic: ck_grep");
5446 kid = kUNOP->op_first;
5448 gwop->op_type = type;
5449 gwop->op_ppaddr = PL_ppaddr[type];
5450 gwop->op_first = listkids(o);
5451 gwop->op_flags |= OPf_KIDS;
5452 gwop->op_private = 1;
5453 gwop->op_other = LINKLIST(kid);
5454 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5455 kid->op_next = (OP*)gwop;
5457 kid = cLISTOPo->op_first->op_sibling;
5458 if (!kid || !kid->op_sibling)
5459 return too_few_arguments(o,PL_op_desc[o->op_type]);
5460 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5461 mod(kid, OP_GREPSTART);
5467 Perl_ck_index(pTHX_ OP *o)
5469 if (o->op_flags & OPf_KIDS) {
5470 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5472 kid = kid->op_sibling; /* get past "big" */
5473 if (kid && kid->op_type == OP_CONST)
5474 fbm_compile(((SVOP*)kid)->op_sv, 0);
5480 Perl_ck_lengthconst(pTHX_ OP *o)
5482 /* XXX length optimization goes here */
5487 Perl_ck_lfun(pTHX_ OP *o)
5489 OPCODE type = o->op_type;
5490 return modkids(ck_fun(o), type);
5494 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5497 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5498 switch (cUNOPo->op_first->op_type) {
5500 break; /* Globals via GV can be undef */
5502 case OP_AASSIGN: /* Is this a good idea? */
5503 Perl_warner(aTHX_ WARN_DEPRECATED,
5504 "defined(@array) is deprecated");
5505 Perl_warner(aTHX_ WARN_DEPRECATED,
5506 "(Maybe you should just omit the defined()?)\n");
5509 break; /* Globals via GV can be undef */
5511 Perl_warner(aTHX_ WARN_DEPRECATED,
5512 "defined(%hash) is deprecated");
5513 Perl_warner(aTHX_ WARN_DEPRECATED,
5514 "(Maybe you should just omit the defined()?)\n");
5525 Perl_ck_rfun(pTHX_ OP *o)
5527 OPCODE type = o->op_type;
5528 return refkids(ck_fun(o), type);
5532 Perl_ck_listiob(pTHX_ OP *o)
5536 kid = cLISTOPo->op_first;
5539 kid = cLISTOPo->op_first;
5541 if (kid->op_type == OP_PUSHMARK)
5542 kid = kid->op_sibling;
5543 if (kid && o->op_flags & OPf_STACKED)
5544 kid = kid->op_sibling;
5545 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5546 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5547 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5548 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5549 cLISTOPo->op_first->op_sibling = kid;
5550 cLISTOPo->op_last = kid;
5551 kid = kid->op_sibling;
5556 append_elem(o->op_type, o, newDEFSVOP());
5562 if (PL_hints & HINT_LOCALE)
5563 o->op_private |= OPpLOCALE;
5570 Perl_ck_fun_locale(pTHX_ OP *o)
5576 if (PL_hints & HINT_LOCALE)
5577 o->op_private |= OPpLOCALE;
5584 Perl_ck_sassign(pTHX_ OP *o)
5586 OP *kid = cLISTOPo->op_first;
5587 /* has a disposable target? */
5588 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5589 && !(kid->op_flags & OPf_STACKED))
5591 OP *kkid = kid->op_sibling;
5593 /* Can just relocate the target. */
5594 if (kkid && kkid->op_type == OP_PADSV
5595 && !(kkid->op_private & OPpLVAL_INTRO))
5597 kid->op_targ = kkid->op_targ;
5599 /* Now we do not need PADSV and SASSIGN. */
5600 kid->op_sibling = o->op_sibling; /* NULL */
5601 cLISTOPo->op_first = NULL;
5604 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5612 Perl_ck_scmp(pTHX_ OP *o)
5616 if (PL_hints & HINT_LOCALE)
5617 o->op_private |= OPpLOCALE;
5624 Perl_ck_match(pTHX_ OP *o)
5626 o->op_private |= OPpRUNTIME;
5631 Perl_ck_method(pTHX_ OP *o)
5633 OP *kid = cUNOPo->op_first;
5634 if (kid->op_type == OP_CONST) {
5635 SV* sv = kSVOP->op_sv;
5636 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5638 sv_upgrade(sv, SVt_PVIV);
5640 PERL_HASH(SvUVX(sv), SvPVX(sv), SvCUR(sv));
5641 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5642 kSVOP->op_sv = Nullsv;
5651 Perl_ck_null(pTHX_ OP *o)
5657 Perl_ck_repeat(pTHX_ OP *o)
5659 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5660 o->op_private |= OPpREPEAT_DOLIST;
5661 cBINOPo->op_first = force_list(cBINOPo->op_first);
5669 Perl_ck_require(pTHX_ OP *o)
5671 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5672 SVOP *kid = (SVOP*)cUNOPo->op_first;
5674 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5676 for (s = SvPVX(kid->op_sv); *s; s++) {
5677 if (*s == ':' && s[1] == ':') {
5679 Move(s+2, s+1, strlen(s+2)+1, char);
5680 --SvCUR(kid->op_sv);
5683 sv_catpvn(kid->op_sv, ".pm", 3);
5691 Perl_ck_retarget(pTHX_ OP *o)
5693 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5700 Perl_ck_select(pTHX_ OP *o)
5703 if (o->op_flags & OPf_KIDS) {
5704 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5705 if (kid && kid->op_sibling) {
5706 o->op_type = OP_SSELECT;
5707 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5709 return fold_constants(o);
5713 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5714 if (kid && kid->op_type == OP_RV2GV)
5715 kid->op_private &= ~HINT_STRICT_REFS;
5720 Perl_ck_shift(pTHX_ OP *o)
5722 I32 type = o->op_type;
5724 if (!(o->op_flags & OPf_KIDS)) {
5729 if (!CvUNIQUE(PL_compcv)) {
5730 argop = newOP(OP_PADAV, OPf_REF);
5731 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5734 argop = newUNOP(OP_RV2AV, 0,
5735 scalar(newGVOP(OP_GV, 0,
5736 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5739 argop = newUNOP(OP_RV2AV, 0,
5740 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5741 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5742 #endif /* USE_THREADS */
5743 return newUNOP(type, 0, scalar(argop));
5745 return scalar(modkids(ck_fun(o), type));
5749 Perl_ck_sort(pTHX_ OP *o)
5753 if (PL_hints & HINT_LOCALE)
5754 o->op_private |= OPpLOCALE;
5757 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5759 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5760 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5762 kid = kUNOP->op_first; /* get past null */
5764 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5766 if (kid->op_type == OP_SCOPE) {
5770 else if (kid->op_type == OP_LEAVE) {
5771 if (o->op_type == OP_SORT) {
5772 null(kid); /* wipe out leave */
5775 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5776 if (k->op_next == kid)
5781 kid->op_next = 0; /* just disconnect the leave */
5782 k = kLISTOP->op_first;
5786 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5787 if (o->op_type == OP_SORT)
5791 o->op_flags |= OPf_SPECIAL;
5793 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5794 null(cLISTOPo->op_first->op_sibling);
5801 S_simplify_sort(pTHX_ OP *o)
5804 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5808 if (!(o->op_flags & OPf_STACKED))
5810 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5811 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5812 kid = kUNOP->op_first; /* get past null */
5813 if (kid->op_type != OP_SCOPE)
5815 kid = kLISTOP->op_last; /* get past scope */
5816 switch(kid->op_type) {
5824 k = kid; /* remember this node*/
5825 if (kBINOP->op_first->op_type != OP_RV2SV)
5827 kid = kBINOP->op_first; /* get past cmp */
5828 if (kUNOP->op_first->op_type != OP_GV)
5830 kid = kUNOP->op_first; /* get past rv2sv */
5832 if (GvSTASH(gv) != PL_curstash)
5834 if (strEQ(GvNAME(gv), "a"))
5836 else if(strEQ(GvNAME(gv), "b"))
5840 kid = k; /* back to cmp */
5841 if (kBINOP->op_last->op_type != OP_RV2SV)
5843 kid = kBINOP->op_last; /* down to 2nd arg */
5844 if (kUNOP->op_first->op_type != OP_GV)
5846 kid = kUNOP->op_first; /* get past rv2sv */
5848 if (GvSTASH(gv) != PL_curstash
5850 ? strNE(GvNAME(gv), "a")
5851 : strNE(GvNAME(gv), "b")))
5853 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5855 o->op_private |= OPpSORT_REVERSE;
5856 if (k->op_type == OP_NCMP)
5857 o->op_private |= OPpSORT_NUMERIC;
5858 if (k->op_type == OP_I_NCMP)
5859 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5860 kid = cLISTOPo->op_first->op_sibling;
5861 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5862 op_free(kid); /* then delete it */
5863 cLISTOPo->op_children--;
5867 Perl_ck_split(pTHX_ OP *o)
5871 if (o->op_flags & OPf_STACKED)
5872 return no_fh_allowed(o);
5874 kid = cLISTOPo->op_first;
5875 if (kid->op_type != OP_NULL)
5876 Perl_croak(aTHX_ "panic: ck_split");
5877 kid = kid->op_sibling;
5878 op_free(cLISTOPo->op_first);
5879 cLISTOPo->op_first = kid;
5881 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5882 cLISTOPo->op_last = kid; /* There was only one element previously */
5885 if (kid->op_type != OP_MATCH) {
5886 OP *sibl = kid->op_sibling;
5887 kid->op_sibling = 0;
5888 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5889 if (cLISTOPo->op_first == cLISTOPo->op_last)
5890 cLISTOPo->op_last = kid;
5891 cLISTOPo->op_first = kid;
5892 kid->op_sibling = sibl;
5895 kid->op_type = OP_PUSHRE;
5896 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5899 if (!kid->op_sibling)
5900 append_elem(OP_SPLIT, o, newDEFSVOP());
5902 kid = kid->op_sibling;
5905 if (!kid->op_sibling)
5906 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5908 kid = kid->op_sibling;
5911 if (kid->op_sibling)
5912 return too_many_arguments(o,PL_op_desc[o->op_type]);
5918 Perl_ck_join(pTHX_ OP *o)
5920 if (ckWARN(WARN_SYNTAX)) {
5921 OP *kid = cLISTOPo->op_first->op_sibling;
5922 if (kid && kid->op_type == OP_MATCH) {
5923 char *pmstr = "STRING";
5924 if (kPMOP->op_pmregexp)
5925 pmstr = kPMOP->op_pmregexp->precomp;
5926 Perl_warner(aTHX_ WARN_SYNTAX,
5927 "/%s/ should probably be written as \"%s\"",
5935 Perl_ck_subr(pTHX_ OP *o)
5938 OP *prev = ((cUNOPo->op_first->op_sibling)
5939 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5940 OP *o2 = prev->op_sibling;
5949 o->op_private |= OPpENTERSUB_HASTARG;
5950 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5951 if (cvop->op_type == OP_RV2CV) {
5953 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5954 null(cvop); /* disable rv2cv */
5955 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5956 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5957 GV *gv = cGVOPx_gv(tmpop);
5960 tmpop->op_private |= OPpEARLY_CV;
5961 else if (SvPOK(cv)) {
5962 namegv = CvANON(cv) ? gv : CvGV(cv);
5963 proto = SvPV((SV*)cv, n_a);
5967 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
5968 if (o2->op_type == OP_CONST)
5969 o2->op_private &= ~OPpCONST_STRICT;
5970 else if (o2->op_type == OP_LIST) {
5971 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5972 if (o && o->op_type == OP_CONST)
5973 o->op_private &= ~OPpCONST_STRICT;
5976 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5977 if (PERLDB_SUB && PL_curstash != PL_debstash)
5978 o->op_private |= OPpENTERSUB_DB;
5979 while (o2 != cvop) {
5983 return too_many_arguments(o, gv_ename(namegv));
6001 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6002 bad_type(arg, "block", gv_ename(namegv), o2);
6005 /* '*' allows any scalar type, including bareword */
6008 if (o2->op_type == OP_RV2GV)
6009 goto wrapref; /* autoconvert GLOB -> GLOBref */
6010 else if (o2->op_type == OP_CONST)
6011 o2->op_private &= ~OPpCONST_STRICT;
6012 else if (o2->op_type == OP_ENTERSUB) {
6013 /* accidental subroutine, revert to bareword */
6014 OP *gvop = ((UNOP*)o2)->op_first;
6015 if (gvop && gvop->op_type == OP_NULL) {
6016 gvop = ((UNOP*)gvop)->op_first;
6018 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6021 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6022 (gvop = ((UNOP*)gvop)->op_first) &&
6023 gvop->op_type == OP_GV)
6025 GV *gv = cGVOPx_gv(gvop);
6026 OP *sibling = o2->op_sibling;
6027 SV *n = newSVpvn("",0);
6029 gv_fullname3(n, gv, "");
6030 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6031 sv_chop(n, SvPVX(n)+6);
6032 o2 = newSVOP(OP_CONST, 0, n);
6033 prev->op_sibling = o2;
6034 o2->op_sibling = sibling;
6046 if (o2->op_type != OP_RV2GV)
6047 bad_type(arg, "symbol", gv_ename(namegv), o2);
6050 if (o2->op_type != OP_RV2CV)
6051 bad_type(arg, "sub", gv_ename(namegv), o2);
6054 if (o2->op_type != OP_RV2SV
6055 && o2->op_type != OP_PADSV
6056 && o2->op_type != OP_HELEM
6057 && o2->op_type != OP_AELEM
6058 && o2->op_type != OP_THREADSV)
6060 bad_type(arg, "scalar", gv_ename(namegv), o2);
6064 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
6065 bad_type(arg, "array", gv_ename(namegv), o2);
6068 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
6069 bad_type(arg, "hash", gv_ename(namegv), o2);
6073 OP* sib = kid->op_sibling;
6074 kid->op_sibling = 0;
6075 o2 = newUNOP(OP_REFGEN, 0, kid);
6076 o2->op_sibling = sib;
6077 prev->op_sibling = o2;
6088 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
6089 gv_ename(namegv), SvPV((SV*)cv, n_a));
6094 mod(o2, OP_ENTERSUB);
6096 o2 = o2->op_sibling;
6098 if (proto && !optional &&
6099 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6100 return too_few_arguments(o, gv_ename(namegv));
6105 Perl_ck_svconst(pTHX_ OP *o)
6107 SvREADONLY_on(cSVOPo->op_sv);
6112 Perl_ck_trunc(pTHX_ OP *o)
6114 if (o->op_flags & OPf_KIDS) {
6115 SVOP *kid = (SVOP*)cUNOPo->op_first;
6117 if (kid->op_type == OP_NULL)
6118 kid = (SVOP*)kid->op_sibling;
6119 if (kid && kid->op_type == OP_CONST &&
6120 (kid->op_private & OPpCONST_BARE))
6122 o->op_flags |= OPf_SPECIAL;
6123 kid->op_private &= ~OPpCONST_STRICT;
6129 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6132 Perl_peep(pTHX_ register OP *o)
6135 register OP* oldop = 0;
6137 OP *last_composite = Nullop;
6139 if (!o || o->op_seq)
6143 SAVEVPTR(PL_curcop);
6144 for (; o; o = o->op_next) {
6150 switch (o->op_type) {
6154 PL_curcop = ((COP*)o); /* for warnings */
6155 o->op_seq = PL_op_seqmax++;
6156 last_composite = Nullop;
6160 if (cSVOPo->op_private & OPpCONST_STRICT)
6161 no_bareword_allowed(o);
6163 /* Relocate sv to the pad for thread safety.
6164 * Despite being a "constant", the SV is written to,
6165 * for reference counts, sv_upgrade() etc. */
6167 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6168 SvREFCNT_dec(PL_curpad[ix]);
6169 SvPADTMP_on(cSVOPo->op_sv);
6170 PL_curpad[ix] = cSVOPo->op_sv;
6171 cSVOPo->op_sv = Nullsv;
6183 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6184 if (o->op_next->op_private & OPpTARGET_MY) {
6185 if (o->op_flags & OPf_STACKED) /* chained concats */
6186 goto ignore_optimization;
6188 o->op_targ = o->op_next->op_targ;
6189 o->op_next->op_targ = 0;
6190 o->op_private |= OPpTARGET_MY;
6195 ignore_optimization:
6196 o->op_seq = PL_op_seqmax++;
6199 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6200 o->op_seq = PL_op_seqmax++;
6201 break; /* Scalar stub must produce undef. List stub is noop */
6205 if (o->op_targ == OP_NEXTSTATE
6206 || o->op_targ == OP_DBSTATE
6207 || o->op_targ == OP_SETSTATE)
6209 PL_curcop = ((COP*)o);
6216 if (oldop && o->op_next) {
6217 oldop->op_next = o->op_next;
6220 o->op_seq = PL_op_seqmax++;
6224 if (o->op_next->op_type == OP_RV2SV) {
6225 if (!(o->op_next->op_private & OPpDEREF)) {
6227 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
6228 o->op_next = o->op_next->op_next;
6229 o->op_type = OP_GVSV;
6230 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6233 else if (o->op_next->op_type == OP_RV2AV) {
6234 OP* pop = o->op_next->op_next;
6236 if (pop->op_type == OP_CONST &&
6237 (PL_op = pop->op_next) &&
6238 pop->op_next->op_type == OP_AELEM &&
6239 !(pop->op_next->op_private &
6240 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
6241 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
6249 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6250 o->op_next = pop->op_next->op_next;
6251 o->op_type = OP_AELEMFAST;
6252 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6253 o->op_private = (U8)i;
6258 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_UNSAFE)) {
6260 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6261 /* XXX could check prototype here instead of just carping */
6262 SV *sv = sv_newmortal();
6263 gv_efullname3(sv, gv, Nullch);
6264 Perl_warner(aTHX_ WARN_UNSAFE,
6265 "%s() called too early to check prototype",
6270 o->op_seq = PL_op_seqmax++;
6281 o->op_seq = PL_op_seqmax++;
6282 while (cLOGOP->op_other->op_type == OP_NULL)
6283 cLOGOP->op_other = cLOGOP->op_other->op_next;
6284 peep(cLOGOP->op_other);
6288 o->op_seq = PL_op_seqmax++;
6289 peep(cLOOP->op_redoop);
6290 peep(cLOOP->op_nextop);
6291 peep(cLOOP->op_lastop);
6297 o->op_seq = PL_op_seqmax++;
6298 peep(cPMOP->op_pmreplstart);
6302 o->op_seq = PL_op_seqmax++;
6303 if (ckWARN(WARN_SYNTAX) && o->op_next
6304 && o->op_next->op_type == OP_NEXTSTATE) {
6305 if (o->op_next->op_sibling &&
6306 o->op_next->op_sibling->op_type != OP_EXIT &&
6307 o->op_next->op_sibling->op_type != OP_WARN &&
6308 o->op_next->op_sibling->op_type != OP_DIE) {
6309 line_t oldline = CopLINE(PL_curcop);
6311 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6312 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
6313 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
6314 CopLINE_set(PL_curcop, oldline);
6328 if ((o->op_private & (OPpLVAL_INTRO))
6329 || ((BINOP*)o)->op_last->op_type != OP_CONST)
6331 rop = (UNOP*)((BINOP*)o)->op_first;
6332 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
6334 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
6335 if (!SvOBJECT(lexname))
6337 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
6338 if (!fields || !GvHV(*fields))
6340 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6341 key = SvPV(*svp, keylen);
6342 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
6344 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\" in variable %s of type %s",
6345 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
6347 ind = SvIV(*indsvp);
6349 Perl_croak(aTHX_ "Bad index while coercing array into hash");
6350 rop->op_type = OP_RV2AV;
6351 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
6352 o->op_type = OP_AELEM;
6353 o->op_ppaddr = PL_ppaddr[OP_AELEM];
6355 *svp = newSViv(ind);
6361 if (!(o->op_flags & OPf_WANT)
6362 || (o->op_flags & OPf_WANT) == OPf_WANT_LIST)
6366 o->op_seq = PL_op_seqmax++;
6370 if (o->op_next && o->op_next->op_type != OP_LEAVESUBLV) {
6371 o->op_seq = PL_op_seqmax++;
6377 if (last_composite) {
6378 OP *r = last_composite;
6380 while (r->op_sibling)
6383 || (r->op_next->op_type == OP_LIST
6384 && r->op_next->op_next == o))
6386 if (last_composite->op_type == OP_RV2AV)
6387 yyerror("Lvalue subs returning arrays not implemented yet");
6389 yyerror("Lvalue subs returning hashes not implemented yet");
6396 o->op_seq = PL_op_seqmax++;