graph_edge_t
delete_instance_deps_cb(graph_edge_t *e, void **ptrs)
graph_edge_t *edge;
graph_edge_t *edge;
graph_edge_t *edge;
graph_edge_t *edge, *e2;
append_svcs_or_insts(graph_edge_t *e, uu_list_t *list)
graph_edge_t *new;
graph_edge_t *e;
graph_edge_t *ee;
graph_edge_t *e;
graph_edge_t *e;
static int mark_subtree(graph_edge_t *, void *);
sizeof (graph_edge_t), offsetof(graph_edge_t, ge_link), NULL,
graph_edge_t *e;
graph_edge_t *e;
graph_edge_t *e, *re;
e = startd_alloc(sizeof (graph_edge_t));
re = startd_alloc(sizeof (graph_edge_t));
graph_edge_t *e;
startd_free(e, sizeof (graph_edge_t));
startd_free(e, sizeof (graph_edge_t));
graph_edge_t *e;
graph_edge_t *e;
graph_edge_t *e;
mark_subtree(graph_edge_t *e, void *arg)
graph_edge_t *e;
mark_subgraph(graph_edge_t *e, void *arg)
graph_walk_recurse(graph_edge_t *e, graph_walk_info_t *gip)
graph_edge_t fake;
graph_edge_t *e;