Lines Matching defs:node
219 struct rb_node *node;
222 node = rb_first(&fs_info->defrag_inodes);
223 while (node) {
224 rb_erase(node, &fs_info->defrag_inodes);
225 defrag = rb_entry(node, struct inode_defrag, rb_node);
230 node = rb_first(&fs_info->defrag_inodes);
366 level = btrfs_header_level(root->node);
415 * The node at level 1 must always be locked when our path has
429 * Now that we reallocated the node we can find the next key. Note that
433 * node when path->slots[node_level - 1] does not point to the last
435 * we search for the next key after reallocating our node.