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()
542 	    e = uu_list_next(v->gv_dependencies, e)) {  in graph_walk_dependencies()
619 			list = v->gv_dependencies;  in graph_walk_recurse()
953 	    uu_list_numnodes(v->gv_dependencies) == 0) {  in free_if_unrefed()
959 	    uu_list_numnodes(v->gv_dependencies) == 0) {  in free_if_unrefed()
977 	while ((e = uu_list_first(v->gv_dependencies)) != NULL) {  in delete_depgroup()
989 			assert(uu_list_numnodes(dv->gv_dependencies) == 0);  in delete_depgroup()
1060 	r = uu_list_walk(v->gv_dependencies,  in delete_instance_dependencies()
1239 	if (uu_list_numnodes(groupv->gv_dependencies) == 0)  in require_all_satisfied()
1244 	for (edge = uu_list_first(groupv->gv_dependencies);  in require_all_satisfied()
1246 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in require_all_satisfied()
1278 	if (uu_list_numnodes(groupv->gv_dependencies) == 0)  in require_any_satisfied()
1283 	for (edge = uu_list_first(groupv->gv_dependencies);  in require_any_satisfied()
1285 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in require_any_satisfied()
1324 	for (edge = uu_list_first(groupv->gv_dependencies);  in optional_all_satisfied()
1326 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in optional_all_satisfied()
1380 			for (e2 = uu_list_first(v->gv_dependencies);  in optional_all_satisfied()
1382 			    e2 = uu_list_next(v->gv_dependencies, e2)) {  in optional_all_satisfied()
1482 	for (edge = uu_list_first(groupv->gv_dependencies);  in exclude_all_satisfied()
1484 	    edge = uu_list_next(groupv->gv_dependencies, edge)) {  in exclude_all_satisfied()
1535 		if (uu_list_numnodes(v->gv_dependencies) == 0)  in exclude_all_satisfied()
1538 		for (e2 = uu_list_first(v->gv_dependencies);  in exclude_all_satisfied()
1540 		    e2 = uu_list_next(v->gv_dependencies, e2)) {  in exclude_all_satisfied()
1645 		if (uu_list_numnodes(v->gv_dependencies) == 0)  in dependency_satisfied()
2808 		r = uu_list_walk(v->gv_dependencies,  in append_svcs_or_insts()
2993 	for (e = uu_list_first(v->gv_dependencies);  in eval_subgraph()
2995 	    e = uu_list_next(v->gv_dependencies, e)) {  in eval_subgraph()
3038 		err = uu_list_walk(v->gv_dependencies,  in refresh_vertex()
3105 		for (e = uu_list_first(v->gv_dependencies);  in refresh_vertex()
3107 		    e = uu_list_next(v->gv_dependencies, e)) {  in refresh_vertex()
5019 		err = uu_list_walk(v->gv_dependencies,  in dgraph_remove_instance()
5511 	r = uu_list_walk(v->gv_dependencies, (uu_walk_fn_t *)mark_subgraph,  in mark_subgraph()
5648 		r = uu_list_walk(milestone->gv_dependencies,  in dgraph_set_milestone()