276 		entry = rb_entry(parent, struct tree_entry, rb_node);  in tree_insert()
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()
393 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
405 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
464 		found = rb_entry(node, struct extent_state, rb_node);  in insert_state()
520 		return rb_entry(next, struct extent_state, rb_node);  in next_state()
656 	state = rb_entry(node, struct extent_state, rb_node);  in __clear_extent_bit()
787 		state = rb_entry(node, struct extent_state, rb_node);  in wait_extent_bit()
908 	state = rb_entry(node, struct extent_state, rb_node);  in __set_extent_bit()
1145 	state = rb_entry(node, struct extent_state, rb_node);  in convert_extent_bit()
1526 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_extent_bit_state()
1559 				state = rb_entry(n, struct extent_state,  in find_first_extent_bit()
1616 		state = rb_entry(node, struct extent_state, rb_node);  in find_delalloc_range()
1908 		state = rb_entry(node, struct extent_state, rb_node);  in count_range_bits()
1955 	state = rb_entry(node, struct extent_state, rb_node);  in set_state_private()
1982 	state = rb_entry(node, struct extent_state, rb_node);  in get_state_private()
2013 		state = rb_entry(node, struct extent_state, rb_node);  in test_range_bit()