Re: how not to write a search algorithm

[Andrew Morton <akpm@zip.com.au>]

Daniel Phillips wrote:
> 
> On Monday 05 August 2002 01:03, Andrew Morton wrote:
> > The list walk is killing us now.   I think we need:
> >
> > struct pte_chain {
> >       struct pte_chain *next;
> >       pte_t *ptes[L1_CACHE_BYTES/4 - 4];
> > };
> 
> Which list walk, the remove or the page_referenced?

The remove in this case.  I'll post some numbers
in the other thread.
--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux-mm.org/