Searched refs:sorted_graph (Results 1 – 3 of 3) sorted by relevance
183 graph_t& sorted_graph) in _try_isolating_subgraphs() argument193 unsigned overflow_space = sorted_graph.space_for (r.parent, &root); in _try_isolating_subgraphs()195 if (sorted_graph.num_roots_for_space (overflow_space) <= 1) continue; in _try_isolating_subgraphs()207 unsigned maximum_to_move = hb_max ((sorted_graph.num_roots_for_space (space) / 2u), 1u); in _try_isolating_subgraphs()221 sorted_graph.num_roots_for_space (space), in _try_isolating_subgraphs()223 sorted_graph.next_space ()); in _try_isolating_subgraphs()225 sorted_graph.isolate_subgraph (roots_to_isolate); in _try_isolating_subgraphs()226 sorted_graph.move_to_new_space (roots_to_isolate); in _try_isolating_subgraphs()234 graph_t& sorted_graph) in _process_overflows() argument242 const auto& child = sorted_graph.vertices_[r.child]; in _process_overflows()[all …]
447 hb_vector_t<vertex_t> &sorted_graph = vertices_scratch_; in sort_shortest_distance() local448 if (unlikely (!check_success (sorted_graph.resize (vertices_.length)))) return; in sort_shortest_distance()463 hb_swap (sorted_graph[new_id], vertices_[next_id]); in sort_shortest_distance()464 const vertex_t& next = sorted_graph[new_id]; in sort_shortest_distance()489 check_success (!sorted_graph.in_error ()); in sort_shortest_distance()491 remap_all_obj_indices (id_map, &sorted_graph); in sort_shortest_distance()492 hb_swap (vertices_, sorted_graph); in sort_shortest_distance()1326 hb_vector_t<vertex_t>* sorted_graph) const in remap_all_obj_indices()1328 for (unsigned i = 0; i < sorted_graph->length; i++) in remap_all_obj_indices()1330 (*sorted_graph)[i].remap_parents (id_map); in remap_all_obj_indices()[all …]
125 GraphDef sorted_graph; in PrintStructure() local126 TF_RETURN_IF_ERROR(SortByExecutionOrder(graph, &sorted_graph)); in PrintStructure()127 for (const NodeDef& node : sorted_graph.node()) { in PrintStructure()