Lines Matching defs:rb_node
231 struct rb_node **p;
232 struct rb_node *parent = NULL;
238 p = &root->rb_root.rb_node;
395 struct rb_node **p = &preftrees->direct.root.rb_root.rb_node;
396 struct rb_node *parent = NULL;
695 struct rb_node *rnode;
799 struct rb_node *node;
844 struct rb_node *n;
1215 struct rb_node *node;
2573 RB_CLEAR_NODE(&node->rb_node);
2681 struct rb_node *rb_node;
2710 rb_node = rb_simple_search(&cache->rb_root, ref_key->offset);
2711 if (!rb_node) {
2727 upper = rb_entry(rb_node, struct btrfs_backref_node, rb_node);
2759 struct rb_node *rb_node;
2843 rb_node = rb_simple_search(&cache->rb_root, eb->start);
2844 if (!rb_node) {
2881 upper = rb_entry(rb_node, struct btrfs_backref_node,
2882 rb_node);
2890 if (rb_node) {
3044 struct rb_node *rb_node;
3051 rb_node = rb_simple_insert(&cache->rb_root, start->bytenr,
3052 &start->rb_node);
3053 if (rb_node)
3091 * So if we have upper->rb_node populated, this means a cache
3095 if (!RB_EMPTY_NODE(&upper->rb_node)) {
3119 rb_node = rb_simple_insert(&cache->rb_root, upper->bytenr,
3120 &upper->rb_node);
3121 if (rb_node) {
3166 RB_EMPTY_NODE(&lower->rb_node))
3169 if (!RB_EMPTY_NODE(&upper->rb_node))