On Fri, Jul 28, 2000 at 09:10:45PM +0200, Linus Torvalds wrote:
>
>
> On Fri, 28 Jul 2000, Andi Kleen wrote:
> >
> > This saves about 96K memory on my 128MB machine, more on machines with
> > bigger ram.
>
> I'd rather have just one list function than save a few kB of RAM. Avoid
> confusion, and make people so used to that one list-handling functionalty
> that bugs don't crop up as easily.
I haven't tried too hard, but I'm sure that I could do a benchmark that
shows the speed difference by the cache usage of the single pointer list
and the double pointer list for a big table.
Anyways, the current lists are very slow on x86 because you always need
an additional register to cache the head when you walk the list (it shows
clearly when you look at disassembly listings)
So when you look at it with your speed freak hat on, would you reconsider it ?
-Andi
-
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/
This archive was generated by hypermail 2b29 : Mon Jul 31 2000 - 21:00:28 EST