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