On 01/27/2011 11:29 AM, Michael S. Tsirkin wrote:

On Thu, Jan 27, 2011 at 11:28:12AM +0200, Avi Kivity wrote:

quoted

 On 01/27/2011 11:26 AM, Michael S. Tsirkin wrote:
 >>   >Right. That's why I say that sorting by size might not be optimal.
 >>   >Maybe a cache ...
 >>
 >>   Why would it not be optimal?
 >>
 >>   If you have 16GB RAM in two slots and a few megabytes here and there
 >>   scattered in some slots, you have three orders of magnitudes to
 >>   spare.
 >
 >Yes but you might not be accessing all that RAM.
 >Maybe your workset is just tens of megabytes.

 Great, then you fault it in and never touch the slots array again.

Yep. Except for emulated mmio :)

Which is why I want to cache the result of a negative lookup in the spte.

-- 
error compiling committee.c: too many arguments to function