[p5sagit/p5-mst-13.2.git] / ext / Devel / Peek / Peek.xs

#define PERL_NO_GET_CONTEXT
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"

SV *
DeadCode(pTHX)
{
#ifdef PURIFY
    return Nullsv;
#else
    SV* sva;
    SV* sv, *dbg;
    SV* ret = newRV_noinc((SV*)newAV());
    register SV* svend;
    int tm = 0, tref = 0, ts = 0, ta = 0, tas = 0;

    for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
	svend = &sva[SvREFCNT(sva)];
	for (sv = sva + 1; sv < svend; ++sv) {
	    if (SvTYPE(sv) == SVt_PVCV) {
		CV *cv = (CV*)sv;
		AV* padlist = CvPADLIST(cv), *argav;
		SV** svp;
		SV** pad;
		int i = 0, j, levelm, totm = 0, levelref, totref = 0;
		int levels, tots = 0, levela, tota = 0, levelas, totas = 0;
		int dumpit = 0;

		if (CvXSUB(sv)) {
		    continue;		/* XSUB */
		}
		if (!CvGV(sv)) {
		    continue;		/* file-level scope. */
		}
		if (!CvROOT(cv)) {
		    /* PerlIO_printf(Perl_debug_log, "  no root?!\n"); */
		    continue;		/* autoloading stub. */
		}
		do_gvgv_dump(0, Perl_debug_log, "GVGV::GV", CvGV(sv));
		if (CvDEPTH(cv)) {
		    PerlIO_printf(Perl_debug_log, "  busy\n");
		    continue;
		}
		svp = AvARRAY(padlist);
		while (++i <= AvFILL(padlist)) { /* Depth. */
		    SV **args;
		    
		    pad = AvARRAY((AV*)svp[i]);
		    argav = (AV*)pad[0];
		    if (!argav || (SV*)argav == &PL_sv_undef) {
			PerlIO_printf(Perl_debug_log, "    closure-template\n");
			continue;
		    }
		    args = AvARRAY(argav);
		    levelm = levels = levelref = levelas = 0;
		    levela = sizeof(SV*) * (AvMAX(argav) + 1);
		    if (AvREAL(argav)) {
			for (j = 0; j < AvFILL(argav); j++) {
			    if (SvROK(args[j])) {
				PerlIO_printf(Perl_debug_log, "     ref in args!\n");
				levelref++;
			    }
			    /* else if (SvPOK(args[j]) && SvPVX(args[j])) { */
			    else if (SvTYPE(args[j]) >= SVt_PV && SvLEN(args[j])) {
				levelas += SvLEN(args[j])/SvREFCNT(args[j]);
			    }
			}
		    }
		    for (j = 1; j < AvFILL((AV*)svp[1]); j++) {	/* Vars. */
			if (SvROK(pad[j])) {
			    levelref++;
			    do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
			    dumpit = 1;
			}
			/* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
			else if (SvTYPE(pad[j]) >= SVt_PVAV) {
			    if (!SvPADMY(pad[j])) {
				levelref++;
				do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
				dumpit = 1;
			    }
			}
			else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
			    int db_len = SvLEN(pad[j]);
			    SV *db_sv = pad[j];
			    levels++;
			    levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
				/* Dump(pad[j],4); */
			}
		    }
		    PerlIO_printf(Perl_debug_log, "    level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n", 
			    i, levelref, levelm, levels, levela, levelas);
		    totm += levelm;
		    tota += levela;
		    totas += levelas;
		    tots += levels;
		    totref += levelref;
		    if (dumpit)
			do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
		}
		if (AvFILL(padlist) > 1) {
		    PerlIO_printf(Perl_debug_log, "  total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n", 
			    totref, totm, tots, tota, totas);
		}
		tref += totref;
		tm += totm;
		ts += tots;
		ta += tota;
		tas += totas;
	    }
	}
    }
    PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);

    return ret;
#endif /* !PURIFY */
}

