3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
12 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
13 * youngest of the Old Took's daughters); and Mr. Drogo was his second
14 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
15 * either way, as the saying is, if you follow me." --the Gaffer
23 #define CHECKCALL this->*PL_check
25 #define CHECKCALL *PL_check
28 /* #define PL_OP_SLAB_ALLOC */
30 #ifdef PL_OP_SLAB_ALLOC
31 #define SLAB_SIZE 8192
32 static char *PL_OpPtr = NULL;
33 static int PL_OpSpace = 0;
34 #define NewOp(m,var,c,type) do { if ((PL_OpSpace -= c*sizeof(type)) >= 0) \
35 var = (type *)(PL_OpPtr -= c*sizeof(type)); \
37 var = (type *) Slab_Alloc(m,c*sizeof(type)); \
41 S_Slab_Alloc(pTHX_ int m, size_t sz)
43 Newz(m,PL_OpPtr,SLAB_SIZE,char);
44 PL_OpSpace = SLAB_SIZE - sz;
45 return PL_OpPtr += PL_OpSpace;
49 #define NewOp(m, var, c, type) Newz(m, var, c, type)
52 * In the following definition, the ", Nullop" is just to make the compiler
53 * think the expression is of the right type: croak actually does a Siglongjmp.
55 #define CHECKOP(type,o) \
56 ((PL_op_mask && PL_op_mask[type]) \
57 ? ( op_free((OP*)o), \
58 Perl_croak(aTHX_ "%s trapped by operation mask", PL_op_desc[type]), \
60 : (CHECKCALL[type])(aTHX_ (OP*)o))
62 #define PAD_MAX 999999999
65 S_gv_ename(pTHX_ GV *gv)
68 SV* tmpsv = sv_newmortal();
69 gv_efullname3(tmpsv, gv, Nullch);
70 return SvPV(tmpsv,n_a);
74 S_no_fh_allowed(pTHX_ OP *o)
76 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
77 PL_op_desc[o->op_type]));
82 S_too_few_arguments(pTHX_ OP *o, char *name)
84 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
89 S_too_many_arguments(pTHX_ OP *o, char *name)
91 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
96 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
98 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
99 (int)n, name, t, PL_op_desc[kid->op_type]));
103 S_no_bareword_allowed(pTHX_ OP *o)
105 Perl_warn(aTHX_ "Bareword \"%s\" not allowed while \"strict subs\" in use",
106 SvPV_nolen(cSVOPo->op_sv));
111 Perl_assertref(pTHX_ OP *o)
113 int type = o->op_type;
114 if (type != OP_AELEM && type != OP_HELEM && type != OP_GELEM) {
115 yyerror(Perl_form(aTHX_ "Can't use subscript on %s", PL_op_desc[type]));
116 if (type == OP_ENTERSUB || type == OP_RV2HV || type == OP_PADHV) {
118 SV *msg = sv_2mortal(
119 Perl_newSVpvf(aTHX_ "(Did you mean $ or @ instead of %c?)\n",
120 type == OP_ENTERSUB ? '&' : '%'));
121 if (PL_in_eval & EVAL_WARNONLY)
122 Perl_warn(aTHX_ "%_", msg);
124 sv_catsv(GvSV(PL_errgv), msg);
126 PerlIO_write(PerlIO_stderr(), SvPVX(msg), SvCUR(msg));
131 /* "register" allocation */
134 Perl_pad_allocmy(pTHX_ char *name)
142 (PL_hints & HINT_UTF8 && (name[1] & 0xc0) == 0xc0) ||
143 name[1] == '_' && (int)strlen(name) > 2))
145 if (!isPRINT(name[1])) {
146 /* 1999-02-27 mjd@plover.com */
148 p = strchr(name, '\0');
149 /* The next block assumes the buffer is at least 205 chars
150 long. At present, it's always at least 256 chars. */
152 strcpy(name+200, "...");
158 /* Move everything else down one character */
159 for (; p-name > 2; p--)
161 name[2] = toCTRL(name[1]);
164 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
166 if (ckWARN(WARN_UNSAFE) && AvFILLp(PL_comppad_name) >= 0) {
167 SV **svp = AvARRAY(PL_comppad_name);
168 for (off = AvFILLp(PL_comppad_name); off > PL_comppad_name_floor; off--) {
170 && sv != &PL_sv_undef
171 && (SvIVX(sv) == PAD_MAX || SvIVX(sv) == 0)
172 && strEQ(name, SvPVX(sv)))
174 Perl_warner(aTHX_ WARN_UNSAFE,
175 "\"my\" variable %s masks earlier declaration in same %s",
176 name, (SvIVX(sv) == PAD_MAX ? "scope" : "statement"));
181 off = pad_alloc(OP_PADSV, SVs_PADMY);
183 sv_upgrade(sv, SVt_PVNV);
185 if (PL_in_my_stash) {
187 yyerror(Perl_form(aTHX_ "Can't declare class for non-scalar %s in \"my\"",
190 (void)SvUPGRADE(sv, SVt_PVMG);
191 SvSTASH(sv) = (HV*)SvREFCNT_inc(PL_in_my_stash);
194 av_store(PL_comppad_name, off, sv);
195 SvNVX(sv) = (double)PAD_MAX;
196 SvIVX(sv) = 0; /* Not yet introduced--see newSTATEOP */
197 if (!PL_min_intro_pending)
198 PL_min_intro_pending = off;
199 PL_max_intro_pending = off;
201 av_store(PL_comppad, off, (SV*)newAV());
202 else if (*name == '%')
203 av_store(PL_comppad, off, (SV*)newHV());
204 SvPADMY_on(PL_curpad[off]);
208 #define FINDLEX_NOSEARCH 1 /* don't search outer contexts */
211 S_pad_findlex(pTHX_ char *name, PADOFFSET newoff, U32 seq, CV* startcv,
212 I32 cx_ix, I32 saweval, U32 flags)
219 register PERL_CONTEXT *cx;
221 for (cv = startcv; cv; cv = CvOUTSIDE(cv)) {
222 AV *curlist = CvPADLIST(cv);
223 SV **svp = av_fetch(curlist, 0, FALSE);
226 if (!svp || *svp == &PL_sv_undef)
229 svp = AvARRAY(curname);
230 for (off = AvFILLp(curname); off > 0; off--) {
231 if ((sv = svp[off]) &&
232 sv != &PL_sv_undef &&
234 seq > I_32(SvNVX(sv)) &&
235 strEQ(SvPVX(sv), name))
246 return 0; /* don't clone from inactive stack frame */
250 oldpad = (AV*)*av_fetch(curlist, depth, FALSE);
251 oldsv = *av_fetch(oldpad, off, TRUE);
252 if (!newoff) { /* Not a mere clone operation. */
253 SV *namesv = NEWSV(1103,0);
254 newoff = pad_alloc(OP_PADSV, SVs_PADMY);
255 sv_upgrade(namesv, SVt_PVNV);
256 sv_setpv(namesv, name);
257 av_store(PL_comppad_name, newoff, namesv);
258 SvNVX(namesv) = (double)PL_curcop->cop_seq;
259 SvIVX(namesv) = PAD_MAX; /* A ref, intro immediately */
260 SvFAKE_on(namesv); /* A ref, not a real var */
261 if (SvOBJECT(sv)) { /* A typed var */
263 (void)SvUPGRADE(namesv, SVt_PVMG);
264 SvSTASH(namesv) = (HV*)SvREFCNT_inc((SV*)SvSTASH(sv));
267 if (CvANON(PL_compcv) || SvTYPE(PL_compcv) == SVt_PVFM) {
268 /* "It's closures all the way down." */
269 CvCLONE_on(PL_compcv);
271 if (CvANON(PL_compcv))
272 oldsv = Nullsv; /* no need to keep ref */
277 bcv && bcv != cv && !CvCLONE(bcv);
278 bcv = CvOUTSIDE(bcv))
283 if (ckWARN(WARN_CLOSURE)
284 && !CvUNIQUE(bcv) && !CvUNIQUE(cv))
286 Perl_warner(aTHX_ WARN_CLOSURE,
287 "Variable \"%s\" may be unavailable",
295 else if (!CvUNIQUE(PL_compcv)) {
296 if (ckWARN(WARN_CLOSURE) && !SvFAKE(sv) && !CvUNIQUE(cv))
297 Perl_warner(aTHX_ WARN_CLOSURE,
298 "Variable \"%s\" will not stay shared", name);
301 av_store(PL_comppad, newoff, SvREFCNT_inc(oldsv));
307 if (flags & FINDLEX_NOSEARCH)
310 /* Nothing in current lexical context--try eval's context, if any.
311 * This is necessary to let the perldb get at lexically scoped variables.
312 * XXX This will also probably interact badly with eval tree caching.
315 for (i = cx_ix; i >= 0; i--) {
317 switch (CxTYPE(cx)) {
319 if (i == 0 && saweval) {
320 seq = cxstack[saweval].blk_oldcop->cop_seq;
321 return pad_findlex(name, newoff, seq, PL_main_cv, -1, saweval, 0);
325 switch (cx->blk_eval.old_op_type) {
331 /* require must have its own scope */
339 if (PL_debstash && CvSTASH(cv) == PL_debstash) { /* ignore DB'* scope */
340 saweval = i; /* so we know where we were called from */
343 seq = cxstack[saweval].blk_oldcop->cop_seq;
344 return pad_findlex(name, newoff, seq, cv, i-1, saweval,FINDLEX_NOSEARCH);
352 Perl_pad_findmy(pTHX_ char *name)
358 SV **svp = AvARRAY(PL_comppad_name);
359 U32 seq = PL_cop_seqmax;
365 * Special case to get lexical (and hence per-thread) @_.
366 * XXX I need to find out how to tell at parse-time whether use
367 * of @_ should refer to a lexical (from a sub) or defgv (global
368 * scope and maybe weird sub-ish things like formats). See
369 * startsub in perly.y. It's possible that @_ could be lexical
370 * (at least from subs) even in non-threaded perl.
372 if (strEQ(name, "@_"))
373 return 0; /* success. (NOT_IN_PAD indicates failure) */
374 #endif /* USE_THREADS */
376 /* The one we're looking for is probably just before comppad_name_fill. */
377 for (off = AvFILLp(PL_comppad_name); off > 0; off--) {
378 if ((sv = svp[off]) &&
379 sv != &PL_sv_undef &&
382 seq > I_32(SvNVX(sv)))) &&
383 strEQ(SvPVX(sv), name))
386 return (PADOFFSET)off;
387 pendoff = off; /* this pending def. will override import */
391 outside = CvOUTSIDE(PL_compcv);
393 /* Check if if we're compiling an eval'', and adjust seq to be the
394 * eval's seq number. This depends on eval'' having a non-null
395 * CvOUTSIDE() while it is being compiled. The eval'' itself is
396 * identified by CvEVAL being true and CvGV being null. */
397 if (outside && CvEVAL(PL_compcv) && !CvGV(PL_compcv) && cxstack_ix >= 0) {
398 cx = &cxstack[cxstack_ix];
400 seq = cx->blk_oldcop->cop_seq;
403 /* See if it's in a nested scope */
404 off = pad_findlex(name, 0, seq, outside, cxstack_ix, 0, 0);
406 /* If there is a pending local definition, this new alias must die */
408 SvIVX(AvARRAY(PL_comppad_name)[off]) = seq;
409 return off; /* pad_findlex returns 0 for failure...*/
411 return NOT_IN_PAD; /* ...but we return NOT_IN_PAD for failure */
415 Perl_pad_leavemy(pTHX_ I32 fill)
418 SV **svp = AvARRAY(PL_comppad_name);
420 if (PL_min_intro_pending && fill < PL_min_intro_pending) {
421 for (off = PL_max_intro_pending; off >= PL_min_intro_pending; off--) {
422 if ((sv = svp[off]) && sv != &PL_sv_undef)
423 Perl_warn(aTHX_ "%s never introduced", SvPVX(sv));
426 /* "Deintroduce" my variables that are leaving with this scope. */
427 for (off = AvFILLp(PL_comppad_name); off > fill; off--) {
428 if ((sv = svp[off]) && sv != &PL_sv_undef && SvIVX(sv) == PAD_MAX)
429 SvIVX(sv) = PL_cop_seqmax;
434 Perl_pad_alloc(pTHX_ I32 optype, U32 tmptype)
440 if (AvARRAY(PL_comppad) != PL_curpad)
441 Perl_croak(aTHX_ "panic: pad_alloc");
442 if (PL_pad_reset_pending)
444 if (tmptype & SVs_PADMY) {
446 sv = *av_fetch(PL_comppad, AvFILLp(PL_comppad) + 1, TRUE);
447 } while (SvPADBUSY(sv)); /* need a fresh one */
448 retval = AvFILLp(PL_comppad);
451 SV **names = AvARRAY(PL_comppad_name);
452 SSize_t names_fill = AvFILLp(PL_comppad_name);
455 * "foreach" index vars temporarily become aliases to non-"my"
456 * values. Thus we must skip, not just pad values that are
457 * marked as current pad values, but also those with names.
459 if (++PL_padix <= names_fill &&
460 (sv = names[PL_padix]) && sv != &PL_sv_undef)
462 sv = *av_fetch(PL_comppad, PL_padix, TRUE);
463 if (!(SvFLAGS(sv) & (SVs_PADTMP|SVs_PADMY)))
468 SvFLAGS(sv) |= tmptype;
469 PL_curpad = AvARRAY(PL_comppad);
471 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx alloc %ld for %s\n",
472 (unsigned long) thr, (unsigned long) PL_curpad,
473 (long) retval, PL_op_name[optype]));
475 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx alloc %ld for %s\n",
476 (unsigned long) PL_curpad,
477 (long) retval, PL_op_name[optype]));
478 #endif /* USE_THREADS */
479 return (PADOFFSET)retval;
483 Perl_pad_sv(pTHX_ PADOFFSET po)
487 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx sv %d\n",
488 (unsigned long) thr, (unsigned long) PL_curpad, po));
491 Perl_croak(aTHX_ "panic: pad_sv po");
492 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx sv %d\n",
493 (unsigned long) PL_curpad, po));
494 #endif /* USE_THREADS */
495 return PL_curpad[po]; /* eventually we'll turn this into a macro */
499 Perl_pad_free(pTHX_ PADOFFSET po)
504 if (AvARRAY(PL_comppad) != PL_curpad)
505 Perl_croak(aTHX_ "panic: pad_free curpad");
507 Perl_croak(aTHX_ "panic: pad_free po");
509 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx free %d\n",
510 (unsigned long) thr, (unsigned long) PL_curpad, po));
512 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx free %d\n",
513 (unsigned long) PL_curpad, po));
514 #endif /* USE_THREADS */
515 if (PL_curpad[po] && PL_curpad[po] != &PL_sv_undef)
516 SvPADTMP_off(PL_curpad[po]);
517 if ((I32)po < PL_padix)
522 Perl_pad_swipe(pTHX_ PADOFFSET po)
525 if (AvARRAY(PL_comppad) != PL_curpad)
526 Perl_croak(aTHX_ "panic: pad_swipe curpad");
528 Perl_croak(aTHX_ "panic: pad_swipe po");
530 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx swipe %d\n",
531 (unsigned long) thr, (unsigned long) PL_curpad, po));
533 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx swipe %d\n",
534 (unsigned long) PL_curpad, po));
535 #endif /* USE_THREADS */
536 SvPADTMP_off(PL_curpad[po]);
537 PL_curpad[po] = NEWSV(1107,0);
538 SvPADTMP_on(PL_curpad[po]);
539 if ((I32)po < PL_padix)
543 /* XXX pad_reset() is currently disabled because it results in serious bugs.
544 * It causes pad temp TARGs to be shared between OPs. Since TARGs are pushed
545 * on the stack by OPs that use them, there are several ways to get an alias
546 * to a shared TARG. Such an alias will change randomly and unpredictably.
547 * We avoid doing this until we can think of a Better Way.
552 #ifdef USE_BROKEN_PAD_RESET
556 if (AvARRAY(PL_comppad) != PL_curpad)
557 Perl_croak(aTHX_ "panic: pad_reset curpad");
559 DEBUG_X(PerlIO_printf(Perl_debug_log, "0x%lx Pad 0x%lx reset\n",
560 (unsigned long) thr, (unsigned long) PL_curpad));
562 DEBUG_X(PerlIO_printf(Perl_debug_log, "Pad 0x%lx reset\n",
563 (unsigned long) PL_curpad));
564 #endif /* USE_THREADS */
565 if (!PL_tainting) { /* Can't mix tainted and non-tainted temporaries. */
566 for (po = AvMAX(PL_comppad); po > PL_padix_floor; po--) {
567 if (PL_curpad[po] && !SvIMMORTAL(PL_curpad[po]))
568 SvPADTMP_off(PL_curpad[po]);
570 PL_padix = PL_padix_floor;
573 PL_pad_reset_pending = FALSE;
577 /* find_threadsv is not reentrant */
579 Perl_find_threadsv(pTHX_ const char *name)
585 /* We currently only handle names of a single character */
586 p = strchr(PL_threadsv_names, *name);
589 key = p - PL_threadsv_names;
590 MUTEX_LOCK(&thr->mutex);
591 svp = av_fetch(thr->threadsv, key, FALSE);
593 MUTEX_UNLOCK(&thr->mutex);
595 SV *sv = NEWSV(0, 0);
596 av_store(thr->threadsv, key, sv);
597 thr->threadsvp = AvARRAY(thr->threadsv);
598 MUTEX_UNLOCK(&thr->mutex);
600 * Some magic variables used to be automagically initialised
601 * in gv_fetchpv. Those which are now per-thread magicals get
602 * initialised here instead.
608 sv_setpv(sv, "\034");
609 sv_magic(sv, 0, 0, name, 1);
614 PL_sawampersand = TRUE;
628 /* XXX %! tied to Errno.pm needs to be added here.
629 * See gv_fetchpv(). */
633 sv_magic(sv, 0, 0, name, 1);
635 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
636 "find_threadsv: new SV %p for $%s%c\n",
637 sv, (*name < 32) ? "^" : "",
638 (*name < 32) ? toCTRL(*name) : *name));
642 #endif /* USE_THREADS */
647 Perl_op_free(pTHX_ OP *o)
649 register OP *kid, *nextkid;
651 if (!o || o->op_seq == (U16)-1)
654 if (o->op_flags & OPf_KIDS) {
655 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
656 nextkid = kid->op_sibling; /* Get before next freeing kid */
661 switch (o->op_type) {
663 o->op_targ = 0; /* Was holding old type, if any. */
666 o->op_targ = 0; /* Was holding hints. */
670 if (!(o->op_flags & OPf_SPECIAL))
674 o->op_targ = 0; /* Was holding index into thr->threadsv AV. */
676 #endif /* USE_THREADS */
678 if (!(o->op_flags & OPf_REF)
679 || (PL_check[o->op_type] != FUNC_NAME_TO_PTR(Perl_ck_ftst)))
685 SvREFCNT_dec(cGVOPo->op_gv);
689 Safefree(cCOPo->cop_label);
690 SvREFCNT_dec(cCOPo->cop_filegv);
691 if (cCOPo->cop_warnings != WARN_NONE && cCOPo->cop_warnings != WARN_ALL)
692 SvREFCNT_dec(cCOPo->cop_warnings);
695 SvREFCNT_dec(cSVOPo->op_sv);
701 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
705 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF))
706 SvREFCNT_dec(cSVOPo->op_sv);
708 Safefree(cPVOPo->op_pv);
711 op_free(cPMOPo->op_pmreplroot);
716 ReREFCNT_dec(cPMOPo->op_pmregexp);
721 pad_free(o->op_targ);
723 #ifdef PL_OP_SLAB_ALLOC
724 if ((char *) o == PL_OpPtr)
735 if (o->op_type != OP_NULL && o->op_type != OP_THREADSV && o->op_targ > 0)
736 pad_free(o->op_targ);
737 o->op_targ = o->op_type;
738 o->op_type = OP_NULL;
739 o->op_ppaddr = PL_ppaddr[OP_NULL];
742 /* Contextualizers */
744 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
747 Perl_linklist(pTHX_ OP *o)
754 /* establish postfix order */
755 if (cUNOPo->op_first) {
756 o->op_next = LINKLIST(cUNOPo->op_first);
757 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
759 kid->op_next = LINKLIST(kid->op_sibling);
771 Perl_scalarkids(pTHX_ OP *o)
774 if (o && o->op_flags & OPf_KIDS) {
775 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
782 S_scalarboolean(pTHX_ OP *o)
784 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
786 if (ckWARN(WARN_SYNTAX)) {
787 line_t oldline = PL_curcop->cop_line;
789 if (PL_copline != NOLINE)
790 PL_curcop->cop_line = PL_copline;
791 Perl_warner(aTHX_ WARN_SYNTAX, "Found = in conditional, should be ==");
792 PL_curcop->cop_line = oldline;
799 Perl_scalar(pTHX_ OP *o)
803 /* assumes no premature commitment */
804 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
805 || o->op_type == OP_RETURN)
808 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
810 switch (o->op_type) {
812 if (o->op_private & OPpREPEAT_DOLIST)
813 null(((LISTOP*)cBINOPo->op_first)->op_first);
814 scalar(cBINOPo->op_first);
819 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
823 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
824 if (!kPMOP->op_pmreplroot)
825 deprecate("implicit split to @_");
833 if (o->op_flags & OPf_KIDS) {
834 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
840 kid = cLISTOPo->op_first;
842 while (kid = kid->op_sibling) {
848 WITH_THR(PL_curcop = &PL_compiling);
853 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
859 WITH_THR(PL_curcop = &PL_compiling);
866 Perl_scalarvoid(pTHX_ OP *o)
873 if (o->op_type == OP_NEXTSTATE || o->op_type == OP_DBSTATE ||
874 (o->op_type == OP_NULL &&
875 (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)))
878 PL_curcop = (COP*)o; /* for warning below */
881 /* assumes no premature commitment */
882 want = o->op_flags & OPf_WANT;
883 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
884 || o->op_type == OP_RETURN)
887 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
889 switch (o->op_type) {
891 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
895 if (o->op_flags & OPf_STACKED)
899 if (o->op_private == 4)
970 if (!(o->op_private & OPpLVAL_INTRO))
971 useless = PL_op_desc[o->op_type];
978 if (!(o->op_private & OPpLVAL_INTRO) &&
979 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
980 useless = "a variable";
985 if (cSVOPo->op_private & OPpCONST_STRICT)
986 no_bareword_allowed(o);
989 if (ckWARN(WARN_VOID)) {
990 useless = "a constant";
991 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
993 else if (SvPOK(sv)) {
994 if (strnEQ(SvPVX(sv), "di", 2) ||
995 strnEQ(SvPVX(sv), "ds", 2) ||
996 strnEQ(SvPVX(sv), "ig", 2))
1001 null(o); /* don't execute a constant */
1002 SvREFCNT_dec(sv); /* don't even remember it */
1006 o->op_type = OP_PREINC; /* pre-increment is faster */
1007 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1011 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1012 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1018 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1023 if (o->op_flags & OPf_STACKED)
1031 if (!(o->op_flags & OPf_KIDS))
1040 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1047 /* all requires must return a boolean value */
1048 o->op_flags &= ~OPf_WANT;
1051 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1052 if (!kPMOP->op_pmreplroot)
1053 deprecate("implicit split to @_");
1059 if (ckWARN(WARN_VOID))
1060 Perl_warner(aTHX_ WARN_VOID, "Useless use of %s in void context", useless);
1066 Perl_listkids(pTHX_ OP *o)
1069 if (o && o->op_flags & OPf_KIDS) {
1070 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1077 Perl_list(pTHX_ OP *o)
1081 /* assumes no premature commitment */
1082 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
1083 || o->op_type == OP_RETURN)
1086 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1088 switch (o->op_type) {
1091 list(cBINOPo->op_first);
1096 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1104 if (!(o->op_flags & OPf_KIDS))
1106 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1107 list(cBINOPo->op_first);
1108 return gen_constant_list(o);
1115 kid = cLISTOPo->op_first;
1117 while (kid = kid->op_sibling) {
1118 if (kid->op_sibling)
1123 WITH_THR(PL_curcop = &PL_compiling);
1127 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1128 if (kid->op_sibling)
1133 WITH_THR(PL_curcop = &PL_compiling);
1136 /* all requires must return a boolean value */
1137 o->op_flags &= ~OPf_WANT;
1144 Perl_scalarseq(pTHX_ OP *o)
1149 if (o->op_type == OP_LINESEQ ||
1150 o->op_type == OP_SCOPE ||
1151 o->op_type == OP_LEAVE ||
1152 o->op_type == OP_LEAVETRY)
1155 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1156 if (kid->op_sibling) {
1160 PL_curcop = &PL_compiling;
1162 o->op_flags &= ~OPf_PARENS;
1163 if (PL_hints & HINT_BLOCK_SCOPE)
1164 o->op_flags |= OPf_PARENS;
1167 o = newOP(OP_STUB, 0);
1172 S_modkids(pTHX_ OP *o, I32 type)
1175 if (o && o->op_flags & OPf_KIDS) {
1176 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1183 Perl_mod(pTHX_ OP *o, I32 type)
1190 if (!o || PL_error_count)
1193 switch (o->op_type) {
1198 if (!(o->op_private & (OPpCONST_ARYBASE)))
1200 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1201 PL_compiling.cop_arybase = (I32)SvIV(((SVOP*)PL_eval_start)->op_sv);
1205 SAVEI32(PL_compiling.cop_arybase);
1206 PL_compiling.cop_arybase = 0;
1208 else if (type == OP_REFGEN)
1211 Perl_croak(aTHX_ "That use of $[ is unsupported");
1214 if (o->op_flags & OPf_PARENS)
1218 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1219 !(o->op_flags & OPf_STACKED)) {
1220 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1221 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1222 assert(cUNOPo->op_first->op_type == OP_NULL);
1223 null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1229 /* grep, foreach, subcalls, refgen */
1230 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1232 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1233 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1234 ? "do block" : PL_op_desc[o->op_type]),
1235 type ? PL_op_desc[type] : "local"));
1249 case OP_RIGHT_SHIFT:
1258 if (!(o->op_flags & OPf_STACKED))
1264 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1270 if (!type && cUNOPo->op_first->op_type != OP_GV)
1271 Perl_croak(aTHX_ "Can't localize through a reference");
1272 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1273 PL_modcount = 10000;
1274 return o; /* Treat \(@foo) like ordinary list. */
1278 if (scalar_mod_type(o, type))
1280 ref(cUNOPo->op_first, o->op_type);
1289 PL_modcount = 10000;
1292 if (!type && cUNOPo->op_first->op_type != OP_GV)
1293 Perl_croak(aTHX_ "Can't localize through a reference");
1294 ref(cUNOPo->op_first, o->op_type);
1298 PL_hints |= HINT_BLOCK_SCOPE;
1308 PL_modcount = 10000;
1309 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1310 return o; /* Treat \(@foo) like ordinary list. */
1311 if (scalar_mod_type(o, type))
1317 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1318 SvPV(*av_fetch(PL_comppad_name, o->op_targ, 4), n_a));
1323 PL_modcount++; /* XXX ??? */
1325 #endif /* USE_THREADS */
1331 if (type != OP_SASSIGN)
1335 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1341 pad_free(o->op_targ);
1342 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1343 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1344 if (o->op_flags & OPf_KIDS)
1345 mod(cBINOPo->op_first->op_sibling, type);
1350 ref(cBINOPo->op_first, o->op_type);
1351 if (type == OP_ENTERSUB &&
1352 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1353 o->op_private |= OPpLVAL_DEFER;
1360 if (o->op_flags & OPf_KIDS)
1361 mod(cLISTOPo->op_last, type);
1365 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1367 else if (!(o->op_flags & OPf_KIDS))
1369 if (o->op_targ != OP_LIST) {
1370 mod(cBINOPo->op_first, type);
1375 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1379 o->op_flags |= OPf_MOD;
1381 if (type == OP_AASSIGN || type == OP_SASSIGN)
1382 o->op_flags |= OPf_SPECIAL|OPf_REF;
1384 o->op_private |= OPpLVAL_INTRO;
1385 o->op_flags &= ~OPf_SPECIAL;
1386 PL_hints |= HINT_BLOCK_SCOPE;
1388 else if (type != OP_GREPSTART && type != OP_ENTERSUB)
1389 o->op_flags |= OPf_REF;
1394 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1398 if (o->op_type == OP_RV2GV)
1422 case OP_RIGHT_SHIFT:
1441 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1443 switch (o->op_type) {
1451 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1464 Perl_refkids(pTHX_ OP *o, I32 type)
1467 if (o && o->op_flags & OPf_KIDS) {
1468 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1475 Perl_ref(pTHX_ OP *o, I32 type)
1479 if (!o || PL_error_count)
1482 switch (o->op_type) {
1484 if ((type == OP_DEFINED || type == OP_LOCK) &&
1485 !(o->op_flags & OPf_STACKED)) {
1486 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1487 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1488 assert(cUNOPo->op_first->op_type == OP_NULL);
1489 null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1490 o->op_flags |= OPf_SPECIAL;
1495 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1499 if (type == OP_DEFINED)
1500 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1501 ref(cUNOPo->op_first, o->op_type);
1504 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1505 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1506 : type == OP_RV2HV ? OPpDEREF_HV
1508 o->op_flags |= OPf_MOD;
1513 o->op_flags |= OPf_MOD; /* XXX ??? */
1518 o->op_flags |= OPf_REF;
1521 if (type == OP_DEFINED)
1522 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1523 ref(cUNOPo->op_first, o->op_type);
1528 o->op_flags |= OPf_REF;
1533 if (!(o->op_flags & OPf_KIDS))
1535 ref(cBINOPo->op_first, type);
1539 ref(cBINOPo->op_first, o->op_type);
1540 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1541 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1542 : type == OP_RV2HV ? OPpDEREF_HV
1544 o->op_flags |= OPf_MOD;
1552 if (!(o->op_flags & OPf_KIDS))
1554 ref(cLISTOPo->op_last, type);
1564 Perl_my(pTHX_ OP *o)
1569 if (!o || PL_error_count)
1573 if (type == OP_LIST) {
1574 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1576 } else if (type == OP_UNDEF) {
1578 } else if (type != OP_PADSV &&
1581 type != OP_PUSHMARK)
1583 yyerror(Perl_form(aTHX_ "Can't declare %s in my", PL_op_desc[o->op_type]));
1586 o->op_flags |= OPf_MOD;
1587 o->op_private |= OPpLVAL_INTRO;
1592 Perl_sawparens(pTHX_ OP *o)
1595 o->op_flags |= OPf_PARENS;
1600 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1605 if (ckWARN(WARN_UNSAFE) &&
1606 (left->op_type == OP_RV2AV ||
1607 left->op_type == OP_RV2HV ||
1608 left->op_type == OP_PADAV ||
1609 left->op_type == OP_PADHV)) {
1610 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1611 right->op_type == OP_TRANS)
1612 ? right->op_type : OP_MATCH];
1613 char *sample = ((left->op_type == OP_RV2AV ||
1614 left->op_type == OP_PADAV)
1615 ? "@array" : "%hash");
1616 Perl_warner(aTHX_ WARN_UNSAFE,
1617 "Applying %s to %s will act on scalar(%s)",
1618 desc, sample, sample);
1621 if (right->op_type == OP_MATCH ||
1622 right->op_type == OP_SUBST ||
1623 right->op_type == OP_TRANS) {
1624 right->op_flags |= OPf_STACKED;
1625 if (right->op_type != OP_MATCH)
1626 left = mod(left, right->op_type);
1627 if (right->op_type == OP_TRANS)
1628 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1630 o = prepend_elem(right->op_type, scalar(left), right);
1632 return newUNOP(OP_NOT, 0, scalar(o));
1636 return bind_match(type, left,
1637 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1641 Perl_invert(pTHX_ OP *o)
1645 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1646 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1650 Perl_scope(pTHX_ OP *o)
1653 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1654 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1655 o->op_type = OP_LEAVE;
1656 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1659 if (o->op_type == OP_LINESEQ) {
1661 o->op_type = OP_SCOPE;
1662 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1663 kid = ((LISTOP*)o)->op_first;
1664 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE){
1665 SvREFCNT_dec(((COP*)kid)->cop_filegv);
1670 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1677 Perl_save_hints(pTHX)
1680 SAVESPTR(GvHV(PL_hintgv));
1681 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1682 SAVEFREESV(GvHV(PL_hintgv));
1686 Perl_block_start(pTHX_ int full)
1689 int retval = PL_savestack_ix;
1691 SAVEI32(PL_comppad_name_floor);
1693 if ((PL_comppad_name_fill = AvFILLp(PL_comppad_name)) > 0)
1694 PL_comppad_name_floor = PL_comppad_name_fill;
1696 PL_comppad_name_floor = 0;
1698 SAVEI32(PL_min_intro_pending);
1699 SAVEI32(PL_max_intro_pending);
1700 PL_min_intro_pending = 0;
1701 SAVEI32(PL_comppad_name_fill);
1702 SAVEI32(PL_padix_floor);
1703 PL_padix_floor = PL_padix;
1704 PL_pad_reset_pending = FALSE;
1706 PL_hints &= ~HINT_BLOCK_SCOPE;
1707 SAVEPPTR(PL_compiling.cop_warnings);
1708 if (PL_compiling.cop_warnings != WARN_ALL &&
1709 PL_compiling.cop_warnings != WARN_NONE) {
1710 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1711 SAVEFREESV(PL_compiling.cop_warnings) ;
1719 Perl_block_end(pTHX_ I32 floor, OP *seq)
1722 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1723 OP* retval = scalarseq(seq);
1725 PL_pad_reset_pending = FALSE;
1726 PL_compiling.op_private = PL_hints;
1728 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1729 pad_leavemy(PL_comppad_name_fill);
1738 OP *o = newOP(OP_THREADSV, 0);
1739 o->op_targ = find_threadsv("_");
1742 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1743 #endif /* USE_THREADS */
1747 Perl_newPROG(pTHX_ OP *o)
1753 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1754 ((PL_in_eval & EVAL_KEEPERR)
1755 ? OPf_SPECIAL : 0), o);
1756 PL_eval_start = linklist(PL_eval_root);
1757 PL_eval_root->op_next = 0;
1758 peep(PL_eval_start);
1763 PL_main_root = scope(sawparens(scalarvoid(o)));
1764 PL_curcop = &PL_compiling;
1765 PL_main_start = LINKLIST(PL_main_root);
1766 PL_main_root->op_next = 0;
1767 peep(PL_main_start);
1770 /* Register with debugger */
1772 CV *cv = get_cv("DB::postponed", FALSE);
1776 XPUSHs((SV*)PL_compiling.cop_filegv);
1778 call_sv((SV*)cv, G_DISCARD);
1785 Perl_localize(pTHX_ OP *o, I32 lex)
1787 if (o->op_flags & OPf_PARENS)
1791 if (ckWARN(WARN_PARENTHESIS) && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',') {
1793 for (s = PL_bufptr; *s && (isALNUM(*s) || (*s & 0x80) || strchr("@$%, ",*s)); s++) ;
1794 if (*s == ';' || *s == '=')
1795 Perl_warner(aTHX_ WARN_PARENTHESIS, "Parentheses missing around \"%s\" list",
1796 lex ? "my" : "local");
1800 PL_in_my_stash = Nullhv;
1804 return mod(o, OP_NULL); /* a bit kludgey */
1808 Perl_jmaybe(pTHX_ OP *o)
1810 if (o->op_type == OP_LIST) {
1813 o2 = newOP(OP_THREADSV, 0);
1814 o2->op_targ = find_threadsv(";");
1816 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1817 #endif /* USE_THREADS */
1818 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1824 Perl_fold_constants(pTHX_ register OP *o)
1828 I32 type = o->op_type;
1831 if (PL_opargs[type] & OA_RETSCALAR)
1833 if (PL_opargs[type] & OA_TARGET)
1834 o->op_targ = pad_alloc(type, SVs_PADTMP);
1836 /* integerize op, unless it happens to be C<-foo>.
1837 * XXX should pp_i_negate() do magic string negation instead? */
1838 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1839 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1840 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1842 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1845 if (!(PL_opargs[type] & OA_FOLDCONST))
1850 /* XXX might want a ck_negate() for this */
1851 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1864 if (o->op_private & OPpLOCALE)
1869 goto nope; /* Don't try to run w/ errors */
1871 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1872 if (curop->op_type != OP_CONST &&
1873 curop->op_type != OP_LIST &&
1874 curop->op_type != OP_SCALAR &&
1875 curop->op_type != OP_NULL &&
1876 curop->op_type != OP_PUSHMARK)
1882 curop = LINKLIST(o);
1886 sv = *(PL_stack_sp--);
1887 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1888 pad_swipe(o->op_targ);
1889 else if (SvTEMP(sv)) { /* grab mortal temp? */
1890 (void)SvREFCNT_inc(sv);
1894 if (type == OP_RV2GV)
1895 return newGVOP(OP_GV, 0, (GV*)sv);
1897 /* try to smush double to int, but don't smush -2.0 to -2 */
1898 if ((SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK)) == SVf_NOK &&
1902 if ((double)iv == SvNV(sv)) {
1907 SvIOK_off(sv); /* undo SvIV() damage */
1909 return newSVOP(OP_CONST, 0, sv);
1913 if (!(PL_opargs[type] & OA_OTHERINT))
1916 if (!(PL_hints & HINT_INTEGER)) {
1917 if (type == OP_DIVIDE || !(o->op_flags & OPf_KIDS))
1920 for (curop = ((UNOP*)o)->op_first; curop; curop = curop->op_sibling) {
1921 if (curop->op_type == OP_CONST) {
1922 if (SvIOK(((SVOP*)curop)->op_sv))
1926 if (PL_opargs[curop->op_type] & OA_RETINTEGER)
1930 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
1937 Perl_gen_constant_list(pTHX_ register OP *o)
1941 I32 oldtmps_floor = PL_tmps_floor;
1945 return o; /* Don't attempt to run with errors */
1947 PL_op = curop = LINKLIST(o);
1953 PL_tmps_floor = oldtmps_floor;
1955 o->op_type = OP_RV2AV;
1956 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
1957 curop = ((UNOP*)o)->op_first;
1958 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
1965 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
1970 if (!o || o->op_type != OP_LIST)
1971 o = newLISTOP(OP_LIST, 0, o, Nullop);
1973 o->op_flags &= ~OPf_WANT;
1975 if (!(PL_opargs[type] & OA_MARK))
1976 null(cLISTOPo->op_first);
1979 o->op_ppaddr = PL_ppaddr[type];
1980 o->op_flags |= flags;
1982 o = CHECKOP(type, o);
1983 if (o->op_type != type)
1986 if (cLISTOPo->op_children < 7) {
1987 /* XXX do we really need to do this if we're done appending?? */
1988 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1990 cLISTOPo->op_last = last; /* in case check substituted last arg */
1993 return fold_constants(o);
1996 /* List constructors */
1999 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2007 if (first->op_type != type || type==OP_LIST && first->op_flags & OPf_PARENS)
2008 return newLISTOP(type, 0, first, last);
2010 if (first->op_flags & OPf_KIDS)
2011 ((LISTOP*)first)->op_last->op_sibling = last;
2013 first->op_flags |= OPf_KIDS;
2014 ((LISTOP*)first)->op_first = last;
2016 ((LISTOP*)first)->op_last = last;
2017 ((LISTOP*)first)->op_children++;
2022 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2030 if (first->op_type != type)
2031 return prepend_elem(type, (OP*)first, (OP*)last);
2033 if (last->op_type != type)
2034 return append_elem(type, (OP*)first, (OP*)last);
2036 first->op_last->op_sibling = last->op_first;
2037 first->op_last = last->op_last;
2038 first->op_children += last->op_children;
2039 if (first->op_children)
2040 first->op_flags |= OPf_KIDS;
2042 #ifdef PL_OP_SLAB_ALLOC
2050 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2058 if (last->op_type == type) {
2059 if (type == OP_LIST) { /* already a PUSHMARK there */
2060 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2061 ((LISTOP*)last)->op_first->op_sibling = first;
2064 if (!(last->op_flags & OPf_KIDS)) {
2065 ((LISTOP*)last)->op_last = first;
2066 last->op_flags |= OPf_KIDS;
2068 first->op_sibling = ((LISTOP*)last)->op_first;
2069 ((LISTOP*)last)->op_first = first;
2071 ((LISTOP*)last)->op_children++;
2075 return newLISTOP(type, 0, first, last);
2081 Perl_newNULLLIST(pTHX)
2083 return newOP(OP_STUB, 0);
2087 Perl_force_list(pTHX_ OP *o)
2089 if (!o || o->op_type != OP_LIST)
2090 o = newLISTOP(OP_LIST, 0, o, Nullop);
2096 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2100 NewOp(1101, listop, 1, LISTOP);
2102 listop->op_type = type;
2103 listop->op_ppaddr = PL_ppaddr[type];
2104 listop->op_children = (first != 0) + (last != 0);
2105 listop->op_flags = flags;
2109 else if (!first && last)
2112 first->op_sibling = last;
2113 listop->op_first = first;
2114 listop->op_last = last;
2115 if (type == OP_LIST) {
2117 pushop = newOP(OP_PUSHMARK, 0);
2118 pushop->op_sibling = first;
2119 listop->op_first = pushop;
2120 listop->op_flags |= OPf_KIDS;
2122 listop->op_last = pushop;
2124 else if (listop->op_children)
2125 listop->op_flags |= OPf_KIDS;
2131 Perl_newOP(pTHX_ I32 type, I32 flags)
2134 NewOp(1101, o, 1, OP);
2136 o->op_ppaddr = PL_ppaddr[type];
2137 o->op_flags = flags;
2140 o->op_private = 0 + (flags >> 8);
2141 if (PL_opargs[type] & OA_RETSCALAR)
2143 if (PL_opargs[type] & OA_TARGET)
2144 o->op_targ = pad_alloc(type, SVs_PADTMP);
2145 return CHECKOP(type, o);
2149 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2154 first = newOP(OP_STUB, 0);
2155 if (PL_opargs[type] & OA_MARK)
2156 first = force_list(first);
2158 NewOp(1101, unop, 1, UNOP);
2159 unop->op_type = type;
2160 unop->op_ppaddr = PL_ppaddr[type];
2161 unop->op_first = first;
2162 unop->op_flags = flags | OPf_KIDS;
2163 unop->op_private = 1 | (flags >> 8);
2164 unop = (UNOP*) CHECKOP(type, unop);
2168 return fold_constants((OP *) unop);
2172 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2175 NewOp(1101, binop, 1, BINOP);
2178 first = newOP(OP_NULL, 0);
2180 binop->op_type = type;
2181 binop->op_ppaddr = PL_ppaddr[type];
2182 binop->op_first = first;
2183 binop->op_flags = flags | OPf_KIDS;
2186 binop->op_private = 1 | (flags >> 8);
2189 binop->op_private = 2 | (flags >> 8);
2190 first->op_sibling = last;
2193 binop = (BINOP*)CHECKOP(type, binop);
2197 binop->op_last = binop->op_first->op_sibling;
2199 return fold_constants((OP *)binop);
2203 utf8compare(const void *a, const void *b)
2206 for (i = 0; i < 10; i++) {
2207 if ((*(U8**)a)[i] < (*(U8**)b)[i])
2209 if ((*(U8**)a)[i] > (*(U8**)b)[i])
2216 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2218 SV *tstr = ((SVOP*)expr)->op_sv;
2219 SV *rstr = ((SVOP*)repl)->op_sv;
2222 register U8 *t = (U8*)SvPV(tstr, tlen);
2223 register U8 *r = (U8*)SvPV(rstr, rlen);
2229 register short *tbl;
2231 complement = o->op_private & OPpTRANS_COMPLEMENT;
2232 del = o->op_private & OPpTRANS_DELETE;
2233 squash = o->op_private & OPpTRANS_SQUASH;
2235 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2236 SV* listsv = newSVpvn("# comment\n",10);
2238 U8* tend = t + tlen;
2239 U8* rend = r + rlen;
2255 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2256 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2262 New(1109, cp, tlen, U8*);
2264 transv = newSVpvn("",0);
2273 qsort(cp, i, sizeof(U8*), utf8compare);
2274 for (j = 0; j < i; j++) {
2276 UV val = utf8_to_uv(s, &ulen);
2278 diff = val - nextmin;
2280 t = uv_to_utf8(tmpbuf,nextmin);
2281 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2283 t = uv_to_utf8(tmpbuf, val - 1);
2284 sv_catpvn(transv, "\377", 1);
2285 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2289 val = utf8_to_uv(s+1, &ulen);
2293 t = uv_to_utf8(tmpbuf,nextmin);
2294 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2295 t = uv_to_utf8(tmpbuf, 0x7fffffff);
2296 sv_catpvn(transv, "\377", 1);
2297 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2298 t = (U8*)SvPVX(transv);
2299 tlen = SvCUR(transv);
2302 else if (!rlen && !del) {
2303 r = t; rlen = tlen; rend = tend;
2306 if (to_utf && from_utf) { /* only counting characters */
2307 if (t == r || (tlen == rlen && memEQ(t, r, tlen)))
2308 o->op_private |= OPpTRANS_IDENTICAL;
2310 else { /* straight latin-1 translation */
2311 if (tlen == 4 && memEQ(t, "\0\377\303\277", 4) &&
2312 rlen == 4 && memEQ(r, "\0\377\303\277", 4))
2313 o->op_private |= OPpTRANS_IDENTICAL;
2317 while (t < tend || tfirst <= tlast) {
2318 /* see if we need more "t" chars */
2319 if (tfirst > tlast) {
2320 tfirst = (I32)utf8_to_uv(t, &ulen);
2322 if (t < tend && *t == 0xff) { /* illegal utf8 val indicates range */
2323 tlast = (I32)utf8_to_uv(++t, &ulen);
2330 /* now see if we need more "r" chars */
2331 if (rfirst > rlast) {
2333 rfirst = (I32)utf8_to_uv(r, &ulen);
2335 if (r < rend && *r == 0xff) { /* illegal utf8 val indicates range */
2336 rlast = (I32)utf8_to_uv(++r, &ulen);
2345 rfirst = rlast = 0xffffffff;
2349 /* now see which range will peter our first, if either. */
2350 tdiff = tlast - tfirst;
2351 rdiff = rlast - rfirst;
2358 if (rfirst == 0xffffffff) {
2359 diff = tdiff; /* oops, pretend rdiff is infinite */
2361 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\tXXXX\n", tfirst, tlast);
2363 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\tXXXX\n", tfirst);
2367 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\t%04x\n", tfirst, tfirst + diff, rfirst);
2369 Perl_sv_catpvf(aTHX_ listsv, "%04x\t\t%04x\n", tfirst, rfirst);
2371 if (rfirst + diff > max)
2372 max = rfirst + diff;
2377 else if (rfirst <= 0x800)
2378 grows |= (tfirst < 0x80);
2379 else if (rfirst <= 0x10000)
2380 grows |= (tfirst < 0x800);
2381 else if (rfirst <= 0x200000)
2382 grows |= (tfirst < 0x10000);
2383 else if (rfirst <= 0x4000000)
2384 grows |= (tfirst < 0x200000);
2385 else if (rfirst <= 0x80000000)
2386 grows |= (tfirst < 0x4000000);
2398 else if (max > 0xff)
2403 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2404 SvREFCNT_dec(listsv);
2406 SvREFCNT_dec(transv);
2408 if (!del && havefinal)
2409 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5, newSViv((IV)final), 0);
2411 if (grows && to_utf)
2412 o->op_private |= OPpTRANS_GROWS;
2419 tbl = (short*)cPVOPo->op_pv;
2421 Zero(tbl, 256, short);
2422 for (i = 0; i < tlen; i++)
2424 for (i = 0, j = 0; i < 256; i++) {
2440 if (!rlen && !del) {
2443 o->op_private |= OPpTRANS_IDENTICAL;
2445 for (i = 0; i < 256; i++)
2447 for (i = 0, j = 0; i < tlen; i++,j++) {
2450 if (tbl[t[i]] == -1)
2456 if (tbl[t[i]] == -1)
2467 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2472 NewOp(1101, pmop, 1, PMOP);
2473 pmop->op_type = type;
2474 pmop->op_ppaddr = PL_ppaddr[type];
2475 pmop->op_flags = flags;
2476 pmop->op_private = 0 | (flags >> 8);
2478 if (PL_hints & HINT_RE_TAINT)
2479 pmop->op_pmpermflags |= PMf_RETAINT;
2480 if (PL_hints & HINT_LOCALE)
2481 pmop->op_pmpermflags |= PMf_LOCALE;
2482 pmop->op_pmflags = pmop->op_pmpermflags;
2484 /* link into pm list */
2485 if (type != OP_TRANS && PL_curstash) {
2486 pmop->op_pmnext = HvPMROOT(PL_curstash);
2487 HvPMROOT(PL_curstash) = pmop;
2494 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2499 I32 repl_has_vars = 0;
2501 if (o->op_type == OP_TRANS)
2502 return pmtrans(o, expr, repl);
2504 PL_hints |= HINT_BLOCK_SCOPE;
2507 if (expr->op_type == OP_CONST) {
2509 SV *pat = ((SVOP*)expr)->op_sv;
2510 char *p = SvPV(pat, plen);
2511 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2512 sv_setpvn(pat, "\\s+", 3);
2513 p = SvPV(pat, plen);
2514 pm->op_pmflags |= PMf_SKIPWHITE;
2516 pm->op_pmregexp = CALLREGCOMP(aTHX_ p, p + plen, pm);
2517 if (strEQ("\\s+", pm->op_pmregexp->precomp))
2518 pm->op_pmflags |= PMf_WHITE;
2522 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2523 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2525 : OP_REGCMAYBE),0,expr);
2527 NewOp(1101, rcop, 1, LOGOP);
2528 rcop->op_type = OP_REGCOMP;
2529 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2530 rcop->op_first = scalar(expr);
2531 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2532 ? (OPf_SPECIAL | OPf_KIDS)
2534 rcop->op_private = 1;
2537 /* establish postfix order */
2538 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2540 rcop->op_next = expr;
2541 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2544 rcop->op_next = LINKLIST(expr);
2545 expr->op_next = (OP*)rcop;
2548 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2553 if (pm->op_pmflags & PMf_EVAL) {
2555 if (PL_curcop->cop_line < PL_multi_end)
2556 PL_curcop->cop_line = PL_multi_end;
2559 else if (repl->op_type == OP_THREADSV
2560 && strchr("&`'123456789+",
2561 PL_threadsv_names[repl->op_targ]))
2565 #endif /* USE_THREADS */
2566 else if (repl->op_type == OP_CONST)
2570 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2571 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2573 if (curop->op_type == OP_THREADSV) {
2575 if (strchr("&`'123456789+", curop->op_private))
2579 if (curop->op_type == OP_GV) {
2580 GV *gv = ((GVOP*)curop)->op_gv;
2582 if (strchr("&`'123456789+", *GvENAME(gv)))
2585 #endif /* USE_THREADS */
2586 else if (curop->op_type == OP_RV2CV)
2588 else if (curop->op_type == OP_RV2SV ||
2589 curop->op_type == OP_RV2AV ||
2590 curop->op_type == OP_RV2HV ||
2591 curop->op_type == OP_RV2GV) {
2592 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2595 else if (curop->op_type == OP_PADSV ||
2596 curop->op_type == OP_PADAV ||
2597 curop->op_type == OP_PADHV ||
2598 curop->op_type == OP_PADANY) {
2601 else if (curop->op_type == OP_PUSHRE)
2602 ; /* Okay here, dangerous in newASSIGNOP */
2611 && (!pm->op_pmregexp
2612 || pm->op_pmregexp->reganch & ROPT_EVAL_SEEN))) {
2613 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2614 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2615 prepend_elem(o->op_type, scalar(repl), o);
2618 if (curop == repl && !pm->op_pmregexp) { /* Has variables. */
2619 pm->op_pmflags |= PMf_MAYBE_CONST;
2620 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2622 NewOp(1101, rcop, 1, LOGOP);
2623 rcop->op_type = OP_SUBSTCONT;
2624 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2625 rcop->op_first = scalar(repl);
2626 rcop->op_flags |= OPf_KIDS;
2627 rcop->op_private = 1;
2630 /* establish postfix order */
2631 rcop->op_next = LINKLIST(repl);
2632 repl->op_next = (OP*)rcop;
2634 pm->op_pmreplroot = scalar((OP*)rcop);
2635 pm->op_pmreplstart = LINKLIST(rcop);
2644 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2647 NewOp(1101, svop, 1, SVOP);
2648 svop->op_type = type;
2649 svop->op_ppaddr = PL_ppaddr[type];
2651 svop->op_next = (OP*)svop;
2652 svop->op_flags = flags;
2653 if (PL_opargs[type] & OA_RETSCALAR)
2655 if (PL_opargs[type] & OA_TARGET)
2656 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2657 return CHECKOP(type, svop);
2661 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2665 NewOp(1101, gvop, 1, GVOP);
2666 gvop->op_type = type;
2667 gvop->op_ppaddr = PL_ppaddr[type];
2668 gvop->op_gv = (GV*)SvREFCNT_inc(gv);
2669 gvop->op_next = (OP*)gvop;
2670 gvop->op_flags = flags;
2671 if (PL_opargs[type] & OA_RETSCALAR)
2673 if (PL_opargs[type] & OA_TARGET)
2674 gvop->op_targ = pad_alloc(type, SVs_PADTMP);
2675 return CHECKOP(type, gvop);
2679 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2682 NewOp(1101, pvop, 1, PVOP);
2683 pvop->op_type = type;
2684 pvop->op_ppaddr = PL_ppaddr[type];
2686 pvop->op_next = (OP*)pvop;
2687 pvop->op_flags = flags;
2688 if (PL_opargs[type] & OA_RETSCALAR)
2690 if (PL_opargs[type] & OA_TARGET)
2691 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2692 return CHECKOP(type, pvop);
2696 Perl_package(pTHX_ OP *o)
2701 save_hptr(&PL_curstash);
2702 save_item(PL_curstname);
2707 name = SvPV(sv, len);
2708 PL_curstash = gv_stashpvn(name,len,TRUE);
2709 sv_setpvn(PL_curstname, name, len);
2713 sv_setpv(PL_curstname,"<none>");
2714 PL_curstash = Nullhv;
2716 PL_hints |= HINT_BLOCK_SCOPE;
2717 PL_copline = NOLINE;
2722 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *id, OP *arg)
2731 if (id->op_type != OP_CONST)
2732 Perl_croak(aTHX_ "Module name must be constant");
2736 if(version != Nullop) {
2737 SV *vesv = ((SVOP*)version)->op_sv;
2739 if (arg == Nullop && !SvNIOK(vesv)) {
2746 if (version->op_type != OP_CONST || !SvNIOK(vesv))
2747 Perl_croak(aTHX_ "Version number must be constant number");
2749 /* Make copy of id so we don't free it twice */
2750 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2752 /* Fake up a method call to VERSION */
2753 meth = newSVOP(OP_CONST, 0, newSVpvn("VERSION", 7));
2754 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2755 append_elem(OP_LIST,
2756 prepend_elem(OP_LIST, pack, list(version)),
2757 newUNOP(OP_METHOD, 0, meth)));
2761 /* Fake up an import/unimport */
2762 if (arg && arg->op_type == OP_STUB)
2763 imop = arg; /* no import on explicit () */
2764 else if(SvNIOK(((SVOP*)id)->op_sv)) {
2765 imop = Nullop; /* use 5.0; */
2768 /* Make copy of id so we don't free it twice */
2769 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)id)->op_sv));
2770 meth = newSVOP(OP_CONST, 0,
2772 ? newSVpvn("import", 6)
2773 : newSVpvn("unimport", 8)
2775 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2776 append_elem(OP_LIST,
2777 prepend_elem(OP_LIST, pack, list(arg)),
2778 newUNOP(OP_METHOD, 0, meth)));
2781 /* Fake up a require, handle override, if any */
2782 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
2783 if (!(gv && GvIMPORTED_CV(gv)))
2784 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
2786 if (gv && GvIMPORTED_CV(gv)) {
2787 rqop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2788 append_elem(OP_LIST, id,
2789 scalar(newUNOP(OP_RV2CV, 0,
2794 rqop = newUNOP(OP_REQUIRE, 0, id);
2797 /* Fake up the BEGIN {}, which does its thing immediately. */
2799 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2801 append_elem(OP_LINESEQ,
2802 append_elem(OP_LINESEQ,
2803 newSTATEOP(0, Nullch, rqop),
2804 newSTATEOP(0, Nullch, veop)),
2805 newSTATEOP(0, Nullch, imop) ));
2807 PL_copline = NOLINE;
2812 Perl_dofile(pTHX_ OP *term)
2817 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
2818 if (!(gv && GvIMPORTED_CV(gv)))
2819 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
2821 if (gv && GvIMPORTED_CV(gv)) {
2822 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
2823 append_elem(OP_LIST, term,
2824 scalar(newUNOP(OP_RV2CV, 0,
2829 doop = newUNOP(OP_DOFILE, 0, scalar(term));
2835 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
2837 return newBINOP(OP_LSLICE, flags,
2838 list(force_list(subscript)),
2839 list(force_list(listval)) );
2843 S_list_assignment(pTHX_ register OP *o)
2848 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
2849 o = cUNOPo->op_first;
2851 if (o->op_type == OP_COND_EXPR) {
2852 I32 t = list_assignment(cCONDOPo->op_first->op_sibling);
2853 I32 f = list_assignment(cCONDOPo->op_first->op_sibling->op_sibling);
2858 yyerror("Assignment to both a list and a scalar");
2862 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
2863 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
2864 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
2867 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
2870 if (o->op_type == OP_RV2SV)
2877 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
2882 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN) {
2883 return newLOGOP(optype, 0,
2884 mod(scalar(left), optype),
2885 newUNOP(OP_SASSIGN, 0, scalar(right)));
2888 return newBINOP(optype, OPf_STACKED,
2889 mod(scalar(left), optype), scalar(right));
2893 if (list_assignment(left)) {
2896 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
2897 left = mod(left, OP_AASSIGN);
2905 o = newBINOP(OP_AASSIGN, flags,
2906 list(force_list(right)),
2907 list(force_list(left)) );
2908 o->op_private = 0 | (flags >> 8);
2909 if (!(left->op_private & OPpLVAL_INTRO)) {
2913 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2914 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2915 if (curop->op_type == OP_GV) {
2916 GV *gv = ((GVOP*)curop)->op_gv;
2917 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2919 SvCUR(gv) = PL_generation;
2921 else if (curop->op_type == OP_PADSV ||
2922 curop->op_type == OP_PADAV ||
2923 curop->op_type == OP_PADHV ||
2924 curop->op_type == OP_PADANY) {
2925 SV **svp = AvARRAY(PL_comppad_name);
2926 SV *sv = svp[curop->op_targ];
2927 if (SvCUR(sv) == PL_generation)
2929 SvCUR(sv) = PL_generation; /* (SvCUR not used any more) */
2931 else if (curop->op_type == OP_RV2CV)
2933 else if (curop->op_type == OP_RV2SV ||
2934 curop->op_type == OP_RV2AV ||
2935 curop->op_type == OP_RV2HV ||
2936 curop->op_type == OP_RV2GV) {
2937 if (lastop->op_type != OP_GV) /* funny deref? */
2940 else if (curop->op_type == OP_PUSHRE) {
2941 if (((PMOP*)curop)->op_pmreplroot) {
2942 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
2943 if (gv == PL_defgv || SvCUR(gv) == PL_generation)
2945 SvCUR(gv) = PL_generation;
2954 o->op_private = OPpASSIGN_COMMON;
2956 if (right && right->op_type == OP_SPLIT) {
2958 if ((tmpop = ((LISTOP*)right)->op_first) &&
2959 tmpop->op_type == OP_PUSHRE)
2961 PMOP *pm = (PMOP*)tmpop;
2962 if (left->op_type == OP_RV2AV &&
2963 !(left->op_private & OPpLVAL_INTRO) &&
2964 !(o->op_private & OPpASSIGN_COMMON) )
2966 tmpop = ((UNOP*)left)->op_first;
2967 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
2968 pm->op_pmreplroot = (OP*)((GVOP*)tmpop)->op_gv;
2969 pm->op_pmflags |= PMf_ONCE;
2970 tmpop = cUNOPo->op_first; /* to list (nulled) */
2971 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
2972 tmpop->op_sibling = Nullop; /* don't free split */
2973 right->op_next = tmpop->op_next; /* fix starting loc */
2974 op_free(o); /* blow off assign */
2975 right->op_flags &= ~OPf_WANT;
2976 /* "I don't know and I don't care." */
2981 if (PL_modcount < 10000 &&
2982 ((LISTOP*)right)->op_last->op_type == OP_CONST)
2984 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
2986 sv_setiv(sv, PL_modcount+1);
2994 right = newOP(OP_UNDEF, 0);
2995 if (right->op_type == OP_READLINE) {
2996 right->op_flags |= OPf_STACKED;
2997 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3000 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3001 o = newBINOP(OP_SASSIGN, flags,
3002 scalar(right), mod(scalar(left), OP_SASSIGN) );
3014 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3017 U32 seq = intro_my();
3020 NewOp(1101, cop, 1, COP);
3021 if (PERLDB_LINE && PL_curcop->cop_line && PL_curstash != PL_debstash) {
3022 cop->op_type = OP_DBSTATE;
3023 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3026 cop->op_type = OP_NEXTSTATE;
3027 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3029 cop->op_flags = flags;
3030 cop->op_private = (PL_hints & HINT_UTF8);
3032 cop->op_private |= NATIVE_HINTS;
3034 PL_compiling.op_private = cop->op_private;
3035 cop->op_next = (OP*)cop;
3038 cop->cop_label = label;
3039 PL_hints |= HINT_BLOCK_SCOPE;
3042 cop->cop_arybase = PL_curcop->cop_arybase;
3043 if (PL_curcop->cop_warnings == WARN_NONE
3044 || PL_curcop->cop_warnings == WARN_ALL)
3045 cop->cop_warnings = PL_curcop->cop_warnings ;
3047 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3050 if (PL_copline == NOLINE)
3051 cop->cop_line = PL_curcop->cop_line;
3053 cop->cop_line = PL_copline;
3054 PL_copline = NOLINE;
3056 cop->cop_filegv = (GV*)SvREFCNT_inc(PL_curcop->cop_filegv);
3057 cop->cop_stash = PL_curstash;
3059 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3060 SV **svp = av_fetch(GvAV(PL_curcop->cop_filegv),(I32)cop->cop_line, FALSE);
3061 if (svp && *svp != &PL_sv_undef && !SvIOK(*svp)) {
3062 (void)SvIOK_on(*svp);
3064 SvSTASH(*svp) = (HV*)cop;
3068 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3071 /* "Introduce" my variables to visible status. */
3079 if (! PL_min_intro_pending)
3080 return PL_cop_seqmax;
3082 svp = AvARRAY(PL_comppad_name);
3083 for (i = PL_min_intro_pending; i <= PL_max_intro_pending; i++) {
3084 if ((sv = svp[i]) && sv != &PL_sv_undef && !SvIVX(sv)) {
3085 SvIVX(sv) = PAD_MAX; /* Don't know scope end yet. */
3086 SvNVX(sv) = (double)PL_cop_seqmax;
3089 PL_min_intro_pending = 0;
3090 PL_comppad_name_fill = PL_max_intro_pending; /* Needn't search higher */
3091 return PL_cop_seqmax++;
3095 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3097 return new_logop(type, flags, &first, &other);
3101 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3106 OP *first = *firstp;
3107 OP *other = *otherp;
3109 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3110 return newBINOP(type, flags, scalar(first), scalar(other));
3112 scalarboolean(first);
3113 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3114 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3115 if (type == OP_AND || type == OP_OR) {
3121 first = *firstp = cUNOPo->op_first;
3123 first->op_next = o->op_next;
3124 cUNOPo->op_first = Nullop;
3128 if (first->op_type == OP_CONST) {
3129 if (ckWARN(WARN_PRECEDENCE) && (first->op_private & OPpCONST_BARE))
3130 Perl_warner(aTHX_ WARN_PRECEDENCE, "Probable precedence problem on %s",
3132 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3143 else if (first->op_type == OP_WANTARRAY) {
3149 else if (ckWARN(WARN_UNSAFE) && (first->op_flags & OPf_KIDS)) {
3150 OP *k1 = ((UNOP*)first)->op_first;
3151 OP *k2 = k1->op_sibling;
3153 switch (first->op_type)
3156 if (k2 && k2->op_type == OP_READLINE
3157 && (k2->op_flags & OPf_STACKED)
3158 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3159 warnop = k2->op_type;
3163 if (k1->op_type == OP_READDIR
3164 || k1->op_type == OP_GLOB
3165 || k1->op_type == OP_EACH)
3166 warnop = k1->op_type;
3170 line_t oldline = PL_curcop->cop_line;
3171 PL_curcop->cop_line = PL_copline;
3172 Perl_warner(aTHX_ WARN_UNSAFE,
3173 "Value of %s%s can be \"0\"; test with defined()",
3175 ((warnop == OP_READLINE || warnop == OP_GLOB)
3176 ? " construct" : "() operator"));
3177 PL_curcop->cop_line = oldline;
3184 if (type == OP_ANDASSIGN || type == OP_ORASSIGN)
3185 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3187 NewOp(1101, logop, 1, LOGOP);
3189 logop->op_type = type;
3190 logop->op_ppaddr = PL_ppaddr[type];
3191 logop->op_first = first;
3192 logop->op_flags = flags | OPf_KIDS;
3193 logop->op_other = LINKLIST(other);
3194 logop->op_private = 1 | (flags >> 8);
3196 /* establish postfix order */
3197 logop->op_next = LINKLIST(first);
3198 first->op_next = (OP*)logop;
3199 first->op_sibling = other;
3201 o = newUNOP(OP_NULL, 0, (OP*)logop);
3208 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3215 return newLOGOP(OP_AND, 0, first, trueop);
3217 return newLOGOP(OP_OR, 0, first, falseop);
3219 scalarboolean(first);
3220 if (first->op_type == OP_CONST) {
3221 if (SvTRUE(((SVOP*)first)->op_sv)) {
3232 else if (first->op_type == OP_WANTARRAY) {
3236 NewOp(1101, condop, 1, CONDOP);
3238 condop->op_type = OP_COND_EXPR;
3239 condop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3240 condop->op_first = first;
3241 condop->op_flags = flags | OPf_KIDS;
3242 condop->op_true = LINKLIST(trueop);
3243 condop->op_false = LINKLIST(falseop);
3244 condop->op_private = 1 | (flags >> 8);
3246 /* establish postfix order */
3247 condop->op_next = LINKLIST(first);
3248 first->op_next = (OP*)condop;
3250 first->op_sibling = trueop;
3251 trueop->op_sibling = falseop;
3252 o = newUNOP(OP_NULL, 0, (OP*)condop);
3254 trueop->op_next = o;
3255 falseop->op_next = o;
3261 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3269 NewOp(1101, condop, 1, CONDOP);
3271 condop->op_type = OP_RANGE;
3272 condop->op_ppaddr = PL_ppaddr[OP_RANGE];
3273 condop->op_first = left;
3274 condop->op_flags = OPf_KIDS;
3275 condop->op_true = LINKLIST(left);
3276 condop->op_false = LINKLIST(right);
3277 condop->op_private = 1 | (flags >> 8);
3279 left->op_sibling = right;
3281 condop->op_next = (OP*)condop;
3282 flip = newUNOP(OP_FLIP, flags, (OP*)condop);
3283 flop = newUNOP(OP_FLOP, 0, flip);
3284 o = newUNOP(OP_NULL, 0, flop);
3287 left->op_next = flip;
3288 right->op_next = flop;
3290 condop->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3291 sv_upgrade(PAD_SV(condop->op_targ), SVt_PVNV);
3292 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3293 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3295 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3296 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3299 if (!flip->op_private || !flop->op_private)
3300 linklist(o); /* blow off optimizer unless constant */
3306 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3311 int once = block && block->op_flags & OPf_SPECIAL &&
3312 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3315 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3316 return block; /* do {} while 0 does once */
3317 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3318 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3319 expr = newUNOP(OP_DEFINED, 0,
3320 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3321 } else if (expr->op_flags & OPf_KIDS) {
3322 OP *k1 = ((UNOP*)expr)->op_first;
3323 OP *k2 = (k1) ? k1->op_sibling : NULL;
3324 switch (expr->op_type) {
3326 if (k2 && k2->op_type == OP_READLINE
3327 && (k2->op_flags & OPf_STACKED)
3328 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3329 expr = newUNOP(OP_DEFINED, 0, expr);
3333 if (k1->op_type == OP_READDIR
3334 || k1->op_type == OP_GLOB
3335 || k1->op_type == OP_EACH)
3336 expr = newUNOP(OP_DEFINED, 0, expr);
3342 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3343 o = new_logop(OP_AND, 0, &expr, &listop);
3346 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3348 if (once && o != listop)
3349 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3352 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3354 o->op_flags |= flags;
3356 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3361 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3370 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3371 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3372 expr = newUNOP(OP_DEFINED, 0,
3373 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3374 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3375 OP *k1 = ((UNOP*)expr)->op_first;
3376 OP *k2 = (k1) ? k1->op_sibling : NULL;
3377 switch (expr->op_type) {
3379 if (k2 && k2->op_type == OP_READLINE
3380 && (k2->op_flags & OPf_STACKED)
3381 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3382 expr = newUNOP(OP_DEFINED, 0, expr);
3386 if (k1->op_type == OP_READDIR
3387 || k1->op_type == OP_GLOB
3388 || k1->op_type == OP_EACH)
3389 expr = newUNOP(OP_DEFINED, 0, expr);
3395 block = newOP(OP_NULL, 0);
3398 next = LINKLIST(cont);
3400 cont = append_elem(OP_LINESEQ, cont, newOP(OP_UNSTACK, 0));
3401 if ((line_t)whileline != NOLINE) {
3402 PL_copline = whileline;
3403 cont = append_elem(OP_LINESEQ, cont,
3404 newSTATEOP(0, Nullch, Nullop));
3408 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3409 redo = LINKLIST(listop);
3412 PL_copline = whileline;
3414 o = new_logop(OP_AND, 0, &expr, &listop);
3415 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3416 op_free(expr); /* oops, it's a while (0) */
3418 return Nullop; /* listop already freed by new_logop */
3421 ((LISTOP*)listop)->op_last->op_next = condop =
3422 (o == listop ? redo : LINKLIST(o));
3430 NewOp(1101,loop,1,LOOP);
3431 loop->op_type = OP_ENTERLOOP;
3432 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3433 loop->op_private = 0;
3434 loop->op_next = (OP*)loop;
3437 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3439 loop->op_redoop = redo;
3440 loop->op_lastop = o;
3443 loop->op_nextop = next;
3445 loop->op_nextop = o;
3447 o->op_flags |= flags;
3448 o->op_private |= (flags >> 8);
3453 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3462 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3463 sv->op_type = OP_RV2GV;
3464 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3466 else if (sv->op_type == OP_PADSV) { /* private variable */
3467 padoff = sv->op_targ;
3471 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3472 padoff = sv->op_targ;
3473 iterflags |= OPf_SPECIAL;
3478 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3482 padoff = find_threadsv("_");
3483 iterflags |= OPf_SPECIAL;
3485 sv = newGVOP(OP_GV, 0, PL_defgv);
3488 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3489 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3490 iterflags |= OPf_STACKED;
3492 else if (expr->op_type == OP_NULL &&
3493 (expr->op_flags & OPf_KIDS) &&
3494 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3496 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3497 * set the STACKED flag to indicate that these values are to be
3498 * treated as min/max values by 'pp_iterinit'.
3500 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3501 CONDOP* range = (CONDOP*) flip->op_first;
3502 OP* left = range->op_first;
3503 OP* right = left->op_sibling;
3506 range->op_flags &= ~OPf_KIDS;
3507 range->op_first = Nullop;
3509 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3510 listop->op_first->op_next = range->op_true;
3511 left->op_next = range->op_false;
3512 right->op_next = (OP*)listop;
3513 listop->op_next = listop->op_first;
3516 expr = (OP*)(listop);
3518 iterflags |= OPf_STACKED;
3521 expr = mod(force_list(expr), OP_GREPSTART);
3525 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3526 append_elem(OP_LIST, expr, scalar(sv))));
3527 assert(!loop->op_next);
3528 #ifdef PL_OP_SLAB_ALLOC
3529 NewOp(1234,tmp,1,LOOP);
3530 Copy(loop,tmp,1,LOOP);
3533 Renew(loop, 1, LOOP);
3535 loop->op_targ = padoff;
3536 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3537 PL_copline = forline;
3538 return newSTATEOP(0, label, wop);
3542 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3548 if (type != OP_GOTO || label->op_type == OP_CONST) {
3549 /* "last()" means "last" */
3550 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3551 o = newOP(type, OPf_SPECIAL);
3553 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3554 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3560 if (label->op_type == OP_ENTERSUB)
3561 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3562 o = newUNOP(type, OPf_STACKED, label);
3564 PL_hints |= HINT_BLOCK_SCOPE;
3569 Perl_cv_undef(pTHX_ CV *cv)
3574 MUTEX_DESTROY(CvMUTEXP(cv));
3575 Safefree(CvMUTEXP(cv));
3578 #endif /* USE_THREADS */
3580 if (!CvXSUB(cv) && CvROOT(cv)) {
3582 if (CvDEPTH(cv) || (CvOWNER(cv) && CvOWNER(cv) != thr))
3583 Perl_croak(aTHX_ "Can't undef active subroutine");
3586 Perl_croak(aTHX_ "Can't undef active subroutine");
3587 #endif /* USE_THREADS */
3590 SAVESPTR(PL_curpad);
3594 op_free(CvROOT(cv));
3595 CvROOT(cv) = Nullop;
3598 SvPOK_off((SV*)cv); /* forget prototype */
3600 SvREFCNT_dec(CvGV(cv));
3602 SvREFCNT_dec(CvOUTSIDE(cv));
3603 CvOUTSIDE(cv) = Nullcv;
3604 if (CvPADLIST(cv)) {
3605 /* may be during global destruction */
3606 if (SvREFCNT(CvPADLIST(cv))) {
3607 I32 i = AvFILLp(CvPADLIST(cv));
3609 SV** svp = av_fetch(CvPADLIST(cv), i--, FALSE);
3610 SV* sv = svp ? *svp : Nullsv;
3613 if (sv == (SV*)PL_comppad_name)
3614 PL_comppad_name = Nullav;
3615 else if (sv == (SV*)PL_comppad) {
3616 PL_comppad = Nullav;
3617 PL_curpad = Null(SV**);
3621 SvREFCNT_dec((SV*)CvPADLIST(cv));
3623 CvPADLIST(cv) = Nullav;
3627 #ifdef DEBUG_CLOSURES
3631 CV *outside = CvOUTSIDE(cv);
3632 AV* padlist = CvPADLIST(cv);
3639 PerlIO_printf(Perl_debug_log, "\tCV=0x%lx (%s), OUTSIDE=0x%lx (%s)\n",
3641 (CvANON(cv) ? "ANON"
3642 : (cv == PL_main_cv) ? "MAIN"
3643 : CvUNIQUE(cv) ? "UNIQUE"
3644 : CvGV(cv) ? GvNAME(CvGV(cv)) : "UNDEFINED"),
3647 : CvANON(outside) ? "ANON"
3648 : (outside == PL_main_cv) ? "MAIN"
3649 : CvUNIQUE(outside) ? "UNIQUE"
3650 : CvGV(outside) ? GvNAME(CvGV(outside)) : "UNDEFINED"));
3655 pad_name = (AV*)*av_fetch(padlist, 0, FALSE);
3656 pad = (AV*)*av_fetch(padlist, 1, FALSE);
3657 pname = AvARRAY(pad_name);
3658 ppad = AvARRAY(pad);
3660 for (ix = 1; ix <= AvFILLp(pad_name); ix++) {
3661 if (SvPOK(pname[ix]))
3662 PerlIO_printf(Perl_debug_log, "\t%4d. 0x%lx (%s\"%s\" %ld-%ld)\n",
3664 SvFAKE(pname[ix]) ? "FAKE " : "",
3666 (long)I_32(SvNVX(pname[ix])),
3667 (long)SvIVX(pname[ix]));
3670 #endif /* DEBUG_CLOSURES */
3673 S_cv_clone2(pTHX_ CV *proto, CV *outside)
3678 AV* protopadlist = CvPADLIST(proto);
3679 AV* protopad_name = (AV*)*av_fetch(protopadlist, 0, FALSE);
3680 AV* protopad = (AV*)*av_fetch(protopadlist, 1, FALSE);
3681 SV** pname = AvARRAY(protopad_name);
3682 SV** ppad = AvARRAY(protopad);
3683 I32 fname = AvFILLp(protopad_name);
3684 I32 fpad = AvFILLp(protopad);
3688 assert(!CvUNIQUE(proto));
3691 SAVESPTR(PL_curpad);
3692 SAVESPTR(PL_comppad);
3693 SAVESPTR(PL_comppad_name);
3694 SAVESPTR(PL_compcv);
3696 cv = PL_compcv = (CV*)NEWSV(1104,0);
3697 sv_upgrade((SV *)cv, SvTYPE(proto));
3703 New(666, CvMUTEXP(cv), 1, perl_mutex);
3704 MUTEX_INIT(CvMUTEXP(cv));
3706 #endif /* USE_THREADS */
3707 CvFILEGV(cv) = CvFILEGV(proto);
3708 CvGV(cv) = (GV*)SvREFCNT_inc(CvGV(proto));
3709 CvSTASH(cv) = CvSTASH(proto);
3710 CvROOT(cv) = CvROOT(proto);
3711 CvSTART(cv) = CvSTART(proto);
3713 CvOUTSIDE(cv) = (CV*)SvREFCNT_inc(outside);
3716 sv_setpvn((SV*)cv, SvPVX(proto), SvCUR(proto));
3718 PL_comppad_name = newAV();
3719 for (ix = fname; ix >= 0; ix--)
3720 av_store(PL_comppad_name, ix, SvREFCNT_inc(pname[ix]));
3722 PL_comppad = newAV();
3724 comppadlist = newAV();
3725 AvREAL_off(comppadlist);
3726 av_store(comppadlist, 0, (SV*)PL_comppad_name);
3727 av_store(comppadlist, 1, (SV*)PL_comppad);
3728 CvPADLIST(cv) = comppadlist;
3729 av_fill(PL_comppad, AvFILLp(protopad));
3730 PL_curpad = AvARRAY(PL_comppad);
3732 av = newAV(); /* will be @_ */
3734 av_store(PL_comppad, 0, (SV*)av);
3735 AvFLAGS(av) = AVf_REIFY;
3737 for (ix = fpad; ix > 0; ix--) {
3738 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3739 if (namesv && namesv != &PL_sv_undef) {
3740 char *name = SvPVX(namesv); /* XXX */
3741 if (SvFLAGS(namesv) & SVf_FAKE) { /* lexical from outside? */
3742 I32 off = pad_findlex(name, ix, SvIVX(namesv),
3743 CvOUTSIDE(cv), cxstack_ix, 0, 0);
3745 PL_curpad[ix] = SvREFCNT_inc(ppad[ix]);
3747 Perl_croak(aTHX_ "panic: cv_clone: %s", name);
3749 else { /* our own lexical */
3752 /* anon code -- we'll come back for it */
3753 sv = SvREFCNT_inc(ppad[ix]);
3755 else if (*name == '@')
3757 else if (*name == '%')
3767 SV* sv = NEWSV(0,0);
3773 /* Now that vars are all in place, clone nested closures. */
3775 for (ix = fpad; ix > 0; ix--) {
3776 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
3778 && namesv != &PL_sv_undef
3779 && !(SvFLAGS(namesv) & SVf_FAKE)
3780 && *SvPVX(namesv) == '&'
3781 && CvCLONE(ppad[ix]))
3783 CV *kid = cv_clone2((CV*)ppad[ix], cv);
3784 SvREFCNT_dec(ppad[ix]);
3787 PL_curpad[ix] = (SV*)kid;
3791 #ifdef DEBUG_CLOSURES
3792 PerlIO_printf(Perl_debug_log, "Cloned inside:\n");
3794 PerlIO_printf(Perl_debug_log, " from:\n");
3796 PerlIO_printf(Perl_debug_log, " to:\n");
3805 Perl_cv_clone(pTHX_ CV *proto)
3808 MUTEX_LOCK(&PL_cred_mutex); /* XXX create separate mutex */
3809 cv = cv_clone2(proto, CvOUTSIDE(proto));
3810 MUTEX_UNLOCK(&PL_cred_mutex); /* XXX create separate mutex */
3815 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3817 if ((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) {
3818 SV* msg = sv_newmortal();
3822 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3823 sv_setpv(msg, "Prototype mismatch:");
3825 Perl_sv_catpvf(aTHX_ msg, " sub %_", name);
3827 Perl_sv_catpvf(aTHX_ msg, " (%s)", SvPVX(cv));
3828 sv_catpv(msg, " vs ");
3830 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3832 sv_catpv(msg, "none");
3833 Perl_warn(aTHX_ "%_", msg);
3838 Perl_cv_const_sv(pTHX_ CV *cv)
3840 if (!cv || !SvPOK(cv) || SvCUR(cv))
3842 return op_const_sv(CvSTART(cv), cv);
3846 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3853 if(o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3854 o = cLISTOPo->op_first->op_sibling;
3856 for (; o; o = o->op_next) {
3857 OPCODE type = o->op_type;
3859 if(sv && o->op_next == o)
3861 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3863 if (type == OP_LEAVESUB || type == OP_RETURN)
3867 if (type == OP_CONST)
3869 else if (type == OP_PADSV && cv) {
3870 AV* padav = (AV*)(AvARRAY(CvPADLIST(cv))[1]);
3871 sv = padav ? AvARRAY(padav)[o->op_targ] : Nullsv;
3872 if (!sv || (!SvREADONLY(sv) && SvREFCNT(sv) > 1))
3884 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
3888 char *name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
3889 GV *gv = gv_fetchpv(name ? name : "__ANON__",
3890 GV_ADDMULTI | (block ? 0 : GV_NOINIT), SVt_PVCV);
3891 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
3900 if (SvTYPE(gv) != SVt_PVGV) { /* Prototype now, and had
3901 maximum a prototype before. */
3902 if (SvTYPE(gv) > SVt_NULL) {
3903 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1))
3904 Perl_warn(aTHX_ "Runaway prototype");
3905 cv_ckproto((CV*)gv, NULL, ps);
3908 sv_setpv((SV*)gv, ps);
3910 sv_setiv((SV*)gv, -1);
3911 SvREFCNT_dec(PL_compcv);
3912 cv = PL_compcv = NULL;
3913 PL_sub_generation++;
3917 if (!name || GvCVGEN(gv))
3919 else if (cv = GvCV(gv)) {
3920 cv_ckproto(cv, gv, ps);
3921 /* already defined (or promised)? */
3922 if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
3924 bool const_changed = TRUE;
3926 /* just a "sub foo;" when &foo is already defined */
3927 SAVEFREESV(PL_compcv);
3930 /* ahem, death to those who redefine active sort subs */
3931 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
3932 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
3933 if(const_sv = cv_const_sv(cv))
3934 const_changed = sv_cmp(const_sv, op_const_sv(block, Nullcv));
3935 if ((const_sv && const_changed) || ckWARN(WARN_REDEFINE)
3936 && !(CvGV(cv) && GvSTASH(CvGV(cv))
3937 && HvNAME(GvSTASH(CvGV(cv)))
3938 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
3940 line_t oldline = PL_curcop->cop_line;
3941 PL_curcop->cop_line = PL_copline;
3942 Perl_warner(aTHX_ WARN_REDEFINE,
3943 const_sv ? "Constant subroutine %s redefined"
3944 : "Subroutine %s redefined", name);
3945 PL_curcop->cop_line = oldline;
3951 if (cv) { /* must reuse cv if autoloaded */
3953 CvFLAGS(cv) = CvFLAGS(PL_compcv);
3954 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
3955 CvOUTSIDE(PL_compcv) = 0;
3956 CvPADLIST(cv) = CvPADLIST(PL_compcv);
3957 CvPADLIST(PL_compcv) = 0;
3958 if (SvREFCNT(PL_compcv) > 1) /* XXX Make closures transit through stub. */
3959 CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc((SV*)cv);
3960 SvREFCNT_dec(PL_compcv);
3967 PL_sub_generation++;
3970 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
3971 CvFILEGV(cv) = PL_curcop->cop_filegv;
3972 CvSTASH(cv) = PL_curstash;
3975 if (!CvMUTEXP(cv)) {
3976 New(666, CvMUTEXP(cv), 1, perl_mutex);
3977 MUTEX_INIT(CvMUTEXP(cv));
3979 #endif /* USE_THREADS */
3982 sv_setpv((SV*)cv, ps);
3984 if (PL_error_count) {
3988 char *s = strrchr(name, ':');
3990 if (strEQ(s, "BEGIN")) {
3992 "BEGIN not safe after errors--compilation aborted";
3993 if (PL_in_eval & EVAL_KEEPERR)
3994 Perl_croak(aTHX_ not_safe);
3996 /* force display of errors found but not reported */
3997 sv_catpv(ERRSV, not_safe);
3998 Perl_croak(aTHX_ "%s", SvPVx(ERRSV, n_a));
4005 PL_copline = NOLINE;
4010 if (AvFILLp(PL_comppad_name) < AvFILLp(PL_comppad))
4011 av_store(PL_comppad_name, AvFILLp(PL_comppad), Nullsv);
4014 SV **namep = AvARRAY(PL_comppad_name);
4015 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4018 if (SvIMMORTAL(PL_curpad[ix]))
4021 * The only things that a clonable function needs in its
4022 * pad are references to outer lexicals and anonymous subs.
4023 * The rest are created anew during cloning.
4025 if (!((namesv = namep[ix]) != Nullsv &&
4026 namesv != &PL_sv_undef &&
4028 *SvPVX(namesv) == '&')))
4030 SvREFCNT_dec(PL_curpad[ix]);
4031 PL_curpad[ix] = Nullsv;
4036 AV *av = newAV(); /* Will be @_ */
4038 av_store(PL_comppad, 0, (SV*)av);
4039 AvFLAGS(av) = AVf_REIFY;
4041 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4042 if (SvIMMORTAL(PL_curpad[ix]))
4044 if (!SvPADMY(PL_curpad[ix]))
4045 SvPADTMP_on(PL_curpad[ix]);
4049 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4050 CvSTART(cv) = LINKLIST(CvROOT(cv));
4051 CvROOT(cv)->op_next = 0;
4057 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4058 SV *sv = NEWSV(0,0);
4059 SV *tmpstr = sv_newmortal();
4060 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4064 Perl_sv_setpvf(aTHX_ sv, "%_:%ld-%ld",
4065 GvSV(PL_curcop->cop_filegv),
4066 (long)PL_subline, (long)PL_curcop->cop_line);
4067 gv_efullname3(tmpstr, gv, Nullch);
4068 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4069 hv = GvHVn(db_postponed);
4070 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4071 && (cv = GvCV(db_postponed))) {
4076 call_sv((SV*)cv, G_DISCARD);
4080 if ((s = strrchr(name,':')))
4084 if (strEQ(s, "BEGIN")) {
4085 I32 oldscope = PL_scopestack_ix;
4087 SAVESPTR(PL_compiling.cop_filegv);
4088 SAVEI16(PL_compiling.cop_line);
4090 sv_setsv(PL_rs, PL_nrs);
4093 PL_beginav = newAV();
4094 DEBUG_x( dump_sub(gv) );
4095 av_push(PL_beginav, (SV *)cv);
4097 call_list(oldscope, PL_beginav);
4099 PL_curcop = &PL_compiling;
4100 PL_compiling.op_private = PL_hints;
4103 else if (strEQ(s, "END") && !PL_error_count) {
4106 av_unshift(PL_endav, 1);
4107 av_store(PL_endav, 0, (SV *)cv);
4110 else if (strEQ(s, "INIT") && !PL_error_count) {
4112 PL_initav = newAV();
4113 av_push(PL_initav, SvREFCNT_inc(cv));
4119 PL_copline = NOLINE;
4124 /* XXX unsafe for threads if eval_owner isn't held */
4126 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4129 U32 oldhints = PL_hints;
4130 HV *old_cop_stash = PL_curcop->cop_stash;
4131 HV *old_curstash = PL_curstash;
4132 line_t oldline = PL_curcop->cop_line;
4133 PL_curcop->cop_line = PL_copline;
4135 PL_hints &= ~HINT_BLOCK_SCOPE;
4137 PL_curstash = PL_curcop->cop_stash = stash;
4140 start_subparse(FALSE, 0),
4141 newSVOP(OP_CONST, 0, newSVpv(name,0)),
4142 newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */
4143 newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv))
4146 PL_hints = oldhints;
4147 PL_curcop->cop_stash = old_cop_stash;
4148 PL_curstash = old_curstash;
4149 PL_curcop->cop_line = oldline;
4153 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4156 GV *gv = gv_fetchpv(name ? name : "__ANON__", GV_ADDMULTI, SVt_PVCV);
4159 if (cv = (name ? GvCV(gv) : Nullcv)) {
4161 /* just a cached method */
4165 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4166 /* already defined (or promised) */
4167 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4168 && HvNAME(GvSTASH(CvGV(cv)))
4169 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4170 line_t oldline = PL_curcop->cop_line;
4171 if (PL_copline != NOLINE)
4172 PL_curcop->cop_line = PL_copline;
4173 Perl_warner(aTHX_ WARN_REDEFINE, "Subroutine %s redefined",name);
4174 PL_curcop->cop_line = oldline;
4181 if (cv) /* must reuse cv if autoloaded */
4184 cv = (CV*)NEWSV(1105,0);
4185 sv_upgrade((SV *)cv, SVt_PVCV);
4189 PL_sub_generation++;
4192 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4194 New(666, CvMUTEXP(cv), 1, perl_mutex);
4195 MUTEX_INIT(CvMUTEXP(cv));
4197 #endif /* USE_THREADS */
4198 CvFILEGV(cv) = gv_fetchfile(filename);
4199 CvXSUB(cv) = subaddr;
4202 char *s = strrchr(name,':');
4207 if (strEQ(s, "BEGIN")) {
4209 PL_beginav = newAV();
4210 av_push(PL_beginav, (SV *)cv);
4213 else if (strEQ(s, "END")) {
4216 av_unshift(PL_endav, 1);
4217 av_store(PL_endav, 0, (SV *)cv);
4220 else if (strEQ(s, "INIT")) {
4222 PL_initav = newAV();
4223 av_push(PL_initav, (SV *)cv);
4234 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4244 name = SvPVx(cSVOPo->op_sv, n_a);
4247 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4249 if (cv = GvFORM(gv)) {
4250 if (ckWARN(WARN_REDEFINE)) {
4251 line_t oldline = PL_curcop->cop_line;
4253 PL_curcop->cop_line = PL_copline;
4254 Perl_warner(aTHX_ WARN_REDEFINE, "Format %s redefined",name);
4255 PL_curcop->cop_line = oldline;
4261 CvGV(cv) = (GV*)SvREFCNT_inc(gv);
4262 CvFILEGV(cv) = PL_curcop->cop_filegv;
4264 for (ix = AvFILLp(PL_comppad); ix > 0; ix--) {
4265 if (!SvPADMY(PL_curpad[ix]) && !SvIMMORTAL(PL_curpad[ix]))
4266 SvPADTMP_on(PL_curpad[ix]);
4269 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4270 CvSTART(cv) = LINKLIST(CvROOT(cv));
4271 CvROOT(cv)->op_next = 0;
4274 PL_copline = NOLINE;
4279 Perl_newANONLIST(pTHX_ OP *o)
4281 return newUNOP(OP_REFGEN, 0,
4282 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4286 Perl_newANONHASH(pTHX_ OP *o)
4288 return newUNOP(OP_REFGEN, 0,
4289 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4293 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4295 return newUNOP(OP_REFGEN, 0,
4296 newSVOP(OP_ANONCODE, 0, (SV*)newSUB(floor, 0, proto, block)));
4300 Perl_oopsAV(pTHX_ OP *o)
4302 switch (o->op_type) {
4304 o->op_type = OP_PADAV;
4305 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4306 return ref(o, OP_RV2AV);
4309 o->op_type = OP_RV2AV;
4310 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4315 Perl_warn(aTHX_ "oops: oopsAV");
4322 Perl_oopsHV(pTHX_ OP *o)
4324 switch (o->op_type) {
4327 o->op_type = OP_PADHV;
4328 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4329 return ref(o, OP_RV2HV);
4333 o->op_type = OP_RV2HV;
4334 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4339 Perl_warn(aTHX_ "oops: oopsHV");
4346 Perl_newAVREF(pTHX_ OP *o)
4348 if (o->op_type == OP_PADANY) {
4349 o->op_type = OP_PADAV;
4350 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4353 return newUNOP(OP_RV2AV, 0, scalar(o));
4357 Perl_newGVREF(pTHX_ I32 type, OP *o)
4359 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4360 return newUNOP(OP_NULL, 0, o);
4361 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4365 Perl_newHVREF(pTHX_ OP *o)
4367 if (o->op_type == OP_PADANY) {
4368 o->op_type = OP_PADHV;
4369 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4372 return newUNOP(OP_RV2HV, 0, scalar(o));
4376 Perl_oopsCV(pTHX_ OP *o)
4378 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4384 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4386 return newUNOP(OP_RV2CV, flags, scalar(o));
4390 Perl_newSVREF(pTHX_ OP *o)
4392 if (o->op_type == OP_PADANY) {
4393 o->op_type = OP_PADSV;
4394 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4397 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4398 o->op_flags |= OPpDONE_SVREF;
4401 return newUNOP(OP_RV2SV, 0, scalar(o));
4404 /* Check routines. */
4407 Perl_ck_anoncode(pTHX_ OP *o)
4412 name = NEWSV(1106,0);
4413 sv_upgrade(name, SVt_PVNV);
4414 sv_setpvn(name, "&", 1);
4417 ix = pad_alloc(o->op_type, SVs_PADMY);
4418 av_store(PL_comppad_name, ix, name);
4419 av_store(PL_comppad, ix, cSVOPo->op_sv);
4420 SvPADMY_on(cSVOPo->op_sv);
4421 cSVOPo->op_sv = Nullsv;
4422 cSVOPo->op_targ = ix;
4427 Perl_ck_bitop(pTHX_ OP *o)
4429 o->op_private = PL_hints;
4434 Perl_ck_concat(pTHX_ OP *o)
4436 if (cUNOPo->op_first->op_type == OP_CONCAT)
4437 o->op_flags |= OPf_STACKED;
4442 Perl_ck_spair(pTHX_ OP *o)
4444 if (o->op_flags & OPf_KIDS) {
4447 OPCODE type = o->op_type;
4448 o = modkids(ck_fun(o), type);
4449 kid = cUNOPo->op_first;
4450 newop = kUNOP->op_first->op_sibling;
4452 (newop->op_sibling ||
4453 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4454 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4455 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4459 op_free(kUNOP->op_first);
4460 kUNOP->op_first = newop;
4462 o->op_ppaddr = PL_ppaddr[++o->op_type];
4467 Perl_ck_delete(pTHX_ OP *o)
4471 if (o->op_flags & OPf_KIDS) {
4472 OP *kid = cUNOPo->op_first;
4473 if (kid->op_type == OP_HSLICE)
4474 o->op_private |= OPpSLICE;
4475 else if (kid->op_type != OP_HELEM)
4476 Perl_croak(aTHX_ "%s argument is not a HASH element or slice",
4477 PL_op_desc[o->op_type]);
4484 Perl_ck_eof(pTHX_ OP *o)
4486 I32 type = o->op_type;
4488 if (o->op_flags & OPf_KIDS) {
4489 if (cLISTOPo->op_first->op_type == OP_STUB) {
4491 o = newUNOP(type, OPf_SPECIAL,
4492 newGVOP(OP_GV, 0, gv_fetchpv("main::ARGV", TRUE, SVt_PVAV)));
4500 Perl_ck_eval(pTHX_ OP *o)
4502 PL_hints |= HINT_BLOCK_SCOPE;
4503 if (o->op_flags & OPf_KIDS) {
4504 SVOP *kid = (SVOP*)cUNOPo->op_first;
4507 o->op_flags &= ~OPf_KIDS;
4510 else if (kid->op_type == OP_LINESEQ) {
4513 kid->op_next = o->op_next;
4514 cUNOPo->op_first = 0;
4517 NewOp(1101, enter, 1, LOGOP);
4518 enter->op_type = OP_ENTERTRY;
4519 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4520 enter->op_private = 0;
4522 /* establish postfix order */
4523 enter->op_next = (OP*)enter;
4525 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4526 o->op_type = OP_LEAVETRY;
4527 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4528 enter->op_other = o;
4536 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4538 o->op_targ = (PADOFFSET)PL_hints;
4543 Perl_ck_exec(pTHX_ OP *o)
4546 if (o->op_flags & OPf_STACKED) {
4548 kid = cUNOPo->op_first->op_sibling;
4549 if (kid->op_type == OP_RV2GV)
4558 Perl_ck_exists(pTHX_ OP *o)
4561 if (o->op_flags & OPf_KIDS) {
4562 OP *kid = cUNOPo->op_first;
4563 if (kid->op_type != OP_HELEM)
4564 Perl_croak(aTHX_ "%s argument is not a HASH element", PL_op_desc[o->op_type]);
4572 Perl_ck_gvconst(pTHX_ register OP *o)
4574 o = fold_constants(o);
4575 if (o->op_type == OP_CONST)
4582 Perl_ck_rvconst(pTHX_ register OP *o)
4585 SVOP *kid = (SVOP*)cUNOPo->op_first;
4587 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4588 if (kid->op_type == OP_CONST) {
4592 SV *kidsv = kid->op_sv;
4595 /* Is it a constant from cv_const_sv()? */
4596 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4597 SV *rsv = SvRV(kidsv);
4598 int svtype = SvTYPE(rsv);
4599 char *badtype = Nullch;
4601 switch (o->op_type) {
4603 if (svtype > SVt_PVMG)
4604 badtype = "a SCALAR";
4607 if (svtype != SVt_PVAV)
4608 badtype = "an ARRAY";
4611 if (svtype != SVt_PVHV) {
4612 if (svtype == SVt_PVAV) { /* pseudohash? */
4613 SV **ksv = av_fetch((AV*)rsv, 0, FALSE);
4614 if (ksv && SvROK(*ksv)
4615 && SvTYPE(SvRV(*ksv)) == SVt_PVHV)
4624 if (svtype != SVt_PVCV)
4629 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4632 name = SvPV(kidsv, n_a);
4633 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4634 char *badthing = Nullch;
4635 switch (o->op_type) {
4637 badthing = "a SCALAR";
4640 badthing = "an ARRAY";
4643 badthing = "a HASH";
4648 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4652 * This is a little tricky. We only want to add the symbol if we
4653 * didn't add it in the lexer. Otherwise we get duplicate strict
4654 * warnings. But if we didn't add it in the lexer, we must at
4655 * least pretend like we wanted to add it even if it existed before,
4656 * or we get possible typo warnings. OPpCONST_ENTERED says
4657 * whether the lexer already added THIS instance of this symbol.
4659 iscv = (o->op_type == OP_RV2CV) * 2;
4661 gv = gv_fetchpv(name,
4662 iscv | !(kid->op_private & OPpCONST_ENTERED),
4665 : o->op_type == OP_RV2SV
4667 : o->op_type == OP_RV2AV
4669 : o->op_type == OP_RV2HV
4672 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4674 kid->op_type = OP_GV;
4675 SvREFCNT_dec(kid->op_sv);
4676 kid->op_sv = SvREFCNT_inc(gv);
4683 Perl_ck_ftst(pTHX_ OP *o)
4686 I32 type = o->op_type;
4688 if (o->op_flags & OPf_REF)
4691 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
4692 SVOP *kid = (SVOP*)cUNOPo->op_first;
4694 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
4696 OP *newop = newGVOP(type, OPf_REF,
4697 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
4704 if (type == OP_FTTTY)
4705 return newGVOP(type, OPf_REF, gv_fetchpv("main::STDIN", TRUE,
4708 return newUNOP(type, 0, newDEFSVOP());
4714 Perl_ck_fun(pTHX_ OP *o)
4721 int type = o->op_type;
4722 register I32 oa = PL_opargs[type] >> OASHIFT;
4724 if (o->op_flags & OPf_STACKED) {
4725 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
4728 return no_fh_allowed(o);
4731 if (o->op_flags & OPf_KIDS) {
4733 tokid = &cLISTOPo->op_first;
4734 kid = cLISTOPo->op_first;
4735 if (kid->op_type == OP_PUSHMARK ||
4736 kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)
4738 tokid = &kid->op_sibling;
4739 kid = kid->op_sibling;
4741 if (!kid && PL_opargs[type] & OA_DEFGV)
4742 *tokid = kid = newDEFSVOP();
4746 sibl = kid->op_sibling;
4749 /* list seen where single (scalar) arg expected? */
4750 if (numargs == 1 && !(oa >> 4)
4751 && kid->op_type == OP_LIST && type != OP_SCALAR)
4753 return too_many_arguments(o,PL_op_desc[type]);
4766 if (kid->op_type == OP_CONST &&
4767 (kid->op_private & OPpCONST_BARE))
4769 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4770 OP *newop = newAVREF(newGVOP(OP_GV, 0,
4771 gv_fetchpv(name, TRUE, SVt_PVAV) ));
4772 if (ckWARN(WARN_SYNTAX))
4773 Perl_warner(aTHX_ WARN_SYNTAX,
4774 "Array @%s missing the @ in argument %ld of %s()",
4775 name, (long)numargs, PL_op_desc[type]);
4778 kid->op_sibling = sibl;
4781 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
4782 bad_type(numargs, "array", PL_op_desc[type], kid);
4786 if (kid->op_type == OP_CONST &&
4787 (kid->op_private & OPpCONST_BARE))
4789 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
4790 OP *newop = newHVREF(newGVOP(OP_GV, 0,
4791 gv_fetchpv(name, TRUE, SVt_PVHV) ));
4792 if (ckWARN(WARN_SYNTAX))
4793 Perl_warner(aTHX_ WARN_SYNTAX,
4794 "Hash %%%s missing the %% in argument %ld of %s()",
4795 name, (long)numargs, PL_op_desc[type]);
4798 kid->op_sibling = sibl;
4801 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
4802 bad_type(numargs, "hash", PL_op_desc[type], kid);
4807 OP *newop = newUNOP(OP_NULL, 0, kid);
4808 kid->op_sibling = 0;
4810 newop->op_next = newop;
4812 kid->op_sibling = sibl;
4817 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
4818 if (kid->op_type == OP_CONST &&
4819 (kid->op_private & OPpCONST_BARE))
4821 OP *newop = newGVOP(OP_GV, 0,
4822 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
4827 else if (kid->op_type == OP_READLINE) {
4828 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
4829 bad_type(numargs, "HANDLE", PL_op_desc[o->op_type], kid);
4832 I32 flags = OPf_SPECIAL;
4834 /* is this op a FH constructor? */
4835 if (is_handle_constructor(o,numargs)) {
4837 /* Set a flag to tell rv2gv to vivify
4838 * need to "prove" flag does not mean something
4839 * else already - NI-S 1999/05/07
4843 /* Helps with open($array[$n],...)
4844 but is too simplistic - need to do selectively
4849 kid->op_sibling = 0;
4850 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
4852 kid->op_private |= priv;
4855 kid->op_sibling = sibl;
4861 mod(scalar(kid), type);
4865 tokid = &kid->op_sibling;
4866 kid = kid->op_sibling;
4868 o->op_private |= numargs;
4870 return too_many_arguments(o,PL_op_desc[o->op_type]);
4873 else if (PL_opargs[type] & OA_DEFGV) {
4875 return newUNOP(type, 0, newDEFSVOP());
4879 while (oa & OA_OPTIONAL)
4881 if (oa && oa != OA_LIST)
4882 return too_few_arguments(o,PL_op_desc[o->op_type]);
4888 Perl_ck_glob(pTHX_ OP *o)
4892 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
4893 append_elem(OP_GLOB, o, newDEFSVOP());
4895 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV)) && GvIMPORTED_CV(gv)))
4896 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
4898 if (gv && GvIMPORTED_CV(gv)) {
4899 append_elem(OP_GLOB, o,
4900 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
4901 o->op_type = OP_LIST;
4902 o->op_ppaddr = PL_ppaddr[OP_LIST];
4903 cLISTOPo->op_first->op_type = OP_PUSHMARK;
4904 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
4905 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
4906 append_elem(OP_LIST, o,
4907 scalar(newUNOP(OP_RV2CV, 0,
4908 newGVOP(OP_GV, 0, gv)))));
4909 o = newUNOP(OP_NULL, 0, ck_subr(o));
4910 o->op_targ = OP_GLOB; /* hint at what it used to be */
4913 gv = newGVgen("main");
4915 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
4921 Perl_ck_grep(pTHX_ OP *o)
4925 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
4927 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
4928 NewOp(1101, gwop, 1, LOGOP);
4930 if (o->op_flags & OPf_STACKED) {
4933 kid = cLISTOPo->op_first->op_sibling;
4934 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
4937 kid->op_next = (OP*)gwop;
4938 o->op_flags &= ~OPf_STACKED;
4940 kid = cLISTOPo->op_first->op_sibling;
4941 if (type == OP_MAPWHILE)
4948 kid = cLISTOPo->op_first->op_sibling;
4949 if (kid->op_type != OP_NULL)
4950 Perl_croak(aTHX_ "panic: ck_grep");
4951 kid = kUNOP->op_first;
4953 gwop->op_type = type;
4954 gwop->op_ppaddr = PL_ppaddr[type];
4955 gwop->op_first = listkids(o);
4956 gwop->op_flags |= OPf_KIDS;
4957 gwop->op_private = 1;
4958 gwop->op_other = LINKLIST(kid);
4959 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
4960 kid->op_next = (OP*)gwop;
4962 kid = cLISTOPo->op_first->op_sibling;
4963 if (!kid || !kid->op_sibling)
4964 return too_few_arguments(o,PL_op_desc[o->op_type]);
4965 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
4966 mod(kid, OP_GREPSTART);
4972 Perl_ck_index(pTHX_ OP *o)
4974 if (o->op_flags & OPf_KIDS) {
4975 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
4977 kid = kid->op_sibling; /* get past "big" */
4978 if (kid && kid->op_type == OP_CONST)
4979 fbm_compile(((SVOP*)kid)->op_sv, 0);
4985 Perl_ck_lengthconst(pTHX_ OP *o)
4987 /* XXX length optimization goes here */
4992 Perl_ck_lfun(pTHX_ OP *o)
4994 OPCODE type = o->op_type;
4995 return modkids(ck_fun(o), type);
4999 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5002 if ((o->op_flags & OPf_KIDS) && ckWARN(WARN_DEPRECATED)) {
5003 switch (cUNOPo->op_first->op_type) {
5006 case OP_AASSIGN: /* Is this a good idea? */
5007 Perl_warner(aTHX_ WARN_DEPRECATED,
5008 "defined(@array) is deprecated");
5009 Perl_warner(aTHX_ WARN_DEPRECATED,
5010 "(Maybe you should just omit the defined()?)\n");
5014 Perl_warner(aTHX_ WARN_DEPRECATED,
5015 "defined(%hash) is deprecated");
5016 Perl_warner(aTHX_ WARN_DEPRECATED,
5017 "(Maybe you should just omit the defined()?)\n");
5028 Perl_ck_rfun(pTHX_ OP *o)
5030 OPCODE type = o->op_type;
5031 return refkids(ck_fun(o), type);
5035 Perl_ck_listiob(pTHX_ OP *o)
5039 kid = cLISTOPo->op_first;
5042 kid = cLISTOPo->op_first;
5044 if (kid->op_type == OP_PUSHMARK)
5045 kid = kid->op_sibling;
5046 if (kid && o->op_flags & OPf_STACKED)
5047 kid = kid->op_sibling;
5048 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5049 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5050 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5051 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5052 cLISTOPo->op_first->op_sibling = kid;
5053 cLISTOPo->op_last = kid;
5054 kid = kid->op_sibling;
5059 append_elem(o->op_type, o, newDEFSVOP());
5065 if (PL_hints & HINT_LOCALE)
5066 o->op_private |= OPpLOCALE;
5073 Perl_ck_fun_locale(pTHX_ OP *o)
5079 if (PL_hints & HINT_LOCALE)
5080 o->op_private |= OPpLOCALE;
5087 Perl_ck_scmp(pTHX_ OP *o)
5091 if (PL_hints & HINT_LOCALE)
5092 o->op_private |= OPpLOCALE;
5099 Perl_ck_match(pTHX_ OP *o)
5101 o->op_private |= OPpRUNTIME;
5106 Perl_ck_null(pTHX_ OP *o)
5112 Perl_ck_repeat(pTHX_ OP *o)
5114 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5115 o->op_private |= OPpREPEAT_DOLIST;
5116 cBINOPo->op_first = force_list(cBINOPo->op_first);
5124 Perl_ck_require(pTHX_ OP *o)
5126 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5127 SVOP *kid = (SVOP*)cUNOPo->op_first;
5129 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5131 for (s = SvPVX(kid->op_sv); *s; s++) {
5132 if (*s == ':' && s[1] == ':') {
5134 Move(s+2, s+1, strlen(s+2)+1, char);
5135 --SvCUR(kid->op_sv);
5138 sv_catpvn(kid->op_sv, ".pm", 3);
5146 Perl_ck_retarget(pTHX_ OP *o)
5148 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5155 Perl_ck_select(pTHX_ OP *o)
5158 if (o->op_flags & OPf_KIDS) {
5159 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5160 if (kid && kid->op_sibling) {
5161 o->op_type = OP_SSELECT;
5162 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5164 return fold_constants(o);
5168 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5169 if (kid && kid->op_type == OP_RV2GV)
5170 kid->op_private &= ~HINT_STRICT_REFS;
5175 Perl_ck_shift(pTHX_ OP *o)
5177 I32 type = o->op_type;
5179 if (!(o->op_flags & OPf_KIDS)) {
5184 if (!CvUNIQUE(PL_compcv)) {
5185 argop = newOP(OP_PADAV, OPf_REF);
5186 argop->op_targ = 0; /* PL_curpad[0] is @_ */
5189 argop = newUNOP(OP_RV2AV, 0,
5190 scalar(newGVOP(OP_GV, 0,
5191 gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5194 argop = newUNOP(OP_RV2AV, 0,
5195 scalar(newGVOP(OP_GV, 0, !CvUNIQUE(PL_compcv) ?
5196 PL_defgv : gv_fetchpv("ARGV", TRUE, SVt_PVAV))));
5197 #endif /* USE_THREADS */
5198 return newUNOP(type, 0, scalar(argop));
5200 return scalar(modkids(ck_fun(o), type));
5204 Perl_ck_sort(pTHX_ OP *o)
5208 if (PL_hints & HINT_LOCALE)
5209 o->op_private |= OPpLOCALE;
5212 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5214 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5215 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5217 kid = kUNOP->op_first; /* get past null */
5219 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5221 if (kid->op_type == OP_SCOPE) {
5225 else if (kid->op_type == OP_LEAVE) {
5226 if (o->op_type == OP_SORT) {
5227 null(kid); /* wipe out leave */
5230 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5231 if (k->op_next == kid)
5236 kid->op_next = 0; /* just disconnect the leave */
5237 k = kLISTOP->op_first;
5241 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5242 if (o->op_type == OP_SORT)
5246 o->op_flags |= OPf_SPECIAL;
5248 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5249 null(cLISTOPo->op_first->op_sibling);
5256 S_simplify_sort(pTHX_ OP *o)
5259 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5262 if (!(o->op_flags & OPf_STACKED))
5264 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5265 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5266 kid = kUNOP->op_first; /* get past null */
5267 if (kid->op_type != OP_SCOPE)
5269 kid = kLISTOP->op_last; /* get past scope */
5270 switch(kid->op_type) {
5278 k = kid; /* remember this node*/
5279 if (kBINOP->op_first->op_type != OP_RV2SV)
5281 kid = kBINOP->op_first; /* get past cmp */
5282 if (kUNOP->op_first->op_type != OP_GV)
5284 kid = kUNOP->op_first; /* get past rv2sv */
5285 if (GvSTASH(kGVOP->op_gv) != PL_curstash)
5287 if (strEQ(GvNAME(kGVOP->op_gv), "a"))
5289 else if(strEQ(GvNAME(kGVOP->op_gv), "b"))
5293 kid = k; /* back to cmp */
5294 if (kBINOP->op_last->op_type != OP_RV2SV)
5296 kid = kBINOP->op_last; /* down to 2nd arg */
5297 if (kUNOP->op_first->op_type != OP_GV)
5299 kid = kUNOP->op_first; /* get past rv2sv */
5300 if (GvSTASH(kGVOP->op_gv) != PL_curstash
5302 ? strNE(GvNAME(kGVOP->op_gv), "a")
5303 : strNE(GvNAME(kGVOP->op_gv), "b")))
5305 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5307 o->op_private |= OPpSORT_REVERSE;
5308 if (k->op_type == OP_NCMP)
5309 o->op_private |= OPpSORT_NUMERIC;
5310 if (k->op_type == OP_I_NCMP)
5311 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5312 op_free(cLISTOPo->op_first->op_sibling); /* delete comparison block */
5313 cLISTOPo->op_first->op_sibling = cLISTOPo->op_last;
5314 cLISTOPo->op_children = 1;
5318 Perl_ck_split(pTHX_ OP *o)
5322 if (o->op_flags & OPf_STACKED)
5323 return no_fh_allowed(o);
5325 kid = cLISTOPo->op_first;
5326 if (kid->op_type != OP_NULL)
5327 Perl_croak(aTHX_ "panic: ck_split");
5328 kid = kid->op_sibling;
5329 op_free(cLISTOPo->op_first);
5330 cLISTOPo->op_first = kid;
5332 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5333 cLISTOPo->op_last = kid; /* There was only one element previously */
5336 if (kid->op_type != OP_MATCH) {
5337 OP *sibl = kid->op_sibling;
5338 kid->op_sibling = 0;
5339 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5340 if (cLISTOPo->op_first == cLISTOPo->op_last)
5341 cLISTOPo->op_last = kid;
5342 cLISTOPo->op_first = kid;
5343 kid->op_sibling = sibl;
5346 kid->op_type = OP_PUSHRE;
5347 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5350 if (!kid->op_sibling)
5351 append_elem(OP_SPLIT, o, newDEFSVOP());
5353 kid = kid->op_sibling;
5356 if (!kid->op_sibling)
5357 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5359 kid = kid->op_sibling;
5362 if (kid->op_sibling)
5363 return too_many_arguments(o,PL_op_desc[o->op_type]);
5369 Perl_ck_subr(pTHX_ OP *o)
5372 OP *prev = ((cUNOPo->op_first->op_sibling)
5373 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5374 OP *o2 = prev->op_sibling;
5383 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5384 if (cvop->op_type == OP_RV2CV) {
5386 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5387 null(cvop); /* disable rv2cv */
5388 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5389 if (tmpop->op_type == OP_GV) {
5390 cv = GvCVu(tmpop->op_sv);
5391 if (cv && SvPOK(cv) && !(o->op_private & OPpENTERSUB_AMPER)) {
5392 namegv = CvANON(cv) ? (GV*)tmpop->op_sv : CvGV(cv);
5393 proto = SvPV((SV*)cv, n_a);
5397 else if (cvop->op_type == OP_METHOD) {
5398 if (o2->op_type == OP_CONST)
5399 o2->op_private &= ~OPpCONST_STRICT;
5400 else if (o2->op_type == OP_LIST) {
5401 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5402 if (o && o->op_type == OP_CONST)
5403 o->op_private &= ~OPpCONST_STRICT;
5406 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5407 if (PERLDB_SUB && PL_curstash != PL_debstash)
5408 o->op_private |= OPpENTERSUB_DB;
5409 while (o2 != cvop) {
5413 return too_many_arguments(o, gv_ename(namegv));
5431 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
5432 bad_type(arg, "block", gv_ename(namegv), o2);
5435 /* '*' allows any scalar type, including bareword */
5438 if (o2->op_type == OP_RV2GV)
5439 goto wrapref; /* autoconvert GLOB -> GLOBref */
5440 else if (o2->op_type == OP_CONST)
5441 o2->op_private &= ~OPpCONST_STRICT;
5442 else if (o2->op_type == OP_ENTERSUB) {
5443 /* accidental subroutine, revert to bareword */
5444 OP *gvop = ((UNOP*)o2)->op_first;
5445 if (gvop && gvop->op_type == OP_NULL) {
5446 gvop = ((UNOP*)gvop)->op_first;
5448 for (; gvop->op_sibling; gvop = gvop->op_sibling)
5451 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
5452 (gvop = ((UNOP*)gvop)->op_first) &&
5453 gvop->op_type == OP_GV)
5455 GV *gv = (GV*)((SVOP*)gvop)->op_sv;
5456 OP *sibling = o2->op_sibling;
5457 SV *n = newSVpvn("",0);
5459 gv_fullname3(n, gv, "");
5460 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
5461 sv_chop(n, SvPVX(n)+6);
5462 o2 = newSVOP(OP_CONST, 0, n);
5463 prev->op_sibling = o2;
5464 o2->op_sibling = sibling;
5476 if (o2->op_type != OP_RV2GV)
5477 bad_type(arg, "symbol", gv_ename(namegv), o2);
5480 if (o2->op_type != OP_RV2CV)
5481 bad_type(arg, "sub", gv_ename(namegv), o2);
5484 if (o2->op_type != OP_RV2SV
5485 && o2->op_type != OP_PADSV
5486 && o2->op_type != OP_THREADSV)
5488 bad_type(arg, "scalar", gv_ename(namegv), o2);
5492 if (o2->op_type != OP_RV2AV && o2->op_type != OP_PADAV)
5493 bad_type(arg, "array", gv_ename(namegv), o2);
5496 if (o2->op_type != OP_RV2HV && o2->op_type != OP_PADHV)
5497 bad_type(arg, "hash", gv_ename(namegv), o2);
5501 OP* sib = kid->op_sibling;
5502 kid->op_sibling = 0;
5503 o2 = newUNOP(OP_REFGEN, 0, kid);
5504 o2->op_sibling = sib;
5505 prev->op_sibling = o2;
5516 Perl_croak(aTHX_ "Malformed prototype for %s: %s",
5517 gv_ename(namegv), SvPV((SV*)cv, n_a));
5522 mod(o2, OP_ENTERSUB);
5524 o2 = o2->op_sibling;
5526 if (proto && !optional &&
5527 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
5528 return too_few_arguments(o, gv_ename(namegv));
5533 Perl_ck_svconst(pTHX_ OP *o)
5535 SvREADONLY_on(cSVOPo->op_sv);
5540 Perl_ck_trunc(pTHX_ OP *o)
5542 if (o->op_flags & OPf_KIDS) {
5543 SVOP *kid = (SVOP*)cUNOPo->op_first;
5545 if (kid->op_type == OP_NULL)
5546 kid = (SVOP*)kid->op_sibling;
5547 if (kid && kid->op_type == OP_CONST &&
5548 (kid->op_private & OPpCONST_BARE))
5550 o->op_flags |= OPf_SPECIAL;
5551 kid->op_private &= ~OPpCONST_STRICT;
5557 /* A peephole optimizer. We visit the ops in the order they're to execute. */
5560 Perl_peep(pTHX_ register OP *o)
5563 register OP* oldop = 0;
5566 if (!o || o->op_seq)
5570 SAVESPTR(PL_curcop);
5571 for (; o; o = o->op_next) {
5577 switch (o->op_type) {
5580 PL_curcop = ((COP*)o); /* for warnings */
5581 o->op_seq = PL_op_seqmax++;
5585 if (cSVOPo->op_private & OPpCONST_STRICT)
5586 no_bareword_allowed(o);
5595 if (o->op_next && o->op_next->op_type == OP_STRINGIFY)
5597 o->op_seq = PL_op_seqmax++;
5600 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
5601 o->op_seq = PL_op_seqmax++;
5602 break; /* Scalar stub must produce undef. List stub is noop */
5606 if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE)
5607 PL_curcop = ((COP*)o);
5613 if (oldop && o->op_next) {
5614 oldop->op_next = o->op_next;
5617 o->op_seq = PL_op_seqmax++;
5621 if (o->op_next->op_type == OP_RV2SV) {
5622 if (!(o->op_next->op_private & OPpDEREF)) {
5624 o->op_private |= o->op_next->op_private & OPpLVAL_INTRO;
5625 o->op_next = o->op_next->op_next;
5626 o->op_type = OP_GVSV;
5627 o->op_ppaddr = PL_ppaddr[OP_GVSV];
5630 else if (o->op_next->op_type == OP_RV2AV) {
5631 OP* pop = o->op_next->op_next;
5633 if (pop->op_type == OP_CONST &&
5634 (PL_op = pop->op_next) &&
5635 pop->op_next->op_type == OP_AELEM &&
5636 !(pop->op_next->op_private &
5637 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF)) &&
5638 (i = SvIV(((SVOP*)pop)->op_sv) - PL_compiling.cop_arybase)
5642 SvREFCNT_dec(((SVOP*)pop)->op_sv);
5646 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
5647 o->op_next = pop->op_next->op_next;
5648 o->op_type = OP_AELEMFAST;
5649 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
5650 o->op_private = (U8)i;
5651 GvAVn(((GVOP*)o)->op_gv);
5654 o->op_seq = PL_op_seqmax++;
5661 o->op_seq = PL_op_seqmax++;
5662 while (cLOGOP->op_other->op_type == OP_NULL)
5663 cLOGOP->op_other = cLOGOP->op_other->op_next;
5664 peep(cLOGOP->op_other);
5668 o->op_seq = PL_op_seqmax++;
5669 peep(cCONDOP->op_true);
5670 peep(cCONDOP->op_false);
5674 o->op_seq = PL_op_seqmax++;
5675 peep(cLOOP->op_redoop);
5676 peep(cLOOP->op_nextop);
5677 peep(cLOOP->op_lastop);
5683 o->op_seq = PL_op_seqmax++;
5684 peep(cPMOP->op_pmreplstart);
5688 o->op_seq = PL_op_seqmax++;
5689 if (ckWARN(WARN_SYNTAX) && o->op_next
5690 && o->op_next->op_type == OP_NEXTSTATE) {
5691 if (o->op_next->op_sibling &&
5692 o->op_next->op_sibling->op_type != OP_EXIT &&
5693 o->op_next->op_sibling->op_type != OP_WARN &&
5694 o->op_next->op_sibling->op_type != OP_DIE) {
5695 line_t oldline = PL_curcop->cop_line;
5697 PL_curcop->cop_line = ((COP*)o->op_next)->cop_line;
5698 Perl_warner(aTHX_ WARN_SYNTAX, "Statement unlikely to be reached");
5699 Perl_warner(aTHX_ WARN_SYNTAX, "(Maybe you meant system() when you said exec()?)\n");
5700 PL_curcop->cop_line = oldline;
5714 if ((o->op_private & (OPpLVAL_INTRO))
5715 || ((BINOP*)o)->op_last->op_type != OP_CONST)
5717 rop = (UNOP*)((BINOP*)o)->op_first;
5718 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
5720 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
5721 if (!SvOBJECT(lexname))
5723 fields = (GV**)hv_fetch(SvSTASH(lexname), "FIELDS", 6, FALSE);
5724 if (!fields || !GvHV(*fields))
5726 svp = &((SVOP*)((BINOP*)o)->op_last)->op_sv;
5727 key = SvPV(*svp, keylen);
5728 indsvp = hv_fetch(GvHV(*fields), key, keylen, FALSE);
5730 Perl_croak(aTHX_ "No such field \"%s\" in variable %s of type %s",
5731 key, SvPV(lexname, n_a), HvNAME(SvSTASH(lexname)));
5733 ind = SvIV(*indsvp);
5735 Perl_croak(aTHX_ "Bad index while coercing array into hash");
5736 rop->op_type = OP_RV2AV;
5737 rop->op_ppaddr = PL_ppaddr[OP_RV2AV];
5738 o->op_type = OP_AELEM;
5739 o->op_ppaddr = PL_ppaddr[OP_AELEM];
5741 *svp = newSViv(ind);
5746 o->op_seq = PL_op_seqmax++;