263     hb_vector_t<vertex_t> sorted_graph;  in sort_kahn()  local
264     if (unlikely (!check_success (sorted_graph.resize (vertices_.length)))) return;  in sort_kahn()
281       sorted_graph[new_id] = next;  in sort_kahn()
292     check_success (!sorted_graph.in_error ());  in sort_kahn()
296     remap_all_obj_indices (id_map, &sorted_graph);  in sort_kahn()
298     hb_swap (vertices_, sorted_graph);  in sort_kahn()
299     sorted_graph.fini ();  in sort_kahn()
318     hb_vector_t<vertex_t> sorted_graph;  in sort_shortest_distance()  local
319     if (unlikely (!check_success (sorted_graph.resize (vertices_.length)))) return;  in sort_shortest_distance()
335       sorted_graph[new_id] = next;  in sort_shortest_distance()
352     check_success (!sorted_graph.in_error ());  in sort_shortest_distance()
356     remap_all_obj_indices (id_map, &sorted_graph);  in sort_shortest_distance()
358     hb_swap (vertices_, sorted_graph);  in sort_shortest_distance()
359     sorted_graph.fini ();  in sort_shortest_distance()
997                               hb_vector_t<vertex_t>* sorted_graph) const  in remap_all_obj_indices()
999     for (unsigned i = 0; i < sorted_graph->length; i++)  in remap_all_obj_indices()
1001       (*sorted_graph)[i].remap_parents (id_map);  in remap_all_obj_indices()
1002       for (auto& link : (*sorted_graph)[i].obj.all_links_writer ())  in remap_all_obj_indices()
1102                                       graph_t& sorted_graph)  in _try_isolating_subgraphs()  argument
1112     unsigned overflow_space = sorted_graph.space_for (r.parent, &root);  in _try_isolating_subgraphs()
1114     if (sorted_graph.num_roots_for_space (overflow_space) <= 1) continue;  in _try_isolating_subgraphs()
1126   unsigned maximum_to_move = hb_max ((sorted_graph.num_roots_for_space (space) / 2u), 1u);  in _try_isolating_subgraphs()
1140              sorted_graph.num_roots_for_space (space),  in _try_isolating_subgraphs()
1142              sorted_graph.next_space ());  in _try_isolating_subgraphs()
1144   sorted_graph.isolate_subgraph (roots_to_isolate);  in _try_isolating_subgraphs()
1145   sorted_graph.move_to_new_space (roots_to_isolate);  in _try_isolating_subgraphs()
1152                                 graph_t& sorted_graph)  in _process_overflows()  argument
1160     const auto& child = sorted_graph.vertices_[r.child];  in _process_overflows()
1165       if (!sorted_graph.duplicate (r.parent, r.child)) continue;  in _process_overflows()
1182       if (sorted_graph.raise_childrens_priority (r.parent)) {  in _process_overflows()
1216   graph_t sorted_graph (packed);  in hb_resolve_overflows()  local
1217   sorted_graph.sort_kahn ();  in hb_resolve_overflows()
1218   if (!sorted_graph.will_overflow ())  in hb_resolve_overflows()
1220     return sorted_graph.serialize ();  in hb_resolve_overflows()
1223   sorted_graph.sort_shortest_distance ();  in hb_resolve_overflows()
1227       && sorted_graph.will_overflow ())  in hb_resolve_overflows()
1230     if (sorted_graph.assign_32bit_spaces ())  in hb_resolve_overflows()
1231       sorted_graph.sort_shortest_distance ();  in hb_resolve_overflows()
1237   while (!sorted_graph.in_error ()  in hb_resolve_overflows()
1238          && sorted_graph.will_overflow (&overflows)  in hb_resolve_overflows()
1241     sorted_graph.print_overflows (overflows);  in hb_resolve_overflows()
1245     if (!_try_isolating_subgraphs (overflows, sorted_graph))  in hb_resolve_overflows()
1247       if (!_process_overflows (overflows, priority_bumped_parents, sorted_graph))  in hb_resolve_overflows()
1254     sorted_graph.sort_shortest_distance ();  in hb_resolve_overflows()
1257   if (sorted_graph.in_error ())  in hb_resolve_overflows()
1263   if (sorted_graph.will_overflow ())  in hb_resolve_overflows()
1269   return sorted_graph.serialize ();  in hb_resolve_overflows()