3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*PL_check
24 #define CHECKCALL *PL_check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", PL_op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
59 SV* tmpsv = sv_newmortal();
60 gv_efullname3(tmpsv, gv, Nullch);
61 return SvPV(tmpsv,PL_na);
67 yyerror(form("Missing comma after first argument to %s function",
68 PL_op_desc[o->op_type]));
73 too_few_arguments(OP *o, char *name)
75 yyerror(form("Not enough arguments for %s", name));
80 too_many_arguments(OP *o, char *name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(I32 n, char *t, char *name, OP *kid)
89 yyerror(form("Type of arg %d to %s must be %s (not %s)",
90 (int)n, name, t, PL_op_desc[kid->op_type]));
96 int type = o->op_type;
97 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
98 yyerror(form("Can't use subscript on %s", PL_op_desc[type]));
99 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
101 SV *msg = sv_2mortal(
102 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
103 type == OP_ENTERSUB ? '&' : '%'));
107 sv_catsv(GvSV(PL_errgv), msg);
109 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
114 /* "register" allocation */
117 pad_allocmy(char *name)
125 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
126 name[1] == '_' && (int)strlen(name) > 2))
128 if (!isPRINT(name[1])) {
130 name[2] = toCTRL(name[1]);
133 croak("Can't use global %s in \"my\"",name);
135 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
136 SV **svp = AvARRAY(PL_comppad_name);
137 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
139 && sv != &PL_sv_undef
140 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
141 && strEQ(name, SvPVX(sv)))
144 "\"my\" variable %s masks earlier declaration in same %s",
145 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
150 off = pad_alloc(OP_PADSV, SVs_PADMY);
152 sv_upgrade(sv, SVt_PVNV);
154 if (PL_in_my_stash) {
156 croak("Can't declare class for non-scalar %s in \"my\"",name);
158 (void)SvUPGRADE(sv, SVt_PVMG);
159 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
162 av_store(PL_comppad_name, off, sv);
163 SvNVX(sv) = (double)PAD_MAX;
164 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
165 if (!PL_min_intro_pending)
166 PL_min_intro_pending = off;
167 PL_max_intro_pending = off;
169 av_store(PL_comppad, off, (SV*)newAV());
170 else if (*name == '%')
171 av_store(PL_comppad, off, (SV*)newHV());
172 SvPADMY_on(PL_curpad[off]);
177 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
184 register PERL_CONTEXT *cx;
186 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
187 AV *curlist = CvPADLIST(cv);
188 SV **svp = av_fetch(curlist, 0, FALSE);
191 if (!svp || *svp == &PL_sv_undef)
194 svp = AvARRAY(curname);
195 for (off = AvFILLp(curname); off > 0; off--) {
196 if ((sv = svp[off]) &&
197 sv != &PL_sv_undef &&
199 seq > I_32(SvNVX(sv)) &&
200 strEQ(SvPVX(sv), name))
211 return 0; /* don't clone from inactive stack frame */
215 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
216 oldsv = *av_fetch(oldpad, off, TRUE);
217 if (!newoff) { /* Not a mere clone operation. */
218 SV *namesv = NEWSV(1103,0);
219 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
220 sv_upgrade(namesv, SVt_PVNV);
221 sv_setpv(namesv, name);
222 av_store(PL_comppad_name, newoff, namesv);
223 SvNVX(namesv) = (double)PL_curcop->cop_seq;
224 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
225 SvFAKE_on(namesv); /* A ref, not a real var */
226 if (SvOBJECT(sv)) { /* A typed var */
228 (void)SvUPGRADE(namesv, SVt_PVMG);
229 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
232 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
233 /* "It's closures all the way down." */
234 CvCLONE_on(PL_compcv);
236 if (CvANON(PL_compcv))
237 oldsv = Nullsv; /* no need to keep ref */
242 bcv && bcv != cv && !CvCLONE(bcv);
243 bcv = CvOUTSIDE(bcv))
248 if (ckWARN(WARN_CLOSURE)
249 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
252 "Variable \"%s\" may be unavailable",
260 else if (!CvUNIQUE(PL_compcv)) {
261 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
263 "Variable \"%s\" will not stay shared", name);
266 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
272 /* Nothing in current lexical context--try eval's context, if any.
273 * This is necessary to let the perldb get at lexically scoped variables.
274 * XXX This will also probably interact badly with eval tree caching.
277 for (i = cx_ix; i >= 0; i--) {
279 switch (CxTYPE(cx)) {
281 if (i == 0 && saweval) {
282 seq = cxstack[saweval].blk_oldcop->cop_seq;
283 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
287 switch (cx->blk_eval.old_op_type) {
293 /* require must have its own scope */
301 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
302 saweval = i; /* so we know where we were called from */
305 seq = cxstack[saweval].blk_oldcop->cop_seq;
306 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
314 pad_findmy(char *name)
320 SV **svp = AvARRAY(PL_comppad_name);
321 U32 seq = PL_cop_seqmax;
327 * Special case to get lexical (and hence per-thread) @_.
328 * XXX I need to find out how to tell at parse-time whether use
329 * of @_ should refer to a lexical (from a sub) or defgv (global
330 * scope and maybe weird sub-ish things like formats). See
331 * startsub in perly.y. It's possible that @_ could be lexical
332 * (at least from subs) even in non-threaded perl.
334 if (strEQ(name, "@_"))
335 return 0; /* success. (NOT_IN_PAD indicates failure) */
336 #endif /* USE_THREADS */
338 /* The one we're looking for is probably just before comppad_name_fill. */
339 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
340 if ((sv = svp[off]) &&
341 sv != &PL_sv_undef &&
344 seq > I_32(SvNVX(sv)))) &&
345 strEQ(SvPVX(sv), name))
348 return (PADOFFSET)off;
349 pendoff = off; /* this pending def. will override import */
353 outside = CvOUTSIDE(PL_compcv);
355 /* Check if if we're compiling an eval'', and adjust seq to be the
356 * eval's seq number. This depends on eval'' having a non-null
357 * CvOUTSIDE() while it is being compiled. The eval'' itself is
358 * identified by CvUNIQUE being set and CvGV being null. */
359 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
360 cx = &cxstack[cxstack_ix];
362 seq = cx->blk_oldcop->cop_seq;
365 /* See if it's in a nested scope */
366 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
368 /* If there is a pending local definition, this new alias must die */
370 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
371 return off; /* pad_findlex returns 0 for failure...*/
373 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
377 pad_leavemy(I32 fill)
380 SV **svp = AvARRAY(PL_comppad_name);
382 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
383 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
384 if ((sv = svp[off]) && sv != &PL_sv_undef)
385 warn("%s never introduced", SvPVX(sv));
388 /* "Deintroduce" my variables that are leaving with this scope. */
389 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
390 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
391 SvIVX(sv) = PL_cop_seqmax;
396 pad_alloc(I32 optype, U32 tmptype)
402 if (AvARRAY(PL_comppad) != PL_curpad)
403 croak("panic: pad_alloc");
404 if (PL_pad_reset_pending)
406 if (tmptype & SVs_PADMY) {
408 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
409 } while (SvPADBUSY(sv)); /* need a fresh one */
410 retval = AvFILLp(PL_comppad);
413 SV **names = AvARRAY(PL_comppad_name);
414 SSize_t names_fill = AvFILLp(PL_comppad_name);
417 * "foreach" index vars temporarily become aliases to non-"my"
418 * values. Thus we must skip, not just pad values that are
419 * marked as current pad values, but also those with names.
421 if (++PL_padix <= names_fill &&
422 (sv = names[PL_padix]) && sv != &PL_sv_undef)
424 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
425 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
430 SvFLAGS(sv) |= tmptype;
431 PL_curpad = AvARRAY(PL_comppad);
433 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
434 (unsigned long) thr, (unsigned long) PL_curpad,
435 (long) retval, PL_op_name[optype]));
437 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
438 (unsigned long) PL_curpad,
439 (long) retval, PL_op_name[optype]));
440 #endif /* USE_THREADS */
441 return (PADOFFSET)retval;
449 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
450 (unsigned long) thr, (unsigned long) PL_curpad, po));
453 croak("panic: pad_sv po");
454 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
455 (unsigned long) PL_curpad, po));
456 #endif /* USE_THREADS */
457 return PL_curpad[po]; /* eventually we'll turn this into a macro */
461 pad_free(PADOFFSET po)
466 if (AvARRAY(PL_comppad) != PL_curpad)
467 croak("panic: pad_free curpad");
469 croak("panic: pad_free po");
471 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
472 (unsigned long) thr, (unsigned long) PL_curpad, po));
474 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
475 (unsigned long) PL_curpad, po));
476 #endif /* USE_THREADS */
477 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
478 SvPADTMP_off(PL_curpad[po]);
479 if ((I32)po < PL_padix)
484 pad_swipe(PADOFFSET po)
487 if (AvARRAY(PL_comppad) != PL_curpad)
488 croak("panic: pad_swipe curpad");
490 croak("panic: pad_swipe po");
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
493 (unsigned long) thr, (unsigned long) PL_curpad, po));
495 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
496 (unsigned long) PL_curpad, po));
497 #endif /* USE_THREADS */
498 SvPADTMP_off(PL_curpad[po]);
499 PL_curpad[po] = NEWSV(1107,0);
500 SvPADTMP_on(PL_curpad[po]);
501 if ((I32)po < PL_padix)
505 /* XXX pad_reset() is currently disabled because it results in serious bugs.
506 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
507 * on the stack by OPs that use them, there are several ways to get an alias
508 * to a shared TARG. Such an alias will change randomly and unpredictably.
509 * We avoid doing this until we can think of a Better Way.
514 #ifdef USE_BROKEN_PAD_RESET
518 if (AvARRAY(PL_comppad) != PL_curpad)
519 croak("panic: pad_reset curpad");
521 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
522 (unsigned long) thr, (unsigned long) PL_curpad));
524 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
525 (unsigned long) PL_curpad));
526 #endif /* USE_THREADS */
527 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
528 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
529 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
530 SvPADTMP_off(PL_curpad[po]);
532 PL_padix = PL_padix_floor;
535 PL_pad_reset_pending = FALSE;
539 /* find_threadsv is not reentrant */
541 find_threadsv(char *name)
547 /* We currently only handle names of a single character */
548 p = strchr(PL_threadsv_names, *name);
551 key = p - PL_threadsv_names;
552 svp = av_fetch(thr->threadsv, key, FALSE);
554 SV *sv = NEWSV(0, 0);
555 av_store(thr->threadsv, key, sv);
556 thr->threadsvp = AvARRAY(thr->threadsv);
558 * Some magic variables used to be automagically initialised
559 * in gv_fetchpv. Those which are now per-thread magicals get
560 * initialised here instead.
566 sv_setpv(sv, "\034");
567 sv_magic(sv, 0, 0, name, 1);
572 PL_sawampersand = TRUE;
576 /* XXX %! tied to Errno.pm needs to be added here.
577 * See gv_fetchpv(). */
581 sv_magic(sv, 0, 0, name, 1);
583 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
584 "find_threadsv: new SV %p for $%s%c\n",
585 sv, (*name < 32) ? "^" : "",
586 (*name < 32) ? toCTRL(*name) : *name));
590 #endif /* USE_THREADS */
597 register OP *kid, *nextkid;
599 if (!o || o->op_seq == (U16)-1)
602 if (o->op_flags & OPf_KIDS) {
603 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
604 nextkid = kid->op_sibling; /* Get before next freeing kid */
609 switch (o->op_type) {
611 o->op_targ = 0; /* Was holding old type, if any. */
614 o->op_targ = 0; /* Was holding hints. */
618 if (!(o->op_flags & OPf_SPECIAL))
622 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
624 #endif /* USE_THREADS */
626 if (!(o->op_flags & OPf_REF)
627 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
633 SvREFCNT_dec(cGVOPo->op_gv);
637 Safefree(cCOPo->cop_label);
638 SvREFCNT_dec(cCOPo->cop_filegv);
639 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
640 SvREFCNT_dec(cCOPo->cop_warnings);
643 SvREFCNT_dec(cSVOPo->op_sv);
649 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
653 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
654 SvREFCNT_dec(cSVOPo->op_sv);
656 Safefree(cPVOPo->op_pv);
659 op_free(cPMOPo->op_pmreplroot);
664 ReREFCNT_dec(cPMOPo->op_pmregexp);
669 pad_free(o->op_targ);
677 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
678 pad_free(o->op_targ);
679 o->op_targ = o->op_type;
680 o->op_type = OP_NULL;
681 o->op_ppaddr = PL_ppaddr[OP_NULL];
684 /* Contextualizers */
686 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
696 /* establish postfix order */
697 if (cUNOPo->op_first) {
698 o->op_next = LINKLIST(cUNOPo->op_first);
699 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
701 kid->op_next = LINKLIST(kid->op_sibling);
716 if (o && o->op_flags & OPf_KIDS) {
717 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
726 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
728 if (ckWARN(WARN_SYNTAX)) {
729 line_t oldline = PL_curcop->cop_line;
731 if (PL_copline != NOLINE)
732 PL_curcop->cop_line = PL_copline;
733 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
734 PL_curcop->cop_line = oldline;
745 /* assumes no premature commitment */
746 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
747 || o->op_type == OP_RETURN)
750 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
752 switch (o->op_type) {
754 if (o->op_private & OPpREPEAT_DOLIST)
755 null(((LISTOP*)cBINOPo->op_first)->op_first);
756 scalar(cBINOPo->op_first);
761 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
765 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
766 if (!kPMOP->op_pmreplroot)
767 deprecate("implicit split to @_");
775 if (o->op_flags & OPf_KIDS) {
776 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
782 kid = cLISTOPo->op_first;
784 while (kid = kid->op_sibling) {
790 WITH_THR(PL_curcop = &PL_compiling);
795 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
801 WITH_THR(PL_curcop = &PL_compiling);
814 /* assumes no premature commitment */
815 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
816 || o->op_type == OP_RETURN)
819 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
821 switch (o->op_type) {
823 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
827 if (o->op_flags & OPf_STACKED)
831 if (o->op_private == 4)
902 if (!(o->op_private & OPpLVAL_INTRO))
903 useless = PL_op_desc[o->op_type];
910 if (!(o->op_private & OPpLVAL_INTRO) &&
911 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
912 useless = "a variable";
917 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
924 if (ckWARN(WARN_VOID)) {
925 useless = "a constant";
926 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
928 else if (SvPOK(sv)) {
929 if (strnEQ(SvPVX(sv), "di", 2) ||
930 strnEQ(SvPVX(sv), "ds", 2) ||
931 strnEQ(SvPVX(sv), "ig", 2))
936 null(o); /* don't execute a constant */
937 SvREFCNT_dec(sv); /* don't even remember it */
941 o->op_type = OP_PREINC; /* pre-increment is faster */
942 o->op_ppaddr = PL_ppaddr[OP_PREINC];
946 o->op_type = OP_PREDEC; /* pre-decrement is faster */
947 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
953 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
958 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
959 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
960 if (o->op_flags & OPf_STACKED)
966 if (!(o->op_flags & OPf_KIDS))
975 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
982 /* all requires must return a boolean value */
983 o->op_flags &= ~OPf_WANT;
986 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
987 if (!kPMOP->op_pmreplroot)
988 deprecate("implicit split to @_");
994 if (ckWARN(WARN_VOID))
995 warner(WARN_VOID, "Useless use of %s in void context", useless);
1004 if (o && o->op_flags & OPf_KIDS) {
1005 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1016 /* assumes no premature commitment */
1017 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1018 || o->op_type == OP_RETURN)
1021 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1023 switch (o->op_type) {
1026 list(cBINOPo->op_first);
1031 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1039 if (!(o->op_flags & OPf_KIDS))
1041 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1042 list(cBINOPo->op_first);
1043 return gen_constant_list(o);
1050 kid = cLISTOPo->op_first;
1052 while (kid = kid->op_sibling) {
1053 if (kid->op_sibling)
1058 WITH_THR(PL_curcop = &PL_compiling);
1062 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1063 if (kid->op_sibling)
1068 WITH_THR(PL_curcop = &PL_compiling);
1071 /* all requires must return a boolean value */
1072 o->op_flags &= ~OPf_WANT;
1084 if (o->op_type == OP_LINESEQ ||
1085 o->op_type == OP_SCOPE ||
1086 o->op_type == OP_LEAVE ||
1087 o->op_type == OP_LEAVETRY)
1090 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1091 if (kid->op_sibling) {
1095 PL_curcop = &PL_compiling;
1097 o->op_flags &= ~OPf_PARENS;
1098 if (PL_hints & HINT_BLOCK_SCOPE)
1099 o->op_flags |= OPf_PARENS;
1102 o = newOP(OP_STUB, 0);
1107 modkids(OP *o, I32 type)
1110 if (o && o->op_flags & OPf_KIDS) {
1111 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1118 mod(OP *o, I32 type)
1124 if (!o || PL_error_count)
1127 switch (o->op_type) {
1132 if (!(o->op_private & (OPpCONST_ARYBASE)))
1134 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1135 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1139 SAVEI32(PL_compiling.cop_arybase);
1140 PL_compiling.cop_arybase = 0;
1142 else if (type == OP_REFGEN)
1145 croak("That use of $[ is unsupported");
1148 if (o->op_flags & OPf_PARENS)
1152 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1153 !(o->op_flags & OPf_STACKED)) {
1154 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1155 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1156 assert(cUNOPo->op_first->op_type == OP_NULL);
1157 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1163 /* grep, foreach, subcalls, refgen */
1164 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1166 yyerror(form("Can't modify %s in %s",
1167 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1168 ? "do block" : PL_op_desc[o->op_type]),
1169 type ? PL_op_desc[type] : "local"));
1183 case OP_RIGHT_SHIFT:
1192 if (!(o->op_flags & OPf_STACKED))
1198 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1204 if (!type && cUNOPo->op_first->op_type != OP_GV)
1205 croak("Can't localize through a reference");
1206 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1207 PL_modcount = 10000;
1208 return o; /* Treat \(@foo) like ordinary list. */
1212 if (scalar_mod_type(o, type))
1214 ref(cUNOPo->op_first, o->op_type);
1223 PL_modcount = 10000;
1226 if (!type && cUNOPo->op_first->op_type != OP_GV)
1227 croak("Can't localize through a reference");
1228 ref(cUNOPo->op_first, o->op_type);
1232 PL_hints |= HINT_BLOCK_SCOPE;
1240 PL_modcount = 10000;
1241 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1242 return o; /* Treat \(@foo) like ordinary list. */
1243 if (scalar_mod_type(o, type))
1249 croak("Can't localize lexical variable %s",
1250 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1255 PL_modcount++; /* XXX ??? */
1257 #endif /* USE_THREADS */
1263 if (type != OP_SASSIGN)
1267 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1273 pad_free(o->op_targ);
1274 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1275 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1276 if (o->op_flags & OPf_KIDS)
1277 mod(cBINOPo->op_first->op_sibling, type);
1282 ref(cBINOPo->op_first, o->op_type);
1283 if (type == OP_ENTERSUB &&
1284 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1285 o->op_private |= OPpLVAL_DEFER;
1292 if (o->op_flags & OPf_KIDS)
1293 mod(cLISTOPo->op_last, type);
1297 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1299 else if (!(o->op_flags & OPf_KIDS))
1301 if (o->op_targ != OP_LIST) {
1302 mod(cBINOPo->op_first, type);
1307 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1311 o->op_flags |= OPf_MOD;
1313 if (type == OP_AASSIGN || type == OP_SASSIGN)
1314 o->op_flags |= OPf_SPECIAL|OPf_REF;
1316 o->op_private |= OPpLVAL_INTRO;
1317 o->op_flags &= ~OPf_SPECIAL;
1318 PL_hints |= HINT_BLOCK_SCOPE;
1320 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1321 o->op_flags |= OPf_REF;
1326 scalar_mod_type(OP *o, I32 type)
1330 if (o->op_type == OP_RV2GV)
1354 case OP_RIGHT_SHIFT:
1364 case OP_ANDASSIGN: /* may work later */
1365 case OP_ORASSIGN: /* may work later */
1373 refkids(OP *o, I32 type)
1376 if (o && o->op_flags & OPf_KIDS) {
1377 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1384 ref(OP *o, I32 type)
1388 if (!o || PL_error_count)
1391 switch (o->op_type) {
1393 if ((type == OP_DEFINED || type == OP_LOCK) &&
1394 !(o->op_flags & OPf_STACKED)) {
1395 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1396 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1397 assert(cUNOPo->op_first->op_type == OP_NULL);
1398 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1399 o->op_flags |= OPf_SPECIAL;
1404 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1408 ref(cUNOPo->op_first, o->op_type);
1411 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1412 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1413 : type == OP_RV2HV ? OPpDEREF_HV
1415 o->op_flags |= OPf_MOD;
1420 o->op_flags |= OPf_MOD; /* XXX ??? */
1425 o->op_flags |= OPf_REF;
1428 ref(cUNOPo->op_first, o->op_type);
1433 o->op_flags |= OPf_REF;
1438 if (!(o->op_flags & OPf_KIDS))
1440 ref(cBINOPo->op_first, type);
1444 ref(cBINOPo->op_first, o->op_type);
1445 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1446 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1447 : type == OP_RV2HV ? OPpDEREF_HV
1449 o->op_flags |= OPf_MOD;
1457 if (!(o->op_flags & OPf_KIDS))
1459 ref(cLISTOPo->op_last, type);
1474 if (!o || PL_error_count)
1478 if (type == OP_LIST) {
1479 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1481 } else if (type == OP_UNDEF) {
1483 } else if (type != OP_PADSV &&
1486 type != OP_PUSHMARK)
1488 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1491 o->op_flags |= OPf_MOD;
1492 o->op_private |= OPpLVAL_INTRO;
1500 o->op_flags |= OPf_PARENS;
1505 bind_match(I32 type, OP *left, OP *right)
1510 if (ckWARN(WARN_UNSAFE) &&
1511 (left->op_type == OP_RV2AV ||
1512 left->op_type == OP_RV2HV ||
1513 left->op_type == OP_PADAV ||
1514 left->op_type == OP_PADHV)) {
1515 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1516 right->op_type == OP_TRANS)
1517 ? right->op_type : OP_MATCH];
1518 char *sample = ((left->op_type == OP_RV2AV ||
1519 left->op_type == OP_PADAV)
1520 ? "@array" : "%hash");
1522 "Applying %s to %s will act on scalar(%s)",
1523 desc, sample, sample);
1526 if (right->op_type == OP_MATCH ||
1527 right->op_type == OP_SUBST ||
1528 right->op_type == OP_TRANS) {
1529 right->op_flags |= OPf_STACKED;
1530 if (right->op_type != OP_MATCH)
1531 left = mod(left, right->op_type);
1532 if (right->op_type == OP_TRANS)
1533 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1535 o = prepend_elem(right->op_type, scalar(left), right);
1537 return newUNOP(OP_NOT, 0, scalar(o));
1541 return bind_match(type, left,
1542 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1550 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1551 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1558 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1559 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1560 o->op_type = OP_LEAVE;
1561 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1564 if (o->op_type == OP_LINESEQ) {
1566 o->op_type = OP_SCOPE;
1567 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1568 kid = ((LISTOP*)o)->op_first;
1569 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1570 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1575 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1585 SAVESPTR(GvHV(PL_hintgv));
1586 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1587 SAVEFREESV(GvHV(PL_hintgv));
1591 block_start(int full)
1594 int retval = PL_savestack_ix;
1596 SAVEI32(PL_comppad_name_floor);
1598 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1599 PL_comppad_name_floor = PL_comppad_name_fill;
1601 PL_comppad_name_floor = 0;
1603 SAVEI32(PL_min_intro_pending);
1604 SAVEI32(PL_max_intro_pending);
1605 PL_min_intro_pending = 0;
1606 SAVEI32(PL_comppad_name_fill);
1607 SAVEI32(PL_padix_floor);
1608 PL_padix_floor = PL_padix;
1609 PL_pad_reset_pending = FALSE;
1611 PL_hints &= ~HINT_BLOCK_SCOPE;
1612 SAVEPPTR(PL_compiling.cop_warnings);
1613 if (PL_compiling.cop_warnings != WARN_ALL &&
1614 PL_compiling.cop_warnings != WARN_NONE) {
1615 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1616 SAVEFREESV(PL_compiling.cop_warnings) ;
1624 block_end(I32 floor, OP *seq)
1627 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1628 OP* retval = scalarseq(seq);
1630 PL_pad_reset_pending = FALSE;
1631 PL_compiling.op_private = PL_hints;
1633 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1634 pad_leavemy(PL_comppad_name_fill);
1643 OP *o = newOP(OP_THREADSV, 0);
1644 o->op_targ = find_threadsv("_");
1647 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1648 #endif /* USE_THREADS */
1656 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1657 PL_eval_start = linklist(PL_eval_root);
1658 PL_eval_root->op_next = 0;
1659 peep(PL_eval_start);
1664 PL_main_root = scope(sawparens(scalarvoid(o)));
1665 PL_curcop = &PL_compiling;
1666 PL_main_start = LINKLIST(PL_main_root);
1667 PL_main_root->op_next = 0;
1668 peep(PL_main_start);
1671 /* Register with debugger */
1673 CV *cv = perl_get_cv("DB::postponed", FALSE);
1677 XPUSHs((SV*)PL_compiling.cop_filegv);
1679 perl_call_sv((SV*)cv, G_DISCARD);
1686 localize(OP *o, I32 lex)
1688 if (o->op_flags & OPf_PARENS)
1692 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1694 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1695 if (*s == ';' || *s == '=')
1696 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1697 lex ? "my" : "local");
1701 PL_in_my_stash = Nullhv;
1705 return mod(o, OP_NULL); /* a bit kludgey */
1711 if (o->op_type == OP_LIST) {
1714 o2 = newOP(OP_THREADSV, 0);
1715 o2->op_targ = find_threadsv(";");
1717 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1718 #endif /* USE_THREADS */
1719 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1725 fold_constants(register OP *o)
1729 I32 type = o->op_type;
1732 if (PL_opargs[type] & OA_RETSCALAR)
1734 if (PL_opargs[type] & OA_TARGET)
1735 o->op_targ = pad_alloc(type, SVs_PADTMP);
1737 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1738 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1740 if (!(PL_opargs[type] & OA_FOLDCONST))
1755 if (o->op_private & OPpLOCALE)
1760 goto nope; /* Don't try to run w/ errors */
1762 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1763 if (curop->op_type != OP_CONST &&
1764 curop->op_type != OP_LIST &&
1765 curop->op_type != OP_SCALAR &&
1766 curop->op_type != OP_NULL &&
1767 curop->op_type != OP_PUSHMARK) {
1772 curop = LINKLIST(o);
1776 sv = *(PL_stack_sp--);
1777 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1778 pad_swipe(o->op_targ);
1779 else if (SvTEMP(sv)) { /* grab mortal temp? */
1780 (void)SvREFCNT_inc(sv);
1784 if (type == OP_RV2GV)
1785 return newGVOP(OP_GV, 0, (GV*)sv);
1787 /* try to smush double to int, but don't smush -2.0 to -2 */
1788 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1792 if ((double)iv == SvNV(sv)) {
1797 SvIOK_off(sv); /* undo SvIV() damage */
1799 return newSVOP(OP_CONST, 0, sv);
1803 if (!(PL_opargs[type] & OA_OTHERINT))
1806 if (!(PL_hints & HINT_INTEGER)) {
1807 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1810 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1811 if (curop->op_type == OP_CONST) {
1812 if (SvIOK(((SVOP*)curop)->op_sv))
1816 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1820 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1827 gen_constant_list(register OP *o)
1831 I32 oldtmps_floor = PL_tmps_floor;
1835 return o; /* Don't attempt to run with errors */
1837 PL_op = curop = LINKLIST(o);
1843 PL_tmps_floor = oldtmps_floor;
1845 o->op_type = OP_RV2AV;
1846 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1847 curop = ((UNOP*)o)->op_first;
1848 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1855 convert(I32 type, I32 flags, OP *o)
1860 if (!o || o->op_type != OP_LIST)
1861 o = newLISTOP(OP_LIST, 0, o, Nullop);
1863 o->op_flags &= ~OPf_WANT;
1865 if (!(PL_opargs[type] & OA_MARK))
1866 null(cLISTOPo->op_first);
1869 o->op_ppaddr = PL_ppaddr[type];
1870 o->op_flags |= flags;
1872 o = CHECKOP(type, o);
1873 if (o->op_type != type)
1876 if (cLISTOPo->op_children < 7) {
1877 /* XXX do we really need to do this if we're done appending?? */
1878 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1880 cLISTOPo->op_last = last; /* in case check substituted last arg */
1883 return fold_constants(o);
1886 /* List constructors */
1889 append_elem(I32 type, OP *first, OP *last)
1897 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1898 return newLISTOP(type, 0, first, last);
1900 if (first->op_flags & OPf_KIDS)
1901 ((LISTOP*)first)->op_last->op_sibling = last;
1903 first->op_flags |= OPf_KIDS;
1904 ((LISTOP*)first)->op_first = last;
1906 ((LISTOP*)first)->op_last = last;
1907 ((LISTOP*)first)->op_children++;
1912 append_list(I32 type, LISTOP *first, LISTOP *last)
1920 if (first->op_type != type)
1921 return prepend_elem(type, (OP*)first, (OP*)last);
1923 if (last->op_type != type)
1924 return append_elem(type, (OP*)first, (OP*)last);
1926 first->op_last->op_sibling = last->op_first;
1927 first->op_last = last->op_last;
1928 first->op_children += last->op_children;
1929 if (first->op_children)
1930 first->op_flags |= OPf_KIDS;
1937 prepend_elem(I32 type, OP *first, OP *last)
1945 if (last->op_type == type) {
1946 if (type == OP_LIST) { /* already a PUSHMARK there */
1947 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1948 ((LISTOP*)last)->op_first->op_sibling = first;
1951 if (!(last->op_flags & OPf_KIDS)) {
1952 ((LISTOP*)last)->op_last = first;
1953 last->op_flags |= OPf_KIDS;
1955 first->op_sibling = ((LISTOP*)last)->op_first;
1956 ((LISTOP*)last)->op_first = first;
1958 ((LISTOP*)last)->op_children++;
1962 return newLISTOP(type, 0, first, last);
1970 return newOP(OP_STUB, 0);
1976 if (!o || o->op_type != OP_LIST)
1977 o = newLISTOP(OP_LIST, 0, o, Nullop);
1983 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1987 Newz(1101, listop, 1, LISTOP);
1989 listop->op_type = type;
1990 listop->op_ppaddr = PL_ppaddr[type];
1991 listop->op_children = (first != 0) + (last != 0);
1992 listop->op_flags = flags;
1996 else if (!first && last)
1999 first->op_sibling = last;
2000 listop->op_first = first;
2001 listop->op_last = last;
2002 if (type == OP_LIST) {
2004 pushop = newOP(OP_PUSHMARK, 0);
2005 pushop->op_sibling = first;
2006 listop->op_first = pushop;
2007 listop->op_flags |= OPf_KIDS;
2009 listop->op_last = pushop;
2011 else if (listop->op_children)
2012 listop->op_flags |= OPf_KIDS;
2018 newOP(I32 type, I32 flags)
2021 Newz(1101, o, 1, OP);
2023 o->op_ppaddr = PL_ppaddr[type];
2024 o->op_flags = flags;
2027 o->op_private = 0 + (flags >> 8);
2028 if (PL_opargs[type] & OA_RETSCALAR)
2030 if (PL_opargs[type] & OA_TARGET)
2031 o->op_targ = pad_alloc(type, SVs_PADTMP);
2032 return CHECKOP(type, o);
2036 newUNOP(I32 type, I32 flags, OP *first)
2041 first = newOP(OP_STUB, 0);
2042 if (PL_opargs[type] & OA_MARK)
2043 first = force_list(first);
2045 Newz(1101, unop, 1, UNOP);
2046 unop->op_type = type;
2047 unop->op_ppaddr = PL_ppaddr[type];
2048 unop->op_first = first;
2049 unop->op_flags = flags | OPf_KIDS;
2050 unop->op_private = 1 | (flags >> 8);
2051 unop = (UNOP*) CHECKOP(type, unop);
2055 return fold_constants((OP *) unop);
2059 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2062 Newz(1101, binop, 1, BINOP);
2065 first = newOP(OP_NULL, 0);
2067 binop->op_type = type;
2068 binop->op_ppaddr = PL_ppaddr[type];
2069 binop->op_first = first;
2070 binop->op_flags = flags | OPf_KIDS;
2073 binop->op_private = 1 | (flags >> 8);
2076 binop->op_private = 2 | (flags >> 8);
2077 first->op_sibling = last;
2080 binop = (BINOP*)CHECKOP(type, binop);
2084 binop->op_last = binop->op_first->op_sibling;
2086 return fold_constants((OP *)binop);
2090 utf8compare(const void *a, const void *b)
2093 for (i = 0; i < 10; i++) {
2094 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2096 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2103 pmtrans(OP *o, OP *expr, OP *repl)
2105 SV *tstr = ((SVOP*)expr)->op_sv;
2106 SV *rstr = ((SVOP*)repl)->op_sv;
2109 register U8 *t = (U8*)SvPV(tstr, tlen);
2110 register U8 *r = (U8*)SvPV(rstr, rlen);
2116 register short *tbl;
2118 complement = o->op_private & OPpTRANS_COMPLEMENT;
2119 del = o->op_private & OPpTRANS_DELETE;
2120 squash = o->op_private & OPpTRANS_SQUASH;
2122 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2123 SV* listsv = newSVpv("# comment\n",0);
2125 U8* tend = t + tlen;
2126 U8* rend = r + rlen;
2142 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2143 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2149 New(1109, cp, tlen, U8*);
2151 transv = newSVpv("",0);
2160 qsort(cp, i, sizeof(U8*), utf8compare);
2161 for (j = 0; j < i; j++) {
2163 UV val = utf8_to_uv(s, &ulen);
2165 diff = val - nextmin;
2167 t = uv_to_utf8(tmpbuf,nextmin);
2168 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2170 t = uv_to_utf8(tmpbuf, val - 1);
2171 sv_catpvn(transv, "\377", 1);
2172 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2176 val = utf8_to_uv(s+1, &ulen);
2180 t = uv_to_utf8(tmpbuf,nextmin);
2181 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2182 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2183 sv_catpvn(transv, "\377", 1);
2184 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2185 t = (U8*)SvPVX(transv);
2186 tlen = SvCUR(transv);
2189 else if (!rlen && !del) {
2190 r = t; rlen = tlen; rend = tend;
2193 if (to_utf && from_utf) { /* only counting characters */
2194 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2195 o->op_private |= OPpTRANS_IDENTICAL;
2197 else { /* straight latin-1 translation */
2198 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2199 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2200 o->op_private |= OPpTRANS_IDENTICAL;
2204 while (t < tend || tfirst <= tlast) {
2205 /* see if we need more "t" chars */
2206 if (tfirst > tlast) {
2207 tfirst = (I32)utf8_to_uv(t, &ulen);
2209 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2210 tlast = (I32)utf8_to_uv(++t, &ulen);
2217 /* now see if we need more "r" chars */
2218 if (rfirst > rlast) {
2220 rfirst = (I32)utf8_to_uv(r, &ulen);
2222 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2223 rlast = (I32)utf8_to_uv(++r, &ulen);
2232 rfirst = rlast = 0xffffffff;
2236 /* now see which range will peter our first, if either. */
2237 tdiff = tlast - tfirst;
2238 rdiff = rlast - rfirst;
2245 if (rfirst == 0xffffffff) {
2246 diff = tdiff; /* oops, pretend rdiff is infinite */
2248 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2250 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2254 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2256 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2258 if (rfirst + diff > max)
2259 max = rfirst + diff;
2264 else if (rfirst <= 0x800)
2265 grows |= (tfirst < 0x80);
2266 else if (rfirst <= 0x10000)
2267 grows |= (tfirst < 0x800);
2268 else if (rfirst <= 0x200000)
2269 grows |= (tfirst < 0x10000);
2270 else if (rfirst <= 0x4000000)
2271 grows |= (tfirst < 0x200000);
2272 else if (rfirst <= 0x80000000)
2273 grows |= (tfirst < 0x4000000);
2285 else if (max > 0xff)
2290 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2291 SvREFCNT_dec(listsv);
2293 SvREFCNT_dec(transv);
2295 if (!del && havefinal)
2296 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2298 if (grows && to_utf)
2299 o->op_private |= OPpTRANS_GROWS;
2306 tbl = (short*)cPVOPo->op_pv;
2308 Zero(tbl, 256, short);
2309 for (i = 0; i < tlen; i++)
2311 for (i = 0, j = 0; i < 256; i++) {
2327 if (!rlen && !del) {
2330 o->op_private |= OPpTRANS_IDENTICAL;
2332 for (i = 0; i < 256; i++)
2334 for (i = 0, j = 0; i < tlen; i++,j++) {
2337 if (tbl[t[i]] == -1)
2343 if (tbl[t[i]] == -1)
2354 newPMOP(I32 type, I32 flags)
2359 Newz(1101, pmop, 1, PMOP);
2360 pmop->op_type = type;
2361 pmop->op_ppaddr = PL_ppaddr[type];
2362 pmop->op_flags = flags;
2363 pmop->op_private = 0 | (flags >> 8);
2365 if (PL_hints & HINT_RE_TAINT)
2366 pmop->op_pmpermflags |= PMf_RETAINT;
2367 if (PL_hints & HINT_LOCALE)
2368 pmop->op_pmpermflags |= PMf_LOCALE;
2369 pmop->op_pmflags = pmop->op_pmpermflags;
2371 /* link into pm list */
2372 if (type != OP_TRANS && PL_curstash) {
2373 pmop->op_pmnext = HvPMROOT(PL_curstash);
2374 HvPMROOT(PL_curstash) = pmop;
2381 pmruntime(OP *o, OP *expr, OP *repl)
2386 I32 repl_has_vars = 0;
2388 if (o->op_type == OP_TRANS)
2389 return pmtrans(o, expr, repl);
2391 PL_hints |= HINT_BLOCK_SCOPE;
2394 if (expr->op_type == OP_CONST) {
2396 SV *pat = ((SVOP*)expr)->op_sv;
2397 char *p = SvPV(pat, plen);
2398 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2399 sv_setpvn(pat, "\\s+", 3);
2400 p = SvPV(pat, plen);
2401 pm->op_pmflags |= PMf_SKIPWHITE;
2403 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2404 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2405 pm->op_pmflags |= PMf_WHITE;
2409 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2410 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2412 : OP_REGCMAYBE),0,expr);
2414 Newz(1101, rcop, 1, LOGOP);
2415 rcop->op_type = OP_REGCOMP;
2416 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2417 rcop->op_first = scalar(expr);
2418 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2419 ? (OPf_SPECIAL | OPf_KIDS)
2421 rcop->op_private = 1;
2424 /* establish postfix order */
2425 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2427 rcop->op_next = expr;
2428 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2431 rcop->op_next = LINKLIST(expr);
2432 expr->op_next = (OP*)rcop;
2435 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2440 if (pm->op_pmflags & PMf_EVAL)
2443 else if (repl->op_type == OP_THREADSV
2444 && strchr("&`'123456789+",
2445 PL_threadsv_names[repl->op_targ]))
2449 #endif /* USE_THREADS */
2450 else if (repl->op_type == OP_CONST)
2454 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2455 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2457 if (curop->op_type == OP_THREADSV) {
2459 if (strchr("&`'123456789+", curop->op_private))
2463 if (curop->op_type == OP_GV) {
2464 GV *gv = ((GVOP*)curop)->op_gv;
2466 if (strchr("&`'123456789+", *GvENAME(gv)))
2469 #endif /* USE_THREADS */
2470 else if (curop->op_type == OP_RV2CV)
2472 else if (curop->op_type == OP_RV2SV ||
2473 curop->op_type == OP_RV2AV ||
2474 curop->op_type == OP_RV2HV ||
2475 curop->op_type == OP_RV2GV) {
2476 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2479 else if (curop->op_type == OP_PADSV ||
2480 curop->op_type == OP_PADAV ||
2481 curop->op_type == OP_PADHV ||
2482 curop->op_type == OP_PADANY) {
2485 else if (curop->op_type == OP_PUSHRE)
2486 ; /* Okay here, dangerous in newASSIGNOP */
2495 && (!pm->op_pmregexp
2496 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2497 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2498 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2499 prepend_elem(o->op_type, scalar(repl), o);
2502 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2503 pm->op_pmflags |= PMf_MAYBE_CONST;
2504 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2506 Newz(1101, rcop, 1, LOGOP);
2507 rcop->op_type = OP_SUBSTCONT;
2508 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2509 rcop->op_first = scalar(repl);
2510 rcop->op_flags |= OPf_KIDS;
2511 rcop->op_private = 1;
2514 /* establish postfix order */
2515 rcop->op_next = LINKLIST(repl);
2516 repl->op_next = (OP*)rcop;
2518 pm->op_pmreplroot = scalar((OP*)rcop);
2519 pm->op_pmreplstart = LINKLIST(rcop);
2528 newSVOP(I32 type, I32 flags, SV *sv)
2531 Newz(1101, svop, 1, SVOP);
2532 svop->op_type = type;
2533 svop->op_ppaddr = PL_ppaddr[type];
2535 svop->op_next = (OP*)svop;
2536 svop->op_flags = flags;
2537 if (PL_opargs[type] & OA_RETSCALAR)
2539 if (PL_opargs[type] & OA_TARGET)
2540 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2541 return CHECKOP(type, svop);
2545 newGVOP(I32 type, I32 flags, GV *gv)
2549 Newz(1101, gvop, 1, GVOP);
2550 gvop->op_type = type;
2551 gvop->op_ppaddr = PL_ppaddr[type];
2552 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2553 gvop->op_next = (OP*)gvop;
2554 gvop->op_flags = flags;
2555 if (PL_opargs[type] & OA_RETSCALAR)
2557 if (PL_opargs[type] & OA_TARGET)
2558 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2559 return CHECKOP(type, gvop);
2563 newPVOP(I32 type, I32 flags, char *pv)
2566 Newz(1101, pvop, 1, PVOP);
2567 pvop->op_type = type;
2568 pvop->op_ppaddr = PL_ppaddr[type];
2570 pvop->op_next = (OP*)pvop;
2571 pvop->op_flags = flags;
2572 if (PL_opargs[type] & OA_RETSCALAR)
2574 if (PL_opargs[type] & OA_TARGET)
2575 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2576 return CHECKOP(type, pvop);
2585 save_hptr(&PL_curstash);
2586 save_item(PL_curstname);
2591 name = SvPV(sv, len);
2592 PL_curstash = gv_stashpvn(name,len,TRUE);
2593 sv_setpvn(PL_curstname, name, len);
2597 sv_setpv(PL_curstname,"<none>");
2598 PL_curstash = Nullhv;
2600 PL_hints |= HINT_BLOCK_SCOPE;
2601 PL_copline = NOLINE;
2606 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2615 if (id->op_type != OP_CONST)
2616 croak("Module name must be constant");
2620 if(version != Nullop) {
2621 SV *vesv = ((SVOP*)version)->op_sv;
2623 if (arg == Nullop && !SvNIOK(vesv)) {
2630 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2631 croak("Version number must be constant number");
2633 /* Make copy of id so we don't free it twice */
2634 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2636 /* Fake up a method call to VERSION */
2637 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2638 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2639 append_elem(OP_LIST,
2640 prepend_elem(OP_LIST, pack, list(version)),
2641 newUNOP(OP_METHOD, 0, meth)));
2645 /* Fake up an import/unimport */
2646 if (arg && arg->op_type == OP_STUB)
2647 imop = arg; /* no import on explicit () */
2648 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2649 imop = Nullop; /* use 5.0; */
2652 /* Make copy of id so we don't free it twice */
2653 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2654 meth = newSVOP(OP_CONST, 0,
2656 ? newSVpv("import", 6)
2657 : newSVpv("unimport", 8)
2659 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2660 append_elem(OP_LIST,
2661 prepend_elem(OP_LIST, pack, list(arg)),
2662 newUNOP(OP_METHOD, 0, meth)));
2665 /* Fake up a require, handle override, if any */
2666 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2667 if (!(gv && GvIMPORTED_CV(gv)))
2668 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2670 if (gv && GvIMPORTED_CV(gv)) {
2671 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2672 append_elem(OP_LIST, id,
2673 scalar(newUNOP(OP_RV2CV, 0,
2678 rqop = newUNOP(OP_REQUIRE, 0, id);
2681 /* Fake up the BEGIN {}, which does its thing immediately. */
2683 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2685 append_elem(OP_LINESEQ,
2686 append_elem(OP_LINESEQ,
2687 newSTATEOP(0, Nullch, rqop),
2688 newSTATEOP(0, Nullch, veop)),
2689 newSTATEOP(0, Nullch, imop) ));
2691 PL_copline = NOLINE;
2701 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2702 if (!(gv && GvIMPORTED_CV(gv)))
2703 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2705 if (gv && GvIMPORTED_CV(gv)) {
2706 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2707 append_elem(OP_LIST, term,
2708 scalar(newUNOP(OP_RV2CV, 0,
2713 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2719 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2721 return newBINOP(OP_LSLICE, flags,
2722 list(force_list(subscript)),
2723 list(force_list(listval)) );
2727 list_assignment(register OP *o)
2732 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2733 o = cUNOPo->op_first;
2735 if (o->op_type == OP_COND_EXPR) {
2736 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2737 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2742 yyerror("Assignment to both a list and a scalar");
2746 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2747 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2748 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2751 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2754 if (o->op_type == OP_RV2SV)
2761 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2766 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2767 return newLOGOP(optype, 0,
2768 mod(scalar(left), optype),
2769 newUNOP(OP_SASSIGN, 0, scalar(right)));
2772 return newBINOP(optype, OPf_STACKED,
2773 mod(scalar(left), optype), scalar(right));
2777 if (list_assignment(left)) {
2780 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2781 left = mod(left, OP_AASSIGN);
2789 o = newBINOP(OP_AASSIGN, flags,
2790 list(force_list(right)),
2791 list(force_list(left)) );
2792 o->op_private = 0 | (flags >> 8);
2793 if (!(left->op_private & OPpLVAL_INTRO)) {
2797 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2798 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2799 if (curop->op_type == OP_GV) {
2800 GV *gv = ((GVOP*)curop)->op_gv;
2801 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2803 SvCUR(gv) = PL_generation;
2805 else if (curop->op_type == OP_PADSV ||
2806 curop->op_type == OP_PADAV ||
2807 curop->op_type == OP_PADHV ||
2808 curop->op_type == OP_PADANY) {
2809 SV **svp = AvARRAY(PL_comppad_name);
2810 SV *sv = svp[curop->op_targ];
2811 if (SvCUR(sv) == PL_generation)
2813 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2815 else if (curop->op_type == OP_RV2CV)
2817 else if (curop->op_type == OP_RV2SV ||
2818 curop->op_type == OP_RV2AV ||
2819 curop->op_type == OP_RV2HV ||
2820 curop->op_type == OP_RV2GV) {
2821 if (lastop->op_type != OP_GV) /* funny deref? */
2824 else if (curop->op_type == OP_PUSHRE) {
2825 if (((PMOP*)curop)->op_pmreplroot) {
2826 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2827 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2829 SvCUR(gv) = PL_generation;
2838 o->op_private = OPpASSIGN_COMMON;
2840 if (right && right->op_type == OP_SPLIT) {
2842 if ((tmpop = ((LISTOP*)right)->op_first) &&
2843 tmpop->op_type == OP_PUSHRE)
2845 PMOP *pm = (PMOP*)tmpop;
2846 if (left->op_type == OP_RV2AV &&
2847 !(left->op_private & OPpLVAL_INTRO) &&
2848 !(o->op_private & OPpASSIGN_COMMON) )
2850 tmpop = ((UNOP*)left)->op_first;
2851 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2852 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2853 pm->op_pmflags |= PMf_ONCE;
2854 tmpop = cUNOPo->op_first; /* to list (nulled) */
2855 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2856 tmpop->op_sibling = Nullop; /* don't free split */
2857 right->op_next = tmpop->op_next; /* fix starting loc */
2858 op_free(o); /* blow off assign */
2859 right->op_flags &= ~OPf_WANT;
2860 /* "I don't know and I don't care." */
2865 if (PL_modcount < 10000 &&
2866 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2868 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2870 sv_setiv(sv, PL_modcount+1);
2878 right = newOP(OP_UNDEF, 0);
2879 if (right->op_type == OP_READLINE) {
2880 right->op_flags |= OPf_STACKED;
2881 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2884 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2885 o = newBINOP(OP_SASSIGN, flags,
2886 scalar(right), mod(scalar(left), OP_SASSIGN) );
2898 newSTATEOP(I32 flags, char *label, OP *o)
2901 U32 seq = intro_my();
2904 Newz(1101, cop, 1, COP);
2905 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2906 cop->op_type = OP_DBSTATE;
2907 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2910 cop->op_type = OP_NEXTSTATE;
2911 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2913 cop->op_flags = flags;
2914 cop->op_private = (PL_hints & HINT_UTF8);
2916 cop->op_private |= NATIVE_HINTS;
2918 PL_compiling.op_private = cop->op_private;
2919 cop->op_next = (OP*)cop;
2922 cop->cop_label = label;
2923 PL_hints |= HINT_BLOCK_SCOPE;
2926 cop->cop_arybase = PL_curcop->cop_arybase;
2927 if (PL_curcop->cop_warnings == WARN_NONE
2928 || PL_curcop->cop_warnings == WARN_ALL)
2929 cop->cop_warnings = PL_curcop->cop_warnings ;
2931 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2934 if (PL_copline == NOLINE)
2935 cop->cop_line = PL_curcop->cop_line;
2937 cop->cop_line = PL_copline;
2938 PL_copline = NOLINE;
2940 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2941 cop->cop_stash = PL_curstash;
2943 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2944 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2945 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2946 (void)SvIOK_on(*svp);
2948 SvSTASH(*svp) = (HV*)cop;
2952 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2955 /* "Introduce" my variables to visible status. */
2963 if (! PL_min_intro_pending)
2964 return PL_cop_seqmax;
2966 svp = AvARRAY(PL_comppad_name);
2967 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2968 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2969 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2970 SvNVX(sv) = (double)PL_cop_seqmax;
2973 PL_min_intro_pending = 0;
2974 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2975 return PL_cop_seqmax++;
2979 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2981 return new_logop(type, flags, &first, &other);
2985 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2990 OP *first = *firstp;
2991 OP *other = *otherp;
2993 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2994 return newBINOP(type, flags, scalar(first), scalar(other));
2996 scalarboolean(first);
2997 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2998 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2999 if (type == OP_AND || type == OP_OR) {
3005 first = *firstp = cUNOPo->op_first;
3007 first->op_next = o->op_next;
3008 cUNOPo->op_first = Nullop;
3012 if (first->op_type == OP_CONST) {
3013 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3014 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3016 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3027 else if (first->op_type == OP_WANTARRAY) {
3033 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3034 OP *k1 = ((UNOP*)first)->op_first;
3035 OP *k2 = k1->op_sibling;
3037 switch (first->op_type)
3040 if (k2 && k2->op_type == OP_READLINE
3041 && (k2->op_flags & OPf_STACKED)
3042 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3043 warnop = k2->op_type;
3047 if (k1->op_type == OP_READDIR
3048 || k1->op_type == OP_GLOB
3049 || k1->op_type == OP_EACH)
3050 warnop = k1->op_type;
3054 line_t oldline = PL_curcop->cop_line;
3055 PL_curcop->cop_line = PL_copline;
3057 "Value of %s%s can be \"0\"; test with defined()",
3059 ((warnop == OP_READLINE || warnop == OP_GLOB)
3060 ? " construct" : "() operator"));
3061 PL_curcop->cop_line = oldline;
3068 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3069 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3071 Newz(1101, logop, 1, LOGOP);
3073 logop->op_type = type;
3074 logop->op_ppaddr = PL_ppaddr[type];
3075 logop->op_first = first;
3076 logop->op_flags = flags | OPf_KIDS;
3077 logop->op_other = LINKLIST(other);
3078 logop->op_private = 1 | (flags >> 8);
3080 /* establish postfix order */
3081 logop->op_next = LINKLIST(first);
3082 first->op_next = (OP*)logop;
3083 first->op_sibling = other;
3085 o = newUNOP(OP_NULL, 0, (OP*)logop);
3092 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3099 return newLOGOP(OP_AND, 0, first, trueop);
3101 return newLOGOP(OP_OR, 0, first, falseop);
3103 scalarboolean(first);
3104 if (first->op_type == OP_CONST) {
3105 if (SvTRUE(((SVOP*)first)->op_sv)) {
3116 else if (first->op_type == OP_WANTARRAY) {
3120 Newz(1101, condop, 1, CONDOP);
3122 condop->op_type = OP_COND_EXPR;
3123 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3124 condop->op_first = first;
3125 condop->op_flags = flags | OPf_KIDS;
3126 condop->op_true = LINKLIST(trueop);
3127 condop->op_false = LINKLIST(falseop);
3128 condop->op_private = 1 | (flags >> 8);
3130 /* establish postfix order */
3131 condop->op_next = LINKLIST(first);
3132 first->op_next = (OP*)condop;
3134 first->op_sibling = trueop;
3135 trueop->op_sibling = falseop;
3136 o = newUNOP(OP_NULL, 0, (OP*)condop);
3138 trueop->op_next = o;
3139 falseop->op_next = o;
3145 newRANGE(I32 flags, OP *left, OP *right)
3153 Newz(1101, condop, 1, CONDOP);
3155 condop->op_type = OP_RANGE;
3156 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3157 condop->op_first = left;
3158 condop->op_flags = OPf_KIDS;
3159 condop->op_true = LINKLIST(left);
3160 condop->op_false = LINKLIST(right);
3161 condop->op_private = 1 | (flags >> 8);
3163 left->op_sibling = right;
3165 condop->op_next = (OP*)condop;
3166 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3167 flop = newUNOP(OP_FLOP, 0, flip);
3168 o = newUNOP(OP_NULL, 0, flop);
3171 left->op_next = flip;
3172 right->op_next = flop;
3174 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3175 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3176 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3177 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3179 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3180 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3183 if (!flip->op_private || !flop->op_private)
3184 linklist(o); /* blow off optimizer unless constant */
3190 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3195 int once = block && block->op_flags & OPf_SPECIAL &&
3196 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3199 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3200 return block; /* do {} while 0 does once */
3201 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3202 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3203 expr = newUNOP(OP_DEFINED, 0,
3204 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3205 } else if (expr->op_flags & OPf_KIDS) {
3206 OP *k1 = ((UNOP*)expr)->op_first;
3207 OP *k2 = (k1) ? k1->op_sibling : NULL;
3208 switch (expr->op_type) {
3210 if (k2 && k2->op_type == OP_READLINE
3211 && (k2->op_flags & OPf_STACKED)
3212 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3213 expr = newUNOP(OP_DEFINED, 0, expr);
3217 if (k1->op_type == OP_READDIR
3218 || k1->op_type == OP_GLOB
3219 || k1->op_type == OP_EACH)
3220 expr = newUNOP(OP_DEFINED, 0, expr);
3226 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3227 o = new_logop(OP_AND, 0, &expr, &listop);
3230 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3232 if (once && o != listop)
3233 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3236 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3238 o->op_flags |= flags;
3240 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3245 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3254 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3255 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3256 expr = newUNOP(OP_DEFINED, 0,
3257 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3258 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3259 OP *k1 = ((UNOP*)expr)->op_first;
3260 OP *k2 = (k1) ? k1->op_sibling : NULL;
3261 switch (expr->op_type) {
3263 if (k2 && k2->op_type == OP_READLINE
3264 && (k2->op_flags & OPf_STACKED)
3265 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3266 expr = newUNOP(OP_DEFINED, 0, expr);
3270 if (k1->op_type == OP_READDIR
3271 || k1->op_type == OP_GLOB
3272 || k1->op_type == OP_EACH)
3273 expr = newUNOP(OP_DEFINED, 0, expr);
3279 block = newOP(OP_NULL, 0);
3282 next = LINKLIST(cont);
3284 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3285 if ((line_t)whileline != NOLINE) {
3286 PL_copline = whileline;
3287 cont = append_elem(OP_LINESEQ, cont,
3288 newSTATEOP(0, Nullch, Nullop));
3292 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3293 redo = LINKLIST(listop);
3296 PL_copline = whileline;
3298 o = new_logop(OP_AND, 0, &expr, &listop);
3299 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3300 op_free(expr); /* oops, it's a while (0) */
3302 return Nullop; /* listop already freed by new_logop */
3305 ((LISTOP*)listop)->op_last->op_next = condop =
3306 (o == listop ? redo : LINKLIST(o));
3314 Newz(1101,loop,1,LOOP);
3315 loop->op_type = OP_ENTERLOOP;
3316 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3317 loop->op_private = 0;
3318 loop->op_next = (OP*)loop;
3321 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3323 loop->op_redoop = redo;
3324 loop->op_lastop = o;
3327 loop->op_nextop = next;
3329 loop->op_nextop = o;
3331 o->op_flags |= flags;
3332 o->op_private |= (flags >> 8);
3337 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3345 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3346 sv->op_type = OP_RV2GV;
3347 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3349 else if (sv->op_type == OP_PADSV) { /* private variable */
3350 padoff = sv->op_targ;
3354 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3355 padoff = sv->op_targ;
3356 iterflags |= OPf_SPECIAL;
3361 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3365 padoff = find_threadsv("_");
3366 iterflags |= OPf_SPECIAL;
3368 sv = newGVOP(OP_GV, 0, PL_defgv);
3371 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3372 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3373 iterflags |= OPf_STACKED;
3375 else if (expr->op_type == OP_NULL &&
3376 (expr->op_flags & OPf_KIDS) &&
3377 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3379 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3380 * set the STACKED flag to indicate that these values are to be
3381 * treated as min/max values by 'pp_iterinit'.
3383 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3384 CONDOP* range = (CONDOP*) flip->op_first;
3385 OP* left = range->op_first;
3386 OP* right = left->op_sibling;
3389 range->op_flags &= ~OPf_KIDS;
3390 range->op_first = Nullop;
3392 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3393 listop->op_first->op_next = range->op_true;
3394 left->op_next = range->op_false;
3395 right->op_next = (OP*)listop;
3396 listop->op_next = listop->op_first;
3399 expr = (OP*)(listop);
3401 iterflags |= OPf_STACKED;
3404 expr = mod(force_list(expr), OP_GREPSTART);
3408 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3409 append_elem(OP_LIST, expr, scalar(sv))));
3410 assert(!loop->op_next);
3411 Renew(loop, 1, LOOP);
3412 loop->op_targ = padoff;
3413 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3414 PL_copline = forline;
3415 return newSTATEOP(0, label, wop);
3419 newLOOPEX(I32 type, OP *label)
3423 if (type != OP_GOTO || label->op_type == OP_CONST) {
3424 /* "last()" means "last" */
3425 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3426 o = newOP(type, OPf_SPECIAL);
3428 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3429 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3435 if (label->op_type == OP_ENTERSUB)
3436 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3437 o = newUNOP(type, OPf_STACKED, label);
3439 PL_hints |= HINT_BLOCK_SCOPE;
3449 MUTEX_DESTROY(CvMUTEXP(cv));
3450 Safefree(CvMUTEXP(cv));
3453 #endif /* USE_THREADS */
3455 if (!CvXSUB(cv) && CvROOT(cv)) {
3457 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3458 croak("Can't undef active subroutine");
3461 croak("Can't undef active subroutine");
3462 #endif /* USE_THREADS */
3465 SAVESPTR(PL_curpad);
3469 op_free(CvROOT(cv));
3470 CvROOT(cv) = Nullop;
3473 SvPOK_off((SV*)cv); /* forget prototype */
3475 SvREFCNT_dec(CvGV(cv));
3477 SvREFCNT_dec(CvOUTSIDE(cv));
3478 CvOUTSIDE(cv) = Nullcv;
3479 if (CvPADLIST(cv)) {
3480 /* may be during global destruction */
3481 if (SvREFCNT(CvPADLIST(cv))) {
3482 I32 i = AvFILLp(CvPADLIST(cv));
3484 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3485 SV* sv = svp ? *svp : Nullsv;
3488 if (sv == (SV*)PL_comppad_name)
3489 PL_comppad_name = Nullav;
3490 else if (sv == (SV*)PL_comppad) {
3491 PL_comppad = Nullav;
3492 PL_curpad = Null(SV**);
3496 SvREFCNT_dec((SV*)CvPADLIST(cv));
3498 CvPADLIST(cv) = Nullav;
3502 #ifdef DEBUG_CLOSURES
3507 CV *outside = CvOUTSIDE(cv);
3508 AV* padlist = CvPADLIST(cv);
3515 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3517 (CvANON(cv) ? "ANON"
3518 : (cv == PL_main_cv) ? "MAIN"
3519 : CvUNIQUE(cv) ? "UNIQUE"
3520 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3523 : CvANON(outside) ? "ANON"
3524 : (outside == PL_main_cv) ? "MAIN"
3525 : CvUNIQUE(outside) ? "UNIQUE"
3526 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3531 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3532 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3533 pname = AvARRAY(pad_name);
3534 ppad = AvARRAY(pad);
3536 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3537 if (SvPOK(pname[ix]))
3538 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3540 SvFAKE(pname[ix]) ? "FAKE " : "",
3542 (long)I_32(SvNVX(pname[ix])),
3543 (long)SvIVX(pname[ix]));
3546 #endif /* DEBUG_CLOSURES */
3549 cv_clone2(CV *proto, CV *outside)
3554 AV* protopadlist = CvPADLIST(proto);
3555 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3556 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3557 SV** pname = AvARRAY(protopad_name);
3558 SV** ppad = AvARRAY(protopad);
3559 I32 fname = AvFILLp(protopad_name);
3560 I32 fpad = AvFILLp(protopad);
3564 assert(!CvUNIQUE(proto));
3567 SAVESPTR(PL_curpad);
3568 SAVESPTR(PL_comppad);
3569 SAVESPTR(PL_comppad_name);
3570 SAVESPTR(PL_compcv);
3572 cv = PL_compcv = (CV*)NEWSV(1104,0);
3573 sv_upgrade((SV *)cv, SvTYPE(proto));
3579 New(666, CvMUTEXP(cv), 1, perl_mutex);
3580 MUTEX_INIT(CvMUTEXP(cv));
3582 #endif /* USE_THREADS */
3583 CvFILEGV(cv) = CvFILEGV(proto);
3584 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3585 CvSTASH(cv) = CvSTASH(proto);
3586 CvROOT(cv) = CvROOT(proto);
3587 CvSTART(cv) = CvSTART(proto);
3589 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3592 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3594 PL_comppad_name = newAV();
3595 for (ix = fname; ix >= 0; ix--)
3596 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3598 PL_comppad = newAV();
3600 comppadlist = newAV();
3601 AvREAL_off(comppadlist);
3602 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3603 av_store(comppadlist, 1, (SV*)PL_comppad);
3604 CvPADLIST(cv) = comppadlist;
3605 av_fill(PL_comppad, AvFILLp(protopad));
3606 PL_curpad = AvARRAY(PL_comppad);
3608 av = newAV(); /* will be @_ */
3610 av_store(PL_comppad, 0, (SV*)av);
3611 AvFLAGS(av) = AVf_REIFY;
3613 for (ix = fpad; ix > 0; ix--) {
3614 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3615 if (namesv && namesv != &PL_sv_undef) {
3616 char *name = SvPVX(namesv); /* XXX */
3617 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3618 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3619 CvOUTSIDE(cv), cxstack_ix, 0);
3621 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3623 croak("panic: cv_clone: %s", name);
3625 else { /* our own lexical */
3628 /* anon code -- we'll come back for it */
3629 sv = SvREFCNT_inc(ppad[ix]);
3631 else if (*name == '@')
3633 else if (*name == '%')
3643 SV* sv = NEWSV(0,0);
3649 /* Now that vars are all in place, clone nested closures. */
3651 for (ix = fpad; ix > 0; ix--) {
3652 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3654 && namesv != &PL_sv_undef
3655 && !(SvFLAGS(namesv) & SVf_FAKE)
3656 && *SvPVX(namesv) == '&'
3657 && CvCLONE(ppad[ix]))
3659 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3660 SvREFCNT_dec(ppad[ix]);
3663 PL_curpad[ix] = (SV*)kid;
3667 #ifdef DEBUG_CLOSURES
3668 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3670 PerlIO_printf(Perl_debug_log, " from:\n");
3672 PerlIO_printf(Perl_debug_log, " to:\n");
3683 return cv_clone2(proto, CvOUTSIDE(proto));
3687 cv_ckproto(CV *cv, GV *gv, char *p)
3689 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3690 SV* msg = sv_newmortal();
3694 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3695 sv_setpv(msg, "Prototype mismatch:");
3697 sv_catpvf(msg, " sub %_", name);
3699 sv_catpvf(msg, " (%s)", SvPVX(cv));
3700 sv_catpv(msg, " vs ");
3702 sv_catpvf(msg, "(%s)", p);
3704 sv_catpv(msg, "none");
3712 if (!cv || !SvPOK(cv) || SvCUR(cv))
3714 return op_const_sv(CvSTART(cv), cv);
3718 op_const_sv(OP *o, CV *cv)
3725 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3726 o = cLISTOPo->op_first->op_sibling;
3728 for (; o; o = o->op_next) {
3729 OPCODE type = o->op_type;
3731 if(sv && o->op_next == o)
3733 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3735 if (type == OP_LEAVESUB || type == OP_RETURN)
3739 if (type == OP_CONST)
3741 else if (type == OP_PADSV && cv) {
3742 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3743 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3744 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3756 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3759 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3760 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3761 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3762 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3771 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3772 maximum a prototype before. */
3773 if (SvTYPE(gv) > SVt_NULL) {
3774 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3775 warn("Runaway prototype");
3776 cv_ckproto((CV*)gv, NULL, ps);
3779 sv_setpv((SV*)gv, ps);
3781 sv_setiv((SV*)gv, -1);
3782 SvREFCNT_dec(PL_compcv);
3783 cv = PL_compcv = NULL;
3784 PL_sub_generation++;
3788 if (!name || GvCVGEN(gv))
3790 else if (cv = GvCV(gv)) {
3791 cv_ckproto(cv, gv, ps);
3792 /* already defined (or promised)? */
3793 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3795 bool const_changed = TRUE;
3797 /* just a "sub foo;" when &foo is already defined */
3798 SAVEFREESV(PL_compcv);
3801 /* ahem, death to those who redefine active sort subs */
3802 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3803 croak("Can't redefine active sort subroutine %s", name);
3804 if(const_sv = cv_const_sv(cv))
3805 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3806 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3807 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3808 && HvNAME(GvSTASH(CvGV(cv)))
3809 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3811 line_t oldline = PL_curcop->cop_line;
3812 PL_curcop->cop_line = PL_copline;
3813 warner(WARN_REDEFINE,
3814 const_sv ? "Constant subroutine %s redefined"
3815 : "Subroutine %s redefined", name);
3816 PL_curcop->cop_line = oldline;
3822 if (cv) { /* must reuse cv if autoloaded */
3824 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3825 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3826 CvOUTSIDE(PL_compcv) = 0;
3827 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3828 CvPADLIST(PL_compcv) = 0;
3829 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3830 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3831 SvREFCNT_dec(PL_compcv);
3838 PL_sub_generation++;
3841 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3842 CvFILEGV(cv) = PL_curcop->cop_filegv;
3843 CvSTASH(cv) = PL_curstash;
3846 if (!CvMUTEXP(cv)) {
3847 New(666, CvMUTEXP(cv), 1, perl_mutex);
3848 MUTEX_INIT(CvMUTEXP(cv));
3850 #endif /* USE_THREADS */
3853 sv_setpv((SV*)cv, ps);
3855 if (PL_error_count) {
3859 char *s = strrchr(name, ':');
3861 if (strEQ(s, "BEGIN")) {
3863 "BEGIN not safe after errors--compilation aborted";
3867 /* force display of errors found but not reported */
3868 sv_catpv(ERRSV, not_safe);
3869 croak("%s", SvPVx(ERRSV, PL_na));
3876 PL_copline = NOLINE;
3881 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3882 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3885 SV **namep = AvARRAY(PL_comppad_name);
3886 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3889 if (SvIMMORTAL(PL_curpad[ix]))
3892 * The only things that a clonable function needs in its
3893 * pad are references to outer lexicals and anonymous subs.
3894 * The rest are created anew during cloning.
3896 if (!((namesv = namep[ix]) != Nullsv &&
3897 namesv != &PL_sv_undef &&
3899 *SvPVX(namesv) == '&')))
3901 SvREFCNT_dec(PL_curpad[ix]);
3902 PL_curpad[ix] = Nullsv;
3907 AV *av = newAV(); /* Will be @_ */
3909 av_store(PL_comppad, 0, (SV*)av);
3910 AvFLAGS(av) = AVf_REIFY;
3912 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3913 if (SvIMMORTAL(PL_curpad[ix]))
3915 if (!SvPADMY(PL_curpad[ix]))
3916 SvPADTMP_on(PL_curpad[ix]);
3920 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3921 CvSTART(cv) = LINKLIST(CvROOT(cv));
3922 CvROOT(cv)->op_next = 0;
3928 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3929 SV *sv = NEWSV(0,0);
3930 SV *tmpstr = sv_newmortal();
3931 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3935 sv_setpvf(sv, "%_:%ld-%ld",
3936 GvSV(PL_curcop->cop_filegv),
3937 (long)PL_subline, (long)PL_curcop->cop_line);
3938 gv_efullname3(tmpstr, gv, Nullch);
3939 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3940 hv = GvHVn(db_postponed);
3941 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3942 && (cv = GvCV(db_postponed))) {
3947 perl_call_sv((SV*)cv, G_DISCARD);
3951 if ((s = strrchr(name,':')))
3955 if (strEQ(s, "BEGIN")) {
3956 I32 oldscope = PL_scopestack_ix;
3958 SAVESPTR(PL_compiling.cop_filegv);
3959 SAVEI16(PL_compiling.cop_line);
3961 sv_setsv(PL_rs, PL_nrs);
3964 PL_beginav = newAV();
3965 DEBUG_x( dump_sub(gv) );
3966 av_push(PL_beginav, (SV *)cv);
3968 call_list(oldscope, PL_beginav);
3970 PL_curcop = &PL_compiling;
3971 PL_compiling.op_private = PL_hints;
3974 else if (strEQ(s, "END") && !PL_error_count) {
3977 av_unshift(PL_endav, 1);
3978 av_store(PL_endav, 0, (SV *)cv);
3981 else if (strEQ(s, "INIT") && !PL_error_count) {
3983 PL_initav = newAV();
3984 av_push(PL_initav, SvREFCNT_inc(cv));
3990 PL_copline = NOLINE;
3996 newCONSTSUB(HV *stash, char *name, SV *sv)
3999 U32 oldhints = PL_hints;
4000 HV *old_cop_stash = PL_curcop->cop_stash;
4001 HV *old_curstash = PL_curstash;
4002 line_t oldline = PL_curcop->cop_line;
4003 PL_curcop->cop_line = PL_copline;
4005 PL_hints &= ~HINT_BLOCK_SCOPE;
4007 PL_curstash = PL_curcop->cop_stash = stash;
4010 start_subparse(FALSE, 0),
4011 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4012 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4013 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4016 PL_hints = oldhints;
4017 PL_curcop->cop_stash = old_cop_stash;
4018 PL_curstash = old_curstash;
4019 PL_curcop->cop_line = oldline;
4023 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4026 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4029 if (cv = (name ? GvCV(gv) : Nullcv)) {
4031 /* just a cached method */
4035 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4036 /* already defined (or promised) */
4037 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4038 && HvNAME(GvSTASH(CvGV(cv)))
4039 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4040 line_t oldline = PL_curcop->cop_line;
4041 if (PL_copline != NOLINE)
4042 PL_curcop->cop_line = PL_copline;
4043 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4044 PL_curcop->cop_line = oldline;
4051 if (cv) /* must reuse cv if autoloaded */
4054 cv = (CV*)NEWSV(1105,0);
4055 sv_upgrade((SV *)cv, SVt_PVCV);
4059 PL_sub_generation++;
4062 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4064 New(666, CvMUTEXP(cv), 1, perl_mutex);
4065 MUTEX_INIT(CvMUTEXP(cv));
4067 #endif /* USE_THREADS */
4068 CvFILEGV(cv) = gv_fetchfile(filename);
4069 CvXSUB(cv) = subaddr;
4072 char *s = strrchr(name,':');
4077 if (strEQ(s, "BEGIN")) {
4079 PL_beginav = newAV();
4080 av_push(PL_beginav, (SV *)cv);
4083 else if (strEQ(s, "END")) {
4086 av_unshift(PL_endav, 1);
4087 av_store(PL_endav, 0, (SV *)cv);
4090 else if (strEQ(s, "INIT")) {
4092 PL_initav = newAV();
4093 av_push(PL_initav, (SV *)cv);
4104 newFORM(I32 floor, OP *o, OP *block)
4113 name = SvPVx(cSVOPo->op_sv, PL_na);
4116 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4118 if (cv = GvFORM(gv)) {
4119 if (ckWARN(WARN_REDEFINE)) {
4120 line_t oldline = PL_curcop->cop_line;
4122 PL_curcop->cop_line = PL_copline;
4123 warner(WARN_REDEFINE, "Format %s redefined",name);
4124 PL_curcop->cop_line = oldline;
4130 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4131 CvFILEGV(cv) = PL_curcop->cop_filegv;
4133 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4134 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4135 SvPADTMP_on(PL_curpad[ix]);
4138 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4139 CvSTART(cv) = LINKLIST(CvROOT(cv));
4140 CvROOT(cv)->op_next = 0;
4143 PL_copline = NOLINE;
4150 return newUNOP(OP_REFGEN, 0,
4151 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4157 return newUNOP(OP_REFGEN, 0,
4158 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4162 newANONSUB(I32 floor, OP *proto, OP *block)
4164 return newUNOP(OP_REFGEN, 0,
4165 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4171 switch (o->op_type) {
4173 o->op_type = OP_PADAV;
4174 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4175 return ref(o, OP_RV2AV);
4178 o->op_type = OP_RV2AV;
4179 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4184 warn("oops: oopsAV");
4193 switch (o->op_type) {
4196 o->op_type = OP_PADHV;
4197 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4198 return ref(o, OP_RV2HV);
4202 o->op_type = OP_RV2HV;
4203 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4208 warn("oops: oopsHV");
4217 if (o->op_type == OP_PADANY) {
4218 o->op_type = OP_PADAV;
4219 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4222 return newUNOP(OP_RV2AV, 0, scalar(o));
4226 newGVREF(I32 type, OP *o)
4228 if (type == OP_MAPSTART)
4229 return newUNOP(OP_NULL, 0, o);
4230 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4236 if (o->op_type == OP_PADANY) {
4237 o->op_type = OP_PADHV;
4238 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4241 return newUNOP(OP_RV2HV, 0, scalar(o));
4247 croak("NOT IMPL LINE %d",__LINE__);
4253 newCVREF(I32 flags, OP *o)
4255 return newUNOP(OP_RV2CV, flags, scalar(o));
4261 if (o->op_type == OP_PADANY) {
4262 o->op_type = OP_PADSV;
4263 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4266 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4267 o->op_flags |= OPpDONE_SVREF;
4270 return newUNOP(OP_RV2SV, 0, scalar(o));
4273 /* Check routines. */
4281 name = NEWSV(1106,0);
4282 sv_upgrade(name, SVt_PVNV);
4283 sv_setpvn(name, "&", 1);
4286 ix = pad_alloc(o->op_type, SVs_PADMY);
4287 av_store(PL_comppad_name, ix, name);
4288 av_store(PL_comppad, ix, cSVOPo->op_sv);
4289 SvPADMY_on(cSVOPo->op_sv);
4290 cSVOPo->op_sv = Nullsv;
4291 cSVOPo->op_targ = ix;
4298 o->op_private = PL_hints;
4305 if (cUNOPo->op_first->op_type == OP_CONCAT)
4306 o->op_flags |= OPf_STACKED;
4313 if (o->op_flags & OPf_KIDS) {
4316 OPCODE type = o->op_type;
4317 o = modkids(ck_fun(o), type);
4318 kid = cUNOPo->op_first;
4319 newop = kUNOP->op_first->op_sibling;
4321 (newop->op_sibling ||
4322 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4323 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4324 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4328 op_free(kUNOP->op_first);
4329 kUNOP->op_first = newop;
4331 o->op_ppaddr = PL_ppaddr[++o->op_type];
4340 if (o->op_flags & OPf_KIDS) {
4341 OP *kid = cUNOPo->op_first;
4342 if (kid->op_type == OP_HSLICE)
4343 o->op_private |= OPpSLICE;
4344 else if (kid->op_type != OP_HELEM)
4345 croak("%s argument is not a HASH element or slice",
4346 PL_op_desc[o->op_type]);
4355 I32 type = o->op_type;
4357 if (o->op_flags & OPf_KIDS) {
4358 if (cLISTOPo->op_first->op_type == OP_STUB) {
4360 o = newUNOP(type, OPf_SPECIAL,
4361 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4371 PL_hints |= HINT_BLOCK_SCOPE;
4372 if (o->op_flags & OPf_KIDS) {
4373 SVOP *kid = (SVOP*)cUNOPo->op_first;
4376 o->op_flags &= ~OPf_KIDS;
4379 else if (kid->op_type == OP_LINESEQ) {
4382 kid->op_next = o->op_next;
4383 cUNOPo->op_first = 0;
4386 Newz(1101, enter, 1, LOGOP);
4387 enter->op_type = OP_ENTERTRY;
4388 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4389 enter->op_private = 0;
4391 /* establish postfix order */
4392 enter->op_next = (OP*)enter;
4394 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4395 o->op_type = OP_LEAVETRY;
4396 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4397 enter->op_other = o;
4405 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4407 o->op_targ = (PADOFFSET)PL_hints;
4415 if (o->op_flags & OPf_STACKED) {
4417 kid = cUNOPo->op_first->op_sibling;
4418 if (kid->op_type == OP_RV2GV)
4430 if (o->op_flags & OPf_KIDS) {
4431 OP *kid = cUNOPo->op_first;
4432 if (kid->op_type != OP_HELEM)
4433 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4441 ck_gvconst(register OP *o)
4443 o = fold_constants(o);
4444 if (o->op_type == OP_CONST)
4451 ck_rvconst(register OP *o)
4454 SVOP *kid = (SVOP*)cUNOPo->op_first;
4456 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4457 if (kid->op_type == OP_CONST) {
4461 SV *kidsv = kid->op_sv;
4463 /* Is it a constant from cv_const_sv()? */
4464 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4465 SV *rsv = SvRV(kidsv);
4466 int svtype = SvTYPE(rsv);
4467 char *badtype = Nullch;
4469 switch (o->op_type) {
4471 if (svtype > SVt_PVMG)
4472 badtype = "a SCALAR";
4475 if (svtype != SVt_PVAV)
4476 badtype = "an ARRAY";
4479 if (svtype != SVt_PVHV) {
4480 if (svtype == SVt_PVAV) { /* pseudohash? */
4481 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4482 if (ksv && SvROK(*ksv)
4483 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4492 if (svtype != SVt_PVCV)
4497 croak("Constant is not %s reference", badtype);
4500 name = SvPV(kidsv, PL_na);
4501 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4502 char *badthing = Nullch;
4503 switch (o->op_type) {
4505 badthing = "a SCALAR";
4508 badthing = "an ARRAY";
4511 badthing = "a HASH";
4516 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4520 * This is a little tricky. We only want to add the symbol if we
4521 * didn't add it in the lexer. Otherwise we get duplicate strict
4522 * warnings. But if we didn't add it in the lexer, we must at
4523 * least pretend like we wanted to add it even if it existed before,
4524 * or we get possible typo warnings. OPpCONST_ENTERED says
4525 * whether the lexer already added THIS instance of this symbol.
4527 iscv = (o->op_type == OP_RV2CV) * 2;
4529 gv = gv_fetchpv(name,
4530 iscv | !(kid->op_private & OPpCONST_ENTERED),
4533 : o->op_type == OP_RV2SV
4535 : o->op_type == OP_RV2AV
4537 : o->op_type == OP_RV2HV
4540 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4542 kid->op_type = OP_GV;
4543 SvREFCNT_dec(kid->op_sv);
4544 kid->op_sv = SvREFCNT_inc(gv);
4554 I32 type = o->op_type;
4556 if (o->op_flags & OPf_REF)
4559 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4560 SVOP *kid = (SVOP*)cUNOPo->op_first;
4562 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4563 OP *newop = newGVOP(type, OPf_REF,
4564 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4571 if (type == OP_FTTTY)
4572 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4575 return newUNOP(type, 0, newDEFSVOP());
4588 int type = o->op_type;
4589 register I32 oa = PL_opargs[type] >> OASHIFT;
4591 if (o->op_flags & OPf_STACKED) {
4592 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4595 return no_fh_allowed(o);
4598 if (o->op_flags & OPf_KIDS) {
4599 tokid = &cLISTOPo->op_first;
4600 kid = cLISTOPo->op_first;
4601 if (kid->op_type == OP_PUSHMARK ||
4602 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4604 tokid = &kid->op_sibling;
4605 kid = kid->op_sibling;
4607 if (!kid && PL_opargs[type] & OA_DEFGV)
4608 *tokid = kid = newDEFSVOP();
4612 sibl = kid->op_sibling;
4626 if (kid->op_type == OP_CONST &&
4627 (kid->op_private & OPpCONST_BARE)) {
4628 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4629 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4630 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4631 if (ckWARN(WARN_SYNTAX))
4633 "Array @%s missing the @ in argument %ld of %s()",
4634 name, (long)numargs, PL_op_desc[type]);
4637 kid->op_sibling = sibl;
4640 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4641 bad_type(numargs, "array", PL_op_desc[o->op_type], kid);
4645 if (kid->op_type == OP_CONST &&
4646 (kid->op_private & OPpCONST_BARE)) {
4647 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4648 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4649 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4650 if (ckWARN(WARN_SYNTAX))
4652 "Hash %%%s missing the %% in argument %ld of %s()",
4653 name, (long)numargs, PL_op_desc[type]);
4656 kid->op_sibling = sibl;
4659 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4660 bad_type(numargs, "hash", PL_op_desc[o->op_type], kid);
4665 OP *newop = newUNOP(OP_NULL, 0, kid);
4666 kid->op_sibling = 0;
4668 newop->op_next = newop;
4670 kid->op_sibling = sibl;
4675 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4676 if (kid->op_type == OP_CONST &&
4677 (kid->op_private & OPpCONST_BARE)) {
4678 OP *newop = newGVOP(OP_GV, 0,
4679 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4684 else if (kid->op_type == OP_READLINE) {
4685 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4686 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4689 kid->op_sibling = 0;
4690 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4692 kid->op_sibling = sibl;
4698 mod(scalar(kid), type);
4702 tokid = &kid->op_sibling;
4703 kid = kid->op_sibling;
4705 o->op_private |= numargs;
4707 return too_many_arguments(o,PL_op_desc[o->op_type]);
4710 else if (PL_opargs[type] & OA_DEFGV) {
4712 return newUNOP(type, 0, newDEFSVOP());
4716 while (oa & OA_OPTIONAL)
4718 if (oa && oa != OA_LIST)
4719 return too_few_arguments(o,PL_op_desc[o->op_type]);
4729 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4730 append_elem(OP_GLOB, o, newDEFSVOP());
4732 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4733 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4735 if (gv && GvIMPORTED_CV(gv)) {
4736 static int glob_index;
4738 append_elem(OP_GLOB, o,
4739 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4740 o->op_type = OP_LIST;
4741 o->op_ppaddr = PL_ppaddr[OP_LIST];
4742 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4743 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4744 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4745 append_elem(OP_LIST, o,
4746 scalar(newUNOP(OP_RV2CV, 0,
4747 newGVOP(OP_GV, 0, gv)))));
4748 o = newUNOP(OP_NULL, 0, ck_subr(o));
4749 o->op_targ = OP_GLOB; /* hint at what it used to be */
4752 gv = newGVgen("main");
4754 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4764 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4766 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4767 Newz(1101, gwop, 1, LOGOP);
4769 if (o->op_flags & OPf_STACKED) {
4772 kid = cLISTOPo->op_first->op_sibling;
4773 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4776 kid->op_next = (OP*)gwop;
4777 o->op_flags &= ~OPf_STACKED;
4779 kid = cLISTOPo->op_first->op_sibling;
4780 if (type == OP_MAPWHILE)
4787 kid = cLISTOPo->op_first->op_sibling;
4788 if (kid->op_type != OP_NULL)
4789 croak("panic: ck_grep");
4790 kid = kUNOP->op_first;
4792 gwop->op_type = type;
4793 gwop->op_ppaddr = PL_ppaddr[type];
4794 gwop->op_first = listkids(o);
4795 gwop->op_flags |= OPf_KIDS;
4796 gwop->op_private = 1;
4797 gwop->op_other = LINKLIST(kid);
4798 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4799 kid->op_next = (OP*)gwop;
4801 kid = cLISTOPo->op_first->op_sibling;
4802 if (!kid || !kid->op_sibling)
4803 return too_few_arguments(o,PL_op_desc[o->op_type]);
4804 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4805 mod(kid, OP_GREPSTART);
4813 if (o->op_flags & OPf_KIDS) {
4814 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4816 kid = kid->op_sibling; /* get past "big" */
4817 if (kid && kid->op_type == OP_CONST)
4818 fbm_compile(((SVOP*)kid)->op_sv, 0);
4824 ck_lengthconst(OP *o)
4826 /* XXX length optimization goes here */
4833 OPCODE type = o->op_type;
4834 return modkids(ck_fun(o), type);
4840 OPCODE type = o->op_type;
4841 return refkids(ck_fun(o), type);
4849 kid = cLISTOPo->op_first;
4852 kid = cLISTOPo->op_first;
4854 if (kid->op_type == OP_PUSHMARK)
4855 kid = kid->op_sibling;
4856 if (kid && o->op_flags & OPf_STACKED)
4857 kid = kid->op_sibling;
4858 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4859 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4860 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4861 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4862 cLISTOPo->op_first->op_sibling = kid;
4863 cLISTOPo->op_last = kid;
4864 kid = kid->op_sibling;
4869 append_elem(o->op_type, o, newDEFSVOP());
4875 if (PL_hints & HINT_LOCALE)
4876 o->op_private |= OPpLOCALE;
4883 ck_fun_locale(OP *o)
4889 if (PL_hints & HINT_LOCALE)
4890 o->op_private |= OPpLOCALE;
4901 if (PL_hints & HINT_LOCALE)
4902 o->op_private |= OPpLOCALE;
4911 o->op_private |= OPpRUNTIME;
4924 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4925 o->op_private |= OPpREPEAT_DOLIST;
4926 cBINOPo->op_first = force_list(cBINOPo->op_first);
4936 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4937 SVOP *kid = (SVOP*)cUNOPo->op_first;
4939 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4941 for (s = SvPVX(kid->op_sv); *s; s++) {
4942 if (*s == ':' && s[1] == ':') {
4944 Move(s+2, s+1, strlen(s+2)+1, char);
4945 --SvCUR(kid->op_sv);
4948 sv_catpvn(kid->op_sv, ".pm", 3);
4958 croak("NOT IMPL LINE %d",__LINE__);
4968 if (o->op_flags & OPf_KIDS) {
4969 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4970 if (kid && kid->op_sibling) {
4971 o->op_type = OP_SSELECT;
4972 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
4974 return fold_constants(o);
4978 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4979 if (kid && kid->op_type == OP_RV2GV)
4980 kid->op_private &= ~HINT_STRICT_REFS;
4987 I32 type = o->op_type;
4989 if (!(o->op_flags & OPf_KIDS)) {
4994 if (!CvUNIQUE(PL_compcv)) {
4995 argop = newOP(OP_PADAV, OPf_REF);
4996 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4999 argop = newUNOP(OP_RV2AV, 0,
5000 scalar(newGVOP(OP_GV, 0,
5001 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5004 argop = newUNOP(OP_RV2AV, 0,
5005 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5006 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5007 #endif /* USE_THREADS */
5008 return newUNOP(type, 0, scalar(argop));
5010 return scalar(modkids(ck_fun(o), type));
5018 if (PL_hints & HINT_LOCALE)
5019 o->op_private |= OPpLOCALE;
5022 if (o->op_flags & OPf_STACKED) {
5023 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5025 kid = kUNOP->op_first; /* get past rv2gv */
5027 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5029 if (kid->op_type == OP_SCOPE) {
5033 else if (kid->op_type == OP_LEAVE) {
5034 if (o->op_type == OP_SORT) {
5035 null(kid); /* wipe out leave */
5038 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5039 if (k->op_next == kid)
5044 kid->op_next = 0; /* just disconnect the leave */
5045 k = kLISTOP->op_first;
5049 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5050 null(kid); /* wipe out rv2gv */
5051 if (o->op_type == OP_SORT)
5055 o->op_flags |= OPf_SPECIAL;
5057 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5058 null(cLISTOPo->op_first->op_sibling);
5069 if (o->op_flags & OPf_STACKED)
5070 return no_fh_allowed(o);
5072 kid = cLISTOPo->op_first;
5073 if (kid->op_type != OP_NULL)
5074 croak("panic: ck_split");
5075 kid = kid->op_sibling;
5076 op_free(cLISTOPo->op_first);
5077 cLISTOPo->op_first = kid;
5079 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5080 cLISTOPo->op_last = kid; /* There was only one element previously */
5083 if (kid->op_type != OP_MATCH) {
5084 OP *sibl = kid->op_sibling;
5085 kid->op_sibling = 0;
5086 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5087 if (cLISTOPo->op_first == cLISTOPo->op_last)
5088 cLISTOPo->op_last = kid;
5089 cLISTOPo->op_first = kid;
5090 kid->op_sibling = sibl;
5093 kid->op_type = OP_PUSHRE;
5094 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5097 if (!kid->op_sibling)
5098 append_elem(OP_SPLIT, o, newDEFSVOP());
5100 kid = kid->op_sibling;
5103 if (!kid->op_sibling)
5104 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5106 kid = kid->op_sibling;
5109 if (kid->op_sibling)
5110 return too_many_arguments(o,PL_op_desc[o->op_type]);
5119 OP *prev = ((cUNOPo->op_first->op_sibling)
5120 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5121 OP *o2 = prev->op_sibling;
5129 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5130 if (cvop->op_type == OP_RV2CV) {
5132 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5133 null(cvop); /* disable rv2cv */
5134 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5135 if (tmpop->op_type == OP_GV) {
5136 cv = GvCVu(tmpop->op_sv);
5137 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5138 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5139 proto = SvPV((SV*)cv, PL_na);
5143 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5144 if (PERLDB_SUB && PL_curstash != PL_debstash)
5145 o->op_private |= OPpENTERSUB_DB;
5146 while (o2 != cvop) {
5150 return too_many_arguments(o, gv_ename(namegv));
5168 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5169 bad_type(arg, "block", gv_ename(namegv), o2);
5174 if (o2->op_type == OP_RV2GV)
5178 OP* sib = kid->op_sibling;
5179 kid->op_sibling = 0;
5180 o2 = newUNOP(OP_RV2GV, 0, kid);
5181 o2->op_sibling = sib;
5182 prev->op_sibling = o2;
5190 if (o2->op_type != OP_RV2GV)
5191 bad_type(arg, "symbol", gv_ename(namegv), o2);
5194 if (o2->op_type != OP_RV2CV)
5195 bad_type(arg, "sub", gv_ename(namegv), o2);
5198 if (o2->op_type != OP_RV2SV
5199 && o2->op_type != OP_PADSV
5200 && o2->op_type != OP_THREADSV)
5202 bad_type(arg, "scalar", gv_ename(namegv), o2);
5206 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5207 bad_type(arg, "array", gv_ename(namegv), o2);
5210 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5211 bad_type(arg, "hash", gv_ename(namegv), o2);
5215 OP* sib = kid->op_sibling;
5216 kid->op_sibling = 0;
5217 o2 = newUNOP(OP_REFGEN, 0, kid);
5218 o2->op_sibling = sib;
5219 prev->op_sibling = o2;
5230 croak("Malformed prototype for %s: %s",
5231 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5236 mod(o2, OP_ENTERSUB);
5238 o2 = o2->op_sibling;
5240 if (proto && !optional &&
5241 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5242 return too_few_arguments(o, gv_ename(namegv));
5249 SvREADONLY_on(cSVOPo->op_sv);
5256 if (o->op_flags & OPf_KIDS) {
5257 SVOP *kid = (SVOP*)cUNOPo->op_first;
5259 if (kid->op_type == OP_NULL)
5260 kid = (SVOP*)kid->op_sibling;
5262 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5263 o->op_flags |= OPf_SPECIAL;
5268 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5271 peep(register OP *o)
5274 register OP* oldop = 0;
5275 if (!o || o->op_seq)
5279 SAVESPTR(PL_curcop);
5280 for (; o; o = o->op_next) {
5286 switch (o->op_type) {
5289 PL_curcop = ((COP*)o); /* for warnings */
5290 o->op_seq = PL_op_seqmax++;
5301 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5303 o->op_seq = PL_op_seqmax++;
5306 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5307 o->op_seq = PL_op_seqmax++;
5308 break; /* Scalar stub must produce undef. List stub is noop */
5312 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5313 PL_curcop = ((COP*)o);
5319 if (oldop && o->op_next) {
5320 oldop->op_next = o->op_next;
5323 o->op_seq = PL_op_seqmax++;
5327 if (o->op_next->op_type == OP_RV2SV) {
5328 if (!(o->op_next->op_private & OPpDEREF)) {
5330 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5331 o->op_next = o->op_next->op_next;
5332 o->op_type = OP_GVSV;
5333 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5336 else if (o->op_next->op_type == OP_RV2AV) {
5337 OP* pop = o->op_next->op_next;
5339 if (pop->op_type == OP_CONST &&
5340 (PL_op = pop->op_next) &&
5341 pop->op_next->op_type == OP_AELEM &&
5342 !(pop->op_next->op_private &
5343 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5344 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5348 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5352 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5353 o->op_next = pop->op_next->op_next;
5354 o->op_type = OP_AELEMFAST;
5355 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5356 o->op_private = (U8)i;
5357 GvAVn(((GVOP*)o)->op_gv);
5360 o->op_seq = PL_op_seqmax++;
5367 o->op_seq = PL_op_seqmax++;
5368 while (cLOGOP->op_other->op_type == OP_NULL)
5369 cLOGOP->op_other = cLOGOP->op_other->op_next;
5370 peep(cLOGOP->op_other);
5374 o->op_seq = PL_op_seqmax++;
5375 peep(cCONDOP->op_true);
5376 peep(cCONDOP->op_false);
5380 o->op_seq = PL_op_seqmax++;
5381 peep(cLOOP->op_redoop);
5382 peep(cLOOP->op_nextop);
5383 peep(cLOOP->op_lastop);
5389 o->op_seq = PL_op_seqmax++;
5390 peep(cPMOP->op_pmreplstart);
5394 o->op_seq = PL_op_seqmax++;
5395 if (ckWARN(WARN_SYNTAX) && o->op_next
5396 && o->op_next->op_type == OP_NEXTSTATE) {
5397 if (o->op_next->op_sibling &&
5398 o->op_next->op_sibling->op_type != OP_EXIT &&
5399 o->op_next->op_sibling->op_type != OP_WARN &&
5400 o->op_next->op_sibling->op_type != OP_DIE) {
5401 line_t oldline = PL_curcop->cop_line;
5403 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5404 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5405 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5406 PL_curcop->cop_line = oldline;
5420 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5421 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5423 rop = (UNOP*)((BINOP*)o)->op_first;
5424 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5426 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5427 if (!SvOBJECT(lexname))
5429 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5430 if (!fields || !GvHV(*fields))
5432 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5433 key = SvPV(*svp, keylen);
5434 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5436 croak("No such field \"%s\" in variable %s of type %s",
5437 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5439 ind = SvIV(*indsvp);
5441 croak("Bad index while coercing array into hash");
5442 rop->op_type = OP_RV2AV;
5443 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5444 o->op_type = OP_AELEM;
5445 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5447 *svp = newSViv(ind);
5452 o->op_seq = PL_op_seqmax++;