Diff for /gforth/look.fs between versions 1.4 and 1.20

version 1.4, 1996/05/13 16:37:01 version 1.20, 2002/12/21 17:27:13
Line 1 Line 1
 \ LOOK.FS      xt -> lfa                               22may93jaw  \ LOOK.FS      xt -> lfa                               22may93jaw
   
 \ Copyright (C) 1995 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
   
 decimal  require stuff.fs
   require environ.fs
   
 \ >NAME PRIMSTART                                       22may93jaw  decimal
   
 \ : >name ( xt -- nfa )  \ look                                                  17may93jaw
 \         BEGIN   1 chars -  
 \                 dup c@ alias-mask and  
 \         UNTIL ;  
   
 : PrimStart ['] true >name ;  \ rename to discover!!!
   
 \ look                                                  17may93jaw  : 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
         BEGIN @ dup      [IFDEF] decompile-prim
         WHILE dup name>      decompile-prim
               3 pick = IF nip dup THEN      [THEN]
         REPEAT      false rot
         drop nip      BEGIN
         dup 0<> ;          @ dup
       WHILE
               dup name>int xt>threaded
               3 pick = IF
                   nip dup
               THEN
       REPEAT
       drop nip
       dup 0<> ;
   
   
   \ !!! nicht optimal!
   [IFUNDEF] look
   has? ec [IF]
   
   has? rom 
   [IF]
   : look
       dup [ unlock rom-dictionary area lock ] 
       literal literal within
       IF
           >head-noprim dup ?? <>
       ELSE
           forth-wordlist @ (look)
       THEN ;
   [ELSE]
   : look ( cfa -- lfa flag )
       >head-noprim dup ??? <> ;
   [THEN]
   
   [ELSE]
   
   : PrimStart ['] true >head-noprim ;
   
 : look ( cfa -- lfa flag )  : look ( cfa -- lfa flag )
         dup forthstart <      dup in-dictionary?
         IF PrimStart (look)      IF
         ELSE >name true THEN ;          >head-noprim dup ??? <>
       ELSE
           PrimStart (look)
       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}

Removed from v.1.4  
changed lines
  Added in v.1.20


FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>