OSDN Git Service

(root) / uclinux-h8 / linux.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 162333e) | 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)
commitef9297007e9904588682699e618c56401f61d1c2
treecb57d22b955150be0d78cc85cb34adcd63c1da4btree | snapshot
parent162333efa8dc4984d2ca0a2eb85528e13366f271commit | 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
About OSDN
Find Software
Develop Software
Help