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

Modularize code a bit

Browse Source 
llvm-svn: 2040
This commit is contained in:
Chris Lattner 2002-03-29 06:21:38 +00:00
parent 7c2529076a
commit 3a9f1dd66a
1 changed files with 25 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
lib/Transforms/IPO/OldPoolAllocate.cpp
View File

@ -66,6 +66,15 @@ namespace {
//
void addPoolPrototypes(Module *M);
// CreatePools - Insert instructions into the function we are processing to
// create all of the memory pool objects themselves. This also inserts
// destruction code. Add an alloca for each pool that is allocated to the
// PoolDescriptors vector.
//
void CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
vector<AllocaInst*> &PoolDescriptors);
// processFunction - Convert a function to use pool allocation where
// available.
//
@ -143,6 +152,22 @@ bool PoolAllocate::processFunction(Function *F) {
for (unsigned i = 0, e = Scalars.size(); i != e; ++i)
Scalars[i].first->dump();
// Insert instructions into the function we are processing to create all of
// the memory pool objects themselves. This also inserts destruction code.
vector<AllocaInst*> PoolDescriptors;
CreatePools(F, Allocs, PoolDescriptors);
return true;
}
// CreatePools - Insert instructions into the function we are processing to
// create all of the memory pool objects themselves. This also inserts
// destruction code. Add an alloca for each pool that is allocated to the
// PoolDescriptors vector.
//
void PoolAllocate::CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
vector<AllocaInst*> &PoolDescriptors) {
// FIXME: This should use an IP version of the UnifyAllExits pass!
vector<BasicBlock*> ReturnNodes;
for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I)
@ -187,8 +212,6 @@ bool PoolAllocate::processFunction(Function *F) {
F->getEntryNode()->getInstList().insert(F->getEntryNode()->begin()+1,
EntryNodeInsts.begin(),
EntryNodeInsts.end());
return false;
}