| /src/external/mit/isl/dist/test_inputs/codegen/ |
| atomic.c | 1 for (int c0 = 0; c0 <= 10; c0 += 1) {
2 if (c0 <= 9)
3 a(c0); variable
4 if (c0 >= 1)
5 b(c0 - 1);
|
| atomic2.c | 1 for (int c0 = ((b0 + 32767) % 32768) + 1; c0 <= 65534; c0 += 32768)
2 A(c0); variable
|
| bilinear.c | 2 for (int c0 = 0; c0 < -(-d % 2) - d + w; c0 += 1) {
3 A(c0); variable
4 B(c0); variable
7 for (int c0 = 0; c0 < (d % 2) - d + w; c0 += 1)
8 A(c0); variable
|
| /src/external/mit/isl/dist/test_inputs/codegen/cloog/ |
| 4-param.c | 1 for (int c0 = p; c0 <= min(m - 1, q); c0 += 1)
2 S2(c0); variable
3 for (int c0 = m; c0 <= min(n, p - 1); c0 += 1)
4 S1(c0); variable
5 for (int c0 = max(m, p); c0 <= min(n, q); c0 += 1)
6 S1(c0); variable
7 S2(c0); variable
10 S2(c0); variable
12 S1(c0); variable
[all...] |
| basic-bounds-1.c | 1 for (int c0 = 0; c0 <= 2; c0 += 1)
2 S1(c0); variable
|
| basic-bounds-3.c | 1 for (int c0 = 0; c0 <= M; c0 += 1)
2 S1(c0); variable
|
| basic-bounds-4.c | 1 for (int c0 = 0; c0 <= M + 1; c0 += 1)
2 S1(c0); variable
|
| block3.c | 2 for (int c0 = 0; c0 <= 1; c0 += 1)
3 S3(c0); variable
|
| cholesky.c | 1 for (int c0 = 1; c0 <= n; c0 += 1) {
2 S1(c0); variable
3 for (int c1 = 1; c1 < c0; c1 += 1)
4 S2(c0, c1);
5 S3(c0); variable
6 for (int c1 = c0 + 1; c1 <= n; c1 += 1) {
7 S4(c0, c1);
8 for (int c2 = 1; c2 < c0; c2 += 1
[all...] |
| dealII.c | 1 for (int c0 = 0; c0 <= min(min(T_2 - 1, T_67 - 1), T_66); c0 += 1) {
2 S1(c0); variable
3 S2(c0); variable
5 for (int c0 = T_2; c0 <= min(T_67 - 1, T_66); c0 += 1)
6 S2(c0); variable
7 for (int c0 = max(0, T_66 + 1); c0 < min(T_2, T_67); c0 += 1
8 S1(c0); variable
10 S1(c0); variable
11 S2(c0); variable
14 S1(c0); variable
[all...] |
| dot2.c | 1 for (int c0 = 1; c0 <= min(M, N); c0 += 1) {
2 S1(c0); variable
4 S2(c0, c1);
6 for (int c0 = N + 1; c0 <= M; c0 += 1)
7 S1(c0); variable
8 for (int c0 = M + 1; c0 <= N; c0 += 1
[all...] |
| emploi.c | 1 for (int c0 = 1; c0 <= n; c0 += 1) {
2 S1(c0); variable
4 S2(c0, c1);
|
| esced.c | 1 for (int c0 = 1; c0 <= m; c0 += 1) {
2 S1(c0); variable
4 S2(c0, c1);
|
| gesced.c | 1 for (int c0 = 1; c0 <= N; c0 += 1)
2 S1(c0); variable
3 for (int c0 = N + 1; c0 <= 2 * N; c0 += 1)
5 S2(c1, -N + c0);
6 for (int c0 = 2 * N + 1; c0 <= M + N; c0 += 1)
[all...] |
| guide.c | 1 for (int c0 = 1; c0 <= N; c0 += 1)
2 S1(c0); variable
3 for (int c0 = N + 1; c0 <= 2 * N; c0 += 1)
4 S2(c0); variable
|
| iftest.c | 1 for (int c0 = 1; c0 <= n; c0 += 1)
2 S1(c0); variable
|
| infinite2.c | 1 for (int c0 = 1; c0 <= N; c0 += 1) {
2 S1(c0); variable
4 S2(c0, c1);
6 for (int c0 = N + 1; 1; c0 += 1)
7 S1(c0); variable
|
| lex.c | 1 for (int c0 = 0; c0 <= 10; c0 += 1) {
2 S2(c0); variable
3 S1(c0); variable
|
| merge.c | 2 for (int c0 = 0; c0 <= 10; c0 += 1) {
3 if (c0 >= 2)
4 S2(c0); variable
5 S3(c0); variable
|
| min-4-1.c | 1 for (int c0 = max(-M, -N); c0 <= min(N, O); c0 += 1)
2 S1(c0); variable
|
| mod.c | 1 for (int c0 = 0; c0 <= 3; c0 += 1)
2 if ((c0 + 1) % 3 >= 1)
3 S1(c0); variable
|
| mod2.c | 1 for (int c0 = 0; c0 <= 3; c0 += 1)
2 if ((c0 + 1) % 3 >= 1)
3 S1(c0); variable
|
| orc.c | 1 for (int c0 = 0; c0 <= 2; c0 += 1) {
2 S1(c0); variable
3 for (int c1 = 0; c1 <= -c0 + 11; c1 += 1) {
4 S2(c0, c1);
5 S3(c0, c1);
7 S4(c0); variable
9 for (int c0 = 0; c0 <= 14; c0 += 1)
10 S5(c0); variable
13 S7(c0); variable
[all...] |
| param-split.c | 1 for (int c0 = 0; c0 <= max(0, M); c0 += 1) {
2 if (M >= c0)
3 S1(c0); variable
4 if (c0 == 0)
|
| reservoir-QR.c | 21 for (int c0 = 2; c0 < N; c0 += 1) {
22 for (int c1 = c0 - 1; c1 < N; c1 += 1) {
23 S6(c0 - 2, c1);
24 for (int c2 = c0 - 2; c2 < M; c2 += 1)
25 S7(c0 - 2, c1, c2);
26 S8(c0 - 2, c1);
27 for (int c2 = c0 - 2; c2 < M; c2 += 1)
28 S9(c0 - 2, c1, c2)
36 S1(c0); variable
[all...] |
