diff options
| author | Daniel Hill <daniel@gluo.nz> | 2022-10-06 15:53:36 +1300 |
|---|---|---|
| committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-01-06 19:47:54 -0500 |
| commit | 0cfe835cce609bb92435aeabfaa149edbc56e98b (patch) | |
| tree | eddb84254202661cd27965eeccad00567b1e45e1 | |
| parent | 021ef6621e79bb0ed344902d2762127fbeb5c9e4 (diff) | |
bcachefs: improve behaviour of btree_cache_scan()
Appending new nodes to the end of the list means we're more likely to
evict old entries when btree_cache_scan() is started.
Signed-off-by: Daniel Hill <daniel@gluo.nz>
| -rw-r--r-- | fs/bcachefs/btree_cache.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/fs/bcachefs/btree_cache.c b/fs/bcachefs/btree_cache.c index f84b50869de2..e00823990ed4 100644 --- a/fs/bcachefs/btree_cache.c +++ b/fs/bcachefs/btree_cache.c @@ -175,7 +175,7 @@ int bch2_btree_node_hash_insert(struct btree_cache *bc, struct btree *b, mutex_lock(&bc->lock); ret = __bch2_btree_node_hash_insert(bc, b); if (!ret) - list_add(&b->list, &bc->live); + list_add_tail(&b->list, &bc->live); mutex_unlock(&bc->lock); return ret; |