2 * dirhash.c -- Calculate the hash of a directory entry
4 * Copyright (c) 2001 Daniel Phillips
6 * Copyright (c) 2002 Theodore Ts'o.
9 * This file may be redistributed under the terms of the GNU Library
10 * General Public License, version 2.
24 * Keyed 32-bit hash function using TEA in a Davis-Meyer function
26 * Hi = E Mi(Hi-1) + Hi-1
28 * (see Applied Cryptography, 2nd edition, p448).
30 * Jeremy Fitzhardinge <jeremy@zip.com.au> 1998
32 * This code is made available under the terms of the GPL
34 #define DELTA 0x9E3779B9
36 static void TEA_transform(__u32 buf[4], __u32 const in[])
39 __u32 b0 = buf[0], b1 = buf[1];
40 __u32 a = in[0], b = in[1], c = in[2], d = in[3];
45 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b);
46 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d);
53 /* F, G and H are basic MD4 functions: selection, majority, parity */
54 #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
55 #define G(x, y, z) (((x) & (y)) + (((x) ^ (y)) & (z)))
56 #define H(x, y, z) ((x) ^ (y) ^ (z))
59 * The generic round function. The application is so specific that
60 * we don't bother protecting all the arguments with parens, as is generally
61 * good macro practice, in favor of extra legibility.
62 * Rotation is separate from addition to prevent recomputation
64 #define ROUND(f, a, b, c, d, x, s) \
65 (a += f(b, c, d) + x, a = (a << s) | (a >> (32-s)))
67 #define K2 013240474631UL
68 #define K3 015666365641UL
71 * Basic cut-down MD4 transform. Returns only 32 bits of result.
73 static void halfMD4Transform (__u32 buf[4], __u32 const in[])
75 __u32 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
78 ROUND(F, a, b, c, d, in[0] + K1, 3);
79 ROUND(F, d, a, b, c, in[1] + K1, 7);
80 ROUND(F, c, d, a, b, in[2] + K1, 11);
81 ROUND(F, b, c, d, a, in[3] + K1, 19);
82 ROUND(F, a, b, c, d, in[4] + K1, 3);
83 ROUND(F, d, a, b, c, in[5] + K1, 7);
84 ROUND(F, c, d, a, b, in[6] + K1, 11);
85 ROUND(F, b, c, d, a, in[7] + K1, 19);
88 ROUND(G, a, b, c, d, in[1] + K2, 3);
89 ROUND(G, d, a, b, c, in[3] + K2, 5);
90 ROUND(G, c, d, a, b, in[5] + K2, 9);
91 ROUND(G, b, c, d, a, in[7] + K2, 13);
92 ROUND(G, a, b, c, d, in[0] + K2, 3);
93 ROUND(G, d, a, b, c, in[2] + K2, 5);
94 ROUND(G, c, d, a, b, in[4] + K2, 9);
95 ROUND(G, b, c, d, a, in[6] + K2, 13);
98 ROUND(H, a, b, c, d, in[3] + K3, 3);
99 ROUND(H, d, a, b, c, in[7] + K3, 9);
100 ROUND(H, c, d, a, b, in[2] + K3, 11);
101 ROUND(H, b, c, d, a, in[6] + K3, 15);
102 ROUND(H, a, b, c, d, in[1] + K3, 3);
103 ROUND(H, d, a, b, c, in[5] + K3, 9);
104 ROUND(H, c, d, a, b, in[0] + K3, 11);
105 ROUND(H, b, c, d, a, in[4] + K3, 15);
121 /* The old legacy hash */
122 static ext2_dirhash_t dx_hack_hash (const char *name, int len,
125 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9;
126 const unsigned char *ucp = (const unsigned char *) name;
127 const signed char *scp = (const signed char *) name;
135 hash = hash1 + (hash0 ^ (c * 7152373));
137 if (hash & 0x80000000) hash -= 0x7fffffff;
144 static void str2hashbuf(const char *msg, int len, __u32 *buf, int num,
149 const unsigned char *ucp = (const unsigned char *) msg;
150 const signed char *scp = (const signed char *) msg;
152 pad = (__u32)len | ((__u32)len << 8);
158 for (i=0; i < len; i++) {
164 val = c + (val << 8);
178 * Returns the hash of a filename. If len is 0 and name is NULL, then
179 * this function can be used to test whether or not a hash version is
182 * The seed is an 4 longword (32 bits) "secret" which can be used to
183 * uniquify a hash. If the seed is all zero's, then some default seed
186 * A particular hash version specifies whether or not the seed is
187 * represented, and whether or not the returned hash is 32 bits or 64
188 * bits. 32 bit hashes will return 0 for the minor hash.
190 * This function doesn't do any normalization or casefolding of the
191 * input string. To take charset encoding into account, use
195 errcode_t ext2fs_dirhash(int version, const char *name, int len,
197 ext2_dirhash_t *ret_hash,
198 ext2_dirhash_t *ret_minor_hash)
201 __u32 minor_hash = 0;
205 int unsigned_flag = 0;
207 /* Initialize the default seed for the hash checksum functions */
213 /* Check to see if the seed is all zero's */
215 for (i=0; i < 4; i++) {
220 memcpy(buf, seed, sizeof(buf));
224 case EXT2_HASH_LEGACY_UNSIGNED:
227 case EXT2_HASH_LEGACY:
228 hash = dx_hack_hash(name, len, unsigned_flag);
230 case EXT2_HASH_HALF_MD4_UNSIGNED:
233 case EXT2_HASH_HALF_MD4:
236 str2hashbuf(p, len, in, 8, unsigned_flag);
237 halfMD4Transform(buf, in);
244 case EXT2_HASH_TEA_UNSIGNED:
250 str2hashbuf(p, len, in, 4, unsigned_flag);
251 TEA_transform(buf, in);
260 return EXT2_ET_DIRHASH_UNSUPP;
262 *ret_hash = hash & ~1;
264 *ret_minor_hash = minor_hash;
269 * Returns the hash of a filename considering normalization and
270 * casefolding. This is a wrapper around ext2fs_dirhash with string
271 * encoding support based on the nls_table and the flags. Check
272 * ext2fs_dirhash for documentation on the input and output parameters.
274 errcode_t ext2fs_dirhash2(int version, const char *name, int len,
275 const struct ext2fs_nls_table *charset,
276 int hash_flags, const __u32 *seed,
277 ext2_dirhash_t *ret_hash,
278 ext2_dirhash_t *ret_minor_hash)
283 if (len && charset && (hash_flags & EXT4_CASEFOLD_FL)) {
286 dlen = charset->ops->casefold(charset,
287 (const unsigned char *) name, len,
288 (unsigned char *) buff, sizeof(buff));
295 r = ext2fs_dirhash(version, buff, dlen, seed, ret_hash,
301 return ext2fs_dirhash(version, name, len, seed, ret_hash,