2013-12-22 00:04:03 +00:00
|
|
|
//===-- AMDGPUTargetTransformInfo.cpp - AMDGPU specific TTI pass ---------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// \file
|
|
|
|
// This file implements a TargetTransformInfo analysis pass specific to the
|
|
|
|
// AMDGPU target machine. It uses the target's detailed information to provide
|
|
|
|
// more precise answers to certain TTI queries, while letting the target
|
|
|
|
// independent and default TTI implementations handle the rest.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2015-05-27 18:44:32 +00:00
|
|
|
#include "AMDGPUTargetTransformInfo.h"
|
2014-11-24 09:08:18 +00:00
|
|
|
#include "llvm/Analysis/LoopInfo.h"
|
2013-12-22 00:04:03 +00:00
|
|
|
#include "llvm/Analysis/TargetTransformInfo.h"
|
2014-11-24 09:08:18 +00:00
|
|
|
#include "llvm/Analysis/ValueTracking.h"
|
2015-05-27 18:44:32 +00:00
|
|
|
#include "llvm/CodeGen/BasicTTIImpl.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
2013-12-22 00:04:03 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Target/CostTable.h"
|
2014-11-24 09:08:18 +00:00
|
|
|
#include "llvm/Target/TargetLowering.h"
|
2013-12-22 00:04:03 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2014-11-24 09:08:18 +00:00
|
|
|
#define DEBUG_TYPE "AMDGPUtti"
|
|
|
|
|
2015-05-27 18:44:32 +00:00
|
|
|
void AMDGPUTTIImpl::getUnrollingPreferences(Loop *L,
|
|
|
|
TTI::UnrollingPreferences &UP) {
|
2015-01-18 16:17:27 +00:00
|
|
|
UP.Threshold = 300; // Twice the default.
|
2015-02-14 12:17:42 +00:00
|
|
|
UP.MaxCount = UINT_MAX;
|
2015-01-18 16:17:27 +00:00
|
|
|
UP.Partial = true;
|
|
|
|
|
|
|
|
// TODO: Do we want runtime unrolling?
|
|
|
|
|
2014-11-24 09:08:18 +00:00
|
|
|
for (const BasicBlock *BB : L->getBlocks()) {
|
2015-05-27 18:44:32 +00:00
|
|
|
const DataLayout &DL = BB->getModule()->getDataLayout();
|
2014-11-24 09:08:18 +00:00
|
|
|
for (const Instruction &I : *BB) {
|
|
|
|
const GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(&I);
|
|
|
|
if (!GEP || GEP->getAddressSpace() != AMDGPUAS::PRIVATE_ADDRESS)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
const Value *Ptr = GEP->getPointerOperand();
|
2015-05-27 18:44:32 +00:00
|
|
|
const AllocaInst *Alloca =
|
|
|
|
dyn_cast<AllocaInst>(GetUnderlyingObject(Ptr, DL));
|
2014-11-24 09:08:18 +00:00
|
|
|
if (Alloca) {
|
|
|
|
// We want to do whatever we can to limit the number of alloca
|
|
|
|
// instructions that make it through to the code generator. allocas
|
|
|
|
// require us to use indirect addressing, which is slow and prone to
|
|
|
|
// compiler bugs. If this loop does an address calculation on an
|
|
|
|
// alloca ptr, then we want to use a higher than normal loop unroll
|
|
|
|
// threshold. This will give SROA a better chance to eliminate these
|
|
|
|
// allocas.
|
|
|
|
//
|
|
|
|
// Don't use the maximum allowed value here as it will make some
|
|
|
|
// programs way too big.
|
2015-01-18 16:17:27 +00:00
|
|
|
UP.Threshold = 800;
|
2014-11-24 09:08:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-05-27 18:44:32 +00:00
|
|
|
unsigned AMDGPUTTIImpl::getNumberOfRegisters(bool Vec) {
|
2014-11-24 09:08:18 +00:00
|
|
|
if (Vec)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
// Number of VGPRs on SI.
|
|
|
|
if (ST->getGeneration() >= AMDGPUSubtarget::SOUTHERN_ISLANDS)
|
|
|
|
return 256;
|
|
|
|
|
|
|
|
return 4 * 128; // XXX - 4 channels. Should these count as vector instead?
|
|
|
|
}
|
|
|
|
|
2015-05-27 18:44:32 +00:00
|
|
|
unsigned AMDGPUTTIImpl::getRegisterBitWidth(bool) { return 32; }
|
2014-11-24 09:08:18 +00:00
|
|
|
|
2015-05-27 18:44:32 +00:00
|
|
|
unsigned AMDGPUTTIImpl::getMaxInterleaveFactor(unsigned VF) {
|
2014-11-24 09:08:18 +00:00
|
|
|
// Semi-arbitrary large amount.
|
|
|
|
return 64;
|
|
|
|
}
|