| /src/external/mit/isl/dist/test_inputs/codegen/cloog/ |
| reservoir-mg-psinv.c | 3 for (int c3 = 1; c3 <= M; c3 += 1) {
4 S1(c0, (c1 + 1) / 2, c3);
5 S2(c0, (c1 + 1) / 2, c3);
7 for (int c3 = 2; c3 < M; c3 += 1)
8 S3(c0, (c1 + 1) / 2, c3);
|
| reservoir-mg-resid.c | 3 for (int c3 = 1; c3 <= M; c3 += 1) {
4 S1(c0, (c1 + 1) / 2, c3);
5 S2(c0, (c1 + 1) / 2, c3);
7 for (int c3 = 2; c3 < M; c3 += 1)
8 S3(c0, (c1 + 1) / 2, c3);
|
| gauss.c | 3 for (int c3 = 1; c3 < c0; c3 += 1)
4 S1(c0, c3, c1);
5 for (int c3 = c0 + 1; c3 <= M; c3 += 1)
6 S2(c0, c3, c1);
|
| reservoir-jacobi3.c | 3 for (int c3 = 2; c3 < N; c3 += 1)
4 S1(c0, c2, c3);
6 for (int c3 = 2; c3 < N; c3 += 1)
7 S2(c0, c2, c3);
|
| reservoir-pingali6.c | 3 for (int c3 = 2; c3 < N; c3 += 1)
4 S1(c0, c2, c3);
6 for (int c3 = 2; c3 < N; c3 += 1)
7 S2(c0, c2, c3);
|
| reservoir-mg-interp.c | 3 for (int c3 = 1; c3 <= M; c3 += 1)
4 S1(c0, 1, c3);
5 for (int c3 = 1; c3 < M; c3 += 1) {
6 S6(c0, 1, c3);
7 S7(c0, 1, c3);
10 for (int c3 = 1; c3 <= M; c3 += 1
[all...] |
| reservoir-loechner4.c | 4 for (int c3 = max(1, -M + c0); c3 <= min(M, c0 - 1); c3 += 1)
5 S1(c2, c1, c3, c0 - c3);
|
| /src/external/mit/isl/dist/test_inputs/codegen/omega/ |
| fc1-0.c | 2 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
3 s0(c0 + 1, n - c3);
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
6 s1(c0 + 1, n - c3, c6);
|
| fc2-0.c | 2 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
3 s0(c0 + 1, n - c3);
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
6 s1(c0 + 1, n - c3, c6);
|
| ts1d-orig0-0.c | 4 for (int c3 = 0; c3 < N; c3 += 1)
5 s1(2, c1, 0, c3, 1);
6 for (int c3 = 1; c3 < N - 1; c3 += 1)
7 s2(2, c1, 1, c3, 1);
|
| lift1-2.c | 5 for (int c3 = 1; c3 <= 100; c3 += 1)
7 s1(c0, c1, c2, c3, c4);
9 for (int c3 = 1; c3 <= 100; c3 += 1)
11 s1(c0, c1, c2, c3, c4);
12 s0(c0, c1, c2, c3, c4);
|
| fc1-1.c | 1 for (int c3 = 1; c3 <= n; c3 += 1)
2 s2(c3); variable
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
5 s0(c0 + 1, n - c3);
6 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1
[all...] |
| fc1-2.c | 1 for (int c3 = 1; c3 <= n; c3 += 1)
2 s2(c3); variable
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
5 s0(c0 + 1, n - c3);
6 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1
[all...] |
| fc2-1.c | 1 for (int c3 = 1; c3 <= n; c3 += 1)
2 s2(c3); variable
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1)
5 s0(c0 + 1, n - c3);
6 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1
[all...] |
| lift2-2.c | 5 for (int c3 = 1; c3 <= 100; c3 += 1)
7 s1(c0, c1, c2, c3, c4);
9 for (int c3 = 1; c3 <= 100; c3 += 1)
11 s1(c0, c1, c2, c3, c4);
13 for (int c3 = 1; c3 <= 100; c3 += 1
[all...] |
| lift2-3.c | 5 for (int c3 = 1; c3 <= 100; c3 += 1)
7 s1(c0, c1, c2, c3, c4);
10 for (int c3 = 1; c3 <= 100; c3 += 1)
12 s1(c0, c1, c2, c3, c4);
15 for (int c3 = 1; c3 <= 100; c3 += 1
[all...] |
| chosol-0.c | 4 for (int c3 = c1 + 1; c3 <= n; c3 += 1)
5 s1(c3, c1);
|
| chosol-1.c | 4 for (int c3 = c1 + 1; c3 <= n; c3 += 1)
5 s1(c3, c1);
|
| lu_ijk-2.c | 4 for (int c3 = 1; c3 < c1; c3 += 1)
5 s1(c3, c1, c0);
7 for (int c3 = 1; c3 < c0; c3 += 1)
8 s1(c3, c1, c0);
|
| lift1-0.c | 4 for (int c3 = 1; c3 <= 100; c3 += 1)
6 s1(c0, c1, c2, c3, c4);
8 s0(c0, c1, c2, c3, c4);
|
| /src/external/mit/isl/dist/test_inputs/codegen/ |
| stride.c | 2 for (int c3 = 0; c3 <= 100; c3 += 1)
3 A(c0, c3);
|
| separation_class4.c | 4 for (int c3 = 0; c3 <= 1; c3 += 1)
5 for (int c5 = c3 + 58; c5 <= -c3 + 61; c5 += 1)
6 S_0(c3, c5);
9 for (int c3 = max(4 * c0 - 2, 4 * c0 + 6 * c2 - 12); c3 <= min(4 * c0 + 1, 4 * c0 + 6 * c2 - 7); c3 += 1)
10 for (int c5 = max(4 * c0 - c3 + 57, -4 * c0 + c3 + 58); c5 <= min(4 * c0 - c3 + 61, -4 * c0 + c3 + 62); c5 += 1
[all...] |
| disjuncts.c | 4 for (int c3 = 0; c3 <= n; c3 += 1)
6 a(c0, c1, c3, c4);
7 for (int c3 = 0; c3 <= n; c3 += 1)
9 b(c0, c1, c3, c4);
|
| isolate7.c | 5 for (int c3 = 0; c3 <= 31; c3 += 1)
6 S_1(c0 + c2, c1 + c3);
9 for (int c3 = 0; c3 < n - c1; c3 += 1)
10 S_1(c0 + c2, c1 + c3);
18 for (int c3 = 0; c3 <= 31; c3 += 1
[all...] |
| separation_class2.c | 4 for (int c3 = 0; c3 <= 7; c3 += 1)
5 A(c0 + c2, c1 + c3);
7 for (int c3 = 0; c3 < n % 8; c3 += 1)
8 A(c0 + c2, -(n % 8) + n + c3);
12 for (int c3 = 0; c3 <= min(7, n - c1 - 1); c3 += 1
[all...] |
