| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | nth_element.pass.cpp | 97 const Iterator1 mid2 = std::next(first2, m); in operator ()() local
101 fill_data(first2, mid2, generator1); in operator ()()
102 fill_data(mid2, last2, generator2); in operator ()()
104 std::nth_element(exec, first2, mid2, last2, comp); in operator ()()
107 EXPECT_TRUE(is_equal(*mid1, *mid2), "wrong result from nth_element with predicate"); in operator ()()
109 …EXPECT_TRUE(std::find_first_of(first2, mid2, mid2, last2, [comp](T& x, T& y) { return comp(y, x); … in operator ()()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 45 Holder<Incomplete> **mid2 = u.data+5; in all_the_algorithms() local
79 (void)std::find_end(first, last, first2, mid2); in all_the_algorithms()
80 (void)std::find_end(first, last, first2, mid2, std::equal_to<void*>()); in all_the_algorithms()
159 (void)std::partial_sort_copy(first, last, first2, mid2); in all_the_algorithms()
160 (void)std::partial_sort_copy(first, last, first2, mid2, std::less<void*>()); in all_the_algorithms()
182 (void)std::search(first, last, first2, mid2); in all_the_algorithms()
183 (void)std::search(first, last, first2, mid2, std::equal_to<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 82 auto mid2 = PickyIterator<void**, long long>(b+5); in all_the_algorithms() local
116 (void)std::find_end(first, last, first2, mid2); in all_the_algorithms()
117 (void)std::find_end(first, last, first2, mid2, std::equal_to<void*>()); in all_the_algorithms()
194 (void)std::partial_sort_copy(first, last, first2, mid2); in all_the_algorithms()
195 (void)std::partial_sort_copy(first, last, first2, mid2, std::less<void*>()); in all_the_algorithms()
217 (void)std::search(first, last, first2, mid2); in all_the_algorithms()
218 (void)std::search(first, last, first2, mid2, std::equal_to<void*>()); in all_the_algorithms()
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.merge/ |
| H A D | inplace_merge.pass.cpp | 51 const BiDirIt1 mid2 = std::next(first2, m); in operator ()() local
52 fill_data(first2, mid2, generator1); in operator ()()
53 fill_data(mid2, last2, generator2); in operator ()()
56 std::inplace_merge(exec, first2, mid2, last2, comp); in operator ()()
|
| /llvm-project-15.0.7/lld/test/ELF/ |
| H A D | riscv-relax-call.s | 55 # NORVC-LABEL: <.mid2>:
96 # RVC-LABEL: <.mid2>:
140 .section .mid2,"ax",@progbits
157 .mid2 mid_end+4 : { *(.mid2) }
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_copying_comparators.pass.cpp | 100 T *mid2 = b+5; in all_the_algorithms() local
122 (void)std::find_end(first, last, first2, mid2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
175 (void)std::partial_sort_copy(first, last, first2, mid2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
186 (void)std::search(first, last, first2, mid2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 87 void **mid2 = b+5; in all_the_algorithms() local
113 (void)std::ranges::find_end(first, last, first2, mid2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
176 …(void)std::ranges::partial_sort_copy(first, last, first2, mid2, Less(&copies)); assert(copies == 0… in all_the_algorithms()
198 (void)std::ranges::search(first, last, first2, mid2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 69 T *mid2 = b+5; in all_the_algorithms() local
99 …(void)std::ranges::find_end(first, last, first2, mid2, Equal(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
159 …(void)std::ranges::partial_sort_copy(first, last, first2, mid2, Less(), Proj(&copies), Proj(&copie… in all_the_algorithms()
189 …(void)std::ranges::search(first, last, first2, mid2, Equal(), Proj(&copies), Proj(&copies)); asser… in all_the_algorithms()
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_rtl_access.cpp | 574 RawShadow* mid2 = RoundDown(end, kPageSize); in MemoryRangeSet() local
575 if (mid2 > mid1) { in MemoryRangeSet()
576 if (!MmapFixedSuperNoReserve((uptr)mid1, (uptr)mid2 - (uptr)mid1)) in MemoryRangeSet()
580 ShadowSet(mid2, end, val); in MemoryRangeSet()
|