Home
last modified time | relevance | path

Searched refs:insert_keys (Results 1 – 6 of 6) sorted by relevance

/linux/drivers/md/bcache/
H A Drequest.c66 journal_ref = bch_journal(op->c, &op->insert_keys, in CLOSURE_CALLBACK()
69 ret = bch_btree_insert(op->c, &op->insert_keys, in CLOSURE_CALLBACK()
86 bch_keylist_free(&op->insert_keys); in CLOSURE_CALLBACK()
120 if (bch_keylist_realloc(&op->insert_keys, 2, op->c)) in bch_data_invalidate()
126 bch_keylist_add(&op->insert_keys, in bch_data_invalidate()
152 struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys; in CLOSURE_CALLBACK()
154 while (src != op->insert_keys.top) { in CLOSURE_CALLBACK()
164 op->insert_keys.top = dst; in CLOSURE_CALLBACK()
210 if (bch_keylist_realloc(&op->insert_keys, in CLOSURE_CALLBACK()
217 k = op->insert_keys.top; in CLOSURE_CALLBACK()
[all …]
H A Drequest.h32 struct keylist insert_keys; member
H A Dbtree.c1354 struct keylist *insert_keys,
2196 struct keylist *insert_keys, in bch_btree_insert_keys() argument
2202 while (!bch_keylist_empty(insert_keys)) { in bch_btree_insert_keys()
2203 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
2213 bch_keylist_pop_front(insert_keys); in bch_btree_insert_keys()
2216 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
2219 bch_cut_front(&b->key, insert_keys->keys); in bch_btree_insert_keys()
2231 BUG_ON(!bch_keylist_empty(insert_keys) && b->level); in bch_btree_insert_keys()
2238 struct keylist *insert_keys, in btree_split() argument
2282 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
[all …]
/linux/fs/bcachefs/
H A Ddata_update.c271 bkey_start_pos(&bch2_keylist_front(&op->insert_keys)->k), in __bch2_data_update_index_update()
296 new = bkey_i_to_extent(bch2_keylist_front(&op->insert_keys)); in __bch2_data_update_index_update()
319 bkey_copy(&new->k_i, bch2_keylist_front(&op->insert_keys)); in __bch2_data_update_index_update()
475 while (bkey_ge(iter.pos, bch2_keylist_front(&op->insert_keys)->k.p)) { in __bch2_data_update_index_update()
476 bch2_keylist_pop_front(&op->insert_keys); in __bch2_data_update_index_update()
477 if (bch2_keylist_empty(&op->insert_keys)) in __bch2_data_update_index_update()
549 bch2_keylist_init(&update->op.insert_keys, update->op.inline_keys); in bch2_update_unwritten_extent()
568 e = bkey_extent_init(update->op.insert_keys.top); in bch2_update_unwritten_extent()
603 bch2_keylist_push(&update->op.insert_keys); in bch2_update_unwritten_extent()
H A Dio_write_types.h116 struct keylist insert_keys; member
H A Dbtree_update_interior.c1478 static bool key_deleted_in_insert(struct keylist *insert_keys, struct bpos pos) in key_deleted_in_insert() argument
1480 if (insert_keys) in key_deleted_in_insert()
1481 for_each_keylist_key(insert_keys, k) in key_deleted_in_insert()
1495 struct keylist *insert_keys) in __btree_split_node() argument
1531 key_deleted_in_insert(insert_keys, uk.p))) in __btree_split_node()