cached_re          18 fs/f2fs/extent_cache.c static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re,
cached_re          21 fs/f2fs/extent_cache.c 	if (cached_re) {
cached_re          22 fs/f2fs/extent_cache.c 		if (cached_re->ofs <= ofs &&
cached_re          23 fs/f2fs/extent_cache.c 				cached_re->ofs + cached_re->len > ofs) {
cached_re          24 fs/f2fs/extent_cache.c 			return cached_re;
cached_re          50 fs/f2fs/extent_cache.c 				struct rb_entry *cached_re, unsigned int ofs)
cached_re          54 fs/f2fs/extent_cache.c 	re = __lookup_rb_tree_fast(cached_re, ofs);
cached_re          96 fs/f2fs/extent_cache.c 				struct rb_entry *cached_re,
cached_re         106 fs/f2fs/extent_cache.c 	struct rb_entry *re = cached_re;
cached_re        3532 fs/f2fs/f2fs.h 				struct rb_entry *cached_re, unsigned int ofs);
cached_re        3538 fs/f2fs/f2fs.h 		struct rb_entry *cached_re, unsigned int ofs,