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->*PL_check
24 #define CHECKCALL *PL_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", PL_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, U32 flags));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
54 static void simplify_sort _((OP *o));
55 static bool is_handle_constructor _((OP *o, I32 argnum));
62 SV* tmpsv = sv_newmortal();
63 gv_efullname3(tmpsv, gv, Nullch);
64 return SvPV(tmpsv,n_a);
70 yyerror(form("Missing comma after first argument to %s function",
71 PL_op_desc[o->op_type]));
76 too_few_arguments(OP *o, char *name)
78 yyerror(form("Not enough arguments for %s", name));
83 too_many_arguments(OP *o, char *name)
85 yyerror(form("Too many arguments for %s", name));
90 bad_type(I32 n, char *t, char *name, OP *kid)
92 yyerror(form("Type of arg %d to %s must be %s (not %s)",
93 (int)n, name, t, PL_op_desc[kid->op_type]));
99 int type = o->op_type;
100 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
101 yyerror(form("Can't use subscript on %s", PL_op_desc[type]));
102 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
104 SV *msg = sv_2mortal(
105 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
106 type == OP_ENTERSUB ? '&' : '%'));
110 sv_catsv(GvSV(PL_errgv), msg);
112 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
117 /* "register" allocation */
120 pad_allocmy(char *name)
128 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
129 name[1] == '_' && (int)strlen(name) > 2))
131 if (!isPRINT(name[1])) {
133 name[2] = toCTRL(name[1]);
136 croak("Can't use global %s in \"my\"",name);
138 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
139 SV **svp = AvARRAY(PL_comppad_name);
140 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
142 && sv != &PL_sv_undef
143 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
144 && strEQ(name, SvPVX(sv)))
147 "\"my\" variable %s masks earlier declaration in same %s",
148 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
153 off = pad_alloc(OP_PADSV, SVs_PADMY);
155 sv_upgrade(sv, SVt_PVNV);
157 if (PL_in_my_stash) {
159 croak("Can't declare class for non-scalar %s in \"my\"",name);
161 (void)SvUPGRADE(sv, SVt_PVMG);
162 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
165 av_store(PL_comppad_name, off, sv);
166 SvNVX(sv) = (double)PAD_MAX;
167 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
168 if (!PL_min_intro_pending)
169 PL_min_intro_pending = off;
170 PL_max_intro_pending = off;
172 av_store(PL_comppad, off, (SV*)newAV());
173 else if (*name == '%')
174 av_store(PL_comppad, off, (SV*)newHV());
175 SvPADMY_on(PL_curpad[off]);
179 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
182 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval,
190 register PERL_CONTEXT *cx;
192 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
193 AV *curlist = CvPADLIST(cv);
194 SV **svp = av_fetch(curlist, 0, FALSE);
197 if (!svp || *svp == &PL_sv_undef)
200 svp = AvARRAY(curname);
201 for (off = AvFILLp(curname); off > 0; off--) {
202 if ((sv = svp[off]) &&
203 sv != &PL_sv_undef &&
205 seq > I_32(SvNVX(sv)) &&
206 strEQ(SvPVX(sv), name))
217 return 0; /* don't clone from inactive stack frame */
221 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
222 oldsv = *av_fetch(oldpad, off, TRUE);
223 if (!newoff) { /* Not a mere clone operation. */
224 SV *namesv = NEWSV(1103,0);
225 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
226 sv_upgrade(namesv, SVt_PVNV);
227 sv_setpv(namesv, name);
228 av_store(PL_comppad_name, newoff, namesv);
229 SvNVX(namesv) = (double)PL_curcop->cop_seq;
230 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
231 SvFAKE_on(namesv); /* A ref, not a real var */
232 if (SvOBJECT(sv)) { /* A typed var */
234 (void)SvUPGRADE(namesv, SVt_PVMG);
235 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
238 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
239 /* "It's closures all the way down." */
240 CvCLONE_on(PL_compcv);
242 if (CvANON(PL_compcv))
243 oldsv = Nullsv; /* no need to keep ref */
248 bcv && bcv != cv && !CvCLONE(bcv);
249 bcv = CvOUTSIDE(bcv))
254 if (ckWARN(WARN_CLOSURE)
255 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
258 "Variable \"%s\" may be unavailable",
266 else if (!CvUNIQUE(PL_compcv)) {
267 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
269 "Variable \"%s\" will not stay shared", name);
272 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
278 if (flags & FINDLEX_NOSEARCH)
281 /* Nothing in current lexical context--try eval's context, if any.
282 * This is necessary to let the perldb get at lexically scoped variables.
283 * XXX This will also probably interact badly with eval tree caching.
286 for (i = cx_ix; i >= 0; i--) {
288 switch (CxTYPE(cx)) {
290 if (i == 0 && saweval) {
291 seq = cxstack[saweval].blk_oldcop->cop_seq;
292 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
296 switch (cx->blk_eval.old_op_type) {
302 /* require must have its own scope */
310 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
311 saweval = i; /* so we know where we were called from */
314 seq = cxstack[saweval].blk_oldcop->cop_seq;
315 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
323 pad_findmy(char *name)
329 SV **svp = AvARRAY(PL_comppad_name);
330 U32 seq = PL_cop_seqmax;
336 * Special case to get lexical (and hence per-thread) @_.
337 * XXX I need to find out how to tell at parse-time whether use
338 * of @_ should refer to a lexical (from a sub) or defgv (global
339 * scope and maybe weird sub-ish things like formats). See
340 * startsub in perly.y. It's possible that @_ could be lexical
341 * (at least from subs) even in non-threaded perl.
343 if (strEQ(name, "@_"))
344 return 0; /* success. (NOT_IN_PAD indicates failure) */
345 #endif /* USE_THREADS */
347 /* The one we're looking for is probably just before comppad_name_fill. */
348 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
349 if ((sv = svp[off]) &&
350 sv != &PL_sv_undef &&
353 seq > I_32(SvNVX(sv)))) &&
354 strEQ(SvPVX(sv), name))
357 return (PADOFFSET)off;
358 pendoff = off; /* this pending def. will override import */
362 outside = CvOUTSIDE(PL_compcv);
364 /* Check if if we're compiling an eval'', and adjust seq to be the
365 * eval's seq number. This depends on eval'' having a non-null
366 * CvOUTSIDE() while it is being compiled. The eval'' itself is
367 * identified by CvEVAL being true and CvGV being null. */
368 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
369 cx = &cxstack[cxstack_ix];
371 seq = cx->blk_oldcop->cop_seq;
374 /* See if it's in a nested scope */
375 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
377 /* If there is a pending local definition, this new alias must die */
379 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
380 return off; /* pad_findlex returns 0 for failure...*/
382 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
386 pad_leavemy(I32 fill)
389 SV **svp = AvARRAY(PL_comppad_name);
391 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
392 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
393 if ((sv = svp[off]) && sv != &PL_sv_undef)
394 warn("%s never introduced", SvPVX(sv));
397 /* "Deintroduce" my variables that are leaving with this scope. */
398 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
399 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
400 SvIVX(sv) = PL_cop_seqmax;
405 pad_alloc(I32 optype, U32 tmptype)
411 if (AvARRAY(PL_comppad) != PL_curpad)
412 croak("panic: pad_alloc");
413 if (PL_pad_reset_pending)
415 if (tmptype & SVs_PADMY) {
417 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
418 } while (SvPADBUSY(sv)); /* need a fresh one */
419 retval = AvFILLp(PL_comppad);
422 SV **names = AvARRAY(PL_comppad_name);
423 SSize_t names_fill = AvFILLp(PL_comppad_name);
426 * "foreach" index vars temporarily become aliases to non-"my"
427 * values. Thus we must skip, not just pad values that are
428 * marked as current pad values, but also those with names.
430 if (++PL_padix <= names_fill &&
431 (sv = names[PL_padix]) && sv != &PL_sv_undef)
433 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
434 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
439 SvFLAGS(sv) |= tmptype;
440 PL_curpad = AvARRAY(PL_comppad);
442 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
443 (unsigned long) thr, (unsigned long) PL_curpad,
444 (long) retval, PL_op_name[optype]));
446 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
447 (unsigned long) PL_curpad,
448 (long) retval, PL_op_name[optype]));
449 #endif /* USE_THREADS */
450 return (PADOFFSET)retval;
458 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
459 (unsigned long) thr, (unsigned long) PL_curpad, po));
462 croak("panic: pad_sv po");
463 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
464 (unsigned long) PL_curpad, po));
465 #endif /* USE_THREADS */
466 return PL_curpad[po]; /* eventually we'll turn this into a macro */
470 pad_free(PADOFFSET po)
475 if (AvARRAY(PL_comppad) != PL_curpad)
476 croak("panic: pad_free curpad");
478 croak("panic: pad_free po");
480 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
481 (unsigned long) thr, (unsigned long) PL_curpad, po));
483 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
484 (unsigned long) PL_curpad, po));
485 #endif /* USE_THREADS */
486 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
487 SvPADTMP_off(PL_curpad[po]);
488 if ((I32)po < PL_padix)
493 pad_swipe(PADOFFSET po)
496 if (AvARRAY(PL_comppad) != PL_curpad)
497 croak("panic: pad_swipe curpad");
499 croak("panic: pad_swipe po");
501 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
502 (unsigned long) thr, (unsigned long) PL_curpad, po));
504 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
505 (unsigned long) PL_curpad, po));
506 #endif /* USE_THREADS */
507 SvPADTMP_off(PL_curpad[po]);
508 PL_curpad[po] = NEWSV(1107,0);
509 SvPADTMP_on(PL_curpad[po]);
510 if ((I32)po < PL_padix)
514 /* XXX pad_reset() is currently disabled because it results in serious bugs.
515 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
516 * on the stack by OPs that use them, there are several ways to get an alias
517 * to a shared TARG. Such an alias will change randomly and unpredictably.
518 * We avoid doing this until we can think of a Better Way.
523 #ifdef USE_BROKEN_PAD_RESET
527 if (AvARRAY(PL_comppad) != PL_curpad)
528 croak("panic: pad_reset curpad");
530 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
531 (unsigned long) thr, (unsigned long) PL_curpad));
533 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
534 (unsigned long) PL_curpad));
535 #endif /* USE_THREADS */
536 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
537 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
538 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
539 SvPADTMP_off(PL_curpad[po]);
541 PL_padix = PL_padix_floor;
544 PL_pad_reset_pending = FALSE;
548 /* find_threadsv is not reentrant */
550 find_threadsv(const char *name)
556 /* We currently only handle names of a single character */
557 p = strchr(PL_threadsv_names, *name);
560 key = p - PL_threadsv_names;
561 MUTEX_LOCK(&thr->mutex);
562 svp = av_fetch(thr->threadsv, key, FALSE);
564 MUTEX_UNLOCK(&thr->mutex);
566 SV *sv = NEWSV(0, 0);
567 av_store(thr->threadsv, key, sv);
568 thr->threadsvp = AvARRAY(thr->threadsv);
569 MUTEX_UNLOCK(&thr->mutex);
571 * Some magic variables used to be automagically initialised
572 * in gv_fetchpv. Those which are now per-thread magicals get
573 * initialised here instead.
579 sv_setpv(sv, "\034");
580 sv_magic(sv, 0, 0, name, 1);
585 PL_sawampersand = TRUE;
599 /* XXX %! tied to Errno.pm needs to be added here.
600 * See gv_fetchpv(). */
604 sv_magic(sv, 0, 0, name, 1);
606 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
607 "find_threadsv: new SV %p for $%s%c\n",
608 sv, (*name < 32) ? "^" : "",
609 (*name < 32) ? toCTRL(*name) : *name));
613 #endif /* USE_THREADS */
620 register OP *kid, *nextkid;
622 if (!o || o->op_seq == (U16)-1)
625 if (o->op_flags & OPf_KIDS) {
626 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
627 nextkid = kid->op_sibling; /* Get before next freeing kid */
632 switch (o->op_type) {
634 o->op_targ = 0; /* Was holding old type, if any. */
637 o->op_targ = 0; /* Was holding hints. */
641 if (!(o->op_flags & OPf_SPECIAL))
645 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
647 #endif /* USE_THREADS */
649 if (!(o->op_flags & OPf_REF)
650 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
656 SvREFCNT_dec(cGVOPo->op_gv);
660 Safefree(cCOPo->cop_label);
661 SvREFCNT_dec(cCOPo->cop_filegv);
662 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
663 SvREFCNT_dec(cCOPo->cop_warnings);
666 SvREFCNT_dec(cSVOPo->op_sv);
672 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
676 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
677 SvREFCNT_dec(cSVOPo->op_sv);
679 Safefree(cPVOPo->op_pv);
682 op_free(cPMOPo->op_pmreplroot);
687 ReREFCNT_dec(cPMOPo->op_pmregexp);
692 pad_free(o->op_targ);
700 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
701 pad_free(o->op_targ);
702 o->op_targ = o->op_type;
703 o->op_type = OP_NULL;
704 o->op_ppaddr = PL_ppaddr[OP_NULL];
707 /* Contextualizers */
709 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
719 /* establish postfix order */
720 if (cUNOPo->op_first) {
721 o->op_next = LINKLIST(cUNOPo->op_first);
722 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
724 kid->op_next = LINKLIST(kid->op_sibling);
739 if (o && o->op_flags & OPf_KIDS) {
740 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
749 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
751 if (ckWARN(WARN_SYNTAX)) {
752 line_t oldline = PL_curcop->cop_line;
754 if (PL_copline != NOLINE)
755 PL_curcop->cop_line = PL_copline;
756 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
757 PL_curcop->cop_line = oldline;
768 /* assumes no premature commitment */
769 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
770 || o->op_type == OP_RETURN)
773 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
775 switch (o->op_type) {
777 if (o->op_private & OPpREPEAT_DOLIST)
778 null(((LISTOP*)cBINOPo->op_first)->op_first);
779 scalar(cBINOPo->op_first);
784 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
788 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
789 if (!kPMOP->op_pmreplroot)
790 deprecate("implicit split to @_");
798 if (o->op_flags & OPf_KIDS) {
799 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
805 kid = cLISTOPo->op_first;
807 while (kid = kid->op_sibling) {
813 WITH_THR(PL_curcop = &PL_compiling);
818 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
824 WITH_THR(PL_curcop = &PL_compiling);
837 /* assumes no premature commitment */
838 U8 want = o->op_flags & OPf_WANT;
839 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
840 || o->op_type == OP_RETURN)
843 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
845 switch (o->op_type) {
847 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
851 if (o->op_flags & OPf_STACKED)
855 if (o->op_private == 4)
926 if (!(o->op_private & OPpLVAL_INTRO))
927 useless = PL_op_desc[o->op_type];
934 if (!(o->op_private & OPpLVAL_INTRO) &&
935 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
936 useless = "a variable";
941 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
948 if (ckWARN(WARN_VOID)) {
949 useless = "a constant";
950 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
952 else if (SvPOK(sv)) {
953 if (strnEQ(SvPVX(sv), "di", 2) ||
954 strnEQ(SvPVX(sv), "ds", 2) ||
955 strnEQ(SvPVX(sv), "ig", 2))
960 null(o); /* don't execute a constant */
961 SvREFCNT_dec(sv); /* don't even remember it */
965 o->op_type = OP_PREINC; /* pre-increment is faster */
966 o->op_ppaddr = PL_ppaddr[OP_PREINC];
970 o->op_type = OP_PREDEC; /* pre-decrement is faster */
971 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
977 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
982 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
983 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
984 if (o->op_flags & OPf_STACKED)
990 if (!(o->op_flags & OPf_KIDS))
999 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1006 /* all requires must return a boolean value */
1007 o->op_flags &= ~OPf_WANT;
1010 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1011 if (!kPMOP->op_pmreplroot)
1012 deprecate("implicit split to @_");
1018 if (ckWARN(WARN_VOID))
1019 warner(WARN_VOID, "Useless use of %s in void context", useless);
1028 if (o && o->op_flags & OPf_KIDS) {
1029 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1040 /* assumes no premature commitment */
1041 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1042 || o->op_type == OP_RETURN)
1045 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1047 switch (o->op_type) {
1050 list(cBINOPo->op_first);
1055 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1063 if (!(o->op_flags & OPf_KIDS))
1065 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1066 list(cBINOPo->op_first);
1067 return gen_constant_list(o);
1074 kid = cLISTOPo->op_first;
1076 while (kid = kid->op_sibling) {
1077 if (kid->op_sibling)
1082 WITH_THR(PL_curcop = &PL_compiling);
1086 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1087 if (kid->op_sibling)
1092 WITH_THR(PL_curcop = &PL_compiling);
1095 /* all requires must return a boolean value */
1096 o->op_flags &= ~OPf_WANT;
1108 if (o->op_type == OP_LINESEQ ||
1109 o->op_type == OP_SCOPE ||
1110 o->op_type == OP_LEAVE ||
1111 o->op_type == OP_LEAVETRY)
1114 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1115 if (kid->op_sibling) {
1119 PL_curcop = &PL_compiling;
1121 o->op_flags &= ~OPf_PARENS;
1122 if (PL_hints & HINT_BLOCK_SCOPE)
1123 o->op_flags |= OPf_PARENS;
1126 o = newOP(OP_STUB, 0);
1131 modkids(OP *o, I32 type)
1134 if (o && o->op_flags & OPf_KIDS) {
1135 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1142 mod(OP *o, I32 type)
1149 if (!o || PL_error_count)
1152 switch (o->op_type) {
1157 if (!(o->op_private & (OPpCONST_ARYBASE)))
1159 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1160 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1164 SAVEI32(PL_compiling.cop_arybase);
1165 PL_compiling.cop_arybase = 0;
1167 else if (type == OP_REFGEN)
1170 croak("That use of $[ is unsupported");
1173 if (o->op_flags & OPf_PARENS)
1177 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1178 !(o->op_flags & OPf_STACKED)) {
1179 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1180 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1181 assert(cUNOPo->op_first->op_type == OP_NULL);
1182 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1188 /* grep, foreach, subcalls, refgen */
1189 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1191 yyerror(form("Can't modify %s in %s",
1192 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1193 ? "do block" : PL_op_desc[o->op_type]),
1194 type ? PL_op_desc[type] : "local"));
1208 case OP_RIGHT_SHIFT:
1217 if (!(o->op_flags & OPf_STACKED))
1223 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1229 if (!type && cUNOPo->op_first->op_type != OP_GV)
1230 croak("Can't localize through a reference");
1231 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1232 PL_modcount = 10000;
1233 return o; /* Treat \(@foo) like ordinary list. */
1237 if (scalar_mod_type(o, type))
1239 ref(cUNOPo->op_first, o->op_type);
1248 PL_modcount = 10000;
1251 if (!type && cUNOPo->op_first->op_type != OP_GV)
1252 croak("Can't localize through a reference");
1253 ref(cUNOPo->op_first, o->op_type);
1257 PL_hints |= HINT_BLOCK_SCOPE;
1267 PL_modcount = 10000;
1268 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1269 return o; /* Treat \(@foo) like ordinary list. */
1270 if (scalar_mod_type(o, type))
1276 croak("Can't localize lexical variable %s",
1277 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1282 PL_modcount++; /* XXX ??? */
1284 #endif /* USE_THREADS */
1290 if (type != OP_SASSIGN)
1294 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1300 pad_free(o->op_targ);
1301 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1302 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1303 if (o->op_flags & OPf_KIDS)
1304 mod(cBINOPo->op_first->op_sibling, type);
1309 ref(cBINOPo->op_first, o->op_type);
1310 if (type == OP_ENTERSUB &&
1311 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1312 o->op_private |= OPpLVAL_DEFER;
1319 if (o->op_flags & OPf_KIDS)
1320 mod(cLISTOPo->op_last, type);
1324 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1326 else if (!(o->op_flags & OPf_KIDS))
1328 if (o->op_targ != OP_LIST) {
1329 mod(cBINOPo->op_first, type);
1334 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1338 o->op_flags |= OPf_MOD;
1340 if (type == OP_AASSIGN || type == OP_SASSIGN)
1341 o->op_flags |= OPf_SPECIAL|OPf_REF;
1343 o->op_private |= OPpLVAL_INTRO;
1344 o->op_flags &= ~OPf_SPECIAL;
1345 PL_hints |= HINT_BLOCK_SCOPE;
1347 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1348 o->op_flags |= OPf_REF;
1353 scalar_mod_type(OP *o, I32 type)
1357 if (o->op_type == OP_RV2GV)
1381 case OP_RIGHT_SHIFT:
1400 is_handle_constructor(OP *o, I32 argnum)
1402 switch (o->op_type) {
1410 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1423 refkids(OP *o, I32 type)
1426 if (o && o->op_flags & OPf_KIDS) {
1427 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1434 ref(OP *o, I32 type)
1438 if (!o || PL_error_count)
1441 switch (o->op_type) {
1443 if ((type == OP_DEFINED || type == OP_LOCK) &&
1444 !(o->op_flags & OPf_STACKED)) {
1445 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1446 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1447 assert(cUNOPo->op_first->op_type == OP_NULL);
1448 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1449 o->op_flags |= OPf_SPECIAL;
1454 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1458 if (type == OP_DEFINED)
1459 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1460 ref(cUNOPo->op_first, o->op_type);
1463 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1464 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1465 : type == OP_RV2HV ? OPpDEREF_HV
1467 o->op_flags |= OPf_MOD;
1472 o->op_flags |= OPf_MOD; /* XXX ??? */
1477 o->op_flags |= OPf_REF;
1480 if (type == OP_DEFINED)
1481 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1482 ref(cUNOPo->op_first, o->op_type);
1487 o->op_flags |= OPf_REF;
1492 if (!(o->op_flags & OPf_KIDS))
1494 ref(cBINOPo->op_first, type);
1498 ref(cBINOPo->op_first, o->op_type);
1499 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1500 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1501 : type == OP_RV2HV ? OPpDEREF_HV
1503 o->op_flags |= OPf_MOD;
1511 if (!(o->op_flags & OPf_KIDS))
1513 ref(cLISTOPo->op_last, type);
1528 if (!o || PL_error_count)
1532 if (type == OP_LIST) {
1533 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1535 } else if (type == OP_UNDEF) {
1537 } else if (type != OP_PADSV &&
1540 type != OP_PUSHMARK)
1542 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1545 o->op_flags |= OPf_MOD;
1546 o->op_private |= OPpLVAL_INTRO;
1554 o->op_flags |= OPf_PARENS;
1559 bind_match(I32 type, OP *left, OP *right)
1564 if (ckWARN(WARN_UNSAFE) &&
1565 (left->op_type == OP_RV2AV ||
1566 left->op_type == OP_RV2HV ||
1567 left->op_type == OP_PADAV ||
1568 left->op_type == OP_PADHV)) {
1569 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1570 right->op_type == OP_TRANS)
1571 ? right->op_type : OP_MATCH];
1572 char *sample = ((left->op_type == OP_RV2AV ||
1573 left->op_type == OP_PADAV)
1574 ? "@array" : "%hash");
1576 "Applying %s to %s will act on scalar(%s)",
1577 desc, sample, sample);
1580 if (right->op_type == OP_MATCH ||
1581 right->op_type == OP_SUBST ||
1582 right->op_type == OP_TRANS) {
1583 right->op_flags |= OPf_STACKED;
1584 if (right->op_type != OP_MATCH)
1585 left = mod(left, right->op_type);
1586 if (right->op_type == OP_TRANS)
1587 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1589 o = prepend_elem(right->op_type, scalar(left), right);
1591 return newUNOP(OP_NOT, 0, scalar(o));
1595 return bind_match(type, left,
1596 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1604 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1605 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1612 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1613 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1614 o->op_type = OP_LEAVE;
1615 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1618 if (o->op_type == OP_LINESEQ) {
1620 o->op_type = OP_SCOPE;
1621 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1622 kid = ((LISTOP*)o)->op_first;
1623 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1624 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1629 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1639 SAVESPTR(GvHV(PL_hintgv));
1640 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1641 SAVEFREESV(GvHV(PL_hintgv));
1645 block_start(int full)
1648 int retval = PL_savestack_ix;
1650 SAVEI32(PL_comppad_name_floor);
1652 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1653 PL_comppad_name_floor = PL_comppad_name_fill;
1655 PL_comppad_name_floor = 0;
1657 SAVEI32(PL_min_intro_pending);
1658 SAVEI32(PL_max_intro_pending);
1659 PL_min_intro_pending = 0;
1660 SAVEI32(PL_comppad_name_fill);
1661 SAVEI32(PL_padix_floor);
1662 PL_padix_floor = PL_padix;
1663 PL_pad_reset_pending = FALSE;
1665 PL_hints &= ~HINT_BLOCK_SCOPE;
1666 SAVEPPTR(PL_compiling.cop_warnings);
1667 if (PL_compiling.cop_warnings != WARN_ALL &&
1668 PL_compiling.cop_warnings != WARN_NONE) {
1669 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1670 SAVEFREESV(PL_compiling.cop_warnings) ;
1678 block_end(I32 floor, OP *seq)
1681 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1682 OP* retval = scalarseq(seq);
1684 PL_pad_reset_pending = FALSE;
1685 PL_compiling.op_private = PL_hints;
1687 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1688 pad_leavemy(PL_comppad_name_fill);
1697 OP *o = newOP(OP_THREADSV, 0);
1698 o->op_targ = find_threadsv("_");
1701 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1702 #endif /* USE_THREADS */
1710 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1711 PL_eval_start = linklist(PL_eval_root);
1712 PL_eval_root->op_next = 0;
1713 peep(PL_eval_start);
1718 PL_main_root = scope(sawparens(scalarvoid(o)));
1719 PL_curcop = &PL_compiling;
1720 PL_main_start = LINKLIST(PL_main_root);
1721 PL_main_root->op_next = 0;
1722 peep(PL_main_start);
1725 /* Register with debugger */
1727 CV *cv = perl_get_cv("DB::postponed", FALSE);
1731 XPUSHs((SV*)PL_compiling.cop_filegv);
1733 perl_call_sv((SV*)cv, G_DISCARD);
1740 localize(OP *o, I32 lex)
1742 if (o->op_flags & OPf_PARENS)
1746 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1748 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1749 if (*s == ';' || *s == '=')
1750 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1751 lex ? "my" : "local");
1755 PL_in_my_stash = Nullhv;
1759 return mod(o, OP_NULL); /* a bit kludgey */
1765 if (o->op_type == OP_LIST) {
1768 o2 = newOP(OP_THREADSV, 0);
1769 o2->op_targ = find_threadsv(";");
1771 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1772 #endif /* USE_THREADS */
1773 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1779 fold_constants(register OP *o)
1783 I32 type = o->op_type;
1786 if (PL_opargs[type] & OA_RETSCALAR)
1788 if (PL_opargs[type] & OA_TARGET)
1789 o->op_targ = pad_alloc(type, SVs_PADTMP);
1791 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1792 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1794 if (!(PL_opargs[type] & OA_FOLDCONST))
1809 if (o->op_private & OPpLOCALE)
1814 goto nope; /* Don't try to run w/ errors */
1816 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1817 if (curop->op_type != OP_CONST &&
1818 curop->op_type != OP_LIST &&
1819 curop->op_type != OP_SCALAR &&
1820 curop->op_type != OP_NULL &&
1821 curop->op_type != OP_PUSHMARK) {
1826 curop = LINKLIST(o);
1830 sv = *(PL_stack_sp--);
1831 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1832 pad_swipe(o->op_targ);
1833 else if (SvTEMP(sv)) { /* grab mortal temp? */
1834 (void)SvREFCNT_inc(sv);
1838 if (type == OP_RV2GV)
1839 return newGVOP(OP_GV, 0, (GV*)sv);
1841 /* try to smush double to int, but don't smush -2.0 to -2 */
1842 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1846 if ((double)iv == SvNV(sv)) {
1851 SvIOK_off(sv); /* undo SvIV() damage */
1853 return newSVOP(OP_CONST, 0, sv);
1857 if (!(PL_opargs[type] & OA_OTHERINT))
1860 if (!(PL_hints & HINT_INTEGER)) {
1861 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1864 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1865 if (curop->op_type == OP_CONST) {
1866 if (SvIOK(((SVOP*)curop)->op_sv))
1870 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1874 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1881 gen_constant_list(register OP *o)
1885 I32 oldtmps_floor = PL_tmps_floor;
1889 return o; /* Don't attempt to run with errors */
1891 PL_op = curop = LINKLIST(o);
1897 PL_tmps_floor = oldtmps_floor;
1899 o->op_type = OP_RV2AV;
1900 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1901 curop = ((UNOP*)o)->op_first;
1902 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1909 convert(I32 type, I32 flags, OP *o)
1914 if (!o || o->op_type != OP_LIST)
1915 o = newLISTOP(OP_LIST, 0, o, Nullop);
1917 o->op_flags &= ~OPf_WANT;
1919 if (!(PL_opargs[type] & OA_MARK))
1920 null(cLISTOPo->op_first);
1923 o->op_ppaddr = PL_ppaddr[type];
1924 o->op_flags |= flags;
1926 o = CHECKOP(type, o);
1927 if (o->op_type != type)
1930 if (cLISTOPo->op_children < 7) {
1931 /* XXX do we really need to do this if we're done appending?? */
1932 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1934 cLISTOPo->op_last = last; /* in case check substituted last arg */
1937 return fold_constants(o);
1940 /* List constructors */
1943 append_elem(I32 type, OP *first, OP *last)
1951 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1952 return newLISTOP(type, 0, first, last);
1954 if (first->op_flags & OPf_KIDS)
1955 ((LISTOP*)first)->op_last->op_sibling = last;
1957 first->op_flags |= OPf_KIDS;
1958 ((LISTOP*)first)->op_first = last;
1960 ((LISTOP*)first)->op_last = last;
1961 ((LISTOP*)first)->op_children++;
1966 append_list(I32 type, LISTOP *first, LISTOP *last)
1974 if (first->op_type != type)
1975 return prepend_elem(type, (OP*)first, (OP*)last);
1977 if (last->op_type != type)
1978 return append_elem(type, (OP*)first, (OP*)last);
1980 first->op_last->op_sibling = last->op_first;
1981 first->op_last = last->op_last;
1982 first->op_children += last->op_children;
1983 if (first->op_children)
1984 first->op_flags |= OPf_KIDS;
1991 prepend_elem(I32 type, OP *first, OP *last)
1999 if (last->op_type == type) {
2000 if (type == OP_LIST) { /* already a PUSHMARK there */
2001 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2002 ((LISTOP*)last)->op_first->op_sibling = first;
2005 if (!(last->op_flags & OPf_KIDS)) {
2006 ((LISTOP*)last)->op_last = first;
2007 last->op_flags |= OPf_KIDS;
2009 first->op_sibling = ((LISTOP*)last)->op_first;
2010 ((LISTOP*)last)->op_first = first;
2012 ((LISTOP*)last)->op_children++;
2016 return newLISTOP(type, 0, first, last);
2024 return newOP(OP_STUB, 0);
2030 if (!o || o->op_type != OP_LIST)
2031 o = newLISTOP(OP_LIST, 0, o, Nullop);
2037 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2041 Newz(1101, listop, 1, LISTOP);
2043 listop->op_type = type;
2044 listop->op_ppaddr = PL_ppaddr[type];
2045 listop->op_children = (first != 0) + (last != 0);
2046 listop->op_flags = flags;
2050 else if (!first && last)
2053 first->op_sibling = last;
2054 listop->op_first = first;
2055 listop->op_last = last;
2056 if (type == OP_LIST) {
2058 pushop = newOP(OP_PUSHMARK, 0);
2059 pushop->op_sibling = first;
2060 listop->op_first = pushop;
2061 listop->op_flags |= OPf_KIDS;
2063 listop->op_last = pushop;
2065 else if (listop->op_children)
2066 listop->op_flags |= OPf_KIDS;
2072 newOP(I32 type, I32 flags)
2075 Newz(1101, o, 1, OP);
2077 o->op_ppaddr = PL_ppaddr[type];
2078 o->op_flags = flags;
2081 o->op_private = 0 + (flags >> 8);
2082 if (PL_opargs[type] & OA_RETSCALAR)
2084 if (PL_opargs[type] & OA_TARGET)
2085 o->op_targ = pad_alloc(type, SVs_PADTMP);
2086 return CHECKOP(type, o);
2090 newUNOP(I32 type, I32 flags, OP *first)
2095 first = newOP(OP_STUB, 0);
2096 if (PL_opargs[type] & OA_MARK)
2097 first = force_list(first);
2099 Newz(1101, unop, 1, UNOP);
2100 unop->op_type = type;
2101 unop->op_ppaddr = PL_ppaddr[type];
2102 unop->op_first = first;
2103 unop->op_flags = flags | OPf_KIDS;
2104 unop->op_private = 1 | (flags >> 8);
2105 unop = (UNOP*) CHECKOP(type, unop);
2109 return fold_constants((OP *) unop);
2113 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2116 Newz(1101, binop, 1, BINOP);
2119 first = newOP(OP_NULL, 0);
2121 binop->op_type = type;
2122 binop->op_ppaddr = PL_ppaddr[type];
2123 binop->op_first = first;
2124 binop->op_flags = flags | OPf_KIDS;
2127 binop->op_private = 1 | (flags >> 8);
2130 binop->op_private = 2 | (flags >> 8);
2131 first->op_sibling = last;
2134 binop = (BINOP*)CHECKOP(type, binop);
2138 binop->op_last = binop->op_first->op_sibling;
2140 return fold_constants((OP *)binop);
2144 utf8compare(const void *a, const void *b)
2147 for (i = 0; i < 10; i++) {
2148 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2150 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2157 pmtrans(OP *o, OP *expr, OP *repl)
2159 SV *tstr = ((SVOP*)expr)->op_sv;
2160 SV *rstr = ((SVOP*)repl)->op_sv;
2163 register U8 *t = (U8*)SvPV(tstr, tlen);
2164 register U8 *r = (U8*)SvPV(rstr, rlen);
2170 register short *tbl;
2172 complement = o->op_private & OPpTRANS_COMPLEMENT;
2173 del = o->op_private & OPpTRANS_DELETE;
2174 squash = o->op_private & OPpTRANS_SQUASH;
2176 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2177 SV* listsv = newSVpv("# comment\n",0);
2179 U8* tend = t + tlen;
2180 U8* rend = r + rlen;
2196 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2197 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2203 New(1109, cp, tlen, U8*);
2205 transv = newSVpv("",0);
2214 qsort(cp, i, sizeof(U8*), utf8compare);
2215 for (j = 0; j < i; j++) {
2217 UV val = utf8_to_uv(s, &ulen);
2219 diff = val - nextmin;
2221 t = uv_to_utf8(tmpbuf,nextmin);
2222 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2224 t = uv_to_utf8(tmpbuf, val - 1);
2225 sv_catpvn(transv, "\377", 1);
2226 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2230 val = utf8_to_uv(s+1, &ulen);
2234 t = uv_to_utf8(tmpbuf,nextmin);
2235 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2236 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2237 sv_catpvn(transv, "\377", 1);
2238 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2239 t = (U8*)SvPVX(transv);
2240 tlen = SvCUR(transv);
2243 else if (!rlen && !del) {
2244 r = t; rlen = tlen; rend = tend;
2247 if (to_utf && from_utf) { /* only counting characters */
2248 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2249 o->op_private |= OPpTRANS_IDENTICAL;
2251 else { /* straight latin-1 translation */
2252 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2253 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2254 o->op_private |= OPpTRANS_IDENTICAL;
2258 while (t < tend || tfirst <= tlast) {
2259 /* see if we need more "t" chars */
2260 if (tfirst > tlast) {
2261 tfirst = (I32)utf8_to_uv(t, &ulen);
2263 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2264 tlast = (I32)utf8_to_uv(++t, &ulen);
2271 /* now see if we need more "r" chars */
2272 if (rfirst > rlast) {
2274 rfirst = (I32)utf8_to_uv(r, &ulen);
2276 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2277 rlast = (I32)utf8_to_uv(++r, &ulen);
2286 rfirst = rlast = 0xffffffff;
2290 /* now see which range will peter our first, if either. */
2291 tdiff = tlast - tfirst;
2292 rdiff = rlast - rfirst;
2299 if (rfirst == 0xffffffff) {
2300 diff = tdiff; /* oops, pretend rdiff is infinite */
2302 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2304 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2308 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2310 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2312 if (rfirst + diff > max)
2313 max = rfirst + diff;
2318 else if (rfirst <= 0x800)
2319 grows |= (tfirst < 0x80);
2320 else if (rfirst <= 0x10000)
2321 grows |= (tfirst < 0x800);
2322 else if (rfirst <= 0x200000)
2323 grows |= (tfirst < 0x10000);
2324 else if (rfirst <= 0x4000000)
2325 grows |= (tfirst < 0x200000);
2326 else if (rfirst <= 0x80000000)
2327 grows |= (tfirst < 0x4000000);
2339 else if (max > 0xff)
2344 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2345 SvREFCNT_dec(listsv);
2347 SvREFCNT_dec(transv);
2349 if (!del && havefinal)
2350 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2352 if (grows && to_utf)
2353 o->op_private |= OPpTRANS_GROWS;
2360 tbl = (short*)cPVOPo->op_pv;
2362 Zero(tbl, 256, short);
2363 for (i = 0; i < tlen; i++)
2365 for (i = 0, j = 0; i < 256; i++) {
2381 if (!rlen && !del) {
2384 o->op_private |= OPpTRANS_IDENTICAL;
2386 for (i = 0; i < 256; i++)
2388 for (i = 0, j = 0; i < tlen; i++,j++) {
2391 if (tbl[t[i]] == -1)
2397 if (tbl[t[i]] == -1)
2408 newPMOP(I32 type, I32 flags)
2413 Newz(1101, pmop, 1, PMOP);
2414 pmop->op_type = type;
2415 pmop->op_ppaddr = PL_ppaddr[type];
2416 pmop->op_flags = flags;
2417 pmop->op_private = 0 | (flags >> 8);
2419 if (PL_hints & HINT_RE_TAINT)
2420 pmop->op_pmpermflags |= PMf_RETAINT;
2421 if (PL_hints & HINT_LOCALE)
2422 pmop->op_pmpermflags |= PMf_LOCALE;
2423 pmop->op_pmflags = pmop->op_pmpermflags;
2425 /* link into pm list */
2426 if (type != OP_TRANS && PL_curstash) {
2427 pmop->op_pmnext = HvPMROOT(PL_curstash);
2428 HvPMROOT(PL_curstash) = pmop;
2435 pmruntime(OP *o, OP *expr, OP *repl)
2440 I32 repl_has_vars = 0;
2442 if (o->op_type == OP_TRANS)
2443 return pmtrans(o, expr, repl);
2445 PL_hints |= HINT_BLOCK_SCOPE;
2448 if (expr->op_type == OP_CONST) {
2450 SV *pat = ((SVOP*)expr)->op_sv;
2451 char *p = SvPV(pat, plen);
2452 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2453 sv_setpvn(pat, "\\s+", 3);
2454 p = SvPV(pat, plen);
2455 pm->op_pmflags |= PMf_SKIPWHITE;
2457 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2458 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2459 pm->op_pmflags |= PMf_WHITE;
2463 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2464 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2466 : OP_REGCMAYBE),0,expr);
2468 Newz(1101, rcop, 1, LOGOP);
2469 rcop->op_type = OP_REGCOMP;
2470 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2471 rcop->op_first = scalar(expr);
2472 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2473 ? (OPf_SPECIAL | OPf_KIDS)
2475 rcop->op_private = 1;
2478 /* establish postfix order */
2479 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2481 rcop->op_next = expr;
2482 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2485 rcop->op_next = LINKLIST(expr);
2486 expr->op_next = (OP*)rcop;
2489 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2494 if (pm->op_pmflags & PMf_EVAL)
2497 else if (repl->op_type == OP_THREADSV
2498 && strchr("&`'123456789+",
2499 PL_threadsv_names[repl->op_targ]))
2503 #endif /* USE_THREADS */
2504 else if (repl->op_type == OP_CONST)
2508 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2509 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2511 if (curop->op_type == OP_THREADSV) {
2513 if (strchr("&`'123456789+", curop->op_private))
2517 if (curop->op_type == OP_GV) {
2518 GV *gv = ((GVOP*)curop)->op_gv;
2520 if (strchr("&`'123456789+", *GvENAME(gv)))
2523 #endif /* USE_THREADS */
2524 else if (curop->op_type == OP_RV2CV)
2526 else if (curop->op_type == OP_RV2SV ||
2527 curop->op_type == OP_RV2AV ||
2528 curop->op_type == OP_RV2HV ||
2529 curop->op_type == OP_RV2GV) {
2530 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2533 else if (curop->op_type == OP_PADSV ||
2534 curop->op_type == OP_PADAV ||
2535 curop->op_type == OP_PADHV ||
2536 curop->op_type == OP_PADANY) {
2539 else if (curop->op_type == OP_PUSHRE)
2540 ; /* Okay here, dangerous in newASSIGNOP */
2549 && (!pm->op_pmregexp
2550 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2551 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2552 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2553 prepend_elem(o->op_type, scalar(repl), o);
2556 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2557 pm->op_pmflags |= PMf_MAYBE_CONST;
2558 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2560 Newz(1101, rcop, 1, LOGOP);
2561 rcop->op_type = OP_SUBSTCONT;
2562 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2563 rcop->op_first = scalar(repl);
2564 rcop->op_flags |= OPf_KIDS;
2565 rcop->op_private = 1;
2568 /* establish postfix order */
2569 rcop->op_next = LINKLIST(repl);
2570 repl->op_next = (OP*)rcop;
2572 pm->op_pmreplroot = scalar((OP*)rcop);
2573 pm->op_pmreplstart = LINKLIST(rcop);
2582 newSVOP(I32 type, I32 flags, SV *sv)
2585 Newz(1101, svop, 1, SVOP);
2586 svop->op_type = type;
2587 svop->op_ppaddr = PL_ppaddr[type];
2589 svop->op_next = (OP*)svop;
2590 svop->op_flags = flags;
2591 if (PL_opargs[type] & OA_RETSCALAR)
2593 if (PL_opargs[type] & OA_TARGET)
2594 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2595 return CHECKOP(type, svop);
2599 newGVOP(I32 type, I32 flags, GV *gv)
2603 Newz(1101, gvop, 1, GVOP);
2604 gvop->op_type = type;
2605 gvop->op_ppaddr = PL_ppaddr[type];
2606 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2607 gvop->op_next = (OP*)gvop;
2608 gvop->op_flags = flags;
2609 if (PL_opargs[type] & OA_RETSCALAR)
2611 if (PL_opargs[type] & OA_TARGET)
2612 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2613 return CHECKOP(type, gvop);
2617 newPVOP(I32 type, I32 flags, char *pv)
2620 Newz(1101, pvop, 1, PVOP);
2621 pvop->op_type = type;
2622 pvop->op_ppaddr = PL_ppaddr[type];
2624 pvop->op_next = (OP*)pvop;
2625 pvop->op_flags = flags;
2626 if (PL_opargs[type] & OA_RETSCALAR)
2628 if (PL_opargs[type] & OA_TARGET)
2629 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2630 return CHECKOP(type, pvop);
2639 save_hptr(&PL_curstash);
2640 save_item(PL_curstname);
2645 name = SvPV(sv, len);
2646 PL_curstash = gv_stashpvn(name,len,TRUE);
2647 sv_setpvn(PL_curstname, name, len);
2651 sv_setpv(PL_curstname,"<none>");
2652 PL_curstash = Nullhv;
2654 PL_hints |= HINT_BLOCK_SCOPE;
2655 PL_copline = NOLINE;
2660 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2669 if (id->op_type != OP_CONST)
2670 croak("Module name must be constant");
2674 if(version != Nullop) {
2675 SV *vesv = ((SVOP*)version)->op_sv;
2677 if (arg == Nullop && !SvNIOK(vesv)) {
2684 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2685 croak("Version number must be constant number");
2687 /* Make copy of id so we don't free it twice */
2688 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2690 /* Fake up a method call to VERSION */
2691 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2692 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2693 append_elem(OP_LIST,
2694 prepend_elem(OP_LIST, pack, list(version)),
2695 newUNOP(OP_METHOD, 0, meth)));
2699 /* Fake up an import/unimport */
2700 if (arg && arg->op_type == OP_STUB)
2701 imop = arg; /* no import on explicit () */
2702 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2703 imop = Nullop; /* use 5.0; */
2706 /* Make copy of id so we don't free it twice */
2707 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2708 meth = newSVOP(OP_CONST, 0,
2710 ? newSVpv("import", 6)
2711 : newSVpv("unimport", 8)
2713 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2714 append_elem(OP_LIST,
2715 prepend_elem(OP_LIST, pack, list(arg)),
2716 newUNOP(OP_METHOD, 0, meth)));
2719 /* Fake up a require, handle override, if any */
2720 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2721 if (!(gv && GvIMPORTED_CV(gv)))
2722 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2724 if (gv && GvIMPORTED_CV(gv)) {
2725 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2726 append_elem(OP_LIST, id,
2727 scalar(newUNOP(OP_RV2CV, 0,
2732 rqop = newUNOP(OP_REQUIRE, 0, id);
2735 /* Fake up the BEGIN {}, which does its thing immediately. */
2737 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2739 append_elem(OP_LINESEQ,
2740 append_elem(OP_LINESEQ,
2741 newSTATEOP(0, Nullch, rqop),
2742 newSTATEOP(0, Nullch, veop)),
2743 newSTATEOP(0, Nullch, imop) ));
2745 PL_copline = NOLINE;
2755 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2756 if (!(gv && GvIMPORTED_CV(gv)))
2757 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2759 if (gv && GvIMPORTED_CV(gv)) {
2760 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2761 append_elem(OP_LIST, term,
2762 scalar(newUNOP(OP_RV2CV, 0,
2767 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2773 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2775 return newBINOP(OP_LSLICE, flags,
2776 list(force_list(subscript)),
2777 list(force_list(listval)) );
2781 list_assignment(register OP *o)
2786 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2787 o = cUNOPo->op_first;
2789 if (o->op_type == OP_COND_EXPR) {
2790 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2791 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2796 yyerror("Assignment to both a list and a scalar");
2800 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2801 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2802 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2805 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2808 if (o->op_type == OP_RV2SV)
2815 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2820 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2821 return newLOGOP(optype, 0,
2822 mod(scalar(left), optype),
2823 newUNOP(OP_SASSIGN, 0, scalar(right)));
2826 return newBINOP(optype, OPf_STACKED,
2827 mod(scalar(left), optype), scalar(right));
2831 if (list_assignment(left)) {
2834 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2835 left = mod(left, OP_AASSIGN);
2843 o = newBINOP(OP_AASSIGN, flags,
2844 list(force_list(right)),
2845 list(force_list(left)) );
2846 o->op_private = 0 | (flags >> 8);
2847 if (!(left->op_private & OPpLVAL_INTRO)) {
2851 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2852 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2853 if (curop->op_type == OP_GV) {
2854 GV *gv = ((GVOP*)curop)->op_gv;
2855 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2857 SvCUR(gv) = PL_generation;
2859 else if (curop->op_type == OP_PADSV ||
2860 curop->op_type == OP_PADAV ||
2861 curop->op_type == OP_PADHV ||
2862 curop->op_type == OP_PADANY) {
2863 SV **svp = AvARRAY(PL_comppad_name);
2864 SV *sv = svp[curop->op_targ];
2865 if (SvCUR(sv) == PL_generation)
2867 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2869 else if (curop->op_type == OP_RV2CV)
2871 else if (curop->op_type == OP_RV2SV ||
2872 curop->op_type == OP_RV2AV ||
2873 curop->op_type == OP_RV2HV ||
2874 curop->op_type == OP_RV2GV) {
2875 if (lastop->op_type != OP_GV) /* funny deref? */
2878 else if (curop->op_type == OP_PUSHRE) {
2879 if (((PMOP*)curop)->op_pmreplroot) {
2880 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2881 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2883 SvCUR(gv) = PL_generation;
2892 o->op_private = OPpASSIGN_COMMON;
2894 if (right && right->op_type == OP_SPLIT) {
2896 if ((tmpop = ((LISTOP*)right)->op_first) &&
2897 tmpop->op_type == OP_PUSHRE)
2899 PMOP *pm = (PMOP*)tmpop;
2900 if (left->op_type == OP_RV2AV &&
2901 !(left->op_private & OPpLVAL_INTRO) &&
2902 !(o->op_private & OPpASSIGN_COMMON) )
2904 tmpop = ((UNOP*)left)->op_first;
2905 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2906 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2907 pm->op_pmflags |= PMf_ONCE;
2908 tmpop = cUNOPo->op_first; /* to list (nulled) */
2909 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2910 tmpop->op_sibling = Nullop; /* don't free split */
2911 right->op_next = tmpop->op_next; /* fix starting loc */
2912 op_free(o); /* blow off assign */
2913 right->op_flags &= ~OPf_WANT;
2914 /* "I don't know and I don't care." */
2919 if (PL_modcount < 10000 &&
2920 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2922 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2924 sv_setiv(sv, PL_modcount+1);
2932 right = newOP(OP_UNDEF, 0);
2933 if (right->op_type == OP_READLINE) {
2934 right->op_flags |= OPf_STACKED;
2935 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2938 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2939 o = newBINOP(OP_SASSIGN, flags,
2940 scalar(right), mod(scalar(left), OP_SASSIGN) );
2952 newSTATEOP(I32 flags, char *label, OP *o)
2955 U32 seq = intro_my();
2958 Newz(1101, cop, 1, COP);
2959 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2960 cop->op_type = OP_DBSTATE;
2961 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2964 cop->op_type = OP_NEXTSTATE;
2965 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2967 cop->op_flags = flags;
2968 cop->op_private = (PL_hints & HINT_UTF8);
2970 cop->op_private |= NATIVE_HINTS;
2972 PL_compiling.op_private = cop->op_private;
2973 cop->op_next = (OP*)cop;
2976 cop->cop_label = label;
2977 PL_hints |= HINT_BLOCK_SCOPE;
2980 cop->cop_arybase = PL_curcop->cop_arybase;
2981 if (PL_curcop->cop_warnings == WARN_NONE
2982 || PL_curcop->cop_warnings == WARN_ALL)
2983 cop->cop_warnings = PL_curcop->cop_warnings ;
2985 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2988 if (PL_copline == NOLINE)
2989 cop->cop_line = PL_curcop->cop_line;
2991 cop->cop_line = PL_copline;
2992 PL_copline = NOLINE;
2994 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2995 cop->cop_stash = PL_curstash;
2997 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2998 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2999 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3000 (void)SvIOK_on(*svp);
3002 SvSTASH(*svp) = (HV*)cop;
3006 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3009 /* "Introduce" my variables to visible status. */
3017 if (! PL_min_intro_pending)
3018 return PL_cop_seqmax;
3020 svp = AvARRAY(PL_comppad_name);
3021 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3022 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3023 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3024 SvNVX(sv) = (double)PL_cop_seqmax;
3027 PL_min_intro_pending = 0;
3028 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3029 return PL_cop_seqmax++;
3033 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3035 return new_logop(type, flags, &first, &other);
3039 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3044 OP *first = *firstp;
3045 OP *other = *otherp;
3047 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3048 return newBINOP(type, flags, scalar(first), scalar(other));
3050 scalarboolean(first);
3051 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3052 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3053 if (type == OP_AND || type == OP_OR) {
3059 first = *firstp = cUNOPo->op_first;
3061 first->op_next = o->op_next;
3062 cUNOPo->op_first = Nullop;
3066 if (first->op_type == OP_CONST) {
3067 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3068 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3070 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3081 else if (first->op_type == OP_WANTARRAY) {
3087 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3088 OP *k1 = ((UNOP*)first)->op_first;
3089 OP *k2 = k1->op_sibling;
3091 switch (first->op_type)
3094 if (k2 && k2->op_type == OP_READLINE
3095 && (k2->op_flags & OPf_STACKED)
3096 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3097 warnop = k2->op_type;
3101 if (k1->op_type == OP_READDIR
3102 || k1->op_type == OP_GLOB
3103 || k1->op_type == OP_EACH)
3104 warnop = k1->op_type;
3108 line_t oldline = PL_curcop->cop_line;
3109 PL_curcop->cop_line = PL_copline;
3111 "Value of %s%s can be \"0\"; test with defined()",
3113 ((warnop == OP_READLINE || warnop == OP_GLOB)
3114 ? " construct" : "() operator"));
3115 PL_curcop->cop_line = oldline;
3122 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3123 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3125 Newz(1101, logop, 1, LOGOP);
3127 logop->op_type = type;
3128 logop->op_ppaddr = PL_ppaddr[type];
3129 logop->op_first = first;
3130 logop->op_flags = flags | OPf_KIDS;
3131 logop->op_other = LINKLIST(other);
3132 logop->op_private = 1 | (flags >> 8);
3134 /* establish postfix order */
3135 logop->op_next = LINKLIST(first);
3136 first->op_next = (OP*)logop;
3137 first->op_sibling = other;
3139 o = newUNOP(OP_NULL, 0, (OP*)logop);
3146 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3153 return newLOGOP(OP_AND, 0, first, trueop);
3155 return newLOGOP(OP_OR, 0, first, falseop);
3157 scalarboolean(first);
3158 if (first->op_type == OP_CONST) {
3159 if (SvTRUE(((SVOP*)first)->op_sv)) {
3170 else if (first->op_type == OP_WANTARRAY) {
3174 Newz(1101, condop, 1, CONDOP);
3176 condop->op_type = OP_COND_EXPR;
3177 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3178 condop->op_first = first;
3179 condop->op_flags = flags | OPf_KIDS;
3180 condop->op_true = LINKLIST(trueop);
3181 condop->op_false = LINKLIST(falseop);
3182 condop->op_private = 1 | (flags >> 8);
3184 /* establish postfix order */
3185 condop->op_next = LINKLIST(first);
3186 first->op_next = (OP*)condop;
3188 first->op_sibling = trueop;
3189 trueop->op_sibling = falseop;
3190 o = newUNOP(OP_NULL, 0, (OP*)condop);
3192 trueop->op_next = o;
3193 falseop->op_next = o;
3199 newRANGE(I32 flags, OP *left, OP *right)
3207 Newz(1101, condop, 1, CONDOP);
3209 condop->op_type = OP_RANGE;
3210 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3211 condop->op_first = left;
3212 condop->op_flags = OPf_KIDS;
3213 condop->op_true = LINKLIST(left);
3214 condop->op_false = LINKLIST(right);
3215 condop->op_private = 1 | (flags >> 8);
3217 left->op_sibling = right;
3219 condop->op_next = (OP*)condop;
3220 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3221 flop = newUNOP(OP_FLOP, 0, flip);
3222 o = newUNOP(OP_NULL, 0, flop);
3225 left->op_next = flip;
3226 right->op_next = flop;
3228 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3229 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3230 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3231 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3233 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3234 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3237 if (!flip->op_private || !flop->op_private)
3238 linklist(o); /* blow off optimizer unless constant */
3244 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3249 int once = block && block->op_flags & OPf_SPECIAL &&
3250 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3253 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3254 return block; /* do {} while 0 does once */
3255 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3256 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3257 expr = newUNOP(OP_DEFINED, 0,
3258 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3259 } else if (expr->op_flags & OPf_KIDS) {
3260 OP *k1 = ((UNOP*)expr)->op_first;
3261 OP *k2 = (k1) ? k1->op_sibling : NULL;
3262 switch (expr->op_type) {
3264 if (k2 && k2->op_type == OP_READLINE
3265 && (k2->op_flags & OPf_STACKED)
3266 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3267 expr = newUNOP(OP_DEFINED, 0, expr);
3271 if (k1->op_type == OP_READDIR
3272 || k1->op_type == OP_GLOB
3273 || k1->op_type == OP_EACH)
3274 expr = newUNOP(OP_DEFINED, 0, expr);
3280 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3281 o = new_logop(OP_AND, 0, &expr, &listop);
3284 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3286 if (once && o != listop)
3287 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3290 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3292 o->op_flags |= flags;
3294 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3299 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3308 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3309 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3310 expr = newUNOP(OP_DEFINED, 0,
3311 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3312 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3313 OP *k1 = ((UNOP*)expr)->op_first;
3314 OP *k2 = (k1) ? k1->op_sibling : NULL;
3315 switch (expr->op_type) {
3317 if (k2 && k2->op_type == OP_READLINE
3318 && (k2->op_flags & OPf_STACKED)
3319 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3320 expr = newUNOP(OP_DEFINED, 0, expr);
3324 if (k1->op_type == OP_READDIR
3325 || k1->op_type == OP_GLOB
3326 || k1->op_type == OP_EACH)
3327 expr = newUNOP(OP_DEFINED, 0, expr);
3333 block = newOP(OP_NULL, 0);
3336 next = LINKLIST(cont);
3338 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3339 if ((line_t)whileline != NOLINE) {
3340 PL_copline = whileline;
3341 cont = append_elem(OP_LINESEQ, cont,
3342 newSTATEOP(0, Nullch, Nullop));
3346 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3347 redo = LINKLIST(listop);
3350 PL_copline = whileline;
3352 o = new_logop(OP_AND, 0, &expr, &listop);
3353 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3354 op_free(expr); /* oops, it's a while (0) */
3356 return Nullop; /* listop already freed by new_logop */
3359 ((LISTOP*)listop)->op_last->op_next = condop =
3360 (o == listop ? redo : LINKLIST(o));
3368 Newz(1101,loop,1,LOOP);
3369 loop->op_type = OP_ENTERLOOP;
3370 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3371 loop->op_private = 0;
3372 loop->op_next = (OP*)loop;
3375 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3377 loop->op_redoop = redo;
3378 loop->op_lastop = o;
3381 loop->op_nextop = next;
3383 loop->op_nextop = o;
3385 o->op_flags |= flags;
3386 o->op_private |= (flags >> 8);
3391 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3399 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3400 sv->op_type = OP_RV2GV;
3401 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3403 else if (sv->op_type == OP_PADSV) { /* private variable */
3404 padoff = sv->op_targ;
3408 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3409 padoff = sv->op_targ;
3410 iterflags |= OPf_SPECIAL;
3415 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3419 padoff = find_threadsv("_");
3420 iterflags |= OPf_SPECIAL;
3422 sv = newGVOP(OP_GV, 0, PL_defgv);
3425 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3426 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3427 iterflags |= OPf_STACKED;
3429 else if (expr->op_type == OP_NULL &&
3430 (expr->op_flags & OPf_KIDS) &&
3431 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3433 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3434 * set the STACKED flag to indicate that these values are to be
3435 * treated as min/max values by 'pp_iterinit'.
3437 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3438 CONDOP* range = (CONDOP*) flip->op_first;
3439 OP* left = range->op_first;
3440 OP* right = left->op_sibling;
3443 range->op_flags &= ~OPf_KIDS;
3444 range->op_first = Nullop;
3446 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3447 listop->op_first->op_next = range->op_true;
3448 left->op_next = range->op_false;
3449 right->op_next = (OP*)listop;
3450 listop->op_next = listop->op_first;
3453 expr = (OP*)(listop);
3455 iterflags |= OPf_STACKED;
3458 expr = mod(force_list(expr), OP_GREPSTART);
3462 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3463 append_elem(OP_LIST, expr, scalar(sv))));
3464 assert(!loop->op_next);
3465 Renew(loop, 1, LOOP);
3466 loop->op_targ = padoff;
3467 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3468 PL_copline = forline;
3469 return newSTATEOP(0, label, wop);
3473 newLOOPEX(I32 type, OP *label)
3479 if (type != OP_GOTO || label->op_type == OP_CONST) {
3480 /* "last()" means "last" */
3481 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3482 o = newOP(type, OPf_SPECIAL);
3484 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3485 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3491 if (label->op_type == OP_ENTERSUB)
3492 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3493 o = newUNOP(type, OPf_STACKED, label);
3495 PL_hints |= HINT_BLOCK_SCOPE;
3505 MUTEX_DESTROY(CvMUTEXP(cv));
3506 Safefree(CvMUTEXP(cv));
3509 #endif /* USE_THREADS */
3511 if (!CvXSUB(cv) && CvROOT(cv)) {
3513 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3514 croak("Can't undef active subroutine");
3517 croak("Can't undef active subroutine");
3518 #endif /* USE_THREADS */
3521 SAVESPTR(PL_curpad);
3525 op_free(CvROOT(cv));
3526 CvROOT(cv) = Nullop;
3529 SvPOK_off((SV*)cv); /* forget prototype */
3531 SvREFCNT_dec(CvGV(cv));
3533 SvREFCNT_dec(CvOUTSIDE(cv));
3534 CvOUTSIDE(cv) = Nullcv;
3535 if (CvPADLIST(cv)) {
3536 /* may be during global destruction */
3537 if (SvREFCNT(CvPADLIST(cv))) {
3538 I32 i = AvFILLp(CvPADLIST(cv));
3540 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3541 SV* sv = svp ? *svp : Nullsv;
3544 if (sv == (SV*)PL_comppad_name)
3545 PL_comppad_name = Nullav;
3546 else if (sv == (SV*)PL_comppad) {
3547 PL_comppad = Nullav;
3548 PL_curpad = Null(SV**);
3552 SvREFCNT_dec((SV*)CvPADLIST(cv));
3554 CvPADLIST(cv) = Nullav;
3558 #ifdef DEBUG_CLOSURES
3563 CV *outside = CvOUTSIDE(cv);
3564 AV* padlist = CvPADLIST(cv);
3571 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3573 (CvANON(cv) ? "ANON"
3574 : (cv == PL_main_cv) ? "MAIN"
3575 : CvUNIQUE(cv) ? "UNIQUE"
3576 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3579 : CvANON(outside) ? "ANON"
3580 : (outside == PL_main_cv) ? "MAIN"
3581 : CvUNIQUE(outside) ? "UNIQUE"
3582 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3587 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3588 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3589 pname = AvARRAY(pad_name);
3590 ppad = AvARRAY(pad);
3592 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3593 if (SvPOK(pname[ix]))
3594 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3596 SvFAKE(pname[ix]) ? "FAKE " : "",
3598 (long)I_32(SvNVX(pname[ix])),
3599 (long)SvIVX(pname[ix]));
3602 #endif /* DEBUG_CLOSURES */
3605 cv_clone2(CV *proto, CV *outside)
3610 AV* protopadlist = CvPADLIST(proto);
3611 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3612 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3613 SV** pname = AvARRAY(protopad_name);
3614 SV** ppad = AvARRAY(protopad);
3615 I32 fname = AvFILLp(protopad_name);
3616 I32 fpad = AvFILLp(protopad);
3620 assert(!CvUNIQUE(proto));
3623 SAVESPTR(PL_curpad);
3624 SAVESPTR(PL_comppad);
3625 SAVESPTR(PL_comppad_name);
3626 SAVESPTR(PL_compcv);
3628 cv = PL_compcv = (CV*)NEWSV(1104,0);
3629 sv_upgrade((SV *)cv, SvTYPE(proto));
3635 New(666, CvMUTEXP(cv), 1, perl_mutex);
3636 MUTEX_INIT(CvMUTEXP(cv));
3638 #endif /* USE_THREADS */
3639 CvFILEGV(cv) = CvFILEGV(proto);
3640 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3641 CvSTASH(cv) = CvSTASH(proto);
3642 CvROOT(cv) = CvROOT(proto);
3643 CvSTART(cv) = CvSTART(proto);
3645 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3648 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3650 PL_comppad_name = newAV();
3651 for (ix = fname; ix >= 0; ix--)
3652 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3654 PL_comppad = newAV();
3656 comppadlist = newAV();
3657 AvREAL_off(comppadlist);
3658 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3659 av_store(comppadlist, 1, (SV*)PL_comppad);
3660 CvPADLIST(cv) = comppadlist;
3661 av_fill(PL_comppad, AvFILLp(protopad));
3662 PL_curpad = AvARRAY(PL_comppad);
3664 av = newAV(); /* will be @_ */
3666 av_store(PL_comppad, 0, (SV*)av);
3667 AvFLAGS(av) = AVf_REIFY;
3669 for (ix = fpad; ix > 0; ix--) {
3670 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3671 if (namesv && namesv != &PL_sv_undef) {
3672 char *name = SvPVX(namesv); /* XXX */
3673 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3674 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3675 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3677 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3679 croak("panic: cv_clone: %s", name);
3681 else { /* our own lexical */
3684 /* anon code -- we'll come back for it */
3685 sv = SvREFCNT_inc(ppad[ix]);
3687 else if (*name == '@')
3689 else if (*name == '%')
3699 SV* sv = NEWSV(0,0);
3705 /* Now that vars are all in place, clone nested closures. */
3707 for (ix = fpad; ix > 0; ix--) {
3708 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3710 && namesv != &PL_sv_undef
3711 && !(SvFLAGS(namesv) & SVf_FAKE)
3712 && *SvPVX(namesv) == '&'
3713 && CvCLONE(ppad[ix]))
3715 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3716 SvREFCNT_dec(ppad[ix]);
3719 PL_curpad[ix] = (SV*)kid;
3723 #ifdef DEBUG_CLOSURES
3724 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3726 PerlIO_printf(Perl_debug_log, " from:\n");
3728 PerlIO_printf(Perl_debug_log, " to:\n");
3740 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3741 cv = cv_clone2(proto, CvOUTSIDE(proto));
3742 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3747 cv_ckproto(CV *cv, GV *gv, char *p)
3749 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3750 SV* msg = sv_newmortal();
3754 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3755 sv_setpv(msg, "Prototype mismatch:");
3757 sv_catpvf(msg, " sub %_", name);
3759 sv_catpvf(msg, " (%s)", SvPVX(cv));
3760 sv_catpv(msg, " vs ");
3762 sv_catpvf(msg, "(%s)", p);
3764 sv_catpv(msg, "none");
3772 if (!cv || !SvPOK(cv) || SvCUR(cv))
3774 return op_const_sv(CvSTART(cv), cv);
3778 op_const_sv(OP *o, CV *cv)
3785 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3786 o = cLISTOPo->op_first->op_sibling;
3788 for (; o; o = o->op_next) {
3789 OPCODE type = o->op_type;
3791 if(sv && o->op_next == o)
3793 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3795 if (type == OP_LEAVESUB || type == OP_RETURN)
3799 if (type == OP_CONST)
3801 else if (type == OP_PADSV && cv) {
3802 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3803 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3804 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3816 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3820 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3821 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3822 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3823 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3832 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3833 maximum a prototype before. */
3834 if (SvTYPE(gv) > SVt_NULL) {
3835 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3836 warn("Runaway prototype");
3837 cv_ckproto((CV*)gv, NULL, ps);
3840 sv_setpv((SV*)gv, ps);
3842 sv_setiv((SV*)gv, -1);
3843 SvREFCNT_dec(PL_compcv);
3844 cv = PL_compcv = NULL;
3845 PL_sub_generation++;
3849 if (!name || GvCVGEN(gv))
3851 else if (cv = GvCV(gv)) {
3852 cv_ckproto(cv, gv, ps);
3853 /* already defined (or promised)? */
3854 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3856 bool const_changed = TRUE;
3858 /* just a "sub foo;" when &foo is already defined */
3859 SAVEFREESV(PL_compcv);
3862 /* ahem, death to those who redefine active sort subs */
3863 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3864 croak("Can't redefine active sort subroutine %s", name);
3865 if(const_sv = cv_const_sv(cv))
3866 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3867 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3868 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3869 && HvNAME(GvSTASH(CvGV(cv)))
3870 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3872 line_t oldline = PL_curcop->cop_line;
3873 PL_curcop->cop_line = PL_copline;
3874 warner(WARN_REDEFINE,
3875 const_sv ? "Constant subroutine %s redefined"
3876 : "Subroutine %s redefined", name);
3877 PL_curcop->cop_line = oldline;
3883 if (cv) { /* must reuse cv if autoloaded */
3885 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3886 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3887 CvOUTSIDE(PL_compcv) = 0;
3888 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3889 CvPADLIST(PL_compcv) = 0;
3890 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3891 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3892 SvREFCNT_dec(PL_compcv);
3899 PL_sub_generation++;
3902 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3903 CvFILEGV(cv) = PL_curcop->cop_filegv;
3904 CvSTASH(cv) = PL_curstash;
3907 if (!CvMUTEXP(cv)) {
3908 New(666, CvMUTEXP(cv), 1, perl_mutex);
3909 MUTEX_INIT(CvMUTEXP(cv));
3911 #endif /* USE_THREADS */
3914 sv_setpv((SV*)cv, ps);
3916 if (PL_error_count) {
3920 char *s = strrchr(name, ':');
3922 if (strEQ(s, "BEGIN")) {
3924 "BEGIN not safe after errors--compilation aborted";
3928 /* force display of errors found but not reported */
3929 sv_catpv(ERRSV, not_safe);
3930 croak("%s", SvPVx(ERRSV, n_a));
3937 PL_copline = NOLINE;
3942 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3943 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3946 SV **namep = AvARRAY(PL_comppad_name);
3947 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3950 if (SvIMMORTAL(PL_curpad[ix]))
3953 * The only things that a clonable function needs in its
3954 * pad are references to outer lexicals and anonymous subs.
3955 * The rest are created anew during cloning.
3957 if (!((namesv = namep[ix]) != Nullsv &&
3958 namesv != &PL_sv_undef &&
3960 *SvPVX(namesv) == '&')))
3962 SvREFCNT_dec(PL_curpad[ix]);
3963 PL_curpad[ix] = Nullsv;
3968 AV *av = newAV(); /* Will be @_ */
3970 av_store(PL_comppad, 0, (SV*)av);
3971 AvFLAGS(av) = AVf_REIFY;
3973 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3974 if (SvIMMORTAL(PL_curpad[ix]))
3976 if (!SvPADMY(PL_curpad[ix]))
3977 SvPADTMP_on(PL_curpad[ix]);
3981 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3982 CvSTART(cv) = LINKLIST(CvROOT(cv));
3983 CvROOT(cv)->op_next = 0;
3989 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3990 SV *sv = NEWSV(0,0);
3991 SV *tmpstr = sv_newmortal();
3992 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3996 sv_setpvf(sv, "%_:%ld-%ld",
3997 GvSV(PL_curcop->cop_filegv),
3998 (long)PL_subline, (long)PL_curcop->cop_line);
3999 gv_efullname3(tmpstr, gv, Nullch);
4000 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4001 hv = GvHVn(db_postponed);
4002 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4003 && (cv = GvCV(db_postponed))) {
4008 perl_call_sv((SV*)cv, G_DISCARD);
4012 if ((s = strrchr(name,':')))
4016 if (strEQ(s, "BEGIN")) {
4017 I32 oldscope = PL_scopestack_ix;
4019 SAVESPTR(PL_compiling.cop_filegv);
4020 SAVEI16(PL_compiling.cop_line);
4022 sv_setsv(PL_rs, PL_nrs);
4025 PL_beginav = newAV();
4026 DEBUG_x( dump_sub(gv) );
4027 av_push(PL_beginav, (SV *)cv);
4029 call_list(oldscope, PL_beginav);
4031 PL_curcop = &PL_compiling;
4032 PL_compiling.op_private = PL_hints;
4035 else if (strEQ(s, "END") && !PL_error_count) {
4038 av_unshift(PL_endav, 1);
4039 av_store(PL_endav, 0, (SV *)cv);
4042 else if (strEQ(s, "INIT") && !PL_error_count) {
4044 PL_initav = newAV();
4045 av_push(PL_initav, SvREFCNT_inc(cv));
4051 PL_copline = NOLINE;
4056 /* XXX unsafe for threads if eval_owner isn't held */
4058 newCONSTSUB(HV *stash, char *name, SV *sv)
4061 U32 oldhints = PL_hints;
4062 HV *old_cop_stash = PL_curcop->cop_stash;
4063 HV *old_curstash = PL_curstash;
4064 line_t oldline = PL_curcop->cop_line;
4065 PL_curcop->cop_line = PL_copline;
4067 PL_hints &= ~HINT_BLOCK_SCOPE;
4069 PL_curstash = PL_curcop->cop_stash = stash;
4072 start_subparse(FALSE, 0),
4073 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4074 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4075 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4078 PL_hints = oldhints;
4079 PL_curcop->cop_stash = old_cop_stash;
4080 PL_curstash = old_curstash;
4081 PL_curcop->cop_line = oldline;
4085 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4088 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4091 if (cv = (name ? GvCV(gv) : Nullcv)) {
4093 /* just a cached method */
4097 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4098 /* already defined (or promised) */
4099 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4100 && HvNAME(GvSTASH(CvGV(cv)))
4101 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4102 line_t oldline = PL_curcop->cop_line;
4103 if (PL_copline != NOLINE)
4104 PL_curcop->cop_line = PL_copline;
4105 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4106 PL_curcop->cop_line = oldline;
4113 if (cv) /* must reuse cv if autoloaded */
4116 cv = (CV*)NEWSV(1105,0);
4117 sv_upgrade((SV *)cv, SVt_PVCV);
4121 PL_sub_generation++;
4124 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4126 New(666, CvMUTEXP(cv), 1, perl_mutex);
4127 MUTEX_INIT(CvMUTEXP(cv));
4129 #endif /* USE_THREADS */
4130 CvFILEGV(cv) = gv_fetchfile(filename);
4131 CvXSUB(cv) = subaddr;
4134 char *s = strrchr(name,':');
4139 if (strEQ(s, "BEGIN")) {
4141 PL_beginav = newAV();
4142 av_push(PL_beginav, (SV *)cv);
4145 else if (strEQ(s, "END")) {
4148 av_unshift(PL_endav, 1);
4149 av_store(PL_endav, 0, (SV *)cv);
4152 else if (strEQ(s, "INIT")) {
4154 PL_initav = newAV();
4155 av_push(PL_initav, (SV *)cv);
4166 newFORM(I32 floor, OP *o, OP *block)
4176 name = SvPVx(cSVOPo->op_sv, n_a);
4179 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4181 if (cv = GvFORM(gv)) {
4182 if (ckWARN(WARN_REDEFINE)) {
4183 line_t oldline = PL_curcop->cop_line;
4185 PL_curcop->cop_line = PL_copline;
4186 warner(WARN_REDEFINE, "Format %s redefined",name);
4187 PL_curcop->cop_line = oldline;
4193 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4194 CvFILEGV(cv) = PL_curcop->cop_filegv;
4196 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4197 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4198 SvPADTMP_on(PL_curpad[ix]);
4201 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4202 CvSTART(cv) = LINKLIST(CvROOT(cv));
4203 CvROOT(cv)->op_next = 0;
4206 PL_copline = NOLINE;
4213 return newUNOP(OP_REFGEN, 0,
4214 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4220 return newUNOP(OP_REFGEN, 0,
4221 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4225 newANONSUB(I32 floor, OP *proto, OP *block)
4227 return newUNOP(OP_REFGEN, 0,
4228 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4234 switch (o->op_type) {
4236 o->op_type = OP_PADAV;
4237 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4238 return ref(o, OP_RV2AV);
4241 o->op_type = OP_RV2AV;
4242 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4247 warn("oops: oopsAV");
4256 switch (o->op_type) {
4259 o->op_type = OP_PADHV;
4260 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4261 return ref(o, OP_RV2HV);
4265 o->op_type = OP_RV2HV;
4266 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4271 warn("oops: oopsHV");
4280 if (o->op_type == OP_PADANY) {
4281 o->op_type = OP_PADAV;
4282 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4285 return newUNOP(OP_RV2AV, 0, scalar(o));
4289 newGVREF(I32 type, OP *o)
4291 if (type == OP_MAPSTART)
4292 return newUNOP(OP_NULL, 0, o);
4293 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4299 if (o->op_type == OP_PADANY) {
4300 o->op_type = OP_PADHV;
4301 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4304 return newUNOP(OP_RV2HV, 0, scalar(o));
4310 croak("NOT IMPL LINE %d",__LINE__);
4316 newCVREF(I32 flags, OP *o)
4318 return newUNOP(OP_RV2CV, flags, scalar(o));
4324 if (o->op_type == OP_PADANY) {
4325 o->op_type = OP_PADSV;
4326 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4329 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4330 o->op_flags |= OPpDONE_SVREF;
4333 return newUNOP(OP_RV2SV, 0, scalar(o));
4336 /* Check routines. */
4344 name = NEWSV(1106,0);
4345 sv_upgrade(name, SVt_PVNV);
4346 sv_setpvn(name, "&", 1);
4349 ix = pad_alloc(o->op_type, SVs_PADMY);
4350 av_store(PL_comppad_name, ix, name);
4351 av_store(PL_comppad, ix, cSVOPo->op_sv);
4352 SvPADMY_on(cSVOPo->op_sv);
4353 cSVOPo->op_sv = Nullsv;
4354 cSVOPo->op_targ = ix;
4361 o->op_private = PL_hints;
4368 if (cUNOPo->op_first->op_type == OP_CONCAT)
4369 o->op_flags |= OPf_STACKED;
4376 if (o->op_flags & OPf_KIDS) {
4379 OPCODE type = o->op_type;
4380 o = modkids(ck_fun(o), type);
4381 kid = cUNOPo->op_first;
4382 newop = kUNOP->op_first->op_sibling;
4384 (newop->op_sibling ||
4385 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4386 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4387 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4391 op_free(kUNOP->op_first);
4392 kUNOP->op_first = newop;
4394 o->op_ppaddr = PL_ppaddr[++o->op_type];
4403 if (o->op_flags & OPf_KIDS) {
4404 OP *kid = cUNOPo->op_first;
4405 if (kid->op_type == OP_HSLICE)
4406 o->op_private |= OPpSLICE;
4407 else if (kid->op_type != OP_HELEM)
4408 croak("%s argument is not a HASH element or slice",
4409 PL_op_desc[o->op_type]);
4418 I32 type = o->op_type;
4420 if (o->op_flags & OPf_KIDS) {
4421 if (cLISTOPo->op_first->op_type == OP_STUB) {
4423 o = newUNOP(type, OPf_SPECIAL,
4424 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4434 PL_hints |= HINT_BLOCK_SCOPE;
4435 if (o->op_flags & OPf_KIDS) {
4436 SVOP *kid = (SVOP*)cUNOPo->op_first;
4439 o->op_flags &= ~OPf_KIDS;
4442 else if (kid->op_type == OP_LINESEQ) {
4445 kid->op_next = o->op_next;
4446 cUNOPo->op_first = 0;
4449 Newz(1101, enter, 1, LOGOP);
4450 enter->op_type = OP_ENTERTRY;
4451 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4452 enter->op_private = 0;
4454 /* establish postfix order */
4455 enter->op_next = (OP*)enter;
4457 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4458 o->op_type = OP_LEAVETRY;
4459 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4460 enter->op_other = o;
4468 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4470 o->op_targ = (PADOFFSET)PL_hints;
4478 if (o->op_flags & OPf_STACKED) {
4480 kid = cUNOPo->op_first->op_sibling;
4481 if (kid->op_type == OP_RV2GV)
4493 if (o->op_flags & OPf_KIDS) {
4494 OP *kid = cUNOPo->op_first;
4495 if (kid->op_type != OP_HELEM)
4496 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4504 ck_gvconst(register OP *o)
4506 o = fold_constants(o);
4507 if (o->op_type == OP_CONST)
4514 ck_rvconst(register OP *o)
4517 SVOP *kid = (SVOP*)cUNOPo->op_first;
4519 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4520 if (kid->op_type == OP_CONST) {
4524 SV *kidsv = kid->op_sv;
4527 /* Is it a constant from cv_const_sv()? */
4528 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4529 SV *rsv = SvRV(kidsv);
4530 int svtype = SvTYPE(rsv);
4531 char *badtype = Nullch;
4533 switch (o->op_type) {
4535 if (svtype > SVt_PVMG)
4536 badtype = "a SCALAR";
4539 if (svtype != SVt_PVAV)
4540 badtype = "an ARRAY";
4543 if (svtype != SVt_PVHV) {
4544 if (svtype == SVt_PVAV) { /* pseudohash? */
4545 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4546 if (ksv && SvROK(*ksv)
4547 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4556 if (svtype != SVt_PVCV)
4561 croak("Constant is not %s reference", badtype);
4564 name = SvPV(kidsv, n_a);
4565 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4566 char *badthing = Nullch;
4567 switch (o->op_type) {
4569 badthing = "a SCALAR";
4572 badthing = "an ARRAY";
4575 badthing = "a HASH";
4580 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4584 * This is a little tricky. We only want to add the symbol if we
4585 * didn't add it in the lexer. Otherwise we get duplicate strict
4586 * warnings. But if we didn't add it in the lexer, we must at
4587 * least pretend like we wanted to add it even if it existed before,
4588 * or we get possible typo warnings. OPpCONST_ENTERED says
4589 * whether the lexer already added THIS instance of this symbol.
4591 iscv = (o->op_type == OP_RV2CV) * 2;
4593 gv = gv_fetchpv(name,
4594 iscv | !(kid->op_private & OPpCONST_ENTERED),
4597 : o->op_type == OP_RV2SV
4599 : o->op_type == OP_RV2AV
4601 : o->op_type == OP_RV2HV
4604 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4606 kid->op_type = OP_GV;
4607 SvREFCNT_dec(kid->op_sv);
4608 kid->op_sv = SvREFCNT_inc(gv);
4618 I32 type = o->op_type;
4620 if (o->op_flags & OPf_REF)
4623 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4624 SVOP *kid = (SVOP*)cUNOPo->op_first;
4626 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4628 OP *newop = newGVOP(type, OPf_REF,
4629 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4636 if (type == OP_FTTTY)
4637 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4640 return newUNOP(type, 0, newDEFSVOP());
4653 int type = o->op_type;
4654 register I32 oa = PL_opargs[type] >> OASHIFT;
4656 if (o->op_flags & OPf_STACKED) {
4657 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4660 return no_fh_allowed(o);
4663 if (o->op_flags & OPf_KIDS) {
4665 tokid = &cLISTOPo->op_first;
4666 kid = cLISTOPo->op_first;
4667 if (kid->op_type == OP_PUSHMARK ||
4668 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4670 tokid = &kid->op_sibling;
4671 kid = kid->op_sibling;
4673 if (!kid && PL_opargs[type] & OA_DEFGV)
4674 *tokid = kid = newDEFSVOP();
4678 sibl = kid->op_sibling;
4681 /* list seen where single (scalar) arg expected? */
4682 if (numargs == 1 && !(oa >> 4)
4683 && kid->op_type == OP_LIST && type != OP_SCALAR)
4685 return too_many_arguments(o,PL_op_desc[type]);
4698 if (kid->op_type == OP_CONST &&
4699 (kid->op_private & OPpCONST_BARE))
4701 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4702 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4703 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4704 if (ckWARN(WARN_SYNTAX))
4706 "Array @%s missing the @ in argument %ld of %s()",
4707 name, (long)numargs, PL_op_desc[type]);
4710 kid->op_sibling = sibl;
4713 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4714 bad_type(numargs, "array", PL_op_desc[type], kid);
4718 if (kid->op_type == OP_CONST &&
4719 (kid->op_private & OPpCONST_BARE))
4721 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4722 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4723 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4724 if (ckWARN(WARN_SYNTAX))
4726 "Hash %%%s missing the %% in argument %ld of %s()",
4727 name, (long)numargs, PL_op_desc[type]);
4730 kid->op_sibling = sibl;
4733 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4734 bad_type(numargs, "hash", PL_op_desc[type], kid);
4739 OP *newop = newUNOP(OP_NULL, 0, kid);
4740 kid->op_sibling = 0;
4742 newop->op_next = newop;
4744 kid->op_sibling = sibl;
4749 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4750 if (kid->op_type == OP_CONST &&
4751 (kid->op_private & OPpCONST_BARE))
4753 OP *newop = newGVOP(OP_GV, 0,
4754 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4759 else if (kid->op_type == OP_READLINE) {
4760 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4761 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4764 I32 flags = OPf_SPECIAL;
4765 /* is this op a FH constructor? */
4766 if (is_handle_constructor(o,numargs))
4768 kid->op_sibling = 0;
4769 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4771 kid->op_sibling = sibl;
4777 mod(scalar(kid), type);
4781 tokid = &kid->op_sibling;
4782 kid = kid->op_sibling;
4784 o->op_private |= numargs;
4786 return too_many_arguments(o,PL_op_desc[o->op_type]);
4789 else if (PL_opargs[type] & OA_DEFGV) {
4791 return newUNOP(type, 0, newDEFSVOP());
4795 while (oa & OA_OPTIONAL)
4797 if (oa && oa != OA_LIST)
4798 return too_few_arguments(o,PL_op_desc[o->op_type]);
4808 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4809 append_elem(OP_GLOB, o, newDEFSVOP());
4811 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4812 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4814 if (gv && GvIMPORTED_CV(gv)) {
4815 append_elem(OP_GLOB, o,
4816 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4817 o->op_type = OP_LIST;
4818 o->op_ppaddr = PL_ppaddr[OP_LIST];
4819 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4820 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4821 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4822 append_elem(OP_LIST, o,
4823 scalar(newUNOP(OP_RV2CV, 0,
4824 newGVOP(OP_GV, 0, gv)))));
4825 o = newUNOP(OP_NULL, 0, ck_subr(o));
4826 o->op_targ = OP_GLOB; /* hint at what it used to be */
4829 gv = newGVgen("main");
4831 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4841 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4843 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4844 Newz(1101, gwop, 1, LOGOP);
4846 if (o->op_flags & OPf_STACKED) {
4849 kid = cLISTOPo->op_first->op_sibling;
4850 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4853 kid->op_next = (OP*)gwop;
4854 o->op_flags &= ~OPf_STACKED;
4856 kid = cLISTOPo->op_first->op_sibling;
4857 if (type == OP_MAPWHILE)
4864 kid = cLISTOPo->op_first->op_sibling;
4865 if (kid->op_type != OP_NULL)
4866 croak("panic: ck_grep");
4867 kid = kUNOP->op_first;
4869 gwop->op_type = type;
4870 gwop->op_ppaddr = PL_ppaddr[type];
4871 gwop->op_first = listkids(o);
4872 gwop->op_flags |= OPf_KIDS;
4873 gwop->op_private = 1;
4874 gwop->op_other = LINKLIST(kid);
4875 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4876 kid->op_next = (OP*)gwop;
4878 kid = cLISTOPo->op_first->op_sibling;
4879 if (!kid || !kid->op_sibling)
4880 return too_few_arguments(o,PL_op_desc[o->op_type]);
4881 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4882 mod(kid, OP_GREPSTART);
4890 if (o->op_flags & OPf_KIDS) {
4891 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4893 kid = kid->op_sibling; /* get past "big" */
4894 if (kid && kid->op_type == OP_CONST)
4895 fbm_compile(((SVOP*)kid)->op_sv, 0);
4901 ck_lengthconst(OP *o)
4903 /* XXX length optimization goes here */
4910 OPCODE type = o->op_type;
4911 return modkids(ck_fun(o), type);
4917 OPCODE type = o->op_type;
4918 return refkids(ck_fun(o), type);
4926 kid = cLISTOPo->op_first;
4929 kid = cLISTOPo->op_first;
4931 if (kid->op_type == OP_PUSHMARK)
4932 kid = kid->op_sibling;
4933 if (kid && o->op_flags & OPf_STACKED)
4934 kid = kid->op_sibling;
4935 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4936 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4937 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4938 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4939 cLISTOPo->op_first->op_sibling = kid;
4940 cLISTOPo->op_last = kid;
4941 kid = kid->op_sibling;
4946 append_elem(o->op_type, o, newDEFSVOP());
4952 if (PL_hints & HINT_LOCALE)
4953 o->op_private |= OPpLOCALE;
4960 ck_fun_locale(OP *o)
4966 if (PL_hints & HINT_LOCALE)
4967 o->op_private |= OPpLOCALE;
4978 if (PL_hints & HINT_LOCALE)
4979 o->op_private |= OPpLOCALE;
4988 o->op_private |= OPpRUNTIME;
5001 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5002 o->op_private |= OPpREPEAT_DOLIST;
5003 cBINOPo->op_first = force_list(cBINOPo->op_first);
5013 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5014 SVOP *kid = (SVOP*)cUNOPo->op_first;
5016 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5018 for (s = SvPVX(kid->op_sv); *s; s++) {
5019 if (*s == ':' && s[1] == ':') {
5021 Move(s+2, s+1, strlen(s+2)+1, char);
5022 --SvCUR(kid->op_sv);
5025 sv_catpvn(kid->op_sv, ".pm", 3);
5035 croak("NOT IMPL LINE %d",__LINE__);
5045 if (o->op_flags & OPf_KIDS) {
5046 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5047 if (kid && kid->op_sibling) {
5048 o->op_type = OP_SSELECT;
5049 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5051 return fold_constants(o);
5055 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5056 if (kid && kid->op_type == OP_RV2GV)
5057 kid->op_private &= ~HINT_STRICT_REFS;
5064 I32 type = o->op_type;
5066 if (!(o->op_flags & OPf_KIDS)) {
5071 if (!CvUNIQUE(PL_compcv)) {
5072 argop = newOP(OP_PADAV, OPf_REF);
5073 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5076 argop = newUNOP(OP_RV2AV, 0,
5077 scalar(newGVOP(OP_GV, 0,
5078 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5081 argop = newUNOP(OP_RV2AV, 0,
5082 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5083 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5084 #endif /* USE_THREADS */
5085 return newUNOP(type, 0, scalar(argop));
5087 return scalar(modkids(ck_fun(o), type));
5095 if (PL_hints & HINT_LOCALE)
5096 o->op_private |= OPpLOCALE;
5099 if (o->op_flags & OPf_STACKED)
5101 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5102 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5104 kid = kUNOP->op_first; /* get past rv2gv */
5106 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5108 if (kid->op_type == OP_SCOPE) {
5112 else if (kid->op_type == OP_LEAVE) {
5113 if (o->op_type == OP_SORT) {
5114 null(kid); /* wipe out leave */
5117 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5118 if (k->op_next == kid)
5123 kid->op_next = 0; /* just disconnect the leave */
5124 k = kLISTOP->op_first;
5128 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5129 null(kid); /* wipe out rv2gv */
5130 if (o->op_type == OP_SORT)
5134 o->op_flags |= OPf_SPECIAL;
5136 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5137 null(cLISTOPo->op_first->op_sibling);
5144 simplify_sort(OP *o)
5147 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5150 if (!(o->op_flags & OPf_STACKED))
5152 kid = kUNOP->op_first; /* get past rv2gv */
5153 if (kid->op_type != OP_SCOPE)
5155 kid = kLISTOP->op_last; /* get past scope */
5156 switch(kid->op_type) {
5164 k = kid; /* remember this node*/
5165 if (kBINOP->op_first->op_type != OP_RV2SV)
5167 kid = kBINOP->op_first; /* get past cmp */
5168 if (kUNOP->op_first->op_type != OP_GV)
5170 kid = kUNOP->op_first; /* get past rv2sv */
5171 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5173 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5175 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5179 kid = k; /* back to cmp */
5180 if (kBINOP->op_last->op_type != OP_RV2SV)
5182 kid = kBINOP->op_last; /* down to 2nd arg */
5183 if (kUNOP->op_first->op_type != OP_GV)
5185 kid = kUNOP->op_first; /* get past rv2sv */
5186 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5188 ? strNE(GvNAME(kGVOP->op_gv), "a")
5189 : strNE(GvNAME(kGVOP->op_gv), "b")))
5191 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5193 o->op_private |= OPpSORT_REVERSE;
5194 if (k->op_type == OP_NCMP)
5195 o->op_private |= OPpSORT_NUMERIC;
5196 if (k->op_type == OP_I_NCMP)
5197 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5198 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5199 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5200 cLISTOPo->op_children = 1;
5208 if (o->op_flags & OPf_STACKED)
5209 return no_fh_allowed(o);
5211 kid = cLISTOPo->op_first;
5212 if (kid->op_type != OP_NULL)
5213 croak("panic: ck_split");
5214 kid = kid->op_sibling;
5215 op_free(cLISTOPo->op_first);
5216 cLISTOPo->op_first = kid;
5218 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5219 cLISTOPo->op_last = kid; /* There was only one element previously */
5222 if (kid->op_type != OP_MATCH) {
5223 OP *sibl = kid->op_sibling;
5224 kid->op_sibling = 0;
5225 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5226 if (cLISTOPo->op_first == cLISTOPo->op_last)
5227 cLISTOPo->op_last = kid;
5228 cLISTOPo->op_first = kid;
5229 kid->op_sibling = sibl;
5232 kid->op_type = OP_PUSHRE;
5233 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5236 if (!kid->op_sibling)
5237 append_elem(OP_SPLIT, o, newDEFSVOP());
5239 kid = kid->op_sibling;
5242 if (!kid->op_sibling)
5243 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5245 kid = kid->op_sibling;
5248 if (kid->op_sibling)
5249 return too_many_arguments(o,PL_op_desc[o->op_type]);
5258 OP *prev = ((cUNOPo->op_first->op_sibling)
5259 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5260 OP *o2 = prev->op_sibling;
5269 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5270 if (cvop->op_type == OP_RV2CV) {
5272 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5273 null(cvop); /* disable rv2cv */
5274 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5275 if (tmpop->op_type == OP_GV) {
5276 cv = GvCVu(tmpop->op_sv);
5277 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5278 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5279 proto = SvPV((SV*)cv, n_a);
5283 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5284 if (PERLDB_SUB && PL_curstash != PL_debstash)
5285 o->op_private |= OPpENTERSUB_DB;
5286 while (o2 != cvop) {
5290 return too_many_arguments(o, gv_ename(namegv));
5308 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5309 bad_type(arg, "block", gv_ename(namegv), o2);
5312 /* '*' allows any scalar type, including bareword */
5315 if (o2->op_type == OP_RV2GV)
5316 goto wrapref; /* autoconvert GLOB -> GLOBref */
5324 if (o2->op_type != OP_RV2GV)
5325 bad_type(arg, "symbol", gv_ename(namegv), o2);
5328 if (o2->op_type != OP_RV2CV)
5329 bad_type(arg, "sub", gv_ename(namegv), o2);
5332 if (o2->op_type != OP_RV2SV
5333 && o2->op_type != OP_PADSV
5334 && o2->op_type != OP_THREADSV)
5336 bad_type(arg, "scalar", gv_ename(namegv), o2);
5340 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5341 bad_type(arg, "array", gv_ename(namegv), o2);
5344 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5345 bad_type(arg, "hash", gv_ename(namegv), o2);
5349 OP* sib = kid->op_sibling;
5350 kid->op_sibling = 0;
5351 o2 = newUNOP(OP_REFGEN, 0, kid);
5352 o2->op_sibling = sib;
5353 prev->op_sibling = o2;
5364 croak("Malformed prototype for %s: %s",
5365 gv_ename(namegv), SvPV((SV*)cv, n_a));
5370 mod(o2, OP_ENTERSUB);
5372 o2 = o2->op_sibling;
5374 if (proto && !optional &&
5375 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5376 return too_few_arguments(o, gv_ename(namegv));
5383 SvREADONLY_on(cSVOPo->op_sv);
5390 if (o->op_flags & OPf_KIDS) {
5391 SVOP *kid = (SVOP*)cUNOPo->op_first;
5393 if (kid->op_type == OP_NULL)
5394 kid = (SVOP*)kid->op_sibling;
5396 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5397 o->op_flags |= OPf_SPECIAL;
5402 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5405 peep(register OP *o)
5408 register OP* oldop = 0;
5411 if (!o || o->op_seq)
5415 SAVESPTR(PL_curcop);
5416 for (; o; o = o->op_next) {
5422 switch (o->op_type) {
5425 PL_curcop = ((COP*)o); /* for warnings */
5426 o->op_seq = PL_op_seqmax++;
5437 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5439 o->op_seq = PL_op_seqmax++;
5442 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5443 o->op_seq = PL_op_seqmax++;
5444 break; /* Scalar stub must produce undef. List stub is noop */
5448 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5449 PL_curcop = ((COP*)o);
5455 if (oldop && o->op_next) {
5456 oldop->op_next = o->op_next;
5459 o->op_seq = PL_op_seqmax++;
5463 if (o->op_next->op_type == OP_RV2SV) {
5464 if (!(o->op_next->op_private & OPpDEREF)) {
5466 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5467 o->op_next = o->op_next->op_next;
5468 o->op_type = OP_GVSV;
5469 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5472 else if (o->op_next->op_type == OP_RV2AV) {
5473 OP* pop = o->op_next->op_next;
5475 if (pop->op_type == OP_CONST &&
5476 (PL_op = pop->op_next) &&
5477 pop->op_next->op_type == OP_AELEM &&
5478 !(pop->op_next->op_private &
5479 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5480 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5484 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5488 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5489 o->op_next = pop->op_next->op_next;
5490 o->op_type = OP_AELEMFAST;
5491 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5492 o->op_private = (U8)i;
5493 GvAVn(((GVOP*)o)->op_gv);
5496 o->op_seq = PL_op_seqmax++;
5503 o->op_seq = PL_op_seqmax++;
5504 while (cLOGOP->op_other->op_type == OP_NULL)
5505 cLOGOP->op_other = cLOGOP->op_other->op_next;
5506 peep(cLOGOP->op_other);
5510 o->op_seq = PL_op_seqmax++;
5511 peep(cCONDOP->op_true);
5512 peep(cCONDOP->op_false);
5516 o->op_seq = PL_op_seqmax++;
5517 peep(cLOOP->op_redoop);
5518 peep(cLOOP->op_nextop);
5519 peep(cLOOP->op_lastop);
5525 o->op_seq = PL_op_seqmax++;
5526 peep(cPMOP->op_pmreplstart);
5530 o->op_seq = PL_op_seqmax++;
5531 if (ckWARN(WARN_SYNTAX) && o->op_next
5532 && o->op_next->op_type == OP_NEXTSTATE) {
5533 if (o->op_next->op_sibling &&
5534 o->op_next->op_sibling->op_type != OP_EXIT &&
5535 o->op_next->op_sibling->op_type != OP_WARN &&
5536 o->op_next->op_sibling->op_type != OP_DIE) {
5537 line_t oldline = PL_curcop->cop_line;
5539 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5540 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5541 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5542 PL_curcop->cop_line = oldline;
5556 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5557 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5559 rop = (UNOP*)((BINOP*)o)->op_first;
5560 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5562 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5563 if (!SvOBJECT(lexname))
5565 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5566 if (!fields || !GvHV(*fields))
5568 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5569 key = SvPV(*svp, keylen);
5570 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5572 croak("No such field \"%s\" in variable %s of type %s",
5573 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5575 ind = SvIV(*indsvp);
5577 croak("Bad index while coercing array into hash");
5578 rop->op_type = OP_RV2AV;
5579 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5580 o->op_type = OP_AELEM;
5581 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5583 *svp = newSViv(ind);
5588 o->op_seq = PL_op_seqmax++;