#if defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \
	|| (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
#   define mstat(str) dump_mstats(str)
#else
#   define mstat(str) \
	PerlIO_printf(Perl_debug_log, "%s: perl not compiled with DEBUGGING_MSTATS\n",str);
#endif

#if defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \
	|| (defined(MYMALLOC) && !defined(PLAIN_MALLOC))

/* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
#  define _NBUCKETS (2*8*IVSIZE+1)

struct mstats_buffer 
{
    perl_mstats_t buffer;
    UV buf[_NBUCKETS*4];
};

void
_fill_mstats(struct mstats_buffer *b, int level)
{
    b->buffer.nfree  = b->buf;
    b->buffer.ntotal = b->buf + _NBUCKETS;
    b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
    b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
    Zero(b->buf, (level ? 4*_NBUCKETS: 2*_NBUCKETS), unsigned long);
    get_mstats(&(b->buffer), _NBUCKETS, level);
}

void
fill_mstats(SV *sv, int level)
{
    int nbuckets;
    struct mstats_buffer buf;

    if (SvREADONLY(sv))
	croak("Cannot modify a readonly value");
    SvGROW(sv, sizeof(struct mstats_buffer)+1);
    _fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
    SvCUR_set(sv, sizeof(struct mstats_buffer));
    *SvEND(sv) = '\0';
    SvPOK_only(sv);
}

void
_mstats_to_hv(HV *hv, struct mstats_buffer *b, int level)
{
    SV **svp;
    int type;

    svp = hv_fetch(hv, "topbucket", 9, 1);
    sv_setiv(*svp, b->buffer.topbucket);

    svp = hv_fetch(hv, "topbucket_ev", 12, 1);
    sv_setiv(*svp, b->buffer.topbucket_ev);

    svp = hv_fetch(hv, "topbucket_odd", 13, 1);
    sv_setiv(*svp, b->buffer.topbucket_odd);

    svp = hv_fetch(hv, "totfree", 7, 1);
    sv_setiv(*svp, b->buffer.totfree);

    svp = hv_fetch(hv, "total", 5, 1);
    sv_setiv(*svp, b->buffer.total);

    svp = hv_fetch(hv, "total_chain", 11, 1);
    sv_setiv(*svp, b->buffer.total_chain);

    svp = hv_fetch(hv, "total_sbrk", 10, 1);
    sv_setiv(*svp, b->buffer.total_sbrk);

    svp = hv_fetch(hv, "sbrks", 5, 1);
    sv_setiv(*svp, b->buffer.sbrks);

    svp = hv_fetch(hv, "sbrk_good", 9, 1);
    sv_setiv(*svp, b->buffer.sbrk_good);

    svp = hv_fetch(hv, "sbrk_slack", 10, 1);
    sv_setiv(*svp, b->buffer.sbrk_slack);

    svp = hv_fetch(hv, "start_slack", 11, 1);
    sv_setiv(*svp, b->buffer.start_slack);

    svp = hv_fetch(hv, "sbrked_remains", 14, 1);
    sv_setiv(*svp, b->buffer.sbrked_remains);
    
    svp = hv_fetch(hv, "minbucket", 9, 1);
    sv_setiv(*svp, b->buffer.minbucket);
    
    svp = hv_fetch(hv, "nbuckets", 8, 1);
    sv_setiv(*svp, b->buffer.nbuckets);

    if (_NBUCKETS < b->buffer.nbuckets) 
	warn("FIXME: internal mstats buffer too short");
    
    for (type = 0; type < (level ? 4 : 2); type++) {
	UV *p, *p1;
	AV *av;
	int i;
	static const char *types[4] = { 
	    "free", "used", "mem_size", "available_size"    
	};

	svp = hv_fetch(hv, types[type], strlen(types[type]), 1);

	if (SvOK(*svp) && !(SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
	    croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
	if (!SvOK(*svp)) {
	    av = newAV();
	    SvUPGRADE(*svp, SVt_RV);
	    SvRV(*svp) = (SV*)av;
	    SvROK_on(*svp);
	} else
	    av = (AV*)SvRV(*svp);

	av_extend(av, b->buffer.nbuckets - 1);
	/* XXXX What is the official way to reduce the size of the array? */
	switch (type) {
	case 0:
	    p = b->buffer.nfree;
	    break;
	case 1:
	    p = b->buffer.ntotal;
	    p1 = b->buffer.nfree;
	    break;
	case 2:
	    p = b->buffer.bucket_mem_size;
	    break;
	case 3:
	    p = b->buffer.bucket_available_size;
	    break;
	}
	for (i = 0; i < b->buffer.nbuckets; i++) {
	    svp = av_fetch(av, i, 1);
	    if (type == 1)
		sv_setiv(*svp, p[i]-p1[i]);
	    else
		sv_setuv(*svp, p[i]);
	}
    }
}
void
mstats_fillhash(SV *sv, int level)
{
    struct mstats_buffer buf;

    if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
	croak("Not a hash reference");
    _fill_mstats(&buf, level);
    _mstats_to_hv((HV *)SvRV(sv), &buf, level);
}
void
mstats2hash(SV *sv, SV *rv, int level)
{
    if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
	croak("Not a hash reference");
    if (!SvPOK(sv))
	croak("Undefined value when expecting mstats buffer");
    if (SvCUR(sv) != sizeof(struct mstats_buffer))
	croak("Wrong size for a value with a mstats buffer");
    _mstats_to_hv((HV *)SvRV(rv), (struct mstats_buffer*)SvPVX(sv), level);
}
#else	/* !( defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \ ) */ 
void
fill_mstats(SV *sv, int level)
{
    croak("Cannot report mstats without Perl malloc");
}
void
mstats_fillhash(SV *sv, int level)
{
    croak("Cannot report mstats without Perl malloc");
}
void
mstats2hash(SV *sv, SV *rv, int level)
{
    croak("Cannot report mstats without Perl malloc");
}
#endif	/* defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS)... */ 

