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));
60 SV* tmpsv = sv_newmortal();
61 gv_efullname3(tmpsv, gv, Nullch);
62 return SvPV(tmpsv,n_a);
68 yyerror(form("Missing comma after first argument to %s function",
69 PL_op_desc[o->op_type]));
74 too_few_arguments(OP *o, char *name)
76 yyerror(form("Not enough arguments for %s", name));
81 too_many_arguments(OP *o, char *name)
83 yyerror(form("Too many arguments for %s", name));
88 bad_type(I32 n, char *t, char *name, OP *kid)
90 yyerror(form("Type of arg %d to %s must be %s (not %s)",
91 (int)n, name, t, PL_op_desc[kid->op_type]));
97 int type = o->op_type;
98 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
99 yyerror(form("Can't use subscript on %s", PL_op_desc[type]));
100 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
102 SV *msg = sv_2mortal(
103 newSVpvf("(Did you mean $ or @ instead of %c?)\n",
104 type == OP_ENTERSUB ? '&' : '%'));
108 sv_catsv(GvSV(PL_errgv), msg);
110 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
115 /* "register" allocation */
118 pad_allocmy(char *name)
126 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
127 name[1] == '_' && (int)strlen(name) > 2))
129 if (!isPRINT(name[1])) {
131 name[2] = toCTRL(name[1]);
134 croak("Can't use global %s in \"my\"",name);
136 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
137 SV **svp = AvARRAY(PL_comppad_name);
138 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
140 && sv != &PL_sv_undef
141 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
142 && strEQ(name, SvPVX(sv)))
145 "\"my\" variable %s masks earlier declaration in same %s",
146 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
151 off = pad_alloc(OP_PADSV, SVs_PADMY);
153 sv_upgrade(sv, SVt_PVNV);
155 if (PL_in_my_stash) {
157 croak("Can't declare class for non-scalar %s in \"my\"",name);
159 (void)SvUPGRADE(sv, SVt_PVMG);
160 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
163 av_store(PL_comppad_name, off, sv);
164 SvNVX(sv) = (double)PAD_MAX;
165 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
166 if (!PL_min_intro_pending)
167 PL_min_intro_pending = off;
168 PL_max_intro_pending = off;
170 av_store(PL_comppad, off, (SV*)newAV());
171 else if (*name == '%')
172 av_store(PL_comppad, off, (SV*)newHV());
173 SvPADMY_on(PL_curpad[off]);
178 pad_findlex(char *name, PADOFFSET newoff, U32 seq, CV* startcv, I32 cx_ix, I32 saweval)
185 register PERL_CONTEXT *cx;
187 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
188 AV *curlist = CvPADLIST(cv);
189 SV **svp = av_fetch(curlist, 0, FALSE);
192 if (!svp || *svp == &PL_sv_undef)
195 svp = AvARRAY(curname);
196 for (off = AvFILLp(curname); off > 0; off--) {
197 if ((sv = svp[off]) &&
198 sv != &PL_sv_undef &&
200 seq > I_32(SvNVX(sv)) &&
201 strEQ(SvPVX(sv), name))
212 return 0; /* don't clone from inactive stack frame */
216 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
217 oldsv = *av_fetch(oldpad, off, TRUE);
218 if (!newoff) { /* Not a mere clone operation. */
219 SV *namesv = NEWSV(1103,0);
220 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
221 sv_upgrade(namesv, SVt_PVNV);
222 sv_setpv(namesv, name);
223 av_store(PL_comppad_name, newoff, namesv);
224 SvNVX(namesv) = (double)PL_curcop->cop_seq;
225 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
226 SvFAKE_on(namesv); /* A ref, not a real var */
227 if (SvOBJECT(sv)) { /* A typed var */
229 (void)SvUPGRADE(namesv, SVt_PVMG);
230 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
233 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
234 /* "It's closures all the way down." */
235 CvCLONE_on(PL_compcv);
237 if (CvANON(PL_compcv))
238 oldsv = Nullsv; /* no need to keep ref */
243 bcv && bcv != cv && !CvCLONE(bcv);
244 bcv = CvOUTSIDE(bcv))
249 if (ckWARN(WARN_CLOSURE)
250 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
253 "Variable \"%s\" may be unavailable",
261 else if (!CvUNIQUE(PL_compcv)) {
262 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
264 "Variable \"%s\" will not stay shared", name);
267 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
273 /* Nothing in current lexical context--try eval's context, if any.
274 * This is necessary to let the perldb get at lexically scoped variables.
275 * XXX This will also probably interact badly with eval tree caching.
278 for (i = cx_ix; i >= 0; i--) {
280 switch (CxTYPE(cx)) {
282 if (i == 0 && saweval) {
283 seq = cxstack[saweval].blk_oldcop->cop_seq;
284 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval);
288 switch (cx->blk_eval.old_op_type) {
294 /* require must have its own scope */
302 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
303 saweval = i; /* so we know where we were called from */
306 seq = cxstack[saweval].blk_oldcop->cop_seq;
307 return pad_findlex(name, newoff, seq, cv, i-1, saweval);
315 pad_findmy(char *name)
321 SV **svp = AvARRAY(PL_comppad_name);
322 U32 seq = PL_cop_seqmax;
328 * Special case to get lexical (and hence per-thread) @_.
329 * XXX I need to find out how to tell at parse-time whether use
330 * of @_ should refer to a lexical (from a sub) or defgv (global
331 * scope and maybe weird sub-ish things like formats). See
332 * startsub in perly.y. It's possible that @_ could be lexical
333 * (at least from subs) even in non-threaded perl.
335 if (strEQ(name, "@_"))
336 return 0; /* success. (NOT_IN_PAD indicates failure) */
337 #endif /* USE_THREADS */
339 /* The one we're looking for is probably just before comppad_name_fill. */
340 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
341 if ((sv = svp[off]) &&
342 sv != &PL_sv_undef &&
345 seq > I_32(SvNVX(sv)))) &&
346 strEQ(SvPVX(sv), name))
349 return (PADOFFSET)off;
350 pendoff = off; /* this pending def. will override import */
354 outside = CvOUTSIDE(PL_compcv);
356 /* Check if if we're compiling an eval'', and adjust seq to be the
357 * eval's seq number. This depends on eval'' having a non-null
358 * CvOUTSIDE() while it is being compiled. The eval'' itself is
359 * identified by CvUNIQUE being set and CvGV being null. */
360 if (outside && CvUNIQUE(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
361 cx = &cxstack[cxstack_ix];
363 seq = cx->blk_oldcop->cop_seq;
366 /* See if it's in a nested scope */
367 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0);
369 /* If there is a pending local definition, this new alias must die */
371 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
372 return off; /* pad_findlex returns 0 for failure...*/
374 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
378 pad_leavemy(I32 fill)
381 SV **svp = AvARRAY(PL_comppad_name);
383 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
384 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
385 if ((sv = svp[off]) && sv != &PL_sv_undef)
386 warn("%s never introduced", SvPVX(sv));
389 /* "Deintroduce" my variables that are leaving with this scope. */
390 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
391 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
392 SvIVX(sv) = PL_cop_seqmax;
397 pad_alloc(I32 optype, U32 tmptype)
403 if (AvARRAY(PL_comppad) != PL_curpad)
404 croak("panic: pad_alloc");
405 if (PL_pad_reset_pending)
407 if (tmptype & SVs_PADMY) {
409 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
410 } while (SvPADBUSY(sv)); /* need a fresh one */
411 retval = AvFILLp(PL_comppad);
414 SV **names = AvARRAY(PL_comppad_name);
415 SSize_t names_fill = AvFILLp(PL_comppad_name);
418 * "foreach" index vars temporarily become aliases to non-"my"
419 * values. Thus we must skip, not just pad values that are
420 * marked as current pad values, but also those with names.
422 if (++PL_padix <= names_fill &&
423 (sv = names[PL_padix]) && sv != &PL_sv_undef)
425 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
426 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
431 SvFLAGS(sv) |= tmptype;
432 PL_curpad = AvARRAY(PL_comppad);
434 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
435 (unsigned long) thr, (unsigned long) PL_curpad,
436 (long) retval, PL_op_name[optype]));
438 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
439 (unsigned long) PL_curpad,
440 (long) retval, PL_op_name[optype]));
441 #endif /* USE_THREADS */
442 return (PADOFFSET)retval;
450 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
451 (unsigned long) thr, (unsigned long) PL_curpad, po));
454 croak("panic: pad_sv po");
455 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
456 (unsigned long) PL_curpad, po));
457 #endif /* USE_THREADS */
458 return PL_curpad[po]; /* eventually we'll turn this into a macro */
462 pad_free(PADOFFSET po)
467 if (AvARRAY(PL_comppad) != PL_curpad)
468 croak("panic: pad_free curpad");
470 croak("panic: pad_free po");
472 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
473 (unsigned long) thr, (unsigned long) PL_curpad, po));
475 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
476 (unsigned long) PL_curpad, po));
477 #endif /* USE_THREADS */
478 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
479 SvPADTMP_off(PL_curpad[po]);
480 if ((I32)po < PL_padix)
485 pad_swipe(PADOFFSET po)
488 if (AvARRAY(PL_comppad) != PL_curpad)
489 croak("panic: pad_swipe curpad");
491 croak("panic: pad_swipe po");
493 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
494 (unsigned long) thr, (unsigned long) PL_curpad, po));
496 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
497 (unsigned long) PL_curpad, po));
498 #endif /* USE_THREADS */
499 SvPADTMP_off(PL_curpad[po]);
500 PL_curpad[po] = NEWSV(1107,0);
501 SvPADTMP_on(PL_curpad[po]);
502 if ((I32)po < PL_padix)
506 /* XXX pad_reset() is currently disabled because it results in serious bugs.
507 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
508 * on the stack by OPs that use them, there are several ways to get an alias
509 * to a shared TARG. Such an alias will change randomly and unpredictably.
510 * We avoid doing this until we can think of a Better Way.
515 #ifdef USE_BROKEN_PAD_RESET
519 if (AvARRAY(PL_comppad) != PL_curpad)
520 croak("panic: pad_reset curpad");
522 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
523 (unsigned long) thr, (unsigned long) PL_curpad));
525 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
526 (unsigned long) PL_curpad));
527 #endif /* USE_THREADS */
528 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
529 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
530 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
531 SvPADTMP_off(PL_curpad[po]);
533 PL_padix = PL_padix_floor;
536 PL_pad_reset_pending = FALSE;
540 /* find_threadsv is not reentrant */
542 find_threadsv(char *name)
548 /* We currently only handle names of a single character */
549 p = strchr(PL_threadsv_names, *name);
552 key = p - PL_threadsv_names;
553 MUTEX_LOCK(&thr->mutex);
554 svp = av_fetch(thr->threadsv, key, FALSE);
556 MUTEX_UNLOCK(&thr->mutex);
558 SV *sv = NEWSV(0, 0);
559 av_store(thr->threadsv, key, sv);
560 thr->threadsvp = AvARRAY(thr->threadsv);
561 MUTEX_UNLOCK(&thr->mutex);
563 * Some magic variables used to be automagically initialised
564 * in gv_fetchpv. Those which are now per-thread magicals get
565 * initialised here instead.
571 sv_setpv(sv, "\034");
572 sv_magic(sv, 0, 0, name, 1);
577 PL_sawampersand = TRUE;
591 /* XXX %! tied to Errno.pm needs to be added here.
592 * See gv_fetchpv(). */
596 sv_magic(sv, 0, 0, name, 1);
598 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
599 "find_threadsv: new SV %p for $%s%c\n",
600 sv, (*name < 32) ? "^" : "",
601 (*name < 32) ? toCTRL(*name) : *name));
605 #endif /* USE_THREADS */
612 register OP *kid, *nextkid;
614 if (!o || o->op_seq == (U16)-1)
617 if (o->op_flags & OPf_KIDS) {
618 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
619 nextkid = kid->op_sibling; /* Get before next freeing kid */
624 switch (o->op_type) {
626 o->op_targ = 0; /* Was holding old type, if any. */
629 o->op_targ = 0; /* Was holding hints. */
633 if (!(o->op_flags & OPf_SPECIAL))
637 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
639 #endif /* USE_THREADS */
641 if (!(o->op_flags & OPf_REF)
642 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(ck_ftst)))
648 SvREFCNT_dec(cGVOPo->op_gv);
652 Safefree(cCOPo->cop_label);
653 SvREFCNT_dec(cCOPo->cop_filegv);
654 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
655 SvREFCNT_dec(cCOPo->cop_warnings);
658 SvREFCNT_dec(cSVOPo->op_sv);
664 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
668 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
669 SvREFCNT_dec(cSVOPo->op_sv);
671 Safefree(cPVOPo->op_pv);
674 op_free(cPMOPo->op_pmreplroot);
679 ReREFCNT_dec(cPMOPo->op_pmregexp);
684 pad_free(o->op_targ);
692 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
693 pad_free(o->op_targ);
694 o->op_targ = o->op_type;
695 o->op_type = OP_NULL;
696 o->op_ppaddr = PL_ppaddr[OP_NULL];
699 /* Contextualizers */
701 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
711 /* establish postfix order */
712 if (cUNOPo->op_first) {
713 o->op_next = LINKLIST(cUNOPo->op_first);
714 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
716 kid->op_next = LINKLIST(kid->op_sibling);
731 if (o && o->op_flags & OPf_KIDS) {
732 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
741 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
743 if (ckWARN(WARN_SYNTAX)) {
744 line_t oldline = PL_curcop->cop_line;
746 if (PL_copline != NOLINE)
747 PL_curcop->cop_line = PL_copline;
748 warner(WARN_SYNTAX, "Found = in conditional, should be ==");
749 PL_curcop->cop_line = oldline;
760 /* assumes no premature commitment */
761 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
762 || o->op_type == OP_RETURN)
765 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
767 switch (o->op_type) {
769 if (o->op_private & OPpREPEAT_DOLIST)
770 null(((LISTOP*)cBINOPo->op_first)->op_first);
771 scalar(cBINOPo->op_first);
776 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
780 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
781 if (!kPMOP->op_pmreplroot)
782 deprecate("implicit split to @_");
790 if (o->op_flags & OPf_KIDS) {
791 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
797 kid = cLISTOPo->op_first;
799 while (kid = kid->op_sibling) {
805 WITH_THR(PL_curcop = &PL_compiling);
810 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
816 WITH_THR(PL_curcop = &PL_compiling);
829 /* assumes no premature commitment */
830 U8 want = o->op_flags & OPf_WANT;
831 if (!o || (want && want != OPf_WANT_SCALAR) || PL_error_count
832 || o->op_type == OP_RETURN)
835 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
837 switch (o->op_type) {
839 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
843 if (o->op_flags & OPf_STACKED)
847 if (o->op_private == 4)
918 if (!(o->op_private & OPpLVAL_INTRO))
919 useless = PL_op_desc[o->op_type];
926 if (!(o->op_private & OPpLVAL_INTRO) &&
927 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
928 useless = "a variable";
933 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
940 if (ckWARN(WARN_VOID)) {
941 useless = "a constant";
942 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
944 else if (SvPOK(sv)) {
945 if (strnEQ(SvPVX(sv), "di", 2) ||
946 strnEQ(SvPVX(sv), "ds", 2) ||
947 strnEQ(SvPVX(sv), "ig", 2))
952 null(o); /* don't execute a constant */
953 SvREFCNT_dec(sv); /* don't even remember it */
957 o->op_type = OP_PREINC; /* pre-increment is faster */
958 o->op_ppaddr = PL_ppaddr[OP_PREINC];
962 o->op_type = OP_PREDEC; /* pre-decrement is faster */
963 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
969 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
974 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
975 WITH_THR(PL_curcop = ((COP*)o)); /* for warning below */
976 if (o->op_flags & OPf_STACKED)
982 if (!(o->op_flags & OPf_KIDS))
991 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
998 /* all requires must return a boolean value */
999 o->op_flags &= ~OPf_WANT;
1002 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1003 if (!kPMOP->op_pmreplroot)
1004 deprecate("implicit split to @_");
1010 if (ckWARN(WARN_VOID))
1011 warner(WARN_VOID, "Useless use of %s in void context", useless);
1020 if (o && o->op_flags & OPf_KIDS) {
1021 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1032 /* assumes no premature commitment */
1033 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1034 || o->op_type == OP_RETURN)
1037 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1039 switch (o->op_type) {
1042 list(cBINOPo->op_first);
1047 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1055 if (!(o->op_flags & OPf_KIDS))
1057 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1058 list(cBINOPo->op_first);
1059 return gen_constant_list(o);
1066 kid = cLISTOPo->op_first;
1068 while (kid = kid->op_sibling) {
1069 if (kid->op_sibling)
1074 WITH_THR(PL_curcop = &PL_compiling);
1078 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1079 if (kid->op_sibling)
1084 WITH_THR(PL_curcop = &PL_compiling);
1087 /* all requires must return a boolean value */
1088 o->op_flags &= ~OPf_WANT;
1100 if (o->op_type == OP_LINESEQ ||
1101 o->op_type == OP_SCOPE ||
1102 o->op_type == OP_LEAVE ||
1103 o->op_type == OP_LEAVETRY)
1106 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1107 if (kid->op_sibling) {
1111 PL_curcop = &PL_compiling;
1113 o->op_flags &= ~OPf_PARENS;
1114 if (PL_hints & HINT_BLOCK_SCOPE)
1115 o->op_flags |= OPf_PARENS;
1118 o = newOP(OP_STUB, 0);
1123 modkids(OP *o, I32 type)
1126 if (o && o->op_flags & OPf_KIDS) {
1127 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1134 mod(OP *o, I32 type)
1141 if (!o || PL_error_count)
1144 switch (o->op_type) {
1149 if (!(o->op_private & (OPpCONST_ARYBASE)))
1151 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1152 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1156 SAVEI32(PL_compiling.cop_arybase);
1157 PL_compiling.cop_arybase = 0;
1159 else if (type == OP_REFGEN)
1162 croak("That use of $[ is unsupported");
1165 if (o->op_flags & OPf_PARENS)
1169 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1170 !(o->op_flags & OPf_STACKED)) {
1171 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1172 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1173 assert(cUNOPo->op_first->op_type == OP_NULL);
1174 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1180 /* grep, foreach, subcalls, refgen */
1181 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1183 yyerror(form("Can't modify %s in %s",
1184 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1185 ? "do block" : PL_op_desc[o->op_type]),
1186 type ? PL_op_desc[type] : "local"));
1200 case OP_RIGHT_SHIFT:
1209 if (!(o->op_flags & OPf_STACKED))
1215 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1221 if (!type && cUNOPo->op_first->op_type != OP_GV)
1222 croak("Can't localize through a reference");
1223 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1224 PL_modcount = 10000;
1225 return o; /* Treat \(@foo) like ordinary list. */
1229 if (scalar_mod_type(o, type))
1231 ref(cUNOPo->op_first, o->op_type);
1240 PL_modcount = 10000;
1243 if (!type && cUNOPo->op_first->op_type != OP_GV)
1244 croak("Can't localize through a reference");
1245 ref(cUNOPo->op_first, o->op_type);
1249 PL_hints |= HINT_BLOCK_SCOPE;
1257 PL_modcount = 10000;
1258 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1259 return o; /* Treat \(@foo) like ordinary list. */
1260 if (scalar_mod_type(o, type))
1266 croak("Can't localize lexical variable %s",
1267 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1272 PL_modcount++; /* XXX ??? */
1274 #endif /* USE_THREADS */
1280 if (type != OP_SASSIGN)
1284 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1290 pad_free(o->op_targ);
1291 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1292 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1293 if (o->op_flags & OPf_KIDS)
1294 mod(cBINOPo->op_first->op_sibling, type);
1299 ref(cBINOPo->op_first, o->op_type);
1300 if (type == OP_ENTERSUB &&
1301 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1302 o->op_private |= OPpLVAL_DEFER;
1309 if (o->op_flags & OPf_KIDS)
1310 mod(cLISTOPo->op_last, type);
1314 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1316 else if (!(o->op_flags & OPf_KIDS))
1318 if (o->op_targ != OP_LIST) {
1319 mod(cBINOPo->op_first, type);
1324 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1328 o->op_flags |= OPf_MOD;
1330 if (type == OP_AASSIGN || type == OP_SASSIGN)
1331 o->op_flags |= OPf_SPECIAL|OPf_REF;
1333 o->op_private |= OPpLVAL_INTRO;
1334 o->op_flags &= ~OPf_SPECIAL;
1335 PL_hints |= HINT_BLOCK_SCOPE;
1337 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1338 o->op_flags |= OPf_REF;
1343 scalar_mod_type(OP *o, I32 type)
1347 if (o->op_type == OP_RV2GV)
1371 case OP_RIGHT_SHIFT:
1381 case OP_ANDASSIGN: /* may work later */
1382 case OP_ORASSIGN: /* may work later */
1390 refkids(OP *o, I32 type)
1393 if (o && o->op_flags & OPf_KIDS) {
1394 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1401 ref(OP *o, I32 type)
1405 if (!o || PL_error_count)
1408 switch (o->op_type) {
1410 if ((type == OP_DEFINED || type == OP_LOCK) &&
1411 !(o->op_flags & OPf_STACKED)) {
1412 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1413 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1414 assert(cUNOPo->op_first->op_type == OP_NULL);
1415 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1416 o->op_flags |= OPf_SPECIAL;
1421 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1425 ref(cUNOPo->op_first, o->op_type);
1428 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1429 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1430 : type == OP_RV2HV ? OPpDEREF_HV
1432 o->op_flags |= OPf_MOD;
1437 o->op_flags |= OPf_MOD; /* XXX ??? */
1442 o->op_flags |= OPf_REF;
1445 ref(cUNOPo->op_first, o->op_type);
1450 o->op_flags |= OPf_REF;
1455 if (!(o->op_flags & OPf_KIDS))
1457 ref(cBINOPo->op_first, type);
1461 ref(cBINOPo->op_first, o->op_type);
1462 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1463 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1464 : type == OP_RV2HV ? OPpDEREF_HV
1466 o->op_flags |= OPf_MOD;
1474 if (!(o->op_flags & OPf_KIDS))
1476 ref(cLISTOPo->op_last, type);
1491 if (!o || PL_error_count)
1495 if (type == OP_LIST) {
1496 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1498 } else if (type == OP_UNDEF) {
1500 } else if (type != OP_PADSV &&
1503 type != OP_PUSHMARK)
1505 yyerror(form("Can't declare %s in my", PL_op_desc[o->op_type]));
1508 o->op_flags |= OPf_MOD;
1509 o->op_private |= OPpLVAL_INTRO;
1517 o->op_flags |= OPf_PARENS;
1522 bind_match(I32 type, OP *left, OP *right)
1527 if (ckWARN(WARN_UNSAFE) &&
1528 (left->op_type == OP_RV2AV ||
1529 left->op_type == OP_RV2HV ||
1530 left->op_type == OP_PADAV ||
1531 left->op_type == OP_PADHV)) {
1532 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1533 right->op_type == OP_TRANS)
1534 ? right->op_type : OP_MATCH];
1535 char *sample = ((left->op_type == OP_RV2AV ||
1536 left->op_type == OP_PADAV)
1537 ? "@array" : "%hash");
1539 "Applying %s to %s will act on scalar(%s)",
1540 desc, sample, sample);
1543 if (right->op_type == OP_MATCH ||
1544 right->op_type == OP_SUBST ||
1545 right->op_type == OP_TRANS) {
1546 right->op_flags |= OPf_STACKED;
1547 if (right->op_type != OP_MATCH)
1548 left = mod(left, right->op_type);
1549 if (right->op_type == OP_TRANS)
1550 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1552 o = prepend_elem(right->op_type, scalar(left), right);
1554 return newUNOP(OP_NOT, 0, scalar(o));
1558 return bind_match(type, left,
1559 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1567 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1568 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1575 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1576 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1577 o->op_type = OP_LEAVE;
1578 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1581 if (o->op_type == OP_LINESEQ) {
1583 o->op_type = OP_SCOPE;
1584 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1585 kid = ((LISTOP*)o)->op_first;
1586 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1587 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1592 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1602 SAVESPTR(GvHV(PL_hintgv));
1603 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1604 SAVEFREESV(GvHV(PL_hintgv));
1608 block_start(int full)
1611 int retval = PL_savestack_ix;
1613 SAVEI32(PL_comppad_name_floor);
1615 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1616 PL_comppad_name_floor = PL_comppad_name_fill;
1618 PL_comppad_name_floor = 0;
1620 SAVEI32(PL_min_intro_pending);
1621 SAVEI32(PL_max_intro_pending);
1622 PL_min_intro_pending = 0;
1623 SAVEI32(PL_comppad_name_fill);
1624 SAVEI32(PL_padix_floor);
1625 PL_padix_floor = PL_padix;
1626 PL_pad_reset_pending = FALSE;
1628 PL_hints &= ~HINT_BLOCK_SCOPE;
1629 SAVEPPTR(PL_compiling.cop_warnings);
1630 if (PL_compiling.cop_warnings != WARN_ALL &&
1631 PL_compiling.cop_warnings != WARN_NONE) {
1632 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1633 SAVEFREESV(PL_compiling.cop_warnings) ;
1641 block_end(I32 floor, OP *seq)
1644 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1645 OP* retval = scalarseq(seq);
1647 PL_pad_reset_pending = FALSE;
1648 PL_compiling.op_private = PL_hints;
1650 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1651 pad_leavemy(PL_comppad_name_fill);
1660 OP *o = newOP(OP_THREADSV, 0);
1661 o->op_targ = find_threadsv("_");
1664 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1665 #endif /* USE_THREADS */
1673 PL_eval_root = newUNOP(OP_LEAVEEVAL, ((PL_in_eval & 4) ? OPf_SPECIAL : 0), o);
1674 PL_eval_start = linklist(PL_eval_root);
1675 PL_eval_root->op_next = 0;
1676 peep(PL_eval_start);
1681 PL_main_root = scope(sawparens(scalarvoid(o)));
1682 PL_curcop = &PL_compiling;
1683 PL_main_start = LINKLIST(PL_main_root);
1684 PL_main_root->op_next = 0;
1685 peep(PL_main_start);
1688 /* Register with debugger */
1690 CV *cv = perl_get_cv("DB::postponed", FALSE);
1694 XPUSHs((SV*)PL_compiling.cop_filegv);
1696 perl_call_sv((SV*)cv, G_DISCARD);
1703 localize(OP *o, I32 lex)
1705 if (o->op_flags & OPf_PARENS)
1709 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1711 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1712 if (*s == ';' || *s == '=')
1713 warner(WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1714 lex ? "my" : "local");
1718 PL_in_my_stash = Nullhv;
1722 return mod(o, OP_NULL); /* a bit kludgey */
1728 if (o->op_type == OP_LIST) {
1731 o2 = newOP(OP_THREADSV, 0);
1732 o2->op_targ = find_threadsv(";");
1734 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1735 #endif /* USE_THREADS */
1736 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1742 fold_constants(register OP *o)
1746 I32 type = o->op_type;
1749 if (PL_opargs[type] & OA_RETSCALAR)
1751 if (PL_opargs[type] & OA_TARGET)
1752 o->op_targ = pad_alloc(type, SVs_PADTMP);
1754 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
1755 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1757 if (!(PL_opargs[type] & OA_FOLDCONST))
1772 if (o->op_private & OPpLOCALE)
1777 goto nope; /* Don't try to run w/ errors */
1779 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1780 if (curop->op_type != OP_CONST &&
1781 curop->op_type != OP_LIST &&
1782 curop->op_type != OP_SCALAR &&
1783 curop->op_type != OP_NULL &&
1784 curop->op_type != OP_PUSHMARK) {
1789 curop = LINKLIST(o);
1793 sv = *(PL_stack_sp--);
1794 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1795 pad_swipe(o->op_targ);
1796 else if (SvTEMP(sv)) { /* grab mortal temp? */
1797 (void)SvREFCNT_inc(sv);
1801 if (type == OP_RV2GV)
1802 return newGVOP(OP_GV, 0, (GV*)sv);
1804 /* try to smush double to int, but don't smush -2.0 to -2 */
1805 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1809 if ((double)iv == SvNV(sv)) {
1814 SvIOK_off(sv); /* undo SvIV() damage */
1816 return newSVOP(OP_CONST, 0, sv);
1820 if (!(PL_opargs[type] & OA_OTHERINT))
1823 if (!(PL_hints & HINT_INTEGER)) {
1824 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1827 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1828 if (curop->op_type == OP_CONST) {
1829 if (SvIOK(((SVOP*)curop)->op_sv))
1833 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1837 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1844 gen_constant_list(register OP *o)
1848 I32 oldtmps_floor = PL_tmps_floor;
1852 return o; /* Don't attempt to run with errors */
1854 PL_op = curop = LINKLIST(o);
1860 PL_tmps_floor = oldtmps_floor;
1862 o->op_type = OP_RV2AV;
1863 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1864 curop = ((UNOP*)o)->op_first;
1865 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1872 convert(I32 type, I32 flags, OP *o)
1877 if (!o || o->op_type != OP_LIST)
1878 o = newLISTOP(OP_LIST, 0, o, Nullop);
1880 o->op_flags &= ~OPf_WANT;
1882 if (!(PL_opargs[type] & OA_MARK))
1883 null(cLISTOPo->op_first);
1886 o->op_ppaddr = PL_ppaddr[type];
1887 o->op_flags |= flags;
1889 o = CHECKOP(type, o);
1890 if (o->op_type != type)
1893 if (cLISTOPo->op_children < 7) {
1894 /* XXX do we really need to do this if we're done appending?? */
1895 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1897 cLISTOPo->op_last = last; /* in case check substituted last arg */
1900 return fold_constants(o);
1903 /* List constructors */
1906 append_elem(I32 type, OP *first, OP *last)
1914 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
1915 return newLISTOP(type, 0, first, last);
1917 if (first->op_flags & OPf_KIDS)
1918 ((LISTOP*)first)->op_last->op_sibling = last;
1920 first->op_flags |= OPf_KIDS;
1921 ((LISTOP*)first)->op_first = last;
1923 ((LISTOP*)first)->op_last = last;
1924 ((LISTOP*)first)->op_children++;
1929 append_list(I32 type, LISTOP *first, LISTOP *last)
1937 if (first->op_type != type)
1938 return prepend_elem(type, (OP*)first, (OP*)last);
1940 if (last->op_type != type)
1941 return append_elem(type, (OP*)first, (OP*)last);
1943 first->op_last->op_sibling = last->op_first;
1944 first->op_last = last->op_last;
1945 first->op_children += last->op_children;
1946 if (first->op_children)
1947 first->op_flags |= OPf_KIDS;
1954 prepend_elem(I32 type, OP *first, OP *last)
1962 if (last->op_type == type) {
1963 if (type == OP_LIST) { /* already a PUSHMARK there */
1964 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
1965 ((LISTOP*)last)->op_first->op_sibling = first;
1968 if (!(last->op_flags & OPf_KIDS)) {
1969 ((LISTOP*)last)->op_last = first;
1970 last->op_flags |= OPf_KIDS;
1972 first->op_sibling = ((LISTOP*)last)->op_first;
1973 ((LISTOP*)last)->op_first = first;
1975 ((LISTOP*)last)->op_children++;
1979 return newLISTOP(type, 0, first, last);
1987 return newOP(OP_STUB, 0);
1993 if (!o || o->op_type != OP_LIST)
1994 o = newLISTOP(OP_LIST, 0, o, Nullop);
2000 newLISTOP(I32 type, I32 flags, OP *first, OP *last)
2004 Newz(1101, listop, 1, LISTOP);
2006 listop->op_type = type;
2007 listop->op_ppaddr = PL_ppaddr[type];
2008 listop->op_children = (first != 0) + (last != 0);
2009 listop->op_flags = flags;
2013 else if (!first && last)
2016 first->op_sibling = last;
2017 listop->op_first = first;
2018 listop->op_last = last;
2019 if (type == OP_LIST) {
2021 pushop = newOP(OP_PUSHMARK, 0);
2022 pushop->op_sibling = first;
2023 listop->op_first = pushop;
2024 listop->op_flags |= OPf_KIDS;
2026 listop->op_last = pushop;
2028 else if (listop->op_children)
2029 listop->op_flags |= OPf_KIDS;
2035 newOP(I32 type, I32 flags)
2038 Newz(1101, o, 1, OP);
2040 o->op_ppaddr = PL_ppaddr[type];
2041 o->op_flags = flags;
2044 o->op_private = 0 + (flags >> 8);
2045 if (PL_opargs[type] & OA_RETSCALAR)
2047 if (PL_opargs[type] & OA_TARGET)
2048 o->op_targ = pad_alloc(type, SVs_PADTMP);
2049 return CHECKOP(type, o);
2053 newUNOP(I32 type, I32 flags, OP *first)
2058 first = newOP(OP_STUB, 0);
2059 if (PL_opargs[type] & OA_MARK)
2060 first = force_list(first);
2062 Newz(1101, unop, 1, UNOP);
2063 unop->op_type = type;
2064 unop->op_ppaddr = PL_ppaddr[type];
2065 unop->op_first = first;
2066 unop->op_flags = flags | OPf_KIDS;
2067 unop->op_private = 1 | (flags >> 8);
2068 unop = (UNOP*) CHECKOP(type, unop);
2072 return fold_constants((OP *) unop);
2076 newBINOP(I32 type, I32 flags, OP *first, OP *last)
2079 Newz(1101, binop, 1, BINOP);
2082 first = newOP(OP_NULL, 0);
2084 binop->op_type = type;
2085 binop->op_ppaddr = PL_ppaddr[type];
2086 binop->op_first = first;
2087 binop->op_flags = flags | OPf_KIDS;
2090 binop->op_private = 1 | (flags >> 8);
2093 binop->op_private = 2 | (flags >> 8);
2094 first->op_sibling = last;
2097 binop = (BINOP*)CHECKOP(type, binop);
2101 binop->op_last = binop->op_first->op_sibling;
2103 return fold_constants((OP *)binop);
2107 utf8compare(const void *a, const void *b)
2110 for (i = 0; i < 10; i++) {
2111 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2113 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2120 pmtrans(OP *o, OP *expr, OP *repl)
2122 SV *tstr = ((SVOP*)expr)->op_sv;
2123 SV *rstr = ((SVOP*)repl)->op_sv;
2126 register U8 *t = (U8*)SvPV(tstr, tlen);
2127 register U8 *r = (U8*)SvPV(rstr, rlen);
2133 register short *tbl;
2135 complement = o->op_private & OPpTRANS_COMPLEMENT;
2136 del = o->op_private & OPpTRANS_DELETE;
2137 squash = o->op_private & OPpTRANS_SQUASH;
2139 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2140 SV* listsv = newSVpv("# comment\n",0);
2142 U8* tend = t + tlen;
2143 U8* rend = r + rlen;
2159 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2160 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2166 New(1109, cp, tlen, U8*);
2168 transv = newSVpv("",0);
2177 qsort(cp, i, sizeof(U8*), utf8compare);
2178 for (j = 0; j < i; j++) {
2180 UV val = utf8_to_uv(s, &ulen);
2182 diff = val - nextmin;
2184 t = uv_to_utf8(tmpbuf,nextmin);
2185 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2187 t = uv_to_utf8(tmpbuf, val - 1);
2188 sv_catpvn(transv, "\377", 1);
2189 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2193 val = utf8_to_uv(s+1, &ulen);
2197 t = uv_to_utf8(tmpbuf,nextmin);
2198 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2199 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2200 sv_catpvn(transv, "\377", 1);
2201 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2202 t = (U8*)SvPVX(transv);
2203 tlen = SvCUR(transv);
2206 else if (!rlen && !del) {
2207 r = t; rlen = tlen; rend = tend;
2210 if (to_utf && from_utf) { /* only counting characters */
2211 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2212 o->op_private |= OPpTRANS_IDENTICAL;
2214 else { /* straight latin-1 translation */
2215 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2216 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2217 o->op_private |= OPpTRANS_IDENTICAL;
2221 while (t < tend || tfirst <= tlast) {
2222 /* see if we need more "t" chars */
2223 if (tfirst > tlast) {
2224 tfirst = (I32)utf8_to_uv(t, &ulen);
2226 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2227 tlast = (I32)utf8_to_uv(++t, &ulen);
2234 /* now see if we need more "r" chars */
2235 if (rfirst > rlast) {
2237 rfirst = (I32)utf8_to_uv(r, &ulen);
2239 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2240 rlast = (I32)utf8_to_uv(++r, &ulen);
2249 rfirst = rlast = 0xffffffff;
2253 /* now see which range will peter our first, if either. */
2254 tdiff = tlast - tfirst;
2255 rdiff = rlast - rfirst;
2262 if (rfirst == 0xffffffff) {
2263 diff = tdiff; /* oops, pretend rdiff is infinite */
2265 sv_catpvf(listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2267 sv_catpvf(listsv, "%04x\t\tXXXX\n", tfirst);
2271 sv_catpvf(listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2273 sv_catpvf(listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2275 if (rfirst + diff > max)
2276 max = rfirst + diff;
2281 else if (rfirst <= 0x800)
2282 grows |= (tfirst < 0x80);
2283 else if (rfirst <= 0x10000)
2284 grows |= (tfirst < 0x800);
2285 else if (rfirst <= 0x200000)
2286 grows |= (tfirst < 0x10000);
2287 else if (rfirst <= 0x4000000)
2288 grows |= (tfirst < 0x200000);
2289 else if (rfirst <= 0x80000000)
2290 grows |= (tfirst < 0x4000000);
2302 else if (max > 0xff)
2307 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2308 SvREFCNT_dec(listsv);
2310 SvREFCNT_dec(transv);
2312 if (!del && havefinal)
2313 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2315 if (grows && to_utf)
2316 o->op_private |= OPpTRANS_GROWS;
2323 tbl = (short*)cPVOPo->op_pv;
2325 Zero(tbl, 256, short);
2326 for (i = 0; i < tlen; i++)
2328 for (i = 0, j = 0; i < 256; i++) {
2344 if (!rlen && !del) {
2347 o->op_private |= OPpTRANS_IDENTICAL;
2349 for (i = 0; i < 256; i++)
2351 for (i = 0, j = 0; i < tlen; i++,j++) {
2354 if (tbl[t[i]] == -1)
2360 if (tbl[t[i]] == -1)
2371 newPMOP(I32 type, I32 flags)
2376 Newz(1101, pmop, 1, PMOP);
2377 pmop->op_type = type;
2378 pmop->op_ppaddr = PL_ppaddr[type];
2379 pmop->op_flags = flags;
2380 pmop->op_private = 0 | (flags >> 8);
2382 if (PL_hints & HINT_RE_TAINT)
2383 pmop->op_pmpermflags |= PMf_RETAINT;
2384 if (PL_hints & HINT_LOCALE)
2385 pmop->op_pmpermflags |= PMf_LOCALE;
2386 pmop->op_pmflags = pmop->op_pmpermflags;
2388 /* link into pm list */
2389 if (type != OP_TRANS && PL_curstash) {
2390 pmop->op_pmnext = HvPMROOT(PL_curstash);
2391 HvPMROOT(PL_curstash) = pmop;
2398 pmruntime(OP *o, OP *expr, OP *repl)
2403 I32 repl_has_vars = 0;
2405 if (o->op_type == OP_TRANS)
2406 return pmtrans(o, expr, repl);
2408 PL_hints |= HINT_BLOCK_SCOPE;
2411 if (expr->op_type == OP_CONST) {
2413 SV *pat = ((SVOP*)expr)->op_sv;
2414 char *p = SvPV(pat, plen);
2415 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2416 sv_setpvn(pat, "\\s+", 3);
2417 p = SvPV(pat, plen);
2418 pm->op_pmflags |= PMf_SKIPWHITE;
2420 pm->op_pmregexp = CALLREGCOMP(p, p + plen, pm);
2421 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2422 pm->op_pmflags |= PMf_WHITE;
2426 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2427 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2429 : OP_REGCMAYBE),0,expr);
2431 Newz(1101, rcop, 1, LOGOP);
2432 rcop->op_type = OP_REGCOMP;
2433 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2434 rcop->op_first = scalar(expr);
2435 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2436 ? (OPf_SPECIAL | OPf_KIDS)
2438 rcop->op_private = 1;
2441 /* establish postfix order */
2442 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2444 rcop->op_next = expr;
2445 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2448 rcop->op_next = LINKLIST(expr);
2449 expr->op_next = (OP*)rcop;
2452 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2457 if (pm->op_pmflags & PMf_EVAL)
2460 else if (repl->op_type == OP_THREADSV
2461 && strchr("&`'123456789+",
2462 PL_threadsv_names[repl->op_targ]))
2466 #endif /* USE_THREADS */
2467 else if (repl->op_type == OP_CONST)
2471 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2472 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2474 if (curop->op_type == OP_THREADSV) {
2476 if (strchr("&`'123456789+", curop->op_private))
2480 if (curop->op_type == OP_GV) {
2481 GV *gv = ((GVOP*)curop)->op_gv;
2483 if (strchr("&`'123456789+", *GvENAME(gv)))
2486 #endif /* USE_THREADS */
2487 else if (curop->op_type == OP_RV2CV)
2489 else if (curop->op_type == OP_RV2SV ||
2490 curop->op_type == OP_RV2AV ||
2491 curop->op_type == OP_RV2HV ||
2492 curop->op_type == OP_RV2GV) {
2493 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2496 else if (curop->op_type == OP_PADSV ||
2497 curop->op_type == OP_PADAV ||
2498 curop->op_type == OP_PADHV ||
2499 curop->op_type == OP_PADANY) {
2502 else if (curop->op_type == OP_PUSHRE)
2503 ; /* Okay here, dangerous in newASSIGNOP */
2512 && (!pm->op_pmregexp
2513 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2514 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2515 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2516 prepend_elem(o->op_type, scalar(repl), o);
2519 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2520 pm->op_pmflags |= PMf_MAYBE_CONST;
2521 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2523 Newz(1101, rcop, 1, LOGOP);
2524 rcop->op_type = OP_SUBSTCONT;
2525 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2526 rcop->op_first = scalar(repl);
2527 rcop->op_flags |= OPf_KIDS;
2528 rcop->op_private = 1;
2531 /* establish postfix order */
2532 rcop->op_next = LINKLIST(repl);
2533 repl->op_next = (OP*)rcop;
2535 pm->op_pmreplroot = scalar((OP*)rcop);
2536 pm->op_pmreplstart = LINKLIST(rcop);
2545 newSVOP(I32 type, I32 flags, SV *sv)
2548 Newz(1101, svop, 1, SVOP);
2549 svop->op_type = type;
2550 svop->op_ppaddr = PL_ppaddr[type];
2552 svop->op_next = (OP*)svop;
2553 svop->op_flags = flags;
2554 if (PL_opargs[type] & OA_RETSCALAR)
2556 if (PL_opargs[type] & OA_TARGET)
2557 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2558 return CHECKOP(type, svop);
2562 newGVOP(I32 type, I32 flags, GV *gv)
2566 Newz(1101, gvop, 1, GVOP);
2567 gvop->op_type = type;
2568 gvop->op_ppaddr = PL_ppaddr[type];
2569 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2570 gvop->op_next = (OP*)gvop;
2571 gvop->op_flags = flags;
2572 if (PL_opargs[type] & OA_RETSCALAR)
2574 if (PL_opargs[type] & OA_TARGET)
2575 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2576 return CHECKOP(type, gvop);
2580 newPVOP(I32 type, I32 flags, char *pv)
2583 Newz(1101, pvop, 1, PVOP);
2584 pvop->op_type = type;
2585 pvop->op_ppaddr = PL_ppaddr[type];
2587 pvop->op_next = (OP*)pvop;
2588 pvop->op_flags = flags;
2589 if (PL_opargs[type] & OA_RETSCALAR)
2591 if (PL_opargs[type] & OA_TARGET)
2592 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2593 return CHECKOP(type, pvop);
2602 save_hptr(&PL_curstash);
2603 save_item(PL_curstname);
2608 name = SvPV(sv, len);
2609 PL_curstash = gv_stashpvn(name,len,TRUE);
2610 sv_setpvn(PL_curstname, name, len);
2614 sv_setpv(PL_curstname,"<none>");
2615 PL_curstash = Nullhv;
2617 PL_hints |= HINT_BLOCK_SCOPE;
2618 PL_copline = NOLINE;
2623 utilize(int aver, I32 floor, OP *version, OP *id, OP *arg)
2632 if (id->op_type != OP_CONST)
2633 croak("Module name must be constant");
2637 if(version != Nullop) {
2638 SV *vesv = ((SVOP*)version)->op_sv;
2640 if (arg == Nullop && !SvNIOK(vesv)) {
2647 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2648 croak("Version number must be constant number");
2650 /* Make copy of id so we don't free it twice */
2651 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2653 /* Fake up a method call to VERSION */
2654 meth = newSVOP(OP_CONST, 0, newSVpv("VERSION", 7));
2655 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2656 append_elem(OP_LIST,
2657 prepend_elem(OP_LIST, pack, list(version)),
2658 newUNOP(OP_METHOD, 0, meth)));
2662 /* Fake up an import/unimport */
2663 if (arg && arg->op_type == OP_STUB)
2664 imop = arg; /* no import on explicit () */
2665 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2666 imop = Nullop; /* use 5.0; */
2669 /* Make copy of id so we don't free it twice */
2670 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2671 meth = newSVOP(OP_CONST, 0,
2673 ? newSVpv("import", 6)
2674 : newSVpv("unimport", 8)
2676 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2677 append_elem(OP_LIST,
2678 prepend_elem(OP_LIST, pack, list(arg)),
2679 newUNOP(OP_METHOD, 0, meth)));
2682 /* Fake up a require, handle override, if any */
2683 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2684 if (!(gv && GvIMPORTED_CV(gv)))
2685 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2687 if (gv && GvIMPORTED_CV(gv)) {
2688 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2689 append_elem(OP_LIST, id,
2690 scalar(newUNOP(OP_RV2CV, 0,
2695 rqop = newUNOP(OP_REQUIRE, 0, id);
2698 /* Fake up the BEGIN {}, which does its thing immediately. */
2700 newSVOP(OP_CONST, 0, newSVpv("BEGIN", 5)),
2702 append_elem(OP_LINESEQ,
2703 append_elem(OP_LINESEQ,
2704 newSTATEOP(0, Nullch, rqop),
2705 newSTATEOP(0, Nullch, veop)),
2706 newSTATEOP(0, Nullch, imop) ));
2708 PL_copline = NOLINE;
2718 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2719 if (!(gv && GvIMPORTED_CV(gv)))
2720 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2722 if (gv && GvIMPORTED_CV(gv)) {
2723 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2724 append_elem(OP_LIST, term,
2725 scalar(newUNOP(OP_RV2CV, 0,
2730 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2736 newSLICEOP(I32 flags, OP *subscript, OP *listval)
2738 return newBINOP(OP_LSLICE, flags,
2739 list(force_list(subscript)),
2740 list(force_list(listval)) );
2744 list_assignment(register OP *o)
2749 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2750 o = cUNOPo->op_first;
2752 if (o->op_type == OP_COND_EXPR) {
2753 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2754 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2759 yyerror("Assignment to both a list and a scalar");
2763 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2764 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2765 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2768 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2771 if (o->op_type == OP_RV2SV)
2778 newASSIGNOP(I32 flags, OP *left, I32 optype, OP *right)
2783 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2784 return newLOGOP(optype, 0,
2785 mod(scalar(left), optype),
2786 newUNOP(OP_SASSIGN, 0, scalar(right)));
2789 return newBINOP(optype, OPf_STACKED,
2790 mod(scalar(left), optype), scalar(right));
2794 if (list_assignment(left)) {
2797 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2798 left = mod(left, OP_AASSIGN);
2806 o = newBINOP(OP_AASSIGN, flags,
2807 list(force_list(right)),
2808 list(force_list(left)) );
2809 o->op_private = 0 | (flags >> 8);
2810 if (!(left->op_private & OPpLVAL_INTRO)) {
2814 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2815 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2816 if (curop->op_type == OP_GV) {
2817 GV *gv = ((GVOP*)curop)->op_gv;
2818 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2820 SvCUR(gv) = PL_generation;
2822 else if (curop->op_type == OP_PADSV ||
2823 curop->op_type == OP_PADAV ||
2824 curop->op_type == OP_PADHV ||
2825 curop->op_type == OP_PADANY) {
2826 SV **svp = AvARRAY(PL_comppad_name);
2827 SV *sv = svp[curop->op_targ];
2828 if (SvCUR(sv) == PL_generation)
2830 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2832 else if (curop->op_type == OP_RV2CV)
2834 else if (curop->op_type == OP_RV2SV ||
2835 curop->op_type == OP_RV2AV ||
2836 curop->op_type == OP_RV2HV ||
2837 curop->op_type == OP_RV2GV) {
2838 if (lastop->op_type != OP_GV) /* funny deref? */
2841 else if (curop->op_type == OP_PUSHRE) {
2842 if (((PMOP*)curop)->op_pmreplroot) {
2843 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2844 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2846 SvCUR(gv) = PL_generation;
2855 o->op_private = OPpASSIGN_COMMON;
2857 if (right && right->op_type == OP_SPLIT) {
2859 if ((tmpop = ((LISTOP*)right)->op_first) &&
2860 tmpop->op_type == OP_PUSHRE)
2862 PMOP *pm = (PMOP*)tmpop;
2863 if (left->op_type == OP_RV2AV &&
2864 !(left->op_private & OPpLVAL_INTRO) &&
2865 !(o->op_private & OPpASSIGN_COMMON) )
2867 tmpop = ((UNOP*)left)->op_first;
2868 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2869 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2870 pm->op_pmflags |= PMf_ONCE;
2871 tmpop = cUNOPo->op_first; /* to list (nulled) */
2872 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2873 tmpop->op_sibling = Nullop; /* don't free split */
2874 right->op_next = tmpop->op_next; /* fix starting loc */
2875 op_free(o); /* blow off assign */
2876 right->op_flags &= ~OPf_WANT;
2877 /* "I don't know and I don't care." */
2882 if (PL_modcount < 10000 &&
2883 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2885 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2887 sv_setiv(sv, PL_modcount+1);
2895 right = newOP(OP_UNDEF, 0);
2896 if (right->op_type == OP_READLINE) {
2897 right->op_flags |= OPf_STACKED;
2898 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
2901 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2902 o = newBINOP(OP_SASSIGN, flags,
2903 scalar(right), mod(scalar(left), OP_SASSIGN) );
2915 newSTATEOP(I32 flags, char *label, OP *o)
2918 U32 seq = intro_my();
2921 Newz(1101, cop, 1, COP);
2922 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
2923 cop->op_type = OP_DBSTATE;
2924 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
2927 cop->op_type = OP_NEXTSTATE;
2928 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
2930 cop->op_flags = flags;
2931 cop->op_private = (PL_hints & HINT_UTF8);
2933 cop->op_private |= NATIVE_HINTS;
2935 PL_compiling.op_private = cop->op_private;
2936 cop->op_next = (OP*)cop;
2939 cop->cop_label = label;
2940 PL_hints |= HINT_BLOCK_SCOPE;
2943 cop->cop_arybase = PL_curcop->cop_arybase;
2944 if (PL_curcop->cop_warnings == WARN_NONE
2945 || PL_curcop->cop_warnings == WARN_ALL)
2946 cop->cop_warnings = PL_curcop->cop_warnings ;
2948 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
2951 if (PL_copline == NOLINE)
2952 cop->cop_line = PL_curcop->cop_line;
2954 cop->cop_line = PL_copline;
2955 PL_copline = NOLINE;
2957 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
2958 cop->cop_stash = PL_curstash;
2960 if (PERLDB_LINE && PL_curstash != PL_debstash) {
2961 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
2962 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
2963 (void)SvIOK_on(*svp);
2965 SvSTASH(*svp) = (HV*)cop;
2969 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
2972 /* "Introduce" my variables to visible status. */
2980 if (! PL_min_intro_pending)
2981 return PL_cop_seqmax;
2983 svp = AvARRAY(PL_comppad_name);
2984 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
2985 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
2986 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
2987 SvNVX(sv) = (double)PL_cop_seqmax;
2990 PL_min_intro_pending = 0;
2991 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
2992 return PL_cop_seqmax++;
2996 newLOGOP(I32 type, I32 flags, OP *first, OP *other)
2998 return new_logop(type, flags, &first, &other);
3002 new_logop(I32 type, I32 flags, OP** firstp, OP** otherp)
3007 OP *first = *firstp;
3008 OP *other = *otherp;
3010 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3011 return newBINOP(type, flags, scalar(first), scalar(other));
3013 scalarboolean(first);
3014 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3015 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3016 if (type == OP_AND || type == OP_OR) {
3022 first = *firstp = cUNOPo->op_first;
3024 first->op_next = o->op_next;
3025 cUNOPo->op_first = Nullop;
3029 if (first->op_type == OP_CONST) {
3030 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3031 warner(WARN_PRECEDENCE, "Probable precedence problem on %s",
3033 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3044 else if (first->op_type == OP_WANTARRAY) {
3050 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3051 OP *k1 = ((UNOP*)first)->op_first;
3052 OP *k2 = k1->op_sibling;
3054 switch (first->op_type)
3057 if (k2 && k2->op_type == OP_READLINE
3058 && (k2->op_flags & OPf_STACKED)
3059 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3060 warnop = k2->op_type;
3064 if (k1->op_type == OP_READDIR
3065 || k1->op_type == OP_GLOB
3066 || k1->op_type == OP_EACH)
3067 warnop = k1->op_type;
3071 line_t oldline = PL_curcop->cop_line;
3072 PL_curcop->cop_line = PL_copline;
3074 "Value of %s%s can be \"0\"; test with defined()",
3076 ((warnop == OP_READLINE || warnop == OP_GLOB)
3077 ? " construct" : "() operator"));
3078 PL_curcop->cop_line = oldline;
3085 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3086 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3088 Newz(1101, logop, 1, LOGOP);
3090 logop->op_type = type;
3091 logop->op_ppaddr = PL_ppaddr[type];
3092 logop->op_first = first;
3093 logop->op_flags = flags | OPf_KIDS;
3094 logop->op_other = LINKLIST(other);
3095 logop->op_private = 1 | (flags >> 8);
3097 /* establish postfix order */
3098 logop->op_next = LINKLIST(first);
3099 first->op_next = (OP*)logop;
3100 first->op_sibling = other;
3102 o = newUNOP(OP_NULL, 0, (OP*)logop);
3109 newCONDOP(I32 flags, OP *first, OP *trueop, OP *falseop)
3116 return newLOGOP(OP_AND, 0, first, trueop);
3118 return newLOGOP(OP_OR, 0, first, falseop);
3120 scalarboolean(first);
3121 if (first->op_type == OP_CONST) {
3122 if (SvTRUE(((SVOP*)first)->op_sv)) {
3133 else if (first->op_type == OP_WANTARRAY) {
3137 Newz(1101, condop, 1, CONDOP);
3139 condop->op_type = OP_COND_EXPR;
3140 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3141 condop->op_first = first;
3142 condop->op_flags = flags | OPf_KIDS;
3143 condop->op_true = LINKLIST(trueop);
3144 condop->op_false = LINKLIST(falseop);
3145 condop->op_private = 1 | (flags >> 8);
3147 /* establish postfix order */
3148 condop->op_next = LINKLIST(first);
3149 first->op_next = (OP*)condop;
3151 first->op_sibling = trueop;
3152 trueop->op_sibling = falseop;
3153 o = newUNOP(OP_NULL, 0, (OP*)condop);
3155 trueop->op_next = o;
3156 falseop->op_next = o;
3162 newRANGE(I32 flags, OP *left, OP *right)
3170 Newz(1101, condop, 1, CONDOP);
3172 condop->op_type = OP_RANGE;
3173 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3174 condop->op_first = left;
3175 condop->op_flags = OPf_KIDS;
3176 condop->op_true = LINKLIST(left);
3177 condop->op_false = LINKLIST(right);
3178 condop->op_private = 1 | (flags >> 8);
3180 left->op_sibling = right;
3182 condop->op_next = (OP*)condop;
3183 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3184 flop = newUNOP(OP_FLOP, 0, flip);
3185 o = newUNOP(OP_NULL, 0, flop);
3188 left->op_next = flip;
3189 right->op_next = flop;
3191 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3192 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3193 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3194 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3196 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3197 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3200 if (!flip->op_private || !flop->op_private)
3201 linklist(o); /* blow off optimizer unless constant */
3207 newLOOPOP(I32 flags, I32 debuggable, OP *expr, OP *block)
3212 int once = block && block->op_flags & OPf_SPECIAL &&
3213 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3216 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3217 return block; /* do {} while 0 does once */
3218 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3219 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3220 expr = newUNOP(OP_DEFINED, 0,
3221 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3222 } else if (expr->op_flags & OPf_KIDS) {
3223 OP *k1 = ((UNOP*)expr)->op_first;
3224 OP *k2 = (k1) ? k1->op_sibling : NULL;
3225 switch (expr->op_type) {
3227 if (k2 && k2->op_type == OP_READLINE
3228 && (k2->op_flags & OPf_STACKED)
3229 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3230 expr = newUNOP(OP_DEFINED, 0, expr);
3234 if (k1->op_type == OP_READDIR
3235 || k1->op_type == OP_GLOB
3236 || k1->op_type == OP_EACH)
3237 expr = newUNOP(OP_DEFINED, 0, expr);
3243 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3244 o = new_logop(OP_AND, 0, &expr, &listop);
3247 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3249 if (once && o != listop)
3250 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3253 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3255 o->op_flags |= flags;
3257 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3262 newWHILEOP(I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3271 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3272 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3273 expr = newUNOP(OP_DEFINED, 0,
3274 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3275 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3276 OP *k1 = ((UNOP*)expr)->op_first;
3277 OP *k2 = (k1) ? k1->op_sibling : NULL;
3278 switch (expr->op_type) {
3280 if (k2 && k2->op_type == OP_READLINE
3281 && (k2->op_flags & OPf_STACKED)
3282 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3283 expr = newUNOP(OP_DEFINED, 0, expr);
3287 if (k1->op_type == OP_READDIR
3288 || k1->op_type == OP_GLOB
3289 || k1->op_type == OP_EACH)
3290 expr = newUNOP(OP_DEFINED, 0, expr);
3296 block = newOP(OP_NULL, 0);
3299 next = LINKLIST(cont);
3301 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3302 if ((line_t)whileline != NOLINE) {
3303 PL_copline = whileline;
3304 cont = append_elem(OP_LINESEQ, cont,
3305 newSTATEOP(0, Nullch, Nullop));
3309 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3310 redo = LINKLIST(listop);
3313 PL_copline = whileline;
3315 o = new_logop(OP_AND, 0, &expr, &listop);
3316 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3317 op_free(expr); /* oops, it's a while (0) */
3319 return Nullop; /* listop already freed by new_logop */
3322 ((LISTOP*)listop)->op_last->op_next = condop =
3323 (o == listop ? redo : LINKLIST(o));
3331 Newz(1101,loop,1,LOOP);
3332 loop->op_type = OP_ENTERLOOP;
3333 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3334 loop->op_private = 0;
3335 loop->op_next = (OP*)loop;
3338 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3340 loop->op_redoop = redo;
3341 loop->op_lastop = o;
3344 loop->op_nextop = next;
3346 loop->op_nextop = o;
3348 o->op_flags |= flags;
3349 o->op_private |= (flags >> 8);
3354 newFOROP(I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3362 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3363 sv->op_type = OP_RV2GV;
3364 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3366 else if (sv->op_type == OP_PADSV) { /* private variable */
3367 padoff = sv->op_targ;
3371 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3372 padoff = sv->op_targ;
3373 iterflags |= OPf_SPECIAL;
3378 croak("Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3382 padoff = find_threadsv("_");
3383 iterflags |= OPf_SPECIAL;
3385 sv = newGVOP(OP_GV, 0, PL_defgv);
3388 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3389 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3390 iterflags |= OPf_STACKED;
3392 else if (expr->op_type == OP_NULL &&
3393 (expr->op_flags & OPf_KIDS) &&
3394 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3396 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3397 * set the STACKED flag to indicate that these values are to be
3398 * treated as min/max values by 'pp_iterinit'.
3400 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3401 CONDOP* range = (CONDOP*) flip->op_first;
3402 OP* left = range->op_first;
3403 OP* right = left->op_sibling;
3406 range->op_flags &= ~OPf_KIDS;
3407 range->op_first = Nullop;
3409 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3410 listop->op_first->op_next = range->op_true;
3411 left->op_next = range->op_false;
3412 right->op_next = (OP*)listop;
3413 listop->op_next = listop->op_first;
3416 expr = (OP*)(listop);
3418 iterflags |= OPf_STACKED;
3421 expr = mod(force_list(expr), OP_GREPSTART);
3425 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3426 append_elem(OP_LIST, expr, scalar(sv))));
3427 assert(!loop->op_next);
3428 Renew(loop, 1, LOOP);
3429 loop->op_targ = padoff;
3430 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3431 PL_copline = forline;
3432 return newSTATEOP(0, label, wop);
3436 newLOOPEX(I32 type, OP *label)
3442 if (type != OP_GOTO || label->op_type == OP_CONST) {
3443 /* "last()" means "last" */
3444 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3445 o = newOP(type, OPf_SPECIAL);
3447 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3448 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3454 if (label->op_type == OP_ENTERSUB)
3455 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3456 o = newUNOP(type, OPf_STACKED, label);
3458 PL_hints |= HINT_BLOCK_SCOPE;
3468 MUTEX_DESTROY(CvMUTEXP(cv));
3469 Safefree(CvMUTEXP(cv));
3472 #endif /* USE_THREADS */
3474 if (!CvXSUB(cv) && CvROOT(cv)) {
3476 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3477 croak("Can't undef active subroutine");
3480 croak("Can't undef active subroutine");
3481 #endif /* USE_THREADS */
3484 SAVESPTR(PL_curpad);
3488 op_free(CvROOT(cv));
3489 CvROOT(cv) = Nullop;
3492 SvPOK_off((SV*)cv); /* forget prototype */
3494 SvREFCNT_dec(CvGV(cv));
3496 SvREFCNT_dec(CvOUTSIDE(cv));
3497 CvOUTSIDE(cv) = Nullcv;
3498 if (CvPADLIST(cv)) {
3499 /* may be during global destruction */
3500 if (SvREFCNT(CvPADLIST(cv))) {
3501 I32 i = AvFILLp(CvPADLIST(cv));
3503 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3504 SV* sv = svp ? *svp : Nullsv;
3507 if (sv == (SV*)PL_comppad_name)
3508 PL_comppad_name = Nullav;
3509 else if (sv == (SV*)PL_comppad) {
3510 PL_comppad = Nullav;
3511 PL_curpad = Null(SV**);
3515 SvREFCNT_dec((SV*)CvPADLIST(cv));
3517 CvPADLIST(cv) = Nullav;
3521 #ifdef DEBUG_CLOSURES
3526 CV *outside = CvOUTSIDE(cv);
3527 AV* padlist = CvPADLIST(cv);
3534 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3536 (CvANON(cv) ? "ANON"
3537 : (cv == PL_main_cv) ? "MAIN"
3538 : CvUNIQUE(cv) ? "UNIQUE"
3539 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3542 : CvANON(outside) ? "ANON"
3543 : (outside == PL_main_cv) ? "MAIN"
3544 : CvUNIQUE(outside) ? "UNIQUE"
3545 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3550 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3551 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3552 pname = AvARRAY(pad_name);
3553 ppad = AvARRAY(pad);
3555 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3556 if (SvPOK(pname[ix]))
3557 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3559 SvFAKE(pname[ix]) ? "FAKE " : "",
3561 (long)I_32(SvNVX(pname[ix])),
3562 (long)SvIVX(pname[ix]));
3565 #endif /* DEBUG_CLOSURES */
3568 cv_clone2(CV *proto, CV *outside)
3573 AV* protopadlist = CvPADLIST(proto);
3574 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3575 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3576 SV** pname = AvARRAY(protopad_name);
3577 SV** ppad = AvARRAY(protopad);
3578 I32 fname = AvFILLp(protopad_name);
3579 I32 fpad = AvFILLp(protopad);
3583 assert(!CvUNIQUE(proto));
3586 SAVESPTR(PL_curpad);
3587 SAVESPTR(PL_comppad);
3588 SAVESPTR(PL_comppad_name);
3589 SAVESPTR(PL_compcv);
3591 cv = PL_compcv = (CV*)NEWSV(1104,0);
3592 sv_upgrade((SV *)cv, SvTYPE(proto));
3598 New(666, CvMUTEXP(cv), 1, perl_mutex);
3599 MUTEX_INIT(CvMUTEXP(cv));
3601 #endif /* USE_THREADS */
3602 CvFILEGV(cv) = CvFILEGV(proto);
3603 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3604 CvSTASH(cv) = CvSTASH(proto);
3605 CvROOT(cv) = CvROOT(proto);
3606 CvSTART(cv) = CvSTART(proto);
3608 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3611 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3613 PL_comppad_name = newAV();
3614 for (ix = fname; ix >= 0; ix--)
3615 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3617 PL_comppad = newAV();
3619 comppadlist = newAV();
3620 AvREAL_off(comppadlist);
3621 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3622 av_store(comppadlist, 1, (SV*)PL_comppad);
3623 CvPADLIST(cv) = comppadlist;
3624 av_fill(PL_comppad, AvFILLp(protopad));
3625 PL_curpad = AvARRAY(PL_comppad);
3627 av = newAV(); /* will be @_ */
3629 av_store(PL_comppad, 0, (SV*)av);
3630 AvFLAGS(av) = AVf_REIFY;
3632 for (ix = fpad; ix > 0; ix--) {
3633 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3634 if (namesv && namesv != &PL_sv_undef) {
3635 char *name = SvPVX(namesv); /* XXX */
3636 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3637 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3638 CvOUTSIDE(cv), cxstack_ix, 0);
3640 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3642 croak("panic: cv_clone: %s", name);
3644 else { /* our own lexical */
3647 /* anon code -- we'll come back for it */
3648 sv = SvREFCNT_inc(ppad[ix]);
3650 else if (*name == '@')
3652 else if (*name == '%')
3662 SV* sv = NEWSV(0,0);
3668 /* Now that vars are all in place, clone nested closures. */
3670 for (ix = fpad; ix > 0; ix--) {
3671 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3673 && namesv != &PL_sv_undef
3674 && !(SvFLAGS(namesv) & SVf_FAKE)
3675 && *SvPVX(namesv) == '&'
3676 && CvCLONE(ppad[ix]))
3678 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3679 SvREFCNT_dec(ppad[ix]);
3682 PL_curpad[ix] = (SV*)kid;
3686 #ifdef DEBUG_CLOSURES
3687 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3689 PerlIO_printf(Perl_debug_log, " from:\n");
3691 PerlIO_printf(Perl_debug_log, " to:\n");
3703 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3704 cv = cv_clone2(proto, CvOUTSIDE(proto));
3705 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3710 cv_ckproto(CV *cv, GV *gv, char *p)
3712 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3713 SV* msg = sv_newmortal();
3717 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3718 sv_setpv(msg, "Prototype mismatch:");
3720 sv_catpvf(msg, " sub %_", name);
3722 sv_catpvf(msg, " (%s)", SvPVX(cv));
3723 sv_catpv(msg, " vs ");
3725 sv_catpvf(msg, "(%s)", p);
3727 sv_catpv(msg, "none");
3735 if (!cv || !SvPOK(cv) || SvCUR(cv))
3737 return op_const_sv(CvSTART(cv), cv);
3741 op_const_sv(OP *o, CV *cv)
3748 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3749 o = cLISTOPo->op_first->op_sibling;
3751 for (; o; o = o->op_next) {
3752 OPCODE type = o->op_type;
3754 if(sv && o->op_next == o)
3756 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3758 if (type == OP_LEAVESUB || type == OP_RETURN)
3762 if (type == OP_CONST)
3764 else if (type == OP_PADSV && cv) {
3765 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3766 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3767 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3779 newSUB(I32 floor, OP *o, OP *proto, OP *block)
3783 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3784 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3785 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3786 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3795 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3796 maximum a prototype before. */
3797 if (SvTYPE(gv) > SVt_NULL) {
3798 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3799 warn("Runaway prototype");
3800 cv_ckproto((CV*)gv, NULL, ps);
3803 sv_setpv((SV*)gv, ps);
3805 sv_setiv((SV*)gv, -1);
3806 SvREFCNT_dec(PL_compcv);
3807 cv = PL_compcv = NULL;
3808 PL_sub_generation++;
3812 if (!name || GvCVGEN(gv))
3814 else if (cv = GvCV(gv)) {
3815 cv_ckproto(cv, gv, ps);
3816 /* already defined (or promised)? */
3817 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3819 bool const_changed = TRUE;
3821 /* just a "sub foo;" when &foo is already defined */
3822 SAVEFREESV(PL_compcv);
3825 /* ahem, death to those who redefine active sort subs */
3826 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3827 croak("Can't redefine active sort subroutine %s", name);
3828 if(const_sv = cv_const_sv(cv))
3829 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3830 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3831 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3832 && HvNAME(GvSTASH(CvGV(cv)))
3833 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3835 line_t oldline = PL_curcop->cop_line;
3836 PL_curcop->cop_line = PL_copline;
3837 warner(WARN_REDEFINE,
3838 const_sv ? "Constant subroutine %s redefined"
3839 : "Subroutine %s redefined", name);
3840 PL_curcop->cop_line = oldline;
3846 if (cv) { /* must reuse cv if autoloaded */
3848 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3849 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3850 CvOUTSIDE(PL_compcv) = 0;
3851 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3852 CvPADLIST(PL_compcv) = 0;
3853 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3854 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3855 SvREFCNT_dec(PL_compcv);
3862 PL_sub_generation++;
3865 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3866 CvFILEGV(cv) = PL_curcop->cop_filegv;
3867 CvSTASH(cv) = PL_curstash;
3870 if (!CvMUTEXP(cv)) {
3871 New(666, CvMUTEXP(cv), 1, perl_mutex);
3872 MUTEX_INIT(CvMUTEXP(cv));
3874 #endif /* USE_THREADS */
3877 sv_setpv((SV*)cv, ps);
3879 if (PL_error_count) {
3883 char *s = strrchr(name, ':');
3885 if (strEQ(s, "BEGIN")) {
3887 "BEGIN not safe after errors--compilation aborted";
3891 /* force display of errors found but not reported */
3892 sv_catpv(ERRSV, not_safe);
3893 croak("%s", SvPVx(ERRSV, n_a));
3900 PL_copline = NOLINE;
3905 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
3906 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
3909 SV **namep = AvARRAY(PL_comppad_name);
3910 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3913 if (SvIMMORTAL(PL_curpad[ix]))
3916 * The only things that a clonable function needs in its
3917 * pad are references to outer lexicals and anonymous subs.
3918 * The rest are created anew during cloning.
3920 if (!((namesv = namep[ix]) != Nullsv &&
3921 namesv != &PL_sv_undef &&
3923 *SvPVX(namesv) == '&')))
3925 SvREFCNT_dec(PL_curpad[ix]);
3926 PL_curpad[ix] = Nullsv;
3931 AV *av = newAV(); /* Will be @_ */
3933 av_store(PL_comppad, 0, (SV*)av);
3934 AvFLAGS(av) = AVf_REIFY;
3936 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
3937 if (SvIMMORTAL(PL_curpad[ix]))
3939 if (!SvPADMY(PL_curpad[ix]))
3940 SvPADTMP_on(PL_curpad[ix]);
3944 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
3945 CvSTART(cv) = LINKLIST(CvROOT(cv));
3946 CvROOT(cv)->op_next = 0;
3952 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
3953 SV *sv = NEWSV(0,0);
3954 SV *tmpstr = sv_newmortal();
3955 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
3959 sv_setpvf(sv, "%_:%ld-%ld",
3960 GvSV(PL_curcop->cop_filegv),
3961 (long)PL_subline, (long)PL_curcop->cop_line);
3962 gv_efullname3(tmpstr, gv, Nullch);
3963 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
3964 hv = GvHVn(db_postponed);
3965 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
3966 && (cv = GvCV(db_postponed))) {
3971 perl_call_sv((SV*)cv, G_DISCARD);
3975 if ((s = strrchr(name,':')))
3979 if (strEQ(s, "BEGIN")) {
3980 I32 oldscope = PL_scopestack_ix;
3982 SAVESPTR(PL_compiling.cop_filegv);
3983 SAVEI16(PL_compiling.cop_line);
3985 sv_setsv(PL_rs, PL_nrs);
3988 PL_beginav = newAV();
3989 DEBUG_x( dump_sub(gv) );
3990 av_push(PL_beginav, (SV *)cv);
3992 call_list(oldscope, PL_beginav);
3994 PL_curcop = &PL_compiling;
3995 PL_compiling.op_private = PL_hints;
3998 else if (strEQ(s, "END") && !PL_error_count) {
4001 av_unshift(PL_endav, 1);
4002 av_store(PL_endav, 0, (SV *)cv);
4005 else if (strEQ(s, "INIT") && !PL_error_count) {
4007 PL_initav = newAV();
4008 av_push(PL_initav, SvREFCNT_inc(cv));
4014 PL_copline = NOLINE;
4019 /* XXX unsafe for threads if eval_owner isn't held */
4021 newCONSTSUB(HV *stash, char *name, SV *sv)
4024 U32 oldhints = PL_hints;
4025 HV *old_cop_stash = PL_curcop->cop_stash;
4026 HV *old_curstash = PL_curstash;
4027 line_t oldline = PL_curcop->cop_line;
4028 PL_curcop->cop_line = PL_copline;
4030 PL_hints &= ~HINT_BLOCK_SCOPE;
4032 PL_curstash = PL_curcop->cop_stash = stash;
4035 start_subparse(FALSE, 0),
4036 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4037 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4038 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4041 PL_hints = oldhints;
4042 PL_curcop->cop_stash = old_cop_stash;
4043 PL_curstash = old_curstash;
4044 PL_curcop->cop_line = oldline;
4048 newXS(char *name, void (*subaddr) (CV * _CPERLproto), char *filename)
4051 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4054 if (cv = (name ? GvCV(gv) : Nullcv)) {
4056 /* just a cached method */
4060 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4061 /* already defined (or promised) */
4062 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4063 && HvNAME(GvSTASH(CvGV(cv)))
4064 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4065 line_t oldline = PL_curcop->cop_line;
4066 if (PL_copline != NOLINE)
4067 PL_curcop->cop_line = PL_copline;
4068 warner(WARN_REDEFINE, "Subroutine %s redefined",name);
4069 PL_curcop->cop_line = oldline;
4076 if (cv) /* must reuse cv if autoloaded */
4079 cv = (CV*)NEWSV(1105,0);
4080 sv_upgrade((SV *)cv, SVt_PVCV);
4084 PL_sub_generation++;
4087 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4089 New(666, CvMUTEXP(cv), 1, perl_mutex);
4090 MUTEX_INIT(CvMUTEXP(cv));
4092 #endif /* USE_THREADS */
4093 CvFILEGV(cv) = gv_fetchfile(filename);
4094 CvXSUB(cv) = subaddr;
4097 char *s = strrchr(name,':');
4102 if (strEQ(s, "BEGIN")) {
4104 PL_beginav = newAV();
4105 av_push(PL_beginav, (SV *)cv);
4108 else if (strEQ(s, "END")) {
4111 av_unshift(PL_endav, 1);
4112 av_store(PL_endav, 0, (SV *)cv);
4115 else if (strEQ(s, "INIT")) {
4117 PL_initav = newAV();
4118 av_push(PL_initav, (SV *)cv);
4129 newFORM(I32 floor, OP *o, OP *block)
4139 name = SvPVx(cSVOPo->op_sv, n_a);
4142 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4144 if (cv = GvFORM(gv)) {
4145 if (ckWARN(WARN_REDEFINE)) {
4146 line_t oldline = PL_curcop->cop_line;
4148 PL_curcop->cop_line = PL_copline;
4149 warner(WARN_REDEFINE, "Format %s redefined",name);
4150 PL_curcop->cop_line = oldline;
4156 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4157 CvFILEGV(cv) = PL_curcop->cop_filegv;
4159 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4160 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4161 SvPADTMP_on(PL_curpad[ix]);
4164 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4165 CvSTART(cv) = LINKLIST(CvROOT(cv));
4166 CvROOT(cv)->op_next = 0;
4169 PL_copline = NOLINE;
4176 return newUNOP(OP_REFGEN, 0,
4177 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4183 return newUNOP(OP_REFGEN, 0,
4184 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4188 newANONSUB(I32 floor, OP *proto, OP *block)
4190 return newUNOP(OP_REFGEN, 0,
4191 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4197 switch (o->op_type) {
4199 o->op_type = OP_PADAV;
4200 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4201 return ref(o, OP_RV2AV);
4204 o->op_type = OP_RV2AV;
4205 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4210 warn("oops: oopsAV");
4219 switch (o->op_type) {
4222 o->op_type = OP_PADHV;
4223 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4224 return ref(o, OP_RV2HV);
4228 o->op_type = OP_RV2HV;
4229 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4234 warn("oops: oopsHV");
4243 if (o->op_type == OP_PADANY) {
4244 o->op_type = OP_PADAV;
4245 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4248 return newUNOP(OP_RV2AV, 0, scalar(o));
4252 newGVREF(I32 type, OP *o)
4254 if (type == OP_MAPSTART)
4255 return newUNOP(OP_NULL, 0, o);
4256 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4262 if (o->op_type == OP_PADANY) {
4263 o->op_type = OP_PADHV;
4264 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4267 return newUNOP(OP_RV2HV, 0, scalar(o));
4273 croak("NOT IMPL LINE %d",__LINE__);
4279 newCVREF(I32 flags, OP *o)
4281 return newUNOP(OP_RV2CV, flags, scalar(o));
4287 if (o->op_type == OP_PADANY) {
4288 o->op_type = OP_PADSV;
4289 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4292 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4293 o->op_flags |= OPpDONE_SVREF;
4296 return newUNOP(OP_RV2SV, 0, scalar(o));
4299 /* Check routines. */
4307 name = NEWSV(1106,0);
4308 sv_upgrade(name, SVt_PVNV);
4309 sv_setpvn(name, "&", 1);
4312 ix = pad_alloc(o->op_type, SVs_PADMY);
4313 av_store(PL_comppad_name, ix, name);
4314 av_store(PL_comppad, ix, cSVOPo->op_sv);
4315 SvPADMY_on(cSVOPo->op_sv);
4316 cSVOPo->op_sv = Nullsv;
4317 cSVOPo->op_targ = ix;
4324 o->op_private = PL_hints;
4331 if (cUNOPo->op_first->op_type == OP_CONCAT)
4332 o->op_flags |= OPf_STACKED;
4339 if (o->op_flags & OPf_KIDS) {
4342 OPCODE type = o->op_type;
4343 o = modkids(ck_fun(o), type);
4344 kid = cUNOPo->op_first;
4345 newop = kUNOP->op_first->op_sibling;
4347 (newop->op_sibling ||
4348 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4349 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4350 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4354 op_free(kUNOP->op_first);
4355 kUNOP->op_first = newop;
4357 o->op_ppaddr = PL_ppaddr[++o->op_type];
4366 if (o->op_flags & OPf_KIDS) {
4367 OP *kid = cUNOPo->op_first;
4368 if (kid->op_type == OP_HSLICE)
4369 o->op_private |= OPpSLICE;
4370 else if (kid->op_type != OP_HELEM)
4371 croak("%s argument is not a HASH element or slice",
4372 PL_op_desc[o->op_type]);
4381 I32 type = o->op_type;
4383 if (o->op_flags & OPf_KIDS) {
4384 if (cLISTOPo->op_first->op_type == OP_STUB) {
4386 o = newUNOP(type, OPf_SPECIAL,
4387 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4397 PL_hints |= HINT_BLOCK_SCOPE;
4398 if (o->op_flags & OPf_KIDS) {
4399 SVOP *kid = (SVOP*)cUNOPo->op_first;
4402 o->op_flags &= ~OPf_KIDS;
4405 else if (kid->op_type == OP_LINESEQ) {
4408 kid->op_next = o->op_next;
4409 cUNOPo->op_first = 0;
4412 Newz(1101, enter, 1, LOGOP);
4413 enter->op_type = OP_ENTERTRY;
4414 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4415 enter->op_private = 0;
4417 /* establish postfix order */
4418 enter->op_next = (OP*)enter;
4420 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4421 o->op_type = OP_LEAVETRY;
4422 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4423 enter->op_other = o;
4431 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4433 o->op_targ = (PADOFFSET)PL_hints;
4441 if (o->op_flags & OPf_STACKED) {
4443 kid = cUNOPo->op_first->op_sibling;
4444 if (kid->op_type == OP_RV2GV)
4456 if (o->op_flags & OPf_KIDS) {
4457 OP *kid = cUNOPo->op_first;
4458 if (kid->op_type != OP_HELEM)
4459 croak("%s argument is not a HASH element", PL_op_desc[o->op_type]);
4467 ck_gvconst(register OP *o)
4469 o = fold_constants(o);
4470 if (o->op_type == OP_CONST)
4477 ck_rvconst(register OP *o)
4480 SVOP *kid = (SVOP*)cUNOPo->op_first;
4482 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4483 if (kid->op_type == OP_CONST) {
4487 SV *kidsv = kid->op_sv;
4490 /* Is it a constant from cv_const_sv()? */
4491 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4492 SV *rsv = SvRV(kidsv);
4493 int svtype = SvTYPE(rsv);
4494 char *badtype = Nullch;
4496 switch (o->op_type) {
4498 if (svtype > SVt_PVMG)
4499 badtype = "a SCALAR";
4502 if (svtype != SVt_PVAV)
4503 badtype = "an ARRAY";
4506 if (svtype != SVt_PVHV) {
4507 if (svtype == SVt_PVAV) { /* pseudohash? */
4508 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4509 if (ksv && SvROK(*ksv)
4510 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4519 if (svtype != SVt_PVCV)
4524 croak("Constant is not %s reference", badtype);
4527 name = SvPV(kidsv, n_a);
4528 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4529 char *badthing = Nullch;
4530 switch (o->op_type) {
4532 badthing = "a SCALAR";
4535 badthing = "an ARRAY";
4538 badthing = "a HASH";
4543 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4547 * This is a little tricky. We only want to add the symbol if we
4548 * didn't add it in the lexer. Otherwise we get duplicate strict
4549 * warnings. But if we didn't add it in the lexer, we must at
4550 * least pretend like we wanted to add it even if it existed before,
4551 * or we get possible typo warnings. OPpCONST_ENTERED says
4552 * whether the lexer already added THIS instance of this symbol.
4554 iscv = (o->op_type == OP_RV2CV) * 2;
4556 gv = gv_fetchpv(name,
4557 iscv | !(kid->op_private & OPpCONST_ENTERED),
4560 : o->op_type == OP_RV2SV
4562 : o->op_type == OP_RV2AV
4564 : o->op_type == OP_RV2HV
4567 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4569 kid->op_type = OP_GV;
4570 SvREFCNT_dec(kid->op_sv);
4571 kid->op_sv = SvREFCNT_inc(gv);
4581 I32 type = o->op_type;
4583 if (o->op_flags & OPf_REF)
4586 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4587 SVOP *kid = (SVOP*)cUNOPo->op_first;
4589 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4591 OP *newop = newGVOP(type, OPf_REF,
4592 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4599 if (type == OP_FTTTY)
4600 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4603 return newUNOP(type, 0, newDEFSVOP());
4616 int type = o->op_type;
4617 register I32 oa = PL_opargs[type] >> OASHIFT;
4619 if (o->op_flags & OPf_STACKED) {
4620 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4623 return no_fh_allowed(o);
4626 if (o->op_flags & OPf_KIDS) {
4628 tokid = &cLISTOPo->op_first;
4629 kid = cLISTOPo->op_first;
4630 if (kid->op_type == OP_PUSHMARK ||
4631 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4633 tokid = &kid->op_sibling;
4634 kid = kid->op_sibling;
4636 if (!kid && PL_opargs[type] & OA_DEFGV)
4637 *tokid = kid = newDEFSVOP();
4641 sibl = kid->op_sibling;
4655 if (kid->op_type == OP_CONST &&
4656 (kid->op_private & OPpCONST_BARE)) {
4657 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4658 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4659 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4660 if (ckWARN(WARN_SYNTAX))
4662 "Array @%s missing the @ in argument %ld of %s()",
4663 name, (long)numargs, PL_op_desc[type]);
4666 kid->op_sibling = sibl;
4669 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4670 bad_type(numargs, "array", PL_op_desc[o->op_type], kid);
4674 if (kid->op_type == OP_CONST &&
4675 (kid->op_private & OPpCONST_BARE)) {
4676 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4677 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4678 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4679 if (ckWARN(WARN_SYNTAX))
4681 "Hash %%%s missing the %% in argument %ld of %s()",
4682 name, (long)numargs, PL_op_desc[type]);
4685 kid->op_sibling = sibl;
4688 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4689 bad_type(numargs, "hash", PL_op_desc[o->op_type], kid);
4694 OP *newop = newUNOP(OP_NULL, 0, kid);
4695 kid->op_sibling = 0;
4697 newop->op_next = newop;
4699 kid->op_sibling = sibl;
4704 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4705 if (kid->op_type == OP_CONST &&
4706 (kid->op_private & OPpCONST_BARE)) {
4707 OP *newop = newGVOP(OP_GV, 0,
4708 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4713 else if (kid->op_type == OP_READLINE) {
4714 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4715 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4718 kid->op_sibling = 0;
4719 kid = newUNOP(OP_RV2GV, 0, scalar(kid));
4721 kid->op_sibling = sibl;
4727 mod(scalar(kid), type);
4731 tokid = &kid->op_sibling;
4732 kid = kid->op_sibling;
4734 o->op_private |= numargs;
4736 return too_many_arguments(o,PL_op_desc[o->op_type]);
4739 else if (PL_opargs[type] & OA_DEFGV) {
4741 return newUNOP(type, 0, newDEFSVOP());
4745 while (oa & OA_OPTIONAL)
4747 if (oa && oa != OA_LIST)
4748 return too_few_arguments(o,PL_op_desc[o->op_type]);
4758 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4759 append_elem(OP_GLOB, o, newDEFSVOP());
4761 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4762 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4764 if (gv && GvIMPORTED_CV(gv)) {
4765 static int glob_index;
4767 append_elem(OP_GLOB, o,
4768 newSVOP(OP_CONST, 0, newSViv(glob_index++)));
4769 o->op_type = OP_LIST;
4770 o->op_ppaddr = PL_ppaddr[OP_LIST];
4771 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4772 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4773 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4774 append_elem(OP_LIST, o,
4775 scalar(newUNOP(OP_RV2CV, 0,
4776 newGVOP(OP_GV, 0, gv)))));
4777 o = newUNOP(OP_NULL, 0, ck_subr(o));
4778 o->op_targ = OP_GLOB; /* hint at what it used to be */
4781 gv = newGVgen("main");
4783 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4793 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4795 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4796 Newz(1101, gwop, 1, LOGOP);
4798 if (o->op_flags & OPf_STACKED) {
4801 kid = cLISTOPo->op_first->op_sibling;
4802 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4805 kid->op_next = (OP*)gwop;
4806 o->op_flags &= ~OPf_STACKED;
4808 kid = cLISTOPo->op_first->op_sibling;
4809 if (type == OP_MAPWHILE)
4816 kid = cLISTOPo->op_first->op_sibling;
4817 if (kid->op_type != OP_NULL)
4818 croak("panic: ck_grep");
4819 kid = kUNOP->op_first;
4821 gwop->op_type = type;
4822 gwop->op_ppaddr = PL_ppaddr[type];
4823 gwop->op_first = listkids(o);
4824 gwop->op_flags |= OPf_KIDS;
4825 gwop->op_private = 1;
4826 gwop->op_other = LINKLIST(kid);
4827 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4828 kid->op_next = (OP*)gwop;
4830 kid = cLISTOPo->op_first->op_sibling;
4831 if (!kid || !kid->op_sibling)
4832 return too_few_arguments(o,PL_op_desc[o->op_type]);
4833 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4834 mod(kid, OP_GREPSTART);
4842 if (o->op_flags & OPf_KIDS) {
4843 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4845 kid = kid->op_sibling; /* get past "big" */
4846 if (kid && kid->op_type == OP_CONST)
4847 fbm_compile(((SVOP*)kid)->op_sv, 0);
4853 ck_lengthconst(OP *o)
4855 /* XXX length optimization goes here */
4862 OPCODE type = o->op_type;
4863 return modkids(ck_fun(o), type);
4869 OPCODE type = o->op_type;
4870 return refkids(ck_fun(o), type);
4878 kid = cLISTOPo->op_first;
4881 kid = cLISTOPo->op_first;
4883 if (kid->op_type == OP_PUSHMARK)
4884 kid = kid->op_sibling;
4885 if (kid && o->op_flags & OPf_STACKED)
4886 kid = kid->op_sibling;
4887 else if (kid && !kid->op_sibling) { /* print HANDLE; */
4888 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
4889 o->op_flags |= OPf_STACKED; /* make it a filehandle */
4890 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
4891 cLISTOPo->op_first->op_sibling = kid;
4892 cLISTOPo->op_last = kid;
4893 kid = kid->op_sibling;
4898 append_elem(o->op_type, o, newDEFSVOP());
4904 if (PL_hints & HINT_LOCALE)
4905 o->op_private |= OPpLOCALE;
4912 ck_fun_locale(OP *o)
4918 if (PL_hints & HINT_LOCALE)
4919 o->op_private |= OPpLOCALE;
4930 if (PL_hints & HINT_LOCALE)
4931 o->op_private |= OPpLOCALE;
4940 o->op_private |= OPpRUNTIME;
4953 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
4954 o->op_private |= OPpREPEAT_DOLIST;
4955 cBINOPo->op_first = force_list(cBINOPo->op_first);
4965 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
4966 SVOP *kid = (SVOP*)cUNOPo->op_first;
4968 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4970 for (s = SvPVX(kid->op_sv); *s; s++) {
4971 if (*s == ':' && s[1] == ':') {
4973 Move(s+2, s+1, strlen(s+2)+1, char);
4974 --SvCUR(kid->op_sv);
4977 sv_catpvn(kid->op_sv, ".pm", 3);
4987 croak("NOT IMPL LINE %d",__LINE__);
4997 if (o->op_flags & OPf_KIDS) {
4998 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4999 if (kid && kid->op_sibling) {
5000 o->op_type = OP_SSELECT;
5001 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5003 return fold_constants(o);
5007 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5008 if (kid && kid->op_type == OP_RV2GV)
5009 kid->op_private &= ~HINT_STRICT_REFS;
5016 I32 type = o->op_type;
5018 if (!(o->op_flags & OPf_KIDS)) {
5023 if (!CvUNIQUE(PL_compcv)) {
5024 argop = newOP(OP_PADAV, OPf_REF);
5025 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5028 argop = newUNOP(OP_RV2AV, 0,
5029 scalar(newGVOP(OP_GV, 0,
5030 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5033 argop = newUNOP(OP_RV2AV, 0,
5034 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5035 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5036 #endif /* USE_THREADS */
5037 return newUNOP(type, 0, scalar(argop));
5039 return scalar(modkids(ck_fun(o), type));
5047 if (PL_hints & HINT_LOCALE)
5048 o->op_private |= OPpLOCALE;
5051 if (o->op_flags & OPf_STACKED) {
5052 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5054 kid = kUNOP->op_first; /* get past rv2gv */
5056 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5058 if (kid->op_type == OP_SCOPE) {
5062 else if (kid->op_type == OP_LEAVE) {
5063 if (o->op_type == OP_SORT) {
5064 null(kid); /* wipe out leave */
5067 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5068 if (k->op_next == kid)
5073 kid->op_next = 0; /* just disconnect the leave */
5074 k = kLISTOP->op_first;
5078 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5079 null(kid); /* wipe out rv2gv */
5080 if (o->op_type == OP_SORT)
5084 o->op_flags |= OPf_SPECIAL;
5086 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5087 null(cLISTOPo->op_first->op_sibling);
5098 if (o->op_flags & OPf_STACKED)
5099 return no_fh_allowed(o);
5101 kid = cLISTOPo->op_first;
5102 if (kid->op_type != OP_NULL)
5103 croak("panic: ck_split");
5104 kid = kid->op_sibling;
5105 op_free(cLISTOPo->op_first);
5106 cLISTOPo->op_first = kid;
5108 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpv(" ", 1));
5109 cLISTOPo->op_last = kid; /* There was only one element previously */
5112 if (kid->op_type != OP_MATCH) {
5113 OP *sibl = kid->op_sibling;
5114 kid->op_sibling = 0;
5115 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5116 if (cLISTOPo->op_first == cLISTOPo->op_last)
5117 cLISTOPo->op_last = kid;
5118 cLISTOPo->op_first = kid;
5119 kid->op_sibling = sibl;
5122 kid->op_type = OP_PUSHRE;
5123 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5126 if (!kid->op_sibling)
5127 append_elem(OP_SPLIT, o, newDEFSVOP());
5129 kid = kid->op_sibling;
5132 if (!kid->op_sibling)
5133 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5135 kid = kid->op_sibling;
5138 if (kid->op_sibling)
5139 return too_many_arguments(o,PL_op_desc[o->op_type]);
5148 OP *prev = ((cUNOPo->op_first->op_sibling)
5149 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5150 OP *o2 = prev->op_sibling;
5159 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5160 if (cvop->op_type == OP_RV2CV) {
5162 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5163 null(cvop); /* disable rv2cv */
5164 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5165 if (tmpop->op_type == OP_GV) {
5166 cv = GvCVu(tmpop->op_sv);
5167 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5168 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5169 proto = SvPV((SV*)cv, n_a);
5173 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5174 if (PERLDB_SUB && PL_curstash != PL_debstash)
5175 o->op_private |= OPpENTERSUB_DB;
5176 while (o2 != cvop) {
5180 return too_many_arguments(o, gv_ename(namegv));
5198 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5199 bad_type(arg, "block", gv_ename(namegv), o2);
5204 if (o2->op_type == OP_RV2GV)
5208 OP* sib = kid->op_sibling;
5209 kid->op_sibling = 0;
5210 o2 = newUNOP(OP_RV2GV, 0, kid);
5211 o2->op_sibling = sib;
5212 prev->op_sibling = o2;
5220 if (o2->op_type != OP_RV2GV)
5221 bad_type(arg, "symbol", gv_ename(namegv), o2);
5224 if (o2->op_type != OP_RV2CV)
5225 bad_type(arg, "sub", gv_ename(namegv), o2);
5228 if (o2->op_type != OP_RV2SV
5229 && o2->op_type != OP_PADSV
5230 && o2->op_type != OP_THREADSV)
5232 bad_type(arg, "scalar", gv_ename(namegv), o2);
5236 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5237 bad_type(arg, "array", gv_ename(namegv), o2);
5240 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5241 bad_type(arg, "hash", gv_ename(namegv), o2);
5245 OP* sib = kid->op_sibling;
5246 kid->op_sibling = 0;
5247 o2 = newUNOP(OP_REFGEN, 0, kid);
5248 o2->op_sibling = sib;
5249 prev->op_sibling = o2;
5260 croak("Malformed prototype for %s: %s",
5261 gv_ename(namegv), SvPV((SV*)cv, n_a));
5266 mod(o2, OP_ENTERSUB);
5268 o2 = o2->op_sibling;
5270 if (proto && !optional &&
5271 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5272 return too_few_arguments(o, gv_ename(namegv));
5279 SvREADONLY_on(cSVOPo->op_sv);
5286 if (o->op_flags & OPf_KIDS) {
5287 SVOP *kid = (SVOP*)cUNOPo->op_first;
5289 if (kid->op_type == OP_NULL)
5290 kid = (SVOP*)kid->op_sibling;
5292 kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE))
5293 o->op_flags |= OPf_SPECIAL;
5298 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5301 peep(register OP *o)
5304 register OP* oldop = 0;
5307 if (!o || o->op_seq)
5311 SAVESPTR(PL_curcop);
5312 for (; o; o = o->op_next) {
5318 switch (o->op_type) {
5321 PL_curcop = ((COP*)o); /* for warnings */
5322 o->op_seq = PL_op_seqmax++;
5333 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5335 o->op_seq = PL_op_seqmax++;
5338 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5339 o->op_seq = PL_op_seqmax++;
5340 break; /* Scalar stub must produce undef. List stub is noop */
5344 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5345 PL_curcop = ((COP*)o);
5351 if (oldop && o->op_next) {
5352 oldop->op_next = o->op_next;
5355 o->op_seq = PL_op_seqmax++;
5359 if (o->op_next->op_type == OP_RV2SV) {
5360 if (!(o->op_next->op_private & OPpDEREF)) {
5362 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5363 o->op_next = o->op_next->op_next;
5364 o->op_type = OP_GVSV;
5365 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5368 else if (o->op_next->op_type == OP_RV2AV) {
5369 OP* pop = o->op_next->op_next;
5371 if (pop->op_type == OP_CONST &&
5372 (PL_op = pop->op_next) &&
5373 pop->op_next->op_type == OP_AELEM &&
5374 !(pop->op_next->op_private &
5375 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5376 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5380 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5384 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5385 o->op_next = pop->op_next->op_next;
5386 o->op_type = OP_AELEMFAST;
5387 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5388 o->op_private = (U8)i;
5389 GvAVn(((GVOP*)o)->op_gv);
5392 o->op_seq = PL_op_seqmax++;
5399 o->op_seq = PL_op_seqmax++;
5400 while (cLOGOP->op_other->op_type == OP_NULL)
5401 cLOGOP->op_other = cLOGOP->op_other->op_next;
5402 peep(cLOGOP->op_other);
5406 o->op_seq = PL_op_seqmax++;
5407 peep(cCONDOP->op_true);
5408 peep(cCONDOP->op_false);
5412 o->op_seq = PL_op_seqmax++;
5413 peep(cLOOP->op_redoop);
5414 peep(cLOOP->op_nextop);
5415 peep(cLOOP->op_lastop);
5421 o->op_seq = PL_op_seqmax++;
5422 peep(cPMOP->op_pmreplstart);
5426 o->op_seq = PL_op_seqmax++;
5427 if (ckWARN(WARN_SYNTAX) && o->op_next
5428 && o->op_next->op_type == OP_NEXTSTATE) {
5429 if (o->op_next->op_sibling &&
5430 o->op_next->op_sibling->op_type != OP_EXIT &&
5431 o->op_next->op_sibling->op_type != OP_WARN &&
5432 o->op_next->op_sibling->op_type != OP_DIE) {
5433 line_t oldline = PL_curcop->cop_line;
5435 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5436 warner(WARN_SYNTAX, "Statement unlikely to be reached");
5437 warner(WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5438 PL_curcop->cop_line = oldline;
5452 if (o->op_private & (OPpDEREF_HV|OPpDEREF_AV|OPpLVAL_INTRO)
5453 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5455 rop = (UNOP*)((BINOP*)o)->op_first;
5456 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5458 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5459 if (!SvOBJECT(lexname))
5461 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5462 if (!fields || !GvHV(*fields))
5464 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5465 key = SvPV(*svp, keylen);
5466 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5468 croak("No such field \"%s\" in variable %s of type %s",
5469 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5471 ind = SvIV(*indsvp);
5473 croak("Bad index while coercing array into hash");
5474 rop->op_type = OP_RV2AV;
5475 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5476 o->op_type = OP_AELEM;
5477 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5479 *svp = newSViv(ind);
5484 o->op_seq = PL_op_seqmax++;