Diff for /gforth/search.fs between versions 1.14 and 1.31

version 1.14, 2000/05/27 09:41:28 version 1.31, 2007/12/31 17:34:58
Line 1 Line 1
 \ search order wordset                                 14may93py  \ search order wordset                                 14may93py
   
 \ Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc.  \ Copyright (C) 1995,1996,1997,1998,2000,2003,2005,2007 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.
   
 $10 constant maxvp  require struct.fs
 Variable vp  
   0 A, 0 A,  0 A, 0 A,   0 A, 0 A,   0 A, 0 A,   $10 Value maxvp         \ current size of search order stack
   0 A, 0 A,  0 A, 0 A,   0 A, 0 A,   0 A, 0 A,   $400 Value maxvp-limit  \ upper limit for resizing search order stack
   0 AValue vp             \ will be initialized later (dynamic)
   \ the first cell at vp contains the search order depth, the others
   \ contain the wordlists, starting with the last-searched one.
   
 : get-current  ( -- wid ) \ search  : get-current  ( -- wid ) \ search
   \G @i{wid} is the identifier of the current compilation word list.    \G @i{wid} is the identifier of the current compilation word list.
Line 50  Variable slowvoc   0 slowvoc ! Line 53  Variable slowvoc   0 slowvoc !
   
 : mappedwordlist ( map-struct -- wid )  \ gforth  : mappedwordlist ( map-struct -- wid )  \ gforth
 \G Create a wordlist with a special map-structure.  \G Create a wordlist with a special map-structure.
   here swap A, 0 A, voclink @ A, 0 A,    align here swap A, 0 A, voclink @ A, 0 A,
   dup wordlist-link voclink !    dup wordlist-link voclink !
   dup initvoc ;    dup initvoc ;
   
Line 71  Variable slowvoc   0 slowvoc ! Line 74  Variable slowvoc   0 slowvoc !
   Create wordlist drop  DOES> context ! ;    Create wordlist drop  DOES> context ! ;
   
 : check-maxvp ( n -- )  : check-maxvp ( n -- )
     maxvp > -49 and throw ;     dup maxvp-limit > -49 and throw
      dup maxvp > IF
         BEGIN  dup  maxvp 2* dup TO maxvp  <= UNTIL
         vp  maxvp 1+ cells resize throw TO vp
      THEN drop ;
   
 : push-order ( wid -- ) \ gforth  : >order ( wid -- ) \ gforth to-order
     \g Push @var{wid} on the search order.      \g Push @var{wid} on the search order.
     vp @ 1+ dup check-maxvp vp! context ! ;      vp @ 1+ dup check-maxvp vp! context ! ;
   
 : also  ( -- ) \ search-ext  : also  ( -- ) \ search-ext
   \G Perform a @code{DUP} on the @var{wid} at the top of the search    \G Like @code{DUP} for the search order. Usually used before a
   \G order. Usually used prior to @code{Forth} etc.    \G vocabulary (e.g., @code{also Forth}); the combined effect is to push
   context @ push-order ;    \G the wordlist represented by the vocabulary on the search order.
     context @ >order ;
   
 : previous ( -- ) \ search-ext  : previous ( -- ) \ search-ext
   \G Perform a @code{DROP} on the @i{wid} at the top of the search    \G Drop the wordlist at the top of the search order.
   \G order, thereby removing the @i{wid} from the search order.  
   vp @ 1- dup 0= -50 and throw vp! ;    vp @ 1- dup 0= -50 and throw vp! ;
   
 \ vocabulary find                                      14may93py  \ vocabulary find                                      14may93py
   
 : (vocfind)  ( addr count wid -- nfa|false )  : (vocfind)  ( addr count wid -- nfa|false )
     \ !! generalize this to be independent of vp      \ !! generalize this to be independent of vp
     drop vp dup @ 1- cells over +      drop 0 vp @ -DO ( addr count ) \ note that the loop does not reach 0
     DO  2dup I 2@ over <>          2dup vp i cells + @ (search-wordlist) dup if ( addr count nt )
         IF  (search-wordlist) dup              nip nip unloop exit then
             IF  nip nip  UNLOOP EXIT      drop 1 -loop
             THEN  drop  
         ELSE  drop 2drop  THEN  
     [ -1 cells ] Literal +LOOP  
     2drop false ;      2drop false ;
   
 0 value locals-wordlist  0 value locals-wordlist
