3 * Copyright (c) 1991-1997, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
22 #define CHECKCALL this->*PL_check
24 #define CHECKCALL *PL_check
28 * In the following definition, the ", Nullop" is just to make the compiler
29 * think the expression is of the right type: croak actually does a Siglongjmp.
31 #define CHECKOP(type,o) \
32 ((PL_op_mask && PL_op_mask[type]) \
33 ? ( op_free((OP*)o), \
34 croak("%s trapped by operation mask", PL_op_desc[type]), \
36 : (CHECKCALL[type])((OP*)o))
38 #define PAD_MAX 999999999
40 static bool scalar_mod_type _((OP *o, I32 type));
42 static I32 list_assignment _((OP *o));
43 static void bad_type _((I32 n, char *t, char *name, OP *kid));
44 static OP *modkids _((OP *o, I32 type));
45 static OP *no_fh_allowed _((OP *o));
46 static OP *scalarboolean _((OP *o));
47 static OP *too_few_arguments _((OP *o, char* name));
48 static OP *too_many_arguments _((OP *o, char* name));
49 static void null _((OP* o));
50 static PADOFFSET pad_findlex _((char* name, PADOFFSET newoff, U32 seq,
51 CV* startcv, I32 cx_ix, I32 saweval));
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])) {
133 name[2] = toCTRL(name[1]);
136 croak("Can't use global %s in \"my\"",name);
138 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
139 SV **svp = AvARRAY(PL_comppad_name);
140 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
142 && sv != &PL_sv_undef
143 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
144 && strEQ(name, SvPVX(sv)))
147 "\"my\" variable %s masks earlier declaration in same %s",
148 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
153 off = pad_alloc(OP_PADSV, SVs_PADMY);
155 sv_upgrade(sv, SVt_PVNV);
157 if (PL_in_my_stash) {
159 croak("Can't declare class for non-scalar %s in \"my\"",name);
161 (void)SvUPGRADE(sv, SVt_PVMG);
162 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
165 av_store(PL_comppad_name, off, sv);
166 SvNVX(sv) = (double)PAD_MAX;
167 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
168 if (!PL_min_intro_pending)
169 PL_min_intro_pending = off;
170 PL_max_intro_pending = off;
172 av_store(PL_comppad, off, (SV*)newAV());
173 else if (*name == '%')
174 av_store(PL_comppad, off, (SV*)newHV());
175 SvPADMY_on(PL_curpad[off]);
180 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
187 register PERL_CONTEXT *cx;
189 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
190 AV *curlist = CvPADLIST(cv);
191 SV **svp = av_fetch(curlist, 0, FALSE);
194 if (!svp || *svp == &PL_sv_undef)
197 svp = AvARRAY(curname);
198 for (off = AvFILLp(curname); off > 0; off--) {
199 if ((sv = svp[off]) &&
200 sv != &PL_sv_undef &&
202 seq > I_32(SvNVX(sv)) &&
203 strEQ(SvPVX(sv), name))
214 return 0; /* don't clone from inactive stack frame */
218 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
219 oldsv = *av_fetch(oldpad, off, TRUE);
220 if (!newoff) { /* Not a mere clone operation. */
221 SV *namesv = NEWSV(1103,0);
222 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
223 sv_upgrade(namesv, SVt_PVNV);
224 sv_setpv(namesv, name);
225 av_store(PL_comppad_name, newoff, namesv);
226 SvNVX(namesv) = (double)PL_curcop->cop_seq;
227 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
228 SvFAKE_on(namesv); /* A ref, not a real var */
229 if (SvOBJECT(sv)) { /* A typed var */
231 (void)SvUPGRADE(namesv, SVt_PVMG);
232 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
235 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
236 /* "It's closures all the way down." */
237 CvCLONE_on(PL_compcv);
239 if (CvANON(PL_compcv))
240 oldsv = Nullsv; /* no need to keep ref */
245 bcv && bcv != cv && !CvCLONE(bcv);
246 bcv = CvOUTSIDE(bcv))
251 if (ckWARN(WARN_CLOSURE)
252 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
255 "Variable \"%s\" may be unavailable",
263 else if (!CvUNIQUE(PL_compcv)) {
264 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
266 "Variable \"%s\" will not stay shared", name);
269 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
275 /* Nothing in current lexical context--try eval's context, if any.
276 * This is necessary to let the perldb get at lexically scoped variables.
277 * XXX This will also probably interact badly with eval tree caching.
280 for (i = cx_ix; i >= 0; i--) {
282 switch (CxTYPE(cx)) {
284 if (i == 0 && saweval) {
285 seq = cxstack[saweval].blk_oldcop->cop_seq;
286 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
290 switch (cx->blk_eval.old_op_type) {
296 /* require must have its own scope */
304 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
305 saweval = i; /* so we know where we were called from */
308 seq = cxstack[saweval].blk_oldcop->cop_seq;
309 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
317 pad_findmy(char *name)
323 SV **svp = AvARRAY(PL_comppad_name);
324 U32 seq = PL_cop_seqmax;
330 * Special case to get lexical (and hence per-thread) @_.
331 * XXX I need to find out how to tell at parse-time whether use
332 * of @_ should refer to a lexical (from a sub) or defgv (global
333 * scope and maybe weird sub-ish things like formats). See
334 * startsub in perly.y. It's possible that @_ could be lexical
335 * (at least from subs) even in non-threaded perl.
337 if (strEQ(name, "@_"))
338 return 0; /* success. (NOT_IN_PAD indicates failure) */
339 #endif /* USE_THREADS */
341 /* The one we're looking for is probably just before comppad_name_fill. */
342 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
343 if ((sv = svp[off]) &&
344 sv != &PL_sv_undef &&
347 seq > I_32(SvNVX(sv)))) &&
348 strEQ(SvPVX(sv), name))
351 return (PADOFFSET)off;
352 pendoff = off; /* this pending def. will override import */
356 outside = CvOUTSIDE(PL_compcv);
358 /* Check if if we're compiling an eval'', and adjust seq to be the
359 * eval's seq number. This depends on eval'' having a non-null
360 * CvOUTSIDE() while it is being compiled. The eval'' itself is
361 * identified by CvUNIQUE being set and CvGV being null. */
362 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
363 cx = &cxstack[cxstack_ix];
365 seq = cx->blk_oldcop->cop_seq;
368 /* See if it's in a nested scope */
369 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
371 /* If there is a pending local definition, this new alias must die */
373 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
374 return off; /* pad_findlex returns 0 for failure...*/
376 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
380 pad_leavemy(I32 fill)
383 SV **svp = AvARRAY(PL_comppad_name);
385 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
386 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
387 if ((sv = svp[off]) && sv != &PL_sv_undef)
388 warn("%s never introduced", SvPVX(sv));
391 /* "Deintroduce" my variables that are leaving with this scope. */
392 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
393 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
394 SvIVX(sv) = PL_cop_seqmax;
399 pad_alloc(I32 optype, U32 tmptype)
405 if (AvARRAY(PL_comppad) != PL_curpad)
406 croak("panic: pad_alloc");
407 if (PL_pad_reset_pending)
409 if (tmptype & SVs_PADMY) {
411 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
412 } while (SvPADBUSY(sv)); /* need a fresh one */
413 retval = AvFILLp(PL_comppad);
416 SV **names = AvARRAY(PL_comppad_name);
417 SSize_t names_fill = AvFILLp(PL_comppad_name);
420 * "foreach" index vars temporarily become aliases to non-"my"
421 * values. Thus we must skip, not just pad values that are
422 * marked as current pad values, but also those with names.
424 if (++PL_padix <= names_fill &&
425 (sv = names[PL_padix]) && sv != &PL_sv_undef)
427 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
428 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
433 SvFLAGS(sv) |= tmptype;
434 PL_curpad = AvARRAY(PL_comppad);
436 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
437 (unsigned long) thr, (unsigned long) PL_curpad,
438 (long) retval, PL_op_name[optype]));
440 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
441 (unsigned long) PL_curpad,
442 (long) retval, PL_op_name[optype]));
443 #endif /* USE_THREADS */
444 return (PADOFFSET)retval;
452 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
453 (unsigned long) thr, (unsigned long) PL_curpad, po));
456 croak("panic: pad_sv po");
457 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
458 (unsigned long) PL_curpad, po));
459 #endif /* USE_THREADS */
460 return PL_curpad[po]; /* eventually we'll turn this into a macro */
464 pad_free(PADOFFSET po)
469 if (AvARRAY(PL_comppad) != PL_curpad)
470 croak("panic: pad_free curpad");
472 croak("panic: pad_free po");
474 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
475 (unsigned long) thr, (unsigned long) PL_curpad, po));
477 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
478 (unsigned long) PL_curpad, po));
479 #endif /* USE_THREADS */
480 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
481 SvPADTMP_off(PL_curpad[po]);
482 if ((I32)po < PL_padix)
487 pad_swipe(PADOFFSET po)
490 if (AvARRAY(PL_comppad) != PL_curpad)
491 croak("panic: pad_swipe curpad");
493 croak("panic: pad_swipe po");
495 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
496 (unsigned long) thr, (unsigned long) PL_curpad, po));
498 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
499 (unsigned long) PL_curpad, po));
500 #endif /* USE_THREADS */
501 SvPADTMP_off(PL_curpad[po]);
502 PL_curpad[po] = NEWSV(1107,0);
503 SvPADTMP_on(PL_curpad[po]);
504 if ((I32)po < PL_padix)
508 /* XXX pad_reset() is currently disabled because it results in serious bugs.
509 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
510 * on the stack by OPs that use them, there are several ways to get an alias
511 * to a shared TARG. Such an alias will change randomly and unpredictably.
512 * We avoid doing this until we can think of a Better Way.
517 #ifdef USE_BROKEN_PAD_RESET
521 if (AvARRAY(PL_comppad) != PL_curpad)
522 croak("panic: pad_reset curpad");
524 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
525 (unsigned long) thr, (unsigned long) PL_curpad));
527 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
528 (unsigned long) PL_curpad));
529 #endif /* USE_THREADS */
530 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
531 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
532 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
533 SvPADTMP_off(PL_curpad[po]);
535 PL_padix = PL_padix_floor;
538 PL_pad_reset_pending = FALSE;
542 /* find_threadsv is not reentrant */
544 find_threadsv(char *name)
550 /* We currently only handle names of a single character */
551 p = strchr(PL_threadsv_names, *name);
554 key = p - PL_threadsv_names;
555 MUTEX_LOCK(&thr->mutex);
556 svp = av_fetch(thr->threadsv, key, FALSE);
558 MUTEX_UNLOCK(&thr->mutex);
560 SV *sv = NEWSV(0, 0);
561 av_store(thr->threadsv, key, sv);
562 thr->threadsvp = AvARRAY(thr->threadsv);
563 MUTEX_UNLOCK(&thr->mutex);
565 * Some magic variables used to be automagically initialised
566 * in gv_fetchpv. Those which are now per-thread magicals get
567 * initialised here instead.
573 sv_setpv(sv, "\034");
574 sv_magic(sv, 0, 0, name, 1);
579 PL_sawampersand = TRUE;
593 /* XXX %! tied to Errno.pm needs to be added here.
594 * See gv_fetchpv(). */
598 sv_magic(sv, 0, 0, name, 1);
600 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
601 "find_threadsv: new SV %p for $%s%c\n",
602 sv, (*name < 32) ? "^" : "",
603 (*name < 32) ? toCTRL(*name) : *name));
607 #endif /* USE_THREADS */
614 register OP *kid, *nextkid;
616 if (!o || o->op_seq == (U16)-1)
619 if (o->op_flags & OPf_KIDS) {
620 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
621 nextkid = kid->op_sibling; /* Get before next freeing kid */
626 switch (o->op_type) {
628 o->op_targ = 0; /* Was holding old type, if any. */
631 o->op_targ = 0; /* Was holding hints. */
635 if (!(o->op_flags & OPf_SPECIAL))
639 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
641 #endif /* USE_THREADS */
643 if (!(o->op_flags & OPf_REF)
644 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
650 SvREFCNT_dec(cGVOPo->op_gv);
654 Safefree(cCOPo->cop_label);
655 SvREFCNT_dec(cCOPo->cop_filegv);
656 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
657 SvREFCNT_dec(cCOPo->cop_warnings);
660 SvREFCNT_dec(cSVOPo->op_sv);
666 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
670 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
671 SvREFCNT_dec(cSVOPo->op_sv);
673 Safefree(cPVOPo->op_pv);
676 op_free(cPMOPo->op_pmreplroot);
681 ReREFCNT_dec(cPMOPo->op_pmregexp);
686 pad_free(o->op_targ);
694 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
695 pad_free(o->op_targ);
696 o->op_targ = o->op_type;
697 o->op_type = OP_NULL;
698 o->op_ppaddr = PL_ppaddr[OP_NULL];
701 /* Contextualizers */
703 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
713 /* establish postfix order */
714 if (cUNOPo->op_first) {
715 o->op_next = LINKLIST(cUNOPo->op_first);
716 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
718 kid->op_next = LINKLIST(kid->op_sibling);
733 if (o && o->op_flags & OPf_KIDS) {
734 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
743 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
745 if (ckWARN(WARN_SYNTAX)) {
746 line_t oldline = PL_curcop->cop_line;
748 if (PL_copline != NOLINE)
749 PL_curcop->cop_line = PL_copline;
750 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
751 PL_curcop->cop_line = oldline;
762 /* assumes no premature commitment */
763 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
764 || o->op_type == OP_RETURN)
767 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
769 switch (o->op_type) {
771 if (o->op_private & OPpREPEAT_DOLIST)
772 null(((LISTOP*)cBINOPo->op_first)->op_first);
773 scalar(cBINOPo->op_first);
778 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
782 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
783 if (!kPMOP->op_pmreplroot)
784 deprecate("implicit split to @_");
792 if (o->op_flags & OPf_KIDS) {
793 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
799 kid = cLISTOPo->op_first;
801 while (kid = kid->op_sibling) {
807 WITH_THR(PL_curcop = &PL_compiling);
812 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
818 WITH_THR(PL_curcop = &PL_compiling);
831 /* assumes no premature commitment */
832 U8 want = o->op_flags & OPf_WANT;
833 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
834 || o->op_type == OP_RETURN)
837 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
839 switch (o->op_type) {
841 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
845 if (o->op_flags & OPf_STACKED)
849 if (o->op_private == 4)
920 if (!(o->op_private & OPpLVAL_INTRO))
921 useless = PL_op_desc[o->op_type];
928 if (!(o->op_private & OPpLVAL_INTRO) &&
929 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
930 useless = "a variable";
935 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
942 if (ckWARN(WARN_VOID)) {
943 useless = "a constant";
944 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
946 else if (SvPOK(sv)) {
947 if (strnEQ(SvPVX(sv), "di", 2) ||
948 strnEQ(SvPVX(sv), "ds", 2) ||
949 strnEQ(SvPVX(sv), "ig", 2))
954 null(o); /* don't execute a constant */
955 SvREFCNT_dec(sv); /* don't even remember it */
959 o->op_type = OP_PREINC; /* pre-increment is faster */
960 o->op_ppaddr = PL_ppaddr[OP_PREINC];
964 o->op_type = OP_PREDEC; /* pre-decrement is faster */
965 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
971 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
976 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
977 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
978 if (o->op_flags & OPf_STACKED)
984 if (!(o->op_flags & OPf_KIDS))
993 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1000 /* all requires must return a boolean value */
1001 o->op_flags &= ~OPf_WANT;
1004 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1005 if (!kPMOP->op_pmreplroot)
1006 deprecate("implicit split to @_");
1012 if (ckWARN(WARN_VOID))
1013 warner(WARN_VOID, "Useless use of %s in void context", useless);
1022 if (o && o->op_flags & OPf_KIDS) {
1023 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1034 /* assumes no premature commitment */
1035 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1036 || o->op_type == OP_RETURN)
1039 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1041 switch (o->op_type) {
1044 list(cBINOPo->op_first);
1049 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1057 if (!(o->op_flags & OPf_KIDS))
1059 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1060 list(cBINOPo->op_first);
1061 return gen_constant_list(o);
1068 kid = cLISTOPo->op_first;
1070 while (kid = kid->op_sibling) {
1071 if (kid->op_sibling)
1076 WITH_THR(PL_curcop = &PL_compiling);
1080 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1081 if (kid->op_sibling)
1086 WITH_THR(PL_curcop = &PL_compiling);
1089 /* all requires must return a boolean value */
1090 o->op_flags &= ~OPf_WANT;
1102 if (o->op_type == OP_LINESEQ ||
1103 o->op_type == OP_SCOPE ||
1104 o->op_type == OP_LEAVE ||
1105 o->op_type == OP_LEAVETRY)
1108 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1109 if (kid->op_sibling) {
1113 PL_curcop = &PL_compiling;
1115 o->op_flags &= ~OPf_PARENS;
1116 if (PL_hints & HINT_BLOCK_SCOPE)
1117 o->op_flags |= OPf_PARENS;
1120 o = newOP(OP_STUB, 0);
1125 modkids(OP *o, I32 type)
1128 if (o && o->op_flags & OPf_KIDS) {
1129 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1136 mod(OP *o, I32 type)
1143 if (!o || PL_error_count)
1146 switch (o->op_type) {
1151 if (!(o->op_private & (OPpCONST_ARYBASE)))
1153 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1154 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1158 SAVEI32(PL_compiling.cop_arybase);
1159 PL_compiling.cop_arybase = 0;
1161 else if (type == OP_REFGEN)
1164 croak("That use of $[ is unsupported");
1167 if (o->op_flags & OPf_PARENS)
1171 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1172 !(o->op_flags & OPf_STACKED)) {
1173 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1174 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1175 assert(cUNOPo->op_first->op_type == OP_NULL);
1176 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1182 /* grep, foreach, subcalls, refgen */
1183 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1185 yyerror(form("Can't modify %s in %s",
1186 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1187 ? "do block" : PL_op_desc[o->op_type]),
1188 type ? PL_op_desc[type] : "local"));
1202 case OP_RIGHT_SHIFT:
1211 if (!(o->op_flags & OPf_STACKED))
1217 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1223 if (!type && cUNOPo->op_first->op_type != OP_GV)
1224 croak("Can't localize through a reference");
1225 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1226 PL_modcount = 10000;
1227 return o; /* Treat \(@foo) like ordinary list. */
1231 if (scalar_mod_type(o, type))
1233 ref(cUNOPo->op_first, o->op_type);
1242 PL_modcount = 10000;
1245 if (!type && cUNOPo->op_first->op_type != OP_GV)
1246 croak("Can't localize through a reference");
1247 ref(cUNOPo->op_first, o->op_type);
1251 PL_hints |= HINT_BLOCK_SCOPE;
1261 PL_modcount = 10000;
1262 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1263 return o; /* Treat \(@foo) like ordinary list. */
1264 if (scalar_mod_type(o, type))
1270 croak("Can't localize lexical variable %s",
1271 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1276 PL_modcount++; /* XXX ??? */
1278 #endif /* USE_THREADS */
1284 if (type != OP_SASSIGN)
1288 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1294 pad_free(o->op_targ);
1295 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1296 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1297 if (o->op_flags & OPf_KIDS)
1298 mod(cBINOPo->op_first->op_sibling, type);
1303 ref(cBINOPo->op_first, o->op_type);
1304 if (type == OP_ENTERSUB &&
1305 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1306 o->op_private |= OPpLVAL_DEFER;
1313 if (o->op_flags & OPf_KIDS)
1314 mod(cLISTOPo->op_last, type);
1318 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1320 else if (!(o->op_flags & OPf_KIDS))
1322 if (o->op_targ != OP_LIST) {
1323 mod(cBINOPo->op_first, type);
1328 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1332 o->op_flags |= OPf_MOD;
1334 if (type == OP_AASSIGN || type == OP_SASSIGN)
1335 o->op_flags |= OPf_SPECIAL|OPf_REF;
1337 o->op_private |= OPpLVAL_INTRO;
1338 o->op_flags &= ~OPf_SPECIAL;
1339 PL_hints |= HINT_BLOCK_SCOPE;
1341 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1342 o->op_flags |= OPf_REF;
1347 scalar_mod_type(OP *o, I32 type)
1351 if (o->op_type == OP_RV2GV)
1375 case OP_RIGHT_SHIFT:
1394 is_handle_constructor(OP *o, I32 argnum)
1396 switch (o->op_type) {
1416 refkids(OP *o, I32 type)
1419 if (o && o->op_flags & OPf_KIDS) {
1420 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1427 ref(OP *o, I32 type)
1431 if (!o || PL_error_count)
1434 switch (o->op_type) {
1436 if ((type == OP_DEFINED || type == OP_LOCK) &&
1437 !(o->op_flags & OPf_STACKED)) {
1438 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1439 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1440 assert(cUNOPo->op_first->op_type == OP_NULL);
1441 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1442 o->op_flags |= OPf_SPECIAL;
1447 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1451 if (type == OP_DEFINED)
1452 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1453 ref(cUNOPo->op_first, o->op_type);
1456 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1457 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1458 : type == OP_RV2HV ? OPpDEREF_HV
1460 o->op_flags |= OPf_MOD;
1465 o->op_flags |= OPf_MOD; /* XXX ??? */
1470 o->op_flags |= OPf_REF;
1473 if (type == OP_DEFINED)
1474 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1475 ref(cUNOPo->op_first, o->op_type);
1480 o->op_flags |= OPf_REF;
1485 if (!(o->op_flags & OPf_KIDS))
1487 ref(cBINOPo->op_first, type);
1491 ref(cBINOPo->op_first, o->op_type);
1492 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1493 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1494 : type == OP_RV2HV ? OPpDEREF_HV
1496 o->op_flags |= OPf_MOD;
1504 if (!(o->op_flags & OPf_KIDS))
1506 ref(cLISTOPo->op_last, type);
1521 if (!o || PL_error_count)
1525 if (type == OP_LIST) {
1526 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1528 } else if (type == OP_UNDEF) {
1530 } else if (type != OP_PADSV &&
1533 type != OP_PUSHMARK)
1535 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1538 o->op_flags |= OPf_MOD;
1539 o->op_private |= OPpLVAL_INTRO;
1547 o->op_flags |= OPf_PARENS;
1552 bind_match(I32 type, OP *left, OP *right)
1557 if (ckWARN(WARN_UNSAFE) &&
1558 (left->op_type == OP_RV2AV ||
1559 left->op_type == OP_RV2HV ||
1560 left->op_type == OP_PADAV ||
1561 left->op_type == OP_PADHV)) {
1562 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1563 right->op_type == OP_TRANS)
1564 ? right->op_type : OP_MATCH];
1565 char *sample = ((left->op_type == OP_RV2AV ||
1566 left->op_type == OP_PADAV)
1567 ? "@array" : "%hash");
1569 "Applying %s to %s will act on scalar(%s)",
1570 desc, sample, sample);
1573 if (right->op_type == OP_MATCH ||
1574 right->op_type == OP_SUBST ||
1575 right->op_type == OP_TRANS) {
1576 right->op_flags |= OPf_STACKED;
1577 if (right->op_type != OP_MATCH)
1578 left = mod(left, right->op_type);
1579 if (right->op_type == OP_TRANS)
1580 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1582 o = prepend_elem(right->op_type, scalar(left), right);
1584 return newUNOP(OP_NOT, 0, scalar(o));
1588 return bind_match(type, left,
1589 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1597 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1598 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1605 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1606 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1607 o->op_type = OP_LEAVE;
1608 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1611 if (o->op_type == OP_LINESEQ) {
1613 o->op_type = OP_SCOPE;
1614 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1615 kid = ((LISTOP*)o)->op_first;
1616 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1617 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1622 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1632 SAVESPTR(GvHV(PL_hintgv));
1633 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1634 SAVEFREESV(GvHV(PL_hintgv));
1638 block_start(int full)
1641 int retval = PL_savestack_ix;
1643 SAVEI32(PL_comppad_name_floor);
1645 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1646 PL_comppad_name_floor = PL_comppad_name_fill;
1648 PL_comppad_name_floor = 0;
1650 SAVEI32(PL_min_intro_pending);
1651 SAVEI32(PL_max_intro_pending);
1652 PL_min_intro_pending = 0;
1653 SAVEI32(PL_comppad_name_fill);
1654 SAVEI32(PL_padix_floor);
1655 PL_padix_floor = PL_padix;
1656 PL_pad_reset_pending = FALSE;
1658 PL_hints &= ~HINT_BLOCK_SCOPE;
1659 SAVEPPTR(PL_compiling.cop_warnings);
1660 if (PL_compiling.cop_warnings != WARN_ALL &&
1661 PL_compiling.cop_warnings != WARN_NONE) {
1662 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1663 SAVEFREESV(PL_compiling.cop_warnings) ;
1671 block_end(I32 floor, OP *seq)
1674 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1675 OP* retval = scalarseq(seq);
1677 PL_pad_reset_pending = FALSE;
1678 PL_compiling.op_private = PL_hints;
1680 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1681 pad_leavemy(PL_comppad_name_fill);
1690 OP *o = newOP(OP_THREADSV, 0);
1691 o->op_targ = find_threadsv("_");
1694 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1695 #endif /* USE_THREADS */
1703 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1704 PL_eval_start = linklist(PL_eval_root);
1705 PL_eval_root->op_next = 0;
1706 peep(PL_eval_start);
1711 PL_main_root = scope(sawparens(scalarvoid(o)));
1712 PL_curcop = &PL_compiling;
1713 PL_main_start = LINKLIST(PL_main_root);
1714 PL_main_root->op_next = 0;
1715 peep(PL_main_start);
1718 /* Register with debugger */
1720 CV *cv = perl_get_cv("DB::postponed", FALSE);
1724 XPUSHs((SV*)PL_compiling.cop_filegv);
1726 perl_call_sv((SV*)cv, G_DISCARD);
1733 localize(OP *o, I32 lex)
1735 if (o->op_flags & OPf_PARENS)
1739 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1741 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1742 if (*s == ';' || *s == '=')
1743 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1744 lex ? "my" : "local");
1748 PL_in_my_stash = Nullhv;
1752 return mod(o, OP_NULL); /* a bit kludgey */
1758 if (o->op_type == OP_LIST) {
1761 o2 = newOP(OP_THREADSV, 0);
1762 o2->op_targ = find_threadsv(";");
1764 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1765 #endif /* USE_THREADS */
1766 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1772 fold_constants(register OP *o)
1776 I32 type = o->op_type;
1779 if (PL_opargs[type] & OA_RETSCALAR)
1781 if (PL_opargs[type] & OA_TARGET)
1782 o->op_targ = pad_alloc(type, SVs_PADTMP);
1784 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1785 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1787 if (!(PL_opargs[type] & OA_FOLDCONST))
1802 if (o->op_private & OPpLOCALE)
1807 goto nope; /* Don't try to run w/ errors */
1809 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1810 if (curop->op_type != OP_CONST &&
1811 curop->op_type != OP_LIST &&
1812 curop->op_type != OP_SCALAR &&
1813 curop->op_type != OP_NULL &&
1814 curop->op_type != OP_PUSHMARK) {
1819 curop = LINKLIST(o);
1823 sv = *(PL_stack_sp--);
1824 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1825 pad_swipe(o->op_targ);
1826 else if (SvTEMP(sv)) { /* grab mortal temp? */
1827 (void)SvREFCNT_inc(sv);
1831 if (type == OP_RV2GV)
1832 return newGVOP(OP_GV, 0, (GV*)sv);
1834 /* try to smush double to int, but don't smush -2.0 to -2 */
1835 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1839 if ((double)iv == SvNV(sv)) {
1844 SvIOK_off(sv); /* undo SvIV() damage */
1846 return newSVOP(OP_CONST, 0, sv);
1850 if (!(PL_opargs[type] & OA_OTHERINT))
1853 if (!(PL_hints & HINT_INTEGER)) {
1854 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1857 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1858 if (curop->op_type == OP_CONST) {
1859 if (SvIOK(((SVOP*)curop)->op_sv))
1863 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1867 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1874 gen_constant_list(register OP *o)
1878 I32 oldtmps_floor = PL_tmps_floor;
1882 return o; /* Don't attempt to run with errors */
1884 PL_op = curop = LINKLIST(o);
1890 PL_tmps_floor = oldtmps_floor;
1892 o->op_type = OP_RV2AV;
1893 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1894 curop = ((UNOP*)o)->op_first;
1895 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1902 convert(I32 type, I32 flags, OP *o)
1907 if (!o || o->op_type != OP_LIST)
1908 o = newLISTOP(OP_LIST, 0, o, Nullop);
1910 o->op_flags &= ~OPf_WANT;
1912 if (!(PL_opargs[type] & OA_MARK))
1913 null(cLISTOPo->op_first);
1916 o->op_ppaddr = PL_ppaddr[type];
1917 o->op_flags |= flags;
1919 o = CHECKOP(type, o);
1920 if (o->op_type != type)
1923 if (cLISTOPo->op_children < 7) {
1924 /* XXX do we really need to do this if we're done appending?? */
1925 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1927 cLISTOPo->op_last = last; /* in case check substituted last arg */
1930 return fold_constants(o);
1933 /* List constructors */
1936 append_elem(I32 type, OP *first, OP *last)
1944 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1945 return newLISTOP(type, 0, first, last);
1947 if (first->op_flags & OPf_KIDS)
1948 ((LISTOP*)first)->op_last->op_sibling = last;
1950 first->op_flags |= OPf_KIDS;
1951 ((LISTOP*)first)->op_first = last;
1953 ((LISTOP*)first)->op_last = last;
1954 ((LISTOP*)first)->op_children++;
1959 append_list(I32 type, LISTOP *first, LISTOP *last)
1967 if (first->op_type != type)
1968 return prepend_elem(type, (OP*)first, (OP*)last);
1970 if (last->op_type != type)
1971 return append_elem(type, (OP*)first, (OP*)last);
1973 first->op_last->op_sibling = last->op_first;
1974 first->op_last = last->op_last;
1975 first->op_children += last->op_children;
1976 if (first->op_children)
1977 first->op_flags |= OPf_KIDS;
1984 prepend_elem(I32 type, OP *first, OP *last)
1992 if (last->op_type == type) {
1993 if (type == OP_LIST) { /* already a PUSHMARK there */
1994 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1995 ((LISTOP*)last)->op_first->op_sibling = first;
1998 if (!(last->op_flags & OPf_KIDS)) {
1999 ((LISTOP*)last)->op_last = first;
2000 last->op_flags |= OPf_KIDS;
2002 first->op_sibling = ((LISTOP*)last)->op_first;
2003 ((LISTOP*)last)->op_first = first;
2005 ((LISTOP*)last)->op_children++;
2009 return newLISTOP(type, 0, first, last);
2017 return newOP(OP_STUB, 0);
2023 if (!o || o->op_type != OP_LIST)
2024 o = newLISTOP(OP_LIST, 0, o, Nullop);
2030 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2034 Newz(1101, listop, 1, LISTOP);
2036 listop->op_type = type;
2037 listop->op_ppaddr = PL_ppaddr[type];
2038 listop->op_children = (first != 0) + (last != 0);
2039 listop->op_flags = flags;
2043 else if (!first && last)
2046 first->op_sibling = last;
2047 listop->op_first = first;
2048 listop->op_last = last;
2049 if (type == OP_LIST) {
2051 pushop = newOP(OP_PUSHMARK, 0);
2052 pushop->op_sibling = first;
2053 listop->op_first = pushop;
2054 listop->op_flags |= OPf_KIDS;
2056 listop->op_last = pushop;
2058 else if (listop->op_children)
2059 listop->op_flags |= OPf_KIDS;
2065 newOP(I32 type, I32 flags)
2068 Newz(1101, o, 1, OP);
2070 o->op_ppaddr = PL_ppaddr[type];
2071 o->op_flags = flags;
2074 o->op_private = 0 + (flags >> 8);
2075 if (PL_opargs[type] & OA_RETSCALAR)
2077 if (PL_opargs[type] & OA_TARGET)
2078 o->op_targ = pad_alloc(type, SVs_PADTMP);
2079 return CHECKOP(type, o);
2083 newUNOP(I32 type, I32 flags, OP *first)
2088 first = newOP(OP_STUB, 0);
2089 if (PL_opargs[type] & OA_MARK)
2090 first = force_list(first);
2092 Newz(1101, unop, 1, UNOP);
2093 unop->op_type = type;
2094 unop->op_ppaddr = PL_ppaddr[type];
2095 unop->op_first = first;
2096 unop->op_flags = flags | OPf_KIDS;
2097 unop->op_private = 1 | (flags >> 8);
2098 unop = (UNOP*) CHECKOP(type, unop);
2102 return fold_constants((OP *) unop);
2106 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2109 Newz(1101, binop, 1, BINOP);
2112 first = newOP(OP_NULL, 0);
2114 binop->op_type = type;
2115 binop->op_ppaddr = PL_ppaddr[type];
2116 binop->op_first = first;
2117 binop->op_flags = flags | OPf_KIDS;
2120 binop->op_private = 1 | (flags >> 8);
2123 binop->op_private = 2 | (flags >> 8);
2124 first->op_sibling = last;
2127 binop = (BINOP*)CHECKOP(type, binop);
2131 binop->op_last = binop->op_first->op_sibling;
2133 return fold_constants((OP *)binop);
2137 utf8compare(const void *a, const void *b)
2140 for (i = 0; i < 10; i++) {
2141 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2143 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2150 pmtrans(OP *o, OP *expr, OP *repl)
2152 SV *tstr = ((SVOP*)expr)->op_sv;
2153 SV *rstr = ((SVOP*)repl)->op_sv;
2156 register U8 *t = (U8*)SvPV(tstr, tlen);
2157 register U8 *r = (U8*)SvPV(rstr, rlen);
2163 register short *tbl;
2165 complement = o->op_private & OPpTRANS_COMPLEMENT;
2166 del = o->op_private & OPpTRANS_DELETE;
2167 squash = o->op_private & OPpTRANS_SQUASH;
2169 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2170 SV* listsv = newSVpv("# comment\n",0);
2172 U8* tend = t + tlen;
2173 U8* rend = r + rlen;
2189 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2190 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2196 New(1109, cp, tlen, U8*);
2198 transv = newSVpv("",0);
2207 qsort(cp, i, sizeof(U8*), utf8compare);
2208 for (j = 0; j < i; j++) {
2210 UV val = utf8_to_uv(s, &ulen);
2212 diff = val - nextmin;
2214 t = uv_to_utf8(tmpbuf,nextmin);
2215 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2217 t = uv_to_utf8(tmpbuf, val - 1);
2218 sv_catpvn(transv, "\377", 1);
2219 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2223 val = utf8_to_uv(s+1, &ulen);
2227 t = uv_to_utf8(tmpbuf,nextmin);
2228 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2229 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2230 sv_catpvn(transv, "\377", 1);
2231 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2232 t = (U8*)SvPVX(transv);
2233 tlen = SvCUR(transv);
2236 else if (!rlen && !del) {
2237 r = t; rlen = tlen; rend = tend;
2240 if (to_utf && from_utf) { /* only counting characters */
2241 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2242 o->op_private |= OPpTRANS_IDENTICAL;
2244 else { /* straight latin-1 translation */
2245 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2246 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2247 o->op_private |= OPpTRANS_IDENTICAL;
2251 while (t < tend || tfirst <= tlast) {
2252 /* see if we need more "t" chars */
2253 if (tfirst > tlast) {
2254 tfirst = (I32)utf8_to_uv(t, &ulen);
2256 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2257 tlast = (I32)utf8_to_uv(++t, &ulen);
2264 /* now see if we need more "r" chars */
2265 if (rfirst > rlast) {
2267 rfirst = (I32)utf8_to_uv(r, &ulen);
2269 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2270 rlast = (I32)utf8_to_uv(++r, &ulen);
2279 rfirst = rlast = 0xffffffff;
2283 /* now see which range will peter our first, if either. */
2284 tdiff = tlast - tfirst;
2285 rdiff = rlast - rfirst;
2292 if (rfirst == 0xffffffff) {
2293 diff = tdiff; /* oops, pretend rdiff is infinite */
2295 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2297 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2301 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2303 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2305 if (rfirst + diff > max)
2306 max = rfirst + diff;
2311 else if (rfirst <= 0x800)
2312 grows |= (tfirst < 0x80);
2313 else if (rfirst <= 0x10000)
2314 grows |= (tfirst < 0x800);
2315 else if (rfirst <= 0x200000)
2316 grows |= (tfirst < 0x10000);
2317 else if (rfirst <= 0x4000000)
2318 grows |= (tfirst < 0x200000);
2319 else if (rfirst <= 0x80000000)
2320 grows |= (tfirst < 0x4000000);
2332 else if (max > 0xff)
2337 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2338 SvREFCNT_dec(listsv);
2340 SvREFCNT_dec(transv);
2342 if (!del && havefinal)
2343 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2345 if (grows && to_utf)
2346 o->op_private |= OPpTRANS_GROWS;
2353 tbl = (short*)cPVOPo->op_pv;
2355 Zero(tbl, 256, short);
2356 for (i = 0; i < tlen; i++)
2358 for (i = 0, j = 0; i < 256; i++) {
2374 if (!rlen && !del) {
2377 o->op_private |= OPpTRANS_IDENTICAL;
2379 for (i = 0; i < 256; i++)
2381 for (i = 0, j = 0; i < tlen; i++,j++) {
2384 if (tbl[t[i]] == -1)
2390 if (tbl[t[i]] == -1)
2401 newPMOP(I32 type, I32 flags)
2406 Newz(1101, pmop, 1, PMOP);
2407 pmop->op_type = type;
2408 pmop->op_ppaddr = PL_ppaddr[type];
2409 pmop->op_flags = flags;
2410 pmop->op_private = 0 | (flags >> 8);
2412 if (PL_hints & HINT_RE_TAINT)
2413 pmop->op_pmpermflags |= PMf_RETAINT;
2414 if (PL_hints & HINT_LOCALE)
2415 pmop->op_pmpermflags |= PMf_LOCALE;
2416 pmop->op_pmflags = pmop->op_pmpermflags;
2418 /* link into pm list */
2419 if (type != OP_TRANS && PL_curstash) {
2420 pmop->op_pmnext = HvPMROOT(PL_curstash);
2421 HvPMROOT(PL_curstash) = pmop;
2428 pmruntime(OP *o, OP *expr, OP *repl)
2433 I32 repl_has_vars = 0;
2435 if (o->op_type == OP_TRANS)
2436 return pmtrans(o, expr, repl);
2438 PL_hints |= HINT_BLOCK_SCOPE;
2441 if (expr->op_type == OP_CONST) {
2443 SV *pat = ((SVOP*)expr)->op_sv;
2444 char *p = SvPV(pat, plen);
2445 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2446 sv_setpvn(pat, "\\s+", 3);
2447 p = SvPV(pat, plen);
2448 pm->op_pmflags |= PMf_SKIPWHITE;
2450 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2451 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2452 pm->op_pmflags |= PMf_WHITE;
2456 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2457 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2459 : OP_REGCMAYBE),0,expr);
2461 Newz(1101, rcop, 1, LOGOP);
2462 rcop->op_type = OP_REGCOMP;
2463 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2464 rcop->op_first = scalar(expr);
2465 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2466 ? (OPf_SPECIAL | OPf_KIDS)
2468 rcop->op_private = 1;
2471 /* establish postfix order */
2472 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2474 rcop->op_next = expr;
2475 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2478 rcop->op_next = LINKLIST(expr);
2479 expr->op_next = (OP*)rcop;
2482 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2487 if (pm->op_pmflags & PMf_EVAL)
2490 else if (repl->op_type == OP_THREADSV
2491 && strchr("&`'123456789+",
2492 PL_threadsv_names[repl->op_targ]))
2496 #endif /* USE_THREADS */
2497 else if (repl->op_type == OP_CONST)
2501 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2502 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2504 if (curop->op_type == OP_THREADSV) {
2506 if (strchr("&`'123456789+", curop->op_private))
2510 if (curop->op_type == OP_GV) {
2511 GV *gv = ((GVOP*)curop)->op_gv;
2513 if (strchr("&`'123456789+", *GvENAME(gv)))
2516 #endif /* USE_THREADS */
2517 else if (curop->op_type == OP_RV2CV)
2519 else if (curop->op_type == OP_RV2SV ||
2520 curop->op_type == OP_RV2AV ||
2521 curop->op_type == OP_RV2HV ||
2522 curop->op_type == OP_RV2GV) {
2523 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2526 else if (curop->op_type == OP_PADSV ||
2527 curop->op_type == OP_PADAV ||
2528 curop->op_type == OP_PADHV ||
2529 curop->op_type == OP_PADANY) {
2532 else if (curop->op_type == OP_PUSHRE)
2533 ; /* Okay here, dangerous in newASSIGNOP */
2542 && (!pm->op_pmregexp
2543 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2544 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2545 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2546 prepend_elem(o->op_type, scalar(repl), o);
2549 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2550 pm->op_pmflags |= PMf_MAYBE_CONST;
2551 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2553 Newz(1101, rcop, 1, LOGOP);
2554 rcop->op_type = OP_SUBSTCONT;
2555 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2556 rcop->op_first = scalar(repl);
2557 rcop->op_flags |= OPf_KIDS;
2558 rcop->op_private = 1;
2561 /* establish postfix order */
2562 rcop->op_next = LINKLIST(repl);
2563 repl->op_next = (OP*)rcop;
2565 pm->op_pmreplroot = scalar((OP*)rcop);
2566 pm->op_pmreplstart = LINKLIST(rcop);
2575 newSVOP(I32 type, I32 flags, SV *sv)
2578 Newz(1101, svop, 1, SVOP);
2579 svop->op_type = type;
2580 svop->op_ppaddr = PL_ppaddr[type];
2582 svop->op_next = (OP*)svop;
2583 svop->op_flags = flags;
2584 if (PL_opargs[type] & OA_RETSCALAR)
2586 if (PL_opargs[type] & OA_TARGET)
2587 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2588 return CHECKOP(type, svop);
2592 newGVOP(I32 type, I32 flags, GV *gv)
2596 Newz(1101, gvop, 1, GVOP);
2597 gvop->op_type = type;
2598 gvop->op_ppaddr = PL_ppaddr[type];
2599 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2600 gvop->op_next = (OP*)gvop;
2601 gvop->op_flags = flags;
2602 if (PL_opargs[type] & OA_RETSCALAR)
2604 if (PL_opargs[type] & OA_TARGET)
2605 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2606 return CHECKOP(type, gvop);
2610 newPVOP(I32 type, I32 flags, char *pv)
2613 Newz(1101, pvop, 1, PVOP);
2614 pvop->op_type = type;
2615 pvop->op_ppaddr = PL_ppaddr[type];
2617 pvop->op_next = (OP*)pvop;
2618 pvop->op_flags = flags;
2619 if (PL_opargs[type] & OA_RETSCALAR)
2621 if (PL_opargs[type] & OA_TARGET)
2622 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2623 return CHECKOP(type, pvop);
2632 save_hptr(&PL_curstash);
2633 save_item(PL_curstname);
2638 name = SvPV(sv, len);
2639 PL_curstash = gv_stashpvn(name,len,TRUE);
2640 sv_setpvn(PL_curstname, name, len);
2644 sv_setpv(PL_curstname,"<none>");
2645 PL_curstash = Nullhv;
2647 PL_hints |= HINT_BLOCK_SCOPE;
2648 PL_copline = NOLINE;
2653 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2662 if (id->op_type != OP_CONST)
2663 croak("Module name must be constant");
2667 if(version != Nullop) {
2668 SV *vesv = ((SVOP*)version)->op_sv;
2670 if (arg == Nullop && !SvNIOK(vesv)) {
2677 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2678 croak("Version number must be constant number");
2680 /* Make copy of id so we don't free it twice */
2681 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2683 /* Fake up a method call to VERSION */
2684 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2685 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2686 append_elem(OP_LIST,
2687 prepend_elem(OP_LIST, pack, list(version)),
2688 newUNOP(OP_METHOD, 0, meth)));
2692 /* Fake up an import/unimport */
2693 if (arg && arg->op_type == OP_STUB)
2694 imop = arg; /* no import on explicit () */
2695 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2696 imop = Nullop; /* use 5.0; */
2699 /* Make copy of id so we don't free it twice */
2700 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2701 meth = newSVOP(OP_CONST, 0,
2703 ? newSVpv("import", 6)
2704 : newSVpv("unimport", 8)
2706 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2707 append_elem(OP_LIST,
2708 prepend_elem(OP_LIST, pack, list(arg)),
2709 newUNOP(OP_METHOD, 0, meth)));
2712 /* Fake up a require, handle override, if any */
2713 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2714 if (!(gv && GvIMPORTED_CV(gv)))
2715 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2717 if (gv && GvIMPORTED_CV(gv)) {
2718 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2719 append_elem(OP_LIST, id,
2720 scalar(newUNOP(OP_RV2CV, 0,
2725 rqop = newUNOP(OP_REQUIRE, 0, id);
2728 /* Fake up the BEGIN {}, which does its thing immediately. */
2730 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2732 append_elem(OP_LINESEQ,
2733 append_elem(OP_LINESEQ,
2734 newSTATEOP(0, Nullch, rqop),
2735 newSTATEOP(0, Nullch, veop)),
2736 newSTATEOP(0, Nullch, imop) ));
2738 PL_copline = NOLINE;
2748 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2749 if (!(gv && GvIMPORTED_CV(gv)))
2750 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2752 if (gv && GvIMPORTED_CV(gv)) {
2753 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2754 append_elem(OP_LIST, term,
2755 scalar(newUNOP(OP_RV2CV, 0,
2760 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2766 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2768 return newBINOP(OP_LSLICE, flags,
2769 list(force_list(subscript)),
2770 list(force_list(listval)) );
2774 list_assignment(register OP *o)
2779 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2780 o = cUNOPo->op_first;
2782 if (o->op_type == OP_COND_EXPR) {
2783 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2784 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2789 yyerror("Assignment to both a list and a scalar");
2793 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2794 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2795 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2798 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2801 if (o->op_type == OP_RV2SV)
2808 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2813 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2814 return newLOGOP(optype, 0,
2815 mod(scalar(left), optype),
2816 newUNOP(OP_SASSIGN, 0, scalar(right)));
2819 return newBINOP(optype, OPf_STACKED,
2820 mod(scalar(left), optype), scalar(right));
2824 if (list_assignment(left)) {
2827 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2828 left = mod(left, OP_AASSIGN);
2836 o = newBINOP(OP_AASSIGN, flags,
2837 list(force_list(right)),
2838 list(force_list(left)) );
2839 o->op_private = 0 | (flags >> 8);
2840 if (!(left->op_private & OPpLVAL_INTRO)) {
2844 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2845 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2846 if (curop->op_type == OP_GV) {
2847 GV *gv = ((GVOP*)curop)->op_gv;
2848 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2850 SvCUR(gv) = PL_generation;
2852 else if (curop->op_type == OP_PADSV ||
2853 curop->op_type == OP_PADAV ||
2854 curop->op_type == OP_PADHV ||
2855 curop->op_type == OP_PADANY) {
2856 SV **svp = AvARRAY(PL_comppad_name);
2857 SV *sv = svp[curop->op_targ];
2858 if (SvCUR(sv) == PL_generation)
2860 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2862 else if (curop->op_type == OP_RV2CV)
2864 else if (curop->op_type == OP_RV2SV ||
2865 curop->op_type == OP_RV2AV ||
2866 curop->op_type == OP_RV2HV ||
2867 curop->op_type == OP_RV2GV) {
2868 if (lastop->op_type != OP_GV) /* funny deref? */
2871 else if (curop->op_type == OP_PUSHRE) {
2872 if (((PMOP*)curop)->op_pmreplroot) {
2873 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2874 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2876 SvCUR(gv) = PL_generation;
2885 o->op_private = OPpASSIGN_COMMON;
2887 if (right && right->op_type == OP_SPLIT) {
2889 if ((tmpop = ((LISTOP*)right)->op_first) &&
2890 tmpop->op_type == OP_PUSHRE)
2892 PMOP *pm = (PMOP*)tmpop;
2893 if (left->op_type == OP_RV2AV &&
2894 !(left->op_private & OPpLVAL_INTRO) &&
2895 !(o->op_private & OPpASSIGN_COMMON) )
2897 tmpop = ((UNOP*)left)->op_first;
2898 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2899 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2900 pm->op_pmflags |= PMf_ONCE;
2901 tmpop = cUNOPo->op_first; /* to list (nulled) */
2902 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2903 tmpop->op_sibling = Nullop; /* don't free split */
2904 right->op_next = tmpop->op_next; /* fix starting loc */
2905 op_free(o); /* blow off assign */
2906 right->op_flags &= ~OPf_WANT;
2907 /* "I don't know and I don't care." */
2912 if (PL_modcount < 10000 &&
2913 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2915 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2917 sv_setiv(sv, PL_modcount+1);
2925 right = newOP(OP_UNDEF, 0);
2926 if (right->op_type == OP_READLINE) {
2927 right->op_flags |= OPf_STACKED;
2928 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2931 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2932 o = newBINOP(OP_SASSIGN, flags,
2933 scalar(right), mod(scalar(left), OP_SASSIGN) );
2945 newSTATEOP(I32 flags, char *label, OP *o)
2948 U32 seq = intro_my();
2951 Newz(1101, cop, 1, COP);
2952 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2953 cop->op_type = OP_DBSTATE;
2954 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2957 cop->op_type = OP_NEXTSTATE;
2958 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2960 cop->op_flags = flags;
2961 cop->op_private = (PL_hints & HINT_UTF8);
2963 cop->op_private |= NATIVE_HINTS;
2965 PL_compiling.op_private = cop->op_private;
2966 cop->op_next = (OP*)cop;
2969 cop->cop_label = label;
2970 PL_hints |= HINT_BLOCK_SCOPE;
2973 cop->cop_arybase = PL_curcop->cop_arybase;
2974 if (PL_curcop->cop_warnings == WARN_NONE
2975 || PL_curcop->cop_warnings == WARN_ALL)
2976 cop->cop_warnings = PL_curcop->cop_warnings ;
2978 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2981 if (PL_copline == NOLINE)
2982 cop->cop_line = PL_curcop->cop_line;
2984 cop->cop_line = PL_copline;
2985 PL_copline = NOLINE;
2987 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2988 cop->cop_stash = PL_curstash;
2990 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2991 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2992 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2993 (void)SvIOK_on(*svp);
2995 SvSTASH(*svp) = (HV*)cop;
2999 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3002 /* "Introduce" my variables to visible status. */
3010 if (! PL_min_intro_pending)
3011 return PL_cop_seqmax;
3013 svp = AvARRAY(PL_comppad_name);
3014 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3015 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3016 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3017 SvNVX(sv) = (double)PL_cop_seqmax;
3020 PL_min_intro_pending = 0;
3021 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3022 return PL_cop_seqmax++;
3026 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3028 return new_logop(type, flags, &first, &other);
3032 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3037 OP *first = *firstp;
3038 OP *other = *otherp;
3040 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3041 return newBINOP(type, flags, scalar(first), scalar(other));
3043 scalarboolean(first);
3044 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3045 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3046 if (type == OP_AND || type == OP_OR) {
3052 first = *firstp = cUNOPo->op_first;
3054 first->op_next = o->op_next;
3055 cUNOPo->op_first = Nullop;
3059 if (first->op_type == OP_CONST) {
3060 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3061 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3063 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3074 else if (first->op_type == OP_WANTARRAY) {
3080 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3081 OP *k1 = ((UNOP*)first)->op_first;
3082 OP *k2 = k1->op_sibling;
3084 switch (first->op_type)
3087 if (k2 && k2->op_type == OP_READLINE
3088 && (k2->op_flags & OPf_STACKED)
3089 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3090 warnop = k2->op_type;
3094 if (k1->op_type == OP_READDIR
3095 || k1->op_type == OP_GLOB
3096 || k1->op_type == OP_EACH)
3097 warnop = k1->op_type;
3101 line_t oldline = PL_curcop->cop_line;
3102 PL_curcop->cop_line = PL_copline;
3104 "Value of %s%s can be \"0\"; test with defined()",
3106 ((warnop == OP_READLINE || warnop == OP_GLOB)
3107 ? " construct" : "() operator"));
3108 PL_curcop->cop_line = oldline;
3115 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3116 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3118 Newz(1101, logop, 1, LOGOP);
3120 logop->op_type = type;
3121 logop->op_ppaddr = PL_ppaddr[type];
3122 logop->op_first = first;
3123 logop->op_flags = flags | OPf_KIDS;
3124 logop->op_other = LINKLIST(other);
3125 logop->op_private = 1 | (flags >> 8);
3127 /* establish postfix order */
3128 logop->op_next = LINKLIST(first);
3129 first->op_next = (OP*)logop;
3130 first->op_sibling = other;
3132 o = newUNOP(OP_NULL, 0, (OP*)logop);
3139 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3146 return newLOGOP(OP_AND, 0, first, trueop);
3148 return newLOGOP(OP_OR, 0, first, falseop);
3150 scalarboolean(first);
3151 if (first->op_type == OP_CONST) {
3152 if (SvTRUE(((SVOP*)first)->op_sv)) {
3163 else if (first->op_type == OP_WANTARRAY) {
3167 Newz(1101, condop, 1, CONDOP);
3169 condop->op_type = OP_COND_EXPR;
3170 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3171 condop->op_first = first;
3172 condop->op_flags = flags | OPf_KIDS;
3173 condop->op_true = LINKLIST(trueop);
3174 condop->op_false = LINKLIST(falseop);
3175 condop->op_private = 1 | (flags >> 8);
3177 /* establish postfix order */
3178 condop->op_next = LINKLIST(first);
3179 first->op_next = (OP*)condop;
3181 first->op_sibling = trueop;
3182 trueop->op_sibling = falseop;
3183 o = newUNOP(OP_NULL, 0, (OP*)condop);
3185 trueop->op_next = o;
3186 falseop->op_next = o;
3192 newRANGE(I32 flags, OP *left, OP *right)
3200 Newz(1101, condop, 1, CONDOP);
3202 condop->op_type = OP_RANGE;
3203 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3204 condop->op_first = left;
3205 condop->op_flags = OPf_KIDS;
3206 condop->op_true = LINKLIST(left);
3207 condop->op_false = LINKLIST(right);
3208 condop->op_private = 1 | (flags >> 8);
3210 left->op_sibling = right;
3212 condop->op_next = (OP*)condop;
3213 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3214 flop = newUNOP(OP_FLOP, 0, flip);
3215 o = newUNOP(OP_NULL, 0, flop);
3218 left->op_next = flip;
3219 right->op_next = flop;
3221 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3222 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3223 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3224 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3226 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3227 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3230 if (!flip->op_private || !flop->op_private)
3231 linklist(o); /* blow off optimizer unless constant */
3237 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3242 int once = block && block->op_flags & OPf_SPECIAL &&
3243 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3246 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3247 return block; /* do {} while 0 does once */
3248 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3249 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3250 expr = newUNOP(OP_DEFINED, 0,
3251 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3252 } else if (expr->op_flags & OPf_KIDS) {
3253 OP *k1 = ((UNOP*)expr)->op_first;
3254 OP *k2 = (k1) ? k1->op_sibling : NULL;
3255 switch (expr->op_type) {
3257 if (k2 && k2->op_type == OP_READLINE
3258 && (k2->op_flags & OPf_STACKED)
3259 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3260 expr = newUNOP(OP_DEFINED, 0, expr);
3264 if (k1->op_type == OP_READDIR
3265 || k1->op_type == OP_GLOB
3266 || k1->op_type == OP_EACH)
3267 expr = newUNOP(OP_DEFINED, 0, expr);
3273 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3274 o = new_logop(OP_AND, 0, &expr, &listop);
3277 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3279 if (once && o != listop)
3280 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3283 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3285 o->op_flags |= flags;
3287 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3292 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3301 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3302 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3303 expr = newUNOP(OP_DEFINED, 0,
3304 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3305 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3306 OP *k1 = ((UNOP*)expr)->op_first;
3307 OP *k2 = (k1) ? k1->op_sibling : NULL;
3308 switch (expr->op_type) {
3310 if (k2 && k2->op_type == OP_READLINE
3311 && (k2->op_flags & OPf_STACKED)
3312 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3313 expr = newUNOP(OP_DEFINED, 0, expr);
3317 if (k1->op_type == OP_READDIR
3318 || k1->op_type == OP_GLOB
3319 || k1->op_type == OP_EACH)
3320 expr = newUNOP(OP_DEFINED, 0, expr);
3326 block = newOP(OP_NULL, 0);
3329 next = LINKLIST(cont);
3331 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3332 if ((line_t)whileline != NOLINE) {
3333 PL_copline = whileline;
3334 cont = append_elem(OP_LINESEQ, cont,
3335 newSTATEOP(0, Nullch, Nullop));
3339 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3340 redo = LINKLIST(listop);
3343 PL_copline = whileline;
3345 o = new_logop(OP_AND, 0, &expr, &listop);
3346 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3347 op_free(expr); /* oops, it's a while (0) */
3349 return Nullop; /* listop already freed by new_logop */
3352 ((LISTOP*)listop)->op_last->op_next = condop =
3353 (o == listop ? redo : LINKLIST(o));
3361 Newz(1101,loop,1,LOOP);
3362 loop->op_type = OP_ENTERLOOP;
3363 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3364 loop->op_private = 0;
3365 loop->op_next = (OP*)loop;
3368 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3370 loop->op_redoop = redo;
3371 loop->op_lastop = o;
3374 loop->op_nextop = next;
3376 loop->op_nextop = o;
3378 o->op_flags |= flags;
3379 o->op_private |= (flags >> 8);
3384 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3392 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3393 sv->op_type = OP_RV2GV;
3394 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3396 else if (sv->op_type == OP_PADSV) { /* private variable */
3397 padoff = sv->op_targ;
3401 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3402 padoff = sv->op_targ;
3403 iterflags |= OPf_SPECIAL;
3408 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3412 padoff = find_threadsv("_");
3413 iterflags |= OPf_SPECIAL;
3415 sv = newGVOP(OP_GV, 0, PL_defgv);
3418 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3419 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3420 iterflags |= OPf_STACKED;
3422 else if (expr->op_type == OP_NULL &&
3423 (expr->op_flags & OPf_KIDS) &&
3424 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3426 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3427 * set the STACKED flag to indicate that these values are to be
3428 * treated as min/max values by 'pp_iterinit'.
3430 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3431 CONDOP* range = (CONDOP*) flip->op_first;
3432 OP* left = range->op_first;
3433 OP* right = left->op_sibling;
3436 range->op_flags &= ~OPf_KIDS;
3437 range->op_first = Nullop;
3439 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3440 listop->op_first->op_next = range->op_true;
3441 left->op_next = range->op_false;
3442 right->op_next = (OP*)listop;
3443 listop->op_next = listop->op_first;
3446 expr = (OP*)(listop);
3448 iterflags |= OPf_STACKED;
3451 expr = mod(force_list(expr), OP_GREPSTART);
3455 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3456 append_elem(OP_LIST, expr, scalar(sv))));
3457 assert(!loop->op_next);
3458 Renew(loop, 1, LOOP);
3459 loop->op_targ = padoff;
3460 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3461 PL_copline = forline;
3462 return newSTATEOP(0, label, wop);
3466 newLOOPEX(I32 type, OP *label)
3472 if (type != OP_GOTO || label->op_type == OP_CONST) {
3473 /* "last()" means "last" */
3474 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3475 o = newOP(type, OPf_SPECIAL);
3477 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3478 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3484 if (label->op_type == OP_ENTERSUB)
3485 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3486 o = newUNOP(type, OPf_STACKED, label);
3488 PL_hints |= HINT_BLOCK_SCOPE;
3498 MUTEX_DESTROY(CvMUTEXP(cv));
3499 Safefree(CvMUTEXP(cv));
3502 #endif /* USE_THREADS */
3504 if (!CvXSUB(cv) && CvROOT(cv)) {
3506 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3507 croak("Can't undef active subroutine");
3510 croak("Can't undef active subroutine");
3511 #endif /* USE_THREADS */
3514 SAVESPTR(PL_curpad);
3518 op_free(CvROOT(cv));
3519 CvROOT(cv) = Nullop;
3522 SvPOK_off((SV*)cv); /* forget prototype */
3524 SvREFCNT_dec(CvGV(cv));
3526 SvREFCNT_dec(CvOUTSIDE(cv));
3527 CvOUTSIDE(cv) = Nullcv;
3528 if (CvPADLIST(cv)) {
3529 /* may be during global destruction */
3530 if (SvREFCNT(CvPADLIST(cv))) {
3531 I32 i = AvFILLp(CvPADLIST(cv));
3533 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3534 SV* sv = svp ? *svp : Nullsv;
3537 if (sv == (SV*)PL_comppad_name)
3538 PL_comppad_name = Nullav;
3539 else if (sv == (SV*)PL_comppad) {
3540 PL_comppad = Nullav;
3541 PL_curpad = Null(SV**);
3545 SvREFCNT_dec((SV*)CvPADLIST(cv));
3547 CvPADLIST(cv) = Nullav;
3551 #ifdef DEBUG_CLOSURES
3556 CV *outside = CvOUTSIDE(cv);
3557 AV* padlist = CvPADLIST(cv);
3564 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3566 (CvANON(cv) ? "ANON"
3567 : (cv == PL_main_cv) ? "MAIN"
3568 : CvUNIQUE(cv) ? "UNIQUE"
3569 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3572 : CvANON(outside) ? "ANON"
3573 : (outside == PL_main_cv) ? "MAIN"
3574 : CvUNIQUE(outside) ? "UNIQUE"
3575 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3580 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3581 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3582 pname = AvARRAY(pad_name);
3583 ppad = AvARRAY(pad);
3585 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3586 if (SvPOK(pname[ix]))
3587 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3589 SvFAKE(pname[ix]) ? "FAKE " : "",
3591 (long)I_32(SvNVX(pname[ix])),
3592 (long)SvIVX(pname[ix]));
3595 #endif /* DEBUG_CLOSURES */
3598 cv_clone2(CV *proto, CV *outside)
3603 AV* protopadlist = CvPADLIST(proto);
3604 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3605 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3606 SV** pname = AvARRAY(protopad_name);
3607 SV** ppad = AvARRAY(protopad);
3608 I32 fname = AvFILLp(protopad_name);
3609 I32 fpad = AvFILLp(protopad);
3613 assert(!CvUNIQUE(proto));
3616 SAVESPTR(PL_curpad);
3617 SAVESPTR(PL_comppad);
3618 SAVESPTR(PL_comppad_name);
3619 SAVESPTR(PL_compcv);
3621 cv = PL_compcv = (CV*)NEWSV(1104,0);
3622 sv_upgrade((SV *)cv, SvTYPE(proto));
3628 New(666, CvMUTEXP(cv), 1, perl_mutex);
3629 MUTEX_INIT(CvMUTEXP(cv));
3631 #endif /* USE_THREADS */
3632 CvFILEGV(cv) = CvFILEGV(proto);
3633 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3634 CvSTASH(cv) = CvSTASH(proto);
3635 CvROOT(cv) = CvROOT(proto);
3636 CvSTART(cv) = CvSTART(proto);
3638 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3641 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3643 PL_comppad_name = newAV();
3644 for (ix = fname; ix >= 0; ix--)
3645 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3647 PL_comppad = newAV();
3649 comppadlist = newAV();
3650 AvREAL_off(comppadlist);
3651 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3652 av_store(comppadlist, 1, (SV*)PL_comppad);
3653 CvPADLIST(cv) = comppadlist;
3654 av_fill(PL_comppad, AvFILLp(protopad));
3655 PL_curpad = AvARRAY(PL_comppad);
3657 av = newAV(); /* will be @_ */
3659 av_store(PL_comppad, 0, (SV*)av);
3660 AvFLAGS(av) = AVf_REIFY;
3662 for (ix = fpad; ix > 0; ix--) {
3663 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3664 if (namesv && namesv != &PL_sv_undef) {
3665 char *name = SvPVX(namesv); /* XXX */
3666 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3667 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3668 CvOUTSIDE(cv), cxstack_ix, 0);
3670 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3672 croak("panic: cv_clone: %s", name);
3674 else { /* our own lexical */
3677 /* anon code -- we'll come back for it */
3678 sv = SvREFCNT_inc(ppad[ix]);
3680 else if (*name == '@')
3682 else if (*name == '%')
3692 SV* sv = NEWSV(0,0);
3698 /* Now that vars are all in place, clone nested closures. */
3700 for (ix = fpad; ix > 0; ix--) {
3701 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3703 && namesv != &PL_sv_undef
3704 && !(SvFLAGS(namesv) & SVf_FAKE)
3705 && *SvPVX(namesv) == '&'
3706 && CvCLONE(ppad[ix]))
3708 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3709 SvREFCNT_dec(ppad[ix]);
3712 PL_curpad[ix] = (SV*)kid;
3716 #ifdef DEBUG_CLOSURES
3717 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3719 PerlIO_printf(Perl_debug_log, " from:\n");
3721 PerlIO_printf(Perl_debug_log, " to:\n");
3733 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3734 cv = cv_clone2(proto, CvOUTSIDE(proto));
3735 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3740 cv_ckproto(CV *cv, GV *gv, char *p)
3742 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3743 SV* msg = sv_newmortal();
3747 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3748 sv_setpv(msg, "Prototype mismatch:");
3750 sv_catpvf(msg, " sub %_", name);
3752 sv_catpvf(msg, " (%s)", SvPVX(cv));
3753 sv_catpv(msg, " vs ");
3755 sv_catpvf(msg, "(%s)", p);
3757 sv_catpv(msg, "none");
3765 if (!cv || !SvPOK(cv) || SvCUR(cv))
3767 return op_const_sv(CvSTART(cv), cv);
3771 op_const_sv(OP *o, CV *cv)
3778 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3779 o = cLISTOPo->op_first->op_sibling;
3781 for (; o; o = o->op_next) {
3782 OPCODE type = o->op_type;
3784 if(sv && o->op_next == o)
3786 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3788 if (type == OP_LEAVESUB || type == OP_RETURN)
3792 if (type == OP_CONST)
3794 else if (type == OP_PADSV && cv) {
3795 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3796 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3797 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3809 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3813 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3814 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3815 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3816 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3825 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3826 maximum a prototype before. */
3827 if (SvTYPE(gv) > SVt_NULL) {
3828 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3829 warn("Runaway prototype");
3830 cv_ckproto((CV*)gv, NULL, ps);
3833 sv_setpv((SV*)gv, ps);
3835 sv_setiv((SV*)gv, -1);
3836 SvREFCNT_dec(PL_compcv);
3837 cv = PL_compcv = NULL;
3838 PL_sub_generation++;
3842 if (!name || GvCVGEN(gv))
3844 else if (cv = GvCV(gv)) {
3845 cv_ckproto(cv, gv, ps);
3846 /* already defined (or promised)? */
3847 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3849 bool const_changed = TRUE;
3851 /* just a "sub foo;" when &foo is already defined */
3852 SAVEFREESV(PL_compcv);
3855 /* ahem, death to those who redefine active sort subs */
3856 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3857 croak("Can't redefine active sort subroutine %s", name);
3858 if(const_sv = cv_const_sv(cv))
3859 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3860 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3861 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3862 && HvNAME(GvSTASH(CvGV(cv)))
3863 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3865 line_t oldline = PL_curcop->cop_line;
3866 PL_curcop->cop_line = PL_copline;
3867 warner(WARN_REDEFINE,
3868 const_sv ? "Constant subroutine %s redefined"
3869 : "Subroutine %s redefined", name);
3870 PL_curcop->cop_line = oldline;
3876 if (cv) { /* must reuse cv if autoloaded */
3878 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3879 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3880 CvOUTSIDE(PL_compcv) = 0;
3881 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3882 CvPADLIST(PL_compcv) = 0;
3883 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3884 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3885 SvREFCNT_dec(PL_compcv);
3892 PL_sub_generation++;
3895 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3896 CvFILEGV(cv) = PL_curcop->cop_filegv;
3897 CvSTASH(cv) = PL_curstash;
3900 if (!CvMUTEXP(cv)) {
3901 New(666, CvMUTEXP(cv), 1, perl_mutex);
3902 MUTEX_INIT(CvMUTEXP(cv));
3904 #endif /* USE_THREADS */
3907 sv_setpv((SV*)cv, ps);
3909 if (PL_error_count) {
3913 char *s = strrchr(name, ':');
3915 if (strEQ(s, "BEGIN")) {
3917 "BEGIN not safe after errors--compilation aborted";
3921 /* force display of errors found but not reported */
3922 sv_catpv(ERRSV, not_safe);
3923 croak("%s", SvPVx(ERRSV, n_a));
3930 PL_copline = NOLINE;
3935 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3936 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3939 SV **namep = AvARRAY(PL_comppad_name);
3940 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3943 if (SvIMMORTAL(PL_curpad[ix]))
3946 * The only things that a clonable function needs in its
3947 * pad are references to outer lexicals and anonymous subs.
3948 * The rest are created anew during cloning.
3950 if (!((namesv = namep[ix]) != Nullsv &&
3951 namesv != &PL_sv_undef &&
3953 *SvPVX(namesv) == '&')))
3955 SvREFCNT_dec(PL_curpad[ix]);
3956 PL_curpad[ix] = Nullsv;
3961 AV *av = newAV(); /* Will be @_ */
3963 av_store(PL_comppad, 0, (SV*)av);
3964 AvFLAGS(av) = AVf_REIFY;
3966 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3967 if (SvIMMORTAL(PL_curpad[ix]))
3969 if (!SvPADMY(PL_curpad[ix]))
3970 SvPADTMP_on(PL_curpad[ix]);
3974 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3975 CvSTART(cv) = LINKLIST(CvROOT(cv));
3976 CvROOT(cv)->op_next = 0;
3982 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3983 SV *sv = NEWSV(0,0);
3984 SV *tmpstr = sv_newmortal();
3985 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3989 sv_setpvf(sv, "%_:%ld-%ld",
3990 GvSV(PL_curcop->cop_filegv),
3991 (long)PL_subline, (long)PL_curcop->cop_line);
3992 gv_efullname3(tmpstr, gv, Nullch);
3993 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3994 hv = GvHVn(db_postponed);
3995 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3996 && (cv = GvCV(db_postponed))) {
4001 perl_call_sv((SV*)cv, G_DISCARD);
4005 if ((s = strrchr(name,':')))
4009 if (strEQ(s, "BEGIN")) {
4010 I32 oldscope = PL_scopestack_ix;
4012 SAVESPTR(PL_compiling.cop_filegv);
4013 SAVEI16(PL_compiling.cop_line);
4015 sv_setsv(PL_rs, PL_nrs);
4018 PL_beginav = newAV();
4019 DEBUG_x( dump_sub(gv) );
4020 av_push(PL_beginav, (SV *)cv);
4022 call_list(oldscope, PL_beginav);
4024 PL_curcop = &PL_compiling;
4025 PL_compiling.op_private = PL_hints;
4028 else if (strEQ(s, "END") && !PL_error_count) {
4031 av_unshift(PL_endav, 1);
4032 av_store(PL_endav, 0, (SV *)cv);
4035 else if (strEQ(s, "INIT") && !PL_error_count) {
4037 PL_initav = newAV();
4038 av_push(PL_initav, SvREFCNT_inc(cv));
4044 PL_copline = NOLINE;
4049 /* XXX unsafe for threads if eval_owner isn't held */
4051 newCONSTSUB(HV *stash, char *name, SV *sv)
4054 U32 oldhints = PL_hints;
4055 HV *old_cop_stash = PL_curcop->cop_stash;
4056 HV *old_curstash = PL_curstash;
4057 line_t oldline = PL_curcop->cop_line;
4058 PL_curcop->cop_line = PL_copline;
4060 PL_hints &= ~HINT_BLOCK_SCOPE;
4062 PL_curstash = PL_curcop->cop_stash = stash;
4065 start_subparse(FALSE, 0),
4066 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4067 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4068 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4071 PL_hints = oldhints;
4072 PL_curcop->cop_stash = old_cop_stash;
4073 PL_curstash = old_curstash;
4074 PL_curcop->cop_line = oldline;
4078 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4081 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4084 if (cv = (name ? GvCV(gv) : Nullcv)) {
4086 /* just a cached method */
4090 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4091 /* already defined (or promised) */
4092 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4093 && HvNAME(GvSTASH(CvGV(cv)))
4094 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4095 line_t oldline = PL_curcop->cop_line;
4096 if (PL_copline != NOLINE)
4097 PL_curcop->cop_line = PL_copline;
4098 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4099 PL_curcop->cop_line = oldline;
4106 if (cv) /* must reuse cv if autoloaded */
4109 cv = (CV*)NEWSV(1105,0);
4110 sv_upgrade((SV *)cv, SVt_PVCV);
4114 PL_sub_generation++;
4117 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4119 New(666, CvMUTEXP(cv), 1, perl_mutex);
4120 MUTEX_INIT(CvMUTEXP(cv));
4122 #endif /* USE_THREADS */
4123 CvFILEGV(cv) = gv_fetchfile(filename);
4124 CvXSUB(cv) = subaddr;
4127 char *s = strrchr(name,':');
4132 if (strEQ(s, "BEGIN")) {
4134 PL_beginav = newAV();
4135 av_push(PL_beginav, (SV *)cv);
4138 else if (strEQ(s, "END")) {
4141 av_unshift(PL_endav, 1);
4142 av_store(PL_endav, 0, (SV *)cv);
4145 else if (strEQ(s, "INIT")) {
4147 PL_initav = newAV();
4148 av_push(PL_initav, (SV *)cv);
4159 newFORM(I32 floor, OP *o, OP *block)
4169 name = SvPVx(cSVOPo->op_sv, n_a);
4172 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4174 if (cv = GvFORM(gv)) {
4175 if (ckWARN(WARN_REDEFINE)) {
4176 line_t oldline = PL_curcop->cop_line;
4178 PL_curcop->cop_line = PL_copline;
4179 warner(WARN_REDEFINE, "Format %s redefined",name);
4180 PL_curcop->cop_line = oldline;
4186 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4187 CvFILEGV(cv) = PL_curcop->cop_filegv;
4189 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4190 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4191 SvPADTMP_on(PL_curpad[ix]);
4194 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4195 CvSTART(cv) = LINKLIST(CvROOT(cv));
4196 CvROOT(cv)->op_next = 0;
4199 PL_copline = NOLINE;
4206 return newUNOP(OP_REFGEN, 0,
4207 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4213 return newUNOP(OP_REFGEN, 0,
4214 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4218 newANONSUB(I32 floor, OP *proto, OP *block)
4220 return newUNOP(OP_REFGEN, 0,
4221 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4227 switch (o->op_type) {
4229 o->op_type = OP_PADAV;
4230 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4231 return ref(o, OP_RV2AV);
4234 o->op_type = OP_RV2AV;
4235 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4240 warn("oops: oopsAV");
4249 switch (o->op_type) {
4252 o->op_type = OP_PADHV;
4253 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4254 return ref(o, OP_RV2HV);
4258 o->op_type = OP_RV2HV;
4259 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4264 warn("oops: oopsHV");
4273 if (o->op_type == OP_PADANY) {
4274 o->op_type = OP_PADAV;
4275 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4278 return newUNOP(OP_RV2AV, 0, scalar(o));
4282 newGVREF(I32 type, OP *o)
4284 if (type == OP_MAPSTART)
4285 return newUNOP(OP_NULL, 0, o);
4286 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4292 if (o->op_type == OP_PADANY) {
4293 o->op_type = OP_PADHV;
4294 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4297 return newUNOP(OP_RV2HV, 0, scalar(o));
4303 croak("NOT IMPL LINE %d",__LINE__);
4309 newCVREF(I32 flags, OP *o)
4311 return newUNOP(OP_RV2CV, flags, scalar(o));
4317 if (o->op_type == OP_PADANY) {
4318 o->op_type = OP_PADSV;
4319 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4322 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4323 o->op_flags |= OPpDONE_SVREF;
4326 return newUNOP(OP_RV2SV, 0, scalar(o));
4329 /* Check routines. */
4337 name = NEWSV(1106,0);
4338 sv_upgrade(name, SVt_PVNV);
4339 sv_setpvn(name, "&", 1);
4342 ix = pad_alloc(o->op_type, SVs_PADMY);
4343 av_store(PL_comppad_name, ix, name);
4344 av_store(PL_comppad, ix, cSVOPo->op_sv);
4345 SvPADMY_on(cSVOPo->op_sv);
4346 cSVOPo->op_sv = Nullsv;
4347 cSVOPo->op_targ = ix;
4354 o->op_private = PL_hints;
4361 if (cUNOPo->op_first->op_type == OP_CONCAT)
4362 o->op_flags |= OPf_STACKED;
4369 if (o->op_flags & OPf_KIDS) {
4372 OPCODE type = o->op_type;
4373 o = modkids(ck_fun(o), type);
4374 kid = cUNOPo->op_first;
4375 newop = kUNOP->op_first->op_sibling;
4377 (newop->op_sibling ||
4378 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4379 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4380 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4384 op_free(kUNOP->op_first);
4385 kUNOP->op_first = newop;
4387 o->op_ppaddr = PL_ppaddr[++o->op_type];
4396 if (o->op_flags & OPf_KIDS) {
4397 OP *kid = cUNOPo->op_first;
4398 if (kid->op_type == OP_HSLICE)
4399 o->op_private |= OPpSLICE;
4400 else if (kid->op_type != OP_HELEM)
4401 croak("%s argument is not a HASH element or slice",
4402 PL_op_desc[o->op_type]);
4411 I32 type = o->op_type;
4413 if (o->op_flags & OPf_KIDS) {
4414 if (cLISTOPo->op_first->op_type == OP_STUB) {
4416 o = newUNOP(type, OPf_SPECIAL,
4417 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4427 PL_hints |= HINT_BLOCK_SCOPE;
4428 if (o->op_flags & OPf_KIDS) {
4429 SVOP *kid = (SVOP*)cUNOPo->op_first;
4432 o->op_flags &= ~OPf_KIDS;
4435 else if (kid->op_type == OP_LINESEQ) {
4438 kid->op_next = o->op_next;
4439 cUNOPo->op_first = 0;
4442 Newz(1101, enter, 1, LOGOP);
4443 enter->op_type = OP_ENTERTRY;
4444 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4445 enter->op_private = 0;
4447 /* establish postfix order */
4448 enter->op_next = (OP*)enter;
4450 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4451 o->op_type = OP_LEAVETRY;
4452 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4453 enter->op_other = o;
4461 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4463 o->op_targ = (PADOFFSET)PL_hints;
4471 if (o->op_flags & OPf_STACKED) {
4473 kid = cUNOPo->op_first->op_sibling;
4474 if (kid->op_type == OP_RV2GV)
4486 if (o->op_flags & OPf_KIDS) {
4487 OP *kid = cUNOPo->op_first;
4488 if (kid->op_type != OP_HELEM)
4489 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4497 ck_gvconst(register OP *o)
4499 o = fold_constants(o);
4500 if (o->op_type == OP_CONST)
4507 ck_rvconst(register OP *o)
4510 SVOP *kid = (SVOP*)cUNOPo->op_first;
4512 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4513 if (kid->op_type == OP_CONST) {
4517 SV *kidsv = kid->op_sv;
4520 /* Is it a constant from cv_const_sv()? */
4521 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4522 SV *rsv = SvRV(kidsv);
4523 int svtype = SvTYPE(rsv);
4524 char *badtype = Nullch;
4526 switch (o->op_type) {
4528 if (svtype > SVt_PVMG)
4529 badtype = "a SCALAR";
4532 if (svtype != SVt_PVAV)
4533 badtype = "an ARRAY";
4536 if (svtype != SVt_PVHV) {
4537 if (svtype == SVt_PVAV) { /* pseudohash? */
4538 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4539 if (ksv && SvROK(*ksv)
4540 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4549 if (svtype != SVt_PVCV)
4554 croak("Constant is not %s reference", badtype);
4557 name = SvPV(kidsv, n_a);
4558 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4559 char *badthing = Nullch;
4560 switch (o->op_type) {
4562 badthing = "a SCALAR";
4565 badthing = "an ARRAY";
4568 badthing = "a HASH";
4573 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4577 * This is a little tricky. We only want to add the symbol if we
4578 * didn't add it in the lexer. Otherwise we get duplicate strict
4579 * warnings. But if we didn't add it in the lexer, we must at
4580 * least pretend like we wanted to add it even if it existed before,
4581 * or we get possible typo warnings. OPpCONST_ENTERED says
4582 * whether the lexer already added THIS instance of this symbol.
4584 iscv = (o->op_type == OP_RV2CV) * 2;
4586 gv = gv_fetchpv(name,
4587 iscv | !(kid->op_private & OPpCONST_ENTERED),
4590 : o->op_type == OP_RV2SV
4592 : o->op_type == OP_RV2AV
4594 : o->op_type == OP_RV2HV
4597 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4599 kid->op_type = OP_GV;
4600 SvREFCNT_dec(kid->op_sv);
4601 kid->op_sv = SvREFCNT_inc(gv);
4611 I32 type = o->op_type;
4613 if (o->op_flags & OPf_REF)
4616 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4617 SVOP *kid = (SVOP*)cUNOPo->op_first;
4619 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4621 OP *newop = newGVOP(type, OPf_REF,
4622 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4629 if (type == OP_FTTTY)
4630 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4633 return newUNOP(type, 0, newDEFSVOP());
4646 int type = o->op_type;
4647 register I32 oa = PL_opargs[type] >> OASHIFT;
4649 if (o->op_flags & OPf_STACKED) {
4650 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4653 return no_fh_allowed(o);
4656 if (o->op_flags & OPf_KIDS) {
4658 tokid = &cLISTOPo->op_first;
4659 kid = cLISTOPo->op_first;
4660 if (kid->op_type == OP_PUSHMARK ||
4661 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4663 tokid = &kid->op_sibling;
4664 kid = kid->op_sibling;
4666 if (!kid && PL_opargs[type] & OA_DEFGV)
4667 *tokid = kid = newDEFSVOP();
4671 sibl = kid->op_sibling;
4674 /* list seen where single (scalar) arg expected? */
4675 if (numargs == 1 && !(oa >> 4)
4676 && kid->op_type == OP_LIST && type != OP_SCALAR)
4678 return too_many_arguments(o,PL_op_desc[type]);
4691 if (kid->op_type == OP_CONST &&
4692 (kid->op_private & OPpCONST_BARE))
4694 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4695 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4696 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4697 if (ckWARN(WARN_SYNTAX))
4699 "Array @%s missing the @ in argument %ld of %s()",
4700 name, (long)numargs, PL_op_desc[type]);
4703 kid->op_sibling = sibl;
4706 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4707 bad_type(numargs, "array", PL_op_desc[type], kid);
4711 if (kid->op_type == OP_CONST &&
4712 (kid->op_private & OPpCONST_BARE))
4714 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4715 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4716 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4717 if (ckWARN(WARN_SYNTAX))
4719 "Hash %%%s missing the %% in argument %ld of %s()",
4720 name, (long)numargs, PL_op_desc[type]);
4723 kid->op_sibling = sibl;
4726 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4727 bad_type(numargs, "hash", PL_op_desc[type], kid);
4732 OP *newop = newUNOP(OP_NULL, 0, kid);
4733 kid->op_sibling = 0;
4735 newop->op_next = newop;
4737 kid->op_sibling = sibl;
4742 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4743 if (kid->op_type == OP_CONST &&
4744 (kid->op_private & OPpCONST_BARE))
4746 OP *newop = newGVOP(OP_GV, 0,
4747 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4752 else if (kid->op_type == OP_READLINE) {
4753 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4754 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4757 I32 flags = OPf_SPECIAL;
4758 /* is this op a FH constructor? */
4759 if (is_handle_constructor(o,numargs))
4761 kid->op_sibling = 0;
4762 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4764 kid->op_sibling = sibl;
4770 mod(scalar(kid), type);
4774 tokid = &kid->op_sibling;
4775 kid = kid->op_sibling;
4777 o->op_private |= numargs;
4779 return too_many_arguments(o,PL_op_desc[o->op_type]);
4782 else if (PL_opargs[type] & OA_DEFGV) {
4784 return newUNOP(type, 0, newDEFSVOP());
4788 while (oa & OA_OPTIONAL)
4790 if (oa && oa != OA_LIST)
4791 return too_few_arguments(o,PL_op_desc[o->op_type]);
4801 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4802 append_elem(OP_GLOB, o, newDEFSVOP());
4804 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4805 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4807 if (gv && GvIMPORTED_CV(gv)) {
4808 append_elem(OP_GLOB, o,
4809 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4810 o->op_type = OP_LIST;
4811 o->op_ppaddr = PL_ppaddr[OP_LIST];
4812 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4813 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4814 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4815 append_elem(OP_LIST, o,
4816 scalar(newUNOP(OP_RV2CV, 0,
4817 newGVOP(OP_GV, 0, gv)))));
4818 o = newUNOP(OP_NULL, 0, ck_subr(o));
4819 o->op_targ = OP_GLOB; /* hint at what it used to be */
4822 gv = newGVgen("main");
4824 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4834 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4836 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4837 Newz(1101, gwop, 1, LOGOP);
4839 if (o->op_flags & OPf_STACKED) {
4842 kid = cLISTOPo->op_first->op_sibling;
4843 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4846 kid->op_next = (OP*)gwop;
4847 o->op_flags &= ~OPf_STACKED;
4849 kid = cLISTOPo->op_first->op_sibling;
4850 if (type == OP_MAPWHILE)
4857 kid = cLISTOPo->op_first->op_sibling;
4858 if (kid->op_type != OP_NULL)
4859 croak("panic: ck_grep");
4860 kid = kUNOP->op_first;
4862 gwop->op_type = type;
4863 gwop->op_ppaddr = PL_ppaddr[type];
4864 gwop->op_first = listkids(o);
4865 gwop->op_flags |= OPf_KIDS;
4866 gwop->op_private = 1;
4867 gwop->op_other = LINKLIST(kid);
4868 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4869 kid->op_next = (OP*)gwop;
4871 kid = cLISTOPo->op_first->op_sibling;
4872 if (!kid || !kid->op_sibling)
4873 return too_few_arguments(o,PL_op_desc[o->op_type]);
4874 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4875 mod(kid, OP_GREPSTART);
4883 if (o->op_flags & OPf_KIDS) {
4884 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4886 kid = kid->op_sibling; /* get past "big" */
4887 if (kid && kid->op_type == OP_CONST)
4888 fbm_compile(((SVOP*)kid)->op_sv, 0);
4894 ck_lengthconst(OP *o)
4896 /* XXX length optimization goes here */
4903 OPCODE type = o->op_type;
4904 return modkids(ck_fun(o), type);
4910 OPCODE type = o->op_type;
4911 return refkids(ck_fun(o), type);
4919 kid = cLISTOPo->op_first;
4922 kid = cLISTOPo->op_first;
4924 if (kid->op_type == OP_PUSHMARK)
4925 kid = kid->op_sibling;
4926 if (kid && o->op_flags & OPf_STACKED)
4927 kid = kid->op_sibling;
4928 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4929 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4930 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4931 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4932 cLISTOPo->op_first->op_sibling = kid;
4933 cLISTOPo->op_last = kid;
4934 kid = kid->op_sibling;
4939 append_elem(o->op_type, o, newDEFSVOP());
4945 if (PL_hints & HINT_LOCALE)
4946 o->op_private |= OPpLOCALE;
4953 ck_fun_locale(OP *o)
4959 if (PL_hints & HINT_LOCALE)
4960 o->op_private |= OPpLOCALE;
4971 if (PL_hints & HINT_LOCALE)
4972 o->op_private |= OPpLOCALE;
4981 o->op_private |= OPpRUNTIME;
4994 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4995 o->op_private |= OPpREPEAT_DOLIST;
4996 cBINOPo->op_first = force_list(cBINOPo->op_first);
5006 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5007 SVOP *kid = (SVOP*)cUNOPo->op_first;
5009 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5011 for (s = SvPVX(kid->op_sv); *s; s++) {
5012 if (*s == ':' && s[1] == ':') {
5014 Move(s+2, s+1, strlen(s+2)+1, char);
5015 --SvCUR(kid->op_sv);
5018 sv_catpvn(kid->op_sv, ".pm", 3);
5028 croak("NOT IMPL LINE %d",__LINE__);
5038 if (o->op_flags & OPf_KIDS) {
5039 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5040 if (kid && kid->op_sibling) {
5041 o->op_type = OP_SSELECT;
5042 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5044 return fold_constants(o);
5048 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5049 if (kid && kid->op_type == OP_RV2GV)
5050 kid->op_private &= ~HINT_STRICT_REFS;
5057 I32 type = o->op_type;
5059 if (!(o->op_flags & OPf_KIDS)) {
5064 if (!CvUNIQUE(PL_compcv)) {
5065 argop = newOP(OP_PADAV, OPf_REF);
5066 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5069 argop = newUNOP(OP_RV2AV, 0,
5070 scalar(newGVOP(OP_GV, 0,
5071 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5074 argop = newUNOP(OP_RV2AV, 0,
5075 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5076 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5077 #endif /* USE_THREADS */
5078 return newUNOP(type, 0, scalar(argop));
5080 return scalar(modkids(ck_fun(o), type));
5088 if (PL_hints & HINT_LOCALE)
5089 o->op_private |= OPpLOCALE;
5092 if (o->op_flags & OPf_STACKED)
5094 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5095 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5097 kid = kUNOP->op_first; /* get past rv2gv */
5099 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5101 if (kid->op_type == OP_SCOPE) {
5105 else if (kid->op_type == OP_LEAVE) {
5106 if (o->op_type == OP_SORT) {
5107 null(kid); /* wipe out leave */
5110 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5111 if (k->op_next == kid)
5116 kid->op_next = 0; /* just disconnect the leave */
5117 k = kLISTOP->op_first;
5121 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5122 null(kid); /* wipe out rv2gv */
5123 if (o->op_type == OP_SORT)
5127 o->op_flags |= OPf_SPECIAL;
5129 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5130 null(cLISTOPo->op_first->op_sibling);
5137 simplify_sort(OP *o)
5140 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5143 if (!(o->op_flags & OPf_STACKED))
5145 kid = kUNOP->op_first; /* get past rv2gv */
5146 if (kid->op_type != OP_SCOPE)
5148 kid = kLISTOP->op_last; /* get past scope */
5149 switch(kid->op_type) {
5157 k = kid; /* remember this node*/
5158 if (kBINOP->op_first->op_type != OP_RV2SV)
5160 kid = kBINOP->op_first; /* get past cmp */
5161 if (kUNOP->op_first->op_type != OP_GV)
5163 kid = kUNOP->op_first; /* get past rv2sv */
5164 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5166 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5168 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5172 kid = k; /* back to cmp */
5173 if (kBINOP->op_last->op_type != OP_RV2SV)
5175 kid = kBINOP->op_last; /* down to 2nd arg */
5176 if (kUNOP->op_first->op_type != OP_GV)
5178 kid = kUNOP->op_first; /* get past rv2sv */
5179 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5181 ? strNE(GvNAME(kGVOP->op_gv), "a")
5182 : strNE(GvNAME(kGVOP->op_gv), "b")))
5184 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5186 o->op_private |= OPpSORT_REVERSE;
5187 if (k->op_type == OP_NCMP)
5188 o->op_private |= OPpSORT_NUMERIC;
5189 if (k->op_type == OP_I_NCMP)
5190 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5191 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5192 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5193 cLISTOPo->op_children = 1;
5201 if (o->op_flags & OPf_STACKED)
5202 return no_fh_allowed(o);
5204 kid = cLISTOPo->op_first;
5205 if (kid->op_type != OP_NULL)
5206 croak("panic: ck_split");
5207 kid = kid->op_sibling;
5208 op_free(cLISTOPo->op_first);
5209 cLISTOPo->op_first = kid;
5211 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5212 cLISTOPo->op_last = kid; /* There was only one element previously */
5215 if (kid->op_type != OP_MATCH) {
5216 OP *sibl = kid->op_sibling;
5217 kid->op_sibling = 0;
5218 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5219 if (cLISTOPo->op_first == cLISTOPo->op_last)
5220 cLISTOPo->op_last = kid;
5221 cLISTOPo->op_first = kid;
5222 kid->op_sibling = sibl;
5225 kid->op_type = OP_PUSHRE;
5226 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5229 if (!kid->op_sibling)
5230 append_elem(OP_SPLIT, o, newDEFSVOP());
5232 kid = kid->op_sibling;
5235 if (!kid->op_sibling)
5236 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5238 kid = kid->op_sibling;
5241 if (kid->op_sibling)
5242 return too_many_arguments(o,PL_op_desc[o->op_type]);
5251 OP *prev = ((cUNOPo->op_first->op_sibling)
5252 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5253 OP *o2 = prev->op_sibling;
5262 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5263 if (cvop->op_type == OP_RV2CV) {
5265 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5266 null(cvop); /* disable rv2cv */
5267 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5268 if (tmpop->op_type == OP_GV) {
5269 cv = GvCVu(tmpop->op_sv);
5270 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5271 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5272 proto = SvPV((SV*)cv, n_a);
5276 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5277 if (PERLDB_SUB && PL_curstash != PL_debstash)
5278 o->op_private |= OPpENTERSUB_DB;
5279 while (o2 != cvop) {
5283 return too_many_arguments(o, gv_ename(namegv));
5301 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5302 bad_type(arg, "block", gv_ename(namegv), o2);
5307 if (o2->op_type == OP_RV2GV)
5311 OP* sib = kid->op_sibling;
5312 kid->op_sibling = 0;
5313 o2 = newUNOP(OP_RV2GV, 0, kid);
5314 o2->op_sibling = sib;
5315 prev->op_sibling = o2;
5323 if (o2->op_type != OP_RV2GV)
5324 bad_type(arg, "symbol", gv_ename(namegv), o2);
5327 if (o2->op_type != OP_RV2CV)
5328 bad_type(arg, "sub", gv_ename(namegv), o2);
5331 if (o2->op_type != OP_RV2SV
5332 && o2->op_type != OP_PADSV
5333 && o2->op_type != OP_THREADSV)
5335 bad_type(arg, "scalar", gv_ename(namegv), o2);
5339 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5340 bad_type(arg, "array", gv_ename(namegv), o2);
5343 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5344 bad_type(arg, "hash", gv_ename(namegv), o2);
5348 OP* sib = kid->op_sibling;
5349 kid->op_sibling = 0;
5350 o2 = newUNOP(OP_REFGEN, 0, kid);
5351 o2->op_sibling = sib;
5352 prev->op_sibling = o2;
5363 croak("Malformed prototype for %s: %s",
5364 gv_ename(namegv), SvPV((SV*)cv, n_a));
5369 mod(o2, OP_ENTERSUB);
5371 o2 = o2->op_sibling;
5373 if (proto && !optional &&
5374 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5375 return too_few_arguments(o, gv_ename(namegv));
5382 SvREADONLY_on(cSVOPo->op_sv);
5389 if (o->op_flags & OPf_KIDS) {
5390 SVOP *kid = (SVOP*)cUNOPo->op_first;
5392 if (kid->op_type == OP_NULL)
5393 kid = (SVOP*)kid->op_sibling;
5395 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5396 o->op_flags |= OPf_SPECIAL;
5401 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5404 peep(register OP *o)
5407 register OP* oldop = 0;
5410 if (!o || o->op_seq)
5414 SAVESPTR(PL_curcop);
5415 for (; o; o = o->op_next) {
5421 switch (o->op_type) {
5424 PL_curcop = ((COP*)o); /* for warnings */
5425 o->op_seq = PL_op_seqmax++;
5436 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5438 o->op_seq = PL_op_seqmax++;
5441 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5442 o->op_seq = PL_op_seqmax++;
5443 break; /* Scalar stub must produce undef. List stub is noop */
5447 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5448 PL_curcop = ((COP*)o);
5454 if (oldop && o->op_next) {
5455 oldop->op_next = o->op_next;
5458 o->op_seq = PL_op_seqmax++;
5462 if (o->op_next->op_type == OP_RV2SV) {
5463 if (!(o->op_next->op_private & OPpDEREF)) {
5465 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5466 o->op_next = o->op_next->op_next;
5467 o->op_type = OP_GVSV;
5468 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5471 else if (o->op_next->op_type == OP_RV2AV) {
5472 OP* pop = o->op_next->op_next;
5474 if (pop->op_type == OP_CONST &&
5475 (PL_op = pop->op_next) &&
5476 pop->op_next->op_type == OP_AELEM &&
5477 !(pop->op_next->op_private &
5478 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5479 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5483 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5487 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5488 o->op_next = pop->op_next->op_next;
5489 o->op_type = OP_AELEMFAST;
5490 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5491 o->op_private = (U8)i;
5492 GvAVn(((GVOP*)o)->op_gv);
5495 o->op_seq = PL_op_seqmax++;
5502 o->op_seq = PL_op_seqmax++;
5503 while (cLOGOP->op_other->op_type == OP_NULL)
5504 cLOGOP->op_other = cLOGOP->op_other->op_next;
5505 peep(cLOGOP->op_other);
5509 o->op_seq = PL_op_seqmax++;
5510 peep(cCONDOP->op_true);
5511 peep(cCONDOP->op_false);
5515 o->op_seq = PL_op_seqmax++;
5516 peep(cLOOP->op_redoop);
5517 peep(cLOOP->op_nextop);
5518 peep(cLOOP->op_lastop);
5524 o->op_seq = PL_op_seqmax++;
5525 peep(cPMOP->op_pmreplstart);
5529 o->op_seq = PL_op_seqmax++;
5530 if (ckWARN(WARN_SYNTAX) && o->op_next
5531 && o->op_next->op_type == OP_NEXTSTATE) {
5532 if (o->op_next->op_sibling &&
5533 o->op_next->op_sibling->op_type != OP_EXIT &&
5534 o->op_next->op_sibling->op_type != OP_WARN &&
5535 o->op_next->op_sibling->op_type != OP_DIE) {
5536 line_t oldline = PL_curcop->cop_line;
5538 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5539 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5540 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5541 PL_curcop->cop_line = oldline;
5555 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5556 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5558 rop = (UNOP*)((BINOP*)o)->op_first;
5559 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5561 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5562 if (!SvOBJECT(lexname))
5564 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5565 if (!fields || !GvHV(*fields))
5567 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5568 key = SvPV(*svp, keylen);
5569 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5571 croak("No such field \"%s\" in variable %s of type %s",
5572 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5574 ind = SvIV(*indsvp);
5576 croak("Bad index while coercing array into hash");
5577 rop->op_type = OP_RV2AV;
5578 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5579 o->op_type = OP_AELEM;
5580 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5582 *svp = newSViv(ind);
5587 o->op_seq = PL_op_seqmax++;