diff options
author | Duncan Sands <baldrick@free.fr> | 2010-11-14 11:23:23 +0000 |
---|---|---|
committer | Duncan Sands <baldrick@free.fr> | 2010-11-14 11:23:23 +0000 |
commit | 12a86f5b3199e72e6d967781acc76340f5920e46 (patch) | |
tree | b0a48c2420a45ab226169986d5dca42acc2f813f /include/llvm/Analysis | |
parent | 6857373f44e4182200e70b83e6227d8f64bc02da (diff) | |
download | external_llvm-12a86f5b3199e72e6d967781acc76340f5920e46.zip external_llvm-12a86f5b3199e72e6d967781acc76340f5920e46.tar.gz external_llvm-12a86f5b3199e72e6d967781acc76340f5920e46.tar.bz2 |
Strip trailing whitespace.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@119038 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/Analysis')
-rw-r--r-- | include/llvm/Analysis/InstructionSimplify.h | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/include/llvm/Analysis/InstructionSimplify.h b/include/llvm/Analysis/InstructionSimplify.h index 913fd77..9825caf 100644 --- a/include/llvm/Analysis/InstructionSimplify.h +++ b/include/llvm/Analysis/InstructionSimplify.h @@ -25,7 +25,7 @@ namespace llvm { /// fold the result. If not, this returns null. Value *SimplifyAddInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW, const TargetData *TD = 0); - + /// SimplifyAndInst - Given operands for an And, see if we can /// fold the result. If not, this returns null. Value *SimplifyAndInst(Value *LHS, Value *RHS, @@ -35,17 +35,17 @@ namespace llvm { /// fold the result. If not, this returns null. Value *SimplifyOrInst(Value *LHS, Value *RHS, const TargetData *TD = 0); - + /// SimplifyICmpInst - Given operands for an ICmpInst, see if we can /// fold the result. If not, this returns null. Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD = 0); - + /// SimplifyFCmpInst - Given operands for an FCmpInst, see if we can /// fold the result. If not, this returns null. Value *SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD = 0); - + /// SimplifySelectInst - Given operands for a SelectInst, see if we can fold /// the result. If not, this returns null. Value *SimplifySelectInst(Value *Cond, Value *TrueVal, Value *FalseVal, @@ -55,27 +55,27 @@ namespace llvm { /// fold the result. If not, this returns null. Value *SimplifyGEPInst(Value * const *Ops, unsigned NumOps, const TargetData *TD = 0); - + //=== Helper functions for higher up the class hierarchy. - - + + /// SimplifyCmpInst - Given operands for a CmpInst, see if we can /// fold the result. If not, this returns null. Value *SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD = 0); - + /// SimplifyBinOp - Given operands for a BinaryOperator, see if we can /// fold the result. If not, this returns null. - Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, + Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD = 0); - + /// SimplifyInstruction - See if we can compute a simplified version of this /// instruction. If not, this returns null. /// WARNING: If called on unreachable code, an instruction may be reported /// to simplify to itself. Value *SimplifyInstruction(Instruction *I, const TargetData *TD = 0); - - + + /// ReplaceAndSimplifyAllUses - Perform From->replaceAllUsesWith(To) and then /// delete the From instruction. In addition to a basic RAUW, this does a /// recursive simplification of the updated instructions. This catches |