linux-master/lib/assoc_array.c

21 				       int (*iterator)(const void *leaf,
153 		struct assoc_array_node	*node;	/* Node in which leaf might be found */
191 	/* Use segments from the key for the new leaf to navigate through the
194 	 * either empty or contains a leaf at which point we've found a node in
195 	 * which the leaf we're looking for might be found or into which it
238 	 * this leaf's.  Otherwise we need to split the shortcut.
248 		/* Check the leaf against the shortcut's index key a word at a
281 	/* The shortcut matches the leaf's index to this point. */
311 	const void *leaf;
330 			leaf = assoc_array_ptr_to_leaf(ptr);
331 			if (ops->compare_object(leaf, index_key))
332 				return (void *)leaf;
392 			pr_devel("[%d] free leaf\n", slot);
495 	 * pointer that we have to follow.  This means that (a) the leaf we
522 	 * leaf here.
585 		 * the new leaf wants to go into a different slot - so we
586 		 * create a new node (n0) to hold the new leaf and a pointer to
592 		pr_devel("present leaves cluster but not new leaf\n");
599 	 * from a single leaf (in the one leaf case, this leaf will cluster
600 	 * with the new leaf) and the rest meta-pointers, to all leaves, some
607 	 * leaves in the node and the new leaf.  The current meta pointers can
626 	 * that match - even if there are meta pointers - because any leaf that
629 	 * remaining leaf slots, we now have N+1 leaves to go in them.
655 	/* Filter the leaf pointers between the new nodes */
934 	/* Install the new leaf in a spare slot in the new node. */
973 	/* The leaf pointer we're given must not have the bottom bit set as we
985 	edit->leaf = assoc_array_leaf_to_ptr(object);
1033 	edit->leaf = assoc_array_leaf_to_ptr(object);
1045 static int assoc_array_delete_collapse_iterator(const void *leaf,
1050 	if (leaf == collapse->skip_leaf)
1055 	collapse->node->slots[collapse->slot++] = assoc_array_leaf_to_ptr(leaf);
1101 		/* We found a node that should contain the leaf we've been
1128 	 * the leaf after a suitable interval.
1135 	/* If that concludes erasure of the last leaf, then delete the entire
1356 		*edit->leaf_p = edit->leaf;
1406  * NOTE!  In the case of an insertion script, this does _not_ release the leaf
1544 	 * subtree leaf count.