1 #ifndef __ASM_SH_PGALLOC_H
2 #define __ASM_SH_PGALLOC_H
3
4 #include <linux/quicklist.h>
5 #include <asm/page.h>
6
7 #define QUICK_PGD 0 /* We preserve special mappings over free */
8 #define QUICK_PT 1 /* Other page table pages that are zero on free */
9
pmd_populate_kernel(struct mm_struct * mm,pmd_t * pmd,pte_t * pte)10 static inline void pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmd,
11 pte_t *pte)
12 {
13 set_pmd(pmd, __pmd((unsigned long)pte));
14 }
15
pmd_populate(struct mm_struct * mm,pmd_t * pmd,pgtable_t pte)16 static inline void pmd_populate(struct mm_struct *mm, pmd_t *pmd,
17 pgtable_t pte)
18 {
19 set_pmd(pmd, __pmd((unsigned long)page_address(pte)));
20 }
21 #define pmd_pgtable(pmd) pmd_page(pmd)
22
pgd_ctor(void * x)23 static inline void pgd_ctor(void *x)
24 {
25 pgd_t *pgd = x;
26
27 memcpy(pgd + USER_PTRS_PER_PGD,
28 swapper_pg_dir + USER_PTRS_PER_PGD,
29 (PTRS_PER_PGD - USER_PTRS_PER_PGD) * sizeof(pgd_t));
30 }
31
32 /*
33 * Allocate and free page tables.
34 */
pgd_alloc(struct mm_struct * mm)35 static inline pgd_t *pgd_alloc(struct mm_struct *mm)
36 {
37 return quicklist_alloc(QUICK_PGD, GFP_KERNEL | __GFP_REPEAT, pgd_ctor);
38 }
39
pgd_free(struct mm_struct * mm,pgd_t * pgd)40 static inline void pgd_free(struct mm_struct *mm, pgd_t *pgd)
41 {
42 quicklist_free(QUICK_PGD, NULL, pgd);
43 }
44
pte_alloc_one_kernel(struct mm_struct * mm,unsigned long address)45 static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm,
46 unsigned long address)
47 {
48 return quicklist_alloc(QUICK_PT, GFP_KERNEL | __GFP_REPEAT, NULL);
49 }
50
pte_alloc_one(struct mm_struct * mm,unsigned long address)51 static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
52 unsigned long address)
53 {
54 struct page *page;
55 void *pg;
56
57 pg = quicklist_alloc(QUICK_PT, GFP_KERNEL | __GFP_REPEAT, NULL);
58 if (!pg)
59 return NULL;
60 page = virt_to_page(pg);
61 pgtable_page_ctor(page);
62 return page;
63 }
64
pte_free_kernel(struct mm_struct * mm,pte_t * pte)65 static inline void pte_free_kernel(struct mm_struct *mm, pte_t *pte)
66 {
67 quicklist_free(QUICK_PT, NULL, pte);
68 }
69
pte_free(struct mm_struct * mm,pgtable_t pte)70 static inline void pte_free(struct mm_struct *mm, pgtable_t pte)
71 {
72 pgtable_page_dtor(pte);
73 quicklist_free_page(QUICK_PT, NULL, pte);
74 }
75
76 #define __pte_free_tlb(tlb,pte) \
77 do { \
78 pgtable_page_dtor(pte); \
79 tlb_remove_page((tlb), (pte)); \
80 } while (0)
81
82 /*
83 * allocating and freeing a pmd is trivial: the 1-entry pmd is
84 * inside the pgd, so has no extra memory associated with it.
85 */
86
87 #define pmd_free(mm, x) do { } while (0)
88 #define __pmd_free_tlb(tlb,x) do { } while (0)
89
check_pgt_cache(void)90 static inline void check_pgt_cache(void)
91 {
92 quicklist_trim(QUICK_PGD, NULL, 25, 16);
93 quicklist_trim(QUICK_PT, NULL, 25, 16);
94 }
95
96 #endif /* __ASM_SH_PGALLOC_H */
97