Lines Matching defs:child
44 * a child node (both key and value). A value node may have a next value
148 * xbc_node_get_child() - Get the child XBC node
151 * Return the first child node of @node. If the node has no child, return
156 return node->child ? &xbc_nodes[node->child] : NULL;
165 * has no siblings. (You also has to check whether the parent's child node
287 * This is expected to be used with xbc_find_node() to list up all (child)
359 if (node == root) /* @root was a leaf, no child node. */
401 if ((*leaf)->child)
417 node->child = 0;
447 while (node->child)
465 if (!last_parent->child || head) {
466 node->next = last_parent->child;
467 last_parent->child = xbc_node_index(node);
615 if (last_parent->child)
628 node->child = 0;
646 struct xbc_node *node, *child;
657 child = xbc_node_get_child(last_parent);
658 /* Since the value node is the first child, skip it. */
659 if (child && xbc_node_is_value(child))
660 child = xbc_node_get_next(child);
661 node = find_match_node(child, k);
695 struct xbc_node *child;
707 child = xbc_node_get_child(last_parent);
708 if (child && xbc_node_is_value(child)) {
712 unsigned short nidx = child->next;
714 xbc_init_node(child, v, XBC_VALUE);
715 child->next = nidx; /* keep subkeys */
719 last_parent = xbc_last_child(child);
721 /* The value node should always be the first child */