2012-10-04 23:01:22 +00:00
|
|
|
//===--------- llvm/DataLayout.h - Data size & alignment info ---*- C++ -*-===//
|
2012-10-04 22:08:14 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2012-10-04 23:01:22 +00:00
|
|
|
// This file defines layout properties related to datatype size/offset/alignment
|
2012-10-04 22:08:14 +00:00
|
|
|
// information. It uses lazy annotations to cache information about how
|
|
|
|
// structure types are laid out and used.
|
|
|
|
//
|
|
|
|
// This structure should be created once, filled in if the defaults are not
|
|
|
|
// correct and then passed around by const&. None of the members functions
|
|
|
|
// require modification to the object.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-01-10 00:45:19 +00:00
|
|
|
#ifndef LLVM_IR_DATALAYOUT_H
|
|
|
|
#define LLVM_IR_DATALAYOUT_H
|
2012-10-04 22:08:14 +00:00
|
|
|
|
2012-10-09 16:06:12 +00:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2012-12-03 17:02:12 +00:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2013-03-21 09:52:22 +00:00
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
|
|
|
#include "llvm/IR/Type.h"
|
2012-12-03 17:02:12 +00:00
|
|
|
#include "llvm/Pass.h"
|
2012-10-04 22:08:14 +00:00
|
|
|
#include "llvm/Support/DataTypes.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
class Value;
|
|
|
|
class Type;
|
|
|
|
class IntegerType;
|
|
|
|
class StructType;
|
|
|
|
class StructLayout;
|
|
|
|
class GlobalVariable;
|
|
|
|
class LLVMContext;
|
|
|
|
template<typename T>
|
|
|
|
class ArrayRef;
|
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Enum used to categorize the alignment types stored by LayoutAlignElem
|
2012-10-04 22:08:14 +00:00
|
|
|
enum AlignTypeEnum {
|
2012-12-20 04:02:58 +00:00
|
|
|
INVALID_ALIGN = 0, ///< An invalid alignment
|
2012-10-04 22:08:14 +00:00
|
|
|
INTEGER_ALIGN = 'i', ///< Integer type alignment
|
|
|
|
VECTOR_ALIGN = 'v', ///< Vector type alignment
|
|
|
|
FLOAT_ALIGN = 'f', ///< Floating point type alignment
|
|
|
|
AGGREGATE_ALIGN = 'a', ///< Aggregate alignment
|
|
|
|
STACK_ALIGN = 's' ///< Stack objects alignment
|
|
|
|
};
|
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Layout alignment element.
|
2012-10-04 22:08:14 +00:00
|
|
|
///
|
2012-10-09 16:06:12 +00:00
|
|
|
/// Stores the alignment data associated with a given alignment type (integer,
|
|
|
|
/// vector, float) and type bit width.
|
2012-10-04 22:08:14 +00:00
|
|
|
///
|
|
|
|
/// @note The unusual order of elements in the structure attempts to reduce
|
|
|
|
/// padding and make the structure slightly more cache friendly.
|
2012-10-04 23:01:22 +00:00
|
|
|
struct LayoutAlignElem {
|
2012-10-04 22:08:14 +00:00
|
|
|
unsigned AlignType : 8; ///< Alignment type (AlignTypeEnum)
|
|
|
|
unsigned TypeBitWidth : 24; ///< Type bit width
|
|
|
|
unsigned ABIAlign : 16; ///< ABI alignment for this type/bitw
|
|
|
|
unsigned PrefAlign : 16; ///< Pref. alignment for this type/bitw
|
|
|
|
|
|
|
|
/// Initializer
|
2012-10-04 23:01:22 +00:00
|
|
|
static LayoutAlignElem get(AlignTypeEnum align_type, unsigned abi_align,
|
2012-10-04 22:08:14 +00:00
|
|
|
unsigned pref_align, uint32_t bit_width);
|
|
|
|
/// Equality predicate
|
2012-10-04 23:01:22 +00:00
|
|
|
bool operator==(const LayoutAlignElem &rhs) const;
|
2012-10-04 22:08:14 +00:00
|
|
|
};
|
|
|
|
|
2012-10-09 16:06:12 +00:00
|
|
|
/// Layout pointer alignment element.
|
|
|
|
///
|
|
|
|
/// Stores the alignment data associated with a given pointer and address space.
|
|
|
|
///
|
|
|
|
/// @note The unusual order of elements in the structure attempts to reduce
|
|
|
|
/// padding and make the structure slightly more cache friendly.
|
|
|
|
struct PointerAlignElem {
|
|
|
|
unsigned ABIAlign; ///< ABI alignment for this type/bitw
|
|
|
|
unsigned PrefAlign; ///< Pref. alignment for this type/bitw
|
|
|
|
uint32_t TypeBitWidth; ///< Type bit width
|
|
|
|
uint32_t AddressSpace; ///< Address space for the pointer type
|
|
|
|
|
|
|
|
/// Initializer
|
|
|
|
static PointerAlignElem get(uint32_t addr_space, unsigned abi_align,
|
|
|
|
unsigned pref_align, uint32_t bit_width);
|
|
|
|
/// Equality predicate
|
|
|
|
bool operator==(const PointerAlignElem &rhs) const;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
/// DataLayout - This class holds a parsed version of the target data layout
|
2012-10-04 22:08:14 +00:00
|
|
|
/// string in a module and provides methods for querying it. The target data
|
|
|
|
/// layout string is specified *by the target* - a frontend generating LLVM IR
|
|
|
|
/// is required to generate the right target data for the target being codegen'd
|
|
|
|
/// to. If some measure of portability is desired, an empty string may be
|
|
|
|
/// specified in the module.
|
2012-10-04 23:01:22 +00:00
|
|
|
class DataLayout : public ImmutablePass {
|
2012-10-04 22:08:14 +00:00
|
|
|
private:
|
|
|
|
bool LittleEndian; ///< Defaults to false
|
|
|
|
unsigned StackNaturalAlign; ///< Stack natural alignment
|
|
|
|
|
|
|
|
SmallVector<unsigned char, 8> LegalIntWidths; ///< Legal Integers.
|
|
|
|
|
2013-01-30 19:24:23 +00:00
|
|
|
/// Alignments - Where the primitive type alignment data is stored.
|
2012-10-04 22:08:14 +00:00
|
|
|
///
|
|
|
|
/// @sa init().
|
|
|
|
/// @note Could support multiple size pointer alignments, e.g., 32-bit
|
2012-10-04 23:01:22 +00:00
|
|
|
/// pointers vs. 64-bit pointers by extending LayoutAlignment, but for now,
|
2012-10-04 22:08:14 +00:00
|
|
|
/// we don't.
|
2012-10-04 23:01:22 +00:00
|
|
|
SmallVector<LayoutAlignElem, 16> Alignments;
|
2012-10-09 16:06:12 +00:00
|
|
|
DenseMap<unsigned, PointerAlignElem> Pointers;
|
2012-10-04 22:08:14 +00:00
|
|
|
|
|
|
|
/// InvalidAlignmentElem - This member is a signal that a requested alignment
|
|
|
|
/// type and bit width were not found in the SmallVector.
|
2012-10-04 23:01:22 +00:00
|
|
|
static const LayoutAlignElem InvalidAlignmentElem;
|
2012-10-04 22:08:14 +00:00
|
|
|
|
2012-10-09 16:06:12 +00:00
|
|
|
/// InvalidPointerElem - This member is a signal that a requested pointer
|
|
|
|
/// type and bit width were not found in the DenseSet.
|
|
|
|
static const PointerAlignElem InvalidPointerElem;
|
|
|
|
|
2012-10-04 22:08:14 +00:00
|
|
|
// The StructType -> StructLayout map.
|
|
|
|
mutable void *LayoutMap;
|
|
|
|
|
|
|
|
//! Set/initialize target alignments
|
|
|
|
void setAlignment(AlignTypeEnum align_type, unsigned abi_align,
|
|
|
|
unsigned pref_align, uint32_t bit_width);
|
|
|
|
unsigned getAlignmentInfo(AlignTypeEnum align_type, uint32_t bit_width,
|
|
|
|
bool ABIAlign, Type *Ty) const;
|
2012-10-09 16:06:12 +00:00
|
|
|
|
|
|
|
//! Set/initialize pointer alignments
|
|
|
|
void setPointerAlignment(uint32_t addr_space, unsigned abi_align,
|
|
|
|
unsigned pref_align, uint32_t bit_width);
|
|
|
|
|
2012-10-04 22:08:14 +00:00
|
|
|
//! Internal helper method that returns requested alignment for type.
|
|
|
|
unsigned getAlignment(Type *Ty, bool abi_or_pref) const;
|
|
|
|
|
|
|
|
/// Valid alignment predicate.
|
|
|
|
///
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Predicate that tests a LayoutAlignElem reference returned by get() against
|
2012-10-04 22:08:14 +00:00
|
|
|
/// InvalidAlignmentElem.
|
2012-10-04 23:01:22 +00:00
|
|
|
bool validAlignment(const LayoutAlignElem &align) const {
|
2012-10-04 22:08:14 +00:00
|
|
|
return &align != &InvalidAlignmentElem;
|
|
|
|
}
|
|
|
|
|
2012-10-09 16:06:12 +00:00
|
|
|
/// Valid pointer predicate.
|
|
|
|
///
|
|
|
|
/// Predicate that tests a PointerAlignElem reference returned by get() against
|
|
|
|
/// InvalidPointerElem.
|
|
|
|
bool validPointer(const PointerAlignElem &align) const {
|
|
|
|
return &align != &InvalidPointerElem;
|
|
|
|
}
|
|
|
|
|
2012-11-30 10:06:59 +00:00
|
|
|
/// Parses a target data specification string. Assert if the string is
|
|
|
|
/// malformed.
|
|
|
|
void parseSpecifier(StringRef LayoutDescription);
|
2012-10-04 22:08:14 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
/// Default ctor.
|
|
|
|
///
|
|
|
|
/// @note This has to exist, because this is a pass, but it should never be
|
|
|
|
/// used.
|
2012-10-04 23:01:22 +00:00
|
|
|
DataLayout();
|
2012-10-04 22:08:14 +00:00
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Constructs a DataLayout from a specification string. See init().
|
|
|
|
explicit DataLayout(StringRef LayoutDescription)
|
2012-10-04 22:08:14 +00:00
|
|
|
: ImmutablePass(ID) {
|
2012-11-14 09:04:56 +00:00
|
|
|
init(LayoutDescription);
|
2012-10-04 22:08:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Initialize target data from properties stored in the module.
|
2012-10-04 23:01:22 +00:00
|
|
|
explicit DataLayout(const Module *M);
|
2012-10-04 22:08:14 +00:00
|
|
|
|
2013-04-16 15:41:18 +00:00
|
|
|
DataLayout(const DataLayout &DL) :
|
2012-10-04 22:08:14 +00:00
|
|
|
ImmutablePass(ID),
|
2013-04-16 15:41:18 +00:00
|
|
|
LittleEndian(DL.isLittleEndian()),
|
|
|
|
StackNaturalAlign(DL.StackNaturalAlign),
|
|
|
|
LegalIntWidths(DL.LegalIntWidths),
|
|
|
|
Alignments(DL.Alignments),
|
|
|
|
Pointers(DL.Pointers),
|
2012-10-04 22:08:14 +00:00
|
|
|
LayoutMap(0)
|
|
|
|
{ }
|
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
~DataLayout(); // Not virtual, do not subclass this class
|
2012-10-04 22:08:14 +00:00
|
|
|
|
2013-03-12 17:37:31 +00:00
|
|
|
/// DataLayout is an immutable pass, but holds state. This allows the pass
|
|
|
|
/// manager to clear its mutable state.
|
|
|
|
bool doFinalization(Module &M);
|
|
|
|
|
2012-11-14 09:04:56 +00:00
|
|
|
/// Parse a data layout string (with fallback to default values). Ensure that
|
|
|
|
/// the data layout pass is registered.
|
|
|
|
void init(StringRef LayoutDescription);
|
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Layout endianness...
|
2012-10-04 22:08:14 +00:00
|
|
|
bool isLittleEndian() const { return LittleEndian; }
|
|
|
|
bool isBigEndian() const { return !LittleEndian; }
|
|
|
|
|
|
|
|
/// getStringRepresentation - Return the string representation of the
|
2012-10-04 23:01:22 +00:00
|
|
|
/// DataLayout. This representation is in the same format accepted by the
|
2012-10-04 22:08:14 +00:00
|
|
|
/// string constructor above.
|
|
|
|
std::string getStringRepresentation() const;
|
|
|
|
|
|
|
|
/// isLegalInteger - This function returns true if the specified type is
|
|
|
|
/// known to be a native integer type supported by the CPU. For example,
|
|
|
|
/// i64 is not native on most 32-bit CPUs and i37 is not native on any known
|
|
|
|
/// one. This returns false if the integer width is not legal.
|
|
|
|
///
|
|
|
|
/// The width is specified in bits.
|
|
|
|
///
|
|
|
|
bool isLegalInteger(unsigned Width) const {
|
|
|
|
for (unsigned i = 0, e = (unsigned)LegalIntWidths.size(); i != e; ++i)
|
|
|
|
if (LegalIntWidths[i] == Width)
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isIllegalInteger(unsigned Width) const {
|
|
|
|
return !isLegalInteger(Width);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Returns true if the given alignment exceeds the natural stack alignment.
|
|
|
|
bool exceedsNaturalStackAlignment(unsigned Align) const {
|
|
|
|
return (StackNaturalAlign != 0) && (Align > StackNaturalAlign);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// fitsInLegalInteger - This function returns true if the specified type fits
|
|
|
|
/// in a native integer type supported by the CPU. For example, if the CPU
|
|
|
|
/// only supports i32 as a native integer type, then i27 fits in a legal
|
|
|
|
// integer type but i45 does not.
|
|
|
|
bool fitsInLegalInteger(unsigned Width) const {
|
|
|
|
for (unsigned i = 0, e = (unsigned)LegalIntWidths.size(); i != e; ++i)
|
|
|
|
if (Width <= LegalIntWidths[i])
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Layout pointer alignment
|
Revert the majority of the next patch in the address space series:
r165941: Resubmit the changes to llvm core to update the functions to
support different pointer sizes on a per address space basis.
Despite this commit log, this change primarily changed stuff outside of
VMCore, and those changes do not carry any tests for correctness (or
even plausibility), and we have consistently found questionable or flat
out incorrect cases in these changes. Most of them are probably correct,
but we need to devise a system that makes it more clear when we have
handled the address space concerns correctly, and ideally each pass that
gets updated would receive an accompanying test case that exercises that
pass specificaly w.r.t. alternate address spaces.
However, from this commit, I have retained the new C API entry points.
Those were an orthogonal change that probably should have been split
apart, but they seem entirely good.
In several places the changes were very obvious cleanups with no actual
multiple address space code added; these I have not reverted when
I spotted them.
In a few other places there were merge conflicts due to a cleaner
solution being implemented later, often not using address spaces at all.
In those cases, I've preserved the new code which isn't address space
dependent.
This is part of my ongoing effort to clean out the partial address space
code which carries high risk and low test coverage, and not likely to be
finished before the 3.2 release looms closer. Duncan and I would both
like to see the above issues addressed before we return to these
changes.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167222 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-01 09:14:31 +00:00
|
|
|
/// FIXME: The defaults need to be removed once all of
|
|
|
|
/// the backends/clients are updated.
|
2013-06-28 23:24:05 +00:00
|
|
|
unsigned getPointerABIAlignment(unsigned AS = 0) const {
|
2012-10-09 16:06:12 +00:00
|
|
|
DenseMap<unsigned, PointerAlignElem>::const_iterator val = Pointers.find(AS);
|
|
|
|
if (val == Pointers.end()) {
|
|
|
|
val = Pointers.find(0);
|
|
|
|
}
|
|
|
|
return val->second.ABIAlign;
|
|
|
|
}
|
2013-06-28 23:24:05 +00:00
|
|
|
|
2012-10-09 16:06:12 +00:00
|
|
|
/// Return target's alignment for stack-based pointers
|
Revert the majority of the next patch in the address space series:
r165941: Resubmit the changes to llvm core to update the functions to
support different pointer sizes on a per address space basis.
Despite this commit log, this change primarily changed stuff outside of
VMCore, and those changes do not carry any tests for correctness (or
even plausibility), and we have consistently found questionable or flat
out incorrect cases in these changes. Most of them are probably correct,
but we need to devise a system that makes it more clear when we have
handled the address space concerns correctly, and ideally each pass that
gets updated would receive an accompanying test case that exercises that
pass specificaly w.r.t. alternate address spaces.
However, from this commit, I have retained the new C API entry points.
Those were an orthogonal change that probably should have been split
apart, but they seem entirely good.
In several places the changes were very obvious cleanups with no actual
multiple address space code added; these I have not reverted when
I spotted them.
In a few other places there were merge conflicts due to a cleaner
solution being implemented later, often not using address spaces at all.
In those cases, I've preserved the new code which isn't address space
dependent.
This is part of my ongoing effort to clean out the partial address space
code which carries high risk and low test coverage, and not likely to be
finished before the 3.2 release looms closer. Duncan and I would both
like to see the above issues addressed before we return to these
changes.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167222 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-01 09:14:31 +00:00
|
|
|
/// FIXME: The defaults need to be removed once all of
|
|
|
|
/// the backends/clients are updated.
|
|
|
|
unsigned getPointerPrefAlignment(unsigned AS = 0) const {
|
2012-10-09 16:06:12 +00:00
|
|
|
DenseMap<unsigned, PointerAlignElem>::const_iterator val = Pointers.find(AS);
|
|
|
|
if (val == Pointers.end()) {
|
|
|
|
val = Pointers.find(0);
|
|
|
|
}
|
|
|
|
return val->second.PrefAlign;
|
|
|
|
}
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Layout pointer size
|
Revert the majority of the next patch in the address space series:
r165941: Resubmit the changes to llvm core to update the functions to
support different pointer sizes on a per address space basis.
Despite this commit log, this change primarily changed stuff outside of
VMCore, and those changes do not carry any tests for correctness (or
even plausibility), and we have consistently found questionable or flat
out incorrect cases in these changes. Most of them are probably correct,
but we need to devise a system that makes it more clear when we have
handled the address space concerns correctly, and ideally each pass that
gets updated would receive an accompanying test case that exercises that
pass specificaly w.r.t. alternate address spaces.
However, from this commit, I have retained the new C API entry points.
Those were an orthogonal change that probably should have been split
apart, but they seem entirely good.
In several places the changes were very obvious cleanups with no actual
multiple address space code added; these I have not reverted when
I spotted them.
In a few other places there were merge conflicts due to a cleaner
solution being implemented later, often not using address spaces at all.
In those cases, I've preserved the new code which isn't address space
dependent.
This is part of my ongoing effort to clean out the partial address space
code which carries high risk and low test coverage, and not likely to be
finished before the 3.2 release looms closer. Duncan and I would both
like to see the above issues addressed before we return to these
changes.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167222 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-01 09:14:31 +00:00
|
|
|
/// FIXME: The defaults need to be removed once all of
|
|
|
|
/// the backends/clients are updated.
|
2013-06-28 23:24:05 +00:00
|
|
|
unsigned getPointerSize(unsigned AS = 0) const {
|
2012-10-09 16:06:12 +00:00
|
|
|
DenseMap<unsigned, PointerAlignElem>::const_iterator val = Pointers.find(AS);
|
|
|
|
if (val == Pointers.end()) {
|
|
|
|
val = Pointers.find(0);
|
|
|
|
}
|
|
|
|
return val->second.TypeBitWidth;
|
|
|
|
}
|
2012-10-04 23:01:22 +00:00
|
|
|
/// Layout pointer size, in bits
|
Revert the majority of the next patch in the address space series:
r165941: Resubmit the changes to llvm core to update the functions to
support different pointer sizes on a per address space basis.
Despite this commit log, this change primarily changed stuff outside of
VMCore, and those changes do not carry any tests for correctness (or
even plausibility), and we have consistently found questionable or flat
out incorrect cases in these changes. Most of them are probably correct,
but we need to devise a system that makes it more clear when we have
handled the address space concerns correctly, and ideally each pass that
gets updated would receive an accompanying test case that exercises that
pass specificaly w.r.t. alternate address spaces.
However, from this commit, I have retained the new C API entry points.
Those were an orthogonal change that probably should have been split
apart, but they seem entirely good.
In several places the changes were very obvious cleanups with no actual
multiple address space code added; these I have not reverted when
I spotted them.
In a few other places there were merge conflicts due to a cleaner
solution being implemented later, often not using address spaces at all.
In those cases, I've preserved the new code which isn't address space
dependent.
This is part of my ongoing effort to clean out the partial address space
code which carries high risk and low test coverage, and not likely to be
finished before the 3.2 release looms closer. Duncan and I would both
like to see the above issues addressed before we return to these
changes.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167222 91177308-0d34-0410-b5e6-96231b3b80d8
2012-11-01 09:14:31 +00:00
|
|
|
/// FIXME: The defaults need to be removed once all of
|
|
|
|
/// the backends/clients are updated.
|
2013-06-28 23:24:05 +00:00
|
|
|
unsigned getPointerSizeInBits(unsigned AS = 0) const {
|
2012-10-29 12:19:04 +00:00
|
|
|
return getPointerSize(AS) * 8;
|
2012-10-09 16:06:12 +00:00
|
|
|
}
|
2012-10-04 22:08:14 +00:00
|
|
|
/// Size examples:
|
|
|
|
///
|
|
|
|
/// Type SizeInBits StoreSizeInBits AllocSizeInBits[*]
|
|
|
|
/// ---- ---------- --------------- ---------------
|
|
|
|
/// i1 1 8 8
|
|
|
|
/// i8 8 8 8
|
|
|
|
/// i19 19 24 32
|
|
|
|
/// i32 32 32 32
|
|
|
|
/// i100 100 104 128
|
|
|
|
/// i128 128 128 128
|
|
|
|
/// Float 32 32 32
|
|
|
|
/// Double 64 64 64
|
|
|
|
/// X86_FP80 80 80 96
|
|
|
|
///
|
|
|
|
/// [*] The alloc size depends on the alignment, and thus on the target.
|
|
|
|
/// These values are for x86-32 linux.
|
|
|
|
|
|
|
|
/// getTypeSizeInBits - Return the number of bits necessary to hold the
|
|
|
|
/// specified type. For example, returns 36 for i36 and 80 for x86_fp80.
|
2012-11-15 14:45:30 +00:00
|
|
|
/// The type passed must have a size (Type::isSized() must return true).
|
2013-03-01 04:19:34 +00:00
|
|
|
uint64_t getTypeSizeInBits(Type *Ty) const;
|
2012-10-04 22:08:14 +00:00
|
|
|
|
|
|
|
/// getTypeStoreSize - Return the maximum number of bytes that may be
|
|
|
|
/// overwritten by storing the specified type. For example, returns 5
|
|
|
|
/// for i36 and 10 for x86_fp80.
|
|
|
|
uint64_t getTypeStoreSize(Type *Ty) const {
|
|
|
|
return (getTypeSizeInBits(Ty)+7)/8;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getTypeStoreSizeInBits - Return the maximum number of bits that may be
|
|
|
|
/// overwritten by storing the specified type; always a multiple of 8. For
|
|
|
|
/// example, returns 40 for i36 and 80 for x86_fp80.
|
|
|
|
uint64_t getTypeStoreSizeInBits(Type *Ty) const {
|
|
|
|
return 8*getTypeStoreSize(Ty);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getTypeAllocSize - Return the offset in bytes between successive objects
|
|
|
|
/// of the specified type, including alignment padding. This is the amount
|
|
|
|
/// that alloca reserves for this type. For example, returns 12 or 16 for
|
|
|
|
/// x86_fp80, depending on alignment.
|
2013-03-01 04:19:34 +00:00
|
|
|
uint64_t getTypeAllocSize(Type *Ty) const {
|
2012-10-04 22:08:14 +00:00
|
|
|
// Round up to the next alignment boundary.
|
|
|
|
return RoundUpAlignment(getTypeStoreSize(Ty), getABITypeAlignment(Ty));
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getTypeAllocSizeInBits - Return the offset in bits between successive
|
|
|
|
/// objects of the specified type, including alignment padding; always a
|
|
|
|
/// multiple of 8. This is the amount that alloca reserves for this type.
|
|
|
|
/// For example, returns 96 or 128 for x86_fp80, depending on alignment.
|
2013-03-01 04:19:34 +00:00
|
|
|
uint64_t getTypeAllocSizeInBits(Type *Ty) const {
|
2012-10-04 22:08:14 +00:00
|
|
|
return 8*getTypeAllocSize(Ty);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getABITypeAlignment - Return the minimum ABI-required alignment for the
|
|
|
|
/// specified type.
|
|
|
|
unsigned getABITypeAlignment(Type *Ty) const;
|
|
|
|
|
|
|
|
/// getABIIntegerTypeAlignment - Return the minimum ABI-required alignment for
|
|
|
|
/// an integer type of the specified bitwidth.
|
|
|
|
unsigned getABIIntegerTypeAlignment(unsigned BitWidth) const;
|
|
|
|
|
|
|
|
/// getCallFrameTypeAlignment - Return the minimum ABI-required alignment
|
|
|
|
/// for the specified type when it is part of a call frame.
|
|
|
|
unsigned getCallFrameTypeAlignment(Type *Ty) const;
|
|
|
|
|
|
|
|
/// getPrefTypeAlignment - Return the preferred stack/global alignment for
|
|
|
|
/// the specified type. This is always at least as good as the ABI alignment.
|
|
|
|
unsigned getPrefTypeAlignment(Type *Ty) const;
|
|
|
|
|
|
|
|
/// getPreferredTypeAlignmentShift - Return the preferred alignment for the
|
|
|
|
/// specified type, returned as log2 of the value (a shift amount).
|
|
|
|
unsigned getPreferredTypeAlignmentShift(Type *Ty) const;
|
|
|
|
|
2012-10-29 17:31:46 +00:00
|
|
|
/// getIntPtrType - Return an integer type with size at least as big as that
|
|
|
|
/// of a pointer in the given address space.
|
2012-11-01 08:07:29 +00:00
|
|
|
IntegerType *getIntPtrType(LLVMContext &C, unsigned AddressSpace = 0) const;
|
2012-10-24 15:52:52 +00:00
|
|
|
|
2012-10-29 17:31:46 +00:00
|
|
|
/// getIntPtrType - Return an integer (vector of integer) type with size at
|
|
|
|
/// least as big as that of a pointer of the given pointer (vector of pointer)
|
|
|
|
/// type.
|
|
|
|
Type *getIntPtrType(Type *) const;
|
2012-10-04 22:08:14 +00:00
|
|
|
|
2013-03-22 08:25:01 +00:00
|
|
|
/// getSmallestLegalIntType - Return the smallest integer type with size at
|
|
|
|
/// least as big as Width bits.
|
|
|
|
Type *getSmallestLegalIntType(LLVMContext &C, unsigned Width = 0) const;
|
|
|
|
|
2012-10-04 22:08:14 +00:00
|
|
|
/// getIndexedOffset - return the offset from the beginning of the type for
|
|
|
|
/// the specified indices. This is used to implement getelementptr.
|
|
|
|
uint64_t getIndexedOffset(Type *Ty, ArrayRef<Value *> Indices) const;
|
|
|
|
|
|
|
|
/// getStructLayout - Return a StructLayout object, indicating the alignment
|
|
|
|
/// of the struct, its size, and the offsets of its fields. Note that this
|
|
|
|
/// information is lazily cached.
|
|
|
|
const StructLayout *getStructLayout(StructType *Ty) const;
|
|
|
|
|
|
|
|
/// getPreferredAlignment - Return the preferred alignment of the specified
|
|
|
|
/// global. This includes an explicitly requested alignment (if the global
|
|
|
|
/// has one).
|
|
|
|
unsigned getPreferredAlignment(const GlobalVariable *GV) const;
|
|
|
|
|
|
|
|
/// getPreferredAlignmentLog - Return the preferred alignment of the
|
|
|
|
/// specified global, returned in log form. This includes an explicitly
|
|
|
|
/// requested alignment (if the global has one).
|
|
|
|
unsigned getPreferredAlignmentLog(const GlobalVariable *GV) const;
|
|
|
|
|
|
|
|
/// RoundUpAlignment - Round the specified value up to the next alignment
|
|
|
|
/// boundary specified by Alignment. For example, 7 rounded up to an
|
|
|
|
/// alignment boundary of 4 is 8. 8 rounded up to the alignment boundary of 4
|
|
|
|
/// is 8 because it is already aligned.
|
|
|
|
template <typename UIntTy>
|
|
|
|
static UIntTy RoundUpAlignment(UIntTy Val, unsigned Alignment) {
|
|
|
|
assert((Alignment & (Alignment-1)) == 0 && "Alignment must be power of 2!");
|
|
|
|
return (Val + (Alignment-1)) & ~UIntTy(Alignment-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
static char ID; // Pass identification, replacement for typeid
|
|
|
|
};
|
|
|
|
|
|
|
|
/// StructLayout - used to lazily calculate structure layout information for a
|
2012-10-04 23:01:22 +00:00
|
|
|
/// target machine, based on the DataLayout structure.
|
2012-10-04 22:08:14 +00:00
|
|
|
///
|
|
|
|
class StructLayout {
|
|
|
|
uint64_t StructSize;
|
|
|
|
unsigned StructAlignment;
|
|
|
|
unsigned NumElements;
|
|
|
|
uint64_t MemberOffsets[1]; // variable sized array!
|
|
|
|
public:
|
|
|
|
|
|
|
|
uint64_t getSizeInBytes() const {
|
|
|
|
return StructSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t getSizeInBits() const {
|
|
|
|
return 8*StructSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned getAlignment() const {
|
|
|
|
return StructAlignment;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getElementContainingOffset - Given a valid byte offset into the structure,
|
|
|
|
/// return the structure index that contains it.
|
|
|
|
///
|
|
|
|
unsigned getElementContainingOffset(uint64_t Offset) const;
|
|
|
|
|
|
|
|
uint64_t getElementOffset(unsigned Idx) const {
|
|
|
|
assert(Idx < NumElements && "Invalid element idx!");
|
|
|
|
return MemberOffsets[Idx];
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t getElementOffsetInBits(unsigned Idx) const {
|
|
|
|
return getElementOffset(Idx)*8;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2012-10-04 23:01:22 +00:00
|
|
|
friend class DataLayout; // Only DataLayout can create this class
|
2013-04-16 15:41:18 +00:00
|
|
|
StructLayout(StructType *ST, const DataLayout &DL);
|
2012-10-04 22:08:14 +00:00
|
|
|
};
|
|
|
|
|
2013-03-21 09:52:22 +00:00
|
|
|
|
|
|
|
// The implementation of this method is provided inline as it is particularly
|
|
|
|
// well suited to constant folding when called on a specific Type subclass.
|
|
|
|
inline uint64_t DataLayout::getTypeSizeInBits(Type *Ty) const {
|
|
|
|
assert(Ty->isSized() && "Cannot getTypeInfo() on a type that is unsized!");
|
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
case Type::LabelTyID:
|
|
|
|
return getPointerSizeInBits(0);
|
|
|
|
case Type::PointerTyID:
|
|
|
|
return getPointerSizeInBits(cast<PointerType>(Ty)->getAddressSpace());
|
|
|
|
case Type::ArrayTyID: {
|
|
|
|
ArrayType *ATy = cast<ArrayType>(Ty);
|
|
|
|
return ATy->getNumElements() *
|
|
|
|
getTypeAllocSizeInBits(ATy->getElementType());
|
|
|
|
}
|
|
|
|
case Type::StructTyID:
|
|
|
|
// Get the layout annotation... which is lazily created on demand.
|
|
|
|
return getStructLayout(cast<StructType>(Ty))->getSizeInBits();
|
|
|
|
case Type::IntegerTyID:
|
|
|
|
return cast<IntegerType>(Ty)->getBitWidth();
|
|
|
|
case Type::HalfTyID:
|
|
|
|
return 16;
|
|
|
|
case Type::FloatTyID:
|
|
|
|
return 32;
|
|
|
|
case Type::DoubleTyID:
|
|
|
|
case Type::X86_MMXTyID:
|
|
|
|
return 64;
|
|
|
|
case Type::PPC_FP128TyID:
|
|
|
|
case Type::FP128TyID:
|
|
|
|
return 128;
|
|
|
|
// In memory objects this is always aligned to a higher boundary, but
|
|
|
|
// only 80 bits contain information.
|
|
|
|
case Type::X86_FP80TyID:
|
|
|
|
return 80;
|
|
|
|
case Type::VectorTyID: {
|
|
|
|
VectorType *VTy = cast<VectorType>(Ty);
|
|
|
|
return VTy->getNumElements() * getTypeSizeInBits(VTy->getElementType());
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
llvm_unreachable("DataLayout::getTypeSizeInBits(): Unsupported type");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-04 22:08:14 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
|
|
|
#endif
|