Commit | Line | Data |
---|---|---|
9636b49c | 1 | /* Copyright (C) 1995,1996,1997, 2000, 2001 Free Software Foundation, Inc. |
0f2d19dd JB |
2 | * |
3 | * This program is free software; you can redistribute it and/or modify | |
4 | * it under the terms of the GNU General Public License as published by | |
5 | * the Free Software Foundation; either version 2, or (at your option) | |
6 | * any later version. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | * GNU General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public License | |
14 | * along with this software; see the file COPYING. If not, write to | |
82892bed JB |
15 | * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, |
16 | * Boston, MA 02111-1307 USA | |
0f2d19dd JB |
17 | * |
18 | * As a special exception, the Free Software Foundation gives permission | |
19 | * for additional uses of the text contained in its release of GUILE. | |
20 | * | |
21 | * The exception is that, if you link the GUILE library with other files | |
22 | * to produce an executable, this does not by itself cause the | |
23 | * resulting executable to be covered by the GNU General Public License. | |
24 | * Your use of that executable is in no way restricted on account of | |
25 | * linking the GUILE library code into it. | |
26 | * | |
27 | * This exception does not however invalidate any other reasons why | |
28 | * the executable file might be covered by the GNU General Public License. | |
29 | * | |
30 | * This exception applies only to the code released by the | |
31 | * Free Software Foundation under the name GUILE. If you copy | |
32 | * code from other Free Software Foundation releases into a copy of | |
33 | * GUILE, as the General Public License permits, the exception does | |
34 | * not apply to the code that you add in this way. To avoid misleading | |
35 | * anyone as to the status of such modified files, you must delete | |
36 | * this exception notice from them. | |
37 | * | |
38 | * If you write modifications of your own for GUILE, it is your choice | |
39 | * whether to permit this exception to apply to your modifications. | |
82892bed | 40 | * If you do not wish that, delete this exception notice. */ |
1bbd0b84 | 41 | |
1bbd0b84 | 42 | |
0f2d19dd JB |
43 | \f |
44 | ||
a0599745 MD |
45 | #include "libguile/_scm.h" |
46 | #include "libguile/chars.h" | |
47 | #include "libguile/ports.h" | |
a002f1a2 DH |
48 | #include "libguile/strings.h" |
49 | #include "libguile/symbols.h" | |
a0599745 | 50 | #include "libguile/vectors.h" |
0f2d19dd | 51 | |
a0599745 MD |
52 | #include "libguile/validate.h" |
53 | #include "libguile/hash.h" | |
0f2d19dd JB |
54 | \f |
55 | ||
56 | #ifndef floor | |
57 | extern double floor(); | |
58 | #endif | |
59 | ||
1cc91f1b | 60 | |
c014a02e | 61 | unsigned long |
1be6b49c | 62 | scm_string_hash (const unsigned char *str, size_t len) |
ba393257 DH |
63 | { |
64 | if (len > 5) | |
65 | { | |
1be6b49c | 66 | size_t i = 5; |
c014a02e | 67 | unsigned long h = 264; |
ba393257 | 68 | while (i--) |
9636b49c | 69 | h = (h << 8) + (unsigned) str[h % len]; |
ba393257 DH |
70 | return h; |
71 | } | |
72 | else | |
73 | { | |
1be6b49c | 74 | size_t i = len; |
c014a02e | 75 | unsigned long h = 0; |
ba393257 | 76 | while (i) |
9636b49c | 77 | h = (h << 8) + (unsigned) str[--i]; |
ba393257 DH |
78 | return h; |
79 | } | |
80 | } | |
81 | ||
82 | ||
dba97178 DH |
83 | /* Dirk:FIXME:: why downcase for characters? (2x: scm_hasher, scm_ihashv) */ |
84 | /* Dirk:FIXME:: scm_hasher could be made static. */ | |
85 | ||
86 | ||
c014a02e ML |
87 | unsigned long |
88 | scm_hasher(SCM obj, unsigned long n, size_t d) | |
0f2d19dd | 89 | { |
dba97178 DH |
90 | switch (SCM_ITAG3 (obj)) { |
91 | case scm_tc3_int_1: | |
92 | case scm_tc3_int_2: | |
94a5efac | 93 | return SCM_INUM(obj) % n; /* SCM_INUMP(obj) */ |
dba97178 DH |
94 | case scm_tc3_imm24: |
95 | if (SCM_CHARP(obj)) | |
c014a02e | 96 | return (unsigned)(scm_downcase(SCM_CHAR(obj))) % n; |
dba97178 | 97 | switch (SCM_UNPACK (obj)) { |
0f2d19dd | 98 | #ifndef SICP |
f228362b | 99 | case SCM_UNPACK(SCM_EOL): |
94a5efac GB |
100 | d = 256; |
101 | break; | |
0f2d19dd | 102 | #endif |
f228362b | 103 | case SCM_UNPACK(SCM_BOOL_T): |
94a5efac GB |
104 | d = 257; |
105 | break; | |
f228362b | 106 | case SCM_UNPACK(SCM_BOOL_F): |
94a5efac GB |
107 | d = 258; |
108 | break; | |
f228362b | 109 | case SCM_UNPACK(SCM_EOF_VAL): |
94a5efac GB |
110 | d = 259; |
111 | break; | |
112 | default: | |
113 | d = 263; /* perhaps should be error */ | |
0f2d19dd JB |
114 | } |
115 | return d % n; | |
94a5efac GB |
116 | default: |
117 | return 263 % n; /* perhaps should be error */ | |
dba97178 | 118 | case scm_tc3_cons: |
0f2d19dd | 119 | switch SCM_TYP7(obj) { |
94a5efac GB |
120 | default: |
121 | return 263 % n; | |
0f2d19dd | 122 | case scm_tc7_smob: |
1be6b49c | 123 | switch SCM_TYP16 (obj) { |
950cc72b | 124 | case scm_tc16_big: |
1be6b49c | 125 | return SCM_INUM (scm_modulo (obj, SCM_MAKINUM (n))); |
94a5efac GB |
126 | default: |
127 | return 263 % n; | |
950cc72b MD |
128 | case scm_tc16_real: |
129 | { | |
1be6b49c ML |
130 | double r = SCM_REAL_VALUE (obj); |
131 | if (floor (r) == r) { | |
0f2d19dd | 132 | obj = scm_inexact_to_exact (obj); |
1be6b49c ML |
133 | if SCM_IMP (obj) return SCM_INUM (obj) % n; |
134 | return SCM_INUM (scm_modulo (obj, SCM_MAKINUM (n))); | |
0f2d19dd JB |
135 | } |
136 | } | |
950cc72b | 137 | case scm_tc16_complex: |
1be6b49c | 138 | obj = scm_number_to_string (obj, SCM_MAKINUM (10)); |
0f2d19dd | 139 | } |
0f2d19dd | 140 | case scm_tc7_string: |
34f0f2b8 | 141 | return scm_string_hash (SCM_STRING_UCHARS (obj), SCM_STRING_LENGTH (obj)) % n; |
28b06554 DH |
142 | case scm_tc7_symbol: |
143 | return SCM_SYMBOL_HASH (obj) % n; | |
0f2d19dd JB |
144 | case scm_tc7_wvect: |
145 | case scm_tc7_vector: | |
146 | { | |
1be6b49c | 147 | size_t len = SCM_VECTOR_LENGTH(obj); |
34d19ef6 | 148 | SCM const *data = SCM_VELTS(obj); |
1be6b49c | 149 | if (len > 5) |
0f2d19dd | 150 | { |
1be6b49c | 151 | size_t i = d/2; |
c014a02e | 152 | unsigned long h = 1; |
1be6b49c | 153 | while (i--) h = ((h << 8) + (scm_hasher (data[h % len], n, 2))) % n; |
0f2d19dd JB |
154 | return h; |
155 | } | |
156 | else | |
157 | { | |
1be6b49c | 158 | size_t i = len; |
c014a02e | 159 | unsigned long h = (n)-1; |
1be6b49c | 160 | while (i--) h = ((h << 8) + (scm_hasher (data[i], n, d/len))) % n; |
0f2d19dd JB |
161 | return h; |
162 | } | |
163 | } | |
94a5efac GB |
164 | case scm_tcs_cons_imcar: |
165 | case scm_tcs_cons_nimcar: | |
1be6b49c ML |
166 | if (d) return (scm_hasher (SCM_CAR (obj), n, d/2) |
167 | + scm_hasher (SCM_CDR (obj), n, d/2)) % n; | |
0f2d19dd JB |
168 | else return 1; |
169 | case scm_tc7_port: | |
206d3de3 | 170 | return ((SCM_RDNG & SCM_CELL_WORD_0 (obj)) ? 260 : 261) % n; |
94a5efac | 171 | case scm_tcs_closures: |
94a5efac | 172 | case scm_tcs_subrs: |
0f2d19dd JB |
173 | return 262 % n; |
174 | } | |
175 | } | |
176 | } | |
177 | ||
178 | ||
179 | \f | |
180 | ||
1cc91f1b | 181 | |
c014a02e ML |
182 | unsigned long |
183 | scm_ihashq (SCM obj, unsigned long n) | |
0f2d19dd | 184 | { |
54778cd3 | 185 | return (SCM_UNPACK (obj) >> 1) % n; |
0f2d19dd JB |
186 | } |
187 | ||
188 | ||
3b3b36dd | 189 | SCM_DEFINE (scm_hashq, "hashq", 2, 0, 0, |
94a5efac | 190 | (SCM key, SCM size), |
5352393c MG |
191 | "Determine a hash value for @var{key} that is suitable for\n" |
192 | "lookups in a hashtable of size @var{size}, where @code{eq?} is\n" | |
193 | "used as the equality predicate. The function returns an\n" | |
194 | "integer in the range 0 to @var{size} - 1. Note that\n" | |
195 | "@code{hashq} may use internal addresses. Thus two calls to\n" | |
196 | "hashq where the keys are @code{eq?} are not guaranteed to\n" | |
197 | "deliver the same value if the key object gets garbage collected\n" | |
198 | "in between. This can happen, for example with symbols:\n" | |
199 | "@code{(hashq 'foo n) (gc) (hashq 'foo n)} may produce two\n" | |
200 | "different values, since @code{foo} will be garbage collected.") | |
1bbd0b84 | 201 | #define FUNC_NAME s_scm_hashq |
0f2d19dd | 202 | { |
94a5efac GB |
203 | SCM_VALIDATE_INUM_MIN (2, size, 0); |
204 | return SCM_MAKINUM (scm_ihashq (key, SCM_INUM (size))); | |
0f2d19dd | 205 | } |
1bbd0b84 | 206 | #undef FUNC_NAME |
0f2d19dd JB |
207 | |
208 | ||
209 | \f | |
210 | ||
1cc91f1b | 211 | |
c014a02e ML |
212 | unsigned long |
213 | scm_ihashv (SCM obj, unsigned long n) | |
0f2d19dd | 214 | { |
7866a09b | 215 | if (SCM_CHARP(obj)) |
c014a02e | 216 | return ((unsigned long) (scm_downcase (SCM_CHAR (obj)))) % n; /* downcase!?!! */ |
0f2d19dd | 217 | |
0c95b57d | 218 | if (SCM_NUMP(obj)) |
c014a02e | 219 | return (unsigned long) scm_hasher(obj, n, 10); |
0f2d19dd | 220 | else |
54778cd3 | 221 | return SCM_UNPACK (obj) % n; |
0f2d19dd JB |
222 | } |
223 | ||
224 | ||
3b3b36dd | 225 | SCM_DEFINE (scm_hashv, "hashv", 2, 0, 0, |
94a5efac | 226 | (SCM key, SCM size), |
5352393c MG |
227 | "Determine a hash value for @var{key} that is suitable for\n" |
228 | "lookups in a hashtable of size @var{size}, where @code{eqv?} is\n" | |
229 | "used as the equality predicate. The function returns an\n" | |
230 | "integer in the range 0 to @var{size} - 1. Note that\n" | |
231 | "@code{(hashv key)} may use internal addresses. Thus two calls\n" | |
232 | "to hashv where the keys are @code{eqv?} are not guaranteed to\n" | |
233 | "deliver the same value if the key object gets garbage collected\n" | |
234 | "in between. This can happen, for example with symbols:\n" | |
235 | "@code{(hashv 'foo n) (gc) (hashv 'foo n)} may produce two\n" | |
236 | "different values, since @code{foo} will be garbage collected.") | |
1bbd0b84 | 237 | #define FUNC_NAME s_scm_hashv |
0f2d19dd | 238 | { |
94a5efac GB |
239 | SCM_VALIDATE_INUM_MIN (2, size, 0); |
240 | return SCM_MAKINUM (scm_ihashv (key, SCM_INUM (size))); | |
0f2d19dd | 241 | } |
1bbd0b84 | 242 | #undef FUNC_NAME |
0f2d19dd JB |
243 | |
244 | ||
245 | \f | |
246 | ||
1cc91f1b | 247 | |
c014a02e ML |
248 | unsigned long |
249 | scm_ihash (SCM obj, unsigned long n) | |
0f2d19dd | 250 | { |
c014a02e | 251 | return (unsigned long) scm_hasher (obj, n, 10); |
0f2d19dd JB |
252 | } |
253 | ||
3b3b36dd | 254 | SCM_DEFINE (scm_hash, "hash", 2, 0, 0, |
94a5efac | 255 | (SCM key, SCM size), |
5352393c MG |
256 | "Determine a hash value for @var{key} that is suitable for\n" |
257 | "lookups in a hashtable of size @var{size}, where @code{equal?}\n" | |
258 | "is used as the equality predicate. The function returns an\n" | |
259 | "integer in the range 0 to @var{size} - 1.") | |
1bbd0b84 | 260 | #define FUNC_NAME s_scm_hash |
0f2d19dd | 261 | { |
94a5efac GB |
262 | SCM_VALIDATE_INUM_MIN (2, size, 0); |
263 | return SCM_MAKINUM (scm_ihash (key, SCM_INUM (size))); | |
0f2d19dd | 264 | } |
1bbd0b84 | 265 | #undef FUNC_NAME |
0f2d19dd JB |
266 | |
267 | ||
268 | \f | |
269 | ||
1cc91f1b | 270 | |
0f2d19dd JB |
271 | void |
272 | scm_init_hash () | |
0f2d19dd | 273 | { |
a0599745 | 274 | #include "libguile/hash.x" |
0f2d19dd JB |
275 | } |
276 | ||
89e00824 ML |
277 | |
278 | /* | |
279 | Local Variables: | |
280 | c-file-style: "gnu" | |
281 | End: | |
282 | */ |