|
380
|
1 /* Implementation of the hash table lisp object type.
|
|
0
|
2 Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995, 1996 Ben Wing.
|
|
223
|
4 Copyright (C) 1997 Free Software Foundation, Inc.
|
|
0
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
380
|
14 ANY WARRANTY; without even the implied warranty of MERCNTABILITY or
|
|
0
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: Not in FSF. */
|
|
|
24
|
|
|
25 #include <config.h>
|
|
|
26 #include "lisp.h"
|
|
380
|
27 #include "bytecode.h"
|
|
0
|
28 #include "elhash.h"
|
|
|
29
|
|
398
|
30 Lisp_Object Qhash_tablep;
|
|
|
31 static Lisp_Object Qhashtable, Qhash_table;
|
|
|
32 static Lisp_Object Qweakness, Qvalue;
|
|
380
|
33 static Lisp_Object Vall_weak_hash_tables;
|
|
|
34 static Lisp_Object Qrehash_size, Qrehash_threshold;
|
|
398
|
35 static Lisp_Object Q_size, Q_test, Q_weakness, Q_rehash_size, Q_rehash_threshold;
|
|
|
36
|
|
|
37 /* obsolete as of 19990901 in xemacs-21.2 */
|
|
|
38 static Lisp_Object Qweak, Qkey_weak, Qvalue_weak, Qnon_weak, Q_type;
|
|
272
|
39
|
|
380
|
40 typedef struct hentry
|
|
|
41 {
|
|
|
42 Lisp_Object key;
|
|
|
43 Lisp_Object value;
|
|
|
44 } hentry;
|
|
0
|
45
|
|
380
|
46 struct Lisp_Hash_Table
|
|
0
|
47 {
|
|
|
48 struct lcrecord_header header;
|
|
380
|
49 size_t size;
|
|
|
50 size_t count;
|
|
|
51 size_t rehash_count;
|
|
|
52 double rehash_size;
|
|
|
53 double rehash_threshold;
|
|
394
|
54 size_t golden_ratio;
|
|
380
|
55 hash_table_hash_function_t hash_function;
|
|
|
56 hash_table_test_function_t test_function;
|
|
|
57 hentry *hentries;
|
|
398
|
58 enum hash_table_weakness weakness;
|
|
380
|
59 Lisp_Object next_weak; /* Used to chain together all of the weak
|
|
|
60 hash tables. Don't mark through this. */
|
|
0
|
61 };
|
|
|
62
|
|
380
|
63 #define HENTRY_CLEAR_P(hentry) ((*(EMACS_UINT*)(&((hentry)->key))) == 0)
|
|
398
|
64 #define CLEAR_HENTRY(hentry) \
|
|
|
65 ((*(EMACS_UINT*)(&((hentry)->key))) = 0, \
|
|
|
66 (*(EMACS_UINT*)(&((hentry)->value))) = 0)
|
|
380
|
67
|
|
|
68 #define HASH_TABLE_DEFAULT_SIZE 16
|
|
|
69 #define HASH_TABLE_DEFAULT_REHASH_SIZE 1.3
|
|
|
70 #define HASH_TABLE_MIN_SIZE 10
|
|
|
71
|
|
398
|
72 #define HASH_CODE(key, ht) \
|
|
|
73 ((((ht)->hash_function ? (ht)->hash_function (key) : LISP_HASH (key)) \
|
|
|
74 * (ht)->golden_ratio) \
|
|
|
75 % (ht)->size)
|
|
380
|
76
|
|
|
77 #define KEYS_EQUAL_P(key1, key2, testfun) \
|
|
398
|
78 (EQ (key1, key2) || ((testfun) && (testfun) (key1, key2)))
|
|
380
|
79
|
|
|
80 #define LINEAR_PROBING_LOOP(probe, entries, size) \
|
|
|
81 for (; \
|
|
|
82 !HENTRY_CLEAR_P (probe) || \
|
|
|
83 (probe == entries + size ? \
|
|
|
84 (probe = entries, !HENTRY_CLEAR_P (probe)) : 0); \
|
|
|
85 probe++)
|
|
|
86
|
|
|
87 #ifndef ERROR_CHECK_HASH_TABLE
|
|
|
88 # ifdef ERROR_CHECK_TYPECHECK
|
|
|
89 # define ERROR_CHECK_HASH_TABLE 1
|
|
|
90 # else
|
|
|
91 # define ERROR_CHECK_HASH_TABLE 0
|
|
|
92 # endif
|
|
|
93 #endif
|
|
0
|
94
|
|
380
|
95 #if ERROR_CHECK_HASH_TABLE
|
|
|
96 static void
|
|
|
97 check_hash_table_invariants (Lisp_Hash_Table *ht)
|
|
0
|
98 {
|
|
380
|
99 assert (ht->count < ht->size);
|
|
|
100 assert (ht->count <= ht->rehash_count);
|
|
|
101 assert (ht->rehash_count < ht->size);
|
|
|
102 assert ((double) ht->count * ht->rehash_threshold - 1 <= (double) ht->rehash_count);
|
|
|
103 assert (HENTRY_CLEAR_P (ht->hentries + ht->size));
|
|
|
104 }
|
|
|
105 #else
|
|
|
106 #define check_hash_table_invariants(ht)
|
|
|
107 #endif
|
|
|
108
|
|
|
109 /* We use linear probing instead of double hashing, despite its lack
|
|
|
110 of blessing by Knuth and company, because, as a result of the
|
|
|
111 increasing discrepancy between CPU speeds and memory speeds, cache
|
|
|
112 behavior is becoming increasingly important, e.g:
|
|
|
113
|
|
|
114 For a trivial loop, the penalty for non-sequential access of an array is:
|
|
|
115 - a factor of 3-4 on Pentium Pro 200 Mhz
|
|
|
116 - a factor of 10 on Ultrasparc 300 Mhz */
|
|
0
|
117
|
|
380
|
118 /* Return a suitable size for a hash table, with at least SIZE slots. */
|
|
|
119 static size_t
|
|
|
120 hash_table_size (size_t requested_size)
|
|
|
121 {
|
|
|
122 /* Return some prime near, but greater than or equal to, SIZE.
|
|
|
123 Decades from the time of writing, someone will have a system large
|
|
|
124 enough that the list below will be too short... */
|
|
398
|
125 static const size_t primes [] =
|
|
380
|
126 {
|
|
|
127 19, 29, 41, 59, 79, 107, 149, 197, 263, 347, 457, 599, 787, 1031,
|
|
|
128 1361, 1777, 2333, 3037, 3967, 5167, 6719, 8737, 11369, 14783,
|
|
|
129 19219, 24989, 32491, 42257, 54941, 71429, 92861, 120721, 156941,
|
|
|
130 204047, 265271, 344857, 448321, 582821, 757693, 985003, 1280519,
|
|
|
131 1664681, 2164111, 2813353, 3657361, 4754591, 6180989, 8035301,
|
|
|
132 10445899, 13579681, 17653589, 22949669, 29834603, 38784989,
|
|
|
133 50420551, 65546729, 85210757, 110774011, 144006217, 187208107,
|
|
|
134 243370577, 316381771, 411296309, 534685237, 695090819, 903618083,
|
|
|
135 1174703521, 1527114613, 1985248999, 2580823717UL, 3355070839UL
|
|
|
136 };
|
|
|
137 /* We've heard of binary search. */
|
|
|
138 int low, high;
|
|
|
139 for (low = 0, high = countof (primes) - 1; high - low > 1;)
|
|
0
|
140 {
|
|
380
|
141 /* Loop Invariant: size < primes [high] */
|
|
|
142 int mid = (low + high) / 2;
|
|
|
143 if (primes [mid] < requested_size)
|
|
|
144 low = mid;
|
|
|
145 else
|
|
|
146 high = mid;
|
|
0
|
147 }
|
|
380
|
148 return primes [high];
|
|
0
|
149 }
|
|
380
|
150
|
|
223
|
151
|
|
380
|
152 #if 0 /* I don't think these are needed any more.
|
|
|
153 If using the general lisp_object_equal_*() functions
|
|
|
154 causes efficiency problems, these can be resurrected. --ben */
|
|
|
155 /* equality and hash functions for Lisp strings */
|
|
|
156 int
|
|
|
157 lisp_string_equal (Lisp_Object str1, Lisp_Object str2)
|
|
|
158 {
|
|
|
159 /* This is wrong anyway. You can't use strcmp() on Lisp strings,
|
|
|
160 because they can contain zero characters. */
|
|
|
161 return !strcmp ((char *) XSTRING_DATA (str1), (char *) XSTRING_DATA (str2));
|
|
|
162 }
|
|
231
|
163
|
|
380
|
164 static hashcode_t
|
|
|
165 lisp_string_hash (Lisp_Object obj)
|
|
231
|
166 {
|
|
380
|
167 return hash_string (XSTRING_DATA (str), XSTRING_LENGTH (str));
|
|
|
168 }
|
|
|
169
|
|
|
170 #endif /* 0 */
|
|
231
|
171
|
|
241
|
172 static int
|
|
380
|
173 lisp_object_eql_equal (Lisp_Object obj1, Lisp_Object obj2)
|
|
231
|
174 {
|
|
380
|
175 return EQ (obj1, obj2) || (FLOATP (obj1) && internal_equal (obj1, obj2, 0));
|
|
|
176 }
|
|
231
|
177
|
|
380
|
178 static hashcode_t
|
|
|
179 lisp_object_eql_hash (Lisp_Object obj)
|
|
|
180 {
|
|
|
181 return FLOATP (obj) ? internal_hash (obj, 0) : LISP_HASH (obj);
|
|
231
|
182 }
|
|
|
183
|
|
|
184 static int
|
|
380
|
185 lisp_object_equal_equal (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
186 {
|
|
|
187 return internal_equal (obj1, obj2, 0);
|
|
|
188 }
|
|
|
189
|
|
|
190 static hashcode_t
|
|
|
191 lisp_object_equal_hash (Lisp_Object obj)
|
|
231
|
192 {
|
|
380
|
193 return internal_hash (obj, 0);
|
|
|
194 }
|
|
|
195
|
|
|
196
|
|
|
197 static Lisp_Object
|
|
398
|
198 mark_hash_table (Lisp_Object obj)
|
|
380
|
199 {
|
|
|
200 Lisp_Hash_Table *ht = XHASH_TABLE (obj);
|
|
|
201
|
|
|
202 /* If the hash table is weak, we don't want to mark the keys and
|
|
|
203 values (we scan over them after everything else has been marked,
|
|
|
204 and mark or remove them as necessary). */
|
|
398
|
205 if (ht->weakness == HASH_TABLE_NON_WEAK)
|
|
380
|
206 {
|
|
|
207 hentry *e, *sentinel;
|
|
231
|
208
|
|
380
|
209 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
210 if (!HENTRY_CLEAR_P (e))
|
|
|
211 {
|
|
398
|
212 mark_object (e->key);
|
|
|
213 mark_object (e->value);
|
|
380
|
214 }
|
|
|
215 }
|
|
|
216 return Qnil;
|
|
|
217 }
|
|
|
218
|
|
|
219 /* Equality of hash tables. Two hash tables are equal when they are of
|
|
398
|
220 the same weakness and test function, they have the same number of
|
|
380
|
221 elements, and for each key in the hash table, the values are `equal'.
|
|
|
222
|
|
|
223 This is similar to Common Lisp `equalp' of hash tables, with the
|
|
|
224 difference that CL requires the keys to be compared with the test
|
|
|
225 function, which we don't do. Doing that would require consing, and
|
|
|
226 consing is a bad idea in `equal'. Anyway, our method should provide
|
|
|
227 the same result -- if the keys are not equal according to the test
|
|
|
228 function, then Fgethash() in hash_table_equal_mapper() will fail. */
|
|
|
229 static int
|
|
|
230 hash_table_equal (Lisp_Object hash_table1, Lisp_Object hash_table2, int depth)
|
|
|
231 {
|
|
|
232 Lisp_Hash_Table *ht1 = XHASH_TABLE (hash_table1);
|
|
|
233 Lisp_Hash_Table *ht2 = XHASH_TABLE (hash_table2);
|
|
|
234 hentry *e, *sentinel;
|
|
|
235
|
|
|
236 if ((ht1->test_function != ht2->test_function) ||
|
|
398
|
237 (ht1->weakness != ht2->weakness) ||
|
|
380
|
238 (ht1->count != ht2->count))
|
|
231
|
239 return 0;
|
|
|
240
|
|
380
|
241 depth++;
|
|
|
242
|
|
|
243 for (e = ht1->hentries, sentinel = e + ht1->size; e < sentinel; e++)
|
|
|
244 if (!HENTRY_CLEAR_P (e))
|
|
|
245 /* Look up the key in the other hash table, and compare the values. */
|
|
|
246 {
|
|
|
247 Lisp_Object value_in_other = Fgethash (e->key, hash_table2, Qunbound);
|
|
|
248 if (UNBOUNDP (value_in_other) ||
|
|
|
249 !internal_equal (e->value, value_in_other, depth))
|
|
|
250 return 0; /* Give up */
|
|
|
251 }
|
|
|
252
|
|
|
253 return 1;
|
|
241
|
254 }
|
|
398
|
255
|
|
|
256 /* This is not a great hash function, but it _is_ correct and fast.
|
|
|
257 Examining all entries is too expensive, and examining a random
|
|
|
258 subset does not yield a correct hash function. */
|
|
|
259 static hashcode_t
|
|
|
260 hash_table_hash (Lisp_Object hash_table, int depth)
|
|
|
261 {
|
|
|
262 return XHASH_TABLE (hash_table)->count;
|
|
|
263 }
|
|
|
264
|
|
241
|
265
|
|
380
|
266 /* Printing hash tables.
|
|
223
|
267
|
|
|
268 This is non-trivial, because we use a readable structure-style
|
|
380
|
269 syntax for hash tables. This means that a typical hash table will be
|
|
223
|
270 readably printed in the form of:
|
|
|
271
|
|
380
|
272 #s(hash-table size 2 data (key1 value1 key2 value2))
|
|
223
|
273
|
|
398
|
274 The supported hash table structure keywords and their values are:
|
|
|
275 `test' (eql (or nil), eq or equal)
|
|
|
276 `size' (a natnum or nil)
|
|
|
277 `rehash-size' (a float)
|
|
|
278 `rehash-threshold' (a float)
|
|
|
279 `weakness' (nil, t, key or value)
|
|
|
280 `data' (a list)
|
|
223
|
281
|
|
398
|
282 If `print-readably' is nil, then a simpler syntax is used, for example
|
|
223
|
283
|
|
380
|
284 #<hash-table size 2/13 data (key1 value1 key2 value2) 0x874d>
|
|
223
|
285
|
|
|
286 The data is truncated to four pairs, and the rest is shown with
|
|
241
|
287 `...'. This printer does not cons. */
|
|
223
|
288
|
|
|
289
|
|
380
|
290 /* Print the data of the hash table. This maps through a Lisp
|
|
|
291 hash table and prints key/value pairs using PRINTCHARFUN. */
|
|
|
292 static void
|
|
|
293 print_hash_table_data (Lisp_Hash_Table *ht, Lisp_Object printcharfun)
|
|
223
|
294 {
|
|
380
|
295 int count = 0;
|
|
|
296 hentry *e, *sentinel;
|
|
223
|
297
|
|
380
|
298 write_c_string (" data (", printcharfun);
|
|
223
|
299
|
|
380
|
300 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
301 if (!HENTRY_CLEAR_P (e))
|
|
|
302 {
|
|
|
303 if (count > 0)
|
|
|
304 write_c_string (" ", printcharfun);
|
|
|
305 if (!print_readably && count > 3)
|
|
|
306 {
|
|
|
307 write_c_string ("...", printcharfun);
|
|
|
308 break;
|
|
|
309 }
|
|
|
310 print_internal (e->key, printcharfun, 1);
|
|
|
311 write_c_string (" ", printcharfun);
|
|
|
312 print_internal (e->value, printcharfun, 1);
|
|
|
313 count++;
|
|
|
314 }
|
|
223
|
315
|
|
380
|
316 write_c_string (")", printcharfun);
|
|
223
|
317 }
|
|
|
318
|
|
|
319 static void
|
|
380
|
320 print_hash_table (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
223
|
321 {
|
|
380
|
322 Lisp_Hash_Table *ht = XHASH_TABLE (obj);
|
|
223
|
323 char buf[128];
|
|
|
324
|
|
380
|
325 write_c_string (print_readably ? "#s(hash-table" : "#<hash-table",
|
|
223
|
326 printcharfun);
|
|
380
|
327
|
|
|
328 /* These checks have a kludgy look to them, but they are safe.
|
|
|
329 Due to nature of hashing, you cannot use arbitrary
|
|
|
330 test functions anyway. */
|
|
|
331 if (!ht->test_function)
|
|
223
|
332 write_c_string (" test eq", printcharfun);
|
|
380
|
333 else if (ht->test_function == lisp_object_equal_equal)
|
|
223
|
334 write_c_string (" test equal", printcharfun);
|
|
380
|
335 else if (ht->test_function == lisp_object_eql_equal)
|
|
231
|
336 DO_NOTHING;
|
|
223
|
337 else
|
|
|
338 abort ();
|
|
380
|
339
|
|
|
340 if (ht->count || !print_readably)
|
|
223
|
341 {
|
|
|
342 if (print_readably)
|
|
380
|
343 sprintf (buf, " size %lu", (unsigned long) ht->count);
|
|
223
|
344 else
|
|
380
|
345 sprintf (buf, " size %lu/%lu",
|
|
|
346 (unsigned long) ht->count,
|
|
|
347 (unsigned long) ht->size);
|
|
223
|
348 write_c_string (buf, printcharfun);
|
|
|
349 }
|
|
380
|
350
|
|
398
|
351 if (ht->weakness != HASH_TABLE_NON_WEAK)
|
|
|
352 {
|
|
|
353 sprintf (buf, " weakness %s",
|
|
|
354 (ht->weakness == HASH_TABLE_WEAK ? "t" :
|
|
|
355 ht->weakness == HASH_TABLE_KEY_WEAK ? "key" :
|
|
|
356 ht->weakness == HASH_TABLE_VALUE_WEAK ? "value" :
|
|
|
357 "you-d-better-not-see-this"));
|
|
|
358 write_c_string (buf, printcharfun);
|
|
|
359 }
|
|
|
360
|
|
380
|
361 if (ht->count)
|
|
|
362 print_hash_table_data (ht, printcharfun);
|
|
|
363
|
|
0
|
364 if (print_readably)
|
|
223
|
365 write_c_string (")", printcharfun);
|
|
|
366 else
|
|
|
367 {
|
|
380
|
368 sprintf (buf, " 0x%x>", ht->header.uid);
|
|
223
|
369 write_c_string (buf, printcharfun);
|
|
|
370 }
|
|
|
371 }
|
|
|
372
|
|
380
|
373 static void
|
|
|
374 finalize_hash_table (void *header, int for_disksave)
|
|
|
375 {
|
|
|
376 if (!for_disksave)
|
|
|
377 {
|
|
|
378 Lisp_Hash_Table *ht = (Lisp_Hash_Table *) header;
|
|
|
379
|
|
|
380 xfree (ht->hentries);
|
|
|
381 ht->hentries = 0;
|
|
|
382 }
|
|
|
383 }
|
|
|
384
|
|
398
|
385 static const struct lrecord_description hentry_description_1[] = {
|
|
|
386 { XD_LISP_OBJECT, offsetof (hentry, key) },
|
|
|
387 { XD_LISP_OBJECT, offsetof (hentry, value) },
|
|
|
388 { XD_END }
|
|
|
389 };
|
|
|
390
|
|
|
391 static const struct struct_description hentry_description = {
|
|
|
392 sizeof (hentry),
|
|
|
393 hentry_description_1
|
|
|
394 };
|
|
|
395
|
|
|
396 const struct lrecord_description hash_table_description[] = {
|
|
|
397 { XD_SIZE_T, offsetof (Lisp_Hash_Table, size) },
|
|
|
398 { XD_STRUCT_PTR, offsetof (Lisp_Hash_Table, hentries), XD_INDIRECT(0, 1), &hentry_description },
|
|
|
399 { XD_LO_LINK, offsetof (Lisp_Hash_Table, next_weak) },
|
|
|
400 { XD_END }
|
|
|
401 };
|
|
|
402
|
|
380
|
403 DEFINE_LRECORD_IMPLEMENTATION ("hash-table", hash_table,
|
|
|
404 mark_hash_table, print_hash_table,
|
|
|
405 finalize_hash_table,
|
|
398
|
406 hash_table_equal, hash_table_hash,
|
|
|
407 hash_table_description,
|
|
380
|
408 Lisp_Hash_Table);
|
|
|
409
|
|
|
410 static Lisp_Hash_Table *
|
|
|
411 xhash_table (Lisp_Object hash_table)
|
|
|
412 {
|
|
|
413 if (!gc_in_progress)
|
|
|
414 CHECK_HASH_TABLE (hash_table);
|
|
|
415 check_hash_table_invariants (XHASH_TABLE (hash_table));
|
|
|
416 return XHASH_TABLE (hash_table);
|
|
|
417 }
|
|
|
418
|
|
223
|
419
|
|
380
|
420 /************************************************************************/
|
|
|
421 /* Creation of Hash Tables */
|
|
|
422 /************************************************************************/
|
|
|
423
|
|
|
424 /* Creation of hash tables, without error-checking. */
|
|
|
425 static void
|
|
|
426 compute_hash_table_derived_values (Lisp_Hash_Table *ht)
|
|
|
427 {
|
|
|
428 ht->rehash_count = (size_t)
|
|
398
|
429 ((double) ht->size * ht->rehash_threshold);
|
|
394
|
430 ht->golden_ratio = (size_t)
|
|
380
|
431 ((double) ht->size * (.6180339887 / (double) sizeof (Lisp_Object)));
|
|
|
432 }
|
|
|
433
|
|
|
434 Lisp_Object
|
|
398
|
435 make_general_lisp_hash_table (enum hash_table_test test,
|
|
|
436 size_t size,
|
|
|
437 double rehash_size,
|
|
|
438 double rehash_threshold,
|
|
|
439 enum hash_table_weakness weakness)
|
|
380
|
440 {
|
|
|
441 Lisp_Object hash_table;
|
|
398
|
442 Lisp_Hash_Table *ht = alloc_lcrecord_type (Lisp_Hash_Table, &lrecord_hash_table);
|
|
380
|
443
|
|
|
444 switch (test)
|
|
|
445 {
|
|
|
446 case HASH_TABLE_EQ:
|
|
|
447 ht->test_function = 0;
|
|
|
448 ht->hash_function = 0;
|
|
|
449 break;
|
|
|
450
|
|
|
451 case HASH_TABLE_EQL:
|
|
|
452 ht->test_function = lisp_object_eql_equal;
|
|
|
453 ht->hash_function = lisp_object_eql_hash;
|
|
|
454 break;
|
|
|
455
|
|
|
456 case HASH_TABLE_EQUAL:
|
|
|
457 ht->test_function = lisp_object_equal_equal;
|
|
|
458 ht->hash_function = lisp_object_equal_hash;
|
|
|
459 break;
|
|
|
460
|
|
|
461 default:
|
|
|
462 abort ();
|
|
|
463 }
|
|
|
464
|
|
398
|
465 ht->weakness = weakness;
|
|
|
466
|
|
|
467 ht->rehash_size =
|
|
|
468 rehash_size > 1.0 ? rehash_size : HASH_TABLE_DEFAULT_REHASH_SIZE;
|
|
|
469
|
|
|
470 ht->rehash_threshold =
|
|
|
471 rehash_threshold > 0.0 ? rehash_threshold :
|
|
|
472 size > 4096 && !ht->test_function ? 0.7 : 0.6;
|
|
|
473
|
|
380
|
474 if (size < HASH_TABLE_MIN_SIZE)
|
|
|
475 size = HASH_TABLE_MIN_SIZE;
|
|
398
|
476 ht->size = hash_table_size ((size_t) (((double) size / ht->rehash_threshold)
|
|
|
477 + 1.0));
|
|
380
|
478 ht->count = 0;
|
|
398
|
479
|
|
380
|
480 compute_hash_table_derived_values (ht);
|
|
|
481
|
|
|
482 /* We leave room for one never-occupied sentinel hentry at the end. */
|
|
|
483 ht->hentries = xnew_array (hentry, ht->size + 1);
|
|
|
484
|
|
|
485 {
|
|
|
486 hentry *e, *sentinel;
|
|
|
487 for (e = ht->hentries, sentinel = e + ht->size; e <= sentinel; e++)
|
|
|
488 CLEAR_HENTRY (e);
|
|
|
489 }
|
|
|
490
|
|
|
491 XSETHASH_TABLE (hash_table, ht);
|
|
|
492
|
|
398
|
493 if (weakness == HASH_TABLE_NON_WEAK)
|
|
380
|
494 ht->next_weak = Qunbound;
|
|
|
495 else
|
|
|
496 ht->next_weak = Vall_weak_hash_tables, Vall_weak_hash_tables = hash_table;
|
|
|
497
|
|
|
498 return hash_table;
|
|
|
499 }
|
|
|
500
|
|
|
501 Lisp_Object
|
|
|
502 make_lisp_hash_table (size_t size,
|
|
398
|
503 enum hash_table_weakness weakness,
|
|
380
|
504 enum hash_table_test test)
|
|
|
505 {
|
|
398
|
506 return make_general_lisp_hash_table (test, size, -1.0, -1.0, weakness);
|
|
380
|
507 }
|
|
|
508
|
|
|
509 /* Pretty reading of hash tables.
|
|
223
|
510
|
|
|
511 Here we use the existing structures mechanism (which is,
|
|
|
512 unfortunately, pretty cumbersome) for validating and instantiating
|
|
380
|
513 the hash tables. The idea is that the side-effect of reading a
|
|
|
514 #s(hash-table PLIST) object is creation of a hash table with desired
|
|
|
515 properties, and that the hash table is returned. */
|
|
223
|
516
|
|
|
517 /* Validation functions: each keyword provides its own validation
|
|
|
518 function. The errors should maybe be continuable, but it is
|
|
|
519 unclear how this would cope with ERRB. */
|
|
|
520 static int
|
|
380
|
521 hash_table_size_validate (Lisp_Object keyword, Lisp_Object value,
|
|
|
522 Error_behavior errb)
|
|
|
523 {
|
|
|
524 if (NATNUMP (value))
|
|
|
525 return 1;
|
|
|
526
|
|
|
527 maybe_signal_error (Qwrong_type_argument, list2 (Qnatnump, value),
|
|
|
528 Qhash_table, errb);
|
|
|
529 return 0;
|
|
|
530 }
|
|
|
531
|
|
|
532 static size_t
|
|
|
533 decode_hash_table_size (Lisp_Object obj)
|
|
|
534 {
|
|
|
535 return NILP (obj) ? HASH_TABLE_DEFAULT_SIZE : XINT (obj);
|
|
|
536 }
|
|
|
537
|
|
|
538 static int
|
|
398
|
539 hash_table_weakness_validate (Lisp_Object keyword, Lisp_Object value,
|
|
|
540 Error_behavior errb)
|
|
223
|
541 {
|
|
380
|
542 if (EQ (value, Qnil)) return 1;
|
|
398
|
543 if (EQ (value, Qt)) return 1;
|
|
|
544 if (EQ (value, Qkey)) return 1;
|
|
|
545 if (EQ (value, Qvalue)) return 1;
|
|
|
546
|
|
|
547 /* Following values are obsolete as of 19990901 in xemacs-21.2 */
|
|
380
|
548 if (EQ (value, Qnon_weak)) return 1;
|
|
|
549 if (EQ (value, Qweak)) return 1;
|
|
|
550 if (EQ (value, Qkey_weak)) return 1;
|
|
|
551 if (EQ (value, Qvalue_weak)) return 1;
|
|
|
552
|
|
398
|
553 maybe_signal_simple_error ("Invalid hash table weakness",
|
|
380
|
554 value, Qhash_table, errb);
|
|
|
555 return 0;
|
|
|
556 }
|
|
|
557
|
|
398
|
558 static enum hash_table_weakness
|
|
|
559 decode_hash_table_weakness (Lisp_Object obj)
|
|
380
|
560 {
|
|
|
561 if (EQ (obj, Qnil)) return HASH_TABLE_NON_WEAK;
|
|
398
|
562 if (EQ (obj, Qt)) return HASH_TABLE_WEAK;
|
|
|
563 if (EQ (obj, Qkey)) return HASH_TABLE_KEY_WEAK;
|
|
|
564 if (EQ (obj, Qvalue)) return HASH_TABLE_VALUE_WEAK;
|
|
|
565
|
|
|
566 /* Following values are obsolete as of 19990901 in xemacs-21.2 */
|
|
380
|
567 if (EQ (obj, Qnon_weak)) return HASH_TABLE_NON_WEAK;
|
|
|
568 if (EQ (obj, Qweak)) return HASH_TABLE_WEAK;
|
|
|
569 if (EQ (obj, Qkey_weak)) return HASH_TABLE_KEY_WEAK;
|
|
|
570 if (EQ (obj, Qvalue_weak)) return HASH_TABLE_VALUE_WEAK;
|
|
|
571
|
|
398
|
572 signal_simple_error ("Invalid hash table weakness", obj);
|
|
380
|
573 return HASH_TABLE_NON_WEAK; /* not reached */
|
|
|
574 }
|
|
|
575
|
|
|
576 static int
|
|
|
577 hash_table_test_validate (Lisp_Object keyword, Lisp_Object value,
|
|
|
578 Error_behavior errb)
|
|
|
579 {
|
|
|
580 if (EQ (value, Qnil)) return 1;
|
|
|
581 if (EQ (value, Qeq)) return 1;
|
|
|
582 if (EQ (value, Qequal)) return 1;
|
|
|
583 if (EQ (value, Qeql)) return 1;
|
|
|
584
|
|
|
585 maybe_signal_simple_error ("Invalid hash table test",
|
|
|
586 value, Qhash_table, errb);
|
|
|
587 return 0;
|
|
|
588 }
|
|
|
589
|
|
|
590 static enum hash_table_test
|
|
|
591 decode_hash_table_test (Lisp_Object obj)
|
|
|
592 {
|
|
|
593 if (EQ (obj, Qnil)) return HASH_TABLE_EQL;
|
|
|
594 if (EQ (obj, Qeq)) return HASH_TABLE_EQ;
|
|
|
595 if (EQ (obj, Qequal)) return HASH_TABLE_EQUAL;
|
|
|
596 if (EQ (obj, Qeql)) return HASH_TABLE_EQL;
|
|
|
597
|
|
|
598 signal_simple_error ("Invalid hash table test", obj);
|
|
|
599 return HASH_TABLE_EQ; /* not reached */
|
|
|
600 }
|
|
|
601
|
|
|
602 static int
|
|
|
603 hash_table_rehash_size_validate (Lisp_Object keyword, Lisp_Object value,
|
|
398
|
604 Error_behavior errb)
|
|
380
|
605 {
|
|
|
606 if (!FLOATP (value))
|
|
223
|
607 {
|
|
380
|
608 maybe_signal_error (Qwrong_type_argument, list2 (Qfloatp, value),
|
|
|
609 Qhash_table, errb);
|
|
223
|
610 return 0;
|
|
|
611 }
|
|
380
|
612
|
|
|
613 {
|
|
|
614 double rehash_size = XFLOAT_DATA (value);
|
|
|
615 if (rehash_size <= 1.0)
|
|
|
616 {
|
|
|
617 maybe_signal_simple_error
|
|
|
618 ("Hash table rehash size must be greater than 1.0",
|
|
|
619 value, Qhash_table, errb);
|
|
|
620 return 0;
|
|
|
621 }
|
|
|
622 }
|
|
|
623
|
|
223
|
624 return 1;
|
|
|
625 }
|
|
|
626
|
|
380
|
627 static double
|
|
|
628 decode_hash_table_rehash_size (Lisp_Object rehash_size)
|
|
|
629 {
|
|
|
630 return NILP (rehash_size) ? -1.0 : XFLOAT_DATA (rehash_size);
|
|
|
631 }
|
|
|
632
|
|
223
|
633 static int
|
|
380
|
634 hash_table_rehash_threshold_validate (Lisp_Object keyword, Lisp_Object value,
|
|
|
635 Error_behavior errb)
|
|
|
636 {
|
|
|
637 if (!FLOATP (value))
|
|
|
638 {
|
|
|
639 maybe_signal_error (Qwrong_type_argument, list2 (Qfloatp, value),
|
|
|
640 Qhash_table, errb);
|
|
|
641 return 0;
|
|
|
642 }
|
|
|
643
|
|
|
644 {
|
|
|
645 double rehash_threshold = XFLOAT_DATA (value);
|
|
|
646 if (rehash_threshold <= 0.0 || rehash_threshold >= 1.0)
|
|
|
647 {
|
|
|
648 maybe_signal_simple_error
|
|
|
649 ("Hash table rehash threshold must be between 0.0 and 1.0",
|
|
|
650 value, Qhash_table, errb);
|
|
|
651 return 0;
|
|
|
652 }
|
|
|
653 }
|
|
|
654
|
|
|
655 return 1;
|
|
|
656 }
|
|
|
657
|
|
|
658 static double
|
|
|
659 decode_hash_table_rehash_threshold (Lisp_Object rehash_threshold)
|
|
|
660 {
|
|
|
661 return NILP (rehash_threshold) ? -1.0 : XFLOAT_DATA (rehash_threshold);
|
|
|
662 }
|
|
|
663
|
|
|
664 static int
|
|
|
665 hash_table_data_validate (Lisp_Object keyword, Lisp_Object value,
|
|
223
|
666 Error_behavior errb)
|
|
|
667 {
|
|
380
|
668 int len;
|
|
|
669
|
|
|
670 GET_EXTERNAL_LIST_LENGTH (value, len);
|
|
|
671
|
|
|
672 if (len & 1)
|
|
223
|
673 {
|
|
380
|
674 maybe_signal_simple_error
|
|
|
675 ("Hash table data must have alternating key/value pairs",
|
|
|
676 value, Qhash_table, errb);
|
|
223
|
677 return 0;
|
|
|
678 }
|
|
|
679 return 1;
|
|
|
680 }
|
|
|
681
|
|
380
|
682 /* The actual instantiation of a hash table. This does practically no
|
|
223
|
683 error checking, because it relies on the fact that the paranoid
|
|
|
684 functions above have error-checked everything to the last details.
|
|
|
685 If this assumption is wrong, we will get a crash immediately (with
|
|
|
686 error-checking compiled in), and we'll know if there is a bug in
|
|
|
687 the structure mechanism. So there. */
|
|
|
688 static Lisp_Object
|
|
380
|
689 hash_table_instantiate (Lisp_Object plist)
|
|
223
|
690 {
|
|
380
|
691 Lisp_Object hash_table;
|
|
|
692 Lisp_Object test = Qnil;
|
|
|
693 Lisp_Object size = Qnil;
|
|
|
694 Lisp_Object rehash_size = Qnil;
|
|
|
695 Lisp_Object rehash_threshold = Qnil;
|
|
398
|
696 Lisp_Object weakness = Qnil;
|
|
|
697 Lisp_Object data = Qnil;
|
|
223
|
698
|
|
|
699 while (!NILP (plist))
|
|
|
700 {
|
|
272
|
701 Lisp_Object key, value;
|
|
|
702 key = XCAR (plist); plist = XCDR (plist);
|
|
|
703 value = XCAR (plist); plist = XCDR (plist);
|
|
|
704
|
|
380
|
705 if (EQ (key, Qtest)) test = value;
|
|
|
706 else if (EQ (key, Qsize)) size = value;
|
|
|
707 else if (EQ (key, Qrehash_size)) rehash_size = value;
|
|
|
708 else if (EQ (key, Qrehash_threshold)) rehash_threshold = value;
|
|
398
|
709 else if (EQ (key, Qweakness)) weakness = value;
|
|
|
710 else if (EQ (key, Qdata)) data = value;
|
|
|
711 else if (EQ (key, Qtype))/*obsolete*/ weakness = value;
|
|
223
|
712 else
|
|
|
713 abort ();
|
|
|
714 }
|
|
272
|
715
|
|
380
|
716 /* Create the hash table. */
|
|
|
717 hash_table = make_general_lisp_hash_table
|
|
398
|
718 (decode_hash_table_test (test),
|
|
|
719 decode_hash_table_size (size),
|
|
380
|
720 decode_hash_table_rehash_size (rehash_size),
|
|
398
|
721 decode_hash_table_rehash_threshold (rehash_threshold),
|
|
|
722 decode_hash_table_weakness (weakness));
|
|
223
|
723
|
|
380
|
724 /* I'm not sure whether this can GC, but better safe than sorry. */
|
|
|
725 {
|
|
|
726 struct gcpro gcpro1;
|
|
|
727 GCPRO1 (hash_table);
|
|
223
|
728
|
|
380
|
729 /* And fill it with data. */
|
|
|
730 while (!NILP (data))
|
|
|
731 {
|
|
|
732 Lisp_Object key, value;
|
|
|
733 key = XCAR (data); data = XCDR (data);
|
|
|
734 value = XCAR (data); data = XCDR (data);
|
|
|
735 Fputhash (key, value, hash_table);
|
|
|
736 }
|
|
|
737 UNGCPRO;
|
|
|
738 }
|
|
223
|
739
|
|
380
|
740 return hash_table;
|
|
0
|
741 }
|
|
|
742
|
|
|
743 static void
|
|
380
|
744 structure_type_create_hash_table_structure_name (Lisp_Object structure_name)
|
|
0
|
745 {
|
|
380
|
746 struct structure_type *st;
|
|
0
|
747
|
|
380
|
748 st = define_structure_type (structure_name, 0, hash_table_instantiate);
|
|
398
|
749 define_structure_type_keyword (st, Qtest, hash_table_test_validate);
|
|
380
|
750 define_structure_type_keyword (st, Qsize, hash_table_size_validate);
|
|
|
751 define_structure_type_keyword (st, Qrehash_size, hash_table_rehash_size_validate);
|
|
|
752 define_structure_type_keyword (st, Qrehash_threshold, hash_table_rehash_threshold_validate);
|
|
398
|
753 define_structure_type_keyword (st, Qweakness, hash_table_weakness_validate);
|
|
|
754 define_structure_type_keyword (st, Qdata, hash_table_data_validate);
|
|
|
755
|
|
|
756 /* obsolete as of 19990901 in xemacs-21.2 */
|
|
|
757 define_structure_type_keyword (st, Qtype, hash_table_weakness_validate);
|
|
0
|
758 }
|
|
|
759
|
|
380
|
760 /* Create a built-in Lisp structure type named `hash-table'.
|
|
|
761 We make #s(hashtable ...) equivalent to #s(hash-table ...),
|
|
398
|
762 for backward compatibility.
|
|
380
|
763 This is called from emacs.c. */
|
|
0
|
764 void
|
|
380
|
765 structure_type_create_hash_table (void)
|
|
0
|
766 {
|
|
380
|
767 structure_type_create_hash_table_structure_name (Qhash_table);
|
|
|
768 structure_type_create_hash_table_structure_name (Qhashtable); /* compat */
|
|
0
|
769 }
|
|
|
770
|
|
|
771
|
|
380
|
772 /************************************************************************/
|
|
|
773 /* Definition of Lisp-visible methods */
|
|
|
774 /************************************************************************/
|
|
0
|
775
|
|
380
|
776 DEFUN ("hash-table-p", Fhash_table_p, 1, 1, 0, /*
|
|
|
777 Return t if OBJECT is a hash table, else nil.
|
|
|
778 */
|
|
|
779 (object))
|
|
0
|
780 {
|
|
380
|
781 return HASH_TABLEP (object) ? Qt : Qnil;
|
|
0
|
782 }
|
|
|
783
|
|
380
|
784 DEFUN ("make-hash-table", Fmake_hash_table, 0, MANY, 0, /*
|
|
|
785 Return a new empty hash table object.
|
|
|
786 Use Common Lisp style keywords to specify hash table properties.
|
|
398
|
787 (make-hash-table &key test size rehash-size rehash-threshold weakness)
|
|
380
|
788
|
|
|
789 Keyword :test can be `eq', `eql' (default) or `equal'.
|
|
|
790 Comparison between keys is done using this function.
|
|
|
791 If speed is important, consider using `eq'.
|
|
|
792 When storing strings in the hash table, you will likely need to use `equal'.
|
|
|
793
|
|
398
|
794 Keyword :size specifies the number of keys likely to be inserted.
|
|
|
795 This number of entries can be inserted without enlarging the hash table.
|
|
|
796
|
|
|
797 Keyword :rehash-size must be a float greater than 1.0, and specifies
|
|
|
798 the factor by which to increase the size of the hash table when enlarging.
|
|
|
799
|
|
|
800 Keyword :rehash-threshold must be a float between 0.0 and 1.0,
|
|
|
801 and specifies the load factor of the hash table which triggers enlarging.
|
|
|
802
|
|
|
803 Non-standard keyword :weakness can be `nil' (default), `t', `key' or `value'.
|
|
380
|
804
|
|
|
805 A weak hash table is one whose pointers do not count as GC referents:
|
|
|
806 for any key-value pair in the hash table, if the only remaining pointer
|
|
|
807 to either the key or the value is in a weak hash table, then the pair
|
|
|
808 will be removed from the hash table, and the key and value collected.
|
|
|
809 A non-weak hash table (or any other pointer) would prevent the object
|
|
|
810 from being collected.
|
|
|
811
|
|
|
812 A key-weak hash table is similar to a fully-weak hash table except that
|
|
|
813 a key-value pair will be removed only if the key remains unmarked
|
|
|
814 outside of weak hash tables. The pair will remain in the hash table if
|
|
|
815 the key is pointed to by something other than a weak hash table, even
|
|
|
816 if the value is not.
|
|
|
817
|
|
|
818 A value-weak hash table is similar to a fully-weak hash table except
|
|
|
819 that a key-value pair will be removed only if the value remains
|
|
|
820 unmarked outside of weak hash tables. The pair will remain in the
|
|
|
821 hash table if the value is pointed to by something other than a weak
|
|
|
822 hash table, even if the key is not.
|
|
|
823 */
|
|
|
824 (int nargs, Lisp_Object *args))
|
|
0
|
825 {
|
|
398
|
826 int i = 0;
|
|
|
827 Lisp_Object test = Qnil;
|
|
380
|
828 Lisp_Object size = Qnil;
|
|
|
829 Lisp_Object rehash_size = Qnil;
|
|
|
830 Lisp_Object rehash_threshold = Qnil;
|
|
398
|
831 Lisp_Object weakness = Qnil;
|
|
380
|
832
|
|
398
|
833 while (i + 1 < nargs)
|
|
|
834 {
|
|
|
835 Lisp_Object keyword = args[i++];
|
|
|
836 Lisp_Object value = args[i++];
|
|
380
|
837
|
|
398
|
838 if (EQ (keyword, Q_test)) test = value;
|
|
|
839 else if (EQ (keyword, Q_size)) size = value;
|
|
380
|
840 else if (EQ (keyword, Q_rehash_size)) rehash_size = value;
|
|
|
841 else if (EQ (keyword, Q_rehash_threshold)) rehash_threshold = value;
|
|
398
|
842 else if (EQ (keyword, Q_weakness)) weakness = value;
|
|
|
843 else if (EQ (keyword, Q_type))/*obsolete*/ weakness = value;
|
|
380
|
844 else signal_simple_error ("Invalid hash table property keyword", keyword);
|
|
|
845 }
|
|
|
846
|
|
398
|
847 if (i < nargs)
|
|
|
848 signal_simple_error ("Hash table property requires a value", args[i]);
|
|
|
849
|
|
380
|
850 #define VALIDATE_VAR(var) \
|
|
|
851 if (!NILP (var)) hash_table_##var##_validate (Q##var, var, ERROR_ME);
|
|
|
852
|
|
398
|
853 VALIDATE_VAR (test);
|
|
380
|
854 VALIDATE_VAR (size);
|
|
|
855 VALIDATE_VAR (rehash_size);
|
|
|
856 VALIDATE_VAR (rehash_threshold);
|
|
398
|
857 VALIDATE_VAR (weakness);
|
|
380
|
858
|
|
|
859 return make_general_lisp_hash_table
|
|
398
|
860 (decode_hash_table_test (test),
|
|
|
861 decode_hash_table_size (size),
|
|
380
|
862 decode_hash_table_rehash_size (rehash_size),
|
|
398
|
863 decode_hash_table_rehash_threshold (rehash_threshold),
|
|
|
864 decode_hash_table_weakness (weakness));
|
|
0
|
865 }
|
|
|
866
|
|
380
|
867 DEFUN ("copy-hash-table", Fcopy_hash_table, 1, 1, 0, /*
|
|
|
868 Return a new hash table containing the same keys and values as HASH-TABLE.
|
|
|
869 The keys and values will not themselves be copied.
|
|
|
870 */
|
|
|
871 (hash_table))
|
|
0
|
872 {
|
|
398
|
873 const Lisp_Hash_Table *ht_old = xhash_table (hash_table);
|
|
|
874 Lisp_Hash_Table *ht = alloc_lcrecord_type (Lisp_Hash_Table, &lrecord_hash_table);
|
|
380
|
875
|
|
|
876 copy_lcrecord (ht, ht_old);
|
|
|
877
|
|
|
878 ht->hentries = xnew_array (hentry, ht_old->size + 1);
|
|
|
879 memcpy (ht->hentries, ht_old->hentries, (ht_old->size + 1) * sizeof (hentry));
|
|
|
880
|
|
|
881 XSETHASH_TABLE (hash_table, ht);
|
|
|
882
|
|
|
883 if (! EQ (ht->next_weak, Qunbound))
|
|
|
884 {
|
|
|
885 ht->next_weak = Vall_weak_hash_tables;
|
|
|
886 Vall_weak_hash_tables = hash_table;
|
|
|
887 }
|
|
|
888
|
|
|
889 return hash_table;
|
|
0
|
890 }
|
|
|
891
|
|
380
|
892 static void
|
|
398
|
893 resize_hash_table (Lisp_Hash_Table *ht, size_t new_size)
|
|
0
|
894 {
|
|
398
|
895 hentry *old_entries, *new_entries, *sentinel, *e;
|
|
|
896 size_t old_size;
|
|
380
|
897
|
|
|
898 old_size = ht->size;
|
|
398
|
899 ht->size = new_size;
|
|
380
|
900
|
|
|
901 old_entries = ht->hentries;
|
|
|
902
|
|
398
|
903 ht->hentries = xnew_array_and_zero (hentry, new_size + 1);
|
|
380
|
904 new_entries = ht->hentries;
|
|
|
905
|
|
|
906 compute_hash_table_derived_values (ht);
|
|
|
907
|
|
398
|
908 for (e = old_entries, sentinel = e + old_size; e < sentinel; e++)
|
|
380
|
909 if (!HENTRY_CLEAR_P (e))
|
|
|
910 {
|
|
|
911 hentry *probe = new_entries + HASH_CODE (e->key, ht);
|
|
|
912 LINEAR_PROBING_LOOP (probe, new_entries, new_size)
|
|
|
913 ;
|
|
|
914 *probe = *e;
|
|
|
915 }
|
|
0
|
916
|
|
398
|
917 if (!DUMPEDP (old_entries))
|
|
|
918 xfree (old_entries);
|
|
|
919 }
|
|
|
920
|
|
|
921 /* After a hash table has been saved to disk and later restored by the
|
|
|
922 portable dumper, it contains the same objects, but their addresses
|
|
|
923 and thus their HASH_CODEs have changed. */
|
|
|
924 void
|
|
|
925 pdump_reorganize_hash_table (Lisp_Object hash_table)
|
|
|
926 {
|
|
|
927 const Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
|
928 hentry *new_entries = xnew_array_and_zero (hentry, ht->size + 1);
|
|
|
929 hentry *e, *sentinel;
|
|
|
930
|
|
|
931 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
932 if (!HENTRY_CLEAR_P (e))
|
|
|
933 {
|
|
|
934 hentry *probe = new_entries + HASH_CODE (e->key, ht);
|
|
|
935 LINEAR_PROBING_LOOP (probe, new_entries, ht->size)
|
|
|
936 ;
|
|
|
937 *probe = *e;
|
|
|
938 }
|
|
|
939
|
|
|
940 memcpy (ht->hentries, new_entries, ht->size * sizeof (hentry));
|
|
|
941
|
|
|
942 xfree (new_entries);
|
|
|
943 }
|
|
|
944
|
|
|
945 static void
|
|
|
946 enlarge_hash_table (Lisp_Hash_Table *ht)
|
|
|
947 {
|
|
|
948 size_t new_size =
|
|
|
949 hash_table_size ((size_t) ((double) ht->size * ht->rehash_size));
|
|
|
950 resize_hash_table (ht, new_size);
|
|
380
|
951 }
|
|
|
952
|
|
|
953 static hentry *
|
|
398
|
954 find_hentry (Lisp_Object key, const Lisp_Hash_Table *ht)
|
|
380
|
955 {
|
|
|
956 hash_table_test_function_t test_function = ht->test_function;
|
|
|
957 hentry *entries = ht->hentries;
|
|
|
958 hentry *probe = entries + HASH_CODE (key, ht);
|
|
|
959
|
|
|
960 LINEAR_PROBING_LOOP (probe, entries, ht->size)
|
|
|
961 if (KEYS_EQUAL_P (probe->key, key, test_function))
|
|
0
|
962 break;
|
|
|
963
|
|
380
|
964 return probe;
|
|
|
965 }
|
|
0
|
966
|
|
380
|
967 DEFUN ("gethash", Fgethash, 2, 3, 0, /*
|
|
|
968 Find hash value for KEY in HASH-TABLE.
|
|
|
969 If there is no corresponding value, return DEFAULT (which defaults to nil).
|
|
|
970 */
|
|
|
971 (key, hash_table, default_))
|
|
|
972 {
|
|
398
|
973 const Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
380
|
974 hentry *e = find_hentry (key, ht);
|
|
0
|
975
|
|
380
|
976 return HENTRY_CLEAR_P (e) ? default_ : e->value;
|
|
0
|
977 }
|
|
|
978
|
|
380
|
979 DEFUN ("puthash", Fputhash, 3, 3, 0, /*
|
|
|
980 Hash KEY to VALUE in HASH-TABLE.
|
|
|
981 */
|
|
|
982 (key, value, hash_table))
|
|
0
|
983 {
|
|
380
|
984 Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
|
985 hentry *e = find_hentry (key, ht);
|
|
0
|
986
|
|
380
|
987 if (!HENTRY_CLEAR_P (e))
|
|
|
988 return e->value = value;
|
|
0
|
989
|
|
380
|
990 e->key = key;
|
|
|
991 e->value = value;
|
|
|
992
|
|
|
993 if (++ht->count >= ht->rehash_count)
|
|
|
994 enlarge_hash_table (ht);
|
|
|
995
|
|
|
996 return value;
|
|
0
|
997 }
|
|
|
998
|
|
380
|
999 /* Remove hentry pointed at by PROBE.
|
|
|
1000 Subsequent entries are removed and reinserted.
|
|
|
1001 We don't use tombstones - too wasteful. */
|
|
|
1002 static void
|
|
|
1003 remhash_1 (Lisp_Hash_Table *ht, hentry *entries, hentry *probe)
|
|
0
|
1004 {
|
|
380
|
1005 size_t size = ht->size;
|
|
398
|
1006 CLEAR_HENTRY (probe);
|
|
|
1007 probe++;
|
|
380
|
1008 ht->count--;
|
|
0
|
1009
|
|
380
|
1010 LINEAR_PROBING_LOOP (probe, entries, size)
|
|
0
|
1011 {
|
|
380
|
1012 Lisp_Object key = probe->key;
|
|
|
1013 hentry *probe2 = entries + HASH_CODE (key, ht);
|
|
|
1014 LINEAR_PROBING_LOOP (probe2, entries, size)
|
|
|
1015 if (EQ (probe2->key, key))
|
|
|
1016 /* hentry at probe doesn't need to move. */
|
|
|
1017 goto continue_outer_loop;
|
|
|
1018 /* Move hentry from probe to new home at probe2. */
|
|
|
1019 *probe2 = *probe;
|
|
|
1020 CLEAR_HENTRY (probe);
|
|
|
1021 continue_outer_loop: continue;
|
|
0
|
1022 }
|
|
|
1023 }
|
|
|
1024
|
|
380
|
1025 DEFUN ("remhash", Fremhash, 2, 2, 0, /*
|
|
|
1026 Remove the entry for KEY from HASH-TABLE.
|
|
|
1027 Do nothing if there is no entry for KEY in HASH-TABLE.
|
|
20
|
1028 */
|
|
380
|
1029 (key, hash_table))
|
|
0
|
1030 {
|
|
380
|
1031 Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
|
1032 hentry *e = find_hentry (key, ht);
|
|
0
|
1033
|
|
380
|
1034 if (HENTRY_CLEAR_P (e))
|
|
|
1035 return Qnil;
|
|
0
|
1036
|
|
380
|
1037 remhash_1 (ht, ht->hentries, e);
|
|
|
1038 return Qt;
|
|
0
|
1039 }
|
|
|
1040
|
|
20
|
1041 DEFUN ("clrhash", Fclrhash, 1, 1, 0, /*
|
|
380
|
1042 Remove all entries from HASH-TABLE, leaving it empty.
|
|
20
|
1043 */
|
|
380
|
1044 (hash_table))
|
|
0
|
1045 {
|
|
380
|
1046 Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
|
1047 hentry *e, *sentinel;
|
|
|
1048
|
|
|
1049 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
1050 CLEAR_HENTRY (e);
|
|
|
1051 ht->count = 0;
|
|
|
1052
|
|
|
1053 return hash_table;
|
|
0
|
1054 }
|
|
|
1055
|
|
380
|
1056 /************************************************************************/
|
|
|
1057 /* Accessor Functions */
|
|
|
1058 /************************************************************************/
|
|
|
1059
|
|
|
1060 DEFUN ("hash-table-count", Fhash_table_count, 1, 1, 0, /*
|
|
|
1061 Return the number of entries in HASH-TABLE.
|
|
20
|
1062 */
|
|
380
|
1063 (hash_table))
|
|
0
|
1064 {
|
|
380
|
1065 return make_int (xhash_table (hash_table)->count);
|
|
0
|
1066 }
|
|
|
1067
|
|
380
|
1068 DEFUN ("hash-table-test", Fhash_table_test, 1, 1, 0, /*
|
|
|
1069 Return the test function of HASH-TABLE.
|
|
243
|
1070 This can be one of `eq', `eql' or `equal'.
|
|
|
1071 */
|
|
380
|
1072 (hash_table))
|
|
243
|
1073 {
|
|
380
|
1074 hash_table_test_function_t fun = xhash_table (hash_table)->test_function;
|
|
243
|
1075
|
|
380
|
1076 return (fun == lisp_object_eql_equal ? Qeql :
|
|
|
1077 fun == lisp_object_equal_equal ? Qequal :
|
|
|
1078 Qeq);
|
|
|
1079 }
|
|
243
|
1080
|
|
398
|
1081 DEFUN ("hash-table-size", Fhash_table_size, 1, 1, 0, /*
|
|
|
1082 Return the size of HASH-TABLE.
|
|
|
1083 This is the current number of slots in HASH-TABLE, whether occupied or not.
|
|
|
1084 */
|
|
|
1085 (hash_table))
|
|
|
1086 {
|
|
|
1087 return make_int (xhash_table (hash_table)->size);
|
|
|
1088 }
|
|
|
1089
|
|
380
|
1090 DEFUN ("hash-table-rehash-size", Fhash_table_rehash_size, 1, 1, 0, /*
|
|
|
1091 Return the current rehash size of HASH-TABLE.
|
|
|
1092 This is a float greater than 1.0; the factor by which HASH-TABLE
|
|
|
1093 is enlarged when the rehash threshold is exceeded.
|
|
|
1094 */
|
|
|
1095 (hash_table))
|
|
|
1096 {
|
|
|
1097 return make_float (xhash_table (hash_table)->rehash_size);
|
|
243
|
1098 }
|
|
0
|
1099
|
|
380
|
1100 DEFUN ("hash-table-rehash-threshold", Fhash_table_rehash_threshold, 1, 1, 0, /*
|
|
|
1101 Return the current rehash threshold of HASH-TABLE.
|
|
|
1102 This is a float between 0.0 and 1.0; the maximum `load factor' of HASH-TABLE,
|
|
|
1103 beyond which the HASH-TABLE is enlarged by rehashing.
|
|
|
1104 */
|
|
|
1105 (hash_table))
|
|
0
|
1106 {
|
|
398
|
1107 return make_float (xhash_table (hash_table)->rehash_threshold);
|
|
|
1108 }
|
|
|
1109
|
|
|
1110 DEFUN ("hash-table-weakness", Fhash_table_weakness, 1, 1, 0, /*
|
|
|
1111 Return the weakness of HASH-TABLE.
|
|
|
1112 This can be one of `nil', `t', `key' or `value'.
|
|
|
1113 */
|
|
|
1114 (hash_table))
|
|
|
1115 {
|
|
|
1116 switch (xhash_table (hash_table)->weakness)
|
|
|
1117 {
|
|
|
1118 case HASH_TABLE_WEAK: return Qt;
|
|
|
1119 case HASH_TABLE_KEY_WEAK: return Qkey;
|
|
|
1120 case HASH_TABLE_VALUE_WEAK: return Qvalue;
|
|
|
1121 default: return Qnil;
|
|
|
1122 }
|
|
|
1123 }
|
|
|
1124
|
|
|
1125 /* obsolete as of 19990901 in xemacs-21.2 */
|
|
|
1126 DEFUN ("hash-table-type", Fhash_table_type, 1, 1, 0, /*
|
|
|
1127 Return the type of HASH-TABLE.
|
|
|
1128 This can be one of `non-weak', `weak', `key-weak' or `value-weak'.
|
|
|
1129 */
|
|
|
1130 (hash_table))
|
|
|
1131 {
|
|
|
1132 switch (xhash_table (hash_table)->weakness)
|
|
|
1133 {
|
|
|
1134 case HASH_TABLE_WEAK: return Qweak;
|
|
|
1135 case HASH_TABLE_KEY_WEAK: return Qkey_weak;
|
|
|
1136 case HASH_TABLE_VALUE_WEAK: return Qvalue_weak;
|
|
|
1137 default: return Qnon_weak;
|
|
|
1138 }
|
|
0
|
1139 }
|
|
|
1140
|
|
380
|
1141 /************************************************************************/
|
|
|
1142 /* Mapping Functions */
|
|
|
1143 /************************************************************************/
|
|
|
1144 DEFUN ("maphash", Fmaphash, 2, 2, 0, /*
|
|
|
1145 Map FUNCTION over entries in HASH-TABLE, calling it with two args,
|
|
|
1146 each key and value in HASH-TABLE.
|
|
|
1147
|
|
|
1148 FUNCTION may not modify HASH-TABLE, with the one exception that FUNCTION
|
|
|
1149 may remhash or puthash the entry currently being processed by FUNCTION.
|
|
|
1150 */
|
|
|
1151 (function, hash_table))
|
|
0
|
1152 {
|
|
398
|
1153 const Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
|
1154 const hentry *e, *sentinel;
|
|
0
|
1155
|
|
380
|
1156 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
1157 if (!HENTRY_CLEAR_P (e))
|
|
|
1158 {
|
|
|
1159 Lisp_Object args[3], key;
|
|
|
1160 again:
|
|
|
1161 key = e->key;
|
|
|
1162 args[0] = function;
|
|
|
1163 args[1] = key;
|
|
|
1164 args[2] = e->value;
|
|
|
1165 Ffuncall (countof (args), args);
|
|
|
1166 /* Has FUNCTION done a remhash? */
|
|
|
1167 if (!EQ (key, e->key) && !HENTRY_CLEAR_P (e))
|
|
|
1168 goto again;
|
|
|
1169 }
|
|
0
|
1170
|
|
|
1171 return Qnil;
|
|
|
1172 }
|
|
|
1173
|
|
380
|
1174 /* Map *C* function FUNCTION over the elements of a lisp hash table. */
|
|
0
|
1175 void
|
|
380
|
1176 elisp_maphash (maphash_function_t function,
|
|
|
1177 Lisp_Object hash_table, void *extra_arg)
|
|
0
|
1178 {
|
|
398
|
1179 const Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
|
1180 const hentry *e, *sentinel;
|
|
0
|
1181
|
|
380
|
1182 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
1183 if (!HENTRY_CLEAR_P (e))
|
|
|
1184 {
|
|
|
1185 Lisp_Object key;
|
|
|
1186 again:
|
|
|
1187 key = e->key;
|
|
|
1188 if (function (key, e->value, extra_arg))
|
|
|
1189 return;
|
|
|
1190 /* Has FUNCTION done a remhash? */
|
|
|
1191 if (!EQ (key, e->key) && !HENTRY_CLEAR_P (e))
|
|
|
1192 goto again;
|
|
|
1193 }
|
|
0
|
1194 }
|
|
|
1195
|
|
380
|
1196 /* Remove all elements of a lisp hash table satisfying *C* predicate PREDICATE. */
|
|
0
|
1197 void
|
|
380
|
1198 elisp_map_remhash (maphash_function_t predicate,
|
|
|
1199 Lisp_Object hash_table, void *extra_arg)
|
|
0
|
1200 {
|
|
380
|
1201 Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
|
1202 hentry *e, *entries, *sentinel;
|
|
0
|
1203
|
|
380
|
1204 for (e = entries = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
|
1205 if (!HENTRY_CLEAR_P (e))
|
|
|
1206 {
|
|
|
1207 again:
|
|
|
1208 if (predicate (e->key, e->value, extra_arg))
|
|
|
1209 {
|
|
|
1210 remhash_1 (ht, entries, e);
|
|
|
1211 if (!HENTRY_CLEAR_P (e))
|
|
|
1212 goto again;
|
|
|
1213 }
|
|
|
1214 }
|
|
0
|
1215 }
|
|
|
1216
|
|
380
|
1217
|
|
|
1218 /************************************************************************/
|
|
|
1219 /* garbage collecting weak hash tables */
|
|
|
1220 /************************************************************************/
|
|
404
|
1221 #define MARK_OBJ(obj) do { \
|
|
|
1222 Lisp_Object mo_obj = (obj); \
|
|
|
1223 if (!marked_p (mo_obj)) \
|
|
|
1224 { \
|
|
|
1225 mark_object (mo_obj); \
|
|
|
1226 did_mark = 1; \
|
|
|
1227 } \
|
|
|
1228 } while (0)
|
|
|
1229
|
|
0
|
1230
|
|
380
|
1231 /* Complete the marking for semi-weak hash tables. */
|
|
0
|
1232 int
|
|
398
|
1233 finish_marking_weak_hash_tables (void)
|
|
0
|
1234 {
|
|
380
|
1235 Lisp_Object hash_table;
|
|
0
|
1236 int did_mark = 0;
|
|
|
1237
|
|
380
|
1238 for (hash_table = Vall_weak_hash_tables;
|
|
398
|
1239 !NILP (hash_table);
|
|
380
|
1240 hash_table = XHASH_TABLE (hash_table)->next_weak)
|
|
0
|
1241 {
|
|
398
|
1242 const Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
|
1243 const hentry *e = ht->hentries;
|
|
|
1244 const hentry *sentinel = e + ht->size;
|
|
380
|
1245
|
|
398
|
1246 if (! marked_p (hash_table))
|
|
380
|
1247 /* The hash table is probably garbage. Ignore it. */
|
|
|
1248 continue;
|
|
0
|
1249
|
|
380
|
1250 /* Now, scan over all the pairs. For all pairs that are
|
|
|
1251 half-marked, we may need to mark the other half if we're
|
|
|
1252 keeping this pair. */
|
|
398
|
1253 switch (ht->weakness)
|
|
0
|
1254 {
|
|
380
|
1255 case HASH_TABLE_KEY_WEAK:
|
|
|
1256 for (; e < sentinel; e++)
|
|
|
1257 if (!HENTRY_CLEAR_P (e))
|
|
398
|
1258 if (marked_p (e->key))
|
|
380
|
1259 MARK_OBJ (e->value);
|
|
|
1260 break;
|
|
0
|
1261
|
|
380
|
1262 case HASH_TABLE_VALUE_WEAK:
|
|
|
1263 for (; e < sentinel; e++)
|
|
|
1264 if (!HENTRY_CLEAR_P (e))
|
|
398
|
1265 if (marked_p (e->value))
|
|
380
|
1266 MARK_OBJ (e->key);
|
|
|
1267 break;
|
|
0
|
1268
|
|
380
|
1269 case HASH_TABLE_KEY_CAR_WEAK:
|
|
|
1270 for (; e < sentinel; e++)
|
|
|
1271 if (!HENTRY_CLEAR_P (e))
|
|
398
|
1272 if (!CONSP (e->key) || marked_p (XCAR (e->key)))
|
|
380
|
1273 {
|
|
|
1274 MARK_OBJ (e->key);
|
|
|
1275 MARK_OBJ (e->value);
|
|
|
1276 }
|
|
|
1277 break;
|
|
|
1278
|
|
|
1279 case HASH_TABLE_VALUE_CAR_WEAK:
|
|
|
1280 for (; e < sentinel; e++)
|
|
|
1281 if (!HENTRY_CLEAR_P (e))
|
|
398
|
1282 if (!CONSP (e->value) || marked_p (XCAR (e->value)))
|
|
380
|
1283 {
|
|
|
1284 MARK_OBJ (e->key);
|
|
|
1285 MARK_OBJ (e->value);
|
|
|
1286 }
|
|
|
1287 break;
|
|
|
1288
|
|
|
1289 default:
|
|
|
1290 break;
|
|
|
1291 }
|
|
0
|
1292 }
|
|
|
1293
|
|
|
1294 return did_mark;
|
|
|
1295 }
|
|
|
1296
|
|
380
|
1297 void
|
|
398
|
1298 prune_weak_hash_tables (void)
|
|
0
|
1299 {
|
|
380
|
1300 Lisp_Object hash_table, prev = Qnil;
|
|
|
1301 for (hash_table = Vall_weak_hash_tables;
|
|
398
|
1302 !NILP (hash_table);
|
|
380
|
1303 hash_table = XHASH_TABLE (hash_table)->next_weak)
|
|
0
|
1304 {
|
|
398
|
1305 if (! marked_p (hash_table))
|
|
0
|
1306 {
|
|
380
|
1307 /* This hash table itself is garbage. Remove it from the list. */
|
|
398
|
1308 if (NILP (prev))
|
|
380
|
1309 Vall_weak_hash_tables = XHASH_TABLE (hash_table)->next_weak;
|
|
0
|
1310 else
|
|
380
|
1311 XHASH_TABLE (prev)->next_weak = XHASH_TABLE (hash_table)->next_weak;
|
|
0
|
1312 }
|
|
|
1313 else
|
|
|
1314 {
|
|
|
1315 /* Now, scan over all the pairs. Remove all of the pairs
|
|
|
1316 in which the key or value, or both, is unmarked
|
|
398
|
1317 (depending on the weakness of the hash table). */
|
|
380
|
1318 Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
|
1319 hentry *entries = ht->hentries;
|
|
|
1320 hentry *sentinel = entries + ht->size;
|
|
|
1321 hentry *e;
|
|
|
1322
|
|
|
1323 for (e = entries; e < sentinel; e++)
|
|
|
1324 if (!HENTRY_CLEAR_P (e))
|
|
|
1325 {
|
|
|
1326 again:
|
|
398
|
1327 if (!marked_p (e->key) || !marked_p (e->value))
|
|
380
|
1328 {
|
|
|
1329 remhash_1 (ht, entries, e);
|
|
|
1330 if (!HENTRY_CLEAR_P (e))
|
|
|
1331 goto again;
|
|
|
1332 }
|
|
|
1333 }
|
|
|
1334
|
|
|
1335 prev = hash_table;
|
|
0
|
1336 }
|
|
|
1337 }
|
|
|
1338 }
|
|
|
1339
|
|
|
1340 /* Return a hash value for an array of Lisp_Objects of size SIZE. */
|
|
|
1341
|
|
380
|
1342 hashcode_t
|
|
0
|
1343 internal_array_hash (Lisp_Object *arr, int size, int depth)
|
|
|
1344 {
|
|
|
1345 int i;
|
|
398
|
1346 hashcode_t hash = 0;
|
|
|
1347 depth++;
|
|
0
|
1348
|
|
|
1349 if (size <= 5)
|
|
|
1350 {
|
|
|
1351 for (i = 0; i < size; i++)
|
|
398
|
1352 hash = HASH2 (hash, internal_hash (arr[i], depth));
|
|
0
|
1353 return hash;
|
|
|
1354 }
|
|
185
|
1355
|
|
0
|
1356 /* just pick five elements scattered throughout the array.
|
|
|
1357 A slightly better approach would be to offset by some
|
|
|
1358 noise factor from the points chosen below. */
|
|
|
1359 for (i = 0; i < 5; i++)
|
|
398
|
1360 hash = HASH2 (hash, internal_hash (arr[i*size/5], depth));
|
|
185
|
1361
|
|
0
|
1362 return hash;
|
|
|
1363 }
|
|
|
1364
|
|
|
1365 /* Return a hash value for a Lisp_Object. This is for use when hashing
|
|
|
1366 objects with the comparison being `equal' (for `eq', you can just
|
|
|
1367 use the Lisp_Object itself as the hash value). You need to make a
|
|
|
1368 tradeoff between the speed of the hash function and how good the
|
|
|
1369 hashing is. In particular, the hash function needs to be FAST,
|
|
|
1370 so you can't just traipse down the whole tree hashing everything
|
|
|
1371 together. Most of the time, objects will differ in the first
|
|
|
1372 few elements you hash. Thus, we only go to a short depth (5)
|
|
|
1373 and only hash at most 5 elements out of a vector. Theoretically
|
|
|
1374 we could still take 5^5 time (a big big number) to compute a
|
|
|
1375 hash, but practically this won't ever happen. */
|
|
|
1376
|
|
380
|
1377 hashcode_t
|
|
0
|
1378 internal_hash (Lisp_Object obj, int depth)
|
|
|
1379 {
|
|
|
1380 if (depth > 5)
|
|
|
1381 return 0;
|
|
|
1382 if (CONSP (obj))
|
|
|
1383 {
|
|
|
1384 /* no point in worrying about tail recursion, since we're not
|
|
|
1385 going very deep */
|
|
|
1386 return HASH2 (internal_hash (XCAR (obj), depth + 1),
|
|
|
1387 internal_hash (XCDR (obj), depth + 1));
|
|
|
1388 }
|
|
380
|
1389 if (STRINGP (obj))
|
|
0
|
1390 {
|
|
380
|
1391 return hash_string (XSTRING_DATA (obj), XSTRING_LENGTH (obj));
|
|
|
1392 }
|
|
|
1393 if (LRECORDP (obj))
|
|
0
|
1394 {
|
|
398
|
1395 const struct lrecord_implementation
|
|
211
|
1396 *imp = XRECORD_LHEADER_IMPLEMENTATION (obj);
|
|
0
|
1397 if (imp->hash)
|
|
380
|
1398 return imp->hash (obj, depth);
|
|
0
|
1399 }
|
|
|
1400
|
|
|
1401 return LISP_HASH (obj);
|
|
|
1402 }
|
|
|
1403
|
|
398
|
1404 DEFUN ("sxhash", Fsxhash, 1, 1, 0, /*
|
|
|
1405 Return a hash value for OBJECT.
|
|
|
1406 (equal obj1 obj2) implies (= (sxhash obj1) (sxhash obj2)).
|
|
|
1407 */
|
|
|
1408 (object))
|
|
|
1409 {
|
|
|
1410 return make_int (internal_hash (object, 0));
|
|
|
1411 }
|
|
|
1412
|
|
241
|
1413 #if 0
|
|
|
1414 xxDEFUN ("internal-hash-value", Finternal_hash_value, 1, 1, 0, /*
|
|
|
1415 Hash value of OBJECT. For debugging.
|
|
|
1416 The value is returned as (HIGH . LOW).
|
|
|
1417 */
|
|
|
1418 (object))
|
|
|
1419 {
|
|
|
1420 /* This function is pretty 32bit-centric. */
|
|
398
|
1421 hashcode_t hash = internal_hash (object, 0);
|
|
241
|
1422 return Fcons (hash >> 16, hash & 0xffff);
|
|
|
1423 }
|
|
|
1424 #endif
|
|
|
1425
|
|
0
|
1426
|
|
|
1427 /************************************************************************/
|
|
|
1428 /* initialization */
|
|
|
1429 /************************************************************************/
|
|
|
1430
|
|
|
1431 void
|
|
|
1432 syms_of_elhash (void)
|
|
|
1433 {
|
|
400
|
1434 INIT_LRECORD_IMPLEMENTATION (hash_table);
|
|
|
1435
|
|
380
|
1436 DEFSUBR (Fhash_table_p);
|
|
|
1437 DEFSUBR (Fmake_hash_table);
|
|
|
1438 DEFSUBR (Fcopy_hash_table);
|
|
20
|
1439 DEFSUBR (Fgethash);
|
|
380
|
1440 DEFSUBR (Fremhash);
|
|
20
|
1441 DEFSUBR (Fputhash);
|
|
|
1442 DEFSUBR (Fclrhash);
|
|
|
1443 DEFSUBR (Fmaphash);
|
|
380
|
1444 DEFSUBR (Fhash_table_count);
|
|
398
|
1445 DEFSUBR (Fhash_table_test);
|
|
380
|
1446 DEFSUBR (Fhash_table_size);
|
|
|
1447 DEFSUBR (Fhash_table_rehash_size);
|
|
|
1448 DEFSUBR (Fhash_table_rehash_threshold);
|
|
398
|
1449 DEFSUBR (Fhash_table_weakness);
|
|
|
1450 DEFSUBR (Fhash_table_type); /* obsolete */
|
|
|
1451 DEFSUBR (Fsxhash);
|
|
241
|
1452 #if 0
|
|
|
1453 DEFSUBR (Finternal_hash_value);
|
|
|
1454 #endif
|
|
380
|
1455
|
|
|
1456 defsymbol (&Qhash_tablep, "hash-table-p");
|
|
|
1457 defsymbol (&Qhash_table, "hash-table");
|
|
223
|
1458 defsymbol (&Qhashtable, "hashtable");
|
|
398
|
1459 defsymbol (&Qweakness, "weakness");
|
|
|
1460 defsymbol (&Qvalue, "value");
|
|
380
|
1461 defsymbol (&Qrehash_size, "rehash-size");
|
|
|
1462 defsymbol (&Qrehash_threshold, "rehash-threshold");
|
|
|
1463
|
|
398
|
1464 defsymbol (&Qweak, "weak"); /* obsolete */
|
|
|
1465 defsymbol (&Qkey_weak, "key-weak"); /* obsolete */
|
|
|
1466 defsymbol (&Qvalue_weak, "value-weak"); /* obsolete */
|
|
|
1467 defsymbol (&Qnon_weak, "non-weak"); /* obsolete */
|
|
|
1468
|
|
380
|
1469 defkeyword (&Q_test, ":test");
|
|
398
|
1470 defkeyword (&Q_size, ":size");
|
|
380
|
1471 defkeyword (&Q_rehash_size, ":rehash-size");
|
|
|
1472 defkeyword (&Q_rehash_threshold, ":rehash-threshold");
|
|
398
|
1473 defkeyword (&Q_weakness, ":weakness");
|
|
|
1474 defkeyword (&Q_type, ":type"); /* obsolete */
|
|
0
|
1475 }
|
|
|
1476
|
|
|
1477 void
|
|
|
1478 vars_of_elhash (void)
|
|
|
1479 {
|
|
2
|
1480 /* This must NOT be staticpro'd */
|
|
380
|
1481 Vall_weak_hash_tables = Qnil;
|
|
398
|
1482 pdump_wire_list (&Vall_weak_hash_tables);
|
|
0
|
1483 }
|
