RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-20 02:34:48 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

The promotion rules are the same for all targets, they are set by the C standard.

Browse Source 
llvm-svn: 5962
This commit is contained in:
Chris Lattner 2003-04-26 19:47:36 +00:00
parent cb8a4add15
commit 1039176b52
1 changed files with 3 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
lib/Target/TargetMachine.cpp
View File

@ -20,16 +20,10 @@
// function TargetMachine::findOptimalStorageSize
//
// Purpose:
// This default implementation assumes that all sub-word data items use
// space equal to optSizeForSubWordData, and all other primitive data
// items use space according to the type.
//
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();
// All integer types smaller than ints promote to 4 byte integers.
if (Ty->isIntegral() && Ty->getPrimitiveSize() < 4)
return 4;
return DataLayout.getTypeSize(Ty);
}