Lines Matching defs:dag
25 #include "util/dag.h"
59 dag_remove_edge(struct dag *dag, struct dag_edge *edge)
67 list_addtail(&child->link, &dag->heads);
74 * Removes a DAG head from the graph, and moves any new dag heads into the
78 dag_prune_head(struct dag *dag, struct dag_node *node)
85 dag_remove_edge(dag, edge);
94 dag_init_node(struct dag *dag, struct dag_node *node)
96 util_dynarray_init(&node->edges, dag);
97 list_addtail(&node->link, &dag->heads);
165 dag_traverse_bottom_up(struct dag *dag, void (*cb)(struct dag_node *node,
173 list_for_each_entry(struct dag_node, node, &dag->heads, link) {
183 struct dag *
186 struct dag *dag = rzalloc(mem_ctx, struct dag);
188 list_inithead(&dag->heads);
190 return dag;