1 #ifndef __ASM_SH_PGALLOC_H
2 #define __ASM_SH_PGALLOC_H
4 #include <linux/quicklist.h>
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 */
10 static inline void pmd_populate_kernel(struct mm_struct
*mm
, pmd_t
*pmd
,
13 set_pmd(pmd
, __pmd((unsigned long)pte
));
16 static inline void pmd_populate(struct mm_struct
*mm
, pmd_t
*pmd
,
19 set_pmd(pmd
, __pmd((unsigned long)page_address(pte
)));
22 static inline void pgd_ctor(void *x
)
26 memcpy(pgd
+ USER_PTRS_PER_PGD
,
27 swapper_pg_dir
+ USER_PTRS_PER_PGD
,
28 (PTRS_PER_PGD
- USER_PTRS_PER_PGD
) * sizeof(pgd_t
));
32 * Allocate and free page tables.
34 static inline pgd_t
*pgd_alloc(struct mm_struct
*mm
)
36 return quicklist_alloc(QUICK_PGD
, GFP_KERNEL
| __GFP_REPEAT
, pgd_ctor
);
39 static inline void pgd_free(struct mm_struct
*mm
, pgd_t
*pgd
)
41 quicklist_free(QUICK_PGD
, NULL
, pgd
);
44 static inline pte_t
*pte_alloc_one_kernel(struct mm_struct
*mm
,
45 unsigned long address
)
47 return quicklist_alloc(QUICK_PT
, GFP_KERNEL
| __GFP_REPEAT
, NULL
);
50 static inline struct page
*pte_alloc_one(struct mm_struct
*mm
,
51 unsigned long address
)
53 void *pg
= quicklist_alloc(QUICK_PT
, GFP_KERNEL
| __GFP_REPEAT
, NULL
);
54 return pg
? virt_to_page(pg
) : NULL
;
57 static inline void pte_free_kernel(struct mm_struct
*mm
, pte_t
*pte
)
59 quicklist_free(QUICK_PT
, NULL
, pte
);
62 static inline void pte_free(struct mm_struct
*mm
, struct page
*pte
)
64 quicklist_free_page(QUICK_PT
, NULL
, pte
);
67 #define __pte_free_tlb(tlb,pte) tlb_remove_page((tlb),(pte))
70 * allocating and freeing a pmd is trivial: the 1-entry pmd is
71 * inside the pgd, so has no extra memory associated with it.
74 #define pmd_free(mm, x) do { } while (0)
75 #define __pmd_free_tlb(tlb,x) do { } while (0)
77 static inline void check_pgt_cache(void)
79 quicklist_trim(QUICK_PGD
, NULL
, 25, 16);
80 quicklist_trim(QUICK_PT
, NULL
, 25, 16);
83 #endif /* __ASM_SH_PGALLOC_H */