HomeSort by: relevance | last modified time | path
    Searched refs:c4 (Results 1 - 25 of 198) sorted by relevancy

1 2 3 4 5 6 7 8

  /src/external/mit/isl/dist/test_inputs/codegen/
cholesky.c 3 for (int c4 = -c0 + 1997 * ((3 * c0 + 5990) / 5990) + 1; c4 <= 12; c4 += 1)
4 S_3(c4, -c0 + 1997 * ((3 * c0 + 5990) / 5990), 2 * c0 - 3993 * ((3 * c0 + 5990) / 5990));
separation_class3.c 10 for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1)
11 for (int c6 = -2 * c0 + c4 + 4; c6 <= 2 * c0 - c4 + 4; c6 += 1)
12 S_0(c4, c6);
15 for (int c4 = max(0, 2 * c0 - 1); c4 <= min(7, 2 * c0); c4 += 1)
16 for (int c6 = -2 * c0 + c4 + 8; c6 <= 8; c6 += 1
    [all...]
disjuncts.c 5 for (int c4 = 0; c4 <= n; c4 += 1)
6 a(c0, c1, c3, c4);
8 for (int c4 = 0; c4 <= n; c4 += 1)
9 b(c0, c1, c3, c4);
  /src/external/mit/isl/dist/test_inputs/codegen/omega/
lift1-1.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
9 for (int c4 = 1; c4 <= 100; c4 += 1) {
10 s1(c0, c1, c2, c3, c4);
11 s0(c0, c1, c2, c3, c4);
lift1-2.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
10 for (int c4 = 1; c4 <= 100; c4 += 1) {
11 s1(c0, c1, c2, c3, c4);
12 s0(c0, c1, c2, c3, c4);
collard-0.c 1 for (int c4 = 1; c4 <= n; c4 += 1)
2 s2(c4); variable
4 for (int c4 = 0; c4 < n - c1; c4 += 1)
5 s0(c1, n - c4);
7 for (int c4 = c1 + 1; c4 <= n; c4 += 1
    [all...]
lift2-1.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
9 for (int c4 = 1; c4 <= 100; c4 += 1)
10 s1(c0, c1, c2, c3, c4);
12 for (int c4 = 1; c4 <= 100; c4 += 1)
    [all...]
lift2-2.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
10 for (int c4 = 1; c4 <= 100; c4 += 1)
11 s1(c0, c1, c2, c3, c4);
14 for (int c4 = 1; c4 <= 100; c4 += 1)
    [all...]
lift2-3.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
11 for (int c4 = 1; c4 <= 100; c4 += 1)
12 s1(c0, c1, c2, c3, c4);
16 for (int c4 = 1; c4 <= 100; c4 += 1)
    [all...]
lift1-0.c 5 for (int c4 = 1; c4 <= 100; c4 += 1) {
6 s1(c0, c1, c2, c3, c4);
8 s0(c0, c1, c2, c3, c4);
lift2-4.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
12 for (int c4 = 1; c4 <= 100; c4 += 1)
13 s1(c0, c1, c2, c3, c4);
18 for (int c4 = 1; c4 <= 100; c4 += 1)
    [all...]
lift2-5.c 5 for (int c4 = 1; c4 <= 100; c4 += 1)
6 s1(c0, c1, c2, c3, c4);
11 for (int c4 = 1; c4 <= 100; c4 += 1) {
12 s1(c0, c1, c2, c3, c4);
13 s0(c0, c1, c2, c3, c4);
19 for (int c4 = 1; c4 <= 100; c4 += 1
    [all...]
lu-3.c 5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1)
6 s1(c3, c4, c2);
7 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1)
8 s0(c2, c4);
12 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1
    [all...]
lift1-3.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
11 for (int c4 = 1; c4 <= 100; c4 += 1) {
12 s1(c0, c1, c2, c3, c4);
13 s0(c0, c1, c2, c3, c4);
lift1-4.c 6 for (int c4 = 1; c4 <= 100; c4 += 1)
7 s1(c0, c1, c2, c3, c4);
12 for (int c4 = 1; c4 <= 100; c4 += 1) {
13 s1(c0, c1, c2, c3, c4);
14 s0(c0, c1, c2, c3, c4);
lift1-5.c 5 for (int c4 = 1; c4 <= 100; c4 += 1) {
6 s1(c0, c1, c2, c3, c4);
7 s0(c0, c1, c2, c3, c4);
13 for (int c4 = 1; c4 <= 100; c4 += 1)
14 s1(c0, c1, c2, c3, c4);
ts1d-mp-i_ts-m_b-0.c 13 for (int c4 = max(500 * c1 + 1, 1000 * c1 + 4000 * c3 - 3999); c4 <= min(min(N + T - 3, 1000 * c1 + 4000 * c3 - 3000), 2 * N - 4000 * c3 + 3995); c4 += 1)
14 for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(T - 500 * c1 - 1, -500 * c1 + c4 - 1), -500 * c1 - 2000 * c3 + (c4 + 1) / 2 + 1999); c5 += 1)
15 s1(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1);
17 for (int c4 = max(1000 * c1 + 4000 * c3 - 3999, -4000 * c3 + 4000); c4 <= min(min(2 * T + 4000 * c3 - 4000, 1000 * c1 + 4000 * c3 - 3000), 2 * N - 4000 * c3 + 3995); c4 += 1
    [all...]
lu-0.c 5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1)
6 s1(c3, c4, c2);
8 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1)
9 s0(c2, c4);
lu-1.c 5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1)
6 s1(c3, c4, c2);
8 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1)
9 s0(c2, c4);
lu-2.c 5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1)
6 s1(c3, c4, c2);
8 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1)
9 s0(c2, c4);
lift2-0.c 5 for (int c4 = 1; c4 <= 100; c4 += 1) {
6 s1(c0, c1, c2, c3, c4);
8 s0(c0, c1, c2, c3, c4);
lefur03-0.c 5 for (int c4 = max(max(max(max(-200 * c1 + 400 * c3 - 199, 250 * c3 + 1), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 332), 333 * c1 + c1 / 3), 333 * c2 + (c2 + 1) / 3); c4 <= min(min(min(min(1000, 500 * c0 + 499), -200 * c1 + 400 * c3 + 400), 333 * c2 - (-c2 + 3) / 3 + 333), 333 * c3 - (-c3 + 3) / 3 + 334); c4 += 1)
6 for (int c5 = max(max(max(c4, 1000 * c0 - c4), 1000 * c3 - 2 * c4 + 2), 500 * c1 + (c4 + 1) / 2); c5 <= min(min(min(2 * c4 + 1, 1000 * c0 - c4 + 999), 1000 * c3 - 2 * c4 + 1001), 500 * c1 + (c4 + 1) / 2 + 499); c5 += 1
    [all...]
m11-0.c 5 for (int c4 = 5 * c1 + 10 * c2 - 4; c4 <= min(5 * c1 + 10 * c2, m - c3 + 1); c4 += 1)
6 s0(c0, c1, c2, c3, c4, -9 * c0 + c3 + c0 / 2 + 9, -5 * c1 - 5 * c2 + c4 + 5);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.python/
py-mi-var-info-path-expression.c 44 struct cons c1, c2, c3, c4; local
47 c1.slots[0] = &c4;
58 c4.type = type_atom;
59 c4.atom.ival = 13;
  /src/external/mit/isl/dist/test_inputs/codegen/cloog/
cholesky2.c 10 for (int c4 = (c0 + 5) / 3; c4 < c1; c4 += 1)
11 S5(c4, c1, (c0 + 2) / 3);

Completed in 56 milliseconds

1 2 3 4 5 6 7 8