OSDev.org

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?

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.

Combuster wrote:No. Because you only map pagetables belonging to one address space, and not all the page tables in the system.

I forgot.

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