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)
60 const char* const file = OutCopFILE(PL_curcop);
62 PerlIO_printf(Perl_debug_log, "(%s:%ld)\t", (file ? file : "<free>"),
63 (long)CopLINE(PL_curcop));
64 (void) PerlIO_vprintf(Perl_debug_log, pat, *args);
68 PERL_UNUSED_ARG(args);
69 #endif /* DEBUGGING */
73 Perl_debstackptrs(pTHX)
77 PerlIO_printf(Perl_debug_log,
78 "%8"UVxf" %8"UVxf" %8"IVdf" %8"IVdf" %8"IVdf"\n",
79 PTR2UV(PL_curstack), PTR2UV(PL_stack_base),
80 (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base),
81 (IV)(PL_stack_max-PL_stack_base));
82 PerlIO_printf(Perl_debug_log,
83 "%8"UVxf" %8"UVxf" %8"UVuf" %8"UVuf" %8"UVuf"\n",
84 PTR2UV(PL_mainstack), PTR2UV(AvARRAY(PL_curstack)),
85 PTR2UV(PL_mainstack), PTR2UV(AvFILLp(PL_curstack)),
86 PTR2UV(AvMAX(PL_curstack)));
87 #endif /* DEBUGGING */
92 /* dump the contents of a particular stack
93 * Display stack_base[stack_min+1 .. stack_max],
94 * and display the marks whose offsets are contained in addresses
95 * PL_markstack[mark_min+1 .. mark_max] and whose values are in the range
96 * of the stack values being displayed
98 * Only displays top 30 max
102 S_deb_stack_n(pTHX_ SV** stack_base, I32 stack_min, I32 stack_max,
103 I32 mark_min, I32 mark_max)
107 register I32 i = stack_max - 30;
108 const I32 *markscan = PL_markstack + mark_min;
112 while (++markscan <= PL_markstack + mark_max)
117 PerlIO_printf(Perl_debug_log, "... ");
119 if (stack_base[0] != &PL_sv_undef || stack_max < 0)
120 PerlIO_printf(Perl_debug_log, " [STACK UNDERFLOW!!!]\n");
123 if (markscan <= PL_markstack + mark_max && *markscan < i) {
126 PerlIO_putc(Perl_debug_log, '*');
128 while (markscan <= PL_markstack + mark_max && *markscan < i);
129 PerlIO_printf(Perl_debug_log, " ");
133 PerlIO_printf(Perl_debug_log, "%-4s ", SvPEEK(stack_base[i]));
136 PerlIO_printf(Perl_debug_log, "\n");
139 PERL_UNUSED_ARG(stack_base);
140 PERL_UNUSED_ARG(stack_min);
141 PERL_UNUSED_ARG(stack_max);
142 PERL_UNUSED_ARG(mark_min);
143 PERL_UNUSED_ARG(mark_max);
144 #endif /* DEBUGGING */
148 /* dump the current stack */
153 #ifndef SKIP_DEBUGGING
155 if (CopSTASH_eq(PL_curcop, PL_debstash) && !DEBUG_J_TEST_)
158 PerlIO_printf(Perl_debug_log, " => ");
159 deb_stack_n(PL_stack_base,
161 PL_stack_sp - PL_stack_base,
162 PL_curstackinfo->si_markoff,
163 PL_markstack_ptr - PL_markstack);
166 #endif /* SKIP_DEBUGGING */
172 static const char * const si_names[] = {
187 /* display all stacks */
191 Perl_deb_stack_all(pTHX)
198 /* rewind to start of chain */
199 si = PL_curstackinfo;
206 const size_t si_name_ix = si->si_type+1; /* -1 is a valid index */
207 const char * const si_name =
209 ((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 const PERL_CONTEXT *cx_n = NULL;
236 /* there's a separate stack per SI, so only search
239 for (i=ix+1; i<=si->si_cxix; i++) {
240 if (CxTYPE(cx) == CXt_SUBST)
242 cx_n = &(si->si_cxstack[i]);
246 stack_min = cx->blk_oldsp;
249 stack_max = cx_n->blk_oldsp;
251 else if (si == PL_curstackinfo) {
252 stack_max = PL_stack_sp - AvARRAY(si->si_stack);
255 stack_max = AvFILLp(si->si_stack);
258 /* for the other stack types, there's only one stack
259 * shared between all SIs */
266 if (i > si_n->si_cxix) {
267 if (si_n == PL_curstackinfo)
270 si_n = si_n->si_next;
274 if (CxTYPE(&(si_n->si_cxstack[i])) == CXt_SUBST)
276 cx_n = &(si_n->si_cxstack[i]);
280 mark_min = cx->blk_oldmarksp;
282 mark_max = cx_n->blk_oldmarksp;
285 mark_max = PL_markstack_ptr - PL_markstack;
288 deb_stack_n(AvARRAY(si->si_stack),
289 stack_min, stack_max, mark_min, mark_max);
291 if (CxTYPE(cx) == CXt_EVAL || CxTYPE(cx) == CXt_SUB
292 || CxTYPE(cx) == CXt_FORMAT)
294 const OP * const retop = (CxTYPE(cx) == CXt_EVAL)
295 ? cx->blk_eval.retop : cx->blk_sub.retop;
297 PerlIO_printf(Perl_debug_log, " retop=%s\n",
298 retop ? OP_NAME(retop) : "(null)"
305 if (si == PL_curstackinfo)
310 break; /* shouldn't happen, but just in case.. */
311 } /* next stackinfo */
313 PerlIO_printf(Perl_debug_log, "\n");
316 #endif /* DEBUGGING */
321 * c-indentation-style: bsd
323 * indent-tabs-mode: t
326 * ex: set ts=8 sts=4 sw=4 noet: