On Tue, Jul 7, 2009 at 17:06, Morten P.D.
Stevens wrote:
> Hi Brian,
>
> thanks for the chart.
>
> Here are the results visually for all:
>
> http://www2.win-professional.com/images2/btrfs01.png
>
> http://www2.win-professional.com/images2/btrfs02.png
What are the units? Are those measuring throu
Hi Brian,
thanks for the chart.
Here are the results visually for all:
http://www2.win-professional.com/images2/btrfs01.png
http://www2.win-professional.com/images2/btrfs02.png
-Original Message-
From: Brian Neu [mailto:proclivit...@yahoo.com]
Sent: Tuesday, July 07, 2009 4:16 AM
To
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I mentioned a ghost file. Here is the dump (less than 65M):
http://dev.mccme.ru/~raskin/btrfs.dump
ghost file is:
885dj1l4788pymp3bk2f3dz52ggcvw4v-empty/garbage-1/mwave.h.tmp-31838-1822528541
It has a name, but stat fails (so no inode, I guess). Also
This patch moves the caching of the block group off to a kthread in order to
allow people to allocate sooner. Instead of blocking up behind the caching
mutex, we instead kick of the caching kthread, and then attempt to make an
allocation. If we cannot, we wait on the block groups caching waitqueu
This patch contains two changes to avoid unnecessary tree block reads during
snapshot dropping. First, check tree block's reference count and flags before
reading the tree block. if reference count > 1 and there is no need to update
backrefs, we can avoid reading the tree block. Second, save when s
Relocate file extents in clusters instead of one by one,
so we can make better use of readahead.
Signed-off-by: Yan Zheng
---
diff -urp 1/fs/btrfs/relocation.c 2/fs/btrfs/relocation.c
--- 1/fs/btrfs/relocation.c 2009-07-03 08:08:34.160847023 +0800
+++ 2/fs/btrfs/relocation.c 2009-07-07 1
This patch contains two changes to avoid unnecessary tree block reads during
snapshot dropping. First, check tree block's reference count and flags before
reading the tree block. if reference count > 1 and there is no need to update
backrefs, we can avoid reading the tree block. Second, save when s