Home
last modified time | relevance | path

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

/drivers/md/bcache/
Drequest.c66 journal_ref = bch_journal(op->c, &op->insert_keys, in bch_data_insert_keys()
69 ret = bch_btree_insert(op->c, &op->insert_keys, in bch_data_insert_keys()
86 bch_keylist_free(&op->insert_keys); in bch_data_insert_keys()
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 bch_data_insert_error()
154 while (src != op->insert_keys.top) { in bch_data_insert_error()
164 op->insert_keys.top = dst; in bch_data_insert_error()
210 if (bch_keylist_realloc(&op->insert_keys, in bch_data_insert_start()
217 k = op->insert_keys.top; in bch_data_insert_start()
[all …]
Dbtree.c1331 struct keylist *insert_keys,
2167 struct keylist *insert_keys, in bch_btree_insert_keys() argument
2173 while (!bch_keylist_empty(insert_keys)) { in bch_btree_insert_keys()
2174 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
2184 bch_keylist_pop_front(insert_keys); in bch_btree_insert_keys()
2187 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
2190 bch_cut_front(&b->key, insert_keys->keys); in bch_btree_insert_keys()
2202 BUG_ON(!bch_keylist_empty(insert_keys) && b->level); in bch_btree_insert_keys()
2209 struct keylist *insert_keys, in btree_split() argument
2253 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
[all …]
Drequest.h32 struct keylist insert_keys; member