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 o = prepend_elem(OP_LINESEQ, (OP*)cop, o);
3324 CHECKOP(cop->op_type, cop);
3330 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
3332 return new_logop(type, flags, &first, &other);
3336 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
3340 OP *first = *firstp;
3341 OP *other = *otherp;
3343 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
3344 return newBINOP(type, flags, scalar(first), scalar(other));
3346 scalarboolean(first);
3347 /* optimize "!a && b" to "a || b", and "!a || b" to "a && b" */
3348 if (first->op_type == OP_NOT && (first->op_flags & OPf_SPECIAL)) {
3349 if (type == OP_AND || type == OP_OR) {
3355 first = *firstp = cUNOPo->op_first;
3357 first->op_next = o->op_next;
3358 cUNOPo->op_first = Nullop;
3362 if (first->op_type == OP_CONST) {
3363 if (first->op_private & OPpCONST_STRICT)
3364 no_bareword_allowed(first);
3365 else if (ckWARN(WARN_BAREWORD) && (first->op_private & OPpCONST_BARE))
3366 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
3367 if ((type == OP_AND) == (SvTRUE(((SVOP*)first)->op_sv))) {
3370 other->op_private |= OPpCONST_SHORTCIRCUIT;
3376 first->op_private |= OPpCONST_SHORTCIRCUIT;
3380 else if (ckWARN(WARN_MISC) && (first->op_flags & OPf_KIDS) &&
3381 type != OP_DOR) /* [#24076] Don't warn for <FH> err FOO. */
3383 OP *k1 = ((UNOP*)first)->op_first;
3384 OP *k2 = k1->op_sibling;
3386 switch (first->op_type)
3389 if (k2 && k2->op_type == OP_READLINE
3390 && (k2->op_flags & OPf_STACKED)
3391 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3393 warnop = k2->op_type;
3398 if (k1->op_type == OP_READDIR
3399 || k1->op_type == OP_GLOB
3400 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3401 || k1->op_type == OP_EACH)
3403 warnop = ((k1->op_type == OP_NULL)
3404 ? (OPCODE)k1->op_targ : k1->op_type);
3409 line_t oldline = CopLINE(PL_curcop);
3410 CopLINE_set(PL_curcop, PL_copline);
3411 Perl_warner(aTHX_ packWARN(WARN_MISC),
3412 "Value of %s%s can be \"0\"; test with defined()",
3414 ((warnop == OP_READLINE || warnop == OP_GLOB)
3415 ? " construct" : "() operator"));
3416 CopLINE_set(PL_curcop, oldline);
3423 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
3424 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
3426 NewOp(1101, logop, 1, LOGOP);
3428 logop->op_type = (OPCODE)type;
3429 logop->op_ppaddr = PL_ppaddr[type];
3430 logop->op_first = first;
3431 logop->op_flags = flags | OPf_KIDS;
3432 logop->op_other = LINKLIST(other);
3433 logop->op_private = (U8)(1 | (flags >> 8));
3435 /* establish postfix order */
3436 logop->op_next = LINKLIST(first);
3437 first->op_next = (OP*)logop;
3438 first->op_sibling = other;
3440 CHECKOP(type,logop);
3442 o = newUNOP(OP_NULL, 0, (OP*)logop);
3449 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
3456 return newLOGOP(OP_AND, 0, first, trueop);
3458 return newLOGOP(OP_OR, 0, first, falseop);
3460 scalarboolean(first);
3461 if (first->op_type == OP_CONST) {
3462 if (first->op_private & OPpCONST_BARE &&
3463 first->op_private & OPpCONST_STRICT) {
3464 no_bareword_allowed(first);
3466 if (SvTRUE(((SVOP*)first)->op_sv)) {
3477 NewOp(1101, logop, 1, LOGOP);
3478 logop->op_type = OP_COND_EXPR;
3479 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
3480 logop->op_first = first;
3481 logop->op_flags = flags | OPf_KIDS;
3482 logop->op_private = (U8)(1 | (flags >> 8));
3483 logop->op_other = LINKLIST(trueop);
3484 logop->op_next = LINKLIST(falseop);
3486 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
3489 /* establish postfix order */
3490 start = LINKLIST(first);
3491 first->op_next = (OP*)logop;
3493 first->op_sibling = trueop;
3494 trueop->op_sibling = falseop;
3495 o = newUNOP(OP_NULL, 0, (OP*)logop);
3497 trueop->op_next = falseop->op_next = o;
3504 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
3512 NewOp(1101, range, 1, LOGOP);
3514 range->op_type = OP_RANGE;
3515 range->op_ppaddr = PL_ppaddr[OP_RANGE];
3516 range->op_first = left;
3517 range->op_flags = OPf_KIDS;
3518 leftstart = LINKLIST(left);
3519 range->op_other = LINKLIST(right);
3520 range->op_private = (U8)(1 | (flags >> 8));
3522 left->op_sibling = right;
3524 range->op_next = (OP*)range;
3525 flip = newUNOP(OP_FLIP, flags, (OP*)range);
3526 flop = newUNOP(OP_FLOP, 0, flip);
3527 o = newUNOP(OP_NULL, 0, flop);
3529 range->op_next = leftstart;
3531 left->op_next = flip;
3532 right->op_next = flop;
3534 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3535 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
3536 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
3537 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
3539 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3540 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
3543 if (!flip->op_private || !flop->op_private)
3544 linklist(o); /* blow off optimizer unless constant */
3550 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
3554 int once = block && block->op_flags & OPf_SPECIAL &&
3555 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
3558 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
3559 return block; /* do {} while 0 does once */
3560 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3561 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
3562 expr = newUNOP(OP_DEFINED, 0,
3563 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3564 } else if (expr->op_flags & OPf_KIDS) {
3565 OP *k1 = ((UNOP*)expr)->op_first;
3566 OP *k2 = (k1) ? k1->op_sibling : NULL;
3567 switch (expr->op_type) {
3569 if (k2 && k2->op_type == OP_READLINE
3570 && (k2->op_flags & OPf_STACKED)
3571 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3572 expr = newUNOP(OP_DEFINED, 0, expr);
3576 if (k1->op_type == OP_READDIR
3577 || k1->op_type == OP_GLOB
3578 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3579 || k1->op_type == OP_EACH)
3580 expr = newUNOP(OP_DEFINED, 0, expr);
3586 /* if block is null, the next append_elem() would put UNSTACK, a scalar
3587 * op, in listop. This is wrong. [perl #27024] */
3589 block = newOP(OP_NULL, 0);
3590 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
3591 o = new_logop(OP_AND, 0, &expr, &listop);
3594 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
3596 if (once && o != listop)
3597 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
3600 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
3602 o->op_flags |= flags;
3604 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
3609 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 whileline, OP *expr, OP *block, OP *cont)
3617 if (expr && (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
3618 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB))) {
3619 expr = newUNOP(OP_DEFINED, 0,
3620 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
3621 } else if (expr && (expr->op_flags & OPf_KIDS)) {
3622 OP *k1 = ((UNOP*)expr)->op_first;
3623 OP *k2 = (k1) ? k1->op_sibling : NULL;
3624 switch (expr->op_type) {
3626 if (k2 && k2->op_type == OP_READLINE
3627 && (k2->op_flags & OPf_STACKED)
3628 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
3629 expr = newUNOP(OP_DEFINED, 0, expr);
3633 if (k1->op_type == OP_READDIR
3634 || k1->op_type == OP_GLOB
3635 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
3636 || k1->op_type == OP_EACH)
3637 expr = newUNOP(OP_DEFINED, 0, expr);
3643 block = newOP(OP_NULL, 0);
3645 block = scope(block);
3649 next = LINKLIST(cont);
3652 OP *unstack = newOP(OP_UNSTACK, 0);
3655 cont = append_elem(OP_LINESEQ, cont, unstack);
3658 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
3659 redo = LINKLIST(listop);
3662 PL_copline = (line_t)whileline;
3664 o = new_logop(OP_AND, 0, &expr, &listop);
3665 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
3666 op_free(expr); /* oops, it's a while (0) */
3668 return Nullop; /* listop already freed by new_logop */
3671 ((LISTOP*)listop)->op_last->op_next =
3672 (o == listop ? redo : LINKLIST(o));
3678 NewOp(1101,loop,1,LOOP);
3679 loop->op_type = OP_ENTERLOOP;
3680 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
3681 loop->op_private = 0;
3682 loop->op_next = (OP*)loop;
3685 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
3687 loop->op_redoop = redo;
3688 loop->op_lastop = o;
3689 o->op_private |= loopflags;
3692 loop->op_nextop = next;
3694 loop->op_nextop = o;
3696 o->op_flags |= flags;
3697 o->op_private |= (flags >> 8);
3702 Perl_newFOROP(pTHX_ I32 flags,char *label,line_t forline,OP *sv,OP *expr,OP *block,OP *cont)
3706 PADOFFSET padoff = 0;
3711 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
3712 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
3713 sv->op_type = OP_RV2GV;
3714 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
3716 else if (sv->op_type == OP_PADSV) { /* private variable */
3717 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
3718 padoff = sv->op_targ;
3723 else if (sv->op_type == OP_THREADSV) { /* per-thread variable */
3724 padoff = sv->op_targ;
3726 iterflags |= OPf_SPECIAL;
3731 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
3734 I32 offset = pad_findmy("$_");
3735 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS(offset) & SVpad_OUR) {
3736 sv = newGVOP(OP_GV, 0, PL_defgv);
3742 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
3743 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
3744 iterflags |= OPf_STACKED;
3746 else if (expr->op_type == OP_NULL &&
3747 (expr->op_flags & OPf_KIDS) &&
3748 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
3750 /* Basically turn for($x..$y) into the same as for($x,$y), but we
3751 * set the STACKED flag to indicate that these values are to be
3752 * treated as min/max values by 'pp_iterinit'.
3754 UNOP* flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
3755 LOGOP* range = (LOGOP*) flip->op_first;
3756 OP* left = range->op_first;
3757 OP* right = left->op_sibling;
3760 range->op_flags &= ~OPf_KIDS;
3761 range->op_first = Nullop;
3763 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
3764 listop->op_first->op_next = range->op_next;
3765 left->op_next = range->op_other;
3766 right->op_next = (OP*)listop;
3767 listop->op_next = listop->op_first;
3770 expr = (OP*)(listop);
3772 iterflags |= OPf_STACKED;
3775 expr = mod(force_list(expr), OP_GREPSTART);
3779 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
3780 append_elem(OP_LIST, expr, scalar(sv))));
3781 assert(!loop->op_next);
3782 /* for my $x () sets OPpLVAL_INTRO;
3783 * for our $x () sets OPpOUR_INTRO */
3784 loop->op_private = (U8)iterpflags;
3785 #ifdef PL_OP_SLAB_ALLOC
3788 NewOp(1234,tmp,1,LOOP);
3789 Copy(loop,tmp,1,LOOP);
3794 Renew(loop, 1, LOOP);
3796 loop->op_targ = padoff;
3797 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont);
3798 PL_copline = forline;
3799 return newSTATEOP(0, label, wop);
3803 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
3808 if (type != OP_GOTO || label->op_type == OP_CONST) {
3809 /* "last()" means "last" */
3810 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
3811 o = newOP(type, OPf_SPECIAL);
3813 o = newPVOP(type, 0, savepv(label->op_type == OP_CONST
3814 ? SvPVx(((SVOP*)label)->op_sv, n_a)
3820 /* Check whether it's going to be a goto &function */
3821 if (label->op_type == OP_ENTERSUB
3822 && !(label->op_flags & OPf_STACKED))
3823 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
3824 o = newUNOP(type, OPf_STACKED, label);
3826 PL_hints |= HINT_BLOCK_SCOPE;
3831 =for apidoc cv_undef
3833 Clear out all the active components of a CV. This can happen either
3834 by an explicit C<undef &foo>, or by the reference count going to zero.
3835 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
3836 children can still follow the full lexical scope chain.
3842 Perl_cv_undef(pTHX_ CV *cv)
3845 if (CvFILE(cv) && !CvXSUB(cv)) {
3846 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
3847 Safefree(CvFILE(cv));
3852 if (!CvXSUB(cv) && CvROOT(cv)) {
3854 Perl_croak(aTHX_ "Can't undef active subroutine");
3857 PAD_SAVE_SETNULLPAD();
3859 op_free(CvROOT(cv));
3860 CvROOT(cv) = Nullop;
3863 SvPOK_off((SV*)cv); /* forget prototype */
3868 /* remove CvOUTSIDE unless this is an undef rather than a free */
3869 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
3870 if (!CvWEAKOUTSIDE(cv))
3871 SvREFCNT_dec(CvOUTSIDE(cv));
3872 CvOUTSIDE(cv) = Nullcv;
3875 SvREFCNT_dec((SV*)CvXSUBANY(cv).any_ptr);
3881 /* delete all flags except WEAKOUTSIDE */
3882 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
3886 Perl_cv_ckproto(pTHX_ CV *cv, GV *gv, char *p)
3888 if (((!p != !SvPOK(cv)) || (p && strNE(p, SvPVX(cv)))) && ckWARN_d(WARN_PROTOTYPE)) {
3889 SV* msg = sv_newmortal();
3893 gv_efullname3(name = sv_newmortal(), gv, Nullch);
3894 sv_setpv(msg, "Prototype mismatch:");
3896 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, name);
3898 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", (SV *)cv);
3899 sv_catpv(msg, " vs ");
3901 Perl_sv_catpvf(aTHX_ msg, "(%s)", p);
3903 sv_catpv(msg, "none");
3904 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, msg);
3908 static void const_sv_xsub(pTHX_ CV* cv);
3912 =head1 Optree Manipulation Functions
3914 =for apidoc cv_const_sv
3916 If C<cv> is a constant sub eligible for inlining. returns the constant
3917 value returned by the sub. Otherwise, returns NULL.
3919 Constant subs can be created with C<newCONSTSUB> or as described in
3920 L<perlsub/"Constant Functions">.
3925 Perl_cv_const_sv(pTHX_ CV *cv)
3927 if (!cv || !CvCONST(cv))
3929 return (SV*)CvXSUBANY(cv).any_ptr;
3932 /* op_const_sv: examine an optree to determine whether it's in-lineable.
3933 * Can be called in 3 ways:
3936 * look for a single OP_CONST with attached value: return the value
3938 * cv && CvCLONE(cv) && !CvCONST(cv)
3940 * examine the clone prototype, and if contains only a single
3941 * OP_CONST referencing a pad const, or a single PADSV referencing
3942 * an outer lexical, return a non-zero value to indicate the CV is
3943 * a candidate for "constizing" at clone time
3947 * We have just cloned an anon prototype that was marked as a const
3948 * candidiate. Try to grab the current value, and in the case of
3949 * PADSV, ignore it if it has multiple references. Return the value.
3953 Perl_op_const_sv(pTHX_ OP *o, CV *cv)
3960 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
3961 o = cLISTOPo->op_first->op_sibling;
3963 for (; o; o = o->op_next) {
3964 OPCODE type = o->op_type;
3966 if (sv && o->op_next == o)
3968 if (o->op_next != o) {
3969 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
3971 if (type == OP_DBSTATE)
3974 if (type == OP_LEAVESUB || type == OP_RETURN)
3978 if (type == OP_CONST && cSVOPo->op_sv)
3980 else if (cv && type == OP_CONST) {
3981 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
3985 else if (cv && type == OP_PADSV) {
3986 if (CvCONST(cv)) { /* newly cloned anon */
3987 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
3988 /* the candidate should have 1 ref from this pad and 1 ref
3989 * from the parent */
3990 if (!sv || SvREFCNT(sv) != 2)
3997 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
3998 sv = &PL_sv_undef; /* an arbitrary non-null value */
4009 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4019 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
4023 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
4025 return Perl_newATTRSUB(aTHX_ floor, o, proto, Nullop, block);
4029 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
4035 char *ps = proto ? SvPVx(((SVOP*)proto)->op_sv, n_a) : Nullch;
4039 name = o ? SvPVx(cSVOPo->op_sv, n_a) : Nullch;
4040 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
4041 SV *sv = sv_newmortal();
4042 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
4043 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
4044 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
4049 gv = gv_fetchpv(name ? name : (aname ? aname :
4050 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__")),
4051 GV_ADDMULTI | ((block || attrs) ? 0 : GV_NOINIT),
4061 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
4062 maximum a prototype before. */
4063 if (SvTYPE(gv) > SVt_NULL) {
4064 if (!SvPOK((SV*)gv) && !(SvIOK((SV*)gv) && SvIVX((SV*)gv) == -1)
4065 && ckWARN_d(WARN_PROTOTYPE))
4067 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
4069 cv_ckproto((CV*)gv, NULL, ps);
4072 sv_setpv((SV*)gv, ps);
4074 sv_setiv((SV*)gv, -1);
4075 SvREFCNT_dec(PL_compcv);
4076 cv = PL_compcv = NULL;
4077 PL_sub_generation++;
4081 cv = (!name || GvCVGEN(gv)) ? Nullcv : GvCV(gv);
4083 #ifdef GV_UNIQUE_CHECK
4084 if (cv && GvUNIQUE(gv) && SvREADONLY(cv)) {
4085 Perl_croak(aTHX_ "Can't define subroutine %s (GV is unique)", name);
4089 if (!block || !ps || *ps || attrs)
4092 const_sv = op_const_sv(block, Nullcv);
4095 bool exists = CvROOT(cv) || CvXSUB(cv);
4097 #ifdef GV_UNIQUE_CHECK
4098 if (exists && GvUNIQUE(gv)) {
4099 Perl_croak(aTHX_ "Can't redefine unique subroutine %s", name);
4103 /* if the subroutine doesn't exist and wasn't pre-declared
4104 * with a prototype, assume it will be AUTOLOADed,
4105 * skipping the prototype check
4107 if (exists || SvPOK(cv))
4108 cv_ckproto(cv, gv, ps);
4109 /* already defined (or promised)? */
4110 if (exists || GvASSUMECV(gv)) {
4111 if (!block && !attrs) {
4112 if (CvFLAGS(PL_compcv)) {
4113 /* might have had built-in attrs applied */
4114 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4116 /* just a "sub foo;" when &foo is already defined */
4117 SAVEFREESV(PL_compcv);
4120 /* ahem, death to those who redefine active sort subs */
4121 if (PL_curstackinfo->si_type == PERLSI_SORT && PL_sortcop == CvSTART(cv))
4122 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s", name);
4124 if (ckWARN(WARN_REDEFINE)
4126 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
4128 line_t oldline = CopLINE(PL_curcop);
4129 if (PL_copline != NOLINE)
4130 CopLINE_set(PL_curcop, PL_copline);
4131 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4132 CvCONST(cv) ? "Constant subroutine %s redefined"
4133 : "Subroutine %s redefined", name);
4134 CopLINE_set(PL_curcop, oldline);
4142 SvREFCNT_inc(const_sv);
4144 assert(!CvROOT(cv) && !CvCONST(cv));
4145 sv_setpv((SV*)cv, ""); /* prototype is "" */
4146 CvXSUBANY(cv).any_ptr = const_sv;
4147 CvXSUB(cv) = const_sv_xsub;
4152 cv = newCONSTSUB(NULL, name, const_sv);
4155 SvREFCNT_dec(PL_compcv);
4157 PL_sub_generation++;
4164 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
4165 * before we clobber PL_compcv.
4169 /* Might have had built-in attributes applied -- propagate them. */
4170 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
4171 if (CvGV(cv) && GvSTASH(CvGV(cv)))
4172 stash = GvSTASH(CvGV(cv));
4173 else if (CvSTASH(cv))
4174 stash = CvSTASH(cv);
4176 stash = PL_curstash;
4179 /* possibly about to re-define existing subr -- ignore old cv */
4180 rcv = (SV*)PL_compcv;
4181 if (name && GvSTASH(gv))
4182 stash = GvSTASH(gv);
4184 stash = PL_curstash;
4186 apply_attrs(stash, rcv, attrs, FALSE);
4188 if (cv) { /* must reuse cv if autoloaded */
4190 /* got here with just attrs -- work done, so bug out */
4191 SAVEFREESV(PL_compcv);
4194 /* transfer PL_compcv to cv */
4196 CvFLAGS(cv) = CvFLAGS(PL_compcv);
4197 if (!CvWEAKOUTSIDE(cv))
4198 SvREFCNT_dec(CvOUTSIDE(cv));
4199 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
4200 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
4201 CvOUTSIDE(PL_compcv) = 0;
4202 CvPADLIST(cv) = CvPADLIST(PL_compcv);
4203 CvPADLIST(PL_compcv) = 0;
4204 /* inner references to PL_compcv must be fixed up ... */
4205 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
4206 /* ... before we throw it away */
4207 SvREFCNT_dec(PL_compcv);
4209 if (PERLDB_INTER)/* Advice debugger on the new sub. */
4210 ++PL_sub_generation;
4217 PL_sub_generation++;
4221 CvFILE_set_from_cop(cv, PL_curcop);
4222 CvSTASH(cv) = PL_curstash;
4225 sv_setpv((SV*)cv, ps);
4227 if (PL_error_count) {
4231 char *s = strrchr(name, ':');
4233 if (strEQ(s, "BEGIN")) {
4235 "BEGIN not safe after errors--compilation aborted";
4236 if (PL_in_eval & EVAL_KEEPERR)
4237 Perl_croak(aTHX_ not_safe);
4239 /* force display of errors found but not reported */
4240 sv_catpv(ERRSV, not_safe);
4241 Perl_croak(aTHX_ "%"SVf, ERRSV);
4250 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
4251 mod(scalarseq(block), OP_LEAVESUBLV));
4254 /* This makes sub {}; work as expected. */
4255 if (block->op_type == OP_STUB) {
4257 block = newSTATEOP(0, Nullch, 0);
4259 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
4261 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4262 OpREFCNT_set(CvROOT(cv), 1);
4263 CvSTART(cv) = LINKLIST(CvROOT(cv));
4264 CvROOT(cv)->op_next = 0;
4265 CALL_PEEP(CvSTART(cv));
4267 /* now that optimizer has done its work, adjust pad values */
4269 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
4272 assert(!CvCONST(cv));
4273 if (ps && !*ps && op_const_sv(block, cv))
4277 if (name || aname) {
4279 char *tname = (name ? name : aname);
4281 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
4282 SV *sv = NEWSV(0,0);
4283 SV *tmpstr = sv_newmortal();
4284 GV *db_postponed = gv_fetchpv("DB::postponed", GV_ADDMULTI, SVt_PVHV);
4288 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
4290 (long)PL_subline, (long)CopLINE(PL_curcop));
4291 gv_efullname3(tmpstr, gv, Nullch);
4292 hv_store(GvHV(PL_DBsub), SvPVX(tmpstr), SvCUR(tmpstr), sv, 0);
4293 hv = GvHVn(db_postponed);
4294 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX(tmpstr), SvCUR(tmpstr))
4295 && (pcv = GvCV(db_postponed)))
4301 call_sv((SV*)pcv, G_DISCARD);
4305 if ((s = strrchr(tname,':')))
4310 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4313 if (strEQ(s, "BEGIN") && !PL_error_count) {
4314 I32 oldscope = PL_scopestack_ix;
4316 SAVECOPFILE(&PL_compiling);
4317 SAVECOPLINE(&PL_compiling);
4320 PL_beginav = newAV();
4321 DEBUG_x( dump_sub(gv) );
4322 av_push(PL_beginav, (SV*)cv);
4323 GvCV(gv) = 0; /* cv has been hijacked */
4324 call_list(oldscope, PL_beginav);
4326 PL_curcop = &PL_compiling;
4327 PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
4330 else if (strEQ(s, "END") && !PL_error_count) {
4333 DEBUG_x( dump_sub(gv) );
4334 av_unshift(PL_endav, 1);
4335 av_store(PL_endav, 0, (SV*)cv);
4336 GvCV(gv) = 0; /* cv has been hijacked */
4338 else if (strEQ(s, "CHECK") && !PL_error_count) {
4340 PL_checkav = newAV();
4341 DEBUG_x( dump_sub(gv) );
4342 if (PL_main_start && ckWARN(WARN_VOID))
4343 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
4344 av_unshift(PL_checkav, 1);
4345 av_store(PL_checkav, 0, (SV*)cv);
4346 GvCV(gv) = 0; /* cv has been hijacked */
4348 else if (strEQ(s, "INIT") && !PL_error_count) {
4350 PL_initav = newAV();
4351 DEBUG_x( dump_sub(gv) );
4352 if (PL_main_start && ckWARN(WARN_VOID))
4353 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
4354 av_push(PL_initav, (SV*)cv);
4355 GvCV(gv) = 0; /* cv has been hijacked */
4360 PL_copline = NOLINE;
4365 /* XXX unsafe for threads if eval_owner isn't held */
4367 =for apidoc newCONSTSUB
4369 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
4370 eligible for inlining at compile-time.
4376 Perl_newCONSTSUB(pTHX_ HV *stash, char *name, SV *sv)
4382 SAVECOPLINE(PL_curcop);
4383 CopLINE_set(PL_curcop, PL_copline);
4386 PL_hints &= ~HINT_BLOCK_SCOPE;
4389 SAVESPTR(PL_curstash);
4390 SAVECOPSTASH(PL_curcop);
4391 PL_curstash = stash;
4392 CopSTASH_set(PL_curcop,stash);
4395 cv = newXS(name, const_sv_xsub, savepv(CopFILE(PL_curcop)));
4396 CvXSUBANY(cv).any_ptr = sv;
4398 sv_setpv((SV*)cv, ""); /* prototype is "" */
4401 CopSTASH_free(PL_curcop);
4409 =for apidoc U||newXS
4411 Used by C<xsubpp> to hook up XSUBs as Perl subs.
4417 Perl_newXS(pTHX_ char *name, XSUBADDR_t subaddr, char *filename)
4419 GV *gv = gv_fetchpv(name ? name :
4420 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
4421 GV_ADDMULTI, SVt_PVCV);
4425 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
4427 if ((cv = (name ? GvCV(gv) : Nullcv))) {
4429 /* just a cached method */
4433 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
4434 /* already defined (or promised) */
4435 if (ckWARN(WARN_REDEFINE) && !(CvGV(cv) && GvSTASH(CvGV(cv))
4436 && strEQ(HvNAME(GvSTASH(CvGV(cv))), "autouse"))) {
4437 line_t oldline = CopLINE(PL_curcop);
4438 if (PL_copline != NOLINE)
4439 CopLINE_set(PL_curcop, PL_copline);
4440 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4441 CvCONST(cv) ? "Constant subroutine %s redefined"
4442 : "Subroutine %s redefined"
4444 CopLINE_set(PL_curcop, oldline);
4451 if (cv) /* must reuse cv if autoloaded */
4454 cv = (CV*)NEWSV(1105,0);
4455 sv_upgrade((SV *)cv, SVt_PVCV);
4459 PL_sub_generation++;
4463 (void)gv_fetchfile(filename);
4464 CvFILE(cv) = filename; /* NOTE: not copied, as it is expected to be
4465 an external constant string */
4466 CvXSUB(cv) = subaddr;
4469 char *s = strrchr(name,':');
4475 if (*s != 'B' && *s != 'E' && *s != 'C' && *s != 'I')
4478 if (strEQ(s, "BEGIN")) {
4480 PL_beginav = newAV();
4481 av_push(PL_beginav, (SV*)cv);
4482 GvCV(gv) = 0; /* cv has been hijacked */
4484 else if (strEQ(s, "END")) {
4487 av_unshift(PL_endav, 1);
4488 av_store(PL_endav, 0, (SV*)cv);
4489 GvCV(gv) = 0; /* cv has been hijacked */
4491 else if (strEQ(s, "CHECK")) {
4493 PL_checkav = newAV();
4494 if (PL_main_start && ckWARN(WARN_VOID))
4495 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run CHECK block");
4496 av_unshift(PL_checkav, 1);
4497 av_store(PL_checkav, 0, (SV*)cv);
4498 GvCV(gv) = 0; /* cv has been hijacked */
4500 else if (strEQ(s, "INIT")) {
4502 PL_initav = newAV();
4503 if (PL_main_start && ckWARN(WARN_VOID))
4504 Perl_warner(aTHX_ packWARN(WARN_VOID), "Too late to run INIT block");
4505 av_push(PL_initav, (SV*)cv);
4506 GvCV(gv) = 0; /* cv has been hijacked */
4517 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
4525 name = SvPVx(cSVOPo->op_sv, n_a);
4528 gv = gv_fetchpv(name,TRUE, SVt_PVFM);
4529 #ifdef GV_UNIQUE_CHECK
4531 Perl_croak(aTHX_ "Bad symbol for form (GV is unique)");
4535 if ((cv = GvFORM(gv))) {
4536 if (ckWARN(WARN_REDEFINE)) {
4537 line_t oldline = CopLINE(PL_curcop);
4538 if (PL_copline != NOLINE)
4539 CopLINE_set(PL_curcop, PL_copline);
4540 Perl_warner(aTHX_ packWARN(WARN_REDEFINE), "Format %s redefined",name);
4541 CopLINE_set(PL_curcop, oldline);
4548 CvFILE_set_from_cop(cv, PL_curcop);
4551 pad_tidy(padtidy_FORMAT);
4552 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
4553 CvROOT(cv)->op_private |= OPpREFCOUNTED;
4554 OpREFCNT_set(CvROOT(cv), 1);
4555 CvSTART(cv) = LINKLIST(CvROOT(cv));
4556 CvROOT(cv)->op_next = 0;
4557 CALL_PEEP(CvSTART(cv));
4559 PL_copline = NOLINE;
4564 Perl_newANONLIST(pTHX_ OP *o)
4566 return newUNOP(OP_REFGEN, 0,
4567 mod(list(convert(OP_ANONLIST, 0, o)), OP_REFGEN));
4571 Perl_newANONHASH(pTHX_ OP *o)
4573 return newUNOP(OP_REFGEN, 0,
4574 mod(list(convert(OP_ANONHASH, 0, o)), OP_REFGEN));
4578 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
4580 return newANONATTRSUB(floor, proto, Nullop, block);
4584 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
4586 return newUNOP(OP_REFGEN, 0,
4587 newSVOP(OP_ANONCODE, 0,
4588 (SV*)newATTRSUB(floor, 0, proto, attrs, block)));
4592 Perl_oopsAV(pTHX_ OP *o)
4594 switch (o->op_type) {
4596 o->op_type = OP_PADAV;
4597 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4598 return ref(o, OP_RV2AV);
4601 o->op_type = OP_RV2AV;
4602 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
4607 if (ckWARN_d(WARN_INTERNAL))
4608 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
4615 Perl_oopsHV(pTHX_ OP *o)
4617 switch (o->op_type) {
4620 o->op_type = OP_PADHV;
4621 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4622 return ref(o, OP_RV2HV);
4626 o->op_type = OP_RV2HV;
4627 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
4632 if (ckWARN_d(WARN_INTERNAL))
4633 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
4640 Perl_newAVREF(pTHX_ OP *o)
4642 if (o->op_type == OP_PADANY) {
4643 o->op_type = OP_PADAV;
4644 o->op_ppaddr = PL_ppaddr[OP_PADAV];
4647 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
4648 && ckWARN(WARN_DEPRECATED)) {
4649 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4650 "Using an array as a reference is deprecated");
4652 return newUNOP(OP_RV2AV, 0, scalar(o));
4656 Perl_newGVREF(pTHX_ I32 type, OP *o)
4658 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
4659 return newUNOP(OP_NULL, 0, o);
4660 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
4664 Perl_newHVREF(pTHX_ OP *o)
4666 if (o->op_type == OP_PADANY) {
4667 o->op_type = OP_PADHV;
4668 o->op_ppaddr = PL_ppaddr[OP_PADHV];
4671 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
4672 && ckWARN(WARN_DEPRECATED)) {
4673 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4674 "Using a hash as a reference is deprecated");
4676 return newUNOP(OP_RV2HV, 0, scalar(o));
4680 Perl_oopsCV(pTHX_ OP *o)
4682 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
4688 Perl_newCVREF(pTHX_ I32 flags, OP *o)
4690 return newUNOP(OP_RV2CV, flags, scalar(o));
4694 Perl_newSVREF(pTHX_ OP *o)
4696 if (o->op_type == OP_PADANY) {
4697 o->op_type = OP_PADSV;
4698 o->op_ppaddr = PL_ppaddr[OP_PADSV];
4701 else if (o->op_type == OP_THREADSV && !(o->op_flags & OPpDONE_SVREF)) {
4702 o->op_flags |= OPpDONE_SVREF;
4705 return newUNOP(OP_RV2SV, 0, scalar(o));
4708 /* Check routines. */
4711 Perl_ck_anoncode(pTHX_ OP *o)
4713 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
4714 cSVOPo->op_sv = Nullsv;
4719 Perl_ck_bitop(pTHX_ OP *o)
4721 #define OP_IS_NUMCOMPARE(op) \
4722 ((op) == OP_LT || (op) == OP_I_LT || \
4723 (op) == OP_GT || (op) == OP_I_GT || \
4724 (op) == OP_LE || (op) == OP_I_LE || \
4725 (op) == OP_GE || (op) == OP_I_GE || \
4726 (op) == OP_EQ || (op) == OP_I_EQ || \
4727 (op) == OP_NE || (op) == OP_I_NE || \
4728 (op) == OP_NCMP || (op) == OP_I_NCMP)
4729 o->op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
4730 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
4731 && (o->op_type == OP_BIT_OR
4732 || o->op_type == OP_BIT_AND
4733 || o->op_type == OP_BIT_XOR))
4735 OP * left = cBINOPo->op_first;
4736 OP * right = left->op_sibling;
4737 if ((OP_IS_NUMCOMPARE(left->op_type) &&
4738 (left->op_flags & OPf_PARENS) == 0) ||
4739 (OP_IS_NUMCOMPARE(right->op_type) &&
4740 (right->op_flags & OPf_PARENS) == 0))
4741 if (ckWARN(WARN_PRECEDENCE))
4742 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
4743 "Possible precedence problem on bitwise %c operator",
4744 o->op_type == OP_BIT_OR ? '|'
4745 : o->op_type == OP_BIT_AND ? '&' : '^'
4752 Perl_ck_concat(pTHX_ OP *o)
4754 OP *kid = cUNOPo->op_first;
4755 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
4756 !(kUNOP->op_first->op_flags & OPf_MOD))
4757 o->op_flags |= OPf_STACKED;
4762 Perl_ck_spair(pTHX_ OP *o)
4764 if (o->op_flags & OPf_KIDS) {
4767 OPCODE type = o->op_type;
4768 o = modkids(ck_fun(o), type);
4769 kid = cUNOPo->op_first;
4770 newop = kUNOP->op_first->op_sibling;
4772 (newop->op_sibling ||
4773 !(PL_opargs[newop->op_type] & OA_RETSCALAR) ||
4774 newop->op_type == OP_PADAV || newop->op_type == OP_PADHV ||
4775 newop->op_type == OP_RV2AV || newop->op_type == OP_RV2HV)) {
4779 op_free(kUNOP->op_first);
4780 kUNOP->op_first = newop;
4782 o->op_ppaddr = PL_ppaddr[++o->op_type];
4787 Perl_ck_delete(pTHX_ OP *o)
4791 if (o->op_flags & OPf_KIDS) {
4792 OP *kid = cUNOPo->op_first;
4793 switch (kid->op_type) {
4795 o->op_flags |= OPf_SPECIAL;
4798 o->op_private |= OPpSLICE;
4801 o->op_flags |= OPf_SPECIAL;
4806 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
4815 Perl_ck_die(pTHX_ OP *o)
4818 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
4824 Perl_ck_eof(pTHX_ OP *o)
4826 I32 type = o->op_type;
4828 if (o->op_flags & OPf_KIDS) {
4829 if (cLISTOPo->op_first->op_type == OP_STUB) {
4831 o = newUNOP(type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
4839 Perl_ck_eval(pTHX_ OP *o)
4841 PL_hints |= HINT_BLOCK_SCOPE;
4842 if (o->op_flags & OPf_KIDS) {
4843 SVOP *kid = (SVOP*)cUNOPo->op_first;
4846 o->op_flags &= ~OPf_KIDS;
4849 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
4852 cUNOPo->op_first = 0;
4855 NewOp(1101, enter, 1, LOGOP);
4856 enter->op_type = OP_ENTERTRY;
4857 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
4858 enter->op_private = 0;
4860 /* establish postfix order */
4861 enter->op_next = (OP*)enter;
4863 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
4864 o->op_type = OP_LEAVETRY;
4865 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
4866 enter->op_other = o;
4876 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
4878 o->op_targ = (PADOFFSET)PL_hints;
4883 Perl_ck_exit(pTHX_ OP *o)
4886 HV *table = GvHV(PL_hintgv);
4888 SV **svp = hv_fetch(table, "vmsish_exit", 11, FALSE);
4889 if (svp && *svp && SvTRUE(*svp))
4890 o->op_private |= OPpEXIT_VMSISH;
4892 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
4898 Perl_ck_exec(pTHX_ OP *o)
4901 if (o->op_flags & OPf_STACKED) {
4903 kid = cUNOPo->op_first->op_sibling;
4904 if (kid->op_type == OP_RV2GV)
4913 Perl_ck_exists(pTHX_ OP *o)
4916 if (o->op_flags & OPf_KIDS) {
4917 OP *kid = cUNOPo->op_first;
4918 if (kid->op_type == OP_ENTERSUB) {
4919 (void) ref(kid, o->op_type);
4920 if (kid->op_type != OP_RV2CV && !PL_error_count)
4921 Perl_croak(aTHX_ "%s argument is not a subroutine name",
4923 o->op_private |= OPpEXISTS_SUB;
4925 else if (kid->op_type == OP_AELEM)
4926 o->op_flags |= OPf_SPECIAL;
4927 else if (kid->op_type != OP_HELEM)
4928 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element",
4937 Perl_ck_gvconst(pTHX_ register OP *o)
4939 o = fold_constants(o);
4940 if (o->op_type == OP_CONST)
4947 Perl_ck_rvconst(pTHX_ register OP *o)
4949 SVOP *kid = (SVOP*)cUNOPo->op_first;
4951 o->op_private |= (PL_hints & HINT_STRICT_REFS);
4952 if (kid->op_type == OP_CONST) {
4956 SV *kidsv = kid->op_sv;
4959 /* Is it a constant from cv_const_sv()? */
4960 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
4961 SV *rsv = SvRV(kidsv);
4962 int svtype = SvTYPE(rsv);
4963 char *badtype = Nullch;
4965 switch (o->op_type) {
4967 if (svtype > SVt_PVMG)
4968 badtype = "a SCALAR";
4971 if (svtype != SVt_PVAV)
4972 badtype = "an ARRAY";
4975 if (svtype != SVt_PVHV)
4979 if (svtype != SVt_PVCV)
4984 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
4987 name = SvPV(kidsv, n_a);
4988 if ((PL_hints & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
4989 char *badthing = Nullch;
4990 switch (o->op_type) {
4992 badthing = "a SCALAR";
4995 badthing = "an ARRAY";
4998 badthing = "a HASH";
5003 "Can't use bareword (\"%s\") as %s ref while \"strict refs\" in use",
5007 * This is a little tricky. We only want to add the symbol if we
5008 * didn't add it in the lexer. Otherwise we get duplicate strict
5009 * warnings. But if we didn't add it in the lexer, we must at
5010 * least pretend like we wanted to add it even if it existed before,
5011 * or we get possible typo warnings. OPpCONST_ENTERED says
5012 * whether the lexer already added THIS instance of this symbol.
5014 iscv = (o->op_type == OP_RV2CV) * 2;
5016 gv = gv_fetchpv(name,
5017 iscv | !(kid->op_private & OPpCONST_ENTERED),
5020 : o->op_type == OP_RV2SV
5022 : o->op_type == OP_RV2AV
5024 : o->op_type == OP_RV2HV
5027 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
5029 kid->op_type = OP_GV;
5030 SvREFCNT_dec(kid->op_sv);
5032 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
5033 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
5034 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
5036 PAD_SETSV(kPADOP->op_padix, (SV*) SvREFCNT_inc(gv));
5038 kid->op_sv = SvREFCNT_inc(gv);
5040 kid->op_private = 0;
5041 kid->op_ppaddr = PL_ppaddr[OP_GV];
5048 Perl_ck_ftst(pTHX_ OP *o)
5050 I32 type = o->op_type;
5052 if (o->op_flags & OPf_REF) {
5055 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
5056 SVOP *kid = (SVOP*)cUNOPo->op_first;
5058 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5060 OP *newop = newGVOP(type, OPf_REF,
5061 gv_fetchpv(SvPVx(kid->op_sv, n_a), TRUE, SVt_PVIO));
5066 if ((PL_hints & HINT_FILETEST_ACCESS) &&
5067 OP_IS_FILETEST_ACCESS(o))
5068 o->op_private |= OPpFT_ACCESS;
5070 if (PL_check[kid->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst)
5071 && kid->op_type != OP_STAT && kid->op_type != OP_LSTAT)
5072 o->op_private |= OPpFT_STACKED;
5076 if (type == OP_FTTTY)
5077 o = newGVOP(type, OPf_REF, PL_stdingv);
5079 o = newUNOP(type, 0, newDEFSVOP());
5085 Perl_ck_fun(pTHX_ OP *o)
5091 int type = o->op_type;
5092 register I32 oa = PL_opargs[type] >> OASHIFT;
5094 if (o->op_flags & OPf_STACKED) {
5095 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
5098 return no_fh_allowed(o);
5101 if (o->op_flags & OPf_KIDS) {
5103 tokid = &cLISTOPo->op_first;
5104 kid = cLISTOPo->op_first;
5105 if (kid->op_type == OP_PUSHMARK ||
5106 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
5108 tokid = &kid->op_sibling;
5109 kid = kid->op_sibling;
5111 if (!kid && PL_opargs[type] & OA_DEFGV)
5112 *tokid = kid = newDEFSVOP();
5116 sibl = kid->op_sibling;
5119 /* list seen where single (scalar) arg expected? */
5120 if (numargs == 1 && !(oa >> 4)
5121 && kid->op_type == OP_LIST && type != OP_SCALAR)
5123 return too_many_arguments(o,PL_op_desc[type]);
5136 if ((type == OP_PUSH || type == OP_UNSHIFT)
5137 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
5138 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5139 "Useless use of %s with no values",
5142 if (kid->op_type == OP_CONST &&
5143 (kid->op_private & OPpCONST_BARE))
5145 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5146 OP *newop = newAVREF(newGVOP(OP_GV, 0,
5147 gv_fetchpv(name, TRUE, SVt_PVAV) ));
5148 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5149 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5150 "Array @%s missing the @ in argument %"IVdf" of %s()",
5151 name, (IV)numargs, PL_op_desc[type]);
5154 kid->op_sibling = sibl;
5157 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
5158 bad_type(numargs, "array", PL_op_desc[type], kid);
5162 if (kid->op_type == OP_CONST &&
5163 (kid->op_private & OPpCONST_BARE))
5165 char *name = SvPVx(((SVOP*)kid)->op_sv, n_a);
5166 OP *newop = newHVREF(newGVOP(OP_GV, 0,
5167 gv_fetchpv(name, TRUE, SVt_PVHV) ));
5168 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
5169 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5170 "Hash %%%s missing the %% in argument %"IVdf" of %s()",
5171 name, (IV)numargs, PL_op_desc[type]);
5174 kid->op_sibling = sibl;
5177 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
5178 bad_type(numargs, "hash", PL_op_desc[type], kid);
5183 OP *newop = newUNOP(OP_NULL, 0, kid);
5184 kid->op_sibling = 0;
5186 newop->op_next = newop;
5188 kid->op_sibling = sibl;
5193 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
5194 if (kid->op_type == OP_CONST &&
5195 (kid->op_private & OPpCONST_BARE))
5197 OP *newop = newGVOP(OP_GV, 0,
5198 gv_fetchpv(SvPVx(((SVOP*)kid)->op_sv, n_a), TRUE,
5200 if (!(o->op_private & 1) && /* if not unop */
5201 kid == cLISTOPo->op_last)
5202 cLISTOPo->op_last = newop;
5206 else if (kid->op_type == OP_READLINE) {
5207 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
5208 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
5211 I32 flags = OPf_SPECIAL;
5215 /* is this op a FH constructor? */
5216 if (is_handle_constructor(o,numargs)) {
5217 char *name = Nullch;
5221 /* Set a flag to tell rv2gv to vivify
5222 * need to "prove" flag does not mean something
5223 * else already - NI-S 1999/05/07
5226 if (kid->op_type == OP_PADSV) {
5227 name = PAD_COMPNAME_PV(kid->op_targ);
5228 /* SvCUR of a pad namesv can't be trusted
5229 * (see PL_generation), so calc its length
5235 else if (kid->op_type == OP_RV2SV
5236 && kUNOP->op_first->op_type == OP_GV)
5238 GV *gv = cGVOPx_gv(kUNOP->op_first);
5240 len = GvNAMELEN(gv);
5242 else if (kid->op_type == OP_AELEM
5243 || kid->op_type == OP_HELEM)
5248 if ((op = ((BINOP*)kid)->op_first)) {
5249 SV *tmpstr = Nullsv;
5251 kid->op_type == OP_AELEM ?
5253 if (((op->op_type == OP_RV2AV) ||
5254 (op->op_type == OP_RV2HV)) &&
5255 (op = ((UNOP*)op)->op_first) &&
5256 (op->op_type == OP_GV)) {
5257 /* packagevar $a[] or $h{} */
5258 GV *gv = cGVOPx_gv(op);
5266 else if (op->op_type == OP_PADAV
5267 || op->op_type == OP_PADHV) {
5268 /* lexicalvar $a[] or $h{} */
5270 PAD_COMPNAME_PV(op->op_targ);
5280 name = SvPV(tmpstr, len);
5285 name = "__ANONIO__";
5292 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
5293 namesv = PAD_SVl(targ);
5294 (void)SvUPGRADE(namesv, SVt_PV);
5296 sv_setpvn(namesv, "$", 1);
5297 sv_catpvn(namesv, name, len);
5300 kid->op_sibling = 0;
5301 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
5302 kid->op_targ = targ;
5303 kid->op_private |= priv;
5305 kid->op_sibling = sibl;
5311 mod(scalar(kid), type);
5315 tokid = &kid->op_sibling;
5316 kid = kid->op_sibling;
5318 o->op_private |= numargs;
5320 return too_many_arguments(o,OP_DESC(o));
5323 else if (PL_opargs[type] & OA_DEFGV) {
5325 return newUNOP(type, 0, newDEFSVOP());
5329 while (oa & OA_OPTIONAL)
5331 if (oa && oa != OA_LIST)
5332 return too_few_arguments(o,OP_DESC(o));
5338 Perl_ck_glob(pTHX_ OP *o)
5343 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
5344 append_elem(OP_GLOB, o, newDEFSVOP());
5346 if (!((gv = gv_fetchpv("glob", FALSE, SVt_PVCV))
5347 && GvCVu(gv) && GvIMPORTED_CV(gv)))
5349 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5352 #if !defined(PERL_EXTERNAL_GLOB)
5353 /* XXX this can be tightened up and made more failsafe. */
5354 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5357 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
5358 newSVpvn("File::Glob", 10), Nullsv, Nullsv, Nullsv);
5359 gv = gv_fetchpv("CORE::GLOBAL::glob", FALSE, SVt_PVCV);
5360 glob_gv = gv_fetchpv("File::Glob::csh_glob", FALSE, SVt_PVCV);
5361 GvCV(gv) = GvCV(glob_gv);
5362 SvREFCNT_inc((SV*)GvCV(gv));
5363 GvIMPORTED_CV_on(gv);
5366 #endif /* PERL_EXTERNAL_GLOB */
5368 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5369 append_elem(OP_GLOB, o,
5370 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
5371 o->op_type = OP_LIST;
5372 o->op_ppaddr = PL_ppaddr[OP_LIST];
5373 cLISTOPo->op_first->op_type = OP_PUSHMARK;
5374 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
5375 cLISTOPo->op_first->op_targ = 0;
5376 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
5377 append_elem(OP_LIST, o,
5378 scalar(newUNOP(OP_RV2CV, 0,
5379 newGVOP(OP_GV, 0, gv)))));
5380 o = newUNOP(OP_NULL, 0, ck_subr(o));
5381 o->op_targ = OP_GLOB; /* hint at what it used to be */
5384 gv = newGVgen("main");
5386 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
5392 Perl_ck_grep(pTHX_ OP *o)
5396 OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
5399 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
5400 NewOp(1101, gwop, 1, LOGOP);
5402 if (o->op_flags & OPf_STACKED) {
5405 kid = cLISTOPo->op_first->op_sibling;
5406 for (k = cLISTOPo->op_first->op_sibling->op_next; k; k = k->op_next) {
5409 kid->op_next = (OP*)gwop;
5410 o->op_flags &= ~OPf_STACKED;
5412 kid = cLISTOPo->op_first->op_sibling;
5413 if (type == OP_MAPWHILE)
5420 kid = cLISTOPo->op_first->op_sibling;
5421 if (kid->op_type != OP_NULL)
5422 Perl_croak(aTHX_ "panic: ck_grep");
5423 kid = kUNOP->op_first;
5425 gwop->op_type = type;
5426 gwop->op_ppaddr = PL_ppaddr[type];
5427 gwop->op_first = listkids(o);
5428 gwop->op_flags |= OPf_KIDS;
5429 gwop->op_other = LINKLIST(kid);
5430 kid->op_next = (OP*)gwop;
5431 offset = pad_findmy("$_");
5432 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS(offset) & SVpad_OUR) {
5433 o->op_private = gwop->op_private = 0;
5434 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
5437 o->op_private = gwop->op_private = OPpGREP_LEX;
5438 gwop->op_targ = o->op_targ = offset;
5441 kid = cLISTOPo->op_first->op_sibling;
5442 if (!kid || !kid->op_sibling)
5443 return too_few_arguments(o,OP_DESC(o));
5444 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
5445 mod(kid, OP_GREPSTART);
5451 Perl_ck_index(pTHX_ OP *o)
5453 if (o->op_flags & OPf_KIDS) {
5454 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5456 kid = kid->op_sibling; /* get past "big" */
5457 if (kid && kid->op_type == OP_CONST)
5458 fbm_compile(((SVOP*)kid)->op_sv, 0);
5464 Perl_ck_lengthconst(pTHX_ OP *o)
5466 /* XXX length optimization goes here */
5471 Perl_ck_lfun(pTHX_ OP *o)
5473 OPCODE type = o->op_type;
5474 return modkids(ck_fun(o), type);
5478 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
5480 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
5481 switch (cUNOPo->op_first->op_type) {
5483 /* This is needed for
5484 if (defined %stash::)
5485 to work. Do not break Tk.
5487 break; /* Globals via GV can be undef */
5489 case OP_AASSIGN: /* Is this a good idea? */
5490 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5491 "defined(@array) is deprecated");
5492 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5493 "\t(Maybe you should just omit the defined()?)\n");
5496 /* This is needed for
5497 if (defined %stash::)
5498 to work. Do not break Tk.
5500 break; /* Globals via GV can be undef */
5502 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5503 "defined(%%hash) is deprecated");
5504 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
5505 "\t(Maybe you should just omit the defined()?)\n");
5516 Perl_ck_rfun(pTHX_ OP *o)
5518 OPCODE type = o->op_type;
5519 return refkids(ck_fun(o), type);
5523 Perl_ck_listiob(pTHX_ OP *o)
5527 kid = cLISTOPo->op_first;
5530 kid = cLISTOPo->op_first;
5532 if (kid->op_type == OP_PUSHMARK)
5533 kid = kid->op_sibling;
5534 if (kid && o->op_flags & OPf_STACKED)
5535 kid = kid->op_sibling;
5536 else if (kid && !kid->op_sibling) { /* print HANDLE; */
5537 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
5538 o->op_flags |= OPf_STACKED; /* make it a filehandle */
5539 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
5540 cLISTOPo->op_first->op_sibling = kid;
5541 cLISTOPo->op_last = kid;
5542 kid = kid->op_sibling;
5547 append_elem(o->op_type, o, newDEFSVOP());
5553 Perl_ck_sassign(pTHX_ OP *o)
5555 OP *kid = cLISTOPo->op_first;
5556 /* has a disposable target? */
5557 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
5558 && !(kid->op_flags & OPf_STACKED)
5559 /* Cannot steal the second time! */
5560 && !(kid->op_private & OPpTARGET_MY))
5562 OP *kkid = kid->op_sibling;
5564 /* Can just relocate the target. */
5565 if (kkid && kkid->op_type == OP_PADSV
5566 && !(kkid->op_private & OPpLVAL_INTRO))
5568 kid->op_targ = kkid->op_targ;
5570 /* Now we do not need PADSV and SASSIGN. */
5571 kid->op_sibling = o->op_sibling; /* NULL */
5572 cLISTOPo->op_first = NULL;
5575 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
5583 Perl_ck_match(pTHX_ OP *o)
5585 if (o->op_type != OP_QR) {
5586 I32 offset = pad_findmy("$_");
5587 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS(offset) & SVpad_OUR)) {
5588 o->op_targ = offset;
5589 o->op_private |= OPpTARGET_MY;
5592 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
5593 o->op_private |= OPpRUNTIME;
5598 Perl_ck_method(pTHX_ OP *o)
5600 OP *kid = cUNOPo->op_first;
5601 if (kid->op_type == OP_CONST) {
5602 SV* sv = kSVOP->op_sv;
5603 if (!(strchr(SvPVX(sv), ':') || strchr(SvPVX(sv), '\''))) {
5605 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
5606 sv = newSVpvn_share(SvPVX(sv), SvCUR(sv), 0);
5609 kSVOP->op_sv = Nullsv;
5611 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
5620 Perl_ck_null(pTHX_ OP *o)
5626 Perl_ck_open(pTHX_ OP *o)
5628 HV *table = GvHV(PL_hintgv);
5632 svp = hv_fetch(table, "open_IN", 7, FALSE);
5634 mode = mode_from_discipline(*svp);
5635 if (mode & O_BINARY)
5636 o->op_private |= OPpOPEN_IN_RAW;
5637 else if (mode & O_TEXT)
5638 o->op_private |= OPpOPEN_IN_CRLF;
5641 svp = hv_fetch(table, "open_OUT", 8, FALSE);
5643 mode = mode_from_discipline(*svp);
5644 if (mode & O_BINARY)
5645 o->op_private |= OPpOPEN_OUT_RAW;
5646 else if (mode & O_TEXT)
5647 o->op_private |= OPpOPEN_OUT_CRLF;
5650 if (o->op_type == OP_BACKTICK)
5653 /* In case of three-arg dup open remove strictness
5654 * from the last arg if it is a bareword. */
5655 OP *first = cLISTOPx(o)->op_first; /* The pushmark. */
5656 OP *last = cLISTOPx(o)->op_last; /* The bareword. */
5660 if ((last->op_type == OP_CONST) && /* The bareword. */
5661 (last->op_private & OPpCONST_BARE) &&
5662 (last->op_private & OPpCONST_STRICT) &&
5663 (oa = first->op_sibling) && /* The fh. */
5664 (oa = oa->op_sibling) && /* The mode. */
5665 SvPOK(((SVOP*)oa)->op_sv) &&
5666 (mode = SvPVX(((SVOP*)oa)->op_sv)) &&
5667 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
5668 (last == oa->op_sibling)) /* The bareword. */
5669 last->op_private &= ~OPpCONST_STRICT;
5675 Perl_ck_repeat(pTHX_ OP *o)
5677 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
5678 o->op_private |= OPpREPEAT_DOLIST;
5679 cBINOPo->op_first = force_list(cBINOPo->op_first);
5687 Perl_ck_require(pTHX_ OP *o)
5691 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
5692 SVOP *kid = (SVOP*)cUNOPo->op_first;
5694 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
5696 for (s = SvPVX(kid->op_sv); *s; s++) {
5697 if (*s == ':' && s[1] == ':') {
5699 Move(s+2, s+1, strlen(s+2)+1, char);
5700 --SvCUR(kid->op_sv);
5703 if (SvREADONLY(kid->op_sv)) {
5704 SvREADONLY_off(kid->op_sv);
5705 sv_catpvn(kid->op_sv, ".pm", 3);
5706 SvREADONLY_on(kid->op_sv);
5709 sv_catpvn(kid->op_sv, ".pm", 3);
5713 /* handle override, if any */
5714 gv = gv_fetchpv("require", FALSE, SVt_PVCV);
5715 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv)))
5716 gv = gv_fetchpv("CORE::GLOBAL::require", FALSE, SVt_PVCV);
5718 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5719 OP *kid = cUNOPo->op_first;
5720 cUNOPo->op_first = 0;
5722 return ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
5723 append_elem(OP_LIST, kid,
5724 scalar(newUNOP(OP_RV2CV, 0,
5733 Perl_ck_return(pTHX_ OP *o)
5736 if (CvLVALUE(PL_compcv)) {
5737 for (kid = cLISTOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
5738 mod(kid, OP_LEAVESUBLV);
5745 Perl_ck_retarget(pTHX_ OP *o)
5747 Perl_croak(aTHX_ "NOT IMPL LINE %d",__LINE__);
5754 Perl_ck_select(pTHX_ OP *o)
5757 if (o->op_flags & OPf_KIDS) {
5758 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5759 if (kid && kid->op_sibling) {
5760 o->op_type = OP_SSELECT;
5761 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
5763 return fold_constants(o);
5767 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5768 if (kid && kid->op_type == OP_RV2GV)
5769 kid->op_private &= ~HINT_STRICT_REFS;
5774 Perl_ck_shift(pTHX_ OP *o)
5776 I32 type = o->op_type;
5778 if (!(o->op_flags & OPf_KIDS)) {
5782 argop = newUNOP(OP_RV2AV, 0,
5783 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
5784 return newUNOP(type, 0, scalar(argop));
5786 return scalar(modkids(ck_fun(o), type));
5790 Perl_ck_sort(pTHX_ OP *o)
5794 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
5796 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5797 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
5799 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
5801 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
5803 if (kid->op_type == OP_SCOPE) {
5807 else if (kid->op_type == OP_LEAVE) {
5808 if (o->op_type == OP_SORT) {
5809 op_null(kid); /* wipe out leave */
5812 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
5813 if (k->op_next == kid)
5815 /* don't descend into loops */
5816 else if (k->op_type == OP_ENTERLOOP
5817 || k->op_type == OP_ENTERITER)
5819 k = cLOOPx(k)->op_lastop;
5824 kid->op_next = 0; /* just disconnect the leave */
5825 k = kLISTOP->op_first;
5830 if (o->op_type == OP_SORT) {
5831 /* provide scalar context for comparison function/block */
5837 o->op_flags |= OPf_SPECIAL;
5839 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
5842 firstkid = firstkid->op_sibling;
5845 /* provide list context for arguments */
5846 if (o->op_type == OP_SORT)
5853 S_simplify_sort(pTHX_ OP *o)
5855 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
5859 if (!(o->op_flags & OPf_STACKED))
5861 GvMULTI_on(gv_fetchpv("a", TRUE, SVt_PV));
5862 GvMULTI_on(gv_fetchpv("b", TRUE, SVt_PV));
5863 kid = kUNOP->op_first; /* get past null */
5864 if (kid->op_type != OP_SCOPE)
5866 kid = kLISTOP->op_last; /* get past scope */
5867 switch(kid->op_type) {
5875 k = kid; /* remember this node*/
5876 if (kBINOP->op_first->op_type != OP_RV2SV)
5878 kid = kBINOP->op_first; /* get past cmp */
5879 if (kUNOP->op_first->op_type != OP_GV)
5881 kid = kUNOP->op_first; /* get past rv2sv */
5883 if (GvSTASH(gv) != PL_curstash)
5885 if (strEQ(GvNAME(gv), "a"))
5887 else if (strEQ(GvNAME(gv), "b"))
5891 kid = k; /* back to cmp */
5892 if (kBINOP->op_last->op_type != OP_RV2SV)
5894 kid = kBINOP->op_last; /* down to 2nd arg */
5895 if (kUNOP->op_first->op_type != OP_GV)
5897 kid = kUNOP->op_first; /* get past rv2sv */
5899 if (GvSTASH(gv) != PL_curstash
5901 ? strNE(GvNAME(gv), "a")
5902 : strNE(GvNAME(gv), "b")))
5904 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
5906 o->op_private |= OPpSORT_REVERSE;
5907 if (k->op_type == OP_NCMP)
5908 o->op_private |= OPpSORT_NUMERIC;
5909 if (k->op_type == OP_I_NCMP)
5910 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
5911 kid = cLISTOPo->op_first->op_sibling;
5912 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
5913 op_free(kid); /* then delete it */
5917 Perl_ck_split(pTHX_ OP *o)
5921 if (o->op_flags & OPf_STACKED)
5922 return no_fh_allowed(o);
5924 kid = cLISTOPo->op_first;
5925 if (kid->op_type != OP_NULL)
5926 Perl_croak(aTHX_ "panic: ck_split");
5927 kid = kid->op_sibling;
5928 op_free(cLISTOPo->op_first);
5929 cLISTOPo->op_first = kid;
5931 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvn(" ", 1));
5932 cLISTOPo->op_last = kid; /* There was only one element previously */
5935 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
5936 OP *sibl = kid->op_sibling;
5937 kid->op_sibling = 0;
5938 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, Nullop);
5939 if (cLISTOPo->op_first == cLISTOPo->op_last)
5940 cLISTOPo->op_last = kid;
5941 cLISTOPo->op_first = kid;
5942 kid->op_sibling = sibl;
5945 kid->op_type = OP_PUSHRE;
5946 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
5948 if (ckWARN(WARN_REGEXP) && ((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
5949 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
5950 "Use of /g modifier is meaningless in split");
5953 if (!kid->op_sibling)
5954 append_elem(OP_SPLIT, o, newDEFSVOP());
5956 kid = kid->op_sibling;
5959 if (!kid->op_sibling)
5960 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
5962 kid = kid->op_sibling;
5965 if (kid->op_sibling)
5966 return too_many_arguments(o,OP_DESC(o));
5972 Perl_ck_join(pTHX_ OP *o)
5974 if (ckWARN(WARN_SYNTAX)) {
5975 OP *kid = cLISTOPo->op_first->op_sibling;
5976 if (kid && kid->op_type == OP_MATCH) {
5977 char *pmstr = "STRING";
5978 if (PM_GETRE(kPMOP))
5979 pmstr = PM_GETRE(kPMOP)->precomp;
5980 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
5981 "/%s/ should probably be written as \"%s\"",
5989 Perl_ck_state(pTHX_ OP *o)
5991 /* warn on C<my $x=1 if foo;> , C<$a && my $x=1;> style statements */
5994 if (!o || o->op_type != OP_NULL || !(o->op_flags & OPf_KIDS))
5996 kid = cUNOPo->op_first;
5997 if (!(kid->op_type == OP_AND || kid->op_type == OP_OR))
5999 kid = kUNOP->op_first->op_sibling;
6000 if (kid->op_type == OP_SASSIGN)
6001 kid = kBINOP->op_first->op_sibling;
6002 else if (kid->op_type == OP_AASSIGN)
6003 kid = kBINOP->op_first->op_sibling;
6005 if (kid->op_type == OP_LIST
6006 || (kid->op_type == OP_NULL && kid->op_targ == OP_LIST))
6008 kid = kUNOP->op_first;
6009 if (kid->op_type == OP_PUSHMARK)
6010 kid = kid->op_sibling;
6012 if ((kid->op_type == OP_PADSV || kid->op_type == OP_PADAV
6013 || kid->op_type == OP_PADHV)
6014 && (kid->op_private & OPpLVAL_INTRO)
6015 && (ckWARN(WARN_DEPRECATED)))
6017 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6018 "Deprecated use of my() in conditional");
6025 Perl_ck_subr(pTHX_ OP *o)
6027 OP *prev = ((cUNOPo->op_first->op_sibling)
6028 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
6029 OP *o2 = prev->op_sibling;
6036 I32 contextclass = 0;
6041 o->op_private |= OPpENTERSUB_HASTARG;
6042 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
6043 if (cvop->op_type == OP_RV2CV) {
6045 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
6046 op_null(cvop); /* disable rv2cv */
6047 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
6048 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
6049 GV *gv = cGVOPx_gv(tmpop);
6052 tmpop->op_private |= OPpEARLY_CV;
6055 namegv = CvANON(cv) ? gv : CvGV(cv);
6056 proto = SvPV((SV*)cv, n_a);
6058 if (CvASSERTION(cv)) {
6059 if (PL_hints & HINT_ASSERTING) {
6060 if (PERLDB_ASSERTION && PL_curstash != PL_debstash)
6061 o->op_private |= OPpENTERSUB_DB;
6065 if (ckWARN(WARN_ASSERTIONS) && !(PL_hints & HINT_ASSERTIONSSEEN)) {
6066 Perl_warner(aTHX_ packWARN(WARN_ASSERTIONS),
6067 "Impossible to activate assertion call");
6074 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
6075 if (o2->op_type == OP_CONST)
6076 o2->op_private &= ~OPpCONST_STRICT;
6077 else if (o2->op_type == OP_LIST) {
6078 OP *o = ((UNOP*)o2)->op_first->op_sibling;
6079 if (o && o->op_type == OP_CONST)
6080 o->op_private &= ~OPpCONST_STRICT;
6083 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6084 if (PERLDB_SUB && PL_curstash != PL_debstash)
6085 o->op_private |= OPpENTERSUB_DB;
6086 while (o2 != cvop) {
6090 return too_many_arguments(o, gv_ename(namegv));
6108 if (o2->op_type != OP_REFGEN && o2->op_type != OP_UNDEF)
6110 arg == 1 ? "block or sub {}" : "sub {}",
6111 gv_ename(namegv), o2);
6114 /* '*' allows any scalar type, including bareword */
6117 if (o2->op_type == OP_RV2GV)
6118 goto wrapref; /* autoconvert GLOB -> GLOBref */
6119 else if (o2->op_type == OP_CONST)
6120 o2->op_private &= ~OPpCONST_STRICT;
6121 else if (o2->op_type == OP_ENTERSUB) {
6122 /* accidental subroutine, revert to bareword */
6123 OP *gvop = ((UNOP*)o2)->op_first;
6124 if (gvop && gvop->op_type == OP_NULL) {
6125 gvop = ((UNOP*)gvop)->op_first;
6127 for (; gvop->op_sibling; gvop = gvop->op_sibling)
6130 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
6131 (gvop = ((UNOP*)gvop)->op_first) &&
6132 gvop->op_type == OP_GV)
6134 GV *gv = cGVOPx_gv(gvop);
6135 OP *sibling = o2->op_sibling;
6136 SV *n = newSVpvn("",0);
6138 gv_fullname3(n, gv, "");
6139 if (SvCUR(n)>6 && strnEQ(SvPVX(n),"main::",6))
6140 sv_chop(n, SvPVX(n)+6);
6141 o2 = newSVOP(OP_CONST, 0, n);
6142 prev->op_sibling = o2;
6143 o2->op_sibling = sibling;
6159 if (contextclass++ == 0) {
6160 e = strchr(proto, ']');
6161 if (!e || e == proto)
6174 while (*--p != '[');
6175 bad_type(arg, Perl_form(aTHX_ "one of %s", p),
6176 gv_ename(namegv), o2);
6182 if (o2->op_type == OP_RV2GV)
6185 bad_type(arg, "symbol", gv_ename(namegv), o2);
6188 if (o2->op_type == OP_ENTERSUB)
6191 bad_type(arg, "subroutine entry", gv_ename(namegv), o2);
6194 if (o2->op_type == OP_RV2SV ||
6195 o2->op_type == OP_PADSV ||
6196 o2->op_type == OP_HELEM ||
6197 o2->op_type == OP_AELEM ||
6198 o2->op_type == OP_THREADSV)
6201 bad_type(arg, "scalar", gv_ename(namegv), o2);
6204 if (o2->op_type == OP_RV2AV ||
6205 o2->op_type == OP_PADAV)
6208 bad_type(arg, "array", gv_ename(namegv), o2);
6211 if (o2->op_type == OP_RV2HV ||
6212 o2->op_type == OP_PADHV)
6215 bad_type(arg, "hash", gv_ename(namegv), o2);
6220 OP* sib = kid->op_sibling;
6221 kid->op_sibling = 0;
6222 o2 = newUNOP(OP_REFGEN, 0, kid);
6223 o2->op_sibling = sib;
6224 prev->op_sibling = o2;
6226 if (contextclass && e) {
6241 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
6242 gv_ename(namegv), cv);
6247 mod(o2, OP_ENTERSUB);
6249 o2 = o2->op_sibling;
6251 if (proto && !optional &&
6252 (*proto && *proto != '@' && *proto != '%' && *proto != ';'))
6253 return too_few_arguments(o, gv_ename(namegv));
6256 o=newSVOP(OP_CONST, 0, newSViv(0));
6262 Perl_ck_svconst(pTHX_ OP *o)
6264 SvREADONLY_on(cSVOPo->op_sv);
6269 Perl_ck_trunc(pTHX_ OP *o)
6271 if (o->op_flags & OPf_KIDS) {
6272 SVOP *kid = (SVOP*)cUNOPo->op_first;
6274 if (kid->op_type == OP_NULL)
6275 kid = (SVOP*)kid->op_sibling;
6276 if (kid && kid->op_type == OP_CONST &&
6277 (kid->op_private & OPpCONST_BARE))
6279 o->op_flags |= OPf_SPECIAL;
6280 kid->op_private &= ~OPpCONST_STRICT;
6287 Perl_ck_unpack(pTHX_ OP *o)
6289 OP *kid = cLISTOPo->op_first;
6290 if (kid->op_sibling) {
6291 kid = kid->op_sibling;
6292 if (!kid->op_sibling)
6293 kid->op_sibling = newDEFSVOP();
6299 Perl_ck_substr(pTHX_ OP *o)
6302 if ((o->op_flags & OPf_KIDS) && o->op_private == 4) {
6303 OP *kid = cLISTOPo->op_first;
6305 if (kid->op_type == OP_NULL)
6306 kid = kid->op_sibling;
6308 kid->op_flags |= OPf_MOD;
6314 /* A peephole optimizer. We visit the ops in the order they're to execute. */
6317 Perl_peep(pTHX_ register OP *o)
6319 register OP* oldop = 0;
6321 if (!o || o->op_opt)
6325 SAVEVPTR(PL_curcop);
6326 for (; o; o = o->op_next) {
6330 switch (o->op_type) {
6334 PL_curcop = ((COP*)o); /* for warnings */
6339 if (cSVOPo->op_private & OPpCONST_STRICT)
6340 no_bareword_allowed(o);
6342 case OP_METHOD_NAMED:
6343 /* Relocate sv to the pad for thread safety.
6344 * Despite being a "constant", the SV is written to,
6345 * for reference counts, sv_upgrade() etc. */
6347 PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
6348 if (o->op_type == OP_CONST && SvPADTMP(cSVOPo->op_sv)) {
6349 /* If op_sv is already a PADTMP then it is being used by
6350 * some pad, so make a copy. */
6351 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
6352 SvREADONLY_on(PAD_SVl(ix));
6353 SvREFCNT_dec(cSVOPo->op_sv);
6356 SvREFCNT_dec(PAD_SVl(ix));
6357 SvPADTMP_on(cSVOPo->op_sv);
6358 PAD_SETSV(ix, cSVOPo->op_sv);
6359 /* XXX I don't know how this isn't readonly already. */
6360 SvREADONLY_on(PAD_SVl(ix));
6362 cSVOPo->op_sv = Nullsv;
6370 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
6371 if (o->op_next->op_private & OPpTARGET_MY) {
6372 if (o->op_flags & OPf_STACKED) /* chained concats */
6373 goto ignore_optimization;
6375 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
6376 o->op_targ = o->op_next->op_targ;
6377 o->op_next->op_targ = 0;
6378 o->op_private |= OPpTARGET_MY;
6381 op_null(o->op_next);
6383 ignore_optimization:
6387 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
6389 break; /* Scalar stub must produce undef. List stub is noop */
6393 if (o->op_targ == OP_NEXTSTATE
6394 || o->op_targ == OP_DBSTATE
6395 || o->op_targ == OP_SETSTATE)
6397 PL_curcop = ((COP*)o);
6399 /* XXX: We avoid setting op_seq here to prevent later calls
6400 to peep() from mistakenly concluding that optimisation
6401 has already occurred. This doesn't fix the real problem,
6402 though (See 20010220.007). AMS 20010719 */
6403 /* op_seq functionality is now replaced by op_opt */
6404 if (oldop && o->op_next) {
6405 oldop->op_next = o->op_next;
6413 if (oldop && o->op_next) {
6414 oldop->op_next = o->op_next;
6422 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
6423 OP* pop = (o->op_type == OP_PADAV) ?
6424 o->op_next : o->op_next->op_next;
6426 if (pop && pop->op_type == OP_CONST &&
6427 (PL_op = pop->op_next) &&
6428 pop->op_next->op_type == OP_AELEM &&
6429 !(pop->op_next->op_private &
6430 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
6431 (i = SvIV(((SVOP*)pop)->op_sv) - PL_curcop->cop_arybase)
6436 if (o->op_type == OP_GV)
6437 op_null(o->op_next);
6438 op_null(pop->op_next);
6440 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
6441 o->op_next = pop->op_next->op_next;
6442 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
6443 o->op_private = (U8)i;
6444 if (o->op_type == OP_GV) {
6449 o->op_flags |= OPf_SPECIAL;
6450 o->op_type = OP_AELEMFAST;
6456 if (o->op_next->op_type == OP_RV2SV) {
6457 if (!(o->op_next->op_private & OPpDEREF)) {
6458 op_null(o->op_next);
6459 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
6461 o->op_next = o->op_next->op_next;
6462 o->op_type = OP_GVSV;
6463 o->op_ppaddr = PL_ppaddr[OP_GVSV];
6466 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
6468 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX(GvCV(gv))) {
6469 /* XXX could check prototype here instead of just carping */
6470 SV *sv = sv_newmortal();
6471 gv_efullname3(sv, gv, Nullch);
6472 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
6473 "%"SVf"() called too early to check prototype",
6477 else if (o->op_next->op_type == OP_READLINE
6478 && o->op_next->op_next->op_type == OP_CONCAT
6479 && (o->op_next->op_next->op_flags & OPf_STACKED))
6481 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
6482 o->op_type = OP_RCATLINE;
6483 o->op_flags |= OPf_STACKED;
6484 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
6485 op_null(o->op_next->op_next);
6486 op_null(o->op_next);
6503 while (cLOGOP->op_other->op_type == OP_NULL)
6504 cLOGOP->op_other = cLOGOP->op_other->op_next;
6505 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
6511 while (cLOOP->op_redoop->op_type == OP_NULL)
6512 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
6513 peep(cLOOP->op_redoop);
6514 while (cLOOP->op_nextop->op_type == OP_NULL)
6515 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
6516 peep(cLOOP->op_nextop);
6517 while (cLOOP->op_lastop->op_type == OP_NULL)
6518 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
6519 peep(cLOOP->op_lastop);
6526 while (cPMOP->op_pmreplstart &&
6527 cPMOP->op_pmreplstart->op_type == OP_NULL)
6528 cPMOP->op_pmreplstart = cPMOP->op_pmreplstart->op_next;
6529 peep(cPMOP->op_pmreplstart);
6534 if (ckWARN(WARN_SYNTAX) && o->op_next
6535 && o->op_next->op_type == OP_NEXTSTATE) {
6536 if (o->op_next->op_sibling &&
6537 o->op_next->op_sibling->op_type != OP_EXIT &&
6538 o->op_next->op_sibling->op_type != OP_WARN &&
6539 o->op_next->op_sibling->op_type != OP_DIE) {
6540 line_t oldline = CopLINE(PL_curcop);
6542 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
6543 Perl_warner(aTHX_ packWARN(WARN_EXEC),
6544 "Statement unlikely to be reached");
6545 Perl_warner(aTHX_ packWARN(WARN_EXEC),
6546 "\t(Maybe you meant system() when you said exec()?)\n");
6547 CopLINE_set(PL_curcop, oldline);
6560 if (((BINOP*)o)->op_last->op_type != OP_CONST)
6563 /* Make the CONST have a shared SV */
6564 svp = cSVOPx_svp(((BINOP*)o)->op_last);
6565 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv)) && !IS_PADCONST(sv)) {
6566 key = SvPV(sv, keylen);
6567 lexname = newSVpvn_share(key,
6568 SvUTF8(sv) ? -(I32)keylen : keylen,
6577 /* make @a = sort @a act in-place */
6579 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
6585 /* check that RHS of sort is a single plain array */
6586 oright = cUNOPo->op_first;
6587 if (!oright || oright->op_type != OP_PUSHMARK)
6589 oright = cUNOPx(oright)->op_sibling;
6592 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
6593 oright = cUNOPx(oright)->op_sibling;
6597 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
6598 || oright->op_next != o
6599 || (oright->op_private & OPpLVAL_INTRO)
6603 /* o2 follows the chain of op_nexts through the LHS of the
6604 * assign (if any) to the aassign op itself */
6606 if (!o2 || o2->op_type != OP_NULL)
6609 if (!o2 || o2->op_type != OP_PUSHMARK)
6612 if (o2 && o2->op_type == OP_GV)
6615 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
6616 || (o2->op_private & OPpLVAL_INTRO)
6621 if (!o2 || o2->op_type != OP_NULL)
6624 if (!o2 || o2->op_type != OP_AASSIGN
6625 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
6628 /* check the array is the same on both sides */
6629 if (oleft->op_type == OP_RV2AV) {
6630 if (oright->op_type != OP_RV2AV
6631 || !cUNOPx(oright)->op_first
6632 || cUNOPx(oright)->op_first->op_type != OP_GV
6633 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
6634 cGVOPx_gv(cUNOPx(oright)->op_first)
6638 else if (oright->op_type != OP_PADAV
6639 || oright->op_targ != oleft->op_targ
6643 /* transfer MODishness etc from LHS arg to RHS arg */
6644 oright->op_flags = oleft->op_flags;
6645 o->op_private |= OPpSORT_INPLACE;
6647 /* excise push->gv->rv2av->null->aassign */
6648 o2 = o->op_next->op_next;
6649 op_null(o2); /* PUSHMARK */
6651 if (o2->op_type == OP_GV) {
6652 op_null(o2); /* GV */
6655 op_null(o2); /* RV2AV or PADAV */
6656 o2 = o2->op_next->op_next;
6657 op_null(o2); /* AASSIGN */
6659 o->op_next = o2->op_next;
6677 char* Perl_custom_op_name(pTHX_ OP* o)
6679 IV index = PTR2IV(o->op_ppaddr);
6683 if (!PL_custom_op_names) /* This probably shouldn't happen */
6684 return PL_op_name[OP_CUSTOM];
6686 keysv = sv_2mortal(newSViv(index));
6688 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
6690 return PL_op_name[OP_CUSTOM]; /* Don't know who you are */
6692 return SvPV_nolen(HeVAL(he));
6695 char* Perl_custom_op_desc(pTHX_ OP* o)
6697 IV index = PTR2IV(o->op_ppaddr);
6701 if (!PL_custom_op_descs)
6702 return PL_op_desc[OP_CUSTOM];
6704 keysv = sv_2mortal(newSViv(index));
6706 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
6708 return PL_op_desc[OP_CUSTOM];
6710 return SvPV_nolen(HeVAL(he));
6716 /* Efficient sub that returns a constant scalar value. */
6718 const_sv_xsub(pTHX_ CV* cv)
6723 Perl_croak(aTHX_ "usage: %s::%s()",
6724 HvNAME(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
6728 ST(0) = (SV*)XSANY.any_ptr;