1fa7b972c0
This commit imports the latest isl version into lib/External/isl. The changes
relavant for Polly are:
1) Schedule trees [1] have been introduced as a more structured way to
describe schedules. Polly does not yet use them, but we may switch to them
in the near future.
2) Another set of coalescing changes [2] simplifies some data dependences and
removes a couple of code generation artifacts.
We now understand that the following sets can be merged:
{ Stmt_S1[i0, i1] -> Stmt_S2[i0 + i1] :
i0 >= 0 and i1 <= 1023 - i0 and i1 >= 1
Stmt_S1[i0, 0] -> Stmt_S2[i0] : i0 <= 1023 and i0 >= 1}
into:
{ Stmt_S1[i0, i1] -> Stmt_S2[i0 + i1] : i1 <= 1023 - i0 and i1 >= 0 and
i1 >= 1 - i0 and i0 >= 0 }
Changes of this kind reduce unnecessary specialization during code
generation.
- for (int c3 = 0; c3 <= 1023; c3 += 1) {
- if (c3 % 2 == 0) {
- Stmt_for_body3(c1, c3);
- } else
- Stmt_for_body3(c1, c3);
- }
+ for (int c3 = 0; c3 <= 1023; c3 += 1)
+ Stmt_for_body3(c1, c3);
[1] http://impact.gforge.inria.fr/impact2014/papers/impact2014-verdoolaege.pdf
[2] http://impact.gforge.inria.fr/impact2015/papers/impact2015-verdoolaege.pdf
llvm-svn: 229423
11 lines
308 B
Plaintext
11 lines
308 B
Plaintext
# Check that the most appropriate lower bound is selected
|
|
[t1,t2]->{ S[i,j] -> [i,j] : exists (alpha, beta :
|
|
0 <= i <= 1 &&
|
|
t1 = j+128alpha &&
|
|
0 <= j+2beta < 128 &&
|
|
510 <= t2+2beta <= 514 &&
|
|
0 <= 2beta - t2 <= 5
|
|
)}
|
|
[t1,t2] -> {: 125 <= t1 <= 127 and 254 <= t2 < 257}
|
|
{[i,j] -> unroll[x]}
|