| /external/libcxx/test/std/containers/sequences/vector/vector.special/ |
| db_swap_1.pass.cpp | 30 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 std::vector<int>::iterator i1 = c1.begin();
34 swap(c1, c2);
35 c1.erase(i2);
37 c1.erase(i1);
44 std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
46 std::vector<int, min_allocator<int>>::iterator i1 = c1.begin();
48 swap(c1, c2);
49 c1.erase(i2);
51 c1.erase(i1)
[all...] |
| /external/llvm/test/MC/ARM/ |
| thumb-only-conditionals.s | 22 cdpgt p7, #1, c1, c1, c1, #4
23 cdp2gt p7, #1, c1, c1, c1, #4
25 @ CHECK-NEXT: cdpgt p7, #1, c1, c1, c1, #4
26 @ CHECK-NEXT: cdp2gt p7, #1, c1, c1, c1, #
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| assign_copy.pass.cpp | 30 C c1(std::begin(t1), std::end(t1), A(10));
31 c1 = c0;
32 assert(c1 == c0);
33 assert(c1.get_allocator() == A(10));
42 C c1(std::begin(t1), std::end(t1), A(11));
43 c1 = c0;
44 assert(c1 == c0);
45 assert(c1.get_allocator() == A(11));
54 C c1(std::begin(t1), std::end(t1), A(10));
55 c1 = c0
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/ |
| db_swap_1.pass.cpp | 31 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 std::list<int>::iterator i1 = c1.begin();
35 swap(c1, c2);
36 c1.erase(i2);
39 c1.erase(i1);
46 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
48 std::list<int, min_allocator<int>>::iterator i1 = c1.begin();
50 swap(c1, c2);
51 c1.erase(i2);
54 c1.erase(i1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/ |
| db_swap_1.pass.cpp | 30 std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 std::vector<int>::iterator i1 = c1.begin();
34 swap(c1, c2);
35 c1.erase(i2);
37 c1.erase(i1);
44 std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
46 std::vector<int, min_allocator<int>>::iterator i1 = c1.begin();
48 swap(c1, c2);
49 c1.erase(i2);
51 c1.erase(i1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.swap/ |
| swap_noexcept.pass.cpp | 46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
52 C c1, c2; local
53 static_assert(noexcept(swap(c1, c2)), "");
58 C c1, c2; local
59 static_assert(noexcept(swap(c1, c2)), "");
63 C c1, c2; local
64 static_assert(!noexcept(swap(c1, c2)), "");
69 C c1, c2; local
70 static_assert(!noexcept(swap(c1, c2)), "")
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_noexcept.pass.cpp | 46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
52 C c1, c2; local
53 static_assert(noexcept(swap(c1, c2)), "");
58 C c1, c2; local
59 static_assert(noexcept(swap(c1, c2)), "");
63 C c1, c2; local
64 static_assert(!noexcept(swap(c1, c2)), "");
69 C c1, c2; local
70 static_assert(!noexcept(swap(c1, c2)), "")
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_noexcept.pass.cpp | 46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
52 C c1, c2; local
53 static_assert(noexcept(swap(c1, c2)), "");
58 C c1, c2; local
59 static_assert(noexcept(swap(c1, c2)), "");
63 C c1, c2; local
64 static_assert(!noexcept(swap(c1, c2)), "");
69 C c1, c2; local
70 static_assert(!noexcept(swap(c1, c2)), "")
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| swap_noexcept.pass.cpp | 46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
52 C c1, c2; local
53 static_assert(noexcept(swap(c1, c2)), "");
58 C c1, c2; local
59 static_assert(noexcept(swap(c1, c2)), "");
63 C c1, c2; local
64 static_assert(!noexcept(swap(c1, c2)), "");
69 C c1, c2; local
70 static_assert(!noexcept(swap(c1, c2)), "")
[all...] |
| /external/eigen/test/ |
| block.cpp | 15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) {
18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1));
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,c2-c1+1));
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,c2-c1+1))
57 Index c1 = internal::random<Index>(0,cols-1); local
222 Index c1 = internal::random<Index>(0,cols-1); local
[all...] |
| /external/clang/test/Sema/ |
| attr-cleanup.c | 3 void c1(int *a);
5 extern int g1 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}}
6 int g2 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}}
7 static int g3 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}}
14 static int v3 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}}
18 int v5 __attribute((cleanup(c1)));
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.spec/ |
| relational.pass.cpp | 39 C c1; local
41 c1.push_front(i);
46 assert(c1 < c2);
48 assert(c1 <= c2);
50 assert(c1 >= c2);
52 assert(c1 > c2);
|
| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 c1.merge(c2);
28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
37 c1.merge(c2);
38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| merge_comp.pass.cpp | 26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
28 c1.merge(c2, std::greater<int>());
29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
38 c1.merge(c2, std::greater<int>());
39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| /external/selinux/policycoreutils/mcstrans/share/examples/default/ |
| setrans.conf | 29 s2:c1=B
39 s0-s2:c1=SystemLow-Secret:B
40 s0-s2:c0,c1=SystemLow-Secret:AB
42 s1-s2:c1=Unclassified-Secret:B
43 s1-s2:c0,c1=Unclassified-Secret:AB
45 s2-s2:c1=Secret-Secret:B
46 s2-s2:c0,c1=Secret-Secret:AB
48 s2:c0-s2:c0,c1=Secret:A-Secret:AB
50 s2:c1-s2:c0,c1=Secret:B-Secret:A
[all...] |
| /external/selinux/policycoreutils/mcstrans/share/examples/include/setrans.d/ |
| include-example | 29 s2:c1=B
39 s0-s2:c1=SystemLow-Secret:B
40 s0-s2:c0,c1=SystemLow-Secret:AB
42 s1-s2:c1=Unclassified-Secret:B
43 s1-s2:c0,c1=Unclassified-Secret:AB
45 s2-s2:c1=Secret-Secret:B
46 s2-s2:c0,c1=Secret-Secret:AB
48 s2:c0-s2:c0,c1=Secret:A-Secret:AB
50 s2:c1-s2:c0,c1=Secret:B-Secret:A
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/ |
| relational.pass.cpp | 39 C c1; local
41 c1.push_front(i);
46 assert(c1 < c2);
48 assert(c1 <= c2);
50 assert(c1 >= c2);
52 assert(c1 > c2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 c1.merge(c2);
28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
37 c1.merge(c2);
38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| merge_comp.pass.cpp | 26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
28 c1.merge(c2, std::greater<int>());
29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
38 c1.merge(c2, std::greater<int>());
39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| /toolchain/binutils/binutils-2.25/gold/testsuite/ |
| dwp_test_main.cc | 32 C1 c1; local
40 assert(c1.testcase1());
41 assert(c1.t1a());
42 assert(c1.testcase2());
43 assert(c1.testcase3());
44 assert(c1.testcase4());
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ilp32/ |
| x86-64-ssse3.d | 11 4: 0f 38 01 c1[ ]+phaddw %mm1,%mm0
13 d: 66 0f 38 01 c1[ ]+phaddw %xmm1,%xmm0
15 16: 0f 38 02 c1[ ]+phaddd %mm1,%mm0
17 1f: 66 0f 38 02 c1[ ]+phaddd %xmm1,%xmm0
19 28: 0f 38 03 c1[ ]+phaddsw %mm1,%mm0
21 31: 66 0f 38 03 c1[ ]+phaddsw %xmm1,%xmm0
23 3a: 0f 38 05 c1[ ]+phsubw %mm1,%mm0
25 43: 66 0f 38 05 c1[ ]+phsubw %xmm1,%xmm0
27 4c: 0f 38 06 c1[ ]+phsubd %mm1,%mm0
29 55: 66 0f 38 06 c1[ ]+phsubd %xmm1,%xmm
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
| ssse3.d | 10 4: 0f 38 01 c1[ ]+phaddw %mm1,%mm0
12 d: 66 0f 38 01 c1[ ]+phaddw %xmm1,%xmm0
14 16: 0f 38 02 c1[ ]+phaddd %mm1,%mm0
16 1f: 66 0f 38 02 c1[ ]+phaddd %xmm1,%xmm0
18 28: 0f 38 03 c1[ ]+phaddsw %mm1,%mm0
20 31: 66 0f 38 03 c1[ ]+phaddsw %xmm1,%xmm0
22 3a: 0f 38 05 c1[ ]+phsubw %mm1,%mm0
24 43: 66 0f 38 05 c1[ ]+phsubw %xmm1,%xmm0
26 4c: 0f 38 06 c1[ ]+phsubd %mm1,%mm0
28 55: 66 0f 38 06 c1[ ]+phsubd %xmm1,%xmm
[all...] |
| x86-64-ssse3.d | 10 4: 0f 38 01 c1[ ]+phaddw %mm1,%mm0
12 d: 66 0f 38 01 c1[ ]+phaddw %xmm1,%xmm0
14 16: 0f 38 02 c1[ ]+phaddd %mm1,%mm0
16 1f: 66 0f 38 02 c1[ ]+phaddd %xmm1,%xmm0
18 28: 0f 38 03 c1[ ]+phaddsw %mm1,%mm0
20 31: 66 0f 38 03 c1[ ]+phaddsw %xmm1,%xmm0
22 3a: 0f 38 05 c1[ ]+phsubw %mm1,%mm0
24 43: 66 0f 38 05 c1[ ]+phsubw %xmm1,%xmm0
26 4c: 0f 38 06 c1[ ]+phsubd %mm1,%mm0
28 55: 66 0f 38 06 c1[ ]+phsubd %xmm1,%xmm
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 44 test(C& c1, int size)
47 typename C::size_type c1_osize = c1.size();
48 c1.resize(size);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 CI i = c1.begin();
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
54 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 44 test(C& c1, int size, int x)
47 typename C::size_type c1_osize = c1.size();
48 c1.resize(size, x);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 CI i = c1.begin();
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
54 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
