RFR: 8282365: Consolidate and improve division by constant idealizations [v44]

[Raffaello Giulietti]

On Mon, 22 Jan 2024 11:44:50 GMT, Raffaello Giulietti <rgiulietti at openjdk.org> wrote:

> such a case, the smallest c is b and the smallest s is e, and a result meeting s >= min_s doesn't need any iterative algorithm.

I must correct this claim, my bad.
A result meeting `s >= min_s` might still need an iterative algorithm if `e < min_s` and if `c` must be minimal.

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

PR Review Comment: https://git.openjdk.org/jdk/pull/9947#discussion_r1463286075