Recursive paging

Discussions on more advanced topics such as monolithic vs micro-kernels, transactional memory models, and paging vs segmentation should go here. Use this forum to expand and improve the wiki!
Post Reply
Congdm
Member
Member
Posts: 48
Joined: Wed Aug 01, 2012 10:53 am

Recursive paging

Post by Congdm »

I am very impressed with the simplicity and usefulness of recursive paging and I notice that it works with both IA-32 paging structures (2-level) and IA-32e (4-level), so does this mean it works with any n-level paging structures?

Generally, in a system with n-level paging structures, if we map the m-th entry in level-n table to the physical address of level-n table itself then the area mapped by m-th entry will contain all the page tables in the system.

Is there any formal proof for this result?
User avatar
Combuster
Member
Member
Posts: 9301
Joined: Wed Oct 18, 2006 3:45 am
Libera.chat IRC: [com]buster
Location: On the balcony, where I can actually keep 1½m distance
Contact:

Re: Recursive paging

Post by Combuster »

Is there any formal proof for this result?
No. Because you only map pagetables belonging to one address space, and not all the page tables in the system. :wink:
"Certainly avoid yourself. He is a newbie and might not realize it. You'll hate his code deeply a few years down the road." - Sortie
[ My OS ] [ VDisk/SFS ]
Congdm
Member
Member
Posts: 48
Joined: Wed Aug 01, 2012 10:53 am

Re: Recursive paging

Post by Congdm »

Combuster wrote:No. Because you only map pagetables belonging to one address space, and not all the page tables in the system.
:D I forgot.
User avatar
Owen
Member
Member
Posts: 1700
Joined: Fri Jun 13, 2008 3:21 pm
Location: Cambridge, United Kingdom
Contact:

Re: Recursive paging

Post by Owen »

It also assumes all levels of page table have the same bit structure
Post Reply