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

* Add critical node support

Browse Source 
* Optimize graph after building it.  This should be unneccesary in the future

llvm-svn: 2002
This commit is contained in:
Chris Lattner 2002-03-27 19:45:12 +00:00
parent 9aff5a8047
commit a16c85b43d
1 changed files with 20 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
lib/Analysis/DataStructure/FunctionRepBuilder.cpp
View File

@ -1,4 +1,4 @@
//===- FunctionRepBuilder.cpp - Build the datastructure graph for a method --===// //===- FunctionRepBuilder.cpp - Build the local datastructure graph -------===//
// //
// Build the local datastructure graph for a single method. // Build the local datastructure graph for a single method.
// //
@ -47,6 +47,9 @@ void InitVisitor::visitOperand(Value *V) {
Rep->Nodes.push_back(N); Rep->Nodes.push_back(N);
Rep->ValueMap[V].add(N); Rep->ValueMap[V].add(N);
Rep->addAllUsesToWorkList(GV); Rep->addAllUsesToWorkList(GV);
// FIXME: If the global variable has fields, we should add critical
// shadow nodes to represent them!
} }
} }
@ -61,9 +64,9 @@ void InitVisitor::visitCallInst(CallInst *CI) {
Rep->CallMap[CI] = C; Rep->CallMap[CI] = C;
if (isa<PointerType>(CI->getType())) { if (isa<PointerType>(CI->getType())) {
// Create a shadow node to represent the memory object that the return // Create a critical shadow node to represent the memory object that the
// value points to... // return value points to...
ShadowDSNode *Shad = new ShadowDSNode(C, Func->getParent()); ShadowDSNode *Shad = new ShadowDSNode(C, Func->getParent(), true);
Rep->ShadowNodes.push_back(Shad); Rep->ShadowNodes.push_back(Shad);
// The return value of the function is a pointer to the shadow value // The return value of the function is a pointer to the shadow value
@ -143,9 +146,9 @@ void FunctionRepBuilder::initializeWorkList(Function *Func) {
ArgDSNode *Arg = new ArgDSNode(*I); ArgDSNode *Arg = new ArgDSNode(*I);
Nodes.push_back(Arg); Nodes.push_back(Arg);
// Add a shadow value for it to represent what it is pointing // Add a critical shadow value for it to represent what it is pointing
// to and add this to the value map... // to and add this to the value map...
ShadowDSNode *Shad = new ShadowDSNode(Arg, Func->getParent()); ShadowDSNode *Shad = new ShadowDSNode(Arg, Func->getParent(), true);
ShadowNodes.push_back(Shad); ShadowNodes.push_back(Shad);
ValueMap[*I].add(PointerVal(Shad), *I); ValueMap[*I].add(PointerVal(Shad), *I);
@ -327,5 +330,16 @@ FunctionDSGraph::FunctionDSGraph(Function *F) : Func(F) {
ShadowNodes = Builder.getShadowNodes(); ShadowNodes = Builder.getShadowNodes();
RetNode = Builder.getRetNode(); RetNode = Builder.getRetNode();
ValueMap = Builder.getValueMap(); ValueMap = Builder.getValueMap();
bool Changed = true;
while (Changed) {
// Eliminate shadow nodes that are not distinguishable from some other
// node in the graph...
//
Changed = UnlinkUndistinguishableShadowNodes();
// Eliminate shadow nodes that are now extraneous due to linking...
Changed |= RemoveUnreachableShadowNodes();
}
} }