Lines Matching refs:nodes
138 /* size of relocated tree nodes */
179 * walk up backref nodes until reach node presents tree root
200 * walk down backref nodes to find start of next reference path
255 * detached nodes are used to avoid unnecessary backref
257 * so the detached nodes are no longer useful.
274 * some nodes can be left in the pending list if there were
275 * errors during processing the pending nodes.
369 * For useless nodes, do two major clean ups:
371 * - Cleanup the children edges and nodes
375 * - Freeing up leaves (level 0), keeps nodes detached
376 * For nodes, the node is still cached as "detached"
395 /* Only tree root nodes can be added to @useless_nodes */
427 * Backref nodes for tree leaves are deleted from the cache.
428 * Backref nodes for upper level tree blocks are left in the
508 /* Finish the upper linkage of newly added edges/nodes */
1017 leaf = path->nodes[0];
1173 btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1214 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1261 eb = path->nodes[level];
1316 btrfs_node_key_to_cpu(path->nodes[level], &key,
1341 path->nodes[level], path->slots[level],
1352 btrfs_set_node_blockptr(path->nodes[level],
1354 btrfs_set_node_ptr_generation(path->nodes[level],
1356 btrfs_mark_buffer_dirty(path->nodes[level]);
1359 blocksize, path->nodes[level]->start);
1372 blocksize, path->nodes[level]->start);
1410 free_extent_buffer(path->nodes[i]);
1411 path->nodes[i] = NULL;
1414 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1415 eb = path->nodes[i];
1426 free_extent_buffer(path->nodes[i]);
1427 path->nodes[i] = NULL;
1452 eb = path->nodes[i];
1482 path->nodes[i - 1] = eb;
1566 if (!path->nodes[level])
1569 btrfs_header_nritems(path->nodes[level])) {
1570 btrfs_node_key_to_cpu(path->nodes[level], key,
1688 path->nodes[level] = reloc_root->node;
1703 btrfs_node_key_to_cpu(path->nodes[level], &next_key,
1774 btrfs_node_key_to_cpu(path->nodes[level], &key,
1788 btrfs_node_key(path->nodes[level], &root_item->drop_progress,
2000 * The remaining nodes will be cleaned up by free_reloc_control.
2281 upper->eb = path->nodes[upper->level];
2282 path->nodes[upper->level] = NULL;
2284 BUG_ON(upper->eb != path->nodes[upper->level]);
2875 eb = path->nodes[0];
2960 btrfs_item_key_to_cpu(path->nodes[0], &key,
2977 btrfs_print_leaf(path->nodes[0]);
3149 leaf = path->nodes[0];
3154 leaf = path->nodes[0];
3337 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
3339 item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]);
3341 flags = btrfs_extent_flags(path->nodes[0], ei);
3478 leaf = path->nodes[0];
3778 leaf = path->nodes[0];
4030 * relocated tree nodes in the worst case. half for cowing