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 static bool scalar_mod_type _((OP *o, I32 type));
40 static I32 list_assignment _((OP *o));
41 static void bad_type _((I32 n, char *t, char *name, OP *kid));
42 static OP *modkids _((OP *o, I32 type));
43 static OP *no_fh_allowed _((OP *o));
44 static OP *scalarboolean _((OP *o));
45 static OP *too_few_arguments _((OP *o, char* name));
46 static OP *too_many_arguments _((OP *o, char* name));
47 static void null _((OP* o));
48 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
49 CV* startcv, I32 cx_ix));
50 static OP *newDEFSVOP _((void));
51 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
57 SV* tmpsv = sv_newmortal();
58 gv_efullname3(tmpsv, gv, Nullch);
59 return SvPV(tmpsv,PL_na);
65 yyerror(form("Missing comma after first argument to %s function",
66 op_desc[o->op_type]));
71 too_few_arguments(OP *o, char *name)
73 yyerror(form("Not enough arguments for %s", name));
78 too_many_arguments(OP *o, char *name)
80 yyerror(form("Too many arguments for %s", name));
85 bad_type(I32 n, char *t, char *name, OP *kid)
87 yyerror(form("Type of arg %d to %s must be %s (not %s)",
88 (int)n, name, t, op_desc[kid->op_type]));
94 int type = o->op_type;
95 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
96 yyerror(form("Can't use subscript on %s", op_desc[type]));
97 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
100 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
101 type == OP_ENTERSUB ? '&' : '%'));
105 sv_catsv(GvSV(PL_errgv), msg);
107 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
112 /* "register" allocation */
115 pad_allocmy(char *name)
121 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
122 if (!isPRINT(name[1])) {
124 name[2] = toCTRL(name[1]);
127 croak("Can't use global %s in \"my\"",name);
129 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
130 SV **svp = AvARRAY(PL_comppad_name);
131 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
133 && sv != &PL_sv_undef
134 && strEQ(name, SvPVX(sv)))
137 "\"my\" variable %s masks earlier declaration in same %s",
138 name, (SvIVX(sv) == 999999999 ? "scope" : "statement"));
143 off = pad_alloc(OP_PADSV, SVs_PADMY);
145 sv_upgrade(sv, SVt_PVNV);
147 if (PL_in_my_stash) {
149 croak("Can't declare class for non-scalar %s in \"my\"",name);
151 (void)SvUPGRADE(sv, SVt_PVMG);
152 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
155 av_store(PL_comppad_name, off, sv);
156 SvNVX(sv) = (double)999999999;
157 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
158 if (!PL_min_intro_pending)
159 PL_min_intro_pending = off;
160 PL_max_intro_pending = off;
162 av_store(PL_comppad, off, (SV*)newAV());
163 else if (*name == '%')
164 av_store(PL_comppad, off, (SV*)newHV());
165 SvPADMY_on(PL_curpad[off]);
170 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix)
177 register PERL_CONTEXT *cx;
180 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
181 AV *curlist = CvPADLIST(cv);
182 SV **svp = av_fetch(curlist, 0, FALSE);
185 if (!svp || *svp == &PL_sv_undef)
188 svp = AvARRAY(curname);
189 for (off = AvFILLp(curname); off > 0; off--) {
190 if ((sv = svp[off]) &&
191 sv != &PL_sv_undef &&
193 seq > I_32(SvNVX(sv)) &&
194 strEQ(SvPVX(sv), name))
205 return 0; /* don't clone from inactive stack frame */
209 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
210 oldsv = *av_fetch(oldpad, off, TRUE);
211 if (!newoff) { /* Not a mere clone operation. */
212 SV *namesv = NEWSV(1103,0);
213 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
214 sv_upgrade(namesv, SVt_PVNV);
215 sv_setpv(namesv, name);
216 av_store(PL_comppad_name, newoff, namesv);
217 SvNVX(namesv) = (double)PL_curcop->cop_seq;
218 SvIVX(namesv) = 999999999; /* A ref, intro immediately */
219 SvFAKE_on(namesv); /* A ref, not a real var */
220 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
221 /* "It's closures all the way down." */
222 CvCLONE_on(PL_compcv);
224 if (CvANON(PL_compcv))
225 oldsv = Nullsv; /* no need to keep ref */
230 bcv && bcv != cv && !CvCLONE(bcv);
231 bcv = CvOUTSIDE(bcv)) {
235 if (ckWARN(WARN_CLOSURE) && !CvUNIQUE(cv))
237 "Variable \"%s\" may be unavailable",
244 else if (!CvUNIQUE(PL_compcv)) {
245 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
247 "Variable \"%s\" will not stay shared", name);
250 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
256 /* Nothing in current lexical context--try eval's context, if any.
257 * This is necessary to let the perldb get at lexically scoped variables.
258 * XXX This will also probably interact badly with eval tree caching.
262 for (i = cx_ix; i >= 0; i--) {
264 switch (cx->cx_type) {
266 if (i == 0 && saweval) {
267 seq = cxstack[saweval].blk_oldcop->cop_seq;
268 return pad_findlex(name, newoff, seq, PL_main_cv, 0);
272 switch (cx->blk_eval.old_op_type) {
277 /* require must have its own scope */
285 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
286 saweval = i; /* so we know where we were called from */
289 seq = cxstack[saweval].blk_oldcop->cop_seq;
290 return pad_findlex(name, newoff, seq, cv, i-1);
298 pad_findmy(char *name)
304 SV **svp = AvARRAY(PL_comppad_name);
305 U32 seq = PL_cop_seqmax;
309 * Special case to get lexical (and hence per-thread) @_.
310 * XXX I need to find out how to tell at parse-time whether use
311 * of @_ should refer to a lexical (from a sub) or defgv (global
312 * scope and maybe weird sub-ish things like formats). See
313 * startsub in perly.y. It's possible that @_ could be lexical
314 * (at least from subs) even in non-threaded perl.
316 if (strEQ(name, "@_"))
317 return 0; /* success. (NOT_IN_PAD indicates failure) */
318 #endif /* USE_THREADS */
320 /* The one we're looking for is probably just before comppad_name_fill. */
321 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
322 if ((sv = svp[off]) &&
323 sv != &PL_sv_undef &&
326 seq > I_32(SvNVX(sv)))) &&
327 strEQ(SvPVX(sv), name))
330 return (PADOFFSET)off;
331 pendoff = off; /* this pending def. will override import */
335 /* See if it's in a nested scope */
336 off = pad_findlex(name, 0, seq, CvOUTSIDE(PL_compcv), cxstack_ix);
338 /* If there is a pending local definition, this new alias must die */
340 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
341 return off; /* pad_findlex returns 0 for failure...*/
343 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
347 pad_leavemy(I32 fill)
350 SV **svp = AvARRAY(PL_comppad_name);
352 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
353 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
354 if ((sv = svp[off]) && sv != &PL_sv_undef)
355 warn("%s never introduced", SvPVX(sv));
358 /* "Deintroduce" my variables that are leaving with this scope. */
359 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
360 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == 999999999)
361 SvIVX(sv) = PL_cop_seqmax;
366 pad_alloc(I32 optype, U32 tmptype)
372 if (AvARRAY(PL_comppad) != PL_curpad)
373 croak("panic: pad_alloc");
374 if (PL_pad_reset_pending)
376 if (tmptype & SVs_PADMY) {
378 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
379 } while (SvPADBUSY(sv)); /* need a fresh one */
380 retval = AvFILLp(PL_comppad);
383 SV **names = AvARRAY(PL_comppad_name);
384 SSize_t names_fill = AvFILLp(PL_comppad_name);
387 * "foreach" index vars temporarily become aliases to non-"my"
388 * values. Thus we must skip, not just pad values that are
389 * marked as current pad values, but also those with names.
391 if (++PL_padix <= names_fill &&
392 (sv = names[PL_padix]) && sv != &PL_sv_undef)
394 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
395 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
400 SvFLAGS(sv) |= tmptype;
401 PL_curpad = AvARRAY(PL_comppad);
403 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
404 (unsigned long) thr, (unsigned long) PL_curpad,
405 (long) retval, op_name[optype]));
407 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
408 (unsigned long) PL_curpad,
409 (long) retval, op_name[optype]));
410 #endif /* USE_THREADS */
411 return (PADOFFSET)retval;
419 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
420 (unsigned long) thr, (unsigned long) PL_curpad, po));
423 croak("panic: pad_sv po");
424 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
425 (unsigned long) PL_curpad, po));
426 #endif /* USE_THREADS */
427 return PL_curpad[po]; /* eventually we'll turn this into a macro */
431 pad_free(PADOFFSET po)
436 if (AvARRAY(PL_comppad) != PL_curpad)
437 croak("panic: pad_free curpad");
439 croak("panic: pad_free po");
441 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
442 (unsigned long) thr, (unsigned long) PL_curpad, po));
444 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
445 (unsigned long) PL_curpad, po));
446 #endif /* USE_THREADS */
447 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
448 SvPADTMP_off(PL_curpad[po]);
449 if ((I32)po < PL_padix)
454 pad_swipe(PADOFFSET po)
457 if (AvARRAY(PL_comppad) != PL_curpad)
458 croak("panic: pad_swipe curpad");
460 croak("panic: pad_swipe po");
462 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
463 (unsigned long) thr, (unsigned long) PL_curpad, po));
465 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
466 (unsigned long) PL_curpad, po));
467 #endif /* USE_THREADS */
468 SvPADTMP_off(PL_curpad[po]);
469 PL_curpad[po] = NEWSV(1107,0);
470 SvPADTMP_on(PL_curpad[po]);
471 if ((I32)po < PL_padix)
475 /* XXX pad_reset() is currently disabled because it results in serious bugs.
476 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
477 * on the stack by OPs that use them, there are several ways to get an alias
478 * to a shared TARG. Such an alias will change randomly and unpredictably.
479 * We avoid doing this until we can think of a Better Way.
484 #ifdef USE_BROKEN_PAD_RESET
488 if (AvARRAY(PL_comppad) != PL_curpad)
489 croak("panic: pad_reset curpad");
491 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
492 (unsigned long) thr, (unsigned long) PL_curpad));
494 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
495 (unsigned long) PL_curpad));
496 #endif /* USE_THREADS */
497 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
498 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
499 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
500 SvPADTMP_off(PL_curpad[po]);
502 PL_padix = PL_padix_floor;
505 PL_pad_reset_pending = FALSE;
509 /* find_threadsv is not reentrant */
511 find_threadsv(char *name)
517 /* We currently only handle names of a single character */
518 p = strchr(PL_threadsv_names, *name);
521 key = p - PL_threadsv_names;
522 svp = av_fetch(thr->threadsv, key, FALSE);
524 SV *sv = NEWSV(0, 0);
525 av_store(thr->threadsv, key, sv);
526 thr->threadsvp = AvARRAY(thr->threadsv);
528 * Some magic variables used to be automagically initialised
529 * in gv_fetchpv. Those which are now per-thread magicals get
530 * initialised here instead.
536 sv_setpv(sv, "\034");
537 sv_magic(sv, 0, 0, name, 1);
542 PL_sawampersand = TRUE;
546 /* XXX %! tied to Errno.pm needs to be added here.
547 * See gv_fetchpv(). */
551 sv_magic(sv, 0, 0, name, 1);
553 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
554 "find_threadsv: new SV %p for $%s%c\n",
555 sv, (*name < 32) ? "^" : "",
556 (*name < 32) ? toCTRL(*name) : *name));
560 #endif /* USE_THREADS */
567 register OP *kid, *nextkid;
569 if (!o || o->op_seq == (U16)-1)
572 if (o->op_flags & OPf_KIDS) {
573 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
574 nextkid = kid->op_sibling; /* Get before next freeing kid */
579 switch (o->op_type) {
581 o->op_targ = 0; /* Was holding old type, if any. */
584 o->op_targ = 0; /* Was holding hints. */
588 if (!(o->op_flags & OPf_SPECIAL))
592 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
594 #endif /* USE_THREADS */
596 if (!(o->op_flags & OPf_REF)
597 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
603 SvREFCNT_dec(cGVOPo->op_gv);
607 Safefree(cCOPo->cop_label);
608 SvREFCNT_dec(cCOPo->cop_filegv);
609 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
610 SvREFCNT_dec(cCOPo->cop_warnings);
613 SvREFCNT_dec(cSVOPo->op_sv);
619 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
623 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
624 SvREFCNT_dec(cSVOPo->op_sv);
626 Safefree(cPVOPo->op_pv);
629 op_free(cPMOPo->op_pmreplroot);
634 ReREFCNT_dec(cPMOPo->op_pmregexp);
639 pad_free(o->op_targ);
647 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
648 pad_free(o->op_targ);
649 o->op_targ = o->op_type;
650 o->op_type = OP_NULL;
651 o->op_ppaddr = ppaddr[OP_NULL];
654 /* Contextualizers */
656 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
666 /* establish postfix order */
667 if (cUNOPo->op_first) {
668 o->op_next = LINKLIST(cUNOPo->op_first);
669 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
671 kid->op_next = LINKLIST(kid->op_sibling);
686 if (o && o->op_flags & OPf_KIDS) {
687 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
696 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
698 if (ckWARN(WARN_SYNTAX)) {
699 line_t oldline = PL_curcop->cop_line;
701 if (PL_copline != NOLINE)
702 PL_curcop->cop_line = PL_copline;
703 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
704 PL_curcop->cop_line = oldline;
715 /* assumes no premature commitment */
716 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
717 || o->op_type == OP_RETURN)
720 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
722 switch (o->op_type) {
724 if (o->op_private & OPpREPEAT_DOLIST)
725 null(((LISTOP*)cBINOPo->op_first)->op_first);
726 scalar(cBINOPo->op_first);
731 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
735 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
736 if (!kPMOP->op_pmreplroot)
737 deprecate("implicit split to @_");
745 if (o->op_flags & OPf_KIDS) {
746 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
752 kid = cLISTOPo->op_first;
754 while (kid = kid->op_sibling) {
760 WITH_THR(PL_curcop = &PL_compiling);
765 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
771 WITH_THR(PL_curcop = &PL_compiling);
784 /* assumes no premature commitment */
785 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
786 || o->op_type == OP_RETURN)
789 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
791 switch (o->op_type) {
793 if (!(opargs[o->op_type] & OA_FOLDCONST))
797 if (o->op_flags & OPf_STACKED)
801 if (o->op_private == 4)
872 if (!(o->op_private & OPpLVAL_INTRO))
873 useless = op_desc[o->op_type];
880 if (!(o->op_private & OPpLVAL_INTRO) &&
881 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
882 useless = "a variable";
887 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
894 if (ckWARN(WARN_VOID)) {
895 useless = "a constant";
896 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
898 else if (SvPOK(sv)) {
899 if (strnEQ(SvPVX(sv), "di", 2) ||
900 strnEQ(SvPVX(sv), "ds", 2) ||
901 strnEQ(SvPVX(sv), "ig", 2))
906 null(o); /* don't execute a constant */
907 SvREFCNT_dec(sv); /* don't even remember it */
911 o->op_type = OP_PREINC; /* pre-increment is faster */
912 o->op_ppaddr = ppaddr[OP_PREINC];
916 o->op_type = OP_PREDEC; /* pre-decrement is faster */
917 o->op_ppaddr = ppaddr[OP_PREDEC];
923 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
928 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
929 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
930 if (o->op_flags & OPf_STACKED)
936 if (!(o->op_flags & OPf_KIDS))
945 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
952 /* all requires must return a boolean value */
953 o->op_flags &= ~OPf_WANT;
956 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
957 if (!kPMOP->op_pmreplroot)
958 deprecate("implicit split to @_");
964 if (ckWARN(WARN_VOID))
965 warner(WARN_VOID, "Useless use of %s in void context", useless);
974 if (o && o->op_flags & OPf_KIDS) {
975 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
986 /* assumes no premature commitment */
987 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
988 || o->op_type == OP_RETURN)
991 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
993 switch (o->op_type) {
996 list(cBINOPo->op_first);
1001 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1009 if (!(o->op_flags & OPf_KIDS))
1011 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1012 list(cBINOPo->op_first);
1013 return gen_constant_list(o);
1020 kid = cLISTOPo->op_first;
1022 while (kid = kid->op_sibling) {
1023 if (kid->op_sibling)
1028 WITH_THR(PL_curcop = &PL_compiling);
1032 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1033 if (kid->op_sibling)
1038 WITH_THR(PL_curcop = &PL_compiling);
1041 /* all requires must return a boolean value */
1042 o->op_flags &= ~OPf_WANT;
1054 if (o->op_type == OP_LINESEQ ||
1055 o->op_type == OP_SCOPE ||
1056 o->op_type == OP_LEAVE ||
1057 o->op_type == OP_LEAVETRY)
1060 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1061 if (kid->op_sibling) {
1065 PL_curcop = &PL_compiling;
1067 o->op_flags &= ~OPf_PARENS;
1068 if (PL_hints & HINT_BLOCK_SCOPE)
1069 o->op_flags |= OPf_PARENS;
1072 o = newOP(OP_STUB, 0);
1077 modkids(OP *o, I32 type)
1080 if (o && o->op_flags & OPf_KIDS) {
1081 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1088 mod(OP *o, I32 type)
1094 if (!o || PL_error_count)
1097 switch (o->op_type) {
1102 if (!(o->op_private & (OPpCONST_ARYBASE)))
1104 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1105 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1109 SAVEI32(PL_compiling.cop_arybase);
1110 PL_compiling.cop_arybase = 0;
1112 else if (type == OP_REFGEN)
1115 croak("That use of $[ is unsupported");
1118 if (o->op_flags & OPf_PARENS)
1122 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1123 !(o->op_flags & OPf_STACKED)) {
1124 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1125 o->op_ppaddr = ppaddr[OP_RV2CV];
1126 assert(cUNOPo->op_first->op_type == OP_NULL);
1127 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1133 /* grep, foreach, subcalls, refgen */
1134 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1136 yyerror(form("Can't modify %s in %s",
1137 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1138 ? "do block" : op_desc[o->op_type]),
1139 type ? op_desc[type] : "local"));
1153 case OP_RIGHT_SHIFT:
1162 if (!(o->op_flags & OPf_STACKED))
1168 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1174 if (!type && cUNOPo->op_first->op_type != OP_GV)
1175 croak("Can't localize through a reference");
1176 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1177 PL_modcount = 10000;
1178 return o; /* Treat \(@foo) like ordinary list. */
1182 if (scalar_mod_type(o, type))
1184 ref(cUNOPo->op_first, o->op_type);
1193 PL_modcount = 10000;
1196 if (!type && cUNOPo->op_first->op_type != OP_GV)
1197 croak("Can't localize through a reference");
1198 ref(cUNOPo->op_first, o->op_type);
1202 PL_hints |= HINT_BLOCK_SCOPE;
1210 PL_modcount = 10000;
1211 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1212 return o; /* Treat \(@foo) like ordinary list. */
1213 if (scalar_mod_type(o, type))
1219 croak("Can't localize lexical variable %s",
1220 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1225 PL_modcount++; /* XXX ??? */
1227 #endif /* USE_THREADS */
1233 if (type != OP_SASSIGN)
1237 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1243 pad_free(o->op_targ);
1244 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1245 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1246 if (o->op_flags & OPf_KIDS)
1247 mod(cBINOPo->op_first->op_sibling, type);
1252 ref(cBINOPo->op_first, o->op_type);
1253 if (type == OP_ENTERSUB &&
1254 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1255 o->op_private |= OPpLVAL_DEFER;
1262 if (o->op_flags & OPf_KIDS)
1263 mod(cLISTOPo->op_last, type);
1267 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1269 else if (!(o->op_flags & OPf_KIDS))
1271 if (o->op_targ != OP_LIST) {
1272 mod(cBINOPo->op_first, type);
1277 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1281 o->op_flags |= OPf_MOD;
1283 if (type == OP_AASSIGN || type == OP_SASSIGN)
1284 o->op_flags |= OPf_SPECIAL|OPf_REF;
1286 o->op_private |= OPpLVAL_INTRO;
1287 o->op_flags &= ~OPf_SPECIAL;
1288 PL_hints |= HINT_BLOCK_SCOPE;
1290 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1291 o->op_flags |= OPf_REF;
1296 scalar_mod_type(OP *o, I32 type)
1300 if (o->op_type == OP_RV2GV)
1324 case OP_RIGHT_SHIFT:
1334 case OP_ANDASSIGN: /* may work later */
1335 case OP_ORASSIGN: /* may work later */
1343 refkids(OP *o, I32 type)
1346 if (o && o->op_flags & OPf_KIDS) {
1347 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1354 ref(OP *o, I32 type)
1358 if (!o || PL_error_count)
1361 switch (o->op_type) {
1363 if ((type == OP_DEFINED || type == OP_LOCK) &&
1364 !(o->op_flags & OPf_STACKED)) {
1365 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1366 o->op_ppaddr = ppaddr[OP_RV2CV];
1367 assert(cUNOPo->op_first->op_type == OP_NULL);
1368 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1369 o->op_flags |= OPf_SPECIAL;
1374 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1378 ref(cUNOPo->op_first, o->op_type);
1381 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1382 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1383 : type == OP_RV2HV ? OPpDEREF_HV
1385 o->op_flags |= OPf_MOD;
1390 o->op_flags |= OPf_MOD; /* XXX ??? */
1395 o->op_flags |= OPf_REF;
1398 ref(cUNOPo->op_first, o->op_type);
1403 o->op_flags |= OPf_REF;
1408 if (!(o->op_flags & OPf_KIDS))
1410 ref(cBINOPo->op_first, type);
1414 ref(cBINOPo->op_first, o->op_type);
1415 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1416 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1417 : type == OP_RV2HV ? OPpDEREF_HV
1419 o->op_flags |= OPf_MOD;
1427 if (!(o->op_flags & OPf_KIDS))
1429 ref(cLISTOPo->op_last, type);
1444 if (!o || PL_error_count)
1448 if (type == OP_LIST) {
1449 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1451 } else if (type == OP_UNDEF) {
1453 } else if (type != OP_PADSV &&
1456 type != OP_PUSHMARK)
1458 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1461 o->op_flags |= OPf_MOD;
1462 o->op_private |= OPpLVAL_INTRO;
1470 o->op_flags |= OPf_PARENS;
1475 bind_match(I32 type, OP *left, OP *right)
1480 if (ckWARN(WARN_UNSAFE) &&
1481 (left->op_type == OP_RV2AV ||
1482 left->op_type == OP_RV2HV ||
1483 left->op_type == OP_PADAV ||
1484 left->op_type == OP_PADHV)) {
1485 char *desc = op_desc[(right->op_type == OP_SUBST ||
1486 right->op_type == OP_TRANS)
1487 ? right->op_type : OP_MATCH];
1488 char *sample = ((left->op_type == OP_RV2AV ||
1489 left->op_type == OP_PADAV)
1490 ? "@array" : "%hash");
1492 "Applying %s to %s will act on scalar(%s)",
1493 desc, sample, sample);
1496 if (right->op_type == OP_MATCH ||
1497 right->op_type == OP_SUBST ||
1498 right->op_type == OP_TRANS) {
1499 right->op_flags |= OPf_STACKED;
1500 if (right->op_type != OP_MATCH)
1501 left = mod(left, right->op_type);
1502 if (right->op_type == OP_TRANS)
1503 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1505 o = prepend_elem(right->op_type, scalar(left), right);
1507 return newUNOP(OP_NOT, 0, scalar(o));
1511 return bind_match(type, left,
1512 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1520 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1521 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1528 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1529 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1530 o->op_type = OP_LEAVE;
1531 o->op_ppaddr = ppaddr[OP_LEAVE];
1534 if (o->op_type == OP_LINESEQ) {
1536 o->op_type = OP_SCOPE;
1537 o->op_ppaddr = ppaddr[OP_SCOPE];
1538 kid = ((LISTOP*)o)->op_first;
1539 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1540 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1545 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1555 SAVESPTR(GvHV(PL_hintgv));
1556 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1557 SAVEFREESV(GvHV(PL_hintgv));
1561 block_start(int full)
1564 int retval = PL_savestack_ix;
1566 SAVEI32(PL_comppad_name_floor);
1568 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1569 PL_comppad_name_floor = PL_comppad_name_fill;
1571 PL_comppad_name_floor = 0;
1573 SAVEI32(PL_min_intro_pending);
1574 SAVEI32(PL_max_intro_pending);
1575 PL_min_intro_pending = 0;
1576 SAVEI32(PL_comppad_name_fill);
1577 SAVEI32(PL_padix_floor);
1578 PL_padix_floor = PL_padix;
1579 PL_pad_reset_pending = FALSE;
1581 PL_hints &= ~HINT_BLOCK_SCOPE;
1582 SAVEPPTR(compiling.cop_warnings);
1583 if (PL_compiling.cop_warnings != WARN_ALL &&
1584 PL_compiling.cop_warnings != WARN_NONE) {
1585 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1586 SAVEFREESV(PL_compiling.cop_warnings) ;
1594 block_end(I32 floor, OP *seq)
1597 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1598 OP* retval = scalarseq(seq);
1600 PL_pad_reset_pending = FALSE;
1601 compiling.op_private = PL_hints;
1603 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1604 pad_leavemy(PL_comppad_name_fill);
1613 OP *o = newOP(OP_THREADSV, 0);
1614 o->op_targ = find_threadsv("_");
1617 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1618 #endif /* USE_THREADS */
1626 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1627 PL_eval_start = linklist(PL_eval_root);
1628 PL_eval_root->op_next = 0;
1629 peep(PL_eval_start);
1634 PL_main_root = scope(sawparens(scalarvoid(o)));
1635 PL_curcop = &PL_compiling;
1636 PL_main_start = LINKLIST(PL_main_root);
1637 PL_main_root->op_next = 0;
1638 peep(PL_main_start);
1641 /* Register with debugger */
1643 CV *cv = perl_get_cv("DB::postponed", FALSE);
1647 XPUSHs((SV*)PL_compiling.cop_filegv);
1649 perl_call_sv((SV*)cv, G_DISCARD);
1656 localize(OP *o, I32 lex)
1658 if (o->op_flags & OPf_PARENS)
1662 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1664 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1665 if (*s == ';' || *s == '=')
1666 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1667 lex ? "my" : "local");
1671 PL_in_my_stash = Nullhv;
1675 return mod(o, OP_NULL); /* a bit kludgey */
1681 if (o->op_type == OP_LIST) {
1684 o2 = newOP(OP_THREADSV, 0);
1685 o2->op_targ = find_threadsv(";");
1687 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1688 #endif /* USE_THREADS */
1689 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1695 fold_constants(register OP *o)
1699 I32 type = o->op_type;
1702 if (opargs[type] & OA_RETSCALAR)
1704 if (opargs[type] & OA_TARGET)
1705 o->op_targ = pad_alloc(type, SVs_PADTMP);
1707 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1708 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1710 if (!(opargs[type] & OA_FOLDCONST))
1725 if (o->op_private & OPpLOCALE)
1730 goto nope; /* Don't try to run w/ errors */
1732 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1733 if (curop->op_type != OP_CONST &&
1734 curop->op_type != OP_LIST &&
1735 curop->op_type != OP_SCALAR &&
1736 curop->op_type != OP_NULL &&
1737 curop->op_type != OP_PUSHMARK) {
1742 curop = LINKLIST(o);
1746 sv = *(PL_stack_sp--);
1747 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1748 pad_swipe(o->op_targ);
1749 else if (SvTEMP(sv)) { /* grab mortal temp? */
1750 (void)SvREFCNT_inc(sv);
1754 if (type == OP_RV2GV)
1755 return newGVOP(OP_GV, 0, (GV*)sv);
1757 /* try to smush double to int, but don't smush -2.0 to -2 */
1758 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1762 if ((double)iv == SvNV(sv)) {
1767 SvIOK_off(sv); /* undo SvIV() damage */
1769 return newSVOP(OP_CONST, 0, sv);
1773 if (!(opargs[type] & OA_OTHERINT))
1776 if (!(PL_hints & HINT_INTEGER)) {
1777 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1780 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1781 if (curop->op_type == OP_CONST) {
1782 if (SvIOK(((SVOP*)curop)->op_sv))
1786 if (opargs[curop->op_type] & OA_RETINTEGER)
1790 o->op_ppaddr = ppaddr[++(o->op_type)];
1797 gen_constant_list(register OP *o)
1801 I32 oldtmps_floor = PL_tmps_floor;
1805 return o; /* Don't attempt to run with errors */
1807 PL_op = curop = LINKLIST(o);
1813 PL_tmps_floor = oldtmps_floor;
1815 o->op_type = OP_RV2AV;
1816 o->op_ppaddr = ppaddr[OP_RV2AV];
1817 curop = ((UNOP*)o)->op_first;
1818 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1825 convert(I32 type, I32 flags, OP *o)
1830 if (!o || o->op_type != OP_LIST)
1831 o = newLISTOP(OP_LIST, 0, o, Nullop);
1833 o->op_flags &= ~OPf_WANT;
1835 if (!(opargs[type] & OA_MARK))
1836 null(cLISTOPo->op_first);
1839 o->op_ppaddr = ppaddr[type];
1840 o->op_flags |= flags;
1842 o = CHECKOP(type, o);
1843 if (o->op_type != type)
1846 if (cLISTOPo->op_children < 7) {
1847 /* XXX do we really need to do this if we're done appending?? */
1848 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1850 cLISTOPo->op_last = last; /* in case check substituted last arg */
1853 return fold_constants(o);
1856 /* List constructors */
1859 append_elem(I32 type, OP *first, OP *last)
1867 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1868 return newLISTOP(type, 0, first, last);
1870 if (first->op_flags & OPf_KIDS)
1871 ((LISTOP*)first)->op_last->op_sibling = last;
1873 first->op_flags |= OPf_KIDS;
1874 ((LISTOP*)first)->op_first = last;
1876 ((LISTOP*)first)->op_last = last;
1877 ((LISTOP*)first)->op_children++;
1882 append_list(I32 type, LISTOP *first, LISTOP *last)
1890 if (first->op_type != type)
1891 return prepend_elem(type, (OP*)first, (OP*)last);
1893 if (last->op_type != type)
1894 return append_elem(type, (OP*)first, (OP*)last);
1896 first->op_last->op_sibling = last->op_first;
1897 first->op_last = last->op_last;
1898 first->op_children += last->op_children;
1899 if (first->op_children)
1900 last->op_flags |= OPf_KIDS;
1907 prepend_elem(I32 type, OP *first, OP *last)
1915 if (last->op_type == type) {
1916 if (type == OP_LIST) { /* already a PUSHMARK there */
1917 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1918 ((LISTOP*)last)->op_first->op_sibling = first;
1921 if (!(last->op_flags & OPf_KIDS)) {
1922 ((LISTOP*)last)->op_last = first;
1923 last->op_flags |= OPf_KIDS;
1925 first->op_sibling = ((LISTOP*)last)->op_first;
1926 ((LISTOP*)last)->op_first = first;
1928 ((LISTOP*)last)->op_children++;
1932 return newLISTOP(type, 0, first, last);
1940 return newOP(OP_STUB, 0);
1946 if (!o || o->op_type != OP_LIST)
1947 o = newLISTOP(OP_LIST, 0, o, Nullop);
1953 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1957 Newz(1101, listop, 1, LISTOP);
1959 listop->op_type = type;
1960 listop->op_ppaddr = ppaddr[type];
1961 listop->op_children = (first != 0) + (last != 0);
1962 listop->op_flags = flags;
1966 else if (!first && last)
1969 first->op_sibling = last;
1970 listop->op_first = first;
1971 listop->op_last = last;
1972 if (type == OP_LIST) {
1974 pushop = newOP(OP_PUSHMARK, 0);
1975 pushop->op_sibling = first;
1976 listop->op_first = pushop;
1977 listop->op_flags |= OPf_KIDS;
1979 listop->op_last = pushop;
1981 else if (listop->op_children)
1982 listop->op_flags |= OPf_KIDS;
1988 newOP(I32 type, I32 flags)
1991 Newz(1101, o, 1, OP);
1993 o->op_ppaddr = ppaddr[type];
1994 o->op_flags = flags;
1997 o->op_private = 0 + (flags >> 8);
1998 if (opargs[type] & OA_RETSCALAR)
2000 if (opargs[type] & OA_TARGET)
2001 o->op_targ = pad_alloc(type, SVs_PADTMP);
2002 return CHECKOP(type, o);
2006 newUNOP(I32 type, I32 flags, OP *first)
2011 first = newOP(OP_STUB, 0);
2012 if (opargs[type] & OA_MARK)
2013 first = force_list(first);
2015 Newz(1101, unop, 1, UNOP);
2016 unop->op_type = type;
2017 unop->op_ppaddr = ppaddr[type];
2018 unop->op_first = first;
2019 unop->op_flags = flags | OPf_KIDS;
2020 unop->op_private = 1 | (flags >> 8);
2021 unop = (UNOP*) CHECKOP(type, unop);
2025 return fold_constants((OP *) unop);
2029 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2032 Newz(1101, binop, 1, BINOP);
2035 first = newOP(OP_NULL, 0);
2037 binop->op_type = type;
2038 binop->op_ppaddr = ppaddr[type];
2039 binop->op_first = first;
2040 binop->op_flags = flags | OPf_KIDS;
2043 binop->op_private = 1 | (flags >> 8);
2046 binop->op_private = 2 | (flags >> 8);
2047 first->op_sibling = last;
2050 binop = (BINOP*)CHECKOP(type, binop);
2054 binop->op_last = last = binop->op_first->op_sibling;
2056 return fold_constants((OP *)binop);
2060 utf8compare(const void *a, const void *b)
2063 for (i = 0; i < 10; i++) {
2064 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2066 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2073 pmtrans(OP *o, OP *expr, OP *repl)
2075 SV *tstr = ((SVOP*)expr)->op_sv;
2076 SV *rstr = ((SVOP*)repl)->op_sv;
2079 register U8 *t = (U8*)SvPV(tstr, tlen);
2080 register U8 *r = (U8*)SvPV(rstr, rlen);
2086 register short *tbl;
2088 complement = o->op_private & OPpTRANS_COMPLEMENT;
2089 del = o->op_private & OPpTRANS_DELETE;
2090 squash = o->op_private & OPpTRANS_SQUASH;
2092 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2093 SV* listsv = newSVpv("# comment\n",0);
2095 U8* tend = t + tlen;
2096 U8* rend = r + rlen;
2112 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2113 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2119 New(1109, cp, tlen, U8*);
2121 transv = newSVpv("",0);
2130 qsort(cp, i, sizeof(U8*), utf8compare);
2131 for (j = 0; j < i; j++) {
2133 UV val = utf8_to_uv(s, &ulen);
2135 diff = val - nextmin;
2137 t = uv_to_utf8(tmpbuf,nextmin);
2138 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2140 t = uv_to_utf8(tmpbuf, val - 1);
2141 sv_catpvn(transv, "\377", 1);
2142 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2146 val = utf8_to_uv(s+1, &ulen);
2150 t = uv_to_utf8(tmpbuf,nextmin);
2151 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2152 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2153 sv_catpvn(transv, "\377", 1);
2154 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2155 t = (U8*)SvPVX(transv);
2156 tlen = SvCUR(transv);
2159 else if (!rlen && !del) {
2160 r = t; rlen = tlen; rend = tend;
2163 if (to_utf && from_utf) { /* only counting characters */
2164 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2165 o->op_private |= OPpTRANS_IDENTICAL;
2167 else { /* straight latin-1 translation */
2168 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2169 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2170 o->op_private |= OPpTRANS_IDENTICAL;
2174 while (t < tend || tfirst <= tlast) {
2175 /* see if we need more "t" chars */
2176 if (tfirst > tlast) {
2177 tfirst = (I32)utf8_to_uv(t, &ulen);
2179 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2180 tlast = (I32)utf8_to_uv(++t, &ulen);
2187 /* now see if we need more "r" chars */
2188 if (rfirst > rlast) {
2190 rfirst = (I32)utf8_to_uv(r, &ulen);
2192 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2193 rlast = (I32)utf8_to_uv(++r, &ulen);
2202 rfirst = rlast = 0xffffffff;
2206 /* now see which range will peter our first, if either. */
2207 tdiff = tlast - tfirst;
2208 rdiff = rlast - rfirst;
2215 if (rfirst == 0xffffffff) {
2216 diff = tdiff; /* oops, pretend rdiff is infinite */
2218 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2220 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2224 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2226 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2228 if (rfirst + diff > max)
2229 max = rfirst + diff;
2234 else if (rfirst <= 0x800)
2235 grows |= (tfirst < 0x80);
2236 else if (rfirst <= 0x10000)
2237 grows |= (tfirst < 0x800);
2238 else if (rfirst <= 0x200000)
2239 grows |= (tfirst < 0x10000);
2240 else if (rfirst <= 0x4000000)
2241 grows |= (tfirst < 0x200000);
2242 else if (rfirst <= 0x80000000)
2243 grows |= (tfirst < 0x4000000);
2255 else if (max > 0xff)
2260 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2261 SvREFCNT_dec(listsv);
2263 SvREFCNT_dec(transv);
2265 if (!del && havefinal)
2266 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2268 if (grows && to_utf)
2269 o->op_private |= OPpTRANS_GROWS;
2276 tbl = (short*)cPVOPo->op_pv;
2278 Zero(tbl, 256, short);
2279 for (i = 0; i < tlen; i++)
2281 for (i = 0, j = 0; i < 256; i++) {
2297 if (!rlen && !del) {
2300 o->op_private |= OPpTRANS_IDENTICAL;
2302 for (i = 0; i < 256; i++)
2304 for (i = 0, j = 0; i < tlen; i++,j++) {
2307 if (tbl[t[i]] == -1)
2313 if (tbl[t[i]] == -1)
2324 newPMOP(I32 type, I32 flags)
2329 Newz(1101, pmop, 1, PMOP);
2330 pmop->op_type = type;
2331 pmop->op_ppaddr = ppaddr[type];
2332 pmop->op_flags = flags;
2333 pmop->op_private = 0 | (flags >> 8);
2335 if (PL_hints & HINT_RE_TAINT)
2336 pmop->op_pmpermflags |= PMf_RETAINT;
2337 if (PL_hints & HINT_LOCALE)
2338 pmop->op_pmpermflags |= PMf_LOCALE;
2339 pmop->op_pmflags = pmop->op_pmpermflags;
2341 /* link into pm list */
2342 if (type != OP_TRANS && PL_curstash) {
2343 pmop->op_pmnext = HvPMROOT(PL_curstash);
2344 HvPMROOT(PL_curstash) = pmop;
2351 pmruntime(OP *o, OP *expr, OP *repl)
2356 I32 repl_has_vars = 0;
2358 if (o->op_type == OP_TRANS)
2359 return pmtrans(o, expr, repl);
2361 PL_hints |= HINT_BLOCK_SCOPE;
2364 if (expr->op_type == OP_CONST) {
2366 SV *pat = ((SVOP*)expr)->op_sv;
2367 char *p = SvPV(pat, plen);
2368 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2369 sv_setpvn(pat, "\\s+", 3);
2370 p = SvPV(pat, plen);
2371 pm->op_pmflags |= PMf_SKIPWHITE;
2373 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2374 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2375 pm->op_pmflags |= PMf_WHITE;
2379 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2380 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2382 : OP_REGCMAYBE),0,expr);
2384 Newz(1101, rcop, 1, LOGOP);
2385 rcop->op_type = OP_REGCOMP;
2386 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2387 rcop->op_first = scalar(expr);
2388 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2389 ? (OPf_SPECIAL | OPf_KIDS)
2391 rcop->op_private = 1;
2394 /* establish postfix order */
2395 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2397 rcop->op_next = expr;
2398 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2401 rcop->op_next = LINKLIST(expr);
2402 expr->op_next = (OP*)rcop;
2405 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2410 if (pm->op_pmflags & PMf_EVAL)
2413 else if (repl->op_type == OP_THREADSV
2414 && strchr("&`'123456789+",
2415 PL_threadsv_names[repl->op_targ]))
2419 #endif /* USE_THREADS */
2420 else if (repl->op_type == OP_CONST)
2424 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2425 if (opargs[curop->op_type] & OA_DANGEROUS) {
2427 if (curop->op_type == OP_THREADSV) {
2429 if (strchr("&`'123456789+", curop->op_private))
2433 if (curop->op_type == OP_GV) {
2434 GV *gv = ((GVOP*)curop)->op_gv;
2436 if (strchr("&`'123456789+", *GvENAME(gv)))
2439 #endif /* USE_THREADS */
2440 else if (curop->op_type == OP_RV2CV)
2442 else if (curop->op_type == OP_RV2SV ||
2443 curop->op_type == OP_RV2AV ||
2444 curop->op_type == OP_RV2HV ||
2445 curop->op_type == OP_RV2GV) {
2446 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2449 else if (curop->op_type == OP_PADSV ||
2450 curop->op_type == OP_PADAV ||
2451 curop->op_type == OP_PADHV ||
2452 curop->op_type == OP_PADANY) {
2455 else if (curop->op_type == OP_PUSHRE)
2456 ; /* Okay here, dangerous in newASSIGNOP */
2465 && (!pm->op_pmregexp
2466 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2467 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2468 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2469 prepend_elem(o->op_type, scalar(repl), o);
2472 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2473 pm->op_pmflags |= PMf_MAYBE_CONST;
2474 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2476 Newz(1101, rcop, 1, LOGOP);
2477 rcop->op_type = OP_SUBSTCONT;
2478 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2479 rcop->op_first = scalar(repl);
2480 rcop->op_flags |= OPf_KIDS;
2481 rcop->op_private = 1;
2484 /* establish postfix order */
2485 rcop->op_next = LINKLIST(repl);
2486 repl->op_next = (OP*)rcop;
2488 pm->op_pmreplroot = scalar((OP*)rcop);
2489 pm->op_pmreplstart = LINKLIST(rcop);
2498 newSVOP(I32 type, I32 flags, SV *sv)
2501 Newz(1101, svop, 1, SVOP);
2502 svop->op_type = type;
2503 svop->op_ppaddr = ppaddr[type];
2505 svop->op_next = (OP*)svop;
2506 svop->op_flags = flags;
2507 if (opargs[type] & OA_RETSCALAR)
2509 if (opargs[type] & OA_TARGET)
2510 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2511 return CHECKOP(type, svop);
2515 newGVOP(I32 type, I32 flags, GV *gv)
2519 Newz(1101, gvop, 1, GVOP);
2520 gvop->op_type = type;
2521 gvop->op_ppaddr = ppaddr[type];
2522 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2523 gvop->op_next = (OP*)gvop;
2524 gvop->op_flags = flags;
2525 if (opargs[type] & OA_RETSCALAR)
2527 if (opargs[type] & OA_TARGET)
2528 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2529 return CHECKOP(type, gvop);
2533 newPVOP(I32 type, I32 flags, char *pv)
2536 Newz(1101, pvop, 1, PVOP);
2537 pvop->op_type = type;
2538 pvop->op_ppaddr = ppaddr[type];
2540 pvop->op_next = (OP*)pvop;
2541 pvop->op_flags = flags;
2542 if (opargs[type] & OA_RETSCALAR)
2544 if (opargs[type] & OA_TARGET)
2545 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2546 return CHECKOP(type, pvop);
2555 save_hptr(&PL_curstash);
2556 save_item(PL_curstname);
2561 name = SvPV(sv, len);
2562 PL_curstash = gv_stashpvn(name,len,TRUE);
2563 sv_setpvn(PL_curstname, name, len);
2567 sv_setpv(PL_curstname,"<none>");
2568 PL_curstash = Nullhv;
2570 PL_copline = NOLINE;
2575 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2583 if (id->op_type != OP_CONST)
2584 croak("Module name must be constant");
2588 if(version != Nullop) {
2589 SV *vesv = ((SVOP*)version)->op_sv;
2591 if (arg == Nullop && !SvNIOK(vesv)) {
2598 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2599 croak("Version number must be constant number");
2601 /* Make copy of id so we don't free it twice */
2602 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2604 /* Fake up a method call to VERSION */
2605 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2606 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2607 append_elem(OP_LIST,
2608 prepend_elem(OP_LIST, pack, list(version)),
2609 newUNOP(OP_METHOD, 0, meth)));
2613 /* Fake up an import/unimport */
2614 if (arg && arg->op_type == OP_STUB)
2615 imop = arg; /* no import on explicit () */
2616 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2617 imop = Nullop; /* use 5.0; */
2620 /* Make copy of id so we don't free it twice */
2621 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2622 meth = newSVOP(OP_CONST, 0,
2624 ? newSVpv("import", 6)
2625 : newSVpv("unimport", 8)
2627 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2628 append_elem(OP_LIST,
2629 prepend_elem(OP_LIST, pack, list(arg)),
2630 newUNOP(OP_METHOD, 0, meth)));
2633 /* Fake up a require */
2634 rqop = newUNOP(OP_REQUIRE, 0, id);
2636 /* Fake up the BEGIN {}, which does its thing immediately. */
2638 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2640 append_elem(OP_LINESEQ,
2641 append_elem(OP_LINESEQ,
2642 newSTATEOP(0, Nullch, rqop),
2643 newSTATEOP(0, Nullch, veop)),
2644 newSTATEOP(0, Nullch, imop) ));
2646 PL_copline = NOLINE;
2651 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2653 return newBINOP(OP_LSLICE, flags,
2654 list(force_list(subscript)),
2655 list(force_list(listval)) );
2659 list_assignment(register OP *o)
2664 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2665 o = cUNOPo->op_first;
2667 if (o->op_type == OP_COND_EXPR) {
2668 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2669 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2674 yyerror("Assignment to both a list and a scalar");
2678 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2679 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2680 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2683 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2686 if (o->op_type == OP_RV2SV)
2693 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2698 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2699 return newLOGOP(optype, 0,
2700 mod(scalar(left), optype),
2701 newUNOP(OP_SASSIGN, 0, scalar(right)));
2704 return newBINOP(optype, OPf_STACKED,
2705 mod(scalar(left), optype), scalar(right));
2709 if (list_assignment(left)) {
2712 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2713 left = mod(left, OP_AASSIGN);
2721 o = newBINOP(OP_AASSIGN, flags,
2722 list(force_list(right)),
2723 list(force_list(left)) );
2724 o->op_private = 0 | (flags >> 8);
2725 if (!(left->op_private & OPpLVAL_INTRO)) {
2729 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2730 if (opargs[curop->op_type] & OA_DANGEROUS) {
2731 if (curop->op_type == OP_GV) {
2732 GV *gv = ((GVOP*)curop)->op_gv;
2733 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2735 SvCUR(gv) = PL_generation;
2737 else if (curop->op_type == OP_PADSV ||
2738 curop->op_type == OP_PADAV ||
2739 curop->op_type == OP_PADHV ||
2740 curop->op_type == OP_PADANY) {
2741 SV **svp = AvARRAY(PL_comppad_name);
2742 SV *sv = svp[curop->op_targ];
2743 if (SvCUR(sv) == PL_generation)
2745 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2747 else if (curop->op_type == OP_RV2CV)
2749 else if (curop->op_type == OP_RV2SV ||
2750 curop->op_type == OP_RV2AV ||
2751 curop->op_type == OP_RV2HV ||
2752 curop->op_type == OP_RV2GV) {
2753 if (lastop->op_type != OP_GV) /* funny deref? */
2756 else if (curop->op_type == OP_PUSHRE) {
2757 if (((PMOP*)curop)->op_pmreplroot) {
2758 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2759 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2761 SvCUR(gv) = PL_generation;
2770 o->op_private = OPpASSIGN_COMMON;
2772 if (right && right->op_type == OP_SPLIT) {
2774 if ((tmpop = ((LISTOP*)right)->op_first) &&
2775 tmpop->op_type == OP_PUSHRE)
2777 PMOP *pm = (PMOP*)tmpop;
2778 if (left->op_type == OP_RV2AV &&
2779 !(left->op_private & OPpLVAL_INTRO) &&
2780 !(o->op_private & OPpASSIGN_COMMON) )
2782 tmpop = ((UNOP*)left)->op_first;
2783 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2784 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2785 pm->op_pmflags |= PMf_ONCE;
2786 tmpop = cUNOPo->op_first; /* to list (nulled) */
2787 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2788 tmpop->op_sibling = Nullop; /* don't free split */
2789 right->op_next = tmpop->op_next; /* fix starting loc */
2790 op_free(o); /* blow off assign */
2791 right->op_flags &= ~OPf_WANT;
2792 /* "I don't know and I don't care." */
2797 if (PL_modcount < 10000 &&
2798 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2800 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2802 sv_setiv(sv, PL_modcount+1);
2810 right = newOP(OP_UNDEF, 0);
2811 if (right->op_type == OP_READLINE) {
2812 right->op_flags |= OPf_STACKED;
2813 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2816 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2817 o = newBINOP(OP_SASSIGN, flags,
2818 scalar(right), mod(scalar(left), OP_SASSIGN) );
2830 newSTATEOP(I32 flags, char *label, OP *o)
2833 U32 seq = intro_my();
2836 Newz(1101, cop, 1, COP);
2837 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2838 cop->op_type = OP_DBSTATE;
2839 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2842 cop->op_type = OP_NEXTSTATE;
2843 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2845 cop->op_flags = flags;
2846 cop->op_private = (PL_hints & HINT_UTF8);
2848 cop->op_private |= NATIVE_HINTS;
2850 compiling.op_private = cop->op_private;
2851 cop->op_next = (OP*)cop;
2854 cop->cop_label = label;
2855 PL_hints |= HINT_BLOCK_SCOPE;
2858 cop->cop_arybase = PL_curcop->cop_arybase;
2859 if (PL_curcop->cop_warnings == WARN_NONE
2860 || PL_curcop->cop_warnings == WARN_ALL)
2861 cop->cop_warnings = PL_curcop->cop_warnings ;
2863 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2866 if (PL_copline == NOLINE)
2867 cop->cop_line = PL_curcop->cop_line;
2869 cop->cop_line = PL_copline;
2870 PL_copline = NOLINE;
2872 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2873 cop->cop_stash = PL_curstash;
2875 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2876 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2877 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2878 (void)SvIOK_on(*svp);
2880 SvSTASH(*svp) = (HV*)cop;
2884 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2887 /* "Introduce" my variables to visible status. */
2895 if (! PL_min_intro_pending)
2896 return PL_cop_seqmax;
2898 svp = AvARRAY(PL_comppad_name);
2899 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2900 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2901 SvIVX(sv) = 999999999; /* Don't know scope end yet. */
2902 SvNVX(sv) = (double)PL_cop_seqmax;
2905 PL_min_intro_pending = 0;
2906 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2907 return PL_cop_seqmax++;
2911 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2913 return new_logop(type, flags, &first, &other);
2917 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2922 OP *first = *firstp;
2923 OP *other = *otherp;
2925 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2926 return newBINOP(type, flags, scalar(first), scalar(other));
2928 scalarboolean(first);
2929 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2930 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2931 if (type == OP_AND || type == OP_OR) {
2937 first = *firstp = cUNOPo->op_first;
2939 first->op_next = o->op_next;
2940 cUNOPo->op_first = Nullop;
2944 if (first->op_type == OP_CONST) {
2945 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
2946 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
2948 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
2959 else if (first->op_type == OP_WANTARRAY) {
2965 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
2966 OP *k1 = ((UNOP*)first)->op_first;
2967 OP *k2 = k1->op_sibling;
2969 switch (first->op_type)
2972 if (k2 && k2->op_type == OP_READLINE
2973 && (k2->op_flags & OPf_STACKED)
2974 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
2975 warnop = k2->op_type;
2979 if (k1->op_type == OP_READDIR
2980 || k1->op_type == OP_GLOB
2981 || k1->op_type == OP_EACH)
2982 warnop = k1->op_type;
2986 line_t oldline = PL_curcop->cop_line;
2987 PL_curcop->cop_line = PL_copline;
2989 "Value of %s%s can be \"0\"; test with defined()",
2991 ((warnop == OP_READLINE || warnop == OP_GLOB)
2992 ? " construct" : "() operator"));
2993 PL_curcop->cop_line = oldline;
3000 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3001 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3003 Newz(1101, logop, 1, LOGOP);
3005 logop->op_type = type;
3006 logop->op_ppaddr = ppaddr[type];
3007 logop->op_first = first;
3008 logop->op_flags = flags | OPf_KIDS;
3009 logop->op_other = LINKLIST(other);
3010 logop->op_private = 1 | (flags >> 8);
3012 /* establish postfix order */
3013 logop->op_next = LINKLIST(first);
3014 first->op_next = (OP*)logop;
3015 first->op_sibling = other;
3017 o = newUNOP(OP_NULL, 0, (OP*)logop);
3024 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3031 return newLOGOP(OP_AND, 0, first, trueop);
3033 return newLOGOP(OP_OR, 0, first, falseop);
3035 scalarboolean(first);
3036 if (first->op_type == OP_CONST) {
3037 if (SvTRUE(((SVOP*)first)->op_sv)) {
3048 else if (first->op_type == OP_WANTARRAY) {
3052 Newz(1101, condop, 1, CONDOP);
3054 condop->op_type = OP_COND_EXPR;
3055 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3056 condop->op_first = first;
3057 condop->op_flags = flags | OPf_KIDS;
3058 condop->op_true = LINKLIST(trueop);
3059 condop->op_false = LINKLIST(falseop);
3060 condop->op_private = 1 | (flags >> 8);
3062 /* establish postfix order */
3063 condop->op_next = LINKLIST(first);
3064 first->op_next = (OP*)condop;
3066 first->op_sibling = trueop;
3067 trueop->op_sibling = falseop;
3068 o = newUNOP(OP_NULL, 0, (OP*)condop);
3070 trueop->op_next = o;
3071 falseop->op_next = o;
3077 newRANGE(I32 flags, OP *left, OP *right)
3085 Newz(1101, condop, 1, CONDOP);
3087 condop->op_type = OP_RANGE;
3088 condop->op_ppaddr = ppaddr[OP_RANGE];
3089 condop->op_first = left;
3090 condop->op_flags = OPf_KIDS;
3091 condop->op_true = LINKLIST(left);
3092 condop->op_false = LINKLIST(right);
3093 condop->op_private = 1 | (flags >> 8);
3095 left->op_sibling = right;
3097 condop->op_next = (OP*)condop;
3098 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3099 flop = newUNOP(OP_FLOP, 0, flip);
3100 o = newUNOP(OP_NULL, 0, flop);
3103 left->op_next = flip;
3104 right->op_next = flop;
3106 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3107 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3108 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3109 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3111 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3112 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3115 if (!flip->op_private || !flop->op_private)
3116 linklist(o); /* blow off optimizer unless constant */
3122 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3127 int once = block && block->op_flags & OPf_SPECIAL &&
3128 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3131 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3132 return block; /* do {} while 0 does once */
3133 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3134 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3135 expr = newUNOP(OP_DEFINED, 0,
3136 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3137 } else if (expr->op_flags & OPf_KIDS) {
3138 OP *k1 = ((UNOP*)expr)->op_first;
3139 OP *k2 = (k1) ? k1->op_sibling : NULL;
3140 switch (expr->op_type) {
3142 if (k2 && k2->op_type == OP_READLINE
3143 && (k2->op_flags & OPf_STACKED)
3144 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3145 expr = newUNOP(OP_DEFINED, 0, expr);
3149 if (k1->op_type == OP_READDIR
3150 || k1->op_type == OP_GLOB
3151 || k1->op_type == OP_EACH)
3152 expr = newUNOP(OP_DEFINED, 0, expr);
3158 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3159 o = new_logop(OP_AND, 0, &expr, &listop);
3162 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3164 if (once && o != listop)
3165 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3168 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3170 o->op_flags |= flags;
3172 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3177 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3186 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3187 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3188 expr = newUNOP(OP_DEFINED, 0,
3189 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3190 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3191 OP *k1 = ((UNOP*)expr)->op_first;
3192 OP *k2 = (k1) ? k1->op_sibling : NULL;
3193 switch (expr->op_type) {
3195 if (k2 && k2->op_type == OP_READLINE
3196 && (k2->op_flags & OPf_STACKED)
3197 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3198 expr = newUNOP(OP_DEFINED, 0, expr);
3202 if (k1->op_type == OP_READDIR
3203 || k1->op_type == OP_GLOB
3204 || k1->op_type == OP_EACH)
3205 expr = newUNOP(OP_DEFINED, 0, expr);
3211 block = newOP(OP_NULL, 0);
3214 next = LINKLIST(cont);
3216 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3217 if ((line_t)whileline != NOLINE) {
3218 PL_copline = whileline;
3219 cont = append_elem(OP_LINESEQ, cont,
3220 newSTATEOP(0, Nullch, Nullop));
3224 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3225 redo = LINKLIST(listop);
3228 PL_copline = whileline;
3230 o = new_logop(OP_AND, 0, &expr, &listop);
3231 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3232 op_free(expr); /* oops, it's a while (0) */
3234 return Nullop; /* listop already freed by new_logop */
3237 ((LISTOP*)listop)->op_last->op_next = condop =
3238 (o == listop ? redo : LINKLIST(o));
3246 Newz(1101,loop,1,LOOP);
3247 loop->op_type = OP_ENTERLOOP;
3248 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3249 loop->op_private = 0;
3250 loop->op_next = (OP*)loop;
3253 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3255 loop->op_redoop = redo;
3256 loop->op_lastop = o;
3259 loop->op_nextop = next;
3261 loop->op_nextop = o;
3263 o->op_flags |= flags;
3264 o->op_private |= (flags >> 8);
3269 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3277 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3278 sv->op_type = OP_RV2GV;
3279 sv->op_ppaddr = ppaddr[OP_RV2GV];
3281 else if (sv->op_type == OP_PADSV) { /* private variable */
3282 padoff = sv->op_targ;
3286 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3287 padoff = sv->op_targ;
3288 iterflags |= OPf_SPECIAL;
3293 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3297 padoff = find_threadsv("_");
3298 iterflags |= OPf_SPECIAL;
3300 sv = newGVOP(OP_GV, 0, PL_defgv);
3303 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3304 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3305 iterflags |= OPf_STACKED;
3307 else if (expr->op_type == OP_NULL &&
3308 (expr->op_flags & OPf_KIDS) &&
3309 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3311 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3312 * set the STACKED flag to indicate that these values are to be
3313 * treated as min/max values by 'pp_iterinit'.
3315 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3316 CONDOP* range = (CONDOP*) flip->op_first;
3317 OP* left = range->op_first;
3318 OP* right = left->op_sibling;
3321 range->op_flags &= ~OPf_KIDS;
3322 range->op_first = Nullop;
3324 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3325 listop->op_first->op_next = range->op_true;
3326 left->op_next = range->op_false;
3327 right->op_next = (OP*)listop;
3328 listop->op_next = listop->op_first;
3331 expr = (OP*)(listop);
3333 iterflags |= OPf_STACKED;
3336 expr = mod(force_list(expr), OP_GREPSTART);
3340 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3341 append_elem(OP_LIST, expr, scalar(sv))));
3342 assert(!loop->op_next);
3343 Renew(loop, 1, LOOP);
3344 loop->op_targ = padoff;
3345 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3346 PL_copline = forline;
3347 return newSTATEOP(0, label, wop);
3351 newLOOPEX(I32 type, OP *label)
3355 if (type != OP_GOTO || label->op_type == OP_CONST) {
3356 /* "last()" means "last" */
3357 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3358 o = newOP(type, OPf_SPECIAL);
3360 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3361 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3367 if (label->op_type == OP_ENTERSUB)
3368 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3369 o = newUNOP(type, OPf_STACKED, label);
3371 PL_hints |= HINT_BLOCK_SCOPE;
3381 MUTEX_DESTROY(CvMUTEXP(cv));
3382 Safefree(CvMUTEXP(cv));
3385 #endif /* USE_THREADS */
3387 if (!CvXSUB(cv) && CvROOT(cv)) {
3389 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3390 croak("Can't undef active subroutine");
3393 croak("Can't undef active subroutine");
3394 #endif /* USE_THREADS */
3397 SAVESPTR(PL_curpad);
3401 op_free(CvROOT(cv));
3402 CvROOT(cv) = Nullop;
3405 SvPOK_off((SV*)cv); /* forget prototype */
3407 SvREFCNT_dec(CvGV(cv));
3409 SvREFCNT_dec(CvOUTSIDE(cv));
3410 CvOUTSIDE(cv) = Nullcv;
3411 if (CvPADLIST(cv)) {
3412 /* may be during global destruction */
3413 if (SvREFCNT(CvPADLIST(cv))) {
3414 I32 i = AvFILLp(CvPADLIST(cv));
3416 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3417 SV* sv = svp ? *svp : Nullsv;
3420 if (sv == (SV*)PL_comppad_name)
3421 PL_comppad_name = Nullav;
3422 else if (sv == (SV*)PL_comppad) {
3423 PL_comppad = Nullav;
3424 PL_curpad = Null(SV**);
3428 SvREFCNT_dec((SV*)CvPADLIST(cv));
3430 CvPADLIST(cv) = Nullav;
3434 #ifdef DEBUG_CLOSURES
3439 CV *outside = CvOUTSIDE(cv);
3440 AV* padlist = CvPADLIST(cv);
3447 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3449 (CvANON(cv) ? "ANON"
3450 : (cv == PL_main_cv) ? "MAIN"
3451 : CvUNIQUE(outside) ? "UNIQUE"
3452 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3455 : CvANON(outside) ? "ANON"
3456 : (outside == PL_main_cv) ? "MAIN"
3457 : CvUNIQUE(outside) ? "UNIQUE"
3458 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3463 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3464 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3465 pname = AvARRAY(pad_name);
3466 ppad = AvARRAY(pad);
3468 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3469 if (SvPOK(pname[ix]))
3470 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3472 SvFAKE(pname[ix]) ? "FAKE " : "",
3474 (long)I_32(SvNVX(pname[ix])),
3475 (long)SvIVX(pname[ix]));
3478 #endif /* DEBUG_CLOSURES */
3481 cv_clone2(CV *proto, CV *outside)
3486 AV* protopadlist = CvPADLIST(proto);
3487 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3488 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3489 SV** pname = AvARRAY(protopad_name);
3490 SV** ppad = AvARRAY(protopad);
3491 I32 fname = AvFILLp(protopad_name);
3492 I32 fpad = AvFILLp(protopad);
3496 assert(!CvUNIQUE(proto));
3499 SAVESPTR(PL_curpad);
3500 SAVESPTR(PL_comppad);
3501 SAVESPTR(PL_comppad_name);
3502 SAVESPTR(PL_compcv);
3504 cv = PL_compcv = (CV*)NEWSV(1104,0);
3505 sv_upgrade((SV *)cv, SvTYPE(proto));
3511 New(666, CvMUTEXP(cv), 1, perl_mutex);
3512 MUTEX_INIT(CvMUTEXP(cv));
3514 #endif /* USE_THREADS */
3515 CvFILEGV(cv) = CvFILEGV(proto);
3516 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3517 CvSTASH(cv) = CvSTASH(proto);
3518 CvROOT(cv) = CvROOT(proto);
3519 CvSTART(cv) = CvSTART(proto);
3521 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3524 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3526 PL_comppad_name = newAV();
3527 for (ix = fname; ix >= 0; ix--)
3528 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3530 PL_comppad = newAV();
3532 comppadlist = newAV();
3533 AvREAL_off(comppadlist);
3534 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3535 av_store(comppadlist, 1, (SV*)PL_comppad);
3536 CvPADLIST(cv) = comppadlist;
3537 av_fill(PL_comppad, AvFILLp(protopad));
3538 PL_curpad = AvARRAY(PL_comppad);
3540 av = newAV(); /* will be @_ */
3542 av_store(PL_comppad, 0, (SV*)av);
3543 AvFLAGS(av) = AVf_REIFY;
3545 for (ix = fpad; ix > 0; ix--) {
3546 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3547 if (namesv && namesv != &PL_sv_undef) {
3548 char *name = SvPVX(namesv); /* XXX */
3549 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3550 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3551 CvOUTSIDE(cv), cxstack_ix);
3553 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3555 croak("panic: cv_clone: %s", name);
3557 else { /* our own lexical */
3560 /* anon code -- we'll come back for it */
3561 sv = SvREFCNT_inc(ppad[ix]);
3563 else if (*name == '@')
3565 else if (*name == '%')
3575 SV* sv = NEWSV(0,0);
3581 /* Now that vars are all in place, clone nested closures. */
3583 for (ix = fpad; ix > 0; ix--) {
3584 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3586 && namesv != &PL_sv_undef
3587 && !(SvFLAGS(namesv) & SVf_FAKE)
3588 && *SvPVX(namesv) == '&'
3589 && CvCLONE(ppad[ix]))
3591 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3592 SvREFCNT_dec(ppad[ix]);
3595 PL_curpad[ix] = (SV*)kid;
3599 #ifdef DEBUG_CLOSURES
3600 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3602 PerlIO_printf(Perl_debug_log, " from:\n");
3604 PerlIO_printf(Perl_debug_log, " to:\n");
3615 return cv_clone2(proto, CvOUTSIDE(proto));
3619 cv_ckproto(CV *cv, GV *gv, char *p)
3621 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3622 SV* msg = sv_newmortal();
3626 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3627 sv_setpv(msg, "Prototype mismatch:");
3629 sv_catpvf(msg, " sub %_", name);
3631 sv_catpvf(msg, " (%s)", SvPVX(cv));
3632 sv_catpv(msg, " vs ");
3634 sv_catpvf(msg, "(%s)", p);
3636 sv_catpv(msg, "none");
3644 if (!cv || !SvPOK(cv) || SvCUR(cv))
3646 return op_const_sv(CvSTART(cv), cv);
3650 op_const_sv(OP *o, CV *cv)
3657 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3658 o = cLISTOPo->op_first->op_sibling;
3660 for (; o; o = o->op_next) {
3661 OPCODE type = o->op_type;
3663 if(sv && o->op_next == o)
3665 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3667 if (type == OP_LEAVESUB || type == OP_RETURN)
3671 if (type == OP_CONST)
3673 else if (type == OP_PADSV && cv) {
3674 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3675 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3676 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3688 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3691 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3692 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3693 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3694 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3703 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3704 maximum a prototype before. */
3705 if (SvTYPE(gv) > SVt_NULL) {
3706 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3707 warn("Runaway prototype");
3708 cv_ckproto((CV*)gv, NULL, ps);
3711 sv_setpv((SV*)gv, ps);
3713 sv_setiv((SV*)gv, -1);
3714 SvREFCNT_dec(PL_compcv);
3715 cv = PL_compcv = NULL;
3716 PL_sub_generation++;
3720 if (!name || GvCVGEN(gv))
3722 else if (cv = GvCV(gv)) {
3723 cv_ckproto(cv, gv, ps);
3724 /* already defined (or promised)? */
3725 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3727 bool const_changed = TRUE;
3729 /* just a "sub foo;" when &foo is already defined */
3730 SAVEFREESV(PL_compcv);
3733 /* ahem, death to those who redefine active sort subs */
3734 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3735 croak("Can't redefine active sort subroutine %s", name);
3736 if(const_sv = cv_const_sv(cv))
3737 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3738 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3739 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3740 && HvNAME(GvSTASH(CvGV(cv)))
3741 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3743 line_t oldline = PL_curcop->cop_line;
3744 PL_curcop->cop_line = PL_copline;
3745 warner(WARN_REDEFINE,
3746 const_sv ? "Constant subroutine %s redefined"
3747 : "Subroutine %s redefined", name);
3748 PL_curcop->cop_line = oldline;
3754 if (cv) { /* must reuse cv if autoloaded */
3756 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3757 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3758 CvOUTSIDE(PL_compcv) = 0;
3759 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3760 CvPADLIST(PL_compcv) = 0;
3761 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3762 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3763 SvREFCNT_dec(PL_compcv);
3770 PL_sub_generation++;
3773 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3774 CvFILEGV(cv) = PL_curcop->cop_filegv;
3775 CvSTASH(cv) = PL_curstash;
3779 New(666, CvMUTEXP(cv), 1, perl_mutex);
3780 MUTEX_INIT(CvMUTEXP(cv));
3781 #endif /* USE_THREADS */
3784 sv_setpv((SV*)cv, ps);
3786 if (PL_error_count) {
3790 char *s = strrchr(name, ':');
3792 if (strEQ(s, "BEGIN")) {
3794 "BEGIN not safe after errors--compilation aborted";
3798 /* force display of errors found but not reported */
3799 sv_catpv(ERRSV, not_safe);
3800 croak("%s", SvPVx(ERRSV, PL_na));
3807 PL_copline = NOLINE;
3812 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3813 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3816 SV **namep = AvARRAY(PL_comppad_name);
3817 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3820 if (SvIMMORTAL(PL_curpad[ix]))
3823 * The only things that a clonable function needs in its
3824 * pad are references to outer lexicals and anonymous subs.
3825 * The rest are created anew during cloning.
3827 if (!((namesv = namep[ix]) != Nullsv &&
3828 namesv != &PL_sv_undef &&
3830 *SvPVX(namesv) == '&')))
3832 SvREFCNT_dec(PL_curpad[ix]);
3833 PL_curpad[ix] = Nullsv;
3838 AV *av = newAV(); /* Will be @_ */
3840 av_store(PL_comppad, 0, (SV*)av);
3841 AvFLAGS(av) = AVf_REIFY;
3843 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3844 if (SvIMMORTAL(PL_curpad[ix]))
3846 if (!SvPADMY(PL_curpad[ix]))
3847 SvPADTMP_on(PL_curpad[ix]);
3851 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3852 CvSTART(cv) = LINKLIST(CvROOT(cv));
3853 CvROOT(cv)->op_next = 0;
3859 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3860 SV *sv = NEWSV(0,0);
3861 SV *tmpstr = sv_newmortal();
3862 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3866 sv_setpvf(sv, "%_:%ld-%ld",
3867 GvSV(PL_curcop->cop_filegv),
3868 (long)PL_subline, (long)PL_curcop->cop_line);
3869 gv_efullname3(tmpstr, gv, Nullch);
3870 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3871 hv = GvHVn(db_postponed);
3872 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3873 && (cv = GvCV(db_postponed))) {
3878 perl_call_sv((SV*)cv, G_DISCARD);
3882 if ((s = strrchr(name,':')))
3886 if (strEQ(s, "BEGIN")) {
3887 I32 oldscope = PL_scopestack_ix;
3889 SAVESPTR(PL_compiling.cop_filegv);
3890 SAVEI16(PL_compiling.cop_line);
3892 sv_setsv(PL_rs, PL_nrs);
3895 PL_beginav = newAV();
3896 DEBUG_x( dump_sub(gv) );
3897 av_push(PL_beginav, (SV *)cv);
3899 call_list(oldscope, PL_beginav);
3901 PL_curcop = &PL_compiling;
3902 PL_compiling.op_private = PL_hints;
3905 else if (strEQ(s, "END") && !PL_error_count) {
3908 av_unshift(PL_endav, 1);
3909 av_store(PL_endav, 0, (SV *)cv);
3912 else if (strEQ(s, "INIT") && !PL_error_count) {
3914 PL_initav = newAV();
3915 av_push(PL_initav, SvREFCNT_inc(cv));
3921 PL_copline = NOLINE;
3927 newCONSTSUB(HV *stash, char *name, SV *sv)
3930 U32 oldhints = PL_hints;
3931 HV *old_cop_stash = PL_curcop->cop_stash;
3932 HV *old_curstash = PL_curstash;
3933 line_t oldline = PL_curcop->cop_line;
3934 PL_curcop->cop_line = PL_copline;
3936 PL_hints &= ~HINT_BLOCK_SCOPE;
3938 PL_curstash = PL_curcop->cop_stash = stash;
3941 start_subparse(FALSE, 0),
3942 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3943 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3944 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3947 PL_hints = oldhints;
3948 PL_curcop->cop_stash = old_cop_stash;
3949 PL_curstash = old_curstash;
3950 PL_curcop->cop_line = oldline;
3954 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
3957 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
3960 if (cv = (name ? GvCV(gv) : Nullcv)) {
3962 /* just a cached method */
3966 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3967 /* already defined (or promised) */
3968 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
3969 && HvNAME(GvSTASH(CvGV(cv)))
3970 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
3971 line_t oldline = PL_curcop->cop_line;
3972 PL_curcop->cop_line = PL_copline;
3973 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
3974 PL_curcop->cop_line = oldline;
3981 if (cv) /* must reuse cv if autoloaded */
3984 cv = (CV*)NEWSV(1105,0);
3985 sv_upgrade((SV *)cv, SVt_PVCV);
3989 PL_sub_generation++;
3992 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3994 New(666, CvMUTEXP(cv), 1, perl_mutex);
3995 MUTEX_INIT(CvMUTEXP(cv));
3997 #endif /* USE_THREADS */
3998 CvFILEGV(cv) = gv_fetchfile(filename);
3999 CvXSUB(cv) = subaddr;
4002 char *s = strrchr(name,':');
4007 if (strEQ(s, "BEGIN")) {
4009 PL_beginav = newAV();
4010 av_push(PL_beginav, (SV *)cv);
4013 else if (strEQ(s, "END")) {
4016 av_unshift(PL_endav, 1);
4017 av_store(PL_endav, 0, (SV *)cv);
4020 else if (strEQ(s, "INIT")) {
4022 PL_initav = newAV();
4023 av_push(PL_initav, (SV *)cv);
4034 newFORM(I32 floor, OP *o, OP *block)
4043 name = SvPVx(cSVOPo->op_sv, PL_na);
4046 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4048 if (cv = GvFORM(gv)) {
4049 if (ckWARN(WARN_REDEFINE)) {
4050 line_t oldline = PL_curcop->cop_line;
4052 PL_curcop->cop_line = PL_copline;
4053 warner(WARN_REDEFINE, "Format %s redefined",name);
4054 PL_curcop->cop_line = oldline;
4060 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4061 CvFILEGV(cv) = PL_curcop->cop_filegv;
4063 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4064 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4065 SvPADTMP_on(PL_curpad[ix]);
4068 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4069 CvSTART(cv) = LINKLIST(CvROOT(cv));
4070 CvROOT(cv)->op_next = 0;
4073 PL_copline = NOLINE;
4080 return newUNOP(OP_REFGEN, 0,
4081 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4087 return newUNOP(OP_REFGEN, 0,
4088 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4092 newANONSUB(I32 floor, OP *proto, OP *block)
4094 return newUNOP(OP_REFGEN, 0,
4095 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4101 switch (o->op_type) {
4103 o->op_type = OP_PADAV;
4104 o->op_ppaddr = ppaddr[OP_PADAV];
4105 return ref(o, OP_RV2AV);
4108 o->op_type = OP_RV2AV;
4109 o->op_ppaddr = ppaddr[OP_RV2AV];
4114 warn("oops: oopsAV");
4123 switch (o->op_type) {
4126 o->op_type = OP_PADHV;
4127 o->op_ppaddr = ppaddr[OP_PADHV];
4128 return ref(o, OP_RV2HV);
4132 o->op_type = OP_RV2HV;
4133 o->op_ppaddr = ppaddr[OP_RV2HV];
4138 warn("oops: oopsHV");
4147 if (o->op_type == OP_PADANY) {
4148 o->op_type = OP_PADAV;
4149 o->op_ppaddr = ppaddr[OP_PADAV];
4152 return newUNOP(OP_RV2AV, 0, scalar(o));
4156 newGVREF(I32 type, OP *o)
4158 if (type == OP_MAPSTART)
4159 return newUNOP(OP_NULL, 0, o);
4160 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4166 if (o->op_type == OP_PADANY) {
4167 o->op_type = OP_PADHV;
4168 o->op_ppaddr = ppaddr[OP_PADHV];
4171 return newUNOP(OP_RV2HV, 0, scalar(o));
4177 croak("NOT IMPL LINE %d",__LINE__);
4183 newCVREF(I32 flags, OP *o)
4185 return newUNOP(OP_RV2CV, flags, scalar(o));
4191 if (o->op_type == OP_PADANY) {
4192 o->op_type = OP_PADSV;
4193 o->op_ppaddr = ppaddr[OP_PADSV];
4196 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4197 o->op_flags |= OPpDONE_SVREF;
4200 return newUNOP(OP_RV2SV, 0, scalar(o));
4203 /* Check routines. */
4211 name = NEWSV(1106,0);
4212 sv_upgrade(name, SVt_PVNV);
4213 sv_setpvn(name, "&", 1);
4216 ix = pad_alloc(o->op_type, SVs_PADMY);
4217 av_store(PL_comppad_name, ix, name);
4218 av_store(PL_comppad, ix, cSVOPo->op_sv);
4219 SvPADMY_on(cSVOPo->op_sv);
4220 cSVOPo->op_sv = Nullsv;
4221 cSVOPo->op_targ = ix;
4228 o->op_private = PL_hints;
4235 if (cUNOPo->op_first->op_type == OP_CONCAT)
4236 o->op_flags |= OPf_STACKED;
4243 if (o->op_flags & OPf_KIDS) {
4246 OPCODE type = o->op_type;
4247 o = modkids(ck_fun(o), type);
4248 kid = cUNOPo->op_first;
4249 newop = kUNOP->op_first->op_sibling;
4251 (newop->op_sibling ||
4252 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4253 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4254 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4258 op_free(kUNOP->op_first);
4259 kUNOP->op_first = newop;
4261 o->op_ppaddr = ppaddr[++o->op_type];
4270 if (o->op_flags & OPf_KIDS) {
4271 OP *kid = cUNOPo->op_first;
4272 if (kid->op_type == OP_HSLICE)
4273 o->op_private |= OPpSLICE;
4274 else if (kid->op_type != OP_HELEM)
4275 croak("%s argument is not a HASH element or slice",
4276 op_desc[o->op_type]);
4285 I32 type = o->op_type;
4287 if (o->op_flags & OPf_KIDS) {
4288 if (cLISTOPo->op_first->op_type == OP_STUB) {
4290 o = newUNOP(type, OPf_SPECIAL,
4291 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4301 PL_hints |= HINT_BLOCK_SCOPE;
4302 if (o->op_flags & OPf_KIDS) {
4303 SVOP *kid = (SVOP*)cUNOPo->op_first;
4306 o->op_flags &= ~OPf_KIDS;
4309 else if (kid->op_type == OP_LINESEQ) {
4312 kid->op_next = o->op_next;
4313 cUNOPo->op_first = 0;
4316 Newz(1101, enter, 1, LOGOP);
4317 enter->op_type = OP_ENTERTRY;
4318 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4319 enter->op_private = 0;
4321 /* establish postfix order */
4322 enter->op_next = (OP*)enter;
4324 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4325 o->op_type = OP_LEAVETRY;
4326 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4327 enter->op_other = o;
4335 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4337 o->op_targ = (PADOFFSET)PL_hints;
4345 if (o->op_flags & OPf_STACKED) {
4347 kid = cUNOPo->op_first->op_sibling;
4348 if (kid->op_type == OP_RV2GV)
4360 if (o->op_flags & OPf_KIDS) {
4361 OP *kid = cUNOPo->op_first;
4362 if (kid->op_type != OP_HELEM)
4363 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4370 ck_gvconst(register OP *o)
4372 o = fold_constants(o);
4373 if (o->op_type == OP_CONST)
4379 ck_rvconst(register OP *o)
4382 SVOP *kid = (SVOP*)cUNOPo->op_first;
4384 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4385 if (kid->op_type == OP_CONST) {
4390 name = SvPV(kid->op_sv, PL_na);
4391 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4392 char *badthing = Nullch;
4393 switch (o->op_type) {
4395 badthing = "a SCALAR";
4398 badthing = "an ARRAY";
4401 badthing = "a HASH";
4406 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4410 * This is a little tricky. We only want to add the symbol if we
4411 * didn't add it in the lexer. Otherwise we get duplicate strict
4412 * warnings. But if we didn't add it in the lexer, we must at
4413 * least pretend like we wanted to add it even if it existed before,
4414 * or we get possible typo warnings. OPpCONST_ENTERED says
4415 * whether the lexer already added THIS instance of this symbol.
4417 iscv = (o->op_type == OP_RV2CV) * 2;
4419 gv = gv_fetchpv(name,
4420 iscv | !(kid->op_private & OPpCONST_ENTERED),
4423 : o->op_type == OP_RV2SV
4425 : o->op_type == OP_RV2AV
4427 : o->op_type == OP_RV2HV
4430 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4432 kid->op_type = OP_GV;
4433 SvREFCNT_dec(kid->op_sv);
4434 kid->op_sv = SvREFCNT_inc(gv);
4444 I32 type = o->op_type;
4446 if (o->op_flags & OPf_REF)
4449 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4450 SVOP *kid = (SVOP*)cUNOPo->op_first;
4452 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4453 OP *newop = newGVOP(type, OPf_REF,
4454 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4461 if (type == OP_FTTTY)
4462 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4465 return newUNOP(type, 0, newDEFSVOP());
4478 int type = o->op_type;
4479 register I32 oa = opargs[type] >> OASHIFT;
4481 if (o->op_flags & OPf_STACKED) {
4482 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4485 return no_fh_allowed(o);
4488 if (o->op_flags & OPf_KIDS) {
4489 tokid = &cLISTOPo->op_first;
4490 kid = cLISTOPo->op_first;
4491 if (kid->op_type == OP_PUSHMARK ||
4492 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4494 tokid = &kid->op_sibling;
4495 kid = kid->op_sibling;
4497 if (!kid && opargs[type] & OA_DEFGV)
4498 *tokid = kid = newDEFSVOP();
4502 sibl = kid->op_sibling;
4516 if (kid->op_type == OP_CONST &&
4517 (kid->op_private & OPpCONST_BARE)) {
4518 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4519 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4520 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4521 if (ckWARN(WARN_SYNTAX))
4523 "Array @%s missing the @ in argument %ld of %s()",
4524 name, (long)numargs, op_desc[type]);
4527 kid->op_sibling = sibl;
4530 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4531 bad_type(numargs, "array", op_desc[o->op_type], kid);
4535 if (kid->op_type == OP_CONST &&
4536 (kid->op_private & OPpCONST_BARE)) {
4537 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4538 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4539 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4540 if (ckWARN(WARN_SYNTAX))
4542 "Hash %%%s missing the %% in argument %ld of %s()",
4543 name, (long)numargs, op_desc[type]);
4546 kid->op_sibling = sibl;
4549 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4550 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4555 OP *newop = newUNOP(OP_NULL, 0, kid);
4556 kid->op_sibling = 0;
4558 newop->op_next = newop;
4560 kid->op_sibling = sibl;
4565 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4566 if (kid->op_type == OP_CONST &&
4567 (kid->op_private & OPpCONST_BARE)) {
4568 OP *newop = newGVOP(OP_GV, 0,
4569 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4575 kid->op_sibling = 0;
4576 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4578 kid->op_sibling = sibl;
4584 mod(scalar(kid), type);
4588 tokid = &kid->op_sibling;
4589 kid = kid->op_sibling;
4591 o->op_private |= numargs;
4593 return too_many_arguments(o,op_desc[o->op_type]);
4596 else if (opargs[type] & OA_DEFGV) {
4598 return newUNOP(type, 0, newDEFSVOP());
4602 while (oa & OA_OPTIONAL)
4604 if (oa && oa != OA_LIST)
4605 return too_few_arguments(o,op_desc[o->op_type]);
4615 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4616 append_elem(OP_GLOB, o, newDEFSVOP());
4618 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4619 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4621 if (gv && GvIMPORTED_CV(gv)) {
4622 static int glob_index;
4624 append_elem(OP_GLOB, o,
4625 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4626 o->op_type = OP_LIST;
4627 o->op_ppaddr = ppaddr[OP_LIST];
4628 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4629 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4630 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4631 append_elem(OP_LIST, o,
4632 scalar(newUNOP(OP_RV2CV, 0,
4633 newGVOP(OP_GV, 0, gv)))));
4634 o = newUNOP(OP_NULL, 0, ck_subr(o));
4635 o->op_targ = OP_GLOB; /* hint at what it used to be */
4638 gv = newGVgen("main");
4640 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4650 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4652 o->op_ppaddr = ppaddr[OP_GREPSTART];
4653 Newz(1101, gwop, 1, LOGOP);
4655 if (o->op_flags & OPf_STACKED) {
4658 kid = cLISTOPo->op_first->op_sibling;
4659 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4662 kid->op_next = (OP*)gwop;
4663 o->op_flags &= ~OPf_STACKED;
4665 kid = cLISTOPo->op_first->op_sibling;
4666 if (type == OP_MAPWHILE)
4673 kid = cLISTOPo->op_first->op_sibling;
4674 if (kid->op_type != OP_NULL)
4675 croak("panic: ck_grep");
4676 kid = kUNOP->op_first;
4678 gwop->op_type = type;
4679 gwop->op_ppaddr = ppaddr[type];
4680 gwop->op_first = listkids(o);
4681 gwop->op_flags |= OPf_KIDS;
4682 gwop->op_private = 1;
4683 gwop->op_other = LINKLIST(kid);
4684 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4685 kid->op_next = (OP*)gwop;
4687 kid = cLISTOPo->op_first->op_sibling;
4688 if (!kid || !kid->op_sibling)
4689 return too_few_arguments(o,op_desc[o->op_type]);
4690 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4691 mod(kid, OP_GREPSTART);
4699 if (o->op_flags & OPf_KIDS) {
4700 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4702 kid = kid->op_sibling; /* get past "big" */
4703 if (kid && kid->op_type == OP_CONST)
4704 fbm_compile(((SVOP*)kid)->op_sv, 0);
4710 ck_lengthconst(OP *o)
4712 /* XXX length optimization goes here */
4719 OPCODE type = o->op_type;
4720 return modkids(ck_fun(o), type);
4726 OPCODE type = o->op_type;
4727 return refkids(ck_fun(o), type);
4735 kid = cLISTOPo->op_first;
4738 kid = cLISTOPo->op_first;
4740 if (kid->op_type == OP_PUSHMARK)
4741 kid = kid->op_sibling;
4742 if (kid && o->op_flags & OPf_STACKED)
4743 kid = kid->op_sibling;
4744 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4745 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4746 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4747 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4748 cLISTOPo->op_first->op_sibling = kid;
4749 cLISTOPo->op_last = kid;
4750 kid = kid->op_sibling;
4755 append_elem(o->op_type, o, newDEFSVOP());
4761 if (PL_hints & HINT_LOCALE)
4762 o->op_private |= OPpLOCALE;
4769 ck_fun_locale(OP *o)
4775 if (PL_hints & HINT_LOCALE)
4776 o->op_private |= OPpLOCALE;
4787 if (PL_hints & HINT_LOCALE)
4788 o->op_private |= OPpLOCALE;
4797 o->op_private |= OPpRUNTIME;
4810 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4811 o->op_private |= OPpREPEAT_DOLIST;
4812 cBINOPo->op_first = force_list(cBINOPo->op_first);
4822 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4823 SVOP *kid = (SVOP*)cUNOPo->op_first;
4825 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4827 for (s = SvPVX(kid->op_sv); *s; s++) {
4828 if (*s == ':' && s[1] == ':') {
4830 Move(s+2, s+1, strlen(s+2)+1, char);
4831 --SvCUR(kid->op_sv);
4834 sv_catpvn(kid->op_sv, ".pm", 3);
4843 croak("NOT IMPL LINE %d",__LINE__);
4852 if (o->op_flags & OPf_KIDS) {
4853 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4854 if (kid && kid->op_sibling) {
4855 o->op_type = OP_SSELECT;
4856 o->op_ppaddr = ppaddr[OP_SSELECT];
4858 return fold_constants(o);
4862 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4863 if (kid && kid->op_type == OP_RV2GV)
4864 kid->op_private &= ~HINT_STRICT_REFS;
4871 I32 type = o->op_type;
4873 if (!(o->op_flags & OPf_KIDS)) {
4878 if (!CvUNIQUE(PL_compcv)) {
4879 argop = newOP(OP_PADAV, OPf_REF);
4880 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4883 argop = newUNOP(OP_RV2AV, 0,
4884 scalar(newGVOP(OP_GV, 0,
4885 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4888 argop = newUNOP(OP_RV2AV, 0,
4889 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4890 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4891 #endif /* USE_THREADS */
4892 return newUNOP(type, 0, scalar(argop));
4894 return scalar(modkids(ck_fun(o), type));
4902 if (PL_hints & HINT_LOCALE)
4903 o->op_private |= OPpLOCALE;
4906 if (o->op_flags & OPf_STACKED) {
4907 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4909 kid = kUNOP->op_first; /* get past rv2gv */
4911 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4913 if (kid->op_type == OP_SCOPE) {
4917 else if (kid->op_type == OP_LEAVE) {
4918 if (o->op_type == OP_SORT) {
4919 null(kid); /* wipe out leave */
4922 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4923 if (k->op_next == kid)
4928 kid->op_next = 0; /* just disconnect the leave */
4929 k = kLISTOP->op_first;
4933 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4934 null(kid); /* wipe out rv2gv */
4935 if (o->op_type == OP_SORT)
4939 o->op_flags |= OPf_SPECIAL;
4951 if (o->op_flags & OPf_STACKED)
4952 return no_fh_allowed(o);
4954 kid = cLISTOPo->op_first;
4955 if (kid->op_type != OP_NULL)
4956 croak("panic: ck_split");
4957 kid = kid->op_sibling;
4958 op_free(cLISTOPo->op_first);
4959 cLISTOPo->op_first = kid;
4961 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
4962 cLISTOPo->op_last = kid; /* There was only one element previously */
4965 if (kid->op_type != OP_MATCH) {
4966 OP *sibl = kid->op_sibling;
4967 kid->op_sibling = 0;
4968 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
4969 if (cLISTOPo->op_first == cLISTOPo->op_last)
4970 cLISTOPo->op_last = kid;
4971 cLISTOPo->op_first = kid;
4972 kid->op_sibling = sibl;
4975 kid->op_type = OP_PUSHRE;
4976 kid->op_ppaddr = ppaddr[OP_PUSHRE];
4979 if (!kid->op_sibling)
4980 append_elem(OP_SPLIT, o, newDEFSVOP());
4982 kid = kid->op_sibling;
4985 if (!kid->op_sibling)
4986 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
4988 kid = kid->op_sibling;
4991 if (kid->op_sibling)
4992 return too_many_arguments(o,op_desc[o->op_type]);
5001 OP *prev = ((cUNOPo->op_first->op_sibling)
5002 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5003 OP *o2 = prev->op_sibling;
5011 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5012 if (cvop->op_type == OP_RV2CV) {
5014 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5015 null(cvop); /* disable rv2cv */
5016 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5017 if (tmpop->op_type == OP_GV) {
5018 cv = GvCVu(tmpop->op_sv);
5019 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5020 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5021 proto = SvPV((SV*)cv, PL_na);
5025 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5026 if (PERLDB_SUB && PL_curstash != PL_debstash)
5027 o->op_private |= OPpENTERSUB_DB;
5028 while (o2 != cvop) {
5032 return too_many_arguments(o, gv_ename(namegv));
5050 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5051 bad_type(arg, "block", gv_ename(namegv), o2);
5056 if (o2->op_type == OP_RV2GV)
5060 OP* sib = kid->op_sibling;
5061 kid->op_sibling = 0;
5062 o2 = newUNOP(OP_RV2GV, 0, kid);
5063 o2->op_sibling = sib;
5064 prev->op_sibling = o2;
5072 if (o2->op_type != OP_RV2GV)
5073 bad_type(arg, "symbol", gv_ename(namegv), o2);
5076 if (o2->op_type != OP_RV2CV)
5077 bad_type(arg, "sub", gv_ename(namegv), o2);
5080 if (o2->op_type != OP_RV2SV
5081 && o2->op_type != OP_PADSV
5082 && o2->op_type != OP_THREADSV)
5084 bad_type(arg, "scalar", gv_ename(namegv), o2);
5088 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5089 bad_type(arg, "array", gv_ename(namegv), o2);
5092 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5093 bad_type(arg, "hash", gv_ename(namegv), o2);
5097 OP* sib = kid->op_sibling;
5098 kid->op_sibling = 0;
5099 o2 = newUNOP(OP_REFGEN, 0, kid);
5100 o2->op_sibling = sib;
5101 prev->op_sibling = o2;
5112 croak("Malformed prototype for %s: %s",
5113 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5118 mod(o2, OP_ENTERSUB);
5120 o2 = o2->op_sibling;
5122 if (proto && !optional &&
5123 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5124 return too_few_arguments(o, gv_ename(namegv));
5131 SvREADONLY_on(cSVOPo->op_sv);
5138 if (o->op_flags & OPf_KIDS) {
5139 SVOP *kid = (SVOP*)cUNOPo->op_first;
5141 if (kid->op_type == OP_NULL)
5142 kid = (SVOP*)kid->op_sibling;
5144 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5145 o->op_flags |= OPf_SPECIAL;
5150 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5153 peep(register OP *o)
5156 register OP* oldop = 0;
5157 if (!o || o->op_seq)
5161 SAVESPTR(PL_curcop);
5162 for (; o; o = o->op_next) {
5168 switch (o->op_type) {
5171 PL_curcop = ((COP*)o); /* for warnings */
5172 o->op_seq = PL_op_seqmax++;
5183 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5185 o->op_seq = PL_op_seqmax++;
5188 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5189 o->op_seq = PL_op_seqmax++;
5190 break; /* Scalar stub must produce undef. List stub is noop */
5194 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5195 PL_curcop = ((COP*)o);
5201 if (oldop && o->op_next) {
5202 oldop->op_next = o->op_next;
5205 o->op_seq = PL_op_seqmax++;
5209 if (o->op_next->op_type == OP_RV2SV) {
5210 if (!(o->op_next->op_private & OPpDEREF)) {
5212 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5213 o->op_next = o->op_next->op_next;
5214 o->op_type = OP_GVSV;
5215 o->op_ppaddr = ppaddr[OP_GVSV];
5218 else if (o->op_next->op_type == OP_RV2AV) {
5219 OP* pop = o->op_next->op_next;
5221 if (pop->op_type == OP_CONST &&
5222 (PL_op = pop->op_next) &&
5223 pop->op_next->op_type == OP_AELEM &&
5224 !(pop->op_next->op_private &
5225 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5226 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5230 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5234 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5235 o->op_next = pop->op_next->op_next;
5236 o->op_type = OP_AELEMFAST;
5237 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5238 o->op_private = (U8)i;
5239 GvAVn(((GVOP*)o)->op_gv);
5242 o->op_seq = PL_op_seqmax++;
5249 o->op_seq = PL_op_seqmax++;
5250 while (cLOGOP->op_other->op_type == OP_NULL)
5251 cLOGOP->op_other = cLOGOP->op_other->op_next;
5252 peep(cLOGOP->op_other);
5256 o->op_seq = PL_op_seqmax++;
5257 peep(cCONDOP->op_true);
5258 peep(cCONDOP->op_false);
5262 o->op_seq = PL_op_seqmax++;
5263 peep(cLOOP->op_redoop);
5264 peep(cLOOP->op_nextop);
5265 peep(cLOOP->op_lastop);
5271 o->op_seq = PL_op_seqmax++;
5272 peep(cPMOP->op_pmreplstart);
5276 o->op_seq = PL_op_seqmax++;
5277 if (ckWARN(WARN_SYNTAX) && o->op_next
5278 && o->op_next->op_type == OP_NEXTSTATE) {
5279 if (o->op_next->op_sibling &&
5280 o->op_next->op_sibling->op_type != OP_EXIT &&
5281 o->op_next->op_sibling->op_type != OP_WARN &&
5282 o->op_next->op_sibling->op_type != OP_DIE) {
5283 line_t oldline = PL_curcop->cop_line;
5285 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5286 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5287 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5288 PL_curcop->cop_line = oldline;
5302 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5303 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5305 rop = (UNOP*)((BINOP*)o)->op_first;
5306 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5308 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5309 if (!SvOBJECT(lexname))
5311 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5312 if (!fields || !GvHV(*fields))
5314 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5315 key = SvPV(*svp, keylen);
5316 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5318 croak("No such field \"%s\" in variable %s of type %s",
5319 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5321 ind = SvIV(*indsvp);
5323 croak("Bad index while coercing array into hash");
5324 rop->op_type = OP_RV2AV;
5325 rop->op_ppaddr = ppaddr[OP_RV2AV];
5326 o->op_type = OP_AELEM;
5327 o->op_ppaddr = ppaddr[OP_AELEM];
5329 *svp = newSViv(ind);
5334 o->op_seq = PL_op_seqmax++;