Lines Matching refs:node

30 	const struct assoc_array_node *node;  in assoc_array_subtree_iterate()  local
45 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
58 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
88 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
92 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
101 parent = ACCESS_ONCE(node->back_pointer); in assoc_array_subtree_iterate()
102 slot = node->parent_slot; in assoc_array_subtree_iterate()
165 struct assoc_array_node *node; /* Node in which leaf might be found */ member
188 struct assoc_array_node *node; in assoc_array_walk() local
218 node = assoc_array_ptr_to_node(cursor); in assoc_array_walk()
223 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_walk()
232 result->terminal_node.node = node; in assoc_array_walk()
324 const struct assoc_array_node *node; in assoc_array_find() local
333 node = result.terminal_node.node; in assoc_array_find()
340 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_find()
364 struct assoc_array_node *node; in assoc_array_destroy_subtree() local
391 node = assoc_array_ptr_to_node(cursor); in assoc_array_destroy_subtree()
392 BUG_ON(node->back_pointer != parent); in assoc_array_destroy_subtree()
393 BUG_ON(slot != -1 && node->parent_slot != slot); in assoc_array_destroy_subtree()
397 pr_devel("Node %p [back=%p]\n", node, node->back_pointer); in assoc_array_destroy_subtree()
399 struct assoc_array_ptr *ptr = node->slots[slot]; in assoc_array_destroy_subtree()
414 parent = node->back_pointer; in assoc_array_destroy_subtree()
415 slot = node->parent_slot; in assoc_array_destroy_subtree()
417 kfree(node); in assoc_array_destroy_subtree()
440 node = assoc_array_ptr_to_node(cursor); in assoc_array_destroy_subtree()
497 struct assoc_array_node *node, *new_n0, *new_n1, *side; in assoc_array_insert_into_terminal_node() local
505 node = result->terminal_node.node; in assoc_array_insert_into_terminal_node()
522 ptr = node->slots[i]; in assoc_array_insert_into_terminal_node()
531 edit->leaf_p = &node->slots[i]; in assoc_array_insert_into_terminal_node()
532 edit->dead_leaf = node->slots[i]; in assoc_array_insert_into_terminal_node()
543 edit->leaf_p = &node->slots[free_slot]; in assoc_array_insert_into_terminal_node()
544 edit->adjust_count_on = node; in assoc_array_insert_into_terminal_node()
569 ptr = node->slots[i]; in assoc_array_insert_into_terminal_node()
621 new_n0->back_pointer = node->back_pointer; in assoc_array_insert_into_terminal_node()
622 new_n0->parent_slot = node->parent_slot; in assoc_array_insert_into_terminal_node()
629 new_n0->nr_leaves_on_branch = node->nr_leaves_on_branch; in assoc_array_insert_into_terminal_node()
655 if (assoc_array_ptr_is_meta(node->slots[i])) in assoc_array_insert_into_terminal_node()
656 new_n0->slots[i] = node->slots[i]; in assoc_array_insert_into_terminal_node()
666 if (assoc_array_ptr_is_meta(node->slots[i])) in assoc_array_insert_into_terminal_node()
669 new_n1->slots[next_slot++] = node->slots[i]; in assoc_array_insert_into_terminal_node()
675 new_n0->slots[free_slot] = node->slots[i]; in assoc_array_insert_into_terminal_node()
697 ptr = node->slots[i]; in assoc_array_insert_into_terminal_node()
709 ptr = node->back_pointer; in assoc_array_insert_into_terminal_node()
713 edit->set[0].ptr = &assoc_array_ptr_to_node(ptr)->slots[node->parent_slot]; in assoc_array_insert_into_terminal_node()
716 edit->excised_meta[0] = assoc_array_node_to_ptr(node); in assoc_array_insert_into_terminal_node()
727 new_n0->back_pointer = node->back_pointer; in assoc_array_insert_into_terminal_node()
728 new_n0->parent_slot = node->parent_slot; in assoc_array_insert_into_terminal_node()
729 new_n0->nr_leaves_on_branch = node->nr_leaves_on_branch; in assoc_array_insert_into_terminal_node()
732 new_n1->nr_leaves_on_branch = node->nr_leaves_on_branch; in assoc_array_insert_into_terminal_node()
736 new_n1->slots[i] = node->slots[i]; in assoc_array_insert_into_terminal_node()
741 edit->set[0].ptr = &assoc_array_ptr_to_node(node->back_pointer)->slots[node->parent_slot]; in assoc_array_insert_into_terminal_node()
743 edit->excised_meta[0] = assoc_array_node_to_ptr(node); in assoc_array_insert_into_terminal_node()
765 int x = ops->diff_objects(assoc_array_ptr_to_leaf(node->slots[i]), in assoc_array_insert_into_terminal_node()
785 new_s0->back_pointer = node->back_pointer; in assoc_array_insert_into_terminal_node()
786 new_s0->parent_slot = node->parent_slot; in assoc_array_insert_into_terminal_node()
809 ptr = node->slots[i]; in assoc_array_insert_into_terminal_node()
830 struct assoc_array_node *node, *new_n0, *side; in assoc_array_insert_mid_shortcut() local
859 node = assoc_array_ptr_to_node(shortcut->back_pointer); in assoc_array_insert_mid_shortcut()
860 edit->set[0].ptr = &node->slots[shortcut->parent_slot]; in assoc_array_insert_mid_shortcut()
1070 struct assoc_array_node *node; member
1088 collapse->node->slots[collapse->slot++] = assoc_array_leaf_to_ptr(leaf); in assoc_array_delete_collapse_iterator()
1117 struct assoc_array_node *node, *new_n0; in assoc_array_delete() local
1138 node = result.terminal_node.node; in assoc_array_delete()
1141 ptr = node->slots[slot]; in assoc_array_delete()
1162 edit->dead_leaf = node->slots[slot]; in assoc_array_delete()
1163 edit->set[0].ptr = &node->slots[slot]; in assoc_array_delete()
1165 edit->adjust_count_on = node; in assoc_array_delete()
1189 if (node->nr_leaves_on_branch <= ASSOC_ARRAY_FAN_OUT + 1) { in assoc_array_delete()
1199 ptr = node->slots[i]; in assoc_array_delete()
1207 node->nr_leaves_on_branch - 1, has_meta); in assoc_array_delete()
1212 parent = node; in assoc_array_delete()
1237 if (has_meta || parent != node) { in assoc_array_delete()
1238 node = parent; in assoc_array_delete()
1246 new_n0->back_pointer = node->back_pointer; in assoc_array_delete()
1247 new_n0->parent_slot = node->parent_slot; in assoc_array_delete()
1248 new_n0->nr_leaves_on_branch = node->nr_leaves_on_branch; in assoc_array_delete()
1251 collapse.node = new_n0; in assoc_array_delete()
1254 assoc_array_subtree_iterate(assoc_array_node_to_ptr(node), in assoc_array_delete()
1255 node->back_pointer, in assoc_array_delete()
1261 if (!node->back_pointer) { in assoc_array_delete()
1263 } else if (assoc_array_ptr_is_leaf(node->back_pointer)) { in assoc_array_delete()
1265 } else if (assoc_array_ptr_is_node(node->back_pointer)) { in assoc_array_delete()
1267 assoc_array_ptr_to_node(node->back_pointer); in assoc_array_delete()
1268 edit->set[1].ptr = &p->slots[node->parent_slot]; in assoc_array_delete()
1269 } else if (assoc_array_ptr_is_shortcut(node->back_pointer)) { in assoc_array_delete()
1271 assoc_array_ptr_to_shortcut(node->back_pointer); in assoc_array_delete()
1275 edit->excised_subtree = assoc_array_node_to_ptr(node); in assoc_array_delete()
1380 struct assoc_array_node *node; in assoc_array_apply_edit() local
1408 node = edit->adjust_count_on; in assoc_array_apply_edit()
1410 node->nr_leaves_on_branch += edit->adjust_count_by; in assoc_array_apply_edit()
1412 ptr = node->back_pointer; in assoc_array_apply_edit()
1422 node = assoc_array_ptr_to_node(ptr); in assoc_array_apply_edit()
1491 struct assoc_array_node *node, *new_n; in assoc_array_gc() local
1539 node = assoc_array_ptr_to_node(cursor); in assoc_array_gc()
1543 pr_devel("dup node %p -> %p\n", node, new_n); in assoc_array_gc()
1545 new_n->parent_slot = node->parent_slot; in assoc_array_gc()
1553 ptr = node->slots[slot]; in assoc_array_gc()
1724 ptr = node->back_pointer; in assoc_array_gc()
1732 slot = node->parent_slot; in assoc_array_gc()
1736 node = assoc_array_ptr_to_node(cursor); in assoc_array_gc()