Lines Matching refs:slots
52 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
81 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
209 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
324 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
382 struct assoc_array_ptr *ptr = node->slots[slot];
462 edit->leaf_p = &new_n0->slots[0];
505 ptr = node->slots[i];
514 edit->leaf_p = &node->slots[i];
515 edit->dead_leaf = node->slots[i];
526 edit->leaf_p = &node->slots[free_slot];
532 /* The node has no spare slots - so we're either going to have to split
549 pr_devel("no spare slots\n");
552 ptr = node->slots[i];
629 * remaining leaf slots, we now have N+1 leaves to go in them.
648 if (assoc_array_ptr_is_meta(node->slots[i]))
649 new_n0->slots[i] = node->slots[i];
651 new_n0->slots[i] = NULL;
652 BUG_ON(new_n0->slots[slot] != NULL);
653 new_n0->slots[slot] = assoc_array_node_to_ptr(new_n1);
659 if (assoc_array_ptr_is_meta(node->slots[i]))
662 new_n1->slots[next_slot++] = node->slots[i];
667 } while (new_n0->slots[free_slot] != NULL);
668 new_n0->slots[free_slot] = node->slots[i];
677 } while (new_n0->slots[free_slot] != NULL);
678 edit->leaf_p = &new_n0->slots[free_slot];
681 edit->leaf_p = &new_n1->slots[next_slot++];
690 ptr = node->slots[i];
706 edit->set[0].ptr = &assoc_array_ptr_to_node(ptr)->slots[node->parent_slot];
731 int x = ops->diff_objects(assoc_array_ptr_to_leaf(node->slots[i]),
776 ptr = node->slots[i];
827 edit->set[0].ptr = &node->slots[shortcut->parent_slot];
912 new_n0->slots[sc_slot] = assoc_array_shortcut_to_ptr(new_s1);
927 new_n0->slots[sc_slot] = shortcut->next_node;
936 edit->leaf_p = &new_n0->slots[1];
938 edit->leaf_p = &new_n0->slots[0];
1055 collapse->node->slots[collapse->slot++] = assoc_array_leaf_to_ptr(leaf);
1108 ptr = node->slots[slot];
1130 edit->dead_leaf = node->slots[slot];
1131 edit->set[0].ptr = &node->slots[slot];
1167 ptr = node->slots[i];
1236 edit->set[1].ptr = &p->slots[node->parent_slot];
1521 ptr = node->slots[slot];
1531 new_n->slots[slot] = ptr;
1535 new_ptr_pp = &new_n->slots[slot];
1543 /* Count up the number of empty slots in this node and work out the
1549 ptr = new_n->slots[slot];
1564 ptr = new_n->slots[slot];
1588 new_n->slots[slot] = NULL;
1593 struct assoc_array_ptr *p = child->slots[i];
1597 while (new_n->slots[next_slot])
1600 new_n->slots[next_slot++] = p;
1623 if ((ptr = new_n->slots[slot]))
1661 new_n->slots[slot] = ptr;
1691 n->slots[slot] = assoc_array_node_to_ptr(new_n);