[BACK]Return to search.fs CVS log [TXT] [DIR] Up to [gforth] / gforth

Diff for /gforth/search.fs between versions 1.9 and 1.25

version 1.9, 1999/03/29 22:52:29 version 1.25, 2003/03/09 15:16:52
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 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)
   
 : get-current  ( -- wid ) \ search  : get-current  ( -- wid ) \ search
   \G @var{wid} is the identifier of the current compilation word list.    \G @i{wid} is the identifier of the current compilation word list.
   current @ ;    current @ ;
   
 : set-current  ( wid -- )  \ search  : set-current  ( wid -- )  \ search
   \G Set the compilation word list to the word list identified by @var{wid}.    \G Set the compilation word list to the word list identified by @i{wid}.
   current ! ;    current ! ;
   
 \ : context ( -- addr )  vp dup @ cells + ;  :noname ( -- addr )
 : vp! dup vp ! cells vp + to context ;      vp dup @ cells + ;
   is context
   
   : vp! ( u -- )
       vp ! ;
 : definitions  ( -- ) \ search  : definitions  ( -- ) \ search
   \G Make the compilation word list the same as the word list    \G Set the compilation word list to be the same as the word list
   \G that is currently at the top of the search order stack.    \G that is currently at the top of the search order.
   context @ current ! ;    context @ current ! ;
   
 \ wordlist Vocabulary also previous                    14may93py  \ wordlist Vocabulary also previous                    14may93py
Line 51  Variable slowvoc   0 slowvoc ! Line 56  Variable slowvoc   0 slowvoc !
   dup initvoc ;    dup initvoc ;
   
 : wordlist  ( -- wid ) \ search  : wordlist  ( -- wid ) \ search
   \G Create a new, empty word list represented by @var{wid}.    \G Create a new, empty word list represented by @i{wid}.
   slowvoc @    slowvoc @
   IF    \ this is now f83search because hashing may be loaded already    IF    \ this is now f83search because hashing may be loaded already
         \ jaw          \ jaw
Line 61  Variable slowvoc   0 slowvoc ! Line 66  Variable slowvoc   0 slowvoc !
   
 : Vocabulary ( "name" -- ) \ gforth  : Vocabulary ( "name" -- ) \ gforth
   \G Create a definition "name" and associate a new word list with it.    \G Create a definition "name" and associate a new word list with it.
   \G The run-time effect of "name" is to push the new word list's wid    \G The run-time effect of "name" is to replace the @i{wid} at the
   \G onto the top of the search order stack.    \G top of the search order with the @i{wid} associated with the new
     \G word list.
   Create wordlist drop  DOES> context ! ;    Create wordlist drop  DOES> context ! ;
   
 : also  ( -- ) \ search ext  : check-maxvp ( n -- )
   \G Perform a @code{DUP} on the search order stack. Usually used prior     dup maxvp-limit > -49 and throw
   \G to @code{Forth}, @code{definitions} etc.     dup maxvp > IF
   context @ vp @ 1+ dup maxvp > abort" Vocstack full"        BEGIN  dup  maxvp 2* dup TO maxvp  <= UNTIL
   vp! context ! ;        vp  maxvp 1+ cells resize throw TO vp
      THEN drop ;
 : previous ( -- ) \ search ext  
   \G Perform a @code{DROP} on the search order stack, thereby removing the wid at the  : >order ( wid -- ) \ gforth to-order
   \G top of the (search order) stack from the search order.      \g Push @var{wid} on the search order.
   vp @ 1- dup 0= abort" Vocstack empty" vp! ;      vp @ 1+ dup check-maxvp vp! context ! ;
   
   : also  ( -- ) \ search-ext
     \G Like @code{DUP} for the search order. Usually used before a
     \G vocabulary (e.g., @code{also Forth}); the combined effect is to push
     \G the wordlist represented by the vocabulary on the search order.
     context @ >order ;
   
   : previous ( -- ) \ search-ext
     \G Drop the wordlist at the top of the search order.
     vp @ 1- dup 0= -50 and throw vp! ;
   
 \ vocabulary find                                      14may93py  \ vocabulary find                                      14may93py
   
