Lines Matching refs:rb_entry
18 static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re,
30 static struct rb_entry *__lookup_rb_tree_slow(struct rb_root_cached *root,
34 struct rb_entry *re;
37 re = rb_entry(node, struct rb_entry, rb_node);
49 struct rb_entry *f2fs_lookup_rb_tree(struct rb_root_cached *root,
50 struct rb_entry *cached_re, unsigned int ofs)
52 struct rb_entry *re;
67 struct rb_entry *re;
71 re = rb_entry(*parent, struct rb_entry, rb_node);
90 struct rb_entry *re;
94 re = rb_entry(*parent, struct rb_entry, rb_node);
118 struct rb_entry *f2fs_lookup_rb_tree_ret(struct rb_root_cached *root,
119 struct rb_entry *cached_re,
121 struct rb_entry **prev_entry,
122 struct rb_entry **next_entry,
129 struct rb_entry *re = cached_re;
149 re = rb_entry(*pnode, struct rb_entry, rb_node);
165 re = rb_entry(parent, struct rb_entry, rb_node);
169 *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
174 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
181 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
186 *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
196 struct rb_entry *cur_re, *next_re;
206 cur_re = rb_entry(cur, struct rb_entry, rb_node);
207 next_re = rb_entry(next, struct rb_entry, rb_node);
342 en = rb_entry(node, struct extent_node, rb_node);
433 (struct rb_entry *)et->cached_en, pgofs);
567 (struct rb_entry *)et->cached_en, fofs,
568 (struct rb_entry **)&prev_en,
569 (struct rb_entry **)&next_en,