Hi,
On Mon, 2007-09-17 at 11:06 -0500, Eric Sandeen wrote:
> The do_split() function for htree dir blocks is intended to split a
> leaf block to make room for a new entry. It sorts the entries in the
> original block by hash value, then moves the last half of the entries to
> the new block - wit
Andreas Dilger:
> > So this looks like 2.6.22 and 2.6.23 material, but the timing is getting
> > pretty squeezy. Could people please give this change an extra-close
> > review, let me know?
>
> I already discussed it at length with Eric and inspected the patch, so we
> could add:
> Signed-off-by
On Sep 17, 2007 13:30 -0700, Andrew Morton wrote:
> On Mon, 17 Sep 2007 12:21:40 -0500
> > Eric Sandeen wrote:
> > > The do_split() function for htree dir blocks is intended to split a
> > > leaf block to make room for a new entry. It sorts the entries in the
> > > original block by hash value, t
On Mon, 17 Sep 2007 12:21:40 -0500
Eric Sandeen <[EMAIL PROTECTED]> wrote:
> Eric Sandeen wrote:
> > The do_split() function for htree dir blocks is intended to split a
> > leaf block to make room for a new entry. It sorts the entries in the
> > original block by hash value, then moves the last h
Eric Sandeen wrote:
> The do_split() function for htree dir blocks is intended to split a
> leaf block to make room for a new entry. It sorts the entries in the
> original block by hash value, then moves the last half of the entries to
> the new block - without accounting for how much space this
The do_split() function for htree dir blocks is intended to split a
leaf block to make room for a new entry. It sorts the entries in the
original block by hash value, then moves the last half of the entries to
the new block - without accounting for how much space this actually moves.
(IOW, it m
6 matches
Mail list logo