tools: Add C middle-processor to make builtin tables proper hash tables. #1731
Conversation
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
|
This was work done as part of the ESA project. Main reason for the PR is to advertise this new tool. |
|
Using this script to compile stmhal, pyboard gives a 2.5% increase in performance of pystone benchmark at zero cost of flash or RAM. Combining this with recent patch bbe8d51 takes pyboard pystone result from 1776 to 1901 (using 20000 iterations). |
|
Merged in 4bd95f8. |
|
Wow! Very cool Damien. |
tannewt
added a commit
to tannewt/circuitpython
that referenced
this pull request
Apr 3, 2019
Improved readability of Single Byte Bounds code
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.
This tool sits in between the C preprocessor and the C compiler. It takes the output of the C preprocessor and reorders any builtin tables to make them proper hash tables. Lookups at runtime then use hashing, not linear search. For large tables it makes the lookup a lot faster (don't have solid data though on speed improvements...).
See script for usage.