2013-08-06 02:16:21 +02:00
|
|
|
//===-- InstructionSimplify.h - Fold instrs into simpler forms --*- C++ -*-===//
|
2009-11-09 23:57:59 +01:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-11-23 11:50:08 +01: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 19:01:19 +01:00
|
|
|
// ("and i32 %x, %x" -> "%x"). If the simplification is also an instruction
|
|
|
|
// then it dominates the original instruction.
|
2009-11-09 23:57:59 +01:00
|
|
|
//
|
2013-01-28 22:45:32 +01:00
|
|
|
// These routines implicitly resolve undef uses. The easiest way to be safe when
|
|
|
|
// using these routines to obtain simplified values for existing instructions is
|
|
|
|
// to always replace all uses of the instructions with the resulting simplified
|
|
|
|
// values. This will prevent other code from seeing the same undef uses and
|
|
|
|
// resolving them to different values.
|
|
|
|
//
|
2013-01-31 23:13:00 +01:00
|
|
|
// These routines are designed to tolerate moderately incomplete IR, such as
|
|
|
|
// instructions that are not connected to basic blocks yet. However, they do
|
|
|
|
// require that all the IR that they encounter be valid. In particular, they
|
|
|
|
// require that all non-constant values be defined in the same function, and the
|
|
|
|
// same call context of that function (and not split between caller and callee
|
|
|
|
// contexts of a directly recursive call, for example).
|
|
|
|
//
|
2009-11-09 23:57:59 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_ANALYSIS_INSTRUCTIONSIMPLIFY_H
|
|
|
|
#define LLVM_ANALYSIS_INSTRUCTIONSIMPLIFY_H
|
|
|
|
|
2013-01-02 12:36:10 +01:00
|
|
|
#include "llvm/IR/User.h"
|
2012-12-28 12:30:55 +01:00
|
|
|
|
2009-11-09 23:57:59 +01:00
|
|
|
namespace llvm {
|
2012-03-13 15:07:05 +01:00
|
|
|
template<typename T>
|
|
|
|
class ArrayRef;
|
2010-11-14 19:36:10 +01:00
|
|
|
class DominatorTree;
|
2009-11-10 02:08:51 +01:00
|
|
|
class Instruction;
|
2012-10-08 18:38:25 +02:00
|
|
|
class DataLayout;
|
2012-12-09 22:12:04 +01:00
|
|
|
class FastMathFlags;
|
2011-12-01 04:08:23 +01:00
|
|
|
class TargetLibraryInfo;
|
2012-03-13 15:07:05 +01:00
|
|
|
class Type;
|
|
|
|
class Value;
|
2009-11-27 18:42:22 +01: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,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2010-12-15 15:07:39 +01: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,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-12-15 15:07:39 +01:00
|
|
|
|
Added a slew of SimplifyInstruction floating-point optimizations, many of which take advantage of fast-math flags. Test cases included.
fsub X, +0 ==> X
fsub X, -0 ==> X, when we know X is not -0
fsub +/-0.0, (fsub -0.0, X) ==> X
fsub nsz +/-0.0, (fsub +/-0.0, X) ==> X
fsub nnan ninf X, X ==> 0.0
fadd nsz X, 0 ==> X
fadd [nnan ninf] X, (fsub [nnan ninf] 0, X) ==> 0
where nnan and ninf have to occur at least once somewhere in this expression
fmul X, 1.0 ==> X
llvm-svn: 169940
2012-12-12 01:27:46 +01:00
|
|
|
/// Given operands for an FAdd, see if we can fold the result. If not, this
|
|
|
|
/// returns null.
|
|
|
|
Value *SimplifyFAddInst(Value *LHS, Value *RHS, FastMathFlags FMF,
|
|
|
|
const DataLayout *TD = 0,
|
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// Given operands for an FSub, see if we can fold the result. If not, this
|
|
|
|
/// returns null.
|
|
|
|
Value *SimplifyFSubInst(Value *LHS, Value *RHS, FastMathFlags FMF,
|
|
|
|
const DataLayout *TD = 0,
|
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2012-11-27 01:46:26 +01:00
|
|
|
/// Given operands for an FMul, see if we can fold the result. If not, this
|
|
|
|
/// returns null.
|
|
|
|
Value *SimplifyFMulInst(Value *LHS, Value *RHS,
|
|
|
|
FastMathFlags FMF,
|
|
|
|
const DataLayout *TD = 0,
|
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2011-01-14 01:37:45 +01:00
|
|
|
/// SimplifyMulInst - Given operands for a Mul, see if we can
|
2009-11-10 01:55:12 +01:00
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyMulInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-16 13:16:38 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2009-11-10 01:55:12 +01:00
|
|
|
|
2011-01-28 17:51:11 +01:00
|
|
|
/// SimplifySDivInst - Given operands for an SDiv, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifySDivInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-01-28 17:51:11 +01:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// SimplifyUDivInst - Given operands for a UDiv, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-11-15 23:34:00 +01:00
|
|
|
Value *SimplifyUDivInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-01-29 16:26:31 +01:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// SimplifyFDivInst - Given operands for an FDiv, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyFDivInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-01-29 16:26:31 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2011-01-28 17:51:11 +01:00
|
|
|
|
2011-05-02 18:34:19 +02:00
|
|
|
/// SimplifySRemInst - Given operands for an SRem, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-11-15 23:34:00 +01:00
|
|
|
Value *SimplifySRemInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-05-02 18:34:19 +02:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// SimplifyURemInst - Given operands for a URem, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyURemInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-05-02 18:34:19 +02:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// SimplifyFRemInst - Given operands for an FRem, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyFRemInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-05-02 18:34:19 +02:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2011-01-14 01:37:45 +01:00
|
|
|
/// SimplifyShlInst - Given operands for a Shl, see if we can
|
2010-12-21 15:00:22 +01:00
|
|
|
/// fold the result. If not, this returns null.
|
2011-02-09 18:15:04 +01:00
|
|
|
Value *SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
|
2012-11-15 23:34:00 +01:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2011-01-14 01:37:45 +01:00
|
|
|
|
|
|
|
/// SimplifyLShrInst - Given operands for a LShr, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2011-02-09 18:15:04 +01:00
|
|
|
Value *SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2011-01-14 01:37:45 +01:00
|
|
|
|
|
|
|
/// SimplifyAShrInst - Given operands for a AShr, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2011-02-09 18:15:04 +01:00
|
|
|
Value *SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-01-14 01:37:45 +01:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// SimplifyAndInst - Given operands for an And, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyAndInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-12-21 15:00:22 +01:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-10 01:55:12 +01:00
|
|
|
/// SimplifyOrInst - Given operands for an Or, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyOrInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-16 13:16:38 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2010-11-17 19:52:15 +01:00
|
|
|
/// SimplifyXorInst - Given operands for a Xor, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyXorInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-17 19:52:15 +01:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-10 00:28:39 +01:00
|
|
|
/// SimplifyICmpInst - Given operands for an ICmpInst, see if we can
|
2009-11-09 23:57:59 +01:00
|
|
|
/// fold the result. If not, this returns null.
|
2009-11-10 00:28:39 +01:00
|
|
|
Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
|
2012-11-15 23:34:00 +01:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-16 13:16:38 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2009-11-10 00:28:39 +01: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,
|
2012-11-15 23:34:00 +01:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-16 13:16:38 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2010-04-20 07:32:14 +02: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,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2012-03-13 12:42:19 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-16 13:16:38 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2009-11-10 00:28:39 +01:00
|
|
|
|
2009-11-27 01:29:05 +01:00
|
|
|
/// SimplifyGEPInst - Given operands for an GetElementPtrInst, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyGEPInst(ArrayRef<Value *> Ops, const DataLayout *TD = 0,
|
2012-03-13 12:42:19 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2011-09-05 08:52:48 +02:00
|
|
|
/// SimplifyInsertValueInst - Given operands for an InsertValueInst, see if we
|
|
|
|
/// can fold the result. If not, this returns null.
|
|
|
|
Value *SimplifyInsertValueInst(Value *Agg, Value *Val,
|
|
|
|
ArrayRef<unsigned> Idxs,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2012-03-13 12:42:19 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2011-09-05 08:52:48 +02:00
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2012-03-13 15:07:05 +01:00
|
|
|
/// SimplifyTruncInst - Given operands for an TruncInst, see if we can fold
|
|
|
|
/// the result. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyTruncInst(Value *Op, Type *Ty, const DataLayout *TD = 0,
|
2012-03-13 15:07:05 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-10 00:28:39 +01:00
|
|
|
//=== Helper functions for higher up the class hierarchy.
|
2010-11-14 12:23:23 +01:00
|
|
|
|
|
|
|
|
2009-11-10 00:28:39 +01: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,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2009-11-09 23:57:59 +01:00
|
|
|
/// SimplifyBinOp - Given operands for a BinaryOperator, see if we can
|
|
|
|
/// fold the result. If not, this returns null.
|
2010-11-14 12:23:23 +01:00
|
|
|
Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
|
2012-11-15 23:34:00 +01:00
|
|
|
const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
2012-12-28 12:30:55 +01:00
|
|
|
/// \brief Given a function and iterators over arguments, see if we can fold
|
|
|
|
/// the result.
|
|
|
|
///
|
|
|
|
/// If this call could not be simplified returns null.
|
2012-12-28 15:23:29 +01:00
|
|
|
Value *SimplifyCall(Value *V, User::op_iterator ArgBegin,
|
2012-12-28 12:30:55 +01:00
|
|
|
User::op_iterator ArgEnd, const DataLayout *TD = 0,
|
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// \brief Given a function and set of arguments, see if we can fold the
|
|
|
|
/// result.
|
|
|
|
///
|
|
|
|
/// If this call could not be simplified returns null.
|
2012-12-28 15:23:29 +01:00
|
|
|
Value *SimplifyCall(Value *V, ArrayRef<Value *> Args,
|
2012-12-28 12:30:55 +01:00
|
|
|
const DataLayout *TD = 0,
|
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
2009-11-10 02:08:51 +01:00
|
|
|
/// SimplifyInstruction - See if we can compute a simplified version of this
|
|
|
|
/// instruction. If not, this returns null.
|
2012-10-08 18:38:25 +02:00
|
|
|
Value *SimplifyInstruction(Instruction *I, const DataLayout *TD = 0,
|
2011-12-01 04:08:23 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
2010-11-14 19:36:10 +01:00
|
|
|
const DominatorTree *DT = 0);
|
2010-11-14 12:23:23 +01:00
|
|
|
|
|
|
|
|
2012-03-24 22:11:24 +01:00
|
|
|
/// \brief Replace all uses of 'I' with 'SimpleV' and simplify the uses
|
|
|
|
/// recursively.
|
2009-11-10 23:26:15 +01:00
|
|
|
///
|
2012-03-24 22:11:24 +01:00
|
|
|
/// This first performs a normal RAUW of I with SimpleV. It then recursively
|
|
|
|
/// attempts to simplify those users updated by the operation. The 'I'
|
|
|
|
/// instruction must not be equal to the simplified value 'SimpleV'.
|
|
|
|
///
|
|
|
|
/// The function returns true if any simplifications were performed.
|
|
|
|
bool replaceAndRecursivelySimplify(Instruction *I, Value *SimpleV,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2012-03-24 22:11:24 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
|
|
|
|
|
|
|
/// \brief Recursively attempt to simplify an instruction.
|
|
|
|
///
|
|
|
|
/// This routine uses SimplifyInstruction to simplify 'I', and if successful
|
|
|
|
/// replaces uses of 'I' with the simplified value. It then recurses on each
|
|
|
|
/// of the users impacted. It returns true if any simplifications were
|
|
|
|
/// performed.
|
|
|
|
bool recursivelySimplifyInstruction(Instruction *I,
|
2012-10-08 18:38:25 +02:00
|
|
|
const DataLayout *TD = 0,
|
2012-03-24 22:11:24 +01:00
|
|
|
const TargetLibraryInfo *TLI = 0,
|
|
|
|
const DominatorTree *DT = 0);
|
2009-11-09 23:57:59 +01:00
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|