/netbsd-current/external/mit/isl/dist/test_inputs/codegen/ |
H A D | stride7.c | 2 for (int c2 = c0 - 1; c2 <= 120; c2 += 1) 3 s2(c0, c2); 5 for (int c2 = 122; c2 <= c0 + 62; c2 += 1) 6 s4(c0, c2);
|
H A D | component4.c | 4 for (int c2 = 0; c2 <= 9; c2 += 1) 5 B(c0, c2);
|
H A D | filter.c | 3 for (int c2 = 0; c2 < n; c2 += 1) 4 A(c0, c2); 7 for (int c2 = 0; c2 < n; c2 += 1) 8 A(c0, c2);
|
H A D | stride.c | 4 for (int c2 = 0; c2 <= 100; c2 += 1) 5 B(c0, c2);
|
H A D | isolate7.c | 4 for (int c2 = 0; c2 <= 31; c2 += 1) 6 S_1(c0 + c2, c1 + c3); 8 for (int c2 = 0; c2 <= 31; c2 += 1) { 10 S_1(c0 + c2, c1 + c3); 11 S_2(c0 + c2); 17 for (int c2 [all...] |
H A D | redundant.c | 4 for (int c2 = 1; c2 <= 2; c2 += 1) 6 write(c0, c1, 8 * b0 + c2 - 5, c3); 7 for (int c2 = max(max(3, -8 * b0 + 6), 8 * c0 - 12); c2 <= min(min(7, -8 * b0 + 17), 8 * c0 + 6); c2 += 1) 8 if (4 * c0 + c1 + 1 >= 2 * ((2 * c1 + c2 - 1) / 4) && 2 * ((2 * c1 + c2 - 1) / 4) + 7 >= 4 * c0 + c1 && (2 * c1 + c2 [all...] |
H A D | isolate6.c | 3 for (int c2 = 10 * c0; c2 <= 10 * c0 + 9; c2 += 1) { 4 A(c2, 10 * c1); 5 A(c2, 10 * c1 + 1); 6 A(c2, 10 * c1 + 2); 7 A(c2, 10 * c1 + 3); 8 A(c2, 10 * c1 + 4); 9 A(c2, 10 * c1 + 5); 10 A(c2, 1 [all...] |
/netbsd-current/external/mit/isl/dist/test_inputs/codegen/cloog/ |
H A D | nul_lcpc.c | 2 for (int c2 = 1; c2 <= c0; c2 += 1) { 3 S1(c0, (c0 - 1) / 2, c2); 4 S2(c0, (c0 - 1) / 2, c2); 6 for (int c2 = c0 + 1; c2 <= p; c2 += 1) 7 S1(c0, (c0 - 1) / 2, c2); 10 for (int c2 [all...] |
H A D | yosr.c | 3 for (int c2 = c1 + 1; c2 <= n; c2 += 1) 4 S2(c1, c2, c0); 5 for (int c2 = c0 + 1; c2 <= n; c2 += 1) 6 S1(c0, c2); 9 for (int c2 = c1 + 1; c2 < [all...] |
H A D | forwardsub-2-1-2-3.c | 2 for (int c2 = 2; c2 <= M; c2 += 1) 3 S1(1, 1, c2); 6 for (int c2 = c0 + 1; c2 <= M; c2 += 1) 7 S2(c0, 1, c2);
|
H A D | reservoir-jacobi3.c | 2 for (int c2 = 2; c2 < N; c2 += 1) 4 S1(c0, c2, c3); 5 for (int c2 = 2; c2 < N; c2 += 1) 7 S2(c0, c2, c3);
|
H A D | reservoir-pingali6.c | 2 for (int c2 = 2; c2 < N; c2 += 1) 4 S1(c0, c2, c3); 5 for (int c2 = 2; c2 < N; c2 += 1) 7 S2(c0, c2, c3);
|
H A D | faber.c | 3 for (int c2 = -((-2 * c1 + 3) / 5) + 9; c2 <= c1 + 12; c2 += 1) 4 S6(c0, c1, c2); 5 for (int c2 = c1 + 24; c2 <= -2 * c1 + 24; c2 += 1) 6 S2(c0, c1, c2); 7 for (int c2 = -2 * c1 + 30; c2 < [all...] |
H A D | darte.c | 3 for (int c2 = -c0 + 4; c2 <= 2 * n - c0 + 2; c2 += 2) 4 S1(1, -c0 + 1, ((c0 + c2) / 2) - 1); 6 for (int c2 = c1 + 2; c2 <= 2 * n + c1; c2 += 2) 7 S1((c0 + c1) / 2, (-c0 + c1) / 2, (-c1 + c2) / 2); 8 for (int c2 = 1; c2 < [all...] |
H A D | reservoir-long.c | 3 for (int c2 = P; c2 < M; c2 += 1) 4 S1(c0, c1, c2); 5 for (int c2 = 1; c2 < M; c2 += 1) 6 S2(c0, c1, c2); 9 for (int c2 = P; c2 < [all...] |
H A D | reservoir-mg-rprj3.c | 3 for (int c2 = 2; c2 <= M; c2 += 1) 4 S1(c0, 2, c2); 6 for (int c2 = 2; c2 <= M; c2 += 1) 7 S2(c0, c1 - 1, c2); 10 for (int c2 = 2; c2 < [all...] |
H A D | vasilache.c | 10 for (int c2 = 0; c2 <= (N - 1) / 32; c2 += 1) { 11 S7(c0, c1, c2, 32 * c2); 12 for (int c3 = 32 * c2 + 1; c3 <= min(N - 1, 32 * c2 + 31); c3 += 1) { 13 S6(c0, c1, c2, c3 - 1); 14 S7(c0, c1, c2, c3); 16 if (32 * c2 [all...] |
/netbsd-current/distrib/utils/libhack/ |
H A D | strcasecmp.c | 16 unsigned char c1, c2; local 20 c2 = *s2++; 23 if (c2 >= 'A' && c2 <= 'Z') 24 c2 += 'a' - 'A'; 25 } while (c1 == c2 && c1 != 0 && c2 != 0); 27 return ((c1 == c2) ? 0 : ((c1 > c2) ? 1 : -1));
|
/netbsd-current/external/mit/isl/dist/test_inputs/codegen/omega/ |
H A D | m12-0.c | 2 for (int c2 = 1; c2 <= m; c2 += 1) 3 s0(1, c1, c2, 0);
|
H A D | olda-0.c | 3 for (int c2 = 1; c2 <= np; c2 += 1) { 4 if (c2 >= c1) 5 s0(c2, c1, c0); 6 if (c1 >= c2) 7 s1(c1, c2, c0);
|
H A D | hpf-0.c | 3 for (int c2 = (-P2 - c0 + 6) % 3; c2 <= 3; c2 += 3) 4 s0(c0, c0, c2, c2);
|
H A D | p.delft-0.c | 3 for (int c2 = (-P2 - c0 + 6) % 3; c2 <= 3; c2 += 3) 4 s0(c0, c0, c2, c2);
|
H A D | lift2-3.c | 4 for (int c2 = 1; c2 <= 100; c2 += 1) 7 s1(c0, c1, c2, c3, c4); 9 for (int c2 = 1; c2 <= 100; c2 += 1) 12 s1(c0, c1, c2, c3, c4); 14 for (int c2 = 1; c2 < [all...] |
H A D | ts1d-check0-0.c | 4 for (int c2 = 1000 * c1; c2 <= min(N + 2 * T - 3, N + 1000 * c1 + 997); c2 += 1) { 5 for (int c3 = max(0, -((N + c2) % 2) - N - 1000 * c1 + c2 + 2); c3 <= min(min(998, 2 * T - 1000 * c1 - 2), -1000 * c1 + c2 - 2); c3 += 2) { 6 s1(2, 1000 * c1 + c3, 0, -1000 * c1 + c2 - c3, 1); 7 s2(2, 1000 * c1 + c3 + 1, 0, -1000 * c1 + c2 - c3 - 1, 1); 9 if (2 * T >= c2 + 1 && 1000 * c1 + 999 >= c2) [all...] |
/netbsd-current/external/gpl2/gettext/dist/gettext-tools/src/ |
H A D | x-php.c | 205 int c2 = phase1_getc (); local 207 if (c2 == EOF) 210 if (c2 == '?') 222 if (c2 == '%') 234 if (c2 == '<') 236 phase1_ungetc (c2); 244 while (c2 == ' ' || c2 == '\t' || c2 == '\n' || c2 1068 int c2 = phase1_getc (); local 1095 int c2 = phase1_getc (); local [all...] |