Lines Matching defs:child
384 DPRINTF((DI_TRACE, "Get child of node %s\n", di_node_name(node)));
393 if (DI_NODE(node)->child) {
394 return (DI_NODE(pa + DI_NODE(node)->child));
602 di_node_t child;
607 if ((child = di_child_node(node)) == DI_NODE_NIL) {
616 result->node = child;
619 while ((child = di_sibling_node(tmp->node)) != DI_NODE_NIL) {
626 tmp->node = child;
814 * This is similar to walk_one_node, except we only walk in child
3575 * This is similar to walk_one_node, except we only walk in child
3640 * This is similar to walk_one_node, except we only walk in child