lkml.org 
[lkml]   [1997]   [Jun]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: Ext2fs and hashed table.
Date
  Jan Kasprzak <kas@informatics.muni.cz> writes:
>
> In the new scheme you will have to walk through the direct entries
> and probably through the part of b-tree (which can be
> O(log (index_in_the_file)) operation).
>
Nobody said there should be a B-tree for extents... It might be a good
idea, and it might not be, we don't know yet.

Anyway, for compatibility the code to do linear mapping should be available
anyway, and if the file gets too fragmented (extents list gets too long) =>
switch to linear mapping, and tell the user that this partition could use a
defragment.

--
Spirtle:
The fine stream from a grapefruit that always lands right in
your eye.
-Sniglets, Rich Hall * Friends
--
Matthias Urlichs \ noris network GmbH / Xlink-POP Nürnberg
Schleiermacherstraße 12 \ Linux+Internet / EMail: urlichs@noris.de
90491 Nürnberg (Germany) \ Consulting+Programming+Networking+etc'ing
PGP: 1024/4F578875 1B 89 E2 1C 43 EA 80 44 15 D2 29 CF C6 C7 E0 DE
Click <A HREF="http://info.noris.de/~smurf/finger">here</A>. 42

\
 
 \ /
  Last update: 2005-03-22 13:39    [from the cache]
©2003-2011 Jasper Spaans