On 26 Jul 2007, at 03:36, Nick Piggin wrote:
On Wed, Jul 25, 2007 at 10:10:07PM -0400, Chris Mason wrote:
On Thu, 26 Jul 2007 03:37:28 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
One advantage to the state tree is that it separates the state from
the memory being described, allowing a
On Thu, Jul 26, 2007 at 09:05:15AM -0400, Chris Mason wrote:
On Thu, 26 Jul 2007 04:36:39 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
[ are state trees a good idea? ]
One thing it gains us is finding the start of the cluster. Even if
called by kswapd, the state tree allows writepage
On Thu, 26 Jul 2007 04:36:39 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
[ are state trees a good idea? ]
One thing it gains us is finding the start of the cluster. Even if
called by kswapd, the state tree allows writepage to find the start
of the cluster and send down a big bio (provided
On Wed, 25 Jul 2007 04:32:17 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
On Tue, Jul 24, 2007 at 07:25:09PM -0400, Chris Mason wrote:
On Tue, 24 Jul 2007 23:25:43 +0200
Peter Zijlstra [EMAIL PROTECTED] wrote:
The tree is a critical part of the patch, but it is also the
easiest to rip
On Wed, Jul 25, 2007 at 10:10:07PM -0400, Chris Mason wrote:
On Thu, 26 Jul 2007 03:37:28 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
One advantage to the state tree is that it separates the state from
the memory being described, allowing a simple kmap style interface
that covers
On Thu, 26 Jul 2007 03:37:28 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
One advantage to the state tree is that it separates the state from
the memory being described, allowing a simple kmap style interface
that covers subpages, highmem and superpages.
I suppose so, although we should
On Wed, Jul 25, 2007 at 08:18:53AM -0400, Chris Mason wrote:
On Wed, 25 Jul 2007 04:32:17 +0200
Nick Piggin [EMAIL PROTECTED] wrote:
Having another tree to store block state I think is a good idea as I
said in the fsblock thread with Dave, but I haven't clicked as to why
it is a big
On Tue, 10 Jul 2007 17:03:26 -0400
Chris Mason [EMAIL PROTECTED] wrote:
This patch aims to demonstrate one way to replace buffer heads with a
few extent trees. Buffer heads provide a few different features:
1) Mapping of logical file offset to blocks on disk
2) Recording state (dirty,
Core Extentmap implementation
diff -r 126111346f94 -r 53cabea328f7 fs/Makefile
--- a/fs/Makefile Mon Jul 09 10:53:57 2007 -0400
+++ b/fs/Makefile Tue Jul 24 15:40:27 2007 -0400
@@ -11,7 +11,7 @@ obj-y := open.o read_write.o file_table.
attr.o bad_inode.o file.o
On Tue, 2007-07-24 at 16:00 -0400, Chris Mason wrote:
On Tue, 10 Jul 2007 17:03:26 -0400
Chris Mason [EMAIL PROTECTED] wrote:
This patch aims to demonstrate one way to replace buffer heads with a
few extent trees. Buffer heads provide a few different features:
1) Mapping of logical
On Tue, 2007-07-24 at 16:13 -0400, Trond Myklebust wrote:
On Tue, 2007-07-24 at 16:00 -0400, Chris Mason wrote:
On Tue, 10 Jul 2007 17:03:26 -0400
Chris Mason [EMAIL PROTECTED] wrote:
This patch aims to demonstrate one way to replace buffer heads with a
few extent trees. Buffer
On Tue, 24 Jul 2007 23:25:43 +0200
Peter Zijlstra [EMAIL PROTECTED] wrote:
On Tue, 2007-07-24 at 16:13 -0400, Trond Myklebust wrote:
On Tue, 2007-07-24 at 16:00 -0400, Chris Mason wrote:
On Tue, 10 Jul 2007 17:03:26 -0400
Chris Mason [EMAIL PROTECTED] wrote:
This patch aims to
On Tue, Jul 24, 2007 at 07:25:09PM -0400, Chris Mason wrote:
On Tue, 24 Jul 2007 23:25:43 +0200
Peter Zijlstra [EMAIL PROTECTED] wrote:
The tree is a critical part of the patch, but it is also the easiest to
rip out and replace. Basically the code stores a range by inserting
an object at
On Thu, 12 Jul 2007 00:00:28 -0700
Daniel Phillips [EMAIL PROTECTED] wrote:
On Tuesday 10 July 2007 14:03, Chris Mason wrote:
This patch aims to demonstrate one way to replace buffer heads with
a few extent trees...
Hi Chris,
Quite terse commentary on algorithms and data structures,
On Tuesday 10 July 2007 14:03, Chris Mason wrote:
This patch aims to demonstrate one way to replace buffer heads with a
few extent trees...
Hi Chris,
Quite terse commentary on algorithms and data structures, but I suppose
that is not a problem because Jon has a whole week to reverse engineer
This patch aims to demonstrate one way to replace buffer heads with a few
extent trees. Buffer heads provide a few different features:
1) Mapping of logical file offset to blocks on disk
2) Recording state (dirty, locked etc)
3) Providing a mechanism to access sub-page sized blocks.
This patch
16 matches
Mail list logo
