RFR: 8290781: Segfault at PhaseIdealLoop::clone_loop_handle_data_uses [v3]
Tobias Hartmann
thartmann at openjdk.org
Wed Aug 31 09:22:09 UTC 2022
On Mon, 29 Aug 2022 09:13:18 GMT, Roland Westrelin <roland at openjdk.org> wrote:
>> In the test case, both:
>>
>> v1 = array[i];
>> (in the first loop), and
>>
>> v += array[i-1];
>>
>> (in the second one) access the same element. The bound check for the
>> second access is optimized out and the load of that access becomes
>> control dependent on the range check of the first one.
>>
>> In the context of loop strip mining, data nodes that are in the outer
>> loop are expected to be reachable from the safepoint node. There are
>> rare case when it's not the case so I added logic to fix those cases
>> before loop cloning. That logic covers both nodes that have control in
>> the outer loop and control input in the outer loop. That logic is
>> incorrect (in the case of a node with a control input in the outer
>> loop): when cloning the first loop body, that logic finds the load
>> referenced from the range check in the loop body. That load has a
>> control input that's in the inner loop. But the logic only check
>> whether it's in the outer loop: anything in the inner loop is also in
>> the outer loop with that logic. The control of the load is then
>> wrongly updated to be outside the outer loop. That then causes a crash
>> because the load is recorded as being in the body of the second loop
>> but its control is not.
>>
>> The fix I propose stengthen the logic that checks for nodes in the
>> outer loop: it checks that the control input is in the outer loop but
>> not in the inner loop.
>
> Roland Westrelin has updated the pull request incrementally with one additional commit since the last revision:
>
> Update src/hotspot/share/opto/loopopts.cpp
>
> Co-authored-by: Tobias Hartmann <tobias.hartmann at oracle.com>
All tests passed.
-------------
PR: https://git.openjdk.org/jdk/pull/9997
More information about the hotspot-compiler-dev
mailing list