pgalloc.h 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. /*
  2. * linux/include/asm-arm/pgalloc.h
  3. *
  4. * Copyright (C) 2000-2001 Russell King
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License version 2 as
  8. * published by the Free Software Foundation.
  9. */
  10. #ifndef _ASMARM_PGALLOC_H
  11. #define _ASMARM_PGALLOC_H
  12. #include <asm/domain.h>
  13. #include <asm/pgtable-hwdef.h>
  14. #include <asm/processor.h>
  15. #include <asm/cacheflush.h>
  16. #include <asm/tlbflush.h>
  17. #define _PAGE_USER_TABLE (PMD_TYPE_TABLE | PMD_BIT4 | PMD_DOMAIN(DOMAIN_USER))
  18. #define _PAGE_KERNEL_TABLE (PMD_TYPE_TABLE | PMD_BIT4 | PMD_DOMAIN(DOMAIN_KERNEL))
  19. /*
  20. * Since we have only two-level page tables, these are trivial
  21. */
  22. #define pmd_alloc_one(mm,addr) ({ BUG(); ((pmd_t *)2); })
  23. #define pmd_free(pmd) do { } while (0)
  24. #define pgd_populate(mm,pmd,pte) BUG()
  25. extern pgd_t *get_pgd_slow(struct mm_struct *mm);
  26. extern void free_pgd_slow(pgd_t *pgd);
  27. #define pgd_alloc(mm) get_pgd_slow(mm)
  28. #define pgd_free(pgd) free_pgd_slow(pgd)
  29. #define check_pgt_cache() do { } while (0)
  30. /*
  31. * Allocate one PTE table.
  32. *
  33. * This actually allocates two hardware PTE tables, but we wrap this up
  34. * into one table thus:
  35. *
  36. * +------------+
  37. * | h/w pt 0 |
  38. * +------------+
  39. * | h/w pt 1 |
  40. * +------------+
  41. * | Linux pt 0 |
  42. * +------------+
  43. * | Linux pt 1 |
  44. * +------------+
  45. */
  46. static inline pte_t *
  47. pte_alloc_one_kernel(struct mm_struct *mm, unsigned long addr)
  48. {
  49. pte_t *pte;
  50. pte = (pte_t *)__get_free_page(GFP_KERNEL|__GFP_REPEAT|__GFP_ZERO);
  51. if (pte) {
  52. clean_dcache_area(pte, sizeof(pte_t) * PTRS_PER_PTE);
  53. pte += PTRS_PER_PTE;
  54. }
  55. return pte;
  56. }
  57. static inline struct page *
  58. pte_alloc_one(struct mm_struct *mm, unsigned long addr)
  59. {
  60. struct page *pte;
  61. pte = alloc_pages(GFP_KERNEL|__GFP_REPEAT|__GFP_ZERO, 0);
  62. if (pte) {
  63. void *page = page_address(pte);
  64. clean_dcache_area(page, sizeof(pte_t) * PTRS_PER_PTE);
  65. }
  66. return pte;
  67. }
  68. /*
  69. * Free one PTE table.
  70. */
  71. static inline void pte_free_kernel(pte_t *pte)
  72. {
  73. if (pte) {
  74. pte -= PTRS_PER_PTE;
  75. free_page((unsigned long)pte);
  76. }
  77. }
  78. static inline void pte_free(struct page *pte)
  79. {
  80. __free_page(pte);
  81. }
  82. static inline void __pmd_populate(pmd_t *pmdp, unsigned long pmdval)
  83. {
  84. pmdp[0] = __pmd(pmdval);
  85. pmdp[1] = __pmd(pmdval + 256 * sizeof(pte_t));
  86. flush_pmd_entry(pmdp);
  87. }
  88. /*
  89. * Populate the pmdp entry with a pointer to the pte. This pmd is part
  90. * of the mm address space.
  91. *
  92. * Ensure that we always set both PMD entries.
  93. */
  94. static inline void
  95. pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmdp, pte_t *ptep)
  96. {
  97. unsigned long pte_ptr = (unsigned long)ptep;
  98. /*
  99. * The pmd must be loaded with the physical
  100. * address of the PTE table
  101. */
  102. pte_ptr -= PTRS_PER_PTE * sizeof(void *);
  103. __pmd_populate(pmdp, __pa(pte_ptr) | _PAGE_KERNEL_TABLE);
  104. }
  105. static inline void
  106. pmd_populate(struct mm_struct *mm, pmd_t *pmdp, struct page *ptep)
  107. {
  108. __pmd_populate(pmdp, page_to_pfn(ptep) << PAGE_SHIFT | _PAGE_USER_TABLE);
  109. }
  110. #endif