Lines Matching refs:ptr

27 	const struct assoc_array_ptr *cursor, *ptr, *parent;
52 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
53 has_meta |= (unsigned long)ptr;
54 if (ptr && assoc_array_ptr_is_leaf(ptr)) {
59 ret = iterator(assoc_array_ptr_to_leaf(ptr),
81 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
82 if (assoc_array_ptr_is_meta(ptr)) {
83 cursor = ptr;
177 struct assoc_array_ptr *cursor, *ptr;
209 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
212 slot, level, (unsigned long)ptr & 3);
214 if (!assoc_array_ptr_is_meta(ptr)) {
225 if (assoc_array_ptr_is_node(ptr)) {
229 cursor = ptr;
240 cursor = ptr;
310 const struct assoc_array_ptr *ptr;
324 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */
325 if (ptr && assoc_array_ptr_is_leaf(ptr)) {
330 leaf = assoc_array_ptr_to_leaf(ptr);
382 struct assoc_array_ptr *ptr = node->slots[slot];
383 if (!ptr)
385 if (assoc_array_ptr_is_meta(ptr)) {
387 cursor = ptr;
393 ops->free_object(assoc_array_ptr_to_leaf(ptr));
464 edit->set[0].ptr = &edit->array->root;
481 struct assoc_array_ptr *ptr;
505 ptr = node->slots[i];
506 if (!ptr) {
510 if (assoc_array_ptr_is_leaf(ptr) &&
511 ops->compare_object(assoc_array_ptr_to_leaf(ptr),
552 ptr = node->slots[i];
553 if (assoc_array_ptr_is_meta(ptr)) {
559 assoc_array_ptr_to_leaf(ptr), level);
690 ptr = node->slots[i];
691 BUG_ON(assoc_array_ptr_is_leaf(ptr));
692 if (assoc_array_ptr_is_node(ptr)) {
693 side = assoc_array_ptr_to_node(ptr);
696 shortcut = assoc_array_ptr_to_shortcut(ptr);
702 ptr = node->back_pointer;
703 if (!ptr)
704 edit->set[0].ptr = &edit->array->root;
705 else if (assoc_array_ptr_is_node(ptr))
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;
777 ptr = node->slots[i];
778 base_seg = ops->get_object_key_chunk(assoc_array_ptr_to_leaf(ptr),
825 edit->set[0].ptr = &edit->array->root;
828 edit->set[0].ptr = &node->slots[shortcut->parent_slot];
918 edit->set[1].ptr = &side->back_pointer;
931 edit->set[1].ptr = &side->back_pointer;
1087 struct assoc_array_ptr *ptr;
1109 ptr = node->slots[slot];
1110 if (ptr &&
1111 assoc_array_ptr_is_leaf(ptr) &&
1112 ops->compare_object(assoc_array_ptr_to_leaf(ptr),
1132 edit->set[0].ptr = &node->slots[slot];
1140 edit->set[1].ptr = &array->root;
1160 struct assoc_array_ptr *ptr;
1168 ptr = node->slots[i];
1169 if (assoc_array_ptr_is_meta(ptr)) {
1185 ptr = parent->back_pointer;
1186 if (!ptr)
1188 if (assoc_array_ptr_is_shortcut(ptr)) {
1189 struct assoc_array_shortcut *s = assoc_array_ptr_to_shortcut(ptr);
1190 ptr = s->back_pointer;
1191 if (!ptr)
1195 grandparent = assoc_array_ptr_to_node(ptr);
1231 edit->set[1].ptr = &array->root;
1237 edit->set[1].ptr = &p->slots[node->parent_slot];
1241 edit->set[1].ptr = &s->next_node;
1290 edit->set[1].ptr = &array->root;
1350 struct assoc_array_ptr *ptr;
1371 if (edit->set[i].ptr)
1372 *edit->set[i].ptr = edit->set[i].to;
1381 ptr = node->back_pointer;
1382 if (!ptr)
1384 if (assoc_array_ptr_is_shortcut(ptr)) {
1385 shortcut = assoc_array_ptr_to_shortcut(ptr);
1386 ptr = shortcut->back_pointer;
1387 if (!ptr)
1390 BUG_ON(!assoc_array_ptr_is_node(ptr));
1391 node = assoc_array_ptr_to_node(ptr);
1412 struct assoc_array_ptr *ptr;
1419 ptr = edit->new_meta[i];
1420 if (ptr) {
1421 if (assoc_array_ptr_is_node(ptr))
1422 kfree(assoc_array_ptr_to_node(ptr));
1424 kfree(assoc_array_ptr_to_shortcut(ptr));
1462 struct assoc_array_ptr *cursor, *ptr;
1479 edit->set[0].ptr = &array->root;
1523 ptr = node->slots[slot];
1524 if (!ptr)
1527 if (assoc_array_ptr_is_leaf(ptr)) {
1528 if (iterator(assoc_array_ptr_to_leaf(ptr),
1533 new_n->slots[slot] = ptr;
1538 cursor = ptr;
1551 ptr = new_n->slots[slot];
1552 if (!ptr)
1554 else if (assoc_array_ptr_is_leaf(ptr))
1566 ptr = new_n->slots[slot];
1567 if (!ptr || assoc_array_ptr_is_leaf(ptr))
1571 if (assoc_array_ptr_is_shortcut(ptr)) {
1572 s = assoc_array_ptr_to_shortcut(ptr);
1573 ptr = s->next_node;
1576 child = assoc_array_ptr_to_node(ptr);
1625 if ((ptr = new_n->slots[slot]))
1628 if (assoc_array_ptr_is_meta(ptr) &&
1629 assoc_array_ptr_is_shortcut(ptr)) {
1631 new_s = assoc_array_ptr_to_shortcut(ptr);
1638 new_root = ptr;
1655 new_root = ptr;
1663 new_n->slots[slot] = ptr;
1671 ptr = new_n->back_pointer;
1672 if (!ptr)
1675 if (assoc_array_ptr_is_shortcut(ptr)) {
1676 new_s = assoc_array_ptr_to_shortcut(ptr);
1696 new_parent = ptr;
1701 ptr = node->back_pointer;
1702 if (assoc_array_ptr_is_shortcut(ptr)) {
1703 shortcut = assoc_array_ptr_to_shortcut(ptr);
1710 cursor = ptr;