Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

consider switching from hash table for large allocations to an arena-based red-black tree to satisfy range requests for malloc_object_size #35

Open
thestinger opened this issue Sep 5, 2018 · 0 comments
Labels

Comments

@thestinger
Copy link
Member

thestinger commented Sep 5, 2018

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.

@thestinger thestinger added enhancement New feature or request security labels Sep 5, 2018
@thestinger 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 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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant