1 //===-- AMDGPUPromoteAlloca.cpp - Promote Allocas -------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass eliminates allocas by either converting them into vectors or
11 // by migrating them to local address space.
13 //===----------------------------------------------------------------------===//
16 #include "AMDGPUSubtarget.h"
17 #include "llvm/Analysis/ValueTracking.h"
18 #include "llvm/IR/IRBuilder.h"
19 #include "llvm/IR/InstVisitor.h"
20 #include "llvm/Support/Debug.h"
21 #include "llvm/Support/raw_ostream.h"
23 #define DEBUG_TYPE "amdgpu-promote-alloca"
29 class AMDGPUPromoteAlloca : public FunctionPass,
30 public InstVisitor<AMDGPUPromoteAlloca> {
34 const AMDGPUSubtarget &ST;
35 int LocalMemAvailable;
38 AMDGPUPromoteAlloca(const AMDGPUSubtarget &st) : FunctionPass(ID), ST(st),
39 LocalMemAvailable(0) { }
40 bool doInitialization(Module &M) override;
41 bool runOnFunction(Function &F) override;
42 const char *getPassName() const override { return "AMDGPU Promote Alloca"; }
43 void visitAlloca(AllocaInst &I);
46 } // End anonymous namespace
48 char AMDGPUPromoteAlloca::ID = 0;
50 bool AMDGPUPromoteAlloca::doInitialization(Module &M) {
55 bool AMDGPUPromoteAlloca::runOnFunction(Function &F) {
57 FunctionType *FTy = F.getFunctionType();
59 LocalMemAvailable = ST.getLocalMemorySize();
62 // If the function has any arguments in the local address space, then it's
63 // possible these arguments require the entire local memory space, so
64 // we cannot use local memory in the pass.
65 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) {
66 Type *ParamTy = FTy->getParamType(i);
67 if (ParamTy->isPointerTy() &&
68 ParamTy->getPointerAddressSpace() == AMDGPUAS::LOCAL_ADDRESS) {
69 LocalMemAvailable = 0;
70 DEBUG(dbgs() << "Function has local memory argument. Promoting to "
71 "local memory disabled.\n");
76 if (LocalMemAvailable > 0) {
77 // Check how much local memory is being used by global objects
78 for (Module::global_iterator I = Mod->global_begin(),
79 E = Mod->global_end(); I != E; ++I) {
80 GlobalVariable *GV = I;
81 PointerType *GVTy = GV->getType();
82 if (GVTy->getAddressSpace() != AMDGPUAS::LOCAL_ADDRESS)
84 for (Value::use_iterator U = GV->use_begin(),
85 UE = GV->use_end(); U != UE; ++U) {
86 Instruction *Use = dyn_cast<Instruction>(*U);
89 if (Use->getParent()->getParent() == &F)
91 Mod->getDataLayout().getTypeAllocSize(GVTy->getElementType());
96 LocalMemAvailable = std::max(0, LocalMemAvailable);
97 DEBUG(dbgs() << LocalMemAvailable << "bytes free in local memory.\n");
104 static VectorType *arrayTypeToVecType(Type *ArrayTy) {
105 return VectorType::get(ArrayTy->getArrayElementType(),
106 ArrayTy->getArrayNumElements());
110 calculateVectorIndex(Value *Ptr,
111 const std::map<GetElementPtrInst *, Value *> &GEPIdx) {
112 if (isa<AllocaInst>(Ptr))
113 return Constant::getNullValue(Type::getInt32Ty(Ptr->getContext()));
115 GetElementPtrInst *GEP = cast<GetElementPtrInst>(Ptr);
117 auto I = GEPIdx.find(GEP);
118 return I == GEPIdx.end() ? nullptr : I->second;
121 static Value* GEPToVectorIndex(GetElementPtrInst *GEP) {
122 // FIXME we only support simple cases
123 if (GEP->getNumOperands() != 3)
126 ConstantInt *I0 = dyn_cast<ConstantInt>(GEP->getOperand(1));
127 if (!I0 || !I0->isZero())
130 return GEP->getOperand(2);
133 // Not an instruction handled below to turn into a vector.
135 // TODO: Check isTriviallyVectorizable for calls and handle other
137 static bool canVectorizeInst(Instruction *Inst, User *User) {
138 switch (Inst->getOpcode()) {
139 case Instruction::Load:
140 case Instruction::BitCast:
141 case Instruction::AddrSpaceCast:
143 case Instruction::Store: {
144 // Must be the stored pointer operand, not a stored value.
145 StoreInst *SI = cast<StoreInst>(Inst);
146 return SI->getPointerOperand() == User;
153 static bool tryPromoteAllocaToVector(AllocaInst *Alloca) {
154 Type *AllocaTy = Alloca->getAllocatedType();
156 DEBUG(dbgs() << "Alloca Candidate for vectorization \n");
158 // FIXME: There is no reason why we can't support larger arrays, we
159 // are just being conservative for now.
160 if (!AllocaTy->isArrayTy() ||
161 AllocaTy->getArrayElementType()->isVectorTy() ||
162 AllocaTy->getArrayNumElements() > 4) {
164 DEBUG(dbgs() << " Cannot convert type to vector");
168 std::map<GetElementPtrInst*, Value*> GEPVectorIdx;
169 std::vector<Value*> WorkList;
170 for (User *AllocaUser : Alloca->users()) {
171 GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(AllocaUser);
173 if (!canVectorizeInst(cast<Instruction>(AllocaUser), Alloca))
176 WorkList.push_back(AllocaUser);
180 Value *Index = GEPToVectorIndex(GEP);
182 // If we can't compute a vector index from this GEP, then we can't
183 // promote this alloca to vector.
185 DEBUG(dbgs() << " Cannot compute vector index for GEP " << *GEP << '\n');
189 GEPVectorIdx[GEP] = Index;
190 for (User *GEPUser : AllocaUser->users()) {
191 if (!canVectorizeInst(cast<Instruction>(GEPUser), AllocaUser))
194 WorkList.push_back(GEPUser);
198 VectorType *VectorTy = arrayTypeToVecType(AllocaTy);
200 DEBUG(dbgs() << " Converting alloca to vector "
201 << *AllocaTy << " -> " << *VectorTy << '\n');
203 for (std::vector<Value*>::iterator I = WorkList.begin(),
204 E = WorkList.end(); I != E; ++I) {
205 Instruction *Inst = cast<Instruction>(*I);
206 IRBuilder<> Builder(Inst);
207 switch (Inst->getOpcode()) {
208 case Instruction::Load: {
209 Value *Ptr = Inst->getOperand(0);
210 Value *Index = calculateVectorIndex(Ptr, GEPVectorIdx);
211 Value *BitCast = Builder.CreateBitCast(Alloca, VectorTy->getPointerTo(0));
212 Value *VecValue = Builder.CreateLoad(BitCast);
213 Value *ExtractElement = Builder.CreateExtractElement(VecValue, Index);
214 Inst->replaceAllUsesWith(ExtractElement);
215 Inst->eraseFromParent();
218 case Instruction::Store: {
219 Value *Ptr = Inst->getOperand(1);
220 Value *Index = calculateVectorIndex(Ptr, GEPVectorIdx);
221 Value *BitCast = Builder.CreateBitCast(Alloca, VectorTy->getPointerTo(0));
222 Value *VecValue = Builder.CreateLoad(BitCast);
223 Value *NewVecValue = Builder.CreateInsertElement(VecValue,
226 Builder.CreateStore(NewVecValue, BitCast);
227 Inst->eraseFromParent();
230 case Instruction::BitCast:
231 case Instruction::AddrSpaceCast:
236 llvm_unreachable("Inconsistency in instructions promotable to vector");
242 static bool collectUsesWithPtrTypes(Value *Val, std::vector<Value*> &WorkList) {
244 for (User *User : Val->users()) {
245 if(std::find(WorkList.begin(), WorkList.end(), User) != WorkList.end())
247 if (CallInst *CI = dyn_cast<CallInst>(User)) {
248 // TODO: We might be able to handle some cases where the callee is a
249 // constantexpr bitcast of a function.
250 if (!CI->getCalledFunction())
253 WorkList.push_back(User);
257 // FIXME: Correctly handle ptrtoint instructions.
258 Instruction *UseInst = dyn_cast<Instruction>(User);
259 if (UseInst && UseInst->getOpcode() == Instruction::PtrToInt)
262 if (StoreInst *SI = dyn_cast_or_null<StoreInst>(UseInst)) {
263 // Reject if the stored value is not the pointer operand.
264 if (SI->getPointerOperand() != Val)
268 if (!User->getType()->isPointerTy())
271 WorkList.push_back(User);
273 Success &= collectUsesWithPtrTypes(User, WorkList);
278 void AMDGPUPromoteAlloca::visitAlloca(AllocaInst &I) {
279 IRBuilder<> Builder(&I);
281 // First try to replace the alloca with a vector
282 Type *AllocaTy = I.getAllocatedType();
284 DEBUG(dbgs() << "Trying to promote " << I << '\n');
286 if (tryPromoteAllocaToVector(&I))
289 DEBUG(dbgs() << " alloca is not a candidate for vectorization.\n");
291 // FIXME: This is the maximum work group size. We should try to get
292 // value from the reqd_work_group_size function attribute if it is
294 unsigned WorkGroupSize = 256;
296 WorkGroupSize * Mod->getDataLayout().getTypeAllocSize(AllocaTy);
298 if (AllocaSize > LocalMemAvailable) {
299 DEBUG(dbgs() << " Not enough local memory to promote alloca.\n");
303 std::vector<Value*> WorkList;
305 if (!collectUsesWithPtrTypes(&I, WorkList)) {
306 DEBUG(dbgs() << " Do not know how to convert all uses\n");
310 DEBUG(dbgs() << "Promoting alloca to local memory\n");
311 LocalMemAvailable -= AllocaSize;
313 Type *GVTy = ArrayType::get(I.getAllocatedType(), 256);
314 GlobalVariable *GV = new GlobalVariable(
315 *Mod, GVTy, false, GlobalValue::ExternalLinkage, 0, I.getName(), 0,
316 GlobalVariable::NotThreadLocal, AMDGPUAS::LOCAL_ADDRESS);
318 FunctionType *FTy = FunctionType::get(
319 Type::getInt32Ty(Mod->getContext()), false);
320 AttributeSet AttrSet;
321 AttrSet.addAttribute(Mod->getContext(), 0, Attribute::ReadNone);
323 Value *ReadLocalSizeY = Mod->getOrInsertFunction(
324 "llvm.r600.read.local.size.y", FTy, AttrSet);
325 Value *ReadLocalSizeZ = Mod->getOrInsertFunction(
326 "llvm.r600.read.local.size.z", FTy, AttrSet);
327 Value *ReadTIDIGX = Mod->getOrInsertFunction(
328 "llvm.r600.read.tidig.x", FTy, AttrSet);
329 Value *ReadTIDIGY = Mod->getOrInsertFunction(
330 "llvm.r600.read.tidig.y", FTy, AttrSet);
331 Value *ReadTIDIGZ = Mod->getOrInsertFunction(
332 "llvm.r600.read.tidig.z", FTy, AttrSet);
334 Value *TCntY = Builder.CreateCall(ReadLocalSizeY, {});
335 Value *TCntZ = Builder.CreateCall(ReadLocalSizeZ, {});
336 Value *TIdX = Builder.CreateCall(ReadTIDIGX, {});
337 Value *TIdY = Builder.CreateCall(ReadTIDIGY, {});
338 Value *TIdZ = Builder.CreateCall(ReadTIDIGZ, {});
340 Value *Tmp0 = Builder.CreateMul(TCntY, TCntZ);
341 Tmp0 = Builder.CreateMul(Tmp0, TIdX);
342 Value *Tmp1 = Builder.CreateMul(TIdY, TCntZ);
343 Value *TID = Builder.CreateAdd(Tmp0, Tmp1);
344 TID = Builder.CreateAdd(TID, TIdZ);
346 std::vector<Value*> Indices;
347 Indices.push_back(Constant::getNullValue(Type::getInt32Ty(Mod->getContext())));
348 Indices.push_back(TID);
350 Value *Offset = Builder.CreateGEP(GVTy, GV, Indices);
351 I.mutateType(Offset->getType());
352 I.replaceAllUsesWith(Offset);
355 for (std::vector<Value*>::iterator i = WorkList.begin(),
356 e = WorkList.end(); i != e; ++i) {
358 CallInst *Call = dyn_cast<CallInst>(V);
360 Type *EltTy = V->getType()->getPointerElementType();
361 PointerType *NewTy = PointerType::get(EltTy, AMDGPUAS::LOCAL_ADDRESS);
363 // The operand's value should be corrected on its own.
364 if (isa<AddrSpaceCastInst>(V))
367 // FIXME: It doesn't really make sense to try to do this for all
369 V->mutateType(NewTy);
373 IntrinsicInst *Intr = dyn_cast<IntrinsicInst>(Call);
375 std::vector<Type*> ArgTypes;
376 for (unsigned ArgIdx = 0, ArgEnd = Call->getNumArgOperands();
377 ArgIdx != ArgEnd; ++ArgIdx) {
378 ArgTypes.push_back(Call->getArgOperand(ArgIdx)->getType());
380 Function *F = Call->getCalledFunction();
381 FunctionType *NewType = FunctionType::get(Call->getType(), ArgTypes,
383 Constant *C = Mod->getOrInsertFunction((F->getName() + ".local").str(),
384 NewType, F->getAttributes());
385 Function *NewF = cast<Function>(C);
386 Call->setCalledFunction(NewF);
390 Builder.SetInsertPoint(Intr);
391 switch (Intr->getIntrinsicID()) {
392 case Intrinsic::lifetime_start:
393 case Intrinsic::lifetime_end:
394 // These intrinsics are for address space 0 only
395 Intr->eraseFromParent();
397 case Intrinsic::memcpy: {
398 MemCpyInst *MemCpy = cast<MemCpyInst>(Intr);
399 Builder.CreateMemCpy(MemCpy->getRawDest(), MemCpy->getRawSource(),
400 MemCpy->getLength(), MemCpy->getAlignment(),
401 MemCpy->isVolatile());
402 Intr->eraseFromParent();
405 case Intrinsic::memset: {
406 MemSetInst *MemSet = cast<MemSetInst>(Intr);
407 Builder.CreateMemSet(MemSet->getRawDest(), MemSet->getValue(),
408 MemSet->getLength(), MemSet->getAlignment(),
409 MemSet->isVolatile());
410 Intr->eraseFromParent();
415 llvm_unreachable("Don't know how to promote alloca intrinsic use.");
420 FunctionPass *llvm::createAMDGPUPromoteAlloca(const AMDGPUSubtarget &ST) {
421 return new AMDGPUPromoteAlloca(ST);