45 	 * The first pass does all the leaves in this node.  This means we  in assoc_array_subtree_iterate()
46 	 * don't miss any leaves if the node is split up by insertion whilst  in assoc_array_subtree_iterate()
48 	 * some leaves twice).  in assoc_array_subtree_iterate()
68 	 * back to a replacement node with the leaves in a different layout.  in assoc_array_subtree_iterate()
299  * to the node that should contain the object and then searching the leaves
501 	/* Firstly, we have to check the leaves in this node to see if there's  in assoc_array_insert_into_terminal_node()
548 	/* We need to find out how similar the leaves are. */  in assoc_array_insert_into_terminal_node()
569 	/* The node contains only leaves */  in assoc_array_insert_into_terminal_node()
575 	pr_devel("only leaves; dissimilarity=%lx\n", dissimilarity);  in assoc_array_insert_into_terminal_node()
578 		/* The old leaves all cluster in the same slot.  We will need  in assoc_array_insert_into_terminal_node()
584 		/* Otherwise all the old leaves cluster in the same slot, but  in assoc_array_insert_into_terminal_node()
587 		 * a new node (n1) holding all the old leaves.  in assoc_array_insert_into_terminal_node()
592 		pr_devel("present leaves cluster but not new leaf\n");  in assoc_array_insert_into_terminal_node()
600 	 * with the new leaf) and the rest meta-pointers, to all leaves, some  in assoc_array_insert_into_terminal_node()
603 	 * It won't contain the case in which all the current leaves plus the  in assoc_array_insert_into_terminal_node()
604 	 * new leaves want to cluster in the same slot.  in assoc_array_insert_into_terminal_node()
606 	 * We need to expel at least two leaves out of a set consisting of the  in assoc_array_insert_into_terminal_node()
607 	 * leaves in the node and the new leaf.  The current meta pointers can  in assoc_array_insert_into_terminal_node()
608 	 * just be copied as they shouldn't cluster with any of the leaves.  in assoc_array_insert_into_terminal_node()
625 	/* Begin by finding two matching leaves.  There have to be at least two  in assoc_array_insert_into_terminal_node()
629 	 * remaining leaf slots, we now have N+1 leaves to go in them.  in assoc_array_insert_into_terminal_node()
714 	/* All the leaves, new and old, want to cluster together in this node  in assoc_array_insert_into_terminal_node()
720 	 * Firstly we need to work out where the leaves start diverging as a  in assoc_array_insert_into_terminal_node()
724 	 * We only need to make a single pass of N of the N+1 leaves because if  in assoc_array_insert_into_terminal_node()
728 	pr_devel("all leaves cluster together\n");  in assoc_array_insert_into_terminal_node()
1151 	 * leaves in it, then attempt to collapse it - and attempt to  in assoc_array_delete()
1162 		 * that we don't try collapsing if all the leaves are already  in assoc_array_delete()
1174 		pr_devel("leaves: %ld [m=%d]\n",  in assoc_array_delete()
1519 	/* Filter across any leaves and gc any subtrees */  in assoc_array_gc()
1555 	pr_devel("free=%d, leaves=%lu\n", nr_free, new_n->nr_leaves_on_branch);  in assoc_array_gc()
1667 	 * only contain leaves.  in assoc_array_gc()