HomeSort by: relevance | last modified time | path
    Searched defs:graphds_dfs (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
graphds.cc 118 /* Helper function for graphds_dfs. Returns the source vertex of E, in the
127 /* Helper function for graphds_dfs. Returns the destination vertex of E, in
136 /* Helper function for graphds_dfs. Returns the first edge after E (including
167 /* Helper function for graphds_dfs. Select the first edge from V in G, in the
182 /* Helper function for graphds_dfs. Returns the next edge after E, in the
204 graphds_dfs (struct graph *g, int *qs, int nq, vec<int> *qt, function
322 graphds_dfs (g, queue, nq, &postorder, false, subgraph, skip_edge_p);
327 comp = graphds_dfs (g, queue, nq, scc_grouping, true, subgraph, skip_edge_p);
445 graphds_dfs (g, &entry, 1, &postorder, true, NULL);
  /src/external/gpl3/gcc.old/dist/gcc/
graphds.cc 118 /* Helper function for graphds_dfs. Returns the source vertex of E, in the
127 /* Helper function for graphds_dfs. Returns the destination vertex of E, in
136 /* Helper function for graphds_dfs. Returns the first edge after E (including
167 /* Helper function for graphds_dfs. Select the first edge from V in G, in the
182 /* Helper function for graphds_dfs. Returns the next edge after E, in the
204 graphds_dfs (struct graph *g, int *qs, int nq, vec<int> *qt, function
315 graphds_dfs (g, queue, nq, &postorder, false, subgraph, skip_edge_p);
320 comp = graphds_dfs (g, queue, nq, NULL, true, subgraph, skip_edge_p);
438 graphds_dfs (g, &entry, 1, &postorder, true, NULL);

Completed in 44 milliseconds