Lines Matching defs:rb_node
93 struct rb_node rb_node;
109 struct rb_node rb_node;
241 struct rb_node *rb_node;
242 rb_erase(&node->rb_node, &cache->rb_root);
244 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node);
245 if (rb_node)
365 struct rb_node *rb_node;
371 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr);
372 if (rb_node) {
373 node = rb_entry(rb_node, struct mapping_node, rb_node);
447 rb_erase(&cur->rb_node, &cache->rb_root);
559 struct rb_node *rb_node;
564 rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start);
565 if (rb_node) {
566 node = rb_entry(rb_node, struct btrfs_backref_node, rb_node);
574 rb_node = rb_simple_search(&cache->rb_root,
576 if (rb_node) {
577 node = rb_entry(rb_node, struct btrfs_backref_node,
578 rb_node);
609 rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr,
610 &new_node->rb_node);
611 if (rb_node)
638 struct rb_node *rb_node;
650 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root,
651 node->bytenr, &node->rb_node);
653 if (rb_node) {
671 struct rb_node *rb_node;
678 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
680 if (rb_node) {
681 node = rb_entry(rb_node, struct mapping_node, rb_node);
682 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
683 RB_CLEAR_NODE(&node->rb_node);
715 struct rb_node *rb_node;
720 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
722 if (rb_node) {
723 node = rb_entry(rb_node, struct mapping_node, rb_node);
724 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
734 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root,
735 node->bytenr, &node->rb_node);
737 if (rb_node)
964 struct rb_node *node;
965 struct rb_node *prev;
971 node = root->inode_tree.rb_node;
975 entry = rb_entry(node, struct btrfs_inode, rb_node);
986 entry = rb_entry(prev, struct btrfs_inode, rb_node);
995 entry = rb_entry(node, struct btrfs_inode, rb_node);
2107 struct rb_node *rb_node;
2108 while ((rb_node = rb_first(blocks))) {
2109 block = rb_entry(rb_node, struct tree_block, rb_node);
2110 rb_erase(rb_node, blocks);
2789 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2797 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2806 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
3204 struct rb_node *rb_node;
3284 rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node);
3285 if (rb_node)
3986 &rc->reloc_root_tree.rb_root, rb_node)