#define _CvGV(cv)					\
	(SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV)	\
	 ? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)

MODULE = Devel::Peek		PACKAGE = Devel::Peek

void
mstat(str="Devel::Peek::mstat: ")
char *str

void
fill_mstats(SV *sv, int level = 0)

void
mstats_fillhash(SV *sv, int level = 0)
    PROTOTYPE: \%;$

void
mstats2hash(SV *sv, SV *rv, int level = 0)
    PROTOTYPE: $\%;$

void
Dump(sv,lim=4)
SV *	sv
I32	lim
PPCODE:
{
    SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
    STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
    SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
    I32 save_dumpindent = PL_dumpindent;
    PL_dumpindent = 2;
    do_sv_dump(0, Perl_debug_log, sv, 0, lim, dumpop && SvTRUE(dumpop), pv_lim);
    PL_dumpindent = save_dumpindent;
}

void
DumpArray(lim,...)
I32	lim
PPCODE:
{
    long i;
    SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
    STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
    SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
    I32 save_dumpindent = PL_dumpindent;
    PL_dumpindent = 2;

    for (i=1; i<items; i++) {
	PerlIO_printf(Perl_debug_log, "Elt No. %ld  0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
	do_sv_dump(0, Perl_debug_log, ST(i), 0, lim, dumpop && SvTRUE(dumpop), pv_lim);
    }
    PL_dumpindent = save_dumpindent;
}

void
DumpProg()
PPCODE:
{
    warn("dumpindent is %d", (int)PL_dumpindent);
    if (PL_main_root)
	op_dump(PL_main_root);
}

I32
SvREFCNT(sv)
SV *	sv

# PPCODE needed since otherwise sv_2mortal is inserted that will kill the value.

SV *
SvREFCNT_inc(sv)
SV *	sv
PPCODE:
{
    RETVAL = SvREFCNT_inc(sv);
    PUSHs(RETVAL);
}

# PPCODE needed since by default it is void

SV *
SvREFCNT_dec(sv)
SV *	sv
PPCODE:
{
    SvREFCNT_dec(sv);
    PUSHs(sv);
}

SV *
DeadCode()
CODE:
    RETVAL = DeadCode(aTHX);
OUTPUT:
    RETVAL

MODULE = Devel::Peek		PACKAGE = Devel::Peek	PREFIX = _

SV *
_CvGV(cv)
    SV *cv
Commit	Line	Data
c5be433b	1	#define PERL_NO_GET_CONTEXT
3967c732	2	#include "EXTERN.h"
	3	#include "perl.h"
	4	#include "XSUB.h"
	5
3967c732	6	SV *
cea2e8a9	7	DeadCode(pTHX)
3967c732	8	{
8ecf7187	9	#ifdef PURIFY
	10	return Nullsv;
	11	#else
3967c732	12	SV* sva;
	13	SV* sv, *dbg;
	14	SV* ret = newRV_noinc((SV*)newAV());
	15	register SV* svend;
	16	int tm = 0, tref = 0, ts = 0, ta = 0, tas = 0;
	17
	18	for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
	19	svend = &sva[SvREFCNT(sva)];
	20	for (sv = sva + 1; sv < svend; ++sv) {
	21	if (SvTYPE(sv) == SVt_PVCV) {
	22	CV cv = (CV)sv;
	23	AV* padlist = CvPADLIST(cv), *argav;
	24	SV** svp;
	25	SV** pad;
	26	int i = 0, j, levelm, totm = 0, levelref, totref = 0;
	27	int levels, tots = 0, levela, tota = 0, levelas, totas = 0;
	28	int dumpit = 0;
	29
	30	if (CvXSUB(sv)) {
	31	continue; /* XSUB */
	32	}
	33	if (!CvGV(sv)) {
	34	continue; /* file-level scope. */
	35	}
	36	if (!CvROOT(cv)) {
bf49b057	37	/* PerlIO_printf(Perl_debug_log, " no root?!\n"); */
3967c732	38	continue; /* autoloading stub. */
3967c732	39	}
bf49b057	40	do_gvgv_dump(0, Perl_debug_log, "GVGV::GV", CvGV(sv));
3967c732	41	if (CvDEPTH(cv)) {
bf49b057	42	PerlIO_printf(Perl_debug_log, " busy\n");
3967c732	43	continue;
	44	}
	45	svp = AvARRAY(padlist);
	46	while (++i <= AvFILL(padlist)) { /* Depth. */
	47	SV **args;
	48
	49	pad = AvARRAY((AV*)svp[i]);
	50	argav = (AV*)pad[0];
	51	if (!argav \|\| (SV*)argav == &PL_sv_undef) {
bf49b057	52	PerlIO_printf(Perl_debug_log, " closure-template\n");
3967c732	53	continue;
	54	}
	55	args = AvARRAY(argav);
	56	levelm = levels = levelref = levelas = 0;
	57	levela = sizeof(SV) (AvMAX(argav) + 1);
	58	if (AvREAL(argav)) {
	59	for (j = 0; j < AvFILL(argav); j++) {
	60	if (SvROK(args[j])) {
bf49b057	61	PerlIO_printf(Perl_debug_log, " ref in args!\n");
3967c732	62	levelref++;
	63	}
	64	/* else if (SvPOK(args[j]) && SvPVX(args[j])) { */
	65	else if (SvTYPE(args[j]) >= SVt_PV && SvLEN(args[j])) {
	66	levelas += SvLEN(args[j])/SvREFCNT(args[j]);
	67	}
	68	}
	69	}
	70	for (j = 1; j < AvFILL((AV)svp[1]); j++) { / Vars. */
	71	if (SvROK(pad[j])) {
	72	levelref++;
bf49b057	73	do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
3967c732	74	dumpit = 1;
	75	}
	76	/* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
	77	else if (SvTYPE(pad[j]) >= SVt_PVAV) {
	78	if (!SvPADMY(pad[j])) {
	79	levelref++;
bf49b057	80	do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
3967c732	81	dumpit = 1;
	82	}
	83	}
	84	else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
	85	int db_len = SvLEN(pad[j]);
	86	SV *db_sv = pad[j];
	87	levels++;
	88	levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
	89	/* Dump(pad[j],4); */
	90	}
	91	}
bf49b057	92	PerlIO_printf(Perl_debug_log, " level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n",
3967c732	93	i, levelref, levelm, levels, levela, levelas);
	94	totm += levelm;
	95	tota += levela;
	96	totas += levelas;
	97	tots += levels;
	98	totref += levelref;
	99	if (dumpit)
bf49b057	100	do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
3967c732	101	}
3967c732	102	if (AvFILL(padlist) > 1) {
bf49b057	103	PerlIO_printf(Perl_debug_log, " total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n",
3967c732	104	totref, totm, tots, tota, totas);
	105	}
	106	tref += totref;
	107	tm += totm;
	108	ts += tots;
	109	ta += tota;
	110	tas += totas;
	111	}
	112	}
	113	}
