1 #define PERL_NO_GET_CONTEXT
7 _runops_debug(int flag)
10 const bool d = PL_runops == Perl_runops_debug;
13 PL_runops = flag ? Perl_runops_debug : Perl_runops_standard;
25 SV* ret = newRV_noinc((SV*)newAV());
27 int tm = 0, tref = 0, ts = 0, ta = 0, tas = 0;
29 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
30 svend = &sva[SvREFCNT(sva)];
31 for (sv = sva + 1; sv < svend; ++sv) {
32 if (SvTYPE(sv) == SVt_PVCV) {
34 AV* padlist = CvPADLIST(cv), *argav;
37 int i = 0, j, levelm, totm = 0, levelref, totref = 0;
38 int levels, tots = 0, levela, tota = 0, levelas, totas = 0;
45 continue; /* file-level scope. */
48 /* PerlIO_printf(Perl_debug_log, " no root?!\n"); */
49 continue; /* autoloading stub. */
51 do_gvgv_dump(0, Perl_debug_log, "GVGV::GV", CvGV(sv));
53 PerlIO_printf(Perl_debug_log, " busy\n");
56 svp = AvARRAY(padlist);
57 while (++i <= AvFILL(padlist)) { /* Depth. */
60 pad = AvARRAY((AV*)svp[i]);
62 if (!argav || (SV*)argav == &PL_sv_undef) {
63 PerlIO_printf(Perl_debug_log, " closure-template\n");
66 args = AvARRAY(argav);
67 levelm = levels = levelref = levelas = 0;
68 levela = sizeof(SV*) * (AvMAX(argav) + 1);
70 for (j = 0; j < AvFILL(argav); j++) {
72 PerlIO_printf(Perl_debug_log, " ref in args!\n");
75 /* else if (SvPOK(args[j]) && SvPVX(args[j])) { */
76 else if (SvTYPE(args[j]) >= SVt_PV && SvLEN(args[j])) {
77 levelas += SvLEN(args[j])/SvREFCNT(args[j]);
81 for (j = 1; j < AvFILL((AV*)svp[1]); j++) { /* Vars. */
84 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
87 /* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
88 else if (SvTYPE(pad[j]) >= SVt_PVAV) {
89 if (!SvPADMY(pad[j])) {
91 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
95 else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
97 levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
101 PerlIO_printf(Perl_debug_log, " level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n",
102 i, levelref, levelm, levels, levela, levelas);
109 do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
111 if (AvFILL(padlist) > 1) {
112 PerlIO_printf(Perl_debug_log, " total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n",
113 totref, totm, tots, tota, totas);
123 PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);
129 #if defined(MYMALLOC)
130 # define mstat(str) dump_mstats(str)
132 # define mstat(str) \
133 PerlIO_printf(Perl_debug_log, "%s: perl not compiled with MYMALLOC\n",str);
136 #if defined(MYMALLOC)
138 /* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
139 # define _NBUCKETS (2*8*IVSIZE+1)
143 perl_mstats_t buffer;
148 _fill_mstats(struct mstats_buffer *b, int level)
151 b->buffer.nfree = b->buf;
152 b->buffer.ntotal = b->buf + _NBUCKETS;
153 b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
154 b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
155 Zero(b->buf, (level ? 4*_NBUCKETS: 2*_NBUCKETS), unsigned long);
156 get_mstats(&(b->buffer), _NBUCKETS, level);
160 fill_mstats(SV *sv, int level)
165 croak("Cannot modify a readonly value");
166 SvGROW(sv, sizeof(struct mstats_buffer)+1);
167 _fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
168 SvCUR_set(sv, sizeof(struct mstats_buffer));
174 _mstats_to_hv(HV *hv, const struct mstats_buffer *b, int level)
180 svp = hv_fetch(hv, "topbucket", 9, 1);
181 sv_setiv(*svp, b->buffer.topbucket);
183 svp = hv_fetch(hv, "topbucket_ev", 12, 1);
184 sv_setiv(*svp, b->buffer.topbucket_ev);
186 svp = hv_fetch(hv, "topbucket_odd", 13, 1);
187 sv_setiv(*svp, b->buffer.topbucket_odd);
189 svp = hv_fetch(hv, "totfree", 7, 1);
190 sv_setiv(*svp, b->buffer.totfree);
192 svp = hv_fetch(hv, "total", 5, 1);
193 sv_setiv(*svp, b->buffer.total);
195 svp = hv_fetch(hv, "total_chain", 11, 1);
196 sv_setiv(*svp, b->buffer.total_chain);
198 svp = hv_fetch(hv, "total_sbrk", 10, 1);
199 sv_setiv(*svp, b->buffer.total_sbrk);
201 svp = hv_fetch(hv, "sbrks", 5, 1);
202 sv_setiv(*svp, b->buffer.sbrks);
204 svp = hv_fetch(hv, "sbrk_good", 9, 1);
205 sv_setiv(*svp, b->buffer.sbrk_good);
207 svp = hv_fetch(hv, "sbrk_slack", 10, 1);
208 sv_setiv(*svp, b->buffer.sbrk_slack);
210 svp = hv_fetch(hv, "start_slack", 11, 1);
211 sv_setiv(*svp, b->buffer.start_slack);
213 svp = hv_fetch(hv, "sbrked_remains", 14, 1);
214 sv_setiv(*svp, b->buffer.sbrked_remains);
216 svp = hv_fetch(hv, "minbucket", 9, 1);
217 sv_setiv(*svp, b->buffer.minbucket);
219 svp = hv_fetch(hv, "nbuckets", 8, 1);
220 sv_setiv(*svp, b->buffer.nbuckets);
222 if (_NBUCKETS < b->buffer.nbuckets)
223 warn("FIXME: internal mstats buffer too short");
225 for (type = 0; type < (level ? 4 : 2); type++) {
226 UV *p = 0, *p1 = 0, i;
228 static const char *types[4] = {
229 "free", "used", "mem_size", "available_size"
232 svp = hv_fetch(hv, types[type], strlen(types[type]), 1);
234 if (SvOK(*svp) && !(SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
235 croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
238 (void)SvUPGRADE(*svp, SVt_RV);
239 SvRV_set(*svp, (SV*)av);
242 av = (AV*)SvRV(*svp);
244 av_extend(av, b->buffer.nbuckets - 1);
245 /* XXXX What is the official way to reduce the size of the array? */
251 p = b->buffer.ntotal;
252 p1 = b->buffer.nfree;
255 p = b->buffer.bucket_mem_size;
258 p = b->buffer.bucket_available_size;
261 for (i = 0; i < b->buffer.nbuckets; i++) {
262 svp = av_fetch(av, i, 1);
264 sv_setiv(*svp, p[i]-p1[i]);
266 sv_setuv(*svp, p[i]);
272 mstats_fillhash(SV *sv, int level)
274 struct mstats_buffer buf;
276 if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
277 croak("Not a hash reference");
278 _fill_mstats(&buf, level);
279 _mstats_to_hv((HV *)SvRV(sv), &buf, level);
283 mstats2hash(SV *sv, SV *rv, int level)
285 if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
286 croak("Not a hash reference");
288 croak("Undefined value when expecting mstats buffer");
289 if (SvCUR(sv) != sizeof(struct mstats_buffer))
290 croak("Wrong size for a value with a mstats buffer");
291 _mstats_to_hv((HV *)SvRV(rv), (struct mstats_buffer*)SvPVX(sv), level);
293 #else /* defined(MYMALLOC) */
295 fill_mstats(SV *sv, int level)
297 croak("Cannot report mstats without Perl malloc");
301 mstats_fillhash(SV *sv, int level)
303 croak("Cannot report mstats without Perl malloc");
307 mstats2hash(SV *sv, SV *rv, int level)
309 croak("Cannot report mstats without Perl malloc");
311 #endif /* defined(MYMALLOC) */
314 (SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV) \
315 ? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)
317 MODULE = Devel::Peek PACKAGE = Devel::Peek
320 mstat(str="Devel::Peek::mstat: ")
324 fill_mstats(SV *sv, int level = 0)
327 mstats_fillhash(SV *sv, int level = 0)
331 mstats2hash(SV *sv, SV *rv, int level = 0)
340 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", 0);
341 const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
342 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", 0);
343 const U16 save_dumpindent = PL_dumpindent;
345 do_sv_dump(0, Perl_debug_log, sv, 0, lim,
346 (bool)(dumpop && SvTRUE(dumpop)), pv_lim);
347 PL_dumpindent = save_dumpindent;
356 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", 0);
357 const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
358 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", 0);
359 const U16 save_dumpindent = PL_dumpindent;
362 for (i=1; i<items; i++) {
363 PerlIO_printf(Perl_debug_log, "Elt No. %ld 0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
364 do_sv_dump(0, Perl_debug_log, ST(i), 0, lim,
365 (bool)(dumpop && SvTRUE(dumpop)), pv_lim);
367 PL_dumpindent = save_dumpindent;
374 warn("dumpindent is %d", (int)PL_dumpindent);
376 op_dump(PL_main_root);
383 # PPCODE needed since otherwise sv_2mortal is inserted that will kill the value.
390 RETVAL = SvREFCNT_inc(sv);
394 # PPCODE needed since by default it is void
408 RETVAL = DeadCode(aTHX);
412 MODULE = Devel::Peek PACKAGE = Devel::Peek PREFIX = _
419 _runops_debug(int flag = -1)