3 * Keyed 32-bit hash function using TEA in a Davis-Meyer function
5 * Hi = E Mi(Hi-1) + Hi-1
7 * (see Applied Cryptography, 2nd edition, p448).
9 * Jeremy Fitzhardinge <jeremy@zip.com.au> 1998
11 * Jeremy has agreed to the contents of reiserfs/README. -Hans
12 * Yura's function is added (04/07/2000)
21 #include <linux/kernel.h>
22 #include <linux/reiserfs_fs.h>
23 #include <asm/types.h>
26 #define DELTA 0x9E3779B9
27 #define FULLROUNDS 10 /* 32 is overkill, 16 is strong crypto */
28 #define PARTROUNDS 6 /* 6 gets complete mixing */
30 /* a, b, c, d - data; h0, h1 - accumulated hash */
31 #define TEACORE(rounds) \
43 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
44 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); \
51 u32
keyed_hash(const signed char *msg
, int len
)
53 u32 k
[] = { 0x9464a485, 0x542e1a94, 0x3e846bff, 0xb75bcfc3 };
55 u32 h0
= k
[0], h1
= k
[1];
60 // assert(len >= 0 && len < 256);
62 pad
= (u32
) len
| ((u32
) len
<< 8);
67 (u32
) msg
[1] << 8 | (u32
) msg
[2] << 16 | (u32
) msg
[3] << 24;
69 (u32
) msg
[5] << 8 | (u32
) msg
[6] << 16 | (u32
) msg
[7] << 24;
72 (u32
) msg
[10] << 16 | (u32
) msg
[11] << 24;
75 (u32
) msg
[14] << 16 | (u32
) msg
[15] << 24;
85 (u32
) msg
[1] << 8 | (u32
) msg
[2] << 16 | (u32
) msg
[3] << 24;
87 (u32
) msg
[5] << 8 | (u32
) msg
[6] << 16 | (u32
) msg
[7] << 24;
90 (u32
) msg
[10] << 16 | (u32
) msg
[11] << 24;
93 for (i
= 12; i
< len
; i
++) {
97 } else if (len
>= 8) {
99 (u32
) msg
[1] << 8 | (u32
) msg
[2] << 16 | (u32
) msg
[3] << 24;
101 (u32
) msg
[5] << 8 | (u32
) msg
[6] << 16 | (u32
) msg
[7] << 24;
104 for (i
= 8; i
< len
; i
++) {
108 } else if (len
>= 4) {
110 (u32
) msg
[1] << 8 | (u32
) msg
[2] << 16 | (u32
) msg
[3] << 24;
113 for (i
= 4; i
< len
; i
++) {
119 for (i
= 0; i
< len
; i
++) {
131 /* What follows in this file is copyright 2000 by Hans Reiser, and the
132 * licensing of what follows is governed by reiserfs/README */
134 u32
yura_hash(const signed char *msg
, int len
)
140 for (pow
= 1, i
= 1; i
< len
; i
++)
146 a
= (msg
[0] - 48) * pow
;
148 for (i
= 1; i
< len
; i
++) {
150 for (pow
= 1, j
= i
; j
< len
- 1; j
++)
155 for (; i
< 40; i
++) {
157 for (pow
= 1, j
= i
; j
< len
- 1; j
++)
162 for (; i
< 256; i
++) {
164 for (pow
= 1, j
= i
; j
< len
- 1; j
++)
173 u32
r5_hash(const signed char *msg
, int len
)