3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "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
22 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
59 SV* tmpsv = sv_newmortal();
60 gv_efullname3(tmpsv, gv, Nullch);
61 return SvPV(tmpsv,PL_na);
67 yyerror(form("Missing comma after first argument to %s function",
68 op_desc[o->op_type]));
73 too_few_arguments(OP *o, char *name)
75 yyerror(form("Not enough arguments for %s", name));
80 too_many_arguments(OP *o, char *name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(I32 n, char *t, char *name, OP *kid)
89 yyerror(form("Type of arg %d to %s must be %s (not %s)",
90 (int)n, name, t, op_desc[kid->op_type]));
96 int type = o->op_type;
97 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
98 yyerror(form("Can't use subscript on %s", op_desc[type]));
99 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
101 SV *msg = sv_2mortal(
102 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
103 type == OP_ENTERSUB ? '&' : '%'));
107 sv_catsv(GvSV(PL_errgv), msg);
109 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
114 /* "register" allocation */
117 pad_allocmy(char *name)
123 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
124 if (!isPRINT(name[1])) {
126 name[2] = toCTRL(name[1]);
129 croak("Can't use global %s in \"my\"",name);
131 if (PL_dowarn && AvFILLp(PL_comppad_name) >= 0) {
132 SV **svp = AvARRAY(PL_comppad_name);
133 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
135 && sv != &PL_sv_undef
136 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
137 && strEQ(name, SvPVX(sv)))
139 warn("\"my\" variable %s masks earlier declaration in same %s",
140 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
145 off = pad_alloc(OP_PADSV, SVs_PADMY);
147 sv_upgrade(sv, SVt_PVNV);
149 if (PL_in_my_stash) {
151 croak("Can't declare class for non-scalar %s in \"my\"",name);
153 (void)SvUPGRADE(sv, SVt_PVMG);
154 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
157 av_store(PL_comppad_name, off, sv);
158 SvNVX(sv) = (double)PAD_MAX;
159 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
160 if (!PL_min_intro_pending)
161 PL_min_intro_pending = off;
162 PL_max_intro_pending = off;
164 av_store(PL_comppad, off, (SV*)newAV());
165 else if (*name == '%')
166 av_store(PL_comppad, off, (SV*)newHV());
167 SvPADMY_on(PL_curpad[off]);
172 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
179 register PERL_CONTEXT *cx;
181 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
182 AV *curlist = CvPADLIST(cv);
183 SV **svp = av_fetch(curlist, 0, FALSE);
186 if (!svp || *svp == &PL_sv_undef)
189 svp = AvARRAY(curname);
190 for (off = AvFILLp(curname); off > 0; off--) {
191 if ((sv = svp[off]) &&
192 sv != &PL_sv_undef &&
194 seq > I_32(SvNVX(sv)) &&
195 strEQ(SvPVX(sv), name))
206 return 0; /* don't clone from inactive stack frame */
210 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
211 oldsv = *av_fetch(oldpad, off, TRUE);
212 if (!newoff) { /* Not a mere clone operation. */
213 SV *namesv = NEWSV(1103,0);
214 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
215 sv_upgrade(namesv, SVt_PVNV);
216 sv_setpv(namesv, name);
217 av_store(PL_comppad_name, newoff, namesv);
218 SvNVX(namesv) = (double)PL_curcop->cop_seq;
219 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
220 SvFAKE_on(namesv); /* A ref, not a real var */
221 if (SvOBJECT(svp[off])) { /* A typed var */
223 (void)SvUPGRADE(namesv, SVt_PVMG);
224 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(svp[off]));
227 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
228 /* "It's closures all the way down." */
229 CvCLONE_on(PL_compcv);
231 if (CvANON(PL_compcv))
232 oldsv = Nullsv; /* no need to keep ref */
237 bcv && bcv != cv && !CvCLONE(bcv);
238 bcv = CvOUTSIDE(bcv))
244 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
247 "Variable \"%s\" may be unavailable",
255 else if (!CvUNIQUE(PL_compcv)) {
256 if (PL_dowarn && !SvFAKE(sv) && !CvUNIQUE(cv))
257 warn("Variable \"%s\" will not stay shared", name);
260 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
266 /* Nothing in current lexical context--try eval's context, if any.
267 * This is necessary to let the perldb get at lexically scoped variables.
268 * XXX This will also probably interact badly with eval tree caching.
271 for (i = cx_ix; i >= 0; i--) {
273 switch (CxTYPE(cx)) {
275 if (i == 0 && saweval) {
276 seq = cxstack[saweval].blk_oldcop->cop_seq;
277 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
281 switch (cx->blk_eval.old_op_type) {
287 /* require must have its own scope */
295 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
296 saweval = i; /* so we know where we were called from */
299 seq = cxstack[saweval].blk_oldcop->cop_seq;
300 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
308 pad_findmy(char *name)
314 SV **svp = AvARRAY(PL_comppad_name);
315 U32 seq = PL_cop_seqmax;
321 * Special case to get lexical (and hence per-thread) @_.
322 * XXX I need to find out how to tell at parse-time whether use
323 * of @_ should refer to a lexical (from a sub) or defgv (global
324 * scope and maybe weird sub-ish things like formats). See
325 * startsub in perly.y. It's possible that @_ could be lexical
326 * (at least from subs) even in non-threaded perl.
328 if (strEQ(name, "@_"))
329 return 0; /* success. (NOT_IN_PAD indicates failure) */
330 #endif /* USE_THREADS */
332 /* The one we're looking for is probably just before comppad_name_fill. */
333 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
334 if ((sv = svp[off]) &&
335 sv != &PL_sv_undef &&
338 seq > I_32(SvNVX(sv)))) &&
339 strEQ(SvPVX(sv), name))
342 return (PADOFFSET)off;
343 pendoff = off; /* this pending def. will override import */
347 outside = CvOUTSIDE(PL_compcv);
349 /* Check if if we're compiling an eval'', and adjust seq to be the
350 * eval's seq number. This depends on eval'' having a non-null
351 * CvOUTSIDE() while it is being compiled. The eval'' itself is
352 * identified by CvUNIQUE being set and CvGV being null. */
353 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
354 cx = &cxstack[cxstack_ix];
356 seq = cx->blk_oldcop->cop_seq;
359 /* See if it's in a nested scope */
360 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
362 /* If there is a pending local definition, this new alias must die */
364 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
365 return off; /* pad_findlex returns 0 for failure...*/
367 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
371 pad_leavemy(I32 fill)
374 SV **svp = AvARRAY(PL_comppad_name);
376 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
377 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
378 if ((sv = svp[off]) && sv != &PL_sv_undef)
379 warn("%s never introduced", SvPVX(sv));
382 /* "Deintroduce" my variables that are leaving with this scope. */
383 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
384 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
385 SvIVX(sv) = PL_cop_seqmax;
390 pad_alloc(I32 optype, U32 tmptype)
396 if (AvARRAY(PL_comppad) != PL_curpad)
397 croak("panic: pad_alloc");
398 if (PL_pad_reset_pending)
400 if (tmptype & SVs_PADMY) {
402 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
403 } while (SvPADBUSY(sv)); /* need a fresh one */
404 retval = AvFILLp(PL_comppad);
407 SV **names = AvARRAY(PL_comppad_name);
408 SSize_t names_fill = AvFILLp(PL_comppad_name);
411 * "foreach" index vars temporarily become aliases to non-"my"
412 * values. Thus we must skip, not just pad values that are
413 * marked as current pad values, but also those with names.
415 if (++PL_padix <= names_fill &&
416 (sv = names[PL_padix]) && sv != &PL_sv_undef)
418 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
419 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
424 SvFLAGS(sv) |= tmptype;
425 PL_curpad = AvARRAY(PL_comppad);
427 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
428 (unsigned long) thr, (unsigned long) PL_curpad,
429 (long) retval, op_name[optype]));
431 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
432 (unsigned long) PL_curpad,
433 (long) retval, op_name[optype]));
434 #endif /* USE_THREADS */
435 return (PADOFFSET)retval;
443 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
444 (unsigned long) thr, (unsigned long) PL_curpad, po));
447 croak("panic: pad_sv po");
448 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
449 (unsigned long) PL_curpad, po));
450 #endif /* USE_THREADS */
451 return PL_curpad[po]; /* eventually we'll turn this into a macro */
455 pad_free(PADOFFSET po)
460 if (AvARRAY(PL_comppad) != PL_curpad)
461 croak("panic: pad_free curpad");
463 croak("panic: pad_free po");
465 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
466 (unsigned long) thr, (unsigned long) PL_curpad, po));
468 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
469 (unsigned long) PL_curpad, po));
470 #endif /* USE_THREADS */
471 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
472 SvPADTMP_off(PL_curpad[po]);
473 if ((I32)po < PL_padix)
478 pad_swipe(PADOFFSET po)
481 if (AvARRAY(PL_comppad) != PL_curpad)
482 croak("panic: pad_swipe curpad");
484 croak("panic: pad_swipe po");
486 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
487 (unsigned long) thr, (unsigned long) PL_curpad, po));
489 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
490 (unsigned long) PL_curpad, po));
491 #endif /* USE_THREADS */
492 SvPADTMP_off(PL_curpad[po]);
493 PL_curpad[po] = NEWSV(1107,0);
494 SvPADTMP_on(PL_curpad[po]);
495 if ((I32)po < PL_padix)
499 /* XXX pad_reset() is currently disabled because it results in serious bugs.
500 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
501 * on the stack by OPs that use them, there are several ways to get an alias
502 * to a shared TARG. Such an alias will change randomly and unpredictably.
503 * We avoid doing this until we can think of a Better Way.
508 #ifdef USE_BROKEN_PAD_RESET
512 if (AvARRAY(PL_comppad) != PL_curpad)
513 croak("panic: pad_reset curpad");
515 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
516 (unsigned long) thr, (unsigned long) PL_curpad));
518 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
519 (unsigned long) PL_curpad));
520 #endif /* USE_THREADS */
521 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
522 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
523 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
524 SvPADTMP_off(PL_curpad[po]);
526 PL_padix = PL_padix_floor;
529 PL_pad_reset_pending = FALSE;
533 /* find_threadsv is not reentrant */
535 find_threadsv(char *name)
541 /* We currently only handle names of a single character */
542 p = strchr(PL_threadsv_names, *name);
545 key = p - PL_threadsv_names;
546 svp = av_fetch(thr->threadsv, key, FALSE);
548 SV *sv = NEWSV(0, 0);
549 av_store(thr->threadsv, key, sv);
550 thr->threadsvp = AvARRAY(thr->threadsv);
552 * Some magic variables used to be automagically initialised
553 * in gv_fetchpv. Those which are now per-thread magicals get
554 * initialised here instead.
560 sv_setpv(sv, "\034");
561 sv_magic(sv, 0, 0, name, 1);
566 PL_sawampersand = TRUE;
570 /* XXX %! tied to Errno.pm needs to be added here.
571 * See gv_fetchpv(). */
575 sv_magic(sv, 0, 0, name, 1);
577 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
578 "find_threadsv: new SV %p for $%s%c\n",
579 sv, (*name < 32) ? "^" : "",
580 (*name < 32) ? toCTRL(*name) : *name));
584 #endif /* USE_THREADS */
591 register OP *kid, *nextkid;
593 if (!o || o->op_seq == (U16)-1)
596 if (o->op_flags & OPf_KIDS) {
597 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
598 nextkid = kid->op_sibling; /* Get before next freeing kid */
603 switch (o->op_type) {
605 o->op_targ = 0; /* Was holding old type, if any. */
608 o->op_targ = 0; /* Was holding hints. */
612 if (!(o->op_flags & OPf_SPECIAL))
616 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
618 #endif /* USE_THREADS */
620 if (!(o->op_flags & OPf_REF)
621 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
627 SvREFCNT_dec(cGVOPo->op_gv);
631 Safefree(cCOPo->cop_label);
632 SvREFCNT_dec(cCOPo->cop_filegv);
635 SvREFCNT_dec(cSVOPo->op_sv);
641 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
645 Safefree(cPVOPo->op_pv);
648 op_free(cPMOPo->op_pmreplroot);
653 ReREFCNT_dec(cPMOPo->op_pmregexp);
658 pad_free(o->op_targ);
666 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
667 pad_free(o->op_targ);
668 o->op_targ = o->op_type;
669 o->op_type = OP_NULL;
670 o->op_ppaddr = ppaddr[OP_NULL];
673 /* Contextualizers */
675 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
685 /* establish postfix order */
686 if (cUNOPo->op_first) {
687 o->op_next = LINKLIST(cUNOPo->op_first);
688 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
690 kid->op_next = LINKLIST(kid->op_sibling);
705 if (o && o->op_flags & OPf_KIDS) {
706 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
716 o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
718 line_t oldline = PL_curcop->cop_line;
720 if (PL_copline != NOLINE)
721 PL_curcop->cop_line = PL_copline;
722 warn("Found = in conditional, should be ==");
723 PL_curcop->cop_line = oldline;
733 /* assumes no premature commitment */
734 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
735 || o->op_type == OP_RETURN)
738 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
740 switch (o->op_type) {
742 if (o->op_private & OPpREPEAT_DOLIST)
743 null(((LISTOP*)cBINOPo->op_first)->op_first);
744 scalar(cBINOPo->op_first);
749 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
753 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
754 if (!kPMOP->op_pmreplroot)
755 deprecate("implicit split to @_");
763 if (o->op_flags & OPf_KIDS) {
764 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
770 kid = cLISTOPo->op_first;
772 while (kid = kid->op_sibling) {
778 WITH_THR(PL_curcop = &PL_compiling);
783 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
789 WITH_THR(PL_curcop = &PL_compiling);
802 /* assumes no premature commitment */
803 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
804 || o->op_type == OP_RETURN)
807 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
809 switch (o->op_type) {
811 if (!(opargs[o->op_type] & OA_FOLDCONST))
815 if (o->op_flags & OPf_STACKED)
819 if (o->op_private == 4)
890 if (!(o->op_private & OPpLVAL_INTRO))
891 useless = op_desc[o->op_type];
898 if (!(o->op_private & OPpLVAL_INTRO) &&
899 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
900 useless = "a variable";
905 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
911 useless = "a constant";
912 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
914 else if (SvPOK(sv)) {
915 if (strnEQ(SvPVX(sv), "di", 2) ||
916 strnEQ(SvPVX(sv), "ds", 2) ||
917 strnEQ(SvPVX(sv), "ig", 2))
921 null(o); /* don't execute a constant */
922 SvREFCNT_dec(sv); /* don't even remember it */
926 o->op_type = OP_PREINC; /* pre-increment is faster */
927 o->op_ppaddr = ppaddr[OP_PREINC];
931 o->op_type = OP_PREDEC; /* pre-decrement is faster */
932 o->op_ppaddr = ppaddr[OP_PREDEC];
938 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
943 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
944 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
945 if (o->op_flags & OPf_STACKED)
951 if (!(o->op_flags & OPf_KIDS))
960 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
967 /* all requires must return a boolean value */
968 o->op_flags &= ~OPf_WANT;
971 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
972 if (!kPMOP->op_pmreplroot)
973 deprecate("implicit split to @_");
977 if (useless && PL_dowarn)
978 warn("Useless use of %s in void context", useless);
986 if (o && o->op_flags & OPf_KIDS) {
987 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
998 /* assumes no premature commitment */
999 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1000 || o->op_type == OP_RETURN)
1003 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1005 switch (o->op_type) {
1008 list(cBINOPo->op_first);
1013 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1021 if (!(o->op_flags & OPf_KIDS))
1023 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1024 list(cBINOPo->op_first);
1025 return gen_constant_list(o);
1032 kid = cLISTOPo->op_first;
1034 while (kid = kid->op_sibling) {
1035 if (kid->op_sibling)
1040 WITH_THR(PL_curcop = &PL_compiling);
1044 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1045 if (kid->op_sibling)
1050 WITH_THR(PL_curcop = &PL_compiling);
1053 /* all requires must return a boolean value */
1054 o->op_flags &= ~OPf_WANT;
1066 if (o->op_type == OP_LINESEQ ||
1067 o->op_type == OP_SCOPE ||
1068 o->op_type == OP_LEAVE ||
1069 o->op_type == OP_LEAVETRY)
1072 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1073 if (kid->op_sibling) {
1077 PL_curcop = &PL_compiling;
1079 o->op_flags &= ~OPf_PARENS;
1080 if (PL_hints & HINT_BLOCK_SCOPE)
1081 o->op_flags |= OPf_PARENS;
1084 o = newOP(OP_STUB, 0);
1089 modkids(OP *o, I32 type)
1092 if (o && o->op_flags & OPf_KIDS) {
1093 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1100 mod(OP *o, I32 type)
1106 if (!o || PL_error_count)
1109 switch (o->op_type) {
1114 if (!(o->op_private & (OPpCONST_ARYBASE)))
1116 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1117 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1121 SAVEI32(PL_compiling.cop_arybase);
1122 PL_compiling.cop_arybase = 0;
1124 else if (type == OP_REFGEN)
1127 croak("That use of $[ is unsupported");
1130 if (o->op_flags & OPf_PARENS)
1134 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1135 !(o->op_flags & OPf_STACKED)) {
1136 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1137 o->op_ppaddr = ppaddr[OP_RV2CV];
1138 assert(cUNOPo->op_first->op_type == OP_NULL);
1139 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1145 /* grep, foreach, subcalls, refgen */
1146 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1148 yyerror(form("Can't modify %s in %s",
1149 op_desc[o->op_type],
1150 type ? op_desc[type] : "local"));
1164 case OP_RIGHT_SHIFT:
1173 if (!(o->op_flags & OPf_STACKED))
1179 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1185 if (!type && cUNOPo->op_first->op_type != OP_GV)
1186 croak("Can't localize through a reference");
1187 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1188 PL_modcount = 10000;
1189 return o; /* Treat \(@foo) like ordinary list. */
1193 if (scalar_mod_type(o, type))
1195 ref(cUNOPo->op_first, o->op_type);
1204 PL_modcount = 10000;
1207 if (!type && cUNOPo->op_first->op_type != OP_GV)
1208 croak("Can't localize through a reference");
1209 ref(cUNOPo->op_first, o->op_type);
1213 PL_hints |= HINT_BLOCK_SCOPE;
1221 PL_modcount = 10000;
1222 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1223 return o; /* Treat \(@foo) like ordinary list. */
1224 if (scalar_mod_type(o, type))
1230 croak("Can't localize lexical variable %s",
1231 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1236 PL_modcount++; /* XXX ??? */
1238 #endif /* USE_THREADS */
1244 if (type != OP_SASSIGN)
1248 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1254 pad_free(o->op_targ);
1255 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1256 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1257 if (o->op_flags & OPf_KIDS)
1258 mod(cBINOPo->op_first->op_sibling, type);
1263 ref(cBINOPo->op_first, o->op_type);
1264 if (type == OP_ENTERSUB &&
1265 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1266 o->op_private |= OPpLVAL_DEFER;
1273 if (o->op_flags & OPf_KIDS)
1274 mod(cLISTOPo->op_last, type);
1278 if (!(o->op_flags & OPf_KIDS))
1280 if (o->op_targ != OP_LIST) {
1281 mod(cBINOPo->op_first, type);
1286 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1290 o->op_flags |= OPf_MOD;
1292 if (type == OP_AASSIGN || type == OP_SASSIGN)
1293 o->op_flags |= OPf_SPECIAL|OPf_REF;
1295 o->op_private |= OPpLVAL_INTRO;
1296 o->op_flags &= ~OPf_SPECIAL;
1297 PL_hints |= HINT_BLOCK_SCOPE;
1299 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1300 o->op_flags |= OPf_REF;
1305 scalar_mod_type(OP *o, I32 type)
1309 if (o->op_type == OP_RV2GV)
1333 case OP_RIGHT_SHIFT:
1343 case OP_ANDASSIGN: /* may work later */
1344 case OP_ORASSIGN: /* may work later */
1352 refkids(OP *o, I32 type)
1355 if (o && o->op_flags & OPf_KIDS) {
1356 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1363 ref(OP *o, I32 type)
1367 if (!o || PL_error_count)
1370 switch (o->op_type) {
1372 if ((type == OP_DEFINED || type == OP_LOCK) &&
1373 !(o->op_flags & OPf_STACKED)) {
1374 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1375 o->op_ppaddr = ppaddr[OP_RV2CV];
1376 assert(cUNOPo->op_first->op_type == OP_NULL);
1377 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1378 o->op_flags |= OPf_SPECIAL;
1383 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1387 ref(cUNOPo->op_first, o->op_type);
1390 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1391 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1392 : type == OP_RV2HV ? OPpDEREF_HV
1394 o->op_flags |= OPf_MOD;
1399 o->op_flags |= OPf_MOD; /* XXX ??? */
1404 o->op_flags |= OPf_REF;
1407 ref(cUNOPo->op_first, o->op_type);
1412 o->op_flags |= OPf_REF;
1417 if (!(o->op_flags & OPf_KIDS))
1419 ref(cBINOPo->op_first, type);
1423 ref(cBINOPo->op_first, o->op_type);
1424 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1425 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1426 : type == OP_RV2HV ? OPpDEREF_HV
1428 o->op_flags |= OPf_MOD;
1436 if (!(o->op_flags & OPf_KIDS))
1438 ref(cLISTOPo->op_last, type);
1453 if (!o || PL_error_count)
1457 if (type == OP_LIST) {
1458 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1460 } else if (type == OP_UNDEF) {
1462 } else if (type != OP_PADSV &&
1465 type != OP_PUSHMARK)
1467 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1470 o->op_flags |= OPf_MOD;
1471 o->op_private |= OPpLVAL_INTRO;
1479 o->op_flags |= OPf_PARENS;
1484 bind_match(I32 type, OP *left, OP *right)
1489 (left->op_type == OP_RV2AV ||
1490 left->op_type == OP_RV2HV ||
1491 left->op_type == OP_PADAV ||
1492 left->op_type == OP_PADHV)) {
1493 char *desc = op_desc[(right->op_type == OP_SUBST ||
1494 right->op_type == OP_TRANS)
1495 ? right->op_type : OP_MATCH];
1496 char *sample = ((left->op_type == OP_RV2AV ||
1497 left->op_type == OP_PADAV)
1498 ? "@array" : "%hash");
1499 warn("Applying %s to %s will act on scalar(%s)", desc, sample, sample);
1502 if (right->op_type == OP_MATCH ||
1503 right->op_type == OP_SUBST ||
1504 right->op_type == OP_TRANS) {
1505 right->op_flags |= OPf_STACKED;
1506 if (right->op_type != OP_MATCH)
1507 left = mod(left, right->op_type);
1508 if (right->op_type == OP_TRANS)
1509 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1511 o = prepend_elem(right->op_type, scalar(left), right);
1513 return newUNOP(OP_NOT, 0, scalar(o));
1517 return bind_match(type, left,
1518 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1526 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1527 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1534 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1535 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1536 o->op_type = OP_LEAVE;
1537 o->op_ppaddr = ppaddr[OP_LEAVE];
1540 if (o->op_type == OP_LINESEQ) {
1542 o->op_type = OP_SCOPE;
1543 o->op_ppaddr = ppaddr[OP_SCOPE];
1544 kid = ((LISTOP*)o)->op_first;
1545 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1546 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1551 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1561 SAVESPTR(GvHV(PL_hintgv));
1562 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1563 SAVEFREESV(GvHV(PL_hintgv));
1567 block_start(int full)
1570 int retval = PL_savestack_ix;
1572 SAVEI32(PL_comppad_name_floor);
1574 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1575 PL_comppad_name_floor = PL_comppad_name_fill;
1577 PL_comppad_name_floor = 0;
1579 SAVEI32(PL_min_intro_pending);
1580 SAVEI32(PL_max_intro_pending);
1581 PL_min_intro_pending = 0;
1582 SAVEI32(PL_comppad_name_fill);
1583 SAVEI32(PL_padix_floor);
1584 PL_padix_floor = PL_padix;
1585 PL_pad_reset_pending = FALSE;
1587 PL_hints &= ~HINT_BLOCK_SCOPE;
1592 block_end(I32 floor, OP *seq)
1595 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1596 OP* retval = scalarseq(seq);
1598 PL_pad_reset_pending = FALSE;
1600 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1601 pad_leavemy(PL_comppad_name_fill);
1610 OP *o = newOP(OP_THREADSV, 0);
1611 o->op_targ = find_threadsv("_");
1614 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1615 #endif /* USE_THREADS */
1623 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1624 PL_eval_start = linklist(PL_eval_root);
1625 PL_eval_root->op_next = 0;
1626 peep(PL_eval_start);
1631 PL_main_root = scope(sawparens(scalarvoid(o)));
1632 PL_curcop = &PL_compiling;
1633 PL_main_start = LINKLIST(PL_main_root);
1634 PL_main_root->op_next = 0;
1635 peep(PL_main_start);
1638 /* Register with debugger */
1640 CV *cv = perl_get_cv("DB::postponed", FALSE);
1644 XPUSHs((SV*)PL_compiling.cop_filegv);
1646 perl_call_sv((SV*)cv, G_DISCARD);
1653 localize(OP *o, I32 lex)
1655 if (o->op_flags & OPf_PARENS)
1658 if (PL_dowarn && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1660 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1661 if (*s == ';' || *s == '=')
1662 warn("Parens missing around \"%s\" list", lex ? "my" : "local");
1666 PL_in_my_stash = Nullhv;
1670 return mod(o, OP_NULL); /* a bit kludgey */
1676 if (o->op_type == OP_LIST) {
1679 o2 = newOP(OP_THREADSV, 0);
1680 o2->op_targ = find_threadsv(";");
1682 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1683 #endif /* USE_THREADS */
1684 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1690 fold_constants(register OP *o)
1694 I32 type = o->op_type;
1697 if (opargs[type] & OA_RETSCALAR)
1699 if (opargs[type] & OA_TARGET)
1700 o->op_targ = pad_alloc(type, SVs_PADTMP);
1702 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1703 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1705 if (!(opargs[type] & OA_FOLDCONST))
1720 if (o->op_private & OPpLOCALE)
1725 goto nope; /* Don't try to run w/ errors */
1727 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1728 if (curop->op_type != OP_CONST &&
1729 curop->op_type != OP_LIST &&
1730 curop->op_type != OP_SCALAR &&
1731 curop->op_type != OP_NULL &&
1732 curop->op_type != OP_PUSHMARK) {
1737 curop = LINKLIST(o);
1741 sv = *(PL_stack_sp--);
1742 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1743 pad_swipe(o->op_targ);
1744 else if (SvTEMP(sv)) { /* grab mortal temp? */
1745 (void)SvREFCNT_inc(sv);
1749 if (type == OP_RV2GV)
1750 return newGVOP(OP_GV, 0, (GV*)sv);
1752 /* try to smush double to int, but don't smush -2.0 to -2 */
1753 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1757 if ((double)iv == SvNV(sv)) {
1762 SvIOK_off(sv); /* undo SvIV() damage */
1764 return newSVOP(OP_CONST, 0, sv);
1768 if (!(opargs[type] & OA_OTHERINT))
1771 if (!(PL_hints & HINT_INTEGER)) {
1772 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1775 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1776 if (curop->op_type == OP_CONST) {
1777 if (SvIOK(((SVOP*)curop)->op_sv))
1781 if (opargs[curop->op_type] & OA_RETINTEGER)
1785 o->op_ppaddr = ppaddr[++(o->op_type)];
1792 gen_constant_list(register OP *o)
1796 I32 oldtmps_floor = PL_tmps_floor;
1800 return o; /* Don't attempt to run with errors */
1802 PL_op = curop = LINKLIST(o);
1808 PL_tmps_floor = oldtmps_floor;
1810 o->op_type = OP_RV2AV;
1811 o->op_ppaddr = ppaddr[OP_RV2AV];
1812 curop = ((UNOP*)o)->op_first;
1813 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1820 convert(I32 type, I32 flags, OP *o)
1825 if (!o || o->op_type != OP_LIST)
1826 o = newLISTOP(OP_LIST, 0, o, Nullop);
1828 o->op_flags &= ~OPf_WANT;
1830 if (!(opargs[type] & OA_MARK))
1831 null(cLISTOPo->op_first);
1834 o->op_ppaddr = ppaddr[type];
1835 o->op_flags |= flags;
1837 o = CHECKOP(type, o);
1838 if (o->op_type != type)
1841 if (cLISTOPo->op_children < 7) {
1842 /* XXX do we really need to do this if we're done appending?? */
1843 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1845 cLISTOPo->op_last = last; /* in case check substituted last arg */
1848 return fold_constants(o);
1851 /* List constructors */
1854 append_elem(I32 type, OP *first, OP *last)
1862 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1863 return newLISTOP(type, 0, first, last);
1865 if (first->op_flags & OPf_KIDS)
1866 ((LISTOP*)first)->op_last->op_sibling = last;
1868 first->op_flags |= OPf_KIDS;
1869 ((LISTOP*)first)->op_first = last;
1871 ((LISTOP*)first)->op_last = last;
1872 ((LISTOP*)first)->op_children++;
1877 append_list(I32 type, LISTOP *first, LISTOP *last)
1885 if (first->op_type != type)
1886 return prepend_elem(type, (OP*)first, (OP*)last);
1888 if (last->op_type != type)
1889 return append_elem(type, (OP*)first, (OP*)last);
1891 first->op_last->op_sibling = last->op_first;
1892 first->op_last = last->op_last;
1893 first->op_children += last->op_children;
1894 if (first->op_children)
1895 first->op_flags |= OPf_KIDS;
1902 prepend_elem(I32 type, OP *first, OP *last)
1910 if (last->op_type == type) {
1911 if (type == OP_LIST) { /* already a PUSHMARK there */
1912 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1913 ((LISTOP*)last)->op_first->op_sibling = first;
1916 if (!(last->op_flags & OPf_KIDS)) {
1917 ((LISTOP*)last)->op_last = first;
1918 last->op_flags |= OPf_KIDS;
1920 first->op_sibling = ((LISTOP*)last)->op_first;
1921 ((LISTOP*)last)->op_first = first;
1923 ((LISTOP*)last)->op_children++;
1927 return newLISTOP(type, 0, first, last);
1935 return newOP(OP_STUB, 0);
1941 if (!o || o->op_type != OP_LIST)
1942 o = newLISTOP(OP_LIST, 0, o, Nullop);
1948 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1952 Newz(1101, listop, 1, LISTOP);
1954 listop->op_type = type;
1955 listop->op_ppaddr = ppaddr[type];
1956 listop->op_children = (first != 0) + (last != 0);
1957 listop->op_flags = flags;
1961 else if (!first && last)
1964 first->op_sibling = last;
1965 listop->op_first = first;
1966 listop->op_last = last;
1967 if (type == OP_LIST) {
1969 pushop = newOP(OP_PUSHMARK, 0);
1970 pushop->op_sibling = first;
1971 listop->op_first = pushop;
1972 listop->op_flags |= OPf_KIDS;
1974 listop->op_last = pushop;
1976 else if (listop->op_children)
1977 listop->op_flags |= OPf_KIDS;
1983 newOP(I32 type, I32 flags)
1986 Newz(1101, o, 1, OP);
1988 o->op_ppaddr = ppaddr[type];
1989 o->op_flags = flags;
1992 o->op_private = 0 + (flags >> 8);
1993 if (opargs[type] & OA_RETSCALAR)
1995 if (opargs[type] & OA_TARGET)
1996 o->op_targ = pad_alloc(type, SVs_PADTMP);
1997 return CHECKOP(type, o);
2001 newUNOP(I32 type, I32 flags, OP *first)
2006 first = newOP(OP_STUB, 0);
2007 if (opargs[type] & OA_MARK)
2008 first = force_list(first);
2010 Newz(1101, unop, 1, UNOP);
2011 unop->op_type = type;
2012 unop->op_ppaddr = ppaddr[type];
2013 unop->op_first = first;
2014 unop->op_flags = flags | OPf_KIDS;
2015 unop->op_private = 1 | (flags >> 8);
2016 unop = (UNOP*) CHECKOP(type, unop);
2020 return fold_constants((OP *) unop);
2024 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2027 Newz(1101, binop, 1, BINOP);
2030 first = newOP(OP_NULL, 0);
2032 binop->op_type = type;
2033 binop->op_ppaddr = ppaddr[type];
2034 binop->op_first = first;
2035 binop->op_flags = flags | OPf_KIDS;
2038 binop->op_private = 1 | (flags >> 8);
2041 binop->op_private = 2 | (flags >> 8);
2042 first->op_sibling = last;
2045 binop = (BINOP*)CHECKOP(type, binop);
2049 binop->op_last = last = binop->op_first->op_sibling;
2051 return fold_constants((OP *)binop);
2055 pmtrans(OP *o, OP *expr, OP *repl)
2057 SV *tstr = ((SVOP*)expr)->op_sv;
2058 SV *rstr = ((SVOP*)repl)->op_sv;
2061 register U8 *t = (U8*)SvPV(tstr, tlen);
2062 register U8 *r = (U8*)SvPV(rstr, rlen);
2068 register short *tbl;
2070 tbl = (short*)cPVOPo->op_pv;
2071 complement = o->op_private & OPpTRANS_COMPLEMENT;
2072 Delete = o->op_private & OPpTRANS_DELETE;
2073 squash = o->op_private & OPpTRANS_SQUASH;
2076 Zero(tbl, 256, short);
2077 for (i = 0; i < tlen; i++)
2079 for (i = 0, j = 0; i < 256; i++) {
2095 if (!rlen && !Delete) {
2098 o->op_private |= OPpTRANS_COUNTONLY;
2100 for (i = 0; i < 256; i++)
2102 for (i = 0, j = 0; i < tlen; i++,j++) {
2105 if (tbl[t[i]] == -1)
2111 if (tbl[t[i]] == -1)
2122 newPMOP(I32 type, I32 flags)
2127 Newz(1101, pmop, 1, PMOP);
2128 pmop->op_type = type;
2129 pmop->op_ppaddr = ppaddr[type];
2130 pmop->op_flags = flags;
2131 pmop->op_private = 0 | (flags >> 8);
2133 if (PL_hints & HINT_RE_TAINT)
2134 pmop->op_pmpermflags |= PMf_RETAINT;
2135 if (PL_hints & HINT_LOCALE)
2136 pmop->op_pmpermflags |= PMf_LOCALE;
2137 pmop->op_pmflags = pmop->op_pmpermflags;
2139 /* link into pm list */
2140 if (type != OP_TRANS && PL_curstash) {
2141 pmop->op_pmnext = HvPMROOT(PL_curstash);
2142 HvPMROOT(PL_curstash) = pmop;
2149 pmruntime(OP *o, OP *expr, OP *repl)
2154 I32 repl_has_vars = 0;
2156 if (o->op_type == OP_TRANS)
2157 return pmtrans(o, expr, repl);
2159 PL_hints |= HINT_BLOCK_SCOPE;
2162 if (expr->op_type == OP_CONST) {
2164 SV *pat = ((SVOP*)expr)->op_sv;
2165 char *p = SvPV(pat, plen);
2166 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2167 sv_setpvn(pat, "\\s+", 3);
2168 p = SvPV(pat, plen);
2169 pm->op_pmflags |= PMf_SKIPWHITE;
2171 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2172 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2173 pm->op_pmflags |= PMf_WHITE;
2177 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2178 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2180 : OP_REGCMAYBE),0,expr);
2182 Newz(1101, rcop, 1, LOGOP);
2183 rcop->op_type = OP_REGCOMP;
2184 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2185 rcop->op_first = scalar(expr);
2186 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2187 ? (OPf_SPECIAL | OPf_KIDS)
2189 rcop->op_private = 1;
2192 /* establish postfix order */
2193 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2195 rcop->op_next = expr;
2196 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2199 rcop->op_next = LINKLIST(expr);
2200 expr->op_next = (OP*)rcop;
2203 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2208 if (pm->op_pmflags & PMf_EVAL)
2211 else if (repl->op_type == OP_THREADSV
2212 && strchr("&`'123456789+",
2213 PL_threadsv_names[repl->op_targ]))
2217 #endif /* USE_THREADS */
2218 else if (repl->op_type == OP_CONST)
2222 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2223 if (opargs[curop->op_type] & OA_DANGEROUS) {
2225 if (curop->op_type == OP_THREADSV) {
2227 if (strchr("&`'123456789+", curop->op_private))
2231 if (curop->op_type == OP_GV) {
2232 GV *gv = ((GVOP*)curop)->op_gv;
2234 if (strchr("&`'123456789+", *GvENAME(gv)))
2237 #endif /* USE_THREADS */
2238 else if (curop->op_type == OP_RV2CV)
2240 else if (curop->op_type == OP_RV2SV ||
2241 curop->op_type == OP_RV2AV ||
2242 curop->op_type == OP_RV2HV ||
2243 curop->op_type == OP_RV2GV) {
2244 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2247 else if (curop->op_type == OP_PADSV ||
2248 curop->op_type == OP_PADAV ||
2249 curop->op_type == OP_PADHV ||
2250 curop->op_type == OP_PADANY) {
2253 else if (curop->op_type == OP_PUSHRE)
2254 ; /* Okay here, dangerous in newASSIGNOP */
2263 && (!pm->op_pmregexp
2264 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2265 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2266 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2267 prepend_elem(o->op_type, scalar(repl), o);
2270 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2271 pm->op_pmflags |= PMf_MAYBE_CONST;
2272 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2274 Newz(1101, rcop, 1, LOGOP);
2275 rcop->op_type = OP_SUBSTCONT;
2276 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2277 rcop->op_first = scalar(repl);
2278 rcop->op_flags |= OPf_KIDS;
2279 rcop->op_private = 1;
2282 /* establish postfix order */
2283 rcop->op_next = LINKLIST(repl);
2284 repl->op_next = (OP*)rcop;
2286 pm->op_pmreplroot = scalar((OP*)rcop);
2287 pm->op_pmreplstart = LINKLIST(rcop);
2296 newSVOP(I32 type, I32 flags, SV *sv)
2299 Newz(1101, svop, 1, SVOP);
2300 svop->op_type = type;
2301 svop->op_ppaddr = ppaddr[type];
2303 svop->op_next = (OP*)svop;
2304 svop->op_flags = flags;
2305 if (opargs[type] & OA_RETSCALAR)
2307 if (opargs[type] & OA_TARGET)
2308 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2309 return CHECKOP(type, svop);
2313 newGVOP(I32 type, I32 flags, GV *gv)
2317 Newz(1101, gvop, 1, GVOP);
2318 gvop->op_type = type;
2319 gvop->op_ppaddr = ppaddr[type];
2320 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2321 gvop->op_next = (OP*)gvop;
2322 gvop->op_flags = flags;
2323 if (opargs[type] & OA_RETSCALAR)
2325 if (opargs[type] & OA_TARGET)
2326 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2327 return CHECKOP(type, gvop);
2331 newPVOP(I32 type, I32 flags, char *pv)
2334 Newz(1101, pvop, 1, PVOP);
2335 pvop->op_type = type;
2336 pvop->op_ppaddr = ppaddr[type];
2338 pvop->op_next = (OP*)pvop;
2339 pvop->op_flags = flags;
2340 if (opargs[type] & OA_RETSCALAR)
2342 if (opargs[type] & OA_TARGET)
2343 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2344 return CHECKOP(type, pvop);
2353 save_hptr(&PL_curstash);
2354 save_item(PL_curstname);
2359 name = SvPV(sv, len);
2360 PL_curstash = gv_stashpvn(name,len,TRUE);
2361 sv_setpvn(PL_curstname, name, len);
2365 sv_setpv(PL_curstname,"<none>");
2366 PL_curstash = Nullhv;
2368 PL_copline = NOLINE;
2373 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2381 if (id->op_type != OP_CONST)
2382 croak("Module name must be constant");
2386 if(version != Nullop) {
2387 SV *vesv = ((SVOP*)version)->op_sv;
2389 if (arg == Nullop && !SvNIOK(vesv)) {
2396 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2397 croak("Version number must be constant number");
2399 /* Make copy of id so we don't free it twice */
2400 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2402 /* Fake up a method call to VERSION */
2403 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2404 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2405 append_elem(OP_LIST,
2406 prepend_elem(OP_LIST, pack, list(version)),
2407 newUNOP(OP_METHOD, 0, meth)));
2411 /* Fake up an import/unimport */
2412 if (arg && arg->op_type == OP_STUB)
2413 imop = arg; /* no import on explicit () */
2414 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2415 imop = Nullop; /* use 5.0; */
2418 /* Make copy of id so we don't free it twice */
2419 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2420 meth = newSVOP(OP_CONST, 0,
2422 ? newSVpv("import", 6)
2423 : newSVpv("unimport", 8)
2425 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2426 append_elem(OP_LIST,
2427 prepend_elem(OP_LIST, pack, list(arg)),
2428 newUNOP(OP_METHOD, 0, meth)));
2431 /* Fake up a require */
2432 rqop = newUNOP(OP_REQUIRE, 0, id);
2434 /* Fake up the BEGIN {}, which does its thing immediately. */
2436 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2438 append_elem(OP_LINESEQ,
2439 append_elem(OP_LINESEQ,
2440 newSTATEOP(0, Nullch, rqop),
2441 newSTATEOP(0, Nullch, veop)),
2442 newSTATEOP(0, Nullch, imop) ));
2444 PL_copline = NOLINE;
2449 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2451 return newBINOP(OP_LSLICE, flags,
2452 list(force_list(subscript)),
2453 list(force_list(listval)) );
2457 list_assignment(register OP *o)
2462 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2463 o = cUNOPo->op_first;
2465 if (o->op_type == OP_COND_EXPR) {
2466 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2467 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2472 yyerror("Assignment to both a list and a scalar");
2476 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2477 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2478 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2481 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2484 if (o->op_type == OP_RV2SV)
2491 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2496 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2497 return newLOGOP(optype, 0,
2498 mod(scalar(left), optype),
2499 newUNOP(OP_SASSIGN, 0, scalar(right)));
2502 return newBINOP(optype, OPf_STACKED,
2503 mod(scalar(left), optype), scalar(right));
2507 if (list_assignment(left)) {
2510 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2511 left = mod(left, OP_AASSIGN);
2519 o = newBINOP(OP_AASSIGN, flags,
2520 list(force_list(right)),
2521 list(force_list(left)) );
2522 o->op_private = 0 | (flags >> 8);
2523 if (!(left->op_private & OPpLVAL_INTRO)) {
2527 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2528 if (opargs[curop->op_type] & OA_DANGEROUS) {
2529 if (curop->op_type == OP_GV) {
2530 GV *gv = ((GVOP*)curop)->op_gv;
2531 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2533 SvCUR(gv) = PL_generation;
2535 else if (curop->op_type == OP_PADSV ||
2536 curop->op_type == OP_PADAV ||
2537 curop->op_type == OP_PADHV ||
2538 curop->op_type == OP_PADANY) {
2539 SV **svp = AvARRAY(PL_comppad_name);
2540 SV *sv = svp[curop->op_targ];
2541 if (SvCUR(sv) == PL_generation)
2543 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2545 else if (curop->op_type == OP_RV2CV)
2547 else if (curop->op_type == OP_RV2SV ||
2548 curop->op_type == OP_RV2AV ||
2549 curop->op_type == OP_RV2HV ||
2550 curop->op_type == OP_RV2GV) {
2551 if (lastop->op_type != OP_GV) /* funny deref? */
2554 else if (curop->op_type == OP_PUSHRE) {
2555 if (((PMOP*)curop)->op_pmreplroot) {
2556 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2557 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2559 SvCUR(gv) = PL_generation;
2568 o->op_private = OPpASSIGN_COMMON;
2570 if (right && right->op_type == OP_SPLIT) {
2572 if ((tmpop = ((LISTOP*)right)->op_first) &&
2573 tmpop->op_type == OP_PUSHRE)
2575 PMOP *pm = (PMOP*)tmpop;
2576 if (left->op_type == OP_RV2AV &&
2577 !(left->op_private & OPpLVAL_INTRO) &&
2578 !(o->op_private & OPpASSIGN_COMMON) )
2580 tmpop = ((UNOP*)left)->op_first;
2581 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2582 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2583 pm->op_pmflags |= PMf_ONCE;
2584 tmpop = cUNOPo->op_first; /* to list (nulled) */
2585 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2586 tmpop->op_sibling = Nullop; /* don't free split */
2587 right->op_next = tmpop->op_next; /* fix starting loc */
2588 op_free(o); /* blow off assign */
2589 right->op_flags &= ~OPf_WANT;
2590 /* "I don't know and I don't care." */
2595 if (PL_modcount < 10000 &&
2596 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2598 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2600 sv_setiv(sv, PL_modcount+1);
2608 right = newOP(OP_UNDEF, 0);
2609 if (right->op_type == OP_READLINE) {
2610 right->op_flags |= OPf_STACKED;
2611 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2614 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2615 o = newBINOP(OP_SASSIGN, flags,
2616 scalar(right), mod(scalar(left), OP_SASSIGN) );
2628 newSTATEOP(I32 flags, char *label, OP *o)
2631 U32 seq = intro_my();
2634 Newz(1101, cop, 1, COP);
2635 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2636 cop->op_type = OP_DBSTATE;
2637 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2640 cop->op_type = OP_NEXTSTATE;
2641 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2643 cop->op_flags = flags;
2644 cop->op_private = 0 | (flags >> 8);
2646 cop->op_private |= NATIVE_HINTS;
2648 cop->op_next = (OP*)cop;
2651 cop->cop_label = label;
2652 PL_hints |= HINT_BLOCK_SCOPE;
2655 cop->cop_arybase = PL_curcop->cop_arybase;
2657 if (PL_copline == NOLINE)
2658 cop->cop_line = PL_curcop->cop_line;
2660 cop->cop_line = PL_copline;
2661 PL_copline = NOLINE;
2663 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2664 cop->cop_stash = PL_curstash;
2666 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2667 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2668 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2669 (void)SvIOK_on(*svp);
2671 SvSTASH(*svp) = (HV*)cop;
2675 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2678 /* "Introduce" my variables to visible status. */
2686 if (! PL_min_intro_pending)
2687 return PL_cop_seqmax;
2689 svp = AvARRAY(PL_comppad_name);
2690 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2691 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2692 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2693 SvNVX(sv) = (double)PL_cop_seqmax;
2696 PL_min_intro_pending = 0;
2697 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2698 return PL_cop_seqmax++;
2702 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2704 return new_logop(type, flags, &first, &other);
2708 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2713 OP *first = *firstp;
2714 OP *other = *otherp;
2716 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2717 return newBINOP(type, flags, scalar(first), scalar(other));
2719 scalarboolean(first);
2720 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2721 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2722 if (type == OP_AND || type == OP_OR) {
2728 first = *firstp = cUNOPo->op_first;
2730 first->op_next = o->op_next;
2731 cUNOPo->op_first = Nullop;
2735 if (first->op_type == OP_CONST) {
2736 if (PL_dowarn && (first->op_private & OPpCONST_BARE))
2737 warn("Probable precedence problem on %s", op_desc[type]);
2738 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2749 else if (first->op_type == OP_WANTARRAY) {
2755 else if (PL_dowarn && (first->op_flags & OPf_KIDS)) {
2756 OP *k1 = ((UNOP*)first)->op_first;
2757 OP *k2 = k1->op_sibling;
2759 switch (first->op_type)
2762 if (k2 && k2->op_type == OP_READLINE
2763 && (k2->op_flags & OPf_STACKED)
2764 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2765 warnop = k2->op_type;
2769 if (k1->op_type == OP_READDIR
2770 || k1->op_type == OP_GLOB
2771 || k1->op_type == OP_EACH)
2772 warnop = k1->op_type;
2776 line_t oldline = PL_curcop->cop_line;
2777 PL_curcop->cop_line = PL_copline;
2778 warn("Value of %s%s can be \"0\"; test with defined()",
2780 ((warnop == OP_READLINE || warnop == OP_GLOB)
2781 ? " construct" : "() operator"));
2782 PL_curcop->cop_line = oldline;
2789 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
2790 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
2792 Newz(1101, logop, 1, LOGOP);
2794 logop->op_type = type;
2795 logop->op_ppaddr = ppaddr[type];
2796 logop->op_first = first;
2797 logop->op_flags = flags | OPf_KIDS;
2798 logop->op_other = LINKLIST(other);
2799 logop->op_private = 1 | (flags >> 8);
2801 /* establish postfix order */
2802 logop->op_next = LINKLIST(first);
2803 first->op_next = (OP*)logop;
2804 first->op_sibling = other;
2806 o = newUNOP(OP_NULL, 0, (OP*)logop);
2813 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
2820 return newLOGOP(OP_AND, 0, first, trueop);
2822 return newLOGOP(OP_OR, 0, first, falseop);
2824 scalarboolean(first);
2825 if (first->op_type == OP_CONST) {
2826 if (SvTRUE(((SVOP*)first)->op_sv)) {
2837 else if (first->op_type == OP_WANTARRAY) {
2841 Newz(1101, condop, 1, CONDOP);
2843 condop->op_type = OP_COND_EXPR;
2844 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
2845 condop->op_first = first;
2846 condop->op_flags = flags | OPf_KIDS;
2847 condop->op_true = LINKLIST(trueop);
2848 condop->op_false = LINKLIST(falseop);
2849 condop->op_private = 1 | (flags >> 8);
2851 /* establish postfix order */
2852 condop->op_next = LINKLIST(first);
2853 first->op_next = (OP*)condop;
2855 first->op_sibling = trueop;
2856 trueop->op_sibling = falseop;
2857 o = newUNOP(OP_NULL, 0, (OP*)condop);
2859 trueop->op_next = o;
2860 falseop->op_next = o;
2866 newRANGE(I32 flags, OP *left, OP *right)
2874 Newz(1101, condop, 1, CONDOP);
2876 condop->op_type = OP_RANGE;
2877 condop->op_ppaddr = ppaddr[OP_RANGE];
2878 condop->op_first = left;
2879 condop->op_flags = OPf_KIDS;
2880 condop->op_true = LINKLIST(left);
2881 condop->op_false = LINKLIST(right);
2882 condop->op_private = 1 | (flags >> 8);
2884 left->op_sibling = right;
2886 condop->op_next = (OP*)condop;
2887 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
2888 flop = newUNOP(OP_FLOP, 0, flip);
2889 o = newUNOP(OP_NULL, 0, flop);
2892 left->op_next = flip;
2893 right->op_next = flop;
2895 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2896 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
2897 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
2898 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
2900 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2901 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
2904 if (!flip->op_private || !flop->op_private)
2905 linklist(o); /* blow off optimizer unless constant */
2911 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
2916 int once = block && block->op_flags & OPf_SPECIAL &&
2917 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
2920 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
2921 return block; /* do {} while 0 does once */
2922 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2923 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
2924 expr = newUNOP(OP_DEFINED, 0,
2925 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2926 } else if (expr->op_flags & OPf_KIDS) {
2927 OP *k1 = ((UNOP*)expr)->op_first;
2928 OP *k2 = (k1) ? k1->op_sibling : NULL;
2929 switch (expr->op_type) {
2931 if (k2 && k2->op_type == OP_READLINE
2932 && (k2->op_flags & OPf_STACKED)
2933 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2934 expr = newUNOP(OP_DEFINED, 0, expr);
2938 if (k1->op_type == OP_READDIR
2939 || k1->op_type == OP_GLOB
2940 || k1->op_type == OP_EACH)
2941 expr = newUNOP(OP_DEFINED, 0, expr);
2947 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
2948 o = new_logop(OP_AND, 0, &expr, &listop);
2951 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
2953 if (once && o != listop)
2954 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
2957 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
2959 o->op_flags |= flags;
2961 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
2966 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
2975 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
2976 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
2977 expr = newUNOP(OP_DEFINED, 0,
2978 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
2979 } else if (expr && (expr->op_flags & OPf_KIDS)) {
2980 OP *k1 = ((UNOP*)expr)->op_first;
2981 OP *k2 = (k1) ? k1->op_sibling : NULL;
2982 switch (expr->op_type) {
2984 if (k2 && k2->op_type == OP_READLINE
2985 && (k2->op_flags & OPf_STACKED)
2986 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2987 expr = newUNOP(OP_DEFINED, 0, expr);
2991 if (k1->op_type == OP_READDIR
2992 || k1->op_type == OP_GLOB
2993 || k1->op_type == OP_EACH)
2994 expr = newUNOP(OP_DEFINED, 0, expr);
3000 block = newOP(OP_NULL, 0);
3003 next = LINKLIST(cont);
3005 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3006 if ((line_t)whileline != NOLINE) {
3007 PL_copline = whileline;
3008 cont = append_elem(OP_LINESEQ, cont,
3009 newSTATEOP(0, Nullch, Nullop));
3013 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3014 redo = LINKLIST(listop);
3017 PL_copline = whileline;
3019 o = new_logop(OP_AND, 0, &expr, &listop);
3020 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3021 op_free(expr); /* oops, it's a while (0) */
3023 return Nullop; /* listop already freed by new_logop */
3026 ((LISTOP*)listop)->op_last->op_next = condop =
3027 (o == listop ? redo : LINKLIST(o));
3035 Newz(1101,loop,1,LOOP);
3036 loop->op_type = OP_ENTERLOOP;
3037 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3038 loop->op_private = 0;
3039 loop->op_next = (OP*)loop;
3042 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3044 loop->op_redoop = redo;
3045 loop->op_lastop = o;
3048 loop->op_nextop = next;
3050 loop->op_nextop = o;
3052 o->op_flags |= flags;
3053 o->op_private |= (flags >> 8);
3058 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3066 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3067 sv->op_type = OP_RV2GV;
3068 sv->op_ppaddr = ppaddr[OP_RV2GV];
3070 else if (sv->op_type == OP_PADSV) { /* private variable */
3071 padoff = sv->op_targ;
3075 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3076 padoff = sv->op_targ;
3077 iterflags |= OPf_SPECIAL;
3082 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3086 padoff = find_threadsv("_");
3087 iterflags |= OPf_SPECIAL;
3089 sv = newGVOP(OP_GV, 0, PL_defgv);
3092 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3093 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3094 iterflags |= OPf_STACKED;
3096 else if (expr->op_type == OP_NULL &&
3097 (expr->op_flags & OPf_KIDS) &&
3098 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3100 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3101 * set the STACKED flag to indicate that these values are to be
3102 * treated as min/max values by 'pp_iterinit'.
3104 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3105 CONDOP* range = (CONDOP*) flip->op_first;
3106 OP* left = range->op_first;
3107 OP* right = left->op_sibling;
3110 range->op_flags &= ~OPf_KIDS;
3111 range->op_first = Nullop;
3113 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3114 listop->op_first->op_next = range->op_true;
3115 left->op_next = range->op_false;
3116 right->op_next = (OP*)listop;
3117 listop->op_next = listop->op_first;
3120 expr = (OP*)(listop);
3122 iterflags |= OPf_STACKED;
3125 expr = mod(force_list(expr), OP_GREPSTART);
3129 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3130 append_elem(OP_LIST, expr, scalar(sv))));
3131 assert(!loop->op_next);
3132 Renew(loop, 1, LOOP);
3133 loop->op_targ = padoff;
3134 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3135 PL_copline = forline;
3136 return newSTATEOP(0, label, wop);
3140 newLOOPEX(I32 type, OP *label)
3144 if (type != OP_GOTO || label->op_type == OP_CONST) {
3145 /* "last()" means "last" */
3146 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3147 o = newOP(type, OPf_SPECIAL);
3149 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3150 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3156 if (label->op_type == OP_ENTERSUB)
3157 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3158 o = newUNOP(type, OPf_STACKED, label);
3160 PL_hints |= HINT_BLOCK_SCOPE;
3170 MUTEX_DESTROY(CvMUTEXP(cv));
3171 Safefree(CvMUTEXP(cv));
3174 #endif /* USE_THREADS */
3176 if (!CvXSUB(cv) && CvROOT(cv)) {
3178 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3179 croak("Can't undef active subroutine");
3182 croak("Can't undef active subroutine");
3183 #endif /* USE_THREADS */
3186 SAVESPTR(PL_curpad);
3190 op_free(CvROOT(cv));
3191 CvROOT(cv) = Nullop;
3194 SvPOK_off((SV*)cv); /* forget prototype */
3196 SvREFCNT_dec(CvGV(cv));
3198 SvREFCNT_dec(CvOUTSIDE(cv));
3199 CvOUTSIDE(cv) = Nullcv;
3200 if (CvPADLIST(cv)) {
3201 /* may be during global destruction */
3202 if (SvREFCNT(CvPADLIST(cv))) {
3203 I32 i = AvFILLp(CvPADLIST(cv));
3205 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3206 SV* sv = svp ? *svp : Nullsv;
3209 if (sv == (SV*)PL_comppad_name)
3210 PL_comppad_name = Nullav;
3211 else if (sv == (SV*)PL_comppad) {
3212 PL_comppad = Nullav;
3213 PL_curpad = Null(SV**);
3217 SvREFCNT_dec((SV*)CvPADLIST(cv));
3219 CvPADLIST(cv) = Nullav;
3223 #ifdef DEBUG_CLOSURES
3228 CV *outside = CvOUTSIDE(cv);
3229 AV* padlist = CvPADLIST(cv);
3236 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3238 (CvANON(cv) ? "ANON"
3239 : (cv == PL_main_cv) ? "MAIN"
3240 : CvUNIQUE(cv) ? "UNIQUE"
3241 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3244 : CvANON(outside) ? "ANON"
3245 : (outside == PL_main_cv) ? "MAIN"
3246 : CvUNIQUE(outside) ? "UNIQUE"
3247 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3252 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3253 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3254 pname = AvARRAY(pad_name);
3255 ppad = AvARRAY(pad);
3257 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3258 if (SvPOK(pname[ix]))
3259 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3261 SvFAKE(pname[ix]) ? "FAKE " : "",
3263 (long)I_32(SvNVX(pname[ix])),
3264 (long)SvIVX(pname[ix]));
3267 #endif /* DEBUG_CLOSURES */
3270 cv_clone2(CV *proto, CV *outside)
3275 AV* protopadlist = CvPADLIST(proto);
3276 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3277 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3278 SV** pname = AvARRAY(protopad_name);
3279 SV** ppad = AvARRAY(protopad);
3280 I32 fname = AvFILLp(protopad_name);
3281 I32 fpad = AvFILLp(protopad);
3285 assert(!CvUNIQUE(proto));
3288 SAVESPTR(PL_curpad);
3289 SAVESPTR(PL_comppad);
3290 SAVESPTR(PL_comppad_name);
3291 SAVESPTR(PL_compcv);
3293 cv = PL_compcv = (CV*)NEWSV(1104,0);
3294 sv_upgrade((SV *)cv, SvTYPE(proto));
3300 New(666, CvMUTEXP(cv), 1, perl_mutex);
3301 MUTEX_INIT(CvMUTEXP(cv));
3303 #endif /* USE_THREADS */
3304 CvFILEGV(cv) = CvFILEGV(proto);
3305 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3306 CvSTASH(cv) = CvSTASH(proto);
3307 CvROOT(cv) = CvROOT(proto);
3308 CvSTART(cv) = CvSTART(proto);
3310 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3313 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3315 PL_comppad_name = newAV();
3316 for (ix = fname; ix >= 0; ix--)
3317 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3319 PL_comppad = newAV();
3321 comppadlist = newAV();
3322 AvREAL_off(comppadlist);
3323 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3324 av_store(comppadlist, 1, (SV*)PL_comppad);
3325 CvPADLIST(cv) = comppadlist;
3326 av_fill(PL_comppad, AvFILLp(protopad));
3327 PL_curpad = AvARRAY(PL_comppad);
3329 av = newAV(); /* will be @_ */
3331 av_store(PL_comppad, 0, (SV*)av);
3332 AvFLAGS(av) = AVf_REIFY;
3334 for (ix = fpad; ix > 0; ix--) {
3335 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3336 if (namesv && namesv != &PL_sv_undef) {
3337 char *name = SvPVX(namesv); /* XXX */
3338 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3339 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3340 CvOUTSIDE(cv), cxstack_ix, 0);
3342 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3344 croak("panic: cv_clone: %s", name);
3346 else { /* our own lexical */
3349 /* anon code -- we'll come back for it */
3350 sv = SvREFCNT_inc(ppad[ix]);
3352 else if (*name == '@')
3354 else if (*name == '%')
3364 SV* sv = NEWSV(0,0);
3370 /* Now that vars are all in place, clone nested closures. */
3372 for (ix = fpad; ix > 0; ix--) {
3373 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3375 && namesv != &PL_sv_undef
3376 && !(SvFLAGS(namesv) & SVf_FAKE)
3377 && *SvPVX(namesv) == '&'
3378 && CvCLONE(ppad[ix]))
3380 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3381 SvREFCNT_dec(ppad[ix]);
3384 PL_curpad[ix] = (SV*)kid;
3388 #ifdef DEBUG_CLOSURES
3389 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3391 PerlIO_printf(Perl_debug_log, " from:\n");
3393 PerlIO_printf(Perl_debug_log, " to:\n");
3404 return cv_clone2(proto, CvOUTSIDE(proto));
3408 cv_ckproto(CV *cv, GV *gv, char *p)
3410 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3411 SV* msg = sv_newmortal();
3415 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3416 sv_setpv(msg, "Prototype mismatch:");
3418 sv_catpvf(msg, " sub %_", name);
3420 sv_catpvf(msg, " (%s)", SvPVX(cv));
3421 sv_catpv(msg, " vs ");
3423 sv_catpvf(msg, "(%s)", p);
3425 sv_catpv(msg, "none");
3433 if (!cv || !SvPOK(cv) || SvCUR(cv))
3435 return op_const_sv(CvSTART(cv), cv);
3439 op_const_sv(OP *o, CV *cv)
3446 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3447 o = cLISTOPo->op_first->op_sibling;
3449 for (; o; o = o->op_next) {
3450 OPCODE type = o->op_type;
3452 if(sv && o->op_next == o)
3454 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3456 if (type == OP_LEAVESUB || type == OP_RETURN)
3460 if (type == OP_CONST)
3462 else if (type == OP_PADSV && cv) {
3463 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3464 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3465 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3477 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3480 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3481 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3482 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3483 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3492 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3493 maximum a prototype before. */
3494 if (SvTYPE(gv) > SVt_NULL) {
3495 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3496 warn("Runaway prototype");
3497 cv_ckproto((CV*)gv, NULL, ps);
3500 sv_setpv((SV*)gv, ps);
3502 sv_setiv((SV*)gv, -1);
3503 SvREFCNT_dec(PL_compcv);
3504 cv = PL_compcv = NULL;
3505 PL_sub_generation++;
3509 if (!name || GvCVGEN(gv))
3511 else if (cv = GvCV(gv)) {
3512 cv_ckproto(cv, gv, ps);
3513 /* already defined (or promised)? */
3514 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3516 bool const_changed = TRUE;
3518 /* just a "sub foo;" when &foo is already defined */
3519 SAVEFREESV(PL_compcv);
3522 /* ahem, death to those who redefine active sort subs */
3523 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3524 croak("Can't redefine active sort subroutine %s", name);
3525 if(const_sv = cv_const_sv(cv))
3526 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3527 if ((const_sv && const_changed) || PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3528 && HvNAME(GvSTASH(CvGV(cv)))
3529 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3531 line_t oldline = PL_curcop->cop_line;
3532 PL_curcop->cop_line = PL_copline;
3533 warn(const_sv ? "Constant subroutine %s redefined"
3534 : "Subroutine %s redefined", name);
3535 PL_curcop->cop_line = oldline;
3541 if (cv) { /* must reuse cv if autoloaded */
3543 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3544 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3545 CvOUTSIDE(PL_compcv) = 0;
3546 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3547 CvPADLIST(PL_compcv) = 0;
3548 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3549 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3550 SvREFCNT_dec(PL_compcv);
3557 PL_sub_generation++;
3560 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3561 CvFILEGV(cv) = PL_curcop->cop_filegv;
3562 CvSTASH(cv) = PL_curstash;
3566 New(666, CvMUTEXP(cv), 1, perl_mutex);
3567 MUTEX_INIT(CvMUTEXP(cv));
3568 #endif /* USE_THREADS */
3571 sv_setpv((SV*)cv, ps);
3573 if (PL_error_count) {
3577 char *s = strrchr(name, ':');
3579 if (strEQ(s, "BEGIN")) {
3581 "BEGIN not safe after errors--compilation aborted";
3585 /* force display of errors found but not reported */
3586 sv_catpv(ERRSV, not_safe);
3587 croak("%s", SvPVx(ERRSV, PL_na));
3594 PL_copline = NOLINE;
3599 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3600 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3603 SV **namep = AvARRAY(PL_comppad_name);
3604 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3607 if (SvIMMORTAL(PL_curpad[ix]))
3610 * The only things that a clonable function needs in its
3611 * pad are references to outer lexicals and anonymous subs.
3612 * The rest are created anew during cloning.
3614 if (!((namesv = namep[ix]) != Nullsv &&
3615 namesv != &PL_sv_undef &&
3617 *SvPVX(namesv) == '&')))
3619 SvREFCNT_dec(PL_curpad[ix]);
3620 PL_curpad[ix] = Nullsv;
3625 AV *av = newAV(); /* Will be @_ */
3627 av_store(PL_comppad, 0, (SV*)av);
3628 AvFLAGS(av) = AVf_REIFY;
3630 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3631 if (SvIMMORTAL(PL_curpad[ix]))
3633 if (!SvPADMY(PL_curpad[ix]))
3634 SvPADTMP_on(PL_curpad[ix]);
3638 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3639 CvSTART(cv) = LINKLIST(CvROOT(cv));
3640 CvROOT(cv)->op_next = 0;
3646 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3647 SV *sv = NEWSV(0,0);
3648 SV *tmpstr = sv_newmortal();
3649 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3653 sv_setpvf(sv, "%_:%ld-%ld",
3654 GvSV(PL_curcop->cop_filegv),
3655 (long)PL_subline, (long)PL_curcop->cop_line);
3656 gv_efullname3(tmpstr, gv, Nullch);
3657 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3658 hv = GvHVn(db_postponed);
3659 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3660 && (cv = GvCV(db_postponed))) {
3665 perl_call_sv((SV*)cv, G_DISCARD);
3669 if ((s = strrchr(name,':')))
3673 if (strEQ(s, "BEGIN")) {
3674 I32 oldscope = PL_scopestack_ix;
3676 SAVESPTR(PL_compiling.cop_filegv);
3677 SAVEI16(PL_compiling.cop_line);
3679 sv_setsv(PL_rs, PL_nrs);
3682 PL_beginav = newAV();
3683 DEBUG_x( dump_sub(gv) );
3684 av_push(PL_beginav, (SV *)cv);
3686 call_list(oldscope, PL_beginav);
3688 PL_curcop = &PL_compiling;
3691 else if (strEQ(s, "END") && !PL_error_count) {
3694 av_unshift(PL_endav, 1);
3695 av_store(PL_endav, 0, (SV *)cv);
3698 else if (strEQ(s, "INIT") && !PL_error_count) {
3700 PL_initav = newAV();
3701 av_push(PL_initav, SvREFCNT_inc(cv));
3707 PL_copline = NOLINE;
3713 newCONSTSUB(HV *stash, char *name, SV *sv)
3716 U32 oldhints = PL_hints;
3717 HV *old_cop_stash = PL_curcop->cop_stash;
3718 HV *old_curstash = PL_curstash;
3719 line_t oldline = PL_curcop->cop_line;
3720 PL_curcop->cop_line = PL_copline;
3722 PL_hints &= ~HINT_BLOCK_SCOPE;
3724 PL_curstash = PL_curcop->cop_stash = stash;
3727 start_subparse(FALSE, 0),
3728 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3729 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3730 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3733 PL_hints = oldhints;
3734 PL_curcop->cop_stash = old_cop_stash;
3735 PL_curstash = old_curstash;
3736 PL_curcop->cop_line = oldline;
3740 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3743 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3746 if (cv = (name ? GvCV(gv) : Nullcv)) {
3748 /* just a cached method */
3752 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3753 /* already defined (or promised) */
3754 if (PL_dowarn && !(CvGV(cv) && GvSTASH(CvGV(cv))
3755 && HvNAME(GvSTASH(CvGV(cv)))
3756 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3757 line_t oldline = PL_curcop->cop_line;
3758 if (PL_copline != NOLINE)
3759 PL_curcop->cop_line = PL_copline;
3760 warn("Subroutine %s redefined",name);
3761 PL_curcop->cop_line = oldline;
3768 if (cv) /* must reuse cv if autoloaded */
3771 cv = (CV*)NEWSV(1105,0);
3772 sv_upgrade((SV *)cv, SVt_PVCV);
3776 PL_sub_generation++;
3779 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3781 New(666, CvMUTEXP(cv), 1, perl_mutex);
3782 MUTEX_INIT(CvMUTEXP(cv));
3784 #endif /* USE_THREADS */
3785 CvFILEGV(cv) = gv_fetchfile(filename);
3786 CvXSUB(cv) = subaddr;
3789 char *s = strrchr(name,':');
3794 if (strEQ(s, "BEGIN")) {
3796 PL_beginav = newAV();
3797 av_push(PL_beginav, (SV *)cv);
3800 else if (strEQ(s, "END")) {
3803 av_unshift(PL_endav, 1);
3804 av_store(PL_endav, 0, (SV *)cv);
3807 else if (strEQ(s, "INIT")) {
3809 PL_initav = newAV();
3810 av_push(PL_initav, (SV *)cv);
3821 newFORM(I32 floor, OP *o, OP *block)
3830 name = SvPVx(cSVOPo->op_sv, PL_na);
3833 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
3835 if (cv = GvFORM(gv)) {
3837 line_t oldline = PL_curcop->cop_line;
3839 PL_curcop->cop_line = PL_copline;
3840 warn("Format %s redefined",name);
3841 PL_curcop->cop_line = oldline;
3847 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3848 CvFILEGV(cv) = PL_curcop->cop_filegv;
3850 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3851 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
3852 SvPADTMP_on(PL_curpad[ix]);
3855 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
3856 CvSTART(cv) = LINKLIST(CvROOT(cv));
3857 CvROOT(cv)->op_next = 0;
3860 PL_copline = NOLINE;
3867 return newUNOP(OP_REFGEN, 0,
3868 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
3874 return newUNOP(OP_REFGEN, 0,
3875 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
3879 newANONSUB(I32 floor, OP *proto, OP *block)
3881 return newUNOP(OP_REFGEN, 0,
3882 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
3888 switch (o->op_type) {
3890 o->op_type = OP_PADAV;
3891 o->op_ppaddr = ppaddr[OP_PADAV];
3892 return ref(o, OP_RV2AV);
3895 o->op_type = OP_RV2AV;
3896 o->op_ppaddr = ppaddr[OP_RV2AV];
3901 warn("oops: oopsAV");
3910 switch (o->op_type) {
3913 o->op_type = OP_PADHV;
3914 o->op_ppaddr = ppaddr[OP_PADHV];
3915 return ref(o, OP_RV2HV);
3919 o->op_type = OP_RV2HV;
3920 o->op_ppaddr = ppaddr[OP_RV2HV];
3925 warn("oops: oopsHV");
3934 if (o->op_type == OP_PADANY) {
3935 o->op_type = OP_PADAV;
3936 o->op_ppaddr = ppaddr[OP_PADAV];
3939 return newUNOP(OP_RV2AV, 0, scalar(o));
3943 newGVREF(I32 type, OP *o)
3945 if (type == OP_MAPSTART)
3946 return newUNOP(OP_NULL, 0, o);
3947 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
3953 if (o->op_type == OP_PADANY) {
3954 o->op_type = OP_PADHV;
3955 o->op_ppaddr = ppaddr[OP_PADHV];
3958 return newUNOP(OP_RV2HV, 0, scalar(o));
3964 croak("NOT IMPL LINE %d",__LINE__);
3970 newCVREF(I32 flags, OP *o)
3972 return newUNOP(OP_RV2CV, flags, scalar(o));
3978 if (o->op_type == OP_PADANY) {
3979 o->op_type = OP_PADSV;
3980 o->op_ppaddr = ppaddr[OP_PADSV];
3983 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
3984 o->op_flags |= OPpDONE_SVREF;
3987 return newUNOP(OP_RV2SV, 0, scalar(o));
3990 /* Check routines. */
3998 name = NEWSV(1106,0);
3999 sv_upgrade(name, SVt_PVNV);
4000 sv_setpvn(name, "&", 1);
4003 ix = pad_alloc(o->op_type, SVs_PADMY);
4004 av_store(PL_comppad_name, ix, name);
4005 av_store(PL_comppad, ix, cSVOPo->op_sv);
4006 SvPADMY_on(cSVOPo->op_sv);
4007 cSVOPo->op_sv = Nullsv;
4008 cSVOPo->op_targ = ix;
4015 o->op_private = PL_hints;
4022 if (cUNOPo->op_first->op_type == OP_CONCAT)
4023 o->op_flags |= OPf_STACKED;
4030 if (o->op_flags & OPf_KIDS) {
4033 OPCODE type = o->op_type;
4034 o = modkids(ck_fun(o), type);
4035 kid = cUNOPo->op_first;
4036 newop = kUNOP->op_first->op_sibling;
4038 (newop->op_sibling ||
4039 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4040 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4041 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4045 op_free(kUNOP->op_first);
4046 kUNOP->op_first = newop;
4048 o->op_ppaddr = ppaddr[++o->op_type];
4057 if (o->op_flags & OPf_KIDS) {
4058 OP *kid = cUNOPo->op_first;
4059 if (kid->op_type == OP_HSLICE)
4060 o->op_private |= OPpSLICE;
4061 else if (kid->op_type != OP_HELEM)
4062 croak("%s argument is not a HASH element or slice",
4063 op_desc[o->op_type]);
4072 I32 type = o->op_type;
4074 if (o->op_flags & OPf_KIDS) {
4075 if (cLISTOPo->op_first->op_type == OP_STUB) {
4077 o = newUNOP(type, OPf_SPECIAL,
4078 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4088 PL_hints |= HINT_BLOCK_SCOPE;
4089 if (o->op_flags & OPf_KIDS) {
4090 SVOP *kid = (SVOP*)cUNOPo->op_first;
4093 o->op_flags &= ~OPf_KIDS;
4096 else if (kid->op_type == OP_LINESEQ) {
4099 kid->op_next = o->op_next;
4100 cUNOPo->op_first = 0;
4103 Newz(1101, enter, 1, LOGOP);
4104 enter->op_type = OP_ENTERTRY;
4105 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4106 enter->op_private = 0;
4108 /* establish postfix order */
4109 enter->op_next = (OP*)enter;
4111 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4112 o->op_type = OP_LEAVETRY;
4113 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4114 enter->op_other = o;
4122 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4124 o->op_targ = (PADOFFSET)PL_hints;
4132 if (o->op_flags & OPf_STACKED) {
4134 kid = cUNOPo->op_first->op_sibling;
4135 if (kid->op_type == OP_RV2GV)
4147 if (o->op_flags & OPf_KIDS) {
4148 OP *kid = cUNOPo->op_first;
4149 if (kid->op_type != OP_HELEM)
4150 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4157 ck_gvconst(register OP *o)
4159 o = fold_constants(o);
4160 if (o->op_type == OP_CONST)
4166 ck_rvconst(register OP *o)
4169 SVOP *kid = (SVOP*)cUNOPo->op_first;
4171 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4172 if (kid->op_type == OP_CONST) {
4176 SV *kidsv = kid->op_sv;
4178 /* Is it a constant from cv_const_sv()? */
4179 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4180 SV *rsv = SvRV(kidsv);
4181 int svtype = SvTYPE(rsv);
4182 char *badtype = Nullch;
4184 switch (o->op_type) {
4186 if (svtype > SVt_PVMG)
4187 badtype = "a SCALAR";
4190 if (svtype != SVt_PVAV)
4191 badtype = "an ARRAY";
4194 if (svtype != SVt_PVHV) {
4195 if (svtype == SVt_PVAV) { /* pseudohash? */
4196 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4197 if (ksv && SvROK(*ksv)
4198 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4207 if (svtype != SVt_PVCV)
4212 croak("Constant is not %s reference", badtype);
4215 name = SvPV(kidsv, PL_na);
4217 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4218 char *badthing = Nullch;
4219 switch (o->op_type) {
4221 badthing = "a SCALAR";
4224 badthing = "an ARRAY";
4227 badthing = "a HASH";
4232 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4236 * This is a little tricky. We only want to add the symbol if we
4237 * didn't add it in the lexer. Otherwise we get duplicate strict
4238 * warnings. But if we didn't add it in the lexer, we must at
4239 * least pretend like we wanted to add it even if it existed before,
4240 * or we get possible typo warnings. OPpCONST_ENTERED says
4241 * whether the lexer already added THIS instance of this symbol.
4243 iscv = (o->op_type == OP_RV2CV) * 2;
4245 gv = gv_fetchpv(name,
4246 iscv | !(kid->op_private & OPpCONST_ENTERED),
4249 : o->op_type == OP_RV2SV
4251 : o->op_type == OP_RV2AV
4253 : o->op_type == OP_RV2HV
4256 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4258 kid->op_type = OP_GV;
4259 SvREFCNT_dec(kid->op_sv);
4260 kid->op_sv = SvREFCNT_inc(gv);
4270 I32 type = o->op_type;
4272 if (o->op_flags & OPf_REF)
4275 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4276 SVOP *kid = (SVOP*)cUNOPo->op_first;
4278 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4279 OP *newop = newGVOP(type, OPf_REF,
4280 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4287 if (type == OP_FTTTY)
4288 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4291 return newUNOP(type, 0, newDEFSVOP());
4304 int type = o->op_type;
4305 register I32 oa = opargs[type] >> OASHIFT;
4307 if (o->op_flags & OPf_STACKED) {
4308 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4311 return no_fh_allowed(o);
4314 if (o->op_flags & OPf_KIDS) {
4315 tokid = &cLISTOPo->op_first;
4316 kid = cLISTOPo->op_first;
4317 if (kid->op_type == OP_PUSHMARK ||
4318 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4320 tokid = &kid->op_sibling;
4321 kid = kid->op_sibling;
4323 if (!kid && opargs[type] & OA_DEFGV)
4324 *tokid = kid = newDEFSVOP();
4328 sibl = kid->op_sibling;
4342 if (kid->op_type == OP_CONST &&
4343 (kid->op_private & OPpCONST_BARE)) {
4344 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4345 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4346 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4348 warn("Array @%s missing the @ in argument %ld of %s()",
4349 name, (long)numargs, op_desc[type]);
4352 kid->op_sibling = sibl;
4355 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4356 bad_type(numargs, "array", op_desc[o->op_type], kid);
4360 if (kid->op_type == OP_CONST &&
4361 (kid->op_private & OPpCONST_BARE)) {
4362 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4363 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4364 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4366 warn("Hash %%%s missing the %% in argument %ld of %s()",
4367 name, (long)numargs, op_desc[type]);
4370 kid->op_sibling = sibl;
4373 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4374 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4379 OP *newop = newUNOP(OP_NULL, 0, kid);
4380 kid->op_sibling = 0;
4382 newop->op_next = newop;
4384 kid->op_sibling = sibl;
4389 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4390 if (kid->op_type == OP_CONST &&
4391 (kid->op_private & OPpCONST_BARE)) {
4392 OP *newop = newGVOP(OP_GV, 0,
4393 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4399 kid->op_sibling = 0;
4400 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4402 kid->op_sibling = sibl;
4408 mod(scalar(kid), type);
4412 tokid = &kid->op_sibling;
4413 kid = kid->op_sibling;
4415 o->op_private |= numargs;
4417 return too_many_arguments(o,op_desc[o->op_type]);
4420 else if (opargs[type] & OA_DEFGV) {
4422 return newUNOP(type, 0, newDEFSVOP());
4426 while (oa & OA_OPTIONAL)
4428 if (oa && oa != OA_LIST)
4429 return too_few_arguments(o,op_desc[o->op_type]);
4439 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4440 append_elem(OP_GLOB, o, newDEFSVOP());
4442 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4443 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4445 if (gv && GvIMPORTED_CV(gv)) {
4446 static int glob_index;
4448 append_elem(OP_GLOB, o,
4449 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4450 o->op_type = OP_LIST;
4451 o->op_ppaddr = ppaddr[OP_LIST];
4452 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4453 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4454 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4455 append_elem(OP_LIST, o,
4456 scalar(newUNOP(OP_RV2CV, 0,
4457 newGVOP(OP_GV, 0, gv)))));
4458 o = newUNOP(OP_NULL, 0, ck_subr(o));
4459 o->op_targ = OP_GLOB; /* hint at what it used to be */
4462 gv = newGVgen("main");
4464 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4474 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4476 o->op_ppaddr = ppaddr[OP_GREPSTART];
4477 Newz(1101, gwop, 1, LOGOP);
4479 if (o->op_flags & OPf_STACKED) {
4482 kid = cLISTOPo->op_first->op_sibling;
4483 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4486 kid->op_next = (OP*)gwop;
4487 o->op_flags &= ~OPf_STACKED;
4489 kid = cLISTOPo->op_first->op_sibling;
4490 if (type == OP_MAPWHILE)
4497 kid = cLISTOPo->op_first->op_sibling;
4498 if (kid->op_type != OP_NULL)
4499 croak("panic: ck_grep");
4500 kid = kUNOP->op_first;
4502 gwop->op_type = type;
4503 gwop->op_ppaddr = ppaddr[type];
4504 gwop->op_first = listkids(o);
4505 gwop->op_flags |= OPf_KIDS;
4506 gwop->op_private = 1;
4507 gwop->op_other = LINKLIST(kid);
4508 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4509 kid->op_next = (OP*)gwop;
4511 kid = cLISTOPo->op_first->op_sibling;
4512 if (!kid || !kid->op_sibling)
4513 return too_few_arguments(o,op_desc[o->op_type]);
4514 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4515 mod(kid, OP_GREPSTART);
4523 if (o->op_flags & OPf_KIDS) {
4524 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4526 kid = kid->op_sibling; /* get past "big" */
4527 if (kid && kid->op_type == OP_CONST)
4528 fbm_compile(((SVOP*)kid)->op_sv, 0);
4534 ck_lengthconst(OP *o)
4536 /* XXX length optimization goes here */
4543 OPCODE type = o->op_type;
4544 return modkids(ck_fun(o), type);
4550 OPCODE type = o->op_type;
4551 return refkids(ck_fun(o), type);
4559 kid = cLISTOPo->op_first;
4562 kid = cLISTOPo->op_first;
4564 if (kid->op_type == OP_PUSHMARK)
4565 kid = kid->op_sibling;
4566 if (kid && o->op_flags & OPf_STACKED)
4567 kid = kid->op_sibling;
4568 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4569 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4570 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4571 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4572 cLISTOPo->op_first->op_sibling = kid;
4573 cLISTOPo->op_last = kid;
4574 kid = kid->op_sibling;
4579 append_elem(o->op_type, o, newDEFSVOP());
4585 if (PL_hints & HINT_LOCALE)
4586 o->op_private |= OPpLOCALE;
4593 ck_fun_locale(OP *o)
4599 if (PL_hints & HINT_LOCALE)
4600 o->op_private |= OPpLOCALE;
4611 if (PL_hints & HINT_LOCALE)
4612 o->op_private |= OPpLOCALE;
4621 o->op_private |= OPpRUNTIME;
4634 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4635 o->op_private |= OPpREPEAT_DOLIST;
4636 cBINOPo->op_first = force_list(cBINOPo->op_first);
4646 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4647 SVOP *kid = (SVOP*)cUNOPo->op_first;
4649 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4651 for (s = SvPVX(kid->op_sv); *s; s++) {
4652 if (*s == ':' && s[1] == ':') {
4654 Move(s+2, s+1, strlen(s+2)+1, char);
4655 --SvCUR(kid->op_sv);
4658 sv_catpvn(kid->op_sv, ".pm", 3);
4667 croak("NOT IMPL LINE %d",__LINE__);
4676 if (o->op_flags & OPf_KIDS) {
4677 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4678 if (kid && kid->op_sibling) {
4679 o->op_type = OP_SSELECT;
4680 o->op_ppaddr = ppaddr[OP_SSELECT];
4682 return fold_constants(o);
4686 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4687 if (kid && kid->op_type == OP_RV2GV)
4688 kid->op_private &= ~HINT_STRICT_REFS;
4695 I32 type = o->op_type;
4697 if (!(o->op_flags & OPf_KIDS)) {
4702 if (!CvUNIQUE(PL_compcv)) {
4703 argop = newOP(OP_PADAV, OPf_REF);
4704 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4707 argop = newUNOP(OP_RV2AV, 0,
4708 scalar(newGVOP(OP_GV, 0,
4709 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4712 argop = newUNOP(OP_RV2AV, 0,
4713 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4714 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4715 #endif /* USE_THREADS */
4716 return newUNOP(type, 0, scalar(argop));
4718 return scalar(modkids(ck_fun(o), type));
4726 if (PL_hints & HINT_LOCALE)
4727 o->op_private |= OPpLOCALE;
4730 if (o->op_flags & OPf_STACKED) {
4731 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4733 kid = kUNOP->op_first; /* get past rv2gv */
4735 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4737 if (kid->op_type == OP_SCOPE) {
4741 else if (kid->op_type == OP_LEAVE) {
4742 if (o->op_type == OP_SORT) {
4743 null(kid); /* wipe out leave */
4746 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4747 if (k->op_next == kid)
4752 kid->op_next = 0; /* just disconnect the leave */
4753 k = kLISTOP->op_first;
4757 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4758 null(kid); /* wipe out rv2gv */
4759 if (o->op_type == OP_SORT)
4763 o->op_flags |= OPf_SPECIAL;
4775 if (o->op_flags & OPf_STACKED)
4776 return no_fh_allowed(o);
4778 kid = cLISTOPo->op_first;
4779 if (kid->op_type != OP_NULL)
4780 croak("panic: ck_split");
4781 kid = kid->op_sibling;
4782 op_free(cLISTOPo->op_first);
4783 cLISTOPo->op_first = kid;
4785 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4786 cLISTOPo->op_last = kid; /* There was only one element previously */
4789 if (kid->op_type != OP_MATCH) {
4790 OP *sibl = kid->op_sibling;
4791 kid->op_sibling = 0;
4792 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4793 if (cLISTOPo->op_first == cLISTOPo->op_last)
4794 cLISTOPo->op_last = kid;
4795 cLISTOPo->op_first = kid;
4796 kid->op_sibling = sibl;
4799 kid->op_type = OP_PUSHRE;
4800 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4803 if (!kid->op_sibling)
4804 append_elem(OP_SPLIT, o, newDEFSVOP());
4806 kid = kid->op_sibling;
4809 if (!kid->op_sibling)
4810 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4812 kid = kid->op_sibling;
4815 if (kid->op_sibling)
4816 return too_many_arguments(o,op_desc[o->op_type]);
4825 OP *prev = ((cUNOPo->op_first->op_sibling)
4826 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
4827 OP *o2 = prev->op_sibling;
4835 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
4836 if (cvop->op_type == OP_RV2CV) {
4838 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
4839 null(cvop); /* disable rv2cv */
4840 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
4841 if (tmpop->op_type == OP_GV) {
4842 cv = GvCVu(tmpop->op_sv);
4843 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
4844 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
4845 proto = SvPV((SV*)cv, PL_na);
4849 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4850 if (PERLDB_SUB && PL_curstash != PL_debstash)
4851 o->op_private |= OPpENTERSUB_DB;
4852 while (o2 != cvop) {
4856 return too_many_arguments(o, gv_ename(namegv));
4874 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
4875 bad_type(arg, "block", gv_ename(namegv), o2);
4880 if (o2->op_type == OP_RV2GV)
4884 OP* sib = kid->op_sibling;
4885 kid->op_sibling = 0;
4886 o2 = newUNOP(OP_RV2GV, 0, kid);
4887 o2->op_sibling = sib;
4888 prev->op_sibling = o2;
4896 if (o2->op_type != OP_RV2GV)
4897 bad_type(arg, "symbol", gv_ename(namegv), o2);
4900 if (o2->op_type != OP_RV2CV)
4901 bad_type(arg, "sub", gv_ename(namegv), o2);
4904 if (o2->op_type != OP_RV2SV
4905 && o2->op_type != OP_PADSV
4906 && o2->op_type != OP_THREADSV)
4908 bad_type(arg, "scalar", gv_ename(namegv), o2);
4912 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
4913 bad_type(arg, "array", gv_ename(namegv), o2);
4916 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
4917 bad_type(arg, "hash", gv_ename(namegv), o2);
4921 OP* sib = kid->op_sibling;
4922 kid->op_sibling = 0;
4923 o2 = newUNOP(OP_REFGEN, 0, kid);
4924 o2->op_sibling = sib;
4925 prev->op_sibling = o2;
4936 croak("Malformed prototype for %s: %s",
4937 gv_ename(namegv), SvPV((SV*)cv, PL_na));
4942 mod(o2, OP_ENTERSUB);
4944 o2 = o2->op_sibling;
4946 if (proto && !optional &&
4947 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
4948 return too_few_arguments(o, gv_ename(namegv));
4955 SvREADONLY_on(cSVOPo->op_sv);
4962 if (o->op_flags & OPf_KIDS) {
4963 SVOP *kid = (SVOP*)cUNOPo->op_first;
4965 if (kid->op_type == OP_NULL)
4966 kid = (SVOP*)kid->op_sibling;
4968 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
4969 o->op_flags |= OPf_SPECIAL;
4974 /* A peephole optimizer. We visit the ops in the order they're to execute. */
4977 peep(register OP *o)
4980 register OP* oldop = 0;
4981 if (!o || o->op_seq)
4985 SAVESPTR(PL_curcop);
4986 for (; o; o = o->op_next) {
4992 switch (o->op_type) {
4995 PL_curcop = ((COP*)o); /* for warnings */
4996 o->op_seq = PL_op_seqmax++;
5007 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5009 o->op_seq = PL_op_seqmax++;
5012 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5013 o->op_seq = PL_op_seqmax++;
5014 break; /* Scalar stub must produce undef. List stub is noop */
5018 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5019 PL_curcop = ((COP*)o);
5025 if (oldop && o->op_next) {
5026 oldop->op_next = o->op_next;
5029 o->op_seq = PL_op_seqmax++;
5033 if (o->op_next->op_type == OP_RV2SV) {
5034 if (!(o->op_next->op_private & OPpDEREF)) {
5036 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5037 o->op_next = o->op_next->op_next;
5038 o->op_type = OP_GVSV;
5039 o->op_ppaddr = ppaddr[OP_GVSV];
5042 else if (o->op_next->op_type == OP_RV2AV) {
5043 OP* pop = o->op_next->op_next;
5045 if (pop->op_type == OP_CONST &&
5046 (PL_op = pop->op_next) &&
5047 pop->op_next->op_type == OP_AELEM &&
5048 !(pop->op_next->op_private &
5049 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5050 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5054 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5058 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5059 o->op_next = pop->op_next->op_next;
5060 o->op_type = OP_AELEMFAST;
5061 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5062 o->op_private = (U8)i;
5063 GvAVn(((GVOP*)o)->op_gv);
5066 o->op_seq = PL_op_seqmax++;
5073 o->op_seq = PL_op_seqmax++;
5074 while (cLOGOP->op_other->op_type == OP_NULL)
5075 cLOGOP->op_other = cLOGOP->op_other->op_next;
5076 peep(cLOGOP->op_other);
5080 o->op_seq = PL_op_seqmax++;
5081 peep(cCONDOP->op_true);
5082 peep(cCONDOP->op_false);
5086 o->op_seq = PL_op_seqmax++;
5087 peep(cLOOP->op_redoop);
5088 peep(cLOOP->op_nextop);
5089 peep(cLOOP->op_lastop);
5095 o->op_seq = PL_op_seqmax++;
5096 peep(cPMOP->op_pmreplstart);
5100 o->op_seq = PL_op_seqmax++;
5101 if (PL_dowarn && o->op_next && o->op_next->op_type == OP_NEXTSTATE) {
5102 if (o->op_next->op_sibling &&
5103 o->op_next->op_sibling->op_type != OP_EXIT &&
5104 o->op_next->op_sibling->op_type != OP_WARN &&
5105 o->op_next->op_sibling->op_type != OP_DIE) {
5106 line_t oldline = PL_curcop->cop_line;
5108 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5109 warn("Statement unlikely to be reached");
5110 warn("(Maybe you meant system() when you said exec()?)\n");
5111 PL_curcop->cop_line = oldline;
5125 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5126 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5128 rop = (UNOP*)((BINOP*)o)->op_first;
5129 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5131 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5132 if (!SvOBJECT(lexname))
5134 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5135 if (!fields || !GvHV(*fields))
5137 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5138 key = SvPV(*svp, keylen);
5139 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5141 croak("No such field \"%s\" in variable %s of type %s",
5142 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5144 ind = SvIV(*indsvp);
5146 croak("Bad index while coercing array into hash");
5147 rop->op_type = OP_RV2AV;
5148 rop->op_ppaddr = ppaddr[OP_RV2AV];
5149 o->op_type = OP_AELEM;
5150 o->op_ppaddr = ppaddr[OP_AELEM];
5152 *svp = newSViv(ind);
5157 o->op_seq = PL_op_seqmax++;