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 ? '&' : '%'));
139 if (PL_in_eval & EVAL_WARNONLY)
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);
891 if (o->op_type == OP_NEXTSTATE || o->op_type == OP_DBSTATE ||
892 (o->op_type == OP_NULL &&
893 (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)))
896 PL_curcop = (COP*)o; /* for warning below */
899 /* assumes no premature commitment */
900 want = o->op_flags & OPf_WANT;
901 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
902 || o->op_type == OP_RETURN)
905 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
907 switch (o->op_type) {
909 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
913 if (o->op_flags & OPf_STACKED)
917 if (o->op_private == 4)
988 if (!(o->op_private & OPpLVAL_INTRO))
989 useless = PL_op_desc[o->op_type];
996 if (!(o->op_private & OPpLVAL_INTRO) &&
997 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
998 useless = "a variable";
1003 if (cSVOPo->op_private & OPpCONST_STRICT)
1004 no_bareword_allowed(o);
1007 if (ckWARN(WARN_VOID)) {
1008 useless = "a constant";
1009 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1011 else if (SvPOK(sv)) {
1012 if (strnEQ(SvPVX(sv), "di", 2) ||
1013 strnEQ(SvPVX(sv), "ds", 2) ||
1014 strnEQ(SvPVX(sv), "ig", 2))
1019 null(o); /* don't execute a constant */
1020 SvREFCNT_dec(sv); /* don't even remember it */
1024 o->op_type = OP_PREINC; /* pre-increment is faster */
1025 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1029 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1030 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1036 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1041 if (o->op_flags & OPf_STACKED)
1049 if (!(o->op_flags & OPf_KIDS))
1058 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1065 /* all requires must return a boolean value */
1066 o->op_flags &= ~OPf_WANT;
1069 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1070 if (!kPMOP->op_pmreplroot)
1071 deprecate("implicit split to @_");
1077 if (ckWARN(WARN_VOID))
1078 warner(WARN_VOID, "Useless use of %s in void context", useless);
1087 if (o && o->op_flags & OPf_KIDS) {
1088 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1099 /* assumes no premature commitment */
1100 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1101 || o->op_type == OP_RETURN)
1104 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1106 switch (o->op_type) {
1109 list(cBINOPo->op_first);
1114 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1122 if (!(o->op_flags & OPf_KIDS))
1124 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1125 list(cBINOPo->op_first);
1126 return gen_constant_list(o);
1133 kid = cLISTOPo->op_first;
1135 while (kid = kid->op_sibling) {
1136 if (kid->op_sibling)
1141 WITH_THR(PL_curcop = &PL_compiling);
1145 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1146 if (kid->op_sibling)
1151 WITH_THR(PL_curcop = &PL_compiling);
1154 /* all requires must return a boolean value */
1155 o->op_flags &= ~OPf_WANT;
1167 if (o->op_type == OP_LINESEQ ||
1168 o->op_type == OP_SCOPE ||
1169 o->op_type == OP_LEAVE ||
1170 o->op_type == OP_LEAVETRY)
1173 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1174 if (kid->op_sibling) {
1178 PL_curcop = &PL_compiling;
1180 o->op_flags &= ~OPf_PARENS;
1181 if (PL_hints & HINT_BLOCK_SCOPE)
1182 o->op_flags |= OPf_PARENS;
1185 o = newOP(OP_STUB, 0);
1190 modkids(OP *o, I32 type)
1193 if (o && o->op_flags & OPf_KIDS) {
1194 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1201 mod(OP *o, I32 type)
1208 if (!o || PL_error_count)
1211 switch (o->op_type) {
1216 if (!(o->op_private & (OPpCONST_ARYBASE)))
1218 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1219 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1223 SAVEI32(PL_compiling.cop_arybase);
1224 PL_compiling.cop_arybase = 0;
1226 else if (type == OP_REFGEN)
1229 croak("That use of $[ is unsupported");
1232 if (o->op_flags & OPf_PARENS)
1236 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1237 !(o->op_flags & OPf_STACKED)) {
1238 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1239 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1240 assert(cUNOPo->op_first->op_type == OP_NULL);
1241 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1247 /* grep, foreach, subcalls, refgen */
1248 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1250 yyerror(form("Can't modify %s in %s",
1251 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1252 ? "do block" : PL_op_desc[o->op_type]),
1253 type ? PL_op_desc[type] : "local"));
1267 case OP_RIGHT_SHIFT:
1276 if (!(o->op_flags & OPf_STACKED))
1282 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1288 if (!type && cUNOPo->op_first->op_type != OP_GV)
1289 croak("Can't localize through a reference");
1290 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1291 PL_modcount = 10000;
1292 return o; /* Treat \(@foo) like ordinary list. */
1296 if (scalar_mod_type(o, type))
1298 ref(cUNOPo->op_first, o->op_type);
1307 PL_modcount = 10000;
1310 if (!type && cUNOPo->op_first->op_type != OP_GV)
1311 croak("Can't localize through a reference");
1312 ref(cUNOPo->op_first, o->op_type);
1316 PL_hints |= HINT_BLOCK_SCOPE;
1326 PL_modcount = 10000;
1327 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1328 return o; /* Treat \(@foo) like ordinary list. */
1329 if (scalar_mod_type(o, type))
1335 croak("Can't localize lexical variable %s",
1336 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1341 PL_modcount++; /* XXX ??? */
1343 #endif /* USE_THREADS */
1349 if (type != OP_SASSIGN)
1353 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1359 pad_free(o->op_targ);
1360 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1361 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1362 if (o->op_flags & OPf_KIDS)
1363 mod(cBINOPo->op_first->op_sibling, type);
1368 ref(cBINOPo->op_first, o->op_type);
1369 if (type == OP_ENTERSUB &&
1370 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1371 o->op_private |= OPpLVAL_DEFER;
1378 if (o->op_flags & OPf_KIDS)
1379 mod(cLISTOPo->op_last, type);
1383 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1385 else if (!(o->op_flags & OPf_KIDS))
1387 if (o->op_targ != OP_LIST) {
1388 mod(cBINOPo->op_first, type);
1393 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1397 o->op_flags |= OPf_MOD;
1399 if (type == OP_AASSIGN || type == OP_SASSIGN)
1400 o->op_flags |= OPf_SPECIAL|OPf_REF;
1402 o->op_private |= OPpLVAL_INTRO;
1403 o->op_flags &= ~OPf_SPECIAL;
1404 PL_hints |= HINT_BLOCK_SCOPE;
1406 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1407 o->op_flags |= OPf_REF;
1412 scalar_mod_type(OP *o, I32 type)
1416 if (o->op_type == OP_RV2GV)
1440 case OP_RIGHT_SHIFT:
1459 is_handle_constructor(OP *o, I32 argnum)
1461 switch (o->op_type) {
1469 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1482 refkids(OP *o, I32 type)
1485 if (o && o->op_flags & OPf_KIDS) {
1486 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1493 ref(OP *o, I32 type)
1497 if (!o || PL_error_count)
1500 switch (o->op_type) {
1502 if ((type == OP_DEFINED || type == OP_LOCK) &&
1503 !(o->op_flags & OPf_STACKED)) {
1504 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1505 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1506 assert(cUNOPo->op_first->op_type == OP_NULL);
1507 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1508 o->op_flags |= OPf_SPECIAL;
1513 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1517 if (type == OP_DEFINED)
1518 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1519 ref(cUNOPo->op_first, o->op_type);
1522 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1523 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1524 : type == OP_RV2HV ? OPpDEREF_HV
1526 o->op_flags |= OPf_MOD;
1531 o->op_flags |= OPf_MOD; /* XXX ??? */
1536 o->op_flags |= OPf_REF;
1539 if (type == OP_DEFINED)
1540 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1541 ref(cUNOPo->op_first, o->op_type);
1546 o->op_flags |= OPf_REF;
1551 if (!(o->op_flags & OPf_KIDS))
1553 ref(cBINOPo->op_first, type);
1557 ref(cBINOPo->op_first, o->op_type);
1558 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1559 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1560 : type == OP_RV2HV ? OPpDEREF_HV
1562 o->op_flags |= OPf_MOD;
1570 if (!(o->op_flags & OPf_KIDS))
1572 ref(cLISTOPo->op_last, type);
1587 if (!o || PL_error_count)
1591 if (type == OP_LIST) {
1592 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1594 } else if (type == OP_UNDEF) {
1596 } else if (type != OP_PADSV &&
1599 type != OP_PUSHMARK)
1601 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1604 o->op_flags |= OPf_MOD;
1605 o->op_private |= OPpLVAL_INTRO;
1613 o->op_flags |= OPf_PARENS;
1618 bind_match(I32 type, OP *left, OP *right)
1623 if (ckWARN(WARN_UNSAFE) &&
1624 (left->op_type == OP_RV2AV ||
1625 left->op_type == OP_RV2HV ||
1626 left->op_type == OP_PADAV ||
1627 left->op_type == OP_PADHV)) {
1628 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1629 right->op_type == OP_TRANS)
1630 ? right->op_type : OP_MATCH];
1631 char *sample = ((left->op_type == OP_RV2AV ||
1632 left->op_type == OP_PADAV)
1633 ? "@array" : "%hash");
1635 "Applying %s to %s will act on scalar(%s)",
1636 desc, sample, sample);
1639 if (right->op_type == OP_MATCH ||
1640 right->op_type == OP_SUBST ||
1641 right->op_type == OP_TRANS) {
1642 right->op_flags |= OPf_STACKED;
1643 if (right->op_type != OP_MATCH)
1644 left = mod(left, right->op_type);
1645 if (right->op_type == OP_TRANS)
1646 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1648 o = prepend_elem(right->op_type, scalar(left), right);
1650 return newUNOP(OP_NOT, 0, scalar(o));
1654 return bind_match(type, left,
1655 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1663 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1664 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1671 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1672 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1673 o->op_type = OP_LEAVE;
1674 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1677 if (o->op_type == OP_LINESEQ) {
1679 o->op_type = OP_SCOPE;
1680 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1681 kid = ((LISTOP*)o)->op_first;
1682 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1683 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1688 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1698 SAVESPTR(GvHV(PL_hintgv));
1699 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1700 SAVEFREESV(GvHV(PL_hintgv));
1704 block_start(int full)
1707 int retval = PL_savestack_ix;
1709 SAVEI32(PL_comppad_name_floor);
1711 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1712 PL_comppad_name_floor = PL_comppad_name_fill;
1714 PL_comppad_name_floor = 0;
1716 SAVEI32(PL_min_intro_pending);
1717 SAVEI32(PL_max_intro_pending);
1718 PL_min_intro_pending = 0;
1719 SAVEI32(PL_comppad_name_fill);
1720 SAVEI32(PL_padix_floor);
1721 PL_padix_floor = PL_padix;
1722 PL_pad_reset_pending = FALSE;
1724 PL_hints &= ~HINT_BLOCK_SCOPE;
1725 SAVEPPTR(PL_compiling.cop_warnings);
1726 if (PL_compiling.cop_warnings != WARN_ALL &&
1727 PL_compiling.cop_warnings != WARN_NONE) {
1728 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1729 SAVEFREESV(PL_compiling.cop_warnings) ;
1737 block_end(I32 floor, OP *seq)
1740 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1741 OP* retval = scalarseq(seq);
1743 PL_pad_reset_pending = FALSE;
1744 PL_compiling.op_private = PL_hints;
1746 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1747 pad_leavemy(PL_comppad_name_fill);
1756 OP *o = newOP(OP_THREADSV, 0);
1757 o->op_targ = find_threadsv("_");
1760 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1761 #endif /* USE_THREADS */
1771 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1772 ((PL_in_eval & EVAL_KEEPERR)
1773 ? OPf_SPECIAL : 0), o);
1774 PL_eval_start = linklist(PL_eval_root);
1775 PL_eval_root->op_next = 0;
1776 peep(PL_eval_start);
1781 PL_main_root = scope(sawparens(scalarvoid(o)));
1782 PL_curcop = &PL_compiling;
1783 PL_main_start = LINKLIST(PL_main_root);
1784 PL_main_root->op_next = 0;
1785 peep(PL_main_start);
1788 /* Register with debugger */
1790 CV *cv = perl_get_cv("DB::postponed", FALSE);
1794 XPUSHs((SV*)PL_compiling.cop_filegv);
1796 perl_call_sv((SV*)cv, G_DISCARD);
1803 localize(OP *o, I32 lex)
1805 if (o->op_flags & OPf_PARENS)
1809 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1811 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1812 if (*s == ';' || *s == '=')
1813 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1814 lex ? "my" : "local");
1818 PL_in_my_stash = Nullhv;
1822 return mod(o, OP_NULL); /* a bit kludgey */
1828 if (o->op_type == OP_LIST) {
1831 o2 = newOP(OP_THREADSV, 0);
1832 o2->op_targ = find_threadsv(";");
1834 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1835 #endif /* USE_THREADS */
1836 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1842 fold_constants(register OP *o)
1846 I32 type = o->op_type;
1849 if (PL_opargs[type] & OA_RETSCALAR)
1851 if (PL_opargs[type] & OA_TARGET)
1852 o->op_targ = pad_alloc(type, SVs_PADTMP);
1854 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1855 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1857 if (!(PL_opargs[type] & OA_FOLDCONST))
1862 /* XXX might want a ck_negate() for this */
1863 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1876 if (o->op_private & OPpLOCALE)
1881 goto nope; /* Don't try to run w/ errors */
1883 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1884 if (curop->op_type != OP_CONST &&
1885 curop->op_type != OP_LIST &&
1886 curop->op_type != OP_SCALAR &&
1887 curop->op_type != OP_NULL &&
1888 curop->op_type != OP_PUSHMARK)
1894 curop = LINKLIST(o);
1898 sv = *(PL_stack_sp--);
1899 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1900 pad_swipe(o->op_targ);
1901 else if (SvTEMP(sv)) { /* grab mortal temp? */
1902 (void)SvREFCNT_inc(sv);
1906 if (type == OP_RV2GV)
1907 return newGVOP(OP_GV, 0, (GV*)sv);
1909 /* try to smush double to int, but don't smush -2.0 to -2 */
1910 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1914 if ((double)iv == SvNV(sv)) {
1919 SvIOK_off(sv); /* undo SvIV() damage */
1921 return newSVOP(OP_CONST, 0, sv);
1925 if (!(PL_opargs[type] & OA_OTHERINT))
1928 if (!(PL_hints & HINT_INTEGER)) {
1929 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1932 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1933 if (curop->op_type == OP_CONST) {
1934 if (SvIOK(((SVOP*)curop)->op_sv))
1938 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1942 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1949 gen_constant_list(register OP *o)
1953 I32 oldtmps_floor = PL_tmps_floor;
1957 return o; /* Don't attempt to run with errors */
1959 PL_op = curop = LINKLIST(o);
1965 PL_tmps_floor = oldtmps_floor;
1967 o->op_type = OP_RV2AV;
1968 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1969 curop = ((UNOP*)o)->op_first;
1970 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1977 convert(I32 type, I32 flags, OP *o)
1982 if (!o || o->op_type != OP_LIST)
1983 o = newLISTOP(OP_LIST, 0, o, Nullop);
1985 o->op_flags &= ~OPf_WANT;
1987 if (!(PL_opargs[type] & OA_MARK))
1988 null(cLISTOPo->op_first);
1991 o->op_ppaddr = PL_ppaddr[type];
1992 o->op_flags |= flags;
1994 o = CHECKOP(type, o);
1995 if (o->op_type != type)
1998 if (cLISTOPo->op_children < 7) {
1999 /* XXX do we really need to do this if we're done appending?? */
2000 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2002 cLISTOPo->op_last = last; /* in case check substituted last arg */
2005 return fold_constants(o);
2008 /* List constructors */
2011 append_elem(I32 type, OP *first, OP *last)
2019 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2020 return newLISTOP(type, 0, first, last);
2022 if (first->op_flags & OPf_KIDS)
2023 ((LISTOP*)first)->op_last->op_sibling = last;
2025 first->op_flags |= OPf_KIDS;
2026 ((LISTOP*)first)->op_first = last;
2028 ((LISTOP*)first)->op_last = last;
2029 ((LISTOP*)first)->op_children++;
2034 append_list(I32 type, LISTOP *first, LISTOP *last)
2042 if (first->op_type != type)
2043 return prepend_elem(type, (OP*)first, (OP*)last);
2045 if (last->op_type != type)
2046 return append_elem(type, (OP*)first, (OP*)last);
2048 first->op_last->op_sibling = last->op_first;
2049 first->op_last = last->op_last;
2050 first->op_children += last->op_children;
2051 if (first->op_children)
2052 first->op_flags |= OPf_KIDS;
2054 #ifdef PL_OP_SLAB_ALLOC
2062 prepend_elem(I32 type, OP *first, OP *last)
2070 if (last->op_type == type) {
2071 if (type == OP_LIST) { /* already a PUSHMARK there */
2072 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2073 ((LISTOP*)last)->op_first->op_sibling = first;
2076 if (!(last->op_flags & OPf_KIDS)) {
2077 ((LISTOP*)last)->op_last = first;
2078 last->op_flags |= OPf_KIDS;
2080 first->op_sibling = ((LISTOP*)last)->op_first;
2081 ((LISTOP*)last)->op_first = first;
2083 ((LISTOP*)last)->op_children++;
2087 return newLISTOP(type, 0, first, last);
2095 return newOP(OP_STUB, 0);
2101 if (!o || o->op_type != OP_LIST)
2102 o = newLISTOP(OP_LIST, 0, o, Nullop);
2108 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2112 NewOp(1101, listop, 1, LISTOP);
2114 listop->op_type = type;
2115 listop->op_ppaddr = PL_ppaddr[type];
2116 listop->op_children = (first != 0) + (last != 0);
2117 listop->op_flags = flags;
2121 else if (!first && last)
2124 first->op_sibling = last;
2125 listop->op_first = first;
2126 listop->op_last = last;
2127 if (type == OP_LIST) {
2129 pushop = newOP(OP_PUSHMARK, 0);
2130 pushop->op_sibling = first;
2131 listop->op_first = pushop;
2132 listop->op_flags |= OPf_KIDS;
2134 listop->op_last = pushop;
2136 else if (listop->op_children)
2137 listop->op_flags |= OPf_KIDS;
2143 newOP(I32 type, I32 flags)
2146 NewOp(1101, o, 1, OP);
2148 o->op_ppaddr = PL_ppaddr[type];
2149 o->op_flags = flags;
2152 o->op_private = 0 + (flags >> 8);
2153 if (PL_opargs[type] & OA_RETSCALAR)
2155 if (PL_opargs[type] & OA_TARGET)
2156 o->op_targ = pad_alloc(type, SVs_PADTMP);
2157 return CHECKOP(type, o);
2161 newUNOP(I32 type, I32 flags, OP *first)
2166 first = newOP(OP_STUB, 0);
2167 if (PL_opargs[type] & OA_MARK)
2168 first = force_list(first);
2170 NewOp(1101, unop, 1, UNOP);
2171 unop->op_type = type;
2172 unop->op_ppaddr = PL_ppaddr[type];
2173 unop->op_first = first;
2174 unop->op_flags = flags | OPf_KIDS;
2175 unop->op_private = 1 | (flags >> 8);
2176 unop = (UNOP*) CHECKOP(type, unop);
2180 return fold_constants((OP *) unop);
2184 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2187 NewOp(1101, binop, 1, BINOP);
2190 first = newOP(OP_NULL, 0);
2192 binop->op_type = type;
2193 binop->op_ppaddr = PL_ppaddr[type];
2194 binop->op_first = first;
2195 binop->op_flags = flags | OPf_KIDS;
2198 binop->op_private = 1 | (flags >> 8);
2201 binop->op_private = 2 | (flags >> 8);
2202 first->op_sibling = last;
2205 binop = (BINOP*)CHECKOP(type, binop);
2209 binop->op_last = binop->op_first->op_sibling;
2211 return fold_constants((OP *)binop);
2215 utf8compare(const void *a, const void *b)
2218 for (i = 0; i < 10; i++) {
2219 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2221 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2228 pmtrans(OP *o, OP *expr, OP *repl)
2230 SV *tstr = ((SVOP*)expr)->op_sv;
2231 SV *rstr = ((SVOP*)repl)->op_sv;
2234 register U8 *t = (U8*)SvPV(tstr, tlen);
2235 register U8 *r = (U8*)SvPV(rstr, rlen);
2241 register short *tbl;
2243 complement = o->op_private & OPpTRANS_COMPLEMENT;
2244 del = o->op_private & OPpTRANS_DELETE;
2245 squash = o->op_private & OPpTRANS_SQUASH;
2247 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2248 SV* listsv = newSVpvn("# comment\n",10);
2250 U8* tend = t + tlen;
2251 U8* rend = r + rlen;
2267 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2268 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2274 New(1109, cp, tlen, U8*);
2276 transv = newSVpvn("",0);
2285 qsort(cp, i, sizeof(U8*), utf8compare);
2286 for (j = 0; j < i; j++) {
2288 UV val = utf8_to_uv(s, &ulen);
2290 diff = val - nextmin;
2292 t = uv_to_utf8(tmpbuf,nextmin);
2293 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2295 t = uv_to_utf8(tmpbuf, val - 1);
2296 sv_catpvn(transv, "\377", 1);
2297 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2301 val = utf8_to_uv(s+1, &ulen);
2305 t = uv_to_utf8(tmpbuf,nextmin);
2306 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2307 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2308 sv_catpvn(transv, "\377", 1);
2309 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2310 t = (U8*)SvPVX(transv);
2311 tlen = SvCUR(transv);
2314 else if (!rlen && !del) {
2315 r = t; rlen = tlen; rend = tend;
2318 if (to_utf && from_utf) { /* only counting characters */
2319 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2320 o->op_private |= OPpTRANS_IDENTICAL;
2322 else { /* straight latin-1 translation */
2323 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2324 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2325 o->op_private |= OPpTRANS_IDENTICAL;
2329 while (t < tend || tfirst <= tlast) {
2330 /* see if we need more "t" chars */
2331 if (tfirst > tlast) {
2332 tfirst = (I32)utf8_to_uv(t, &ulen);
2334 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2335 tlast = (I32)utf8_to_uv(++t, &ulen);
2342 /* now see if we need more "r" chars */
2343 if (rfirst > rlast) {
2345 rfirst = (I32)utf8_to_uv(r, &ulen);
2347 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2348 rlast = (I32)utf8_to_uv(++r, &ulen);
2357 rfirst = rlast = 0xffffffff;
2361 /* now see which range will peter our first, if either. */
2362 tdiff = tlast - tfirst;
2363 rdiff = rlast - rfirst;
2370 if (rfirst == 0xffffffff) {
2371 diff = tdiff; /* oops, pretend rdiff is infinite */
2373 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2375 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2379 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2381 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2383 if (rfirst + diff > max)
2384 max = rfirst + diff;
2389 else if (rfirst <= 0x800)
2390 grows |= (tfirst < 0x80);
2391 else if (rfirst <= 0x10000)
2392 grows |= (tfirst < 0x800);
2393 else if (rfirst <= 0x200000)
2394 grows |= (tfirst < 0x10000);
2395 else if (rfirst <= 0x4000000)
2396 grows |= (tfirst < 0x200000);
2397 else if (rfirst <= 0x80000000)
2398 grows |= (tfirst < 0x4000000);
2410 else if (max > 0xff)
2415 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2416 SvREFCNT_dec(listsv);
2418 SvREFCNT_dec(transv);
2420 if (!del && havefinal)
2421 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2423 if (grows && to_utf)
2424 o->op_private |= OPpTRANS_GROWS;
2431 tbl = (short*)cPVOPo->op_pv;
2433 Zero(tbl, 256, short);
2434 for (i = 0; i < tlen; i++)
2436 for (i = 0, j = 0; i < 256; i++) {
2452 if (!rlen && !del) {
2455 o->op_private |= OPpTRANS_IDENTICAL;
2457 for (i = 0; i < 256; i++)
2459 for (i = 0, j = 0; i < tlen; i++,j++) {
2462 if (tbl[t[i]] == -1)
2468 if (tbl[t[i]] == -1)
2479 newPMOP(I32 type, I32 flags)
2484 NewOp(1101, pmop, 1, PMOP);
2485 pmop->op_type = type;
2486 pmop->op_ppaddr = PL_ppaddr[type];
2487 pmop->op_flags = flags;
2488 pmop->op_private = 0 | (flags >> 8);
2490 if (PL_hints & HINT_RE_TAINT)
2491 pmop->op_pmpermflags |= PMf_RETAINT;
2492 if (PL_hints & HINT_LOCALE)
2493 pmop->op_pmpermflags |= PMf_LOCALE;
2494 pmop->op_pmflags = pmop->op_pmpermflags;
2496 /* link into pm list */
2497 if (type != OP_TRANS && PL_curstash) {
2498 pmop->op_pmnext = HvPMROOT(PL_curstash);
2499 HvPMROOT(PL_curstash) = pmop;
2506 pmruntime(OP *o, OP *expr, OP *repl)
2511 I32 repl_has_vars = 0;
2513 if (o->op_type == OP_TRANS)
2514 return pmtrans(o, expr, repl);
2516 PL_hints |= HINT_BLOCK_SCOPE;
2519 if (expr->op_type == OP_CONST) {
2521 SV *pat = ((SVOP*)expr)->op_sv;
2522 char *p = SvPV(pat, plen);
2523 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2524 sv_setpvn(pat, "\\s+", 3);
2525 p = SvPV(pat, plen);
2526 pm->op_pmflags |= PMf_SKIPWHITE;
2528 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2529 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2530 pm->op_pmflags |= PMf_WHITE;
2534 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2535 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2537 : OP_REGCMAYBE),0,expr);
2539 NewOp(1101, rcop, 1, LOGOP);
2540 rcop->op_type = OP_REGCOMP;
2541 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2542 rcop->op_first = scalar(expr);
2543 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2544 ? (OPf_SPECIAL | OPf_KIDS)
2546 rcop->op_private = 1;
2549 /* establish postfix order */
2550 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2552 rcop->op_next = expr;
2553 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2556 rcop->op_next = LINKLIST(expr);
2557 expr->op_next = (OP*)rcop;
2560 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2565 if (pm->op_pmflags & PMf_EVAL) {
2567 if (PL_curcop->cop_line < PL_multi_end)
2568 PL_curcop->cop_line = PL_multi_end;
2571 else if (repl->op_type == OP_THREADSV
2572 && strchr("&`'123456789+",
2573 PL_threadsv_names[repl->op_targ]))
2577 #endif /* USE_THREADS */
2578 else if (repl->op_type == OP_CONST)
2582 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2583 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2585 if (curop->op_type == OP_THREADSV) {
2587 if (strchr("&`'123456789+", curop->op_private))
2591 if (curop->op_type == OP_GV) {
2592 GV *gv = ((GVOP*)curop)->op_gv;
2594 if (strchr("&`'123456789+", *GvENAME(gv)))
2597 #endif /* USE_THREADS */
2598 else if (curop->op_type == OP_RV2CV)
2600 else if (curop->op_type == OP_RV2SV ||
2601 curop->op_type == OP_RV2AV ||
2602 curop->op_type == OP_RV2HV ||
2603 curop->op_type == OP_RV2GV) {
2604 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2607 else if (curop->op_type == OP_PADSV ||
2608 curop->op_type == OP_PADAV ||
2609 curop->op_type == OP_PADHV ||
2610 curop->op_type == OP_PADANY) {
2613 else if (curop->op_type == OP_PUSHRE)
2614 ; /* Okay here, dangerous in newASSIGNOP */
2623 && (!pm->op_pmregexp
2624 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2625 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2626 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2627 prepend_elem(o->op_type, scalar(repl), o);
2630 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2631 pm->op_pmflags |= PMf_MAYBE_CONST;
2632 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2634 NewOp(1101, rcop, 1, LOGOP);
2635 rcop->op_type = OP_SUBSTCONT;
2636 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2637 rcop->op_first = scalar(repl);
2638 rcop->op_flags |= OPf_KIDS;
2639 rcop->op_private = 1;
2642 /* establish postfix order */
2643 rcop->op_next = LINKLIST(repl);
2644 repl->op_next = (OP*)rcop;
2646 pm->op_pmreplroot = scalar((OP*)rcop);
2647 pm->op_pmreplstart = LINKLIST(rcop);
2656 newSVOP(I32 type, I32 flags, SV *sv)
2659 NewOp(1101, svop, 1, SVOP);
2660 svop->op_type = type;
2661 svop->op_ppaddr = PL_ppaddr[type];
2663 svop->op_next = (OP*)svop;
2664 svop->op_flags = flags;
2665 if (PL_opargs[type] & OA_RETSCALAR)
2667 if (PL_opargs[type] & OA_TARGET)
2668 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2669 return CHECKOP(type, svop);
2673 newGVOP(I32 type, I32 flags, GV *gv)
2677 NewOp(1101, gvop, 1, GVOP);
2678 gvop->op_type = type;
2679 gvop->op_ppaddr = PL_ppaddr[type];
2680 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2681 gvop->op_next = (OP*)gvop;
2682 gvop->op_flags = flags;
2683 if (PL_opargs[type] & OA_RETSCALAR)
2685 if (PL_opargs[type] & OA_TARGET)
2686 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2687 return CHECKOP(type, gvop);
2691 newPVOP(I32 type, I32 flags, char *pv)
2694 NewOp(1101, pvop, 1, PVOP);
2695 pvop->op_type = type;
2696 pvop->op_ppaddr = PL_ppaddr[type];
2698 pvop->op_next = (OP*)pvop;
2699 pvop->op_flags = flags;
2700 if (PL_opargs[type] & OA_RETSCALAR)
2702 if (PL_opargs[type] & OA_TARGET)
2703 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2704 return CHECKOP(type, pvop);
2713 save_hptr(&PL_curstash);
2714 save_item(PL_curstname);
2719 name = SvPV(sv, len);
2720 PL_curstash = gv_stashpvn(name,len,TRUE);
2721 sv_setpvn(PL_curstname, name, len);
2725 sv_setpv(PL_curstname,"<none>");
2726 PL_curstash = Nullhv;
2728 PL_hints |= HINT_BLOCK_SCOPE;
2729 PL_copline = NOLINE;
2734 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2743 if (id->op_type != OP_CONST)
2744 croak("Module name must be constant");
2748 if(version != Nullop) {
2749 SV *vesv = ((SVOP*)version)->op_sv;
2751 if (arg == Nullop && !SvNIOK(vesv)) {
2758 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2759 croak("Version number must be constant number");
2761 /* Make copy of id so we don't free it twice */
2762 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2764 /* Fake up a method call to VERSION */
2765 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2766 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2767 append_elem(OP_LIST,
2768 prepend_elem(OP_LIST, pack, list(version)),
2769 newUNOP(OP_METHOD, 0, meth)));
2773 /* Fake up an import/unimport */
2774 if (arg && arg->op_type == OP_STUB)
2775 imop = arg; /* no import on explicit () */
2776 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2777 imop = Nullop; /* use 5.0; */
2780 /* Make copy of id so we don't free it twice */
2781 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2782 meth = newSVOP(OP_CONST, 0,
2784 ? newSVpvn("import", 6)
2785 : newSVpvn("unimport", 8)
2787 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2788 append_elem(OP_LIST,
2789 prepend_elem(OP_LIST, pack, list(arg)),
2790 newUNOP(OP_METHOD, 0, meth)));
2793 /* Fake up a require, handle override, if any */
2794 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2795 if (!(gv && GvIMPORTED_CV(gv)))
2796 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2798 if (gv && GvIMPORTED_CV(gv)) {
2799 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2800 append_elem(OP_LIST, id,
2801 scalar(newUNOP(OP_RV2CV, 0,
2806 rqop = newUNOP(OP_REQUIRE, 0, id);
2809 /* Fake up the BEGIN {}, which does its thing immediately. */
2811 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2813 append_elem(OP_LINESEQ,
2814 append_elem(OP_LINESEQ,
2815 newSTATEOP(0, Nullch, rqop),
2816 newSTATEOP(0, Nullch, veop)),
2817 newSTATEOP(0, Nullch, imop) ));
2819 PL_copline = NOLINE;
2829 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2830 if (!(gv && GvIMPORTED_CV(gv)))
2831 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2833 if (gv && GvIMPORTED_CV(gv)) {
2834 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2835 append_elem(OP_LIST, term,
2836 scalar(newUNOP(OP_RV2CV, 0,
2841 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2847 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2849 return newBINOP(OP_LSLICE, flags,
2850 list(force_list(subscript)),
2851 list(force_list(listval)) );
2855 list_assignment(register OP *o)
2860 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2861 o = cUNOPo->op_first;
2863 if (o->op_type == OP_COND_EXPR) {
2864 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2865 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2870 yyerror("Assignment to both a list and a scalar");
2874 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2875 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2876 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2879 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2882 if (o->op_type == OP_RV2SV)
2889 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2894 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2895 return newLOGOP(optype, 0,
2896 mod(scalar(left), optype),
2897 newUNOP(OP_SASSIGN, 0, scalar(right)));
2900 return newBINOP(optype, OPf_STACKED,
2901 mod(scalar(left), optype), scalar(right));
2905 if (list_assignment(left)) {
2908 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2909 left = mod(left, OP_AASSIGN);
2917 o = newBINOP(OP_AASSIGN, flags,
2918 list(force_list(right)),
2919 list(force_list(left)) );
2920 o->op_private = 0 | (flags >> 8);
2921 if (!(left->op_private & OPpLVAL_INTRO)) {
2925 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2926 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2927 if (curop->op_type == OP_GV) {
2928 GV *gv = ((GVOP*)curop)->op_gv;
2929 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2931 SvCUR(gv) = PL_generation;
2933 else if (curop->op_type == OP_PADSV ||
2934 curop->op_type == OP_PADAV ||
2935 curop->op_type == OP_PADHV ||
2936 curop->op_type == OP_PADANY) {
2937 SV **svp = AvARRAY(PL_comppad_name);
2938 SV *sv = svp[curop->op_targ];
2939 if (SvCUR(sv) == PL_generation)
2941 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2943 else if (curop->op_type == OP_RV2CV)
2945 else if (curop->op_type == OP_RV2SV ||
2946 curop->op_type == OP_RV2AV ||
2947 curop->op_type == OP_RV2HV ||
2948 curop->op_type == OP_RV2GV) {
2949 if (lastop->op_type != OP_GV) /* funny deref? */
2952 else if (curop->op_type == OP_PUSHRE) {
2953 if (((PMOP*)curop)->op_pmreplroot) {
2954 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2955 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2957 SvCUR(gv) = PL_generation;
2966 o->op_private = OPpASSIGN_COMMON;
2968 if (right && right->op_type == OP_SPLIT) {
2970 if ((tmpop = ((LISTOP*)right)->op_first) &&
2971 tmpop->op_type == OP_PUSHRE)
2973 PMOP *pm = (PMOP*)tmpop;
2974 if (left->op_type == OP_RV2AV &&
2975 !(left->op_private & OPpLVAL_INTRO) &&
2976 !(o->op_private & OPpASSIGN_COMMON) )
2978 tmpop = ((UNOP*)left)->op_first;
2979 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2980 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2981 pm->op_pmflags |= PMf_ONCE;
2982 tmpop = cUNOPo->op_first; /* to list (nulled) */
2983 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2984 tmpop->op_sibling = Nullop; /* don't free split */
2985 right->op_next = tmpop->op_next; /* fix starting loc */
2986 op_free(o); /* blow off assign */
2987 right->op_flags &= ~OPf_WANT;
2988 /* "I don't know and I don't care." */
2993 if (PL_modcount < 10000 &&
2994 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2996 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2998 sv_setiv(sv, PL_modcount+1);
3006 right = newOP(OP_UNDEF, 0);
3007 if (right->op_type == OP_READLINE) {
3008 right->op_flags |= OPf_STACKED;
3009 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3012 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3013 o = newBINOP(OP_SASSIGN, flags,
3014 scalar(right), mod(scalar(left), OP_SASSIGN) );
3026 newSTATEOP(I32 flags, char *label, OP *o)
3029 U32 seq = intro_my();
3032 NewOp(1101, cop, 1, COP);
3033 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3034 cop->op_type = OP_DBSTATE;
3035 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3038 cop->op_type = OP_NEXTSTATE;
3039 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3041 cop->op_flags = flags;
3042 cop->op_private = (PL_hints & HINT_UTF8);
3044 cop->op_private |= NATIVE_HINTS;
3046 PL_compiling.op_private = cop->op_private;
3047 cop->op_next = (OP*)cop;
3050 cop->cop_label = label;
3051 PL_hints |= HINT_BLOCK_SCOPE;
3054 cop->cop_arybase = PL_curcop->cop_arybase;
3055 if (PL_curcop->cop_warnings == WARN_NONE
3056 || PL_curcop->cop_warnings == WARN_ALL)
3057 cop->cop_warnings = PL_curcop->cop_warnings ;
3059 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3062 if (PL_copline == NOLINE)
3063 cop->cop_line = PL_curcop->cop_line;
3065 cop->cop_line = PL_copline;
3066 PL_copline = NOLINE;
3068 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3069 cop->cop_stash = PL_curstash;
3071 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3072 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3073 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3074 (void)SvIOK_on(*svp);
3076 SvSTASH(*svp) = (HV*)cop;
3080 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3083 /* "Introduce" my variables to visible status. */
3091 if (! PL_min_intro_pending)
3092 return PL_cop_seqmax;
3094 svp = AvARRAY(PL_comppad_name);
3095 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3096 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3097 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3098 SvNVX(sv) = (double)PL_cop_seqmax;
3101 PL_min_intro_pending = 0;
3102 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3103 return PL_cop_seqmax++;
3107 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3109 return new_logop(type, flags, &first, &other);
3113 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3118 OP *first = *firstp;
3119 OP *other = *otherp;
3121 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3122 return newBINOP(type, flags, scalar(first), scalar(other));
3124 scalarboolean(first);
3125 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3126 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3127 if (type == OP_AND || type == OP_OR) {
3133 first = *firstp = cUNOPo->op_first;
3135 first->op_next = o->op_next;
3136 cUNOPo->op_first = Nullop;
3140 if (first->op_type == OP_CONST) {
3141 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3142 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3144 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3155 else if (first->op_type == OP_WANTARRAY) {
3161 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3162 OP *k1 = ((UNOP*)first)->op_first;
3163 OP *k2 = k1->op_sibling;
3165 switch (first->op_type)
3168 if (k2 && k2->op_type == OP_READLINE
3169 && (k2->op_flags & OPf_STACKED)
3170 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3171 warnop = k2->op_type;
3175 if (k1->op_type == OP_READDIR
3176 || k1->op_type == OP_GLOB
3177 || k1->op_type == OP_EACH)
3178 warnop = k1->op_type;
3182 line_t oldline = PL_curcop->cop_line;
3183 PL_curcop->cop_line = PL_copline;
3185 "Value of %s%s can be \"0\"; test with defined()",
3187 ((warnop == OP_READLINE || warnop == OP_GLOB)
3188 ? " construct" : "() operator"));
3189 PL_curcop->cop_line = oldline;
3196 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3197 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3199 NewOp(1101, logop, 1, LOGOP);
3201 logop->op_type = type;
3202 logop->op_ppaddr = PL_ppaddr[type];
3203 logop->op_first = first;
3204 logop->op_flags = flags | OPf_KIDS;
3205 logop->op_other = LINKLIST(other);
3206 logop->op_private = 1 | (flags >> 8);
3208 /* establish postfix order */
3209 logop->op_next = LINKLIST(first);
3210 first->op_next = (OP*)logop;
3211 first->op_sibling = other;
3213 o = newUNOP(OP_NULL, 0, (OP*)logop);
3220 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3227 return newLOGOP(OP_AND, 0, first, trueop);
3229 return newLOGOP(OP_OR, 0, first, falseop);
3231 scalarboolean(first);
3232 if (first->op_type == OP_CONST) {
3233 if (SvTRUE(((SVOP*)first)->op_sv)) {
3244 else if (first->op_type == OP_WANTARRAY) {
3248 NewOp(1101, condop, 1, CONDOP);
3250 condop->op_type = OP_COND_EXPR;
3251 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3252 condop->op_first = first;
3253 condop->op_flags = flags | OPf_KIDS;
3254 condop->op_true = LINKLIST(trueop);
3255 condop->op_false = LINKLIST(falseop);
3256 condop->op_private = 1 | (flags >> 8);
3258 /* establish postfix order */
3259 condop->op_next = LINKLIST(first);
3260 first->op_next = (OP*)condop;
3262 first->op_sibling = trueop;
3263 trueop->op_sibling = falseop;
3264 o = newUNOP(OP_NULL, 0, (OP*)condop);
3266 trueop->op_next = o;
3267 falseop->op_next = o;
3273 newRANGE(I32 flags, OP *left, OP *right)
3281 NewOp(1101, condop, 1, CONDOP);
3283 condop->op_type = OP_RANGE;
3284 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3285 condop->op_first = left;
3286 condop->op_flags = OPf_KIDS;
3287 condop->op_true = LINKLIST(left);
3288 condop->op_false = LINKLIST(right);
3289 condop->op_private = 1 | (flags >> 8);
3291 left->op_sibling = right;
3293 condop->op_next = (OP*)condop;
3294 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3295 flop = newUNOP(OP_FLOP, 0, flip);
3296 o = newUNOP(OP_NULL, 0, flop);
3299 left->op_next = flip;
3300 right->op_next = flop;
3302 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3303 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3304 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3305 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3307 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3308 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3311 if (!flip->op_private || !flop->op_private)
3312 linklist(o); /* blow off optimizer unless constant */
3318 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3323 int once = block && block->op_flags & OPf_SPECIAL &&
3324 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3327 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3328 return block; /* do {} while 0 does once */
3329 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3330 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3331 expr = newUNOP(OP_DEFINED, 0,
3332 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3333 } else if (expr->op_flags & OPf_KIDS) {
3334 OP *k1 = ((UNOP*)expr)->op_first;
3335 OP *k2 = (k1) ? k1->op_sibling : NULL;
3336 switch (expr->op_type) {
3338 if (k2 && k2->op_type == OP_READLINE
3339 && (k2->op_flags & OPf_STACKED)
3340 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3341 expr = newUNOP(OP_DEFINED, 0, expr);
3345 if (k1->op_type == OP_READDIR
3346 || k1->op_type == OP_GLOB
3347 || k1->op_type == OP_EACH)
3348 expr = newUNOP(OP_DEFINED, 0, expr);
3354 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3355 o = new_logop(OP_AND, 0, &expr, &listop);
3358 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3360 if (once && o != listop)
3361 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3364 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3366 o->op_flags |= flags;
3368 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3373 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3382 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3383 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3384 expr = newUNOP(OP_DEFINED, 0,
3385 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3386 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3387 OP *k1 = ((UNOP*)expr)->op_first;
3388 OP *k2 = (k1) ? k1->op_sibling : NULL;
3389 switch (expr->op_type) {
3391 if (k2 && k2->op_type == OP_READLINE
3392 && (k2->op_flags & OPf_STACKED)
3393 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3394 expr = newUNOP(OP_DEFINED, 0, expr);
3398 if (k1->op_type == OP_READDIR
3399 || k1->op_type == OP_GLOB
3400 || k1->op_type == OP_EACH)
3401 expr = newUNOP(OP_DEFINED, 0, expr);
3407 block = newOP(OP_NULL, 0);
3410 next = LINKLIST(cont);
3412 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3413 if ((line_t)whileline != NOLINE) {
3414 PL_copline = whileline;
3415 cont = append_elem(OP_LINESEQ, cont,
3416 newSTATEOP(0, Nullch, Nullop));
3420 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3421 redo = LINKLIST(listop);
3424 PL_copline = whileline;
3426 o = new_logop(OP_AND, 0, &expr, &listop);
3427 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3428 op_free(expr); /* oops, it's a while (0) */
3430 return Nullop; /* listop already freed by new_logop */
3433 ((LISTOP*)listop)->op_last->op_next = condop =
3434 (o == listop ? redo : LINKLIST(o));
3442 NewOp(1101,loop,1,LOOP);
3443 loop->op_type = OP_ENTERLOOP;
3444 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3445 loop->op_private = 0;
3446 loop->op_next = (OP*)loop;
3449 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3451 loop->op_redoop = redo;
3452 loop->op_lastop = o;
3455 loop->op_nextop = next;
3457 loop->op_nextop = o;
3459 o->op_flags |= flags;
3460 o->op_private |= (flags >> 8);
3465 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3474 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3475 sv->op_type = OP_RV2GV;
3476 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3478 else if (sv->op_type == OP_PADSV) { /* private variable */
3479 padoff = sv->op_targ;
3483 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3484 padoff = sv->op_targ;
3485 iterflags |= OPf_SPECIAL;
3490 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3494 padoff = find_threadsv("_");
3495 iterflags |= OPf_SPECIAL;
3497 sv = newGVOP(OP_GV, 0, PL_defgv);
3500 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3501 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3502 iterflags |= OPf_STACKED;
3504 else if (expr->op_type == OP_NULL &&
3505 (expr->op_flags & OPf_KIDS) &&
3506 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3508 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3509 * set the STACKED flag to indicate that these values are to be
3510 * treated as min/max values by 'pp_iterinit'.
3512 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3513 CONDOP* range = (CONDOP*) flip->op_first;
3514 OP* left = range->op_first;
3515 OP* right = left->op_sibling;
3518 range->op_flags &= ~OPf_KIDS;
3519 range->op_first = Nullop;
3521 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3522 listop->op_first->op_next = range->op_true;
3523 left->op_next = range->op_false;
3524 right->op_next = (OP*)listop;
3525 listop->op_next = listop->op_first;
3528 expr = (OP*)(listop);
3530 iterflags |= OPf_STACKED;
3533 expr = mod(force_list(expr), OP_GREPSTART);
3537 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3538 append_elem(OP_LIST, expr, scalar(sv))));
3539 assert(!loop->op_next);
3540 #ifdef PL_OP_SLAB_ALLOC
3541 NewOp(1234,tmp,1,LOOP);
3542 Copy(loop,tmp,1,LOOP);
3545 Renew(loop, 1, LOOP);
3547 loop->op_targ = padoff;
3548 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3549 PL_copline = forline;
3550 return newSTATEOP(0, label, wop);
3554 newLOOPEX(I32 type, OP *label)
3560 if (type != OP_GOTO || label->op_type == OP_CONST) {
3561 /* "last()" means "last" */
3562 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3563 o = newOP(type, OPf_SPECIAL);
3565 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3566 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3572 if (label->op_type == OP_ENTERSUB)
3573 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3574 o = newUNOP(type, OPf_STACKED, label);
3576 PL_hints |= HINT_BLOCK_SCOPE;
3586 MUTEX_DESTROY(CvMUTEXP(cv));
3587 Safefree(CvMUTEXP(cv));
3590 #endif /* USE_THREADS */
3592 if (!CvXSUB(cv) && CvROOT(cv)) {
3594 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3595 croak("Can't undef active subroutine");
3598 croak("Can't undef active subroutine");
3599 #endif /* USE_THREADS */
3602 SAVESPTR(PL_curpad);
3606 op_free(CvROOT(cv));
3607 CvROOT(cv) = Nullop;
3610 SvPOK_off((SV*)cv); /* forget prototype */
3612 SvREFCNT_dec(CvGV(cv));
3614 SvREFCNT_dec(CvOUTSIDE(cv));
3615 CvOUTSIDE(cv) = Nullcv;
3616 if (CvPADLIST(cv)) {
3617 /* may be during global destruction */
3618 if (SvREFCNT(CvPADLIST(cv))) {
3619 I32 i = AvFILLp(CvPADLIST(cv));
3621 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3622 SV* sv = svp ? *svp : Nullsv;
3625 if (sv == (SV*)PL_comppad_name)
3626 PL_comppad_name = Nullav;
3627 else if (sv == (SV*)PL_comppad) {
3628 PL_comppad = Nullav;
3629 PL_curpad = Null(SV**);
3633 SvREFCNT_dec((SV*)CvPADLIST(cv));
3635 CvPADLIST(cv) = Nullav;
3639 #ifdef DEBUG_CLOSURES
3644 CV *outside = CvOUTSIDE(cv);
3645 AV* padlist = CvPADLIST(cv);
3652 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3654 (CvANON(cv) ? "ANON"
3655 : (cv == PL_main_cv) ? "MAIN"
3656 : CvUNIQUE(cv) ? "UNIQUE"
3657 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3660 : CvANON(outside) ? "ANON"
3661 : (outside == PL_main_cv) ? "MAIN"
3662 : CvUNIQUE(outside) ? "UNIQUE"
3663 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3668 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3669 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3670 pname = AvARRAY(pad_name);
3671 ppad = AvARRAY(pad);
3673 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3674 if (SvPOK(pname[ix]))
3675 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3677 SvFAKE(pname[ix]) ? "FAKE " : "",
3679 (long)I_32(SvNVX(pname[ix])),
3680 (long)SvIVX(pname[ix]));
3683 #endif /* DEBUG_CLOSURES */
3686 cv_clone2(CV *proto, CV *outside)
3691 AV* protopadlist = CvPADLIST(proto);
3692 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3693 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3694 SV** pname = AvARRAY(protopad_name);
3695 SV** ppad = AvARRAY(protopad);
3696 I32 fname = AvFILLp(protopad_name);
3697 I32 fpad = AvFILLp(protopad);
3701 assert(!CvUNIQUE(proto));
3704 SAVESPTR(PL_curpad);
3705 SAVESPTR(PL_comppad);
3706 SAVESPTR(PL_comppad_name);
3707 SAVESPTR(PL_compcv);
3709 cv = PL_compcv = (CV*)NEWSV(1104,0);
3710 sv_upgrade((SV *)cv, SvTYPE(proto));
3716 New(666, CvMUTEXP(cv), 1, perl_mutex);
3717 MUTEX_INIT(CvMUTEXP(cv));
3719 #endif /* USE_THREADS */
3720 CvFILEGV(cv) = CvFILEGV(proto);
3721 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3722 CvSTASH(cv) = CvSTASH(proto);
3723 CvROOT(cv) = CvROOT(proto);
3724 CvSTART(cv) = CvSTART(proto);
3726 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3729 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3731 PL_comppad_name = newAV();
3732 for (ix = fname; ix >= 0; ix--)
3733 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3735 PL_comppad = newAV();
3737 comppadlist = newAV();
3738 AvREAL_off(comppadlist);
3739 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3740 av_store(comppadlist, 1, (SV*)PL_comppad);
3741 CvPADLIST(cv) = comppadlist;
3742 av_fill(PL_comppad, AvFILLp(protopad));
3743 PL_curpad = AvARRAY(PL_comppad);
3745 av = newAV(); /* will be @_ */
3747 av_store(PL_comppad, 0, (SV*)av);
3748 AvFLAGS(av) = AVf_REIFY;
3750 for (ix = fpad; ix > 0; ix--) {
3751 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3752 if (namesv && namesv != &PL_sv_undef) {
3753 char *name = SvPVX(namesv); /* XXX */
3754 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3755 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3756 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3758 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3760 croak("panic: cv_clone: %s", name);
3762 else { /* our own lexical */
3765 /* anon code -- we'll come back for it */
3766 sv = SvREFCNT_inc(ppad[ix]);
3768 else if (*name == '@')
3770 else if (*name == '%')
3780 SV* sv = NEWSV(0,0);
3786 /* Now that vars are all in place, clone nested closures. */
3788 for (ix = fpad; ix > 0; ix--) {
3789 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3791 && namesv != &PL_sv_undef
3792 && !(SvFLAGS(namesv) & SVf_FAKE)
3793 && *SvPVX(namesv) == '&'
3794 && CvCLONE(ppad[ix]))
3796 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3797 SvREFCNT_dec(ppad[ix]);
3800 PL_curpad[ix] = (SV*)kid;
3804 #ifdef DEBUG_CLOSURES
3805 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3807 PerlIO_printf(Perl_debug_log, " from:\n");
3809 PerlIO_printf(Perl_debug_log, " to:\n");
3821 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3822 cv = cv_clone2(proto, CvOUTSIDE(proto));
3823 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3828 cv_ckproto(CV *cv, GV *gv, char *p)
3830 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3831 SV* msg = sv_newmortal();
3835 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3836 sv_setpv(msg, "Prototype mismatch:");
3838 sv_catpvf(msg, " sub %_", name);
3840 sv_catpvf(msg, " (%s)", SvPVX(cv));
3841 sv_catpv(msg, " vs ");
3843 sv_catpvf(msg, "(%s)", p);
3845 sv_catpv(msg, "none");
3853 if (!cv || !SvPOK(cv) || SvCUR(cv))
3855 return op_const_sv(CvSTART(cv), cv);
3859 op_const_sv(OP *o, CV *cv)
3866 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3867 o = cLISTOPo->op_first->op_sibling;
3869 for (; o; o = o->op_next) {
3870 OPCODE type = o->op_type;
3872 if(sv && o->op_next == o)
3874 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3876 if (type == OP_LEAVESUB || type == OP_RETURN)
3880 if (type == OP_CONST)
3882 else if (type == OP_PADSV && cv) {
3883 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3884 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3885 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3897 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3901 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3902 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3903 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3904 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3913 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3914 maximum a prototype before. */
3915 if (SvTYPE(gv) > SVt_NULL) {
3916 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3917 warn("Runaway prototype");
3918 cv_ckproto((CV*)gv, NULL, ps);
3921 sv_setpv((SV*)gv, ps);
3923 sv_setiv((SV*)gv, -1);
3924 SvREFCNT_dec(PL_compcv);
3925 cv = PL_compcv = NULL;
3926 PL_sub_generation++;
3930 if (!name || GvCVGEN(gv))
3932 else if (cv = GvCV(gv)) {
3933 cv_ckproto(cv, gv, ps);
3934 /* already defined (or promised)? */
3935 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3937 bool const_changed = TRUE;
3939 /* just a "sub foo;" when &foo is already defined */
3940 SAVEFREESV(PL_compcv);
3943 /* ahem, death to those who redefine active sort subs */
3944 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3945 croak("Can't redefine active sort subroutine %s", name);
3946 if(const_sv = cv_const_sv(cv))
3947 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3948 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3949 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3950 && HvNAME(GvSTASH(CvGV(cv)))
3951 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3953 line_t oldline = PL_curcop->cop_line;
3954 PL_curcop->cop_line = PL_copline;
3955 warner(WARN_REDEFINE,
3956 const_sv ? "Constant subroutine %s redefined"
3957 : "Subroutine %s redefined", name);
3958 PL_curcop->cop_line = oldline;
3964 if (cv) { /* must reuse cv if autoloaded */
3966 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3967 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3968 CvOUTSIDE(PL_compcv) = 0;
3969 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3970 CvPADLIST(PL_compcv) = 0;
3971 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3972 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3973 SvREFCNT_dec(PL_compcv);
3980 PL_sub_generation++;
3983 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3984 CvFILEGV(cv) = PL_curcop->cop_filegv;
3985 CvSTASH(cv) = PL_curstash;
3988 if (!CvMUTEXP(cv)) {
3989 New(666, CvMUTEXP(cv), 1, perl_mutex);
3990 MUTEX_INIT(CvMUTEXP(cv));
3992 #endif /* USE_THREADS */
3995 sv_setpv((SV*)cv, ps);
3997 if (PL_error_count) {
4001 char *s = strrchr(name, ':');
4003 if (strEQ(s, "BEGIN")) {
4005 "BEGIN not safe after errors--compilation aborted";
4006 if (PL_in_eval & EVAL_KEEPERR)
4009 /* force display of errors found but not reported */
4010 sv_catpv(ERRSV, not_safe);
4011 croak("%s", SvPVx(ERRSV, n_a));
4018 PL_copline = NOLINE;
4023 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4024 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4027 SV **namep = AvARRAY(PL_comppad_name);
4028 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4031 if (SvIMMORTAL(PL_curpad[ix]))
4034 * The only things that a clonable function needs in its
4035 * pad are references to outer lexicals and anonymous subs.
4036 * The rest are created anew during cloning.
4038 if (!((namesv = namep[ix]) != Nullsv &&
4039 namesv != &PL_sv_undef &&
4041 *SvPVX(namesv) == '&')))
4043 SvREFCNT_dec(PL_curpad[ix]);
4044 PL_curpad[ix] = Nullsv;
4049 AV *av = newAV(); /* Will be @_ */
4051 av_store(PL_comppad, 0, (SV*)av);
4052 AvFLAGS(av) = AVf_REIFY;
4054 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4055 if (SvIMMORTAL(PL_curpad[ix]))
4057 if (!SvPADMY(PL_curpad[ix]))
4058 SvPADTMP_on(PL_curpad[ix]);
4062 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4063 CvSTART(cv) = LINKLIST(CvROOT(cv));
4064 CvROOT(cv)->op_next = 0;
4070 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4071 SV *sv = NEWSV(0,0);
4072 SV *tmpstr = sv_newmortal();
4073 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4077 sv_setpvf(sv, "%_:%ld-%ld",
4078 GvSV(PL_curcop->cop_filegv),
4079 (long)PL_subline, (long)PL_curcop->cop_line);
4080 gv_efullname3(tmpstr, gv, Nullch);
4081 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4082 hv = GvHVn(db_postponed);
4083 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4084 && (cv = GvCV(db_postponed))) {
4089 perl_call_sv((SV*)cv, G_DISCARD);
4093 if ((s = strrchr(name,':')))
4097 if (strEQ(s, "BEGIN")) {
4098 I32 oldscope = PL_scopestack_ix;
4100 SAVESPTR(PL_compiling.cop_filegv);
4101 SAVEI16(PL_compiling.cop_line);
4103 sv_setsv(PL_rs, PL_nrs);
4106 PL_beginav = newAV();
4107 DEBUG_x( dump_sub(gv) );
4108 av_push(PL_beginav, (SV *)cv);
4110 call_list(oldscope, PL_beginav);
4112 PL_curcop = &PL_compiling;
4113 PL_compiling.op_private = PL_hints;
4116 else if (strEQ(s, "END") && !PL_error_count) {
4119 av_unshift(PL_endav, 1);
4120 av_store(PL_endav, 0, (SV *)cv);
4123 else if (strEQ(s, "INIT") && !PL_error_count) {
4125 PL_initav = newAV();
4126 av_push(PL_initav, SvREFCNT_inc(cv));
4132 PL_copline = NOLINE;
4137 /* XXX unsafe for threads if eval_owner isn't held */
4139 newCONSTSUB(HV *stash, char *name, SV *sv)
4142 U32 oldhints = PL_hints;
4143 HV *old_cop_stash = PL_curcop->cop_stash;
4144 HV *old_curstash = PL_curstash;
4145 line_t oldline = PL_curcop->cop_line;
4146 PL_curcop->cop_line = PL_copline;
4148 PL_hints &= ~HINT_BLOCK_SCOPE;
4150 PL_curstash = PL_curcop->cop_stash = stash;
4153 start_subparse(FALSE, 0),
4154 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4155 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4156 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4159 PL_hints = oldhints;
4160 PL_curcop->cop_stash = old_cop_stash;
4161 PL_curstash = old_curstash;
4162 PL_curcop->cop_line = oldline;
4166 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4169 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4172 if (cv = (name ? GvCV(gv) : Nullcv)) {
4174 /* just a cached method */
4178 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4179 /* already defined (or promised) */
4180 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4181 && HvNAME(GvSTASH(CvGV(cv)))
4182 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4183 line_t oldline = PL_curcop->cop_line;
4184 if (PL_copline != NOLINE)
4185 PL_curcop->cop_line = PL_copline;
4186 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4187 PL_curcop->cop_line = oldline;
4194 if (cv) /* must reuse cv if autoloaded */
4197 cv = (CV*)NEWSV(1105,0);
4198 sv_upgrade((SV *)cv, SVt_PVCV);
4202 PL_sub_generation++;
4205 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4207 New(666, CvMUTEXP(cv), 1, perl_mutex);
4208 MUTEX_INIT(CvMUTEXP(cv));
4210 #endif /* USE_THREADS */
4211 CvFILEGV(cv) = gv_fetchfile(filename);
4212 CvXSUB(cv) = subaddr;
4215 char *s = strrchr(name,':');
4220 if (strEQ(s, "BEGIN")) {
4222 PL_beginav = newAV();
4223 av_push(PL_beginav, (SV *)cv);
4226 else if (strEQ(s, "END")) {
4229 av_unshift(PL_endav, 1);
4230 av_store(PL_endav, 0, (SV *)cv);
4233 else if (strEQ(s, "INIT")) {
4235 PL_initav = newAV();
4236 av_push(PL_initav, (SV *)cv);
4247 newFORM(I32 floor, OP *o, OP *block)
4257 name = SvPVx(cSVOPo->op_sv, n_a);
4260 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4262 if (cv = GvFORM(gv)) {
4263 if (ckWARN(WARN_REDEFINE)) {
4264 line_t oldline = PL_curcop->cop_line;
4266 PL_curcop->cop_line = PL_copline;
4267 warner(WARN_REDEFINE, "Format %s redefined",name);
4268 PL_curcop->cop_line = oldline;
4274 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4275 CvFILEGV(cv) = PL_curcop->cop_filegv;
4277 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4278 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4279 SvPADTMP_on(PL_curpad[ix]);
4282 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4283 CvSTART(cv) = LINKLIST(CvROOT(cv));
4284 CvROOT(cv)->op_next = 0;
4287 PL_copline = NOLINE;
4294 return newUNOP(OP_REFGEN, 0,
4295 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4301 return newUNOP(OP_REFGEN, 0,
4302 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4306 newANONSUB(I32 floor, OP *proto, OP *block)
4308 return newUNOP(OP_REFGEN, 0,
4309 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4315 switch (o->op_type) {
4317 o->op_type = OP_PADAV;
4318 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4319 return ref(o, OP_RV2AV);
4322 o->op_type = OP_RV2AV;
4323 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4328 warn("oops: oopsAV");
4337 switch (o->op_type) {
4340 o->op_type = OP_PADHV;
4341 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4342 return ref(o, OP_RV2HV);
4346 o->op_type = OP_RV2HV;
4347 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4352 warn("oops: oopsHV");
4361 if (o->op_type == OP_PADANY) {
4362 o->op_type = OP_PADAV;
4363 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4366 return newUNOP(OP_RV2AV, 0, scalar(o));
4370 newGVREF(I32 type, OP *o)
4372 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4373 return newUNOP(OP_NULL, 0, o);
4374 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4380 if (o->op_type == OP_PADANY) {
4381 o->op_type = OP_PADHV;
4382 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4385 return newUNOP(OP_RV2HV, 0, scalar(o));
4391 croak("NOT IMPL LINE %d",__LINE__);
4397 newCVREF(I32 flags, OP *o)
4399 return newUNOP(OP_RV2CV, flags, scalar(o));
4405 if (o->op_type == OP_PADANY) {
4406 o->op_type = OP_PADSV;
4407 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4410 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4411 o->op_flags |= OPpDONE_SVREF;
4414 return newUNOP(OP_RV2SV, 0, scalar(o));
4417 /* Check routines. */
4425 name = NEWSV(1106,0);
4426 sv_upgrade(name, SVt_PVNV);
4427 sv_setpvn(name, "&", 1);
4430 ix = pad_alloc(o->op_type, SVs_PADMY);
4431 av_store(PL_comppad_name, ix, name);
4432 av_store(PL_comppad, ix, cSVOPo->op_sv);
4433 SvPADMY_on(cSVOPo->op_sv);
4434 cSVOPo->op_sv = Nullsv;
4435 cSVOPo->op_targ = ix;
4442 o->op_private = PL_hints;
4449 if (cUNOPo->op_first->op_type == OP_CONCAT)
4450 o->op_flags |= OPf_STACKED;
4457 if (o->op_flags & OPf_KIDS) {
4460 OPCODE type = o->op_type;
4461 o = modkids(ck_fun(o), type);
4462 kid = cUNOPo->op_first;
4463 newop = kUNOP->op_first->op_sibling;
4465 (newop->op_sibling ||
4466 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4467 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4468 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4472 op_free(kUNOP->op_first);
4473 kUNOP->op_first = newop;
4475 o->op_ppaddr = PL_ppaddr[++o->op_type];
4484 if (o->op_flags & OPf_KIDS) {
4485 OP *kid = cUNOPo->op_first;
4486 if (kid->op_type == OP_HSLICE)
4487 o->op_private |= OPpSLICE;
4488 else if (kid->op_type != OP_HELEM)
4489 croak("%s argument is not a HASH element or slice",
4490 PL_op_desc[o->op_type]);
4499 I32 type = o->op_type;
4501 if (o->op_flags & OPf_KIDS) {
4502 if (cLISTOPo->op_first->op_type == OP_STUB) {
4504 o = newUNOP(type, OPf_SPECIAL,
4505 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4515 PL_hints |= HINT_BLOCK_SCOPE;
4516 if (o->op_flags & OPf_KIDS) {
4517 SVOP *kid = (SVOP*)cUNOPo->op_first;
4520 o->op_flags &= ~OPf_KIDS;
4523 else if (kid->op_type == OP_LINESEQ) {
4526 kid->op_next = o->op_next;
4527 cUNOPo->op_first = 0;
4530 NewOp(1101, enter, 1, LOGOP);
4531 enter->op_type = OP_ENTERTRY;
4532 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4533 enter->op_private = 0;
4535 /* establish postfix order */
4536 enter->op_next = (OP*)enter;
4538 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4539 o->op_type = OP_LEAVETRY;
4540 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4541 enter->op_other = o;
4549 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4551 o->op_targ = (PADOFFSET)PL_hints;
4559 if (o->op_flags & OPf_STACKED) {
4561 kid = cUNOPo->op_first->op_sibling;
4562 if (kid->op_type == OP_RV2GV)
4574 if (o->op_flags & OPf_KIDS) {
4575 OP *kid = cUNOPo->op_first;
4576 if (kid->op_type != OP_HELEM)
4577 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4585 ck_gvconst(register OP *o)
4587 o = fold_constants(o);
4588 if (o->op_type == OP_CONST)
4595 ck_rvconst(register OP *o)
4598 SVOP *kid = (SVOP*)cUNOPo->op_first;
4600 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4601 if (kid->op_type == OP_CONST) {
4605 SV *kidsv = kid->op_sv;
4608 /* Is it a constant from cv_const_sv()? */
4609 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4610 SV *rsv = SvRV(kidsv);
4611 int svtype = SvTYPE(rsv);
4612 char *badtype = Nullch;
4614 switch (o->op_type) {
4616 if (svtype > SVt_PVMG)
4617 badtype = "a SCALAR";
4620 if (svtype != SVt_PVAV)
4621 badtype = "an ARRAY";
4624 if (svtype != SVt_PVHV) {
4625 if (svtype == SVt_PVAV) { /* pseudohash? */
4626 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4627 if (ksv && SvROK(*ksv)
4628 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4637 if (svtype != SVt_PVCV)
4642 croak("Constant is not %s reference", badtype);
4645 name = SvPV(kidsv, n_a);
4646 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4647 char *badthing = Nullch;
4648 switch (o->op_type) {
4650 badthing = "a SCALAR";
4653 badthing = "an ARRAY";
4656 badthing = "a HASH";
4661 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4665 * This is a little tricky. We only want to add the symbol if we
4666 * didn't add it in the lexer. Otherwise we get duplicate strict
4667 * warnings. But if we didn't add it in the lexer, we must at
4668 * least pretend like we wanted to add it even if it existed before,
4669 * or we get possible typo warnings. OPpCONST_ENTERED says
4670 * whether the lexer already added THIS instance of this symbol.
4672 iscv = (o->op_type == OP_RV2CV) * 2;
4674 gv = gv_fetchpv(name,
4675 iscv | !(kid->op_private & OPpCONST_ENTERED),
4678 : o->op_type == OP_RV2SV
4680 : o->op_type == OP_RV2AV
4682 : o->op_type == OP_RV2HV
4685 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4687 kid->op_type = OP_GV;
4688 SvREFCNT_dec(kid->op_sv);
4689 kid->op_sv = SvREFCNT_inc(gv);
4699 I32 type = o->op_type;
4701 if (o->op_flags & OPf_REF)
4704 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4705 SVOP *kid = (SVOP*)cUNOPo->op_first;
4707 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4709 OP *newop = newGVOP(type, OPf_REF,
4710 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4717 if (type == OP_FTTTY)
4718 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4721 return newUNOP(type, 0, newDEFSVOP());
4734 int type = o->op_type;
4735 register I32 oa = PL_opargs[type] >> OASHIFT;
4737 if (o->op_flags & OPf_STACKED) {
4738 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4741 return no_fh_allowed(o);
4744 if (o->op_flags & OPf_KIDS) {
4746 tokid = &cLISTOPo->op_first;
4747 kid = cLISTOPo->op_first;
4748 if (kid->op_type == OP_PUSHMARK ||
4749 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4751 tokid = &kid->op_sibling;
4752 kid = kid->op_sibling;
4754 if (!kid && PL_opargs[type] & OA_DEFGV)
4755 *tokid = kid = newDEFSVOP();
4759 sibl = kid->op_sibling;
4762 /* list seen where single (scalar) arg expected? */
4763 if (numargs == 1 && !(oa >> 4)
4764 && kid->op_type == OP_LIST && type != OP_SCALAR)
4766 return too_many_arguments(o,PL_op_desc[type]);
4779 if (kid->op_type == OP_CONST &&
4780 (kid->op_private & OPpCONST_BARE))
4782 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4783 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4784 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4785 if (ckWARN(WARN_SYNTAX))
4787 "Array @%s missing the @ in argument %ld of %s()",
4788 name, (long)numargs, PL_op_desc[type]);
4791 kid->op_sibling = sibl;
4794 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4795 bad_type(numargs, "array", PL_op_desc[type], kid);
4799 if (kid->op_type == OP_CONST &&
4800 (kid->op_private & OPpCONST_BARE))
4802 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4803 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4804 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4805 if (ckWARN(WARN_SYNTAX))
4807 "Hash %%%s missing the %% in argument %ld of %s()",
4808 name, (long)numargs, PL_op_desc[type]);
4811 kid->op_sibling = sibl;
4814 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4815 bad_type(numargs, "hash", PL_op_desc[type], kid);
4820 OP *newop = newUNOP(OP_NULL, 0, kid);
4821 kid->op_sibling = 0;
4823 newop->op_next = newop;
4825 kid->op_sibling = sibl;
4830 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4831 if (kid->op_type == OP_CONST &&
4832 (kid->op_private & OPpCONST_BARE))
4834 OP *newop = newGVOP(OP_GV, 0,
4835 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4840 else if (kid->op_type == OP_READLINE) {
4841 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4842 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4845 I32 flags = OPf_SPECIAL;
4847 /* is this op a FH constructor? */
4848 if (is_handle_constructor(o,numargs)) {
4850 /* Set a flag to tell rv2gv to vivify
4851 * need to "prove" flag does not mean something
4852 * else already - NI-S 1999/05/07
4856 /* Helps with open($array[$n],...)
4857 but is too simplistic - need to do selectively
4862 kid->op_sibling = 0;
4863 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4865 kid->op_private |= priv;
4868 kid->op_sibling = sibl;
4874 mod(scalar(kid), type);
4878 tokid = &kid->op_sibling;
4879 kid = kid->op_sibling;
4881 o->op_private |= numargs;
4883 return too_many_arguments(o,PL_op_desc[o->op_type]);
4886 else if (PL_opargs[type] & OA_DEFGV) {
4888 return newUNOP(type, 0, newDEFSVOP());
4892 while (oa & OA_OPTIONAL)
4894 if (oa && oa != OA_LIST)
4895 return too_few_arguments(o,PL_op_desc[o->op_type]);
4905 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4906 append_elem(OP_GLOB, o, newDEFSVOP());
4908 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4909 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4911 if (gv && GvIMPORTED_CV(gv)) {
4912 append_elem(OP_GLOB, o,
4913 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4914 o->op_type = OP_LIST;
4915 o->op_ppaddr = PL_ppaddr[OP_LIST];
4916 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4917 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4918 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4919 append_elem(OP_LIST, o,
4920 scalar(newUNOP(OP_RV2CV, 0,
4921 newGVOP(OP_GV, 0, gv)))));
4922 o = newUNOP(OP_NULL, 0, ck_subr(o));
4923 o->op_targ = OP_GLOB; /* hint at what it used to be */
4926 gv = newGVgen("main");
4928 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4938 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4940 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4941 NewOp(1101, gwop, 1, LOGOP);
4943 if (o->op_flags & OPf_STACKED) {
4946 kid = cLISTOPo->op_first->op_sibling;
4947 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4950 kid->op_next = (OP*)gwop;
4951 o->op_flags &= ~OPf_STACKED;
4953 kid = cLISTOPo->op_first->op_sibling;
4954 if (type == OP_MAPWHILE)
4961 kid = cLISTOPo->op_first->op_sibling;
4962 if (kid->op_type != OP_NULL)
4963 croak("panic: ck_grep");
4964 kid = kUNOP->op_first;
4966 gwop->op_type = type;
4967 gwop->op_ppaddr = PL_ppaddr[type];
4968 gwop->op_first = listkids(o);
4969 gwop->op_flags |= OPf_KIDS;
4970 gwop->op_private = 1;
4971 gwop->op_other = LINKLIST(kid);
4972 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4973 kid->op_next = (OP*)gwop;
4975 kid = cLISTOPo->op_first->op_sibling;
4976 if (!kid || !kid->op_sibling)
4977 return too_few_arguments(o,PL_op_desc[o->op_type]);
4978 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4979 mod(kid, OP_GREPSTART);
4987 if (o->op_flags & OPf_KIDS) {
4988 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4990 kid = kid->op_sibling; /* get past "big" */
4991 if (kid && kid->op_type == OP_CONST)
4992 fbm_compile(((SVOP*)kid)->op_sv, 0);
4998 ck_lengthconst(OP *o)
5000 /* XXX length optimization goes here */
5007 OPCODE type = o->op_type;
5008 return modkids(ck_fun(o), type);
5012 ck_defined(OP *o) /* 19990527 MJD */
5014 if (ckWARN(WARN_DEPRECATED)) {
5015 switch (cUNOPo->op_first->op_type) {
5018 case OP_AASSIGN: /* Is this a good idea? */
5019 warner(WARN_DEPRECATED, "defined(@array) is deprecated (and not really meaningful)");
5020 warner(WARN_DEPRECATED, "(Maybe you should just omit the defined()?)\n");
5024 warner(WARN_DEPRECATED, "defined(%hash) is deprecated (and not really meaningful)");
5025 warner(WARN_DEPRECATED, "(Maybe you should just omit the defined()?)\n");
5038 OPCODE type = o->op_type;
5039 return refkids(ck_fun(o), type);
5047 kid = cLISTOPo->op_first;
5050 kid = cLISTOPo->op_first;
5052 if (kid->op_type == OP_PUSHMARK)
5053 kid = kid->op_sibling;
5054 if (kid && o->op_flags & OPf_STACKED)
5055 kid = kid->op_sibling;
5056 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5057 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5058 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5059 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5060 cLISTOPo->op_first->op_sibling = kid;
5061 cLISTOPo->op_last = kid;
5062 kid = kid->op_sibling;
5067 append_elem(o->op_type, o, newDEFSVOP());
5073 if (PL_hints & HINT_LOCALE)
5074 o->op_private |= OPpLOCALE;
5081 ck_fun_locale(OP *o)
5087 if (PL_hints & HINT_LOCALE)
5088 o->op_private |= OPpLOCALE;
5099 if (PL_hints & HINT_LOCALE)
5100 o->op_private |= OPpLOCALE;
5109 o->op_private |= OPpRUNTIME;
5122 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5123 o->op_private |= OPpREPEAT_DOLIST;
5124 cBINOPo->op_first = force_list(cBINOPo->op_first);
5134 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5135 SVOP *kid = (SVOP*)cUNOPo->op_first;
5137 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5139 for (s = SvPVX(kid->op_sv); *s; s++) {
5140 if (*s == ':' && s[1] == ':') {
5142 Move(s+2, s+1, strlen(s+2)+1, char);
5143 --SvCUR(kid->op_sv);
5146 sv_catpvn(kid->op_sv, ".pm", 3);
5156 croak("NOT IMPL LINE %d",__LINE__);
5166 if (o->op_flags & OPf_KIDS) {
5167 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5168 if (kid && kid->op_sibling) {
5169 o->op_type = OP_SSELECT;
5170 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5172 return fold_constants(o);
5176 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5177 if (kid && kid->op_type == OP_RV2GV)
5178 kid->op_private &= ~HINT_STRICT_REFS;
5185 I32 type = o->op_type;
5187 if (!(o->op_flags & OPf_KIDS)) {
5192 if (!CvUNIQUE(PL_compcv)) {
5193 argop = newOP(OP_PADAV, OPf_REF);
5194 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5197 argop = newUNOP(OP_RV2AV, 0,
5198 scalar(newGVOP(OP_GV, 0,
5199 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5202 argop = newUNOP(OP_RV2AV, 0,
5203 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5204 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5205 #endif /* USE_THREADS */
5206 return newUNOP(type, 0, scalar(argop));
5208 return scalar(modkids(ck_fun(o), type));
5216 if (PL_hints & HINT_LOCALE)
5217 o->op_private |= OPpLOCALE;
5220 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5222 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5223 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5225 kid = kUNOP->op_first; /* get past null */
5227 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5229 if (kid->op_type == OP_SCOPE) {
5233 else if (kid->op_type == OP_LEAVE) {
5234 if (o->op_type == OP_SORT) {
5235 null(kid); /* wipe out leave */
5238 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5239 if (k->op_next == kid)
5244 kid->op_next = 0; /* just disconnect the leave */
5245 k = kLISTOP->op_first;
5249 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5250 if (o->op_type == OP_SORT)
5254 o->op_flags |= OPf_SPECIAL;
5256 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5257 null(cLISTOPo->op_first->op_sibling);
5264 simplify_sort(OP *o)
5267 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5270 if (!(o->op_flags & OPf_STACKED))
5272 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5273 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5274 kid = kUNOP->op_first; /* get past null */
5275 if (kid->op_type != OP_SCOPE)
5277 kid = kLISTOP->op_last; /* get past scope */
5278 switch(kid->op_type) {
5286 k = kid; /* remember this node*/
5287 if (kBINOP->op_first->op_type != OP_RV2SV)
5289 kid = kBINOP->op_first; /* get past cmp */
5290 if (kUNOP->op_first->op_type != OP_GV)
5292 kid = kUNOP->op_first; /* get past rv2sv */
5293 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5295 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5297 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5301 kid = k; /* back to cmp */
5302 if (kBINOP->op_last->op_type != OP_RV2SV)
5304 kid = kBINOP->op_last; /* down to 2nd arg */
5305 if (kUNOP->op_first->op_type != OP_GV)
5307 kid = kUNOP->op_first; /* get past rv2sv */
5308 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5310 ? strNE(GvNAME(kGVOP->op_gv), "a")
5311 : strNE(GvNAME(kGVOP->op_gv), "b")))
5313 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5315 o->op_private |= OPpSORT_REVERSE;
5316 if (k->op_type == OP_NCMP)
5317 o->op_private |= OPpSORT_NUMERIC;
5318 if (k->op_type == OP_I_NCMP)
5319 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5320 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5321 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5322 cLISTOPo->op_children = 1;
5330 if (o->op_flags & OPf_STACKED)
5331 return no_fh_allowed(o);
5333 kid = cLISTOPo->op_first;
5334 if (kid->op_type != OP_NULL)
5335 croak("panic: ck_split");
5336 kid = kid->op_sibling;
5337 op_free(cLISTOPo->op_first);
5338 cLISTOPo->op_first = kid;
5340 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5341 cLISTOPo->op_last = kid; /* There was only one element previously */
5344 if (kid->op_type != OP_MATCH) {
5345 OP *sibl = kid->op_sibling;
5346 kid->op_sibling = 0;
5347 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5348 if (cLISTOPo->op_first == cLISTOPo->op_last)
5349 cLISTOPo->op_last = kid;
5350 cLISTOPo->op_first = kid;
5351 kid->op_sibling = sibl;
5354 kid->op_type = OP_PUSHRE;
5355 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5358 if (!kid->op_sibling)
5359 append_elem(OP_SPLIT, o, newDEFSVOP());
5361 kid = kid->op_sibling;
5364 if (!kid->op_sibling)
5365 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5367 kid = kid->op_sibling;
5370 if (kid->op_sibling)
5371 return too_many_arguments(o,PL_op_desc[o->op_type]);
5380 OP *prev = ((cUNOPo->op_first->op_sibling)
5381 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5382 OP *o2 = prev->op_sibling;
5391 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5392 if (cvop->op_type == OP_RV2CV) {
5394 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5395 null(cvop); /* disable rv2cv */
5396 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5397 if (tmpop->op_type == OP_GV) {
5398 cv = GvCVu(tmpop->op_sv);
5399 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5400 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5401 proto = SvPV((SV*)cv, n_a);
5405 else if (cvop->op_type == OP_METHOD) {
5406 if (o2->op_type == OP_CONST)
5407 o2->op_private &= ~OPpCONST_STRICT;
5409 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5410 if (PERLDB_SUB && PL_curstash != PL_debstash)
5411 o->op_private |= OPpENTERSUB_DB;
5412 while (o2 != cvop) {
5416 return too_many_arguments(o, gv_ename(namegv));
5434 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5435 bad_type(arg, "block", gv_ename(namegv), o2);
5438 /* '*' allows any scalar type, including bareword */
5441 if (o2->op_type == OP_RV2GV)
5442 goto wrapref; /* autoconvert GLOB -> GLOBref */
5443 else if (o2->op_type == OP_CONST)
5444 o2->op_private &= ~OPpCONST_STRICT;
5445 else if (o2->op_type == OP_ENTERSUB) {
5446 /* accidental subroutine, revert to bareword */
5447 OP *gvop = ((UNOP*)o2)->op_first;
5448 if (gvop && gvop->op_type == OP_NULL) {
5449 gvop = ((UNOP*)gvop)->op_first;
5451 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5454 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5455 (gvop = ((UNOP*)gvop)->op_first) &&
5456 gvop->op_type == OP_GV)
5458 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5459 OP *sibling = o2->op_sibling;
5461 o2 = newSVOP(OP_CONST, 0,
5462 newSVpvn(GvNAME(gv),
5464 prev->op_sibling = o2;
5465 o2->op_sibling = sibling;
5477 if (o2->op_type != OP_RV2GV)
5478 bad_type(arg, "symbol", gv_ename(namegv), o2);
5481 if (o2->op_type != OP_RV2CV)
5482 bad_type(arg, "sub", gv_ename(namegv), o2);
5485 if (o2->op_type != OP_RV2SV
5486 && o2->op_type != OP_PADSV
5487 && o2->op_type != OP_THREADSV)
5489 bad_type(arg, "scalar", gv_ename(namegv), o2);
5493 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5494 bad_type(arg, "array", gv_ename(namegv), o2);
5497 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5498 bad_type(arg, "hash", gv_ename(namegv), o2);
5502 OP* sib = kid->op_sibling;
5503 kid->op_sibling = 0;
5504 o2 = newUNOP(OP_REFGEN, 0, kid);
5505 o2->op_sibling = sib;
5506 prev->op_sibling = o2;
5517 croak("Malformed prototype for %s: %s",
5518 gv_ename(namegv), SvPV((SV*)cv, n_a));
5523 mod(o2, OP_ENTERSUB);
5525 o2 = o2->op_sibling;
5527 if (proto && !optional &&
5528 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5529 return too_few_arguments(o, gv_ename(namegv));
5536 SvREADONLY_on(cSVOPo->op_sv);
5543 if (o->op_flags & OPf_KIDS) {
5544 SVOP *kid = (SVOP*)cUNOPo->op_first;
5546 if (kid->op_type == OP_NULL)
5547 kid = (SVOP*)kid->op_sibling;
5549 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5550 o->op_flags |= OPf_SPECIAL;
5555 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5558 peep(register OP *o)
5561 register OP* oldop = 0;
5564 if (!o || o->op_seq)
5568 SAVESPTR(PL_curcop);
5569 for (; o; o = o->op_next) {
5575 switch (o->op_type) {
5578 PL_curcop = ((COP*)o); /* for warnings */
5579 o->op_seq = PL_op_seqmax++;
5583 if (cSVOPo->op_private & OPpCONST_STRICT)
5584 no_bareword_allowed(o);
5593 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5595 o->op_seq = PL_op_seqmax++;
5598 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5599 o->op_seq = PL_op_seqmax++;
5600 break; /* Scalar stub must produce undef. List stub is noop */
5604 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5605 PL_curcop = ((COP*)o);
5611 if (oldop && o->op_next) {
5612 oldop->op_next = o->op_next;
5615 o->op_seq = PL_op_seqmax++;
5619 if (o->op_next->op_type == OP_RV2SV) {
5620 if (!(o->op_next->op_private & OPpDEREF)) {
5622 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5623 o->op_next = o->op_next->op_next;
5624 o->op_type = OP_GVSV;
5625 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5628 else if (o->op_next->op_type == OP_RV2AV) {
5629 OP* pop = o->op_next->op_next;
5631 if (pop->op_type == OP_CONST &&
5632 (PL_op = pop->op_next) &&
5633 pop->op_next->op_type == OP_AELEM &&
5634 !(pop->op_next->op_private &
5635 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5636 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5640 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5644 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5645 o->op_next = pop->op_next->op_next;
5646 o->op_type = OP_AELEMFAST;
5647 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5648 o->op_private = (U8)i;
5649 GvAVn(((GVOP*)o)->op_gv);
5652 o->op_seq = PL_op_seqmax++;
5659 o->op_seq = PL_op_seqmax++;
5660 while (cLOGOP->op_other->op_type == OP_NULL)
5661 cLOGOP->op_other = cLOGOP->op_other->op_next;
5662 peep(cLOGOP->op_other);
5666 o->op_seq = PL_op_seqmax++;
5667 peep(cCONDOP->op_true);
5668 peep(cCONDOP->op_false);
5672 o->op_seq = PL_op_seqmax++;
5673 peep(cLOOP->op_redoop);
5674 peep(cLOOP->op_nextop);
5675 peep(cLOOP->op_lastop);
5681 o->op_seq = PL_op_seqmax++;
5682 peep(cPMOP->op_pmreplstart);
5686 o->op_seq = PL_op_seqmax++;
5687 if (ckWARN(WARN_SYNTAX) && o->op_next
5688 && o->op_next->op_type == OP_NEXTSTATE) {
5689 if (o->op_next->op_sibling &&
5690 o->op_next->op_sibling->op_type != OP_EXIT &&
5691 o->op_next->op_sibling->op_type != OP_WARN &&
5692 o->op_next->op_sibling->op_type != OP_DIE) {
5693 line_t oldline = PL_curcop->cop_line;
5695 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5696 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5697 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5698 PL_curcop->cop_line = oldline;
5712 if ((o->op_private & (OPpLVAL_INTRO))
5713 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5715 rop = (UNOP*)((BINOP*)o)->op_first;
5716 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5718 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5719 if (!SvOBJECT(lexname))
5721 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5722 if (!fields || !GvHV(*fields))
5724 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5725 key = SvPV(*svp, keylen);
5726 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5728 croak("No such field \"%s\" in variable %s of type %s",
5729 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5731 ind = SvIV(*indsvp);
5733 croak("Bad index while coercing array into hash");
5734 rop->op_type = OP_RV2AV;
5735 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5736 o->op_type = OP_AELEM;
5737 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5739 *svp = newSViv(ind);
5744 o->op_seq = PL_op_seqmax++;