Lines Matching full:table

39 sizes. When Linux was created, 4KB pages and a single page table called
42 this single table were referred to as *PTE*:s - page table entries.
44 The software page table hierarchy reflects the fact that page table hardware has
45 become hierarchical and that in turn is done to save page table memory and
48 One could of course imagine a single, linear page table with enormous amounts
49 of entries, breaking down the whole memory into single pages. Such a page table
52 address space does not waste valuable page table memory, because it will suffice
53 to mark large areas as unmapped at a higher level in the page table hierarchy.
55 Additionally, on modern CPUs, a higher level page table entry can point directly
57 megabytes or even gigabytes in a single high-level page table entry, taking
61 The page table hierarchy has now developed into this::
84 Symbols on the different levels of the page table hierarchy have the following
87 - **pte**, `pte_t`, `pteval_t` = **Page Table Entry** - mentioned earlier.
97   this did refer to a single page table entry in the single top level page
98   table, it was retrofitted to be an array of mapping elements when two-level
100   *table*, not a page table *entry*.
117   main page table handling the PGD for the kernel memory is still found in
124 To repeat: each level in the page table hierarchy is a *array of pointers*, so
143 Page Table Folding
146 If the architecture does not use all the page table levels, they can be *folded*
151 Page table handling code that wishes to be architecture-neutral, such as the
204 because they avoid the need for complex page table lookups at the expenses of
252 The page table walk may end at one of the middle or upper layers (PMD, PUD).
261 reduced page table overhead, memory allocation efficiency, and performance