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
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and 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"
|
2003-04-25 03:09:05 +08:00
|
|
|
#include "llvm/Module.h"
|
2001-08-28 00:00:15 +08:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2002-04-29 03:55:58 +08:00
|
|
|
#include "llvm/Constants.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"
|
2006-05-12 13:49:47 +08:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2005-03-14 03:04:41 +08:00
|
|
|
#include <algorithm>
|
2006-05-12 13:49:47 +08:00
|
|
|
#include <cstdlib>
|
2006-05-12 15:01:44 +08:00
|
|
|
#include <sstream>
|
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.
|
2002-09-26 07:46:55 +08:00
|
|
|
namespace {
|
|
|
|
// Register the default SparcV9 implementation...
|
|
|
|
RegisterPass<TargetData> X("targetdata", "Target Data Layout");
|
|
|
|
}
|
|
|
|
|
2007-01-21 06:35:55 +08:00
|
|
|
static inline void getTypeInfoABI(const Type *Ty, const TargetData *TD,
|
|
|
|
uint64_t &Size, unsigned char &Alignment);
|
|
|
|
|
|
|
|
static inline void getTypeInfoPref(const Type *Ty, const TargetData *TD,
|
|
|
|
uint64_t &Size, unsigned char &Alignment);
|
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
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-02-26 16:02:17 +08:00
|
|
|
StructLayout::StructLayout(const StructType *ST, const TargetData &TD) {
|
2001-08-28 00:00:15 +08:00
|
|
|
StructAlignment = 0;
|
|
|
|
StructSize = 0;
|
|
|
|
|
|
|
|
// Loop over each of the elements, placing them in memory...
|
2005-04-22 06:55:34 +08:00
|
|
|
for (StructType::element_iterator TI = ST->element_begin(),
|
2004-07-23 09:09:52 +08:00
|
|
|
TE = ST->element_end(); TI != TE; ++TI) {
|
2001-08-28 00:00:15 +08:00
|
|
|
const Type *Ty = *TI;
|
|
|
|
unsigned char A;
|
2002-05-19 23:28:02 +08:00
|
|
|
unsigned TyAlign;
|
|
|
|
uint64_t TySize;
|
2007-01-21 06:35:55 +08:00
|
|
|
getTypeInfoABI(Ty, &TD, TySize, A);
|
2006-12-09 02:06:16 +08:00
|
|
|
TyAlign = ST->isPacked() ? 1 : A;
|
2001-08-28 00:00:15 +08:00
|
|
|
|
2003-08-18 22:43:39 +08:00
|
|
|
// Add padding if necessary to make the data element aligned properly...
|
2001-08-28 00:00:15 +08:00
|
|
|
if (StructSize % TyAlign != 0)
|
|
|
|
StructSize = (StructSize/TyAlign + 1) * TyAlign; // Add padding...
|
|
|
|
|
|
|
|
// 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
|
|
|
|
|
|
|
MemberOffsets.push_back(StructSize);
|
2002-05-19 23:28:02 +08:00
|
|
|
StructSize += TySize; // 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.
|
|
|
|
if (StructSize % StructAlignment != 0)
|
|
|
|
StructSize = (StructSize/StructAlignment + 1) * StructAlignment;
|
|
|
|
}
|
|
|
|
|
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 {
|
|
|
|
std::vector<uint64_t>::const_iterator SI =
|
2007-01-21 06:35:55 +08:00
|
|
|
std::upper_bound(MemberOffsets.begin(), MemberOffsets.end(), Offset);
|
2005-03-14 03:04:41 +08:00
|
|
|
assert(SI != MemberOffsets.begin() && "Offset not in structure type!");
|
|
|
|
--SI;
|
|
|
|
assert(*SI <= Offset && "upper_bound didn't work");
|
|
|
|
assert((SI == MemberOffsets.begin() || *(SI-1) < Offset) &&
|
|
|
|
(SI+1 == MemberOffsets.end() || *(SI+1) > Offset) &&
|
|
|
|
"Upper bound didn't work!");
|
|
|
|
return SI-MemberOffsets.begin();
|
|
|
|
}
|
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// TargetData Class Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-06-17 02:11:26 +08:00
|
|
|
void TargetData::init(const std::string &TargetDescription) {
|
2006-05-12 13:49:47 +08:00
|
|
|
std::string temp = TargetDescription;
|
|
|
|
|
|
|
|
LittleEndian = false;
|
2007-01-21 06:35:55 +08:00
|
|
|
PointerMemSize = 8;
|
|
|
|
PointerABIAlignment = 8;
|
2007-01-21 07:07:13 +08:00
|
|
|
DoubleABIAlignment = 0;
|
2007-01-21 06:35:55 +08:00
|
|
|
FloatABIAlignment = 4;
|
2007-01-21 07:07:13 +08:00
|
|
|
LongABIAlignment = 0;
|
2007-01-21 06:35:55 +08:00
|
|
|
IntABIAlignment = 4;
|
|
|
|
ShortABIAlignment = 2;
|
|
|
|
ByteABIAlignment = 1;
|
|
|
|
BoolABIAlignment = 1;
|
|
|
|
BoolPrefAlignment = BoolABIAlignment;
|
|
|
|
BytePrefAlignment = ByteABIAlignment;
|
|
|
|
ShortPrefAlignment = ShortABIAlignment;
|
|
|
|
IntPrefAlignment = IntABIAlignment;
|
2007-01-21 07:07:13 +08:00
|
|
|
LongPrefAlignment = 8;
|
2007-01-21 06:35:55 +08:00
|
|
|
FloatPrefAlignment = FloatABIAlignment;
|
2007-01-21 07:07:13 +08:00
|
|
|
DoublePrefAlignment = 8;
|
2007-01-21 06:35:55 +08:00
|
|
|
PointerPrefAlignment = PointerABIAlignment;
|
|
|
|
AggMinPrefAlignment = 0;
|
2006-05-12 13:49:47 +08:00
|
|
|
|
2006-05-20 08:24:56 +08:00
|
|
|
while (!temp.empty()) {
|
2006-05-12 13:49:47 +08:00
|
|
|
std::string token = getToken(temp, "-");
|
|
|
|
|
2006-05-18 05:56:02 +08:00
|
|
|
char signal = getToken(token, ":")[0];
|
|
|
|
|
|
|
|
switch(signal) {
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'E':
|
2006-05-12 14:06:55 +08:00
|
|
|
LittleEndian = false;
|
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'e':
|
2006-05-12 14:06:55 +08:00
|
|
|
LittleEndian = true;
|
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'p':
|
2007-01-21 06:35:55 +08:00
|
|
|
PointerMemSize = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
PointerABIAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
PointerPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (PointerPrefAlignment == 0)
|
|
|
|
PointerPrefAlignment = PointerABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'd':
|
2007-01-21 06:35:55 +08:00
|
|
|
DoubleABIAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
DoublePrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (DoublePrefAlignment == 0)
|
|
|
|
DoublePrefAlignment = DoubleABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'f':
|
2007-01-21 06:35:55 +08:00
|
|
|
FloatABIAlignment = atoi(getToken(token, ":").c_str()) / 8;
|
|
|
|
FloatPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (FloatPrefAlignment == 0)
|
|
|
|
FloatPrefAlignment = FloatABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'l':
|
2007-01-21 06:35:55 +08:00
|
|
|
LongABIAlignment = atoi(getToken(token, ":").c_str()) / 8;
|
|
|
|
LongPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (LongPrefAlignment == 0)
|
|
|
|
LongPrefAlignment = LongABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'i':
|
2007-01-21 06:35:55 +08:00
|
|
|
IntABIAlignment = atoi(getToken(token, ":").c_str()) / 8;
|
|
|
|
IntPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (IntPrefAlignment == 0)
|
|
|
|
IntPrefAlignment = IntABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 's':
|
2007-01-21 06:35:55 +08:00
|
|
|
ShortABIAlignment = atoi(getToken(token, ":").c_str()) / 8;
|
|
|
|
ShortPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (ShortPrefAlignment == 0)
|
|
|
|
ShortPrefAlignment = ShortABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'b':
|
2007-01-21 06:35:55 +08:00
|
|
|
ByteABIAlignment = atoi(getToken(token, ":").c_str()) / 8;
|
|
|
|
BytePrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (BytePrefAlignment == 0)
|
|
|
|
BytePrefAlignment = ByteABIAlignment;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
2006-05-12 13:49:47 +08:00
|
|
|
case 'B':
|
2007-01-21 06:35:55 +08:00
|
|
|
BoolABIAlignment = atoi(getToken(token, ":").c_str()) / 8;
|
|
|
|
BoolPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
|
|
|
if (BoolPrefAlignment == 0)
|
|
|
|
BoolPrefAlignment = BoolABIAlignment;
|
|
|
|
break;
|
|
|
|
case 'A':
|
|
|
|
AggMinPrefAlignment = atoi(getToken(token,":").c_str()) / 8;
|
2006-05-12 14:06:55 +08:00
|
|
|
break;
|
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
|
|
|
}
|
|
|
|
}
|
2007-01-21 07:07:13 +08:00
|
|
|
|
2007-01-26 16:11:39 +08:00
|
|
|
// Unless explicitly specified, the alignments for longs and doubles is
|
|
|
|
// capped by pointer size.
|
2007-01-21 07:07:13 +08:00
|
|
|
if (LongABIAlignment == 0)
|
|
|
|
LongABIAlignment = LongPrefAlignment = PointerMemSize;
|
|
|
|
if (DoubleABIAlignment == 0)
|
|
|
|
DoubleABIAlignment = DoublePrefAlignment = PointerMemSize;
|
2006-05-12 13:49:47 +08:00
|
|
|
}
|
|
|
|
|
2006-06-17 02:22:52 +08:00
|
|
|
TargetData::TargetData(const Module *M) {
|
2007-01-26 16:11:39 +08:00
|
|
|
init(M->getDataLayout());
|
2003-04-25 03:09:05 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 08:07:34 +08:00
|
|
|
/// Layouts - The lazy cache of structure layout information maintained by
|
|
|
|
/// TargetData.
|
|
|
|
///
|
2004-02-26 16:02:17 +08:00
|
|
|
static std::map<std::pair<const TargetData*,const StructType*>,
|
|
|
|
StructLayout> *Layouts = 0;
|
|
|
|
|
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
TargetData::~TargetData() {
|
2004-02-26 16:02:17 +08:00
|
|
|
if (Layouts) {
|
|
|
|
// Remove any layouts for this TD.
|
|
|
|
std::map<std::pair<const TargetData*,
|
|
|
|
const StructType*>, StructLayout>::iterator
|
|
|
|
I = Layouts->lower_bound(std::make_pair(this, (const StructType*)0));
|
|
|
|
while (I != Layouts->end() && I->first.first == this)
|
|
|
|
Layouts->erase(I++);
|
|
|
|
if (Layouts->empty()) {
|
|
|
|
delete Layouts;
|
|
|
|
Layouts = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-12 15:01:44 +08:00
|
|
|
std::string TargetData::getStringRepresentation() const {
|
|
|
|
std::stringstream repr;
|
|
|
|
|
|
|
|
if (LittleEndian)
|
|
|
|
repr << "e";
|
|
|
|
else
|
|
|
|
repr << "E";
|
|
|
|
|
2007-01-21 06:35:55 +08:00
|
|
|
repr << "-p:" << (PointerMemSize * 8) << ":" << (PointerABIAlignment * 8);
|
|
|
|
repr << "-d:" << (DoubleABIAlignment * 8) << ":"
|
|
|
|
<< (DoublePrefAlignment * 8);
|
|
|
|
repr << "-f:" << (FloatABIAlignment * 8) << ":"
|
|
|
|
<< (FloatPrefAlignment * 8);
|
|
|
|
repr << "-l:" << (LongABIAlignment * 8) << ":"
|
|
|
|
<< (LongPrefAlignment * 8);
|
|
|
|
repr << "-i:" << (IntABIAlignment * 8) << ":"
|
|
|
|
<< (IntPrefAlignment * 8);
|
|
|
|
repr << "-s:" << (ShortABIAlignment * 8) << ":"
|
|
|
|
<< (ShortPrefAlignment * 8);
|
|
|
|
repr << "-b:" << (ByteABIAlignment * 8) << ":"
|
|
|
|
<< (BytePrefAlignment * 8);
|
|
|
|
repr << "-B:" << (BoolABIAlignment * 8) << ":"
|
|
|
|
<< (BoolPrefAlignment * 8);
|
|
|
|
repr << "-A:" << (AggMinPrefAlignment * 8);
|
2006-05-12 15:01:44 +08:00
|
|
|
|
|
|
|
return repr.str();
|
|
|
|
}
|
|
|
|
|
2004-02-26 16:02:17 +08:00
|
|
|
const StructLayout *TargetData::getStructLayout(const StructType *Ty) const {
|
|
|
|
if (Layouts == 0)
|
|
|
|
Layouts = new std::map<std::pair<const TargetData*,const StructType*>,
|
|
|
|
StructLayout>();
|
|
|
|
std::map<std::pair<const TargetData*,const StructType*>,
|
|
|
|
StructLayout>::iterator
|
|
|
|
I = Layouts->lower_bound(std::make_pair(this, Ty));
|
|
|
|
if (I != Layouts->end() && I->first.first == this && I->first.second == Ty)
|
|
|
|
return &I->second;
|
|
|
|
else {
|
|
|
|
return &Layouts->insert(I, std::make_pair(std::make_pair(this, Ty),
|
|
|
|
StructLayout(Ty, *this)))->second;
|
|
|
|
}
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 08:07:34 +08:00
|
|
|
/// InvalidateStructLayoutInfo - TargetData speculatively caches StructLayout
|
|
|
|
/// objects. If a TargetData object is alive when types are being refined and
|
|
|
|
/// removed, this method must be called whenever a StructType is removed to
|
|
|
|
/// avoid a dangling pointer in this cache.
|
|
|
|
void TargetData::InvalidateStructLayoutInfo(const StructType *Ty) const {
|
|
|
|
if (!Layouts) return; // No cache.
|
|
|
|
|
|
|
|
std::map<std::pair<const TargetData*,const StructType*>,
|
|
|
|
StructLayout>::iterator I = Layouts->find(std::make_pair(this, Ty));
|
|
|
|
if (I != Layouts->end())
|
|
|
|
Layouts->erase(I);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2007-01-21 06:35:55 +08:00
|
|
|
static inline void getTypeInfoABI(const Type *Ty, const TargetData *TD,
|
|
|
|
uint64_t &Size, unsigned char &Alignment) {
|
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()) {
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 15:05:14 +08:00
|
|
|
case Type::IntegerTyID: {
|
|
|
|
unsigned BitWidth = cast<IntegerType>(Ty)->getBitWidth();
|
|
|
|
if (BitWidth <= 8) {
|
2007-01-21 06:35:55 +08:00
|
|
|
Size = 1; Alignment = TD->getByteABIAlignment();
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 15:05:14 +08:00
|
|
|
} else if (BitWidth <= 16) {
|
2007-01-21 06:35:55 +08:00
|
|
|
Size = 2; Alignment = TD->getShortABIAlignment();
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 15:05:14 +08:00
|
|
|
} else if (BitWidth <= 32) {
|
2007-01-21 06:35:55 +08:00
|
|
|
Size = 4; Alignment = TD->getIntABIAlignment();
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 15:05:14 +08:00
|
|
|
} else if (BitWidth <= 64) {
|
2007-01-21 06:35:55 +08:00
|
|
|
Size = 8; Alignment = TD->getLongABIAlignment();
|
2007-02-06 07:51:43 +08:00
|
|
|
} else {
|
|
|
|
Size = ((BitWidth + 7) / 8) & ~1;
|
|
|
|
Alignment = TD->getLongABIAlignment();
|
|
|
|
}
|
For PR1064:
Implement the arbitrary bit-width integer feature. The feature allows
integers of any bitwidth (up to 64) to be defined instead of just 1, 8,
16, 32, and 64 bit integers.
This change does several things:
1. Introduces a new Derived Type, IntegerType, to represent the number of
bits in an integer. The Type classes SubclassData field is used to
store the number of bits. This allows 2^23 bits in an integer type.
2. Removes the five integer Type::TypeID values for the 1, 8, 16, 32 and
64-bit integers. These are replaced with just IntegerType which is not
a primitive any more.
3. Adjust the rest of LLVM to account for this change.
Note that while this incremental change lays the foundation for arbitrary
bit-width integers, LLVM has not yet been converted to actually deal with
them in any significant way. Most optimization passes, for example, will
still only deal with the byte-width integer types. Future increments
will rectify this situation.
llvm-svn: 33113
2007-01-12 15:05:14 +08:00
|
|
|
return;
|
|
|
|
}
|
2007-01-21 06:35:55 +08:00
|
|
|
case Type::VoidTyID: Size = 1; Alignment = TD->getByteABIAlignment(); return;
|
|
|
|
case Type::FloatTyID: Size = 4; Alignment = TD->getFloatABIAlignment(); return;
|
|
|
|
case Type::DoubleTyID: Size = 8; Alignment = TD->getDoubleABIAlignment(); return;
|
2001-08-28 00:00:15 +08:00
|
|
|
case Type::LabelTyID:
|
|
|
|
case Type::PointerTyID:
|
2007-01-21 06:35:55 +08:00
|
|
|
Size = TD->getPointerSize(); Alignment = TD->getPointerABIAlignment();
|
2001-08-28 00:00:15 +08:00
|
|
|
return;
|
|
|
|
case Type::ArrayTyID: {
|
2004-07-02 01:32:59 +08:00
|
|
|
const ArrayType *ATy = cast<ArrayType>(Ty);
|
2007-01-21 06:35:55 +08:00
|
|
|
getTypeInfoABI(ATy->getElementType(), TD, Size, Alignment);
|
2004-07-02 15:01:31 +08:00
|
|
|
unsigned AlignedSize = (Size + Alignment - 1)/Alignment*Alignment;
|
2004-07-02 01:32:59 +08:00
|
|
|
Size = AlignedSize*ATy->getNumElements();
|
2001-08-28 00:00:15 +08:00
|
|
|
return;
|
|
|
|
}
|
2004-12-02 01:14:28 +08:00
|
|
|
case Type::PackedTyID: {
|
|
|
|
const PackedType *PTy = cast<PackedType>(Ty);
|
2007-01-21 06:35:55 +08:00
|
|
|
getTypeInfoABI(PTy->getElementType(), TD, Size, Alignment);
|
2004-12-02 01:14:28 +08:00
|
|
|
unsigned AlignedSize = (Size + Alignment - 1)/Alignment*Alignment;
|
|
|
|
Size = AlignedSize*PTy->getNumElements();
|
2006-04-01 06:33:42 +08:00
|
|
|
// FIXME: The alignments of specific packed types are target dependent.
|
|
|
|
// For now, just set it to be equal to Size.
|
2006-04-04 07:14:49 +08:00
|
|
|
Alignment = Size;
|
2004-12-02 01:14:28 +08:00
|
|
|
return;
|
|
|
|
}
|
2001-08-28 00:00:15 +08:00
|
|
|
case Type::StructTyID: {
|
|
|
|
// Get the layout annotation... which is lazily created on demand.
|
2004-07-02 01:32:59 +08:00
|
|
|
const StructLayout *Layout = TD->getStructLayout(cast<StructType>(Ty));
|
2001-08-28 00:00:15 +08:00
|
|
|
Size = Layout->StructSize; Alignment = Layout->StructAlignment;
|
|
|
|
return;
|
|
|
|
}
|
2005-04-22 06:55:34 +08:00
|
|
|
|
2001-08-28 00:00:15 +08:00
|
|
|
default:
|
|
|
|
assert(0 && "Bad type for getTypeInfo!!!");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-01-21 06:35:55 +08:00
|
|
|
static inline void getTypeInfoPref(const Type *Ty, const TargetData *TD,
|
|
|
|
uint64_t &Size, unsigned char &Alignment) {
|
|
|
|
assert(Ty->isSized() && "Cannot getTypeInfoPref() on a type that is unsized!");
|
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
case Type::IntegerTyID: {
|
|
|
|
unsigned BitWidth = cast<IntegerType>(Ty)->getBitWidth();
|
|
|
|
if (BitWidth <= 8) {
|
|
|
|
Size = 1; Alignment = TD->getBytePrefAlignment();
|
|
|
|
} else if (BitWidth <= 16) {
|
|
|
|
Size = 2; Alignment = TD->getShortPrefAlignment();
|
|
|
|
} else if (BitWidth <= 32) {
|
|
|
|
Size = 4; Alignment = TD->getIntPrefAlignment();
|
|
|
|
} else if (BitWidth <= 64) {
|
|
|
|
Size = 8; Alignment = TD->getLongPrefAlignment();
|
|
|
|
} else
|
|
|
|
assert(0 && "Integer types > 64 bits not supported.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
case Type::VoidTyID:
|
|
|
|
Size = 1; Alignment = TD->getBytePrefAlignment();
|
|
|
|
return;
|
|
|
|
case Type::FloatTyID:
|
|
|
|
Size = 4; Alignment = TD->getFloatPrefAlignment();
|
|
|
|
return;
|
|
|
|
case Type::DoubleTyID:
|
|
|
|
Size = 8; Alignment = TD->getDoublePrefAlignment();
|
|
|
|
return;
|
|
|
|
case Type::LabelTyID:
|
|
|
|
case Type::PointerTyID:
|
|
|
|
Size = TD->getPointerSize(); Alignment = TD->getPointerPrefAlignment();
|
|
|
|
return;
|
|
|
|
case Type::ArrayTyID: {
|
|
|
|
const ArrayType *ATy = cast<ArrayType>(Ty);
|
|
|
|
getTypeInfoPref(ATy->getElementType(), TD, Size, Alignment);
|
|
|
|
unsigned AlignedSize = (Size + Alignment - 1)/Alignment*Alignment;
|
|
|
|
Size = AlignedSize*ATy->getNumElements();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
case Type::PackedTyID: {
|
|
|
|
const PackedType *PTy = cast<PackedType>(Ty);
|
|
|
|
getTypeInfoPref(PTy->getElementType(), TD, Size, Alignment);
|
|
|
|
unsigned AlignedSize = (Size + Alignment - 1)/Alignment*Alignment;
|
|
|
|
Size = AlignedSize*PTy->getNumElements();
|
|
|
|
// FIXME: The alignments of specific packed types are target dependent.
|
|
|
|
// For now, just set it to be equal to Size.
|
|
|
|
Alignment = Size;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
case Type::StructTyID: {
|
|
|
|
// Get the layout annotation... which is lazily created on demand;
|
|
|
|
// enforce minimum aggregate alignment.
|
|
|
|
const StructLayout *Layout = TD->getStructLayout(cast<StructType>(Ty));
|
|
|
|
Size = Layout->StructSize;
|
|
|
|
Alignment = std::max(Layout->StructAlignment,
|
|
|
|
(const unsigned int) TD->getAggMinPrefAlignment());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
assert(0 && "Bad type for getTypeInfoPref!!!");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-19 23:28:02 +08:00
|
|
|
uint64_t TargetData::getTypeSize(const Type *Ty) const {
|
|
|
|
uint64_t Size;
|
|
|
|
unsigned char Align;
|
2007-01-21 06:35:55 +08:00
|
|
|
getTypeInfoABI(Ty, this, Size, Align);
|
2001-08-28 00:00:15 +08:00
|
|
|
return Size;
|
|
|
|
}
|
|
|
|
|
2007-01-21 07:32:04 +08:00
|
|
|
uint64_t TargetData::getTypeSizeInBits(const Type *Ty) const {
|
|
|
|
if (Ty->isInteger())
|
|
|
|
return cast<IntegerType>(Ty)->getBitWidth();
|
|
|
|
|
|
|
|
uint64_t Size;
|
|
|
|
unsigned char Align;
|
|
|
|
getTypeInfoABI(Ty, this, Size, Align);
|
|
|
|
return Size * 8;
|
|
|
|
}
|
|
|
|
|
2007-01-21 06:35:55 +08:00
|
|
|
unsigned char TargetData::getTypeAlignmentABI(const Type *Ty) const {
|
|
|
|
uint64_t Size;
|
|
|
|
unsigned char Align;
|
|
|
|
getTypeInfoABI(Ty, this, Size, Align);
|
|
|
|
return Align;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned char TargetData::getTypeAlignmentPref(const Type *Ty) const {
|
2002-05-19 23:28:02 +08:00
|
|
|
uint64_t Size;
|
|
|
|
unsigned char Align;
|
2007-01-21 06:35:55 +08:00
|
|
|
getTypeInfoPref(Ty, this, Size, Align);
|
2001-08-28 00:00:15 +08:00
|
|
|
return Align;
|
|
|
|
}
|
|
|
|
|
2007-01-24 15:03:39 +08:00
|
|
|
unsigned char TargetData::getPreferredTypeAlignmentShift(const Type *Ty) const {
|
2007-01-23 07:08:19 +08:00
|
|
|
unsigned Align = getTypeAlignmentPref(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.
|
|
|
|
const Type *TargetData::getIntPtrType() const {
|
|
|
|
switch (getPointerSize()) {
|
|
|
|
default: assert(0 && "Unknown pointer size!");
|
2006-12-31 13:55:36 +08:00
|
|
|
case 2: return Type::Int16Ty;
|
|
|
|
case 4: return Type::Int32Ty;
|
|
|
|
case 8: return Type::Int64Ty;
|
2003-12-22 13:01:15 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-19 23:28:02 +08:00
|
|
|
uint64_t TargetData::getIndexedOffset(const Type *ptrTy,
|
2004-07-23 09:09:52 +08:00
|
|
|
const std::vector<Value*> &Idx) const {
|
2002-08-05 04:52:39 +08:00
|
|
|
const Type *Ty = ptrTy;
|
|
|
|
assert(isa<PointerType>(Ty) && "Illegal argument for getIndexedOffset()");
|
2002-05-19 23:28:02 +08:00
|
|
|
uint64_t Result = 0;
|
|
|
|
|
2004-04-05 09:30:19 +08:00
|
|
|
generic_gep_type_iterator<std::vector<Value*>::const_iterator>
|
|
|
|
TI = gep_type_begin(ptrTy, Idx.begin(), Idx.end());
|
|
|
|
for (unsigned CurIDX = 0; CurIDX != Idx.size(); ++CurIDX, ++TI) {
|
|
|
|
if (const StructType *STy = dyn_cast<StructType>(*TI)) {
|
2006-12-31 13:55:36 +08:00
|
|
|
assert(Idx[CurIDX]->getType() == Type::Int32Ty && "Illegal struct idx");
|
2006-10-20 15:07:24 +08:00
|
|
|
unsigned FieldNo = cast<ConstantInt>(Idx[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...
|
2002-05-19 23:28:02 +08:00
|
|
|
assert(FieldNo < Layout->MemberOffsets.size() &&"FieldNo out of range!");
|
2001-08-28 00:00:15 +08:00
|
|
|
Result += Layout->MemberOffsets[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.
|
2006-10-20 15:07:24 +08:00
|
|
|
int64_t arrayIdx = cast<ConstantInt>(Idx[CurIDX])->getSExtValue();
|
2004-04-05 09:30:19 +08:00
|
|
|
Result += arrayIdx * (int64_t)getTypeSize(Ty);
|
2001-08-28 00:00:15 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Result;
|
|
|
|
}
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2006-10-25 04:32:14 +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 {
|
|
|
|
const Type *ElemType = GV->getType()->getElementType();
|
2007-01-24 15:03:39 +08:00
|
|
|
unsigned Alignment = getPreferredTypeAlignmentShift(ElemType);
|
2006-10-25 04:32:14 +08:00
|
|
|
if (GV->getAlignment() > (1U << Alignment))
|
|
|
|
Alignment = Log2_32(GV->getAlignment());
|
|
|
|
|
|
|
|
if (GV->hasInitializer()) {
|
|
|
|
if (Alignment < 4) {
|
|
|
|
// If the global is not external, see if it is large. If so, give it a
|
|
|
|
// larger alignment.
|
|
|
|
if (getTypeSize(ElemType) > 128)
|
|
|
|
Alignment = 4; // 16-byte alignment.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return Alignment;
|
|
|
|
}
|
|
|
|
|