--- gforth/search.fs 1997/05/21 20:39:38 1.1 +++ gforth/search.fs 1999/11/08 22:01:09 1.12 @@ -1,6 +1,6 @@ \ search order wordset 14may93py -\ Copyright (C) 1995 Free Software Foundation, Inc. +\ Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc. \ This file is part of Gforth. @@ -23,38 +23,69 @@ 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, -: get-current ( -- wid ) current @ ; -: set-current ( wid -- ) current ! ; - -: context ( -- addr ) vp dup @ cells + ; -: definitions ( -- ) context @ current ! ; +: get-current ( -- wid ) \ search + \G @i{wid} is the identifier of the current compilation word list. + 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 Make the compilation word list the same as the word list + \G that is currently at the top of the search order stack. + context @ current ! ; \ wordlist Vocabulary also previous 14may93py -AVariable voclink - -Defer 'initvoc -' drop ' 'initvoc >body ! +Variable slowvoc 0 slowvoc ! -Variable slowvoc slowvoc off +\ Forth-wordlist AConstant Forth-wordlist -Forth-wordlist AConstant Forth-wordlist +: mappedwordlist ( map-struct -- wid ) \ gforth +\G Create a wordlist with a special map-structure. + here swap A, 0 A, voclink @ A, 0 A, + dup wordlist-link voclink ! + dup initvoc ; -: wordlist ( -- wid ) - here 0 A, +: wordlist ( -- wid ) \ search + \G Create a new, empty word list represented by @i{wid}. slowvoc @ - IF [ Forth-wordlist wordlist-map @ ] ALiteral + IF \ this is now f83search because hashing may be loaded already + \ jaw + f83search ELSE Forth-wordlist wordlist-map @ THEN - A, voclink @ A, slowvoc @ A, - dup wordlist-link dup voclink ! 'initvoc ; - -: Vocabulary ( -- ) Create wordlist drop DOES> context ! ; + mappedwordlist ; -: also ( -- ) - context @ vp @ 1+ dup maxvp > abort" Vocstack full" - vp ! context ! ; - -: previous ( -- ) vp @ 1- dup 0= abort" Vocstack empty" vp ! ; +: Vocabulary ( "name" -- ) \ gforth + \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 onto the top of the search order stack. + Create wordlist drop DOES> context ! ; + +: check-maxvp ( n -- ) + maxvp > -49 and throw ; + +: push-order ( wid -- ) \ gforth + \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 search order stack. Usually used prior + \G to @code{Forth}, @code{definitions} etc. + context @ push-order ; + +: previous ( -- ) \ search ext + \G Perform a @code{DROP} on the search order stack, thereby removing + \G the wid at the top of the (search order) stack from the search + \G order. + vp @ 1- dup 0= -50 and throw vp! ; \ vocabulary find 14may93py @@ -88,85 +119,95 @@ Forth-wordlist AConstant Forth-wordlist \ this is the wordlist-map of the dictionary Create vocsearch ( -- wordlist-map ) -' (localsvocfind) A, ' (reveal) A, ' drop A, - -\ Only root 14may93py +' (localsvocfind) A, ' (reveal) A, ' drop A, ' drop A, -wordlist \ the wordlist structure -vocsearch over wordlist-map ! \ patch the map into it +\ create dummy wordlist for kernel +slowvoc on +vocsearch mappedwordlist \ the wordlist structure ( -- wid ) + +\ we don't want the dummy wordlist in our linked list +0 Voclink ! +slowvoc off -Vocabulary Forth -Vocabulary Root +\ Only root 14may93py -: Only vp off also Root also definitions ; +Vocabulary Forth ( -- ) \ thisone- search-ext + \G Push the @i{wid} associated with @code{forth-wordlist} onto the + \G search order stack. + +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} + +: 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 ; \ set initial search order 14may93py -Forth-wordlist @ ' Forth >body ! +Forth-wordlist wordlist-id @ ' Forth >body wordlist-id ! -vp off also Root also definitions +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 \ get-order set-order 14may93py -: get-order ( -- wid1 .. widn n ) +: get-order ( -- widn .. wid1 n ) \ search + \G Copy the search order stack to the data stack. The current search + \G order has @i{n} entries, of which @i{wid1} represents the word + \G list that is searched first (the word list at the top of the stack) and + \G @i{widn} represents the word order that is searched last. vp @ 0 ?DO vp cell+ I cells + @ LOOP vp @ ; -: set-order ( wid1 .. widn n / -1 -- ) - dup -1 = IF drop Only exit THEN dup vp ! - ?dup IF 1- FOR vp cell+ I cells + ! NEXT THEN ; - -: seal ( -- ) context @ 1 set-order ; - -\ words visible in roots 14may93py - -: .name ( name -- ) \ gforth dot-name - name>string type space ; - -require termsize.fs - -: words ( -- ) \ tools - cr 0 context @ - BEGIN - @ dup - WHILE - 2dup name>string nip 2 + dup >r + - cols >= - IF - cr nip 0 swap - THEN - dup .name space r> rot + swap - REPEAT - 2drop ; - -' words alias vlist ( -- ) \ gforth -\g Old (pre-Forth-83) name for @code{WORDS}. - -: body> ( data -- cfa ) 0 >body - ; +: set-order ( widn .. wid1 n -- ) \ thisone- 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, + \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! + ?dup IF 1- FOR vp cell+ I cells + ! NEXT THEN ; + +: 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> >name .name ; -: order ( -- ) \ search-ext - \g prints the search order and the @code{current} wordlist. The - \g standard requires that the wordlists are printed in the order - \g in which they are searched. Therefore, the output is reversed - \g with respect to the conventional way of displaying stacks. The - \g @code{current} wordlist is displayed last. + body> >head name>string type space ; + +: order ( -- ) \ thisone- 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 + \G displaying stacks). The compilation word list 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 ?DO .voc LOOP 4 spaces get-current .voc ; + : vocs ( -- ) \ gforth - \g prints vocabularies and wordlists defined in the system. + \G List vocabularies and wordlists defined in the system. voclink BEGIN - @ dup @ + @ dup WHILE dup 0 wordlist-link - .voc REPEAT @@ -174,59 +215,16 @@ require termsize.fs Root definitions -' words Alias words +' 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-wordlist alias forth-wordlist +' 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 word list stack. ' set-order alias set-order ' order alias order Forth definitions -include hash.fs - -\ table (case-sensitive wordlist) - -: table-find ( addr len wordlist -- nfa / false ) - >r 2dup r> bucket @ (tablefind) ; - -Create tablesearch-map ( -- wordlist-map ) - ' table-find A, ' hash-reveal A, ' (rehash) A, - -: table ( -- wid ) - \g create a case-sensitive wordlist - wordlist - tablesearch-map over wordlist-map ! ; - -\ marker 18dec94py - -\ Marker creates a mark that is removed (including everything -\ defined afterwards) when executing the mark. - -: marker, ( -- mark ) here dup A, - voclink @ A, voclink - BEGIN @ dup @ WHILE dup 0 wordlist-link - @ A, REPEAT drop - udp @ , ; - -: marker! ( mark -- ) - dup @ swap cell+ - dup @ voclink ! cell+ - voclink - BEGIN - @ dup @ - WHILE - over @ over 0 wordlist-link - ! - swap cell+ swap - REPEAT - drop voclink - BEGIN - @ dup @ - WHILE - dup 0 wordlist-link - rehash - REPEAT - drop - @ udp ! dp ! ; - -: marker ( "mark" -- ) - marker, Create A, -DOES> ( -- ) - @ marker! ;