Alan Cox 2d4b9a6438 Optimize vm_radix_lookup_ge() and vm_radix_lookup_le(). Specifically,
change the way that these functions ascend the tree when the search for a
matching leaf fails at an interior node.  Rather than returning to the root
of the tree and repeating the lookup with an updated key, maintain a stack
of interior nodes that were visited during the descent and use that stack
to resume the lookup at the closest ancestor that might have a matching
descendant.

Sponsored by:	EMC / Isilon Storage Division
Reviewed by:	attilio
Tested by:	pho
2013-05-04 22:50:15 +00:00
..
2013-05-01 22:45:04 +00:00
2013-05-04 18:38:16 +00:00
2013-05-01 04:37:34 +00:00
2013-04-17 11:45:15 +00:00
2013-04-27 06:54:49 +00:00
2013-04-29 23:08:13 +00:00