3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*PL_check
24 #define CHECKCALL *PL_check
27 /* #define PL_OP_SLAB_ALLOC */
29 #ifdef PL_OP_SLAB_ALLOC
30 #define SLAB_SIZE 8192
31 static char *PL_OpPtr = NULL;
32 static int PL_OpSpace = 0;
33 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
34 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
36 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
40 Slab_Alloc(int m, size_t sz)
42 Newz(m,PL_OpPtr,SLAB_SIZE,char);
43 PL_OpSpace = SLAB_SIZE - sz;
44 return PL_OpPtr += PL_OpSpace;
48 #define NewOp(m, var, c, type) Newz(m, var, c, type)
51 * In the following definition, the ", Nullop" is just to make the compiler
52 * think the expression is of the right type: croak actually does a Siglongjmp.
54 #define CHECKOP(type,o) \
55 ((PL_op_mask && PL_op_mask[type]) \
56 ? ( op_free((OP*)o), \
57 croak("%s trapped by operation mask", PL_op_desc[type]), \
59 : (CHECKCALL[type])((OP*)o))
61 #define PAD_MAX 999999999
63 static bool scalar_mod_type _((OP *o, I32 type));
65 static I32 list_assignment _((OP *o));
66 static void bad_type _((I32 n, char *t, char *name, OP *kid));
67 static OP *modkids _((OP *o, I32 type));
68 static OP *no_fh_allowed _((OP *o));
69 static void no_bareword_allowed _((OP *o));
70 static OP *scalarboolean _((OP *o));
71 static OP *too_few_arguments _((OP *o, char* name));
72 static OP *too_many_arguments _((OP *o, char* name));
73 static void null _((OP* o));
74 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
75 CV* startcv, I32 cx_ix, I32 saweval, U32 flags));
76 static OP *newDEFSVOP _((void));
77 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
78 static void simplify_sort _((OP *o));
79 static bool is_handle_constructor _((OP *o, I32 argnum));
86 SV* tmpsv = sv_newmortal();
87 gv_efullname3(tmpsv, gv, Nullch);
88 return SvPV(tmpsv,n_a);
94 yyerror(form("Missing comma after first argument to %s function",
95 PL_op_desc[o->op_type]));
100 too_few_arguments(OP *o, char *name)
102 yyerror(form("Not enough arguments for %s", name));
107 too_many_arguments(OP *o, char *name)
109 yyerror(form("Too many arguments for %s", name));
114 bad_type(I32 n, char *t, char *name, OP *kid)
116 yyerror(form("Type of arg %d to %s must be %s (not %s)",
117 (int)n, name, t, PL_op_desc[kid->op_type]));
121 no_bareword_allowed(OP *o)
123 warn("Bareword \"%s\" not allowed while \"strict subs\" in use",
124 SvPV_nolen(cSVOPo->op_sv));
131 int type = o->op_type;
132 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
133 yyerror(form("Can't use subscript on %s", PL_op_desc[type]));
134 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
136 SV *msg = sv_2mortal(
137 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
138 type == OP_ENTERSUB ? '&' : '%'));
142 sv_catsv(GvSV(PL_errgv), msg);
144 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
149 /* "register" allocation */
152 pad_allocmy(char *name)
160 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
161 name[1] == '_' && (int)strlen(name) > 2))
163 if (!isPRINT(name[1])) {
164 /* 1999-02-27 mjd@plover.com */
166 p = strchr(name, '\0');
167 /* The next block assumes the buffer is at least 205 chars
168 long. At present, it's always at least 256 chars. */
170 strcpy(name+200, "...");
176 /* Move everything else down one character */
177 for (; p-name > 2; p--)
179 name[2] = toCTRL(name[1]);
182 yyerror(form("Can't use global %s in \"my\"",name));
184 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
185 SV **svp = AvARRAY(PL_comppad_name);
186 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
188 && sv != &PL_sv_undef
189 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
190 && strEQ(name, SvPVX(sv)))
193 "\"my\" variable %s masks earlier declaration in same %s",
194 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
199 off = pad_alloc(OP_PADSV, SVs_PADMY);
201 sv_upgrade(sv, SVt_PVNV);
203 if (PL_in_my_stash) {
205 yyerror(form("Can't declare class for non-scalar %s in \"my\"",
208 (void)SvUPGRADE(sv, SVt_PVMG);
209 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
212 av_store(PL_comppad_name, off, sv);
213 SvNVX(sv) = (double)PAD_MAX;
214 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
215 if (!PL_min_intro_pending)
216 PL_min_intro_pending = off;
217 PL_max_intro_pending = off;
219 av_store(PL_comppad, off, (SV*)newAV());
220 else if (*name == '%')
221 av_store(PL_comppad, off, (SV*)newHV());
222 SvPADMY_on(PL_curpad[off]);
226 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
229 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval,
237 register PERL_CONTEXT *cx;
239 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
240 AV *curlist = CvPADLIST(cv);
241 SV **svp = av_fetch(curlist, 0, FALSE);
244 if (!svp || *svp == &PL_sv_undef)
247 svp = AvARRAY(curname);
248 for (off = AvFILLp(curname); off > 0; off--) {
249 if ((sv = svp[off]) &&
250 sv != &PL_sv_undef &&
252 seq > I_32(SvNVX(sv)) &&
253 strEQ(SvPVX(sv), name))
264 return 0; /* don't clone from inactive stack frame */
268 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
269 oldsv = *av_fetch(oldpad, off, TRUE);
270 if (!newoff) { /* Not a mere clone operation. */
271 SV *namesv = NEWSV(1103,0);
272 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
273 sv_upgrade(namesv, SVt_PVNV);
274 sv_setpv(namesv, name);
275 av_store(PL_comppad_name, newoff, namesv);
276 SvNVX(namesv) = (double)PL_curcop->cop_seq;
277 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
278 SvFAKE_on(namesv); /* A ref, not a real var */
279 if (SvOBJECT(sv)) { /* A typed var */
281 (void)SvUPGRADE(namesv, SVt_PVMG);
282 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
285 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
286 /* "It's closures all the way down." */
287 CvCLONE_on(PL_compcv);
289 if (CvANON(PL_compcv))
290 oldsv = Nullsv; /* no need to keep ref */
295 bcv && bcv != cv && !CvCLONE(bcv);
296 bcv = CvOUTSIDE(bcv))
301 if (ckWARN(WARN_CLOSURE)
302 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
305 "Variable \"%s\" may be unavailable",
313 else if (!CvUNIQUE(PL_compcv)) {
314 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
316 "Variable \"%s\" will not stay shared", name);
319 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
325 if (flags & FINDLEX_NOSEARCH)
328 /* Nothing in current lexical context--try eval's context, if any.
329 * This is necessary to let the perldb get at lexically scoped variables.
330 * XXX This will also probably interact badly with eval tree caching.
333 for (i = cx_ix; i >= 0; i--) {
335 switch (CxTYPE(cx)) {
337 if (i == 0 && saweval) {
338 seq = cxstack[saweval].blk_oldcop->cop_seq;
339 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
343 switch (cx->blk_eval.old_op_type) {
349 /* require must have its own scope */
357 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
358 saweval = i; /* so we know where we were called from */
361 seq = cxstack[saweval].blk_oldcop->cop_seq;
362 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
370 pad_findmy(char *name)
376 SV **svp = AvARRAY(PL_comppad_name);
377 U32 seq = PL_cop_seqmax;
383 * Special case to get lexical (and hence per-thread) @_.
384 * XXX I need to find out how to tell at parse-time whether use
385 * of @_ should refer to a lexical (from a sub) or defgv (global
386 * scope and maybe weird sub-ish things like formats). See
387 * startsub in perly.y. It's possible that @_ could be lexical
388 * (at least from subs) even in non-threaded perl.
390 if (strEQ(name, "@_"))
391 return 0; /* success. (NOT_IN_PAD indicates failure) */
392 #endif /* USE_THREADS */
394 /* The one we're looking for is probably just before comppad_name_fill. */
395 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
396 if ((sv = svp[off]) &&
397 sv != &PL_sv_undef &&
400 seq > I_32(SvNVX(sv)))) &&
401 strEQ(SvPVX(sv), name))
404 return (PADOFFSET)off;
405 pendoff = off; /* this pending def. will override import */
409 outside = CvOUTSIDE(PL_compcv);
411 /* Check if if we're compiling an eval'', and adjust seq to be the
412 * eval's seq number. This depends on eval'' having a non-null
413 * CvOUTSIDE() while it is being compiled. The eval'' itself is
414 * identified by CvEVAL being true and CvGV being null. */
415 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
416 cx = &cxstack[cxstack_ix];
418 seq = cx->blk_oldcop->cop_seq;
421 /* See if it's in a nested scope */
422 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
424 /* If there is a pending local definition, this new alias must die */
426 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
427 return off; /* pad_findlex returns 0 for failure...*/
429 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
433 pad_leavemy(I32 fill)
436 SV **svp = AvARRAY(PL_comppad_name);
438 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
439 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
440 if ((sv = svp[off]) && sv != &PL_sv_undef)
441 warn("%s never introduced", SvPVX(sv));
444 /* "Deintroduce" my variables that are leaving with this scope. */
445 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
446 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
447 SvIVX(sv) = PL_cop_seqmax;
452 pad_alloc(I32 optype, U32 tmptype)
458 if (AvARRAY(PL_comppad) != PL_curpad)
459 croak("panic: pad_alloc");
460 if (PL_pad_reset_pending)
462 if (tmptype & SVs_PADMY) {
464 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
465 } while (SvPADBUSY(sv)); /* need a fresh one */
466 retval = AvFILLp(PL_comppad);
469 SV **names = AvARRAY(PL_comppad_name);
470 SSize_t names_fill = AvFILLp(PL_comppad_name);
473 * "foreach" index vars temporarily become aliases to non-"my"
474 * values. Thus we must skip, not just pad values that are
475 * marked as current pad values, but also those with names.
477 if (++PL_padix <= names_fill &&
478 (sv = names[PL_padix]) && sv != &PL_sv_undef)
480 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
481 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
486 SvFLAGS(sv) |= tmptype;
487 PL_curpad = AvARRAY(PL_comppad);
489 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
490 (unsigned long) thr, (unsigned long) PL_curpad,
491 (long) retval, PL_op_name[optype]));
493 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
494 (unsigned long) PL_curpad,
495 (long) retval, PL_op_name[optype]));
496 #endif /* USE_THREADS */
497 return (PADOFFSET)retval;
505 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
506 (unsigned long) thr, (unsigned long) PL_curpad, po));
509 croak("panic: pad_sv po");
510 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
511 (unsigned long) PL_curpad, po));
512 #endif /* USE_THREADS */
513 return PL_curpad[po]; /* eventually we'll turn this into a macro */
517 pad_free(PADOFFSET po)
522 if (AvARRAY(PL_comppad) != PL_curpad)
523 croak("panic: pad_free curpad");
525 croak("panic: pad_free po");
527 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
528 (unsigned long) thr, (unsigned long) PL_curpad, po));
530 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
531 (unsigned long) PL_curpad, po));
532 #endif /* USE_THREADS */
533 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
534 SvPADTMP_off(PL_curpad[po]);
535 if ((I32)po < PL_padix)
540 pad_swipe(PADOFFSET po)
543 if (AvARRAY(PL_comppad) != PL_curpad)
544 croak("panic: pad_swipe curpad");
546 croak("panic: pad_swipe po");
548 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
549 (unsigned long) thr, (unsigned long) PL_curpad, po));
551 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
552 (unsigned long) PL_curpad, po));
553 #endif /* USE_THREADS */
554 SvPADTMP_off(PL_curpad[po]);
555 PL_curpad[po] = NEWSV(1107,0);
556 SvPADTMP_on(PL_curpad[po]);
557 if ((I32)po < PL_padix)
561 /* XXX pad_reset() is currently disabled because it results in serious bugs.
562 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
563 * on the stack by OPs that use them, there are several ways to get an alias
564 * to a shared TARG. Such an alias will change randomly and unpredictably.
565 * We avoid doing this until we can think of a Better Way.
570 #ifdef USE_BROKEN_PAD_RESET
574 if (AvARRAY(PL_comppad) != PL_curpad)
575 croak("panic: pad_reset curpad");
577 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
578 (unsigned long) thr, (unsigned long) PL_curpad));
580 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
581 (unsigned long) PL_curpad));
582 #endif /* USE_THREADS */
583 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
584 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
585 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
586 SvPADTMP_off(PL_curpad[po]);
588 PL_padix = PL_padix_floor;
591 PL_pad_reset_pending = FALSE;
595 /* find_threadsv is not reentrant */
597 find_threadsv(const char *name)
603 /* We currently only handle names of a single character */
604 p = strchr(PL_threadsv_names, *name);
607 key = p - PL_threadsv_names;
608 MUTEX_LOCK(&thr->mutex);
609 svp = av_fetch(thr->threadsv, key, FALSE);
611 MUTEX_UNLOCK(&thr->mutex);
613 SV *sv = NEWSV(0, 0);
614 av_store(thr->threadsv, key, sv);
615 thr->threadsvp = AvARRAY(thr->threadsv);
616 MUTEX_UNLOCK(&thr->mutex);
618 * Some magic variables used to be automagically initialised
619 * in gv_fetchpv. Those which are now per-thread magicals get
620 * initialised here instead.
626 sv_setpv(sv, "\034");
627 sv_magic(sv, 0, 0, name, 1);
632 PL_sawampersand = TRUE;
646 /* XXX %! tied to Errno.pm needs to be added here.
647 * See gv_fetchpv(). */
651 sv_magic(sv, 0, 0, name, 1);
653 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
654 "find_threadsv: new SV %p for $%s%c\n",
655 sv, (*name < 32) ? "^" : "",
656 (*name < 32) ? toCTRL(*name) : *name));
660 #endif /* USE_THREADS */
667 register OP *kid, *nextkid;
669 if (!o || o->op_seq == (U16)-1)
672 if (o->op_flags & OPf_KIDS) {
673 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
674 nextkid = kid->op_sibling; /* Get before next freeing kid */
679 switch (o->op_type) {
681 o->op_targ = 0; /* Was holding old type, if any. */
684 o->op_targ = 0; /* Was holding hints. */
688 if (!(o->op_flags & OPf_SPECIAL))
692 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
694 #endif /* USE_THREADS */
696 if (!(o->op_flags & OPf_REF)
697 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
703 SvREFCNT_dec(cGVOPo->op_gv);
707 Safefree(cCOPo->cop_label);
708 SvREFCNT_dec(cCOPo->cop_filegv);
709 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
710 SvREFCNT_dec(cCOPo->cop_warnings);
713 SvREFCNT_dec(cSVOPo->op_sv);
719 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
723 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
724 SvREFCNT_dec(cSVOPo->op_sv);
726 Safefree(cPVOPo->op_pv);
729 op_free(cPMOPo->op_pmreplroot);
734 ReREFCNT_dec(cPMOPo->op_pmregexp);
739 pad_free(o->op_targ);
741 #ifdef PL_OP_SLAB_ALLOC
742 if ((char *) o == PL_OpPtr)
753 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
754 pad_free(o->op_targ);
755 o->op_targ = o->op_type;
756 o->op_type = OP_NULL;
757 o->op_ppaddr = PL_ppaddr[OP_NULL];
760 /* Contextualizers */
762 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
772 /* establish postfix order */
773 if (cUNOPo->op_first) {
774 o->op_next = LINKLIST(cUNOPo->op_first);
775 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
777 kid->op_next = LINKLIST(kid->op_sibling);
792 if (o && o->op_flags & OPf_KIDS) {
793 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
802 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
804 if (ckWARN(WARN_SYNTAX)) {
805 line_t oldline = PL_curcop->cop_line;
807 if (PL_copline != NOLINE)
808 PL_curcop->cop_line = PL_copline;
809 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
810 PL_curcop->cop_line = oldline;
821 /* assumes no premature commitment */
822 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
823 || o->op_type == OP_RETURN)
826 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
828 switch (o->op_type) {
830 if (o->op_private & OPpREPEAT_DOLIST)
831 null(((LISTOP*)cBINOPo->op_first)->op_first);
832 scalar(cBINOPo->op_first);
837 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
841 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
842 if (!kPMOP->op_pmreplroot)
843 deprecate("implicit split to @_");
851 if (o->op_flags & OPf_KIDS) {
852 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
858 kid = cLISTOPo->op_first;
860 while (kid = kid->op_sibling) {
866 WITH_THR(PL_curcop = &PL_compiling);
871 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
877 WITH_THR(PL_curcop = &PL_compiling);
890 /* assumes no premature commitment */
891 U8 want = o->op_flags & OPf_WANT;
892 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
893 || o->op_type == OP_RETURN)
896 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
898 switch (o->op_type) {
900 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
904 if (o->op_flags & OPf_STACKED)
908 if (o->op_private == 4)
979 if (!(o->op_private & OPpLVAL_INTRO))
980 useless = PL_op_desc[o->op_type];
987 if (!(o->op_private & OPpLVAL_INTRO) &&
988 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
989 useless = "a variable";
994 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
999 if (cSVOPo->op_private & OPpCONST_STRICT)
1000 no_bareword_allowed(o);
1003 if (ckWARN(WARN_VOID)) {
1004 useless = "a constant";
1005 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1007 else if (SvPOK(sv)) {
1008 if (strnEQ(SvPVX(sv), "di", 2) ||
1009 strnEQ(SvPVX(sv), "ds", 2) ||
1010 strnEQ(SvPVX(sv), "ig", 2))
1015 null(o); /* don't execute a constant */
1016 SvREFCNT_dec(sv); /* don't even remember it */
1020 o->op_type = OP_PREINC; /* pre-increment is faster */
1021 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1025 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1026 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1032 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1037 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
1038 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
1039 if (o->op_flags & OPf_STACKED)
1045 if (!(o->op_flags & OPf_KIDS))
1054 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1061 /* all requires must return a boolean value */
1062 o->op_flags &= ~OPf_WANT;
1065 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1066 if (!kPMOP->op_pmreplroot)
1067 deprecate("implicit split to @_");
1073 if (ckWARN(WARN_VOID))
1074 warner(WARN_VOID, "Useless use of %s in void context", useless);
1083 if (o && o->op_flags & OPf_KIDS) {
1084 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1095 /* assumes no premature commitment */
1096 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1097 || o->op_type == OP_RETURN)
1100 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1102 switch (o->op_type) {
1105 list(cBINOPo->op_first);
1110 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1118 if (!(o->op_flags & OPf_KIDS))
1120 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1121 list(cBINOPo->op_first);
1122 return gen_constant_list(o);
1129 kid = cLISTOPo->op_first;
1131 while (kid = kid->op_sibling) {
1132 if (kid->op_sibling)
1137 WITH_THR(PL_curcop = &PL_compiling);
1141 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1142 if (kid->op_sibling)
1147 WITH_THR(PL_curcop = &PL_compiling);
1150 /* all requires must return a boolean value */
1151 o->op_flags &= ~OPf_WANT;
1163 if (o->op_type == OP_LINESEQ ||
1164 o->op_type == OP_SCOPE ||
1165 o->op_type == OP_LEAVE ||
1166 o->op_type == OP_LEAVETRY)
1169 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1170 if (kid->op_sibling) {
1174 PL_curcop = &PL_compiling;
1176 o->op_flags &= ~OPf_PARENS;
1177 if (PL_hints & HINT_BLOCK_SCOPE)
1178 o->op_flags |= OPf_PARENS;
1181 o = newOP(OP_STUB, 0);
1186 modkids(OP *o, I32 type)
1189 if (o && o->op_flags & OPf_KIDS) {
1190 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1197 mod(OP *o, I32 type)
1204 if (!o || PL_error_count)
1207 switch (o->op_type) {
1212 if (!(o->op_private & (OPpCONST_ARYBASE)))
1214 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1215 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1219 SAVEI32(PL_compiling.cop_arybase);
1220 PL_compiling.cop_arybase = 0;
1222 else if (type == OP_REFGEN)
1225 croak("That use of $[ is unsupported");
1228 if (o->op_flags & OPf_PARENS)
1232 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1233 !(o->op_flags & OPf_STACKED)) {
1234 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1235 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1236 assert(cUNOPo->op_first->op_type == OP_NULL);
1237 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1243 /* grep, foreach, subcalls, refgen */
1244 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1246 yyerror(form("Can't modify %s in %s",
1247 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1248 ? "do block" : PL_op_desc[o->op_type]),
1249 type ? PL_op_desc[type] : "local"));
1263 case OP_RIGHT_SHIFT:
1272 if (!(o->op_flags & OPf_STACKED))
1278 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1284 if (!type && cUNOPo->op_first->op_type != OP_GV)
1285 croak("Can't localize through a reference");
1286 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1287 PL_modcount = 10000;
1288 return o; /* Treat \(@foo) like ordinary list. */
1292 if (scalar_mod_type(o, type))
1294 ref(cUNOPo->op_first, o->op_type);
1303 PL_modcount = 10000;
1306 if (!type && cUNOPo->op_first->op_type != OP_GV)
1307 croak("Can't localize through a reference");
1308 ref(cUNOPo->op_first, o->op_type);
1312 PL_hints |= HINT_BLOCK_SCOPE;
1322 PL_modcount = 10000;
1323 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1324 return o; /* Treat \(@foo) like ordinary list. */
1325 if (scalar_mod_type(o, type))
1331 croak("Can't localize lexical variable %s",
1332 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1337 PL_modcount++; /* XXX ??? */
1339 #endif /* USE_THREADS */
1345 if (type != OP_SASSIGN)
1349 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1355 pad_free(o->op_targ);
1356 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1357 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1358 if (o->op_flags & OPf_KIDS)
1359 mod(cBINOPo->op_first->op_sibling, type);
1364 ref(cBINOPo->op_first, o->op_type);
1365 if (type == OP_ENTERSUB &&
1366 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1367 o->op_private |= OPpLVAL_DEFER;
1374 if (o->op_flags & OPf_KIDS)
1375 mod(cLISTOPo->op_last, type);
1379 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1381 else if (!(o->op_flags & OPf_KIDS))
1383 if (o->op_targ != OP_LIST) {
1384 mod(cBINOPo->op_first, type);
1389 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1393 o->op_flags |= OPf_MOD;
1395 if (type == OP_AASSIGN || type == OP_SASSIGN)
1396 o->op_flags |= OPf_SPECIAL|OPf_REF;
1398 o->op_private |= OPpLVAL_INTRO;
1399 o->op_flags &= ~OPf_SPECIAL;
1400 PL_hints |= HINT_BLOCK_SCOPE;
1402 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1403 o->op_flags |= OPf_REF;
1408 scalar_mod_type(OP *o, I32 type)
1412 if (o->op_type == OP_RV2GV)
1436 case OP_RIGHT_SHIFT:
1455 is_handle_constructor(OP *o, I32 argnum)
1457 switch (o->op_type) {
1465 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1478 refkids(OP *o, I32 type)
1481 if (o && o->op_flags & OPf_KIDS) {
1482 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1489 ref(OP *o, I32 type)
1493 if (!o || PL_error_count)
1496 switch (o->op_type) {
1498 if ((type == OP_DEFINED || type == OP_LOCK) &&
1499 !(o->op_flags & OPf_STACKED)) {
1500 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1501 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1502 assert(cUNOPo->op_first->op_type == OP_NULL);
1503 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1504 o->op_flags |= OPf_SPECIAL;
1509 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1513 if (type == OP_DEFINED)
1514 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1515 ref(cUNOPo->op_first, o->op_type);
1518 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1519 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1520 : type == OP_RV2HV ? OPpDEREF_HV
1522 o->op_flags |= OPf_MOD;
1527 o->op_flags |= OPf_MOD; /* XXX ??? */
1532 o->op_flags |= OPf_REF;
1535 if (type == OP_DEFINED)
1536 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1537 ref(cUNOPo->op_first, o->op_type);
1542 o->op_flags |= OPf_REF;
1547 if (!(o->op_flags & OPf_KIDS))
1549 ref(cBINOPo->op_first, type);
1553 ref(cBINOPo->op_first, o->op_type);
1554 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1555 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1556 : type == OP_RV2HV ? OPpDEREF_HV
1558 o->op_flags |= OPf_MOD;
1566 if (!(o->op_flags & OPf_KIDS))
1568 ref(cLISTOPo->op_last, type);
1583 if (!o || PL_error_count)
1587 if (type == OP_LIST) {
1588 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1590 } else if (type == OP_UNDEF) {
1592 } else if (type != OP_PADSV &&
1595 type != OP_PUSHMARK)
1597 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1600 o->op_flags |= OPf_MOD;
1601 o->op_private |= OPpLVAL_INTRO;
1609 o->op_flags |= OPf_PARENS;
1614 bind_match(I32 type, OP *left, OP *right)
1619 if (ckWARN(WARN_UNSAFE) &&
1620 (left->op_type == OP_RV2AV ||
1621 left->op_type == OP_RV2HV ||
1622 left->op_type == OP_PADAV ||
1623 left->op_type == OP_PADHV)) {
1624 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1625 right->op_type == OP_TRANS)
1626 ? right->op_type : OP_MATCH];
1627 char *sample = ((left->op_type == OP_RV2AV ||
1628 left->op_type == OP_PADAV)
1629 ? "@array" : "%hash");
1631 "Applying %s to %s will act on scalar(%s)",
1632 desc, sample, sample);
1635 if (right->op_type == OP_MATCH ||
1636 right->op_type == OP_SUBST ||
1637 right->op_type == OP_TRANS) {
1638 right->op_flags |= OPf_STACKED;
1639 if (right->op_type != OP_MATCH)
1640 left = mod(left, right->op_type);
1641 if (right->op_type == OP_TRANS)
1642 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1644 o = prepend_elem(right->op_type, scalar(left), right);
1646 return newUNOP(OP_NOT, 0, scalar(o));
1650 return bind_match(type, left,
1651 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1659 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1660 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1667 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1668 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1669 o->op_type = OP_LEAVE;
1670 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1673 if (o->op_type == OP_LINESEQ) {
1675 o->op_type = OP_SCOPE;
1676 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1677 kid = ((LISTOP*)o)->op_first;
1678 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1679 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1684 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1694 SAVESPTR(GvHV(PL_hintgv));
1695 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1696 SAVEFREESV(GvHV(PL_hintgv));
1700 block_start(int full)
1703 int retval = PL_savestack_ix;
1705 SAVEI32(PL_comppad_name_floor);
1707 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1708 PL_comppad_name_floor = PL_comppad_name_fill;
1710 PL_comppad_name_floor = 0;
1712 SAVEI32(PL_min_intro_pending);
1713 SAVEI32(PL_max_intro_pending);
1714 PL_min_intro_pending = 0;
1715 SAVEI32(PL_comppad_name_fill);
1716 SAVEI32(PL_padix_floor);
1717 PL_padix_floor = PL_padix;
1718 PL_pad_reset_pending = FALSE;
1720 PL_hints &= ~HINT_BLOCK_SCOPE;
1721 SAVEPPTR(PL_compiling.cop_warnings);
1722 if (PL_compiling.cop_warnings != WARN_ALL &&
1723 PL_compiling.cop_warnings != WARN_NONE) {
1724 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1725 SAVEFREESV(PL_compiling.cop_warnings) ;
1733 block_end(I32 floor, OP *seq)
1736 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1737 OP* retval = scalarseq(seq);
1739 PL_pad_reset_pending = FALSE;
1740 PL_compiling.op_private = PL_hints;
1742 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1743 pad_leavemy(PL_comppad_name_fill);
1752 OP *o = newOP(OP_THREADSV, 0);
1753 o->op_targ = find_threadsv("_");
1756 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1757 #endif /* USE_THREADS */
1767 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1768 PL_eval_start = linklist(PL_eval_root);
1769 PL_eval_root->op_next = 0;
1770 peep(PL_eval_start);
1775 PL_main_root = scope(sawparens(scalarvoid(o)));
1776 PL_curcop = &PL_compiling;
1777 PL_main_start = LINKLIST(PL_main_root);
1778 PL_main_root->op_next = 0;
1779 peep(PL_main_start);
1782 /* Register with debugger */
1784 CV *cv = perl_get_cv("DB::postponed", FALSE);
1788 XPUSHs((SV*)PL_compiling.cop_filegv);
1790 perl_call_sv((SV*)cv, G_DISCARD);
1797 localize(OP *o, I32 lex)
1799 if (o->op_flags & OPf_PARENS)
1803 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1805 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1806 if (*s == ';' || *s == '=')
1807 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1808 lex ? "my" : "local");
1812 PL_in_my_stash = Nullhv;
1816 return mod(o, OP_NULL); /* a bit kludgey */
1822 if (o->op_type == OP_LIST) {
1825 o2 = newOP(OP_THREADSV, 0);
1826 o2->op_targ = find_threadsv(";");
1828 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1829 #endif /* USE_THREADS */
1830 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1836 fold_constants(register OP *o)
1840 I32 type = o->op_type;
1843 if (PL_opargs[type] & OA_RETSCALAR)
1845 if (PL_opargs[type] & OA_TARGET)
1846 o->op_targ = pad_alloc(type, SVs_PADTMP);
1848 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1849 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1851 if (!(PL_opargs[type] & OA_FOLDCONST))
1856 /* XXX might want a ck_negate() for this */
1857 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1870 if (o->op_private & OPpLOCALE)
1875 goto nope; /* Don't try to run w/ errors */
1877 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1878 if (curop->op_type != OP_CONST &&
1879 curop->op_type != OP_LIST &&
1880 curop->op_type != OP_SCALAR &&
1881 curop->op_type != OP_NULL &&
1882 curop->op_type != OP_PUSHMARK)
1888 curop = LINKLIST(o);
1892 sv = *(PL_stack_sp--);
1893 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1894 pad_swipe(o->op_targ);
1895 else if (SvTEMP(sv)) { /* grab mortal temp? */
1896 (void)SvREFCNT_inc(sv);
1900 if (type == OP_RV2GV)
1901 return newGVOP(OP_GV, 0, (GV*)sv);
1903 /* try to smush double to int, but don't smush -2.0 to -2 */
1904 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1908 if ((double)iv == SvNV(sv)) {
1913 SvIOK_off(sv); /* undo SvIV() damage */
1915 return newSVOP(OP_CONST, 0, sv);
1919 if (!(PL_opargs[type] & OA_OTHERINT))
1922 if (!(PL_hints & HINT_INTEGER)) {
1923 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1926 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1927 if (curop->op_type == OP_CONST) {
1928 if (SvIOK(((SVOP*)curop)->op_sv))
1932 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1936 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1943 gen_constant_list(register OP *o)
1947 I32 oldtmps_floor = PL_tmps_floor;
1951 return o; /* Don't attempt to run with errors */
1953 PL_op = curop = LINKLIST(o);
1959 PL_tmps_floor = oldtmps_floor;
1961 o->op_type = OP_RV2AV;
1962 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1963 curop = ((UNOP*)o)->op_first;
1964 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1971 convert(I32 type, I32 flags, OP *o)
1976 if (!o || o->op_type != OP_LIST)
1977 o = newLISTOP(OP_LIST, 0, o, Nullop);
1979 o->op_flags &= ~OPf_WANT;
1981 if (!(PL_opargs[type] & OA_MARK))
1982 null(cLISTOPo->op_first);
1985 o->op_ppaddr = PL_ppaddr[type];
1986 o->op_flags |= flags;
1988 o = CHECKOP(type, o);
1989 if (o->op_type != type)
1992 if (cLISTOPo->op_children < 7) {
1993 /* XXX do we really need to do this if we're done appending?? */
1994 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1996 cLISTOPo->op_last = last; /* in case check substituted last arg */
1999 return fold_constants(o);
2002 /* List constructors */
2005 append_elem(I32 type, OP *first, OP *last)
2013 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2014 return newLISTOP(type, 0, first, last);
2016 if (first->op_flags & OPf_KIDS)
2017 ((LISTOP*)first)->op_last->op_sibling = last;
2019 first->op_flags |= OPf_KIDS;
2020 ((LISTOP*)first)->op_first = last;
2022 ((LISTOP*)first)->op_last = last;
2023 ((LISTOP*)first)->op_children++;
2028 append_list(I32 type, LISTOP *first, LISTOP *last)
2036 if (first->op_type != type)
2037 return prepend_elem(type, (OP*)first, (OP*)last);
2039 if (last->op_type != type)
2040 return append_elem(type, (OP*)first, (OP*)last);
2042 first->op_last->op_sibling = last->op_first;
2043 first->op_last = last->op_last;
2044 first->op_children += last->op_children;
2045 if (first->op_children)
2046 first->op_flags |= OPf_KIDS;
2048 #ifdef PL_OP_SLAB_ALLOC
2056 prepend_elem(I32 type, OP *first, OP *last)
2064 if (last->op_type == type) {
2065 if (type == OP_LIST) { /* already a PUSHMARK there */
2066 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2067 ((LISTOP*)last)->op_first->op_sibling = first;
2070 if (!(last->op_flags & OPf_KIDS)) {
2071 ((LISTOP*)last)->op_last = first;
2072 last->op_flags |= OPf_KIDS;
2074 first->op_sibling = ((LISTOP*)last)->op_first;
2075 ((LISTOP*)last)->op_first = first;
2077 ((LISTOP*)last)->op_children++;
2081 return newLISTOP(type, 0, first, last);
2089 return newOP(OP_STUB, 0);
2095 if (!o || o->op_type != OP_LIST)
2096 o = newLISTOP(OP_LIST, 0, o, Nullop);
2102 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2106 NewOp(1101, listop, 1, LISTOP);
2108 listop->op_type = type;
2109 listop->op_ppaddr = PL_ppaddr[type];
2110 listop->op_children = (first != 0) + (last != 0);
2111 listop->op_flags = flags;
2115 else if (!first && last)
2118 first->op_sibling = last;
2119 listop->op_first = first;
2120 listop->op_last = last;
2121 if (type == OP_LIST) {
2123 pushop = newOP(OP_PUSHMARK, 0);
2124 pushop->op_sibling = first;
2125 listop->op_first = pushop;
2126 listop->op_flags |= OPf_KIDS;
2128 listop->op_last = pushop;
2130 else if (listop->op_children)
2131 listop->op_flags |= OPf_KIDS;
2137 newOP(I32 type, I32 flags)
2140 NewOp(1101, o, 1, OP);
2142 o->op_ppaddr = PL_ppaddr[type];
2143 o->op_flags = flags;
2146 o->op_private = 0 + (flags >> 8);
2147 if (PL_opargs[type] & OA_RETSCALAR)
2149 if (PL_opargs[type] & OA_TARGET)
2150 o->op_targ = pad_alloc(type, SVs_PADTMP);
2151 return CHECKOP(type, o);
2155 newUNOP(I32 type, I32 flags, OP *first)
2160 first = newOP(OP_STUB, 0);
2161 if (PL_opargs[type] & OA_MARK)
2162 first = force_list(first);
2164 NewOp(1101, unop, 1, UNOP);
2165 unop->op_type = type;
2166 unop->op_ppaddr = PL_ppaddr[type];
2167 unop->op_first = first;
2168 unop->op_flags = flags | OPf_KIDS;
2169 unop->op_private = 1 | (flags >> 8);
2170 unop = (UNOP*) CHECKOP(type, unop);
2174 return fold_constants((OP *) unop);
2178 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2181 NewOp(1101, binop, 1, BINOP);
2184 first = newOP(OP_NULL, 0);
2186 binop->op_type = type;
2187 binop->op_ppaddr = PL_ppaddr[type];
2188 binop->op_first = first;
2189 binop->op_flags = flags | OPf_KIDS;
2192 binop->op_private = 1 | (flags >> 8);
2195 binop->op_private = 2 | (flags >> 8);
2196 first->op_sibling = last;
2199 binop = (BINOP*)CHECKOP(type, binop);
2203 binop->op_last = binop->op_first->op_sibling;
2205 return fold_constants((OP *)binop);
2209 utf8compare(const void *a, const void *b)
2212 for (i = 0; i < 10; i++) {
2213 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2215 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2222 pmtrans(OP *o, OP *expr, OP *repl)
2224 SV *tstr = ((SVOP*)expr)->op_sv;
2225 SV *rstr = ((SVOP*)repl)->op_sv;
2228 register U8 *t = (U8*)SvPV(tstr, tlen);
2229 register U8 *r = (U8*)SvPV(rstr, rlen);
2235 register short *tbl;
2237 complement = o->op_private & OPpTRANS_COMPLEMENT;
2238 del = o->op_private & OPpTRANS_DELETE;
2239 squash = o->op_private & OPpTRANS_SQUASH;
2241 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2242 SV* listsv = newSVpvn("# comment\n",10);
2244 U8* tend = t + tlen;
2245 U8* rend = r + rlen;
2261 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2262 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2268 New(1109, cp, tlen, U8*);
2270 transv = newSVpvn("",0);
2279 qsort(cp, i, sizeof(U8*), utf8compare);
2280 for (j = 0; j < i; j++) {
2282 UV val = utf8_to_uv(s, &ulen);
2284 diff = val - nextmin;
2286 t = uv_to_utf8(tmpbuf,nextmin);
2287 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2289 t = uv_to_utf8(tmpbuf, val - 1);
2290 sv_catpvn(transv, "\377", 1);
2291 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2295 val = utf8_to_uv(s+1, &ulen);
2299 t = uv_to_utf8(tmpbuf,nextmin);
2300 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2301 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2302 sv_catpvn(transv, "\377", 1);
2303 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2304 t = (U8*)SvPVX(transv);
2305 tlen = SvCUR(transv);
2308 else if (!rlen && !del) {
2309 r = t; rlen = tlen; rend = tend;
2312 if (to_utf && from_utf) { /* only counting characters */
2313 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2314 o->op_private |= OPpTRANS_IDENTICAL;
2316 else { /* straight latin-1 translation */
2317 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2318 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2319 o->op_private |= OPpTRANS_IDENTICAL;
2323 while (t < tend || tfirst <= tlast) {
2324 /* see if we need more "t" chars */
2325 if (tfirst > tlast) {
2326 tfirst = (I32)utf8_to_uv(t, &ulen);
2328 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2329 tlast = (I32)utf8_to_uv(++t, &ulen);
2336 /* now see if we need more "r" chars */
2337 if (rfirst > rlast) {
2339 rfirst = (I32)utf8_to_uv(r, &ulen);
2341 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2342 rlast = (I32)utf8_to_uv(++r, &ulen);
2351 rfirst = rlast = 0xffffffff;
2355 /* now see which range will peter our first, if either. */
2356 tdiff = tlast - tfirst;
2357 rdiff = rlast - rfirst;
2364 if (rfirst == 0xffffffff) {
2365 diff = tdiff; /* oops, pretend rdiff is infinite */
2367 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2369 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2373 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2375 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2377 if (rfirst + diff > max)
2378 max = rfirst + diff;
2383 else if (rfirst <= 0x800)
2384 grows |= (tfirst < 0x80);
2385 else if (rfirst <= 0x10000)
2386 grows |= (tfirst < 0x800);
2387 else if (rfirst <= 0x200000)
2388 grows |= (tfirst < 0x10000);
2389 else if (rfirst <= 0x4000000)
2390 grows |= (tfirst < 0x200000);
2391 else if (rfirst <= 0x80000000)
2392 grows |= (tfirst < 0x4000000);
2404 else if (max > 0xff)
2409 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2410 SvREFCNT_dec(listsv);
2412 SvREFCNT_dec(transv);
2414 if (!del && havefinal)
2415 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2417 if (grows && to_utf)
2418 o->op_private |= OPpTRANS_GROWS;
2425 tbl = (short*)cPVOPo->op_pv;
2427 Zero(tbl, 256, short);
2428 for (i = 0; i < tlen; i++)
2430 for (i = 0, j = 0; i < 256; i++) {
2446 if (!rlen && !del) {
2449 o->op_private |= OPpTRANS_IDENTICAL;
2451 for (i = 0; i < 256; i++)
2453 for (i = 0, j = 0; i < tlen; i++,j++) {
2456 if (tbl[t[i]] == -1)
2462 if (tbl[t[i]] == -1)
2473 newPMOP(I32 type, I32 flags)
2478 NewOp(1101, pmop, 1, PMOP);
2479 pmop->op_type = type;
2480 pmop->op_ppaddr = PL_ppaddr[type];
2481 pmop->op_flags = flags;
2482 pmop->op_private = 0 | (flags >> 8);
2484 if (PL_hints & HINT_RE_TAINT)
2485 pmop->op_pmpermflags |= PMf_RETAINT;
2486 if (PL_hints & HINT_LOCALE)
2487 pmop->op_pmpermflags |= PMf_LOCALE;
2488 pmop->op_pmflags = pmop->op_pmpermflags;
2490 /* link into pm list */
2491 if (type != OP_TRANS && PL_curstash) {
2492 pmop->op_pmnext = HvPMROOT(PL_curstash);
2493 HvPMROOT(PL_curstash) = pmop;
2500 pmruntime(OP *o, OP *expr, OP *repl)
2505 I32 repl_has_vars = 0;
2507 if (o->op_type == OP_TRANS)
2508 return pmtrans(o, expr, repl);
2510 PL_hints |= HINT_BLOCK_SCOPE;
2513 if (expr->op_type == OP_CONST) {
2515 SV *pat = ((SVOP*)expr)->op_sv;
2516 char *p = SvPV(pat, plen);
2517 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2518 sv_setpvn(pat, "\\s+", 3);
2519 p = SvPV(pat, plen);
2520 pm->op_pmflags |= PMf_SKIPWHITE;
2522 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2523 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2524 pm->op_pmflags |= PMf_WHITE;
2528 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2529 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2531 : OP_REGCMAYBE),0,expr);
2533 NewOp(1101, rcop, 1, LOGOP);
2534 rcop->op_type = OP_REGCOMP;
2535 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2536 rcop->op_first = scalar(expr);
2537 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2538 ? (OPf_SPECIAL | OPf_KIDS)
2540 rcop->op_private = 1;
2543 /* establish postfix order */
2544 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2546 rcop->op_next = expr;
2547 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2550 rcop->op_next = LINKLIST(expr);
2551 expr->op_next = (OP*)rcop;
2554 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2559 if (pm->op_pmflags & PMf_EVAL) {
2561 if (PL_curcop->cop_line < PL_multi_end)
2562 PL_curcop->cop_line = PL_multi_end;
2565 else if (repl->op_type == OP_THREADSV
2566 && strchr("&`'123456789+",
2567 PL_threadsv_names[repl->op_targ]))
2571 #endif /* USE_THREADS */
2572 else if (repl->op_type == OP_CONST)
2576 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2577 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2579 if (curop->op_type == OP_THREADSV) {
2581 if (strchr("&`'123456789+", curop->op_private))
2585 if (curop->op_type == OP_GV) {
2586 GV *gv = ((GVOP*)curop)->op_gv;
2588 if (strchr("&`'123456789+", *GvENAME(gv)))
2591 #endif /* USE_THREADS */
2592 else if (curop->op_type == OP_RV2CV)
2594 else if (curop->op_type == OP_RV2SV ||
2595 curop->op_type == OP_RV2AV ||
2596 curop->op_type == OP_RV2HV ||
2597 curop->op_type == OP_RV2GV) {
2598 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2601 else if (curop->op_type == OP_PADSV ||
2602 curop->op_type == OP_PADAV ||
2603 curop->op_type == OP_PADHV ||
2604 curop->op_type == OP_PADANY) {
2607 else if (curop->op_type == OP_PUSHRE)
2608 ; /* Okay here, dangerous in newASSIGNOP */
2617 && (!pm->op_pmregexp
2618 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2619 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2620 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2621 prepend_elem(o->op_type, scalar(repl), o);
2624 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2625 pm->op_pmflags |= PMf_MAYBE_CONST;
2626 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2628 NewOp(1101, rcop, 1, LOGOP);
2629 rcop->op_type = OP_SUBSTCONT;
2630 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2631 rcop->op_first = scalar(repl);
2632 rcop->op_flags |= OPf_KIDS;
2633 rcop->op_private = 1;
2636 /* establish postfix order */
2637 rcop->op_next = LINKLIST(repl);
2638 repl->op_next = (OP*)rcop;
2640 pm->op_pmreplroot = scalar((OP*)rcop);
2641 pm->op_pmreplstart = LINKLIST(rcop);
2650 newSVOP(I32 type, I32 flags, SV *sv)
2653 NewOp(1101, svop, 1, SVOP);
2654 svop->op_type = type;
2655 svop->op_ppaddr = PL_ppaddr[type];
2657 svop->op_next = (OP*)svop;
2658 svop->op_flags = flags;
2659 if (PL_opargs[type] & OA_RETSCALAR)
2661 if (PL_opargs[type] & OA_TARGET)
2662 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2663 return CHECKOP(type, svop);
2667 newGVOP(I32 type, I32 flags, GV *gv)
2671 NewOp(1101, gvop, 1, GVOP);
2672 gvop->op_type = type;
2673 gvop->op_ppaddr = PL_ppaddr[type];
2674 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2675 gvop->op_next = (OP*)gvop;
2676 gvop->op_flags = flags;
2677 if (PL_opargs[type] & OA_RETSCALAR)
2679 if (PL_opargs[type] & OA_TARGET)
2680 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2681 return CHECKOP(type, gvop);
2685 newPVOP(I32 type, I32 flags, char *pv)
2688 NewOp(1101, pvop, 1, PVOP);
2689 pvop->op_type = type;
2690 pvop->op_ppaddr = PL_ppaddr[type];
2692 pvop->op_next = (OP*)pvop;
2693 pvop->op_flags = flags;
2694 if (PL_opargs[type] & OA_RETSCALAR)
2696 if (PL_opargs[type] & OA_TARGET)
2697 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2698 return CHECKOP(type, pvop);
2707 save_hptr(&PL_curstash);
2708 save_item(PL_curstname);
2713 name = SvPV(sv, len);
2714 PL_curstash = gv_stashpvn(name,len,TRUE);
2715 sv_setpvn(PL_curstname, name, len);
2719 sv_setpv(PL_curstname,"<none>");
2720 PL_curstash = Nullhv;
2722 PL_hints |= HINT_BLOCK_SCOPE;
2723 PL_copline = NOLINE;
2728 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2737 if (id->op_type != OP_CONST)
2738 croak("Module name must be constant");
2742 if(version != Nullop) {
2743 SV *vesv = ((SVOP*)version)->op_sv;
2745 if (arg == Nullop && !SvNIOK(vesv)) {
2752 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2753 croak("Version number must be constant number");
2755 /* Make copy of id so we don't free it twice */
2756 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2758 /* Fake up a method call to VERSION */
2759 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2760 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2761 append_elem(OP_LIST,
2762 prepend_elem(OP_LIST, pack, list(version)),
2763 newUNOP(OP_METHOD, 0, meth)));
2767 /* Fake up an import/unimport */
2768 if (arg && arg->op_type == OP_STUB)
2769 imop = arg; /* no import on explicit () */
2770 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2771 imop = Nullop; /* use 5.0; */
2774 /* Make copy of id so we don't free it twice */
2775 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2776 meth = newSVOP(OP_CONST, 0,
2778 ? newSVpvn("import", 6)
2779 : newSVpvn("unimport", 8)
2781 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2782 append_elem(OP_LIST,
2783 prepend_elem(OP_LIST, pack, list(arg)),
2784 newUNOP(OP_METHOD, 0, meth)));
2787 /* Fake up a require, handle override, if any */
2788 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2789 if (!(gv && GvIMPORTED_CV(gv)))
2790 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2792 if (gv && GvIMPORTED_CV(gv)) {
2793 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2794 append_elem(OP_LIST, id,
2795 scalar(newUNOP(OP_RV2CV, 0,
2800 rqop = newUNOP(OP_REQUIRE, 0, id);
2803 /* Fake up the BEGIN {}, which does its thing immediately. */
2805 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2807 append_elem(OP_LINESEQ,
2808 append_elem(OP_LINESEQ,
2809 newSTATEOP(0, Nullch, rqop),
2810 newSTATEOP(0, Nullch, veop)),
2811 newSTATEOP(0, Nullch, imop) ));
2813 PL_copline = NOLINE;
2823 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2824 if (!(gv && GvIMPORTED_CV(gv)))
2825 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2827 if (gv && GvIMPORTED_CV(gv)) {
2828 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2829 append_elem(OP_LIST, term,
2830 scalar(newUNOP(OP_RV2CV, 0,
2835 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2841 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2843 return newBINOP(OP_LSLICE, flags,
2844 list(force_list(subscript)),
2845 list(force_list(listval)) );
2849 list_assignment(register OP *o)
2854 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2855 o = cUNOPo->op_first;
2857 if (o->op_type == OP_COND_EXPR) {
2858 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2859 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2864 yyerror("Assignment to both a list and a scalar");
2868 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2869 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2870 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2873 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2876 if (o->op_type == OP_RV2SV)
2883 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2888 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2889 return newLOGOP(optype, 0,
2890 mod(scalar(left), optype),
2891 newUNOP(OP_SASSIGN, 0, scalar(right)));
2894 return newBINOP(optype, OPf_STACKED,
2895 mod(scalar(left), optype), scalar(right));
2899 if (list_assignment(left)) {
2902 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2903 left = mod(left, OP_AASSIGN);
2911 o = newBINOP(OP_AASSIGN, flags,
2912 list(force_list(right)),
2913 list(force_list(left)) );
2914 o->op_private = 0 | (flags >> 8);
2915 if (!(left->op_private & OPpLVAL_INTRO)) {
2919 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2920 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2921 if (curop->op_type == OP_GV) {
2922 GV *gv = ((GVOP*)curop)->op_gv;
2923 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2925 SvCUR(gv) = PL_generation;
2927 else if (curop->op_type == OP_PADSV ||
2928 curop->op_type == OP_PADAV ||
2929 curop->op_type == OP_PADHV ||
2930 curop->op_type == OP_PADANY) {
2931 SV **svp = AvARRAY(PL_comppad_name);
2932 SV *sv = svp[curop->op_targ];
2933 if (SvCUR(sv) == PL_generation)
2935 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2937 else if (curop->op_type == OP_RV2CV)
2939 else if (curop->op_type == OP_RV2SV ||
2940 curop->op_type == OP_RV2AV ||
2941 curop->op_type == OP_RV2HV ||
2942 curop->op_type == OP_RV2GV) {
2943 if (lastop->op_type != OP_GV) /* funny deref? */
2946 else if (curop->op_type == OP_PUSHRE) {
2947 if (((PMOP*)curop)->op_pmreplroot) {
2948 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2949 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2951 SvCUR(gv) = PL_generation;
2960 o->op_private = OPpASSIGN_COMMON;
2962 if (right && right->op_type == OP_SPLIT) {
2964 if ((tmpop = ((LISTOP*)right)->op_first) &&
2965 tmpop->op_type == OP_PUSHRE)
2967 PMOP *pm = (PMOP*)tmpop;
2968 if (left->op_type == OP_RV2AV &&
2969 !(left->op_private & OPpLVAL_INTRO) &&
2970 !(o->op_private & OPpASSIGN_COMMON) )
2972 tmpop = ((UNOP*)left)->op_first;
2973 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2974 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2975 pm->op_pmflags |= PMf_ONCE;
2976 tmpop = cUNOPo->op_first; /* to list (nulled) */
2977 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2978 tmpop->op_sibling = Nullop; /* don't free split */
2979 right->op_next = tmpop->op_next; /* fix starting loc */
2980 op_free(o); /* blow off assign */
2981 right->op_flags &= ~OPf_WANT;
2982 /* "I don't know and I don't care." */
2987 if (PL_modcount < 10000 &&
2988 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2990 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2992 sv_setiv(sv, PL_modcount+1);
3000 right = newOP(OP_UNDEF, 0);
3001 if (right->op_type == OP_READLINE) {
3002 right->op_flags |= OPf_STACKED;
3003 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3006 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3007 o = newBINOP(OP_SASSIGN, flags,
3008 scalar(right), mod(scalar(left), OP_SASSIGN) );
3020 newSTATEOP(I32 flags, char *label, OP *o)
3023 U32 seq = intro_my();
3026 NewOp(1101, cop, 1, COP);
3027 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3028 cop->op_type = OP_DBSTATE;
3029 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3032 cop->op_type = OP_NEXTSTATE;
3033 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3035 cop->op_flags = flags;
3036 cop->op_private = (PL_hints & HINT_UTF8);
3038 cop->op_private |= NATIVE_HINTS;
3040 PL_compiling.op_private = cop->op_private;
3041 cop->op_next = (OP*)cop;
3044 cop->cop_label = label;
3045 PL_hints |= HINT_BLOCK_SCOPE;
3048 cop->cop_arybase = PL_curcop->cop_arybase;
3049 if (PL_curcop->cop_warnings == WARN_NONE
3050 || PL_curcop->cop_warnings == WARN_ALL)
3051 cop->cop_warnings = PL_curcop->cop_warnings ;
3053 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3056 if (PL_copline == NOLINE)
3057 cop->cop_line = PL_curcop->cop_line;
3059 cop->cop_line = PL_copline;
3060 PL_copline = NOLINE;
3062 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3063 cop->cop_stash = PL_curstash;
3065 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3066 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3067 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3068 (void)SvIOK_on(*svp);
3070 SvSTASH(*svp) = (HV*)cop;
3074 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3077 /* "Introduce" my variables to visible status. */
3085 if (! PL_min_intro_pending)
3086 return PL_cop_seqmax;
3088 svp = AvARRAY(PL_comppad_name);
3089 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3090 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3091 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3092 SvNVX(sv) = (double)PL_cop_seqmax;
3095 PL_min_intro_pending = 0;
3096 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3097 return PL_cop_seqmax++;
3101 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3103 return new_logop(type, flags, &first, &other);
3107 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3112 OP *first = *firstp;
3113 OP *other = *otherp;
3115 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3116 return newBINOP(type, flags, scalar(first), scalar(other));
3118 scalarboolean(first);
3119 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3120 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3121 if (type == OP_AND || type == OP_OR) {
3127 first = *firstp = cUNOPo->op_first;
3129 first->op_next = o->op_next;
3130 cUNOPo->op_first = Nullop;
3134 if (first->op_type == OP_CONST) {
3135 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3136 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3138 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3149 else if (first->op_type == OP_WANTARRAY) {
3155 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3156 OP *k1 = ((UNOP*)first)->op_first;
3157 OP *k2 = k1->op_sibling;
3159 switch (first->op_type)
3162 if (k2 && k2->op_type == OP_READLINE
3163 && (k2->op_flags & OPf_STACKED)
3164 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3165 warnop = k2->op_type;
3169 if (k1->op_type == OP_READDIR
3170 || k1->op_type == OP_GLOB
3171 || k1->op_type == OP_EACH)
3172 warnop = k1->op_type;
3176 line_t oldline = PL_curcop->cop_line;
3177 PL_curcop->cop_line = PL_copline;
3179 "Value of %s%s can be \"0\"; test with defined()",
3181 ((warnop == OP_READLINE || warnop == OP_GLOB)
3182 ? " construct" : "() operator"));
3183 PL_curcop->cop_line = oldline;
3190 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3191 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3193 NewOp(1101, logop, 1, LOGOP);
3195 logop->op_type = type;
3196 logop->op_ppaddr = PL_ppaddr[type];
3197 logop->op_first = first;
3198 logop->op_flags = flags | OPf_KIDS;
3199 logop->op_other = LINKLIST(other);
3200 logop->op_private = 1 | (flags >> 8);
3202 /* establish postfix order */
3203 logop->op_next = LINKLIST(first);
3204 first->op_next = (OP*)logop;
3205 first->op_sibling = other;
3207 o = newUNOP(OP_NULL, 0, (OP*)logop);
3214 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3221 return newLOGOP(OP_AND, 0, first, trueop);
3223 return newLOGOP(OP_OR, 0, first, falseop);
3225 scalarboolean(first);
3226 if (first->op_type == OP_CONST) {
3227 if (SvTRUE(((SVOP*)first)->op_sv)) {
3238 else if (first->op_type == OP_WANTARRAY) {
3242 NewOp(1101, condop, 1, CONDOP);
3244 condop->op_type = OP_COND_EXPR;
3245 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3246 condop->op_first = first;
3247 condop->op_flags = flags | OPf_KIDS;
3248 condop->op_true = LINKLIST(trueop);
3249 condop->op_false = LINKLIST(falseop);
3250 condop->op_private = 1 | (flags >> 8);
3252 /* establish postfix order */
3253 condop->op_next = LINKLIST(first);
3254 first->op_next = (OP*)condop;
3256 first->op_sibling = trueop;
3257 trueop->op_sibling = falseop;
3258 o = newUNOP(OP_NULL, 0, (OP*)condop);
3260 trueop->op_next = o;
3261 falseop->op_next = o;
3267 newRANGE(I32 flags, OP *left, OP *right)
3275 NewOp(1101, condop, 1, CONDOP);
3277 condop->op_type = OP_RANGE;
3278 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3279 condop->op_first = left;
3280 condop->op_flags = OPf_KIDS;
3281 condop->op_true = LINKLIST(left);
3282 condop->op_false = LINKLIST(right);
3283 condop->op_private = 1 | (flags >> 8);
3285 left->op_sibling = right;
3287 condop->op_next = (OP*)condop;
3288 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3289 flop = newUNOP(OP_FLOP, 0, flip);
3290 o = newUNOP(OP_NULL, 0, flop);
3293 left->op_next = flip;
3294 right->op_next = flop;
3296 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3297 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3298 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3299 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3301 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3302 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3305 if (!flip->op_private || !flop->op_private)
3306 linklist(o); /* blow off optimizer unless constant */
3312 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3317 int once = block && block->op_flags & OPf_SPECIAL &&
3318 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3321 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3322 return block; /* do {} while 0 does once */
3323 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3324 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3325 expr = newUNOP(OP_DEFINED, 0,
3326 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3327 } else if (expr->op_flags & OPf_KIDS) {
3328 OP *k1 = ((UNOP*)expr)->op_first;
3329 OP *k2 = (k1) ? k1->op_sibling : NULL;
3330 switch (expr->op_type) {
3332 if (k2 && k2->op_type == OP_READLINE
3333 && (k2->op_flags & OPf_STACKED)
3334 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3335 expr = newUNOP(OP_DEFINED, 0, expr);
3339 if (k1->op_type == OP_READDIR
3340 || k1->op_type == OP_GLOB
3341 || k1->op_type == OP_EACH)
3342 expr = newUNOP(OP_DEFINED, 0, expr);
3348 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3349 o = new_logop(OP_AND, 0, &expr, &listop);
3352 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3354 if (once && o != listop)
3355 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3358 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3360 o->op_flags |= flags;
3362 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3367 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3376 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3377 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3378 expr = newUNOP(OP_DEFINED, 0,
3379 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3380 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3381 OP *k1 = ((UNOP*)expr)->op_first;
3382 OP *k2 = (k1) ? k1->op_sibling : NULL;
3383 switch (expr->op_type) {
3385 if (k2 && k2->op_type == OP_READLINE
3386 && (k2->op_flags & OPf_STACKED)
3387 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3388 expr = newUNOP(OP_DEFINED, 0, expr);
3392 if (k1->op_type == OP_READDIR
3393 || k1->op_type == OP_GLOB
3394 || k1->op_type == OP_EACH)
3395 expr = newUNOP(OP_DEFINED, 0, expr);
3401 block = newOP(OP_NULL, 0);
3404 next = LINKLIST(cont);
3406 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3407 if ((line_t)whileline != NOLINE) {
3408 PL_copline = whileline;
3409 cont = append_elem(OP_LINESEQ, cont,
3410 newSTATEOP(0, Nullch, Nullop));
3414 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3415 redo = LINKLIST(listop);
3418 PL_copline = whileline;
3420 o = new_logop(OP_AND, 0, &expr, &listop);
3421 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3422 op_free(expr); /* oops, it's a while (0) */
3424 return Nullop; /* listop already freed by new_logop */
3427 ((LISTOP*)listop)->op_last->op_next = condop =
3428 (o == listop ? redo : LINKLIST(o));
3436 NewOp(1101,loop,1,LOOP);
3437 loop->op_type = OP_ENTERLOOP;
3438 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3439 loop->op_private = 0;
3440 loop->op_next = (OP*)loop;
3443 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3445 loop->op_redoop = redo;
3446 loop->op_lastop = o;
3449 loop->op_nextop = next;
3451 loop->op_nextop = o;
3453 o->op_flags |= flags;
3454 o->op_private |= (flags >> 8);
3459 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3468 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3469 sv->op_type = OP_RV2GV;
3470 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3472 else if (sv->op_type == OP_PADSV) { /* private variable */
3473 padoff = sv->op_targ;
3477 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3478 padoff = sv->op_targ;
3479 iterflags |= OPf_SPECIAL;
3484 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3488 padoff = find_threadsv("_");
3489 iterflags |= OPf_SPECIAL;
3491 sv = newGVOP(OP_GV, 0, PL_defgv);
3494 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3495 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3496 iterflags |= OPf_STACKED;
3498 else if (expr->op_type == OP_NULL &&
3499 (expr->op_flags & OPf_KIDS) &&
3500 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3502 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3503 * set the STACKED flag to indicate that these values are to be
3504 * treated as min/max values by 'pp_iterinit'.
3506 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3507 CONDOP* range = (CONDOP*) flip->op_first;
3508 OP* left = range->op_first;
3509 OP* right = left->op_sibling;
3512 range->op_flags &= ~OPf_KIDS;
3513 range->op_first = Nullop;
3515 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3516 listop->op_first->op_next = range->op_true;
3517 left->op_next = range->op_false;
3518 right->op_next = (OP*)listop;
3519 listop->op_next = listop->op_first;
3522 expr = (OP*)(listop);
3524 iterflags |= OPf_STACKED;
3527 expr = mod(force_list(expr), OP_GREPSTART);
3531 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3532 append_elem(OP_LIST, expr, scalar(sv))));
3533 assert(!loop->op_next);
3534 #ifdef PL_OP_SLAB_ALLOC
3535 NewOp(1234,tmp,1,LOOP);
3536 Copy(loop,tmp,1,LOOP);
3539 Renew(loop, 1, LOOP);
3541 loop->op_targ = padoff;
3542 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3543 PL_copline = forline;
3544 return newSTATEOP(0, label, wop);
3548 newLOOPEX(I32 type, OP *label)
3554 if (type != OP_GOTO || label->op_type == OP_CONST) {
3555 /* "last()" means "last" */
3556 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3557 o = newOP(type, OPf_SPECIAL);
3559 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3560 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3566 if (label->op_type == OP_ENTERSUB)
3567 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3568 o = newUNOP(type, OPf_STACKED, label);
3570 PL_hints |= HINT_BLOCK_SCOPE;
3580 MUTEX_DESTROY(CvMUTEXP(cv));
3581 Safefree(CvMUTEXP(cv));
3584 #endif /* USE_THREADS */
3586 if (!CvXSUB(cv) && CvROOT(cv)) {
3588 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3589 croak("Can't undef active subroutine");
3592 croak("Can't undef active subroutine");
3593 #endif /* USE_THREADS */
3596 SAVESPTR(PL_curpad);
3600 op_free(CvROOT(cv));
3601 CvROOT(cv) = Nullop;
3604 SvPOK_off((SV*)cv); /* forget prototype */
3606 SvREFCNT_dec(CvGV(cv));
3608 SvREFCNT_dec(CvOUTSIDE(cv));
3609 CvOUTSIDE(cv) = Nullcv;
3610 if (CvPADLIST(cv)) {
3611 /* may be during global destruction */
3612 if (SvREFCNT(CvPADLIST(cv))) {
3613 I32 i = AvFILLp(CvPADLIST(cv));
3615 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3616 SV* sv = svp ? *svp : Nullsv;
3619 if (sv == (SV*)PL_comppad_name)
3620 PL_comppad_name = Nullav;
3621 else if (sv == (SV*)PL_comppad) {
3622 PL_comppad = Nullav;
3623 PL_curpad = Null(SV**);
3627 SvREFCNT_dec((SV*)CvPADLIST(cv));
3629 CvPADLIST(cv) = Nullav;
3633 #ifdef DEBUG_CLOSURES
3638 CV *outside = CvOUTSIDE(cv);
3639 AV* padlist = CvPADLIST(cv);
3646 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3648 (CvANON(cv) ? "ANON"
3649 : (cv == PL_main_cv) ? "MAIN"
3650 : CvUNIQUE(cv) ? "UNIQUE"
3651 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3654 : CvANON(outside) ? "ANON"
3655 : (outside == PL_main_cv) ? "MAIN"
3656 : CvUNIQUE(outside) ? "UNIQUE"
3657 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3662 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3663 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3664 pname = AvARRAY(pad_name);
3665 ppad = AvARRAY(pad);
3667 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3668 if (SvPOK(pname[ix]))
3669 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3671 SvFAKE(pname[ix]) ? "FAKE " : "",
3673 (long)I_32(SvNVX(pname[ix])),
3674 (long)SvIVX(pname[ix]));
3677 #endif /* DEBUG_CLOSURES */
3680 cv_clone2(CV *proto, CV *outside)
3685 AV* protopadlist = CvPADLIST(proto);
3686 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3687 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3688 SV** pname = AvARRAY(protopad_name);
3689 SV** ppad = AvARRAY(protopad);
3690 I32 fname = AvFILLp(protopad_name);
3691 I32 fpad = AvFILLp(protopad);
3695 assert(!CvUNIQUE(proto));
3698 SAVESPTR(PL_curpad);
3699 SAVESPTR(PL_comppad);
3700 SAVESPTR(PL_comppad_name);
3701 SAVESPTR(PL_compcv);
3703 cv = PL_compcv = (CV*)NEWSV(1104,0);
3704 sv_upgrade((SV *)cv, SvTYPE(proto));
3710 New(666, CvMUTEXP(cv), 1, perl_mutex);
3711 MUTEX_INIT(CvMUTEXP(cv));
3713 #endif /* USE_THREADS */
3714 CvFILEGV(cv) = CvFILEGV(proto);
3715 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3716 CvSTASH(cv) = CvSTASH(proto);
3717 CvROOT(cv) = CvROOT(proto);
3718 CvSTART(cv) = CvSTART(proto);
3720 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3723 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3725 PL_comppad_name = newAV();
3726 for (ix = fname; ix >= 0; ix--)
3727 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3729 PL_comppad = newAV();
3731 comppadlist = newAV();
3732 AvREAL_off(comppadlist);
3733 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3734 av_store(comppadlist, 1, (SV*)PL_comppad);
3735 CvPADLIST(cv) = comppadlist;
3736 av_fill(PL_comppad, AvFILLp(protopad));
3737 PL_curpad = AvARRAY(PL_comppad);
3739 av = newAV(); /* will be @_ */
3741 av_store(PL_comppad, 0, (SV*)av);
3742 AvFLAGS(av) = AVf_REIFY;
3744 for (ix = fpad; ix > 0; ix--) {
3745 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3746 if (namesv && namesv != &PL_sv_undef) {
3747 char *name = SvPVX(namesv); /* XXX */
3748 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3749 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3750 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3752 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3754 croak("panic: cv_clone: %s", name);
3756 else { /* our own lexical */
3759 /* anon code -- we'll come back for it */
3760 sv = SvREFCNT_inc(ppad[ix]);
3762 else if (*name == '@')
3764 else if (*name == '%')
3774 SV* sv = NEWSV(0,0);
3780 /* Now that vars are all in place, clone nested closures. */
3782 for (ix = fpad; ix > 0; ix--) {
3783 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3785 && namesv != &PL_sv_undef
3786 && !(SvFLAGS(namesv) & SVf_FAKE)
3787 && *SvPVX(namesv) == '&'
3788 && CvCLONE(ppad[ix]))
3790 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3791 SvREFCNT_dec(ppad[ix]);
3794 PL_curpad[ix] = (SV*)kid;
3798 #ifdef DEBUG_CLOSURES
3799 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3801 PerlIO_printf(Perl_debug_log, " from:\n");
3803 PerlIO_printf(Perl_debug_log, " to:\n");
3815 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3816 cv = cv_clone2(proto, CvOUTSIDE(proto));
3817 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3822 cv_ckproto(CV *cv, GV *gv, char *p)
3824 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3825 SV* msg = sv_newmortal();
3829 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3830 sv_setpv(msg, "Prototype mismatch:");
3832 sv_catpvf(msg, " sub %_", name);
3834 sv_catpvf(msg, " (%s)", SvPVX(cv));
3835 sv_catpv(msg, " vs ");
3837 sv_catpvf(msg, "(%s)", p);
3839 sv_catpv(msg, "none");
3847 if (!cv || !SvPOK(cv) || SvCUR(cv))
3849 return op_const_sv(CvSTART(cv), cv);
3853 op_const_sv(OP *o, CV *cv)
3860 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3861 o = cLISTOPo->op_first->op_sibling;
3863 for (; o; o = o->op_next) {
3864 OPCODE type = o->op_type;
3866 if(sv && o->op_next == o)
3868 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3870 if (type == OP_LEAVESUB || type == OP_RETURN)
3874 if (type == OP_CONST)
3876 else if (type == OP_PADSV && cv) {
3877 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3878 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3879 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3891 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3895 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3896 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3897 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3898 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3907 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3908 maximum a prototype before. */
3909 if (SvTYPE(gv) > SVt_NULL) {
3910 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3911 warn("Runaway prototype");
3912 cv_ckproto((CV*)gv, NULL, ps);
3915 sv_setpv((SV*)gv, ps);
3917 sv_setiv((SV*)gv, -1);
3918 SvREFCNT_dec(PL_compcv);
3919 cv = PL_compcv = NULL;
3920 PL_sub_generation++;
3924 if (!name || GvCVGEN(gv))
3926 else if (cv = GvCV(gv)) {
3927 cv_ckproto(cv, gv, ps);
3928 /* already defined (or promised)? */
3929 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3931 bool const_changed = TRUE;
3933 /* just a "sub foo;" when &foo is already defined */
3934 SAVEFREESV(PL_compcv);
3937 /* ahem, death to those who redefine active sort subs */
3938 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3939 croak("Can't redefine active sort subroutine %s", name);
3940 if(const_sv = cv_const_sv(cv))
3941 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3942 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3943 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3944 && HvNAME(GvSTASH(CvGV(cv)))
3945 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3947 line_t oldline = PL_curcop->cop_line;
3948 PL_curcop->cop_line = PL_copline;
3949 warner(WARN_REDEFINE,
3950 const_sv ? "Constant subroutine %s redefined"
3951 : "Subroutine %s redefined", name);
3952 PL_curcop->cop_line = oldline;
3958 if (cv) { /* must reuse cv if autoloaded */
3960 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3961 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3962 CvOUTSIDE(PL_compcv) = 0;
3963 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3964 CvPADLIST(PL_compcv) = 0;
3965 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3966 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3967 SvREFCNT_dec(PL_compcv);
3974 PL_sub_generation++;
3977 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3978 CvFILEGV(cv) = PL_curcop->cop_filegv;
3979 CvSTASH(cv) = PL_curstash;
3982 if (!CvMUTEXP(cv)) {
3983 New(666, CvMUTEXP(cv), 1, perl_mutex);
3984 MUTEX_INIT(CvMUTEXP(cv));
3986 #endif /* USE_THREADS */
3989 sv_setpv((SV*)cv, ps);
3991 if (PL_error_count) {
3995 char *s = strrchr(name, ':');
3997 if (strEQ(s, "BEGIN")) {
3999 "BEGIN not safe after errors--compilation aborted";
4003 /* force display of errors found but not reported */
4004 sv_catpv(ERRSV, not_safe);
4005 croak("%s", SvPVx(ERRSV, n_a));
4012 PL_copline = NOLINE;
4017 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4018 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4021 SV **namep = AvARRAY(PL_comppad_name);
4022 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4025 if (SvIMMORTAL(PL_curpad[ix]))
4028 * The only things that a clonable function needs in its
4029 * pad are references to outer lexicals and anonymous subs.
4030 * The rest are created anew during cloning.
4032 if (!((namesv = namep[ix]) != Nullsv &&
4033 namesv != &PL_sv_undef &&
4035 *SvPVX(namesv) == '&')))
4037 SvREFCNT_dec(PL_curpad[ix]);
4038 PL_curpad[ix] = Nullsv;
4043 AV *av = newAV(); /* Will be @_ */
4045 av_store(PL_comppad, 0, (SV*)av);
4046 AvFLAGS(av) = AVf_REIFY;
4048 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4049 if (SvIMMORTAL(PL_curpad[ix]))
4051 if (!SvPADMY(PL_curpad[ix]))
4052 SvPADTMP_on(PL_curpad[ix]);
4056 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4057 CvSTART(cv) = LINKLIST(CvROOT(cv));
4058 CvROOT(cv)->op_next = 0;
4064 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4065 SV *sv = NEWSV(0,0);
4066 SV *tmpstr = sv_newmortal();
4067 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4071 sv_setpvf(sv, "%_:%ld-%ld",
4072 GvSV(PL_curcop->cop_filegv),
4073 (long)PL_subline, (long)PL_curcop->cop_line);
4074 gv_efullname3(tmpstr, gv, Nullch);
4075 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4076 hv = GvHVn(db_postponed);
4077 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4078 && (cv = GvCV(db_postponed))) {
4083 perl_call_sv((SV*)cv, G_DISCARD);
4087 if ((s = strrchr(name,':')))
4091 if (strEQ(s, "BEGIN")) {
4092 I32 oldscope = PL_scopestack_ix;
4094 SAVESPTR(PL_compiling.cop_filegv);
4095 SAVEI16(PL_compiling.cop_line);
4097 sv_setsv(PL_rs, PL_nrs);
4100 PL_beginav = newAV();
4101 DEBUG_x( dump_sub(gv) );
4102 av_push(PL_beginav, (SV *)cv);
4104 call_list(oldscope, PL_beginav);
4106 PL_curcop = &PL_compiling;
4107 PL_compiling.op_private = PL_hints;
4110 else if (strEQ(s, "END") && !PL_error_count) {
4113 av_unshift(PL_endav, 1);
4114 av_store(PL_endav, 0, (SV *)cv);
4117 else if (strEQ(s, "INIT") && !PL_error_count) {
4119 PL_initav = newAV();
4120 av_push(PL_initav, SvREFCNT_inc(cv));
4126 PL_copline = NOLINE;
4131 /* XXX unsafe for threads if eval_owner isn't held */
4133 newCONSTSUB(HV *stash, char *name, SV *sv)
4136 U32 oldhints = PL_hints;
4137 HV *old_cop_stash = PL_curcop->cop_stash;
4138 HV *old_curstash = PL_curstash;
4139 line_t oldline = PL_curcop->cop_line;
4140 PL_curcop->cop_line = PL_copline;
4142 PL_hints &= ~HINT_BLOCK_SCOPE;
4144 PL_curstash = PL_curcop->cop_stash = stash;
4147 start_subparse(FALSE, 0),
4148 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4149 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4150 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4153 PL_hints = oldhints;
4154 PL_curcop->cop_stash = old_cop_stash;
4155 PL_curstash = old_curstash;
4156 PL_curcop->cop_line = oldline;
4160 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4163 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4166 if (cv = (name ? GvCV(gv) : Nullcv)) {
4168 /* just a cached method */
4172 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4173 /* already defined (or promised) */
4174 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4175 && HvNAME(GvSTASH(CvGV(cv)))
4176 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4177 line_t oldline = PL_curcop->cop_line;
4178 if (PL_copline != NOLINE)
4179 PL_curcop->cop_line = PL_copline;
4180 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4181 PL_curcop->cop_line = oldline;
4188 if (cv) /* must reuse cv if autoloaded */
4191 cv = (CV*)NEWSV(1105,0);
4192 sv_upgrade((SV *)cv, SVt_PVCV);
4196 PL_sub_generation++;
4199 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4201 New(666, CvMUTEXP(cv), 1, perl_mutex);
4202 MUTEX_INIT(CvMUTEXP(cv));
4204 #endif /* USE_THREADS */
4205 CvFILEGV(cv) = gv_fetchfile(filename);
4206 CvXSUB(cv) = subaddr;
4209 char *s = strrchr(name,':');
4214 if (strEQ(s, "BEGIN")) {
4216 PL_beginav = newAV();
4217 av_push(PL_beginav, (SV *)cv);
4220 else if (strEQ(s, "END")) {
4223 av_unshift(PL_endav, 1);
4224 av_store(PL_endav, 0, (SV *)cv);
4227 else if (strEQ(s, "INIT")) {
4229 PL_initav = newAV();
4230 av_push(PL_initav, (SV *)cv);
4241 newFORM(I32 floor, OP *o, OP *block)
4251 name = SvPVx(cSVOPo->op_sv, n_a);
4254 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4256 if (cv = GvFORM(gv)) {
4257 if (ckWARN(WARN_REDEFINE)) {
4258 line_t oldline = PL_curcop->cop_line;
4260 PL_curcop->cop_line = PL_copline;
4261 warner(WARN_REDEFINE, "Format %s redefined",name);
4262 PL_curcop->cop_line = oldline;
4268 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4269 CvFILEGV(cv) = PL_curcop->cop_filegv;
4271 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4272 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4273 SvPADTMP_on(PL_curpad[ix]);
4276 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4277 CvSTART(cv) = LINKLIST(CvROOT(cv));
4278 CvROOT(cv)->op_next = 0;
4281 PL_copline = NOLINE;
4288 return newUNOP(OP_REFGEN, 0,
4289 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4295 return newUNOP(OP_REFGEN, 0,
4296 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4300 newANONSUB(I32 floor, OP *proto, OP *block)
4302 return newUNOP(OP_REFGEN, 0,
4303 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4309 switch (o->op_type) {
4311 o->op_type = OP_PADAV;
4312 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4313 return ref(o, OP_RV2AV);
4316 o->op_type = OP_RV2AV;
4317 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4322 warn("oops: oopsAV");
4331 switch (o->op_type) {
4334 o->op_type = OP_PADHV;
4335 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4336 return ref(o, OP_RV2HV);
4340 o->op_type = OP_RV2HV;
4341 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4346 warn("oops: oopsHV");
4355 if (o->op_type == OP_PADANY) {
4356 o->op_type = OP_PADAV;
4357 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4360 return newUNOP(OP_RV2AV, 0, scalar(o));
4364 newGVREF(I32 type, OP *o)
4366 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4367 return newUNOP(OP_NULL, 0, o);
4368 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4374 if (o->op_type == OP_PADANY) {
4375 o->op_type = OP_PADHV;
4376 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4379 return newUNOP(OP_RV2HV, 0, scalar(o));
4385 croak("NOT IMPL LINE %d",__LINE__);
4391 newCVREF(I32 flags, OP *o)
4393 return newUNOP(OP_RV2CV, flags, scalar(o));
4399 if (o->op_type == OP_PADANY) {
4400 o->op_type = OP_PADSV;
4401 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4404 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4405 o->op_flags |= OPpDONE_SVREF;
4408 return newUNOP(OP_RV2SV, 0, scalar(o));
4411 /* Check routines. */
4419 name = NEWSV(1106,0);
4420 sv_upgrade(name, SVt_PVNV);
4421 sv_setpvn(name, "&", 1);
4424 ix = pad_alloc(o->op_type, SVs_PADMY);
4425 av_store(PL_comppad_name, ix, name);
4426 av_store(PL_comppad, ix, cSVOPo->op_sv);
4427 SvPADMY_on(cSVOPo->op_sv);
4428 cSVOPo->op_sv = Nullsv;
4429 cSVOPo->op_targ = ix;
4436 o->op_private = PL_hints;
4443 if (cUNOPo->op_first->op_type == OP_CONCAT)
4444 o->op_flags |= OPf_STACKED;
4451 if (o->op_flags & OPf_KIDS) {
4454 OPCODE type = o->op_type;
4455 o = modkids(ck_fun(o), type);
4456 kid = cUNOPo->op_first;
4457 newop = kUNOP->op_first->op_sibling;
4459 (newop->op_sibling ||
4460 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4461 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4462 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4466 op_free(kUNOP->op_first);
4467 kUNOP->op_first = newop;
4469 o->op_ppaddr = PL_ppaddr[++o->op_type];
4478 if (o->op_flags & OPf_KIDS) {
4479 OP *kid = cUNOPo->op_first;
4480 if (kid->op_type == OP_HSLICE)
4481 o->op_private |= OPpSLICE;
4482 else if (kid->op_type != OP_HELEM)
4483 croak("%s argument is not a HASH element or slice",
4484 PL_op_desc[o->op_type]);
4493 I32 type = o->op_type;
4495 if (o->op_flags & OPf_KIDS) {
4496 if (cLISTOPo->op_first->op_type == OP_STUB) {
4498 o = newUNOP(type, OPf_SPECIAL,
4499 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4509 PL_hints |= HINT_BLOCK_SCOPE;
4510 if (o->op_flags & OPf_KIDS) {
4511 SVOP *kid = (SVOP*)cUNOPo->op_first;
4514 o->op_flags &= ~OPf_KIDS;
4517 else if (kid->op_type == OP_LINESEQ) {
4520 kid->op_next = o->op_next;
4521 cUNOPo->op_first = 0;
4524 NewOp(1101, enter, 1, LOGOP);
4525 enter->op_type = OP_ENTERTRY;
4526 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4527 enter->op_private = 0;
4529 /* establish postfix order */
4530 enter->op_next = (OP*)enter;
4532 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4533 o->op_type = OP_LEAVETRY;
4534 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4535 enter->op_other = o;
4543 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4545 o->op_targ = (PADOFFSET)PL_hints;
4553 if (o->op_flags & OPf_STACKED) {
4555 kid = cUNOPo->op_first->op_sibling;
4556 if (kid->op_type == OP_RV2GV)
4568 if (o->op_flags & OPf_KIDS) {
4569 OP *kid = cUNOPo->op_first;
4570 if (kid->op_type != OP_HELEM)
4571 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4579 ck_gvconst(register OP *o)
4581 o = fold_constants(o);
4582 if (o->op_type == OP_CONST)
4589 ck_rvconst(register OP *o)
4592 SVOP *kid = (SVOP*)cUNOPo->op_first;
4594 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4595 if (kid->op_type == OP_CONST) {
4599 SV *kidsv = kid->op_sv;
4602 /* Is it a constant from cv_const_sv()? */
4603 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4604 SV *rsv = SvRV(kidsv);
4605 int svtype = SvTYPE(rsv);
4606 char *badtype = Nullch;
4608 switch (o->op_type) {
4610 if (svtype > SVt_PVMG)
4611 badtype = "a SCALAR";
4614 if (svtype != SVt_PVAV)
4615 badtype = "an ARRAY";
4618 if (svtype != SVt_PVHV) {
4619 if (svtype == SVt_PVAV) { /* pseudohash? */
4620 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4621 if (ksv && SvROK(*ksv)
4622 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4631 if (svtype != SVt_PVCV)
4636 croak("Constant is not %s reference", badtype);
4639 name = SvPV(kidsv, n_a);
4640 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4641 char *badthing = Nullch;
4642 switch (o->op_type) {
4644 badthing = "a SCALAR";
4647 badthing = "an ARRAY";
4650 badthing = "a HASH";
4655 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4659 * This is a little tricky. We only want to add the symbol if we
4660 * didn't add it in the lexer. Otherwise we get duplicate strict
4661 * warnings. But if we didn't add it in the lexer, we must at
4662 * least pretend like we wanted to add it even if it existed before,
4663 * or we get possible typo warnings. OPpCONST_ENTERED says
4664 * whether the lexer already added THIS instance of this symbol.
4666 iscv = (o->op_type == OP_RV2CV) * 2;
4668 gv = gv_fetchpv(name,
4669 iscv | !(kid->op_private & OPpCONST_ENTERED),
4672 : o->op_type == OP_RV2SV
4674 : o->op_type == OP_RV2AV
4676 : o->op_type == OP_RV2HV
4679 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4681 kid->op_type = OP_GV;
4682 SvREFCNT_dec(kid->op_sv);
4683 kid->op_sv = SvREFCNT_inc(gv);
4693 I32 type = o->op_type;
4695 if (o->op_flags & OPf_REF)
4698 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4699 SVOP *kid = (SVOP*)cUNOPo->op_first;
4701 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4703 OP *newop = newGVOP(type, OPf_REF,
4704 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4711 if (type == OP_FTTTY)
4712 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4715 return newUNOP(type, 0, newDEFSVOP());
4728 int type = o->op_type;
4729 register I32 oa = PL_opargs[type] >> OASHIFT;
4731 if (o->op_flags & OPf_STACKED) {
4732 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4735 return no_fh_allowed(o);
4738 if (o->op_flags & OPf_KIDS) {
4740 tokid = &cLISTOPo->op_first;
4741 kid = cLISTOPo->op_first;
4742 if (kid->op_type == OP_PUSHMARK ||
4743 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4745 tokid = &kid->op_sibling;
4746 kid = kid->op_sibling;
4748 if (!kid && PL_opargs[type] & OA_DEFGV)
4749 *tokid = kid = newDEFSVOP();
4753 sibl = kid->op_sibling;
4756 /* list seen where single (scalar) arg expected? */
4757 if (numargs == 1 && !(oa >> 4)
4758 && kid->op_type == OP_LIST && type != OP_SCALAR)
4760 return too_many_arguments(o,PL_op_desc[type]);
4773 if (kid->op_type == OP_CONST &&
4774 (kid->op_private & OPpCONST_BARE))
4776 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4777 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4778 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4779 if (ckWARN(WARN_SYNTAX))
4781 "Array @%s missing the @ in argument %ld of %s()",
4782 name, (long)numargs, PL_op_desc[type]);
4785 kid->op_sibling = sibl;
4788 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4789 bad_type(numargs, "array", PL_op_desc[type], kid);
4793 if (kid->op_type == OP_CONST &&
4794 (kid->op_private & OPpCONST_BARE))
4796 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4797 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4798 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4799 if (ckWARN(WARN_SYNTAX))
4801 "Hash %%%s missing the %% in argument %ld of %s()",
4802 name, (long)numargs, PL_op_desc[type]);
4805 kid->op_sibling = sibl;
4808 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4809 bad_type(numargs, "hash", PL_op_desc[type], kid);
4814 OP *newop = newUNOP(OP_NULL, 0, kid);
4815 kid->op_sibling = 0;
4817 newop->op_next = newop;
4819 kid->op_sibling = sibl;
4824 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4825 if (kid->op_type == OP_CONST &&
4826 (kid->op_private & OPpCONST_BARE))
4828 OP *newop = newGVOP(OP_GV, 0,
4829 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4834 else if (kid->op_type == OP_READLINE) {
4835 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4836 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4839 I32 flags = OPf_SPECIAL;
4841 /* is this op a FH constructor? */
4842 if (is_handle_constructor(o,numargs)) {
4844 /* Set a flag to tell rv2gv to vivify
4845 * need to "prove" flag does not mean something
4846 * else already - NI-S 1999/05/07
4850 /* Helps with open($array[$n],...)
4851 but is too simplistic - need to do selectively
4856 kid->op_sibling = 0;
4857 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4859 kid->op_private |= priv;
4862 kid->op_sibling = sibl;
4868 mod(scalar(kid), type);
4872 tokid = &kid->op_sibling;
4873 kid = kid->op_sibling;
4875 o->op_private |= numargs;
4877 return too_many_arguments(o,PL_op_desc[o->op_type]);
4880 else if (PL_opargs[type] & OA_DEFGV) {
4882 return newUNOP(type, 0, newDEFSVOP());
4886 while (oa & OA_OPTIONAL)
4888 if (oa && oa != OA_LIST)
4889 return too_few_arguments(o,PL_op_desc[o->op_type]);
4899 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4900 append_elem(OP_GLOB, o, newDEFSVOP());
4902 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4903 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4905 if (gv && GvIMPORTED_CV(gv)) {
4906 append_elem(OP_GLOB, o,
4907 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4908 o->op_type = OP_LIST;
4909 o->op_ppaddr = PL_ppaddr[OP_LIST];
4910 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4911 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4912 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4913 append_elem(OP_LIST, o,
4914 scalar(newUNOP(OP_RV2CV, 0,
4915 newGVOP(OP_GV, 0, gv)))));
4916 o = newUNOP(OP_NULL, 0, ck_subr(o));
4917 o->op_targ = OP_GLOB; /* hint at what it used to be */
4920 gv = newGVgen("main");
4922 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4932 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4934 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4935 NewOp(1101, gwop, 1, LOGOP);
4937 if (o->op_flags & OPf_STACKED) {
4940 kid = cLISTOPo->op_first->op_sibling;
4941 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4944 kid->op_next = (OP*)gwop;
4945 o->op_flags &= ~OPf_STACKED;
4947 kid = cLISTOPo->op_first->op_sibling;
4948 if (type == OP_MAPWHILE)
4955 kid = cLISTOPo->op_first->op_sibling;
4956 if (kid->op_type != OP_NULL)
4957 croak("panic: ck_grep");
4958 kid = kUNOP->op_first;
4960 gwop->op_type = type;
4961 gwop->op_ppaddr = PL_ppaddr[type];
4962 gwop->op_first = listkids(o);
4963 gwop->op_flags |= OPf_KIDS;
4964 gwop->op_private = 1;
4965 gwop->op_other = LINKLIST(kid);
4966 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4967 kid->op_next = (OP*)gwop;
4969 kid = cLISTOPo->op_first->op_sibling;
4970 if (!kid || !kid->op_sibling)
4971 return too_few_arguments(o,PL_op_desc[o->op_type]);
4972 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4973 mod(kid, OP_GREPSTART);
4981 if (o->op_flags & OPf_KIDS) {
4982 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4984 kid = kid->op_sibling; /* get past "big" */
4985 if (kid && kid->op_type == OP_CONST)
4986 fbm_compile(((SVOP*)kid)->op_sv, 0);
4992 ck_lengthconst(OP *o)
4994 /* XXX length optimization goes here */
5001 OPCODE type = o->op_type;
5002 return modkids(ck_fun(o), type);
5008 OPCODE type = o->op_type;
5009 return refkids(ck_fun(o), type);
5017 kid = cLISTOPo->op_first;
5020 kid = cLISTOPo->op_first;
5022 if (kid->op_type == OP_PUSHMARK)
5023 kid = kid->op_sibling;
5024 if (kid && o->op_flags & OPf_STACKED)
5025 kid = kid->op_sibling;
5026 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5027 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5028 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5029 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5030 cLISTOPo->op_first->op_sibling = kid;
5031 cLISTOPo->op_last = kid;
5032 kid = kid->op_sibling;
5037 append_elem(o->op_type, o, newDEFSVOP());
5043 if (PL_hints & HINT_LOCALE)
5044 o->op_private |= OPpLOCALE;
5051 ck_fun_locale(OP *o)
5057 if (PL_hints & HINT_LOCALE)
5058 o->op_private |= OPpLOCALE;
5069 if (PL_hints & HINT_LOCALE)
5070 o->op_private |= OPpLOCALE;
5079 o->op_private |= OPpRUNTIME;
5092 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5093 o->op_private |= OPpREPEAT_DOLIST;
5094 cBINOPo->op_first = force_list(cBINOPo->op_first);
5104 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5105 SVOP *kid = (SVOP*)cUNOPo->op_first;
5107 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5109 for (s = SvPVX(kid->op_sv); *s; s++) {
5110 if (*s == ':' && s[1] == ':') {
5112 Move(s+2, s+1, strlen(s+2)+1, char);
5113 --SvCUR(kid->op_sv);
5116 sv_catpvn(kid->op_sv, ".pm", 3);
5126 croak("NOT IMPL LINE %d",__LINE__);
5136 if (o->op_flags & OPf_KIDS) {
5137 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5138 if (kid && kid->op_sibling) {
5139 o->op_type = OP_SSELECT;
5140 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5142 return fold_constants(o);
5146 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5147 if (kid && kid->op_type == OP_RV2GV)
5148 kid->op_private &= ~HINT_STRICT_REFS;
5155 I32 type = o->op_type;
5157 if (!(o->op_flags & OPf_KIDS)) {
5162 if (!CvUNIQUE(PL_compcv)) {
5163 argop = newOP(OP_PADAV, OPf_REF);
5164 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5167 argop = newUNOP(OP_RV2AV, 0,
5168 scalar(newGVOP(OP_GV, 0,
5169 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5172 argop = newUNOP(OP_RV2AV, 0,
5173 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5174 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5175 #endif /* USE_THREADS */
5176 return newUNOP(type, 0, scalar(argop));
5178 return scalar(modkids(ck_fun(o), type));
5186 if (PL_hints & HINT_LOCALE)
5187 o->op_private |= OPpLOCALE;
5190 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5192 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5193 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5195 kid = kUNOP->op_first; /* get past null */
5197 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5199 if (kid->op_type == OP_SCOPE) {
5203 else if (kid->op_type == OP_LEAVE) {
5204 if (o->op_type == OP_SORT) {
5205 null(kid); /* wipe out leave */
5208 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5209 if (k->op_next == kid)
5214 kid->op_next = 0; /* just disconnect the leave */
5215 k = kLISTOP->op_first;
5219 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5220 if (o->op_type == OP_SORT)
5224 o->op_flags |= OPf_SPECIAL;
5226 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5227 null(cLISTOPo->op_first->op_sibling);
5234 simplify_sort(OP *o)
5237 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5240 if (!(o->op_flags & OPf_STACKED))
5242 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5243 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5244 kid = kUNOP->op_first; /* get past null */
5245 if (kid->op_type != OP_SCOPE)
5247 kid = kLISTOP->op_last; /* get past scope */
5248 switch(kid->op_type) {
5256 k = kid; /* remember this node*/
5257 if (kBINOP->op_first->op_type != OP_RV2SV)
5259 kid = kBINOP->op_first; /* get past cmp */
5260 if (kUNOP->op_first->op_type != OP_GV)
5262 kid = kUNOP->op_first; /* get past rv2sv */
5263 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5265 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5267 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5271 kid = k; /* back to cmp */
5272 if (kBINOP->op_last->op_type != OP_RV2SV)
5274 kid = kBINOP->op_last; /* down to 2nd arg */
5275 if (kUNOP->op_first->op_type != OP_GV)
5277 kid = kUNOP->op_first; /* get past rv2sv */
5278 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5280 ? strNE(GvNAME(kGVOP->op_gv), "a")
5281 : strNE(GvNAME(kGVOP->op_gv), "b")))
5283 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5285 o->op_private |= OPpSORT_REVERSE;
5286 if (k->op_type == OP_NCMP)
5287 o->op_private |= OPpSORT_NUMERIC;
5288 if (k->op_type == OP_I_NCMP)
5289 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5290 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5291 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5292 cLISTOPo->op_children = 1;
5300 if (o->op_flags & OPf_STACKED)
5301 return no_fh_allowed(o);
5303 kid = cLISTOPo->op_first;
5304 if (kid->op_type != OP_NULL)
5305 croak("panic: ck_split");
5306 kid = kid->op_sibling;
5307 op_free(cLISTOPo->op_first);
5308 cLISTOPo->op_first = kid;
5310 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5311 cLISTOPo->op_last = kid; /* There was only one element previously */
5314 if (kid->op_type != OP_MATCH) {
5315 OP *sibl = kid->op_sibling;
5316 kid->op_sibling = 0;
5317 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5318 if (cLISTOPo->op_first == cLISTOPo->op_last)
5319 cLISTOPo->op_last = kid;
5320 cLISTOPo->op_first = kid;
5321 kid->op_sibling = sibl;
5324 kid->op_type = OP_PUSHRE;
5325 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5328 if (!kid->op_sibling)
5329 append_elem(OP_SPLIT, o, newDEFSVOP());
5331 kid = kid->op_sibling;
5334 if (!kid->op_sibling)
5335 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5337 kid = kid->op_sibling;
5340 if (kid->op_sibling)
5341 return too_many_arguments(o,PL_op_desc[o->op_type]);
5350 OP *prev = ((cUNOPo->op_first->op_sibling)
5351 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5352 OP *o2 = prev->op_sibling;
5361 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5362 if (cvop->op_type == OP_RV2CV) {
5364 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5365 null(cvop); /* disable rv2cv */
5366 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5367 if (tmpop->op_type == OP_GV) {
5368 cv = GvCVu(tmpop->op_sv);
5369 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5370 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5371 proto = SvPV((SV*)cv, n_a);
5375 else if (cvop->op_type == OP_METHOD) {
5376 if (o2->op_type == OP_CONST)
5377 o2->op_private &= ~OPpCONST_STRICT;
5379 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5380 if (PERLDB_SUB && PL_curstash != PL_debstash)
5381 o->op_private |= OPpENTERSUB_DB;
5382 while (o2 != cvop) {
5386 return too_many_arguments(o, gv_ename(namegv));
5404 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5405 bad_type(arg, "block", gv_ename(namegv), o2);
5408 /* '*' allows any scalar type, including bareword */
5411 if (o2->op_type == OP_RV2GV)
5412 goto wrapref; /* autoconvert GLOB -> GLOBref */
5413 else if (o2->op_type == OP_CONST)
5414 o2->op_private &= ~OPpCONST_STRICT;
5415 else if (o2->op_type == OP_ENTERSUB) {
5416 /* accidental subroutine, revert to bareword */
5417 OP *gvop = ((UNOP*)o2)->op_first;
5418 if (gvop && gvop->op_type == OP_NULL) {
5419 gvop = ((UNOP*)gvop)->op_first;
5421 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5424 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5425 (gvop = ((UNOP*)gvop)->op_first) &&
5426 gvop->op_type == OP_GV)
5428 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5429 OP *sibling = o2->op_sibling;
5431 o2 = newSVOP(OP_CONST, 0,
5432 newSVpvn(GvNAME(gv),
5434 prev->op_sibling = o2;
5435 o2->op_sibling = sibling;
5447 if (o2->op_type != OP_RV2GV)
5448 bad_type(arg, "symbol", gv_ename(namegv), o2);
5451 if (o2->op_type != OP_RV2CV)
5452 bad_type(arg, "sub", gv_ename(namegv), o2);
5455 if (o2->op_type != OP_RV2SV
5456 && o2->op_type != OP_PADSV
5457 && o2->op_type != OP_THREADSV)
5459 bad_type(arg, "scalar", gv_ename(namegv), o2);
5463 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5464 bad_type(arg, "array", gv_ename(namegv), o2);
5467 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5468 bad_type(arg, "hash", gv_ename(namegv), o2);
5472 OP* sib = kid->op_sibling;
5473 kid->op_sibling = 0;
5474 o2 = newUNOP(OP_REFGEN, 0, kid);
5475 o2->op_sibling = sib;
5476 prev->op_sibling = o2;
5487 croak("Malformed prototype for %s: %s",
5488 gv_ename(namegv), SvPV((SV*)cv, n_a));
5493 mod(o2, OP_ENTERSUB);
5495 o2 = o2->op_sibling;
5497 if (proto && !optional &&
5498 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5499 return too_few_arguments(o, gv_ename(namegv));
5506 SvREADONLY_on(cSVOPo->op_sv);
5513 if (o->op_flags & OPf_KIDS) {
5514 SVOP *kid = (SVOP*)cUNOPo->op_first;
5516 if (kid->op_type == OP_NULL)
5517 kid = (SVOP*)kid->op_sibling;
5519 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5520 o->op_flags |= OPf_SPECIAL;
5525 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5528 peep(register OP *o)
5531 register OP* oldop = 0;
5534 if (!o || o->op_seq)
5538 SAVESPTR(PL_curcop);
5539 for (; o; o = o->op_next) {
5545 switch (o->op_type) {
5548 PL_curcop = ((COP*)o); /* for warnings */
5549 o->op_seq = PL_op_seqmax++;
5553 if (cSVOPo->op_private & OPpCONST_STRICT)
5554 no_bareword_allowed(o);
5563 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5565 o->op_seq = PL_op_seqmax++;
5568 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5569 o->op_seq = PL_op_seqmax++;
5570 break; /* Scalar stub must produce undef. List stub is noop */
5574 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5575 PL_curcop = ((COP*)o);
5581 if (oldop && o->op_next) {
5582 oldop->op_next = o->op_next;
5585 o->op_seq = PL_op_seqmax++;
5589 if (o->op_next->op_type == OP_RV2SV) {
5590 if (!(o->op_next->op_private & OPpDEREF)) {
5592 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5593 o->op_next = o->op_next->op_next;
5594 o->op_type = OP_GVSV;
5595 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5598 else if (o->op_next->op_type == OP_RV2AV) {
5599 OP* pop = o->op_next->op_next;
5601 if (pop->op_type == OP_CONST &&
5602 (PL_op = pop->op_next) &&
5603 pop->op_next->op_type == OP_AELEM &&
5604 !(pop->op_next->op_private &
5605 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5606 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5610 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5614 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5615 o->op_next = pop->op_next->op_next;
5616 o->op_type = OP_AELEMFAST;
5617 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5618 o->op_private = (U8)i;
5619 GvAVn(((GVOP*)o)->op_gv);
5622 o->op_seq = PL_op_seqmax++;
5629 o->op_seq = PL_op_seqmax++;
5630 while (cLOGOP->op_other->op_type == OP_NULL)
5631 cLOGOP->op_other = cLOGOP->op_other->op_next;
5632 peep(cLOGOP->op_other);
5636 o->op_seq = PL_op_seqmax++;
5637 peep(cCONDOP->op_true);
5638 peep(cCONDOP->op_false);
5642 o->op_seq = PL_op_seqmax++;
5643 peep(cLOOP->op_redoop);
5644 peep(cLOOP->op_nextop);
5645 peep(cLOOP->op_lastop);
5651 o->op_seq = PL_op_seqmax++;
5652 peep(cPMOP->op_pmreplstart);
5656 o->op_seq = PL_op_seqmax++;
5657 if (ckWARN(WARN_SYNTAX) && o->op_next
5658 && o->op_next->op_type == OP_NEXTSTATE) {
5659 if (o->op_next->op_sibling &&
5660 o->op_next->op_sibling->op_type != OP_EXIT &&
5661 o->op_next->op_sibling->op_type != OP_WARN &&
5662 o->op_next->op_sibling->op_type != OP_DIE) {
5663 line_t oldline = PL_curcop->cop_line;
5665 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5666 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5667 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5668 PL_curcop->cop_line = oldline;
5682 if ((o->op_private & (OPpLVAL_INTRO))
5683 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5685 rop = (UNOP*)((BINOP*)o)->op_first;
5686 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5688 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5689 if (!SvOBJECT(lexname))
5691 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5692 if (!fields || !GvHV(*fields))
5694 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5695 key = SvPV(*svp, keylen);
5696 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5698 croak("No such field \"%s\" in variable %s of type %s",
5699 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5701 ind = SvIV(*indsvp);
5703 croak("Bad index while coercing array into hash");
5704 rop->op_type = OP_RV2AV;
5705 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5706 o->op_type = OP_AELEM;
5707 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5709 *svp = newSViv(ind);
5714 o->op_seq = PL_op_seqmax++;