Lines Matching defs:btree
366 * key in the btree that has been deleted from cache and not yet
456 * btree - this is necessary for cache coherency. When iterating over
457 * a btree that's cached in the key cache, the btree iter code checks
458 * the key cache - but the key has to exist in the btree for that to
546 enum btree_id btree,
555 return bch2_btree_insert_trans(trans, btree, n, 0);
585 enum btree_id btree, struct bpos end)
590 bch2_trans_iter_init(trans, iter, btree, POS_MAX, BTREE_ITER_INTENT);
623 enum btree_id btree, struct bkey_i *k,
629 bch2_trans_iter_init(trans, &iter, btree, k->k.p,
655 * bch2_btree_insert - insert keys into the extent btree
657 * @id: btree to insert into
694 enum btree_id btree, struct bpos pos,
700 bch2_trans_iter_init(trans, &iter, btree, pos,
794 int bch2_btree_bit_mod(struct btree_trans *trans, enum btree_id btree,
807 bch2_trans_iter_init(trans, &iter, btree, pos, BTREE_ITER_INTENT);
815 int bch2_btree_bit_mod_buffered(struct btree_trans *trans, enum btree_id btree,
824 return bch2_trans_update_buffered(trans, btree, &k);