You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current implementation will lead to only being able to provide size results for offsets into the initial page(s) of a large allocation, since with a hash table there isn't a way to find the closest previous match.
This would have a performance cost compared to the hash table for allocation, and would also make malloc_object_size significantly slower. It might make sense as a configuration option, or perhaps it's not worth doing at all.
The text was updated successfully, but these errors were encountered:
thestinger
changed the title
switch from hash table to an arena-based red-black tree to satisfy range requests for malloc_object_size
switch from hash table for large allocations to an arena-based red-black tree to satisfy range requests for malloc_object_size
Sep 5, 2018
thestinger
changed the title
switch from hash table for large allocations to an arena-based red-black tree to satisfy range requests for malloc_object_size
consider switching from hash table for large allocations to an arena-based red-black tree to satisfy range requests for malloc_object_size
Feb 14, 2019
The current implementation will lead to only being able to provide size results for offsets into the initial page(s) of a large allocation, since with a hash table there isn't a way to find the closest previous match.
This would have a performance cost compared to the hash table for allocation, and would also make malloc_object_size significantly slower. It might make sense as a configuration option, or perhaps it's not worth doing at all.
The text was updated successfully, but these errors were encountered: