Lines Matching refs:rb_node
15 return !RB_EMPTY_NODE(&state->rb_node); in extent_state_in_tree()
124 rbtree_postorder_for_each_entry_safe(state, tmp, &root, rb_node) { in btrfs_extent_io_tree_release()
126 RB_CLEAR_NODE(&state->rb_node); in btrfs_extent_io_tree_release()
158 RB_CLEAR_NODE(&state->rb_node); in alloc_extent_state()
206 struct rb_node *next = rb_next(&state->rb_node); in next_state()
208 return rb_entry_safe(next, struct extent_state, rb_node); in next_state()
213 struct rb_node *next = rb_prev(&state->rb_node); in prev_state()
215 return rb_entry_safe(next, struct extent_state, rb_node); in prev_state()
239 struct rb_node ***node_ret, in tree_search_for_insert()
240 struct rb_node **parent_ret) in tree_search_for_insert()
243 struct rb_node **node = &root->rb_node; in tree_search_for_insert()
244 struct rb_node *prev = NULL; in tree_search_for_insert()
249 entry = rb_entry(prev, struct extent_state, rb_node); in tree_search_for_insert()
293 struct rb_node **node = &root->rb_node; in tree_search_prev_next()
301 entry = rb_entry(*node, struct extent_state, rb_node); in tree_search_prev_next()
351 rb_erase(&prev->rb_node, &tree->state); in merge_prev_state()
352 RB_CLEAR_NODE(&prev->rb_node); in merge_prev_state()
366 rb_erase(&next->rb_node, &tree->state); in merge_next_state()
367 RB_CLEAR_NODE(&next->rb_node); in merge_next_state()
425 struct rb_node **node; in insert_state()
426 struct rb_node *parent = NULL; in insert_state()
433 node = &tree->state.rb_node; in insert_state()
438 entry = rb_entry(parent, struct extent_state, rb_node); in insert_state()
469 rb_link_node(&state->rb_node, parent, node); in insert_state()
470 rb_insert_color(&state->rb_node, &tree->state); in insert_state()
479 struct extent_state *state, struct rb_node **node, in insert_state_fast()
480 struct rb_node *parent, unsigned bits, in insert_state_fast()
484 rb_link_node(&state->rb_node, parent, node); in insert_state_fast()
485 rb_insert_color(&state->rb_node, &tree->state); in insert_state_fast()
506 struct rb_node *parent = NULL; in split_state()
507 struct rb_node **node; in split_state()
517 parent = &orig->rb_node; in split_state()
523 entry = rb_entry(parent, struct extent_state, rb_node); in split_state()
535 rb_link_node(&prealloc->rb_node, parent, node); in split_state()
536 rb_insert_color(&prealloc->rb_node, &tree->state); in split_state()
580 rb_erase(&state->rb_node, &tree->state); in clear_state_bit()
581 RB_CLEAR_NODE(&state->rb_node); in clear_state_bit()
1054 struct rb_node **p = NULL; in set_extent_bit()
1055 struct rb_node *parent = NULL; in set_extent_bit()
1324 struct rb_node **p = NULL; in btrfs_convert_extent_bit()
1325 struct rb_node *parent = NULL; in btrfs_convert_extent_bit()