Searched refs:vstruct_last (Results 1 – 10 of 10) sorted by relevance
45 #define vstruct_last(_s) \ macro52 _i < vstruct_last(_s); \57 _i < vstruct_last(_s) && (_next = vstruct_next(_i), true); \
41 while (entry < vstruct_last(jset)) { in __jset_entry_type_next()58 _k < vstruct_last(_e); \
105 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) in set_needs_whiteout()684 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) in bch2_btree_node_drop_keys_outside_node()697 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) in bch2_btree_node_drop_keys_outside_node()701 if (k != vstruct_last(i)) { in bch2_btree_node_drop_keys_outside_node()907 if (bkey_p_next(k) > vstruct_last(i)) in bkey_packed_valid()948 k != vstruct_last(i);) { in validate_bset_keys()953 if (btree_err_on(bkey_p_next(k) > vstruct_last(i), in validate_bset_keys()1028 next_good_key < (u64 *) vstruct_last(i) - (u64 *) k; in validate_bset_keys()1038 next_good_key = (u64 *) vstruct_last(i) - (u64 *) k; in validate_bset_keys()1252 vstruct_last(i)); in bch2_btree_node_read_done()[all …]
129 struct bkey_packed *in, *out = vstruct_last(dst); in bch2_sort_repack()
714 __btree_node_ptr_to_offset(b, vstruct_last(bset(b, t))); in set_btree_bset_end()762 vstruct_last(bset(_b, _t))); \
68 end = vstruct_last(j); in btree_root_find()
160 for (k = inmemory->start; k != vstruct_last(inmemory); k = bkey_p_next(k)) in __bch2_btree_verify()290 for (k = i->start; k != vstruct_last(i); k = bkey_p_next(k)) { in bch2_btree_node_ondisk_to_text()
67 _k < vstruct_last(i); in bch2_dump_bset()87 if (_n == vstruct_last(i)) in bch2_dump_bset()
416 while (k != vstruct_last(entry)) { in journal_entry_btree_keys_validate()905 if (journal_entry_err_on(vstruct_next(entry) > vstruct_last(jset), in jset_validate_entries()2013 start = end = vstruct_last(jset); in bch2_journal_write_prep()
137 f = vstruct_last(sb->sb); in __bch2_sb_field_resize()535 if (vstruct_next(f) > vstruct_last(sb)) { in bch2_sb_validate()
Completed in 768 milliseconds