Lines Matching defs:child
23 * a child node (both key and value). A value node may have a next value
83 * xbc_node_get_child() - Get the child XBC node
86 * Return the first child node of @node. If the node has no child, return
91 return node->child ? &xbc_nodes[node->child] : NULL;
100 * has no siblings. (You also has to check whether the parent's child node
145 * xbc_node_find_child() - Find a child node which matches given key
222 * This is expected to be used with xbc_find_node() to list up all (child)
285 if (node == root) /* @root was a leaf, no child node. */
326 if ((*leaf)->child)
342 node->child = 0;
381 if (!last_parent->child) {
382 last_parent->child = xbc_node_index(node);
548 struct xbc_node *node, *child;
559 child = xbc_node_get_child(last_parent);
560 if (child && xbc_node_is_value(child))
562 node = find_match_node(child, k);
596 struct xbc_node *child;
604 child = xbc_node_get_child(last_parent);
605 if (child) {
606 if (xbc_node_is_key(child))
616 if (op == ':' && child) {
617 xbc_init_node(child, v, XBC_VALUE);
875 pr_debug("[%d] %s (%s) .next=%d, .child=%d .parent=%d\n", i,
878 xbc_nodes[i].next, xbc_nodes[i].child,