Diff for /gforth/search.fs between versions 1.6 and 1.32

version 1.6, 1998/12/08 22:02:51 version 1.32, 2007/12/31 18:40:24
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.
   
 \ Gforth is free software; you can redistribute it and/or  \ Gforth is free software; you can redistribute it and/or
 \ modify it under the terms of the GNU General Public License  \ modify it under the terms of the GNU General Public License
 \ as published by the Free Software Foundation; either version 2  \ as published by the Free Software Foundation, either version 3
 \ of the License, or (at your option) any later version.  \ of the License, or (at your option) any later version.
   
 \ This program is distributed in the hope that it will be useful,  \ This program is distributed in the hope that it will be useful,
Line 15 Line 15
 \ GNU General Public License for more details.  \ GNU General Public License for more details.
   
 \ 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, see http://www.gnu.org/licenses/.
 \ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, 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 )  current @ ;  \ the first cell at vp contains the search order depth, the others
 : set-current  ( wid -- )  current ! ;  \ contain the wordlists, starting with the last-searched one.
   
 \ : context ( -- addr )  vp dup @ cells + ;  : get-current  ( -- wid ) \ search
 : vp! dup vp ! cells vp + to context ;    \G @i{wid} is the identifier of the current compilation word list.
 : definitions  ( -- )  context @ current ! ;    current @ ;
   
   : set-current  ( wid -- )  \ search
     \G Set the compilation word list to the word list identified by @i{wid}.
     current ! ;
   
   :noname ( -- addr )
       vp dup @ cells + ;
   is context
   
   : vp! ( u -- )
       vp ! ;
   : definitions  ( -- ) \ search
     \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.
     context @ current ! ;
   
 \ wordlist Vocabulary also previous                    14may93py  \ wordlist Vocabulary also previous                    14may93py
   
