[SYCL-MLIR][DetectReduction] Version loop to check for non-overlapping accessors

[whitneywhtsang]

There can be other operations in a loop that may alias with the detect reduction candidate.
In order to perform detect reduction safely in those situation, loop versioning is required.

Original loop:

for(size_t i = 0; i < 8; ++i)
  A[0] += B[i];

Optimized loop:

if (&A[A.get_range()] <= &B[0] || &A[0] >= &B[B.get_range()]) {
  a = A[0];
  for(size_t i = 0; i < 8; i++) 
    a += B[i];
  A[0] = a;
} else 
  for(size_t i = 0; i < 8; i++) 
    A[0] += B[i];

The design used for DetectReduction in this PR is very similar to LICM, will work on a better design for both loop versioning in a different PR.