blob: 5bc4dcd8fc03fbbb97ece6233c925634dc972fa8 [file] [log] [blame]
Chao Yu7c1a0002018-09-12 09:16:07 +08001// SPDX-License-Identifier: GPL-2.0
Jaegeuk Kim0a8165d2012-11-29 13:28:09 +09002/*
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +09003 * fs/f2fs/hash.c
4 *
5 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
6 * http://www.samsung.com/
7 *
8 * Portions of this code from linux/fs/ext3/hash.c
9 *
10 * Copyright (C) 2002 by Theodore Ts'o
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090011 */
12#include <linux/types.h>
13#include <linux/fs.h>
14#include <linux/f2fs_fs.h>
15#include <linux/cryptohash.h>
16#include <linux/pagemap.h>
Daniel Rosenberg2c2eb7a2019-07-23 16:05:29 -070017#include <linux/unicode.h>
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090018
19#include "f2fs.h"
20
21/*
22 * Hashing code copied from ext3
23 */
24#define DELTA 0x9E3779B9
25
26static void TEA_transform(unsigned int buf[4], unsigned int const in[])
27{
28 __u32 sum = 0;
29 __u32 b0 = buf[0], b1 = buf[1];
30 __u32 a = in[0], b = in[1], c = in[2], d = in[3];
31 int n = 16;
32
33 do {
34 sum += DELTA;
35 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b);
36 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d);
37 } while (--n);
38
39 buf[0] += b0;
40 buf[1] += b1;
41}
42
Jaegeuk Kim3304b562014-08-29 00:26:50 -070043static void str2hashbuf(const unsigned char *msg, size_t len,
44 unsigned int *buf, int num)
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090045{
46 unsigned pad, val;
47 int i;
48
49 pad = (__u32)len | ((__u32)len << 8);
50 pad |= pad << 16;
51
52 val = pad;
53 if (len > num * 4)
54 len = num * 4;
55 for (i = 0; i < len; i++) {
56 if ((i % 4) == 0)
57 val = pad;
58 val = msg[i] + (val << 8);
59 if ((i % 4) == 3) {
60 *buf++ = val;
61 val = pad;
62 num--;
63 }
64 }
65 if (--num >= 0)
66 *buf++ = val;
67 while (--num >= 0)
68 *buf++ = pad;
69}
70
Daniel Rosenberg2c2eb7a2019-07-23 16:05:29 -070071static f2fs_hash_t __f2fs_dentry_hash(const struct qstr *name_info,
Jaegeuk Kim6332cd32017-04-24 10:00:08 -070072 struct fscrypt_name *fname)
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090073{
Jaegeuk Kim2b506382012-12-26 14:39:50 +090074 __u32 hash;
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090075 f2fs_hash_t f2fs_hash;
Jaegeuk Kim3304b562014-08-29 00:26:50 -070076 const unsigned char *p;
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090077 __u32 in[8], buf[4];
Jaegeuk Kim3304b562014-08-29 00:26:50 -070078 const unsigned char *name = name_info->name;
Gu Zhengeee61602014-06-24 18:21:23 +080079 size_t len = name_info->len;
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090080
Jaegeuk Kim6332cd32017-04-24 10:00:08 -070081 /* encrypted bigname case */
82 if (fname && !fname->disk_name.name)
83 return cpu_to_le32(fname->hash);
84
Jaegeuk Kimeaa693f2015-04-26 00:15:29 -070085 if (is_dot_dotdot(name_info))
Namjae Jeon38e0abd2012-12-13 23:44:11 +090086 return 0;
87
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090088 /* Initialize the default seed for the hash checksum functions */
89 buf[0] = 0x67452301;
90 buf[1] = 0xefcdab89;
91 buf[2] = 0x98badcfe;
92 buf[3] = 0x10325476;
93
94 p = name;
Leon Romanovsky9836b8b2012-12-27 19:55:46 +020095 while (1) {
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090096 str2hashbuf(p, len, in, 4);
97 TEA_transform(buf, in);
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +090098 p += 16;
Leon Romanovsky9836b8b2012-12-27 19:55:46 +020099 if (len <= 16)
100 break;
101 len -= 16;
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +0900102 }
103 hash = buf[0];
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900104 f2fs_hash = cpu_to_le32(hash & ~F2FS_HASH_COL_BIT);
Jaegeuk Kim6b4ea012012-11-14 16:59:04 +0900105 return f2fs_hash;
106}
Daniel Rosenberg2c2eb7a2019-07-23 16:05:29 -0700107
108f2fs_hash_t f2fs_dentry_hash(const struct inode *dir,
109 const struct qstr *name_info, struct fscrypt_name *fname)
110{
111#ifdef CONFIG_UNICODE
112 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
113 const struct unicode_map *um = sbi->s_encoding;
114 int r, dlen;
115 unsigned char *buff;
116 struct qstr folded;
117
118 if (!name_info->len || !IS_CASEFOLDED(dir))
119 goto opaque_seq;
120
121 buff = f2fs_kzalloc(sbi, sizeof(char) * PATH_MAX, GFP_KERNEL);
122 if (!buff)
123 return -ENOMEM;
124
125 dlen = utf8_casefold(um, name_info, buff, PATH_MAX);
126 if (dlen < 0) {
127 kvfree(buff);
128 goto opaque_seq;
129 }
130 folded.name = buff;
131 folded.len = dlen;
132 r = __f2fs_dentry_hash(&folded, fname);
133
134 kvfree(buff);
135 return r;
136
137opaque_seq:
138#endif
139 return __f2fs_dentry_hash(name_info, fname);
140}