Home
last modified time | relevance | path

Searched refs:graph_t (Results 1 – 14 of 14) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dshortest-paths.h35 typedef typename GraphTraits::graph_t graph_t; typedef
40 shortest_paths (const graph_t &graph, const node_t *origin);
45 const graph_t &m_graph;
64 shortest_paths<GraphTraits, Path_t>::shortest_paths (const graph_t &graph, in shortest_paths()
H A Ddigraph.cc46 typedef test_graph graph_t; typedef
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dshortest-paths.h51 typedef typename GraphTraits::graph_t graph_t; typedef
56 shortest_paths (const graph_t &graph, const node_t *given_node,
63 const graph_t &m_graph;
90 shortest_paths (const graph_t &graph, in shortest_paths()
H A Ddigraph.cc46 typedef test_graph graph_t; typedef
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dreachability.h33 typedef typename GraphTraits::graph_t graph_t; typedef
37 reachability (const graph_t &graph, in reachability()
H A Dsupergraph.h67 typedef supergraph graph_t; typedef
H A Dexploded-graph.h144 typedef exploded_graph graph_t; typedef
H A Dengine.cc3500 typedef viz_callgraph graph_t; typedef
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dreachability.h33 typedef typename GraphTraits::graph_t graph_t; typedef
37 reachability (const graph_t &graph, in reachability()
H A Dtrimmed-graph.h39 typedef trimmed_graph graph_t; typedef
H A Dfeasible-graph.h43 typedef feasible_graph graph_t; typedef
H A Dsupergraph.h67 typedef supergraph graph_t; typedef
H A Dexploded-graph.h158 typedef exploded_graph graph_t; typedef
H A Dengine.cc5229 typedef viz_callgraph graph_t; typedef