1 #define PERL_NO_GET_CONTEXT
14 SV* ret = newRV_noinc((SV*)newAV());
16 int tm = 0, tref = 0, ts = 0, ta = 0, tas = 0;
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) {
23 AV* padlist = CvPADLIST(cv), *argav;
26 int i = 0, j, levelm, totm = 0, levelref, totref = 0;
27 int levels, tots = 0, levela, tota = 0, levelas, totas = 0;
34 continue; /* file-level scope. */
37 /* PerlIO_printf(Perl_debug_log, " no root?!\n"); */
38 continue; /* autoloading stub. */
40 do_gvgv_dump(0, Perl_debug_log, "GVGV::GV", CvGV(sv));
42 PerlIO_printf(Perl_debug_log, " busy\n");
45 svp = AvARRAY(padlist);
46 while (++i <= AvFILL(padlist)) { /* Depth. */
49 pad = AvARRAY((AV*)svp[i]);
51 if (!argav || (SV*)argav == &PL_sv_undef) {
52 PerlIO_printf(Perl_debug_log, " closure-template\n");
55 args = AvARRAY(argav);
56 levelm = levels = levelref = levelas = 0;
57 levela = sizeof(SV*) * (AvMAX(argav) + 1);
59 for (j = 0; j < AvFILL(argav); j++) {
61 PerlIO_printf(Perl_debug_log, " ref in args!\n");
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]);
70 for (j = 1; j < AvFILL((AV*)svp[1]); j++) { /* Vars. */
73 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
76 /* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
77 else if (SvTYPE(pad[j]) >= SVt_PVAV) {
78 if (!SvPADMY(pad[j])) {
80 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
84 else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
86 levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
90 PerlIO_printf(Perl_debug_log, " level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n",
91 i, levelref, levelm, levels, levela, levelas);
98 do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
100 if (AvFILL(padlist) > 1) {
101 PerlIO_printf(Perl_debug_log, " total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n",
102 totref, totm, tots, tota, totas);
112 PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);
118 #if defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \
119 || (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
120 # define mstat(str) dump_mstats(str)
122 # define mstat(str) \
123 PerlIO_printf(Perl_debug_log, "%s: perl not compiled with DEBUGGING_MSTATS\n",str);
126 #if defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \
127 || (defined(MYMALLOC) && !defined(PLAIN_MALLOC))
129 /* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
130 # define _NBUCKETS (2*8*IVSIZE+1)
134 perl_mstats_t buffer;
139 _fill_mstats(struct mstats_buffer *b, int level)
142 b->buffer.nfree = b->buf;
143 b->buffer.ntotal = b->buf + _NBUCKETS;
144 b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
145 b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
146 Zero(b->buf, (level ? 4*_NBUCKETS: 2*_NBUCKETS), unsigned long);
147 get_mstats(&(b->buffer), _NBUCKETS, level);
151 fill_mstats(SV *sv, int level)
156 croak("Cannot modify a readonly value");
157 SvGROW(sv, sizeof(struct mstats_buffer)+1);
158 _fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
159 SvCUR_set(sv, sizeof(struct mstats_buffer));
165 _mstats_to_hv(HV *hv, struct mstats_buffer *b, int level)
171 svp = hv_fetch(hv, "topbucket", 9, 1);
172 sv_setiv(*svp, b->buffer.topbucket);
174 svp = hv_fetch(hv, "topbucket_ev", 12, 1);
175 sv_setiv(*svp, b->buffer.topbucket_ev);
177 svp = hv_fetch(hv, "topbucket_odd", 13, 1);
178 sv_setiv(*svp, b->buffer.topbucket_odd);
180 svp = hv_fetch(hv, "totfree", 7, 1);
181 sv_setiv(*svp, b->buffer.totfree);
183 svp = hv_fetch(hv, "total", 5, 1);
184 sv_setiv(*svp, b->buffer.total);
186 svp = hv_fetch(hv, "total_chain", 11, 1);
187 sv_setiv(*svp, b->buffer.total_chain);
189 svp = hv_fetch(hv, "total_sbrk", 10, 1);
190 sv_setiv(*svp, b->buffer.total_sbrk);
192 svp = hv_fetch(hv, "sbrks", 5, 1);
193 sv_setiv(*svp, b->buffer.sbrks);
195 svp = hv_fetch(hv, "sbrk_good", 9, 1);
196 sv_setiv(*svp, b->buffer.sbrk_good);
198 svp = hv_fetch(hv, "sbrk_slack", 10, 1);
199 sv_setiv(*svp, b->buffer.sbrk_slack);
201 svp = hv_fetch(hv, "start_slack", 11, 1);
202 sv_setiv(*svp, b->buffer.start_slack);
204 svp = hv_fetch(hv, "sbrked_remains", 14, 1);
205 sv_setiv(*svp, b->buffer.sbrked_remains);
207 svp = hv_fetch(hv, "minbucket", 9, 1);
208 sv_setiv(*svp, b->buffer.minbucket);
210 svp = hv_fetch(hv, "nbuckets", 8, 1);
211 sv_setiv(*svp, b->buffer.nbuckets);
213 if (_NBUCKETS < b->buffer.nbuckets)
214 warn("FIXME: internal mstats buffer too short");
216 for (type = 0; type < (level ? 4 : 2); type++) {
220 static const char *types[4] = {
221 "free", "used", "mem_size", "available_size"
224 svp = hv_fetch(hv, types[type], strlen(types[type]), 1);
226 if (SvOK(*svp) && !(SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
227 croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
230 (void)SvUPGRADE(*svp, SVt_RV);
231 SvRV(*svp) = (SV*)av;
234 av = (AV*)SvRV(*svp);
236 av_extend(av, b->buffer.nbuckets - 1);
237 /* XXXX What is the official way to reduce the size of the array? */
243 p = b->buffer.ntotal;
244 p1 = b->buffer.nfree;
247 p = b->buffer.bucket_mem_size;
250 p = b->buffer.bucket_available_size;
253 for (i = 0; i < b->buffer.nbuckets; i++) {
254 svp = av_fetch(av, i, 1);
256 sv_setiv(*svp, p[i]-p1[i]);
258 sv_setuv(*svp, p[i]);
263 mstats_fillhash(SV *sv, int level)
265 struct mstats_buffer buf;
267 if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
268 croak("Not a hash reference");
269 _fill_mstats(&buf, level);
270 _mstats_to_hv((HV *)SvRV(sv), &buf, level);
273 mstats2hash(SV *sv, SV *rv, int level)
275 if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
276 croak("Not a hash reference");
278 croak("Undefined value when expecting mstats buffer");
279 if (SvCUR(sv) != sizeof(struct mstats_buffer))
280 croak("Wrong size for a value with a mstats buffer");
281 _mstats_to_hv((HV *)SvRV(rv), (struct mstats_buffer*)SvPVX(sv), level);
283 #else /* !( defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS) \ ) */
285 fill_mstats(SV *sv, int level)
287 croak("Cannot report mstats without Perl malloc");
290 mstats_fillhash(SV *sv, int level)
292 croak("Cannot report mstats without Perl malloc");
295 mstats2hash(SV *sv, SV *rv, int level)
297 croak("Cannot report mstats without Perl malloc");
299 #endif /* defined(PERL_DEBUGGING_MSTATS) || defined(DEBUGGING_MSTATS)... */
302 (SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV) \
303 ? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)
305 MODULE = Devel::Peek PACKAGE = Devel::Peek
308 mstat(str="Devel::Peek::mstat: ")
312 fill_mstats(SV *sv, int level = 0)
315 mstats_fillhash(SV *sv, int level = 0)
319 mstats2hash(SV *sv, SV *rv, int level = 0)
328 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
329 STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
330 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
331 I32 save_dumpindent = PL_dumpindent;
333 do_sv_dump(0, Perl_debug_log, sv, 0, lim, dumpop && SvTRUE(dumpop), pv_lim);
334 PL_dumpindent = save_dumpindent;
343 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", FALSE);
344 STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
345 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", FALSE);
346 I32 save_dumpindent = PL_dumpindent;
349 for (i=1; i<items; i++) {
350 PerlIO_printf(Perl_debug_log, "Elt No. %ld 0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
351 do_sv_dump(0, Perl_debug_log, ST(i), 0, lim, dumpop && SvTRUE(dumpop), pv_lim);
353 PL_dumpindent = save_dumpindent;
360 warn("dumpindent is %d", (int)PL_dumpindent);
362 op_dump(PL_main_root);
369 # PPCODE needed since otherwise sv_2mortal is inserted that will kill the value.
376 RETVAL = SvREFCNT_inc(sv);
380 # PPCODE needed since by default it is void
394 RETVAL = DeadCode(aTHX);
398 MODULE = Devel::Peek PACKAGE = Devel::Peek PREFIX = _