Mercurial > hg > xemacs-beta
annotate src/hash.c @ 665:fdefd0186b75
[xemacs-hg @ 2001-09-20 06:28:42 by ben]
The great integral types renaming.
The purpose of this is to rationalize the names used for various
integral types, so that they match their intended uses and follow
consist conventions, and eliminate types that were not semantically
different from each other.
The conventions are:
-- All integral types that measure quantities of anything are
signed. Some people disagree vociferously with this, but their
arguments are mostly theoretical, and are vastly outweighed by
the practical headaches of mixing signed and unsigned values,
and more importantly by the far increased likelihood of
inadvertent bugs: Because of the broken "viral" nature of
unsigned quantities in C (operations involving mixed
signed/unsigned are done unsigned, when exactly the opposite is
nearly always wanted), even a single error in declaring a
quantity unsigned that should be signed, or even the even more
subtle error of comparing signed and unsigned values and
forgetting the necessary cast, can be catastrophic, as
comparisons will yield wrong results. -Wsign-compare is turned
on specifically to catch this, but this tends to result in a
great number of warnings when mixing signed and unsigned, and
the casts are annoying. More has been written on this
elsewhere.
-- All such quantity types just mentioned boil down to EMACS_INT,
which is 32 bits on 32-bit machines and 64 bits on 64-bit
machines. This is guaranteed to be the same size as Lisp
objects of type `int', and (as far as I can tell) of size_t
(unsigned!) and ssize_t. The only type below that is not an
EMACS_INT is Hashcode, which is an unsigned value of the same
size as EMACS_INT.
-- Type names should be relatively short (no more than 10
characters or so), with the first letter capitalized and no
underscores if they can at all be avoided.
-- "count" == a zero-based measurement of some quantity. Includes
sizes, offsets, and indexes.
-- "bpos" == a one-based measurement of a position in a buffer.
"Charbpos" and "Bytebpos" count text in the buffer, rather than
bytes in memory; thus Bytebpos does not directly correspond to
the memory representation. Use "Membpos" for this.
-- "Char" refers to internal-format characters, not to the C type
"char", which is really a byte.
-- For the actual name changes, see the script below.
I ran the following script to do the conversion. (NOTE: This script
is idempotent. You can safely run it multiple times and it will
not screw up previous results -- in fact, it will do nothing if
nothing has changed. Thus, it can be run repeatedly as necessary
to handle patches coming in from old workspaces, or old branches.)
There are two tags, just before and just after the change:
`pre-integral-type-rename' and `post-integral-type-rename'. When
merging code from the main trunk into a branch, the best thing to
do is first merge up to `pre-integral-type-rename', then apply the
script and associated changes, then merge from
`post-integral-type-change' to the present. (Alternatively, just do
the merging in one operation; but you may then have a lot of
conflicts needing to be resolved by hand.)
Script `fixtypes.sh' follows:
----------------------------------- cut ------------------------------------
files="*.[ch] s/*.h m/*.h config.h.in ../configure.in Makefile.in.in ../lib-src/*.[ch] ../lwlib/*.[ch]"
gr Memory_Count Bytecount $files
gr Lstream_Data_Count Bytecount $files
gr Element_Count Elemcount $files
gr Hash_Code Hashcode $files
gr extcount bytecount $files
gr bufpos charbpos $files
gr bytind bytebpos $files
gr memind membpos $files
gr bufbyte intbyte $files
gr Extcount Bytecount $files
gr Bufpos Charbpos $files
gr Bytind Bytebpos $files
gr Memind Membpos $files
gr Bufbyte Intbyte $files
gr EXTCOUNT BYTECOUNT $files
gr BUFPOS CHARBPOS $files
gr BYTIND BYTEBPOS $files
gr MEMIND MEMBPOS $files
gr BUFBYTE INTBYTE $files
gr MEMORY_COUNT BYTECOUNT $files
gr LSTREAM_DATA_COUNT BYTECOUNT $files
gr ELEMENT_COUNT ELEMCOUNT $files
gr HASH_CODE HASHCODE $files
----------------------------------- cut ------------------------------------
`fixtypes.sh' is a Bourne-shell script; it uses 'gr':
----------------------------------- cut ------------------------------------
#!/bin/sh
# Usage is like this:
# gr FROM TO FILES ...
# globally replace FROM with TO in FILES. FROM and TO are regular expressions.
# backup files are stored in the `backup' directory.
from="$1"
to="$2"
shift 2
echo ${1+"$@"} | xargs global-replace "s/$from/$to/g"
----------------------------------- cut ------------------------------------
`gr' in turn uses a Perl script to do its real work,
`global-replace', which follows:
----------------------------------- cut ------------------------------------
: #-*- Perl -*-
### global-modify --- modify the contents of a file by a Perl expression
## Copyright (C) 1999 Martin Buchholz.
## Copyright (C) 2001 Ben Wing.
## Authors: Martin Buchholz <martin@xemacs.org>, Ben Wing <ben@xemacs.org>
## Maintainer: Ben Wing <ben@xemacs.org>
## Current Version: 1.0, May 5, 2001
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2, or (at your option)
# any later version.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with XEmacs; see the file COPYING. If not, write to the Free
# Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
# 02111-1307, USA.
eval 'exec perl -w -S $0 ${1+"$@"}'
if 0;
use strict;
use FileHandle;
use Carp;
use Getopt::Long;
use File::Basename;
(my $myName = $0) =~ s@.*/@@; my $usage="
Usage: $myName [--help] [--backup-dir=DIR] [--line-mode] [--hunk-mode]
PERLEXPR FILE ...
Globally modify a file, either line by line or in one big hunk.
Typical usage is like this:
[with GNU print, GNU xargs: guaranteed to handle spaces, quotes, etc.
in file names]
find . -name '*.[ch]' -print0 | xargs -0 $0 's/\bCONST\b/const/g'\n
[with non-GNU print, xargs]
find . -name '*.[ch]' -print | xargs $0 's/\bCONST\b/const/g'\n
The file is read in, either line by line (with --line-mode specified)
or in one big hunk (with --hunk-mode specified; it's the default), and
the Perl expression is then evalled with \$_ set to the line or hunk of
text, including the terminating newline if there is one. It should
destructively modify the value there, storing the changed result in \$_.
Files in which any modifications are made are backed up to the directory
specified using --backup-dir, or to `backup' by default. To disable this,
use --backup-dir= with no argument.
Hunk mode is the default because it is MUCH MUCH faster than line-by-line.
Use line-by-line only when it matters, e.g. you want to do a replacement
only once per line (the default without the `g' argument). Conversely,
when using hunk mode, *ALWAYS* use `g'; otherwise, you will only make one
replacement in the entire file!
";
my %options = ();
$Getopt::Long::ignorecase = 0;
&GetOptions (
\%options,
'help', 'backup-dir=s', 'line-mode', 'hunk-mode',
);
die $usage if $options{"help"} or @ARGV <= 1;
my $code = shift;
die $usage if grep (-d || ! -w, @ARGV);
sub SafeOpen {
open ((my $fh = new FileHandle), $_[0]);
confess "Can't open $_[0]: $!" if ! defined $fh;
return $fh;
}
sub SafeClose {
close $_[0] or confess "Can't close $_[0]: $!";
}
sub FileContents {
my $fh = SafeOpen ("< $_[0]");
my $olddollarslash = $/;
local $/ = undef;
my $contents = <$fh>;
$/ = $olddollarslash;
return $contents;
}
sub WriteStringToFile {
my $fh = SafeOpen ("> $_[0]");
binmode $fh;
print $fh $_[1] or confess "$_[0]: $!\n";
SafeClose $fh;
}
foreach my $file (@ARGV) {
my $changed_p = 0;
my $new_contents = "";
if ($options{"line-mode"}) {
my $fh = SafeOpen $file;
while (<$fh>) {
my $save_line = $_;
eval $code;
$changed_p = 1 if $save_line ne $_;
$new_contents .= $_;
}
} else {
my $orig_contents = $_ = FileContents $file;
eval $code;
if ($_ ne $orig_contents) {
$changed_p = 1;
$new_contents = $_;
}
}
if ($changed_p) {
my $backdir = $options{"backup-dir"};
$backdir = "backup" if !defined ($backdir);
if ($backdir) {
my ($name, $path, $suffix) = fileparse ($file, "");
my $backfulldir = $path . $backdir;
my $backfile = "$backfulldir/$name";
mkdir $backfulldir, 0755 unless -d $backfulldir;
print "modifying $file (original saved in $backfile)\n";
rename $file, $backfile;
}
WriteStringToFile ($file, $new_contents);
}
}
----------------------------------- cut ------------------------------------
In addition to those programs, I needed to fix up a few other
things, particularly relating to the duplicate definitions of
types, now that some types merged with others. Specifically:
1. in lisp.h, removed duplicate declarations of Bytecount. The
changed code should now look like this: (In each code snippet
below, the first and last lines are the same as the original, as
are all lines outside of those lines. That allows you to locate
the section to be replaced, and replace the stuff in that
section, verifying that there isn't anything new added that
would need to be kept.)
--------------------------------- snip -------------------------------------
/* Counts of bytes or chars */
typedef EMACS_INT Bytecount;
typedef EMACS_INT Charcount;
/* Counts of elements */
typedef EMACS_INT Elemcount;
/* Hash codes */
typedef unsigned long Hashcode;
/* ------------------------ dynamic arrays ------------------- */
--------------------------------- snip -------------------------------------
2. in lstream.h, removed duplicate declaration of Bytecount.
Rewrote the comment about this type. The changed code should
now look like this:
--------------------------------- snip -------------------------------------
#endif
/* The have been some arguments over the what the type should be that
specifies a count of bytes in a data block to be written out or read in,
using Lstream_read(), Lstream_write(), and related functions.
Originally it was long, which worked fine; Martin "corrected" these to
size_t and ssize_t on the grounds that this is theoretically cleaner and
is in keeping with the C standards. Unfortunately, this practice is
horribly error-prone due to design flaws in the way that mixed
signed/unsigned arithmetic happens. In fact, by doing this change,
Martin introduced a subtle but fatal error that caused the operation of
sending large mail messages to the SMTP server under Windows to fail.
By putting all values back to be signed, avoiding any signed/unsigned
mixing, the bug immediately went away. The type then in use was
Lstream_Data_Count, so that it be reverted cleanly if a vote came to
that. Now it is Bytecount.
Some earlier comments about why the type must be signed: This MUST BE
SIGNED, since it also is used in functions that return the number of
bytes actually read to or written from in an operation, and these
functions can return -1 to signal error.
Note that the standard Unix read() and write() functions define the
count going in as a size_t, which is UNSIGNED, and the count going
out as an ssize_t, which is SIGNED. This is a horrible design
flaw. Not only is it highly likely to lead to logic errors when a
-1 gets interpreted as a large positive number, but operations are
bound to fail in all sorts of horrible ways when a number in the
upper-half of the size_t range is passed in -- this number is
unrepresentable as an ssize_t, so code that checks to see how many
bytes are actually written (which is mandatory if you are dealing
with certain types of devices) will get completely screwed up.
--ben
*/
typedef enum lstream_buffering
--------------------------------- snip -------------------------------------
3. in dumper.c, there are four places, all inside of switch()
statements, where XD_BYTECOUNT appears twice as a case tag. In
each case, the two case blocks contain identical code, and you
should *REMOVE THE SECOND* and leave the first.
author | ben |
---|---|
date | Thu, 20 Sep 2001 06:31:11 +0000 |
parents | b39c14581166 |
children | e22b0213b713 |
rev | line source |
---|---|
428 | 1 /* Hash tables. |
2 Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc. | |
3 | |
4 This file is part of XEmacs. | |
5 | |
6 XEmacs is free software; you can redistribute it and/or modify it | |
7 under the terms of the GNU General Public License as published by the | |
8 Free Software Foundation; either version 2, or (at your option) any | |
9 later version. | |
10 | |
11 XEmacs is distributed in the hope that it will be useful, but WITHOUT | |
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 for more details. | |
15 | |
16 You should have received a copy of the GNU General Public License | |
17 along with XEmacs; see the file COPYING. If not, write to | |
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
19 Boston, MA 02111-1307, USA. */ | |
20 | |
21 /* Synched up with: Not in FSF. */ | |
22 | |
23 #include <config.h> | |
24 #include "lisp.h" | |
25 #include "hash.h" | |
26 | |
27 #define NULL_ENTRY ((void *) 0xdeadbeef) | |
28 | |
29 #define COMFORTABLE_SIZE(size) (21 * (size) / 16) | |
30 | |
31 #define KEYS_DIFFER_P(old, new, testfun) \ | |
32 (((old) != (new)) && (!(testfun) || !(testfun) ((old),(new)))) | |
33 | |
665 | 34 static void rehash (hentry *harray, struct hash_table *ht, Elemcount size); |
428 | 35 |
665 | 36 Hashcode |
37 memory_hash (const void *xv, Bytecount size) | |
428 | 38 { |
665 | 39 Hashcode h = 0; |
442 | 40 unsigned const char *x = (unsigned const char *) xv; |
428 | 41 |
42 if (!x) return 0; | |
43 | |
44 while (size--) | |
45 { | |
665 | 46 Hashcode g; |
428 | 47 h = (h << 4) + *x++; |
48 if ((g = h & 0xf0000000) != 0) | |
49 h = (h ^ (g >> 24)) ^ g; | |
50 } | |
51 | |
52 return h; | |
53 } | |
54 | |
665 | 55 Hashcode |
442 | 56 string_hash (const char *xv) |
57 { | |
665 | 58 Hashcode h = 0; |
442 | 59 unsigned const char *x = (unsigned const char *) xv; |
60 | |
61 if (!x) return 0; | |
62 | |
63 while (*x) | |
64 { | |
665 | 65 Hashcode g; |
442 | 66 h = (h << 4) + *x++; |
67 if ((g = h & 0xf0000000) != 0) | |
68 h = (h ^ (g >> 24)) ^ g; | |
69 } | |
70 | |
71 return h; | |
72 } | |
73 | |
428 | 74 /* Return a suitable size for a hash table, with at least SIZE slots. */ |
665 | 75 static Elemcount |
76 hash_table_size (Elemcount requested_size) | |
428 | 77 { |
78 /* Return some prime near, but greater than or equal to, SIZE. | |
79 Decades from the time of writing, someone will have a system large | |
80 enough that the list below will be too short... */ | |
665 | 81 static const Elemcount primes [] = |
428 | 82 { |
83 19, 29, 41, 59, 79, 107, 149, 197, 263, 347, 457, 599, 787, 1031, | |
84 1361, 1777, 2333, 3037, 3967, 5167, 6719, 8737, 11369, 14783, | |
85 19219, 24989, 32491, 42257, 54941, 71429, 92861, 120721, 156941, | |
86 204047, 265271, 344857, 448321, 582821, 757693, 985003, 1280519, | |
87 1664681, 2164111, 2813353, 3657361, 4754591, 6180989, 8035301, | |
88 10445899, 13579681, 17653589, 22949669, 29834603, 38784989, | |
89 50420551, 65546729, 85210757, 110774011, 144006217, 187208107, | |
90 243370577, 316381771, 411296309, 534685237, 695090819, 903618083, | |
647 | 91 1174703521, 1527114613, 1985248999 /* , 2580823717UL, 3355070839UL */ |
428 | 92 }; |
93 /* We've heard of binary search. */ | |
94 int low, high; | |
95 for (low = 0, high = countof (primes) - 1; high - low > 1;) | |
96 { | |
97 /* Loop Invariant: size < primes [high] */ | |
98 int mid = (low + high) / 2; | |
99 if (primes [mid] < requested_size) | |
100 low = mid; | |
101 else | |
102 high = mid; | |
103 } | |
104 return primes [high]; | |
105 } | |
106 | |
442 | 107 const void * |
108 gethash (const void *key, struct hash_table *hash_table, const void **ret_value) | |
428 | 109 { |
110 if (!key) | |
111 { | |
112 *ret_value = hash_table->zero_entry; | |
113 return (void *) hash_table->zero_set; | |
114 } | |
115 else | |
116 { | |
117 hentry *harray = hash_table->harray; | |
118 hash_table_test_function test_function = hash_table->test_function; | |
665 | 119 Elemcount size = hash_table->size; |
120 Hashcode hcode_initial = | |
428 | 121 hash_table->hash_function ? |
122 hash_table->hash_function (key) : | |
665 | 123 (Hashcode) key; |
124 Elemcount hcode = (Elemcount) (hcode_initial % size); | |
428 | 125 hentry *e = &harray [hcode]; |
442 | 126 const void *e_key = e->key; |
428 | 127 |
128 if (e_key ? | |
129 KEYS_DIFFER_P (e_key, key, test_function) : | |
130 e->contents == NULL_ENTRY) | |
131 { | |
665 | 132 Elemcount h2 = size - 2; |
133 Elemcount incr = (Elemcount) (1 + (hcode_initial % h2)); | |
428 | 134 do |
135 { | |
136 hcode += incr; if (hcode >= size) hcode -= size; | |
137 e = &harray [hcode]; | |
138 e_key = e->key; | |
139 } | |
140 while (e_key ? | |
141 KEYS_DIFFER_P (e_key, key, test_function) : | |
142 e->contents == NULL_ENTRY); | |
143 } | |
144 | |
145 *ret_value = e->contents; | |
146 return e->key; | |
147 } | |
148 } | |
149 | |
150 void | |
151 clrhash (struct hash_table *hash_table) | |
152 { | |
153 memset (hash_table->harray, 0, sizeof (hentry) * hash_table->size); | |
154 hash_table->zero_entry = 0; | |
155 hash_table->zero_set = 0; | |
156 hash_table->fullness = 0; | |
157 } | |
158 | |
159 void | |
160 free_hash_table (struct hash_table *hash_table) | |
161 { | |
162 xfree (hash_table->harray); | |
163 xfree (hash_table); | |
164 } | |
165 | |
166 struct hash_table* | |
665 | 167 make_hash_table (Elemcount size) |
428 | 168 { |
169 struct hash_table *hash_table = xnew_and_zero (struct hash_table); | |
170 hash_table->size = hash_table_size (COMFORTABLE_SIZE (size)); | |
171 hash_table->harray = xnew_array (hentry, hash_table->size); | |
172 clrhash (hash_table); | |
173 return hash_table; | |
174 } | |
175 | |
176 struct hash_table * | |
665 | 177 make_general_hash_table (Elemcount size, |
428 | 178 hash_table_hash_function hash_function, |
179 hash_table_test_function test_function) | |
180 { | |
181 struct hash_table* hash_table = make_hash_table (size); | |
182 hash_table->hash_function = hash_function; | |
183 hash_table->test_function = test_function; | |
184 return hash_table; | |
185 } | |
186 | |
187 static void | |
665 | 188 grow_hash_table (struct hash_table *hash_table, Elemcount new_size) |
428 | 189 { |
665 | 190 Elemcount old_size = hash_table->size; |
428 | 191 hentry *old_harray = hash_table->harray; |
192 | |
193 hash_table->size = hash_table_size (new_size); | |
194 hash_table->harray = xnew_array (hentry, hash_table->size); | |
195 | |
196 /* do the rehash on the "grown" table */ | |
197 { | |
198 long old_zero_set = hash_table->zero_set; | |
199 void *old_zero_entry = hash_table->zero_entry; | |
200 clrhash (hash_table); | |
201 hash_table->zero_set = old_zero_set; | |
202 hash_table->zero_entry = old_zero_entry; | |
203 rehash (old_harray, hash_table, old_size); | |
204 } | |
205 | |
206 xfree (old_harray); | |
207 } | |
208 | |
209 void | |
442 | 210 puthash (const void *key, void *contents, struct hash_table *hash_table) |
428 | 211 { |
212 if (!key) | |
213 { | |
214 hash_table->zero_entry = contents; | |
215 hash_table->zero_set = 1; | |
216 } | |
217 else | |
218 { | |
219 hash_table_test_function test_function = hash_table->test_function; | |
665 | 220 Elemcount size = hash_table->size; |
428 | 221 hentry *harray = hash_table->harray; |
665 | 222 Hashcode hcode_initial = |
428 | 223 hash_table->hash_function ? |
224 hash_table->hash_function (key) : | |
665 | 225 (Hashcode) key; |
226 Elemcount hcode = (Elemcount) (hcode_initial % size); | |
227 Elemcount h2 = size - 2; | |
228 Elemcount incr = (Elemcount) (1 + (hcode_initial % h2)); | |
442 | 229 const void *e_key = harray [hcode].key; |
230 const void *oldcontents; | |
428 | 231 |
232 if (e_key && KEYS_DIFFER_P (e_key, key, test_function)) | |
233 { | |
234 do | |
235 { | |
236 hcode += incr; if (hcode >= size) hcode -= size; | |
237 e_key = harray [hcode].key; | |
238 } | |
239 while (e_key && KEYS_DIFFER_P (e_key, key, test_function)); | |
240 } | |
241 oldcontents = harray [hcode].contents; | |
242 harray [hcode].key = key; | |
243 harray [hcode].contents = contents; | |
244 /* If the entry that we used was a deleted entry, | |
245 check for a non deleted entry of the same key, | |
246 then delete it. */ | |
247 if (!e_key && oldcontents == NULL_ENTRY) | |
248 { | |
249 hentry *e; | |
250 | |
251 do | |
252 { | |
253 hcode += incr; if (hcode >= size) hcode -= size; | |
254 e = &harray [hcode]; | |
255 e_key = e->key; | |
256 } | |
257 while (e_key ? | |
258 KEYS_DIFFER_P (e_key, key, test_function): | |
259 e->contents == NULL_ENTRY); | |
260 | |
261 if (e_key) | |
262 { | |
263 e->key = 0; | |
264 e->contents = NULL_ENTRY; | |
265 } | |
266 } | |
267 | |
268 /* only increment the fullness when we used up a new hentry */ | |
269 if (!e_key || KEYS_DIFFER_P (e_key, key, test_function)) | |
270 { | |
665 | 271 Elemcount comfortable_size = COMFORTABLE_SIZE (++(hash_table->fullness)); |
428 | 272 if (hash_table->size < comfortable_size) |
273 grow_hash_table (hash_table, comfortable_size + 1); | |
274 } | |
275 } | |
276 } | |
277 | |
278 static void | |
665 | 279 rehash (hentry *harray, struct hash_table *hash_table, Elemcount size) |
428 | 280 { |
281 hentry *limit = harray + size; | |
282 hentry *e; | |
283 for (e = harray; e < limit; e++) | |
284 { | |
285 if (e->key) | |
286 puthash (e->key, e->contents, hash_table); | |
287 } | |
288 } | |
289 | |
290 void | |
442 | 291 remhash (const void *key, struct hash_table *hash_table) |
428 | 292 { |
293 if (!key) | |
294 { | |
295 hash_table->zero_entry = 0; | |
296 hash_table->zero_set = 0; | |
297 } | |
298 else | |
299 { | |
300 hentry *harray = hash_table->harray; | |
301 hash_table_test_function test_function = hash_table->test_function; | |
665 | 302 Elemcount size = hash_table->size; |
303 Hashcode hcode_initial = | |
428 | 304 (hash_table->hash_function) ? |
305 (hash_table->hash_function (key)) : | |
665 | 306 ((Hashcode) key); |
307 Elemcount hcode = (Elemcount) (hcode_initial % size); | |
428 | 308 hentry *e = &harray [hcode]; |
442 | 309 const void *e_key = e->key; |
428 | 310 |
311 if (e_key ? | |
312 KEYS_DIFFER_P (e_key, key, test_function) : | |
313 e->contents == NULL_ENTRY) | |
314 { | |
665 | 315 Elemcount h2 = size - 2; |
316 Elemcount incr = (Elemcount) (1 + (hcode_initial % h2)); | |
428 | 317 do |
318 { | |
319 hcode += incr; if (hcode >= size) hcode -= size; | |
320 e = &harray [hcode]; | |
321 e_key = e->key; | |
322 } | |
323 while (e_key? | |
324 KEYS_DIFFER_P (e_key, key, test_function): | |
325 e->contents == NULL_ENTRY); | |
326 } | |
327 if (e_key) | |
328 { | |
329 e->key = 0; | |
330 e->contents = NULL_ENTRY; | |
331 /* Note: you can't do fullness-- here, it breaks the world. */ | |
332 } | |
333 } | |
334 } | |
335 | |
336 void | |
337 maphash (maphash_function mf, struct hash_table *hash_table, void *arg) | |
338 { | |
339 hentry *e; | |
340 hentry *limit; | |
341 | |
342 if (hash_table->zero_set) | |
343 { | |
344 if (mf (0, hash_table->zero_entry, arg)) | |
345 return; | |
346 } | |
347 | |
348 for (e = hash_table->harray, limit = e + hash_table->size; e < limit; e++) | |
349 { | |
350 if (e->key && mf (e->key, e->contents, arg)) | |
351 return; | |
352 } | |
353 } | |
354 | |
355 void | |
356 map_remhash (remhash_predicate predicate, struct hash_table *hash_table, void *arg) | |
357 { | |
358 hentry *e; | |
359 hentry *limit; | |
360 | |
361 if (hash_table->zero_set && predicate (0, hash_table->zero_entry, arg)) | |
362 { | |
363 hash_table->zero_set = 0; | |
364 hash_table->zero_entry = 0; | |
365 } | |
366 | |
367 for (e = hash_table->harray, limit = e + hash_table->size; e < limit; e++) | |
368 if (predicate (e->key, e->contents, arg)) | |
369 { | |
370 e->key = 0; | |
371 e->contents = NULL_ENTRY; | |
372 } | |
373 } |