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
perf: optimize indexing in inner loops #4550
Comments
Please add more details here. I have to search different pages and source code to figure out exactly what you mean and what difference you observe between Clang and LDC. First thing that comes to mind is that for the D source, the optimizer is not able to prove that writing to |
Sorry, i thought using the diff would be enough, because my lack of expertise would have made me choose incorrect wording https://github.com/attractivechaos/plb2/pull/6/files Particularly the 2nd commit makes things even faster: Result in the comment in the 2nd paragraph: attractivechaos/plb2#6 (comment)
Thanks for the clear explanation PR got merged, result now is equal to what C with clang produce https://github.com/attractivechaos/plb2?tab=readme-ov-file#appendix-timing-on-apple-m1-macbook-pro |
Benchmark: attractivechaos/plb2#6
According to note [1], clang is able to optimize them, shouldn't LDC be able to as well?
[1] - https://github.com/attractivechaos/plb2?tab=readme-ov-file#optimizing-inner-loops
The text was updated successfully, but these errors were encountered: