contributing to fbsd

[Brian Fundakowski Feldman]

On Sat, Mar 26, 2005 at 04:32:56PM -0500, Mark W. Krentel wrote:
> > The VM map algorithms are the same as ever, though.  They use linear
> > traversal along with a cached reference to the last lookup.  There
> > are certainly some workloads that should benefit from this, so it
> > definitely could be something you could work on.
> 
> Not any more.  The first_free hint was replaced by an O(log n)
> algorithm built into the splay tree back in August 2004.  See
> rev. 1.357 of vm_map.c.

Cool, I don't think I noticed that happen.  That would be for 5.x and
6.x both, then, too.

-- 
Brian Fundakowski Feldman                           \'[ FreeBSD ]''''''''''\
  <> green at FreeBSD.org                               \  The Power to Serve! \
 Opinions expressed are my own.                       \,,,,,,,,,,,,,,,,,,,,,,\