pgalloc.h 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. #ifndef _PPC64_PGALLOC_H
  2. #define _PPC64_PGALLOC_H
  3. #include <linux/mm.h>
  4. #include <linux/slab.h>
  5. #include <linux/cpumask.h>
  6. #include <linux/percpu.h>
  7. extern kmem_cache_t *pgtable_cache[];
  8. #define PTE_CACHE_NUM 0
  9. #define PMD_CACHE_NUM 1
  10. #define PUD_CACHE_NUM 1
  11. #define PGD_CACHE_NUM 0
  12. /*
  13. * This program is free software; you can redistribute it and/or
  14. * modify it under the terms of the GNU General Public License
  15. * as published by the Free Software Foundation; either version
  16. * 2 of the License, or (at your option) any later version.
  17. */
  18. static inline pgd_t *pgd_alloc(struct mm_struct *mm)
  19. {
  20. return kmem_cache_alloc(pgtable_cache[PGD_CACHE_NUM], GFP_KERNEL);
  21. }
  22. static inline void pgd_free(pgd_t *pgd)
  23. {
  24. kmem_cache_free(pgtable_cache[PGD_CACHE_NUM], pgd);
  25. }
  26. #define pgd_populate(MM, PGD, PUD) pgd_set(PGD, PUD)
  27. static inline pud_t *pud_alloc_one(struct mm_struct *mm, unsigned long addr)
  28. {
  29. return kmem_cache_alloc(pgtable_cache[PUD_CACHE_NUM],
  30. GFP_KERNEL|__GFP_REPEAT);
  31. }
  32. static inline void pud_free(pud_t *pud)
  33. {
  34. kmem_cache_free(pgtable_cache[PUD_CACHE_NUM], pud);
  35. }
  36. #define pud_populate(MM, PUD, PMD) pud_set(PUD, PMD)
  37. static inline pmd_t *pmd_alloc_one(struct mm_struct *mm, unsigned long addr)
  38. {
  39. return kmem_cache_alloc(pgtable_cache[PMD_CACHE_NUM],
  40. GFP_KERNEL|__GFP_REPEAT);
  41. }
  42. static inline void pmd_free(pmd_t *pmd)
  43. {
  44. kmem_cache_free(pgtable_cache[PMD_CACHE_NUM], pmd);
  45. }
  46. #define pmd_populate_kernel(mm, pmd, pte) pmd_set(pmd, pte)
  47. #define pmd_populate(mm, pmd, pte_page) \
  48. pmd_populate_kernel(mm, pmd, page_address(pte_page))
  49. static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm, unsigned long address)
  50. {
  51. return kmem_cache_alloc(pgtable_cache[PTE_CACHE_NUM],
  52. GFP_KERNEL|__GFP_REPEAT);
  53. }
  54. static inline struct page *pte_alloc_one(struct mm_struct *mm, unsigned long address)
  55. {
  56. return virt_to_page(pte_alloc_one_kernel(mm, address));
  57. }
  58. static inline void pte_free_kernel(pte_t *pte)
  59. {
  60. kmem_cache_free(pgtable_cache[PTE_CACHE_NUM], pte);
  61. }
  62. static inline void pte_free(struct page *ptepage)
  63. {
  64. pte_free_kernel(page_address(ptepage));
  65. }
  66. #define PGF_CACHENUM_MASK 0xf
  67. typedef struct pgtable_free {
  68. unsigned long val;
  69. } pgtable_free_t;
  70. static inline pgtable_free_t pgtable_free_cache(void *p, int cachenum,
  71. unsigned long mask)
  72. {
  73. BUG_ON(cachenum > PGF_CACHENUM_MASK);
  74. return (pgtable_free_t){.val = ((unsigned long) p & ~mask) | cachenum};
  75. }
  76. static inline void pgtable_free(pgtable_free_t pgf)
  77. {
  78. void *p = (void *)(pgf.val & ~PGF_CACHENUM_MASK);
  79. int cachenum = pgf.val & PGF_CACHENUM_MASK;
  80. kmem_cache_free(pgtable_cache[cachenum], p);
  81. }
  82. void pgtable_free_tlb(struct mmu_gather *tlb, pgtable_free_t pgf);
  83. #define __pte_free_tlb(tlb, ptepage) \
  84. pgtable_free_tlb(tlb, pgtable_free_cache(page_address(ptepage), \
  85. PTE_CACHE_NUM, PTE_TABLE_SIZE-1))
  86. #define __pmd_free_tlb(tlb, pmd) \
  87. pgtable_free_tlb(tlb, pgtable_free_cache(pmd, \
  88. PMD_CACHE_NUM, PMD_TABLE_SIZE-1))
  89. #define __pud_free_tlb(tlb, pmd) \
  90. pgtable_free_tlb(tlb, pgtable_free_cache(pud, \
  91. PUD_CACHE_NUM, PUD_TABLE_SIZE-1))
  92. #define check_pgt_cache() do { } while (0)
  93. #endif /* _PPC64_PGALLOC_H */