bf49b057	114	PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);
3967c732	115
3967c732	116	return ret;
3967c732	117	#endif /* !PURIFY */
8ecf7187	118	}
3967c732	119
df1e65fb	120	#if defined(PERL_DEBUGGING_MSTATS) \|\| defined(DEBUGGING_MSTATS) \
df1e65fb	121	\|\| (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
3967c732	122	# define mstat(str) dump_mstats(str)
	123	#else
	124	# define mstat(str) \
bf49b057	125	PerlIO_printf(Perl_debug_log, "%s: perl not compiled with DEBUGGING_MSTATS\n",str);
3967c732	126	#endif
3967c732	127
22d4bb9c	128	#if defined(PERL_DEBUGGING_MSTATS) \|\| defined(DEBUGGING_MSTATS) \
	129	\|\| (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
	130
	131	/* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
	132	# define _NBUCKETS (28IVSIZE+1)
	133
	134	struct mstats_buffer
	135	{
	136	perl_mstats_t buffer;
	137	UV buf[_NBUCKETS*4];
	138	};
	139
	140	void
	141	_fill_mstats(struct mstats_buffer *b, int level)
	142	{
	143	b->buffer.nfree = b->buf;
	144	b->buffer.ntotal = b->buf + _NBUCKETS;
	145	b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
	146	b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
	147	Zero(b->buf, (level ? 4_NBUCKETS: 2_NBUCKETS), unsigned long);
	148	get_mstats(&(b->buffer), _NBUCKETS, level);
	149	}
	150
	151	void
	152	fill_mstats(SV *sv, int level)
	153	{
	154	int nbuckets;
	155	struct mstats_buffer buf;
	156
	157	if (SvREADONLY(sv))
	158	croak("Cannot modify a readonly value");
	159	SvGROW(sv, sizeof(struct mstats_buffer)+1);
	160	_fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
	161	SvCUR_set(sv, sizeof(struct mstats_buffer));
	162	*SvEND(sv) = '\0';
	163	SvPOK_only(sv);
	164	}
	165
	166	void
	167	_mstats_to_hv(HV hv, struct mstats_buffer b, int level)
	168	{
	169	SV **svp;
	170	int type;
	171
	172	svp = hv_fetch(hv, "topbucket", 9, 1);
	173	sv_setiv(*svp, b->buffer.topbucket);
	174
	175	svp = hv_fetch(hv, "topbucket_ev", 12, 1);
	176	sv_setiv(*svp, b->buffer.topbucket_ev);
	177
	178	svp = hv_fetch(hv, "topbucket_odd", 13, 1);
	179	sv_setiv(*svp, b->buffer.topbucket_odd);
	180
	181	svp = hv_fetch(hv, "totfree", 7, 1);
	182	sv_setiv(*svp, b->buffer.totfree);
	183
	184	svp = hv_fetch(hv, "total", 5, 1);
	185	sv_setiv(*svp, b->buffer.total);
	186
	187	svp = hv_fetch(hv, "total_chain", 11, 1);
	188	sv_setiv(*svp, b->buffer.total_chain);
	189
	190	svp = hv_fetch(hv, "total_sbrk", 10, 1);
	191	sv_setiv(*svp, b->buffer.total_sbrk);
192
193	svp = hv_fetch(hv, "sbrks", 5, 1);
194	sv_setiv(*svp, b->buffer.sbrks);
195
196	svp = hv_fetch(hv, "sbrk_good", 9, 1);
197	sv_setiv(*svp, b->buffer.sbrk_good);
198
199	svp = hv_fetch(hv, "sbrk_slack", 10, 1);
200	sv_setiv(*svp, b->buffer.sbrk_slack);
201
202	svp = hv_fetch(hv, "start_slack", 11, 1);
203	sv_setiv(*svp, b->buffer.start_slack);
204
205	svp = hv_fetch(hv, "sbrked_remains", 14, 1);
206	sv_setiv(*svp, b->buffer.sbrked_remains);
207
208	svp = hv_fetch(hv, "minbucket", 9, 1);
209	sv_setiv(*svp, b->buffer.minbucket);
210
211	svp = hv_fetch(hv, "nbuckets", 8, 1);
212	sv_setiv(*svp, b->buffer.nbuckets);
213
214	if (_NBUCKETS < b->buffer.nbuckets)
215	warn("FIXME: internal mstats buffer too short");
216
217	for (type = 0; type < (level ? 4 : 2); type++) {
218	UV p, p1;
219	AV *av;
220	int i;
221	static const char *types[4] = {
222	"free", "used", "mem_size", "available_size"
223	};
224
225	svp = hv_fetch(hv, types[type], strlen(types[type]), 1);
226
227	if (SvOK(svp) && !(SvROK(svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
228	croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
229	if (!SvOK(*svp)) {
230	av = newAV();
231	SvUPGRADE(*svp, SVt_RV);
232	SvRV(svp) = (SV)av;
233	SvROK_on(*svp);
234	} else
235	av = (AV)SvRV(svp);
236
237	av_extend(av, b->buffer.nbuckets - 1);
238	/* XXXX What is the official way to reduce the size of the array? */
239	switch (type) {
240	case 0:
241	p = b->buffer.nfree;
242	break;
243	case 1:
244	p = b->buffer.ntotal;
245	p1 = b->buffer.nfree;
246	break;
247	case 2:
248	p = b->buffer.bucket_mem_size;
249	break;
250	case 3:
251	p = b->buffer.bucket_available_size;
252	break;
253	}
254	for (i = 0; i < b->buffer.nbuckets; i++) {
255	svp = av_fetch(av, i, 1);
256	if (type == 1)
257	sv_setiv(*svp, p[i]-p1[i]);
258	else
259	sv_setuv(*svp, p[i]);
260	}
261	}
262	}
263	void
264	mstats_fillhash(SV *sv, int level)
265	{
266	struct mstats_buffer buf;
267
268	if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
269	croak("Not a hash reference");
270	_fill_mstats(&buf, level);
271	_mstats_to_hv((HV *)SvRV(sv), &buf, level);
272	}
273	void
274	mstats2hash(SV sv, SV rv, int level)
275	{
276	if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
277	croak("Not a hash reference");
278	if (!SvPOK(sv))
279	croak("Undefined value when expecting mstats buffer");
280	if (SvCUR(sv) != sizeof(struct mstats_buffer))
281	croak("Wrong size for a value with a mstats buffer");
282	_mstats_to_hv((HV )SvRV(rv), (struct mstats_buffer)SvPVX(sv), level);
283	}
284	#else /* !( defined(PERL_DEBUGGING_MSTATS) \|\| defined(DEBUGGING_MSTATS) \ ) */
285	void
286	fill_mstats(SV *sv, int level)
287	{
288	croak("Cannot report mstats without Perl malloc");
289	}
290	void
291	mstats_fillhash(SV *sv, int level)
292	{
293	croak("Cannot report mstats without Perl malloc");
294	}
295	void
296	mstats2hash(SV sv, SV rv, int level)
297	{
298	croak("Cannot report mstats without Perl malloc");
299	}
300	#endif /* defined(PERL_DEBUGGING_MSTATS) \|\| defined(DEBUGGING_MSTATS)... */
301
83ee9e09	302	#define _CvGV(cv) \
83ee9e09	303	(SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV) \
ee8c7f54	304	? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)
83ee9e09	305
3967c732	306	MODULE = Devel::Peek PACKAGE = Devel::Peek
	307
	308	void
	309	mstat(str="Devel::Peek::mstat: ")
	310	char *str
	311
	312	void
