Integrated: 8335444: Generalize implementation of AndNode mul_ring

[Jasmine Karthikeyan]

On Mon, 8 Jul 2024 03:37:30 GMT, Jasmine Karthikeyan <jkarthikeyan at openjdk.org> wrote:

> Hi all,
> I've written this patch which improves type calculation for bitwise-and functions. Previously, the only cases that were considered were if one of the inputs to the node were a positive constant. I've generalized this behavior, as well as added a case to better estimate the result for arbitrary ranges. Since these are very common patterns to see, this can help propagate more precise types throughout the ideal graph for a large number of methods, making other optimizations and analyses stronger. I was interested in where this patch improves types, so I ran CTW for `java_base` and `java_base_2` and printed out the differences in this gist [here](https://gist.github.com/jaskarth/b45260d81ab621656f4a55cc51cf5292). While I don't think it's particularly complicated I've also added some discussion of the mathematics below, mostly because I thought it was interesting to work through :)
> 
> This patch passes tier1-3 testing on my linux x64 machine. Thoughts and reviews would be very appreciated!

This pull request has now been integrated.

Changeset: 92431049
Author:    Jasmine Karthikeyan <jkarthikeyan at openjdk.org>
URL:       https://git.openjdk.org/jdk/commit/92431049fd1838ced2019366b7ccb37547ae6127
Stats:     269 lines in 5 files changed: 219 ins; 37 del; 13 mod

8335444: Generalize implementation of AndNode mul_ring

Reviewed-by: chagedorn, qamai, dfenacci

-------------

PR: https://git.openjdk.org/jdk/pull/20066