Home
last modified time | relevance | path

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

/linux-6.15/fs/bcachefs/
H A Dio_write.c369 struct keylist *keys = &op->insert_keys; in bch2_write_index_default()
547 struct keylist *keys = &op->insert_keys; in bch2_write_drop_io_error_ptrs()
577 struct keylist *keys = &op->insert_keys; in __bch2_write_index()
787 bch2_keylist_push(&op->insert_keys); in init_append_extent()
1147 !bch2_keylist_realloc(&op->insert_keys, in bch2_write_extent()
1367 bkey_reassemble(op->insert_keys.top, k); in bch2_nocow_write()
1408 op->insert_keys.top, true); in bch2_nocow_write()
1410 bch2_keylist_push(&op->insert_keys); in bch2_nocow_write()
1435 op->insert_keys.top = op->insert_keys.keys; in bch2_nocow_write()
1497 op->insert_keys.keys_p; in __bch2_write()
[all …]
H A Dio_write_types.h84 struct keylist insert_keys; member
H A Ddata_update.c189 struct keylist *keys = &op->insert_keys; in __bch2_data_update_index_update()
489 bch2_keylist_init(&update->op.insert_keys, update->op.inline_keys); in bch2_update_unwritten_extent()
508 e = bkey_extent_init(update->op.insert_keys.top); in bch2_update_unwritten_extent()
543 bch2_keylist_push(&update->op.insert_keys); in bch2_update_unwritten_extent()
H A Dbtree_update_interior.c1436 static bool key_deleted_in_insert(struct keylist *insert_keys, struct bpos pos) in key_deleted_in_insert() argument
1438 if (insert_keys) in key_deleted_in_insert()
1439 for_each_keylist_key(insert_keys, k) in key_deleted_in_insert()
1453 struct keylist *insert_keys) in __btree_split_node() argument
1489 key_deleted_in_insert(insert_keys, uk.p))) in __btree_split_node()
/linux-6.15/drivers/md/bcache/
H A Drequest.c69 ret = bch_btree_insert(op->c, &op->insert_keys, in CLOSURE_CALLBACK()
86 bch_keylist_free(&op->insert_keys); in CLOSURE_CALLBACK()
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()
245 bch_keylist_push(&op->insert_keys); in CLOSURE_CALLBACK()
281 if (!bch_keylist_empty(&op->insert_keys)) in CLOSURE_CALLBACK()
[all …]
H A Drequest.h32 struct keylist insert_keys; member
H A Dbtree.c1359 struct keylist *insert_keys,
2209 struct keylist *insert_keys, in bch_btree_insert_keys() argument
2215 while (!bch_keylist_empty(insert_keys)) { in bch_btree_insert_keys()
2216 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
2226 bch_keylist_pop_front(insert_keys); in bch_btree_insert_keys()
2229 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
2232 bch_cut_front(&b->key, insert_keys->keys); in bch_btree_insert_keys()
2244 BUG_ON(!bch_keylist_empty(insert_keys) && b->level); in bch_btree_insert_keys()
2251 struct keylist *insert_keys, in btree_split() argument
2385 struct keylist *insert_keys, in bch_btree_insert_node() argument
[all …]