| /external/llvm/test/Transforms/ArgumentPromotion/ |
| D | pr3085.ll | 23 br i1 false, label %bb.i.i, label %bb1.i.i
25 bb.i.i: ; preds = %bb6
28 bb1.i.i: ; preds = %bb6
31 int2lit.exit: ; preds = %bb1.i.i, %bb.i.i
37 br i1 false, label %bb.i, label %picosat_time_stamp.exit
39 bb.i: ; preds = %entry
42 picosat_time_stamp.exit: ; preds = %bb.i, %entry
331 br i1 false, label %bb.i.i35, label %bb1.i.i36
333 bb.i.i35: ; preds = %bb114
336 bb1.i.i36: ; preds = %bb114
[all …]
|
| /external/swiftshader/third_party/LLVM/test/Transforms/ArgumentPromotion/ |
| D | pr3085.ll | 23 br i1 false, label %bb.i.i, label %bb1.i.i
25 bb.i.i: ; preds = %bb6
28 bb1.i.i: ; preds = %bb6
31 int2lit.exit: ; preds = %bb1.i.i, %bb.i.i
37 br i1 false, label %bb.i, label %picosat_time_stamp.exit
39 bb.i: ; preds = %entry
42 picosat_time_stamp.exit: ; preds = %bb.i, %entry
331 br i1 false, label %bb.i.i35, label %bb1.i.i36
333 bb.i.i35: ; preds = %bb114
336 bb1.i.i36: ; preds = %bb114
[all …]
|
| /external/curl/tests/libtest/ |
| D | lib557.c | 118 int i, j; in test_unsigned_short_formatting() local
124 i=1; us_test[i].num = 0xFFU; us_test[i].expected = "256"; in test_unsigned_short_formatting()
125 i++; us_test[i].num = 0xF0U; us_test[i].expected = "240"; in test_unsigned_short_formatting()
126 i++; us_test[i].num = 0x0FU; us_test[i].expected = "15"; in test_unsigned_short_formatting()
128 i++; us_test[i].num = 0xE0U; us_test[i].expected = "224"; in test_unsigned_short_formatting()
129 i++; us_test[i].num = 0x0EU; us_test[i].expected = "14"; in test_unsigned_short_formatting()
131 i++; us_test[i].num = 0xC0U; us_test[i].expected = "192"; in test_unsigned_short_formatting()
132 i++; us_test[i].num = 0x0CU; us_test[i].expected = "12"; in test_unsigned_short_formatting()
134 i++; us_test[i].num = 0x01U; us_test[i].expected = "1"; in test_unsigned_short_formatting()
135 i++; us_test[i].num = 0x00U; us_test[i].expected = "0"; in test_unsigned_short_formatting()
[all …]
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/ |
| D | 2008-04-11-PHIofImpDef.ll | 8 br label %bb4351.i
9 bb4351.i: ; preds = %1
10 switch i32 0, label %bb4411.i [
11 i32 1, label %bb4354.i
12 i32 2, label %bb4369.i
14 bb4354.i: ; preds = %bb4351.i
16 bb4369.i: ; preds = %bb4351.i
17 br label %bb4374.i
18 bb4374.i: ; preds = %bb4369.i
19 br label %bb4411.i
[all …]
|
| /external/llvm/test/CodeGen/ARM/ |
| D | 2008-04-11-PHIofImpDef.ll | 8 br label %bb4351.i
9 bb4351.i: ; preds = %1
10 switch i32 0, label %bb4411.i [
11 i32 1, label %bb4354.i
12 i32 2, label %bb4369.i
14 bb4354.i: ; preds = %bb4351.i
16 bb4369.i: ; preds = %bb4351.i
17 br label %bb4374.i
18 bb4374.i: ; preds = %bb4369.i
19 br label %bb4411.i
[all …]
|
| /external/clang/test/OpenMP/ |
| D | simd_misc_messages.c | 13 int i; in test_no_clause() local
15 for (i = 0; i < 16; ++i) in test_no_clause()
20 ++i; in test_no_clause()
24 int i = 0; in test_branch_protected_scope() local
26 ++i; in test_branch_protected_scope()
31 for (i = 0; i < 16; ++i) { in test_branch_protected_scope()
32 if (i == 5) in test_branch_protected_scope()
34 else if (i == 6) in test_branch_protected_scope()
36 else if (i == 7) in test_branch_protected_scope()
38 else if (i == 8) { in test_branch_protected_scope()
[all …]
|
| D | for_simd_misc_messages.c | 10 int i; in test_no_clause() local
12 for (i = 0; i < 16; ++i) in test_no_clause()
17 ++i; in test_no_clause()
21 int i = 0; in test_branch_protected_scope() local
23 ++i; in test_branch_protected_scope()
29 for (i = 0; i < 16; ++i) { in test_branch_protected_scope()
30 if (i == 5) in test_branch_protected_scope()
32 else if (i == 6) in test_branch_protected_scope()
34 else if (i == 7) in test_branch_protected_scope()
36 else if (i == 8) { in test_branch_protected_scope()
[all …]
|
| D | for_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
29 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
31 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
[all …]
|
| D | parallel_for_simd_misc_messages.c | 10 int i; in test_no_clause() local
12 for (i = 0; i < 16; ++i) in test_no_clause()
17 ++i; in test_no_clause()
21 int i = 0; in test_branch_protected_scope() local
23 ++i; in test_branch_protected_scope()
29 for (i = 0; i < 16; ++i) { in test_branch_protected_scope()
30 if (i == 5) in test_branch_protected_scope()
32 else if (i == 6) in test_branch_protected_scope()
34 else if (i == 7) in test_branch_protected_scope()
36 else if (i == 8) { in test_branch_protected_scope()
[all …]
|
| D | nesting_of_regions.cpp | 11 for (int i = 0; i < 10; ++i) in foo() local
15 for (int i = 0; i < 10; ++i) in foo() local
19 for (int i = 0; i < 10; ++i) in foo() local
47 for (int i = 0; i < 10; ++i) in foo() local
51 for (int i = 0; i < 10; ++i) in foo() local
106 for (int i = 0; i < 10; ++i) in foo() local
127 for (int i = 0; i < 10; ++i) in foo() local
133 for (int i = 0; i < 10; ++i) in foo() local
143 for (int i = 0; i < 10; ++i) in foo() local
149 for (int i = 0; i < 10; ++i) in foo() local
[all …]
|
| D | parallel_for_misc_messages.c | 10 int i; in test_no_clause() local
12 for (i = 0; i < 16; ++i) in test_no_clause()
17 ++i; in test_no_clause()
21 int i = 0; in test_branch_protected_scope() local
23 ++i; in test_branch_protected_scope()
28 for (i = 0; i < 16; ++i) { in test_branch_protected_scope()
29 if (i == 5) in test_branch_protected_scope()
31 else if (i == 6) in test_branch_protected_scope()
33 else if (i == 7) in test_branch_protected_scope()
35 else if (i == 8) { in test_branch_protected_scope()
[all …]
|
| D | for_simd_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
[all …]
|
| D | parallel_for_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
[all …]
|
| D | schedule_codegen.cpp | 8 for(int i = 0; i < 10; ++i); in main() local
13 for(int i = 0; i < 10; ++i); in main() local
18 for(int i = 0; i < 10; ++i); in main() local
23 for(int i = 0; i < 10; ++i); in main() local
28 for(int i = 0; i < 10; ++i); in main() local
33 for(int i = 0; i < 10; ++i); in main() local
37 for(int i = 0; i < 10; ++i); in main() local
41 for(int i = 0; i < 10; ++i); in main() local
45 for(int i = 0; i < 10; ++i); in main() local
49 for(int i = 0; i < 10; ++i); in main() local
[all …]
|
| D | target_parallel_for_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
[all …]
|
| D | parallel_for_simd_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
[all …]
|
| /external/llvm/test/Transforms/InstCombine/ |
| D | div-shift-crash.ll | 10 …%l_819.i.i = alloca %struct.S0.0.1.2.3.4.13.22.31.44.48.53.54.55.56.58.59.60.66.68.70.74.77.106.10…
11 br i1 undef, label %land.lhs.true, label %for.cond.i
14 br label %for.cond.i
16 for.cond.i: ; preds = %land.lhs.true, %entry
17 ….54.55.56.58.59.60.66.68.70.74.77.106.107.108.109.110.113.117.118.128.129* %l_819.i.i, i64 0, i32 0
18 br label %for.cond.i6.i.i
20 for.cond.i6.i.i: ; preds = %for.body.i8.i.i, %for.cond.i
21 br i1 undef, label %for.body.i8.i.i, label %lbl_707.i.i.i
23 for.body.i8.i.i: ; preds = %for.cond.i6.i.i
24 br label %for.cond.i6.i.i
[all …]
|
| /external/swiftshader/src/Shader/ |
| D | Constants.cpp | 163 for(int i = 0; i < 16; i++) in Constants() local
165 maskB4Q[i][0] = -(i >> 0 & 1); in Constants()
166 maskB4Q[i][1] = -(i >> 1 & 1); in Constants()
167 maskB4Q[i][2] = -(i >> 2 & 1); in Constants()
168 maskB4Q[i][3] = -(i >> 3 & 1); in Constants()
169 maskB4Q[i][4] = -(i >> 0 & 1); in Constants()
170 maskB4Q[i][5] = -(i >> 1 & 1); in Constants()
171 maskB4Q[i][6] = -(i >> 2 & 1); in Constants()
172 maskB4Q[i][7] = -(i >> 3 & 1); in Constants()
174 invMaskB4Q[i][0] = ~-(i >> 0 & 1); in Constants()
[all …]
|
| /external/openssh/ |
| D | sc25519.c | 35 int i; in reduce_add_sub() local
38 for(i=0;i<32;i++) in reduce_add_sub()
40 pb += m[i]; in reduce_add_sub()
41 b = lt(r->v[i],pb); in reduce_add_sub()
42 t[i] = r->v[i]-pb+(b<<8); in reduce_add_sub()
46 for(i=0;i<32;i++) in reduce_add_sub()
47 r->v[i] ^= mask & (r->v[i] ^ t[i]); in reduce_add_sub()
54 int i,j; in barrett_reduce() local
63 for (i = 0;i < 66;++i) q2[i] = 0; in barrett_reduce()
64 for (i = 0;i < 33;++i) r2[i] = 0; in barrett_reduce()
[all …]
|
| /external/valgrind/none/tests/mips64/ |
| D | load_store.c | 6 int i; in main() local
14 for (i = 0; i < N*s1; i++) in main()
15 TEST1("lb", i, reg_val1); in main()
17 for (i = 0; i < N*s2; i++) in main()
18 TEST1("lb", i, reg_val2); in main()
21 for (i = 0; i < N*s1; i++) in main()
22 TEST1("lbu", i, reg_val1); in main()
24 for (i = 0; i < N*s2; i++) in main()
25 TEST1("lbu", i, reg_val2); in main()
28 for (i = 0; i < N*s1; i = i+8) in main()
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | format_unpack.c | 67 GLuint i; in nonlinear_to_linear() local
68 for (i = 0; i < 256; i++) { in nonlinear_to_linear()
69 const GLfloat cs = UBYTE_TO_FLOAT(i); in nonlinear_to_linear()
71 table[i] = cs / 12.92f; in nonlinear_to_linear()
74 table[i] = (GLfloat) pow((cs + 0.055) / 1.055, 2.4); in nonlinear_to_linear()
94 GLuint i; in unpack_RGBA8888() local
95 for (i = 0; i < n; i++) { in unpack_RGBA8888()
96 dst[i][RCOMP] = UBYTE_TO_FLOAT( (s[i] >> 24) ); in unpack_RGBA8888()
97 dst[i][GCOMP] = UBYTE_TO_FLOAT( (s[i] >> 16) & 0xff ); in unpack_RGBA8888()
98 dst[i][BCOMP] = UBYTE_TO_FLOAT( (s[i] >> 8) & 0xff ); in unpack_RGBA8888()
[all …]
|
| D | pack.c | 76 GLuint i, a, b; in flip_bytes() local
77 for (i = 0; i < n; i++) { in flip_bytes()
78 b = (GLuint) p[i]; /* words are often faster than bytes */ in flip_bytes()
87 p[i] = (GLubyte) a; in flip_bytes()
107 GLint i; in _mesa_unpack_polygon_stipple() local
108 for (i = 0; i < 32; i++) { in _mesa_unpack_polygon_stipple()
109 dest[i] = (p[0] << 24) in _mesa_unpack_polygon_stipple()
132 GLint i; in _mesa_pack_polygon_stipple() local
133 for (i = 0; i < 32; i++) { in _mesa_pack_polygon_stipple()
134 ptrn[i * 4 + 0] = (GLubyte) ((pattern[i] >> 24) & 0xff); in _mesa_pack_polygon_stipple()
[all …]
|
| /external/clang/test/Profile/ |
| D | c-general.c | 28 int i; in simple_loops() local
31 for (i = 0; i < 100; ++i) { in simple_loops()
35 while (i > 0) in simple_loops()
36 i--; in simple_loops()
39 do {} while (i++ < 75); in simple_loops()
51 for (int i = 0; i < 100; ++i) { in conditionals() local
54 if (i % 2) { in conditionals()
57 if (i) {} in conditionals()
60 } else if (i % 3) { in conditionals()
63 if (i) {} in conditionals()
[all …]
|
| /external/clang/test/SemaCXX/ |
| D | warn-loop-analysis.cpp | 16 for (int i; i < 1; ++i) {} in test1() local
17 …for (int i; i < 1; ) {} // expected-warning {{variable 'i' used in loop condition not modified in… in test1() local
18 for (int i; i < 1; ) { ++i; } in test1() local
19 for (int i; i < 1; ) { return; } in test1() local
20 for (int i; i < 1; ) { break; } in test1() local
21 for (int i; i < 1; ) { goto exit_loop; } in test1() local
23 for (int i; i < 1; ) { by_ref(i); } in test1() local
24 …for (int i; i < 1; ) { by_value(i); } // expected-warning {{variable 'i' used in loop condition n… in test1() local
25 for (int i; i < 1; ) { by_pointer(&i); } in test1() local
27 for (int i; i < 1; ++i) in test1() local
[all …]
|
| /external/libcxx/src/ |
| D | hash.cpp | 217 size_t i = 211; in __next_prime() local
220 std::size_t q = n / i; in __next_prime()
221 if (q < i) in __next_prime()
223 if (n == q * i) in __next_prime()
226 i += 10; in __next_prime()
227 q = n / i; in __next_prime()
228 if (q < i) in __next_prime()
230 if (n == q * i) in __next_prime()
233 i += 2; in __next_prime()
234 q = n / i; in __next_prime()
[all …]
|