f2fs crypto: activate encryption support for fs APIs
[deliverable/linux.git] / fs / f2fs / dir.c
1 /*
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
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
24 static 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
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
40 unsigned 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
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
62 void 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
67 static 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
79 static bool early_match_name(size_t namelen, f2fs_hash_t namehash,
80 struct f2fs_dir_entry *de)
81 {
82 if (le16_to_cpu(de->name_len) != namelen)
83 return false;
84
85 if (de->hash_code != namehash)
86 return false;
87
88 return true;
89 }
90
91 static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
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;
97 struct f2fs_dentry_ptr d;
98
99 dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page);
100
101 make_dentry_ptr(&d, (void *)dentry_blk, 1);
102 de = find_target_dentry(name, max_slots, &d);
103
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 */
113 f2fs_bug_on(F2FS_P_SB(dentry_page), d.max < 0);
114 return de;
115 }
116
117 struct f2fs_dir_entry *find_target_dentry(struct qstr *name, int *max_slots,
118 struct f2fs_dentry_ptr *d)
119 {
120 struct f2fs_dir_entry *de;
121 unsigned long bit_pos = 0;
122 f2fs_hash_t namehash = f2fs_dentry_hash(name);
123 int max_len = 0;
124
125 if (max_slots)
126 *max_slots = 0;
127 while (bit_pos < d->max) {
128 if (!test_bit_le(bit_pos, d->bitmap)) {
129 bit_pos++;
130 max_len++;
131 continue;
132 }
133
134 de = &d->dentry[bit_pos];
135 if (early_match_name(name->len, namehash, de) &&
136 !memcmp(d->filename[bit_pos], name->name, name->len))
137 goto found;
138
139 if (max_slots && max_len > *max_slots)
140 *max_slots = max_len;
141 max_len = 0;
142
143 /* remain bug on condition */
144 if (unlikely(!de->name_len))
145 d->max = -1;
146
147 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
148 }
149
150 de = NULL;
151 found:
152 if (max_slots && max_len > *max_slots)
153 *max_slots = max_len;
154 return de;
155 }
156
157 static struct f2fs_dir_entry *find_in_level(struct inode *dir,
158 unsigned int level, struct qstr *name,
159 f2fs_hash_t namehash, struct page **res_page)
160 {
161 int s = GET_DENTRY_SLOTS(name->len);
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;
167 int max_slots;
168
169 f2fs_bug_on(F2FS_I_SB(dir), level > MAX_DIR_HASH_DEPTH);
170
171 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
172 nblock = bucket_blocks(level);
173
174 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
175 le32_to_cpu(namehash) % nbucket);
176 end_block = bidx + nblock;
177
178 for (; bidx < end_block; bidx++) {
179 /* no need to allocate new dentry pages to all the indices */
180 dentry_page = find_data_page(dir, bidx);
181 if (IS_ERR(dentry_page)) {
182 room = true;
183 continue;
184 }
185
186 de = find_in_block(dentry_page, name, &max_slots, res_page);
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 {
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
218 *res_page = NULL;
219
220 if (f2fs_has_inline_dentry(dir))
221 return find_in_inline_dir(dir, child, res_page);
222
223 if (npages == 0)
224 return NULL;
225
226 name_hash = f2fs_dentry_hash(child);
227 max_depth = F2FS_I(dir)->i_current_depth;
228
229 for (level = 0; level < max_depth; level++) {
230 de = find_in_level(dir, level, child, name_hash, res_page);
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 {
243 struct page *page;
244 struct f2fs_dir_entry *de;
245 struct f2fs_dentry_block *dentry_blk;
246
247 if (f2fs_has_inline_dentry(dir))
248 return f2fs_parent_inline_dir(dir, p);
249
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);
270 f2fs_dentry_kunmap(dir, page);
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 {
280 enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA;
281 lock_page(page);
282 f2fs_wait_on_page_writeback(page, type);
283 de->ino = cpu_to_le32(inode->i_ino);
284 set_de_type(de, inode->i_mode);
285 f2fs_dentry_kunmap(dir, page);
286 set_page_dirty(page);
287 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
288 mark_inode_dirty(dir);
289
290 f2fs_put_page(page, 1);
291 }
292
293 static void init_dent_inode(const struct qstr *name, struct page *ipage)
294 {
295 struct f2fs_inode *ri;
296
297 f2fs_wait_on_page_writeback(ipage, NODE);
298
299 /* copy name info. to this inode page */
300 ri = F2FS_INODE(ipage);
301 ri->i_namelen = cpu_to_le32(name->len);
302 memcpy(ri->i_name, name->name, name->len);
303 set_page_dirty(ipage);
304 }
305
306 int update_dent_inode(struct inode *inode, const struct qstr *name)
307 {
308 struct page *page;
309
310 page = get_node_page(F2FS_I_SB(inode), inode->i_ino);
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
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);
330 set_de_type(de, inode->i_mode);
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);
337 set_de_type(de, parent->i_mode);
338
339 test_and_set_bit_le(0, (void *)d->bitmap);
340 test_and_set_bit_le(1, (void *)d->bitmap);
341 }
342
343 static int make_empty_dir(struct inode *inode,
344 struct inode *parent, struct page *page)
345 {
346 struct page *dentry_page;
347 struct f2fs_dentry_block *dentry_blk;
348 struct f2fs_dentry_ptr d;
349
350 if (f2fs_has_inline_dentry(inode))
351 return make_empty_inline_dir(inode, parent, page);
352
353 dentry_page = get_new_data_page(inode, page, 0, true);
354 if (IS_ERR(dentry_page))
355 return PTR_ERR(dentry_page);
356
357 dentry_blk = kmap_atomic(dentry_page);
358
359 make_dentry_ptr(&d, (void *)dentry_blk, 1);
360 do_make_empty_dir(inode, parent, &d);
361
362 kunmap_atomic(dentry_blk);
363
364 set_page_dirty(dentry_page);
365 f2fs_put_page(dentry_page, 1);
366 return 0;
367 }
368
369 struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
370 const struct qstr *name, struct page *dpage)
371 {
372 struct page *page;
373 int err;
374
375 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
376 page = new_inode_page(inode);
377 if (IS_ERR(page))
378 return page;
379
380 if (S_ISDIR(inode->i_mode)) {
381 err = make_empty_dir(inode, dir, page);
382 if (err)
383 goto error;
384 }
385
386 err = f2fs_init_acl(inode, dir, page, dpage);
387 if (err)
388 goto put_error;
389
390 err = f2fs_init_security(inode, dir, name, page);
391 if (err)
392 goto put_error;
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 }
399 } else {
400 page = get_node_page(F2FS_I_SB(dir), inode->i_ino);
401 if (IS_ERR(page))
402 return page;
403
404 set_cold_node(inode, page);
405 }
406
407 if (name)
408 init_dent_inode(name, page);
409
410 /*
411 * This file should be checkpointed during fsync.
412 * We lost i_pino from now on.
413 */
414 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
415 file_lost_pino(inode);
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)
421 remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino);
422 inc_nlink(inode);
423 }
424 return page;
425
426 put_error:
427 f2fs_put_page(page, 1);
428 error:
429 /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
430 truncate_inode_pages(&inode->i_data, 0);
431 truncate_blocks(inode, 0, false);
432 remove_dirty_dir_inode(inode);
433 remove_inode_page(inode);
434 return ERR_PTR(err);
435 }
436
437 void update_parent_metadata(struct inode *dir, struct inode *inode,
438 unsigned int current_depth)
439 {
440 if (inode && is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
441 if (S_ISDIR(inode->i_mode)) {
442 inc_nlink(dir);
443 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
444 }
445 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
446 }
447 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
448 mark_inode_dirty(dir);
449
450 if (F2FS_I(dir)->i_current_depth != current_depth) {
451 F2FS_I(dir)->i_current_depth = current_depth;
452 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
453 }
454
455 if (inode && is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
456 clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
457 }
458
459 int room_for_filename(const void *bitmap, int slots, int max_slots)
460 {
461 int bit_start = 0;
462 int zero_start, zero_end;
463 next:
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);
469 if (zero_end - zero_start >= slots)
470 return zero_start;
471
472 bit_start = zero_end + 1;
473
474 if (zero_end + 1 >= max_slots)
475 return max_slots;
476 goto next;
477 }
478
479 void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
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);
491 de->ino = cpu_to_le32(ino);
492 set_de_type(de, mode);
493 for (i = 0; i < slots; i++)
494 test_and_set_bit_le(bit_pos + i, (void *)d->bitmap);
495 }
496
497 /*
498 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
499 * f2fs_unlock_op().
500 */
501 int __f2fs_add_link(struct inode *dir, const struct qstr *name,
502 struct inode *inode, nid_t ino, umode_t mode)
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;
509 unsigned int nbucket, nblock;
510 size_t namelen = name->len;
511 struct page *dentry_page = NULL;
512 struct f2fs_dentry_block *dentry_blk = NULL;
513 struct f2fs_dentry_ptr d;
514 int slots = GET_DENTRY_SLOTS(namelen);
515 struct page *page = NULL;
516 int err = 0;
517
518 if (f2fs_has_inline_dentry(dir)) {
519 err = f2fs_add_inline_entry(dir, name, inode, ino, mode);
520 if (!err || err != -EAGAIN)
521 return err;
522 else
523 err = 0;
524 }
525
526 dentry_hash = f2fs_dentry_hash(name);
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:
535 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
536 return -ENOSPC;
537
538 /* Increase the depth, if required */
539 if (level == current_depth)
540 ++current_depth;
541
542 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
543 nblock = bucket_blocks(level);
544
545 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
546 (le32_to_cpu(dentry_hash) % nbucket));
547
548 for (block = bidx; block <= (bidx + nblock - 1); block++) {
549 dentry_page = get_new_data_page(dir, NULL, block, true);
550 if (IS_ERR(dentry_page))
551 return PTR_ERR(dentry_page);
552
553 dentry_blk = kmap(dentry_page);
554 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
555 slots, NR_DENTRY_IN_BLOCK);
556 if (bit_pos < NR_DENTRY_IN_BLOCK)
557 goto add_dentry;
558
559 kunmap(dentry_page);
560 f2fs_put_page(dentry_page, 1);
561 }
562
563 /* Move to next level to find the empty slot for new dentry */
564 ++level;
565 goto start;
566 add_dentry:
567 f2fs_wait_on_page_writeback(dentry_page, DATA);
568
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 }
576 }
577
578 make_dentry_ptr(&d, (void *)dentry_blk, 1);
579 f2fs_update_dentry(ino, mode, &d, name, dentry_hash, bit_pos);
580
581 set_page_dirty(dentry_page);
582
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 }
589
590 update_parent_metadata(dir, inode, current_depth);
591 fail:
592 if (inode)
593 up_write(&F2FS_I(inode)->i_sem);
594
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 }
599 kunmap(dentry_page);
600 f2fs_put_page(dentry_page, 1);
601 return err;
602 }
603
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);
610 page = init_inode_metadata(inode, dir, NULL, NULL);
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
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
654 /*
655 * It only removes the dentry from the dentry page, corresponding name
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,
659 struct inode *dir, struct inode *inode)
660 {
661 struct f2fs_dentry_block *dentry_blk;
662 unsigned int bit_pos;
663 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
664 int i;
665
666 if (f2fs_has_inline_dentry(dir))
667 return f2fs_delete_inline_entry(dentry, page, dir, inode);
668
669 lock_page(page);
670 f2fs_wait_on_page_writeback(page, DATA);
671
672 dentry_blk = page_address(page);
673 bit_pos = dentry - dentry_blk->dentry;
674 for (i = 0; i < slots; i++)
675 clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
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
686 if (inode)
687 f2fs_drop_nlink(dir, inode, NULL);
688
689 if (bit_pos == NR_DENTRY_IN_BLOCK) {
690 truncate_hole(dir, page->index, page->index + 1);
691 clear_page_dirty_for_io(page);
692 ClearPagePrivate(page);
693 ClearPageUptodate(page);
694 inode_dec_dirty_pages(dir);
695 }
696 f2fs_put_page(page, 1);
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;
704 struct f2fs_dentry_block *dentry_blk;
705 unsigned long nblock = dir_blocks(dir);
706
707 if (f2fs_has_inline_dentry(dir))
708 return f2fs_empty_inline_dir(dir);
709
710 for (bidx = 0; bidx < nblock; bidx++) {
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
719 dentry_blk = kmap_atomic(dentry_page);
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);
727 kunmap_atomic(dentry_blk);
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
737 bool f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
738 unsigned int start_pos)
739 {
740 unsigned char d_type = DT_UNKNOWN;
741 unsigned int bit_pos;
742 struct f2fs_dir_entry *de = NULL;
743
744 bit_pos = ((unsigned long)ctx->pos % d->max);
745
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)
749 break;
750
751 de = &d->dentry[bit_pos];
752 if (de->file_type < F2FS_FT_MAX)
753 d_type = f2fs_filetype_table[de->file_type];
754 else
755 d_type = DT_UNKNOWN;
756 if (!dir_emit(ctx, d->filename[bit_pos],
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
767 static int f2fs_readdir(struct file *file, struct dir_context *ctx)
768 {
769 struct inode *inode = file_inode(file);
770 unsigned long npages = dir_blocks(inode);
771 struct f2fs_dentry_block *dentry_blk = NULL;
772 struct page *dentry_page = NULL;
773 struct file_ra_state *ra = &file->f_ra;
774 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
775 struct f2fs_dentry_ptr d;
776
777 if (f2fs_has_inline_dentry(inode))
778 return f2fs_read_inline_dir(file, ctx);
779
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
785 for (; n < npages; n++) {
786 dentry_page = get_lock_data_page(inode, n);
787 if (IS_ERR(dentry_page))
788 continue;
789
790 dentry_blk = kmap(dentry_page);
791
792 make_dentry_ptr(&d, (void *)dentry_blk, 1);
793
794 if (f2fs_fill_dentries(ctx, &d, n * NR_DENTRY_IN_BLOCK))
795 goto stop;
796
797 ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
798 kunmap(dentry_page);
799 f2fs_put_page(dentry_page, 1);
800 dentry_page = NULL;
801 }
802 stop:
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,
814 .iterate = f2fs_readdir,
815 .fsync = f2fs_sync_file,
816 .unlocked_ioctl = f2fs_ioctl,
817 };
This page took 0.04975 seconds and 5 git commands to generate.