four Level Paging
Hi all,
I understood the paging design 0f 80386, we will have a PD
having 1024 entries, PT having 1024 entries and 12 bit offset.
But in Linux , we have PGD, PMD, PTE, Offset where, PGD can have 1024
entries, PMD is 1, PTE can have 1024, Offset will be 12 bit.
How is the above mapping mapped with the Processor. ?
Thanks a lot
Regards,
Dharma.
.
Relevant Pages
- Re: What is the fastest way to determine if folder has subfolders or not!?
... | This sort of stuff does work very nicely, and is a good way of storing ... in binary tree search on 6000 entries would take 12 steps. ... for faster getting of free units, and if there is none free, using last unit offset + 1)... ... I sew VMWare has sdk for their disk format maybe beter idea would be to use their disk driver and sdk for such job. ... (microsoft.public.vb.winapi) - Re: iA32 Paging
... > Page Dir Page Frame Offset ... > My problem is with the page directory and page frame data entries. ... entry has anything to do with the physical address. ... The 10 bit Page Table Offset from the linear ... (comp.lang.asm.x86) - Re: iA32 Paging
... >> Page Dir Page Frame Offset ... >> My problem is with the page directory and page frame data entries. ... > entry has anything to do with the physical address. ... The 10 bit Page Table Offset from the linear ... (comp.lang.asm.x86) - Re: a doubt on paging in linux
... relevant page table entries. ... PGD, PMD and PTE ... (comp.os.linux.development.system) - Re: Important regression with XFS update for 2.6.24-rc6
... a directory with 15000 entries (btree format) used about 5MB of RAM. ... offset so that filldir got what it expected when filling the user buffer. ... (Linux-Kernel) |
|