| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| trimmed-graph.h | 30 class trimmed_graph;
39 typedef trimmed_graph graph_t;
54 /* A node within the trimmed_graph, corresponding to an "inner node"
70 /* An edge within the trimmed_graph, corresponding to an "inner edge"
90 class trimmed_graph : public digraph <tg_traits> class in namespace:ana
93 trimmed_graph (const exploded_graph &inner_graph,
|
| trimmed-graph.cc | 83 /* class trimmed_graph : public digraph <tg_traits>. */
85 /* Ctor for trimmed_graph: construct a graph equivalent to trimming
88 trimmed_graph::trimmed_graph (const exploded_graph &inner_graph, function in class:ana::trimmed_graph
152 trimmed_graph::log_stats (logger *logger) const
|
| diagnostic-manager.cc | 108 const trimmed_graph &tg,
117 const trimmed_graph &tg,
357 - Construct a trimmed_graph: the subset of nodes/edges that
375 This is something of a brute-force approach, but the trimmed_graph
407 /* Construct a trimmed_graph: the subset of nodes/edges that
411 trimmed_graph tg (m_eg, target_enode);
478 const trimmed_graph &tg,
617 const trimmed_graph &tg,
622 trimmed_graph::dump_args_t args (inner_args);
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| trimmed-graph.h | 30 class trimmed_graph;
39 typedef trimmed_graph graph_t;
54 /* A node within the trimmed_graph, corresponding to an "inner node"
70 /* An edge within the trimmed_graph, corresponding to an "inner edge"
90 class trimmed_graph : public digraph <tg_traits> class in namespace:ana
93 trimmed_graph (const exploded_graph &inner_graph,
|
| trimmed-graph.cc | 95 /* class trimmed_graph : public digraph <tg_traits>. */
97 /* Ctor for trimmed_graph: construct a graph equivalent to trimming
100 trimmed_graph::trimmed_graph (const exploded_graph &inner_graph, function in class:ana::trimmed_graph
164 trimmed_graph::log_stats (logger *logger) const
|
| diagnostic-manager.cc | 103 const trimmed_graph &tg,
110 const trimmed_graph &tg,
341 - Construct a trimmed_graph: the subset of nodes/edges that
359 This is something of a brute-force approach, but the trimmed_graph
389 /* Construct a trimmed_graph: the subset of nodes/edges that
393 trimmed_graph tg (m_eg, target_enode);
456 const trimmed_graph &tg,
586 const trimmed_graph &tg,
591 trimmed_graph::dump_args_t args (inner_args);
|
