| /llvm-project/clang/test/Index/ |
| H A D | recursive-member-access.c | 2 struct rdar8650865 *first; member
7 return ((((((s->first)->first) in test_rdar8650865()
8 ->first) in test_rdar8650865()
9 ->first) in test_rdar8650865()
10 ->first) in test_rdar8650865()
11 ->first) in test_rdar8650865()
12 ->first in test_rdar8650865()
13 ->first in test_rdar8650865()
14 ->first in test_rdar8650865()
15 ->first in test_rdar8650865()
[all …]
|
| /llvm-project/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 41 Holder<Incomplete> **first = t.data; in all_the_algorithms() local
50 (void)std::adjacent_find(first, last); in all_the_algorithms()
51 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
53 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
54 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
56 (void)std::binary_search(first, last, value); in all_the_algorithms()
57 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
62 (void)std::copy(first, last, first2); in all_the_algorithms()
63 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
64 (void)std::copy_n(first, count, first2); in all_the_algorithms()
[all …]
|
| H A D | robust_re_difference_type.compile.pass.cpp | 79 auto first = PickyIterator<void**, long>(a); in all_the_algorithms()
88 (void)std::adjacent_find(first, last); in all_the_algorithms()
89 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms()
91 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms()
92 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms()
94 (void)std::binary_search(first, last, value); in all_the_algorithms()
95 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
100 (void)std::copy(first, last, first2); in all_the_algorithms()
101 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
102 (void)std::copy_n(first, coun in all_the_algorithms()
78 auto first = PickyIterator<void**, long>(a); all_the_algorithms() local
[all...] |
| /llvm-project/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| H A D | insert_rvalue.pass.cpp | 38 assert(r.first->first == 3.5); in main()
39 assert(r.first->second == 3); in main()
44 assert(r.first->first == 3.5); in main()
45 assert(r.first->second == 3); in main()
50 assert(r.first->first == 4.5); in main()
51 assert(r.first->second == 4); in main()
56 assert(r.first->first == 5.5); in main()
57 assert(r.first->second == 4); in main()
67 assert(r.first->first == 3); in main()
68 assert(r.first->second == 3); in main()
[all …]
|
| /llvm-project/llvm/unittests/ADT/ |
| H A D | MapVectorTest.cpp | 49 ASSERT_EQ(R.first, MV1.begin()); in TEST()
50 EXPECT_EQ(R.first->first, 1); in TEST()
51 EXPECT_EQ(R.first->second, 2); in TEST()
65 EXPECT_EQ(I->first, 1); in TEST()
74 ASSERT_EQ(R.first, MV.begin()); in TEST()
75 EXPECT_EQ(R.first->first, 1); in TEST()
76 EXPECT_EQ(R.first->second, 2); in TEST()
80 ASSERT_EQ(R.first, MV.begin()); in TEST()
81 EXPECT_EQ(R.first->first, 1); in TEST()
82 EXPECT_EQ(R.first->second, 2); in TEST()
[all …]
|
| /llvm-project/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_copying_comparators.pass.cpp | 98 T *first = a; in all_the_algorithms()
108 (void)std::adjacent_find(first, last, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
110 (void)std::all_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
111 (void)std::any_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
113 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
117 (void)std::count_if(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
118 (void)std::copy_if(first, last, first2, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
119 (void)std::equal(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
121 (void)std::equal(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
123 (void)std::equal_range(first, las in all_the_algorithms()
97 T *first = a; all_the_algorithms() local
[all...] |
| /llvm-project/libcxx/test/std/containers/associative/map/map.modifiers/ |
| H A D | insert_rv.pass.cpp | 35 assert(r.first == m.begin()); in do_insert_rv_test()
37 assert(r.first->first == 2); in do_insert_rv_test()
38 assert(r.first->second == 2); in do_insert_rv_test()
42 assert(r.first == m.begin()); in do_insert_rv_test()
44 assert(r.first->first == 1); in do_insert_rv_test()
45 assert(r.first->second == 1); in do_insert_rv_test()
49 assert(r.first == std::prev(m.end())); in do_insert_rv_test()
51 assert(r.first->first == 3); in do_insert_rv_test()
52 assert(r.first->second == 3); in do_insert_rv_test()
56 assert(r.first == std::prev(m.end())); in do_insert_rv_test()
[all …]
|
| H A D | erase_key.pass.cpp | 43 assert(m.begin()->first == 1); in main()
45 assert(std::next(m.begin())->first == 2); in main()
47 assert(std::next(m.begin(), 2)->first == 3); in main()
49 assert(std::next(m.begin(), 3)->first == 4); in main()
51 assert(std::next(m.begin(), 4)->first == 5); in main()
53 assert(std::next(m.begin(), 5)->first == 6); in main()
55 assert(std::next(m.begin(), 6)->first == 7); in main()
57 assert(std::next(m.begin(), 7)->first == 8); in main()
63 assert(m.begin()->first == 1); in main()
65 assert(std::next(m.begin())->first == 2); in main()
[all …]
|
| H A D | erase_iter.pass.cpp | 51 assert(m.begin()->first == 1); in main()
53 assert(std::next(m.begin())->first == 2); in main()
55 assert(std::next(m.begin(), 2)->first == 3); in main()
57 assert(std::next(m.begin(), 3)->first == 5); in main()
59 assert(std::next(m.begin(), 4)->first == 6); in main()
61 assert(std::next(m.begin(), 5)->first == 7); in main()
63 assert(std::next(m.begin(), 6)->first == 8); in main()
69 assert(m.begin()->first == 2); in main()
71 assert(std::next(m.begin())->first == 3); in main()
73 assert(std::next(m.begin(), 2)->first == 5); in main()
[all …]
|
| /llvm-project/llvm/test/Transforms/LoopFusion/ |
| H A D | peel.ll | 5 ; The first three iterations of the first loop should be peeled, and then the
21 ; CHECK-NEXT: for.first.preheader:
22 ; CHECK-NEXT: br label %for.first.peel.begin
23 ; CHECK: for.first.peel.begin:
24 ; CHECK-NEXT: br label %for.first.peel
25 ; CHECK: for.first.peel:
26 ; CHECK: br label %for.first.latch.peel
27 ; CHECK: for.first.latch.peel:
28 ; CHECK: br label %for.first.peel.next
29 ; CHECK: for.first.peel.next:
[all …]
|
| H A D | guarded_peel.ll | 4 ; different trip counts. The first two iterations of the first loop should be
11 ; CHECK: br i1 %cmp4, label %for.first.entry, label %for.end
12 ; CHECK: for.first.entry
13 ; CHECK-NEXT: br label %for.first.peel.begin
14 ; CHECK: for.first.peel.begin:
15 ; CHECK-NEXT: br label %for.first.peel
16 ; CHECK: for.first.peel:
17 ; CHECK: br label %for.first.peel.next
18 ; CHECK: for.first.peel.next:
19 ; CHECK-NEXT: br label %for.first.peel2
[all …]
|
| /llvm-project/clang/test/Sema/ |
| H A D | loop-control.c | 5 int first = 1; in pr8880_1() local
6 for ( ; ({ if (first) { first = 0; continue; } 0; }); ) in pr8880_1()
11 void pr8880_2(int first) { in pr8880_2() argument
12 for ( ; ({ if (first) { first = 0; break; } 0; }); ) {} in pr8880_2()
15 void pr8880_3(int first) { in pr8880_3() argument
16 for ( ; ; (void)({ if (first) { first = 0; continue; } 0; })) {} in pr8880_3()
19 void pr8880_4(int first) { in pr8880_4() argument
20 for ( ; ; (void)({ if (first) { first = 0; break; } 0; })) {} in pr8880_4()
23 void pr8880_5 (int first) { in pr8880_5() argument
24 while(({ if (first) { first = 0; continue; } 0; })) {} in pr8880_5()
[all …]
|
| /llvm-project/libcxx/test/std/containers/associative/map/map.ops/ |
| H A D | equal_range.pass.cpp | 44 assert(r.first == std::next(m.begin(), 0)); in main()
47 assert(r.first == std::next(m.begin(), 1)); in main()
50 assert(r.first == std::next(m.begin(), 2)); in main()
53 assert(r.first == std::next(m.begin(), 3)); in main()
56 assert(r.first == std::next(m.begin(), 4)); in main()
59 assert(r.first == std::next(m.begin(), 5)); in main()
62 assert(r.first == std::next(m.begin(), 6)); in main()
65 assert(r.first == std::next(m.begin(), 7)); in main()
68 assert(r.first == std::next(m.begin(), 0)); in main()
71 assert(r.first == std::next(m.begin(), 1)); in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| H A D | erase_iter.pass.cpp | 52 assert(m.begin()->first == 1); in main()
54 assert(std::next(m.begin())->first == 1); in main()
56 assert(std::next(m.begin(), 2)->first == 1); in main()
58 assert(std::next(m.begin(), 3)->first == 2); in main()
60 assert(std::next(m.begin(), 4)->first == 2); in main()
62 assert(std::next(m.begin(), 5)->first == 3); in main()
64 assert(std::next(m.begin(), 6)->first == 3); in main()
66 assert(std::next(m.begin(), 7)->first == 3); in main()
72 assert(std::next(m.begin(), 0)->first == 1); in main()
74 assert(std::next(m.begin(), 1)->first == 1); in main()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.multimap/ |
| H A D | key_eq.pass.cpp | 33 assert(cm.key_eq()(i1->first, i1->first)); in main()
34 assert(cm.key_eq()(i2->first, i2->first)); in main()
35 assert(cm.key_eq()(i3->first, i3->first)); in main()
37 assert(cm.key_eq()(i1->first, i2->first)); in main()
38 assert(cm.key_eq()(i2->first, i1->first)); in main()
40 assert(!cm.key_eq()(i1->first, i3->first)); in main()
41 assert(!cm.key_eq()(i3->first, i1->first)); in main()
43 assert(!cm.key_eq()(i2->first, i3->first)); in main()
44 assert(!cm.key_eq()(i3->first, i2->first)); in main()
|
| /llvm-project/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| H A D | erase_key.pass.cpp | 62 assert(std::distance(eq.first, eq.second) == 2); in main()
68 assert(std::distance(eq.first, eq.second) == 2); in main()
73 assert(std::distance(eq.first, eq.second) == 1); in main()
74 C::const_iterator k = eq.first; in main()
75 assert(k->first == 3); in main()
78 assert(std::distance(eq.first, eq.second) == 1); in main()
79 k = eq.first; in main()
80 assert(k->first == 4); in main()
88 assert(std::distance(eq.first, eq.second) == 2); in main()
93 assert(std::distance(eq.first, eq.second) == 1); in main()
[all …]
|
| /llvm-project/libcxx/test/std/ranges/range.utility/range.subrange/ |
| H A D | structured_bindings.pass.cpp | 25 auto [first, last] = r; in test_sized_subrange()
26 assert(first == a); in test_sized_subrange()
30 auto [first, last] = std::move(r); in test_sized_subrange()
31 assert(first == a); in test_sized_subrange()
35 auto [first, last] = std::as_const(r); in test_sized_subrange()
36 assert(first == a); in test_sized_subrange()
40 auto [first, last] = std::move(std::as_const(r)); in test_sized_subrange()
41 assert(first == a); in test_sized_subrange()
52 auto [first, last] = r; in test_unsized_subrange()
53 assert(first == a); in test_unsized_subrange()
[all …]
|
| /llvm-project/libcxx/test/std/containers/unord/unord.map/ |
| H A D | key_eq.pass.cpp | 30 assert(cm.key_eq()(p1.first->first, p1.first->first)); in main()
31 assert(cm.key_eq()(p2.first->first, p2.first->first)); in main()
32 assert(!cm.key_eq()(p1.first->first, p2.first->first)); in main()
33 assert(!cm.key_eq()(p2.first->first, p1.first->first)); in main()
|
| /llvm-project/libcxx/test/std/containers/associative/set/ |
| H A D | equal_range.pass.cpp | 43 assert(r.first == std::next(m.begin(), 0)); in main()
46 assert(r.first == std::next(m.begin(), 1)); in main()
49 assert(r.first == std::next(m.begin(), 2)); in main()
52 assert(r.first == std::next(m.begin(), 3)); in main()
55 assert(r.first == std::next(m.begin(), 4)); in main()
58 assert(r.first == std::next(m.begin(), 5)); in main()
61 assert(r.first == std::next(m.begin(), 6)); in main()
64 assert(r.first == std::next(m.begin(), 7)); in main()
67 assert(r.first == std::next(m.begin(), 0)); in main()
70 assert(r.first == std::next(m.begin(), 1)); in main()
[all …]
|
| /llvm-project/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.distance/ |
| H A D | iterator_sentinel.pass.cpp | 13 // constexpr iter_difference_t<I> ranges::distance(I first, S last);
16 // constexpr iter_difference_t<I> ranges::distance(I&& first, S last); // TODO: update when LWG3664 is resolved
29 It first = It(a); in test_unsized() local
31 assert(std::ranges::distance(first, last) == 0); in test_unsized()
33 assert(std::ranges::distance(first, Sent(It(a))) == 0); in test_unsized()
39 It first = It(a); in test_unsized()
41 assert(std::ranges::distance(static_cast<ItQual>(first), static_cast<SentQual>(last)) == 3); in test_unsized()
70 It first = It(a + 3); in test_sized()
72 assert(std::ranges::distance(static_cast<ItQual>(first), static_cast<SentQual>(last)) == -3); in test_sized()
94 It first in test_sized()
38 It first = It(a); test_unsized() local
67 It first = It(a + 3); test_sized() local
90 It first = It(a); test_sized() local
99 It first = It(a); test_sized() local
145 StrideCounter first(a, &inc); test_stride_counting() local
154 SizedStrideCounter first(a, &minus); test_stride_counting() local
[all...] |
| /llvm-project/llvm/unittests/XRay/ |
| H A D | GraphTest.cpp | 77 [&](const VVT &VV) { return VV.first == u; })); in graphVertexTester()
82 EXPECT_EQ(1u, V.count(VVT.first)); in graphVertexTester()
83 EXPECT_EQ(VA[VVT.first], VVT.second.VA); in graphVertexTester()
100 EXPECT_EQ(VA[u.first] * VA[u.second] * ((u.first > u.second) ? 2 : 1), in graphEdgeTester()
102 auto Pred = [&](const EVT &EV) { return EV.first == u; }; in graphEdgeTester()
109 EXPECT_EQ(1u, E.count(EV.first)); in graphEdgeTester()
110 EXPECT_EQ(VA[EV.first.first] * VA[EV.first.second] * in graphEdgeTester()
111 ((EV.first.first > EV.first.second) ? 2 : 1), in graphEdgeTester()
113 const auto &IE = G.inEdges(EV.first.second); in graphEdgeTester()
114 const auto &OE = G.outEdges(EV.first.first); in graphEdgeTester()
[all …]
|
| /llvm-project/libcxx/test/std/re/re.alg/re.alg.search/ |
| H A D | ecma.pass.cpp | 33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
36 assert(m.suffix().first == m[0].second); in main()
48 assert(m.prefix().first == s); in main()
49 assert(m.prefix().second == m[0].first); in main()
51 assert(m.suffix().first == m[0].second); in main()
70 assert(m.prefix().first == s); in main()
71 assert(m.prefix().second == m[0].first); in main()
73 assert(m.suffix().first == m[0].second); in main()
92 assert(m.prefix().first == s); in main()
[all …]
|
| H A D | extended.pass.cpp | 33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
36 assert(m.suffix().first == m[0].second); in main()
48 assert(m.prefix().first == s); in main()
49 assert(m.prefix().second == m[0].first); in main()
51 assert(m.suffix().first == m[0].second); in main()
70 assert(m.prefix().first == s); in main()
71 assert(m.prefix().second == m[0].first); in main()
73 assert(m.suffix().first == m[0].second); in main()
92 assert(m.prefix().first == s); in main()
[all …]
|
| H A D | awk.pass.cpp | 33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
36 assert(m.suffix().first == m[0].second); in main()
48 assert(m.prefix().first == s); in main()
49 assert(m.prefix().second == m[0].first); in main()
51 assert(m.suffix().first == m[0].second); in main()
70 assert(m.prefix().first == s); in main()
71 assert(m.prefix().second == m[0].first); in main()
73 assert(m.suffix().first == m[0].second); in main()
92 assert(m.prefix().first == s); in main()
[all …]
|
| /llvm-project/libcxx/test/libcxx/algorithms/alg.modifying.operations/ |
| H A D | copy_move_trivial.pass.cpp | 165 test_one<InIter, SentWrapper, OutIter>([](auto first, auto last, auto out, std::size_t) { in test_copy_and_move() argument
166 std::copy(first, last, out); in test_copy_and_move()
168 test_one<InIter, SentWrapper, OutIter>([](auto first, auto last, auto out, std::size_t n) { in test_copy_and_move() argument
169 std::copy_backward(first, last, out + n); in test_copy_and_move()
171 test_one<InIter, SentWrapper, OutIter>([](auto first, auto, auto out, std::size_t n) { in test_copy_and_move() argument
172 std::copy_n(first, n, out); in test_copy_and_move()
174 test_one<InIter, SentWrapper, OutIter>([](auto first, auto last, auto out, std::size_t) { in test_copy_and_move() argument
175 std::move(first, last, out); in test_copy_and_move()
177 test_one<InIter, SentWrapper, OutIter>([](auto first, auto last, auto out, std::size_t n) { in test_copy_and_move() argument
178 std::move_backward(first, last, out + n); in test_copy_and_move()
[all …]
|