tree a10630cd929436890867a1512f1aeec45bcc4254
parent 41785370054e878b634254ef6262b9eb6e641583
author Karthika Devi C <quic_kartc@quicinc.com> 1707774572 +0530
committer Copybara-Service <copybara-worker@google.com> 1707774887 -0800

[polly] Make reduction detection checks more robust - part 2 (#80721)

Existing reduction detection algorithm does two types of memory checks
before marking a load store pair as reduction.
Second check is to verify there is no other memory access in ScopStmt
overlapping with the memory of load and store that forms the reduction.
Existing check misses cases where there could be probable overlap such
as
	A[V] += A[P];
In the above case there is chance of overlap between A[V] and A[P] which
is missed.
This commit addresses this by removing the parameter from space before
checking for compatible space.

Part 1 of this patch :
[75297](https://github.com/llvm/llvm-project/pull/75297)

GitOrigin-RevId: 283feb42ee509cc56fb75316b4fd86b53a714cf4