blob: 60972a559685b359779fe7ea91ee0fda509b4139 [file] [log] [blame]
Kyle Swenson8d8f6542021-03-15 11:02:55 -06001/*
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"
14#include "node.h"
15#include "acl.h"
16#include "xattr.h"
17
18static 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
24static unsigned int dir_buckets(unsigned int level, int dir_level)
25{
26 if (level + dir_level < MAX_DIR_HASH_DEPTH / 2)
27 return 1 << (level + dir_level);
28 else
29 return MAX_DIR_BUCKETS;
30}
31
32static 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
40unsigned char f2fs_filetype_table[F2FS_FT_MAX] = {
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
52static 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
62void set_de_type(struct f2fs_dir_entry *de, umode_t mode)
63{
64 de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
65}
66
67static unsigned long dir_block_index(unsigned int level,
68 int dir_level, unsigned int idx)
69{
70 unsigned long i;
71 unsigned long bidx = 0;
72
73 for (i = 0; i < level; i++)
74 bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
75 bidx += idx * bucket_blocks(level);
76 return bidx;
77}
78
79static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
80 struct f2fs_filename *fname,
81 f2fs_hash_t namehash,
82 int *max_slots,
83 struct page **res_page)
84{
85 struct f2fs_dentry_block *dentry_blk;
86 struct f2fs_dir_entry *de;
87 struct f2fs_dentry_ptr d;
88
89 dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page);
90
91 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
92 de = find_target_dentry(fname, namehash, max_slots, &d);
93 if (de)
94 *res_page = dentry_page;
95 else
96 kunmap(dentry_page);
97
98 /*
99 * For the most part, it should be a bug when name_len is zero.
100 * We stop here for figuring out where the bugs has occurred.
101 */
102 f2fs_bug_on(F2FS_P_SB(dentry_page), d.max < 0);
103 return de;
104}
105
106struct f2fs_dir_entry *find_target_dentry(struct f2fs_filename *fname,
107 f2fs_hash_t namehash, int *max_slots,
108 struct f2fs_dentry_ptr *d)
109{
110 struct f2fs_dir_entry *de;
111 unsigned long bit_pos = 0;
112 int max_len = 0;
113 struct f2fs_str de_name = FSTR_INIT(NULL, 0);
114 struct f2fs_str *name = &fname->disk_name;
115
116 if (max_slots)
117 *max_slots = 0;
118 while (bit_pos < d->max) {
119 if (!test_bit_le(bit_pos, d->bitmap)) {
120 bit_pos++;
121 max_len++;
122 continue;
123 }
124
125 de = &d->dentry[bit_pos];
126
127 if (de->hash_code != namehash)
128 goto not_match;
129
130 de_name.name = d->filename[bit_pos];
131 de_name.len = le16_to_cpu(de->name_len);
132
133#ifdef CONFIG_F2FS_FS_ENCRYPTION
134 if (unlikely(!name->name)) {
135 if (fname->usr_fname->name[0] == '_') {
136 if (de_name.len > 32 &&
137 !memcmp(de_name.name + ((de_name.len - 17) & ~15),
138 fname->crypto_buf.name + 8, 16))
139 goto found;
140 goto not_match;
141 }
142 name->name = fname->crypto_buf.name;
143 name->len = fname->crypto_buf.len;
144 }
145#endif
146 if (de_name.len == name->len &&
147 !memcmp(de_name.name, name->name, name->len))
148 goto found;
149not_match:
150 if (max_slots && max_len > *max_slots)
151 *max_slots = max_len;
152 max_len = 0;
153
154 /* remain bug on condition */
155 if (unlikely(!de->name_len))
156 d->max = -1;
157
158 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
159 }
160
161 de = NULL;
162found:
163 if (max_slots && max_len > *max_slots)
164 *max_slots = max_len;
165 return de;
166}
167
168static struct f2fs_dir_entry *find_in_level(struct inode *dir,
169 unsigned int level,
170 struct f2fs_filename *fname,
171 struct page **res_page)
172{
173 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
174 int s = GET_DENTRY_SLOTS(name.len);
175 unsigned int nbucket, nblock;
176 unsigned int bidx, end_block;
177 struct page *dentry_page;
178 struct f2fs_dir_entry *de = NULL;
179 bool room = false;
180 int max_slots;
181 f2fs_hash_t namehash;
182
183 namehash = f2fs_dentry_hash(&name, fname);
184
185 f2fs_bug_on(F2FS_I_SB(dir), level > MAX_DIR_HASH_DEPTH);
186
187 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
188 nblock = bucket_blocks(level);
189
190 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
191 le32_to_cpu(namehash) % nbucket);
192 end_block = bidx + nblock;
193
194 for (; bidx < end_block; bidx++) {
195 /* no need to allocate new dentry pages to all the indices */
196 dentry_page = find_data_page(dir, bidx);
197 if (IS_ERR(dentry_page)) {
198 room = true;
199 continue;
200 }
201
202 de = find_in_block(dentry_page, fname, namehash, &max_slots,
203 res_page);
204 if (de)
205 break;
206
207 if (max_slots >= s)
208 room = true;
209 f2fs_put_page(dentry_page, 0);
210 }
211
212 if (!de && room && F2FS_I(dir)->chash != namehash) {
213 F2FS_I(dir)->chash = namehash;
214 F2FS_I(dir)->clevel = level;
215 }
216
217 return de;
218}
219
220/*
221 * Find an entry in the specified directory with the wanted name.
222 * It returns the page where the entry was found (as a parameter - res_page),
223 * and the entry itself. Page is returned mapped and unlocked.
224 * Entry is guaranteed to be valid.
225 */
226struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
227 struct qstr *child, struct page **res_page)
228{
229 unsigned long npages = dir_blocks(dir);
230 struct f2fs_dir_entry *de = NULL;
231 unsigned int max_depth;
232 unsigned int level;
233 struct f2fs_filename fname;
234 int err;
235
236 *res_page = NULL;
237
238 err = f2fs_fname_setup_filename(dir, child, 1, &fname);
239 if (err)
240 return NULL;
241
242 if (f2fs_has_inline_dentry(dir)) {
243 de = find_in_inline_dir(dir, &fname, res_page);
244 goto out;
245 }
246
247 if (npages == 0)
248 goto out;
249
250 max_depth = F2FS_I(dir)->i_current_depth;
251
252 for (level = 0; level < max_depth; level++) {
253 de = find_in_level(dir, level, &fname, res_page);
254 if (de)
255 break;
256 }
257out:
258 f2fs_fname_free_filename(&fname);
259 return de;
260}
261
262struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
263{
264 struct page *page;
265 struct f2fs_dir_entry *de;
266 struct f2fs_dentry_block *dentry_blk;
267
268 if (f2fs_has_inline_dentry(dir))
269 return f2fs_parent_inline_dir(dir, p);
270
271 page = get_lock_data_page(dir, 0, false);
272 if (IS_ERR(page))
273 return NULL;
274
275 dentry_blk = kmap(page);
276 de = &dentry_blk->dentry[1];
277 *p = page;
278 unlock_page(page);
279 return de;
280}
281
282ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr)
283{
284 ino_t res = 0;
285 struct f2fs_dir_entry *de;
286 struct page *page;
287
288 de = f2fs_find_entry(dir, qstr, &page);
289 if (de) {
290 res = le32_to_cpu(de->ino);
291 f2fs_dentry_kunmap(dir, page);
292 f2fs_put_page(page, 0);
293 }
294
295 return res;
296}
297
298void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
299 struct page *page, struct inode *inode)
300{
301 enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
302 lock_page(page);
303 f2fs_wait_on_page_writeback(page, type);
304 de->ino = cpu_to_le32(inode->i_ino);
305 set_de_type(de, inode->i_mode);
306 f2fs_dentry_kunmap(dir, page);
307 set_page_dirty(page);
308 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
309 mark_inode_dirty(dir);
310
311 f2fs_put_page(page, 1);
312}
313
314static void init_dent_inode(const struct qstr *name, struct page *ipage)
315{
316 struct f2fs_inode *ri;
317
318 f2fs_wait_on_page_writeback(ipage, NODE);
319
320 /* copy name info. to this inode page */
321 ri = F2FS_INODE(ipage);
322 ri->i_namelen = cpu_to_le32(name->len);
323 memcpy(ri->i_name, name->name, name->len);
324 set_page_dirty(ipage);
325}
326
327int update_dent_inode(struct inode *inode, struct inode *to,
328 const struct qstr *name)
329{
330 struct page *page;
331
332 if (file_enc_name(to))
333 return 0;
334
335 page = get_node_page(F2FS_I_SB(inode), inode->i_ino);
336 if (IS_ERR(page))
337 return PTR_ERR(page);
338
339 init_dent_inode(name, page);
340 f2fs_put_page(page, 1);
341
342 return 0;
343}
344
345void do_make_empty_dir(struct inode *inode, struct inode *parent,
346 struct f2fs_dentry_ptr *d)
347{
348 struct f2fs_dir_entry *de;
349
350 de = &d->dentry[0];
351 de->name_len = cpu_to_le16(1);
352 de->hash_code = 0;
353 de->ino = cpu_to_le32(inode->i_ino);
354 memcpy(d->filename[0], ".", 1);
355 set_de_type(de, inode->i_mode);
356
357 de = &d->dentry[1];
358 de->hash_code = 0;
359 de->name_len = cpu_to_le16(2);
360 de->ino = cpu_to_le32(parent->i_ino);
361 memcpy(d->filename[1], "..", 2);
362 set_de_type(de, parent->i_mode);
363
364 test_and_set_bit_le(0, (void *)d->bitmap);
365 test_and_set_bit_le(1, (void *)d->bitmap);
366}
367
368static int make_empty_dir(struct inode *inode,
369 struct inode *parent, struct page *page)
370{
371 struct page *dentry_page;
372 struct f2fs_dentry_block *dentry_blk;
373 struct f2fs_dentry_ptr d;
374
375 if (f2fs_has_inline_dentry(inode))
376 return make_empty_inline_dir(inode, parent, page);
377
378 dentry_page = get_new_data_page(inode, page, 0, true);
379 if (IS_ERR(dentry_page))
380 return PTR_ERR(dentry_page);
381
382 dentry_blk = kmap_atomic(dentry_page);
383
384 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
385 do_make_empty_dir(inode, parent, &d);
386
387 kunmap_atomic(dentry_blk);
388
389 set_page_dirty(dentry_page);
390 f2fs_put_page(dentry_page, 1);
391 return 0;
392}
393
394struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
395 const struct qstr *name, struct page *dpage)
396{
397 struct page *page;
398 int err;
399
400 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
401 page = new_inode_page(inode);
402 if (IS_ERR(page))
403 return page;
404
405 if (S_ISDIR(inode->i_mode)) {
406 err = make_empty_dir(inode, dir, page);
407 if (err)
408 goto error;
409 }
410
411 err = f2fs_init_acl(inode, dir, page, dpage);
412 if (err)
413 goto put_error;
414
415 err = f2fs_init_security(inode, dir, name, page);
416 if (err)
417 goto put_error;
418
419 if (f2fs_encrypted_inode(dir) && f2fs_may_encrypt(inode)) {
420 err = f2fs_inherit_context(dir, inode, page);
421 if (err)
422 goto put_error;
423 }
424 } else {
425 page = get_node_page(F2FS_I_SB(dir), inode->i_ino);
426 if (IS_ERR(page))
427 return page;
428
429 set_cold_node(inode, page);
430 }
431
432 if (name)
433 init_dent_inode(name, page);
434
435 /*
436 * This file should be checkpointed during fsync.
437 * We lost i_pino from now on.
438 */
439 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
440 file_lost_pino(inode);
441 /*
442 * If link the tmpfile to alias through linkat path,
443 * we should remove this inode from orphan list.
444 */
445 if (inode->i_nlink == 0)
446 remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
447 inc_nlink(inode);
448 }
449 return page;
450
451put_error:
452 f2fs_put_page(page, 1);
453error:
454 /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
455 truncate_inode_pages(&inode->i_data, 0);
456 truncate_blocks(inode, 0, false);
457 remove_dirty_dir_inode(inode);
458 remove_inode_page(inode);
459 return ERR_PTR(err);
460}
461
462void update_parent_metadata(struct inode *dir, struct inode *inode,
463 unsigned int current_depth)
464{
465 if (inode && is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
466 if (S_ISDIR(inode->i_mode)) {
467 inc_nlink(dir);
468 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
469 }
470 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
471 }
472 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
473 mark_inode_dirty(dir);
474
475 if (F2FS_I(dir)->i_current_depth != current_depth) {
476 F2FS_I(dir)->i_current_depth = current_depth;
477 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
478 }
479
480 if (inode && is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
481 clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
482}
483
484int room_for_filename(const void *bitmap, int slots, int max_slots)
485{
486 int bit_start = 0;
487 int zero_start, zero_end;
488next:
489 zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start);
490 if (zero_start >= max_slots)
491 return max_slots;
492
493 zero_end = find_next_bit_le(bitmap, max_slots, zero_start);
494 if (zero_end - zero_start >= slots)
495 return zero_start;
496
497 bit_start = zero_end + 1;
498
499 if (zero_end + 1 >= max_slots)
500 return max_slots;
501 goto next;
502}
503
504void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
505 const struct qstr *name, f2fs_hash_t name_hash,
506 unsigned int bit_pos)
507{
508 struct f2fs_dir_entry *de;
509 int slots = GET_DENTRY_SLOTS(name->len);
510 int i;
511
512 de = &d->dentry[bit_pos];
513 de->hash_code = name_hash;
514 de->name_len = cpu_to_le16(name->len);
515 memcpy(d->filename[bit_pos], name->name, name->len);
516 de->ino = cpu_to_le32(ino);
517 set_de_type(de, mode);
518 for (i = 0; i < slots; i++)
519 test_and_set_bit_le(bit_pos + i, (void *)d->bitmap);
520}
521
522/*
523 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
524 * f2fs_unlock_op().
525 */
526int __f2fs_add_link(struct inode *dir, const struct qstr *name,
527 struct inode *inode, nid_t ino, umode_t mode)
528{
529 unsigned int bit_pos;
530 unsigned int level;
531 unsigned int current_depth;
532 unsigned long bidx, block;
533 f2fs_hash_t dentry_hash;
534 unsigned int nbucket, nblock;
535 struct page *dentry_page = NULL;
536 struct f2fs_dentry_block *dentry_blk = NULL;
537 struct f2fs_dentry_ptr d;
538 struct page *page = NULL;
539 struct f2fs_filename fname;
540 struct qstr new_name;
541 int slots, err;
542
543 err = f2fs_fname_setup_filename(dir, name, 0, &fname);
544 if (err)
545 return err;
546
547 new_name.name = fname_name(&fname);
548 new_name.len = fname_len(&fname);
549
550 if (f2fs_has_inline_dentry(dir)) {
551 err = f2fs_add_inline_entry(dir, &new_name, inode, ino, mode);
552 if (!err || err != -EAGAIN)
553 goto out;
554 else
555 err = 0;
556 }
557
558 level = 0;
559 slots = GET_DENTRY_SLOTS(new_name.len);
560 dentry_hash = f2fs_dentry_hash(&new_name, NULL);
561
562 current_depth = F2FS_I(dir)->i_current_depth;
563 if (F2FS_I(dir)->chash == dentry_hash) {
564 level = F2FS_I(dir)->clevel;
565 F2FS_I(dir)->chash = 0;
566 }
567
568start:
569 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH)) {
570 err = -ENOSPC;
571 goto out;
572 }
573
574 /* Increase the depth, if required */
575 if (level == current_depth)
576 ++current_depth;
577
578 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
579 nblock = bucket_blocks(level);
580
581 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
582 (le32_to_cpu(dentry_hash) % nbucket));
583
584 for (block = bidx; block <= (bidx + nblock - 1); block++) {
585 dentry_page = get_new_data_page(dir, NULL, block, true);
586 if (IS_ERR(dentry_page)) {
587 err = PTR_ERR(dentry_page);
588 goto out;
589 }
590
591 dentry_blk = kmap(dentry_page);
592 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
593 slots, NR_DENTRY_IN_BLOCK);
594 if (bit_pos < NR_DENTRY_IN_BLOCK)
595 goto add_dentry;
596
597 kunmap(dentry_page);
598 f2fs_put_page(dentry_page, 1);
599 }
600
601 /* Move to next level to find the empty slot for new dentry */
602 ++level;
603 goto start;
604add_dentry:
605 f2fs_wait_on_page_writeback(dentry_page, DATA);
606
607 if (inode) {
608 down_write(&F2FS_I(inode)->i_sem);
609 page = init_inode_metadata(inode, dir, &new_name, NULL);
610 if (IS_ERR(page)) {
611 err = PTR_ERR(page);
612 goto fail;
613 }
614 if (f2fs_encrypted_inode(dir))
615 file_set_enc_name(inode);
616 }
617
618 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 1);
619 f2fs_update_dentry(ino, mode, &d, &new_name, dentry_hash, bit_pos);
620
621 set_page_dirty(dentry_page);
622
623 if (inode) {
624 /* we don't need to mark_inode_dirty now */
625 F2FS_I(inode)->i_pino = dir->i_ino;
626 update_inode(inode, page);
627 f2fs_put_page(page, 1);
628 }
629
630 update_parent_metadata(dir, inode, current_depth);
631fail:
632 if (inode)
633 up_write(&F2FS_I(inode)->i_sem);
634
635 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
636 update_inode_page(dir);
637 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
638 }
639 kunmap(dentry_page);
640 f2fs_put_page(dentry_page, 1);
641out:
642 f2fs_fname_free_filename(&fname);
643 return err;
644}
645
646int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
647{
648 struct page *page;
649 int err = 0;
650
651 down_write(&F2FS_I(inode)->i_sem);
652 page = init_inode_metadata(inode, dir, NULL, NULL);
653 if (IS_ERR(page)) {
654 err = PTR_ERR(page);
655 goto fail;
656 }
657 /* we don't need to mark_inode_dirty now */
658 update_inode(inode, page);
659 f2fs_put_page(page, 1);
660
661 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
662fail:
663 up_write(&F2FS_I(inode)->i_sem);
664 return err;
665}
666
667void f2fs_drop_nlink(struct inode *dir, struct inode *inode, struct page *page)
668{
669 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
670
671 down_write(&F2FS_I(inode)->i_sem);
672
673 if (S_ISDIR(inode->i_mode)) {
674 drop_nlink(dir);
675 if (page)
676 update_inode(dir, page);
677 else
678 update_inode_page(dir);
679 }
680 inode->i_ctime = CURRENT_TIME;
681
682 drop_nlink(inode);
683 if (S_ISDIR(inode->i_mode)) {
684 drop_nlink(inode);
685 i_size_write(inode, 0);
686 }
687 up_write(&F2FS_I(inode)->i_sem);
688 update_inode_page(inode);
689
690 if (inode->i_nlink == 0)
691 add_orphan_inode(sbi, inode->i_ino);
692 else
693 release_orphan_inode(sbi);
694}
695
696/*
697 * It only removes the dentry from the dentry page, corresponding name
698 * entry in name page does not need to be touched during deletion.
699 */
700void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
701 struct inode *dir, struct inode *inode)
702{
703 struct f2fs_dentry_block *dentry_blk;
704 unsigned int bit_pos;
705 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
706 int i;
707
708 if (f2fs_has_inline_dentry(dir))
709 return f2fs_delete_inline_entry(dentry, page, dir, inode);
710
711 lock_page(page);
712 f2fs_wait_on_page_writeback(page, DATA);
713
714 dentry_blk = page_address(page);
715 bit_pos = dentry - dentry_blk->dentry;
716 for (i = 0; i < slots; i++)
717 clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
718
719 /* Let's check and deallocate this dentry page */
720 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
721 NR_DENTRY_IN_BLOCK,
722 0);
723 kunmap(page); /* kunmap - pair of f2fs_find_entry */
724 set_page_dirty(page);
725
726 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
727
728 if (inode)
729 f2fs_drop_nlink(dir, inode, NULL);
730
731 if (bit_pos == NR_DENTRY_IN_BLOCK &&
732 !truncate_hole(dir, page->index, page->index + 1)) {
733 clear_page_dirty_for_io(page);
734 ClearPagePrivate(page);
735 ClearPageUptodate(page);
736 inode_dec_dirty_pages(dir);
737 }
738 f2fs_put_page(page, 1);
739}
740
741bool f2fs_empty_dir(struct inode *dir)
742{
743 unsigned long bidx;
744 struct page *dentry_page;
745 unsigned int bit_pos;
746 struct f2fs_dentry_block *dentry_blk;
747 unsigned long nblock = dir_blocks(dir);
748
749 if (f2fs_has_inline_dentry(dir))
750 return f2fs_empty_inline_dir(dir);
751
752 for (bidx = 0; bidx < nblock; bidx++) {
753 dentry_page = get_lock_data_page(dir, bidx, false);
754 if (IS_ERR(dentry_page)) {
755 if (PTR_ERR(dentry_page) == -ENOENT)
756 continue;
757 else
758 return false;
759 }
760
761 dentry_blk = kmap_atomic(dentry_page);
762 if (bidx == 0)
763 bit_pos = 2;
764 else
765 bit_pos = 0;
766 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
767 NR_DENTRY_IN_BLOCK,
768 bit_pos);
769 kunmap_atomic(dentry_blk);
770
771 f2fs_put_page(dentry_page, 1);
772
773 if (bit_pos < NR_DENTRY_IN_BLOCK)
774 return false;
775 }
776 return true;
777}
778
779bool f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
780 unsigned int start_pos, struct f2fs_str *fstr)
781{
782 unsigned char d_type = DT_UNKNOWN;
783 unsigned int bit_pos;
784 struct f2fs_dir_entry *de = NULL;
785 struct f2fs_str de_name = FSTR_INIT(NULL, 0);
786
787 bit_pos = ((unsigned long)ctx->pos % d->max);
788
789 while (bit_pos < d->max) {
790 bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos);
791 if (bit_pos >= d->max)
792 break;
793
794 de = &d->dentry[bit_pos];
795 if (de->file_type < F2FS_FT_MAX)
796 d_type = f2fs_filetype_table[de->file_type];
797 else
798 d_type = DT_UNKNOWN;
799
800 de_name.name = d->filename[bit_pos];
801 de_name.len = le16_to_cpu(de->name_len);
802
803 if (f2fs_encrypted_inode(d->inode)) {
804 int save_len = fstr->len;
805 int ret;
806
807 de_name.name = kmalloc(de_name.len, GFP_NOFS);
808 if (!de_name.name)
809 return false;
810
811 memcpy(de_name.name, d->filename[bit_pos], de_name.len);
812
813 ret = f2fs_fname_disk_to_usr(d->inode, &de->hash_code,
814 &de_name, fstr);
815 kfree(de_name.name);
816 if (ret < 0)
817 return true;
818
819 de_name = *fstr;
820 fstr->len = save_len;
821 }
822
823 if (!dir_emit(ctx, de_name.name, de_name.len,
824 le32_to_cpu(de->ino), d_type))
825 return true;
826
827 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
828 ctx->pos = start_pos + bit_pos;
829 }
830 return false;
831}
832
833static int f2fs_readdir(struct file *file, struct dir_context *ctx)
834{
835 struct inode *inode = file_inode(file);
836 unsigned long npages = dir_blocks(inode);
837 struct f2fs_dentry_block *dentry_blk = NULL;
838 struct page *dentry_page = NULL;
839 struct file_ra_state *ra = &file->f_ra;
840 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
841 struct f2fs_dentry_ptr d;
842 struct f2fs_str fstr = FSTR_INIT(NULL, 0);
843 int err = 0;
844
845 if (f2fs_encrypted_inode(inode)) {
846 err = f2fs_get_encryption_info(inode);
847 if (err)
848 return err;
849
850 err = f2fs_fname_crypto_alloc_buffer(inode, F2FS_NAME_LEN,
851 &fstr);
852 if (err < 0)
853 return err;
854 }
855
856 if (f2fs_has_inline_dentry(inode)) {
857 err = f2fs_read_inline_dir(file, ctx, &fstr);
858 goto out;
859 }
860
861 /* readahead for multi pages of dir */
862 if (npages - n > 1 && !ra_has_index(ra, n))
863 page_cache_sync_readahead(inode->i_mapping, ra, file, n,
864 min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
865
866 for (; n < npages; n++) {
867 dentry_page = get_lock_data_page(inode, n, false);
868 if (IS_ERR(dentry_page))
869 continue;
870
871 dentry_blk = kmap(dentry_page);
872
873 make_dentry_ptr(inode, &d, (void *)dentry_blk, 1);
874
875 if (f2fs_fill_dentries(ctx, &d, n * NR_DENTRY_IN_BLOCK, &fstr))
876 goto stop;
877
878 ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
879 kunmap(dentry_page);
880 f2fs_put_page(dentry_page, 1);
881 dentry_page = NULL;
882 }
883stop:
884 if (dentry_page && !IS_ERR(dentry_page)) {
885 kunmap(dentry_page);
886 f2fs_put_page(dentry_page, 1);
887 }
888out:
889 f2fs_fname_crypto_free_buffer(&fstr);
890 return err;
891}
892
893const struct file_operations f2fs_dir_operations = {
894 .llseek = generic_file_llseek,
895 .read = generic_read_dir,
896 .iterate = f2fs_readdir,
897 .fsync = f2fs_sync_file,
898 .unlocked_ioctl = f2fs_ioctl,
899#ifdef CONFIG_COMPAT
900 .compat_ioctl = f2fs_compat_ioctl,
901#endif
902};