Home
last modified time | relevance | path

Searched refs:It2 (Results 1 – 18 of 18) sorted by relevance

/llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/
H A Dindirect_binary_predicate.compile.pass.cpp20 using It2 = IndirectlyReadable<struct Token2>; typedef
32 static_assert(std::indirect_binary_predicate<GoodPredicate<It1, It2>, It1, It2>);
40 …:indirect_binary_predicate<GoodPredicate<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>);
47 static_assert(!std::indirect_binary_predicate<BadPredicate1, It1, It2>);
52 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete;
54 static_assert(!std::indirect_binary_predicate<BadPredicate2, It1, It2>);
59 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete;
61 static_assert(!std::indirect_binary_predicate<BadPredicate3, It1, It2>);
68 static_assert(!std::indirect_binary_predicate<BadPredicate4, It1, It2>);
75 static_assert(!std::indirect_binary_predicate<BadPredicate5, It1, It2>);
[all …]
H A Dindirect_equivalence_relation.compile.pass.cpp20 using It2 = IndirectlyReadable<struct Token2>; typedef
47 static_assert(std::indirect_equivalence_relation<GoodRelation<It1, It2>, It1, It2>);
55 …direct_equivalence_relation<GoodRelation<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>);
62 static_assert(!std::indirect_equivalence_relation<BadRelation1, It1, It2>);
67 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete;
69 static_assert(!std::indirect_equivalence_relation<BadRelation2, It1, It2>);
74 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete;
76 static_assert(!std::indirect_equivalence_relation<BadRelation3, It1, It2>);
83 static_assert(!std::indirect_equivalence_relation<BadRelation4, It1, It2>);
90 static_assert(!std::indirect_equivalence_relation<BadRelation5, It1, It2>);
[all …]
H A Dindirect_strict_weak_order.compile.pass.cpp20 using It2 = IndirectlyReadable<struct Token2>; typedef
47 static_assert(std::indirect_strict_weak_order<GoodOrder<It1, It2>, It1, It2>);
55 …td::indirect_strict_weak_order<GoodOrder<NotIndirectlyReadable, It2>, NotIndirectlyReadable, It2>);
62 static_assert(!std::indirect_strict_weak_order<BadOrder1, It1, It2>);
67 bool operator()(std::iter_value_t<It1>&, std::iter_value_t<It2>&) const = delete;
69 static_assert(!std::indirect_strict_weak_order<BadOrder2, It1, It2>);
74 bool operator()(std::iter_value_t<It1>&, std::iter_reference_t<It2>) const = delete;
76 static_assert(!std::indirect_strict_weak_order<BadOrder3, It1, It2>);
83 static_assert(!std::indirect_strict_weak_order<BadOrder4, It1, It2>);
90 static_assert(!std::indirect_strict_weak_order<BadOrder5, It1, It2>);
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DAddressRanges.cpp21 auto It2 = It; in insert() local
22 while (It2 != Ranges.end() && It2->start() <= Range.end()) in insert()
23 ++It2; in insert()
24 if (It != It2) { in insert()
25 Range = {Range.start(), std::max(Range.end(), std::prev(It2)->end())}; in insert()
26 It = Ranges.erase(It, It2); in insert()
/llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.prev/
H A Dconstraints.compile.pass.cpp32 using It2 = bidirectional_iterator<int*>; typedef
33 static_assert(has_ranges_prev<It2>);
34 static_assert(has_ranges_prev<It2, std::ptrdiff_t>);
35 static_assert(has_ranges_prev<It2, std::ptrdiff_t, It2>);
/llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.next/
H A Dconstraints.compile.pass.cpp34 using It2 = forward_iterator<int*>; typedef
35 static_assert(has_ranges_next<It2>);
36 static_assert(has_ranges_next<It2, std::ptrdiff_t>);
37 static_assert(has_ranges_next<It2, std::ptrdiff_t, It2>);
/llvm-project-15.0.7/libcxx/test/libcxx/iterators/predef.iterators/__unconstrained_reverse_iterator/reverse.iter.nonmember/
H A Dminus.pass.cpp29 template <class It1, class It2>
30 TEST_CONSTEXPR_CXX17 void test(It1 l, It2 r, std::ptrdiff_t x) { in test()
32 const std::__unconstrained_reverse_iterator<It2> r2(r); in test()
/llvm-project-15.0.7/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.nonmember/
H A Dminus.pass.cpp29 template <class It1, class It2>
30 TEST_CONSTEXPR_CXX17 void test(It1 l, It2 r, std::ptrdiff_t x) { in test()
32 const std::reverse_iterator<It2> r2(r); in test()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/
H A Drotate_copy.pass.cpp56 template <typename T, typename It1, typename It2>
60 using T2 = typename std::iterator_traits<It2>::value_type;
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonGenMux.cpp297 MachineBasicBlock::iterator It1 = B.begin(), It2 = B.begin(); in genMuxInBlock() local
299 std::advance(It2, MaxX); in genMuxInBlock()
300 MachineInstr &Def1 = *It1, &Def2 = *It2; in genMuxInBlock()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSmallVector.h329 template<typename It1, typename It2>
330 static void uninitialized_move(It1 I, It1 E, It2 Dest) { in uninitialized_move()
337 template<typename It1, typename It2>
338 static void uninitialized_copy(It1 I, It1 E, It2 Dest) { in uninitialized_copy()
475 template<typename It1, typename It2>
476 static void uninitialized_move(It1 I, It1 E, It2 Dest) { in uninitialized_move()
483 template<typename It1, typename It2>
484 static void uninitialized_copy(It1 I, It1 E, It2 Dest) { in uninitialized_copy()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DSplitKit.cpp970 SmallPtrSetIterator<VNInfo *> It2 = It1; in computeRedundantBackCopies() local
972 It2 = It1; in computeRedundantBackCopies()
973 for (++It2; It2 != EqualVNs[ParentVNI->id].end(); ++It2) { in computeRedundantBackCopies()
974 if (DominatedVNIs.count(*It1) || DominatedVNIs.count(*It2)) in computeRedundantBackCopies()
978 MachineBasicBlock *MBB2 = LIS.getMBBFromIndex((*It2)->def); in computeRedundantBackCopies()
980 DominatedVNIs.insert((*It1)->def < (*It2)->def ? (*It2) : (*It1)); in computeRedundantBackCopies()
982 DominatedVNIs.insert(*It2); in computeRedundantBackCopies()
/llvm-project-15.0.7/clang/include/clang/AST/
H A DASTVector.h214 template<typename It1, typename It2>
215 static void uninitialized_copy(It1 I, It1 E, It2 Dest) { in uninitialized_copy()
/llvm-project-15.0.7/llvm/lib/ObjCopy/ELF/
H A DELFObjcopy.cpp686 auto It2 = Config.SetSectionType.find(Sec.Name); in handleArgs() local
687 if (It2 != Config.SetSectionType.end()) in handleArgs()
688 Sec.Type = It2->second; in handleArgs()
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Dnoalias.ll101 ; CHECK: !6 = distinct !{!6, !2, !"It2"}
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h240 template <class It1, class It2>
241 LoopData(LoopData *Parent, It1 FirstHeader, It1 LastHeader, It2 FirstOther, in LoopData()
242 It2 LastOther) in LoopData()
/llvm-project-15.0.7/llvm/tools/llvm-objcopy/
H A DObjcopyOptions.cpp1091 auto It2 = find_if(MachOConfig.RPathsToRemove, Match); in parseInstallNameToolOptions() local
1092 if (It2 != MachOConfig.RPathsToRemove.end()) in parseInstallNameToolOptions()
1094 "cannot specify both -delete_rpath '" + *It2 + in parseInstallNameToolOptions()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp3294 nodes_iterator(const ItTy &It2) : It(It2) {} in nodes_iterator() argument
11321 auto It2 = TrackedVals.find(RdxVal2); in tryToReduce() local
11322 if (It2 != TrackedVals.end()) in tryToReduce()
11323 StableRdxVal2 = It2->second; in tryToReduce()