42 	u16 child;  member
94 	return xbc_node_is_value(node) && node->child != 0;  in xbc_node_is_array()
102  * or no child. Returns true if it is a leaf node, or false if not.
109 		(!node->child || xbc_node_is_value(xbc_node_get_child(node)));  in xbc_node_is_leaf()
158  * Return the first subkey node of the @node. If the @node has no child
163 	struct xbc_node *child = xbc_node_get_child(node);  in xbc_node_get_subkey()  local
165 	if (child && xbc_node_is_value(child))  in xbc_node_get_subkey()
166 		return xbc_node_get_next(child);  in xbc_node_get_subkey()
168 		return child;  in xbc_node_get_subkey()
186  * xbc_node_for_each_child() - Iterate child nodes
188  * @child: Iterated XBC node.
190  * Iterate child nodes of @parent. Each child nodes are stored to @child.
191  * The @child can be mixture of a value node and subkey nodes.
193 #define xbc_node_for_each_child(parent, child)				\  argument
194 	for (child = xbc_node_get_child(parent); child != NULL ;	\
195 	     child = xbc_node_get_next(child))
198  * xbc_node_for_each_subkey() - Iterate child subkey nodes
200  * @child: Iterated XBC node.
202  * Iterate subkey nodes of @parent. Each child nodes are stored to @child.
203  * The @child is only the subkey node.
205 #define xbc_node_for_each_subkey(parent, child)				\  argument
206 	for (child = xbc_node_get_subkey(parent); child != NULL ;	\
207 	     child = xbc_node_get_next(child))