Home
last modified time | relevance | path

Searched refs:bch2_bpos_to_text (Results 1 – 18 of 18) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbbpos.h34 bch2_bpos_to_text(out, pos.pos); in bch2_bbpos_to_text()
H A Dbtree_node_scan.c30 bch2_bpos_to_text(out, n->min_key); in found_btree_node_to_text()
32 bch2_bpos_to_text(out, n->max_key); in found_btree_node_to_text()
554 bch2_bpos_to_text(&buf, node_min); in bch2_get_scanned_nodes()
556 bch2_bpos_to_text(&buf, node_max); in bch2_get_scanned_nodes()
H A Dbkey_methods.h60 void bch2_bpos_to_text(struct printbuf *, struct bpos);
H A Dnocow_locking.c116 bch2_bpos_to_text(out, u64_to_bucket(l->b[i])); in bch2_nocow_locks_to_text()
H A Dbkey_methods.c271 void bch2_bpos_to_text(struct printbuf *out, struct bpos pos) in bch2_bpos_to_text() function
307 bch2_bpos_to_text(out, k->p); in bch2_bkey_to_text()
H A Dbtree_cache.c1018 bch2_bpos_to_text(&buf, b->data->min_key); in btree_bad_header()
1021 bch2_bpos_to_text(&buf, b->data->max_key); in btree_bad_header()
1438 bch2_bpos_to_text(out, b->data->min_key); in bch2_btree_node_to_text()
1440 bch2_bpos_to_text(out, b->data->max_key); in bch2_btree_node_to_text()
H A Dbtree_io.c32 bch2_bpos_to_text(out, bn->min_key); in bch2_btree_node_header_to_text()
35 bch2_bpos_to_text(out, bn->max_key); in bch2_btree_node_header_to_text()
801 bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf), in validate_bset()
803 bch2_bpos_to_text(&buf2, bp->min_key), buf2.buf)); in validate_bset()
812 bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf)); in validate_bset()
1052 bch2_bpos_to_text(&buf, b->data->min_key); in bch2_btree_node_read_done()
1054 bch2_bpos_to_text(&buf, b->data->max_key); in bch2_btree_node_read_done()
H A Dbtree_iter.c195 bch2_bpos_to_text(&buf1, path->pos); in bch2_btree_path_verify_level()
355 bch2_bpos_to_text(&buf, pos); in bch2_assert_pos_locked()
895 bch2_bpos_to_text(&buf, path->pos); in btree_node_iter_and_journal_peek()
942 bch2_bpos_to_text(&buf, path->pos); in btree_path_down()
1509 bch2_bpos_to_text(out, path->pos); in bch2_btree_path_to_text_short()
1514 bch2_bpos_to_text(out, b->data->min_key); in bch2_btree_path_to_text_short()
1516 bch2_bpos_to_text(out, b->key.k.p); in bch2_btree_path_to_text_short()
3514 bch2_bpos_to_text(out, btree_node_pos(b)); in bch2_btree_bkey_cached_common_to_text()
3557 bch2_bpos_to_text(out, path->pos); in bch2_btree_trans_to_text()
H A Dbtree_gc.c84 bch2_bpos_to_text(out, p->pos); in bch2_gc_pos_to_text()
144 bch2_bpos_to_text(&buf, new_min); in set_node_min()
180 bch2_bpos_to_text(&buf, new_max); in set_node_max()
H A Dbackpointers.c59 bch2_bpos_to_text(out, bp.v->pos); in bch2_backpointer_to_text()
1136 bch2_bpos_to_text(&buf, s.bp_start); in bch2_check_extents_to_backpointers()
1138 bch2_bpos_to_text(&buf, s.bp_end); in bch2_check_extents_to_backpointers()
H A Dbtree_update_interior.c73 bch2_bpos_to_text(&buf, b->data->min_key); in bch2_btree_node_check_topology()
81 bch2_bpos_to_text(&buf, b->data->max_key); in bch2_btree_node_check_topology()
2044 bch2_bpos_to_text(&buf, prev->data->max_key); in __bch2_foreground_maybe_merge()
2048 bch2_bpos_to_text(&buf, next->data->min_key); in __bch2_foreground_maybe_merge()
H A Dbtree_locking.c740 bch2_bpos_to_text(&buf, path->pos); in bch2_trans_relock_fail()
H A Dsysfs.c293 bch2_bpos_to_text(out, c->gc_gens_pos); in bch2_gc_gens_pos_to_text()
H A Dbtree_key_cache.c296 bch2_bpos_to_text(&buf, ck_path->pos); in do_trace_key_cache_fill()
H A Dbset.c1566 bch2_bpos_to_text(out, uk.p); in bch2_bfloat_to_text()
H A Dextents.c295 bch2_bpos_to_text(out, bp.v->min_key); in bch2_btree_ptr_v2_to_text()
H A Dio_write.c1725 bch2_bpos_to_text(out, op->pos); in bch2_write_op_to_text()
H A Dfsck.c1623 bch2_bpos_to_text(&buf, pos1); in overlapping_extents_found()