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, ...)
50 #endif /* DEBUGGING */
55 Perl_vdeb(pTHX_ const char *pat, va_list *args)
59 const char* const file = PL_curcop ? OutCopFILE(PL_curcop) : "<null>";
60 const char* const display_file = file ? file : "<free>";
61 const long line = PL_curcop ? (long)CopLINE(PL_curcop) : 0;
64 PerlIO_printf(Perl_debug_log, "(%ld:%s:%ld)\t",
65 (long)PerlProc_getpid(), display_file, line);
67 PerlIO_printf(Perl_debug_log, "(%s:%ld)\t", display_file, line);
68 (void) PerlIO_vprintf(Perl_debug_log, pat, *args);
72 PERL_UNUSED_ARG(args);
73 #endif /* DEBUGGING */
77 Perl_debstackptrs(pTHX)
81 PerlIO_printf(Perl_debug_log,
82 "%8"UVxf" %8"UVxf" %8"IVdf" %8"IVdf" %8"IVdf"\n",
83 PTR2UV(PL_curstack), PTR2UV(PL_stack_base),
84 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base),
85 (IV)(PL_stack_max-PL_stack_base));
86 PerlIO_printf(Perl_debug_log,
87 "%8"UVxf" %8"UVxf" %8"UVuf" %8"UVuf" %8"UVuf"\n",
88 PTR2UV(PL_mainstack), PTR2UV(AvARRAY(PL_curstack)),
89 PTR2UV(PL_mainstack), PTR2UV(AvFILLp(PL_curstack)),
90 PTR2UV(AvMAX(PL_curstack)));
91 #endif /* DEBUGGING */
96 /* dump the contents of a particular stack
97 * Display stack_base[stack_min+1 .. stack_max],
98 * and display the marks whose offsets are contained in addresses
99 * PL_markstack[mark_min+1 .. mark_max] and whose values are in the range
100 * of the stack values being displayed
102 * Only displays top 30 max
106 S_deb_stack_n(pTHX_ SV** stack_base, I32 stack_min, I32 stack_max,
107 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
159 if (CopSTASH_eq(PL_curcop, PL_debstash) && !DEBUG_J_TEST_)
162 PerlIO_printf(Perl_debug_log, " => ");
163 deb_stack_n(PL_stack_base,
165 PL_stack_sp - PL_stack_base,
166 PL_curstackinfo->si_markoff,
167 PL_markstack_ptr - PL_markstack);
170 #endif /* SKIP_DEBUGGING */
176 static const char * const si_names[] = {
191 /* display all stacks */
195 Perl_deb_stack_all(pTHX)
202 /* rewind to start of chain */
203 si = PL_curstackinfo;
210 const size_t si_name_ix = si->si_type+1; /* -1 is a valid index */
211 const char * const si_name = (si_name_ix >= sizeof(si_names)) ? "????" : si_names[si_name_ix];
213 PerlIO_printf(Perl_debug_log, "STACK %"IVdf": %s\n",
216 for (ix=0; ix<=si->si_cxix; ix++) {
218 const PERL_CONTEXT * const cx = &(si->si_cxstack[ix]);
219 PerlIO_printf(Perl_debug_log,
220 " CX %"IVdf": %-6s => ",
221 (IV)ix, PL_block_type[CxTYPE(cx)]
223 /* substitution contexts don't save stack pointers etc) */
224 if (CxTYPE(cx) == CXt_SUBST)
225 PerlIO_printf(Perl_debug_log, "\n");
228 /* Find the the current context's stack range by searching
229 * forward for any higher contexts using this stack; failing
230 * that, it will be equal to the size of the stack for old
231 * stacks, or PL_stack_sp for the current stack
234 I32 i, stack_min, stack_max, mark_min, mark_max;
235 const PERL_CONTEXT *cx_n = NULL;
238 /* there's a separate stack per SI, so only search
241 for (i=ix+1; i<=si->si_cxix; i++) {
242 if (CxTYPE(cx) == CXt_SUBST)
244 cx_n = &(si->si_cxstack[i]);
248 stack_min = cx->blk_oldsp;
251 stack_max = cx_n->blk_oldsp;
253 else if (si == PL_curstackinfo) {
254 stack_max = PL_stack_sp - AvARRAY(si->si_stack);
257 stack_max = AvFILLp(si->si_stack);
260 /* for the other stack types, there's only one stack
261 * shared between all SIs */
268 if (i > si_n->si_cxix) {
269 if (si_n == PL_curstackinfo)
272 si_n = si_n->si_next;
276 if (CxTYPE(&(si_n->si_cxstack[i])) == CXt_SUBST)
278 cx_n = &(si_n->si_cxstack[i]);
282 mark_min = cx->blk_oldmarksp;
284 mark_max = cx_n->blk_oldmarksp;
287 mark_max = PL_markstack_ptr - PL_markstack;
290 deb_stack_n(AvARRAY(si->si_stack),
291 stack_min, stack_max, mark_min, mark_max);
293 if (CxTYPE(cx) == CXt_EVAL || CxTYPE(cx) == CXt_SUB
294 || CxTYPE(cx) == CXt_FORMAT)
296 const OP * const retop = (CxTYPE(cx) == CXt_EVAL)
297 ? cx->blk_eval.retop : cx->blk_sub.retop;
299 PerlIO_printf(Perl_debug_log, " retop=%s\n",
300 retop ? OP_NAME(retop) : "(null)"
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: