RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-15 07:59:57 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Implement findOptimalStorageSize a bit more generally

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4416 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-10-29 21:47:50 +00:00
parent 6334205cb5
commit 62eaf7ef60
1 changed files with 7 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
lib/Target/TargetMachine.cpp
View File

@ -25,21 +25,13 @@
// space equal to optSizeForSubWordData, and all other primitive data
// items use space according to the type.
//
unsigned int
TargetMachine::findOptimalStorageSize(const Type* ty) const
{
switch(ty->getPrimitiveID())
{
case Type::BoolTyID:
case Type::UByteTyID:
case Type::SByteTyID:
case Type::UShortTyID:
case Type::ShortTyID:
return optSizeForSubWordData;
default:
return DataLayout.getTypeSize(ty);
}
unsigned TargetMachine::findOptimalStorageSize(const Type *Ty) const {
// Round integral values smaller than SubWordDataSize up to SubWordDataSize
if (Ty->isIntegral() &&
Ty->getPrimitiveSize() < DataLayout.getSubWordDataSize())
return DataLayout.getSubWordDataSize();
return DataLayout.getTypeSize(Ty);
}