bcache: Make bch_keylist_realloc() take u64s, not nptrs
Getting away from KEY_PTRS and moving toward KEY_U64s - and getting rid of magic 2s Also - split out the part that checks against journal entry size so as to avoid a dependancy on struct cache_set in bset.c Signed-off-by: Kent Overstreet <kmo@daterainc.com>
This commit is contained in:
@@ -1356,8 +1356,8 @@ static int btree_gc_coalesce(struct btree *b, struct btree_op *op,
|
||||
|
||||
n2->keys -= keys;
|
||||
|
||||
if (bch_keylist_realloc(keylist,
|
||||
KEY_PTRS(&new_nodes[i]->key), b->c))
|
||||
if (__bch_keylist_realloc(keylist,
|
||||
bkey_u64s(&new_nodes[i]->key)))
|
||||
goto out_nocoalesce;
|
||||
|
||||
bch_btree_node_write(new_nodes[i], &cl);
|
||||
@@ -1365,7 +1365,7 @@ static int btree_gc_coalesce(struct btree *b, struct btree_op *op,
|
||||
}
|
||||
|
||||
for (i = 0; i < nodes; i++) {
|
||||
if (bch_keylist_realloc(keylist, KEY_PTRS(&r[i].b->key), b->c))
|
||||
if (__bch_keylist_realloc(keylist, bkey_u64s(&r[i].b->key)))
|
||||
goto out_nocoalesce;
|
||||
|
||||
make_btree_freeing_key(r[i].b, keylist->top);
|
||||
|
Reference in New Issue
Block a user