Lines Matching refs:insert_keys
1919 struct keylist *insert_keys, in bch_btree_insert_keys() argument
1925 while (!bch_keylist_empty(insert_keys)) { in bch_btree_insert_keys()
1926 struct bkey *k = insert_keys->keys; in bch_btree_insert_keys()
1936 bch_keylist_pop_front(insert_keys); in bch_btree_insert_keys()
1939 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
1942 bch_cut_front(&b->key, insert_keys->keys); in bch_btree_insert_keys()
1954 BUG_ON(!bch_keylist_empty(insert_keys) && b->level); in bch_btree_insert_keys()
1961 struct keylist *insert_keys, in btree_split() argument
2005 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2037 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2095 struct keylist *insert_keys, in bch_btree_insert_node() argument
2111 if (bch_keylist_nkeys(insert_keys) > insert_u64s_remaining(b)) { in bch_btree_insert_node()
2118 if (bch_btree_insert_keys(b, op, insert_keys, replace_key)) { in bch_btree_insert_node()
2140 int ret = btree_split(b, op, insert_keys, replace_key); in bch_btree_insert_node()
2142 if (bch_keylist_empty(insert_keys)) in bch_btree_insert_node()