Searched refs:bch2_keylist_front (Results 1 – 5 of 5) sorted by relevance
36 l->top_p -= bch2_keylist_front(l)->k.u64s; in bch2_keylist_pop_front()
47 static inline struct bkey_i *bch2_keylist_front(struct keylist *l) in bch2_keylist_front() function
181 bkey_start_pos(&bch2_keylist_front(keys)->k), in __bch2_data_update_index_update()206 new = bkey_i_to_extent(bch2_keylist_front(keys)); in __bch2_data_update_index_update()217 bch2_bkey_buf_copy(&_new, c, bch2_keylist_front(keys)); in __bch2_data_update_index_update()385 while (bkey_ge(iter.pos, bch2_keylist_front(keys)->k.p)) { in __bch2_data_update_index_update()
342 struct bkey_i *k = bch2_keylist_front(keys); in bch2_write_index_default()358 k = bch2_keylist_front(keys); in bch2_write_index_default()535 struct bkey_i *insert = bch2_keylist_front(&op->insert_keys); in __bch2_write_index()1176 struct bkey_i *insert = bch2_keylist_front(&op->insert_keys); in bch2_nocow_write_convert_unwritten()
1412 struct bkey_i *insert = bch2_keylist_front(keys); in bch2_btree_insert_keys_interior()1422 insert = bch2_keylist_front(keys); in bch2_btree_insert_keys_interior()1572 bpos_le(bch2_keylist_front(keys)->k.p, b->data->max_key)) { in btree_split_insert_keys()1575 bch2_btree_node_iter_init(&node_iter, b, &bch2_keylist_front(keys)->k.p); in btree_split_insert_keys()