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;
1259 PL_modcount = 10000;
1260 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1261 return o; /* Treat \(@foo) like ordinary list. */
1262 if (scalar_mod_type(o, type))
1268 croak("Can't localize lexical variable %s",
1269 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1274 PL_modcount++; /* XXX ??? */
1276 #endif /* USE_THREADS */
1282 if (type != OP_SASSIGN)
1286 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1292 pad_free(o->op_targ);
1293 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1294 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1295 if (o->op_flags & OPf_KIDS)
1296 mod(cBINOPo->op_first->op_sibling, type);
1301 ref(cBINOPo->op_first, o->op_type);
1302 if (type == OP_ENTERSUB &&
1303 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1304 o->op_private |= OPpLVAL_DEFER;
1311 if (o->op_flags & OPf_KIDS)
1312 mod(cLISTOPo->op_last, type);
1316 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1318 else if (!(o->op_flags & OPf_KIDS))
1320 if (o->op_targ != OP_LIST) {
1321 mod(cBINOPo->op_first, type);
1326 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1330 o->op_flags |= OPf_MOD;
1332 if (type == OP_AASSIGN || type == OP_SASSIGN)
1333 o->op_flags |= OPf_SPECIAL|OPf_REF;
1335 o->op_private |= OPpLVAL_INTRO;
1336 o->op_flags &= ~OPf_SPECIAL;
1337 PL_hints |= HINT_BLOCK_SCOPE;
1339 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1340 o->op_flags |= OPf_REF;
1345 scalar_mod_type(OP *o, I32 type)
1349 if (o->op_type == OP_RV2GV)
1373 case OP_RIGHT_SHIFT:
1383 case OP_ANDASSIGN: /* may work later */
1384 case OP_ORASSIGN: /* may work later */
1392 is_handle_constructor(OP *o, I32 argnum)
1394 switch (o->op_type) {
1414 refkids(OP *o, I32 type)
1417 if (o && o->op_flags & OPf_KIDS) {
1418 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1425 ref(OP *o, I32 type)
1429 if (!o || PL_error_count)
1432 switch (o->op_type) {
1434 if ((type == OP_DEFINED || type == OP_LOCK) &&
1435 !(o->op_flags & OPf_STACKED)) {
1436 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1437 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1438 assert(cUNOPo->op_first->op_type == OP_NULL);
1439 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1440 o->op_flags |= OPf_SPECIAL;
1445 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1449 if (type == OP_DEFINED)
1450 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1451 ref(cUNOPo->op_first, o->op_type);
1454 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1455 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1456 : type == OP_RV2HV ? OPpDEREF_HV
1458 o->op_flags |= OPf_MOD;
1463 o->op_flags |= OPf_MOD; /* XXX ??? */
1468 o->op_flags |= OPf_REF;
1471 if (type == OP_DEFINED)
1472 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1473 ref(cUNOPo->op_first, o->op_type);
1478 o->op_flags |= OPf_REF;
1483 if (!(o->op_flags & OPf_KIDS))
1485 ref(cBINOPo->op_first, type);
1489 ref(cBINOPo->op_first, o->op_type);
1490 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1491 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1492 : type == OP_RV2HV ? OPpDEREF_HV
1494 o->op_flags |= OPf_MOD;
1502 if (!(o->op_flags & OPf_KIDS))
1504 ref(cLISTOPo->op_last, type);
1519 if (!o || PL_error_count)
1523 if (type == OP_LIST) {
1524 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1526 } else if (type == OP_UNDEF) {
1528 } else if (type != OP_PADSV &&
1531 type != OP_PUSHMARK)
1533 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1536 o->op_flags |= OPf_MOD;
1537 o->op_private |= OPpLVAL_INTRO;
1545 o->op_flags |= OPf_PARENS;
1550 bind_match(I32 type, OP *left, OP *right)
1555 if (ckWARN(WARN_UNSAFE) &&
1556 (left->op_type == OP_RV2AV ||
1557 left->op_type == OP_RV2HV ||
1558 left->op_type == OP_PADAV ||
1559 left->op_type == OP_PADHV)) {
1560 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1561 right->op_type == OP_TRANS)
1562 ? right->op_type : OP_MATCH];
1563 char *sample = ((left->op_type == OP_RV2AV ||
1564 left->op_type == OP_PADAV)
1565 ? "@array" : "%hash");
1567 "Applying %s to %s will act on scalar(%s)",
1568 desc, sample, sample);
1571 if (right->op_type == OP_MATCH ||
1572 right->op_type == OP_SUBST ||
1573 right->op_type == OP_TRANS) {
1574 right->op_flags |= OPf_STACKED;
1575 if (right->op_type != OP_MATCH)
1576 left = mod(left, right->op_type);
1577 if (right->op_type == OP_TRANS)
1578 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1580 o = prepend_elem(right->op_type, scalar(left), right);
1582 return newUNOP(OP_NOT, 0, scalar(o));
1586 return bind_match(type, left,
1587 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1595 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1596 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1603 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1604 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1605 o->op_type = OP_LEAVE;
1606 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1609 if (o->op_type == OP_LINESEQ) {
1611 o->op_type = OP_SCOPE;
1612 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1613 kid = ((LISTOP*)o)->op_first;
1614 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1615 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1620 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1630 SAVESPTR(GvHV(PL_hintgv));
1631 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1632 SAVEFREESV(GvHV(PL_hintgv));
1636 block_start(int full)
1639 int retval = PL_savestack_ix;
1641 SAVEI32(PL_comppad_name_floor);
1643 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1644 PL_comppad_name_floor = PL_comppad_name_fill;
1646 PL_comppad_name_floor = 0;
1648 SAVEI32(PL_min_intro_pending);
1649 SAVEI32(PL_max_intro_pending);
1650 PL_min_intro_pending = 0;
1651 SAVEI32(PL_comppad_name_fill);
1652 SAVEI32(PL_padix_floor);
1653 PL_padix_floor = PL_padix;
1654 PL_pad_reset_pending = FALSE;
1656 PL_hints &= ~HINT_BLOCK_SCOPE;
1657 SAVEPPTR(PL_compiling.cop_warnings);
1658 if (PL_compiling.cop_warnings != WARN_ALL &&
1659 PL_compiling.cop_warnings != WARN_NONE) {
1660 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1661 SAVEFREESV(PL_compiling.cop_warnings) ;
1669 block_end(I32 floor, OP *seq)
1672 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1673 OP* retval = scalarseq(seq);
1675 PL_pad_reset_pending = FALSE;
1676 PL_compiling.op_private = PL_hints;
1678 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1679 pad_leavemy(PL_comppad_name_fill);
1688 OP *o = newOP(OP_THREADSV, 0);
1689 o->op_targ = find_threadsv("_");
1692 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1693 #endif /* USE_THREADS */
1701 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1702 PL_eval_start = linklist(PL_eval_root);
1703 PL_eval_root->op_next = 0;
1704 peep(PL_eval_start);
1709 PL_main_root = scope(sawparens(scalarvoid(o)));
1710 PL_curcop = &PL_compiling;
1711 PL_main_start = LINKLIST(PL_main_root);
1712 PL_main_root->op_next = 0;
1713 peep(PL_main_start);
1716 /* Register with debugger */
1718 CV *cv = perl_get_cv("DB::postponed", FALSE);
1722 XPUSHs((SV*)PL_compiling.cop_filegv);
1724 perl_call_sv((SV*)cv, G_DISCARD);
1731 localize(OP *o, I32 lex)
1733 if (o->op_flags & OPf_PARENS)
1737 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1739 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1740 if (*s == ';' || *s == '=')
1741 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1742 lex ? "my" : "local");
1746 PL_in_my_stash = Nullhv;
1750 return mod(o, OP_NULL); /* a bit kludgey */
1756 if (o->op_type == OP_LIST) {
1759 o2 = newOP(OP_THREADSV, 0);
1760 o2->op_targ = find_threadsv(";");
1762 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1763 #endif /* USE_THREADS */
1764 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1770 fold_constants(register OP *o)
1774 I32 type = o->op_type;
1777 if (PL_opargs[type] & OA_RETSCALAR)
1779 if (PL_opargs[type] & OA_TARGET)
1780 o->op_targ = pad_alloc(type, SVs_PADTMP);
1782 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1783 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1785 if (!(PL_opargs[type] & OA_FOLDCONST))
1800 if (o->op_private & OPpLOCALE)
1805 goto nope; /* Don't try to run w/ errors */
1807 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1808 if (curop->op_type != OP_CONST &&
1809 curop->op_type != OP_LIST &&
1810 curop->op_type != OP_SCALAR &&
1811 curop->op_type != OP_NULL &&
1812 curop->op_type != OP_PUSHMARK) {
1817 curop = LINKLIST(o);
1821 sv = *(PL_stack_sp--);
1822 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1823 pad_swipe(o->op_targ);
1824 else if (SvTEMP(sv)) { /* grab mortal temp? */
1825 (void)SvREFCNT_inc(sv);
1829 if (type == OP_RV2GV)
1830 return newGVOP(OP_GV, 0, (GV*)sv);
1832 /* try to smush double to int, but don't smush -2.0 to -2 */
1833 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1837 if ((double)iv == SvNV(sv)) {
1842 SvIOK_off(sv); /* undo SvIV() damage */
1844 return newSVOP(OP_CONST, 0, sv);
1848 if (!(PL_opargs[type] & OA_OTHERINT))
1851 if (!(PL_hints & HINT_INTEGER)) {
1852 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1855 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1856 if (curop->op_type == OP_CONST) {
1857 if (SvIOK(((SVOP*)curop)->op_sv))
1861 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1865 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1872 gen_constant_list(register OP *o)
1876 I32 oldtmps_floor = PL_tmps_floor;
1880 return o; /* Don't attempt to run with errors */
1882 PL_op = curop = LINKLIST(o);
1888 PL_tmps_floor = oldtmps_floor;
1890 o->op_type = OP_RV2AV;
1891 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1892 curop = ((UNOP*)o)->op_first;
1893 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1900 convert(I32 type, I32 flags, OP *o)
1905 if (!o || o->op_type != OP_LIST)
1906 o = newLISTOP(OP_LIST, 0, o, Nullop);
1908 o->op_flags &= ~OPf_WANT;
1910 if (!(PL_opargs[type] & OA_MARK))
1911 null(cLISTOPo->op_first);
1914 o->op_ppaddr = PL_ppaddr[type];
1915 o->op_flags |= flags;
1917 o = CHECKOP(type, o);
1918 if (o->op_type != type)
1921 if (cLISTOPo->op_children < 7) {
1922 /* XXX do we really need to do this if we're done appending?? */
1923 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1925 cLISTOPo->op_last = last; /* in case check substituted last arg */
1928 return fold_constants(o);
1931 /* List constructors */
1934 append_elem(I32 type, OP *first, OP *last)
1942 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1943 return newLISTOP(type, 0, first, last);
1945 if (first->op_flags & OPf_KIDS)
1946 ((LISTOP*)first)->op_last->op_sibling = last;
1948 first->op_flags |= OPf_KIDS;
1949 ((LISTOP*)first)->op_first = last;
1951 ((LISTOP*)first)->op_last = last;
1952 ((LISTOP*)first)->op_children++;
1957 append_list(I32 type, LISTOP *first, LISTOP *last)
1965 if (first->op_type != type)
1966 return prepend_elem(type, (OP*)first, (OP*)last);
1968 if (last->op_type != type)
1969 return append_elem(type, (OP*)first, (OP*)last);
1971 first->op_last->op_sibling = last->op_first;
1972 first->op_last = last->op_last;
1973 first->op_children += last->op_children;
1974 if (first->op_children)
1975 first->op_flags |= OPf_KIDS;
1982 prepend_elem(I32 type, OP *first, OP *last)
1990 if (last->op_type == type) {
1991 if (type == OP_LIST) { /* already a PUSHMARK there */
1992 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1993 ((LISTOP*)last)->op_first->op_sibling = first;
1996 if (!(last->op_flags & OPf_KIDS)) {
1997 ((LISTOP*)last)->op_last = first;
1998 last->op_flags |= OPf_KIDS;
2000 first->op_sibling = ((LISTOP*)last)->op_first;
2001 ((LISTOP*)last)->op_first = first;
2003 ((LISTOP*)last)->op_children++;
2007 return newLISTOP(type, 0, first, last);
2015 return newOP(OP_STUB, 0);
2021 if (!o || o->op_type != OP_LIST)
2022 o = newLISTOP(OP_LIST, 0, o, Nullop);
2028 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2032 Newz(1101, listop, 1, LISTOP);
2034 listop->op_type = type;
2035 listop->op_ppaddr = PL_ppaddr[type];
2036 listop->op_children = (first != 0) + (last != 0);
2037 listop->op_flags = flags;
2041 else if (!first && last)
2044 first->op_sibling = last;
2045 listop->op_first = first;
2046 listop->op_last = last;
2047 if (type == OP_LIST) {
2049 pushop = newOP(OP_PUSHMARK, 0);
2050 pushop->op_sibling = first;
2051 listop->op_first = pushop;
2052 listop->op_flags |= OPf_KIDS;
2054 listop->op_last = pushop;
2056 else if (listop->op_children)
2057 listop->op_flags |= OPf_KIDS;
2063 newOP(I32 type, I32 flags)
2066 Newz(1101, o, 1, OP);
2068 o->op_ppaddr = PL_ppaddr[type];
2069 o->op_flags = flags;
2072 o->op_private = 0 + (flags >> 8);
2073 if (PL_opargs[type] & OA_RETSCALAR)
2075 if (PL_opargs[type] & OA_TARGET)
2076 o->op_targ = pad_alloc(type, SVs_PADTMP);
2077 return CHECKOP(type, o);
2081 newUNOP(I32 type, I32 flags, OP *first)
2086 first = newOP(OP_STUB, 0);
2087 if (PL_opargs[type] & OA_MARK)
2088 first = force_list(first);
2090 Newz(1101, unop, 1, UNOP);
2091 unop->op_type = type;
2092 unop->op_ppaddr = PL_ppaddr[type];
2093 unop->op_first = first;
2094 unop->op_flags = flags | OPf_KIDS;
2095 unop->op_private = 1 | (flags >> 8);
2096 unop = (UNOP*) CHECKOP(type, unop);
2100 return fold_constants((OP *) unop);
2104 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2107 Newz(1101, binop, 1, BINOP);
2110 first = newOP(OP_NULL, 0);
2112 binop->op_type = type;
2113 binop->op_ppaddr = PL_ppaddr[type];
2114 binop->op_first = first;
2115 binop->op_flags = flags | OPf_KIDS;
2118 binop->op_private = 1 | (flags >> 8);
2121 binop->op_private = 2 | (flags >> 8);
2122 first->op_sibling = last;
2125 binop = (BINOP*)CHECKOP(type, binop);
2129 binop->op_last = binop->op_first->op_sibling;
2131 return fold_constants((OP *)binop);
2135 utf8compare(const void *a, const void *b)
2138 for (i = 0; i < 10; i++) {
2139 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2141 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2148 pmtrans(OP *o, OP *expr, OP *repl)
2150 SV *tstr = ((SVOP*)expr)->op_sv;
2151 SV *rstr = ((SVOP*)repl)->op_sv;
2154 register U8 *t = (U8*)SvPV(tstr, tlen);
2155 register U8 *r = (U8*)SvPV(rstr, rlen);
2161 register short *tbl;
2163 complement = o->op_private & OPpTRANS_COMPLEMENT;
2164 del = o->op_private & OPpTRANS_DELETE;
2165 squash = o->op_private & OPpTRANS_SQUASH;
2167 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2168 SV* listsv = newSVpv("# comment\n",0);
2170 U8* tend = t + tlen;
2171 U8* rend = r + rlen;
2187 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2188 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2194 New(1109, cp, tlen, U8*);
2196 transv = newSVpv("",0);
2205 qsort(cp, i, sizeof(U8*), utf8compare);
2206 for (j = 0; j < i; j++) {
2208 UV val = utf8_to_uv(s, &ulen);
2210 diff = val - nextmin;
2212 t = uv_to_utf8(tmpbuf,nextmin);
2213 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2215 t = uv_to_utf8(tmpbuf, val - 1);
2216 sv_catpvn(transv, "\377", 1);
2217 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2221 val = utf8_to_uv(s+1, &ulen);
2225 t = uv_to_utf8(tmpbuf,nextmin);
2226 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2227 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2228 sv_catpvn(transv, "\377", 1);
2229 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2230 t = (U8*)SvPVX(transv);
2231 tlen = SvCUR(transv);
2234 else if (!rlen && !del) {
2235 r = t; rlen = tlen; rend = tend;
2238 if (to_utf && from_utf) { /* only counting characters */
2239 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2240 o->op_private |= OPpTRANS_IDENTICAL;
2242 else { /* straight latin-1 translation */
2243 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2244 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2245 o->op_private |= OPpTRANS_IDENTICAL;
2249 while (t < tend || tfirst <= tlast) {
2250 /* see if we need more "t" chars */
2251 if (tfirst > tlast) {
2252 tfirst = (I32)utf8_to_uv(t, &ulen);
2254 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2255 tlast = (I32)utf8_to_uv(++t, &ulen);
2262 /* now see if we need more "r" chars */
2263 if (rfirst > rlast) {
2265 rfirst = (I32)utf8_to_uv(r, &ulen);
2267 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2268 rlast = (I32)utf8_to_uv(++r, &ulen);
2277 rfirst = rlast = 0xffffffff;
2281 /* now see which range will peter our first, if either. */
2282 tdiff = tlast - tfirst;
2283 rdiff = rlast - rfirst;
2290 if (rfirst == 0xffffffff) {
2291 diff = tdiff; /* oops, pretend rdiff is infinite */
2293 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2295 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2299 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2301 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2303 if (rfirst + diff > max)
2304 max = rfirst + diff;
2309 else if (rfirst <= 0x800)
2310 grows |= (tfirst < 0x80);
2311 else if (rfirst <= 0x10000)
2312 grows |= (tfirst < 0x800);
2313 else if (rfirst <= 0x200000)
2314 grows |= (tfirst < 0x10000);
2315 else if (rfirst <= 0x4000000)
2316 grows |= (tfirst < 0x200000);
2317 else if (rfirst <= 0x80000000)
2318 grows |= (tfirst < 0x4000000);
2330 else if (max > 0xff)
2335 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2336 SvREFCNT_dec(listsv);
2338 SvREFCNT_dec(transv);
2340 if (!del && havefinal)
2341 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2343 if (grows && to_utf)
2344 o->op_private |= OPpTRANS_GROWS;
2351 tbl = (short*)cPVOPo->op_pv;
2353 Zero(tbl, 256, short);
2354 for (i = 0; i < tlen; i++)
2356 for (i = 0, j = 0; i < 256; i++) {
2372 if (!rlen && !del) {
2375 o->op_private |= OPpTRANS_IDENTICAL;
2377 for (i = 0; i < 256; i++)
2379 for (i = 0, j = 0; i < tlen; i++,j++) {
2382 if (tbl[t[i]] == -1)
2388 if (tbl[t[i]] == -1)
2399 newPMOP(I32 type, I32 flags)
2404 Newz(1101, pmop, 1, PMOP);
2405 pmop->op_type = type;
2406 pmop->op_ppaddr = PL_ppaddr[type];
2407 pmop->op_flags = flags;
2408 pmop->op_private = 0 | (flags >> 8);
2410 if (PL_hints & HINT_RE_TAINT)
2411 pmop->op_pmpermflags |= PMf_RETAINT;
2412 if (PL_hints & HINT_LOCALE)
2413 pmop->op_pmpermflags |= PMf_LOCALE;
2414 pmop->op_pmflags = pmop->op_pmpermflags;
2416 /* link into pm list */
2417 if (type != OP_TRANS && PL_curstash) {
2418 pmop->op_pmnext = HvPMROOT(PL_curstash);
2419 HvPMROOT(PL_curstash) = pmop;
2426 pmruntime(OP *o, OP *expr, OP *repl)
2431 I32 repl_has_vars = 0;
2433 if (o->op_type == OP_TRANS)
2434 return pmtrans(o, expr, repl);
2436 PL_hints |= HINT_BLOCK_SCOPE;
2439 if (expr->op_type == OP_CONST) {
2441 SV *pat = ((SVOP*)expr)->op_sv;
2442 char *p = SvPV(pat, plen);
2443 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2444 sv_setpvn(pat, "\\s+", 3);
2445 p = SvPV(pat, plen);
2446 pm->op_pmflags |= PMf_SKIPWHITE;
2448 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2449 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2450 pm->op_pmflags |= PMf_WHITE;
2454 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2455 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2457 : OP_REGCMAYBE),0,expr);
2459 Newz(1101, rcop, 1, LOGOP);
2460 rcop->op_type = OP_REGCOMP;
2461 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2462 rcop->op_first = scalar(expr);
2463 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2464 ? (OPf_SPECIAL | OPf_KIDS)
2466 rcop->op_private = 1;
2469 /* establish postfix order */
2470 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2472 rcop->op_next = expr;
2473 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2476 rcop->op_next = LINKLIST(expr);
2477 expr->op_next = (OP*)rcop;
2480 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2485 if (pm->op_pmflags & PMf_EVAL)
2488 else if (repl->op_type == OP_THREADSV
2489 && strchr("&`'123456789+",
2490 PL_threadsv_names[repl->op_targ]))
2494 #endif /* USE_THREADS */
2495 else if (repl->op_type == OP_CONST)
2499 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2500 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2502 if (curop->op_type == OP_THREADSV) {
2504 if (strchr("&`'123456789+", curop->op_private))
2508 if (curop->op_type == OP_GV) {
2509 GV *gv = ((GVOP*)curop)->op_gv;
2511 if (strchr("&`'123456789+", *GvENAME(gv)))
2514 #endif /* USE_THREADS */
2515 else if (curop->op_type == OP_RV2CV)
2517 else if (curop->op_type == OP_RV2SV ||
2518 curop->op_type == OP_RV2AV ||
2519 curop->op_type == OP_RV2HV ||
2520 curop->op_type == OP_RV2GV) {
2521 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2524 else if (curop->op_type == OP_PADSV ||
2525 curop->op_type == OP_PADAV ||
2526 curop->op_type == OP_PADHV ||
2527 curop->op_type == OP_PADANY) {
2530 else if (curop->op_type == OP_PUSHRE)
2531 ; /* Okay here, dangerous in newASSIGNOP */
2540 && (!pm->op_pmregexp
2541 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2542 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2543 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2544 prepend_elem(o->op_type, scalar(repl), o);
2547 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2548 pm->op_pmflags |= PMf_MAYBE_CONST;
2549 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2551 Newz(1101, rcop, 1, LOGOP);
2552 rcop->op_type = OP_SUBSTCONT;
2553 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2554 rcop->op_first = scalar(repl);
2555 rcop->op_flags |= OPf_KIDS;
2556 rcop->op_private = 1;
2559 /* establish postfix order */
2560 rcop->op_next = LINKLIST(repl);
2561 repl->op_next = (OP*)rcop;
2563 pm->op_pmreplroot = scalar((OP*)rcop);
2564 pm->op_pmreplstart = LINKLIST(rcop);
2573 newSVOP(I32 type, I32 flags, SV *sv)
2576 Newz(1101, svop, 1, SVOP);
2577 svop->op_type = type;
2578 svop->op_ppaddr = PL_ppaddr[type];
2580 svop->op_next = (OP*)svop;
2581 svop->op_flags = flags;
2582 if (PL_opargs[type] & OA_RETSCALAR)
2584 if (PL_opargs[type] & OA_TARGET)
2585 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2586 return CHECKOP(type, svop);
2590 newGVOP(I32 type, I32 flags, GV *gv)
2594 Newz(1101, gvop, 1, GVOP);
2595 gvop->op_type = type;
2596 gvop->op_ppaddr = PL_ppaddr[type];
2597 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2598 gvop->op_next = (OP*)gvop;
2599 gvop->op_flags = flags;
2600 if (PL_opargs[type] & OA_RETSCALAR)
2602 if (PL_opargs[type] & OA_TARGET)
2603 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2604 return CHECKOP(type, gvop);
2608 newPVOP(I32 type, I32 flags, char *pv)
2611 Newz(1101, pvop, 1, PVOP);
2612 pvop->op_type = type;
2613 pvop->op_ppaddr = PL_ppaddr[type];
2615 pvop->op_next = (OP*)pvop;
2616 pvop->op_flags = flags;
2617 if (PL_opargs[type] & OA_RETSCALAR)
2619 if (PL_opargs[type] & OA_TARGET)
2620 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2621 return CHECKOP(type, pvop);
2630 save_hptr(&PL_curstash);
2631 save_item(PL_curstname);
2636 name = SvPV(sv, len);
2637 PL_curstash = gv_stashpvn(name,len,TRUE);
2638 sv_setpvn(PL_curstname, name, len);
2642 sv_setpv(PL_curstname,"<none>");
2643 PL_curstash = Nullhv;
2645 PL_hints |= HINT_BLOCK_SCOPE;
2646 PL_copline = NOLINE;
2651 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2660 if (id->op_type != OP_CONST)
2661 croak("Module name must be constant");
2665 if(version != Nullop) {
2666 SV *vesv = ((SVOP*)version)->op_sv;
2668 if (arg == Nullop && !SvNIOK(vesv)) {
2675 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2676 croak("Version number must be constant number");
2678 /* Make copy of id so we don't free it twice */
2679 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2681 /* Fake up a method call to VERSION */
2682 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2683 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2684 append_elem(OP_LIST,
2685 prepend_elem(OP_LIST, pack, list(version)),
2686 newUNOP(OP_METHOD, 0, meth)));
2690 /* Fake up an import/unimport */
2691 if (arg && arg->op_type == OP_STUB)
2692 imop = arg; /* no import on explicit () */
2693 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2694 imop = Nullop; /* use 5.0; */
2697 /* Make copy of id so we don't free it twice */
2698 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2699 meth = newSVOP(OP_CONST, 0,
2701 ? newSVpv("import", 6)
2702 : newSVpv("unimport", 8)
2704 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2705 append_elem(OP_LIST,
2706 prepend_elem(OP_LIST, pack, list(arg)),
2707 newUNOP(OP_METHOD, 0, meth)));
2710 /* Fake up a require, handle override, if any */
2711 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2712 if (!(gv && GvIMPORTED_CV(gv)))
2713 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2715 if (gv && GvIMPORTED_CV(gv)) {
2716 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2717 append_elem(OP_LIST, id,
2718 scalar(newUNOP(OP_RV2CV, 0,
2723 rqop = newUNOP(OP_REQUIRE, 0, id);
2726 /* Fake up the BEGIN {}, which does its thing immediately. */
2728 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2730 append_elem(OP_LINESEQ,
2731 append_elem(OP_LINESEQ,
2732 newSTATEOP(0, Nullch, rqop),
2733 newSTATEOP(0, Nullch, veop)),
2734 newSTATEOP(0, Nullch, imop) ));
2736 PL_copline = NOLINE;
2746 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2747 if (!(gv && GvIMPORTED_CV(gv)))
2748 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2750 if (gv && GvIMPORTED_CV(gv)) {
2751 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2752 append_elem(OP_LIST, term,
2753 scalar(newUNOP(OP_RV2CV, 0,
2758 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2764 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2766 return newBINOP(OP_LSLICE, flags,
2767 list(force_list(subscript)),
2768 list(force_list(listval)) );
2772 list_assignment(register OP *o)
2777 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2778 o = cUNOPo->op_first;
2780 if (o->op_type == OP_COND_EXPR) {
2781 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2782 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2787 yyerror("Assignment to both a list and a scalar");
2791 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2792 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2793 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2796 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2799 if (o->op_type == OP_RV2SV)
2806 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2811 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2812 return newLOGOP(optype, 0,
2813 mod(scalar(left), optype),
2814 newUNOP(OP_SASSIGN, 0, scalar(right)));
2817 return newBINOP(optype, OPf_STACKED,
2818 mod(scalar(left), optype), scalar(right));
2822 if (list_assignment(left)) {
2825 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2826 left = mod(left, OP_AASSIGN);
2834 o = newBINOP(OP_AASSIGN, flags,
2835 list(force_list(right)),
2836 list(force_list(left)) );
2837 o->op_private = 0 | (flags >> 8);
2838 if (!(left->op_private & OPpLVAL_INTRO)) {
2842 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2843 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2844 if (curop->op_type == OP_GV) {
2845 GV *gv = ((GVOP*)curop)->op_gv;
2846 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2848 SvCUR(gv) = PL_generation;
2850 else if (curop->op_type == OP_PADSV ||
2851 curop->op_type == OP_PADAV ||
2852 curop->op_type == OP_PADHV ||
2853 curop->op_type == OP_PADANY) {
2854 SV **svp = AvARRAY(PL_comppad_name);
2855 SV *sv = svp[curop->op_targ];
2856 if (SvCUR(sv) == PL_generation)
2858 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2860 else if (curop->op_type == OP_RV2CV)
2862 else if (curop->op_type == OP_RV2SV ||
2863 curop->op_type == OP_RV2AV ||
2864 curop->op_type == OP_RV2HV ||
2865 curop->op_type == OP_RV2GV) {
2866 if (lastop->op_type != OP_GV) /* funny deref? */
2869 else if (curop->op_type == OP_PUSHRE) {
2870 if (((PMOP*)curop)->op_pmreplroot) {
2871 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2872 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2874 SvCUR(gv) = PL_generation;
2883 o->op_private = OPpASSIGN_COMMON;
2885 if (right && right->op_type == OP_SPLIT) {
2887 if ((tmpop = ((LISTOP*)right)->op_first) &&
2888 tmpop->op_type == OP_PUSHRE)
2890 PMOP *pm = (PMOP*)tmpop;
2891 if (left->op_type == OP_RV2AV &&
2892 !(left->op_private & OPpLVAL_INTRO) &&
2893 !(o->op_private & OPpASSIGN_COMMON) )
2895 tmpop = ((UNOP*)left)->op_first;
2896 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2897 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2898 pm->op_pmflags |= PMf_ONCE;
2899 tmpop = cUNOPo->op_first; /* to list (nulled) */
2900 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2901 tmpop->op_sibling = Nullop; /* don't free split */
2902 right->op_next = tmpop->op_next; /* fix starting loc */
2903 op_free(o); /* blow off assign */
2904 right->op_flags &= ~OPf_WANT;
2905 /* "I don't know and I don't care." */
2910 if (PL_modcount < 10000 &&
2911 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2913 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2915 sv_setiv(sv, PL_modcount+1);
2923 right = newOP(OP_UNDEF, 0);
2924 if (right->op_type == OP_READLINE) {
2925 right->op_flags |= OPf_STACKED;
2926 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2929 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2930 o = newBINOP(OP_SASSIGN, flags,
2931 scalar(right), mod(scalar(left), OP_SASSIGN) );
2943 newSTATEOP(I32 flags, char *label, OP *o)
2946 U32 seq = intro_my();
2949 Newz(1101, cop, 1, COP);
2950 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2951 cop->op_type = OP_DBSTATE;
2952 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2955 cop->op_type = OP_NEXTSTATE;
2956 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2958 cop->op_flags = flags;
2959 cop->op_private = (PL_hints & HINT_UTF8);
2961 cop->op_private |= NATIVE_HINTS;
2963 PL_compiling.op_private = cop->op_private;
2964 cop->op_next = (OP*)cop;
2967 cop->cop_label = label;
2968 PL_hints |= HINT_BLOCK_SCOPE;
2971 cop->cop_arybase = PL_curcop->cop_arybase;
2972 if (PL_curcop->cop_warnings == WARN_NONE
2973 || PL_curcop->cop_warnings == WARN_ALL)
2974 cop->cop_warnings = PL_curcop->cop_warnings ;
2976 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2979 if (PL_copline == NOLINE)
2980 cop->cop_line = PL_curcop->cop_line;
2982 cop->cop_line = PL_copline;
2983 PL_copline = NOLINE;
2985 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2986 cop->cop_stash = PL_curstash;
2988 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2989 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2990 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2991 (void)SvIOK_on(*svp);
2993 SvSTASH(*svp) = (HV*)cop;
2997 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3000 /* "Introduce" my variables to visible status. */
3008 if (! PL_min_intro_pending)
3009 return PL_cop_seqmax;
3011 svp = AvARRAY(PL_comppad_name);
3012 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3013 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3014 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3015 SvNVX(sv) = (double)PL_cop_seqmax;
3018 PL_min_intro_pending = 0;
3019 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3020 return PL_cop_seqmax++;
3024 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
3026 return new_logop(type, flags, &first, &other);
3030 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3035 OP *first = *firstp;
3036 OP *other = *otherp;
3038 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3039 return newBINOP(type, flags, scalar(first), scalar(other));
3041 scalarboolean(first);
3042 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3043 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3044 if (type == OP_AND || type == OP_OR) {
3050 first = *firstp = cUNOPo->op_first;
3052 first->op_next = o->op_next;
3053 cUNOPo->op_first = Nullop;
3057 if (first->op_type == OP_CONST) {
3058 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3059 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3061 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3072 else if (first->op_type == OP_WANTARRAY) {
3078 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3079 OP *k1 = ((UNOP*)first)->op_first;
3080 OP *k2 = k1->op_sibling;
3082 switch (first->op_type)
3085 if (k2 && k2->op_type == OP_READLINE
3086 && (k2->op_flags & OPf_STACKED)
3087 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3088 warnop = k2->op_type;
3092 if (k1->op_type == OP_READDIR
3093 || k1->op_type == OP_GLOB
3094 || k1->op_type == OP_EACH)
3095 warnop = k1->op_type;
3099 line_t oldline = PL_curcop->cop_line;
3100 PL_curcop->cop_line = PL_copline;
3102 "Value of %s%s can be \"0\"; test with defined()",
3104 ((warnop == OP_READLINE || warnop == OP_GLOB)
3105 ? " construct" : "() operator"));
3106 PL_curcop->cop_line = oldline;
3113 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3114 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3116 Newz(1101, logop, 1, LOGOP);
3118 logop->op_type = type;
3119 logop->op_ppaddr = PL_ppaddr[type];
3120 logop->op_first = first;
3121 logop->op_flags = flags | OPf_KIDS;
3122 logop->op_other = LINKLIST(other);
3123 logop->op_private = 1 | (flags >> 8);
3125 /* establish postfix order */
3126 logop->op_next = LINKLIST(first);
3127 first->op_next = (OP*)logop;
3128 first->op_sibling = other;
3130 o = newUNOP(OP_NULL, 0, (OP*)logop);
3137 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3144 return newLOGOP(OP_AND, 0, first, trueop);
3146 return newLOGOP(OP_OR, 0, first, falseop);
3148 scalarboolean(first);
3149 if (first->op_type == OP_CONST) {
3150 if (SvTRUE(((SVOP*)first)->op_sv)) {
3161 else if (first->op_type == OP_WANTARRAY) {
3165 Newz(1101, condop, 1, CONDOP);
3167 condop->op_type = OP_COND_EXPR;
3168 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3169 condop->op_first = first;
3170 condop->op_flags = flags | OPf_KIDS;
3171 condop->op_true = LINKLIST(trueop);
3172 condop->op_false = LINKLIST(falseop);
3173 condop->op_private = 1 | (flags >> 8);
3175 /* establish postfix order */
3176 condop->op_next = LINKLIST(first);
3177 first->op_next = (OP*)condop;
3179 first->op_sibling = trueop;
3180 trueop->op_sibling = falseop;
3181 o = newUNOP(OP_NULL, 0, (OP*)condop);
3183 trueop->op_next = o;
3184 falseop->op_next = o;
3190 newRANGE(I32 flags, OP *left, OP *right)
3198 Newz(1101, condop, 1, CONDOP);
3200 condop->op_type = OP_RANGE;
3201 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3202 condop->op_first = left;
3203 condop->op_flags = OPf_KIDS;
3204 condop->op_true = LINKLIST(left);
3205 condop->op_false = LINKLIST(right);
3206 condop->op_private = 1 | (flags >> 8);
3208 left->op_sibling = right;
3210 condop->op_next = (OP*)condop;
3211 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3212 flop = newUNOP(OP_FLOP, 0, flip);
3213 o = newUNOP(OP_NULL, 0, flop);
3216 left->op_next = flip;
3217 right->op_next = flop;
3219 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3220 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3221 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3222 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3224 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3225 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3228 if (!flip->op_private || !flop->op_private)
3229 linklist(o); /* blow off optimizer unless constant */
3235 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3240 int once = block && block->op_flags & OPf_SPECIAL &&
3241 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3244 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3245 return block; /* do {} while 0 does once */
3246 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3247 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3248 expr = newUNOP(OP_DEFINED, 0,
3249 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3250 } else if (expr->op_flags & OPf_KIDS) {
3251 OP *k1 = ((UNOP*)expr)->op_first;
3252 OP *k2 = (k1) ? k1->op_sibling : NULL;
3253 switch (expr->op_type) {
3255 if (k2 && k2->op_type == OP_READLINE
3256 && (k2->op_flags & OPf_STACKED)
3257 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3258 expr = newUNOP(OP_DEFINED, 0, expr);
3262 if (k1->op_type == OP_READDIR
3263 || k1->op_type == OP_GLOB
3264 || k1->op_type == OP_EACH)
3265 expr = newUNOP(OP_DEFINED, 0, expr);
3271 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3272 o = new_logop(OP_AND, 0, &expr, &listop);
3275 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3277 if (once && o != listop)
3278 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3281 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3283 o->op_flags |= flags;
3285 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3290 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3299 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3300 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3301 expr = newUNOP(OP_DEFINED, 0,
3302 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3303 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3304 OP *k1 = ((UNOP*)expr)->op_first;
3305 OP *k2 = (k1) ? k1->op_sibling : NULL;
3306 switch (expr->op_type) {
3308 if (k2 && k2->op_type == OP_READLINE
3309 && (k2->op_flags & OPf_STACKED)
3310 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3311 expr = newUNOP(OP_DEFINED, 0, expr);
3315 if (k1->op_type == OP_READDIR
3316 || k1->op_type == OP_GLOB
3317 || k1->op_type == OP_EACH)
3318 expr = newUNOP(OP_DEFINED, 0, expr);
3324 block = newOP(OP_NULL, 0);
3327 next = LINKLIST(cont);
3329 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3330 if ((line_t)whileline != NOLINE) {
3331 PL_copline = whileline;
3332 cont = append_elem(OP_LINESEQ, cont,
3333 newSTATEOP(0, Nullch, Nullop));
3337 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3338 redo = LINKLIST(listop);
3341 PL_copline = whileline;
3343 o = new_logop(OP_AND, 0, &expr, &listop);
3344 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3345 op_free(expr); /* oops, it's a while (0) */
3347 return Nullop; /* listop already freed by new_logop */
3350 ((LISTOP*)listop)->op_last->op_next = condop =
3351 (o == listop ? redo : LINKLIST(o));
3359 Newz(1101,loop,1,LOOP);
3360 loop->op_type = OP_ENTERLOOP;
3361 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3362 loop->op_private = 0;
3363 loop->op_next = (OP*)loop;
3366 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3368 loop->op_redoop = redo;
3369 loop->op_lastop = o;
3372 loop->op_nextop = next;
3374 loop->op_nextop = o;
3376 o->op_flags |= flags;
3377 o->op_private |= (flags >> 8);
3382 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3390 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3391 sv->op_type = OP_RV2GV;
3392 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3394 else if (sv->op_type == OP_PADSV) { /* private variable */
3395 padoff = sv->op_targ;
3399 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3400 padoff = sv->op_targ;
3401 iterflags |= OPf_SPECIAL;
3406 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3410 padoff = find_threadsv("_");
3411 iterflags |= OPf_SPECIAL;
3413 sv = newGVOP(OP_GV, 0, PL_defgv);
3416 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3417 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3418 iterflags |= OPf_STACKED;
3420 else if (expr->op_type == OP_NULL &&
3421 (expr->op_flags & OPf_KIDS) &&
3422 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3424 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3425 * set the STACKED flag to indicate that these values are to be
3426 * treated as min/max values by 'pp_iterinit'.
3428 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3429 CONDOP* range = (CONDOP*) flip->op_first;
3430 OP* left = range->op_first;
3431 OP* right = left->op_sibling;
3434 range->op_flags &= ~OPf_KIDS;
3435 range->op_first = Nullop;
3437 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3438 listop->op_first->op_next = range->op_true;
3439 left->op_next = range->op_false;
3440 right->op_next = (OP*)listop;
3441 listop->op_next = listop->op_first;
3444 expr = (OP*)(listop);
3446 iterflags |= OPf_STACKED;
3449 expr = mod(force_list(expr), OP_GREPSTART);
3453 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3454 append_elem(OP_LIST, expr, scalar(sv))));
3455 assert(!loop->op_next);
3456 Renew(loop, 1, LOOP);
3457 loop->op_targ = padoff;
3458 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3459 PL_copline = forline;
3460 return newSTATEOP(0, label, wop);
3464 newLOOPEX(I32 type, OP *label)
3470 if (type != OP_GOTO || label->op_type == OP_CONST) {
3471 /* "last()" means "last" */
3472 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3473 o = newOP(type, OPf_SPECIAL);
3475 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3476 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3482 if (label->op_type == OP_ENTERSUB)
3483 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3484 o = newUNOP(type, OPf_STACKED, label);
3486 PL_hints |= HINT_BLOCK_SCOPE;
3496 MUTEX_DESTROY(CvMUTEXP(cv));
3497 Safefree(CvMUTEXP(cv));
3500 #endif /* USE_THREADS */
3502 if (!CvXSUB(cv) && CvROOT(cv)) {
3504 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3505 croak("Can't undef active subroutine");
3508 croak("Can't undef active subroutine");
3509 #endif /* USE_THREADS */
3512 SAVESPTR(PL_curpad);
3516 op_free(CvROOT(cv));
3517 CvROOT(cv) = Nullop;
3520 SvPOK_off((SV*)cv); /* forget prototype */
3522 SvREFCNT_dec(CvGV(cv));
3524 SvREFCNT_dec(CvOUTSIDE(cv));
3525 CvOUTSIDE(cv) = Nullcv;
3526 if (CvPADLIST(cv)) {
3527 /* may be during global destruction */
3528 if (SvREFCNT(CvPADLIST(cv))) {
3529 I32 i = AvFILLp(CvPADLIST(cv));
3531 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3532 SV* sv = svp ? *svp : Nullsv;
3535 if (sv == (SV*)PL_comppad_name)
3536 PL_comppad_name = Nullav;
3537 else if (sv == (SV*)PL_comppad) {
3538 PL_comppad = Nullav;
3539 PL_curpad = Null(SV**);
3543 SvREFCNT_dec((SV*)CvPADLIST(cv));
3545 CvPADLIST(cv) = Nullav;
3549 #ifdef DEBUG_CLOSURES
3554 CV *outside = CvOUTSIDE(cv);
3555 AV* padlist = CvPADLIST(cv);
3562 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3564 (CvANON(cv) ? "ANON"
3565 : (cv == PL_main_cv) ? "MAIN"
3566 : CvUNIQUE(cv) ? "UNIQUE"
3567 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3570 : CvANON(outside) ? "ANON"
3571 : (outside == PL_main_cv) ? "MAIN"
3572 : CvUNIQUE(outside) ? "UNIQUE"
3573 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3578 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3579 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3580 pname = AvARRAY(pad_name);
3581 ppad = AvARRAY(pad);
3583 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3584 if (SvPOK(pname[ix]))
3585 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3587 SvFAKE(pname[ix]) ? "FAKE " : "",
3589 (long)I_32(SvNVX(pname[ix])),
3590 (long)SvIVX(pname[ix]));
3593 #endif /* DEBUG_CLOSURES */
3596 cv_clone2(CV *proto, CV *outside)
3601 AV* protopadlist = CvPADLIST(proto);
3602 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3603 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3604 SV** pname = AvARRAY(protopad_name);
3605 SV** ppad = AvARRAY(protopad);
3606 I32 fname = AvFILLp(protopad_name);
3607 I32 fpad = AvFILLp(protopad);
3611 assert(!CvUNIQUE(proto));
3614 SAVESPTR(PL_curpad);
3615 SAVESPTR(PL_comppad);
3616 SAVESPTR(PL_comppad_name);
3617 SAVESPTR(PL_compcv);
3619 cv = PL_compcv = (CV*)NEWSV(1104,0);
3620 sv_upgrade((SV *)cv, SvTYPE(proto));
3626 New(666, CvMUTEXP(cv), 1, perl_mutex);
3627 MUTEX_INIT(CvMUTEXP(cv));
3629 #endif /* USE_THREADS */
3630 CvFILEGV(cv) = CvFILEGV(proto);
3631 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3632 CvSTASH(cv) = CvSTASH(proto);
3633 CvROOT(cv) = CvROOT(proto);
3634 CvSTART(cv) = CvSTART(proto);
3636 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3639 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3641 PL_comppad_name = newAV();
3642 for (ix = fname; ix >= 0; ix--)
3643 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3645 PL_comppad = newAV();
3647 comppadlist = newAV();
3648 AvREAL_off(comppadlist);
3649 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3650 av_store(comppadlist, 1, (SV*)PL_comppad);
3651 CvPADLIST(cv) = comppadlist;
3652 av_fill(PL_comppad, AvFILLp(protopad));
3653 PL_curpad = AvARRAY(PL_comppad);
3655 av = newAV(); /* will be @_ */
3657 av_store(PL_comppad, 0, (SV*)av);
3658 AvFLAGS(av) = AVf_REIFY;
3660 for (ix = fpad; ix > 0; ix--) {
3661 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3662 if (namesv && namesv != &PL_sv_undef) {
3663 char *name = SvPVX(namesv); /* XXX */
3664 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3665 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3666 CvOUTSIDE(cv), cxstack_ix, 0);
3668 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3670 croak("panic: cv_clone: %s", name);
3672 else { /* our own lexical */
3675 /* anon code -- we'll come back for it */
3676 sv = SvREFCNT_inc(ppad[ix]);
3678 else if (*name == '@')
3680 else if (*name == '%')
3690 SV* sv = NEWSV(0,0);
3696 /* Now that vars are all in place, clone nested closures. */
3698 for (ix = fpad; ix > 0; ix--) {
3699 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3701 && namesv != &PL_sv_undef
3702 && !(SvFLAGS(namesv) & SVf_FAKE)
3703 && *SvPVX(namesv) == '&'
3704 && CvCLONE(ppad[ix]))
3706 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3707 SvREFCNT_dec(ppad[ix]);
3710 PL_curpad[ix] = (SV*)kid;
3714 #ifdef DEBUG_CLOSURES
3715 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3717 PerlIO_printf(Perl_debug_log, " from:\n");
3719 PerlIO_printf(Perl_debug_log, " to:\n");
3731 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3732 cv = cv_clone2(proto, CvOUTSIDE(proto));
3733 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3738 cv_ckproto(CV *cv, GV *gv, char *p)
3740 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3741 SV* msg = sv_newmortal();
3745 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3746 sv_setpv(msg, "Prototype mismatch:");
3748 sv_catpvf(msg, " sub %_", name);
3750 sv_catpvf(msg, " (%s)", SvPVX(cv));
3751 sv_catpv(msg, " vs ");
3753 sv_catpvf(msg, "(%s)", p);
3755 sv_catpv(msg, "none");
3763 if (!cv || !SvPOK(cv) || SvCUR(cv))
3765 return op_const_sv(CvSTART(cv), cv);
3769 op_const_sv(OP *o, CV *cv)
3776 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3777 o = cLISTOPo->op_first->op_sibling;
3779 for (; o; o = o->op_next) {
3780 OPCODE type = o->op_type;
3782 if(sv && o->op_next == o)
3784 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3786 if (type == OP_LEAVESUB || type == OP_RETURN)
3790 if (type == OP_CONST)
3792 else if (type == OP_PADSV && cv) {
3793 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3794 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3795 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3807 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3811 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3812 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3813 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3814 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3823 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3824 maximum a prototype before. */
3825 if (SvTYPE(gv) > SVt_NULL) {
3826 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3827 warn("Runaway prototype");
3828 cv_ckproto((CV*)gv, NULL, ps);
3831 sv_setpv((SV*)gv, ps);
3833 sv_setiv((SV*)gv, -1);
3834 SvREFCNT_dec(PL_compcv);
3835 cv = PL_compcv = NULL;
3836 PL_sub_generation++;
3840 if (!name || GvCVGEN(gv))
3842 else if (cv = GvCV(gv)) {
3843 cv_ckproto(cv, gv, ps);
3844 /* already defined (or promised)? */
3845 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3847 bool const_changed = TRUE;
3849 /* just a "sub foo;" when &foo is already defined */
3850 SAVEFREESV(PL_compcv);
3853 /* ahem, death to those who redefine active sort subs */
3854 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3855 croak("Can't redefine active sort subroutine %s", name);
3856 if(const_sv = cv_const_sv(cv))
3857 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3858 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3859 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3860 && HvNAME(GvSTASH(CvGV(cv)))
3861 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3863 line_t oldline = PL_curcop->cop_line;
3864 PL_curcop->cop_line = PL_copline;
3865 warner(WARN_REDEFINE,
3866 const_sv ? "Constant subroutine %s redefined"
3867 : "Subroutine %s redefined", name);
3868 PL_curcop->cop_line = oldline;
3874 if (cv) { /* must reuse cv if autoloaded */
3876 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3877 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3878 CvOUTSIDE(PL_compcv) = 0;
3879 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3880 CvPADLIST(PL_compcv) = 0;
3881 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3882 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3883 SvREFCNT_dec(PL_compcv);
3890 PL_sub_generation++;
3893 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3894 CvFILEGV(cv) = PL_curcop->cop_filegv;
3895 CvSTASH(cv) = PL_curstash;
3898 if (!CvMUTEXP(cv)) {
3899 New(666, CvMUTEXP(cv), 1, perl_mutex);
3900 MUTEX_INIT(CvMUTEXP(cv));
3902 #endif /* USE_THREADS */
3905 sv_setpv((SV*)cv, ps);
3907 if (PL_error_count) {
3911 char *s = strrchr(name, ':');
3913 if (strEQ(s, "BEGIN")) {
3915 "BEGIN not safe after errors--compilation aborted";
3919 /* force display of errors found but not reported */
3920 sv_catpv(ERRSV, not_safe);
3921 croak("%s", SvPVx(ERRSV, n_a));
3928 PL_copline = NOLINE;
3933 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3934 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3937 SV **namep = AvARRAY(PL_comppad_name);
3938 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3941 if (SvIMMORTAL(PL_curpad[ix]))
3944 * The only things that a clonable function needs in its
3945 * pad are references to outer lexicals and anonymous subs.
3946 * The rest are created anew during cloning.
3948 if (!((namesv = namep[ix]) != Nullsv &&
3949 namesv != &PL_sv_undef &&
3951 *SvPVX(namesv) == '&')))
3953 SvREFCNT_dec(PL_curpad[ix]);
3954 PL_curpad[ix] = Nullsv;
3959 AV *av = newAV(); /* Will be @_ */
3961 av_store(PL_comppad, 0, (SV*)av);
3962 AvFLAGS(av) = AVf_REIFY;
3964 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3965 if (SvIMMORTAL(PL_curpad[ix]))
3967 if (!SvPADMY(PL_curpad[ix]))
3968 SvPADTMP_on(PL_curpad[ix]);
3972 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3973 CvSTART(cv) = LINKLIST(CvROOT(cv));
3974 CvROOT(cv)->op_next = 0;
3980 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3981 SV *sv = NEWSV(0,0);
3982 SV *tmpstr = sv_newmortal();
3983 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3987 sv_setpvf(sv, "%_:%ld-%ld",
3988 GvSV(PL_curcop->cop_filegv),
3989 (long)PL_subline, (long)PL_curcop->cop_line);
3990 gv_efullname3(tmpstr, gv, Nullch);
3991 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3992 hv = GvHVn(db_postponed);
3993 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3994 && (cv = GvCV(db_postponed))) {
3999 perl_call_sv((SV*)cv, G_DISCARD);
4003 if ((s = strrchr(name,':')))
4007 if (strEQ(s, "BEGIN")) {
4008 I32 oldscope = PL_scopestack_ix;
4010 SAVESPTR(PL_compiling.cop_filegv);
4011 SAVEI16(PL_compiling.cop_line);
4013 sv_setsv(PL_rs, PL_nrs);
4016 PL_beginav = newAV();
4017 DEBUG_x( dump_sub(gv) );
4018 av_push(PL_beginav, (SV *)cv);
4020 call_list(oldscope, PL_beginav);
4022 PL_curcop = &PL_compiling;
4023 PL_compiling.op_private = PL_hints;
4026 else if (strEQ(s, "END") && !PL_error_count) {
4029 av_unshift(PL_endav, 1);
4030 av_store(PL_endav, 0, (SV *)cv);
4033 else if (strEQ(s, "INIT") && !PL_error_count) {
4035 PL_initav = newAV();
4036 av_push(PL_initav, SvREFCNT_inc(cv));
4042 PL_copline = NOLINE;
4047 /* XXX unsafe for threads if eval_owner isn't held */
4049 newCONSTSUB(HV *stash, char *name, SV *sv)
4052 U32 oldhints = PL_hints;
4053 HV *old_cop_stash = PL_curcop->cop_stash;
4054 HV *old_curstash = PL_curstash;
4055 line_t oldline = PL_curcop->cop_line;
4056 PL_curcop->cop_line = PL_copline;
4058 PL_hints &= ~HINT_BLOCK_SCOPE;
4060 PL_curstash = PL_curcop->cop_stash = stash;
4063 start_subparse(FALSE, 0),
4064 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4065 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4066 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4069 PL_hints = oldhints;
4070 PL_curcop->cop_stash = old_cop_stash;
4071 PL_curstash = old_curstash;
4072 PL_curcop->cop_line = oldline;
4076 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4079 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4082 if (cv = (name ? GvCV(gv) : Nullcv)) {
4084 /* just a cached method */
4088 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4089 /* already defined (or promised) */
4090 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4091 && HvNAME(GvSTASH(CvGV(cv)))
4092 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4093 line_t oldline = PL_curcop->cop_line;
4094 if (PL_copline != NOLINE)
4095 PL_curcop->cop_line = PL_copline;
4096 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4097 PL_curcop->cop_line = oldline;
4104 if (cv) /* must reuse cv if autoloaded */
4107 cv = (CV*)NEWSV(1105,0);
4108 sv_upgrade((SV *)cv, SVt_PVCV);
4112 PL_sub_generation++;
4115 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4117 New(666, CvMUTEXP(cv), 1, perl_mutex);
4118 MUTEX_INIT(CvMUTEXP(cv));
4120 #endif /* USE_THREADS */
4121 CvFILEGV(cv) = gv_fetchfile(filename);
4122 CvXSUB(cv) = subaddr;
4125 char *s = strrchr(name,':');
4130 if (strEQ(s, "BEGIN")) {
4132 PL_beginav = newAV();
4133 av_push(PL_beginav, (SV *)cv);
4136 else if (strEQ(s, "END")) {
4139 av_unshift(PL_endav, 1);
4140 av_store(PL_endav, 0, (SV *)cv);
4143 else if (strEQ(s, "INIT")) {
4145 PL_initav = newAV();
4146 av_push(PL_initav, (SV *)cv);
4157 newFORM(I32 floor, OP *o, OP *block)
4167 name = SvPVx(cSVOPo->op_sv, n_a);
4170 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4172 if (cv = GvFORM(gv)) {
4173 if (ckWARN(WARN_REDEFINE)) {
4174 line_t oldline = PL_curcop->cop_line;
4176 PL_curcop->cop_line = PL_copline;
4177 warner(WARN_REDEFINE, "Format %s redefined",name);
4178 PL_curcop->cop_line = oldline;
4184 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4185 CvFILEGV(cv) = PL_curcop->cop_filegv;
4187 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4188 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4189 SvPADTMP_on(PL_curpad[ix]);
4192 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4193 CvSTART(cv) = LINKLIST(CvROOT(cv));
4194 CvROOT(cv)->op_next = 0;
4197 PL_copline = NOLINE;
4204 return newUNOP(OP_REFGEN, 0,
4205 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4211 return newUNOP(OP_REFGEN, 0,
4212 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4216 newANONSUB(I32 floor, OP *proto, OP *block)
4218 return newUNOP(OP_REFGEN, 0,
4219 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4225 switch (o->op_type) {
4227 o->op_type = OP_PADAV;
4228 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4229 return ref(o, OP_RV2AV);
4232 o->op_type = OP_RV2AV;
4233 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4238 warn("oops: oopsAV");
4247 switch (o->op_type) {
4250 o->op_type = OP_PADHV;
4251 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4252 return ref(o, OP_RV2HV);
4256 o->op_type = OP_RV2HV;
4257 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4262 warn("oops: oopsHV");
4271 if (o->op_type == OP_PADANY) {
4272 o->op_type = OP_PADAV;
4273 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4276 return newUNOP(OP_RV2AV, 0, scalar(o));
4280 newGVREF(I32 type, OP *o)
4282 if (type == OP_MAPSTART)
4283 return newUNOP(OP_NULL, 0, o);
4284 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4290 if (o->op_type == OP_PADANY) {
4291 o->op_type = OP_PADHV;
4292 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4295 return newUNOP(OP_RV2HV, 0, scalar(o));
4301 croak("NOT IMPL LINE %d",__LINE__);
4307 newCVREF(I32 flags, OP *o)
4309 return newUNOP(OP_RV2CV, flags, scalar(o));
4315 if (o->op_type == OP_PADANY) {
4316 o->op_type = OP_PADSV;
4317 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4320 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4321 o->op_flags |= OPpDONE_SVREF;
4324 return newUNOP(OP_RV2SV, 0, scalar(o));
4327 /* Check routines. */
4335 name = NEWSV(1106,0);
4336 sv_upgrade(name, SVt_PVNV);
4337 sv_setpvn(name, "&", 1);
4340 ix = pad_alloc(o->op_type, SVs_PADMY);
4341 av_store(PL_comppad_name, ix, name);
4342 av_store(PL_comppad, ix, cSVOPo->op_sv);
4343 SvPADMY_on(cSVOPo->op_sv);
4344 cSVOPo->op_sv = Nullsv;
4345 cSVOPo->op_targ = ix;
4352 o->op_private = PL_hints;
4359 if (cUNOPo->op_first->op_type == OP_CONCAT)
4360 o->op_flags |= OPf_STACKED;
4367 if (o->op_flags & OPf_KIDS) {
4370 OPCODE type = o->op_type;
4371 o = modkids(ck_fun(o), type);
4372 kid = cUNOPo->op_first;
4373 newop = kUNOP->op_first->op_sibling;
4375 (newop->op_sibling ||
4376 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4377 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4378 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4382 op_free(kUNOP->op_first);
4383 kUNOP->op_first = newop;
4385 o->op_ppaddr = PL_ppaddr[++o->op_type];
4394 if (o->op_flags & OPf_KIDS) {
4395 OP *kid = cUNOPo->op_first;
4396 if (kid->op_type == OP_HSLICE)
4397 o->op_private |= OPpSLICE;
4398 else if (kid->op_type != OP_HELEM)
4399 croak("%s argument is not a HASH element or slice",
4400 PL_op_desc[o->op_type]);
4409 I32 type = o->op_type;
4411 if (o->op_flags & OPf_KIDS) {
4412 if (cLISTOPo->op_first->op_type == OP_STUB) {
4414 o = newUNOP(type, OPf_SPECIAL,
4415 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4425 PL_hints |= HINT_BLOCK_SCOPE;
4426 if (o->op_flags & OPf_KIDS) {
4427 SVOP *kid = (SVOP*)cUNOPo->op_first;
4430 o->op_flags &= ~OPf_KIDS;
4433 else if (kid->op_type == OP_LINESEQ) {
4436 kid->op_next = o->op_next;
4437 cUNOPo->op_first = 0;
4440 Newz(1101, enter, 1, LOGOP);
4441 enter->op_type = OP_ENTERTRY;
4442 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4443 enter->op_private = 0;
4445 /* establish postfix order */
4446 enter->op_next = (OP*)enter;
4448 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4449 o->op_type = OP_LEAVETRY;
4450 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4451 enter->op_other = o;
4459 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4461 o->op_targ = (PADOFFSET)PL_hints;
4469 if (o->op_flags & OPf_STACKED) {
4471 kid = cUNOPo->op_first->op_sibling;
4472 if (kid->op_type == OP_RV2GV)
4484 if (o->op_flags & OPf_KIDS) {
4485 OP *kid = cUNOPo->op_first;
4486 if (kid->op_type != OP_HELEM)
4487 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4495 ck_gvconst(register OP *o)
4497 o = fold_constants(o);
4498 if (o->op_type == OP_CONST)
4505 ck_rvconst(register OP *o)
4508 SVOP *kid = (SVOP*)cUNOPo->op_first;
4510 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4511 if (kid->op_type == OP_CONST) {
4515 SV *kidsv = kid->op_sv;
4518 /* Is it a constant from cv_const_sv()? */
4519 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4520 SV *rsv = SvRV(kidsv);
4521 int svtype = SvTYPE(rsv);
4522 char *badtype = Nullch;
4524 switch (o->op_type) {
4526 if (svtype > SVt_PVMG)
4527 badtype = "a SCALAR";
4530 if (svtype != SVt_PVAV)
4531 badtype = "an ARRAY";
4534 if (svtype != SVt_PVHV) {
4535 if (svtype == SVt_PVAV) { /* pseudohash? */
4536 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4537 if (ksv && SvROK(*ksv)
4538 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4547 if (svtype != SVt_PVCV)
4552 croak("Constant is not %s reference", badtype);
4555 name = SvPV(kidsv, n_a);
4556 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4557 char *badthing = Nullch;
4558 switch (o->op_type) {
4560 badthing = "a SCALAR";
4563 badthing = "an ARRAY";
4566 badthing = "a HASH";
4571 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4575 * This is a little tricky. We only want to add the symbol if we
4576 * didn't add it in the lexer. Otherwise we get duplicate strict
4577 * warnings. But if we didn't add it in the lexer, we must at
4578 * least pretend like we wanted to add it even if it existed before,
4579 * or we get possible typo warnings. OPpCONST_ENTERED says
4580 * whether the lexer already added THIS instance of this symbol.
4582 iscv = (o->op_type == OP_RV2CV) * 2;
4584 gv = gv_fetchpv(name,
4585 iscv | !(kid->op_private & OPpCONST_ENTERED),
4588 : o->op_type == OP_RV2SV
4590 : o->op_type == OP_RV2AV
4592 : o->op_type == OP_RV2HV
4595 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4597 kid->op_type = OP_GV;
4598 SvREFCNT_dec(kid->op_sv);
4599 kid->op_sv = SvREFCNT_inc(gv);
4609 I32 type = o->op_type;
4611 if (o->op_flags & OPf_REF)
4614 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4615 SVOP *kid = (SVOP*)cUNOPo->op_first;
4617 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4619 OP *newop = newGVOP(type, OPf_REF,
4620 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4627 if (type == OP_FTTTY)
4628 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4631 return newUNOP(type, 0, newDEFSVOP());
4644 int type = o->op_type;
4645 register I32 oa = PL_opargs[type] >> OASHIFT;
4647 if (o->op_flags & OPf_STACKED) {
4648 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4651 return no_fh_allowed(o);
4654 if (o->op_flags & OPf_KIDS) {
4656 tokid = &cLISTOPo->op_first;
4657 kid = cLISTOPo->op_first;
4658 if (kid->op_type == OP_PUSHMARK ||
4659 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4661 tokid = &kid->op_sibling;
4662 kid = kid->op_sibling;
4664 if (!kid && PL_opargs[type] & OA_DEFGV)
4665 *tokid = kid = newDEFSVOP();
4669 sibl = kid->op_sibling;
4672 /* list seen where single (scalar) arg expected? */
4673 if (numargs == 1 && !(oa >> 4)
4674 && kid->op_type == OP_LIST && type != OP_SCALAR)
4676 return too_many_arguments(o,PL_op_desc[type]);
4689 if (kid->op_type == OP_CONST &&
4690 (kid->op_private & OPpCONST_BARE))
4692 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4693 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4694 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4695 if (ckWARN(WARN_SYNTAX))
4697 "Array @%s missing the @ in argument %ld of %s()",
4698 name, (long)numargs, PL_op_desc[type]);
4701 kid->op_sibling = sibl;
4704 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4705 bad_type(numargs, "array", PL_op_desc[type], kid);
4709 if (kid->op_type == OP_CONST &&
4710 (kid->op_private & OPpCONST_BARE))
4712 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4713 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4714 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4715 if (ckWARN(WARN_SYNTAX))
4717 "Hash %%%s missing the %% in argument %ld of %s()",
4718 name, (long)numargs, PL_op_desc[type]);
4721 kid->op_sibling = sibl;
4724 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4725 bad_type(numargs, "hash", PL_op_desc[type], kid);
4730 OP *newop = newUNOP(OP_NULL, 0, kid);
4731 kid->op_sibling = 0;
4733 newop->op_next = newop;
4735 kid->op_sibling = sibl;
4740 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4741 if (kid->op_type == OP_CONST &&
4742 (kid->op_private & OPpCONST_BARE))
4744 OP *newop = newGVOP(OP_GV, 0,
4745 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4750 else if (kid->op_type == OP_READLINE) {
4751 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4752 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4755 I32 flags = OPf_SPECIAL;
4756 /* is this op a FH constructor? */
4757 if (is_handle_constructor(o,numargs))
4759 kid->op_sibling = 0;
4760 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4762 kid->op_sibling = sibl;
4768 mod(scalar(kid), type);
4772 tokid = &kid->op_sibling;
4773 kid = kid->op_sibling;
4775 o->op_private |= numargs;
4777 return too_many_arguments(o,PL_op_desc[o->op_type]);
4780 else if (PL_opargs[type] & OA_DEFGV) {
4782 return newUNOP(type, 0, newDEFSVOP());
4786 while (oa & OA_OPTIONAL)
4788 if (oa && oa != OA_LIST)
4789 return too_few_arguments(o,PL_op_desc[o->op_type]);
4799 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4800 append_elem(OP_GLOB, o, newDEFSVOP());
4802 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4803 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4805 if (gv && GvIMPORTED_CV(gv)) {
4806 append_elem(OP_GLOB, o,
4807 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4808 o->op_type = OP_LIST;
4809 o->op_ppaddr = PL_ppaddr[OP_LIST];
4810 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4811 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4812 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4813 append_elem(OP_LIST, o,
4814 scalar(newUNOP(OP_RV2CV, 0,
4815 newGVOP(OP_GV, 0, gv)))));
4816 o = newUNOP(OP_NULL, 0, ck_subr(o));
4817 o->op_targ = OP_GLOB; /* hint at what it used to be */
4820 gv = newGVgen("main");
4822 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4832 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4834 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4835 Newz(1101, gwop, 1, LOGOP);
4837 if (o->op_flags & OPf_STACKED) {
4840 kid = cLISTOPo->op_first->op_sibling;
4841 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4844 kid->op_next = (OP*)gwop;
4845 o->op_flags &= ~OPf_STACKED;
4847 kid = cLISTOPo->op_first->op_sibling;
4848 if (type == OP_MAPWHILE)
4855 kid = cLISTOPo->op_first->op_sibling;
4856 if (kid->op_type != OP_NULL)
4857 croak("panic: ck_grep");
4858 kid = kUNOP->op_first;
4860 gwop->op_type = type;
4861 gwop->op_ppaddr = PL_ppaddr[type];
4862 gwop->op_first = listkids(o);
4863 gwop->op_flags |= OPf_KIDS;
4864 gwop->op_private = 1;
4865 gwop->op_other = LINKLIST(kid);
4866 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4867 kid->op_next = (OP*)gwop;
4869 kid = cLISTOPo->op_first->op_sibling;
4870 if (!kid || !kid->op_sibling)
4871 return too_few_arguments(o,PL_op_desc[o->op_type]);
4872 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4873 mod(kid, OP_GREPSTART);
4881 if (o->op_flags & OPf_KIDS) {
4882 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4884 kid = kid->op_sibling; /* get past "big" */
4885 if (kid && kid->op_type == OP_CONST)
4886 fbm_compile(((SVOP*)kid)->op_sv, 0);
4892 ck_lengthconst(OP *o)
4894 /* XXX length optimization goes here */
4901 OPCODE type = o->op_type;
4902 return modkids(ck_fun(o), type);
4908 OPCODE type = o->op_type;
4909 return refkids(ck_fun(o), type);
4917 kid = cLISTOPo->op_first;
4920 kid = cLISTOPo->op_first;
4922 if (kid->op_type == OP_PUSHMARK)
4923 kid = kid->op_sibling;
4924 if (kid && o->op_flags & OPf_STACKED)
4925 kid = kid->op_sibling;
4926 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4927 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4928 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4929 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4930 cLISTOPo->op_first->op_sibling = kid;
4931 cLISTOPo->op_last = kid;
4932 kid = kid->op_sibling;
4937 append_elem(o->op_type, o, newDEFSVOP());
4943 if (PL_hints & HINT_LOCALE)
4944 o->op_private |= OPpLOCALE;
4951 ck_fun_locale(OP *o)
4957 if (PL_hints & HINT_LOCALE)
4958 o->op_private |= OPpLOCALE;
4969 if (PL_hints & HINT_LOCALE)
4970 o->op_private |= OPpLOCALE;
4979 o->op_private |= OPpRUNTIME;
4992 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4993 o->op_private |= OPpREPEAT_DOLIST;
4994 cBINOPo->op_first = force_list(cBINOPo->op_first);
5004 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5005 SVOP *kid = (SVOP*)cUNOPo->op_first;
5007 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5009 for (s = SvPVX(kid->op_sv); *s; s++) {
5010 if (*s == ':' && s[1] == ':') {
5012 Move(s+2, s+1, strlen(s+2)+1, char);
5013 --SvCUR(kid->op_sv);
5016 sv_catpvn(kid->op_sv, ".pm", 3);
5026 croak("NOT IMPL LINE %d",__LINE__);
5036 if (o->op_flags & OPf_KIDS) {
5037 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5038 if (kid && kid->op_sibling) {
5039 o->op_type = OP_SSELECT;
5040 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5042 return fold_constants(o);
5046 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5047 if (kid && kid->op_type == OP_RV2GV)
5048 kid->op_private &= ~HINT_STRICT_REFS;
5055 I32 type = o->op_type;
5057 if (!(o->op_flags & OPf_KIDS)) {
5062 if (!CvUNIQUE(PL_compcv)) {
5063 argop = newOP(OP_PADAV, OPf_REF);
5064 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5067 argop = newUNOP(OP_RV2AV, 0,
5068 scalar(newGVOP(OP_GV, 0,
5069 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5072 argop = newUNOP(OP_RV2AV, 0,
5073 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5074 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5075 #endif /* USE_THREADS */
5076 return newUNOP(type, 0, scalar(argop));
5078 return scalar(modkids(ck_fun(o), type));
5086 if (PL_hints & HINT_LOCALE)
5087 o->op_private |= OPpLOCALE;
5090 if (o->op_flags & OPf_STACKED)
5092 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5093 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5095 kid = kUNOP->op_first; /* get past rv2gv */
5097 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5099 if (kid->op_type == OP_SCOPE) {
5103 else if (kid->op_type == OP_LEAVE) {
5104 if (o->op_type == OP_SORT) {
5105 null(kid); /* wipe out leave */
5108 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5109 if (k->op_next == kid)
5114 kid->op_next = 0; /* just disconnect the leave */
5115 k = kLISTOP->op_first;
5119 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5120 null(kid); /* wipe out rv2gv */
5121 if (o->op_type == OP_SORT)
5125 o->op_flags |= OPf_SPECIAL;
5127 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5128 null(cLISTOPo->op_first->op_sibling);
5135 simplify_sort(OP *o)
5138 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5141 if (!(o->op_flags & OPf_STACKED))
5143 kid = kUNOP->op_first; /* get past rv2gv */
5144 if (kid->op_type != OP_SCOPE)
5146 kid = kLISTOP->op_last; /* get past scope */
5147 switch(kid->op_type) {
5155 k = kid; /* remember this node*/
5156 if (kBINOP->op_first->op_type != OP_RV2SV)
5158 kid = kBINOP->op_first; /* get past cmp */
5159 if (kUNOP->op_first->op_type != OP_GV)
5161 kid = kUNOP->op_first; /* get past rv2sv */
5162 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5164 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5166 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5170 kid = k; /* back to cmp */
5171 if (kBINOP->op_last->op_type != OP_RV2SV)
5173 kid = kBINOP->op_last; /* down to 2nd arg */
5174 if (kUNOP->op_first->op_type != OP_GV)
5176 kid = kUNOP->op_first; /* get past rv2sv */
5177 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5179 ? strNE(GvNAME(kGVOP->op_gv), "a")
5180 : strNE(GvNAME(kGVOP->op_gv), "b")))
5182 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5184 o->op_private |= OPpSORT_REVERSE;
5185 if (k->op_type == OP_NCMP)
5186 o->op_private |= OPpSORT_NUMERIC;
5187 if (k->op_type == OP_I_NCMP)
5188 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5189 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5190 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5191 cLISTOPo->op_children = 1;
5199 if (o->op_flags & OPf_STACKED)
5200 return no_fh_allowed(o);
5202 kid = cLISTOPo->op_first;
5203 if (kid->op_type != OP_NULL)
5204 croak("panic: ck_split");
5205 kid = kid->op_sibling;
5206 op_free(cLISTOPo->op_first);
5207 cLISTOPo->op_first = kid;
5209 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5210 cLISTOPo->op_last = kid; /* There was only one element previously */
5213 if (kid->op_type != OP_MATCH) {
5214 OP *sibl = kid->op_sibling;
5215 kid->op_sibling = 0;
5216 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5217 if (cLISTOPo->op_first == cLISTOPo->op_last)
5218 cLISTOPo->op_last = kid;
5219 cLISTOPo->op_first = kid;
5220 kid->op_sibling = sibl;
5223 kid->op_type = OP_PUSHRE;
5224 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5227 if (!kid->op_sibling)
5228 append_elem(OP_SPLIT, o, newDEFSVOP());
5230 kid = kid->op_sibling;
5233 if (!kid->op_sibling)
5234 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5236 kid = kid->op_sibling;
5239 if (kid->op_sibling)
5240 return too_many_arguments(o,PL_op_desc[o->op_type]);
5249 OP *prev = ((cUNOPo->op_first->op_sibling)
5250 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5251 OP *o2 = prev->op_sibling;
5260 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5261 if (cvop->op_type == OP_RV2CV) {
5263 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5264 null(cvop); /* disable rv2cv */
5265 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5266 if (tmpop->op_type == OP_GV) {
5267 cv = GvCVu(tmpop->op_sv);
5268 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5269 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5270 proto = SvPV((SV*)cv, n_a);
5274 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5275 if (PERLDB_SUB && PL_curstash != PL_debstash)
5276 o->op_private |= OPpENTERSUB_DB;
5277 while (o2 != cvop) {
5281 return too_many_arguments(o, gv_ename(namegv));
5299 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5300 bad_type(arg, "block", gv_ename(namegv), o2);
5305 if (o2->op_type == OP_RV2GV)
5309 OP* sib = kid->op_sibling;
5310 kid->op_sibling = 0;
5311 o2 = newUNOP(OP_RV2GV, 0, kid);
5312 o2->op_sibling = sib;
5313 prev->op_sibling = o2;
5321 if (o2->op_type != OP_RV2GV)
5322 bad_type(arg, "symbol", gv_ename(namegv), o2);
5325 if (o2->op_type != OP_RV2CV)
5326 bad_type(arg, "sub", gv_ename(namegv), o2);
5329 if (o2->op_type != OP_RV2SV
5330 && o2->op_type != OP_PADSV
5331 && o2->op_type != OP_THREADSV)
5333 bad_type(arg, "scalar", gv_ename(namegv), o2);
5337 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5338 bad_type(arg, "array", gv_ename(namegv), o2);
5341 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5342 bad_type(arg, "hash", gv_ename(namegv), o2);
5346 OP* sib = kid->op_sibling;
5347 kid->op_sibling = 0;
5348 o2 = newUNOP(OP_REFGEN, 0, kid);
5349 o2->op_sibling = sib;
5350 prev->op_sibling = o2;
5361 croak("Malformed prototype for %s: %s",
5362 gv_ename(namegv), SvPV((SV*)cv, n_a));
5367 mod(o2, OP_ENTERSUB);
5369 o2 = o2->op_sibling;
5371 if (proto && !optional &&
5372 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5373 return too_few_arguments(o, gv_ename(namegv));
5380 SvREADONLY_on(cSVOPo->op_sv);
5387 if (o->op_flags & OPf_KIDS) {
5388 SVOP *kid = (SVOP*)cUNOPo->op_first;
5390 if (kid->op_type == OP_NULL)
5391 kid = (SVOP*)kid->op_sibling;
5393 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5394 o->op_flags |= OPf_SPECIAL;
5399 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5402 peep(register OP *o)
5405 register OP* oldop = 0;
5408 if (!o || o->op_seq)
5412 SAVESPTR(PL_curcop);
5413 for (; o; o = o->op_next) {
5419 switch (o->op_type) {
5422 PL_curcop = ((COP*)o); /* for warnings */
5423 o->op_seq = PL_op_seqmax++;
5434 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5436 o->op_seq = PL_op_seqmax++;
5439 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5440 o->op_seq = PL_op_seqmax++;
5441 break; /* Scalar stub must produce undef. List stub is noop */
5445 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5446 PL_curcop = ((COP*)o);
5452 if (oldop && o->op_next) {
5453 oldop->op_next = o->op_next;
5456 o->op_seq = PL_op_seqmax++;
5460 if (o->op_next->op_type == OP_RV2SV) {
5461 if (!(o->op_next->op_private & OPpDEREF)) {
5463 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5464 o->op_next = o->op_next->op_next;
5465 o->op_type = OP_GVSV;
5466 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5469 else if (o->op_next->op_type == OP_RV2AV) {
5470 OP* pop = o->op_next->op_next;
5472 if (pop->op_type == OP_CONST &&
5473 (PL_op = pop->op_next) &&
5474 pop->op_next->op_type == OP_AELEM &&
5475 !(pop->op_next->op_private &
5476 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5477 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5481 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5485 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5486 o->op_next = pop->op_next->op_next;
5487 o->op_type = OP_AELEMFAST;
5488 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5489 o->op_private = (U8)i;
5490 GvAVn(((GVOP*)o)->op_gv);
5493 o->op_seq = PL_op_seqmax++;
5500 o->op_seq = PL_op_seqmax++;
5501 while (cLOGOP->op_other->op_type == OP_NULL)
5502 cLOGOP->op_other = cLOGOP->op_other->op_next;
5503 peep(cLOGOP->op_other);
5507 o->op_seq = PL_op_seqmax++;
5508 peep(cCONDOP->op_true);
5509 peep(cCONDOP->op_false);
5513 o->op_seq = PL_op_seqmax++;
5514 peep(cLOOP->op_redoop);
5515 peep(cLOOP->op_nextop);
5516 peep(cLOOP->op_lastop);
5522 o->op_seq = PL_op_seqmax++;
5523 peep(cPMOP->op_pmreplstart);
5527 o->op_seq = PL_op_seqmax++;
5528 if (ckWARN(WARN_SYNTAX) && o->op_next
5529 && o->op_next->op_type == OP_NEXTSTATE) {
5530 if (o->op_next->op_sibling &&
5531 o->op_next->op_sibling->op_type != OP_EXIT &&
5532 o->op_next->op_sibling->op_type != OP_WARN &&
5533 o->op_next->op_sibling->op_type != OP_DIE) {
5534 line_t oldline = PL_curcop->cop_line;
5536 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5537 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5538 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5539 PL_curcop->cop_line = oldline;
5553 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5554 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5556 rop = (UNOP*)((BINOP*)o)->op_first;
5557 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5559 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5560 if (!SvOBJECT(lexname))
5562 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5563 if (!fields || !GvHV(*fields))
5565 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5566 key = SvPV(*svp, keylen);
5567 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5569 croak("No such field \"%s\" in variable %s of type %s",
5570 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5572 ind = SvIV(*indsvp);
5574 croak("Bad index while coercing array into hash");
5575 rop->op_type = OP_RV2AV;
5576 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5577 o->op_type = OP_AELEM;
5578 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5580 *svp = newSViv(ind);
5585 o->op_seq = PL_op_seqmax++;