diff options
| author | Chris Lattner <sabre@nondot.org> | 2005-03-24 18:42:51 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2005-03-24 18:42:51 +0000 |
| commit | 923d925953e05eca49818991dc7e456ea96094fe (patch) | |
| tree | 18fc69d31b1f80045555a41330069a838537c370 /llvm/lib/Analysis | |
| parent | ba6006d84b68d14c8027215abcef8c112cbdf11c (diff) | |
| download | bcm5719-llvm-923d925953e05eca49818991dc7e456ea96094fe.tar.gz bcm5719-llvm-923d925953e05eca49818991dc7e456ea96094fe.zip | |
don't bother |'ing in 0's
llvm-svn: 20815
Diffstat (limited to 'llvm/lib/Analysis')
| -rw-r--r-- | llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp | 2 | ||||
| -rw-r--r-- | llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp | 2 | ||||
| -rw-r--r-- | llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp | 2 |
3 files changed, 2 insertions, 4 deletions
diff --git a/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp b/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp index 5dcaa31dca2..46817b1597e 100644 --- a/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp +++ b/llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp @@ -369,7 +369,6 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { << Graph.getFunctionNames() << "' [" << Graph.getGraphSize() <<"+" << Graph.getAuxFunctionCalls().size() << "]\n"); Graph.mergeInGraph(CS, *Callee, *GI, - DSGraph::KeepModRefBits | DSGraph::StripAllocaBit|DSGraph::DontCloneCallNodes); ++NumBUInlines; } else { @@ -444,7 +443,6 @@ void BUDataStructures::calculateGraph(DSGraph &Graph) { << Graph.getAuxFunctionCalls().size() << "]\n"); Graph.mergeInGraph(CS, IndCallGraph.second, *GI, - DSGraph::KeepModRefBits | DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes); ++NumBUInlines; diff --git a/llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp b/llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp index 103c6bf5392..3cb0b6eb845 100644 --- a/llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp +++ b/llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp @@ -235,7 +235,7 @@ void CompleteBUDataStructures::processGraph(DSGraph &G) { // calls or for self recursion within an SCC. DSGraph &GI = getOrCreateGraph(*CalleeFunc); ++NumCBUInlines; - G.mergeInGraph(CS, *CalleeFunc, GI, DSGraph::KeepModRefBits | + G.mergeInGraph(CS, *CalleeFunc, GI, DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes | DSGraph::DontCloneAuxCallNodes); DEBUG(std::cerr << " Inlining graph [" << i << "/" diff --git a/llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp b/llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp index 7632200b83e..288f594926b 100644 --- a/llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp +++ b/llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp @@ -436,7 +436,7 @@ void EquivClassGraphs::processGraph(DSGraph &G) { if (CalleeGraph != &G) { ++NumFoldGraphInlines; G.mergeInGraph(CS, *CalleeFunc, *CalleeGraph, - DSGraph::KeepModRefBits | DSGraph::StripAllocaBit | + DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes | DSGraph::DontCloneAuxCallNodes); DEBUG(std::cerr << " Inlining graph [" << i << "/" |
