Searched refs:gv_dependencies (Results 1 – 2 of 2) sorted by relevance
402 v->gv_dependencies = startd_list_create(graph_edge_pool, v, 0); in graph_add_vertex()423 assert(uu_list_numnodes(v->gv_dependencies) == 0); in graph_remove_vertex()428 uu_list_destroy(v->gv_dependencies); in graph_remove_vertex()453 r = uu_list_insert_before(fv->gv_dependencies, NULL, e); in graph_add_edge()466 for (e = uu_list_first(v->gv_dependencies); in graph_remove_edge()468 e = uu_list_next(v->gv_dependencies, e)) { in graph_remove_edge()470 uu_list_remove(v->gv_dependencies, e); in graph_remove_edge()496 assert(uu_list_numnodes(v->gv_dependencies) == 0); in remove_inst_vertex()514 if (uu_list_numnodes(sv->gv_dependencies) == 0 && in remove_inst_vertex()540 for (e = uu_list_first(v->gv_dependencies); in graph_walk_dependencies()[all …]
326 uu_list_t *gv_dependencies; member