[llvm] [DA] runtime predicates for delinearization bounds checks (PR #170713)

[Sebastian Pop via llvm-commits]

sebpop wrote:

> functionality like `BatchDA` is implemented

I know how "batch delinearization" works: collect all data references in the current function, sort by base pointers, and perform delinearization on all arrays accessing the same base pointer.

"batchDA" is different, and I believe the loop optimizations would need to bound or focus DA to a given region containing loops.
DA is currently not bound to a given loop nest or set of loops.
In contrast, Polly is bound to a SCoP which is a single-entry / single-exit region of the CFG.

https://github.com/llvm/llvm-project/pull/170713