> 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).
Quan Anh Mai has updated the pull request incrementally with one additional commit since the last revision: Too early bailout ------------- Changes: - all: https://git.openjdk.org/jdk/pull/31033/files - new: https://git.openjdk.org/jdk/pull/31033/files/ee875385..1499111a Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=31033&range=08 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=31033&range=07-08 Stats: 8 lines in 1 file changed: 4 ins; 4 del; 0 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
