22 							unsigned int ofs)  in __lookup_rb_tree_fast()  argument
25 		if (cached_re->ofs <= ofs &&  in __lookup_rb_tree_fast()
26 				cached_re->ofs + cached_re->len > ofs) {  in __lookup_rb_tree_fast()
34 							unsigned int ofs)  in __lookup_rb_tree_slow()  argument
42 		if (ofs < re->ofs)  in __lookup_rb_tree_slow()
44 		else if (ofs >= re->ofs + re->len)  in __lookup_rb_tree_slow()
53 				struct rb_entry *cached_re, unsigned int ofs)  in f2fs_lookup_rb_tree()  argument
57 	re = __lookup_rb_tree_fast(cached_re, ofs);  in f2fs_lookup_rb_tree()
59 		return __lookup_rb_tree_slow(root, ofs);  in f2fs_lookup_rb_tree()
66 				unsigned int ofs)  in f2fs_lookup_rb_tree_for_insert()  argument
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()
97 				unsigned int ofs,  in f2fs_lookup_rb_tree_ret()  argument
117 		if (re->ofs <= ofs && re->ofs + re->len > ofs)  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()
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()
154 	if (ofs == re->ofs + re->len - 1 || force) {  in f2fs_lookup_rb_tree_ret()
180 		if (cur_re->ofs + cur_re->len > next_re->ofs) {  in f2fs_check_rb_tree_consistence()
183 				cur_re->ofs, cur_re->len,  in f2fs_check_rb_tree_consistence()
184 				next_re->ofs, next_re->len);  in f2fs_check_rb_tree_consistence()