]> git.baikalelectronics.ru Git - kernel.git/commit
projects / kernel.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: b9b779a) | patch
f2fs: remove costly bit operations for f2fs_find_entry
authorJaegeuk Kim <jaegeuk.kim@samsung.com>
Thu, 27 Feb 2014 04:57:53 +0000 (13:57 +0900)
committerJaegeuk Kim <jaegeuk.kim@samsung.com>
Thu, 27 Feb 2014 07:25:20 +0000 (16:25 +0900)
commit1ba2c7e3f31fcf1891de34839ba416593816e123
treef8322c1f8231485ea6f19a815e73527777d52ca9tree | snapshot
parentb9b779ac7ec43a0083be310ad6faaa67146f3acfcommit | 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>
fs/f2fs/dir.c diff | blob | history
Linux Kernel Source Tree.