| /llvm-project-15.0.7/lldb/unittests/Utility/ |
| H A D | VMRangeTest.cpp | 43 VMRange range2(0x100, 0x200); in TEST() local 44 EXPECT_EQ(range1, range2); in TEST() 51 range2.Clear(); in TEST() 52 EXPECT_NE(range1, range2); in TEST() 114 VMRange range2(0x100, 0x1FF); in TEST() local 120 EXPECT_LT(range1, range2); in TEST() 121 EXPECT_LT(range2, range3); in TEST() 123 EXPECT_GT(range2, range1); in TEST() 124 EXPECT_GT(range3, range2); in TEST() 128 EXPECT_FALSE(range2 < range2); in TEST() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| H A D | ranges.search.pass.cpp | 52 concept HasSearchR = requires (Range1 range1, Range2 range2) { 53 std::ranges::search(range1, range2); 102 auto ret = std::ranges::search(range1, range2); in test_iterators() 121 auto ret = std::ranges::search(range1, range2); in test_iterators() 140 auto ret = std::ranges::search(range1, range2); in test_iterators() 159 auto ret = std::ranges::search(range1, range2); in test_iterators() 178 auto ret = std::ranges::search(range1, range2); in test_iterators() 197 auto ret = std::ranges::search(range1, range2); in test_iterators() 216 auto ret = std::ranges::search(range1, range2); in test_iterators() 235 auto ret = std::ranges::search(range1, range2); in test_iterators() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | ranges.find_end.pass.cpp | 51 concept HasFindEndR = requires (Range1 range1, Range2 range2) { 52 std::ranges::find_end(range1, range2); 101 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 120 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 139 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 158 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 177 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 196 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 215 auto ret = std::ranges::find_end(range1, range2); in test_iterators() 234 auto ret = std::ranges::find_end(range1, range2); in test_iterators() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| H A D | ranges.equal.pass.cpp | 55 concept HasEqualR = requires (Range1 range1, Range2 range2) { 56 std::ranges::equal(range1, range2); 86 auto range2 = std::ranges::subrange(Iter2(b), Sent2(Iter2(b + 4))); in test_iterators() local 145 range2, in test_iterators() 165 auto ret = std::ranges::equal(range1, range2); in test_iterators() 182 auto ret = std::ranges::equal(range1, range2); in test_iterators() 198 auto range2 = std::ranges::subrange(Iter2(b), Sent2(Iter2(b))); in test_iterators() local 199 auto ret = std::ranges::equal(range1, range2); in test_iterators() 216 auto ret = std::ranges::equal(range1, range2); in test_iterators() 232 auto range2 = std::ranges::subrange(Iter2(b), Sent2(Iter2(b))); in test_iterators() local [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.all/range.ref.view/ |
| H A D | range.ref.view.pass.cpp | 129 ForwardRange range2; in test() local 130 std::ranges::ref_view<ForwardRange> view2 = range2; in test() 148 ForwardRange range2; in test() local 149 std::ranges::ref_view<ForwardRange> view2 = range2; in test() 167 ForwardRange range2; in test() local 168 std::ranges::ref_view<ForwardRange> view2 = range2; in test() 181 Range range2{2}; in test() local 182 std::ranges::ref_view<Range> view2 = range2; in test() 194 Range range2{2}; in test() local 195 std::ranges::ref_view<Range> view2 = range2; in test()
|
| /llvm-project-15.0.7/clang/test/Driver/ |
| H A D | check-time-trace-sections.py | 5 def is_inside(range1, range2): argument 7 c = range2["ts"]; d = c + range2["dur"] 10 def is_before(range1, range2): argument 11 b = range1["ts"] + range1["dur"]; c = range2["ts"]
|
| /llvm-project-15.0.7/llvm/unittests/Support/ |
| H A D | IndexedAccessorTest.cpp | 56 ArrayIndexedAccessorRange<uint64_t> range2(rawData2, /*start=*/0, in TEST() local 58 EXPECT_TRUE(range1 == range2); in TEST() 59 EXPECT_FALSE(range1 != range2); in TEST() 60 EXPECT_TRUE(range2 == range1); in TEST() 61 EXPECT_FALSE(range2 != range1); in TEST()
|
| H A D | ParallelTest.cpp | 77 uint32_t range2[3060]; in TEST() local 78 std::fill(std::begin(range2), std::end(range2), 1); in TEST() 79 sum = parallelTransformReduce(range2, 0U, std::plus<uint32_t>(), identity); in TEST()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| H A D | ranges.transform.pass.cpp | 166 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b + 5))); in test_iterators() local 169 range1, range2, Out(c), [](int i, int j) { return i + j; }); in test_iterators() 219 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b + 5))); in test_iterators() local 250 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b))); in test_iterators() local 252 auto ret = std::ranges::transform(range1, range2, Out(c), [](int i, int j) { return i + j; }); in test_iterators() 280 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b))); in test_iterators() local 282 auto ret = std::ranges::transform(range1, range2, Out(c), [](int i, int j) { return i + j; }); in test_iterators() 333 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b + 5))); in test_iterators() local 366 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b + 1))); in test_iterators() local 433 auto range2 = std::ranges::subrange(In2(b), Sent2(In2(b + 4))); in test_iterators() local [all …]
|
| /llvm-project-15.0.7/clang/tools/libclang/ |
| H A D | CXSourceLocation.cpp | 75 unsigned clang_equalRanges(CXSourceRange range1, CXSourceRange range2) { in clang_equalRanges() argument 76 return range1.ptr_data[0] == range2.ptr_data[0] in clang_equalRanges() 77 && range1.ptr_data[1] == range2.ptr_data[1] in clang_equalRanges() 78 && range1.begin_int_data == range2.begin_int_data in clang_equalRanges() 79 && range1.end_int_data == range2.end_int_data; in clang_equalRanges()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | ranges.lexicographical_compare.pass.cpp | 44 concept HasLexicographicalCompareR = requires(Range1 range1, Range2 range2) { 45 std::ranges::lexicographical_compare(range1, range2); 91 …auto range2 = std::ranges::subrange(Iter2(d.input2.data()), Sent2(Iter2(d.input2.data() + d.input2… in test() local 93 std::ranges::lexicographical_compare(range1, range2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | ranges.is_permutation.pass.cpp | 46 concept HasIsPermutationR = requires(Range1 range1, Range2 range2) { 47 std::ranges::is_permutation(range1, range2); 92 auto range2 = std::ranges::subrange(Iter1(d.input2.data()), Sent1(Iter1(d.input2.data() + M))); in test() local 93 std::same_as<bool> decltype(auto) ret = std::ranges::is_permutation(range1, range2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| H A D | ranges.find_first_of.pass.cpp | 55 concept HasFindFirstOfR = requires(Range1 range1, Range2 range2) { 56 std::ranges::find_first_of(range1, range2); 88 …auto range2 = std::ranges::subrange(Iter2(d.input2.data()), Sent2(Iter2(d.input2.data() + d.input2… in test() local 89 std::same_as<Iter1> decltype(auto) ret = std::ranges::find_first_of(range1, range2); in test()
|
| /llvm-project-15.0.7/mlir/test/Transforms/ |
| H A D | parametric-tiling.mlir | 29 // TILE_74-NEXT: %[[range2:.*]] = arith.divsi %[[diff2_adj]], %c2 32 // TILE_74: %[[sum2:.*]] = arith.addi %[[range2]], %c3 98 // TILE_74-NEXT: %[[range2:.*]] = arith.divsi %[[diff2_adj]], %c2 101 // TILE_74: %[[sum2:.*]] = arith.addi %[[range2]], %c3
|
| /llvm-project-15.0.7/clang/bindings/python/tests/cindex/ |
| H A D | test_location.py | 100 range2 = SourceRange.from_locations(location1, location2) 101 self.assertEqual(range1, range2)
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| H A D | ranges_includes.pass.cpp | 83 requires(Range1&& range1, Range2&& range2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) { 86 std::forward<Range2>(range2),
|
| /llvm-project-15.0.7/clang/test/CodeGen/ |
| H A D | struct.c | 80 range range2; member
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| H A D | ranges_partial_sort_copy.pass.cpp | 96 requires(Range1&& range1, Range2&& range2, Comp&& comp) { 97 std::ranges::partial_sort_copy(std::forward<Range1>(range1), std::forward<Range2>(range2),
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | ranges_set_symmetric_difference.pass.cpp | 76 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) { 78 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | ranges_set_union.pass.cpp | 79 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) { 81 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | ranges_set_difference.pass.cpp | 82 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) { 84 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | ranges_set_intersection.pass.cpp | 76 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) { 78 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | ranges_merge.pass.cpp | 81 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) { 82 …std::ranges::merge(std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIte…
|
| /llvm-project-15.0.7/mlir/test/Dialect/Affine/ |
| H A D | loop-coalescing.mlir | 141 // CHECK: %[[range2:.*]] = arith.subi %[[orig_ub2]], %[[orig_lb2]] 143 // CHECK: %[[dividend2:.*]] = arith.addi %[[range2]], %[[orig_step2_minus_1]]
|
| /llvm-project-15.0.7/clang/include/clang-c/ |
| H A D | Index.h | 533 CXSourceRange range2);
|