A simple optimization proposal
maaartinus at gmail.com
Wed Feb 12 09:40:30 PST 2014
Most hash tables are power-of-two sized so that they can use masking for
the access. It looks like the bounds check doesn't get eliminated, although
it could be.
Based on the equivalence a[x & (a.length - 1)] throws if and only if a.length
== 0, I'm proposing this simple algorithm:
- For each array access, check if the index has been computed via a
- If so, check if either of the operands was computed as length minus
- If so, replace the bounds check by a zero-length check.
This zero-length check can then be easily moved out of the loop by the
I hope I'm not talking non-sense. For more details see
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the hotspot-compiler-dev