--- gforth/see.fs 2002/12/13 21:20:39 1.43 +++ gforth/see.fs 2010/12/31 18:09:02 1.76 @@ -1,12 +1,12 @@ \ SEE.FS highend SEE for ANSforth 16may93jaw -\ Copyright (C) 1995,2000 Free Software Foundation, Inc. +\ Copyright (C) 1995,2000,2003,2004,2006,2007,2008,2010 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 2 +\ 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, @@ -15,8 +15,7 @@ \ 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, write to the Free Software -\ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. +\ along with this program. If not, see http://www.gnu.org/licenses/. \ May be cross-compiled @@ -28,19 +27,6 @@ require look.fs require termsize.fs require wordinfo.fs -[IFUNDEF] .name -: id. ( nt -- ) \ gforth - \G Print the name of the word represented by @var{nt}. - \ this name comes from fig-Forth - name>string type space ; - -' id. alias .id ( nt -- ) -\G F83 name for @code{id.}. - -' id. alias .name ( nt -- ) -\G Gforth <=0.5.0 name for @code{id.}. - -[THEN] decimal @@ -84,13 +70,9 @@ DEFER nlcount ' noop IS nlcount nlflag @ IF (nl) nlflag off THEN XPos @ over + cols u>= IF (nl) THEN ; -: c-to-upper ( c1 -- c2 ) \ gforth - \ nac05feb1999 there is a primitive, toupper, with this function - dup [char] a >= over [char] z <= and if bl - then ; - : ctype ( adr len -- ) warp? dup XPos +! C-Output @ - IF uppercase @ IF bounds ?DO i c@ c-to-upper emit LOOP + IF uppercase @ IF bounds ?DO i c@ toupper emit LOOP uppercase off ELSE type THEN ELSE 2drop THEN ; @@ -99,6 +81,58 @@ DEFER nlcount ' noop IS nlcount IF 2drop ELSE XPos +! C-Output @ IF emit ELSE drop THEN THEN ; + +Defer xt-see-xt ( xt -- ) +\ this one is just a forward declaration for indirect recursion + +: .defname ( xt c-addr u -- ) + rot look + if ( c-addr u nfa ) + -rot type space .name + else + drop ." noname " type + then + space ; + +Defer discode ( addr u -- ) \ gforth +\G hook for the disassembler: disassemble u bytes of code at addr +' dump IS discode + +: next-head ( addr1 -- addr2 ) \ gforth + \G find the next header starting after addr1, up to here (unreliable). + here swap u+do + i head? -2 and if + i unloop exit + then + cell +loop + here ; + +[ifundef] umin \ !! bootstrapping help +: umin ( u1 u2 -- u ) + 2dup u> + if + swap + then + drop ; +[then] + +: next-prim ( addr1 -- addr2 ) \ gforth + \G find the next primitive after addr1 (unreliable) + 1+ >r -1 primstart + begin ( umin head R: boundary ) + @ dup + while + tuck name>int >code-address ( head1 umin ca R: boundary ) + r@ - umin + swap + repeat + drop dup r@ negate u>= + \ "umin+boundary within [0,boundary)" = "umin within [-boundary,0)" + if ( umin R: boundary ) \ no primitive found behind -> use a default length + drop 31 + then + r> + ; + DEFER .string ( c-addr u n -- ) [IFDEF] Green @@ -120,6 +154,33 @@ VARIABLE Colors Colors on ' (.string) IS .string +: c-\type ( c-addr u -- ) + \ type string in \-escaped form + begin + dup while + 2dup newline string-prefix? if + '\ cemit 'n cemit + newline nip /string + else + over c@ + dup '" = over '\ = or if + '\ cemit cemit + else + dup bl 127 within if + cemit + else + base @ >r try + 8 base ! 0 <<# # # # '\ hold #> ctype #>> 0 + restore + r@ base ! + endtry + rdrop throw + endif + endif + 1 /string + endif + repeat + 2drop ; : .struc uppercase on Str# .string ; @@ -188,12 +249,12 @@ ACONSTANT MaxTable : MyBranch ( a-addr -- a-addr a-addr2 ) \ finds branch table entry for branch at a-addr - dup @ over + + dup @ BranchAddr? BEGIN WHILE 1 cells - @ over <> - WHILE dup @ over + + WHILE dup @ MoreBranchAddr? REPEAT SearchPointer @ 3 cells - @@ -231,7 +292,8 @@ ACONSTANT MaxTable BranchPointer @ 1 cells - ! ; : Branch! ( a-addr rel -- a-addr ) - over + over ,Branch ,Branch 0 ,Branch ; + over ,Branch ,Branch 0 ,Branch ; +\ over + over ,Branch ,Branch 0 ,Branch ; \ DEFER CheckUntil VARIABLE NoOutput @@ -244,42 +306,104 @@ VARIABLE C-Pass : Scan? ( -- flag ) C-Pass @ 0= ; : Display? ( -- flag ) C-Pass @ 1 = ; : Debug? ( -- flag ) C-Pass @ 2 = ; +: ?.string ( c-addr u n -- ) Display? if .string else 2drop drop then ; -: back? ( n -- flag ) 0< ; -: ahead? ( n -- flag ) 0> ; +: back? ( addr target -- addr flag ) + over u< ; -: c-lit +: .word ( addr x -- addr ) + \ print x as a word if possible + dup look 0= IF + drop dup threaded>name dup 0= if + drop over 1 cells - @ dup body> look + IF + nip nip dup ." <" name>string rot wordinfo .string ." > " + ELSE + 2drop ." <" 0 .r ." > " + THEN + EXIT + then + THEN + nip dup cell+ @ immediate-mask and + IF + bl cemit ." POSTPONE " + THEN + dup name>string rot wordinfo .string + ; + +: c-call ( addr1 -- addr2 ) Display? IF - dup @ dup abs 0 <# #S rot sign #> 0 .string bl cemit + dup @ body> .word bl cemit THEN cell+ ; -: .word ( addr xt -- addr ) - look 0= IF - drop dup 1 cells - @ dup body> look - IF - nip dup ." <" name>string rot wordinfo .string ." >" - ELSE - drop ." <" 0 .r ." >" - THEN - ELSE - dup cell+ @ immediate-mask and - IF - bl cemit ." POSTPONE " - THEN - dup name>string rot wordinfo .string - THEN ; +: c-callxt ( addr1 -- addr2 ) + Display? IF + dup @ .word bl cemit + THEN + cell+ ; + +\ here docon: , docol: , dovar: , douser: , dodefer: , dofield: , +\ here over - 2constant doers -: c-call - Display? IF ." call " dup @ body> .word bl cemit THEN cell+ ; +[IFDEF] !does +: c-does> \ end of create part + Display? IF S" DOES> " Com# .string THEN ; +\ maxaligned /does-handler + ; \ !! no longer needed for non-cross stuff +[THEN] + +: c-lit ( addr1 -- addr2 ) + dup @ dup body> dup cfaligned over = swap in-dictionary? and if + ( addr1 addr1@ ) + dup body> @ dovar: = if + drop c-call EXIT + endif + endif + over 4 cells + over = if + over 1 cells + @ decompile-prim ['] call xt>threaded = >r + over 3 cells + @ decompile-prim ['] ;S xt>threaded = + r> and if + over 2 cells + @ ['] !does >body = if drop + S" DOES> " Com# ?.string 4 cells + EXIT endif + endif + [IFDEF] !;abi-code + over 2 cells + @ ['] !;abi-code >body = if drop + S" ;abi-code " Com# ?.string 4 cells + + c-stop on + Display? if + dup dup next-head over - discode + S" end-code" Com# ?.string + then EXIT + endif + [THEN] + endif + Display? if + \ !! test for cfa here, and print "['] ..." + dup abs 0 <# #S rot sign #> 0 .string bl cemit + else drop then + cell+ ; + +: c-lit+ ( addr1 -- addr2 ) + Display? if + dup @ dup abs 0 <# #S rot sign #> 0 .string bl cemit + s" + " 0 .string + endif + cell+ ; : .name-without ( addr -- addr ) -\ prints a name without () e.g. (+LOOP) or (s") - dup 1 cells - @ look - IF name>string over c@ '( = IF 1 /string THEN - 2dup + 1- c@ ') = IF 1- THEN .struc ELSE drop - THEN ; + \ !! the stack effect cannot be correct + \ prints a name without a() e.g. a(+LOOP) or (s") + dup 1 cells - @ threaded>name dup IF + name>string over c@ 'a = IF + 1 /string + THEN + over c@ '( = IF + 1 /string + THEN + 2dup + 1- c@ ') = IF 1- THEN .struc ELSE drop + THEN ; +[ifdef] (s") : c-c" Display? IF nl .name-without THEN count 2dup + aligned -rot @@ -288,19 +412,70 @@ VARIABLE C-Pass [char] " cemit bl cemit ELSE 2drop THEN ; +[endif] +: c-string? ( addr1 -- addr2 f ) + \ f is true if a string was found and decompiled. + \ if f is false, addr2=addr1 + \ recognizes the following patterns: + \ c": ahead X: len string then lit X + \ flit: ahead X: float then lit X f@ + \ s\": ahead X: string then lit X lit len + \ .\": ahead X: string then lit X lit len type + \ !! not recognized anywhere: + \ abort": if ahead X: len string then lit X c(abort") then + dup @ back? if false exit endif + dup @ >r + r@ @ decompile-prim ['] lit xt>threaded <> if rdrop false exit endif + r@ cell+ @ over cell+ <> if rdrop false exit endif + \ we have at least C" + r@ 2 cells + @ decompile-prim dup ['] lit xt>threaded = if + drop r@ 3 cells + @ over cell+ + aligned r@ = if + \ we have at least s" + r@ 4 cells + @ decompile-prim ['] lit-perform xt>threaded = + r@ 5 cells + @ ['] type >body = and if + 6 s\" .\\\" " + else + 4 s\" s\\\" " + endif + \ !! make newline if string too long? + display? if + 0 .string r@ cell+ @ r@ 3 cells + @ c-\type '" cemit bl cemit + else + 2drop + endif + nip cells r> + true exit + endif + endif + ['] f@ xt>threaded = if + display? if + r@ cell+ @ f@ 10 8 16 f>str-rdp 0 .string bl cemit + endif + drop r> 3 cells + true exit + endif + \ !! check if count matches space? + display? if + s\" c\" " 0 .string r@ cell+ @ count 0 .string '" cemit bl cemit + endif + drop r> 2 cells + true ; : Forward? ( a-addr true | false -- a-addr true | false ) -\ a-addr1 is pointer into branch table -\ returns true when jump is a forward jump - IF dup dup @ swap 1 cells - @ - - Ahead? IF true ELSE drop false THEN - \ only if forward jump - ELSE false THEN ; + \ a-addr is pointer into branch table + \ returns true when jump is a forward jump + IF + dup dup @ swap 1 cells - @ u> IF + true + ELSE + drop false + THEN + \ only if forward jump + ELSE + false + THEN ; : RepeatCheck ( a-addr1 a-addr2 true | false -- false ) IF BEGIN 2dup - 1 cells - @ swap dup @ + + 1 cells - @ swap @ u<= WHILE drop dup cell+ MoreBranchAddr? 0= @@ -310,7 +485,8 @@ VARIABLE C-Pass ELSE false THEN ; -: c-branch +: c-branch ( addr1 -- addr2 ) + c-string? ?exit Scan? IF dup @ Branch! dup @ back? @@ -342,22 +518,22 @@ VARIABLE C-Pass ELSE dup cell+ BranchAddr? Forward? IF dup cell+ @ WhileCode2 = - IF nl S" ELSE" .struc level+ + IF nl S" ELSE " .struc level+ ELSE level- nl S" ELSE" .struc level+ THEN cell+ Disable swap ! - ELSE S" AHEAD" .struc level+ + ELSE S" AHEAD " .struc level+ THEN THEN THEN THEN Debug? - IF dup @ + + IF @ \ !!! cross-interacts with debugger !!! ELSE cell+ THEN ; : DebugBranch Debug? - IF dup @ over + swap THEN ; \ return 2 different addresses + IF dup @ swap THEN ; \ return 2 different addresses : c-?branch Scan? @@ -391,7 +567,7 @@ VARIABLE C-Pass Display? IF nl S" FOR" .struc level+ THEN ; : c-loop - Display? IF level- nl .name-without bl cemit nl THEN + Display? IF level- nl .name-without nl bl cemit THEN DebugBranch cell+ Scan? IF dup BranchAddr? @@ -404,17 +580,22 @@ VARIABLE C-Pass : c-do Display? IF nl .name-without level+ THEN ; -: c-?do - Display? IF nl S" ?DO" .struc level+ THEN - DebugBranch cell+ ; - -: c-exit dup 1 cells - - CheckEnd - IF Display? IF nlflag off S" ;" Com# .string THEN - C-Stop on - ELSE Display? IF S" EXIT " .struc THEN - THEN - Debug? IF drop THEN ; +: c-?do ( addr1 -- addr2 ) + Display? IF + nl .name-without level+ + THEN + DebugBranch cell+ ; + +: c-exit ( addr1 -- addr2 ) + dup 1 cells - + CheckEnd + IF + Display? IF nlflag off S" ;" Com# .string THEN + C-Stop on + ELSE + Display? IF S" EXIT " .struc THEN + THEN + Debug? IF drop THEN ; \ !!! cross-interacts with debugger !!! : c-abort" count 2dup + aligned -rot @@ -425,12 +606,6 @@ VARIABLE C-Pass ELSE 2drop THEN ; -[IFDEF] (does>) -: c-does> \ end of create part - Display? IF S" DOES> " Com# .string THEN - maxaligned /does-handler + ; -[THEN] - [IFDEF] (compile) : c-(compile) Display? @@ -444,30 +619,34 @@ VARIABLE C-Pass CREATE C-Table ' lit A, ' c-lit A, + ' does-exec A, ' c-callxt A, + ' lit@ A, ' c-call A, [IFDEF] call ' call A, ' c-call A, [THEN] +\ ' useraddr A, .... + ' lit-perform A, ' c-call A, + ' lit+ A, ' c-lit+ A, [IFDEF] (s") ' (s") A, ' c-c" A, [THEN] [IFDEF] (.") ' (.") A, ' c-c" A, [THEN] [IFDEF] "lit ' "lit A, ' c-c" A, [THEN] [IFDEF] (c") ' (c") A, ' c-c" A, [THEN] ' (do) A, ' c-do A, -[IFDEF] (+do) ' (+do) A, ' c-do A, [THEN] -[IFDEF] (u+do) ' (u+do) A, ' c-do A, [THEN] -[IFDEF] (-do) ' (-do) A, ' c-do A, [THEN] -[IFDEF] (u-do) ' (u-do) A, ' c-do A, [THEN] +[IFDEF] (+do) ' (+do) A, ' c-?do A, [THEN] +[IFDEF] (u+do) ' (u+do) A, ' c-?do A, [THEN] +[IFDEF] (-do) ' (-do) A, ' c-?do A, [THEN] +[IFDEF] (u-do) ' (u-do) A, ' c-?do A, [THEN] ' (?do) A, ' c-?do A, ' (for) A, ' c-for A, ' ?branch A, ' c-?branch A, ' branch A, ' c-branch A, ' (loop) A, ' c-loop A, ' (+loop) A, ' c-loop A, -[IFDEF] (s+loop) ' (s+loop) A, ' c-loop A, [THEN] +[IFDEF] (s+loop) ' (s+loop) A, ' c-loop A, [THEN] [IFDEF] (-loop) ' (-loop) A, ' c-loop A, [THEN] ' (next) A, ' c-loop A, ' ;s A, ' c-exit A, [IFDEF] (abort") ' (abort") A, ' c-abort" A, [THEN] \ only defined if compiler is loaded [IFDEF] (compile) ' (compile) A, ' c-(compile) A, [THEN] -[IFDEF] (does>) ' (does>) A, ' c-does> A, [THEN] 0 , here 0 , avariable c-extender @@ -475,20 +654,23 @@ c-extender ! \ DOTABLE 15may93jaw -: DoTable ( cfa -- flag ) - C-Table - BEGIN dup @ dup 0= - IF drop cell+ @ dup - IF ( next table!) dup @ ELSE - ( end!) 2drop false EXIT THEN - THEN - \ jump over to extender, if any 26jan97jaw - xt>threaded 2 pick <> - WHILE 2 cells + - REPEAT - nip cell+ perform - true - ; +: DoTable ( ca/cfa -- flag ) + decompile-prim C-Table BEGIN ( cfa table-entry ) + dup @ dup 0= IF + drop cell+ @ dup IF ( next table!) + dup @ + ELSE ( end!) + 2drop false EXIT + THEN + THEN + \ jump over to extender, if any 26jan97jaw + xt>threaded 2 pick <> + WHILE + 2 cells + + REPEAT + nip cell+ perform + true +; : BranchTo? ( a-addr -- a-addr ) Display? IF dup BranchAddr? @@ -532,55 +714,6 @@ c-extender ! c-stop @ UNTIL drop ; -Defer xt-see-xt ( xt -- ) -\ this one is just a forward declaration for indirect recursion - -: .defname ( xt c-addr u -- ) - rot look - if ( c-addr u nfa ) - -rot type space .name - else - drop ." noname " type - then - space ; - -Defer discode ( addr u -- ) \ gforth -\G hook for the disassembler: disassemble code at addr of length u -' dump IS discode - -: next-head ( addr1 -- addr2 ) \ gforth - \G find the next header starting after addr1, up to here (unreliable). - here swap u+do - i head? -2 and if - i unloop exit - then - cell +loop - here ; - -: umin ( u1 u2 -- u ) - 2dup u> - if - swap - then - drop ; - -: next-prim ( addr1 -- addr2 ) \ gforth - \G find the next primitive after addr1 (unreliable) - 1+ >r -1 primstart - begin ( umin head R: boundary ) - @ dup - while - tuck name>int >code-address ( head1 umin ca R: boundary ) - r@ - umin - swap - repeat - drop dup r@ negate u>= - \ "umin+boundary within [0,boundary)" = "umin within [-boundary,0)" - if ( umin R: boundary ) \ no primitive found behind -> use a default length - drop 31 - then - r> + ; - : seecode ( xt -- ) dup s" Code" .defname >code-address @@ -592,6 +725,11 @@ Defer discode ( addr u -- ) \ gforth then over - discode ." end-code" cr ; +: seeabicode ( xt -- ) + dup s" ABI-Code" .defname + >body dup dup next-head + swap - discode + ." end-code" cr ; : seevar ( xt -- ) s" Variable" .defname cr ; : seeuser ( xt -- ) @@ -608,7 +746,7 @@ Defer discode ( addr u -- ) \ gforth >name ?dup-if ." IS " .name cr else - ." lastxt >body !" + ." latestxt >body !" then ; : see-threaded ( addr -- ) C-Pass @ DebugMode = IF @@ -643,24 +781,30 @@ Defer discode ( addr u -- ) \ gforth dup >code-address CASE docon: of seecon endof +[IFDEF] dovalue: + dovalue: of seevalue endof +[THEN] docol: of seecol endof dovar: of seevar endof -[ [IFDEF] douser: ] +[IFDEF] douser: douser: of seeuser endof -[ [THEN] ] -[ [IFDEF] dodefer: ] +[THEN] +[IFDEF] dodefer: dodefer: of seedefer endof -[ [THEN] ] -[ [IFDEF] dofield: ] +[THEN] +[IFDEF] dofield: dofield: of seefield endof -[ [THEN] ] +[THEN] +[IFDEF] doabicode: + doabicode: of seeabicode endof +[THEN] over of seecode endof \ direct threaded code words over >body of seecode endof \ indirect threaded code words 2drop abort" unknown word type" ENDCASE ; : (xt-see-xt) ( xt -- ) - xt-see cr ." lastxt" ; + xt-see cr ." latestxt" ; ' (xt-see-xt) is xt-see-xt : (.immediate) ( xt -- ) @@ -681,7 +825,7 @@ Defer discode ( addr u -- ) \ gforth else \ interpret/compile word r@ xt-see-xt cr swap xt-see-xt cr - ." interpret/compile " over .name (.immediate) + ." interpret/compile: " over .name drop then then rdrop drop ;