59 dag_remove_edge(struct dag *dag, struct dag_edge *edge)  in dag_remove_edge()  argument
67       list_addtail(&child->link, &dag->heads);  in dag_remove_edge()
78 dag_prune_head(struct dag *dag, struct dag_node *node)  in dag_prune_head()  argument
85       dag_remove_edge(dag, edge);  in dag_prune_head()
94 dag_init_node(struct dag *dag, struct dag_node *node)  in dag_init_node()  argument
96    util_dynarray_init(&node->edges, dag);  in dag_init_node()
97    list_addtail(&node->link, &dag->heads);  in dag_init_node()
165 dag_traverse_bottom_up(struct dag *dag, void (*cb)(struct dag_node *node,  in dag_traverse_bottom_up()  argument
173    list_for_each_entry(struct dag_node, node, &dag->heads, link) {  in dag_traverse_bottom_up()
183 struct dag *
186    struct dag *dag = rzalloc(mem_ctx, struct dag);  in dag_create()  local
188    list_inithead(&dag->heads);  in dag_create()
190    return dag;  in dag_create()