| /external/valgrind/memcheck/tests/ |
| long_namespace_xml.stdout.exp | 1 I'm in an asininely long namespace!
|
| /prebuilts/go/darwin-x86/src/cmd/go/testdata/importcom/src/works/x/ |
| x1.go | 1 package x // important! not an import comment
|
| /prebuilts/go/linux-x86/src/cmd/go/testdata/importcom/src/works/x/ |
| x1.go | 1 package x // important! not an import comment
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| issperr.h | 6 #warning The header issperr.h is an obsolete file.
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/d10v/ |
| immediate-004.d | 2 #error : operand is not an immediate
|
| immediate-005.d | 2 #error : operand is not an immediate
|
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-mmix/ |
| nop123.s | 1 # A nop to pad with an explicit insn.
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector/vector.cons/ |
| construct_iter_iter.pass.cpp | 39 int* an = a + sizeof(a)/sizeof(a[0]); local
40 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an));
41 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
42 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
43 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
44 test<std::vector<int> >(a, an);
46 test<std::vector<int, limited_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an));
48 test<std::vector<int, limited_allocator<int, 18 + 1> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
49 test<std::vector<int, limited_allocator<int, 18 + 1> > >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
50 test<std::vector<int, limited_allocator<int, 18 + 1> > >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
[all...] |
| construct_iter_iter_alloc.pass.cpp | 55 int* an = a + sizeof(a)/sizeof(a[0]); local
57 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc);
58 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc);
59 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc);
60 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an), alloc);
61 test<std::vector<int> >(a, an, alloc);
66 int* an = a + sizeof(a)/sizeof(a[0]); local
68 test<std::vector<int, min_allocator<int>> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc);
69 test<std::vector<int, min_allocator<int>> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc);
70 test<std::vector<int, min_allocator<int>> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc)
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/arm/ |
| arm-it-bad-2.l | 2 [^:]*:9: Warning: section '.text' finished with an open IT block.
3 [^:]*:9: Warning: section 'second' finished with an open IT block.
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mt/ |
| badreg.s | 1 ; Bad register name should generate an error.
|
| badsignedimmhigh.s | 1 ; Offset greater than #32767 should cause an error.
|
| badsignedimmlow.s | 1 ; Immediate lower than #-32769 should cause an error.
|
| badunsignedimmlow.s | 1 ; Offset less than #0 should cause an error.
|
| /external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_iter_iter.pass.cpp | 22 int* an = a + sizeof(a)/sizeof(a[0]); local
23 std::priority_queue<int> q(a, an);
24 assert(q.size() == static_cast<std::size_t>(an - a));
|
| ctor_iter_iter_comp.pass.cpp | 23 int* an = a + sizeof(a)/sizeof(a[0]); local
25 q(a, an, std::greater<int>());
26 assert(q.size() == static_cast<std::size_t>(an - a));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_iter_iter.pass.cpp | 22 int* an = a + sizeof(a)/sizeof(a[0]); local
23 std::priority_queue<int> q(a, an);
24 assert(q.size() == static_cast<std::size_t>(an - a));
|
| ctor_iter_iter_comp.pass.cpp | 23 int* an = a + sizeof(a)/sizeof(a[0]); local
25 q(a, an, std::greater<int>());
26 assert(q.size() == static_cast<std::size_t>(an - a));
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| construct_iter_iter.pass.cpp | 37 bool* an = a + sizeof(a)/sizeof(a[0]); local
38 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an));
39 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an));
40 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an));
41 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an));
42 test<std::vector<bool> >(a, an);
44 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an));
45 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an));
46 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an));
47 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an));
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector.bool/ |
| construct_iter_iter.pass.cpp | 37 bool* an = a + sizeof(a)/sizeof(a[0]); local
38 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an));
39 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an));
40 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an));
41 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an));
42 test<std::vector<bool> >(a, an);
44 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an));
45 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an));
46 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an));
47 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an));
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)),
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
| copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)),
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); local
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
| /frameworks/base/libs/hwui/debug/ |
| wrap_gles.h | 11 * distributed under the License is distributed on an "AS IS" BASIS,
19 #error wrap_gles.h should only be used as an auto-included header, don't directly #include it
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/all/ |
| equiv2.s | 1 ;# Re-definition of an already .equiv-ed symbol (to an expression).
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| elf-rel14.s | 5 # Insert an instruction that doesn't use $5 to avoid a spurious
|
