/* B.xs * * Copyright (c) 1996 Malcolm Beattie * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. * */ #define PERL_NO_GET_CONTEXT #define PERL_EXT #include "EXTERN.h" #include "perl.h" #include "XSUB.h" #ifdef PerlIO typedef PerlIO * InputStream; #else typedef FILE * InputStream; #endif static const char* const svclassnames[] = { "B::NULL", "B::IV", "B::NV", "B::PV", "B::INVLIST", "B::PVIV", "B::PVNV", "B::PVMG", "B::REGEXP", "B::GV", "B::PVLV", "B::AV", "B::HV", "B::CV", "B::FM", "B::IO", }; typedef enum { OPc_NULL, /* 0 */ OPc_BASEOP, /* 1 */ OPc_UNOP, /* 2 */ OPc_BINOP, /* 3 */ OPc_LOGOP, /* 4 */ OPc_LISTOP, /* 5 */ OPc_PMOP, /* 6 */ OPc_SVOP, /* 7 */ OPc_PADOP, /* 8 */ OPc_PVOP, /* 9 */ OPc_LOOP, /* 10 */ OPc_COP, /* 11 */ OPc_METHOP, /* 12 */ OPc_UNOP_AUX /* 13 */ } opclass; static const char* const opclassnames[] = { "B::NULL", "B::OP", "B::UNOP", "B::BINOP", "B::LOGOP", "B::LISTOP", "B::PMOP", "B::SVOP", "B::PADOP", "B::PVOP", "B::LOOP", "B::COP", "B::METHOP", "B::UNOP_AUX" }; static const size_t opsizes[] = { 0, sizeof(OP), sizeof(UNOP), sizeof(BINOP), sizeof(LOGOP), sizeof(LISTOP), sizeof(PMOP), sizeof(SVOP), sizeof(PADOP), sizeof(PVOP), sizeof(LOOP), sizeof(COP), sizeof(METHOP), sizeof(UNOP_AUX), }; #define MY_CXT_KEY "B::_guts" XS_VERSION typedef struct { SV * x_specialsv_list[7]; int x_walkoptree_debug; /* Flag for walkoptree debug hook */ } my_cxt_t; START_MY_CXT #define walkoptree_debug (MY_CXT.x_walkoptree_debug) #define specialsv_list (MY_CXT.x_specialsv_list) static void B_init_my_cxt(pTHX_ my_cxt_t * cxt) { cxt->x_specialsv_list[0] = Nullsv; cxt->x_specialsv_list[1] = &PL_sv_undef; cxt->x_specialsv_list[2] = &PL_sv_yes; cxt->x_specialsv_list[3] = &PL_sv_no; cxt->x_specialsv_list[4] = (SV *) pWARN_ALL; cxt->x_specialsv_list[5] = (SV *) pWARN_NONE; cxt->x_specialsv_list[6] = (SV *) pWARN_STD; } static opclass cc_opclass(pTHX_ const OP *o) { bool custom = 0; if (!o) return OPc_NULL; if (o->op_type == 0) { if (o->op_targ == OP_NEXTSTATE || o->op_targ == OP_DBSTATE) return OPc_COP; return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP; } if (o->op_type == OP_SASSIGN) return ((o->op_private & OPpASSIGN_BACKWARDS) ? OPc_UNOP : OPc_BINOP); if (o->op_type == OP_AELEMFAST) { #ifdef USE_ITHREADS return OPc_PADOP; #else return OPc_SVOP; #endif } #ifdef USE_ITHREADS if (o->op_type == OP_GV || o->op_type == OP_GVSV || o->op_type == OP_RCATLINE) return OPc_PADOP; #endif if (o->op_type == OP_CUSTOM) custom = 1; switch (OP_CLASS(o)) { case OA_BASEOP: return OPc_BASEOP; case OA_UNOP: return OPc_UNOP; case OA_BINOP: return OPc_BINOP; case OA_LOGOP: return OPc_LOGOP; case OA_LISTOP: return OPc_LISTOP; case OA_PMOP: return OPc_PMOP; case OA_SVOP: return OPc_SVOP; case OA_PADOP: return OPc_PADOP; case OA_PVOP_OR_SVOP: /* * Character translations (tr///) are usually a PVOP, keeping a * pointer to a table of shorts used to look up translations. * Under utf8, however, a simple table isn't practical; instead, * the OP is an SVOP (or, under threads, a PADOP), * and the SV is a reference to a swash * (i.e., an RV pointing to an HV). */ return (!custom && (o->op_private & (OPpTRANS_TO_UTF|OPpTRANS_FROM_UTF)) ) #if defined(USE_ITHREADS) ? OPc_PADOP : OPc_PVOP; #else ? OPc_SVOP : OPc_PVOP; #endif case OA_LOOP: return OPc_LOOP; case OA_COP: return OPc_COP; case OA_BASEOP_OR_UNOP: /* * UNI(OP_foo) in toke.c returns token UNI or FUNC1 depending on * whether parens were seen. perly.y uses OPf_SPECIAL to * signal whether a BASEOP had empty parens or none. * Some other UNOPs are created later, though, so the best * test is OPf_KIDS, which is set in newUNOP. */ return (o->op_flags & OPf_KIDS) ? OPc_UNOP : OPc_BASEOP; case OA_FILESTATOP: /* * The file stat OPs are created via UNI(OP_foo) in toke.c but use * the OPf_REF flag to distinguish between OP types instead of the * usual OPf_SPECIAL flag. As usual, if OPf_KIDS is set, then we * return OPc_UNOP so that walkoptree can find our children. If * OPf_KIDS is not set then we check OPf_REF. Without OPf_REF set * (no argument to the operator) it's an OP; with OPf_REF set it's * an SVOP (and op_sv is the GV for the filehandle argument). */ return ((o->op_flags & OPf_KIDS) ? OPc_UNOP : #ifdef USE_ITHREADS (o->op_flags & OPf_REF) ? OPc_PADOP : OPc_BASEOP); #else (o->op_flags & OPf_REF) ? OPc_SVOP : OPc_BASEOP); #endif case OA_LOOPEXOP: /* * next, last, redo, dump and goto use OPf_SPECIAL to indicate that a * label was omitted (in which case it's a BASEOP) or else a term was * seen. In this last case, all except goto are definitely PVOP but * goto is either a PVOP (with an ordinary constant label), an UNOP * with OPf_STACKED (with a non-constant non-sub) or an UNOP for * OP_REFGEN (with goto &sub) in which case OPf_STACKED also seems to * get set. */ if (o->op_flags & OPf_STACKED) return OPc_UNOP; else if (o->op_flags & OPf_SPECIAL) return OPc_BASEOP; else return OPc_PVOP; case OA_METHOP: return OPc_METHOP; case OA_UNOP_AUX: return OPc_UNOP_AUX; } warn("can't determine class of operator %s, assuming BASEOP\n", OP_NAME(o)); return OPc_BASEOP; } static SV * make_op_object(pTHX_ const OP *o) { SV *opsv = sv_newmortal(); sv_setiv(newSVrv(opsv, opclassnames[cc_opclass(aTHX_ o)]), PTR2IV(o)); return opsv; } static SV * get_overlay_object(pTHX_ const OP *o, const char * const name, U32 namelen) { HE *he; SV **svp; SV *key; SV *sv =get_sv("B::overlay", 0); if (!sv || !SvROK(sv)) return NULL; sv = SvRV(sv); if (SvTYPE(sv) != SVt_PVHV) return NULL; key = newSViv(PTR2IV(o)); he = hv_fetch_ent((HV*)sv, key, 0, 0); SvREFCNT_dec(key); if (!he) return NULL; sv = HeVAL(he); if (!sv || !SvROK(sv)) return NULL; sv = SvRV(sv); if (SvTYPE(sv) != SVt_PVHV) return NULL; svp = hv_fetch((HV*)sv, name, namelen, 0); if (!svp) return NULL; sv = *svp; return sv; } static SV * make_sv_object(pTHX_ SV *sv) { SV *const arg = sv_newmortal(); const char *type = 0; IV iv; dMY_CXT; for (iv = 0; iv < (IV)(sizeof(specialsv_list)/sizeof(SV*)); iv++) { if (sv == specialsv_list[iv]) { type = "B::SPECIAL"; break; } } if (!type) { type = svclassnames[SvTYPE(sv)]; iv = PTR2IV(sv); } sv_setiv(newSVrv(arg, type), iv); return arg; } static SV * make_temp_object(pTHX_ SV *temp) { SV *target; SV *arg = sv_newmortal(); const char *const type = svclassnames[SvTYPE(temp)]; const IV iv = PTR2IV(temp); target = newSVrv(arg, type); sv_setiv(target, iv); /* Need to keep our "temp" around as long as the target exists. Simplest way seems to be to hang it from magic, and let that clear it up. No vtable, so won't actually get in the way of anything. */ sv_magicext(target, temp, PERL_MAGIC_sv, NULL, NULL, 0); /* magic object has had its reference count increased, so we must drop our reference. */ SvREFCNT_dec(temp); return arg; } static SV * make_warnings_object(pTHX_ const COP *const cop) { const STRLEN *const warnings = cop->cop_warnings; const char *type = 0; dMY_CXT; IV iv = sizeof(specialsv_list)/sizeof(SV*); /* Counting down is deliberate. Before the split between make_sv_object and make_warnings_obj there appeared to be a bug - Nullsv and pWARN_STD were both 0, so you could never get a B::SPECIAL for pWARN_STD */ while (iv--) { if ((SV*)warnings == specialsv_list[iv]) { type = "B::SPECIAL"; break; } } if (type) { SV *arg = sv_newmortal(); sv_setiv(newSVrv(arg, type), iv); return arg; } else { /* B assumes that warnings are a regular SV. Seems easier to keep it happy by making them into a regular SV. */ return make_temp_object(aTHX_ newSVpvn((char *)(warnings + 1), *warnings)); } } static SV * make_cop_io_object(pTHX_ COP *cop) { SV *const value = newSV(0); Perl_emulate_cop_io(aTHX_ cop, value); if(SvOK(value)) { return make_sv_object(aTHX_ value); } else { SvREFCNT_dec(value); return make_sv_object(aTHX_ NULL); } } static SV * make_mg_object(pTHX_ MAGIC *mg) { SV *arg = sv_newmortal(); sv_setiv(newSVrv(arg, "B::MAGIC"), PTR2IV(mg)); return arg; } static SV * cstring(pTHX_ SV *sv, bool perlstyle) { SV *sstr; if (!SvOK(sv)) return newSVpvs_flags("0", SVs_TEMP); sstr = newSVpvs_flags("\"", SVs_TEMP); if (perlstyle && SvUTF8(sv)) { SV *tmpsv = sv_newmortal(); /* Temporary SV to feed sv_uni_display */ const STRLEN len = SvCUR(sv); const char *s = sv_uni_display(tmpsv, sv, 8*len, UNI_DISPLAY_QQ); while (*s) { if (*s == '"') sv_catpvs(sstr, "\\\""); else if (*s == '$') sv_catpvs(sstr, "\\$"); else if (*s == '@') sv_catpvs(sstr, "\\@"); else if (*s == '\\') { if (strchr("nrftax\\",*(s+1))) sv_catpvn(sstr, s++, 2); else sv_catpvs(sstr, "\\\\"); } else /* should always be printable */ sv_catpvn(sstr, s, 1); ++s; } } else { /* XXX Optimise? */ STRLEN len; const char *s = SvPV(sv, len); for (; len; len--, s++) { /* At least try a little for readability */ if (*s == '"') sv_catpvs(sstr, "\\\""); else if (*s == '\\') sv_catpvs(sstr, "\\\\"); /* trigraphs - bleagh */ else if (!perlstyle && *s == '?' && len>=3 && s[1] == '?') { Perl_sv_catpvf(aTHX_ sstr, "\\%03o", '?'); } else if (perlstyle && *s == '$') sv_catpvs(sstr, "\\$"); else if (perlstyle && *s == '@') sv_catpvs(sstr, "\\@"); else if (isPRINT(*s)) sv_catpvn(sstr, s, 1); else if (*s == '\n') sv_catpvs(sstr, "\\n"); else if (*s == '\r') sv_catpvs(sstr, "\\r"); else if (*s == '\t') sv_catpvs(sstr, "\\t"); else if (*s == '\a') sv_catpvs(sstr, "\\a"); else if (*s == '\b') sv_catpvs(sstr, "\\b"); else if (*s == '\f') sv_catpvs(sstr, "\\f"); else if (!perlstyle && *s == '\v') sv_catpvs(sstr, "\\v"); else { /* Don't want promotion of a signed -1 char in sprintf args */ const unsigned char c = (unsigned char) *s; Perl_sv_catpvf(aTHX_ sstr, "\\%03o", c); } /* XXX Add line breaks if string is long */ } } sv_catpvs(sstr, "\""); return sstr; } static SV * cchar(pTHX_ SV *sv) { SV *sstr = newSVpvs_flags("'", SVs_TEMP); const char *s = SvPV_nolen(sv); /* Don't want promotion of a signed -1 char in sprintf args */ const unsigned char c = (unsigned char) *s; if (c == '\'') sv_catpvs(sstr, "\\'"); else if (c == '\\') sv_catpvs(sstr, "\\\\"); else if (isPRINT(c)) sv_catpvn(sstr, s, 1); else if (c == '\n') sv_catpvs(sstr, "\\n"); else if (c == '\r') sv_catpvs(sstr, "\\r"); else if (c == '\t') sv_catpvs(sstr, "\\t"); else if (c == '\a') sv_catpvs(sstr, "\\a"); else if (c == '\b') sv_catpvs(sstr, "\\b"); else if (c == '\f') sv_catpvs(sstr, "\\f"); else if (c == '\v') sv_catpvs(sstr, "\\v"); else Perl_sv_catpvf(aTHX_ sstr, "\\%03o", c); sv_catpvs(sstr, "'"); return sstr; } #define PMOP_pmreplstart(o) o->op_pmstashstartu.op_pmreplstart #define PMOP_pmreplroot(o) o->op_pmreplrootu.op_pmreplroot static SV * walkoptree(pTHX_ OP *o, const char *method, SV *ref) { dSP; OP *kid; SV *object; const char *const classname = opclassnames[cc_opclass(aTHX_ o)]; dMY_CXT; /* Check that no-one has changed our reference, or is holding a reference to it. */ if (SvREFCNT(ref) == 1 && SvROK(ref) && SvTYPE(ref) == SVt_RV && (object = SvRV(ref)) && SvREFCNT(object) == 1 && SvTYPE(object) == SVt_PVMG && SvIOK_only(object) && !SvMAGICAL(object) && !SvMAGIC(object) && SvSTASH(object)) { /* Looks good, so rebless it for the class we need: */ sv_bless(ref, gv_stashpv(classname, GV_ADD)); } else { /* Need to make a new one. */ ref = sv_newmortal(); object = newSVrv(ref, classname); } sv_setiv(object, PTR2IV(o)); if (walkoptree_debug) { PUSHMARK(sp); XPUSHs(ref); PUTBACK; perl_call_method("walkoptree_debug", G_DISCARD); } PUSHMARK(sp); XPUSHs(ref); PUTBACK; perl_call_method(method, G_DISCARD); if (o && (o->op_flags & OPf_KIDS)) { for (kid = ((UNOP*)o)->op_first; kid; kid = OpSIBLING(kid)) { ref = walkoptree(aTHX_ kid, method, ref); } } if (o && (cc_opclass(aTHX_ o) == OPc_PMOP) && o->op_type != OP_PUSHRE && (kid = PMOP_pmreplroot(cPMOPo))) { ref = walkoptree(aTHX_ kid, method, ref); } return ref; } static SV ** oplist(pTHX_ OP *o, SV **SP) { for(; o; o = o->op_next) { if (o->op_opt == 0) break; o->op_opt = 0; XPUSHs(make_op_object(aTHX_ o)); switch (o->op_type) { case OP_SUBST: SP = oplist(aTHX_ PMOP_pmreplstart(cPMOPo), SP); continue; case OP_SORT: if (o->op_flags & OPf_STACKED && o->op_flags & OPf_SPECIAL) { OP *kid = OpSIBLING(cLISTOPo->op_first); /* pass pushmark */ kid = kUNOP->op_first; /* pass rv2gv */ kid = kUNOP->op_first; /* pass leave */ SP = oplist(aTHX_ kid->op_next, SP); } continue; } switch (PL_opargs[o->op_type] & OA_CLASS_MASK) { case OA_LOGOP: SP = oplist(aTHX_ cLOGOPo->op_other, SP); break; case OA_LOOP: SP = oplist(aTHX_ cLOOPo->op_lastop, SP); SP = oplist(aTHX_ cLOOPo->op_nextop, SP); SP = oplist(aTHX_ cLOOPo->op_redoop, SP); break; } } return SP; } typedef OP *B__OP; typedef UNOP *B__UNOP; typedef BINOP *B__BINOP; typedef LOGOP *B__LOGOP; typedef LISTOP *B__LISTOP; typedef PMOP *B__PMOP; typedef SVOP *B__SVOP; typedef PADOP *B__PADOP; typedef PVOP *B__PVOP; typedef LOOP *B__LOOP; typedef COP *B__COP; typedef METHOP *B__METHOP; typedef SV *B__SV; typedef SV *B__IV; typedef SV *B__PV; typedef SV *B__NV; typedef SV *B__PVMG; typedef SV *B__REGEXP; typedef SV *B__PVLV; typedef SV *B__BM; typedef SV *B__RV; typedef SV *B__FM; typedef AV *B__AV; typedef HV *B__HV; typedef CV *B__CV; typedef GV *B__GV; typedef IO *B__IO; typedef MAGIC *B__MAGIC; typedef HE *B__HE; typedef struct refcounted_he *B__RHE; #ifdef PadlistARRAY typedef PADLIST *B__PADLIST; #endif typedef PADNAMELIST *B__PADNAMELIST; typedef PADNAME *B__PADNAME; #ifdef MULTIPLICITY # define ASSIGN_COMMON_ALIAS(prefix, var) \ STMT_START { XSANY.any_i32 = STRUCT_OFFSET(struct interpreter, prefix##var); } STMT_END #else # define ASSIGN_COMMON_ALIAS(prefix, var) \ STMT_START { XSANY.any_ptr = (void *)&PL_##var; } STMT_END #endif /* This needs to be ALIASed in a custom way, hence can't easily be defined as a regular XSUB. */ static XSPROTO(intrpvar_sv_common); /* prototype to pass -Wmissing-prototypes */ static XSPROTO(intrpvar_sv_common) { dVAR; dXSARGS; SV *ret; if (items != 0) croak_xs_usage(cv, ""); #ifdef MULTIPLICITY ret = *(SV **)(XSANY.any_i32 + (char *)my_perl); #else ret = *(SV **)(XSANY.any_ptr); #endif ST(0) = make_sv_object(aTHX_ ret); XSRETURN(1); } #define SVp 0x0 #define U32p 0x1 #define line_tp 0x2 #define OPp 0x3 #define PADOFFSETp 0x4 #define U8p 0x5 #define IVp 0x6 #define char_pp 0x7 /* Keep this last: */ #define op_offset_special 0x8 /* table that drives most of the B::*OP methods */ static const struct OP_methods { const char *name; U8 namelen; U8 type; /* if op_offset_special, access is handled on a case-by-case basis */ U16 offset; } op_methods[] = { { STR_WITH_LEN("next"), OPp, STRUCT_OFFSET(struct op, op_next), },/* 0*/ { STR_WITH_LEN("sibling"), op_offset_special, 0, },/* 1*/ { STR_WITH_LEN("targ"), PADOFFSETp, STRUCT_OFFSET(struct op, op_targ), },/* 2*/ { STR_WITH_LEN("flags"), U8p, STRUCT_OFFSET(struct op, op_flags), },/* 3*/ { STR_WITH_LEN("private"), U8p, STRUCT_OFFSET(struct op, op_private), },/* 4*/ { STR_WITH_LEN("first"), OPp, STRUCT_OFFSET(struct unop, op_first), },/* 5*/ { STR_WITH_LEN("last"), OPp, STRUCT_OFFSET(struct binop, op_last), },/* 6*/ { STR_WITH_LEN("other"), OPp, STRUCT_OFFSET(struct logop, op_other), },/* 7*/ { STR_WITH_LEN("pmreplstart"), op_offset_special, 0, },/* 8*/ { STR_WITH_LEN("redoop"), OPp, STRUCT_OFFSET(struct loop, op_redoop), },/* 9*/ { STR_WITH_LEN("nextop"), OPp, STRUCT_OFFSET(struct loop, op_nextop), },/*10*/ { STR_WITH_LEN("lastop"), OPp, STRUCT_OFFSET(struct loop, op_lastop), },/*11*/ { STR_WITH_LEN("pmflags"), U32p, STRUCT_OFFSET(struct pmop, op_pmflags),},/*12*/ { STR_WITH_LEN("code_list"),OPp, STRUCT_OFFSET(struct pmop, op_code_list),},/*13*/ { STR_WITH_LEN("sv"), SVp, STRUCT_OFFSET(struct svop, op_sv), },/*14*/ { STR_WITH_LEN("gv"), SVp, STRUCT_OFFSET(struct svop, op_sv), },/*15*/ { STR_WITH_LEN("padix"), PADOFFSETp,STRUCT_OFFSET(struct padop, op_padix),},/*16*/ { STR_WITH_LEN("cop_seq"), U32p, STRUCT_OFFSET(struct cop, cop_seq), },/*17*/ { STR_WITH_LEN("line"), line_tp, STRUCT_OFFSET(struct cop, cop_line), },/*18*/ { STR_WITH_LEN("hints"), U32p, STRUCT_OFFSET(struct cop, cop_hints), },/*19*/ #ifdef USE_ITHREADS { STR_WITH_LEN("pmoffset"),IVp, STRUCT_OFFSET(struct pmop, op_pmoffset),},/*20*/ { STR_WITH_LEN("filegv"), op_offset_special, 0, },/*21*/ { STR_WITH_LEN("file"), char_pp, STRUCT_OFFSET(struct cop, cop_file), },/*22*/ { STR_WITH_LEN("stash"), op_offset_special, 0, },/*23*/ { STR_WITH_LEN("stashpv"), op_offset_special, 0, },/*24*/ { STR_WITH_LEN("stashoff"),PADOFFSETp,STRUCT_OFFSET(struct cop,cop_stashoff),},/*25*/ #else { STR_WITH_LEN("pmoffset"),op_offset_special, 0, },/*20*/ { STR_WITH_LEN("filegv"), SVp, STRUCT_OFFSET(struct cop, cop_filegv),},/*21*/ { STR_WITH_LEN("file"), op_offset_special, 0, },/*22*/ { STR_WITH_LEN("stash"), SVp, STRUCT_OFFSET(struct cop, cop_stash), },/*23*/ { STR_WITH_LEN("stashpv"), op_offset_special, 0, },/*24*/ { STR_WITH_LEN("stashoff"),op_offset_special, 0, },/*25*/ #endif { STR_WITH_LEN("size"), op_offset_special, 0, },/*26*/ { STR_WITH_LEN("name"), op_offset_special, 0, },/*27*/ { STR_WITH_LEN("desc"), op_offset_special, 0, },/*28*/ { STR_WITH_LEN("ppaddr"), op_offset_special, 0, },/*29*/ { STR_WITH_LEN("type"), op_offset_special, 0, },/*30*/ { STR_WITH_LEN("opt"), op_offset_special, 0, },/*31*/ { STR_WITH_LEN("spare"), op_offset_special, 0, },/*32*/ { STR_WITH_LEN("children"),op_offset_special, 0, },/*33*/ { STR_WITH_LEN("pmreplroot"), op_offset_special, 0, },/*34*/ { STR_WITH_LEN("pmstashpv"), op_offset_special, 0, },/*35*/ { STR_WITH_LEN("pmstash"), op_offset_special, 0, },/*36*/ { STR_WITH_LEN("precomp"), op_offset_special, 0, },/*37*/ { STR_WITH_LEN("reflags"), op_offset_special, 0, },/*38*/ { STR_WITH_LEN("sv"), op_offset_special, 0, },/*39*/ { STR_WITH_LEN("gv"), op_offset_special, 0, },/*40*/ { STR_WITH_LEN("pv"), op_offset_special, 0, },/*41*/ { STR_WITH_LEN("label"), op_offset_special, 0, },/*42*/ { STR_WITH_LEN("arybase"), op_offset_special, 0, },/*43*/ { STR_WITH_LEN("warnings"),op_offset_special, 0, },/*44*/ { STR_WITH_LEN("io"), op_offset_special, 0, },/*45*/ { STR_WITH_LEN("hints_hash"),op_offset_special, 0, },/*46*/ { STR_WITH_LEN("slabbed"), op_offset_special, 0, },/*47*/ { STR_WITH_LEN("savefree"),op_offset_special, 0, },/*48*/ { STR_WITH_LEN("static"), op_offset_special, 0, },/*49*/ { STR_WITH_LEN("folded"), op_offset_special, 0, },/*50*/ { STR_WITH_LEN("moresib"), op_offset_special, 0, },/*51*/ { STR_WITH_LEN("parent"), op_offset_special, 0, },/*52*/ { STR_WITH_LEN("first"), op_offset_special, 0, },/*53*/ { STR_WITH_LEN("meth_sv"), op_offset_special, 0, },/*54*/ { STR_WITH_LEN("pmregexp"),op_offset_special, 0, },/*55*/ # ifdef USE_ITHREADS { STR_WITH_LEN("rclass"), op_offset_special, 0, },/*56*/ # else { STR_WITH_LEN("rclass"), op_offset_special, 0, },/*56*/ # endif }; #include "const-c.inc" MODULE = B PACKAGE = B INCLUDE: const-xs.inc PROTOTYPES: DISABLE BOOT: { CV *cv; const char *file = __FILE__; SV *sv; MY_CXT_INIT; B_init_my_cxt(aTHX_ &(MY_CXT)); cv = newXS("B::init_av", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, initav); cv = newXS("B::check_av", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, checkav_save); cv = newXS("B::unitcheck_av", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, unitcheckav_save); cv = newXS("B::begin_av", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, beginav_save); cv = newXS("B::end_av", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, endav); cv = newXS("B::main_cv", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, main_cv); cv = newXS("B::inc_gv", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, incgv); cv = newXS("B::defstash", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, defstash); cv = newXS("B::curstash", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, curstash); #ifdef PL_formfeed cv = newXS("B::formfeed", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, formfeed); #endif #ifdef USE_ITHREADS cv = newXS("B::regex_padav", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, regex_padav); #endif cv = newXS("B::warnhook", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, warnhook); cv = newXS("B::diehook", intrpvar_sv_common, file); ASSIGN_COMMON_ALIAS(I, diehook); sv = get_sv("B::OP::does_parent", GV_ADDMULTI); #ifdef PERL_OP_PARENT sv_setsv(sv, &PL_sv_yes); #else sv_setsv(sv, &PL_sv_no); #endif } #ifndef PL_formfeed void formfeed() PPCODE: PUSHs(make_sv_object(aTHX_ GvSV(gv_fetchpvs("\f", GV_ADD, SVt_PV)))); #endif long amagic_generation() CODE: RETVAL = PL_amagic_generation; OUTPUT: RETVAL void comppadlist() PREINIT: PADLIST *padlist = CvPADLIST(PL_main_cv ? PL_main_cv : PL_compcv); PPCODE: #ifdef PadlistARRAY { SV * const rv = sv_newmortal(); sv_setiv(newSVrv(rv, padlist ? "B::PADLIST" : "B::NULL"), PTR2IV(padlist)); PUSHs(rv); } #else PUSHs(make_sv_object(aTHX_ (SV *)padlist)); #endif void sv_undef() ALIAS: sv_no = 1 sv_yes = 2 PPCODE: PUSHs(make_sv_object(aTHX_ ix > 1 ? &PL_sv_yes : ix < 1 ? &PL_sv_undef : &PL_sv_no)); void main_root() ALIAS: main_start = 1 PPCODE: PUSHs(make_op_object(aTHX_ ix ? PL_main_start : PL_main_root)); UV sub_generation() ALIAS: dowarn = 1 CODE: RETVAL = ix ? PL_dowarn : PL_sub_generation; OUTPUT: RETVAL void walkoptree(op, method) B::OP op const char * method CODE: (void) walkoptree(aTHX_ op, method, &PL_sv_undef); int walkoptree_debug(...) CODE: dMY_CXT; RETVAL = walkoptree_debug; if (items > 0 && SvTRUE(ST(1))) walkoptree_debug = 1; OUTPUT: RETVAL #define address(sv) PTR2IV(sv) IV address(sv) SV * sv void svref_2object(sv) SV * sv PPCODE: if (!SvROK(sv)) croak("argument is not a reference"); PUSHs(make_sv_object(aTHX_ SvRV(sv))); void opnumber(name) const char * name CODE: { int i; IV result = -1; ST(0) = sv_newmortal(); if (strncmp(name,"pp_",3) == 0) name += 3; for (i = 0; i < PL_maxo; i++) { if (strcmp(name, PL_op_name[i]) == 0) { result = i; break; } } sv_setiv(ST(0),result); } void ppname(opnum) int opnum CODE: ST(0) = sv_newmortal(); if (opnum >= 0 && opnum < PL_maxo) Perl_sv_setpvf(aTHX_ ST(0), "pp_%s", PL_op_name[opnum]); void hash(sv) SV * sv CODE: STRLEN len; U32 hash = 0; const char *s = SvPVbyte(sv, len); PERL_HASH(hash, s, len); ST(0) = sv_2mortal(Perl_newSVpvf(aTHX_ "0x%"UVxf, (UV)hash)); #define cast_I32(foo) (I32)foo IV cast_I32(i) IV i void minus_c() ALIAS: save_BEGINs = 1 CODE: if (ix) PL_savebegin = TRUE; else PL_minus_c = TRUE; void cstring(sv) SV * sv ALIAS: perlstring = 1 cchar = 2 PPCODE: PUSHs(ix == 2 ? cchar(aTHX_ sv) : cstring(aTHX_ sv, (bool)ix)); void threadsv_names() PPCODE: #ifdef USE_ITHREADS void CLONE(...) PPCODE: PUTBACK; /* some vars go out of scope now in machine code */ { MY_CXT_CLONE; B_init_my_cxt(aTHX_ &(MY_CXT)); } return; /* dont execute another implied XSPP PUTBACK */ #endif MODULE = B PACKAGE = B::OP # The type checking code in B has always been identical for all OP types, # irrespective of whether the action is actually defined on that OP. # We should fix this void next(o) B::OP o ALIAS: B::OP::next = 0 B::OP::sibling = 1 B::OP::targ = 2 B::OP::flags = 3 B::OP::private = 4 B::UNOP::first = 5 B::BINOP::last = 6 B::LOGOP::other = 7 B::PMOP::pmreplstart = 8 B::LOOP::redoop = 9 B::LOOP::nextop = 10 B::LOOP::lastop = 11 B::PMOP::pmflags = 12 B::PMOP::code_list = 13 B::SVOP::sv = 14 B::SVOP::gv = 15 B::PADOP::padix = 16 B::COP::cop_seq = 17 B::COP::line = 18 B::COP::hints = 19 B::PMOP::pmoffset = 20 B::COP::filegv = 21 B::COP::file = 22 B::COP::stash = 23 B::COP::stashpv = 24 B::COP::stashoff = 25 B::OP::size = 26 B::OP::name = 27 B::OP::desc = 28 B::OP::ppaddr = 29 B::OP::type = 30 B::OP::opt = 31 B::OP::spare = 32 B::LISTOP::children = 33 B::PMOP::pmreplroot = 34 B::PMOP::pmstashpv = 35 B::PMOP::pmstash = 36 B::PMOP::precomp = 37 B::PMOP::reflags = 38 B::PADOP::sv = 39 B::PADOP::gv = 40 B::PVOP::pv = 41 B::COP::label = 42 B::COP::arybase = 43 B::COP::warnings = 44 B::COP::io = 45 B::COP::hints_hash = 46 B::OP::slabbed = 47 B::OP::savefree = 48 B::OP::static = 49 B::OP::folded = 50 B::OP::moresib = 51 B::OP::parent = 52 B::METHOP::first = 53 B::METHOP::meth_sv = 54 B::PMOP::pmregexp = 55 B::METHOP::rclass = 56 PREINIT: SV *ret; PPCODE: if (ix < 0 || (U32)ix >= C_ARRAY_LENGTH(op_methods)) croak("Illegal alias %d for B::*OP::next", (int)ix); ret = get_overlay_object(aTHX_ o, op_methods[ix].name, op_methods[ix].namelen); if (ret) { ST(0) = ret; XSRETURN(1); } /* handle non-direct field access */ if (op_methods[ix].type == op_offset_special) switch (ix) { case 1: /* B::OP::op_sibling */ ret = make_op_object(aTHX_ OpSIBLING(o)); break; case 8: /* B::PMOP::pmreplstart */ ret = make_op_object(aTHX_ cPMOPo->op_type == OP_SUBST ? cPMOPo->op_pmstashstartu.op_pmreplstart : NULL ); break; #ifdef USE_ITHREADS case 21: /* B::COP::filegv */ ret = make_sv_object(aTHX_ (SV *)CopFILEGV((COP*)o)); break; #endif #ifndef USE_ITHREADS case 22: /* B::COP::file */ ret = sv_2mortal(newSVpv(CopFILE((COP*)o), 0)); break; #endif #ifdef USE_ITHREADS case 23: /* B::COP::stash */ ret = make_sv_object(aTHX_ (SV *)CopSTASH((COP*)o)); break; #endif case 24: /* B::COP::stashpv */ ret = sv_2mortal(CopSTASH((COP*)o) && SvTYPE(CopSTASH((COP*)o)) == SVt_PVHV ? newSVhek(HvNAME_HEK(CopSTASH((COP*)o))) : &PL_sv_undef); break; case 26: /* B::OP::size */ ret = sv_2mortal(newSVuv((UV)(opsizes[cc_opclass(aTHX_ o)]))); break; case 27: /* B::OP::name */ case 28: /* B::OP::desc */ ret = sv_2mortal(newSVpv( (char *)(ix == 28 ? OP_DESC(o) : OP_NAME(o)), 0)); break; case 29: /* B::OP::ppaddr */ { int i; ret = sv_2mortal(Perl_newSVpvf(aTHX_ "PL_ppaddr[OP_%s]", PL_op_name[o->op_type])); for (i=13; (STRLEN)i < SvCUR(ret); ++i) SvPVX(ret)[i] = toUPPER(SvPVX(ret)[i]); } break; case 30: /* B::OP::type */ case 31: /* B::OP::opt */ case 32: /* B::OP::spare */ case 47: /* B::OP::slabbed */ case 48: /* B::OP::savefree */ case 49: /* B::OP::static */ case 50: /* B::OP::folded */ case 51: /* B::OP::moresib */ /* These are all bitfields, so we can't take their addresses */ ret = sv_2mortal(newSVuv((UV)( ix == 30 ? o->op_type : ix == 31 ? o->op_opt : ix == 47 ? o->op_slabbed : ix == 48 ? o->op_savefree : ix == 49 ? o->op_static : ix == 50 ? o->op_folded : ix == 51 ? o->op_moresib : o->op_spare))); break; case 33: /* B::LISTOP::children */ { OP *kid; UV i = 0; for (kid = ((LISTOP*)o)->op_first; kid; kid = OpSIBLING(kid)) i++; ret = sv_2mortal(newSVuv(i)); } break; case 34: /* B::PMOP::pmreplroot */ if (cPMOPo->op_type == OP_PUSHRE) { #ifdef USE_ITHREADS ret = sv_newmortal(); sv_setiv(ret, cPMOPo->op_pmreplrootu.op_pmtargetoff); #else GV *const target = cPMOPo->op_pmreplrootu.op_pmtargetgv; ret = sv_newmortal(); sv_setiv(newSVrv(ret, target ? svclassnames[SvTYPE((SV*)target)] : "B::SV"), PTR2IV(target)); #endif } else { OP *const root = cPMOPo->op_pmreplrootu.op_pmreplroot; ret = make_op_object(aTHX_ root); } break; #ifdef USE_ITHREADS case 35: /* B::PMOP::pmstashpv */ ret = sv_2mortal(newSVpv(PmopSTASHPV(cPMOPo),0)); break; #else case 36: /* B::PMOP::pmstash */ ret = make_sv_object(aTHX_ (SV *) PmopSTASH(cPMOPo)); break; #endif case 37: /* B::PMOP::precomp */ case 38: /* B::PMOP::reflags */ { REGEXP *rx = PM_GETRE(cPMOPo); ret = sv_newmortal(); if (rx) { if (ix==38) { sv_setuv(ret, RX_EXTFLAGS(rx)); } else { sv_setpvn(ret, RX_PRECOMP(rx), RX_PRELEN(rx)); if (RX_UTF8(rx)) SvUTF8_on(ret); } } } break; case 39: /* B::PADOP::sv */ case 40: /* B::PADOP::gv */ /* PADOPs should only be created on threaded builds. * They don't have an sv or gv field, just an op_padix * field. Leave it to the caller to retrieve padix * and look up th value in the pad. Don't do it here, * becuase PL_curpad is the pad of the caller, not the * pad of the sub the op is part of */ ret = make_sv_object(aTHX_ NULL); break; case 41: /* B::PVOP::pv */ /* OP_TRANS uses op_pv to point to a table of 256 or >=258 * shorts whereas other PVOPs point to a null terminated * string. */ if ( (cPVOPo->op_type == OP_TRANS || cPVOPo->op_type == OP_TRANSR) && (cPVOPo->op_private & OPpTRANS_COMPLEMENT) && !(cPVOPo->op_private & OPpTRANS_DELETE)) { const short* const tbl = (short*)cPVOPo->op_pv; const short entries = 257 + tbl[256]; ret = newSVpvn_flags(cPVOPo->op_pv, entries * sizeof(short), SVs_TEMP); } else if (cPVOPo->op_type == OP_TRANS || cPVOPo->op_type == OP_TRANSR) { ret = newSVpvn_flags(cPVOPo->op_pv, 256 * sizeof(short), SVs_TEMP); } else ret = newSVpvn_flags(cPVOPo->op_pv, strlen(cPVOPo->op_pv), SVs_TEMP); break; case 42: /* B::COP::label */ ret = sv_2mortal(newSVpv(CopLABEL(cCOPo),0)); break; case 43: /* B::COP::arybase */ ret = sv_2mortal(newSVuv(0)); break; case 44: /* B::COP::warnings */ ret = make_warnings_object(aTHX_ cCOPo); break; case 45: /* B::COP::io */ ret = make_cop_io_object(aTHX_ cCOPo); break; case 46: /* B::COP::hints_hash */ ret = sv_newmortal(); sv_setiv(newSVrv(ret, "B::RHE"), PTR2IV(CopHINTHASH_get(cCOPo))); break; case 52: /* B::OP::parent */ #ifdef PERL_OP_PARENT ret = make_op_object(aTHX_ op_parent(o)); #else ret = make_op_object(aTHX_ NULL); #endif break; case 53: /* B::METHOP::first */ /* METHOP struct has an op_first/op_meth_sv union * as its first extra field. How to interpret the * union depends on the op type. For the purposes of * B, we treat it as a struct with both fields present, * where one of the fields always happens to be null * (i.e. we return NULL in preference to croaking with * 'method not implemented'). */ ret = make_op_object(aTHX_ o->op_type == OP_METHOD ? cMETHOPx(o)->op_u.op_first : NULL); break; case 54: /* B::METHOP::meth_sv */ /* see comment above about METHOP */ ret = make_sv_object(aTHX_ o->op_type == OP_METHOD ? NULL : cMETHOPx(o)->op_u.op_meth_sv); break; case 55: /* B::PMOP::pmregexp */ ret = make_sv_object(aTHX_ (SV *)PM_GETRE(cPMOPo)); break; case 56: /* B::METHOP::rclass */ #ifdef USE_ITHREADS ret = sv_2mortal(newSVuv( (o->op_type == OP_METHOD_REDIR || o->op_type == OP_METHOD_REDIR_SUPER) ? cMETHOPx(o)->op_rclass_targ : 0 )); #else ret = make_sv_object(aTHX_ (o->op_type == OP_METHOD_REDIR || o->op_type == OP_METHOD_REDIR_SUPER) ? cMETHOPx(o)->op_rclass_sv : NULL ); #endif break; default: croak("method %s not implemented", op_methods[ix].name); } else { /* do a direct structure offset lookup */ const char *const ptr = (char *)o + op_methods[ix].offset; switch (op_methods[ix].type) { case OPp: ret = make_op_object(aTHX_ *((OP **)ptr)); break; case PADOFFSETp: ret = sv_2mortal(newSVuv(*((PADOFFSET*)ptr))); break; case U8p: ret = sv_2mortal(newSVuv(*((U8*)ptr))); break; case U32p: ret = sv_2mortal(newSVuv(*((U32*)ptr))); break; case SVp: ret = make_sv_object(aTHX_ *((SV **)ptr)); break; case line_tp: ret = sv_2mortal(newSVuv(*((line_t *)ptr))); break; case IVp: ret = sv_2mortal(newSViv(*((IV*)ptr))); break; case char_pp: ret = sv_2mortal(newSVpv(*((char **)ptr), 0)); break; default: croak("Illegal type 0x%x for B::*OP::%s", (unsigned)op_methods[ix].type, op_methods[ix].name); } } ST(0) = ret; XSRETURN(1); void oplist(o) B::OP o PPCODE: SP = oplist(aTHX_ o, SP); MODULE = B PACKAGE = B::UNOP_AUX # UNOP_AUX class ops are like UNOPs except that they have an extra # op_aux pointer that points to an array of UNOP_AUX_item unions. # Element -1 of the array contains the length # return a string representation of op_aux where possible The op's CV is # needed as an extra arg to allow GVs and SVs moved into the pad to be # accessed okay. void string(o, cv) B::OP o B::CV cv PREINIT: SV *ret; PPCODE: switch (o->op_type) { case OP_MULTIDEREF: ret = multideref_stringify(o, cv); break; default: ret = sv_2mortal(newSVpvn("", 0)); } ST(0) = ret; XSRETURN(1); # Return the contents of the op_aux array as a list of IV/GV/etc objects. # How to interpret each array element is op-dependent. The op's CV is # needed as an extra arg to allow GVs and SVs which have been moved into # the pad to be accessed okay. void aux_list(o, cv) B::OP o B::CV cv PPCODE: PERL_UNUSED_VAR(cv); /* not needed on unthreaded builds */ switch (o->op_type) { default: XSRETURN(0); /* by default, an empty list */ case OP_MULTIDEREF: #ifdef USE_ITHREADS # define ITEM_SV(item) *av_fetch(comppad, (item)->pad_offset, FALSE); #else # define ITEM_SV(item) UNOP_AUX_item_sv(item) #endif { UNOP_AUX_item *items = cUNOP_AUXo->op_aux; UV actions = items->uv; UV len = items[-1].uv; SV *sv; bool last = 0; bool is_hash = FALSE; #ifdef USE_ITHREADS PADLIST * const padlist = CvPADLIST(cv); PAD *comppad = PadlistARRAY(padlist)[1]; #endif /* len should never be big enough to truncate or wrap */ assert(len <= SSize_t_MAX); EXTEND(SP, (SSize_t)len); PUSHs(sv_2mortal(newSViv(actions))); while (!last) { switch (actions & MDEREF_ACTION_MASK) { case MDEREF_reload: actions = (++items)->uv; PUSHs(sv_2mortal(newSVuv(actions))); continue; NOT_REACHED; /* NOTREACHED */ case MDEREF_HV_padhv_helem: is_hash = TRUE; /* FALLTHROUGH */ case MDEREF_AV_padav_aelem: PUSHs(sv_2mortal(newSVuv((++items)->pad_offset))); goto do_elem; NOT_REACHED; /* NOTREACHED */ case MDEREF_HV_gvhv_helem: is_hash = TRUE; /* FALLTHROUGH */ case MDEREF_AV_gvav_aelem: sv = ITEM_SV(++items); PUSHs(make_sv_object(aTHX_ sv)); goto do_elem; NOT_REACHED; /* NOTREACHED */ case MDEREF_HV_gvsv_vivify_rv2hv_helem: is_hash = TRUE; /* FALLTHROUGH */ case MDEREF_AV_gvsv_vivify_rv2av_aelem: sv = ITEM_SV(++items); PUSHs(make_sv_object(aTHX_ sv)); goto do_vivify_rv2xv_elem; NOT_REACHED; /* NOTREACHED */ case MDEREF_HV_padsv_vivify_rv2hv_helem: is_hash = TRUE; /* FALLTHROUGH */ case MDEREF_AV_padsv_vivify_rv2av_aelem: PUSHs(sv_2mortal(newSVuv((++items)->pad_offset))); goto do_vivify_rv2xv_elem; NOT_REACHED; /* NOTREACHED */ case MDEREF_HV_pop_rv2hv_helem: case MDEREF_HV_vivify_rv2hv_helem: is_hash = TRUE; /* FALLTHROUGH */ do_vivify_rv2xv_elem: case MDEREF_AV_pop_rv2av_aelem: case MDEREF_AV_vivify_rv2av_aelem: do_elem: switch (actions & MDEREF_INDEX_MASK) { case MDEREF_INDEX_none: last = 1; break; case MDEREF_INDEX_const: if (is_hash) { sv = ITEM_SV(++items); PUSHs(make_sv_object(aTHX_ sv)); } else PUSHs(sv_2mortal(newSViv((++items)->iv))); break; case MDEREF_INDEX_padsv: PUSHs(sv_2mortal(newSVuv((++items)->pad_offset))); break; case MDEREF_INDEX_gvsv: sv = ITEM_SV(++items); PUSHs(make_sv_object(aTHX_ sv)); break; } if (actions & MDEREF_FLAG_last) last = 1; is_hash = FALSE; break; } /* switch */ actions >>= MDEREF_SHIFT; } /* while */ XSRETURN(len); } /* OP_MULTIDEREF */ } /* switch */ MODULE = B PACKAGE = B::SV #define MAGICAL_FLAG_BITS (SVs_GMG|SVs_SMG|SVs_RMG) U32 REFCNT(sv) B::SV sv ALIAS: FLAGS = 0xFFFFFFFF SvTYPE = SVTYPEMASK POK = SVf_POK ROK = SVf_ROK MAGICAL = MAGICAL_FLAG_BITS CODE: RETVAL = ix ? (SvFLAGS(sv) & (U32)ix) : SvREFCNT(sv); OUTPUT: RETVAL void object_2svref(sv) B::SV sv PPCODE: ST(0) = sv_2mortal(newRV(sv)); XSRETURN(1); MODULE = B PACKAGE = B::IV PREFIX = Sv IV SvIV(sv) B::IV sv MODULE = B PACKAGE = B::IV #define sv_SVp 0x00000 #define sv_IVp 0x10000 #define sv_UVp 0x20000 #define sv_STRLENp 0x30000 #define sv_U32p 0x40000 #define sv_U8p 0x50000 #define sv_char_pp 0x60000 #define sv_NVp 0x70000 #define sv_char_p 0x80000 #define sv_SSize_tp 0x90000 #define sv_I32p 0xA0000 #define sv_U16p 0xB0000 #define IV_ivx_ix sv_IVp | STRUCT_OFFSET(struct xpviv, xiv_iv) #define IV_uvx_ix sv_UVp | STRUCT_OFFSET(struct xpvuv, xuv_uv) #define NV_nvx_ix sv_NVp | STRUCT_OFFSET(struct xpvnv, xnv_u.xnv_nv) #define PV_cur_ix sv_STRLENp | STRUCT_OFFSET(struct xpv, xpv_cur) #define PV_len_ix sv_STRLENp | STRUCT_OFFSET(struct xpv, xpv_len) #define PVMG_stash_ix sv_SVp | STRUCT_OFFSET(struct xpvmg, xmg_stash) #define PVBM_useful_ix sv_IVp | STRUCT_OFFSET(struct xpviv, xiv_u.xivu_iv) #define PVLV_targoff_ix sv_U32p | STRUCT_OFFSET(struct xpvlv, xlv_targoff) #define PVLV_targlen_ix sv_U32p | STRUCT_OFFSET(struct xpvlv, xlv_targlen) #define PVLV_targ_ix sv_SVp | STRUCT_OFFSET(struct xpvlv, xlv_targ) #define PVLV_type_ix sv_char_p | STRUCT_OFFSET(struct xpvlv, xlv_type) #define PVGV_stash_ix sv_SVp | STRUCT_OFFSET(struct xpvgv, xnv_u.xgv_stash) #define PVGV_flags_ix sv_STRLENp | STRUCT_OFFSET(struct xpvgv, xpv_cur) #define PVIO_lines_ix sv_IVp | STRUCT_OFFSET(struct xpvio, xiv_iv) #define PVIO_page_ix sv_IVp | STRUCT_OFFSET(struct xpvio, xio_page) #define PVIO_page_len_ix sv_IVp | STRUCT_OFFSET(struct xpvio, xio_page_len) #define PVIO_lines_left_ix sv_IVp | STRUCT_OFFSET(struct xpvio, xio_lines_left) #define PVIO_top_name_ix sv_char_pp | STRUCT_OFFSET(struct xpvio, xio_top_name) #define PVIO_top_gv_ix sv_SVp | STRUCT_OFFSET(struct xpvio, xio_top_gv) #define PVIO_fmt_name_ix sv_char_pp | STRUCT_OFFSET(struct xpvio, xio_fmt_name) #define PVIO_fmt_gv_ix sv_SVp | STRUCT_OFFSET(struct xpvio, xio_fmt_gv) #define PVIO_bottom_name_ix sv_char_pp | STRUCT_OFFSET(struct xpvio, xio_bottom_name) #define PVIO_bottom_gv_ix sv_SVp | STRUCT_OFFSET(struct xpvio, xio_bottom_gv) #define PVIO_type_ix sv_char_p | STRUCT_OFFSET(struct xpvio, xio_type) #define PVIO_flags_ix sv_U8p | STRUCT_OFFSET(struct xpvio, xio_flags) #define PVAV_max_ix sv_SSize_tp | STRUCT_OFFSET(struct xpvav, xav_max) #define PVCV_stash_ix sv_SVp | STRUCT_OFFSET(struct xpvcv, xcv_stash) #define PVCV_gv_ix sv_SVp | STRUCT_OFFSET(struct xpvcv, xcv_gv_u.xcv_gv) #define PVCV_file_ix sv_char_pp | STRUCT_OFFSET(struct xpvcv, xcv_file) #define PVCV_outside_ix sv_SVp | STRUCT_OFFSET(struct xpvcv, xcv_outside) #define PVCV_outside_seq_ix sv_U32p | STRUCT_OFFSET(struct xpvcv, xcv_outside_seq) #define PVCV_flags_ix sv_U32p | STRUCT_OFFSET(struct xpvcv, xcv_flags) #define PVHV_max_ix sv_STRLENp | STRUCT_OFFSET(struct xpvhv, xhv_max) #define PVHV_keys_ix sv_STRLENp | STRUCT_OFFSET(struct xpvhv, xhv_keys) # The type checking code in B has always been identical for all SV types, # irrespective of whether the action is actually defined on that SV. # We should fix this void IVX(sv) B::SV sv ALIAS: B::IV::IVX = IV_ivx_ix B::IV::UVX = IV_uvx_ix B::NV::NVX = NV_nvx_ix B::PV::CUR = PV_cur_ix B::PV::LEN = PV_len_ix B::PVMG::SvSTASH = PVMG_stash_ix B::PVLV::TARGOFF = PVLV_targoff_ix B::PVLV::TARGLEN = PVLV_targlen_ix B::PVLV::TARG = PVLV_targ_ix B::PVLV::TYPE = PVLV_type_ix B::GV::STASH = PVGV_stash_ix B::GV::GvFLAGS = PVGV_flags_ix B::BM::USEFUL = PVBM_useful_ix B::IO::LINES = PVIO_lines_ix B::IO::PAGE = PVIO_page_ix B::IO::PAGE_LEN = PVIO_page_len_ix B::IO::LINES_LEFT = PVIO_lines_left_ix B::IO::TOP_NAME = PVIO_top_name_ix B::IO::TOP_GV = PVIO_top_gv_ix B::IO::FMT_NAME = PVIO_fmt_name_ix B::IO::FMT_GV = PVIO_fmt_gv_ix B::IO::BOTTOM_NAME = PVIO_bottom_name_ix B::IO::BOTTOM_GV = PVIO_bottom_gv_ix B::IO::IoTYPE = PVIO_type_ix B::IO::IoFLAGS = PVIO_flags_ix B::AV::MAX = PVAV_max_ix B::CV::STASH = PVCV_stash_ix B::CV::FILE = PVCV_file_ix B::CV::OUTSIDE = PVCV_outside_ix B::CV::OUTSIDE_SEQ = PVCV_outside_seq_ix B::CV::CvFLAGS = PVCV_flags_ix B::HV::MAX = PVHV_max_ix B::HV::KEYS = PVHV_keys_ix PREINIT: char *ptr; SV *ret; PPCODE: ptr = (ix & 0xFFFF) + (char *)SvANY(sv); switch ((U8)(ix >> 16)) { case (U8)(sv_SVp >> 16): ret = make_sv_object(aTHX_ *((SV **)ptr)); break; case (U8)(sv_IVp >> 16): ret = sv_2mortal(newSViv(*((IV *)ptr))); break; case (U8)(sv_UVp >> 16): ret = sv_2mortal(newSVuv(*((UV *)ptr))); break; case (U8)(sv_STRLENp >> 16): ret = sv_2mortal(newSVuv(*((STRLEN *)ptr))); break; case (U8)(sv_U32p >> 16): ret = sv_2mortal(newSVuv(*((U32 *)ptr))); break; case (U8)(sv_U8p >> 16): ret = sv_2mortal(newSVuv(*((U8 *)ptr))); break; case (U8)(sv_char_pp >> 16): ret = sv_2mortal(newSVpv(*((char **)ptr), 0)); break; case (U8)(sv_NVp >> 16): ret = sv_2mortal(newSVnv(*((NV *)ptr))); break; case (U8)(sv_char_p >> 16): ret = newSVpvn_flags((char *)ptr, 1, SVs_TEMP); break; case (U8)(sv_SSize_tp >> 16): ret = sv_2mortal(newSViv(*((SSize_t *)ptr))); break; case (U8)(sv_I32p >> 16): ret = sv_2mortal(newSVuv(*((I32 *)ptr))); break; case (U8)(sv_U16p >> 16): ret = sv_2mortal(newSVuv(*((U16 *)ptr))); break; default: croak("Illegal alias 0x%08x for B::*IVX", (unsigned)ix); } ST(0) = ret; XSRETURN(1); void packiv(sv) B::IV sv ALIAS: needs64bits = 1 CODE: if (ix) { ST(0) = boolSV((I32)SvIVX(sv) != SvIVX(sv)); } else if (sizeof(IV) == 8) { U32 wp[2]; const IV iv = SvIVX(sv); /* * The following way of spelling 32 is to stop compilers on * 32-bit architectures from moaning about the shift count * being >= the width of the type. Such architectures don't * reach this code anyway (unless sizeof(IV) > 8 but then * everything else breaks too so I'm not fussed at the moment). */ #ifdef UV_IS_QUAD wp[0] = htonl(((UV)iv) >> (sizeof(UV)*4)); #else wp[0] = htonl(((U32)iv) >> (sizeof(UV)*4)); #endif wp[1] = htonl(iv & 0xffffffff); ST(0) = newSVpvn_flags((char *)wp, 8, SVs_TEMP); } else { U32 w = htonl((U32)SvIVX(sv)); ST(0) = newSVpvn_flags((char *)&w, 4, SVs_TEMP); } MODULE = B PACKAGE = B::NV PREFIX = Sv NV SvNV(sv) B::NV sv MODULE = B PACKAGE = B::REGEXP void REGEX(sv) B::REGEXP sv ALIAS: precomp = 1 qr_anoncv = 2 compflags = 3 PPCODE: if (ix == 1) { PUSHs(newSVpvn_flags(RX_PRECOMP(sv), RX_PRELEN(sv), SVs_TEMP)); } else if (ix == 2) { PUSHs(make_sv_object(aTHX_ (SV *)ReANY(sv)->qr_anoncv)); } else { dXSTARG; if (ix) PUSHu(RX_COMPFLAGS(sv)); else /* FIXME - can we code this method more efficiently? */ PUSHi(PTR2IV(sv)); } MODULE = B PACKAGE = B::PV void RV(sv) B::PV sv PPCODE: if (!SvROK(sv)) croak( "argument is not SvROK" ); PUSHs(make_sv_object(aTHX_ SvRV(sv))); void PV(sv) B::PV sv ALIAS: PVX = 1 PVBM = 2 B::BM::TABLE = 3 PREINIT: const char *p; STRLEN len = 0; U32 utf8 = 0; CODE: if (ix == 3) { #ifndef PERL_FBM_TABLE_OFFSET const MAGIC *const mg = mg_find(sv, PERL_MAGIC_bm); if (!mg) croak("argument to B::BM::TABLE is not a PVBM"); p = mg->mg_ptr; len = mg->mg_len; #else p = SvPV(sv, len); /* Boyer-Moore table is just after string and its safety-margin \0 */ p += len + PERL_FBM_TABLE_OFFSET; len = 256; #endif } else if (ix == 2) { /* This used to read 257. I think that that was buggy - should have been 258. (The "\0", the flags byte, and 256 for the table.) The only user of this method is B::Bytecode in B::PV::bsave. I'm guessing that nothing tested the runtime correctness of output of bytecompiled string constant arguments to index (etc). Note the start pointer is and has always been SvPVX(sv), not SvPVX(sv) + SvCUR(sv) PVBM was added in 651aa52ea1faa806, and first used by the compiler in 651aa52ea1faa806. It's used to get a "complete" dump of the buffer at SvPVX(), not just the PVBM table. This permits the generated bytecode to "load" SvPVX in "one" hit. 5.15 and later store the BM table via MAGIC, so the compiler should handle this just fine without changes if PVBM now always returns the SvPVX() buffer. */ #ifdef isREGEXP p = isREGEXP(sv) ? RX_WRAPPED_const((REGEXP*)sv) : SvPVX_const(sv); #else p = SvPVX_const(sv); #endif #ifdef PERL_FBM_TABLE_OFFSET len = SvCUR(sv) + (SvVALID(sv) ? 256 + PERL_FBM_TABLE_OFFSET : 0); #else len = SvCUR(sv); #endif } else if (ix) { #ifdef isREGEXP p = isREGEXP(sv) ? RX_WRAPPED((REGEXP*)sv) : SvPVX(sv); #else p = SvPVX(sv); #endif len = strlen(p); } else if (SvPOK(sv)) { len = SvCUR(sv); p = SvPVX_const(sv); utf8 = SvUTF8(sv); } #ifdef isREGEXP else if (isREGEXP(sv)) { len = SvCUR(sv); p = RX_WRAPPED_const((REGEXP*)sv); utf8 = SvUTF8(sv); } #endif else { /* XXX for backward compatibility, but should fail */ /* croak( "argument is not SvPOK" ); */ p = NULL; } ST(0) = newSVpvn_flags(p, len, SVs_TEMP | utf8); MODULE = B PACKAGE = B::PVMG void MAGIC(sv) B::PVMG sv MAGIC * mg = NO_INIT PPCODE: for (mg = SvMAGIC(sv); mg; mg = mg->mg_moremagic) XPUSHs(make_mg_object(aTHX_ mg)); MODULE = B PACKAGE = B::MAGIC void MOREMAGIC(mg) B::MAGIC mg ALIAS: PRIVATE = 1 TYPE = 2 FLAGS = 3 LENGTH = 4 OBJ = 5 PTR = 6 REGEX = 7 precomp = 8 PPCODE: switch (ix) { case 0: XPUSHs(mg->mg_moremagic ? make_mg_object(aTHX_ mg->mg_moremagic) : &PL_sv_undef); break; case 1: mPUSHu(mg->mg_private); break; case 2: PUSHs(newSVpvn_flags(&(mg->mg_type), 1, SVs_TEMP)); break; case 3: mPUSHu(mg->mg_flags); break; case 4: mPUSHi(mg->mg_len); break; case 5: PUSHs(make_sv_object(aTHX_ mg->mg_obj)); break; case 6: if (mg->mg_ptr) { if (mg->mg_len >= 0) { PUSHs(newSVpvn_flags(mg->mg_ptr, mg->mg_len, SVs_TEMP)); } else if (mg->mg_len == HEf_SVKEY) { PUSHs(make_sv_object(aTHX_ (SV*)mg->mg_ptr)); } else PUSHs(sv_newmortal()); } else PUSHs(sv_newmortal()); break; case 7: if(mg->mg_type == PERL_MAGIC_qr) { mPUSHi(PTR2IV(mg->mg_obj)); } else { croak("REGEX is only meaningful on r-magic"); } break; case 8: if (mg->mg_type == PERL_MAGIC_qr) { REGEXP *rx = (REGEXP *)mg->mg_obj; PUSHs(newSVpvn_flags(rx ? RX_PRECOMP(rx) : NULL, rx ? RX_PRELEN(rx) : 0, SVs_TEMP)); } else { croak( "precomp is only meaningful on r-magic" ); } break; } MODULE = B PACKAGE = B::BM PREFIX = Bm U32 BmPREVIOUS(sv) B::BM sv CODE: PERL_UNUSED_VAR(sv); RETVAL = BmPREVIOUS(sv); OUTPUT: RETVAL U8 BmRARE(sv) B::BM sv CODE: PERL_UNUSED_VAR(sv); RETVAL = BmRARE(sv); OUTPUT: RETVAL MODULE = B PACKAGE = B::GV PREFIX = Gv void GvNAME(gv) B::GV gv ALIAS: FILE = 1 B::HV::NAME = 2 CODE: ST(0) = sv_2mortal(newSVhek(!ix ? GvNAME_HEK(gv) : (ix == 1 ? GvFILE_HEK(gv) : HvNAME_HEK((HV *)gv)))); bool is_empty(gv) B::GV gv ALIAS: isGV_with_GP = 1 CODE: if (ix) { RETVAL = isGV_with_GP(gv) ? TRUE : FALSE; } else { RETVAL = GvGP(gv) == Null(GP*); } OUTPUT: RETVAL void* GvGP(gv) B::GV gv #define GP_sv_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_sv) #define GP_io_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_io) #define GP_cv_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_cv) #define GP_cvgen_ix (U32p << 16) | STRUCT_OFFSET(struct gp, gp_cvgen) #define GP_refcnt_ix (U32p << 16) | STRUCT_OFFSET(struct gp, gp_refcnt) #define GP_hv_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_hv) #define GP_av_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_av) #define GP_form_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_form) #define GP_egv_ix (SVp << 16) | STRUCT_OFFSET(struct gp, gp_egv) void SV(gv) B::GV gv ALIAS: SV = GP_sv_ix IO = GP_io_ix CV = GP_cv_ix CVGEN = GP_cvgen_ix GvREFCNT = GP_refcnt_ix HV = GP_hv_ix AV = GP_av_ix FORM = GP_form_ix EGV = GP_egv_ix PREINIT: GP *gp; char *ptr; SV *ret; PPCODE: gp = GvGP(gv); if (!gp) { const GV *const gv = CvGV(cv); Perl_croak(aTHX_ "NULL gp in B::GV::%s", gv ? GvNAME(gv) : "???"); } ptr = (ix & 0xFFFF) + (char *)gp; switch ((U8)(ix >> 16)) { case SVp: ret = make_sv_object(aTHX_ *((SV **)ptr)); break; case U32p: ret = sv_2mortal(newSVuv(*((U32*)ptr))); break; default: croak("Illegal alias 0x%08x for B::*SV", (unsigned)ix); } ST(0) = ret; XSRETURN(1); U32 GvLINE(gv) B::GV gv U32 GvGPFLAGS(gv) B::GV gv void FILEGV(gv) B::GV gv PPCODE: PUSHs(make_sv_object(aTHX_ (SV *)GvFILEGV(gv))); MODULE = B PACKAGE = B::IO PREFIX = Io bool IsSTD(io,name) B::IO io const char* name PREINIT: PerlIO* handle = 0; CODE: if( strEQ( name, "stdin" ) ) { handle = PerlIO_stdin(); } else if( strEQ( name, "stdout" ) ) { handle = PerlIO_stdout(); } else if( strEQ( name, "stderr" ) ) { handle = PerlIO_stderr(); } else { croak( "Invalid value '%s'", name ); } RETVAL = handle == IoIFP(io); OUTPUT: RETVAL MODULE = B PACKAGE = B::AV PREFIX = Av SSize_t AvFILL(av) B::AV av void AvARRAY(av) B::AV av PPCODE: if (AvFILL(av) >= 0) { SV **svp = AvARRAY(av); I32 i; for (i = 0; i <= AvFILL(av); i++) XPUSHs(make_sv_object(aTHX_ svp[i])); } void AvARRAYelt(av, idx) B::AV av int idx PPCODE: if (idx >= 0 && AvFILL(av) >= 0 && idx <= AvFILL(av)) XPUSHs(make_sv_object(aTHX_ (AvARRAY(av)[idx]))); else XPUSHs(make_sv_object(aTHX_ NULL)); MODULE = B PACKAGE = B::FM PREFIX = Fm IV FmLINES(format) B::FM format CODE: PERL_UNUSED_VAR(format); RETVAL = 0; OUTPUT: RETVAL MODULE = B PACKAGE = B::CV PREFIX = Cv U32 CvCONST(cv) B::CV cv void CvSTART(cv) B::CV cv ALIAS: ROOT = 1 PPCODE: PUSHs(make_op_object(aTHX_ CvISXSUB(cv) ? NULL : ix ? CvROOT(cv) : CvSTART(cv))); I32 CvDEPTH(cv) B::CV cv #ifdef PadlistARRAY B::PADLIST CvPADLIST(cv) B::CV cv CODE: RETVAL = CvISXSUB(cv) ? NULL : CvPADLIST(cv); OUTPUT: RETVAL #else B::AV CvPADLIST(cv) B::CV cv PPCODE: PUSHs(make_sv_object(aTHX_ (SV *)CvPADLIST(cv))); #endif SV * CvHSCXT(cv) B::CV cv CODE: RETVAL = newSVuv(CvISXSUB(cv) ? PTR2UV(CvHSCXT(cv)) : 0); OUTPUT: RETVAL void CvXSUB(cv) B::CV cv ALIAS: XSUBANY = 1 CODE: ST(0) = ix && CvCONST(cv) ? make_sv_object(aTHX_ (SV *)CvXSUBANY(cv).any_ptr) : sv_2mortal(newSViv(CvISXSUB(cv) ? (ix ? CvXSUBANY(cv).any_iv : PTR2IV(CvXSUB(cv))) : 0)); void const_sv(cv) B::CV cv PPCODE: PUSHs(make_sv_object(aTHX_ (SV *)cv_const_sv(cv))); void GV(cv) B::CV cv CODE: ST(0) = make_sv_object(aTHX_ (SV*)CvGV(cv)); SV * NAME_HEK(cv) B::CV cv CODE: RETVAL = CvNAMED(cv) ? newSVhek(CvNAME_HEK(cv)) : &PL_sv_undef; OUTPUT: RETVAL MODULE = B PACKAGE = B::HV PREFIX = Hv STRLEN HvFILL(hv) B::HV hv I32 HvRITER(hv) B::HV hv void HvARRAY(hv) B::HV hv PPCODE: if (HvUSEDKEYS(hv) > 0) { HE *he; SSize_t extend_size; (void)hv_iterinit(hv); /* 2*HvUSEDKEYS() should never be big enough to truncate or wrap */ assert(HvUSEDKEYS(hv) <= (SSize_t_MAX >> 1)); extend_size = (SSize_t)HvUSEDKEYS(hv) * 2; EXTEND(sp, extend_size); while ((he = hv_iternext(hv))) { if (HeSVKEY(he)) { mPUSHs(HeSVKEY(he)); } else if (HeKUTF8(he)) { PUSHs(newSVpvn_flags(HeKEY(he), HeKLEN(he), SVf_UTF8|SVs_TEMP)); } else { mPUSHp(HeKEY(he), HeKLEN(he)); } PUSHs(make_sv_object(aTHX_ HeVAL(he))); } } MODULE = B PACKAGE = B::HE PREFIX = He void HeVAL(he) B::HE he ALIAS: SVKEY_force = 1 PPCODE: PUSHs(make_sv_object(aTHX_ ix ? HeSVKEY_force(he) : HeVAL(he))); U32 HeHASH(he) B::HE he MODULE = B PACKAGE = B::RHE SV* HASH(h) B::RHE h CODE: RETVAL = newRV( (SV*)cophh_2hv(h, 0) ); OUTPUT: RETVAL #ifdef PadlistARRAY MODULE = B PACKAGE = B::PADLIST PREFIX = Padlist SSize_t PadlistMAX(padlist) B::PADLIST padlist ALIAS: B::PADNAMELIST::MAX = 0 CODE: PERL_UNUSED_VAR(ix); RETVAL = PadlistMAX(padlist); OUTPUT: RETVAL B::PADNAMELIST PadlistNAMES(padlist) B::PADLIST padlist void PadlistARRAY(padlist) B::PADLIST padlist PPCODE: if (PadlistMAX(padlist) >= 0) { dXSTARG; PAD **padp = PadlistARRAY(padlist); SSize_t i; sv_setiv(newSVrv(TARG, PadlistNAMES(padlist) ? "B::PADNAMELIST" : "B::NULL"), PTR2IV(PadlistNAMES(padlist))); XPUSHTARG; for (i = 1; i <= PadlistMAX(padlist); i++) XPUSHs(make_sv_object(aTHX_ (SV *)padp[i])); } void PadlistARRAYelt(padlist, idx) B::PADLIST padlist SSize_t idx PPCODE: if (idx < 0 || idx > PadlistMAX(padlist)) XPUSHs(make_sv_object(aTHX_ NULL)); else if (!idx) { PL_stack_sp--; PUSHMARK(PL_stack_sp-1); XS_B__PADLIST_NAMES(aTHX_ cv); return; } else XPUSHs(make_sv_object(aTHX_ (SV *)PadlistARRAY(padlist)[idx])); U32 PadlistREFCNT(padlist) B::PADLIST padlist CODE: PERL_UNUSED_VAR(padlist); RETVAL = PadlistREFCNT(padlist); OUTPUT: RETVAL #endif MODULE = B PACKAGE = B::PADNAMELIST PREFIX = Padnamelist void PadnamelistARRAY(pnl) B::PADNAMELIST pnl PPCODE: if (PadnamelistMAX(pnl) >= 0) { PADNAME **padp = PadnamelistARRAY(pnl); SSize_t i = 0; for (; i <= PadnamelistMAX(pnl); i++) { SV *rv = sv_newmortal(); sv_setiv(newSVrv(rv,padp[i] ? "B::PADNAME" : "B::SPECIAL"), PTR2IV(padp[i])); XPUSHs(rv); } } B::PADNAME PadnamelistARRAYelt(pnl, idx) B::PADNAMELIST pnl SSize_t idx CODE: if (idx < 0 || idx > PadnamelistMAX(pnl)) RETVAL = NULL; else RETVAL = PadnamelistARRAY(pnl)[idx]; OUTPUT: RETVAL MODULE = B PACKAGE = B::PADNAME PREFIX = Padname #define PN_type_ix \ sv_SVp | STRUCT_OFFSET(struct padname,xpadn_type_u.xpadn_typestash) #define PN_ourstash_ix \ sv_SVp | STRUCT_OFFSET(struct padname,xpadn_ourstash) #define PN_len_ix \ sv_U8p | STRUCT_OFFSET(struct padname,xpadn_len) #define PN_refcnt_ix \ sv_U32p | STRUCT_OFFSET(struct padname, xpadn_refcnt) #define PN_cop_seq_range_low_ix \ sv_U32p | STRUCT_OFFSET(struct padname, xpadn_low) #define PN_cop_seq_range_high_ix \ sv_U32p | STRUCT_OFFSET(struct padname, xpadn_high) #define PNL_refcnt_ix \ sv_U32p | STRUCT_OFFSET(struct padnamelist, xpadnl_refcnt) #define PL_id_ix \ sv_U32p | STRUCT_OFFSET(struct padlist, xpadl_id) #define PL_outid_ix \ sv_U32p | STRUCT_OFFSET(struct padlist, xpadl_outid) void PadnameTYPE(pn) B::PADNAME pn ALIAS: B::PADNAME::TYPE = PN_type_ix B::PADNAME::OURSTASH = PN_ourstash_ix B::PADNAME::LEN = PN_len_ix B::PADNAME::REFCNT = PN_refcnt_ix B::PADNAME::COP_SEQ_RANGE_LOW = PN_cop_seq_range_low_ix B::PADNAME::COP_SEQ_RANGE_HIGH = PN_cop_seq_range_high_ix B::PADNAMELIST::REFCNT = PNL_refcnt_ix B::PADLIST::id = PL_id_ix B::PADLIST::outid = PL_outid_ix PREINIT: char *ptr; SV *ret; PPCODE: ptr = (ix & 0xFFFF) + (char *)pn; switch ((U8)(ix >> 16)) { case (U8)(sv_SVp >> 16): ret = make_sv_object(aTHX_ *((SV **)ptr)); break; case (U8)(sv_U32p >> 16): ret = sv_2mortal(newSVuv(*((U32 *)ptr))); break; case (U8)(sv_U8p >> 16): ret = sv_2mortal(newSVuv(*((U8 *)ptr))); break; default: NOT_REACHED; } ST(0) = ret; XSRETURN(1); SV * PadnamePV(pn) B::PADNAME pn PREINIT: dXSTARG; PPCODE: PERL_UNUSED_ARG(RETVAL); sv_setpvn(TARG, PadnamePV(pn), PadnameLEN(pn)); SvUTF8_on(TARG); XPUSHTARG; BOOT: { /* Uses less memory than an ALIAS. */ GV *gv = gv_fetchpvs("B::PADNAME::TYPE", 1, SVt_PVGV); sv_setsv((SV *)gv_fetchpvs("B::PADNAME::SvSTASH",1,SVt_PVGV),(SV *)gv); sv_setsv((SV *)gv_fetchpvs("B::PADNAME::PROTOCV",1,SVt_PVGV),(SV *)gv); sv_setsv((SV *)gv_fetchpvs("B::PADNAME::PVX",1,SVt_PVGV), (SV *)gv_fetchpvs("B::PADNAME::PV" ,1,SVt_PVGV)); sv_setsv((SV *)gv_fetchpvs("B::PADNAME::PARENT_PAD_INDEX" ,1,SVt_PVGV), (SV *)gv_fetchpvs("B::PADNAME::COP_SEQ_RANGE_LOW",1, SVt_PVGV)); sv_setsv((SV *)gv_fetchpvs("B::PADNAME::PARENT_FAKELEX_FLAGS",1, SVt_PVGV), (SV *)gv_fetchpvs("B::PADNAME::COP_SEQ_RANGE_HIGH" ,1, SVt_PVGV)); } U32 PadnameFLAGS(pn) B::PADNAME pn CODE: RETVAL = PadnameFLAGS(pn); /* backward-compatibility hack, which should be removed if the flags field becomes large enough to hold SVf_FAKE (and PADNAMEt_OUTER should be renumbered to match SVf_FAKE) */ STATIC_ASSERT_STMT(SVf_FAKE >= 1<<(sizeof(PadnameFLAGS((B__PADNAME)NULL)) * 8)); if (PadnameOUTER(pn)) RETVAL |= SVf_FAKE; OUTPUT: RETVAL