RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-26 13:36:28 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

* Give alloca's for pool descriptors better names than "pool<n>".

Browse Source 
* Fill in the pool descriptor links in the pool descriptors.

llvm-svn: 2239
This commit is contained in:
Chris Lattner 2002-04-13 19:52:54 +00:00
parent 249f5243f1
commit 47b17915d5
1 changed files with 28 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1183,8 +1183,9 @@ void PoolAllocate::CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
"Pool type should not be abstract anymore!");
// Add an allocation and a free for each pool...
AllocaInst *PoolAlloc = new AllocaInst(PointerType::get(PI.PoolType),
0, "pool");
AllocaInst *PoolAlloc
= new AllocaInst(PointerType::get(PI.PoolType), 0,
CurModule->getTypeName(PI.PoolType));
PI.Handle = PoolAlloc;
EntryNodeInsts.push_back(PoolAlloc);
AllocationInst *AI = Allocs[i]->getAllocation();
@ -1201,9 +1202,6 @@ void PoolAllocate::CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
Args.push_back(PoolAlloc); // Pool to initialize
EntryNodeInsts.push_back(new CallInst(PoolInit, Args));
// FIXME: add code to initialize inter pool links
cerr << "TODO: add code to initialize inter pool links!\n";
// Add code to destroy the pool in all of the exit nodes of the function...
Args.clear();
Args.push_back(PoolAlloc); // Pool to initialize
@ -1217,6 +1215,31 @@ void PoolAllocate::CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
}
}
// Now that all of the pool descriptors have been created, link them together
// so that called functions can get links as neccesary...
//
for (unsigned i = 0, e = Allocs.size(); i != e; ++i) {
PoolInfo &PI = PoolDescs[Allocs[i]];
// For every pointer in the data structure, initialize a link that
// indicates which pool to access...
//
vector<Value*> Indices(2);
Indices[0] = ConstantUInt::get(Type::UIntTy, 0);
for (unsigned l = 0, le = PI.Node->getNumLinks(); l != le; ++l)
// Only store an entry for the field if the field is used!
if (!PI.Node->getLink(l).empty()) {
assert(PI.Node->getLink(l).size() == 1 && "Should have only one link!");
PointerVal PV = PI.Node->getLink(l)[0];
assert(PV.Index == 0 && "Subindexing not supported yet!");
PoolInfo &LinkedPool = PoolDescs[PV.Node];
Indices[1] = ConstantUInt::get(Type::UByteTy, 1+l);
EntryNodeInsts.push_back(new StoreInst(LinkedPool.Handle, PI.Handle,
Indices));
}
}
// Insert the entry node code into the entry block...
F->getEntryNode()->getInstList().insert(F->getEntryNode()->begin()+1,
EntryNodeInsts.begin(),