3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
13 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
14 * youngest of the Old Took's daughters); and Mr. Drogo was his second
15 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
16 * either way, as the saying is, if you follow me." --the Gaffer
25 #define CALL_PEEP(o) CALL_FPTR(PL_peepp)(aTHX_ o)
27 #if defined(PL_OP_SLAB_ALLOC)
29 #ifndef PERL_SLAB_SIZE
30 #define PERL_SLAB_SIZE 2048
33 #define NewOp(m,var,c,type) \
34 STMT_START { var = (type *) Slab_Alloc(m,c*sizeof(type)); } STMT_END
36 #define FreeOp(p) Slab_Free(p)
39 S_Slab_Alloc(pTHX_ int m, size_t sz)
42 * To make incrementing use count easy PL_OpSlab is an I32 *
43 * To make inserting the link to slab PL_OpPtr is I32 **
44 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
45 * Add an overhead for pointer to slab and round up as a number of pointers
47 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
48 if ((PL_OpSpace -= sz) < 0) {
49 PL_OpPtr = (I32 **) PerlMemShared_malloc(PERL_SLAB_SIZE*sizeof(I32*));
53 Zero(PL_OpPtr,PERL_SLAB_SIZE,I32 **);
54 /* We reserve the 0'th I32 sized chunk as a use count */
55 PL_OpSlab = (I32 *) PL_OpPtr;
56 /* Reduce size by the use count word, and by the size we need.
57 * Latter is to mimic the '-=' in the if() above
59 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
60 /* Allocation pointer starts at the top.
61 Theory: because we build leaves before trunk allocating at end
62 means that at run time access is cache friendly upward
64 PL_OpPtr += PERL_SLAB_SIZE;
66 assert( PL_OpSpace >= 0 );
67 /* Move the allocation pointer down */
69 assert( PL_OpPtr > (I32 **) PL_OpSlab );
70 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
71 (*PL_OpSlab)++; /* Increment use count of slab */
72 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
73 assert( *PL_OpSlab > 0 );
74 return (void *)(PL_OpPtr + 1);
78 S_Slab_Free(pTHX_ void *op)
80 I32 **ptr = (I32 **) op;
82 assert( ptr-1 > (I32 **) slab );
83 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
87 #define PerlMemShared PerlMem
90 PerlMemShared_free(slab);
91 if (slab == PL_OpSlab) {
98 #define NewOp(m, var, c, type) Newz(m, var, c, type)
99 #define FreeOp(p) Safefree(p)
102 * In the following definition, the ", Nullop" is just to make the compiler
103 * think the expression is of the right type: croak actually does a Siglongjmp.
105 #define CHECKOP(type,o) \
106 ((PL_op_mask && PL_op_mask[type]) \
107 ? ( op_free((OP*)o), \
108 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
110 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
112 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
115 S_gv_ename(pTHX_ GV *gv)
118 SV* tmpsv = sv_newmortal();
119 gv_efullname3(tmpsv, gv, Nullch);
120 return SvPV(tmpsv,n_a);
124 S_no_fh_allowed(pTHX_ OP *o)
126 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
132 S_too_few_arguments(pTHX_ OP *o, char *name)
134 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
139 S_too_many_arguments(pTHX_ OP *o, char *name)
141 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
146 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
148 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
149 (int)n, name, t, OP_DESC(kid)));
153 S_no_bareword_allowed(pTHX_ OP *o)
155 qerror(Perl_mess(aTHX_
156 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
160 /* "register" allocation */
163 Perl_allocmy(pTHX_ char *name)
167 /* complain about "my $_" etc etc */
168 if (!(PL_in_my == KEY_our ||
170 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
171 (name[1] == '_' && (int)strlen(name) > 2)))
173 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
174 /* 1999-02-27 mjd@plover.com */
176 p = strchr(name, '\0');
177 /* The next block assumes the buffer is at least 205 chars
178 long. At present, it's always at least 256 chars. */
180 strcpy(name+200, "...");
186 /* Move everything else down one character */
187 for (; p-name > 2; p--)
189 name[2] = toCTRL(name[1]);
192 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
195 /* check for duplicate declaration */
197 (bool)(PL_in_my == KEY_our),
198 (PL_curstash ? PL_curstash : PL_defstash)
201 if (PL_in_my_stash && *name != '$') {
202 yyerror(Perl_form(aTHX_
203 "Can't declare class for non-scalar %s in \"%s\"",
204 name, PL_in_my == KEY_our ? "our" : "my"));
207 /* allocate a spare slot and store the name in that slot */
209 off = pad_add_name(name,
212 ? (PL_curstash ? PL_curstash : PL_defstash)
223 Perl_op_free(pTHX_ OP *o)
225 register OP *kid, *nextkid;
228 if (!o || o->op_seq == (U16)-1)
231 if (o->op_private & OPpREFCOUNTED) {
232 switch (o->op_type) {
240 if (OpREFCNT_dec(o)) {
251 if (o->op_flags & OPf_KIDS) {
252 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
253 nextkid = kid->op_sibling; /* Get before next freeing kid */
259 type = (OPCODE)o->op_targ;
261 /* COP* is not cleared by op_clear() so that we may track line
262 * numbers etc even after null() */
263 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
271 Perl_op_clear(pTHX_ OP *o)
274 switch (o->op_type) {
275 case OP_NULL: /* Was holding old type, if any. */
276 case OP_ENTEREVAL: /* Was holding hints. */
280 if (!(o->op_flags & OPf_REF)
281 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
288 if (cPADOPo->op_padix > 0) {
289 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
290 * may still exist on the pad */
291 pad_swipe(cPADOPo->op_padix, TRUE);
292 cPADOPo->op_padix = 0;
295 SvREFCNT_dec(cSVOPo->op_sv);
296 cSVOPo->op_sv = Nullsv;
299 case OP_METHOD_NAMED:
301 SvREFCNT_dec(cSVOPo->op_sv);
302 cSVOPo->op_sv = Nullsv;
305 Even if op_clear does a pad_free for the target of the op,
306 pad_free doesn't actually remove the sv that exists in the bad
307 instead it lives on. This results in that it could be reused as
308 a target later on when the pad was reallocated.
311 pad_swipe(o->op_targ,1);
320 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
324 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
325 SvREFCNT_dec(cSVOPo->op_sv);
326 cSVOPo->op_sv = Nullsv;
329 Safefree(cPVOPo->op_pv);
330 cPVOPo->op_pv = Nullch;
334 op_free(cPMOPo->op_pmreplroot);
338 if (INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot)) {
339 /* No GvIN_PAD_off here, because other references may still
340 * exist on the pad */
341 pad_swipe(INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot), TRUE);
344 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
351 HV *pmstash = PmopSTASH(cPMOPo);
352 if (pmstash && SvREFCNT(pmstash)) {
353 PMOP *pmop = HvPMROOT(pmstash);
354 PMOP *lastpmop = NULL;
356 if (cPMOPo == pmop) {
358 lastpmop->op_pmnext = pmop->op_pmnext;
360 HvPMROOT(pmstash) = pmop->op_pmnext;
364 pmop = pmop->op_pmnext;
367 PmopSTASH_free(cPMOPo);
369 cPMOPo->op_pmreplroot = Nullop;
370 /* we use the "SAFE" version of the PM_ macros here
371 * since sv_clean_all might release some PMOPs
372 * after PL_regex_padav has been cleared
373 * and the clearing of PL_regex_padav needs to
374 * happen before sv_clean_all
376 ReREFCNT_dec(PM_GETRE_SAFE(cPMOPo));
377 PM_SETRE_SAFE(cPMOPo, (REGEXP*)NULL);
379 if(PL_regex_pad) { /* We could be in destruction */
380 av_push((AV*) PL_regex_pad[0],(SV*) PL_regex_pad[(cPMOPo)->op_pmoffset]);
381 SvREPADTMP_on(PL_regex_pad[(cPMOPo)->op_pmoffset]);
382 PM_SETRE(cPMOPo, (cPMOPo)->op_pmoffset);
389 if (o->op_targ > 0) {
390 pad_free(o->op_targ);
396 S_cop_free(pTHX_ COP* cop)
398 Safefree(cop->cop_label); /* FIXME: treaddead ??? */
401 if (! specialWARN(cop->cop_warnings))
402 SvREFCNT_dec(cop->cop_warnings);
403 if (! specialCopIO(cop->cop_io)) {
407 char *s = SvPV(cop->cop_io,len);
408 Perl_warn(aTHX_ "io='%.*s'",(int) len,s); /* ??? --jhi */
411 SvREFCNT_dec(cop->cop_io);
417 Perl_op_null(pTHX_ OP *o)
419 if (o->op_type == OP_NULL)
422 o->op_targ = o->op_type;
423 o->op_type = OP_NULL;
424 o->op_ppaddr = PL_ppaddr[OP_NULL];
427 /* Contextualizers */
429 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
432 Perl_linklist(pTHX_ OP *o)
439 /* establish postfix order */
440 if (cUNOPo->op_first) {
441 o->op_next = LINKLIST(cUNOPo->op_first);
442 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
444 kid->op_next = LINKLIST(kid->op_sibling);
456 Perl_scalarkids(pTHX_ OP *o)
459 if (o && o->op_flags & OPf_KIDS) {
460 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
467 S_scalarboolean(pTHX_ OP *o)
469 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
470 if (ckWARN(WARN_SYNTAX)) {
471 line_t oldline = CopLINE(PL_curcop);
473 if (PL_copline != NOLINE)
474 CopLINE_set(PL_curcop, PL_copline);
475 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
476 CopLINE_set(PL_curcop, oldline);
483 Perl_scalar(pTHX_ OP *o)
487 /* assumes no premature commitment */
488 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
489 || o->op_type == OP_RETURN)
494 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
496 switch (o->op_type) {
498 scalar(cBINOPo->op_first);
503 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
507 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
508 if (!kPMOP->op_pmreplroot)
509 deprecate_old("implicit split to @_");
517 if (o->op_flags & OPf_KIDS) {
518 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
524 kid = cLISTOPo->op_first;
526 while ((kid = kid->op_sibling)) {
532 WITH_THR(PL_curcop = &PL_compiling);
537 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
543 WITH_THR(PL_curcop = &PL_compiling);
546 if (ckWARN(WARN_VOID))
547 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
553 Perl_scalarvoid(pTHX_ OP *o)
560 if (o->op_type == OP_NEXTSTATE
561 || o->op_type == OP_SETSTATE
562 || o->op_type == OP_DBSTATE
563 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
564 || o->op_targ == OP_SETSTATE
565 || o->op_targ == OP_DBSTATE)))
566 PL_curcop = (COP*)o; /* for warning below */
568 /* assumes no premature commitment */
569 want = o->op_flags & OPf_WANT;
570 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
571 || o->op_type == OP_RETURN)
576 if ((o->op_private & OPpTARGET_MY)
577 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
579 return scalar(o); /* As if inside SASSIGN */
582 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
584 switch (o->op_type) {
586 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
590 if (o->op_flags & OPf_STACKED)
594 if (o->op_private == 4)
666 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
667 useless = OP_DESC(o);
674 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
675 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
676 useless = "a variable";
681 if (cSVOPo->op_private & OPpCONST_STRICT)
682 no_bareword_allowed(o);
684 if (ckWARN(WARN_VOID)) {
685 useless = "a constant";
686 /* the constants 0 and 1 are permitted as they are
687 conventionally used as dummies in constructs like
688 1 while some_condition_with_side_effects; */
689 if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
691 else if (SvPOK(sv)) {
692 /* perl4's way of mixing documentation and code
693 (before the invention of POD) was based on a
694 trick to mix nroff and perl code. The trick was
695 built upon these three nroff macros being used in
696 void context. The pink camel has the details in
697 the script wrapman near page 319. */
698 if (strnEQ(SvPVX(sv), "di", 2) ||
699 strnEQ(SvPVX(sv), "ds", 2) ||
700 strnEQ(SvPVX(sv), "ig", 2))
705 op_null(o); /* don't execute or even remember it */
709 o->op_type = OP_PREINC; /* pre-increment is faster */
710 o->op_ppaddr = PL_ppaddr[OP_PREINC];
714 o->op_type = OP_PREDEC; /* pre-decrement is faster */
715 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
722 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
727 if (o->op_flags & OPf_STACKED)
734 if (!(o->op_flags & OPf_KIDS))
743 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
750 /* all requires must return a boolean value */
751 o->op_flags &= ~OPf_WANT;
756 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
757 if (!kPMOP->op_pmreplroot)
758 deprecate_old("implicit split to @_");
762 if (useless && ckWARN(WARN_VOID))
763 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
768 Perl_listkids(pTHX_ OP *o)
771 if (o && o->op_flags & OPf_KIDS) {
772 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
779 Perl_list(pTHX_ OP *o)
783 /* assumes no premature commitment */
784 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
785 || o->op_type == OP_RETURN)
790 if ((o->op_private & OPpTARGET_MY)
791 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
793 return o; /* As if inside SASSIGN */
796 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
798 switch (o->op_type) {
801 list(cBINOPo->op_first);
806 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
814 if (!(o->op_flags & OPf_KIDS))
816 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
817 list(cBINOPo->op_first);
818 return gen_constant_list(o);
825 kid = cLISTOPo->op_first;
827 while ((kid = kid->op_sibling)) {
833 WITH_THR(PL_curcop = &PL_compiling);
837 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
843 WITH_THR(PL_curcop = &PL_compiling);
846 /* all requires must return a boolean value */
847 o->op_flags &= ~OPf_WANT;
854 Perl_scalarseq(pTHX_ OP *o)
859 if (o->op_type == OP_LINESEQ ||
860 o->op_type == OP_SCOPE ||
861 o->op_type == OP_LEAVE ||
862 o->op_type == OP_LEAVETRY)
864 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
865 if (kid->op_sibling) {
869 PL_curcop = &PL_compiling;
871 o->op_flags &= ~OPf_PARENS;
872 if (PL_hints & HINT_BLOCK_SCOPE)
873 o->op_flags |= OPf_PARENS;
876 o = newOP(OP_STUB, 0);
881 S_modkids(pTHX_ OP *o, I32 type)
884 if (o && o->op_flags & OPf_KIDS) {
885 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
891 /* Propagate lvalue ("modifiable") context to an op and it's children.
892 * 'type' represents the context type, roughly based on the type of op that
893 * would do the modifying, although local() is represented by OP_NULL.
894 * It's responsible for detecting things that can't be modified, flag
895 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
896 * might have to vivify a reference in $x), and so on.
898 * For example, "$a+1 = 2" would cause mod() to be called with o being
899 * OP_ADD and type being OP_SASSIGN, and would output an error.
903 Perl_mod(pTHX_ OP *o, I32 type)
906 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
909 if (!o || PL_error_count)
912 if ((o->op_private & OPpTARGET_MY)
913 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
918 switch (o->op_type) {
924 if (!(o->op_private & (OPpCONST_ARYBASE)))
926 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
927 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
931 SAVEI32(PL_compiling.cop_arybase);
932 PL_compiling.cop_arybase = 0;
934 else if (type == OP_REFGEN)
937 Perl_croak(aTHX_ "That use of $[ is unsupported");
940 if (o->op_flags & OPf_PARENS)
944 if ((type == OP_UNDEF || type == OP_REFGEN) &&
945 !(o->op_flags & OPf_STACKED)) {
946 o->op_type = OP_RV2CV; /* entersub => rv2cv */
947 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
948 assert(cUNOPo->op_first->op_type == OP_NULL);
949 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
952 else if (o->op_private & OPpENTERSUB_NOMOD)
954 else { /* lvalue subroutine call */
955 o->op_private |= OPpLVAL_INTRO;
956 PL_modcount = RETURN_UNLIMITED_NUMBER;
957 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
958 /* Backward compatibility mode: */
959 o->op_private |= OPpENTERSUB_INARGS;
962 else { /* Compile-time error message: */
963 OP *kid = cUNOPo->op_first;
967 if (kid->op_type == OP_PUSHMARK)
969 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
971 "panic: unexpected lvalue entersub "
972 "args: type/targ %ld:%"UVuf,
973 (long)kid->op_type, (UV)kid->op_targ);
974 kid = kLISTOP->op_first;
976 while (kid->op_sibling)
977 kid = kid->op_sibling;
978 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
980 if (kid->op_type == OP_METHOD_NAMED
981 || kid->op_type == OP_METHOD)
985 NewOp(1101, newop, 1, UNOP);
986 newop->op_type = OP_RV2CV;
987 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
988 newop->op_first = Nullop;
989 newop->op_next = (OP*)newop;
990 kid->op_sibling = (OP*)newop;
991 newop->op_private |= OPpLVAL_INTRO;
995 if (kid->op_type != OP_RV2CV)
997 "panic: unexpected lvalue entersub "
998 "entry via type/targ %ld:%"UVuf,
999 (long)kid->op_type, (UV)kid->op_targ);
1000 kid->op_private |= OPpLVAL_INTRO;
1001 break; /* Postpone until runtime */
1005 kid = kUNOP->op_first;
1006 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1007 kid = kUNOP->op_first;
1008 if (kid->op_type == OP_NULL)
1010 "Unexpected constant lvalue entersub "
1011 "entry via type/targ %ld:%"UVuf,
1012 (long)kid->op_type, (UV)kid->op_targ);
1013 if (kid->op_type != OP_GV) {
1014 /* Restore RV2CV to check lvalueness */
1016 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1017 okid->op_next = kid->op_next;
1018 kid->op_next = okid;
1021 okid->op_next = Nullop;
1022 okid->op_type = OP_RV2CV;
1024 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1025 okid->op_private |= OPpLVAL_INTRO;
1029 cv = GvCV(kGVOP_gv);
1039 /* grep, foreach, subcalls, refgen */
1040 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1042 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1043 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1045 : (o->op_type == OP_ENTERSUB
1046 ? "non-lvalue subroutine call"
1048 type ? PL_op_desc[type] : "local"));
1062 case OP_RIGHT_SHIFT:
1071 if (!(o->op_flags & OPf_STACKED))
1078 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1084 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1085 PL_modcount = RETURN_UNLIMITED_NUMBER;
1086 return o; /* Treat \(@foo) like ordinary list. */
1090 if (scalar_mod_type(o, type))
1092 ref(cUNOPo->op_first, o->op_type);
1096 if (type == OP_LEAVESUBLV)
1097 o->op_private |= OPpMAYBE_LVSUB;
1103 PL_modcount = RETURN_UNLIMITED_NUMBER;
1106 ref(cUNOPo->op_first, o->op_type);
1111 PL_hints |= HINT_BLOCK_SCOPE;
1126 PL_modcount = RETURN_UNLIMITED_NUMBER;
1127 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1128 return o; /* Treat \(@foo) like ordinary list. */
1129 if (scalar_mod_type(o, type))
1131 if (type == OP_LEAVESUBLV)
1132 o->op_private |= OPpMAYBE_LVSUB;
1136 if (!type) /* local() */
1137 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1138 PAD_COMPNAME_PV(o->op_targ));
1146 if (type != OP_SASSIGN)
1150 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1155 if (type == OP_LEAVESUBLV)
1156 o->op_private |= OPpMAYBE_LVSUB;
1158 pad_free(o->op_targ);
1159 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1160 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1161 if (o->op_flags & OPf_KIDS)
1162 mod(cBINOPo->op_first->op_sibling, type);
1167 ref(cBINOPo->op_first, o->op_type);
1168 if (type == OP_ENTERSUB &&
1169 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1170 o->op_private |= OPpLVAL_DEFER;
1171 if (type == OP_LEAVESUBLV)
1172 o->op_private |= OPpMAYBE_LVSUB;
1182 if (o->op_flags & OPf_KIDS)
1183 mod(cLISTOPo->op_last, type);
1188 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1190 else if (!(o->op_flags & OPf_KIDS))
1192 if (o->op_targ != OP_LIST) {
1193 mod(cBINOPo->op_first, type);
1199 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1204 if (type != OP_LEAVESUBLV)
1206 break; /* mod()ing was handled by ck_return() */
1209 /* [20011101.069] File test operators interpret OPf_REF to mean that
1210 their argument is a filehandle; thus \stat(".") should not set
1212 if (type == OP_REFGEN &&
1213 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1216 if (type != OP_LEAVESUBLV)
1217 o->op_flags |= OPf_MOD;
1219 if (type == OP_AASSIGN || type == OP_SASSIGN)
1220 o->op_flags |= OPf_SPECIAL|OPf_REF;
1221 else if (!type) { /* local() */
1224 o->op_private |= OPpLVAL_INTRO;
1225 o->op_flags &= ~OPf_SPECIAL;
1226 PL_hints |= HINT_BLOCK_SCOPE;
1231 if (ckWARN(WARN_SYNTAX)) {
1232 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1233 "Useless localization of %s", OP_DESC(o));
1237 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1238 && type != OP_LEAVESUBLV)
1239 o->op_flags |= OPf_REF;
1244 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1248 if (o->op_type == OP_RV2GV)
1272 case OP_RIGHT_SHIFT:
1291 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1293 switch (o->op_type) {
1301 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1314 Perl_refkids(pTHX_ OP *o, I32 type)
1317 if (o && o->op_flags & OPf_KIDS) {
1318 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1325 Perl_ref(pTHX_ OP *o, I32 type)
1329 if (!o || PL_error_count)
1332 switch (o->op_type) {
1334 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1335 !(o->op_flags & OPf_STACKED)) {
1336 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1337 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1338 assert(cUNOPo->op_first->op_type == OP_NULL);
1339 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1340 o->op_flags |= OPf_SPECIAL;
1345 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1349 if (type == OP_DEFINED)
1350 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1351 ref(cUNOPo->op_first, o->op_type);
1354 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1355 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1356 : type == OP_RV2HV ? OPpDEREF_HV
1358 o->op_flags |= OPf_MOD;
1363 o->op_flags |= OPf_MOD; /* XXX ??? */
1368 o->op_flags |= OPf_REF;
1371 if (type == OP_DEFINED)
1372 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1373 ref(cUNOPo->op_first, o->op_type);
1378 o->op_flags |= OPf_REF;
1383 if (!(o->op_flags & OPf_KIDS))
1385 ref(cBINOPo->op_first, type);
1389 ref(cBINOPo->op_first, o->op_type);
1390 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1391 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1392 : type == OP_RV2HV ? OPpDEREF_HV
1394 o->op_flags |= OPf_MOD;
1402 if (!(o->op_flags & OPf_KIDS))
1404 ref(cLISTOPo->op_last, type);
1414 S_dup_attrlist(pTHX_ OP *o)
1418 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1419 * where the first kid is OP_PUSHMARK and the remaining ones
1420 * are OP_CONST. We need to push the OP_CONST values.
1422 if (o->op_type == OP_CONST)
1423 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1425 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1426 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1427 if (o->op_type == OP_CONST)
1428 rop = append_elem(OP_LIST, rop,
1429 newSVOP(OP_CONST, o->op_flags,
1430 SvREFCNT_inc(cSVOPo->op_sv)));
1437 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1441 /* fake up C<use attributes $pkg,$rv,@attrs> */
1442 ENTER; /* need to protect against side-effects of 'use' */
1445 stashsv = newSVpv(HvNAME(stash), 0);
1447 stashsv = &PL_sv_no;
1449 #define ATTRSMODULE "attributes"
1450 #define ATTRSMODULE_PM "attributes.pm"
1454 /* Don't force the C<use> if we don't need it. */
1455 svp = hv_fetch(GvHVn(PL_incgv), ATTRSMODULE_PM,
1456 sizeof(ATTRSMODULE_PM)-1, 0);
1457 if (svp && *svp != &PL_sv_undef)
1458 ; /* already in %INC */
1460 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1461 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1465 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1466 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1468 prepend_elem(OP_LIST,
1469 newSVOP(OP_CONST, 0, stashsv),
1470 prepend_elem(OP_LIST,
1471 newSVOP(OP_CONST, 0,
1473 dup_attrlist(attrs))));
1479 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1481 OP *pack, *imop, *arg;
1487 assert(target->op_type == OP_PADSV ||
1488 target->op_type == OP_PADHV ||
1489 target->op_type == OP_PADAV);
1491 /* Ensure that attributes.pm is loaded. */
1492 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1494 /* Need package name for method call. */
1495 pack = newSVOP(OP_CONST, 0, newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1497 /* Build up the real arg-list. */
1499 stashsv = newSVpv(HvNAME(stash), 0);
1501 stashsv = &PL_sv_no;
1502 arg = newOP(OP_PADSV, 0);
1503 arg->op_targ = target->op_targ;
1504 arg = prepend_elem(OP_LIST,
1505 newSVOP(OP_CONST, 0, stashsv),
1506 prepend_elem(OP_LIST,
1507 newUNOP(OP_REFGEN, 0,
1508 mod(arg, OP_REFGEN)),
1509 dup_attrlist(attrs)));
1511 /* Fake up a method call to import */
1512 meth = newSVpvn("import", 6);
1513 (void)SvUPGRADE(meth, SVt_PVIV);
1514 (void)SvIOK_on(meth);
1515 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
1516 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
1517 append_elem(OP_LIST,
1518 prepend_elem(OP_LIST, pack, list(arg)),
1519 newSVOP(OP_METHOD_NAMED, 0, meth)));
1520 imop->op_private |= OPpENTERSUB_NOMOD;
1522 /* Combine the ops. */
1523 *imopsp = append_elem(OP_LIST, *imopsp, imop);
1527 =notfor apidoc apply_attrs_string
1529 Attempts to apply a list of attributes specified by the C<attrstr> and
1530 C<len> arguments to the subroutine identified by the C<cv> argument which
1531 is expected to be associated with the package identified by the C<stashpv>
1532 argument (see L<attributes>). It gets this wrong, though, in that it
1533 does not correctly identify the boundaries of the individual attribute
1534 specifications within C<attrstr>. This is not really intended for the
1535 public API, but has to be listed here for systems such as AIX which
1536 need an explicit export list for symbols. (It's called from XS code
1537 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
1538 to respect attribute syntax properly would be welcome.
1544 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1545 char *attrstr, STRLEN len)
1550 len = strlen(attrstr);
1554 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1556 char *sstr = attrstr;
1557 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1558 attrs = append_elem(OP_LIST, attrs,
1559 newSVOP(OP_CONST, 0,
1560 newSVpvn(sstr, attrstr-sstr)));
1564 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1565 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1566 Nullsv, prepend_elem(OP_LIST,
1567 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1568 prepend_elem(OP_LIST,
1569 newSVOP(OP_CONST, 0,
1575 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
1580 if (!o || PL_error_count)
1584 if (type == OP_LIST) {
1585 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1586 my_kid(kid, attrs, imopsp);
1587 } else if (type == OP_UNDEF) {
1589 } else if (type == OP_RV2SV || /* "our" declaration */
1591 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1592 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
1593 yyerror(Perl_form(aTHX_ "Can't declare %s in %s",
1594 OP_DESC(o), PL_in_my == KEY_our ? "our" : "my"));
1596 GV *gv = cGVOPx_gv(cUNOPo->op_first);
1598 PL_in_my_stash = Nullhv;
1599 apply_attrs(GvSTASH(gv),
1600 (type == OP_RV2SV ? GvSV(gv) :
1601 type == OP_RV2AV ? (SV*)GvAV(gv) :
1602 type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)gv),
1605 o->op_private |= OPpOUR_INTRO;
1608 else if (type != OP_PADSV &&
1611 type != OP_PUSHMARK)
1613 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1615 PL_in_my == KEY_our ? "our" : "my"));
1618 else if (attrs && type != OP_PUSHMARK) {
1622 PL_in_my_stash = Nullhv;
1624 /* check for C<my Dog $spot> when deciding package */
1625 stash = PAD_COMPNAME_TYPE(o->op_targ);
1627 stash = PL_curstash;
1628 apply_attrs_my(stash, o, attrs, imopsp);
1630 o->op_flags |= OPf_MOD;
1631 o->op_private |= OPpLVAL_INTRO;
1636 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1639 int maybe_scalar = 0;
1641 /* [perl #17376]: this appears to be premature, and results in code such as
1642 C< our(%x); > executing in list mode rather than void mode */
1644 if (o->op_flags & OPf_PARENS)
1653 o = my_kid(o, attrs, &rops);
1655 if (maybe_scalar && o->op_type == OP_PADSV) {
1656 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
1657 o->op_private |= OPpLVAL_INTRO;
1660 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
1663 PL_in_my_stash = Nullhv;
1668 Perl_my(pTHX_ OP *o)
1670 return my_attrs(o, Nullop);
1674 Perl_sawparens(pTHX_ OP *o)
1677 o->op_flags |= OPf_PARENS;
1682 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1686 if (ckWARN(WARN_MISC) &&
1687 (left->op_type == OP_RV2AV ||
1688 left->op_type == OP_RV2HV ||
1689 left->op_type == OP_PADAV ||
1690 left->op_type == OP_PADHV)) {
1691 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1692 right->op_type == OP_TRANS)
1693 ? right->op_type : OP_MATCH];
1694 const char *sample = ((left->op_type == OP_RV2AV ||
1695 left->op_type == OP_PADAV)
1696 ? "@array" : "%hash");
1697 Perl_warner(aTHX_ packWARN(WARN_MISC),
1698 "Applying %s to %s will act on scalar(%s)",
1699 desc, sample, sample);
1702 if (right->op_type == OP_CONST &&
1703 cSVOPx(right)->op_private & OPpCONST_BARE &&
1704 cSVOPx(right)->op_private & OPpCONST_STRICT)
1706 no_bareword_allowed(right);
1709 if (!(right->op_flags & OPf_STACKED) &&
1710 (right->op_type == OP_MATCH ||
1711 right->op_type == OP_SUBST ||
1712 right->op_type == OP_TRANS)) {
1713 right->op_flags |= OPf_STACKED;
1714 if (right->op_type != OP_MATCH &&
1715 ! (right->op_type == OP_TRANS &&
1716 right->op_private & OPpTRANS_IDENTICAL))
1717 left = mod(left, right->op_type);
1718 if (right->op_type == OP_TRANS)
1719 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1721 o = prepend_elem(right->op_type, scalar(left), right);
1723 return newUNOP(OP_NOT, 0, scalar(o));
1727 return bind_match(type, left,
1728 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1732 Perl_invert(pTHX_ OP *o)
1736 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1737 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1741 Perl_scope(pTHX_ OP *o)
1744 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1745 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1746 o->op_type = OP_LEAVE;
1747 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1749 else if (o->op_type == OP_LINESEQ) {
1751 o->op_type = OP_SCOPE;
1752 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1753 kid = ((LISTOP*)o)->op_first;
1754 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1758 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1764 Perl_save_hints(pTHX)
1767 SAVESPTR(GvHV(PL_hintgv));
1768 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1769 SAVEFREESV(GvHV(PL_hintgv));
1773 Perl_block_start(pTHX_ int full)
1775 int retval = PL_savestack_ix;
1776 /* If there were syntax errors, don't try to start a block */
1777 if (PL_yynerrs) return retval;
1779 pad_block_start(full);
1781 PL_hints &= ~HINT_BLOCK_SCOPE;
1782 SAVESPTR(PL_compiling.cop_warnings);
1783 if (! specialWARN(PL_compiling.cop_warnings)) {
1784 PL_compiling.cop_warnings = newSVsv(PL_compiling.cop_warnings) ;
1785 SAVEFREESV(PL_compiling.cop_warnings) ;
1787 SAVESPTR(PL_compiling.cop_io);
1788 if (! specialCopIO(PL_compiling.cop_io)) {
1789 PL_compiling.cop_io = newSVsv(PL_compiling.cop_io) ;
1790 SAVEFREESV(PL_compiling.cop_io) ;
1796 Perl_block_end(pTHX_ I32 floor, OP *seq)
1798 int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1799 OP* retval = scalarseq(seq);
1800 /* If there were syntax errors, don't try to close a block */
1801 if (PL_yynerrs) return retval;
1803 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
1805 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1813 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1817 Perl_newPROG(pTHX_ OP *o)
1822 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1823 ((PL_in_eval & EVAL_KEEPERR)
1824 ? OPf_SPECIAL : 0), o);
1825 PL_eval_start = linklist(PL_eval_root);
1826 PL_eval_root->op_private |= OPpREFCOUNTED;
1827 OpREFCNT_set(PL_eval_root, 1);
1828 PL_eval_root->op_next = 0;
1829 CALL_PEEP(PL_eval_start);
1832 if (o->op_type == OP_STUB) {
1833 PL_comppad_name = 0;
1837 PL_main_root = scope(sawparens(scalarvoid(o)));
1838 PL_curcop = &PL_compiling;
1839 PL_main_start = LINKLIST(PL_main_root);
1840 PL_main_root->op_private |= OPpREFCOUNTED;
1841 OpREFCNT_set(PL_main_root, 1);
1842 PL_main_root->op_next = 0;
1843 CALL_PEEP(PL_main_start);
1846 /* Register with debugger */
1848 CV *cv = get_cv("DB::postponed", FALSE);
1852 XPUSHs((SV*)CopFILEGV(&PL_compiling));
1854 call_sv((SV*)cv, G_DISCARD);
1861 Perl_localize(pTHX_ OP *o, I32 lex)
1863 if (o->op_flags & OPf_PARENS)
1864 /* [perl #17376]: this appears to be premature, and results in code such as
1865 C< our(%x); > executing in list mode rather than void mode */
1872 if (ckWARN(WARN_PARENTHESIS)
1873 && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',')
1875 char *s = PL_bufptr;
1878 /* some heuristics to detect a potential error */
1879 while (*s && (strchr(", \t\n", *s)
1880 || (strchr("@$%*", *s) && ++sigil) ))
1883 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)
1884 || strchr("@$%*, \t\n", *s)))
1887 if (*s == ';' || *s == '=')
1888 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
1889 "Parentheses missing around \"%s\" list",
1890 lex ? (PL_in_my == KEY_our ? "our" : "my")
1898 o = mod(o, OP_NULL); /* a bit kludgey */
1900 PL_in_my_stash = Nullhv;
1905 Perl_jmaybe(pTHX_ OP *o)
1907 if (o->op_type == OP_LIST) {
1909 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1910 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1916 Perl_fold_constants(pTHX_ register OP *o)
1919 I32 type = o->op_type;
1922 if (PL_opargs[type] & OA_RETSCALAR)
1924 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
1925 o->op_targ = pad_alloc(type, SVs_PADTMP);
1927 /* integerize op, unless it happens to be C<-foo>.
1928 * XXX should pp_i_negate() do magic string negation instead? */
1929 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1930 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1931 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1933 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1936 if (!(PL_opargs[type] & OA_FOLDCONST))
1941 /* XXX might want a ck_negate() for this */
1942 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1954 /* XXX what about the numeric ops? */
1955 if (PL_hints & HINT_LOCALE)
1960 goto nope; /* Don't try to run w/ errors */
1962 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1963 if ((curop->op_type != OP_CONST ||
1964 (curop->op_private & OPpCONST_BARE)) &&
1965 curop->op_type != OP_LIST &&
1966 curop->op_type != OP_SCALAR &&
1967 curop->op_type != OP_NULL &&
1968 curop->op_type != OP_PUSHMARK)
1974 curop = LINKLIST(o);
1978 sv = *(PL_stack_sp--);
1979 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1980 pad_swipe(o->op_targ, FALSE);
1981 else if (SvTEMP(sv)) { /* grab mortal temp? */
1982 (void)SvREFCNT_inc(sv);
1986 if (type == OP_RV2GV)
1987 return newGVOP(OP_GV, 0, (GV*)sv);
1988 return newSVOP(OP_CONST, 0, sv);
1995 Perl_gen_constant_list(pTHX_ register OP *o)
1998 I32 oldtmps_floor = PL_tmps_floor;
2002 return o; /* Don't attempt to run with errors */
2004 PL_op = curop = LINKLIST(o);
2011 PL_tmps_floor = oldtmps_floor;
2013 o->op_type = OP_RV2AV;
2014 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2015 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2016 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2017 o->op_seq = 0; /* needs to be revisited in peep() */
2018 curop = ((UNOP*)o)->op_first;
2019 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2026 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2028 if (!o || o->op_type != OP_LIST)
2029 o = newLISTOP(OP_LIST, 0, o, Nullop);
2031 o->op_flags &= ~OPf_WANT;
2033 if (!(PL_opargs[type] & OA_MARK))
2034 op_null(cLISTOPo->op_first);
2036 o->op_type = (OPCODE)type;
2037 o->op_ppaddr = PL_ppaddr[type];
2038 o->op_flags |= flags;
2040 o = CHECKOP(type, o);
2041 if (o->op_type != type)
2044 return fold_constants(o);
2047 /* List constructors */
2050 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2058 if (first->op_type != type
2059 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2061 return newLISTOP(type, 0, first, last);
2064 if (first->op_flags & OPf_KIDS)
2065 ((LISTOP*)first)->op_last->op_sibling = last;
2067 first->op_flags |= OPf_KIDS;
2068 ((LISTOP*)first)->op_first = last;
2070 ((LISTOP*)first)->op_last = last;
2075 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2083 if (first->op_type != type)
2084 return prepend_elem(type, (OP*)first, (OP*)last);
2086 if (last->op_type != type)
2087 return append_elem(type, (OP*)first, (OP*)last);
2089 first->op_last->op_sibling = last->op_first;
2090 first->op_last = last->op_last;
2091 first->op_flags |= (last->op_flags & OPf_KIDS);
2099 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2107 if (last->op_type == type) {
2108 if (type == OP_LIST) { /* already a PUSHMARK there */
2109 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2110 ((LISTOP*)last)->op_first->op_sibling = first;
2111 if (!(first->op_flags & OPf_PARENS))
2112 last->op_flags &= ~OPf_PARENS;
2115 if (!(last->op_flags & OPf_KIDS)) {
2116 ((LISTOP*)last)->op_last = first;
2117 last->op_flags |= OPf_KIDS;
2119 first->op_sibling = ((LISTOP*)last)->op_first;
2120 ((LISTOP*)last)->op_first = first;
2122 last->op_flags |= OPf_KIDS;
2126 return newLISTOP(type, 0, first, last);
2132 Perl_newNULLLIST(pTHX)
2134 return newOP(OP_STUB, 0);
2138 Perl_force_list(pTHX_ OP *o)
2140 if (!o || o->op_type != OP_LIST)
2141 o = newLISTOP(OP_LIST, 0, o, Nullop);
2147 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2151 NewOp(1101, listop, 1, LISTOP);
2153 listop->op_type = (OPCODE)type;
2154 listop->op_ppaddr = PL_ppaddr[type];
2157 listop->op_flags = (U8)flags;
2161 else if (!first && last)
2164 first->op_sibling = last;
2165 listop->op_first = first;
2166 listop->op_last = last;
2167 if (type == OP_LIST) {
2169 pushop = newOP(OP_PUSHMARK, 0);
2170 pushop->op_sibling = first;
2171 listop->op_first = pushop;
2172 listop->op_flags |= OPf_KIDS;
2174 listop->op_last = pushop;
2181 Perl_newOP(pTHX_ I32 type, I32 flags)
2184 NewOp(1101, o, 1, OP);
2185 o->op_type = (OPCODE)type;
2186 o->op_ppaddr = PL_ppaddr[type];
2187 o->op_flags = (U8)flags;
2190 o->op_private = (U8)(0 | (flags >> 8));
2191 if (PL_opargs[type] & OA_RETSCALAR)
2193 if (PL_opargs[type] & OA_TARGET)
2194 o->op_targ = pad_alloc(type, SVs_PADTMP);
2195 return CHECKOP(type, o);
2199 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2204 first = newOP(OP_STUB, 0);
2205 if (PL_opargs[type] & OA_MARK)
2206 first = force_list(first);
2208 NewOp(1101, unop, 1, UNOP);
2209 unop->op_type = (OPCODE)type;
2210 unop->op_ppaddr = PL_ppaddr[type];
2211 unop->op_first = first;
2212 unop->op_flags = flags | OPf_KIDS;
2213 unop->op_private = (U8)(1 | (flags >> 8));
2214 unop = (UNOP*) CHECKOP(type, unop);
2218 return fold_constants((OP *) unop);
2222 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2225 NewOp(1101, binop, 1, BINOP);
2228 first = newOP(OP_NULL, 0);
2230 binop->op_type = (OPCODE)type;
2231 binop->op_ppaddr = PL_ppaddr[type];
2232 binop->op_first = first;
2233 binop->op_flags = flags | OPf_KIDS;
2236 binop->op_private = (U8)(1 | (flags >> 8));
2239 binop->op_private = (U8)(2 | (flags >> 8));
2240 first->op_sibling = last;
2243 binop = (BINOP*)CHECKOP(type, binop);
2244 if (binop->op_next || binop->op_type != (OPCODE)type)
2247 binop->op_last = binop->op_first->op_sibling;
2249 return fold_constants((OP *)binop);
2253 uvcompare(const void *a, const void *b)
2255 if (*((UV *)a) < (*(UV *)b))
2257 if (*((UV *)a) > (*(UV *)b))
2259 if (*((UV *)a+1) < (*(UV *)b+1))
2261 if (*((UV *)a+1) > (*(UV *)b+1))
2267 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2269 SV *tstr = ((SVOP*)expr)->op_sv;
2270 SV *rstr = ((SVOP*)repl)->op_sv;
2273 U8 *t = (U8*)SvPV(tstr, tlen);
2274 U8 *r = (U8*)SvPV(rstr, rlen);
2281 register short *tbl;
2283 PL_hints |= HINT_BLOCK_SCOPE;
2284 complement = o->op_private & OPpTRANS_COMPLEMENT;
2285 del = o->op_private & OPpTRANS_DELETE;
2286 squash = o->op_private & OPpTRANS_SQUASH;
2289 o->op_private |= OPpTRANS_FROM_UTF;
2292 o->op_private |= OPpTRANS_TO_UTF;
2294 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2295 SV* listsv = newSVpvn("# comment\n",10);
2297 U8* tend = t + tlen;
2298 U8* rend = r + rlen;
2312 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2313 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2319 tsave = t = bytes_to_utf8(t, &len);
2322 if (!to_utf && rlen) {
2324 rsave = r = bytes_to_utf8(r, &len);
2328 /* There are several snags with this code on EBCDIC:
2329 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
2330 2. scan_const() in toke.c has encoded chars in native encoding which makes
2331 ranges at least in EBCDIC 0..255 range the bottom odd.
2335 U8 tmpbuf[UTF8_MAXLEN+1];
2338 New(1109, cp, 2*tlen, UV);
2340 transv = newSVpvn("",0);
2342 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, 0);
2344 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
2346 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, 0);
2350 cp[2*i+1] = cp[2*i];
2354 qsort(cp, i, 2*sizeof(UV), uvcompare);
2355 for (j = 0; j < i; j++) {
2357 diff = val - nextmin;
2359 t = uvuni_to_utf8(tmpbuf,nextmin);
2360 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2362 U8 range_mark = UTF_TO_NATIVE(0xff);
2363 t = uvuni_to_utf8(tmpbuf, val - 1);
2364 sv_catpvn(transv, (char *)&range_mark, 1);
2365 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2372 t = uvuni_to_utf8(tmpbuf,nextmin);
2373 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2375 U8 range_mark = UTF_TO_NATIVE(0xff);
2376 sv_catpvn(transv, (char *)&range_mark, 1);
2378 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
2379 UNICODE_ALLOW_SUPER);
2380 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2381 t = (U8*)SvPVX(transv);
2382 tlen = SvCUR(transv);
2386 else if (!rlen && !del) {
2387 r = t; rlen = tlen; rend = tend;
2390 if ((!rlen && !del) || t == r ||
2391 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2393 o->op_private |= OPpTRANS_IDENTICAL;
2397 while (t < tend || tfirst <= tlast) {
2398 /* see if we need more "t" chars */
2399 if (tfirst > tlast) {
2400 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, 0);
2402 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
2404 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, 0);
2411 /* now see if we need more "r" chars */
2412 if (rfirst > rlast) {
2414 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, 0);
2416 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
2418 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, 0);
2427 rfirst = rlast = 0xffffffff;
2431 /* now see which range will peter our first, if either. */
2432 tdiff = tlast - tfirst;
2433 rdiff = rlast - rfirst;
2440 if (rfirst == 0xffffffff) {
2441 diff = tdiff; /* oops, pretend rdiff is infinite */
2443 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2444 (long)tfirst, (long)tlast);
2446 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2450 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2451 (long)tfirst, (long)(tfirst + diff),
2454 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2455 (long)tfirst, (long)rfirst);
2457 if (rfirst + diff > max)
2458 max = rfirst + diff;
2460 grows = (tfirst < rfirst &&
2461 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
2473 else if (max > 0xff)
2478 Safefree(cPVOPo->op_pv);
2479 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2480 SvREFCNT_dec(listsv);
2482 SvREFCNT_dec(transv);
2484 if (!del && havefinal && rlen)
2485 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2486 newSVuv((UV)final), 0);
2489 o->op_private |= OPpTRANS_GROWS;
2501 tbl = (short*)cPVOPo->op_pv;
2503 Zero(tbl, 256, short);
2504 for (i = 0; i < (I32)tlen; i++)
2506 for (i = 0, j = 0; i < 256; i++) {
2508 if (j >= (I32)rlen) {
2517 if (i < 128 && r[j] >= 128)
2527 o->op_private |= OPpTRANS_IDENTICAL;
2529 else if (j >= (I32)rlen)
2532 cPVOPo->op_pv = (char*)Renew(tbl, 0x101+rlen-j, short);
2533 tbl[0x100] = rlen - j;
2534 for (i=0; i < (I32)rlen - j; i++)
2535 tbl[0x101+i] = r[j+i];
2539 if (!rlen && !del) {
2542 o->op_private |= OPpTRANS_IDENTICAL;
2544 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
2545 o->op_private |= OPpTRANS_IDENTICAL;
2547 for (i = 0; i < 256; i++)
2549 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
2550 if (j >= (I32)rlen) {
2552 if (tbl[t[i]] == -1)
2558 if (tbl[t[i]] == -1) {
2559 if (t[i] < 128 && r[j] >= 128)
2566 o->op_private |= OPpTRANS_GROWS;
2574 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2578 NewOp(1101, pmop, 1, PMOP);
2579 pmop->op_type = (OPCODE)type;
2580 pmop->op_ppaddr = PL_ppaddr[type];
2581 pmop->op_flags = (U8)flags;
2582 pmop->op_private = (U8)(0 | (flags >> 8));
2584 if (PL_hints & HINT_RE_TAINT)
2585 pmop->op_pmpermflags |= PMf_RETAINT;
2586 if (PL_hints & HINT_LOCALE)
2587 pmop->op_pmpermflags |= PMf_LOCALE;
2588 pmop->op_pmflags = pmop->op_pmpermflags;
2593 if(av_len((AV*) PL_regex_pad[0]) > -1) {
2594 repointer = av_pop((AV*)PL_regex_pad[0]);
2595 pmop->op_pmoffset = SvIV(repointer);
2596 SvREPADTMP_off(repointer);
2597 sv_setiv(repointer,0);
2599 repointer = newSViv(0);
2600 av_push(PL_regex_padav,SvREFCNT_inc(repointer));
2601 pmop->op_pmoffset = av_len(PL_regex_padav);
2602 PL_regex_pad = AvARRAY(PL_regex_padav);
2607 /* link into pm list */
2608 if (type != OP_TRANS && PL_curstash) {
2609 pmop->op_pmnext = HvPMROOT(PL_curstash);
2610 HvPMROOT(PL_curstash) = pmop;
2611 PmopSTASH_set(pmop,PL_curstash);
2618 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2622 I32 repl_has_vars = 0;
2624 if (o->op_type == OP_TRANS)
2625 return pmtrans(o, expr, repl);
2627 PL_hints |= HINT_BLOCK_SCOPE;
2630 if (expr->op_type == OP_CONST) {
2632 SV *pat = ((SVOP*)expr)->op_sv;
2633 char *p = SvPV(pat, plen);
2634 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2635 sv_setpvn(pat, "\\s+", 3);
2636 p = SvPV(pat, plen);
2637 pm->op_pmflags |= PMf_SKIPWHITE;
2640 pm->op_pmdynflags |= PMdf_UTF8;
2641 PM_SETRE(pm, CALLREGCOMP(aTHX_ p, p + plen, pm));
2642 if (strEQ("\\s+", PM_GETRE(pm)->precomp))
2643 pm->op_pmflags |= PMf_WHITE;
2647 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2648 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2650 : OP_REGCMAYBE),0,expr);
2652 NewOp(1101, rcop, 1, LOGOP);
2653 rcop->op_type = OP_REGCOMP;
2654 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2655 rcop->op_first = scalar(expr);
2656 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2657 ? (OPf_SPECIAL | OPf_KIDS)
2659 rcop->op_private = 1;
2661 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
2664 /* establish postfix order */
2665 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2667 rcop->op_next = expr;
2668 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2671 rcop->op_next = LINKLIST(expr);
2672 expr->op_next = (OP*)rcop;
2675 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2680 if (pm->op_pmflags & PMf_EVAL) {
2682 if (CopLINE(PL_curcop) < (line_t)PL_multi_end)
2683 CopLINE_set(PL_curcop, (line_t)PL_multi_end);
2685 else if (repl->op_type == OP_CONST)
2689 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2690 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2691 if (curop->op_type == OP_GV) {
2692 GV *gv = cGVOPx_gv(curop);
2694 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
2697 else if (curop->op_type == OP_RV2CV)
2699 else if (curop->op_type == OP_RV2SV ||
2700 curop->op_type == OP_RV2AV ||
2701 curop->op_type == OP_RV2HV ||
2702 curop->op_type == OP_RV2GV) {
2703 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2706 else if (curop->op_type == OP_PADSV ||
2707 curop->op_type == OP_PADAV ||
2708 curop->op_type == OP_PADHV ||
2709 curop->op_type == OP_PADANY) {
2712 else if (curop->op_type == OP_PUSHRE)
2713 ; /* Okay here, dangerous in newASSIGNOP */
2723 || PM_GETRE(pm)->reganch & ROPT_EVAL_SEEN))) {
2724 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2725 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2726 prepend_elem(o->op_type, scalar(repl), o);
2729 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
2730 pm->op_pmflags |= PMf_MAYBE_CONST;
2731 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2733 NewOp(1101, rcop, 1, LOGOP);
2734 rcop->op_type = OP_SUBSTCONT;
2735 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2736 rcop->op_first = scalar(repl);
2737 rcop->op_flags |= OPf_KIDS;
2738 rcop->op_private = 1;
2741 /* establish postfix order */
2742 rcop->op_next = LINKLIST(repl);
2743 repl->op_next = (OP*)rcop;
2745 pm->op_pmreplroot = scalar((OP*)rcop);
2746 pm->op_pmreplstart = LINKLIST(rcop);
2755 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2758 NewOp(1101, svop, 1, SVOP);
2759 svop->op_type = (OPCODE)type;
2760 svop->op_ppaddr = PL_ppaddr[type];
2762 svop->op_next = (OP*)svop;
2763 svop->op_flags = (U8)flags;
2764 if (PL_opargs[type] & OA_RETSCALAR)
2766 if (PL_opargs[type] & OA_TARGET)
2767 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2768 return CHECKOP(type, svop);
2772 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2775 NewOp(1101, padop, 1, PADOP);
2776 padop->op_type = (OPCODE)type;
2777 padop->op_ppaddr = PL_ppaddr[type];
2778 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2779 SvREFCNT_dec(PAD_SVl(padop->op_padix));
2780 PAD_SETSV(padop->op_padix, sv);
2783 padop->op_next = (OP*)padop;
2784 padop->op_flags = (U8)flags;
2785 if (PL_opargs[type] & OA_RETSCALAR)
2787 if (PL_opargs[type] & OA_TARGET)
2788 padop->op_targ = pad_alloc(type, SVs_PADTMP);
2789 return CHECKOP(type, padop);
2793 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2798 return newPADOP(type, flags, SvREFCNT_inc(gv));
2800 return newSVOP(type, flags, SvREFCNT_inc(gv));
2805 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2808 NewOp(1101, pvop, 1, PVOP);
2809 pvop->op_type = (OPCODE)type;
2810 pvop->op_ppaddr = PL_ppaddr[type];
2812 pvop->op_next = (OP*)pvop;
2813 pvop->op_flags = (U8)flags;
2814 if (PL_opargs[type] & OA_RETSCALAR)
2816 if (PL_opargs[type] & OA_TARGET)
2817 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2818 return CHECKOP(type, pvop);
2822 Perl_package(pTHX_ OP *o)
2827 save_hptr(&PL_curstash);
2828 save_item(PL_curstname);
2830 name = SvPV(cSVOPo->op_sv, len);
2831 PL_curstash = gv_stashpvn(name, len, TRUE);
2832 sv_setpvn(PL_curstname, name, len);
2835 PL_hints |= HINT_BLOCK_SCOPE;
2836 PL_copline = NOLINE;
2841 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
2847 if (idop->op_type != OP_CONST)
2848 Perl_croak(aTHX_ "Module name must be constant");
2852 if (version != Nullop) {
2853 SV *vesv = ((SVOP*)version)->op_sv;
2855 if (arg == Nullop && !SvNIOKp(vesv)) {
2862 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
2863 Perl_croak(aTHX_ "Version number must be constant number");
2865 /* Make copy of idop so we don't free it twice */
2866 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
2868 /* Fake up a method call to VERSION */
2869 meth = newSVpvn("VERSION",7);
2870 sv_upgrade(meth, SVt_PVIV);
2871 (void)SvIOK_on(meth);
2872 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
2873 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2874 append_elem(OP_LIST,
2875 prepend_elem(OP_LIST, pack, list(version)),
2876 newSVOP(OP_METHOD_NAMED, 0, meth)));
2880 /* Fake up an import/unimport */
2881 if (arg && arg->op_type == OP_STUB)
2882 imop = arg; /* no import on explicit () */
2883 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
2884 imop = Nullop; /* use 5.0; */
2889 /* Make copy of idop so we don't free it twice */
2890 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
2892 /* Fake up a method call to import/unimport */
2893 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);
2894 (void)SvUPGRADE(meth, SVt_PVIV);
2895 (void)SvIOK_on(meth);
2896 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
2897 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2898 append_elem(OP_LIST,
2899 prepend_elem(OP_LIST, pack, list(arg)),
2900 newSVOP(OP_METHOD_NAMED, 0, meth)));
2903 /* Fake up the BEGIN {}, which does its thing immediately. */
2905 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2908 append_elem(OP_LINESEQ,
2909 append_elem(OP_LINESEQ,
2910 newSTATEOP(0, Nullch, newUNOP(OP_REQUIRE, 0, idop)),
2911 newSTATEOP(0, Nullch, veop)),
2912 newSTATEOP(0, Nullch, imop) ));
2914 /* The "did you use incorrect case?" warning used to be here.
2915 * The problem is that on case-insensitive filesystems one
2916 * might get false positives for "use" (and "require"):
2917 * "use Strict" or "require CARP" will work. This causes
2918 * portability problems for the script: in case-strict
2919 * filesystems the script will stop working.
2921 * The "incorrect case" warning checked whether "use Foo"
2922 * imported "Foo" to your namespace, but that is wrong, too:
2923 * there is no requirement nor promise in the language that
2924 * a Foo.pm should or would contain anything in package "Foo".
2926 * There is very little Configure-wise that can be done, either:
2927 * the case-sensitivity of the build filesystem of Perl does not
2928 * help in guessing the case-sensitivity of the runtime environment.
2931 PL_hints |= HINT_BLOCK_SCOPE;
2932 PL_copline = NOLINE;
2937 =head1 Embedding Functions
2939 =for apidoc load_module
2941 Loads the module whose name is pointed to by the string part of name.
2942 Note that the actual module name, not its filename, should be given.
2943 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
2944 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
2945 (or 0 for no flags). ver, if specified, provides version semantics
2946 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
2947 arguments can be used to specify arguments to the module's import()
2948 method, similar to C<use Foo::Bar VERSION LIST>.
2953 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
2956 va_start(args, ver);
2957 vload_module(flags, name, ver, &args);
2961 #ifdef PERL_IMPLICIT_CONTEXT
2963 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
2967 va_start(args, ver);
2968 vload_module(flags, name, ver, &args);
2974 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
2976 OP *modname, *veop, *imop;
2978 modname = newSVOP(OP_CONST, 0, name);
2979 modname->op_private |= OPpCONST_BARE;
2981 veop = newSVOP(OP_CONST, 0, ver);
2985 if (flags & PERL_LOADMOD_NOIMPORT) {
2986 imop = sawparens(newNULLLIST());
2988 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
2989 imop = va_arg(*args, OP*);
2994 sv = va_arg(*args, SV*);
2996 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
2997 sv = va_arg(*args, SV*);
3001 line_t ocopline = PL_copline;
3002 COP *ocurcop = PL_curcop;
3003 int oexpect = PL_expect;
3005 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3006 veop, modname, imop);
3007 PL_expect = oexpect;
3008 PL_copline = ocopline;
3009 PL_curcop = ocurcop;
3014 Perl_dofile(pTHX_ OP *term)
3019 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3020 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
3021 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3023 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
3024 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3025 append_elem(OP_LIST, term,
3026 scalar(newUNOP(OP_RV2CV, 0,
3031 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3037 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3039 return newBINOP(OP_LSLICE, flags,
3040 list(force_list(subscript)),
3041 list(force_list(listval)) );
3045 S_list_assignment(pTHX_ register OP *o)
3050 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3051 o = cUNOPo->op_first;
3053 if (o->op_type == OP_COND_EXPR) {
3054 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3055 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3060 yyerror("Assignment to both a list and a scalar");
3064 if (o->op_type == OP_LIST &&
3065 (o->op_flags & OPf_WANT) == OPf_WANT_SCALAR &&
3066 o->op_private & OPpLVAL_INTRO)
3069 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3070 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3071 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3074 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3077 if (o->op_type == OP_RV2SV)
3084 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3089 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
3090 return newLOGOP(optype, 0,
3091 mod(scalar(left), optype),
3092 newUNOP(OP_SASSIGN, 0, scalar(right)));
3095 return newBINOP(optype, OPf_STACKED,
3096 mod(scalar(left), optype), scalar(right));
3100 if (list_assignment(left)) {
3104 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3105 left = mod(left, OP_AASSIGN);
3113 curop = list(force_list(left));
3114 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3115 o->op_private = (U8)(0 | (flags >> 8));
3117 /* PL_generation sorcery:
3118 * an assignment like ($a,$b) = ($c,$d) is easier than
3119 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
3120 * To detect whether there are common vars, the global var
3121 * PL_generation is incremented for each assign op we compile.
3122 * Then, while compiling the assign op, we run through all the
3123 * variables on both sides of the assignment, setting a spare slot
3124 * in each of them to PL_generation. If any of them already have
3125 * that value, we know we've got commonality. We could use a
3126 * single bit marker, but then we'd have to make 2 passes, first
3127 * to clear the flag, then to test and set it. To find somewhere
3128 * to store these values, evil chicanery is done with SvCUR().
3131 if (!(left->op_private & OPpLVAL_INTRO)) {
3134 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3135 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3136 if (curop->op_type == OP_GV) {
3137 GV *gv = cGVOPx_gv(curop);
3138 if (gv == PL_defgv || (int)SvCUR(gv) == PL_generation)
3140 SvCUR(gv) = PL_generation;
3142 else if (curop->op_type == OP_PADSV ||
3143 curop->op_type == OP_PADAV ||
3144 curop->op_type == OP_PADHV ||
3145 curop->op_type == OP_PADANY)
3147 if (PAD_COMPNAME_GEN(curop->op_targ)
3148 == (STRLEN)PL_generation)
3150 PAD_COMPNAME_GEN(curop->op_targ)
3154 else if (curop->op_type == OP_RV2CV)
3156 else if (curop->op_type == OP_RV2SV ||
3157 curop->op_type == OP_RV2AV ||
3158 curop->op_type == OP_RV2HV ||
3159 curop->op_type == OP_RV2GV) {
3160 if (lastop->op_type != OP_GV) /* funny deref? */
3163 else if (curop->op_type == OP_PUSHRE) {
3164 if (((PMOP*)curop)->op_pmreplroot) {
3166 GV *gv = (GV*)PAD_SVl(INT2PTR(PADOFFSET,
3167 ((PMOP*)curop)->op_pmreplroot));
3169 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3171 if (gv == PL_defgv || (int)SvCUR(gv) == PL_generation)
3173 SvCUR(gv) = PL_generation;
3182 o->op_private |= OPpASSIGN_COMMON;
3184 if (right && right->op_type == OP_SPLIT) {
3186 if ((tmpop = ((LISTOP*)right)->op_first) &&
3187 tmpop->op_type == OP_PUSHRE)
3189 PMOP *pm = (PMOP*)tmpop;
3190 if (left->op_type == OP_RV2AV &&
3191 !(left->op_private & OPpLVAL_INTRO) &&
3192 !(o->op_private & OPpASSIGN_COMMON) )
3194 tmpop = ((UNOP*)left)->op_first;
3195 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3197 pm->op_pmreplroot = INT2PTR(OP*, cPADOPx(tmpop)->op_padix);
3198 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3200 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3201 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3203 pm->op_pmflags |= PMf_ONCE;
3204 tmpop = cUNOPo->op_first; /* to list (nulled) */
3205 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3206 tmpop->op_sibling = Nullop; /* don't free split */
3207 right->op_next = tmpop->op_next; /* fix starting loc */
3208 op_free(o); /* blow off assign */
3209 right->op_flags &= ~OPf_WANT;
3210 /* "I don't know and I don't care." */
3215 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
3216 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3218 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3220 sv_setiv(sv, PL_modcount+1);
3228 right = newOP(OP_UNDEF, 0);
3229 if (right->op_type == OP_READLINE) {
3230 right->op_flags |= OPf_STACKED;
3231 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3234 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3235 o = newBINOP(OP_SASSIGN, flags,
3236 scalar(right), mod(scalar(left), OP_SASSIGN) );
3248 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3250 U32 seq = intro_my();
3253 NewOp(1101, cop, 1, COP);
3254 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3255 cop->op_type = OP_DBSTATE;
3256 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3259 cop->op_type = OP_NEXTSTATE;
3260 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3262 cop->op_flags = (U8)flags;
3263 cop->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
3265 cop->op_private |= NATIVE_HINTS;
3267 PL_compiling.op_private = cop->op_private;
3268 cop->op_next = (OP*)cop;
3271 cop->cop_label = label;
3272 PL_hints |= HINT_BLOCK_SCOPE;
3275 cop->cop_arybase = PL_curcop->cop_arybase;
3276 if (specialWARN(PL_curcop->cop_warnings))
3277 cop->cop_warnings = PL_curcop->cop_warnings ;
3279 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3280 if (specialCopIO(PL_curcop->cop_io))
3281 cop->cop_io = PL_curcop->cop_io;
3283 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3286 if (PL_copline == NOLINE)
3287 CopLINE_set(cop, CopLINE(PL_curcop));
3289 CopLINE_set(cop, PL_copline);
3290 PL_copline = NOLINE;
3293 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3295 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3297 CopSTASH_set(cop, PL_curstash);
3299 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3300 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3301 if (svp && *svp != &PL_sv_undef ) {
3302 (void)SvIOK_on(*svp);
3303 SvIVX(*svp) = PTR2IV(cop);
3307 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3312 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3314 return new_logop(type, flags, &first, &other);
3318 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3322 OP *first = *firstp;
3323 OP *other = *otherp;
3325 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3326 return newBINOP(type, flags, scalar(first), scalar(other));
3328 scalarboolean(first);
3329 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3330 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3331 if (type == OP_AND || type == OP_OR) {
3337 first = *firstp = cUNOPo->op_first;
3339 first->op_next = o->op_next;
3340 cUNOPo->op_first = Nullop;
3344 if (first->op_type == OP_CONST) {
3345 if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE)) {
3346 if (first->op_private & OPpCONST_STRICT)
3347 no_bareword_allowed(first);
3349 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
3351 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3362 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS)) {
3363 OP *k1 = ((UNOP*)first)->op_first;
3364 OP *k2 = k1->op_sibling;
3366 switch (first->op_type)
3369 if (k2 && k2->op_type == OP_READLINE
3370 && (k2->op_flags & OPf_STACKED)
3371 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3373 warnop = k2->op_type;
3378 if (k1->op_type == OP_READDIR
3379 || k1->op_type == OP_GLOB
3380 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3381 || k1->op_type == OP_EACH)
3383 warnop = ((k1->op_type == OP_NULL)
3384 ? (OPCODE)k1->op_targ : k1->op_type);
3389 line_t oldline = CopLINE(PL_curcop);
3390 CopLINE_set(PL_curcop, PL_copline);
3391 Perl_warner(aTHX_ packWARN(WARN_MISC),
3392 "Value of %s%s can be \"0\"; test with defined()",
3394 ((warnop == OP_READLINE || warnop == OP_GLOB)
3395 ? " construct" : "() operator"));
3396 CopLINE_set(PL_curcop, oldline);
3403 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
3404 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3406 NewOp(1101, logop, 1, LOGOP);
3408 logop->op_type = (OPCODE)type;
3409 logop->op_ppaddr = PL_ppaddr[type];
3410 logop->op_first = first;
3411 logop->op_flags = flags | OPf_KIDS;
3412 logop->op_other = LINKLIST(other);
3413 logop->op_private = (U8)(1 | (flags >> 8));
3415 /* establish postfix order */
3416 logop->op_next = LINKLIST(first);
3417 first->op_next = (OP*)logop;
3418 first->op_sibling = other;
3420 o = newUNOP(OP_NULL, 0, (OP*)logop);
3427 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3434 return newLOGOP(OP_AND, 0, first, trueop);
3436 return newLOGOP(OP_OR, 0, first, falseop);
3438 scalarboolean(first);
3439 if (first->op_type == OP_CONST) {
3440 if (first->op_private & OPpCONST_BARE &&
3441 first->op_private & OPpCONST_STRICT) {
3442 no_bareword_allowed(first);
3444 if (SvTRUE(((SVOP*)first)->op_sv)) {
3455 NewOp(1101, logop, 1, LOGOP);
3456 logop->op_type = OP_COND_EXPR;
3457 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3458 logop->op_first = first;
3459 logop->op_flags = flags | OPf_KIDS;
3460 logop->op_private = (U8)(1 | (flags >> 8));
3461 logop->op_other = LINKLIST(trueop);
3462 logop->op_next = LINKLIST(falseop);
3465 /* establish postfix order */
3466 start = LINKLIST(first);
3467 first->op_next = (OP*)logop;
3469 first->op_sibling = trueop;
3470 trueop->op_sibling = falseop;
3471 o = newUNOP(OP_NULL, 0, (OP*)logop);
3473 trueop->op_next = falseop->op_next = o;
3480 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3488 NewOp(1101, range, 1, LOGOP);
3490 range->op_type = OP_RANGE;
3491 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3492 range->op_first = left;
3493 range->op_flags = OPf_KIDS;
3494 leftstart = LINKLIST(left);
3495 range->op_other = LINKLIST(right);
3496 range->op_private = (U8)(1 | (flags >> 8));
3498 left->op_sibling = right;
3500 range->op_next = (OP*)range;
3501 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3502 flop = newUNOP(OP_FLOP, 0, flip);
3503 o = newUNOP(OP_NULL, 0, flop);
3505 range->op_next = leftstart;
3507 left->op_next = flip;
3508 right->op_next = flop;
3510 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3511 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3512 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3513 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3515 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3516 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3519 if (!flip->op_private || !flop->op_private)
3520 linklist(o); /* blow off optimizer unless constant */
3526 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3530 int once = block && block->op_flags & OPf_SPECIAL &&
3531 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3534 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3535 return block; /* do {} while 0 does once */
3536 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3537 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3538 expr = newUNOP(OP_DEFINED, 0,
3539 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3540 } else if (expr->op_flags & OPf_KIDS) {
3541 OP *k1 = ((UNOP*)expr)->op_first;
3542 OP *k2 = (k1) ? k1->op_sibling : NULL;
3543 switch (expr->op_type) {
3545 if (k2 && k2->op_type == OP_READLINE
3546 && (k2->op_flags & OPf_STACKED)
3547 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3548 expr = newUNOP(OP_DEFINED, 0, expr);
3552 if (k1->op_type == OP_READDIR
3553 || k1->op_type == OP_GLOB
3554 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3555 || k1->op_type == OP_EACH)
3556 expr = newUNOP(OP_DEFINED, 0, expr);
3562 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3563 o = new_logop(OP_AND, 0, &expr, &listop);
3566 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3568 if (once && o != listop)
3569 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3572 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3574 o->op_flags |= flags;
3576 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3581 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3589 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3590 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3591 expr = newUNOP(OP_DEFINED, 0,
3592 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3593 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3594 OP *k1 = ((UNOP*)expr)->op_first;
3595 OP *k2 = (k1) ? k1->op_sibling : NULL;
3596 switch (expr->op_type) {
3598 if (k2 && k2->op_type == OP_READLINE
3599 && (k2->op_flags & OPf_STACKED)
3600 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3601 expr = newUNOP(OP_DEFINED, 0, expr);
3605 if (k1->op_type == OP_READDIR
3606 || k1->op_type == OP_GLOB
3607 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3608 || k1->op_type == OP_EACH)
3609 expr = newUNOP(OP_DEFINED, 0, expr);
3615 block = newOP(OP_NULL, 0);
3617 block = scope(block);
3621 next = LINKLIST(cont);
3624 OP *unstack = newOP(OP_UNSTACK, 0);
3627 cont = append_elem(OP_LINESEQ, cont, unstack);
3630 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3631 redo = LINKLIST(listop);
3634 PL_copline = (line_t)whileline;
3636 o = new_logop(OP_AND, 0, &expr, &listop);
3637 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3638 op_free(expr); /* oops, it's a while (0) */
3640 return Nullop; /* listop already freed by new_logop */
3643 ((LISTOP*)listop)->op_last->op_next =
3644 (o == listop ? redo : LINKLIST(o));
3650 NewOp(1101,loop,1,LOOP);
3651 loop->op_type = OP_ENTERLOOP;
3652 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3653 loop->op_private = 0;
3654 loop->op_next = (OP*)loop;
3657 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3659 loop->op_redoop = redo;
3660 loop->op_lastop = o;
3661 o->op_private |= loopflags;
3664 loop->op_nextop = next;
3666 loop->op_nextop = o;
3668 o->op_flags |= flags;
3669 o->op_private |= (flags >> 8);
3674 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3678 PADOFFSET padoff = 0;
3683 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3684 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
3685 sv->op_type = OP_RV2GV;
3686 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3688 else if (sv->op_type == OP_PADSV) { /* private variable */
3689 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
3690 padoff = sv->op_targ;
3695 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3696 padoff = sv->op_targ;
3698 iterflags |= OPf_SPECIAL;
3703 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3706 sv = newGVOP(OP_GV, 0, PL_defgv);
3708 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3709 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3710 iterflags |= OPf_STACKED;
3712 else if (expr->op_type == OP_NULL &&
3713 (expr->op_flags & OPf_KIDS) &&
3714 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3716 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3717 * set the STACKED flag to indicate that these values are to be
3718 * treated as min/max values by 'pp_iterinit'.
3720 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3721 LOGOP* range = (LOGOP*) flip->op_first;
3722 OP* left = range->op_first;
3723 OP* right = left->op_sibling;
3726 range->op_flags &= ~OPf_KIDS;
3727 range->op_first = Nullop;
3729 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3730 listop->op_first->op_next = range->op_next;
3731 left->op_next = range->op_other;
3732 right->op_next = (OP*)listop;
3733 listop->op_next = listop->op_first;
3736 expr = (OP*)(listop);
3738 iterflags |= OPf_STACKED;
3741 expr = mod(force_list(expr), OP_GREPSTART);
3745 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3746 append_elem(OP_LIST, expr, scalar(sv))));
3747 assert(!loop->op_next);
3748 /* for my $x () sets OPpLVAL_INTRO;
3749 * for our $x () sets OPpOUR_INTRO; both only used by Deparse.pm */
3750 loop->op_private = (U8)iterpflags;
3751 #ifdef PL_OP_SLAB_ALLOC
3754 NewOp(1234,tmp,1,LOOP);
3755 Copy(loop,tmp,1,LOOP);
3760 Renew(loop, 1, LOOP);
3762 loop->op_targ = padoff;
3763 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3764 PL_copline = forline;
3765 return newSTATEOP(0, label, wop);
3769 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3774 if (type != OP_GOTO || label->op_type == OP_CONST) {
3775 /* "last()" means "last" */
3776 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3777 o = newOP(type, OPf_SPECIAL);
3779 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3780 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3786 if (label->op_type == OP_ENTERSUB)
3787 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3788 o = newUNOP(type, OPf_STACKED, label);
3790 PL_hints |= HINT_BLOCK_SCOPE;
3795 =for apidoc cv_undef
3797 Clear out all the active components of a CV. This can happen either
3798 by an explicit C<undef &foo>, or by the reference count going to zero.
3799 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
3800 children can still follow the full lexical scope chain.
3806 Perl_cv_undef(pTHX_ CV *cv)
3809 if (CvFILE(cv) && !CvXSUB(cv)) {
3810 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
3811 Safefree(CvFILE(cv));
3816 if (!CvXSUB(cv) && CvROOT(cv)) {
3818 Perl_croak(aTHX_ "Can't undef active subroutine");
3821 PAD_SAVE_SETNULLPAD();
3823 op_free(CvROOT(cv));
3824 CvROOT(cv) = Nullop;
3827 SvPOK_off((SV*)cv); /* forget prototype */
3832 /* remove CvOUTSIDE unless this is an undef rather than a free */
3833 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
3834 if (!CvWEAKOUTSIDE(cv))
3835 SvREFCNT_dec(CvOUTSIDE(cv));
3836 CvOUTSIDE(cv) = Nullcv;
3839 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
3845 /* delete all flags except WEAKOUTSIDE */
3846 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
3850 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3852 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
3853 SV* msg = sv_newmortal();
3857 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3858 sv_setpv(msg, "Prototype mismatch:");
3860 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
3862 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", (SV *)cv);
3863 sv_catpv(msg, " vs ");
3865 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3867 sv_catpv(msg, "none");
3868 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, msg);
3872 static void const_sv_xsub(pTHX_ CV* cv);
3876 =head1 Optree Manipulation Functions
3878 =for apidoc cv_const_sv
3880 If C<cv> is a constant sub eligible for inlining. returns the constant
3881 value returned by the sub. Otherwise, returns NULL.
3883 Constant subs can be created with C<newCONSTSUB> or as described in
3884 L<perlsub/"Constant Functions">.
3889 Perl_cv_const_sv(pTHX_ CV *cv)
3891 if (!cv || !CvCONST(cv))
3893 return (SV*)CvXSUBANY(cv).any_ptr;
3896 /* op_const_sv: examine an optree to determine whether it's in-lineable.
3897 * Can be called in 3 ways:
3900 * look for a single OP_CONST with attached value: return the value
3902 * cv && CvCLONE(cv) && !CvCONST(cv)
3904 * examine the clone prototype, and if contains only a single
3905 * OP_CONST referencing a pad const, or a single PADSV referencing
3906 * an outer lexical, return a non-zero value to indicate the CV is
3907 * a candidate for "constizing" at clone time
3911 * We have just cloned an anon prototype that was marked as a const
3912 * candidiate. Try to grab the current value, and in the case of
3913 * PADSV, ignore it if it has multiple references. Return the value.
3917 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3924 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3925 o = cLISTOPo->op_first->op_sibling;
3927 for (; o; o = o->op_next) {
3928 OPCODE type = o->op_type;
3930 if (sv && o->op_next == o)
3932 if (o->op_next != o) {
3933 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3935 if (type == OP_DBSTATE)
3938 if (type == OP_LEAVESUB || type == OP_RETURN)
3942 if (type == OP_CONST && cSVOPo->op_sv)
3944 else if (cv && type == OP_CONST) {
3945 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
3949 else if (cv && type == OP_PADSV) {
3950 if (CvCONST(cv)) { /* newly cloned anon */
3951 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
3952 /* the candidate should have 1 ref from this pad and 1 ref
3953 * from the parent */
3954 if (!sv || SvREFCNT(sv) != 2)
3961 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
3962 sv = &PL_sv_undef; /* an arbitrary non-null value */
3973 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
3983 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
3987 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
3989 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
3993 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
3999 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4003 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4004 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4005 SV *sv = sv_newmortal();
4006 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
4007 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
4008 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4013 gv = gv_fetchpv(name ? name : (aname ? aname :
4014 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__")),
4015 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4025 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4026 maximum a prototype before. */
4027 if (SvTYPE(gv) > SVt_NULL) {
4028 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4029 && ckWARN_d(WARN_PROTOTYPE))
4031 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
4033 cv_ckproto((CV*)gv, NULL, ps);
4036 sv_setpv((SV*)gv, ps);
4038 sv_setiv((SV*)gv, -1);
4039 SvREFCNT_dec(PL_compcv);
4040 cv = PL_compcv = NULL;
4041 PL_sub_generation++;
4045 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4047 #ifdef GV_UNIQUE_CHECK
4048 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
4049 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
4053 if (!block || !ps || *ps || attrs)
4056 const_sv = op_const_sv(block, Nullcv);
4059 bool exists = CvROOT(cv) || CvXSUB(cv);
4061 #ifdef GV_UNIQUE_CHECK
4062 if (exists && GvUNIQUE(gv)) {
4063 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
4067 /* if the subroutine doesn't exist and wasn't pre-declared
4068 * with a prototype, assume it will be AUTOLOADed,
4069 * skipping the prototype check
4071 if (exists || SvPOK(cv))
4072 cv_ckproto(cv, gv, ps);
4073 /* already defined (or promised)? */
4074 if (exists || GvASSUMECV(gv)) {
4075 if (!block && !attrs) {
4076 if (CvFLAGS(PL_compcv)) {
4077 /* might have had built-in attrs applied */
4078 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4080 /* just a "sub foo;" when &foo is already defined */
4081 SAVEFREESV(PL_compcv);
4084 /* ahem, death to those who redefine active sort subs */
4085 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4086 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4088 if (ckWARN(WARN_REDEFINE)
4090 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4092 line_t oldline = CopLINE(PL_curcop);
4093 if (PL_copline != NOLINE)
4094 CopLINE_set(PL_curcop, PL_copline);
4095 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4096 CvCONST(cv) ? "Constant subroutine %s redefined"
4097 : "Subroutine %s redefined", name);
4098 CopLINE_set(PL_curcop, oldline);
4106 SvREFCNT_inc(const_sv);
4108 assert(!CvROOT(cv) && !CvCONST(cv));
4109 sv_setpv((SV*)cv, ""); /* prototype is "" */
4110 CvXSUBANY(cv).any_ptr = const_sv;
4111 CvXSUB(cv) = const_sv_xsub;
4116 cv = newCONSTSUB(NULL, name, const_sv);
4119 SvREFCNT_dec(PL_compcv);
4121 PL_sub_generation++;
4128 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4129 * before we clobber PL_compcv.
4133 /* Might have had built-in attributes applied -- propagate them. */
4134 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4135 if (CvGV(cv) && GvSTASH(CvGV(cv)))
4136 stash = GvSTASH(CvGV(cv));
4137 else if (CvSTASH(cv))
4138 stash = CvSTASH(cv);
4140 stash = PL_curstash;
4143 /* possibly about to re-define existing subr -- ignore old cv */
4144 rcv = (SV*)PL_compcv;
4145 if (name && GvSTASH(gv))
4146 stash = GvSTASH(gv);
4148 stash = PL_curstash;
4150 apply_attrs(stash, rcv, attrs, FALSE);
4152 if (cv) { /* must reuse cv if autoloaded */
4154 /* got here with just attrs -- work done, so bug out */
4155 SAVEFREESV(PL_compcv);
4158 /* transfer PL_compcv to cv */
4160 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4161 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4162 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
4163 CvOUTSIDE(PL_compcv) = 0;
4164 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4165 CvPADLIST(PL_compcv) = 0;
4166 /* inner references to PL_compcv must be fixed up ... */
4167 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
4168 /* ... before we throw it away */
4169 SvREFCNT_dec(PL_compcv);
4171 if (PERLDB_INTER)/* Advice debugger on the new sub. */
4172 ++PL_sub_generation;
4179 PL_sub_generation++;
4183 CvFILE_set_from_cop(cv, PL_curcop);
4184 CvSTASH(cv) = PL_curstash;
4187 sv_setpv((SV*)cv, ps);
4189 if (PL_error_count) {
4193 char *s = strrchr(name, ':');
4195 if (strEQ(s, "BEGIN")) {
4197 "BEGIN not safe after errors--compilation aborted";
4198 if (PL_in_eval & EVAL_KEEPERR)
4199 Perl_croak(aTHX_ not_safe);
4201 /* force display of errors found but not reported */
4202 sv_catpv(ERRSV, not_safe);
4203 Perl_croak(aTHX_ "%"SVf, ERRSV);
4212 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
4213 mod(scalarseq(block), OP_LEAVESUBLV));
4216 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4218 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4219 OpREFCNT_set(CvROOT(cv), 1);
4220 CvSTART(cv) = LINKLIST(CvROOT(cv));
4221 CvROOT(cv)->op_next = 0;
4222 CALL_PEEP(CvSTART(cv));
4224 /* now that optimizer has done its work, adjust pad values */
4226 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
4229 assert(!CvCONST(cv));
4230 if (ps && !*ps && op_const_sv(block, cv))
4234 if (name || aname) {
4236 char *tname = (name ? name : aname);
4238 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4239 SV *sv = NEWSV(0,0);
4240 SV *tmpstr = sv_newmortal();
4241 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4245 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4247 (long)PL_subline, (long)CopLINE(PL_curcop));
4248 gv_efullname3(tmpstr, gv, Nullch);
4249 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4250 hv = GvHVn(db_postponed);
4251 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4252 && (pcv = GvCV(db_postponed)))
4258 call_sv((SV*)pcv, G_DISCARD);
4262 if ((s = strrchr(tname,':')))
4267 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4270 if (strEQ(s, "BEGIN") && !PL_error_count) {
4271 I32 oldscope = PL_scopestack_ix;
4273 SAVECOPFILE(&PL_compiling);
4274 SAVECOPLINE(&PL_compiling);
4277 PL_beginav = newAV();
4278 DEBUG_x( dump_sub(gv) );
4279 av_push(PL_beginav, (SV*)cv);
4280 GvCV(gv) = 0; /* cv has been hijacked */
4281 call_list(oldscope, PL_beginav);
4283 PL_curcop = &PL_compiling;
4284 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
4287 else if (strEQ(s, "END") && !PL_error_count) {
4290 DEBUG_x( dump_sub(gv) );
4291 av_unshift(PL_endav, 1);
4292 av_store(PL_endav, 0, (SV*)cv);
4293 GvCV(gv) = 0; /* cv has been hijacked */
4295 else if (strEQ(s, "CHECK") && !PL_error_count) {
4297 PL_checkav = newAV();
4298 DEBUG_x( dump_sub(gv) );
4299 if (PL_main_start && ckWARN(WARN_VOID))
4300 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
4301 av_unshift(PL_checkav, 1);
4302 av_store(PL_checkav, 0, (SV*)cv);
4303 GvCV(gv) = 0; /* cv has been hijacked */
4305 else if (strEQ(s, "INIT") && !PL_error_count) {
4307 PL_initav = newAV();
4308 DEBUG_x( dump_sub(gv) );
4309 if (PL_main_start && ckWARN(WARN_VOID))
4310 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
4311 av_push(PL_initav, (SV*)cv);
4312 GvCV(gv) = 0; /* cv has been hijacked */
4317 PL_copline = NOLINE;
4322 /* XXX unsafe for threads if eval_owner isn't held */
4324 =for apidoc newCONSTSUB
4326 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4327 eligible for inlining at compile-time.
4333 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4339 SAVECOPLINE(PL_curcop);
4340 CopLINE_set(PL_curcop, PL_copline);
4343 PL_hints &= ~HINT_BLOCK_SCOPE;
4346 SAVESPTR(PL_curstash);
4347 SAVECOPSTASH(PL_curcop);
4348 PL_curstash = stash;
4349 CopSTASH_set(PL_curcop,stash);
4352 cv = newXS(name, const_sv_xsub, savepv(CopFILE(PL_curcop)));
4353 CvXSUBANY(cv).any_ptr = sv;
4355 sv_setpv((SV*)cv, ""); /* prototype is "" */
4363 =for apidoc U||newXS
4365 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4371 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4373 GV *gv = gv_fetchpv(name ? name :
4374 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
4375 GV_ADDMULTI, SVt_PVCV);
4379 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
4381 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4383 /* just a cached method */
4387 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4388 /* already defined (or promised) */
4389 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4390 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4391 line_t oldline = CopLINE(PL_curcop);
4392 if (PL_copline != NOLINE)
4393 CopLINE_set(PL_curcop, PL_copline);
4394 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4395 CvCONST(cv) ? "Constant subroutine %s redefined"
4396 : "Subroutine %s redefined"
4398 CopLINE_set(PL_curcop, oldline);
4405 if (cv) /* must reuse cv if autoloaded */
4408 cv = (CV*)NEWSV(1105,0);
4409 sv_upgrade((SV *)cv, SVt_PVCV);
4413 PL_sub_generation++;
4417 (void)gv_fetchfile(filename);
4418 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4419 an external constant string */
4420 CvXSUB(cv) = subaddr;
4423 char *s = strrchr(name,':');
4429 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4432 if (strEQ(s, "BEGIN")) {
4434 PL_beginav = newAV();
4435 av_push(PL_beginav, (SV*)cv);
4436 GvCV(gv) = 0; /* cv has been hijacked */
4438 else if (strEQ(s, "END")) {
4441 av_unshift(PL_endav, 1);
4442 av_store(PL_endav, 0, (SV*)cv);
4443 GvCV(gv) = 0; /* cv has been hijacked */
4445 else if (strEQ(s, "CHECK")) {
4447 PL_checkav = newAV();
4448 if (PL_main_start && ckWARN(WARN_VOID))
4449 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
4450 av_unshift(PL_checkav, 1);
4451 av_store(PL_checkav, 0, (SV*)cv);
4452 GvCV(gv) = 0; /* cv has been hijacked */
4454 else if (strEQ(s, "INIT")) {
4456 PL_initav = newAV();
4457 if (PL_main_start && ckWARN(WARN_VOID))
4458 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
4459 av_push(PL_initav, (SV*)cv);
4460 GvCV(gv) = 0; /* cv has been hijacked */
4471 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4479 name = SvPVx(cSVOPo->op_sv, n_a);
4482 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4483 #ifdef GV_UNIQUE_CHECK
4485 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
4489 if ((cv = GvFORM(gv))) {
4490 if (ckWARN(WARN_REDEFINE)) {
4491 line_t oldline = CopLINE(PL_curcop);
4492 if (PL_copline != NOLINE)
4493 CopLINE_set(PL_curcop, PL_copline);
4494 Perl_warner(aTHX_ packWARN(WARN_REDEFINE), "Format %s redefined",name);
4495 CopLINE_set(PL_curcop, oldline);
4502 CvFILE_set_from_cop(cv, PL_curcop);
4505 pad_tidy(padtidy_FORMAT);
4506 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4507 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4508 OpREFCNT_set(CvROOT(cv), 1);
4509 CvSTART(cv) = LINKLIST(CvROOT(cv));
4510 CvROOT(cv)->op_next = 0;
4511 CALL_PEEP(CvSTART(cv));
4513 PL_copline = NOLINE;
4518 Perl_newANONLIST(pTHX_ OP *o)
4520 return newUNOP(OP_REFGEN, 0,
4521 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4525 Perl_newANONHASH(pTHX_ OP *o)
4527 return newUNOP(OP_REFGEN, 0,
4528 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4532 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4534 return newANONATTRSUB(floor, proto, Nullop, block);
4538 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4540 return newUNOP(OP_REFGEN, 0,
4541 newSVOP(OP_ANONCODE, 0,
4542 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4546 Perl_oopsAV(pTHX_ OP *o)
4548 switch (o->op_type) {
4550 o->op_type = OP_PADAV;
4551 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4552 return ref(o, OP_RV2AV);
4555 o->op_type = OP_RV2AV;
4556 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4561 if (ckWARN_d(WARN_INTERNAL))
4562 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
4569 Perl_oopsHV(pTHX_ OP *o)
4571 switch (o->op_type) {
4574 o->op_type = OP_PADHV;
4575 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4576 return ref(o, OP_RV2HV);
4580 o->op_type = OP_RV2HV;
4581 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4586 if (ckWARN_d(WARN_INTERNAL))
4587 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
4594 Perl_newAVREF(pTHX_ OP *o)
4596 if (o->op_type == OP_PADANY) {
4597 o->op_type = OP_PADAV;
4598 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4601 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
4602 && ckWARN(WARN_DEPRECATED)) {
4603 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4604 "Using an array as a reference is deprecated");
4606 return newUNOP(OP_RV2AV, 0, scalar(o));
4610 Perl_newGVREF(pTHX_ I32 type, OP *o)
4612 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4613 return newUNOP(OP_NULL, 0, o);
4614 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4618 Perl_newHVREF(pTHX_ OP *o)
4620 if (o->op_type == OP_PADANY) {
4621 o->op_type = OP_PADHV;
4622 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4625 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
4626 && ckWARN(WARN_DEPRECATED)) {
4627 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4628 "Using a hash as a reference is deprecated");
4630 return newUNOP(OP_RV2HV, 0, scalar(o));
4634 Perl_oopsCV(pTHX_ OP *o)
4636 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4642 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4644 return newUNOP(OP_RV2CV, flags, scalar(o));
4648 Perl_newSVREF(pTHX_ OP *o)
4650 if (o->op_type == OP_PADANY) {
4651 o->op_type = OP_PADSV;
4652 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4655 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4656 o->op_flags |= OPpDONE_SVREF;
4659 return newUNOP(OP_RV2SV, 0, scalar(o));
4662 /* Check routines. */
4665 Perl_ck_anoncode(pTHX_ OP *o)
4667 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
4668 cSVOPo->op_sv = Nullsv;
4673 Perl_ck_bitop(pTHX_ OP *o)
4675 #define OP_IS_NUMCOMPARE(op) \
4676 ((op) == OP_LT || (op) == OP_I_LT || \
4677 (op) == OP_GT || (op) == OP_I_GT || \
4678 (op) == OP_LE || (op) == OP_I_LE || \
4679 (op) == OP_GE || (op) == OP_I_GE || \
4680 (op) == OP_EQ || (op) == OP_I_EQ || \
4681 (op) == OP_NE || (op) == OP_I_NE || \
4682 (op) == OP_NCMP || (op) == OP_I_NCMP)
4683 o->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
4684 if (o->op_type == OP_BIT_OR
4685 || o->op_type == OP_BIT_AND
4686 || o->op_type == OP_BIT_XOR)
4688 OP * left = cBINOPo->op_first;
4689 OP * right = left->op_sibling;
4690 if ((OP_IS_NUMCOMPARE(left->op_type) &&
4691 (left->op_flags & OPf_PARENS) == 0) ||
4692 (OP_IS_NUMCOMPARE(right->op_type) &&
4693 (right->op_flags & OPf_PARENS) == 0))
4694 if (ckWARN(WARN_PRECEDENCE))
4695 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4696 "Possible precedence problem on bitwise %c operator",
4697 o->op_type == OP_BIT_OR ? '|'
4698 : o->op_type == OP_BIT_AND ? '&' : '^'
4705 Perl_ck_concat(pTHX_ OP *o)
4707 OP *kid = cUNOPo->op_first;
4708 if (kid->op_type == OP_CONCAT && !(kUNOP->op_first->op_flags & OPf_MOD))
4709 o->op_flags |= OPf_STACKED;
4714 Perl_ck_spair(pTHX_ OP *o)
4716 if (o->op_flags & OPf_KIDS) {
4719 OPCODE type = o->op_type;
4720 o = modkids(ck_fun(o), type);
4721 kid = cUNOPo->op_first;
4722 newop = kUNOP->op_first->op_sibling;
4724 (newop->op_sibling ||
4725 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4726 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4727 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4731 op_free(kUNOP->op_first);
4732 kUNOP->op_first = newop;
4734 o->op_ppaddr = PL_ppaddr[++o->op_type];
4739 Perl_ck_delete(pTHX_ OP *o)
4743 if (o->op_flags & OPf_KIDS) {
4744 OP *kid = cUNOPo->op_first;
4745 switch (kid->op_type) {
4747 o->op_flags |= OPf_SPECIAL;
4750 o->op_private |= OPpSLICE;
4753 o->op_flags |= OPf_SPECIAL;
4758 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
4767 Perl_ck_die(pTHX_ OP *o)
4770 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
4776 Perl_ck_eof(pTHX_ OP *o)
4778 I32 type = o->op_type;
4780 if (o->op_flags & OPf_KIDS) {
4781 if (cLISTOPo->op_first->op_type == OP_STUB) {
4783 o = newUNOP(type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
4791 Perl_ck_eval(pTHX_ OP *o)
4793 PL_hints |= HINT_BLOCK_SCOPE;
4794 if (o->op_flags & OPf_KIDS) {
4795 SVOP *kid = (SVOP*)cUNOPo->op_first;
4798 o->op_flags &= ~OPf_KIDS;
4801 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
4804 cUNOPo->op_first = 0;
4807 NewOp(1101, enter, 1, LOGOP);
4808 enter->op_type = OP_ENTERTRY;
4809 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4810 enter->op_private = 0;
4812 /* establish postfix order */
4813 enter->op_next = (OP*)enter;
4815 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4816 o->op_type = OP_LEAVETRY;
4817 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4818 enter->op_other = o;
4828 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4830 o->op_targ = (PADOFFSET)PL_hints;
4835 Perl_ck_exit(pTHX_ OP *o)
4838 HV *table = GvHV(PL_hintgv);
4840 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
4841 if (svp && *svp && SvTRUE(*svp))
4842 o->op_private |= OPpEXIT_VMSISH;
4844 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
4850 Perl_ck_exec(pTHX_ OP *o)
4853 if (o->op_flags & OPf_STACKED) {
4855 kid = cUNOPo->op_first->op_sibling;
4856 if (kid->op_type == OP_RV2GV)
4865 Perl_ck_exists(pTHX_ OP *o)
4868 if (o->op_flags & OPf_KIDS) {
4869 OP *kid = cUNOPo->op_first;
4870 if (kid->op_type == OP_ENTERSUB) {
4871 (void) ref(kid, o->op_type);
4872 if (kid->op_type != OP_RV2CV && !PL_error_count)
4873 Perl_croak(aTHX_ "%s argument is not a subroutine name",
4875 o->op_private |= OPpEXISTS_SUB;
4877 else if (kid->op_type == OP_AELEM)
4878 o->op_flags |= OPf_SPECIAL;
4879 else if (kid->op_type != OP_HELEM)
4880 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
4889 Perl_ck_gvconst(pTHX_ register OP *o)
4891 o = fold_constants(o);
4892 if (o->op_type == OP_CONST)
4899 Perl_ck_rvconst(pTHX_ register OP *o)
4901 SVOP *kid = (SVOP*)cUNOPo->op_first;
4903 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4904 if (kid->op_type == OP_CONST) {
4908 SV *kidsv = kid->op_sv;
4911 /* Is it a constant from cv_const_sv()? */
4912 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4913 SV *rsv = SvRV(kidsv);
4914 int svtype = SvTYPE(rsv);
4915 char *badtype = Nullch;
4917 switch (o->op_type) {
4919 if (svtype > SVt_PVMG)
4920 badtype = "a SCALAR";
4923 if (svtype != SVt_PVAV)
4924 badtype = "an ARRAY";
4927 if (svtype != SVt_PVHV)
4931 if (svtype != SVt_PVCV)
4936 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4939 name = SvPV(kidsv, n_a);
4940 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4941 char *badthing = Nullch;
4942 switch (o->op_type) {
4944 badthing = "a SCALAR";
4947 badthing = "an ARRAY";
4950 badthing = "a HASH";
4955 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
4959 * This is a little tricky. We only want to add the symbol if we
4960 * didn't add it in the lexer. Otherwise we get duplicate strict
4961 * warnings. But if we didn't add it in the lexer, we must at
4962 * least pretend like we wanted to add it even if it existed before,
4963 * or we get possible typo warnings. OPpCONST_ENTERED says
4964 * whether the lexer already added THIS instance of this symbol.
4966 iscv = (o->op_type == OP_RV2CV) * 2;
4968 gv = gv_fetchpv(name,
4969 iscv | !(kid->op_private & OPpCONST_ENTERED),
4972 : o->op_type == OP_RV2SV
4974 : o->op_type == OP_RV2AV
4976 : o->op_type == OP_RV2HV
4979 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
4981 kid->op_type = OP_GV;
4982 SvREFCNT_dec(kid->op_sv);
4984 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
4985 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
4986 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
4988 PAD_SETSV(kPADOP->op_padix, (SV*) SvREFCNT_inc(gv));
4990 kid->op_sv = SvREFCNT_inc(gv);
4992 kid->op_private = 0;
4993 kid->op_ppaddr = PL_ppaddr[OP_GV];
5000 Perl_ck_ftst(pTHX_ OP *o)
5002 I32 type = o->op_type;
5004 if (o->op_flags & OPf_REF) {
5007 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5008 SVOP *kid = (SVOP*)cUNOPo->op_first;
5010 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5012 OP *newop = newGVOP(type, OPf_REF,
5013 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5018 if ((PL_hints & HINT_FILETEST_ACCESS) &&
5019 OP_IS_FILETEST_ACCESS(o))
5020 o->op_private |= OPpFT_ACCESS;
5025 if (type == OP_FTTTY)
5026 o = newGVOP(type, OPf_REF, PL_stdingv);
5028 o = newUNOP(type, 0, newDEFSVOP());
5034 Perl_ck_fun(pTHX_ OP *o)
5040 int type = o->op_type;
5041 register I32 oa = PL_opargs[type] >> OASHIFT;
5043 if (o->op_flags & OPf_STACKED) {
5044 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5047 return no_fh_allowed(o);
5050 if (o->op_flags & OPf_KIDS) {
5052 tokid = &cLISTOPo->op_first;
5053 kid = cLISTOPo->op_first;
5054 if (kid->op_type == OP_PUSHMARK ||
5055 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5057 tokid = &kid->op_sibling;
5058 kid = kid->op_sibling;
5060 if (!kid && PL_opargs[type] & OA_DEFGV)
5061 *tokid = kid = newDEFSVOP();
5065 sibl = kid->op_sibling;
5068 /* list seen where single (scalar) arg expected? */
5069 if (numargs == 1 && !(oa >> 4)
5070 && kid->op_type == OP_LIST && type != OP_SCALAR)
5072 return too_many_arguments(o,PL_op_desc[type]);
5085 if ((type == OP_PUSH || type == OP_UNSHIFT)
5086 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
5087 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5088 "Useless use of %s with no values",
5091 if (kid->op_type == OP_CONST &&
5092 (kid->op_private & OPpCONST_BARE))
5094 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5095 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5096 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5097 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5098 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5099 "Array @%s missing the @ in argument %"IVdf" of %s()",
5100 name, (IV)numargs, PL_op_desc[type]);
5103 kid->op_sibling = sibl;
5106 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5107 bad_type(numargs, "array", PL_op_desc[type], kid);
5111 if (kid->op_type == OP_CONST &&
5112 (kid->op_private & OPpCONST_BARE))
5114 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5115 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5116 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5117 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5118 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5119 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5120 name, (IV)numargs, PL_op_desc[type]);
5123 kid->op_sibling = sibl;
5126 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5127 bad_type(numargs, "hash", PL_op_desc[type], kid);
5132 OP *newop = newUNOP(OP_NULL, 0, kid);
5133 kid->op_sibling = 0;
5135 newop->op_next = newop;
5137 kid->op_sibling = sibl;
5142 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5143 if (kid->op_type == OP_CONST &&
5144 (kid->op_private & OPpCONST_BARE))
5146 OP *newop = newGVOP(OP_GV, 0,
5147 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5149 if (!(o->op_private & 1) && /* if not unop */
5150 kid == cLISTOPo->op_last)
5151 cLISTOPo->op_last = newop;
5155 else if (kid->op_type == OP_READLINE) {
5156 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5157 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
5160 I32 flags = OPf_SPECIAL;
5164 /* is this op a FH constructor? */
5165 if (is_handle_constructor(o,numargs)) {
5166 char *name = Nullch;
5170 /* Set a flag to tell rv2gv to vivify
5171 * need to "prove" flag does not mean something
5172 * else already - NI-S 1999/05/07
5175 if (kid->op_type == OP_PADSV) {
5176 name = PAD_COMPNAME_PV(kid->op_targ);
5177 /* SvCUR of a pad namesv can't be trusted
5178 * (see PL_generation), so calc its length
5184 else if (kid->op_type == OP_RV2SV
5185 && kUNOP->op_first->op_type == OP_GV)
5187 GV *gv = cGVOPx_gv(kUNOP->op_first);
5189 len = GvNAMELEN(gv);
5191 else if (kid->op_type == OP_AELEM
5192 || kid->op_type == OP_HELEM)
5197 if ((op = ((BINOP*)kid)->op_first)) {
5198 SV *tmpstr = Nullsv;
5200 kid->op_type == OP_AELEM ?
5202 if (((op->op_type == OP_RV2AV) ||
5203 (op->op_type == OP_RV2HV)) &&
5204 (op = ((UNOP*)op)->op_first) &&
5205 (op->op_type == OP_GV)) {
5206 /* packagevar $a[] or $h{} */
5207 GV *gv = cGVOPx_gv(op);
5215 else if (op->op_type == OP_PADAV
5216 || op->op_type == OP_PADHV) {
5217 /* lexicalvar $a[] or $h{} */
5219 PAD_COMPNAME_PV(op->op_targ);
5229 name = savepv(SvPVX(tmpstr));
5235 name = "__ANONIO__";
5242 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5243 namesv = PAD_SVl(targ);
5244 (void)SvUPGRADE(namesv, SVt_PV);
5246 sv_setpvn(namesv, "$", 1);
5247 sv_catpvn(namesv, name, len);
5250 kid->op_sibling = 0;
5251 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5252 kid->op_targ = targ;
5253 kid->op_private |= priv;
5255 kid->op_sibling = sibl;
5261 mod(scalar(kid), type);
5265 tokid = &kid->op_sibling;
5266 kid = kid->op_sibling;
5268 o->op_private |= numargs;
5270 return too_many_arguments(o,OP_DESC(o));
5273 else if (PL_opargs[type] & OA_DEFGV) {
5275 return newUNOP(type, 0, newDEFSVOP());
5279 while (oa & OA_OPTIONAL)
5281 if (oa && oa != OA_LIST)
5282 return too_few_arguments(o,OP_DESC(o));
5288 Perl_ck_glob(pTHX_ OP *o)
5293 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5294 append_elem(OP_GLOB, o, newDEFSVOP());
5296 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV))
5297 && GvCVu(gv) && GvIMPORTED_CV(gv)))
5299 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5302 #if !defined(PERL_EXTERNAL_GLOB)
5303 /* XXX this can be tightened up and made more failsafe. */
5307 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
5308 newSVpvn("File::Glob", 10), Nullsv, Nullsv, Nullsv);
5309 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5310 glob_gv = gv_fetchpv("File::Glob::csh_glob", FALSE, SVt_PVCV);
5311 GvCV(gv) = GvCV(glob_gv);
5312 SvREFCNT_inc((SV*)GvCV(gv));
5313 GvIMPORTED_CV_on(gv);
5316 #endif /* PERL_EXTERNAL_GLOB */
5318 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5319 append_elem(OP_GLOB, o,
5320 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5321 o->op_type = OP_LIST;
5322 o->op_ppaddr = PL_ppaddr[OP_LIST];
5323 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5324 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5325 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5326 append_elem(OP_LIST, o,
5327 scalar(newUNOP(OP_RV2CV, 0,
5328 newGVOP(OP_GV, 0, gv)))));
5329 o = newUNOP(OP_NULL, 0, ck_subr(o));
5330 o->op_targ = OP_GLOB; /* hint at what it used to be */
5333 gv = newGVgen("main");
5335 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5341 Perl_ck_grep(pTHX_ OP *o)
5345 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5347 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5348 NewOp(1101, gwop, 1, LOGOP);
5350 if (o->op_flags & OPf_STACKED) {
5353 kid = cLISTOPo->op_first->op_sibling;
5354 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5357 kid->op_next = (OP*)gwop;
5358 o->op_flags &= ~OPf_STACKED;
5360 kid = cLISTOPo->op_first->op_sibling;
5361 if (type == OP_MAPWHILE)
5368 kid = cLISTOPo->op_first->op_sibling;
5369 if (kid->op_type != OP_NULL)
5370 Perl_croak(aTHX_ "panic: ck_grep");
5371 kid = kUNOP->op_first;
5373 gwop->op_type = type;
5374 gwop->op_ppaddr = PL_ppaddr[type];
5375 gwop->op_first = listkids(o);
5376 gwop->op_flags |= OPf_KIDS;
5377 gwop->op_private = 1;
5378 gwop->op_other = LINKLIST(kid);
5379 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5380 kid->op_next = (OP*)gwop;
5382 kid = cLISTOPo->op_first->op_sibling;
5383 if (!kid || !kid->op_sibling)
5384 return too_few_arguments(o,OP_DESC(o));
5385 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5386 mod(kid, OP_GREPSTART);
5392 Perl_ck_index(pTHX_ OP *o)
5394 if (o->op_flags & OPf_KIDS) {
5395 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5397 kid = kid->op_sibling; /* get past "big" */
5398 if (kid && kid->op_type == OP_CONST)
5399 fbm_compile(((SVOP*)kid)->op_sv, 0);
5405 Perl_ck_lengthconst(pTHX_ OP *o)
5407 /* XXX length optimization goes here */
5412 Perl_ck_lfun(pTHX_ OP *o)
5414 OPCODE type = o->op_type;
5415 return modkids(ck_fun(o), type);
5419 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5421 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
5422 switch (cUNOPo->op_first->op_type) {
5424 /* This is needed for
5425 if (defined %stash::)
5426 to work. Do not break Tk.
5428 break; /* Globals via GV can be undef */
5430 case OP_AASSIGN: /* Is this a good idea? */
5431 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5432 "defined(@array) is deprecated");
5433 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5434 "\t(Maybe you should just omit the defined()?)\n");
5437 /* This is needed for
5438 if (defined %stash::)
5439 to work. Do not break Tk.
5441 break; /* Globals via GV can be undef */
5443 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5444 "defined(%%hash) is deprecated");
5445 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5446 "\t(Maybe you should just omit the defined()?)\n");
5457 Perl_ck_rfun(pTHX_ OP *o)
5459 OPCODE type = o->op_type;
5460 return refkids(ck_fun(o), type);
5464 Perl_ck_listiob(pTHX_ OP *o)
5468 kid = cLISTOPo->op_first;
5471 kid = cLISTOPo->op_first;
5473 if (kid->op_type == OP_PUSHMARK)
5474 kid = kid->op_sibling;
5475 if (kid && o->op_flags & OPf_STACKED)
5476 kid = kid->op_sibling;
5477 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5478 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5479 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5480 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5481 cLISTOPo->op_first->op_sibling = kid;
5482 cLISTOPo->op_last = kid;
5483 kid = kid->op_sibling;
5488 append_elem(o->op_type, o, newDEFSVOP());
5494 Perl_ck_sassign(pTHX_ OP *o)
5496 OP *kid = cLISTOPo->op_first;
5497 /* has a disposable target? */
5498 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5499 && !(kid->op_flags & OPf_STACKED)
5500 /* Cannot steal the second time! */
5501 && !(kid->op_private & OPpTARGET_MY))
5503 OP *kkid = kid->op_sibling;
5505 /* Can just relocate the target. */
5506 if (kkid && kkid->op_type == OP_PADSV
5507 && !(kkid->op_private & OPpLVAL_INTRO))
5509 kid->op_targ = kkid->op_targ;
5511 /* Now we do not need PADSV and SASSIGN. */
5512 kid->op_sibling = o->op_sibling; /* NULL */
5513 cLISTOPo->op_first = NULL;
5516 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5524 Perl_ck_match(pTHX_ OP *o)
5526 o->op_private |= OPpRUNTIME;
5531 Perl_ck_method(pTHX_ OP *o)
5533 OP *kid = cUNOPo->op_first;
5534 if (kid->op_type == OP_CONST) {
5535 SV* sv = kSVOP->op_sv;
5536 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5538 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5539 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5542 kSVOP->op_sv = Nullsv;
5544 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5553 Perl_ck_null(pTHX_ OP *o)
5559 Perl_ck_open(pTHX_ OP *o)
5561 HV *table = GvHV(PL_hintgv);
5565 svp = hv_fetch(table, "open_IN", 7, FALSE);
5567 mode = mode_from_discipline(*svp);
5568 if (mode & O_BINARY)
5569 o->op_private |= OPpOPEN_IN_RAW;
5570 else if (mode & O_TEXT)
5571 o->op_private |= OPpOPEN_IN_CRLF;
5574 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5576 mode = mode_from_discipline(*svp);
5577 if (mode & O_BINARY)
5578 o->op_private |= OPpOPEN_OUT_RAW;
5579 else if (mode & O_TEXT)
5580 o->op_private |= OPpOPEN_OUT_CRLF;
5583 if (o->op_type == OP_BACKTICK)
5586 /* In case of three-arg dup open remove strictness
5587 * from the last arg if it is a bareword. */
5588 OP *first = cLISTOPx(o)->op_first; /* The pushmark. */
5589 OP *last = cLISTOPx(o)->op_last; /* The bareword. */
5593 if ((last->op_type == OP_CONST) && /* The bareword. */
5594 (last->op_private & OPpCONST_BARE) &&
5595 (last->op_private & OPpCONST_STRICT) &&
5596 (oa = first->op_sibling) && /* The fh. */
5597 (oa = oa->op_sibling) && /* The mode. */
5598 SvPOK(((SVOP*)oa)->op_sv) &&
5599 (mode = SvPVX(((SVOP*)oa)->op_sv)) &&
5600 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
5601 (last == oa->op_sibling)) /* The bareword. */
5602 last->op_private &= ~OPpCONST_STRICT;
5608 Perl_ck_repeat(pTHX_ OP *o)
5610 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5611 o->op_private |= OPpREPEAT_DOLIST;
5612 cBINOPo->op_first = force_list(cBINOPo->op_first);
5620 Perl_ck_require(pTHX_ OP *o)
5624 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5625 SVOP *kid = (SVOP*)cUNOPo->op_first;
5627 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5629 for (s = SvPVX(kid->op_sv); *s; s++) {
5630 if (*s == ':' && s[1] == ':') {
5632 Move(s+2, s+1, strlen(s+2)+1, char);
5633 --SvCUR(kid->op_sv);
5636 if (SvREADONLY(kid->op_sv)) {
5637 SvREADONLY_off(kid->op_sv);
5638 sv_catpvn(kid->op_sv, ".pm", 3);
5639 SvREADONLY_on(kid->op_sv);
5642 sv_catpvn(kid->op_sv, ".pm", 3);
5646 /* handle override, if any */
5647 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
5648 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
5649 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
5651 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5652 OP *kid = cUNOPo->op_first;
5653 cUNOPo->op_first = 0;
5655 return ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
5656 append_elem(OP_LIST, kid,
5657 scalar(newUNOP(OP_RV2CV, 0,
5666 Perl_ck_return(pTHX_ OP *o)
5669 if (CvLVALUE(PL_compcv)) {
5670 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
5671 mod(kid, OP_LEAVESUBLV);
5678 Perl_ck_retarget(pTHX_ OP *o)
5680 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5687 Perl_ck_select(pTHX_ OP *o)
5690 if (o->op_flags & OPf_KIDS) {
5691 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5692 if (kid && kid->op_sibling) {
5693 o->op_type = OP_SSELECT;
5694 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5696 return fold_constants(o);
5700 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5701 if (kid && kid->op_type == OP_RV2GV)
5702 kid->op_private &= ~HINT_STRICT_REFS;
5707 Perl_ck_shift(pTHX_ OP *o)
5709 I32 type = o->op_type;
5711 if (!(o->op_flags & OPf_KIDS)) {
5715 argop = newUNOP(OP_RV2AV, 0,
5716 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
5717 return newUNOP(type, 0, scalar(argop));
5719 return scalar(modkids(ck_fun(o), type));
5723 Perl_ck_sort(pTHX_ OP *o)
5727 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5729 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5730 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5732 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
5734 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5736 if (kid->op_type == OP_SCOPE) {
5740 else if (kid->op_type == OP_LEAVE) {
5741 if (o->op_type == OP_SORT) {
5742 op_null(kid); /* wipe out leave */
5745 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5746 if (k->op_next == kid)
5748 /* don't descend into loops */
5749 else if (k->op_type == OP_ENTERLOOP
5750 || k->op_type == OP_ENTERITER)
5752 k = cLOOPx(k)->op_lastop;
5757 kid->op_next = 0; /* just disconnect the leave */
5758 k = kLISTOP->op_first;
5763 if (o->op_type == OP_SORT) {
5764 /* provide scalar context for comparison function/block */
5770 o->op_flags |= OPf_SPECIAL;
5772 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5775 firstkid = firstkid->op_sibling;
5778 /* provide list context for arguments */
5779 if (o->op_type == OP_SORT)
5786 S_simplify_sort(pTHX_ OP *o)
5788 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5792 if (!(o->op_flags & OPf_STACKED))
5794 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5795 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5796 kid = kUNOP->op_first; /* get past null */
5797 if (kid->op_type != OP_SCOPE)
5799 kid = kLISTOP->op_last; /* get past scope */
5800 switch(kid->op_type) {
5808 k = kid; /* remember this node*/
5809 if (kBINOP->op_first->op_type != OP_RV2SV)
5811 kid = kBINOP->op_first; /* get past cmp */
5812 if (kUNOP->op_first->op_type != OP_GV)
5814 kid = kUNOP->op_first; /* get past rv2sv */
5816 if (GvSTASH(gv) != PL_curstash)
5818 if (strEQ(GvNAME(gv), "a"))
5820 else if (strEQ(GvNAME(gv), "b"))
5824 kid = k; /* back to cmp */
5825 if (kBINOP->op_last->op_type != OP_RV2SV)
5827 kid = kBINOP->op_last; /* down to 2nd arg */
5828 if (kUNOP->op_first->op_type != OP_GV)
5830 kid = kUNOP->op_first; /* get past rv2sv */
5832 if (GvSTASH(gv) != PL_curstash
5834 ? strNE(GvNAME(gv), "a")
5835 : strNE(GvNAME(gv), "b")))
5837 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5839 o->op_private |= OPpSORT_REVERSE;
5840 if (k->op_type == OP_NCMP)
5841 o->op_private |= OPpSORT_NUMERIC;
5842 if (k->op_type == OP_I_NCMP)
5843 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5844 kid = cLISTOPo->op_first->op_sibling;
5845 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5846 op_free(kid); /* then delete it */
5850 Perl_ck_split(pTHX_ OP *o)
5854 if (o->op_flags & OPf_STACKED)
5855 return no_fh_allowed(o);
5857 kid = cLISTOPo->op_first;
5858 if (kid->op_type != OP_NULL)
5859 Perl_croak(aTHX_ "panic: ck_split");
5860 kid = kid->op_sibling;
5861 op_free(cLISTOPo->op_first);
5862 cLISTOPo->op_first = kid;
5864 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5865 cLISTOPo->op_last = kid; /* There was only one element previously */
5868 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
5869 OP *sibl = kid->op_sibling;
5870 kid->op_sibling = 0;
5871 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5872 if (cLISTOPo->op_first == cLISTOPo->op_last)
5873 cLISTOPo->op_last = kid;
5874 cLISTOPo->op_first = kid;
5875 kid->op_sibling = sibl;
5878 kid->op_type = OP_PUSHRE;
5879 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5881 if (ckWARN(WARN_REGEXP) && ((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
5882 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
5883 "Use of /g modifier is meaningless in split");
5886 if (!kid->op_sibling)
5887 append_elem(OP_SPLIT, o, newDEFSVOP());
5889 kid = kid->op_sibling;
5892 if (!kid->op_sibling)
5893 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5895 kid = kid->op_sibling;
5898 if (kid->op_sibling)
5899 return too_many_arguments(o,OP_DESC(o));
5905 Perl_ck_join(pTHX_ OP *o)
5907 if (ckWARN(WARN_SYNTAX)) {
5908 OP *kid = cLISTOPo->op_first->op_sibling;
5909 if (kid && kid->op_type == OP_MATCH) {
5910 char *pmstr = "STRING";
5911 if (PM_GETRE(kPMOP))
5912 pmstr = PM_GETRE(kPMOP)->precomp;
5913 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5914 "/%s/ should probably be written as \"%s\"",
5922 Perl_ck_subr(pTHX_ OP *o)
5924 OP *prev = ((cUNOPo->op_first->op_sibling)
5925 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
5926 OP *o2 = prev->op_sibling;
5933 I32 contextclass = 0;
5938 o->op_private |= OPpENTERSUB_HASTARG;
5939 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
5940 if (cvop->op_type == OP_RV2CV) {
5942 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
5943 op_null(cvop); /* disable rv2cv */
5944 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
5945 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
5946 GV *gv = cGVOPx_gv(tmpop);
5949 tmpop->op_private |= OPpEARLY_CV;
5952 namegv = CvANON(cv) ? gv : CvGV(cv);
5953 proto = SvPV((SV*)cv, n_a);
5955 if (CvASSERTION(cv)) {
5956 if (PL_hints & HINT_ASSERTING) {
5957 if (PERLDB_ASSERTION && PL_curstash != PL_debstash)
5958 o->op_private |= OPpENTERSUB_DB;
5962 if (ckWARN(WARN_ASSERTIONS) && !(PL_hints & HINT_ASSERTIONSSEEN)) {
5963 Perl_warner(aTHX_ packWARN(WARN_ASSERTIONS),
5964 "Impossible to activate assertion call");
5971 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
5972 if (o2->op_type == OP_CONST)
5973 o2->op_private &= ~OPpCONST_STRICT;
5974 else if (o2->op_type == OP_LIST) {
5975 OP *o = ((UNOP*)o2)->op_first->op_sibling;
5976 if (o && o->op_type == OP_CONST)
5977 o->op_private &= ~OPpCONST_STRICT;
5980 o->op_private |= (PL_hints & HINT_STRICT_REFS);
5981 if (PERLDB_SUB && PL_curstash != PL_debstash)
5982 o->op_private |= OPpENTERSUB_DB;
5983 while (o2 != cvop) {
5987 return too_many_arguments(o, gv_ename(namegv));
6005 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6007 arg == 1 ? "block or sub {}" : "sub {}",
6008 gv_ename(namegv), o2);
6011 /* '*' allows any scalar type, including bareword */
6014 if (o2->op_type == OP_RV2GV)
6015 goto wrapref; /* autoconvert GLOB -> GLOBref */
6016 else if (o2->op_type == OP_CONST)
6017 o2->op_private &= ~OPpCONST_STRICT;
6018 else if (o2->op_type == OP_ENTERSUB) {
6019 /* accidental subroutine, revert to bareword */
6020 OP *gvop = ((UNOP*)o2)->op_first;
6021 if (gvop && gvop->op_type == OP_NULL) {
6022 gvop = ((UNOP*)gvop)->op_first;
6024 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6027 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6028 (gvop = ((UNOP*)gvop)->op_first) &&
6029 gvop->op_type == OP_GV)
6031 GV *gv = cGVOPx_gv(gvop);
6032 OP *sibling = o2->op_sibling;
6033 SV *n = newSVpvn("",0);
6035 gv_fullname3(n, gv, "");
6036 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6037 sv_chop(n, SvPVX(n)+6);
6038 o2 = newSVOP(OP_CONST, 0, n);
6039 prev->op_sibling = o2;
6040 o2->op_sibling = sibling;
6056 if (contextclass++ == 0) {
6057 e = strchr(proto, ']');
6058 if (!e || e == proto)
6071 while (*--p != '[');
6072 bad_type(arg, Perl_form(aTHX_ "one of %s", p),
6073 gv_ename(namegv), o2);
6079 if (o2->op_type == OP_RV2GV)
6082 bad_type(arg, "symbol", gv_ename(namegv), o2);
6085 if (o2->op_type == OP_ENTERSUB)
6088 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6091 if (o2->op_type == OP_RV2SV ||
6092 o2->op_type == OP_PADSV ||
6093 o2->op_type == OP_HELEM ||
6094 o2->op_type == OP_AELEM ||
6095 o2->op_type == OP_THREADSV)
6098 bad_type(arg, "scalar", gv_ename(namegv), o2);
6101 if (o2->op_type == OP_RV2AV ||
6102 o2->op_type == OP_PADAV)
6105 bad_type(arg, "array", gv_ename(namegv), o2);
6108 if (o2->op_type == OP_RV2HV ||
6109 o2->op_type == OP_PADHV)
6112 bad_type(arg, "hash", gv_ename(namegv), o2);
6117 OP* sib = kid->op_sibling;
6118 kid->op_sibling = 0;
6119 o2 = newUNOP(OP_REFGEN, 0, kid);
6120 o2->op_sibling = sib;
6121 prev->op_sibling = o2;
6123 if (contextclass && e) {
6138 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
6139 gv_ename(namegv), cv);
6144 mod(o2, OP_ENTERSUB);
6146 o2 = o2->op_sibling;
6148 if (proto && !optional &&
6149 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6150 return too_few_arguments(o, gv_ename(namegv));
6153 o=newSVOP(OP_CONST, 0, newSViv(0));
6159 Perl_ck_svconst(pTHX_ OP *o)
6161 SvREADONLY_on(cSVOPo->op_sv);
6166 Perl_ck_trunc(pTHX_ OP *o)
6168 if (o->op_flags & OPf_KIDS) {
6169 SVOP *kid = (SVOP*)cUNOPo->op_first;
6171 if (kid->op_type == OP_NULL)
6172 kid = (SVOP*)kid->op_sibling;
6173 if (kid && kid->op_type == OP_CONST &&
6174 (kid->op_private & OPpCONST_BARE))
6176 o->op_flags |= OPf_SPECIAL;
6177 kid->op_private &= ~OPpCONST_STRICT;
6184 Perl_ck_substr(pTHX_ OP *o)
6187 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6188 OP *kid = cLISTOPo->op_first;
6190 if (kid->op_type == OP_NULL)
6191 kid = kid->op_sibling;
6193 kid->op_flags |= OPf_MOD;
6199 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6202 Perl_peep(pTHX_ register OP *o)
6204 register OP* oldop = 0;
6206 if (!o || o->op_seq)
6210 SAVEVPTR(PL_curcop);
6211 for (; o; o = o->op_next) {
6214 /* The special value -1 is used by the B::C compiler backend to indicate
6215 * that an op is statically defined and should not be freed */
6216 if (!PL_op_seqmax || PL_op_seqmax == (U16)-1)
6219 switch (o->op_type) {
6223 PL_curcop = ((COP*)o); /* for warnings */
6224 o->op_seq = PL_op_seqmax++;
6228 if (cSVOPo->op_private & OPpCONST_STRICT)
6229 no_bareword_allowed(o);
6231 case OP_METHOD_NAMED:
6232 /* Relocate sv to the pad for thread safety.
6233 * Despite being a "constant", the SV is written to,
6234 * for reference counts, sv_upgrade() etc. */
6236 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6237 if (o->op_type == OP_CONST && SvPADTMP(cSVOPo->op_sv)) {
6238 /* If op_sv is already a PADTMP then it is being used by
6239 * some pad, so make a copy. */
6240 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
6241 SvREADONLY_on(PAD_SVl(ix));
6242 SvREFCNT_dec(cSVOPo->op_sv);
6245 SvREFCNT_dec(PAD_SVl(ix));
6246 SvPADTMP_on(cSVOPo->op_sv);
6247 PAD_SETSV(ix, cSVOPo->op_sv);
6248 /* XXX I don't know how this isn't readonly already. */
6249 SvREADONLY_on(PAD_SVl(ix));
6251 cSVOPo->op_sv = Nullsv;
6255 o->op_seq = PL_op_seqmax++;
6259 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6260 if (o->op_next->op_private & OPpTARGET_MY) {
6261 if (o->op_flags & OPf_STACKED) /* chained concats */
6262 goto ignore_optimization;
6264 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6265 o->op_targ = o->op_next->op_targ;
6266 o->op_next->op_targ = 0;
6267 o->op_private |= OPpTARGET_MY;
6270 op_null(o->op_next);
6272 ignore_optimization:
6273 o->op_seq = PL_op_seqmax++;
6276 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6277 o->op_seq = PL_op_seqmax++;
6278 break; /* Scalar stub must produce undef. List stub is noop */
6282 if (o->op_targ == OP_NEXTSTATE
6283 || o->op_targ == OP_DBSTATE
6284 || o->op_targ == OP_SETSTATE)
6286 PL_curcop = ((COP*)o);
6288 /* XXX: We avoid setting op_seq here to prevent later calls
6289 to peep() from mistakenly concluding that optimisation
6290 has already occurred. This doesn't fix the real problem,
6291 though (See 20010220.007). AMS 20010719 */
6292 if (oldop && o->op_next) {
6293 oldop->op_next = o->op_next;
6301 if (oldop && o->op_next) {
6302 oldop->op_next = o->op_next;
6305 o->op_seq = PL_op_seqmax++;
6309 if (o->op_next->op_type == OP_RV2SV) {
6310 if (!(o->op_next->op_private & OPpDEREF)) {
6311 op_null(o->op_next);
6312 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6314 o->op_next = o->op_next->op_next;
6315 o->op_type = OP_GVSV;
6316 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6319 else if (o->op_next->op_type == OP_RV2AV) {
6320 OP* pop = o->op_next->op_next;
6322 if (pop && pop->op_type == OP_CONST &&
6323 (PL_op = pop->op_next) &&
6324 pop->op_next->op_type == OP_AELEM &&
6325 !(pop->op_next->op_private &
6326 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
6327 (i = SvIV(((SVOP*)pop)->op_sv) - PL_curcop->cop_arybase)
6332 op_null(o->op_next);
6333 op_null(pop->op_next);
6335 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6336 o->op_next = pop->op_next->op_next;
6337 o->op_type = OP_AELEMFAST;
6338 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6339 o->op_private = (U8)i;
6344 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6346 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6347 /* XXX could check prototype here instead of just carping */
6348 SV *sv = sv_newmortal();
6349 gv_efullname3(sv, gv, Nullch);
6350 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
6351 "%"SVf"() called too early to check prototype",
6355 else if (o->op_next->op_type == OP_READLINE
6356 && o->op_next->op_next->op_type == OP_CONCAT
6357 && (o->op_next->op_next->op_flags & OPf_STACKED))
6359 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
6360 o->op_type = OP_RCATLINE;
6361 o->op_flags |= OPf_STACKED;
6362 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
6363 op_null(o->op_next->op_next);
6364 op_null(o->op_next);
6367 o->op_seq = PL_op_seqmax++;
6380 o->op_seq = PL_op_seqmax++;
6381 while (cLOGOP->op_other->op_type == OP_NULL)
6382 cLOGOP->op_other = cLOGOP->op_other->op_next;
6383 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
6388 o->op_seq = PL_op_seqmax++;
6389 while (cLOOP->op_redoop->op_type == OP_NULL)
6390 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
6391 peep(cLOOP->op_redoop);
6392 while (cLOOP->op_nextop->op_type == OP_NULL)
6393 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
6394 peep(cLOOP->op_nextop);
6395 while (cLOOP->op_lastop->op_type == OP_NULL)
6396 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
6397 peep(cLOOP->op_lastop);
6403 o->op_seq = PL_op_seqmax++;
6404 while (cPMOP->op_pmreplstart &&
6405 cPMOP->op_pmreplstart->op_type == OP_NULL)
6406 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
6407 peep(cPMOP->op_pmreplstart);
6411 o->op_seq = PL_op_seqmax++;
6412 if (ckWARN(WARN_SYNTAX) && o->op_next
6413 && o->op_next->op_type == OP_NEXTSTATE) {
6414 if (o->op_next->op_sibling &&
6415 o->op_next->op_sibling->op_type != OP_EXIT &&
6416 o->op_next->op_sibling->op_type != OP_WARN &&
6417 o->op_next->op_sibling->op_type != OP_DIE) {
6418 line_t oldline = CopLINE(PL_curcop);
6420 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6421 Perl_warner(aTHX_ packWARN(WARN_EXEC),
6422 "Statement unlikely to be reached");
6423 Perl_warner(aTHX_ packWARN(WARN_EXEC),
6424 "\t(Maybe you meant system() when you said exec()?)\n");
6425 CopLINE_set(PL_curcop, oldline);
6436 o->op_seq = PL_op_seqmax++;
6438 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6441 /* Make the CONST have a shared SV */
6442 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6443 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6444 key = SvPV(sv, keylen);
6445 lexname = newSVpvn_share(key,
6446 SvUTF8(sv) ? -(I32)keylen : keylen,
6455 o->op_seq = PL_op_seqmax++;
6465 char* Perl_custom_op_name(pTHX_ OP* o)
6467 IV index = PTR2IV(o->op_ppaddr);
6471 if (!PL_custom_op_names) /* This probably shouldn't happen */
6472 return PL_op_name[OP_CUSTOM];
6474 keysv = sv_2mortal(newSViv(index));
6476 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
6478 return PL_op_name[OP_CUSTOM]; /* Don't know who you are */
6480 return SvPV_nolen(HeVAL(he));
6483 char* Perl_custom_op_desc(pTHX_ OP* o)
6485 IV index = PTR2IV(o->op_ppaddr);
6489 if (!PL_custom_op_descs)
6490 return PL_op_desc[OP_CUSTOM];
6492 keysv = sv_2mortal(newSViv(index));
6494 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
6496 return PL_op_desc[OP_CUSTOM];
6498 return SvPV_nolen(HeVAL(he));
6504 /* Efficient sub that returns a constant scalar value. */
6506 const_sv_xsub(pTHX_ CV* cv)
6511 Perl_croak(aTHX_ "usage: %s::%s()",
6512 HvNAME(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
6516 ST(0) = (SV*)XSANY.any_ptr;