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
34 Perl_Slab_Alloc(pTHX_ int m, size_t sz)
37 * To make incrementing use count easy PL_OpSlab is an I32 *
38 * To make inserting the link to slab PL_OpPtr is I32 **
39 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
40 * Add an overhead for pointer to slab and round up as a number of pointers
42 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
43 if ((PL_OpSpace -= sz) < 0) {
44 PL_OpPtr = (I32 **) PerlMemShared_malloc(PERL_SLAB_SIZE*sizeof(I32*));
48 Zero(PL_OpPtr,PERL_SLAB_SIZE,I32 **);
49 /* We reserve the 0'th I32 sized chunk as a use count */
50 PL_OpSlab = (I32 *) PL_OpPtr;
51 /* Reduce size by the use count word, and by the size we need.
52 * Latter is to mimic the '-=' in the if() above
54 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
55 /* Allocation pointer starts at the top.
56 Theory: because we build leaves before trunk allocating at end
57 means that at run time access is cache friendly upward
59 PL_OpPtr += PERL_SLAB_SIZE;
61 assert( PL_OpSpace >= 0 );
62 /* Move the allocation pointer down */
64 assert( PL_OpPtr > (I32 **) PL_OpSlab );
65 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
66 (*PL_OpSlab)++; /* Increment use count of slab */
67 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
68 assert( *PL_OpSlab > 0 );
69 return (void *)(PL_OpPtr + 1);
73 Perl_Slab_Free(pTHX_ void *op)
75 I32 **ptr = (I32 **) op;
77 assert( ptr-1 > (I32 **) slab );
78 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
82 # define PerlMemShared PerlMem
85 PerlMemShared_free(slab);
86 if (slab == PL_OpSlab) {
93 * In the following definition, the ", Nullop" is just to make the compiler
94 * think the expression is of the right type: croak actually does a Siglongjmp.
96 #define CHECKOP(type,o) \
97 ((PL_op_mask && PL_op_mask[type]) \
98 ? ( op_free((OP*)o), \
99 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
101 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
103 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
106 S_gv_ename(pTHX_ GV *gv)
109 SV* tmpsv = sv_newmortal();
110 gv_efullname3(tmpsv, gv, Nullch);
111 return SvPV(tmpsv,n_a);
115 S_no_fh_allowed(pTHX_ OP *o)
117 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
123 S_too_few_arguments(pTHX_ OP *o, char *name)
125 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
130 S_too_many_arguments(pTHX_ OP *o, char *name)
132 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
137 S_bad_type(pTHX_ I32 n, char *t, char *name, OP *kid)
139 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
140 (int)n, name, t, OP_DESC(kid)));
144 S_no_bareword_allowed(pTHX_ OP *o)
146 qerror(Perl_mess(aTHX_
147 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
151 /* "register" allocation */
154 Perl_allocmy(pTHX_ char *name)
158 /* complain about "my $<special_var>" etc etc */
159 if (!(PL_in_my == KEY_our ||
161 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
162 (name[1] == '_' && (*name == '$' || (int)strlen(name) > 2))))
164 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
165 /* 1999-02-27 mjd@plover.com */
167 p = strchr(name, '\0');
168 /* The next block assumes the buffer is at least 205 chars
169 long. At present, it's always at least 256 chars. */
171 strcpy(name+200, "...");
177 /* Move everything else down one character */
178 for (; p-name > 2; p--)
180 name[2] = toCTRL(name[1]);
183 yyerror(Perl_form(aTHX_ "Can't use global %s in \"my\"",name));
186 /* check for duplicate declaration */
188 (bool)(PL_in_my == KEY_our),
189 (PL_curstash ? PL_curstash : PL_defstash)
192 if (PL_in_my_stash && *name != '$') {
193 yyerror(Perl_form(aTHX_
194 "Can't declare class for non-scalar %s in \"%s\"",
195 name, PL_in_my == KEY_our ? "our" : "my"));
198 /* allocate a spare slot and store the name in that slot */
200 off = pad_add_name(name,
203 ? (PL_curstash ? PL_curstash : PL_defstash)
214 Perl_op_free(pTHX_ OP *o)
216 register OP *kid, *nextkid;
219 if (!o || o->op_static)
222 if (o->op_private & OPpREFCOUNTED) {
223 switch (o->op_type) {
231 if (OpREFCNT_dec(o)) {
242 if (o->op_flags & OPf_KIDS) {
243 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
244 nextkid = kid->op_sibling; /* Get before next freeing kid */
250 type = (OPCODE)o->op_targ;
252 /* COP* is not cleared by op_clear() so that we may track line
253 * numbers etc even after null() */
254 if (type == OP_NEXTSTATE || type == OP_SETSTATE || type == OP_DBSTATE)
262 Perl_op_clear(pTHX_ OP *o)
265 switch (o->op_type) {
266 case OP_NULL: /* Was holding old type, if any. */
267 case OP_ENTEREVAL: /* Was holding hints. */
271 if (!(o->op_flags & OPf_REF)
272 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
278 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
279 /* not an OP_PADAV replacement */
281 if (cPADOPo->op_padix > 0) {
282 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
283 * may still exist on the pad */
284 pad_swipe(cPADOPo->op_padix, TRUE);
285 cPADOPo->op_padix = 0;
288 SvREFCNT_dec(cSVOPo->op_sv);
289 cSVOPo->op_sv = Nullsv;
293 case OP_METHOD_NAMED:
295 SvREFCNT_dec(cSVOPo->op_sv);
296 cSVOPo->op_sv = Nullsv;
299 Even if op_clear does a pad_free for the target of the op,
300 pad_free doesn't actually remove the sv that exists in the pad;
301 instead it lives on. This results in that it could be reused as
302 a target later on when the pad was reallocated.
305 pad_swipe(o->op_targ,1);
314 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
318 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
319 SvREFCNT_dec(cSVOPo->op_sv);
320 cSVOPo->op_sv = Nullsv;
323 Safefree(cPVOPo->op_pv);
324 cPVOPo->op_pv = Nullch;
328 op_free(cPMOPo->op_pmreplroot);
332 if (INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot)) {
333 /* No GvIN_PAD_off here, because other references may still
334 * exist on the pad */
335 pad_swipe(INT2PTR(PADOFFSET, cPMOPo->op_pmreplroot), TRUE);
338 SvREFCNT_dec((SV*)cPMOPo->op_pmreplroot);
345 HV *pmstash = PmopSTASH(cPMOPo);
346 if (pmstash && SvREFCNT(pmstash)) {
347 PMOP *pmop = HvPMROOT(pmstash);
348 PMOP *lastpmop = NULL;
350 if (cPMOPo == pmop) {
352 lastpmop->op_pmnext = pmop->op_pmnext;
354 HvPMROOT(pmstash) = pmop->op_pmnext;
358 pmop = pmop->op_pmnext;
361 PmopSTASH_free(cPMOPo);
363 cPMOPo->op_pmreplroot = Nullop;
364 /* we use the "SAFE" version of the PM_ macros here
365 * since sv_clean_all might release some PMOPs
366 * after PL_regex_padav has been cleared
367 * and the clearing of PL_regex_padav needs to
368 * happen before sv_clean_all
370 ReREFCNT_dec(PM_GETRE_SAFE(cPMOPo));
371 PM_SETRE_SAFE(cPMOPo, (REGEXP*)NULL);
373 if(PL_regex_pad) { /* We could be in destruction */
374 av_push((AV*) PL_regex_pad[0],(SV*) PL_regex_pad[(cPMOPo)->op_pmoffset]);
375 SvREPADTMP_on(PL_regex_pad[(cPMOPo)->op_pmoffset]);
376 PM_SETRE(cPMOPo, (cPMOPo)->op_pmoffset);
383 if (o->op_targ > 0) {
384 pad_free(o->op_targ);
390 S_cop_free(pTHX_ COP* cop)
392 Safefree(cop->cop_label); /* FIXME: treaddead ??? */
395 if (! specialWARN(cop->cop_warnings))
396 SvREFCNT_dec(cop->cop_warnings);
397 if (! specialCopIO(cop->cop_io)) {
401 char *s = SvPV(cop->cop_io,len);
402 Perl_warn(aTHX_ "io='%.*s'",(int) len,s); /* ??? --jhi */
405 SvREFCNT_dec(cop->cop_io);
411 Perl_op_null(pTHX_ OP *o)
413 if (o->op_type == OP_NULL)
416 o->op_targ = o->op_type;
417 o->op_type = OP_NULL;
418 o->op_ppaddr = PL_ppaddr[OP_NULL];
421 /* Contextualizers */
423 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
426 Perl_linklist(pTHX_ OP *o)
433 /* establish postfix order */
434 if (cUNOPo->op_first) {
435 o->op_next = LINKLIST(cUNOPo->op_first);
436 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
438 kid->op_next = LINKLIST(kid->op_sibling);
450 Perl_scalarkids(pTHX_ OP *o)
453 if (o && o->op_flags & OPf_KIDS) {
454 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
461 S_scalarboolean(pTHX_ OP *o)
463 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
464 if (ckWARN(WARN_SYNTAX)) {
465 line_t oldline = CopLINE(PL_curcop);
467 if (PL_copline != NOLINE)
468 CopLINE_set(PL_curcop, PL_copline);
469 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
470 CopLINE_set(PL_curcop, oldline);
477 Perl_scalar(pTHX_ OP *o)
481 /* assumes no premature commitment */
482 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
483 || o->op_type == OP_RETURN)
488 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
490 switch (o->op_type) {
492 scalar(cBINOPo->op_first);
497 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
501 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
502 if (!kPMOP->op_pmreplroot)
503 deprecate_old("implicit split to @_");
511 if (o->op_flags & OPf_KIDS) {
512 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
518 kid = cLISTOPo->op_first;
520 while ((kid = kid->op_sibling)) {
526 WITH_THR(PL_curcop = &PL_compiling);
531 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
537 WITH_THR(PL_curcop = &PL_compiling);
540 if (ckWARN(WARN_VOID))
541 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
547 Perl_scalarvoid(pTHX_ OP *o)
554 if (o->op_type == OP_NEXTSTATE
555 || o->op_type == OP_SETSTATE
556 || o->op_type == OP_DBSTATE
557 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
558 || o->op_targ == OP_SETSTATE
559 || o->op_targ == OP_DBSTATE)))
560 PL_curcop = (COP*)o; /* for warning below */
562 /* assumes no premature commitment */
563 want = o->op_flags & OPf_WANT;
564 if ((want && want != OPf_WANT_SCALAR) || PL_error_count
565 || o->op_type == OP_RETURN)
570 if ((o->op_private & OPpTARGET_MY)
571 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
573 return scalar(o); /* As if inside SASSIGN */
576 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
578 switch (o->op_type) {
580 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
584 if (o->op_flags & OPf_STACKED)
588 if (o->op_private == 4)
660 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
661 useless = OP_DESC(o);
668 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
669 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
670 useless = "a variable";
675 if (cSVOPo->op_private & OPpCONST_STRICT)
676 no_bareword_allowed(o);
678 if (ckWARN(WARN_VOID)) {
679 useless = "a constant";
680 /* don't warn on optimised away booleans, eg
681 * use constant Foo, 5; Foo || print; */
682 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
684 /* the constants 0 and 1 are permitted as they are
685 conventionally used as dummies in constructs like
686 1 while some_condition_with_side_effects; */
687 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
689 else if (SvPOK(sv)) {
690 /* perl4's way of mixing documentation and code
691 (before the invention of POD) was based on a
692 trick to mix nroff and perl code. The trick was
693 built upon these three nroff macros being used in
694 void context. The pink camel has the details in
695 the script wrapman near page 319. */
696 if (strnEQ(SvPVX(sv), "di", 2) ||
697 strnEQ(SvPVX(sv), "ds", 2) ||
698 strnEQ(SvPVX(sv), "ig", 2))
703 op_null(o); /* don't execute or even remember it */
707 o->op_type = OP_PREINC; /* pre-increment is faster */
708 o->op_ppaddr = PL_ppaddr[OP_PREINC];
712 o->op_type = OP_PREDEC; /* pre-decrement is faster */
713 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
720 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
725 if (o->op_flags & OPf_STACKED)
732 if (!(o->op_flags & OPf_KIDS))
741 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
748 /* all requires must return a boolean value */
749 o->op_flags &= ~OPf_WANT;
754 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
755 if (!kPMOP->op_pmreplroot)
756 deprecate_old("implicit split to @_");
760 if (useless && ckWARN(WARN_VOID))
761 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
766 Perl_listkids(pTHX_ OP *o)
769 if (o && o->op_flags & OPf_KIDS) {
770 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
777 Perl_list(pTHX_ OP *o)
781 /* assumes no premature commitment */
782 if (!o || (o->op_flags & OPf_WANT) || PL_error_count
783 || o->op_type == OP_RETURN)
788 if ((o->op_private & OPpTARGET_MY)
789 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
791 return o; /* As if inside SASSIGN */
794 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
796 switch (o->op_type) {
799 list(cBINOPo->op_first);
804 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
812 if (!(o->op_flags & OPf_KIDS))
814 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
815 list(cBINOPo->op_first);
816 return gen_constant_list(o);
823 kid = cLISTOPo->op_first;
825 while ((kid = kid->op_sibling)) {
831 WITH_THR(PL_curcop = &PL_compiling);
835 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
841 WITH_THR(PL_curcop = &PL_compiling);
844 /* all requires must return a boolean value */
845 o->op_flags &= ~OPf_WANT;
852 Perl_scalarseq(pTHX_ OP *o)
857 if (o->op_type == OP_LINESEQ ||
858 o->op_type == OP_SCOPE ||
859 o->op_type == OP_LEAVE ||
860 o->op_type == OP_LEAVETRY)
862 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
863 if (kid->op_sibling) {
867 PL_curcop = &PL_compiling;
869 o->op_flags &= ~OPf_PARENS;
870 if (PL_hints & HINT_BLOCK_SCOPE)
871 o->op_flags |= OPf_PARENS;
874 o = newOP(OP_STUB, 0);
879 S_modkids(pTHX_ OP *o, I32 type)
882 if (o && o->op_flags & OPf_KIDS) {
883 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
889 /* Propagate lvalue ("modifiable") context to an op and it's children.
890 * 'type' represents the context type, roughly based on the type of op that
891 * would do the modifying, although local() is represented by OP_NULL.
892 * It's responsible for detecting things that can't be modified, flag
893 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
894 * might have to vivify a reference in $x), and so on.
896 * For example, "$a+1 = 2" would cause mod() to be called with o being
897 * OP_ADD and type being OP_SASSIGN, and would output an error.
901 Perl_mod(pTHX_ OP *o, I32 type)
904 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
907 if (!o || PL_error_count)
910 if ((o->op_private & OPpTARGET_MY)
911 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
916 switch (o->op_type) {
922 if (!(o->op_private & (OPpCONST_ARYBASE)))
924 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
925 PL_compiling.cop_arybase = (I32)SvIV(cSVOPx(PL_eval_start)->op_sv);
929 SAVEI32(PL_compiling.cop_arybase);
930 PL_compiling.cop_arybase = 0;
932 else if (type == OP_REFGEN)
935 Perl_croak(aTHX_ "That use of $[ is unsupported");
938 if (o->op_flags & OPf_PARENS)
942 if ((type == OP_UNDEF || type == OP_REFGEN) &&
943 !(o->op_flags & OPf_STACKED)) {
944 o->op_type = OP_RV2CV; /* entersub => rv2cv */
945 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
946 assert(cUNOPo->op_first->op_type == OP_NULL);
947 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
950 else if (o->op_private & OPpENTERSUB_NOMOD)
952 else { /* lvalue subroutine call */
953 o->op_private |= OPpLVAL_INTRO;
954 PL_modcount = RETURN_UNLIMITED_NUMBER;
955 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
956 /* Backward compatibility mode: */
957 o->op_private |= OPpENTERSUB_INARGS;
960 else { /* Compile-time error message: */
961 OP *kid = cUNOPo->op_first;
965 if (kid->op_type == OP_PUSHMARK)
967 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
969 "panic: unexpected lvalue entersub "
970 "args: type/targ %ld:%"UVuf,
971 (long)kid->op_type, (UV)kid->op_targ);
972 kid = kLISTOP->op_first;
974 while (kid->op_sibling)
975 kid = kid->op_sibling;
976 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
978 if (kid->op_type == OP_METHOD_NAMED
979 || kid->op_type == OP_METHOD)
983 NewOp(1101, newop, 1, UNOP);
984 newop->op_type = OP_RV2CV;
985 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
986 newop->op_first = Nullop;
987 newop->op_next = (OP*)newop;
988 kid->op_sibling = (OP*)newop;
989 newop->op_private |= OPpLVAL_INTRO;
993 if (kid->op_type != OP_RV2CV)
995 "panic: unexpected lvalue entersub "
996 "entry via type/targ %ld:%"UVuf,
997 (long)kid->op_type, (UV)kid->op_targ);
998 kid->op_private |= OPpLVAL_INTRO;
999 break; /* Postpone until runtime */
1003 kid = kUNOP->op_first;
1004 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1005 kid = kUNOP->op_first;
1006 if (kid->op_type == OP_NULL)
1008 "Unexpected constant lvalue entersub "
1009 "entry via type/targ %ld:%"UVuf,
1010 (long)kid->op_type, (UV)kid->op_targ);
1011 if (kid->op_type != OP_GV) {
1012 /* Restore RV2CV to check lvalueness */
1014 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1015 okid->op_next = kid->op_next;
1016 kid->op_next = okid;
1019 okid->op_next = Nullop;
1020 okid->op_type = OP_RV2CV;
1022 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1023 okid->op_private |= OPpLVAL_INTRO;
1027 cv = GvCV(kGVOP_gv);
1037 /* grep, foreach, subcalls, refgen */
1038 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1040 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1041 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1043 : (o->op_type == OP_ENTERSUB
1044 ? "non-lvalue subroutine call"
1046 type ? PL_op_desc[type] : "local"));
1060 case OP_RIGHT_SHIFT:
1069 if (!(o->op_flags & OPf_STACKED))
1076 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1082 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1083 PL_modcount = RETURN_UNLIMITED_NUMBER;
1084 return o; /* Treat \(@foo) like ordinary list. */
1088 if (scalar_mod_type(o, type))
1090 ref(cUNOPo->op_first, o->op_type);
1094 if (type == OP_LEAVESUBLV)
1095 o->op_private |= OPpMAYBE_LVSUB;
1101 PL_modcount = RETURN_UNLIMITED_NUMBER;
1104 ref(cUNOPo->op_first, o->op_type);
1109 PL_hints |= HINT_BLOCK_SCOPE;
1124 PL_modcount = RETURN_UNLIMITED_NUMBER;
1125 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1126 return o; /* Treat \(@foo) like ordinary list. */
1127 if (scalar_mod_type(o, type))
1129 if (type == OP_LEAVESUBLV)
1130 o->op_private |= OPpMAYBE_LVSUB;
1134 if (!type) /* local() */
1135 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1136 PAD_COMPNAME_PV(o->op_targ));
1144 if (type != OP_SASSIGN)
1148 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1153 if (type == OP_LEAVESUBLV)
1154 o->op_private |= OPpMAYBE_LVSUB;
1156 pad_free(o->op_targ);
1157 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1158 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1159 if (o->op_flags & OPf_KIDS)
1160 mod(cBINOPo->op_first->op_sibling, type);
1165 ref(cBINOPo->op_first, o->op_type);
1166 if (type == OP_ENTERSUB &&
1167 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1168 o->op_private |= OPpLVAL_DEFER;
1169 if (type == OP_LEAVESUBLV)
1170 o->op_private |= OPpMAYBE_LVSUB;
1180 if (o->op_flags & OPf_KIDS)
1181 mod(cLISTOPo->op_last, type);
1186 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1188 else if (!(o->op_flags & OPf_KIDS))
1190 if (o->op_targ != OP_LIST) {
1191 mod(cBINOPo->op_first, type);
1197 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1202 if (type != OP_LEAVESUBLV)
1204 break; /* mod()ing was handled by ck_return() */
1207 /* [20011101.069] File test operators interpret OPf_REF to mean that
1208 their argument is a filehandle; thus \stat(".") should not set
1210 if (type == OP_REFGEN &&
1211 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1214 if (type != OP_LEAVESUBLV)
1215 o->op_flags |= OPf_MOD;
1217 if (type == OP_AASSIGN || type == OP_SASSIGN)
1218 o->op_flags |= OPf_SPECIAL|OPf_REF;
1219 else if (!type) { /* local() */
1222 o->op_private |= OPpLVAL_INTRO;
1223 o->op_flags &= ~OPf_SPECIAL;
1224 PL_hints |= HINT_BLOCK_SCOPE;
1229 if (ckWARN(WARN_SYNTAX)) {
1230 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1231 "Useless localization of %s", OP_DESC(o));
1235 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1236 && type != OP_LEAVESUBLV)
1237 o->op_flags |= OPf_REF;
1242 S_scalar_mod_type(pTHX_ OP *o, I32 type)
1246 if (o->op_type == OP_RV2GV)
1270 case OP_RIGHT_SHIFT:
1289 S_is_handle_constructor(pTHX_ OP *o, I32 argnum)
1291 switch (o->op_type) {
1299 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1312 Perl_refkids(pTHX_ OP *o, I32 type)
1315 if (o && o->op_flags & OPf_KIDS) {
1316 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1323 Perl_ref(pTHX_ OP *o, I32 type)
1327 if (!o || PL_error_count)
1330 switch (o->op_type) {
1332 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1333 !(o->op_flags & OPf_STACKED)) {
1334 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1335 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1336 assert(cUNOPo->op_first->op_type == OP_NULL);
1337 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1338 o->op_flags |= OPf_SPECIAL;
1343 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1347 if (type == OP_DEFINED)
1348 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1349 ref(cUNOPo->op_first, o->op_type);
1352 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1353 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1354 : type == OP_RV2HV ? OPpDEREF_HV
1356 o->op_flags |= OPf_MOD;
1361 o->op_flags |= OPf_MOD; /* XXX ??? */
1366 o->op_flags |= OPf_REF;
1369 if (type == OP_DEFINED)
1370 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1371 ref(cUNOPo->op_first, o->op_type);
1376 o->op_flags |= OPf_REF;
1381 if (!(o->op_flags & OPf_KIDS))
1383 ref(cBINOPo->op_first, type);
1387 ref(cBINOPo->op_first, o->op_type);
1388 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1389 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1390 : type == OP_RV2HV ? OPpDEREF_HV
1392 o->op_flags |= OPf_MOD;
1400 if (!(o->op_flags & OPf_KIDS))
1402 ref(cLISTOPo->op_last, type);
1412 S_dup_attrlist(pTHX_ OP *o)
1416 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1417 * where the first kid is OP_PUSHMARK and the remaining ones
1418 * are OP_CONST. We need to push the OP_CONST values.
1420 if (o->op_type == OP_CONST)
1421 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc(cSVOPo->op_sv));
1423 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1424 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1425 if (o->op_type == OP_CONST)
1426 rop = append_elem(OP_LIST, rop,
1427 newSVOP(OP_CONST, o->op_flags,
1428 SvREFCNT_inc(cSVOPo->op_sv)));
1435 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1439 /* fake up C<use attributes $pkg,$rv,@attrs> */
1440 ENTER; /* need to protect against side-effects of 'use' */
1443 stashsv = newSVpv(HvNAME(stash), 0);
1445 stashsv = &PL_sv_no;
1447 #define ATTRSMODULE "attributes"
1448 #define ATTRSMODULE_PM "attributes.pm"
1452 /* Don't force the C<use> if we don't need it. */
1453 svp = hv_fetch(GvHVn(PL_incgv), ATTRSMODULE_PM,
1454 sizeof(ATTRSMODULE_PM)-1, 0);
1455 if (svp && *svp != &PL_sv_undef)
1456 ; /* already in %INC */
1458 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1459 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1463 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1464 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1466 prepend_elem(OP_LIST,
1467 newSVOP(OP_CONST, 0, stashsv),
1468 prepend_elem(OP_LIST,
1469 newSVOP(OP_CONST, 0,
1471 dup_attrlist(attrs))));
1477 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1479 OP *pack, *imop, *arg;
1485 assert(target->op_type == OP_PADSV ||
1486 target->op_type == OP_PADHV ||
1487 target->op_type == OP_PADAV);
1489 /* Ensure that attributes.pm is loaded. */
1490 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1492 /* Need package name for method call. */
1493 pack = newSVOP(OP_CONST, 0, newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1));
1495 /* Build up the real arg-list. */
1497 stashsv = newSVpv(HvNAME(stash), 0);
1499 stashsv = &PL_sv_no;
1500 arg = newOP(OP_PADSV, 0);
1501 arg->op_targ = target->op_targ;
1502 arg = prepend_elem(OP_LIST,
1503 newSVOP(OP_CONST, 0, stashsv),
1504 prepend_elem(OP_LIST,
1505 newUNOP(OP_REFGEN, 0,
1506 mod(arg, OP_REFGEN)),
1507 dup_attrlist(attrs)));
1509 /* Fake up a method call to import */
1510 meth = newSVpvn("import", 6);
1511 (void)SvUPGRADE(meth, SVt_PVIV);
1512 (void)SvIOK_on(meth);
1513 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
1514 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
1515 append_elem(OP_LIST,
1516 prepend_elem(OP_LIST, pack, list(arg)),
1517 newSVOP(OP_METHOD_NAMED, 0, meth)));
1518 imop->op_private |= OPpENTERSUB_NOMOD;
1520 /* Combine the ops. */
1521 *imopsp = append_elem(OP_LIST, *imopsp, imop);
1525 =notfor apidoc apply_attrs_string
1527 Attempts to apply a list of attributes specified by the C<attrstr> and
1528 C<len> arguments to the subroutine identified by the C<cv> argument which
1529 is expected to be associated with the package identified by the C<stashpv>
1530 argument (see L<attributes>). It gets this wrong, though, in that it
1531 does not correctly identify the boundaries of the individual attribute
1532 specifications within C<attrstr>. This is not really intended for the
1533 public API, but has to be listed here for systems such as AIX which
1534 need an explicit export list for symbols. (It's called from XS code
1535 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
1536 to respect attribute syntax properly would be welcome.
1542 Perl_apply_attrs_string(pTHX_ char *stashpv, CV *cv,
1543 char *attrstr, STRLEN len)
1548 len = strlen(attrstr);
1552 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
1554 char *sstr = attrstr;
1555 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
1556 attrs = append_elem(OP_LIST, attrs,
1557 newSVOP(OP_CONST, 0,
1558 newSVpvn(sstr, attrstr-sstr)));
1562 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1563 newSVpvn(ATTRSMODULE, sizeof(ATTRSMODULE)-1),
1564 Nullsv, prepend_elem(OP_LIST,
1565 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
1566 prepend_elem(OP_LIST,
1567 newSVOP(OP_CONST, 0,
1573 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
1578 if (!o || PL_error_count)
1582 if (type == OP_LIST) {
1583 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1584 my_kid(kid, attrs, imopsp);
1585 } else if (type == OP_UNDEF) {
1587 } else if (type == OP_RV2SV || /* "our" declaration */
1589 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1590 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
1591 yyerror(Perl_form(aTHX_ "Can't declare %s in %s",
1592 OP_DESC(o), PL_in_my == KEY_our ? "our" : "my"));
1594 GV *gv = cGVOPx_gv(cUNOPo->op_first);
1596 PL_in_my_stash = Nullhv;
1597 apply_attrs(GvSTASH(gv),
1598 (type == OP_RV2SV ? GvSV(gv) :
1599 type == OP_RV2AV ? (SV*)GvAV(gv) :
1600 type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)gv),
1603 o->op_private |= OPpOUR_INTRO;
1606 else if (type != OP_PADSV &&
1609 type != OP_PUSHMARK)
1611 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
1613 PL_in_my == KEY_our ? "our" : "my"));
1616 else if (attrs && type != OP_PUSHMARK) {
1620 PL_in_my_stash = Nullhv;
1622 /* check for C<my Dog $spot> when deciding package */
1623 stash = PAD_COMPNAME_TYPE(o->op_targ);
1625 stash = PL_curstash;
1626 apply_attrs_my(stash, o, attrs, imopsp);
1628 o->op_flags |= OPf_MOD;
1629 o->op_private |= OPpLVAL_INTRO;
1634 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
1637 int maybe_scalar = 0;
1639 /* [perl #17376]: this appears to be premature, and results in code such as
1640 C< our(%x); > executing in list mode rather than void mode */
1642 if (o->op_flags & OPf_PARENS)
1651 o = my_kid(o, attrs, &rops);
1653 if (maybe_scalar && o->op_type == OP_PADSV) {
1654 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
1655 o->op_private |= OPpLVAL_INTRO;
1658 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
1661 PL_in_my_stash = Nullhv;
1666 Perl_my(pTHX_ OP *o)
1668 return my_attrs(o, Nullop);
1672 Perl_sawparens(pTHX_ OP *o)
1675 o->op_flags |= OPf_PARENS;
1680 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
1685 if (ckWARN(WARN_MISC) &&
1686 (left->op_type == OP_RV2AV ||
1687 left->op_type == OP_RV2HV ||
1688 left->op_type == OP_PADAV ||
1689 left->op_type == OP_PADHV)) {
1690 char *desc = PL_op_desc[(right->op_type == OP_SUBST ||
1691 right->op_type == OP_TRANS)
1692 ? right->op_type : OP_MATCH];
1693 const char *sample = ((left->op_type == OP_RV2AV ||
1694 left->op_type == OP_PADAV)
1695 ? "@array" : "%hash");
1696 Perl_warner(aTHX_ packWARN(WARN_MISC),
1697 "Applying %s to %s will act on scalar(%s)",
1698 desc, sample, sample);
1701 if (right->op_type == OP_CONST &&
1702 cSVOPx(right)->op_private & OPpCONST_BARE &&
1703 cSVOPx(right)->op_private & OPpCONST_STRICT)
1705 no_bareword_allowed(right);
1708 ismatchop = right->op_type == OP_MATCH ||
1709 right->op_type == OP_SUBST ||
1710 right->op_type == OP_TRANS;
1711 if (ismatchop && right->op_private & OPpTARGET_MY) {
1713 right->op_private &= ~OPpTARGET_MY;
1715 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
1716 right->op_flags |= OPf_STACKED;
1717 if (right->op_type != OP_MATCH &&
1718 ! (right->op_type == OP_TRANS &&
1719 right->op_private & OPpTRANS_IDENTICAL))
1720 left = mod(left, right->op_type);
1721 if (right->op_type == OP_TRANS)
1722 o = newBINOP(OP_NULL, OPf_STACKED, scalar(left), right);
1724 o = prepend_elem(right->op_type, scalar(left), right);
1726 return newUNOP(OP_NOT, 0, scalar(o));
1730 return bind_match(type, left,
1731 pmruntime(newPMOP(OP_MATCH, 0), right, Nullop));
1735 Perl_invert(pTHX_ OP *o)
1739 /* XXX need to optimize away NOT NOT here? Or do we let optimizer do it? */
1740 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
1744 Perl_scope(pTHX_ OP *o)
1747 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
1748 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
1749 o->op_type = OP_LEAVE;
1750 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
1752 else if (o->op_type == OP_LINESEQ) {
1754 o->op_type = OP_SCOPE;
1755 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
1756 kid = ((LISTOP*)o)->op_first;
1757 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
1761 o = newLISTOP(OP_SCOPE, 0, o, Nullop);
1767 Perl_save_hints(pTHX)
1770 SAVESPTR(GvHV(PL_hintgv));
1771 GvHV(PL_hintgv) = newHVhv(GvHV(PL_hintgv));
1772 SAVEFREESV(GvHV(PL_hintgv));
1776 Perl_block_start(pTHX_ int full)
1778 int retval = PL_savestack_ix;
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);
1801 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
1803 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
1811 I32 offset = pad_findmy("$_");
1812 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS(offset) & SVpad_OUR) {
1813 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
1816 OP *o = newOP(OP_PADSV, 0);
1817 o->op_targ = offset;
1823 Perl_newPROG(pTHX_ OP *o)
1828 PL_eval_root = newUNOP(OP_LEAVEEVAL,
1829 ((PL_in_eval & EVAL_KEEPERR)
1830 ? OPf_SPECIAL : 0), o);
1831 PL_eval_start = linklist(PL_eval_root);
1832 PL_eval_root->op_private |= OPpREFCOUNTED;
1833 OpREFCNT_set(PL_eval_root, 1);
1834 PL_eval_root->op_next = 0;
1835 CALL_PEEP(PL_eval_start);
1838 if (o->op_type == OP_STUB) {
1839 PL_comppad_name = 0;
1844 PL_main_root = scope(sawparens(scalarvoid(o)));
1845 PL_curcop = &PL_compiling;
1846 PL_main_start = LINKLIST(PL_main_root);
1847 PL_main_root->op_private |= OPpREFCOUNTED;
1848 OpREFCNT_set(PL_main_root, 1);
1849 PL_main_root->op_next = 0;
1850 CALL_PEEP(PL_main_start);
1853 /* Register with debugger */
1855 CV *cv = get_cv("DB::postponed", FALSE);
1859 XPUSHs((SV*)CopFILEGV(&PL_compiling));
1861 call_sv((SV*)cv, G_DISCARD);
1868 Perl_localize(pTHX_ OP *o, I32 lex)
1870 if (o->op_flags & OPf_PARENS)
1871 /* [perl #17376]: this appears to be premature, and results in code such as
1872 C< our(%x); > executing in list mode rather than void mode */
1879 if (ckWARN(WARN_PARENTHESIS)
1880 && PL_bufptr > PL_oldbufptr && PL_bufptr[-1] == ',')
1882 char *s = PL_bufptr;
1885 /* some heuristics to detect a potential error */
1886 while (*s && (strchr(", \t\n", *s)))
1890 if (*s && strchr("@$%*", *s) && *++s
1891 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
1894 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
1896 while (*s && (strchr(", \t\n", *s)))
1902 if (sigil && (*s == ';' || *s == '=')) {
1903 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
1904 "Parentheses missing around \"%s\" list",
1905 lex ? (PL_in_my == KEY_our ? "our" : "my")
1913 o = mod(o, OP_NULL); /* a bit kludgey */
1915 PL_in_my_stash = Nullhv;
1920 Perl_jmaybe(pTHX_ OP *o)
1922 if (o->op_type == OP_LIST) {
1924 o2 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpv(";", TRUE, SVt_PV))),
1925 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
1931 Perl_fold_constants(pTHX_ register OP *o)
1934 I32 type = o->op_type;
1937 if (PL_opargs[type] & OA_RETSCALAR)
1939 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
1940 o->op_targ = pad_alloc(type, SVs_PADTMP);
1942 /* integerize op, unless it happens to be C<-foo>.
1943 * XXX should pp_i_negate() do magic string negation instead? */
1944 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
1945 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
1946 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
1948 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
1951 if (!(PL_opargs[type] & OA_FOLDCONST))
1956 /* XXX might want a ck_negate() for this */
1957 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
1969 /* XXX what about the numeric ops? */
1970 if (PL_hints & HINT_LOCALE)
1975 goto nope; /* Don't try to run w/ errors */
1977 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1978 if ((curop->op_type != OP_CONST ||
1979 (curop->op_private & OPpCONST_BARE)) &&
1980 curop->op_type != OP_LIST &&
1981 curop->op_type != OP_SCALAR &&
1982 curop->op_type != OP_NULL &&
1983 curop->op_type != OP_PUSHMARK)
1989 curop = LINKLIST(o);
1993 sv = *(PL_stack_sp--);
1994 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
1995 pad_swipe(o->op_targ, FALSE);
1996 else if (SvTEMP(sv)) { /* grab mortal temp? */
1997 (void)SvREFCNT_inc(sv);
2001 if (type == OP_RV2GV)
2002 return newGVOP(OP_GV, 0, (GV*)sv);
2003 return newSVOP(OP_CONST, 0, sv);
2010 Perl_gen_constant_list(pTHX_ register OP *o)
2013 I32 oldtmps_floor = PL_tmps_floor;
2017 return o; /* Don't attempt to run with errors */
2019 PL_op = curop = LINKLIST(o);
2026 PL_tmps_floor = oldtmps_floor;
2028 o->op_type = OP_RV2AV;
2029 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2030 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2031 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2032 o->op_opt = 0; /* needs to be revisited in peep() */
2033 curop = ((UNOP*)o)->op_first;
2034 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc(*PL_stack_sp--));
2041 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2043 if (!o || o->op_type != OP_LIST)
2044 o = newLISTOP(OP_LIST, 0, o, Nullop);
2046 o->op_flags &= ~OPf_WANT;
2048 if (!(PL_opargs[type] & OA_MARK))
2049 op_null(cLISTOPo->op_first);
2051 o->op_type = (OPCODE)type;
2052 o->op_ppaddr = PL_ppaddr[type];
2053 o->op_flags |= flags;
2055 o = CHECKOP(type, o);
2056 if (o->op_type != type)
2059 return fold_constants(o);
2062 /* List constructors */
2065 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2073 if (first->op_type != type
2074 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2076 return newLISTOP(type, 0, first, last);
2079 if (first->op_flags & OPf_KIDS)
2080 ((LISTOP*)first)->op_last->op_sibling = last;
2082 first->op_flags |= OPf_KIDS;
2083 ((LISTOP*)first)->op_first = last;
2085 ((LISTOP*)first)->op_last = last;
2090 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2098 if (first->op_type != type)
2099 return prepend_elem(type, (OP*)first, (OP*)last);
2101 if (last->op_type != type)
2102 return append_elem(type, (OP*)first, (OP*)last);
2104 first->op_last->op_sibling = last->op_first;
2105 first->op_last = last->op_last;
2106 first->op_flags |= (last->op_flags & OPf_KIDS);
2114 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2122 if (last->op_type == type) {
2123 if (type == OP_LIST) { /* already a PUSHMARK there */
2124 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2125 ((LISTOP*)last)->op_first->op_sibling = first;
2126 if (!(first->op_flags & OPf_PARENS))
2127 last->op_flags &= ~OPf_PARENS;
2130 if (!(last->op_flags & OPf_KIDS)) {
2131 ((LISTOP*)last)->op_last = first;
2132 last->op_flags |= OPf_KIDS;
2134 first->op_sibling = ((LISTOP*)last)->op_first;
2135 ((LISTOP*)last)->op_first = first;
2137 last->op_flags |= OPf_KIDS;
2141 return newLISTOP(type, 0, first, last);
2147 Perl_newNULLLIST(pTHX)
2149 return newOP(OP_STUB, 0);
2153 Perl_force_list(pTHX_ OP *o)
2155 if (!o || o->op_type != OP_LIST)
2156 o = newLISTOP(OP_LIST, 0, o, Nullop);
2162 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2166 NewOp(1101, listop, 1, LISTOP);
2168 listop->op_type = (OPCODE)type;
2169 listop->op_ppaddr = PL_ppaddr[type];
2172 listop->op_flags = (U8)flags;
2176 else if (!first && last)
2179 first->op_sibling = last;
2180 listop->op_first = first;
2181 listop->op_last = last;
2182 if (type == OP_LIST) {
2184 pushop = newOP(OP_PUSHMARK, 0);
2185 pushop->op_sibling = first;
2186 listop->op_first = pushop;
2187 listop->op_flags |= OPf_KIDS;
2189 listop->op_last = pushop;
2192 return CHECKOP(type, listop);
2196 Perl_newOP(pTHX_ I32 type, I32 flags)
2199 NewOp(1101, o, 1, OP);
2200 o->op_type = (OPCODE)type;
2201 o->op_ppaddr = PL_ppaddr[type];
2202 o->op_flags = (U8)flags;
2205 o->op_private = (U8)(0 | (flags >> 8));
2206 if (PL_opargs[type] & OA_RETSCALAR)
2208 if (PL_opargs[type] & OA_TARGET)
2209 o->op_targ = pad_alloc(type, SVs_PADTMP);
2210 return CHECKOP(type, o);
2214 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
2219 first = newOP(OP_STUB, 0);
2220 if (PL_opargs[type] & OA_MARK)
2221 first = force_list(first);
2223 NewOp(1101, unop, 1, UNOP);
2224 unop->op_type = (OPCODE)type;
2225 unop->op_ppaddr = PL_ppaddr[type];
2226 unop->op_first = first;
2227 unop->op_flags = flags | OPf_KIDS;
2228 unop->op_private = (U8)(1 | (flags >> 8));
2229 unop = (UNOP*) CHECKOP(type, unop);
2233 return fold_constants((OP *) unop);
2237 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2240 NewOp(1101, binop, 1, BINOP);
2243 first = newOP(OP_NULL, 0);
2245 binop->op_type = (OPCODE)type;
2246 binop->op_ppaddr = PL_ppaddr[type];
2247 binop->op_first = first;
2248 binop->op_flags = flags | OPf_KIDS;
2251 binop->op_private = (U8)(1 | (flags >> 8));
2254 binop->op_private = (U8)(2 | (flags >> 8));
2255 first->op_sibling = last;
2258 binop = (BINOP*)CHECKOP(type, binop);
2259 if (binop->op_next || binop->op_type != (OPCODE)type)
2262 binop->op_last = binop->op_first->op_sibling;
2264 return fold_constants((OP *)binop);
2268 uvcompare(const void *a, const void *b)
2270 if (*((UV *)a) < (*(UV *)b))
2272 if (*((UV *)a) > (*(UV *)b))
2274 if (*((UV *)a+1) < (*(UV *)b+1))
2276 if (*((UV *)a+1) > (*(UV *)b+1))
2282 Perl_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
2284 SV *tstr = ((SVOP*)expr)->op_sv;
2285 SV *rstr = ((SVOP*)repl)->op_sv;
2288 U8 *t = (U8*)SvPV(tstr, tlen);
2289 U8 *r = (U8*)SvPV(rstr, rlen);
2296 register short *tbl;
2298 PL_hints |= HINT_BLOCK_SCOPE;
2299 complement = o->op_private & OPpTRANS_COMPLEMENT;
2300 del = o->op_private & OPpTRANS_DELETE;
2301 squash = o->op_private & OPpTRANS_SQUASH;
2304 o->op_private |= OPpTRANS_FROM_UTF;
2307 o->op_private |= OPpTRANS_TO_UTF;
2309 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
2310 SV* listsv = newSVpvn("# comment\n",10);
2312 U8* tend = t + tlen;
2313 U8* rend = r + rlen;
2327 I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
2328 I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
2334 tsave = t = bytes_to_utf8(t, &len);
2337 if (!to_utf && rlen) {
2339 rsave = r = bytes_to_utf8(r, &len);
2343 /* There are several snags with this code on EBCDIC:
2344 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
2345 2. scan_const() in toke.c has encoded chars in native encoding which makes
2346 ranges at least in EBCDIC 0..255 range the bottom odd.
2350 U8 tmpbuf[UTF8_MAXLEN+1];
2353 New(1109, cp, 2*tlen, UV);
2355 transv = newSVpvn("",0);
2357 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, 0);
2359 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
2361 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, 0);
2365 cp[2*i+1] = cp[2*i];
2369 qsort(cp, i, 2*sizeof(UV), uvcompare);
2370 for (j = 0; j < i; j++) {
2372 diff = val - nextmin;
2374 t = uvuni_to_utf8(tmpbuf,nextmin);
2375 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2377 U8 range_mark = UTF_TO_NATIVE(0xff);
2378 t = uvuni_to_utf8(tmpbuf, val - 1);
2379 sv_catpvn(transv, (char *)&range_mark, 1);
2380 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2387 t = uvuni_to_utf8(tmpbuf,nextmin);
2388 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2390 U8 range_mark = UTF_TO_NATIVE(0xff);
2391 sv_catpvn(transv, (char *)&range_mark, 1);
2393 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
2394 UNICODE_ALLOW_SUPER);
2395 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2396 t = (U8*)SvPVX(transv);
2397 tlen = SvCUR(transv);
2401 else if (!rlen && !del) {
2402 r = t; rlen = tlen; rend = tend;
2405 if ((!rlen && !del) || t == r ||
2406 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
2408 o->op_private |= OPpTRANS_IDENTICAL;
2412 while (t < tend || tfirst <= tlast) {
2413 /* see if we need more "t" chars */
2414 if (tfirst > tlast) {
2415 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, 0);
2417 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
2419 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, 0);
2426 /* now see if we need more "r" chars */
2427 if (rfirst > rlast) {
2429 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, 0);
2431 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
2433 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, 0);
2442 rfirst = rlast = 0xffffffff;
2446 /* now see which range will peter our first, if either. */
2447 tdiff = tlast - tfirst;
2448 rdiff = rlast - rfirst;
2455 if (rfirst == 0xffffffff) {
2456 diff = tdiff; /* oops, pretend rdiff is infinite */
2458 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
2459 (long)tfirst, (long)tlast);
2461 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
2465 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
2466 (long)tfirst, (long)(tfirst + diff),
2469 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
2470 (long)tfirst, (long)rfirst);
2472 if (rfirst + diff > max)
2473 max = rfirst + diff;
2475 grows = (tfirst < rfirst &&
2476 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
2488 else if (max > 0xff)
2493 Safefree(cPVOPo->op_pv);
2494 cSVOPo->op_sv = (SV*)swash_init("utf8", "", listsv, bits, none);
2495 SvREFCNT_dec(listsv);
2497 SvREFCNT_dec(transv);
2499 if (!del && havefinal && rlen)
2500 (void)hv_store((HV*)SvRV((cSVOPo->op_sv)), "FINAL", 5,
2501 newSVuv((UV)final), 0);
2504 o->op_private |= OPpTRANS_GROWS;
2516 tbl = (short*)cPVOPo->op_pv;
2518 Zero(tbl, 256, short);
2519 for (i = 0; i < (I32)tlen; i++)
2521 for (i = 0, j = 0; i < 256; i++) {
2523 if (j >= (I32)rlen) {
2532 if (i < 128 && r[j] >= 128)
2542 o->op_private |= OPpTRANS_IDENTICAL;
2544 else if (j >= (I32)rlen)
2547 cPVOPo->op_pv = (char*)Renew(tbl, 0x101+rlen-j, short);
2548 tbl[0x100] = rlen - j;
2549 for (i=0; i < (I32)rlen - j; i++)
2550 tbl[0x101+i] = r[j+i];
2554 if (!rlen && !del) {
2557 o->op_private |= OPpTRANS_IDENTICAL;
2559 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
2560 o->op_private |= OPpTRANS_IDENTICAL;
2562 for (i = 0; i < 256; i++)
2564 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
2565 if (j >= (I32)rlen) {
2567 if (tbl[t[i]] == -1)
2573 if (tbl[t[i]] == -1) {
2574 if (t[i] < 128 && r[j] >= 128)
2581 o->op_private |= OPpTRANS_GROWS;
2589 Perl_newPMOP(pTHX_ I32 type, I32 flags)
2593 NewOp(1101, pmop, 1, PMOP);
2594 pmop->op_type = (OPCODE)type;
2595 pmop->op_ppaddr = PL_ppaddr[type];
2596 pmop->op_flags = (U8)flags;
2597 pmop->op_private = (U8)(0 | (flags >> 8));
2599 if (PL_hints & HINT_RE_TAINT)
2600 pmop->op_pmpermflags |= PMf_RETAINT;
2601 if (PL_hints & HINT_LOCALE)
2602 pmop->op_pmpermflags |= PMf_LOCALE;
2603 pmop->op_pmflags = pmop->op_pmpermflags;
2608 if(av_len((AV*) PL_regex_pad[0]) > -1) {
2609 repointer = av_pop((AV*)PL_regex_pad[0]);
2610 pmop->op_pmoffset = SvIV(repointer);
2611 SvREPADTMP_off(repointer);
2612 sv_setiv(repointer,0);
2614 repointer = newSViv(0);
2615 av_push(PL_regex_padav,SvREFCNT_inc(repointer));
2616 pmop->op_pmoffset = av_len(PL_regex_padav);
2617 PL_regex_pad = AvARRAY(PL_regex_padav);
2622 /* link into pm list */
2623 if (type != OP_TRANS && PL_curstash) {
2624 pmop->op_pmnext = HvPMROOT(PL_curstash);
2625 HvPMROOT(PL_curstash) = pmop;
2626 PmopSTASH_set(pmop,PL_curstash);
2629 return CHECKOP(type, pmop);
2633 Perl_pmruntime(pTHX_ OP *o, OP *expr, OP *repl)
2637 I32 repl_has_vars = 0;
2639 if (o->op_type == OP_TRANS)
2640 return pmtrans(o, expr, repl);
2642 PL_hints |= HINT_BLOCK_SCOPE;
2645 if (expr->op_type == OP_CONST) {
2647 SV *pat = ((SVOP*)expr)->op_sv;
2648 char *p = SvPV(pat, plen);
2649 if ((o->op_flags & OPf_SPECIAL) && strEQ(p, " ")) {
2650 sv_setpvn(pat, "\\s+", 3);
2651 p = SvPV(pat, plen);
2652 pm->op_pmflags |= PMf_SKIPWHITE;
2655 pm->op_pmdynflags |= PMdf_UTF8;
2656 PM_SETRE(pm, CALLREGCOMP(aTHX_ p, p + plen, pm));
2657 if (strEQ("\\s+", PM_GETRE(pm)->precomp))
2658 pm->op_pmflags |= PMf_WHITE;
2662 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
2663 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
2665 : OP_REGCMAYBE),0,expr);
2667 NewOp(1101, rcop, 1, LOGOP);
2668 rcop->op_type = OP_REGCOMP;
2669 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
2670 rcop->op_first = scalar(expr);
2671 rcop->op_flags |= ((PL_hints & HINT_RE_EVAL)
2672 ? (OPf_SPECIAL | OPf_KIDS)
2674 rcop->op_private = 1;
2676 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
2679 /* establish postfix order */
2680 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
2682 rcop->op_next = expr;
2683 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
2686 rcop->op_next = LINKLIST(expr);
2687 expr->op_next = (OP*)rcop;
2690 prepend_elem(o->op_type, scalar((OP*)rcop), o);
2695 if (pm->op_pmflags & PMf_EVAL) {
2697 if (CopLINE(PL_curcop) < (line_t)PL_multi_end)
2698 CopLINE_set(PL_curcop, (line_t)PL_multi_end);
2700 else if (repl->op_type == OP_CONST)
2704 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
2705 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
2706 if (curop->op_type == OP_GV) {
2707 GV *gv = cGVOPx_gv(curop);
2709 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
2712 else if (curop->op_type == OP_RV2CV)
2714 else if (curop->op_type == OP_RV2SV ||
2715 curop->op_type == OP_RV2AV ||
2716 curop->op_type == OP_RV2HV ||
2717 curop->op_type == OP_RV2GV) {
2718 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
2721 else if (curop->op_type == OP_PADSV ||
2722 curop->op_type == OP_PADAV ||
2723 curop->op_type == OP_PADHV ||
2724 curop->op_type == OP_PADANY) {
2727 else if (curop->op_type == OP_PUSHRE)
2728 ; /* Okay here, dangerous in newASSIGNOP */
2738 || PM_GETRE(pm)->reganch & ROPT_EVAL_SEEN))) {
2739 pm->op_pmflags |= PMf_CONST; /* const for long enough */
2740 pm->op_pmpermflags |= PMf_CONST; /* const for long enough */
2741 prepend_elem(o->op_type, scalar(repl), o);
2744 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
2745 pm->op_pmflags |= PMf_MAYBE_CONST;
2746 pm->op_pmpermflags |= PMf_MAYBE_CONST;
2748 NewOp(1101, rcop, 1, LOGOP);
2749 rcop->op_type = OP_SUBSTCONT;
2750 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
2751 rcop->op_first = scalar(repl);
2752 rcop->op_flags |= OPf_KIDS;
2753 rcop->op_private = 1;
2756 /* establish postfix order */
2757 rcop->op_next = LINKLIST(repl);
2758 repl->op_next = (OP*)rcop;
2760 pm->op_pmreplroot = scalar((OP*)rcop);
2761 pm->op_pmreplstart = LINKLIST(rcop);
2770 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
2773 NewOp(1101, svop, 1, SVOP);
2774 svop->op_type = (OPCODE)type;
2775 svop->op_ppaddr = PL_ppaddr[type];
2777 svop->op_next = (OP*)svop;
2778 svop->op_flags = (U8)flags;
2779 if (PL_opargs[type] & OA_RETSCALAR)
2781 if (PL_opargs[type] & OA_TARGET)
2782 svop->op_targ = pad_alloc(type, SVs_PADTMP);
2783 return CHECKOP(type, svop);
2787 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
2790 NewOp(1101, padop, 1, PADOP);
2791 padop->op_type = (OPCODE)type;
2792 padop->op_ppaddr = PL_ppaddr[type];
2793 padop->op_padix = pad_alloc(type, SVs_PADTMP);
2794 SvREFCNT_dec(PAD_SVl(padop->op_padix));
2795 PAD_SETSV(padop->op_padix, sv);
2798 padop->op_next = (OP*)padop;
2799 padop->op_flags = (U8)flags;
2800 if (PL_opargs[type] & OA_RETSCALAR)
2802 if (PL_opargs[type] & OA_TARGET)
2803 padop->op_targ = pad_alloc(type, SVs_PADTMP);
2804 return CHECKOP(type, padop);
2808 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
2813 return newPADOP(type, flags, SvREFCNT_inc(gv));
2815 return newSVOP(type, flags, SvREFCNT_inc(gv));
2820 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
2823 NewOp(1101, pvop, 1, PVOP);
2824 pvop->op_type = (OPCODE)type;
2825 pvop->op_ppaddr = PL_ppaddr[type];
2827 pvop->op_next = (OP*)pvop;
2828 pvop->op_flags = (U8)flags;
2829 if (PL_opargs[type] & OA_RETSCALAR)
2831 if (PL_opargs[type] & OA_TARGET)
2832 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
2833 return CHECKOP(type, pvop);
2837 Perl_package(pTHX_ OP *o)
2842 save_hptr(&PL_curstash);
2843 save_item(PL_curstname);
2845 name = SvPV(cSVOPo->op_sv, len);
2846 PL_curstash = gv_stashpvn(name, len, TRUE);
2847 sv_setpvn(PL_curstname, name, len);
2850 PL_hints |= HINT_BLOCK_SCOPE;
2851 PL_copline = NOLINE;
2856 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
2862 if (idop->op_type != OP_CONST)
2863 Perl_croak(aTHX_ "Module name must be constant");
2867 if (version != Nullop) {
2868 SV *vesv = ((SVOP*)version)->op_sv;
2870 if (arg == Nullop && !SvNIOKp(vesv)) {
2877 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
2878 Perl_croak(aTHX_ "Version number must be constant number");
2880 /* Make copy of idop so we don't free it twice */
2881 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
2883 /* Fake up a method call to VERSION */
2884 meth = newSVpvn("VERSION",7);
2885 sv_upgrade(meth, SVt_PVIV);
2886 (void)SvIOK_on(meth);
2887 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
2888 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2889 append_elem(OP_LIST,
2890 prepend_elem(OP_LIST, pack, list(version)),
2891 newSVOP(OP_METHOD_NAMED, 0, meth)));
2895 /* Fake up an import/unimport */
2896 if (arg && arg->op_type == OP_STUB)
2897 imop = arg; /* no import on explicit () */
2898 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
2899 imop = Nullop; /* use 5.0; */
2904 /* Make copy of idop so we don't free it twice */
2905 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
2907 /* Fake up a method call to import/unimport */
2908 meth = aver ? newSVpvn("import",6) : newSVpvn("unimport", 8);
2909 (void)SvUPGRADE(meth, SVt_PVIV);
2910 (void)SvIOK_on(meth);
2911 PERL_HASH(SvUVX(meth), SvPVX(meth), SvCUR(meth));
2912 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
2913 append_elem(OP_LIST,
2914 prepend_elem(OP_LIST, pack, list(arg)),
2915 newSVOP(OP_METHOD_NAMED, 0, meth)));
2918 /* Fake up the BEGIN {}, which does its thing immediately. */
2920 newSVOP(OP_CONST, 0, newSVpvn("BEGIN", 5)),
2923 append_elem(OP_LINESEQ,
2924 append_elem(OP_LINESEQ,
2925 newSTATEOP(0, Nullch, newUNOP(OP_REQUIRE, 0, idop)),
2926 newSTATEOP(0, Nullch, veop)),
2927 newSTATEOP(0, Nullch, imop) ));
2929 /* The "did you use incorrect case?" warning used to be here.
2930 * The problem is that on case-insensitive filesystems one
2931 * might get false positives for "use" (and "require"):
2932 * "use Strict" or "require CARP" will work. This causes
2933 * portability problems for the script: in case-strict
2934 * filesystems the script will stop working.
2936 * The "incorrect case" warning checked whether "use Foo"
2937 * imported "Foo" to your namespace, but that is wrong, too:
2938 * there is no requirement nor promise in the language that
2939 * a Foo.pm should or would contain anything in package "Foo".
2941 * There is very little Configure-wise that can be done, either:
2942 * the case-sensitivity of the build filesystem of Perl does not
2943 * help in guessing the case-sensitivity of the runtime environment.
2946 PL_hints |= HINT_BLOCK_SCOPE;
2947 PL_copline = NOLINE;
2949 PL_cop_seqmax++; /* Purely for B::*'s benefit */
2953 =head1 Embedding Functions
2955 =for apidoc load_module
2957 Loads the module whose name is pointed to by the string part of name.
2958 Note that the actual module name, not its filename, should be given.
2959 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
2960 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
2961 (or 0 for no flags). ver, if specified, provides version semantics
2962 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
2963 arguments can be used to specify arguments to the module's import()
2964 method, similar to C<use Foo::Bar VERSION LIST>.
2969 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
2972 va_start(args, ver);
2973 vload_module(flags, name, ver, &args);
2977 #ifdef PERL_IMPLICIT_CONTEXT
2979 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
2983 va_start(args, ver);
2984 vload_module(flags, name, ver, &args);
2990 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
2992 OP *modname, *veop, *imop;
2994 modname = newSVOP(OP_CONST, 0, name);
2995 modname->op_private |= OPpCONST_BARE;
2997 veop = newSVOP(OP_CONST, 0, ver);
3001 if (flags & PERL_LOADMOD_NOIMPORT) {
3002 imop = sawparens(newNULLLIST());
3004 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
3005 imop = va_arg(*args, OP*);
3010 sv = va_arg(*args, SV*);
3012 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
3013 sv = va_arg(*args, SV*);
3017 line_t ocopline = PL_copline;
3018 COP *ocurcop = PL_curcop;
3019 int oexpect = PL_expect;
3021 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
3022 veop, modname, imop);
3023 PL_expect = oexpect;
3024 PL_copline = ocopline;
3025 PL_curcop = ocurcop;
3030 Perl_dofile(pTHX_ OP *term)
3035 gv = gv_fetchpv("do", FALSE, SVt_PVCV);
3036 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
3037 gv = gv_fetchpv("CORE::GLOBAL::do", FALSE, SVt_PVCV);
3039 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
3040 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
3041 append_elem(OP_LIST, term,
3042 scalar(newUNOP(OP_RV2CV, 0,
3047 doop = newUNOP(OP_DOFILE, 0, scalar(term));
3053 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
3055 return newBINOP(OP_LSLICE, flags,
3056 list(force_list(subscript)),
3057 list(force_list(listval)) );
3061 S_list_assignment(pTHX_ register OP *o)
3066 if (o->op_type == OP_NULL && o->op_flags & OPf_KIDS)
3067 o = cUNOPo->op_first;
3069 if (o->op_type == OP_COND_EXPR) {
3070 I32 t = list_assignment(cLOGOPo->op_first->op_sibling);
3071 I32 f = list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
3076 yyerror("Assignment to both a list and a scalar");
3080 if (o->op_type == OP_LIST &&
3081 (o->op_flags & OPf_WANT) == OPf_WANT_SCALAR &&
3082 o->op_private & OPpLVAL_INTRO)
3085 if (o->op_type == OP_LIST || o->op_flags & OPf_PARENS ||
3086 o->op_type == OP_RV2AV || o->op_type == OP_RV2HV ||
3087 o->op_type == OP_ASLICE || o->op_type == OP_HSLICE)
3090 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV)
3093 if (o->op_type == OP_RV2SV)
3100 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
3105 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
3106 return newLOGOP(optype, 0,
3107 mod(scalar(left), optype),
3108 newUNOP(OP_SASSIGN, 0, scalar(right)));
3111 return newBINOP(optype, OPf_STACKED,
3112 mod(scalar(left), optype), scalar(right));
3116 if (list_assignment(left)) {
3120 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3121 left = mod(left, OP_AASSIGN);
3129 curop = list(force_list(left));
3130 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
3131 o->op_private = (U8)(0 | (flags >> 8));
3133 /* PL_generation sorcery:
3134 * an assignment like ($a,$b) = ($c,$d) is easier than
3135 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
3136 * To detect whether there are common vars, the global var
3137 * PL_generation is incremented for each assign op we compile.
3138 * Then, while compiling the assign op, we run through all the
3139 * variables on both sides of the assignment, setting a spare slot
3140 * in each of them to PL_generation. If any of them already have
3141 * that value, we know we've got commonality. We could use a
3142 * single bit marker, but then we'd have to make 2 passes, first
3143 * to clear the flag, then to test and set it. To find somewhere
3144 * to store these values, evil chicanery is done with SvCUR().
3147 if (!(left->op_private & OPpLVAL_INTRO)) {
3150 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3151 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
3152 if (curop->op_type == OP_GV) {
3153 GV *gv = cGVOPx_gv(curop);
3154 if (gv == PL_defgv || (int)SvCUR(gv) == PL_generation)
3156 SvCUR(gv) = PL_generation;
3158 else if (curop->op_type == OP_PADSV ||
3159 curop->op_type == OP_PADAV ||
3160 curop->op_type == OP_PADHV ||
3161 curop->op_type == OP_PADANY)
3163 if (PAD_COMPNAME_GEN(curop->op_targ)
3164 == (STRLEN)PL_generation)
3166 PAD_COMPNAME_GEN(curop->op_targ)
3170 else if (curop->op_type == OP_RV2CV)
3172 else if (curop->op_type == OP_RV2SV ||
3173 curop->op_type == OP_RV2AV ||
3174 curop->op_type == OP_RV2HV ||
3175 curop->op_type == OP_RV2GV) {
3176 if (lastop->op_type != OP_GV) /* funny deref? */
3179 else if (curop->op_type == OP_PUSHRE) {
3180 if (((PMOP*)curop)->op_pmreplroot) {
3182 GV *gv = (GV*)PAD_SVl(INT2PTR(PADOFFSET,
3183 ((PMOP*)curop)->op_pmreplroot));
3185 GV *gv = (GV*)((PMOP*)curop)->op_pmreplroot;
3187 if (gv == PL_defgv || (int)SvCUR(gv) == PL_generation)
3189 SvCUR(gv) = PL_generation;
3198 o->op_private |= OPpASSIGN_COMMON;
3200 if (right && right->op_type == OP_SPLIT) {
3202 if ((tmpop = ((LISTOP*)right)->op_first) &&
3203 tmpop->op_type == OP_PUSHRE)
3205 PMOP *pm = (PMOP*)tmpop;
3206 if (left->op_type == OP_RV2AV &&
3207 !(left->op_private & OPpLVAL_INTRO) &&
3208 !(o->op_private & OPpASSIGN_COMMON) )
3210 tmpop = ((UNOP*)left)->op_first;
3211 if (tmpop->op_type == OP_GV && !pm->op_pmreplroot) {
3213 pm->op_pmreplroot = INT2PTR(OP*, cPADOPx(tmpop)->op_padix);
3214 cPADOPx(tmpop)->op_padix = 0; /* steal it */
3216 pm->op_pmreplroot = (OP*)cSVOPx(tmpop)->op_sv;
3217 cSVOPx(tmpop)->op_sv = Nullsv; /* steal it */
3219 pm->op_pmflags |= PMf_ONCE;
3220 tmpop = cUNOPo->op_first; /* to list (nulled) */
3221 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
3222 tmpop->op_sibling = Nullop; /* don't free split */
3223 right->op_next = tmpop->op_next; /* fix starting loc */
3224 op_free(o); /* blow off assign */
3225 right->op_flags &= ~OPf_WANT;
3226 /* "I don't know and I don't care." */
3231 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
3232 ((LISTOP*)right)->op_last->op_type == OP_CONST)
3234 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
3236 sv_setiv(sv, PL_modcount+1);
3244 right = newOP(OP_UNDEF, 0);
3245 if (right->op_type == OP_READLINE) {
3246 right->op_flags |= OPf_STACKED;
3247 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
3250 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
3251 o = newBINOP(OP_SASSIGN, flags,
3252 scalar(right), mod(scalar(left), OP_SASSIGN) );
3264 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
3266 U32 seq = intro_my();
3269 NewOp(1101, cop, 1, COP);
3270 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
3271 cop->op_type = OP_DBSTATE;
3272 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
3275 cop->op_type = OP_NEXTSTATE;
3276 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
3278 cop->op_flags = (U8)flags;
3279 cop->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
3281 cop->op_private |= NATIVE_HINTS;
3283 PL_compiling.op_private = cop->op_private;
3284 cop->op_next = (OP*)cop;
3287 cop->cop_label = label;
3288 PL_hints |= HINT_BLOCK_SCOPE;
3291 cop->cop_arybase = PL_curcop->cop_arybase;
3292 if (specialWARN(PL_curcop->cop_warnings))
3293 cop->cop_warnings = PL_curcop->cop_warnings ;
3295 cop->cop_warnings = newSVsv(PL_curcop->cop_warnings) ;
3296 if (specialCopIO(PL_curcop->cop_io))
3297 cop->cop_io = PL_curcop->cop_io;
3299 cop->cop_io = newSVsv(PL_curcop->cop_io) ;
3302 if (PL_copline == NOLINE)
3303 CopLINE_set(cop, CopLINE(PL_curcop));
3305 CopLINE_set(cop, PL_copline);
3306 PL_copline = NOLINE;
3309 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
3311 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
3313 CopSTASH_set(cop, PL_curstash);
3315 if (PERLDB_LINE && PL_curstash != PL_debstash) {
3316 SV **svp = av_fetch(CopFILEAV(PL_curcop), (I32)CopLINE(cop), FALSE);
3317 if (svp && *svp != &PL_sv_undef ) {
3318 (void)SvIOK_on(*svp);
3319 SvIVX(*svp) = PTR2IV(cop);
3323 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
3328 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3330 return new_logop(type, flags, &first, &other);
3334 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3338 OP *first = *firstp;
3339 OP *other = *otherp;
3341 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3342 return newBINOP(type, flags, scalar(first), scalar(other));
3344 scalarboolean(first);
3345 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3346 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3347 if (type == OP_AND || type == OP_OR) {
3353 first = *firstp = cUNOPo->op_first;
3355 first->op_next = o->op_next;
3356 cUNOPo->op_first = Nullop;
3360 if (first->op_type == OP_CONST) {
3361 if (first->op_private & OPpCONST_STRICT)
3362 no_bareword_allowed(first);
3363 else if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3364 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
3365 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3368 other->op_private |= OPpCONST_SHORTCIRCUIT;
3372 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
3374 if ( ! (o2->op_type == OP_LIST
3375 && (( o2 = cUNOPx(o2)->op_first))
3376 && o2->op_type == OP_PUSHMARK
3377 && (( o2 = o2->op_sibling)) )
3380 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
3381 || o2->op_type == OP_PADHV)
3382 && o2->op_private & OPpLVAL_INTRO
3383 && ckWARN(WARN_DEPRECATED))
3385 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
3386 "Deprecated use of my() in false conditional");
3391 first->op_private |= OPpCONST_SHORTCIRCUIT;
3395 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS) &&
3396 type != OP_DOR) /* [#24076] Don't warn for <FH> err FOO. */
3398 OP *k1 = ((UNOP*)first)->op_first;
3399 OP *k2 = k1->op_sibling;
3401 switch (first->op_type)
3404 if (k2 && k2->op_type == OP_READLINE
3405 && (k2->op_flags & OPf_STACKED)
3406 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3408 warnop = k2->op_type;
3413 if (k1->op_type == OP_READDIR
3414 || k1->op_type == OP_GLOB
3415 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3416 || k1->op_type == OP_EACH)
3418 warnop = ((k1->op_type == OP_NULL)
3419 ? (OPCODE)k1->op_targ : k1->op_type);
3424 line_t oldline = CopLINE(PL_curcop);
3425 CopLINE_set(PL_curcop, PL_copline);
3426 Perl_warner(aTHX_ packWARN(WARN_MISC),
3427 "Value of %s%s can be \"0\"; test with defined()",
3429 ((warnop == OP_READLINE || warnop == OP_GLOB)
3430 ? " construct" : "() operator"));
3431 CopLINE_set(PL_curcop, oldline);
3438 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
3439 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3441 NewOp(1101, logop, 1, LOGOP);
3443 logop->op_type = (OPCODE)type;
3444 logop->op_ppaddr = PL_ppaddr[type];
3445 logop->op_first = first;
3446 logop->op_flags = flags | OPf_KIDS;
3447 logop->op_other = LINKLIST(other);
3448 logop->op_private = (U8)(1 | (flags >> 8));
3450 /* establish postfix order */
3451 logop->op_next = LINKLIST(first);
3452 first->op_next = (OP*)logop;
3453 first->op_sibling = other;
3455 CHECKOP(type,logop);
3457 o = newUNOP(OP_NULL, 0, (OP*)logop);
3464 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3471 return newLOGOP(OP_AND, 0, first, trueop);
3473 return newLOGOP(OP_OR, 0, first, falseop);
3475 scalarboolean(first);
3476 if (first->op_type == OP_CONST) {
3477 if (first->op_private & OPpCONST_BARE &&
3478 first->op_private & OPpCONST_STRICT) {
3479 no_bareword_allowed(first);
3481 if (SvTRUE(((SVOP*)first)->op_sv)) {
3492 NewOp(1101, logop, 1, LOGOP);
3493 logop->op_type = OP_COND_EXPR;
3494 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3495 logop->op_first = first;
3496 logop->op_flags = flags | OPf_KIDS;
3497 logop->op_private = (U8)(1 | (flags >> 8));
3498 logop->op_other = LINKLIST(trueop);
3499 logop->op_next = LINKLIST(falseop);
3501 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
3504 /* establish postfix order */
3505 start = LINKLIST(first);
3506 first->op_next = (OP*)logop;
3508 first->op_sibling = trueop;
3509 trueop->op_sibling = falseop;
3510 o = newUNOP(OP_NULL, 0, (OP*)logop);
3512 trueop->op_next = falseop->op_next = o;
3519 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3527 NewOp(1101, range, 1, LOGOP);
3529 range->op_type = OP_RANGE;
3530 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3531 range->op_first = left;
3532 range->op_flags = OPf_KIDS;
3533 leftstart = LINKLIST(left);
3534 range->op_other = LINKLIST(right);
3535 range->op_private = (U8)(1 | (flags >> 8));
3537 left->op_sibling = right;
3539 range->op_next = (OP*)range;
3540 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3541 flop = newUNOP(OP_FLOP, 0, flip);
3542 o = newUNOP(OP_NULL, 0, flop);
3544 range->op_next = leftstart;
3546 left->op_next = flip;
3547 right->op_next = flop;
3549 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3550 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3551 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3552 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3554 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3555 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3558 if (!flip->op_private || !flop->op_private)
3559 linklist(o); /* blow off optimizer unless constant */
3565 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3569 int once = block && block->op_flags & OPf_SPECIAL &&
3570 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3573 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3574 return block; /* do {} while 0 does once */
3575 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3576 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3577 expr = newUNOP(OP_DEFINED, 0,
3578 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3579 } else if (expr->op_flags & OPf_KIDS) {
3580 OP *k1 = ((UNOP*)expr)->op_first;
3581 OP *k2 = (k1) ? k1->op_sibling : NULL;
3582 switch (expr->op_type) {
3584 if (k2 && k2->op_type == OP_READLINE
3585 && (k2->op_flags & OPf_STACKED)
3586 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3587 expr = newUNOP(OP_DEFINED, 0, expr);
3591 if (k1->op_type == OP_READDIR
3592 || k1->op_type == OP_GLOB
3593 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3594 || k1->op_type == OP_EACH)
3595 expr = newUNOP(OP_DEFINED, 0, expr);
3601 /* if block is null, the next append_elem() would put UNSTACK, a scalar
3602 * op, in listop. This is wrong. [perl #27024] */
3604 block = newOP(OP_NULL, 0);
3605 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3606 o = new_logop(OP_AND, 0, &expr, &listop);
3609 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3611 if (once && o != listop)
3612 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3615 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3617 o->op_flags |= flags;
3619 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3624 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3632 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3633 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3634 expr = newUNOP(OP_DEFINED, 0,
3635 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3636 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3637 OP *k1 = ((UNOP*)expr)->op_first;
3638 OP *k2 = (k1) ? k1->op_sibling : NULL;
3639 switch (expr->op_type) {
3641 if (k2 && k2->op_type == OP_READLINE
3642 && (k2->op_flags & OPf_STACKED)
3643 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3644 expr = newUNOP(OP_DEFINED, 0, expr);
3648 if (k1->op_type == OP_READDIR
3649 || k1->op_type == OP_GLOB
3650 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3651 || k1->op_type == OP_EACH)
3652 expr = newUNOP(OP_DEFINED, 0, expr);
3658 block = newOP(OP_NULL, 0);
3660 block = scope(block);
3664 next = LINKLIST(cont);
3667 OP *unstack = newOP(OP_UNSTACK, 0);
3670 cont = append_elem(OP_LINESEQ, cont, unstack);
3673 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3674 redo = LINKLIST(listop);
3677 PL_copline = (line_t)whileline;
3679 o = new_logop(OP_AND, 0, &expr, &listop);
3680 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3681 op_free(expr); /* oops, it's a while (0) */
3683 return Nullop; /* listop already freed by new_logop */
3686 ((LISTOP*)listop)->op_last->op_next =
3687 (o == listop ? redo : LINKLIST(o));
3693 NewOp(1101,loop,1,LOOP);
3694 loop->op_type = OP_ENTERLOOP;
3695 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3696 loop->op_private = 0;
3697 loop->op_next = (OP*)loop;
3700 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3702 loop->op_redoop = redo;
3703 loop->op_lastop = o;
3704 o->op_private |= loopflags;
3707 loop->op_nextop = next;
3709 loop->op_nextop = o;
3711 o->op_flags |= flags;
3712 o->op_private |= (flags >> 8);
3717 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3721 PADOFFSET padoff = 0;
3726 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3727 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
3728 sv->op_type = OP_RV2GV;
3729 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3731 else if (sv->op_type == OP_PADSV) { /* private variable */
3732 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
3733 padoff = sv->op_targ;
3738 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3739 padoff = sv->op_targ;
3741 iterflags |= OPf_SPECIAL;
3746 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3749 I32 offset = pad_findmy("$_");
3750 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS(offset) & SVpad_OUR) {
3751 sv = newGVOP(OP_GV, 0, PL_defgv);
3757 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3758 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3759 iterflags |= OPf_STACKED;
3761 else if (expr->op_type == OP_NULL &&
3762 (expr->op_flags & OPf_KIDS) &&
3763 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3765 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3766 * set the STACKED flag to indicate that these values are to be
3767 * treated as min/max values by 'pp_iterinit'.
3769 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3770 LOGOP* range = (LOGOP*) flip->op_first;
3771 OP* left = range->op_first;
3772 OP* right = left->op_sibling;
3775 range->op_flags &= ~OPf_KIDS;
3776 range->op_first = Nullop;
3778 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3779 listop->op_first->op_next = range->op_next;
3780 left->op_next = range->op_other;
3781 right->op_next = (OP*)listop;
3782 listop->op_next = listop->op_first;
3785 expr = (OP*)(listop);
3787 iterflags |= OPf_STACKED;
3790 expr = mod(force_list(expr), OP_GREPSTART);
3794 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3795 append_elem(OP_LIST, expr, scalar(sv))));
3796 assert(!loop->op_next);
3797 /* for my $x () sets OPpLVAL_INTRO;
3798 * for our $x () sets OPpOUR_INTRO */
3799 loop->op_private = (U8)iterpflags;
3800 #ifdef PL_OP_SLAB_ALLOC
3803 NewOp(1234,tmp,1,LOOP);
3804 Copy(loop,tmp,1,LOOP);
3809 Renew(loop, 1, LOOP);
3811 loop->op_targ = padoff;
3812 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3813 PL_copline = forline;
3814 return newSTATEOP(0, label, wop);
3818 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3823 if (type != OP_GOTO || label->op_type == OP_CONST) {
3824 /* "last()" means "last" */
3825 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3826 o = newOP(type, OPf_SPECIAL);
3828 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3829 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3835 /* Check whether it's going to be a goto &function */
3836 if (label->op_type == OP_ENTERSUB
3837 && !(label->op_flags & OPf_STACKED))
3838 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3839 o = newUNOP(type, OPf_STACKED, label);
3841 PL_hints |= HINT_BLOCK_SCOPE;
3846 =for apidoc cv_undef
3848 Clear out all the active components of a CV. This can happen either
3849 by an explicit C<undef &foo>, or by the reference count going to zero.
3850 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
3851 children can still follow the full lexical scope chain.
3857 Perl_cv_undef(pTHX_ CV *cv)
3860 if (CvFILE(cv) && !CvXSUB(cv)) {
3861 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
3862 Safefree(CvFILE(cv));
3867 if (!CvXSUB(cv) && CvROOT(cv)) {
3869 Perl_croak(aTHX_ "Can't undef active subroutine");
3872 PAD_SAVE_SETNULLPAD();
3874 op_free(CvROOT(cv));
3875 CvROOT(cv) = Nullop;
3878 SvPOK_off((SV*)cv); /* forget prototype */
3883 /* remove CvOUTSIDE unless this is an undef rather than a free */
3884 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
3885 if (!CvWEAKOUTSIDE(cv))
3886 SvREFCNT_dec(CvOUTSIDE(cv));
3887 CvOUTSIDE(cv) = Nullcv;
3890 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
3896 /* delete all flags except WEAKOUTSIDE */
3897 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
3901 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3903 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
3904 SV* msg = sv_newmortal();
3908 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3909 sv_setpv(msg, "Prototype mismatch:");
3911 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
3913 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", (SV *)cv);
3914 sv_catpv(msg, " vs ");
3916 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3918 sv_catpv(msg, "none");
3919 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, msg);
3923 static void const_sv_xsub(pTHX_ CV* cv);
3927 =head1 Optree Manipulation Functions
3929 =for apidoc cv_const_sv
3931 If C<cv> is a constant sub eligible for inlining. returns the constant
3932 value returned by the sub. Otherwise, returns NULL.
3934 Constant subs can be created with C<newCONSTSUB> or as described in
3935 L<perlsub/"Constant Functions">.
3940 Perl_cv_const_sv(pTHX_ CV *cv)
3942 if (!cv || !CvCONST(cv))
3944 return (SV*)CvXSUBANY(cv).any_ptr;
3947 /* op_const_sv: examine an optree to determine whether it's in-lineable.
3948 * Can be called in 3 ways:
3951 * look for a single OP_CONST with attached value: return the value
3953 * cv && CvCLONE(cv) && !CvCONST(cv)
3955 * examine the clone prototype, and if contains only a single
3956 * OP_CONST referencing a pad const, or a single PADSV referencing
3957 * an outer lexical, return a non-zero value to indicate the CV is
3958 * a candidate for "constizing" at clone time
3962 * We have just cloned an anon prototype that was marked as a const
3963 * candidiate. Try to grab the current value, and in the case of
3964 * PADSV, ignore it if it has multiple references. Return the value.
3968 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3975 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3976 o = cLISTOPo->op_first->op_sibling;
3978 for (; o; o = o->op_next) {
3979 OPCODE type = o->op_type;
3981 if (sv && o->op_next == o)
3983 if (o->op_next != o) {
3984 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3986 if (type == OP_DBSTATE)
3989 if (type == OP_LEAVESUB || type == OP_RETURN)
3993 if (type == OP_CONST && cSVOPo->op_sv)
3995 else if (cv && type == OP_CONST) {
3996 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
4000 else if (cv && type == OP_PADSV) {
4001 if (CvCONST(cv)) { /* newly cloned anon */
4002 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
4003 /* the candidate should have 1 ref from this pad and 1 ref
4004 * from the parent */
4005 if (!sv || SvREFCNT(sv) != 2)
4012 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
4013 sv = &PL_sv_undef; /* an arbitrary non-null value */
4024 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4034 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4038 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4040 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4044 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4050 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4054 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4055 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4056 SV *sv = sv_newmortal();
4057 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
4058 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
4059 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4064 gv = gv_fetchpv(name ? name : (aname ? aname :
4065 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__")),
4066 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4076 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4077 maximum a prototype before. */
4078 if (SvTYPE(gv) > SVt_NULL) {
4079 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4080 && ckWARN_d(WARN_PROTOTYPE))
4082 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
4084 cv_ckproto((CV*)gv, NULL, ps);
4087 sv_setpv((SV*)gv, ps);
4089 sv_setiv((SV*)gv, -1);
4090 SvREFCNT_dec(PL_compcv);
4091 cv = PL_compcv = NULL;
4092 PL_sub_generation++;
4096 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4098 #ifdef GV_UNIQUE_CHECK
4099 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
4100 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
4104 if (!block || !ps || *ps || attrs)
4107 const_sv = op_const_sv(block, Nullcv);
4110 bool exists = CvROOT(cv) || CvXSUB(cv);
4112 #ifdef GV_UNIQUE_CHECK
4113 if (exists && GvUNIQUE(gv)) {
4114 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
4118 /* if the subroutine doesn't exist and wasn't pre-declared
4119 * with a prototype, assume it will be AUTOLOADed,
4120 * skipping the prototype check
4122 if (exists || SvPOK(cv))
4123 cv_ckproto(cv, gv, ps);
4124 /* already defined (or promised)? */
4125 if (exists || GvASSUMECV(gv)) {
4126 if (!block && !attrs) {
4127 if (CvFLAGS(PL_compcv)) {
4128 /* might have had built-in attrs applied */
4129 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4131 /* just a "sub foo;" when &foo is already defined */
4132 SAVEFREESV(PL_compcv);
4135 /* ahem, death to those who redefine active sort subs */
4136 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4137 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4139 if (ckWARN(WARN_REDEFINE)
4141 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4143 line_t oldline = CopLINE(PL_curcop);
4144 if (PL_copline != NOLINE)
4145 CopLINE_set(PL_curcop, PL_copline);
4146 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4147 CvCONST(cv) ? "Constant subroutine %s redefined"
4148 : "Subroutine %s redefined", name);
4149 CopLINE_set(PL_curcop, oldline);
4157 SvREFCNT_inc(const_sv);
4159 assert(!CvROOT(cv) && !CvCONST(cv));
4160 sv_setpv((SV*)cv, ""); /* prototype is "" */
4161 CvXSUBANY(cv).any_ptr = const_sv;
4162 CvXSUB(cv) = const_sv_xsub;
4167 cv = newCONSTSUB(NULL, name, const_sv);
4170 SvREFCNT_dec(PL_compcv);
4172 PL_sub_generation++;
4179 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4180 * before we clobber PL_compcv.
4184 /* Might have had built-in attributes applied -- propagate them. */
4185 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4186 if (CvGV(cv) && GvSTASH(CvGV(cv)))
4187 stash = GvSTASH(CvGV(cv));
4188 else if (CvSTASH(cv))
4189 stash = CvSTASH(cv);
4191 stash = PL_curstash;
4194 /* possibly about to re-define existing subr -- ignore old cv */
4195 rcv = (SV*)PL_compcv;
4196 if (name && GvSTASH(gv))
4197 stash = GvSTASH(gv);
4199 stash = PL_curstash;
4201 apply_attrs(stash, rcv, attrs, FALSE);
4203 if (cv) { /* must reuse cv if autoloaded */
4205 /* got here with just attrs -- work done, so bug out */
4206 SAVEFREESV(PL_compcv);
4209 /* transfer PL_compcv to cv */
4211 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4212 if (!CvWEAKOUTSIDE(cv))
4213 SvREFCNT_dec(CvOUTSIDE(cv));
4214 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4215 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
4216 CvOUTSIDE(PL_compcv) = 0;
4217 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4218 CvPADLIST(PL_compcv) = 0;
4219 /* inner references to PL_compcv must be fixed up ... */
4220 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
4221 /* ... before we throw it away */
4222 SvREFCNT_dec(PL_compcv);
4224 if (PERLDB_INTER)/* Advice debugger on the new sub. */
4225 ++PL_sub_generation;
4232 PL_sub_generation++;
4236 CvFILE_set_from_cop(cv, PL_curcop);
4237 CvSTASH(cv) = PL_curstash;
4240 sv_setpv((SV*)cv, ps);
4242 if (PL_error_count) {
4246 char *s = strrchr(name, ':');
4248 if (strEQ(s, "BEGIN")) {
4250 "BEGIN not safe after errors--compilation aborted";
4251 if (PL_in_eval & EVAL_KEEPERR)
4252 Perl_croak(aTHX_ not_safe);
4254 /* force display of errors found but not reported */
4255 sv_catpv(ERRSV, not_safe);
4256 Perl_croak(aTHX_ "%"SVf, ERRSV);
4265 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
4266 mod(scalarseq(block), OP_LEAVESUBLV));
4269 /* This makes sub {}; work as expected. */
4270 if (block->op_type == OP_STUB) {
4272 block = newSTATEOP(0, Nullch, 0);
4274 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4276 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4277 OpREFCNT_set(CvROOT(cv), 1);
4278 CvSTART(cv) = LINKLIST(CvROOT(cv));
4279 CvROOT(cv)->op_next = 0;
4280 CALL_PEEP(CvSTART(cv));
4282 /* now that optimizer has done its work, adjust pad values */
4284 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
4287 assert(!CvCONST(cv));
4288 if (ps && !*ps && op_const_sv(block, cv))
4292 if (name || aname) {
4294 char *tname = (name ? name : aname);
4296 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4297 SV *sv = NEWSV(0,0);
4298 SV *tmpstr = sv_newmortal();
4299 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4303 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4305 (long)PL_subline, (long)CopLINE(PL_curcop));
4306 gv_efullname3(tmpstr, gv, Nullch);
4307 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4308 hv = GvHVn(db_postponed);
4309 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4310 && (pcv = GvCV(db_postponed)))
4316 call_sv((SV*)pcv, G_DISCARD);
4320 if ((s = strrchr(tname,':')))
4325 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4328 if (strEQ(s, "BEGIN") && !PL_error_count) {
4329 I32 oldscope = PL_scopestack_ix;
4331 SAVECOPFILE(&PL_compiling);
4332 SAVECOPLINE(&PL_compiling);
4335 PL_beginav = newAV();
4336 DEBUG_x( dump_sub(gv) );
4337 av_push(PL_beginav, (SV*)cv);
4338 GvCV(gv) = 0; /* cv has been hijacked */
4339 call_list(oldscope, PL_beginav);
4341 PL_curcop = &PL_compiling;
4342 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
4345 else if (strEQ(s, "END") && !PL_error_count) {
4348 DEBUG_x( dump_sub(gv) );
4349 av_unshift(PL_endav, 1);
4350 av_store(PL_endav, 0, (SV*)cv);
4351 GvCV(gv) = 0; /* cv has been hijacked */
4353 else if (strEQ(s, "CHECK") && !PL_error_count) {
4355 PL_checkav = newAV();
4356 DEBUG_x( dump_sub(gv) );
4357 if (PL_main_start && ckWARN(WARN_VOID))
4358 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
4359 av_unshift(PL_checkav, 1);
4360 av_store(PL_checkav, 0, (SV*)cv);
4361 GvCV(gv) = 0; /* cv has been hijacked */
4363 else if (strEQ(s, "INIT") && !PL_error_count) {
4365 PL_initav = newAV();
4366 DEBUG_x( dump_sub(gv) );
4367 if (PL_main_start && ckWARN(WARN_VOID))
4368 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
4369 av_push(PL_initav, (SV*)cv);
4370 GvCV(gv) = 0; /* cv has been hijacked */
4375 PL_copline = NOLINE;
4380 /* XXX unsafe for threads if eval_owner isn't held */
4382 =for apidoc newCONSTSUB
4384 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4385 eligible for inlining at compile-time.
4391 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4397 SAVECOPLINE(PL_curcop);
4398 CopLINE_set(PL_curcop, PL_copline);
4401 PL_hints &= ~HINT_BLOCK_SCOPE;
4404 SAVESPTR(PL_curstash);
4405 SAVECOPSTASH(PL_curcop);
4406 PL_curstash = stash;
4407 CopSTASH_set(PL_curcop,stash);
4410 cv = newXS(name, const_sv_xsub, savepv(CopFILE(PL_curcop)));
4411 CvXSUBANY(cv).any_ptr = sv;
4413 sv_setpv((SV*)cv, ""); /* prototype is "" */
4416 CopSTASH_free(PL_curcop);
4424 =for apidoc U||newXS
4426 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4432 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4434 GV *gv = gv_fetchpv(name ? name :
4435 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
4436 GV_ADDMULTI, SVt_PVCV);
4440 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
4442 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4444 /* just a cached method */
4448 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4449 /* already defined (or promised) */
4450 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4451 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4452 line_t oldline = CopLINE(PL_curcop);
4453 if (PL_copline != NOLINE)
4454 CopLINE_set(PL_curcop, PL_copline);
4455 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4456 CvCONST(cv) ? "Constant subroutine %s redefined"
4457 : "Subroutine %s redefined"
4459 CopLINE_set(PL_curcop, oldline);
4466 if (cv) /* must reuse cv if autoloaded */
4469 cv = (CV*)NEWSV(1105,0);
4470 sv_upgrade((SV *)cv, SVt_PVCV);
4474 PL_sub_generation++;
4478 (void)gv_fetchfile(filename);
4479 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4480 an external constant string */
4481 CvXSUB(cv) = subaddr;
4484 char *s = strrchr(name,':');
4490 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4493 if (strEQ(s, "BEGIN")) {
4495 PL_beginav = newAV();
4496 av_push(PL_beginav, (SV*)cv);
4497 GvCV(gv) = 0; /* cv has been hijacked */
4499 else if (strEQ(s, "END")) {
4502 av_unshift(PL_endav, 1);
4503 av_store(PL_endav, 0, (SV*)cv);
4504 GvCV(gv) = 0; /* cv has been hijacked */
4506 else if (strEQ(s, "CHECK")) {
4508 PL_checkav = newAV();
4509 if (PL_main_start && ckWARN(WARN_VOID))
4510 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
4511 av_unshift(PL_checkav, 1);
4512 av_store(PL_checkav, 0, (SV*)cv);
4513 GvCV(gv) = 0; /* cv has been hijacked */
4515 else if (strEQ(s, "INIT")) {
4517 PL_initav = newAV();
4518 if (PL_main_start && ckWARN(WARN_VOID))
4519 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
4520 av_push(PL_initav, (SV*)cv);
4521 GvCV(gv) = 0; /* cv has been hijacked */
4532 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4540 name = SvPVx(cSVOPo->op_sv, n_a);
4543 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4544 #ifdef GV_UNIQUE_CHECK
4546 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
4550 if ((cv = GvFORM(gv))) {
4551 if (ckWARN(WARN_REDEFINE)) {
4552 line_t oldline = CopLINE(PL_curcop);
4553 if (PL_copline != NOLINE)
4554 CopLINE_set(PL_curcop, PL_copline);
4555 Perl_warner(aTHX_ packWARN(WARN_REDEFINE), "Format %s redefined",name);
4556 CopLINE_set(PL_curcop, oldline);
4563 CvFILE_set_from_cop(cv, PL_curcop);
4566 pad_tidy(padtidy_FORMAT);
4567 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4568 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4569 OpREFCNT_set(CvROOT(cv), 1);
4570 CvSTART(cv) = LINKLIST(CvROOT(cv));
4571 CvROOT(cv)->op_next = 0;
4572 CALL_PEEP(CvSTART(cv));
4574 PL_copline = NOLINE;
4579 Perl_newANONLIST(pTHX_ OP *o)
4581 return newUNOP(OP_REFGEN, 0,
4582 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4586 Perl_newANONHASH(pTHX_ OP *o)
4588 return newUNOP(OP_REFGEN, 0,
4589 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4593 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4595 return newANONATTRSUB(floor, proto, Nullop, block);
4599 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4601 return newUNOP(OP_REFGEN, 0,
4602 newSVOP(OP_ANONCODE, 0,
4603 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4607 Perl_oopsAV(pTHX_ OP *o)
4609 switch (o->op_type) {
4611 o->op_type = OP_PADAV;
4612 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4613 return ref(o, OP_RV2AV);
4616 o->op_type = OP_RV2AV;
4617 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4622 if (ckWARN_d(WARN_INTERNAL))
4623 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
4630 Perl_oopsHV(pTHX_ OP *o)
4632 switch (o->op_type) {
4635 o->op_type = OP_PADHV;
4636 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4637 return ref(o, OP_RV2HV);
4641 o->op_type = OP_RV2HV;
4642 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4647 if (ckWARN_d(WARN_INTERNAL))
4648 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
4655 Perl_newAVREF(pTHX_ OP *o)
4657 if (o->op_type == OP_PADANY) {
4658 o->op_type = OP_PADAV;
4659 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4662 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
4663 && ckWARN(WARN_DEPRECATED)) {
4664 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4665 "Using an array as a reference is deprecated");
4667 return newUNOP(OP_RV2AV, 0, scalar(o));
4671 Perl_newGVREF(pTHX_ I32 type, OP *o)
4673 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4674 return newUNOP(OP_NULL, 0, o);
4675 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4679 Perl_newHVREF(pTHX_ OP *o)
4681 if (o->op_type == OP_PADANY) {
4682 o->op_type = OP_PADHV;
4683 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4686 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
4687 && ckWARN(WARN_DEPRECATED)) {
4688 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4689 "Using a hash as a reference is deprecated");
4691 return newUNOP(OP_RV2HV, 0, scalar(o));
4695 Perl_oopsCV(pTHX_ OP *o)
4697 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4703 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4705 return newUNOP(OP_RV2CV, flags, scalar(o));
4709 Perl_newSVREF(pTHX_ OP *o)
4711 if (o->op_type == OP_PADANY) {
4712 o->op_type = OP_PADSV;
4713 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4716 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4717 o->op_flags |= OPpDONE_SVREF;
4720 return newUNOP(OP_RV2SV, 0, scalar(o));
4723 /* Check routines. */
4726 Perl_ck_anoncode(pTHX_ OP *o)
4728 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
4729 cSVOPo->op_sv = Nullsv;
4734 Perl_ck_bitop(pTHX_ OP *o)
4736 #define OP_IS_NUMCOMPARE(op) \
4737 ((op) == OP_LT || (op) == OP_I_LT || \
4738 (op) == OP_GT || (op) == OP_I_GT || \
4739 (op) == OP_LE || (op) == OP_I_LE || \
4740 (op) == OP_GE || (op) == OP_I_GE || \
4741 (op) == OP_EQ || (op) == OP_I_EQ || \
4742 (op) == OP_NE || (op) == OP_I_NE || \
4743 (op) == OP_NCMP || (op) == OP_I_NCMP)
4744 o->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
4745 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
4746 && (o->op_type == OP_BIT_OR
4747 || o->op_type == OP_BIT_AND
4748 || o->op_type == OP_BIT_XOR))
4750 OP * left = cBINOPo->op_first;
4751 OP * right = left->op_sibling;
4752 if ((OP_IS_NUMCOMPARE(left->op_type) &&
4753 (left->op_flags & OPf_PARENS) == 0) ||
4754 (OP_IS_NUMCOMPARE(right->op_type) &&
4755 (right->op_flags & OPf_PARENS) == 0))
4756 if (ckWARN(WARN_PRECEDENCE))
4757 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4758 "Possible precedence problem on bitwise %c operator",
4759 o->op_type == OP_BIT_OR ? '|'
4760 : o->op_type == OP_BIT_AND ? '&' : '^'
4767 Perl_ck_concat(pTHX_ OP *o)
4769 OP *kid = cUNOPo->op_first;
4770 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
4771 !(kUNOP->op_first->op_flags & OPf_MOD))
4772 o->op_flags |= OPf_STACKED;
4777 Perl_ck_spair(pTHX_ OP *o)
4779 if (o->op_flags & OPf_KIDS) {
4782 OPCODE type = o->op_type;
4783 o = modkids(ck_fun(o), type);
4784 kid = cUNOPo->op_first;
4785 newop = kUNOP->op_first->op_sibling;
4787 (newop->op_sibling ||
4788 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4789 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4790 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4794 op_free(kUNOP->op_first);
4795 kUNOP->op_first = newop;
4797 o->op_ppaddr = PL_ppaddr[++o->op_type];
4802 Perl_ck_delete(pTHX_ OP *o)
4806 if (o->op_flags & OPf_KIDS) {
4807 OP *kid = cUNOPo->op_first;
4808 switch (kid->op_type) {
4810 o->op_flags |= OPf_SPECIAL;
4813 o->op_private |= OPpSLICE;
4816 o->op_flags |= OPf_SPECIAL;
4821 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
4830 Perl_ck_die(pTHX_ OP *o)
4833 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
4839 Perl_ck_eof(pTHX_ OP *o)
4841 I32 type = o->op_type;
4843 if (o->op_flags & OPf_KIDS) {
4844 if (cLISTOPo->op_first->op_type == OP_STUB) {
4846 o = newUNOP(type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
4854 Perl_ck_eval(pTHX_ OP *o)
4856 PL_hints |= HINT_BLOCK_SCOPE;
4857 if (o->op_flags & OPf_KIDS) {
4858 SVOP *kid = (SVOP*)cUNOPo->op_first;
4861 o->op_flags &= ~OPf_KIDS;
4864 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
4867 cUNOPo->op_first = 0;
4870 NewOp(1101, enter, 1, LOGOP);
4871 enter->op_type = OP_ENTERTRY;
4872 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4873 enter->op_private = 0;
4875 /* establish postfix order */
4876 enter->op_next = (OP*)enter;
4878 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4879 o->op_type = OP_LEAVETRY;
4880 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4881 enter->op_other = o;
4891 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4893 o->op_targ = (PADOFFSET)PL_hints;
4898 Perl_ck_exit(pTHX_ OP *o)
4901 HV *table = GvHV(PL_hintgv);
4903 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
4904 if (svp && *svp && SvTRUE(*svp))
4905 o->op_private |= OPpEXIT_VMSISH;
4907 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
4913 Perl_ck_exec(pTHX_ OP *o)
4916 if (o->op_flags & OPf_STACKED) {
4918 kid = cUNOPo->op_first->op_sibling;
4919 if (kid->op_type == OP_RV2GV)
4928 Perl_ck_exists(pTHX_ OP *o)
4931 if (o->op_flags & OPf_KIDS) {
4932 OP *kid = cUNOPo->op_first;
4933 if (kid->op_type == OP_ENTERSUB) {
4934 (void) ref(kid, o->op_type);
4935 if (kid->op_type != OP_RV2CV && !PL_error_count)
4936 Perl_croak(aTHX_ "%s argument is not a subroutine name",
4938 o->op_private |= OPpEXISTS_SUB;
4940 else if (kid->op_type == OP_AELEM)
4941 o->op_flags |= OPf_SPECIAL;
4942 else if (kid->op_type != OP_HELEM)
4943 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
4952 Perl_ck_gvconst(pTHX_ register OP *o)
4954 o = fold_constants(o);
4955 if (o->op_type == OP_CONST)
4962 Perl_ck_rvconst(pTHX_ register OP *o)
4964 SVOP *kid = (SVOP*)cUNOPo->op_first;
4966 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4967 if (kid->op_type == OP_CONST) {
4971 SV *kidsv = kid->op_sv;
4974 /* Is it a constant from cv_const_sv()? */
4975 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4976 SV *rsv = SvRV(kidsv);
4977 int svtype = SvTYPE(rsv);
4978 char *badtype = Nullch;
4980 switch (o->op_type) {
4982 if (svtype > SVt_PVMG)
4983 badtype = "a SCALAR";
4986 if (svtype != SVt_PVAV)
4987 badtype = "an ARRAY";
4990 if (svtype != SVt_PVHV)
4994 if (svtype != SVt_PVCV)
4999 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
5002 name = SvPV(kidsv, n_a);
5003 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
5004 char *badthing = Nullch;
5005 switch (o->op_type) {
5007 badthing = "a SCALAR";
5010 badthing = "an ARRAY";
5013 badthing = "a HASH";
5018 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5022 * This is a little tricky. We only want to add the symbol if we
5023 * didn't add it in the lexer. Otherwise we get duplicate strict
5024 * warnings. But if we didn't add it in the lexer, we must at
5025 * least pretend like we wanted to add it even if it existed before,
5026 * or we get possible typo warnings. OPpCONST_ENTERED says
5027 * whether the lexer already added THIS instance of this symbol.
5029 iscv = (o->op_type == OP_RV2CV) * 2;
5031 gv = gv_fetchpv(name,
5032 iscv | !(kid->op_private & OPpCONST_ENTERED),
5035 : o->op_type == OP_RV2SV
5037 : o->op_type == OP_RV2AV
5039 : o->op_type == OP_RV2HV
5042 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5044 kid->op_type = OP_GV;
5045 SvREFCNT_dec(kid->op_sv);
5047 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5048 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5049 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
5051 PAD_SETSV(kPADOP->op_padix, (SV*) SvREFCNT_inc(gv));
5053 kid->op_sv = SvREFCNT_inc(gv);
5055 kid->op_private = 0;
5056 kid->op_ppaddr = PL_ppaddr[OP_GV];
5063 Perl_ck_ftst(pTHX_ OP *o)
5065 I32 type = o->op_type;
5067 if (o->op_flags & OPf_REF) {
5070 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5071 SVOP *kid = (SVOP*)cUNOPo->op_first;
5073 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5075 OP *newop = newGVOP(type, OPf_REF,
5076 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5081 if ((PL_hints & HINT_FILETEST_ACCESS) &&
5082 OP_IS_FILETEST_ACCESS(o))
5083 o->op_private |= OPpFT_ACCESS;
5085 if (PL_check[kid->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst)
5086 && kid->op_type != OP_STAT && kid->op_type != OP_LSTAT)
5087 o->op_private |= OPpFT_STACKED;
5091 if (type == OP_FTTTY)
5092 o = newGVOP(type, OPf_REF, PL_stdingv);
5094 o = newUNOP(type, 0, newDEFSVOP());
5100 Perl_ck_fun(pTHX_ OP *o)
5106 int type = o->op_type;
5107 register I32 oa = PL_opargs[type] >> OASHIFT;
5109 if (o->op_flags & OPf_STACKED) {
5110 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5113 return no_fh_allowed(o);
5116 if (o->op_flags & OPf_KIDS) {
5118 tokid = &cLISTOPo->op_first;
5119 kid = cLISTOPo->op_first;
5120 if (kid->op_type == OP_PUSHMARK ||
5121 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5123 tokid = &kid->op_sibling;
5124 kid = kid->op_sibling;
5126 if (!kid && PL_opargs[type] & OA_DEFGV)
5127 *tokid = kid = newDEFSVOP();
5131 sibl = kid->op_sibling;
5134 /* list seen where single (scalar) arg expected? */
5135 if (numargs == 1 && !(oa >> 4)
5136 && kid->op_type == OP_LIST && type != OP_SCALAR)
5138 return too_many_arguments(o,PL_op_desc[type]);
5151 if ((type == OP_PUSH || type == OP_UNSHIFT)
5152 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
5153 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5154 "Useless use of %s with no values",
5157 if (kid->op_type == OP_CONST &&
5158 (kid->op_private & OPpCONST_BARE))
5160 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5161 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5162 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5163 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5164 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5165 "Array @%s missing the @ in argument %"IVdf" of %s()",
5166 name, (IV)numargs, PL_op_desc[type]);
5169 kid->op_sibling = sibl;
5172 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5173 bad_type(numargs, "array", PL_op_desc[type], kid);
5177 if (kid->op_type == OP_CONST &&
5178 (kid->op_private & OPpCONST_BARE))
5180 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5181 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5182 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5183 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5184 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5185 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5186 name, (IV)numargs, PL_op_desc[type]);
5189 kid->op_sibling = sibl;
5192 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5193 bad_type(numargs, "hash", PL_op_desc[type], kid);
5198 OP *newop = newUNOP(OP_NULL, 0, kid);
5199 kid->op_sibling = 0;
5201 newop->op_next = newop;
5203 kid->op_sibling = sibl;
5208 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5209 if (kid->op_type == OP_CONST &&
5210 (kid->op_private & OPpCONST_BARE))
5212 OP *newop = newGVOP(OP_GV, 0,
5213 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5215 if (!(o->op_private & 1) && /* if not unop */
5216 kid == cLISTOPo->op_last)
5217 cLISTOPo->op_last = newop;
5221 else if (kid->op_type == OP_READLINE) {
5222 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5223 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
5226 I32 flags = OPf_SPECIAL;
5230 /* is this op a FH constructor? */
5231 if (is_handle_constructor(o,numargs)) {
5232 char *name = Nullch;
5236 /* Set a flag to tell rv2gv to vivify
5237 * need to "prove" flag does not mean something
5238 * else already - NI-S 1999/05/07
5241 if (kid->op_type == OP_PADSV) {
5242 name = PAD_COMPNAME_PV(kid->op_targ);
5243 /* SvCUR of a pad namesv can't be trusted
5244 * (see PL_generation), so calc its length
5250 else if (kid->op_type == OP_RV2SV
5251 && kUNOP->op_first->op_type == OP_GV)
5253 GV *gv = cGVOPx_gv(kUNOP->op_first);
5255 len = GvNAMELEN(gv);
5257 else if (kid->op_type == OP_AELEM
5258 || kid->op_type == OP_HELEM)
5263 if ((op = ((BINOP*)kid)->op_first)) {
5264 SV *tmpstr = Nullsv;
5266 kid->op_type == OP_AELEM ?
5268 if (((op->op_type == OP_RV2AV) ||
5269 (op->op_type == OP_RV2HV)) &&
5270 (op = ((UNOP*)op)->op_first) &&
5271 (op->op_type == OP_GV)) {
5272 /* packagevar $a[] or $h{} */
5273 GV *gv = cGVOPx_gv(op);
5281 else if (op->op_type == OP_PADAV
5282 || op->op_type == OP_PADHV) {
5283 /* lexicalvar $a[] or $h{} */
5285 PAD_COMPNAME_PV(op->op_targ);
5295 name = SvPV(tmpstr, len);
5300 name = "__ANONIO__";
5307 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5308 namesv = PAD_SVl(targ);
5309 (void)SvUPGRADE(namesv, SVt_PV);
5311 sv_setpvn(namesv, "$", 1);
5312 sv_catpvn(namesv, name, len);
5315 kid->op_sibling = 0;
5316 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5317 kid->op_targ = targ;
5318 kid->op_private |= priv;
5320 kid->op_sibling = sibl;
5326 mod(scalar(kid), type);
5330 tokid = &kid->op_sibling;
5331 kid = kid->op_sibling;
5333 o->op_private |= numargs;
5335 return too_many_arguments(o,OP_DESC(o));
5338 else if (PL_opargs[type] & OA_DEFGV) {
5340 return newUNOP(type, 0, newDEFSVOP());
5344 while (oa & OA_OPTIONAL)
5346 if (oa && oa != OA_LIST)
5347 return too_few_arguments(o,OP_DESC(o));
5353 Perl_ck_glob(pTHX_ OP *o)
5358 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5359 append_elem(OP_GLOB, o, newDEFSVOP());
5361 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV))
5362 && GvCVu(gv) && GvIMPORTED_CV(gv)))
5364 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5367 #if !defined(PERL_EXTERNAL_GLOB)
5368 /* XXX this can be tightened up and made more failsafe. */
5369 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5372 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
5373 newSVpvn("File::Glob", 10), Nullsv, Nullsv, Nullsv);
5374 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5375 glob_gv = gv_fetchpv("File::Glob::csh_glob", FALSE, SVt_PVCV);
5376 GvCV(gv) = GvCV(glob_gv);
5377 SvREFCNT_inc((SV*)GvCV(gv));
5378 GvIMPORTED_CV_on(gv);
5381 #endif /* PERL_EXTERNAL_GLOB */
5383 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5384 append_elem(OP_GLOB, o,
5385 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5386 o->op_type = OP_LIST;
5387 o->op_ppaddr = PL_ppaddr[OP_LIST];
5388 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5389 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5390 cLISTOPo->op_first->op_targ = 0;
5391 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5392 append_elem(OP_LIST, o,
5393 scalar(newUNOP(OP_RV2CV, 0,
5394 newGVOP(OP_GV, 0, gv)))));
5395 o = newUNOP(OP_NULL, 0, ck_subr(o));
5396 o->op_targ = OP_GLOB; /* hint at what it used to be */
5399 gv = newGVgen("main");
5401 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5407 Perl_ck_grep(pTHX_ OP *o)
5411 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5414 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5415 NewOp(1101, gwop, 1, LOGOP);
5417 if (o->op_flags & OPf_STACKED) {
5420 kid = cLISTOPo->op_first->op_sibling;
5421 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5424 kid->op_next = (OP*)gwop;
5425 o->op_flags &= ~OPf_STACKED;
5427 kid = cLISTOPo->op_first->op_sibling;
5428 if (type == OP_MAPWHILE)
5435 kid = cLISTOPo->op_first->op_sibling;
5436 if (kid->op_type != OP_NULL)
5437 Perl_croak(aTHX_ "panic: ck_grep");
5438 kid = kUNOP->op_first;
5440 gwop->op_type = type;
5441 gwop->op_ppaddr = PL_ppaddr[type];
5442 gwop->op_first = listkids(o);
5443 gwop->op_flags |= OPf_KIDS;
5444 gwop->op_other = LINKLIST(kid);
5445 kid->op_next = (OP*)gwop;
5446 offset = pad_findmy("$_");
5447 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS(offset) & SVpad_OUR) {
5448 o->op_private = gwop->op_private = 0;
5449 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5452 o->op_private = gwop->op_private = OPpGREP_LEX;
5453 gwop->op_targ = o->op_targ = offset;
5456 kid = cLISTOPo->op_first->op_sibling;
5457 if (!kid || !kid->op_sibling)
5458 return too_few_arguments(o,OP_DESC(o));
5459 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5460 mod(kid, OP_GREPSTART);
5466 Perl_ck_index(pTHX_ OP *o)
5468 if (o->op_flags & OPf_KIDS) {
5469 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5471 kid = kid->op_sibling; /* get past "big" */
5472 if (kid && kid->op_type == OP_CONST)
5473 fbm_compile(((SVOP*)kid)->op_sv, 0);
5479 Perl_ck_lengthconst(pTHX_ OP *o)
5481 /* XXX length optimization goes here */
5486 Perl_ck_lfun(pTHX_ OP *o)
5488 OPCODE type = o->op_type;
5489 return modkids(ck_fun(o), type);
5493 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5495 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
5496 switch (cUNOPo->op_first->op_type) {
5498 /* This is needed for
5499 if (defined %stash::)
5500 to work. Do not break Tk.
5502 break; /* Globals via GV can be undef */
5504 case OP_AASSIGN: /* Is this a good idea? */
5505 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5506 "defined(@array) is deprecated");
5507 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5508 "\t(Maybe you should just omit the defined()?)\n");
5511 /* This is needed for
5512 if (defined %stash::)
5513 to work. Do not break Tk.
5515 break; /* Globals via GV can be undef */
5517 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5518 "defined(%%hash) is deprecated");
5519 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5520 "\t(Maybe you should just omit the defined()?)\n");
5531 Perl_ck_rfun(pTHX_ OP *o)
5533 OPCODE type = o->op_type;
5534 return refkids(ck_fun(o), type);
5538 Perl_ck_listiob(pTHX_ OP *o)
5542 kid = cLISTOPo->op_first;
5545 kid = cLISTOPo->op_first;
5547 if (kid->op_type == OP_PUSHMARK)
5548 kid = kid->op_sibling;
5549 if (kid && o->op_flags & OPf_STACKED)
5550 kid = kid->op_sibling;
5551 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5552 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5553 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5554 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5555 cLISTOPo->op_first->op_sibling = kid;
5556 cLISTOPo->op_last = kid;
5557 kid = kid->op_sibling;
5562 append_elem(o->op_type, o, newDEFSVOP());
5568 Perl_ck_sassign(pTHX_ OP *o)
5570 OP *kid = cLISTOPo->op_first;
5571 /* has a disposable target? */
5572 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5573 && !(kid->op_flags & OPf_STACKED)
5574 /* Cannot steal the second time! */
5575 && !(kid->op_private & OPpTARGET_MY))
5577 OP *kkid = kid->op_sibling;
5579 /* Can just relocate the target. */
5580 if (kkid && kkid->op_type == OP_PADSV
5581 && !(kkid->op_private & OPpLVAL_INTRO))
5583 kid->op_targ = kkid->op_targ;
5585 /* Now we do not need PADSV and SASSIGN. */
5586 kid->op_sibling = o->op_sibling; /* NULL */
5587 cLISTOPo->op_first = NULL;
5590 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5598 Perl_ck_match(pTHX_ OP *o)
5600 if (o->op_type != OP_QR) {
5601 I32 offset = pad_findmy("$_");
5602 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS(offset) & SVpad_OUR)) {
5603 o->op_targ = offset;
5604 o->op_private |= OPpTARGET_MY;
5607 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
5608 o->op_private |= OPpRUNTIME;
5613 Perl_ck_method(pTHX_ OP *o)
5615 OP *kid = cUNOPo->op_first;
5616 if (kid->op_type == OP_CONST) {
5617 SV* sv = kSVOP->op_sv;
5618 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5620 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5621 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5624 kSVOP->op_sv = Nullsv;
5626 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5635 Perl_ck_null(pTHX_ OP *o)
5641 Perl_ck_open(pTHX_ OP *o)
5643 HV *table = GvHV(PL_hintgv);
5647 svp = hv_fetch(table, "open_IN", 7, FALSE);
5649 mode = mode_from_discipline(*svp);
5650 if (mode & O_BINARY)
5651 o->op_private |= OPpOPEN_IN_RAW;
5652 else if (mode & O_TEXT)
5653 o->op_private |= OPpOPEN_IN_CRLF;
5656 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5658 mode = mode_from_discipline(*svp);
5659 if (mode & O_BINARY)
5660 o->op_private |= OPpOPEN_OUT_RAW;
5661 else if (mode & O_TEXT)
5662 o->op_private |= OPpOPEN_OUT_CRLF;
5665 if (o->op_type == OP_BACKTICK)
5668 /* In case of three-arg dup open remove strictness
5669 * from the last arg if it is a bareword. */
5670 OP *first = cLISTOPx(o)->op_first; /* The pushmark. */
5671 OP *last = cLISTOPx(o)->op_last; /* The bareword. */
5675 if ((last->op_type == OP_CONST) && /* The bareword. */
5676 (last->op_private & OPpCONST_BARE) &&
5677 (last->op_private & OPpCONST_STRICT) &&
5678 (oa = first->op_sibling) && /* The fh. */
5679 (oa = oa->op_sibling) && /* The mode. */
5680 SvPOK(((SVOP*)oa)->op_sv) &&
5681 (mode = SvPVX(((SVOP*)oa)->op_sv)) &&
5682 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
5683 (last == oa->op_sibling)) /* The bareword. */
5684 last->op_private &= ~OPpCONST_STRICT;
5690 Perl_ck_repeat(pTHX_ OP *o)
5692 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5693 o->op_private |= OPpREPEAT_DOLIST;
5694 cBINOPo->op_first = force_list(cBINOPo->op_first);
5702 Perl_ck_require(pTHX_ OP *o)
5706 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5707 SVOP *kid = (SVOP*)cUNOPo->op_first;
5709 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5711 for (s = SvPVX(kid->op_sv); *s; s++) {
5712 if (*s == ':' && s[1] == ':') {
5714 Move(s+2, s+1, strlen(s+2)+1, char);
5715 --SvCUR(kid->op_sv);
5718 if (SvREADONLY(kid->op_sv)) {
5719 SvREADONLY_off(kid->op_sv);
5720 sv_catpvn(kid->op_sv, ".pm", 3);
5721 SvREADONLY_on(kid->op_sv);
5724 sv_catpvn(kid->op_sv, ".pm", 3);
5728 /* handle override, if any */
5729 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
5730 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
5731 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
5733 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5734 OP *kid = cUNOPo->op_first;
5735 cUNOPo->op_first = 0;
5737 return ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
5738 append_elem(OP_LIST, kid,
5739 scalar(newUNOP(OP_RV2CV, 0,
5748 Perl_ck_return(pTHX_ OP *o)
5751 if (CvLVALUE(PL_compcv)) {
5752 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
5753 mod(kid, OP_LEAVESUBLV);
5760 Perl_ck_retarget(pTHX_ OP *o)
5762 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5769 Perl_ck_select(pTHX_ OP *o)
5772 if (o->op_flags & OPf_KIDS) {
5773 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5774 if (kid && kid->op_sibling) {
5775 o->op_type = OP_SSELECT;
5776 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5778 return fold_constants(o);
5782 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5783 if (kid && kid->op_type == OP_RV2GV)
5784 kid->op_private &= ~HINT_STRICT_REFS;
5789 Perl_ck_shift(pTHX_ OP *o)
5791 I32 type = o->op_type;
5793 if (!(o->op_flags & OPf_KIDS)) {
5797 argop = newUNOP(OP_RV2AV, 0,
5798 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
5799 return newUNOP(type, 0, scalar(argop));
5801 return scalar(modkids(ck_fun(o), type));
5805 Perl_ck_sort(pTHX_ OP *o)
5809 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5811 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5812 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5814 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
5816 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5818 if (kid->op_type == OP_SCOPE) {
5822 else if (kid->op_type == OP_LEAVE) {
5823 if (o->op_type == OP_SORT) {
5824 op_null(kid); /* wipe out leave */
5827 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5828 if (k->op_next == kid)
5830 /* don't descend into loops */
5831 else if (k->op_type == OP_ENTERLOOP
5832 || k->op_type == OP_ENTERITER)
5834 k = cLOOPx(k)->op_lastop;
5839 kid->op_next = 0; /* just disconnect the leave */
5840 k = kLISTOP->op_first;
5845 if (o->op_type == OP_SORT) {
5846 /* provide scalar context for comparison function/block */
5852 o->op_flags |= OPf_SPECIAL;
5854 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5857 firstkid = firstkid->op_sibling;
5860 /* provide list context for arguments */
5861 if (o->op_type == OP_SORT)
5868 S_simplify_sort(pTHX_ OP *o)
5870 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5874 if (!(o->op_flags & OPf_STACKED))
5876 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5877 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5878 kid = kUNOP->op_first; /* get past null */
5879 if (kid->op_type != OP_SCOPE)
5881 kid = kLISTOP->op_last; /* get past scope */
5882 switch(kid->op_type) {
5890 k = kid; /* remember this node*/
5891 if (kBINOP->op_first->op_type != OP_RV2SV)
5893 kid = kBINOP->op_first; /* get past cmp */
5894 if (kUNOP->op_first->op_type != OP_GV)
5896 kid = kUNOP->op_first; /* get past rv2sv */
5898 if (GvSTASH(gv) != PL_curstash)
5900 if (strEQ(GvNAME(gv), "a"))
5902 else if (strEQ(GvNAME(gv), "b"))
5906 kid = k; /* back to cmp */
5907 if (kBINOP->op_last->op_type != OP_RV2SV)
5909 kid = kBINOP->op_last; /* down to 2nd arg */
5910 if (kUNOP->op_first->op_type != OP_GV)
5912 kid = kUNOP->op_first; /* get past rv2sv */
5914 if (GvSTASH(gv) != PL_curstash
5916 ? strNE(GvNAME(gv), "a")
5917 : strNE(GvNAME(gv), "b")))
5919 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5921 o->op_private |= OPpSORT_REVERSE;
5922 if (k->op_type == OP_NCMP)
5923 o->op_private |= OPpSORT_NUMERIC;
5924 if (k->op_type == OP_I_NCMP)
5925 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5926 kid = cLISTOPo->op_first->op_sibling;
5927 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5928 op_free(kid); /* then delete it */
5932 Perl_ck_split(pTHX_ OP *o)
5936 if (o->op_flags & OPf_STACKED)
5937 return no_fh_allowed(o);
5939 kid = cLISTOPo->op_first;
5940 if (kid->op_type != OP_NULL)
5941 Perl_croak(aTHX_ "panic: ck_split");
5942 kid = kid->op_sibling;
5943 op_free(cLISTOPo->op_first);
5944 cLISTOPo->op_first = kid;
5946 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5947 cLISTOPo->op_last = kid; /* There was only one element previously */
5950 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
5951 OP *sibl = kid->op_sibling;
5952 kid->op_sibling = 0;
5953 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5954 if (cLISTOPo->op_first == cLISTOPo->op_last)
5955 cLISTOPo->op_last = kid;
5956 cLISTOPo->op_first = kid;
5957 kid->op_sibling = sibl;
5960 kid->op_type = OP_PUSHRE;
5961 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5963 if (ckWARN(WARN_REGEXP) && ((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
5964 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
5965 "Use of /g modifier is meaningless in split");
5968 if (!kid->op_sibling)
5969 append_elem(OP_SPLIT, o, newDEFSVOP());
5971 kid = kid->op_sibling;
5974 if (!kid->op_sibling)
5975 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5977 kid = kid->op_sibling;
5980 if (kid->op_sibling)
5981 return too_many_arguments(o,OP_DESC(o));
5987 Perl_ck_join(pTHX_ OP *o)
5989 if (ckWARN(WARN_SYNTAX)) {
5990 OP *kid = cLISTOPo->op_first->op_sibling;
5991 if (kid && kid->op_type == OP_MATCH) {
5992 char *pmstr = "STRING";
5993 if (PM_GETRE(kPMOP))
5994 pmstr = PM_GETRE(kPMOP)->precomp;
5995 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5996 "/%s/ should probably be written as \"%s\"",
6004 Perl_ck_subr(pTHX_ OP *o)
6006 OP *prev = ((cUNOPo->op_first->op_sibling)
6007 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6008 OP *o2 = prev->op_sibling;
6015 I32 contextclass = 0;
6020 o->op_private |= OPpENTERSUB_HASTARG;
6021 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6022 if (cvop->op_type == OP_RV2CV) {
6024 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6025 op_null(cvop); /* disable rv2cv */
6026 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6027 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6028 GV *gv = cGVOPx_gv(tmpop);
6031 tmpop->op_private |= OPpEARLY_CV;
6034 namegv = CvANON(cv) ? gv : CvGV(cv);
6035 proto = SvPV((SV*)cv, n_a);
6037 if (CvASSERTION(cv)) {
6038 if (PL_hints & HINT_ASSERTING) {
6039 if (PERLDB_ASSERTION && PL_curstash != PL_debstash)
6040 o->op_private |= OPpENTERSUB_DB;
6044 if (ckWARN(WARN_ASSERTIONS) && !(PL_hints & HINT_ASSERTIONSSEEN)) {
6045 Perl_warner(aTHX_ packWARN(WARN_ASSERTIONS),
6046 "Impossible to activate assertion call");
6053 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6054 if (o2->op_type == OP_CONST)
6055 o2->op_private &= ~OPpCONST_STRICT;
6056 else if (o2->op_type == OP_LIST) {
6057 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6058 if (o && o->op_type == OP_CONST)
6059 o->op_private &= ~OPpCONST_STRICT;
6062 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6063 if (PERLDB_SUB && PL_curstash != PL_debstash)
6064 o->op_private |= OPpENTERSUB_DB;
6065 while (o2 != cvop) {
6069 return too_many_arguments(o, gv_ename(namegv));
6087 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6089 arg == 1 ? "block or sub {}" : "sub {}",
6090 gv_ename(namegv), o2);
6093 /* '*' allows any scalar type, including bareword */
6096 if (o2->op_type == OP_RV2GV)
6097 goto wrapref; /* autoconvert GLOB -> GLOBref */
6098 else if (o2->op_type == OP_CONST)
6099 o2->op_private &= ~OPpCONST_STRICT;
6100 else if (o2->op_type == OP_ENTERSUB) {
6101 /* accidental subroutine, revert to bareword */
6102 OP *gvop = ((UNOP*)o2)->op_first;
6103 if (gvop && gvop->op_type == OP_NULL) {
6104 gvop = ((UNOP*)gvop)->op_first;
6106 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6109 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6110 (gvop = ((UNOP*)gvop)->op_first) &&
6111 gvop->op_type == OP_GV)
6113 GV *gv = cGVOPx_gv(gvop);
6114 OP *sibling = o2->op_sibling;
6115 SV *n = newSVpvn("",0);
6117 gv_fullname3(n, gv, "");
6118 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6119 sv_chop(n, SvPVX(n)+6);
6120 o2 = newSVOP(OP_CONST, 0, n);
6121 prev->op_sibling = o2;
6122 o2->op_sibling = sibling;
6138 if (contextclass++ == 0) {
6139 e = strchr(proto, ']');
6140 if (!e || e == proto)
6153 while (*--p != '[');
6154 bad_type(arg, Perl_form(aTHX_ "one of %s", p),
6155 gv_ename(namegv), o2);
6161 if (o2->op_type == OP_RV2GV)
6164 bad_type(arg, "symbol", gv_ename(namegv), o2);
6167 if (o2->op_type == OP_ENTERSUB)
6170 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6173 if (o2->op_type == OP_RV2SV ||
6174 o2->op_type == OP_PADSV ||
6175 o2->op_type == OP_HELEM ||
6176 o2->op_type == OP_AELEM ||
6177 o2->op_type == OP_THREADSV)
6180 bad_type(arg, "scalar", gv_ename(namegv), o2);
6183 if (o2->op_type == OP_RV2AV ||
6184 o2->op_type == OP_PADAV)
6187 bad_type(arg, "array", gv_ename(namegv), o2);
6190 if (o2->op_type == OP_RV2HV ||
6191 o2->op_type == OP_PADHV)
6194 bad_type(arg, "hash", gv_ename(namegv), o2);
6199 OP* sib = kid->op_sibling;
6200 kid->op_sibling = 0;
6201 o2 = newUNOP(OP_REFGEN, 0, kid);
6202 o2->op_sibling = sib;
6203 prev->op_sibling = o2;
6205 if (contextclass && e) {
6220 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
6221 gv_ename(namegv), cv);
6226 mod(o2, OP_ENTERSUB);
6228 o2 = o2->op_sibling;
6230 if (proto && !optional &&
6231 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6232 return too_few_arguments(o, gv_ename(namegv));
6235 o=newSVOP(OP_CONST, 0, newSViv(0));
6241 Perl_ck_svconst(pTHX_ OP *o)
6243 SvREADONLY_on(cSVOPo->op_sv);
6248 Perl_ck_trunc(pTHX_ OP *o)
6250 if (o->op_flags & OPf_KIDS) {
6251 SVOP *kid = (SVOP*)cUNOPo->op_first;
6253 if (kid->op_type == OP_NULL)
6254 kid = (SVOP*)kid->op_sibling;
6255 if (kid && kid->op_type == OP_CONST &&
6256 (kid->op_private & OPpCONST_BARE))
6258 o->op_flags |= OPf_SPECIAL;
6259 kid->op_private &= ~OPpCONST_STRICT;
6266 Perl_ck_unpack(pTHX_ OP *o)
6268 OP *kid = cLISTOPo->op_first;
6269 if (kid->op_sibling) {
6270 kid = kid->op_sibling;
6271 if (!kid->op_sibling)
6272 kid->op_sibling = newDEFSVOP();
6278 Perl_ck_substr(pTHX_ OP *o)
6281 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6282 OP *kid = cLISTOPo->op_first;
6284 if (kid->op_type == OP_NULL)
6285 kid = kid->op_sibling;
6287 kid->op_flags |= OPf_MOD;
6293 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6296 Perl_peep(pTHX_ register OP *o)
6298 register OP* oldop = 0;
6300 if (!o || o->op_opt)
6304 SAVEVPTR(PL_curcop);
6305 for (; o; o = o->op_next) {
6309 switch (o->op_type) {
6313 PL_curcop = ((COP*)o); /* for warnings */
6318 if (cSVOPo->op_private & OPpCONST_STRICT)
6319 no_bareword_allowed(o);
6321 case OP_METHOD_NAMED:
6322 /* Relocate sv to the pad for thread safety.
6323 * Despite being a "constant", the SV is written to,
6324 * for reference counts, sv_upgrade() etc. */
6326 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6327 if (o->op_type == OP_CONST && SvPADTMP(cSVOPo->op_sv)) {
6328 /* If op_sv is already a PADTMP then it is being used by
6329 * some pad, so make a copy. */
6330 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
6331 SvREADONLY_on(PAD_SVl(ix));
6332 SvREFCNT_dec(cSVOPo->op_sv);
6335 SvREFCNT_dec(PAD_SVl(ix));
6336 SvPADTMP_on(cSVOPo->op_sv);
6337 PAD_SETSV(ix, cSVOPo->op_sv);
6338 /* XXX I don't know how this isn't readonly already. */
6339 SvREADONLY_on(PAD_SVl(ix));
6341 cSVOPo->op_sv = Nullsv;
6349 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6350 if (o->op_next->op_private & OPpTARGET_MY) {
6351 if (o->op_flags & OPf_STACKED) /* chained concats */
6352 goto ignore_optimization;
6354 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6355 o->op_targ = o->op_next->op_targ;
6356 o->op_next->op_targ = 0;
6357 o->op_private |= OPpTARGET_MY;
6360 op_null(o->op_next);
6362 ignore_optimization:
6366 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6368 break; /* Scalar stub must produce undef. List stub is noop */
6372 if (o->op_targ == OP_NEXTSTATE
6373 || o->op_targ == OP_DBSTATE
6374 || o->op_targ == OP_SETSTATE)
6376 PL_curcop = ((COP*)o);
6378 /* XXX: We avoid setting op_seq here to prevent later calls
6379 to peep() from mistakenly concluding that optimisation
6380 has already occurred. This doesn't fix the real problem,
6381 though (See 20010220.007). AMS 20010719 */
6382 /* op_seq functionality is now replaced by op_opt */
6383 if (oldop && o->op_next) {
6384 oldop->op_next = o->op_next;
6392 if (oldop && o->op_next) {
6393 oldop->op_next = o->op_next;
6401 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
6402 OP* pop = (o->op_type == OP_PADAV) ?
6403 o->op_next : o->op_next->op_next;
6405 if (pop && pop->op_type == OP_CONST &&
6406 (PL_op = pop->op_next) &&
6407 pop->op_next->op_type == OP_AELEM &&
6408 !(pop->op_next->op_private &
6409 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
6410 (i = SvIV(((SVOP*)pop)->op_sv) - PL_curcop->cop_arybase)
6415 if (o->op_type == OP_GV)
6416 op_null(o->op_next);
6417 op_null(pop->op_next);
6419 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6420 o->op_next = pop->op_next->op_next;
6421 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6422 o->op_private = (U8)i;
6423 if (o->op_type == OP_GV) {
6428 o->op_flags |= OPf_SPECIAL;
6429 o->op_type = OP_AELEMFAST;
6435 if (o->op_next->op_type == OP_RV2SV) {
6436 if (!(o->op_next->op_private & OPpDEREF)) {
6437 op_null(o->op_next);
6438 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6440 o->op_next = o->op_next->op_next;
6441 o->op_type = OP_GVSV;
6442 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6445 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6447 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6448 /* XXX could check prototype here instead of just carping */
6449 SV *sv = sv_newmortal();
6450 gv_efullname3(sv, gv, Nullch);
6451 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
6452 "%"SVf"() called too early to check prototype",
6456 else if (o->op_next->op_type == OP_READLINE
6457 && o->op_next->op_next->op_type == OP_CONCAT
6458 && (o->op_next->op_next->op_flags & OPf_STACKED))
6460 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
6461 o->op_type = OP_RCATLINE;
6462 o->op_flags |= OPf_STACKED;
6463 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
6464 op_null(o->op_next->op_next);
6465 op_null(o->op_next);
6482 while (cLOGOP->op_other->op_type == OP_NULL)
6483 cLOGOP->op_other = cLOGOP->op_other->op_next;
6484 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
6490 while (cLOOP->op_redoop->op_type == OP_NULL)
6491 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
6492 peep(cLOOP->op_redoop);
6493 while (cLOOP->op_nextop->op_type == OP_NULL)
6494 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
6495 peep(cLOOP->op_nextop);
6496 while (cLOOP->op_lastop->op_type == OP_NULL)
6497 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
6498 peep(cLOOP->op_lastop);
6505 while (cPMOP->op_pmreplstart &&
6506 cPMOP->op_pmreplstart->op_type == OP_NULL)
6507 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
6508 peep(cPMOP->op_pmreplstart);
6513 if (ckWARN(WARN_SYNTAX) && o->op_next
6514 && o->op_next->op_type == OP_NEXTSTATE) {
6515 if (o->op_next->op_sibling &&
6516 o->op_next->op_sibling->op_type != OP_EXIT &&
6517 o->op_next->op_sibling->op_type != OP_WARN &&
6518 o->op_next->op_sibling->op_type != OP_DIE) {
6519 line_t oldline = CopLINE(PL_curcop);
6521 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6522 Perl_warner(aTHX_ packWARN(WARN_EXEC),
6523 "Statement unlikely to be reached");
6524 Perl_warner(aTHX_ packWARN(WARN_EXEC),
6525 "\t(Maybe you meant system() when you said exec()?)\n");
6526 CopLINE_set(PL_curcop, oldline);
6539 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6542 /* Make the CONST have a shared SV */
6543 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6544 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6545 key = SvPV(sv, keylen);
6546 lexname = newSVpvn_share(key,
6547 SvUTF8(sv) ? -(I32)keylen : keylen,
6556 /* make @a = sort @a act in-place */
6558 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
6564 /* check that RHS of sort is a single plain array */
6565 oright = cUNOPo->op_first;
6566 if (!oright || oright->op_type != OP_PUSHMARK)
6568 oright = cUNOPx(oright)->op_sibling;
6571 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
6572 oright = cUNOPx(oright)->op_sibling;
6576 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
6577 || oright->op_next != o
6578 || (oright->op_private & OPpLVAL_INTRO)
6582 /* o2 follows the chain of op_nexts through the LHS of the
6583 * assign (if any) to the aassign op itself */
6585 if (!o2 || o2->op_type != OP_NULL)
6588 if (!o2 || o2->op_type != OP_PUSHMARK)
6591 if (o2 && o2->op_type == OP_GV)
6594 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
6595 || (o2->op_private & OPpLVAL_INTRO)
6600 if (!o2 || o2->op_type != OP_NULL)
6603 if (!o2 || o2->op_type != OP_AASSIGN
6604 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
6607 /* check the array is the same on both sides */
6608 if (oleft->op_type == OP_RV2AV) {
6609 if (oright->op_type != OP_RV2AV
6610 || !cUNOPx(oright)->op_first
6611 || cUNOPx(oright)->op_first->op_type != OP_GV
6612 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
6613 cGVOPx_gv(cUNOPx(oright)->op_first)
6617 else if (oright->op_type != OP_PADAV
6618 || oright->op_targ != oleft->op_targ
6622 /* transfer MODishness etc from LHS arg to RHS arg */
6623 oright->op_flags = oleft->op_flags;
6624 o->op_private |= OPpSORT_INPLACE;
6626 /* excise push->gv->rv2av->null->aassign */
6627 o2 = o->op_next->op_next;
6628 op_null(o2); /* PUSHMARK */
6630 if (o2->op_type == OP_GV) {
6631 op_null(o2); /* GV */
6634 op_null(o2); /* RV2AV or PADAV */
6635 o2 = o2->op_next->op_next;
6636 op_null(o2); /* AASSIGN */
6638 o->op_next = o2->op_next;
6656 char* Perl_custom_op_name(pTHX_ OP* o)
6658 IV index = PTR2IV(o->op_ppaddr);
6662 if (!PL_custom_op_names) /* This probably shouldn't happen */
6663 return PL_op_name[OP_CUSTOM];
6665 keysv = sv_2mortal(newSViv(index));
6667 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
6669 return PL_op_name[OP_CUSTOM]; /* Don't know who you are */
6671 return SvPV_nolen(HeVAL(he));
6674 char* Perl_custom_op_desc(pTHX_ OP* o)
6676 IV index = PTR2IV(o->op_ppaddr);
6680 if (!PL_custom_op_descs)
6681 return PL_op_desc[OP_CUSTOM];
6683 keysv = sv_2mortal(newSViv(index));
6685 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
6687 return PL_op_desc[OP_CUSTOM];
6689 return SvPV_nolen(HeVAL(he));
6695 /* Efficient sub that returns a constant scalar value. */
6697 const_sv_xsub(pTHX_ CV* cv)
6702 Perl_croak(aTHX_ "usage: %s::%s()",
6703 HvNAME(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
6707 ST(0) = (SV*)XSANY.any_ptr;