Paging ideas
Posted: Tue Jun 06, 2006 1:58 am
Hi!
I was wondering that how could I (or could I) do the paging by using the pointers to the arrays page_table and page_directory for the kernel memory, and then use pde, pte,... "bitmap" array structures for run-time allocation in the space of user? I'd like to have a physical boundary between the kernel memory and application memory in the very bottom level, and so that they wouldn't overlap in any case, and that the kernel would handle them in different ways as I described above.
What do you think? (If you get what I mean) ;D
I was wondering that how could I (or could I) do the paging by using the pointers to the arrays page_table and page_directory for the kernel memory, and then use pde, pte,... "bitmap" array structures for run-time allocation in the space of user? I'd like to have a physical boundary between the kernel memory and application memory in the very bottom level, and so that they wouldn't overlap in any case, and that the kernel would handle them in different ways as I described above.
What do you think? (If you get what I mean) ;D