Line 131  slowvoc off Line 135  slowvoc off
   
 \ Only root                                            14may93py  \ Only root                                            14may93py
   
 Vocabulary Forth ( -- ) \ gforthman- search-ext  Vocabulary Forth ( -- ) \ search-ext
   \G Replace the @i{wid} at the top of the search order with the    \G Replace the @i{wid} at the top of the search order with the
   \G @i{wid} associated with the word list @code{forth-wordlist}.    \G @i{wid} associated with the word list @code{forth-wordlist}.
   
   
 Vocabulary Root ( -- ) \ gforth  Vocabulary Root ( -- ) \ gforth
   \G Add the vocabulary @code{Root} to the search order stack.    \G Add the root wordlist to the search order stack.  This vocabulary
   \G This vocabulary makes up the minimum search order and    \G makes up the minimum search order and contains only a
   \G contains these words: @code{order} @code{set-order}    \G search-order words.
   \G @code{forth-wordlist} @code{Forth} @code{words}  
   
 : Only ( -- ) \ search-ext  : Only ( -- ) \ search-ext
   \G Set the search order to the implementation-defined minimum search    \G Set the search order to the implementation-defined minimum search
   \G order (for Gforth, this is the word list @code{Root}).    \G order (for Gforth, this is the word list @code{Root}).
   1 vp! Root also ;    1 vp! Root also ;
   
   : update-image-order ( -- )
       \ save search order here, let vp point there
       here vp over vp @ 1+ cells
       dup allot move
       to vp ;
   
   : init-vp  ( -- )
       vp @ $10 max to maxvp
       maxvp 1+ cells allocate throw
       vp over vp @ 1+ cells move
       TO vp ;
   
   :noname
      init-vp DEFERS 'cold ;
   IS 'cold
   
   here 0 , to vp
   
   init-vp Only Forth also definitions
   
 \ set initial search order                             14may93py  \ set initial search order                             14may93py
   
 Forth-wordlist wordlist-id @ ' Forth >body wordlist-id !  Forth-wordlist wordlist-id @ ' Forth >body wordlist-id !
   
 0 vp! also Root also definitions  
 Only Forth also definitions  
 lookup ! \ our dictionary search order becomes the law ( -- )  lookup ! \ our dictionary search order becomes the law ( -- )
   
 ' Forth >body to Forth-wordlist \ "forth definitions get-current" and "forth-wordlist" should produce the same wid  ' Forth >body to Forth-wordlist \ "forth definitions get-current" and "forth-wordlist" should produce the same wid
Line 162  lookup ! \ our dictionary search order b Line 183  lookup ! \ our dictionary search order b
   
 : get-order  ( -- widn .. wid1 n ) \ search  : get-order  ( -- widn .. wid1 n ) \ search
   \G Copy the search order to the data stack. The current search order    \G Copy the search order to the data stack. The current search order
   \G has @i{n} entries, of which @i{wid1} represents the word list    \G has @i{n} entries, of which @i{wid1} represents the wordlist
   \G that is searched first (the word list at the top of the search    \G that is searched first (the word list at the top of the search
   \G order) and @i{widn} represents the word order that is searched    \G order) and @i{widn} represents the wordlist that is searched
   \G last.    \G last.
   vp @ 0 ?DO vp cell+ I cells + @ LOOP vp @ ;    vp @ 0 ?DO vp cell+ I cells + @ LOOP vp @ ;
   
 : set-order  ( widn .. wid1 n -- ) \ gforthman- search  : set-order  ( widn .. wid1 n -- ) \ search
     \G If @var{n}=0, empty the search order.  If @var{n}=-1, set the      \G If @var{n}=0, empty the search order.  If @var{n}=-1, set the
     \G search order to the implementation-defined minimum search order      \G search order to the implementation-defined minimum search order
     \G (for Gforth, this is the word list @code{Root}). Otherwise,      \G (for Gforth, this is the word list @code{Root}). Otherwise,
