Diff for /gforth/look.fs between versions 1.15 and 1.26

version 1.15, 2000/09/23 15:46:57 version 1.26, 2003/03/09 15:16:50
Line 1 Line 1
 \ LOOK.FS      xt -> lfa                               22may93jaw  \ LOOK.FS      xt -> lfa                               22may93jaw
   
 \ Copyright (C) 1995,1996,1997,2000 Free Software Foundation, Inc.  \ Copyright (C) 1995,1996,1997,2000,2003 Free Software Foundation, Inc.
   
 \ This file is part of Gforth.  \ This file is part of Gforth.
   
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!!!
   
 : (look)  ( xt startlfa -- lfa flag )  : xt>threaded ( xt -- x )
         false swap  \G produces the threaded-code cell for the primitive xt
         BEGIN @ dup      threading-method 0= if
         WHILE dup name>int          @
               3 pick = IF nip dup THEN      then ;
         REPEAT  
         drop nip  : search-name  ( xt startlfa -- nt|0 )
         dup 0<> ;      \ look up name of primitive with code at xt
       swap
       >r false swap
       BEGIN
           @ dup
       WHILE
               dup name>int
               r@ = IF
                   nip dup
               THEN
       REPEAT
       drop rdrop ;
   
   : threaded>xt ( ca -- xt|0 )
   \G For the code address ca of a primitive, find the xt (or 0).
       [IFDEF] decompile-prim
           decompile-prim
       [THEN]
        \ walk through the array of primitive CAs
       >r ['] noop begin
           dup @ while
               dup xt>threaded r@ = if
                   rdrop exit
               endif
               cell+
       repeat
       drop rdrop 0 ;
   
 \ !!! nicht optimal!  \ !!! nicht optimal!
 [IFUNDEF] look  [IFUNDEF] look
Line 48  has? ec [IF] Line 76  has? ec [IF]
   
 has? rom   has? rom 
 [IF]  [IF]
 : look  : prim>name ( xt -- nt|0 )
       forth-wordlist @ search-name ;
   
   : look ( xt -- lfa flag )
     dup [ unlock rom-dictionary area lock ]       dup [ unlock rom-dictionary area lock ] 
     literal literal within      literal literal within
     IF      IF
         >head-noprim dup ?? <>          >head-noprim dup ?? <>
     ELSE      ELSE
         forth-wordlist @ (look)          prim>name dup 0<>
     THEN ;      THEN ;
 [ELSE]  [ELSE]
 : look ( cfa -- lfa flag )  : look ( cfa -- lfa flag )
Line 65  has? rom Line 96  has? rom
   
 : PrimStart ['] true >head-noprim ;  : PrimStart ['] true >head-noprim ;
   
 : look ( cfa -- lfa flag )  : prim>name ( xt -- nt|0 )
       PrimStart search-name ;
   
   : look ( xt -- lfa flag )
     dup in-dictionary?      dup in-dictionary?
     IF      IF
         >head-noprim dup ??? <>          >head-noprim dup ??? <>
     ELSE      ELSE
         PrimStart (look)          prim>name dup 0<>
     THEN ;      THEN ;
   
 [THEN]  [THEN]
 [THEN]  [THEN]
   
   : threaded>name ( ca -- nt|0 )
       threaded>xt prim>name ;
   
 : >head ( cfa -- nt|0 ) \ gforth to-head  : >head ( cfa -- nt|0 ) \ gforth to-head
     \G tries to find the name token nt of the word represented by cfa;      \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 returns 0 if it fails.  This word is not absolutely reliable,

Removed from v.1.15  
changed lines
  Added in v.1.26


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