The algorithm used here was ridiculously slow when a potential back-edge
pointed to a node that already had a lot of successors. The previous commit
makes this feature unnecessary anyway.
This reverts r177468 /
f4cf6b10f863b9bc716a09b2b2a8c497dcc6aa9b.
Conflicts:
lib/StaticAnalyzer/Core/BugReporter.cpp
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@177765
91177308-0d34-0410-b5e6-
96231b3b80d8
///
/// \param Nodes The nodes which must appear in the final graph. Presumably
/// these are end-of-path nodes (i.e. they have no successors).
- /// \param BreakCycles Whether or not the trimmed graph should make an effort
- /// to eliminate cycles. Note that this may result in some
- /// unnecessary nodes being included in the final graph
- /// (i.e. nodes that would have only appeared in a cycle).
/// \param[out] ForwardMap A optional map from nodes in this graph to nodes in
/// the returned graph.
/// \param[out] InverseMap An optional map from nodes in the returned graph to
/// nodes in this graph.
/// \returns The trimmed graph
- ExplodedGraph *trim(ArrayRef<const NodeTy *> Nodes, bool BreakCycles = false,
+ ExplodedGraph *trim(ArrayRef<const NodeTy *> Nodes,
InterExplodedGraphMap *ForwardMap = 0,
InterExplodedGraphMap *InverseMap = 0) const;
// The trimmed graph is created in the body of the constructor to ensure
// that the DenseMaps have been initialized already.
InterExplodedGraphMap ForwardMap;
- G.reset(OriginalGraph->trim(Nodes, /*BreakCycles=*/false,
- &ForwardMap, &InverseMap));
+ G.reset(OriginalGraph->trim(Nodes, &ForwardMap, &InverseMap));
// Find the (first) error node in the trimmed graph. We just need to consult
// the node map which maps from nodes in the original graph to nodes
return V;
}
-static bool isDescendent(const ExplodedNode *Parent, const ExplodedNode *Child){
- SmallVector<const ExplodedNode *, 16> WL;
- WL.push_back(Parent);
-
- while (!WL.empty()) {
- const ExplodedNode *N = WL.pop_back_val();
- if (N == Child)
- return true;
- WL.append(N->succ_begin(), N->succ_end());
- }
-
- return false;
-}
-
ExplodedGraph *
-ExplodedGraph::trim(ArrayRef<const NodeTy *> Sinks, bool BreakCycles,
+ExplodedGraph::trim(ArrayRef<const NodeTy *> Sinks,
InterExplodedGraphMap *ForwardMap,
InterExplodedGraphMap *InverseMap) const{
I != E; ++I) {
Pass2Ty::iterator PI = Pass2.find(*I);
if (PI != Pass2.end()) {
- if (!BreakCycles || !isDescendent(PI->second, NewN))
- const_cast<ExplodedNode *>(PI->second)->addPredecessor(NewN, *G);
+ const_cast<ExplodedNode *>(PI->second)->addPredecessor(NewN, *G);
continue;
}