pgtable.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385
  1. #include <linux/mm.h>
  2. #include <linux/gfp.h>
  3. #include <asm/pgalloc.h>
  4. #include <asm/pgtable.h>
  5. #include <asm/tlb.h>
  6. #include <asm/fixmap.h>
  7. #define PGALLOC_GFP GFP_KERNEL | __GFP_NOTRACK | __GFP_REPEAT | __GFP_ZERO
  8. #ifdef CONFIG_HIGHPTE
  9. #define PGALLOC_USER_GFP __GFP_HIGHMEM
  10. #else
  11. #define PGALLOC_USER_GFP 0
  12. #endif
  13. gfp_t __userpte_alloc_gfp = PGALLOC_GFP | PGALLOC_USER_GFP;
  14. pte_t *pte_alloc_one_kernel(struct mm_struct *mm, unsigned long address)
  15. {
  16. return (pte_t *)__get_free_page(PGALLOC_GFP);
  17. }
  18. pgtable_t pte_alloc_one(struct mm_struct *mm, unsigned long address)
  19. {
  20. struct page *pte;
  21. pte = alloc_pages(__userpte_alloc_gfp, 0);
  22. if (pte)
  23. pgtable_page_ctor(pte);
  24. return pte;
  25. }
  26. static int __init setup_userpte(char *arg)
  27. {
  28. if (!arg)
  29. return -EINVAL;
  30. /*
  31. * "userpte=nohigh" disables allocation of user pagetables in
  32. * high memory.
  33. */
  34. if (strcmp(arg, "nohigh") == 0)
  35. __userpte_alloc_gfp &= ~__GFP_HIGHMEM;
  36. else
  37. return -EINVAL;
  38. return 0;
  39. }
  40. early_param("userpte", setup_userpte);
  41. void ___pte_free_tlb(struct mmu_gather *tlb, struct page *pte)
  42. {
  43. pgtable_page_dtor(pte);
  44. paravirt_release_pte(page_to_pfn(pte));
  45. tlb_remove_page(tlb, pte);
  46. }
  47. #if PAGETABLE_LEVELS > 2
  48. void ___pmd_free_tlb(struct mmu_gather *tlb, pmd_t *pmd)
  49. {
  50. paravirt_release_pmd(__pa(pmd) >> PAGE_SHIFT);
  51. tlb_remove_page(tlb, virt_to_page(pmd));
  52. }
  53. #if PAGETABLE_LEVELS > 3
  54. void ___pud_free_tlb(struct mmu_gather *tlb, pud_t *pud)
  55. {
  56. paravirt_release_pud(__pa(pud) >> PAGE_SHIFT);
  57. tlb_remove_page(tlb, virt_to_page(pud));
  58. }
  59. #endif /* PAGETABLE_LEVELS > 3 */
  60. #endif /* PAGETABLE_LEVELS > 2 */
  61. static inline void pgd_list_add(pgd_t *pgd)
  62. {
  63. struct page *page = virt_to_page(pgd);
  64. list_add(&page->lru, &pgd_list);
  65. }
  66. static inline void pgd_list_del(pgd_t *pgd)
  67. {
  68. struct page *page = virt_to_page(pgd);
  69. list_del(&page->lru);
  70. }
  71. #define UNSHARED_PTRS_PER_PGD \
  72. (SHARED_KERNEL_PMD ? KERNEL_PGD_BOUNDARY : PTRS_PER_PGD)
  73. static void pgd_set_mm(pgd_t *pgd, struct mm_struct *mm)
  74. {
  75. BUILD_BUG_ON(sizeof(virt_to_page(pgd)->index) < sizeof(mm));
  76. virt_to_page(pgd)->index = (pgoff_t)mm;
  77. }
  78. struct mm_struct *pgd_page_get_mm(struct page *page)
  79. {
  80. return (struct mm_struct *)page->index;
  81. }
  82. static void pgd_ctor(struct mm_struct *mm, pgd_t *pgd)
  83. {
  84. /* If the pgd points to a shared pagetable level (either the
  85. ptes in non-PAE, or shared PMD in PAE), then just copy the
  86. references from swapper_pg_dir. */
  87. if (PAGETABLE_LEVELS == 2 ||
  88. (PAGETABLE_LEVELS == 3 && SHARED_KERNEL_PMD) ||
  89. PAGETABLE_LEVELS == 4) {
  90. clone_pgd_range(pgd + KERNEL_PGD_BOUNDARY,
  91. swapper_pg_dir + KERNEL_PGD_BOUNDARY,
  92. KERNEL_PGD_PTRS);
  93. }
  94. /* list required to sync kernel mapping updates */
  95. if (!SHARED_KERNEL_PMD) {
  96. pgd_set_mm(pgd, mm);
  97. pgd_list_add(pgd);
  98. }
  99. }
  100. static void pgd_dtor(pgd_t *pgd)
  101. {
  102. unsigned long flags; /* can be called from interrupt context */
  103. if (SHARED_KERNEL_PMD)
  104. return;
  105. spin_lock_irqsave(&pgd_lock, flags);
  106. pgd_list_del(pgd);
  107. spin_unlock_irqrestore(&pgd_lock, flags);
  108. }
  109. /*
  110. * List of all pgd's needed for non-PAE so it can invalidate entries
  111. * in both cached and uncached pgd's; not needed for PAE since the
  112. * kernel pmd is shared. If PAE were not to share the pmd a similar
  113. * tactic would be needed. This is essentially codepath-based locking
  114. * against pageattr.c; it is the unique case in which a valid change
  115. * of kernel pagetables can't be lazily synchronized by vmalloc faults.
  116. * vmalloc faults work because attached pagetables are never freed.
  117. * -- wli
  118. */
  119. #ifdef CONFIG_X86_PAE
  120. /*
  121. * In PAE mode, we need to do a cr3 reload (=tlb flush) when
  122. * updating the top-level pagetable entries to guarantee the
  123. * processor notices the update. Since this is expensive, and
  124. * all 4 top-level entries are used almost immediately in a
  125. * new process's life, we just pre-populate them here.
  126. *
  127. * Also, if we're in a paravirt environment where the kernel pmd is
  128. * not shared between pagetables (!SHARED_KERNEL_PMDS), we allocate
  129. * and initialize the kernel pmds here.
  130. */
  131. #define PREALLOCATED_PMDS UNSHARED_PTRS_PER_PGD
  132. void pud_populate(struct mm_struct *mm, pud_t *pudp, pmd_t *pmd)
  133. {
  134. paravirt_alloc_pmd(mm, __pa(pmd) >> PAGE_SHIFT);
  135. /* Note: almost everything apart from _PAGE_PRESENT is
  136. reserved at the pmd (PDPT) level. */
  137. set_pud(pudp, __pud(__pa(pmd) | _PAGE_PRESENT));
  138. /*
  139. * According to Intel App note "TLBs, Paging-Structure Caches,
  140. * and Their Invalidation", April 2007, document 317080-001,
  141. * section 8.1: in PAE mode we explicitly have to flush the
  142. * TLB via cr3 if the top-level pgd is changed...
  143. */
  144. if (mm == current->active_mm)
  145. write_cr3(read_cr3());
  146. }
  147. #else /* !CONFIG_X86_PAE */
  148. /* No need to prepopulate any pagetable entries in non-PAE modes. */
  149. #define PREALLOCATED_PMDS 0
  150. #endif /* CONFIG_X86_PAE */
  151. static void free_pmds(pmd_t *pmds[])
  152. {
  153. int i;
  154. for(i = 0; i < PREALLOCATED_PMDS; i++)
  155. if (pmds[i])
  156. free_page((unsigned long)pmds[i]);
  157. }
  158. static int preallocate_pmds(pmd_t *pmds[])
  159. {
  160. int i;
  161. bool failed = false;
  162. for(i = 0; i < PREALLOCATED_PMDS; i++) {
  163. pmd_t *pmd = (pmd_t *)__get_free_page(PGALLOC_GFP);
  164. if (pmd == NULL)
  165. failed = true;
  166. pmds[i] = pmd;
  167. }
  168. if (failed) {
  169. free_pmds(pmds);
  170. return -ENOMEM;
  171. }
  172. return 0;
  173. }
  174. /*
  175. * Mop up any pmd pages which may still be attached to the pgd.
  176. * Normally they will be freed by munmap/exit_mmap, but any pmd we
  177. * preallocate which never got a corresponding vma will need to be
  178. * freed manually.
  179. */
  180. static void pgd_mop_up_pmds(struct mm_struct *mm, pgd_t *pgdp)
  181. {
  182. int i;
  183. for(i = 0; i < PREALLOCATED_PMDS; i++) {
  184. pgd_t pgd = pgdp[i];
  185. if (pgd_val(pgd) != 0) {
  186. pmd_t *pmd = (pmd_t *)pgd_page_vaddr(pgd);
  187. pgdp[i] = native_make_pgd(0);
  188. paravirt_release_pmd(pgd_val(pgd) >> PAGE_SHIFT);
  189. pmd_free(mm, pmd);
  190. }
  191. }
  192. }
  193. static void pgd_prepopulate_pmd(struct mm_struct *mm, pgd_t *pgd, pmd_t *pmds[])
  194. {
  195. pud_t *pud;
  196. unsigned long addr;
  197. int i;
  198. if (PREALLOCATED_PMDS == 0) /* Work around gcc-3.4.x bug */
  199. return;
  200. pud = pud_offset(pgd, 0);
  201. for (addr = i = 0; i < PREALLOCATED_PMDS;
  202. i++, pud++, addr += PUD_SIZE) {
  203. pmd_t *pmd = pmds[i];
  204. if (i >= KERNEL_PGD_BOUNDARY)
  205. memcpy(pmd, (pmd_t *)pgd_page_vaddr(swapper_pg_dir[i]),
  206. sizeof(pmd_t) * PTRS_PER_PMD);
  207. pud_populate(mm, pud, pmd);
  208. }
  209. }
  210. pgd_t *pgd_alloc(struct mm_struct *mm)
  211. {
  212. pgd_t *pgd;
  213. pmd_t *pmds[PREALLOCATED_PMDS];
  214. unsigned long flags;
  215. pgd = (pgd_t *)__get_free_page(PGALLOC_GFP);
  216. if (pgd == NULL)
  217. goto out;
  218. mm->pgd = pgd;
  219. if (preallocate_pmds(pmds) != 0)
  220. goto out_free_pgd;
  221. if (paravirt_pgd_alloc(mm) != 0)
  222. goto out_free_pmds;
  223. /*
  224. * Make sure that pre-populating the pmds is atomic with
  225. * respect to anything walking the pgd_list, so that they
  226. * never see a partially populated pgd.
  227. */
  228. spin_lock_irqsave(&pgd_lock, flags);
  229. pgd_ctor(mm, pgd);
  230. pgd_prepopulate_pmd(mm, pgd, pmds);
  231. spin_unlock_irqrestore(&pgd_lock, flags);
  232. return pgd;
  233. out_free_pmds:
  234. free_pmds(pmds);
  235. out_free_pgd:
  236. free_page((unsigned long)pgd);
  237. out:
  238. return NULL;
  239. }
  240. void pgd_free(struct mm_struct *mm, pgd_t *pgd)
  241. {
  242. pgd_mop_up_pmds(mm, pgd);
  243. pgd_dtor(pgd);
  244. paravirt_pgd_free(mm, pgd);
  245. free_page((unsigned long)pgd);
  246. }
  247. int ptep_set_access_flags(struct vm_area_struct *vma,
  248. unsigned long address, pte_t *ptep,
  249. pte_t entry, int dirty)
  250. {
  251. int changed = !pte_same(*ptep, entry);
  252. if (changed && dirty) {
  253. *ptep = entry;
  254. pte_update_defer(vma->vm_mm, address, ptep);
  255. flush_tlb_page(vma, address);
  256. }
  257. return changed;
  258. }
  259. int ptep_test_and_clear_young(struct vm_area_struct *vma,
  260. unsigned long addr, pte_t *ptep)
  261. {
  262. int ret = 0;
  263. if (pte_young(*ptep))
  264. ret = test_and_clear_bit(_PAGE_BIT_ACCESSED,
  265. (unsigned long *) &ptep->pte);
  266. if (ret)
  267. pte_update(vma->vm_mm, addr, ptep);
  268. return ret;
  269. }
  270. int ptep_clear_flush_young(struct vm_area_struct *vma,
  271. unsigned long address, pte_t *ptep)
  272. {
  273. int young;
  274. young = ptep_test_and_clear_young(vma, address, ptep);
  275. if (young)
  276. flush_tlb_page(vma, address);
  277. return young;
  278. }
  279. /**
  280. * reserve_top_address - reserves a hole in the top of kernel address space
  281. * @reserve - size of hole to reserve
  282. *
  283. * Can be used to relocate the fixmap area and poke a hole in the top
  284. * of kernel address space to make room for a hypervisor.
  285. */
  286. void __init reserve_top_address(unsigned long reserve)
  287. {
  288. #ifdef CONFIG_X86_32
  289. BUG_ON(fixmaps_set > 0);
  290. printk(KERN_INFO "Reserving virtual address space above 0x%08x\n",
  291. (int)-reserve);
  292. __FIXADDR_TOP = -reserve - PAGE_SIZE;
  293. #endif
  294. }
  295. int fixmaps_set;
  296. void __native_set_fixmap(enum fixed_addresses idx, pte_t pte)
  297. {
  298. unsigned long address = __fix_to_virt(idx);
  299. if (idx >= __end_of_fixed_addresses) {
  300. BUG();
  301. return;
  302. }
  303. set_pte_vaddr(address, pte);
  304. fixmaps_set++;
  305. }
  306. void native_set_fixmap(enum fixed_addresses idx, phys_addr_t phys,
  307. pgprot_t flags)
  308. {
  309. __native_set_fixmap(idx, pfn_pte(phys >> PAGE_SHIFT, flags));
  310. }