3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * "Didst thou think that the eyes of the White Tower were blind? Nay, I
13 * have seen more than thou knowest, Gray Fool." --Denethor
17 * This file contains various utilities for producing debugging output
18 * (mainly related to displaying the stack)
25 #if defined(PERL_IMPLICIT_CONTEXT)
27 Perl_deb_nocontext(const char *pat, ...)
37 #endif /* DEBUGGING */
42 Perl_deb(pTHX_ const char *pat, ...)
52 #endif /* DEBUGGING */
56 Perl_vdeb(pTHX_ const char *pat, va_list *args)
59 const char* const file = OutCopFILE(PL_curcop);
61 #ifdef USE_5005THREADS
62 PerlIO_printf(Perl_debug_log, "0x%"UVxf" (%s:%ld)\t",
64 (file ? file : "<free>"),
65 (long)CopLINE(PL_curcop));
67 PerlIO_printf(Perl_debug_log, "(%s:%ld)\t", (file ? file : "<free>"),
68 (long)CopLINE(PL_curcop));
69 #endif /* USE_5005THREADS */
70 (void) PerlIO_vprintf(Perl_debug_log, pat, *args);
74 PERL_UNUSED_ARG(args);
75 #endif /* DEBUGGING */
79 Perl_debstackptrs(pTHX)
82 PerlIO_printf(Perl_debug_log,
83 "%8"UVxf" %8"UVxf" %8"IVdf" %8"IVdf" %8"IVdf"\n",
84 PTR2UV(PL_curstack), PTR2UV(PL_stack_base),
85 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base),
86 (IV)(PL_stack_max-PL_stack_base));
87 PerlIO_printf(Perl_debug_log,
88 "%8"UVxf" %8"UVxf" %8"UVuf" %8"UVuf" %8"UVuf"\n",
89 PTR2UV(PL_mainstack), PTR2UV(AvARRAY(PL_curstack)),
90 PTR2UV(PL_mainstack), PTR2UV(AvFILLp(PL_curstack)),
91 PTR2UV(AvMAX(PL_curstack)));
92 #endif /* DEBUGGING */
97 /* dump the contents of a particular stack
98 * Display stack_base[stack_min+1 .. stack_max],
99 * and display the marks whose offsets are contained in addresses
100 * PL_markstack[mark_min+1 .. mark_max] and whose values are in the range
101 * of the stack values being displayed
103 * Only displays top 30 max
107 S_deb_stack_n(pTHX_ SV** stack_base, I32 stack_min, I32 stack_max,
108 I32 mark_min, I32 mark_max)
111 register I32 i = stack_max - 30;
112 const I32 *markscan = PL_markstack + mark_min;
116 while (++markscan <= PL_markstack + mark_max)
121 PerlIO_printf(Perl_debug_log, "... ");
123 if (stack_base[0] != &PL_sv_undef || stack_max < 0)
124 PerlIO_printf(Perl_debug_log, " [STACK UNDERFLOW!!!]\n");
127 if (markscan <= PL_markstack + mark_max && *markscan < i) {
130 PerlIO_putc(Perl_debug_log, '*');
132 while (markscan <= PL_markstack + mark_max && *markscan < i);
133 PerlIO_printf(Perl_debug_log, " ");
137 PerlIO_printf(Perl_debug_log, "%-4s ", SvPEEK(stack_base[i]));
140 PerlIO_printf(Perl_debug_log, "\n");
143 PERL_UNUSED_ARG(stack_base);
144 PERL_UNUSED_ARG(stack_min);
145 PERL_UNUSED_ARG(stack_max);
146 PERL_UNUSED_ARG(mark_min);
147 PERL_UNUSED_ARG(mark_max);
148 #endif /* DEBUGGING */
152 /* dump the current stack */
157 #ifndef SKIP_DEBUGGING
158 if (CopSTASH_eq(PL_curcop, PL_debstash) && !DEBUG_J_TEST_)
161 PerlIO_printf(Perl_debug_log, " => ");
162 deb_stack_n(PL_stack_base,
164 PL_stack_sp - PL_stack_base,
165 PL_curstackinfo->si_markoff,
166 PL_markstack_ptr - PL_markstack);
169 #endif /* SKIP_DEBUGGING */
175 static const char * const si_names[] = {
190 /* display all stacks */
194 Perl_deb_stack_all(pTHX)
200 /* rewind to start of chain */
201 si = PL_curstackinfo;
208 const size_t si_name_ix = si->si_type+1; /* -1 is a valid index */
209 const char * const si_name = (si_name_ix >= sizeof(si_names)) ? "????" : si_names[si_name_ix];
211 PerlIO_printf(Perl_debug_log, "STACK %"IVdf": %s\n",
214 for (ix=0; ix<=si->si_cxix; ix++) {
216 const PERL_CONTEXT * const cx = &(si->si_cxstack[ix]);
217 PerlIO_printf(Perl_debug_log,
218 " CX %"IVdf": %-6s => ",
219 (IV)ix, PL_block_type[CxTYPE(cx)]
221 /* substitution contexts don't save stack pointers etc) */
222 if (CxTYPE(cx) == CXt_SUBST)
223 PerlIO_printf(Perl_debug_log, "\n");
226 /* Find the the current context's stack range by searching
227 * forward for any higher contexts using this stack; failing
228 * that, it will be equal to the size of the stack for old
229 * stacks, or PL_stack_sp for the current stack
232 I32 i, stack_min, stack_max, mark_min, mark_max;
233 I32 ret_min, ret_max;
234 const PERL_CONTEXT *cx_n = NULL;
237 /* there's a separate stack per SI, so only search
240 for (i=ix+1; i<=si->si_cxix; i++) {
241 if (CxTYPE(cx) == CXt_SUBST)
243 cx_n = &(si->si_cxstack[i]);
247 stack_min = cx->blk_oldsp;
250 stack_max = cx_n->blk_oldsp;
252 else if (si == PL_curstackinfo) {
253 stack_max = PL_stack_sp - AvARRAY(si->si_stack);
256 stack_max = AvFILLp(si->si_stack);
259 /* for the other stack types, there's only one stack
260 * shared between all SIs */
267 if (i > si_n->si_cxix) {
268 if (si_n == PL_curstackinfo)
271 si_n = si_n->si_next;
275 if (CxTYPE(&(si_n->si_cxstack[i])) == CXt_SUBST)
277 cx_n = &(si_n->si_cxstack[i]);
281 mark_min = cx->blk_oldmarksp;
282 ret_min = cx->blk_oldretsp;
284 mark_max = cx_n->blk_oldmarksp;
285 ret_max = cx_n->blk_oldretsp;
288 mark_max = PL_markstack_ptr - PL_markstack;
289 ret_max = PL_retstack_ix;
292 deb_stack_n(AvARRAY(si->si_stack),
293 stack_min, stack_max, mark_min, mark_max);
295 if (ret_max > ret_min) {
296 PerlIO_printf(Perl_debug_log, " retop=%s\n",
298 ? OP_NAME(PL_retstack[ret_min])
307 if (si == PL_curstackinfo)
312 break; /* shouldn't happen, but just in case.. */
313 } /* next stackinfo */
315 PerlIO_printf(Perl_debug_log, "\n");
318 #endif /* DEBUGGING */
323 * c-indentation-style: bsd
325 * indent-tabs-mode: t
328 * ex: set ts=8 sts=4 sw=4 noet: