2002-09-10 15:36:11 +00:00
|
|
|
//===-- llvm/Instruction.h - Instruction class definition -------*- C++ -*-===//
|
2005-04-21 20:19:05 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 20:19:05 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
// This file contains the declaration of the Instruction class, which is the
|
2002-09-06 21:31:57 +00:00
|
|
|
// base class for all of the LLVM instructions.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-01-10 00:45:19 +00:00
|
|
|
#ifndef LLVM_IR_INSTRUCTION_H
|
|
|
|
#define LLVM_IR_INSTRUCTION_H
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2014-01-28 16:56:46 +00:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
2008-07-28 21:51:04 +00:00
|
|
|
#include "llvm/ADT/ilist_node.h"
|
2014-03-05 10:30:38 +00:00
|
|
|
#include "llvm/IR/DebugLoc.h"
|
2015-04-02 00:03:07 +00:00
|
|
|
#include "llvm/IR/SymbolTableListTraits.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/User.h"
|
2003-06-30 21:59:07 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2012-12-09 21:12:04 +00:00
|
|
|
class FastMathFlags;
|
2009-08-11 17:45:13 +00:00
|
|
|
class LLVMContext;
|
2009-12-28 23:41:32 +00:00
|
|
|
class MDNode;
|
2015-04-02 00:03:07 +00:00
|
|
|
class BasicBlock;
|
2014-07-24 12:16:19 +00:00
|
|
|
struct AAMDNodes;
|
2009-07-09 23:48:35 +00:00
|
|
|
|
2015-04-02 00:03:07 +00:00
|
|
|
template <>
|
|
|
|
struct ilist_traits<Instruction>
|
|
|
|
: public SymbolTableListTraits<Instruction, BasicBlock> {
|
|
|
|
|
|
|
|
/// \brief Return a node that marks the end of a list.
|
|
|
|
///
|
|
|
|
/// The sentinel is relative to this instance, so we use a non-static
|
|
|
|
/// method.
|
|
|
|
Instruction *createSentinel() const;
|
|
|
|
static void destroySentinel(Instruction *) {}
|
|
|
|
|
|
|
|
Instruction *provideInitialHead() const { return createSentinel(); }
|
|
|
|
Instruction *ensureHead(Instruction *) const { return createSentinel(); }
|
|
|
|
static void noteHead(Instruction *, Instruction *) {}
|
|
|
|
|
|
|
|
private:
|
|
|
|
mutable ilist_half_node<Instruction> Sentinel;
|
|
|
|
};
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2008-07-28 21:51:04 +00:00
|
|
|
class Instruction : public User, public ilist_node<Instruction> {
|
2015-02-15 22:54:22 +00:00
|
|
|
void operator=(const Instruction &) = delete;
|
|
|
|
Instruction(const Instruction &) = delete;
|
2005-12-17 00:19:22 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
BasicBlock *Parent;
|
2010-04-02 20:21:22 +00:00
|
|
|
DebugLoc DbgLoc; // 'dbg' Metadata cache.
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-29 02:46:09 +00:00
|
|
|
enum {
|
|
|
|
/// HasMetadataBit - This is a bit stored in the SubClassData field which
|
|
|
|
/// indicates whether this instruction has metadata attached to it or not.
|
|
|
|
HasMetadataBit = 1 << 15
|
|
|
|
};
|
2001-06-06 20:29:01 +00:00
|
|
|
public:
|
2007-12-10 02:14:30 +00:00
|
|
|
// Out of line virtual method, so the vtable, etc has a home.
|
2015-04-11 02:11:45 +00:00
|
|
|
~Instruction() override;
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2014-03-09 03:16:01 +00:00
|
|
|
/// user_back - Specialize the methods defined in Value, as we know that an
|
2006-09-30 22:20:34 +00:00
|
|
|
/// instruction can only be used by other instructions.
|
2014-03-09 03:16:01 +00:00
|
|
|
Instruction *user_back() { return cast<Instruction>(*user_begin());}
|
|
|
|
const Instruction *user_back() const { return cast<Instruction>(*user_begin());}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
inline const BasicBlock *getParent() const { return Parent; }
|
|
|
|
inline BasicBlock *getParent() { return Parent; }
|
2002-06-25 16:12:52 +00:00
|
|
|
|
2015-03-03 22:01:13 +00:00
|
|
|
/// \brief Return the module owning the function this instruction belongs to
|
|
|
|
/// or nullptr it the function does not have a module.
|
|
|
|
///
|
|
|
|
/// Note: this is undefined behavior if the instruction does not have a
|
|
|
|
/// parent, or the parent basic block does not have a parent function.
|
|
|
|
const Module *getModule() const;
|
2014-02-25 23:25:17 +00:00
|
|
|
|
2004-10-11 22:21:13 +00:00
|
|
|
/// removeFromParent - This method unlinks 'this' from the containing basic
|
|
|
|
/// block, but does not delete it.
|
2003-02-24 20:48:32 +00:00
|
|
|
///
|
2004-10-11 22:21:13 +00:00
|
|
|
void removeFromParent();
|
|
|
|
|
|
|
|
/// eraseFromParent - This method unlinks 'this' from the containing basic
|
|
|
|
/// block and deletes it.
|
|
|
|
///
|
2015-04-02 00:03:07 +00:00
|
|
|
/// \returns an iterator pointing to the element after the erased one
|
|
|
|
iplist<Instruction>::iterator eraseFromParent();
|
2001-07-21 20:04:10 +00:00
|
|
|
|
2015-05-13 22:14:43 +00:00
|
|
|
/// Insert an unlinked instruction into a basic block immediately before
|
|
|
|
/// the specified instruction.
|
2008-06-17 18:29:27 +00:00
|
|
|
void insertBefore(Instruction *InsertPos);
|
|
|
|
|
2015-05-13 22:14:43 +00:00
|
|
|
/// Insert an unlinked instruction into a basic block immediately after the
|
|
|
|
/// specified instruction.
|
2009-01-13 07:43:51 +00:00
|
|
|
void insertAfter(Instruction *InsertPos);
|
|
|
|
|
2005-08-08 05:21:33 +00:00
|
|
|
/// moveBefore - Unlink this instruction from its current basic block and
|
|
|
|
/// insert it into the basic block that MovePos lives in, right before
|
|
|
|
/// MovePos.
|
|
|
|
void moveBefore(Instruction *MovePos);
|
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Subclass classification.
|
|
|
|
//===--------------------------------------------------------------------===//
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
/// getOpcode() returns a member of one of the enums like Instruction::Add.
|
2007-04-13 18:12:09 +00:00
|
|
|
unsigned getOpcode() const { return getValueID() - InstructionVal; }
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2007-12-10 22:18:53 +00:00
|
|
|
const char *getOpcodeName() const { return getOpcodeName(getOpcode()); }
|
|
|
|
bool isTerminator() const { return isTerminator(getOpcode()); }
|
|
|
|
bool isBinaryOp() const { return isBinaryOp(getOpcode()); }
|
|
|
|
bool isShift() { return isShift(getOpcode()); }
|
|
|
|
bool isCast() const { return isCast(getOpcode()); }
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2002-07-14 22:48:20 +00:00
|
|
|
static const char* getOpcodeName(unsigned OpCode);
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2004-06-07 17:53:43 +00:00
|
|
|
static inline bool isTerminator(unsigned OpCode) {
|
|
|
|
return OpCode >= TermOpsBegin && OpCode < TermOpsEnd;
|
|
|
|
}
|
|
|
|
|
2007-12-10 22:18:53 +00:00
|
|
|
static inline bool isBinaryOp(unsigned Opcode) {
|
|
|
|
return Opcode >= BinaryOpsBegin && Opcode < BinaryOpsEnd;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2007-02-02 02:16:23 +00:00
|
|
|
/// @brief Determine if the Opcode is one of the shift instructions.
|
|
|
|
static inline bool isShift(unsigned Opcode) {
|
|
|
|
return Opcode >= Shl && Opcode <= AShr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isLogicalShift - Return true if this is a logical shift left or a logical
|
|
|
|
/// shift right.
|
2008-04-09 18:31:41 +00:00
|
|
|
inline bool isLogicalShift() const {
|
2007-02-02 02:16:23 +00:00
|
|
|
return getOpcode() == Shl || getOpcode() == LShr;
|
|
|
|
}
|
|
|
|
|
2009-03-29 20:41:38 +00:00
|
|
|
/// isArithmeticShift - Return true if this is an arithmetic shift right.
|
2008-04-09 18:31:41 +00:00
|
|
|
inline bool isArithmeticShift() const {
|
2007-02-02 02:16:23 +00:00
|
|
|
return getOpcode() == AShr;
|
|
|
|
}
|
|
|
|
|
2006-11-27 01:05:10 +00:00
|
|
|
/// @brief Determine if the OpCode is one of the CastInst instructions.
|
|
|
|
static inline bool isCast(unsigned OpCode) {
|
|
|
|
return OpCode >= CastOpsBegin && OpCode < CastOpsEnd;
|
|
|
|
}
|
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Metadata manipulation.
|
|
|
|
//===--------------------------------------------------------------------===//
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
/// hasMetadata() - Return true if this instruction has any metadata attached
|
|
|
|
/// to it.
|
2015-03-30 19:40:05 +00:00
|
|
|
bool hasMetadata() const { return DbgLoc || hasMetadataHashEntry(); }
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2010-04-01 05:23:13 +00:00
|
|
|
/// hasMetadataOtherThanDebugLoc - Return true if this instruction has
|
|
|
|
/// metadata attached to it other than a debug location.
|
|
|
|
bool hasMetadataOtherThanDebugLoc() const {
|
|
|
|
return hasMetadataHashEntry();
|
2009-12-28 23:41:32 +00:00
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
/// getMetadata - Get the metadata of given kind attached to this Instruction.
|
|
|
|
/// If the metadata is not found then return null.
|
2014-11-11 21:30:22 +00:00
|
|
|
MDNode *getMetadata(unsigned KindID) const {
|
2014-04-09 06:08:46 +00:00
|
|
|
if (!hasMetadata()) return nullptr;
|
2009-12-28 23:41:32 +00:00
|
|
|
return getMetadataImpl(KindID);
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
/// getMetadata - Get the metadata of given kind attached to this Instruction.
|
|
|
|
/// If the metadata is not found then return null.
|
2014-11-11 21:30:22 +00:00
|
|
|
MDNode *getMetadata(StringRef Kind) const {
|
2014-04-09 06:08:46 +00:00
|
|
|
if (!hasMetadata()) return nullptr;
|
2009-12-28 23:41:32 +00:00
|
|
|
return getMetadataImpl(Kind);
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
/// getAllMetadata - Get all metadata attached to this Instruction. The first
|
|
|
|
/// element of each pair returned is the KindID, the second element is the
|
|
|
|
/// metadata value. This list is returned sorted by the KindID.
|
2014-11-01 00:26:42 +00:00
|
|
|
void
|
2014-11-11 21:30:22 +00:00
|
|
|
getAllMetadata(SmallVectorImpl<std::pair<unsigned, MDNode *>> &MDs) const {
|
2009-12-28 23:41:32 +00:00
|
|
|
if (hasMetadata())
|
|
|
|
getAllMetadataImpl(MDs);
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2010-04-01 05:23:13 +00:00
|
|
|
/// getAllMetadataOtherThanDebugLoc - This does the same thing as
|
|
|
|
/// getAllMetadata, except that it filters out the debug location.
|
2014-11-03 18:13:57 +00:00
|
|
|
void getAllMetadataOtherThanDebugLoc(
|
2014-11-11 21:30:22 +00:00
|
|
|
SmallVectorImpl<std::pair<unsigned, MDNode *>> &MDs) const {
|
2010-04-01 05:23:13 +00:00
|
|
|
if (hasMetadataOtherThanDebugLoc())
|
|
|
|
getAllMetadataOtherThanDebugLocImpl(MDs);
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2014-07-24 12:16:19 +00:00
|
|
|
/// getAAMetadata - Fills the AAMDNodes structure with AA metadata from
|
|
|
|
/// this instruction. When Merge is true, the existing AA metadata is
|
|
|
|
/// merged with that from this instruction providing the most-general result.
|
|
|
|
void getAAMetadata(AAMDNodes &N, bool Merge = false) const;
|
|
|
|
|
2010-02-10 16:03:48 +00:00
|
|
|
/// setMetadata - Set the metadata of the specified kind to the specified
|
2009-12-28 23:41:32 +00:00
|
|
|
/// node. This updates/replaces metadata if already present, or removes it if
|
2014-11-11 21:30:22 +00:00
|
|
|
/// Node is null.
|
|
|
|
void setMetadata(unsigned KindID, MDNode *Node);
|
|
|
|
void setMetadata(StringRef Kind, MDNode *Node);
|
2009-12-28 23:41:32 +00:00
|
|
|
|
2014-01-28 16:56:46 +00:00
|
|
|
/// \brief Drop unknown metadata.
|
|
|
|
/// Passes are required to drop metadata they don't understand. This is a
|
|
|
|
/// convenience method for passes to do so.
|
|
|
|
void dropUnknownMetadata(ArrayRef<unsigned> KnownIDs);
|
|
|
|
void dropUnknownMetadata() {
|
2014-08-27 05:25:25 +00:00
|
|
|
return dropUnknownMetadata(None);
|
2014-01-28 16:56:46 +00:00
|
|
|
}
|
|
|
|
void dropUnknownMetadata(unsigned ID1) {
|
|
|
|
return dropUnknownMetadata(makeArrayRef(ID1));
|
|
|
|
}
|
|
|
|
void dropUnknownMetadata(unsigned ID1, unsigned ID2) {
|
|
|
|
unsigned IDs[] = {ID1, ID2};
|
|
|
|
return dropUnknownMetadata(IDs);
|
|
|
|
}
|
|
|
|
|
2014-07-24 12:16:19 +00:00
|
|
|
/// setAAMetadata - Sets the metadata on this instruction from the
|
|
|
|
/// AAMDNodes structure.
|
|
|
|
void setAAMetadata(const AAMDNodes &N);
|
|
|
|
|
2010-04-01 05:23:13 +00:00
|
|
|
/// setDebugLoc - Set the debug location information for this instruction.
|
2015-02-07 12:28:15 +00:00
|
|
|
void setDebugLoc(DebugLoc Loc) { DbgLoc = std::move(Loc); }
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2010-04-01 05:23:13 +00:00
|
|
|
/// getDebugLoc - Return the debug location for this node as a DebugLoc.
|
2010-04-02 20:21:22 +00:00
|
|
|
const DebugLoc &getDebugLoc() const { return DbgLoc; }
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2012-11-27 00:41:22 +00:00
|
|
|
/// Set or clear the unsafe-algebra flag on this instruction, which must be an
|
|
|
|
/// operator which supports this flag. See LangRef.html for the meaning of
|
|
|
|
/// this flag.
|
|
|
|
void setHasUnsafeAlgebra(bool B);
|
|
|
|
|
|
|
|
/// Set or clear the no-nans flag on this instruction, which must be an
|
|
|
|
/// operator which supports this flag. See LangRef.html for the meaning of
|
|
|
|
/// this flag.
|
|
|
|
void setHasNoNaNs(bool B);
|
|
|
|
|
|
|
|
/// Set or clear the no-infs flag on this instruction, which must be an
|
|
|
|
/// operator which supports this flag. See LangRef.html for the meaning of
|
|
|
|
/// this flag.
|
|
|
|
void setHasNoInfs(bool B);
|
|
|
|
|
|
|
|
/// Set or clear the no-signed-zeros flag on this instruction, which must be
|
|
|
|
/// an operator which supports this flag. See LangRef.html for the meaning of
|
|
|
|
/// this flag.
|
|
|
|
void setHasNoSignedZeros(bool B);
|
|
|
|
|
|
|
|
/// Set or clear the allow-reciprocal flag on this instruction, which must be
|
|
|
|
/// an operator which supports this flag. See LangRef.html for the meaning of
|
|
|
|
/// this flag.
|
|
|
|
void setHasAllowReciprocal(bool B);
|
|
|
|
|
2014-09-02 20:03:00 +00:00
|
|
|
/// Convenience function for setting multiple fast-math flags on this
|
2012-11-27 00:41:22 +00:00
|
|
|
/// instruction, which must be an operator which supports these flags. See
|
2014-08-29 20:35:00 +00:00
|
|
|
/// LangRef.html for the meaning of these flags.
|
2012-11-27 00:41:22 +00:00
|
|
|
void setFastMathFlags(FastMathFlags FMF);
|
|
|
|
|
2014-09-02 20:03:00 +00:00
|
|
|
/// Convenience function for transferring all fast-math flag values to this
|
|
|
|
/// instruction, which must be an operator which supports these flags. See
|
|
|
|
/// LangRef.html for the meaning of these flags.
|
|
|
|
void copyFastMathFlags(FastMathFlags FMF);
|
|
|
|
|
2012-11-27 00:41:22 +00:00
|
|
|
/// Determine whether the unsafe-algebra flag is set.
|
|
|
|
bool hasUnsafeAlgebra() const;
|
|
|
|
|
|
|
|
/// Determine whether the no-NaNs flag is set.
|
|
|
|
bool hasNoNaNs() const;
|
|
|
|
|
|
|
|
/// Determine whether the no-infs flag is set.
|
|
|
|
bool hasNoInfs() const;
|
|
|
|
|
|
|
|
/// Determine whether the no-signed-zeros flag is set.
|
|
|
|
bool hasNoSignedZeros() const;
|
|
|
|
|
|
|
|
/// Determine whether the allow-reciprocal flag is set.
|
|
|
|
bool hasAllowReciprocal() const;
|
|
|
|
|
|
|
|
/// Convenience function for getting all the fast-math flags, which must be an
|
|
|
|
/// operator which supports these flags. See LangRef.html for the meaning of
|
2014-08-29 20:34:17 +00:00
|
|
|
/// these flags.
|
2012-11-27 00:41:22 +00:00
|
|
|
FastMathFlags getFastMathFlags() const;
|
|
|
|
|
2012-11-29 21:25:12 +00:00
|
|
|
/// Copy I's fast-math flags
|
|
|
|
void copyFastMathFlags(const Instruction *I);
|
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
private:
|
2010-03-30 23:03:27 +00:00
|
|
|
/// hasMetadataHashEntry - Return true if we have an entry in the on-the-side
|
|
|
|
/// metadata hash.
|
|
|
|
bool hasMetadataHashEntry() const {
|
|
|
|
return (getSubclassDataFromValue() & HasMetadataBit) != 0;
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 23:41:32 +00:00
|
|
|
// These are all implemented in Metadata.cpp.
|
2014-11-11 21:30:22 +00:00
|
|
|
MDNode *getMetadataImpl(unsigned KindID) const;
|
|
|
|
MDNode *getMetadataImpl(StringRef Kind) const;
|
2014-11-01 00:26:42 +00:00
|
|
|
void
|
2014-11-11 21:30:22 +00:00
|
|
|
getAllMetadataImpl(SmallVectorImpl<std::pair<unsigned, MDNode *>> &) const;
|
2014-11-03 18:13:57 +00:00
|
|
|
void getAllMetadataOtherThanDebugLocImpl(
|
2014-11-11 21:30:22 +00:00
|
|
|
SmallVectorImpl<std::pair<unsigned, MDNode *>> &) const;
|
2010-07-20 22:25:04 +00:00
|
|
|
void clearMetadataHashEntries();
|
2009-12-28 23:41:32 +00:00
|
|
|
public:
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Predicates and helper methods.
|
|
|
|
//===--------------------------------------------------------------------===//
|
2012-11-15 22:34:00 +00:00
|
|
|
|
|
|
|
|
2002-10-31 04:14:01 +00:00
|
|
|
/// isAssociative - Return true if the instruction is associative:
|
|
|
|
///
|
2003-07-28 16:53:28 +00:00
|
|
|
/// Associative operators satisfy: x op (y op z) === (x op y) op z
|
2002-10-31 04:14:01 +00:00
|
|
|
///
|
2010-12-20 13:10:23 +00:00
|
|
|
/// In LLVM, the Add, Mul, And, Or, and Xor operators are associative.
|
2002-10-31 04:14:01 +00:00
|
|
|
///
|
2012-11-29 01:47:31 +00:00
|
|
|
bool isAssociative() const;
|
2010-12-20 13:10:23 +00:00
|
|
|
static bool isAssociative(unsigned op);
|
2002-10-31 04:14:01 +00:00
|
|
|
|
|
|
|
/// isCommutative - Return true if the instruction is commutative:
|
|
|
|
///
|
2003-07-28 16:53:28 +00:00
|
|
|
/// Commutative operators satisfy: (x op y) === (y op x)
|
2002-10-31 04:14:01 +00:00
|
|
|
///
|
|
|
|
/// In LLVM, these are the associative operators, plus SetEQ and SetNE, when
|
|
|
|
/// applied to any type.
|
|
|
|
///
|
|
|
|
bool isCommutative() const { return isCommutative(getOpcode()); }
|
|
|
|
static bool isCommutative(unsigned op);
|
|
|
|
|
Now that Reassociate's LinearizeExprTree can look through arbitrary expression
topologies, it is quite possible for a leaf node to have huge multiplicity, for
example: x0 = x*x, x1 = x0*x0, x2 = x1*x1, ... rapidly gives a value which is x
raised to a vast power (the multiplicity, or weight, of x). This patch fixes
the computation of weights by correctly computing them no matter how big they
are, rather than just overflowing and getting a wrong value. It turns out that
the weight for a value never needs more bits to represent than the value itself,
so it is enough to represent weights as APInts of the same bitwidth and do the
right overflow-avoiding dance steps when computing weights. As a side-effect it
reduces the number of multiplies needed in some cases of large powers. While
there, in view of external uses (eg by the vectorizer) I made LinearizeExprTree
static, pushing the rank computation out into users. This is progress towards
fixing PR13021.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@158358 91177308-0d34-0410-b5e6-96231b3b80d8
2012-06-12 14:33:56 +00:00
|
|
|
/// isIdempotent - Return true if the instruction is idempotent:
|
|
|
|
///
|
|
|
|
/// Idempotent operators satisfy: x op x === x
|
|
|
|
///
|
|
|
|
/// In LLVM, the And and Or operators are idempotent.
|
|
|
|
///
|
|
|
|
bool isIdempotent() const { return isIdempotent(getOpcode()); }
|
|
|
|
static bool isIdempotent(unsigned op);
|
|
|
|
|
|
|
|
/// isNilpotent - Return true if the instruction is nilpotent:
|
|
|
|
///
|
|
|
|
/// Nilpotent operators satisfy: x op x === Id,
|
|
|
|
///
|
|
|
|
/// where Id is the identity for the operator, i.e. a constant such that
|
|
|
|
/// x op Id === x and Id op x === x for all x.
|
|
|
|
///
|
|
|
|
/// In LLVM, the Xor operator is nilpotent.
|
|
|
|
///
|
|
|
|
bool isNilpotent() const { return isNilpotent(getOpcode()); }
|
|
|
|
static bool isNilpotent(unsigned op);
|
|
|
|
|
2009-05-06 06:49:50 +00:00
|
|
|
/// mayWriteToMemory - Return true if this instruction may modify memory.
|
|
|
|
///
|
|
|
|
bool mayWriteToMemory() const;
|
|
|
|
|
|
|
|
/// mayReadFromMemory - Return true if this instruction may read memory.
|
|
|
|
///
|
|
|
|
bool mayReadFromMemory() const;
|
|
|
|
|
2011-07-27 00:46:46 +00:00
|
|
|
/// mayReadOrWriteMemory - Return true if this instruction may read or
|
|
|
|
/// write memory.
|
|
|
|
///
|
|
|
|
bool mayReadOrWriteMemory() const {
|
|
|
|
return mayReadFromMemory() || mayWriteToMemory();
|
|
|
|
}
|
|
|
|
|
2014-09-03 21:29:59 +00:00
|
|
|
/// isAtomic - Return true if this instruction has an
|
|
|
|
/// AtomicOrdering of unordered or higher.
|
|
|
|
///
|
|
|
|
bool isAtomic() const;
|
|
|
|
|
2009-05-06 06:49:50 +00:00
|
|
|
/// mayThrow - Return true if this instruction may throw an exception.
|
|
|
|
///
|
|
|
|
bool mayThrow() const;
|
|
|
|
|
2013-02-19 20:02:09 +00:00
|
|
|
/// mayReturn - Return true if this is a function that may return.
|
|
|
|
/// this is true for all normal instructions. The only exception
|
|
|
|
/// is functions that are marked with the 'noreturn' attribute.
|
|
|
|
///
|
|
|
|
bool mayReturn() const;
|
|
|
|
|
2009-05-06 06:49:50 +00:00
|
|
|
/// mayHaveSideEffects - Return true if the instruction may have side effects.
|
|
|
|
///
|
2009-07-17 08:38:29 +00:00
|
|
|
/// Note that this does not consider malloc and alloca to have side
|
|
|
|
/// effects because the newly allocated memory is completely invisible to
|
|
|
|
/// instructions which don't used the returned value. For cases where this
|
|
|
|
/// matters, isSafeToSpeculativelyExecute may be more appropriate.
|
2009-05-06 06:49:50 +00:00
|
|
|
bool mayHaveSideEffects() const {
|
2013-02-19 20:02:09 +00:00
|
|
|
return mayWriteToMemory() || mayThrow() || !mayReturn();
|
2009-05-06 06:49:50 +00:00
|
|
|
}
|
|
|
|
|
2009-12-28 21:56:07 +00:00
|
|
|
/// clone() - Create a copy of 'this' instruction that is identical in all
|
|
|
|
/// ways except the following:
|
|
|
|
/// * The instruction has no parent
|
|
|
|
/// * The instruction has no name
|
|
|
|
///
|
|
|
|
Instruction *clone() const;
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 21:56:07 +00:00
|
|
|
/// isIdenticalTo - Return true if the specified instruction is exactly
|
|
|
|
/// identical to the current one. This means that all operands match and any
|
|
|
|
/// extra information (e.g. load is volatile) agree.
|
|
|
|
bool isIdenticalTo(const Instruction *I) const;
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 21:56:07 +00:00
|
|
|
/// isIdenticalToWhenDefined - This is like isIdenticalTo, except that it
|
|
|
|
/// ignores the SubclassOptionalData flags, which specify conditions
|
|
|
|
/// under which the instruction's result is undefined.
|
|
|
|
bool isIdenticalToWhenDefined(const Instruction *I) const;
|
2012-06-28 05:42:26 +00:00
|
|
|
|
|
|
|
/// When checking for operation equivalence (using isSameOperationAs) it is
|
|
|
|
/// sometimes useful to ignore certain attributes.
|
|
|
|
enum OperationEquivalenceFlags {
|
|
|
|
/// Check for equivalence ignoring load/store alignment.
|
|
|
|
CompareIgnoringAlignment = 1<<0,
|
|
|
|
/// Check for equivalence treating a type and a vector of that type
|
|
|
|
/// as equivalent.
|
|
|
|
CompareUsingScalarTypes = 1<<1
|
|
|
|
};
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 21:56:07 +00:00
|
|
|
/// This function determines if the specified instruction executes the same
|
|
|
|
/// operation as the current one. This means that the opcodes, type, operand
|
|
|
|
/// types and any other factors affecting the operation must be the same. This
|
|
|
|
/// is similar to isIdenticalTo except the operands themselves don't have to
|
|
|
|
/// be identical.
|
|
|
|
/// @returns true if the specified instruction is the same operation as
|
|
|
|
/// the current one.
|
|
|
|
/// @brief Determine if one instruction is the same operation as another.
|
2012-06-28 05:42:26 +00:00
|
|
|
bool isSameOperationAs(const Instruction *I, unsigned flags = 0) const;
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-28 21:56:07 +00:00
|
|
|
/// isUsedOutsideOfBlock - Return true if there are any uses of this
|
|
|
|
/// instruction in blocks other than the specified block. Note that PHI nodes
|
|
|
|
/// are considered to evaluate their operands in the corresponding predecessor
|
|
|
|
/// block.
|
|
|
|
bool isUsedOutsideOfBlock(const BasicBlock *BB) const;
|
2012-11-15 22:34:00 +00:00
|
|
|
|
|
|
|
|
2002-08-25 22:54:55 +00:00
|
|
|
/// Methods for support type inquiry through isa, cast, and dyn_cast:
|
2001-10-02 03:41:24 +00:00
|
|
|
static inline bool classof(const Value *V) {
|
2007-04-13 18:12:09 +00:00
|
|
|
return V->getValueID() >= Value::InstructionVal;
|
2001-10-01 13:58:13 +00:00
|
|
|
}
|
2005-04-21 20:19:05 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
//----------------------------------------------------------------------
|
2009-12-28 21:56:07 +00:00
|
|
|
// Exported enumerations.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
enum TermOps { // These terminate basic blocks
|
2002-10-13 19:39:16 +00:00
|
|
|
#define FIRST_TERM_INST(N) TermOpsBegin = N,
|
2001-10-14 17:24:50 +00:00
|
|
|
#define HANDLE_TERM_INST(N, OPC, CLASS) OPC = N,
|
2005-03-07 20:35:45 +00:00
|
|
|
#define LAST_TERM_INST(N) TermOpsEnd = N+1
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Instruction.def"
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
enum BinaryOps {
|
2002-10-13 19:39:16 +00:00
|
|
|
#define FIRST_BINARY_INST(N) BinaryOpsBegin = N,
|
2001-10-14 17:24:50 +00:00
|
|
|
#define HANDLE_BINARY_INST(N, OPC, CLASS) OPC = N,
|
2005-03-07 20:35:45 +00:00
|
|
|
#define LAST_BINARY_INST(N) BinaryOpsEnd = N+1
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Instruction.def"
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
enum MemoryOps {
|
2002-10-13 19:39:16 +00:00
|
|
|
#define FIRST_MEMORY_INST(N) MemoryOpsBegin = N,
|
2001-10-14 17:24:50 +00:00
|
|
|
#define HANDLE_MEMORY_INST(N, OPC, CLASS) OPC = N,
|
2005-03-07 20:35:45 +00:00
|
|
|
#define LAST_MEMORY_INST(N) MemoryOpsEnd = N+1
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Instruction.def"
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
|
|
|
|
2006-11-27 01:05:10 +00:00
|
|
|
enum CastOps {
|
|
|
|
#define FIRST_CAST_INST(N) CastOpsBegin = N,
|
|
|
|
#define HANDLE_CAST_INST(N, OPC, CLASS) OPC = N,
|
|
|
|
#define LAST_CAST_INST(N) CastOpsEnd = N+1
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Instruction.def"
|
2006-11-27 01:05:10 +00:00
|
|
|
};
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
enum OtherOps {
|
2002-10-13 19:39:16 +00:00
|
|
|
#define FIRST_OTHER_INST(N) OtherOpsBegin = N,
|
2001-10-14 17:24:50 +00:00
|
|
|
#define HANDLE_OTHER_INST(N, OPC, CLASS) OPC = N,
|
2005-03-07 20:35:45 +00:00
|
|
|
#define LAST_OTHER_INST(N) OtherOpsEnd = N+1
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Instruction.def"
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
2009-12-29 02:46:09 +00:00
|
|
|
private:
|
|
|
|
// Shadow Value::setValueSubclassData with a private forwarding method so that
|
|
|
|
// subclasses cannot accidentally use it.
|
|
|
|
void setValueSubclassData(unsigned short D) {
|
|
|
|
Value::setValueSubclassData(D);
|
|
|
|
}
|
|
|
|
unsigned short getSubclassDataFromValue() const {
|
|
|
|
return Value::getSubclassDataFromValue();
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2010-03-30 23:03:27 +00:00
|
|
|
void setHasMetadataHashEntry(bool V) {
|
2009-12-29 02:46:09 +00:00
|
|
|
setValueSubclassData((getSubclassDataFromValue() & ~HasMetadataBit) |
|
|
|
|
(V ? HasMetadataBit : 0));
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-29 02:46:09 +00:00
|
|
|
friend class SymbolTableListTraits<Instruction, BasicBlock>;
|
|
|
|
void setParent(BasicBlock *P);
|
|
|
|
protected:
|
|
|
|
// Instruction subclasses can stick up to 15 bits of stuff into the
|
|
|
|
// SubclassData field of instruction with these members.
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-29 02:46:09 +00:00
|
|
|
// Verify that only the low 15 bits are used.
|
|
|
|
void setInstructionSubclassData(unsigned short D) {
|
|
|
|
assert((D & HasMetadataBit) == 0 && "Out of range value put into field");
|
|
|
|
setValueSubclassData((getSubclassDataFromValue() & HasMetadataBit) | D);
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2009-12-29 02:46:09 +00:00
|
|
|
unsigned getSubclassDataFromInstruction() const {
|
|
|
|
return getSubclassDataFromValue() & ~HasMetadataBit;
|
|
|
|
}
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2011-07-18 04:54:35 +00:00
|
|
|
Instruction(Type *Ty, unsigned iType, Use *Ops, unsigned NumOps,
|
2014-04-09 06:08:46 +00:00
|
|
|
Instruction *InsertBefore = nullptr);
|
2011-07-18 04:54:35 +00:00
|
|
|
Instruction(Type *Ty, unsigned iType, Use *Ops, unsigned NumOps,
|
2009-12-29 02:46:09 +00:00
|
|
|
BasicBlock *InsertAtEnd);
|
|
|
|
virtual Instruction *clone_impl() const = 0;
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
};
|
|
|
|
|
2015-04-02 00:03:15 +00:00
|
|
|
inline Instruction *ilist_traits<Instruction>::createSentinel() const {
|
2015-04-02 00:03:07 +00:00
|
|
|
// Since i(p)lists always publicly derive from their corresponding traits,
|
|
|
|
// placing a data member in this class will augment the i(p)list. But since
|
|
|
|
// the NodeTy is expected to be publicly derive from ilist_node<NodeTy>,
|
|
|
|
// there is a legal viable downcast from it to NodeTy. We use this trick to
|
|
|
|
// superimpose an i(p)list with a "ghostly" NodeTy, which becomes the
|
|
|
|
// sentinel. Dereferencing the sentinel is forbidden (save the
|
|
|
|
// ilist_node<NodeTy>), so no one will ever notice the superposition.
|
|
|
|
return static_cast<Instruction *>(&Sentinel);
|
|
|
|
}
|
|
|
|
|
2009-03-29 04:32:37 +00:00
|
|
|
// Instruction* is only 4-byte aligned.
|
|
|
|
template<>
|
|
|
|
class PointerLikeTypeTraits<Instruction*> {
|
|
|
|
typedef Instruction* PT;
|
|
|
|
public:
|
|
|
|
static inline void *getAsVoidPointer(PT P) { return P; }
|
|
|
|
static inline PT getFromVoidPointer(void *P) {
|
|
|
|
return static_cast<PT>(P);
|
|
|
|
}
|
|
|
|
enum { NumLowBitsAvailable = 2 };
|
|
|
|
};
|
2012-11-15 22:34:00 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2001-06-06 20:29:01 +00:00
|
|
|
#endif
|