| /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)… 34 br i1 %Pred2, label %B2, label %A3 49 define void @nested_irr_in_loop(i1 %Pred0, i1 %Pred1, i1 %Pred2, i1 %Pred3, i1 %Pred4, i1 %Pred5, i… 86 br i1 %Pred2, label %B2, label %A3 104 define void @loop_in_irr(i1 %Pred0, i1 %Pred1, i1 %Pred2) { 137 br i1 %Pred2, label %A2, label %exit 146 define void @loop_in_irr_shared_header(i1 %Pred0, i1 %Pred1, i1 %Pred2) { 174 br i1 %Pred2, label %A2, label %exit 224 br i1 %Pred2, label %A1, label %L1 296 br i1 %Pred2, label %A1, label %L1 [all …]
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | AsmPredicateCondsEmission.td | 17 def Pred2 : Predicate<"Condition2">, 29 let Predicates = [Pred1, Pred2];
|
| H A D | MnemonicAlias.td | 18 def Subtarget2 : Predicate<"Pred2">, AssemblerPredicate<(all_of AsmCond2)>;
|
| H A D | AsmPredicateCombiningRISCV.td | 53 def AsmPred2 : Predicate<"Pred2">, AssemblerPredicate<(all_of AsmCond2a, AsmCond2b)>;
|
| H A D | AsmPredicateCombining.td | 53 def AsmPred2 : Predicate<"Pred2">, AssemblerPredicate<(all_of AsmCond2a, AsmCond2b)>;
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | BasicBlockUtils.cpp | 1489 BasicBlock *Pred2 = nullptr; in GetIfCondition() local 1495 Pred2 = SomePHI->getIncomingBlock(1); in GetIfCondition() 1503 Pred2 = *PI++; in GetIfCondition() 1525 std::swap(Pred1, Pred2); in GetIfCondition() 1533 if (!Pred2->getSinglePredecessor()) in GetIfCondition() 1539 Pred1Br->getSuccessor(1) == Pred2) { in GetIfCondition() 1541 IfFalse = Pred2; in GetIfCondition() 1542 } else if (Pred1Br->getSuccessor(0) == Pred2 && in GetIfCondition() 1544 IfTrue = Pred2; in GetIfCondition() 1569 IfFalse = Pred2; in GetIfCondition() [all …]
|
| /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… 137 br i1 %Pred2, label %while.cond.preheader, label %if.then39
|
| /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() 4294 return Pred2 == ICMP_UGE || Pred2 == ICMP_ULE || Pred2 == ICMP_SGE || in isImpliedTrueByMatchingCmp() 4295 Pred2 == ICMP_SLE; in isImpliedTrueByMatchingCmp() 4297 return Pred2 == ICMP_NE || Pred2 == ICMP_UGE; in isImpliedTrueByMatchingCmp() 4299 return Pred2 == ICMP_NE || Pred2 == ICMP_ULE; in isImpliedTrueByMatchingCmp() 4301 return Pred2 == ICMP_NE || Pred2 == ICMP_SGE; in isImpliedTrueByMatchingCmp() 4303 return Pred2 == ICMP_NE || Pred2 == ICMP_SLE; 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/lib/Target/Hexagon/ |
| H A D | HexagonInstrInfo.h | 236 ArrayRef<MachineOperand> Pred2) const override;
|
| H A D | HexagonInstrInfo.cpp | 1716 ArrayRef<MachineOperand> Pred2) const { in SubsumesPredicate()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | JumpThreading.cpp | 2956 BasicBlock *Pred1, *Pred2; in processGuards() local 2963 Pred2 = *PI++; in processGuards() 2966 if (Pred1 == Pred2) in processGuards() 2972 if (!Parent || Parent != Pred2->getSinglePredecessor()) in processGuards()
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCInstrInfo.h | 613 ArrayRef<MachineOperand> Pred2) const override;
|
| H A D | PPCInstrInfo.cpp | 2289 ArrayRef<MachineOperand> Pred2) const { in SubsumesPredicate() 2291 assert(Pred2.size() == 2 && "Invalid PPC second predicate"); in SubsumesPredicate() 2295 if (Pred2[1].getReg() == PPC::CTR8 || Pred2[1].getReg() == PPC::CTR) in SubsumesPredicate() 2299 if (Pred1[1].getReg() != Pred2[1].getReg()) in SubsumesPredicate() 2303 PPC::Predicate P2 = (PPC::Predicate) Pred2[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 | 175 ArrayRef<MachineOperand> Pred2) const override;
|
| H A D | ARMBaseInstrInfo.cpp | 633 ArrayRef<MachineOperand> Pred2) const { in SubsumesPredicate() 634 if (Pred1.size() > 2 || Pred2.size() > 2) in SubsumesPredicate() 638 ARMCC::CondCodes CC2 = (ARMCC::CondCodes)Pred2[0].getImm(); in SubsumesPredicate()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | TargetInstrInfo.h | 1468 ArrayRef<MachineOperand> Pred2) const { in SubsumesPredicate() argument
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAndOrXor.cpp | 1144 ICmpInst::Predicate Pred1, Pred2; in foldAndOrOfICmpsUsingRanges() local 1148 !match(ICmp2, m_ICmp(Pred2, m_Value(V2), m_APInt(C2)))) in foldAndOrOfICmpsUsingRanges() 1171 IsAnd ? ICmpInst::getInversePredicate(Pred2) : Pred2, *C2); in foldAndOrOfICmpsUsingRanges()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | InstructionSimplify.cpp | 85 CmpInst::Predicate ExpectedPred, Pred1, Pred2; in foldSelectWithBinaryOp() local 109 m_ICmp(Pred2, m_Value(X), m_Value(Y)))) || in foldSelectWithBinaryOp() 110 Pred1 != Pred2 || Pred1 != ExpectedPred) in foldSelectWithBinaryOp()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 11925 CmpInst::Predicate Pred2 = CI2->getPredicate(); in compareCmp() local 11927 CmpInst::Predicate SwapPred2 = CmpInst::getSwappedPredicate(Pred2); in compareCmp() 11929 CmpInst::Predicate BasePred2 = std::min(Pred2, SwapPred2); in compareCmp() 11935 bool LEPreds = Pred1 <= Pred2; in compareCmp() 11936 bool GEPreds = Pred1 >= Pred2; in compareCmp()
|