30 	return !RB_EMPTY_NODE(&state->rb_node);  in extent_state_in_tree()
116 	struct rb_node rb_node;  member
217 	RB_CLEAR_NODE(&state->rb_node);  in alloc_extent_state()
237 static struct rb_node *tree_insert(struct rb_root *root,  in tree_insert()
238 				   struct rb_node *search_start,  in tree_insert()
240 				   struct rb_node *node,  in tree_insert()
241 				   struct rb_node ***p_in,  in tree_insert()
242 				   struct rb_node **parent_in)  in tree_insert()
244 	struct rb_node **p;  in tree_insert()
245 	struct rb_node *parent = NULL;  in tree_insert()
254 	p = search_start ? &search_start : &root->rb_node;  in tree_insert()
257 		entry = rb_entry(parent, struct tree_entry, rb_node);  in tree_insert()
273 static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset,  in __etree_search()
274 				      struct rb_node **prev_ret,  in __etree_search()
275 				      struct rb_node **next_ret,  in __etree_search()
276 				      struct rb_node ***p_ret,  in __etree_search()
277 				      struct rb_node **parent_ret)  in __etree_search()
280 	struct rb_node **n = &root->rb_node;  in __etree_search()
281 	struct rb_node *prev = NULL;  in __etree_search()
282 	struct rb_node *orig_prev = NULL;  in __etree_search()
288 		entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
308 			prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
315 		prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
318 			prev_entry = rb_entry(prev, struct tree_entry, rb_node);  in __etree_search()
325 static inline struct rb_node *
328 		       struct rb_node ***p_ret,  in tree_search_for_insert()
329 		       struct rb_node **parent_ret)  in tree_search_for_insert()
331 	struct rb_node *prev = NULL;  in tree_search_for_insert()
332 	struct rb_node *ret;  in tree_search_for_insert()
340 static inline struct rb_node *tree_search(struct extent_io_tree *tree,  in tree_search()
367 	struct rb_node *other_node;  in merge_state()
372 	other_node = rb_prev(&state->rb_node);  in merge_state()
374 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
379 			rb_erase(&other->rb_node, &tree->state);  in merge_state()
380 			RB_CLEAR_NODE(&other->rb_node);  in merge_state()
384 	other_node = rb_next(&state->rb_node);  in merge_state()
386 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
391 			rb_erase(&other->rb_node, &tree->state);  in merge_state()
392 			RB_CLEAR_NODE(&other->rb_node);  in merge_state()
427 			struct rb_node ***p,  in insert_state()
428 			struct rb_node **parent,  in insert_state()
431 	struct rb_node *node;  in insert_state()
441 	node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent);  in insert_state()
444 		found = rb_entry(node, struct extent_state, rb_node);  in insert_state()
478 	struct rb_node *node;  in split_state()
487 	node = tree_insert(&tree->state, &orig->rb_node, prealloc->end,  in split_state()
488 			   &prealloc->rb_node, NULL, NULL);  in split_state()
498 	struct rb_node *next = rb_next(&state->rb_node);  in next_state()
500 		return rb_entry(next, struct extent_state, rb_node);  in next_state()
531 			rb_erase(&state->rb_node, &tree->state);  in clear_state_bit()
532 			RB_CLEAR_NODE(&state->rb_node);  in clear_state_bit()
580 	struct rb_node *node;  in clear_extent_bit()
634 	state = rb_entry(node, struct extent_state, rb_node);  in clear_extent_bit()
748 	struct rb_node *node;  in wait_extent_bit()
764 		state = rb_entry(node, struct extent_state, rb_node);  in wait_extent_bit()
842 	struct rb_node *node;  in __set_extent_bit()
843 	struct rb_node **p;  in __set_extent_bit()
844 	struct rb_node *parent;  in __set_extent_bit()
863 			node = &state->rb_node;  in __set_extent_bit()
884 	state = rb_entry(node, struct extent_state, rb_node);  in __set_extent_bit()
1068 	struct rb_node *node;  in convert_extent_bit()
1069 	struct rb_node **p;  in convert_extent_bit()
1070 	struct rb_node *parent;  in convert_extent_bit()
1097 			node = &state->rb_node;  in convert_extent_bit()
1121 	state = rb_entry(node, struct extent_state, rb_node);  in convert_extent_bit()
1446 	struct rb_node *node;  in find_first_extent_bit_state()
1458 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_extent_bit_state()
1482 	struct rb_node *n;  in find_first_extent_bit()
1489 			n = rb_next(&state->rb_node);  in find_first_extent_bit()
1492 						 rb_node);  in find_first_extent_bit()
1528 	struct rb_node *node;  in find_delalloc_range()
1548 		state = rb_entry(node, struct extent_state, rb_node);  in find_delalloc_range()
1816 	struct rb_node *node;  in count_range_bits()
1840 		state = rb_entry(node, struct extent_state, rb_node);  in count_range_bits()
1873 	struct rb_node *node;  in set_state_private()
1887 	state = rb_entry(node, struct extent_state, rb_node);  in set_state_private()
1900 	struct rb_node *node;  in get_state_private()
1914 	state = rb_entry(node, struct extent_state, rb_node);  in get_state_private()
1935 	struct rb_node *node;  in test_range_bit()
1941 		node = &cached->rb_node;  in test_range_bit()
1945 		state = rb_entry(node, struct extent_state, rb_node);  in test_range_bit()