[gforth] / gforth / hash.fs  

gforth: gforth/hash.fs

Diff for /gforth/hash.fs between version 1.14 and 1.33

version 1.14, Mon May 13 16:36:58 1996 UTC version 1.33, Sun Mar 9 15:16:50 2003 UTC
Line 1 
Line 1 
 \ Hashed dictionaries                                  15jul94py  \ Hashed dictionaries                                  15jul94py
   
 \ Copyright (C) 1995 Free Software Foundation, Inc.  \ Copyright (C) 1995,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.
   
 11 value hashbits  [IFUNDEF] erase
   : erase ( addr len -- ) 0 fill ;
   [THEN]
   
   [IFUNDEF] allocate
   : reserve-mem here swap allot ;
   \ move to a kernel/memory.fs
   [ELSE]
   : reserve-mem allocate throw ;
   [THEN]
   
   [IFUNDEF] hashbits
   11 Value hashbits
   [THEN]
 1 hashbits lshift Value Hashlen  1 hashbits lshift Value Hashlen
   
   \ compute hash key                                     15jul94py
   
   has? ec [IF] [IFUNDEF] hash
   : hash ( addr len -- key )
     over c@ swap 1- IF swap char+ c@ + ELSE nip THEN
     [ Hashlen 1- ] literal and ;
   [THEN] [THEN]
   
   [IFUNDEF] hash
   : hash ( addr len -- key )
       hashbits (hashkey1) ;
   [THEN]
   
 Variable insRule        insRule on  Variable insRule        insRule on
 Variable revealed  Variable revealed
   
 \ Memory handling                                      10oct94py  \ Memory handling                                      10oct94py
   
 Variable HashPointer  AVariable HashPointer
 Variable HashIndex  Variable HashIndex     \ Number of wordlists
 0 Value HashTable  Variable HashPop       \ Number of words
   0 AValue HashTable
   
   \ forward declarations
   0 AValue hashsearch-map
   Defer hash-alloc ( addr -- addr )
   
 \ DelFix and NewFix are from bigFORTH                  15jul94py  \ DelFix and NewFix are from bigFORTH                  15jul94py
   
 : DelFix ( addr root -- ) dup @ 2 pick ! ! ;  : DelFix ( addr root -- ) dup @ 2 pick ! ! ;
 : NewFix  ( root len # -- addr )  : NewFix  ( root len # -- addr )
   BEGIN  2 pick @ ?dup  0= WHILE  2dup * allocate throw    BEGIN  2 pick @ ?dup  0= WHILE  2dup * reserve-mem
          over 0 ?DO  dup 4 pick DelFix 2 pick +  LOOP  drop           over 0 ?DO  dup 4 pick DelFix 2 pick +  LOOP  drop
   REPEAT  >r drop r@ @ rot ! r@ swap erase r> ;    REPEAT  >r drop r@ @ rot ! r@ swap erase r> ;
   
 \ compute hash key                                     15jul94py  
   
 : hash ( addr len -- key )  
     hashbits (hashkey1) ;  
 \   (hashkey)  
 \   Hashlen 1- and ;  
   
 : bucket ( addr len wordlist -- bucket-addr )  : bucket ( addr len wordlist -- bucket-addr )
     \ @var{bucket-addr} is the address of a cell that points to the first      \ @var{bucket-addr} is the address of a cell that points to the first
     \ element in the list of the bucket for the string @var{addr len}      \ element in the list of the bucket for the string @var{addr len}
Line 52 
Line 76 
     cells HashTable + ;      cells HashTable + ;
   
 : hash-find ( addr len wordlist -- nfa / false )  : hash-find ( addr len wordlist -- nfa / false )
     >r 2dup r> bucket @ (hashfind) ;      >r 2dup r> bucket @ (hashlfind) ;
   
 \ hash vocabularies                                    16jul94py  \ hash vocabularies                                    16jul94py
   
Line 60 
Line 84 
   BEGIN  dup @ dup  WHILE  nip  REPEAT  drop ! ;    BEGIN  dup @ dup  WHILE  nip  REPEAT  drop ! ;
   
 : (reveal ( nfa wid -- )  : (reveal ( nfa wid -- )
     dup wordlist-extend @ 0<  
     IF  
         2drop EXIT  
     THEN  
     over name>string rot bucket >r      over name>string rot bucket >r
     HashPointer 2 Cells $400 NewFix      HashPointer 2 Cells $400 NewFix
     tuck cell+ ! r> insRule @      tuck cell+ ! r> insRule @
Line 72 
Line 92 
     ELSE      ELSE
         lastlink!          lastlink!
     THEN      THEN
     revealed on ;      revealed on 1 HashPop +! 0 hash-alloc drop ;
   
 : hash-reveal ( nfa wid -- )  : hash-reveal ( nfa wid -- )
     2dup (reveal) (reveal ;      2dup (reveal) (reveal ;
   
   : inithash ( wid -- )
       wordlist-extend
       insRule @ >r  insRule off  1 hash-alloc over ! 3 cells -
       dup wordlist-id
       BEGIN  @ dup  WHILE  2dup swap (reveal  REPEAT
       2drop  r> insRule ! ;
   
 : addall  ( -- )  : addall  ( -- )
     voclink      HashPop off voclink
     BEGIN  @ dup @  WHILE  dup 'initvoc  REPEAT  drop ;      BEGIN  @ dup WHILE
              dup 0 wordlist-link -
              dup wordlist-map @ reveal-method @ ['] hash-reveal =
              IF  inithash ELSE drop THEN
       REPEAT  drop ;
   
 : clearhash  ( -- )  : clearhash  ( -- )
     HashTable Hashlen cells bounds      HashTable Hashlen cells bounds
     DO  I @      DO  I @
         BEGIN  dup  WHILE          BEGIN  dup  WHILE
                dup @ swap HashPointer DelFix                 dup @ swap HashPointer DelFix
         REPEAT  I !          REPEAT
     cell +LOOP  HashIndex off ;          I !
           cell +LOOP
       HashIndex off
       voclink
       BEGIN ( wordlist-link-addr )
           @ dup
       WHILE ( wordlist-link )
           dup 0 wordlist-link - ( wordlist-link wid )
           dup wordlist-map @ hashsearch-map =
           IF ( wordlist-link wid )
               0 swap wordlist-extend !
           ELSE
               drop
           THEN
       REPEAT
       drop ;
   
   : rehashall  ( wid -- )
     drop revealed @
     IF    clearhash addall revealed off
     THEN ;
   
   : (rehash)   ( wid -- )
     dup wordlist-extend @ 0=
     IF   inithash
     ELSE rehashall THEN ;
   
 : re-hash  clearhash addall ;  : hashdouble ( -- )
 : (rehash) ( addr -- )      HashTable >r clearhash
   drop revealed @ IF  re-hash revealed off  THEN ;      1 hashbits 1+ dup  to hashbits  lshift  to hashlen
       r> free >r  0 to HashTable
       addall r> throw ;
   
 Create hashsearch-map ( -- wordlist-map )  const Create (hashsearch-map)
     ' hash-find A, ' hash-reveal A, ' (rehash) A,  ' hash-find A, ' hash-reveal A, ' (rehash) A, ' (rehash) A,
   (hashsearch-map) to hashsearch-map
   
 \ hash allocate and vocabulary initialization          10oct94py  \ hash allocate and vocabulary initialization          10oct94py
   
 : hash-alloc ( addr -- addr )  HashTable 0= IF  :noname ( n+ -- n )
   Hashlen cells allocate throw TO HashTable    HashTable 0=
     IF  Hashlen cells reserve-mem TO HashTable
   HashTable Hashlen cells erase THEN    HashTable Hashlen cells erase THEN
   HashIndex @ over !  1 HashIndex +!    HashIndex @ swap HashIndex +!
   HashIndex @ Hashlen >=    HashIndex @ Hashlen >=
   IF  clearhash    [ [IFUNDEF] allocate ]
       1 hashbits 1+ dup  to hashbits  lshift  to hashlen    ABORT" no more space in hashtable"
       HashTable free    [ [ELSE] ]
       addall    HashPop @ hashlen 2* >= or
   THEN ;    IF  hashdouble  THEN
     [ [THEN] ] ; is hash-alloc
 : (initvoc) ( addr -- )  
     cell+ dup @ 0< IF  drop EXIT  THEN  
     insRule @ >r  insRule off  hash-alloc  
     3 cells - hashsearch-map over cell+ ! dup  
     BEGIN  @ dup  WHILE  2dup swap (reveal  REPEAT  
     2drop  r> insRule ! ;  
   
 ' (initvoc) ' 'initvoc >body !  
   
 \ Hash-Find                                            01jan93py  \ Hash-Find                                            01jan93py
   has? cross 0=
   [IF]
   : make-hash
     hashsearch-map forth-wordlist wordlist-map !
     addall ;
     make-hash \ Baumsuche ist installiert.
   [ELSE]
     hashsearch-map forth-wordlist wordlist-map !
   [THEN]
   
 addall          \ Baum aufbauen  \ for ec version display that vocabulary goes hashed
 \ Baumsuche ist installiert.  
   
 : hash-cold  ( -- ) Defers 'cold  : hash-cold  ( -- )
   [ has? ec [IF] ] ." Hashing..." [ [THEN] ]
   HashPointer off  0 TO HashTable  HashIndex off    HashPointer off  0 TO HashTable  HashIndex off
   voclink    addall
   BEGIN  @ dup @  WHILE  \  voclink
          dup cell - @ >r  \  BEGIN  @ dup WHILE
          dup 'initvoc  \         dup 0 wordlist-link - initvoc
          r> over cell - !  \  REPEAT  drop
   REPEAT  drop ;  [ has? ec [IF] ] ." Done" cr [ [THEN] ] ;
 ' hash-cold ' 'cold >body !  
   ' hash-cold INIT8 chained
   
 : .words  ( -- )  : .words  ( -- )
   base @ >r hex HashTable  Hashlen 0    base @ >r hex HashTable  Hashlen 0
   DO  cr  i 2 .r ." : " dup i cells +    DO  cr  i 2 .r ." : " dup i cells +
       BEGIN  @ dup  WHILE        BEGIN  @ dup  WHILE
              dup cell+ @ .name  REPEAT  drop               dup cell+ @ name>string type space  REPEAT  drop
   LOOP  drop r> base ! ;    LOOP  drop r> base ! ;
   
 \ \ this stuff is for evaluating the hash function  \ \ this stuff is for evaluating the hash function

Generate output suitable for use with a patch program
Legend:
Removed from v.1.14  
changed lines
  Added in v.1.33
CVS Admin

Powered by ViewCVS 1.0-dev 		(Powered by ViewCVS)

ViewCVS and CVS Help