Home
last modified time | relevance | path

Searched refs:ExplodedGraph (Results 1 – 22 of 22) sorted by relevance

/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp52 ExplodedGraph::ExplodedGraph() in ExplodedGraph() function in ExplodedGraph
55 ExplodedGraph::~ExplodedGraph() {} in ~ExplodedGraph()
61 bool ExplodedGraph::shouldCollect(const ExplodedNode *node) { in shouldCollect()
127 void ExplodedGraph::collectNode(ExplodedNode *node) { in collectNode()
143 void ExplodedGraph::reclaimRecentlyAllocatedNodes() { in reclaimRecentlyAllocatedNodes()
181 void ExplodedNode::addPredecessor(ExplodedNode *V, ExplodedGraph &G) { in addPredecessor()
199 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { in addNode()
264 ExplodedNode *ExplodedGraph::getNode(const ProgramPoint &L, in getNode()
302 std::pair<ExplodedGraph*, InterExplodedGraphMap*>
303 ExplodedGraph::Trim(const NodeTy* const* NBeg, const NodeTy* const* NEnd, in Trim()
[all …]
DCMakeLists.txt20 ExplodedGraph.cpp
DAndroid.mk28 ExplodedGraph.cpp \
DBugReporter.cpp1565 ExplodedGraph &GRBugReporter::getGraph() { return Eng.getGraph(); } in getGraph()
1621 static std::pair<std::pair<ExplodedGraph*, NodeBackMap*>,
1623 MakeReportGraph(const ExplodedGraph* G, in MakeReportGraph()
1630 ExplodedGraph* GTrim; in MakeReportGraph()
1639 OwningPtr<ExplodedGraph> AutoReleaseGTrim(GTrim); in MakeReportGraph()
1662 ExplodedGraph *GNew = new ExplodedGraph(); in MakeReportGraph()
1865 const std::pair<std::pair<ExplodedGraph*, NodeBackMap*>, in GeneratePathDiagnostic()
1874 OwningPtr<ExplodedGraph> ReportGraph(GPair.first.first); in GeneratePathDiagnostic()
DCoreEngine.cpp276 for (ExplodedGraph::eop_iterator I = G->eop_begin(), in ExecuteWorkListWithInitialState()
DCheckerManager.cpp347 void CheckerManager::runCheckersForEndAnalysis(ExplodedGraph &G, in runCheckersForEndAnalysis()
DExprEngine.cpp2107 std::auto_ptr<ExplodedGraph> TrimmedG(G.Trim(Beg, End).first); in ViewGraph()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h43 class ExplodedGraph; variable
55 friend class ExplodedGraph; variable
95 void addNode(ExplodedNode *N, ExplodedGraph &G);
175 void addPredecessor(ExplodedNode *V, ExplodedGraph &G);
243 friend class ExplodedGraph; variable
252 class ExplodedGraph {
301 ExplodedGraph* MakeEmptyGraph() const { in MakeEmptyGraph()
302 return new ExplodedGraph(); in MakeEmptyGraph()
317 ExplodedGraph();
319 ~ExplodedGraph();
[all …]
DCoreEngine.h63 OwningPtr<ExplodedGraph> G;
109 : SubEng(subengine), G(new ExplodedGraph()), in CoreEngine()
115 ExplodedGraph& getGraph() { return *G.get(); } in getGraph()
119 ExplodedGraph* takeGraph() { return G.take(); } in takeGraph()
DExprEngine.h55 ExplodedGraph& G;
155 ExplodedGraph& getGraph() { return G; } in getGraph()
156 const ExplodedGraph& getGraph() const { return G; } in getGraph()
DProgramState.h81 friend class ExplodedGraph; variable
/external/clang/lib/StaticAnalyzer/Checkers/
DAnalyzerStatsChecker.cpp37 void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,ExprEngine &Eng) const;
41 void AnalyzerStatsChecker::checkEndAnalysis(ExplodedGraph &G, in checkEndAnalysis()
55 for (ExplodedGraph::node_iterator I = G.nodes_begin(); in checkEndAnalysis()
DUnreachableCodeChecker.cpp39 void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,
53 void UnreachableCodeChecker::checkEndAnalysis(ExplodedGraph &G, in checkEndAnalysis()
66 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end(); in checkEndAnalysis()
DCheckerDocumentation.cpp170 void checkEndAnalysis(ExplodedGraph &G, in checkEndAnalysis()
DIdempotentOperationChecker.cpp75 void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,ExprEngine &Eng) const;
344 void IdempotentOperationChecker::checkEndAnalysis(ExplodedGraph &G, in checkEndAnalysis()
DRetainCountChecker.cpp2397 void checkEndAnalysis(ExplodedGraph &G, BugReporter &BR, in checkEndAnalysis()
/external/clang/lib/StaticAnalyzer/
DREADME.txt25 node in an exploded graph (ExplodedGraph). The term "exploded" comes
29 ExplodedGraph. We start at a root node, which has the entry program
32 state to change, resulting in a new node in the ExplodedGraph with an
49 existing node. Thus the ExplodedGraph is not a DAG; it can contain
54 ProgramState. This immutability is key since the ExplodedGraph represents
116 third generates a graphviz dot file of the ExplodedGraph. This is
/external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
DBugReporter.h40 class ExplodedGraph; variable
457 ExplodedGraph &getGraph();
483 ExplodedGraph &getGraph() { return BR.getGraph(); }
/external/clang/include/clang/StaticAnalyzer/Core/
DCheckerManager.h41 class ExplodedGraph; variable
264 void runCheckersForEndAnalysis(ExplodedGraph &G, BugReporter &BR,
380 typedef CheckerFn<void (ExplodedGraph &, BugReporter &, ExprEngine &)>
DChecker.h217 static void _checkEndAnalysis(void *checker, ExplodedGraph &G, in _checkEndAnalysis()
/external/clang/include/clang/Driver/
DCC1Options.td71 HelpText<"Don't eagerly remove uninteresting ExplodedNodes from the ExplodedGraph">;
/external/clang/test/Analysis/
Dmisc-ps.m863 // the ExplodedGraph (causing a false positive)