30 	return !RB_EMPTY_NODE(&state->rb_node);  in extent_state_in_tree()
116 	struct rb_node rb_node;  member
236 	RB_CLEAR_NODE(&state->rb_node);  in alloc_extent_state()
256 static struct rb_node *tree_insert(struct rb_root *root,  in tree_insert()
257 				   struct rb_node *search_start,  in tree_insert()
259 				   struct rb_node *node,  in tree_insert()
260 				   struct rb_node ***p_in,  in tree_insert()
261 				   struct rb_node **parent_in)  in tree_insert()
263 	struct rb_node **p;  in tree_insert()
264 	struct rb_node *parent = NULL;  in tree_insert()
273 	p = search_start ? &search_start : &root->rb_node;  in tree_insert()
276 		entry = rb_entry(parent, struct tree_entry, rb_node);  in tree_insert()
292 static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset,  in __etree_search()
293 				      struct rb_node **prev_ret,  in __etree_search()
294 				      struct rb_node **next_ret,  in __etree_search()
295 				      struct rb_node ***p_ret,  in __etree_search()
296 				      struct rb_node **parent_ret)  in __etree_search()
299 	struct rb_node **n = &root->rb_node;  in __etree_search()
300 	struct rb_node *prev = NULL;  in __etree_search()
301 	struct rb_node *orig_prev = NULL;  in __etree_search()
307 		entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
327 			prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
334 		prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
337 			prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
344 static inline struct rb_node *
347 		       struct rb_node ***p_ret,  in tree_search_for_insert()
348 		       struct rb_node **parent_ret)  in tree_search_for_insert()
350 	struct rb_node *prev = NULL;  in tree_search_for_insert()
351 	struct rb_node *ret;  in tree_search_for_insert()
359 static inline struct rb_node *tree_search(struct extent_io_tree *tree,  in tree_search()
386 	struct rb_node *other_node;  in merge_state()
391 	other_node = rb_prev(&state->rb_node);  in merge_state()
393 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
398 			rb_erase(&other->rb_node, &tree->state);  in merge_state()
399 			RB_CLEAR_NODE(&other->rb_node);  in merge_state()
403 	other_node = rb_next(&state->rb_node);  in merge_state()
405 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
410 			rb_erase(&other->rb_node, &tree->state);  in merge_state()
411 			RB_CLEAR_NODE(&other->rb_node);  in merge_state()
447 			struct rb_node ***p,  in insert_state()
448 			struct rb_node **parent,  in insert_state()
451 	struct rb_node *node;  in insert_state()
461 	node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent);  in insert_state()
464 		found = rb_entry(node, struct extent_state, rb_node);  in insert_state()
498 	struct rb_node *node;  in split_state()
507 	node = tree_insert(&tree->state, &orig->rb_node, prealloc->end,  in split_state()
508 			   &prealloc->rb_node, NULL, NULL);  in split_state()
518 	struct rb_node *next = rb_next(&state->rb_node);  in next_state()
520 		return rb_entry(next, struct extent_state, rb_node);  in next_state()
553 			rb_erase(&state->rb_node, &tree->state);  in clear_state_bit()
554 			RB_CLEAR_NODE(&state->rb_node);  in clear_state_bit()
602 	struct rb_node *node;  in __clear_extent_bit()
656 	state = rb_entry(node, struct extent_state, rb_node);  in __clear_extent_bit()
771 	struct rb_node *node;  in wait_extent_bit()
787 		state = rb_entry(node, struct extent_state, rb_node);  in wait_extent_bit()
866 	struct rb_node *node;  in __set_extent_bit()
867 	struct rb_node **p;  in __set_extent_bit()
868 	struct rb_node *parent;  in __set_extent_bit()
887 			node = &state->rb_node;  in __set_extent_bit()
908 	state = rb_entry(node, struct extent_state, rb_node);  in __set_extent_bit()
1092 	struct rb_node *node;  in convert_extent_bit()
1093 	struct rb_node **p;  in convert_extent_bit()
1094 	struct rb_node *parent;  in convert_extent_bit()
1121 			node = &state->rb_node;  in convert_extent_bit()
1145 	state = rb_entry(node, struct extent_state, rb_node);  in convert_extent_bit()
1514 	struct rb_node *node;  in find_first_extent_bit_state()
1526 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_extent_bit_state()
1550 	struct rb_node *n;  in find_first_extent_bit()
1557 			n = rb_next(&state->rb_node);  in find_first_extent_bit()
1560 						 rb_node);  in find_first_extent_bit()
1596 	struct rb_node *node;  in find_delalloc_range()
1616 		state = rb_entry(node, struct extent_state, rb_node);  in find_delalloc_range()
1884 	struct rb_node *node;  in count_range_bits()
1908 		state = rb_entry(node, struct extent_state, rb_node);  in count_range_bits()
1941 	struct rb_node *node;  in set_state_private()
1955 	state = rb_entry(node, struct extent_state, rb_node);  in set_state_private()
1968 	struct rb_node *node;  in get_state_private()
1982 	state = rb_entry(node, struct extent_state, rb_node);  in get_state_private()
2003 	struct rb_node *node;  in test_range_bit()
2009 		node = &cached->rb_node;  in test_range_bit()
2013 		state = rb_entry(node, struct extent_state, rb_node);  in test_range_bit()