| /external/llvm-project/polly/lib/External/isl/test_inputs/codegen/cloog/ |
| D | faber.c | 2 for (int c1 = -6; c1 < c0 / 14 - 5; c1 += 1) { variable
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 <= c1 + 48; c2 += 1)
8 S1(c0, c1, c2);
10 for (int c1 = c0 / 14 - 5; c1 < 0; c1 += 1) { variable
11 if (c1 >= -3 && 2 * c0 >= 7 * c1 + 42)
12 S7(c0, c1, 6);
[all …]
|
| D | swim.c | 30 for (int c1 = 1; c1 <= N; c1 += 1) { variable
31 S28(c0, c1);
32 S29(c0, c1);
33 S30(c0, c1);
47 for (int c1 = 1; c1 <= Q; c1 += 1) variable
49 S40(c0, c1, c2);
50 S41(c0, c1, c2);
51 S42(c0, c1, c2);
52 S43(c0, c1, c2);
54 for (int c1 = 1; c1 <= Q; c1 += 1) { variable
[all …]
|
| D | reservoir-QR.c | 4 for (int c1 = 0; c1 < M; c1 += 1) variable
5 S2(0, c1);
7 for (int c1 = 0; c1 < M; c1 += 1) variable
8 S4(0, c1);
12 for (int c1 = 0; c1 < M; c1 += 1) variable
13 S2(0, c1);
15 for (int c1 = 0; c1 < M; c1 += 1) variable
16 S4(0, c1);
22 for (int c1 = c0 - 1; c1 < N; c1 += 1) { variable
23 S6(c0 - 2, c1);
[all …]
|
| /external/llvm-project/polly/test/ScheduleOptimizer/ |
| D | pattern-matching-based-opts_12.ll | 15 ; CHECK-NEXT: for (int c1 = 0; c1 <= 1; c1 += 1) {
17 ; CHECK-NEXT: for (int c4 = 512 * c1; c4 <= min(1019, 512 * c1 + 511); c4 += 1)
21 ; CHECK-NEXT: for (int c5 = 512 * c1; c5 <= min(1019, 512 * c1 + 511); c5 += 1)
28 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(511, -512 * c1 + 1019); c5 += 1) {
32 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3, 512 * c1 + c5);
33 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 1, 512 * c1 + c5);
34 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 2, 512 * c1 + c5);
35 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 3, 512 * c1 + c5);
36 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 4, 512 * c1 + c5);
37 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 5, 512 * c1 + c5);
[all …]
|
| D | ensure-correct-tile-sizes.ll | 28 ; CHECK-NEXT: for (int c1 = 0; c1 <= 93; c1 += 1) {
31 ; CHECK-NEXT: for (int c3 = 0; c3 <= min(31, -32 * c1 + 2999); c3 += 1)
32 ; CHECK-NEXT: Stmt_for_body3(32 * c0 + c2, 32 * c1 + c3);
37 ; CHECK-NEXT: for (int c1 = 0; c1 <= 2999; c1 += 1)
41 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0, c2);
42 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 1, c2);
43 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 2, c2);
44 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 3, c2);
45 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 4, c2);
46 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 5, c2);
[all …]
|
| D | pattern-matching-based-opts_9.ll | 33 ; CHECK-NEXT: for (int c1 = 0; c1 <= 1; c1 += 1) {
35 ; CHECK-NEXT: for (int c4 = 512 * c1; c4 <= 512 * c1 + 511; c4 += 1)
39 ; CHECK-NEXT: for (int c5 = 512 * c1; c5 <= 512 * c1 + 511; c5 += 1)
49 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3, 512 * c1 + c5);
50 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 1, 512 * c1 + c5);
51 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 2, 512 * c1 + c5);
52 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 3, 512 * c1 + c5);
53 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 4, 512 * c1 + c5);
54 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 5, 512 * c1 + c5);
55 ; CHECK-NEXT: Stmt_for_body6(384 * c2 + 8 * c4, 32 * c3 + 6, 512 * c1 + c5);
[all …]
|
| /external/boringssl/src/crypto/fipsmodule/bn/asm/ |
| D | x86_64-gcc.c | 99 BN_ULONG c1 = 0; in bn_mul_add_words() local
102 return (c1); in bn_mul_add_words()
106 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
107 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
108 mul_add(rp[2], ap[2], w, c1); in bn_mul_add_words()
109 mul_add(rp[3], ap[3], w, c1); in bn_mul_add_words()
115 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
117 return c1; in bn_mul_add_words()
119 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
121 return c1; in bn_mul_add_words()
[all …]
|
| /external/rust/crates/quiche/deps/boringssl/src/crypto/fipsmodule/bn/asm/ |
| D | x86_64-gcc.c | 99 BN_ULONG c1 = 0; in bn_mul_add_words() local
102 return (c1); in bn_mul_add_words()
106 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
107 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
108 mul_add(rp[2], ap[2], w, c1); in bn_mul_add_words()
109 mul_add(rp[3], ap[3], w, c1); in bn_mul_add_words()
115 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
117 return c1; in bn_mul_add_words()
119 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
121 return c1; in bn_mul_add_words()
[all …]
|
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| D | generic.c | 130 BN_ULONG c1 = 0; in bn_mul_add_words() local
133 return c1; in bn_mul_add_words()
137 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
138 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
139 mul_add(rp[2], ap[2], w, c1); in bn_mul_add_words()
140 mul_add(rp[3], ap[3], w, c1); in bn_mul_add_words()
147 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
153 return c1; in bn_mul_add_words()
158 BN_ULONG c1 = 0; in bn_mul_words() local
161 return c1; in bn_mul_words()
[all …]
|
| /external/rust/crates/quiche/deps/boringssl/src/crypto/fipsmodule/bn/ |
| D | generic.c | 130 BN_ULONG c1 = 0; in bn_mul_add_words() local
133 return c1; in bn_mul_add_words()
137 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
138 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
139 mul_add(rp[2], ap[2], w, c1); in bn_mul_add_words()
140 mul_add(rp[3], ap[3], w, c1); in bn_mul_add_words()
147 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
153 return c1; in bn_mul_add_words()
158 BN_ULONG c1 = 0; in bn_mul_words() local
161 return c1; in bn_mul_words()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.multiset/ |
| D | swap_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
37 c1.swap(c2); in main()
39 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
40 assert(c1.size() == 0); in main()
41 assert(c1.hash_function() == Hash(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
43 assert(c1.get_allocator().get_id() == 1); in main()
44 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
46 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.set/ |
| D | swap_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
37 c1.swap(c2); in main()
39 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
40 assert(c1.size() == 0); in main()
41 assert(c1.hash_function() == Hash(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
43 assert(c1.get_allocator().get_id() == 1); in main()
44 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
46 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| D | swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
38 c1.swap(c2); in main()
40 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
41 assert(c1.size() == 0); in main()
42 assert(c1.hash_function() == Hash(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
44 assert(c1.get_allocator().get_id() == 1); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
47 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| D | swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
38 swap(c1, c2); in main()
40 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
41 assert(c1.size() == 0); in main()
42 assert(c1.hash_function() == Hash(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
44 assert(c1.get_allocator().get_id() == 1); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
47 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| D | swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
38 c1.swap(c2); in main()
40 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
41 assert(c1.size() == 0); in main()
42 assert(c1.hash_function() == Hash(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
44 assert(c1.get_allocator().get_id() == 1); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
47 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| D | swap_non_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
37 swap(c1, c2); in main()
39 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
40 assert(c1.size() == 0); in main()
41 assert(c1.hash_function() == Hash(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
43 assert(c1.get_allocator().get_id() == 1); in main()
44 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
46 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
| D | swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
38 swap(c1, c2); in main()
40 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
41 assert(c1.size() == 0); in main()
42 assert(c1.hash_function() == Hash(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
44 assert(c1.get_allocator().get_id() == 1); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
47 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
| D | swap_non_member.pass.cpp | 34 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
37 swap(c1, c2); in main()
39 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
40 assert(c1.size() == 0); in main()
41 assert(c1.hash_function() == Hash(2)); in main()
42 assert(c1.key_eq() == Compare(2)); in main()
43 assert(c1.get_allocator().get_id() == 1); in main()
44 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
46 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| D | swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
38 swap(c1, c2); in main()
40 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
41 assert(c1.size() == 0); in main()
42 assert(c1.hash_function() == Hash(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
44 assert(c1.get_allocator().get_id() == 1); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
47 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| D | swap_non_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
39 swap(c1, c2); in main()
41 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
42 assert(c1.size() == 0); in main()
43 assert(c1.hash_function() == Hash(2)); in main()
44 assert(c1.key_eq() == Compare(2)); in main()
45 assert(c1.get_allocator().get_id() == 1); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
47 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
48 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| D | swap_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
39 c1.swap(c2); in main()
41 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
42 assert(c1.size() == 0); in main()
43 assert(c1.hash_function() == Hash(2)); in main()
44 assert(c1.key_eq() == Compare(2)); in main()
45 assert(c1.get_allocator().get_id() == 1); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
47 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
48 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.map/ |
| D | swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
38 c1.swap(c2); in main()
40 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
41 assert(c1.size() == 0); in main()
42 assert(c1.hash_function() == Hash(2)); in main()
43 assert(c1.key_eq() == Compare(2)); in main()
44 assert(c1.get_allocator().get_id() == 1); in main()
45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
47 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| D | swap_non_member.pass.cpp | 37 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
40 swap(c1, c2); in main()
42 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
43 assert(c1.size() == 0); in main()
44 assert(c1.hash_function() == Hash(2)); in main()
45 assert(c1.key_eq() == Compare(2)); in main()
46 assert(c1.get_allocator().get_id() == 1); in main()
47 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
48 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
49 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| D | swap_non_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
39 swap(c1, c2); in main()
41 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
42 assert(c1.size() == 0); in main()
43 assert(c1.hash_function() == Hash(2)); in main()
44 assert(c1.key_eq() == Compare(2)); in main()
45 assert(c1.get_allocator().get_id() == 1); in main()
46 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
47 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
48 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/llvm-project/polly/lib/External/isl/test_inputs/codegen/ |
| D | roman.c | 1 for (int c1 = 0; c1 <= min(np1 - i, -i + 1); c1 += 1) { variable
2 S_9(c1);
3 S_12(c1);
5 for (int c1 = max(0, -i + 2); c1 <= -((-np1 + i + 4294967295) % 4294967296) + 4294967295; c1 += 1) { variable
6 S_9(c1);
7 S_10(c1);
8 for (int c3 = 0; c3 <= min(19, i + c1 - 3); c3 += 1) {
9 S_15(c1, c3);
11 S_16(c1, c3, c5);
12 S_17(c1, c3, c5);
[all …]
|