RFR: 8347555: [REDO] C2: implement optimization for series of Add of unique value [v14]

[Dean Long]

On Thu, 10 Apr 2025 20:18:20 GMT, Kangcheng Xu <kxu at openjdk.org> wrote:

>> [JDK-8347555](https://bugs.openjdk.org/browse/JDK-8347555) is a redo of [JDK-8325495](https://bugs.openjdk.org/browse/JDK-8325495) was [first merged](https://git.openjdk.org/jdk/pull/20754) then backed out due to a regression. This patch redos the feature and fixes the bit shift overflow problem. For more information please refer to the previous PR.
>> 
>> When constanlizing multiplications (possibly in forms on `lshifts`), the multiplier is upgraded to long and then later narrowed to int if needed. However, when a `lshift` operand is exactly `32`, overflowing an int, using long has an unexpected result. (i.e., `(1 << 32) = 1` and `(int) (1L << 32) = 0`)
>> 
>> The following was implemented to address this issue.
>> 
>> if (UseNewCode2) {
>>     *multiplier = bt == T_INT
>>         ? (jlong) (1 << con->get_int()) // loss of precision is expected for int as it overflows
>>         : ((jlong) 1) << con->get_int();
>> } else {
>>     *multiplier = ((jlong) 1 << con->get_int());
>> }
>> 
>> 
>> Two new bitshift overflow tests were added.
>
> Kangcheng Xu has updated the pull request incrementally with one additional commit since the last revision:
> 
>   fix typo: lhs->rhs

src/hotspot/share/utilities/globalDefinitions.hpp line 1278:

> 1276: JAVA_INTEGER_SHIFT_BASIC_TYPE(java_shift_right)
> 1277: JAVA_INTEGER_SHIFT_BASIC_TYPE(java_shift_right_unsigned)
> 1278: 

Couldn't this be written as a template, so we could use java_shift_left<T_INT>(x,y) or java_shift_left<jint>(x.y)?

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

PR Review Comment: https://git.openjdk.org/jdk/pull/23506#discussion_r2038329474