3 * Copyright (c) 1991-1999, 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 yyerror(form("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 yyerror(form("Can't declare class for non-scalar %s in \"my\"",
176 (void)SvUPGRADE(sv, SVt_PVMG);
177 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
180 av_store(PL_comppad_name, off, sv);
181 SvNVX(sv) = (double)PAD_MAX;
182 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
183 if (!PL_min_intro_pending)
184 PL_min_intro_pending = off;
185 PL_max_intro_pending = off;
187 av_store(PL_comppad, off, (SV*)newAV());
188 else if (*name == '%')
189 av_store(PL_comppad, off, (SV*)newHV());
190 SvPADMY_on(PL_curpad[off]);
194 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
197 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval,
205 register PERL_CONTEXT *cx;
207 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
208 AV *curlist = CvPADLIST(cv);
209 SV **svp = av_fetch(curlist, 0, FALSE);
212 if (!svp || *svp == &PL_sv_undef)
215 svp = AvARRAY(curname);
216 for (off = AvFILLp(curname); off > 0; off--) {
217 if ((sv = svp[off]) &&
218 sv != &PL_sv_undef &&
220 seq > I_32(SvNVX(sv)) &&
221 strEQ(SvPVX(sv), name))
232 return 0; /* don't clone from inactive stack frame */
236 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
237 oldsv = *av_fetch(oldpad, off, TRUE);
238 if (!newoff) { /* Not a mere clone operation. */
239 SV *namesv = NEWSV(1103,0);
240 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
241 sv_upgrade(namesv, SVt_PVNV);
242 sv_setpv(namesv, name);
243 av_store(PL_comppad_name, newoff, namesv);
244 SvNVX(namesv) = (double)PL_curcop->cop_seq;
245 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
246 SvFAKE_on(namesv); /* A ref, not a real var */
247 if (SvOBJECT(sv)) { /* A typed var */
249 (void)SvUPGRADE(namesv, SVt_PVMG);
250 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
253 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
254 /* "It's closures all the way down." */
255 CvCLONE_on(PL_compcv);
257 if (CvANON(PL_compcv))
258 oldsv = Nullsv; /* no need to keep ref */
263 bcv && bcv != cv && !CvCLONE(bcv);
264 bcv = CvOUTSIDE(bcv))
269 if (ckWARN(WARN_CLOSURE)
270 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
273 "Variable \"%s\" may be unavailable",
281 else if (!CvUNIQUE(PL_compcv)) {
282 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
284 "Variable \"%s\" will not stay shared", name);
287 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
293 if (flags & FINDLEX_NOSEARCH)
296 /* Nothing in current lexical context--try eval's context, if any.
297 * This is necessary to let the perldb get at lexically scoped variables.
298 * XXX This will also probably interact badly with eval tree caching.
301 for (i = cx_ix; i >= 0; i--) {
303 switch (CxTYPE(cx)) {
305 if (i == 0 && saweval) {
306 seq = cxstack[saweval].blk_oldcop->cop_seq;
307 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
311 switch (cx->blk_eval.old_op_type) {
317 /* require must have its own scope */
325 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
326 saweval = i; /* so we know where we were called from */
329 seq = cxstack[saweval].blk_oldcop->cop_seq;
330 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
338 pad_findmy(char *name)
344 SV **svp = AvARRAY(PL_comppad_name);
345 U32 seq = PL_cop_seqmax;
351 * Special case to get lexical (and hence per-thread) @_.
352 * XXX I need to find out how to tell at parse-time whether use
353 * of @_ should refer to a lexical (from a sub) or defgv (global
354 * scope and maybe weird sub-ish things like formats). See
355 * startsub in perly.y. It's possible that @_ could be lexical
356 * (at least from subs) even in non-threaded perl.
358 if (strEQ(name, "@_"))
359 return 0; /* success. (NOT_IN_PAD indicates failure) */
360 #endif /* USE_THREADS */
362 /* The one we're looking for is probably just before comppad_name_fill. */
363 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
364 if ((sv = svp[off]) &&
365 sv != &PL_sv_undef &&
368 seq > I_32(SvNVX(sv)))) &&
369 strEQ(SvPVX(sv), name))
372 return (PADOFFSET)off;
373 pendoff = off; /* this pending def. will override import */
377 outside = CvOUTSIDE(PL_compcv);
379 /* Check if if we're compiling an eval'', and adjust seq to be the
380 * eval's seq number. This depends on eval'' having a non-null
381 * CvOUTSIDE() while it is being compiled. The eval'' itself is
382 * identified by CvEVAL being true and CvGV being null. */
383 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
384 cx = &cxstack[cxstack_ix];
386 seq = cx->blk_oldcop->cop_seq;
389 /* See if it's in a nested scope */
390 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
392 /* If there is a pending local definition, this new alias must die */
394 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
395 return off; /* pad_findlex returns 0 for failure...*/
397 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
401 pad_leavemy(I32 fill)
404 SV **svp = AvARRAY(PL_comppad_name);
406 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
407 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
408 if ((sv = svp[off]) && sv != &PL_sv_undef)
409 warn("%s never introduced", SvPVX(sv));
412 /* "Deintroduce" my variables that are leaving with this scope. */
413 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
414 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
415 SvIVX(sv) = PL_cop_seqmax;
420 pad_alloc(I32 optype, U32 tmptype)
426 if (AvARRAY(PL_comppad) != PL_curpad)
427 croak("panic: pad_alloc");
428 if (PL_pad_reset_pending)
430 if (tmptype & SVs_PADMY) {
432 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
433 } while (SvPADBUSY(sv)); /* need a fresh one */
434 retval = AvFILLp(PL_comppad);
437 SV **names = AvARRAY(PL_comppad_name);
438 SSize_t names_fill = AvFILLp(PL_comppad_name);
441 * "foreach" index vars temporarily become aliases to non-"my"
442 * values. Thus we must skip, not just pad values that are
443 * marked as current pad values, but also those with names.
445 if (++PL_padix <= names_fill &&
446 (sv = names[PL_padix]) && sv != &PL_sv_undef)
448 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
449 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
454 SvFLAGS(sv) |= tmptype;
455 PL_curpad = AvARRAY(PL_comppad);
457 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
458 (unsigned long) thr, (unsigned long) PL_curpad,
459 (long) retval, PL_op_name[optype]));
461 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
462 (unsigned long) PL_curpad,
463 (long) retval, PL_op_name[optype]));
464 #endif /* USE_THREADS */
465 return (PADOFFSET)retval;
473 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
474 (unsigned long) thr, (unsigned long) PL_curpad, po));
477 croak("panic: pad_sv po");
478 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
479 (unsigned long) PL_curpad, po));
480 #endif /* USE_THREADS */
481 return PL_curpad[po]; /* eventually we'll turn this into a macro */
485 pad_free(PADOFFSET po)
490 if (AvARRAY(PL_comppad) != PL_curpad)
491 croak("panic: pad_free curpad");
493 croak("panic: pad_free po");
495 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
496 (unsigned long) thr, (unsigned long) PL_curpad, po));
498 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
499 (unsigned long) PL_curpad, po));
500 #endif /* USE_THREADS */
501 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
502 SvPADTMP_off(PL_curpad[po]);
503 if ((I32)po < PL_padix)
508 pad_swipe(PADOFFSET po)
511 if (AvARRAY(PL_comppad) != PL_curpad)
512 croak("panic: pad_swipe curpad");
514 croak("panic: pad_swipe po");
516 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
517 (unsigned long) thr, (unsigned long) PL_curpad, po));
519 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
520 (unsigned long) PL_curpad, po));
521 #endif /* USE_THREADS */
522 SvPADTMP_off(PL_curpad[po]);
523 PL_curpad[po] = NEWSV(1107,0);
524 SvPADTMP_on(PL_curpad[po]);
525 if ((I32)po < PL_padix)
529 /* XXX pad_reset() is currently disabled because it results in serious bugs.
530 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
531 * on the stack by OPs that use them, there are several ways to get an alias
532 * to a shared TARG. Such an alias will change randomly and unpredictably.
533 * We avoid doing this until we can think of a Better Way.
538 #ifdef USE_BROKEN_PAD_RESET
542 if (AvARRAY(PL_comppad) != PL_curpad)
543 croak("panic: pad_reset curpad");
545 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
546 (unsigned long) thr, (unsigned long) PL_curpad));
548 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
549 (unsigned long) PL_curpad));
550 #endif /* USE_THREADS */
551 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
552 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
553 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
554 SvPADTMP_off(PL_curpad[po]);
556 PL_padix = PL_padix_floor;
559 PL_pad_reset_pending = FALSE;
563 /* find_threadsv is not reentrant */
565 find_threadsv(const char *name)
571 /* We currently only handle names of a single character */
572 p = strchr(PL_threadsv_names, *name);
575 key = p - PL_threadsv_names;
576 MUTEX_LOCK(&thr->mutex);
577 svp = av_fetch(thr->threadsv, key, FALSE);
579 MUTEX_UNLOCK(&thr->mutex);
581 SV *sv = NEWSV(0, 0);
582 av_store(thr->threadsv, key, sv);
583 thr->threadsvp = AvARRAY(thr->threadsv);
584 MUTEX_UNLOCK(&thr->mutex);
586 * Some magic variables used to be automagically initialised
587 * in gv_fetchpv. Those which are now per-thread magicals get
588 * initialised here instead.
594 sv_setpv(sv, "\034");
595 sv_magic(sv, 0, 0, name, 1);
600 PL_sawampersand = TRUE;
614 /* XXX %! tied to Errno.pm needs to be added here.
615 * See gv_fetchpv(). */
619 sv_magic(sv, 0, 0, name, 1);
621 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
622 "find_threadsv: new SV %p for $%s%c\n",
623 sv, (*name < 32) ? "^" : "",
624 (*name < 32) ? toCTRL(*name) : *name));
628 #endif /* USE_THREADS */
635 register OP *kid, *nextkid;
637 if (!o || o->op_seq == (U16)-1)
640 if (o->op_flags & OPf_KIDS) {
641 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
642 nextkid = kid->op_sibling; /* Get before next freeing kid */
647 switch (o->op_type) {
649 o->op_targ = 0; /* Was holding old type, if any. */
652 o->op_targ = 0; /* Was holding hints. */
656 if (!(o->op_flags & OPf_SPECIAL))
660 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
662 #endif /* USE_THREADS */
664 if (!(o->op_flags & OPf_REF)
665 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
671 SvREFCNT_dec(cGVOPo->op_gv);
675 Safefree(cCOPo->cop_label);
676 SvREFCNT_dec(cCOPo->cop_filegv);
677 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
678 SvREFCNT_dec(cCOPo->cop_warnings);
681 SvREFCNT_dec(cSVOPo->op_sv);
687 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
691 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
692 SvREFCNT_dec(cSVOPo->op_sv);
694 Safefree(cPVOPo->op_pv);
697 op_free(cPMOPo->op_pmreplroot);
702 ReREFCNT_dec(cPMOPo->op_pmregexp);
707 pad_free(o->op_targ);
715 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
716 pad_free(o->op_targ);
717 o->op_targ = o->op_type;
718 o->op_type = OP_NULL;
719 o->op_ppaddr = PL_ppaddr[OP_NULL];
722 /* Contextualizers */
724 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
734 /* establish postfix order */
735 if (cUNOPo->op_first) {
736 o->op_next = LINKLIST(cUNOPo->op_first);
737 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
739 kid->op_next = LINKLIST(kid->op_sibling);
754 if (o && o->op_flags & OPf_KIDS) {
755 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
764 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
766 if (ckWARN(WARN_SYNTAX)) {
767 line_t oldline = PL_curcop->cop_line;
769 if (PL_copline != NOLINE)
770 PL_curcop->cop_line = PL_copline;
771 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
772 PL_curcop->cop_line = oldline;
783 /* assumes no premature commitment */
784 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
785 || o->op_type == OP_RETURN)
788 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
790 switch (o->op_type) {
792 if (o->op_private & OPpREPEAT_DOLIST)
793 null(((LISTOP*)cBINOPo->op_first)->op_first);
794 scalar(cBINOPo->op_first);
799 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
803 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
804 if (!kPMOP->op_pmreplroot)
805 deprecate("implicit split to @_");
813 if (o->op_flags & OPf_KIDS) {
814 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
820 kid = cLISTOPo->op_first;
822 while (kid = kid->op_sibling) {
828 WITH_THR(PL_curcop = &PL_compiling);
833 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
839 WITH_THR(PL_curcop = &PL_compiling);
852 /* assumes no premature commitment */
853 U8 want = o->op_flags & OPf_WANT;
854 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
855 || o->op_type == OP_RETURN)
858 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
860 switch (o->op_type) {
862 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
866 if (o->op_flags & OPf_STACKED)
870 if (o->op_private == 4)
941 if (!(o->op_private & OPpLVAL_INTRO))
942 useless = PL_op_desc[o->op_type];
949 if (!(o->op_private & OPpLVAL_INTRO) &&
950 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
951 useless = "a variable";
956 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
963 if (ckWARN(WARN_VOID)) {
964 useless = "a constant";
965 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
967 else if (SvPOK(sv)) {
968 if (strnEQ(SvPVX(sv), "di", 2) ||
969 strnEQ(SvPVX(sv), "ds", 2) ||
970 strnEQ(SvPVX(sv), "ig", 2))
975 null(o); /* don't execute a constant */
976 SvREFCNT_dec(sv); /* don't even remember it */
980 o->op_type = OP_PREINC; /* pre-increment is faster */
981 o->op_ppaddr = PL_ppaddr[OP_PREINC];
985 o->op_type = OP_PREDEC; /* pre-decrement is faster */
986 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
992 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
997 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
998 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
999 if (o->op_flags & OPf_STACKED)
1005 if (!(o->op_flags & OPf_KIDS))
1014 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1021 /* all requires must return a boolean value */
1022 o->op_flags &= ~OPf_WANT;
1025 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1026 if (!kPMOP->op_pmreplroot)
1027 deprecate("implicit split to @_");
1033 if (ckWARN(WARN_VOID))
1034 warner(WARN_VOID, "Useless use of %s in void context", useless);
1043 if (o && o->op_flags & OPf_KIDS) {
1044 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1055 /* assumes no premature commitment */
1056 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1057 || o->op_type == OP_RETURN)
1060 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1062 switch (o->op_type) {
1065 list(cBINOPo->op_first);
1070 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1078 if (!(o->op_flags & OPf_KIDS))
1080 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1081 list(cBINOPo->op_first);
1082 return gen_constant_list(o);
1089 kid = cLISTOPo->op_first;
1091 while (kid = kid->op_sibling) {
1092 if (kid->op_sibling)
1097 WITH_THR(PL_curcop = &PL_compiling);
1101 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1102 if (kid->op_sibling)
1107 WITH_THR(PL_curcop = &PL_compiling);
1110 /* all requires must return a boolean value */
1111 o->op_flags &= ~OPf_WANT;
1123 if (o->op_type == OP_LINESEQ ||
1124 o->op_type == OP_SCOPE ||
1125 o->op_type == OP_LEAVE ||
1126 o->op_type == OP_LEAVETRY)
1129 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1130 if (kid->op_sibling) {
1134 PL_curcop = &PL_compiling;
1136 o->op_flags &= ~OPf_PARENS;
1137 if (PL_hints & HINT_BLOCK_SCOPE)
1138 o->op_flags |= OPf_PARENS;
1141 o = newOP(OP_STUB, 0);
1146 modkids(OP *o, I32 type)
1149 if (o && o->op_flags & OPf_KIDS) {
1150 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1157 mod(OP *o, I32 type)
1164 if (!o || PL_error_count)
1167 switch (o->op_type) {
1172 if (!(o->op_private & (OPpCONST_ARYBASE)))
1174 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1175 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1179 SAVEI32(PL_compiling.cop_arybase);
1180 PL_compiling.cop_arybase = 0;
1182 else if (type == OP_REFGEN)
1185 croak("That use of $[ is unsupported");
1188 if (o->op_flags & OPf_PARENS)
1192 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1193 !(o->op_flags & OPf_STACKED)) {
1194 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1195 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1196 assert(cUNOPo->op_first->op_type == OP_NULL);
1197 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1203 /* grep, foreach, subcalls, refgen */
1204 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1206 yyerror(form("Can't modify %s in %s",
1207 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1208 ? "do block" : PL_op_desc[o->op_type]),
1209 type ? PL_op_desc[type] : "local"));
1223 case OP_RIGHT_SHIFT:
1232 if (!(o->op_flags & OPf_STACKED))
1238 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1244 if (!type && cUNOPo->op_first->op_type != OP_GV)
1245 croak("Can't localize through a reference");
1246 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1247 PL_modcount = 10000;
1248 return o; /* Treat \(@foo) like ordinary list. */
1252 if (scalar_mod_type(o, type))
1254 ref(cUNOPo->op_first, o->op_type);
1263 PL_modcount = 10000;
1266 if (!type && cUNOPo->op_first->op_type != OP_GV)
1267 croak("Can't localize through a reference");
1268 ref(cUNOPo->op_first, o->op_type);
1272 PL_hints |= HINT_BLOCK_SCOPE;
1282 PL_modcount = 10000;
1283 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1284 return o; /* Treat \(@foo) like ordinary list. */
1285 if (scalar_mod_type(o, type))
1291 croak("Can't localize lexical variable %s",
1292 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1297 PL_modcount++; /* XXX ??? */
1299 #endif /* USE_THREADS */
1305 if (type != OP_SASSIGN)
1309 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1315 pad_free(o->op_targ);
1316 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1317 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1318 if (o->op_flags & OPf_KIDS)
1319 mod(cBINOPo->op_first->op_sibling, type);
1324 ref(cBINOPo->op_first, o->op_type);
1325 if (type == OP_ENTERSUB &&
1326 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1327 o->op_private |= OPpLVAL_DEFER;
1334 if (o->op_flags & OPf_KIDS)
1335 mod(cLISTOPo->op_last, type);
1339 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1341 else if (!(o->op_flags & OPf_KIDS))
1343 if (o->op_targ != OP_LIST) {
1344 mod(cBINOPo->op_first, type);
1349 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1353 o->op_flags |= OPf_MOD;
1355 if (type == OP_AASSIGN || type == OP_SASSIGN)
1356 o->op_flags |= OPf_SPECIAL|OPf_REF;
1358 o->op_private |= OPpLVAL_INTRO;
1359 o->op_flags &= ~OPf_SPECIAL;
1360 PL_hints |= HINT_BLOCK_SCOPE;
1362 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1363 o->op_flags |= OPf_REF;
1368 scalar_mod_type(OP *o, I32 type)
1372 if (o->op_type == OP_RV2GV)
1396 case OP_RIGHT_SHIFT:
1415 is_handle_constructor(OP *o, I32 argnum)
1417 switch (o->op_type) {
1425 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1438 refkids(OP *o, I32 type)
1441 if (o && o->op_flags & OPf_KIDS) {
1442 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1449 ref(OP *o, I32 type)
1453 if (!o || PL_error_count)
1456 switch (o->op_type) {
1458 if ((type == OP_DEFINED || type == OP_LOCK) &&
1459 !(o->op_flags & OPf_STACKED)) {
1460 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1461 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1462 assert(cUNOPo->op_first->op_type == OP_NULL);
1463 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1464 o->op_flags |= OPf_SPECIAL;
1469 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1473 if (type == OP_DEFINED)
1474 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1475 ref(cUNOPo->op_first, o->op_type);
1478 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1479 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1480 : type == OP_RV2HV ? OPpDEREF_HV
1482 o->op_flags |= OPf_MOD;
1487 o->op_flags |= OPf_MOD; /* XXX ??? */
1492 o->op_flags |= OPf_REF;
1495 if (type == OP_DEFINED)
1496 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1497 ref(cUNOPo->op_first, o->op_type);
1502 o->op_flags |= OPf_REF;
1507 if (!(o->op_flags & OPf_KIDS))
1509 ref(cBINOPo->op_first, type);
1513 ref(cBINOPo->op_first, o->op_type);
1514 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1515 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1516 : type == OP_RV2HV ? OPpDEREF_HV
1518 o->op_flags |= OPf_MOD;
1526 if (!(o->op_flags & OPf_KIDS))
1528 ref(cLISTOPo->op_last, type);
1543 if (!o || PL_error_count)
1547 if (type == OP_LIST) {
1548 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1550 } else if (type == OP_UNDEF) {
1552 } else if (type != OP_PADSV &&
1555 type != OP_PUSHMARK)
1557 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1560 o->op_flags |= OPf_MOD;
1561 o->op_private |= OPpLVAL_INTRO;
1569 o->op_flags |= OPf_PARENS;
1574 bind_match(I32 type, OP *left, OP *right)
1579 if (ckWARN(WARN_UNSAFE) &&
1580 (left->op_type == OP_RV2AV ||
1581 left->op_type == OP_RV2HV ||
1582 left->op_type == OP_PADAV ||
1583 left->op_type == OP_PADHV)) {
1584 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1585 right->op_type == OP_TRANS)
1586 ? right->op_type : OP_MATCH];
1587 char *sample = ((left->op_type == OP_RV2AV ||
1588 left->op_type == OP_PADAV)
1589 ? "@array" : "%hash");
1591 "Applying %s to %s will act on scalar(%s)",
1592 desc, sample, sample);
1595 if (right->op_type == OP_MATCH ||
1596 right->op_type == OP_SUBST ||
1597 right->op_type == OP_TRANS) {
1598 right->op_flags |= OPf_STACKED;
1599 if (right->op_type != OP_MATCH)
1600 left = mod(left, right->op_type);
1601 if (right->op_type == OP_TRANS)
1602 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1604 o = prepend_elem(right->op_type, scalar(left), right);
1606 return newUNOP(OP_NOT, 0, scalar(o));
1610 return bind_match(type, left,
1611 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1619 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1620 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1627 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1628 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1629 o->op_type = OP_LEAVE;
1630 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1633 if (o->op_type == OP_LINESEQ) {
1635 o->op_type = OP_SCOPE;
1636 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1637 kid = ((LISTOP*)o)->op_first;
1638 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1639 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1644 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1654 SAVESPTR(GvHV(PL_hintgv));
1655 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1656 SAVEFREESV(GvHV(PL_hintgv));
1660 block_start(int full)
1663 int retval = PL_savestack_ix;
1665 SAVEI32(PL_comppad_name_floor);
1667 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1668 PL_comppad_name_floor = PL_comppad_name_fill;
1670 PL_comppad_name_floor = 0;
1672 SAVEI32(PL_min_intro_pending);
1673 SAVEI32(PL_max_intro_pending);
1674 PL_min_intro_pending = 0;
1675 SAVEI32(PL_comppad_name_fill);
1676 SAVEI32(PL_padix_floor);
1677 PL_padix_floor = PL_padix;
1678 PL_pad_reset_pending = FALSE;
1680 PL_hints &= ~HINT_BLOCK_SCOPE;
1681 SAVEPPTR(PL_compiling.cop_warnings);
1682 if (PL_compiling.cop_warnings != WARN_ALL &&
1683 PL_compiling.cop_warnings != WARN_NONE) {
1684 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1685 SAVEFREESV(PL_compiling.cop_warnings) ;
1693 block_end(I32 floor, OP *seq)
1696 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1697 OP* retval = scalarseq(seq);
1699 PL_pad_reset_pending = FALSE;
1700 PL_compiling.op_private = PL_hints;
1702 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1703 pad_leavemy(PL_comppad_name_fill);
1712 OP *o = newOP(OP_THREADSV, 0);
1713 o->op_targ = find_threadsv("_");
1716 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1717 #endif /* USE_THREADS */
1725 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1726 PL_eval_start = linklist(PL_eval_root);
1727 PL_eval_root->op_next = 0;
1728 peep(PL_eval_start);
1733 PL_main_root = scope(sawparens(scalarvoid(o)));
1734 PL_curcop = &PL_compiling;
1735 PL_main_start = LINKLIST(PL_main_root);
1736 PL_main_root->op_next = 0;
1737 peep(PL_main_start);
1740 /* Register with debugger */
1742 CV *cv = perl_get_cv("DB::postponed", FALSE);
1746 XPUSHs((SV*)PL_compiling.cop_filegv);
1748 perl_call_sv((SV*)cv, G_DISCARD);
1755 localize(OP *o, I32 lex)
1757 if (o->op_flags & OPf_PARENS)
1761 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1763 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1764 if (*s == ';' || *s == '=')
1765 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1766 lex ? "my" : "local");
1770 PL_in_my_stash = Nullhv;
1774 return mod(o, OP_NULL); /* a bit kludgey */
1780 if (o->op_type == OP_LIST) {
1783 o2 = newOP(OP_THREADSV, 0);
1784 o2->op_targ = find_threadsv(";");
1786 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1787 #endif /* USE_THREADS */
1788 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1794 fold_constants(register OP *o)
1798 I32 type = o->op_type;
1801 if (PL_opargs[type] & OA_RETSCALAR)
1803 if (PL_opargs[type] & OA_TARGET)
1804 o->op_targ = pad_alloc(type, SVs_PADTMP);
1806 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1807 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1809 if (!(PL_opargs[type] & OA_FOLDCONST))
1824 if (o->op_private & OPpLOCALE)
1829 goto nope; /* Don't try to run w/ errors */
1831 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1832 if (curop->op_type != OP_CONST &&
1833 curop->op_type != OP_LIST &&
1834 curop->op_type != OP_SCALAR &&
1835 curop->op_type != OP_NULL &&
1836 curop->op_type != OP_PUSHMARK) {
1841 curop = LINKLIST(o);
1845 sv = *(PL_stack_sp--);
1846 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1847 pad_swipe(o->op_targ);
1848 else if (SvTEMP(sv)) { /* grab mortal temp? */
1849 (void)SvREFCNT_inc(sv);
1853 if (type == OP_RV2GV)
1854 return newGVOP(OP_GV, 0, (GV*)sv);
1856 /* try to smush double to int, but don't smush -2.0 to -2 */
1857 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1861 if ((double)iv == SvNV(sv)) {
1866 SvIOK_off(sv); /* undo SvIV() damage */
1868 return newSVOP(OP_CONST, 0, sv);
1872 if (!(PL_opargs[type] & OA_OTHERINT))
1875 if (!(PL_hints & HINT_INTEGER)) {
1876 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1879 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1880 if (curop->op_type == OP_CONST) {
1881 if (SvIOK(((SVOP*)curop)->op_sv))
1885 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1889 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1896 gen_constant_list(register OP *o)
1900 I32 oldtmps_floor = PL_tmps_floor;
1904 return o; /* Don't attempt to run with errors */
1906 PL_op = curop = LINKLIST(o);
1912 PL_tmps_floor = oldtmps_floor;
1914 o->op_type = OP_RV2AV;
1915 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1916 curop = ((UNOP*)o)->op_first;
1917 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1924 convert(I32 type, I32 flags, OP *o)
1929 if (!o || o->op_type != OP_LIST)
1930 o = newLISTOP(OP_LIST, 0, o, Nullop);
1932 o->op_flags &= ~OPf_WANT;
1934 if (!(PL_opargs[type] & OA_MARK))
1935 null(cLISTOPo->op_first);
1938 o->op_ppaddr = PL_ppaddr[type];
1939 o->op_flags |= flags;
1941 o = CHECKOP(type, o);
1942 if (o->op_type != type)
1945 if (cLISTOPo->op_children < 7) {
1946 /* XXX do we really need to do this if we're done appending?? */
1947 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1949 cLISTOPo->op_last = last; /* in case check substituted last arg */
1952 return fold_constants(o);
1955 /* List constructors */
1958 append_elem(I32 type, OP *first, OP *last)
1966 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1967 return newLISTOP(type, 0, first, last);
1969 if (first->op_flags & OPf_KIDS)
1970 ((LISTOP*)first)->op_last->op_sibling = last;
1972 first->op_flags |= OPf_KIDS;
1973 ((LISTOP*)first)->op_first = last;
1975 ((LISTOP*)first)->op_last = last;
1976 ((LISTOP*)first)->op_children++;
1981 append_list(I32 type, LISTOP *first, LISTOP *last)
1989 if (first->op_type != type)
1990 return prepend_elem(type, (OP*)first, (OP*)last);
1992 if (last->op_type != type)
1993 return append_elem(type, (OP*)first, (OP*)last);
1995 first->op_last->op_sibling = last->op_first;
1996 first->op_last = last->op_last;
1997 first->op_children += last->op_children;
1998 if (first->op_children)
1999 first->op_flags |= OPf_KIDS;
2006 prepend_elem(I32 type, OP *first, OP *last)
2014 if (last->op_type == type) {
2015 if (type == OP_LIST) { /* already a PUSHMARK there */
2016 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2017 ((LISTOP*)last)->op_first->op_sibling = first;
2020 if (!(last->op_flags & OPf_KIDS)) {
2021 ((LISTOP*)last)->op_last = first;
2022 last->op_flags |= OPf_KIDS;
2024 first->op_sibling = ((LISTOP*)last)->op_first;
2025 ((LISTOP*)last)->op_first = first;
2027 ((LISTOP*)last)->op_children++;
2031 return newLISTOP(type, 0, first, last);
2039 return newOP(OP_STUB, 0);
2045 if (!o || o->op_type != OP_LIST)
2046 o = newLISTOP(OP_LIST, 0, o, Nullop);
2052 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2056 Newz(1101, listop, 1, LISTOP);
2058 listop->op_type = type;
2059 listop->op_ppaddr = PL_ppaddr[type];
2060 listop->op_children = (first != 0) + (last != 0);
2061 listop->op_flags = flags;
2065 else if (!first && last)
2068 first->op_sibling = last;
2069 listop->op_first = first;
2070 listop->op_last = last;
2071 if (type == OP_LIST) {
2073 pushop = newOP(OP_PUSHMARK, 0);
2074 pushop->op_sibling = first;
2075 listop->op_first = pushop;
2076 listop->op_flags |= OPf_KIDS;
2078 listop->op_last = pushop;
2080 else if (listop->op_children)
2081 listop->op_flags |= OPf_KIDS;
2087 newOP(I32 type, I32 flags)
2090 Newz(1101, o, 1, OP);
2092 o->op_ppaddr = PL_ppaddr[type];
2093 o->op_flags = flags;
2096 o->op_private = 0 + (flags >> 8);
2097 if (PL_opargs[type] & OA_RETSCALAR)
2099 if (PL_opargs[type] & OA_TARGET)
2100 o->op_targ = pad_alloc(type, SVs_PADTMP);
2101 return CHECKOP(type, o);
2105 newUNOP(I32 type, I32 flags, OP *first)
2110 first = newOP(OP_STUB, 0);
2111 if (PL_opargs[type] & OA_MARK)
2112 first = force_list(first);
2114 Newz(1101, unop, 1, UNOP);
2115 unop->op_type = type;
2116 unop->op_ppaddr = PL_ppaddr[type];
2117 unop->op_first = first;
2118 unop->op_flags = flags | OPf_KIDS;
2119 unop->op_private = 1 | (flags >> 8);
2120 unop = (UNOP*) CHECKOP(type, unop);
2124 return fold_constants((OP *) unop);
2128 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2131 Newz(1101, binop, 1, BINOP);
2134 first = newOP(OP_NULL, 0);
2136 binop->op_type = type;
2137 binop->op_ppaddr = PL_ppaddr[type];
2138 binop->op_first = first;
2139 binop->op_flags = flags | OPf_KIDS;
2142 binop->op_private = 1 | (flags >> 8);
2145 binop->op_private = 2 | (flags >> 8);
2146 first->op_sibling = last;
2149 binop = (BINOP*)CHECKOP(type, binop);
2153 binop->op_last = binop->op_first->op_sibling;
2155 return fold_constants((OP *)binop);
2159 utf8compare(const void *a, const void *b)
2162 for (i = 0; i < 10; i++) {
2163 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2165 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2172 pmtrans(OP *o, OP *expr, OP *repl)
2174 SV *tstr = ((SVOP*)expr)->op_sv;
2175 SV *rstr = ((SVOP*)repl)->op_sv;
2178 register U8 *t = (U8*)SvPV(tstr, tlen);
2179 register U8 *r = (U8*)SvPV(rstr, rlen);
2185 register short *tbl;
2187 complement = o->op_private & OPpTRANS_COMPLEMENT;
2188 del = o->op_private & OPpTRANS_DELETE;
2189 squash = o->op_private & OPpTRANS_SQUASH;
2191 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2192 SV* listsv = newSVpvn("# comment\n",10);
2194 U8* tend = t + tlen;
2195 U8* rend = r + rlen;
2211 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2212 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2218 New(1109, cp, tlen, U8*);
2220 transv = newSVpvn("",0);
2229 qsort(cp, i, sizeof(U8*), utf8compare);
2230 for (j = 0; j < i; j++) {
2232 UV val = utf8_to_uv(s, &ulen);
2234 diff = val - nextmin;
2236 t = uv_to_utf8(tmpbuf,nextmin);
2237 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2239 t = uv_to_utf8(tmpbuf, val - 1);
2240 sv_catpvn(transv, "\377", 1);
2241 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2245 val = utf8_to_uv(s+1, &ulen);
2249 t = uv_to_utf8(tmpbuf,nextmin);
2250 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2251 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2252 sv_catpvn(transv, "\377", 1);
2253 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2254 t = (U8*)SvPVX(transv);
2255 tlen = SvCUR(transv);
2258 else if (!rlen && !del) {
2259 r = t; rlen = tlen; rend = tend;
2262 if (to_utf && from_utf) { /* only counting characters */
2263 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2264 o->op_private |= OPpTRANS_IDENTICAL;
2266 else { /* straight latin-1 translation */
2267 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2268 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2269 o->op_private |= OPpTRANS_IDENTICAL;
2273 while (t < tend || tfirst <= tlast) {
2274 /* see if we need more "t" chars */
2275 if (tfirst > tlast) {
2276 tfirst = (I32)utf8_to_uv(t, &ulen);
2278 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2279 tlast = (I32)utf8_to_uv(++t, &ulen);
2286 /* now see if we need more "r" chars */
2287 if (rfirst > rlast) {
2289 rfirst = (I32)utf8_to_uv(r, &ulen);
2291 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2292 rlast = (I32)utf8_to_uv(++r, &ulen);
2301 rfirst = rlast = 0xffffffff;
2305 /* now see which range will peter our first, if either. */
2306 tdiff = tlast - tfirst;
2307 rdiff = rlast - rfirst;
2314 if (rfirst == 0xffffffff) {
2315 diff = tdiff; /* oops, pretend rdiff is infinite */
2317 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2319 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2323 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2325 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2327 if (rfirst + diff > max)
2328 max = rfirst + diff;
2333 else if (rfirst <= 0x800)
2334 grows |= (tfirst < 0x80);
2335 else if (rfirst <= 0x10000)
2336 grows |= (tfirst < 0x800);
2337 else if (rfirst <= 0x200000)
2338 grows |= (tfirst < 0x10000);
2339 else if (rfirst <= 0x4000000)
2340 grows |= (tfirst < 0x200000);
2341 else if (rfirst <= 0x80000000)
2342 grows |= (tfirst < 0x4000000);
2354 else if (max > 0xff)
2359 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2360 SvREFCNT_dec(listsv);
2362 SvREFCNT_dec(transv);
2364 if (!del && havefinal)
2365 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2367 if (grows && to_utf)
2368 o->op_private |= OPpTRANS_GROWS;
2375 tbl = (short*)cPVOPo->op_pv;
2377 Zero(tbl, 256, short);
2378 for (i = 0; i < tlen; i++)
2380 for (i = 0, j = 0; i < 256; i++) {
2396 if (!rlen && !del) {
2399 o->op_private |= OPpTRANS_IDENTICAL;
2401 for (i = 0; i < 256; i++)
2403 for (i = 0, j = 0; i < tlen; i++,j++) {
2406 if (tbl[t[i]] == -1)
2412 if (tbl[t[i]] == -1)
2423 newPMOP(I32 type, I32 flags)
2428 Newz(1101, pmop, 1, PMOP);
2429 pmop->op_type = type;
2430 pmop->op_ppaddr = PL_ppaddr[type];
2431 pmop->op_flags = flags;
2432 pmop->op_private = 0 | (flags >> 8);
2434 if (PL_hints & HINT_RE_TAINT)
2435 pmop->op_pmpermflags |= PMf_RETAINT;
2436 if (PL_hints & HINT_LOCALE)
2437 pmop->op_pmpermflags |= PMf_LOCALE;
2438 pmop->op_pmflags = pmop->op_pmpermflags;
2440 /* link into pm list */
2441 if (type != OP_TRANS && PL_curstash) {
2442 pmop->op_pmnext = HvPMROOT(PL_curstash);
2443 HvPMROOT(PL_curstash) = pmop;
2450 pmruntime(OP *o, OP *expr, OP *repl)
2455 I32 repl_has_vars = 0;
2457 if (o->op_type == OP_TRANS)
2458 return pmtrans(o, expr, repl);
2460 PL_hints |= HINT_BLOCK_SCOPE;
2463 if (expr->op_type == OP_CONST) {
2465 SV *pat = ((SVOP*)expr)->op_sv;
2466 char *p = SvPV(pat, plen);
2467 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2468 sv_setpvn(pat, "\\s+", 3);
2469 p = SvPV(pat, plen);
2470 pm->op_pmflags |= PMf_SKIPWHITE;
2472 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2473 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2474 pm->op_pmflags |= PMf_WHITE;
2478 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2479 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2481 : OP_REGCMAYBE),0,expr);
2483 Newz(1101, rcop, 1, LOGOP);
2484 rcop->op_type = OP_REGCOMP;
2485 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2486 rcop->op_first = scalar(expr);
2487 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2488 ? (OPf_SPECIAL | OPf_KIDS)
2490 rcop->op_private = 1;
2493 /* establish postfix order */
2494 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2496 rcop->op_next = expr;
2497 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2500 rcop->op_next = LINKLIST(expr);
2501 expr->op_next = (OP*)rcop;
2504 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2509 if (pm->op_pmflags & PMf_EVAL) {
2511 if (PL_curcop->cop_line < PL_multi_end)
2512 PL_curcop->cop_line = PL_multi_end;
2515 else if (repl->op_type == OP_THREADSV
2516 && strchr("&`'123456789+",
2517 PL_threadsv_names[repl->op_targ]))
2521 #endif /* USE_THREADS */
2522 else if (repl->op_type == OP_CONST)
2526 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2527 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2529 if (curop->op_type == OP_THREADSV) {
2531 if (strchr("&`'123456789+", curop->op_private))
2535 if (curop->op_type == OP_GV) {
2536 GV *gv = ((GVOP*)curop)->op_gv;
2538 if (strchr("&`'123456789+", *GvENAME(gv)))
2541 #endif /* USE_THREADS */
2542 else if (curop->op_type == OP_RV2CV)
2544 else if (curop->op_type == OP_RV2SV ||
2545 curop->op_type == OP_RV2AV ||
2546 curop->op_type == OP_RV2HV ||
2547 curop->op_type == OP_RV2GV) {
2548 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2551 else if (curop->op_type == OP_PADSV ||
2552 curop->op_type == OP_PADAV ||
2553 curop->op_type == OP_PADHV ||
2554 curop->op_type == OP_PADANY) {
2557 else if (curop->op_type == OP_PUSHRE)
2558 ; /* Okay here, dangerous in newASSIGNOP */
2567 && (!pm->op_pmregexp
2568 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2569 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2570 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2571 prepend_elem(o->op_type, scalar(repl), o);
2574 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2575 pm->op_pmflags |= PMf_MAYBE_CONST;
2576 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2578 Newz(1101, rcop, 1, LOGOP);
2579 rcop->op_type = OP_SUBSTCONT;
2580 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2581 rcop->op_first = scalar(repl);
2582 rcop->op_flags |= OPf_KIDS;
2583 rcop->op_private = 1;
2586 /* establish postfix order */
2587 rcop->op_next = LINKLIST(repl);
2588 repl->op_next = (OP*)rcop;
2590 pm->op_pmreplroot = scalar((OP*)rcop);
2591 pm->op_pmreplstart = LINKLIST(rcop);
2600 newSVOP(I32 type, I32 flags, SV *sv)
2603 Newz(1101, svop, 1, SVOP);
2604 svop->op_type = type;
2605 svop->op_ppaddr = PL_ppaddr[type];
2607 svop->op_next = (OP*)svop;
2608 svop->op_flags = flags;
2609 if (PL_opargs[type] & OA_RETSCALAR)
2611 if (PL_opargs[type] & OA_TARGET)
2612 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2613 return CHECKOP(type, svop);
2617 newGVOP(I32 type, I32 flags, GV *gv)
2621 Newz(1101, gvop, 1, GVOP);
2622 gvop->op_type = type;
2623 gvop->op_ppaddr = PL_ppaddr[type];
2624 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2625 gvop->op_next = (OP*)gvop;
2626 gvop->op_flags = flags;
2627 if (PL_opargs[type] & OA_RETSCALAR)
2629 if (PL_opargs[type] & OA_TARGET)
2630 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2631 return CHECKOP(type, gvop);
2635 newPVOP(I32 type, I32 flags, char *pv)
2638 Newz(1101, pvop, 1, PVOP);
2639 pvop->op_type = type;
2640 pvop->op_ppaddr = PL_ppaddr[type];
2642 pvop->op_next = (OP*)pvop;
2643 pvop->op_flags = flags;
2644 if (PL_opargs[type] & OA_RETSCALAR)
2646 if (PL_opargs[type] & OA_TARGET)
2647 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2648 return CHECKOP(type, pvop);
2657 save_hptr(&PL_curstash);
2658 save_item(PL_curstname);
2663 name = SvPV(sv, len);
2664 PL_curstash = gv_stashpvn(name,len,TRUE);
2665 sv_setpvn(PL_curstname, name, len);
2669 sv_setpv(PL_curstname,"<none>");
2670 PL_curstash = Nullhv;
2672 PL_hints |= HINT_BLOCK_SCOPE;
2673 PL_copline = NOLINE;
2678 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2687 if (id->op_type != OP_CONST)
2688 croak("Module name must be constant");
2692 if(version != Nullop) {
2693 SV *vesv = ((SVOP*)version)->op_sv;
2695 if (arg == Nullop && !SvNIOK(vesv)) {
2702 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2703 croak("Version number must be constant number");
2705 /* Make copy of id so we don't free it twice */
2706 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2708 /* Fake up a method call to VERSION */
2709 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2710 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2711 append_elem(OP_LIST,
2712 prepend_elem(OP_LIST, pack, list(version)),
2713 newUNOP(OP_METHOD, 0, meth)));
2717 /* Fake up an import/unimport */
2718 if (arg && arg->op_type == OP_STUB)
2719 imop = arg; /* no import on explicit () */
2720 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2721 imop = Nullop; /* use 5.0; */
2724 /* Make copy of id so we don't free it twice */
2725 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2726 meth = newSVOP(OP_CONST, 0,
2728 ? newSVpvn("import", 6)
2729 : newSVpvn("unimport", 8)
2731 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2732 append_elem(OP_LIST,
2733 prepend_elem(OP_LIST, pack, list(arg)),
2734 newUNOP(OP_METHOD, 0, meth)));
2737 /* Fake up a require, handle override, if any */
2738 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2739 if (!(gv && GvIMPORTED_CV(gv)))
2740 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2742 if (gv && GvIMPORTED_CV(gv)) {
2743 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2744 append_elem(OP_LIST, id,
2745 scalar(newUNOP(OP_RV2CV, 0,
2750 rqop = newUNOP(OP_REQUIRE, 0, id);
2753 /* Fake up the BEGIN {}, which does its thing immediately. */
2755 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2757 append_elem(OP_LINESEQ,
2758 append_elem(OP_LINESEQ,
2759 newSTATEOP(0, Nullch, rqop),
2760 newSTATEOP(0, Nullch, veop)),
2761 newSTATEOP(0, Nullch, imop) ));
2763 PL_copline = NOLINE;
2773 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2774 if (!(gv && GvIMPORTED_CV(gv)))
2775 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2777 if (gv && GvIMPORTED_CV(gv)) {
2778 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2779 append_elem(OP_LIST, term,
2780 scalar(newUNOP(OP_RV2CV, 0,
2785 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2791 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2793 return newBINOP(OP_LSLICE, flags,
2794 list(force_list(subscript)),
2795 list(force_list(listval)) );
2799 list_assignment(register OP *o)
2804 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2805 o = cUNOPo->op_first;
2807 if (o->op_type == OP_COND_EXPR) {
2808 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2809 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2814 yyerror("Assignment to both a list and a scalar");
2818 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2819 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2820 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2823 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2826 if (o->op_type == OP_RV2SV)
2833 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2838 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2839 return newLOGOP(optype, 0,
2840 mod(scalar(left), optype),
2841 newUNOP(OP_SASSIGN, 0, scalar(right)));
2844 return newBINOP(optype, OPf_STACKED,
2845 mod(scalar(left), optype), scalar(right));
2849 if (list_assignment(left)) {
2852 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2853 left = mod(left, OP_AASSIGN);
2861 o = newBINOP(OP_AASSIGN, flags,
2862 list(force_list(right)),
2863 list(force_list(left)) );
2864 o->op_private = 0 | (flags >> 8);
2865 if (!(left->op_private & OPpLVAL_INTRO)) {
2869 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2870 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2871 if (curop->op_type == OP_GV) {
2872 GV *gv = ((GVOP*)curop)->op_gv;
2873 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2875 SvCUR(gv) = PL_generation;
2877 else if (curop->op_type == OP_PADSV ||
2878 curop->op_type == OP_PADAV ||
2879 curop->op_type == OP_PADHV ||
2880 curop->op_type == OP_PADANY) {
2881 SV **svp = AvARRAY(PL_comppad_name);
2882 SV *sv = svp[curop->op_targ];
2883 if (SvCUR(sv) == PL_generation)
2885 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2887 else if (curop->op_type == OP_RV2CV)
2889 else if (curop->op_type == OP_RV2SV ||
2890 curop->op_type == OP_RV2AV ||
2891 curop->op_type == OP_RV2HV ||
2892 curop->op_type == OP_RV2GV) {
2893 if (lastop->op_type != OP_GV) /* funny deref? */
2896 else if (curop->op_type == OP_PUSHRE) {
2897 if (((PMOP*)curop)->op_pmreplroot) {
2898 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2899 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2901 SvCUR(gv) = PL_generation;
2910 o->op_private = OPpASSIGN_COMMON;
2912 if (right && right->op_type == OP_SPLIT) {
2914 if ((tmpop = ((LISTOP*)right)->op_first) &&
2915 tmpop->op_type == OP_PUSHRE)
2917 PMOP *pm = (PMOP*)tmpop;
2918 if (left->op_type == OP_RV2AV &&
2919 !(left->op_private & OPpLVAL_INTRO) &&
2920 !(o->op_private & OPpASSIGN_COMMON) )
2922 tmpop = ((UNOP*)left)->op_first;
2923 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2924 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2925 pm->op_pmflags |= PMf_ONCE;
2926 tmpop = cUNOPo->op_first; /* to list (nulled) */
2927 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2928 tmpop->op_sibling = Nullop; /* don't free split */
2929 right->op_next = tmpop->op_next; /* fix starting loc */
2930 op_free(o); /* blow off assign */
2931 right->op_flags &= ~OPf_WANT;
2932 /* "I don't know and I don't care." */
2937 if (PL_modcount < 10000 &&
2938 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2940 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2942 sv_setiv(sv, PL_modcount+1);
2950 right = newOP(OP_UNDEF, 0);
2951 if (right->op_type == OP_READLINE) {
2952 right->op_flags |= OPf_STACKED;
2953 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2956 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2957 o = newBINOP(OP_SASSIGN, flags,
2958 scalar(right), mod(scalar(left), OP_SASSIGN) );
2970 newSTATEOP(I32 flags, char *label, OP *o)
2973 U32 seq = intro_my();
2976 Newz(1101, cop, 1, COP);
2977 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2978 cop->op_type = OP_DBSTATE;
2979 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2982 cop->op_type = OP_NEXTSTATE;
2983 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2985 cop->op_flags = flags;
2986 cop->op_private = (PL_hints & HINT_UTF8);
2988 cop->op_private |= NATIVE_HINTS;
2990 PL_compiling.op_private = cop->op_private;
2991 cop->op_next = (OP*)cop;
2994 cop->cop_label = label;
2995 PL_hints |= HINT_BLOCK_SCOPE;
2998 cop->cop_arybase = PL_curcop->cop_arybase;
2999 if (PL_curcop->cop_warnings == WARN_NONE
3000 || PL_curcop->cop_warnings == WARN_ALL)
3001 cop->cop_warnings = PL_curcop->cop_warnings ;
3003 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3006 if (PL_copline == NOLINE)
3007 cop->cop_line = PL_curcop->cop_line;
3009 cop->cop_line = PL_copline;
3010 PL_copline = NOLINE;
3012 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3013 cop->cop_stash = PL_curstash;
3015 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3016 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3017 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3018 (void)SvIOK_on(*svp);
3020 SvSTASH(*svp) = (HV*)cop;
3024 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3027 /* "Introduce" my variables to visible status. */
3035 if (! PL_min_intro_pending)
3036 return PL_cop_seqmax;
3038 svp = AvARRAY(PL_comppad_name);
3039 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3040 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3041 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3042 SvNVX(sv) = (double)PL_cop_seqmax;
3045 PL_min_intro_pending = 0;
3046 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3047 return PL_cop_seqmax++;
3051 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3053 return new_logop(type, flags, &first, &other);
3057 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3062 OP *first = *firstp;
3063 OP *other = *otherp;
3065 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3066 return newBINOP(type, flags, scalar(first), scalar(other));
3068 scalarboolean(first);
3069 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3070 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3071 if (type == OP_AND || type == OP_OR) {
3077 first = *firstp = cUNOPo->op_first;
3079 first->op_next = o->op_next;
3080 cUNOPo->op_first = Nullop;
3084 if (first->op_type == OP_CONST) {
3085 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3086 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3088 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3099 else if (first->op_type == OP_WANTARRAY) {
3105 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3106 OP *k1 = ((UNOP*)first)->op_first;
3107 OP *k2 = k1->op_sibling;
3109 switch (first->op_type)
3112 if (k2 && k2->op_type == OP_READLINE
3113 && (k2->op_flags & OPf_STACKED)
3114 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3115 warnop = k2->op_type;
3119 if (k1->op_type == OP_READDIR
3120 || k1->op_type == OP_GLOB
3121 || k1->op_type == OP_EACH)
3122 warnop = k1->op_type;
3126 line_t oldline = PL_curcop->cop_line;
3127 PL_curcop->cop_line = PL_copline;
3129 "Value of %s%s can be \"0\"; test with defined()",
3131 ((warnop == OP_READLINE || warnop == OP_GLOB)
3132 ? " construct" : "() operator"));
3133 PL_curcop->cop_line = oldline;
3140 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3141 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3143 Newz(1101, logop, 1, LOGOP);
3145 logop->op_type = type;
3146 logop->op_ppaddr = PL_ppaddr[type];
3147 logop->op_first = first;
3148 logop->op_flags = flags | OPf_KIDS;
3149 logop->op_other = LINKLIST(other);
3150 logop->op_private = 1 | (flags >> 8);
3152 /* establish postfix order */
3153 logop->op_next = LINKLIST(first);
3154 first->op_next = (OP*)logop;
3155 first->op_sibling = other;
3157 o = newUNOP(OP_NULL, 0, (OP*)logop);
3164 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3171 return newLOGOP(OP_AND, 0, first, trueop);
3173 return newLOGOP(OP_OR, 0, first, falseop);
3175 scalarboolean(first);
3176 if (first->op_type == OP_CONST) {
3177 if (SvTRUE(((SVOP*)first)->op_sv)) {
3188 else if (first->op_type == OP_WANTARRAY) {
3192 Newz(1101, condop, 1, CONDOP);
3194 condop->op_type = OP_COND_EXPR;
3195 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3196 condop->op_first = first;
3197 condop->op_flags = flags | OPf_KIDS;
3198 condop->op_true = LINKLIST(trueop);
3199 condop->op_false = LINKLIST(falseop);
3200 condop->op_private = 1 | (flags >> 8);
3202 /* establish postfix order */
3203 condop->op_next = LINKLIST(first);
3204 first->op_next = (OP*)condop;
3206 first->op_sibling = trueop;
3207 trueop->op_sibling = falseop;
3208 o = newUNOP(OP_NULL, 0, (OP*)condop);
3210 trueop->op_next = o;
3211 falseop->op_next = o;
3217 newRANGE(I32 flags, OP *left, OP *right)
3225 Newz(1101, condop, 1, CONDOP);
3227 condop->op_type = OP_RANGE;
3228 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3229 condop->op_first = left;
3230 condop->op_flags = OPf_KIDS;
3231 condop->op_true = LINKLIST(left);
3232 condop->op_false = LINKLIST(right);
3233 condop->op_private = 1 | (flags >> 8);
3235 left->op_sibling = right;
3237 condop->op_next = (OP*)condop;
3238 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3239 flop = newUNOP(OP_FLOP, 0, flip);
3240 o = newUNOP(OP_NULL, 0, flop);
3243 left->op_next = flip;
3244 right->op_next = flop;
3246 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3247 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3248 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3249 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3251 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3252 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3255 if (!flip->op_private || !flop->op_private)
3256 linklist(o); /* blow off optimizer unless constant */
3262 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3267 int once = block && block->op_flags & OPf_SPECIAL &&
3268 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3271 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3272 return block; /* do {} while 0 does once */
3273 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3274 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3275 expr = newUNOP(OP_DEFINED, 0,
3276 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3277 } else if (expr->op_flags & OPf_KIDS) {
3278 OP *k1 = ((UNOP*)expr)->op_first;
3279 OP *k2 = (k1) ? k1->op_sibling : NULL;
3280 switch (expr->op_type) {
3282 if (k2 && k2->op_type == OP_READLINE
3283 && (k2->op_flags & OPf_STACKED)
3284 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3285 expr = newUNOP(OP_DEFINED, 0, expr);
3289 if (k1->op_type == OP_READDIR
3290 || k1->op_type == OP_GLOB
3291 || k1->op_type == OP_EACH)
3292 expr = newUNOP(OP_DEFINED, 0, expr);
3298 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3299 o = new_logop(OP_AND, 0, &expr, &listop);
3302 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3304 if (once && o != listop)
3305 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3308 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3310 o->op_flags |= flags;
3312 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3317 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3326 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3327 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3328 expr = newUNOP(OP_DEFINED, 0,
3329 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3330 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3331 OP *k1 = ((UNOP*)expr)->op_first;
3332 OP *k2 = (k1) ? k1->op_sibling : NULL;
3333 switch (expr->op_type) {
3335 if (k2 && k2->op_type == OP_READLINE
3336 && (k2->op_flags & OPf_STACKED)
3337 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3338 expr = newUNOP(OP_DEFINED, 0, expr);
3342 if (k1->op_type == OP_READDIR
3343 || k1->op_type == OP_GLOB
3344 || k1->op_type == OP_EACH)
3345 expr = newUNOP(OP_DEFINED, 0, expr);
3351 block = newOP(OP_NULL, 0);
3354 next = LINKLIST(cont);
3356 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3357 if ((line_t)whileline != NOLINE) {
3358 PL_copline = whileline;
3359 cont = append_elem(OP_LINESEQ, cont,
3360 newSTATEOP(0, Nullch, Nullop));
3364 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3365 redo = LINKLIST(listop);
3368 PL_copline = whileline;
3370 o = new_logop(OP_AND, 0, &expr, &listop);
3371 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3372 op_free(expr); /* oops, it's a while (0) */
3374 return Nullop; /* listop already freed by new_logop */
3377 ((LISTOP*)listop)->op_last->op_next = condop =
3378 (o == listop ? redo : LINKLIST(o));
3386 Newz(1101,loop,1,LOOP);
3387 loop->op_type = OP_ENTERLOOP;
3388 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3389 loop->op_private = 0;
3390 loop->op_next = (OP*)loop;
3393 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3395 loop->op_redoop = redo;
3396 loop->op_lastop = o;
3399 loop->op_nextop = next;
3401 loop->op_nextop = o;
3403 o->op_flags |= flags;
3404 o->op_private |= (flags >> 8);
3409 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3417 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3418 sv->op_type = OP_RV2GV;
3419 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3421 else if (sv->op_type == OP_PADSV) { /* private variable */
3422 padoff = sv->op_targ;
3426 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3427 padoff = sv->op_targ;
3428 iterflags |= OPf_SPECIAL;
3433 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3437 padoff = find_threadsv("_");
3438 iterflags |= OPf_SPECIAL;
3440 sv = newGVOP(OP_GV, 0, PL_defgv);
3443 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3444 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3445 iterflags |= OPf_STACKED;
3447 else if (expr->op_type == OP_NULL &&
3448 (expr->op_flags & OPf_KIDS) &&
3449 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3451 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3452 * set the STACKED flag to indicate that these values are to be
3453 * treated as min/max values by 'pp_iterinit'.
3455 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3456 CONDOP* range = (CONDOP*) flip->op_first;
3457 OP* left = range->op_first;
3458 OP* right = left->op_sibling;
3461 range->op_flags &= ~OPf_KIDS;
3462 range->op_first = Nullop;
3464 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3465 listop->op_first->op_next = range->op_true;
3466 left->op_next = range->op_false;
3467 right->op_next = (OP*)listop;
3468 listop->op_next = listop->op_first;
3471 expr = (OP*)(listop);
3473 iterflags |= OPf_STACKED;
3476 expr = mod(force_list(expr), OP_GREPSTART);
3480 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3481 append_elem(OP_LIST, expr, scalar(sv))));
3482 assert(!loop->op_next);
3483 Renew(loop, 1, LOOP);
3484 loop->op_targ = padoff;
3485 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3486 PL_copline = forline;
3487 return newSTATEOP(0, label, wop);
3491 newLOOPEX(I32 type, OP *label)
3497 if (type != OP_GOTO || label->op_type == OP_CONST) {
3498 /* "last()" means "last" */
3499 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3500 o = newOP(type, OPf_SPECIAL);
3502 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3503 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3509 if (label->op_type == OP_ENTERSUB)
3510 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3511 o = newUNOP(type, OPf_STACKED, label);
3513 PL_hints |= HINT_BLOCK_SCOPE;
3523 MUTEX_DESTROY(CvMUTEXP(cv));
3524 Safefree(CvMUTEXP(cv));
3527 #endif /* USE_THREADS */
3529 if (!CvXSUB(cv) && CvROOT(cv)) {
3531 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3532 croak("Can't undef active subroutine");
3535 croak("Can't undef active subroutine");
3536 #endif /* USE_THREADS */
3539 SAVESPTR(PL_curpad);
3543 op_free(CvROOT(cv));
3544 CvROOT(cv) = Nullop;
3547 SvPOK_off((SV*)cv); /* forget prototype */
3549 SvREFCNT_dec(CvGV(cv));
3551 SvREFCNT_dec(CvOUTSIDE(cv));
3552 CvOUTSIDE(cv) = Nullcv;
3553 if (CvPADLIST(cv)) {
3554 /* may be during global destruction */
3555 if (SvREFCNT(CvPADLIST(cv))) {
3556 I32 i = AvFILLp(CvPADLIST(cv));
3558 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3559 SV* sv = svp ? *svp : Nullsv;
3562 if (sv == (SV*)PL_comppad_name)
3563 PL_comppad_name = Nullav;
3564 else if (sv == (SV*)PL_comppad) {
3565 PL_comppad = Nullav;
3566 PL_curpad = Null(SV**);
3570 SvREFCNT_dec((SV*)CvPADLIST(cv));
3572 CvPADLIST(cv) = Nullav;
3576 #ifdef DEBUG_CLOSURES
3581 CV *outside = CvOUTSIDE(cv);
3582 AV* padlist = CvPADLIST(cv);
3589 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3591 (CvANON(cv) ? "ANON"
3592 : (cv == PL_main_cv) ? "MAIN"
3593 : CvUNIQUE(cv) ? "UNIQUE"
3594 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3597 : CvANON(outside) ? "ANON"
3598 : (outside == PL_main_cv) ? "MAIN"
3599 : CvUNIQUE(outside) ? "UNIQUE"
3600 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3605 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3606 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3607 pname = AvARRAY(pad_name);
3608 ppad = AvARRAY(pad);
3610 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3611 if (SvPOK(pname[ix]))
3612 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3614 SvFAKE(pname[ix]) ? "FAKE " : "",
3616 (long)I_32(SvNVX(pname[ix])),
3617 (long)SvIVX(pname[ix]));
3620 #endif /* DEBUG_CLOSURES */
3623 cv_clone2(CV *proto, CV *outside)
3628 AV* protopadlist = CvPADLIST(proto);
3629 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3630 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3631 SV** pname = AvARRAY(protopad_name);
3632 SV** ppad = AvARRAY(protopad);
3633 I32 fname = AvFILLp(protopad_name);
3634 I32 fpad = AvFILLp(protopad);
3638 assert(!CvUNIQUE(proto));
3641 SAVESPTR(PL_curpad);
3642 SAVESPTR(PL_comppad);
3643 SAVESPTR(PL_comppad_name);
3644 SAVESPTR(PL_compcv);
3646 cv = PL_compcv = (CV*)NEWSV(1104,0);
3647 sv_upgrade((SV *)cv, SvTYPE(proto));
3653 New(666, CvMUTEXP(cv), 1, perl_mutex);
3654 MUTEX_INIT(CvMUTEXP(cv));
3656 #endif /* USE_THREADS */
3657 CvFILEGV(cv) = CvFILEGV(proto);
3658 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3659 CvSTASH(cv) = CvSTASH(proto);
3660 CvROOT(cv) = CvROOT(proto);
3661 CvSTART(cv) = CvSTART(proto);
3663 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3666 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3668 PL_comppad_name = newAV();
3669 for (ix = fname; ix >= 0; ix--)
3670 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3672 PL_comppad = newAV();
3674 comppadlist = newAV();
3675 AvREAL_off(comppadlist);
3676 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3677 av_store(comppadlist, 1, (SV*)PL_comppad);
3678 CvPADLIST(cv) = comppadlist;
3679 av_fill(PL_comppad, AvFILLp(protopad));
3680 PL_curpad = AvARRAY(PL_comppad);
3682 av = newAV(); /* will be @_ */
3684 av_store(PL_comppad, 0, (SV*)av);
3685 AvFLAGS(av) = AVf_REIFY;
3687 for (ix = fpad; ix > 0; ix--) {
3688 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3689 if (namesv && namesv != &PL_sv_undef) {
3690 char *name = SvPVX(namesv); /* XXX */
3691 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3692 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3693 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3695 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3697 croak("panic: cv_clone: %s", name);
3699 else { /* our own lexical */
3702 /* anon code -- we'll come back for it */
3703 sv = SvREFCNT_inc(ppad[ix]);
3705 else if (*name == '@')
3707 else if (*name == '%')
3717 SV* sv = NEWSV(0,0);
3723 /* Now that vars are all in place, clone nested closures. */
3725 for (ix = fpad; ix > 0; ix--) {
3726 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3728 && namesv != &PL_sv_undef
3729 && !(SvFLAGS(namesv) & SVf_FAKE)
3730 && *SvPVX(namesv) == '&'
3731 && CvCLONE(ppad[ix]))
3733 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3734 SvREFCNT_dec(ppad[ix]);
3737 PL_curpad[ix] = (SV*)kid;
3741 #ifdef DEBUG_CLOSURES
3742 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3744 PerlIO_printf(Perl_debug_log, " from:\n");
3746 PerlIO_printf(Perl_debug_log, " to:\n");
3758 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3759 cv = cv_clone2(proto, CvOUTSIDE(proto));
3760 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3765 cv_ckproto(CV *cv, GV *gv, char *p)
3767 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3768 SV* msg = sv_newmortal();
3772 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3773 sv_setpv(msg, "Prototype mismatch:");
3775 sv_catpvf(msg, " sub %_", name);
3777 sv_catpvf(msg, " (%s)", SvPVX(cv));
3778 sv_catpv(msg, " vs ");
3780 sv_catpvf(msg, "(%s)", p);
3782 sv_catpv(msg, "none");
3790 if (!cv || !SvPOK(cv) || SvCUR(cv))
3792 return op_const_sv(CvSTART(cv), cv);
3796 op_const_sv(OP *o, CV *cv)
3803 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3804 o = cLISTOPo->op_first->op_sibling;
3806 for (; o; o = o->op_next) {
3807 OPCODE type = o->op_type;
3809 if(sv && o->op_next == o)
3811 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3813 if (type == OP_LEAVESUB || type == OP_RETURN)
3817 if (type == OP_CONST)
3819 else if (type == OP_PADSV && cv) {
3820 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3821 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3822 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3834 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3838 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3839 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3840 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3841 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3850 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3851 maximum a prototype before. */
3852 if (SvTYPE(gv) > SVt_NULL) {
3853 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3854 warn("Runaway prototype");
3855 cv_ckproto((CV*)gv, NULL, ps);
3858 sv_setpv((SV*)gv, ps);
3860 sv_setiv((SV*)gv, -1);
3861 SvREFCNT_dec(PL_compcv);
3862 cv = PL_compcv = NULL;
3863 PL_sub_generation++;
3867 if (!name || GvCVGEN(gv))
3869 else if (cv = GvCV(gv)) {
3870 cv_ckproto(cv, gv, ps);
3871 /* already defined (or promised)? */
3872 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3874 bool const_changed = TRUE;
3876 /* just a "sub foo;" when &foo is already defined */
3877 SAVEFREESV(PL_compcv);
3880 /* ahem, death to those who redefine active sort subs */
3881 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3882 croak("Can't redefine active sort subroutine %s", name);
3883 if(const_sv = cv_const_sv(cv))
3884 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3885 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3886 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3887 && HvNAME(GvSTASH(CvGV(cv)))
3888 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3890 line_t oldline = PL_curcop->cop_line;
3891 PL_curcop->cop_line = PL_copline;
3892 warner(WARN_REDEFINE,
3893 const_sv ? "Constant subroutine %s redefined"
3894 : "Subroutine %s redefined", name);
3895 PL_curcop->cop_line = oldline;
3901 if (cv) { /* must reuse cv if autoloaded */
3903 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3904 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3905 CvOUTSIDE(PL_compcv) = 0;
3906 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3907 CvPADLIST(PL_compcv) = 0;
3908 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3909 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3910 SvREFCNT_dec(PL_compcv);
3917 PL_sub_generation++;
3920 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3921 CvFILEGV(cv) = PL_curcop->cop_filegv;
3922 CvSTASH(cv) = PL_curstash;
3925 if (!CvMUTEXP(cv)) {
3926 New(666, CvMUTEXP(cv), 1, perl_mutex);
3927 MUTEX_INIT(CvMUTEXP(cv));
3929 #endif /* USE_THREADS */
3932 sv_setpv((SV*)cv, ps);
3934 if (PL_error_count) {
3938 char *s = strrchr(name, ':');
3940 if (strEQ(s, "BEGIN")) {
3942 "BEGIN not safe after errors--compilation aborted";
3946 /* force display of errors found but not reported */
3947 sv_catpv(ERRSV, not_safe);
3948 croak("%s", SvPVx(ERRSV, n_a));
3955 PL_copline = NOLINE;
3960 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3961 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3964 SV **namep = AvARRAY(PL_comppad_name);
3965 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3968 if (SvIMMORTAL(PL_curpad[ix]))
3971 * The only things that a clonable function needs in its
3972 * pad are references to outer lexicals and anonymous subs.
3973 * The rest are created anew during cloning.
3975 if (!((namesv = namep[ix]) != Nullsv &&
3976 namesv != &PL_sv_undef &&
3978 *SvPVX(namesv) == '&')))
3980 SvREFCNT_dec(PL_curpad[ix]);
3981 PL_curpad[ix] = Nullsv;
3986 AV *av = newAV(); /* Will be @_ */
3988 av_store(PL_comppad, 0, (SV*)av);
3989 AvFLAGS(av) = AVf_REIFY;
3991 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3992 if (SvIMMORTAL(PL_curpad[ix]))
3994 if (!SvPADMY(PL_curpad[ix]))
3995 SvPADTMP_on(PL_curpad[ix]);
3999 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4000 CvSTART(cv) = LINKLIST(CvROOT(cv));
4001 CvROOT(cv)->op_next = 0;
4007 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4008 SV *sv = NEWSV(0,0);
4009 SV *tmpstr = sv_newmortal();
4010 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4014 sv_setpvf(sv, "%_:%ld-%ld",
4015 GvSV(PL_curcop->cop_filegv),
4016 (long)PL_subline, (long)PL_curcop->cop_line);
4017 gv_efullname3(tmpstr, gv, Nullch);
4018 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4019 hv = GvHVn(db_postponed);
4020 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4021 && (cv = GvCV(db_postponed))) {
4026 perl_call_sv((SV*)cv, G_DISCARD);
4030 if ((s = strrchr(name,':')))
4034 if (strEQ(s, "BEGIN")) {
4035 I32 oldscope = PL_scopestack_ix;
4037 SAVESPTR(PL_compiling.cop_filegv);
4038 SAVEI16(PL_compiling.cop_line);
4040 sv_setsv(PL_rs, PL_nrs);
4043 PL_beginav = newAV();
4044 DEBUG_x( dump_sub(gv) );
4045 av_push(PL_beginav, (SV *)cv);
4047 call_list(oldscope, PL_beginav);
4049 PL_curcop = &PL_compiling;
4050 PL_compiling.op_private = PL_hints;
4053 else if (strEQ(s, "END") && !PL_error_count) {
4056 av_unshift(PL_endav, 1);
4057 av_store(PL_endav, 0, (SV *)cv);
4060 else if (strEQ(s, "INIT") && !PL_error_count) {
4062 PL_initav = newAV();
4063 av_push(PL_initav, SvREFCNT_inc(cv));
4069 PL_copline = NOLINE;
4074 /* XXX unsafe for threads if eval_owner isn't held */
4076 newCONSTSUB(HV *stash, char *name, SV *sv)
4079 U32 oldhints = PL_hints;
4080 HV *old_cop_stash = PL_curcop->cop_stash;
4081 HV *old_curstash = PL_curstash;
4082 line_t oldline = PL_curcop->cop_line;
4083 PL_curcop->cop_line = PL_copline;
4085 PL_hints &= ~HINT_BLOCK_SCOPE;
4087 PL_curstash = PL_curcop->cop_stash = stash;
4090 start_subparse(FALSE, 0),
4091 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4092 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4093 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4096 PL_hints = oldhints;
4097 PL_curcop->cop_stash = old_cop_stash;
4098 PL_curstash = old_curstash;
4099 PL_curcop->cop_line = oldline;
4103 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4106 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4109 if (cv = (name ? GvCV(gv) : Nullcv)) {
4111 /* just a cached method */
4115 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4116 /* already defined (or promised) */
4117 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4118 && HvNAME(GvSTASH(CvGV(cv)))
4119 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4120 line_t oldline = PL_curcop->cop_line;
4121 if (PL_copline != NOLINE)
4122 PL_curcop->cop_line = PL_copline;
4123 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4124 PL_curcop->cop_line = oldline;
4131 if (cv) /* must reuse cv if autoloaded */
4134 cv = (CV*)NEWSV(1105,0);
4135 sv_upgrade((SV *)cv, SVt_PVCV);
4139 PL_sub_generation++;
4142 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4144 New(666, CvMUTEXP(cv), 1, perl_mutex);
4145 MUTEX_INIT(CvMUTEXP(cv));
4147 #endif /* USE_THREADS */
4148 CvFILEGV(cv) = gv_fetchfile(filename);
4149 CvXSUB(cv) = subaddr;
4152 char *s = strrchr(name,':');
4157 if (strEQ(s, "BEGIN")) {
4159 PL_beginav = newAV();
4160 av_push(PL_beginav, (SV *)cv);
4163 else if (strEQ(s, "END")) {
4166 av_unshift(PL_endav, 1);
4167 av_store(PL_endav, 0, (SV *)cv);
4170 else if (strEQ(s, "INIT")) {
4172 PL_initav = newAV();
4173 av_push(PL_initav, (SV *)cv);
4184 newFORM(I32 floor, OP *o, OP *block)
4194 name = SvPVx(cSVOPo->op_sv, n_a);
4197 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4199 if (cv = GvFORM(gv)) {
4200 if (ckWARN(WARN_REDEFINE)) {
4201 line_t oldline = PL_curcop->cop_line;
4203 PL_curcop->cop_line = PL_copline;
4204 warner(WARN_REDEFINE, "Format %s redefined",name);
4205 PL_curcop->cop_line = oldline;
4211 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4212 CvFILEGV(cv) = PL_curcop->cop_filegv;
4214 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4215 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4216 SvPADTMP_on(PL_curpad[ix]);
4219 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4220 CvSTART(cv) = LINKLIST(CvROOT(cv));
4221 CvROOT(cv)->op_next = 0;
4224 PL_copline = NOLINE;
4231 return newUNOP(OP_REFGEN, 0,
4232 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4238 return newUNOP(OP_REFGEN, 0,
4239 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4243 newANONSUB(I32 floor, OP *proto, OP *block)
4245 return newUNOP(OP_REFGEN, 0,
4246 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4252 switch (o->op_type) {
4254 o->op_type = OP_PADAV;
4255 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4256 return ref(o, OP_RV2AV);
4259 o->op_type = OP_RV2AV;
4260 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4265 warn("oops: oopsAV");
4274 switch (o->op_type) {
4277 o->op_type = OP_PADHV;
4278 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4279 return ref(o, OP_RV2HV);
4283 o->op_type = OP_RV2HV;
4284 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4289 warn("oops: oopsHV");
4298 if (o->op_type == OP_PADANY) {
4299 o->op_type = OP_PADAV;
4300 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4303 return newUNOP(OP_RV2AV, 0, scalar(o));
4307 newGVREF(I32 type, OP *o)
4309 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4310 return newUNOP(OP_NULL, 0, o);
4311 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4317 if (o->op_type == OP_PADANY) {
4318 o->op_type = OP_PADHV;
4319 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4322 return newUNOP(OP_RV2HV, 0, scalar(o));
4328 croak("NOT IMPL LINE %d",__LINE__);
4334 newCVREF(I32 flags, OP *o)
4336 return newUNOP(OP_RV2CV, flags, scalar(o));
4342 if (o->op_type == OP_PADANY) {
4343 o->op_type = OP_PADSV;
4344 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4347 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4348 o->op_flags |= OPpDONE_SVREF;
4351 return newUNOP(OP_RV2SV, 0, scalar(o));
4354 /* Check routines. */
4362 name = NEWSV(1106,0);
4363 sv_upgrade(name, SVt_PVNV);
4364 sv_setpvn(name, "&", 1);
4367 ix = pad_alloc(o->op_type, SVs_PADMY);
4368 av_store(PL_comppad_name, ix, name);
4369 av_store(PL_comppad, ix, cSVOPo->op_sv);
4370 SvPADMY_on(cSVOPo->op_sv);
4371 cSVOPo->op_sv = Nullsv;
4372 cSVOPo->op_targ = ix;
4379 o->op_private = PL_hints;
4386 if (cUNOPo->op_first->op_type == OP_CONCAT)
4387 o->op_flags |= OPf_STACKED;
4394 if (o->op_flags & OPf_KIDS) {
4397 OPCODE type = o->op_type;
4398 o = modkids(ck_fun(o), type);
4399 kid = cUNOPo->op_first;
4400 newop = kUNOP->op_first->op_sibling;
4402 (newop->op_sibling ||
4403 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4404 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4405 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4409 op_free(kUNOP->op_first);
4410 kUNOP->op_first = newop;
4412 o->op_ppaddr = PL_ppaddr[++o->op_type];
4421 if (o->op_flags & OPf_KIDS) {
4422 OP *kid = cUNOPo->op_first;
4423 if (kid->op_type == OP_HSLICE)
4424 o->op_private |= OPpSLICE;
4425 else if (kid->op_type != OP_HELEM)
4426 croak("%s argument is not a HASH element or slice",
4427 PL_op_desc[o->op_type]);
4436 I32 type = o->op_type;
4438 if (o->op_flags & OPf_KIDS) {
4439 if (cLISTOPo->op_first->op_type == OP_STUB) {
4441 o = newUNOP(type, OPf_SPECIAL,
4442 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4452 PL_hints |= HINT_BLOCK_SCOPE;
4453 if (o->op_flags & OPf_KIDS) {
4454 SVOP *kid = (SVOP*)cUNOPo->op_first;
4457 o->op_flags &= ~OPf_KIDS;
4460 else if (kid->op_type == OP_LINESEQ) {
4463 kid->op_next = o->op_next;
4464 cUNOPo->op_first = 0;
4467 Newz(1101, enter, 1, LOGOP);
4468 enter->op_type = OP_ENTERTRY;
4469 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4470 enter->op_private = 0;
4472 /* establish postfix order */
4473 enter->op_next = (OP*)enter;
4475 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4476 o->op_type = OP_LEAVETRY;
4477 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4478 enter->op_other = o;
4486 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4488 o->op_targ = (PADOFFSET)PL_hints;
4496 if (o->op_flags & OPf_STACKED) {
4498 kid = cUNOPo->op_first->op_sibling;
4499 if (kid->op_type == OP_RV2GV)
4511 if (o->op_flags & OPf_KIDS) {
4512 OP *kid = cUNOPo->op_first;
4513 if (kid->op_type != OP_HELEM)
4514 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4522 ck_gvconst(register OP *o)
4524 o = fold_constants(o);
4525 if (o->op_type == OP_CONST)
4532 ck_rvconst(register OP *o)
4535 SVOP *kid = (SVOP*)cUNOPo->op_first;
4537 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4538 if (kid->op_type == OP_CONST) {
4542 SV *kidsv = kid->op_sv;
4545 /* Is it a constant from cv_const_sv()? */
4546 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4547 SV *rsv = SvRV(kidsv);
4548 int svtype = SvTYPE(rsv);
4549 char *badtype = Nullch;
4551 switch (o->op_type) {
4553 if (svtype > SVt_PVMG)
4554 badtype = "a SCALAR";
4557 if (svtype != SVt_PVAV)
4558 badtype = "an ARRAY";
4561 if (svtype != SVt_PVHV) {
4562 if (svtype == SVt_PVAV) { /* pseudohash? */
4563 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4564 if (ksv && SvROK(*ksv)
4565 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4574 if (svtype != SVt_PVCV)
4579 croak("Constant is not %s reference", badtype);
4582 name = SvPV(kidsv, n_a);
4583 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4584 char *badthing = Nullch;
4585 switch (o->op_type) {
4587 badthing = "a SCALAR";
4590 badthing = "an ARRAY";
4593 badthing = "a HASH";
4598 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4602 * This is a little tricky. We only want to add the symbol if we
4603 * didn't add it in the lexer. Otherwise we get duplicate strict
4604 * warnings. But if we didn't add it in the lexer, we must at
4605 * least pretend like we wanted to add it even if it existed before,
4606 * or we get possible typo warnings. OPpCONST_ENTERED says
4607 * whether the lexer already added THIS instance of this symbol.
4609 iscv = (o->op_type == OP_RV2CV) * 2;
4611 gv = gv_fetchpv(name,
4612 iscv | !(kid->op_private & OPpCONST_ENTERED),
4615 : o->op_type == OP_RV2SV
4617 : o->op_type == OP_RV2AV
4619 : o->op_type == OP_RV2HV
4622 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4624 kid->op_type = OP_GV;
4625 SvREFCNT_dec(kid->op_sv);
4626 kid->op_sv = SvREFCNT_inc(gv);
4636 I32 type = o->op_type;
4638 if (o->op_flags & OPf_REF)
4641 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4642 SVOP *kid = (SVOP*)cUNOPo->op_first;
4644 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4646 OP *newop = newGVOP(type, OPf_REF,
4647 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4654 if (type == OP_FTTTY)
4655 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4658 return newUNOP(type, 0, newDEFSVOP());
4671 int type = o->op_type;
4672 register I32 oa = PL_opargs[type] >> OASHIFT;
4674 if (o->op_flags & OPf_STACKED) {
4675 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4678 return no_fh_allowed(o);
4681 if (o->op_flags & OPf_KIDS) {
4683 tokid = &cLISTOPo->op_first;
4684 kid = cLISTOPo->op_first;
4685 if (kid->op_type == OP_PUSHMARK ||
4686 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4688 tokid = &kid->op_sibling;
4689 kid = kid->op_sibling;
4691 if (!kid && PL_opargs[type] & OA_DEFGV)
4692 *tokid = kid = newDEFSVOP();
4696 sibl = kid->op_sibling;
4699 /* list seen where single (scalar) arg expected? */
4700 if (numargs == 1 && !(oa >> 4)
4701 && kid->op_type == OP_LIST && type != OP_SCALAR)
4703 return too_many_arguments(o,PL_op_desc[type]);
4716 if (kid->op_type == OP_CONST &&
4717 (kid->op_private & OPpCONST_BARE))
4719 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4720 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4721 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4722 if (ckWARN(WARN_SYNTAX))
4724 "Array @%s missing the @ in argument %ld of %s()",
4725 name, (long)numargs, PL_op_desc[type]);
4728 kid->op_sibling = sibl;
4731 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4732 bad_type(numargs, "array", PL_op_desc[type], kid);
4736 if (kid->op_type == OP_CONST &&
4737 (kid->op_private & OPpCONST_BARE))
4739 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4740 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4741 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4742 if (ckWARN(WARN_SYNTAX))
4744 "Hash %%%s missing the %% in argument %ld of %s()",
4745 name, (long)numargs, PL_op_desc[type]);
4748 kid->op_sibling = sibl;
4751 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4752 bad_type(numargs, "hash", PL_op_desc[type], kid);
4757 OP *newop = newUNOP(OP_NULL, 0, kid);
4758 kid->op_sibling = 0;
4760 newop->op_next = newop;
4762 kid->op_sibling = sibl;
4767 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4768 if (kid->op_type == OP_CONST &&
4769 (kid->op_private & OPpCONST_BARE))
4771 OP *newop = newGVOP(OP_GV, 0,
4772 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4777 else if (kid->op_type == OP_READLINE) {
4778 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4779 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4782 I32 flags = OPf_SPECIAL;
4784 /* is this op a FH constructor? */
4785 if (is_handle_constructor(o,numargs)) {
4787 /* Set a flag to tell rv2gv to vivify
4788 * need to "prove" flag does not mean something
4789 * else already - NI-S 1999/05/07
4793 /* Helps with open($array[$n],...)
4794 but is too simplistic - need to do selectively
4799 kid->op_sibling = 0;
4800 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4802 kid->op_private |= private;
4805 kid->op_sibling = sibl;
4811 mod(scalar(kid), type);
4815 tokid = &kid->op_sibling;
4816 kid = kid->op_sibling;
4818 o->op_private |= numargs;
4820 return too_many_arguments(o,PL_op_desc[o->op_type]);
4823 else if (PL_opargs[type] & OA_DEFGV) {
4825 return newUNOP(type, 0, newDEFSVOP());
4829 while (oa & OA_OPTIONAL)
4831 if (oa && oa != OA_LIST)
4832 return too_few_arguments(o,PL_op_desc[o->op_type]);
4842 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4843 append_elem(OP_GLOB, o, newDEFSVOP());
4845 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4846 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4848 if (gv && GvIMPORTED_CV(gv)) {
4849 append_elem(OP_GLOB, o,
4850 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4851 o->op_type = OP_LIST;
4852 o->op_ppaddr = PL_ppaddr[OP_LIST];
4853 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4854 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4855 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4856 append_elem(OP_LIST, o,
4857 scalar(newUNOP(OP_RV2CV, 0,
4858 newGVOP(OP_GV, 0, gv)))));
4859 o = newUNOP(OP_NULL, 0, ck_subr(o));
4860 o->op_targ = OP_GLOB; /* hint at what it used to be */
4863 gv = newGVgen("main");
4865 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4875 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4877 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4878 Newz(1101, gwop, 1, LOGOP);
4880 if (o->op_flags & OPf_STACKED) {
4883 kid = cLISTOPo->op_first->op_sibling;
4884 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4887 kid->op_next = (OP*)gwop;
4888 o->op_flags &= ~OPf_STACKED;
4890 kid = cLISTOPo->op_first->op_sibling;
4891 if (type == OP_MAPWHILE)
4898 kid = cLISTOPo->op_first->op_sibling;
4899 if (kid->op_type != OP_NULL)
4900 croak("panic: ck_grep");
4901 kid = kUNOP->op_first;
4903 gwop->op_type = type;
4904 gwop->op_ppaddr = PL_ppaddr[type];
4905 gwop->op_first = listkids(o);
4906 gwop->op_flags |= OPf_KIDS;
4907 gwop->op_private = 1;
4908 gwop->op_other = LINKLIST(kid);
4909 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4910 kid->op_next = (OP*)gwop;
4912 kid = cLISTOPo->op_first->op_sibling;
4913 if (!kid || !kid->op_sibling)
4914 return too_few_arguments(o,PL_op_desc[o->op_type]);
4915 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4916 mod(kid, OP_GREPSTART);
4924 if (o->op_flags & OPf_KIDS) {
4925 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4927 kid = kid->op_sibling; /* get past "big" */
4928 if (kid && kid->op_type == OP_CONST)
4929 fbm_compile(((SVOP*)kid)->op_sv, 0);
4935 ck_lengthconst(OP *o)
4937 /* XXX length optimization goes here */
4944 OPCODE type = o->op_type;
4945 return modkids(ck_fun(o), type);
4951 OPCODE type = o->op_type;
4952 return refkids(ck_fun(o), type);
4960 kid = cLISTOPo->op_first;
4963 kid = cLISTOPo->op_first;
4965 if (kid->op_type == OP_PUSHMARK)
4966 kid = kid->op_sibling;
4967 if (kid && o->op_flags & OPf_STACKED)
4968 kid = kid->op_sibling;
4969 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4970 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4971 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4972 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4973 cLISTOPo->op_first->op_sibling = kid;
4974 cLISTOPo->op_last = kid;
4975 kid = kid->op_sibling;
4980 append_elem(o->op_type, o, newDEFSVOP());
4986 if (PL_hints & HINT_LOCALE)
4987 o->op_private |= OPpLOCALE;
4994 ck_fun_locale(OP *o)
5000 if (PL_hints & HINT_LOCALE)
5001 o->op_private |= OPpLOCALE;
5012 if (PL_hints & HINT_LOCALE)
5013 o->op_private |= OPpLOCALE;
5022 o->op_private |= OPpRUNTIME;
5035 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5036 o->op_private |= OPpREPEAT_DOLIST;
5037 cBINOPo->op_first = force_list(cBINOPo->op_first);
5047 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5048 SVOP *kid = (SVOP*)cUNOPo->op_first;
5050 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5052 for (s = SvPVX(kid->op_sv); *s; s++) {
5053 if (*s == ':' && s[1] == ':') {
5055 Move(s+2, s+1, strlen(s+2)+1, char);
5056 --SvCUR(kid->op_sv);
5059 sv_catpvn(kid->op_sv, ".pm", 3);
5069 croak("NOT IMPL LINE %d",__LINE__);
5079 if (o->op_flags & OPf_KIDS) {
5080 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5081 if (kid && kid->op_sibling) {
5082 o->op_type = OP_SSELECT;
5083 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5085 return fold_constants(o);
5089 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5090 if (kid && kid->op_type == OP_RV2GV)
5091 kid->op_private &= ~HINT_STRICT_REFS;
5098 I32 type = o->op_type;
5100 if (!(o->op_flags & OPf_KIDS)) {
5105 if (!CvUNIQUE(PL_compcv)) {
5106 argop = newOP(OP_PADAV, OPf_REF);
5107 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5110 argop = newUNOP(OP_RV2AV, 0,
5111 scalar(newGVOP(OP_GV, 0,
5112 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5115 argop = newUNOP(OP_RV2AV, 0,
5116 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5117 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5118 #endif /* USE_THREADS */
5119 return newUNOP(type, 0, scalar(argop));
5121 return scalar(modkids(ck_fun(o), type));
5129 if (PL_hints & HINT_LOCALE)
5130 o->op_private |= OPpLOCALE;
5133 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5135 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5136 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5138 kid = kUNOP->op_first; /* get past null */
5140 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5142 if (kid->op_type == OP_SCOPE) {
5146 else if (kid->op_type == OP_LEAVE) {
5147 if (o->op_type == OP_SORT) {
5148 null(kid); /* wipe out leave */
5151 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5152 if (k->op_next == kid)
5157 kid->op_next = 0; /* just disconnect the leave */
5158 k = kLISTOP->op_first;
5162 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5163 if (o->op_type == OP_SORT)
5167 o->op_flags |= OPf_SPECIAL;
5169 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5170 null(cLISTOPo->op_first->op_sibling);
5177 simplify_sort(OP *o)
5180 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5183 if (!(o->op_flags & OPf_STACKED))
5185 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5186 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5187 kid = kUNOP->op_first; /* get past null */
5188 if (kid->op_type != OP_SCOPE)
5190 kid = kLISTOP->op_last; /* get past scope */
5191 switch(kid->op_type) {
5199 k = kid; /* remember this node*/
5200 if (kBINOP->op_first->op_type != OP_RV2SV)
5202 kid = kBINOP->op_first; /* get past cmp */
5203 if (kUNOP->op_first->op_type != OP_GV)
5205 kid = kUNOP->op_first; /* get past rv2sv */
5206 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5208 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5210 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5214 kid = k; /* back to cmp */
5215 if (kBINOP->op_last->op_type != OP_RV2SV)
5217 kid = kBINOP->op_last; /* down to 2nd arg */
5218 if (kUNOP->op_first->op_type != OP_GV)
5220 kid = kUNOP->op_first; /* get past rv2sv */
5221 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5223 ? strNE(GvNAME(kGVOP->op_gv), "a")
5224 : strNE(GvNAME(kGVOP->op_gv), "b")))
5226 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5228 o->op_private |= OPpSORT_REVERSE;
5229 if (k->op_type == OP_NCMP)
5230 o->op_private |= OPpSORT_NUMERIC;
5231 if (k->op_type == OP_I_NCMP)
5232 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5233 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5234 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5235 cLISTOPo->op_children = 1;
5243 if (o->op_flags & OPf_STACKED)
5244 return no_fh_allowed(o);
5246 kid = cLISTOPo->op_first;
5247 if (kid->op_type != OP_NULL)
5248 croak("panic: ck_split");
5249 kid = kid->op_sibling;
5250 op_free(cLISTOPo->op_first);
5251 cLISTOPo->op_first = kid;
5253 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5254 cLISTOPo->op_last = kid; /* There was only one element previously */
5257 if (kid->op_type != OP_MATCH) {
5258 OP *sibl = kid->op_sibling;
5259 kid->op_sibling = 0;
5260 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5261 if (cLISTOPo->op_first == cLISTOPo->op_last)
5262 cLISTOPo->op_last = kid;
5263 cLISTOPo->op_first = kid;
5264 kid->op_sibling = sibl;
5267 kid->op_type = OP_PUSHRE;
5268 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5271 if (!kid->op_sibling)
5272 append_elem(OP_SPLIT, o, newDEFSVOP());
5274 kid = kid->op_sibling;
5277 if (!kid->op_sibling)
5278 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5280 kid = kid->op_sibling;
5283 if (kid->op_sibling)
5284 return too_many_arguments(o,PL_op_desc[o->op_type]);
5293 OP *prev = ((cUNOPo->op_first->op_sibling)
5294 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5295 OP *o2 = prev->op_sibling;
5304 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5305 if (cvop->op_type == OP_RV2CV) {
5307 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5308 null(cvop); /* disable rv2cv */
5309 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5310 if (tmpop->op_type == OP_GV) {
5311 cv = GvCVu(tmpop->op_sv);
5312 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5313 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5314 proto = SvPV((SV*)cv, n_a);
5318 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5319 if (PERLDB_SUB && PL_curstash != PL_debstash)
5320 o->op_private |= OPpENTERSUB_DB;
5321 while (o2 != cvop) {
5325 return too_many_arguments(o, gv_ename(namegv));
5343 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5344 bad_type(arg, "block", gv_ename(namegv), o2);
5347 /* '*' allows any scalar type, including bareword */
5350 if (o2->op_type == OP_RV2GV)
5351 goto wrapref; /* autoconvert GLOB -> GLOBref */
5359 if (o2->op_type != OP_RV2GV)
5360 bad_type(arg, "symbol", gv_ename(namegv), o2);
5363 if (o2->op_type != OP_RV2CV)
5364 bad_type(arg, "sub", gv_ename(namegv), o2);
5367 if (o2->op_type != OP_RV2SV
5368 && o2->op_type != OP_PADSV
5369 && o2->op_type != OP_THREADSV)
5371 bad_type(arg, "scalar", gv_ename(namegv), o2);
5375 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5376 bad_type(arg, "array", gv_ename(namegv), o2);
5379 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5380 bad_type(arg, "hash", gv_ename(namegv), o2);
5384 OP* sib = kid->op_sibling;
5385 kid->op_sibling = 0;
5386 o2 = newUNOP(OP_REFGEN, 0, kid);
5387 o2->op_sibling = sib;
5388 prev->op_sibling = o2;
5399 croak("Malformed prototype for %s: %s",
5400 gv_ename(namegv), SvPV((SV*)cv, n_a));
5405 mod(o2, OP_ENTERSUB);
5407 o2 = o2->op_sibling;
5409 if (proto && !optional &&
5410 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5411 return too_few_arguments(o, gv_ename(namegv));
5418 SvREADONLY_on(cSVOPo->op_sv);
5425 if (o->op_flags & OPf_KIDS) {
5426 SVOP *kid = (SVOP*)cUNOPo->op_first;
5428 if (kid->op_type == OP_NULL)
5429 kid = (SVOP*)kid->op_sibling;
5431 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5432 o->op_flags |= OPf_SPECIAL;
5437 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5440 peep(register OP *o)
5443 register OP* oldop = 0;
5446 if (!o || o->op_seq)
5450 SAVESPTR(PL_curcop);
5451 for (; o; o = o->op_next) {
5457 switch (o->op_type) {
5460 PL_curcop = ((COP*)o); /* for warnings */
5461 o->op_seq = PL_op_seqmax++;
5472 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5474 o->op_seq = PL_op_seqmax++;
5477 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5478 o->op_seq = PL_op_seqmax++;
5479 break; /* Scalar stub must produce undef. List stub is noop */
5483 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5484 PL_curcop = ((COP*)o);
5490 if (oldop && o->op_next) {
5491 oldop->op_next = o->op_next;
5494 o->op_seq = PL_op_seqmax++;
5498 if (o->op_next->op_type == OP_RV2SV) {
5499 if (!(o->op_next->op_private & OPpDEREF)) {
5501 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5502 o->op_next = o->op_next->op_next;
5503 o->op_type = OP_GVSV;
5504 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5507 else if (o->op_next->op_type == OP_RV2AV) {
5508 OP* pop = o->op_next->op_next;
5510 if (pop->op_type == OP_CONST &&
5511 (PL_op = pop->op_next) &&
5512 pop->op_next->op_type == OP_AELEM &&
5513 !(pop->op_next->op_private &
5514 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5515 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5519 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5523 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5524 o->op_next = pop->op_next->op_next;
5525 o->op_type = OP_AELEMFAST;
5526 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5527 o->op_private = (U8)i;
5528 GvAVn(((GVOP*)o)->op_gv);
5531 o->op_seq = PL_op_seqmax++;
5538 o->op_seq = PL_op_seqmax++;
5539 while (cLOGOP->op_other->op_type == OP_NULL)
5540 cLOGOP->op_other = cLOGOP->op_other->op_next;
5541 peep(cLOGOP->op_other);
5545 o->op_seq = PL_op_seqmax++;
5546 peep(cCONDOP->op_true);
5547 peep(cCONDOP->op_false);
5551 o->op_seq = PL_op_seqmax++;
5552 peep(cLOOP->op_redoop);
5553 peep(cLOOP->op_nextop);
5554 peep(cLOOP->op_lastop);
5560 o->op_seq = PL_op_seqmax++;
5561 peep(cPMOP->op_pmreplstart);
5565 o->op_seq = PL_op_seqmax++;
5566 if (ckWARN(WARN_SYNTAX) && o->op_next
5567 && o->op_next->op_type == OP_NEXTSTATE) {
5568 if (o->op_next->op_sibling &&
5569 o->op_next->op_sibling->op_type != OP_EXIT &&
5570 o->op_next->op_sibling->op_type != OP_WARN &&
5571 o->op_next->op_sibling->op_type != OP_DIE) {
5572 line_t oldline = PL_curcop->cop_line;
5574 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5575 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5576 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5577 PL_curcop->cop_line = oldline;
5591 if ((o->op_private & (OPpLVAL_INTRO))
5592 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5594 rop = (UNOP*)((BINOP*)o)->op_first;
5595 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5597 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5598 if (!SvOBJECT(lexname))
5600 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5601 if (!fields || !GvHV(*fields))
5603 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5604 key = SvPV(*svp, keylen);
5605 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5607 croak("No such field \"%s\" in variable %s of type %s",
5608 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5610 ind = SvIV(*indsvp);
5612 croak("Bad index while coercing array into hash");
5613 rop->op_type = OP_RV2AV;
5614 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5615 o->op_type = OP_AELEM;
5616 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5618 *svp = newSViv(ind);
5623 o->op_seq = PL_op_seqmax++;