Searched refs:leaf (Results 1 – 3 of 3) sorted by relevance
327 struct xbc_node **leaf) in xbc_node_find_next_key_value() argument330 if (WARN_ON(!leaf)) in xbc_node_find_next_key_value()333 *leaf = xbc_node_find_next_leaf(root, *leaf); in xbc_node_find_next_key_value()334 if (!*leaf) in xbc_node_find_next_key_value()336 if ((*leaf)->child) in xbc_node_find_next_key_value()337 return xbc_node_get_data(xbc_node_get_child(*leaf)); in xbc_node_find_next_key_value()
21 int (*iterator)(const void *leaf, in assoc_array_subtree_iterate() argument311 const void *leaf; in assoc_array_find() local330 leaf = assoc_array_ptr_to_leaf(ptr); in assoc_array_find()331 if (ops->compare_object(leaf, index_key)) in assoc_array_find()332 return (void *)leaf; in assoc_array_find()986 edit->leaf = assoc_array_leaf_to_ptr(object); in assoc_array_insert()1034 edit->leaf = assoc_array_leaf_to_ptr(object); in assoc_array_insert_set_object()1046 static int assoc_array_delete_collapse_iterator(const void *leaf, in assoc_array_delete_collapse_iterator() argument1051 if (leaf == collapse->skip_leaf) in assoc_array_delete_collapse_iterator()1056 collapse->node->slots[collapse->slot++] = assoc_array_leaf_to_ptr(leaf); in assoc_array_delete_collapse_iterator()[all …]
124 bool leaf) in nested_table_alloc() argument135 if (ntbl && leaf) { in nested_table_alloc()