Line 37  Variable slowvoc   0 slowvoc ! Line 51  Variable slowvoc   0 slowvoc !
 \ Forth-wordlist AConstant Forth-wordlist  \ Forth-wordlist AConstant Forth-wordlist
   
 : mappedwordlist ( map-struct -- wid )  \ gforth  : mappedwordlist ( map-struct -- wid )  \ gforth
 \G creates 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 ;
   
 : wordlist  ( -- wid )  : wordlist  ( -- wid ) \ search
     \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 50  Variable slowvoc   0 slowvoc ! Line 65  Variable slowvoc   0 slowvoc !
   ELSE  Forth-wordlist wordlist-map @   THEN    ELSE  Forth-wordlist wordlist-map @   THEN
   mappedwordlist ;    mappedwordlist ;
   
 : Vocabulary ( -- ) Create wordlist drop  DOES> context ! ;  : Vocabulary ( "name" -- ) \ gforth
     \G Create a definition "name" and associate a new word list with it.
 : also  ( -- )    \G The run-time effect of "name" is to replace the @i{wid} at the
   context @ vp @ 1+ dup maxvp > abort" Vocstack full"    \G top of the search order with the @i{wid} associated with the new
   vp! context ! ;    \G word list.
     Create wordlist drop  DOES> context ! ;
 : previous ( -- )  vp @ 1- dup 0= abort" Vocstack empty" vp! ;  
   : check-maxvp ( n -- )
      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 ;
   
   : >order ( wid -- ) \ gforth to-order
       \g Push @var{wid} on the search order.
       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
   
 : (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 102  slowvoc off Line 134  slowvoc off
   
 \ Only root                                            14may93py  \ Only root                                            14may93py
   
 Vocabulary Forth  Vocabulary Forth ( -- ) \ search-ext
 Vocabulary Root    \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}.
   
   
   Vocabulary Root ( -- ) \ gforth
     \G Add the root wordlist to the search order stack.  This vocabulary
     \G makes up the minimum search order and contains only a
     \G search-order words.
   
   : Only ( -- ) \ search-ext
     \G Set the search order to the implementation-defined minimum search
     \G order (for Gforth, this is the word list @code{Root}).
     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
   
 : Only  1 vp! Root also ;  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 120  lookup ! \ our dictionary search order b Line 180  lookup ! \ our dictionary search order b
   
 \ get-order set-order                                  14may93py  \ get-order set-order                                  14may93py
   
 : get-order  ( -- wid1 .. widn n )  : get-order  ( -- widn .. wid1 n ) \ search
   vp @ 0 ?DO  vp cell+ I cells + @  LOOP  vp @ ;    \G Copy the search order to the data stack. The current search order
     \G has @i{n} entries, of which @i{wid1} represents the wordlist
 : set-order  ( wid1 .. widn n / -1 -- )    \G that is searched first (the word list at the top of the search
   dup -1 = IF  drop Only exit  THEN  dup vp!    \G order) and @i{widn} represents the wordlist that is searched
   ?dup IF  1- FOR  vp cell+ I cells + !  NEXT  THEN ;    \G last.
     vp @ 0 ?DO vp cell+ I cells + @ LOOP vp @ ;
 : seal ( -- )  context @ 1 set-order ;  
   : set-order  ( widn .. wid1 n -- ) \ search
 : .voc      \G If @var{n}=0, empty the search order.  If @var{n}=-1, set the
     body> >head name>string type space ;      \G search order to the implementation-defined minimum search order
       \G (for Gforth, this is the word list @code{Root}). Otherwise,
       \G replace the existing search order with the @var{n} wid entries
       \G such that @var{wid1} represents the word list that will be
       \G searched first and @var{widn} represents the word list that will
       \G be searched last.
       dup -1 = IF
           drop only exit
       THEN
       dup check-maxvp
       dup vp!
       0 swap -DO ( wid1 ... widi )
           vp i cells + ! \ note that the loop does not reach 0
       1 -loop ;
   
   : seal ( -- ) \ gforth
     \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.
     context @ 1 set-order ;
   
   [IFUNDEF] .name
   : 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 ( -- )  \  search-ext  : order ( -- )  \  search-ext
     \g prints the search order and the @code{current} wordlist.  The    \G Print the search order and the compilation word list.  The
     \g standard requires that the wordlists are printed in the order    \G word lists are printed in the order in which they are searched
     \g in which they are searched. Therefore, the output is reversed    \G (which is reversed with respect to the conventional way of
     \g with respect to the conventional way of displaying stacks. The    \G displaying stacks). The compilation word list is displayed last.
     \g @code{current} wordlist is displayed last.    \ The standard requires that the word lists are printed in the order
     \ in which they are searched. Therefore, the output is reversed
     \ with respect to the conventional way of displaying stacks.
     get-order 0      get-order 0
     ?DO      ?DO
         .voc          .voc
Line 145  lookup ! \ our dictionary search order b Line 250  lookup ! \ our dictionary search order b
     4 spaces get-current .voc ;      4 spaces get-current .voc ;
   
 : vocs ( -- ) \ gforth  : vocs ( -- ) \ gforth
     \g prints vocabularies and wordlists defined in the system.      \G List vocabularies and wordlists defined in the system.
     voclink      voclink
     BEGIN      BEGIN
         @ dup          @ dup
Line 156  lookup ! \ our dictionary search order b Line 261  lookup ! \ our dictionary search order b
   
 Root definitions  Root definitions
   
 ' words Alias words  ' words Alias words  ( -- ) \ tools
 ' Forth Alias Forth  \G Display a list of all of the definitions in the word list at the top
 ' forth-wordlist alias forth-wordlist  \G of the search order.
 ' set-order alias set-order  ' Forth Alias Forth \ alias- search-ext
 ' order alias order  ' forth-wordlist alias forth-wordlist ( -- wid ) \ search
     \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 list and is at the top of the search order.
   ' set-order alias set-order ( wid1 ... widu u -- ) \ alias- search
   ' order alias order ( -- ) \ alias- search-ext
   
 Forth definitions  Forth definitions
   

Removed from v.1.6  
changed lines
  Added in v.1.32


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