| /llvm-project-15.0.7/clang/test/Index/ |
| H A D | recursive-member-access.c | 7 return ((((((s->first)->first) in test_rdar8650865()
8 ->first) in test_rdar8650865()
9 ->first) in test_rdar8650865()
10 ->first) in test_rdar8650865()
12 ->first in test_rdar8650865()
13 ->first in test_rdar8650865()
14 ->first in test_rdar8650865()
15 ->first in test_rdar8650865()
16 ->first in test_rdar8650865()
17 ->first in test_rdar8650865()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 41 Holder<Incomplete> **first = t.data; in all_the_algorithms() local
62 (void)std::copy(first, last, first2); in all_the_algorithms()
67 (void)std::distance(first, last); in all_the_algorithms()
76 (void)std::fill(first, last, value); in all_the_algorithms()
78 (void)std::find(first, last, value); in all_the_algorithms()
91 (void)std::is_heap(first, last); in all_the_algorithms()
102 (void)std::is_sorted(first, last); in all_the_algorithms()
114 (void)std::make_heap(first, last); in all_the_algorithms()
164 (void)std::pop_heap(first, last); in all_the_algorithms()
168 (void)std::push_heap(first, last); in all_the_algorithms()
[all …]
|
| H A D | robust_re_difference_type.compile.pass.cpp | 104 (void)std::distance(first, last); in all_the_algorithms()
128 (void)std::is_heap(first, last); in all_the_algorithms()
139 (void)std::is_sorted(first, last); in all_the_algorithms()
145 (void)std::iter_swap(first, mid); in all_the_algorithms()
151 (void)std::make_heap(first, last); in all_the_algorithms()
199 (void)std::pop_heap(first, last); in all_the_algorithms()
203 (void)std::push_heap(first, last); in all_the_algorithms()
213 (void)std::reverse(first, last); in all_the_algorithms()
233 (void)std::sort(first, last); in all_the_algorithms()
235 (void)std::sort_heap(first, last); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/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()
44 assert(r.first->first == 3.5); in main()
50 assert(r.first->first == 4.5); in main()
56 assert(r.first->first == 5.5); in main()
67 assert(r.first->first == 3); in main()
73 assert(r.first->first == 3); in main()
79 assert(r.first->first == 4); in main()
85 assert(r.first->first == 5); in main()
127 assert(r.first->first == 3); in main()
133 assert(r.first->first == 3); in main()
[all …]
|
| H A D | emplace.pass.cpp | 37 assert(r.first->first == 3); in main()
38 assert(r.first->second == Emplaceable()); in main()
43 assert(r.first->first == 4); in main()
44 assert(r.first->second == Emplaceable(5, 6)); in main()
50 assert(r.first->first == 5); in main()
51 assert(r.first->second == Emplaceable(6, 7)); in main()
62 assert(r.first->first == 3); in main()
63 assert(r.first->second == Emplaceable()); in main()
68 assert(r.first->first == 4); in main()
69 assert(r.first->second == Emplaceable(5, 6)); in main()
[all …]
|
| /llvm-project-15.0.7/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()
51 assert(r.first->first == 3); in do_insert_rv_test()
58 assert(r.first->first == 3); in do_insert_rv_test()
82 assert(r.first->first == 2); in main()
89 assert(r.first->first == 1); in main()
96 assert(r.first->first == 3); in main()
[all …]
|
| H A D | erase_key.pass.cpp | 43 assert(m.begin()->first == 1); in main()
63 assert(m.begin()->first == 1); in main()
81 assert(m.begin()->first == 2); in main()
97 assert(m.begin()->first == 2); in main()
111 assert(m.begin()->first == 2); in main()
123 assert(m.begin()->first == 2); in main()
133 assert(m.begin()->first == 2); in main()
141 assert(m.begin()->first == 5); in main()
169 assert(m.begin()->first == 1); in main()
189 assert(m.begin()->first == 1); in main()
[all …]
|
| H A D | erase_iter.pass.cpp | 51 assert(m.begin()->first == 1); in main()
69 assert(m.begin()->first == 2); in main()
85 assert(m.begin()->first == 2); in main()
99 assert(m.begin()->first == 2); in main()
111 assert(m.begin()->first == 2); in main()
121 assert(m.begin()->first == 2); in main()
129 assert(m.begin()->first == 5); in main()
158 assert(m.begin()->first == 1); in main()
176 assert(m.begin()->first == 2); in main()
192 assert(m.begin()->first == 2); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_copying_comparators.pass.cpp | 96 T *first = a; in all_the_algorithms() local
133 (void)std::is_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
140 (void)std::is_sorted(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
148 (void)std::make_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
179 (void)std::pop_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
181 (void)std::push_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
192 (void)std::sort(first, first+3, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
193 (void)std::sort(first, first+4, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
194 (void)std::sort(first, first+5, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
195 (void)std::sort(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopFusion/ |
| H A D | peel.ll | 5 ; The first three iterations of the first loop should be peeled, and then the
25 ; CHECK: for.first.peel:
31 ; CHECK: for.first.peel2:
47 ; CHECK: for.first:
49 ; CHECK: for.first.latch:
59 for.first.preheader:
60 br label %for.first
62 for.first: ; preds = %for.first.preheader, %for.first.latch
63 %.014 = phi i32 [ 0, %for.first.preheader ], [ %tmp15, %for.first.latch ]
73 br label %for.first.latch
[all …]
|
| H A D | guarded_peel.ll | 4 ; different trip counts. The first two iterations of the first loop should be
12 ; CHECK: for.first.entry
16 ; CHECK: for.first.peel:
18 ; CHECK: for.first.peel.next:
20 ; CHECK: for.first.peel2:
28 ; CHECK: for.first:
41 br label %for.first
43 for.first: ; preds = %for.first.entry, %for.first
44 %i.05 = phi i64 [ %inc, %for.first ], [ 0, %for.first.entry ]
54 br i1 %cmp, label %for.first, label %for.first.exit
[all …]
|
| H A D | guarded.ll | 83 for.first.guard:
90 for.first:
96 br i1 %cmp.i, label %for.first, label %for.first.exit
98 for.first.exit:
146 for.first:
152 br i1 %cmp, label %for.first, label %for.first.exit
154 for.first.exit:
203 for.first:
209 br i1 %cmp, label %for.first, label %for.first.exit
262 for.first:
[all …]
|
| /llvm-project-15.0.7/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()
20 for ( ; ; (void)({ if (first) { first = 0; break; } 0; })) {} in pr8880_4()
24 while(({ if (first) { first = 0; continue; } 0; })) {} in pr8880_5()
28 while(({ if (first) { first = 0; break; } 0; })) {} in pr8880_6()
32 do {} while(({ if (first) { first = 0; continue; } 0; })); in pr8880_7()
[all …]
|
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | MapVectorTest.cpp | 22 EXPECT_EQ(R.first->first, 1); in TEST()
47 EXPECT_EQ(R.first->first, 1); in TEST()
53 EXPECT_EQ(R.first->first, 1); in TEST()
59 EXPECT_EQ(R.first->first, 4); in TEST()
73 EXPECT_EQ(R.first->first, 4); in TEST()
178 EXPECT_EQ(R.first->first, 1); in TYPED_TEST()
185 EXPECT_EQ(R.first->first, 1); in TYPED_TEST()
204 EXPECT_EQ(R.first->first, 1); in TEST()
210 EXPECT_EQ(R.first->first, 1); in TEST()
216 EXPECT_EQ(R.first->first, 4); in TEST()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.utility/range.subrange/ |
| H A D | structured_bindings.pass.cpp | 26 auto [first, last] = r; in test_sized_subrange()
27 assert(first == a); in test_sized_subrange()
32 assert(first == a); in test_sized_subrange()
37 assert(first == a); in test_sized_subrange()
42 assert(first == a); in test_sized_subrange()
54 assert(first == a); in test_unsized_subrange()
59 assert(first == a); in test_unsized_subrange()
64 assert(first == a); in test_unsized_subrange()
69 assert(first == a); in test_unsized_subrange()
82 first = a+2; in test_copies_not_originals()
[all …]
|
| /llvm-project-15.0.7/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()
319 assert(r.first == std::next(m.begin(), 0)); in main()
322 assert(r.first == std::next(m.begin(), 1)); in main()
325 assert(r.first == std::next(m.begin(), 2)); in main()
328 assert(r.first == std::next(m.begin(), 3)); in main()
[all …]
|
| /llvm-project-15.0.7/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()
180 assert(m.begin()->first == 1); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| H A D | erase_key.pass.cpp | 79 k = eq.first; in main()
94 k = eq.first; in main()
99 k = eq.first; in main()
114 k = eq.first; in main()
119 k = eq.first; in main()
134 k = eq.first; in main()
149 k = eq.first; in main()
159 k = eq.first; in main()
169 k = eq.first; in main()
225 k = eq.first; in main()
[all …]
|
| /llvm-project-15.0.7/llvm/unittests/XRay/ |
| H A D | GraphTest.cpp | 100 EXPECT_EQ(VA[u.first] * VA[u.second] * ((u.first > u.second) ? 2 : 1), 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()
114 const auto &OE = G.outEdges(EV.first.first); in graphEdgeTester()
122 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(), in graphEdgeTester()
128 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
129 EXPECT_EQ(G.inEdges(EV.first.first).end(), It); in graphEdgeTester()
140 G.outEdges(EV.first.first).begin(), G.outEdges(EV.first.first).end(), in graphEdgeTester()
141 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.distance/ |
| H A D | iterator_sentinel.pass.cpp | 30 It first = It(a); in test_unsized() local
32 assert(std::ranges::distance(first, last) == 0); in test_unsized()
39 It first = It(a); in test_unsized() local
41 assert(std::ranges::distance(first, last) == 3); in test_unsized()
68 It first = It(a + 3); in test_sized() local
70 assert(std::ranges::distance(first, last) == -3); in test_sized()
91 It first = It(a); in test_sized() local
93 assert(std::ranges::distance(first, last) == 0); in test_sized()
100 It first = It(a); in test_sized() local
143 StrideCounter first(a, &inc); in test_stride_counting() local
[all …]
|
| /llvm-project-15.0.7/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()
179 assert(r.first == std::next(m.begin(), 0)); in main()
182 assert(r.first == std::next(m.begin(), 1)); in main()
185 assert(r.first == std::next(m.begin(), 2)); in main()
188 assert(r.first == std::next(m.begin(), 3)); in main()
191 assert(r.first == std::next(m.begin(), 4)); in main()
194 assert(r.first == std::next(m.begin(), 5)); in main()
197 assert(r.first == std::next(m.begin(), 6)); in main()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/ |
| H A D | fill.pass.cpp | 25 check(It first, It last, const T& value) in check()
27 for (; first != last; ++first) in check()
28 if (*first != value) in check()
39 fill(exec, first, last, value); in operator ()()
40 EXPECT_TRUE(check(first, last, value), "fill wrong result"); in operator ()()
48 check(It first, Size n, const T& value) in check()
50 for (Size i = 0; i < n; ++i, ++first) in check()
51 if (*first != value) in check()
63 const Iterator expected_return = std::next(first, n); in operator ()()
66 EXPECT_TRUE(check(first, n, value), "fill_n wrong result"); in operator ()()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/ |
| H A D | equal_range_non_const.pass.cpp | 45 assert(*r.first == 30); in main()
50 assert(*r.first == 50); in main()
51 ++r.first; in main()
52 assert(*r.first == 50); in main()
53 ++r.first; in main()
54 assert(*r.first == 50); in main()
78 assert(*r.first == 30); in main()
83 assert(*r.first == 50); in main()
84 ++r.first; in main()
85 assert(*r.first == 50); in main()
[all …]
|
| H A D | equal_range_const.pass.cpp | 45 assert(*r.first == 30); in main()
50 assert(*r.first == 50); in main()
51 ++r.first; in main()
52 assert(*r.first == 50); in main()
53 ++r.first; in main()
54 assert(*r.first == 50); in main()
78 assert(*r.first == 30); in main()
83 assert(*r.first == 50); in main()
84 ++r.first; in main()
85 assert(*r.first == 50); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/re/re.alg/re.alg.search/ |
| H A D | ecma.pass.cpp | 33 assert(m.prefix().first == s); in main()
48 assert(m.prefix().first == s); in main()
70 assert(m.prefix().first == s); in main()
92 assert(m.prefix().first == s); in main()
107 assert(m.prefix().first == s); in main()
122 assert(m.prefix().first == s); in main()
140 assert(m.prefix().first == s); in main()
161 assert(m.prefix().first == s); in main()
176 assert(m.prefix().first == s); in main()
197 assert(m.prefix().first == s); in main()
[all …]
|