INTEL VT-D Root table and context table relationship
I am trying to learn about INTEL VT-D, I've read that root table has 256 entries, with each root table points to furhter context table with 256 entries each, where each context table contains second level translation. Unfortunately I am unable to figure out the exact relationship between root table and context table. Do we have 256 * 256 context table entries ? or each root table points to same context table. By looking into following figure,
It says each context table has different bus number, but i am unable to relate to it, also it would be great if someone tells about second level translation, I am fimilar with MMU paging but VT-D paging is really confusing. I have gone through VT-D specs but still some concepts are not clear which I described above.
x86 intel virtualization dma iommu
add a comment |
I am trying to learn about INTEL VT-D, I've read that root table has 256 entries, with each root table points to furhter context table with 256 entries each, where each context table contains second level translation. Unfortunately I am unable to figure out the exact relationship between root table and context table. Do we have 256 * 256 context table entries ? or each root table points to same context table. By looking into following figure,
It says each context table has different bus number, but i am unable to relate to it, also it would be great if someone tells about second level translation, I am fimilar with MMU paging but VT-D paging is really confusing. I have gone through VT-D specs but still some concepts are not clear which I described above.
x86 intel virtualization dma iommu
add a comment |
I am trying to learn about INTEL VT-D, I've read that root table has 256 entries, with each root table points to furhter context table with 256 entries each, where each context table contains second level translation. Unfortunately I am unable to figure out the exact relationship between root table and context table. Do we have 256 * 256 context table entries ? or each root table points to same context table. By looking into following figure,
It says each context table has different bus number, but i am unable to relate to it, also it would be great if someone tells about second level translation, I am fimilar with MMU paging but VT-D paging is really confusing. I have gone through VT-D specs but still some concepts are not clear which I described above.
x86 intel virtualization dma iommu
I am trying to learn about INTEL VT-D, I've read that root table has 256 entries, with each root table points to furhter context table with 256 entries each, where each context table contains second level translation. Unfortunately I am unable to figure out the exact relationship between root table and context table. Do we have 256 * 256 context table entries ? or each root table points to same context table. By looking into following figure,
It says each context table has different bus number, but i am unable to relate to it, also it would be great if someone tells about second level translation, I am fimilar with MMU paging but VT-D paging is really confusing. I have gone through VT-D specs but still some concepts are not clear which I described above.
x86 intel virtualization dma iommu
x86 intel virtualization dma iommu
edited Nov 14 '18 at 12:11
Peter Cordes
119k16181308
119k16181308
asked Nov 14 '18 at 6:52
Ameer Hamza
236
236
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
In PCIe, there are 256 bus numbers, and 256 device/function numbers per bus, for a total of 256*256 functions. In VT-d, there can be a context entry for each of these.
The root table/context tables are organized as a two-level table so that the context tables don't have to be fully populated. Each root table entry has a present bit. If the present bit is 0, there is no context table for that bus.
It would be highly unusual for more than one root table entry to point to the same context table, although there is nothing to preclude it.
If you are familiar with CPU paging, the VT-d page table structures are very similar to EPT (and in fact the same physical tables in memory can be used for both purposes simultaneously). VT-d supports two-, three-, or four-level paging structures with up to 48-bit addresses (depending on the hardware implementation; I believe that all current implementations support 4-level walks only).
If you have more specific questions, I can answer them, but I don't think this is a good place for a tutorial.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53294593%2fintel-vt-d-root-table-and-context-table-relationship%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
In PCIe, there are 256 bus numbers, and 256 device/function numbers per bus, for a total of 256*256 functions. In VT-d, there can be a context entry for each of these.
The root table/context tables are organized as a two-level table so that the context tables don't have to be fully populated. Each root table entry has a present bit. If the present bit is 0, there is no context table for that bus.
It would be highly unusual for more than one root table entry to point to the same context table, although there is nothing to preclude it.
If you are familiar with CPU paging, the VT-d page table structures are very similar to EPT (and in fact the same physical tables in memory can be used for both purposes simultaneously). VT-d supports two-, three-, or four-level paging structures with up to 48-bit addresses (depending on the hardware implementation; I believe that all current implementations support 4-level walks only).
If you have more specific questions, I can answer them, but I don't think this is a good place for a tutorial.
add a comment |
In PCIe, there are 256 bus numbers, and 256 device/function numbers per bus, for a total of 256*256 functions. In VT-d, there can be a context entry for each of these.
The root table/context tables are organized as a two-level table so that the context tables don't have to be fully populated. Each root table entry has a present bit. If the present bit is 0, there is no context table for that bus.
It would be highly unusual for more than one root table entry to point to the same context table, although there is nothing to preclude it.
If you are familiar with CPU paging, the VT-d page table structures are very similar to EPT (and in fact the same physical tables in memory can be used for both purposes simultaneously). VT-d supports two-, three-, or four-level paging structures with up to 48-bit addresses (depending on the hardware implementation; I believe that all current implementations support 4-level walks only).
If you have more specific questions, I can answer them, but I don't think this is a good place for a tutorial.
add a comment |
In PCIe, there are 256 bus numbers, and 256 device/function numbers per bus, for a total of 256*256 functions. In VT-d, there can be a context entry for each of these.
The root table/context tables are organized as a two-level table so that the context tables don't have to be fully populated. Each root table entry has a present bit. If the present bit is 0, there is no context table for that bus.
It would be highly unusual for more than one root table entry to point to the same context table, although there is nothing to preclude it.
If you are familiar with CPU paging, the VT-d page table structures are very similar to EPT (and in fact the same physical tables in memory can be used for both purposes simultaneously). VT-d supports two-, three-, or four-level paging structures with up to 48-bit addresses (depending on the hardware implementation; I believe that all current implementations support 4-level walks only).
If you have more specific questions, I can answer them, but I don't think this is a good place for a tutorial.
In PCIe, there are 256 bus numbers, and 256 device/function numbers per bus, for a total of 256*256 functions. In VT-d, there can be a context entry for each of these.
The root table/context tables are organized as a two-level table so that the context tables don't have to be fully populated. Each root table entry has a present bit. If the present bit is 0, there is no context table for that bus.
It would be highly unusual for more than one root table entry to point to the same context table, although there is nothing to preclude it.
If you are familiar with CPU paging, the VT-d page table structures are very similar to EPT (and in fact the same physical tables in memory can be used for both purposes simultaneously). VT-d supports two-, three-, or four-level paging structures with up to 48-bit addresses (depending on the hardware implementation; I believe that all current implementations support 4-level walks only).
If you have more specific questions, I can answer them, but I don't think this is a good place for a tutorial.
answered Nov 20 '18 at 1:15
prl
4,4631315
4,4631315
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53294593%2fintel-vt-d-root-table-and-context-table-relationship%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown