--- gforth/search.fs 1999/12/03 18:24:23 1.13 +++ gforth/search.fs 2011/12/31 15:29:25 1.34 @@ -1,12 +1,12 @@ \ search order wordset 14may93py -\ Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc. +\ Copyright (C) 1995,1996,1997,1998,2000,2003,2005,2007,2011 Free Software Foundation, Inc. \ This file is part of Gforth. \ Gforth is free software; you can redistribute it and/or \ 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. \ This program is distributed in the hope that it will be useful, @@ -15,13 +15,15 @@ \ GNU General Public License for more details. \ You should have received a copy of the GNU General Public License -\ along with this program; if not, write to the Free Software -\ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. +\ along with this program. If not, see http://www.gnu.org/licenses/. -$10 constant maxvp -Variable vp - 0 A, 0 A, 0 A, 0 A, 0 A, 0 A, 0 A, 0 A, - 0 A, 0 A, 0 A, 0 A, 0 A, 0 A, 0 A, 0 A, +require struct.fs + +$10 Value maxvp \ current size of search order stack +$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 \G @i{wid} is the identifier of the current compilation word list. @@ -50,7 +52,7 @@ Variable slowvoc 0 slowvoc ! : mappedwordlist ( map-struct -- wid ) \ gforth \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 initvoc ; @@ -71,33 +73,34 @@ Variable slowvoc 0 slowvoc ! Create wordlist drop DOES> context ! ; : 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. vp @ 1+ dup check-maxvp vp! context ! ; : also ( -- ) \ search-ext - \G Perform a @code{DUP} on the @var{wid} at the top of the search - \G order. Usually used prior to @code{Forth} etc. - context @ push-order ; + \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 Perform a @code{DROP} on the @i{wid} at the top of the search - \G order, thereby removing the @i{wid} from the search order. + \G Drop the wordlist at the top of the search order. vp @ 1- dup 0= -50 and throw vp! ; \ vocabulary find 14may93py : (vocfind) ( addr count wid -- nfa|false ) \ !! generalize this to be independent of vp - drop vp dup @ 1- cells over + - DO 2dup I 2@ over <> - IF (search-wordlist) dup - IF nip nip UNLOOP EXIT - THEN drop - ELSE drop 2drop THEN - [ -1 cells ] Literal +LOOP + drop 0 vp @ -DO ( addr count ) \ note that the loop does not reach 0 + 2dup vp i cells + @ (search-wordlist) dup if ( addr count nt ) + nip nip unloop exit then + drop 1 -loop 2drop false ; 0 value locals-wordlist @@ -131,28 +134,45 @@ slowvoc off \ 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 @i{wid} associated with the word list @code{forth-wordlist}. Vocabulary Root ( -- ) \ gforth - \G Add the vocabulary @code{Root} to the search order stack. - \G This vocabulary makes up the minimum search order and - \G contains these words: @code{order} @code{set-order} - \G @code{forth-wordlist} @code{Forth} @code{words} + \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 + +init-vp Only Forth also definitions + \ set initial search order 14may93py 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 ( -- ) ' Forth >body to Forth-wordlist \ "forth definitions get-current" and "forth-wordlist" should produce the same wid @@ -162,13 +182,13 @@ lookup ! \ our dictionary search order b : get-order ( -- widn .. wid1 n ) \ search \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 order) and @i{widn} represents the word order that is searched + \G order) and @i{widn} represents the wordlist that is searched \G last. 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 search order to the implementation-defined minimum search order \G (for Gforth, this is the word list @code{Root}). Otherwise, @@ -181,17 +201,41 @@ lookup ! \ our dictionary search order b THEN dup check-maxvp 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 \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 ; -: .voc - body> >head name>string type space ; +[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? true = 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 word lists are printed in the order in which they are searched \G (which is reversed with respect to the conventional way of @@ -220,13 +264,13 @@ Root definitions ' words Alias words ( -- ) \ tools \G Display a list of all of the definitions in the word list at the top \G of the search order. -' Forth Alias Forth +' Forth Alias Forth \ alias- search-ext ' 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 -' order alias order +' set-order alias set-order ( wid1 ... widu u -- ) \ alias- search +' order alias order ( -- ) \ alias- search-ext Forth definitions