Subject: Re: [PATCH] Fixed a mismatch between the users of radix_tree and
 the implementation.
From: Peter Zijlstra <peterz@infradead.org>
To: Salman Qazi <sqazi@google.com>
Cc: paulmck@us.ibm.com, akpm@linux-foundation.org,
        linux-kernel@vger.kernel.org, adurbin@google.com
In-Reply-To: <20100816182834.3541.42317.stgit@bumblebee1.mtv.corp.google.com>
References: <20100816182834.3541.42317.stgit@bumblebee1.mtv.corp.google.com>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 8BIT
Date: Mon, 16 Aug 2010 21:33:56 +0200
Message-ID: <1281987236.1926.1895.camel@laptop>
Mime-Version: 1.0
Sender: linux-kernel-owner@vger.kernel.org
Content-Length: 818
Lines: 15

On Mon, 2010-08-16 at 11:30 -0700, Salman Qazi wrote:
> For the delete case,
> we no longer shrink the tree back to being just the root containing the
> only remaining object.  For the insert case, we no longer store the
> first object in the root, rather allocating a node structure for it.  The
> reason that this works is that deleting (or inserting) intermediate nodes
> does not make a difference to a reader holding a slot.  

Ah, I through that was what it did. So you basically increase the memory
footprint for tiny files.. have you done any measurements on that?
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/