summaryrefslogtreecommitdiff
path: root/include/linux/f2fs_fs.h
diff options
context:
space:
mode:
authorJaegeuk Kim <jaegeuk.kim@samsung.com>2014-02-27 13:57:53 +0900
committerJaegeuk Kim <jaegeuk.kim@samsung.com>2014-02-27 16:25:20 +0900
commit5d0c667121bfc8be76d1580f485bddbe73465d1a (patch)
treef8322c1f8231485ea6f19a815e73527777d52ca9 /include/linux/f2fs_fs.h
parent8b8343fa9d503894ece57acbe46cb36883646685 (diff)
f2fs: remove costly bit operations for f2fs_find_entry
It turns out that a bit operation like find_next_bit is not always fast enough for f2fs_find_entry. Instead, it is pretty much simple and fast to traverse each dentries. Signed-off-by: Jaegeuk Kim <jaegeuk.kim@samsung.com>
Diffstat (limited to 'include/linux/f2fs_fs.h')
0 files changed, 0 insertions, 0 deletions