pgtable.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448
  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. if (SHARED_KERNEL_PMD)
  103. return;
  104. spin_lock(&pgd_lock);
  105. pgd_list_del(pgd);
  106. spin_unlock(&pgd_lock);
  107. }
  108. /*
  109. * List of all pgd's needed for non-PAE so it can invalidate entries
  110. * in both cached and uncached pgd's; not needed for PAE since the
  111. * kernel pmd is shared. If PAE were not to share the pmd a similar
  112. * tactic would be needed. This is essentially codepath-based locking
  113. * against pageattr.c; it is the unique case in which a valid change
  114. * of kernel pagetables can't be lazily synchronized by vmalloc faults.
  115. * vmalloc faults work because attached pagetables are never freed.
  116. * -- wli
  117. */
  118. #ifdef CONFIG_X86_PAE
  119. /*
  120. * In PAE mode, we need to do a cr3 reload (=tlb flush) when
  121. * updating the top-level pagetable entries to guarantee the
  122. * processor notices the update. Since this is expensive, and
  123. * all 4 top-level entries are used almost immediately in a
  124. * new process's life, we just pre-populate them here.
  125. *
  126. * Also, if we're in a paravirt environment where the kernel pmd is
  127. * not shared between pagetables (!SHARED_KERNEL_PMDS), we allocate
  128. * and initialize the kernel pmds here.
  129. */
  130. #define PREALLOCATED_PMDS UNSHARED_PTRS_PER_PGD
  131. void pud_populate(struct mm_struct *mm, pud_t *pudp, pmd_t *pmd)
  132. {
  133. paravirt_alloc_pmd(mm, __pa(pmd) >> PAGE_SHIFT);
  134. /* Note: almost everything apart from _PAGE_PRESENT is
  135. reserved at the pmd (PDPT) level. */
  136. set_pud(pudp, __pud(__pa(pmd) | _PAGE_PRESENT));
  137. /*
  138. * According to Intel App note "TLBs, Paging-Structure Caches,
  139. * and Their Invalidation", April 2007, document 317080-001,
  140. * section 8.1: in PAE mode we explicitly have to flush the
  141. * TLB via cr3 if the top-level pgd is changed...
  142. */
  143. if (mm == current->active_mm)
  144. write_cr3(read_cr3());
  145. }
  146. #else /* !CONFIG_X86_PAE */
  147. /* No need to prepopulate any pagetable entries in non-PAE modes. */
  148. #define PREALLOCATED_PMDS 0
  149. #endif /* CONFIG_X86_PAE */
  150. static void free_pmds(pmd_t *pmds[])
  151. {
  152. int i;
  153. for(i = 0; i < PREALLOCATED_PMDS; i++)
  154. if (pmds[i])
  155. free_page((unsigned long)pmds[i]);
  156. }
  157. static int preallocate_pmds(pmd_t *pmds[])
  158. {
  159. int i;
  160. bool failed = false;
  161. for(i = 0; i < PREALLOCATED_PMDS; i++) {
  162. pmd_t *pmd = (pmd_t *)__get_free_page(PGALLOC_GFP);
  163. if (pmd == NULL)
  164. failed = true;
  165. pmds[i] = pmd;
  166. }
  167. if (failed) {
  168. free_pmds(pmds);
  169. return -ENOMEM;
  170. }
  171. return 0;
  172. }
  173. /*
  174. * Mop up any pmd pages which may still be attached to the pgd.
  175. * Normally they will be freed by munmap/exit_mmap, but any pmd we
  176. * preallocate which never got a corresponding vma will need to be
  177. * freed manually.
  178. */
  179. static void pgd_mop_up_pmds(struct mm_struct *mm, pgd_t *pgdp)
  180. {
  181. int i;
  182. for(i = 0; i < PREALLOCATED_PMDS; i++) {
  183. pgd_t pgd = pgdp[i];
  184. if (pgd_val(pgd) != 0) {
  185. pmd_t *pmd = (pmd_t *)pgd_page_vaddr(pgd);
  186. pgdp[i] = native_make_pgd(0);
  187. paravirt_release_pmd(pgd_val(pgd) >> PAGE_SHIFT);
  188. pmd_free(mm, pmd);
  189. }
  190. }
  191. }
  192. static void pgd_prepopulate_pmd(struct mm_struct *mm, pgd_t *pgd, pmd_t *pmds[])
  193. {
  194. pud_t *pud;
  195. unsigned long addr;
  196. int i;
  197. if (PREALLOCATED_PMDS == 0) /* Work around gcc-3.4.x bug */
  198. return;
  199. pud = pud_offset(pgd, 0);
  200. for (addr = i = 0; i < PREALLOCATED_PMDS;
  201. i++, pud++, addr += PUD_SIZE) {
  202. pmd_t *pmd = pmds[i];
  203. if (i >= KERNEL_PGD_BOUNDARY)
  204. memcpy(pmd, (pmd_t *)pgd_page_vaddr(swapper_pg_dir[i]),
  205. sizeof(pmd_t) * PTRS_PER_PMD);
  206. pud_populate(mm, pud, pmd);
  207. }
  208. }
  209. pgd_t *pgd_alloc(struct mm_struct *mm)
  210. {
  211. pgd_t *pgd;
  212. pmd_t *pmds[PREALLOCATED_PMDS];
  213. pgd = (pgd_t *)__get_free_page(PGALLOC_GFP);
  214. if (pgd == NULL)
  215. goto out;
  216. mm->pgd = pgd;
  217. if (preallocate_pmds(pmds) != 0)
  218. goto out_free_pgd;
  219. if (paravirt_pgd_alloc(mm) != 0)
  220. goto out_free_pmds;
  221. /*
  222. * Make sure that pre-populating the pmds is atomic with
  223. * respect to anything walking the pgd_list, so that they
  224. * never see a partially populated pgd.
  225. */
  226. spin_lock(&pgd_lock);
  227. pgd_ctor(mm, pgd);
  228. pgd_prepopulate_pmd(mm, pgd, pmds);
  229. spin_unlock(&pgd_lock);
  230. return pgd;
  231. out_free_pmds:
  232. free_pmds(pmds);
  233. out_free_pgd:
  234. free_page((unsigned long)pgd);
  235. out:
  236. return NULL;
  237. }
  238. void pgd_free(struct mm_struct *mm, pgd_t *pgd)
  239. {
  240. pgd_mop_up_pmds(mm, pgd);
  241. pgd_dtor(pgd);
  242. paravirt_pgd_free(mm, pgd);
  243. free_page((unsigned long)pgd);
  244. }
  245. int ptep_set_access_flags(struct vm_area_struct *vma,
  246. unsigned long address, pte_t *ptep,
  247. pte_t entry, int dirty)
  248. {
  249. int changed = !pte_same(*ptep, entry);
  250. if (changed && dirty) {
  251. *ptep = entry;
  252. pte_update_defer(vma->vm_mm, address, ptep);
  253. flush_tlb_page(vma, address);
  254. }
  255. return changed;
  256. }
  257. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  258. int pmdp_set_access_flags(struct vm_area_struct *vma,
  259. unsigned long address, pmd_t *pmdp,
  260. pmd_t entry, int dirty)
  261. {
  262. int changed = !pmd_same(*pmdp, entry);
  263. VM_BUG_ON(address & ~HPAGE_PMD_MASK);
  264. if (changed && dirty) {
  265. *pmdp = entry;
  266. pmd_update_defer(vma->vm_mm, address, pmdp);
  267. flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
  268. }
  269. return changed;
  270. }
  271. #endif
  272. int ptep_test_and_clear_young(struct vm_area_struct *vma,
  273. unsigned long addr, pte_t *ptep)
  274. {
  275. int ret = 0;
  276. if (pte_young(*ptep))
  277. ret = test_and_clear_bit(_PAGE_BIT_ACCESSED,
  278. (unsigned long *) &ptep->pte);
  279. if (ret)
  280. pte_update(vma->vm_mm, addr, ptep);
  281. return ret;
  282. }
  283. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  284. int pmdp_test_and_clear_young(struct vm_area_struct *vma,
  285. unsigned long addr, pmd_t *pmdp)
  286. {
  287. int ret = 0;
  288. if (pmd_young(*pmdp))
  289. ret = test_and_clear_bit(_PAGE_BIT_ACCESSED,
  290. (unsigned long *)pmdp);
  291. if (ret)
  292. pmd_update(vma->vm_mm, addr, pmdp);
  293. return ret;
  294. }
  295. #endif
  296. int ptep_clear_flush_young(struct vm_area_struct *vma,
  297. unsigned long address, pte_t *ptep)
  298. {
  299. int young;
  300. young = ptep_test_and_clear_young(vma, address, ptep);
  301. if (young)
  302. flush_tlb_page(vma, address);
  303. return young;
  304. }
  305. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  306. int pmdp_clear_flush_young(struct vm_area_struct *vma,
  307. unsigned long address, pmd_t *pmdp)
  308. {
  309. int young;
  310. VM_BUG_ON(address & ~HPAGE_PMD_MASK);
  311. young = pmdp_test_and_clear_young(vma, address, pmdp);
  312. if (young)
  313. flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
  314. return young;
  315. }
  316. void pmdp_splitting_flush(struct vm_area_struct *vma,
  317. unsigned long address, pmd_t *pmdp)
  318. {
  319. int set;
  320. VM_BUG_ON(address & ~HPAGE_PMD_MASK);
  321. set = !test_and_set_bit(_PAGE_BIT_SPLITTING,
  322. (unsigned long *)pmdp);
  323. if (set) {
  324. pmd_update(vma->vm_mm, address, pmdp);
  325. /* need tlb flush only to serialize against gup-fast */
  326. flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
  327. }
  328. }
  329. #endif
  330. /**
  331. * reserve_top_address - reserves a hole in the top of kernel address space
  332. * @reserve - size of hole to reserve
  333. *
  334. * Can be used to relocate the fixmap area and poke a hole in the top
  335. * of kernel address space to make room for a hypervisor.
  336. */
  337. void __init reserve_top_address(unsigned long reserve)
  338. {
  339. #ifdef CONFIG_X86_32
  340. BUG_ON(fixmaps_set > 0);
  341. printk(KERN_INFO "Reserving virtual address space above 0x%08x\n",
  342. (int)-reserve);
  343. __FIXADDR_TOP = -reserve - PAGE_SIZE;
  344. #endif
  345. }
  346. int fixmaps_set;
  347. void __native_set_fixmap(enum fixed_addresses idx, pte_t pte)
  348. {
  349. unsigned long address = __fix_to_virt(idx);
  350. if (idx >= __end_of_fixed_addresses) {
  351. BUG();
  352. return;
  353. }
  354. set_pte_vaddr(address, pte);
  355. fixmaps_set++;
  356. }
  357. void native_set_fixmap(enum fixed_addresses idx, phys_addr_t phys,
  358. pgprot_t flags)
  359. {
  360. __native_set_fixmap(idx, pfn_pte(phys >> PAGE_SHIFT, flags));
  361. }