diff options
author | Chris Lattner <sabre@nondot.org> | 2009-11-09 22:57:59 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2009-11-09 22:57:59 +0000 |
commit | 9f3c25aeb3df77a336693308dc0f19a4983c99af (patch) | |
tree | 3827aa1ff748fe2a5a1f332ae532d132a893c66d /lib/Analysis/InstructionSimplify.cpp | |
parent | 6f348e458660063a40052b208bab96895c822877 (diff) |
stub out a new libanalysis "instruction simplify" interface that
takes decimated instructions and applies identities to them. This
is pretty minimal at this point, but I plan to pull some instcombine
logic out into these and similar routines.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86613 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/InstructionSimplify.cpp')
-rw-r--r-- | lib/Analysis/InstructionSimplify.cpp | 57 |
1 files changed, 57 insertions, 0 deletions
diff --git a/lib/Analysis/InstructionSimplify.cpp b/lib/Analysis/InstructionSimplify.cpp new file mode 100644 index 0000000000..692236a0f2 --- /dev/null +++ b/lib/Analysis/InstructionSimplify.cpp @@ -0,0 +1,57 @@ +//===- InstructionSimplify.cpp - Fold instruction operands ----------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// +// +// This file implements routines for folding instructions into simpler forms +// that do not require creating new instructions. For example, this does +// constant folding, and can handle identities like (X&0)->0. +// +//===----------------------------------------------------------------------===// + +#include "llvm/Analysis/InstructionSimplify.h" +#include "llvm/Analysis/ConstantFolding.h" +#include "llvm/Instructions.h" +using namespace llvm; + + +/// SimplifyBinOp - Given operands for a BinaryOperator, see if we can +/// fold the result. If not, this returns null. +Value *llvm::SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, + const TargetData *TD) { + if (Constant *CLHS = dyn_cast<Constant>(LHS)) + if (Constant *CRHS = dyn_cast<Constant>(RHS)) { + Constant *COps[] = {CLHS, CRHS}; + return ConstantFoldInstOperands(Opcode, LHS->getType(), COps, 2, TD); + } + return 0; +} + + +/// SimplifyCompare - Given operands for a CmpInst, see if we can +/// fold the result. +Value *llvm::SimplifyCompare(unsigned Predicate, Value *LHS, Value *RHS, + const TargetData *TD) { + CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate; + + if (Constant *CLHS = dyn_cast<Constant>(LHS)) + if (Constant *CRHS = dyn_cast<Constant>(RHS)) { + Constant *COps[] = {CLHS, CRHS}; + return ConstantFoldCompareInstOperands(Pred, COps, 2, TD); + } + + // If this is an integer compare and the LHS and RHS are the same, fold it. + if (LHS == RHS) + if (isa<IntegerType>(LHS->getType()) || isa<PointerType>(LHS->getType())) { + if (ICmpInst::isTrueWhenEqual(Pred)) + return ConstantInt::getTrue(LHS->getContext()); + else + return ConstantInt::getFalse(LHS->getContext()); + } + return 0; +} + |