f2fs: optimize do_write_data_page()
[linux-block.git] / fs / f2fs / dir.c
CommitLineData
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
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)
25{
26 if (level < MAX_DIR_HASH_DEPTH / 2)
27 return 1 << level;
28 else
29 return 1 << ((MAX_DIR_HASH_DEPTH / 2) - 1);
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
40static 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
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
62static void set_de_type(struct f2fs_dir_entry *de, struct inode *inode)
63{
0ecc833b 64 umode_t mode = inode->i_mode;
6b4ea016
JK
65 de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT];
66}
67
68static unsigned long dir_block_index(unsigned int 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) * bucket_blocks(i);
75 bidx += idx * bucket_blocks(level);
76 return bidx;
77}
78
9836b8b9 79static bool early_match_name(const char *name, size_t namelen,
6b4ea016
JK
80 f2fs_hash_t namehash, struct f2fs_dir_entry *de)
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
91static struct f2fs_dir_entry *find_in_block(struct page *dentry_page,
9836b8b9 92 const char *name, size_t namelen, int *max_slots,
6b4ea016
JK
93 f2fs_hash_t namehash, struct page **res_page)
94{
95 struct f2fs_dir_entry *de;
96 unsigned long bit_pos, end_pos, next_pos;
97 struct f2fs_dentry_block *dentry_blk = kmap(dentry_page);
98 int slots;
99
100 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
101 NR_DENTRY_IN_BLOCK, 0);
102 while (bit_pos < NR_DENTRY_IN_BLOCK) {
103 de = &dentry_blk->dentry[bit_pos];
457d08ee 104 slots = GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
6b4ea016
JK
105
106 if (early_match_name(name, namelen, namehash, de)) {
107 if (!memcmp(dentry_blk->filename[bit_pos],
108 name, namelen)) {
109 *res_page = dentry_page;
110 goto found;
111 }
112 }
113 next_pos = bit_pos + slots;
114 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
115 NR_DENTRY_IN_BLOCK, next_pos);
116 if (bit_pos >= NR_DENTRY_IN_BLOCK)
117 end_pos = NR_DENTRY_IN_BLOCK;
118 else
119 end_pos = bit_pos;
120 if (*max_slots < end_pos - next_pos)
121 *max_slots = end_pos - next_pos;
122 }
123
124 de = NULL;
125 kunmap(dentry_page);
126found:
127 return de;
128}
129
130static struct f2fs_dir_entry *find_in_level(struct inode *dir,
9836b8b9 131 unsigned int level, const char *name, size_t namelen,
6b4ea016
JK
132 f2fs_hash_t namehash, struct page **res_page)
133{
457d08ee 134 int s = GET_DENTRY_SLOTS(namelen);
6b4ea016
JK
135 unsigned int nbucket, nblock;
136 unsigned int bidx, end_block;
137 struct page *dentry_page;
138 struct f2fs_dir_entry *de = NULL;
139 bool room = false;
140 int max_slots = 0;
141
142 BUG_ON(level > MAX_DIR_HASH_DEPTH);
143
144 nbucket = dir_buckets(level);
145 nblock = bucket_blocks(level);
146
25ca923b 147 bidx = dir_block_index(level, le32_to_cpu(namehash) % nbucket);
6b4ea016
JK
148 end_block = bidx + nblock;
149
150 for (; bidx < end_block; bidx++) {
151 /* no need to allocate new dentry pages to all the indices */
c718379b 152 dentry_page = find_data_page(dir, bidx, true);
6b4ea016
JK
153 if (IS_ERR(dentry_page)) {
154 room = true;
155 continue;
156 }
157
158 de = find_in_block(dentry_page, name, namelen,
159 &max_slots, namehash, res_page);
160 if (de)
161 break;
162
163 if (max_slots >= s)
164 room = true;
165 f2fs_put_page(dentry_page, 0);
166 }
167
168 if (!de && room && F2FS_I(dir)->chash != namehash) {
169 F2FS_I(dir)->chash = namehash;
170 F2FS_I(dir)->clevel = level;
171 }
172
173 return de;
174}
175
176/*
177 * Find an entry in the specified directory with the wanted name.
178 * It returns the page where the entry was found (as a parameter - res_page),
179 * and the entry itself. Page is returned mapped and unlocked.
180 * Entry is guaranteed to be valid.
181 */
182struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
183 struct qstr *child, struct page **res_page)
184{
185 const char *name = child->name;
9836b8b9 186 size_t namelen = child->len;
6b4ea016
JK
187 unsigned long npages = dir_blocks(dir);
188 struct f2fs_dir_entry *de = NULL;
189 f2fs_hash_t name_hash;
190 unsigned int max_depth;
191 unsigned int level;
192
5a20d339
JK
193 if (namelen > F2FS_NAME_LEN)
194 return NULL;
195
6b4ea016
JK
196 if (npages == 0)
197 return NULL;
198
199 *res_page = NULL;
200
201 name_hash = f2fs_dentry_hash(name, namelen);
202 max_depth = F2FS_I(dir)->i_current_depth;
203
204 for (level = 0; level < max_depth; level++) {
205 de = find_in_level(dir, level, name,
206 namelen, 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
217struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p)
218{
4777f86b
NJ
219 struct page *page;
220 struct f2fs_dir_entry *de;
221 struct f2fs_dentry_block *dentry_blk;
6b4ea016
JK
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
234ino_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
250void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
251 struct page *page, struct inode *inode)
252{
6b4ea016
JK
253 lock_page(page);
254 wait_on_page_writeback(page);
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);
6666e6aa
JK
261
262 /* update parent inode number before releasing dentry page */
263 F2FS_I(inode)->i_pino = dir->i_ino;
264
6b4ea016 265 f2fs_put_page(page, 1);
6b4ea016
JK
266}
267
44a83ff6 268static void init_dent_inode(const struct qstr *name, struct page *ipage)
6b4ea016 269{
6b4ea016
JK
270 struct f2fs_node *rn;
271
53dc9a67 272 /* copy name info. to this inode page */
6b4ea016 273 rn = (struct f2fs_node *)page_address(ipage);
53dc9a67
AV
274 rn->i.i_namelen = cpu_to_le32(name->len);
275 memcpy(rn->i.i_name, name->name, name->len);
6b4ea016
JK
276 set_page_dirty(ipage);
277}
278
44a83ff6
JK
279static int make_empty_dir(struct inode *inode,
280 struct inode *parent, struct page *page)
39936837
JK
281{
282 struct page *dentry_page;
283 struct f2fs_dentry_block *dentry_blk;
284 struct f2fs_dir_entry *de;
285 void *kaddr;
286
44a83ff6 287 dentry_page = get_new_data_page(inode, page, 0, true);
39936837
JK
288 if (IS_ERR(dentry_page))
289 return PTR_ERR(dentry_page);
290
291 kaddr = kmap_atomic(dentry_page);
292 dentry_blk = (struct f2fs_dentry_block *)kaddr;
293
294 de = &dentry_blk->dentry[0];
295 de->name_len = cpu_to_le16(1);
296 de->hash_code = 0;
297 de->ino = cpu_to_le32(inode->i_ino);
298 memcpy(dentry_blk->filename[0], ".", 1);
299 set_de_type(de, inode);
300
301 de = &dentry_blk->dentry[1];
302 de->hash_code = 0;
303 de->name_len = cpu_to_le16(2);
304 de->ino = cpu_to_le32(parent->i_ino);
305 memcpy(dentry_blk->filename[1], "..", 2);
306 set_de_type(de, inode);
307
308 test_and_set_bit_le(0, &dentry_blk->dentry_bitmap);
309 test_and_set_bit_le(1, &dentry_blk->dentry_bitmap);
310 kunmap_atomic(kaddr);
311
312 set_page_dirty(dentry_page);
313 f2fs_put_page(dentry_page, 1);
314 return 0;
315}
316
44a83ff6 317static struct page *init_inode_metadata(struct inode *inode,
69f24eac 318 struct inode *dir, const struct qstr *name)
6b4ea016 319{
44a83ff6
JK
320 struct page *page;
321 int err;
322
6b4ea016 323 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
44a83ff6
JK
324 page = new_inode_page(inode, name);
325 if (IS_ERR(page))
326 return page;
6b4ea016
JK
327
328 if (S_ISDIR(inode->i_mode)) {
44a83ff6
JK
329 err = make_empty_dir(inode, dir, page);
330 if (err)
331 goto error;
6b4ea016
JK
332 }
333
334 err = f2fs_init_acl(inode, dir);
44a83ff6
JK
335 if (err)
336 goto error;
337
8ae8f162
JK
338 err = f2fs_init_security(inode, dir, name, page);
339 if (err)
340 goto error;
341
44a83ff6 342 wait_on_page_writeback(page);
6b4ea016 343 } else {
44a83ff6
JK
344 page = get_node_page(F2FS_SB(dir->i_sb), inode->i_ino);
345 if (IS_ERR(page))
346 return page;
347
348 wait_on_page_writeback(page);
349 set_cold_node(inode, page);
6b4ea016 350 }
44a83ff6
JK
351
352 init_dent_inode(name, page);
353
83d5d6f6
JK
354 /*
355 * This file should be checkpointed during fsync.
356 * We lost i_pino from now on.
357 */
358 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) {
359 set_cp_file(inode);
6b4ea016 360 inc_nlink(inode);
83d5d6f6 361 }
44a83ff6
JK
362 return page;
363
364error:
365 f2fs_put_page(page, 1);
366 remove_inode_page(inode);
367 return ERR_PTR(err);
6b4ea016
JK
368}
369
370static void update_parent_metadata(struct inode *dir, struct inode *inode,
371 unsigned int current_depth)
372{
6b4ea016
JK
373 if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) {
374 if (S_ISDIR(inode->i_mode)) {
375 inc_nlink(dir);
699489bb 376 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
6b4ea016
JK
377 }
378 clear_inode_flag(F2FS_I(inode), FI_NEW_INODE);
379 }
380 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
381 if (F2FS_I(dir)->i_current_depth != current_depth) {
382 F2FS_I(dir)->i_current_depth = current_depth;
699489bb 383 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
6b4ea016
JK
384 }
385
699489bb 386 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR))
39936837 387 update_inode_page(dir);
6b4ea016
JK
388 else
389 mark_inode_dirty(dir);
390
391 if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK))
392 clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
393}
394
395static int room_for_filename(struct f2fs_dentry_block *dentry_blk, int slots)
396{
397 int bit_start = 0;
398 int zero_start, zero_end;
399next:
400 zero_start = find_next_zero_bit_le(&dentry_blk->dentry_bitmap,
401 NR_DENTRY_IN_BLOCK,
402 bit_start);
403 if (zero_start >= NR_DENTRY_IN_BLOCK)
404 return NR_DENTRY_IN_BLOCK;
405
406 zero_end = find_next_bit_le(&dentry_blk->dentry_bitmap,
407 NR_DENTRY_IN_BLOCK,
408 zero_start);
409 if (zero_end - zero_start >= slots)
410 return zero_start;
411
412 bit_start = zero_end + 1;
413
414 if (zero_end + 1 >= NR_DENTRY_IN_BLOCK)
415 return NR_DENTRY_IN_BLOCK;
416 goto next;
417}
418
39936837
JK
419/*
420 * Caller should grab and release a mutex by calling mutex_lock_op() and
421 * mutex_unlock_op().
422 */
b7f7a5e0 423int __f2fs_add_link(struct inode *dir, const struct qstr *name, struct inode *inode)
6b4ea016
JK
424{
425 unsigned int bit_pos;
426 unsigned int level;
427 unsigned int current_depth;
428 unsigned long bidx, block;
429 f2fs_hash_t dentry_hash;
430 struct f2fs_dir_entry *de;
431 unsigned int nbucket, nblock;
b7f7a5e0 432 size_t namelen = name->len;
6b4ea016
JK
433 struct page *dentry_page = NULL;
434 struct f2fs_dentry_block *dentry_blk = NULL;
457d08ee 435 int slots = GET_DENTRY_SLOTS(namelen);
44a83ff6 436 struct page *page;
6b4ea016
JK
437 int err = 0;
438 int i;
439
b7f7a5e0 440 dentry_hash = f2fs_dentry_hash(name->name, name->len);
6b4ea016
JK
441 level = 0;
442 current_depth = F2FS_I(dir)->i_current_depth;
443 if (F2FS_I(dir)->chash == dentry_hash) {
444 level = F2FS_I(dir)->clevel;
445 F2FS_I(dir)->chash = 0;
446 }
447
448start:
449 if (current_depth == MAX_DIR_HASH_DEPTH)
450 return -ENOSPC;
451
452 /* Increase the depth, if required */
453 if (level == current_depth)
454 ++current_depth;
455
456 nbucket = dir_buckets(level);
457 nblock = bucket_blocks(level);
458
25ca923b 459 bidx = dir_block_index(level, (le32_to_cpu(dentry_hash) % nbucket));
6b4ea016
JK
460
461 for (block = bidx; block <= (bidx + nblock - 1); block++) {
64aa7ed9 462 dentry_page = get_new_data_page(dir, NULL, block, true);
39936837 463 if (IS_ERR(dentry_page))
6b4ea016 464 return PTR_ERR(dentry_page);
6b4ea016
JK
465
466 dentry_blk = kmap(dentry_page);
467 bit_pos = room_for_filename(dentry_blk, slots);
468 if (bit_pos < NR_DENTRY_IN_BLOCK)
469 goto add_dentry;
470
471 kunmap(dentry_page);
472 f2fs_put_page(dentry_page, 1);
6b4ea016
JK
473 }
474
475 /* Move to next level to find the empty slot for new dentry */
476 ++level;
477 goto start;
478add_dentry:
6b4ea016
JK
479 wait_on_page_writeback(dentry_page);
480
44a83ff6
JK
481 page = init_inode_metadata(inode, dir, name);
482 if (IS_ERR(page)) {
483 err = PTR_ERR(page);
484 goto fail;
485 }
6b4ea016 486 de = &dentry_blk->dentry[bit_pos];
25ca923b 487 de->hash_code = dentry_hash;
6b4ea016 488 de->name_len = cpu_to_le16(namelen);
b7f7a5e0 489 memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
6b4ea016
JK
490 de->ino = cpu_to_le32(inode->i_ino);
491 set_de_type(de, inode);
492 for (i = 0; i < slots; i++)
493 test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
494 set_page_dirty(dentry_page);
6666e6aa 495
44a83ff6 496 /* we don't need to mark_inode_dirty now */
6666e6aa 497 F2FS_I(inode)->i_pino = dir->i_ino;
44a83ff6
JK
498 update_inode(inode, page);
499 f2fs_put_page(page, 1);
500
501 update_parent_metadata(dir, inode, current_depth);
6b4ea016 502fail:
699489bb 503 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
6b4ea016
JK
504 kunmap(dentry_page);
505 f2fs_put_page(dentry_page, 1);
6b4ea016
JK
506 return err;
507}
508
0a8165d7 509/*
6b4ea016
JK
510 * It only removes the dentry from the dentry page,corresponding name
511 * entry in name page does not need to be touched during deletion.
512 */
513void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
514 struct inode *inode)
515{
516 struct f2fs_dentry_block *dentry_blk;
517 unsigned int bit_pos;
518 struct address_space *mapping = page->mapping;
519 struct inode *dir = mapping->host;
520 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
457d08ee 521 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
6b4ea016
JK
522 void *kaddr = page_address(page);
523 int i;
524
6b4ea016
JK
525 lock_page(page);
526 wait_on_page_writeback(page);
527
528 dentry_blk = (struct f2fs_dentry_block *)kaddr;
529 bit_pos = dentry - (struct f2fs_dir_entry *)dentry_blk->dentry;
530 for (i = 0; i < slots; i++)
531 test_and_clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
532
533 /* Let's check and deallocate this dentry page */
534 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
535 NR_DENTRY_IN_BLOCK,
536 0);
537 kunmap(page); /* kunmap - pair of f2fs_find_entry */
538 set_page_dirty(page);
539
540 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
541
542 if (inode && S_ISDIR(inode->i_mode)) {
543 drop_nlink(dir);
39936837 544 update_inode_page(dir);
6b4ea016
JK
545 } else {
546 mark_inode_dirty(dir);
547 }
548
549 if (inode) {
16379987 550 inode->i_ctime = CURRENT_TIME;
6b4ea016
JK
551 drop_nlink(inode);
552 if (S_ISDIR(inode->i_mode)) {
553 drop_nlink(inode);
554 i_size_write(inode, 0);
555 }
39936837
JK
556 update_inode_page(inode);
557
6b4ea016
JK
558 if (inode->i_nlink == 0)
559 add_orphan_inode(sbi, inode->i_ino);
560 }
561
562 if (bit_pos == NR_DENTRY_IN_BLOCK) {
6b4ea016
JK
563 truncate_hole(dir, page->index, page->index + 1);
564 clear_page_dirty_for_io(page);
565 ClearPageUptodate(page);
566 dec_page_count(sbi, F2FS_DIRTY_DENTS);
567 inode_dec_dirty_dents(dir);
6b4ea016 568 }
508198be 569 f2fs_put_page(page, 1);
6b4ea016
JK
570}
571
572bool f2fs_empty_dir(struct inode *dir)
573{
574 unsigned long bidx;
575 struct page *dentry_page;
576 unsigned int bit_pos;
577 struct f2fs_dentry_block *dentry_blk;
578 unsigned long nblock = dir_blocks(dir);
579
580 for (bidx = 0; bidx < nblock; bidx++) {
581 void *kaddr;
582 dentry_page = get_lock_data_page(dir, bidx);
583 if (IS_ERR(dentry_page)) {
584 if (PTR_ERR(dentry_page) == -ENOENT)
585 continue;
586 else
587 return false;
588 }
589
590 kaddr = kmap_atomic(dentry_page);
591 dentry_blk = (struct f2fs_dentry_block *)kaddr;
592 if (bidx == 0)
593 bit_pos = 2;
594 else
595 bit_pos = 0;
596 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
597 NR_DENTRY_IN_BLOCK,
598 bit_pos);
599 kunmap_atomic(kaddr);
600
601 f2fs_put_page(dentry_page, 1);
602
603 if (bit_pos < NR_DENTRY_IN_BLOCK)
604 return false;
605 }
606 return true;
607}
608
609static int f2fs_readdir(struct file *file, void *dirent, filldir_t filldir)
610{
611 unsigned long pos = file->f_pos;
496ad9aa 612 struct inode *inode = file_inode(file);
6b4ea016
JK
613 unsigned long npages = dir_blocks(inode);
614 unsigned char *types = NULL;
615 unsigned int bit_pos = 0, start_bit_pos = 0;
616 int over = 0;
617 struct f2fs_dentry_block *dentry_blk = NULL;
618 struct f2fs_dir_entry *de = NULL;
619 struct page *dentry_page = NULL;
620 unsigned int n = 0;
621 unsigned char d_type = DT_UNKNOWN;
622 int slots;
623
624 types = f2fs_filetype_table;
625 bit_pos = (pos % NR_DENTRY_IN_BLOCK);
626 n = (pos / NR_DENTRY_IN_BLOCK);
627
628 for ( ; n < npages; n++) {
629 dentry_page = get_lock_data_page(inode, n);
630 if (IS_ERR(dentry_page))
631 continue;
632
633 start_bit_pos = bit_pos;
634 dentry_blk = kmap(dentry_page);
635 while (bit_pos < NR_DENTRY_IN_BLOCK) {
636 d_type = DT_UNKNOWN;
637 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
638 NR_DENTRY_IN_BLOCK,
639 bit_pos);
640 if (bit_pos >= NR_DENTRY_IN_BLOCK)
641 break;
642
643 de = &dentry_blk->dentry[bit_pos];
644 if (types && de->file_type < F2FS_FT_MAX)
645 d_type = types[de->file_type];
646
647 over = filldir(dirent,
648 dentry_blk->filename[bit_pos],
649 le16_to_cpu(de->name_len),
650 (n * NR_DENTRY_IN_BLOCK) + bit_pos,
651 le32_to_cpu(de->ino), d_type);
652 if (over) {
653 file->f_pos += bit_pos - start_bit_pos;
654 goto success;
655 }
457d08ee 656 slots = GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
6b4ea016
JK
657 bit_pos += slots;
658 }
659 bit_pos = 0;
660 file->f_pos = (n + 1) * NR_DENTRY_IN_BLOCK;
661 kunmap(dentry_page);
662 f2fs_put_page(dentry_page, 1);
663 dentry_page = NULL;
664 }
665success:
666 if (dentry_page && !IS_ERR(dentry_page)) {
667 kunmap(dentry_page);
668 f2fs_put_page(dentry_page, 1);
669 }
670
671 return 0;
672}
673
674const struct file_operations f2fs_dir_operations = {
675 .llseek = generic_file_llseek,
676 .read = generic_read_dir,
677 .readdir = f2fs_readdir,
678 .fsync = f2fs_sync_file,
679 .unlocked_ioctl = f2fs_ioctl,
680};