diff options
author | Chris Lattner <sabre@nondot.org> | 2005-03-23 20:12:08 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2005-03-23 20:12:08 +0000 |
commit | 61130216ecc6cf9482c316162cc3450d7d23b0f6 (patch) | |
tree | 8529b980a427ce7ca81f2b0853de0d1b2a9f7c56 /llvm/lib/Analysis/DataStructure | |
parent | 01f0879c487a85459789ebb6488eca29fbdedb74 (diff) | |
download | bcm5719-llvm-61130216ecc6cf9482c316162cc3450d7d23b0f6.tar.gz bcm5719-llvm-61130216ecc6cf9482c316162cc3450d7d23b0f6.zip |
turn a dead conditional into an assert.
llvm-svn: 20787
Diffstat (limited to 'llvm/lib/Analysis/DataStructure')
-rw-r--r-- | llvm/lib/Analysis/DataStructure/DataStructure.cpp | 14 |
1 files changed, 5 insertions, 9 deletions
diff --git a/llvm/lib/Analysis/DataStructure/DataStructure.cpp b/llvm/lib/Analysis/DataStructure/DataStructure.cpp index a84c4fe0322..45b27733e2e 100644 --- a/llvm/lib/Analysis/DataStructure/DataStructure.cpp +++ b/llvm/lib/Analysis/DataStructure/DataStructure.cpp @@ -1347,6 +1347,9 @@ void DSGraph::mergeInGraph(const DSCallSite &CS, const DSGraph &Graph, unsigned CloneFlags) { TIME_REGION(X, "mergeInGraph"); + assert((CloneFlags & DontCloneCallNodes) && + "Doesn't support copying of call nodes!"); + // If this is not a recursive call, clone the graph into this graph... if (&Graph == this) { // Merge the return value with the return value of the context. @@ -1381,13 +1384,6 @@ void DSGraph::mergeInGraph(const DSCallSite &CS, RC.merge(CS.getPtrArg(i), Args[i+1]); } - // If requested, copy all of the calls. - if (!(CloneFlags & DontCloneCallNodes)) { - // Copy the function calls list. - for (fc_iterator I = Graph.fc_begin(), E = Graph.fc_end(); I != E; ++I) - FunctionCalls.push_back(DSCallSite(*I, RC)); - } - // If the user has us copying aux calls (the normal case), set up a data // structure to keep track of which ones we've copied over. std::set<const DSCallSite*> CopiedAuxCall; @@ -1405,10 +1401,10 @@ void DSGraph::mergeInGraph(const DSCallSite &CS, // If requested, copy any aux calls that can reach copied nodes. for (afc_iterator I = Graph.afc_begin(), E = Graph.afc_end(); I!=E; ++I) - if (CopiedAuxCall.insert(&*I).second && - PathExistsToClonedNode(*I, RC)) { + if (!CopiedAuxCall.count(&*I) && PathExistsToClonedNode(*I, RC)) { AuxFunctionCalls.push_back(DSCallSite(*I, RC)); MadeChange = true; + CopiedAuxCall.insert(&*I); } } } |