34 	struct rb_entry *re;  in __lookup_rb_tree_slow()  local
37 		re = rb_entry(node, struct rb_entry, rb_node);  in __lookup_rb_tree_slow()
39 		if (ofs < re->ofs)  in __lookup_rb_tree_slow()
41 		else if (ofs >= re->ofs + re->len)  in __lookup_rb_tree_slow()
44 			return re;  in __lookup_rb_tree_slow()
52 	struct rb_entry *re;  in f2fs_lookup_rb_tree()  local
54 	re = __lookup_rb_tree_fast(cached_re, ofs);  in f2fs_lookup_rb_tree()
55 	if (!re)  in f2fs_lookup_rb_tree()
58 	return re;  in f2fs_lookup_rb_tree()
67 	struct rb_entry *re;  in f2fs_lookup_rb_tree_for_insert()  local
71 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_for_insert()
73 		if (ofs < re->ofs) {  in f2fs_lookup_rb_tree_for_insert()
75 		} 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()
126 		re = rb_entry(*pnode, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
128 		if (ofs < re->ofs) {  in f2fs_lookup_rb_tree_ret()
130 		} else if (ofs >= re->ofs + re->len) {  in f2fs_lookup_rb_tree_ret()
142 	re = rb_entry(parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
144 	if (parent && ofs > re->ofs)  in f2fs_lookup_rb_tree_ret()
149 	if (parent && ofs < re->ofs)  in f2fs_lookup_rb_tree_ret()
155 	if (ofs == re->ofs || force) {  in f2fs_lookup_rb_tree_ret()
157 		tmp_node = rb_prev(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
160 	if (ofs == re->ofs + re->len - 1 || force) {  in f2fs_lookup_rb_tree_ret()
162 		tmp_node = rb_next(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
165 	return re;  in f2fs_lookup_rb_tree_ret()