33 	return !RB_EMPTY_NODE(&state->rb_node);  in extent_state_in_tree()
115 	struct rb_node rb_node;  member
273 		struct rb_node *node;  in extent_io_tree_release()
277 		state = rb_entry(node, struct extent_state, rb_node);  in extent_io_tree_release()
278 		rb_erase(&state->rb_node, &tree->state);  in extent_io_tree_release()
279 		RB_CLEAR_NODE(&state->rb_node);  in extent_io_tree_release()
306 	RB_CLEAR_NODE(&state->rb_node);  in alloc_extent_state()
326 static struct rb_node *tree_insert(struct rb_root *root,  in tree_insert()
327 				   struct rb_node *search_start,  in tree_insert()
329 				   struct rb_node *node,  in tree_insert()
330 				   struct rb_node ***p_in,  in tree_insert()
331 				   struct rb_node **parent_in)  in tree_insert()
333 	struct rb_node **p;  in tree_insert()
334 	struct rb_node *parent = NULL;  in tree_insert()
343 	p = search_start ? &search_start : &root->rb_node;  in tree_insert()
346 		entry = rb_entry(parent, struct tree_entry, rb_node);  in tree_insert()
380 static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset,  in __etree_search()
381 				      struct rb_node **next_ret,  in __etree_search()
382 				      struct rb_node **prev_ret,  in __etree_search()
383 				      struct rb_node ***p_ret,  in __etree_search()
384 				      struct rb_node **parent_ret)  in __etree_search()
387 	struct rb_node **n = &root->rb_node;  in __etree_search()
388 	struct rb_node *prev = NULL;  in __etree_search()
389 	struct rb_node *orig_prev = NULL;  in __etree_search()
395 		entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
415 			prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
422 		prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
425 			prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
432 static inline struct rb_node *
435 		       struct rb_node ***p_ret,  in tree_search_for_insert()
436 		       struct rb_node **parent_ret)  in tree_search_for_insert()
438 	struct rb_node *next= NULL;  in tree_search_for_insert()
439 	struct rb_node *ret;  in tree_search_for_insert()
447 static inline struct rb_node *tree_search(struct extent_io_tree *tree,  in tree_search()
466 	struct rb_node *other_node;  in merge_state()
471 	other_node = rb_prev(&state->rb_node);  in merge_state()
473 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
481 			rb_erase(&other->rb_node, &tree->state);  in merge_state()
482 			RB_CLEAR_NODE(&other->rb_node);  in merge_state()
486 	other_node = rb_next(&state->rb_node);  in merge_state()
488 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
496 			rb_erase(&other->rb_node, &tree->state);  in merge_state()
497 			RB_CLEAR_NODE(&other->rb_node);  in merge_state()
519 			struct rb_node ***p,  in insert_state()
520 			struct rb_node **parent,  in insert_state()
523 	struct rb_node *node;  in insert_state()
535 	node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent);  in insert_state()
538 		found = rb_entry(node, struct extent_state, rb_node);  in insert_state()
565 	struct rb_node *node;  in split_state()
575 	node = tree_insert(&tree->state, &orig->rb_node, prealloc->end,  in split_state()
576 			   &prealloc->rb_node, NULL, NULL);  in split_state()
586 	struct rb_node *next = rb_next(&state->rb_node);  in next_state()
588 		return rb_entry(next, struct extent_state, rb_node);  in next_state()
626 			rb_erase(&state->rb_node, &tree->state);  in clear_state_bit()
627 			RB_CLEAR_NODE(&state->rb_node);  in clear_state_bit()
674 	struct rb_node *node;  in __clear_extent_bit()
728 	state = rb_entry(node, struct extent_state, rb_node);  in __clear_extent_bit()
843 	struct rb_node *node;  in wait_extent_bit()
859 		state = rb_entry(node, struct extent_state, rb_node);  in wait_extent_bit()
942 	struct rb_node *node;  in __set_extent_bit()
943 	struct rb_node **p;  in __set_extent_bit()
944 	struct rb_node *parent;  in __set_extent_bit()
969 			node = &state->rb_node;  in __set_extent_bit()
990 	state = rb_entry(node, struct extent_state, rb_node);  in __set_extent_bit()
1174 	struct rb_node *node;  in convert_extent_bit()
1175 	struct rb_node **p;  in convert_extent_bit()
1176 	struct rb_node *parent;  in convert_extent_bit()
1205 			node = &state->rb_node;  in convert_extent_bit()
1229 	state = rb_entry(node, struct extent_state, rb_node);  in convert_extent_bit()
1491 	struct rb_node *node;  in find_first_extent_bit_state()
1503 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_extent_bit_state()
1577 	struct rb_node *node, *prev = NULL, *next;  in find_first_clear_extent_bit()
1597 			state = rb_entry(prev, struct extent_state, rb_node);  in find_first_clear_extent_bit()
1608 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_clear_extent_bit()
1645 						 rb_node);  in find_first_clear_extent_bit()
1659 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_clear_extent_bit()
1685 	struct rb_node *node;  in find_delalloc_range()
1704 		state = rb_entry(node, struct extent_state, rb_node);  in find_delalloc_range()
1965 	struct rb_node *node;  in count_range_bits()
1989 		state = rb_entry(node, struct extent_state, rb_node);  in count_range_bits()
2023 	struct rb_node *node;  in set_state_failrec()
2037 	state = rb_entry(node, struct extent_state, rb_node);  in set_state_failrec()
2051 	struct rb_node *node;  in get_state_failrec()
2065 	state = rb_entry(node, struct extent_state, rb_node);  in get_state_failrec()
2086 	struct rb_node *node;  in test_range_bit()
2092 		node = &cached->rb_node;  in test_range_bit()
2096 		state = rb_entry(node, struct extent_state, rb_node);  in test_range_bit()