| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 213 Constant *C = ConstantFoldCompareInstOperands(ICI.getPredicate(), Elt, in foldCmpLoadFromIndexedGlobal()
920 ICmp->getPredicate() == ICmpInst::ICMP_NE); in foldAllocaCmp()
996 if (I.getPredicate() == I.ICMP_NE) in foldICmpShrConstConst()
1043 auto *TorF = ConstantInt::get(I.getType(), I.getPredicate() == I.ICMP_NE); in foldICmpShrConstConst()
1055 if (I.getPredicate() == I.ICMP_NE) in foldICmpShlConstConst()
1082 auto *TorF = ConstantInt::get(I.getType(), I.getPredicate() == I.ICMP_NE); in foldICmpShlConstConst()
1231 CmpInst::Predicate Pred = Cmp.getPredicate(); in foldICmpWithZero()
1332 CmpInst::Predicate Pred = Cmp.getPredicate(); in foldICmpWithConstant()
1378 CmpInst::Predicate Pred = Cmp.getPredicate(); in foldICmpWithDominatingICmp()
1449 ICmpInst::Predicate Pred = Cmp.getPredicate(); in foldICmpTruncConstant()
[all …]
|
| H A D | InstCombineAndOrXor.cpp | 227 PredL = LHSCMP->getPredicate(); in getMaskedTypeForICmpPair()
268 PredR = RHSCMP->getPredicate(); in getMaskedTypeForICmpPair()
726 Cmp0->getPredicate()); in simplifyRangeCheck()
734 Cmp1->getPredicate()); in simplifyRangeCheck()
782 if (LHS->getPredicate() != Pred || RHS->getPredicate() != Pred) in foldAndOrOfICmpsWithPow2AndWithZero()
876 CmpPredicate Pred = ICmp->getPredicate(); in foldSignedTruncationCheck()
970 if (JoinedByAnd && Cmp1->getPredicate() == ICmpInst::ICMP_NE) in foldIsPowerOf2()
972 else if (!JoinedByAnd && Cmp1->getPredicate() == ICmpInst::ICMP_EQ) in foldIsPowerOf2()
1204 if (Pred == Cmp->getPredicate()) in foldEqOfParts()
1210 if (Pred == CmpInst::ICMP_EQ && Cmp->getPredicate() == CmpInst::ICMP_ULT) { in foldEqOfParts()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | InstrTypes.h | 767 Predicate getPredicate() const { return getSubclassData<PredicateField>(); }
784 bool isFPPredicate() const { return isFPPredicate(getPredicate()); }
785 bool isIntPredicate() const { return isIntPredicate(getPredicate()); }
792 return getInversePredicate(getPredicate());
803 return getOrderedPredicate(getPredicate());
814 return getUnorderedPredicate(getPredicate());
830 return getSwappedPredicate(getPredicate());
845 bool isStrictPredicate() const { return isStrictPredicate(getPredicate()); }
855 return isNonStrictPredicate(getPredicate());
861 return getStrictPredicate(getPredicate());
[all …]
|
| H A D | IntrinsicInst.h | 696 LLVM_ABI CmpInst::Predicate getPredicate() const;
743 LLVM_ABI FCmpInst::Predicate getPredicate() const;
785 static ICmpInst::Predicate getPredicate(Intrinsic::ID ID) { in getPredicate() function
801 ICmpInst::Predicate getPredicate() const { in getPredicate() function
802 return getPredicate(getIntrinsicID()); in getPredicate()
807 return ICmpInst::isSigned(getPredicate(ID)); in isSigned()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/BPF/ |
| H A D | BPFAdjustOpt.cpp | 115 auto Op = Icmp->getPredicate(); in adjustICmpToBuiltin()
228 auto Cond2Op = Cond->getPredicate(); in serializeICMPCrossBB()
238 auto Cond1Op = Cond->getPredicate(); in serializeICMPCrossBB()
|
| H A D | BPFCheckAndAdjustIR.cpp | 259 ICmpInst::getSwappedPredicate(ICmp->getPredicate())); in sinkMinMaxInBB()
260 MinMaxSinkInfo Second(ICmp, ICmp->getOperand(0), ICmp->getPredicate()); in sinkMinMaxInBB()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchTree.cpp | |
| H A D | GIMatchDagPredicateDependencyEdge.cpp | |
| H A D | GIMatchDagPredicateDependencyEdge.h | |
| H A D | GIMatchDag.cpp | |
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopUnrollAnalyzer.cpp | 172 I.getPredicate()); in visitCmpInst()
181 if (Value *V = simplifyCmpInst(I.getPredicate(), LHS, RHS, DL)) { in visitCmpInst()
|
| H A D | BranchProbabilityInfo.cpp | 528 auto Search = PointerTable.find(CI->getPredicate()); in calcPointerHeuristics()
630 CI->getPredicate(), CmpLHSConst, CmpConst, DL); in computeUnlikelySuccessors()
1003 Search = ICmpWithLibCallTable.find(CI->getPredicate()); in calcZeroHeuristics()
1007 Search = ICmpWithZeroTable.find(CI->getPredicate()); in calcZeroHeuristics()
1011 Search = ICmpWithOneTable.find(CI->getPredicate()); in calcZeroHeuristics()
1015 Search = ICmpWithMinusOneTable.find(CI->getPredicate()); in calcZeroHeuristics()
1044 auto Search = FCmpTable.find(FCmp->getPredicate()); in calcFloatingPointHeuristics()
|
| H A D | IRSimilarityIdentifier.cpp | 61 if (Predicate != C->getPredicate()) in initializeInstruction()
186 switch (CI->getPredicate()) { in predicateForConsistency()
197 return CI->getPredicate(); in predicateForConsistency()
201 CmpInst::Predicate IRInstructionData::getPredicate() const { in getPredicate() function in IRInstructionData
208 return cast<CmpInst>(Inst)->getPredicate(); in getPredicate()
234 if (A.getPredicate() != B.getPredicate()) in isClose()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/MCTargetDesc/ |
| H A D | PPCPredicates.h | 87 inline Predicate getPredicate(unsigned Condition, unsigned Hint) { in getPredicate() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZTDC.cpp | 125 auto Pred = I.getPredicate(); in convertFCmp()
235 auto Pred = I.getPredicate(); in convertICmp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Legality.cpp | 109 auto Pred0 = cast<CmpInst>(I0)->getPredicate(); in notVectorizableBasedOnOpcodesAndTypes()
111 return cast<CmpInst>(V)->getPredicate() == Pred0; in notVectorizableBasedOnOpcodesAndTypes()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopVersioning.cpp | 46 : VersionedLoop(L), AliasChecks(Checks), Preds(LAI.getPSE().getPredicate()), in LoopVersioning()
290 !LAI.getPSE().getPredicate().isAlwaysTrue())) { in runImpl()
|
| H A D | CodeMoverUtils.cpp | 217 if (Cmp1->getPredicate() == Cmp2->getInversePredicate() && in isInverse()
222 if (Cmp1->getPredicate() == in isInverse()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Float2Int.cpp | 106 if (mapFCmpPred(cast<CmpInst>(&I)->getPredicate()) != in findRoots()
440 CmpInst::Predicate P = mapFCmpPred(cast<CmpInst>(I)->getPredicate()); in convert()
|
| H A D | LoopLoadElimination.cpp | 569 if (LAI.getPSE().getPredicate().getComplexity() > in processLoop()
580 if (!Checks.empty() || !LAI.getPSE().getPredicate().isAlwaysTrue()) { in processLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | CSEMIRBuilder.cpp | 101 B.addNodeIDImmediate(static_cast<int64_t>(Op.getPredicate())); in profileSrcOp()
194 SrcOps[0].getPredicate(), SrcOps[1].getReg(), SrcOps[2].getReg(), in buildInstr()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | DAGISelMatcher.cpp | 99 TreePredicateFn CheckPredicateMatcher::getPredicate() const { in getPredicate() function in CheckPredicateMatcher
166 OS << Indent << "CheckPredicate " << getPredicate().getFnName() << '\n'; in printImpl()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | FastISelEmitter.cpp | 74 const TreePredicateFn &getPredicate(unsigned Idx) { return PredsByName[Idx]; } in getPredicate() function in __anon3cd78fb00211::ImmPredicateSet
134 OS << "_" << ImmPredicates.getPredicate(Code - 1).getFnName(); in printManglingSuffix()
178 TreePredicateFn PredFn = ImmPredicates.getPredicate(Code - 1); in emitImmediatePredicate()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | IRSimilarityIdentifier.h | 182 LLVM_ABI CmpInst::Predicate getPredicate() const;
270 llvm::hash_value(ID.getPredicate()), in hash_value()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 725 if (PSE.getPredicate().isAlwaysTrue()) { in addInductionPhi()
1037 if (PSE.getPredicate().isAlwaysTrue()) { in canVectorizeInstrs()
1300 PSE.addPredicate(LAI->getPSE().getPredicate()); in canVectorizeMemory()
1894 if (PSE.getPredicate().getComplexity() > SCEVThreshold) { in canVectorize()
|