owner_vertex
static int graph_reaches(struct owner_vertex *x, struct owner_vertex *y,
struct owner_vertex *x, struct owner_vertex *y,
struct owner_vertex *x, struct owner_vertex *y,
struct owner_vertex *x, struct owner_vertex *y);
struct owner_vertex *x, struct owner_vertex *y);
static struct owner_vertex *graph_alloc_vertex(struct owner_graph *g,
struct owner_vertex *v);
struct owner_vertex *lo_vertex; /* (g) entry in deadlock graph */
graph_reaches(struct owner_vertex *x, struct owner_vertex *y,
struct owner_vertex *v;
graph_delta_forward(struct owner_graph *g, struct owner_vertex *x,
struct owner_vertex *y, struct owner_vertex_list *delta)
struct owner_vertex *v;
graph_delta_backward(struct owner_graph *g, struct owner_vertex *x,
struct owner_vertex *y, struct owner_vertex_list *delta)
struct owner_vertex *v;
struct owner_vertex *v;
struct owner_vertex *v, *vlowest;
graph_add_edge(struct owner_graph *g, struct owner_vertex *x,
struct owner_vertex *y)
graph_remove_edge(struct owner_graph *g, struct owner_vertex *x,
struct owner_vertex *y)
static struct owner_vertex *
struct owner_vertex *v;
v = malloc(sizeof(struct owner_vertex), M_LOCKF, M_WAITOK);
2 * g->g_space * sizeof(struct owner_vertex *),
struct owner_vertex;
graph_free_vertex(struct owner_graph *g, struct owner_vertex *v)
struct owner_vertex *w;
g->g_vertices = malloc(10 * sizeof(struct owner_vertex *),
struct owner_vertex *e_from; /* (c) out-going from here */
struct owner_vertex *e_to; /* (c) in-coming to here */
TAILQ_ENTRY(owner_vertex) v_link; /* (g) workspace for edge insertion */
TAILQ_HEAD(owner_vertex_list, owner_vertex);
struct owner_vertex** g_vertices; /* (g) pointers to vertices */
struct owner_vertex;