mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-01 08:23:21 +01:00
69d676cd12
Intrinsics already existed for the 64-bit variants, so these support operations of size at most 32-bits. llvm-svn: 186392
47 lines
1.5 KiB
C++
47 lines
1.5 KiB
C++
//===-- AllocaHoisting.cpp - Hoist allocas to the entry block --*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Hoist the alloca instructions in the non-entry blocks to the entry blocks.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "NVPTXAllocaHoisting.h"
|
|
#include "llvm/IR/Constants.h"
|
|
#include "llvm/IR/Function.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
namespace llvm {
|
|
|
|
bool NVPTXAllocaHoisting::runOnFunction(Function &function) {
|
|
bool functionModified = false;
|
|
Function::iterator I = function.begin();
|
|
TerminatorInst *firstTerminatorInst = (I++)->getTerminator();
|
|
|
|
for (Function::iterator E = function.end(); I != E; ++I) {
|
|
for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) {
|
|
AllocaInst *allocaInst = dyn_cast<AllocaInst>(BI++);
|
|
if (allocaInst && isa<ConstantInt>(allocaInst->getArraySize())) {
|
|
allocaInst->moveBefore(firstTerminatorInst);
|
|
functionModified = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
return functionModified;
|
|
}
|
|
|
|
char NVPTXAllocaHoisting::ID = 1;
|
|
static RegisterPass<NVPTXAllocaHoisting>
|
|
X("alloca-hoisting", "Hoisting alloca instructions in non-entry "
|
|
"blocks to the entry block");
|
|
|
|
FunctionPass *createAllocaHoisting() { return new NVPTXAllocaHoisting(); }
|
|
|
|
} // end namespace llvm
|