Re: [Qemu-devel] [PATCH RFC 5/5] exec: memory radix tree page level compression

[Eric Blake]

On 11/11/2013 09:41 AM, Michael S. Tsirkin wrote:
> At the moment, memory radix tree is already variable width, but it can
> only skip the low bits of address.
> 
> This is efficient if we have huge memory regions but inefficient if we
> are only using a tiny portion of the address space.
> 
> After we have built up the map, it's a simple matter to detect
> configurations where a single L2 entry is valid.
> 
> We can them speed up the lookup by skipping one or more levels.

s/them/then/

-- 
Eric Blake   eblake redhat com    +1-919-301-3266
Libvirt virtualization library http://libvirt.org

signature.asc
Description: OpenPGP digital signature