2009-11-09 22:57:59 +00:00
|
|
|
//===-- InstructionSimplify.h - Fold instructions into simpler forms ------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-11-23 10:50:08 +00:00
|
|
|
// This file declares routines for folding instructions into simpler forms
|
|
|
|
// that do not require creating new instructions. This does constant folding
|
|
|
|
// ("add i32 1, 1" -> "2") but can also handle non-constant operands, either
|
|
|
|
// returning a constant ("and i32 %x, 0" -> "0") or an already existing value
|
2010-12-28 18:01:19 +00:00
|
|
|
// ("and i32 %x, %x" -> "%x"). If the simplification is also an instruction
|
|
|
|
// then it dominates the original instruction.
|
2009-11-09 22:57:59 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_ANALYSIS_INSTRUCTIONSIMPLIFY_H
|
|
|
|
#define LLVM_ANALYSIS_INSTRUCTIONSIMPLIFY_H
|
|
|
|
|
|
|
|
namespace llvm {
|
2010-11-14 18:36:10 +00:00
|
|
|
class DominatorTree;
|
2009-11-10 01:08:51 +00:00
|
|
|
class Instruction;
|
2009-11-09 22:57:59 +00:00
|
|
|
class Value;
|
|
|
|
class TargetData;
|
2009-11-27 17:42:22 +00:00
|
|
|
|
|
|
|
/// SimplifyAddInst - Given operands for an Add, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
|
|
|
Value *SimplifyAddInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0, const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2010-12-15 14:07:39 +00:00
|
|
|
/// SimplifySubInst - Given operands for a Sub, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
|
|
|
Value *SimplifySubInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW,
|
|
|
|
const TargetData *TD = 0, const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-10 00:55:12 +00:00
|
|
|
/// SimplifyAndInst - Given operands for an And, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2010-11-16 12:16:38 +00:00
|
|
|
Value *SimplifyAndInst(Value *LHS, Value *RHS, const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2009-11-10 00:55:12 +00:00
|
|
|
|
2010-12-21 14:00:22 +00:00
|
|
|
/// SimplifyMulInst - Given operands for a Mul, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
|
|
|
Value *SimplifyMulInst(Value *LHS, Value *RHS, const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-10 00:55:12 +00:00
|
|
|
/// SimplifyOrInst - Given operands for an Or, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2010-11-16 12:16:38 +00:00
|
|
|
Value *SimplifyOrInst(Value *LHS, Value *RHS, const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2010-11-17 18:52:15 +00:00
|
|
|
/// SimplifyXorInst - Given operands for a Xor, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
|
|
|
Value *SimplifyXorInst(Value *LHS, Value *RHS, const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-09 23:28:39 +00:00
|
|
|
/// SimplifyICmpInst - Given operands for an ICmpInst, see if we can
|
2009-11-09 22:57:59 +00:00
|
|
|
/// fold the result. If not, this returns null.
|
2009-11-09 23:28:39 +00:00
|
|
|
Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2009-11-09 23:28:39 +00:00
|
|
|
/// 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,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2010-04-20 05:32:14 +00:00
|
|
|
/// 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,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2009-11-09 23:28:39 +00:00
|
|
|
|
2009-11-27 00:29:05 +00:00
|
|
|
/// SimplifyGEPInst - Given operands for an GetElementPtrInst, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
|
|
|
Value *SimplifyGEPInst(Value * const *Ops, unsigned NumOps,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0, const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2009-11-09 23:28:39 +00:00
|
|
|
//=== Helper functions for higher up the class hierarchy.
|
2010-11-14 11:23:23 +00:00
|
|
|
|
|
|
|
|
2009-11-09 23:28:39 +00:00
|
|
|
/// 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,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0, const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2009-11-09 22:57:59 +00:00
|
|
|
/// SimplifyBinOp - Given operands for a BinaryOperator, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2010-11-14 11:23:23 +00:00
|
|
|
Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
|
2010-11-16 12:16:38 +00:00
|
|
|
const TargetData *TD = 0, const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
2009-11-10 01:08:51 +00:00
|
|
|
/// SimplifyInstruction - See if we can compute a simplified version of this
|
|
|
|
/// instruction. If not, this returns null.
|
2010-11-14 18:36:10 +00:00
|
|
|
Value *SimplifyInstruction(Instruction *I, const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 11:23:23 +00:00
|
|
|
|
|
|
|
|
2009-11-10 22:26:15 +00:00
|
|
|
/// 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
|
|
|
|
/// things where one simplification exposes other opportunities. This only
|
|
|
|
/// simplifies and deletes scalar operations, it does not change the CFG.
|
|
|
|
///
|
|
|
|
void ReplaceAndSimplifyAllUses(Instruction *From, Value *To,
|
2010-11-14 18:36:10 +00:00
|
|
|
const TargetData *TD = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2009-11-09 22:57:59 +00:00
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|