| /llvm-project-15.0.7/llvm/test/Transforms/FixIrreducible/ |
| H A D | nested.ll | 4 define void @nested_irr_top_level(i1 %Pred0, i1 %Pred1, i1 %Pred2, i1 %Pred3, i1 %Pred4, i1 %Pred5)… 31 br i1 %Pred1, label %B1, label %B2 49 define void @nested_irr_in_loop(i1 %Pred0, i1 %Pred1, i1 %Pred2, i1 %Pred3, i1 %Pred4, i1 %Pred5, i… 83 br i1 %Pred1, label %B1, label %B2 104 define void @loop_in_irr(i1 %Pred0, i1 %Pred1, i1 %Pred2) { 134 br i1 %Pred1, label %H1, label %A3 146 define void @loop_in_irr_shared_header(i1 %Pred0, i1 %Pred1, i1 %Pred2) { 171 br i1 %Pred1, label %H1, label %A3 218 br i1 %Pred1, label %A1, label %A2 290 br i1 %Pred1, label %A1, label %A2 [all …]
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | MergedLoadStoreMotion.cpp | 291 BasicBlock *Pred1 = *SI; in mergeStores() local 293 if (Pred0 == Pred1) in mergeStores() 299 auto InstsNoDbg = Pred1->instructionsWithoutDebug(); in mergeStores() 317 if (StoreInst *S1 = canSinkFromBlock(Pred1, S0)) { in mergeStores() 328 SinkBB = SplitBlockPredecessors(TailBB, {Pred0, Pred1}, ".sink.split"); in mergeStores()
|
| H A D | GuardWidening.cpp | 511 ICmpInst::Predicate Pred0, Pred1; in widenCondCommon() local 513 match(Cond1, m_ICmp(Pred1, m_Specific(LHS), m_ConstantInt(RHS1)))) { in widenCondCommon() 515 Pred1 = ICmpInst::getInversePredicate(Pred1); in widenCondCommon() 520 ConstantRange::makeExactICmpRegion(Pred1, RHS1->getValue()); in widenCondCommon()
|
| H A D | JumpThreading.cpp | 2956 BasicBlock *Pred1, *Pred2; in processGuards() local 2960 Pred1 = *PI++; in processGuards() 2966 if (Pred1 == Pred2) in processGuards() 2971 auto *Parent = Pred1->getSinglePredecessor(); in processGuards()
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | AsmPredicateCondsEmission.td | 16 def Pred1 : Predicate<"Condition1">; 29 let Predicates = [Pred1, Pred2];
|
| H A D | MnemonicAlias.td | 17 def Subtarget1 : Predicate<"Pred1">, AssemblerPredicate<(all_of AsmCond1)>;
|
| H A D | AsmPredicateCombiningRISCV.td | 52 def AsmPred1 : Predicate<"Pred1">, AssemblerPredicate<(all_of AsmCond1)>;
|
| H A D | AsmPredicateCombining.td | 52 def AsmPred1 : Predicate<"Pred1">, AssemblerPredicate<(all_of AsmCond1)>;
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | InstructionSimplify.cpp | 110 Pred1 != Pred2 || Pred1 != ExpectedPred) in foldSelectWithBinaryOp() 1588 ICmpInst::Predicate Pred0, Pred1; in simplifyAndOfICmpsWithSameOperands() local 1607 ICmpInst::Predicate Pred0, Pred1; in simplifyOrOfICmpsWithSameOperands() local 1704 ICmpInst::Predicate Pred0, Pred1; in simplifyAndOfICmpsWithAdd() local 1762 ICmpInst::Predicate Pred1; in simplifyAndOrOfICmpsWithLimitConst() local 1766 if (ICmpInst::isEquality(Pred1)) in simplifyAndOrOfICmpsWithLimitConst() 1783 Pred1 = ICmpInst::getInversePredicate(Pred1); in simplifyAndOrOfICmpsWithLimitConst() 1788 if (ICmpInst::isSigned(Pred1)) { in simplifyAndOrOfICmpsWithLimitConst() 1789 Pred1 = ICmpInst::getUnsignedPredicate(Pred1); in simplifyAndOrOfICmpsWithLimitConst() 1811 ICmpInst::Predicate Pred0, Pred1; in simplifyAndOrOfICmpsWithCtpop() local [all …]
|
| H A D | MustExecute.cpp | 675 const BasicBlock *Pred1 = Worklist[1]; in findBackwardJoinPoint() local 677 const BasicBlock *Pred1UniquePred = Pred1->getUniquePredecessor(); in findBackwardJoinPoint() 682 } else if (Pred1 == Pred0UniquePred) { in findBackwardJoinPoint() 685 JoinBB = Pred1; in findBackwardJoinPoint()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | BasicBlockUtils.cpp | 1488 BasicBlock *Pred1 = nullptr; in GetIfCondition() local 1494 Pred1 = SomePHI->getIncomingBlock(0); in GetIfCondition() 1500 Pred1 = *PI++; in GetIfCondition() 1510 BranchInst *Pred1Br = dyn_cast<BranchInst>(Pred1->getTerminator()); in GetIfCondition() 1525 std::swap(Pred1, Pred2); in GetIfCondition() 1540 IfTrue = Pred1; in GetIfCondition() 1545 IfFalse = Pred1; in GetIfCondition() 1558 BasicBlock *CommonPred = Pred1->getSinglePredecessor(); in GetIfCondition() 1567 if (BI->getSuccessor(0) == Pred1) { in GetIfCondition() 1568 IfTrue = Pred1; in GetIfCondition() [all …]
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAndOrXor.cpp | 694 Pred1 = ICmpInst::getSwappedPredicate(Pred1); in simplifyRangeCheck() 701 switch (Pred1) { in simplifyRangeCheck() 887 CmpInst::Predicate Pred0, Pred1; in foldIsPowerOf2OrZero() local 891 !match(Cmp1, m_ICmp(Pred1, m_Specific(X), m_ZeroInt()))) in foldIsPowerOf2OrZero() 914 CmpInst::Predicate Pred0, Pred1; in foldIsPowerOf2() local 1116 ICmpInst::Predicate Pred1; in foldAndOrOfICmpsWithConstEq() local 1117 if (!match(Cmp1, m_c_ICmp(Pred1, m_Value(Y), m_Deferred(X)))) in foldAndOrOfICmpsWithConstEq() 1125 Value *SubstituteCmp = simplifyICmpInst(Pred1, Y, C, Q); in foldAndOrOfICmpsWithConstEq() 1131 SubstituteCmp = Builder.CreateICmp(Pred1, Y, C); in foldAndOrOfICmpsWithConstEq() 1144 ICmpInst::Predicate Pred1, Pred2; in foldAndOrOfICmpsUsingRanges() local [all …]
|
| H A D | InstCombineSelect.cpp | 1340 ICmpInst::Predicate Pred1; in canonicalizeClampLike() local 1346 m_ICmp(Pred1, m_Specific(X), in canonicalizeClampLike() 1357 switch (Pred1) { in canonicalizeClampLike() 1378 Pred1 = ICmpInst::Predicate::ICMP_SLT; in canonicalizeClampLike() 1384 assert(Pred1 == ICmpInst::Predicate::ICMP_SLT && in canonicalizeClampLike()
|
| /llvm-project-15.0.7/llvm/test/Transforms/StructurizeCFG/workarounds/ |
| H A D | needs-fr-ule.ll | 3 define void @irreducible_mountain_bug(i1 %Pred0, i1 %Pred1, i1 %Pred2, i1 %Pred3, i1 %Pred4, i1 %Pr… 128 br i1 %Pred1, label %if.then7, label %if.else
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonInstrInfo.h | 235 bool SubsumesPredicate(ArrayRef<MachineOperand> Pred1,
|
| H A D | HexagonInstrInfo.cpp | 1715 bool HexagonInstrInfo::SubsumesPredicate(ArrayRef<MachineOperand> Pred1, in SubsumesPredicate() argument
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCInstrInfo.h | 612 bool SubsumesPredicate(ArrayRef<MachineOperand> Pred1,
|
| H A D | PPCInstrInfo.cpp | 2288 bool PPCInstrInfo::SubsumesPredicate(ArrayRef<MachineOperand> Pred1, in SubsumesPredicate() argument 2290 assert(Pred1.size() == 2 && "Invalid PPC first predicate"); in SubsumesPredicate() 2293 if (Pred1[1].getReg() == PPC::CTR8 || Pred1[1].getReg() == PPC::CTR) in SubsumesPredicate() 2299 if (Pred1[1].getReg() != Pred2[1].getReg()) in SubsumesPredicate() 2302 PPC::Predicate P1 = (PPC::Predicate) Pred1[0].getImm(); in SubsumesPredicate()
|
| /llvm-project-15.0.7/llvm/include/llvm/IR/ |
| H A D | InstrTypes.h | 1028 static bool isImpliedTrueByMatchingCmp(Predicate Pred1, Predicate Pred2); 1032 static bool isImpliedFalseByMatchingCmp(Predicate Pred1, Predicate Pred2);
|
| /llvm-project-15.0.7/llvm/lib/Target/ARM/ |
| H A D | ARMBaseInstrInfo.h | 174 bool SubsumesPredicate(ArrayRef<MachineOperand> Pred1,
|
| H A D | ARMBaseInstrInfo.cpp | 632 bool ARMBaseInstrInfo::SubsumesPredicate(ArrayRef<MachineOperand> Pred1, in SubsumesPredicate() argument 634 if (Pred1.size() > 2 || Pred2.size() > 2) in SubsumesPredicate() 637 ARMCC::CondCodes CC1 = (ARMCC::CondCodes)Pred1[0].getImm(); in SubsumesPredicate()
|
| /llvm-project-15.0.7/llvm/lib/IR/ |
| H A D | Instructions.cpp | 4283 bool CmpInst::isImpliedTrueByMatchingCmp(Predicate Pred1, Predicate Pred2) { in isImpliedTrueByMatchingCmp() argument 4286 if (Pred1 == Pred2) in isImpliedTrueByMatchingCmp() 4289 switch (Pred1) { in isImpliedTrueByMatchingCmp() 4308 bool CmpInst::isImpliedFalseByMatchingCmp(Predicate Pred1, Predicate Pred2) { in isImpliedFalseByMatchingCmp() argument 4309 return isImpliedTrueByMatchingCmp(Pred1, getInversePredicate(Pred2)); in isImpliedFalseByMatchingCmp()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | TargetInstrInfo.h | 1467 virtual bool SubsumesPredicate(ArrayRef<MachineOperand> Pred1, in SubsumesPredicate() argument
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 11924 CmpInst::Predicate Pred1 = CI1->getPredicate(); in compareCmp() local 11926 CmpInst::Predicate SwapPred1 = CmpInst::getSwappedPredicate(Pred1); in compareCmp() 11928 CmpInst::Predicate BasePred1 = std::min(Pred1, SwapPred1); in compareCmp() 11935 bool LEPreds = Pred1 <= Pred2; in compareCmp() 11936 bool GEPreds = Pred1 >= Pred2; in compareCmp()
|