diff options
author | Tobias Grosser <tobias@grosser.es> | 2015-03-19 07:27:29 +0000 |
---|---|---|
committer | Tobias Grosser <tobias@grosser.es> | 2015-03-19 07:27:29 +0000 |
commit | 1de4e381ca058f8afa2c2b47d33f28e7a055eb0b (patch) | |
tree | 71c02ad56db29f7832bf49147ba2f94420c29da6 /polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c | |
parent | 91141e87b1459035f54220be68b2d66112637ed1 (diff) | |
download | bcm5719-llvm-1de4e381ca058f8afa2c2b47d33f28e7a055eb0b.tar.gz bcm5719-llvm-1de4e381ca058f8afa2c2b47d33f28e7a055eb0b.zip |
Update isl to 94d707d
The major improvements are:
- Extended schedule tree support
- AST generation from schedule trees
llvm-svn: 232709
Diffstat (limited to 'polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c')
-rw-r--r-- | polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c b/polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c index c786628d804..9d290b514f3 100644 --- a/polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c +++ b/polly/lib/External/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c @@ -1,11 +1,11 @@ -for (int c1 = 5; c1 <= 5 * M; c1 += 1) { - for (int c3 = max(2, floord(-M + c1, 4)); c3 < min(M, (c1 + 1) / 3 - 2); c3 += 1) - for (int c5 = max(1, -M - c3 + (M + c1) / 2 - 2); c5 < min(c3, -2 * c3 + (c1 + c3) / 2 - 2); c5 += 1) - S1(c1 - 2 * c3 - 2 * c5 - 5, c3, c5); - for (int c3 = max(1, floord(-M + c1, 4)); c3 < (c1 + 1) / 5; c3 += 1) - S2(c1 - 4 * c3 - 3, c3); - if (c1 % 5 == 0) - S4(c1 / 5); - for (int c3 = max(-3 * M - c1 + 3 * ((M + c1) / 2) + 1, -((c1 - 1) % 3) + 3); c3 < (c1 + 1) / 5; c3 += 3) - S3((c1 - 2 * c3 - 1) / 3, c3); +for (int c0 = 5; c0 <= 5 * M; c0 += 1) { + for (int c1 = max(2, floord(-M + c0, 4)); c1 < min(-((5 * M - c0 + 1) % 2) + M, (c0 + 1) / 3 - 2); c1 += 1) + for (int c2 = max(1, -M - c1 + (M + c0) / 2 - 2); c2 < min(c1, -2 * c1 + (c0 + c1) / 2 - 2); c2 += 1) + S1(c0 - 2 * c1 - 2 * c2 - 5, c1, c2); + for (int c1 = max(1, floord(-M + c0, 4)); c1 < (c0 + 1) / 5; c1 += 1) + S2(c0 - 4 * c1 - 3, c1); + if (c0 % 5 == 0) + S4(c0 / 5); + for (int c1 = max(-3 * M - c0 + 3 * ((M + c0) / 2) + 1, -((c0 - 1) % 3) + 3); c1 < (c0 + 1) / 5; c1 += 3) + S3((c0 - 2 * c1 - 1) / 3, c1); } |