19 							unsigned int ofs)  in __lookup_rb_tree_fast()  argument
22 		if (cached_re->ofs <= ofs &&  in __lookup_rb_tree_fast()
23 				cached_re->ofs + cached_re->len > ofs) {  in __lookup_rb_tree_fast()
31 							unsigned int ofs)  in __lookup_rb_tree_slow()  argument
39 		if (ofs < re->ofs)  in __lookup_rb_tree_slow()
41 		else if (ofs >= re->ofs + re->len)  in __lookup_rb_tree_slow()
50 				struct rb_entry *cached_re, unsigned int ofs)  in f2fs_lookup_rb_tree()  argument
54 	re = __lookup_rb_tree_fast(cached_re, ofs);  in f2fs_lookup_rb_tree()
56 		return __lookup_rb_tree_slow(root, ofs);  in f2fs_lookup_rb_tree()
87 				unsigned int ofs, bool *leftmost)  in f2fs_lookup_rb_tree_for_insert()  argument
96 		if (ofs < re->ofs) {  in f2fs_lookup_rb_tree_for_insert()
98 		} else if (ofs >= re->ofs + re->len) {  in f2fs_lookup_rb_tree_for_insert()
120 				unsigned int ofs,  in f2fs_lookup_rb_tree_ret()  argument
140 		if (re->ofs <= ofs && re->ofs + re->len > ofs)  in f2fs_lookup_rb_tree_ret()
151 		if (ofs < re->ofs) {  in f2fs_lookup_rb_tree_ret()
153 		} else if (ofs >= re->ofs + re->len) {  in f2fs_lookup_rb_tree_ret()
167 	if (parent && ofs > re->ofs)  in f2fs_lookup_rb_tree_ret()
172 	if (parent && ofs < re->ofs)  in f2fs_lookup_rb_tree_ret()
178 	if (ofs == re->ofs || force) {  in f2fs_lookup_rb_tree_ret()
183 	if (ofs == re->ofs + re->len - 1 || force) {  in f2fs_lookup_rb_tree_ret()
219 		if (cur_re->ofs + cur_re->len > next_re->ofs) {  in f2fs_check_rb_tree_consistence()
221 				  cur_re->ofs, cur_re->len,  in f2fs_check_rb_tree_consistence()
222 				  next_re->ofs, next_re->len);  in f2fs_check_rb_tree_consistence()