37 	struct rb_entry *re;  in __lookup_rb_tree_slow()  local
40 		re = rb_entry(node, struct rb_entry, rb_node);  in __lookup_rb_tree_slow()
42 		if (ofs < re->ofs)  in __lookup_rb_tree_slow()
44 		else if (ofs >= re->ofs + re->len)  in __lookup_rb_tree_slow()
47 			return re;  in __lookup_rb_tree_slow()
55 	struct rb_entry *re;  in f2fs_lookup_rb_tree()  local
57 	re = __lookup_rb_tree_fast(cached_re, ofs);  in f2fs_lookup_rb_tree()
58 	if (!re)  in f2fs_lookup_rb_tree()
61 	return re;  in f2fs_lookup_rb_tree()
69 	struct rb_entry *re;  in f2fs_lookup_rb_tree_for_insert()  local
73 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_for_insert()
75 		if (ofs < re->ofs)  in f2fs_lookup_rb_tree_for_insert()
77 		else if (ofs >= re->ofs + re->len)  in f2fs_lookup_rb_tree_for_insert()
106 	struct rb_entry *re = cached_re;  in f2fs_lookup_rb_tree_ret()  local
116 	if (re) {  in f2fs_lookup_rb_tree_ret()
117 		if (re->ofs <= ofs && re->ofs + re->len > ofs)  in f2fs_lookup_rb_tree_ret()
123 		re = rb_entry(*pnode, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
125 		if (ofs < re->ofs)  in f2fs_lookup_rb_tree_ret()
127 		else if (ofs >= re->ofs + re->len)  in f2fs_lookup_rb_tree_ret()
136 	re = rb_entry(parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
138 	if (parent && ofs > re->ofs)  in f2fs_lookup_rb_tree_ret()
143 	if (parent && ofs < re->ofs)  in f2fs_lookup_rb_tree_ret()
149 	if (ofs == re->ofs || force) {  in f2fs_lookup_rb_tree_ret()
151 		tmp_node = rb_prev(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
154 	if (ofs == re->ofs + re->len - 1 || force) {  in f2fs_lookup_rb_tree_ret()
156 		tmp_node = rb_next(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
159 	return re;  in f2fs_lookup_rb_tree_ret()