[deliverable/linux.git] / include / asm-sh / pgalloc.h

#ifndef __ASM_SH_PGALLOC_H
#define __ASM_SH_PGALLOC_H

#include <linux/quicklist.h>
#include <asm/page.h>

#define QUICK_PGD 0	/* We preserve special mappings over free */
#define QUICK_PT 1	/* Other page table pages that are zero on free */

static inline void pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmd,
				       pte_t *pte)
{
	set_pmd(pmd, __pmd((unsigned long)pte));
}

static inline void pmd_populate(struct mm_struct *mm, pmd_t *pmd,
				pgtable_t pte)
{
	set_pmd(pmd, __pmd((unsigned long)page_address(pte)));
}
#define pmd_pgtable(pmd) pmd_page(pmd)

static inline void pgd_ctor(void *x)
{
	pgd_t *pgd = x;

	memcpy(pgd + USER_PTRS_PER_PGD,
	       swapper_pg_dir + USER_PTRS_PER_PGD,
	       (PTRS_PER_PGD - USER_PTRS_PER_PGD) * sizeof(pgd_t));
}

/*
 * Allocate and free page tables.
 */
static inline pgd_t *pgd_alloc(struct mm_struct *mm)
{
	return quicklist_alloc(QUICK_PGD, GFP_KERNEL | __GFP_REPEAT, pgd_ctor);
}

static inline void pgd_free(struct mm_struct *mm, pgd_t *pgd)
{
	quicklist_free(QUICK_PGD, NULL, pgd);
}

static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm,
					  unsigned long address)
{
	return quicklist_alloc(QUICK_PT, GFP_KERNEL | __GFP_REPEAT, NULL);
}

static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
					unsigned long address)
{
	struct page *page;
	void *pg;

	pg = quicklist_alloc(QUICK_PT, GFP_KERNEL | __GFP_REPEAT, NULL);
	if (!pg)
		return NULL;
	page = virt_to_page(pg);
	pgtable_page_ctor(page);
	return page;
}

static inline void pte_free_kernel(struct mm_struct *mm, pte_t *pte)
{
	quicklist_free(QUICK_PT, NULL, pte);
}

static inline void pte_free(struct mm_struct *mm, pgtable_t pte)
{
	pgtable_page_dtor(pte);
	quicklist_free_page(QUICK_PT, NULL, pte);
}

#define __pte_free_tlb(tlb,pte)				\
do {							\
	pgtable_page_dtor(pte);				\
	tlb_remove_page((tlb), (pte));			\
} while (0)

/*
 * allocating and freeing a pmd is trivial: the 1-entry pmd is
 * inside the pgd, so has no extra memory associated with it.
 */

#define pmd_free(mm, x)			do { } while (0)
#define __pmd_free_tlb(tlb,x)		do { } while (0)

static inline void check_pgt_cache(void)
{
	quicklist_trim(QUICK_PGD, NULL, 25, 16);
	quicklist_trim(QUICK_PT, NULL, 25, 16);
}

#endif /* __ASM_SH_PGALLOC_H */
Commit	Line	Data
1da177e4 LT	1	#ifndef __ASM_SH_PGALLOC_H
	2	#define __ASM_SH_PGALLOC_H
	3
5f8c9908 PM	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
99a596f9 SM	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	}
1da177e4 LT	15
1da177e4 LT	16	static inline void pmd_populate(struct mm_struct mm, pmd_t pmd,
2f569afd	17	pgtable_t pte)
1da177e4	18	{
99a596f9	19	set_pmd(pmd, __pmd((unsigned long)page_address(pte)));
1da177e4	20	}
2f569afd	21	#define pmd_pgtable(pmd) pmd_page(pmd)
1da177e4	22
5f8c9908 PM	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
1da177e4 LT	32	/*
	33	* Allocate and free page tables.
	34	*/
	35	static inline pgd_t pgd_alloc(struct mm_struct mm)
	36	{
5f8c9908	37	return quicklist_alloc(QUICK_PGD, GFP_KERNEL \| __GFP_REPEAT, pgd_ctor);
1da177e4 LT	38	}
1da177e4 LT	39
5e541973	40	static inline void pgd_free(struct mm_struct mm, pgd_t pgd)
1da177e4	41	{
5f8c9908	42	quicklist_free(QUICK_PGD, NULL, pgd);
1da177e4 LT	43	}
	44
	45	static inline pte_t pte_alloc_one_kernel(struct mm_struct mm,
	46	unsigned long address)
	47	{
1039b9a9	48	return quicklist_alloc(QUICK_PT, GFP_KERNEL \| __GFP_REPEAT, NULL);
1da177e4 LT	49	}
1da177e4 LT	50
2f569afd MS	51	static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
2f569afd MS	52	unsigned long address)
1da177e4	53	{
2f569afd MS	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;
1da177e4 LT	63	}
1da177e4 LT	64
5e541973	65	static inline void pte_free_kernel(struct mm_struct mm, pte_t pte)
1da177e4	66	{
5f8c9908	67	quicklist_free(QUICK_PT, NULL, pte);
1da177e4 LT	68	}
1da177e4 LT	69
2f569afd	70	static inline void pte_free(struct mm_struct *mm, pgtable_t pte)
1da177e4	71	{
2f569afd	72	pgtable_page_dtor(pte);
5f8c9908	73	quicklist_free_page(QUICK_PT, NULL, pte);
1da177e4 LT	74	}
1da177e4 LT	75
2f569afd MS	76	#define __pte_free_tlb(tlb,pte) \
	77	do { \
	78	pgtable_page_dtor(pte); \
	79	tlb_remove_page((tlb), (pte)); \
	80	} while (0)
1da177e4 LT	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
5e541973	87	#define pmd_free(mm, x) do { } while (0)
1da177e4	88	#define __pmd_free_tlb(tlb,x) do { } while (0)
5f8c9908 PM	89
	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	}
1da177e4	95
1da177e4	96	#endif /* __ASM_SH_PGALLOC_H */