| /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/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/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/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 …]
|
| D | eq.pass.cpp | 46 const C c1(std::begin(a), std::end(a)); in main() local
48 assert(!(c1 == c2)); in main()
49 assert( (c1 != c2)); in main()
68 const C c1(std::begin(a), std::end(a)); in main() local
69 const C c2 = c1; in main()
70 assert( (c1 == c2)); in main()
71 assert(!(c1 != c2)); in main()
90 C c1(std::begin(a), std::end(a)); in main() local
91 C c2 = c1; in main()
93 assert( (c1 == c2)); 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 …]
|
| D | eq.pass.cpp | 43 const C c1(std::begin(a), std::end(a)); in main() local
45 assert(!(c1 == c2)); in main()
46 assert( (c1 != c2)); in main()
62 const C c1(std::begin(a), std::end(a)); in main() local
63 const C c2 = c1; in main()
64 assert( (c1 == c2)); in main()
65 assert(!(c1 != c2)); in main()
81 C c1(std::begin(a), std::end(a)); in main() local
82 C c2 = c1; in main()
84 assert( (c1 == c2)); 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 …]
|
| D | eq.pass.cpp | 44 const C c1(std::begin(a), std::end(a)); in main() local
46 assert(!(c1 == c2)); in main()
47 assert( (c1 != c2)); in main()
63 const C c1(std::begin(a), std::end(a)); in main() local
64 const C c2 = c1; in main()
65 assert( (c1 == c2)); in main()
66 assert(!(c1 != c2)); in main()
82 C c1(std::begin(a), std::end(a)); in main() local
83 C c2 = c1; in main()
85 assert( (c1 == c2)); 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.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/libcxx/test/std/containers/unord/unord.multimap/ |
| D | swap_member.pass.cpp | 38 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); in main() local
41 c1.swap(c2); in main()
43 LIBCPP_ASSERT(c1.bucket_count() == 0); in main()
44 assert(c1.size() == 0); in main()
45 assert(c1.hash_function() == Hash(2)); in main()
46 assert(c1.key_eq() == Compare(2)); in main()
47 assert(c1.get_allocator().get_id() == 1); in main()
48 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size()); in main()
49 assert(static_cast<std::size_t>(std::distance(c1.cbegin(), c1.cend())) == c1.size()); in main()
50 assert(c1.max_load_factor() == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.special/ |
| D | swap.pass.cpp | 27 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); in main() local
29 assert(is_contiguous_container_asan_correct(c1)); in main()
31 swap(c1, c2); in main()
32 assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); in main()
34 assert(is_contiguous_container_asan_correct(c1)); in main()
40 std::vector<int> c1(a1, a1); in main() local
42 assert(is_contiguous_container_asan_correct(c1)); in main()
44 swap(c1, c2); in main()
45 assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); in main()
48 assert(is_contiguous_container_asan_correct(c1)); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.spec/ |
| D | member_swap.pass.cpp | 27 C c1(std::begin(t1), std::end(t1), A(1, 1)); in main() local
30 c1.swap(c2); in main()
32 assert(distance(c1.begin(), c1.end()) == 3); in main()
33 assert(*next(c1.begin(), 0) == 10); in main()
34 assert(*next(c1.begin(), 1) == 11); in main()
35 assert(*next(c1.begin(), 2) == 12); in main()
36 assert(c1.get_allocator().get_id() == 1); in main()
52 C c1(std::begin(t1), std::end(t1), A(1, 1)); in main() local
54 c1.swap(c2); in main()
56 assert(distance(c1.begin(), c1.end()) == 0); in main()
[all …]
|
| D | non_member_swap.pass.cpp | 28 C c1(std::begin(t1), std::end(t1), A(1, 1)); in main() local
31 swap(c1, c2); in main()
33 assert(distance(c1.begin(), c1.end()) == 3); in main()
34 assert(*next(c1.begin(), 0) == 10); in main()
35 assert(*next(c1.begin(), 1) == 11); in main()
36 assert(*next(c1.begin(), 2) == 12); in main()
37 assert(c1.get_allocator().get_id() == 1); in main()
53 C c1(std::begin(t1), std::end(t1), A(1, 1)); in main() local
55 swap(c1, c2); in main()
57 assert(distance(c1.begin(), c1.end()) == 0); in main()
[all …]
|
| /external/eigen/test/ |
| D | block.cpp | 15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { in block_real_only() argument
18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1)); in block_real_only()
20 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1… in block_real_only()
21 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1… in block_real_only()
57 Index c1 = internal::random<Index>(0,cols-1); in block() local
58 Index c2 = internal::random<Index>(c1,cols-1); in block()
60 block_real_only(m1, r1, r2, c1, c1, s1); in block()
63 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1)); in block()
72 m1.col(c1) += s1 * m1_copy.col(c2); in block()
73 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2)); in block()
[all …]
|
| /external/python/pyasn1/tests/type/ |
| D | test_constraint.py | 24 self.c1 = constraint.SingleValueConstraint(1, 2)
28 assert self.c1 == self.c1, 'comparation fails'
31 assert hash(self.c1) != hash(self.c2), 'hash() fails'
35 self.c1(1)
42 self.c1(4)
52 self.c1 = constraint.ContainedSubtypeConstraint(
58 self.c1(12)
64 self.c1(4)
74 self.c1 = constraint.ValueRangeConstraint(1, 4)
78 self.c1(1)
[all …]
|
| /external/libcxx/test/std/containers/sequences/list/list.special/ |
| D | swap.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); in main() local
27 swap(c1, c2); in main()
28 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); in main()
34 std::list<int> c1(a1, a1); in main() local
36 swap(c1, c2); in main()
37 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); in main()
44 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); in main() local
46 swap(c1, c2); in main()
47 assert(c1.empty()); in main()
48 assert(distance(c1.begin(), c1.end()) == 0); in main()
[all …]
|
| /external/deqp-deps/glslang/Test/ |
| D | hlsl.rw.scalar.bracket.frag | 28 uniform int c1;
50 float SomeValue() { return c1; }
57 g_tTex1df1[c1];
59 float r00 = g_tTex1df1[c1];
60 int r01 = g_tTex1di1[c1];
61 uint r02 = g_tTex1du1[c1];
77 g_tTex1df1[c1] = SomeValue(); // complex R-value
78 g_tTex1df1[c1] = lf1;
79 g_tTex1di1[c1] = int(2);
80 g_tTex1du1[c1] = uint(3);
[all …]
|
| D | hlsl.rw.vec2.bracket.frag | 28 uniform int c1;
57 g_tTex1df2[c1];
59 float2 r00 = g_tTex1df2[c1];
60 int2 r01 = g_tTex1di2[c1];
61 uint2 r02 = g_tTex1du2[c1];
77 g_tTex1df2[c1] = SomeValue(); // complex R-value
78 g_tTex1df2[c1] = lf2;
79 g_tTex1di2[c1] = int2(2,2);
80 g_tTex1du2[c1] = uint2(3,2);
83 float2 val1 = (g_tTex1df2[c1] *= 2.0);
[all …]
|
| D | hlsl.rw.bracket.frag | 28 uniform int c1;
57 g_tTex1df4[c1];
59 float4 r00 = g_tTex1df4[c1];
60 int4 r01 = g_tTex1di4[c1];
61 uint4 r02 = g_tTex1du4[c1];
77 g_tTex1df4[c1] = SomeValue(); // complex R-value
78 g_tTex1df4[c1] = lf4;
79 g_tTex1di4[c1] = int4(2,2,3,4);
80 g_tTex1du4[c1] = uint4(3,2,3,4);
83 float4 val1 = (g_tTex1df4[c1] *= 2.0);
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| D | insert_iter_iter.pass.cpp | 56 C c1 = c0; in test() local
57 std::size_t c1_osize = c1.size(); in test()
58 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end())); in test()
59 assert(i == c1.begin() + P); in test()
60 assert(c1.size() == c1_osize + c2.size()); in test()
61 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); in test()
62 i = c1.begin(); in test()
73 C c1 = c0; in test() local
74 std::size_t c1_osize = c1.size(); in test()
75 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end())); in test()
[all …]
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
| D | assign_copy.pass.cpp | 30 C c1(std::begin(t1), std::end(t1), A(10)); in main() local
31 c1 = c0; in main()
32 assert(c1 == c0); in main()
33 assert(c1.get_allocator() == A(10)); in main()
42 C c1(std::begin(t1), std::end(t1), A(11)); in main() local
43 c1 = c0; in main()
44 assert(c1 == c0); in main()
45 assert(c1.get_allocator() == A(11)); in main()
54 C c1(std::begin(t1), std::end(t1), A(10)); in main() local
55 c1 = c0; in main()
[all …]
|
| /external/python/cpython3/Modules/_decimal/libmpdec/ |
| D | convolute.c | 47 fnt_convolute(mpd_uint_t *c1, mpd_uint_t *c2, mpd_size_t n, int modnum) in fnt_convolute() argument
77 if (!fnt(c1, n, modnum)) { in fnt_convolute()
84 mpd_uint_t x0 = c1[i]; in fnt_convolute()
86 mpd_uint_t x1 = c1[i+1]; in fnt_convolute()
89 c1[i] = x0; in fnt_convolute()
90 c1[i+1] = x1; in fnt_convolute()
93 if (!inv_fnt(c1, n, modnum)) { in fnt_convolute()
97 mpd_uint_t x0 = c1[i]; in fnt_convolute()
98 mpd_uint_t x1 = c1[i+1]; in fnt_convolute()
99 mpd_uint_t x2 = c1[i+2]; in fnt_convolute()
[all …]
|