David Sterba wrote on 2016/05/10 14:44 +0200:
On Fri, Apr 29, 2016 at 03:18:54PM +0800, Qu Wenruo wrote:
The branch can be fetched from my github:
https://github.com/adam900710/btrfs-progs.git low_mem_fsck_rebasing
...
Changelog:
v1.1:
Fix a typo which makes keyed data backref check
On Fri, Apr 29, 2016 at 03:18:54PM +0800, Qu Wenruo wrote:
> The branch can be fetched from my github:
> https://github.com/adam900710/btrfs-progs.git low_mem_fsck_rebasing
...
> Changelog:
> v1.1:
> Fix a typo which makes keyed data backref check always fail
> v2:
> Don't return minus
On 04/29/2016 03:27 AM, Qu Wenruo wrote:
Hi Josef,
Thanks for your previous review.
I'd like to add your reviewed-by tag only after we have settled down the
main part of the patchset and get rid of the "RFC" tag.
Will it be OK for you?
That's fine with me, but I think having a non-caching
Hi Josef,
Thanks for your previous review.
I'd like to add your reviewed-by tag only after we have settled down the
main part of the patchset and get rid of the "RFC" tag.
Will it be OK for you?
Thanks,
Qu
Qu Wenruo wrote on 2016/04/29 15:18 +0800:
The branch can be fetched from my
The branch can be fetched from my github:
https://github.com/adam900710/btrfs-progs.git low_mem_fsck_rebasing
Original btrfsck checks extent tree in a very efficient method, by
recording every checked extent in extent record tree to ensure every
extent will be iterated for at most 2 times.
