Lines Matching defs:rb_node
82 struct rb_node rb_node;
98 struct rb_node rb_node;
229 struct rb_node *rb_node;
230 rb_erase(&node->rb_node, &cache->rb_root);
232 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node);
233 if (rb_node)
353 struct rb_node *rb_node;
359 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr);
360 if (rb_node) {
361 node = rb_entry(rb_node, struct mapping_node, rb_node);
435 rb_erase(&cur->rb_node, &cache->rb_root);
546 struct rb_node *rb_node;
551 rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start);
552 if (rb_node) {
553 node = rb_entry(rb_node, struct btrfs_backref_node, rb_node);
561 rb_node = rb_simple_search(&cache->rb_root,
563 if (rb_node) {
564 node = rb_entry(rb_node, struct btrfs_backref_node,
565 rb_node);
596 rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr,
597 &new_node->rb_node);
598 if (rb_node)
625 struct rb_node *rb_node;
637 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root,
638 node->bytenr, &node->rb_node);
640 if (rb_node) {
657 struct rb_node *rb_node;
664 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
666 if (rb_node) {
667 node = rb_entry(rb_node, struct mapping_node, rb_node);
668 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
669 RB_CLEAR_NODE(&node->rb_node);
701 struct rb_node *rb_node;
706 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
708 if (rb_node) {
709 node = rb_entry(rb_node, struct mapping_node, rb_node);
710 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
720 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root,
721 node->bytenr, &node->rb_node);
723 if (rb_node)
943 struct rb_node *node;
944 struct rb_node *prev;
950 node = root->inode_tree.rb_node;
954 entry = rb_entry(node, struct btrfs_inode, rb_node);
965 entry = rb_entry(prev, struct btrfs_inode, rb_node);
974 entry = rb_entry(node, struct btrfs_inode, rb_node);
2007 struct rb_node *rb_node;
2008 while ((rb_node = rb_first(blocks))) {
2009 block = rb_entry(rb_node, struct tree_block, rb_node);
2010 rb_erase(rb_node, blocks);
2565 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2571 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2580 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2870 struct rb_node *rb_node;
2911 rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node);
2912 if (rb_node)
3560 &rc->reloc_root_tree.rb_root, rb_node)