|
| Value * | llvm::SimplifyAddInst (Value *LHS, Value *RHS, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyAddInst - Given operands for an Add, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifySubInst (Value *LHS, Value *RHS, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifySubInst - Given operands for a Sub, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFAddInst (Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given operands for an FAdd, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFSubInst (Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given operands for an FSub, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFMulInst (Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given operands for an FMul, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyMulInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyMulInst - Given operands for a Mul, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifySDivInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifySDivInst - Given operands for an SDiv, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyUDivInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyUDivInst - Given operands for a UDiv, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFDivInst (Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyFDivInst - Given operands for an FDiv, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifySRemInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifySRemInst - Given operands for an SRem, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyURemInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyURemInst - Given operands for a URem, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFRemInst (Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyFRemInst - Given operands for an FRem, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyShlInst (Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyShlInst - Given operands for a Shl, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyLShrInst (Value *Op0, Value *Op1, bool isExact, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyLShrInst - Given operands for a LShr, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyAShrInst (Value *Op0, Value *Op1, bool isExact, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyAShrInst - Given operands for a AShr, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyAndInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyAndInst - Given operands for an And, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyOrInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyOrInst - Given operands for an Or, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyXorInst (Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyXorInst - Given operands for a Xor, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyICmpInst (unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, Instruction *CxtI=nullptr) |
| | SimplifyICmpInst - Given operands for an ICmpInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFCmpInst (unsigned Predicate, Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyFCmpInst - Given operands for an FCmpInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifySelectInst (Value *Cond, Value *TrueVal, Value *FalseVal, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifySelectInst - Given operands for a SelectInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyGEPInst (ArrayRef< Value * > Ops, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyGEPInst - Given operands for an GetElementPtrInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyInsertValueInst (Value *Agg, Value *Val, ArrayRef< unsigned > Idxs, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyInsertValueInst - Given operands for an InsertValueInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyExtractValueInst (Value *Agg, ArrayRef< unsigned > Idxs, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given operands for an ExtractValueInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyExtractElementInst (Value *Vec, Value *Idx, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given operands for an ExtractElementInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyTruncInst (Value *Op, Type *Ty, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyTruncInst - Given operands for an TruncInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyCmpInst (unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyCmpInst - Given operands for a CmpInst, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyBinOp (unsigned Opcode, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyBinOp - Given operands for a BinaryOperator, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyFPBinOp (unsigned Opcode, Value *LHS, Value *RHS, const FastMathFlags &FMF, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | SimplifyFPBinOp - Given operands for a BinaryOperator, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyCall (Value *V, User::op_iterator ArgBegin, User::op_iterator ArgEnd, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given a function and iterators over arguments, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyCall (Value *V, ArrayRef< Value * > Args, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr) |
| | Given a function and set of arguments, see if we can fold the result. More...
|
| |
| Value * | llvm::SimplifyInstruction (Instruction *I, const DataLayout &DL, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr) |
| | SimplifyInstruction - See if we can compute a simplified version of this instruction. More...
|
| |
| bool | llvm::replaceAndRecursivelySimplify (Instruction *I, Value *SimpleV, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr) |
| | Replace all uses of 'I' with 'SimpleV' and simplify the uses recursively. More...
|
| |
| bool | llvm::recursivelySimplifyInstruction (Instruction *I, const TargetLibraryInfo *TLI=nullptr, const DominatorTree *DT=nullptr, AssumptionCache *AC=nullptr) |
| | Recursively attempt to simplify an instruction. More...
|
| |