257 		entry = rb_entry(parent, struct tree_entry, rb_node);  in tree_insert()
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()
374 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
386 		other = rb_entry(other_node, struct extent_state, rb_node);  in merge_state()
444 		found = rb_entry(node, struct extent_state, rb_node);  in insert_state()
500 		return rb_entry(next, struct extent_state, rb_node);  in next_state()
634 	state = rb_entry(node, struct extent_state, rb_node);  in clear_extent_bit()
764 		state = rb_entry(node, struct extent_state, rb_node);  in wait_extent_bit()
884 	state = rb_entry(node, struct extent_state, rb_node);  in __set_extent_bit()
1121 	state = rb_entry(node, struct extent_state, rb_node);  in convert_extent_bit()
1458 		state = rb_entry(node, struct extent_state, rb_node);  in find_first_extent_bit_state()
1491 				state = rb_entry(n, struct extent_state,  in find_first_extent_bit()
1548 		state = rb_entry(node, struct extent_state, rb_node);  in find_delalloc_range()
1840 		state = rb_entry(node, struct extent_state, rb_node);  in count_range_bits()
1887 	state = rb_entry(node, struct extent_state, rb_node);  in set_state_private()
1914 	state = rb_entry(node, struct extent_state, rb_node);  in get_state_private()
1945 		state = rb_entry(node, struct extent_state, rb_node);  in test_range_bit()