Lines Matching defs:child
28 * Adds a directed edge from the parent node to the child.
31 * list may contain multiple edges to the same child with different data.
34 dag_add_edge(struct dag_node *parent, struct dag_node *child, void *data)
37 if (edge->child == child && edge->data == data)
40 /* Remove the child as a DAG head. */
41 list_delinit(&child->link);
44 .child = child,
49 child->parent_count++;
52 /* Removes a single edge from the graph, promoting the child to a DAG head.
61 if (!edge->child)
64 struct dag_node *child = edge->child;
65 child->parent_count--;
66 if (child->parent_count == 0)
67 list_addtail(&child->link, &dag->heads);
69 edge->child = NULL;
115 dag_traverse_bottom_up_node(edge->child, cb, state);