2 * SPDX-License-Identifier: (BSD-2-Clause-FreeBSD AND RSA-MD)
4 * Copyright (c) 2010, 2013 Zheng Liu <lz@freebsd.org>
5 * Copyright (c) 2012, Vyacheslav Matyushin
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * The following notice applies to the code in ext2_half_md4():
35 * Copyright (C) 1990-2, RSA Data Security, Inc. All rights reserved.
37 * License to copy and use this software is granted provided that it
38 * is identified as the "RSA Data Security, Inc. MD4 Message-Digest
39 * Algorithm" in all material mentioning or referencing this software
42 * License is also granted to make and use derivative works provided
43 * that such works are identified as "derived from the RSA Data
44 * Security, Inc. MD4 Message-Digest Algorithm" in all material
45 * mentioning or referencing the derived work.
47 * RSA Data Security, Inc. makes no representations concerning either
48 * the merchantability of this software or the suitability of this
49 * software for any particular purpose. It is provided "as is"
50 * without express or implied warranty of any kind.
52 * These notices must be retained in any copies of any part of this
53 * documentation and/or software.
56 #include <sys/param.h>
57 #include <sys/systm.h>
59 #include <sys/vnode.h>
62 #include <sys/mount.h>
64 #include <fs/ext2fs/ext2fs.h>
65 #include <fs/ext2fs/fs.h>
66 #include <fs/ext2fs/htree.h>
67 #include <fs/ext2fs/inode.h>
68 #include <fs/ext2fs/ext2_mount.h>
69 #include <fs/ext2fs/ext2_extern.h>
71 SDT_PROVIDER_DECLARE(ext2fs);
74 * arg0: verbosity. Higher numbers give more verbose messages
75 * arg1: Textual message
77 SDT_PROBE_DEFINE2(ext2fs, , trace, hash, "int", "char*");
79 /* F, G, and H are MD4 functions */
80 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
81 #define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
82 #define H(x, y, z) ((x) ^ (y) ^ (z))
84 /* ROTATE_LEFT rotates x left n bits */
85 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
88 * FF, GG, and HH are transformations for rounds 1, 2, and 3.
89 * Rotation is separated from addition to prevent recomputation.
91 #define FF(a, b, c, d, x, s) { \
92 (a) += F ((b), (c), (d)) + (x); \
93 (a) = ROTATE_LEFT ((a), (s)); \
96 #define GG(a, b, c, d, x, s) { \
97 (a) += G ((b), (c), (d)) + (x) + (uint32_t)0x5A827999; \
98 (a) = ROTATE_LEFT ((a), (s)); \
101 #define HH(a, b, c, d, x, s) { \
102 (a) += H ((b), (c), (d)) + (x) + (uint32_t)0x6ED9EBA1; \
103 (a) = ROTATE_LEFT ((a), (s)); \
107 * MD4 basic transformation. It transforms state based on block.
109 * This is a half md4 algorithm since Linux uses this algorithm for dir
110 * index. This function is derived from the RSA Data Security, Inc. MD4
111 * Message-Digest Algorithm and was modified as necessary.
113 * The return value of this function is uint32_t in Linux, but actually we don't
114 * need to check this value, so in our version this function doesn't return any
118 ext2_half_md4(uint32_t hash[4], uint32_t data[8])
120 uint32_t a = hash[0], b = hash[1], c = hash[2], d = hash[3];
123 FF(a, b, c, d, data[0], 3);
124 FF(d, a, b, c, data[1], 7);
125 FF(c, d, a, b, data[2], 11);
126 FF(b, c, d, a, data[3], 19);
127 FF(a, b, c, d, data[4], 3);
128 FF(d, a, b, c, data[5], 7);
129 FF(c, d, a, b, data[6], 11);
130 FF(b, c, d, a, data[7], 19);
133 GG(a, b, c, d, data[1], 3);
134 GG(d, a, b, c, data[3], 5);
135 GG(c, d, a, b, data[5], 9);
136 GG(b, c, d, a, data[7], 13);
137 GG(a, b, c, d, data[0], 3);
138 GG(d, a, b, c, data[2], 5);
139 GG(c, d, a, b, data[4], 9);
140 GG(b, c, d, a, data[6], 13);
143 HH(a, b, c, d, data[3], 3);
144 HH(d, a, b, c, data[7], 9);
145 HH(c, d, a, b, data[2], 11);
146 HH(b, c, d, a, data[6], 15);
147 HH(a, b, c, d, data[1], 3);
148 HH(d, a, b, c, data[5], 9);
149 HH(c, d, a, b, data[0], 11);
150 HH(b, c, d, a, data[4], 15);
159 * Tiny Encryption Algorithm.
162 ext2_tea(uint32_t hash[4], uint32_t data[8])
164 uint32_t tea_delta = 0x9E3779B9;
166 uint32_t x = hash[0], y = hash[1];
172 x += ((y << 4) + data[0]) ^ (y + sum) ^ ((y >> 5) + data[1]);
173 y += ((x << 4) + data[2]) ^ (x + sum) ^ ((x >> 5) + data[3]);
182 ext2_legacy_hash(const char *name, int len, int unsigned_char)
184 uint32_t h0, h1 = 0x12A3FE2D, h2 = 0x37ABE8F9;
185 uint32_t multi = 0x6D22F5;
186 const unsigned char *uname = (const unsigned char *)name;
187 const signed char *sname = (const signed char *)name;
190 for (i = 0; i < len; i++) {
192 val = (u_int)*uname++;
196 h0 = h2 + (h1 ^ (val * multi));
207 ext2_prep_hashbuf(const char *src, int slen, uint32_t *dst, int dlen,
210 uint32_t padding = slen | (slen << 8) | (slen << 16) | (slen << 24);
212 const unsigned char *ubuf = (const unsigned char *)src;
213 const signed char *sbuf = (const signed char *)src;
224 for (i = 0; i < len; i++) {
226 buf_byte = (u_int)ubuf[i];
228 buf_byte = (int)sbuf[i];
238 dlen -= sizeof(uint32_t);
243 dlen -= sizeof(uint32_t);
247 dlen -= sizeof(uint32_t);
250 dlen -= sizeof(uint32_t);
255 ext2_htree_hash(const char *name, int len,
256 uint32_t *hash_seed, int hash_version,
257 uint32_t *hash_major, uint32_t *hash_minor)
261 uint32_t major = 0, minor = 0;
262 int unsigned_char = 0;
264 if (!name || !hash_major)
267 if (len < 1 || len > 255)
270 hash[0] = 0x67452301;
271 hash[1] = 0xEFCDAB89;
272 hash[2] = 0x98BADCFE;
273 hash[3] = 0x10325476;
276 memcpy(hash, hash_seed, sizeof(hash));
278 switch (hash_version) {
279 case EXT2_HTREE_TEA_UNSIGNED:
284 ext2_prep_hashbuf(name, len, data, 16, unsigned_char);
285 ext2_tea(hash, data);
292 case EXT2_HTREE_LEGACY_UNSIGNED:
295 case EXT2_HTREE_LEGACY:
296 major = ext2_legacy_hash(name, len, unsigned_char);
298 case EXT2_HTREE_HALF_MD4_UNSIGNED:
301 case EXT2_HTREE_HALF_MD4:
303 ext2_prep_hashbuf(name, len, data, 32, unsigned_char);
304 ext2_half_md4(hash, data);
312 SDT_PROBE2(ext2fs, , trace, hash, 1, "unexpected hash version");
317 if (major == (EXT2_HTREE_EOF << 1))
318 major = (EXT2_HTREE_EOF - 1) << 1;