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;
776 ptr = node->slots[i];
777 base_seg = ops->get_object_key_chunk(assoc_array_ptr_to_leaf(ptr),
824 edit->set[0].ptr = &edit->array->root;
827 edit->set[0].ptr = &node->slots[shortcut->parent_slot];
917 edit->set[1].ptr = &side->back_pointer;
930 edit->set[1].ptr = &side->back_pointer;
1086 struct assoc_array_ptr *ptr;
1108 ptr = node->slots[slot];
1109 if (ptr &&
1110 assoc_array_ptr_is_leaf(ptr) &&
1111 ops->compare_object(assoc_array_ptr_to_leaf(ptr),
1131 edit->set[0].ptr = &node->slots[slot];
1139 edit->set[1].ptr = &array->root;
1159 struct assoc_array_ptr *ptr;
1167 ptr = node->slots[i];
1168 if (assoc_array_ptr_is_meta(ptr)) {
1184 ptr = parent->back_pointer;
1185 if (!ptr)
1187 if (assoc_array_ptr_is_shortcut(ptr)) {
1188 struct assoc_array_shortcut *s = assoc_array_ptr_to_shortcut(ptr);
1189 ptr = s->back_pointer;
1190 if (!ptr)
1194 grandparent = assoc_array_ptr_to_node(ptr);
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;
1289 edit->set[1].ptr = &array->root;
1349 struct assoc_array_ptr *ptr;
1370 if (edit->set[i].ptr)
1371 *edit->set[i].ptr = edit->set[i].to;
1380 ptr = node->back_pointer;
1381 if (!ptr)
1383 if (assoc_array_ptr_is_shortcut(ptr)) {
1384 shortcut = assoc_array_ptr_to_shortcut(ptr);
1385 ptr = shortcut->back_pointer;
1386 if (!ptr)
1389 BUG_ON(!assoc_array_ptr_is_node(ptr));
1390 node = assoc_array_ptr_to_node(ptr);
1411 struct assoc_array_ptr *ptr;
1418 ptr = edit->new_meta[i];
1419 if (ptr) {
1420 if (assoc_array_ptr_is_node(ptr))
1421 kfree(assoc_array_ptr_to_node(ptr));
1423 kfree(assoc_array_ptr_to_shortcut(ptr));
1461 struct assoc_array_ptr *cursor, *ptr;
1478 edit->set[0].ptr = &array->root;
1521 ptr = node->slots[slot];
1522 if (!ptr)
1525 if (assoc_array_ptr_is_leaf(ptr)) {
1526 if (iterator(assoc_array_ptr_to_leaf(ptr),
1531 new_n->slots[slot] = ptr;
1536 cursor = ptr;
1549 ptr = new_n->slots[slot];
1550 if (!ptr)
1552 else if (assoc_array_ptr_is_leaf(ptr))
1564 ptr = new_n->slots[slot];
1565 if (!ptr || assoc_array_ptr_is_leaf(ptr))
1569 if (assoc_array_ptr_is_shortcut(ptr)) {
1570 s = assoc_array_ptr_to_shortcut(ptr);
1571 ptr = s->next_node;
1574 child = assoc_array_ptr_to_node(ptr);
1623 if ((ptr = new_n->slots[slot]))
1626 if (assoc_array_ptr_is_meta(ptr) &&
1627 assoc_array_ptr_is_shortcut(ptr)) {
1629 new_s = assoc_array_ptr_to_shortcut(ptr);
1636 new_root = ptr;
1653 new_root = ptr;
1661 new_n->slots[slot] = ptr;
1669 ptr = new_n->back_pointer;
1670 if (!ptr)
1673 if (assoc_array_ptr_is_shortcut(ptr)) {
1674 new_s = assoc_array_ptr_to_shortcut(ptr);
1694 new_parent = ptr;
1699 ptr = node->back_pointer;
1700 if (assoc_array_ptr_is_shortcut(ptr)) {
1701 shortcut = assoc_array_ptr_to_shortcut(ptr);
1708 cursor = ptr;