-
Notifications
You must be signed in to change notification settings - Fork 1
/
kernel_hash.c
162 lines (138 loc) · 3.69 KB
/
kernel_hash.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
/* This file is part of the MAYLIB libray.
Copyright 2007-2018 Patrick Pelissier
This Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
This Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with th Library; see the file COPYING.LESSER.txt.
If not, write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "may-impl.h"
MAY_REGPARM may_hash_t
may_mpz_hash (mpz_t z)
{
mp_size_t n = z->_mp_size;
mp_limb_t *p = z->_mp_d;
MAY_HASH_DECL (hash);
if (MAY_UNLIKELY (n <= 0)) {
MAY_HASH_UP (hash, 0x7F5C1458);
if (MAY_UNLIKELY (n == 0))
return MAY_HASH_GET (hash);
n = -n;
} else
MAY_HASH_UP (hash, 0x587F5C14);
MAY_ASSERT (n >= 1);
do {
MAY_HASH_UP (hash, *p++);
} while (--n > 0);
return MAY_HASH_GET (hash);
}
MAY_REGPARM may_hash_t
may_mpq_hash (mpq_t q)
{
return MAY_NEW_HASH (may_mpz_hash (mpq_numref(q)),
may_mpz_hash (mpq_denref(q)));
}
MAY_REGPARM may_hash_t
may_mpfr_hash (mpfr_t f)
{
mp_limb_t *p = f[0]._mpfr_d;
mp_size_t n = (f[0]._mpfr_prec-1)/(sizeof(mp_limb_t)*CHAR_BIT)+1;
MAY_HASH_DECL (h);
MAY_HASH_UP (h, f->_mpfr_exp);
if (MPFR_SIGN (f) < 0)
MAY_HASH_UP (h, 1);
/* Special value: NAN, INF and ZERO */
if (MAY_UNLIKELY(mpfr_nan_p (f) || mpfr_inf_p (f) || mpfr_zero_p (f)))
return MAY_HASH_GET (h);
/* Mantissa */
do {
MAY_HASH_UP (h, *p++);
} while (--n > 0);
return MAY_HASH_GET (h);
}
MAY_REGPARM may_hash_t
may_string_hash (const char p[])
{
MAY_HASH_DECL (hash);
char c;
do {
c = *p++;
MAY_HASH_UP (hash, (unsigned int) c);
} while (c != 0);
return MAY_HASH_GET (hash);
}
MAY_REGPARM may_hash_t
may_data_hash (const char p[], may_size_t size)
{
MAY_HASH_DECL (hash);
char c;
while (size) {
c = *p++;
MAY_HASH_UP (hash, (unsigned int) c);
size--;
}
return MAY_HASH_GET (hash);
}
MAY_REGPARM may_hash_t
may_node_hash (const may_t x[], may_size_t n)
{
MAY_HASH_DECL (hash);
MAY_ASSERT (n > 0);
do {
MAY_ASSERT (may_recompute_hash (*x) == MAY_HASH (*x));
MAY_HASH_UP (hash, MAY_HASH (*x));
x++;
} while (-- n > 0);
return MAY_HASH_GET (hash);
}
MAY_REGPARM may_hash_t
may_recompute_hash (may_t x)
{
struct may_s ms;
may_hash_t hash;
switch (MAY_TYPE (x)) {
case MAY_INT_T:
hash = may_mpz_hash (MAY_INT (x));
break;
case MAY_RAT_T:
hash = may_mpq_hash (MAY_RAT (x));
break;
case MAY_FLOAT_T:
hash = may_mpfr_hash (MAY_FLOAT (x));
break;
case MAY_STRING_T:
hash = may_string_hash (MAY_NAME (x));
break;
case MAY_DATA_T:
hash = may_data_hash ((char*)MAY_DATA (x).data, MAY_DATA (x).size);
break;
case MAY_COMPLEX_T:
hash = MAY_NEW_HASH (may_recompute_hash (MAY_RE (x)),
may_recompute_hash (MAY_IM (x)));
break;
case MAY_EXP_T ... MAY_UNARYFUNC_LIMIT:
hash = may_recompute_hash (MAY_AT (x, 0));
break;
default:
hash = may_node_hash (MAY_AT_PTR (x, 0), MAY_NODE_SIZE(x));
break;
}
MAY_OPEN_C (&ms, MAY_TYPE (x));
MAY_CLOSE_C (&ms, MAY_FLAGS(x), hash);
#if 0
if (1) {
printf ("Previous=%u Recompute=%u for ",
(unsigned int) MAY_HASH (x),
(unsigned int) MAY_HASH (&ms));
may_dump (x);
}
#endif
return MAY_HASH (&ms);
}