File: mhash.h

package info (click to toggle)
virtuoso-opensource 7.2.5.1%2Bdfsg1-0.3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 285,240 kB
  • sloc: ansic: 641,220; sql: 490,413; xml: 269,570; java: 83,893; javascript: 79,900; cpp: 36,927; sh: 31,653; cs: 25,702; php: 12,690; yacc: 10,227; lex: 7,601; makefile: 7,129; jsp: 4,523; awk: 1,697; perl: 1,013; ruby: 1,003; python: 326
file content (90 lines) | stat: -rw-r--r-- 2,120 bytes parent folder | download | duplicates (4)
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
/*
 *  mhash.h
 *
 *  $Id$
 *
 *  This file is part of the OpenLink Software Virtuoso Open-Source (VOS)
 *  project.
 *
 *  Copyright (C) 1998-2018 OpenLink Software
 *
 *  This project 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; only version 2 of the License, dated June 1991.
 *
 *  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 this program; if not, write to the Free Software Foundation, Inc.,
 *  51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
 *
 */

#ifndef MHASH_M
#define MHASH_M  ((uint64) 0xc6a4a7935bd1e995)
#define MHASH_R 47
#endif



#ifndef MHASH_STEP
#define MHASH_STEP(h, data) \
{ \
  uint64 __k = data; \
      __k *= MHASH_M;  \
      __k ^= __k >> MHASH_R;  \
      __k *= MHASH_M;  \
      h ^= __k; \
      h *= MHASH_M; \
    }


#define MHASH_ID_STEP(h, data) \
{ \
  uint64 __k = data; \
  uint32 __k1 = __k; \
      __k *= MHASH_M;  \
      __k ^= __k >> MHASH_R;  \
      __k *= MHASH_M;  \
      h ^= __k; \
      h *= MHASH_M; \
      h = (h & 0xffffffff00000000) | __k1;	\
    }




#ifdef VALGRIND
#define MHASH_VAR(init, ptr, len) BYTE_BUFFER_HASH (init, ptr, len)
#else
#define MHASH_VAR(init, ptr, len)		\
{ \
    uint64 __h = init; \
  uint64 * data = (uint64*)ptr; \
  uint64 * end = (uint64*)(((ptrlong)data) + (len & ~7));	\
  while (data < end) \
    { \
      uint64 k  = *(data++); \
      k *= MHASH_M;  \
      k ^= k >> MHASH_R;  \
      k *= MHASH_M;  \
      __h ^= k; \
      __h *= MHASH_M; \
    } \
  if (len & 7) \
    { \
      uint64 k = *data; \
      k &= ((int64)1 << ((len & 7) << 3)) - 1;	\
      k *= MHASH_M;  \
      k ^= k >> MHASH_R;  \
      k *= MHASH_M;  \
      __h ^= k; \
      __h *= MHASH_M; \
    }\
  init = __h; \
}
#endif
#endif