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

  /src/external/gpl3/gcc/dist/gcc/
shortest-paths.h 76 auto_vec<const edge_t *> m_best_edge; member in class:shortest_paths
82 m_best_edge with enough information to be able to generate Path_t instances
96 m_best_edge (graph.m_nodes.length ())
105 m_best_edge.quick_push (NULL);
150 m_best_edge[dest->m_index] = succ;
166 m_best_edge[src->m_index] = pred;
188 while (m_best_edge[other_node->m_index])
190 result.m_edges.safe_push (m_best_edge[other_node->m_index]);
192 other_node = m_best_edge[other_node->m_index]->m_src;
194 other_node = m_best_edge[other_node->m_index]->m_dest
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
shortest-paths.h 76 auto_vec<const edge_t *> m_best_edge; member in class:shortest_paths
82 m_best_edge with enough information to be able to generate Path_t instances
96 m_best_edge (graph.m_nodes.length ())
105 m_best_edge.quick_push (NULL);
150 m_best_edge[dest->m_index] = succ;
166 m_best_edge[src->m_index] = pred;
188 while (m_best_edge[other_node->m_index])
190 result.m_edges.safe_push (m_best_edge[other_node->m_index]);
192 other_node = m_best_edge[other_node->m_index]->m_src;
194 other_node = m_best_edge[other_node->m_index]->m_dest
    [all...]

Completed in 26 milliseconds