tree 0ce1086a736149105642e0f3a4f57e37810f8d02
parent 97115a8d4500abeb090b968f01605e0bdafcdfd3
author Michael S. Tsirkin <mst@redhat.com> 1384185127 +0200
committer Michael S. Tsirkin <mst@redhat.com> 1386671396 +0200

exec: memory radix tree page level compression

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, detect
configurations where a single L2 entry is valid.

We then speed up the lookup by skipping one or more levels.
In case any levels were skipped, we might end up in a valid section
instead of erroring out. We handle this by checking that
the address is in range of the resulting section.

Signed-off-by: Michael S. Tsirkin <mst@redhat.com>