Home
last modified time | relevance | path

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

12

/linux-6.12.1/fs/bcachefs/
Dbackpointers.c434 BTREE_ID_backpointers, POS_MIN, 0, k, in bch2_check_btree_backpointers()
673 struct bpos bucket_pos = POS_MIN; in check_extent_to_backpointers()
707 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, in check_btree_root_to_backpointers()
778 btree == start.btree ? start.pos : POS_MIN, in bch2_get_btree_in_memory_pos()
881 bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0, level, in bch2_check_extents_to_backpointers_pass()
902 struct extents_to_bp_state s = { .bucket_start = POS_MIN }; in bch2_check_extents_to_backpointers()
919 if ( bpos_eq(s.bucket_start, POS_MIN) && in bch2_check_extents_to_backpointers()
924 if (!bpos_eq(s.bucket_start, POS_MIN) || in bch2_check_extents_to_backpointers()
1013 POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_backpointers_to_extents_pass()
1026 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end; in bch2_check_backpointers_to_extents()
Dbtree_gc.c513 struct bpos pulled_from_scan = POS_MIN; in bch2_check_topology()
538 bch2_shoot_down_journal_keys(c, i, 1, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_check_topology()
539 ret = bch2_get_scanned_nodes(c, i, 0, POS_MIN, SPOS_MAX); in bch2_check_topology()
667 bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, 0, level, in bch2_gc_btree()
684 bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, in bch2_gc_btree()
986 BTREE_ID_reflink, POS_MIN, in bch2_gc_reflink_done()
999 for_each_btree_key(trans, iter, BTREE_ID_reflink, POS_MIN, in bch2_gc_reflink_start()
1081 BTREE_ID_stripes, POS_MIN, in bch2_gc_stripes_done()
1272 c->gc_gens_pos = POS_MIN; in bch2_gc_gens()
1276 POS_MIN, in bch2_gc_gens()
[all …]
Dsnapshot.c495 for_each_btree_key_norestart(trans, iter, BTREE_ID_subvolumes, POS_MIN, in bch2_snapshot_tree_master_subvol()
623 BTREE_ID_snapshot_trees, POS_MIN, in bch2_check_snapshot_trees()
914 for_each_btree_key_norestart(trans, iter, BTREE_ID_snapshot_trees, POS_MIN, in check_snapshot_exists()
942 for_each_btree_key_norestart(trans, iter, BTREE_ID_subvolumes, POS_MIN, in check_snapshot_exists()
1037 ret = for_each_btree_key(trans, iter, btree, POS_MIN, in bch2_reconstruct_snapshots()
1255 POS_MIN, BTREE_ITER_intent); in create_snapids()
1608 POS_MIN, 0, k, in bch2_delete_dead_snapshots()
1616 POS_MIN, 0, k, in bch2_delete_dead_snapshots()
1623 POS_MIN, 0, k, ({ in bch2_delete_dead_snapshots()
1636 struct bpos last_pos = POS_MIN; in bch2_delete_dead_snapshots()
[all …]
Dmigrate.c89 ret = for_each_btree_key_commit(trans, iter, id, POS_MIN, in bch2_dev_usrdata_drop()
121 bch2_trans_node_iter_init(trans, &iter, id, POS_MIN, 0, 0, in bch2_dev_metadata_drop()
Dsubvolume.c19 return POS_MIN; in subvolume_children_pos()
23 return POS_MIN; in subvolume_children_pos()
165 BTREE_ID_subvolumes, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_subvols()
200 BTREE_ID_subvolume_children, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_subvol_children()
248 return !bpos_eq(pos, POS_MIN) in subvolume_children_mod()
402 BTREE_ID_subvolumes, POS_MIN, BTREE_ITER_prefetch, k, in bch2_subvolumes_reparent()
Dbbpos_types.h15 #define BBPOS_MIN BBPOS(0, POS_MIN)
Dbbpos.h23 pos.pos = POS_MIN; in bbpos_successor()
Dbtree_io.h199 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
216 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
Dlogged_ops.c67 BTREE_ID_logged_ops, POS_MIN, in bch2_resume_logged_ops()
Drecovery.c103 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
105 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
107 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
109 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
111 0, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_reconstruct_alloc()
Dalloc_background.c551 ret = for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN, in bch2_bucket_gens_init()
603 ret = for_each_btree_key(trans, iter, BTREE_ID_bucket_gens, POS_MIN, in bch2_alloc_read()
630 ret = for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN, in bch2_alloc_read()
1512 bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, POS_MIN, in bch2_check_alloc_info()
1514 bch2_trans_iter_init(trans, &discard_iter, BTREE_ID_need_discard, POS_MIN, in bch2_check_alloc_info()
1516 bch2_trans_iter_init(trans, &freespace_iter, BTREE_ID_freespace, POS_MIN, in bch2_check_alloc_info()
1518 bch2_trans_iter_init(trans, &bucket_gens_iter, BTREE_ID_bucket_gens, POS_MIN, in bch2_check_alloc_info()
1582 BTREE_ID_need_discard, POS_MIN, in bch2_check_alloc_info()
1588 bch2_trans_iter_init(trans, &iter, BTREE_ID_freespace, POS_MIN, in bch2_check_alloc_info()
1618 BTREE_ID_bucket_gens, POS_MIN, in bch2_check_alloc_info()
[all …]
Dmove.c611 ctxt->stats->pos = BBPOS(id, POS_MIN); in __bch2_move_data()
618 id == start.btree ? start.pos : POS_MIN, in __bch2_move_data()
666 struct bpos bp_pos = POS_MIN; in bch2_evacuate_bucket()
841 stats->pos = BBPOS(btree, POS_MIN); in bch2_move_btree()
846 bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, 0, 0, in bch2_move_btree()
Ddisk_accounting.c525 struct bpos pos = POS_MIN; in bch2_gc_accounting_done()
703 BTREE_ID_accounting, POS_MIN, in bch2_accounting_read()
836 for_each_btree_key_commit(trans, iter, BTREE_ID_accounting, POS_MIN, in bch2_dev_usage_remove()
874 BTREE_ID_accounting, POS_MIN, in bch2_verify_accounting_clean()
Dlru.c194 BTREE_ID_lru, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_lrus()
Dfsck.c1468 POS_MIN, in bch2_check_inodes()
1561 POS_MIN, in bch2_check_unreachable_inodes()
2062 POS_MIN, in bch2_check_indirect_extents()
2289 for_each_btree_key_norestart(trans, iter, BTREE_ID_subvolumes, POS_MIN, 0, k, ret) { in find_snapshot_subvol()
2763 BTREE_ID_subvolumes, POS_MIN, BTREE_ITER_prefetch, k, in bch2_check_subvolume_structure()
2886 for_each_btree_key_commit(trans, iter, BTREE_ID_inodes, POS_MIN, in bch2_check_directory_structure()
3035 for_each_btree_key(trans, iter, BTREE_ID_dirents, POS_MIN, in check_nlinks_walk_dirents()
3189 BTREE_ID_extents, POS_MIN, in bch2_fix_reflink_p()
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()
Dbkey_methods.c256 if (bpos_eq(pos, POS_MIN)) in bch2_bpos_to_text()
Dbtree_update_interior.c62 if (!bpos_eq(b->data->min_key, POS_MIN)) { in bch2_btree_node_check_topology()
480 btree_set_min(b, POS_MIN); in __btree_root_alloc()
1452 struct bpos n1_pos = POS_MIN; in __btree_split_node()
1979 if ((sib == btree_prev_sib && bpos_eq(b->data->min_key, POS_MIN)) || in __bch2_foreground_maybe_merge()
2552 btree_set_min(b, POS_MIN); in bch2_btree_root_alloc_fake_trans()
Drebalance.c337 BTREE_ID_rebalance_work, POS_MIN, in do_rebalance()
Dbtree_node_scan.c478 .min_key = POS_MIN, in bch2_btree_has_scanned_nodes()
Dbtree_iter.c2043 ? bpos_eq(pos, POS_MIN) in bch2_btree_iter_rewind()
2044 : bkey_eq(pos, POS_MIN)); in bch2_btree_iter_rewind()
2559 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in bch2_btree_iter_peek_prev()
2564 bch2_btree_iter_set_pos(iter, POS_MIN); in bch2_btree_iter_peek_prev()
Dec.c117 bkey_fsck_err_on(bkey_eq(k.k->p, POS_MIN) || in bch2_stripe_validate()
1376 struct bpos bp_pos = POS_MIN; in ec_stripe_update_bucket()
2369 for_each_btree_key(trans, iter, BTREE_ID_stripes, POS_MIN, in bch2_stripes_read()
Ddebug.c348 i->from = POS_MIN; in bch2_dump_open()
Dbcachefs_format.h175 #define POS_MIN SPOS(0, 0, 0) macro
Dinode.c1378 ret = for_each_btree_key_commit(trans, iter, BTREE_ID_deleted_inodes, POS_MIN, in bch2_delete_dead_inodes()

12