diff options
| author | Kari Argillander <kari.argillander@gmail.com> | 2021-09-02 18:40:49 +0300 |
|---|---|---|
| committer | Konstantin Komarov <almaz.alexandrovich@paragon-software.com> | 2021-09-13 19:41:46 +0300 |
| commit | ef9297007e9904588682699e618c56401f61d1c2 (patch) | |
| tree | cb57d22b955150be0d78cc85cb34adcd63c1da4b /fs/ntfs3/ntfs.h | |
| parent | 162333efa8dc4984d2ca0a2eb85528e13366f271 (diff) | |
| download | linux-stable-ef9297007e9904588682699e618c56401f61d1c2.tar.gz linux-stable-ef9297007e9904588682699e618c56401f61d1c2.tar.bz2 linux-stable-ef9297007e9904588682699e618c56401f61d1c2.zip | |
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>
Diffstat (limited to 'fs/ntfs3/ntfs.h')
0 files changed, 0 insertions, 0 deletions