|
428
|
1 /* Implementation of the hash table lisp object type.
|
|
|
2 Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc.
|
|
800
|
3 Copyright (C) 1995, 1996, 2002 Ben Wing.
|
|
428
|
4 Copyright (C) 1997 Free Software Foundation, Inc.
|
|
|
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
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCNTABILITY or
|
|
|
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
|
|
1292
|
25 /* Author: Lost in the mists of history. At least back to Lucid 19.3,
|
|
|
26 circa Sep 1992. Early hash table implementation allowed only `eq' as a
|
|
|
27 test -- other tests possible only when these objects were created from
|
|
|
28 the C code.
|
|
|
29
|
|
|
30 Expansion to allow general `equal'-test Lisp-creatable tables, and hash
|
|
|
31 methods for the various Lisp objects in existence at the time, added
|
|
|
32 during 19.12 I think (early 1995?), by Ben Wing.
|
|
|
33
|
|
|
34 Weak hash tables added by Jamie (maybe?) early on, perhaps around 19.6,
|
|
|
35 maybe earlier; again, only possible through the C code, and only
|
|
|
36 supported fully weak hash tables. Expansion to other kinds of weakness,
|
|
|
37 and exporting of the interface to Lisp, by Ben Wing during 19.12
|
|
|
38 (early-mid 1995) or maybe 19.13 cycle (mid 1995).
|
|
|
39
|
|
|
40 Expansion to full Common Lisp spec and interface, redoing of the
|
|
|
41 implementation, by Martin Buchholz, 1997? (Former hash table
|
|
|
42 implementation used "double hashing", I'm pretty sure, and was weirdly
|
|
|
43 tied into the generic hash.c code. Martin completely separated them.)
|
|
|
44 */
|
|
|
45
|
|
489
|
46 /* This file implements the hash table lisp object type.
|
|
|
47
|
|
504
|
48 This implementation was mostly written by Martin Buchholz in 1997.
|
|
|
49
|
|
|
50 The Lisp-level API (derived from Common Lisp) is almost completely
|
|
|
51 compatible with GNU Emacs 21, even though the implementations are
|
|
|
52 totally independent.
|
|
|
53
|
|
489
|
54 The hash table technique used is "linear probing". Collisions are
|
|
|
55 resolved by putting the item in the next empty place in the array
|
|
|
56 following the collision. Finding a hash entry performs a linear
|
|
|
57 search in the cluster starting at the hash value.
|
|
|
58
|
|
|
59 On deletions from the hash table, the entries immediately following
|
|
|
60 the deleted entry are re-entered in the hash table. We do not have
|
|
|
61 a special way to mark deleted entries (known as "tombstones").
|
|
|
62
|
|
|
63 At the end of the hash entries ("hentries"), we leave room for an
|
|
|
64 entry that is always empty (the "sentinel").
|
|
|
65
|
|
|
66 The traditional literature on hash table implementation
|
|
|
67 (e.g. Knuth) suggests that too much "primary clustering" occurs
|
|
|
68 with linear probing. However, this literature was written when
|
|
|
69 locality of reference was not a factor. The discrepancy between
|
|
|
70 CPU speeds and memory speeds is increasing, and the speed of access
|
|
|
71 to memory is highly dependent on memory caches which work best when
|
|
|
72 there is high locality of data reference. Random access to memory
|
|
|
73 is up to 20 times as expensive as access to the nearest address
|
|
|
74 (and getting worse). So linear probing makes sense.
|
|
|
75
|
|
|
76 But the representation doesn't actually matter that much with the
|
|
|
77 current elisp engine. Funcall is sufficiently slow that the choice
|
|
|
78 of hash table implementation is noise. */
|
|
|
79
|
|
428
|
80 #include <config.h>
|
|
|
81 #include "lisp.h"
|
|
|
82 #include "bytecode.h"
|
|
|
83 #include "elhash.h"
|
|
489
|
84 #include "opaque.h"
|
|
428
|
85
|
|
|
86 Lisp_Object Qhash_tablep;
|
|
|
87 static Lisp_Object Qhashtable, Qhash_table;
|
|
442
|
88 static Lisp_Object Qweakness, Qvalue, Qkey_or_value, Qkey_and_value;
|
|
428
|
89 static Lisp_Object Vall_weak_hash_tables;
|
|
|
90 static Lisp_Object Qrehash_size, Qrehash_threshold;
|
|
|
91 static Lisp_Object Q_size, Q_test, Q_weakness, Q_rehash_size, Q_rehash_threshold;
|
|
|
92
|
|
|
93 /* obsolete as of 19990901 in xemacs-21.2 */
|
|
442
|
94 static Lisp_Object Qweak, Qkey_weak, Qvalue_weak, Qkey_or_value_weak;
|
|
|
95 static Lisp_Object Qnon_weak, Q_type;
|
|
428
|
96
|
|
1204
|
97 typedef struct htentry
|
|
428
|
98 {
|
|
|
99 Lisp_Object key;
|
|
|
100 Lisp_Object value;
|
|
1204
|
101 } htentry;
|
|
428
|
102
|
|
|
103 struct Lisp_Hash_Table
|
|
|
104 {
|
|
|
105 struct lcrecord_header header;
|
|
665
|
106 Elemcount size;
|
|
|
107 Elemcount count;
|
|
|
108 Elemcount rehash_count;
|
|
428
|
109 double rehash_size;
|
|
|
110 double rehash_threshold;
|
|
665
|
111 Elemcount golden_ratio;
|
|
428
|
112 hash_table_hash_function_t hash_function;
|
|
|
113 hash_table_test_function_t test_function;
|
|
1204
|
114 htentry *hentries;
|
|
428
|
115 enum hash_table_weakness weakness;
|
|
|
116 Lisp_Object next_weak; /* Used to chain together all of the weak
|
|
|
117 hash tables. Don't mark through this. */
|
|
|
118 };
|
|
|
119
|
|
1204
|
120 #define HTENTRY_CLEAR_P(htentry) ((*(EMACS_UINT*)(&((htentry)->key))) == 0)
|
|
|
121 #define CLEAR_HTENTRY(htentry) \
|
|
|
122 ((*(EMACS_UINT*)(&((htentry)->key))) = 0, \
|
|
|
123 (*(EMACS_UINT*)(&((htentry)->value))) = 0)
|
|
428
|
124
|
|
|
125 #define HASH_TABLE_DEFAULT_SIZE 16
|
|
|
126 #define HASH_TABLE_DEFAULT_REHASH_SIZE 1.3
|
|
|
127 #define HASH_TABLE_MIN_SIZE 10
|
|
|
128
|
|
665
|
129 #define HASHCODE(key, ht) \
|
|
444
|
130 ((((ht)->hash_function ? (ht)->hash_function (key) : LISP_HASH (key)) \
|
|
|
131 * (ht)->golden_ratio) \
|
|
|
132 % (ht)->size)
|
|
428
|
133
|
|
|
134 #define KEYS_EQUAL_P(key1, key2, testfun) \
|
|
434
|
135 (EQ (key1, key2) || ((testfun) && (testfun) (key1, key2)))
|
|
428
|
136
|
|
|
137 #define LINEAR_PROBING_LOOP(probe, entries, size) \
|
|
|
138 for (; \
|
|
1204
|
139 !HTENTRY_CLEAR_P (probe) || \
|
|
428
|
140 (probe == entries + size ? \
|
|
1204
|
141 (probe = entries, !HTENTRY_CLEAR_P (probe)) : 0); \
|
|
428
|
142 probe++)
|
|
|
143
|
|
800
|
144 #ifdef ERROR_CHECK_STRUCTURES
|
|
428
|
145 static void
|
|
|
146 check_hash_table_invariants (Lisp_Hash_Table *ht)
|
|
|
147 {
|
|
|
148 assert (ht->count < ht->size);
|
|
|
149 assert (ht->count <= ht->rehash_count);
|
|
|
150 assert (ht->rehash_count < ht->size);
|
|
|
151 assert ((double) ht->count * ht->rehash_threshold - 1 <= (double) ht->rehash_count);
|
|
1204
|
152 assert (HTENTRY_CLEAR_P (ht->hentries + ht->size));
|
|
428
|
153 }
|
|
|
154 #else
|
|
|
155 #define check_hash_table_invariants(ht)
|
|
|
156 #endif
|
|
|
157
|
|
|
158 /* Return a suitable size for a hash table, with at least SIZE slots. */
|
|
665
|
159 static Elemcount
|
|
|
160 hash_table_size (Elemcount requested_size)
|
|
428
|
161 {
|
|
|
162 /* Return some prime near, but greater than or equal to, SIZE.
|
|
|
163 Decades from the time of writing, someone will have a system large
|
|
|
164 enough that the list below will be too short... */
|
|
665
|
165 static const Elemcount primes [] =
|
|
428
|
166 {
|
|
|
167 19, 29, 41, 59, 79, 107, 149, 197, 263, 347, 457, 599, 787, 1031,
|
|
|
168 1361, 1777, 2333, 3037, 3967, 5167, 6719, 8737, 11369, 14783,
|
|
|
169 19219, 24989, 32491, 42257, 54941, 71429, 92861, 120721, 156941,
|
|
|
170 204047, 265271, 344857, 448321, 582821, 757693, 985003, 1280519,
|
|
|
171 1664681, 2164111, 2813353, 3657361, 4754591, 6180989, 8035301,
|
|
|
172 10445899, 13579681, 17653589, 22949669, 29834603, 38784989,
|
|
|
173 50420551, 65546729, 85210757, 110774011, 144006217, 187208107,
|
|
|
174 243370577, 316381771, 411296309, 534685237, 695090819, 903618083,
|
|
647
|
175 1174703521, 1527114613, 1985248999 /* , 2580823717UL, 3355070839UL */
|
|
428
|
176 };
|
|
|
177 /* We've heard of binary search. */
|
|
|
178 int low, high;
|
|
|
179 for (low = 0, high = countof (primes) - 1; high - low > 1;)
|
|
|
180 {
|
|
|
181 /* Loop Invariant: size < primes [high] */
|
|
|
182 int mid = (low + high) / 2;
|
|
|
183 if (primes [mid] < requested_size)
|
|
|
184 low = mid;
|
|
|
185 else
|
|
|
186 high = mid;
|
|
|
187 }
|
|
|
188 return primes [high];
|
|
|
189 }
|
|
|
190
|
|
|
191
|
|
|
192 #if 0 /* I don't think these are needed any more.
|
|
|
193 If using the general lisp_object_equal_*() functions
|
|
|
194 causes efficiency problems, these can be resurrected. --ben */
|
|
|
195 /* equality and hash functions for Lisp strings */
|
|
|
196 int
|
|
|
197 lisp_string_equal (Lisp_Object str1, Lisp_Object str2)
|
|
|
198 {
|
|
|
199 /* This is wrong anyway. You can't use strcmp() on Lisp strings,
|
|
|
200 because they can contain zero characters. */
|
|
|
201 return !strcmp ((char *) XSTRING_DATA (str1), (char *) XSTRING_DATA (str2));
|
|
|
202 }
|
|
|
203
|
|
665
|
204 static Hashcode
|
|
428
|
205 lisp_string_hash (Lisp_Object obj)
|
|
|
206 {
|
|
|
207 return hash_string (XSTRING_DATA (str), XSTRING_LENGTH (str));
|
|
|
208 }
|
|
|
209
|
|
|
210 #endif /* 0 */
|
|
|
211
|
|
|
212 static int
|
|
|
213 lisp_object_eql_equal (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
214 {
|
|
|
215 return EQ (obj1, obj2) || (FLOATP (obj1) && internal_equal (obj1, obj2, 0));
|
|
|
216 }
|
|
|
217
|
|
665
|
218 static Hashcode
|
|
428
|
219 lisp_object_eql_hash (Lisp_Object obj)
|
|
|
220 {
|
|
|
221 return FLOATP (obj) ? internal_hash (obj, 0) : LISP_HASH (obj);
|
|
|
222 }
|
|
|
223
|
|
|
224 static int
|
|
|
225 lisp_object_equal_equal (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
226 {
|
|
|
227 return internal_equal (obj1, obj2, 0);
|
|
|
228 }
|
|
|
229
|
|
665
|
230 static Hashcode
|
|
428
|
231 lisp_object_equal_hash (Lisp_Object obj)
|
|
|
232 {
|
|
|
233 return internal_hash (obj, 0);
|
|
|
234 }
|
|
|
235
|
|
|
236
|
|
|
237 static Lisp_Object
|
|
|
238 mark_hash_table (Lisp_Object obj)
|
|
|
239 {
|
|
|
240 Lisp_Hash_Table *ht = XHASH_TABLE (obj);
|
|
|
241
|
|
|
242 /* If the hash table is weak, we don't want to mark the keys and
|
|
|
243 values (we scan over them after everything else has been marked,
|
|
|
244 and mark or remove them as necessary). */
|
|
|
245 if (ht->weakness == HASH_TABLE_NON_WEAK)
|
|
|
246 {
|
|
1204
|
247 htentry *e, *sentinel;
|
|
428
|
248
|
|
|
249 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
1204
|
250 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
251 {
|
|
|
252 mark_object (e->key);
|
|
|
253 mark_object (e->value);
|
|
|
254 }
|
|
|
255 }
|
|
|
256 return Qnil;
|
|
|
257 }
|
|
|
258
|
|
|
259 /* Equality of hash tables. Two hash tables are equal when they are of
|
|
|
260 the same weakness and test function, they have the same number of
|
|
|
261 elements, and for each key in the hash table, the values are `equal'.
|
|
|
262
|
|
|
263 This is similar to Common Lisp `equalp' of hash tables, with the
|
|
|
264 difference that CL requires the keys to be compared with the test
|
|
|
265 function, which we don't do. Doing that would require consing, and
|
|
|
266 consing is a bad idea in `equal'. Anyway, our method should provide
|
|
|
267 the same result -- if the keys are not equal according to the test
|
|
|
268 function, then Fgethash() in hash_table_equal_mapper() will fail. */
|
|
|
269 static int
|
|
|
270 hash_table_equal (Lisp_Object hash_table1, Lisp_Object hash_table2, int depth)
|
|
|
271 {
|
|
|
272 Lisp_Hash_Table *ht1 = XHASH_TABLE (hash_table1);
|
|
|
273 Lisp_Hash_Table *ht2 = XHASH_TABLE (hash_table2);
|
|
1204
|
274 htentry *e, *sentinel;
|
|
428
|
275
|
|
|
276 if ((ht1->test_function != ht2->test_function) ||
|
|
|
277 (ht1->weakness != ht2->weakness) ||
|
|
|
278 (ht1->count != ht2->count))
|
|
|
279 return 0;
|
|
|
280
|
|
|
281 depth++;
|
|
|
282
|
|
|
283 for (e = ht1->hentries, sentinel = e + ht1->size; e < sentinel; e++)
|
|
1204
|
284 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
285 /* Look up the key in the other hash table, and compare the values. */
|
|
|
286 {
|
|
|
287 Lisp_Object value_in_other = Fgethash (e->key, hash_table2, Qunbound);
|
|
|
288 if (UNBOUNDP (value_in_other) ||
|
|
|
289 !internal_equal (e->value, value_in_other, depth))
|
|
|
290 return 0; /* Give up */
|
|
|
291 }
|
|
|
292
|
|
|
293 return 1;
|
|
|
294 }
|
|
442
|
295
|
|
|
296 /* This is not a great hash function, but it _is_ correct and fast.
|
|
|
297 Examining all entries is too expensive, and examining a random
|
|
|
298 subset does not yield a correct hash function. */
|
|
665
|
299 static Hashcode
|
|
2286
|
300 hash_table_hash (Lisp_Object hash_table, int UNUSED (depth))
|
|
442
|
301 {
|
|
|
302 return XHASH_TABLE (hash_table)->count;
|
|
|
303 }
|
|
|
304
|
|
428
|
305
|
|
|
306 /* Printing hash tables.
|
|
|
307
|
|
|
308 This is non-trivial, because we use a readable structure-style
|
|
|
309 syntax for hash tables. This means that a typical hash table will be
|
|
|
310 readably printed in the form of:
|
|
|
311
|
|
|
312 #s(hash-table size 2 data (key1 value1 key2 value2))
|
|
|
313
|
|
|
314 The supported hash table structure keywords and their values are:
|
|
|
315 `test' (eql (or nil), eq or equal)
|
|
|
316 `size' (a natnum or nil)
|
|
|
317 `rehash-size' (a float)
|
|
|
318 `rehash-threshold' (a float)
|
|
442
|
319 `weakness' (nil, key, value, key-and-value, or key-or-value)
|
|
428
|
320 `data' (a list)
|
|
|
321
|
|
430
|
322 If `print-readably' is nil, then a simpler syntax is used, for example
|
|
428
|
323
|
|
|
324 #<hash-table size 2/13 data (key1 value1 key2 value2) 0x874d>
|
|
|
325
|
|
|
326 The data is truncated to four pairs, and the rest is shown with
|
|
|
327 `...'. This printer does not cons. */
|
|
|
328
|
|
|
329
|
|
|
330 /* Print the data of the hash table. This maps through a Lisp
|
|
|
331 hash table and prints key/value pairs using PRINTCHARFUN. */
|
|
|
332 static void
|
|
|
333 print_hash_table_data (Lisp_Hash_Table *ht, Lisp_Object printcharfun)
|
|
|
334 {
|
|
|
335 int count = 0;
|
|
1204
|
336 htentry *e, *sentinel;
|
|
428
|
337
|
|
826
|
338 write_c_string (printcharfun, " data (");
|
|
428
|
339
|
|
|
340 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
1204
|
341 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
342 {
|
|
|
343 if (count > 0)
|
|
826
|
344 write_c_string (printcharfun, " ");
|
|
428
|
345 if (!print_readably && count > 3)
|
|
|
346 {
|
|
826
|
347 write_c_string (printcharfun, "...");
|
|
428
|
348 break;
|
|
|
349 }
|
|
|
350 print_internal (e->key, printcharfun, 1);
|
|
800
|
351 write_fmt_string_lisp (printcharfun, " %S", 1, e->value);
|
|
428
|
352 count++;
|
|
|
353 }
|
|
|
354
|
|
826
|
355 write_c_string (printcharfun, ")");
|
|
428
|
356 }
|
|
|
357
|
|
|
358 static void
|
|
2286
|
359 print_hash_table (Lisp_Object obj, Lisp_Object printcharfun,
|
|
|
360 int UNUSED (escapeflag))
|
|
428
|
361 {
|
|
|
362 Lisp_Hash_Table *ht = XHASH_TABLE (obj);
|
|
|
363
|
|
826
|
364 write_c_string (printcharfun,
|
|
|
365 print_readably ? "#s(hash-table" : "#<hash-table");
|
|
428
|
366
|
|
|
367 /* These checks have a kludgy look to them, but they are safe.
|
|
|
368 Due to nature of hashing, you cannot use arbitrary
|
|
|
369 test functions anyway. */
|
|
|
370 if (!ht->test_function)
|
|
826
|
371 write_c_string (printcharfun, " test eq");
|
|
428
|
372 else if (ht->test_function == lisp_object_equal_equal)
|
|
826
|
373 write_c_string (printcharfun, " test equal");
|
|
428
|
374 else if (ht->test_function == lisp_object_eql_equal)
|
|
|
375 DO_NOTHING;
|
|
|
376 else
|
|
|
377 abort ();
|
|
|
378
|
|
|
379 if (ht->count || !print_readably)
|
|
|
380 {
|
|
|
381 if (print_readably)
|
|
800
|
382 write_fmt_string (printcharfun, " size %ld", (long) ht->count);
|
|
428
|
383 else
|
|
800
|
384 write_fmt_string (printcharfun, " size %ld/%ld", (long) ht->count,
|
|
|
385 (long) ht->size);
|
|
428
|
386 }
|
|
|
387
|
|
|
388 if (ht->weakness != HASH_TABLE_NON_WEAK)
|
|
|
389 {
|
|
800
|
390 write_fmt_string
|
|
|
391 (printcharfun, " weakness %s",
|
|
|
392 (ht->weakness == HASH_TABLE_WEAK ? "key-and-value" :
|
|
|
393 ht->weakness == HASH_TABLE_KEY_WEAK ? "key" :
|
|
|
394 ht->weakness == HASH_TABLE_VALUE_WEAK ? "value" :
|
|
|
395 ht->weakness == HASH_TABLE_KEY_VALUE_WEAK ? "key-or-value" :
|
|
|
396 "you-d-better-not-see-this"));
|
|
428
|
397 }
|
|
|
398
|
|
|
399 if (ht->count)
|
|
|
400 print_hash_table_data (ht, printcharfun);
|
|
|
401
|
|
|
402 if (print_readably)
|
|
826
|
403 write_c_string (printcharfun, ")");
|
|
428
|
404 else
|
|
|
405 {
|
|
800
|
406 write_fmt_string (printcharfun, " 0x%x>", ht->header.uid);
|
|
428
|
407 }
|
|
|
408 }
|
|
|
409
|
|
|
410 static void
|
|
1204
|
411 free_hentries (htentry *hentries, size_t size)
|
|
489
|
412 {
|
|
800
|
413 #ifdef ERROR_CHECK_STRUCTURES
|
|
489
|
414 /* Ensure a crash if other code uses the discarded entries afterwards. */
|
|
1204
|
415 htentry *e, *sentinel;
|
|
489
|
416
|
|
|
417 for (e = hentries, sentinel = e + size; e < sentinel; e++)
|
|
1204
|
418 * (unsigned long *) e = 0xdeadbeef; /* -559038737 base 10 */
|
|
489
|
419 #endif
|
|
|
420
|
|
|
421 if (!DUMPEDP (hentries))
|
|
1726
|
422 xfree (hentries, htentry *);
|
|
489
|
423 }
|
|
|
424
|
|
|
425 static void
|
|
428
|
426 finalize_hash_table (void *header, int for_disksave)
|
|
|
427 {
|
|
|
428 if (!for_disksave)
|
|
|
429 {
|
|
|
430 Lisp_Hash_Table *ht = (Lisp_Hash_Table *) header;
|
|
489
|
431 free_hentries (ht->hentries, ht->size);
|
|
428
|
432 ht->hentries = 0;
|
|
|
433 }
|
|
|
434 }
|
|
|
435
|
|
1204
|
436 static const struct memory_description htentry_description_1[] = {
|
|
|
437 { XD_LISP_OBJECT, offsetof (htentry, key) },
|
|
|
438 { XD_LISP_OBJECT, offsetof (htentry, value) },
|
|
428
|
439 { XD_END }
|
|
|
440 };
|
|
|
441
|
|
1204
|
442 static const struct sized_memory_description htentry_description = {
|
|
|
443 sizeof (htentry),
|
|
|
444 htentry_description_1
|
|
428
|
445 };
|
|
|
446
|
|
1204
|
447 static const struct memory_description htentry_union_description_1[] = {
|
|
|
448 /* Note: XD_INDIRECT in this table refers to the surrounding table,
|
|
|
449 and so this will work. */
|
|
|
450 { XD_STRUCT_PTR, HASH_TABLE_NON_WEAK, XD_INDIRECT (0, 1),
|
|
|
451 &htentry_description },
|
|
|
452 { XD_STRUCT_PTR, 0, XD_INDIRECT (0, 1), &htentry_description,
|
|
|
453 XD_FLAG_UNION_DEFAULT_ENTRY | XD_FLAG_NO_KKCC },
|
|
|
454 { XD_END }
|
|
|
455 };
|
|
|
456
|
|
|
457 static const struct sized_memory_description htentry_union_description = {
|
|
|
458 sizeof (htentry *),
|
|
|
459 htentry_union_description_1
|
|
|
460 };
|
|
|
461
|
|
|
462 const struct memory_description hash_table_description[] = {
|
|
|
463 { XD_ELEMCOUNT, offsetof (Lisp_Hash_Table, size) },
|
|
|
464 { XD_INT, offsetof (Lisp_Hash_Table, weakness) },
|
|
|
465 { XD_UNION, offsetof (Lisp_Hash_Table, hentries), XD_INDIRECT (1, 0),
|
|
|
466 &htentry_union_description },
|
|
440
|
467 { XD_LO_LINK, offsetof (Lisp_Hash_Table, next_weak) },
|
|
428
|
468 { XD_END }
|
|
|
469 };
|
|
|
470
|
|
934
|
471 DEFINE_LRECORD_IMPLEMENTATION ("hash-table", hash_table,
|
|
|
472 1, /*dumpable-flag*/
|
|
|
473 mark_hash_table, print_hash_table,
|
|
|
474 finalize_hash_table,
|
|
|
475 hash_table_equal, hash_table_hash,
|
|
|
476 hash_table_description,
|
|
|
477 Lisp_Hash_Table);
|
|
428
|
478
|
|
|
479 static Lisp_Hash_Table *
|
|
|
480 xhash_table (Lisp_Object hash_table)
|
|
|
481 {
|
|
1123
|
482 /* #### What's going on here? Why the gc_in_progress check? */
|
|
428
|
483 if (!gc_in_progress)
|
|
|
484 CHECK_HASH_TABLE (hash_table);
|
|
|
485 check_hash_table_invariants (XHASH_TABLE (hash_table));
|
|
|
486 return XHASH_TABLE (hash_table);
|
|
|
487 }
|
|
|
488
|
|
|
489
|
|
|
490 /************************************************************************/
|
|
|
491 /* Creation of Hash Tables */
|
|
|
492 /************************************************************************/
|
|
|
493
|
|
|
494 /* Creation of hash tables, without error-checking. */
|
|
|
495 static void
|
|
|
496 compute_hash_table_derived_values (Lisp_Hash_Table *ht)
|
|
|
497 {
|
|
665
|
498 ht->rehash_count = (Elemcount)
|
|
438
|
499 ((double) ht->size * ht->rehash_threshold);
|
|
665
|
500 ht->golden_ratio = (Elemcount)
|
|
428
|
501 ((double) ht->size * (.6180339887 / (double) sizeof (Lisp_Object)));
|
|
|
502 }
|
|
|
503
|
|
|
504 Lisp_Object
|
|
450
|
505 make_standard_lisp_hash_table (enum hash_table_test test,
|
|
665
|
506 Elemcount size,
|
|
450
|
507 double rehash_size,
|
|
|
508 double rehash_threshold,
|
|
|
509 enum hash_table_weakness weakness)
|
|
|
510 {
|
|
462
|
511 hash_table_hash_function_t hash_function = 0;
|
|
450
|
512 hash_table_test_function_t test_function = 0;
|
|
|
513
|
|
|
514 switch (test)
|
|
|
515 {
|
|
|
516 case HASH_TABLE_EQ:
|
|
|
517 test_function = 0;
|
|
|
518 hash_function = 0;
|
|
|
519 break;
|
|
|
520
|
|
|
521 case HASH_TABLE_EQL:
|
|
|
522 test_function = lisp_object_eql_equal;
|
|
|
523 hash_function = lisp_object_eql_hash;
|
|
|
524 break;
|
|
|
525
|
|
|
526 case HASH_TABLE_EQUAL:
|
|
|
527 test_function = lisp_object_equal_equal;
|
|
|
528 hash_function = lisp_object_equal_hash;
|
|
|
529 break;
|
|
|
530
|
|
|
531 default:
|
|
|
532 abort ();
|
|
|
533 }
|
|
|
534
|
|
|
535 return make_general_lisp_hash_table (hash_function, test_function,
|
|
|
536 size, rehash_size, rehash_threshold,
|
|
|
537 weakness);
|
|
|
538 }
|
|
|
539
|
|
|
540 Lisp_Object
|
|
|
541 make_general_lisp_hash_table (hash_table_hash_function_t hash_function,
|
|
|
542 hash_table_test_function_t test_function,
|
|
665
|
543 Elemcount size,
|
|
428
|
544 double rehash_size,
|
|
|
545 double rehash_threshold,
|
|
|
546 enum hash_table_weakness weakness)
|
|
|
547 {
|
|
|
548 Lisp_Object hash_table;
|
|
|
549 Lisp_Hash_Table *ht = alloc_lcrecord_type (Lisp_Hash_Table, &lrecord_hash_table);
|
|
|
550
|
|
450
|
551 ht->test_function = test_function;
|
|
|
552 ht->hash_function = hash_function;
|
|
438
|
553 ht->weakness = weakness;
|
|
|
554
|
|
|
555 ht->rehash_size =
|
|
|
556 rehash_size > 1.0 ? rehash_size : HASH_TABLE_DEFAULT_REHASH_SIZE;
|
|
|
557
|
|
|
558 ht->rehash_threshold =
|
|
|
559 rehash_threshold > 0.0 ? rehash_threshold :
|
|
|
560 size > 4096 && !ht->test_function ? 0.7 : 0.6;
|
|
|
561
|
|
428
|
562 if (size < HASH_TABLE_MIN_SIZE)
|
|
|
563 size = HASH_TABLE_MIN_SIZE;
|
|
665
|
564 ht->size = hash_table_size ((Elemcount) (((double) size / ht->rehash_threshold)
|
|
438
|
565 + 1.0));
|
|
428
|
566 ht->count = 0;
|
|
438
|
567
|
|
428
|
568 compute_hash_table_derived_values (ht);
|
|
|
569
|
|
1204
|
570 /* We leave room for one never-occupied sentinel htentry at the end. */
|
|
|
571 ht->hentries = xnew_array_and_zero (htentry, ht->size + 1);
|
|
428
|
572
|
|
793
|
573 hash_table = wrap_hash_table (ht);
|
|
428
|
574
|
|
|
575 if (weakness == HASH_TABLE_NON_WEAK)
|
|
|
576 ht->next_weak = Qunbound;
|
|
|
577 else
|
|
|
578 ht->next_weak = Vall_weak_hash_tables, Vall_weak_hash_tables = hash_table;
|
|
|
579
|
|
|
580 return hash_table;
|
|
|
581 }
|
|
|
582
|
|
|
583 Lisp_Object
|
|
665
|
584 make_lisp_hash_table (Elemcount size,
|
|
428
|
585 enum hash_table_weakness weakness,
|
|
|
586 enum hash_table_test test)
|
|
|
587 {
|
|
450
|
588 return make_standard_lisp_hash_table (test, size, -1.0, -1.0, weakness);
|
|
428
|
589 }
|
|
|
590
|
|
|
591 /* Pretty reading of hash tables.
|
|
|
592
|
|
|
593 Here we use the existing structures mechanism (which is,
|
|
|
594 unfortunately, pretty cumbersome) for validating and instantiating
|
|
|
595 the hash tables. The idea is that the side-effect of reading a
|
|
|
596 #s(hash-table PLIST) object is creation of a hash table with desired
|
|
|
597 properties, and that the hash table is returned. */
|
|
|
598
|
|
|
599 /* Validation functions: each keyword provides its own validation
|
|
|
600 function. The errors should maybe be continuable, but it is
|
|
|
601 unclear how this would cope with ERRB. */
|
|
|
602 static int
|
|
2286
|
603 hash_table_size_validate (Lisp_Object UNUSED (keyword), Lisp_Object value,
|
|
|
604 Error_Behavior errb)
|
|
428
|
605 {
|
|
|
606 if (NATNUMP (value))
|
|
|
607 return 1;
|
|
|
608
|
|
563
|
609 maybe_signal_error_1 (Qwrong_type_argument, list2 (Qnatnump, value),
|
|
2286
|
610 Qhash_table, errb);
|
|
428
|
611 return 0;
|
|
|
612 }
|
|
|
613
|
|
665
|
614 static Elemcount
|
|
428
|
615 decode_hash_table_size (Lisp_Object obj)
|
|
|
616 {
|
|
|
617 return NILP (obj) ? HASH_TABLE_DEFAULT_SIZE : XINT (obj);
|
|
|
618 }
|
|
|
619
|
|
|
620 static int
|
|
2286
|
621 hash_table_weakness_validate (Lisp_Object UNUSED (keyword), Lisp_Object value,
|
|
578
|
622 Error_Behavior errb)
|
|
428
|
623 {
|
|
442
|
624 if (EQ (value, Qnil)) return 1;
|
|
|
625 if (EQ (value, Qt)) return 1;
|
|
|
626 if (EQ (value, Qkey)) return 1;
|
|
|
627 if (EQ (value, Qkey_and_value)) return 1;
|
|
|
628 if (EQ (value, Qkey_or_value)) return 1;
|
|
|
629 if (EQ (value, Qvalue)) return 1;
|
|
428
|
630
|
|
|
631 /* Following values are obsolete as of 19990901 in xemacs-21.2 */
|
|
442
|
632 if (EQ (value, Qnon_weak)) return 1;
|
|
|
633 if (EQ (value, Qweak)) return 1;
|
|
|
634 if (EQ (value, Qkey_weak)) return 1;
|
|
|
635 if (EQ (value, Qkey_or_value_weak)) return 1;
|
|
|
636 if (EQ (value, Qvalue_weak)) return 1;
|
|
428
|
637
|
|
563
|
638 maybe_invalid_constant ("Invalid hash table weakness",
|
|
428
|
639 value, Qhash_table, errb);
|
|
|
640 return 0;
|
|
|
641 }
|
|
|
642
|
|
|
643 static enum hash_table_weakness
|
|
|
644 decode_hash_table_weakness (Lisp_Object obj)
|
|
|
645 {
|
|
442
|
646 if (EQ (obj, Qnil)) return HASH_TABLE_NON_WEAK;
|
|
|
647 if (EQ (obj, Qt)) return HASH_TABLE_WEAK;
|
|
|
648 if (EQ (obj, Qkey_and_value)) return HASH_TABLE_WEAK;
|
|
|
649 if (EQ (obj, Qkey)) return HASH_TABLE_KEY_WEAK;
|
|
|
650 if (EQ (obj, Qkey_or_value)) return HASH_TABLE_KEY_VALUE_WEAK;
|
|
|
651 if (EQ (obj, Qvalue)) return HASH_TABLE_VALUE_WEAK;
|
|
428
|
652
|
|
|
653 /* Following values are obsolete as of 19990901 in xemacs-21.2 */
|
|
442
|
654 if (EQ (obj, Qnon_weak)) return HASH_TABLE_NON_WEAK;
|
|
|
655 if (EQ (obj, Qweak)) return HASH_TABLE_WEAK;
|
|
|
656 if (EQ (obj, Qkey_weak)) return HASH_TABLE_KEY_WEAK;
|
|
|
657 if (EQ (obj, Qkey_or_value_weak)) return HASH_TABLE_KEY_VALUE_WEAK;
|
|
|
658 if (EQ (obj, Qvalue_weak)) return HASH_TABLE_VALUE_WEAK;
|
|
428
|
659
|
|
563
|
660 invalid_constant ("Invalid hash table weakness", obj);
|
|
1204
|
661 RETURN_NOT_REACHED (HASH_TABLE_NON_WEAK);
|
|
428
|
662 }
|
|
|
663
|
|
|
664 static int
|
|
2286
|
665 hash_table_test_validate (Lisp_Object UNUSED (keyword), Lisp_Object value,
|
|
|
666 Error_Behavior errb)
|
|
428
|
667 {
|
|
|
668 if (EQ (value, Qnil)) return 1;
|
|
|
669 if (EQ (value, Qeq)) return 1;
|
|
|
670 if (EQ (value, Qequal)) return 1;
|
|
|
671 if (EQ (value, Qeql)) return 1;
|
|
|
672
|
|
563
|
673 maybe_invalid_constant ("Invalid hash table test",
|
|
2286
|
674 value, Qhash_table, errb);
|
|
428
|
675 return 0;
|
|
|
676 }
|
|
|
677
|
|
|
678 static enum hash_table_test
|
|
|
679 decode_hash_table_test (Lisp_Object obj)
|
|
|
680 {
|
|
|
681 if (EQ (obj, Qnil)) return HASH_TABLE_EQL;
|
|
|
682 if (EQ (obj, Qeq)) return HASH_TABLE_EQ;
|
|
|
683 if (EQ (obj, Qequal)) return HASH_TABLE_EQUAL;
|
|
|
684 if (EQ (obj, Qeql)) return HASH_TABLE_EQL;
|
|
|
685
|
|
563
|
686 invalid_constant ("Invalid hash table test", obj);
|
|
1204
|
687 RETURN_NOT_REACHED (HASH_TABLE_EQ);
|
|
428
|
688 }
|
|
|
689
|
|
|
690 static int
|
|
2286
|
691 hash_table_rehash_size_validate (Lisp_Object UNUSED (keyword),
|
|
|
692 Lisp_Object value, Error_Behavior errb)
|
|
428
|
693 {
|
|
|
694 if (!FLOATP (value))
|
|
|
695 {
|
|
563
|
696 maybe_signal_error_1 (Qwrong_type_argument, list2 (Qfloatp, value),
|
|
428
|
697 Qhash_table, errb);
|
|
|
698 return 0;
|
|
|
699 }
|
|
|
700
|
|
|
701 {
|
|
|
702 double rehash_size = XFLOAT_DATA (value);
|
|
|
703 if (rehash_size <= 1.0)
|
|
|
704 {
|
|
563
|
705 maybe_invalid_argument
|
|
428
|
706 ("Hash table rehash size must be greater than 1.0",
|
|
|
707 value, Qhash_table, errb);
|
|
|
708 return 0;
|
|
|
709 }
|
|
|
710 }
|
|
|
711
|
|
|
712 return 1;
|
|
|
713 }
|
|
|
714
|
|
|
715 static double
|
|
|
716 decode_hash_table_rehash_size (Lisp_Object rehash_size)
|
|
|
717 {
|
|
|
718 return NILP (rehash_size) ? -1.0 : XFLOAT_DATA (rehash_size);
|
|
|
719 }
|
|
|
720
|
|
|
721 static int
|
|
2286
|
722 hash_table_rehash_threshold_validate (Lisp_Object UNUSED (keyword),
|
|
|
723 Lisp_Object value, Error_Behavior errb)
|
|
428
|
724 {
|
|
|
725 if (!FLOATP (value))
|
|
|
726 {
|
|
563
|
727 maybe_signal_error_1 (Qwrong_type_argument, list2 (Qfloatp, value),
|
|
428
|
728 Qhash_table, errb);
|
|
|
729 return 0;
|
|
|
730 }
|
|
|
731
|
|
|
732 {
|
|
|
733 double rehash_threshold = XFLOAT_DATA (value);
|
|
|
734 if (rehash_threshold <= 0.0 || rehash_threshold >= 1.0)
|
|
|
735 {
|
|
563
|
736 maybe_invalid_argument
|
|
428
|
737 ("Hash table rehash threshold must be between 0.0 and 1.0",
|
|
|
738 value, Qhash_table, errb);
|
|
|
739 return 0;
|
|
|
740 }
|
|
|
741 }
|
|
|
742
|
|
|
743 return 1;
|
|
|
744 }
|
|
|
745
|
|
|
746 static double
|
|
|
747 decode_hash_table_rehash_threshold (Lisp_Object rehash_threshold)
|
|
|
748 {
|
|
|
749 return NILP (rehash_threshold) ? -1.0 : XFLOAT_DATA (rehash_threshold);
|
|
|
750 }
|
|
|
751
|
|
|
752 static int
|
|
2286
|
753 hash_table_data_validate (Lisp_Object UNUSED (keyword), Lisp_Object value,
|
|
|
754 Error_Behavior errb)
|
|
428
|
755 {
|
|
|
756 int len;
|
|
|
757
|
|
|
758 GET_EXTERNAL_LIST_LENGTH (value, len);
|
|
|
759
|
|
|
760 if (len & 1)
|
|
|
761 {
|
|
563
|
762 maybe_sferror
|
|
428
|
763 ("Hash table data must have alternating key/value pairs",
|
|
|
764 value, Qhash_table, errb);
|
|
|
765 return 0;
|
|
|
766 }
|
|
|
767 return 1;
|
|
|
768 }
|
|
|
769
|
|
|
770 /* The actual instantiation of a hash table. This does practically no
|
|
|
771 error checking, because it relies on the fact that the paranoid
|
|
|
772 functions above have error-checked everything to the last details.
|
|
|
773 If this assumption is wrong, we will get a crash immediately (with
|
|
|
774 error-checking compiled in), and we'll know if there is a bug in
|
|
|
775 the structure mechanism. So there. */
|
|
|
776 static Lisp_Object
|
|
|
777 hash_table_instantiate (Lisp_Object plist)
|
|
|
778 {
|
|
|
779 Lisp_Object hash_table;
|
|
|
780 Lisp_Object test = Qnil;
|
|
|
781 Lisp_Object size = Qnil;
|
|
|
782 Lisp_Object rehash_size = Qnil;
|
|
|
783 Lisp_Object rehash_threshold = Qnil;
|
|
|
784 Lisp_Object weakness = Qnil;
|
|
|
785 Lisp_Object data = Qnil;
|
|
|
786
|
|
|
787 while (!NILP (plist))
|
|
|
788 {
|
|
|
789 Lisp_Object key, value;
|
|
|
790 key = XCAR (plist); plist = XCDR (plist);
|
|
|
791 value = XCAR (plist); plist = XCDR (plist);
|
|
|
792
|
|
|
793 if (EQ (key, Qtest)) test = value;
|
|
|
794 else if (EQ (key, Qsize)) size = value;
|
|
|
795 else if (EQ (key, Qrehash_size)) rehash_size = value;
|
|
|
796 else if (EQ (key, Qrehash_threshold)) rehash_threshold = value;
|
|
|
797 else if (EQ (key, Qweakness)) weakness = value;
|
|
|
798 else if (EQ (key, Qdata)) data = value;
|
|
|
799 else if (EQ (key, Qtype))/*obsolete*/ weakness = value;
|
|
|
800 else
|
|
|
801 abort ();
|
|
|
802 }
|
|
|
803
|
|
|
804 /* Create the hash table. */
|
|
450
|
805 hash_table = make_standard_lisp_hash_table
|
|
428
|
806 (decode_hash_table_test (test),
|
|
|
807 decode_hash_table_size (size),
|
|
|
808 decode_hash_table_rehash_size (rehash_size),
|
|
|
809 decode_hash_table_rehash_threshold (rehash_threshold),
|
|
|
810 decode_hash_table_weakness (weakness));
|
|
|
811
|
|
|
812 /* I'm not sure whether this can GC, but better safe than sorry. */
|
|
|
813 {
|
|
|
814 struct gcpro gcpro1;
|
|
|
815 GCPRO1 (hash_table);
|
|
|
816
|
|
|
817 /* And fill it with data. */
|
|
|
818 while (!NILP (data))
|
|
|
819 {
|
|
|
820 Lisp_Object key, value;
|
|
|
821 key = XCAR (data); data = XCDR (data);
|
|
|
822 value = XCAR (data); data = XCDR (data);
|
|
|
823 Fputhash (key, value, hash_table);
|
|
|
824 }
|
|
|
825 UNGCPRO;
|
|
|
826 }
|
|
|
827
|
|
|
828 return hash_table;
|
|
|
829 }
|
|
|
830
|
|
|
831 static void
|
|
|
832 structure_type_create_hash_table_structure_name (Lisp_Object structure_name)
|
|
|
833 {
|
|
|
834 struct structure_type *st;
|
|
|
835
|
|
|
836 st = define_structure_type (structure_name, 0, hash_table_instantiate);
|
|
|
837 define_structure_type_keyword (st, Qtest, hash_table_test_validate);
|
|
|
838 define_structure_type_keyword (st, Qsize, hash_table_size_validate);
|
|
|
839 define_structure_type_keyword (st, Qrehash_size, hash_table_rehash_size_validate);
|
|
|
840 define_structure_type_keyword (st, Qrehash_threshold, hash_table_rehash_threshold_validate);
|
|
|
841 define_structure_type_keyword (st, Qweakness, hash_table_weakness_validate);
|
|
|
842 define_structure_type_keyword (st, Qdata, hash_table_data_validate);
|
|
|
843
|
|
|
844 /* obsolete as of 19990901 in xemacs-21.2 */
|
|
|
845 define_structure_type_keyword (st, Qtype, hash_table_weakness_validate);
|
|
|
846 }
|
|
|
847
|
|
|
848 /* Create a built-in Lisp structure type named `hash-table'.
|
|
|
849 We make #s(hashtable ...) equivalent to #s(hash-table ...),
|
|
|
850 for backward compatibility.
|
|
|
851 This is called from emacs.c. */
|
|
|
852 void
|
|
|
853 structure_type_create_hash_table (void)
|
|
|
854 {
|
|
|
855 structure_type_create_hash_table_structure_name (Qhash_table);
|
|
|
856 structure_type_create_hash_table_structure_name (Qhashtable); /* compat */
|
|
|
857 }
|
|
|
858
|
|
|
859
|
|
|
860 /************************************************************************/
|
|
|
861 /* Definition of Lisp-visible methods */
|
|
|
862 /************************************************************************/
|
|
|
863
|
|
|
864 DEFUN ("hash-table-p", Fhash_table_p, 1, 1, 0, /*
|
|
|
865 Return t if OBJECT is a hash table, else nil.
|
|
|
866 */
|
|
|
867 (object))
|
|
|
868 {
|
|
|
869 return HASH_TABLEP (object) ? Qt : Qnil;
|
|
|
870 }
|
|
|
871
|
|
|
872 DEFUN ("make-hash-table", Fmake_hash_table, 0, MANY, 0, /*
|
|
|
873 Return a new empty hash table object.
|
|
|
874 Use Common Lisp style keywords to specify hash table properties.
|
|
|
875 (make-hash-table &key test size rehash-size rehash-threshold weakness)
|
|
|
876
|
|
|
877 Keyword :test can be `eq', `eql' (default) or `equal'.
|
|
|
878 Comparison between keys is done using this function.
|
|
|
879 If speed is important, consider using `eq'.
|
|
|
880 When storing strings in the hash table, you will likely need to use `equal'.
|
|
|
881
|
|
|
882 Keyword :size specifies the number of keys likely to be inserted.
|
|
|
883 This number of entries can be inserted without enlarging the hash table.
|
|
|
884
|
|
|
885 Keyword :rehash-size must be a float greater than 1.0, and specifies
|
|
|
886 the factor by which to increase the size of the hash table when enlarging.
|
|
|
887
|
|
|
888 Keyword :rehash-threshold must be a float between 0.0 and 1.0,
|
|
|
889 and specifies the load factor of the hash table which triggers enlarging.
|
|
|
890
|
|
442
|
891 Non-standard keyword :weakness can be `nil' (default), `t', `key-and-value',
|
|
|
892 `key', `value' or `key-or-value'. `t' is an alias for `key-and-value'.
|
|
428
|
893
|
|
442
|
894 A key-and-value-weak hash table, also known as a fully-weak or simply
|
|
|
895 as a weak hash table, is one whose pointers do not count as GC
|
|
|
896 referents: for any key-value pair in the hash table, if the only
|
|
|
897 remaining pointer to either the key or the value is in a weak hash
|
|
|
898 table, then the pair will be removed from the hash table, and the key
|
|
|
899 and value collected. A non-weak hash table (or any other pointer)
|
|
|
900 would prevent the object from being collected.
|
|
428
|
901
|
|
|
902 A key-weak hash table is similar to a fully-weak hash table except that
|
|
|
903 a key-value pair will be removed only if the key remains unmarked
|
|
|
904 outside of weak hash tables. The pair will remain in the hash table if
|
|
|
905 the key is pointed to by something other than a weak hash table, even
|
|
|
906 if the value is not.
|
|
|
907
|
|
|
908 A value-weak hash table is similar to a fully-weak hash table except
|
|
|
909 that a key-value pair will be removed only if the value remains
|
|
|
910 unmarked outside of weak hash tables. The pair will remain in the
|
|
|
911 hash table if the value is pointed to by something other than a weak
|
|
|
912 hash table, even if the key is not.
|
|
442
|
913
|
|
|
914 A key-or-value-weak hash table is similar to a fully-weak hash table except
|
|
|
915 that a key-value pair will be removed only if the value and the key remain
|
|
|
916 unmarked outside of weak hash tables. The pair will remain in the
|
|
|
917 hash table if the value or key are pointed to by something other than a weak
|
|
|
918 hash table, even if the other is not.
|
|
428
|
919 */
|
|
|
920 (int nargs, Lisp_Object *args))
|
|
|
921 {
|
|
|
922 int i = 0;
|
|
|
923 Lisp_Object test = Qnil;
|
|
|
924 Lisp_Object size = Qnil;
|
|
|
925 Lisp_Object rehash_size = Qnil;
|
|
|
926 Lisp_Object rehash_threshold = Qnil;
|
|
|
927 Lisp_Object weakness = Qnil;
|
|
|
928
|
|
|
929 while (i + 1 < nargs)
|
|
|
930 {
|
|
|
931 Lisp_Object keyword = args[i++];
|
|
|
932 Lisp_Object value = args[i++];
|
|
|
933
|
|
|
934 if (EQ (keyword, Q_test)) test = value;
|
|
|
935 else if (EQ (keyword, Q_size)) size = value;
|
|
|
936 else if (EQ (keyword, Q_rehash_size)) rehash_size = value;
|
|
|
937 else if (EQ (keyword, Q_rehash_threshold)) rehash_threshold = value;
|
|
|
938 else if (EQ (keyword, Q_weakness)) weakness = value;
|
|
|
939 else if (EQ (keyword, Q_type))/*obsolete*/ weakness = value;
|
|
563
|
940 else invalid_constant ("Invalid hash table property keyword", keyword);
|
|
428
|
941 }
|
|
|
942
|
|
|
943 if (i < nargs)
|
|
563
|
944 sferror ("Hash table property requires a value", args[i]);
|
|
428
|
945
|
|
|
946 #define VALIDATE_VAR(var) \
|
|
|
947 if (!NILP (var)) hash_table_##var##_validate (Q##var, var, ERROR_ME);
|
|
|
948
|
|
|
949 VALIDATE_VAR (test);
|
|
|
950 VALIDATE_VAR (size);
|
|
|
951 VALIDATE_VAR (rehash_size);
|
|
|
952 VALIDATE_VAR (rehash_threshold);
|
|
|
953 VALIDATE_VAR (weakness);
|
|
|
954
|
|
450
|
955 return make_standard_lisp_hash_table
|
|
428
|
956 (decode_hash_table_test (test),
|
|
|
957 decode_hash_table_size (size),
|
|
|
958 decode_hash_table_rehash_size (rehash_size),
|
|
|
959 decode_hash_table_rehash_threshold (rehash_threshold),
|
|
|
960 decode_hash_table_weakness (weakness));
|
|
|
961 }
|
|
|
962
|
|
|
963 DEFUN ("copy-hash-table", Fcopy_hash_table, 1, 1, 0, /*
|
|
|
964 Return a new hash table containing the same keys and values as HASH-TABLE.
|
|
|
965 The keys and values will not themselves be copied.
|
|
|
966 */
|
|
|
967 (hash_table))
|
|
|
968 {
|
|
442
|
969 const Lisp_Hash_Table *ht_old = xhash_table (hash_table);
|
|
428
|
970 Lisp_Hash_Table *ht = alloc_lcrecord_type (Lisp_Hash_Table, &lrecord_hash_table);
|
|
|
971
|
|
|
972 copy_lcrecord (ht, ht_old);
|
|
|
973
|
|
1204
|
974 ht->hentries = xnew_array (htentry, ht_old->size + 1);
|
|
|
975 memcpy (ht->hentries, ht_old->hentries, (ht_old->size + 1) * sizeof (htentry));
|
|
428
|
976
|
|
793
|
977 hash_table = wrap_hash_table (ht);
|
|
428
|
978
|
|
|
979 if (! EQ (ht->next_weak, Qunbound))
|
|
|
980 {
|
|
|
981 ht->next_weak = Vall_weak_hash_tables;
|
|
|
982 Vall_weak_hash_tables = hash_table;
|
|
|
983 }
|
|
|
984
|
|
|
985 return hash_table;
|
|
|
986 }
|
|
|
987
|
|
|
988 static void
|
|
665
|
989 resize_hash_table (Lisp_Hash_Table *ht, Elemcount new_size)
|
|
428
|
990 {
|
|
1204
|
991 htentry *old_entries, *new_entries, *sentinel, *e;
|
|
665
|
992 Elemcount old_size;
|
|
428
|
993
|
|
|
994 old_size = ht->size;
|
|
|
995 ht->size = new_size;
|
|
|
996
|
|
|
997 old_entries = ht->hentries;
|
|
|
998
|
|
1204
|
999 ht->hentries = xnew_array_and_zero (htentry, new_size + 1);
|
|
428
|
1000 new_entries = ht->hentries;
|
|
|
1001
|
|
|
1002 compute_hash_table_derived_values (ht);
|
|
|
1003
|
|
440
|
1004 for (e = old_entries, sentinel = e + old_size; e < sentinel; e++)
|
|
1204
|
1005 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1006 {
|
|
1204
|
1007 htentry *probe = new_entries + HASHCODE (e->key, ht);
|
|
428
|
1008 LINEAR_PROBING_LOOP (probe, new_entries, new_size)
|
|
|
1009 ;
|
|
|
1010 *probe = *e;
|
|
|
1011 }
|
|
|
1012
|
|
489
|
1013 free_hentries (old_entries, old_size);
|
|
428
|
1014 }
|
|
|
1015
|
|
440
|
1016 /* After a hash table has been saved to disk and later restored by the
|
|
|
1017 portable dumper, it contains the same objects, but their addresses
|
|
665
|
1018 and thus their HASHCODEs have changed. */
|
|
428
|
1019 void
|
|
440
|
1020 pdump_reorganize_hash_table (Lisp_Object hash_table)
|
|
428
|
1021 {
|
|
442
|
1022 const Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
1204
|
1023 htentry *new_entries = xnew_array_and_zero (htentry, ht->size + 1);
|
|
|
1024 htentry *e, *sentinel;
|
|
440
|
1025
|
|
|
1026 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
1204
|
1027 if (!HTENTRY_CLEAR_P (e))
|
|
440
|
1028 {
|
|
1204
|
1029 htentry *probe = new_entries + HASHCODE (e->key, ht);
|
|
440
|
1030 LINEAR_PROBING_LOOP (probe, new_entries, ht->size)
|
|
|
1031 ;
|
|
|
1032 *probe = *e;
|
|
|
1033 }
|
|
|
1034
|
|
1204
|
1035 memcpy (ht->hentries, new_entries, ht->size * sizeof (htentry));
|
|
440
|
1036
|
|
1726
|
1037 xfree (new_entries, htentry *);
|
|
428
|
1038 }
|
|
|
1039
|
|
|
1040 static void
|
|
|
1041 enlarge_hash_table (Lisp_Hash_Table *ht)
|
|
|
1042 {
|
|
665
|
1043 Elemcount new_size =
|
|
|
1044 hash_table_size ((Elemcount) ((double) ht->size * ht->rehash_size));
|
|
428
|
1045 resize_hash_table (ht, new_size);
|
|
|
1046 }
|
|
|
1047
|
|
1204
|
1048 static htentry *
|
|
|
1049 find_htentry (Lisp_Object key, const Lisp_Hash_Table *ht)
|
|
428
|
1050 {
|
|
|
1051 hash_table_test_function_t test_function = ht->test_function;
|
|
1204
|
1052 htentry *entries = ht->hentries;
|
|
|
1053 htentry *probe = entries + HASHCODE (key, ht);
|
|
428
|
1054
|
|
|
1055 LINEAR_PROBING_LOOP (probe, entries, ht->size)
|
|
|
1056 if (KEYS_EQUAL_P (probe->key, key, test_function))
|
|
|
1057 break;
|
|
|
1058
|
|
|
1059 return probe;
|
|
|
1060 }
|
|
|
1061
|
|
|
1062 DEFUN ("gethash", Fgethash, 2, 3, 0, /*
|
|
|
1063 Find hash value for KEY in HASH-TABLE.
|
|
|
1064 If there is no corresponding value, return DEFAULT (which defaults to nil).
|
|
|
1065 */
|
|
|
1066 (key, hash_table, default_))
|
|
|
1067 {
|
|
442
|
1068 const Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
1204
|
1069 htentry *e = find_htentry (key, ht);
|
|
428
|
1070
|
|
1204
|
1071 return HTENTRY_CLEAR_P (e) ? default_ : e->value;
|
|
428
|
1072 }
|
|
|
1073
|
|
|
1074 DEFUN ("puthash", Fputhash, 3, 3, 0, /*
|
|
|
1075 Hash KEY to VALUE in HASH-TABLE.
|
|
|
1076 */
|
|
|
1077 (key, value, hash_table))
|
|
|
1078 {
|
|
|
1079 Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
1204
|
1080 htentry *e = find_htentry (key, ht);
|
|
428
|
1081
|
|
1204
|
1082 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1083 return e->value = value;
|
|
|
1084
|
|
|
1085 e->key = key;
|
|
|
1086 e->value = value;
|
|
|
1087
|
|
|
1088 if (++ht->count >= ht->rehash_count)
|
|
|
1089 enlarge_hash_table (ht);
|
|
|
1090
|
|
|
1091 return value;
|
|
|
1092 }
|
|
|
1093
|
|
1204
|
1094 /* Remove htentry pointed at by PROBE.
|
|
428
|
1095 Subsequent entries are removed and reinserted.
|
|
|
1096 We don't use tombstones - too wasteful. */
|
|
|
1097 static void
|
|
1204
|
1098 remhash_1 (Lisp_Hash_Table *ht, htentry *entries, htentry *probe)
|
|
428
|
1099 {
|
|
665
|
1100 Elemcount size = ht->size;
|
|
1204
|
1101 CLEAR_HTENTRY (probe);
|
|
428
|
1102 probe++;
|
|
|
1103 ht->count--;
|
|
|
1104
|
|
|
1105 LINEAR_PROBING_LOOP (probe, entries, size)
|
|
|
1106 {
|
|
|
1107 Lisp_Object key = probe->key;
|
|
1204
|
1108 htentry *probe2 = entries + HASHCODE (key, ht);
|
|
428
|
1109 LINEAR_PROBING_LOOP (probe2, entries, size)
|
|
|
1110 if (EQ (probe2->key, key))
|
|
1204
|
1111 /* htentry at probe doesn't need to move. */
|
|
428
|
1112 goto continue_outer_loop;
|
|
1204
|
1113 /* Move htentry from probe to new home at probe2. */
|
|
428
|
1114 *probe2 = *probe;
|
|
1204
|
1115 CLEAR_HTENTRY (probe);
|
|
428
|
1116 continue_outer_loop: continue;
|
|
|
1117 }
|
|
|
1118 }
|
|
|
1119
|
|
|
1120 DEFUN ("remhash", Fremhash, 2, 2, 0, /*
|
|
|
1121 Remove the entry for KEY from HASH-TABLE.
|
|
|
1122 Do nothing if there is no entry for KEY in HASH-TABLE.
|
|
617
|
1123 Return non-nil if an entry was removed.
|
|
428
|
1124 */
|
|
|
1125 (key, hash_table))
|
|
|
1126 {
|
|
|
1127 Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
1204
|
1128 htentry *e = find_htentry (key, ht);
|
|
428
|
1129
|
|
1204
|
1130 if (HTENTRY_CLEAR_P (e))
|
|
428
|
1131 return Qnil;
|
|
|
1132
|
|
|
1133 remhash_1 (ht, ht->hentries, e);
|
|
|
1134 return Qt;
|
|
|
1135 }
|
|
|
1136
|
|
|
1137 DEFUN ("clrhash", Fclrhash, 1, 1, 0, /*
|
|
|
1138 Remove all entries from HASH-TABLE, leaving it empty.
|
|
|
1139 */
|
|
|
1140 (hash_table))
|
|
|
1141 {
|
|
|
1142 Lisp_Hash_Table *ht = xhash_table (hash_table);
|
|
1204
|
1143 htentry *e, *sentinel;
|
|
428
|
1144
|
|
|
1145 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
1204
|
1146 CLEAR_HTENTRY (e);
|
|
428
|
1147 ht->count = 0;
|
|
|
1148
|
|
|
1149 return hash_table;
|
|
|
1150 }
|
|
|
1151
|
|
|
1152 /************************************************************************/
|
|
|
1153 /* Accessor Functions */
|
|
|
1154 /************************************************************************/
|
|
|
1155
|
|
|
1156 DEFUN ("hash-table-count", Fhash_table_count, 1, 1, 0, /*
|
|
|
1157 Return the number of entries in HASH-TABLE.
|
|
|
1158 */
|
|
|
1159 (hash_table))
|
|
|
1160 {
|
|
|
1161 return make_int (xhash_table (hash_table)->count);
|
|
|
1162 }
|
|
|
1163
|
|
|
1164 DEFUN ("hash-table-test", Fhash_table_test, 1, 1, 0, /*
|
|
|
1165 Return the test function of HASH-TABLE.
|
|
|
1166 This can be one of `eq', `eql' or `equal'.
|
|
|
1167 */
|
|
|
1168 (hash_table))
|
|
|
1169 {
|
|
|
1170 hash_table_test_function_t fun = xhash_table (hash_table)->test_function;
|
|
|
1171
|
|
|
1172 return (fun == lisp_object_eql_equal ? Qeql :
|
|
|
1173 fun == lisp_object_equal_equal ? Qequal :
|
|
|
1174 Qeq);
|
|
|
1175 }
|
|
|
1176
|
|
|
1177 DEFUN ("hash-table-size", Fhash_table_size, 1, 1, 0, /*
|
|
|
1178 Return the size of HASH-TABLE.
|
|
|
1179 This is the current number of slots in HASH-TABLE, whether occupied or not.
|
|
|
1180 */
|
|
|
1181 (hash_table))
|
|
|
1182 {
|
|
|
1183 return make_int (xhash_table (hash_table)->size);
|
|
|
1184 }
|
|
|
1185
|
|
|
1186 DEFUN ("hash-table-rehash-size", Fhash_table_rehash_size, 1, 1, 0, /*
|
|
|
1187 Return the current rehash size of HASH-TABLE.
|
|
|
1188 This is a float greater than 1.0; the factor by which HASH-TABLE
|
|
|
1189 is enlarged when the rehash threshold is exceeded.
|
|
|
1190 */
|
|
|
1191 (hash_table))
|
|
|
1192 {
|
|
|
1193 return make_float (xhash_table (hash_table)->rehash_size);
|
|
|
1194 }
|
|
|
1195
|
|
|
1196 DEFUN ("hash-table-rehash-threshold", Fhash_table_rehash_threshold, 1, 1, 0, /*
|
|
|
1197 Return the current rehash threshold of HASH-TABLE.
|
|
|
1198 This is a float between 0.0 and 1.0; the maximum `load factor' of HASH-TABLE,
|
|
|
1199 beyond which the HASH-TABLE is enlarged by rehashing.
|
|
|
1200 */
|
|
|
1201 (hash_table))
|
|
|
1202 {
|
|
438
|
1203 return make_float (xhash_table (hash_table)->rehash_threshold);
|
|
428
|
1204 }
|
|
|
1205
|
|
|
1206 DEFUN ("hash-table-weakness", Fhash_table_weakness, 1, 1, 0, /*
|
|
|
1207 Return the weakness of HASH-TABLE.
|
|
442
|
1208 This can be one of `nil', `key-and-value', `key-or-value', `key' or `value'.
|
|
428
|
1209 */
|
|
|
1210 (hash_table))
|
|
|
1211 {
|
|
|
1212 switch (xhash_table (hash_table)->weakness)
|
|
|
1213 {
|
|
442
|
1214 case HASH_TABLE_WEAK: return Qkey_and_value;
|
|
|
1215 case HASH_TABLE_KEY_WEAK: return Qkey;
|
|
|
1216 case HASH_TABLE_KEY_VALUE_WEAK: return Qkey_or_value;
|
|
|
1217 case HASH_TABLE_VALUE_WEAK: return Qvalue;
|
|
|
1218 default: return Qnil;
|
|
428
|
1219 }
|
|
|
1220 }
|
|
|
1221
|
|
|
1222 /* obsolete as of 19990901 in xemacs-21.2 */
|
|
|
1223 DEFUN ("hash-table-type", Fhash_table_type, 1, 1, 0, /*
|
|
|
1224 Return the type of HASH-TABLE.
|
|
|
1225 This can be one of `non-weak', `weak', `key-weak' or `value-weak'.
|
|
|
1226 */
|
|
|
1227 (hash_table))
|
|
|
1228 {
|
|
|
1229 switch (xhash_table (hash_table)->weakness)
|
|
|
1230 {
|
|
442
|
1231 case HASH_TABLE_WEAK: return Qweak;
|
|
|
1232 case HASH_TABLE_KEY_WEAK: return Qkey_weak;
|
|
|
1233 case HASH_TABLE_KEY_VALUE_WEAK: return Qkey_or_value_weak;
|
|
|
1234 case HASH_TABLE_VALUE_WEAK: return Qvalue_weak;
|
|
|
1235 default: return Qnon_weak;
|
|
428
|
1236 }
|
|
|
1237 }
|
|
|
1238
|
|
|
1239 /************************************************************************/
|
|
|
1240 /* Mapping Functions */
|
|
|
1241 /************************************************************************/
|
|
489
|
1242
|
|
|
1243 /* We need to be careful when mapping over hash tables because the
|
|
|
1244 hash table might be modified during the mapping operation:
|
|
|
1245 - by the mapping function
|
|
|
1246 - by gc (if the hash table is weak)
|
|
|
1247
|
|
|
1248 So we make a copy of the hentries at the beginning of the mapping
|
|
497
|
1249 operation, and iterate over the copy. Naturally, this is
|
|
|
1250 expensive, but not as expensive as you might think, because no
|
|
|
1251 actual memory has to be collected by our notoriously inefficient
|
|
|
1252 GC; we use an unwind-protect instead to free the memory directly.
|
|
|
1253
|
|
|
1254 We could avoid the copying by having the hash table modifiers
|
|
|
1255 puthash and remhash check for currently active mapping functions.
|
|
|
1256 Disadvantages: it's hard to get right, and IMO hash mapping
|
|
|
1257 functions are basically rare, and no extra space in the hash table
|
|
|
1258 object and no extra cpu in puthash or remhash should be wasted to
|
|
|
1259 make maphash 3% faster. From a design point of view, the basic
|
|
|
1260 functions gethash, puthash and remhash should be implementable
|
|
|
1261 without having to think about maphash.
|
|
|
1262
|
|
|
1263 Note: We don't (yet) have Common Lisp's with-hash-table-iterator.
|
|
|
1264 If you implement this naively, you cannot have more than one
|
|
|
1265 concurrently active iterator over the same hash table. The `each'
|
|
|
1266 function in perl has this limitation.
|
|
|
1267
|
|
|
1268 Note: We GCPRO memory on the heap, not on the stack. There is no
|
|
|
1269 obvious reason why this is bad, but as of this writing this is the
|
|
|
1270 only known occurrence of this technique in the code.
|
|
504
|
1271
|
|
|
1272 -- Martin
|
|
|
1273 */
|
|
|
1274
|
|
|
1275 /* Ben disagrees with the "copying hentries" design, and says:
|
|
|
1276
|
|
|
1277 Another solution is the same as I've already proposed -- when
|
|
|
1278 mapping, mark the table as "change-unsafe", and in this case, use a
|
|
|
1279 secondary table to maintain changes. this could be basically a
|
|
|
1280 standard hash table, but with entries only for added or deleted
|
|
|
1281 entries in the primary table, and a marker like Qunbound to
|
|
|
1282 indicate a deleted entry. puthash, gethash and remhash need a
|
|
|
1283 single extra check for this secondary table -- totally
|
|
|
1284 insignificant speedwise. if you really cared about making
|
|
|
1285 recursive maphashes completely correct, you'd have to do a bit of
|
|
|
1286 extra work here -- when maphashing, if the secondary table exists,
|
|
|
1287 make a copy of it, and use the copy in conjunction with the primary
|
|
|
1288 table when mapping. the advantages of this are
|
|
|
1289
|
|
|
1290 [a] easy to demonstrate correct, even with weak hashtables.
|
|
|
1291
|
|
|
1292 [b] no extra overhead in the general maphash case -- only when you
|
|
|
1293 modify the table while maphashing, and even then the overhead is
|
|
|
1294 very small.
|
|
497
|
1295 */
|
|
|
1296
|
|
489
|
1297 static Lisp_Object
|
|
|
1298 maphash_unwind (Lisp_Object unwind_obj)
|
|
|
1299 {
|
|
|
1300 void *ptr = (void *) get_opaque_ptr (unwind_obj);
|
|
1726
|
1301 xfree (ptr, void *);
|
|
489
|
1302 free_opaque_ptr (unwind_obj);
|
|
|
1303 return Qnil;
|
|
|
1304 }
|
|
|
1305
|
|
|
1306 /* Return a malloced array of alternating key/value pairs from HT. */
|
|
|
1307 static Lisp_Object *
|
|
|
1308 copy_compress_hentries (const Lisp_Hash_Table *ht)
|
|
|
1309 {
|
|
|
1310 Lisp_Object * const objs =
|
|
|
1311 /* If the hash table is empty, ht->count could be 0. */
|
|
|
1312 xnew_array (Lisp_Object, 2 * (ht->count > 0 ? ht->count : 1));
|
|
1204
|
1313 const htentry *e, *sentinel;
|
|
489
|
1314 Lisp_Object *pobj;
|
|
|
1315
|
|
|
1316 for (e = ht->hentries, sentinel = e + ht->size, pobj = objs; e < sentinel; e++)
|
|
1204
|
1317 if (!HTENTRY_CLEAR_P (e))
|
|
489
|
1318 {
|
|
|
1319 *(pobj++) = e->key;
|
|
|
1320 *(pobj++) = e->value;
|
|
|
1321 }
|
|
|
1322
|
|
|
1323 type_checking_assert (pobj == objs + 2 * ht->count);
|
|
|
1324
|
|
|
1325 return objs;
|
|
|
1326 }
|
|
|
1327
|
|
428
|
1328 DEFUN ("maphash", Fmaphash, 2, 2, 0, /*
|
|
|
1329 Map FUNCTION over entries in HASH-TABLE, calling it with two args,
|
|
|
1330 each key and value in HASH-TABLE.
|
|
|
1331
|
|
489
|
1332 FUNCTION must not modify HASH-TABLE, with the one exception that FUNCTION
|
|
428
|
1333 may remhash or puthash the entry currently being processed by FUNCTION.
|
|
|
1334 */
|
|
|
1335 (function, hash_table))
|
|
|
1336 {
|
|
489
|
1337 const Lisp_Hash_Table * const ht = xhash_table (hash_table);
|
|
|
1338 Lisp_Object * const objs = copy_compress_hentries (ht);
|
|
|
1339 Lisp_Object args[3];
|
|
|
1340 const Lisp_Object *pobj, *end;
|
|
|
1341 int speccount = specpdl_depth ();
|
|
|
1342 struct gcpro gcpro1;
|
|
|
1343
|
|
|
1344 record_unwind_protect (maphash_unwind, make_opaque_ptr ((void *)objs));
|
|
|
1345 GCPRO1 (objs[0]);
|
|
|
1346 gcpro1.nvars = 2 * ht->count;
|
|
428
|
1347
|
|
489
|
1348 args[0] = function;
|
|
|
1349
|
|
|
1350 for (pobj = objs, end = pobj + 2 * ht->count; pobj < end; pobj += 2)
|
|
|
1351 {
|
|
|
1352 args[1] = pobj[0];
|
|
|
1353 args[2] = pobj[1];
|
|
|
1354 Ffuncall (countof (args), args);
|
|
|
1355 }
|
|
|
1356
|
|
771
|
1357 unbind_to (speccount);
|
|
489
|
1358 UNGCPRO;
|
|
428
|
1359
|
|
|
1360 return Qnil;
|
|
|
1361 }
|
|
|
1362
|
|
489
|
1363 /* Map *C* function FUNCTION over the elements of a non-weak lisp hash table.
|
|
|
1364 FUNCTION must not modify HASH-TABLE, with the one exception that FUNCTION
|
|
|
1365 may puthash the entry currently being processed by FUNCTION.
|
|
|
1366 Mapping terminates if FUNCTION returns something other than 0. */
|
|
428
|
1367 void
|
|
489
|
1368 elisp_maphash_unsafe (maphash_function_t function,
|
|
428
|
1369 Lisp_Object hash_table, void *extra_arg)
|
|
|
1370 {
|
|
442
|
1371 const Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
1204
|
1372 const htentry *e, *sentinel;
|
|
428
|
1373
|
|
|
1374 for (e = ht->hentries, sentinel = e + ht->size; e < sentinel; e++)
|
|
1204
|
1375 if (!HTENTRY_CLEAR_P (e))
|
|
489
|
1376 if (function (e->key, e->value, extra_arg))
|
|
|
1377 return;
|
|
428
|
1378 }
|
|
|
1379
|
|
489
|
1380 /* Map *C* function FUNCTION over the elements of a lisp hash table.
|
|
|
1381 It is safe for FUNCTION to modify HASH-TABLE.
|
|
|
1382 Mapping terminates if FUNCTION returns something other than 0. */
|
|
|
1383 void
|
|
|
1384 elisp_maphash (maphash_function_t function,
|
|
|
1385 Lisp_Object hash_table, void *extra_arg)
|
|
|
1386 {
|
|
|
1387 const Lisp_Hash_Table * const ht = xhash_table (hash_table);
|
|
|
1388 Lisp_Object * const objs = copy_compress_hentries (ht);
|
|
|
1389 const Lisp_Object *pobj, *end;
|
|
|
1390 int speccount = specpdl_depth ();
|
|
|
1391 struct gcpro gcpro1;
|
|
|
1392
|
|
|
1393 record_unwind_protect (maphash_unwind, make_opaque_ptr ((void *)objs));
|
|
|
1394 GCPRO1 (objs[0]);
|
|
|
1395 gcpro1.nvars = 2 * ht->count;
|
|
|
1396
|
|
|
1397 for (pobj = objs, end = pobj + 2 * ht->count; pobj < end; pobj += 2)
|
|
|
1398 if (function (pobj[0], pobj[1], extra_arg))
|
|
|
1399 break;
|
|
|
1400
|
|
771
|
1401 unbind_to (speccount);
|
|
489
|
1402 UNGCPRO;
|
|
|
1403 }
|
|
|
1404
|
|
|
1405 /* Remove all elements of a lisp hash table satisfying *C* predicate PREDICATE.
|
|
|
1406 PREDICATE must not modify HASH-TABLE. */
|
|
428
|
1407 void
|
|
|
1408 elisp_map_remhash (maphash_function_t predicate,
|
|
|
1409 Lisp_Object hash_table, void *extra_arg)
|
|
|
1410 {
|
|
489
|
1411 const Lisp_Hash_Table * const ht = xhash_table (hash_table);
|
|
|
1412 Lisp_Object * const objs = copy_compress_hentries (ht);
|
|
|
1413 const Lisp_Object *pobj, *end;
|
|
|
1414 int speccount = specpdl_depth ();
|
|
|
1415 struct gcpro gcpro1;
|
|
428
|
1416
|
|
489
|
1417 record_unwind_protect (maphash_unwind, make_opaque_ptr ((void *)objs));
|
|
|
1418 GCPRO1 (objs[0]);
|
|
|
1419 gcpro1.nvars = 2 * ht->count;
|
|
|
1420
|
|
|
1421 for (pobj = objs, end = pobj + 2 * ht->count; pobj < end; pobj += 2)
|
|
|
1422 if (predicate (pobj[0], pobj[1], extra_arg))
|
|
|
1423 Fremhash (pobj[0], hash_table);
|
|
|
1424
|
|
771
|
1425 unbind_to (speccount);
|
|
489
|
1426 UNGCPRO;
|
|
428
|
1427 }
|
|
|
1428
|
|
|
1429
|
|
|
1430 /************************************************************************/
|
|
|
1431 /* garbage collecting weak hash tables */
|
|
|
1432 /************************************************************************/
|
|
1598
|
1433 #ifdef USE_KKCC
|
|
|
1434 #define MARK_OBJ(obj) do { \
|
|
|
1435 Lisp_Object mo_obj = (obj); \
|
|
|
1436 if (!marked_p (mo_obj)) \
|
|
|
1437 { \
|
|
|
1438 kkcc_gc_stack_push_lisp_object (mo_obj); \
|
|
|
1439 did_mark = 1; \
|
|
|
1440 } \
|
|
|
1441 } while (0)
|
|
|
1442
|
|
|
1443 #else /* NO USE_KKCC */
|
|
|
1444
|
|
442
|
1445 #define MARK_OBJ(obj) do { \
|
|
|
1446 Lisp_Object mo_obj = (obj); \
|
|
|
1447 if (!marked_p (mo_obj)) \
|
|
|
1448 { \
|
|
|
1449 mark_object (mo_obj); \
|
|
|
1450 did_mark = 1; \
|
|
|
1451 } \
|
|
|
1452 } while (0)
|
|
1598
|
1453 #endif /*NO USE_KKCC */
|
|
442
|
1454
|
|
428
|
1455
|
|
|
1456 /* Complete the marking for semi-weak hash tables. */
|
|
|
1457 int
|
|
|
1458 finish_marking_weak_hash_tables (void)
|
|
|
1459 {
|
|
|
1460 Lisp_Object hash_table;
|
|
|
1461 int did_mark = 0;
|
|
|
1462
|
|
|
1463 for (hash_table = Vall_weak_hash_tables;
|
|
|
1464 !NILP (hash_table);
|
|
|
1465 hash_table = XHASH_TABLE (hash_table)->next_weak)
|
|
|
1466 {
|
|
442
|
1467 const Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
1204
|
1468 const htentry *e = ht->hentries;
|
|
|
1469 const htentry *sentinel = e + ht->size;
|
|
428
|
1470
|
|
|
1471 if (! marked_p (hash_table))
|
|
|
1472 /* The hash table is probably garbage. Ignore it. */
|
|
|
1473 continue;
|
|
|
1474
|
|
|
1475 /* Now, scan over all the pairs. For all pairs that are
|
|
|
1476 half-marked, we may need to mark the other half if we're
|
|
|
1477 keeping this pair. */
|
|
|
1478 switch (ht->weakness)
|
|
|
1479 {
|
|
|
1480 case HASH_TABLE_KEY_WEAK:
|
|
|
1481 for (; e < sentinel; e++)
|
|
1204
|
1482 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1483 if (marked_p (e->key))
|
|
|
1484 MARK_OBJ (e->value);
|
|
|
1485 break;
|
|
|
1486
|
|
|
1487 case HASH_TABLE_VALUE_WEAK:
|
|
|
1488 for (; e < sentinel; e++)
|
|
1204
|
1489 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1490 if (marked_p (e->value))
|
|
|
1491 MARK_OBJ (e->key);
|
|
|
1492 break;
|
|
|
1493
|
|
442
|
1494 case HASH_TABLE_KEY_VALUE_WEAK:
|
|
|
1495 for (; e < sentinel; e++)
|
|
1204
|
1496 if (!HTENTRY_CLEAR_P (e))
|
|
442
|
1497 {
|
|
|
1498 if (marked_p (e->value))
|
|
|
1499 MARK_OBJ (e->key);
|
|
|
1500 else if (marked_p (e->key))
|
|
|
1501 MARK_OBJ (e->value);
|
|
|
1502 }
|
|
|
1503 break;
|
|
|
1504
|
|
428
|
1505 case HASH_TABLE_KEY_CAR_WEAK:
|
|
|
1506 for (; e < sentinel; e++)
|
|
1204
|
1507 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1508 if (!CONSP (e->key) || marked_p (XCAR (e->key)))
|
|
|
1509 {
|
|
|
1510 MARK_OBJ (e->key);
|
|
|
1511 MARK_OBJ (e->value);
|
|
|
1512 }
|
|
|
1513 break;
|
|
|
1514
|
|
450
|
1515 /* We seem to be sprouting new weakness types at an alarming
|
|
|
1516 rate. At least this is not externally visible - and in
|
|
|
1517 fact all of these KEY_CAR_* types are only used by the
|
|
|
1518 glyph code. */
|
|
|
1519 case HASH_TABLE_KEY_CAR_VALUE_WEAK:
|
|
|
1520 for (; e < sentinel; e++)
|
|
1204
|
1521 if (!HTENTRY_CLEAR_P (e))
|
|
450
|
1522 {
|
|
|
1523 if (!CONSP (e->key) || marked_p (XCAR (e->key)))
|
|
|
1524 {
|
|
|
1525 MARK_OBJ (e->key);
|
|
|
1526 MARK_OBJ (e->value);
|
|
|
1527 }
|
|
|
1528 else if (marked_p (e->value))
|
|
|
1529 MARK_OBJ (e->key);
|
|
|
1530 }
|
|
|
1531 break;
|
|
|
1532
|
|
428
|
1533 case HASH_TABLE_VALUE_CAR_WEAK:
|
|
|
1534 for (; e < sentinel; e++)
|
|
1204
|
1535 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1536 if (!CONSP (e->value) || marked_p (XCAR (e->value)))
|
|
|
1537 {
|
|
|
1538 MARK_OBJ (e->key);
|
|
|
1539 MARK_OBJ (e->value);
|
|
|
1540 }
|
|
|
1541 break;
|
|
|
1542
|
|
|
1543 default:
|
|
|
1544 break;
|
|
|
1545 }
|
|
|
1546 }
|
|
|
1547
|
|
|
1548 return did_mark;
|
|
|
1549 }
|
|
|
1550
|
|
|
1551 void
|
|
|
1552 prune_weak_hash_tables (void)
|
|
|
1553 {
|
|
|
1554 Lisp_Object hash_table, prev = Qnil;
|
|
|
1555 for (hash_table = Vall_weak_hash_tables;
|
|
|
1556 !NILP (hash_table);
|
|
|
1557 hash_table = XHASH_TABLE (hash_table)->next_weak)
|
|
|
1558 {
|
|
|
1559 if (! marked_p (hash_table))
|
|
|
1560 {
|
|
|
1561 /* This hash table itself is garbage. Remove it from the list. */
|
|
|
1562 if (NILP (prev))
|
|
|
1563 Vall_weak_hash_tables = XHASH_TABLE (hash_table)->next_weak;
|
|
|
1564 else
|
|
|
1565 XHASH_TABLE (prev)->next_weak = XHASH_TABLE (hash_table)->next_weak;
|
|
|
1566 }
|
|
|
1567 else
|
|
|
1568 {
|
|
|
1569 /* Now, scan over all the pairs. Remove all of the pairs
|
|
|
1570 in which the key or value, or both, is unmarked
|
|
|
1571 (depending on the weakness of the hash table). */
|
|
|
1572 Lisp_Hash_Table *ht = XHASH_TABLE (hash_table);
|
|
1204
|
1573 htentry *entries = ht->hentries;
|
|
|
1574 htentry *sentinel = entries + ht->size;
|
|
|
1575 htentry *e;
|
|
428
|
1576
|
|
|
1577 for (e = entries; e < sentinel; e++)
|
|
1204
|
1578 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1579 {
|
|
|
1580 again:
|
|
|
1581 if (!marked_p (e->key) || !marked_p (e->value))
|
|
|
1582 {
|
|
|
1583 remhash_1 (ht, entries, e);
|
|
1204
|
1584 if (!HTENTRY_CLEAR_P (e))
|
|
428
|
1585 goto again;
|
|
|
1586 }
|
|
|
1587 }
|
|
|
1588
|
|
|
1589 prev = hash_table;
|
|
|
1590 }
|
|
|
1591 }
|
|
|
1592 }
|
|
|
1593
|
|
|
1594 /* Return a hash value for an array of Lisp_Objects of size SIZE. */
|
|
|
1595
|
|
665
|
1596 Hashcode
|
|
428
|
1597 internal_array_hash (Lisp_Object *arr, int size, int depth)
|
|
|
1598 {
|
|
|
1599 int i;
|
|
665
|
1600 Hashcode hash = 0;
|
|
442
|
1601 depth++;
|
|
428
|
1602
|
|
|
1603 if (size <= 5)
|
|
|
1604 {
|
|
|
1605 for (i = 0; i < size; i++)
|
|
442
|
1606 hash = HASH2 (hash, internal_hash (arr[i], depth));
|
|
428
|
1607 return hash;
|
|
|
1608 }
|
|
|
1609
|
|
|
1610 /* just pick five elements scattered throughout the array.
|
|
|
1611 A slightly better approach would be to offset by some
|
|
|
1612 noise factor from the points chosen below. */
|
|
|
1613 for (i = 0; i < 5; i++)
|
|
442
|
1614 hash = HASH2 (hash, internal_hash (arr[i*size/5], depth));
|
|
428
|
1615
|
|
|
1616 return hash;
|
|
|
1617 }
|
|
|
1618
|
|
|
1619 /* Return a hash value for a Lisp_Object. This is for use when hashing
|
|
|
1620 objects with the comparison being `equal' (for `eq', you can just
|
|
|
1621 use the Lisp_Object itself as the hash value). You need to make a
|
|
|
1622 tradeoff between the speed of the hash function and how good the
|
|
|
1623 hashing is. In particular, the hash function needs to be FAST,
|
|
|
1624 so you can't just traipse down the whole tree hashing everything
|
|
|
1625 together. Most of the time, objects will differ in the first
|
|
|
1626 few elements you hash. Thus, we only go to a short depth (5)
|
|
|
1627 and only hash at most 5 elements out of a vector. Theoretically
|
|
|
1628 we could still take 5^5 time (a big big number) to compute a
|
|
|
1629 hash, but practically this won't ever happen. */
|
|
|
1630
|
|
665
|
1631 Hashcode
|
|
428
|
1632 internal_hash (Lisp_Object obj, int depth)
|
|
|
1633 {
|
|
|
1634 if (depth > 5)
|
|
|
1635 return 0;
|
|
|
1636 if (CONSP (obj))
|
|
|
1637 {
|
|
|
1638 /* no point in worrying about tail recursion, since we're not
|
|
|
1639 going very deep */
|
|
|
1640 return HASH2 (internal_hash (XCAR (obj), depth + 1),
|
|
|
1641 internal_hash (XCDR (obj), depth + 1));
|
|
|
1642 }
|
|
|
1643 if (STRINGP (obj))
|
|
|
1644 {
|
|
|
1645 return hash_string (XSTRING_DATA (obj), XSTRING_LENGTH (obj));
|
|
|
1646 }
|
|
|
1647 if (LRECORDP (obj))
|
|
|
1648 {
|
|
442
|
1649 const struct lrecord_implementation
|
|
428
|
1650 *imp = XRECORD_LHEADER_IMPLEMENTATION (obj);
|
|
|
1651 if (imp->hash)
|
|
|
1652 return imp->hash (obj, depth);
|
|
|
1653 }
|
|
|
1654
|
|
|
1655 return LISP_HASH (obj);
|
|
|
1656 }
|
|
|
1657
|
|
|
1658 DEFUN ("sxhash", Fsxhash, 1, 1, 0, /*
|
|
|
1659 Return a hash value for OBJECT.
|
|
444
|
1660 \(equal obj1 obj2) implies (= (sxhash obj1) (sxhash obj2)).
|
|
428
|
1661 */
|
|
|
1662 (object))
|
|
|
1663 {
|
|
|
1664 return make_int (internal_hash (object, 0));
|
|
|
1665 }
|
|
|
1666
|
|
|
1667 #if 0
|
|
826
|
1668 DEFUN ("internal-hash-value", Finternal_hash_value, 1, 1, 0, /*
|
|
428
|
1669 Hash value of OBJECT. For debugging.
|
|
|
1670 The value is returned as (HIGH . LOW).
|
|
|
1671 */
|
|
|
1672 (object))
|
|
|
1673 {
|
|
|
1674 /* This function is pretty 32bit-centric. */
|
|
665
|
1675 Hashcode hash = internal_hash (object, 0);
|
|
428
|
1676 return Fcons (hash >> 16, hash & 0xffff);
|
|
|
1677 }
|
|
|
1678 #endif
|
|
|
1679
|
|
|
1680
|
|
|
1681 /************************************************************************/
|
|
|
1682 /* initialization */
|
|
|
1683 /************************************************************************/
|
|
|
1684
|
|
|
1685 void
|
|
|
1686 syms_of_elhash (void)
|
|
|
1687 {
|
|
|
1688 DEFSUBR (Fhash_table_p);
|
|
|
1689 DEFSUBR (Fmake_hash_table);
|
|
|
1690 DEFSUBR (Fcopy_hash_table);
|
|
|
1691 DEFSUBR (Fgethash);
|
|
|
1692 DEFSUBR (Fremhash);
|
|
|
1693 DEFSUBR (Fputhash);
|
|
|
1694 DEFSUBR (Fclrhash);
|
|
|
1695 DEFSUBR (Fmaphash);
|
|
|
1696 DEFSUBR (Fhash_table_count);
|
|
|
1697 DEFSUBR (Fhash_table_test);
|
|
|
1698 DEFSUBR (Fhash_table_size);
|
|
|
1699 DEFSUBR (Fhash_table_rehash_size);
|
|
|
1700 DEFSUBR (Fhash_table_rehash_threshold);
|
|
|
1701 DEFSUBR (Fhash_table_weakness);
|
|
|
1702 DEFSUBR (Fhash_table_type); /* obsolete */
|
|
|
1703 DEFSUBR (Fsxhash);
|
|
|
1704 #if 0
|
|
|
1705 DEFSUBR (Finternal_hash_value);
|
|
|
1706 #endif
|
|
|
1707
|
|
563
|
1708 DEFSYMBOL_MULTIWORD_PREDICATE (Qhash_tablep);
|
|
|
1709 DEFSYMBOL (Qhash_table);
|
|
|
1710 DEFSYMBOL (Qhashtable);
|
|
|
1711 DEFSYMBOL (Qweakness);
|
|
|
1712 DEFSYMBOL (Qvalue);
|
|
|
1713 DEFSYMBOL (Qkey_or_value);
|
|
|
1714 DEFSYMBOL (Qkey_and_value);
|
|
|
1715 DEFSYMBOL (Qrehash_size);
|
|
|
1716 DEFSYMBOL (Qrehash_threshold);
|
|
428
|
1717
|
|
563
|
1718 DEFSYMBOL (Qweak); /* obsolete */
|
|
|
1719 DEFSYMBOL (Qkey_weak); /* obsolete */
|
|
|
1720 DEFSYMBOL (Qkey_or_value_weak); /* obsolete */
|
|
|
1721 DEFSYMBOL (Qvalue_weak); /* obsolete */
|
|
|
1722 DEFSYMBOL (Qnon_weak); /* obsolete */
|
|
428
|
1723
|
|
563
|
1724 DEFKEYWORD (Q_test);
|
|
|
1725 DEFKEYWORD (Q_size);
|
|
|
1726 DEFKEYWORD (Q_rehash_size);
|
|
|
1727 DEFKEYWORD (Q_rehash_threshold);
|
|
|
1728 DEFKEYWORD (Q_weakness);
|
|
|
1729 DEFKEYWORD (Q_type); /* obsolete */
|
|
428
|
1730 }
|
|
|
1731
|
|
|
1732 void
|
|
771
|
1733 init_elhash_once_early (void)
|
|
428
|
1734 {
|
|
771
|
1735 INIT_LRECORD_IMPLEMENTATION (hash_table);
|
|
|
1736
|
|
428
|
1737 /* This must NOT be staticpro'd */
|
|
|
1738 Vall_weak_hash_tables = Qnil;
|
|
452
|
1739 dump_add_weak_object_chain (&Vall_weak_hash_tables);
|
|
428
|
1740 }
|
