\ simple-minded see (good for seeing what the compiler produces) \ Copyright (C) 2001,2003 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 \ 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, write to the Free Software \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. require see.fs : simple-see-word { addr -- } xpos off addr hex. addr cell+ addr @ .word drop ; : simple-see-range ( addr1 addr2 -- ) \ gforth swap u+do cr i simple-see-word cell +loop ; : simple-see ( "name" -- ) \ gforth \G a simple decompiler that's closer to @code{dump} than @code{see}. \ !! at the moment NEXT-HEAD is a little too optimistic (see \ comment in HEAD?) ' >body dup next-head simple-see-range ; : see-code-next-inline { addr1 addr2 -- addr3 } \ decompile starting at addr1 until an inlined primitive is found, \ or addr2 is reached; addr3 is addr2 or the next inlined \ primitive addr1 begin { addr } addr addr2 u< while addr @ dup decompile-prim = while addr cr simple-see-word addr cell+ repeat then addr ; : see-code-range { addr1 addr2 -- } \ gforth cr addr1 begin { a } a simple-see-word a cell+ addr2 see-code-next-inline { b } b addr2 u< while a @ b @ over - discode b repeat ; : see-code ( "name" -- ) \ gforth \G like @code{simple-see}, but also shows the dynamic native code for \G the inlined primitives (except for the last). ' >body dup next-head see-code-range ;