contributing to fbsd

[Mark W. Krentel]

> 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.

--Mark