Lines Matching full:page
43 * Hardware-wise, we have a two level page table structure, where the first
48 * Linux on the other hand has a three level page table structure, which can
49 * be wrapped to fit a two level page table structure easily - using the PGD
50 * and PTE only. However, Linux also expects one "PTE" table per page, and
60 * This leads to the page tables having the following layout:
78 * PMD_xxx definitions refer to bits in the first level page table.
81 * iff the page is marked "writable" and "dirty" in the Linux PTE. This
82 * means that a write to a clean page will cause a permission fault, and
83 * the Linux MM layer will mark the page dirty via handle_pte_fault().
88 * allow accesses to the page if the "young" bit is set. Accesses to the
89 * page will cause a fault, and handle_pte_fault() will set the young bit
90 * for us as long as the page is marked present in the corresponding Linux
94 * However, when the "young" bit is cleared, we deny access to the page
105 * PMD_SHIFT determines the size of the area a second-level page table can map
106 * PGDIR_SHIFT determines what a third-level page table entry can map
188 * The table below defines the page protection levels that we insert into our
189 * Linux page table version. These get translated into the best that the
215 * ZERO_PAGE is a global shared page that is always zero: used
218 extern struct page *empty_zero_page;
307 * Permanent address of a page. We never have highmem, so this is trivial.
312 * Conversion functions: convert a page and protection to a page entry,
313 * and a page entry and page directory to the page they refer to.
315 #define mk_pte(page,prot) pfn_pte(page_to_pfn(page),prot)
328 /* to find an entry in a page-table-directory */
333 /* to find an entry in a kernel page-table-directory */
336 /* Find an entry in the second-level page table.. */
339 /* Find an entry in the third-level page table.. */
373 * remap a physical page `pfn' of size `size' with page protection `prot'
