Lines Matching refs:next
43 * simply a key word or a value. A key node may have a next key node or/and
44 * a child node (both key and value). A value node may have a next value
160 * xbc_node_get_next() - Get the next sibling XBC node
163 * Return the NEXT sibling node of @node. If the node has no next sibling,
170 return node->next ? &xbc_nodes[node->next] : NULL;
331 * xbc_node_find_next_leaf() - Find the next leaf node under given node
335 * Search the next leaf node (which means the terminal key node) of @node
337 * Return the next node or NULL if next leaf node is not found.
342 struct xbc_node *next;
353 next = xbc_node_get_subkey(node);
354 if (next) {
355 node = next;
362 while (!node->next) {
381 * xbc_node_find_next_key_value() - Find the next key-value pair nodes
385 * Search the next leaf node (which means the terminal key node) of *@leaf
386 * under @root node. Returns the value and update *@leaf if next leaf node
387 * is found, or NULL if no next leaf node is found.
418 node->next = 0;
439 while (node->next)
462 sib->next = xbc_node_index(node);
466 node->next = last_parent->child;
471 sib->next = xbc_node_index(node);
612 char *next;
619 c = __xbc_parse_value(__v, &next);
626 *__v = next;
696 char *next;
703 c = __xbc_parse_value(&v, &next);
712 unsigned short nidx = child->next;
715 child->next = nidx; /* keep subkeys */
727 c = xbc_parse_array(&next);
735 ret = __xbc_close_brace(next - 1);
740 *k = next;
805 if (xbc_nodes[i].next > xbc_node_num) {