Lines Matching refs:insert_keys
1363 struct keylist *insert_keys,
2034 struct keylist *insert_keys, in bch_btree_insert_keys() argument
2040 while (!bch_keylist_empty(insert_keys)) { in bch_btree_insert_keys()
2041 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
2051 bch_keylist_pop_front(insert_keys); in bch_btree_insert_keys()
2054 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
2057 bch_cut_front(&b->key, insert_keys->keys); in bch_btree_insert_keys()
2069 BUG_ON(!bch_keylist_empty(insert_keys) && b->level); in bch_btree_insert_keys()
2076 struct keylist *insert_keys, in btree_split() argument
2120 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2152 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2210 struct keylist *insert_keys, in bch_btree_insert_node() argument
2226 if (bch_keylist_nkeys(insert_keys) > insert_u64s_remaining(b)) { in bch_btree_insert_node()
2233 if (bch_btree_insert_keys(b, op, insert_keys, replace_key)) { in bch_btree_insert_node()
2255 int ret = btree_split(b, op, insert_keys, replace_key); in bch_btree_insert_node()
2257 if (bch_keylist_empty(insert_keys)) in bch_btree_insert_node()