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

Make specialized parsers for Word32 and Word64. #278

Merged
merged 1 commit into from
Dec 13, 2018

Conversation

judah
Copy link
Collaborator

@judah judah commented Dec 13, 2018

Previously they were implemented by a loop that didn't optimize well.

This speeds up the benchmark from #277 (decoding repeated floats, reflected)
by a factor of 2.6x. Specifically, the float-packed/decode and float-unpacked/decode benchmarks dropped from ~225us to ~85us.


This change is Reviewable

Previously they were implemented by a loop that didn't optimize well.

This speeds up the benchmark from #277 (decoding repeated floats)
by a factor of 2.6x.  Specifically, the `float-packed/decode` and `float-unpacked/decode` benchmarks dropped from ~225us to ~85us.
@judah judah force-pushed the optimize-get-fixed branch from 19cd54c to 381bd6b Compare December 13, 2018 01:16
@judah judah changed the title Optimize get fixed Make specialized parsers for Word32 and Word64. Dec 13, 2018
@blackgnezdo blackgnezdo merged commit 8dc5e85 into master Dec 13, 2018
@blackgnezdo blackgnezdo deleted the optimize-get-fixed branch December 13, 2018 05:02
ylecornec pushed a commit to ylecornec/proto-lens that referenced this pull request Feb 19, 2024
Previously they were implemented by a loop that didn't optimize well.

This speeds up the benchmark from google#277 (decoding repeated floats)
by a factor of 2.6x.  Specifically, the `float-packed/decode` and `float-unpacked/decode` benchmarks dropped from ~225us to ~85us.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants