linux-master/lib/assoc_array.c

1459 	struct assoc_array_node *node, *new_n;
1508 	new_n = kzalloc(sizeof(struct assoc_array_node), GFP_KERNEL);
1509 	if (!new_n)
1511 	pr_devel("dup node %p -> %p\n", node, new_n);
1512 	new_n->back_pointer = new_parent;
1513 	new_n->parent_slot = node->parent_slot;
1514 	*new_ptr_pp = new_parent = assoc_array_node_to_ptr(new_n);
1531 				new_n->slots[slot] = ptr;
1535 		new_ptr_pp = &new_n->slots[slot];
1541 	pr_devel("-- compress node %p --\n", new_n);
1546 	new_n->nr_leaves_on_branch = 0;
1549 		ptr = new_n->slots[slot];
1553 			new_n->nr_leaves_on_branch++;
1555 	pr_devel("free=%d, leaves=%lu\n", nr_free, new_n->nr_leaves_on_branch);
1564 		ptr = new_n->slots[slot];
1575 		new_n->nr_leaves_on_branch += child->nr_leaves_on_branch;
1588 			new_n->slots[slot] = NULL;
1597 				while (new_n->slots[next_slot])
1600 				new_n->slots[next_slot++] = p;
1612 	if (retained && new_n->nr_leaves_on_branch <= ASSOC_ARRAY_FAN_OUT) {
1616 	pr_devel("after: %lu\n", new_n->nr_leaves_on_branch);
1618 	nr_leaves_on_tree = new_n->nr_leaves_on_branch;
1623 			if ((ptr = new_n->slots[slot]))
1628 			pr_devel("excise node %p with 1 shortcut\n", new_n);
1630 			new_parent = new_n->back_pointer;
1631 			slot = new_n->parent_slot;
1632 			kfree(new_n);
1660 			new_n = assoc_array_ptr_to_node(new_parent);
1661 			new_n->slots[slot] = ptr;
1669 	ptr = new_n->back_pointer;
1678 		if (new_n->nr_leaves_on_branch <= ASSOC_ARRAY_FAN_OUT) {
1682 			new_n->back_pointer = new_parent;
1683 			new_n->parent_slot = slot;
1686 				new_root = assoc_array_node_to_ptr(new_n);
1691 			n->slots[slot] = assoc_array_node_to_ptr(new_n);
1696 	new_n = assoc_array_ptr_to_node(new_parent);