403 	v->gv_dependents = startd_list_create(graph_edge_pool, v, 0);  in graph_add_vertex()
424 	assert(uu_list_numnodes(v->gv_dependents) == 0);  in graph_remove_vertex()
429 	uu_list_destroy(v->gv_dependents);  in graph_remove_vertex()
457 	r = uu_list_insert_before(tv->gv_dependents, NULL, re);  in graph_add_edge()
476 	for (e = uu_list_first(dv->gv_dependents);  in graph_remove_edge()
478 	    e = uu_list_next(dv->gv_dependents, e)) {  in graph_remove_edge()
480 			uu_list_remove(dv->gv_dependents, e);  in graph_remove_edge()
495 	assert(uu_list_numnodes(v->gv_dependents) == 1);  in remove_inst_vertex()
500 	e = uu_list_first(v->gv_dependents);  in remove_inst_vertex()
515 	    uu_list_numnodes(sv->gv_dependents) == 0 &&  in remove_inst_vertex()
526 	for (e = uu_list_first(v->gv_dependents);  in graph_walk_dependents()
528 	    e = uu_list_next(v->gv_dependents, e))  in graph_walk_dependents()
617 			list = v->gv_dependents;  in graph_walk_recurse()
952 	    uu_list_numnodes(v->gv_dependents) == 0 &&  in free_if_unrefed()
958 	    uu_list_numnodes(v->gv_dependents) == 1 &&  in free_if_unrefed()
975 	assert(uu_list_numnodes(v->gv_dependents) == 0);  in delete_depgroup()
990 			if (uu_list_numnodes(dv->gv_dependents) == 0)  in delete_depgroup()
1824 		assert(uu_list_numnodes(v->gv_dependents) == 1);  in propagate_stop()
1825 		e = uu_list_first(v->gv_dependents);  in propagate_stop()
1999 	r = uu_list_walk(vertex->gv_dependents, (uu_walk_fn_t *)mark_subtree,  in graph_enable_by_vertex()
2853 	for (e = uu_list_first(v->gv_dependents);  in should_be_in_subgraph()
2855 	    e = uu_list_next(v->gv_dependents, e)) {  in should_be_in_subgraph()
2869 			for (ee = uu_list_first(dv->gv_dependents);  in should_be_in_subgraph()
2871 			    ee = uu_list_next(dv->gv_dependents, ee)) {  in should_be_in_subgraph()
4386 	for (e = uu_list_first(v->gv_dependents); e != NULL;  in insubtree_dependents_down()
4387 	    e = uu_list_next(v->gv_dependents, e)) {  in insubtree_dependents_down()
4432 	for (e = uu_list_first(v->gv_dependents);  in is_nonsubgraph_leaf()
4434 	    e = uu_list_next(v->gv_dependents, e)) {  in is_nonsubgraph_leaf()
5047 	    uu_list_numnodes(v->gv_dependents) == 1)  in dgraph_remove_instance()
5472 	r = uu_list_walk(v->gv_dependents, (uu_walk_fn_t *)mark_subtree, arg,  in mark_subtree()