lkml.org 
[lkml]   [1999]   [Jul]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: (elist) faster hash list scanning
On Mon, 26 Jul 1999, Ingo Molnar wrote:

> > > > * It speeds up list manipulations because next->pprev is always accessible.
> (but some of the code you converted, the inode hash, wasnt using
> next/pprev lists.) [...] - thats confusing i think.

Sorry.

> > Yes. But per-processor copy at the same address will be better.
> > Having private processor data at the same place for all processors may
> > by useful for other purposses too (??).
>
> that is not possible, think about clone(CLONE_VM).

It's still magic for me...

Jan Bobrowski


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:53    [W:0.188 / U:0.068 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site