22d4bb9c	313	fill_mstats(SV *sv, int level = 0)
	314
	315	void
	316	mstats_fillhash(SV *sv, int level = 0)
	317	PROTOTYPE: \%;$
	318
	319	void
	320	mstats2hash(SV sv, SV rv, int level = 0)
	321	PROTOTYPE: $\%;$
	322
	323	void
3967c732	324	Dump(sv,lim=4)
	325	SV * sv
	326	I32 lim
	327	PPCODE:
	328	{
	329	SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
	330	STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
	331	SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
	332	I32 save_dumpindent = PL_dumpindent;
	333	PL_dumpindent = 2;
bf49b057	334	do_sv_dump(0, Perl_debug_log, sv, 0, lim, dumpop && SvTRUE(dumpop), pv_lim);
3967c732	335	PL_dumpindent = save_dumpindent;
	336	}
	337
	338	void
	339	DumpArray(lim,...)
	340	I32 lim
	341	PPCODE:
	342	{
	343	long i;
	344	SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
	345	STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
	346	SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
	347	I32 save_dumpindent = PL_dumpindent;
	348	PL_dumpindent = 2;
	349
	350	for (i=1; i<items; i++) {
7b0972df	351	PerlIO_printf(Perl_debug_log, "Elt No. %ld 0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
bf49b057	352	do_sv_dump(0, Perl_debug_log, ST(i), 0, lim, dumpop && SvTRUE(dumpop), pv_lim);
3967c732	353	}
	354	PL_dumpindent = save_dumpindent;
	355	}
	356
	357	void
	358	DumpProg()
	359	PPCODE:
	360	{
22d4bb9c	361	warn("dumpindent is %d", (int)PL_dumpindent);
3967c732	362	if (PL_main_root)
	363	op_dump(PL_main_root);
	364	}
	365
	366	I32
	367	SvREFCNT(sv)
	368	SV * sv
	369
	370	# PPCODE needed since otherwise sv_2mortal is inserted that will kill the value.
	371
	372	SV *
	373	SvREFCNT_inc(sv)
	374	SV * sv
	375	PPCODE:
	376	{
	377	RETVAL = SvREFCNT_inc(sv);
	378	PUSHs(RETVAL);
	379	}
	380
	381	# PPCODE needed since by default it is void
	382
	383	SV *
	384	SvREFCNT_dec(sv)
	385	SV * sv
	386	PPCODE:
	387	{
	388	SvREFCNT_dec(sv);
	389	PUSHs(sv);
	390	}
	391
	392	SV *
	393	DeadCode()
cea2e8a9	394	CODE:
	395	RETVAL = DeadCode(aTHX);
	396	OUTPUT:
	397	RETVAL
83ee9e09	398
	399	MODULE = Devel::Peek PACKAGE = Devel::Peek PREFIX = _
	400
	401	SV *
	402	_CvGV(cv)
	403	SV *cv