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

[theoweidmannoracle]

> 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

theoweidmannoracle has updated the pull request incrementally with two additional commits since the last revision:

 - Fix space
 - Add missing UDiv/UMod cases to no_dependent_zero_check and cannot_split_division

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

Changes:
  - all: https://git.openjdk.org/jdk/pull/22061/files
  - new: https://git.openjdk.org/jdk/pull/22061/files/ce5a3521..94425ea6

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=22061&range=18
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=22061&range=17-18

  Stats: 10 lines in 2 files changed: 8 ins; 0 del; 2 mod
  Patch: https://git.openjdk.org/jdk/pull/22061.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/22061/head:pull/22061

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