Lines Matching defs:exploded_graph
32 impl_region_model_context (exploded_graph &eg,
96 exploded_graph *m_eg;
158 typedef exploded_graph graph_t;
161 dump_args_t (const exploded_graph &eg) : m_eg (eg) {}
168 const exploded_graph &m_eg;
174 exploded_graph.
181 /* Has this enode had exploded_graph::process_node called on it?
190 /* Node has had exploded_graph::process_node called on it. */
194 exploded_graph::process_node called on it. */
241 on_stmt_flags on_stmt (exploded_graph &eg,
247 void on_stmt_pre (exploded_graph &eg,
258 bool on_edge (exploded_graph &eg,
263 void on_longjmp (exploded_graph &eg,
268 void detect_leaks (exploded_graph &eg);
453 /* Statistics about aspects of an exploded_graph. */
470 an exploded_graph. */
524 /* Per-program_point data for an exploded_graph. */
540 an exploded_graph. */
594 /* Data about a particular call_string within an exploded_graph. */
607 an exploded_graph. */
661 /* Data about a particular function within an exploded_graph. */
714 an exploded_graph, but that haven't yet been processed to find
726 worklist (const exploded_graph &eg, const analysis_plan &plan);
787 /* An exploded_graph is a directed graph of unique <point, state> pairs.
791 class exploded_graph : public digraph<eg_traits>
797 exploded_graph (const supergraph &sg, logger *logger,
802 ~exploded_graph ();
888 DISABLE_COPY_AND_ASSIGN (exploded_graph);
937 /* A path within an exploded_graph: a sequence of edges. */
960 engine *eng, const exploded_graph *eg) const;
988 through the exploded_graph for feasibility. */
1011 /* Finding the shortest exploded_path within an exploded_graph. */
Indexes created Mon Mar 02 05:31:46 UTC 2026