Line 181  lookup ! \ our dictionary search order b Line 202  lookup ! \ our dictionary search order b
     THEN      THEN
     dup check-maxvp      dup check-maxvp
     dup vp!      dup vp!
     ?dup IF 1- FOR vp cell+ I cells + !  NEXT THEN ;      0 swap -DO ( wid1 ... widi )
           vp i cells + ! \ note that the loop does not reach 0
       1 -loop ;
   
 : seal ( -- ) \ gforth  : seal ( -- ) \ gforth
   \G Remove all word lists from the search order stack other than the word    \G Remove all word lists from the search order stack other than the word
   \G list that is currently on the top of the search order stack.    \G list that is currently on the top of the search order stack.
   context @ 1 set-order ;    context @ 1 set-order ;
   
 : .voc  [IFUNDEF] .name
     body> >head-noprim name>string type space ;  : id. ( nt -- ) \ gforth  i-d-dot
       \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 -- ) \ F83  dot-i-d
   \G F83 name for @code{id.}.
   
   ' id. alias .name ( nt -- ) \ gforth-obsolete  dot-name
   \G Gforth <=0.5.0 name for @code{id.}.
   
   [THEN]
   
   : .voc ( wid -- ) \ gforth  dot-voc
   \G print the name of the wordlist represented by @var{wid}.  Can
   \G only print names defined with @code{vocabulary} or
   \G @code{wordlist constant}, otherwise prints @samp{???}.
       dup >r wordlist-struct %size + dup head? if ( wid nt )
           dup name>int dup >code-address docon: = swap >body @ r@ = and if
               id. rdrop exit
           endif
       endif
       drop r> body> >head-noprim id. ;
   
 : order ( -- )  \  gforthman- search-ext  : order ( -- )  \  search-ext
   \G Print the search order and the compilation word list.  The    \G Print the search order and the compilation word list.  The
   \G word lists are printed in the order in which they are searched    \G word lists are printed in the order in which they are searched
   \G (which is reversed with respect to the conventional way of    \G (which is reversed with respect to the conventional way of
Line 220  Root definitions Line 265  Root definitions
 ' words Alias words  ( -- ) \ tools  ' words Alias words  ( -- ) \ tools
 \G Display a list of all of the definitions in the word list at the top  \G Display a list of all of the definitions in the word list at the top
 \G of the search order.  \G of the search order.
 ' Forth Alias Forth  ' Forth Alias Forth \ alias- search-ext
 ' forth-wordlist alias forth-wordlist ( -- wid ) \ search  ' forth-wordlist alias forth-wordlist ( -- wid ) \ search
   \G @code{Constant} -- @i{wid} identifies the word list that includes all of the standard words    \G @code{Constant} -- @i{wid} identifies the word list that includes all of the standard words
   \G provided by Gforth. When Gforth is invoked, this word list is the compilation word    \G provided by Gforth. When Gforth is invoked, this word list is the compilation word
   \G list and is at the top of the search order.    \G list and is at the top of the search order.
 ' set-order alias set-order  ' set-order alias set-order ( wid1 ... widu u -- ) \ alias- search
 ' order alias order  ' order alias order ( -- ) \ alias- search-ext
   
 Forth definitions  Forth definitions
   

Removed from v.1.14  
changed lines
  Added in v.1.31


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