Hi, I was reminded of this forgotten PR when reviewing a counted loop transformation PR. The important point is that it is easier and more efficient to compute the trip count of a counted loop using unsigned division. Currently, for int counted loops, trip count is computed by extending the loop parameters to long and doing a signed long division. This cannot be applied to long counted loop. As a result, as a precondition for long counted loop predication, we need to be able to efficiently transform an unsigned division by constant.
For more information, please refer to #9947 . Testing: - [x] tier1-4,hs-comp-stress Please take a look and leave your review, thanks a lot. --------- - [x] I confirm that I make this contribution in accordance with the [OpenJDK Interim AI Policy](https://openjdk.org/legal/ai). ------------- Commit messages: - Fix IntegerDivValueTests - Fix merge conflicts - Merge branch 'master' into unsignedDiv - Merge branch 'master' into unsignedDiv - fix tests - Merge branch 'master' into unsignedDiv - further clarify variable meanings - just be simple - suggestion - update include order and license year - ... and 87 more: https://git.openjdk.org/jdk/compare/3e5b5dde...3bd44c25 Changes: https://git.openjdk.org/jdk/pull/31033/files Webrev: https://webrevs.openjdk.org/?repo=jdk&pr=31033&range=00 Issue: https://bugs.openjdk.org/browse/JDK-8282365 Stats: 2259 lines in 15 files changed: 1635 ins; 365 del; 259 mod Patch: https://git.openjdk.org/jdk/pull/31033.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/31033/head:pull/31033 PR: https://git.openjdk.org/jdk/pull/31033
