Lines Matching refs:re
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_ext() local
71 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ext()
73 if (key < re->key) { in f2fs_lookup_rb_tree_ext()
90 struct rb_entry *re; in f2fs_lookup_rb_tree_for_insert() local
94 re = rb_entry(*parent, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_for_insert()
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()
129 struct rb_entry *re = cached_re; in f2fs_lookup_rb_tree_ret() local
139 if (re) { in f2fs_lookup_rb_tree_ret()
140 if (re->ofs <= ofs && re->ofs + re->len > ofs) in f2fs_lookup_rb_tree_ret()
149 re = rb_entry(*pnode, struct rb_entry, rb_node); 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()
165 re = rb_entry(parent, struct rb_entry, rb_node); 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()
180 tmp_node = rb_prev(&re->rb_node); in f2fs_lookup_rb_tree_ret()
183 if (ofs == re->ofs + re->len - 1 || force) { in f2fs_lookup_rb_tree_ret()
185 tmp_node = rb_next(&re->rb_node); in f2fs_lookup_rb_tree_ret()
188 return re; in f2fs_lookup_rb_tree_ret()