Lines Matching defs:next
22 * simply a key word or a value. A key node may have a next key node or/and
23 * a child node (both key and value). A value node may have a next value
95 * xbc_node_get_next() - Get the next sibling XBC node
98 * Return the NEXT sibling node of @node. If the node has no next sibling,
105 return node->next ? &xbc_nodes[node->next] : NULL;
266 * xbc_node_find_next_leaf() - Find the next leaf node under given node
270 * Search the next leaf node (which means the terminal key node) of @node
272 * Return the next node or NULL if next leaf node is not found.
288 while (!node->next) {
306 * xbc_node_find_next_key_value() - Find the next key-value pair nodes
310 * Search the next leaf node (which means the terminal key node) of *@leaf
311 * under @root node. Returns the value and update *@leaf if next leaf node
312 * is found, or NULL if no next leaf node is found.
343 node->next = 0;
364 while (node->next)
378 sib->next = xbc_node_index(node);
386 sib->next = xbc_node_index(node);
517 char *next;
521 c = __xbc_parse_value(__v, &next);
528 *__v = next;
530 node->next = 0;
597 char *next;
612 c = __xbc_parse_value(&v, &next);
622 c = xbc_parse_array(&next);
630 ret = __xbc_close_brace(next - 1);
635 *k = next;
700 if (xbc_nodes[i].next > xbc_node_num) {
875 pr_debug("[%d] %s (%s) .next=%d, .child=%d .parent=%d\n", i,
878 xbc_nodes[i].next, xbc_nodes[i].child,