Request for Reviews (S): JDK-8003585 strength reduce or eliminate range checks for power-of-two sized arrays

[Roland Westrelin]

I’m picking that one up. Here is a new webrev:

http://cr.openjdk.java.net/~roland/8003585/webrev.00/

The only change to c2 compared to the previous webrev is that ((x & m) u< m+1) is optimized the same way ((x & m) u<= m) is. Actually, I don’t think that C2 currently produces the ((x & m) u<= m) shape. The IfNode::fold_compares() logic produces the ((x & m) u< m+1) variant. I also added a test case to check the validity of the transformations and ran usual testing on the change.

Roland.