| /llvm-project/clang/test/Index/ |
| H A D | nested-binaryoperators.cpp | 2 int foo(uint c) { in foo() argument
3 return ((c >= 0x41 && c <= 0x5a) in foo()
4 || (c >= 0x61 && c <= 0x7a) in foo()
5 || (c >= 0xc0 && c <= 0xd6) in foo()
6 || (c >= 0xd8 && c <= 0xf6) in foo()
7 || (c > in foo()
[all...] |
| /llvm-project/libcxx/test/std/re/re.traits/ |
| H A D | value.pass.cpp | 24 for (char c = 0; c < '0'; ++c) in main() local
26 assert(t.value(c, 8) == -1); in main()
27 assert(t.value(c, 10) == -1); in main()
28 assert(t.value(c, 16) == -1); in main()
30 for (char c = '0'; c < '8'; ++c) in main() local
32 assert(t.value(c, 8) == c - '0'); in main()
33 assert(t.value(c, 10) == c - '0'); in main()
34 assert(t.value(c, 16) == c - '0'); in main()
36 for (char c = '8'; c < ':'; ++c) in main() local
38 assert(t.value(c, 8) == -1); in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| H A D | erase_after_many.pass.cpp | 26 C c(std::begin(t), std::end(t)); in main() local
28 … C::iterator i = c.erase_after(std::next(c.cbefore_begin(), 4), std::next(c.cbefore_begin(), 4)); in main()
29 assert(i == std::next(c.cbefore_begin(), 4)); in main()
30 assert(std::distance(c.begin(), c.end()) == 10); in main()
31 assert(*std::next(c.begin(), 0) == 0); in main()
32 assert(*std::next(c.begin(), 1) == 1); in main()
33 assert(*std::next(c.begin(), 2) == 2); in main()
34 assert(*std::next(c.begin(), 3) == 3); in main()
35 assert(*std::next(c.begin(), 4) == 4); in main()
36 assert(*std::next(c.begin(), 5) == 5); in main()
[all …]
|
| H A D | resize_size.pass.cpp | 26 C c; in main() local
27 c.resize(0); in main()
28 assert(std::distance(c.begin(), c.end()) == 0); in main()
29 c.resize(10); in main()
30 assert(std::distance(c.begin(), c.end()) == 10); in main()
31 c.resize(20); in main()
32 assert(std::distance(c.begin(), c.end()) == 20); in main()
33 c.resize(5); in main()
34 assert(std::distance(c.begin(), c.end()) == 5); in main()
35 c.resize(0); in main()
[all …]
|
| H A D | erase_after_one.pass.cpp | 26 C c(std::begin(t), std::end(t)); in main() local
28 C::iterator i = c.erase_after(std::next(c.cbefore_begin(), 4)); in main()
29 assert(i == c.end()); in main()
30 assert(std::distance(c.begin(), c.end()) == 4); in main()
31 assert(*std::next(c.begin(), 0) == 0); in main()
32 assert(*std::next(c.begin(), 1) == 1); in main()
33 assert(*std::next(c.begin(), 2) == 2); in main()
34 assert(*std::next(c.begin(), 3) == 3); in main()
36 i = c.erase_after(std::next(c.cbefore_begin(), 0)); in main()
37 assert(i == c.begin()); in main()
[all …]
|
| /llvm-project/llvm/utils/gn/secondary/compiler-rt/lib/builtins/ |
| H A D | BUILD.gn | 93 "absvdi2.c",
94 "absvsi2.c",
95 "absvti2.c",
96 "adddf3.c",
97 "addsf3.c",
98 "addvdi3.c",
99 "addvsi3.c",
100 "addvti3.c",
101 "apple_versioning.c",
102 "ashldi3.c",
[all...] |
| /llvm-project/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| H A D | emplace_back.pass.cpp | 60 std::vector<A> c; in tests() local
62 A& r1 = c.emplace_back(2, 3.5); in tests()
63 assert(c.size() == 1); in tests()
64 assert(&r1 == &c.back()); in tests()
65 assert(c.front().geti() == 2); in tests()
66 assert(c.front().getd() == 3.5); in tests()
67 assert(is_contiguous_container_asan_correct(c)); in tests()
68 A& r2 = c.emplace_back(3, 4.5); in tests()
69 assert(c.size() == 2); in tests()
70 assert(&r2 == &c.back()); in tests()
[all …]
|
| H A D | emplace.pass.cpp | 58 std::vector<A> c; in tests() local
59 std::vector<A>::iterator i = c.emplace(c.cbegin(), 2, 3.5); in tests()
60 assert(i == c.begin()); in tests()
61 assert(c.size() == 1); in tests()
62 assert(c.front().geti() == 2); in tests()
63 assert(c.front().getd() == 3.5); in tests()
64 assert(is_contiguous_container_asan_correct(c)); in tests()
65 i = c.emplace(c.cend(), 3, 4.5); in tests()
66 assert(i == c.end()-1); in tests()
67 assert(c.size() == 2); in tests()
[all …]
|
| H A D | push_back.pass.cpp | 24 std::vector<int> c; in tests() local
25 c.push_back(0); in tests()
26 assert(c.size() == 1); in tests()
27 assert(is_contiguous_container_asan_correct(c)); in tests()
28 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests()
29 assert(c[j] == j); in tests()
30 c.push_back(1); in tests()
31 assert(c.size() == 2); in tests()
32 assert(is_contiguous_container_asan_correct(c)); in tests()
33 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests()
[all …]
|
| H A D | push_back_rvalue.pass.cpp | 27 std::vector<MoveOnly> c; in tests() local
28 c.push_back(MoveOnly(0)); in tests()
29 assert(c.size() == 1); in tests()
30 assert(is_contiguous_container_asan_correct(c)); in tests()
31 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests()
32 assert(c[j] == MoveOnly(j)); in tests()
33 c.push_back(MoveOnly(1)); in tests()
34 assert(c.size() == 2); in tests()
35 assert(is_contiguous_container_asan_correct(c)); in tests()
36 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in tests()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| H A D | assign_move.pass.cpp | 57 C c(a, a + 2, in main() local
63 c = std::move(c0); in main()
64 LIBCPP_ASSERT(c.bucket_count() == 7); in main()
65 assert(c.size() == 6); in main()
66 CheckConsecutiveValues<C::const_iterator>(c.find(1), c.end(), 1, 2); in main()
67 CheckConsecutiveValues<C::const_iterator>(c.find(2), c.end(), 2, 2); in main()
68 CheckConsecutiveValues<C::const_iterator>(c.find(3), c.end(), 3, 1); in main()
69 CheckConsecutiveValues<C::const_iterator>(c.find(4), c.end(), 4, 1); in main()
70 assert(c.hash_function() == test_hash<int>(8)); in main()
71 assert(c.key_eq() == test_equal_to<int>(9)); in main()
[all …]
|
| H A D | init.pass.cpp | 40 C c = { in main() local
48 assert(c.bucket_count() >= 7); in main()
49 assert(c.size() == 6); in main()
50 assert(c.count(1) == 2); in main()
51 assert(c.count(2) == 2); in main()
52 assert(c.count(3) == 1); in main()
53 assert(c.count(4) == 1); in main()
54 assert(c.hash_function() == test_hash<int>()); in main()
55 assert(c.key_eq() == test_equal_to<int>()); in main()
56 assert(c.get_allocator() == test_allocator<int>()); in main()
[all …]
|
| H A D | assign_copy.pass.cpp | 56 C c(a, a + 2, in main() local
62 c = c0; in main()
63 LIBCPP_ASSERT(c.bucket_count() == 7); in main()
64 assert(c.size() == 6); in main()
65 CheckConsecutiveValues<C::const_iterator>(c.find(1), c.end(), 1, 2); in main()
66 CheckConsecutiveValues<C::const_iterator>(c.find(2), c.end(), 2, 2); in main()
67 CheckConsecutiveValues<C::const_iterator>(c.find(3), c.end(), 3, 1); in main()
68 CheckConsecutiveValues<C::const_iterator>(c.find(4), c.end(), 4, 1); in main()
69 assert(c.hash_function() == test_hash<int>(8)); in main()
70 assert(c.key_eq() == test_equal_to<int>(9)); in main()
[all …]
|
| H A D | move_alloc.pass.cpp | 57 C c(std::move(c0), A(12)); in main() local
58 assert(c.bucket_count() >= 7); in main()
59 assert(c.size() == 6); in main()
60 CheckConsecutiveValues<C::const_iterator>(c.find(1), c.end(), 1, 2); in main()
61 CheckConsecutiveValues<C::const_iterator>(c.find(2), c.end(), 2, 2); in main()
62 CheckConsecutiveValues<C::const_iterator>(c.find(3), c.end(), 3, 1); in main()
63 CheckConsecutiveValues<C::const_iterator>(c.find(4), c.end(), 4, 1); in main()
64 assert(c.hash_function() == test_hash<int>(8)); in main()
65 assert(c.key_eq() == test_equal_to<int>(9)); in main()
66 assert(c.get_allocator() == A(12)); in main()
[all …]
|
| H A D | copy.pass.cpp | 54 C c = c0; in main() local
55 LIBCPP_ASSERT(c.bucket_count() == 7); in main()
56 assert(c.size() == 6); in main()
57 CheckConsecutiveValues<C::const_iterator>(c.find(1), c.end(), 1, 2); in main()
58 CheckConsecutiveValues<C::const_iterator>(c.find(2), c.end(), 2, 2); in main()
59 CheckConsecutiveValues<C::const_iterator>(c.find(3), c.end(), 3, 1); in main()
60 CheckConsecutiveValues<C::const_iterator>(c.find(4), c.end(), 4, 1); in main()
61 assert(c.hash_function() == test_hash<int>(8)); in main()
62 assert(c.key_eq() == test_equal_to<int>(9)); in main()
63 assert(c.get_allocator() == test_allocator<int>(10)); in main()
[all …]
|
| H A D | iter_iter.pass.cpp | 49 C c(cpp17_input_iterator<P*>(a), cpp17_input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); in main() local
50 assert(c.bucket_count() >= 7); in main()
51 assert(c.size() == 6); in main()
52 assert(c.count(1) == 2); in main()
53 assert(c.count(2) == 2); in main()
54 assert(c.count(3) == 1); in main()
55 assert(c.count(4) == 1); in main()
56 assert(c.hash_function() == test_hash<int>()); in main()
57 assert(c.key_eq() == test_equal_to<int>()); in main()
58 assert(c.get_allocator() == test_allocator<int>()); in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| H A D | init.pass.cpp | 40 C c = { in main() local
48 assert(c.bucket_count() >= 5); in main()
49 assert(c.size() == 4); in main()
50 assert(c.count(1) == 1); in main()
51 assert(c.count(2) == 1); in main()
52 assert(c.count(3) == 1); in main()
53 assert(c.count(4) == 1); in main()
54 assert(c.hash_function() == test_hash<int>()); in main()
55 assert(c.key_eq() == test_equal_to<int>()); in main()
56 assert(c.get_allocator() == test_allocator<int>()); in main()
[all …]
|
| H A D | iter_iter.pass.cpp | 49 C c(cpp17_input_iterator<P*>(a), cpp17_input_iterator<P*>(a + sizeof(a)/sizeof(a[0]))); in main() local
50 assert(c.bucket_count() >= 5); in main()
51 assert(c.size() == 4); in main()
52 assert(c.count(1) == 1); in main()
53 assert(c.count(2) == 1); in main()
54 assert(c.count(3) == 1); in main()
55 assert(c.count(4) == 1); in main()
56 assert(c.hash_function() == test_hash<int>()); in main()
57 assert(c.key_eq() == test_equal_to<int>()); in main()
58 assert(c.get_allocator() == test_allocator<int>()); in main()
[all …]
|
| H A D | assign_move.pass.cpp | 56 C c(a, a + 2, in main() local
62 c = std::move(c0); in main()
63 LIBCPP_ASSERT(c.bucket_count() == 7); in main()
64 assert(c.size() == 4); in main()
65 assert(c.count(1) == 1); in main()
66 assert(c.count(2) == 1); in main()
67 assert(c.count(3) == 1); in main()
68 assert(c.count(4) == 1); in main()
69 assert(c.hash_function() == test_hash<int>(8)); in main()
70 assert(c.key_eq() == test_equal_to<int>(9)); in main()
[all …]
|
| H A D | assign_copy.pass.cpp | 55 C c(a, a + 2, in main() local
61 c = c0; in main()
62 LIBCPP_ASSERT(c.bucket_count() == 7); in main()
63 assert(c.size() == 4); in main()
64 assert(c.count(1) == 1); in main()
65 assert(c.count(2) == 1); in main()
66 assert(c.count(3) == 1); in main()
67 assert(c.count(4) == 1); in main()
68 assert(c.hash_function() == test_hash<int>(8)); in main()
69 assert(c.key_eq() == test_equal_to<int>(9)); in main()
[all …]
|
| /llvm-project/compiler-rt/test/sanitizer_common/TestCases/ |
| H A D | ctype.c | 11 unsigned char c; in check_ctype() local
14 for (c = 0; c < UCHAR_MAX; c++) in check_ctype()
15 i += !!isalpha(c); in check_ctype()
16 for (c = 0; c < UCHAR_MAX; c++) in check_ctype()
17 i += !!isascii(c); in check_ctype()
18 for (c = 0; c < UCHAR_MAX; c++) in check_ctype()
19 i += !!isblank(c); in check_ctype()
20 for (c = 0; c < UCHAR_MAX; c++) in check_ctype()
21 i += !!iscntrl(c); in check_ctype()
22 for (c = 0; c < UCHAR_MAX; c++) in check_ctype()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| H A D | erase_key.pass.cpp | 57 C c(a, a + sizeof(a)/sizeof(a[0])); in main() local
58 assert(c.erase(5) == 0); in main()
59 assert(c.size() == 6); in main()
61 Eq eq = c.equal_range(1); in main()
66 CheckConsecutiveKeys<C::const_iterator>(c.find(1), c.end(), 1, s); in main()
67 eq = c.equal_range(2); in main()
71 CheckConsecutiveKeys<C::const_iterator>(c.find(2), c.end(), 2, s); in main()
72 eq = c.equal_range(3); in main()
77 eq = c.equal_range(4); in main()
82 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| H A D | init.pass.cpp | 41 C c = { in main() local
49 assert(c.bucket_count() >= 5); in main()
50 assert(c.size() == 4); in main()
51 assert(c.at(1) == "one"); in main()
52 assert(c.at(2) == "two"); in main()
53 assert(c.at(3) == "three"); in main()
54 assert(c.at(4) == "four"); in main()
55 assert(c.hash_function() == test_hash<int>()); in main()
56 assert(c.key_eq() == test_equal_to<int>()); in main()
57 assert(c.get_allocator() == in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.multiset/ |
| H A D | local_iterators.pass.cpp | 43 C c(a, a + sizeof(a)/sizeof(a[0])); in main() local
44 assert(c.bucket_count() >= 7); in main()
45 C::size_type b = c.bucket(0); in main()
46 I i = c.begin(b); in main()
47 I j = c.end(b); in main()
50 b = c.bucket(1); in main()
51 i = c.begin(b); in main()
52 j = c.end(b); in main()
58 b = c.bucket(2); in main()
59 i = c.begin(b); in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.set/ |
| H A D | erase_key.pass.cpp | 54 C c(a, a + sizeof(a)/sizeof(a[0])); in main() local
55 assert(c.erase(5) == 0); in main()
56 assert(c.size() == 4); in main()
57 assert(c.count(1) == 1); in main()
58 assert(c.count(2) == 1); in main()
59 assert(c.count(3) == 1); in main()
60 assert(c.count(4) == 1); in main()
62 assert(c.erase(2) == 1); in main()
63 assert(c.size() == 3); in main()
64 assert(c.count(1) == 1); in main()
[all …]
|