-
Notifications
You must be signed in to change notification settings - Fork 28
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
Making the project build and speeding up jarjar with optimization #10
Open
RemiNVG
wants to merge
2
commits into
google:master
Choose a base branch
from
RemiNVG:master
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
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
The project would currently not build at all, as it already uses 1.7 features like the diamond operator. Update to 1.8 so the project can build and reasonably recent features can be used.
A common use-case for jarjar is to have rule with the format my.package.name.**, or even my.package.name.MyClass with no wildcards. Jarjar will convert that pattern to a regular expression and do regular expression matching on every symbol it scans to determine if the rule matches. This is very inefficient as most symbols will not match, and a simple prefix match can rule out the match in most cases. When parsing rules, extract the plain-text prefix of each rule, which is everything before the first wildcard. Then index all rules by their prefix in a prefix trie. This allows: - Avoiding slow regular expression matches in most cases, as jarjar can immediately observe that there is no matching prefix in the map. - Scaling in O(log(n)) with the number of rules when they have distinct prefixes (instead of O(n), as a matching prefix can be found from the trie instead of looping through all rules. This was tested to make jarjar faster on the Android codebase (running all jarjar rules to build a device back-to-back goes from 295s to 270s), while keeping outputs byte-identical, and providing significant speedups when many jarjar rules are used.
@RemiNVG how did you get this to build? With your
change Adding:
to
|
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.
No description provided.