Home
last modified time | relevance | path

Searched refs:Range2 (Results 1 – 25 of 25) sorted by relevance

/llvm-project-15.0.7/polly/lib/External/isl/interface/
H A Dtemplate_cpp.cc142 static TupleKindPtr Range2("Range2"); variable
496 { { Domain, Range2 }, { { Domain, Range }, { Range, Range2 } } };
506 { { Domain, Range2 }, { { Domain, Range }, { Range2, Range } } };
518 { { Range2, Range }, { { { Domain2, Range2 }, Range }, { Domain2 } } };
595 { { Domain, { Range2, Range } }, { { Domain, { Range, Range2 } } } };
608 { { Domain, { Range, Range2 } },
620 { { Domain, Range2 }, { { Domain, { Range, Range2 } } } };
625 { { Domain, { Range, Range2 } },
628 { { { Domain, Range }, Range2 },
660 { { Anonymous, Range2 }, { { { Domain, Range }, Range2 } } };
[all …]
/llvm-project-15.0.7/libcxx/test/std/ranges/range.req/range.refinements/
H A Dcommon_range.compile.pass.cpp58 struct Range2 { struct
63 static_assert( std::ranges::common_range<Range2>);
64 static_assert(!std::ranges::common_range<Range2 const>);
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/bugprone/
H A DSuspiciousEnumUsageCheck.cpp59 ValueRange Range1(Enum1), Range2(Enum2); in hasDisjointValueRange() local
60 return llvm::APSInt::compareValues(Range1.MaxVal, Range2.MinVal) < 0 || in hasDisjointValueRange()
61 llvm::APSInt::compareValues(Range2.MaxVal, Range1.MinVal) < 0; in hasDisjointValueRange()
/llvm-project-15.0.7/llvm/unittests/IR/
H A DBasicBlockTest.cpp94 #define CHECK_ITERATORS(Range1, Range2) \ argument
96 std::distance(Range2.begin(), Range2.end())); \
97 for (auto Pair : zip(Range1, Range2)) \
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
H A Dranges_includes.pass.cpp78 class Range2,
83 requires(Range1&& range1, Range2&& range2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
86 std::forward<Range2>(range2),
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dranges_partial_sort_copy.pass.cpp94 template <class Range1 = R<int*>, class Range2 = R<int*>, class Comp = std::ranges::less>
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.lex.comparison/
H A Dranges.lexicographical_compare.pass.cpp43 template <class Range1, class Range2 = UncheckedRange<int*>>
44 concept HasLexicographicalCompareR = requires(Range1 range1, Range2 range2) {
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dranges.is_permutation.pass.cpp45 template <class Range1, class Range2 = UncheckedRange<int*>>
46 concept HasIsPermutationR = requires(Range1 range1, Range2 range2) {
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dranges.find_first_of.pass.cpp54 template <class Range1, class Range2 = UncheckedRange<int*>>
55 concept HasFindFirstOfR = requires(Range1 range1, Range2 range2) {
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dranges_set_symmetric_difference.pass.cpp74 template <class Range1, class Range2, class OutIter>
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 Dranges_set_union.pass.cpp77 template <class Range1, class Range2, class OutIter>
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/llvm/unittests/ADT/
H A DIteratorTest.cpp348 auto Range2 = reverse(reverse(make_filter_range(A, IsOdd))); in TEST() local
349 SmallVector<int, 3> Actual2(Range2.begin(), Range2.end()); in TEST()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Dranges_robust_against_proxy_iterators.pass.cpp38 template <class Func, std::ranges::range Range1, std::ranges::range Range2, class ...Args>
39 constexpr void test(Func&& func, Range1& r1, Range2& r2, Args&& ...args) { in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/
H A Dranges_set_difference.pass.cpp80 template <class Range1, class Range2, class OutIter>
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 Dranges_set_intersection.pass.cpp74 template <class Range1, class Range2, class OutIter>
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.nonmodifying/alg.equal/
H A Dranges.equal.pass.cpp54 template <class Range1, class Range2>
55 concept HasEqualR = requires (Range1 range1, Range2 range2) {
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dranges_merge.pass.cpp79 template <class Range1, class Range2, class OutIter>
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/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dranges.search.pass.cpp51 template <class Range1, class Range2 = UncheckedRange<int*>>
52 concept HasSearchR = requires (Range1 range1, Range2 range2) {
H A Dranges.search_n.pass.cpp46 template <class Range1, class Range2 = UncheckedRange<int*>>
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
H A Dranges.find_end.pass.cpp50 template <class Range1, class Range2 = UncheckedRange<int*>>
51 concept HasFindEndR = requires (Range1 range1, Range2 range2) {
/llvm-project-15.0.7/llvm/unittests/DebugInfo/GSYM/
H A DGSYMTest.cpp620 const AddressRange Range2(0x1020, 0x1030); in TEST() local
622 encodeRange(Range2, FW, BaseAddr); in TEST()
632 EXPECT_EQ(Range2, DecodedRange2); in TEST()
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DCodeGenSchedule.cpp142 auto Range2 = std::equal_range(NonPseudos.begin(), NonPseudos.end(), in apply() local
155 std::for_each(Range2.first, Range2.second, HandleNonGeneric); in apply()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DBasicAliasAnalysis.cpp1264 ConstantRange Range2 = in aliasGEP() local
1266 if (Range1.intersectWith(Range2).isEmptySet()) in aliasGEP()
/llvm-project-15.0.7/clang/unittests/AST/
H A DASTImporterTest.cpp1751 static void CompareSourceRanges(SourceRange Range1, SourceRange Range2, in CompareSourceRanges() argument
1754 FullSourceLoc{ Range2.getBegin(), SM2 }); in CompareSourceRanges()
1756 FullSourceLoc{ Range2.getEnd(), SM2 }); in CompareSourceRanges()
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86ISelLowering.cpp13090 std::pair<int, int> Range2 = std::make_pair(INT_MAX, INT_MIN); in lowerShuffleAsByteRotateAndPermute() local
13107 Range2.first = std::min(Range2.first, M); in lowerShuffleAsByteRotateAndPermute()
13108 Range2.second = std::max(Range2.second, M); in lowerShuffleAsByteRotateAndPermute()
13117 !(0 <= Range2.first && Range2.second < NumEltsPerLane)) in lowerShuffleAsByteRotateAndPermute()
13146 if (Range2.second < Range1.first) in lowerShuffleAsByteRotateAndPermute()
13148 if (Range1.second < Range2.first) in lowerShuffleAsByteRotateAndPermute()
13149 return RotateAndPermute(V2, V1, Range2.first, NumElts); in lowerShuffleAsByteRotateAndPermute()