3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*check
24 #define CHECKCALL *check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
59 SV* tmpsv = sv_newmortal();
60 gv_efullname3(tmpsv, gv, Nullch);
61 return SvPV(tmpsv,PL_na);
67 yyerror(form("Missing comma after first argument to %s function",
68 op_desc[o->op_type]));
73 too_few_arguments(OP *o, char *name)
75 yyerror(form("Not enough arguments for %s", name));
80 too_many_arguments(OP *o, char *name)
82 yyerror(form("Too many arguments for %s", name));
87 bad_type(I32 n, char *t, char *name, OP *kid)
89 yyerror(form("Type of arg %d to %s must be %s (not %s)",
90 (int)n, name, t, op_desc[kid->op_type]));
96 int type = o->op_type;
97 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
98 yyerror(form("Can't use subscript on %s", op_desc[type]));
99 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
101 SV *msg = sv_2mortal(
102 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
103 type == OP_ENTERSUB ? '&' : '%'));
107 sv_catsv(GvSV(PL_errgv), msg);
109 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
114 /* "register" allocation */
117 pad_allocmy(char *name)
123 if (!(isALPHA(name[1]) || name[1] == '_' && (int)strlen(name) > 2)) {
124 if (!isPRINT(name[1])) {
126 name[2] = toCTRL(name[1]);
129 croak("Can't use global %s in \"my\"",name);
131 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
132 SV **svp = AvARRAY(PL_comppad_name);
133 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
135 && sv != &PL_sv_undef
136 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
137 && strEQ(name, SvPVX(sv)))
140 "\"my\" variable %s masks earlier declaration in same %s",
141 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
146 off = pad_alloc(OP_PADSV, SVs_PADMY);
148 sv_upgrade(sv, SVt_PVNV);
150 if (PL_in_my_stash) {
152 croak("Can't declare class for non-scalar %s in \"my\"",name);
154 (void)SvUPGRADE(sv, SVt_PVMG);
155 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
158 av_store(PL_comppad_name, off, sv);
159 SvNVX(sv) = (double)PAD_MAX;
160 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
161 if (!PL_min_intro_pending)
162 PL_min_intro_pending = off;
163 PL_max_intro_pending = off;
165 av_store(PL_comppad, off, (SV*)newAV());
166 else if (*name == '%')
167 av_store(PL_comppad, off, (SV*)newHV());
168 SvPADMY_on(PL_curpad[off]);
173 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
180 register PERL_CONTEXT *cx;
182 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
183 AV *curlist = CvPADLIST(cv);
184 SV **svp = av_fetch(curlist, 0, FALSE);
187 if (!svp || *svp == &PL_sv_undef)
190 svp = AvARRAY(curname);
191 for (off = AvFILLp(curname); off > 0; off--) {
192 if ((sv = svp[off]) &&
193 sv != &PL_sv_undef &&
195 seq > I_32(SvNVX(sv)) &&
196 strEQ(SvPVX(sv), name))
207 return 0; /* don't clone from inactive stack frame */
211 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
212 oldsv = *av_fetch(oldpad, off, TRUE);
213 if (!newoff) { /* Not a mere clone operation. */
214 SV *namesv = NEWSV(1103,0);
215 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
216 sv_upgrade(namesv, SVt_PVNV);
217 sv_setpv(namesv, name);
218 av_store(PL_comppad_name, newoff, namesv);
219 SvNVX(namesv) = (double)PL_curcop->cop_seq;
220 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
221 SvFAKE_on(namesv); /* A ref, not a real var */
222 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
223 /* "It's closures all the way down." */
224 CvCLONE_on(PL_compcv);
226 if (CvANON(PL_compcv))
227 oldsv = Nullsv; /* no need to keep ref */
232 bcv && bcv != cv && !CvCLONE(bcv);
233 bcv = CvOUTSIDE(bcv))
238 if (ckWARN(WARN_CLOSURE)
239 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
242 "Variable \"%s\" may be unavailable",
250 else if (!CvUNIQUE(PL_compcv)) {
251 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
253 "Variable \"%s\" will not stay shared", name);
256 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
262 /* Nothing in current lexical context--try eval's context, if any.
263 * This is necessary to let the perldb get at lexically scoped variables.
264 * XXX This will also probably interact badly with eval tree caching.
267 for (i = cx_ix; i >= 0; i--) {
269 switch (CxTYPE(cx)) {
271 if (i == 0 && saweval) {
272 seq = cxstack[saweval].blk_oldcop->cop_seq;
273 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
277 switch (cx->blk_eval.old_op_type) {
283 /* require must have its own scope */
291 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
292 saweval = i; /* so we know where we were called from */
295 seq = cxstack[saweval].blk_oldcop->cop_seq;
296 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
304 pad_findmy(char *name)
310 SV **svp = AvARRAY(PL_comppad_name);
311 U32 seq = PL_cop_seqmax;
316 * Special case to get lexical (and hence per-thread) @_.
317 * XXX I need to find out how to tell at parse-time whether use
318 * of @_ should refer to a lexical (from a sub) or defgv (global
319 * scope and maybe weird sub-ish things like formats). See
320 * startsub in perly.y. It's possible that @_ could be lexical
321 * (at least from subs) even in non-threaded perl.
323 if (strEQ(name, "@_"))
324 return 0; /* success. (NOT_IN_PAD indicates failure) */
325 #endif /* USE_THREADS */
327 /* The one we're looking for is probably just before comppad_name_fill. */
328 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
329 if ((sv = svp[off]) &&
330 sv != &PL_sv_undef &&
333 seq > I_32(SvNVX(sv)))) &&
334 strEQ(SvPVX(sv), name))
337 return (PADOFFSET)off;
338 pendoff = off; /* this pending def. will override import */
342 /* Check if if we're in an eval'', and adjust seq to be the eval's
344 if (cxstack_ix >= 0) {
345 cx = &cxstack[cxstack_ix];
347 seq = cx->blk_oldcop->cop_seq;
350 /* See if it's in a nested scope */
351 off = pad_findlex(name, 0, seq, CvOUTSIDE(PL_compcv), cxstack_ix, 0);
353 /* If there is a pending local definition, this new alias must die */
355 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
356 return off; /* pad_findlex returns 0 for failure...*/
358 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
362 pad_leavemy(I32 fill)
365 SV **svp = AvARRAY(PL_comppad_name);
367 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
368 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
369 if ((sv = svp[off]) && sv != &PL_sv_undef)
370 warn("%s never introduced", SvPVX(sv));
373 /* "Deintroduce" my variables that are leaving with this scope. */
374 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
375 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
376 SvIVX(sv) = PL_cop_seqmax;
381 pad_alloc(I32 optype, U32 tmptype)
387 if (AvARRAY(PL_comppad) != PL_curpad)
388 croak("panic: pad_alloc");
389 if (PL_pad_reset_pending)
391 if (tmptype & SVs_PADMY) {
393 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
394 } while (SvPADBUSY(sv)); /* need a fresh one */
395 retval = AvFILLp(PL_comppad);
398 SV **names = AvARRAY(PL_comppad_name);
399 SSize_t names_fill = AvFILLp(PL_comppad_name);
402 * "foreach" index vars temporarily become aliases to non-"my"
403 * values. Thus we must skip, not just pad values that are
404 * marked as current pad values, but also those with names.
406 if (++PL_padix <= names_fill &&
407 (sv = names[PL_padix]) && sv != &PL_sv_undef)
409 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
410 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
415 SvFLAGS(sv) |= tmptype;
416 PL_curpad = AvARRAY(PL_comppad);
418 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
419 (unsigned long) thr, (unsigned long) PL_curpad,
420 (long) retval, op_name[optype]));
422 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
423 (unsigned long) PL_curpad,
424 (long) retval, op_name[optype]));
425 #endif /* USE_THREADS */
426 return (PADOFFSET)retval;
434 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
435 (unsigned long) thr, (unsigned long) PL_curpad, po));
438 croak("panic: pad_sv po");
439 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
440 (unsigned long) PL_curpad, po));
441 #endif /* USE_THREADS */
442 return PL_curpad[po]; /* eventually we'll turn this into a macro */
446 pad_free(PADOFFSET po)
451 if (AvARRAY(PL_comppad) != PL_curpad)
452 croak("panic: pad_free curpad");
454 croak("panic: pad_free po");
456 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
457 (unsigned long) thr, (unsigned long) PL_curpad, po));
459 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
460 (unsigned long) PL_curpad, po));
461 #endif /* USE_THREADS */
462 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
463 SvPADTMP_off(PL_curpad[po]);
464 if ((I32)po < PL_padix)
469 pad_swipe(PADOFFSET po)
472 if (AvARRAY(PL_comppad) != PL_curpad)
473 croak("panic: pad_swipe curpad");
475 croak("panic: pad_swipe po");
477 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
478 (unsigned long) thr, (unsigned long) PL_curpad, po));
480 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
481 (unsigned long) PL_curpad, po));
482 #endif /* USE_THREADS */
483 SvPADTMP_off(PL_curpad[po]);
484 PL_curpad[po] = NEWSV(1107,0);
485 SvPADTMP_on(PL_curpad[po]);
486 if ((I32)po < PL_padix)
490 /* XXX pad_reset() is currently disabled because it results in serious bugs.
491 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
492 * on the stack by OPs that use them, there are several ways to get an alias
493 * to a shared TARG. Such an alias will change randomly and unpredictably.
494 * We avoid doing this until we can think of a Better Way.
499 #ifdef USE_BROKEN_PAD_RESET
503 if (AvARRAY(PL_comppad) != PL_curpad)
504 croak("panic: pad_reset curpad");
506 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
507 (unsigned long) thr, (unsigned long) PL_curpad));
509 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
510 (unsigned long) PL_curpad));
511 #endif /* USE_THREADS */
512 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
513 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
514 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
515 SvPADTMP_off(PL_curpad[po]);
517 PL_padix = PL_padix_floor;
520 PL_pad_reset_pending = FALSE;
524 /* find_threadsv is not reentrant */
526 find_threadsv(char *name)
532 /* We currently only handle names of a single character */
533 p = strchr(PL_threadsv_names, *name);
536 key = p - PL_threadsv_names;
537 svp = av_fetch(thr->threadsv, key, FALSE);
539 SV *sv = NEWSV(0, 0);
540 av_store(thr->threadsv, key, sv);
541 thr->threadsvp = AvARRAY(thr->threadsv);
543 * Some magic variables used to be automagically initialised
544 * in gv_fetchpv. Those which are now per-thread magicals get
545 * initialised here instead.
551 sv_setpv(sv, "\034");
552 sv_magic(sv, 0, 0, name, 1);
557 PL_sawampersand = TRUE;
561 /* XXX %! tied to Errno.pm needs to be added here.
562 * See gv_fetchpv(). */
566 sv_magic(sv, 0, 0, name, 1);
568 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
569 "find_threadsv: new SV %p for $%s%c\n",
570 sv, (*name < 32) ? "^" : "",
571 (*name < 32) ? toCTRL(*name) : *name));
575 #endif /* USE_THREADS */
582 register OP *kid, *nextkid;
584 if (!o || o->op_seq == (U16)-1)
587 if (o->op_flags & OPf_KIDS) {
588 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
589 nextkid = kid->op_sibling; /* Get before next freeing kid */
594 switch (o->op_type) {
596 o->op_targ = 0; /* Was holding old type, if any. */
599 o->op_targ = 0; /* Was holding hints. */
603 if (!(o->op_flags & OPf_SPECIAL))
607 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
609 #endif /* USE_THREADS */
611 if (!(o->op_flags & OPf_REF)
612 || (check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
618 SvREFCNT_dec(cGVOPo->op_gv);
622 Safefree(cCOPo->cop_label);
623 SvREFCNT_dec(cCOPo->cop_filegv);
624 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
625 SvREFCNT_dec(cCOPo->cop_warnings);
628 SvREFCNT_dec(cSVOPo->op_sv);
634 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
638 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
639 SvREFCNT_dec(cSVOPo->op_sv);
641 Safefree(cPVOPo->op_pv);
644 op_free(cPMOPo->op_pmreplroot);
649 ReREFCNT_dec(cPMOPo->op_pmregexp);
654 pad_free(o->op_targ);
662 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
663 pad_free(o->op_targ);
664 o->op_targ = o->op_type;
665 o->op_type = OP_NULL;
666 o->op_ppaddr = ppaddr[OP_NULL];
669 /* Contextualizers */
671 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
681 /* establish postfix order */
682 if (cUNOPo->op_first) {
683 o->op_next = LINKLIST(cUNOPo->op_first);
684 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
686 kid->op_next = LINKLIST(kid->op_sibling);
701 if (o && o->op_flags & OPf_KIDS) {
702 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
711 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
713 if (ckWARN(WARN_SYNTAX)) {
714 line_t oldline = PL_curcop->cop_line;
716 if (PL_copline != NOLINE)
717 PL_curcop->cop_line = PL_copline;
718 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
719 PL_curcop->cop_line = oldline;
730 /* assumes no premature commitment */
731 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
732 || o->op_type == OP_RETURN)
735 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
737 switch (o->op_type) {
739 if (o->op_private & OPpREPEAT_DOLIST)
740 null(((LISTOP*)cBINOPo->op_first)->op_first);
741 scalar(cBINOPo->op_first);
746 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
750 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
751 if (!kPMOP->op_pmreplroot)
752 deprecate("implicit split to @_");
760 if (o->op_flags & OPf_KIDS) {
761 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
767 kid = cLISTOPo->op_first;
769 while (kid = kid->op_sibling) {
775 WITH_THR(PL_curcop = &PL_compiling);
780 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
786 WITH_THR(PL_curcop = &PL_compiling);
799 /* assumes no premature commitment */
800 if (!o || (o->op_flags & OPf_WANT) == OPf_WANT_LIST || PL_error_count
801 || o->op_type == OP_RETURN)
804 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
806 switch (o->op_type) {
808 if (!(opargs[o->op_type] & OA_FOLDCONST))
812 if (o->op_flags & OPf_STACKED)
816 if (o->op_private == 4)
887 if (!(o->op_private & OPpLVAL_INTRO))
888 useless = op_desc[o->op_type];
895 if (!(o->op_private & OPpLVAL_INTRO) &&
896 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
897 useless = "a variable";
902 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
909 if (ckWARN(WARN_VOID)) {
910 useless = "a constant";
911 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
913 else if (SvPOK(sv)) {
914 if (strnEQ(SvPVX(sv), "di", 2) ||
915 strnEQ(SvPVX(sv), "ds", 2) ||
916 strnEQ(SvPVX(sv), "ig", 2))
921 null(o); /* don't execute a constant */
922 SvREFCNT_dec(sv); /* don't even remember it */
926 o->op_type = OP_PREINC; /* pre-increment is faster */
927 o->op_ppaddr = ppaddr[OP_PREINC];
931 o->op_type = OP_PREDEC; /* pre-decrement is faster */
932 o->op_ppaddr = ppaddr[OP_PREDEC];
938 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
943 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
944 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
945 if (o->op_flags & OPf_STACKED)
951 if (!(o->op_flags & OPf_KIDS))
960 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
967 /* all requires must return a boolean value */
968 o->op_flags &= ~OPf_WANT;
971 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
972 if (!kPMOP->op_pmreplroot)
973 deprecate("implicit split to @_");
979 if (ckWARN(WARN_VOID))
980 warner(WARN_VOID, "Useless use of %s in void context", useless);
989 if (o && o->op_flags & OPf_KIDS) {
990 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1001 /* assumes no premature commitment */
1002 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1003 || o->op_type == OP_RETURN)
1006 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1008 switch (o->op_type) {
1011 list(cBINOPo->op_first);
1016 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1024 if (!(o->op_flags & OPf_KIDS))
1026 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1027 list(cBINOPo->op_first);
1028 return gen_constant_list(o);
1035 kid = cLISTOPo->op_first;
1037 while (kid = kid->op_sibling) {
1038 if (kid->op_sibling)
1043 WITH_THR(PL_curcop = &PL_compiling);
1047 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1048 if (kid->op_sibling)
1053 WITH_THR(PL_curcop = &PL_compiling);
1056 /* all requires must return a boolean value */
1057 o->op_flags &= ~OPf_WANT;
1069 if (o->op_type == OP_LINESEQ ||
1070 o->op_type == OP_SCOPE ||
1071 o->op_type == OP_LEAVE ||
1072 o->op_type == OP_LEAVETRY)
1075 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1076 if (kid->op_sibling) {
1080 PL_curcop = &PL_compiling;
1082 o->op_flags &= ~OPf_PARENS;
1083 if (PL_hints & HINT_BLOCK_SCOPE)
1084 o->op_flags |= OPf_PARENS;
1087 o = newOP(OP_STUB, 0);
1092 modkids(OP *o, I32 type)
1095 if (o && o->op_flags & OPf_KIDS) {
1096 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1103 mod(OP *o, I32 type)
1109 if (!o || PL_error_count)
1112 switch (o->op_type) {
1117 if (!(o->op_private & (OPpCONST_ARYBASE)))
1119 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1120 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1124 SAVEI32(PL_compiling.cop_arybase);
1125 PL_compiling.cop_arybase = 0;
1127 else if (type == OP_REFGEN)
1130 croak("That use of $[ is unsupported");
1133 if (o->op_flags & OPf_PARENS)
1137 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1138 !(o->op_flags & OPf_STACKED)) {
1139 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1140 o->op_ppaddr = ppaddr[OP_RV2CV];
1141 assert(cUNOPo->op_first->op_type == OP_NULL);
1142 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1148 /* grep, foreach, subcalls, refgen */
1149 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1151 yyerror(form("Can't modify %s in %s",
1152 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1153 ? "do block" : op_desc[o->op_type]),
1154 type ? op_desc[type] : "local"));
1168 case OP_RIGHT_SHIFT:
1177 if (!(o->op_flags & OPf_STACKED))
1183 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1189 if (!type && cUNOPo->op_first->op_type != OP_GV)
1190 croak("Can't localize through a reference");
1191 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1192 PL_modcount = 10000;
1193 return o; /* Treat \(@foo) like ordinary list. */
1197 if (scalar_mod_type(o, type))
1199 ref(cUNOPo->op_first, o->op_type);
1208 PL_modcount = 10000;
1211 if (!type && cUNOPo->op_first->op_type != OP_GV)
1212 croak("Can't localize through a reference");
1213 ref(cUNOPo->op_first, o->op_type);
1217 PL_hints |= HINT_BLOCK_SCOPE;
1225 PL_modcount = 10000;
1226 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1227 return o; /* Treat \(@foo) like ordinary list. */
1228 if (scalar_mod_type(o, type))
1234 croak("Can't localize lexical variable %s",
1235 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), PL_na));
1240 PL_modcount++; /* XXX ??? */
1242 #endif /* USE_THREADS */
1248 if (type != OP_SASSIGN)
1252 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1258 pad_free(o->op_targ);
1259 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1260 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1261 if (o->op_flags & OPf_KIDS)
1262 mod(cBINOPo->op_first->op_sibling, type);
1267 ref(cBINOPo->op_first, o->op_type);
1268 if (type == OP_ENTERSUB &&
1269 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1270 o->op_private |= OPpLVAL_DEFER;
1277 if (o->op_flags & OPf_KIDS)
1278 mod(cLISTOPo->op_last, type);
1282 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1284 else if (!(o->op_flags & OPf_KIDS))
1286 if (o->op_targ != OP_LIST) {
1287 mod(cBINOPo->op_first, type);
1292 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1296 o->op_flags |= OPf_MOD;
1298 if (type == OP_AASSIGN || type == OP_SASSIGN)
1299 o->op_flags |= OPf_SPECIAL|OPf_REF;
1301 o->op_private |= OPpLVAL_INTRO;
1302 o->op_flags &= ~OPf_SPECIAL;
1303 PL_hints |= HINT_BLOCK_SCOPE;
1305 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1306 o->op_flags |= OPf_REF;
1311 scalar_mod_type(OP *o, I32 type)
1315 if (o->op_type == OP_RV2GV)
1339 case OP_RIGHT_SHIFT:
1349 case OP_ANDASSIGN: /* may work later */
1350 case OP_ORASSIGN: /* may work later */
1358 refkids(OP *o, I32 type)
1361 if (o && o->op_flags & OPf_KIDS) {
1362 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1369 ref(OP *o, I32 type)
1373 if (!o || PL_error_count)
1376 switch (o->op_type) {
1378 if ((type == OP_DEFINED || type == OP_LOCK) &&
1379 !(o->op_flags & OPf_STACKED)) {
1380 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1381 o->op_ppaddr = ppaddr[OP_RV2CV];
1382 assert(cUNOPo->op_first->op_type == OP_NULL);
1383 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1384 o->op_flags |= OPf_SPECIAL;
1389 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1393 ref(cUNOPo->op_first, o->op_type);
1396 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1397 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1398 : type == OP_RV2HV ? OPpDEREF_HV
1400 o->op_flags |= OPf_MOD;
1405 o->op_flags |= OPf_MOD; /* XXX ??? */
1410 o->op_flags |= OPf_REF;
1413 ref(cUNOPo->op_first, o->op_type);
1418 o->op_flags |= OPf_REF;
1423 if (!(o->op_flags & OPf_KIDS))
1425 ref(cBINOPo->op_first, type);
1429 ref(cBINOPo->op_first, o->op_type);
1430 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1431 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1432 : type == OP_RV2HV ? OPpDEREF_HV
1434 o->op_flags |= OPf_MOD;
1442 if (!(o->op_flags & OPf_KIDS))
1444 ref(cLISTOPo->op_last, type);
1459 if (!o || PL_error_count)
1463 if (type == OP_LIST) {
1464 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1466 } else if (type == OP_UNDEF) {
1468 } else if (type != OP_PADSV &&
1471 type != OP_PUSHMARK)
1473 yyerror(form("Can't declare %s in my", op_desc[o->op_type]));
1476 o->op_flags |= OPf_MOD;
1477 o->op_private |= OPpLVAL_INTRO;
1485 o->op_flags |= OPf_PARENS;
1490 bind_match(I32 type, OP *left, OP *right)
1495 if (ckWARN(WARN_UNSAFE) &&
1496 (left->op_type == OP_RV2AV ||
1497 left->op_type == OP_RV2HV ||
1498 left->op_type == OP_PADAV ||
1499 left->op_type == OP_PADHV)) {
1500 char *desc = op_desc[(right->op_type == OP_SUBST ||
1501 right->op_type == OP_TRANS)
1502 ? right->op_type : OP_MATCH];
1503 char *sample = ((left->op_type == OP_RV2AV ||
1504 left->op_type == OP_PADAV)
1505 ? "@array" : "%hash");
1507 "Applying %s to %s will act on scalar(%s)",
1508 desc, sample, sample);
1511 if (right->op_type == OP_MATCH ||
1512 right->op_type == OP_SUBST ||
1513 right->op_type == OP_TRANS) {
1514 right->op_flags |= OPf_STACKED;
1515 if (right->op_type != OP_MATCH)
1516 left = mod(left, right->op_type);
1517 if (right->op_type == OP_TRANS)
1518 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1520 o = prepend_elem(right->op_type, scalar(left), right);
1522 return newUNOP(OP_NOT, 0, scalar(o));
1526 return bind_match(type, left,
1527 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1535 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1536 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1543 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1544 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1545 o->op_type = OP_LEAVE;
1546 o->op_ppaddr = ppaddr[OP_LEAVE];
1549 if (o->op_type == OP_LINESEQ) {
1551 o->op_type = OP_SCOPE;
1552 o->op_ppaddr = ppaddr[OP_SCOPE];
1553 kid = ((LISTOP*)o)->op_first;
1554 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1555 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1560 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1570 SAVESPTR(GvHV(PL_hintgv));
1571 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1572 SAVEFREESV(GvHV(PL_hintgv));
1576 block_start(int full)
1579 int retval = PL_savestack_ix;
1581 SAVEI32(PL_comppad_name_floor);
1583 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1584 PL_comppad_name_floor = PL_comppad_name_fill;
1586 PL_comppad_name_floor = 0;
1588 SAVEI32(PL_min_intro_pending);
1589 SAVEI32(PL_max_intro_pending);
1590 PL_min_intro_pending = 0;
1591 SAVEI32(PL_comppad_name_fill);
1592 SAVEI32(PL_padix_floor);
1593 PL_padix_floor = PL_padix;
1594 PL_pad_reset_pending = FALSE;
1596 PL_hints &= ~HINT_BLOCK_SCOPE;
1597 SAVEPPTR(PL_compiling.cop_warnings);
1598 if (PL_compiling.cop_warnings != WARN_ALL &&
1599 PL_compiling.cop_warnings != WARN_NONE) {
1600 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1601 SAVEFREESV(PL_compiling.cop_warnings) ;
1609 block_end(I32 floor, OP *seq)
1612 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1613 OP* retval = scalarseq(seq);
1615 PL_pad_reset_pending = FALSE;
1616 PL_compiling.op_private = PL_hints;
1618 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1619 pad_leavemy(PL_comppad_name_fill);
1628 OP *o = newOP(OP_THREADSV, 0);
1629 o->op_targ = find_threadsv("_");
1632 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1633 #endif /* USE_THREADS */
1641 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1642 PL_eval_start = linklist(PL_eval_root);
1643 PL_eval_root->op_next = 0;
1644 peep(PL_eval_start);
1649 PL_main_root = scope(sawparens(scalarvoid(o)));
1650 PL_curcop = &PL_compiling;
1651 PL_main_start = LINKLIST(PL_main_root);
1652 PL_main_root->op_next = 0;
1653 peep(PL_main_start);
1656 /* Register with debugger */
1658 CV *cv = perl_get_cv("DB::postponed", FALSE);
1662 XPUSHs((SV*)PL_compiling.cop_filegv);
1664 perl_call_sv((SV*)cv, G_DISCARD);
1671 localize(OP *o, I32 lex)
1673 if (o->op_flags & OPf_PARENS)
1677 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1679 for (s = PL_bufptr; *s && (isALNUM(*s) || strchr("@$%, ",*s)); s++) ;
1680 if (*s == ';' || *s == '=')
1681 warner(WARN_PARENTHESIS, "Parens missing around \"%s\" list",
1682 lex ? "my" : "local");
1686 PL_in_my_stash = Nullhv;
1690 return mod(o, OP_NULL); /* a bit kludgey */
1696 if (o->op_type == OP_LIST) {
1699 o2 = newOP(OP_THREADSV, 0);
1700 o2->op_targ = find_threadsv(";");
1702 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1703 #endif /* USE_THREADS */
1704 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1710 fold_constants(register OP *o)
1714 I32 type = o->op_type;
1717 if (opargs[type] & OA_RETSCALAR)
1719 if (opargs[type] & OA_TARGET)
1720 o->op_targ = pad_alloc(type, SVs_PADTMP);
1722 if ((opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1723 o->op_ppaddr = ppaddr[type = ++(o->op_type)];
1725 if (!(opargs[type] & OA_FOLDCONST))
1740 if (o->op_private & OPpLOCALE)
1745 goto nope; /* Don't try to run w/ errors */
1747 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1748 if (curop->op_type != OP_CONST &&
1749 curop->op_type != OP_LIST &&
1750 curop->op_type != OP_SCALAR &&
1751 curop->op_type != OP_NULL &&
1752 curop->op_type != OP_PUSHMARK) {
1757 curop = LINKLIST(o);
1761 sv = *(PL_stack_sp--);
1762 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1763 pad_swipe(o->op_targ);
1764 else if (SvTEMP(sv)) { /* grab mortal temp? */
1765 (void)SvREFCNT_inc(sv);
1769 if (type == OP_RV2GV)
1770 return newGVOP(OP_GV, 0, (GV*)sv);
1772 /* try to smush double to int, but don't smush -2.0 to -2 */
1773 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1777 if ((double)iv == SvNV(sv)) {
1782 SvIOK_off(sv); /* undo SvIV() damage */
1784 return newSVOP(OP_CONST, 0, sv);
1788 if (!(opargs[type] & OA_OTHERINT))
1791 if (!(PL_hints & HINT_INTEGER)) {
1792 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1795 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1796 if (curop->op_type == OP_CONST) {
1797 if (SvIOK(((SVOP*)curop)->op_sv))
1801 if (opargs[curop->op_type] & OA_RETINTEGER)
1805 o->op_ppaddr = ppaddr[++(o->op_type)];
1812 gen_constant_list(register OP *o)
1816 I32 oldtmps_floor = PL_tmps_floor;
1820 return o; /* Don't attempt to run with errors */
1822 PL_op = curop = LINKLIST(o);
1828 PL_tmps_floor = oldtmps_floor;
1830 o->op_type = OP_RV2AV;
1831 o->op_ppaddr = ppaddr[OP_RV2AV];
1832 curop = ((UNOP*)o)->op_first;
1833 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1840 convert(I32 type, I32 flags, OP *o)
1845 if (!o || o->op_type != OP_LIST)
1846 o = newLISTOP(OP_LIST, 0, o, Nullop);
1848 o->op_flags &= ~OPf_WANT;
1850 if (!(opargs[type] & OA_MARK))
1851 null(cLISTOPo->op_first);
1854 o->op_ppaddr = ppaddr[type];
1855 o->op_flags |= flags;
1857 o = CHECKOP(type, o);
1858 if (o->op_type != type)
1861 if (cLISTOPo->op_children < 7) {
1862 /* XXX do we really need to do this if we're done appending?? */
1863 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1865 cLISTOPo->op_last = last; /* in case check substituted last arg */
1868 return fold_constants(o);
1871 /* List constructors */
1874 append_elem(I32 type, OP *first, OP *last)
1882 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1883 return newLISTOP(type, 0, first, last);
1885 if (first->op_flags & OPf_KIDS)
1886 ((LISTOP*)first)->op_last->op_sibling = last;
1888 first->op_flags |= OPf_KIDS;
1889 ((LISTOP*)first)->op_first = last;
1891 ((LISTOP*)first)->op_last = last;
1892 ((LISTOP*)first)->op_children++;
1897 append_list(I32 type, LISTOP *first, LISTOP *last)
1905 if (first->op_type != type)
1906 return prepend_elem(type, (OP*)first, (OP*)last);
1908 if (last->op_type != type)
1909 return append_elem(type, (OP*)first, (OP*)last);
1911 first->op_last->op_sibling = last->op_first;
1912 first->op_last = last->op_last;
1913 first->op_children += last->op_children;
1914 if (first->op_children)
1915 last->op_flags |= OPf_KIDS;
1922 prepend_elem(I32 type, OP *first, OP *last)
1930 if (last->op_type == type) {
1931 if (type == OP_LIST) { /* already a PUSHMARK there */
1932 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1933 ((LISTOP*)last)->op_first->op_sibling = first;
1936 if (!(last->op_flags & OPf_KIDS)) {
1937 ((LISTOP*)last)->op_last = first;
1938 last->op_flags |= OPf_KIDS;
1940 first->op_sibling = ((LISTOP*)last)->op_first;
1941 ((LISTOP*)last)->op_first = first;
1943 ((LISTOP*)last)->op_children++;
1947 return newLISTOP(type, 0, first, last);
1955 return newOP(OP_STUB, 0);
1961 if (!o || o->op_type != OP_LIST)
1962 o = newLISTOP(OP_LIST, 0, o, Nullop);
1968 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
1972 Newz(1101, listop, 1, LISTOP);
1974 listop->op_type = type;
1975 listop->op_ppaddr = ppaddr[type];
1976 listop->op_children = (first != 0) + (last != 0);
1977 listop->op_flags = flags;
1981 else if (!first && last)
1984 first->op_sibling = last;
1985 listop->op_first = first;
1986 listop->op_last = last;
1987 if (type == OP_LIST) {
1989 pushop = newOP(OP_PUSHMARK, 0);
1990 pushop->op_sibling = first;
1991 listop->op_first = pushop;
1992 listop->op_flags |= OPf_KIDS;
1994 listop->op_last = pushop;
1996 else if (listop->op_children)
1997 listop->op_flags |= OPf_KIDS;
2003 newOP(I32 type, I32 flags)
2006 Newz(1101, o, 1, OP);
2008 o->op_ppaddr = ppaddr[type];
2009 o->op_flags = flags;
2012 o->op_private = 0 + (flags >> 8);
2013 if (opargs[type] & OA_RETSCALAR)
2015 if (opargs[type] & OA_TARGET)
2016 o->op_targ = pad_alloc(type, SVs_PADTMP);
2017 return CHECKOP(type, o);
2021 newUNOP(I32 type, I32 flags, OP *first)
2026 first = newOP(OP_STUB, 0);
2027 if (opargs[type] & OA_MARK)
2028 first = force_list(first);
2030 Newz(1101, unop, 1, UNOP);
2031 unop->op_type = type;
2032 unop->op_ppaddr = ppaddr[type];
2033 unop->op_first = first;
2034 unop->op_flags = flags | OPf_KIDS;
2035 unop->op_private = 1 | (flags >> 8);
2036 unop = (UNOP*) CHECKOP(type, unop);
2040 return fold_constants((OP *) unop);
2044 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2047 Newz(1101, binop, 1, BINOP);
2050 first = newOP(OP_NULL, 0);
2052 binop->op_type = type;
2053 binop->op_ppaddr = ppaddr[type];
2054 binop->op_first = first;
2055 binop->op_flags = flags | OPf_KIDS;
2058 binop->op_private = 1 | (flags >> 8);
2061 binop->op_private = 2 | (flags >> 8);
2062 first->op_sibling = last;
2065 binop = (BINOP*)CHECKOP(type, binop);
2069 binop->op_last = last = binop->op_first->op_sibling;
2071 return fold_constants((OP *)binop);
2075 utf8compare(const void *a, const void *b)
2078 for (i = 0; i < 10; i++) {
2079 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2081 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2088 pmtrans(OP *o, OP *expr, OP *repl)
2090 SV *tstr = ((SVOP*)expr)->op_sv;
2091 SV *rstr = ((SVOP*)repl)->op_sv;
2094 register U8 *t = (U8*)SvPV(tstr, tlen);
2095 register U8 *r = (U8*)SvPV(rstr, rlen);
2101 register short *tbl;
2103 complement = o->op_private & OPpTRANS_COMPLEMENT;
2104 del = o->op_private & OPpTRANS_DELETE;
2105 squash = o->op_private & OPpTRANS_SQUASH;
2107 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2108 SV* listsv = newSVpv("# comment\n",0);
2110 U8* tend = t + tlen;
2111 U8* rend = r + rlen;
2127 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2128 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2134 New(1109, cp, tlen, U8*);
2136 transv = newSVpv("",0);
2145 qsort(cp, i, sizeof(U8*), utf8compare);
2146 for (j = 0; j < i; j++) {
2148 UV val = utf8_to_uv(s, &ulen);
2150 diff = val - nextmin;
2152 t = uv_to_utf8(tmpbuf,nextmin);
2153 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2155 t = uv_to_utf8(tmpbuf, val - 1);
2156 sv_catpvn(transv, "\377", 1);
2157 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2161 val = utf8_to_uv(s+1, &ulen);
2165 t = uv_to_utf8(tmpbuf,nextmin);
2166 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2167 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2168 sv_catpvn(transv, "\377", 1);
2169 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2170 t = (U8*)SvPVX(transv);
2171 tlen = SvCUR(transv);
2174 else if (!rlen && !del) {
2175 r = t; rlen = tlen; rend = tend;
2178 if (to_utf && from_utf) { /* only counting characters */
2179 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2180 o->op_private |= OPpTRANS_IDENTICAL;
2182 else { /* straight latin-1 translation */
2183 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2184 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2185 o->op_private |= OPpTRANS_IDENTICAL;
2189 while (t < tend || tfirst <= tlast) {
2190 /* see if we need more "t" chars */
2191 if (tfirst > tlast) {
2192 tfirst = (I32)utf8_to_uv(t, &ulen);
2194 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2195 tlast = (I32)utf8_to_uv(++t, &ulen);
2202 /* now see if we need more "r" chars */
2203 if (rfirst > rlast) {
2205 rfirst = (I32)utf8_to_uv(r, &ulen);
2207 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2208 rlast = (I32)utf8_to_uv(++r, &ulen);
2217 rfirst = rlast = 0xffffffff;
2221 /* now see which range will peter our first, if either. */
2222 tdiff = tlast - tfirst;
2223 rdiff = rlast - rfirst;
2230 if (rfirst == 0xffffffff) {
2231 diff = tdiff; /* oops, pretend rdiff is infinite */
2233 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2235 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2239 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2241 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2243 if (rfirst + diff > max)
2244 max = rfirst + diff;
2249 else if (rfirst <= 0x800)
2250 grows |= (tfirst < 0x80);
2251 else if (rfirst <= 0x10000)
2252 grows |= (tfirst < 0x800);
2253 else if (rfirst <= 0x200000)
2254 grows |= (tfirst < 0x10000);
2255 else if (rfirst <= 0x4000000)
2256 grows |= (tfirst < 0x200000);
2257 else if (rfirst <= 0x80000000)
2258 grows |= (tfirst < 0x4000000);
2270 else if (max > 0xff)
2275 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2276 SvREFCNT_dec(listsv);
2278 SvREFCNT_dec(transv);
2280 if (!del && havefinal)
2281 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2283 if (grows && to_utf)
2284 o->op_private |= OPpTRANS_GROWS;
2291 tbl = (short*)cPVOPo->op_pv;
2293 Zero(tbl, 256, short);
2294 for (i = 0; i < tlen; i++)
2296 for (i = 0, j = 0; i < 256; i++) {
2312 if (!rlen && !del) {
2315 o->op_private |= OPpTRANS_IDENTICAL;
2317 for (i = 0; i < 256; i++)
2319 for (i = 0, j = 0; i < tlen; i++,j++) {
2322 if (tbl[t[i]] == -1)
2328 if (tbl[t[i]] == -1)
2339 newPMOP(I32 type, I32 flags)
2344 Newz(1101, pmop, 1, PMOP);
2345 pmop->op_type = type;
2346 pmop->op_ppaddr = ppaddr[type];
2347 pmop->op_flags = flags;
2348 pmop->op_private = 0 | (flags >> 8);
2350 if (PL_hints & HINT_RE_TAINT)
2351 pmop->op_pmpermflags |= PMf_RETAINT;
2352 if (PL_hints & HINT_LOCALE)
2353 pmop->op_pmpermflags |= PMf_LOCALE;
2354 pmop->op_pmflags = pmop->op_pmpermflags;
2356 /* link into pm list */
2357 if (type != OP_TRANS && PL_curstash) {
2358 pmop->op_pmnext = HvPMROOT(PL_curstash);
2359 HvPMROOT(PL_curstash) = pmop;
2366 pmruntime(OP *o, OP *expr, OP *repl)
2371 I32 repl_has_vars = 0;
2373 if (o->op_type == OP_TRANS)
2374 return pmtrans(o, expr, repl);
2376 PL_hints |= HINT_BLOCK_SCOPE;
2379 if (expr->op_type == OP_CONST) {
2381 SV *pat = ((SVOP*)expr)->op_sv;
2382 char *p = SvPV(pat, plen);
2383 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2384 sv_setpvn(pat, "\\s+", 3);
2385 p = SvPV(pat, plen);
2386 pm->op_pmflags |= PMf_SKIPWHITE;
2388 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2389 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2390 pm->op_pmflags |= PMf_WHITE;
2394 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2395 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2397 : OP_REGCMAYBE),0,expr);
2399 Newz(1101, rcop, 1, LOGOP);
2400 rcop->op_type = OP_REGCOMP;
2401 rcop->op_ppaddr = ppaddr[OP_REGCOMP];
2402 rcop->op_first = scalar(expr);
2403 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2404 ? (OPf_SPECIAL | OPf_KIDS)
2406 rcop->op_private = 1;
2409 /* establish postfix order */
2410 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2412 rcop->op_next = expr;
2413 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2416 rcop->op_next = LINKLIST(expr);
2417 expr->op_next = (OP*)rcop;
2420 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2425 if (pm->op_pmflags & PMf_EVAL)
2428 else if (repl->op_type == OP_THREADSV
2429 && strchr("&`'123456789+",
2430 PL_threadsv_names[repl->op_targ]))
2434 #endif /* USE_THREADS */
2435 else if (repl->op_type == OP_CONST)
2439 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2440 if (opargs[curop->op_type] & OA_DANGEROUS) {
2442 if (curop->op_type == OP_THREADSV) {
2444 if (strchr("&`'123456789+", curop->op_private))
2448 if (curop->op_type == OP_GV) {
2449 GV *gv = ((GVOP*)curop)->op_gv;
2451 if (strchr("&`'123456789+", *GvENAME(gv)))
2454 #endif /* USE_THREADS */
2455 else if (curop->op_type == OP_RV2CV)
2457 else if (curop->op_type == OP_RV2SV ||
2458 curop->op_type == OP_RV2AV ||
2459 curop->op_type == OP_RV2HV ||
2460 curop->op_type == OP_RV2GV) {
2461 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2464 else if (curop->op_type == OP_PADSV ||
2465 curop->op_type == OP_PADAV ||
2466 curop->op_type == OP_PADHV ||
2467 curop->op_type == OP_PADANY) {
2470 else if (curop->op_type == OP_PUSHRE)
2471 ; /* Okay here, dangerous in newASSIGNOP */
2480 && (!pm->op_pmregexp
2481 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2482 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2483 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2484 prepend_elem(o->op_type, scalar(repl), o);
2487 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2488 pm->op_pmflags |= PMf_MAYBE_CONST;
2489 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2491 Newz(1101, rcop, 1, LOGOP);
2492 rcop->op_type = OP_SUBSTCONT;
2493 rcop->op_ppaddr = ppaddr[OP_SUBSTCONT];
2494 rcop->op_first = scalar(repl);
2495 rcop->op_flags |= OPf_KIDS;
2496 rcop->op_private = 1;
2499 /* establish postfix order */
2500 rcop->op_next = LINKLIST(repl);
2501 repl->op_next = (OP*)rcop;
2503 pm->op_pmreplroot = scalar((OP*)rcop);
2504 pm->op_pmreplstart = LINKLIST(rcop);
2513 newSVOP(I32 type, I32 flags, SV *sv)
2516 Newz(1101, svop, 1, SVOP);
2517 svop->op_type = type;
2518 svop->op_ppaddr = ppaddr[type];
2520 svop->op_next = (OP*)svop;
2521 svop->op_flags = flags;
2522 if (opargs[type] & OA_RETSCALAR)
2524 if (opargs[type] & OA_TARGET)
2525 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2526 return CHECKOP(type, svop);
2530 newGVOP(I32 type, I32 flags, GV *gv)
2534 Newz(1101, gvop, 1, GVOP);
2535 gvop->op_type = type;
2536 gvop->op_ppaddr = ppaddr[type];
2537 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2538 gvop->op_next = (OP*)gvop;
2539 gvop->op_flags = flags;
2540 if (opargs[type] & OA_RETSCALAR)
2542 if (opargs[type] & OA_TARGET)
2543 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2544 return CHECKOP(type, gvop);
2548 newPVOP(I32 type, I32 flags, char *pv)
2551 Newz(1101, pvop, 1, PVOP);
2552 pvop->op_type = type;
2553 pvop->op_ppaddr = ppaddr[type];
2555 pvop->op_next = (OP*)pvop;
2556 pvop->op_flags = flags;
2557 if (opargs[type] & OA_RETSCALAR)
2559 if (opargs[type] & OA_TARGET)
2560 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2561 return CHECKOP(type, pvop);
2570 save_hptr(&PL_curstash);
2571 save_item(PL_curstname);
2576 name = SvPV(sv, len);
2577 PL_curstash = gv_stashpvn(name,len,TRUE);
2578 sv_setpvn(PL_curstname, name, len);
2582 sv_setpv(PL_curstname,"<none>");
2583 PL_curstash = Nullhv;
2585 PL_copline = NOLINE;
2590 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2599 if (id->op_type != OP_CONST)
2600 croak("Module name must be constant");
2604 if(version != Nullop) {
2605 SV *vesv = ((SVOP*)version)->op_sv;
2607 if (arg == Nullop && !SvNIOK(vesv)) {
2614 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2615 croak("Version number must be constant number");
2617 /* Make copy of id so we don't free it twice */
2618 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2620 /* Fake up a method call to VERSION */
2621 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2622 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2623 append_elem(OP_LIST,
2624 prepend_elem(OP_LIST, pack, list(version)),
2625 newUNOP(OP_METHOD, 0, meth)));
2629 /* Fake up an import/unimport */
2630 if (arg && arg->op_type == OP_STUB)
2631 imop = arg; /* no import on explicit () */
2632 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2633 imop = Nullop; /* use 5.0; */
2636 /* Make copy of id so we don't free it twice */
2637 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2638 meth = newSVOP(OP_CONST, 0,
2640 ? newSVpv("import", 6)
2641 : newSVpv("unimport", 8)
2643 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2644 append_elem(OP_LIST,
2645 prepend_elem(OP_LIST, pack, list(arg)),
2646 newUNOP(OP_METHOD, 0, meth)));
2649 /* Fake up a require, handle override, if any */
2650 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2651 if (!(gv && GvIMPORTED_CV(gv)))
2652 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2654 if (gv && GvIMPORTED_CV(gv)) {
2655 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2656 append_elem(OP_LIST, id,
2657 scalar(newUNOP(OP_RV2CV, 0,
2662 rqop = newUNOP(OP_REQUIRE, 0, id);
2665 /* Fake up the BEGIN {}, which does its thing immediately. */
2667 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2669 append_elem(OP_LINESEQ,
2670 append_elem(OP_LINESEQ,
2671 newSTATEOP(0, Nullch, rqop),
2672 newSTATEOP(0, Nullch, veop)),
2673 newSTATEOP(0, Nullch, imop) ));
2675 PL_copline = NOLINE;
2685 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2686 if (!(gv && GvIMPORTED_CV(gv)))
2687 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2689 if (gv && GvIMPORTED_CV(gv)) {
2690 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2691 append_elem(OP_LIST, term,
2692 scalar(newUNOP(OP_RV2CV, 0,
2697 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2703 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2705 return newBINOP(OP_LSLICE, flags,
2706 list(force_list(subscript)),
2707 list(force_list(listval)) );
2711 list_assignment(register OP *o)
2716 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2717 o = cUNOPo->op_first;
2719 if (o->op_type == OP_COND_EXPR) {
2720 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2721 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2726 yyerror("Assignment to both a list and a scalar");
2730 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2731 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2732 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2735 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2738 if (o->op_type == OP_RV2SV)
2745 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2750 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2751 return newLOGOP(optype, 0,
2752 mod(scalar(left), optype),
2753 newUNOP(OP_SASSIGN, 0, scalar(right)));
2756 return newBINOP(optype, OPf_STACKED,
2757 mod(scalar(left), optype), scalar(right));
2761 if (list_assignment(left)) {
2764 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2765 left = mod(left, OP_AASSIGN);
2773 o = newBINOP(OP_AASSIGN, flags,
2774 list(force_list(right)),
2775 list(force_list(left)) );
2776 o->op_private = 0 | (flags >> 8);
2777 if (!(left->op_private & OPpLVAL_INTRO)) {
2781 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2782 if (opargs[curop->op_type] & OA_DANGEROUS) {
2783 if (curop->op_type == OP_GV) {
2784 GV *gv = ((GVOP*)curop)->op_gv;
2785 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2787 SvCUR(gv) = PL_generation;
2789 else if (curop->op_type == OP_PADSV ||
2790 curop->op_type == OP_PADAV ||
2791 curop->op_type == OP_PADHV ||
2792 curop->op_type == OP_PADANY) {
2793 SV **svp = AvARRAY(PL_comppad_name);
2794 SV *sv = svp[curop->op_targ];
2795 if (SvCUR(sv) == PL_generation)
2797 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2799 else if (curop->op_type == OP_RV2CV)
2801 else if (curop->op_type == OP_RV2SV ||
2802 curop->op_type == OP_RV2AV ||
2803 curop->op_type == OP_RV2HV ||
2804 curop->op_type == OP_RV2GV) {
2805 if (lastop->op_type != OP_GV) /* funny deref? */
2808 else if (curop->op_type == OP_PUSHRE) {
2809 if (((PMOP*)curop)->op_pmreplroot) {
2810 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2811 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2813 SvCUR(gv) = PL_generation;
2822 o->op_private = OPpASSIGN_COMMON;
2824 if (right && right->op_type == OP_SPLIT) {
2826 if ((tmpop = ((LISTOP*)right)->op_first) &&
2827 tmpop->op_type == OP_PUSHRE)
2829 PMOP *pm = (PMOP*)tmpop;
2830 if (left->op_type == OP_RV2AV &&
2831 !(left->op_private & OPpLVAL_INTRO) &&
2832 !(o->op_private & OPpASSIGN_COMMON) )
2834 tmpop = ((UNOP*)left)->op_first;
2835 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2836 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2837 pm->op_pmflags |= PMf_ONCE;
2838 tmpop = cUNOPo->op_first; /* to list (nulled) */
2839 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2840 tmpop->op_sibling = Nullop; /* don't free split */
2841 right->op_next = tmpop->op_next; /* fix starting loc */
2842 op_free(o); /* blow off assign */
2843 right->op_flags &= ~OPf_WANT;
2844 /* "I don't know and I don't care." */
2849 if (PL_modcount < 10000 &&
2850 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2852 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2854 sv_setiv(sv, PL_modcount+1);
2862 right = newOP(OP_UNDEF, 0);
2863 if (right->op_type == OP_READLINE) {
2864 right->op_flags |= OPf_STACKED;
2865 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2868 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2869 o = newBINOP(OP_SASSIGN, flags,
2870 scalar(right), mod(scalar(left), OP_SASSIGN) );
2882 newSTATEOP(I32 flags, char *label, OP *o)
2885 U32 seq = intro_my();
2888 Newz(1101, cop, 1, COP);
2889 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2890 cop->op_type = OP_DBSTATE;
2891 cop->op_ppaddr = ppaddr[ OP_DBSTATE ];
2894 cop->op_type = OP_NEXTSTATE;
2895 cop->op_ppaddr = ppaddr[ OP_NEXTSTATE ];
2897 cop->op_flags = flags;
2898 cop->op_private = (PL_hints & HINT_UTF8);
2900 cop->op_private |= NATIVE_HINTS;
2902 PL_compiling.op_private = cop->op_private;
2903 cop->op_next = (OP*)cop;
2906 cop->cop_label = label;
2907 PL_hints |= HINT_BLOCK_SCOPE;
2910 cop->cop_arybase = PL_curcop->cop_arybase;
2911 if (PL_curcop->cop_warnings == WARN_NONE
2912 || PL_curcop->cop_warnings == WARN_ALL)
2913 cop->cop_warnings = PL_curcop->cop_warnings ;
2915 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2918 if (PL_copline == NOLINE)
2919 cop->cop_line = PL_curcop->cop_line;
2921 cop->cop_line = PL_copline;
2922 PL_copline = NOLINE;
2924 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2925 cop->cop_stash = PL_curstash;
2927 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2928 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2929 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2930 (void)SvIOK_on(*svp);
2932 SvSTASH(*svp) = (HV*)cop;
2936 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2939 /* "Introduce" my variables to visible status. */
2947 if (! PL_min_intro_pending)
2948 return PL_cop_seqmax;
2950 svp = AvARRAY(PL_comppad_name);
2951 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2952 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2953 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2954 SvNVX(sv) = (double)PL_cop_seqmax;
2957 PL_min_intro_pending = 0;
2958 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2959 return PL_cop_seqmax++;
2963 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2965 return new_logop(type, flags, &first, &other);
2969 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
2974 OP *first = *firstp;
2975 OP *other = *otherp;
2977 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
2978 return newBINOP(type, flags, scalar(first), scalar(other));
2980 scalarboolean(first);
2981 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
2982 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
2983 if (type == OP_AND || type == OP_OR) {
2989 first = *firstp = cUNOPo->op_first;
2991 first->op_next = o->op_next;
2992 cUNOPo->op_first = Nullop;
2996 if (first->op_type == OP_CONST) {
2997 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
2998 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3000 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3011 else if (first->op_type == OP_WANTARRAY) {
3017 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3018 OP *k1 = ((UNOP*)first)->op_first;
3019 OP *k2 = k1->op_sibling;
3021 switch (first->op_type)
3024 if (k2 && k2->op_type == OP_READLINE
3025 && (k2->op_flags & OPf_STACKED)
3026 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3027 warnop = k2->op_type;
3031 if (k1->op_type == OP_READDIR
3032 || k1->op_type == OP_GLOB
3033 || k1->op_type == OP_EACH)
3034 warnop = k1->op_type;
3038 line_t oldline = PL_curcop->cop_line;
3039 PL_curcop->cop_line = PL_copline;
3041 "Value of %s%s can be \"0\"; test with defined()",
3043 ((warnop == OP_READLINE || warnop == OP_GLOB)
3044 ? " construct" : "() operator"));
3045 PL_curcop->cop_line = oldline;
3052 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3053 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3055 Newz(1101, logop, 1, LOGOP);
3057 logop->op_type = type;
3058 logop->op_ppaddr = ppaddr[type];
3059 logop->op_first = first;
3060 logop->op_flags = flags | OPf_KIDS;
3061 logop->op_other = LINKLIST(other);
3062 logop->op_private = 1 | (flags >> 8);
3064 /* establish postfix order */
3065 logop->op_next = LINKLIST(first);
3066 first->op_next = (OP*)logop;
3067 first->op_sibling = other;
3069 o = newUNOP(OP_NULL, 0, (OP*)logop);
3076 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3083 return newLOGOP(OP_AND, 0, first, trueop);
3085 return newLOGOP(OP_OR, 0, first, falseop);
3087 scalarboolean(first);
3088 if (first->op_type == OP_CONST) {
3089 if (SvTRUE(((SVOP*)first)->op_sv)) {
3100 else if (first->op_type == OP_WANTARRAY) {
3104 Newz(1101, condop, 1, CONDOP);
3106 condop->op_type = OP_COND_EXPR;
3107 condop->op_ppaddr = ppaddr[OP_COND_EXPR];
3108 condop->op_first = first;
3109 condop->op_flags = flags | OPf_KIDS;
3110 condop->op_true = LINKLIST(trueop);
3111 condop->op_false = LINKLIST(falseop);
3112 condop->op_private = 1 | (flags >> 8);
3114 /* establish postfix order */
3115 condop->op_next = LINKLIST(first);
3116 first->op_next = (OP*)condop;
3118 first->op_sibling = trueop;
3119 trueop->op_sibling = falseop;
3120 o = newUNOP(OP_NULL, 0, (OP*)condop);
3122 trueop->op_next = o;
3123 falseop->op_next = o;
3129 newRANGE(I32 flags, OP *left, OP *right)
3137 Newz(1101, condop, 1, CONDOP);
3139 condop->op_type = OP_RANGE;
3140 condop->op_ppaddr = ppaddr[OP_RANGE];
3141 condop->op_first = left;
3142 condop->op_flags = OPf_KIDS;
3143 condop->op_true = LINKLIST(left);
3144 condop->op_false = LINKLIST(right);
3145 condop->op_private = 1 | (flags >> 8);
3147 left->op_sibling = right;
3149 condop->op_next = (OP*)condop;
3150 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3151 flop = newUNOP(OP_FLOP, 0, flip);
3152 o = newUNOP(OP_NULL, 0, flop);
3155 left->op_next = flip;
3156 right->op_next = flop;
3158 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3159 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3160 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3161 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3163 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3164 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3167 if (!flip->op_private || !flop->op_private)
3168 linklist(o); /* blow off optimizer unless constant */
3174 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3179 int once = block && block->op_flags & OPf_SPECIAL &&
3180 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3183 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3184 return block; /* do {} while 0 does once */
3185 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3186 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3187 expr = newUNOP(OP_DEFINED, 0,
3188 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3189 } else if (expr->op_flags & OPf_KIDS) {
3190 OP *k1 = ((UNOP*)expr)->op_first;
3191 OP *k2 = (k1) ? k1->op_sibling : NULL;
3192 switch (expr->op_type) {
3194 if (k2 && k2->op_type == OP_READLINE
3195 && (k2->op_flags & OPf_STACKED)
3196 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3197 expr = newUNOP(OP_DEFINED, 0, expr);
3201 if (k1->op_type == OP_READDIR
3202 || k1->op_type == OP_GLOB
3203 || k1->op_type == OP_EACH)
3204 expr = newUNOP(OP_DEFINED, 0, expr);
3210 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3211 o = new_logop(OP_AND, 0, &expr, &listop);
3214 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3216 if (once && o != listop)
3217 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3220 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3222 o->op_flags |= flags;
3224 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3229 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3238 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3239 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3240 expr = newUNOP(OP_DEFINED, 0,
3241 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3242 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3243 OP *k1 = ((UNOP*)expr)->op_first;
3244 OP *k2 = (k1) ? k1->op_sibling : NULL;
3245 switch (expr->op_type) {
3247 if (k2 && k2->op_type == OP_READLINE
3248 && (k2->op_flags & OPf_STACKED)
3249 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3250 expr = newUNOP(OP_DEFINED, 0, expr);
3254 if (k1->op_type == OP_READDIR
3255 || k1->op_type == OP_GLOB
3256 || k1->op_type == OP_EACH)
3257 expr = newUNOP(OP_DEFINED, 0, expr);
3263 block = newOP(OP_NULL, 0);
3266 next = LINKLIST(cont);
3268 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3269 if ((line_t)whileline != NOLINE) {
3270 PL_copline = whileline;
3271 cont = append_elem(OP_LINESEQ, cont,
3272 newSTATEOP(0, Nullch, Nullop));
3276 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3277 redo = LINKLIST(listop);
3280 PL_copline = whileline;
3282 o = new_logop(OP_AND, 0, &expr, &listop);
3283 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3284 op_free(expr); /* oops, it's a while (0) */
3286 return Nullop; /* listop already freed by new_logop */
3289 ((LISTOP*)listop)->op_last->op_next = condop =
3290 (o == listop ? redo : LINKLIST(o));
3298 Newz(1101,loop,1,LOOP);
3299 loop->op_type = OP_ENTERLOOP;
3300 loop->op_ppaddr = ppaddr[OP_ENTERLOOP];
3301 loop->op_private = 0;
3302 loop->op_next = (OP*)loop;
3305 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3307 loop->op_redoop = redo;
3308 loop->op_lastop = o;
3311 loop->op_nextop = next;
3313 loop->op_nextop = o;
3315 o->op_flags |= flags;
3316 o->op_private |= (flags >> 8);
3321 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3329 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3330 sv->op_type = OP_RV2GV;
3331 sv->op_ppaddr = ppaddr[OP_RV2GV];
3333 else if (sv->op_type == OP_PADSV) { /* private variable */
3334 padoff = sv->op_targ;
3338 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3339 padoff = sv->op_targ;
3340 iterflags |= OPf_SPECIAL;
3345 croak("Can't use %s for loop variable", op_desc[sv->op_type]);
3349 padoff = find_threadsv("_");
3350 iterflags |= OPf_SPECIAL;
3352 sv = newGVOP(OP_GV, 0, PL_defgv);
3355 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3356 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3357 iterflags |= OPf_STACKED;
3359 else if (expr->op_type == OP_NULL &&
3360 (expr->op_flags & OPf_KIDS) &&
3361 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3363 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3364 * set the STACKED flag to indicate that these values are to be
3365 * treated as min/max values by 'pp_iterinit'.
3367 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3368 CONDOP* range = (CONDOP*) flip->op_first;
3369 OP* left = range->op_first;
3370 OP* right = left->op_sibling;
3373 range->op_flags &= ~OPf_KIDS;
3374 range->op_first = Nullop;
3376 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3377 listop->op_first->op_next = range->op_true;
3378 left->op_next = range->op_false;
3379 right->op_next = (OP*)listop;
3380 listop->op_next = listop->op_first;
3383 expr = (OP*)(listop);
3385 iterflags |= OPf_STACKED;
3388 expr = mod(force_list(expr), OP_GREPSTART);
3392 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3393 append_elem(OP_LIST, expr, scalar(sv))));
3394 assert(!loop->op_next);
3395 Renew(loop, 1, LOOP);
3396 loop->op_targ = padoff;
3397 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3398 PL_copline = forline;
3399 return newSTATEOP(0, label, wop);
3403 newLOOPEX(I32 type, OP *label)
3407 if (type != OP_GOTO || label->op_type == OP_CONST) {
3408 /* "last()" means "last" */
3409 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3410 o = newOP(type, OPf_SPECIAL);
3412 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3413 ? SvPVx(((SVOP*)label)->op_sv, PL_na)
3419 if (label->op_type == OP_ENTERSUB)
3420 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3421 o = newUNOP(type, OPf_STACKED, label);
3423 PL_hints |= HINT_BLOCK_SCOPE;
3433 MUTEX_DESTROY(CvMUTEXP(cv));
3434 Safefree(CvMUTEXP(cv));
3437 #endif /* USE_THREADS */
3439 if (!CvXSUB(cv) && CvROOT(cv)) {
3441 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3442 croak("Can't undef active subroutine");
3445 croak("Can't undef active subroutine");
3446 #endif /* USE_THREADS */
3449 SAVESPTR(PL_curpad);
3453 op_free(CvROOT(cv));
3454 CvROOT(cv) = Nullop;
3457 SvPOK_off((SV*)cv); /* forget prototype */
3459 SvREFCNT_dec(CvGV(cv));
3461 SvREFCNT_dec(CvOUTSIDE(cv));
3462 CvOUTSIDE(cv) = Nullcv;
3463 if (CvPADLIST(cv)) {
3464 /* may be during global destruction */
3465 if (SvREFCNT(CvPADLIST(cv))) {
3466 I32 i = AvFILLp(CvPADLIST(cv));
3468 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3469 SV* sv = svp ? *svp : Nullsv;
3472 if (sv == (SV*)PL_comppad_name)
3473 PL_comppad_name = Nullav;
3474 else if (sv == (SV*)PL_comppad) {
3475 PL_comppad = Nullav;
3476 PL_curpad = Null(SV**);
3480 SvREFCNT_dec((SV*)CvPADLIST(cv));
3482 CvPADLIST(cv) = Nullav;
3486 #ifdef DEBUG_CLOSURES
3491 CV *outside = CvOUTSIDE(cv);
3492 AV* padlist = CvPADLIST(cv);
3499 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3501 (CvANON(cv) ? "ANON"
3502 : (cv == PL_main_cv) ? "MAIN"
3503 : CvUNIQUE(outside) ? "UNIQUE"
3504 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3507 : CvANON(outside) ? "ANON"
3508 : (outside == PL_main_cv) ? "MAIN"
3509 : CvUNIQUE(outside) ? "UNIQUE"
3510 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3515 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3516 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3517 pname = AvARRAY(pad_name);
3518 ppad = AvARRAY(pad);
3520 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3521 if (SvPOK(pname[ix]))
3522 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3524 SvFAKE(pname[ix]) ? "FAKE " : "",
3526 (long)I_32(SvNVX(pname[ix])),
3527 (long)SvIVX(pname[ix]));
3530 #endif /* DEBUG_CLOSURES */
3533 cv_clone2(CV *proto, CV *outside)
3538 AV* protopadlist = CvPADLIST(proto);
3539 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3540 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3541 SV** pname = AvARRAY(protopad_name);
3542 SV** ppad = AvARRAY(protopad);
3543 I32 fname = AvFILLp(protopad_name);
3544 I32 fpad = AvFILLp(protopad);
3548 assert(!CvUNIQUE(proto));
3551 SAVESPTR(PL_curpad);
3552 SAVESPTR(PL_comppad);
3553 SAVESPTR(PL_comppad_name);
3554 SAVESPTR(PL_compcv);
3556 cv = PL_compcv = (CV*)NEWSV(1104,0);
3557 sv_upgrade((SV *)cv, SvTYPE(proto));
3563 New(666, CvMUTEXP(cv), 1, perl_mutex);
3564 MUTEX_INIT(CvMUTEXP(cv));
3566 #endif /* USE_THREADS */
3567 CvFILEGV(cv) = CvFILEGV(proto);
3568 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3569 CvSTASH(cv) = CvSTASH(proto);
3570 CvROOT(cv) = CvROOT(proto);
3571 CvSTART(cv) = CvSTART(proto);
3573 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3576 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3578 PL_comppad_name = newAV();
3579 for (ix = fname; ix >= 0; ix--)
3580 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3582 PL_comppad = newAV();
3584 comppadlist = newAV();
3585 AvREAL_off(comppadlist);
3586 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3587 av_store(comppadlist, 1, (SV*)PL_comppad);
3588 CvPADLIST(cv) = comppadlist;
3589 av_fill(PL_comppad, AvFILLp(protopad));
3590 PL_curpad = AvARRAY(PL_comppad);
3592 av = newAV(); /* will be @_ */
3594 av_store(PL_comppad, 0, (SV*)av);
3595 AvFLAGS(av) = AVf_REIFY;
3597 for (ix = fpad; ix > 0; ix--) {
3598 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3599 if (namesv && namesv != &PL_sv_undef) {
3600 char *name = SvPVX(namesv); /* XXX */
3601 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3602 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3603 CvOUTSIDE(cv), cxstack_ix, 0);
3605 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3607 croak("panic: cv_clone: %s", name);
3609 else { /* our own lexical */
3612 /* anon code -- we'll come back for it */
3613 sv = SvREFCNT_inc(ppad[ix]);
3615 else if (*name == '@')
3617 else if (*name == '%')
3627 SV* sv = NEWSV(0,0);
3633 /* Now that vars are all in place, clone nested closures. */
3635 for (ix = fpad; ix > 0; ix--) {
3636 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3638 && namesv != &PL_sv_undef
3639 && !(SvFLAGS(namesv) & SVf_FAKE)
3640 && *SvPVX(namesv) == '&'
3641 && CvCLONE(ppad[ix]))
3643 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3644 SvREFCNT_dec(ppad[ix]);
3647 PL_curpad[ix] = (SV*)kid;
3651 #ifdef DEBUG_CLOSURES
3652 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3654 PerlIO_printf(Perl_debug_log, " from:\n");
3656 PerlIO_printf(Perl_debug_log, " to:\n");
3667 return cv_clone2(proto, CvOUTSIDE(proto));
3671 cv_ckproto(CV *cv, GV *gv, char *p)
3673 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3674 SV* msg = sv_newmortal();
3678 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3679 sv_setpv(msg, "Prototype mismatch:");
3681 sv_catpvf(msg, " sub %_", name);
3683 sv_catpvf(msg, " (%s)", SvPVX(cv));
3684 sv_catpv(msg, " vs ");
3686 sv_catpvf(msg, "(%s)", p);
3688 sv_catpv(msg, "none");
3696 if (!cv || !SvPOK(cv) || SvCUR(cv))
3698 return op_const_sv(CvSTART(cv), cv);
3702 op_const_sv(OP *o, CV *cv)
3709 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3710 o = cLISTOPo->op_first->op_sibling;
3712 for (; o; o = o->op_next) {
3713 OPCODE type = o->op_type;
3715 if(sv && o->op_next == o)
3717 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3719 if (type == OP_LEAVESUB || type == OP_RETURN)
3723 if (type == OP_CONST)
3725 else if (type == OP_PADSV && cv) {
3726 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3727 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3728 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3740 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3743 char *name = o ? SvPVx(cSVOPo->op_sv, PL_na) : Nullch;
3744 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3745 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3746 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, PL_na) : Nullch;
3755 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3756 maximum a prototype before. */
3757 if (SvTYPE(gv) > SVt_NULL) {
3758 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3759 warn("Runaway prototype");
3760 cv_ckproto((CV*)gv, NULL, ps);
3763 sv_setpv((SV*)gv, ps);
3765 sv_setiv((SV*)gv, -1);
3766 SvREFCNT_dec(PL_compcv);
3767 cv = PL_compcv = NULL;
3768 PL_sub_generation++;
3772 if (!name || GvCVGEN(gv))
3774 else if (cv = GvCV(gv)) {
3775 cv_ckproto(cv, gv, ps);
3776 /* already defined (or promised)? */
3777 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3779 bool const_changed = TRUE;
3781 /* just a "sub foo;" when &foo is already defined */
3782 SAVEFREESV(PL_compcv);
3785 /* ahem, death to those who redefine active sort subs */
3786 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3787 croak("Can't redefine active sort subroutine %s", name);
3788 if(const_sv = cv_const_sv(cv))
3789 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3790 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3791 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3792 && HvNAME(GvSTASH(CvGV(cv)))
3793 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3795 line_t oldline = PL_curcop->cop_line;
3796 PL_curcop->cop_line = PL_copline;
3797 warner(WARN_REDEFINE,
3798 const_sv ? "Constant subroutine %s redefined"
3799 : "Subroutine %s redefined", name);
3800 PL_curcop->cop_line = oldline;
3806 if (cv) { /* must reuse cv if autoloaded */
3808 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3809 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3810 CvOUTSIDE(PL_compcv) = 0;
3811 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3812 CvPADLIST(PL_compcv) = 0;
3813 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3814 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3815 SvREFCNT_dec(PL_compcv);
3822 PL_sub_generation++;
3825 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3826 CvFILEGV(cv) = PL_curcop->cop_filegv;
3827 CvSTASH(cv) = PL_curstash;
3831 New(666, CvMUTEXP(cv), 1, perl_mutex);
3832 MUTEX_INIT(CvMUTEXP(cv));
3833 #endif /* USE_THREADS */
3836 sv_setpv((SV*)cv, ps);
3838 if (PL_error_count) {
3842 char *s = strrchr(name, ':');
3844 if (strEQ(s, "BEGIN")) {
3846 "BEGIN not safe after errors--compilation aborted";
3850 /* force display of errors found but not reported */
3851 sv_catpv(ERRSV, not_safe);
3852 croak("%s", SvPVx(ERRSV, PL_na));
3859 PL_copline = NOLINE;
3864 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3865 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3868 SV **namep = AvARRAY(PL_comppad_name);
3869 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3872 if (SvIMMORTAL(PL_curpad[ix]))
3875 * The only things that a clonable function needs in its
3876 * pad are references to outer lexicals and anonymous subs.
3877 * The rest are created anew during cloning.
3879 if (!((namesv = namep[ix]) != Nullsv &&
3880 namesv != &PL_sv_undef &&
3882 *SvPVX(namesv) == '&')))
3884 SvREFCNT_dec(PL_curpad[ix]);
3885 PL_curpad[ix] = Nullsv;
3890 AV *av = newAV(); /* Will be @_ */
3892 av_store(PL_comppad, 0, (SV*)av);
3893 AvFLAGS(av) = AVf_REIFY;
3895 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3896 if (SvIMMORTAL(PL_curpad[ix]))
3898 if (!SvPADMY(PL_curpad[ix]))
3899 SvPADTMP_on(PL_curpad[ix]);
3903 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3904 CvSTART(cv) = LINKLIST(CvROOT(cv));
3905 CvROOT(cv)->op_next = 0;
3911 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3912 SV *sv = NEWSV(0,0);
3913 SV *tmpstr = sv_newmortal();
3914 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3918 sv_setpvf(sv, "%_:%ld-%ld",
3919 GvSV(PL_curcop->cop_filegv),
3920 (long)PL_subline, (long)PL_curcop->cop_line);
3921 gv_efullname3(tmpstr, gv, Nullch);
3922 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3923 hv = GvHVn(db_postponed);
3924 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3925 && (cv = GvCV(db_postponed))) {
3930 perl_call_sv((SV*)cv, G_DISCARD);
3934 if ((s = strrchr(name,':')))
3938 if (strEQ(s, "BEGIN")) {
3939 I32 oldscope = PL_scopestack_ix;
3941 SAVESPTR(PL_compiling.cop_filegv);
3942 SAVEI16(PL_compiling.cop_line);
3944 sv_setsv(PL_rs, PL_nrs);
3947 PL_beginav = newAV();
3948 DEBUG_x( dump_sub(gv) );
3949 av_push(PL_beginav, (SV *)cv);
3951 call_list(oldscope, PL_beginav);
3953 PL_curcop = &PL_compiling;
3954 PL_compiling.op_private = PL_hints;
3957 else if (strEQ(s, "END") && !PL_error_count) {
3960 av_unshift(PL_endav, 1);
3961 av_store(PL_endav, 0, (SV *)cv);
3964 else if (strEQ(s, "INIT") && !PL_error_count) {
3966 PL_initav = newAV();
3967 av_push(PL_initav, SvREFCNT_inc(cv));
3973 PL_copline = NOLINE;
3979 newCONSTSUB(HV *stash, char *name, SV *sv)
3982 U32 oldhints = PL_hints;
3983 HV *old_cop_stash = PL_curcop->cop_stash;
3984 HV *old_curstash = PL_curstash;
3985 line_t oldline = PL_curcop->cop_line;
3986 PL_curcop->cop_line = PL_copline;
3988 PL_hints &= ~HINT_BLOCK_SCOPE;
3990 PL_curstash = PL_curcop->cop_stash = stash;
3993 start_subparse(FALSE, 0),
3994 newSVOP(OP_CONST, 0, newSVpv(name,0)),
3995 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
3996 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
3999 PL_hints = oldhints;
4000 PL_curcop->cop_stash = old_cop_stash;
4001 PL_curstash = old_curstash;
4002 PL_curcop->cop_line = oldline;
4006 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4009 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4012 if (cv = (name ? GvCV(gv) : Nullcv)) {
4014 /* just a cached method */
4018 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4019 /* already defined (or promised) */
4020 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4021 && HvNAME(GvSTASH(CvGV(cv)))
4022 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4023 line_t oldline = PL_curcop->cop_line;
4024 PL_curcop->cop_line = PL_copline;
4025 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4026 PL_curcop->cop_line = oldline;
4033 if (cv) /* must reuse cv if autoloaded */
4036 cv = (CV*)NEWSV(1105,0);
4037 sv_upgrade((SV *)cv, SVt_PVCV);
4041 PL_sub_generation++;
4044 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4046 New(666, CvMUTEXP(cv), 1, perl_mutex);
4047 MUTEX_INIT(CvMUTEXP(cv));
4049 #endif /* USE_THREADS */
4050 CvFILEGV(cv) = gv_fetchfile(filename);
4051 CvXSUB(cv) = subaddr;
4054 char *s = strrchr(name,':');
4059 if (strEQ(s, "BEGIN")) {
4061 PL_beginav = newAV();
4062 av_push(PL_beginav, (SV *)cv);
4065 else if (strEQ(s, "END")) {
4068 av_unshift(PL_endav, 1);
4069 av_store(PL_endav, 0, (SV *)cv);
4072 else if (strEQ(s, "INIT")) {
4074 PL_initav = newAV();
4075 av_push(PL_initav, (SV *)cv);
4086 newFORM(I32 floor, OP *o, OP *block)
4095 name = SvPVx(cSVOPo->op_sv, PL_na);
4098 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4100 if (cv = GvFORM(gv)) {
4101 if (ckWARN(WARN_REDEFINE)) {
4102 line_t oldline = PL_curcop->cop_line;
4104 PL_curcop->cop_line = PL_copline;
4105 warner(WARN_REDEFINE, "Format %s redefined",name);
4106 PL_curcop->cop_line = oldline;
4112 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4113 CvFILEGV(cv) = PL_curcop->cop_filegv;
4115 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4116 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4117 SvPADTMP_on(PL_curpad[ix]);
4120 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4121 CvSTART(cv) = LINKLIST(CvROOT(cv));
4122 CvROOT(cv)->op_next = 0;
4125 PL_copline = NOLINE;
4132 return newUNOP(OP_REFGEN, 0,
4133 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4139 return newUNOP(OP_REFGEN, 0,
4140 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4144 newANONSUB(I32 floor, OP *proto, OP *block)
4146 return newUNOP(OP_REFGEN, 0,
4147 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4153 switch (o->op_type) {
4155 o->op_type = OP_PADAV;
4156 o->op_ppaddr = ppaddr[OP_PADAV];
4157 return ref(o, OP_RV2AV);
4160 o->op_type = OP_RV2AV;
4161 o->op_ppaddr = ppaddr[OP_RV2AV];
4166 warn("oops: oopsAV");
4175 switch (o->op_type) {
4178 o->op_type = OP_PADHV;
4179 o->op_ppaddr = ppaddr[OP_PADHV];
4180 return ref(o, OP_RV2HV);
4184 o->op_type = OP_RV2HV;
4185 o->op_ppaddr = ppaddr[OP_RV2HV];
4190 warn("oops: oopsHV");
4199 if (o->op_type == OP_PADANY) {
4200 o->op_type = OP_PADAV;
4201 o->op_ppaddr = ppaddr[OP_PADAV];
4204 return newUNOP(OP_RV2AV, 0, scalar(o));
4208 newGVREF(I32 type, OP *o)
4210 if (type == OP_MAPSTART)
4211 return newUNOP(OP_NULL, 0, o);
4212 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4218 if (o->op_type == OP_PADANY) {
4219 o->op_type = OP_PADHV;
4220 o->op_ppaddr = ppaddr[OP_PADHV];
4223 return newUNOP(OP_RV2HV, 0, scalar(o));
4229 croak("NOT IMPL LINE %d",__LINE__);
4235 newCVREF(I32 flags, OP *o)
4237 return newUNOP(OP_RV2CV, flags, scalar(o));
4243 if (o->op_type == OP_PADANY) {
4244 o->op_type = OP_PADSV;
4245 o->op_ppaddr = ppaddr[OP_PADSV];
4248 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4249 o->op_flags |= OPpDONE_SVREF;
4252 return newUNOP(OP_RV2SV, 0, scalar(o));
4255 /* Check routines. */
4263 name = NEWSV(1106,0);
4264 sv_upgrade(name, SVt_PVNV);
4265 sv_setpvn(name, "&", 1);
4268 ix = pad_alloc(o->op_type, SVs_PADMY);
4269 av_store(PL_comppad_name, ix, name);
4270 av_store(PL_comppad, ix, cSVOPo->op_sv);
4271 SvPADMY_on(cSVOPo->op_sv);
4272 cSVOPo->op_sv = Nullsv;
4273 cSVOPo->op_targ = ix;
4280 o->op_private = PL_hints;
4287 if (cUNOPo->op_first->op_type == OP_CONCAT)
4288 o->op_flags |= OPf_STACKED;
4295 if (o->op_flags & OPf_KIDS) {
4298 OPCODE type = o->op_type;
4299 o = modkids(ck_fun(o), type);
4300 kid = cUNOPo->op_first;
4301 newop = kUNOP->op_first->op_sibling;
4303 (newop->op_sibling ||
4304 !(opargs[newop->op_type] & OA_RETSCALAR) ||
4305 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4306 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4310 op_free(kUNOP->op_first);
4311 kUNOP->op_first = newop;
4313 o->op_ppaddr = ppaddr[++o->op_type];
4322 if (o->op_flags & OPf_KIDS) {
4323 OP *kid = cUNOPo->op_first;
4324 if (kid->op_type == OP_HSLICE)
4325 o->op_private |= OPpSLICE;
4326 else if (kid->op_type != OP_HELEM)
4327 croak("%s argument is not a HASH element or slice",
4328 op_desc[o->op_type]);
4337 I32 type = o->op_type;
4339 if (o->op_flags & OPf_KIDS) {
4340 if (cLISTOPo->op_first->op_type == OP_STUB) {
4342 o = newUNOP(type, OPf_SPECIAL,
4343 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4353 PL_hints |= HINT_BLOCK_SCOPE;
4354 if (o->op_flags & OPf_KIDS) {
4355 SVOP *kid = (SVOP*)cUNOPo->op_first;
4358 o->op_flags &= ~OPf_KIDS;
4361 else if (kid->op_type == OP_LINESEQ) {
4364 kid->op_next = o->op_next;
4365 cUNOPo->op_first = 0;
4368 Newz(1101, enter, 1, LOGOP);
4369 enter->op_type = OP_ENTERTRY;
4370 enter->op_ppaddr = ppaddr[OP_ENTERTRY];
4371 enter->op_private = 0;
4373 /* establish postfix order */
4374 enter->op_next = (OP*)enter;
4376 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4377 o->op_type = OP_LEAVETRY;
4378 o->op_ppaddr = ppaddr[OP_LEAVETRY];
4379 enter->op_other = o;
4387 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4389 o->op_targ = (PADOFFSET)PL_hints;
4397 if (o->op_flags & OPf_STACKED) {
4399 kid = cUNOPo->op_first->op_sibling;
4400 if (kid->op_type == OP_RV2GV)
4412 if (o->op_flags & OPf_KIDS) {
4413 OP *kid = cUNOPo->op_first;
4414 if (kid->op_type != OP_HELEM)
4415 croak("%s argument is not a HASH element", op_desc[o->op_type]);
4422 ck_gvconst(register OP *o)
4424 o = fold_constants(o);
4425 if (o->op_type == OP_CONST)
4431 ck_rvconst(register OP *o)
4434 SVOP *kid = (SVOP*)cUNOPo->op_first;
4436 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4437 if (kid->op_type == OP_CONST) {
4442 name = SvPV(kid->op_sv, PL_na);
4443 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4444 char *badthing = Nullch;
4445 switch (o->op_type) {
4447 badthing = "a SCALAR";
4450 badthing = "an ARRAY";
4453 badthing = "a HASH";
4458 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4462 * This is a little tricky. We only want to add the symbol if we
4463 * didn't add it in the lexer. Otherwise we get duplicate strict
4464 * warnings. But if we didn't add it in the lexer, we must at
4465 * least pretend like we wanted to add it even if it existed before,
4466 * or we get possible typo warnings. OPpCONST_ENTERED says
4467 * whether the lexer already added THIS instance of this symbol.
4469 iscv = (o->op_type == OP_RV2CV) * 2;
4471 gv = gv_fetchpv(name,
4472 iscv | !(kid->op_private & OPpCONST_ENTERED),
4475 : o->op_type == OP_RV2SV
4477 : o->op_type == OP_RV2AV
4479 : o->op_type == OP_RV2HV
4482 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4484 kid->op_type = OP_GV;
4485 SvREFCNT_dec(kid->op_sv);
4486 kid->op_sv = SvREFCNT_inc(gv);
4496 I32 type = o->op_type;
4498 if (o->op_flags & OPf_REF)
4501 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4502 SVOP *kid = (SVOP*)cUNOPo->op_first;
4504 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4505 OP *newop = newGVOP(type, OPf_REF,
4506 gv_fetchpv(SvPVx(kid->op_sv, PL_na), TRUE, SVt_PVIO));
4513 if (type == OP_FTTTY)
4514 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4517 return newUNOP(type, 0, newDEFSVOP());
4530 int type = o->op_type;
4531 register I32 oa = opargs[type] >> OASHIFT;
4533 if (o->op_flags & OPf_STACKED) {
4534 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4537 return no_fh_allowed(o);
4540 if (o->op_flags & OPf_KIDS) {
4541 tokid = &cLISTOPo->op_first;
4542 kid = cLISTOPo->op_first;
4543 if (kid->op_type == OP_PUSHMARK ||
4544 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4546 tokid = &kid->op_sibling;
4547 kid = kid->op_sibling;
4549 if (!kid && opargs[type] & OA_DEFGV)
4550 *tokid = kid = newDEFSVOP();
4554 sibl = kid->op_sibling;
4568 if (kid->op_type == OP_CONST &&
4569 (kid->op_private & OPpCONST_BARE)) {
4570 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4571 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4572 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4573 if (ckWARN(WARN_SYNTAX))
4575 "Array @%s missing the @ in argument %ld of %s()",
4576 name, (long)numargs, op_desc[type]);
4579 kid->op_sibling = sibl;
4582 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4583 bad_type(numargs, "array", op_desc[o->op_type], kid);
4587 if (kid->op_type == OP_CONST &&
4588 (kid->op_private & OPpCONST_BARE)) {
4589 char *name = SvPVx(((SVOP*)kid)->op_sv, PL_na);
4590 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4591 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4592 if (ckWARN(WARN_SYNTAX))
4594 "Hash %%%s missing the %% in argument %ld of %s()",
4595 name, (long)numargs, op_desc[type]);
4598 kid->op_sibling = sibl;
4601 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4602 bad_type(numargs, "hash", op_desc[o->op_type], kid);
4607 OP *newop = newUNOP(OP_NULL, 0, kid);
4608 kid->op_sibling = 0;
4610 newop->op_next = newop;
4612 kid->op_sibling = sibl;
4617 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4618 if (kid->op_type == OP_CONST &&
4619 (kid->op_private & OPpCONST_BARE)) {
4620 OP *newop = newGVOP(OP_GV, 0,
4621 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, PL_na), TRUE,
4627 kid->op_sibling = 0;
4628 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4630 kid->op_sibling = sibl;
4636 mod(scalar(kid), type);
4640 tokid = &kid->op_sibling;
4641 kid = kid->op_sibling;
4643 o->op_private |= numargs;
4645 return too_many_arguments(o,op_desc[o->op_type]);
4648 else if (opargs[type] & OA_DEFGV) {
4650 return newUNOP(type, 0, newDEFSVOP());
4654 while (oa & OA_OPTIONAL)
4656 if (oa && oa != OA_LIST)
4657 return too_few_arguments(o,op_desc[o->op_type]);
4667 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4668 append_elem(OP_GLOB, o, newDEFSVOP());
4670 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4671 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4673 if (gv && GvIMPORTED_CV(gv)) {
4674 static int glob_index;
4676 append_elem(OP_GLOB, o,
4677 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4678 o->op_type = OP_LIST;
4679 o->op_ppaddr = ppaddr[OP_LIST];
4680 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4681 cLISTOPo->op_first->op_ppaddr = ppaddr[OP_PUSHMARK];
4682 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4683 append_elem(OP_LIST, o,
4684 scalar(newUNOP(OP_RV2CV, 0,
4685 newGVOP(OP_GV, 0, gv)))));
4686 o = newUNOP(OP_NULL, 0, ck_subr(o));
4687 o->op_targ = OP_GLOB; /* hint at what it used to be */
4690 gv = newGVgen("main");
4692 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4702 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4704 o->op_ppaddr = ppaddr[OP_GREPSTART];
4705 Newz(1101, gwop, 1, LOGOP);
4707 if (o->op_flags & OPf_STACKED) {
4710 kid = cLISTOPo->op_first->op_sibling;
4711 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4714 kid->op_next = (OP*)gwop;
4715 o->op_flags &= ~OPf_STACKED;
4717 kid = cLISTOPo->op_first->op_sibling;
4718 if (type == OP_MAPWHILE)
4725 kid = cLISTOPo->op_first->op_sibling;
4726 if (kid->op_type != OP_NULL)
4727 croak("panic: ck_grep");
4728 kid = kUNOP->op_first;
4730 gwop->op_type = type;
4731 gwop->op_ppaddr = ppaddr[type];
4732 gwop->op_first = listkids(o);
4733 gwop->op_flags |= OPf_KIDS;
4734 gwop->op_private = 1;
4735 gwop->op_other = LINKLIST(kid);
4736 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4737 kid->op_next = (OP*)gwop;
4739 kid = cLISTOPo->op_first->op_sibling;
4740 if (!kid || !kid->op_sibling)
4741 return too_few_arguments(o,op_desc[o->op_type]);
4742 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4743 mod(kid, OP_GREPSTART);
4751 if (o->op_flags & OPf_KIDS) {
4752 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4754 kid = kid->op_sibling; /* get past "big" */
4755 if (kid && kid->op_type == OP_CONST)
4756 fbm_compile(((SVOP*)kid)->op_sv, 0);
4762 ck_lengthconst(OP *o)
4764 /* XXX length optimization goes here */
4771 OPCODE type = o->op_type;
4772 return modkids(ck_fun(o), type);
4778 OPCODE type = o->op_type;
4779 return refkids(ck_fun(o), type);
4787 kid = cLISTOPo->op_first;
4790 kid = cLISTOPo->op_first;
4792 if (kid->op_type == OP_PUSHMARK)
4793 kid = kid->op_sibling;
4794 if (kid && o->op_flags & OPf_STACKED)
4795 kid = kid->op_sibling;
4796 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4797 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4798 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4799 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4800 cLISTOPo->op_first->op_sibling = kid;
4801 cLISTOPo->op_last = kid;
4802 kid = kid->op_sibling;
4807 append_elem(o->op_type, o, newDEFSVOP());
4813 if (PL_hints & HINT_LOCALE)
4814 o->op_private |= OPpLOCALE;
4821 ck_fun_locale(OP *o)
4827 if (PL_hints & HINT_LOCALE)
4828 o->op_private |= OPpLOCALE;
4839 if (PL_hints & HINT_LOCALE)
4840 o->op_private |= OPpLOCALE;
4849 o->op_private |= OPpRUNTIME;
4862 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4863 o->op_private |= OPpREPEAT_DOLIST;
4864 cBINOPo->op_first = force_list(cBINOPo->op_first);
4874 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4875 SVOP *kid = (SVOP*)cUNOPo->op_first;
4877 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4879 for (s = SvPVX(kid->op_sv); *s; s++) {
4880 if (*s == ':' && s[1] == ':') {
4882 Move(s+2, s+1, strlen(s+2)+1, char);
4883 --SvCUR(kid->op_sv);
4886 sv_catpvn(kid->op_sv, ".pm", 3);
4895 croak("NOT IMPL LINE %d",__LINE__);
4904 if (o->op_flags & OPf_KIDS) {
4905 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4906 if (kid && kid->op_sibling) {
4907 o->op_type = OP_SSELECT;
4908 o->op_ppaddr = ppaddr[OP_SSELECT];
4910 return fold_constants(o);
4914 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4915 if (kid && kid->op_type == OP_RV2GV)
4916 kid->op_private &= ~HINT_STRICT_REFS;
4923 I32 type = o->op_type;
4925 if (!(o->op_flags & OPf_KIDS)) {
4930 if (!CvUNIQUE(PL_compcv)) {
4931 argop = newOP(OP_PADAV, OPf_REF);
4932 argop->op_targ = 0; /* PL_curpad[0] is @_ */
4935 argop = newUNOP(OP_RV2AV, 0,
4936 scalar(newGVOP(OP_GV, 0,
4937 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4940 argop = newUNOP(OP_RV2AV, 0,
4941 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
4942 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
4943 #endif /* USE_THREADS */
4944 return newUNOP(type, 0, scalar(argop));
4946 return scalar(modkids(ck_fun(o), type));
4954 if (PL_hints & HINT_LOCALE)
4955 o->op_private |= OPpLOCALE;
4958 if (o->op_flags & OPf_STACKED) {
4959 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4961 kid = kUNOP->op_first; /* get past rv2gv */
4963 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
4965 if (kid->op_type == OP_SCOPE) {
4969 else if (kid->op_type == OP_LEAVE) {
4970 if (o->op_type == OP_SORT) {
4971 null(kid); /* wipe out leave */
4974 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
4975 if (k->op_next == kid)
4980 kid->op_next = 0; /* just disconnect the leave */
4981 k = kLISTOP->op_first;
4985 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4986 null(kid); /* wipe out rv2gv */
4987 if (o->op_type == OP_SORT)
4991 o->op_flags |= OPf_SPECIAL;
5003 if (o->op_flags & OPf_STACKED)
5004 return no_fh_allowed(o);
5006 kid = cLISTOPo->op_first;
5007 if (kid->op_type != OP_NULL)
5008 croak("panic: ck_split");
5009 kid = kid->op_sibling;
5010 op_free(cLISTOPo->op_first);
5011 cLISTOPo->op_first = kid;
5013 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5014 cLISTOPo->op_last = kid; /* There was only one element previously */
5017 if (kid->op_type != OP_MATCH) {
5018 OP *sibl = kid->op_sibling;
5019 kid->op_sibling = 0;
5020 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5021 if (cLISTOPo->op_first == cLISTOPo->op_last)
5022 cLISTOPo->op_last = kid;
5023 cLISTOPo->op_first = kid;
5024 kid->op_sibling = sibl;
5027 kid->op_type = OP_PUSHRE;
5028 kid->op_ppaddr = ppaddr[OP_PUSHRE];
5031 if (!kid->op_sibling)
5032 append_elem(OP_SPLIT, o, newDEFSVOP());
5034 kid = kid->op_sibling;
5037 if (!kid->op_sibling)
5038 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5040 kid = kid->op_sibling;
5043 if (kid->op_sibling)
5044 return too_many_arguments(o,op_desc[o->op_type]);
5053 OP *prev = ((cUNOPo->op_first->op_sibling)
5054 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5055 OP *o2 = prev->op_sibling;
5063 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5064 if (cvop->op_type == OP_RV2CV) {
5066 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5067 null(cvop); /* disable rv2cv */
5068 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5069 if (tmpop->op_type == OP_GV) {
5070 cv = GvCVu(tmpop->op_sv);
5071 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5072 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5073 proto = SvPV((SV*)cv, PL_na);
5077 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5078 if (PERLDB_SUB && PL_curstash != PL_debstash)
5079 o->op_private |= OPpENTERSUB_DB;
5080 while (o2 != cvop) {
5084 return too_many_arguments(o, gv_ename(namegv));
5102 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5103 bad_type(arg, "block", gv_ename(namegv), o2);
5108 if (o2->op_type == OP_RV2GV)
5112 OP* sib = kid->op_sibling;
5113 kid->op_sibling = 0;
5114 o2 = newUNOP(OP_RV2GV, 0, kid);
5115 o2->op_sibling = sib;
5116 prev->op_sibling = o2;
5124 if (o2->op_type != OP_RV2GV)
5125 bad_type(arg, "symbol", gv_ename(namegv), o2);
5128 if (o2->op_type != OP_RV2CV)
5129 bad_type(arg, "sub", gv_ename(namegv), o2);
5132 if (o2->op_type != OP_RV2SV
5133 && o2->op_type != OP_PADSV
5134 && o2->op_type != OP_THREADSV)
5136 bad_type(arg, "scalar", gv_ename(namegv), o2);
5140 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5141 bad_type(arg, "array", gv_ename(namegv), o2);
5144 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5145 bad_type(arg, "hash", gv_ename(namegv), o2);
5149 OP* sib = kid->op_sibling;
5150 kid->op_sibling = 0;
5151 o2 = newUNOP(OP_REFGEN, 0, kid);
5152 o2->op_sibling = sib;
5153 prev->op_sibling = o2;
5164 croak("Malformed prototype for %s: %s",
5165 gv_ename(namegv), SvPV((SV*)cv, PL_na));
5170 mod(o2, OP_ENTERSUB);
5172 o2 = o2->op_sibling;
5174 if (proto && !optional &&
5175 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5176 return too_few_arguments(o, gv_ename(namegv));
5183 SvREADONLY_on(cSVOPo->op_sv);
5190 if (o->op_flags & OPf_KIDS) {
5191 SVOP *kid = (SVOP*)cUNOPo->op_first;
5193 if (kid->op_type == OP_NULL)
5194 kid = (SVOP*)kid->op_sibling;
5196 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5197 o->op_flags |= OPf_SPECIAL;
5202 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5205 peep(register OP *o)
5208 register OP* oldop = 0;
5209 if (!o || o->op_seq)
5213 SAVESPTR(PL_curcop);
5214 for (; o; o = o->op_next) {
5220 switch (o->op_type) {
5223 PL_curcop = ((COP*)o); /* for warnings */
5224 o->op_seq = PL_op_seqmax++;
5235 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5237 o->op_seq = PL_op_seqmax++;
5240 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5241 o->op_seq = PL_op_seqmax++;
5242 break; /* Scalar stub must produce undef. List stub is noop */
5246 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5247 PL_curcop = ((COP*)o);
5253 if (oldop && o->op_next) {
5254 oldop->op_next = o->op_next;
5257 o->op_seq = PL_op_seqmax++;
5261 if (o->op_next->op_type == OP_RV2SV) {
5262 if (!(o->op_next->op_private & OPpDEREF)) {
5264 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5265 o->op_next = o->op_next->op_next;
5266 o->op_type = OP_GVSV;
5267 o->op_ppaddr = ppaddr[OP_GVSV];
5270 else if (o->op_next->op_type == OP_RV2AV) {
5271 OP* pop = o->op_next->op_next;
5273 if (pop->op_type == OP_CONST &&
5274 (PL_op = pop->op_next) &&
5275 pop->op_next->op_type == OP_AELEM &&
5276 !(pop->op_next->op_private &
5277 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5278 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5282 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5286 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5287 o->op_next = pop->op_next->op_next;
5288 o->op_type = OP_AELEMFAST;
5289 o->op_ppaddr = ppaddr[OP_AELEMFAST];
5290 o->op_private = (U8)i;
5291 GvAVn(((GVOP*)o)->op_gv);
5294 o->op_seq = PL_op_seqmax++;
5301 o->op_seq = PL_op_seqmax++;
5302 while (cLOGOP->op_other->op_type == OP_NULL)
5303 cLOGOP->op_other = cLOGOP->op_other->op_next;
5304 peep(cLOGOP->op_other);
5308 o->op_seq = PL_op_seqmax++;
5309 peep(cCONDOP->op_true);
5310 peep(cCONDOP->op_false);
5314 o->op_seq = PL_op_seqmax++;
5315 peep(cLOOP->op_redoop);
5316 peep(cLOOP->op_nextop);
5317 peep(cLOOP->op_lastop);
5323 o->op_seq = PL_op_seqmax++;
5324 peep(cPMOP->op_pmreplstart);
5328 o->op_seq = PL_op_seqmax++;
5329 if (ckWARN(WARN_SYNTAX) && o->op_next
5330 && o->op_next->op_type == OP_NEXTSTATE) {
5331 if (o->op_next->op_sibling &&
5332 o->op_next->op_sibling->op_type != OP_EXIT &&
5333 o->op_next->op_sibling->op_type != OP_WARN &&
5334 o->op_next->op_sibling->op_type != OP_DIE) {
5335 line_t oldline = PL_curcop->cop_line;
5337 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5338 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5339 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5340 PL_curcop->cop_line = oldline;
5354 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5355 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5357 rop = (UNOP*)((BINOP*)o)->op_first;
5358 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5360 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5361 if (!SvOBJECT(lexname))
5363 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5364 if (!fields || !GvHV(*fields))
5366 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5367 key = SvPV(*svp, keylen);
5368 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5370 croak("No such field \"%s\" in variable %s of type %s",
5371 key, SvPV(lexname, PL_na), HvNAME(SvSTASH(lexname)));
5373 ind = SvIV(*indsvp);
5375 croak("Bad index while coercing array into hash");
5376 rop->op_type = OP_RV2AV;
5377 rop->op_ppaddr = ppaddr[OP_RV2AV];
5378 o->op_type = OP_AELEM;
5379 o->op_ppaddr = ppaddr[OP_AELEM];
5381 *svp = newSViv(ind);
5386 o->op_seq = PL_op_seqmax++;