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 PADLIST* padlist = CvPADLIST(cv);
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 svp = (SV**) PadlistARRAY(padlist);
58 while (++i <= PadlistMAX(padlist)) { /* Depth. */
61 if (!svp[i]) continue;
62 pad = AvARRAY((AV*)svp[i]);
64 if (!argav || (SV*)argav == &PL_sv_undef) {
65 PerlIO_printf(Perl_debug_log, " closure-template\n");
68 args = AvARRAY(argav);
69 levelm = levels = levelref = levelas = 0;
70 levela = sizeof(SV*) * (AvMAX(argav) + 1);
72 for (j = 0; j < AvFILL(argav); j++) {
74 PerlIO_printf(Perl_debug_log, " ref in args!\n");
77 /* else if (SvPOK(args[j]) && SvPVX(args[j])) { */
78 else if (SvTYPE(args[j]) >= SVt_PV && SvLEN(args[j])) {
79 levelas += SvLEN(args[j])/SvREFCNT(args[j]);
83 for (j = 1; j < AvFILL((AV*)svp[1]); j++) { /* Vars. */
84 if (!pad[j]) continue;
87 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
90 /* else if (SvPOK(pad[j]) && SvPVX(pad[j])) { */
91 else if (SvTYPE(pad[j]) >= SVt_PVAV) {
92 if (!SvPADMY(pad[j])) {
94 do_sv_dump(0, Perl_debug_log, pad[j], 0, 4, 0, 0);
98 else if (SvTYPE(pad[j]) >= SVt_PV && SvLEN(pad[j])) {
100 levelm += SvLEN(pad[j])/SvREFCNT(pad[j]);
101 /* Dump(pad[j],4); */
104 PerlIO_printf(Perl_debug_log, " level %i: refs: %i, strings: %i in %i,\targsarray: %i, argsstrings: %i\n",
105 i, levelref, levelm, levels, levela, levelas);
112 do_sv_dump(0, Perl_debug_log, (SV*)cv, 0, 2, 0, 0);
114 if (PadlistMAX(padlist) > 1) {
115 PerlIO_printf(Perl_debug_log, " total: refs: %i, strings: %i in %i,\targsarrays: %i, argsstrings: %i\n",
116 totref, totm, tots, tota, totas);
126 PerlIO_printf(Perl_debug_log, "total: refs: %i, strings: %i in %i\targsarray: %i, argsstrings: %i\n", tref, tm, ts, ta, tas);
132 #if defined(MYMALLOC)
133 # define mstat(str) dump_mstats(str)
135 # define mstat(str) \
136 PerlIO_printf(Perl_debug_log, "%s: perl not compiled with MYMALLOC\n",str);
139 #if defined(MYMALLOC)
141 /* Very coarse overestimate, 2-per-power-of-2, one more to determine NBUCKETS. */
142 # define _NBUCKETS (2*8*IVSIZE+1)
146 perl_mstats_t buffer;
151 _fill_mstats(struct mstats_buffer *b, int level)
154 b->buffer.nfree = b->buf;
155 b->buffer.ntotal = b->buf + _NBUCKETS;
156 b->buffer.bucket_mem_size = b->buf + 2*_NBUCKETS;
157 b->buffer.bucket_available_size = b->buf + 3*_NBUCKETS;
158 Zero(b->buf, (level ? 4*_NBUCKETS: 2*_NBUCKETS), unsigned long);
159 get_mstats(&(b->buffer), _NBUCKETS, level);
163 fill_mstats(SV *sv, int level)
168 croak("Cannot modify a readonly value");
169 sv_grow(sv, sizeof(struct mstats_buffer)+1);
170 _fill_mstats((struct mstats_buffer*)SvPVX(sv),level);
171 SvCUR_set(sv, sizeof(struct mstats_buffer));
177 _mstats_to_hv(HV *hv, const struct mstats_buffer *b, int level)
183 svp = hv_fetch(hv, "topbucket", 9, 1);
184 sv_setiv(*svp, b->buffer.topbucket);
186 svp = hv_fetch(hv, "topbucket_ev", 12, 1);
187 sv_setiv(*svp, b->buffer.topbucket_ev);
189 svp = hv_fetch(hv, "topbucket_odd", 13, 1);
190 sv_setiv(*svp, b->buffer.topbucket_odd);
192 svp = hv_fetch(hv, "totfree", 7, 1);
193 sv_setiv(*svp, b->buffer.totfree);
195 svp = hv_fetch(hv, "total", 5, 1);
196 sv_setiv(*svp, b->buffer.total);
198 svp = hv_fetch(hv, "total_chain", 11, 1);
199 sv_setiv(*svp, b->buffer.total_chain);
201 svp = hv_fetch(hv, "total_sbrk", 10, 1);
202 sv_setiv(*svp, b->buffer.total_sbrk);
204 svp = hv_fetch(hv, "sbrks", 5, 1);
205 sv_setiv(*svp, b->buffer.sbrks);
207 svp = hv_fetch(hv, "sbrk_good", 9, 1);
208 sv_setiv(*svp, b->buffer.sbrk_good);
210 svp = hv_fetch(hv, "sbrk_slack", 10, 1);
211 sv_setiv(*svp, b->buffer.sbrk_slack);
213 svp = hv_fetch(hv, "start_slack", 11, 1);
214 sv_setiv(*svp, b->buffer.start_slack);
216 svp = hv_fetch(hv, "sbrked_remains", 14, 1);
217 sv_setiv(*svp, b->buffer.sbrked_remains);
219 svp = hv_fetch(hv, "minbucket", 9, 1);
220 sv_setiv(*svp, b->buffer.minbucket);
222 svp = hv_fetch(hv, "nbuckets", 8, 1);
223 sv_setiv(*svp, b->buffer.nbuckets);
225 if (_NBUCKETS < b->buffer.nbuckets)
226 warn("FIXME: internal mstats buffer too short");
228 for (type = 0; type < (level ? 4 : 2); type++) {
229 UV *p = 0, *p1 = 0, i;
231 static const char *types[4] = {
232 "free", "used", "mem_size", "available_size"
235 svp = hv_fetch(hv, types[type], strlen(types[type]), 1);
237 if (SvOK(*svp) && !(SvROK(*svp) && SvTYPE(SvRV(*svp)) == SVt_PVAV))
238 croak("Unexpected value for the key '%s' in the mstats hash", types[type]);
241 (void)SvUPGRADE(*svp, SVt_RV);
242 SvRV_set(*svp, (SV*)av);
245 av = (AV*)SvRV(*svp);
247 av_extend(av, b->buffer.nbuckets - 1);
248 /* XXXX What is the official way to reduce the size of the array? */
254 p = b->buffer.ntotal;
255 p1 = b->buffer.nfree;
258 p = b->buffer.bucket_mem_size;
261 p = b->buffer.bucket_available_size;
264 for (i = 0; i < b->buffer.nbuckets; i++) {
265 svp = av_fetch(av, i, 1);
267 sv_setiv(*svp, p[i]-p1[i]);
269 sv_setuv(*svp, p[i]);
275 mstats_fillhash(SV *sv, int level)
277 struct mstats_buffer buf;
279 if (!(SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVHV))
280 croak("Not a hash reference");
281 _fill_mstats(&buf, level);
282 _mstats_to_hv((HV *)SvRV(sv), &buf, level);
286 mstats2hash(SV *sv, SV *rv, int level)
288 if (!(SvROK(rv) && SvTYPE(SvRV(rv)) == SVt_PVHV))
289 croak("Not a hash reference");
291 croak("Undefined value when expecting mstats buffer");
292 if (SvCUR(sv) != sizeof(struct mstats_buffer))
293 croak("Wrong size for a value with a mstats buffer");
294 _mstats_to_hv((HV *)SvRV(rv), (struct mstats_buffer*)SvPVX(sv), level);
296 #else /* defined(MYMALLOC) */
298 fill_mstats(SV *sv, int level)
301 PERL_UNUSED_ARG(level);
302 croak("Cannot report mstats without Perl malloc");
306 mstats_fillhash(SV *sv, int level)
309 PERL_UNUSED_ARG(level);
310 croak("Cannot report mstats without Perl malloc");
314 mstats2hash(SV *sv, SV *rv, int level)
318 PERL_UNUSED_ARG(level);
319 croak("Cannot report mstats without Perl malloc");
321 #endif /* defined(MYMALLOC) */
324 (SvROK(cv) && (SvTYPE(SvRV(cv))==SVt_PVCV) \
325 ? SvREFCNT_inc(CvGV((CV*)SvRV(cv))) : &PL_sv_undef)
328 S_do_dump(pTHX_ SV *const sv, I32 lim)
331 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", 0);
332 const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
333 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", 0);
334 const U16 save_dumpindent = PL_dumpindent;
336 do_sv_dump(0, Perl_debug_log, sv, 0, lim,
337 (bool)(dumpop && SvTRUE(dumpop)), pv_lim);
338 PL_dumpindent = save_dumpindent;
345 const I32 lim = PL_op->op_private == 2 ? (I32)POPi : 4;
347 S_do_dump(aTHX_ sv, lim);
352 S_ck_dump(pTHX_ OP *entersubop, GV *namegv, SV *cv)
354 OP *aop, *prev, *first, *second = NULL;
359 ck_entersub_args_proto(entersubop, namegv,
360 newSVpvn_flags("$;$", 3, SVs_TEMP));
362 aop = cUNOPx(entersubop)->op_first;
363 if (!aop->op_sibling)
364 aop = cUNOPx(aop)->op_first;
366 aop = aop->op_sibling;
367 while (PL_madskills && aop->op_type == OP_STUB) {
369 aop = aop->op_sibling;
371 if (PL_madskills && aop->op_type == OP_NULL) {
372 first = ((UNOP*)aop)->op_first;
373 ((UNOP*)aop)->op_first = NULL;
378 prev->op_sibling = first->op_sibling;
380 if (first->op_type == OP_RV2AV ||
381 first->op_type == OP_PADAV ||
382 first->op_type == OP_RV2HV ||
383 first->op_type == OP_PADHV
385 first->op_flags |= OPf_REF;
387 first->op_flags &= ~OPf_MOD;
388 aop = aop->op_sibling;
389 while (PL_madskills && aop->op_type == OP_STUB) {
391 aop = aop->op_sibling;
394 /* It doesn’t really matter what we return here, as this only
395 occurs after yyerror. */
400 /* aop now points to the second arg if there is one, the cvop otherwise
402 if (aop->op_sibling) {
403 prev->op_sibling = aop->op_sibling;
405 second->op_sibling = NULL;
407 first->op_sibling = second;
411 NewOp(1234, newop, 1, BINOP);
412 newop->op_type = OP_CUSTOM;
413 newop->op_ppaddr = S_pp_dump;
414 newop->op_first = first;
415 newop->op_last = second;
416 newop->op_private= second ? 2 : 1;
417 newop->op_flags = OPf_KIDS|OPf_WANT_SCALAR;
424 MODULE = Devel::Peek PACKAGE = Devel::Peek
427 mstat(str="Devel::Peek::mstat: ")
431 fill_mstats(SV *sv, int level = 0)
434 mstats_fillhash(SV *sv, int level = 0)
438 mstats2hash(SV *sv, SV *rv, int level = 0)
447 S_do_dump(aTHX_ sv, lim);
452 CV * const cv = get_cvn_flags("Devel::Peek::Dump", 17, 0);
453 cv_set_call_checker(cv, S_ck_dump, (SV *)cv);
455 XopENTRY_set(&my_xop, xop_name, "Dump");
456 XopENTRY_set(&my_xop, xop_desc, "Dump");
457 XopENTRY_set(&my_xop, xop_class, OA_BINOP);
458 Perl_custom_op_register(aTHX_ S_pp_dump, &my_xop);
467 SV *pv_lim_sv = perl_get_sv("Devel::Peek::pv_limit", 0);
468 const STRLEN pv_lim = pv_lim_sv ? SvIV(pv_lim_sv) : 0;
469 SV *dumpop = perl_get_sv("Devel::Peek::dump_ops", 0);
470 const U16 save_dumpindent = PL_dumpindent;
473 for (i=1; i<items; i++) {
474 PerlIO_printf(Perl_debug_log, "Elt No. %ld 0x%"UVxf"\n", i - 1, PTR2UV(ST(i)));
475 do_sv_dump(0, Perl_debug_log, ST(i), 0, lim,
476 (bool)(dumpop && SvTRUE(dumpop)), pv_lim);
478 PL_dumpindent = save_dumpindent;
485 warn("dumpindent is %d", (int)PL_dumpindent);
487 op_dump(PL_main_root);
497 croak_xs_usage(cv, "SCALAR");
498 RETVAL = SvREFCNT(SvRV(sv)) - 1; /* -1 because our ref doesn't count */
505 RETVAL = DeadCode(aTHX);
509 MODULE = Devel::Peek PACKAGE = Devel::Peek PREFIX = _
516 _runops_debug(int flag = -1)