Home
last modified time | relevance | path

Searched refs:ref2 (Results 1 – 5 of 5) sorted by relevance

/fs/jffs2/
A Ddebug.c316 struct jffs2_raw_node_ref *ref2 = jeb->first_node; in __jffs2_dbg_acct_paranoia_check_nolock() local
318 while (ref2) { in __jffs2_dbg_acct_paranoia_check_nolock()
319 uint32_t totlen = ref_totlen(c, jeb, ref2); in __jffs2_dbg_acct_paranoia_check_nolock()
321 if (ref_offset(ref2) < jeb->offset || in __jffs2_dbg_acct_paranoia_check_nolock()
322 ref_offset(ref2) > jeb->offset + c->sector_size) { in __jffs2_dbg_acct_paranoia_check_nolock()
324 ref_offset(ref2), jeb->offset); in __jffs2_dbg_acct_paranoia_check_nolock()
328 if (ref_flags(ref2) == REF_UNCHECKED) in __jffs2_dbg_acct_paranoia_check_nolock()
330 else if (!ref_obsolete(ref2)) in __jffs2_dbg_acct_paranoia_check_nolock()
335 if ((!ref_next(ref2)) != (ref2 == jeb->last_node)) { in __jffs2_dbg_acct_paranoia_check_nolock()
337 ref_offset(ref2), ref2, ref_offset(ref_next(ref2)), ref_next(ref2), in __jffs2_dbg_acct_paranoia_check_nolock()
[all …]
/fs/btrfs/
A Ddelayed-ref.c272 const struct btrfs_delayed_ref_node *ref2) in comp_data_refs() argument
286 const struct btrfs_delayed_ref_node *ref2, in comp_refs() argument
291 if (ref1->type < ref2->type) in comp_refs()
293 if (ref1->type > ref2->type) in comp_refs()
297 if (ref1->parent < ref2->parent) in comp_refs()
299 if (ref1->parent > ref2->parent) in comp_refs()
302 if (ref1->ref_root < ref2->ref_root) in comp_refs()
304 if (ref1->ref_root > ref2->ref_root) in comp_refs()
307 ret = comp_data_refs(ref1, ref2); in comp_refs()
312 if (ref1->seq < ref2->seq) in comp_refs()
[all …]
A Dref-verify.c144 static int comp_refs(struct ref_entry *ref1, struct ref_entry *ref2) in comp_refs() argument
146 if (ref1->root_objectid < ref2->root_objectid) in comp_refs()
148 if (ref1->root_objectid > ref2->root_objectid) in comp_refs()
150 if (ref1->parent < ref2->parent) in comp_refs()
152 if (ref1->parent > ref2->parent) in comp_refs()
154 if (ref1->owner < ref2->owner) in comp_refs()
156 if (ref1->owner > ref2->owner) in comp_refs()
158 if (ref1->offset < ref2->offset) in comp_refs()
160 if (ref1->offset > ref2->offset) in comp_refs()
A Dbackref.c223 const struct prelim_ref *ref2) in prelim_ref_compare() argument
225 if (ref1->level < ref2->level) in prelim_ref_compare()
227 if (ref1->level > ref2->level) in prelim_ref_compare()
229 if (ref1->root_id < ref2->root_id) in prelim_ref_compare()
231 if (ref1->root_id > ref2->root_id) in prelim_ref_compare()
233 if (ref1->key_for_search.type < ref2->key_for_search.type) in prelim_ref_compare()
235 if (ref1->key_for_search.type > ref2->key_for_search.type) in prelim_ref_compare()
241 if (ref1->key_for_search.offset < ref2->key_for_search.offset) in prelim_ref_compare()
243 if (ref1->key_for_search.offset > ref2->key_for_search.offset) in prelim_ref_compare()
245 if (ref1->parent < ref2->parent) in prelim_ref_compare()
[all …]
A Dextent-tree.c582 struct btrfs_shared_data_ref *ref2 = NULL; in remove_extent_data_ref() local
595 ref2 = btrfs_item_ptr(leaf, path->slots[0], in remove_extent_data_ref()
597 num_refs = btrfs_shared_data_ref_count(leaf, ref2); in remove_extent_data_ref()
615 btrfs_set_shared_data_ref_count(leaf, ref2, num_refs); in remove_extent_data_ref()
626 const struct btrfs_shared_data_ref *ref2; in extent_data_ref_count() local
644 ref2 = (const struct btrfs_shared_data_ref *)(iref + 1); in extent_data_ref_count()
645 num_refs = btrfs_shared_data_ref_count(leaf, ref2); in extent_data_ref_count()
652 ref2 = btrfs_item_ptr(leaf, path->slots[0], in extent_data_ref_count()
654 num_refs = btrfs_shared_data_ref_count(leaf, ref2); in extent_data_ref_count()

Completed in 590 milliseconds