| /llvm-project-15.0.7/compiler-rt/test/asan/TestCases/ |
| H A D | contiguous_container.cpp | 14 char *mid = beg + capacity; in TestContainer() local
20 old_mid = mid; in TestContainer()
21 mid = beg + size; in TestContainer()
22 __sanitizer_annotate_contiguous_container(beg, end, old_mid, mid); in TestContainer()
28 assert(__sanitizer_verify_contiguous_container(beg, mid, end)); in TestContainer()
31 if (mid != beg) { in TestContainer()
34 beg, mid - 1, end)); in TestContainer()
36 if (mid != end) { in TestContainer()
38 assert(mid == __sanitizer_contiguous_container_find_bad_address( in TestContainer()
39 beg, mid + 1, end)); in TestContainer()
[all …]
|
| /llvm-project-15.0.7/mlir/test/Dialect/SPIRV/Transforms/ |
| H A D | gl-canonicalize.mlir | 8 %mid = spv.Select %0, %input, %min : i1, f32
9 %1 = spv.FOrdLessThan %mid, %max : f32
10 %2 = spv.Select %1, %mid, %max : i1, f32
23 %mid = spv.Select %0, %min, %input : i1, f32
25 %2 = spv.Select %1, %max, %mid : i1, f32
40 %2 = spv.Select %1, %mid, %max : i1, f32
55 %2 = spv.Select %1, %max, %mid : i1, f32
69 %1 = spv.SLessThan %mid, %max : si32
70 %2 = spv.Select %1, %mid, %max : i1, si32
129 %1 = spv.ULessThan %mid, %max : i32
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_re_difference_type.compile.pass.cpp | 161 (void)std::merge(first, mid, mid, last, first2); in all_the_algorithms()
162 (void)std::merge(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
221 (void)std::set_difference(first, mid, mid, last, first2); in all_the_algorithms()
222 (void)std::set_difference(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
223 (void)std::set_intersection(first, mid, mid, last, first2); in all_the_algorithms()
224 (void)std::set_intersection(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
225 (void)std::set_symmetric_difference(first, mid, mid, last, first2); in all_the_algorithms()
226 (void)std::set_symmetric_difference(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
227 (void)std::set_union(first, mid, mid, last, first2); in all_the_algorithms()
228 (void)std::set_union(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
[all …]
|
| H A D | robust_against_adl.compile.pass.cpp | 124 (void)std::merge(first, mid, mid, last, first2); in all_the_algorithms()
125 (void)std::merge(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
186 (void)std::set_difference(first, mid, mid, last, first2); in all_the_algorithms()
187 (void)std::set_difference(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
188 (void)std::set_intersection(first, mid, mid, last, first2); in all_the_algorithms()
189 (void)std::set_intersection(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
190 (void)std::set_symmetric_difference(first, mid, mid, last, first2); in all_the_algorithms()
191 (void)std::set_symmetric_difference(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
192 (void)std::set_union(first, mid, mid, last, first2); in all_the_algorithms()
193 (void)std::set_union(first, mid, mid, last, first2, std::less<void*>()); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 46 constexpr void test_mid(Func&& func, Input& in, std::ranges::iterator_t<Input> mid, Args&& ...args)… in test_mid() argument
47 func(in.begin(), mid, in.end(), std::forward<Args>(args)...); in test_mid()
48 func(in, mid, std::forward<Args>(args)...); in test_mid()
60 auto mid = in.begin() + 1; in run_tests() local
136 test_mid(std::ranges::rotate_copy, in, mid, out); in run_tests()
149 test_mid(std::ranges::rotate, in, mid); in run_tests()
163 test_mid(std::ranges::partial_sort, in, mid); in run_tests()
164 test_mid(std::ranges::nth_element, in, mid); in run_tests()
166 test_mid(std::ranges::inplace_merge, in, mid); in run_tests()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 53 constexpr void test_mid(Func&& func, Input& in, std::ranges::iterator_t<Input> mid, Args&&... args)… in test_mid() argument
54 func(in.begin(), mid, in.end(), std::forward<Args>(args)...); in test_mid()
55 func(in, mid, std::forward<Args>(args)...); in test_mid()
61 auto mid = in.begin() + 1; in test_all() local
134 test_mid(std::ranges::partial_sort, in, mid, binary_pred); in test_all()
135 test_mid(std::ranges::nth_element, in, mid, binary_pred); in test_all()
137 test_mid(std::ranges::inplace_merge, in, mid, binary_pred); in test_all()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | ranges_rotate.pass.cpp | 79 auto mid = Iter(in.data() + mid_index); in test_one() local
82 …:same_as<std::ranges::subrange<Iter>> decltype(auto) result = std::ranges::rotate(begin, mid, end); in test_one()
91 auto mid = Iter(in.data() + mid_index); in test_one() local
95 … std::same_as<std::ranges::subrange<Iter>> decltype(auto) result = std::ranges::rotate(range, mid); in test_one()
163 for (size_t mid = 0; mid != input.size(); ++mid) { in test() local
164 std::ranges::rotate(begin, begin + mid, end); in test()
176 for (size_t mid = 0; mid != input.size(); ++mid) { in test() local
177 std::ranges::rotate(range, begin + mid); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/utility/utility.intcmp/intcmp.in_range/ |
| H A D | in_range.pass.cpp | 29 T mid; member
33 mid = std::midpoint(min, max); in Tuple()
44 assert(std::in_range<T>(tup.mid)); in test_in_range1()
45 assert(std::in_range<T>(tup.mid - 1)); in test_in_range1()
46 assert(std::in_range<T>(tup.mid + 1)); in test_in_range1()
55 assert(std::in_range<int8_t>(utup8.mid)); in test_in_range()
56 assert(!std::in_range<uint8_t>(stup8.mid)); in test_in_range()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/utility/utility.intcmp/intcmp.cmp_greater/ |
| H A D | cmp_greater.pass.cpp | 27 T mid; member
31 mid = std::midpoint(min, max); in Tuple()
41 assert(!std::cmp_greater(tup.min, tup.mid)); in test_cmp_greater1()
42 assert(!std::cmp_greater(tup.mid, tup.max)); in test_cmp_greater1()
46 assert(std::cmp_greater(tup.mid, tup.min)); in test_cmp_greater1()
47 assert(!std::cmp_greater(tup.mid, tup.mid)); in test_cmp_greater1()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/utility/utility.intcmp/intcmp.cmp_less/ |
| H A D | cmp_less.pass.cpp | 28 T mid; member
32 mid = std::midpoint(min, max); in Tuple()
42 assert(std::cmp_less(tup.min, tup.mid)); in test_cmp_less1()
43 assert(std::cmp_less(tup.mid, tup.max)); in test_cmp_less1()
47 assert(!std::cmp_less(tup.mid, tup.min)); in test_cmp_less1()
48 assert(!std::cmp_less(tup.mid, tup.mid)); in test_cmp_less1()
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_sort.c | 58 size_t mid; in msort() local
60 mid = MID (low, high); in msort()
62 if (mid + 1 < high) in msort()
63 msort (array, buf, mid + 1, high, size, compare, arg); in msort()
65 if (mid > low) in msort()
66 msort (array, buf, low, mid, size, compare, arg); in msort()
69 am = ((char *) array) + ((mid + 1) * size); in msort()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/utility/utility.intcmp/intcmp.cmp_less_equal/ |
| H A D | cmp_less_equal.pass.cpp | 27 T mid; member
31 mid = std::midpoint(min, max); in Tuple()
41 assert(std::cmp_less_equal(tup.min, tup.mid)); in test_cmp_less_equal1()
42 assert(std::cmp_less_equal(tup.mid, tup.max)); in test_cmp_less_equal1()
44 assert(std::cmp_less_equal(tup.mid, tup.mid)); in test_cmp_less_equal1()
49 assert(!std::cmp_less_equal(tup.mid, tup.min)); in test_cmp_less_equal1()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/utility/utility.intcmp/intcmp.cmp_greater_equal/ |
| H A D | cmp_greater_equal.pass.cpp | 27 T mid; member
31 mid = std::midpoint(min, max); in Tuple()
41 assert(!std::cmp_greater_equal(tup.min, tup.mid)); in test_cmp_greater_equal1()
42 assert(!std::cmp_greater_equal(tup.mid, tup.max)); in test_cmp_greater_equal1()
46 assert(std::cmp_greater_equal(tup.mid, tup.min)); in test_cmp_greater_equal1()
47 assert(std::cmp_greater_equal(tup.mid, tup.mid)); in test_cmp_greater_equal1()
|
| /llvm-project-15.0.7/llvm/utils/ |
| H A D | rsp_bisect.py | 128 mid = int((lower + upper) / 2)
129 assert lower != mid and mid != upper
130 print('Trying {} ({}-{})'.format(mid, lower, upper))
131 result = test_modified_rsp(test, modify_rsp(rsp_entries, other_rel_path, mid),
134 lower = mid
136 upper = mid
|
| /llvm-project-15.0.7/libc/src/stdlib/ |
| H A D | bsearch.cpp | 24 size_t mid = array_size / 2; variable
26 reinterpret_cast<const uint8_t *>(array) + mid * elem_size;
35 array_size = mid;
39 array_size -= (mid + 1);
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_copying_comparators.pass.cpp | 97 T *mid = a+5; in all_the_algorithms() local
142 …if (!TEST_IS_CONSTANT_EVALUATED) { (void)std::inplace_merge(first, mid, last, Less<T>(&copies)); a… in all_the_algorithms()
154 (void)std::merge(first, mid, mid, last, first2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
173 (void)std::nth_element(first, mid, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
174 (void)std::partial_sort(first, mid, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
188 (void)std::set_difference(first, mid, mid, last, first2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
189 … (void)std::set_intersection(first, mid, mid, last, first2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
190 …(void)std::set_symmetric_difference(first, mid, mid, last, first2, Less<T>(&copies)); assert(copie… in all_the_algorithms()
191 (void)std::set_union(first, mid, mid, last, first2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
200 (void)std::transform(first, mid, mid, first2, BinaryTransform<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 84 void **mid = a+5; in all_the_algorithms() local
154 (void)std::ranges::merge(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
172 (void)std::ranges::nth_element(first, mid, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
173 (void)std::ranges::nth_element(a, mid, Less(&copies)); assert(copies == 0); in all_the_algorithms()
174 (void)std::ranges::partial_sort(first, mid, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
175 (void)std::ranges::partial_sort(a, mid, Less(&copies)); assert(copies == 0); in all_the_algorithms()
202 …(void)std::ranges::set_difference(first, mid, mid, last, first2, Less(&copies)); assert(copies == … in all_the_algorithms()
204 …(void)std::ranges::set_intersection(first, mid, mid, last, first2, Less(&copies)); assert(copies =… in all_the_algorithms()
206 …(void)std::ranges::set_symmetric_difference(first, mid, mid, last, first2, Less(&copies)); assert(… in all_the_algorithms()
208 (void)std::ranges::set_union(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 66 T *mid = a+5; in all_the_algorithms() local
137 …(void)std::ranges::merge(first, mid, mid, last, first2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
155 (void)std::ranges::nth_element(first, mid, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
156 (void)std::ranges::nth_element(a, mid, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
157 (void)std::ranges::partial_sort(first, mid, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
158 (void)std::ranges::partial_sort(a, mid, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
193 …(void)std::ranges::set_difference(first, mid, mid, last, first2, Less(), Proj(&copies), Proj(&copi… in all_the_algorithms()
195 …(void)std::ranges::set_intersection(first, mid, mid, last, first2, Less(), Proj(&copies), Proj(&co… in all_the_algorithms()
197 …(void)std::ranges::set_symmetric_difference(first, mid, mid, last, first2, Less(), Proj(&copies), … in all_the_algorithms()
199 …(void)std::ranges::set_union(first, mid, mid, last, first2, Less(), Proj(&copies), Proj(&copies));… in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/ |
| H A D | tsan_rtl_mutex.cpp | 58 rep.AddMutex(mid); in ReportMutexMisuse()
85 u64 mid = 0; in MutexDestroy() local
107 mid = s->GetId(); in MutexDestroy()
115 rep.AddMutex(mid); in MutexDestroy()
166 u64 mid = 0; in MutexPostLock() local
202 mid = s->GetId(); in MutexPostLock()
216 u64 mid = 0; in MutexUnlock() local
244 mid = s->GetId(); in MutexUnlock()
274 u64 mid = 0; in MutexPostReadLock() local
314 u64 mid = 0; in MutexReadUnlock() local
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | ranges_partial_sort.pass.cpp | 41 concept HasPartialSortIt = requires(Iter first, Iter mid, Sent last, Comp comp) {
42 std::ranges::partial_sort(first, mid, last, comp);
54 concept HasPartialSortR = requires(Range range, std::ranges::iterator_t<Range> mid, Comp comp) {
55 std::ranges::partial_sort(range, mid, comp);
71 auto mid = begin + mid_index; in test_one() local
74 std::same_as<Iter> decltype(auto) last = std::ranges::partial_sort(begin, mid, end); in test_one()
83 auto mid = begin + mid_index; in test_one() local
87 std::same_as<Iter> decltype(auto) last = std::ranges::partial_sort(range, mid); in test_one()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | lea-opt-cse3.ll | 70 ; X64-NEXT: # %bb.1: # %mid
88 ; X86-NEXT: # %bb.1: # %mid
101 br i1 %cmp , label %mid , label %exit
102 mid:
110 %retmul = phi i32 [%mul5 , %mid] , [0 , %entry]
123 ; X64-NEXT: # %bb.1: # %mid
141 ; X86-NEXT: # %bb.1: # %mid
154 br i1 %cmp, label %mid , label %exit
155 mid:
162 %retmul = phi i32 [%mul5 , %mid] , [0 , %entry]
|
| /llvm-project-15.0.7/lld/test/ELF/ |
| H A D | riscv-relax-call2.s | 23 # CHECK-LABEL: <.mid>:
28 # CHECK2-LABEL: <.mid>:
43 .section .mid,"ax",@progbits
55 .mid 0x100800 : { *(.mid) }
|
| /llvm-project-15.0.7/flang/include/flang/Common/ |
| H A D | visit.h | 58 static constexpr std::size_t mid{(HIGH + LOW) / 2}; in Log2VisitHelper()
59 if (which <= mid) { in Log2VisitHelper()
60 return Log2VisitHelper<LOW, mid, RESULT>( in Log2VisitHelper()
63 return Log2VisitHelper<(mid + 1), HIGH, RESULT>( in Log2VisitHelper()
|
| /llvm-project-15.0.7/lld/COFF/ |
| H A D | ICF.cpp | 116 size_t mid = bound - chunks.begin(); in segregate() local
120 for (size_t i = begin; i < mid; ++i) in segregate()
121 chunks[i]->eqClass[(cnt + 1) % 2] = mid; in segregate()
124 if (mid != end) in segregate()
127 begin = mid; in segregate()
211 size_t mid = findBoundary(begin, end); in forEachClassRange() local
212 fn(begin, mid); in forEachClassRange()
213 begin = mid; in forEachClassRange()
|
| /llvm-project-15.0.7/lldb/source/Symbol/ |
| H A D | CompactUnwindInfo.cpp | 395 uint32_t mid = (low + high) / 2; in GetLSDAForFunctionOffset() local
404 low = mid + 1; in GetLSDAForFunctionOffset()
406 high = mid; in GetLSDAForFunctionOffset()
426 uint32_t mid = (low + high) / 2; in BinarySearchRegularSecondPage() local
431 if (mid < last) { in BinarySearchRegularSecondPage()
443 low = mid + 1; in BinarySearchRegularSecondPage()
446 high = mid; in BinarySearchRegularSecondPage()
462 uint32_t mid = (low + high) / 2; in BinarySearchCompressedSecondPage() local
468 if (mid < last) { in BinarySearchCompressedSecondPage()
482 low = mid + 1; in BinarySearchCompressedSecondPage()
[all …]
|