]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/f2fs/dir.c
projects / mirror_ubuntu-bionic-kernel.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
f2fs: arguments cleanup of finding file flow functions
[mirror_ubuntu-bionic-kernel.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 static 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 static void set_de_type(struct f2fs_dir_entry *de, struct inode *inode)
63 {
64 umode_t mode = inode->i_mode;
65 de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
66 }
67
68 static unsigned long dir_block_index(unsigned int level,
69 int dir_level, unsigned int idx)
70 {
71 unsigned long i;
72 unsigned long bidx = 0;
73
74 for (i = 0; i < level; i++)
75 bidx += dir_buckets(i, dir_level) * bucket_blocks(i);
76 bidx += idx * bucket_blocks(level);
77 return bidx;
78 }
79
80 static bool early_match_name(size_t namelen, f2fs_hash_t namehash,
81 struct f2fs_dir_entry *de)
82 {
83 if (le16_to_cpu(de->name_len) != namelen)
84 return false;
85
86 if (de->hash_code != namehash)
87 return false;
88
89 return true;
90 }
91
92 static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
93 struct qstr *name, int *max_slots,
94 f2fs_hash_t namehash, struct page **res_page)
95 {
96 struct f2fs_dir_entry *de;
97 unsigned long bit_pos = 0;
98 struct f2fs_dentry_block *dentry_blk = kmap(dentry_page);
99 const void *dentry_bits = &dentry_blk->dentry_bitmap;
100 int max_len = 0;
101
102 while (bit_pos < NR_DENTRY_IN_BLOCK) {
103 if (!test_bit_le(bit_pos, dentry_bits)) {
104 if (bit_pos == 0)
105 max_len = 1;
106 else if (!test_bit_le(bit_pos - 1, dentry_bits))
107 max_len++;
108 bit_pos++;
109 continue;
110 }
111 de = &dentry_blk->dentry[bit_pos];
112 if (early_match_name(name->len, namehash, de)) {
113 if (!memcmp(dentry_blk->filename[bit_pos],
114 name->name,
115 name->len)) {
116 *res_page = dentry_page;
117 goto found;
118 }
119 }
120 if (max_len > *max_slots) {
121 *max_slots = max_len;
122 max_len = 0;
123 }
124 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
125 }
126
127 de = NULL;
128 kunmap(dentry_page);
129 found:
130 if (max_len > *max_slots)
131 *max_slots = max_len;
132 return de;
133 }
134
135 static struct f2fs_dir_entry *find_in_level(struct inode *dir,
136 unsigned int level, struct qstr *name,
137 f2fs_hash_t namehash, struct page **res_page)
138 {
139 int s = GET_DENTRY_SLOTS(name->len);
140 unsigned int nbucket, nblock;
141 unsigned int bidx, end_block;
142 struct page *dentry_page;
143 struct f2fs_dir_entry *de = NULL;
144 bool room = false;
145 int max_slots = 0;
146
147 f2fs_bug_on(level > MAX_DIR_HASH_DEPTH);
148
149 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
150 nblock = bucket_blocks(level);
151
152 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
153 le32_to_cpu(namehash) % nbucket);
154 end_block = bidx + nblock;
155
156 for (; bidx < end_block; bidx++) {
157 /* no need to allocate new dentry pages to all the indices */
158 dentry_page = find_data_page(dir, bidx, true);
159 if (IS_ERR(dentry_page)) {
160 room = true;
161 continue;
162 }
163
164 de = find_in_block(dentry_page, name, &max_slots,
165 namehash, res_page);
166 if (de)
167 break;
168
169 if (max_slots >= s)
170 room = true;
171 f2fs_put_page(dentry_page, 0);
172 }
173
174 if (!de && room && F2FS_I(dir)->chash != namehash) {
175 F2FS_I(dir)->chash = namehash;
176 F2FS_I(dir)->clevel = level;
177 }
178
179 return de;
180 }
181
182 /*
183 * Find an entry in the specified directory with the wanted name.
184 * It returns the page where the entry was found (as a parameter - res_page),
185 * and the entry itself. Page is returned mapped and unlocked.
186 * Entry is guaranteed to be valid.
187 */
188 struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
189 struct qstr *child, struct page **res_page)
190 {
191 unsigned long npages = dir_blocks(dir);
192 struct f2fs_dir_entry *de = NULL;
193 f2fs_hash_t name_hash;
194 unsigned int max_depth;
195 unsigned int level;
196
197 if (npages == 0)
198 return NULL;
199
200 *res_page = NULL;
201
202 name_hash = f2fs_dentry_hash(child);
203 max_depth = F2FS_I(dir)->i_current_depth;
204
205 for (level = 0; level < max_depth; level++) {
206 de = find_in_level(dir, level, child, name_hash, res_page);
207 if (de)
208 break;
209 }
210 if (!de && F2FS_I(dir)->chash != name_hash) {
211 F2FS_I(dir)->chash = name_hash;
212 F2FS_I(dir)->clevel = level - 1;
213 }
214 return de;
215 }
216
217 struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
218 {
219 struct page *page;
220 struct f2fs_dir_entry *de;
221 struct f2fs_dentry_block *dentry_blk;
222
223 page = get_lock_data_page(dir, 0);
224 if (IS_ERR(page))
225 return NULL;
226
227 dentry_blk = kmap(page);
228 de = &dentry_blk->dentry[1];
229 *p = page;
230 unlock_page(page);
231 return de;
232 }
233
234 ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr)
235 {
236 ino_t res = 0;
237 struct f2fs_dir_entry *de;
238 struct page *page;
239
240 de = f2fs_find_entry(dir, qstr, &page);
241 if (de) {
242 res = le32_to_cpu(de->ino);
243 kunmap(page);
244 f2fs_put_page(page, 0);
245 }
246
247 return res;
248 }
249
250 void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
251 struct page *page, struct inode *inode)
252 {
253 lock_page(page);
254 f2fs_wait_on_page_writeback(page, DATA);
255 de->ino = cpu_to_le32(inode->i_ino);
256 set_de_type(de, inode);
257 kunmap(page);
258 set_page_dirty(page);
259 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
260 mark_inode_dirty(dir);
261
262 f2fs_put_page(page, 1);
263 }
264
265 static void init_dent_inode(const struct qstr *name, struct page *ipage)
266 {
267 struct f2fs_inode *ri;
268
269 f2fs_wait_on_page_writeback(ipage, NODE);
270
271 /* copy name info. to this inode page */
272 ri = F2FS_INODE(ipage);
273 ri->i_namelen = cpu_to_le32(name->len);
274 memcpy(ri->i_name, name->name, name->len);
275 set_page_dirty(ipage);
276 }
277
278 int update_dent_inode(struct inode *inode, const struct qstr *name)
279 {
280 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
281 struct page *page;
282
283 page = get_node_page(sbi, inode->i_ino);
284 if (IS_ERR(page))
285 return PTR_ERR(page);
286
287 init_dent_inode(name, page);
288 f2fs_put_page(page, 1);
289
290 return 0;
291 }
292
293 static int make_empty_dir(struct inode *inode,
294 struct inode *parent, struct page *page)
295 {
296 struct page *dentry_page;
297 struct f2fs_dentry_block *dentry_blk;
298 struct f2fs_dir_entry *de;
299
300 dentry_page = get_new_data_page(inode, page, 0, true);
301 if (IS_ERR(dentry_page))
302 return PTR_ERR(dentry_page);
303
304
305 dentry_blk = kmap_atomic(dentry_page);
306
307 de = &dentry_blk->dentry[0];
308 de->name_len = cpu_to_le16(1);
309 de->hash_code = 0;
310 de->ino = cpu_to_le32(inode->i_ino);
311 memcpy(dentry_blk->filename[0], ".", 1);
312 set_de_type(de, inode);
313
314 de = &dentry_blk->dentry[1];
315 de->hash_code = 0;
316 de->name_len = cpu_to_le16(2);
317 de->ino = cpu_to_le32(parent->i_ino);
318 memcpy(dentry_blk->filename[1], "..", 2);
319 set_de_type(de, inode);
320
321 test_and_set_bit_le(0, &dentry_blk->dentry_bitmap);
322 test_and_set_bit_le(1, &dentry_blk->dentry_bitmap);
323 kunmap_atomic(dentry_blk);
324
325 set_page_dirty(dentry_page);
326 f2fs_put_page(dentry_page, 1);
327 return 0;
328 }
329
330 static struct page *init_inode_metadata(struct inode *inode,
331 struct inode *dir, const struct qstr *name)
332 {
333 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
334 struct page *page;
335 int err;
336
337 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
338 page = new_inode_page(inode);
339 if (IS_ERR(page))
340 return page;
341
342 if (S_ISDIR(inode->i_mode)) {
343 err = make_empty_dir(inode, dir, page);
344 if (err)
345 goto error;
346 }
347
348 err = f2fs_init_acl(inode, dir, page);
349 if (err)
350 goto put_error;
351
352 err = f2fs_init_security(inode, dir, name, page);
353 if (err)
354 goto put_error;
355 } else {
356 page = get_node_page(F2FS_SB(dir->i_sb), inode->i_ino);
357 if (IS_ERR(page))
358 return page;
359
360 set_cold_node(inode, page);
361 }
362
363 if (name)
364 init_dent_inode(name, page);
365
366 /*
367 * This file should be checkpointed during fsync.
368 * We lost i_pino from now on.
369 */
370 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
371 file_lost_pino(inode);
372 /*
373 * If link the tmpfile to alias through linkat path,
374 * we should remove this inode from orphan list.
375 */
376 if (inode->i_nlink == 0)
377 remove_orphan_inode(sbi, inode->i_ino);
378 inc_nlink(inode);
379 }
380 return page;
381
382 put_error:
383 f2fs_put_page(page, 1);
384 error:
385 /* once the failed inode becomes a bad inode, i_mode is S_IFREG */
386 truncate_inode_pages(&inode->i_data, 0);
387 truncate_blocks(inode, 0);
388 remove_dirty_dir_inode(inode);
389 remove_inode_page(inode);
390 return ERR_PTR(err);
391 }
392
393 static void update_parent_metadata(struct inode *dir, struct inode *inode,
394 unsigned int current_depth)
395 {
396 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
397 if (S_ISDIR(inode->i_mode)) {
398 inc_nlink(dir);
399 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
400 }
401 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
402 }
403 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
404 mark_inode_dirty(dir);
405
406 if (F2FS_I(dir)->i_current_depth != current_depth) {
407 F2FS_I(dir)->i_current_depth = current_depth;
408 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
409 }
410
411 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
412 clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
413 }
414
415 static int room_for_filename(struct f2fs_dentry_block *dentry_blk, int slots)
416 {
417 int bit_start = 0;
418 int zero_start, zero_end;
419 next:
420 zero_start = find_next_zero_bit_le(&dentry_blk->dentry_bitmap,
421 NR_DENTRY_IN_BLOCK,
422 bit_start);
423 if (zero_start >= NR_DENTRY_IN_BLOCK)
424 return NR_DENTRY_IN_BLOCK;
425
426 zero_end = find_next_bit_le(&dentry_blk->dentry_bitmap,
427 NR_DENTRY_IN_BLOCK,
428 zero_start);
429 if (zero_end - zero_start >= slots)
430 return zero_start;
431
432 bit_start = zero_end + 1;
433
434 if (zero_end + 1 >= NR_DENTRY_IN_BLOCK)
435 return NR_DENTRY_IN_BLOCK;
436 goto next;
437 }
438
439 /*
440 * Caller should grab and release a rwsem by calling f2fs_lock_op() and
441 * f2fs_unlock_op().
442 */
443 int __f2fs_add_link(struct inode *dir, const struct qstr *name,
444 struct inode *inode)
445 {
446 unsigned int bit_pos;
447 unsigned int level;
448 unsigned int current_depth;
449 unsigned long bidx, block;
450 f2fs_hash_t dentry_hash;
451 struct f2fs_dir_entry *de;
452 unsigned int nbucket, nblock;
453 size_t namelen = name->len;
454 struct page *dentry_page = NULL;
455 struct f2fs_dentry_block *dentry_blk = NULL;
456 int slots = GET_DENTRY_SLOTS(namelen);
457 struct page *page;
458 int err = 0;
459 int i;
460
461 dentry_hash = f2fs_dentry_hash(name);
462 level = 0;
463 current_depth = F2FS_I(dir)->i_current_depth;
464 if (F2FS_I(dir)->chash == dentry_hash) {
465 level = F2FS_I(dir)->clevel;
466 F2FS_I(dir)->chash = 0;
467 }
468
469 start:
470 if (unlikely(current_depth == MAX_DIR_HASH_DEPTH))
471 return -ENOSPC;
472
473 /* Increase the depth, if required */
474 if (level == current_depth)
475 ++current_depth;
476
477 nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level);
478 nblock = bucket_blocks(level);
479
480 bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level,
481 (le32_to_cpu(dentry_hash) % nbucket));
482
483 for (block = bidx; block <= (bidx + nblock - 1); block++) {
484 dentry_page = get_new_data_page(dir, NULL, block, true);
485 if (IS_ERR(dentry_page))
486 return PTR_ERR(dentry_page);
487
488 dentry_blk = kmap(dentry_page);
489 bit_pos = room_for_filename(dentry_blk, slots);
490 if (bit_pos < NR_DENTRY_IN_BLOCK)
491 goto add_dentry;
492
493 kunmap(dentry_page);
494 f2fs_put_page(dentry_page, 1);
495 }
496
497 /* Move to next level to find the empty slot for new dentry */
498 ++level;
499 goto start;
500 add_dentry:
501 f2fs_wait_on_page_writeback(dentry_page, DATA);
502
503 down_write(&F2FS_I(inode)->i_sem);
504 page = init_inode_metadata(inode, dir, name);
505 if (IS_ERR(page)) {
506 err = PTR_ERR(page);
507 goto fail;
508 }
509 de = &dentry_blk->dentry[bit_pos];
510 de->hash_code = dentry_hash;
511 de->name_len = cpu_to_le16(namelen);
512 memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
513 de->ino = cpu_to_le32(inode->i_ino);
514 set_de_type(de, inode);
515 for (i = 0; i < slots; i++)
516 test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
517 set_page_dirty(dentry_page);
518
519 /* we don't need to mark_inode_dirty now */
520 F2FS_I(inode)->i_pino = dir->i_ino;
521 update_inode(inode, page);
522 f2fs_put_page(page, 1);
523
524 update_parent_metadata(dir, inode, current_depth);
525 fail:
526 up_write(&F2FS_I(inode)->i_sem);
527
528 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
529 update_inode_page(dir);
530 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
531 }
532 kunmap(dentry_page);
533 f2fs_put_page(dentry_page, 1);
534 return err;
535 }
536
537 int f2fs_do_tmpfile(struct inode *inode, struct inode *dir)
538 {
539 struct page *page;
540 int err = 0;
541
542 down_write(&F2FS_I(inode)->i_sem);
543 page = init_inode_metadata(inode, dir, NULL);
544 if (IS_ERR(page)) {
545 err = PTR_ERR(page);
546 goto fail;
547 }
548 /* we don't need to mark_inode_dirty now */
549 update_inode(inode, page);
550 f2fs_put_page(page, 1);
551
552 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
553 fail:
554 up_write(&F2FS_I(inode)->i_sem);
555 return err;
556 }
557
558 /*
559 * It only removes the dentry from the dentry page,corresponding name
560 * entry in name page does not need to be touched during deletion.
561 */
562 void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
563 struct inode *inode)
564 {
565 struct f2fs_dentry_block *dentry_blk;
566 unsigned int bit_pos;
567 struct address_space *mapping = page->mapping;
568 struct inode *dir = mapping->host;
569 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
570 int i;
571
572 lock_page(page);
573 f2fs_wait_on_page_writeback(page, DATA);
574
575 dentry_blk = page_address(page);
576 bit_pos = dentry - dentry_blk->dentry;
577 for (i = 0; i < slots; i++)
578 test_and_clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
579
580 /* Let's check and deallocate this dentry page */
581 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
582 NR_DENTRY_IN_BLOCK,
583 0);
584 kunmap(page); /* kunmap - pair of f2fs_find_entry */
585 set_page_dirty(page);
586
587 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
588
589 if (inode) {
590 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
591
592 down_write(&F2FS_I(inode)->i_sem);
593
594 if (S_ISDIR(inode->i_mode)) {
595 drop_nlink(dir);
596 update_inode_page(dir);
597 }
598 inode->i_ctime = CURRENT_TIME;
599 drop_nlink(inode);
600 if (S_ISDIR(inode->i_mode)) {
601 drop_nlink(inode);
602 i_size_write(inode, 0);
603 }
604 up_write(&F2FS_I(inode)->i_sem);
605 update_inode_page(inode);
606
607 if (inode->i_nlink == 0)
608 add_orphan_inode(sbi, inode->i_ino);
609 else
610 release_orphan_inode(sbi);
611 }
612
613 if (bit_pos == NR_DENTRY_IN_BLOCK) {
614 truncate_hole(dir, page->index, page->index + 1);
615 clear_page_dirty_for_io(page);
616 ClearPageUptodate(page);
617 inode_dec_dirty_dents(dir);
618 }
619 f2fs_put_page(page, 1);
620 }
621
622 bool f2fs_empty_dir(struct inode *dir)
623 {
624 unsigned long bidx;
625 struct page *dentry_page;
626 unsigned int bit_pos;
627 struct f2fs_dentry_block *dentry_blk;
628 unsigned long nblock = dir_blocks(dir);
629
630 for (bidx = 0; bidx < nblock; bidx++) {
631 dentry_page = get_lock_data_page(dir, bidx);
632 if (IS_ERR(dentry_page)) {
633 if (PTR_ERR(dentry_page) == -ENOENT)
634 continue;
635 else
636 return false;
637 }
638
639
640 dentry_blk = kmap_atomic(dentry_page);
641 if (bidx == 0)
642 bit_pos = 2;
643 else
644 bit_pos = 0;
645 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
646 NR_DENTRY_IN_BLOCK,
647 bit_pos);
648 kunmap_atomic(dentry_blk);
649
650 f2fs_put_page(dentry_page, 1);
651
652 if (bit_pos < NR_DENTRY_IN_BLOCK)
653 return false;
654 }
655 return true;
656 }
657
658 static int f2fs_readdir(struct file *file, struct dir_context *ctx)
659 {
660 struct inode *inode = file_inode(file);
661 unsigned long npages = dir_blocks(inode);
662 unsigned int bit_pos = 0;
663 struct f2fs_dentry_block *dentry_blk = NULL;
664 struct f2fs_dir_entry *de = NULL;
665 struct page *dentry_page = NULL;
666 struct file_ra_state *ra = &file->f_ra;
667 unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK);
668 unsigned char d_type = DT_UNKNOWN;
669
670 bit_pos = ((unsigned long)ctx->pos % NR_DENTRY_IN_BLOCK);
671
672 /* readahead for multi pages of dir */
673 if (npages - n > 1 && !ra_has_index(ra, n))
674 page_cache_sync_readahead(inode->i_mapping, ra, file, n,
675 min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES));
676
677 for (; n < npages; n++) {
678 dentry_page = get_lock_data_page(inode, n);
679 if (IS_ERR(dentry_page))
680 continue;
681
682 dentry_blk = kmap(dentry_page);
683 while (bit_pos < NR_DENTRY_IN_BLOCK) {
684 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
685 NR_DENTRY_IN_BLOCK,
686 bit_pos);
687 if (bit_pos >= NR_DENTRY_IN_BLOCK)
688 break;
689
690 de = &dentry_blk->dentry[bit_pos];
691 if (de->file_type < F2FS_FT_MAX)
692 d_type = f2fs_filetype_table[de->file_type];
693 else
694 d_type = DT_UNKNOWN;
695 if (!dir_emit(ctx,
696 dentry_blk->filename[bit_pos],
697 le16_to_cpu(de->name_len),
698 le32_to_cpu(de->ino), d_type))
699 goto stop;
700
701 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
702 ctx->pos = n * NR_DENTRY_IN_BLOCK + bit_pos;
703 }
704 bit_pos = 0;
705 ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK;
706 kunmap(dentry_page);
707 f2fs_put_page(dentry_page, 1);
708 dentry_page = NULL;
709 }
710 stop:
711 if (dentry_page && !IS_ERR(dentry_page)) {
712 kunmap(dentry_page);
713 f2fs_put_page(dentry_page, 1);
714 }
715
716 return 0;
717 }
718
719 const struct file_operations f2fs_dir_operations = {
720 .llseek = generic_file_llseek,
721 .read = generic_read_dir,
722 .iterate = f2fs_readdir,
723 .fsync = f2fs_sync_file,
724 .unlocked_ioctl = f2fs_ioctl,
725 };
ubuntu-bionic-kernel mirror