Home
last modified time | relevance | path

Searched refs:SimplifyICmpInst (Results 1 – 5 of 5) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DInstructionSimplify.cpp67 static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
1025 Value *V = SimplifyICmpInst(Pred, LHS, RHS, Q, MaxRecurse); in isICmpTrue()
3008 if (Value *V = SimplifyICmpInst(Pred, A == RHS ? B : A, in simplifyICmpWithBinOp()
3044 if (Value *V = SimplifyICmpInst(Pred, Y, Z, Q, MaxRecurse - 1)) in simplifyICmpWithBinOp()
3121 if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0), in simplifyICmpWithBinOp()
3129 if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0), in simplifyICmpWithBinOp()
3136 if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0), in simplifyICmpWithBinOp()
3147 if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0), in simplifyICmpWithBinOp()
3447 if (Value *V = SimplifyICmpInst(Pred, SrcOp, in SimplifyICmpInst()
3684 return ::SimplifyICmpInst(Predicate, LHS, RHS, Q, RecursionLimit); in SimplifyICmpInst()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h239 Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopDeletion.cpp331 auto *KnownCondition = SimplifyICmpInst(Pred, LHS, RHS, SQ); in canProveExitOnFirstIteration()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp3335 Op = SimplifyICmpInst(I.getPredicate(), V, RHSC, SQ); in foldICmpInstWithConstantNotInt()
5696 if (Value *V = SimplifyICmpInst(I.getPredicate(), Op0, Op1, Q)) in visitICmpInst()
H A DInstCombineAndOrXor.cpp1194 Value *SubstituteCmp = SimplifyICmpInst(Pred1, Y, C, Q); in foldAndOrOfICmpsWithConstEq()