diff options
| author | Kent Overstreet <kent.overstreet@linux.dev> | 2023-07-12 13:55:03 -0400 |
|---|---|---|
| committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-10-22 17:10:07 -0400 |
| commit | 8479938d7a0f6c6cf6362c72880e753b3d7a707a (patch) | |
| tree | 2fcef58d98c02334138389be77b5177437e30a70 /fs/bcachefs/quota.c | |
| parent | d82978ca1593890a1b41eab6d06fe6e5950e4722 (diff) | |
bcachefs: Convert snapshot table to RCU array
This switches the generic radix tree for the in-memory table of snapshot
nodes to a simple rcu array. This means we have to add new locking to
deal with reallocations, but is faster than traversing the radix tree.
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
Diffstat (limited to 'fs/bcachefs/quota.c')
| -rw-r--r-- | fs/bcachefs/quota.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/fs/bcachefs/quota.c b/fs/bcachefs/quota.c index d90db3fb823e..4f0654ff816f 100644 --- a/fs/bcachefs/quota.c +++ b/fs/bcachefs/quota.c @@ -562,7 +562,7 @@ static int bch2_fs_quota_read_inode(struct btree_trans *trans, int ret; ret = bch2_snapshot_tree_lookup(trans, - snapshot_t(c, k.k->p.snapshot)->tree, &s_t); + bch2_snapshot_tree(c, k.k->p.snapshot), &s_t); bch2_fs_inconsistent_on(bch2_err_matches(ret, ENOENT), c, "%s: snapshot tree %u not found", __func__, snapshot_t(c, k.k->p.snapshot)->tree); |