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 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
|
/*
Copyright 2015-2016 by
Laboratoire d'Informatique de Paris 6 - Équipe PEQUAN
Sorbonne Universités
UPMC Univ Paris 06
UMR 7606, LIP6
Boîte Courrier 169
4, place Jussieu
F-75252 Paris Cedex 05
France
Contributor Ch. Lauter
christoph.lauter@lip6.fr
This software is a computer program whose purpose is to provide an
environment for safe floating-point code development. It is
particularly targeted to the automated implementation of
mathematical floating-point libraries (libm). Amongst other features,
it offers a certified infinity norm, an automatic polynomial
implementer and a fast Remez algorithm.
This software is governed by the CeCILL-C license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL-C
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL-C license and that you accept its terms.
This program is distributed WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*/
#include <stdint.h>
#include <stdlib.h>
#include "hash.h"
static inline uint64_t __rotateLeft(uint64_t x, unsigned int k) {
unsigned int s, r;
uint64_t tmp1, tmp2, tmp3;
s = k & ((unsigned int) 63);
if (s == ((unsigned int) 0)) return x;
r = 64 - s;
tmp1 = x;
tmp1 <<= s;
tmp2 = x;
tmp2 >>= r;
tmp3 = tmp1 | tmp2;
return tmp3;
}
static inline uint64_t __hashCombine_internal(uint64_t h1, uint64_t h2) {
uint64_t tmp1, tmp2;
tmp1 = h1 ^ h2;
tmp2 = __rotateLeft(tmp1, 17);
return tmp2;
}
static inline uint64_t __hashUint64_internal(uint64_t x) {
uint64_t tmp1, tmp2;
tmp1 = x ^ UINT64_C(0xcafebabedeadbeef);
tmp2 = __rotateLeft(tmp1, 13);
return tmp2;
}
static inline uint64_t __hashUint8_internal(uint8_t x) {
uint64_t tmp1, tmp2;
tmp1 = (uint64_t) x;
tmp2 = tmp1; tmp1 <<= 8;
tmp2 |= tmp1; tmp1 <<= 8;
tmp2 |= tmp1; tmp1 <<= 8;
tmp2 |= tmp1; tmp1 <<= 8;
tmp2 |= tmp1; tmp1 <<= 8;
tmp2 |= tmp1; tmp1 <<= 8;
tmp2 |= tmp1; tmp1 <<= 8;
tmp2 |= tmp1;
return __hashUint64_internal(tmp2);
}
static inline uint64_t __hashUint16_internal(uint16_t x) {
uint64_t tmp1, tmp2;
tmp1 = (uint64_t) x;
tmp2 = tmp1; tmp1 <<= 16;
tmp2 |= tmp1; tmp1 <<= 16;
tmp2 |= tmp1; tmp1 <<= 16;
tmp2 |= tmp1;
return __hashUint64_internal(tmp2);
}
static inline uint64_t __hashUint32_internal(uint32_t x) {
uint64_t tmp1, tmp2;
tmp1 = (uint64_t) x;
tmp2 = tmp1; tmp1 <<= 32;
tmp2 |= tmp1;
return __hashUint64_internal(tmp2);
}
static inline uint64_t __hashUnsignedChar_internal(unsigned char x) {
uint8_t tmp1;
uint16_t tmp2;
uint32_t tmp3;
uint64_t tmp4;
if (sizeof(uint8_t) >= sizeof(unsigned char)) {
tmp1 = (uint8_t) x;
return __hashUint8_internal(tmp1);
}
if (sizeof(uint16_t) >= sizeof(unsigned char)) {
tmp2 = (uint16_t) x;
return __hashUint16_internal(tmp2);
}
if (sizeof(uint32_t) >= sizeof(unsigned char)) {
tmp3 = (uint32_t) x;
return __hashUint32_internal(tmp3);
}
tmp4 = (uint64_t) x;
return __hashUint64_internal(tmp4);
}
static inline uint64_t __hashUnsignedInt_internal(unsigned int x) {
uint8_t tmp1;
uint16_t tmp2;
uint32_t tmp3;
uint64_t tmp4;
if (sizeof(uint8_t) >= sizeof(unsigned int)) {
tmp1 = (uint8_t) x;
return __hashUint8_internal(tmp1);
}
if (sizeof(uint16_t) >= sizeof(unsigned int)) {
tmp2 = (uint16_t) x;
return __hashUint16_internal(tmp2);
}
if (sizeof(uint32_t) >= sizeof(unsigned int)) {
tmp3 = (uint32_t) x;
return __hashUint32_internal(tmp3);
}
tmp4 = (uint64_t) x;
return __hashUint64_internal(tmp4);
}
static inline uint64_t __hashUnsignedLong_internal(unsigned long x) {
uint8_t tmp1;
uint16_t tmp2;
uint32_t tmp3;
uint64_t tmp4;
if (sizeof(uint8_t) >= sizeof(unsigned long)) {
tmp1 = (uint8_t) x;
return __hashUint8_internal(tmp1);
}
if (sizeof(uint16_t) >= sizeof(unsigned long)) {
tmp2 = (uint16_t) x;
return __hashUint16_internal(tmp2);
}
if (sizeof(uint32_t) >= sizeof(unsigned long)) {
tmp3 = (uint32_t) x;
return __hashUint32_internal(tmp3);
}
tmp4 = (uint64_t) x;
return __hashUint64_internal(tmp4);
}
static inline uint64_t __hashPointer_internal(void *x) {
uintptr_t X;
uint8_t tmp1;
uint16_t tmp2;
uint32_t tmp3;
uint64_t tmp4;
X = (uintptr_t) x;
if (sizeof(uint8_t) >= sizeof(uintptr_t)) {
tmp1 = (uint8_t) X;
return __hashUint8_internal(tmp1);
}
if (sizeof(uint16_t) >= sizeof(uintptr_t)) {
tmp2 = (uint16_t) X;
return __hashUint16_internal(tmp2);
}
if (sizeof(uint32_t) >= sizeof(uintptr_t)) {
tmp3 = (uint32_t) X;
return __hashUint32_internal(tmp3);
}
tmp4 = (uint64_t) X;
return __hashUint64_internal(tmp4);
}
static inline uint64_t __hashChar_internal(char x) {
char xx;
unsigned char tmp;
xx = x;
tmp = *((unsigned char *) &xx);
return __hashUnsignedChar_internal(tmp);
}
static inline uint64_t __hashInt_internal(int x) {
int xx;
unsigned int tmp;
xx = x;
tmp = *((unsigned int *) &xx);
return __hashUnsignedInt_internal(tmp);
}
static inline uint64_t __hashInt64_internal(int64_t x) {
int64_t xx;
uint64_t tmp;
xx = x;
tmp = *((uint64_t *) &xx);
return __hashUint64_internal(tmp);
}
static inline uint64_t __hashLong_internal(long x) {
long xx;
unsigned long tmp;
xx = x;
tmp = *((unsigned long *) &xx);
return __hashUnsignedLong_internal(tmp);
}
typedef union {
uint64_t l;
double d;
} binary64_caster;
static inline uint64_t __hashDouble_internal(double x) {
double xx;
uint64_t tmp;
binary64_caster caster;
xx = x;
caster.d = xx;
tmp = caster.l;
return __hashUint64_internal(tmp);
}
static inline uint64_t __hashMpfr_internal(mpfr_t x) {
long exp;
double mant;
uint64_t tmp1, tmp2;
exp = (long) 0;
mant = mpfr_get_d_2exp(&exp, x, GMP_RNDN);
tmp1 = __hashLong_internal(exp);
tmp2 = __hashDouble_internal(mant);
return __hashCombine_internal(tmp1, tmp2);
}
static inline uint64_t __hashMpfi_internal(sollya_mpfi_t x) {
uint64_t tmp1, tmp2;
/* HACK ALERT: For performance reasons, we will access the internals
of an mpfi_t !!!
*/
tmp1 = __hashMpfr_internal(&(x->left));
tmp2 = __hashMpfr_internal(&(x->right));
return __hashCombine_internal(tmp1, tmp2);
}
static inline uint64_t __hashMpz_internal(mpz_t x) {
long exp;
double mant;
uint64_t tmp1, tmp2;
exp = (long) 0;
mant = mpz_get_d_2exp(&exp, x);
tmp1 = __hashLong_internal(exp);
tmp2 = __hashDouble_internal(mant);
return __hashCombine_internal(tmp1, tmp2);
}
static inline uint64_t __hashMpq_internal(mpq_t x) {
uint64_t tmp1, tmp2;
mpq_canonicalize(x);
tmp1 = __hashMpz_internal(mpq_numref(x));
tmp2 = __hashMpz_internal(mpq_denref(x));
return __hashCombine_internal(tmp1, tmp2);
}
static inline uint64_t __hashString_internal(char *x) {
uint64_t tmp;
char *curr;
tmp = UINT64_C(0);
for (curr=x;*curr!='\0';curr++) {
tmp = __hashCombine_internal(tmp, __hashChar_internal(*curr));
}
return tmp;
}
uint64_t hashCombine(uint64_t h1, uint64_t h2) {
uint64_t res;
res = __hashCombine_internal(h1, h2);
return res;
}
uint64_t hashMpfr(mpfr_t x) {
uint64_t res;
res = __hashMpfr_internal(x);
return res;
}
uint64_t hashMpfi(sollya_mpfi_t x) {
uint64_t res;
res = __hashMpfi_internal(x);
return res;
}
uint64_t hashMpq(mpq_t x) {
uint64_t res;
res = __hashMpq_internal(x);
return res;
}
uint64_t hashString(char *x) {
uint64_t res;
res = __hashString_internal(x);
return res;
}
uint64_t hashChar(char x) {
uint64_t res;
res = __hashChar_internal(x);
return res;
}
uint64_t hashInt(int x) {
uint64_t res;
res = __hashInt_internal(x);
return res;
}
uint64_t hashUnsignedInt(unsigned int x) {
uint64_t res;
res = __hashUnsignedInt_internal(x);
return res;
}
uint64_t hashInt64(int64_t x) {
uint64_t res;
res = __hashInt64_internal(x);
return res;
}
uint64_t hashPointer(void *x) {
uint64_t res;
res = __hashPointer_internal(x);
return res;
}
|