| commit | ef9297007e9904588682699e618c56401f61d1c2 | [log] [tgz] |
|---|---|---|
| author | Kari Argillander <kari.argillander@gmail.com> | Thu Sep 02 18:40:49 2021 +0300 |
| committer | Konstantin Komarov <almaz.alexandrovich@paragon-software.com> | Mon Sep 13 19:41:46 2021 +0300 |
| tree | cb57d22b955150be0d78cc85cb34adcd63c1da4b | |
| parent | 162333efa8dc4984d2ca0a2eb85528e13366f271 [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>