Hi, Guangrong,
I read your very nice slides at LCJ 2011, "KVM MMU virtualization".
However, I have some confusion about nested paging,
which you gave a simplified example to illustrate in slide 11.
The very first step is to use gCR3 as the input to the nested page
walk. So you mark gCR3 as the guest physical address (gpa).
So my first question is whether gCR3 is exactly the GPA as the input
to the nested paging?
Then after the nested page walk, we can have hpa. Now suppose we
use the first 10 bit of the gva to combine with the hpa to find the
guest table entry. Here is this step like traditional x86 paging,
ie.., hpa as the base to the guest page directory (guest page table
page) and gva is the offset?
If so, I feel that this is contradict to figure 1(b) of the paper
"Accelerating Two-Dimensional Page Walks for Virtualized Systems". In
this paper, gva is used at the very beginning to combine with gCR3 to
generate a GPA, instead of after the nested paging.
I don't know which way is correct. Could you help to explain this? Thanks.
- ha
--
To unsubscribe from this list: send the line "unsubscribe kvm" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
