Return to backtrac.fs CVS log

Up to [gforth] / gforth

Changed interfaces of PRIM>NAME THREADED>NAME to be like >NAME.

    1: \ backtrace handling
    2: 
    3: \ Copyright (C) 1999,2000 Free Software Foundation, Inc.
    4: 
    5: \ This file is part of Gforth.
    6: 
    7: \ Gforth is free software; you can redistribute it and/or
    8: \ modify it under the terms of the GNU General Public License
    9: \ as published by the Free Software Foundation; either version 2
   10: \ of the License, or (at your option) any later version.
   11: 
   12: \ This program is distributed in the hope that it will be useful,
   13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
   14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   15: \ GNU General Public License for more details.
   16: 
   17: \ You should have received a copy of the GNU General Public License
   18: \ along with this program; if not, write to the Free Software
   19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
   20: 
   21: 
   22: \ growing buffers that need not be full
   23: 
   24: struct
   25:     cell% 0 * field buffer-descriptor \ addr u
   26:     cell% field buffer-length
   27:     cell% field buffer-address
   28:     cell% field buffer-maxlength \ >=length
   29: end-struct buffer%
   30: 
   31: : init-buffer ( addr -- )
   32:     buffer% %size erase ;
   33: 
   34: : adjust-buffer ( u addr -- )
   35:     \G adjust buffer% at addr to length u
   36:     \ this may grow the allocated area, but never shrinks it
   37:     dup >r buffer-maxlength @ over <
   38:     if ( u )
   39: 	r@ buffer-address @ over resize throw r@ buffer-address !
   40: 	dup r@ buffer-maxlength !
   41:     then
   42:     r> buffer-length ! ;
   43: 
   44: \ backtrace stuff
   45: 
   46: create backtrace-rs-buffer buffer% %allot \ copy of the return stack at throw
   47: 
   48: : init-backtrace ( -- )
   49:     backtrace-rs-buffer init-buffer ;
   50:     
   51: init-backtrace
   52: 
   53: :noname ( -- )
   54:     DEFERS 'cold
   55:     init-backtrace ;
   56: IS 'cold
   57: 
   58: : backtrace-return-stack ( -- addr u )
   59:     \ addr is the address of top element of return stack (the stack
   60:     \ grows downwards), u is the number of aus that interest us on the
   61:     \ stack.
   62:     rp@ in-return-stack?
   63:     if
   64: 	rp@ [ 2 cells ]L +
   65:     else \ throw by signal handler with insufficient information
   66: 	handler @ cell - \ beyond that we know nothing
   67:     then
   68:     backtrace-rp0 @ [ 2 cells ]L - over - 0 max ;
   69: 
   70: :noname ( -- )
   71:     backtrace-empty @
   72:     if
   73: 	backtrace-return-stack
   74: 	dup backtrace-rs-buffer adjust-buffer
   75: 	backtrace-rs-buffer buffer-address @ swap move
   76: 	backtrace-empty off
   77:     then ;
   78: IS store-backtrace
   79: 
   80: : print-bt-entry ( return-stack-item -- )
   81:     cell - dup in-dictionary? over dup aligned = and
   82:     if
   83: 	@ dup threaded>name dup if
   84: 	    .name drop
   85: 	else
   86: 	    drop dup look if
   87: 		.name drop
   88: 	    else
   89: 		drop body> look \ !! check for "call" in cell before?
   90: 		if
   91: 		    .name
   92: 		else
   93: 		    drop
   94: 		then
   95: 	    then
   96: 	then
   97:     else
   98: 	drop
   99:     then ;
  100: 
  101: : print-backtrace ( addr1 addr2 -- )
  102:     \G print a backtrace for the return stack addr1..addr2
  103:     cr ." Backtrace:"
  104:     swap u+do
  105: 	cr
  106: 	i @ dup hex. ( return-addr? )
  107: 	print-bt-entry
  108: 	cell +loop ;
  109: 
  110: :noname ( -- )
  111:     backtrace-rs-buffer 2@ over + print-backtrace ;
  112: IS dobacktrace