Cascaded Multi Size Based Allocators Achiving the 'infinite' space ability as ACE_Malloc #2135
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…_TAO into cascadedAllocator
2. using instead of typedef
…to cascadedAllocator not updated
2、make simple for statement at one line 3、add the pool_sum API for component transparency 4、move pool_depth API from INL file to source file for its complexity
2、modify the test case to use lock strategy, that will more likely find some compiling error than free lock
for exception safety
use smart ptr by std::unique_ptr
delete defence codes for strong exception guarantee
2、delete defensive codes for resize call when exception
modify the invalid document
…cascadedMalloc sync from github
sync from cascadedAllocator
sync for coding style
1、right const 2、pointer var declaration
sync from cascadedAllocator for coding style
…ly the first and last allocator has free chunks
merge the optimization of the last allocator branch judgement
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
ACE_Mallocmemory pool has only one linked list,so when it has a very long list and has various, random chunk size distribution, the cost of its memory management is great.
In our case, the
freeAPI ofACE_Mallochas consumed much CPU time.So I use the
ACE_Cascaded_Dynamic_Cached_Allocatorclass provided in my previous PR to form a allocator hierarchy with various fixed-size achieving the 'infinite' space ability asACE_Mallocby a cost of O(1).Main Design
Use size-based allocator to reduce the cost of malloc/free
Decrease
ACE_Cascaded_Dynamic_Cached_Allocator's initial_n_chunks constructor parameter according to the hierarchy level, butcan be adjusted by a threshold
min_initial_n_chunksparameterIncrease
ACE_Cascaded_Dynamic_Cached_Allocator's chunk_size constructor parameter according to the hierarchy level, it will enable bigger chunks can be malloced