diff options
author | Dave Mitchell <davem@fdisolutions.com> | 2002-08-05 01:55:33 +0100 |
---|---|---|
committer | hv <hv@crypt.org> | 2002-08-12 11:57:17 +0000 |
commit | d672126634c5e568812ed35d4c8ea53a9a55ee4c (patch) | |
tree | 945dc0356b4ee4a487d37b526ec251ffa716354b /deb.c | |
parent | 75ea820e56eb2905cb7fed3312e2bd10c18778d5 (diff) | |
download | perl-d672126634c5e568812ed35d4c8ea53a9a55ee4c.tar.gz |
add verbose stack display option, -Dvs
Message-id: <20020805005533.B26111@fdgroup.com>
p4raw-id: //depot/perl@17718
Diffstat (limited to 'deb.c')
-rw-r--r-- | deb.c | 225 |
1 files changed, 201 insertions, 24 deletions
@@ -78,49 +78,226 @@ Perl_debstackptrs(pTHX) return 0; } -I32 -Perl_debstack(pTHX) -{ -#ifndef SKIP_DEBUGGING - I32 top = PL_stack_sp - PL_stack_base; - register I32 i = top - 30; - I32 *markscan = PL_markstack + PL_curstackinfo->si_markoff; - if (CopSTASH_eq(PL_curcop, PL_debstash) && !DEBUG_J_TEST_) - return 0; +/* dump the contents of a particular stack + * Display stack_base[stack_min+1 .. stack_max], + * and display the marks whose offsets are contained in addresses + * PL_markstack[mark_min+1 .. mark_max] and whose values are in the range + * of the stack values being displayed + * + * Only displays top 30 max + */ - if (i < 0) - i = 0; +STATIC void +S_deb_stack_n(pTHX_ SV** stack_base, I32 stack_min, I32 stack_max, + I32 mark_min, I32 mark_max) +{ +#ifdef DEBUGGING + register I32 i = stack_max - 30; + I32 *markscan = PL_markstack + mark_min; + if (i < stack_min) + i = stack_min; - while (++markscan <= PL_markstack_ptr) + while (++markscan <= PL_markstack + mark_max) if (*markscan >= i) break; -#ifdef USE_5005THREADS - PerlIO_printf(Perl_debug_log, - i ? "0x%"UVxf" => ... " : "0x%lx => ", - PTR2UV(thr)); -#else - PerlIO_printf(Perl_debug_log, i ? " => ... " : " => "); -#endif /* USE_5005THREADS */ - if (PL_stack_base[0] != &PL_sv_undef || PL_stack_sp < PL_stack_base) + if (i > stack_min) + PerlIO_printf(Perl_debug_log, "... "); + + if (stack_base[0] != &PL_sv_undef || stack_max < 0) PerlIO_printf(Perl_debug_log, " [STACK UNDERFLOW!!!]\n"); do { ++i; - if (markscan <= PL_markstack_ptr && *markscan < i) { + if (markscan <= PL_markstack + mark_max && *markscan < i) { do { ++markscan; PerlIO_putc(Perl_debug_log, '*'); } - while (markscan <= PL_markstack_ptr && *markscan < i); + while (markscan <= PL_markstack + mark_max && *markscan < i); PerlIO_printf(Perl_debug_log, " "); } - if (i > top) + if (i > stack_max) break; - PerlIO_printf(Perl_debug_log, "%-4s ", SvPEEK(PL_stack_base[i])); + PerlIO_printf(Perl_debug_log, "%-4s ", SvPEEK(stack_base[i])); } while (1); PerlIO_printf(Perl_debug_log, "\n"); +#endif /* DEBUGGING */ +} + + +/* dump the current stack */ + +I32 +Perl_debstack(pTHX) +{ +#ifndef SKIP_DEBUGGING + if (CopSTASH_eq(PL_curcop, PL_debstash) && !DEBUG_J_TEST_) + return 0; + + PerlIO_printf(Perl_debug_log, " => "); + deb_stack_n(PL_stack_base, + 0, + PL_stack_sp - PL_stack_base, + PL_curstackinfo->si_markoff, + PL_markstack_ptr - PL_markstack); + + #endif /* SKIP_DEBUGGING */ return 0; } + + +#ifdef DEBUGGING +static char * si_names[] = { + "UNKNOWN", + "UNDEF", + "MAIN", + "MAGIC", + "SORT", + "SIGNAL", + "OVERLOAD", + "DESTROY", + "WARNHOOK", + "DIEHOOK", + "REQUIRE" +}; +#endif + +/* display all stacks */ + + +void +Perl_deb_stack_all(pTHX) +{ +#ifdef DEBUGGING + I32 ix, si_ix; + PERL_SI *si; + PERL_CONTEXT *cx; + + /* rewind to start of chain */ + si = PL_curstackinfo; + while (si->si_prev) + si = si->si_prev; + + si_ix=0; + for (;;) + { + char *si_name; + int si_name_ix = si->si_type+1; /* -1 is a valid index */ + if (si_name_ix>= sizeof(si_names)) + si_name = "????"; + else + si_name = si_names[si_name_ix]; + PerlIO_printf(Perl_debug_log, "STACK %"IVdf": %s\n", + si_ix, si_name); + + for (ix=0; ix<=si->si_cxix; ix++) { + + cx = &(si->si_cxstack[ix]); + PerlIO_printf(Perl_debug_log, + " CX %"IVdf": %-6s => ", + ix, PL_block_type[CxTYPE(cx)] + ); + /* substitution contexts don't save stack pointers etc) */ + if (CxTYPE(cx) == CXt_SUBST) + PerlIO_printf(Perl_debug_log, "\n"); + else { + + /* Find the the current context's stack range by searching + * forward for any higher contexts using this stack; failing + * that, it will be equal to the size of the stack for old + * stacks, or PL_stack_sp for the current stack + */ + + I32 i, stack_min, stack_max, mark_min, mark_max; + I32 ret_min, ret_max; + PERL_CONTEXT *cx_n; + PERL_SI *si_n; + + cx_n = Null(PERL_CONTEXT*); + + /* there's a separate stack per SI, so only search + * this one */ + + for (i=ix+1; i<=si->si_cxix; i++) { + if (CxTYPE(cx) == CXt_SUBST) + continue; + cx_n = &(si->si_cxstack[i]); + break; + } + + stack_min = cx->blk_oldsp; + + if (cx_n) { + stack_max = cx_n->blk_oldsp; + } + else if (si == PL_curstackinfo) { + stack_max = PL_stack_sp - AvARRAY(si->si_stack); + } + else { + stack_max = AvFILLp(si->si_stack); + } + + /* for the other stack types, there's only one stack + * shared between all SIs */ + + si_n = si; + i = ix; + cx_n = Null(PERL_CONTEXT*); + for (;;) { + i++; + if (i > si_n->si_cxix) { + if (si_n == PL_curstackinfo) + break; + else { + si_n = si_n->si_next; + i = 0; + } + } + if (CxTYPE(&(si_n->si_cxstack[i])) == CXt_SUBST) + continue; + cx_n = &(si_n->si_cxstack[i]); + break; + } + + mark_min = cx->blk_oldmarksp; + ret_min = cx->blk_oldretsp; + if (cx_n) { + mark_max = cx_n->blk_oldmarksp; + ret_max = cx_n->blk_oldretsp; + } + else { + mark_max = PL_markstack_ptr - PL_markstack; + ret_max = PL_retstack_ix; + } + + deb_stack_n(AvARRAY(si->si_stack), + stack_min, stack_max, mark_min, mark_max); + + if (ret_max > ret_min) { + PerlIO_printf(Perl_debug_log, " retop=%s\n", + PL_retstack[ret_min] + ? OP_NAME(PL_retstack[ret_min]) + : "(null)" + ); + } + + } + } /* next context */ + + + if (si == PL_curstackinfo) + break; + si = si->si_next; + si_ix++; + if (!si) + break; /* shouldn't happen, but just in case.. */ + } /* next stackinfo */ + + PerlIO_printf(Perl_debug_log, "\n"); +#endif /* DEBUGGING */ +} + + |