RFR: 8332268: C2: Add missing optimizations for UDivI/L and UModI/L and unify the shared logic with the signed nodes

[Quan Anh Mai]

On Wed, 13 Nov 2024 09:45:37 GMT, theoweidmannoracle <duke at openjdk.org> wrote:

> This PR introduces
> - several new optimizations to unsigned division and modulo
>    - x % 1, x % x, x % 2^k
>    - x / 1, x / x, x / 2^k 
>    - does not implement the Granlund and Montgomery algorithm, which has been implemented for signed modulo division in the past. It is unclear if a lot is to be gained by implementing this.
> - tests to test existing optimizations for signed division and modulo 
>    - does not test the Granlund and Montgomery algorithm directly

This seems similar to #9947 . Feel free to take over if you are working on this as I am not working on the PR right now and I forgot which state it is in.

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

PR Comment: https://git.openjdk.org/jdk/pull/22061#issuecomment-2473300847