Displaying 4 results from an estimated 4 matches for "d75628".
2020 Mar 30
2
Scalar Evolution Expressions Involving Sibling Loops
...11:47 AM
Subject: Scalar Evolution Expressions Involving Sibling Loops
Hi Philip,
I hope you are doing well.
We've recently run into an issue with SCEV in the context of dependence
analysis, and would like your opinion on it. Background discussion can be
found here https://reviews.llvm.org/D75628#inline-689527.
Basically in this case, the dependence equation requires us to symbolically
create an expression involving two or more recurrences that recur with
non-dominating loops (sibling loops). Currently creating such a SCEV
expression trips asserts in `CompareSCEVComplexity()` and `
isKnown...
2020 Mar 30
2
Scalar Evolution Expressions Involving Sibling Loops
...wo
siblings (without one dominating the other), is useful?
The situation can happen with guarded loops or with a user guard like
below:
if (c) {
for (i = 0; i < n; i++)
...
}
for (j = 0; j < n; j++)
...
The specific example that we ran into is described in
https://reviews.llvm.org/D75628. Basically we have two triangular loops
that are siblings and we'd like to run Banerjee MIV tests on the memory
accesses in those loops. The loop looks like:
void foo(int *restrict A, int n1, int n2, int n3) {
for (int i1 = 0; i1 < n1; i1++) {
for (int i2 = 2; i2 < n2; i2++) {...
2020 Apr 16
2
Scalar Evolution Expressions Involving Sibling Loops
...etween two
siblings (without one dominating the other), is useful?
The situation can happen with guarded loops or with a user guard like
below:
if (c) {
for (i = 0; i < n; i++)
...
}
for (j = 0; j < n; j++)
...
The specific example that we ran into is described in
https://reviews.llvm.org/D75628. Basically we have two triangular loops
that are siblings and we'd like to run Banerjee MIV tests on the memory
accesses in those loops. The loop looks like:
void foo(int *restrict A, int n1, int n2, int n3) {
for (int i1 = 0; i1 < n1; i1++) {
for (int i2 = 2; i2 < n2; i2++) {
for (int i...
2020 Apr 17
2
Scalar Evolution Expressions Involving Sibling Loops
...etween two
siblings (without one dominating the other), is useful?
The situation can happen with guarded loops or with a user guard like
below:
if (c) {
for (i = 0; i < n; i++)
...
}
for (j = 0; j < n; j++)
...
The specific example that we ran into is described in
https://reviews.llvm.org/D75628. Basically we have two triangular loops
that are siblings and we'd like to run Banerjee MIV tests on the memory
accesses in those loops. The loop looks like:
void foo(int *restrict A, int n1, int n2, int n3) {
for (int i1 = 0; i1 < n1; i1++) {
for (int i2 = 2; i2 < n2; i2++) {
for (int i...