Commit | Line | Data |
---|---|---|
0a8165d7 | 1 | /* |
6b4ea016 JK |
2 | * fs/f2fs/dir.c |
3 | * | |
4 | * Copyright (c) 2012 Samsung Electronics Co., Ltd. | |
5 | * http://www.samsung.com/ | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU General Public License version 2 as | |
9 | * published by the Free Software Foundation. | |
10 | */ | |
11 | #include <linux/fs.h> | |
12 | #include <linux/f2fs_fs.h> | |
13 | #include "f2fs.h" | |
398b1ac5 | 14 | #include "node.h" |
6b4ea016 | 15 | #include "acl.h" |
8ae8f162 | 16 | #include "xattr.h" |
6b4ea016 JK |
17 | |
18 | static unsigned long dir_blocks(struct inode *inode) | |
19 | { | |
20 | return ((unsigned long long) (i_size_read(inode) + PAGE_CACHE_SIZE - 1)) | |
21 | >> PAGE_CACHE_SHIFT; | |
22 | } | |
23 | ||
38431545 | 24 | static unsigned int dir_buckets(unsigned int level, int dir_level) |
6b4ea016 | 25 | { |
bfec07d0 | 26 | if (level + dir_level < MAX_DIR_HASH_DEPTH / 2) |
38431545 | 27 | return 1 << (level + dir_level); |
6b4ea016 | 28 | else |
bfec07d0 | 29 | return MAX_DIR_BUCKETS; |
6b4ea016 JK |
30 | } |
31 | ||
32 | static unsigned int bucket_blocks(unsigned int level) | |
33 | { | |
34 | if (level < MAX_DIR_HASH_DEPTH / 2) | |
35 | return 2; | |
36 | else | |
37 | return 4; | |
38 | } | |
39 | ||
dbeacf02 | 40 | unsigned char f2fs_filetype_table[F2FS_FT_MAX] = { |
6b4ea016 JK |
41 | [F2FS_FT_UNKNOWN] = DT_UNKNOWN, |
42 | [F2FS_FT_REG_FILE] = DT_REG, | |
43 | [F2FS_FT_DIR] = DT_DIR, | |
44 | [F2FS_FT_CHRDEV] = DT_CHR, | |
45 | [F2FS_FT_BLKDEV] = DT_BLK, | |
46 | [F2FS_FT_FIFO] = DT_FIFO, | |
47 | [F2FS_FT_SOCK] = DT_SOCK, | |
48 | [F2FS_FT_SYMLINK] = DT_LNK, | |
49 | }; | |
50 | ||
51 | #define S_SHIFT 12 | |
52 | static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = { | |
53 | [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE, | |
54 | [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR, | |
55 | [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV, | |
56 | [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV, | |
57 | [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO, | |
58 | [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK, | |
59 | [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK, | |
60 | }; | |
61 | ||
510022a8 | 62 | void set_de_type(struct f2fs_dir_entry *de, umode_t mode) |
6b4ea016 | 63 | { |
6b4ea016 JK |
64 | de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT]; |
65 | } | |
66 | ||
38431545 JK |
67 | static unsigned long dir_block_index(unsigned int level, |
68 | int dir_level, unsigned int idx) | |
6b4ea016 JK |
69 | { |
70 | unsigned long i; | |
71 | unsigned long bidx = 0; | |
72 | ||
73 | for (i = 0; i < level; i++) | |
38431545 | 74 | bidx += dir_buckets(i, dir_level) * bucket_blocks(i); |
6b4ea016 JK |
75 | bidx += idx * bucket_blocks(level); |
76 | return bidx; | |
77 | } | |
78 | ||
4e6ebf6d | 79 | static bool early_match_name(size_t namelen, f2fs_hash_t namehash, |
eee6160f | 80 | struct f2fs_dir_entry *de) |
6b4ea016 JK |
81 | { |
82 | if (le16_to_cpu(de->name_len) != namelen) | |
83 | return false; | |
84 | ||
25ca923b | 85 | if (de->hash_code != namehash) |
6b4ea016 JK |
86 | return false; |
87 | ||
88 | return true; | |
89 | } | |
90 | ||
91 | static struct f2fs_dir_entry *find_in_block(struct page *dentry_page, | |
4e6ebf6d JK |
92 | struct qstr *name, int *max_slots, |
93 | struct page **res_page) | |
94 | { | |
95 | struct f2fs_dentry_block *dentry_blk; | |
96 | struct f2fs_dir_entry *de; | |
7b3cd7d6 | 97 | struct f2fs_dentry_ptr d; |
4e6ebf6d JK |
98 | |
99 | dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page); | |
7b3cd7d6 JK |
100 | |
101 | make_dentry_ptr(&d, (void *)dentry_blk, 1); | |
102 | de = find_target_dentry(name, max_slots, &d); | |
103 | ||
4e6ebf6d JK |
104 | if (de) |
105 | *res_page = dentry_page; | |
106 | else | |
107 | kunmap(dentry_page); | |
108 | ||
109 | /* | |
110 | * For the most part, it should be a bug when name_len is zero. | |
111 | * We stop here for figuring out where the bugs has occurred. | |
112 | */ | |
7b3cd7d6 | 113 | f2fs_bug_on(F2FS_P_SB(dentry_page), d.max < 0); |
4e6ebf6d JK |
114 | return de; |
115 | } | |
116 | ||
117 | struct f2fs_dir_entry *find_target_dentry(struct qstr *name, int *max_slots, | |
7b3cd7d6 | 118 | struct f2fs_dentry_ptr *d) |
6b4ea016 JK |
119 | { |
120 | struct f2fs_dir_entry *de; | |
5d0c6671 | 121 | unsigned long bit_pos = 0; |
4e6ebf6d | 122 | f2fs_hash_t namehash = f2fs_dentry_hash(name); |
5d0c6671 | 123 | int max_len = 0; |
6b4ea016 | 124 | |
7b3cd7d6 JK |
125 | if (max_slots) |
126 | *max_slots = 0; | |
127 | while (bit_pos < d->max) { | |
128 | if (!test_bit_le(bit_pos, d->bitmap)) { | |
5d0c6671 | 129 | bit_pos++; |
bda19076 | 130 | max_len++; |
5d0c6671 JK |
131 | continue; |
132 | } | |
bda19076 | 133 | |
7b3cd7d6 | 134 | de = &d->dentry[bit_pos]; |
4e6ebf6d | 135 | if (early_match_name(name->len, namehash, de) && |
7b3cd7d6 | 136 | !memcmp(d->filename[bit_pos], name->name, name->len)) |
4e6ebf6d JK |
137 | goto found; |
138 | ||
bda19076 | 139 | if (max_slots && max_len > *max_slots) |
5d0c6671 | 140 | *max_slots = max_len; |
bda19076 | 141 | max_len = 0; |
81e366f8 | 142 | |
4e6ebf6d JK |
143 | /* remain bug on condition */ |
144 | if (unlikely(!de->name_len)) | |
7b3cd7d6 | 145 | d->max = -1; |
81e366f8 | 146 | |
5d0c6671 | 147 | bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); |
6b4ea016 JK |
148 | } |
149 | ||
150 | de = NULL; | |
6b4ea016 | 151 | found: |
7b3cd7d6 | 152 | if (max_slots && max_len > *max_slots) |
5d0c6671 | 153 | *max_slots = max_len; |
6b4ea016 JK |
154 | return de; |
155 | } | |
156 | ||
157 | static struct f2fs_dir_entry *find_in_level(struct inode *dir, | |
eee6160f | 158 | unsigned int level, struct qstr *name, |
6b4ea016 JK |
159 | f2fs_hash_t namehash, struct page **res_page) |
160 | { | |
eee6160f | 161 | int s = GET_DENTRY_SLOTS(name->len); |
6b4ea016 JK |
162 | unsigned int nbucket, nblock; |
163 | unsigned int bidx, end_block; | |
164 | struct page *dentry_page; | |
165 | struct f2fs_dir_entry *de = NULL; | |
166 | bool room = false; | |
4e6ebf6d | 167 | int max_slots; |
6b4ea016 | 168 | |
9850cf4a | 169 | f2fs_bug_on(F2FS_I_SB(dir), level > MAX_DIR_HASH_DEPTH); |
6b4ea016 | 170 | |
38431545 | 171 | nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level); |
6b4ea016 JK |
172 | nblock = bucket_blocks(level); |
173 | ||
38431545 JK |
174 | bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level, |
175 | le32_to_cpu(namehash) % nbucket); | |
6b4ea016 JK |
176 | end_block = bidx + nblock; |
177 | ||
178 | for (; bidx < end_block; bidx++) { | |
179 | /* no need to allocate new dentry pages to all the indices */ | |
43f3eae1 | 180 | dentry_page = find_data_page(dir, bidx); |
6b4ea016 JK |
181 | if (IS_ERR(dentry_page)) { |
182 | room = true; | |
183 | continue; | |
184 | } | |
185 | ||
4e6ebf6d | 186 | de = find_in_block(dentry_page, name, &max_slots, res_page); |
6b4ea016 JK |
187 | if (de) |
188 | break; | |
189 | ||
190 | if (max_slots >= s) | |
191 | room = true; | |
192 | f2fs_put_page(dentry_page, 0); | |
193 | } | |
194 | ||
195 | if (!de && room && F2FS_I(dir)->chash != namehash) { | |
196 | F2FS_I(dir)->chash = namehash; | |
197 | F2FS_I(dir)->clevel = level; | |
198 | } | |
199 | ||
200 | return de; | |
201 | } | |
202 | ||
203 | /* | |
204 | * Find an entry in the specified directory with the wanted name. | |
205 | * It returns the page where the entry was found (as a parameter - res_page), | |
206 | * and the entry itself. Page is returned mapped and unlocked. | |
207 | * Entry is guaranteed to be valid. | |
208 | */ | |
209 | struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir, | |
210 | struct qstr *child, struct page **res_page) | |
211 | { | |
6b4ea016 JK |
212 | unsigned long npages = dir_blocks(dir); |
213 | struct f2fs_dir_entry *de = NULL; | |
214 | f2fs_hash_t name_hash; | |
215 | unsigned int max_depth; | |
216 | unsigned int level; | |
217 | ||
b1f73b79 YZ |
218 | *res_page = NULL; |
219 | ||
622f28ae CY |
220 | if (f2fs_has_inline_dentry(dir)) |
221 | return find_in_inline_dir(dir, child, res_page); | |
222 | ||
6b4ea016 JK |
223 | if (npages == 0) |
224 | return NULL; | |
225 | ||
eee6160f | 226 | name_hash = f2fs_dentry_hash(child); |
6b4ea016 JK |
227 | max_depth = F2FS_I(dir)->i_current_depth; |
228 | ||
229 | for (level = 0; level < max_depth; level++) { | |
eee6160f | 230 | de = find_in_level(dir, level, child, name_hash, res_page); |
6b4ea016 JK |
231 | if (de) |
232 | break; | |
233 | } | |
234 | if (!de && F2FS_I(dir)->chash != name_hash) { | |
235 | F2FS_I(dir)->chash = name_hash; | |
236 | F2FS_I(dir)->clevel = level - 1; | |
237 | } | |
238 | return de; | |
239 | } | |
240 | ||
241 | struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p) | |
242 | { | |
4777f86b NJ |
243 | struct page *page; |
244 | struct f2fs_dir_entry *de; | |
245 | struct f2fs_dentry_block *dentry_blk; | |
6b4ea016 | 246 | |
622f28ae CY |
247 | if (f2fs_has_inline_dentry(dir)) |
248 | return f2fs_parent_inline_dir(dir, p); | |
249 | ||
6b4ea016 JK |
250 | page = get_lock_data_page(dir, 0); |
251 | if (IS_ERR(page)) | |
252 | return NULL; | |
253 | ||
254 | dentry_blk = kmap(page); | |
255 | de = &dentry_blk->dentry[1]; | |
256 | *p = page; | |
257 | unlock_page(page); | |
258 | return de; | |
259 | } | |
260 | ||
261 | ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr) | |
262 | { | |
263 | ino_t res = 0; | |
264 | struct f2fs_dir_entry *de; | |
265 | struct page *page; | |
266 | ||
267 | de = f2fs_find_entry(dir, qstr, &page); | |
268 | if (de) { | |
269 | res = le32_to_cpu(de->ino); | |
9486ba44 | 270 | f2fs_dentry_kunmap(dir, page); |
6b4ea016 JK |
271 | f2fs_put_page(page, 0); |
272 | } | |
273 | ||
274 | return res; | |
275 | } | |
276 | ||
277 | void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de, | |
278 | struct page *page, struct inode *inode) | |
279 | { | |
59a06155 | 280 | enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA; |
6b4ea016 | 281 | lock_page(page); |
59a06155 | 282 | f2fs_wait_on_page_writeback(page, type); |
6b4ea016 | 283 | de->ino = cpu_to_le32(inode->i_ino); |
510022a8 | 284 | set_de_type(de, inode->i_mode); |
5df1f1da | 285 | f2fs_dentry_kunmap(dir, page); |
6b4ea016 JK |
286 | set_page_dirty(page); |
287 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
288 | mark_inode_dirty(dir); | |
6666e6aa | 289 | |
6b4ea016 | 290 | f2fs_put_page(page, 1); |
6b4ea016 JK |
291 | } |
292 | ||
44a83ff6 | 293 | static void init_dent_inode(const struct qstr *name, struct page *ipage) |
6b4ea016 | 294 | { |
58bfaf44 | 295 | struct f2fs_inode *ri; |
6b4ea016 | 296 | |
54b591df JK |
297 | f2fs_wait_on_page_writeback(ipage, NODE); |
298 | ||
53dc9a67 | 299 | /* copy name info. to this inode page */ |
58bfaf44 JK |
300 | ri = F2FS_INODE(ipage); |
301 | ri->i_namelen = cpu_to_le32(name->len); | |
302 | memcpy(ri->i_name, name->name, name->len); | |
6b4ea016 JK |
303 | set_page_dirty(ipage); |
304 | } | |
305 | ||
1cd14caf JK |
306 | int update_dent_inode(struct inode *inode, const struct qstr *name) |
307 | { | |
1cd14caf JK |
308 | struct page *page; |
309 | ||
4081363f | 310 | page = get_node_page(F2FS_I_SB(inode), inode->i_ino); |
1cd14caf JK |
311 | if (IS_ERR(page)) |
312 | return PTR_ERR(page); | |
313 | ||
314 | init_dent_inode(name, page); | |
315 | f2fs_put_page(page, 1); | |
316 | ||
317 | return 0; | |
318 | } | |
319 | ||
062a3e7b JK |
320 | void do_make_empty_dir(struct inode *inode, struct inode *parent, |
321 | struct f2fs_dentry_ptr *d) | |
322 | { | |
323 | struct f2fs_dir_entry *de; | |
324 | ||
325 | de = &d->dentry[0]; | |
326 | de->name_len = cpu_to_le16(1); | |
327 | de->hash_code = 0; | |
328 | de->ino = cpu_to_le32(inode->i_ino); | |
329 | memcpy(d->filename[0], ".", 1); | |
510022a8 | 330 | set_de_type(de, inode->i_mode); |
062a3e7b JK |
331 | |
332 | de = &d->dentry[1]; | |
333 | de->hash_code = 0; | |
334 | de->name_len = cpu_to_le16(2); | |
335 | de->ino = cpu_to_le32(parent->i_ino); | |
336 | memcpy(d->filename[1], "..", 2); | |
cb58463b | 337 | set_de_type(de, parent->i_mode); |
062a3e7b JK |
338 | |
339 | test_and_set_bit_le(0, (void *)d->bitmap); | |
340 | test_and_set_bit_le(1, (void *)d->bitmap); | |
341 | } | |
342 | ||
44a83ff6 JK |
343 | static int make_empty_dir(struct inode *inode, |
344 | struct inode *parent, struct page *page) | |
39936837 JK |
345 | { |
346 | struct page *dentry_page; | |
347 | struct f2fs_dentry_block *dentry_blk; | |
062a3e7b | 348 | struct f2fs_dentry_ptr d; |
39936837 | 349 | |
622f28ae CY |
350 | if (f2fs_has_inline_dentry(inode)) |
351 | return make_empty_inline_dir(inode, parent, page); | |
352 | ||
44a83ff6 | 353 | dentry_page = get_new_data_page(inode, page, 0, true); |
39936837 JK |
354 | if (IS_ERR(dentry_page)) |
355 | return PTR_ERR(dentry_page); | |
356 | ||
1c3bb978 | 357 | dentry_blk = kmap_atomic(dentry_page); |
39936837 | 358 | |
062a3e7b JK |
359 | make_dentry_ptr(&d, (void *)dentry_blk, 1); |
360 | do_make_empty_dir(inode, parent, &d); | |
39936837 | 361 | |
1c3bb978 | 362 | kunmap_atomic(dentry_blk); |
39936837 JK |
363 | |
364 | set_page_dirty(dentry_page); | |
365 | f2fs_put_page(dentry_page, 1); | |
366 | return 0; | |
367 | } | |
368 | ||
bce8d112 JK |
369 | struct page *init_inode_metadata(struct inode *inode, struct inode *dir, |
370 | const struct qstr *name, struct page *dpage) | |
6b4ea016 | 371 | { |
44a83ff6 JK |
372 | struct page *page; |
373 | int err; | |
374 | ||
b97a9b5d | 375 | if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) { |
a014e037 | 376 | page = new_inode_page(inode); |
44a83ff6 JK |
377 | if (IS_ERR(page)) |
378 | return page; | |
6b4ea016 JK |
379 | |
380 | if (S_ISDIR(inode->i_mode)) { | |
44a83ff6 JK |
381 | err = make_empty_dir(inode, dir, page); |
382 | if (err) | |
383 | goto error; | |
6b4ea016 JK |
384 | } |
385 | ||
bce8d112 | 386 | err = f2fs_init_acl(inode, dir, page, dpage); |
44a83ff6 | 387 | if (err) |
a8865372 | 388 | goto put_error; |
44a83ff6 | 389 | |
8ae8f162 JK |
390 | err = f2fs_init_security(inode, dir, name, page); |
391 | if (err) | |
a8865372 | 392 | goto put_error; |
fcc85a4d JK |
393 | |
394 | if (f2fs_encrypted_inode(dir) && f2fs_may_encrypt(inode)) { | |
395 | err = f2fs_inherit_context(dir, inode, page); | |
396 | if (err) | |
397 | goto put_error; | |
398 | } | |
6b4ea016 | 399 | } else { |
4081363f | 400 | page = get_node_page(F2FS_I_SB(dir), inode->i_ino); |
44a83ff6 JK |
401 | if (IS_ERR(page)) |
402 | return page; | |
403 | ||
44a83ff6 | 404 | set_cold_node(inode, page); |
6b4ea016 | 405 | } |
44a83ff6 | 406 | |
b97a9b5d JK |
407 | if (name) |
408 | init_dent_inode(name, page); | |
44a83ff6 | 409 | |
83d5d6f6 JK |
410 | /* |
411 | * This file should be checkpointed during fsync. | |
412 | * We lost i_pino from now on. | |
413 | */ | |
6b4ea016 | 414 | if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) { |
354a3399 | 415 | file_lost_pino(inode); |
50732df0 CY |
416 | /* |
417 | * If link the tmpfile to alias through linkat path, | |
418 | * we should remove this inode from orphan list. | |
419 | */ | |
420 | if (inode->i_nlink == 0) | |
4081363f | 421 | remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino); |
6b4ea016 | 422 | inc_nlink(inode); |
6b4ea016 | 423 | } |
44a83ff6 JK |
424 | return page; |
425 | ||
a8865372 | 426 | put_error: |
44a83ff6 | 427 | f2fs_put_page(page, 1); |
90d72459 | 428 | error: |
bd859c65 JK |
429 | /* once the failed inode becomes a bad inode, i_mode is S_IFREG */ |
430 | truncate_inode_pages(&inode->i_data, 0); | |
764aa3e9 | 431 | truncate_blocks(inode, 0, false); |
bd859c65 | 432 | remove_dirty_dir_inode(inode); |
44a83ff6 JK |
433 | remove_inode_page(inode); |
434 | return ERR_PTR(err); | |
6b4ea016 JK |
435 | } |
436 | ||
dbeacf02 | 437 | void update_parent_metadata(struct inode *dir, struct inode *inode, |
6b4ea016 JK |
438 | unsigned int current_depth) |
439 | { | |
510022a8 | 440 | if (inode && is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) { |
6b4ea016 JK |
441 | if (S_ISDIR(inode->i_mode)) { |
442 | inc_nlink(dir); | |
699489bb | 443 | set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR); |
6b4ea016 JK |
444 | } |
445 | clear_inode_flag(F2FS_I(inode), FI_NEW_INODE); | |
446 | } | |
447 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
a18ff063 JK |
448 | mark_inode_dirty(dir); |
449 | ||
6b4ea016 JK |
450 | if (F2FS_I(dir)->i_current_depth != current_depth) { |
451 | F2FS_I(dir)->i_current_depth = current_depth; | |
699489bb | 452 | set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR); |
6b4ea016 JK |
453 | } |
454 | ||
510022a8 | 455 | if (inode && is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) |
6b4ea016 JK |
456 | clear_inode_flag(F2FS_I(inode), FI_INC_LINK); |
457 | } | |
458 | ||
a82afa20 | 459 | int room_for_filename(const void *bitmap, int slots, int max_slots) |
6b4ea016 JK |
460 | { |
461 | int bit_start = 0; | |
462 | int zero_start, zero_end; | |
463 | next: | |
a82afa20 JK |
464 | zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start); |
465 | if (zero_start >= max_slots) | |
466 | return max_slots; | |
467 | ||
468 | zero_end = find_next_bit_le(bitmap, max_slots, zero_start); | |
6b4ea016 JK |
469 | if (zero_end - zero_start >= slots) |
470 | return zero_start; | |
471 | ||
472 | bit_start = zero_end + 1; | |
473 | ||
a82afa20 JK |
474 | if (zero_end + 1 >= max_slots) |
475 | return max_slots; | |
6b4ea016 JK |
476 | goto next; |
477 | } | |
478 | ||
510022a8 | 479 | void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d, |
3b4d732a CY |
480 | const struct qstr *name, f2fs_hash_t name_hash, |
481 | unsigned int bit_pos) | |
482 | { | |
483 | struct f2fs_dir_entry *de; | |
484 | int slots = GET_DENTRY_SLOTS(name->len); | |
485 | int i; | |
486 | ||
487 | de = &d->dentry[bit_pos]; | |
488 | de->hash_code = name_hash; | |
489 | de->name_len = cpu_to_le16(name->len); | |
490 | memcpy(d->filename[bit_pos], name->name, name->len); | |
510022a8 JK |
491 | de->ino = cpu_to_le32(ino); |
492 | set_de_type(de, mode); | |
3b4d732a CY |
493 | for (i = 0; i < slots; i++) |
494 | test_and_set_bit_le(bit_pos + i, (void *)d->bitmap); | |
495 | } | |
496 | ||
39936837 | 497 | /* |
4f4124d0 CY |
498 | * Caller should grab and release a rwsem by calling f2fs_lock_op() and |
499 | * f2fs_unlock_op(). | |
39936837 | 500 | */ |
6c311ec6 | 501 | int __f2fs_add_link(struct inode *dir, const struct qstr *name, |
510022a8 | 502 | struct inode *inode, nid_t ino, umode_t mode) |
6b4ea016 JK |
503 | { |
504 | unsigned int bit_pos; | |
505 | unsigned int level; | |
506 | unsigned int current_depth; | |
507 | unsigned long bidx, block; | |
508 | f2fs_hash_t dentry_hash; | |
6b4ea016 | 509 | unsigned int nbucket, nblock; |
b7f7a5e0 | 510 | size_t namelen = name->len; |
6b4ea016 JK |
511 | struct page *dentry_page = NULL; |
512 | struct f2fs_dentry_block *dentry_blk = NULL; | |
3b4d732a | 513 | struct f2fs_dentry_ptr d; |
457d08ee | 514 | int slots = GET_DENTRY_SLOTS(namelen); |
510022a8 | 515 | struct page *page = NULL; |
6b4ea016 | 516 | int err = 0; |
6b4ea016 | 517 | |
622f28ae | 518 | if (f2fs_has_inline_dentry(dir)) { |
510022a8 | 519 | err = f2fs_add_inline_entry(dir, name, inode, ino, mode); |
622f28ae CY |
520 | if (!err || err != -EAGAIN) |
521 | return err; | |
522 | else | |
523 | err = 0; | |
524 | } | |
525 | ||
eee6160f | 526 | dentry_hash = f2fs_dentry_hash(name); |
6b4ea016 JK |
527 | level = 0; |
528 | current_depth = F2FS_I(dir)->i_current_depth; | |
529 | if (F2FS_I(dir)->chash == dentry_hash) { | |
530 | level = F2FS_I(dir)->clevel; | |
531 | F2FS_I(dir)->chash = 0; | |
532 | } | |
533 | ||
534 | start: | |
cfb271d4 | 535 | if (unlikely(current_depth == MAX_DIR_HASH_DEPTH)) |
6b4ea016 JK |
536 | return -ENOSPC; |
537 | ||
538 | /* Increase the depth, if required */ | |
539 | if (level == current_depth) | |
540 | ++current_depth; | |
541 | ||
38431545 | 542 | nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level); |
6b4ea016 JK |
543 | nblock = bucket_blocks(level); |
544 | ||
38431545 JK |
545 | bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level, |
546 | (le32_to_cpu(dentry_hash) % nbucket)); | |
6b4ea016 JK |
547 | |
548 | for (block = bidx; block <= (bidx + nblock - 1); block++) { | |
64aa7ed9 | 549 | dentry_page = get_new_data_page(dir, NULL, block, true); |
39936837 | 550 | if (IS_ERR(dentry_page)) |
6b4ea016 | 551 | return PTR_ERR(dentry_page); |
6b4ea016 JK |
552 | |
553 | dentry_blk = kmap(dentry_page); | |
a82afa20 JK |
554 | bit_pos = room_for_filename(&dentry_blk->dentry_bitmap, |
555 | slots, NR_DENTRY_IN_BLOCK); | |
6b4ea016 JK |
556 | if (bit_pos < NR_DENTRY_IN_BLOCK) |
557 | goto add_dentry; | |
558 | ||
559 | kunmap(dentry_page); | |
560 | f2fs_put_page(dentry_page, 1); | |
6b4ea016 JK |
561 | } |
562 | ||
563 | /* Move to next level to find the empty slot for new dentry */ | |
564 | ++level; | |
565 | goto start; | |
566 | add_dentry: | |
3cb5ad15 | 567 | f2fs_wait_on_page_writeback(dentry_page, DATA); |
6b4ea016 | 568 | |
510022a8 JK |
569 | if (inode) { |
570 | down_write(&F2FS_I(inode)->i_sem); | |
571 | page = init_inode_metadata(inode, dir, name, NULL); | |
572 | if (IS_ERR(page)) { | |
573 | err = PTR_ERR(page); | |
574 | goto fail; | |
575 | } | |
44a83ff6 | 576 | } |
3b4d732a CY |
577 | |
578 | make_dentry_ptr(&d, (void *)dentry_blk, 1); | |
510022a8 | 579 | f2fs_update_dentry(ino, mode, &d, name, dentry_hash, bit_pos); |
3b4d732a | 580 | |
6b4ea016 | 581 | set_page_dirty(dentry_page); |
6666e6aa | 582 | |
510022a8 JK |
583 | if (inode) { |
584 | /* we don't need to mark_inode_dirty now */ | |
585 | F2FS_I(inode)->i_pino = dir->i_ino; | |
586 | update_inode(inode, page); | |
587 | f2fs_put_page(page, 1); | |
588 | } | |
44a83ff6 JK |
589 | |
590 | update_parent_metadata(dir, inode, current_depth); | |
6b4ea016 | 591 | fail: |
510022a8 JK |
592 | if (inode) |
593 | up_write(&F2FS_I(inode)->i_sem); | |
d928bfbf | 594 | |
924a2ddb JK |
595 | if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) { |
596 | update_inode_page(dir); | |
597 | clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR); | |
598 | } | |
6b4ea016 JK |
599 | kunmap(dentry_page); |
600 | f2fs_put_page(dentry_page, 1); | |
6b4ea016 JK |
601 | return err; |
602 | } | |
603 | ||
b97a9b5d JK |
604 | int f2fs_do_tmpfile(struct inode *inode, struct inode *dir) |
605 | { | |
606 | struct page *page; | |
607 | int err = 0; | |
608 | ||
609 | down_write(&F2FS_I(inode)->i_sem); | |
bce8d112 | 610 | page = init_inode_metadata(inode, dir, NULL, NULL); |
b97a9b5d JK |
611 | if (IS_ERR(page)) { |
612 | err = PTR_ERR(page); | |
613 | goto fail; | |
614 | } | |
615 | /* we don't need to mark_inode_dirty now */ | |
616 | update_inode(inode, page); | |
617 | f2fs_put_page(page, 1); | |
618 | ||
619 | clear_inode_flag(F2FS_I(inode), FI_NEW_INODE); | |
620 | fail: | |
621 | up_write(&F2FS_I(inode)->i_sem); | |
622 | return err; | |
623 | } | |
624 | ||
dbeacf02 CY |
625 | void f2fs_drop_nlink(struct inode *dir, struct inode *inode, struct page *page) |
626 | { | |
627 | struct f2fs_sb_info *sbi = F2FS_I_SB(dir); | |
628 | ||
629 | down_write(&F2FS_I(inode)->i_sem); | |
630 | ||
631 | if (S_ISDIR(inode->i_mode)) { | |
632 | drop_nlink(dir); | |
633 | if (page) | |
634 | update_inode(dir, page); | |
635 | else | |
636 | update_inode_page(dir); | |
637 | } | |
638 | inode->i_ctime = CURRENT_TIME; | |
639 | ||
640 | drop_nlink(inode); | |
641 | if (S_ISDIR(inode->i_mode)) { | |
642 | drop_nlink(inode); | |
643 | i_size_write(inode, 0); | |
644 | } | |
645 | up_write(&F2FS_I(inode)->i_sem); | |
646 | update_inode_page(inode); | |
647 | ||
648 | if (inode->i_nlink == 0) | |
649 | add_orphan_inode(sbi, inode->i_ino); | |
650 | else | |
651 | release_orphan_inode(sbi); | |
652 | } | |
653 | ||
0a8165d7 | 654 | /* |
e1c42045 | 655 | * It only removes the dentry from the dentry page, corresponding name |
6b4ea016 JK |
656 | * entry in name page does not need to be touched during deletion. |
657 | */ | |
658 | void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page, | |
dbeacf02 | 659 | struct inode *dir, struct inode *inode) |
6b4ea016 JK |
660 | { |
661 | struct f2fs_dentry_block *dentry_blk; | |
662 | unsigned int bit_pos; | |
457d08ee | 663 | int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len)); |
6b4ea016 JK |
664 | int i; |
665 | ||
622f28ae CY |
666 | if (f2fs_has_inline_dentry(dir)) |
667 | return f2fs_delete_inline_entry(dentry, page, dir, inode); | |
668 | ||
6b4ea016 | 669 | lock_page(page); |
3cb5ad15 | 670 | f2fs_wait_on_page_writeback(page, DATA); |
6b4ea016 | 671 | |
1c3bb978 GZ |
672 | dentry_blk = page_address(page); |
673 | bit_pos = dentry - dentry_blk->dentry; | |
6b4ea016 | 674 | for (i = 0; i < slots; i++) |
1f7732fe | 675 | clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap); |
6b4ea016 JK |
676 | |
677 | /* Let's check and deallocate this dentry page */ | |
678 | bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap, | |
679 | NR_DENTRY_IN_BLOCK, | |
680 | 0); | |
681 | kunmap(page); /* kunmap - pair of f2fs_find_entry */ | |
682 | set_page_dirty(page); | |
683 | ||
684 | dir->i_ctime = dir->i_mtime = CURRENT_TIME; | |
685 | ||
dbeacf02 CY |
686 | if (inode) |
687 | f2fs_drop_nlink(dir, inode, NULL); | |
6b4ea016 JK |
688 | |
689 | if (bit_pos == NR_DENTRY_IN_BLOCK) { | |
6b4ea016 JK |
690 | truncate_hole(dir, page->index, page->index + 1); |
691 | clear_page_dirty_for_io(page); | |
2bca1e23 | 692 | ClearPagePrivate(page); |
6b4ea016 | 693 | ClearPageUptodate(page); |
a7ffdbe2 | 694 | inode_dec_dirty_pages(dir); |
6b4ea016 | 695 | } |
508198be | 696 | f2fs_put_page(page, 1); |
6b4ea016 JK |
697 | } |
698 | ||
699 | bool f2fs_empty_dir(struct inode *dir) | |
700 | { | |
701 | unsigned long bidx; | |
702 | struct page *dentry_page; | |
703 | unsigned int bit_pos; | |
dbeacf02 | 704 | struct f2fs_dentry_block *dentry_blk; |
6b4ea016 JK |
705 | unsigned long nblock = dir_blocks(dir); |
706 | ||
622f28ae CY |
707 | if (f2fs_has_inline_dentry(dir)) |
708 | return f2fs_empty_inline_dir(dir); | |
709 | ||
6b4ea016 | 710 | for (bidx = 0; bidx < nblock; bidx++) { |
6b4ea016 JK |
711 | dentry_page = get_lock_data_page(dir, bidx); |
712 | if (IS_ERR(dentry_page)) { | |
713 | if (PTR_ERR(dentry_page) == -ENOENT) | |
714 | continue; | |
715 | else | |
716 | return false; | |
717 | } | |
718 | ||
1c3bb978 | 719 | dentry_blk = kmap_atomic(dentry_page); |
6b4ea016 JK |
720 | if (bidx == 0) |
721 | bit_pos = 2; | |
722 | else | |
723 | bit_pos = 0; | |
724 | bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap, | |
725 | NR_DENTRY_IN_BLOCK, | |
726 | bit_pos); | |
1c3bb978 | 727 | kunmap_atomic(dentry_blk); |
6b4ea016 JK |
728 | |
729 | f2fs_put_page(dentry_page, 1); | |
730 | ||
731 | if (bit_pos < NR_DENTRY_IN_BLOCK) | |
732 | return false; | |
733 | } | |
734 | return true; | |
735 | } | |
736 | ||
7b3cd7d6 JK |
737 | bool f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d, |
738 | unsigned int start_pos) | |
38594de7 JK |
739 | { |
740 | unsigned char d_type = DT_UNKNOWN; | |
741 | unsigned int bit_pos; | |
742 | struct f2fs_dir_entry *de = NULL; | |
743 | ||
7b3cd7d6 | 744 | bit_pos = ((unsigned long)ctx->pos % d->max); |
38594de7 | 745 | |
7b3cd7d6 JK |
746 | while (bit_pos < d->max) { |
747 | bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos); | |
748 | if (bit_pos >= d->max) | |
38594de7 JK |
749 | break; |
750 | ||
7b3cd7d6 | 751 | de = &d->dentry[bit_pos]; |
38594de7 JK |
752 | if (de->file_type < F2FS_FT_MAX) |
753 | d_type = f2fs_filetype_table[de->file_type]; | |
754 | else | |
755 | d_type = DT_UNKNOWN; | |
7b3cd7d6 | 756 | if (!dir_emit(ctx, d->filename[bit_pos], |
38594de7 JK |
757 | le16_to_cpu(de->name_len), |
758 | le32_to_cpu(de->ino), d_type)) | |
759 | return true; | |
760 | ||
761 | bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); | |
762 | ctx->pos = start_pos + bit_pos; | |
763 | } | |
764 | return false; | |
765 | } | |
766 | ||
6f7f231e | 767 | static int f2fs_readdir(struct file *file, struct dir_context *ctx) |
6b4ea016 | 768 | { |
496ad9aa | 769 | struct inode *inode = file_inode(file); |
6b4ea016 | 770 | unsigned long npages = dir_blocks(inode); |
6b4ea016 | 771 | struct f2fs_dentry_block *dentry_blk = NULL; |
6b4ea016 | 772 | struct page *dentry_page = NULL; |
817202d9 | 773 | struct file_ra_state *ra = &file->f_ra; |
6f7f231e | 774 | unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK); |
7b3cd7d6 | 775 | struct f2fs_dentry_ptr d; |
6b4ea016 | 776 | |
622f28ae CY |
777 | if (f2fs_has_inline_dentry(inode)) |
778 | return f2fs_read_inline_dir(file, ctx); | |
779 | ||
817202d9 CY |
780 | /* readahead for multi pages of dir */ |
781 | if (npages - n > 1 && !ra_has_index(ra, n)) | |
782 | page_cache_sync_readahead(inode->i_mapping, ra, file, n, | |
783 | min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES)); | |
784 | ||
6c311ec6 | 785 | for (; n < npages; n++) { |
6b4ea016 JK |
786 | dentry_page = get_lock_data_page(inode, n); |
787 | if (IS_ERR(dentry_page)) | |
788 | continue; | |
789 | ||
6b4ea016 | 790 | dentry_blk = kmap(dentry_page); |
99b072bb | 791 | |
7b3cd7d6 JK |
792 | make_dentry_ptr(&d, (void *)dentry_blk, 1); |
793 | ||
794 | if (f2fs_fill_dentries(ctx, &d, n * NR_DENTRY_IN_BLOCK)) | |
38594de7 JK |
795 | goto stop; |
796 | ||
6f7f231e | 797 | ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK; |
6b4ea016 JK |
798 | kunmap(dentry_page); |
799 | f2fs_put_page(dentry_page, 1); | |
800 | dentry_page = NULL; | |
801 | } | |
99b072bb | 802 | stop: |
6b4ea016 JK |
803 | if (dentry_page && !IS_ERR(dentry_page)) { |
804 | kunmap(dentry_page); | |
805 | f2fs_put_page(dentry_page, 1); | |
806 | } | |
807 | ||
808 | return 0; | |
809 | } | |
810 | ||
811 | const struct file_operations f2fs_dir_operations = { | |
812 | .llseek = generic_file_llseek, | |
813 | .read = generic_read_dir, | |
6f7f231e | 814 | .iterate = f2fs_readdir, |
6b4ea016 JK |
815 | .fsync = f2fs_sync_file, |
816 | .unlocked_ioctl = f2fs_ioctl, | |
817 | }; |