new_n            1460 lib/assoc_array.c 	struct assoc_array_node *node, *new_n;
new_n            1509 lib/assoc_array.c 	new_n = kzalloc(sizeof(struct assoc_array_node), GFP_KERNEL);
new_n            1510 lib/assoc_array.c 	if (!new_n)
new_n            1512 lib/assoc_array.c 	pr_devel("dup node %p -> %p\n", node, new_n);
new_n            1513 lib/assoc_array.c 	new_n->back_pointer = new_parent;
new_n            1514 lib/assoc_array.c 	new_n->parent_slot = node->parent_slot;
new_n            1515 lib/assoc_array.c 	*new_ptr_pp = new_parent = assoc_array_node_to_ptr(new_n);
new_n            1532 lib/assoc_array.c 				new_n->slots[slot] = ptr;
new_n            1536 lib/assoc_array.c 		new_ptr_pp = &new_n->slots[slot];
new_n            1541 lib/assoc_array.c 	pr_devel("-- compress node %p --\n", new_n);
new_n            1546 lib/assoc_array.c 	new_n->nr_leaves_on_branch = 0;
new_n            1549 lib/assoc_array.c 		ptr = new_n->slots[slot];
new_n            1553 lib/assoc_array.c 			new_n->nr_leaves_on_branch++;
new_n            1555 lib/assoc_array.c 	pr_devel("free=%d, leaves=%lu\n", nr_free, new_n->nr_leaves_on_branch);
new_n            1563 lib/assoc_array.c 		ptr = new_n->slots[slot];
new_n            1574 lib/assoc_array.c 		new_n->nr_leaves_on_branch += child->nr_leaves_on_branch;
new_n            1587 lib/assoc_array.c 			new_n->slots[slot] = NULL;
new_n            1596 lib/assoc_array.c 				while (new_n->slots[next_slot])
new_n            1599 lib/assoc_array.c 				new_n->slots[next_slot++] = p;
new_n            1610 lib/assoc_array.c 	pr_devel("after: %lu\n", new_n->nr_leaves_on_branch);
new_n            1612 lib/assoc_array.c 	nr_leaves_on_tree = new_n->nr_leaves_on_branch;
new_n            1617 lib/assoc_array.c 			if ((ptr = new_n->slots[slot]))
new_n            1622 lib/assoc_array.c 			pr_devel("excise node %p with 1 shortcut\n", new_n);
new_n            1624 lib/assoc_array.c 			new_parent = new_n->back_pointer;
new_n            1625 lib/assoc_array.c 			slot = new_n->parent_slot;
new_n            1626 lib/assoc_array.c 			kfree(new_n);
new_n            1654 lib/assoc_array.c 			new_n = assoc_array_ptr_to_node(new_parent);
new_n            1655 lib/assoc_array.c 			new_n->slots[slot] = ptr;
new_n            1663 lib/assoc_array.c 	ptr = new_n->back_pointer;
new_n            1672 lib/assoc_array.c 		if (new_n->nr_leaves_on_branch <= ASSOC_ARRAY_FAN_OUT) {
new_n            1676 lib/assoc_array.c 			new_n->back_pointer = new_parent;
new_n            1677 lib/assoc_array.c 			new_n->parent_slot = slot;
new_n            1680 lib/assoc_array.c 				new_root = assoc_array_node_to_ptr(new_n);
new_n            1685 lib/assoc_array.c 			n->slots[slot] = assoc_array_node_to_ptr(new_n);
new_n            1690 lib/assoc_array.c 	new_n = assoc_array_ptr_to_node(new_parent);