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));
61 SV* tmpsv = sv_newmortal();
62 gv_efullname3(tmpsv, gv, Nullch);
63 return SvPV(tmpsv,n_a);
69 yyerror(form("Missing comma after first argument to %s function",
70 PL_op_desc[o->op_type]));
75 too_few_arguments(OP *o, char *name)
77 yyerror(form("Not enough arguments for %s", name));
82 too_many_arguments(OP *o, char *name)
84 yyerror(form("Too many arguments for %s", name));
89 bad_type(I32 n, char *t, char *name, OP *kid)
91 yyerror(form("Type of arg %d to %s must be %s (not %s)",
92 (int)n, name, t, PL_op_desc[kid->op_type]));
98 int type = o->op_type;
99 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
100 yyerror(form("Can't use subscript on %s", PL_op_desc[type]));
101 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
103 SV *msg = sv_2mortal(
104 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
105 type == OP_ENTERSUB ? '&' : '%'));
109 sv_catsv(GvSV(PL_errgv), msg);
111 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
116 /* "register" allocation */
119 pad_allocmy(char *name)
127 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
128 name[1] == '_' && (int)strlen(name) > 2))
130 if (!isPRINT(name[1])) {
132 name[2] = toCTRL(name[1]);
135 croak("Can't use global %s in \"my\"",name);
137 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
138 SV **svp = AvARRAY(PL_comppad_name);
139 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
141 && sv != &PL_sv_undef
142 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
143 && strEQ(name, SvPVX(sv)))
146 "\"my\" variable %s masks earlier declaration in same %s",
147 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
152 off = pad_alloc(OP_PADSV, SVs_PADMY);
154 sv_upgrade(sv, SVt_PVNV);
156 if (PL_in_my_stash) {
158 croak("Can't declare class for non-scalar %s in \"my\"",name);
160 (void)SvUPGRADE(sv, SVt_PVMG);
161 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
164 av_store(PL_comppad_name, off, sv);
165 SvNVX(sv) = (double)PAD_MAX;
166 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
167 if (!PL_min_intro_pending)
168 PL_min_intro_pending = off;
169 PL_max_intro_pending = off;
171 av_store(PL_comppad, off, (SV*)newAV());
172 else if (*name == '%')
173 av_store(PL_comppad, off, (SV*)newHV());
174 SvPADMY_on(PL_curpad[off]);
179 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
186 register PERL_CONTEXT *cx;
188 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
189 AV *curlist = CvPADLIST(cv);
190 SV **svp = av_fetch(curlist, 0, FALSE);
193 if (!svp || *svp == &PL_sv_undef)
196 svp = AvARRAY(curname);
197 for (off = AvFILLp(curname); off > 0; off--) {
198 if ((sv = svp[off]) &&
199 sv != &PL_sv_undef &&
201 seq > I_32(SvNVX(sv)) &&
202 strEQ(SvPVX(sv), name))
213 return 0; /* don't clone from inactive stack frame */
217 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
218 oldsv = *av_fetch(oldpad, off, TRUE);
219 if (!newoff) { /* Not a mere clone operation. */
220 SV *namesv = NEWSV(1103,0);
221 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
222 sv_upgrade(namesv, SVt_PVNV);
223 sv_setpv(namesv, name);
224 av_store(PL_comppad_name, newoff, namesv);
225 SvNVX(namesv) = (double)PL_curcop->cop_seq;
226 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
227 SvFAKE_on(namesv); /* A ref, not a real var */
228 if (SvOBJECT(sv)) { /* A typed var */
230 (void)SvUPGRADE(namesv, SVt_PVMG);
231 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
234 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
235 /* "It's closures all the way down." */
236 CvCLONE_on(PL_compcv);
238 if (CvANON(PL_compcv))
239 oldsv = Nullsv; /* no need to keep ref */
244 bcv && bcv != cv && !CvCLONE(bcv);
245 bcv = CvOUTSIDE(bcv))
250 if (ckWARN(WARN_CLOSURE)
251 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
254 "Variable \"%s\" may be unavailable",
262 else if (!CvUNIQUE(PL_compcv)) {
263 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
265 "Variable \"%s\" will not stay shared", name);
268 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
274 /* Nothing in current lexical context--try eval's context, if any.
275 * This is necessary to let the perldb get at lexically scoped variables.
276 * XXX This will also probably interact badly with eval tree caching.
279 for (i = cx_ix; i >= 0; i--) {
281 switch (CxTYPE(cx)) {
283 if (i == 0 && saweval) {
284 seq = cxstack[saweval].blk_oldcop->cop_seq;
285 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
289 switch (cx->blk_eval.old_op_type) {
295 /* require must have its own scope */
303 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
304 saweval = i; /* so we know where we were called from */
307 seq = cxstack[saweval].blk_oldcop->cop_seq;
308 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
316 pad_findmy(char *name)
322 SV **svp = AvARRAY(PL_comppad_name);
323 U32 seq = PL_cop_seqmax;
329 * Special case to get lexical (and hence per-thread) @_.
330 * XXX I need to find out how to tell at parse-time whether use
331 * of @_ should refer to a lexical (from a sub) or defgv (global
332 * scope and maybe weird sub-ish things like formats). See
333 * startsub in perly.y. It's possible that @_ could be lexical
334 * (at least from subs) even in non-threaded perl.
336 if (strEQ(name, "@_"))
337 return 0; /* success. (NOT_IN_PAD indicates failure) */
338 #endif /* USE_THREADS */
340 /* The one we're looking for is probably just before comppad_name_fill. */
341 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
342 if ((sv = svp[off]) &&
343 sv != &PL_sv_undef &&
346 seq > I_32(SvNVX(sv)))) &&
347 strEQ(SvPVX(sv), name))
350 return (PADOFFSET)off;
351 pendoff = off; /* this pending def. will override import */
355 outside = CvOUTSIDE(PL_compcv);
357 /* Check if if we're compiling an eval'', and adjust seq to be the
358 * eval's seq number. This depends on eval'' having a non-null
359 * CvOUTSIDE() while it is being compiled. The eval'' itself is
360 * identified by CvUNIQUE being set and CvGV being null. */
361 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
362 cx = &cxstack[cxstack_ix];
364 seq = cx->blk_oldcop->cop_seq;
367 /* See if it's in a nested scope */
368 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
370 /* If there is a pending local definition, this new alias must die */
372 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
373 return off; /* pad_findlex returns 0 for failure...*/
375 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
379 pad_leavemy(I32 fill)
382 SV **svp = AvARRAY(PL_comppad_name);
384 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
385 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
386 if ((sv = svp[off]) && sv != &PL_sv_undef)
387 warn("%s never introduced", SvPVX(sv));
390 /* "Deintroduce" my variables that are leaving with this scope. */
391 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
392 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
393 SvIVX(sv) = PL_cop_seqmax;
398 pad_alloc(I32 optype, U32 tmptype)
404 if (AvARRAY(PL_comppad) != PL_curpad)
405 croak("panic: pad_alloc");
406 if (PL_pad_reset_pending)
408 if (tmptype & SVs_PADMY) {
410 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
411 } while (SvPADBUSY(sv)); /* need a fresh one */
412 retval = AvFILLp(PL_comppad);
415 SV **names = AvARRAY(PL_comppad_name);
416 SSize_t names_fill = AvFILLp(PL_comppad_name);
419 * "foreach" index vars temporarily become aliases to non-"my"
420 * values. Thus we must skip, not just pad values that are
421 * marked as current pad values, but also those with names.
423 if (++PL_padix <= names_fill &&
424 (sv = names[PL_padix]) && sv != &PL_sv_undef)
426 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
427 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
432 SvFLAGS(sv) |= tmptype;
433 PL_curpad = AvARRAY(PL_comppad);
435 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
436 (unsigned long) thr, (unsigned long) PL_curpad,
437 (long) retval, PL_op_name[optype]));
439 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
440 (unsigned long) PL_curpad,
441 (long) retval, PL_op_name[optype]));
442 #endif /* USE_THREADS */
443 return (PADOFFSET)retval;
451 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
452 (unsigned long) thr, (unsigned long) PL_curpad, po));
455 croak("panic: pad_sv po");
456 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
457 (unsigned long) PL_curpad, po));
458 #endif /* USE_THREADS */
459 return PL_curpad[po]; /* eventually we'll turn this into a macro */
463 pad_free(PADOFFSET po)
468 if (AvARRAY(PL_comppad) != PL_curpad)
469 croak("panic: pad_free curpad");
471 croak("panic: pad_free po");
473 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
474 (unsigned long) thr, (unsigned long) PL_curpad, po));
476 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
477 (unsigned long) PL_curpad, po));
478 #endif /* USE_THREADS */
479 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
480 SvPADTMP_off(PL_curpad[po]);
481 if ((I32)po < PL_padix)
486 pad_swipe(PADOFFSET po)
489 if (AvARRAY(PL_comppad) != PL_curpad)
490 croak("panic: pad_swipe curpad");
492 croak("panic: pad_swipe po");
494 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
495 (unsigned long) thr, (unsigned long) PL_curpad, po));
497 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
498 (unsigned long) PL_curpad, po));
499 #endif /* USE_THREADS */
500 SvPADTMP_off(PL_curpad[po]);
501 PL_curpad[po] = NEWSV(1107,0);
502 SvPADTMP_on(PL_curpad[po]);
503 if ((I32)po < PL_padix)
507 /* XXX pad_reset() is currently disabled because it results in serious bugs.
508 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
509 * on the stack by OPs that use them, there are several ways to get an alias
510 * to a shared TARG. Such an alias will change randomly and unpredictably.
511 * We avoid doing this until we can think of a Better Way.
516 #ifdef USE_BROKEN_PAD_RESET
520 if (AvARRAY(PL_comppad) != PL_curpad)
521 croak("panic: pad_reset curpad");
523 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
524 (unsigned long) thr, (unsigned long) PL_curpad));
526 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
527 (unsigned long) PL_curpad));
528 #endif /* USE_THREADS */
529 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
530 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
531 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
532 SvPADTMP_off(PL_curpad[po]);
534 PL_padix = PL_padix_floor;
537 PL_pad_reset_pending = FALSE;
541 /* find_threadsv is not reentrant */
543 find_threadsv(char *name)
549 /* We currently only handle names of a single character */
550 p = strchr(PL_threadsv_names, *name);
553 key = p - PL_threadsv_names;
554 MUTEX_LOCK(&thr->mutex);
555 svp = av_fetch(thr->threadsv, key, FALSE);
557 MUTEX_UNLOCK(&thr->mutex);
559 SV *sv = NEWSV(0, 0);
560 av_store(thr->threadsv, key, sv);
561 thr->threadsvp = AvARRAY(thr->threadsv);
562 MUTEX_UNLOCK(&thr->mutex);
564 * Some magic variables used to be automagically initialised
565 * in gv_fetchpv. Those which are now per-thread magicals get
566 * initialised here instead.
572 sv_setpv(sv, "\034");
573 sv_magic(sv, 0, 0, name, 1);
578 PL_sawampersand = TRUE;
592 /* XXX %! tied to Errno.pm needs to be added here.
593 * See gv_fetchpv(). */
597 sv_magic(sv, 0, 0, name, 1);
599 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
600 "find_threadsv: new SV %p for $%s%c\n",
601 sv, (*name < 32) ? "^" : "",
602 (*name < 32) ? toCTRL(*name) : *name));
606 #endif /* USE_THREADS */
613 register OP *kid, *nextkid;
615 if (!o || o->op_seq == (U16)-1)
618 if (o->op_flags & OPf_KIDS) {
619 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
620 nextkid = kid->op_sibling; /* Get before next freeing kid */
625 switch (o->op_type) {
627 o->op_targ = 0; /* Was holding old type, if any. */
630 o->op_targ = 0; /* Was holding hints. */
634 if (!(o->op_flags & OPf_SPECIAL))
638 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
640 #endif /* USE_THREADS */
642 if (!(o->op_flags & OPf_REF)
643 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
649 SvREFCNT_dec(cGVOPo->op_gv);
653 Safefree(cCOPo->cop_label);
654 SvREFCNT_dec(cCOPo->cop_filegv);
655 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
656 SvREFCNT_dec(cCOPo->cop_warnings);
659 SvREFCNT_dec(cSVOPo->op_sv);
665 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
669 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
670 SvREFCNT_dec(cSVOPo->op_sv);
672 Safefree(cPVOPo->op_pv);
675 op_free(cPMOPo->op_pmreplroot);
680 ReREFCNT_dec(cPMOPo->op_pmregexp);
685 pad_free(o->op_targ);
693 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
694 pad_free(o->op_targ);
695 o->op_targ = o->op_type;
696 o->op_type = OP_NULL;
697 o->op_ppaddr = PL_ppaddr[OP_NULL];
700 /* Contextualizers */
702 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
712 /* establish postfix order */
713 if (cUNOPo->op_first) {
714 o->op_next = LINKLIST(cUNOPo->op_first);
715 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
717 kid->op_next = LINKLIST(kid->op_sibling);
732 if (o && o->op_flags & OPf_KIDS) {
733 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
742 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
744 if (ckWARN(WARN_SYNTAX)) {
745 line_t oldline = PL_curcop->cop_line;
747 if (PL_copline != NOLINE)
748 PL_curcop->cop_line = PL_copline;
749 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
750 PL_curcop->cop_line = oldline;
761 /* assumes no premature commitment */
762 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
763 || o->op_type == OP_RETURN)
766 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
768 switch (o->op_type) {
770 if (o->op_private & OPpREPEAT_DOLIST)
771 null(((LISTOP*)cBINOPo->op_first)->op_first);
772 scalar(cBINOPo->op_first);
777 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
781 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
782 if (!kPMOP->op_pmreplroot)
783 deprecate("implicit split to @_");
791 if (o->op_flags & OPf_KIDS) {
792 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
798 kid = cLISTOPo->op_first;
800 while (kid = kid->op_sibling) {
806 WITH_THR(PL_curcop = &PL_compiling);
811 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
817 WITH_THR(PL_curcop = &PL_compiling);
830 /* assumes no premature commitment */
831 U8 want = o->op_flags & OPf_WANT;
832 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
833 || o->op_type == OP_RETURN)
836 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
838 switch (o->op_type) {
840 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
844 if (o->op_flags & OPf_STACKED)
848 if (o->op_private == 4)
919 if (!(o->op_private & OPpLVAL_INTRO))
920 useless = PL_op_desc[o->op_type];
927 if (!(o->op_private & OPpLVAL_INTRO) &&
928 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
929 useless = "a variable";
934 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
941 if (ckWARN(WARN_VOID)) {
942 useless = "a constant";
943 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
945 else if (SvPOK(sv)) {
946 if (strnEQ(SvPVX(sv), "di", 2) ||
947 strnEQ(SvPVX(sv), "ds", 2) ||
948 strnEQ(SvPVX(sv), "ig", 2))
953 null(o); /* don't execute a constant */
954 SvREFCNT_dec(sv); /* don't even remember it */
958 o->op_type = OP_PREINC; /* pre-increment is faster */
959 o->op_ppaddr = PL_ppaddr[OP_PREINC];
963 o->op_type = OP_PREDEC; /* pre-decrement is faster */
964 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
970 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
975 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
976 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
977 if (o->op_flags & OPf_STACKED)
983 if (!(o->op_flags & OPf_KIDS))
992 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
999 /* all requires must return a boolean value */
1000 o->op_flags &= ~OPf_WANT;
1003 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1004 if (!kPMOP->op_pmreplroot)
1005 deprecate("implicit split to @_");
1011 if (ckWARN(WARN_VOID))
1012 warner(WARN_VOID, "Useless use of %s in void context", useless);
1021 if (o && o->op_flags & OPf_KIDS) {
1022 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1033 /* assumes no premature commitment */
1034 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1035 || o->op_type == OP_RETURN)
1038 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1040 switch (o->op_type) {
1043 list(cBINOPo->op_first);
1048 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1056 if (!(o->op_flags & OPf_KIDS))
1058 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1059 list(cBINOPo->op_first);
1060 return gen_constant_list(o);
1067 kid = cLISTOPo->op_first;
1069 while (kid = kid->op_sibling) {
1070 if (kid->op_sibling)
1075 WITH_THR(PL_curcop = &PL_compiling);
1079 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1080 if (kid->op_sibling)
1085 WITH_THR(PL_curcop = &PL_compiling);
1088 /* all requires must return a boolean value */
1089 o->op_flags &= ~OPf_WANT;
1101 if (o->op_type == OP_LINESEQ ||
1102 o->op_type == OP_SCOPE ||
1103 o->op_type == OP_LEAVE ||
1104 o->op_type == OP_LEAVETRY)
1107 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1108 if (kid->op_sibling) {
1112 PL_curcop = &PL_compiling;
1114 o->op_flags &= ~OPf_PARENS;
1115 if (PL_hints & HINT_BLOCK_SCOPE)
1116 o->op_flags |= OPf_PARENS;
1119 o = newOP(OP_STUB, 0);
1124 modkids(OP *o, I32 type)
1127 if (o && o->op_flags & OPf_KIDS) {
1128 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1135 mod(OP *o, I32 type)
1142 if (!o || PL_error_count)
1145 switch (o->op_type) {
1150 if (!(o->op_private & (OPpCONST_ARYBASE)))
1152 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1153 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1157 SAVEI32(PL_compiling.cop_arybase);
1158 PL_compiling.cop_arybase = 0;
1160 else if (type == OP_REFGEN)
1163 croak("That use of $[ is unsupported");
1166 if (o->op_flags & OPf_PARENS)
1170 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1171 !(o->op_flags & OPf_STACKED)) {
1172 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1173 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1174 assert(cUNOPo->op_first->op_type == OP_NULL);
1175 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1181 /* grep, foreach, subcalls, refgen */
1182 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1184 yyerror(form("Can't modify %s in %s",
1185 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1186 ? "do block" : PL_op_desc[o->op_type]),
1187 type ? PL_op_desc[type] : "local"));
1201 case OP_RIGHT_SHIFT:
1210 if (!(o->op_flags & OPf_STACKED))
1216 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1222 if (!type && cUNOPo->op_first->op_type != OP_GV)
1223 croak("Can't localize through a reference");
1224 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1225 PL_modcount = 10000;
1226 return o; /* Treat \(@foo) like ordinary list. */
1230 if (scalar_mod_type(o, type))
1232 ref(cUNOPo->op_first, o->op_type);
1241 PL_modcount = 10000;
1244 if (!type && cUNOPo->op_first->op_type != OP_GV)
1245 croak("Can't localize through a reference");
1246 ref(cUNOPo->op_first, o->op_type);
1250 PL_hints |= HINT_BLOCK_SCOPE;
1258 PL_modcount = 10000;
1259 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1260 return o; /* Treat \(@foo) like ordinary list. */
1261 if (scalar_mod_type(o, type))
1267 croak("Can't localize lexical variable %s",
1268 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1273 PL_modcount++; /* XXX ??? */
1275 #endif /* USE_THREADS */
1281 if (type != OP_SASSIGN)
1285 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1291 pad_free(o->op_targ);
1292 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1293 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1294 if (o->op_flags & OPf_KIDS)
1295 mod(cBINOPo->op_first->op_sibling, type);
1300 ref(cBINOPo->op_first, o->op_type);
1301 if (type == OP_ENTERSUB &&
1302 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1303 o->op_private |= OPpLVAL_DEFER;
1310 if (o->op_flags & OPf_KIDS)
1311 mod(cLISTOPo->op_last, type);
1315 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1317 else if (!(o->op_flags & OPf_KIDS))
1319 if (o->op_targ != OP_LIST) {
1320 mod(cBINOPo->op_first, type);
1325 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1329 o->op_flags |= OPf_MOD;
1331 if (type == OP_AASSIGN || type == OP_SASSIGN)
1332 o->op_flags |= OPf_SPECIAL|OPf_REF;
1334 o->op_private |= OPpLVAL_INTRO;
1335 o->op_flags &= ~OPf_SPECIAL;
1336 PL_hints |= HINT_BLOCK_SCOPE;
1338 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1339 o->op_flags |= OPf_REF;
1344 scalar_mod_type(OP *o, I32 type)
1348 if (o->op_type == OP_RV2GV)
1372 case OP_RIGHT_SHIFT:
1382 case OP_ANDASSIGN: /* may work later */
1383 case OP_ORASSIGN: /* may work later */
1391 refkids(OP *o, I32 type)
1394 if (o && o->op_flags & OPf_KIDS) {
1395 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1402 ref(OP *o, I32 type)
1406 if (!o || PL_error_count)
1409 switch (o->op_type) {
1411 if ((type == OP_DEFINED || type == OP_LOCK) &&
1412 !(o->op_flags & OPf_STACKED)) {
1413 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1414 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1415 assert(cUNOPo->op_first->op_type == OP_NULL);
1416 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1417 o->op_flags |= OPf_SPECIAL;
1422 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1426 ref(cUNOPo->op_first, o->op_type);
1429 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1430 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1431 : type == OP_RV2HV ? OPpDEREF_HV
1433 o->op_flags |= OPf_MOD;
1438 o->op_flags |= OPf_MOD; /* XXX ??? */
1443 o->op_flags |= OPf_REF;
1446 ref(cUNOPo->op_first, o->op_type);
1451 o->op_flags |= OPf_REF;
1456 if (!(o->op_flags & OPf_KIDS))
1458 ref(cBINOPo->op_first, type);
1462 ref(cBINOPo->op_first, o->op_type);
1463 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1464 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1465 : type == OP_RV2HV ? OPpDEREF_HV
1467 o->op_flags |= OPf_MOD;
1475 if (!(o->op_flags & OPf_KIDS))
1477 ref(cLISTOPo->op_last, type);
1492 if (!o || PL_error_count)
1496 if (type == OP_LIST) {
1497 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1499 } else if (type == OP_UNDEF) {
1501 } else if (type != OP_PADSV &&
1504 type != OP_PUSHMARK)
1506 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1509 o->op_flags |= OPf_MOD;
1510 o->op_private |= OPpLVAL_INTRO;
1518 o->op_flags |= OPf_PARENS;
1523 bind_match(I32 type, OP *left, OP *right)
1528 if (ckWARN(WARN_UNSAFE) &&
1529 (left->op_type == OP_RV2AV ||
1530 left->op_type == OP_RV2HV ||
1531 left->op_type == OP_PADAV ||
1532 left->op_type == OP_PADHV)) {
1533 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1534 right->op_type == OP_TRANS)
1535 ? right->op_type : OP_MATCH];
1536 char *sample = ((left->op_type == OP_RV2AV ||
1537 left->op_type == OP_PADAV)
1538 ? "@array" : "%hash");
1540 "Applying %s to %s will act on scalar(%s)",
1541 desc, sample, sample);
1544 if (right->op_type == OP_MATCH ||
1545 right->op_type == OP_SUBST ||
1546 right->op_type == OP_TRANS) {
1547 right->op_flags |= OPf_STACKED;
1548 if (right->op_type != OP_MATCH)
1549 left = mod(left, right->op_type);
1550 if (right->op_type == OP_TRANS)
1551 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1553 o = prepend_elem(right->op_type, scalar(left), right);
1555 return newUNOP(OP_NOT, 0, scalar(o));
1559 return bind_match(type, left,
1560 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1568 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1569 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1576 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1577 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1578 o->op_type = OP_LEAVE;
1579 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1582 if (o->op_type == OP_LINESEQ) {
1584 o->op_type = OP_SCOPE;
1585 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1586 kid = ((LISTOP*)o)->op_first;
1587 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1588 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1593 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1603 SAVESPTR(GvHV(PL_hintgv));
1604 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1605 SAVEFREESV(GvHV(PL_hintgv));
1609 block_start(int full)
1612 int retval = PL_savestack_ix;
1614 SAVEI32(PL_comppad_name_floor);
1616 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1617 PL_comppad_name_floor = PL_comppad_name_fill;
1619 PL_comppad_name_floor = 0;
1621 SAVEI32(PL_min_intro_pending);
1622 SAVEI32(PL_max_intro_pending);
1623 PL_min_intro_pending = 0;
1624 SAVEI32(PL_comppad_name_fill);
1625 SAVEI32(PL_padix_floor);
1626 PL_padix_floor = PL_padix;
1627 PL_pad_reset_pending = FALSE;
1629 PL_hints &= ~HINT_BLOCK_SCOPE;
1630 SAVEPPTR(PL_compiling.cop_warnings);
1631 if (PL_compiling.cop_warnings != WARN_ALL &&
1632 PL_compiling.cop_warnings != WARN_NONE) {
1633 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1634 SAVEFREESV(PL_compiling.cop_warnings) ;
1642 block_end(I32 floor, OP *seq)
1645 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1646 OP* retval = scalarseq(seq);
1648 PL_pad_reset_pending = FALSE;
1649 PL_compiling.op_private = PL_hints;
1651 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1652 pad_leavemy(PL_comppad_name_fill);
1661 OP *o = newOP(OP_THREADSV, 0);
1662 o->op_targ = find_threadsv("_");
1665 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1666 #endif /* USE_THREADS */
1674 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1675 PL_eval_start = linklist(PL_eval_root);
1676 PL_eval_root->op_next = 0;
1677 peep(PL_eval_start);
1682 PL_main_root = scope(sawparens(scalarvoid(o)));
1683 PL_curcop = &PL_compiling;
1684 PL_main_start = LINKLIST(PL_main_root);
1685 PL_main_root->op_next = 0;
1686 peep(PL_main_start);
1689 /* Register with debugger */
1691 CV *cv = perl_get_cv("DB::postponed", FALSE);
1695 XPUSHs((SV*)PL_compiling.cop_filegv);
1697 perl_call_sv((SV*)cv, G_DISCARD);
1704 localize(OP *o, I32 lex)
1706 if (o->op_flags & OPf_PARENS)
1710 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1712 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1713 if (*s == ';' || *s == '=')
1714 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1715 lex ? "my" : "local");
1719 PL_in_my_stash = Nullhv;
1723 return mod(o, OP_NULL); /* a bit kludgey */
1729 if (o->op_type == OP_LIST) {
1732 o2 = newOP(OP_THREADSV, 0);
1733 o2->op_targ = find_threadsv(";");
1735 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1736 #endif /* USE_THREADS */
1737 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1743 fold_constants(register OP *o)
1747 I32 type = o->op_type;
1750 if (PL_opargs[type] & OA_RETSCALAR)
1752 if (PL_opargs[type] & OA_TARGET)
1753 o->op_targ = pad_alloc(type, SVs_PADTMP);
1755 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1756 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1758 if (!(PL_opargs[type] & OA_FOLDCONST))
1773 if (o->op_private & OPpLOCALE)
1778 goto nope; /* Don't try to run w/ errors */
1780 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1781 if (curop->op_type != OP_CONST &&
1782 curop->op_type != OP_LIST &&
1783 curop->op_type != OP_SCALAR &&
1784 curop->op_type != OP_NULL &&
1785 curop->op_type != OP_PUSHMARK) {
1790 curop = LINKLIST(o);
1794 sv = *(PL_stack_sp--);
1795 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1796 pad_swipe(o->op_targ);
1797 else if (SvTEMP(sv)) { /* grab mortal temp? */
1798 (void)SvREFCNT_inc(sv);
1802 if (type == OP_RV2GV)
1803 return newGVOP(OP_GV, 0, (GV*)sv);
1805 /* try to smush double to int, but don't smush -2.0 to -2 */
1806 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1810 if ((double)iv == SvNV(sv)) {
1815 SvIOK_off(sv); /* undo SvIV() damage */
1817 return newSVOP(OP_CONST, 0, sv);
1821 if (!(PL_opargs[type] & OA_OTHERINT))
1824 if (!(PL_hints & HINT_INTEGER)) {
1825 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1828 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1829 if (curop->op_type == OP_CONST) {
1830 if (SvIOK(((SVOP*)curop)->op_sv))
1834 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1838 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1845 gen_constant_list(register OP *o)
1849 I32 oldtmps_floor = PL_tmps_floor;
1853 return o; /* Don't attempt to run with errors */
1855 PL_op = curop = LINKLIST(o);
1861 PL_tmps_floor = oldtmps_floor;
1863 o->op_type = OP_RV2AV;
1864 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1865 curop = ((UNOP*)o)->op_first;
1866 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1873 convert(I32 type, I32 flags, OP *o)
1878 if (!o || o->op_type != OP_LIST)
1879 o = newLISTOP(OP_LIST, 0, o, Nullop);
1881 o->op_flags &= ~OPf_WANT;
1883 if (!(PL_opargs[type] & OA_MARK))
1884 null(cLISTOPo->op_first);
1887 o->op_ppaddr = PL_ppaddr[type];
1888 o->op_flags |= flags;
1890 o = CHECKOP(type, o);
1891 if (o->op_type != type)
1894 if (cLISTOPo->op_children < 7) {
1895 /* XXX do we really need to do this if we're done appending?? */
1896 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1898 cLISTOPo->op_last = last; /* in case check substituted last arg */
1901 return fold_constants(o);
1904 /* List constructors */
1907 append_elem(I32 type, OP *first, OP *last)
1915 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1916 return newLISTOP(type, 0, first, last);
1918 if (first->op_flags & OPf_KIDS)
1919 ((LISTOP*)first)->op_last->op_sibling = last;
1921 first->op_flags |= OPf_KIDS;
1922 ((LISTOP*)first)->op_first = last;
1924 ((LISTOP*)first)->op_last = last;
1925 ((LISTOP*)first)->op_children++;
1930 append_list(I32 type, LISTOP *first, LISTOP *last)
1938 if (first->op_type != type)
1939 return prepend_elem(type, (OP*)first, (OP*)last);
1941 if (last->op_type != type)
1942 return append_elem(type, (OP*)first, (OP*)last);
1944 first->op_last->op_sibling = last->op_first;
1945 first->op_last = last->op_last;
1946 first->op_children += last->op_children;
1947 if (first->op_children)
1948 first->op_flags |= OPf_KIDS;
1955 prepend_elem(I32 type, OP *first, OP *last)
1963 if (last->op_type == type) {
1964 if (type == OP_LIST) { /* already a PUSHMARK there */
1965 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1966 ((LISTOP*)last)->op_first->op_sibling = first;
1969 if (!(last->op_flags & OPf_KIDS)) {
1970 ((LISTOP*)last)->op_last = first;
1971 last->op_flags |= OPf_KIDS;
1973 first->op_sibling = ((LISTOP*)last)->op_first;
1974 ((LISTOP*)last)->op_first = first;
1976 ((LISTOP*)last)->op_children++;
1980 return newLISTOP(type, 0, first, last);
1988 return newOP(OP_STUB, 0);
1994 if (!o || o->op_type != OP_LIST)
1995 o = newLISTOP(OP_LIST, 0, o, Nullop);
2001 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2005 Newz(1101, listop, 1, LISTOP);
2007 listop->op_type = type;
2008 listop->op_ppaddr = PL_ppaddr[type];
2009 listop->op_children = (first != 0) + (last != 0);
2010 listop->op_flags = flags;
2014 else if (!first && last)
2017 first->op_sibling = last;
2018 listop->op_first = first;
2019 listop->op_last = last;
2020 if (type == OP_LIST) {
2022 pushop = newOP(OP_PUSHMARK, 0);
2023 pushop->op_sibling = first;
2024 listop->op_first = pushop;
2025 listop->op_flags |= OPf_KIDS;
2027 listop->op_last = pushop;
2029 else if (listop->op_children)
2030 listop->op_flags |= OPf_KIDS;
2036 newOP(I32 type, I32 flags)
2039 Newz(1101, o, 1, OP);
2041 o->op_ppaddr = PL_ppaddr[type];
2042 o->op_flags = flags;
2045 o->op_private = 0 + (flags >> 8);
2046 if (PL_opargs[type] & OA_RETSCALAR)
2048 if (PL_opargs[type] & OA_TARGET)
2049 o->op_targ = pad_alloc(type, SVs_PADTMP);
2050 return CHECKOP(type, o);
2054 newUNOP(I32 type, I32 flags, OP *first)
2059 first = newOP(OP_STUB, 0);
2060 if (PL_opargs[type] & OA_MARK)
2061 first = force_list(first);
2063 Newz(1101, unop, 1, UNOP);
2064 unop->op_type = type;
2065 unop->op_ppaddr = PL_ppaddr[type];
2066 unop->op_first = first;
2067 unop->op_flags = flags | OPf_KIDS;
2068 unop->op_private = 1 | (flags >> 8);
2069 unop = (UNOP*) CHECKOP(type, unop);
2073 return fold_constants((OP *) unop);
2077 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2080 Newz(1101, binop, 1, BINOP);
2083 first = newOP(OP_NULL, 0);
2085 binop->op_type = type;
2086 binop->op_ppaddr = PL_ppaddr[type];
2087 binop->op_first = first;
2088 binop->op_flags = flags | OPf_KIDS;
2091 binop->op_private = 1 | (flags >> 8);
2094 binop->op_private = 2 | (flags >> 8);
2095 first->op_sibling = last;
2098 binop = (BINOP*)CHECKOP(type, binop);
2102 binop->op_last = binop->op_first->op_sibling;
2104 return fold_constants((OP *)binop);
2108 utf8compare(const void *a, const void *b)
2111 for (i = 0; i < 10; i++) {
2112 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2114 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2121 pmtrans(OP *o, OP *expr, OP *repl)
2123 SV *tstr = ((SVOP*)expr)->op_sv;
2124 SV *rstr = ((SVOP*)repl)->op_sv;
2127 register U8 *t = (U8*)SvPV(tstr, tlen);
2128 register U8 *r = (U8*)SvPV(rstr, rlen);
2134 register short *tbl;
2136 complement = o->op_private & OPpTRANS_COMPLEMENT;
2137 del = o->op_private & OPpTRANS_DELETE;
2138 squash = o->op_private & OPpTRANS_SQUASH;
2140 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2141 SV* listsv = newSVpv("# comment\n",0);
2143 U8* tend = t + tlen;
2144 U8* rend = r + rlen;
2160 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2161 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2167 New(1109, cp, tlen, U8*);
2169 transv = newSVpv("",0);
2178 qsort(cp, i, sizeof(U8*), utf8compare);
2179 for (j = 0; j < i; j++) {
2181 UV val = utf8_to_uv(s, &ulen);
2183 diff = val - nextmin;
2185 t = uv_to_utf8(tmpbuf,nextmin);
2186 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2188 t = uv_to_utf8(tmpbuf, val - 1);
2189 sv_catpvn(transv, "\377", 1);
2190 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2194 val = utf8_to_uv(s+1, &ulen);
2198 t = uv_to_utf8(tmpbuf,nextmin);
2199 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2200 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2201 sv_catpvn(transv, "\377", 1);
2202 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2203 t = (U8*)SvPVX(transv);
2204 tlen = SvCUR(transv);
2207 else if (!rlen && !del) {
2208 r = t; rlen = tlen; rend = tend;
2211 if (to_utf && from_utf) { /* only counting characters */
2212 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2213 o->op_private |= OPpTRANS_IDENTICAL;
2215 else { /* straight latin-1 translation */
2216 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2217 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2218 o->op_private |= OPpTRANS_IDENTICAL;
2222 while (t < tend || tfirst <= tlast) {
2223 /* see if we need more "t" chars */
2224 if (tfirst > tlast) {
2225 tfirst = (I32)utf8_to_uv(t, &ulen);
2227 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2228 tlast = (I32)utf8_to_uv(++t, &ulen);
2235 /* now see if we need more "r" chars */
2236 if (rfirst > rlast) {
2238 rfirst = (I32)utf8_to_uv(r, &ulen);
2240 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2241 rlast = (I32)utf8_to_uv(++r, &ulen);
2250 rfirst = rlast = 0xffffffff;
2254 /* now see which range will peter our first, if either. */
2255 tdiff = tlast - tfirst;
2256 rdiff = rlast - rfirst;
2263 if (rfirst == 0xffffffff) {
2264 diff = tdiff; /* oops, pretend rdiff is infinite */
2266 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2268 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2272 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2274 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2276 if (rfirst + diff > max)
2277 max = rfirst + diff;
2282 else if (rfirst <= 0x800)
2283 grows |= (tfirst < 0x80);
2284 else if (rfirst <= 0x10000)
2285 grows |= (tfirst < 0x800);
2286 else if (rfirst <= 0x200000)
2287 grows |= (tfirst < 0x10000);
2288 else if (rfirst <= 0x4000000)
2289 grows |= (tfirst < 0x200000);
2290 else if (rfirst <= 0x80000000)
2291 grows |= (tfirst < 0x4000000);
2303 else if (max > 0xff)
2308 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2309 SvREFCNT_dec(listsv);
2311 SvREFCNT_dec(transv);
2313 if (!del && havefinal)
2314 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2316 if (grows && to_utf)
2317 o->op_private |= OPpTRANS_GROWS;
2324 tbl = (short*)cPVOPo->op_pv;
2326 Zero(tbl, 256, short);
2327 for (i = 0; i < tlen; i++)
2329 for (i = 0, j = 0; i < 256; i++) {
2345 if (!rlen && !del) {
2348 o->op_private |= OPpTRANS_IDENTICAL;
2350 for (i = 0; i < 256; i++)
2352 for (i = 0, j = 0; i < tlen; i++,j++) {
2355 if (tbl[t[i]] == -1)
2361 if (tbl[t[i]] == -1)
2372 newPMOP(I32 type, I32 flags)
2377 Newz(1101, pmop, 1, PMOP);
2378 pmop->op_type = type;
2379 pmop->op_ppaddr = PL_ppaddr[type];
2380 pmop->op_flags = flags;
2381 pmop->op_private = 0 | (flags >> 8);
2383 if (PL_hints & HINT_RE_TAINT)
2384 pmop->op_pmpermflags |= PMf_RETAINT;
2385 if (PL_hints & HINT_LOCALE)
2386 pmop->op_pmpermflags |= PMf_LOCALE;
2387 pmop->op_pmflags = pmop->op_pmpermflags;
2389 /* link into pm list */
2390 if (type != OP_TRANS && PL_curstash) {
2391 pmop->op_pmnext = HvPMROOT(PL_curstash);
2392 HvPMROOT(PL_curstash) = pmop;
2399 pmruntime(OP *o, OP *expr, OP *repl)
2404 I32 repl_has_vars = 0;
2406 if (o->op_type == OP_TRANS)
2407 return pmtrans(o, expr, repl);
2409 PL_hints |= HINT_BLOCK_SCOPE;
2412 if (expr->op_type == OP_CONST) {
2414 SV *pat = ((SVOP*)expr)->op_sv;
2415 char *p = SvPV(pat, plen);
2416 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2417 sv_setpvn(pat, "\\s+", 3);
2418 p = SvPV(pat, plen);
2419 pm->op_pmflags |= PMf_SKIPWHITE;
2421 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2422 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2423 pm->op_pmflags |= PMf_WHITE;
2427 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2428 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2430 : OP_REGCMAYBE),0,expr);
2432 Newz(1101, rcop, 1, LOGOP);
2433 rcop->op_type = OP_REGCOMP;
2434 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2435 rcop->op_first = scalar(expr);
2436 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2437 ? (OPf_SPECIAL | OPf_KIDS)
2439 rcop->op_private = 1;
2442 /* establish postfix order */
2443 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2445 rcop->op_next = expr;
2446 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2449 rcop->op_next = LINKLIST(expr);
2450 expr->op_next = (OP*)rcop;
2453 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2458 if (pm->op_pmflags & PMf_EVAL)
2461 else if (repl->op_type == OP_THREADSV
2462 && strchr("&`'123456789+",
2463 PL_threadsv_names[repl->op_targ]))
2467 #endif /* USE_THREADS */
2468 else if (repl->op_type == OP_CONST)
2472 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2473 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2475 if (curop->op_type == OP_THREADSV) {
2477 if (strchr("&`'123456789+", curop->op_private))
2481 if (curop->op_type == OP_GV) {
2482 GV *gv = ((GVOP*)curop)->op_gv;
2484 if (strchr("&`'123456789+", *GvENAME(gv)))
2487 #endif /* USE_THREADS */
2488 else if (curop->op_type == OP_RV2CV)
2490 else if (curop->op_type == OP_RV2SV ||
2491 curop->op_type == OP_RV2AV ||
2492 curop->op_type == OP_RV2HV ||
2493 curop->op_type == OP_RV2GV) {
2494 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2497 else if (curop->op_type == OP_PADSV ||
2498 curop->op_type == OP_PADAV ||
2499 curop->op_type == OP_PADHV ||
2500 curop->op_type == OP_PADANY) {
2503 else if (curop->op_type == OP_PUSHRE)
2504 ; /* Okay here, dangerous in newASSIGNOP */
2513 && (!pm->op_pmregexp
2514 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2515 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2516 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2517 prepend_elem(o->op_type, scalar(repl), o);
2520 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2521 pm->op_pmflags |= PMf_MAYBE_CONST;
2522 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2524 Newz(1101, rcop, 1, LOGOP);
2525 rcop->op_type = OP_SUBSTCONT;
2526 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2527 rcop->op_first = scalar(repl);
2528 rcop->op_flags |= OPf_KIDS;
2529 rcop->op_private = 1;
2532 /* establish postfix order */
2533 rcop->op_next = LINKLIST(repl);
2534 repl->op_next = (OP*)rcop;
2536 pm->op_pmreplroot = scalar((OP*)rcop);
2537 pm->op_pmreplstart = LINKLIST(rcop);
2546 newSVOP(I32 type, I32 flags, SV *sv)
2549 Newz(1101, svop, 1, SVOP);
2550 svop->op_type = type;
2551 svop->op_ppaddr = PL_ppaddr[type];
2553 svop->op_next = (OP*)svop;
2554 svop->op_flags = flags;
2555 if (PL_opargs[type] & OA_RETSCALAR)
2557 if (PL_opargs[type] & OA_TARGET)
2558 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2559 return CHECKOP(type, svop);
2563 newGVOP(I32 type, I32 flags, GV *gv)
2567 Newz(1101, gvop, 1, GVOP);
2568 gvop->op_type = type;
2569 gvop->op_ppaddr = PL_ppaddr[type];
2570 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2571 gvop->op_next = (OP*)gvop;
2572 gvop->op_flags = flags;
2573 if (PL_opargs[type] & OA_RETSCALAR)
2575 if (PL_opargs[type] & OA_TARGET)
2576 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2577 return CHECKOP(type, gvop);
2581 newPVOP(I32 type, I32 flags, char *pv)
2584 Newz(1101, pvop, 1, PVOP);
2585 pvop->op_type = type;
2586 pvop->op_ppaddr = PL_ppaddr[type];
2588 pvop->op_next = (OP*)pvop;
2589 pvop->op_flags = flags;
2590 if (PL_opargs[type] & OA_RETSCALAR)
2592 if (PL_opargs[type] & OA_TARGET)
2593 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2594 return CHECKOP(type, pvop);
2603 save_hptr(&PL_curstash);
2604 save_item(PL_curstname);
2609 name = SvPV(sv, len);
2610 PL_curstash = gv_stashpvn(name,len,TRUE);
2611 sv_setpvn(PL_curstname, name, len);
2615 sv_setpv(PL_curstname,"<none>");
2616 PL_curstash = Nullhv;
2618 PL_hints |= HINT_BLOCK_SCOPE;
2619 PL_copline = NOLINE;
2624 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2633 if (id->op_type != OP_CONST)
2634 croak("Module name must be constant");
2638 if(version != Nullop) {
2639 SV *vesv = ((SVOP*)version)->op_sv;
2641 if (arg == Nullop && !SvNIOK(vesv)) {
2648 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2649 croak("Version number must be constant number");
2651 /* Make copy of id so we don't free it twice */
2652 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2654 /* Fake up a method call to VERSION */
2655 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2656 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2657 append_elem(OP_LIST,
2658 prepend_elem(OP_LIST, pack, list(version)),
2659 newUNOP(OP_METHOD, 0, meth)));
2663 /* Fake up an import/unimport */
2664 if (arg && arg->op_type == OP_STUB)
2665 imop = arg; /* no import on explicit () */
2666 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2667 imop = Nullop; /* use 5.0; */
2670 /* Make copy of id so we don't free it twice */
2671 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2672 meth = newSVOP(OP_CONST, 0,
2674 ? newSVpv("import", 6)
2675 : newSVpv("unimport", 8)
2677 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2678 append_elem(OP_LIST,
2679 prepend_elem(OP_LIST, pack, list(arg)),
2680 newUNOP(OP_METHOD, 0, meth)));
2683 /* Fake up a require, handle override, if any */
2684 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2685 if (!(gv && GvIMPORTED_CV(gv)))
2686 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2688 if (gv && GvIMPORTED_CV(gv)) {
2689 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2690 append_elem(OP_LIST, id,
2691 scalar(newUNOP(OP_RV2CV, 0,
2696 rqop = newUNOP(OP_REQUIRE, 0, id);
2699 /* Fake up the BEGIN {}, which does its thing immediately. */
2701 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2703 append_elem(OP_LINESEQ,
2704 append_elem(OP_LINESEQ,
2705 newSTATEOP(0, Nullch, rqop),
2706 newSTATEOP(0, Nullch, veop)),
2707 newSTATEOP(0, Nullch, imop) ));
2709 PL_copline = NOLINE;
2719 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2720 if (!(gv && GvIMPORTED_CV(gv)))
2721 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2723 if (gv && GvIMPORTED_CV(gv)) {
2724 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2725 append_elem(OP_LIST, term,
2726 scalar(newUNOP(OP_RV2CV, 0,
2731 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2737 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2739 return newBINOP(OP_LSLICE, flags,
2740 list(force_list(subscript)),
2741 list(force_list(listval)) );
2745 list_assignment(register OP *o)
2750 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2751 o = cUNOPo->op_first;
2753 if (o->op_type == OP_COND_EXPR) {
2754 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2755 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2760 yyerror("Assignment to both a list and a scalar");
2764 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2765 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2766 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2769 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2772 if (o->op_type == OP_RV2SV)
2779 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2784 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2785 return newLOGOP(optype, 0,
2786 mod(scalar(left), optype),
2787 newUNOP(OP_SASSIGN, 0, scalar(right)));
2790 return newBINOP(optype, OPf_STACKED,
2791 mod(scalar(left), optype), scalar(right));
2795 if (list_assignment(left)) {
2798 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2799 left = mod(left, OP_AASSIGN);
2807 o = newBINOP(OP_AASSIGN, flags,
2808 list(force_list(right)),
2809 list(force_list(left)) );
2810 o->op_private = 0 | (flags >> 8);
2811 if (!(left->op_private & OPpLVAL_INTRO)) {
2815 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2816 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2817 if (curop->op_type == OP_GV) {
2818 GV *gv = ((GVOP*)curop)->op_gv;
2819 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2821 SvCUR(gv) = PL_generation;
2823 else if (curop->op_type == OP_PADSV ||
2824 curop->op_type == OP_PADAV ||
2825 curop->op_type == OP_PADHV ||
2826 curop->op_type == OP_PADANY) {
2827 SV **svp = AvARRAY(PL_comppad_name);
2828 SV *sv = svp[curop->op_targ];
2829 if (SvCUR(sv) == PL_generation)
2831 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2833 else if (curop->op_type == OP_RV2CV)
2835 else if (curop->op_type == OP_RV2SV ||
2836 curop->op_type == OP_RV2AV ||
2837 curop->op_type == OP_RV2HV ||
2838 curop->op_type == OP_RV2GV) {
2839 if (lastop->op_type != OP_GV) /* funny deref? */
2842 else if (curop->op_type == OP_PUSHRE) {
2843 if (((PMOP*)curop)->op_pmreplroot) {
2844 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2845 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2847 SvCUR(gv) = PL_generation;
2856 o->op_private = OPpASSIGN_COMMON;
2858 if (right && right->op_type == OP_SPLIT) {
2860 if ((tmpop = ((LISTOP*)right)->op_first) &&
2861 tmpop->op_type == OP_PUSHRE)
2863 PMOP *pm = (PMOP*)tmpop;
2864 if (left->op_type == OP_RV2AV &&
2865 !(left->op_private & OPpLVAL_INTRO) &&
2866 !(o->op_private & OPpASSIGN_COMMON) )
2868 tmpop = ((UNOP*)left)->op_first;
2869 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2870 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2871 pm->op_pmflags |= PMf_ONCE;
2872 tmpop = cUNOPo->op_first; /* to list (nulled) */
2873 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2874 tmpop->op_sibling = Nullop; /* don't free split */
2875 right->op_next = tmpop->op_next; /* fix starting loc */
2876 op_free(o); /* blow off assign */
2877 right->op_flags &= ~OPf_WANT;
2878 /* "I don't know and I don't care." */
2883 if (PL_modcount < 10000 &&
2884 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2886 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2888 sv_setiv(sv, PL_modcount+1);
2896 right = newOP(OP_UNDEF, 0);
2897 if (right->op_type == OP_READLINE) {
2898 right->op_flags |= OPf_STACKED;
2899 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2902 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2903 o = newBINOP(OP_SASSIGN, flags,
2904 scalar(right), mod(scalar(left), OP_SASSIGN) );
2916 newSTATEOP(I32 flags, char *label, OP *o)
2919 U32 seq = intro_my();
2922 Newz(1101, cop, 1, COP);
2923 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2924 cop->op_type = OP_DBSTATE;
2925 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2928 cop->op_type = OP_NEXTSTATE;
2929 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2931 cop->op_flags = flags;
2932 cop->op_private = (PL_hints & HINT_UTF8);
2934 cop->op_private |= NATIVE_HINTS;
2936 PL_compiling.op_private = cop->op_private;
2937 cop->op_next = (OP*)cop;
2940 cop->cop_label = label;
2941 PL_hints |= HINT_BLOCK_SCOPE;
2944 cop->cop_arybase = PL_curcop->cop_arybase;
2945 if (PL_curcop->cop_warnings == WARN_NONE
2946 || PL_curcop->cop_warnings == WARN_ALL)
2947 cop->cop_warnings = PL_curcop->cop_warnings ;
2949 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2952 if (PL_copline == NOLINE)
2953 cop->cop_line = PL_curcop->cop_line;
2955 cop->cop_line = PL_copline;
2956 PL_copline = NOLINE;
2958 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2959 cop->cop_stash = PL_curstash;
2961 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2962 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2963 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2964 (void)SvIOK_on(*svp);
2966 SvSTASH(*svp) = (HV*)cop;
2970 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2973 /* "Introduce" my variables to visible status. */
2981 if (! PL_min_intro_pending)
2982 return PL_cop_seqmax;
2984 svp = AvARRAY(PL_comppad_name);
2985 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2986 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2987 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2988 SvNVX(sv) = (double)PL_cop_seqmax;
2991 PL_min_intro_pending = 0;
2992 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2993 return PL_cop_seqmax++;
2997 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2999 return new_logop(type, flags, &first, &other);
3003 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3008 OP *first = *firstp;
3009 OP *other = *otherp;
3011 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3012 return newBINOP(type, flags, scalar(first), scalar(other));
3014 scalarboolean(first);
3015 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3016 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3017 if (type == OP_AND || type == OP_OR) {
3023 first = *firstp = cUNOPo->op_first;
3025 first->op_next = o->op_next;
3026 cUNOPo->op_first = Nullop;
3030 if (first->op_type == OP_CONST) {
3031 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3032 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3034 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3045 else if (first->op_type == OP_WANTARRAY) {
3051 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3052 OP *k1 = ((UNOP*)first)->op_first;
3053 OP *k2 = k1->op_sibling;
3055 switch (first->op_type)
3058 if (k2 && k2->op_type == OP_READLINE
3059 && (k2->op_flags & OPf_STACKED)
3060 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3061 warnop = k2->op_type;
3065 if (k1->op_type == OP_READDIR
3066 || k1->op_type == OP_GLOB
3067 || k1->op_type == OP_EACH)
3068 warnop = k1->op_type;
3072 line_t oldline = PL_curcop->cop_line;
3073 PL_curcop->cop_line = PL_copline;
3075 "Value of %s%s can be \"0\"; test with defined()",
3077 ((warnop == OP_READLINE || warnop == OP_GLOB)
3078 ? " construct" : "() operator"));
3079 PL_curcop->cop_line = oldline;
3086 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3087 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3089 Newz(1101, logop, 1, LOGOP);
3091 logop->op_type = type;
3092 logop->op_ppaddr = PL_ppaddr[type];
3093 logop->op_first = first;
3094 logop->op_flags = flags | OPf_KIDS;
3095 logop->op_other = LINKLIST(other);
3096 logop->op_private = 1 | (flags >> 8);
3098 /* establish postfix order */
3099 logop->op_next = LINKLIST(first);
3100 first->op_next = (OP*)logop;
3101 first->op_sibling = other;
3103 o = newUNOP(OP_NULL, 0, (OP*)logop);
3110 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3117 return newLOGOP(OP_AND, 0, first, trueop);
3119 return newLOGOP(OP_OR, 0, first, falseop);
3121 scalarboolean(first);
3122 if (first->op_type == OP_CONST) {
3123 if (SvTRUE(((SVOP*)first)->op_sv)) {
3134 else if (first->op_type == OP_WANTARRAY) {
3138 Newz(1101, condop, 1, CONDOP);
3140 condop->op_type = OP_COND_EXPR;
3141 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3142 condop->op_first = first;
3143 condop->op_flags = flags | OPf_KIDS;
3144 condop->op_true = LINKLIST(trueop);
3145 condop->op_false = LINKLIST(falseop);
3146 condop->op_private = 1 | (flags >> 8);
3148 /* establish postfix order */
3149 condop->op_next = LINKLIST(first);
3150 first->op_next = (OP*)condop;
3152 first->op_sibling = trueop;
3153 trueop->op_sibling = falseop;
3154 o = newUNOP(OP_NULL, 0, (OP*)condop);
3156 trueop->op_next = o;
3157 falseop->op_next = o;
3163 newRANGE(I32 flags, OP *left, OP *right)
3171 Newz(1101, condop, 1, CONDOP);
3173 condop->op_type = OP_RANGE;
3174 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3175 condop->op_first = left;
3176 condop->op_flags = OPf_KIDS;
3177 condop->op_true = LINKLIST(left);
3178 condop->op_false = LINKLIST(right);
3179 condop->op_private = 1 | (flags >> 8);
3181 left->op_sibling = right;
3183 condop->op_next = (OP*)condop;
3184 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3185 flop = newUNOP(OP_FLOP, 0, flip);
3186 o = newUNOP(OP_NULL, 0, flop);
3189 left->op_next = flip;
3190 right->op_next = flop;
3192 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3193 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3194 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3195 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3197 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3198 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3201 if (!flip->op_private || !flop->op_private)
3202 linklist(o); /* blow off optimizer unless constant */
3208 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3213 int once = block && block->op_flags & OPf_SPECIAL &&
3214 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3217 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3218 return block; /* do {} while 0 does once */
3219 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3220 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3221 expr = newUNOP(OP_DEFINED, 0,
3222 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3223 } else if (expr->op_flags & OPf_KIDS) {
3224 OP *k1 = ((UNOP*)expr)->op_first;
3225 OP *k2 = (k1) ? k1->op_sibling : NULL;
3226 switch (expr->op_type) {
3228 if (k2 && k2->op_type == OP_READLINE
3229 && (k2->op_flags & OPf_STACKED)
3230 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3231 expr = newUNOP(OP_DEFINED, 0, expr);
3235 if (k1->op_type == OP_READDIR
3236 || k1->op_type == OP_GLOB
3237 || k1->op_type == OP_EACH)
3238 expr = newUNOP(OP_DEFINED, 0, expr);
3244 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3245 o = new_logop(OP_AND, 0, &expr, &listop);
3248 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3250 if (once && o != listop)
3251 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3254 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3256 o->op_flags |= flags;
3258 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3263 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3272 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3273 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3274 expr = newUNOP(OP_DEFINED, 0,
3275 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3276 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3277 OP *k1 = ((UNOP*)expr)->op_first;
3278 OP *k2 = (k1) ? k1->op_sibling : NULL;
3279 switch (expr->op_type) {
3281 if (k2 && k2->op_type == OP_READLINE
3282 && (k2->op_flags & OPf_STACKED)
3283 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3284 expr = newUNOP(OP_DEFINED, 0, expr);
3288 if (k1->op_type == OP_READDIR
3289 || k1->op_type == OP_GLOB
3290 || k1->op_type == OP_EACH)
3291 expr = newUNOP(OP_DEFINED, 0, expr);
3297 block = newOP(OP_NULL, 0);
3300 next = LINKLIST(cont);
3302 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3303 if ((line_t)whileline != NOLINE) {
3304 PL_copline = whileline;
3305 cont = append_elem(OP_LINESEQ, cont,
3306 newSTATEOP(0, Nullch, Nullop));
3310 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3311 redo = LINKLIST(listop);
3314 PL_copline = whileline;
3316 o = new_logop(OP_AND, 0, &expr, &listop);
3317 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3318 op_free(expr); /* oops, it's a while (0) */
3320 return Nullop; /* listop already freed by new_logop */
3323 ((LISTOP*)listop)->op_last->op_next = condop =
3324 (o == listop ? redo : LINKLIST(o));
3332 Newz(1101,loop,1,LOOP);
3333 loop->op_type = OP_ENTERLOOP;
3334 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3335 loop->op_private = 0;
3336 loop->op_next = (OP*)loop;
3339 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3341 loop->op_redoop = redo;
3342 loop->op_lastop = o;
3345 loop->op_nextop = next;
3347 loop->op_nextop = o;
3349 o->op_flags |= flags;
3350 o->op_private |= (flags >> 8);
3355 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3363 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3364 sv->op_type = OP_RV2GV;
3365 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3367 else if (sv->op_type == OP_PADSV) { /* private variable */
3368 padoff = sv->op_targ;
3372 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3373 padoff = sv->op_targ;
3374 iterflags |= OPf_SPECIAL;
3379 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3383 padoff = find_threadsv("_");
3384 iterflags |= OPf_SPECIAL;
3386 sv = newGVOP(OP_GV, 0, PL_defgv);
3389 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3390 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3391 iterflags |= OPf_STACKED;
3393 else if (expr->op_type == OP_NULL &&
3394 (expr->op_flags & OPf_KIDS) &&
3395 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3397 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3398 * set the STACKED flag to indicate that these values are to be
3399 * treated as min/max values by 'pp_iterinit'.
3401 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3402 CONDOP* range = (CONDOP*) flip->op_first;
3403 OP* left = range->op_first;
3404 OP* right = left->op_sibling;
3407 range->op_flags &= ~OPf_KIDS;
3408 range->op_first = Nullop;
3410 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3411 listop->op_first->op_next = range->op_true;
3412 left->op_next = range->op_false;
3413 right->op_next = (OP*)listop;
3414 listop->op_next = listop->op_first;
3417 expr = (OP*)(listop);
3419 iterflags |= OPf_STACKED;
3422 expr = mod(force_list(expr), OP_GREPSTART);
3426 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3427 append_elem(OP_LIST, expr, scalar(sv))));
3428 assert(!loop->op_next);
3429 Renew(loop, 1, LOOP);
3430 loop->op_targ = padoff;
3431 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3432 PL_copline = forline;
3433 return newSTATEOP(0, label, wop);
3437 newLOOPEX(I32 type, OP *label)
3443 if (type != OP_GOTO || label->op_type == OP_CONST) {
3444 /* "last()" means "last" */
3445 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3446 o = newOP(type, OPf_SPECIAL);
3448 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3449 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3455 if (label->op_type == OP_ENTERSUB)
3456 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3457 o = newUNOP(type, OPf_STACKED, label);
3459 PL_hints |= HINT_BLOCK_SCOPE;
3469 MUTEX_DESTROY(CvMUTEXP(cv));
3470 Safefree(CvMUTEXP(cv));
3473 #endif /* USE_THREADS */
3475 if (!CvXSUB(cv) && CvROOT(cv)) {
3477 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3478 croak("Can't undef active subroutine");
3481 croak("Can't undef active subroutine");
3482 #endif /* USE_THREADS */
3485 SAVESPTR(PL_curpad);
3489 op_free(CvROOT(cv));
3490 CvROOT(cv) = Nullop;
3493 SvPOK_off((SV*)cv); /* forget prototype */
3495 SvREFCNT_dec(CvGV(cv));
3497 SvREFCNT_dec(CvOUTSIDE(cv));
3498 CvOUTSIDE(cv) = Nullcv;
3499 if (CvPADLIST(cv)) {
3500 /* may be during global destruction */
3501 if (SvREFCNT(CvPADLIST(cv))) {
3502 I32 i = AvFILLp(CvPADLIST(cv));
3504 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3505 SV* sv = svp ? *svp : Nullsv;
3508 if (sv == (SV*)PL_comppad_name)
3509 PL_comppad_name = Nullav;
3510 else if (sv == (SV*)PL_comppad) {
3511 PL_comppad = Nullav;
3512 PL_curpad = Null(SV**);
3516 SvREFCNT_dec((SV*)CvPADLIST(cv));
3518 CvPADLIST(cv) = Nullav;
3522 #ifdef DEBUG_CLOSURES
3527 CV *outside = CvOUTSIDE(cv);
3528 AV* padlist = CvPADLIST(cv);
3535 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3537 (CvANON(cv) ? "ANON"
3538 : (cv == PL_main_cv) ? "MAIN"
3539 : CvUNIQUE(cv) ? "UNIQUE"
3540 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3543 : CvANON(outside) ? "ANON"
3544 : (outside == PL_main_cv) ? "MAIN"
3545 : CvUNIQUE(outside) ? "UNIQUE"
3546 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3551 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3552 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3553 pname = AvARRAY(pad_name);
3554 ppad = AvARRAY(pad);
3556 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3557 if (SvPOK(pname[ix]))
3558 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3560 SvFAKE(pname[ix]) ? "FAKE " : "",
3562 (long)I_32(SvNVX(pname[ix])),
3563 (long)SvIVX(pname[ix]));
3566 #endif /* DEBUG_CLOSURES */
3569 cv_clone2(CV *proto, CV *outside)
3574 AV* protopadlist = CvPADLIST(proto);
3575 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3576 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3577 SV** pname = AvARRAY(protopad_name);
3578 SV** ppad = AvARRAY(protopad);
3579 I32 fname = AvFILLp(protopad_name);
3580 I32 fpad = AvFILLp(protopad);
3584 assert(!CvUNIQUE(proto));
3587 SAVESPTR(PL_curpad);
3588 SAVESPTR(PL_comppad);
3589 SAVESPTR(PL_comppad_name);
3590 SAVESPTR(PL_compcv);
3592 cv = PL_compcv = (CV*)NEWSV(1104,0);
3593 sv_upgrade((SV *)cv, SvTYPE(proto));
3599 New(666, CvMUTEXP(cv), 1, perl_mutex);
3600 MUTEX_INIT(CvMUTEXP(cv));
3602 #endif /* USE_THREADS */
3603 CvFILEGV(cv) = CvFILEGV(proto);
3604 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3605 CvSTASH(cv) = CvSTASH(proto);
3606 CvROOT(cv) = CvROOT(proto);
3607 CvSTART(cv) = CvSTART(proto);
3609 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3612 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3614 PL_comppad_name = newAV();
3615 for (ix = fname; ix >= 0; ix--)
3616 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3618 PL_comppad = newAV();
3620 comppadlist = newAV();
3621 AvREAL_off(comppadlist);
3622 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3623 av_store(comppadlist, 1, (SV*)PL_comppad);
3624 CvPADLIST(cv) = comppadlist;
3625 av_fill(PL_comppad, AvFILLp(protopad));
3626 PL_curpad = AvARRAY(PL_comppad);
3628 av = newAV(); /* will be @_ */
3630 av_store(PL_comppad, 0, (SV*)av);
3631 AvFLAGS(av) = AVf_REIFY;
3633 for (ix = fpad; ix > 0; ix--) {
3634 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3635 if (namesv && namesv != &PL_sv_undef) {
3636 char *name = SvPVX(namesv); /* XXX */
3637 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3638 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3639 CvOUTSIDE(cv), cxstack_ix, 0);
3641 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3643 croak("panic: cv_clone: %s", name);
3645 else { /* our own lexical */
3648 /* anon code -- we'll come back for it */
3649 sv = SvREFCNT_inc(ppad[ix]);
3651 else if (*name == '@')
3653 else if (*name == '%')
3663 SV* sv = NEWSV(0,0);
3669 /* Now that vars are all in place, clone nested closures. */
3671 for (ix = fpad; ix > 0; ix--) {
3672 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3674 && namesv != &PL_sv_undef
3675 && !(SvFLAGS(namesv) & SVf_FAKE)
3676 && *SvPVX(namesv) == '&'
3677 && CvCLONE(ppad[ix]))
3679 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3680 SvREFCNT_dec(ppad[ix]);
3683 PL_curpad[ix] = (SV*)kid;
3687 #ifdef DEBUG_CLOSURES
3688 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3690 PerlIO_printf(Perl_debug_log, " from:\n");
3692 PerlIO_printf(Perl_debug_log, " to:\n");
3704 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3705 cv = cv_clone2(proto, CvOUTSIDE(proto));
3706 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3711 cv_ckproto(CV *cv, GV *gv, char *p)
3713 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3714 SV* msg = sv_newmortal();
3718 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3719 sv_setpv(msg, "Prototype mismatch:");
3721 sv_catpvf(msg, " sub %_", name);
3723 sv_catpvf(msg, " (%s)", SvPVX(cv));
3724 sv_catpv(msg, " vs ");
3726 sv_catpvf(msg, "(%s)", p);
3728 sv_catpv(msg, "none");
3736 if (!cv || !SvPOK(cv) || SvCUR(cv))
3738 return op_const_sv(CvSTART(cv), cv);
3742 op_const_sv(OP *o, CV *cv)
3749 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3750 o = cLISTOPo->op_first->op_sibling;
3752 for (; o; o = o->op_next) {
3753 OPCODE type = o->op_type;
3755 if(sv && o->op_next == o)
3757 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3759 if (type == OP_LEAVESUB || type == OP_RETURN)
3763 if (type == OP_CONST)
3765 else if (type == OP_PADSV && cv) {
3766 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3767 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3768 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3780 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3784 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3785 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3786 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3787 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3796 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3797 maximum a prototype before. */
3798 if (SvTYPE(gv) > SVt_NULL) {
3799 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3800 warn("Runaway prototype");
3801 cv_ckproto((CV*)gv, NULL, ps);
3804 sv_setpv((SV*)gv, ps);
3806 sv_setiv((SV*)gv, -1);
3807 SvREFCNT_dec(PL_compcv);
3808 cv = PL_compcv = NULL;
3809 PL_sub_generation++;
3813 if (!name || GvCVGEN(gv))
3815 else if (cv = GvCV(gv)) {
3816 cv_ckproto(cv, gv, ps);
3817 /* already defined (or promised)? */
3818 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3820 bool const_changed = TRUE;
3822 /* just a "sub foo;" when &foo is already defined */
3823 SAVEFREESV(PL_compcv);
3826 /* ahem, death to those who redefine active sort subs */
3827 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3828 croak("Can't redefine active sort subroutine %s", name);
3829 if(const_sv = cv_const_sv(cv))
3830 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3831 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3832 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3833 && HvNAME(GvSTASH(CvGV(cv)))
3834 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3836 line_t oldline = PL_curcop->cop_line;
3837 PL_curcop->cop_line = PL_copline;
3838 warner(WARN_REDEFINE,
3839 const_sv ? "Constant subroutine %s redefined"
3840 : "Subroutine %s redefined", name);
3841 PL_curcop->cop_line = oldline;
3847 if (cv) { /* must reuse cv if autoloaded */
3849 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3850 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3851 CvOUTSIDE(PL_compcv) = 0;
3852 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3853 CvPADLIST(PL_compcv) = 0;
3854 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3855 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3856 SvREFCNT_dec(PL_compcv);
3863 PL_sub_generation++;
3866 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3867 CvFILEGV(cv) = PL_curcop->cop_filegv;
3868 CvSTASH(cv) = PL_curstash;
3871 if (!CvMUTEXP(cv)) {
3872 New(666, CvMUTEXP(cv), 1, perl_mutex);
3873 MUTEX_INIT(CvMUTEXP(cv));
3875 #endif /* USE_THREADS */
3878 sv_setpv((SV*)cv, ps);
3880 if (PL_error_count) {
3884 char *s = strrchr(name, ':');
3886 if (strEQ(s, "BEGIN")) {
3888 "BEGIN not safe after errors--compilation aborted";
3892 /* force display of errors found but not reported */
3893 sv_catpv(ERRSV, not_safe);
3894 croak("%s", SvPVx(ERRSV, n_a));
3901 PL_copline = NOLINE;
3906 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3907 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3910 SV **namep = AvARRAY(PL_comppad_name);
3911 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3914 if (SvIMMORTAL(PL_curpad[ix]))
3917 * The only things that a clonable function needs in its
3918 * pad are references to outer lexicals and anonymous subs.
3919 * The rest are created anew during cloning.
3921 if (!((namesv = namep[ix]) != Nullsv &&
3922 namesv != &PL_sv_undef &&
3924 *SvPVX(namesv) == '&')))
3926 SvREFCNT_dec(PL_curpad[ix]);
3927 PL_curpad[ix] = Nullsv;
3932 AV *av = newAV(); /* Will be @_ */
3934 av_store(PL_comppad, 0, (SV*)av);
3935 AvFLAGS(av) = AVf_REIFY;
3937 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3938 if (SvIMMORTAL(PL_curpad[ix]))
3940 if (!SvPADMY(PL_curpad[ix]))
3941 SvPADTMP_on(PL_curpad[ix]);
3945 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3946 CvSTART(cv) = LINKLIST(CvROOT(cv));
3947 CvROOT(cv)->op_next = 0;
3953 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3954 SV *sv = NEWSV(0,0);
3955 SV *tmpstr = sv_newmortal();
3956 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3960 sv_setpvf(sv, "%_:%ld-%ld",
3961 GvSV(PL_curcop->cop_filegv),
3962 (long)PL_subline, (long)PL_curcop->cop_line);
3963 gv_efullname3(tmpstr, gv, Nullch);
3964 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3965 hv = GvHVn(db_postponed);
3966 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3967 && (cv = GvCV(db_postponed))) {
3972 perl_call_sv((SV*)cv, G_DISCARD);
3976 if ((s = strrchr(name,':')))
3980 if (strEQ(s, "BEGIN")) {
3981 I32 oldscope = PL_scopestack_ix;
3983 SAVESPTR(PL_compiling.cop_filegv);
3984 SAVEI16(PL_compiling.cop_line);
3986 sv_setsv(PL_rs, PL_nrs);
3989 PL_beginav = newAV();
3990 DEBUG_x( dump_sub(gv) );
3991 av_push(PL_beginav, (SV *)cv);
3993 call_list(oldscope, PL_beginav);
3995 PL_curcop = &PL_compiling;
3996 PL_compiling.op_private = PL_hints;
3999 else if (strEQ(s, "END") && !PL_error_count) {
4002 av_unshift(PL_endav, 1);
4003 av_store(PL_endav, 0, (SV *)cv);
4006 else if (strEQ(s, "INIT") && !PL_error_count) {
4008 PL_initav = newAV();
4009 av_push(PL_initav, SvREFCNT_inc(cv));
4015 PL_copline = NOLINE;
4020 /* XXX unsafe for threads if eval_owner isn't held */
4022 newCONSTSUB(HV *stash, char *name, SV *sv)
4025 U32 oldhints = PL_hints;
4026 HV *old_cop_stash = PL_curcop->cop_stash;
4027 HV *old_curstash = PL_curstash;
4028 line_t oldline = PL_curcop->cop_line;
4029 PL_curcop->cop_line = PL_copline;
4031 PL_hints &= ~HINT_BLOCK_SCOPE;
4033 PL_curstash = PL_curcop->cop_stash = stash;
4036 start_subparse(FALSE, 0),
4037 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4038 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4039 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4042 PL_hints = oldhints;
4043 PL_curcop->cop_stash = old_cop_stash;
4044 PL_curstash = old_curstash;
4045 PL_curcop->cop_line = oldline;
4049 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4052 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4055 if (cv = (name ? GvCV(gv) : Nullcv)) {
4057 /* just a cached method */
4061 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4062 /* already defined (or promised) */
4063 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4064 && HvNAME(GvSTASH(CvGV(cv)))
4065 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4066 line_t oldline = PL_curcop->cop_line;
4067 if (PL_copline != NOLINE)
4068 PL_curcop->cop_line = PL_copline;
4069 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4070 PL_curcop->cop_line = oldline;
4077 if (cv) /* must reuse cv if autoloaded */
4080 cv = (CV*)NEWSV(1105,0);
4081 sv_upgrade((SV *)cv, SVt_PVCV);
4085 PL_sub_generation++;
4088 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4090 New(666, CvMUTEXP(cv), 1, perl_mutex);
4091 MUTEX_INIT(CvMUTEXP(cv));
4093 #endif /* USE_THREADS */
4094 CvFILEGV(cv) = gv_fetchfile(filename);
4095 CvXSUB(cv) = subaddr;
4098 char *s = strrchr(name,':');
4103 if (strEQ(s, "BEGIN")) {
4105 PL_beginav = newAV();
4106 av_push(PL_beginav, (SV *)cv);
4109 else if (strEQ(s, "END")) {
4112 av_unshift(PL_endav, 1);
4113 av_store(PL_endav, 0, (SV *)cv);
4116 else if (strEQ(s, "INIT")) {
4118 PL_initav = newAV();
4119 av_push(PL_initav, (SV *)cv);
4130 newFORM(I32 floor, OP *o, OP *block)
4140 name = SvPVx(cSVOPo->op_sv, n_a);
4143 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4145 if (cv = GvFORM(gv)) {
4146 if (ckWARN(WARN_REDEFINE)) {
4147 line_t oldline = PL_curcop->cop_line;
4149 PL_curcop->cop_line = PL_copline;
4150 warner(WARN_REDEFINE, "Format %s redefined",name);
4151 PL_curcop->cop_line = oldline;
4157 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4158 CvFILEGV(cv) = PL_curcop->cop_filegv;
4160 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4161 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4162 SvPADTMP_on(PL_curpad[ix]);
4165 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4166 CvSTART(cv) = LINKLIST(CvROOT(cv));
4167 CvROOT(cv)->op_next = 0;
4170 PL_copline = NOLINE;
4177 return newUNOP(OP_REFGEN, 0,
4178 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4184 return newUNOP(OP_REFGEN, 0,
4185 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4189 newANONSUB(I32 floor, OP *proto, OP *block)
4191 return newUNOP(OP_REFGEN, 0,
4192 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4198 switch (o->op_type) {
4200 o->op_type = OP_PADAV;
4201 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4202 return ref(o, OP_RV2AV);
4205 o->op_type = OP_RV2AV;
4206 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4211 warn("oops: oopsAV");
4220 switch (o->op_type) {
4223 o->op_type = OP_PADHV;
4224 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4225 return ref(o, OP_RV2HV);
4229 o->op_type = OP_RV2HV;
4230 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4235 warn("oops: oopsHV");
4244 if (o->op_type == OP_PADANY) {
4245 o->op_type = OP_PADAV;
4246 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4249 return newUNOP(OP_RV2AV, 0, scalar(o));
4253 newGVREF(I32 type, OP *o)
4255 if (type == OP_MAPSTART)
4256 return newUNOP(OP_NULL, 0, o);
4257 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4263 if (o->op_type == OP_PADANY) {
4264 o->op_type = OP_PADHV;
4265 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4268 return newUNOP(OP_RV2HV, 0, scalar(o));
4274 croak("NOT IMPL LINE %d",__LINE__);
4280 newCVREF(I32 flags, OP *o)
4282 return newUNOP(OP_RV2CV, flags, scalar(o));
4288 if (o->op_type == OP_PADANY) {
4289 o->op_type = OP_PADSV;
4290 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4293 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4294 o->op_flags |= OPpDONE_SVREF;
4297 return newUNOP(OP_RV2SV, 0, scalar(o));
4300 /* Check routines. */
4308 name = NEWSV(1106,0);
4309 sv_upgrade(name, SVt_PVNV);
4310 sv_setpvn(name, "&", 1);
4313 ix = pad_alloc(o->op_type, SVs_PADMY);
4314 av_store(PL_comppad_name, ix, name);
4315 av_store(PL_comppad, ix, cSVOPo->op_sv);
4316 SvPADMY_on(cSVOPo->op_sv);
4317 cSVOPo->op_sv = Nullsv;
4318 cSVOPo->op_targ = ix;
4325 o->op_private = PL_hints;
4332 if (cUNOPo->op_first->op_type == OP_CONCAT)
4333 o->op_flags |= OPf_STACKED;
4340 if (o->op_flags & OPf_KIDS) {
4343 OPCODE type = o->op_type;
4344 o = modkids(ck_fun(o), type);
4345 kid = cUNOPo->op_first;
4346 newop = kUNOP->op_first->op_sibling;
4348 (newop->op_sibling ||
4349 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4350 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4351 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4355 op_free(kUNOP->op_first);
4356 kUNOP->op_first = newop;
4358 o->op_ppaddr = PL_ppaddr[++o->op_type];
4367 if (o->op_flags & OPf_KIDS) {
4368 OP *kid = cUNOPo->op_first;
4369 if (kid->op_type == OP_HSLICE)
4370 o->op_private |= OPpSLICE;
4371 else if (kid->op_type != OP_HELEM)
4372 croak("%s argument is not a HASH element or slice",
4373 PL_op_desc[o->op_type]);
4382 I32 type = o->op_type;
4384 if (o->op_flags & OPf_KIDS) {
4385 if (cLISTOPo->op_first->op_type == OP_STUB) {
4387 o = newUNOP(type, OPf_SPECIAL,
4388 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4398 PL_hints |= HINT_BLOCK_SCOPE;
4399 if (o->op_flags & OPf_KIDS) {
4400 SVOP *kid = (SVOP*)cUNOPo->op_first;
4403 o->op_flags &= ~OPf_KIDS;
4406 else if (kid->op_type == OP_LINESEQ) {
4409 kid->op_next = o->op_next;
4410 cUNOPo->op_first = 0;
4413 Newz(1101, enter, 1, LOGOP);
4414 enter->op_type = OP_ENTERTRY;
4415 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4416 enter->op_private = 0;
4418 /* establish postfix order */
4419 enter->op_next = (OP*)enter;
4421 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4422 o->op_type = OP_LEAVETRY;
4423 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4424 enter->op_other = o;
4432 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4434 o->op_targ = (PADOFFSET)PL_hints;
4442 if (o->op_flags & OPf_STACKED) {
4444 kid = cUNOPo->op_first->op_sibling;
4445 if (kid->op_type == OP_RV2GV)
4457 if (o->op_flags & OPf_KIDS) {
4458 OP *kid = cUNOPo->op_first;
4459 if (kid->op_type != OP_HELEM)
4460 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4468 ck_gvconst(register OP *o)
4470 o = fold_constants(o);
4471 if (o->op_type == OP_CONST)
4478 ck_rvconst(register OP *o)
4481 SVOP *kid = (SVOP*)cUNOPo->op_first;
4483 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4484 if (kid->op_type == OP_CONST) {
4488 SV *kidsv = kid->op_sv;
4491 /* Is it a constant from cv_const_sv()? */
4492 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4493 SV *rsv = SvRV(kidsv);
4494 int svtype = SvTYPE(rsv);
4495 char *badtype = Nullch;
4497 switch (o->op_type) {
4499 if (svtype > SVt_PVMG)
4500 badtype = "a SCALAR";
4503 if (svtype != SVt_PVAV)
4504 badtype = "an ARRAY";
4507 if (svtype != SVt_PVHV) {
4508 if (svtype == SVt_PVAV) { /* pseudohash? */
4509 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4510 if (ksv && SvROK(*ksv)
4511 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4520 if (svtype != SVt_PVCV)
4525 croak("Constant is not %s reference", badtype);
4528 name = SvPV(kidsv, n_a);
4529 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4530 char *badthing = Nullch;
4531 switch (o->op_type) {
4533 badthing = "a SCALAR";
4536 badthing = "an ARRAY";
4539 badthing = "a HASH";
4544 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4548 * This is a little tricky. We only want to add the symbol if we
4549 * didn't add it in the lexer. Otherwise we get duplicate strict
4550 * warnings. But if we didn't add it in the lexer, we must at
4551 * least pretend like we wanted to add it even if it existed before,
4552 * or we get possible typo warnings. OPpCONST_ENTERED says
4553 * whether the lexer already added THIS instance of this symbol.
4555 iscv = (o->op_type == OP_RV2CV) * 2;
4557 gv = gv_fetchpv(name,
4558 iscv | !(kid->op_private & OPpCONST_ENTERED),
4561 : o->op_type == OP_RV2SV
4563 : o->op_type == OP_RV2AV
4565 : o->op_type == OP_RV2HV
4568 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4570 kid->op_type = OP_GV;
4571 SvREFCNT_dec(kid->op_sv);
4572 kid->op_sv = SvREFCNT_inc(gv);
4582 I32 type = o->op_type;
4584 if (o->op_flags & OPf_REF)
4587 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4588 SVOP *kid = (SVOP*)cUNOPo->op_first;
4590 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4592 OP *newop = newGVOP(type, OPf_REF,
4593 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4600 if (type == OP_FTTTY)
4601 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4604 return newUNOP(type, 0, newDEFSVOP());
4617 int type = o->op_type;
4618 register I32 oa = PL_opargs[type] >> OASHIFT;
4620 if (o->op_flags & OPf_STACKED) {
4621 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4624 return no_fh_allowed(o);
4627 if (o->op_flags & OPf_KIDS) {
4629 tokid = &cLISTOPo->op_first;
4630 kid = cLISTOPo->op_first;
4631 if (kid->op_type == OP_PUSHMARK ||
4632 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4634 tokid = &kid->op_sibling;
4635 kid = kid->op_sibling;
4637 if (!kid && PL_opargs[type] & OA_DEFGV)
4638 *tokid = kid = newDEFSVOP();
4642 sibl = kid->op_sibling;
4656 if (kid->op_type == OP_CONST &&
4657 (kid->op_private & OPpCONST_BARE)) {
4658 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4659 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4660 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4661 if (ckWARN(WARN_SYNTAX))
4663 "Array @%s missing the @ in argument %ld of %s()",
4664 name, (long)numargs, PL_op_desc[type]);
4667 kid->op_sibling = sibl;
4670 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4671 bad_type(numargs, "array", PL_op_desc[o->op_type], kid);
4675 if (kid->op_type == OP_CONST &&
4676 (kid->op_private & OPpCONST_BARE)) {
4677 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4678 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4679 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4680 if (ckWARN(WARN_SYNTAX))
4682 "Hash %%%s missing the %% in argument %ld of %s()",
4683 name, (long)numargs, PL_op_desc[type]);
4686 kid->op_sibling = sibl;
4689 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4690 bad_type(numargs, "hash", PL_op_desc[o->op_type], kid);
4695 OP *newop = newUNOP(OP_NULL, 0, kid);
4696 kid->op_sibling = 0;
4698 newop->op_next = newop;
4700 kid->op_sibling = sibl;
4705 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4706 if (kid->op_type == OP_CONST &&
4707 (kid->op_private & OPpCONST_BARE)) {
4708 OP *newop = newGVOP(OP_GV, 0,
4709 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4714 else if (kid->op_type == OP_READLINE) {
4715 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4716 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4719 kid->op_sibling = 0;
4720 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4722 kid->op_sibling = sibl;
4728 mod(scalar(kid), type);
4732 tokid = &kid->op_sibling;
4733 kid = kid->op_sibling;
4735 o->op_private |= numargs;
4737 return too_many_arguments(o,PL_op_desc[o->op_type]);
4740 else if (PL_opargs[type] & OA_DEFGV) {
4742 return newUNOP(type, 0, newDEFSVOP());
4746 while (oa & OA_OPTIONAL)
4748 if (oa && oa != OA_LIST)
4749 return too_few_arguments(o,PL_op_desc[o->op_type]);
4759 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4760 append_elem(OP_GLOB, o, newDEFSVOP());
4762 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4763 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4765 if (gv && GvIMPORTED_CV(gv)) {
4766 append_elem(OP_GLOB, o,
4767 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4768 o->op_type = OP_LIST;
4769 o->op_ppaddr = PL_ppaddr[OP_LIST];
4770 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4771 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4772 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4773 append_elem(OP_LIST, o,
4774 scalar(newUNOP(OP_RV2CV, 0,
4775 newGVOP(OP_GV, 0, gv)))));
4776 o = newUNOP(OP_NULL, 0, ck_subr(o));
4777 o->op_targ = OP_GLOB; /* hint at what it used to be */
4780 gv = newGVgen("main");
4782 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4792 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4794 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4795 Newz(1101, gwop, 1, LOGOP);
4797 if (o->op_flags & OPf_STACKED) {
4800 kid = cLISTOPo->op_first->op_sibling;
4801 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4804 kid->op_next = (OP*)gwop;
4805 o->op_flags &= ~OPf_STACKED;
4807 kid = cLISTOPo->op_first->op_sibling;
4808 if (type == OP_MAPWHILE)
4815 kid = cLISTOPo->op_first->op_sibling;
4816 if (kid->op_type != OP_NULL)
4817 croak("panic: ck_grep");
4818 kid = kUNOP->op_first;
4820 gwop->op_type = type;
4821 gwop->op_ppaddr = PL_ppaddr[type];
4822 gwop->op_first = listkids(o);
4823 gwop->op_flags |= OPf_KIDS;
4824 gwop->op_private = 1;
4825 gwop->op_other = LINKLIST(kid);
4826 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4827 kid->op_next = (OP*)gwop;
4829 kid = cLISTOPo->op_first->op_sibling;
4830 if (!kid || !kid->op_sibling)
4831 return too_few_arguments(o,PL_op_desc[o->op_type]);
4832 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4833 mod(kid, OP_GREPSTART);
4841 if (o->op_flags & OPf_KIDS) {
4842 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4844 kid = kid->op_sibling; /* get past "big" */
4845 if (kid && kid->op_type == OP_CONST)
4846 fbm_compile(((SVOP*)kid)->op_sv, 0);
4852 ck_lengthconst(OP *o)
4854 /* XXX length optimization goes here */
4861 OPCODE type = o->op_type;
4862 return modkids(ck_fun(o), type);
4868 OPCODE type = o->op_type;
4869 return refkids(ck_fun(o), type);
4877 kid = cLISTOPo->op_first;
4880 kid = cLISTOPo->op_first;
4882 if (kid->op_type == OP_PUSHMARK)
4883 kid = kid->op_sibling;
4884 if (kid && o->op_flags & OPf_STACKED)
4885 kid = kid->op_sibling;
4886 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4887 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4888 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4889 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4890 cLISTOPo->op_first->op_sibling = kid;
4891 cLISTOPo->op_last = kid;
4892 kid = kid->op_sibling;
4897 append_elem(o->op_type, o, newDEFSVOP());
4903 if (PL_hints & HINT_LOCALE)
4904 o->op_private |= OPpLOCALE;
4911 ck_fun_locale(OP *o)
4917 if (PL_hints & HINT_LOCALE)
4918 o->op_private |= OPpLOCALE;
4929 if (PL_hints & HINT_LOCALE)
4930 o->op_private |= OPpLOCALE;
4939 o->op_private |= OPpRUNTIME;
4952 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4953 o->op_private |= OPpREPEAT_DOLIST;
4954 cBINOPo->op_first = force_list(cBINOPo->op_first);
4964 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4965 SVOP *kid = (SVOP*)cUNOPo->op_first;
4967 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4969 for (s = SvPVX(kid->op_sv); *s; s++) {
4970 if (*s == ':' && s[1] == ':') {
4972 Move(s+2, s+1, strlen(s+2)+1, char);
4973 --SvCUR(kid->op_sv);
4976 sv_catpvn(kid->op_sv, ".pm", 3);
4986 croak("NOT IMPL LINE %d",__LINE__);
4996 if (o->op_flags & OPf_KIDS) {
4997 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4998 if (kid && kid->op_sibling) {
4999 o->op_type = OP_SSELECT;
5000 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5002 return fold_constants(o);
5006 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5007 if (kid && kid->op_type == OP_RV2GV)
5008 kid->op_private &= ~HINT_STRICT_REFS;
5015 I32 type = o->op_type;
5017 if (!(o->op_flags & OPf_KIDS)) {
5022 if (!CvUNIQUE(PL_compcv)) {
5023 argop = newOP(OP_PADAV, OPf_REF);
5024 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5027 argop = newUNOP(OP_RV2AV, 0,
5028 scalar(newGVOP(OP_GV, 0,
5029 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5032 argop = newUNOP(OP_RV2AV, 0,
5033 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5034 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5035 #endif /* USE_THREADS */
5036 return newUNOP(type, 0, scalar(argop));
5038 return scalar(modkids(ck_fun(o), type));
5046 if (PL_hints & HINT_LOCALE)
5047 o->op_private |= OPpLOCALE;
5050 if (o->op_flags & OPf_STACKED)
5052 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5053 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5055 kid = kUNOP->op_first; /* get past rv2gv */
5057 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5059 if (kid->op_type == OP_SCOPE) {
5063 else if (kid->op_type == OP_LEAVE) {
5064 if (o->op_type == OP_SORT) {
5065 null(kid); /* wipe out leave */
5068 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5069 if (k->op_next == kid)
5074 kid->op_next = 0; /* just disconnect the leave */
5075 k = kLISTOP->op_first;
5079 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5080 null(kid); /* wipe out rv2gv */
5081 if (o->op_type == OP_SORT)
5085 o->op_flags |= OPf_SPECIAL;
5087 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5088 null(cLISTOPo->op_first->op_sibling);
5095 simplify_sort(OP *o)
5098 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5101 if (!(o->op_flags & OPf_STACKED))
5103 kid = kUNOP->op_first; /* get past rv2gv */
5104 if (kid->op_type != OP_SCOPE)
5106 kid = kLISTOP->op_last; /* get past scope */
5107 switch(kid->op_type) {
5115 k = kid; /* remember this node*/
5116 if (kBINOP->op_first->op_type != OP_RV2SV)
5118 kid = kBINOP->op_first; /* get past cmp */
5119 if (kUNOP->op_first->op_type != OP_GV)
5121 kid = kUNOP->op_first; /* get past rv2sv */
5122 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5124 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5126 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5130 kid = k; /* back to cmp */
5131 if (kBINOP->op_last->op_type != OP_RV2SV)
5133 kid = kBINOP->op_last; /* down to 2nd arg */
5134 if (kUNOP->op_first->op_type != OP_GV)
5136 kid = kUNOP->op_first; /* get past rv2sv */
5137 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5139 ? strNE(GvNAME(kGVOP->op_gv), "a")
5140 : strNE(GvNAME(kGVOP->op_gv), "b")))
5142 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5144 o->op_private |= OPpSORT_REVERSE;
5145 if (k->op_type == OP_NCMP)
5146 o->op_private |= OPpSORT_NUMERIC;
5147 if (k->op_type == OP_I_NCMP)
5148 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5149 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5150 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5151 cLISTOPo->op_children = 1;
5159 if (o->op_flags & OPf_STACKED)
5160 return no_fh_allowed(o);
5162 kid = cLISTOPo->op_first;
5163 if (kid->op_type != OP_NULL)
5164 croak("panic: ck_split");
5165 kid = kid->op_sibling;
5166 op_free(cLISTOPo->op_first);
5167 cLISTOPo->op_first = kid;
5169 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5170 cLISTOPo->op_last = kid; /* There was only one element previously */
5173 if (kid->op_type != OP_MATCH) {
5174 OP *sibl = kid->op_sibling;
5175 kid->op_sibling = 0;
5176 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5177 if (cLISTOPo->op_first == cLISTOPo->op_last)
5178 cLISTOPo->op_last = kid;
5179 cLISTOPo->op_first = kid;
5180 kid->op_sibling = sibl;
5183 kid->op_type = OP_PUSHRE;
5184 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5187 if (!kid->op_sibling)
5188 append_elem(OP_SPLIT, o, newDEFSVOP());
5190 kid = kid->op_sibling;
5193 if (!kid->op_sibling)
5194 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5196 kid = kid->op_sibling;
5199 if (kid->op_sibling)
5200 return too_many_arguments(o,PL_op_desc[o->op_type]);
5209 OP *prev = ((cUNOPo->op_first->op_sibling)
5210 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5211 OP *o2 = prev->op_sibling;
5220 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5221 if (cvop->op_type == OP_RV2CV) {
5223 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5224 null(cvop); /* disable rv2cv */
5225 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5226 if (tmpop->op_type == OP_GV) {
5227 cv = GvCVu(tmpop->op_sv);
5228 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5229 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5230 proto = SvPV((SV*)cv, n_a);
5234 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5235 if (PERLDB_SUB && PL_curstash != PL_debstash)
5236 o->op_private |= OPpENTERSUB_DB;
5237 while (o2 != cvop) {
5241 return too_many_arguments(o, gv_ename(namegv));
5259 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5260 bad_type(arg, "block", gv_ename(namegv), o2);
5265 if (o2->op_type == OP_RV2GV)
5269 OP* sib = kid->op_sibling;
5270 kid->op_sibling = 0;
5271 o2 = newUNOP(OP_RV2GV, 0, kid);
5272 o2->op_sibling = sib;
5273 prev->op_sibling = o2;
5281 if (o2->op_type != OP_RV2GV)
5282 bad_type(arg, "symbol", gv_ename(namegv), o2);
5285 if (o2->op_type != OP_RV2CV)
5286 bad_type(arg, "sub", gv_ename(namegv), o2);
5289 if (o2->op_type != OP_RV2SV
5290 && o2->op_type != OP_PADSV
5291 && o2->op_type != OP_THREADSV)
5293 bad_type(arg, "scalar", gv_ename(namegv), o2);
5297 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5298 bad_type(arg, "array", gv_ename(namegv), o2);
5301 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5302 bad_type(arg, "hash", gv_ename(namegv), o2);
5306 OP* sib = kid->op_sibling;
5307 kid->op_sibling = 0;
5308 o2 = newUNOP(OP_REFGEN, 0, kid);
5309 o2->op_sibling = sib;
5310 prev->op_sibling = o2;
5321 croak("Malformed prototype for %s: %s",
5322 gv_ename(namegv), SvPV((SV*)cv, n_a));
5327 mod(o2, OP_ENTERSUB);
5329 o2 = o2->op_sibling;
5331 if (proto && !optional &&
5332 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5333 return too_few_arguments(o, gv_ename(namegv));
5340 SvREADONLY_on(cSVOPo->op_sv);
5347 if (o->op_flags & OPf_KIDS) {
5348 SVOP *kid = (SVOP*)cUNOPo->op_first;
5350 if (kid->op_type == OP_NULL)
5351 kid = (SVOP*)kid->op_sibling;
5353 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5354 o->op_flags |= OPf_SPECIAL;
5359 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5362 peep(register OP *o)
5365 register OP* oldop = 0;
5368 if (!o || o->op_seq)
5372 SAVESPTR(PL_curcop);
5373 for (; o; o = o->op_next) {
5379 switch (o->op_type) {
5382 PL_curcop = ((COP*)o); /* for warnings */
5383 o->op_seq = PL_op_seqmax++;
5394 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5396 o->op_seq = PL_op_seqmax++;
5399 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5400 o->op_seq = PL_op_seqmax++;
5401 break; /* Scalar stub must produce undef. List stub is noop */
5405 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5406 PL_curcop = ((COP*)o);
5412 if (oldop && o->op_next) {
5413 oldop->op_next = o->op_next;
5416 o->op_seq = PL_op_seqmax++;
5420 if (o->op_next->op_type == OP_RV2SV) {
5421 if (!(o->op_next->op_private & OPpDEREF)) {
5423 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5424 o->op_next = o->op_next->op_next;
5425 o->op_type = OP_GVSV;
5426 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5429 else if (o->op_next->op_type == OP_RV2AV) {
5430 OP* pop = o->op_next->op_next;
5432 if (pop->op_type == OP_CONST &&
5433 (PL_op = pop->op_next) &&
5434 pop->op_next->op_type == OP_AELEM &&
5435 !(pop->op_next->op_private &
5436 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5437 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5441 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5445 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5446 o->op_next = pop->op_next->op_next;
5447 o->op_type = OP_AELEMFAST;
5448 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5449 o->op_private = (U8)i;
5450 GvAVn(((GVOP*)o)->op_gv);
5453 o->op_seq = PL_op_seqmax++;
5460 o->op_seq = PL_op_seqmax++;
5461 while (cLOGOP->op_other->op_type == OP_NULL)
5462 cLOGOP->op_other = cLOGOP->op_other->op_next;
5463 peep(cLOGOP->op_other);
5467 o->op_seq = PL_op_seqmax++;
5468 peep(cCONDOP->op_true);
5469 peep(cCONDOP->op_false);
5473 o->op_seq = PL_op_seqmax++;
5474 peep(cLOOP->op_redoop);
5475 peep(cLOOP->op_nextop);
5476 peep(cLOOP->op_lastop);
5482 o->op_seq = PL_op_seqmax++;
5483 peep(cPMOP->op_pmreplstart);
5487 o->op_seq = PL_op_seqmax++;
5488 if (ckWARN(WARN_SYNTAX) && o->op_next
5489 && o->op_next->op_type == OP_NEXTSTATE) {
5490 if (o->op_next->op_sibling &&
5491 o->op_next->op_sibling->op_type != OP_EXIT &&
5492 o->op_next->op_sibling->op_type != OP_WARN &&
5493 o->op_next->op_sibling->op_type != OP_DIE) {
5494 line_t oldline = PL_curcop->cop_line;
5496 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5497 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5498 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5499 PL_curcop->cop_line = oldline;
5513 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5514 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5516 rop = (UNOP*)((BINOP*)o)->op_first;
5517 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5519 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5520 if (!SvOBJECT(lexname))
5522 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5523 if (!fields || !GvHV(*fields))
5525 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5526 key = SvPV(*svp, keylen);
5527 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5529 croak("No such field \"%s\" in variable %s of type %s",
5530 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5532 ind = SvIV(*indsvp);
5534 croak("Bad index while coercing array into hash");
5535 rop->op_type = OP_RV2AV;
5536 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5537 o->op_type = OP_AELEM;
5538 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5540 *svp = newSViv(ind);
5545 o->op_seq = PL_op_seqmax++;