fs/ntfs3: Limit binary search table size

Browse source

Current binary search allocates memory for table and fill whole table
before we start actual binary search. This is quite inefficient because
table fill will always be O(n). Also if table is huge we need to
reallocate memory which is costly.

This implementation use just stack memory and always when table is full
we will check if last element is <= and if not start table fill again.
The idea was that it would be same cost as table reallocation.

Signed-off-by: Kari Argillander <kari.argillander@gmail.com>
Signed-off-by: Konstantin Komarov <almaz.alexandrovich@paragon-software.com>

...

This commit is contained in:

Kari Argillander 2021-09-02 18:40:48 +03:00 • committed by Konstantin Komarov

parent 9c2aadd0fd

commit 162333efa8

No known key found for this signature in database

GPG key ID: A9B0331F832407B6

1 changed files with 41 additions and 69 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download patch file Download diff file Expand all files Collapse all files

114

fs/ntfs3/index.c

View file