]> git.baikalelectronics.ru Git - kernel.git/commit
projects / kernel.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: aaa70b7) | patch
fs/ntfs3: Make binary search to search smaller chunks in beginning
authorKari Argillander <kari.argillander@gmail.com>
Thu, 2 Sep 2021 15:40:49 +0000 (18:40 +0300)
committerKonstantin Komarov <almaz.alexandrovich@paragon-software.com>
Mon, 13 Sep 2021 16:41:46 +0000 (19:41 +0300)
commit166390e11757dda5fc1917d7cf55f5fc562b73c5
treecb57d22b955150be0d78cc85cb34adcd63c1da4btree | snapshot
parentaaa70b757929e52b289371122b6865a3a7734b45commit | diff
fs/ntfs3: Make binary search to search smaller chunks in beginning

We could try to optimize algorithm to first fill just small table and
after that use bigger table all the way up to ARRAY_SIZE(offs). This
way we can use bigger search array, but not lose benefits with entry
count smaller < ARRAY_SIZE(offs).

Signed-off-by: Kari Argillander <kari.argillander@gmail.com>
Signed-off-by: Konstantin Komarov <almaz.alexandrovich@paragon-software.com>
fs/ntfs3/index.c diff | blob | history
Linux Kernel Source Tree.