Messages in this thread | | | Date | Mon, 26 Jul 1999 14:49:16 +0200 (MET DST) | From | Jan Bobrowski <> | Subject | Re: (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/
| |