Lines Matching defs:btree
67 prt_printf(out, "btree=%s l=%u offset=%llu:%u len=%u pos=",
255 * If we're using the btree write buffer, the backpointer we were
263 bp.level ? "btree node" : "extent");
312 struct btree *b = bch2_backpointer_get_node(trans, iter, bp_pos, bp);
322 struct btree *bch2_backpointer_get_node(struct btree_trans *trans,
329 struct btree *b;
424 static int drop_dev_and_update(struct btree_trans *trans, enum btree_id btree,
433 return bch2_btree_insert_trans(trans, btree, n, 0);
437 enum btree_id btree, struct bkey_s_c extent,
481 prt_printf(&buf, "\n %s ", bch2_btree_id_str(btree));
491 ret = drop_dev_and_update(trans, btree, extent, dev) ?: 1;
632 prt_printf(&buf, "missing backpointer for btree=%s l=%u ",
653 enum btree_id btree, unsigned level,
670 bch2_extent_ptr_to_bp(c, btree, level, k, p, entry, &bucket_pos, &bp);
687 struct btree *b;
715 .btree = bp.btree_id,
750 for (enum btree_id btree = start.btree;
751 btree < BTREE_ID_NR && !ret;
752 btree++) {
753 unsigned depth = ((1U << btree) & btree_leaf_mask) ? 0 : 1;
755 struct btree *b;
757 if (!((1U << btree) & btree_leaf_mask) &&
758 !((1U << btree) & btree_interior_mask))
761 __for_each_btree_node(trans, iter, btree,
762 btree == start.btree ? start.pos : POS_MIN,
767 BBPOS(btree, b->key.k.p);
920 bp.v->level ? "btree node" : "extent",
949 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end;