lkml.org 
[lkml]   [2007]   [Jun]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [patch 1/2] ufd v1 - unsequential O(1) fdmap core
On Mon, 4 Jun 2007, Eric Dumazet wrote:

> Bitmaps are already there, you didnt zap them.
>
> Your proposal is going to double size taken by file table, since you need two long words
> per file instead of one pointer.
>
> You add conditional branches on very hot spots.
>
> When you open/close a file, you need to access previous and next cells, so you need 3 cache lines, exactly like
> current *legacy* code. (one for file pointer, one on each bitmap flags(open/close_on_exec) )
>
> O(1) lookup doesnt imply it needs to be super-fast. You make a confusion about this.
>
> O(128) is still O(1) for instance. Having to search a bit in a PAGE is a sensible compromise, if we dont add overhead
> on each fget() calls.
>
> Instead of adding complexity and a pile of new bugs (see how long it takes to bring RCU on files to a stable state), we can take a safe path. Then if it happens to still be a problem, we can consider the painfull way.
>
> I probably can code a < 100 lines patch, later this evening after my day job.

fdmap.c is 300 lines of code, w/out comments. You're trying to fit the
wrong structure. It is *that* simple.


- Davide


-
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/

\
 
 \ /
  Last update: 2007-06-04 15:35    [W:0.313 / U:0.016 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site