|
0
|
1 /* Lisp interface to hash tables.
|
|
|
2 Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995, 1996 Ben Wing.
|
|
|
4
|
|
|
5 This file is part of XEmacs.
|
|
|
6
|
|
|
7 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
8 under the terms of the GNU General Public License as published by the
|
|
|
9 Free Software Foundation; either version 2, or (at your option) any
|
|
|
10 later version.
|
|
|
11
|
|
|
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
15 for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
|
18 along with XEmacs; see the file COPYING. If not, write to
|
|
|
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
20 Boston, MA 02111-1307, USA. */
|
|
|
21
|
|
|
22 /* Synched up with: Not in FSF. */
|
|
|
23
|
|
|
24 #include <config.h>
|
|
|
25 #include "lisp.h"
|
|
|
26 #include "hash.h"
|
|
|
27 #include "elhash.h"
|
|
|
28 #include "bytecode.h"
|
|
|
29
|
|
|
30 Lisp_Object Qhashtablep;
|
|
|
31
|
|
|
32 #define LISP_OBJECTS_PER_HENTRY (sizeof (hentry) / sizeof (Lisp_Object))/* 2 */
|
|
|
33
|
|
185
|
34 struct hashtable
|
|
0
|
35 {
|
|
|
36 struct lcrecord_header header;
|
|
|
37 unsigned int fullness;
|
|
|
38 unsigned long (*hash_function) (CONST void *);
|
|
|
39 int (*test_function) (CONST void *, CONST void *);
|
|
|
40 Lisp_Object zero_entry;
|
|
|
41 Lisp_Object harray;
|
|
|
42 enum hashtable_type type; /* whether and how this hashtable is weak */
|
|
|
43 Lisp_Object next_weak; /* Used to chain together all of the weak
|
|
|
44 hashtables. Don't mark through this. */
|
|
|
45 };
|
|
|
46
|
|
|
47 static Lisp_Object Vall_weak_hashtables;
|
|
|
48
|
|
|
49 static Lisp_Object mark_hashtable (Lisp_Object, void (*) (Lisp_Object));
|
|
|
50 static void print_hashtable (Lisp_Object, Lisp_Object, int);
|
|
|
51 DEFINE_LRECORD_IMPLEMENTATION ("hashtable", hashtable,
|
|
|
52 mark_hashtable, print_hashtable, 0, 0, 0,
|
|
185
|
53 struct hashtable);
|
|
0
|
54
|
|
|
55 static Lisp_Object
|
|
|
56 mark_hashtable (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
57 {
|
|
185
|
58 struct hashtable *table = XHASHTABLE (obj);
|
|
0
|
59
|
|
|
60 if (table->type != HASHTABLE_NONWEAK)
|
|
|
61 {
|
|
|
62 /* If the table is weak, we don't want to mark the keys and values
|
|
|
63 (we scan over them after everything else has been marked,
|
|
|
64 and mark or remove them as necessary). Note that we will mark
|
|
|
65 the table->harray itself at the same time; it's hard to mark
|
|
|
66 that here without also marking its contents. */
|
|
|
67 return Qnil;
|
|
|
68 }
|
|
|
69 ((markobj) (table->zero_entry));
|
|
173
|
70 return table->harray;
|
|
0
|
71 }
|
|
185
|
72
|
|
0
|
73 static void
|
|
|
74 print_hashtable (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
75 {
|
|
185
|
76 struct hashtable *table = XHASHTABLE (obj);
|
|
0
|
77 char buf[200];
|
|
|
78 if (print_readably)
|
|
|
79 error ("printing unreadable object #<hashtable 0x%x>",
|
|
|
80 table->header.uid);
|
|
|
81 sprintf (buf, GETTEXT ("#<%shashtable %d/%ld 0x%x>"),
|
|
|
82 (table->type == HASHTABLE_WEAK ? "weak " :
|
|
|
83 table->type == HASHTABLE_KEY_WEAK ? "key-weak " :
|
|
|
84 table->type == HASHTABLE_VALUE_WEAK ? "value-weak " :
|
|
|
85 table->type == HASHTABLE_KEY_CAR_WEAK ? "key-car-weak " :
|
|
|
86 table->type == HASHTABLE_VALUE_CAR_WEAK ? "value-car-weak " :
|
|
|
87 ""),
|
|
|
88 table->fullness,
|
|
173
|
89 XVECTOR_LENGTH (table->harray) / LISP_OBJECTS_PER_HENTRY,
|
|
0
|
90 table->header.uid);
|
|
|
91 write_c_string (buf, printcharfun);
|
|
|
92 }
|
|
|
93
|
|
|
94 static void
|
|
185
|
95 ht_copy_to_c (struct hashtable *ht, c_hashtable c_table)
|
|
0
|
96 {
|
|
173
|
97 int len = XVECTOR_LENGTH (ht->harray);
|
|
0
|
98
|
|
185
|
99 c_table->harray = (hentry *) XVECTOR_DATA (ht->harray);
|
|
0
|
100 c_table->zero_set = (!GC_UNBOUNDP (ht->zero_entry));
|
|
|
101 c_table->zero_entry = LISP_TO_VOID (ht->zero_entry);
|
|
|
102 if (len < 0)
|
|
|
103 {
|
|
|
104 /* #### if alloc.c mark_object() changes, this must change too. */
|
|
|
105 /* barf gag retch. When a vector is marked, its len is
|
|
|
106 made less than 0. In the prune_weak_hashtables() stage,
|
|
|
107 we are called on vectors that are like this, and we must
|
|
|
108 be able to deal. */
|
|
|
109 assert (gc_in_progress);
|
|
|
110 len = -1 - len;
|
|
|
111 }
|
|
173
|
112 c_table->size = len/LISP_OBJECTS_PER_HENTRY;
|
|
|
113 c_table->fullness = ht->fullness;
|
|
0
|
114 c_table->hash_function = ht->hash_function;
|
|
|
115 c_table->test_function = ht->test_function;
|
|
|
116 XSETHASHTABLE (c_table->elisp_table, ht);
|
|
|
117 }
|
|
|
118
|
|
|
119 static void
|
|
185
|
120 ht_copy_from_c (c_hashtable c_table, struct hashtable *ht)
|
|
0
|
121 {
|
|
|
122 struct Lisp_Vector dummy;
|
|
|
123 /* C is truly hateful */
|
|
|
124 void *vec_addr
|
|
185
|
125 = ((char *) c_table->harray
|
|
173
|
126 - ((char *) &(dummy.contents[0]) - (char *) &dummy));
|
|
0
|
127
|
|
|
128 XSETVECTOR (ht->harray, vec_addr);
|
|
|
129 if (c_table->zero_set)
|
|
|
130 VOID_TO_LISP (ht->zero_entry, c_table->zero_entry);
|
|
|
131 else
|
|
|
132 ht->zero_entry = Qunbound;
|
|
|
133 ht->fullness = c_table->fullness;
|
|
|
134 }
|
|
|
135
|
|
|
136
|
|
185
|
137 static struct hashtable *
|
|
0
|
138 allocate_hashtable (void)
|
|
|
139 {
|
|
185
|
140 struct hashtable *table =
|
|
|
141 alloc_lcrecord_type (struct hashtable, lrecord_hashtable);
|
|
173
|
142 table->harray = Qnil;
|
|
|
143 table->zero_entry = Qunbound;
|
|
|
144 table->fullness = 0;
|
|
0
|
145 table->hash_function = 0;
|
|
|
146 table->test_function = 0;
|
|
173
|
147 return table;
|
|
0
|
148 }
|
|
|
149
|
|
173
|
150 void *
|
|
0
|
151 elisp_hvector_malloc (unsigned int bytes, Lisp_Object table)
|
|
|
152 {
|
|
|
153 Lisp_Object new_vector;
|
|
185
|
154 struct hashtable *ht = XHASHTABLE (table);
|
|
0
|
155
|
|
173
|
156 assert (bytes > XVECTOR_LENGTH (ht->harray) * sizeof (Lisp_Object));
|
|
0
|
157 new_vector = make_vector ((bytes / sizeof (Lisp_Object)), Qzero);
|
|
173
|
158 return (void *) XVECTOR_DATA (new_vector);
|
|
0
|
159 }
|
|
|
160
|
|
|
161 void
|
|
|
162 elisp_hvector_free (void *ptr, Lisp_Object table)
|
|
|
163 {
|
|
185
|
164 struct hashtable *ht = XHASHTABLE (table);
|
|
0
|
165 #if defined (USE_ASSERTIONS) || defined (DEBUG_XEMACS)
|
|
|
166 Lisp_Object current_vector = ht->harray;
|
|
|
167 #endif
|
|
|
168
|
|
173
|
169 assert (((void *) XVECTOR_DATA (current_vector)) == ptr);
|
|
0
|
170 ht->harray = Qnil; /* Let GC do its job */
|
|
|
171 }
|
|
|
172
|
|
|
173
|
|
20
|
174 DEFUN ("hashtablep", Fhashtablep, 1, 1, 0, /*
|
|
0
|
175 Return t if OBJ is a hashtable, else nil.
|
|
20
|
176 */
|
|
|
177 (obj))
|
|
0
|
178 {
|
|
173
|
179 return HASHTABLEP (obj) ? Qt : Qnil;
|
|
0
|
180 }
|
|
|
181
|
|
|
182
|
|
|
183
|
|
|
184
|
|
|
185 #if 0 /* I don't think these are needed any more.
|
|
|
186 If using the general lisp_object_equal_*() functions
|
|
|
187 causes efficiency problems, these can be resurrected. --ben */
|
|
|
188 /* equality and hash functions for Lisp strings */
|
|
|
189 int
|
|
|
190 lisp_string_equal (CONST void *x1, CONST void *x2)
|
|
|
191 {
|
|
|
192 Lisp_Object str1, str2;
|
|
|
193 CVOID_TO_LISP (str1, x1);
|
|
|
194 CVOID_TO_LISP (str2, x2);
|
|
14
|
195 return !strcmp ((char *) XSTRING_DATA (str1), (char *) XSTRING_DATA (str2));
|
|
0
|
196 }
|
|
|
197
|
|
|
198 unsigned long
|
|
|
199 lisp_string_hash (CONST void *x)
|
|
|
200 {
|
|
|
201 Lisp_Object str;
|
|
|
202 CVOID_TO_LISP (str, x);
|
|
14
|
203 return hash_string (XSTRING_DATA (str), XSTRING_LENGTH (str));
|
|
0
|
204 }
|
|
|
205
|
|
|
206 #endif /* 0 */
|
|
|
207
|
|
|
208 static int
|
|
|
209 lisp_object_eql_equal (CONST void *x1, CONST void *x2)
|
|
|
210 {
|
|
|
211 Lisp_Object obj1, obj2;
|
|
|
212 CVOID_TO_LISP (obj1, x1);
|
|
|
213 CVOID_TO_LISP (obj2, x2);
|
|
|
214 return
|
|
|
215 (FLOATP (obj1) ? !NILP (Fequal (obj1, obj2)) : EQ (obj1, obj2));
|
|
|
216 }
|
|
|
217
|
|
|
218 static unsigned long
|
|
|
219 lisp_object_eql_hash (CONST void *x)
|
|
|
220 {
|
|
|
221 Lisp_Object obj;
|
|
|
222 CVOID_TO_LISP (obj, x);
|
|
|
223 if (FLOATP (obj))
|
|
|
224 return internal_hash (obj, 0);
|
|
|
225 else
|
|
|
226 return LISP_HASH (obj);
|
|
|
227 }
|
|
|
228
|
|
|
229 static int
|
|
|
230 lisp_object_equal_equal (CONST void *x1, CONST void *x2)
|
|
|
231 {
|
|
|
232 Lisp_Object obj1, obj2;
|
|
|
233 CVOID_TO_LISP (obj1, x1);
|
|
|
234 CVOID_TO_LISP (obj2, x2);
|
|
|
235 return !NILP (Fequal (obj1, obj2));
|
|
|
236 }
|
|
|
237
|
|
|
238 static unsigned long
|
|
|
239 lisp_object_equal_hash (CONST void *x)
|
|
|
240 {
|
|
|
241 Lisp_Object obj;
|
|
|
242 CVOID_TO_LISP (obj, x);
|
|
|
243 return internal_hash (obj, 0);
|
|
|
244 }
|
|
|
245
|
|
|
246 Lisp_Object
|
|
|
247 make_lisp_hashtable (int size,
|
|
|
248 enum hashtable_type type,
|
|
|
249 enum hashtable_test_fun test)
|
|
|
250 {
|
|
|
251 Lisp_Object result;
|
|
185
|
252 struct hashtable *table = allocate_hashtable ();
|
|
0
|
253
|
|
|
254 table->harray = make_vector ((compute_harray_size (size)
|
|
|
255 * LISP_OBJECTS_PER_HENTRY),
|
|
|
256 Qzero);
|
|
|
257 switch (test)
|
|
|
258 {
|
|
|
259 case HASHTABLE_EQ:
|
|
|
260 table->test_function = 0;
|
|
|
261 table->hash_function = 0;
|
|
|
262 break;
|
|
|
263
|
|
|
264 case HASHTABLE_EQL:
|
|
|
265 table->test_function = lisp_object_eql_equal;
|
|
|
266 table->hash_function = lisp_object_eql_hash;
|
|
|
267 break;
|
|
|
268
|
|
|
269 case HASHTABLE_EQUAL:
|
|
|
270 table->test_function = lisp_object_equal_equal;
|
|
|
271 table->hash_function = lisp_object_equal_hash;
|
|
|
272 break;
|
|
|
273
|
|
|
274 default:
|
|
|
275 abort ();
|
|
|
276 }
|
|
|
277
|
|
|
278 table->type = type;
|
|
|
279 XSETHASHTABLE (result, table);
|
|
|
280
|
|
|
281 if (table->type != HASHTABLE_NONWEAK)
|
|
|
282 {
|
|
|
283 table->next_weak = Vall_weak_hashtables;
|
|
|
284 Vall_weak_hashtables = result;
|
|
|
285 }
|
|
|
286 else
|
|
|
287 table->next_weak = Qunbound;
|
|
|
288
|
|
173
|
289 return result;
|
|
0
|
290 }
|
|
|
291
|
|
|
292 static enum hashtable_test_fun
|
|
|
293 decode_hashtable_test_fun (Lisp_Object sym)
|
|
|
294 {
|
|
|
295 if (NILP (sym))
|
|
|
296 return HASHTABLE_EQL;
|
|
|
297
|
|
|
298 CHECK_SYMBOL (sym);
|
|
|
299
|
|
2
|
300 if (EQ (sym, Qeq)) return HASHTABLE_EQ;
|
|
|
301 if (EQ (sym, Qequal)) return HASHTABLE_EQUAL;
|
|
|
302 if (EQ (sym, Qeql)) return HASHTABLE_EQL;
|
|
185
|
303
|
|
0
|
304 signal_simple_error ("Invalid hashtable test fun", sym);
|
|
2
|
305 return HASHTABLE_EQ; /* not reached */
|
|
0
|
306 }
|
|
|
307
|
|
20
|
308 DEFUN ("make-hashtable", Fmake_hashtable, 1, 2, 0, /*
|
|
0
|
309 Make a hashtable of initial size SIZE.
|
|
|
310 Comparison between keys is done with TEST-FUN, which must be one of
|
|
|
311 `eq', `eql', or `equal'. The default is `eql'; i.e. two keys must
|
|
|
312 be the same object (or have the same floating-point value, for floats)
|
|
|
313 to be considered equivalent.
|
|
|
314
|
|
|
315 See also `make-weak-hashtable', `make-key-weak-hashtable', and
|
|
|
316 `make-value-weak-hashtable'.
|
|
20
|
317 */
|
|
|
318 (size, test_fun))
|
|
0
|
319 {
|
|
|
320 CHECK_NATNUM (size);
|
|
|
321 return make_lisp_hashtable (XINT (size), HASHTABLE_NONWEAK,
|
|
|
322 decode_hashtable_test_fun (test_fun));
|
|
|
323 }
|
|
|
324
|
|
20
|
325 DEFUN ("copy-hashtable", Fcopy_hashtable, 1, 1, 0, /*
|
|
0
|
326 Make a new hashtable which contains the same keys and values
|
|
|
327 as the given table. The keys and values will not themselves be copied.
|
|
20
|
328 */
|
|
|
329 (old_table))
|
|
0
|
330 {
|
|
|
331 struct _C_hashtable old_htbl;
|
|
|
332 struct _C_hashtable new_htbl;
|
|
185
|
333 struct hashtable *old_ht;
|
|
|
334 struct hashtable *new_ht;
|
|
0
|
335 Lisp_Object result;
|
|
|
336
|
|
|
337 CHECK_HASHTABLE (old_table);
|
|
|
338 old_ht = XHASHTABLE (old_table);
|
|
|
339 ht_copy_to_c (old_ht, &old_htbl);
|
|
|
340
|
|
|
341 /* we can't just call Fmake_hashtable() here because that will make a
|
|
|
342 table that is slightly larger than the one we're trying to copy,
|
|
|
343 which will make copy_hash() blow up. */
|
|
|
344 new_ht = allocate_hashtable ();
|
|
|
345 new_ht->fullness = 0;
|
|
|
346 new_ht->zero_entry = Qunbound;
|
|
|
347 new_ht->hash_function = old_ht->hash_function;
|
|
|
348 new_ht->test_function = old_ht->test_function;
|
|
|
349 new_ht->harray = Fmake_vector (Flength (old_ht->harray), Qzero);
|
|
|
350 ht_copy_to_c (new_ht, &new_htbl);
|
|
|
351 copy_hash (&new_htbl, &old_htbl);
|
|
|
352 ht_copy_from_c (&new_htbl, new_ht);
|
|
|
353 new_ht->type = old_ht->type;
|
|
|
354 XSETHASHTABLE (result, new_ht);
|
|
|
355
|
|
|
356 if (UNBOUNDP (old_ht->next_weak))
|
|
|
357 new_ht->next_weak = Qunbound;
|
|
|
358 else
|
|
|
359 {
|
|
|
360 new_ht->next_weak = Vall_weak_hashtables;
|
|
|
361 Vall_weak_hashtables = result;
|
|
|
362 }
|
|
|
363
|
|
173
|
364 return result;
|
|
0
|
365 }
|
|
|
366
|
|
|
367
|
|
20
|
368 DEFUN ("gethash", Fgethash, 2, 3, 0, /*
|
|
0
|
369 Find hash value for KEY in TABLE.
|
|
|
370 If there is no corresponding value, return DEFAULT (defaults to nil).
|
|
20
|
371 */
|
|
173
|
372 (key, table, default_))
|
|
0
|
373 {
|
|
|
374 CONST void *vval;
|
|
|
375 struct _C_hashtable htbl;
|
|
|
376 if (!gc_in_progress)
|
|
|
377 CHECK_HASHTABLE (table);
|
|
|
378 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
379 if (gethash (LISP_TO_VOID (key), &htbl, &vval))
|
|
|
380 {
|
|
|
381 Lisp_Object val;
|
|
|
382 CVOID_TO_LISP (val, vval);
|
|
|
383 return val;
|
|
|
384 }
|
|
185
|
385 else
|
|
173
|
386 return default_;
|
|
0
|
387 }
|
|
|
388
|
|
|
389
|
|
20
|
390 DEFUN ("remhash", Fremhash, 2, 2, 0, /*
|
|
0
|
391 Remove hash value for KEY in TABLE.
|
|
20
|
392 */
|
|
|
393 (key, table))
|
|
0
|
394 {
|
|
|
395 struct _C_hashtable htbl;
|
|
|
396 CHECK_HASHTABLE (table);
|
|
|
397
|
|
|
398 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
399 remhash (LISP_TO_VOID (key), &htbl);
|
|
|
400 ht_copy_from_c (&htbl, XHASHTABLE (table));
|
|
|
401 return Qnil;
|
|
|
402 }
|
|
|
403
|
|
|
404
|
|
20
|
405 DEFUN ("puthash", Fputhash, 3, 3, 0, /*
|
|
0
|
406 Hash KEY to VAL in TABLE.
|
|
20
|
407 */
|
|
|
408 (key, val, table))
|
|
0
|
409 {
|
|
185
|
410 struct hashtable *ht;
|
|
0
|
411 void *vkey = LISP_TO_VOID (key);
|
|
|
412
|
|
|
413 CHECK_HASHTABLE (table);
|
|
|
414 ht = XHASHTABLE (table);
|
|
|
415 if (!vkey)
|
|
|
416 ht->zero_entry = val;
|
|
|
417 else
|
|
|
418 {
|
|
|
419 struct gcpro gcpro1, gcpro2, gcpro3;
|
|
|
420 struct _C_hashtable htbl;
|
|
|
421
|
|
|
422 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
423 GCPRO3 (key, val, table);
|
|
|
424 puthash (vkey, LISP_TO_VOID (val), &htbl);
|
|
|
425 ht_copy_from_c (&htbl, XHASHTABLE (table));
|
|
|
426 UNGCPRO;
|
|
|
427 }
|
|
173
|
428 return val;
|
|
0
|
429 }
|
|
|
430
|
|
20
|
431 DEFUN ("clrhash", Fclrhash, 1, 1, 0, /*
|
|
0
|
432 Flush TABLE.
|
|
20
|
433 */
|
|
|
434 (table))
|
|
0
|
435 {
|
|
|
436 struct _C_hashtable htbl;
|
|
|
437 CHECK_HASHTABLE (table);
|
|
|
438 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
439 clrhash (&htbl);
|
|
|
440 ht_copy_from_c (&htbl, XHASHTABLE (table));
|
|
|
441 return Qnil;
|
|
|
442 }
|
|
|
443
|
|
20
|
444 DEFUN ("hashtable-fullness", Fhashtable_fullness, 1, 1, 0, /*
|
|
0
|
445 Return number of entries in TABLE.
|
|
20
|
446 */
|
|
|
447 (table))
|
|
0
|
448 {
|
|
|
449 struct _C_hashtable htbl;
|
|
|
450 CHECK_HASHTABLE (table);
|
|
|
451 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
173
|
452 return make_int (htbl.fullness);
|
|
0
|
453 }
|
|
|
454
|
|
|
455
|
|
|
456 static void
|
|
|
457 verify_function (Lisp_Object function, CONST char *description)
|
|
|
458 {
|
|
|
459 if (SYMBOLP (function))
|
|
|
460 {
|
|
|
461 if (NILP (function))
|
|
|
462 return;
|
|
|
463 else
|
|
|
464 function = indirect_function (function, 1);
|
|
|
465 }
|
|
|
466 if (SUBRP (function) || COMPILED_FUNCTIONP (function))
|
|
|
467 return;
|
|
|
468 else if (CONSP (function))
|
|
|
469 {
|
|
|
470 Lisp_Object funcar = Fcar (function);
|
|
185
|
471 if ((SYMBOLP (funcar))
|
|
|
472 && (EQ (funcar, Qlambda)
|
|
0
|
473 || EQ (funcar, Qautoload)))
|
|
|
474 return;
|
|
|
475 }
|
|
|
476 signal_error (Qinvalid_function, list1 (function));
|
|
|
477 }
|
|
|
478
|
|
|
479 static void
|
|
|
480 lisp_maphash_function (CONST void *void_key,
|
|
|
481 void *void_val,
|
|
|
482 void *void_fn)
|
|
|
483 {
|
|
|
484 /* This function can GC */
|
|
|
485 Lisp_Object key, val, fn;
|
|
|
486 CVOID_TO_LISP (key, void_key);
|
|
|
487 VOID_TO_LISP (val, void_val);
|
|
|
488 VOID_TO_LISP (fn, void_fn);
|
|
|
489 call2 (fn, key, val);
|
|
|
490 }
|
|
|
491
|
|
|
492
|
|
20
|
493 DEFUN ("maphash", Fmaphash, 2, 2, 0, /*
|
|
0
|
494 Map FUNCTION over entries in TABLE, calling it with two args,
|
|
|
495 each key and value in the table.
|
|
20
|
496 */
|
|
|
497 (function, table))
|
|
0
|
498 {
|
|
|
499 struct _C_hashtable htbl;
|
|
|
500 struct gcpro gcpro1, gcpro2;
|
|
|
501
|
|
|
502 verify_function (function, GETTEXT ("hashtable mapping function"));
|
|
|
503 CHECK_HASHTABLE (table);
|
|
|
504 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
505 GCPRO2 (table, function);
|
|
|
506 maphash (lisp_maphash_function, &htbl, LISP_TO_VOID (function));
|
|
|
507 UNGCPRO;
|
|
|
508 return Qnil;
|
|
|
509 }
|
|
|
510
|
|
|
511
|
|
|
512 /* This function is for mapping a *C* function over the elements of a
|
|
|
513 lisp hashtable.
|
|
|
514 */
|
|
|
515 void
|
|
|
516 elisp_maphash (maphash_function function, Lisp_Object table, void *closure)
|
|
|
517 {
|
|
|
518 struct _C_hashtable htbl;
|
|
|
519
|
|
|
520 if (!gc_in_progress) CHECK_HASHTABLE (table);
|
|
|
521 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
522 maphash (function, &htbl, closure);
|
|
|
523 }
|
|
|
524
|
|
|
525 void
|
|
|
526 elisp_map_remhash (remhash_predicate function,
|
|
|
527 Lisp_Object table,
|
|
|
528 void *closure)
|
|
|
529 {
|
|
|
530 struct _C_hashtable htbl;
|
|
|
531
|
|
|
532 if (!gc_in_progress) CHECK_HASHTABLE (table);
|
|
|
533 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
534 map_remhash (function, &htbl, closure);
|
|
|
535 ht_copy_from_c (&htbl, XHASHTABLE (table));
|
|
|
536 }
|
|
|
537
|
|
|
538 #if 0
|
|
|
539 void
|
|
|
540 elisp_table_op (Lisp_Object table, generic_hashtable_op op, void *arg1,
|
|
|
541 void *arg2, void *arg3)
|
|
|
542 {
|
|
|
543 struct _C_hashtable htbl;
|
|
|
544 CHECK_HASHTABLE (table);
|
|
|
545 ht_copy_to_c (XHASHTABLE (table), &htbl);
|
|
|
546 (*op) (&htbl, arg1, arg2, arg3);
|
|
|
547 ht_copy_from_c (&htbl, XHASHTABLE (table));
|
|
|
548 }
|
|
|
549 #endif /* 0 */
|
|
|
550
|
|
|
551
|
|
|
552
|
|
20
|
553 DEFUN ("make-weak-hashtable", Fmake_weak_hashtable, 1, 2, 0, /*
|
|
0
|
554 Make a fully weak hashtable of initial size SIZE.
|
|
|
555 A weak hashtable is one whose pointers do not count as GC referents:
|
|
|
556 for any key-value pair in the hashtable, if the only remaining pointer
|
|
|
557 to either the key or the value is in a weak hash table, then the pair
|
|
|
558 will be removed from the table, and the key and value collected. A
|
|
|
559 non-weak hash table (or any other pointer) would prevent the object
|
|
|
560 from being collected.
|
|
|
561
|
|
|
562 You can also create semi-weak hashtables; see `make-key-weak-hashtable'
|
|
|
563 and `make-value-weak-hashtable'.
|
|
20
|
564 */
|
|
|
565 (size, test_fun))
|
|
0
|
566 {
|
|
|
567 CHECK_NATNUM (size);
|
|
|
568 return make_lisp_hashtable (XINT (size), HASHTABLE_WEAK,
|
|
|
569 decode_hashtable_test_fun (test_fun));
|
|
|
570 }
|
|
|
571
|
|
20
|
572 DEFUN ("make-key-weak-hashtable", Fmake_key_weak_hashtable, 1, 2, 0, /*
|
|
0
|
573 Make a key-weak hashtable of initial size SIZE.
|
|
|
574 A key-weak hashtable is similar to a fully-weak hashtable (see
|
|
|
575 `make-weak-hashtable') except that a key-value pair will be removed
|
|
|
576 only if the key remains unmarked outside of weak hashtables. The pair
|
|
|
577 will remain in the hashtable if the key is pointed to by something other
|
|
|
578 than a weak hashtable, even if the value is not.
|
|
20
|
579 */
|
|
|
580 (size, test_fun))
|
|
0
|
581 {
|
|
|
582 CHECK_NATNUM (size);
|
|
|
583 return make_lisp_hashtable (XINT (size), HASHTABLE_KEY_WEAK,
|
|
|
584 decode_hashtable_test_fun (test_fun));
|
|
|
585 }
|
|
|
586
|
|
20
|
587 DEFUN ("make-value-weak-hashtable", Fmake_value_weak_hashtable, 1, 2, 0, /*
|
|
0
|
588 Make a value-weak hashtable of initial size SIZE.
|
|
|
589 A value-weak hashtable is similar to a fully-weak hashtable (see
|
|
|
590 `make-weak-hashtable') except that a key-value pair will be removed only
|
|
|
591 if the value remains unmarked outside of weak hashtables. The pair will
|
|
|
592 remain in the hashtable if the value is pointed to by something other
|
|
|
593 than a weak hashtable, even if the key is not.
|
|
20
|
594 */
|
|
|
595 (size, test_fun))
|
|
0
|
596 {
|
|
|
597 CHECK_NATNUM (size);
|
|
|
598 return make_lisp_hashtable (XINT (size), HASHTABLE_VALUE_WEAK,
|
|
|
599 decode_hashtable_test_fun (test_fun));
|
|
|
600 }
|
|
|
601
|
|
|
602 struct marking_closure
|
|
|
603 {
|
|
|
604 int (*obj_marked_p) (Lisp_Object);
|
|
|
605 void (*markobj) (Lisp_Object);
|
|
|
606 enum hashtable_type type;
|
|
|
607 int did_mark;
|
|
|
608 };
|
|
|
609
|
|
|
610 static void
|
|
|
611 marking_mapper (CONST void *key, void *contents, void *closure)
|
|
|
612 {
|
|
|
613 Lisp_Object keytem, valuetem;
|
|
|
614 struct marking_closure *fmh =
|
|
|
615 (struct marking_closure *) closure;
|
|
|
616
|
|
|
617 /* This function is called over each pair in the hashtable.
|
|
|
618 We complete the marking for semi-weak hashtables. */
|
|
|
619 CVOID_TO_LISP (keytem, key);
|
|
|
620 CVOID_TO_LISP (valuetem, contents);
|
|
185
|
621
|
|
0
|
622 switch (fmh->type)
|
|
|
623 {
|
|
|
624 case HASHTABLE_KEY_WEAK:
|
|
|
625 if ((fmh->obj_marked_p) (keytem) &&
|
|
|
626 !(fmh->obj_marked_p) (valuetem))
|
|
|
627 {
|
|
|
628 (fmh->markobj) (valuetem);
|
|
|
629 fmh->did_mark = 1;
|
|
|
630 }
|
|
|
631 break;
|
|
|
632
|
|
|
633 case HASHTABLE_VALUE_WEAK:
|
|
|
634 if ((fmh->obj_marked_p) (valuetem) &&
|
|
|
635 !(fmh->obj_marked_p) (keytem))
|
|
|
636 {
|
|
|
637 (fmh->markobj) (keytem);
|
|
|
638 fmh->did_mark = 1;
|
|
|
639 }
|
|
|
640 break;
|
|
|
641
|
|
|
642 case HASHTABLE_KEY_CAR_WEAK:
|
|
|
643 if (!CONSP (keytem) || (fmh->obj_marked_p) (XCAR (keytem)))
|
|
|
644 {
|
|
|
645 if (!(fmh->obj_marked_p) (keytem))
|
|
|
646 {
|
|
|
647 (fmh->markobj) (keytem);
|
|
|
648 fmh->did_mark = 1;
|
|
|
649 }
|
|
|
650 if (!(fmh->obj_marked_p) (valuetem))
|
|
|
651 {
|
|
|
652 (fmh->markobj) (valuetem);
|
|
|
653 fmh->did_mark = 1;
|
|
|
654 }
|
|
|
655 }
|
|
|
656 break;
|
|
|
657
|
|
|
658 case HASHTABLE_VALUE_CAR_WEAK:
|
|
|
659 if (!CONSP (valuetem) || (fmh->obj_marked_p) (XCAR (valuetem)))
|
|
|
660 {
|
|
|
661 if (!(fmh->obj_marked_p) (keytem))
|
|
|
662 {
|
|
|
663 (fmh->markobj) (keytem);
|
|
|
664 fmh->did_mark = 1;
|
|
|
665 }
|
|
|
666 if (!(fmh->obj_marked_p) (valuetem))
|
|
|
667 {
|
|
|
668 (fmh->markobj) (valuetem);
|
|
|
669 fmh->did_mark = 1;
|
|
|
670 }
|
|
|
671 }
|
|
|
672 break;
|
|
|
673
|
|
|
674 default:
|
|
|
675 abort (); /* Huh? */
|
|
|
676 }
|
|
185
|
677
|
|
0
|
678 return;
|
|
|
679 }
|
|
|
680
|
|
|
681 int
|
|
|
682 finish_marking_weak_hashtables (int (*obj_marked_p) (Lisp_Object),
|
|
|
683 void (*markobj) (Lisp_Object))
|
|
|
684 {
|
|
|
685 Lisp_Object rest;
|
|
|
686 int did_mark = 0;
|
|
|
687
|
|
|
688 for (rest = Vall_weak_hashtables;
|
|
|
689 !GC_NILP (rest);
|
|
|
690 rest = XHASHTABLE (rest)->next_weak)
|
|
|
691 {
|
|
|
692 enum hashtable_type type;
|
|
|
693
|
|
|
694 if (! ((*obj_marked_p) (rest)))
|
|
|
695 /* The hashtable is probably garbage. Ignore it. */
|
|
|
696 continue;
|
|
|
697 type = XHASHTABLE (rest)->type;
|
|
|
698 if (type == HASHTABLE_KEY_WEAK || type == HASHTABLE_VALUE_WEAK
|
|
|
699 || type == HASHTABLE_KEY_CAR_WEAK
|
|
|
700 || type == HASHTABLE_VALUE_CAR_WEAK)
|
|
|
701 {
|
|
|
702 struct marking_closure fmh;
|
|
|
703
|
|
|
704 fmh.obj_marked_p = obj_marked_p;
|
|
|
705 fmh.markobj = markobj;
|
|
|
706 fmh.type = type;
|
|
|
707 fmh.did_mark = 0;
|
|
|
708 /* Now, scan over all the pairs. For all pairs that are
|
|
|
709 half-marked, we may need to mark the other half if we're
|
|
|
710 keeping this pair. */
|
|
|
711 elisp_maphash (marking_mapper, rest, &fmh);
|
|
|
712 if (fmh.did_mark)
|
|
|
713 did_mark = 1;
|
|
|
714 }
|
|
|
715
|
|
|
716 /* #### If alloc.c mark_object changes, this must change also... */
|
|
|
717 {
|
|
|
718 /* Now mark the vector itself. (We don't need to call markobj
|
|
|
719 here because we know that everything *in* it is already marked,
|
|
|
720 we just need to prevent the vector itself from disappearing.)
|
|
|
721 (The remhash above has taken care of zero_entry.)
|
|
|
722 */
|
|
|
723 struct Lisp_Vector *ptr = XVECTOR (XHASHTABLE (rest)->harray);
|
|
|
724 int len = vector_length (ptr);
|
|
|
725 if (len >= 0)
|
|
|
726 {
|
|
|
727 ptr->size = -1 - len;
|
|
|
728 did_mark = 1;
|
|
|
729 }
|
|
|
730 /* else it's already marked (remember, this function is iterated
|
|
|
731 until marking stops) */
|
|
|
732 }
|
|
|
733 }
|
|
|
734
|
|
|
735 return did_mark;
|
|
|
736 }
|
|
|
737
|
|
|
738 struct pruning_closure
|
|
|
739 {
|
|
|
740 int (*obj_marked_p) (Lisp_Object);
|
|
|
741 };
|
|
|
742
|
|
|
743 static int
|
|
|
744 pruning_mapper (CONST void *key, CONST void *contents, void *closure)
|
|
|
745 {
|
|
|
746 Lisp_Object keytem, valuetem;
|
|
185
|
747 struct pruning_closure *fmh = (struct pruning_closure *) closure;
|
|
0
|
748
|
|
|
749 /* This function is called over each pair in the hashtable.
|
|
|
750 We remove the pairs that aren't completely marked (everything
|
|
|
751 that is going to stay ought to have been marked already
|
|
|
752 by the finish_marking stage). */
|
|
|
753 CVOID_TO_LISP (keytem, key);
|
|
|
754 CVOID_TO_LISP (valuetem, contents);
|
|
|
755
|
|
173
|
756 return ! ((*fmh->obj_marked_p) (keytem) &&
|
|
|
757 (*fmh->obj_marked_p) (valuetem));
|
|
0
|
758 }
|
|
|
759
|
|
|
760 void
|
|
|
761 prune_weak_hashtables (int (*obj_marked_p) (Lisp_Object))
|
|
|
762 {
|
|
|
763 Lisp_Object rest, prev = Qnil;
|
|
|
764 for (rest = Vall_weak_hashtables;
|
|
|
765 !GC_NILP (rest);
|
|
|
766 rest = XHASHTABLE (rest)->next_weak)
|
|
|
767 {
|
|
|
768 if (! ((*obj_marked_p) (rest)))
|
|
|
769 {
|
|
|
770 /* This table itself is garbage. Remove it from the list. */
|
|
|
771 if (GC_NILP (prev))
|
|
|
772 Vall_weak_hashtables = XHASHTABLE (rest)->next_weak;
|
|
|
773 else
|
|
|
774 XHASHTABLE (prev)->next_weak = XHASHTABLE (rest)->next_weak;
|
|
|
775 }
|
|
|
776 else
|
|
|
777 {
|
|
|
778 struct pruning_closure fmh;
|
|
|
779 fmh.obj_marked_p = obj_marked_p;
|
|
|
780 /* Now, scan over all the pairs. Remove all of the pairs
|
|
|
781 in which the key or value, or both, is unmarked
|
|
|
782 (depending on the type of weak hashtable). */
|
|
|
783 elisp_map_remhash (pruning_mapper, rest, &fmh);
|
|
|
784 prev = rest;
|
|
|
785 }
|
|
|
786 }
|
|
|
787 }
|
|
|
788
|
|
|
789 /* Return a hash value for an array of Lisp_Objects of size SIZE. */
|
|
|
790
|
|
|
791 unsigned long
|
|
|
792 internal_array_hash (Lisp_Object *arr, int size, int depth)
|
|
|
793 {
|
|
|
794 int i;
|
|
|
795 unsigned long hash = 0;
|
|
|
796
|
|
|
797 if (size <= 5)
|
|
|
798 {
|
|
|
799 for (i = 0; i < size; i++)
|
|
|
800 hash = HASH2 (hash, internal_hash (arr[i], depth + 1));
|
|
|
801 return hash;
|
|
|
802 }
|
|
185
|
803
|
|
0
|
804 /* just pick five elements scattered throughout the array.
|
|
|
805 A slightly better approach would be to offset by some
|
|
|
806 noise factor from the points chosen below. */
|
|
|
807 for (i = 0; i < 5; i++)
|
|
|
808 hash = HASH2 (hash, internal_hash (arr[i*size/5], depth + 1));
|
|
185
|
809
|
|
0
|
810 return hash;
|
|
|
811 }
|
|
|
812
|
|
|
813 /* Return a hash value for a Lisp_Object. This is for use when hashing
|
|
|
814 objects with the comparison being `equal' (for `eq', you can just
|
|
|
815 use the Lisp_Object itself as the hash value). You need to make a
|
|
|
816 tradeoff between the speed of the hash function and how good the
|
|
|
817 hashing is. In particular, the hash function needs to be FAST,
|
|
|
818 so you can't just traipse down the whole tree hashing everything
|
|
|
819 together. Most of the time, objects will differ in the first
|
|
|
820 few elements you hash. Thus, we only go to a short depth (5)
|
|
|
821 and only hash at most 5 elements out of a vector. Theoretically
|
|
|
822 we could still take 5^5 time (a big big number) to compute a
|
|
|
823 hash, but practically this won't ever happen. */
|
|
|
824
|
|
|
825 unsigned long
|
|
|
826 internal_hash (Lisp_Object obj, int depth)
|
|
|
827 {
|
|
|
828 if (depth > 5)
|
|
|
829 return 0;
|
|
|
830 if (CONSP (obj))
|
|
|
831 {
|
|
|
832 /* no point in worrying about tail recursion, since we're not
|
|
|
833 going very deep */
|
|
|
834 return HASH2 (internal_hash (XCAR (obj), depth + 1),
|
|
|
835 internal_hash (XCDR (obj), depth + 1));
|
|
|
836 }
|
|
|
837 else if (STRINGP (obj))
|
|
14
|
838 return hash_string (XSTRING_DATA (obj), XSTRING_LENGTH (obj));
|
|
0
|
839 #ifndef LRECORD_VECTOR
|
|
|
840 else if (VECTORP (obj))
|
|
|
841 {
|
|
|
842 struct Lisp_Vector *v = XVECTOR (obj);
|
|
|
843 return HASH2 (vector_length (v),
|
|
|
844 internal_array_hash (v->contents, vector_length (v),
|
|
|
845 depth + 1));
|
|
|
846 }
|
|
|
847 #endif /* !LRECORD_VECTOR */
|
|
|
848 else if (LRECORDP (obj))
|
|
|
849 {
|
|
|
850 CONST struct lrecord_implementation
|
|
|
851 *imp = XRECORD_LHEADER (obj)->implementation;
|
|
|
852 if (imp->hash)
|
|
173
|
853 return (imp->hash) (obj, depth);
|
|
0
|
854 }
|
|
|
855
|
|
|
856 return LISP_HASH (obj);
|
|
|
857 }
|
|
|
858
|
|
|
859
|
|
|
860 /************************************************************************/
|
|
|
861 /* initialization */
|
|
|
862 /************************************************************************/
|
|
|
863
|
|
|
864 void
|
|
|
865 syms_of_elhash (void)
|
|
|
866 {
|
|
20
|
867 DEFSUBR (Fmake_hashtable);
|
|
|
868 DEFSUBR (Fcopy_hashtable);
|
|
|
869 DEFSUBR (Fhashtablep);
|
|
|
870 DEFSUBR (Fgethash);
|
|
|
871 DEFSUBR (Fputhash);
|
|
|
872 DEFSUBR (Fremhash);
|
|
|
873 DEFSUBR (Fclrhash);
|
|
|
874 DEFSUBR (Fmaphash);
|
|
|
875 DEFSUBR (Fhashtable_fullness);
|
|
|
876 DEFSUBR (Fmake_weak_hashtable);
|
|
|
877 DEFSUBR (Fmake_key_weak_hashtable);
|
|
|
878 DEFSUBR (Fmake_value_weak_hashtable);
|
|
0
|
879 defsymbol (&Qhashtablep, "hashtablep");
|
|
|
880 }
|
|
|
881
|
|
|
882 void
|
|
|
883 vars_of_elhash (void)
|
|
|
884 {
|
|
2
|
885 /* This must NOT be staticpro'd */
|
|
0
|
886 Vall_weak_hashtables = Qnil;
|
|
|
887 }
|
