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;
586 /* XXX %! tied to Errno.pm needs to be added here.
587 * See gv_fetchpv(). */
591 sv_magic(sv, 0, 0, name, 1);
593 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
594 "find_threadsv: new SV %p for $%s%c\n",
595 sv, (*name < 32) ? "^" : "",
596 (*name < 32) ? toCTRL(*name) : *name));
600 #endif /* USE_THREADS */
607 register OP *kid, *nextkid;
609 if (!o || o->op_seq == (U16)-1)
612 if (o->op_flags & OPf_KIDS) {
613 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
614 nextkid = kid->op_sibling; /* Get before next freeing kid */
619 switch (o->op_type) {
621 o->op_targ = 0; /* Was holding old type, if any. */
624 o->op_targ = 0; /* Was holding hints. */
628 if (!(o->op_flags & OPf_SPECIAL))
632 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
634 #endif /* USE_THREADS */
636 if (!(o->op_flags & OPf_REF)
637 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
643 SvREFCNT_dec(cGVOPo->op_gv);
647 Safefree(cCOPo->cop_label);
648 SvREFCNT_dec(cCOPo->cop_filegv);
649 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
650 SvREFCNT_dec(cCOPo->cop_warnings);
653 SvREFCNT_dec(cSVOPo->op_sv);
659 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
663 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
664 SvREFCNT_dec(cSVOPo->op_sv);
666 Safefree(cPVOPo->op_pv);
669 op_free(cPMOPo->op_pmreplroot);
674 ReREFCNT_dec(cPMOPo->op_pmregexp);
679 pad_free(o->op_targ);
687 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
688 pad_free(o->op_targ);
689 o->op_targ = o->op_type;
690 o->op_type = OP_NULL;
691 o->op_ppaddr = PL_ppaddr[OP_NULL];
694 /* Contextualizers */
696 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
706 /* establish postfix order */
707 if (cUNOPo->op_first) {
708 o->op_next = LINKLIST(cUNOPo->op_first);
709 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
711 kid->op_next = LINKLIST(kid->op_sibling);
726 if (o && o->op_flags & OPf_KIDS) {
727 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
736 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
738 if (ckWARN(WARN_SYNTAX)) {
739 line_t oldline = PL_curcop->cop_line;
741 if (PL_copline != NOLINE)
742 PL_curcop->cop_line = PL_copline;
743 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
744 PL_curcop->cop_line = oldline;
755 /* assumes no premature commitment */
756 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
757 || o->op_type == OP_RETURN)
760 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
762 switch (o->op_type) {
764 if (o->op_private & OPpREPEAT_DOLIST)
765 null(((LISTOP*)cBINOPo->op_first)->op_first);
766 scalar(cBINOPo->op_first);
771 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
775 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
776 if (!kPMOP->op_pmreplroot)
777 deprecate("implicit split to @_");
785 if (o->op_flags & OPf_KIDS) {
786 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
792 kid = cLISTOPo->op_first;
794 while (kid = kid->op_sibling) {
800 WITH_THR(PL_curcop = &PL_compiling);
805 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
811 WITH_THR(PL_curcop = &PL_compiling);
824 /* assumes no premature commitment */
825 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
826 || o->op_type == OP_RETURN)
829 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
831 switch (o->op_type) {
833 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
837 if (o->op_flags & OPf_STACKED)
841 if (o->op_private == 4)
912 if (!(o->op_private & OPpLVAL_INTRO))
913 useless = PL_op_desc[o->op_type];
920 if (!(o->op_private & OPpLVAL_INTRO) &&
921 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
922 useless = "a variable";
927 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
934 if (ckWARN(WARN_VOID)) {
935 useless = "a constant";
936 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
938 else if (SvPOK(sv)) {
939 if (strnEQ(SvPVX(sv), "di", 2) ||
940 strnEQ(SvPVX(sv), "ds", 2) ||
941 strnEQ(SvPVX(sv), "ig", 2))
946 null(o); /* don't execute a constant */
947 SvREFCNT_dec(sv); /* don't even remember it */
951 o->op_type = OP_PREINC; /* pre-increment is faster */
952 o->op_ppaddr = PL_ppaddr[OP_PREINC];
956 o->op_type = OP_PREDEC; /* pre-decrement is faster */
957 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
963 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
968 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
969 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
970 if (o->op_flags & OPf_STACKED)
976 if (!(o->op_flags & OPf_KIDS))
985 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
992 /* all requires must return a boolean value */
993 o->op_flags &= ~OPf_WANT;
996 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
997 if (!kPMOP->op_pmreplroot)
998 deprecate("implicit split to @_");
1004 if (ckWARN(WARN_VOID))
1005 warner(WARN_VOID, "Useless use of %s in void context", useless);
1014 if (o && o->op_flags & OPf_KIDS) {
1015 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1026 /* assumes no premature commitment */
1027 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1028 || o->op_type == OP_RETURN)
1031 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1033 switch (o->op_type) {
1036 list(cBINOPo->op_first);
1041 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1049 if (!(o->op_flags & OPf_KIDS))
1051 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1052 list(cBINOPo->op_first);
1053 return gen_constant_list(o);
1060 kid = cLISTOPo->op_first;
1062 while (kid = kid->op_sibling) {
1063 if (kid->op_sibling)
1068 WITH_THR(PL_curcop = &PL_compiling);
1072 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1073 if (kid->op_sibling)
1078 WITH_THR(PL_curcop = &PL_compiling);
1081 /* all requires must return a boolean value */
1082 o->op_flags &= ~OPf_WANT;
1094 if (o->op_type == OP_LINESEQ ||
1095 o->op_type == OP_SCOPE ||
1096 o->op_type == OP_LEAVE ||
1097 o->op_type == OP_LEAVETRY)
1100 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1101 if (kid->op_sibling) {
1105 PL_curcop = &PL_compiling;
1107 o->op_flags &= ~OPf_PARENS;
1108 if (PL_hints & HINT_BLOCK_SCOPE)
1109 o->op_flags |= OPf_PARENS;
1112 o = newOP(OP_STUB, 0);
1117 modkids(OP *o, I32 type)
1120 if (o && o->op_flags & OPf_KIDS) {
1121 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1128 mod(OP *o, I32 type)
1134 if (!o || PL_error_count)
1137 switch (o->op_type) {
1142 if (!(o->op_private & (OPpCONST_ARYBASE)))
1144 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1145 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1149 SAVEI32(PL_compiling.cop_arybase);
1150 PL_compiling.cop_arybase = 0;
1152 else if (type == OP_REFGEN)
1155 croak("That use of $[ is unsupported");
1158 if (o->op_flags & OPf_PARENS)
1162 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1163 !(o->op_flags & OPf_STACKED)) {
1164 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1165 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1166 assert(cUNOPo->op_first->op_type == OP_NULL);
1167 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1173 /* grep, foreach, subcalls, refgen */
1174 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1176 yyerror(form("Can't modify %s in %s",
1177 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1178 ? "do block" : PL_op_desc[o->op_type]),
1179 type ? PL_op_desc[type] : "local"));
1193 case OP_RIGHT_SHIFT:
1202 if (!(o->op_flags & OPf_STACKED))
1208 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1214 if (!type && cUNOPo->op_first->op_type != OP_GV)
1215 croak("Can't localize through a reference");
1216 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1217 PL_modcount = 10000;
1218 return o; /* Treat \(@foo) like ordinary list. */
1222 if (scalar_mod_type(o, type))
1224 ref(cUNOPo->op_first, o->op_type);
1233 PL_modcount = 10000;
1236 if (!type && cUNOPo->op_first->op_type != OP_GV)
1237 croak("Can't localize through a reference");
1238 ref(cUNOPo->op_first, o->op_type);
1242 PL_hints |= HINT_BLOCK_SCOPE;
1250 PL_modcount = 10000;
1251 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1252 return o; /* Treat \(@foo) like ordinary list. */
1253 if (scalar_mod_type(o, type))
1259 croak("Can't localize lexical variable %s",
1260 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1265 PL_modcount++; /* XXX ??? */
1267 #endif /* USE_THREADS */
1273 if (type != OP_SASSIGN)
1277 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1283 pad_free(o->op_targ);
1284 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1285 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1286 if (o->op_flags & OPf_KIDS)
1287 mod(cBINOPo->op_first->op_sibling, type);
1292 ref(cBINOPo->op_first, o->op_type);
1293 if (type == OP_ENTERSUB &&
1294 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1295 o->op_private |= OPpLVAL_DEFER;
1302 if (o->op_flags & OPf_KIDS)
1303 mod(cLISTOPo->op_last, type);
1307 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1309 else if (!(o->op_flags & OPf_KIDS))
1311 if (o->op_targ != OP_LIST) {
1312 mod(cBINOPo->op_first, type);
1317 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1321 o->op_flags |= OPf_MOD;
1323 if (type == OP_AASSIGN || type == OP_SASSIGN)
1324 o->op_flags |= OPf_SPECIAL|OPf_REF;
1326 o->op_private |= OPpLVAL_INTRO;
1327 o->op_flags &= ~OPf_SPECIAL;
1328 PL_hints |= HINT_BLOCK_SCOPE;
1330 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1331 o->op_flags |= OPf_REF;
1336 scalar_mod_type(OP *o, I32 type)
1340 if (o->op_type == OP_RV2GV)
1364 case OP_RIGHT_SHIFT:
1374 case OP_ANDASSIGN: /* may work later */
1375 case OP_ORASSIGN: /* may work later */
1383 refkids(OP *o, I32 type)
1386 if (o && o->op_flags & OPf_KIDS) {
1387 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1394 ref(OP *o, I32 type)
1398 if (!o || PL_error_count)
1401 switch (o->op_type) {
1403 if ((type == OP_DEFINED || type == OP_LOCK) &&
1404 !(o->op_flags & OPf_STACKED)) {
1405 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1406 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1407 assert(cUNOPo->op_first->op_type == OP_NULL);
1408 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1409 o->op_flags |= OPf_SPECIAL;
1414 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1418 ref(cUNOPo->op_first, o->op_type);
1421 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1422 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1423 : type == OP_RV2HV ? OPpDEREF_HV
1425 o->op_flags |= OPf_MOD;
1430 o->op_flags |= OPf_MOD; /* XXX ??? */
1435 o->op_flags |= OPf_REF;
1438 ref(cUNOPo->op_first, o->op_type);
1443 o->op_flags |= OPf_REF;
1448 if (!(o->op_flags & OPf_KIDS))
1450 ref(cBINOPo->op_first, type);
1454 ref(cBINOPo->op_first, o->op_type);
1455 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1456 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1457 : type == OP_RV2HV ? OPpDEREF_HV
1459 o->op_flags |= OPf_MOD;
1467 if (!(o->op_flags & OPf_KIDS))
1469 ref(cLISTOPo->op_last, type);
1484 if (!o || PL_error_count)
1488 if (type == OP_LIST) {
1489 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1491 } else if (type == OP_UNDEF) {
1493 } else if (type != OP_PADSV &&
1496 type != OP_PUSHMARK)
1498 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1501 o->op_flags |= OPf_MOD;
1502 o->op_private |= OPpLVAL_INTRO;
1510 o->op_flags |= OPf_PARENS;
1515 bind_match(I32 type, OP *left, OP *right)
1520 if (ckWARN(WARN_UNSAFE) &&
1521 (left->op_type == OP_RV2AV ||
1522 left->op_type == OP_RV2HV ||
1523 left->op_type == OP_PADAV ||
1524 left->op_type == OP_PADHV)) {
1525 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1526 right->op_type == OP_TRANS)
1527 ? right->op_type : OP_MATCH];
1528 char *sample = ((left->op_type == OP_RV2AV ||
1529 left->op_type == OP_PADAV)
1530 ? "@array" : "%hash");
1532 "Applying %s to %s will act on scalar(%s)",
1533 desc, sample, sample);
1536 if (right->op_type == OP_MATCH ||
1537 right->op_type == OP_SUBST ||
1538 right->op_type == OP_TRANS) {
1539 right->op_flags |= OPf_STACKED;
1540 if (right->op_type != OP_MATCH)
1541 left = mod(left, right->op_type);
1542 if (right->op_type == OP_TRANS)
1543 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1545 o = prepend_elem(right->op_type, scalar(left), right);
1547 return newUNOP(OP_NOT, 0, scalar(o));
1551 return bind_match(type, left,
1552 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1560 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1561 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1568 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1569 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1570 o->op_type = OP_LEAVE;
1571 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1574 if (o->op_type == OP_LINESEQ) {
1576 o->op_type = OP_SCOPE;
1577 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1578 kid = ((LISTOP*)o)->op_first;
1579 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1580 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1585 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1595 SAVESPTR(GvHV(PL_hintgv));
1596 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1597 SAVEFREESV(GvHV(PL_hintgv));
1601 block_start(int full)
1604 int retval = PL_savestack_ix;
1606 SAVEI32(PL_comppad_name_floor);
1608 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1609 PL_comppad_name_floor = PL_comppad_name_fill;
1611 PL_comppad_name_floor = 0;
1613 SAVEI32(PL_min_intro_pending);
1614 SAVEI32(PL_max_intro_pending);
1615 PL_min_intro_pending = 0;
1616 SAVEI32(PL_comppad_name_fill);
1617 SAVEI32(PL_padix_floor);
1618 PL_padix_floor = PL_padix;
1619 PL_pad_reset_pending = FALSE;
1621 PL_hints &= ~HINT_BLOCK_SCOPE;
1622 SAVEPPTR(PL_compiling.cop_warnings);
1623 if (PL_compiling.cop_warnings != WARN_ALL &&
1624 PL_compiling.cop_warnings != WARN_NONE) {
1625 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1626 SAVEFREESV(PL_compiling.cop_warnings) ;
1634 block_end(I32 floor, OP *seq)
1637 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1638 OP* retval = scalarseq(seq);
1640 PL_pad_reset_pending = FALSE;
1641 PL_compiling.op_private = PL_hints;
1643 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1644 pad_leavemy(PL_comppad_name_fill);
1653 OP *o = newOP(OP_THREADSV, 0);
1654 o->op_targ = find_threadsv("_");
1657 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1658 #endif /* USE_THREADS */
1666 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1667 PL_eval_start = linklist(PL_eval_root);
1668 PL_eval_root->op_next = 0;
1669 peep(PL_eval_start);
1674 PL_main_root = scope(sawparens(scalarvoid(o)));
1675 PL_curcop = &PL_compiling;
1676 PL_main_start = LINKLIST(PL_main_root);
1677 PL_main_root->op_next = 0;
1678 peep(PL_main_start);
1681 /* Register with debugger */
1683 CV *cv = perl_get_cv("DB::postponed", FALSE);
1687 XPUSHs((SV*)PL_compiling.cop_filegv);
1689 perl_call_sv((SV*)cv, G_DISCARD);
1696 localize(OP *o, I32 lex)
1698 if (o->op_flags & OPf_PARENS)
1702 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1704 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1705 if (*s == ';' || *s == '=')
1706 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1707 lex ? "my" : "local");
1711 PL_in_my_stash = Nullhv;
1715 return mod(o, OP_NULL); /* a bit kludgey */
1721 if (o->op_type == OP_LIST) {
1724 o2 = newOP(OP_THREADSV, 0);
1725 o2->op_targ = find_threadsv(";");
1727 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1728 #endif /* USE_THREADS */
1729 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1735 fold_constants(register OP *o)
1739 I32 type = o->op_type;
1742 if (PL_opargs[type] & OA_RETSCALAR)
1744 if (PL_opargs[type] & OA_TARGET)
1745 o->op_targ = pad_alloc(type, SVs_PADTMP);
1747 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1748 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1750 if (!(PL_opargs[type] & OA_FOLDCONST))
1765 if (o->op_private & OPpLOCALE)
1770 goto nope; /* Don't try to run w/ errors */
1772 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1773 if (curop->op_type != OP_CONST &&
1774 curop->op_type != OP_LIST &&
1775 curop->op_type != OP_SCALAR &&
1776 curop->op_type != OP_NULL &&
1777 curop->op_type != OP_PUSHMARK) {
1782 curop = LINKLIST(o);
1786 sv = *(PL_stack_sp--);
1787 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1788 pad_swipe(o->op_targ);
1789 else if (SvTEMP(sv)) { /* grab mortal temp? */
1790 (void)SvREFCNT_inc(sv);
1794 if (type == OP_RV2GV)
1795 return newGVOP(OP_GV, 0, (GV*)sv);
1797 /* try to smush double to int, but don't smush -2.0 to -2 */
1798 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1802 if ((double)iv == SvNV(sv)) {
1807 SvIOK_off(sv); /* undo SvIV() damage */
1809 return newSVOP(OP_CONST, 0, sv);
1813 if (!(PL_opargs[type] & OA_OTHERINT))
1816 if (!(PL_hints & HINT_INTEGER)) {
1817 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1820 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1821 if (curop->op_type == OP_CONST) {
1822 if (SvIOK(((SVOP*)curop)->op_sv))
1826 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1830 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1837 gen_constant_list(register OP *o)
1841 I32 oldtmps_floor = PL_tmps_floor;
1845 return o; /* Don't attempt to run with errors */
1847 PL_op = curop = LINKLIST(o);
1853 PL_tmps_floor = oldtmps_floor;
1855 o->op_type = OP_RV2AV;
1856 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1857 curop = ((UNOP*)o)->op_first;
1858 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1865 convert(I32 type, I32 flags, OP *o)
1870 if (!o || o->op_type != OP_LIST)
1871 o = newLISTOP(OP_LIST, 0, o, Nullop);
1873 o->op_flags &= ~OPf_WANT;
1875 if (!(PL_opargs[type] & OA_MARK))
1876 null(cLISTOPo->op_first);
1879 o->op_ppaddr = PL_ppaddr[type];
1880 o->op_flags |= flags;
1882 o = CHECKOP(type, o);
1883 if (o->op_type != type)
1886 if (cLISTOPo->op_children < 7) {
1887 /* XXX do we really need to do this if we're done appending?? */
1888 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1890 cLISTOPo->op_last = last; /* in case check substituted last arg */
1893 return fold_constants(o);
1896 /* List constructors */
1899 append_elem(I32 type, OP *first, OP *last)
1907 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1908 return newLISTOP(type, 0, first, last);
1910 if (first->op_flags & OPf_KIDS)
1911 ((LISTOP*)first)->op_last->op_sibling = last;
1913 first->op_flags |= OPf_KIDS;
1914 ((LISTOP*)first)->op_first = last;
1916 ((LISTOP*)first)->op_last = last;
1917 ((LISTOP*)first)->op_children++;
1922 append_list(I32 type, LISTOP *first, LISTOP *last)
1930 if (first->op_type != type)
1931 return prepend_elem(type, (OP*)first, (OP*)last);
1933 if (last->op_type != type)
1934 return append_elem(type, (OP*)first, (OP*)last);
1936 first->op_last->op_sibling = last->op_first;
1937 first->op_last = last->op_last;
1938 first->op_children += last->op_children;
1939 if (first->op_children)
1940 first->op_flags |= OPf_KIDS;
1947 prepend_elem(I32 type, OP *first, OP *last)
1955 if (last->op_type == type) {
1956 if (type == OP_LIST) { /* already a PUSHMARK there */
1957 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1958 ((LISTOP*)last)->op_first->op_sibling = first;
1961 if (!(last->op_flags & OPf_KIDS)) {
1962 ((LISTOP*)last)->op_last = first;
1963 last->op_flags |= OPf_KIDS;
1965 first->op_sibling = ((LISTOP*)last)->op_first;
1966 ((LISTOP*)last)->op_first = first;
1968 ((LISTOP*)last)->op_children++;
1972 return newLISTOP(type, 0, first, last);
1980 return newOP(OP_STUB, 0);
1986 if (!o || o->op_type != OP_LIST)
1987 o = newLISTOP(OP_LIST, 0, o, Nullop);
1993 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1997 Newz(1101, listop, 1, LISTOP);
1999 listop->op_type = type;
2000 listop->op_ppaddr = PL_ppaddr[type];
2001 listop->op_children = (first != 0) + (last != 0);
2002 listop->op_flags = flags;
2006 else if (!first && last)
2009 first->op_sibling = last;
2010 listop->op_first = first;
2011 listop->op_last = last;
2012 if (type == OP_LIST) {
2014 pushop = newOP(OP_PUSHMARK, 0);
2015 pushop->op_sibling = first;
2016 listop->op_first = pushop;
2017 listop->op_flags |= OPf_KIDS;
2019 listop->op_last = pushop;
2021 else if (listop->op_children)
2022 listop->op_flags |= OPf_KIDS;
2028 newOP(I32 type, I32 flags)
2031 Newz(1101, o, 1, OP);
2033 o->op_ppaddr = PL_ppaddr[type];
2034 o->op_flags = flags;
2037 o->op_private = 0 + (flags >> 8);
2038 if (PL_opargs[type] & OA_RETSCALAR)
2040 if (PL_opargs[type] & OA_TARGET)
2041 o->op_targ = pad_alloc(type, SVs_PADTMP);
2042 return CHECKOP(type, o);
2046 newUNOP(I32 type, I32 flags, OP *first)
2051 first = newOP(OP_STUB, 0);
2052 if (PL_opargs[type] & OA_MARK)
2053 first = force_list(first);
2055 Newz(1101, unop, 1, UNOP);
2056 unop->op_type = type;
2057 unop->op_ppaddr = PL_ppaddr[type];
2058 unop->op_first = first;
2059 unop->op_flags = flags | OPf_KIDS;
2060 unop->op_private = 1 | (flags >> 8);
2061 unop = (UNOP*) CHECKOP(type, unop);
2065 return fold_constants((OP *) unop);
2069 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2072 Newz(1101, binop, 1, BINOP);
2075 first = newOP(OP_NULL, 0);
2077 binop->op_type = type;
2078 binop->op_ppaddr = PL_ppaddr[type];
2079 binop->op_first = first;
2080 binop->op_flags = flags | OPf_KIDS;
2083 binop->op_private = 1 | (flags >> 8);
2086 binop->op_private = 2 | (flags >> 8);
2087 first->op_sibling = last;
2090 binop = (BINOP*)CHECKOP(type, binop);
2094 binop->op_last = binop->op_first->op_sibling;
2096 return fold_constants((OP *)binop);
2100 utf8compare(const void *a, const void *b)
2103 for (i = 0; i < 10; i++) {
2104 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2106 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2113 pmtrans(OP *o, OP *expr, OP *repl)
2115 SV *tstr = ((SVOP*)expr)->op_sv;
2116 SV *rstr = ((SVOP*)repl)->op_sv;
2119 register U8 *t = (U8*)SvPV(tstr, tlen);
2120 register U8 *r = (U8*)SvPV(rstr, rlen);
2126 register short *tbl;
2128 complement = o->op_private & OPpTRANS_COMPLEMENT;
2129 del = o->op_private & OPpTRANS_DELETE;
2130 squash = o->op_private & OPpTRANS_SQUASH;
2132 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2133 SV* listsv = newSVpv("# comment\n",0);
2135 U8* tend = t + tlen;
2136 U8* rend = r + rlen;
2152 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2153 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2159 New(1109, cp, tlen, U8*);
2161 transv = newSVpv("",0);
2170 qsort(cp, i, sizeof(U8*), utf8compare);
2171 for (j = 0; j < i; j++) {
2173 UV val = utf8_to_uv(s, &ulen);
2175 diff = val - nextmin;
2177 t = uv_to_utf8(tmpbuf,nextmin);
2178 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2180 t = uv_to_utf8(tmpbuf, val - 1);
2181 sv_catpvn(transv, "\377", 1);
2182 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2186 val = utf8_to_uv(s+1, &ulen);
2190 t = uv_to_utf8(tmpbuf,nextmin);
2191 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2192 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2193 sv_catpvn(transv, "\377", 1);
2194 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2195 t = (U8*)SvPVX(transv);
2196 tlen = SvCUR(transv);
2199 else if (!rlen && !del) {
2200 r = t; rlen = tlen; rend = tend;
2203 if (to_utf && from_utf) { /* only counting characters */
2204 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2205 o->op_private |= OPpTRANS_IDENTICAL;
2207 else { /* straight latin-1 translation */
2208 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2209 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2210 o->op_private |= OPpTRANS_IDENTICAL;
2214 while (t < tend || tfirst <= tlast) {
2215 /* see if we need more "t" chars */
2216 if (tfirst > tlast) {
2217 tfirst = (I32)utf8_to_uv(t, &ulen);
2219 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2220 tlast = (I32)utf8_to_uv(++t, &ulen);
2227 /* now see if we need more "r" chars */
2228 if (rfirst > rlast) {
2230 rfirst = (I32)utf8_to_uv(r, &ulen);
2232 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2233 rlast = (I32)utf8_to_uv(++r, &ulen);
2242 rfirst = rlast = 0xffffffff;
2246 /* now see which range will peter our first, if either. */
2247 tdiff = tlast - tfirst;
2248 rdiff = rlast - rfirst;
2255 if (rfirst == 0xffffffff) {
2256 diff = tdiff; /* oops, pretend rdiff is infinite */
2258 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2260 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2264 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2266 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2268 if (rfirst + diff > max)
2269 max = rfirst + diff;
2274 else if (rfirst <= 0x800)
2275 grows |= (tfirst < 0x80);
2276 else if (rfirst <= 0x10000)
2277 grows |= (tfirst < 0x800);
2278 else if (rfirst <= 0x200000)
2279 grows |= (tfirst < 0x10000);
2280 else if (rfirst <= 0x4000000)
2281 grows |= (tfirst < 0x200000);
2282 else if (rfirst <= 0x80000000)
2283 grows |= (tfirst < 0x4000000);
2295 else if (max > 0xff)
2300 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2301 SvREFCNT_dec(listsv);
2303 SvREFCNT_dec(transv);
2305 if (!del && havefinal)
2306 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2308 if (grows && to_utf)
2309 o->op_private |= OPpTRANS_GROWS;
2316 tbl = (short*)cPVOPo->op_pv;
2318 Zero(tbl, 256, short);
2319 for (i = 0; i < tlen; i++)
2321 for (i = 0, j = 0; i < 256; i++) {
2337 if (!rlen && !del) {
2340 o->op_private |= OPpTRANS_IDENTICAL;
2342 for (i = 0; i < 256; i++)
2344 for (i = 0, j = 0; i < tlen; i++,j++) {
2347 if (tbl[t[i]] == -1)
2353 if (tbl[t[i]] == -1)
2364 newPMOP(I32 type, I32 flags)
2369 Newz(1101, pmop, 1, PMOP);
2370 pmop->op_type = type;
2371 pmop->op_ppaddr = PL_ppaddr[type];
2372 pmop->op_flags = flags;
2373 pmop->op_private = 0 | (flags >> 8);
2375 if (PL_hints & HINT_RE_TAINT)
2376 pmop->op_pmpermflags |= PMf_RETAINT;
2377 if (PL_hints & HINT_LOCALE)
2378 pmop->op_pmpermflags |= PMf_LOCALE;
2379 pmop->op_pmflags = pmop->op_pmpermflags;
2381 /* link into pm list */
2382 if (type != OP_TRANS && PL_curstash) {
2383 pmop->op_pmnext = HvPMROOT(PL_curstash);
2384 HvPMROOT(PL_curstash) = pmop;
2391 pmruntime(OP *o, OP *expr, OP *repl)
2396 I32 repl_has_vars = 0;
2398 if (o->op_type == OP_TRANS)
2399 return pmtrans(o, expr, repl);
2401 PL_hints |= HINT_BLOCK_SCOPE;
2404 if (expr->op_type == OP_CONST) {
2406 SV *pat = ((SVOP*)expr)->op_sv;
2407 char *p = SvPV(pat, plen);
2408 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2409 sv_setpvn(pat, "\\s+", 3);
2410 p = SvPV(pat, plen);
2411 pm->op_pmflags |= PMf_SKIPWHITE;
2413 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2414 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2415 pm->op_pmflags |= PMf_WHITE;
2419 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2420 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2422 : OP_REGCMAYBE),0,expr);
2424 Newz(1101, rcop, 1, LOGOP);
2425 rcop->op_type = OP_REGCOMP;
2426 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2427 rcop->op_first = scalar(expr);
2428 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2429 ? (OPf_SPECIAL | OPf_KIDS)
2431 rcop->op_private = 1;
2434 /* establish postfix order */
2435 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2437 rcop->op_next = expr;
2438 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2441 rcop->op_next = LINKLIST(expr);
2442 expr->op_next = (OP*)rcop;
2445 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2450 if (pm->op_pmflags & PMf_EVAL)
2453 else if (repl->op_type == OP_THREADSV
2454 && strchr("&`'123456789+",
2455 PL_threadsv_names[repl->op_targ]))
2459 #endif /* USE_THREADS */
2460 else if (repl->op_type == OP_CONST)
2464 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2465 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2467 if (curop->op_type == OP_THREADSV) {
2469 if (strchr("&`'123456789+", curop->op_private))
2473 if (curop->op_type == OP_GV) {
2474 GV *gv = ((GVOP*)curop)->op_gv;
2476 if (strchr("&`'123456789+", *GvENAME(gv)))
2479 #endif /* USE_THREADS */
2480 else if (curop->op_type == OP_RV2CV)
2482 else if (curop->op_type == OP_RV2SV ||
2483 curop->op_type == OP_RV2AV ||
2484 curop->op_type == OP_RV2HV ||
2485 curop->op_type == OP_RV2GV) {
2486 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2489 else if (curop->op_type == OP_PADSV ||
2490 curop->op_type == OP_PADAV ||
2491 curop->op_type == OP_PADHV ||
2492 curop->op_type == OP_PADANY) {
2495 else if (curop->op_type == OP_PUSHRE)
2496 ; /* Okay here, dangerous in newASSIGNOP */
2505 && (!pm->op_pmregexp
2506 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2507 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2508 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2509 prepend_elem(o->op_type, scalar(repl), o);
2512 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2513 pm->op_pmflags |= PMf_MAYBE_CONST;
2514 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2516 Newz(1101, rcop, 1, LOGOP);
2517 rcop->op_type = OP_SUBSTCONT;
2518 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2519 rcop->op_first = scalar(repl);
2520 rcop->op_flags |= OPf_KIDS;
2521 rcop->op_private = 1;
2524 /* establish postfix order */
2525 rcop->op_next = LINKLIST(repl);
2526 repl->op_next = (OP*)rcop;
2528 pm->op_pmreplroot = scalar((OP*)rcop);
2529 pm->op_pmreplstart = LINKLIST(rcop);
2538 newSVOP(I32 type, I32 flags, SV *sv)
2541 Newz(1101, svop, 1, SVOP);
2542 svop->op_type = type;
2543 svop->op_ppaddr = PL_ppaddr[type];
2545 svop->op_next = (OP*)svop;
2546 svop->op_flags = flags;
2547 if (PL_opargs[type] & OA_RETSCALAR)
2549 if (PL_opargs[type] & OA_TARGET)
2550 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2551 return CHECKOP(type, svop);
2555 newGVOP(I32 type, I32 flags, GV *gv)
2559 Newz(1101, gvop, 1, GVOP);
2560 gvop->op_type = type;
2561 gvop->op_ppaddr = PL_ppaddr[type];
2562 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2563 gvop->op_next = (OP*)gvop;
2564 gvop->op_flags = flags;
2565 if (PL_opargs[type] & OA_RETSCALAR)
2567 if (PL_opargs[type] & OA_TARGET)
2568 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2569 return CHECKOP(type, gvop);
2573 newPVOP(I32 type, I32 flags, char *pv)
2576 Newz(1101, pvop, 1, PVOP);
2577 pvop->op_type = type;
2578 pvop->op_ppaddr = PL_ppaddr[type];
2580 pvop->op_next = (OP*)pvop;
2581 pvop->op_flags = flags;
2582 if (PL_opargs[type] & OA_RETSCALAR)
2584 if (PL_opargs[type] & OA_TARGET)
2585 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2586 return CHECKOP(type, pvop);
2595 save_hptr(&PL_curstash);
2596 save_item(PL_curstname);
2601 name = SvPV(sv, len);
2602 PL_curstash = gv_stashpvn(name,len,TRUE);
2603 sv_setpvn(PL_curstname, name, len);
2607 sv_setpv(PL_curstname,"<none>");
2608 PL_curstash = Nullhv;
2610 PL_hints |= HINT_BLOCK_SCOPE;
2611 PL_copline = NOLINE;
2616 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2625 if (id->op_type != OP_CONST)
2626 croak("Module name must be constant");
2630 if(version != Nullop) {
2631 SV *vesv = ((SVOP*)version)->op_sv;
2633 if (arg == Nullop && !SvNIOK(vesv)) {
2640 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2641 croak("Version number must be constant number");
2643 /* Make copy of id so we don't free it twice */
2644 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2646 /* Fake up a method call to VERSION */
2647 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2648 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2649 append_elem(OP_LIST,
2650 prepend_elem(OP_LIST, pack, list(version)),
2651 newUNOP(OP_METHOD, 0, meth)));
2655 /* Fake up an import/unimport */
2656 if (arg && arg->op_type == OP_STUB)
2657 imop = arg; /* no import on explicit () */
2658 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2659 imop = Nullop; /* use 5.0; */
2662 /* Make copy of id so we don't free it twice */
2663 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2664 meth = newSVOP(OP_CONST, 0,
2666 ? newSVpv("import", 6)
2667 : newSVpv("unimport", 8)
2669 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2670 append_elem(OP_LIST,
2671 prepend_elem(OP_LIST, pack, list(arg)),
2672 newUNOP(OP_METHOD, 0, meth)));
2675 /* Fake up a require, handle override, if any */
2676 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2677 if (!(gv && GvIMPORTED_CV(gv)))
2678 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2680 if (gv && GvIMPORTED_CV(gv)) {
2681 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2682 append_elem(OP_LIST, id,
2683 scalar(newUNOP(OP_RV2CV, 0,
2688 rqop = newUNOP(OP_REQUIRE, 0, id);
2691 /* Fake up the BEGIN {}, which does its thing immediately. */
2693 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2695 append_elem(OP_LINESEQ,
2696 append_elem(OP_LINESEQ,
2697 newSTATEOP(0, Nullch, rqop),
2698 newSTATEOP(0, Nullch, veop)),
2699 newSTATEOP(0, Nullch, imop) ));
2701 PL_copline = NOLINE;
2711 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2712 if (!(gv && GvIMPORTED_CV(gv)))
2713 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2715 if (gv && GvIMPORTED_CV(gv)) {
2716 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2717 append_elem(OP_LIST, term,
2718 scalar(newUNOP(OP_RV2CV, 0,
2723 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2729 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2731 return newBINOP(OP_LSLICE, flags,
2732 list(force_list(subscript)),
2733 list(force_list(listval)) );
2737 list_assignment(register OP *o)
2742 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2743 o = cUNOPo->op_first;
2745 if (o->op_type == OP_COND_EXPR) {
2746 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2747 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2752 yyerror("Assignment to both a list and a scalar");
2756 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2757 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2758 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2761 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2764 if (o->op_type == OP_RV2SV)
2771 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2776 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2777 return newLOGOP(optype, 0,
2778 mod(scalar(left), optype),
2779 newUNOP(OP_SASSIGN, 0, scalar(right)));
2782 return newBINOP(optype, OPf_STACKED,
2783 mod(scalar(left), optype), scalar(right));
2787 if (list_assignment(left)) {
2790 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2791 left = mod(left, OP_AASSIGN);
2799 o = newBINOP(OP_AASSIGN, flags,
2800 list(force_list(right)),
2801 list(force_list(left)) );
2802 o->op_private = 0 | (flags >> 8);
2803 if (!(left->op_private & OPpLVAL_INTRO)) {
2807 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2808 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2809 if (curop->op_type == OP_GV) {
2810 GV *gv = ((GVOP*)curop)->op_gv;
2811 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2813 SvCUR(gv) = PL_generation;
2815 else if (curop->op_type == OP_PADSV ||
2816 curop->op_type == OP_PADAV ||
2817 curop->op_type == OP_PADHV ||
2818 curop->op_type == OP_PADANY) {
2819 SV **svp = AvARRAY(PL_comppad_name);
2820 SV *sv = svp[curop->op_targ];
2821 if (SvCUR(sv) == PL_generation)
2823 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2825 else if (curop->op_type == OP_RV2CV)
2827 else if (curop->op_type == OP_RV2SV ||
2828 curop->op_type == OP_RV2AV ||
2829 curop->op_type == OP_RV2HV ||
2830 curop->op_type == OP_RV2GV) {
2831 if (lastop->op_type != OP_GV) /* funny deref? */
2834 else if (curop->op_type == OP_PUSHRE) {
2835 if (((PMOP*)curop)->op_pmreplroot) {
2836 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2837 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2839 SvCUR(gv) = PL_generation;
2848 o->op_private = OPpASSIGN_COMMON;
2850 if (right && right->op_type == OP_SPLIT) {
2852 if ((tmpop = ((LISTOP*)right)->op_first) &&
2853 tmpop->op_type == OP_PUSHRE)
2855 PMOP *pm = (PMOP*)tmpop;
2856 if (left->op_type == OP_RV2AV &&
2857 !(left->op_private & OPpLVAL_INTRO) &&
2858 !(o->op_private & OPpASSIGN_COMMON) )
2860 tmpop = ((UNOP*)left)->op_first;
2861 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2862 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2863 pm->op_pmflags |= PMf_ONCE;
2864 tmpop = cUNOPo->op_first; /* to list (nulled) */
2865 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2866 tmpop->op_sibling = Nullop; /* don't free split */
2867 right->op_next = tmpop->op_next; /* fix starting loc */
2868 op_free(o); /* blow off assign */
2869 right->op_flags &= ~OPf_WANT;
2870 /* "I don't know and I don't care." */
2875 if (PL_modcount < 10000 &&
2876 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2878 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2880 sv_setiv(sv, PL_modcount+1);
2888 right = newOP(OP_UNDEF, 0);
2889 if (right->op_type == OP_READLINE) {
2890 right->op_flags |= OPf_STACKED;
2891 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2894 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2895 o = newBINOP(OP_SASSIGN, flags,
2896 scalar(right), mod(scalar(left), OP_SASSIGN) );
2908 newSTATEOP(I32 flags, char *label, OP *o)
2911 U32 seq = intro_my();
2914 Newz(1101, cop, 1, COP);
2915 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2916 cop->op_type = OP_DBSTATE;
2917 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2920 cop->op_type = OP_NEXTSTATE;
2921 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2923 cop->op_flags = flags;
2924 cop->op_private = (PL_hints & HINT_UTF8);
2926 cop->op_private |= NATIVE_HINTS;
2928 PL_compiling.op_private = cop->op_private;
2929 cop->op_next = (OP*)cop;
2932 cop->cop_label = label;
2933 PL_hints |= HINT_BLOCK_SCOPE;
2936 cop->cop_arybase = PL_curcop->cop_arybase;
2937 if (PL_curcop->cop_warnings == WARN_NONE
2938 || PL_curcop->cop_warnings == WARN_ALL)
2939 cop->cop_warnings = PL_curcop->cop_warnings ;
2941 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2944 if (PL_copline == NOLINE)
2945 cop->cop_line = PL_curcop->cop_line;
2947 cop->cop_line = PL_copline;
2948 PL_copline = NOLINE;
2950 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2951 cop->cop_stash = PL_curstash;
2953 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2954 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2955 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2956 (void)SvIOK_on(*svp);
2958 SvSTASH(*svp) = (HV*)cop;
2962 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2965 /* "Introduce" my variables to visible status. */
2973 if (! PL_min_intro_pending)
2974 return PL_cop_seqmax;
2976 svp = AvARRAY(PL_comppad_name);
2977 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2978 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2979 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2980 SvNVX(sv) = (double)PL_cop_seqmax;
2983 PL_min_intro_pending = 0;
2984 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2985 return PL_cop_seqmax++;
2989 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2991 return new_logop(type, flags, &first, &other);
2995 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3000 OP *first = *firstp;
3001 OP *other = *otherp;
3003 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3004 return newBINOP(type, flags, scalar(first), scalar(other));
3006 scalarboolean(first);
3007 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3008 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3009 if (type == OP_AND || type == OP_OR) {
3015 first = *firstp = cUNOPo->op_first;
3017 first->op_next = o->op_next;
3018 cUNOPo->op_first = Nullop;
3022 if (first->op_type == OP_CONST) {
3023 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3024 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3026 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3037 else if (first->op_type == OP_WANTARRAY) {
3043 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3044 OP *k1 = ((UNOP*)first)->op_first;
3045 OP *k2 = k1->op_sibling;
3047 switch (first->op_type)
3050 if (k2 && k2->op_type == OP_READLINE
3051 && (k2->op_flags & OPf_STACKED)
3052 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3053 warnop = k2->op_type;
3057 if (k1->op_type == OP_READDIR
3058 || k1->op_type == OP_GLOB
3059 || k1->op_type == OP_EACH)
3060 warnop = k1->op_type;
3064 line_t oldline = PL_curcop->cop_line;
3065 PL_curcop->cop_line = PL_copline;
3067 "Value of %s%s can be \"0\"; test with defined()",
3069 ((warnop == OP_READLINE || warnop == OP_GLOB)
3070 ? " construct" : "() operator"));
3071 PL_curcop->cop_line = oldline;
3078 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3079 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3081 Newz(1101, logop, 1, LOGOP);
3083 logop->op_type = type;
3084 logop->op_ppaddr = PL_ppaddr[type];
3085 logop->op_first = first;
3086 logop->op_flags = flags | OPf_KIDS;
3087 logop->op_other = LINKLIST(other);
3088 logop->op_private = 1 | (flags >> 8);
3090 /* establish postfix order */
3091 logop->op_next = LINKLIST(first);
3092 first->op_next = (OP*)logop;
3093 first->op_sibling = other;
3095 o = newUNOP(OP_NULL, 0, (OP*)logop);
3102 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3109 return newLOGOP(OP_AND, 0, first, trueop);
3111 return newLOGOP(OP_OR, 0, first, falseop);
3113 scalarboolean(first);
3114 if (first->op_type == OP_CONST) {
3115 if (SvTRUE(((SVOP*)first)->op_sv)) {
3126 else if (first->op_type == OP_WANTARRAY) {
3130 Newz(1101, condop, 1, CONDOP);
3132 condop->op_type = OP_COND_EXPR;
3133 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3134 condop->op_first = first;
3135 condop->op_flags = flags | OPf_KIDS;
3136 condop->op_true = LINKLIST(trueop);
3137 condop->op_false = LINKLIST(falseop);
3138 condop->op_private = 1 | (flags >> 8);
3140 /* establish postfix order */
3141 condop->op_next = LINKLIST(first);
3142 first->op_next = (OP*)condop;
3144 first->op_sibling = trueop;
3145 trueop->op_sibling = falseop;
3146 o = newUNOP(OP_NULL, 0, (OP*)condop);
3148 trueop->op_next = o;
3149 falseop->op_next = o;
3155 newRANGE(I32 flags, OP *left, OP *right)
3163 Newz(1101, condop, 1, CONDOP);
3165 condop->op_type = OP_RANGE;
3166 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3167 condop->op_first = left;
3168 condop->op_flags = OPf_KIDS;
3169 condop->op_true = LINKLIST(left);
3170 condop->op_false = LINKLIST(right);
3171 condop->op_private = 1 | (flags >> 8);
3173 left->op_sibling = right;
3175 condop->op_next = (OP*)condop;
3176 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3177 flop = newUNOP(OP_FLOP, 0, flip);
3178 o = newUNOP(OP_NULL, 0, flop);
3181 left->op_next = flip;
3182 right->op_next = flop;
3184 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3185 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3186 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3187 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3189 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3190 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3193 if (!flip->op_private || !flop->op_private)
3194 linklist(o); /* blow off optimizer unless constant */
3200 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3205 int once = block && block->op_flags & OPf_SPECIAL &&
3206 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3209 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3210 return block; /* do {} while 0 does once */
3211 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3212 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3213 expr = newUNOP(OP_DEFINED, 0,
3214 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3215 } else if (expr->op_flags & OPf_KIDS) {
3216 OP *k1 = ((UNOP*)expr)->op_first;
3217 OP *k2 = (k1) ? k1->op_sibling : NULL;
3218 switch (expr->op_type) {
3220 if (k2 && k2->op_type == OP_READLINE
3221 && (k2->op_flags & OPf_STACKED)
3222 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3223 expr = newUNOP(OP_DEFINED, 0, expr);
3227 if (k1->op_type == OP_READDIR
3228 || k1->op_type == OP_GLOB
3229 || k1->op_type == OP_EACH)
3230 expr = newUNOP(OP_DEFINED, 0, expr);
3236 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3237 o = new_logop(OP_AND, 0, &expr, &listop);
3240 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3242 if (once && o != listop)
3243 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3246 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3248 o->op_flags |= flags;
3250 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3255 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3264 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3265 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3266 expr = newUNOP(OP_DEFINED, 0,
3267 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3268 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3269 OP *k1 = ((UNOP*)expr)->op_first;
3270 OP *k2 = (k1) ? k1->op_sibling : NULL;
3271 switch (expr->op_type) {
3273 if (k2 && k2->op_type == OP_READLINE
3274 && (k2->op_flags & OPf_STACKED)
3275 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3276 expr = newUNOP(OP_DEFINED, 0, expr);
3280 if (k1->op_type == OP_READDIR
3281 || k1->op_type == OP_GLOB
3282 || k1->op_type == OP_EACH)
3283 expr = newUNOP(OP_DEFINED, 0, expr);
3289 block = newOP(OP_NULL, 0);
3292 next = LINKLIST(cont);
3294 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3295 if ((line_t)whileline != NOLINE) {
3296 PL_copline = whileline;
3297 cont = append_elem(OP_LINESEQ, cont,
3298 newSTATEOP(0, Nullch, Nullop));
3302 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3303 redo = LINKLIST(listop);
3306 PL_copline = whileline;
3308 o = new_logop(OP_AND, 0, &expr, &listop);
3309 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3310 op_free(expr); /* oops, it's a while (0) */
3312 return Nullop; /* listop already freed by new_logop */
3315 ((LISTOP*)listop)->op_last->op_next = condop =
3316 (o == listop ? redo : LINKLIST(o));
3324 Newz(1101,loop,1,LOOP);
3325 loop->op_type = OP_ENTERLOOP;
3326 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3327 loop->op_private = 0;
3328 loop->op_next = (OP*)loop;
3331 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3333 loop->op_redoop = redo;
3334 loop->op_lastop = o;
3337 loop->op_nextop = next;
3339 loop->op_nextop = o;
3341 o->op_flags |= flags;
3342 o->op_private |= (flags >> 8);
3347 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3355 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3356 sv->op_type = OP_RV2GV;
3357 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3359 else if (sv->op_type == OP_PADSV) { /* private variable */
3360 padoff = sv->op_targ;
3364 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3365 padoff = sv->op_targ;
3366 iterflags |= OPf_SPECIAL;
3371 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3375 padoff = find_threadsv("_");
3376 iterflags |= OPf_SPECIAL;
3378 sv = newGVOP(OP_GV, 0, PL_defgv);
3381 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3382 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3383 iterflags |= OPf_STACKED;
3385 else if (expr->op_type == OP_NULL &&
3386 (expr->op_flags & OPf_KIDS) &&
3387 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3389 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3390 * set the STACKED flag to indicate that these values are to be
3391 * treated as min/max values by 'pp_iterinit'.
3393 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3394 CONDOP* range = (CONDOP*) flip->op_first;
3395 OP* left = range->op_first;
3396 OP* right = left->op_sibling;
3399 range->op_flags &= ~OPf_KIDS;
3400 range->op_first = Nullop;
3402 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3403 listop->op_first->op_next = range->op_true;
3404 left->op_next = range->op_false;
3405 right->op_next = (OP*)listop;
3406 listop->op_next = listop->op_first;
3409 expr = (OP*)(listop);
3411 iterflags |= OPf_STACKED;
3414 expr = mod(force_list(expr), OP_GREPSTART);
3418 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3419 append_elem(OP_LIST, expr, scalar(sv))));
3420 assert(!loop->op_next);
3421 Renew(loop, 1, LOOP);
3422 loop->op_targ = padoff;
3423 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3424 PL_copline = forline;
3425 return newSTATEOP(0, label, wop);
3429 newLOOPEX(I32 type, OP *label)
3433 if (type != OP_GOTO || label->op_type == OP_CONST) {
3434 /* "last()" means "last" */
3435 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3436 o = newOP(type, OPf_SPECIAL);
3438 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3439 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3445 if (label->op_type == OP_ENTERSUB)
3446 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3447 o = newUNOP(type, OPf_STACKED, label);
3449 PL_hints |= HINT_BLOCK_SCOPE;
3459 MUTEX_DESTROY(CvMUTEXP(cv));
3460 Safefree(CvMUTEXP(cv));
3463 #endif /* USE_THREADS */
3465 if (!CvXSUB(cv) && CvROOT(cv)) {
3467 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3468 croak("Can't undef active subroutine");
3471 croak("Can't undef active subroutine");
3472 #endif /* USE_THREADS */
3475 SAVESPTR(PL_curpad);
3479 op_free(CvROOT(cv));
3480 CvROOT(cv) = Nullop;
3483 SvPOK_off((SV*)cv); /* forget prototype */
3485 SvREFCNT_dec(CvGV(cv));
3487 SvREFCNT_dec(CvOUTSIDE(cv));
3488 CvOUTSIDE(cv) = Nullcv;
3489 if (CvPADLIST(cv)) {
3490 /* may be during global destruction */
3491 if (SvREFCNT(CvPADLIST(cv))) {
3492 I32 i = AvFILLp(CvPADLIST(cv));
3494 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3495 SV* sv = svp ? *svp : Nullsv;
3498 if (sv == (SV*)PL_comppad_name)
3499 PL_comppad_name = Nullav;
3500 else if (sv == (SV*)PL_comppad) {
3501 PL_comppad = Nullav;
3502 PL_curpad = Null(SV**);
3506 SvREFCNT_dec((SV*)CvPADLIST(cv));
3508 CvPADLIST(cv) = Nullav;
3512 #ifdef DEBUG_CLOSURES
3517 CV *outside = CvOUTSIDE(cv);
3518 AV* padlist = CvPADLIST(cv);
3525 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3527 (CvANON(cv) ? "ANON"
3528 : (cv == PL_main_cv) ? "MAIN"
3529 : CvUNIQUE(cv) ? "UNIQUE"
3530 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3533 : CvANON(outside) ? "ANON"
3534 : (outside == PL_main_cv) ? "MAIN"
3535 : CvUNIQUE(outside) ? "UNIQUE"
3536 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3541 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3542 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3543 pname = AvARRAY(pad_name);
3544 ppad = AvARRAY(pad);
3546 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3547 if (SvPOK(pname[ix]))
3548 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3550 SvFAKE(pname[ix]) ? "FAKE " : "",
3552 (long)I_32(SvNVX(pname[ix])),
3553 (long)SvIVX(pname[ix]));
3556 #endif /* DEBUG_CLOSURES */
3559 cv_clone2(CV *proto, CV *outside)
3564 AV* protopadlist = CvPADLIST(proto);
3565 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3566 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3567 SV** pname = AvARRAY(protopad_name);
3568 SV** ppad = AvARRAY(protopad);
3569 I32 fname = AvFILLp(protopad_name);
3570 I32 fpad = AvFILLp(protopad);
3574 assert(!CvUNIQUE(proto));
3577 SAVESPTR(PL_curpad);
3578 SAVESPTR(PL_comppad);
3579 SAVESPTR(PL_comppad_name);
3580 SAVESPTR(PL_compcv);
3582 cv = PL_compcv = (CV*)NEWSV(1104,0);
3583 sv_upgrade((SV *)cv, SvTYPE(proto));
3589 New(666, CvMUTEXP(cv), 1, perl_mutex);
3590 MUTEX_INIT(CvMUTEXP(cv));
3592 #endif /* USE_THREADS */
3593 CvFILEGV(cv) = CvFILEGV(proto);
3594 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3595 CvSTASH(cv) = CvSTASH(proto);
3596 CvROOT(cv) = CvROOT(proto);
3597 CvSTART(cv) = CvSTART(proto);
3599 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3602 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3604 PL_comppad_name = newAV();
3605 for (ix = fname; ix >= 0; ix--)
3606 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3608 PL_comppad = newAV();
3610 comppadlist = newAV();
3611 AvREAL_off(comppadlist);
3612 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3613 av_store(comppadlist, 1, (SV*)PL_comppad);
3614 CvPADLIST(cv) = comppadlist;
3615 av_fill(PL_comppad, AvFILLp(protopad));
3616 PL_curpad = AvARRAY(PL_comppad);
3618 av = newAV(); /* will be @_ */
3620 av_store(PL_comppad, 0, (SV*)av);
3621 AvFLAGS(av) = AVf_REIFY;
3623 for (ix = fpad; ix > 0; ix--) {
3624 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3625 if (namesv && namesv != &PL_sv_undef) {
3626 char *name = SvPVX(namesv); /* XXX */
3627 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3628 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3629 CvOUTSIDE(cv), cxstack_ix, 0);
3631 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3633 croak("panic: cv_clone: %s", name);
3635 else { /* our own lexical */
3638 /* anon code -- we'll come back for it */
3639 sv = SvREFCNT_inc(ppad[ix]);
3641 else if (*name == '@')
3643 else if (*name == '%')
3653 SV* sv = NEWSV(0,0);
3659 /* Now that vars are all in place, clone nested closures. */
3661 for (ix = fpad; ix > 0; ix--) {
3662 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3664 && namesv != &PL_sv_undef
3665 && !(SvFLAGS(namesv) & SVf_FAKE)
3666 && *SvPVX(namesv) == '&'
3667 && CvCLONE(ppad[ix]))
3669 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3670 SvREFCNT_dec(ppad[ix]);
3673 PL_curpad[ix] = (SV*)kid;
3677 #ifdef DEBUG_CLOSURES
3678 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3680 PerlIO_printf(Perl_debug_log, " from:\n");
3682 PerlIO_printf(Perl_debug_log, " to:\n");
3694 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3695 cv = cv_clone2(proto, CvOUTSIDE(proto));
3696 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3701 cv_ckproto(CV *cv, GV *gv, char *p)
3703 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3704 SV* msg = sv_newmortal();
3708 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3709 sv_setpv(msg, "Prototype mismatch:");
3711 sv_catpvf(msg, " sub %_", name);
3713 sv_catpvf(msg, " (%s)", SvPVX(cv));
3714 sv_catpv(msg, " vs ");
3716 sv_catpvf(msg, "(%s)", p);
3718 sv_catpv(msg, "none");
3726 if (!cv || !SvPOK(cv) || SvCUR(cv))
3728 return op_const_sv(CvSTART(cv), cv);
3732 op_const_sv(OP *o, CV *cv)
3739 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3740 o = cLISTOPo->op_first->op_sibling;
3742 for (; o; o = o->op_next) {
3743 OPCODE type = o->op_type;
3745 if(sv && o->op_next == o)
3747 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3749 if (type == OP_LEAVESUB || type == OP_RETURN)
3753 if (type == OP_CONST)
3755 else if (type == OP_PADSV && cv) {
3756 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3757 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3758 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3770 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3773 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3774 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3775 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3776 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3785 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3786 maximum a prototype before. */
3787 if (SvTYPE(gv) > SVt_NULL) {
3788 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3789 warn("Runaway prototype");
3790 cv_ckproto((CV*)gv, NULL, ps);
3793 sv_setpv((SV*)gv, ps);
3795 sv_setiv((SV*)gv, -1);
3796 SvREFCNT_dec(PL_compcv);
3797 cv = PL_compcv = NULL;
3798 PL_sub_generation++;
3802 if (!name || GvCVGEN(gv))
3804 else if (cv = GvCV(gv)) {
3805 cv_ckproto(cv, gv, ps);
3806 /* already defined (or promised)? */
3807 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3809 bool const_changed = TRUE;
3811 /* just a "sub foo;" when &foo is already defined */
3812 SAVEFREESV(PL_compcv);
3815 /* ahem, death to those who redefine active sort subs */
3816 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3817 croak("Can't redefine active sort subroutine %s", name);
3818 if(const_sv = cv_const_sv(cv))
3819 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3820 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3821 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3822 && HvNAME(GvSTASH(CvGV(cv)))
3823 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3825 line_t oldline = PL_curcop->cop_line;
3826 PL_curcop->cop_line = PL_copline;
3827 warner(WARN_REDEFINE,
3828 const_sv ? "Constant subroutine %s redefined"
3829 : "Subroutine %s redefined", name);
3830 PL_curcop->cop_line = oldline;
3836 if (cv) { /* must reuse cv if autoloaded */
3838 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3839 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3840 CvOUTSIDE(PL_compcv) = 0;
3841 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3842 CvPADLIST(PL_compcv) = 0;
3843 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3844 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3845 SvREFCNT_dec(PL_compcv);
3852 PL_sub_generation++;
3855 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3856 CvFILEGV(cv) = PL_curcop->cop_filegv;
3857 CvSTASH(cv) = PL_curstash;
3860 if (!CvMUTEXP(cv)) {
3861 New(666, CvMUTEXP(cv), 1, perl_mutex);
3862 MUTEX_INIT(CvMUTEXP(cv));
3864 #endif /* USE_THREADS */
3867 sv_setpv((SV*)cv, ps);
3869 if (PL_error_count) {
3873 char *s = strrchr(name, ':');
3875 if (strEQ(s, "BEGIN")) {
3877 "BEGIN not safe after errors--compilation aborted";
3881 /* force display of errors found but not reported */
3882 sv_catpv(ERRSV, not_safe);
3883 croak("%s", SvPVx(ERRSV, PL_na));
3890 PL_copline = NOLINE;
3895 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3896 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3899 SV **namep = AvARRAY(PL_comppad_name);
3900 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3903 if (SvIMMORTAL(PL_curpad[ix]))
3906 * The only things that a clonable function needs in its
3907 * pad are references to outer lexicals and anonymous subs.
3908 * The rest are created anew during cloning.
3910 if (!((namesv = namep[ix]) != Nullsv &&
3911 namesv != &PL_sv_undef &&
3913 *SvPVX(namesv) == '&')))
3915 SvREFCNT_dec(PL_curpad[ix]);
3916 PL_curpad[ix] = Nullsv;
3921 AV *av = newAV(); /* Will be @_ */
3923 av_store(PL_comppad, 0, (SV*)av);
3924 AvFLAGS(av) = AVf_REIFY;
3926 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3927 if (SvIMMORTAL(PL_curpad[ix]))
3929 if (!SvPADMY(PL_curpad[ix]))
3930 SvPADTMP_on(PL_curpad[ix]);
3934 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3935 CvSTART(cv) = LINKLIST(CvROOT(cv));
3936 CvROOT(cv)->op_next = 0;
3942 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3943 SV *sv = NEWSV(0,0);
3944 SV *tmpstr = sv_newmortal();
3945 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3949 sv_setpvf(sv, "%_:%ld-%ld",
3950 GvSV(PL_curcop->cop_filegv),
3951 (long)PL_subline, (long)PL_curcop->cop_line);
3952 gv_efullname3(tmpstr, gv, Nullch);
3953 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3954 hv = GvHVn(db_postponed);
3955 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3956 && (cv = GvCV(db_postponed))) {
3961 perl_call_sv((SV*)cv, G_DISCARD);
3965 if ((s = strrchr(name,':')))
3969 if (strEQ(s, "BEGIN")) {
3970 I32 oldscope = PL_scopestack_ix;
3972 SAVESPTR(PL_compiling.cop_filegv);
3973 SAVEI16(PL_compiling.cop_line);
3975 sv_setsv(PL_rs, PL_nrs);
3978 PL_beginav = newAV();
3979 DEBUG_x( dump_sub(gv) );
3980 av_push(PL_beginav, (SV *)cv);
3982 call_list(oldscope, PL_beginav);
3984 PL_curcop = &PL_compiling;
3985 PL_compiling.op_private = PL_hints;
3988 else if (strEQ(s, "END") && !PL_error_count) {
3991 av_unshift(PL_endav, 1);
3992 av_store(PL_endav, 0, (SV *)cv);
3995 else if (strEQ(s, "INIT") && !PL_error_count) {
3997 PL_initav = newAV();
3998 av_push(PL_initav, SvREFCNT_inc(cv));
4004 PL_copline = NOLINE;
4009 /* XXX unsafe for threads if eval_owner isn't held */
4011 newCONSTSUB(HV *stash, char *name, SV *sv)
4014 U32 oldhints = PL_hints;
4015 HV *old_cop_stash = PL_curcop->cop_stash;
4016 HV *old_curstash = PL_curstash;
4017 line_t oldline = PL_curcop->cop_line;
4018 PL_curcop->cop_line = PL_copline;
4020 PL_hints &= ~HINT_BLOCK_SCOPE;
4022 PL_curstash = PL_curcop->cop_stash = stash;
4025 start_subparse(FALSE, 0),
4026 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4027 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4028 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4031 PL_hints = oldhints;
4032 PL_curcop->cop_stash = old_cop_stash;
4033 PL_curstash = old_curstash;
4034 PL_curcop->cop_line = oldline;
4038 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4041 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4044 if (cv = (name ? GvCV(gv) : Nullcv)) {
4046 /* just a cached method */
4050 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4051 /* already defined (or promised) */
4052 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4053 && HvNAME(GvSTASH(CvGV(cv)))
4054 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4055 line_t oldline = PL_curcop->cop_line;
4056 if (PL_copline != NOLINE)
4057 PL_curcop->cop_line = PL_copline;
4058 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4059 PL_curcop->cop_line = oldline;
4066 if (cv) /* must reuse cv if autoloaded */
4069 cv = (CV*)NEWSV(1105,0);
4070 sv_upgrade((SV *)cv, SVt_PVCV);
4074 PL_sub_generation++;
4077 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4079 New(666, CvMUTEXP(cv), 1, perl_mutex);
4080 MUTEX_INIT(CvMUTEXP(cv));
4082 #endif /* USE_THREADS */
4083 CvFILEGV(cv) = gv_fetchfile(filename);
4084 CvXSUB(cv) = subaddr;
4087 char *s = strrchr(name,':');
4092 if (strEQ(s, "BEGIN")) {
4094 PL_beginav = newAV();
4095 av_push(PL_beginav, (SV *)cv);
4098 else if (strEQ(s, "END")) {
4101 av_unshift(PL_endav, 1);
4102 av_store(PL_endav, 0, (SV *)cv);
4105 else if (strEQ(s, "INIT")) {
4107 PL_initav = newAV();
4108 av_push(PL_initav, (SV *)cv);
4119 newFORM(I32 floor, OP *o, OP *block)
4128 name = SvPVx(cSVOPo->op_sv, PL_na);
4131 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4133 if (cv = GvFORM(gv)) {
4134 if (ckWARN(WARN_REDEFINE)) {
4135 line_t oldline = PL_curcop->cop_line;
4137 PL_curcop->cop_line = PL_copline;
4138 warner(WARN_REDEFINE, "Format %s redefined",name);
4139 PL_curcop->cop_line = oldline;
4145 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4146 CvFILEGV(cv) = PL_curcop->cop_filegv;
4148 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4149 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4150 SvPADTMP_on(PL_curpad[ix]);
4153 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4154 CvSTART(cv) = LINKLIST(CvROOT(cv));
4155 CvROOT(cv)->op_next = 0;
4158 PL_copline = NOLINE;
4165 return newUNOP(OP_REFGEN, 0,
4166 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4172 return newUNOP(OP_REFGEN, 0,
4173 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4177 newANONSUB(I32 floor, OP *proto, OP *block)
4179 return newUNOP(OP_REFGEN, 0,
4180 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4186 switch (o->op_type) {
4188 o->op_type = OP_PADAV;
4189 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4190 return ref(o, OP_RV2AV);
4193 o->op_type = OP_RV2AV;
4194 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4199 warn("oops: oopsAV");
4208 switch (o->op_type) {
4211 o->op_type = OP_PADHV;
4212 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4213 return ref(o, OP_RV2HV);
4217 o->op_type = OP_RV2HV;
4218 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4223 warn("oops: oopsHV");
4232 if (o->op_type == OP_PADANY) {
4233 o->op_type = OP_PADAV;
4234 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4237 return newUNOP(OP_RV2AV, 0, scalar(o));
4241 newGVREF(I32 type, OP *o)
4243 if (type == OP_MAPSTART)
4244 return newUNOP(OP_NULL, 0, o);
4245 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4251 if (o->op_type == OP_PADANY) {
4252 o->op_type = OP_PADHV;
4253 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4256 return newUNOP(OP_RV2HV, 0, scalar(o));
4262 croak("NOT IMPL LINE %d",__LINE__);
4268 newCVREF(I32 flags, OP *o)
4270 return newUNOP(OP_RV2CV, flags, scalar(o));
4276 if (o->op_type == OP_PADANY) {
4277 o->op_type = OP_PADSV;
4278 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4281 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4282 o->op_flags |= OPpDONE_SVREF;
4285 return newUNOP(OP_RV2SV, 0, scalar(o));
4288 /* Check routines. */
4296 name = NEWSV(1106,0);
4297 sv_upgrade(name, SVt_PVNV);
4298 sv_setpvn(name, "&", 1);
4301 ix = pad_alloc(o->op_type, SVs_PADMY);
4302 av_store(PL_comppad_name, ix, name);
4303 av_store(PL_comppad, ix, cSVOPo->op_sv);
4304 SvPADMY_on(cSVOPo->op_sv);
4305 cSVOPo->op_sv = Nullsv;
4306 cSVOPo->op_targ = ix;
4313 o->op_private = PL_hints;
4320 if (cUNOPo->op_first->op_type == OP_CONCAT)
4321 o->op_flags |= OPf_STACKED;
4328 if (o->op_flags & OPf_KIDS) {
4331 OPCODE type = o->op_type;
4332 o = modkids(ck_fun(o), type);
4333 kid = cUNOPo->op_first;
4334 newop = kUNOP->op_first->op_sibling;
4336 (newop->op_sibling ||
4337 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4338 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4339 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4343 op_free(kUNOP->op_first);
4344 kUNOP->op_first = newop;
4346 o->op_ppaddr = PL_ppaddr[++o->op_type];
4355 if (o->op_flags & OPf_KIDS) {
4356 OP *kid = cUNOPo->op_first;
4357 if (kid->op_type == OP_HSLICE)
4358 o->op_private |= OPpSLICE;
4359 else if (kid->op_type != OP_HELEM)
4360 croak("%s argument is not a HASH element or slice",
4361 PL_op_desc[o->op_type]);
4370 I32 type = o->op_type;
4372 if (o->op_flags & OPf_KIDS) {
4373 if (cLISTOPo->op_first->op_type == OP_STUB) {
4375 o = newUNOP(type, OPf_SPECIAL,
4376 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4386 PL_hints |= HINT_BLOCK_SCOPE;
4387 if (o->op_flags & OPf_KIDS) {
4388 SVOP *kid = (SVOP*)cUNOPo->op_first;
4391 o->op_flags &= ~OPf_KIDS;
4394 else if (kid->op_type == OP_LINESEQ) {
4397 kid->op_next = o->op_next;
4398 cUNOPo->op_first = 0;
4401 Newz(1101, enter, 1, LOGOP);
4402 enter->op_type = OP_ENTERTRY;
4403 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4404 enter->op_private = 0;
4406 /* establish postfix order */
4407 enter->op_next = (OP*)enter;
4409 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4410 o->op_type = OP_LEAVETRY;
4411 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4412 enter->op_other = o;
4420 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4422 o->op_targ = (PADOFFSET)PL_hints;
4430 if (o->op_flags & OPf_STACKED) {
4432 kid = cUNOPo->op_first->op_sibling;
4433 if (kid->op_type == OP_RV2GV)
4445 if (o->op_flags & OPf_KIDS) {
4446 OP *kid = cUNOPo->op_first;
4447 if (kid->op_type != OP_HELEM)
4448 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4456 ck_gvconst(register OP *o)
4458 o = fold_constants(o);
4459 if (o->op_type == OP_CONST)
4466 ck_rvconst(register OP *o)
4469 SVOP *kid = (SVOP*)cUNOPo->op_first;
4471 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4472 if (kid->op_type == OP_CONST) {
4476 SV *kidsv = kid->op_sv;
4478 /* Is it a constant from cv_const_sv()? */
4479 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4480 SV *rsv = SvRV(kidsv);
4481 int svtype = SvTYPE(rsv);
4482 char *badtype = Nullch;
4484 switch (o->op_type) {
4486 if (svtype > SVt_PVMG)
4487 badtype = "a SCALAR";
4490 if (svtype != SVt_PVAV)
4491 badtype = "an ARRAY";
4494 if (svtype != SVt_PVHV) {
4495 if (svtype == SVt_PVAV) { /* pseudohash? */
4496 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4497 if (ksv && SvROK(*ksv)
4498 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4507 if (svtype != SVt_PVCV)
4512 croak("Constant is not %s reference", badtype);
4515 name = SvPV(kidsv, PL_na);
4516 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4517 char *badthing = Nullch;
4518 switch (o->op_type) {
4520 badthing = "a SCALAR";
4523 badthing = "an ARRAY";
4526 badthing = "a HASH";
4531 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4535 * This is a little tricky. We only want to add the symbol if we
4536 * didn't add it in the lexer. Otherwise we get duplicate strict
4537 * warnings. But if we didn't add it in the lexer, we must at
4538 * least pretend like we wanted to add it even if it existed before,
4539 * or we get possible typo warnings. OPpCONST_ENTERED says
4540 * whether the lexer already added THIS instance of this symbol.
4542 iscv = (o->op_type == OP_RV2CV) * 2;
4544 gv = gv_fetchpv(name,
4545 iscv | !(kid->op_private & OPpCONST_ENTERED),
4548 : o->op_type == OP_RV2SV
4550 : o->op_type == OP_RV2AV
4552 : o->op_type == OP_RV2HV
4555 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4557 kid->op_type = OP_GV;
4558 SvREFCNT_dec(kid->op_sv);
4559 kid->op_sv = SvREFCNT_inc(gv);
4569 I32 type = o->op_type;
4571 if (o->op_flags & OPf_REF)
4574 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4575 SVOP *kid = (SVOP*)cUNOPo->op_first;
4577 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4578 OP *newop = newGVOP(type, OPf_REF,
4579 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4586 if (type == OP_FTTTY)
4587 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4590 return newUNOP(type, 0, newDEFSVOP());
4603 int type = o->op_type;
4604 register I32 oa = PL_opargs[type] >> OASHIFT;
4606 if (o->op_flags & OPf_STACKED) {
4607 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4610 return no_fh_allowed(o);
4613 if (o->op_flags & OPf_KIDS) {
4614 tokid = &cLISTOPo->op_first;
4615 kid = cLISTOPo->op_first;
4616 if (kid->op_type == OP_PUSHMARK ||
4617 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4619 tokid = &kid->op_sibling;
4620 kid = kid->op_sibling;
4622 if (!kid && PL_opargs[type] & OA_DEFGV)
4623 *tokid = kid = newDEFSVOP();
4627 sibl = kid->op_sibling;
4641 if (kid->op_type == OP_CONST &&
4642 (kid->op_private & OPpCONST_BARE)) {
4643 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4644 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4645 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4646 if (ckWARN(WARN_SYNTAX))
4648 "Array @%s missing the @ in argument %ld of %s()",
4649 name, (long)numargs, PL_op_desc[type]);
4652 kid->op_sibling = sibl;
4655 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4656 bad_type(numargs, "array", PL_op_desc[o->op_type], kid);
4660 if (kid->op_type == OP_CONST &&
4661 (kid->op_private & OPpCONST_BARE)) {
4662 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4663 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4664 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4665 if (ckWARN(WARN_SYNTAX))
4667 "Hash %%%s missing the %% in argument %ld of %s()",
4668 name, (long)numargs, PL_op_desc[type]);
4671 kid->op_sibling = sibl;
4674 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4675 bad_type(numargs, "hash", PL_op_desc[o->op_type], kid);
4680 OP *newop = newUNOP(OP_NULL, 0, kid);
4681 kid->op_sibling = 0;
4683 newop->op_next = newop;
4685 kid->op_sibling = sibl;
4690 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4691 if (kid->op_type == OP_CONST &&
4692 (kid->op_private & OPpCONST_BARE)) {
4693 OP *newop = newGVOP(OP_GV, 0,
4694 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4699 else if (kid->op_type == OP_READLINE) {
4700 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4701 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4704 kid->op_sibling = 0;
4705 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4707 kid->op_sibling = sibl;
4713 mod(scalar(kid), type);
4717 tokid = &kid->op_sibling;
4718 kid = kid->op_sibling;
4720 o->op_private |= numargs;
4722 return too_many_arguments(o,PL_op_desc[o->op_type]);
4725 else if (PL_opargs[type] & OA_DEFGV) {
4727 return newUNOP(type, 0, newDEFSVOP());
4731 while (oa & OA_OPTIONAL)
4733 if (oa && oa != OA_LIST)
4734 return too_few_arguments(o,PL_op_desc[o->op_type]);
4744 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4745 append_elem(OP_GLOB, o, newDEFSVOP());
4747 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4748 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4750 if (gv && GvIMPORTED_CV(gv)) {
4751 static int glob_index;
4753 append_elem(OP_GLOB, o,
4754 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4755 o->op_type = OP_LIST;
4756 o->op_ppaddr = PL_ppaddr[OP_LIST];
4757 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4758 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4759 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4760 append_elem(OP_LIST, o,
4761 scalar(newUNOP(OP_RV2CV, 0,
4762 newGVOP(OP_GV, 0, gv)))));
4763 o = newUNOP(OP_NULL, 0, ck_subr(o));
4764 o->op_targ = OP_GLOB; /* hint at what it used to be */
4767 gv = newGVgen("main");
4769 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4779 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4781 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4782 Newz(1101, gwop, 1, LOGOP);
4784 if (o->op_flags & OPf_STACKED) {
4787 kid = cLISTOPo->op_first->op_sibling;
4788 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4791 kid->op_next = (OP*)gwop;
4792 o->op_flags &= ~OPf_STACKED;
4794 kid = cLISTOPo->op_first->op_sibling;
4795 if (type == OP_MAPWHILE)
4802 kid = cLISTOPo->op_first->op_sibling;
4803 if (kid->op_type != OP_NULL)
4804 croak("panic: ck_grep");
4805 kid = kUNOP->op_first;
4807 gwop->op_type = type;
4808 gwop->op_ppaddr = PL_ppaddr[type];
4809 gwop->op_first = listkids(o);
4810 gwop->op_flags |= OPf_KIDS;
4811 gwop->op_private = 1;
4812 gwop->op_other = LINKLIST(kid);
4813 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4814 kid->op_next = (OP*)gwop;
4816 kid = cLISTOPo->op_first->op_sibling;
4817 if (!kid || !kid->op_sibling)
4818 return too_few_arguments(o,PL_op_desc[o->op_type]);
4819 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4820 mod(kid, OP_GREPSTART);
4828 if (o->op_flags & OPf_KIDS) {
4829 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4831 kid = kid->op_sibling; /* get past "big" */
4832 if (kid && kid->op_type == OP_CONST)
4833 fbm_compile(((SVOP*)kid)->op_sv, 0);
4839 ck_lengthconst(OP *o)
4841 /* XXX length optimization goes here */
4848 OPCODE type = o->op_type;
4849 return modkids(ck_fun(o), type);
4855 OPCODE type = o->op_type;
4856 return refkids(ck_fun(o), type);
4864 kid = cLISTOPo->op_first;
4867 kid = cLISTOPo->op_first;
4869 if (kid->op_type == OP_PUSHMARK)
4870 kid = kid->op_sibling;
4871 if (kid && o->op_flags & OPf_STACKED)
4872 kid = kid->op_sibling;
4873 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4874 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4875 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4876 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4877 cLISTOPo->op_first->op_sibling = kid;
4878 cLISTOPo->op_last = kid;
4879 kid = kid->op_sibling;
4884 append_elem(o->op_type, o, newDEFSVOP());
4890 if (PL_hints & HINT_LOCALE)
4891 o->op_private |= OPpLOCALE;
4898 ck_fun_locale(OP *o)
4904 if (PL_hints & HINT_LOCALE)
4905 o->op_private |= OPpLOCALE;
4916 if (PL_hints & HINT_LOCALE)
4917 o->op_private |= OPpLOCALE;
4926 o->op_private |= OPpRUNTIME;
4939 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4940 o->op_private |= OPpREPEAT_DOLIST;
4941 cBINOPo->op_first = force_list(cBINOPo->op_first);
4951 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4952 SVOP *kid = (SVOP*)cUNOPo->op_first;
4954 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4956 for (s = SvPVX(kid->op_sv); *s; s++) {
4957 if (*s == ':' && s[1] == ':') {
4959 Move(s+2, s+1, strlen(s+2)+1, char);
4960 --SvCUR(kid->op_sv);
4963 sv_catpvn(kid->op_sv, ".pm", 3);
4973 croak("NOT IMPL LINE %d",__LINE__);
4983 if (o->op_flags & OPf_KIDS) {
4984 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4985 if (kid && kid->op_sibling) {
4986 o->op_type = OP_SSELECT;
4987 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
4989 return fold_constants(o);
4993 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4994 if (kid && kid->op_type == OP_RV2GV)
4995 kid->op_private &= ~HINT_STRICT_REFS;
5002 I32 type = o->op_type;
5004 if (!(o->op_flags & OPf_KIDS)) {
5009 if (!CvUNIQUE(PL_compcv)) {
5010 argop = newOP(OP_PADAV, OPf_REF);
5011 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5014 argop = newUNOP(OP_RV2AV, 0,
5015 scalar(newGVOP(OP_GV, 0,
5016 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5019 argop = newUNOP(OP_RV2AV, 0,
5020 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5021 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5022 #endif /* USE_THREADS */
5023 return newUNOP(type, 0, scalar(argop));
5025 return scalar(modkids(ck_fun(o), type));
5033 if (PL_hints & HINT_LOCALE)
5034 o->op_private |= OPpLOCALE;
5037 if (o->op_flags & OPf_STACKED) {
5038 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5040 kid = kUNOP->op_first; /* get past rv2gv */
5042 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5044 if (kid->op_type == OP_SCOPE) {
5048 else if (kid->op_type == OP_LEAVE) {
5049 if (o->op_type == OP_SORT) {
5050 null(kid); /* wipe out leave */
5053 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5054 if (k->op_next == kid)
5059 kid->op_next = 0; /* just disconnect the leave */
5060 k = kLISTOP->op_first;
5064 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5065 null(kid); /* wipe out rv2gv */
5066 if (o->op_type == OP_SORT)
5070 o->op_flags |= OPf_SPECIAL;
5072 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5073 null(cLISTOPo->op_first->op_sibling);
5084 if (o->op_flags & OPf_STACKED)
5085 return no_fh_allowed(o);
5087 kid = cLISTOPo->op_first;
5088 if (kid->op_type != OP_NULL)
5089 croak("panic: ck_split");
5090 kid = kid->op_sibling;
5091 op_free(cLISTOPo->op_first);
5092 cLISTOPo->op_first = kid;
5094 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5095 cLISTOPo->op_last = kid; /* There was only one element previously */
5098 if (kid->op_type != OP_MATCH) {
5099 OP *sibl = kid->op_sibling;
5100 kid->op_sibling = 0;
5101 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5102 if (cLISTOPo->op_first == cLISTOPo->op_last)
5103 cLISTOPo->op_last = kid;
5104 cLISTOPo->op_first = kid;
5105 kid->op_sibling = sibl;
5108 kid->op_type = OP_PUSHRE;
5109 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5112 if (!kid->op_sibling)
5113 append_elem(OP_SPLIT, o, newDEFSVOP());
5115 kid = kid->op_sibling;
5118 if (!kid->op_sibling)
5119 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5121 kid = kid->op_sibling;
5124 if (kid->op_sibling)
5125 return too_many_arguments(o,PL_op_desc[o->op_type]);
5134 OP *prev = ((cUNOPo->op_first->op_sibling)
5135 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5136 OP *o2 = prev->op_sibling;
5144 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5145 if (cvop->op_type == OP_RV2CV) {
5147 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5148 null(cvop); /* disable rv2cv */
5149 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5150 if (tmpop->op_type == OP_GV) {
5151 cv = GvCVu(tmpop->op_sv);
5152 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5153 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5154 proto = SvPV((SV*)cv, PL_na);
5158 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5159 if (PERLDB_SUB && PL_curstash != PL_debstash)
5160 o->op_private |= OPpENTERSUB_DB;
5161 while (o2 != cvop) {
5165 return too_many_arguments(o, gv_ename(namegv));
5183 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5184 bad_type(arg, "block", gv_ename(namegv), o2);
5189 if (o2->op_type == OP_RV2GV)
5193 OP* sib = kid->op_sibling;
5194 kid->op_sibling = 0;
5195 o2 = newUNOP(OP_RV2GV, 0, kid);
5196 o2->op_sibling = sib;
5197 prev->op_sibling = o2;
5205 if (o2->op_type != OP_RV2GV)
5206 bad_type(arg, "symbol", gv_ename(namegv), o2);
5209 if (o2->op_type != OP_RV2CV)
5210 bad_type(arg, "sub", gv_ename(namegv), o2);
5213 if (o2->op_type != OP_RV2SV
5214 && o2->op_type != OP_PADSV
5215 && o2->op_type != OP_THREADSV)
5217 bad_type(arg, "scalar", gv_ename(namegv), o2);
5221 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5222 bad_type(arg, "array", gv_ename(namegv), o2);
5225 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5226 bad_type(arg, "hash", gv_ename(namegv), o2);
5230 OP* sib = kid->op_sibling;
5231 kid->op_sibling = 0;
5232 o2 = newUNOP(OP_REFGEN, 0, kid);
5233 o2->op_sibling = sib;
5234 prev->op_sibling = o2;
5245 croak("Malformed prototype for %s: %s",
5246 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5251 mod(o2, OP_ENTERSUB);
5253 o2 = o2->op_sibling;
5255 if (proto && !optional &&
5256 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5257 return too_few_arguments(o, gv_ename(namegv));
5264 SvREADONLY_on(cSVOPo->op_sv);
5271 if (o->op_flags & OPf_KIDS) {
5272 SVOP *kid = (SVOP*)cUNOPo->op_first;
5274 if (kid->op_type == OP_NULL)
5275 kid = (SVOP*)kid->op_sibling;
5277 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5278 o->op_flags |= OPf_SPECIAL;
5283 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5286 peep(register OP *o)
5289 register OP* oldop = 0;
5290 if (!o || o->op_seq)
5294 SAVESPTR(PL_curcop);
5295 for (; o; o = o->op_next) {
5301 switch (o->op_type) {
5304 PL_curcop = ((COP*)o); /* for warnings */
5305 o->op_seq = PL_op_seqmax++;
5316 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5318 o->op_seq = PL_op_seqmax++;
5321 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5322 o->op_seq = PL_op_seqmax++;
5323 break; /* Scalar stub must produce undef. List stub is noop */
5327 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5328 PL_curcop = ((COP*)o);
5334 if (oldop && o->op_next) {
5335 oldop->op_next = o->op_next;
5338 o->op_seq = PL_op_seqmax++;
5342 if (o->op_next->op_type == OP_RV2SV) {
5343 if (!(o->op_next->op_private & OPpDEREF)) {
5345 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5346 o->op_next = o->op_next->op_next;
5347 o->op_type = OP_GVSV;
5348 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5351 else if (o->op_next->op_type == OP_RV2AV) {
5352 OP* pop = o->op_next->op_next;
5354 if (pop->op_type == OP_CONST &&
5355 (PL_op = pop->op_next) &&
5356 pop->op_next->op_type == OP_AELEM &&
5357 !(pop->op_next->op_private &
5358 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5359 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5363 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5367 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5368 o->op_next = pop->op_next->op_next;
5369 o->op_type = OP_AELEMFAST;
5370 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5371 o->op_private = (U8)i;
5372 GvAVn(((GVOP*)o)->op_gv);
5375 o->op_seq = PL_op_seqmax++;
5382 o->op_seq = PL_op_seqmax++;
5383 while (cLOGOP->op_other->op_type == OP_NULL)
5384 cLOGOP->op_other = cLOGOP->op_other->op_next;
5385 peep(cLOGOP->op_other);
5389 o->op_seq = PL_op_seqmax++;
5390 peep(cCONDOP->op_true);
5391 peep(cCONDOP->op_false);
5395 o->op_seq = PL_op_seqmax++;
5396 peep(cLOOP->op_redoop);
5397 peep(cLOOP->op_nextop);
5398 peep(cLOOP->op_lastop);
5404 o->op_seq = PL_op_seqmax++;
5405 peep(cPMOP->op_pmreplstart);
5409 o->op_seq = PL_op_seqmax++;
5410 if (ckWARN(WARN_SYNTAX) && o->op_next
5411 && o->op_next->op_type == OP_NEXTSTATE) {
5412 if (o->op_next->op_sibling &&
5413 o->op_next->op_sibling->op_type != OP_EXIT &&
5414 o->op_next->op_sibling->op_type != OP_WARN &&
5415 o->op_next->op_sibling->op_type != OP_DIE) {
5416 line_t oldline = PL_curcop->cop_line;
5418 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5419 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5420 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5421 PL_curcop->cop_line = oldline;
5435 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5436 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5438 rop = (UNOP*)((BINOP*)o)->op_first;
5439 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5441 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5442 if (!SvOBJECT(lexname))
5444 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5445 if (!fields || !GvHV(*fields))
5447 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5448 key = SvPV(*svp, keylen);
5449 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5451 croak("No such field \"%s\" in variable %s of type %s",
5452 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5454 ind = SvIV(*indsvp);
5456 croak("Bad index while coercing array into hash");
5457 rop->op_type = OP_RV2AV;
5458 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5459 o->op_type = OP_AELEM;
5460 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5462 *svp = newSViv(ind);
5467 o->op_seq = PL_op_seqmax++;