3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*PL_check
24 #define CHECKCALL *PL_check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", PL_op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval, U32 flags));
52 static OP *newDEFSVOP _((void));
53 static OP *new_logop _((I32 type, I32 flags, OP **firstp, OP **otherp));
54 static void simplify_sort _((OP *o));
55 static bool is_handle_constructor _((OP *o, I32 argnum));
62 SV* tmpsv = sv_newmortal();
63 gv_efullname3(tmpsv, gv, Nullch);
64 return SvPV(tmpsv,n_a);
70 yyerror(form("Missing comma after first argument to %s function",
71 PL_op_desc[o->op_type]));
76 too_few_arguments(OP *o, char *name)
78 yyerror(form("Not enough arguments for %s", name));
83 too_many_arguments(OP *o, char *name)
85 yyerror(form("Too many arguments for %s", name));
90 bad_type(I32 n, char *t, char *name, OP *kid)
92 yyerror(form("Type of arg %d to %s must be %s (not %s)",
93 (int)n, name, t, PL_op_desc[kid->op_type]));
99 int type = o->op_type;
100 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
101 yyerror(form("Can't use subscript on %s", PL_op_desc[type]));
102 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
104 SV *msg = sv_2mortal(
105 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
106 type == OP_ENTERSUB ? '&' : '%'));
110 sv_catsv(GvSV(PL_errgv), msg);
112 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
117 /* "register" allocation */
120 pad_allocmy(char *name)
128 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
129 name[1] == '_' && (int)strlen(name) > 2))
131 if (!isPRINT(name[1])) {
132 /* 1999-02-27 mjd@plover.com */
134 p = strchr(name, '\0');
135 /* The next block assumes the buffer is at least 205 chars
136 long. At present, it's always at least 256 chars. */
138 strcpy(name+200, "...");
144 /* Move everything else down one character */
145 for (; p-name > 2; p--)
147 name[2] = toCTRL(name[1]);
150 croak("Can't use global %s in \"my\"",name);
152 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
153 SV **svp = AvARRAY(PL_comppad_name);
154 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
156 && sv != &PL_sv_undef
157 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
158 && strEQ(name, SvPVX(sv)))
161 "\"my\" variable %s masks earlier declaration in same %s",
162 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
167 off = pad_alloc(OP_PADSV, SVs_PADMY);
169 sv_upgrade(sv, SVt_PVNV);
171 if (PL_in_my_stash) {
173 croak("Can't declare class for non-scalar %s in \"my\"",name);
175 (void)SvUPGRADE(sv, SVt_PVMG);
176 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
179 av_store(PL_comppad_name, off, sv);
180 SvNVX(sv) = (double)PAD_MAX;
181 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
182 if (!PL_min_intro_pending)
183 PL_min_intro_pending = off;
184 PL_max_intro_pending = off;
186 av_store(PL_comppad, off, (SV*)newAV());
187 else if (*name == '%')
188 av_store(PL_comppad, off, (SV*)newHV());
189 SvPADMY_on(PL_curpad[off]);
193 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
196 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval,
204 register PERL_CONTEXT *cx;
206 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
207 AV *curlist = CvPADLIST(cv);
208 SV **svp = av_fetch(curlist, 0, FALSE);
211 if (!svp || *svp == &PL_sv_undef)
214 svp = AvARRAY(curname);
215 for (off = AvFILLp(curname); off > 0; off--) {
216 if ((sv = svp[off]) &&
217 sv != &PL_sv_undef &&
219 seq > I_32(SvNVX(sv)) &&
220 strEQ(SvPVX(sv), name))
231 return 0; /* don't clone from inactive stack frame */
235 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
236 oldsv = *av_fetch(oldpad, off, TRUE);
237 if (!newoff) { /* Not a mere clone operation. */
238 SV *namesv = NEWSV(1103,0);
239 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
240 sv_upgrade(namesv, SVt_PVNV);
241 sv_setpv(namesv, name);
242 av_store(PL_comppad_name, newoff, namesv);
243 SvNVX(namesv) = (double)PL_curcop->cop_seq;
244 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
245 SvFAKE_on(namesv); /* A ref, not a real var */
246 if (SvOBJECT(sv)) { /* A typed var */
248 (void)SvUPGRADE(namesv, SVt_PVMG);
249 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
252 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
253 /* "It's closures all the way down." */
254 CvCLONE_on(PL_compcv);
256 if (CvANON(PL_compcv))
257 oldsv = Nullsv; /* no need to keep ref */
262 bcv && bcv != cv && !CvCLONE(bcv);
263 bcv = CvOUTSIDE(bcv))
268 if (ckWARN(WARN_CLOSURE)
269 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
272 "Variable \"%s\" may be unavailable",
280 else if (!CvUNIQUE(PL_compcv)) {
281 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
283 "Variable \"%s\" will not stay shared", name);
286 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
292 if (flags & FINDLEX_NOSEARCH)
295 /* Nothing in current lexical context--try eval's context, if any.
296 * This is necessary to let the perldb get at lexically scoped variables.
297 * XXX This will also probably interact badly with eval tree caching.
300 for (i = cx_ix; i >= 0; i--) {
302 switch (CxTYPE(cx)) {
304 if (i == 0 && saweval) {
305 seq = cxstack[saweval].blk_oldcop->cop_seq;
306 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
310 switch (cx->blk_eval.old_op_type) {
316 /* require must have its own scope */
324 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
325 saweval = i; /* so we know where we were called from */
328 seq = cxstack[saweval].blk_oldcop->cop_seq;
329 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
337 pad_findmy(char *name)
343 SV **svp = AvARRAY(PL_comppad_name);
344 U32 seq = PL_cop_seqmax;
350 * Special case to get lexical (and hence per-thread) @_.
351 * XXX I need to find out how to tell at parse-time whether use
352 * of @_ should refer to a lexical (from a sub) or defgv (global
353 * scope and maybe weird sub-ish things like formats). See
354 * startsub in perly.y. It's possible that @_ could be lexical
355 * (at least from subs) even in non-threaded perl.
357 if (strEQ(name, "@_"))
358 return 0; /* success. (NOT_IN_PAD indicates failure) */
359 #endif /* USE_THREADS */
361 /* The one we're looking for is probably just before comppad_name_fill. */
362 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
363 if ((sv = svp[off]) &&
364 sv != &PL_sv_undef &&
367 seq > I_32(SvNVX(sv)))) &&
368 strEQ(SvPVX(sv), name))
371 return (PADOFFSET)off;
372 pendoff = off; /* this pending def. will override import */
376 outside = CvOUTSIDE(PL_compcv);
378 /* Check if if we're compiling an eval'', and adjust seq to be the
379 * eval's seq number. This depends on eval'' having a non-null
380 * CvOUTSIDE() while it is being compiled. The eval'' itself is
381 * identified by CvEVAL being true and CvGV being null. */
382 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
383 cx = &cxstack[cxstack_ix];
385 seq = cx->blk_oldcop->cop_seq;
388 /* See if it's in a nested scope */
389 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
391 /* If there is a pending local definition, this new alias must die */
393 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
394 return off; /* pad_findlex returns 0 for failure...*/
396 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
400 pad_leavemy(I32 fill)
403 SV **svp = AvARRAY(PL_comppad_name);
405 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
406 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
407 if ((sv = svp[off]) && sv != &PL_sv_undef)
408 warn("%s never introduced", SvPVX(sv));
411 /* "Deintroduce" my variables that are leaving with this scope. */
412 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
413 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
414 SvIVX(sv) = PL_cop_seqmax;
419 pad_alloc(I32 optype, U32 tmptype)
425 if (AvARRAY(PL_comppad) != PL_curpad)
426 croak("panic: pad_alloc");
427 if (PL_pad_reset_pending)
429 if (tmptype & SVs_PADMY) {
431 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
432 } while (SvPADBUSY(sv)); /* need a fresh one */
433 retval = AvFILLp(PL_comppad);
436 SV **names = AvARRAY(PL_comppad_name);
437 SSize_t names_fill = AvFILLp(PL_comppad_name);
440 * "foreach" index vars temporarily become aliases to non-"my"
441 * values. Thus we must skip, not just pad values that are
442 * marked as current pad values, but also those with names.
444 if (++PL_padix <= names_fill &&
445 (sv = names[PL_padix]) && sv != &PL_sv_undef)
447 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
448 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
453 SvFLAGS(sv) |= tmptype;
454 PL_curpad = AvARRAY(PL_comppad);
456 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
457 (unsigned long) thr, (unsigned long) PL_curpad,
458 (long) retval, PL_op_name[optype]));
460 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
461 (unsigned long) PL_curpad,
462 (long) retval, PL_op_name[optype]));
463 #endif /* USE_THREADS */
464 return (PADOFFSET)retval;
472 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
473 (unsigned long) thr, (unsigned long) PL_curpad, po));
476 croak("panic: pad_sv po");
477 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
478 (unsigned long) PL_curpad, po));
479 #endif /* USE_THREADS */
480 return PL_curpad[po]; /* eventually we'll turn this into a macro */
484 pad_free(PADOFFSET po)
489 if (AvARRAY(PL_comppad) != PL_curpad)
490 croak("panic: pad_free curpad");
492 croak("panic: pad_free po");
494 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
495 (unsigned long) thr, (unsigned long) PL_curpad, po));
497 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
498 (unsigned long) PL_curpad, po));
499 #endif /* USE_THREADS */
500 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
501 SvPADTMP_off(PL_curpad[po]);
502 if ((I32)po < PL_padix)
507 pad_swipe(PADOFFSET po)
510 if (AvARRAY(PL_comppad) != PL_curpad)
511 croak("panic: pad_swipe curpad");
513 croak("panic: pad_swipe po");
515 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
516 (unsigned long) thr, (unsigned long) PL_curpad, po));
518 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
519 (unsigned long) PL_curpad, po));
520 #endif /* USE_THREADS */
521 SvPADTMP_off(PL_curpad[po]);
522 PL_curpad[po] = NEWSV(1107,0);
523 SvPADTMP_on(PL_curpad[po]);
524 if ((I32)po < PL_padix)
528 /* XXX pad_reset() is currently disabled because it results in serious bugs.
529 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
530 * on the stack by OPs that use them, there are several ways to get an alias
531 * to a shared TARG. Such an alias will change randomly and unpredictably.
532 * We avoid doing this until we can think of a Better Way.
537 #ifdef USE_BROKEN_PAD_RESET
541 if (AvARRAY(PL_comppad) != PL_curpad)
542 croak("panic: pad_reset curpad");
544 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
545 (unsigned long) thr, (unsigned long) PL_curpad));
547 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
548 (unsigned long) PL_curpad));
549 #endif /* USE_THREADS */
550 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
551 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
552 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
553 SvPADTMP_off(PL_curpad[po]);
555 PL_padix = PL_padix_floor;
558 PL_pad_reset_pending = FALSE;
562 /* find_threadsv is not reentrant */
564 find_threadsv(const char *name)
570 /* We currently only handle names of a single character */
571 p = strchr(PL_threadsv_names, *name);
574 key = p - PL_threadsv_names;
575 MUTEX_LOCK(&thr->mutex);
576 svp = av_fetch(thr->threadsv, key, FALSE);
578 MUTEX_UNLOCK(&thr->mutex);
580 SV *sv = NEWSV(0, 0);
581 av_store(thr->threadsv, key, sv);
582 thr->threadsvp = AvARRAY(thr->threadsv);
583 MUTEX_UNLOCK(&thr->mutex);
585 * Some magic variables used to be automagically initialised
586 * in gv_fetchpv. Those which are now per-thread magicals get
587 * initialised here instead.
593 sv_setpv(sv, "\034");
594 sv_magic(sv, 0, 0, name, 1);
599 PL_sawampersand = TRUE;
613 /* XXX %! tied to Errno.pm needs to be added here.
614 * See gv_fetchpv(). */
618 sv_magic(sv, 0, 0, name, 1);
620 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
621 "find_threadsv: new SV %p for $%s%c\n",
622 sv, (*name < 32) ? "^" : "",
623 (*name < 32) ? toCTRL(*name) : *name));
627 #endif /* USE_THREADS */
634 register OP *kid, *nextkid;
636 if (!o || o->op_seq == (U16)-1)
639 if (o->op_flags & OPf_KIDS) {
640 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
641 nextkid = kid->op_sibling; /* Get before next freeing kid */
646 switch (o->op_type) {
648 o->op_targ = 0; /* Was holding old type, if any. */
651 o->op_targ = 0; /* Was holding hints. */
655 if (!(o->op_flags & OPf_SPECIAL))
659 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
661 #endif /* USE_THREADS */
663 if (!(o->op_flags & OPf_REF)
664 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
670 SvREFCNT_dec(cGVOPo->op_gv);
674 Safefree(cCOPo->cop_label);
675 SvREFCNT_dec(cCOPo->cop_filegv);
676 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
677 SvREFCNT_dec(cCOPo->cop_warnings);
680 SvREFCNT_dec(cSVOPo->op_sv);
686 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
690 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
691 SvREFCNT_dec(cSVOPo->op_sv);
693 Safefree(cPVOPo->op_pv);
696 op_free(cPMOPo->op_pmreplroot);
701 ReREFCNT_dec(cPMOPo->op_pmregexp);
706 pad_free(o->op_targ);
714 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
715 pad_free(o->op_targ);
716 o->op_targ = o->op_type;
717 o->op_type = OP_NULL;
718 o->op_ppaddr = PL_ppaddr[OP_NULL];
721 /* Contextualizers */
723 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
733 /* establish postfix order */
734 if (cUNOPo->op_first) {
735 o->op_next = LINKLIST(cUNOPo->op_first);
736 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
738 kid->op_next = LINKLIST(kid->op_sibling);
753 if (o && o->op_flags & OPf_KIDS) {
754 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
763 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
765 if (ckWARN(WARN_SYNTAX)) {
766 line_t oldline = PL_curcop->cop_line;
768 if (PL_copline != NOLINE)
769 PL_curcop->cop_line = PL_copline;
770 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
771 PL_curcop->cop_line = oldline;
782 /* assumes no premature commitment */
783 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
784 || o->op_type == OP_RETURN)
787 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
789 switch (o->op_type) {
791 if (o->op_private & OPpREPEAT_DOLIST)
792 null(((LISTOP*)cBINOPo->op_first)->op_first);
793 scalar(cBINOPo->op_first);
798 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
802 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
803 if (!kPMOP->op_pmreplroot)
804 deprecate("implicit split to @_");
812 if (o->op_flags & OPf_KIDS) {
813 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
819 kid = cLISTOPo->op_first;
821 while (kid = kid->op_sibling) {
827 WITH_THR(PL_curcop = &PL_compiling);
832 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
838 WITH_THR(PL_curcop = &PL_compiling);
851 /* assumes no premature commitment */
852 U8 want = o->op_flags & OPf_WANT;
853 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
854 || o->op_type == OP_RETURN)
857 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
859 switch (o->op_type) {
861 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
865 if (o->op_flags & OPf_STACKED)
869 if (o->op_private == 4)
940 if (!(o->op_private & OPpLVAL_INTRO))
941 useless = PL_op_desc[o->op_type];
948 if (!(o->op_private & OPpLVAL_INTRO) &&
949 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
950 useless = "a variable";
955 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
962 if (ckWARN(WARN_VOID)) {
963 useless = "a constant";
964 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
966 else if (SvPOK(sv)) {
967 if (strnEQ(SvPVX(sv), "di", 2) ||
968 strnEQ(SvPVX(sv), "ds", 2) ||
969 strnEQ(SvPVX(sv), "ig", 2))
974 null(o); /* don't execute a constant */
975 SvREFCNT_dec(sv); /* don't even remember it */
979 o->op_type = OP_PREINC; /* pre-increment is faster */
980 o->op_ppaddr = PL_ppaddr[OP_PREINC];
984 o->op_type = OP_PREDEC; /* pre-decrement is faster */
985 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
991 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
996 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
997 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
998 if (o->op_flags & OPf_STACKED)
1004 if (!(o->op_flags & OPf_KIDS))
1013 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1020 /* all requires must return a boolean value */
1021 o->op_flags &= ~OPf_WANT;
1024 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1025 if (!kPMOP->op_pmreplroot)
1026 deprecate("implicit split to @_");
1032 if (ckWARN(WARN_VOID))
1033 warner(WARN_VOID, "Useless use of %s in void context", useless);
1042 if (o && o->op_flags & OPf_KIDS) {
1043 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1054 /* assumes no premature commitment */
1055 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1056 || o->op_type == OP_RETURN)
1059 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1061 switch (o->op_type) {
1064 list(cBINOPo->op_first);
1069 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1077 if (!(o->op_flags & OPf_KIDS))
1079 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1080 list(cBINOPo->op_first);
1081 return gen_constant_list(o);
1088 kid = cLISTOPo->op_first;
1090 while (kid = kid->op_sibling) {
1091 if (kid->op_sibling)
1096 WITH_THR(PL_curcop = &PL_compiling);
1100 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1101 if (kid->op_sibling)
1106 WITH_THR(PL_curcop = &PL_compiling);
1109 /* all requires must return a boolean value */
1110 o->op_flags &= ~OPf_WANT;
1122 if (o->op_type == OP_LINESEQ ||
1123 o->op_type == OP_SCOPE ||
1124 o->op_type == OP_LEAVE ||
1125 o->op_type == OP_LEAVETRY)
1128 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1129 if (kid->op_sibling) {
1133 PL_curcop = &PL_compiling;
1135 o->op_flags &= ~OPf_PARENS;
1136 if (PL_hints & HINT_BLOCK_SCOPE)
1137 o->op_flags |= OPf_PARENS;
1140 o = newOP(OP_STUB, 0);
1145 modkids(OP *o, I32 type)
1148 if (o && o->op_flags & OPf_KIDS) {
1149 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1156 mod(OP *o, I32 type)
1163 if (!o || PL_error_count)
1166 switch (o->op_type) {
1171 if (!(o->op_private & (OPpCONST_ARYBASE)))
1173 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1174 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1178 SAVEI32(PL_compiling.cop_arybase);
1179 PL_compiling.cop_arybase = 0;
1181 else if (type == OP_REFGEN)
1184 croak("That use of $[ is unsupported");
1187 if (o->op_flags & OPf_PARENS)
1191 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1192 !(o->op_flags & OPf_STACKED)) {
1193 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1194 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1195 assert(cUNOPo->op_first->op_type == OP_NULL);
1196 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1202 /* grep, foreach, subcalls, refgen */
1203 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1205 yyerror(form("Can't modify %s in %s",
1206 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1207 ? "do block" : PL_op_desc[o->op_type]),
1208 type ? PL_op_desc[type] : "local"));
1222 case OP_RIGHT_SHIFT:
1231 if (!(o->op_flags & OPf_STACKED))
1237 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1243 if (!type && cUNOPo->op_first->op_type != OP_GV)
1244 croak("Can't localize through a reference");
1245 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1246 PL_modcount = 10000;
1247 return o; /* Treat \(@foo) like ordinary list. */
1251 if (scalar_mod_type(o, type))
1253 ref(cUNOPo->op_first, o->op_type);
1262 PL_modcount = 10000;
1265 if (!type && cUNOPo->op_first->op_type != OP_GV)
1266 croak("Can't localize through a reference");
1267 ref(cUNOPo->op_first, o->op_type);
1271 PL_hints |= HINT_BLOCK_SCOPE;
1281 PL_modcount = 10000;
1282 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1283 return o; /* Treat \(@foo) like ordinary list. */
1284 if (scalar_mod_type(o, type))
1290 croak("Can't localize lexical variable %s",
1291 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1296 PL_modcount++; /* XXX ??? */
1298 #endif /* USE_THREADS */
1304 if (type != OP_SASSIGN)
1308 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1314 pad_free(o->op_targ);
1315 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1316 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1317 if (o->op_flags & OPf_KIDS)
1318 mod(cBINOPo->op_first->op_sibling, type);
1323 ref(cBINOPo->op_first, o->op_type);
1324 if (type == OP_ENTERSUB &&
1325 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1326 o->op_private |= OPpLVAL_DEFER;
1333 if (o->op_flags & OPf_KIDS)
1334 mod(cLISTOPo->op_last, type);
1338 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1340 else if (!(o->op_flags & OPf_KIDS))
1342 if (o->op_targ != OP_LIST) {
1343 mod(cBINOPo->op_first, type);
1348 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1352 o->op_flags |= OPf_MOD;
1354 if (type == OP_AASSIGN || type == OP_SASSIGN)
1355 o->op_flags |= OPf_SPECIAL|OPf_REF;
1357 o->op_private |= OPpLVAL_INTRO;
1358 o->op_flags &= ~OPf_SPECIAL;
1359 PL_hints |= HINT_BLOCK_SCOPE;
1361 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1362 o->op_flags |= OPf_REF;
1367 scalar_mod_type(OP *o, I32 type)
1371 if (o->op_type == OP_RV2GV)
1395 case OP_RIGHT_SHIFT:
1414 is_handle_constructor(OP *o, I32 argnum)
1416 switch (o->op_type) {
1424 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1437 refkids(OP *o, I32 type)
1440 if (o && o->op_flags & OPf_KIDS) {
1441 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1448 ref(OP *o, I32 type)
1452 if (!o || PL_error_count)
1455 switch (o->op_type) {
1457 if ((type == OP_DEFINED || type == OP_LOCK) &&
1458 !(o->op_flags & OPf_STACKED)) {
1459 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1460 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1461 assert(cUNOPo->op_first->op_type == OP_NULL);
1462 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1463 o->op_flags |= OPf_SPECIAL;
1468 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1472 if (type == OP_DEFINED)
1473 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1474 ref(cUNOPo->op_first, o->op_type);
1477 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1478 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1479 : type == OP_RV2HV ? OPpDEREF_HV
1481 o->op_flags |= OPf_MOD;
1486 o->op_flags |= OPf_MOD; /* XXX ??? */
1491 o->op_flags |= OPf_REF;
1494 if (type == OP_DEFINED)
1495 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1496 ref(cUNOPo->op_first, o->op_type);
1501 o->op_flags |= OPf_REF;
1506 if (!(o->op_flags & OPf_KIDS))
1508 ref(cBINOPo->op_first, type);
1512 ref(cBINOPo->op_first, o->op_type);
1513 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1514 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1515 : type == OP_RV2HV ? OPpDEREF_HV
1517 o->op_flags |= OPf_MOD;
1525 if (!(o->op_flags & OPf_KIDS))
1527 ref(cLISTOPo->op_last, type);
1542 if (!o || PL_error_count)
1546 if (type == OP_LIST) {
1547 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1549 } else if (type == OP_UNDEF) {
1551 } else if (type != OP_PADSV &&
1554 type != OP_PUSHMARK)
1556 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1559 o->op_flags |= OPf_MOD;
1560 o->op_private |= OPpLVAL_INTRO;
1568 o->op_flags |= OPf_PARENS;
1573 bind_match(I32 type, OP *left, OP *right)
1578 if (ckWARN(WARN_UNSAFE) &&
1579 (left->op_type == OP_RV2AV ||
1580 left->op_type == OP_RV2HV ||
1581 left->op_type == OP_PADAV ||
1582 left->op_type == OP_PADHV)) {
1583 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1584 right->op_type == OP_TRANS)
1585 ? right->op_type : OP_MATCH];
1586 char *sample = ((left->op_type == OP_RV2AV ||
1587 left->op_type == OP_PADAV)
1588 ? "@array" : "%hash");
1590 "Applying %s to %s will act on scalar(%s)",
1591 desc, sample, sample);
1594 if (right->op_type == OP_MATCH ||
1595 right->op_type == OP_SUBST ||
1596 right->op_type == OP_TRANS) {
1597 right->op_flags |= OPf_STACKED;
1598 if (right->op_type != OP_MATCH)
1599 left = mod(left, right->op_type);
1600 if (right->op_type == OP_TRANS)
1601 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1603 o = prepend_elem(right->op_type, scalar(left), right);
1605 return newUNOP(OP_NOT, 0, scalar(o));
1609 return bind_match(type, left,
1610 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1618 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1619 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1626 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1627 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1628 o->op_type = OP_LEAVE;
1629 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1632 if (o->op_type == OP_LINESEQ) {
1634 o->op_type = OP_SCOPE;
1635 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1636 kid = ((LISTOP*)o)->op_first;
1637 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1638 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1643 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1653 SAVESPTR(GvHV(PL_hintgv));
1654 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1655 SAVEFREESV(GvHV(PL_hintgv));
1659 block_start(int full)
1662 int retval = PL_savestack_ix;
1664 SAVEI32(PL_comppad_name_floor);
1666 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1667 PL_comppad_name_floor = PL_comppad_name_fill;
1669 PL_comppad_name_floor = 0;
1671 SAVEI32(PL_min_intro_pending);
1672 SAVEI32(PL_max_intro_pending);
1673 PL_min_intro_pending = 0;
1674 SAVEI32(PL_comppad_name_fill);
1675 SAVEI32(PL_padix_floor);
1676 PL_padix_floor = PL_padix;
1677 PL_pad_reset_pending = FALSE;
1679 PL_hints &= ~HINT_BLOCK_SCOPE;
1680 SAVEPPTR(PL_compiling.cop_warnings);
1681 if (PL_compiling.cop_warnings != WARN_ALL &&
1682 PL_compiling.cop_warnings != WARN_NONE) {
1683 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1684 SAVEFREESV(PL_compiling.cop_warnings) ;
1692 block_end(I32 floor, OP *seq)
1695 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1696 OP* retval = scalarseq(seq);
1698 PL_pad_reset_pending = FALSE;
1699 PL_compiling.op_private = PL_hints;
1701 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1702 pad_leavemy(PL_comppad_name_fill);
1711 OP *o = newOP(OP_THREADSV, 0);
1712 o->op_targ = find_threadsv("_");
1715 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1716 #endif /* USE_THREADS */
1724 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1725 PL_eval_start = linklist(PL_eval_root);
1726 PL_eval_root->op_next = 0;
1727 peep(PL_eval_start);
1732 PL_main_root = scope(sawparens(scalarvoid(o)));
1733 PL_curcop = &PL_compiling;
1734 PL_main_start = LINKLIST(PL_main_root);
1735 PL_main_root->op_next = 0;
1736 peep(PL_main_start);
1739 /* Register with debugger */
1741 CV *cv = perl_get_cv("DB::postponed", FALSE);
1745 XPUSHs((SV*)PL_compiling.cop_filegv);
1747 perl_call_sv((SV*)cv, G_DISCARD);
1754 localize(OP *o, I32 lex)
1756 if (o->op_flags & OPf_PARENS)
1760 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1762 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1763 if (*s == ';' || *s == '=')
1764 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1765 lex ? "my" : "local");
1769 PL_in_my_stash = Nullhv;
1773 return mod(o, OP_NULL); /* a bit kludgey */
1779 if (o->op_type == OP_LIST) {
1782 o2 = newOP(OP_THREADSV, 0);
1783 o2->op_targ = find_threadsv(";");
1785 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1786 #endif /* USE_THREADS */
1787 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1793 fold_constants(register OP *o)
1797 I32 type = o->op_type;
1800 if (PL_opargs[type] & OA_RETSCALAR)
1802 if (PL_opargs[type] & OA_TARGET)
1803 o->op_targ = pad_alloc(type, SVs_PADTMP);
1805 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1806 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1808 if (!(PL_opargs[type] & OA_FOLDCONST))
1823 if (o->op_private & OPpLOCALE)
1828 goto nope; /* Don't try to run w/ errors */
1830 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1831 if (curop->op_type != OP_CONST &&
1832 curop->op_type != OP_LIST &&
1833 curop->op_type != OP_SCALAR &&
1834 curop->op_type != OP_NULL &&
1835 curop->op_type != OP_PUSHMARK) {
1840 curop = LINKLIST(o);
1844 sv = *(PL_stack_sp--);
1845 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1846 pad_swipe(o->op_targ);
1847 else if (SvTEMP(sv)) { /* grab mortal temp? */
1848 (void)SvREFCNT_inc(sv);
1852 if (type == OP_RV2GV)
1853 return newGVOP(OP_GV, 0, (GV*)sv);
1855 /* try to smush double to int, but don't smush -2.0 to -2 */
1856 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1860 if ((double)iv == SvNV(sv)) {
1865 SvIOK_off(sv); /* undo SvIV() damage */
1867 return newSVOP(OP_CONST, 0, sv);
1871 if (!(PL_opargs[type] & OA_OTHERINT))
1874 if (!(PL_hints & HINT_INTEGER)) {
1875 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1878 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1879 if (curop->op_type == OP_CONST) {
1880 if (SvIOK(((SVOP*)curop)->op_sv))
1884 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1888 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1895 gen_constant_list(register OP *o)
1899 I32 oldtmps_floor = PL_tmps_floor;
1903 return o; /* Don't attempt to run with errors */
1905 PL_op = curop = LINKLIST(o);
1911 PL_tmps_floor = oldtmps_floor;
1913 o->op_type = OP_RV2AV;
1914 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1915 curop = ((UNOP*)o)->op_first;
1916 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1923 convert(I32 type, I32 flags, OP *o)
1928 if (!o || o->op_type != OP_LIST)
1929 o = newLISTOP(OP_LIST, 0, o, Nullop);
1931 o->op_flags &= ~OPf_WANT;
1933 if (!(PL_opargs[type] & OA_MARK))
1934 null(cLISTOPo->op_first);
1937 o->op_ppaddr = PL_ppaddr[type];
1938 o->op_flags |= flags;
1940 o = CHECKOP(type, o);
1941 if (o->op_type != type)
1944 if (cLISTOPo->op_children < 7) {
1945 /* XXX do we really need to do this if we're done appending?? */
1946 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1948 cLISTOPo->op_last = last; /* in case check substituted last arg */
1951 return fold_constants(o);
1954 /* List constructors */
1957 append_elem(I32 type, OP *first, OP *last)
1965 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1966 return newLISTOP(type, 0, first, last);
1968 if (first->op_flags & OPf_KIDS)
1969 ((LISTOP*)first)->op_last->op_sibling = last;
1971 first->op_flags |= OPf_KIDS;
1972 ((LISTOP*)first)->op_first = last;
1974 ((LISTOP*)first)->op_last = last;
1975 ((LISTOP*)first)->op_children++;
1980 append_list(I32 type, LISTOP *first, LISTOP *last)
1988 if (first->op_type != type)
1989 return prepend_elem(type, (OP*)first, (OP*)last);
1991 if (last->op_type != type)
1992 return append_elem(type, (OP*)first, (OP*)last);
1994 first->op_last->op_sibling = last->op_first;
1995 first->op_last = last->op_last;
1996 first->op_children += last->op_children;
1997 if (first->op_children)
1998 first->op_flags |= OPf_KIDS;
2005 prepend_elem(I32 type, OP *first, OP *last)
2013 if (last->op_type == type) {
2014 if (type == OP_LIST) { /* already a PUSHMARK there */
2015 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2016 ((LISTOP*)last)->op_first->op_sibling = first;
2019 if (!(last->op_flags & OPf_KIDS)) {
2020 ((LISTOP*)last)->op_last = first;
2021 last->op_flags |= OPf_KIDS;
2023 first->op_sibling = ((LISTOP*)last)->op_first;
2024 ((LISTOP*)last)->op_first = first;
2026 ((LISTOP*)last)->op_children++;
2030 return newLISTOP(type, 0, first, last);
2038 return newOP(OP_STUB, 0);
2044 if (!o || o->op_type != OP_LIST)
2045 o = newLISTOP(OP_LIST, 0, o, Nullop);
2051 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2055 Newz(1101, listop, 1, LISTOP);
2057 listop->op_type = type;
2058 listop->op_ppaddr = PL_ppaddr[type];
2059 listop->op_children = (first != 0) + (last != 0);
2060 listop->op_flags = flags;
2064 else if (!first && last)
2067 first->op_sibling = last;
2068 listop->op_first = first;
2069 listop->op_last = last;
2070 if (type == OP_LIST) {
2072 pushop = newOP(OP_PUSHMARK, 0);
2073 pushop->op_sibling = first;
2074 listop->op_first = pushop;
2075 listop->op_flags |= OPf_KIDS;
2077 listop->op_last = pushop;
2079 else if (listop->op_children)
2080 listop->op_flags |= OPf_KIDS;
2086 newOP(I32 type, I32 flags)
2089 Newz(1101, o, 1, OP);
2091 o->op_ppaddr = PL_ppaddr[type];
2092 o->op_flags = flags;
2095 o->op_private = 0 + (flags >> 8);
2096 if (PL_opargs[type] & OA_RETSCALAR)
2098 if (PL_opargs[type] & OA_TARGET)
2099 o->op_targ = pad_alloc(type, SVs_PADTMP);
2100 return CHECKOP(type, o);
2104 newUNOP(I32 type, I32 flags, OP *first)
2109 first = newOP(OP_STUB, 0);
2110 if (PL_opargs[type] & OA_MARK)
2111 first = force_list(first);
2113 Newz(1101, unop, 1, UNOP);
2114 unop->op_type = type;
2115 unop->op_ppaddr = PL_ppaddr[type];
2116 unop->op_first = first;
2117 unop->op_flags = flags | OPf_KIDS;
2118 unop->op_private = 1 | (flags >> 8);
2119 unop = (UNOP*) CHECKOP(type, unop);
2123 return fold_constants((OP *) unop);
2127 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2130 Newz(1101, binop, 1, BINOP);
2133 first = newOP(OP_NULL, 0);
2135 binop->op_type = type;
2136 binop->op_ppaddr = PL_ppaddr[type];
2137 binop->op_first = first;
2138 binop->op_flags = flags | OPf_KIDS;
2141 binop->op_private = 1 | (flags >> 8);
2144 binop->op_private = 2 | (flags >> 8);
2145 first->op_sibling = last;
2148 binop = (BINOP*)CHECKOP(type, binop);
2152 binop->op_last = binop->op_first->op_sibling;
2154 return fold_constants((OP *)binop);
2158 utf8compare(const void *a, const void *b)
2161 for (i = 0; i < 10; i++) {
2162 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2164 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2171 pmtrans(OP *o, OP *expr, OP *repl)
2173 SV *tstr = ((SVOP*)expr)->op_sv;
2174 SV *rstr = ((SVOP*)repl)->op_sv;
2177 register U8 *t = (U8*)SvPV(tstr, tlen);
2178 register U8 *r = (U8*)SvPV(rstr, rlen);
2184 register short *tbl;
2186 complement = o->op_private & OPpTRANS_COMPLEMENT;
2187 del = o->op_private & OPpTRANS_DELETE;
2188 squash = o->op_private & OPpTRANS_SQUASH;
2190 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2191 SV* listsv = newSVpv("# comment\n",0);
2193 U8* tend = t + tlen;
2194 U8* rend = r + rlen;
2210 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2211 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2217 New(1109, cp, tlen, U8*);
2219 transv = newSVpv("",0);
2228 qsort(cp, i, sizeof(U8*), utf8compare);
2229 for (j = 0; j < i; j++) {
2231 UV val = utf8_to_uv(s, &ulen);
2233 diff = val - nextmin;
2235 t = uv_to_utf8(tmpbuf,nextmin);
2236 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2238 t = uv_to_utf8(tmpbuf, val - 1);
2239 sv_catpvn(transv, "\377", 1);
2240 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2244 val = utf8_to_uv(s+1, &ulen);
2248 t = uv_to_utf8(tmpbuf,nextmin);
2249 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2250 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2251 sv_catpvn(transv, "\377", 1);
2252 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2253 t = (U8*)SvPVX(transv);
2254 tlen = SvCUR(transv);
2257 else if (!rlen && !del) {
2258 r = t; rlen = tlen; rend = tend;
2261 if (to_utf && from_utf) { /* only counting characters */
2262 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2263 o->op_private |= OPpTRANS_IDENTICAL;
2265 else { /* straight latin-1 translation */
2266 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2267 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2268 o->op_private |= OPpTRANS_IDENTICAL;
2272 while (t < tend || tfirst <= tlast) {
2273 /* see if we need more "t" chars */
2274 if (tfirst > tlast) {
2275 tfirst = (I32)utf8_to_uv(t, &ulen);
2277 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2278 tlast = (I32)utf8_to_uv(++t, &ulen);
2285 /* now see if we need more "r" chars */
2286 if (rfirst > rlast) {
2288 rfirst = (I32)utf8_to_uv(r, &ulen);
2290 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2291 rlast = (I32)utf8_to_uv(++r, &ulen);
2300 rfirst = rlast = 0xffffffff;
2304 /* now see which range will peter our first, if either. */
2305 tdiff = tlast - tfirst;
2306 rdiff = rlast - rfirst;
2313 if (rfirst == 0xffffffff) {
2314 diff = tdiff; /* oops, pretend rdiff is infinite */
2316 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2318 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2322 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2324 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2326 if (rfirst + diff > max)
2327 max = rfirst + diff;
2332 else if (rfirst <= 0x800)
2333 grows |= (tfirst < 0x80);
2334 else if (rfirst <= 0x10000)
2335 grows |= (tfirst < 0x800);
2336 else if (rfirst <= 0x200000)
2337 grows |= (tfirst < 0x10000);
2338 else if (rfirst <= 0x4000000)
2339 grows |= (tfirst < 0x200000);
2340 else if (rfirst <= 0x80000000)
2341 grows |= (tfirst < 0x4000000);
2353 else if (max > 0xff)
2358 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2359 SvREFCNT_dec(listsv);
2361 SvREFCNT_dec(transv);
2363 if (!del && havefinal)
2364 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2366 if (grows && to_utf)
2367 o->op_private |= OPpTRANS_GROWS;
2374 tbl = (short*)cPVOPo->op_pv;
2376 Zero(tbl, 256, short);
2377 for (i = 0; i < tlen; i++)
2379 for (i = 0, j = 0; i < 256; i++) {
2395 if (!rlen && !del) {
2398 o->op_private |= OPpTRANS_IDENTICAL;
2400 for (i = 0; i < 256; i++)
2402 for (i = 0, j = 0; i < tlen; i++,j++) {
2405 if (tbl[t[i]] == -1)
2411 if (tbl[t[i]] == -1)
2422 newPMOP(I32 type, I32 flags)
2427 Newz(1101, pmop, 1, PMOP);
2428 pmop->op_type = type;
2429 pmop->op_ppaddr = PL_ppaddr[type];
2430 pmop->op_flags = flags;
2431 pmop->op_private = 0 | (flags >> 8);
2433 if (PL_hints & HINT_RE_TAINT)
2434 pmop->op_pmpermflags |= PMf_RETAINT;
2435 if (PL_hints & HINT_LOCALE)
2436 pmop->op_pmpermflags |= PMf_LOCALE;
2437 pmop->op_pmflags = pmop->op_pmpermflags;
2439 /* link into pm list */
2440 if (type != OP_TRANS && PL_curstash) {
2441 pmop->op_pmnext = HvPMROOT(PL_curstash);
2442 HvPMROOT(PL_curstash) = pmop;
2449 pmruntime(OP *o, OP *expr, OP *repl)
2454 I32 repl_has_vars = 0;
2456 if (o->op_type == OP_TRANS)
2457 return pmtrans(o, expr, repl);
2459 PL_hints |= HINT_BLOCK_SCOPE;
2462 if (expr->op_type == OP_CONST) {
2464 SV *pat = ((SVOP*)expr)->op_sv;
2465 char *p = SvPV(pat, plen);
2466 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2467 sv_setpvn(pat, "\\s+", 3);
2468 p = SvPV(pat, plen);
2469 pm->op_pmflags |= PMf_SKIPWHITE;
2471 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2472 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2473 pm->op_pmflags |= PMf_WHITE;
2477 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2478 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2480 : OP_REGCMAYBE),0,expr);
2482 Newz(1101, rcop, 1, LOGOP);
2483 rcop->op_type = OP_REGCOMP;
2484 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2485 rcop->op_first = scalar(expr);
2486 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2487 ? (OPf_SPECIAL | OPf_KIDS)
2489 rcop->op_private = 1;
2492 /* establish postfix order */
2493 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2495 rcop->op_next = expr;
2496 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2499 rcop->op_next = LINKLIST(expr);
2500 expr->op_next = (OP*)rcop;
2503 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2508 if (pm->op_pmflags & PMf_EVAL)
2511 else if (repl->op_type == OP_THREADSV
2512 && strchr("&`'123456789+",
2513 PL_threadsv_names[repl->op_targ]))
2517 #endif /* USE_THREADS */
2518 else if (repl->op_type == OP_CONST)
2522 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2523 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2525 if (curop->op_type == OP_THREADSV) {
2527 if (strchr("&`'123456789+", curop->op_private))
2531 if (curop->op_type == OP_GV) {
2532 GV *gv = ((GVOP*)curop)->op_gv;
2534 if (strchr("&`'123456789+", *GvENAME(gv)))
2537 #endif /* USE_THREADS */
2538 else if (curop->op_type == OP_RV2CV)
2540 else if (curop->op_type == OP_RV2SV ||
2541 curop->op_type == OP_RV2AV ||
2542 curop->op_type == OP_RV2HV ||
2543 curop->op_type == OP_RV2GV) {
2544 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2547 else if (curop->op_type == OP_PADSV ||
2548 curop->op_type == OP_PADAV ||
2549 curop->op_type == OP_PADHV ||
2550 curop->op_type == OP_PADANY) {
2553 else if (curop->op_type == OP_PUSHRE)
2554 ; /* Okay here, dangerous in newASSIGNOP */
2563 && (!pm->op_pmregexp
2564 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2565 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2566 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2567 prepend_elem(o->op_type, scalar(repl), o);
2570 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2571 pm->op_pmflags |= PMf_MAYBE_CONST;
2572 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2574 Newz(1101, rcop, 1, LOGOP);
2575 rcop->op_type = OP_SUBSTCONT;
2576 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2577 rcop->op_first = scalar(repl);
2578 rcop->op_flags |= OPf_KIDS;
2579 rcop->op_private = 1;
2582 /* establish postfix order */
2583 rcop->op_next = LINKLIST(repl);
2584 repl->op_next = (OP*)rcop;
2586 pm->op_pmreplroot = scalar((OP*)rcop);
2587 pm->op_pmreplstart = LINKLIST(rcop);
2596 newSVOP(I32 type, I32 flags, SV *sv)
2599 Newz(1101, svop, 1, SVOP);
2600 svop->op_type = type;
2601 svop->op_ppaddr = PL_ppaddr[type];
2603 svop->op_next = (OP*)svop;
2604 svop->op_flags = flags;
2605 if (PL_opargs[type] & OA_RETSCALAR)
2607 if (PL_opargs[type] & OA_TARGET)
2608 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2609 return CHECKOP(type, svop);
2613 newGVOP(I32 type, I32 flags, GV *gv)
2617 Newz(1101, gvop, 1, GVOP);
2618 gvop->op_type = type;
2619 gvop->op_ppaddr = PL_ppaddr[type];
2620 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2621 gvop->op_next = (OP*)gvop;
2622 gvop->op_flags = flags;
2623 if (PL_opargs[type] & OA_RETSCALAR)
2625 if (PL_opargs[type] & OA_TARGET)
2626 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2627 return CHECKOP(type, gvop);
2631 newPVOP(I32 type, I32 flags, char *pv)
2634 Newz(1101, pvop, 1, PVOP);
2635 pvop->op_type = type;
2636 pvop->op_ppaddr = PL_ppaddr[type];
2638 pvop->op_next = (OP*)pvop;
2639 pvop->op_flags = flags;
2640 if (PL_opargs[type] & OA_RETSCALAR)
2642 if (PL_opargs[type] & OA_TARGET)
2643 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2644 return CHECKOP(type, pvop);
2653 save_hptr(&PL_curstash);
2654 save_item(PL_curstname);
2659 name = SvPV(sv, len);
2660 PL_curstash = gv_stashpvn(name,len,TRUE);
2661 sv_setpvn(PL_curstname, name, len);
2665 sv_setpv(PL_curstname,"<none>");
2666 PL_curstash = Nullhv;
2668 PL_hints |= HINT_BLOCK_SCOPE;
2669 PL_copline = NOLINE;
2674 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2683 if (id->op_type != OP_CONST)
2684 croak("Module name must be constant");
2688 if(version != Nullop) {
2689 SV *vesv = ((SVOP*)version)->op_sv;
2691 if (arg == Nullop && !SvNIOK(vesv)) {
2698 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2699 croak("Version number must be constant number");
2701 /* Make copy of id so we don't free it twice */
2702 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2704 /* Fake up a method call to VERSION */
2705 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2706 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2707 append_elem(OP_LIST,
2708 prepend_elem(OP_LIST, pack, list(version)),
2709 newUNOP(OP_METHOD, 0, meth)));
2713 /* Fake up an import/unimport */
2714 if (arg && arg->op_type == OP_STUB)
2715 imop = arg; /* no import on explicit () */
2716 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2717 imop = Nullop; /* use 5.0; */
2720 /* Make copy of id so we don't free it twice */
2721 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2722 meth = newSVOP(OP_CONST, 0,
2724 ? newSVpv("import", 6)
2725 : newSVpv("unimport", 8)
2727 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2728 append_elem(OP_LIST,
2729 prepend_elem(OP_LIST, pack, list(arg)),
2730 newUNOP(OP_METHOD, 0, meth)));
2733 /* Fake up a require, handle override, if any */
2734 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2735 if (!(gv && GvIMPORTED_CV(gv)))
2736 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2738 if (gv && GvIMPORTED_CV(gv)) {
2739 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2740 append_elem(OP_LIST, id,
2741 scalar(newUNOP(OP_RV2CV, 0,
2746 rqop = newUNOP(OP_REQUIRE, 0, id);
2749 /* Fake up the BEGIN {}, which does its thing immediately. */
2751 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2753 append_elem(OP_LINESEQ,
2754 append_elem(OP_LINESEQ,
2755 newSTATEOP(0, Nullch, rqop),
2756 newSTATEOP(0, Nullch, veop)),
2757 newSTATEOP(0, Nullch, imop) ));
2759 PL_copline = NOLINE;
2769 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2770 if (!(gv && GvIMPORTED_CV(gv)))
2771 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2773 if (gv && GvIMPORTED_CV(gv)) {
2774 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2775 append_elem(OP_LIST, term,
2776 scalar(newUNOP(OP_RV2CV, 0,
2781 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2787 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2789 return newBINOP(OP_LSLICE, flags,
2790 list(force_list(subscript)),
2791 list(force_list(listval)) );
2795 list_assignment(register OP *o)
2800 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2801 o = cUNOPo->op_first;
2803 if (o->op_type == OP_COND_EXPR) {
2804 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2805 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2810 yyerror("Assignment to both a list and a scalar");
2814 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2815 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2816 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2819 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2822 if (o->op_type == OP_RV2SV)
2829 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2834 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2835 return newLOGOP(optype, 0,
2836 mod(scalar(left), optype),
2837 newUNOP(OP_SASSIGN, 0, scalar(right)));
2840 return newBINOP(optype, OPf_STACKED,
2841 mod(scalar(left), optype), scalar(right));
2845 if (list_assignment(left)) {
2848 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2849 left = mod(left, OP_AASSIGN);
2857 o = newBINOP(OP_AASSIGN, flags,
2858 list(force_list(right)),
2859 list(force_list(left)) );
2860 o->op_private = 0 | (flags >> 8);
2861 if (!(left->op_private & OPpLVAL_INTRO)) {
2865 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2866 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2867 if (curop->op_type == OP_GV) {
2868 GV *gv = ((GVOP*)curop)->op_gv;
2869 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2871 SvCUR(gv) = PL_generation;
2873 else if (curop->op_type == OP_PADSV ||
2874 curop->op_type == OP_PADAV ||
2875 curop->op_type == OP_PADHV ||
2876 curop->op_type == OP_PADANY) {
2877 SV **svp = AvARRAY(PL_comppad_name);
2878 SV *sv = svp[curop->op_targ];
2879 if (SvCUR(sv) == PL_generation)
2881 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2883 else if (curop->op_type == OP_RV2CV)
2885 else if (curop->op_type == OP_RV2SV ||
2886 curop->op_type == OP_RV2AV ||
2887 curop->op_type == OP_RV2HV ||
2888 curop->op_type == OP_RV2GV) {
2889 if (lastop->op_type != OP_GV) /* funny deref? */
2892 else if (curop->op_type == OP_PUSHRE) {
2893 if (((PMOP*)curop)->op_pmreplroot) {
2894 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2895 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2897 SvCUR(gv) = PL_generation;
2906 o->op_private = OPpASSIGN_COMMON;
2908 if (right && right->op_type == OP_SPLIT) {
2910 if ((tmpop = ((LISTOP*)right)->op_first) &&
2911 tmpop->op_type == OP_PUSHRE)
2913 PMOP *pm = (PMOP*)tmpop;
2914 if (left->op_type == OP_RV2AV &&
2915 !(left->op_private & OPpLVAL_INTRO) &&
2916 !(o->op_private & OPpASSIGN_COMMON) )
2918 tmpop = ((UNOP*)left)->op_first;
2919 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2920 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2921 pm->op_pmflags |= PMf_ONCE;
2922 tmpop = cUNOPo->op_first; /* to list (nulled) */
2923 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2924 tmpop->op_sibling = Nullop; /* don't free split */
2925 right->op_next = tmpop->op_next; /* fix starting loc */
2926 op_free(o); /* blow off assign */
2927 right->op_flags &= ~OPf_WANT;
2928 /* "I don't know and I don't care." */
2933 if (PL_modcount < 10000 &&
2934 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2936 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2938 sv_setiv(sv, PL_modcount+1);
2946 right = newOP(OP_UNDEF, 0);
2947 if (right->op_type == OP_READLINE) {
2948 right->op_flags |= OPf_STACKED;
2949 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2952 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2953 o = newBINOP(OP_SASSIGN, flags,
2954 scalar(right), mod(scalar(left), OP_SASSIGN) );
2966 newSTATEOP(I32 flags, char *label, OP *o)
2969 U32 seq = intro_my();
2972 Newz(1101, cop, 1, COP);
2973 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2974 cop->op_type = OP_DBSTATE;
2975 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2978 cop->op_type = OP_NEXTSTATE;
2979 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2981 cop->op_flags = flags;
2982 cop->op_private = (PL_hints & HINT_UTF8);
2984 cop->op_private |= NATIVE_HINTS;
2986 PL_compiling.op_private = cop->op_private;
2987 cop->op_next = (OP*)cop;
2990 cop->cop_label = label;
2991 PL_hints |= HINT_BLOCK_SCOPE;
2994 cop->cop_arybase = PL_curcop->cop_arybase;
2995 if (PL_curcop->cop_warnings == WARN_NONE
2996 || PL_curcop->cop_warnings == WARN_ALL)
2997 cop->cop_warnings = PL_curcop->cop_warnings ;
2999 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3002 if (PL_copline == NOLINE)
3003 cop->cop_line = PL_curcop->cop_line;
3005 cop->cop_line = PL_copline;
3006 PL_copline = NOLINE;
3008 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3009 cop->cop_stash = PL_curstash;
3011 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3012 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3013 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3014 (void)SvIOK_on(*svp);
3016 SvSTASH(*svp) = (HV*)cop;
3020 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3023 /* "Introduce" my variables to visible status. */
3031 if (! PL_min_intro_pending)
3032 return PL_cop_seqmax;
3034 svp = AvARRAY(PL_comppad_name);
3035 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3036 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3037 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3038 SvNVX(sv) = (double)PL_cop_seqmax;
3041 PL_min_intro_pending = 0;
3042 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3043 return PL_cop_seqmax++;
3047 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3049 return new_logop(type, flags, &first, &other);
3053 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3058 OP *first = *firstp;
3059 OP *other = *otherp;
3061 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3062 return newBINOP(type, flags, scalar(first), scalar(other));
3064 scalarboolean(first);
3065 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3066 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3067 if (type == OP_AND || type == OP_OR) {
3073 first = *firstp = cUNOPo->op_first;
3075 first->op_next = o->op_next;
3076 cUNOPo->op_first = Nullop;
3080 if (first->op_type == OP_CONST) {
3081 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3082 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3084 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3095 else if (first->op_type == OP_WANTARRAY) {
3101 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3102 OP *k1 = ((UNOP*)first)->op_first;
3103 OP *k2 = k1->op_sibling;
3105 switch (first->op_type)
3108 if (k2 && k2->op_type == OP_READLINE
3109 && (k2->op_flags & OPf_STACKED)
3110 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3111 warnop = k2->op_type;
3115 if (k1->op_type == OP_READDIR
3116 || k1->op_type == OP_GLOB
3117 || k1->op_type == OP_EACH)
3118 warnop = k1->op_type;
3122 line_t oldline = PL_curcop->cop_line;
3123 PL_curcop->cop_line = PL_copline;
3125 "Value of %s%s can be \"0\"; test with defined()",
3127 ((warnop == OP_READLINE || warnop == OP_GLOB)
3128 ? " construct" : "() operator"));
3129 PL_curcop->cop_line = oldline;
3136 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3137 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3139 Newz(1101, logop, 1, LOGOP);
3141 logop->op_type = type;
3142 logop->op_ppaddr = PL_ppaddr[type];
3143 logop->op_first = first;
3144 logop->op_flags = flags | OPf_KIDS;
3145 logop->op_other = LINKLIST(other);
3146 logop->op_private = 1 | (flags >> 8);
3148 /* establish postfix order */
3149 logop->op_next = LINKLIST(first);
3150 first->op_next = (OP*)logop;
3151 first->op_sibling = other;
3153 o = newUNOP(OP_NULL, 0, (OP*)logop);
3160 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3167 return newLOGOP(OP_AND, 0, first, trueop);
3169 return newLOGOP(OP_OR, 0, first, falseop);
3171 scalarboolean(first);
3172 if (first->op_type == OP_CONST) {
3173 if (SvTRUE(((SVOP*)first)->op_sv)) {
3184 else if (first->op_type == OP_WANTARRAY) {
3188 Newz(1101, condop, 1, CONDOP);
3190 condop->op_type = OP_COND_EXPR;
3191 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3192 condop->op_first = first;
3193 condop->op_flags = flags | OPf_KIDS;
3194 condop->op_true = LINKLIST(trueop);
3195 condop->op_false = LINKLIST(falseop);
3196 condop->op_private = 1 | (flags >> 8);
3198 /* establish postfix order */
3199 condop->op_next = LINKLIST(first);
3200 first->op_next = (OP*)condop;
3202 first->op_sibling = trueop;
3203 trueop->op_sibling = falseop;
3204 o = newUNOP(OP_NULL, 0, (OP*)condop);
3206 trueop->op_next = o;
3207 falseop->op_next = o;
3213 newRANGE(I32 flags, OP *left, OP *right)
3221 Newz(1101, condop, 1, CONDOP);
3223 condop->op_type = OP_RANGE;
3224 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3225 condop->op_first = left;
3226 condop->op_flags = OPf_KIDS;
3227 condop->op_true = LINKLIST(left);
3228 condop->op_false = LINKLIST(right);
3229 condop->op_private = 1 | (flags >> 8);
3231 left->op_sibling = right;
3233 condop->op_next = (OP*)condop;
3234 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3235 flop = newUNOP(OP_FLOP, 0, flip);
3236 o = newUNOP(OP_NULL, 0, flop);
3239 left->op_next = flip;
3240 right->op_next = flop;
3242 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3243 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3244 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3245 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3247 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3248 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3251 if (!flip->op_private || !flop->op_private)
3252 linklist(o); /* blow off optimizer unless constant */
3258 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3263 int once = block && block->op_flags & OPf_SPECIAL &&
3264 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3267 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3268 return block; /* do {} while 0 does once */
3269 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3270 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3271 expr = newUNOP(OP_DEFINED, 0,
3272 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3273 } else if (expr->op_flags & OPf_KIDS) {
3274 OP *k1 = ((UNOP*)expr)->op_first;
3275 OP *k2 = (k1) ? k1->op_sibling : NULL;
3276 switch (expr->op_type) {
3278 if (k2 && k2->op_type == OP_READLINE
3279 && (k2->op_flags & OPf_STACKED)
3280 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3281 expr = newUNOP(OP_DEFINED, 0, expr);
3285 if (k1->op_type == OP_READDIR
3286 || k1->op_type == OP_GLOB
3287 || k1->op_type == OP_EACH)
3288 expr = newUNOP(OP_DEFINED, 0, expr);
3294 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3295 o = new_logop(OP_AND, 0, &expr, &listop);
3298 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3300 if (once && o != listop)
3301 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3304 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3306 o->op_flags |= flags;
3308 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3313 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3322 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3323 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3324 expr = newUNOP(OP_DEFINED, 0,
3325 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3326 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3327 OP *k1 = ((UNOP*)expr)->op_first;
3328 OP *k2 = (k1) ? k1->op_sibling : NULL;
3329 switch (expr->op_type) {
3331 if (k2 && k2->op_type == OP_READLINE
3332 && (k2->op_flags & OPf_STACKED)
3333 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3334 expr = newUNOP(OP_DEFINED, 0, expr);
3338 if (k1->op_type == OP_READDIR
3339 || k1->op_type == OP_GLOB
3340 || k1->op_type == OP_EACH)
3341 expr = newUNOP(OP_DEFINED, 0, expr);
3347 block = newOP(OP_NULL, 0);
3350 next = LINKLIST(cont);
3352 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3353 if ((line_t)whileline != NOLINE) {
3354 PL_copline = whileline;
3355 cont = append_elem(OP_LINESEQ, cont,
3356 newSTATEOP(0, Nullch, Nullop));
3360 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3361 redo = LINKLIST(listop);
3364 PL_copline = whileline;
3366 o = new_logop(OP_AND, 0, &expr, &listop);
3367 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3368 op_free(expr); /* oops, it's a while (0) */
3370 return Nullop; /* listop already freed by new_logop */
3373 ((LISTOP*)listop)->op_last->op_next = condop =
3374 (o == listop ? redo : LINKLIST(o));
3382 Newz(1101,loop,1,LOOP);
3383 loop->op_type = OP_ENTERLOOP;
3384 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3385 loop->op_private = 0;
3386 loop->op_next = (OP*)loop;
3389 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3391 loop->op_redoop = redo;
3392 loop->op_lastop = o;
3395 loop->op_nextop = next;
3397 loop->op_nextop = o;
3399 o->op_flags |= flags;
3400 o->op_private |= (flags >> 8);
3405 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3413 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3414 sv->op_type = OP_RV2GV;
3415 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3417 else if (sv->op_type == OP_PADSV) { /* private variable */
3418 padoff = sv->op_targ;
3422 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3423 padoff = sv->op_targ;
3424 iterflags |= OPf_SPECIAL;
3429 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3433 padoff = find_threadsv("_");
3434 iterflags |= OPf_SPECIAL;
3436 sv = newGVOP(OP_GV, 0, PL_defgv);
3439 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3440 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3441 iterflags |= OPf_STACKED;
3443 else if (expr->op_type == OP_NULL &&
3444 (expr->op_flags & OPf_KIDS) &&
3445 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3447 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3448 * set the STACKED flag to indicate that these values are to be
3449 * treated as min/max values by 'pp_iterinit'.
3451 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3452 CONDOP* range = (CONDOP*) flip->op_first;
3453 OP* left = range->op_first;
3454 OP* right = left->op_sibling;
3457 range->op_flags &= ~OPf_KIDS;
3458 range->op_first = Nullop;
3460 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3461 listop->op_first->op_next = range->op_true;
3462 left->op_next = range->op_false;
3463 right->op_next = (OP*)listop;
3464 listop->op_next = listop->op_first;
3467 expr = (OP*)(listop);
3469 iterflags |= OPf_STACKED;
3472 expr = mod(force_list(expr), OP_GREPSTART);
3476 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3477 append_elem(OP_LIST, expr, scalar(sv))));
3478 assert(!loop->op_next);
3479 Renew(loop, 1, LOOP);
3480 loop->op_targ = padoff;
3481 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3482 PL_copline = forline;
3483 return newSTATEOP(0, label, wop);
3487 newLOOPEX(I32 type, OP *label)
3493 if (type != OP_GOTO || label->op_type == OP_CONST) {
3494 /* "last()" means "last" */
3495 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3496 o = newOP(type, OPf_SPECIAL);
3498 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3499 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3505 if (label->op_type == OP_ENTERSUB)
3506 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3507 o = newUNOP(type, OPf_STACKED, label);
3509 PL_hints |= HINT_BLOCK_SCOPE;
3519 MUTEX_DESTROY(CvMUTEXP(cv));
3520 Safefree(CvMUTEXP(cv));
3523 #endif /* USE_THREADS */
3525 if (!CvXSUB(cv) && CvROOT(cv)) {
3527 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3528 croak("Can't undef active subroutine");
3531 croak("Can't undef active subroutine");
3532 #endif /* USE_THREADS */
3535 SAVESPTR(PL_curpad);
3539 op_free(CvROOT(cv));
3540 CvROOT(cv) = Nullop;
3543 SvPOK_off((SV*)cv); /* forget prototype */
3545 SvREFCNT_dec(CvGV(cv));
3547 SvREFCNT_dec(CvOUTSIDE(cv));
3548 CvOUTSIDE(cv) = Nullcv;
3549 if (CvPADLIST(cv)) {
3550 /* may be during global destruction */
3551 if (SvREFCNT(CvPADLIST(cv))) {
3552 I32 i = AvFILLp(CvPADLIST(cv));
3554 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3555 SV* sv = svp ? *svp : Nullsv;
3558 if (sv == (SV*)PL_comppad_name)
3559 PL_comppad_name = Nullav;
3560 else if (sv == (SV*)PL_comppad) {
3561 PL_comppad = Nullav;
3562 PL_curpad = Null(SV**);
3566 SvREFCNT_dec((SV*)CvPADLIST(cv));
3568 CvPADLIST(cv) = Nullav;
3572 #ifdef DEBUG_CLOSURES
3577 CV *outside = CvOUTSIDE(cv);
3578 AV* padlist = CvPADLIST(cv);
3585 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3587 (CvANON(cv) ? "ANON"
3588 : (cv == PL_main_cv) ? "MAIN"
3589 : CvUNIQUE(cv) ? "UNIQUE"
3590 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3593 : CvANON(outside) ? "ANON"
3594 : (outside == PL_main_cv) ? "MAIN"
3595 : CvUNIQUE(outside) ? "UNIQUE"
3596 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3601 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3602 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3603 pname = AvARRAY(pad_name);
3604 ppad = AvARRAY(pad);
3606 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3607 if (SvPOK(pname[ix]))
3608 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3610 SvFAKE(pname[ix]) ? "FAKE " : "",
3612 (long)I_32(SvNVX(pname[ix])),
3613 (long)SvIVX(pname[ix]));
3616 #endif /* DEBUG_CLOSURES */
3619 cv_clone2(CV *proto, CV *outside)
3624 AV* protopadlist = CvPADLIST(proto);
3625 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3626 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3627 SV** pname = AvARRAY(protopad_name);
3628 SV** ppad = AvARRAY(protopad);
3629 I32 fname = AvFILLp(protopad_name);
3630 I32 fpad = AvFILLp(protopad);
3634 assert(!CvUNIQUE(proto));
3637 SAVESPTR(PL_curpad);
3638 SAVESPTR(PL_comppad);
3639 SAVESPTR(PL_comppad_name);
3640 SAVESPTR(PL_compcv);
3642 cv = PL_compcv = (CV*)NEWSV(1104,0);
3643 sv_upgrade((SV *)cv, SvTYPE(proto));
3649 New(666, CvMUTEXP(cv), 1, perl_mutex);
3650 MUTEX_INIT(CvMUTEXP(cv));
3652 #endif /* USE_THREADS */
3653 CvFILEGV(cv) = CvFILEGV(proto);
3654 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3655 CvSTASH(cv) = CvSTASH(proto);
3656 CvROOT(cv) = CvROOT(proto);
3657 CvSTART(cv) = CvSTART(proto);
3659 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3662 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3664 PL_comppad_name = newAV();
3665 for (ix = fname; ix >= 0; ix--)
3666 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3668 PL_comppad = newAV();
3670 comppadlist = newAV();
3671 AvREAL_off(comppadlist);
3672 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3673 av_store(comppadlist, 1, (SV*)PL_comppad);
3674 CvPADLIST(cv) = comppadlist;
3675 av_fill(PL_comppad, AvFILLp(protopad));
3676 PL_curpad = AvARRAY(PL_comppad);
3678 av = newAV(); /* will be @_ */
3680 av_store(PL_comppad, 0, (SV*)av);
3681 AvFLAGS(av) = AVf_REIFY;
3683 for (ix = fpad; ix > 0; ix--) {
3684 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3685 if (namesv && namesv != &PL_sv_undef) {
3686 char *name = SvPVX(namesv); /* XXX */
3687 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3688 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3689 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3691 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3693 croak("panic: cv_clone: %s", name);
3695 else { /* our own lexical */
3698 /* anon code -- we'll come back for it */
3699 sv = SvREFCNT_inc(ppad[ix]);
3701 else if (*name == '@')
3703 else if (*name == '%')
3713 SV* sv = NEWSV(0,0);
3719 /* Now that vars are all in place, clone nested closures. */
3721 for (ix = fpad; ix > 0; ix--) {
3722 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3724 && namesv != &PL_sv_undef
3725 && !(SvFLAGS(namesv) & SVf_FAKE)
3726 && *SvPVX(namesv) == '&'
3727 && CvCLONE(ppad[ix]))
3729 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3730 SvREFCNT_dec(ppad[ix]);
3733 PL_curpad[ix] = (SV*)kid;
3737 #ifdef DEBUG_CLOSURES
3738 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3740 PerlIO_printf(Perl_debug_log, " from:\n");
3742 PerlIO_printf(Perl_debug_log, " to:\n");
3754 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3755 cv = cv_clone2(proto, CvOUTSIDE(proto));
3756 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3761 cv_ckproto(CV *cv, GV *gv, char *p)
3763 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3764 SV* msg = sv_newmortal();
3768 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3769 sv_setpv(msg, "Prototype mismatch:");
3771 sv_catpvf(msg, " sub %_", name);
3773 sv_catpvf(msg, " (%s)", SvPVX(cv));
3774 sv_catpv(msg, " vs ");
3776 sv_catpvf(msg, "(%s)", p);
3778 sv_catpv(msg, "none");
3786 if (!cv || !SvPOK(cv) || SvCUR(cv))
3788 return op_const_sv(CvSTART(cv), cv);
3792 op_const_sv(OP *o, CV *cv)
3799 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3800 o = cLISTOPo->op_first->op_sibling;
3802 for (; o; o = o->op_next) {
3803 OPCODE type = o->op_type;
3805 if(sv && o->op_next == o)
3807 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3809 if (type == OP_LEAVESUB || type == OP_RETURN)
3813 if (type == OP_CONST)
3815 else if (type == OP_PADSV && cv) {
3816 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3817 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3818 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3830 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3834 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3835 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3836 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3837 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3846 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3847 maximum a prototype before. */
3848 if (SvTYPE(gv) > SVt_NULL) {
3849 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3850 warn("Runaway prototype");
3851 cv_ckproto((CV*)gv, NULL, ps);
3854 sv_setpv((SV*)gv, ps);
3856 sv_setiv((SV*)gv, -1);
3857 SvREFCNT_dec(PL_compcv);
3858 cv = PL_compcv = NULL;
3859 PL_sub_generation++;
3863 if (!name || GvCVGEN(gv))
3865 else if (cv = GvCV(gv)) {
3866 cv_ckproto(cv, gv, ps);
3867 /* already defined (or promised)? */
3868 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3870 bool const_changed = TRUE;
3872 /* just a "sub foo;" when &foo is already defined */
3873 SAVEFREESV(PL_compcv);
3876 /* ahem, death to those who redefine active sort subs */
3877 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3878 croak("Can't redefine active sort subroutine %s", name);
3879 if(const_sv = cv_const_sv(cv))
3880 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3881 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3882 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3883 && HvNAME(GvSTASH(CvGV(cv)))
3884 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3886 line_t oldline = PL_curcop->cop_line;
3887 PL_curcop->cop_line = PL_copline;
3888 warner(WARN_REDEFINE,
3889 const_sv ? "Constant subroutine %s redefined"
3890 : "Subroutine %s redefined", name);
3891 PL_curcop->cop_line = oldline;
3897 if (cv) { /* must reuse cv if autoloaded */
3899 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3900 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3901 CvOUTSIDE(PL_compcv) = 0;
3902 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3903 CvPADLIST(PL_compcv) = 0;
3904 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3905 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3906 SvREFCNT_dec(PL_compcv);
3913 PL_sub_generation++;
3916 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3917 CvFILEGV(cv) = PL_curcop->cop_filegv;
3918 CvSTASH(cv) = PL_curstash;
3921 if (!CvMUTEXP(cv)) {
3922 New(666, CvMUTEXP(cv), 1, perl_mutex);
3923 MUTEX_INIT(CvMUTEXP(cv));
3925 #endif /* USE_THREADS */
3928 sv_setpv((SV*)cv, ps);
3930 if (PL_error_count) {
3934 char *s = strrchr(name, ':');
3936 if (strEQ(s, "BEGIN")) {
3938 "BEGIN not safe after errors--compilation aborted";
3942 /* force display of errors found but not reported */
3943 sv_catpv(ERRSV, not_safe);
3944 croak("%s", SvPVx(ERRSV, n_a));
3951 PL_copline = NOLINE;
3956 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3957 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3960 SV **namep = AvARRAY(PL_comppad_name);
3961 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3964 if (SvIMMORTAL(PL_curpad[ix]))
3967 * The only things that a clonable function needs in its
3968 * pad are references to outer lexicals and anonymous subs.
3969 * The rest are created anew during cloning.
3971 if (!((namesv = namep[ix]) != Nullsv &&
3972 namesv != &PL_sv_undef &&
3974 *SvPVX(namesv) == '&')))
3976 SvREFCNT_dec(PL_curpad[ix]);
3977 PL_curpad[ix] = Nullsv;
3982 AV *av = newAV(); /* Will be @_ */
3984 av_store(PL_comppad, 0, (SV*)av);
3985 AvFLAGS(av) = AVf_REIFY;
3987 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3988 if (SvIMMORTAL(PL_curpad[ix]))
3990 if (!SvPADMY(PL_curpad[ix]))
3991 SvPADTMP_on(PL_curpad[ix]);
3995 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3996 CvSTART(cv) = LINKLIST(CvROOT(cv));
3997 CvROOT(cv)->op_next = 0;
4003 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4004 SV *sv = NEWSV(0,0);
4005 SV *tmpstr = sv_newmortal();
4006 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4010 sv_setpvf(sv, "%_:%ld-%ld",
4011 GvSV(PL_curcop->cop_filegv),
4012 (long)PL_subline, (long)PL_curcop->cop_line);
4013 gv_efullname3(tmpstr, gv, Nullch);
4014 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4015 hv = GvHVn(db_postponed);
4016 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4017 && (cv = GvCV(db_postponed))) {
4022 perl_call_sv((SV*)cv, G_DISCARD);
4026 if ((s = strrchr(name,':')))
4030 if (strEQ(s, "BEGIN")) {
4031 I32 oldscope = PL_scopestack_ix;
4033 SAVESPTR(PL_compiling.cop_filegv);
4034 SAVEI16(PL_compiling.cop_line);
4036 sv_setsv(PL_rs, PL_nrs);
4039 PL_beginav = newAV();
4040 DEBUG_x( dump_sub(gv) );
4041 av_push(PL_beginav, (SV *)cv);
4043 call_list(oldscope, PL_beginav);
4045 PL_curcop = &PL_compiling;
4046 PL_compiling.op_private = PL_hints;
4049 else if (strEQ(s, "END") && !PL_error_count) {
4052 av_unshift(PL_endav, 1);
4053 av_store(PL_endav, 0, (SV *)cv);
4056 else if (strEQ(s, "INIT") && !PL_error_count) {
4058 PL_initav = newAV();
4059 av_push(PL_initav, SvREFCNT_inc(cv));
4065 PL_copline = NOLINE;
4070 /* XXX unsafe for threads if eval_owner isn't held */
4072 newCONSTSUB(HV *stash, char *name, SV *sv)
4075 U32 oldhints = PL_hints;
4076 HV *old_cop_stash = PL_curcop->cop_stash;
4077 HV *old_curstash = PL_curstash;
4078 line_t oldline = PL_curcop->cop_line;
4079 PL_curcop->cop_line = PL_copline;
4081 PL_hints &= ~HINT_BLOCK_SCOPE;
4083 PL_curstash = PL_curcop->cop_stash = stash;
4086 start_subparse(FALSE, 0),
4087 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4088 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4089 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4092 PL_hints = oldhints;
4093 PL_curcop->cop_stash = old_cop_stash;
4094 PL_curstash = old_curstash;
4095 PL_curcop->cop_line = oldline;
4099 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4102 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4105 if (cv = (name ? GvCV(gv) : Nullcv)) {
4107 /* just a cached method */
4111 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4112 /* already defined (or promised) */
4113 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4114 && HvNAME(GvSTASH(CvGV(cv)))
4115 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4116 line_t oldline = PL_curcop->cop_line;
4117 if (PL_copline != NOLINE)
4118 PL_curcop->cop_line = PL_copline;
4119 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4120 PL_curcop->cop_line = oldline;
4127 if (cv) /* must reuse cv if autoloaded */
4130 cv = (CV*)NEWSV(1105,0);
4131 sv_upgrade((SV *)cv, SVt_PVCV);
4135 PL_sub_generation++;
4138 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4140 New(666, CvMUTEXP(cv), 1, perl_mutex);
4141 MUTEX_INIT(CvMUTEXP(cv));
4143 #endif /* USE_THREADS */
4144 CvFILEGV(cv) = gv_fetchfile(filename);
4145 CvXSUB(cv) = subaddr;
4148 char *s = strrchr(name,':');
4153 if (strEQ(s, "BEGIN")) {
4155 PL_beginav = newAV();
4156 av_push(PL_beginav, (SV *)cv);
4159 else if (strEQ(s, "END")) {
4162 av_unshift(PL_endav, 1);
4163 av_store(PL_endav, 0, (SV *)cv);
4166 else if (strEQ(s, "INIT")) {
4168 PL_initav = newAV();
4169 av_push(PL_initav, (SV *)cv);
4180 newFORM(I32 floor, OP *o, OP *block)
4190 name = SvPVx(cSVOPo->op_sv, n_a);
4193 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4195 if (cv = GvFORM(gv)) {
4196 if (ckWARN(WARN_REDEFINE)) {
4197 line_t oldline = PL_curcop->cop_line;
4199 PL_curcop->cop_line = PL_copline;
4200 warner(WARN_REDEFINE, "Format %s redefined",name);
4201 PL_curcop->cop_line = oldline;
4207 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4208 CvFILEGV(cv) = PL_curcop->cop_filegv;
4210 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4211 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4212 SvPADTMP_on(PL_curpad[ix]);
4215 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4216 CvSTART(cv) = LINKLIST(CvROOT(cv));
4217 CvROOT(cv)->op_next = 0;
4220 PL_copline = NOLINE;
4227 return newUNOP(OP_REFGEN, 0,
4228 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4234 return newUNOP(OP_REFGEN, 0,
4235 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4239 newANONSUB(I32 floor, OP *proto, OP *block)
4241 return newUNOP(OP_REFGEN, 0,
4242 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4248 switch (o->op_type) {
4250 o->op_type = OP_PADAV;
4251 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4252 return ref(o, OP_RV2AV);
4255 o->op_type = OP_RV2AV;
4256 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4261 warn("oops: oopsAV");
4270 switch (o->op_type) {
4273 o->op_type = OP_PADHV;
4274 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4275 return ref(o, OP_RV2HV);
4279 o->op_type = OP_RV2HV;
4280 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4285 warn("oops: oopsHV");
4294 if (o->op_type == OP_PADANY) {
4295 o->op_type = OP_PADAV;
4296 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4299 return newUNOP(OP_RV2AV, 0, scalar(o));
4303 newGVREF(I32 type, OP *o)
4305 if (type == OP_MAPSTART)
4306 return newUNOP(OP_NULL, 0, o);
4307 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4313 if (o->op_type == OP_PADANY) {
4314 o->op_type = OP_PADHV;
4315 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4318 return newUNOP(OP_RV2HV, 0, scalar(o));
4324 croak("NOT IMPL LINE %d",__LINE__);
4330 newCVREF(I32 flags, OP *o)
4332 return newUNOP(OP_RV2CV, flags, scalar(o));
4338 if (o->op_type == OP_PADANY) {
4339 o->op_type = OP_PADSV;
4340 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4343 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4344 o->op_flags |= OPpDONE_SVREF;
4347 return newUNOP(OP_RV2SV, 0, scalar(o));
4350 /* Check routines. */
4358 name = NEWSV(1106,0);
4359 sv_upgrade(name, SVt_PVNV);
4360 sv_setpvn(name, "&", 1);
4363 ix = pad_alloc(o->op_type, SVs_PADMY);
4364 av_store(PL_comppad_name, ix, name);
4365 av_store(PL_comppad, ix, cSVOPo->op_sv);
4366 SvPADMY_on(cSVOPo->op_sv);
4367 cSVOPo->op_sv = Nullsv;
4368 cSVOPo->op_targ = ix;
4375 o->op_private = PL_hints;
4382 if (cUNOPo->op_first->op_type == OP_CONCAT)
4383 o->op_flags |= OPf_STACKED;
4390 if (o->op_flags & OPf_KIDS) {
4393 OPCODE type = o->op_type;
4394 o = modkids(ck_fun(o), type);
4395 kid = cUNOPo->op_first;
4396 newop = kUNOP->op_first->op_sibling;
4398 (newop->op_sibling ||
4399 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4400 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4401 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4405 op_free(kUNOP->op_first);
4406 kUNOP->op_first = newop;
4408 o->op_ppaddr = PL_ppaddr[++o->op_type];
4417 if (o->op_flags & OPf_KIDS) {
4418 OP *kid = cUNOPo->op_first;
4419 if (kid->op_type == OP_HSLICE)
4420 o->op_private |= OPpSLICE;
4421 else if (kid->op_type != OP_HELEM)
4422 croak("%s argument is not a HASH element or slice",
4423 PL_op_desc[o->op_type]);
4432 I32 type = o->op_type;
4434 if (o->op_flags & OPf_KIDS) {
4435 if (cLISTOPo->op_first->op_type == OP_STUB) {
4437 o = newUNOP(type, OPf_SPECIAL,
4438 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4448 PL_hints |= HINT_BLOCK_SCOPE;
4449 if (o->op_flags & OPf_KIDS) {
4450 SVOP *kid = (SVOP*)cUNOPo->op_first;
4453 o->op_flags &= ~OPf_KIDS;
4456 else if (kid->op_type == OP_LINESEQ) {
4459 kid->op_next = o->op_next;
4460 cUNOPo->op_first = 0;
4463 Newz(1101, enter, 1, LOGOP);
4464 enter->op_type = OP_ENTERTRY;
4465 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4466 enter->op_private = 0;
4468 /* establish postfix order */
4469 enter->op_next = (OP*)enter;
4471 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4472 o->op_type = OP_LEAVETRY;
4473 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4474 enter->op_other = o;
4482 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4484 o->op_targ = (PADOFFSET)PL_hints;
4492 if (o->op_flags & OPf_STACKED) {
4494 kid = cUNOPo->op_first->op_sibling;
4495 if (kid->op_type == OP_RV2GV)
4507 if (o->op_flags & OPf_KIDS) {
4508 OP *kid = cUNOPo->op_first;
4509 if (kid->op_type != OP_HELEM)
4510 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4518 ck_gvconst(register OP *o)
4520 o = fold_constants(o);
4521 if (o->op_type == OP_CONST)
4528 ck_rvconst(register OP *o)
4531 SVOP *kid = (SVOP*)cUNOPo->op_first;
4533 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4534 if (kid->op_type == OP_CONST) {
4538 SV *kidsv = kid->op_sv;
4541 /* Is it a constant from cv_const_sv()? */
4542 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4543 SV *rsv = SvRV(kidsv);
4544 int svtype = SvTYPE(rsv);
4545 char *badtype = Nullch;
4547 switch (o->op_type) {
4549 if (svtype > SVt_PVMG)
4550 badtype = "a SCALAR";
4553 if (svtype != SVt_PVAV)
4554 badtype = "an ARRAY";
4557 if (svtype != SVt_PVHV) {
4558 if (svtype == SVt_PVAV) { /* pseudohash? */
4559 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4560 if (ksv && SvROK(*ksv)
4561 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4570 if (svtype != SVt_PVCV)
4575 croak("Constant is not %s reference", badtype);
4578 name = SvPV(kidsv, n_a);
4579 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4580 char *badthing = Nullch;
4581 switch (o->op_type) {
4583 badthing = "a SCALAR";
4586 badthing = "an ARRAY";
4589 badthing = "a HASH";
4594 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4598 * This is a little tricky. We only want to add the symbol if we
4599 * didn't add it in the lexer. Otherwise we get duplicate strict
4600 * warnings. But if we didn't add it in the lexer, we must at
4601 * least pretend like we wanted to add it even if it existed before,
4602 * or we get possible typo warnings. OPpCONST_ENTERED says
4603 * whether the lexer already added THIS instance of this symbol.
4605 iscv = (o->op_type == OP_RV2CV) * 2;
4607 gv = gv_fetchpv(name,
4608 iscv | !(kid->op_private & OPpCONST_ENTERED),
4611 : o->op_type == OP_RV2SV
4613 : o->op_type == OP_RV2AV
4615 : o->op_type == OP_RV2HV
4618 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4620 kid->op_type = OP_GV;
4621 SvREFCNT_dec(kid->op_sv);
4622 kid->op_sv = SvREFCNT_inc(gv);
4632 I32 type = o->op_type;
4634 if (o->op_flags & OPf_REF)
4637 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4638 SVOP *kid = (SVOP*)cUNOPo->op_first;
4640 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4642 OP *newop = newGVOP(type, OPf_REF,
4643 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4650 if (type == OP_FTTTY)
4651 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4654 return newUNOP(type, 0, newDEFSVOP());
4667 int type = o->op_type;
4668 register I32 oa = PL_opargs[type] >> OASHIFT;
4670 if (o->op_flags & OPf_STACKED) {
4671 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4674 return no_fh_allowed(o);
4677 if (o->op_flags & OPf_KIDS) {
4679 tokid = &cLISTOPo->op_first;
4680 kid = cLISTOPo->op_first;
4681 if (kid->op_type == OP_PUSHMARK ||
4682 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4684 tokid = &kid->op_sibling;
4685 kid = kid->op_sibling;
4687 if (!kid && PL_opargs[type] & OA_DEFGV)
4688 *tokid = kid = newDEFSVOP();
4692 sibl = kid->op_sibling;
4695 /* list seen where single (scalar) arg expected? */
4696 if (numargs == 1 && !(oa >> 4)
4697 && kid->op_type == OP_LIST && type != OP_SCALAR)
4699 return too_many_arguments(o,PL_op_desc[type]);
4712 if (kid->op_type == OP_CONST &&
4713 (kid->op_private & OPpCONST_BARE))
4715 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4716 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4717 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4718 if (ckWARN(WARN_SYNTAX))
4720 "Array @%s missing the @ in argument %ld of %s()",
4721 name, (long)numargs, PL_op_desc[type]);
4724 kid->op_sibling = sibl;
4727 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4728 bad_type(numargs, "array", PL_op_desc[type], kid);
4732 if (kid->op_type == OP_CONST &&
4733 (kid->op_private & OPpCONST_BARE))
4735 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4736 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4737 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4738 if (ckWARN(WARN_SYNTAX))
4740 "Hash %%%s missing the %% in argument %ld of %s()",
4741 name, (long)numargs, PL_op_desc[type]);
4744 kid->op_sibling = sibl;
4747 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4748 bad_type(numargs, "hash", PL_op_desc[type], kid);
4753 OP *newop = newUNOP(OP_NULL, 0, kid);
4754 kid->op_sibling = 0;
4756 newop->op_next = newop;
4758 kid->op_sibling = sibl;
4763 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4764 if (kid->op_type == OP_CONST &&
4765 (kid->op_private & OPpCONST_BARE))
4767 OP *newop = newGVOP(OP_GV, 0,
4768 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4773 else if (kid->op_type == OP_READLINE) {
4774 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4775 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4778 I32 flags = OPf_SPECIAL;
4779 /* is this op a FH constructor? */
4780 if (is_handle_constructor(o,numargs))
4782 kid->op_sibling = 0;
4783 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4785 kid->op_sibling = sibl;
4791 mod(scalar(kid), type);
4795 tokid = &kid->op_sibling;
4796 kid = kid->op_sibling;
4798 o->op_private |= numargs;
4800 return too_many_arguments(o,PL_op_desc[o->op_type]);
4803 else if (PL_opargs[type] & OA_DEFGV) {
4805 return newUNOP(type, 0, newDEFSVOP());
4809 while (oa & OA_OPTIONAL)
4811 if (oa && oa != OA_LIST)
4812 return too_few_arguments(o,PL_op_desc[o->op_type]);
4822 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4823 append_elem(OP_GLOB, o, newDEFSVOP());
4825 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4826 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4828 if (gv && GvIMPORTED_CV(gv)) {
4829 append_elem(OP_GLOB, o,
4830 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4831 o->op_type = OP_LIST;
4832 o->op_ppaddr = PL_ppaddr[OP_LIST];
4833 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4834 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4835 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4836 append_elem(OP_LIST, o,
4837 scalar(newUNOP(OP_RV2CV, 0,
4838 newGVOP(OP_GV, 0, gv)))));
4839 o = newUNOP(OP_NULL, 0, ck_subr(o));
4840 o->op_targ = OP_GLOB; /* hint at what it used to be */
4843 gv = newGVgen("main");
4845 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4855 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4857 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4858 Newz(1101, gwop, 1, LOGOP);
4860 if (o->op_flags & OPf_STACKED) {
4863 kid = cLISTOPo->op_first->op_sibling;
4864 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4867 kid->op_next = (OP*)gwop;
4868 o->op_flags &= ~OPf_STACKED;
4870 kid = cLISTOPo->op_first->op_sibling;
4871 if (type == OP_MAPWHILE)
4878 kid = cLISTOPo->op_first->op_sibling;
4879 if (kid->op_type != OP_NULL)
4880 croak("panic: ck_grep");
4881 kid = kUNOP->op_first;
4883 gwop->op_type = type;
4884 gwop->op_ppaddr = PL_ppaddr[type];
4885 gwop->op_first = listkids(o);
4886 gwop->op_flags |= OPf_KIDS;
4887 gwop->op_private = 1;
4888 gwop->op_other = LINKLIST(kid);
4889 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4890 kid->op_next = (OP*)gwop;
4892 kid = cLISTOPo->op_first->op_sibling;
4893 if (!kid || !kid->op_sibling)
4894 return too_few_arguments(o,PL_op_desc[o->op_type]);
4895 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4896 mod(kid, OP_GREPSTART);
4904 if (o->op_flags & OPf_KIDS) {
4905 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4907 kid = kid->op_sibling; /* get past "big" */
4908 if (kid && kid->op_type == OP_CONST)
4909 fbm_compile(((SVOP*)kid)->op_sv, 0);
4915 ck_lengthconst(OP *o)
4917 /* XXX length optimization goes here */
4924 OPCODE type = o->op_type;
4925 return modkids(ck_fun(o), type);
4931 OPCODE type = o->op_type;
4932 return refkids(ck_fun(o), type);
4940 kid = cLISTOPo->op_first;
4943 kid = cLISTOPo->op_first;
4945 if (kid->op_type == OP_PUSHMARK)
4946 kid = kid->op_sibling;
4947 if (kid && o->op_flags & OPf_STACKED)
4948 kid = kid->op_sibling;
4949 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4950 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4951 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4952 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4953 cLISTOPo->op_first->op_sibling = kid;
4954 cLISTOPo->op_last = kid;
4955 kid = kid->op_sibling;
4960 append_elem(o->op_type, o, newDEFSVOP());
4966 if (PL_hints & HINT_LOCALE)
4967 o->op_private |= OPpLOCALE;
4974 ck_fun_locale(OP *o)
4980 if (PL_hints & HINT_LOCALE)
4981 o->op_private |= OPpLOCALE;
4992 if (PL_hints & HINT_LOCALE)
4993 o->op_private |= OPpLOCALE;
5002 o->op_private |= OPpRUNTIME;
5015 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5016 o->op_private |= OPpREPEAT_DOLIST;
5017 cBINOPo->op_first = force_list(cBINOPo->op_first);
5027 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5028 SVOP *kid = (SVOP*)cUNOPo->op_first;
5030 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5032 for (s = SvPVX(kid->op_sv); *s; s++) {
5033 if (*s == ':' && s[1] == ':') {
5035 Move(s+2, s+1, strlen(s+2)+1, char);
5036 --SvCUR(kid->op_sv);
5039 sv_catpvn(kid->op_sv, ".pm", 3);
5049 croak("NOT IMPL LINE %d",__LINE__);
5059 if (o->op_flags & OPf_KIDS) {
5060 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5061 if (kid && kid->op_sibling) {
5062 o->op_type = OP_SSELECT;
5063 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5065 return fold_constants(o);
5069 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5070 if (kid && kid->op_type == OP_RV2GV)
5071 kid->op_private &= ~HINT_STRICT_REFS;
5078 I32 type = o->op_type;
5080 if (!(o->op_flags & OPf_KIDS)) {
5085 if (!CvUNIQUE(PL_compcv)) {
5086 argop = newOP(OP_PADAV, OPf_REF);
5087 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5090 argop = newUNOP(OP_RV2AV, 0,
5091 scalar(newGVOP(OP_GV, 0,
5092 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5095 argop = newUNOP(OP_RV2AV, 0,
5096 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5097 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5098 #endif /* USE_THREADS */
5099 return newUNOP(type, 0, scalar(argop));
5101 return scalar(modkids(ck_fun(o), type));
5109 if (PL_hints & HINT_LOCALE)
5110 o->op_private |= OPpLOCALE;
5113 if (o->op_flags & OPf_STACKED)
5115 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5116 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5118 kid = kUNOP->op_first; /* get past rv2gv */
5120 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5122 if (kid->op_type == OP_SCOPE) {
5126 else if (kid->op_type == OP_LEAVE) {
5127 if (o->op_type == OP_SORT) {
5128 null(kid); /* wipe out leave */
5131 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5132 if (k->op_next == kid)
5137 kid->op_next = 0; /* just disconnect the leave */
5138 k = kLISTOP->op_first;
5142 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5143 null(kid); /* wipe out rv2gv */
5144 if (o->op_type == OP_SORT)
5148 o->op_flags |= OPf_SPECIAL;
5150 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5151 null(cLISTOPo->op_first->op_sibling);
5158 simplify_sort(OP *o)
5161 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5164 if (!(o->op_flags & OPf_STACKED))
5166 kid = kUNOP->op_first; /* get past rv2gv */
5167 if (kid->op_type != OP_SCOPE)
5169 kid = kLISTOP->op_last; /* get past scope */
5170 switch(kid->op_type) {
5178 k = kid; /* remember this node*/
5179 if (kBINOP->op_first->op_type != OP_RV2SV)
5181 kid = kBINOP->op_first; /* get past cmp */
5182 if (kUNOP->op_first->op_type != OP_GV)
5184 kid = kUNOP->op_first; /* get past rv2sv */
5185 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5187 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5189 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5193 kid = k; /* back to cmp */
5194 if (kBINOP->op_last->op_type != OP_RV2SV)
5196 kid = kBINOP->op_last; /* down to 2nd arg */
5197 if (kUNOP->op_first->op_type != OP_GV)
5199 kid = kUNOP->op_first; /* get past rv2sv */
5200 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5202 ? strNE(GvNAME(kGVOP->op_gv), "a")
5203 : strNE(GvNAME(kGVOP->op_gv), "b")))
5205 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5207 o->op_private |= OPpSORT_REVERSE;
5208 if (k->op_type == OP_NCMP)
5209 o->op_private |= OPpSORT_NUMERIC;
5210 if (k->op_type == OP_I_NCMP)
5211 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5212 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5213 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5214 cLISTOPo->op_children = 1;
5222 if (o->op_flags & OPf_STACKED)
5223 return no_fh_allowed(o);
5225 kid = cLISTOPo->op_first;
5226 if (kid->op_type != OP_NULL)
5227 croak("panic: ck_split");
5228 kid = kid->op_sibling;
5229 op_free(cLISTOPo->op_first);
5230 cLISTOPo->op_first = kid;
5232 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5233 cLISTOPo->op_last = kid; /* There was only one element previously */
5236 if (kid->op_type != OP_MATCH) {
5237 OP *sibl = kid->op_sibling;
5238 kid->op_sibling = 0;
5239 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5240 if (cLISTOPo->op_first == cLISTOPo->op_last)
5241 cLISTOPo->op_last = kid;
5242 cLISTOPo->op_first = kid;
5243 kid->op_sibling = sibl;
5246 kid->op_type = OP_PUSHRE;
5247 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5250 if (!kid->op_sibling)
5251 append_elem(OP_SPLIT, o, newDEFSVOP());
5253 kid = kid->op_sibling;
5256 if (!kid->op_sibling)
5257 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5259 kid = kid->op_sibling;
5262 if (kid->op_sibling)
5263 return too_many_arguments(o,PL_op_desc[o->op_type]);
5272 OP *prev = ((cUNOPo->op_first->op_sibling)
5273 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5274 OP *o2 = prev->op_sibling;
5283 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5284 if (cvop->op_type == OP_RV2CV) {
5286 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5287 null(cvop); /* disable rv2cv */
5288 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5289 if (tmpop->op_type == OP_GV) {
5290 cv = GvCVu(tmpop->op_sv);
5291 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5292 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5293 proto = SvPV((SV*)cv, n_a);
5297 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5298 if (PERLDB_SUB && PL_curstash != PL_debstash)
5299 o->op_private |= OPpENTERSUB_DB;
5300 while (o2 != cvop) {
5304 return too_many_arguments(o, gv_ename(namegv));
5322 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5323 bad_type(arg, "block", gv_ename(namegv), o2);
5326 /* '*' allows any scalar type, including bareword */
5329 if (o2->op_type == OP_RV2GV)
5330 goto wrapref; /* autoconvert GLOB -> GLOBref */
5338 if (o2->op_type != OP_RV2GV)
5339 bad_type(arg, "symbol", gv_ename(namegv), o2);
5342 if (o2->op_type != OP_RV2CV)
5343 bad_type(arg, "sub", gv_ename(namegv), o2);
5346 if (o2->op_type != OP_RV2SV
5347 && o2->op_type != OP_PADSV
5348 && o2->op_type != OP_THREADSV)
5350 bad_type(arg, "scalar", gv_ename(namegv), o2);
5354 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5355 bad_type(arg, "array", gv_ename(namegv), o2);
5358 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5359 bad_type(arg, "hash", gv_ename(namegv), o2);
5363 OP* sib = kid->op_sibling;
5364 kid->op_sibling = 0;
5365 o2 = newUNOP(OP_REFGEN, 0, kid);
5366 o2->op_sibling = sib;
5367 prev->op_sibling = o2;
5378 croak("Malformed prototype for %s: %s",
5379 gv_ename(namegv), SvPV((SV*)cv, n_a));
5384 mod(o2, OP_ENTERSUB);
5386 o2 = o2->op_sibling;
5388 if (proto && !optional &&
5389 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5390 return too_few_arguments(o, gv_ename(namegv));
5397 SvREADONLY_on(cSVOPo->op_sv);
5404 if (o->op_flags & OPf_KIDS) {
5405 SVOP *kid = (SVOP*)cUNOPo->op_first;
5407 if (kid->op_type == OP_NULL)
5408 kid = (SVOP*)kid->op_sibling;
5410 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5411 o->op_flags |= OPf_SPECIAL;
5416 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5419 peep(register OP *o)
5422 register OP* oldop = 0;
5425 if (!o || o->op_seq)
5429 SAVESPTR(PL_curcop);
5430 for (; o; o = o->op_next) {
5436 switch (o->op_type) {
5439 PL_curcop = ((COP*)o); /* for warnings */
5440 o->op_seq = PL_op_seqmax++;
5451 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5453 o->op_seq = PL_op_seqmax++;
5456 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5457 o->op_seq = PL_op_seqmax++;
5458 break; /* Scalar stub must produce undef. List stub is noop */
5462 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5463 PL_curcop = ((COP*)o);
5469 if (oldop && o->op_next) {
5470 oldop->op_next = o->op_next;
5473 o->op_seq = PL_op_seqmax++;
5477 if (o->op_next->op_type == OP_RV2SV) {
5478 if (!(o->op_next->op_private & OPpDEREF)) {
5480 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5481 o->op_next = o->op_next->op_next;
5482 o->op_type = OP_GVSV;
5483 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5486 else if (o->op_next->op_type == OP_RV2AV) {
5487 OP* pop = o->op_next->op_next;
5489 if (pop->op_type == OP_CONST &&
5490 (PL_op = pop->op_next) &&
5491 pop->op_next->op_type == OP_AELEM &&
5492 !(pop->op_next->op_private &
5493 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5494 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5498 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5502 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5503 o->op_next = pop->op_next->op_next;
5504 o->op_type = OP_AELEMFAST;
5505 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5506 o->op_private = (U8)i;
5507 GvAVn(((GVOP*)o)->op_gv);
5510 o->op_seq = PL_op_seqmax++;
5517 o->op_seq = PL_op_seqmax++;
5518 while (cLOGOP->op_other->op_type == OP_NULL)
5519 cLOGOP->op_other = cLOGOP->op_other->op_next;
5520 peep(cLOGOP->op_other);
5524 o->op_seq = PL_op_seqmax++;
5525 peep(cCONDOP->op_true);
5526 peep(cCONDOP->op_false);
5530 o->op_seq = PL_op_seqmax++;
5531 peep(cLOOP->op_redoop);
5532 peep(cLOOP->op_nextop);
5533 peep(cLOOP->op_lastop);
5539 o->op_seq = PL_op_seqmax++;
5540 peep(cPMOP->op_pmreplstart);
5544 o->op_seq = PL_op_seqmax++;
5545 if (ckWARN(WARN_SYNTAX) && o->op_next
5546 && o->op_next->op_type == OP_NEXTSTATE) {
5547 if (o->op_next->op_sibling &&
5548 o->op_next->op_sibling->op_type != OP_EXIT &&
5549 o->op_next->op_sibling->op_type != OP_WARN &&
5550 o->op_next->op_sibling->op_type != OP_DIE) {
5551 line_t oldline = PL_curcop->cop_line;
5553 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5554 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5555 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5556 PL_curcop->cop_line = oldline;
5570 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5571 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5573 rop = (UNOP*)((BINOP*)o)->op_first;
5574 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5576 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5577 if (!SvOBJECT(lexname))
5579 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5580 if (!fields || !GvHV(*fields))
5582 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5583 key = SvPV(*svp, keylen);
5584 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5586 croak("No such field \"%s\" in variable %s of type %s",
5587 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5589 ind = SvIV(*indsvp);
5591 croak("Bad index while coercing array into hash");
5592 rop->op_type = OP_RV2AV;
5593 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5594 o->op_type = OP_AELEM;
5595 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5597 *svp = newSViv(ind);
5602 o->op_seq = PL_op_seqmax++;