1: \ Hashed dictionaries 15jul94py
2:
3: \ Copyright (C) 1995 Free Software Foundation, Inc.
4:
5: \ This file is part of Gforth.
6:
7: \ Gforth is free software; you can redistribute it and/or
8: \ modify it under the terms of the GNU General Public License
9: \ as published by the Free Software Foundation; either version 2
10: \ of the License, or (at your option) any later version.
11:
12: \ This program is distributed in the hope that it will be useful,
13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: \ GNU General Public License for more details.
16:
17: \ You should have received a copy of the GNU General Public License
18: \ along with this program; if not, write to the Free Software
19: \ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20:
21: [IFUNDEF] allocate
22: : reserve-mem here swap allot ;
23: \ move to a kernel/memory.fs
24: [ELSE]
25: : reserve-mem allocate throw ;
26: [THEN]
27:
28: [IFUNDEF] hashbits
29: 11 Value hashbits
30: [THEN]
31: 1 hashbits lshift Value Hashlen
32:
33: \ compute hash key 15jul94py
34:
35: [IFUNDEF] hash
36: : hash ( addr len -- key )
37: hashbits (hashkey1) ;
38: [THEN]
39:
40: Variable insRule insRule on
41: Variable revealed
42:
43: \ Memory handling 10oct94py
44:
45: Variable HashPointer
46: Variable HashIndex
47: 0 Value HashTable
48:
49: \ forward declarations
50: 0 Value hashsearch-map
51: Defer hash-alloc
52:
53: \ DelFix and NewFix are from bigFORTH 15jul94py
54:
55: : DelFix ( addr root -- ) dup @ 2 pick ! ! ;
56: : NewFix ( root len # -- addr )
57: BEGIN 2 pick @ ?dup 0= WHILE 2dup * reserve-mem
58: over 0 ?DO dup 4 pick DelFix 2 pick + LOOP drop
59: REPEAT >r drop r@ @ rot ! r@ swap erase r> ;
60:
61: : bucket ( addr len wordlist -- bucket-addr )
62: \ @var{bucket-addr} is the address of a cell that points to the first
63: \ element in the list of the bucket for the string @var{addr len}
64: wordlist-extend @ -rot hash xor ( bucket# )
65: cells HashTable + ;
66:
67: : hash-find ( addr len wordlist -- nfa / false )
68: >r 2dup r> bucket @ (hashfind) ;
69:
70: \ hash vocabularies 16jul94py
71:
72: : lastlink! ( addr link -- )
73: BEGIN dup @ dup WHILE nip REPEAT drop ! ;
74:
75: : (reveal ( nfa wid -- )
76: over name>string rot bucket >r
77: HashPointer 2 Cells $400 NewFix
78: tuck cell+ ! r> insRule @
79: IF
80: dup @ 2 pick ! !
81: ELSE
82: lastlink!
83: THEN
84: revealed on ;
85:
86: : hash-reveal ( nfa wid -- )
87: 2dup (reveal) (reveal ;
88:
89: : inithash ( wid -- )
90: wordlist-extend
91: insRule @ >r insRule off hash-alloc 3 cells - dup
92: BEGIN @ dup WHILE 2dup swap (reveal REPEAT
93: 2drop r> insRule ! ;
94:
95: : addall ( -- )
96: voclink
97: BEGIN @ dup WHILE
98: dup 0 wordlist-link -
99: dup wordlist-map @ hashsearch-map =
100: IF inithash ELSE drop THEN
101: REPEAT drop ;
102:
103: : clearhash ( -- )
104: HashTable Hashlen cells bounds
105: DO I @
106: BEGIN dup WHILE
107: dup @ swap HashPointer DelFix
108: REPEAT I !
109: cell +LOOP HashIndex off
110: voclink
111: BEGIN @ dup WHILE
112: dup 0 wordlist-link -
113: dup wordlist-map @ hashsearch-map =
114: IF 0 swap wordlist-extend ! ELSE drop THEN
115: REPEAT drop ;
116:
117: : rehashall ( wid -- )
118: drop revealed @
119: IF clearhash addall revealed off
120: THEN ;
121:
122: : (rehash) ( wid -- )
123: dup wordlist-extend @ 0=
124: IF inithash
125: ELSE rehashall THEN ;
126:
127: \ >rom ?!
128: align here ' hash-find A, ' hash-reveal A, ' (rehash) A, ' (rehash) A,
129: to hashsearch-map
130:
131: \ hash allocate and vocabulary initialization 10oct94py
132:
133: :noname ( hash-alloc ) ( addr -- addr )
134: HashTable 0=
135: IF Hashlen cells reserve-mem TO HashTable
136: HashTable Hashlen cells erase THEN
137: HashIndex @ over ! 1 HashIndex +!
138: HashIndex @ Hashlen >=
139: [ [IFUNDEF] allocate ]
140: ABORT" no more space in hashtable"
141: [ [ELSE] ]
142: IF HashTable >r clearhash
143: 1 hashbits 1+ dup to hashbits lshift to hashlen
144: r> free >r 0 to HashTable
145: addall r> throw
146: THEN
147: [ [THEN] ] ; is hash-alloc
148:
149: \ Hash-Find 01jan93py
150: has? cross 0=
151: [IF]
152: : make-hash
153: hashsearch-map forth-wordlist cell+ !
154: addall ;
155: make-hash \ Baumsuche ist installiert.
156: [ELSE]
157: hashsearch-map forth-wordlist cell+ !
158: [THEN]
159:
160: \ for ec version display that vocabulary goes hashed
161:
162: : hash-cold ( -- )
163: [ has? ec [IF] ] ." Hashing..." [ [THEN] ]
164: HashPointer off 0 TO HashTable HashIndex off
165: addall
166: \ voclink
167: \ BEGIN @ dup WHILE
168: \ dup 0 wordlist-link - initvoc
169: \ REPEAT drop
170: [ has? ec [IF] ] ." Done" cr [ [THEN] ] ;
171:
172: ' hash-cold INIT8 chained
173:
174: : .words ( -- )
175: base @ >r hex HashTable Hashlen 0
176: DO cr i 2 .r ." : " dup i cells +
177: BEGIN @ dup WHILE
178: dup cell+ @ head>string type space REPEAT drop
179: LOOP drop r> base ! ;
180:
181: \ \ this stuff is for evaluating the hash function
182: \ : square dup * ;
183:
184: \ : countwl ( -- sum sumsq )
185: \ \ gives the number of words in the current wordlist
186: \ \ and the sum of squares for the sublist lengths
187: \ 0 0
188: \ hashtable Hashlen cells bounds DO
189: \ 0 i BEGIN
190: \ @ dup WHILE
191: \ swap 1+ swap
192: \ REPEAT
193: \ drop
194: \ swap over square +
195: \ >r + r>
196: \ 1 cells
197: \ +LOOP ;
198:
199: \ : chisq ( -- n )
200: \ \ n should have about the same size as Hashlen
201: \ countwl Hashlen 2 pick */ swap - ;
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to hash.fs CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [gforth] / gforth