| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_TransformDequantLumaDCFromPair.c | 73 int c1 = pData[i+1]; local
76 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
77 pData[i+1] = (OMX_S16)(c0+c1-c2-c3);
78 pData[i+2] = (OMX_S16)(c0-c1-c2+c3);
79 pData[i+3] = (OMX_S16)(c0-c1+c2-c3);
86 int c1 = pData[i+4]; local
89 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
90 pData[i+4] = (OMX_S16)(c0+c1-c2-c3);
91 pData[i+8] = (OMX_S16)(c0-c1-c2+c3);
92 pData[i+12] = (OMX_S16)(c0-c1+c2-c3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 43 test(C& c1, int size)
46 std::size_t c1_osize = c1.size();
47 c1.resize(size);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 43 test(C& c1, int size, int x)
46 std::size_t c1_osize = c1.size();
47 c1.resize(size, x);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| shrink_to_fit.pass.cpp | 43 test(C& c1)
45 C s = c1;
46 c1.shrink_to_fit();
47 assert(c1 == s);
55 C c1 = make<C>(N, start); local
56 test(c1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| assign_iter_iter.pass.cpp | 45 test(C& c1, const C& c2)
47 std::size_t c1_osize = c1.size();
48 c1.assign(c2.begin(), c2.end());
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 assert(c1 == c2);
59 C c1 = make<C>(N, start); local
61 test(c1, c2);
66 testI(C& c1, const C& c2
82 C c1 = make<C>(N, start); local
[all...] |
| assign_size_value.pass.cpp | 44 test(C& c1, int size, int v)
47 std::size_t c1_osize = c1.size();
48 c1.assign(size, v);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 for (CI i = c1.begin(); i != c1.end(); ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 46 test(int P, C& c1)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
68 C c1 = make<C>(N, start) local
76 C c1 = make<C>(N, start); local
84 C c1 = make<C>(N, start); local
[all...] |
| emplace_back.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_back(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.end();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| emplace_front.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_front(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| erase_iter_iter.pass.cpp | 43 test(int P, C& c1, int size)
46 assert(P + size <= c1.size());
47 std::size_t c1_osize = c1.size();
48 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize - size);
51 assert(distance(c1.begin(), c1.end()) == c1.size())
70 C c1 = make<C>(N, start); local
[all...] |
| insert_rvalue.pass.cpp | 46 test(int P, C& c1, int x)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
55 i = c1.begin()
74 C c1 = make<C>(N, start); local
82 C c1 = make<C>(N, start); local
90 C c1 = make<C>(N, start); local
[all...] |
| pop_back.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| pop_front.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_front();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 1; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| push_front.pass.cpp | 43 test(C& c1, int x)
46 std::size_t c1_osize = c1.size();
47 c1.push_front(x);
48 assert(c1.size() == c1_osize + 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1, -10)
[all...] |
| push_front_rvalue.pass.cpp | 46 test(C& c1, int x)
49 std::size_t c1_osize = c1.size();
50 c1.push_front(MoveOnly(x));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
64 C c1 = make<C>(N, start); local
65 test(c1, -10)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 54 C c1 = make<C>(N, start); local
56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(c1 == c2);
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(c1 == c2);
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(c1 == c2)
[all...] |
| copy_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| move.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
56 assert(c1 == c2);
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
58 assert(c1 == c2);
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(c1 == c2)
[all...] |
| move_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| swap.pass.cpp | 45 C c1 = make<C>(N, start); local
47 C c1_save = c1;
49 swap(c1, c2);
50 assert(c1 == c2_save);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator() == A(1));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| emplace.pass.cpp | 56 std::list<A> c1; local
58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
80 std::list<A, min_allocator<A>> c1; local
82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| emplace.pass.cpp | 112 std::vector<A> c1; local
114 std::vector<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
145 std::vector<A, min_allocator<A>> c1; local
147 std::vector<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /libcore/luni/src/test/java/tests/security/cert/ |
| CertificateTest.java | 63 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
64 assertTrue(Arrays.equals(testEncoding, c1.getEncoded()));
65 assertEquals("TEST", c1.getPublicKey().getAlgorithm());
67 c1.getPublicKey().getEncoded()));
68 assertEquals("TEST_FORMAT", c1.getPublicKey().getFormat());
69 assertEquals("TEST_TYPE", c1.getType());
78 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
81 assertTrue(c1.hashCode() == c2.hashCode());
83 assertFalse(c1.hashCode() == new MyCertificate("TEST_TYPE", cert
85 assertFalse(c1.hashCode() == cert.hashCode())
93 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
106 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
115 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
125 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
135 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
145 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
158 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
192 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
211 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
219 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
227 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
235 MyCertificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
388 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
415 MyCertificate c1 = new MyFailingCertificate("TEST_TYPE", testEncoding); local
[all...] |
| /external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/ |
| CipherSuiteTest.java | 29 CipherSuite c1 = new CipherSuite("CipherSuite1", false, 0, "", "", local
37 if (!c1.equals(c2) || c1.equals(c3) || c4.equals(c1) || c4.equals(c3)) {
43 CipherSuite c1 = new CipherSuite("CipherSuite1", false, 0, "", "", local
46 c1.toString());
91 CipherSuite c1 = new CipherSuite("CipherSuite1", false, local
100 assertTrue(c1.isAnonymous());
101 assertTrue(c1.isAnonymous());
|
| /art/runtime/ |
| utf.cc | 113 int c1 = GetUtf16FromUtf8(&utf8_1); local
116 if (c1 != c2) {
117 return c1 > c2 ? 1 : -1;
130 int c1 = GetUtf16FromUtf8(&utf8_1); local
133 if (c1 != c2) {
134 return c1 > c2 ? 1 : -1;
|
