Home
last modified time | relevance | path

Searched refs:POS_MIN (Results 1 – 25 of 27) sorted by relevance

12

/linux-6.15/fs/bcachefs/
H A Dmigrate.c92 ret = for_each_btree_key_commit(trans, iter, id, POS_MIN, in bch2_dev_usrdata_drop()
128 bch2_trans_node_iter_init(trans, &iter, id, POS_MIN, 0, 0, in bch2_dev_metadata_drop()
H A Dbbpos_types.h15 #define BBPOS_MIN BBPOS(0, POS_MIN)
H A Dbtree_gc.c534 struct bpos pulled_from_scan = POS_MIN; in bch2_check_topology()
565 bch2_shoot_down_journal_keys(c, i, 1, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_check_topology()
566 ret = bch2_get_scanned_nodes(c, i, 0, POS_MIN, SPOS_MAX); in bch2_check_topology()
697 bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, 0, level, in bch2_gc_btree()
715 bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, in bch2_gc_btree()
1014 BTREE_ID_stripes, POS_MIN, in bch2_gc_stripes_done()
1201 c->gc_gens_pos = POS_MIN; in bch2_gc_gens()
1205 POS_MIN, in bch2_gc_gens()
1218 POS_MIN, in bch2_gc_gens()
1236 c->gc_gens_pos = POS_MIN; in bch2_gc_gens()
H A Dsubvolume.c20 return POS_MIN; in subvolume_children_pos()
24 return POS_MIN; in subvolume_children_pos()
166 BTREE_ID_subvolumes, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_subvols()
201 BTREE_ID_subvolume_children, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_subvol_children()
249 return !bpos_eq(pos, POS_MIN) in subvolume_children_mod()
401 BTREE_ID_subvolumes, POS_MIN, BTREE_ITER_prefetch, k, in bch2_subvolumes_reparent()
H A Dbackpointers.c427 BTREE_ID_backpointers, POS_MIN, 0, k, in bch2_check_btree_backpointers()
704 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, in check_btree_root_to_backpointers()
775 btree == start.btree ? start.pos : POS_MIN, in bch2_get_btree_in_memory_pos()
813 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0, level, in bch2_check_extents_to_backpointers_pass()
1096 struct extents_to_bp_state s = { .bp_start = POS_MIN }; in bch2_check_extents_to_backpointers()
1102 POS_MIN, BTREE_ITER_prefetch, k, ({ in bch2_check_extents_to_backpointers()
1126 if ( bpos_eq(s.bp_start, POS_MIN) && in bch2_check_extents_to_backpointers()
1131 if (!bpos_eq(s.bp_start, POS_MIN) || in bch2_check_extents_to_backpointers()
1227 POS_MIN, BTREE_ITER_prefetch, k, ({ in bch2_check_backpointers_to_extents_pass()
1239 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end; in bch2_check_backpointers_to_extents()
H A Dbbpos.h23 pos.pos = POS_MIN; in bbpos_successor()
H A Dbtree_io.h205 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
222 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
H A Dsnapshot.c421 for_each_btree_key_norestart(trans, iter, BTREE_ID_subvolumes, POS_MIN, in bch2_snapshot_tree_master_subvol()
564 BTREE_ID_snapshot_trees, POS_MIN, in bch2_check_snapshot_trees()
852 for_each_btree_key_norestart(trans, iter, BTREE_ID_snapshot_trees, POS_MIN, in check_snapshot_exists()
880 for_each_btree_key_norestart(trans, iter, BTREE_ID_subvolumes, POS_MIN, in check_snapshot_exists()
974 ret = for_each_btree_key(trans, iter, btree, POS_MIN, in bch2_reconstruct_snapshots()
1192 POS_MIN, BTREE_ITER_intent); in create_snapids()
1562 ret = for_each_btree_key(trans, iter, BTREE_ID_snapshots, POS_MIN, 0, k, in bch2_delete_dead_snapshots()
1595 btree, POS_MIN, in bch2_delete_dead_snapshots()
1624 ret = for_each_btree_key_commit(trans, iter, BTREE_ID_snapshots, POS_MIN, in bch2_delete_dead_snapshots()
H A Dalloc_background.c545 ret = for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN, in bch2_bucket_gens_init()
599 ret = for_each_btree_key(trans, iter, BTREE_ID_bucket_gens, POS_MIN, in bch2_alloc_read()
626 ret = for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN, in bch2_alloc_read()
1563 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, POS_MIN, in bch2_check_alloc_info()
1565 bch2_trans_iter_init(trans, &discard_iter, BTREE_ID_need_discard, POS_MIN, in bch2_check_alloc_info()
1567 bch2_trans_iter_init(trans, &freespace_iter, BTREE_ID_freespace, POS_MIN, in bch2_check_alloc_info()
1569 bch2_trans_iter_init(trans, &bucket_gens_iter, BTREE_ID_bucket_gens, POS_MIN, in bch2_check_alloc_info()
1633 BTREE_ID_need_discard, POS_MIN, in bch2_check_alloc_info()
1639 bch2_trans_iter_init(trans, &iter, BTREE_ID_freespace, POS_MIN, in bch2_check_alloc_info()
1669 BTREE_ID_bucket_gens, POS_MIN, in bch2_check_alloc_info()
[all …]
H A Ddisk_accounting.c541 struct bpos pos = POS_MIN; in bch2_gc_accounting_done()
734 bch2_trans_iter_init(trans, &iter, BTREE_ID_accounting, POS_MIN, in bch2_accounting_read()
894 for_each_btree_key_commit(trans, iter, BTREE_ID_accounting, POS_MIN, in bch2_dev_usage_remove()
930 BTREE_ID_accounting, POS_MIN, in bch2_verify_accounting_clean()
H A Dlru.c217 BTREE_ID_lru, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_lrus()
H A Dfsck.c163 for_each_btree_key_norestart(trans, iter, BTREE_ID_snapshots, POS_MIN, 0, k, ret) { in find_snapshot_tree_subvol()
1321 POS_MIN, in bch2_check_inodes()
1418 POS_MIN, in bch2_check_unreachable_inodes()
1921 POS_MIN, in bch2_check_indirect_extents()
1985 for_each_btree_key_norestart(trans, iter, BTREE_ID_subvolumes, POS_MIN, 0, k, ret) { in find_snapshot_subvol()
2520 BTREE_ID_subvolumes, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_subvolume_structure()
2700 for_each_btree_key_commit(trans, iter, BTREE_ID_inodes, POS_MIN, in bch2_check_directory_structure()
2850 for_each_btree_key(trans, iter, BTREE_ID_dirents, POS_MIN, in check_nlinks_walk_dirents()
3006 BTREE_ID_extents, POS_MIN, in bch2_fix_reflink_p()
H A Dmove.c707 ctxt->stats->pos = BBPOS(id, POS_MIN); in __bch2_move_data()
714 id == start.btree ? start.pos : POS_MIN, in __bch2_move_data()
985 stats->pos = BBPOS(btree, POS_MIN); in bch2_move_btree()
990 bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, 0, 0, in bch2_move_btree()
H A Dreflink.c826 BTREE_ID_reflink, POS_MIN, in bch2_gc_reflink_done()
839 for_each_btree_key(trans, iter, BTREE_ID_reflink, POS_MIN, in bch2_gc_reflink_start()
H A Dquota.c537 for_each_btree_key(trans, iter, BTREE_ID_quotas, POS_MIN, in bch2_fs_quota_read()
540 for_each_btree_key(trans, iter, BTREE_ID_inodes, POS_MIN, in bch2_fs_quota_read()
H A Dbkey_methods.c273 if (bpos_eq(pos, POS_MIN)) in bch2_bpos_to_text()
H A Dbtree_update_interior.c70 if (!bpos_eq(b->data->min_key, POS_MIN)) { in bch2_btree_node_check_topology()
460 btree_set_min(b, POS_MIN); in __btree_root_alloc()
1456 struct bpos n1_pos = POS_MIN; in __btree_split_node()
2001 if ((sib == btree_prev_sib && bpos_eq(b->data->min_key, POS_MIN)) || in __bch2_foreground_maybe_merge()
2626 btree_set_min(b, POS_MIN); in bch2_btree_root_alloc_fake_trans()
H A Drebalance.c524 BTREE_ID_rebalance_work, POS_MIN, in do_rebalance()
H A Dbtree_node_scan.c527 .min_key = POS_MIN, in bch2_btree_has_scanned_nodes()
H A Dbtree_iter.c2055 ? bpos_eq(pos, POS_MIN) in bch2_btree_iter_rewind()
2056 : bkey_eq(pos, POS_MIN)); in bch2_btree_iter_rewind()
2558 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in __bch2_btree_iter_peek_prev()
2563 bch2_btree_iter_set_pos(trans, iter, POS_MIN); in __bch2_btree_iter_peek_prev()
H A Dbtree_iter.h416 return bch2_btree_iter_peek_prev_min(trans, iter, POS_MIN); in bch2_btree_iter_peek_prev()
H A Ddebug.c350 i->from = POS_MIN; in bch2_dump_open()
H A Dbcachefs_format.h175 #define POS_MIN SPOS(0, 0, 0) macro
H A Drecovery.c113 bch2_shoot_down_journal_keys(c, btree, 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in kill_btree()
H A Dec.c121 bkey_fsck_err_on(bkey_eq(k.k->p, POS_MIN) || in bch2_stripe_validate()
2340 POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_stripe_to_lru_refs()

12