228     hb_vector_t<vertex_t> sorted_graph;  in sort_kahn()  local
245       sorted_graph.push (next);  in sort_kahn()
256     check_success (!sorted_graph.in_error ());  in sort_kahn()
260     remap_obj_indices (id_map, &sorted_graph);  in sort_kahn()
262     sorted_graph.as_array ().reverse ();  in sort_kahn()
265     vertices_ = sorted_graph;  in sort_kahn()
266     sorted_graph.fini_deep ();  in sort_kahn()
285     hb_vector_t<vertex_t> sorted_graph;  in sort_shortest_distance()  local
301       sorted_graph.push (next);  in sort_shortest_distance()
318     check_success (!sorted_graph.in_error ());  in sort_shortest_distance()
322     remap_obj_indices (id_map, &sorted_graph);  in sort_shortest_distance()
324     sorted_graph.as_array ().reverse ();  in sort_shortest_distance()
327     vertices_ = sorted_graph;  in sort_shortest_distance()
328     sorted_graph.fini_deep ();  in sort_shortest_distance()
599                           hb_vector_t<vertex_t>* sorted_graph) const  in remap_obj_indices()
601     for (unsigned i = 0; i < sorted_graph->length; i++)  in remap_obj_indices()
603       for (unsigned j = 0; j < (*sorted_graph)[i].obj.links.length; j++)  in remap_obj_indices()
605         auto& link = (*sorted_graph)[i].obj.links[j];  in remap_obj_indices()
675   graph_t sorted_graph (packed);  in hb_resolve_overflows()  local
676   sorted_graph.sort_kahn ();  in hb_resolve_overflows()
677   if (!sorted_graph.will_overflow ())  in hb_resolve_overflows()
679     sorted_graph.serialize (c);  in hb_resolve_overflows()
683   sorted_graph.sort_shortest_distance ();  in hb_resolve_overflows()
688   while (!sorted_graph.in_error ()  in hb_resolve_overflows()
689          && sorted_graph.will_overflow (&overflows)  in hb_resolve_overflows()
692     sorted_graph.print_overflows (overflows);  in hb_resolve_overflows()
700       const auto& child = sorted_graph.vertices_[r.link->objidx];  in hb_resolve_overflows()
705         sorted_graph.duplicate (r.parent, r.link->objidx);  in hb_resolve_overflows()
727         sorted_graph.raise_childrens_priority (r.parent);  in hb_resolve_overflows()
740       sorted_graph.sort_shortest_distance ();  in hb_resolve_overflows()
749   if (sorted_graph.in_error ())  in hb_resolve_overflows()
754   sorted_graph.serialize (c);  in hb_resolve_overflows()