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) {
38 int i = 0, j, levelm, totm = 0, levelref, totref = 0;
39 int levels, tots = 0, levela, tota = 0, levelas, totas = 0;
46 continue; /* file-level scope. */
49 /* PerlIO_printf(Perl_debug_log, " no root?!\n"); */
50 continue; /* autoloading stub. */
52 do_gvgv_dump(0, Perl_debug_log, "GVGV::GV", CvGV(sv));
54 PerlIO_printf(Perl_debug_log, " busy\n");
57 padlist = CvPADLIST(cv);
58 svp = (SV**) PadlistARRAY(padlist);
59 while (++i <= PadlistMAX(padlist)) { /* Depth. */
62 if (!svp[i]) continue;
63 pad = AvARRAY((AV*)svp[i]);
65 if (!argav || (SV*)argav == &PL_sv_undef) {
66 PerlIO_printf(Perl_debug_log, " closure-template\n");
69 args = AvARRAY(argav);
70 levelm = levels = levelref = levelas = 0;
71 levela = sizeof(SV*) * (AvMAX(argav) + 1);
73 for (j = 0; j < AvFILL(argav); j++) {
75 PerlIO_printf(Perl_debug_log, " ref in args!\n");
78 /* else if (SvPOK(args[j]) && SvPVX(args[j])) { */
79 else if (SvTYPE(args[j]) >= SVt_PV && SvLEN(args[j])) {
80 levelas += SvLEN(args[j])/SvREFCNT(args[j]);
84 for (j = 1; j < AvFILL((AV*)svp[1]); j++) { /* Vars. */
85 if (!pad[j]) continue;
88 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
91 /* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
92 else if (SvTYPE(pad[j]) >= SVt_PVAV) {
93 if (!SvPADMY(pad[j])) {
95 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
99 else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
101 levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
102 /* Dump(pad[j],4); */
105 PerlIO_printf(Perl_debug_log, " level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n",
106 i, levelref, levelm, levels, levela, levelas);
113 do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
115 if (PadlistMAX(padlist) > 1) {
116 PerlIO_printf(Perl_debug_log, " total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n",
117 totref, totm, tots, tota, totas);
127 PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);
133 #if defined(MYMALLOC)
134 # define mstat(str) dump_mstats(str)
136 # define mstat(str) \
137 PerlIO_printf(Perl_debug_log, "%s: perl not compiled with MYMALLOC\n",str);
140 #if defined(MYMALLOC)
142 /* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
143 # define _NBUCKETS (2*8*IVSIZE+1)
147 perl_mstats_t buffer;
152 _fill_mstats(struct mstats_buffer *b, int level)
155 b->buffer.nfree = b->buf;
156 b->buffer.ntotal = b->buf + _NBUCKETS;
157 b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
158 b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
159 Zero(b->buf, (level ? 4*_NBUCKETS: 2*_NBUCKETS), unsigned long);
160 get_mstats(&(b->buffer), _NBUCKETS, level);
164 fill_mstats(SV *sv, int level)
169 croak("Cannot modify a readonly value");
170 sv_grow(sv, sizeof(struct mstats_buffer)+1);
171 _fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
172 SvCUR_set(sv, sizeof(struct mstats_buffer));
178 _mstats_to_hv(HV *hv, const struct mstats_buffer *b, int level)
184 svp = hv_fetch(hv, "topbucket", 9, 1);
185 sv_setiv(*svp, b->buffer.topbucket);
187 svp = hv_fetch(hv, "topbucket_ev", 12, 1);
188 sv_setiv(*svp, b->buffer.topbucket_ev);
190 svp = hv_fetch(hv, "topbucket_odd", 13, 1);
191 sv_setiv(*svp, b->buffer.topbucket_odd);
193 svp = hv_fetch(hv, "totfree", 7, 1);
194 sv_setiv(*svp, b->buffer.totfree);
196 svp = hv_fetch(hv, "total", 5, 1);
197 sv_setiv(*svp, b->buffer.total);
199 svp = hv_fetch(hv, "total_chain", 11, 1);
200 sv_setiv(*svp, b->buffer.total_chain);
202 svp = hv_fetch(hv, "total_sbrk", 10, 1);
203 sv_setiv(*svp, b->buffer.total_sbrk);
205 svp = hv_fetch(hv, "sbrks", 5, 1);
206 sv_setiv(*svp, b->buffer.sbrks);
208 svp = hv_fetch(hv, "sbrk_good", 9, 1);
209 sv_setiv(*svp, b->buffer.sbrk_good);
211 svp = hv_fetch(hv, "sbrk_slack", 10, 1);
212 sv_setiv(*svp, b->buffer.sbrk_slack);
214 svp = hv_fetch(hv, "start_slack", 11, 1);
215 sv_setiv(*svp, b->buffer.start_slack);
217 svp = hv_fetch(hv, "sbrked_remains", 14, 1);
218 sv_setiv(*svp, b->buffer.sbrked_remains);
220 svp = hv_fetch(hv, "minbucket", 9, 1);
221 sv_setiv(*svp, b->buffer.minbucket);
223 svp = hv_fetch(hv, "nbuckets", 8, 1);
224 sv_setiv(*svp, b->buffer.nbuckets);
226 if (_NBUCKETS < b->buffer.nbuckets)
227 warn("FIXME: internal mstats buffer too short");
229 for (type = 0; type < (level ? 4 : 2); type++) {
230 UV *p = 0, *p1 = 0, i;
232 static const char *types[4] = {
233 "free", "used", "mem_size", "available_size"
236 svp = hv_fetch(hv, types[type], strlen(types[type]), 1);
238 if (SvOK(*svp) && !(SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
239 croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
242 (void)SvUPGRADE(*svp, SVt_RV);
243 SvRV_set(*svp, (SV*)av);
246 av = (AV*)SvRV(*svp);
248 av_extend(av, b->buffer.nbuckets - 1);
249 /* XXXX What is the official way to reduce the size of the array? */
255 p = b->buffer.ntotal;
256 p1 = b->buffer.nfree;
259 p = b->buffer.bucket_mem_size;
262 p = b->buffer.bucket_available_size;
265 for (i = 0; i < b->buffer.nbuckets; i++) {
266 svp = av_fetch(av, i, 1);
268 sv_setiv(*svp, p[i]-p1[i]);
270 sv_setuv(*svp, p[i]);
276 mstats_fillhash(SV *sv, int level)
278 struct mstats_buffer buf;
280 if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
281 croak("Not a hash reference");
282 _fill_mstats(&buf, level);
283 _mstats_to_hv((HV *)SvRV(sv), &buf, level);
287 mstats2hash(SV *sv, SV *rv, int level)
289 if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
290 croak("Not a hash reference");
292 croak("Undefined value when expecting mstats buffer");
293 if (SvCUR(sv) != sizeof(struct mstats_buffer))
294 croak("Wrong size for a value with a mstats buffer");
295 _mstats_to_hv((HV *)SvRV(rv), (struct mstats_buffer*)SvPVX(sv), level);
297 #else /* defined(MYMALLOC) */
299 fill_mstats(SV *sv, int level)
302 PERL_UNUSED_ARG(level);
303 croak("Cannot report mstats without Perl malloc");
307 mstats_fillhash(SV *sv, int level)
310 PERL_UNUSED_ARG(level);
311 croak("Cannot report mstats without Perl malloc");
315 mstats2hash(SV *sv, SV *rv, int level)
319 PERL_UNUSED_ARG(level);
320 croak("Cannot report mstats without Perl malloc");
322 #endif /* defined(MYMALLOC) */
325 (SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV) \
326 ? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)
329 S_do_dump(pTHX_ SV *const sv, I32 lim)
332 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", 0);
333 const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
334 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", 0);
335 const U16 save_dumpindent = PL_dumpindent;
337 do_sv_dump(0, Perl_debug_log, sv, 0, lim,
338 (bool)(dumpop && SvTRUE(dumpop)), pv_lim);
339 PL_dumpindent = save_dumpindent;
346 const I32 lim = PL_op->op_private == 2 ? (I32)POPi : 4;
348 S_do_dump(aTHX_ sv, lim);
353 S_ck_dump(pTHX_ OP *entersubop, GV *namegv, SV *cv)
355 OP *parent, *pm, *first, *second;
360 ck_entersub_args_proto(entersubop, namegv,
361 newSVpvn_flags("$;$", 3, SVs_TEMP));
364 pm = cUNOPx(entersubop)->op_first;
365 if (!OpHAS_SIBLING(pm)) {
367 pm = cUNOPx(pm)->op_first;
369 first = OpSIBLING(pm);
370 second = OpSIBLING(first);
372 /* It doesn’t really matter what we return here, as this only
373 occurs after yyerror. */
376 /* we either have Dump($x): [pushmark]->[first]->[ex-cvop]
377 * or Dump($x,1); [pushmark]->[first]->[second]->[ex-cvop]
379 if (!OpHAS_SIBLING(second))
382 if (first->op_type == OP_RV2AV ||
383 first->op_type == OP_PADAV ||
384 first->op_type == OP_RV2HV ||
385 first->op_type == OP_PADHV
387 first->op_flags |= OPf_REF;
389 first->op_flags &= ~OPf_MOD;
391 /* splice out first (and optionally second) ops, then discard the rest
394 op_sibling_splice(parent, pm, second ? 2 : 1, NULL);
397 /* then attach first (and second) to a new binop */
399 NewOp(1234, newop, 1, BINOP);
400 newop->op_type = OP_CUSTOM;
401 newop->op_ppaddr = S_pp_dump;
402 newop->op_private= second ? 2 : 1;
403 newop->op_flags = OPf_KIDS|OPf_WANT_SCALAR;
404 op_sibling_splice((OP*)newop, NULL, 0, first);
409 static const XOP my_xop = {
410 XOPf_xop_name|XOPf_xop_desc|XOPf_xop_class, /* xop_flags */
411 "Devel_Peek_Dump", /* xop_name */
412 "Dump", /* xop_desc */
413 OA_BINOP, /* xop_class */
417 MODULE = Devel::Peek PACKAGE = Devel::Peek
420 mstat(str="Devel::Peek::mstat: ")
424 fill_mstats(SV *sv, int level = 0)
427 mstats_fillhash(SV *sv, int level = 0)
431 mstats2hash(SV *sv, SV *rv, int level = 0)
440 S_do_dump(aTHX_ sv, lim);
445 CV * const cv = get_cvn_flags("Devel::Peek::Dump", 17, 0);
447 cv_set_call_checker(cv, S_ck_dump, (SV *)cv);
448 Perl_custom_op_register(aTHX_ S_pp_dump, &my_xop);
457 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", 0);
458 const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
459 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", 0);
460 const U16 save_dumpindent = PL_dumpindent;
463 for (i=1; i<items; i++) {
464 PerlIO_printf(Perl_debug_log, "Elt No. %ld 0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
465 do_sv_dump(0, Perl_debug_log, ST(i), 0, lim,
466 (bool)(dumpop && SvTRUE(dumpop)), pv_lim);
468 PL_dumpindent = save_dumpindent;
475 warn("dumpindent is %d", (int)PL_dumpindent);
477 op_dump(PL_main_root);
487 croak_xs_usage(cv, "SCALAR");
488 RETVAL = SvREFCNT(SvRV(sv)) - 1; /* -1 because our ref doesn't count */
495 RETVAL = DeadCode(aTHX);
499 MODULE = Devel::Peek PACKAGE = Devel::Peek PREFIX = _
506 _runops_debug(int flag = -1)