/* deb.c
*
- * Copyright (c) 1991-1994, Larry Wall
+ * Copyright (c) 1991-2002, Larry Wall
*
* You may distribute under the terms of either the GNU General Public
* License or the Artistic License, as specified in the README file.
*/
#include "EXTERN.h"
+#define PERL_IN_DEB_C
#include "perl.h"
-#ifdef DEBUGGING
-#if !defined(I_STDARG) && !defined(I_VARARGS)
-
-/*
- * Fallback on the old hackers way of doing varargs
- */
-
-/*VARARGS1*/
+#if defined(PERL_IMPLICIT_CONTEXT)
void
-deb(pat,a1,a2,a3,a4,a5,a6,a7,a8)
- char *pat;
+Perl_deb_nocontext(const char *pat, ...)
{
- dTHR;
- register I32 i;
- GV* gv = curcop->cop_filegv;
-
-#ifdef USE_THREADS
- fprintf(stderr,"0x%lx (%s:%ld)\t",
- (unsigned long) thr,
- SvTYPE(gv) == SVt_PVGV ? SvPVX(GvSV(gv)) : "<free>",
- (long)curcop->cop_line);
-#else
- fprintf(stderr,"(%s:%ld)\t",
- SvTYPE(gv) == SVt_PVGV ? SvPVX(GvSV(gv)) : "<free>",
- (long)curcop->cop_line);
-#endif /* USE_THREADS */
- for (i=0; i<dlevel; i++)
- fprintf(stderr,"%c%c ",debname[i],debdelim[i]);
- fprintf(stderr,pat,a1,a2,a3,a4,a5,a6,a7,a8);
+#ifdef DEBUGGING
+ dTHX;
+ va_list args;
+ va_start(args, pat);
+ vdeb(pat, &args);
+ va_end(args);
+#endif /* DEBUGGING */
}
+#endif
-#else /* !defined(I_STDARG) && !defined(I_VARARGS) */
-
-# ifdef I_STDARG
-void
-deb(char *pat, ...)
-# else
-/*VARARGS1*/
void
-deb(pat, va_alist)
- char *pat;
- va_dcl
-# endif
+Perl_deb(pTHX_ const char *pat, ...)
{
- dTHR;
+#ifdef DEBUGGING
va_list args;
- register I32 i;
- GV* gv = curcop->cop_filegv;
-
-#ifdef USE_THREADS
- fprintf(stderr,"0x%lx (%s:%ld)\t",
- (unsigned long) thr,
- SvTYPE(gv) == SVt_PVGV ? SvPVX(GvSV(gv)) : "<free>",
- (long)curcop->cop_line);
-#else
- fprintf(stderr,"(%s:%ld)\t",
- SvTYPE(gv) == SVt_PVGV ? SvPVX(GvSV(gv)) : "<free>",
- (long)curcop->cop_line);
-#endif /* USE_THREADS */
- for (i=0; i<dlevel; i++)
- fprintf(stderr,"%c%c ",debname[i],debdelim[i]);
-
-# ifdef I_STDARG
va_start(args, pat);
-# else
- va_start(args);
-# endif
- (void) vfprintf(stderr,pat,args);
- va_end( args );
+ vdeb(pat, &args);
+ va_end(args);
+#endif /* DEBUGGING */
}
-#endif /* !defined(I_STDARG) && !defined(I_VARARGS) */
void
-deb_growlevel()
+Perl_vdeb(pTHX_ const char *pat, va_list *args)
{
- dlmax += 128;
- Renew(debname, dlmax, char);
- Renew(debdelim, dlmax, char);
+#ifdef DEBUGGING
+ char* file = OutCopFILE(PL_curcop);
+
+#ifdef USE_5005THREADS
+ PerlIO_printf(Perl_debug_log, "0x%"UVxf" (%s:%ld)\t",
+ PTR2UV(thr),
+ (file ? file : "<free>"),
+ (long)CopLINE(PL_curcop));
+#else
+ PerlIO_printf(Perl_debug_log, "(%s:%ld)\t", (file ? file : "<free>"),
+ (long)CopLINE(PL_curcop));
+#endif /* USE_5005THREADS */
+ (void) PerlIO_vprintf(Perl_debug_log, pat, *args);
+#endif /* DEBUGGING */
}
I32
-debstackptrs()
+Perl_debstackptrs(pTHX)
{
- dTHR;
- fprintf(stderr, "%8lx %8lx %8ld %8ld %8ld\n",
- (unsigned long)stack, (unsigned long)stack_base,
- (long)*markstack_ptr, (long)(stack_sp-stack_base),
- (long)(stack_max-stack_base));
- fprintf(stderr, "%8lx %8lx %8ld %8ld %8ld\n",
- (unsigned long)mainstack, (unsigned long)AvARRAY(stack),
- (long)mainstack, (long)AvFILL(stack), (long)AvMAX(stack));
+#ifdef DEBUGGING
+ PerlIO_printf(Perl_debug_log,
+ "%8"UVxf" %8"UVxf" %8"IVdf" %8"IVdf" %8"IVdf"\n",
+ PTR2UV(PL_curstack), PTR2UV(PL_stack_base),
+ (IV)*PL_markstack_ptr, (IV)(PL_stack_sp-PL_stack_base),
+ (IV)(PL_stack_max-PL_stack_base));
+ PerlIO_printf(Perl_debug_log,
+ "%8"UVxf" %8"UVxf" %8"UVuf" %8"UVuf" %8"UVuf"\n",
+ PTR2UV(PL_mainstack), PTR2UV(AvARRAY(PL_curstack)),
+ PTR2UV(PL_mainstack), PTR2UV(AvFILLp(PL_curstack)),
+ PTR2UV(AvMAX(PL_curstack)));
+#endif /* DEBUGGING */
return 0;
}
-I32
-debstack()
-{
- dTHR;
- I32 top = stack_sp - stack_base;
- register I32 i = top - 30;
- I32 *markscan = markstack;
- if (i < 0)
- i = 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
+ */
+
+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 <= markstack_ptr)
+ while (++markscan <= PL_markstack + mark_max)
if (*markscan >= i)
break;
-#ifdef USE_THREADS
- fprintf(stderr, i ? "0x%lx => ... " : "0x%lx => ",
- (unsigned long) thr);
-#else
- fprintf(stderr, i ? " => ... " : " => ");
-#endif /* USE_THREADS */
- if (stack_base[0] != &sv_undef || stack_sp < stack_base)
- fprintf(stderr, " [STACK UNDERFLOW!!!]\n");
+ 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 <= markstack_ptr && *markscan < i) {
+ if (markscan <= PL_markstack + mark_max && *markscan < i) {
do {
++markscan;
- putc('*', stderr);
+ PerlIO_putc(Perl_debug_log, '*');
}
- while (markscan <= markstack_ptr && *markscan < i);
- fprintf(stderr, " ");
+ while (markscan <= PL_markstack + mark_max && *markscan < i);
+ PerlIO_printf(Perl_debug_log, " ");
}
- if (i > top)
+ if (i > stack_max)
break;
- fprintf(stderr, "%-4s ", SvPEEK(stack_base[i]));
+ PerlIO_printf(Perl_debug_log, "%-4s ", SvPEEK(stack_base[i]));
}
while (1);
- fprintf(stderr, "\n");
+ 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;
}
-#else
-static int dummy; /* avoid totally empty deb.o file */
+
+
+#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",
+ (IV)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 => ",
+ (IV)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 */
+}
+
+