2 * Copyright (C) 2002 by Theodore Ts'o
4 * This file is released under the GPL v2.
6 * This file may be redistributed under the terms of the GNU Public
11 * obdclass/hash.c is copied from ldiskfs/hash.c.
12 * ldiskfs is used by server only.
13 * obdclass is shared by both client and server, it should not depend on ldiskfs.
18 #ifdef HAVE_EXT4_LDISKFS
19 #include <ldiskfs/ldiskfs_jbd2.h>
21 #include <linux/jbd.h>
24 #include <linux/sched.h>
25 #ifdef HAVE_SERVER_SUPPORT
27 #ifdef HAVE_EXT4_LDISKFS
28 #include <ldiskfs/ldiskfs.h>
30 #include <linux/ldiskfs_fs.h>
34 # include <obd_class.h>
37 #define DELTA 0x9E3779B9
40 static void TEA_transform(__u32 buf[4], __u32 const in[])
43 __u32 b0 = buf[0], b1 = buf[1];
44 __u32 a = in[0], b = in[1], c = in[2], d = in[3];
49 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b);
50 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d);
57 /* F, G and H are basic MD4 functions: selection, majority, parity */
58 #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
59 #define G(x, y, z) (((x) & (y)) + (((x) ^ (y)) & (z)))
60 #define H(x, y, z) ((x) ^ (y) ^ (z))
63 * The generic round function. The application is so specific that
64 * we don't bother protecting all the arguments with parens, as is generally
65 * good macro practice, in favor of extra legibility.
66 * Rotation is separate from addition to prevent recomputation
68 #define ROUND(f, a, b, c, d, x, s) \
69 (a += f(b, c, d) + x, a = (a << s) | (a >> (32-s)))
71 #define K2 013240474631UL
72 #define K3 015666365641UL
75 * Basic cut-down MD4 transform. Returns only 32 bits of result.
77 static void halfMD4Transform (__u32 buf[4], __u32 const in[])
79 __u32 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
82 ROUND(F, a, b, c, d, in[0] + K1, 3);
83 ROUND(F, d, a, b, c, in[1] + K1, 7);
84 ROUND(F, c, d, a, b, in[2] + K1, 11);
85 ROUND(F, b, c, d, a, in[3] + K1, 19);
86 ROUND(F, a, b, c, d, in[4] + K1, 3);
87 ROUND(F, d, a, b, c, in[5] + K1, 7);
88 ROUND(F, c, d, a, b, in[6] + K1, 11);
89 ROUND(F, b, c, d, a, in[7] + K1, 19);
92 ROUND(G, a, b, c, d, in[1] + K2, 3);
93 ROUND(G, d, a, b, c, in[3] + K2, 5);
94 ROUND(G, c, d, a, b, in[5] + K2, 9);
95 ROUND(G, b, c, d, a, in[7] + K2, 13);
96 ROUND(G, a, b, c, d, in[0] + K2, 3);
97 ROUND(G, d, a, b, c, in[2] + K2, 5);
98 ROUND(G, c, d, a, b, in[4] + K2, 9);
99 ROUND(G, b, c, d, a, in[6] + K2, 13);
102 ROUND(H, a, b, c, d, in[3] + K3, 3);
103 ROUND(H, d, a, b, c, in[7] + K3, 9);
104 ROUND(H, c, d, a, b, in[2] + K3, 11);
105 ROUND(H, b, c, d, a, in[6] + K3, 15);
106 ROUND(H, a, b, c, d, in[1] + K3, 3);
107 ROUND(H, d, a, b, c, in[5] + K3, 9);
108 ROUND(H, c, d, a, b, in[0] + K3, 11);
109 ROUND(H, b, c, d, a, in[4] + K3, 15);
125 /* The old legacy hash */
126 static __u32 dx_hack_hash (const char *name, int len)
128 __u32 hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9;
130 __u32 hash = hash1 + (hash0 ^ (*name++ * 7152373));
132 if (hash & 0x80000000) hash -= 0x7fffffff;
139 static void str2hashbuf(const char *msg, int len, __u32 *buf, int num)
144 pad = (__u32)len | ((__u32)len << 8);
150 for (i=0; i < len; i++) {
153 val = msg[i] + (val << 8);
167 * Returns the hash of a filename. If len is 0 and name is NULL, then
168 * this function can be used to test whether or not a hash version is
171 * The seed is an 4 longword (32 bits) "secret" which can be used to
172 * uniquify a hash. If the seed is all zero's, then some default seed
175 * A particular hash version specifies whether or not the seed is
176 * represented, and whether or not the returned hash is 32 bits or 64
177 * bits. 32 bit hashes will return 0 for the minor hash.
179 int ldiskfsfs_dirhash(const char *name, int len, struct ldiskfs_dx_hash_info *hinfo)
182 __u32 minor_hash = 0;
187 /* Initialize the default seed for the hash checksum functions */
193 /* Check to see if the seed is all zero's */
195 for (i=0; i < 4; i++) {
200 memcpy(buf, hinfo->seed, sizeof(buf));
203 switch (hinfo->hash_version) {
204 case LDISKFS_DX_HASH_LEGACY:
205 hash = dx_hack_hash(name, len);
207 case LDISKFS_DX_HASH_HALF_MD4:
210 str2hashbuf(p, len, in, 8);
211 halfMD4Transform(buf, in);
218 case LDISKFS_DX_HASH_TEA:
221 str2hashbuf(p, len, in, 4);
222 TEA_transform(buf, in);
234 if (hash == (LDISKFS_HTREE_EOF << 1))
235 hash = (LDISKFS_HTREE_EOF-1) << 1;
237 hinfo->minor_hash = minor_hash;