2001-08-28 00:00:15 +08:00
|
|
|
//===-- TargetData.cpp - Data size & alignment routines --------------------==//
|
2005-04-22 06:55:34 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 06:55:34 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-08-28 00:00:15 +08:00
|
|
|
//
|
|
|
|
// This file defines target properties related to datatype size/offset/alignment
|
2004-02-26 16:02:17 +08:00
|
|
|
// information.
|
2001-08-28 00:00:15 +08:00
|
|
|
//
|
|
|
|
// 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.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2001-09-18 20:58:33 +08:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2002-04-29 03:55:58 +08:00
|
|
|
#include "llvm/Constants.h"
|
2009-11-18 09:03:56 +08:00
|
|
|
#include "llvm/DerivedTypes.h"
|
|
|
|
#include "llvm/Module.h"
|
2004-04-05 09:30:19 +08:00
|
|
|
#include "llvm/Support/GetElementPtrTypeIterator.h"
|
2004-09-02 06:55:40 +08:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2007-02-11 03:43:18 +08:00
|
|
|
#include "llvm/Support/ManagedStatic.h"
|
2009-07-12 04:10:48 +08:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2009-11-07 17:13:23 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2010-11-30 02:16:10 +08:00
|
|
|
#include "llvm/Support/Mutex.h"
|
2007-02-11 04:26:17 +08:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2005-03-14 03:04:41 +08:00
|
|
|
#include <algorithm>
|
2006-05-12 13:49:47 +08:00
|
|
|
#include <cstdlib>
|
2003-12-22 13:01:15 +08:00
|
|
|
using namespace llvm;
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2003-08-18 22:43:39 +08:00
|
|
|
// Handle the Pass registration stuff necessary to use TargetData's.
|
2008-05-13 08:00:25 +08:00
|
|
|
|
|
|
|
// Register the default SparcV9 implementation...
|
2010-10-08 06:25:06 +08:00
|
|
|
INITIALIZE_PASS(TargetData, "targetdata", "Target Data Layout", false, true)
|
2007-05-03 09:11:54 +08:00
|
|
|
char TargetData::ID = 0;
|
2002-09-26 07:46:55 +08:00
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2004-02-26 16:02:17 +08:00
|
|
|
// Support for StructLayout
|
2001-08-28 00:00:15 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
StructLayout::StructLayout(StructType *ST, const TargetData &TD) {
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
assert(!ST->isOpaque() && "Cannot get layout of opaque structs");
|
2001-08-28 00:00:15 +08:00
|
|
|
StructAlignment = 0;
|
|
|
|
StructSize = 0;
|
2007-02-11 04:15:41 +08:00
|
|
|
NumElements = ST->getNumElements();
|
2001-08-28 00:00:15 +08:00
|
|
|
|
2008-12-08 15:11:56 +08:00
|
|
|
// Loop over each of the elements, placing them in memory.
|
2007-02-11 04:15:41 +08:00
|
|
|
for (unsigned i = 0, e = NumElements; i != e; ++i) {
|
2011-07-18 12:54:35 +08:00
|
|
|
Type *Ty = ST->getElementType(i);
|
2008-06-04 16:21:45 +08:00
|
|
|
unsigned TyAlign = ST->isPacked() ? 1 : TD.getABITypeAlignment(Ty);
|
2001-08-28 00:00:15 +08:00
|
|
|
|
2008-12-08 15:11:56 +08:00
|
|
|
// Add padding if necessary to align the data element properly.
|
2008-12-09 17:58:11 +08:00
|
|
|
if ((StructSize & (TyAlign-1)) != 0)
|
2008-12-08 15:11:56 +08:00
|
|
|
StructSize = TargetData::RoundUpAlignment(StructSize, TyAlign);
|
2001-08-28 00:00:15 +08:00
|
|
|
|
2008-12-08 15:11:56 +08:00
|
|
|
// Keep track of maximum alignment constraint.
|
2002-01-21 06:54:45 +08:00
|
|
|
StructAlignment = std::max(TyAlign, StructAlignment);
|
2001-08-28 00:00:15 +08:00
|
|
|
|
2007-02-11 04:15:41 +08:00
|
|
|
MemberOffsets[i] = StructSize;
|
2009-05-09 15:06:46 +08:00
|
|
|
StructSize += TD.getTypeAllocSize(Ty); // Consume space for this data item
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
|
2003-05-22 02:08:44 +08:00
|
|
|
// Empty structures have alignment of 1 byte.
|
|
|
|
if (StructAlignment == 0) StructAlignment = 1;
|
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
// Add padding to the end of the struct so that it could be put in an array
|
|
|
|
// and all array elements would be aligned correctly.
|
2008-12-08 15:21:39 +08:00
|
|
|
if ((StructSize & (StructAlignment-1)) != 0)
|
2008-12-08 15:11:56 +08:00
|
|
|
StructSize = TargetData::RoundUpAlignment(StructSize, StructAlignment);
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
|
2005-03-14 03:04:41 +08:00
|
|
|
|
|
|
|
/// getElementContainingOffset - Given a valid offset into the structure,
|
|
|
|
/// return the structure index that contains it.
|
|
|
|
unsigned StructLayout::getElementContainingOffset(uint64_t Offset) const {
|
2007-02-11 04:15:41 +08:00
|
|
|
const uint64_t *SI =
|
|
|
|
std::upper_bound(&MemberOffsets[0], &MemberOffsets[NumElements], Offset);
|
|
|
|
assert(SI != &MemberOffsets[0] && "Offset not in structure type!");
|
2005-03-14 03:04:41 +08:00
|
|
|
--SI;
|
|
|
|
assert(*SI <= Offset && "upper_bound didn't work");
|
2007-10-29 10:40:02 +08:00
|
|
|
assert((SI == &MemberOffsets[0] || *(SI-1) <= Offset) &&
|
2007-02-11 04:15:41 +08:00
|
|
|
(SI+1 == &MemberOffsets[NumElements] || *(SI+1) > Offset) &&
|
2005-03-14 03:04:41 +08:00
|
|
|
"Upper bound didn't work!");
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2007-10-29 10:40:02 +08:00
|
|
|
// Multiple fields can have the same offset if any of them are zero sized.
|
|
|
|
// For example, in { i32, [0 x i32], i32 }, searching for offset 4 will stop
|
|
|
|
// at the i32 element, because it is the last element at that offset. This is
|
|
|
|
// the right one to return, because anything after it will have a higher
|
|
|
|
// offset, implying that this element is non-empty.
|
2007-02-11 04:15:41 +08:00
|
|
|
return SI-&MemberOffsets[0];
|
2005-03-14 03:04:41 +08:00
|
|
|
}
|
|
|
|
|
2007-02-14 13:52:17 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// TargetAlignElem, TargetAlign support
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
TargetAlignElem
|
2010-08-12 02:15:01 +08:00
|
|
|
TargetAlignElem::get(AlignTypeEnum align_type, unsigned abi_align,
|
|
|
|
unsigned pref_align, uint32_t bit_width) {
|
2008-01-29 14:23:44 +08:00
|
|
|
assert(abi_align <= pref_align && "Preferred alignment worse than ABI!");
|
2007-02-14 13:52:17 +08:00
|
|
|
TargetAlignElem retval;
|
|
|
|
retval.AlignType = align_type;
|
|
|
|
retval.ABIAlign = abi_align;
|
|
|
|
retval.PrefAlign = pref_align;
|
|
|
|
retval.TypeBitWidth = bit_width;
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2007-02-15 10:11:06 +08:00
|
|
|
TargetAlignElem::operator==(const TargetAlignElem &rhs) const {
|
2007-02-14 13:52:17 +08:00
|
|
|
return (AlignType == rhs.AlignType
|
|
|
|
&& ABIAlign == rhs.ABIAlign
|
|
|
|
&& PrefAlign == rhs.PrefAlign
|
|
|
|
&& TypeBitWidth == rhs.TypeBitWidth);
|
|
|
|
}
|
|
|
|
|
|
|
|
const TargetAlignElem TargetData::InvalidAlignmentElem =
|
|
|
|
TargetAlignElem::get((AlignTypeEnum) -1, 0, 0, 0);
|
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// TargetData Class Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
/// getInt - Get an integer ignoring errors.
|
2011-10-21 03:24:44 +08:00
|
|
|
static int getInt(StringRef R) {
|
|
|
|
int Result = 0;
|
2009-11-07 17:13:23 +08:00
|
|
|
R.getAsInteger(10, Result);
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2011-10-21 03:24:44 +08:00
|
|
|
void TargetData::init() {
|
2010-10-20 01:21:58 +08:00
|
|
|
initializeTargetDataPass(*PassRegistry::getPassRegistry());
|
2011-10-21 03:24:44 +08:00
|
|
|
|
2009-08-22 03:59:12 +08:00
|
|
|
LayoutMap = 0;
|
2006-05-12 13:49:47 +08:00
|
|
|
LittleEndian = false;
|
2007-01-21 06:35:55 +08:00
|
|
|
PointerMemSize = 8;
|
2009-11-07 17:13:23 +08:00
|
|
|
PointerABIAlign = 8;
|
2007-02-14 13:52:17 +08:00
|
|
|
PointerPrefAlign = PointerABIAlign;
|
2011-10-11 07:42:08 +08:00
|
|
|
StackNaturalAlign = 0;
|
2007-02-14 13:52:17 +08:00
|
|
|
|
|
|
|
// Default alignments
|
2009-04-02 02:10:16 +08:00
|
|
|
setAlignment(INTEGER_ALIGN, 1, 1, 1); // i1
|
|
|
|
setAlignment(INTEGER_ALIGN, 1, 1, 8); // i8
|
|
|
|
setAlignment(INTEGER_ALIGN, 2, 2, 16); // i16
|
|
|
|
setAlignment(INTEGER_ALIGN, 4, 4, 32); // i32
|
|
|
|
setAlignment(INTEGER_ALIGN, 4, 8, 64); // i64
|
2011-12-20 08:02:33 +08:00
|
|
|
setAlignment(FLOAT_ALIGN, 2, 2, 16); // half
|
2007-02-15 10:11:06 +08:00
|
|
|
setAlignment(FLOAT_ALIGN, 4, 4, 32); // float
|
|
|
|
setAlignment(FLOAT_ALIGN, 8, 8, 64); // double
|
2012-02-26 12:13:31 +08:00
|
|
|
setAlignment(FLOAT_ALIGN, 16, 16, 128); // ppcf128, quad, ...
|
2009-08-21 00:27:10 +08:00
|
|
|
setAlignment(VECTOR_ALIGN, 8, 8, 64); // v2i32, v1i64, ...
|
2007-02-16 06:07:05 +08:00
|
|
|
setAlignment(VECTOR_ALIGN, 16, 16, 128); // v16i8, v8i16, v4i32, ...
|
2009-08-21 00:27:10 +08:00
|
|
|
setAlignment(AGGREGATE_ALIGN, 0, 8, 0); // struct
|
2011-10-21 03:24:44 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
std::string TargetData::parseSpecifier(StringRef Desc, TargetData *td) {
|
|
|
|
|
|
|
|
if (td)
|
|
|
|
td->init();
|
2007-09-07 22:52:14 +08:00
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
while (!Desc.empty()) {
|
|
|
|
std::pair<StringRef, StringRef> Split = Desc.split('-');
|
|
|
|
StringRef Token = Split.first;
|
|
|
|
Desc = Split.second;
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
if (Token.empty())
|
|
|
|
continue;
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
Split = Token.split(':');
|
|
|
|
StringRef Specifier = Split.first;
|
|
|
|
Token = Split.second;
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
assert(!Specifier.empty() && "Can't be empty here");
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-07 17:35:34 +08:00
|
|
|
switch (Specifier[0]) {
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'E':
|
2011-10-21 03:24:44 +08:00
|
|
|
if (td)
|
|
|
|
td->LittleEndian = false;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'e':
|
2011-10-21 03:24:44 +08:00
|
|
|
if (td)
|
|
|
|
td->LittleEndian = true;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2011-10-21 03:24:44 +08:00
|
|
|
case 'p': {
|
|
|
|
// Pointer size.
|
2009-11-07 17:13:23 +08:00
|
|
|
Split = Token.split(':');
|
2011-10-21 03:24:44 +08:00
|
|
|
int PointerMemSizeBits = getInt(Split.first);
|
|
|
|
if (PointerMemSizeBits < 0 || PointerMemSizeBits % 8 != 0)
|
|
|
|
return "invalid pointer size, must be a positive 8-bit multiple";
|
|
|
|
if (td)
|
|
|
|
td->PointerMemSize = PointerMemSizeBits / 8;
|
|
|
|
|
|
|
|
// Pointer ABI alignment.
|
2009-11-07 17:13:23 +08:00
|
|
|
Split = Split.second.split(':');
|
2011-10-21 03:24:44 +08:00
|
|
|
int PointerABIAlignBits = getInt(Split.first);
|
|
|
|
if (PointerABIAlignBits < 0 || PointerABIAlignBits % 8 != 0) {
|
|
|
|
return "invalid pointer ABI alignment, "
|
|
|
|
"must be a positive 8-bit multiple";
|
|
|
|
}
|
|
|
|
if (td)
|
|
|
|
td->PointerABIAlign = PointerABIAlignBits / 8;
|
|
|
|
|
|
|
|
// Pointer preferred alignment.
|
2009-11-07 17:13:23 +08:00
|
|
|
Split = Split.second.split(':');
|
2011-10-21 03:24:44 +08:00
|
|
|
int PointerPrefAlignBits = getInt(Split.first);
|
|
|
|
if (PointerPrefAlignBits < 0 || PointerPrefAlignBits % 8 != 0) {
|
|
|
|
return "invalid pointer preferred alignment, "
|
|
|
|
"must be a positive 8-bit multiple";
|
|
|
|
}
|
|
|
|
if (td) {
|
|
|
|
td->PointerPrefAlign = PointerPrefAlignBits / 8;
|
|
|
|
if (td->PointerPrefAlign == 0)
|
|
|
|
td->PointerPrefAlign = td->PointerABIAlign;
|
|
|
|
}
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2011-10-21 03:24:44 +08:00
|
|
|
}
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'i':
|
2007-02-14 13:52:17 +08:00
|
|
|
case 'v':
|
|
|
|
case 'f':
|
2007-09-07 22:52:14 +08:00
|
|
|
case 'a':
|
|
|
|
case 's': {
|
2009-11-07 17:13:23 +08:00
|
|
|
AlignTypeEnum AlignType;
|
2011-10-21 03:24:44 +08:00
|
|
|
char field = Specifier[0];
|
|
|
|
switch (field) {
|
2009-11-07 17:13:23 +08:00
|
|
|
default:
|
|
|
|
case 'i': AlignType = INTEGER_ALIGN; break;
|
|
|
|
case 'v': AlignType = VECTOR_ALIGN; break;
|
|
|
|
case 'f': AlignType = FLOAT_ALIGN; break;
|
|
|
|
case 'a': AlignType = AGGREGATE_ALIGN; break;
|
|
|
|
case 's': AlignType = STACK_ALIGN; break;
|
2007-09-07 22:52:14 +08:00
|
|
|
}
|
2011-10-21 03:24:44 +08:00
|
|
|
int Size = getInt(Specifier.substr(1));
|
|
|
|
if (Size < 0) {
|
|
|
|
return std::string("invalid ") + field + "-size field, "
|
|
|
|
"must be positive";
|
|
|
|
}
|
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
Split = Token.split(':');
|
2011-10-21 03:24:44 +08:00
|
|
|
int ABIAlignBits = getInt(Split.first);
|
|
|
|
if (ABIAlignBits < 0 || ABIAlignBits % 8 != 0) {
|
|
|
|
return std::string("invalid ") + field +"-abi-alignment field, "
|
|
|
|
"must be a positive 8-bit multiple";
|
|
|
|
}
|
|
|
|
unsigned ABIAlign = ABIAlignBits / 8;
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
Split = Split.second.split(':');
|
2011-10-21 03:24:44 +08:00
|
|
|
|
|
|
|
int PrefAlignBits = getInt(Split.first);
|
|
|
|
if (PrefAlignBits < 0 || PrefAlignBits % 8 != 0) {
|
|
|
|
return std::string("invalid ") + field +"-preferred-alignment field, "
|
|
|
|
"must be a positive 8-bit multiple";
|
|
|
|
}
|
|
|
|
unsigned PrefAlign = PrefAlignBits / 8;
|
2009-11-07 17:13:23 +08:00
|
|
|
if (PrefAlign == 0)
|
|
|
|
PrefAlign = ABIAlign;
|
2011-10-21 03:24:44 +08:00
|
|
|
|
|
|
|
if (td)
|
|
|
|
td->setAlignment(AlignType, ABIAlign, PrefAlign, Size);
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2007-02-14 13:52:17 +08:00
|
|
|
}
|
2009-11-07 17:35:34 +08:00
|
|
|
case 'n': // Native integer types.
|
|
|
|
Specifier = Specifier.substr(1);
|
|
|
|
do {
|
2011-10-21 03:24:44 +08:00
|
|
|
int Width = getInt(Specifier);
|
|
|
|
if (Width <= 0) {
|
|
|
|
return std::string("invalid native integer size \'") + Specifier.str() +
|
|
|
|
"\', must be a positive integer.";
|
|
|
|
}
|
|
|
|
if (td && Width != 0)
|
|
|
|
td->LegalIntWidths.push_back(Width);
|
2009-11-07 17:35:34 +08:00
|
|
|
Split = Token.split(':');
|
|
|
|
Specifier = Split.first;
|
|
|
|
Token = Split.second;
|
|
|
|
} while (!Specifier.empty() || !Token.empty());
|
|
|
|
break;
|
2011-10-21 03:24:44 +08:00
|
|
|
case 'S': { // Stack natural alignment.
|
|
|
|
int StackNaturalAlignBits = getInt(Specifier.substr(1));
|
|
|
|
if (StackNaturalAlignBits < 0 || StackNaturalAlignBits % 8 != 0) {
|
|
|
|
return "invalid natural stack alignment (S-field), "
|
|
|
|
"must be a positive 8-bit multiple";
|
|
|
|
}
|
|
|
|
if (td)
|
|
|
|
td->StackNaturalAlign = StackNaturalAlignBits / 8;
|
2011-10-11 07:42:08 +08:00
|
|
|
break;
|
2011-10-21 03:24:44 +08:00
|
|
|
}
|
2006-05-12 13:49:47 +08:00
|
|
|
default:
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
}
|
|
|
|
}
|
2011-10-21 03:24:44 +08:00
|
|
|
|
|
|
|
return "";
|
2006-05-12 13:49:47 +08:00
|
|
|
}
|
|
|
|
|
2009-11-07 17:23:04 +08:00
|
|
|
/// Default ctor.
|
|
|
|
///
|
|
|
|
/// @note This has to exist, because this is a pass, but it should never be
|
|
|
|
/// used.
|
2010-08-07 02:33:48 +08:00
|
|
|
TargetData::TargetData() : ImmutablePass(ID) {
|
2010-04-08 06:58:41 +08:00
|
|
|
report_fatal_error("Bad TargetData ctor used. "
|
2009-11-07 17:23:04 +08:00
|
|
|
"Tool did not specify a TargetData to use?");
|
|
|
|
}
|
|
|
|
|
2010-10-19 15:32:42 +08:00
|
|
|
TargetData::TargetData(const Module *M)
|
2010-08-07 02:33:48 +08:00
|
|
|
: ImmutablePass(ID) {
|
2011-10-21 03:24:44 +08:00
|
|
|
std::string errMsg = parseSpecifier(M->getDataLayout(), this);
|
|
|
|
assert(errMsg == "" && "Module M has malformed target data layout string.");
|
|
|
|
(void)errMsg;
|
2003-04-25 03:09:05 +08:00
|
|
|
}
|
|
|
|
|
2007-02-14 13:52:17 +08:00
|
|
|
void
|
2010-08-12 02:15:01 +08:00
|
|
|
TargetData::setAlignment(AlignTypeEnum align_type, unsigned abi_align,
|
|
|
|
unsigned pref_align, uint32_t bit_width) {
|
2008-01-29 14:23:44 +08:00
|
|
|
assert(abi_align <= pref_align && "Preferred alignment worse than ABI!");
|
2007-02-17 08:41:42 +08:00
|
|
|
for (unsigned i = 0, e = Alignments.size(); i != e; ++i) {
|
|
|
|
if (Alignments[i].AlignType == align_type &&
|
|
|
|
Alignments[i].TypeBitWidth == bit_width) {
|
|
|
|
// Update the abi, preferred alignments.
|
|
|
|
Alignments[i].ABIAlign = abi_align;
|
|
|
|
Alignments[i].PrefAlign = pref_align;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2007-02-17 08:41:42 +08:00
|
|
|
Alignments.push_back(TargetAlignElem::get(align_type, abi_align,
|
|
|
|
pref_align, bit_width));
|
2007-02-14 13:52:17 +08:00
|
|
|
}
|
|
|
|
|
2010-10-19 15:32:42 +08:00
|
|
|
/// getAlignmentInfo - Return the alignment (either ABI if ABIInfo = true or
|
2007-02-17 08:41:42 +08:00
|
|
|
/// preferred if ABIInfo = false) the target wants for the specified datatype.
|
2010-10-19 15:32:42 +08:00
|
|
|
unsigned TargetData::getAlignmentInfo(AlignTypeEnum AlignType,
|
2008-01-10 08:30:57 +08:00
|
|
|
uint32_t BitWidth, bool ABIInfo,
|
2011-07-18 12:54:35 +08:00
|
|
|
Type *Ty) const {
|
2007-02-17 08:41:42 +08:00
|
|
|
// Check to see if we have an exact match and remember the best match we see.
|
|
|
|
int BestMatchIdx = -1;
|
2007-02-20 06:35:00 +08:00
|
|
|
int LargestInt = -1;
|
2007-02-17 08:41:42 +08:00
|
|
|
for (unsigned i = 0, e = Alignments.size(); i != e; ++i) {
|
|
|
|
if (Alignments[i].AlignType == AlignType &&
|
|
|
|
Alignments[i].TypeBitWidth == BitWidth)
|
|
|
|
return ABIInfo ? Alignments[i].ABIAlign : Alignments[i].PrefAlign;
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2007-02-17 08:41:42 +08:00
|
|
|
// The best match so far depends on what we're looking for.
|
2010-10-19 15:32:42 +08:00
|
|
|
if (AlignType == INTEGER_ALIGN &&
|
2010-04-24 03:41:15 +08:00
|
|
|
Alignments[i].AlignType == INTEGER_ALIGN) {
|
2007-02-20 06:35:00 +08:00
|
|
|
// The "best match" for integers is the smallest size that is larger than
|
|
|
|
// the BitWidth requested.
|
2010-10-19 15:32:42 +08:00
|
|
|
if (Alignments[i].TypeBitWidth > BitWidth && (BestMatchIdx == -1 ||
|
2007-02-20 06:35:00 +08:00
|
|
|
Alignments[i].TypeBitWidth < Alignments[BestMatchIdx].TypeBitWidth))
|
|
|
|
BestMatchIdx = i;
|
|
|
|
// However, if there isn't one that's larger, then we must use the
|
|
|
|
// largest one we have (see below)
|
2010-10-19 15:32:42 +08:00
|
|
|
if (LargestInt == -1 ||
|
2007-02-20 06:35:00 +08:00
|
|
|
Alignments[i].TypeBitWidth > Alignments[LargestInt].TypeBitWidth)
|
|
|
|
LargestInt = i;
|
2007-02-17 08:41:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, we didn't find an exact solution. Fall back here depending on what
|
|
|
|
// is being looked for.
|
2008-01-10 08:30:57 +08:00
|
|
|
if (BestMatchIdx == -1) {
|
|
|
|
// If we didn't find an integer alignment, fall back on most conservative.
|
|
|
|
if (AlignType == INTEGER_ALIGN) {
|
|
|
|
BestMatchIdx = LargestInt;
|
|
|
|
} else {
|
|
|
|
assert(AlignType == VECTOR_ALIGN && "Unknown alignment type!");
|
2009-02-17 07:14:14 +08:00
|
|
|
|
2010-04-24 03:41:15 +08:00
|
|
|
// By default, use natural alignment for vector types. This is consistent
|
|
|
|
// with what clang and llvm-gcc do.
|
|
|
|
unsigned Align = getTypeAllocSize(cast<VectorType>(Ty)->getElementType());
|
|
|
|
Align *= cast<VectorType>(Ty)->getNumElements();
|
|
|
|
// If the alignment is not a power of 2, round up to the next power of 2.
|
|
|
|
// This happens for non-power-of-2 length vectors.
|
|
|
|
if (Align & (Align-1))
|
|
|
|
Align = llvm::NextPowerOf2(Align);
|
|
|
|
return Align;
|
2009-02-17 07:14:14 +08:00
|
|
|
}
|
2008-01-10 08:30:57 +08:00
|
|
|
}
|
2009-02-17 07:14:14 +08:00
|
|
|
|
2007-02-20 06:35:00 +08:00
|
|
|
// Since we got a "best match" index, just return it.
|
2007-02-17 08:41:42 +08:00
|
|
|
return ABIInfo ? Alignments[BestMatchIdx].ABIAlign
|
|
|
|
: Alignments[BestMatchIdx].PrefAlign;
|
2007-02-14 13:52:17 +08:00
|
|
|
}
|
|
|
|
|
2009-12-03 08:17:12 +08:00
|
|
|
namespace {
|
2009-11-18 09:03:56 +08:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
class StructLayoutMap {
|
2011-07-18 12:54:35 +08:00
|
|
|
typedef DenseMap<StructType*, StructLayout*> LayoutInfoTy;
|
2009-11-18 09:03:56 +08:00
|
|
|
LayoutInfoTy LayoutInfo;
|
|
|
|
|
|
|
|
public:
|
|
|
|
virtual ~StructLayoutMap() {
|
|
|
|
// Remove any layouts.
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
for (LayoutInfoTy::iterator I = LayoutInfo.begin(), E = LayoutInfo.end();
|
|
|
|
I != E; ++I) {
|
2009-12-03 08:17:12 +08:00
|
|
|
StructLayout *Value = I->second;
|
2009-12-05 05:03:02 +08:00
|
|
|
Value->~StructLayout();
|
|
|
|
free(Value);
|
2009-12-03 08:17:12 +08:00
|
|
|
}
|
2009-11-18 09:03:56 +08:00
|
|
|
}
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
StructLayout *&operator[](StructType *STy) {
|
2009-11-18 09:03:56 +08:00
|
|
|
return LayoutInfo[STy];
|
|
|
|
}
|
|
|
|
|
|
|
|
// for debugging...
|
|
|
|
virtual void dump() const {}
|
|
|
|
};
|
|
|
|
|
2009-12-05 05:03:02 +08:00
|
|
|
} // end anonymous namespace
|
2009-11-18 09:03:56 +08:00
|
|
|
|
|
|
|
TargetData::~TargetData() {
|
2009-12-03 08:17:12 +08:00
|
|
|
delete static_cast<StructLayoutMap*>(LayoutMap);
|
2007-02-11 04:15:41 +08:00
|
|
|
}
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
const StructLayout *TargetData::getStructLayout(StructType *Ty) const {
|
2009-08-22 03:59:12 +08:00
|
|
|
if (!LayoutMap)
|
2009-11-18 09:03:56 +08:00
|
|
|
LayoutMap = new StructLayoutMap();
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-12-03 08:17:12 +08:00
|
|
|
StructLayoutMap *STM = static_cast<StructLayoutMap*>(LayoutMap);
|
|
|
|
StructLayout *&SL = (*STM)[Ty];
|
2007-02-11 04:26:17 +08:00
|
|
|
if (SL) return SL;
|
2007-02-11 04:15:41 +08:00
|
|
|
|
2010-10-19 15:32:42 +08:00
|
|
|
// Otherwise, create the struct layout. Because it is variable length, we
|
2007-02-11 04:15:41 +08:00
|
|
|
// malloc it, then use placement new.
|
2007-04-10 03:26:30 +08:00
|
|
|
int NumElts = Ty->getNumElements();
|
2007-02-11 04:15:41 +08:00
|
|
|
StructLayout *L =
|
2009-11-18 09:03:56 +08:00
|
|
|
(StructLayout *)malloc(sizeof(StructLayout)+(NumElts-1) * sizeof(uint64_t));
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2007-02-11 04:26:17 +08:00
|
|
|
// Set SL before calling StructLayout's ctor. The ctor could cause other
|
|
|
|
// entries to be added to TheMap, invalidating our reference.
|
|
|
|
SL = L;
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2007-02-11 04:15:41 +08:00
|
|
|
new (L) StructLayout(Ty, *this);
|
2009-12-03 08:17:12 +08:00
|
|
|
|
2007-02-11 04:15:41 +08:00
|
|
|
return L;
|
|
|
|
}
|
|
|
|
|
2006-05-12 15:01:44 +08:00
|
|
|
std::string TargetData::getStringRepresentation() const {
|
2009-11-07 17:13:23 +08:00
|
|
|
std::string Result;
|
|
|
|
raw_string_ostream OS(Result);
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-07 17:13:23 +08:00
|
|
|
OS << (LittleEndian ? "e" : "E")
|
|
|
|
<< "-p:" << PointerMemSize*8 << ':' << PointerABIAlign*8
|
2011-10-11 07:42:08 +08:00
|
|
|
<< ':' << PointerPrefAlign*8
|
|
|
|
<< "-S" << StackNaturalAlign*8;
|
|
|
|
|
2009-11-07 17:23:04 +08:00
|
|
|
for (unsigned i = 0, e = Alignments.size(); i != e; ++i) {
|
|
|
|
const TargetAlignElem &AI = Alignments[i];
|
|
|
|
OS << '-' << (char)AI.AlignType << AI.TypeBitWidth << ':'
|
|
|
|
<< AI.ABIAlign*8 << ':' << AI.PrefAlign*8;
|
|
|
|
}
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-08 10:32:01 +08:00
|
|
|
if (!LegalIntWidths.empty()) {
|
|
|
|
OS << "-n" << (unsigned)LegalIntWidths[0];
|
2010-10-19 15:32:42 +08:00
|
|
|
|
2009-11-08 10:32:01 +08:00
|
|
|
for (unsigned i = 1, e = LegalIntWidths.size(); i != e; ++i)
|
|
|
|
OS << ':' << (unsigned)LegalIntWidths[i];
|
|
|
|
}
|
2009-11-07 17:13:23 +08:00
|
|
|
return OS.str();
|
2006-05-12 15:01:44 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 08:07:34 +08:00
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
uint64_t TargetData::getTypeSizeInBits(Type *Ty) const {
|
2001-12-13 08:46:11 +08:00
|
|
|
assert(Ty->isSized() && "Cannot getTypeInfo() on a type that is unsized!");
|
2004-06-18 02:19:28 +08:00
|
|
|
switch (Ty->getTypeID()) {
|
2001-08-28 00:00:15 +08:00
|
|
|
case Type::LabelTyID:
|
|
|
|
case Type::PointerTyID:
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return getPointerSizeInBits();
|
2001-08-28 00:00:15 +08:00
|
|
|
case Type::ArrayTyID: {
|
2011-07-18 12:54:35 +08:00
|
|
|
ArrayType *ATy = cast<ArrayType>(Ty);
|
2010-02-25 23:20:39 +08:00
|
|
|
return getTypeAllocSizeInBits(ATy->getElementType())*ATy->getNumElements();
|
2004-12-02 01:14:28 +08:00
|
|
|
}
|
2008-12-08 15:11:56 +08:00
|
|
|
case Type::StructTyID:
|
2001-08-28 00:00:15 +08:00
|
|
|
// Get the layout annotation... which is lazily created on demand.
|
2008-12-08 15:11:56 +08:00
|
|
|
return getStructLayout(cast<StructType>(Ty))->getSizeInBits();
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
case Type::IntegerTyID:
|
|
|
|
return cast<IntegerType>(Ty)->getBitWidth();
|
2007-01-21 06:35:55 +08:00
|
|
|
case Type::VoidTyID:
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return 8;
|
2011-12-20 08:02:33 +08:00
|
|
|
case Type::HalfTyID:
|
|
|
|
return 16;
|
2007-01-21 06:35:55 +08:00
|
|
|
case Type::FloatTyID:
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return 32;
|
2007-01-21 06:35:55 +08:00
|
|
|
case Type::DoubleTyID:
|
2010-09-11 04:55:01 +08:00
|
|
|
case Type::X86_MMXTyID:
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return 64;
|
2007-08-04 04:20:50 +08:00
|
|
|
case Type::PPC_FP128TyID:
|
|
|
|
case Type::FP128TyID:
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return 128;
|
2007-08-04 04:20:50 +08:00
|
|
|
// In memory objects this is always aligned to a higher boundary, but
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
// only 80 bits contain information.
|
2007-08-04 04:20:50 +08:00
|
|
|
case Type::X86_FP80TyID:
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return 80;
|
2008-12-08 15:11:56 +08:00
|
|
|
case Type::VectorTyID:
|
|
|
|
return cast<VectorType>(Ty)->getBitWidth();
|
2007-01-21 06:35:55 +08:00
|
|
|
default:
|
2009-07-15 00:55:14 +08:00
|
|
|
llvm_unreachable("TargetData::getTypeSizeInBits(): Unsupported type");
|
2007-01-21 06:35:55 +08:00
|
|
|
}
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
|
2007-02-14 13:52:17 +08:00
|
|
|
/*!
|
|
|
|
\param abi_or_pref Flag that determines which alignment is returned. true
|
|
|
|
returns the ABI alignment, false returns the preferred alignment.
|
|
|
|
\param Ty The underlying type for which alignment is determined.
|
|
|
|
|
|
|
|
Get the ABI (\a abi_or_pref == true) or preferred alignment (\a abi_or_pref
|
|
|
|
== false) for the requested type \a Ty.
|
|
|
|
*/
|
2011-07-18 12:54:35 +08:00
|
|
|
unsigned TargetData::getAlignment(Type *Ty, bool abi_or_pref) const {
|
2007-02-14 13:52:17 +08:00
|
|
|
int AlignType = -1;
|
|
|
|
|
|
|
|
assert(Ty->isSized() && "Cannot getTypeInfo() on a type that is unsized!");
|
|
|
|
switch (Ty->getTypeID()) {
|
2008-12-08 15:11:56 +08:00
|
|
|
// Early escape for the non-numeric types.
|
2007-02-14 13:52:17 +08:00
|
|
|
case Type::LabelTyID:
|
|
|
|
case Type::PointerTyID:
|
|
|
|
return (abi_or_pref
|
|
|
|
? getPointerABIAlignment()
|
|
|
|
: getPointerPrefAlignment());
|
2007-02-17 06:25:34 +08:00
|
|
|
case Type::ArrayTyID:
|
|
|
|
return getAlignment(cast<ArrayType>(Ty)->getElementType(), abi_or_pref);
|
2009-02-17 07:14:14 +08:00
|
|
|
|
2007-02-14 13:52:17 +08:00
|
|
|
case Type::StructTyID: {
|
2007-02-17 06:25:34 +08:00
|
|
|
// Packed structure types always have an ABI alignment of one.
|
2007-02-17 07:11:51 +08:00
|
|
|
if (cast<StructType>(Ty)->isPacked() && abi_or_pref)
|
2007-02-17 06:25:34 +08:00
|
|
|
return 1;
|
2009-02-17 07:14:14 +08:00
|
|
|
|
2007-02-17 06:25:34 +08:00
|
|
|
// Get the layout annotation... which is lazily created on demand.
|
2007-02-14 13:52:17 +08:00
|
|
|
const StructLayout *Layout = getStructLayout(cast<StructType>(Ty));
|
2008-01-10 08:30:57 +08:00
|
|
|
unsigned Align = getAlignmentInfo(AGGREGATE_ALIGN, 0, abi_or_pref, Ty);
|
2010-08-12 02:15:01 +08:00
|
|
|
return std::max(Align, Layout->getAlignment());
|
2007-02-14 13:52:17 +08:00
|
|
|
}
|
|
|
|
case Type::IntegerTyID:
|
|
|
|
case Type::VoidTyID:
|
|
|
|
AlignType = INTEGER_ALIGN;
|
|
|
|
break;
|
2011-12-20 08:02:33 +08:00
|
|
|
case Type::HalfTyID:
|
2007-02-14 13:52:17 +08:00
|
|
|
case Type::FloatTyID:
|
|
|
|
case Type::DoubleTyID:
|
2007-08-04 04:20:50 +08:00
|
|
|
// PPC_FP128TyID and FP128TyID have different data contents, but the
|
|
|
|
// same size and alignment, so they look the same here.
|
|
|
|
case Type::PPC_FP128TyID:
|
|
|
|
case Type::FP128TyID:
|
|
|
|
case Type::X86_FP80TyID:
|
2007-02-14 13:52:17 +08:00
|
|
|
AlignType = FLOAT_ALIGN;
|
|
|
|
break;
|
2010-09-15 08:52:23 +08:00
|
|
|
case Type::X86_MMXTyID:
|
2008-01-10 08:30:57 +08:00
|
|
|
case Type::VectorTyID:
|
|
|
|
AlignType = VECTOR_ALIGN;
|
2007-02-14 13:52:17 +08:00
|
|
|
break;
|
|
|
|
default:
|
2009-07-15 00:55:14 +08:00
|
|
|
llvm_unreachable("Bad type for getAlignment!!!");
|
2007-02-14 13:52:17 +08:00
|
|
|
}
|
|
|
|
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
return getAlignmentInfo((AlignTypeEnum)AlignType, getTypeSizeInBits(Ty),
|
2008-01-10 08:30:57 +08:00
|
|
|
abi_or_pref, Ty);
|
2007-01-21 07:32:04 +08:00
|
|
|
}
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
unsigned TargetData::getABITypeAlignment(Type *Ty) const {
|
2007-02-14 13:52:17 +08:00
|
|
|
return getAlignment(Ty, true);
|
2007-01-21 06:35:55 +08:00
|
|
|
}
|
|
|
|
|
2010-01-26 07:18:11 +08:00
|
|
|
/// getABIIntegerTypeAlignment - Return the minimum ABI-required alignment for
|
|
|
|
/// an integer type of the specified bitwidth.
|
2010-08-12 02:15:01 +08:00
|
|
|
unsigned TargetData::getABIIntegerTypeAlignment(unsigned BitWidth) const {
|
2010-01-26 07:18:11 +08:00
|
|
|
return getAlignmentInfo(INTEGER_ALIGN, BitWidth, true, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
unsigned TargetData::getCallFrameTypeAlignment(Type *Ty) const {
|
2007-09-07 22:52:14 +08:00
|
|
|
for (unsigned i = 0, e = Alignments.size(); i != e; ++i)
|
|
|
|
if (Alignments[i].AlignType == STACK_ALIGN)
|
|
|
|
return Alignments[i].ABIAlign;
|
|
|
|
|
|
|
|
return getABITypeAlignment(Ty);
|
|
|
|
}
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
unsigned TargetData::getPrefTypeAlignment(Type *Ty) const {
|
2007-02-14 13:52:17 +08:00
|
|
|
return getAlignment(Ty, false);
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
|
2011-07-18 12:54:35 +08:00
|
|
|
unsigned TargetData::getPreferredTypeAlignmentShift(Type *Ty) const {
|
2010-08-12 02:15:01 +08:00
|
|
|
unsigned Align = getPrefTypeAlignment(Ty);
|
2004-08-18 03:13:00 +08:00
|
|
|
assert(!(Align & (Align-1)) && "Alignment is not a power of two!");
|
2005-08-03 03:26:06 +08:00
|
|
|
return Log2_32(Align);
|
2004-08-18 03:13:00 +08:00
|
|
|
}
|
|
|
|
|
2003-12-22 13:01:15 +08:00
|
|
|
/// getIntPtrType - Return an unsigned integer type that is the same size or
|
|
|
|
/// greater to the host pointer size.
|
2011-07-12 19:36:58 +08:00
|
|
|
IntegerType *TargetData::getIntPtrType(LLVMContext &C) const {
|
2009-08-14 05:58:54 +08:00
|
|
|
return IntegerType::get(C, getPointerSizeInBits());
|
2003-12-22 13:01:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-07-19 22:01:37 +08:00
|
|
|
uint64_t TargetData::getIndexedOffset(Type *ptrTy,
|
|
|
|
ArrayRef<Value *> Indices) const {
|
2011-07-18 12:54:35 +08:00
|
|
|
Type *Ty = ptrTy;
|
2010-02-16 19:11:14 +08:00
|
|
|
assert(Ty->isPointerTy() && "Illegal argument for getIndexedOffset()");
|
2002-05-19 23:28:02 +08:00
|
|
|
uint64_t Result = 0;
|
|
|
|
|
2007-02-11 03:33:15 +08:00
|
|
|
generic_gep_type_iterator<Value* const*>
|
2011-07-19 22:42:50 +08:00
|
|
|
TI = gep_type_begin(ptrTy, Indices);
|
2011-07-19 22:01:37 +08:00
|
|
|
for (unsigned CurIDX = 0, EndIDX = Indices.size(); CurIDX != EndIDX;
|
|
|
|
++CurIDX, ++TI) {
|
2011-07-18 12:54:35 +08:00
|
|
|
if (StructType *STy = dyn_cast<StructType>(*TI)) {
|
2009-08-14 05:58:54 +08:00
|
|
|
assert(Indices[CurIDX]->getType() ==
|
|
|
|
Type::getInt32Ty(ptrTy->getContext()) &&
|
2007-03-02 03:48:16 +08:00
|
|
|
"Illegal struct idx");
|
2007-02-11 03:33:15 +08:00
|
|
|
unsigned FieldNo = cast<ConstantInt>(Indices[CurIDX])->getZExtValue();
|
2001-08-28 00:00:15 +08:00
|
|
|
|
|
|
|
// Get structure layout information...
|
|
|
|
const StructLayout *Layout = getStructLayout(STy);
|
|
|
|
|
|
|
|
// Add in the offset, as calculated by the structure layout info...
|
2007-02-11 03:55:17 +08:00
|
|
|
Result += Layout->getElementOffset(FieldNo);
|
2002-08-05 04:52:39 +08:00
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
// Update Ty to refer to current element
|
2004-02-09 12:37:31 +08:00
|
|
|
Ty = STy->getElementType(FieldNo);
|
2004-04-05 09:30:19 +08:00
|
|
|
} else {
|
|
|
|
// Update Ty to refer to current element
|
|
|
|
Ty = cast<SequentialType>(Ty)->getElementType();
|
|
|
|
|
|
|
|
// Get the array index and the size of each array element.
|
2010-04-18 03:02:33 +08:00
|
|
|
if (int64_t arrayIdx = cast<ConstantInt>(Indices[CurIDX])->getSExtValue())
|
2010-07-29 01:11:36 +08:00
|
|
|
Result += (uint64_t)arrayIdx * getTypeAllocSize(Ty);
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Result;
|
|
|
|
}
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2008-01-29 14:23:44 +08:00
|
|
|
/// getPreferredAlignment - Return the preferred alignment of the specified
|
|
|
|
/// global. This includes an explicitly requested alignment (if the global
|
|
|
|
/// has one).
|
|
|
|
unsigned TargetData::getPreferredAlignment(const GlobalVariable *GV) const {
|
2011-07-18 12:54:35 +08:00
|
|
|
Type *ElemType = GV->getType()->getElementType();
|
2008-01-29 14:23:44 +08:00
|
|
|
unsigned Alignment = getPrefTypeAlignment(ElemType);
|
2011-04-13 14:03:16 +08:00
|
|
|
unsigned GVAlignment = GV->getAlignment();
|
|
|
|
if (GVAlignment >= Alignment) {
|
|
|
|
Alignment = GVAlignment;
|
|
|
|
} else if (GVAlignment != 0) {
|
2011-04-13 17:02:43 +08:00
|
|
|
Alignment = std::max(GVAlignment, getABITypeAlignment(ElemType));
|
2011-04-13 14:03:16 +08:00
|
|
|
}
|
2008-01-29 14:23:44 +08:00
|
|
|
|
2011-04-14 04:36:04 +08:00
|
|
|
if (GV->hasInitializer() && GVAlignment == 0) {
|
2008-01-29 14:23:44 +08:00
|
|
|
if (Alignment < 16) {
|
2006-10-25 04:32:14 +08:00
|
|
|
// If the global is not external, see if it is large. If so, give it a
|
|
|
|
// larger alignment.
|
2010-04-02 11:04:37 +08:00
|
|
|
if (getTypeSizeInBits(ElemType) > 128)
|
2008-01-29 14:23:44 +08:00
|
|
|
Alignment = 16; // 16-byte alignment.
|
2006-10-25 04:32:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return Alignment;
|
|
|
|
}
|
2008-01-29 14:23:44 +08:00
|
|
|
|
|
|
|
/// 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 TargetData::getPreferredAlignmentLog(const GlobalVariable *GV) const {
|
|
|
|
return Log2_32(getPreferredAlignment(GV));
|
|
|
|
}
|