Lines Matching refs:set
464 edit->set[0].ptr = &edit->array->root;
465 edit->set[0].to = assoc_array_node_to_ptr(new_n0);
606 * We need to expel at least two leaves out of a set consisting of the
613 edit->set[0].to = assoc_array_node_to_ptr(new_n0);
704 edit->set[0].ptr = &edit->array->root;
706 edit->set[0].ptr = &assoc_array_ptr_to_node(ptr)->slots[node->parent_slot];
708 edit->set[0].ptr = &assoc_array_ptr_to_shortcut(ptr)->next_node;
749 edit->set[0].to = assoc_array_shortcut_to_ptr(new_s0);
824 edit->set[0].ptr = &edit->array->root;
827 edit->set[0].ptr = &node->slots[shortcut->parent_slot];
856 edit->set[0].to = assoc_array_shortcut_to_ptr(new_s0);
873 edit->set[0].to = assoc_array_node_to_ptr(new_n0);
917 edit->set[1].ptr = &side->back_pointer;
918 edit->set[1].to = assoc_array_shortcut_to_ptr(new_s1);
930 edit->set[1].ptr = &side->back_pointer;
931 edit->set[1].to = assoc_array_node_to_ptr(new_n0);
973 /* The leaf pointer we're given must not have the bottom bit set as we
1024 * @object: The object pointer to set.
1131 edit->set[0].ptr = &node->slots[slot];
1132 edit->set[0].to = NULL;
1139 edit->set[1].ptr = &array->root;
1140 edit->set[1].to = NULL;
1230 edit->set[1].ptr = &array->root;
1236 edit->set[1].ptr = &p->slots[node->parent_slot];
1240 edit->set[1].ptr = &s->next_node;
1242 edit->set[1].to = assoc_array_node_to_ptr(new_n0);
1289 edit->set[1].ptr = &array->root;
1290 edit->set[1].to = NULL;
1369 for (i = 0; i < ARRAY_SIZE(edit->set); i++)
1370 if (edit->set[i].ptr)
1371 *edit->set[i].ptr = edit->set[i].to;
1478 edit->set[0].ptr = &array->root;
1716 edit->set[0].to = new_root;