Line 120  slowvoc off Line 136  slowvoc off
   
 \ Only root                                            14may93py  \ Only root                                            14may93py
   
 Vocabulary Forth ( -- ) \ thisone- search-ext  Vocabulary Forth ( -- ) \ gforthman- search-ext
   \G Push the @var{wid} associated with @code{forth-wordlist} onto the    \G Replace the @i{wid} at the top of the search order with the
   \G search order stack.    \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 149  lookup ! \ our dictionary search order b Line 183  lookup ! \ our dictionary search order b
 \ get-order set-order                                  14may93py  \ get-order set-order                                  14may93py
   
 : get-order  ( -- widn .. wid1 n ) \ search  : get-order  ( -- widn .. wid1 n ) \ search
   \G Copy the search order stack to the data stack. The current search    \G Copy the search order to the data stack. The current search order
   \G order has @var{n} entries, of which @var{wid1} represents the word    \G has @i{n} entries, of which @i{wid1} represents the wordlist
   \G list that is searched first (the word list at the top of the stack) and    \G that is searched first (the word list at the top of the search
   \G @var{widn} represents the word order that is searched last.    \G order) and @i{widn} represents the wordlist that is searched
   vp @ 0 ?DO  vp cell+ I cells + @  LOOP  vp @ ;    \G last.
     vp @ 0 ?DO vp cell+ I cells + @ LOOP vp @ ;
 : set-order  ( widn .. wid1 n -- ) \ thisone- search  
   \G If @var{n}=0, empty the search order.  : set-order  ( widn .. wid1 n -- ) \ gforthman- search
   \G If @var{n}=-1, set the search order to the implementation-defined minimum search      \G If @var{n}=0, empty the search order.  If @var{n}=-1, set the
   \G order (for Gforth, this is the word list @code{Root}). Otherwise, replace the      \G search order to the implementation-defined minimum search order
   \G existing search order with the @var{n} wid entries such that @var{wid1} represents the      \G (for Gforth, this is the word list @code{Root}). Otherwise,
   \G word list that will be searched first and @var{widn} represents the word list that      \G replace the existing search order with the @var{n} wid entries
   \G will be searched last.      \G such that @var{wid1} represents the word list that will be
   dup -1 = IF  drop Only exit  THEN  dup vp!      \G searched first and @var{widn} represents the word list that will
   ?dup IF  1- FOR  vp cell+ I cells + !  NEXT  THEN ;      \G be searched last.
       dup -1 = IF
           drop only exit
       THEN
       dup check-maxvp
       dup vp!
       ?dup IF 1- FOR vp cell+ I cells + !  NEXT THEN ;
   
 : 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 name>string type space ;  : id. ( nt -- ) \ gforth
       \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 -- )
   \G F83 name for @code{id.}.
   
   ' id. alias .name ( nt -- )
   \G Gforth <=0.5.0 name for @code{id.}.
   
   [THEN]
   
   : .voc ( wid -- ) \ gforth
   \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 ( -- )  \  thisone- search-ext  : order ( -- )  \  gforthman- 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 204  Root definitions Line 266  Root definitions
 \G of the search order.  \G of the search order.
 ' Forth Alias Forth  ' Forth Alias Forth
 ' forth-wordlist alias forth-wordlist ( -- wid ) \ search  ' forth-wordlist alias forth-wordlist ( -- wid ) \ search
   \G CONSTANT: @var{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 word list stack.    \G list and is at the top of the search order.
 ' set-order alias set-order  ' set-order alias set-order
 ' order alias order  ' order alias order
   
Removed from v.1.9  
changed lines
  Added in v.1.25

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