We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
See blog post Faster sorted array unions by reducing branches
The text was updated successfully, but these errors were encountered:
It seems to rely on a CMov which requires the user to set -XX:+UseCMoveUnconditionally but it looks worth experimenting with
-XX:+UseCMoveUnconditionally
Sorry, something went wrong.
This fellow seems to report that Java will use conditional moves just fine on its own...
https://ivansmirnov.wordpress.com/2015/06/14/confirmed-openjdk-jit-compiler-emits-efficient-conditional-move-machine-codes/
Note that the evaluation of both paths is without side-effect so I do not expect that conditional moves break the specification.
I was wrong, there is some up to date information on when cmov is used here https://shipilev.net/jvm/anatomy-quarks/30-conditional-moves/
I should say that whether it helps or not is tricky. If the branching is predictable, then it won't help and may even hurt us.
No branches or pull requests
See blog post Faster sorted array unions by reducing branches
The text was updated successfully, but these errors were encountered: