fs/btrfs/extent-io-tree.c

14 	return !RB_EMPTY_NODE(&state->rb_node);
140 	rbtree_postorder_for_each_entry_safe(state, tmp, &root, rb_node) {
142 		RB_CLEAR_NODE(&state->rb_node);
174 	RB_CLEAR_NODE(&state->rb_node);
222 	struct rb_node *next = rb_next(&state->rb_node);
225 		return rb_entry(next, struct extent_state, rb_node);
232 	struct rb_node *next = rb_prev(&state->rb_node);
235 		return rb_entry(next, struct extent_state, rb_node);
259 							  struct rb_node ***node_ret,
260 							  struct rb_node **parent_ret)
263 	struct rb_node **node = &root->rb_node;
264 	struct rb_node *prev = NULL;
269 		entry = rb_entry(prev, struct extent_state, rb_node);
309 	struct rb_node **node = &root->rb_node;
317 		entry = rb_entry(*node, struct extent_state, rb_node);
368 		rb_erase(&prev->rb_node, &tree->state);
369 		RB_CLEAR_NODE(&prev->rb_node);
384 		rb_erase(&next->rb_node, &tree->state);
385 		RB_CLEAR_NODE(&next->rb_node);
443 	struct rb_node **node;
444 	struct rb_node *parent = NULL;
451 	node = &tree->state.rb_node;
456 		entry = rb_entry(parent, struct extent_state, rb_node);
489 	rb_link_node(&state->rb_node, parent, node);
490 	rb_insert_color(&state->rb_node, &tree->state);
499 			      struct extent_state *state, struct rb_node **node,
500 			      struct rb_node *parent, unsigned bits,
504 	rb_link_node(&state->rb_node, parent, node);
505 	rb_insert_color(&state->rb_node, &tree->state);
526 	struct rb_node *parent = NULL;
527 	struct rb_node **node;
538 	parent = &orig->rb_node;
544 		entry = rb_entry(parent, struct extent_state, rb_node);
556 	rb_link_node(&prealloc->rb_node, parent, node);
557 	rb_insert_color(&prealloc->rb_node, &tree->state);
590 			rb_erase(&state->rb_node, &tree->state);
591 			RB_CLEAR_NODE(&state->rb_node);
1060 	struct rb_node **p = NULL;
1061 	struct rb_node *parent = NULL;
1313 	struct rb_node **p = NULL;
1314 	struct rb_node *parent = NULL;