//===-- TargetMachine.cpp - General Target Information ---------------------==//
+//
+// 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.
+//
+//===----------------------------------------------------------------------===//
//
// This file describes the general parts of a Target machine.
-// This file also implements MachineCacheInfo.
+// This file also implements TargetCacheInfo.
//
//===----------------------------------------------------------------------===//
#include "llvm/Target/TargetMachine.h"
-#include "llvm/Target/MachineCacheInfo.h"
+#include "llvm/Target/TargetCacheInfo.h"
#include "llvm/Type.h"
//---------------------------------------------------------------------------
// 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);
}
//---------------------------------------------------------------------------
-// class MachineCacheInfo
+// class TargetCacheInfo
//
// Purpose:
// Describes properties of the target cache architecture.
//---------------------------------------------------------------------------
-void MachineCacheInfo::Initialize() {
+void TargetCacheInfo::Initialize() {
numLevels = 2;
cacheLineSizes.push_back(16); cacheLineSizes.push_back(32);
cacheSizes.push_back(1 << 15); cacheSizes.push_back(1 << 20);