Increase performance of libelf section list#8
Open
mhorne wants to merge 1 commit intoemaste:trunkfrom
mhorne:trunk
Open
Increase performance of libelf section list#8mhorne wants to merge 1 commit intoemaste:trunkfrom mhorne:trunk
mhorne wants to merge 1 commit intoemaste:trunkfrom
mhorne:trunk
Conversation
The existing internal section list is implemented as a singly-linked tail queue, and exhibits poor (O(n)) performance for some library functions (e.g. elf_getscn(), elf_strptr()). By replacing the queue with a resizable array, we can obtain O(1) access time and O(1) insertion time, since each section already keeps track of its own index.
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
The existing internal section list is implemented as a singly-linked
tail queue, and exhibits poor (O(n)) performance for some library
functions (e.g. elf_getscn(), elf_strptr()).
By replacing the queue with a resizable array, we can obtain O(1) access
time and O(1) insertion time, since each section already keeps track of
its own index.