52 	uint16_t child;  member
104 	return xbc_node_is_value(node) && node->child != 0;  in xbc_node_is_array()
112  * or no child. Returns true if it is a leaf node, or false if not.
119 		(!node->child || xbc_node_is_value(xbc_node_get_child(node)));  in xbc_node_is_leaf()
168  * Return the first subkey node of the @node. If the @node has no child
173 	struct xbc_node *child = xbc_node_get_child(node);  in xbc_node_get_subkey()  local
175 	if (child && xbc_node_is_value(child))  in xbc_node_get_subkey()
176 		return xbc_node_get_next(child);  in xbc_node_get_subkey()
178 		return child;  in xbc_node_get_subkey()
196  * xbc_node_for_each_child() - Iterate child nodes
198  * @child: Iterated XBC node.
200  * Iterate child nodes of @parent. Each child nodes are stored to @child.
201  * The @child can be mixture of a value node and subkey nodes.
203 #define xbc_node_for_each_child(parent, child)				\  argument
204 	for (child = xbc_node_get_child(parent); child != NULL ;	\
205 	     child = xbc_node_get_next(child))
208  * xbc_node_for_each_subkey() - Iterate child subkey nodes
210  * @child: Iterated XBC node.
212  * Iterate subkey nodes of @parent. Each child nodes are stored to @child.
213  * The @child is only the subkey node.
215 #define xbc_node_for_each_subkey(parent, child)				\  argument
216 	for (child = xbc_node_get_subkey(parent); child != NULL ;	\
217 	     child = xbc_node_get_next(child))