Lines Matching refs:nodes
150 /* size of relocated tree nodes */
191 * walk up backref nodes until reach node presents tree root
212 * walk down backref nodes to find start of next reference path
267 * detached nodes are used to avoid unnecessary backref
269 * so the detached nodes are no longer useful.
286 * some nodes can be left in the pending list if there were
287 * errors during processing the pending nodes.
381 * For useless nodes, do two major clean ups:
383 * - Cleanup the children edges and nodes
387 * - Freeing up leaves (level 0), keeps nodes detached
388 * For nodes, the node is still cached as "detached"
407 /* Only tree root nodes can be added to @useless_nodes */
439 * Backref nodes for tree leaves are deleted from the cache.
440 * Backref nodes for upper level tree blocks are left in the
521 /* Finish the upper linkage of newly added edges/nodes */
1038 leaf = path->nodes[0];
1197 btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1238 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1284 eb = path->nodes[level];
1337 btrfs_node_key_to_cpu(path->nodes[level], &key,
1368 path->nodes[level], path->slots[level],
1379 btrfs_set_node_blockptr(path->nodes[level],
1381 btrfs_set_node_ptr_generation(path->nodes[level],
1383 btrfs_mark_buffer_dirty(trans, path->nodes[level]);
1386 blocksize, path->nodes[level]->start);
1405 blocksize, path->nodes[level]->start);
1449 free_extent_buffer(path->nodes[i]);
1450 path->nodes[i] = NULL;
1453 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1454 eb = path->nodes[i];
1465 free_extent_buffer(path->nodes[i]);
1466 path->nodes[i] = NULL;
1487 eb = path->nodes[i];
1510 path->nodes[i - 1] = eb;
1596 if (!path->nodes[level])
1599 btrfs_header_nritems(path->nodes[level])) {
1600 btrfs_node_key_to_cpu(path->nodes[level], key,
1722 path->nodes[level] = reloc_root->node;
1737 btrfs_node_key_to_cpu(path->nodes[level], &next_key,
1802 btrfs_node_key_to_cpu(path->nodes[level], &key,
1816 btrfs_node_key(path->nodes[level], &root_item->drop_progress,
2100 * The remaining nodes will be cleaned up by free_reloc_control.
2462 upper->eb = path->nodes[upper->level];
2463 path->nodes[upper->level] = NULL;
2465 BUG_ON(upper->eb != path->nodes[upper->level]);
3210 eb = path->nodes[0];
3333 btrfs_item_key_to_cpu(path->nodes[0], &key,
3350 btrfs_print_leaf(path->nodes[0]);
3528 leaf = path->nodes[0];
3533 leaf = path->nodes[0];
3701 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
3703 flags = btrfs_extent_flags(path->nodes[0], ei);
3830 leaf = path->nodes[0];
4238 leaf = path->nodes[0];
4498 * relocated tree nodes in the worst case. half for cowing