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->*check
24 #define CHECKCALL *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", 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 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, 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", 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)
123 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
124 if (!isPRINT(name[1])) {
126 name[2] = toCTRL(name[1]);
129 croak("Can't use global %s in \"my\"",name);
131 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
132 SV **svp = AvARRAY(PL_comppad_name);
133 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
135 && sv != &PL_sv_undef
136 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
137 && strEQ(name, SvPVX(sv)))
140 "\"my\" variable %s masks earlier declaration in same %s",
141 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
146 off = pad_alloc(OP_PADSV, SVs_PADMY);
148 sv_upgrade(sv, SVt_PVNV);
150 if (PL_in_my_stash) {
152 croak("Can't declare class for non-scalar %s in \"my\"",name);
154 (void)SvUPGRADE(sv, SVt_PVMG);
155 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
158 av_store(PL_comppad_name, off, sv);
159 SvNVX(sv) = (double)PAD_MAX;
160 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
161 if (!PL_min_intro_pending)
162 PL_min_intro_pending = off;
163 PL_max_intro_pending = off;
165 av_store(PL_comppad, off, (SV*)newAV());
166 else if (*name == '%')
167 av_store(PL_comppad, off, (SV*)newHV());
168 SvPADMY_on(PL_curpad[off]);
173 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
180 register PERL_CONTEXT *cx;
182 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
183 AV *curlist = CvPADLIST(cv);
184 SV **svp = av_fetch(curlist, 0, FALSE);
187 if (!svp || *svp == &PL_sv_undef)
190 svp = AvARRAY(curname);
191 for (off = AvFILLp(curname); off > 0; off--) {
192 if ((sv = svp[off]) &&
193 sv != &PL_sv_undef &&
195 seq > I_32(SvNVX(sv)) &&
196 strEQ(SvPVX(sv), name))
207 return 0; /* don't clone from inactive stack frame */
211 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
212 oldsv = *av_fetch(oldpad, off, TRUE);
213 if (!newoff) { /* Not a mere clone operation. */
214 SV *namesv = NEWSV(1103,0);
215 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
216 sv_upgrade(namesv, SVt_PVNV);
217 sv_setpv(namesv, name);
218 av_store(PL_comppad_name, newoff, namesv);
219 SvNVX(namesv) = (double)PL_curcop->cop_seq;
220 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
221 SvFAKE_on(namesv); /* A ref, not a real var */
222 if (SvOBJECT(sv)) { /* A typed var */
224 (void)SvUPGRADE(namesv, SVt_PVMG);
225 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
228 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
229 /* "It's closures all the way down." */
230 CvCLONE_on(PL_compcv);
232 if (CvANON(PL_compcv))
233 oldsv = Nullsv; /* no need to keep ref */
238 bcv && bcv != cv && !CvCLONE(bcv);
239 bcv = CvOUTSIDE(bcv))
244 if (ckWARN(WARN_CLOSURE)
245 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
248 "Variable \"%s\" may be unavailable",
256 else if (!CvUNIQUE(PL_compcv)) {
257 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
259 "Variable \"%s\" will not stay shared", name);
262 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
268 /* Nothing in current lexical context--try eval's context, if any.
269 * This is necessary to let the perldb get at lexically scoped variables.
270 * XXX This will also probably interact badly with eval tree caching.
273 for (i = cx_ix; i >= 0; i--) {
275 switch (CxTYPE(cx)) {
277 if (i == 0 && saweval) {
278 seq = cxstack[saweval].blk_oldcop->cop_seq;
279 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
283 switch (cx->blk_eval.old_op_type) {
289 /* require must have its own scope */
297 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
298 saweval = i; /* so we know where we were called from */
301 seq = cxstack[saweval].blk_oldcop->cop_seq;
302 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
310 pad_findmy(char *name)
316 SV **svp = AvARRAY(PL_comppad_name);
317 U32 seq = PL_cop_seqmax;
323 * Special case to get lexical (and hence per-thread) @_.
324 * XXX I need to find out how to tell at parse-time whether use
325 * of @_ should refer to a lexical (from a sub) or defgv (global
326 * scope and maybe weird sub-ish things like formats). See
327 * startsub in perly.y. It's possible that @_ could be lexical
328 * (at least from subs) even in non-threaded perl.
330 if (strEQ(name, "@_"))
331 return 0; /* success. (NOT_IN_PAD indicates failure) */
332 #endif /* USE_THREADS */
334 /* The one we're looking for is probably just before comppad_name_fill. */
335 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
336 if ((sv = svp[off]) &&
337 sv != &PL_sv_undef &&
340 seq > I_32(SvNVX(sv)))) &&
341 strEQ(SvPVX(sv), name))
344 return (PADOFFSET)off;
345 pendoff = off; /* this pending def. will override import */
349 outside = CvOUTSIDE(PL_compcv);
351 /* Check if if we're compiling an eval'', and adjust seq to be the
352 * eval's seq number. This depends on eval'' having a non-null
353 * CvOUTSIDE() while it is being compiled. The eval'' itself is
354 * identified by CvUNIQUE being set and CvGV being null. */
355 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
356 cx = &cxstack[cxstack_ix];
358 seq = cx->blk_oldcop->cop_seq;
361 /* See if it's in a nested scope */
362 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
364 /* If there is a pending local definition, this new alias must die */
366 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
367 return off; /* pad_findlex returns 0 for failure...*/
369 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
373 pad_leavemy(I32 fill)
376 SV **svp = AvARRAY(PL_comppad_name);
378 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
379 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
380 if ((sv = svp[off]) && sv != &PL_sv_undef)
381 warn("%s never introduced", SvPVX(sv));
384 /* "Deintroduce" my variables that are leaving with this scope. */
385 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
386 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
387 SvIVX(sv) = PL_cop_seqmax;
392 pad_alloc(I32 optype, U32 tmptype)
398 if (AvARRAY(PL_comppad) != PL_curpad)
399 croak("panic: pad_alloc");
400 if (PL_pad_reset_pending)
402 if (tmptype & SVs_PADMY) {
404 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
405 } while (SvPADBUSY(sv)); /* need a fresh one */
406 retval = AvFILLp(PL_comppad);
409 SV **names = AvARRAY(PL_comppad_name);
410 SSize_t names_fill = AvFILLp(PL_comppad_name);
413 * "foreach" index vars temporarily become aliases to non-"my"
414 * values. Thus we must skip, not just pad values that are
415 * marked as current pad values, but also those with names.
417 if (++PL_padix <= names_fill &&
418 (sv = names[PL_padix]) && sv != &PL_sv_undef)
420 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
421 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
426 SvFLAGS(sv) |= tmptype;
427 PL_curpad = AvARRAY(PL_comppad);
429 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
430 (unsigned long) thr, (unsigned long) PL_curpad,
431 (long) retval, op_name[optype]));
433 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
434 (unsigned long) PL_curpad,
435 (long) retval, op_name[optype]));
436 #endif /* USE_THREADS */
437 return (PADOFFSET)retval;
445 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
446 (unsigned long) thr, (unsigned long) PL_curpad, po));
449 croak("panic: pad_sv po");
450 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
451 (unsigned long) PL_curpad, po));
452 #endif /* USE_THREADS */
453 return PL_curpad[po]; /* eventually we'll turn this into a macro */
457 pad_free(PADOFFSET po)
462 if (AvARRAY(PL_comppad) != PL_curpad)
463 croak("panic: pad_free curpad");
465 croak("panic: pad_free po");
467 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
468 (unsigned long) thr, (unsigned long) PL_curpad, po));
470 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
471 (unsigned long) PL_curpad, po));
472 #endif /* USE_THREADS */
473 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
474 SvPADTMP_off(PL_curpad[po]);
475 if ((I32)po < PL_padix)
480 pad_swipe(PADOFFSET po)
483 if (AvARRAY(PL_comppad) != PL_curpad)
484 croak("panic: pad_swipe curpad");
486 croak("panic: pad_swipe po");
488 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
489 (unsigned long) thr, (unsigned long) PL_curpad, po));
491 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
492 (unsigned long) PL_curpad, po));
493 #endif /* USE_THREADS */
494 SvPADTMP_off(PL_curpad[po]);
495 PL_curpad[po] = NEWSV(1107,0);
496 SvPADTMP_on(PL_curpad[po]);
497 if ((I32)po < PL_padix)
501 /* XXX pad_reset() is currently disabled because it results in serious bugs.
502 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
503 * on the stack by OPs that use them, there are several ways to get an alias
504 * to a shared TARG. Such an alias will change randomly and unpredictably.
505 * We avoid doing this until we can think of a Better Way.
510 #ifdef USE_BROKEN_PAD_RESET
514 if (AvARRAY(PL_comppad) != PL_curpad)
515 croak("panic: pad_reset curpad");
517 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
518 (unsigned long) thr, (unsigned long) PL_curpad));
520 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
521 (unsigned long) PL_curpad));
522 #endif /* USE_THREADS */
523 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
524 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
525 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
526 SvPADTMP_off(PL_curpad[po]);
528 PL_padix = PL_padix_floor;
531 PL_pad_reset_pending = FALSE;
535 /* find_threadsv is not reentrant */
537 find_threadsv(char *name)
543 /* We currently only handle names of a single character */
544 p = strchr(PL_threadsv_names, *name);
547 key = p - PL_threadsv_names;
548 svp = av_fetch(thr->threadsv, key, FALSE);
550 SV *sv = NEWSV(0, 0);
551 av_store(thr->threadsv, key, sv);
552 thr->threadsvp = AvARRAY(thr->threadsv);
554 * Some magic variables used to be automagically initialised
555 * in gv_fetchpv. Those which are now per-thread magicals get
556 * initialised here instead.
562 sv_setpv(sv, "\034");
563 sv_magic(sv, 0, 0, name, 1);
568 PL_sawampersand = TRUE;
572 /* XXX %! tied to Errno.pm needs to be added here.
573 * See gv_fetchpv(). */
577 sv_magic(sv, 0, 0, name, 1);
579 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
580 "find_threadsv: new SV %p for $%s%c\n",
581 sv, (*name < 32) ? "^" : "",
582 (*name < 32) ? toCTRL(*name) : *name));
586 #endif /* USE_THREADS */
593 register OP *kid, *nextkid;
595 if (!o || o->op_seq == (U16)-1)
598 if (o->op_flags & OPf_KIDS) {
599 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
600 nextkid = kid->op_sibling; /* Get before next freeing kid */
605 switch (o->op_type) {
607 o->op_targ = 0; /* Was holding old type, if any. */
610 o->op_targ = 0; /* Was holding hints. */
614 if (!(o->op_flags & OPf_SPECIAL))
618 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
620 #endif /* USE_THREADS */
622 if (!(o->op_flags & OPf_REF)
623 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
629 SvREFCNT_dec(cGVOPo->op_gv);
633 Safefree(cCOPo->cop_label);
634 SvREFCNT_dec(cCOPo->cop_filegv);
635 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
636 SvREFCNT_dec(cCOPo->cop_warnings);
639 SvREFCNT_dec(cSVOPo->op_sv);
645 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
649 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
650 SvREFCNT_dec(cSVOPo->op_sv);
652 Safefree(cPVOPo->op_pv);
655 op_free(cPMOPo->op_pmreplroot);
660 ReREFCNT_dec(cPMOPo->op_pmregexp);
665 pad_free(o->op_targ);
673 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
674 pad_free(o->op_targ);
675 o->op_targ = o->op_type;
676 o->op_type = OP_NULL;
677 o->op_ppaddr = ppaddr[OP_NULL];
680 /* Contextualizers */
682 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
692 /* establish postfix order */
693 if (cUNOPo->op_first) {
694 o->op_next = LINKLIST(cUNOPo->op_first);
695 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
697 kid->op_next = LINKLIST(kid->op_sibling);
712 if (o && o->op_flags & OPf_KIDS) {
713 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
722 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
724 if (ckWARN(WARN_SYNTAX)) {
725 line_t oldline = PL_curcop->cop_line;
727 if (PL_copline != NOLINE)
728 PL_curcop->cop_line = PL_copline;
729 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
730 PL_curcop->cop_line = oldline;
741 /* assumes no premature commitment */
742 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
743 || o->op_type == OP_RETURN)
746 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
748 switch (o->op_type) {
750 if (o->op_private & OPpREPEAT_DOLIST)
751 null(((LISTOP*)cBINOPo->op_first)->op_first);
752 scalar(cBINOPo->op_first);
757 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
761 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
762 if (!kPMOP->op_pmreplroot)
763 deprecate("implicit split to @_");
771 if (o->op_flags & OPf_KIDS) {
772 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
778 kid = cLISTOPo->op_first;
780 while (kid = kid->op_sibling) {
786 WITH_THR(PL_curcop = &PL_compiling);
791 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
797 WITH_THR(PL_curcop = &PL_compiling);
810 /* assumes no premature commitment */
811 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
812 || o->op_type == OP_RETURN)
815 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
817 switch (o->op_type) {
819 if (!(opargs[o->op_type] & OA_FOLDCONST))
823 if (o->op_flags & OPf_STACKED)
827 if (o->op_private == 4)
898 if (!(o->op_private & OPpLVAL_INTRO))
899 useless = op_desc[o->op_type];
906 if (!(o->op_private & OPpLVAL_INTRO) &&
907 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
908 useless = "a variable";
913 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
920 if (ckWARN(WARN_VOID)) {
921 useless = "a constant";
922 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
924 else if (SvPOK(sv)) {
925 if (strnEQ(SvPVX(sv), "di", 2) ||
926 strnEQ(SvPVX(sv), "ds", 2) ||
927 strnEQ(SvPVX(sv), "ig", 2))
932 null(o); /* don't execute a constant */
933 SvREFCNT_dec(sv); /* don't even remember it */
937 o->op_type = OP_PREINC; /* pre-increment is faster */
938 o->op_ppaddr = ppaddr[OP_PREINC];
942 o->op_type = OP_PREDEC; /* pre-decrement is faster */
943 o->op_ppaddr = ppaddr[OP_PREDEC];
949 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
954 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
955 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
956 if (o->op_flags & OPf_STACKED)
962 if (!(o->op_flags & OPf_KIDS))
971 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
978 /* all requires must return a boolean value */
979 o->op_flags &= ~OPf_WANT;
982 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
983 if (!kPMOP->op_pmreplroot)
984 deprecate("implicit split to @_");
990 if (ckWARN(WARN_VOID))
991 warner(WARN_VOID, "Useless use of %s in void context", useless);
1000 if (o && o->op_flags & OPf_KIDS) {
1001 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1012 /* assumes no premature commitment */
1013 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1014 || o->op_type == OP_RETURN)
1017 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1019 switch (o->op_type) {
1022 list(cBINOPo->op_first);
1027 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1035 if (!(o->op_flags & OPf_KIDS))
1037 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1038 list(cBINOPo->op_first);
1039 return gen_constant_list(o);
1046 kid = cLISTOPo->op_first;
1048 while (kid = kid->op_sibling) {
1049 if (kid->op_sibling)
1054 WITH_THR(PL_curcop = &PL_compiling);
1058 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1059 if (kid->op_sibling)
1064 WITH_THR(PL_curcop = &PL_compiling);
1067 /* all requires must return a boolean value */
1068 o->op_flags &= ~OPf_WANT;
1080 if (o->op_type == OP_LINESEQ ||
1081 o->op_type == OP_SCOPE ||
1082 o->op_type == OP_LEAVE ||
1083 o->op_type == OP_LEAVETRY)
1086 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1087 if (kid->op_sibling) {
1091 PL_curcop = &PL_compiling;
1093 o->op_flags &= ~OPf_PARENS;
1094 if (PL_hints & HINT_BLOCK_SCOPE)
1095 o->op_flags |= OPf_PARENS;
1098 o = newOP(OP_STUB, 0);
1103 modkids(OP *o, I32 type)
1106 if (o && o->op_flags & OPf_KIDS) {
1107 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1114 mod(OP *o, I32 type)
1120 if (!o || PL_error_count)
1123 switch (o->op_type) {
1128 if (!(o->op_private & (OPpCONST_ARYBASE)))
1130 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1131 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1135 SAVEI32(PL_compiling.cop_arybase);
1136 PL_compiling.cop_arybase = 0;
1138 else if (type == OP_REFGEN)
1141 croak("That use of $[ is unsupported");
1144 if (o->op_flags & OPf_PARENS)
1148 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1149 !(o->op_flags & OPf_STACKED)) {
1150 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1151 o->op_ppaddr = ppaddr[OP_RV2CV];
1152 assert(cUNOPo->op_first->op_type == OP_NULL);
1153 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1159 /* grep, foreach, subcalls, refgen */
1160 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1162 yyerror(form("Can't modify %s in %s",
1163 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1164 ? "do block" : op_desc[o->op_type]),
1165 type ? op_desc[type] : "local"));
1179 case OP_RIGHT_SHIFT:
1188 if (!(o->op_flags & OPf_STACKED))
1194 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1200 if (!type && cUNOPo->op_first->op_type != OP_GV)
1201 croak("Can't localize through a reference");
1202 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1203 PL_modcount = 10000;
1204 return o; /* Treat \(@foo) like ordinary list. */
1208 if (scalar_mod_type(o, type))
1210 ref(cUNOPo->op_first, o->op_type);
1219 PL_modcount = 10000;
1222 if (!type && cUNOPo->op_first->op_type != OP_GV)
1223 croak("Can't localize through a reference");
1224 ref(cUNOPo->op_first, o->op_type);
1228 PL_hints |= HINT_BLOCK_SCOPE;
1236 PL_modcount = 10000;
1237 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1238 return o; /* Treat \(@foo) like ordinary list. */
1239 if (scalar_mod_type(o, type))
1245 croak("Can't localize lexical variable %s",
1246 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1251 PL_modcount++; /* XXX ??? */
1253 #endif /* USE_THREADS */
1259 if (type != OP_SASSIGN)
1263 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1269 pad_free(o->op_targ);
1270 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1271 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1272 if (o->op_flags & OPf_KIDS)
1273 mod(cBINOPo->op_first->op_sibling, type);
1278 ref(cBINOPo->op_first, o->op_type);
1279 if (type == OP_ENTERSUB &&
1280 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1281 o->op_private |= OPpLVAL_DEFER;
1288 if (o->op_flags & OPf_KIDS)
1289 mod(cLISTOPo->op_last, type);
1293 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1295 else if (!(o->op_flags & OPf_KIDS))
1297 if (o->op_targ != OP_LIST) {
1298 mod(cBINOPo->op_first, type);
1303 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1307 o->op_flags |= OPf_MOD;
1309 if (type == OP_AASSIGN || type == OP_SASSIGN)
1310 o->op_flags |= OPf_SPECIAL|OPf_REF;
1312 o->op_private |= OPpLVAL_INTRO;
1313 o->op_flags &= ~OPf_SPECIAL;
1314 PL_hints |= HINT_BLOCK_SCOPE;
1316 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1317 o->op_flags |= OPf_REF;
1322 scalar_mod_type(OP *o, I32 type)
1326 if (o->op_type == OP_RV2GV)
1350 case OP_RIGHT_SHIFT:
1360 case OP_ANDASSIGN: /* may work later */
1361 case OP_ORASSIGN: /* may work later */
1369 refkids(OP *o, I32 type)
1372 if (o && o->op_flags & OPf_KIDS) {
1373 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1380 ref(OP *o, I32 type)
1384 if (!o || PL_error_count)
1387 switch (o->op_type) {
1389 if ((type == OP_DEFINED || type == OP_LOCK) &&
1390 !(o->op_flags & OPf_STACKED)) {
1391 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1392 o->op_ppaddr = ppaddr[OP_RV2CV];
1393 assert(cUNOPo->op_first->op_type == OP_NULL);
1394 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1395 o->op_flags |= OPf_SPECIAL;
1400 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1404 ref(cUNOPo->op_first, o->op_type);
1407 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1408 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1409 : type == OP_RV2HV ? OPpDEREF_HV
1411 o->op_flags |= OPf_MOD;
1416 o->op_flags |= OPf_MOD; /* XXX ??? */
1421 o->op_flags |= OPf_REF;
1424 ref(cUNOPo->op_first, o->op_type);
1429 o->op_flags |= OPf_REF;
1434 if (!(o->op_flags & OPf_KIDS))
1436 ref(cBINOPo->op_first, type);
1440 ref(cBINOPo->op_first, o->op_type);
1441 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1442 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1443 : type == OP_RV2HV ? OPpDEREF_HV
1445 o->op_flags |= OPf_MOD;
1453 if (!(o->op_flags & OPf_KIDS))
1455 ref(cLISTOPo->op_last, type);
1470 if (!o || PL_error_count)
1474 if (type == OP_LIST) {
1475 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1477 } else if (type == OP_UNDEF) {
1479 } else if (type != OP_PADSV &&
1482 type != OP_PUSHMARK)
1484 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1487 o->op_flags |= OPf_MOD;
1488 o->op_private |= OPpLVAL_INTRO;
1496 o->op_flags |= OPf_PARENS;
1501 bind_match(I32 type, OP *left, OP *right)
1506 if (ckWARN(WARN_UNSAFE) &&
1507 (left->op_type == OP_RV2AV ||
1508 left->op_type == OP_RV2HV ||
1509 left->op_type == OP_PADAV ||
1510 left->op_type == OP_PADHV)) {
1511 char *desc = op_desc[(right->op_type == OP_SUBST ||
1512 right->op_type == OP_TRANS)
1513 ? right->op_type : OP_MATCH];
1514 char *sample = ((left->op_type == OP_RV2AV ||
1515 left->op_type == OP_PADAV)
1516 ? "@array" : "%hash");
1518 "Applying %s to %s will act on scalar(%s)",
1519 desc, sample, sample);
1522 if (right->op_type == OP_MATCH ||
1523 right->op_type == OP_SUBST ||
1524 right->op_type == OP_TRANS) {
1525 right->op_flags |= OPf_STACKED;
1526 if (right->op_type != OP_MATCH)
1527 left = mod(left, right->op_type);
1528 if (right->op_type == OP_TRANS)
1529 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1531 o = prepend_elem(right->op_type, scalar(left), right);
1533 return newUNOP(OP_NOT, 0, scalar(o));
1537 return bind_match(type, left,
1538 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1546 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1547 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1554 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1555 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1556 o->op_type = OP_LEAVE;
1557 o->op_ppaddr = ppaddr[OP_LEAVE];
1560 if (o->op_type == OP_LINESEQ) {
1562 o->op_type = OP_SCOPE;
1563 o->op_ppaddr = ppaddr[OP_SCOPE];
1564 kid = ((LISTOP*)o)->op_first;
1565 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1566 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1571 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1581 SAVESPTR(GvHV(PL_hintgv));
1582 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1583 SAVEFREESV(GvHV(PL_hintgv));
1587 block_start(int full)
1590 int retval = PL_savestack_ix;
1592 SAVEI32(PL_comppad_name_floor);
1594 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1595 PL_comppad_name_floor = PL_comppad_name_fill;
1597 PL_comppad_name_floor = 0;
1599 SAVEI32(PL_min_intro_pending);
1600 SAVEI32(PL_max_intro_pending);
1601 PL_min_intro_pending = 0;
1602 SAVEI32(PL_comppad_name_fill);
1603 SAVEI32(PL_padix_floor);
1604 PL_padix_floor = PL_padix;
1605 PL_pad_reset_pending = FALSE;
1607 PL_hints &= ~HINT_BLOCK_SCOPE;
1608 SAVEPPTR(PL_compiling.cop_warnings);
1609 if (PL_compiling.cop_warnings != WARN_ALL &&
1610 PL_compiling.cop_warnings != WARN_NONE) {
1611 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1612 SAVEFREESV(PL_compiling.cop_warnings) ;
1620 block_end(I32 floor, OP *seq)
1623 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1624 OP* retval = scalarseq(seq);
1626 PL_pad_reset_pending = FALSE;
1627 PL_compiling.op_private = PL_hints;
1629 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1630 pad_leavemy(PL_comppad_name_fill);
1639 OP *o = newOP(OP_THREADSV, 0);
1640 o->op_targ = find_threadsv("_");
1643 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1644 #endif /* USE_THREADS */
1652 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1653 PL_eval_start = linklist(PL_eval_root);
1654 PL_eval_root->op_next = 0;
1655 peep(PL_eval_start);
1660 PL_main_root = scope(sawparens(scalarvoid(o)));
1661 PL_curcop = &PL_compiling;
1662 PL_main_start = LINKLIST(PL_main_root);
1663 PL_main_root->op_next = 0;
1664 peep(PL_main_start);
1667 /* Register with debugger */
1669 CV *cv = perl_get_cv("DB::postponed", FALSE);
1673 XPUSHs((SV*)PL_compiling.cop_filegv);
1675 perl_call_sv((SV*)cv, G_DISCARD);
1682 localize(OP *o, I32 lex)
1684 if (o->op_flags & OPf_PARENS)
1688 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1690 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1691 if (*s == ';' || *s == '=')
1692 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1693 lex ? "my" : "local");
1697 PL_in_my_stash = Nullhv;
1701 return mod(o, OP_NULL); /* a bit kludgey */
1707 if (o->op_type == OP_LIST) {
1710 o2 = newOP(OP_THREADSV, 0);
1711 o2->op_targ = find_threadsv(";");
1713 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1714 #endif /* USE_THREADS */
1715 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1721 fold_constants(register OP *o)
1725 I32 type = o->op_type;
1728 if (opargs[type] & OA_RETSCALAR)
1730 if (opargs[type] & OA_TARGET)
1731 o->op_targ = pad_alloc(type, SVs_PADTMP);
1733 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1734 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1736 if (!(opargs[type] & OA_FOLDCONST))
1751 if (o->op_private & OPpLOCALE)
1756 goto nope; /* Don't try to run w/ errors */
1758 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1759 if (curop->op_type != OP_CONST &&
1760 curop->op_type != OP_LIST &&
1761 curop->op_type != OP_SCALAR &&
1762 curop->op_type != OP_NULL &&
1763 curop->op_type != OP_PUSHMARK) {
1768 curop = LINKLIST(o);
1772 sv = *(PL_stack_sp--);
1773 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1774 pad_swipe(o->op_targ);
1775 else if (SvTEMP(sv)) { /* grab mortal temp? */
1776 (void)SvREFCNT_inc(sv);
1780 if (type == OP_RV2GV)
1781 return newGVOP(OP_GV, 0, (GV*)sv);
1783 /* try to smush double to int, but don't smush -2.0 to -2 */
1784 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1788 if ((double)iv == SvNV(sv)) {
1793 SvIOK_off(sv); /* undo SvIV() damage */
1795 return newSVOP(OP_CONST, 0, sv);
1799 if (!(opargs[type] & OA_OTHERINT))
1802 if (!(PL_hints & HINT_INTEGER)) {
1803 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1806 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1807 if (curop->op_type == OP_CONST) {
1808 if (SvIOK(((SVOP*)curop)->op_sv))
1812 if (opargs[curop->op_type] & OA_RETINTEGER)
1816 o->op_ppaddr = ppaddr[++(o->op_type)];
1823 gen_constant_list(register OP *o)
1827 I32 oldtmps_floor = PL_tmps_floor;
1831 return o; /* Don't attempt to run with errors */
1833 PL_op = curop = LINKLIST(o);
1839 PL_tmps_floor = oldtmps_floor;
1841 o->op_type = OP_RV2AV;
1842 o->op_ppaddr = ppaddr[OP_RV2AV];
1843 curop = ((UNOP*)o)->op_first;
1844 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1851 convert(I32 type, I32 flags, OP *o)
1856 if (!o || o->op_type != OP_LIST)
1857 o = newLISTOP(OP_LIST, 0, o, Nullop);
1859 o->op_flags &= ~OPf_WANT;
1861 if (!(opargs[type] & OA_MARK))
1862 null(cLISTOPo->op_first);
1865 o->op_ppaddr = ppaddr[type];
1866 o->op_flags |= flags;
1868 o = CHECKOP(type, o);
1869 if (o->op_type != type)
1872 if (cLISTOPo->op_children < 7) {
1873 /* XXX do we really need to do this if we're done appending?? */
1874 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1876 cLISTOPo->op_last = last; /* in case check substituted last arg */
1879 return fold_constants(o);
1882 /* List constructors */
1885 append_elem(I32 type, OP *first, OP *last)
1893 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1894 return newLISTOP(type, 0, first, last);
1896 if (first->op_flags & OPf_KIDS)
1897 ((LISTOP*)first)->op_last->op_sibling = last;
1899 first->op_flags |= OPf_KIDS;
1900 ((LISTOP*)first)->op_first = last;
1902 ((LISTOP*)first)->op_last = last;
1903 ((LISTOP*)first)->op_children++;
1908 append_list(I32 type, LISTOP *first, LISTOP *last)
1916 if (first->op_type != type)
1917 return prepend_elem(type, (OP*)first, (OP*)last);
1919 if (last->op_type != type)
1920 return append_elem(type, (OP*)first, (OP*)last);
1922 first->op_last->op_sibling = last->op_first;
1923 first->op_last = last->op_last;
1924 first->op_children += last->op_children;
1925 if (first->op_children)
1926 first->op_flags |= OPf_KIDS;
1933 prepend_elem(I32 type, OP *first, OP *last)
1941 if (last->op_type == type) {
1942 if (type == OP_LIST) { /* already a PUSHMARK there */
1943 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1944 ((LISTOP*)last)->op_first->op_sibling = first;
1947 if (!(last->op_flags & OPf_KIDS)) {
1948 ((LISTOP*)last)->op_last = first;
1949 last->op_flags |= OPf_KIDS;
1951 first->op_sibling = ((LISTOP*)last)->op_first;
1952 ((LISTOP*)last)->op_first = first;
1954 ((LISTOP*)last)->op_children++;
1958 return newLISTOP(type, 0, first, last);
1966 return newOP(OP_STUB, 0);
1972 if (!o || o->op_type != OP_LIST)
1973 o = newLISTOP(OP_LIST, 0, o, Nullop);
1979 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1983 Newz(1101, listop, 1, LISTOP);
1985 listop->op_type = type;
1986 listop->op_ppaddr = ppaddr[type];
1987 listop->op_children = (first != 0) + (last != 0);
1988 listop->op_flags = flags;
1992 else if (!first && last)
1995 first->op_sibling = last;
1996 listop->op_first = first;
1997 listop->op_last = last;
1998 if (type == OP_LIST) {
2000 pushop = newOP(OP_PUSHMARK, 0);
2001 pushop->op_sibling = first;
2002 listop->op_first = pushop;
2003 listop->op_flags |= OPf_KIDS;
2005 listop->op_last = pushop;
2007 else if (listop->op_children)
2008 listop->op_flags |= OPf_KIDS;
2014 newOP(I32 type, I32 flags)
2017 Newz(1101, o, 1, OP);
2019 o->op_ppaddr = ppaddr[type];
2020 o->op_flags = flags;
2023 o->op_private = 0 + (flags >> 8);
2024 if (opargs[type] & OA_RETSCALAR)
2026 if (opargs[type] & OA_TARGET)
2027 o->op_targ = pad_alloc(type, SVs_PADTMP);
2028 return CHECKOP(type, o);
2032 newUNOP(I32 type, I32 flags, OP *first)
2037 first = newOP(OP_STUB, 0);
2038 if (opargs[type] & OA_MARK)
2039 first = force_list(first);
2041 Newz(1101, unop, 1, UNOP);
2042 unop->op_type = type;
2043 unop->op_ppaddr = ppaddr[type];
2044 unop->op_first = first;
2045 unop->op_flags = flags | OPf_KIDS;
2046 unop->op_private = 1 | (flags >> 8);
2047 unop = (UNOP*) CHECKOP(type, unop);
2051 return fold_constants((OP *) unop);
2055 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2058 Newz(1101, binop, 1, BINOP);
2061 first = newOP(OP_NULL, 0);
2063 binop->op_type = type;
2064 binop->op_ppaddr = ppaddr[type];
2065 binop->op_first = first;
2066 binop->op_flags = flags | OPf_KIDS;
2069 binop->op_private = 1 | (flags >> 8);
2072 binop->op_private = 2 | (flags >> 8);
2073 first->op_sibling = last;
2076 binop = (BINOP*)CHECKOP(type, binop);
2080 binop->op_last = binop->op_first->op_sibling;
2082 return fold_constants((OP *)binop);
2086 utf8compare(const void *a, const void *b)
2089 for (i = 0; i < 10; i++) {
2090 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2092 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2099 pmtrans(OP *o, OP *expr, OP *repl)
2101 SV *tstr = ((SVOP*)expr)->op_sv;
2102 SV *rstr = ((SVOP*)repl)->op_sv;
2105 register U8 *t = (U8*)SvPV(tstr, tlen);
2106 register U8 *r = (U8*)SvPV(rstr, rlen);
2112 register short *tbl;
2114 complement = o->op_private & OPpTRANS_COMPLEMENT;
2115 del = o->op_private & OPpTRANS_DELETE;
2116 squash = o->op_private & OPpTRANS_SQUASH;
2118 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2119 SV* listsv = newSVpv("# comment\n",0);
2121 U8* tend = t + tlen;
2122 U8* rend = r + rlen;
2138 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2139 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2145 New(1109, cp, tlen, U8*);
2147 transv = newSVpv("",0);
2156 qsort(cp, i, sizeof(U8*), utf8compare);
2157 for (j = 0; j < i; j++) {
2159 UV val = utf8_to_uv(s, &ulen);
2161 diff = val - nextmin;
2163 t = uv_to_utf8(tmpbuf,nextmin);
2164 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2166 t = uv_to_utf8(tmpbuf, val - 1);
2167 sv_catpvn(transv, "\377", 1);
2168 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2172 val = utf8_to_uv(s+1, &ulen);
2176 t = uv_to_utf8(tmpbuf,nextmin);
2177 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2178 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2179 sv_catpvn(transv, "\377", 1);
2180 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2181 t = (U8*)SvPVX(transv);
2182 tlen = SvCUR(transv);
2185 else if (!rlen && !del) {
2186 r = t; rlen = tlen; rend = tend;
2189 if (to_utf && from_utf) { /* only counting characters */
2190 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2191 o->op_private |= OPpTRANS_IDENTICAL;
2193 else { /* straight latin-1 translation */
2194 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2195 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2196 o->op_private |= OPpTRANS_IDENTICAL;
2200 while (t < tend || tfirst <= tlast) {
2201 /* see if we need more "t" chars */
2202 if (tfirst > tlast) {
2203 tfirst = (I32)utf8_to_uv(t, &ulen);
2205 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2206 tlast = (I32)utf8_to_uv(++t, &ulen);
2213 /* now see if we need more "r" chars */
2214 if (rfirst > rlast) {
2216 rfirst = (I32)utf8_to_uv(r, &ulen);
2218 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2219 rlast = (I32)utf8_to_uv(++r, &ulen);
2228 rfirst = rlast = 0xffffffff;
2232 /* now see which range will peter our first, if either. */
2233 tdiff = tlast - tfirst;
2234 rdiff = rlast - rfirst;
2241 if (rfirst == 0xffffffff) {
2242 diff = tdiff; /* oops, pretend rdiff is infinite */
2244 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2246 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2250 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2252 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2254 if (rfirst + diff > max)
2255 max = rfirst + diff;
2260 else if (rfirst <= 0x800)
2261 grows |= (tfirst < 0x80);
2262 else if (rfirst <= 0x10000)
2263 grows |= (tfirst < 0x800);
2264 else if (rfirst <= 0x200000)
2265 grows |= (tfirst < 0x10000);
2266 else if (rfirst <= 0x4000000)
2267 grows |= (tfirst < 0x200000);
2268 else if (rfirst <= 0x80000000)
2269 grows |= (tfirst < 0x4000000);
2281 else if (max > 0xff)
2286 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2287 SvREFCNT_dec(listsv);
2289 SvREFCNT_dec(transv);
2291 if (!del && havefinal)
2292 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2294 if (grows && to_utf)
2295 o->op_private |= OPpTRANS_GROWS;
2302 tbl = (short*)cPVOPo->op_pv;
2304 Zero(tbl, 256, short);
2305 for (i = 0; i < tlen; i++)
2307 for (i = 0, j = 0; i < 256; i++) {
2323 if (!rlen && !del) {
2326 o->op_private |= OPpTRANS_IDENTICAL;
2328 for (i = 0; i < 256; i++)
2330 for (i = 0, j = 0; i < tlen; i++,j++) {
2333 if (tbl[t[i]] == -1)
2339 if (tbl[t[i]] == -1)
2350 newPMOP(I32 type, I32 flags)
2355 Newz(1101, pmop, 1, PMOP);
2356 pmop->op_type = type;
2357 pmop->op_ppaddr = ppaddr[type];
2358 pmop->op_flags = flags;
2359 pmop->op_private = 0 | (flags >> 8);
2361 if (PL_hints & HINT_RE_TAINT)
2362 pmop->op_pmpermflags |= PMf_RETAINT;
2363 if (PL_hints & HINT_LOCALE)
2364 pmop->op_pmpermflags |= PMf_LOCALE;
2365 pmop->op_pmflags = pmop->op_pmpermflags;
2367 /* link into pm list */
2368 if (type != OP_TRANS && PL_curstash) {
2369 pmop->op_pmnext = HvPMROOT(PL_curstash);
2370 HvPMROOT(PL_curstash) = pmop;
2377 pmruntime(OP *o, OP *expr, OP *repl)
2382 I32 repl_has_vars = 0;
2384 if (o->op_type == OP_TRANS)
2385 return pmtrans(o, expr, repl);
2387 PL_hints |= HINT_BLOCK_SCOPE;
2390 if (expr->op_type == OP_CONST) {
2392 SV *pat = ((SVOP*)expr)->op_sv;
2393 char *p = SvPV(pat, plen);
2394 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2395 sv_setpvn(pat, "\\s+", 3);
2396 p = SvPV(pat, plen);
2397 pm->op_pmflags |= PMf_SKIPWHITE;
2399 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2400 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2401 pm->op_pmflags |= PMf_WHITE;
2405 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2406 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2408 : OP_REGCMAYBE),0,expr);
2410 Newz(1101, rcop, 1, LOGOP);
2411 rcop->op_type = OP_REGCOMP;
2412 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2413 rcop->op_first = scalar(expr);
2414 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2415 ? (OPf_SPECIAL | OPf_KIDS)
2417 rcop->op_private = 1;
2420 /* establish postfix order */
2421 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2423 rcop->op_next = expr;
2424 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2427 rcop->op_next = LINKLIST(expr);
2428 expr->op_next = (OP*)rcop;
2431 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2436 if (pm->op_pmflags & PMf_EVAL)
2439 else if (repl->op_type == OP_THREADSV
2440 && strchr("&`'123456789+",
2441 PL_threadsv_names[repl->op_targ]))
2445 #endif /* USE_THREADS */
2446 else if (repl->op_type == OP_CONST)
2450 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2451 if (opargs[curop->op_type] & OA_DANGEROUS) {
2453 if (curop->op_type == OP_THREADSV) {
2455 if (strchr("&`'123456789+", curop->op_private))
2459 if (curop->op_type == OP_GV) {
2460 GV *gv = ((GVOP*)curop)->op_gv;
2462 if (strchr("&`'123456789+", *GvENAME(gv)))
2465 #endif /* USE_THREADS */
2466 else if (curop->op_type == OP_RV2CV)
2468 else if (curop->op_type == OP_RV2SV ||
2469 curop->op_type == OP_RV2AV ||
2470 curop->op_type == OP_RV2HV ||
2471 curop->op_type == OP_RV2GV) {
2472 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2475 else if (curop->op_type == OP_PADSV ||
2476 curop->op_type == OP_PADAV ||
2477 curop->op_type == OP_PADHV ||
2478 curop->op_type == OP_PADANY) {
2481 else if (curop->op_type == OP_PUSHRE)
2482 ; /* Okay here, dangerous in newASSIGNOP */
2491 && (!pm->op_pmregexp
2492 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2493 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2494 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2495 prepend_elem(o->op_type, scalar(repl), o);
2498 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2499 pm->op_pmflags |= PMf_MAYBE_CONST;
2500 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2502 Newz(1101, rcop, 1, LOGOP);
2503 rcop->op_type = OP_SUBSTCONT;
2504 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2505 rcop->op_first = scalar(repl);
2506 rcop->op_flags |= OPf_KIDS;
2507 rcop->op_private = 1;
2510 /* establish postfix order */
2511 rcop->op_next = LINKLIST(repl);
2512 repl->op_next = (OP*)rcop;
2514 pm->op_pmreplroot = scalar((OP*)rcop);
2515 pm->op_pmreplstart = LINKLIST(rcop);
2524 newSVOP(I32 type, I32 flags, SV *sv)
2527 Newz(1101, svop, 1, SVOP);
2528 svop->op_type = type;
2529 svop->op_ppaddr = ppaddr[type];
2531 svop->op_next = (OP*)svop;
2532 svop->op_flags = flags;
2533 if (opargs[type] & OA_RETSCALAR)
2535 if (opargs[type] & OA_TARGET)
2536 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2537 return CHECKOP(type, svop);
2541 newGVOP(I32 type, I32 flags, GV *gv)
2545 Newz(1101, gvop, 1, GVOP);
2546 gvop->op_type = type;
2547 gvop->op_ppaddr = ppaddr[type];
2548 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2549 gvop->op_next = (OP*)gvop;
2550 gvop->op_flags = flags;
2551 if (opargs[type] & OA_RETSCALAR)
2553 if (opargs[type] & OA_TARGET)
2554 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2555 return CHECKOP(type, gvop);
2559 newPVOP(I32 type, I32 flags, char *pv)
2562 Newz(1101, pvop, 1, PVOP);
2563 pvop->op_type = type;
2564 pvop->op_ppaddr = ppaddr[type];
2566 pvop->op_next = (OP*)pvop;
2567 pvop->op_flags = flags;
2568 if (opargs[type] & OA_RETSCALAR)
2570 if (opargs[type] & OA_TARGET)
2571 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2572 return CHECKOP(type, pvop);
2581 save_hptr(&PL_curstash);
2582 save_item(PL_curstname);
2587 name = SvPV(sv, len);
2588 PL_curstash = gv_stashpvn(name,len,TRUE);
2589 sv_setpvn(PL_curstname, name, len);
2593 sv_setpv(PL_curstname,"<none>");
2594 PL_curstash = Nullhv;
2596 PL_copline = NOLINE;
2601 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2610 if (id->op_type != OP_CONST)
2611 croak("Module name must be constant");
2615 if(version != Nullop) {
2616 SV *vesv = ((SVOP*)version)->op_sv;
2618 if (arg == Nullop && !SvNIOK(vesv)) {
2625 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2626 croak("Version number must be constant number");
2628 /* Make copy of id so we don't free it twice */
2629 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2631 /* Fake up a method call to VERSION */
2632 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2633 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2634 append_elem(OP_LIST,
2635 prepend_elem(OP_LIST, pack, list(version)),
2636 newUNOP(OP_METHOD, 0, meth)));
2640 /* Fake up an import/unimport */
2641 if (arg && arg->op_type == OP_STUB)
2642 imop = arg; /* no import on explicit () */
2643 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2644 imop = Nullop; /* use 5.0; */
2647 /* Make copy of id so we don't free it twice */
2648 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2649 meth = newSVOP(OP_CONST, 0,
2651 ? newSVpv("import", 6)
2652 : newSVpv("unimport", 8)
2654 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2655 append_elem(OP_LIST,
2656 prepend_elem(OP_LIST, pack, list(arg)),
2657 newUNOP(OP_METHOD, 0, meth)));
2660 /* Fake up a require, handle override, if any */
2661 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2662 if (!(gv && GvIMPORTED_CV(gv)))
2663 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2665 if (gv && GvIMPORTED_CV(gv)) {
2666 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2667 append_elem(OP_LIST, id,
2668 scalar(newUNOP(OP_RV2CV, 0,
2673 rqop = newUNOP(OP_REQUIRE, 0, id);
2676 /* Fake up the BEGIN {}, which does its thing immediately. */
2678 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2680 append_elem(OP_LINESEQ,
2681 append_elem(OP_LINESEQ,
2682 newSTATEOP(0, Nullch, rqop),
2683 newSTATEOP(0, Nullch, veop)),
2684 newSTATEOP(0, Nullch, imop) ));
2686 PL_copline = NOLINE;
2696 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2697 if (!(gv && GvIMPORTED_CV(gv)))
2698 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2700 if (gv && GvIMPORTED_CV(gv)) {
2701 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2702 append_elem(OP_LIST, term,
2703 scalar(newUNOP(OP_RV2CV, 0,
2708 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2714 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2716 return newBINOP(OP_LSLICE, flags,
2717 list(force_list(subscript)),
2718 list(force_list(listval)) );
2722 list_assignment(register OP *o)
2727 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2728 o = cUNOPo->op_first;
2730 if (o->op_type == OP_COND_EXPR) {
2731 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2732 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2737 yyerror("Assignment to both a list and a scalar");
2741 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2742 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2743 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2746 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2749 if (o->op_type == OP_RV2SV)
2756 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2761 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2762 return newLOGOP(optype, 0,
2763 mod(scalar(left), optype),
2764 newUNOP(OP_SASSIGN, 0, scalar(right)));
2767 return newBINOP(optype, OPf_STACKED,
2768 mod(scalar(left), optype), scalar(right));
2772 if (list_assignment(left)) {
2775 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2776 left = mod(left, OP_AASSIGN);
2784 o = newBINOP(OP_AASSIGN, flags,
2785 list(force_list(right)),
2786 list(force_list(left)) );
2787 o->op_private = 0 | (flags >> 8);
2788 if (!(left->op_private & OPpLVAL_INTRO)) {
2792 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2793 if (opargs[curop->op_type] & OA_DANGEROUS) {
2794 if (curop->op_type == OP_GV) {
2795 GV *gv = ((GVOP*)curop)->op_gv;
2796 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2798 SvCUR(gv) = PL_generation;
2800 else if (curop->op_type == OP_PADSV ||
2801 curop->op_type == OP_PADAV ||
2802 curop->op_type == OP_PADHV ||
2803 curop->op_type == OP_PADANY) {
2804 SV **svp = AvARRAY(PL_comppad_name);
2805 SV *sv = svp[curop->op_targ];
2806 if (SvCUR(sv) == PL_generation)
2808 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2810 else if (curop->op_type == OP_RV2CV)
2812 else if (curop->op_type == OP_RV2SV ||
2813 curop->op_type == OP_RV2AV ||
2814 curop->op_type == OP_RV2HV ||
2815 curop->op_type == OP_RV2GV) {
2816 if (lastop->op_type != OP_GV) /* funny deref? */
2819 else if (curop->op_type == OP_PUSHRE) {
2820 if (((PMOP*)curop)->op_pmreplroot) {
2821 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2822 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2824 SvCUR(gv) = PL_generation;
2833 o->op_private = OPpASSIGN_COMMON;
2835 if (right && right->op_type == OP_SPLIT) {
2837 if ((tmpop = ((LISTOP*)right)->op_first) &&
2838 tmpop->op_type == OP_PUSHRE)
2840 PMOP *pm = (PMOP*)tmpop;
2841 if (left->op_type == OP_RV2AV &&
2842 !(left->op_private & OPpLVAL_INTRO) &&
2843 !(o->op_private & OPpASSIGN_COMMON) )
2845 tmpop = ((UNOP*)left)->op_first;
2846 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2847 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2848 pm->op_pmflags |= PMf_ONCE;
2849 tmpop = cUNOPo->op_first; /* to list (nulled) */
2850 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2851 tmpop->op_sibling = Nullop; /* don't free split */
2852 right->op_next = tmpop->op_next; /* fix starting loc */
2853 op_free(o); /* blow off assign */
2854 right->op_flags &= ~OPf_WANT;
2855 /* "I don't know and I don't care." */
2860 if (PL_modcount < 10000 &&
2861 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2863 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2865 sv_setiv(sv, PL_modcount+1);
2873 right = newOP(OP_UNDEF, 0);
2874 if (right->op_type == OP_READLINE) {
2875 right->op_flags |= OPf_STACKED;
2876 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2879 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2880 o = newBINOP(OP_SASSIGN, flags,
2881 scalar(right), mod(scalar(left), OP_SASSIGN) );
2893 newSTATEOP(I32 flags, char *label, OP *o)
2896 U32 seq = intro_my();
2899 Newz(1101, cop, 1, COP);
2900 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2901 cop->op_type = OP_DBSTATE;
2902 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2905 cop->op_type = OP_NEXTSTATE;
2906 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2908 cop->op_flags = flags;
2909 cop->op_private = (PL_hints & HINT_UTF8);
2911 cop->op_private |= NATIVE_HINTS;
2913 PL_compiling.op_private = cop->op_private;
2914 cop->op_next = (OP*)cop;
2917 cop->cop_label = label;
2918 PL_hints |= HINT_BLOCK_SCOPE;
2921 cop->cop_arybase = PL_curcop->cop_arybase;
2922 if (PL_curcop->cop_warnings == WARN_NONE
2923 || PL_curcop->cop_warnings == WARN_ALL)
2924 cop->cop_warnings = PL_curcop->cop_warnings ;
2926 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2929 if (PL_copline == NOLINE)
2930 cop->cop_line = PL_curcop->cop_line;
2932 cop->cop_line = PL_copline;
2933 PL_copline = NOLINE;
2935 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2936 cop->cop_stash = PL_curstash;
2938 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2939 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2940 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2941 (void)SvIOK_on(*svp);
2943 SvSTASH(*svp) = (HV*)cop;
2947 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2950 /* "Introduce" my variables to visible status. */
2958 if (! PL_min_intro_pending)
2959 return PL_cop_seqmax;
2961 svp = AvARRAY(PL_comppad_name);
2962 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2963 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2964 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2965 SvNVX(sv) = (double)PL_cop_seqmax;
2968 PL_min_intro_pending = 0;
2969 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2970 return PL_cop_seqmax++;
2974 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2976 return new_logop(type, flags, &first, &other);
2980 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2985 OP *first = *firstp;
2986 OP *other = *otherp;
2988 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2989 return newBINOP(type, flags, scalar(first), scalar(other));
2991 scalarboolean(first);
2992 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2993 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2994 if (type == OP_AND || type == OP_OR) {
3000 first = *firstp = cUNOPo->op_first;
3002 first->op_next = o->op_next;
3003 cUNOPo->op_first = Nullop;
3007 if (first->op_type == OP_CONST) {
3008 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3009 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3011 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3022 else if (first->op_type == OP_WANTARRAY) {
3028 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3029 OP *k1 = ((UNOP*)first)->op_first;
3030 OP *k2 = k1->op_sibling;
3032 switch (first->op_type)
3035 if (k2 && k2->op_type == OP_READLINE
3036 && (k2->op_flags & OPf_STACKED)
3037 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3038 warnop = k2->op_type;
3042 if (k1->op_type == OP_READDIR
3043 || k1->op_type == OP_GLOB
3044 || k1->op_type == OP_EACH)
3045 warnop = k1->op_type;
3049 line_t oldline = PL_curcop->cop_line;
3050 PL_curcop->cop_line = PL_copline;
3052 "Value of %s%s can be \"0\"; test with defined()",
3054 ((warnop == OP_READLINE || warnop == OP_GLOB)
3055 ? " construct" : "() operator"));
3056 PL_curcop->cop_line = oldline;
3063 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3064 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3066 Newz(1101, logop, 1, LOGOP);
3068 logop->op_type = type;
3069 logop->op_ppaddr = ppaddr[type];
3070 logop->op_first = first;
3071 logop->op_flags = flags | OPf_KIDS;
3072 logop->op_other = LINKLIST(other);
3073 logop->op_private = 1 | (flags >> 8);
3075 /* establish postfix order */
3076 logop->op_next = LINKLIST(first);
3077 first->op_next = (OP*)logop;
3078 first->op_sibling = other;
3080 o = newUNOP(OP_NULL, 0, (OP*)logop);
3087 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3094 return newLOGOP(OP_AND, 0, first, trueop);
3096 return newLOGOP(OP_OR, 0, first, falseop);
3098 scalarboolean(first);
3099 if (first->op_type == OP_CONST) {
3100 if (SvTRUE(((SVOP*)first)->op_sv)) {
3111 else if (first->op_type == OP_WANTARRAY) {
3115 Newz(1101, condop, 1, CONDOP);
3117 condop->op_type = OP_COND_EXPR;
3118 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3119 condop->op_first = first;
3120 condop->op_flags = flags | OPf_KIDS;
3121 condop->op_true = LINKLIST(trueop);
3122 condop->op_false = LINKLIST(falseop);
3123 condop->op_private = 1 | (flags >> 8);
3125 /* establish postfix order */
3126 condop->op_next = LINKLIST(first);
3127 first->op_next = (OP*)condop;
3129 first->op_sibling = trueop;
3130 trueop->op_sibling = falseop;
3131 o = newUNOP(OP_NULL, 0, (OP*)condop);
3133 trueop->op_next = o;
3134 falseop->op_next = o;
3140 newRANGE(I32 flags, OP *left, OP *right)
3148 Newz(1101, condop, 1, CONDOP);
3150 condop->op_type = OP_RANGE;
3151 condop->op_ppaddr = ppaddr[OP_RANGE];
3152 condop->op_first = left;
3153 condop->op_flags = OPf_KIDS;
3154 condop->op_true = LINKLIST(left);
3155 condop->op_false = LINKLIST(right);
3156 condop->op_private = 1 | (flags >> 8);
3158 left->op_sibling = right;
3160 condop->op_next = (OP*)condop;
3161 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3162 flop = newUNOP(OP_FLOP, 0, flip);
3163 o = newUNOP(OP_NULL, 0, flop);
3166 left->op_next = flip;
3167 right->op_next = flop;
3169 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3170 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3171 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3172 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3174 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3175 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3178 if (!flip->op_private || !flop->op_private)
3179 linklist(o); /* blow off optimizer unless constant */
3185 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3190 int once = block && block->op_flags & OPf_SPECIAL &&
3191 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3194 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3195 return block; /* do {} while 0 does once */
3196 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3197 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3198 expr = newUNOP(OP_DEFINED, 0,
3199 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3200 } else if (expr->op_flags & OPf_KIDS) {
3201 OP *k1 = ((UNOP*)expr)->op_first;
3202 OP *k2 = (k1) ? k1->op_sibling : NULL;
3203 switch (expr->op_type) {
3205 if (k2 && k2->op_type == OP_READLINE
3206 && (k2->op_flags & OPf_STACKED)
3207 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3208 expr = newUNOP(OP_DEFINED, 0, expr);
3212 if (k1->op_type == OP_READDIR
3213 || k1->op_type == OP_GLOB
3214 || k1->op_type == OP_EACH)
3215 expr = newUNOP(OP_DEFINED, 0, expr);
3221 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3222 o = new_logop(OP_AND, 0, &expr, &listop);
3225 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3227 if (once && o != listop)
3228 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3231 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3233 o->op_flags |= flags;
3235 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3240 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3249 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3250 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3251 expr = newUNOP(OP_DEFINED, 0,
3252 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3253 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3254 OP *k1 = ((UNOP*)expr)->op_first;
3255 OP *k2 = (k1) ? k1->op_sibling : NULL;
3256 switch (expr->op_type) {
3258 if (k2 && k2->op_type == OP_READLINE
3259 && (k2->op_flags & OPf_STACKED)
3260 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3261 expr = newUNOP(OP_DEFINED, 0, expr);
3265 if (k1->op_type == OP_READDIR
3266 || k1->op_type == OP_GLOB
3267 || k1->op_type == OP_EACH)
3268 expr = newUNOP(OP_DEFINED, 0, expr);
3274 block = newOP(OP_NULL, 0);
3277 next = LINKLIST(cont);
3279 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3280 if ((line_t)whileline != NOLINE) {
3281 PL_copline = whileline;
3282 cont = append_elem(OP_LINESEQ, cont,
3283 newSTATEOP(0, Nullch, Nullop));
3287 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3288 redo = LINKLIST(listop);
3291 PL_copline = whileline;
3293 o = new_logop(OP_AND, 0, &expr, &listop);
3294 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3295 op_free(expr); /* oops, it's a while (0) */
3297 return Nullop; /* listop already freed by new_logop */
3300 ((LISTOP*)listop)->op_last->op_next = condop =
3301 (o == listop ? redo : LINKLIST(o));
3309 Newz(1101,loop,1,LOOP);
3310 loop->op_type = OP_ENTERLOOP;
3311 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3312 loop->op_private = 0;
3313 loop->op_next = (OP*)loop;
3316 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3318 loop->op_redoop = redo;
3319 loop->op_lastop = o;
3322 loop->op_nextop = next;
3324 loop->op_nextop = o;
3326 o->op_flags |= flags;
3327 o->op_private |= (flags >> 8);
3332 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3340 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3341 sv->op_type = OP_RV2GV;
3342 sv->op_ppaddr = ppaddr[OP_RV2GV];
3344 else if (sv->op_type == OP_PADSV) { /* private variable */
3345 padoff = sv->op_targ;
3349 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3350 padoff = sv->op_targ;
3351 iterflags |= OPf_SPECIAL;
3356 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3360 padoff = find_threadsv("_");
3361 iterflags |= OPf_SPECIAL;
3363 sv = newGVOP(OP_GV, 0, PL_defgv);
3366 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3367 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3368 iterflags |= OPf_STACKED;
3370 else if (expr->op_type == OP_NULL &&
3371 (expr->op_flags & OPf_KIDS) &&
3372 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3374 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3375 * set the STACKED flag to indicate that these values are to be
3376 * treated as min/max values by 'pp_iterinit'.
3378 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3379 CONDOP* range = (CONDOP*) flip->op_first;
3380 OP* left = range->op_first;
3381 OP* right = left->op_sibling;
3384 range->op_flags &= ~OPf_KIDS;
3385 range->op_first = Nullop;
3387 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3388 listop->op_first->op_next = range->op_true;
3389 left->op_next = range->op_false;
3390 right->op_next = (OP*)listop;
3391 listop->op_next = listop->op_first;
3394 expr = (OP*)(listop);
3396 iterflags |= OPf_STACKED;
3399 expr = mod(force_list(expr), OP_GREPSTART);
3403 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3404 append_elem(OP_LIST, expr, scalar(sv))));
3405 assert(!loop->op_next);
3406 Renew(loop, 1, LOOP);
3407 loop->op_targ = padoff;
3408 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3409 PL_copline = forline;
3410 return newSTATEOP(0, label, wop);
3414 newLOOPEX(I32 type, OP *label)
3418 if (type != OP_GOTO || label->op_type == OP_CONST) {
3419 /* "last()" means "last" */
3420 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3421 o = newOP(type, OPf_SPECIAL);
3423 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3424 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3430 if (label->op_type == OP_ENTERSUB)
3431 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3432 o = newUNOP(type, OPf_STACKED, label);
3434 PL_hints |= HINT_BLOCK_SCOPE;
3444 MUTEX_DESTROY(CvMUTEXP(cv));
3445 Safefree(CvMUTEXP(cv));
3448 #endif /* USE_THREADS */
3450 if (!CvXSUB(cv) && CvROOT(cv)) {
3452 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3453 croak("Can't undef active subroutine");
3456 croak("Can't undef active subroutine");
3457 #endif /* USE_THREADS */
3460 SAVESPTR(PL_curpad);
3464 op_free(CvROOT(cv));
3465 CvROOT(cv) = Nullop;
3468 SvPOK_off((SV*)cv); /* forget prototype */
3470 SvREFCNT_dec(CvGV(cv));
3472 SvREFCNT_dec(CvOUTSIDE(cv));
3473 CvOUTSIDE(cv) = Nullcv;
3474 if (CvPADLIST(cv)) {
3475 /* may be during global destruction */
3476 if (SvREFCNT(CvPADLIST(cv))) {
3477 I32 i = AvFILLp(CvPADLIST(cv));
3479 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3480 SV* sv = svp ? *svp : Nullsv;
3483 if (sv == (SV*)PL_comppad_name)
3484 PL_comppad_name = Nullav;
3485 else if (sv == (SV*)PL_comppad) {
3486 PL_comppad = Nullav;
3487 PL_curpad = Null(SV**);
3491 SvREFCNT_dec((SV*)CvPADLIST(cv));
3493 CvPADLIST(cv) = Nullav;
3497 #ifdef DEBUG_CLOSURES
3502 CV *outside = CvOUTSIDE(cv);
3503 AV* padlist = CvPADLIST(cv);
3510 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3512 (CvANON(cv) ? "ANON"
3513 : (cv == PL_main_cv) ? "MAIN"
3514 : CvUNIQUE(cv) ? "UNIQUE"
3515 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3518 : CvANON(outside) ? "ANON"
3519 : (outside == PL_main_cv) ? "MAIN"
3520 : CvUNIQUE(outside) ? "UNIQUE"
3521 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3526 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3527 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3528 pname = AvARRAY(pad_name);
3529 ppad = AvARRAY(pad);
3531 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3532 if (SvPOK(pname[ix]))
3533 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3535 SvFAKE(pname[ix]) ? "FAKE " : "",
3537 (long)I_32(SvNVX(pname[ix])),
3538 (long)SvIVX(pname[ix]));
3541 #endif /* DEBUG_CLOSURES */
3544 cv_clone2(CV *proto, CV *outside)
3549 AV* protopadlist = CvPADLIST(proto);
3550 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3551 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3552 SV** pname = AvARRAY(protopad_name);
3553 SV** ppad = AvARRAY(protopad);
3554 I32 fname = AvFILLp(protopad_name);
3555 I32 fpad = AvFILLp(protopad);
3559 assert(!CvUNIQUE(proto));
3562 SAVESPTR(PL_curpad);
3563 SAVESPTR(PL_comppad);
3564 SAVESPTR(PL_comppad_name);
3565 SAVESPTR(PL_compcv);
3567 cv = PL_compcv = (CV*)NEWSV(1104,0);
3568 sv_upgrade((SV *)cv, SvTYPE(proto));
3574 New(666, CvMUTEXP(cv), 1, perl_mutex);
3575 MUTEX_INIT(CvMUTEXP(cv));
3577 #endif /* USE_THREADS */
3578 CvFILEGV(cv) = CvFILEGV(proto);
3579 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3580 CvSTASH(cv) = CvSTASH(proto);
3581 CvROOT(cv) = CvROOT(proto);
3582 CvSTART(cv) = CvSTART(proto);
3584 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3587 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3589 PL_comppad_name = newAV();
3590 for (ix = fname; ix >= 0; ix--)
3591 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3593 PL_comppad = newAV();
3595 comppadlist = newAV();
3596 AvREAL_off(comppadlist);
3597 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3598 av_store(comppadlist, 1, (SV*)PL_comppad);
3599 CvPADLIST(cv) = comppadlist;
3600 av_fill(PL_comppad, AvFILLp(protopad));
3601 PL_curpad = AvARRAY(PL_comppad);
3603 av = newAV(); /* will be @_ */
3605 av_store(PL_comppad, 0, (SV*)av);
3606 AvFLAGS(av) = AVf_REIFY;
3608 for (ix = fpad; ix > 0; ix--) {
3609 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3610 if (namesv && namesv != &PL_sv_undef) {
3611 char *name = SvPVX(namesv); /* XXX */
3612 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3613 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3614 CvOUTSIDE(cv), cxstack_ix, 0);
3616 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3618 croak("panic: cv_clone: %s", name);
3620 else { /* our own lexical */
3623 /* anon code -- we'll come back for it */
3624 sv = SvREFCNT_inc(ppad[ix]);
3626 else if (*name == '@')
3628 else if (*name == '%')
3638 SV* sv = NEWSV(0,0);
3644 /* Now that vars are all in place, clone nested closures. */
3646 for (ix = fpad; ix > 0; ix--) {
3647 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3649 && namesv != &PL_sv_undef
3650 && !(SvFLAGS(namesv) & SVf_FAKE)
3651 && *SvPVX(namesv) == '&'
3652 && CvCLONE(ppad[ix]))
3654 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3655 SvREFCNT_dec(ppad[ix]);
3658 PL_curpad[ix] = (SV*)kid;
3662 #ifdef DEBUG_CLOSURES
3663 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3665 PerlIO_printf(Perl_debug_log, " from:\n");
3667 PerlIO_printf(Perl_debug_log, " to:\n");
3678 return cv_clone2(proto, CvOUTSIDE(proto));
3682 cv_ckproto(CV *cv, GV *gv, char *p)
3684 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3685 SV* msg = sv_newmortal();
3689 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3690 sv_setpv(msg, "Prototype mismatch:");
3692 sv_catpvf(msg, " sub %_", name);
3694 sv_catpvf(msg, " (%s)", SvPVX(cv));
3695 sv_catpv(msg, " vs ");
3697 sv_catpvf(msg, "(%s)", p);
3699 sv_catpv(msg, "none");
3707 if (!cv || !SvPOK(cv) || SvCUR(cv))
3709 return op_const_sv(CvSTART(cv), cv);
3713 op_const_sv(OP *o, CV *cv)
3720 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3721 o = cLISTOPo->op_first->op_sibling;
3723 for (; o; o = o->op_next) {
3724 OPCODE type = o->op_type;
3726 if(sv && o->op_next == o)
3728 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3730 if (type == OP_LEAVESUB || type == OP_RETURN)
3734 if (type == OP_CONST)
3736 else if (type == OP_PADSV && cv) {
3737 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3738 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3739 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3751 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3754 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3755 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3756 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3757 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3766 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3767 maximum a prototype before. */
3768 if (SvTYPE(gv) > SVt_NULL) {
3769 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3770 warn("Runaway prototype");
3771 cv_ckproto((CV*)gv, NULL, ps);
3774 sv_setpv((SV*)gv, ps);
3776 sv_setiv((SV*)gv, -1);
3777 SvREFCNT_dec(PL_compcv);
3778 cv = PL_compcv = NULL;
3779 PL_sub_generation++;
3783 if (!name || GvCVGEN(gv))
3785 else if (cv = GvCV(gv)) {
3786 cv_ckproto(cv, gv, ps);
3787 /* already defined (or promised)? */
3788 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3790 bool const_changed = TRUE;
3792 /* just a "sub foo;" when &foo is already defined */
3793 SAVEFREESV(PL_compcv);
3796 /* ahem, death to those who redefine active sort subs */
3797 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3798 croak("Can't redefine active sort subroutine %s", name);
3799 if(const_sv = cv_const_sv(cv))
3800 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3801 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3802 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3803 && HvNAME(GvSTASH(CvGV(cv)))
3804 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3806 line_t oldline = PL_curcop->cop_line;
3807 PL_curcop->cop_line = PL_copline;
3808 warner(WARN_REDEFINE,
3809 const_sv ? "Constant subroutine %s redefined"
3810 : "Subroutine %s redefined", name);
3811 PL_curcop->cop_line = oldline;
3817 if (cv) { /* must reuse cv if autoloaded */
3819 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3820 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3821 CvOUTSIDE(PL_compcv) = 0;
3822 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3823 CvPADLIST(PL_compcv) = 0;
3824 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3825 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3826 SvREFCNT_dec(PL_compcv);
3833 PL_sub_generation++;
3836 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3837 CvFILEGV(cv) = PL_curcop->cop_filegv;
3838 CvSTASH(cv) = PL_curstash;
3841 if (!CvMUTEXP(cv)) {
3842 New(666, CvMUTEXP(cv), 1, perl_mutex);
3843 MUTEX_INIT(CvMUTEXP(cv));
3845 #endif /* USE_THREADS */
3848 sv_setpv((SV*)cv, ps);
3850 if (PL_error_count) {
3854 char *s = strrchr(name, ':');
3856 if (strEQ(s, "BEGIN")) {
3858 "BEGIN not safe after errors--compilation aborted";
3862 /* force display of errors found but not reported */
3863 sv_catpv(ERRSV, not_safe);
3864 croak("%s", SvPVx(ERRSV, PL_na));
3871 PL_copline = NOLINE;
3876 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3877 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3880 SV **namep = AvARRAY(PL_comppad_name);
3881 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3884 if (SvIMMORTAL(PL_curpad[ix]))
3887 * The only things that a clonable function needs in its
3888 * pad are references to outer lexicals and anonymous subs.
3889 * The rest are created anew during cloning.
3891 if (!((namesv = namep[ix]) != Nullsv &&
3892 namesv != &PL_sv_undef &&
3894 *SvPVX(namesv) == '&')))
3896 SvREFCNT_dec(PL_curpad[ix]);
3897 PL_curpad[ix] = Nullsv;
3902 AV *av = newAV(); /* Will be @_ */
3904 av_store(PL_comppad, 0, (SV*)av);
3905 AvFLAGS(av) = AVf_REIFY;
3907 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3908 if (SvIMMORTAL(PL_curpad[ix]))
3910 if (!SvPADMY(PL_curpad[ix]))
3911 SvPADTMP_on(PL_curpad[ix]);
3915 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3916 CvSTART(cv) = LINKLIST(CvROOT(cv));
3917 CvROOT(cv)->op_next = 0;
3923 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3924 SV *sv = NEWSV(0,0);
3925 SV *tmpstr = sv_newmortal();
3926 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3930 sv_setpvf(sv, "%_:%ld-%ld",
3931 GvSV(PL_curcop->cop_filegv),
3932 (long)PL_subline, (long)PL_curcop->cop_line);
3933 gv_efullname3(tmpstr, gv, Nullch);
3934 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3935 hv = GvHVn(db_postponed);
3936 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3937 && (cv = GvCV(db_postponed))) {
3942 perl_call_sv((SV*)cv, G_DISCARD);
3946 if ((s = strrchr(name,':')))
3950 if (strEQ(s, "BEGIN")) {
3951 I32 oldscope = PL_scopestack_ix;
3953 SAVESPTR(PL_compiling.cop_filegv);
3954 SAVEI16(PL_compiling.cop_line);
3956 sv_setsv(PL_rs, PL_nrs);
3959 PL_beginav = newAV();
3960 DEBUG_x( dump_sub(gv) );
3961 av_push(PL_beginav, (SV *)cv);
3963 call_list(oldscope, PL_beginav);
3965 PL_curcop = &PL_compiling;
3966 PL_compiling.op_private = PL_hints;
3969 else if (strEQ(s, "END") && !PL_error_count) {
3972 av_unshift(PL_endav, 1);
3973 av_store(PL_endav, 0, (SV *)cv);
3976 else if (strEQ(s, "INIT") && !PL_error_count) {
3978 PL_initav = newAV();
3979 av_push(PL_initav, SvREFCNT_inc(cv));
3985 PL_copline = NOLINE;
3991 newCONSTSUB(HV *stash, char *name, SV *sv)
3994 U32 oldhints = PL_hints;
3995 HV *old_cop_stash = PL_curcop->cop_stash;
3996 HV *old_curstash = PL_curstash;
3997 line_t oldline = PL_curcop->cop_line;
3998 PL_curcop->cop_line = PL_copline;
4000 PL_hints &= ~HINT_BLOCK_SCOPE;
4002 PL_curstash = PL_curcop->cop_stash = stash;
4005 start_subparse(FALSE, 0),
4006 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4007 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4008 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4011 PL_hints = oldhints;
4012 PL_curcop->cop_stash = old_cop_stash;
4013 PL_curstash = old_curstash;
4014 PL_curcop->cop_line = oldline;
4018 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4021 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4024 if (cv = (name ? GvCV(gv) : Nullcv)) {
4026 /* just a cached method */
4030 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4031 /* already defined (or promised) */
4032 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4033 && HvNAME(GvSTASH(CvGV(cv)))
4034 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4035 line_t oldline = PL_curcop->cop_line;
4036 PL_curcop->cop_line = PL_copline;
4037 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4038 PL_curcop->cop_line = oldline;
4045 if (cv) /* must reuse cv if autoloaded */
4048 cv = (CV*)NEWSV(1105,0);
4049 sv_upgrade((SV *)cv, SVt_PVCV);
4053 PL_sub_generation++;
4056 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4058 New(666, CvMUTEXP(cv), 1, perl_mutex);
4059 MUTEX_INIT(CvMUTEXP(cv));
4061 #endif /* USE_THREADS */
4062 CvFILEGV(cv) = gv_fetchfile(filename);
4063 CvXSUB(cv) = subaddr;
4066 char *s = strrchr(name,':');
4071 if (strEQ(s, "BEGIN")) {
4073 PL_beginav = newAV();
4074 av_push(PL_beginav, (SV *)cv);
4077 else if (strEQ(s, "END")) {
4080 av_unshift(PL_endav, 1);
4081 av_store(PL_endav, 0, (SV *)cv);
4084 else if (strEQ(s, "INIT")) {
4086 PL_initav = newAV();
4087 av_push(PL_initav, (SV *)cv);
4098 newFORM(I32 floor, OP *o, OP *block)
4107 name = SvPVx(cSVOPo->op_sv, PL_na);
4110 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4112 if (cv = GvFORM(gv)) {
4113 if (ckWARN(WARN_REDEFINE)) {
4114 line_t oldline = PL_curcop->cop_line;
4116 PL_curcop->cop_line = PL_copline;
4117 warner(WARN_REDEFINE, "Format %s redefined",name);
4118 PL_curcop->cop_line = oldline;
4124 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4125 CvFILEGV(cv) = PL_curcop->cop_filegv;
4127 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4128 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4129 SvPADTMP_on(PL_curpad[ix]);
4132 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4133 CvSTART(cv) = LINKLIST(CvROOT(cv));
4134 CvROOT(cv)->op_next = 0;
4137 PL_copline = NOLINE;
4144 return newUNOP(OP_REFGEN, 0,
4145 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4151 return newUNOP(OP_REFGEN, 0,
4152 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4156 newANONSUB(I32 floor, OP *proto, OP *block)
4158 return newUNOP(OP_REFGEN, 0,
4159 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4165 switch (o->op_type) {
4167 o->op_type = OP_PADAV;
4168 o->op_ppaddr = ppaddr[OP_PADAV];
4169 return ref(o, OP_RV2AV);
4172 o->op_type = OP_RV2AV;
4173 o->op_ppaddr = ppaddr[OP_RV2AV];
4178 warn("oops: oopsAV");
4187 switch (o->op_type) {
4190 o->op_type = OP_PADHV;
4191 o->op_ppaddr = ppaddr[OP_PADHV];
4192 return ref(o, OP_RV2HV);
4196 o->op_type = OP_RV2HV;
4197 o->op_ppaddr = ppaddr[OP_RV2HV];
4202 warn("oops: oopsHV");
4211 if (o->op_type == OP_PADANY) {
4212 o->op_type = OP_PADAV;
4213 o->op_ppaddr = ppaddr[OP_PADAV];
4216 return newUNOP(OP_RV2AV, 0, scalar(o));
4220 newGVREF(I32 type, OP *o)
4222 if (type == OP_MAPSTART)
4223 return newUNOP(OP_NULL, 0, o);
4224 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4230 if (o->op_type == OP_PADANY) {
4231 o->op_type = OP_PADHV;
4232 o->op_ppaddr = ppaddr[OP_PADHV];
4235 return newUNOP(OP_RV2HV, 0, scalar(o));
4241 croak("NOT IMPL LINE %d",__LINE__);
4247 newCVREF(I32 flags, OP *o)
4249 return newUNOP(OP_RV2CV, flags, scalar(o));
4255 if (o->op_type == OP_PADANY) {
4256 o->op_type = OP_PADSV;
4257 o->op_ppaddr = ppaddr[OP_PADSV];
4260 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4261 o->op_flags |= OPpDONE_SVREF;
4264 return newUNOP(OP_RV2SV, 0, scalar(o));
4267 /* Check routines. */
4275 name = NEWSV(1106,0);
4276 sv_upgrade(name, SVt_PVNV);
4277 sv_setpvn(name, "&", 1);
4280 ix = pad_alloc(o->op_type, SVs_PADMY);
4281 av_store(PL_comppad_name, ix, name);
4282 av_store(PL_comppad, ix, cSVOPo->op_sv);
4283 SvPADMY_on(cSVOPo->op_sv);
4284 cSVOPo->op_sv = Nullsv;
4285 cSVOPo->op_targ = ix;
4292 o->op_private = PL_hints;
4299 if (cUNOPo->op_first->op_type == OP_CONCAT)
4300 o->op_flags |= OPf_STACKED;
4307 if (o->op_flags & OPf_KIDS) {
4310 OPCODE type = o->op_type;
4311 o = modkids(ck_fun(o), type);
4312 kid = cUNOPo->op_first;
4313 newop = kUNOP->op_first->op_sibling;
4315 (newop->op_sibling ||
4316 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4317 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4318 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4322 op_free(kUNOP->op_first);
4323 kUNOP->op_first = newop;
4325 o->op_ppaddr = ppaddr[++o->op_type];
4334 if (o->op_flags & OPf_KIDS) {
4335 OP *kid = cUNOPo->op_first;
4336 if (kid->op_type == OP_HSLICE)
4337 o->op_private |= OPpSLICE;
4338 else if (kid->op_type != OP_HELEM)
4339 croak("%s argument is not a HASH element or slice",
4340 op_desc[o->op_type]);
4349 I32 type = o->op_type;
4351 if (o->op_flags & OPf_KIDS) {
4352 if (cLISTOPo->op_first->op_type == OP_STUB) {
4354 o = newUNOP(type, OPf_SPECIAL,
4355 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4365 PL_hints |= HINT_BLOCK_SCOPE;
4366 if (o->op_flags & OPf_KIDS) {
4367 SVOP *kid = (SVOP*)cUNOPo->op_first;
4370 o->op_flags &= ~OPf_KIDS;
4373 else if (kid->op_type == OP_LINESEQ) {
4376 kid->op_next = o->op_next;
4377 cUNOPo->op_first = 0;
4380 Newz(1101, enter, 1, LOGOP);
4381 enter->op_type = OP_ENTERTRY;
4382 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4383 enter->op_private = 0;
4385 /* establish postfix order */
4386 enter->op_next = (OP*)enter;
4388 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4389 o->op_type = OP_LEAVETRY;
4390 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4391 enter->op_other = o;
4399 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4401 o->op_targ = (PADOFFSET)PL_hints;
4409 if (o->op_flags & OPf_STACKED) {
4411 kid = cUNOPo->op_first->op_sibling;
4412 if (kid->op_type == OP_RV2GV)
4424 if (o->op_flags & OPf_KIDS) {
4425 OP *kid = cUNOPo->op_first;
4426 if (kid->op_type != OP_HELEM)
4427 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4434 ck_gvconst(register OP *o)
4436 o = fold_constants(o);
4437 if (o->op_type == OP_CONST)
4443 ck_rvconst(register OP *o)
4446 SVOP *kid = (SVOP*)cUNOPo->op_first;
4448 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4449 if (kid->op_type == OP_CONST) {
4453 SV *kidsv = kid->op_sv;
4455 /* Is it a constant from cv_const_sv()? */
4456 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4457 SV *rsv = SvRV(kidsv);
4458 int svtype = SvTYPE(rsv);
4459 char *badtype = Nullch;
4461 switch (o->op_type) {
4463 if (svtype > SVt_PVMG)
4464 badtype = "a SCALAR";
4467 if (svtype != SVt_PVAV)
4468 badtype = "an ARRAY";
4471 if (svtype != SVt_PVHV) {
4472 if (svtype == SVt_PVAV) { /* pseudohash? */
4473 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4474 if (ksv && SvROK(*ksv)
4475 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4484 if (svtype != SVt_PVCV)
4489 croak("Constant is not %s reference", badtype);
4492 name = SvPV(kidsv, PL_na);
4493 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4494 char *badthing = Nullch;
4495 switch (o->op_type) {
4497 badthing = "a SCALAR";
4500 badthing = "an ARRAY";
4503 badthing = "a HASH";
4508 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4512 * This is a little tricky. We only want to add the symbol if we
4513 * didn't add it in the lexer. Otherwise we get duplicate strict
4514 * warnings. But if we didn't add it in the lexer, we must at
4515 * least pretend like we wanted to add it even if it existed before,
4516 * or we get possible typo warnings. OPpCONST_ENTERED says
4517 * whether the lexer already added THIS instance of this symbol.
4519 iscv = (o->op_type == OP_RV2CV) * 2;
4521 gv = gv_fetchpv(name,
4522 iscv | !(kid->op_private & OPpCONST_ENTERED),
4525 : o->op_type == OP_RV2SV
4527 : o->op_type == OP_RV2AV
4529 : o->op_type == OP_RV2HV
4532 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4534 kid->op_type = OP_GV;
4535 SvREFCNT_dec(kid->op_sv);
4536 kid->op_sv = SvREFCNT_inc(gv);
4546 I32 type = o->op_type;
4548 if (o->op_flags & OPf_REF)
4551 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4552 SVOP *kid = (SVOP*)cUNOPo->op_first;
4554 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4555 OP *newop = newGVOP(type, OPf_REF,
4556 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4563 if (type == OP_FTTTY)
4564 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4567 return newUNOP(type, 0, newDEFSVOP());
4580 int type = o->op_type;
4581 register I32 oa = opargs[type] >> OASHIFT;
4583 if (o->op_flags & OPf_STACKED) {
4584 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4587 return no_fh_allowed(o);
4590 if (o->op_flags & OPf_KIDS) {
4591 tokid = &cLISTOPo->op_first;
4592 kid = cLISTOPo->op_first;
4593 if (kid->op_type == OP_PUSHMARK ||
4594 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4596 tokid = &kid->op_sibling;
4597 kid = kid->op_sibling;
4599 if (!kid && opargs[type] & OA_DEFGV)
4600 *tokid = kid = newDEFSVOP();
4604 sibl = kid->op_sibling;
4618 if (kid->op_type == OP_CONST &&
4619 (kid->op_private & OPpCONST_BARE)) {
4620 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4621 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4622 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4623 if (ckWARN(WARN_SYNTAX))
4625 "Array @%s missing the @ in argument %ld of %s()",
4626 name, (long)numargs, op_desc[type]);
4629 kid->op_sibling = sibl;
4632 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4633 bad_type(numargs, "array", op_desc[o->op_type], kid);
4637 if (kid->op_type == OP_CONST &&
4638 (kid->op_private & OPpCONST_BARE)) {
4639 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4640 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4641 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4642 if (ckWARN(WARN_SYNTAX))
4644 "Hash %%%s missing the %% in argument %ld of %s()",
4645 name, (long)numargs, op_desc[type]);
4648 kid->op_sibling = sibl;
4651 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4652 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4657 OP *newop = newUNOP(OP_NULL, 0, kid);
4658 kid->op_sibling = 0;
4660 newop->op_next = newop;
4662 kid->op_sibling = sibl;
4667 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4668 if (kid->op_type == OP_CONST &&
4669 (kid->op_private & OPpCONST_BARE)) {
4670 OP *newop = newGVOP(OP_GV, 0,
4671 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4677 kid->op_sibling = 0;
4678 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4680 kid->op_sibling = sibl;
4686 mod(scalar(kid), type);
4690 tokid = &kid->op_sibling;
4691 kid = kid->op_sibling;
4693 o->op_private |= numargs;
4695 return too_many_arguments(o,op_desc[o->op_type]);
4698 else if (opargs[type] & OA_DEFGV) {
4700 return newUNOP(type, 0, newDEFSVOP());
4704 while (oa & OA_OPTIONAL)
4706 if (oa && oa != OA_LIST)
4707 return too_few_arguments(o,op_desc[o->op_type]);
4717 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4718 append_elem(OP_GLOB, o, newDEFSVOP());
4720 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4721 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4723 if (gv && GvIMPORTED_CV(gv)) {
4724 static int glob_index;
4726 append_elem(OP_GLOB, o,
4727 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4728 o->op_type = OP_LIST;
4729 o->op_ppaddr = ppaddr[OP_LIST];
4730 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4731 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4732 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4733 append_elem(OP_LIST, o,
4734 scalar(newUNOP(OP_RV2CV, 0,
4735 newGVOP(OP_GV, 0, gv)))));
4736 o = newUNOP(OP_NULL, 0, ck_subr(o));
4737 o->op_targ = OP_GLOB; /* hint at what it used to be */
4740 gv = newGVgen("main");
4742 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4752 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4754 o->op_ppaddr = ppaddr[OP_GREPSTART];
4755 Newz(1101, gwop, 1, LOGOP);
4757 if (o->op_flags & OPf_STACKED) {
4760 kid = cLISTOPo->op_first->op_sibling;
4761 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4764 kid->op_next = (OP*)gwop;
4765 o->op_flags &= ~OPf_STACKED;
4767 kid = cLISTOPo->op_first->op_sibling;
4768 if (type == OP_MAPWHILE)
4775 kid = cLISTOPo->op_first->op_sibling;
4776 if (kid->op_type != OP_NULL)
4777 croak("panic: ck_grep");
4778 kid = kUNOP->op_first;
4780 gwop->op_type = type;
4781 gwop->op_ppaddr = ppaddr[type];
4782 gwop->op_first = listkids(o);
4783 gwop->op_flags |= OPf_KIDS;
4784 gwop->op_private = 1;
4785 gwop->op_other = LINKLIST(kid);
4786 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4787 kid->op_next = (OP*)gwop;
4789 kid = cLISTOPo->op_first->op_sibling;
4790 if (!kid || !kid->op_sibling)
4791 return too_few_arguments(o,op_desc[o->op_type]);
4792 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4793 mod(kid, OP_GREPSTART);
4801 if (o->op_flags & OPf_KIDS) {
4802 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4804 kid = kid->op_sibling; /* get past "big" */
4805 if (kid && kid->op_type == OP_CONST)
4806 fbm_compile(((SVOP*)kid)->op_sv, 0);
4812 ck_lengthconst(OP *o)
4814 /* XXX length optimization goes here */
4821 OPCODE type = o->op_type;
4822 return modkids(ck_fun(o), type);
4828 OPCODE type = o->op_type;
4829 return refkids(ck_fun(o), type);
4837 kid = cLISTOPo->op_first;
4840 kid = cLISTOPo->op_first;
4842 if (kid->op_type == OP_PUSHMARK)
4843 kid = kid->op_sibling;
4844 if (kid && o->op_flags & OPf_STACKED)
4845 kid = kid->op_sibling;
4846 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4847 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4848 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4849 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4850 cLISTOPo->op_first->op_sibling = kid;
4851 cLISTOPo->op_last = kid;
4852 kid = kid->op_sibling;
4857 append_elem(o->op_type, o, newDEFSVOP());
4863 if (PL_hints & HINT_LOCALE)
4864 o->op_private |= OPpLOCALE;
4871 ck_fun_locale(OP *o)
4877 if (PL_hints & HINT_LOCALE)
4878 o->op_private |= OPpLOCALE;
4889 if (PL_hints & HINT_LOCALE)
4890 o->op_private |= OPpLOCALE;
4899 o->op_private |= OPpRUNTIME;
4912 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4913 o->op_private |= OPpREPEAT_DOLIST;
4914 cBINOPo->op_first = force_list(cBINOPo->op_first);
4924 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4925 SVOP *kid = (SVOP*)cUNOPo->op_first;
4927 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4929 for (s = SvPVX(kid->op_sv); *s; s++) {
4930 if (*s == ':' && s[1] == ':') {
4932 Move(s+2, s+1, strlen(s+2)+1, char);
4933 --SvCUR(kid->op_sv);
4936 sv_catpvn(kid->op_sv, ".pm", 3);
4945 croak("NOT IMPL LINE %d",__LINE__);
4954 if (o->op_flags & OPf_KIDS) {
4955 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4956 if (kid && kid->op_sibling) {
4957 o->op_type = OP_SSELECT;
4958 o->op_ppaddr = ppaddr[OP_SSELECT];
4960 return fold_constants(o);
4964 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4965 if (kid && kid->op_type == OP_RV2GV)
4966 kid->op_private &= ~HINT_STRICT_REFS;
4973 I32 type = o->op_type;
4975 if (!(o->op_flags & OPf_KIDS)) {
4980 if (!CvUNIQUE(PL_compcv)) {
4981 argop = newOP(OP_PADAV, OPf_REF);
4982 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4985 argop = newUNOP(OP_RV2AV, 0,
4986 scalar(newGVOP(OP_GV, 0,
4987 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4990 argop = newUNOP(OP_RV2AV, 0,
4991 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4992 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4993 #endif /* USE_THREADS */
4994 return newUNOP(type, 0, scalar(argop));
4996 return scalar(modkids(ck_fun(o), type));
5004 if (PL_hints & HINT_LOCALE)
5005 o->op_private |= OPpLOCALE;
5008 if (o->op_flags & OPf_STACKED) {
5009 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5011 kid = kUNOP->op_first; /* get past rv2gv */
5013 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5015 if (kid->op_type == OP_SCOPE) {
5019 else if (kid->op_type == OP_LEAVE) {
5020 if (o->op_type == OP_SORT) {
5021 null(kid); /* wipe out leave */
5024 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5025 if (k->op_next == kid)
5030 kid->op_next = 0; /* just disconnect the leave */
5031 k = kLISTOP->op_first;
5035 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5036 null(kid); /* wipe out rv2gv */
5037 if (o->op_type == OP_SORT)
5041 o->op_flags |= OPf_SPECIAL;
5053 if (o->op_flags & OPf_STACKED)
5054 return no_fh_allowed(o);
5056 kid = cLISTOPo->op_first;
5057 if (kid->op_type != OP_NULL)
5058 croak("panic: ck_split");
5059 kid = kid->op_sibling;
5060 op_free(cLISTOPo->op_first);
5061 cLISTOPo->op_first = kid;
5063 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5064 cLISTOPo->op_last = kid; /* There was only one element previously */
5067 if (kid->op_type != OP_MATCH) {
5068 OP *sibl = kid->op_sibling;
5069 kid->op_sibling = 0;
5070 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5071 if (cLISTOPo->op_first == cLISTOPo->op_last)
5072 cLISTOPo->op_last = kid;
5073 cLISTOPo->op_first = kid;
5074 kid->op_sibling = sibl;
5077 kid->op_type = OP_PUSHRE;
5078 kid->op_ppaddr = ppaddr[OP_PUSHRE];
5081 if (!kid->op_sibling)
5082 append_elem(OP_SPLIT, o, newDEFSVOP());
5084 kid = kid->op_sibling;
5087 if (!kid->op_sibling)
5088 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5090 kid = kid->op_sibling;
5093 if (kid->op_sibling)
5094 return too_many_arguments(o,op_desc[o->op_type]);
5103 OP *prev = ((cUNOPo->op_first->op_sibling)
5104 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5105 OP *o2 = prev->op_sibling;
5113 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5114 if (cvop->op_type == OP_RV2CV) {
5116 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5117 null(cvop); /* disable rv2cv */
5118 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5119 if (tmpop->op_type == OP_GV) {
5120 cv = GvCVu(tmpop->op_sv);
5121 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5122 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5123 proto = SvPV((SV*)cv, PL_na);
5127 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5128 if (PERLDB_SUB && PL_curstash != PL_debstash)
5129 o->op_private |= OPpENTERSUB_DB;
5130 while (o2 != cvop) {
5134 return too_many_arguments(o, gv_ename(namegv));
5152 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5153 bad_type(arg, "block", gv_ename(namegv), o2);
5158 if (o2->op_type == OP_RV2GV)
5162 OP* sib = kid->op_sibling;
5163 kid->op_sibling = 0;
5164 o2 = newUNOP(OP_RV2GV, 0, kid);
5165 o2->op_sibling = sib;
5166 prev->op_sibling = o2;
5174 if (o2->op_type != OP_RV2GV)
5175 bad_type(arg, "symbol", gv_ename(namegv), o2);
5178 if (o2->op_type != OP_RV2CV)
5179 bad_type(arg, "sub", gv_ename(namegv), o2);
5182 if (o2->op_type != OP_RV2SV
5183 && o2->op_type != OP_PADSV
5184 && o2->op_type != OP_THREADSV)
5186 bad_type(arg, "scalar", gv_ename(namegv), o2);
5190 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5191 bad_type(arg, "array", gv_ename(namegv), o2);
5194 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5195 bad_type(arg, "hash", gv_ename(namegv), o2);
5199 OP* sib = kid->op_sibling;
5200 kid->op_sibling = 0;
5201 o2 = newUNOP(OP_REFGEN, 0, kid);
5202 o2->op_sibling = sib;
5203 prev->op_sibling = o2;
5214 croak("Malformed prototype for %s: %s",
5215 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5220 mod(o2, OP_ENTERSUB);
5222 o2 = o2->op_sibling;
5224 if (proto && !optional &&
5225 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5226 return too_few_arguments(o, gv_ename(namegv));
5233 SvREADONLY_on(cSVOPo->op_sv);
5240 if (o->op_flags & OPf_KIDS) {
5241 SVOP *kid = (SVOP*)cUNOPo->op_first;
5243 if (kid->op_type == OP_NULL)
5244 kid = (SVOP*)kid->op_sibling;
5246 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5247 o->op_flags |= OPf_SPECIAL;
5252 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5255 peep(register OP *o)
5258 register OP* oldop = 0;
5259 if (!o || o->op_seq)
5263 SAVESPTR(PL_curcop);
5264 for (; o; o = o->op_next) {
5270 switch (o->op_type) {
5273 PL_curcop = ((COP*)o); /* for warnings */
5274 o->op_seq = PL_op_seqmax++;
5285 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5287 o->op_seq = PL_op_seqmax++;
5290 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5291 o->op_seq = PL_op_seqmax++;
5292 break; /* Scalar stub must produce undef. List stub is noop */
5296 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5297 PL_curcop = ((COP*)o);
5303 if (oldop && o->op_next) {
5304 oldop->op_next = o->op_next;
5307 o->op_seq = PL_op_seqmax++;
5311 if (o->op_next->op_type == OP_RV2SV) {
5312 if (!(o->op_next->op_private & OPpDEREF)) {
5314 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5315 o->op_next = o->op_next->op_next;
5316 o->op_type = OP_GVSV;
5317 o->op_ppaddr = ppaddr[OP_GVSV];
5320 else if (o->op_next->op_type == OP_RV2AV) {
5321 OP* pop = o->op_next->op_next;
5323 if (pop->op_type == OP_CONST &&
5324 (PL_op = pop->op_next) &&
5325 pop->op_next->op_type == OP_AELEM &&
5326 !(pop->op_next->op_private &
5327 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5328 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5332 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5336 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5337 o->op_next = pop->op_next->op_next;
5338 o->op_type = OP_AELEMFAST;
5339 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5340 o->op_private = (U8)i;
5341 GvAVn(((GVOP*)o)->op_gv);
5344 o->op_seq = PL_op_seqmax++;
5351 o->op_seq = PL_op_seqmax++;
5352 while (cLOGOP->op_other->op_type == OP_NULL)
5353 cLOGOP->op_other = cLOGOP->op_other->op_next;
5354 peep(cLOGOP->op_other);
5358 o->op_seq = PL_op_seqmax++;
5359 peep(cCONDOP->op_true);
5360 peep(cCONDOP->op_false);
5364 o->op_seq = PL_op_seqmax++;
5365 peep(cLOOP->op_redoop);
5366 peep(cLOOP->op_nextop);
5367 peep(cLOOP->op_lastop);
5373 o->op_seq = PL_op_seqmax++;
5374 peep(cPMOP->op_pmreplstart);
5378 o->op_seq = PL_op_seqmax++;
5379 if (ckWARN(WARN_SYNTAX) && o->op_next
5380 && o->op_next->op_type == OP_NEXTSTATE) {
5381 if (o->op_next->op_sibling &&
5382 o->op_next->op_sibling->op_type != OP_EXIT &&
5383 o->op_next->op_sibling->op_type != OP_WARN &&
5384 o->op_next->op_sibling->op_type != OP_DIE) {
5385 line_t oldline = PL_curcop->cop_line;
5387 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5388 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5389 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5390 PL_curcop->cop_line = oldline;
5404 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5405 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5407 rop = (UNOP*)((BINOP*)o)->op_first;
5408 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5410 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5411 if (!SvOBJECT(lexname))
5413 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5414 if (!fields || !GvHV(*fields))
5416 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5417 key = SvPV(*svp, keylen);
5418 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5420 croak("No such field \"%s\" in variable %s of type %s",
5421 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5423 ind = SvIV(*indsvp);
5425 croak("Bad index while coercing array into hash");
5426 rop->op_type = OP_RV2AV;
5427 rop->op_ppaddr = ppaddr[OP_RV2AV];
5428 o->op_type = OP_AELEM;
5429 o->op_ppaddr = ppaddr[OP_AELEM];
5431 *svp = newSViv(ind);
5436 o->op_seq = PL_op_seqmax++;