[gforth] / gforth / look.fs  

gforth: gforth/look.fs

Diff for /gforth/look.fs between version 1.11 and 1.19

version 1.11, Tue Dec 8 22:02:46 1998 UTC version 1.19, Fri Dec 13 21:20:39 2002 UTC
Line 1 
Line 1 
 \ LOOK.FS      xt -> lfa                               22may93jaw  \ LOOK.FS      xt -> lfa                               22may93jaw
   
 \ Copyright (C) 1995,1996,1997 Free Software Foundation, Inc.  \ Copyright (C) 1995,1996,1997,2000 Free Software Foundation, Inc.
   
 \ This file is part of Gforth.  \ This file is part of Gforth.
   
Line 16 
Line 16 
   
 \ You should have received a copy of the GNU General Public License  \ You should have received a copy of the GNU General Public License
 \ along with this program; if not, write to the Free Software  \ along with this program; if not, write to the Free Software
 \ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
   
 \ Look checks first if the word is a primitive. If yes then the  \ Look checks first if the word is a primitive. If yes then the
 \ vocabulary in the primitive area is beeing searched, meaning  \ vocabulary in the primitive area is beeing searched, meaning
Line 26 
Line 26 
 \ Problems: A compiled xt via compile, might be created with noname:  \ Problems: A compiled xt via compile, might be created with noname:
 \           a noname: leaves now a empty name field  \           a noname: leaves now a empty name field
   
   require stuff.fs
   require environ.fs
   
 decimal  decimal
   
 \ look                                                  17may93jaw  \ look                                                  17may93jaw
   
 \ rename to discover!!!  \ rename to discover!!!
   
   : xt>threaded ( xt -- x )
   \G produces the threaded-code cell for the primitive xt
       threading-method 0= if
           @
       then ;
   
 : (look)  ( xt startlfa -- lfa flag )  : (look)  ( xt startlfa -- lfa flag )
         false swap      swap decompile-prim false rot
         BEGIN @ dup      BEGIN
         WHILE dup name>int          @ dup
               3 pick = IF nip dup THEN      WHILE
               dup name>int xt>threaded
               3 pick = IF
                   nip dup
               THEN
         REPEAT          REPEAT
         drop nip          drop nip
         dup 0<> ;          dup 0<> ;
Line 52 
Line 65 
     dup [ unlock rom-dictionary area lock ]      dup [ unlock rom-dictionary area lock ]
     literal literal within      literal literal within
     IF      IF
         >name dup ?? <>          >head-noprim dup ?? <>
     ELSE      ELSE
         forth-wordlist @ (look)          forth-wordlist @ (look)
     THEN ;      THEN ;
 [ELSE]  [ELSE]
 : look ( cfa -- lfa flag )  : look ( cfa -- lfa flag )
     >name dup ??? <> ;      >head-noprim dup ??? <> ;
 [THEN]  [THEN]
   
 [ELSE]  [ELSE]
   
 : PrimStart ['] true >name ;  : PrimStart ['] true >head-noprim ;
   
 : look ( cfa -- lfa flag )  : look ( cfa -- lfa flag )
     dup dictionary-end forthstart within      dup in-dictionary?
     IF      IF
         PrimStart (look)          >head-noprim dup ??? <>
     ELSE      ELSE
         >name dup ??? <>          PrimStart (look)
     THEN ;      THEN ;
   
 [THEN]  [THEN]
 [THEN]  [THEN]
   
   : >head ( cfa -- nt|0 ) \ gforth to-head
       \G tries to find the name token nt of the word represented by cfa;
       \G returns 0 if it fails.  This word is not absolutely reliable,
       \G it may give false positives and produce wrong nts.
       look and ;
   
   ' >head ALIAS >name \ gforth to-name
   \G old name of @code{>head}

Generate output suitable for use with a patch program
Legend:
Removed from v.1.11  
changed lines
  Added in v.1.19
CVS Admin

Powered by ViewCVS 1.0-dev 		(Powered by ViewCVS)

ViewCVS and CVS Help