2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* CRIS pgtable.h - macros and functions to manipulate page tables.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _CRIS_PGTABLE_H
|
|
|
|
#define _CRIS_PGTABLE_H
|
|
|
|
|
2005-07-27 12:44:43 -06:00
|
|
|
#include <asm/page.h>
|
|
|
|
#include <asm-generic/pgtable-nopmd.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <asm/mmu.h>
|
|
|
|
#endif
|
2008-10-21 09:45:58 -06:00
|
|
|
#include <arch/pgtable.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The Linux memory management assumes a three-level page table setup. On
|
|
|
|
* CRIS, we use that, but "fold" the mid level into the top-level page
|
|
|
|
* table. Since the MMU TLB is software loaded through an interrupt, it
|
|
|
|
* supports any page table structure, so we could have used a three-level
|
|
|
|
* setup, but for the amounts of memory we normally use, a two-level is
|
|
|
|
* probably more efficient.
|
|
|
|
*
|
|
|
|
* This file contains the functions and defines necessary to modify and use
|
|
|
|
* the CRIS page table tree.
|
|
|
|
*/
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
extern void paging_init(void);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Certain architectures need to do special things when pte's
|
|
|
|
* within a page table are directly modified. Thus, the following
|
|
|
|
* hook is made available.
|
|
|
|
*/
|
|
|
|
#define set_pte(pteptr, pteval) ((*(pteptr)) = (pteval))
|
|
|
|
#define set_pte_at(mm,addr,ptep,pteval) set_pte(ptep,pteval)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* (pmds are folded into pgds so this doesn't get actually called,
|
|
|
|
* but the define is needed for a generic inline function.)
|
|
|
|
*/
|
|
|
|
#define set_pmd(pmdptr, pmdval) (*(pmdptr) = pmdval)
|
2005-07-27 12:44:43 -06:00
|
|
|
#define set_pgu(pudptr, pudval) (*(pudptr) = pudval)
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-07-27 12:44:43 -06:00
|
|
|
/* PGDIR_SHIFT determines the size of the area a second-level page table can
|
2005-04-16 16:20:36 -06:00
|
|
|
* map. It is equal to the page size times the number of PTE's that fit in
|
|
|
|
* a PMD page. A PTE is 4-bytes in CRIS. Hence the following number.
|
|
|
|
*/
|
|
|
|
|
2005-07-27 12:44:43 -06:00
|
|
|
#define PGDIR_SHIFT (PAGE_SHIFT + (PAGE_SHIFT-2))
|
2005-04-16 16:20:36 -06:00
|
|
|
#define PGDIR_SIZE (1UL << PGDIR_SHIFT)
|
|
|
|
#define PGDIR_MASK (~(PGDIR_SIZE-1))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* entries per page directory level: we use a two-level, so
|
|
|
|
* we don't really have any PMD directory physically.
|
|
|
|
* pointers are 4 bytes so we can use the page size and
|
|
|
|
* divide it by 4 (shift by 2).
|
|
|
|
*/
|
|
|
|
#define PTRS_PER_PTE (1UL << (PAGE_SHIFT-2))
|
|
|
|
#define PTRS_PER_PGD (1UL << (PAGE_SHIFT-2))
|
|
|
|
|
|
|
|
/* calculate how many PGD entries a user-level program can use
|
|
|
|
* the first mappable virtual address is 0
|
|
|
|
* (TASK_SIZE is the maximum virtual address space)
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define USER_PTRS_PER_PGD (TASK_SIZE/PGDIR_SIZE)
|
2005-04-19 14:29:23 -06:00
|
|
|
#define FIRST_USER_ADDRESS 0
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* zero page used for uninitialized stuff */
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
extern unsigned long empty_zero_page;
|
|
|
|
#define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* number of bits that fit into a memory pointer */
|
|
|
|
#define BITS_PER_PTR (8*sizeof(unsigned long))
|
|
|
|
|
|
|
|
/* to align the pointer to a pointer address */
|
|
|
|
#define PTR_MASK (~(sizeof(void*)-1))
|
|
|
|
|
|
|
|
/* sizeof(void*)==1<<SIZEOF_PTR_LOG2 */
|
|
|
|
/* 64-bit machines, beware! SRB. */
|
|
|
|
#define SIZEOF_PTR_LOG2 2
|
|
|
|
|
|
|
|
/* to find an entry in a page-table */
|
|
|
|
#define PAGE_PTR(address) \
|
|
|
|
((unsigned long)(address)>>(PAGE_SHIFT-SIZEOF_PTR_LOG2)&PTR_MASK&~PAGE_MASK)
|
|
|
|
|
|
|
|
/* to set the page-dir */
|
|
|
|
#define SET_PAGE_DIR(tsk,pgdir)
|
|
|
|
|
|
|
|
#define pte_none(x) (!pte_val(x))
|
|
|
|
#define pte_present(x) (pte_val(x) & _PAGE_PRESENT)
|
|
|
|
#define pte_clear(mm,addr,xp) do { pte_val(*(xp)) = 0; } while (0)
|
|
|
|
|
2005-07-27 12:44:43 -06:00
|
|
|
#define pmd_none(x) (!pmd_val(x))
|
2011-03-30 19:57:33 -06:00
|
|
|
/* by removing the _PAGE_KERNEL bit from the comparison, the same pmd_bad
|
2005-04-16 16:20:36 -06:00
|
|
|
* works for both _PAGE_TABLE and _KERNPG_TABLE pmd entries.
|
|
|
|
*/
|
|
|
|
#define pmd_bad(x) ((pmd_val(x) & (~PAGE_MASK & ~_PAGE_KERNEL)) != _PAGE_TABLE)
|
|
|
|
#define pmd_present(x) (pmd_val(x) & _PAGE_PRESENT)
|
|
|
|
#define pmd_clear(xp) do { pmd_val(*(xp)) = 0; } while (0)
|
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The following only work if pte_present() is true.
|
|
|
|
* Undefined behaviour if not..
|
|
|
|
*/
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline int pte_write(pte_t pte) { return pte_val(pte) & _PAGE_WRITE; }
|
|
|
|
static inline int pte_dirty(pte_t pte) { return pte_val(pte) & _PAGE_MODIFIED; }
|
|
|
|
static inline int pte_young(pte_t pte) { return pte_val(pte) & _PAGE_ACCESSED; }
|
|
|
|
static inline int pte_file(pte_t pte) { return pte_val(pte) & _PAGE_FILE; }
|
mm: introduce pte_special pte bit
s390 for one, cannot implement VM_MIXEDMAP with pfn_valid, due to their memory
model (which is more dynamic than most). Instead, they had proposed to
implement it with an additional path through vm_normal_page(), using a bit in
the pte to determine whether or not the page should be refcounted:
vm_normal_page()
{
...
if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
if (vma->vm_flags & VM_MIXEDMAP) {
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
#else
if (!pfn_valid(pfn))
return NULL;
#endif
goto out;
}
...
}
This is fine, however if we are allowed to use a bit in the pte to determine
refcountedness, we can use that to _completely_ replace all the vma based
schemes. So instead of adding more cases to the already complex vma-based
scheme, we can have a clearly seperate and simple pte-based scheme (and get
slightly better code generation in the process):
vm_normal_page()
{
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
return pte_page(pte);
#else
...
#endif
}
And finally, we may rather make this concept usable by any architecture rather
than making it s390 only, so implement a new type of pte state for this.
Unfortunately the old vma based code must stay, because some architectures may
not be able to spare pte bits. This makes vm_normal_page a little bit more
ugly than we would like, but the 2 cases are clearly seperate.
So introduce a pte_special pte state, and use it in mm/memory.c. It is
currently a noop for all architectures, so this doesn't actually result in any
compiled code changes to mm/memory.o.
BTW:
I haven't put vm_normal_page() into arch code as-per an earlier suggestion.
The reason is that, regardless of where vm_normal_page is actually
implemented, the *abstraction* is still exactly the same. Also, while it
depends on whether the architecture has pte_special or not, that is the
only two possible cases, and it really isn't an arch specific function --
the role of the arch code should be to provide primitive functions and
accessors with which to build the core code; pte_special does that. We do
not want architectures to know or care about vm_normal_page itself, and
we definitely don't want them being able to invent something new there
out of sight of mm/ code. If we made vm_normal_page an arch function, then
we have to make vm_insert_mixed (next patch) an arch function too. So I
don't think moving it to arch code fundamentally improves any abstractions,
while it does practically make the code more difficult to follow, for both
mm and arch developers, and easier to misuse.
[akpm@linux-foundation.org: build fix]
Signed-off-by: Nick Piggin <npiggin@suse.de>
Acked-by: Carsten Otte <cotte@de.ibm.com>
Cc: Jared Hulbert <jaredeh@gmail.com>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-04-28 03:13:00 -06:00
|
|
|
static inline int pte_special(pte_t pte) { return 0; }
|
2005-11-07 01:58:44 -07:00
|
|
|
|
|
|
|
static inline pte_t pte_wrprotect(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_val(pte) &= ~(_PAGE_WRITE | _PAGE_SILENT_WRITE);
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t pte_mkclean(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_val(pte) &= ~(_PAGE_MODIFIED | _PAGE_SILENT_WRITE);
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t pte_mkold(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_val(pte) &= ~(_PAGE_ACCESSED | _PAGE_SILENT_READ);
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t pte_mkwrite(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_val(pte) |= _PAGE_WRITE;
|
|
|
|
if (pte_val(pte) & _PAGE_MODIFIED)
|
|
|
|
pte_val(pte) |= _PAGE_SILENT_WRITE;
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t pte_mkdirty(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_val(pte) |= _PAGE_MODIFIED;
|
|
|
|
if (pte_val(pte) & _PAGE_WRITE)
|
|
|
|
pte_val(pte) |= _PAGE_SILENT_WRITE;
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t pte_mkyoung(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_val(pte) |= _PAGE_ACCESSED;
|
|
|
|
if (pte_val(pte) & _PAGE_READ)
|
|
|
|
{
|
|
|
|
pte_val(pte) |= _PAGE_SILENT_READ;
|
|
|
|
if ((pte_val(pte) & (_PAGE_WRITE | _PAGE_MODIFIED)) ==
|
|
|
|
(_PAGE_WRITE | _PAGE_MODIFIED))
|
|
|
|
pte_val(pte) |= _PAGE_SILENT_WRITE;
|
|
|
|
}
|
|
|
|
return pte;
|
|
|
|
}
|
mm: introduce pte_special pte bit
s390 for one, cannot implement VM_MIXEDMAP with pfn_valid, due to their memory
model (which is more dynamic than most). Instead, they had proposed to
implement it with an additional path through vm_normal_page(), using a bit in
the pte to determine whether or not the page should be refcounted:
vm_normal_page()
{
...
if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
if (vma->vm_flags & VM_MIXEDMAP) {
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
#else
if (!pfn_valid(pfn))
return NULL;
#endif
goto out;
}
...
}
This is fine, however if we are allowed to use a bit in the pte to determine
refcountedness, we can use that to _completely_ replace all the vma based
schemes. So instead of adding more cases to the already complex vma-based
scheme, we can have a clearly seperate and simple pte-based scheme (and get
slightly better code generation in the process):
vm_normal_page()
{
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
return pte_page(pte);
#else
...
#endif
}
And finally, we may rather make this concept usable by any architecture rather
than making it s390 only, so implement a new type of pte state for this.
Unfortunately the old vma based code must stay, because some architectures may
not be able to spare pte bits. This makes vm_normal_page a little bit more
ugly than we would like, but the 2 cases are clearly seperate.
So introduce a pte_special pte state, and use it in mm/memory.c. It is
currently a noop for all architectures, so this doesn't actually result in any
compiled code changes to mm/memory.o.
BTW:
I haven't put vm_normal_page() into arch code as-per an earlier suggestion.
The reason is that, regardless of where vm_normal_page is actually
implemented, the *abstraction* is still exactly the same. Also, while it
depends on whether the architecture has pte_special or not, that is the
only two possible cases, and it really isn't an arch specific function --
the role of the arch code should be to provide primitive functions and
accessors with which to build the core code; pte_special does that. We do
not want architectures to know or care about vm_normal_page itself, and
we definitely don't want them being able to invent something new there
out of sight of mm/ code. If we made vm_normal_page an arch function, then
we have to make vm_insert_mixed (next patch) an arch function too. So I
don't think moving it to arch code fundamentally improves any abstractions,
while it does practically make the code more difficult to follow, for both
mm and arch developers, and easier to misuse.
[akpm@linux-foundation.org: build fix]
Signed-off-by: Nick Piggin <npiggin@suse.de>
Acked-by: Carsten Otte <cotte@de.ibm.com>
Cc: Jared Hulbert <jaredeh@gmail.com>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-04-28 03:13:00 -06:00
|
|
|
static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Conversion functions: convert a page and protection to a page entry,
|
|
|
|
* and a page entry and page directory to the page they refer to.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* What actually goes as arguments to the various functions is less than
|
|
|
|
* obvious, but a rule of thumb is that struct page's goes as struct page *,
|
|
|
|
* really physical DRAM addresses are unsigned long's, and DRAM "virtual"
|
|
|
|
* addresses (the 0xc0xxxxxx's) goes as void *'s.
|
|
|
|
*/
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t __mk_pte(void * page, pgprot_t pgprot)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
pte_t pte;
|
|
|
|
/* the PTE needs a physical address */
|
|
|
|
pte_val(pte) = __pa(page) | pgprot_val(pgprot);
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define mk_pte(page, pgprot) __mk_pte(page_address(page), (pgprot))
|
|
|
|
|
|
|
|
#define mk_pte_phys(physpage, pgprot) \
|
|
|
|
({ \
|
|
|
|
pte_t __pte; \
|
|
|
|
\
|
|
|
|
pte_val(__pte) = (physpage) + pgprot_val(pgprot); \
|
|
|
|
__pte; \
|
|
|
|
})
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
|
2005-04-16 16:20:36 -06:00
|
|
|
{ pte_val(pte) = (pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot); return pte; }
|
|
|
|
|
2009-06-26 00:14:36 -06:00
|
|
|
#define pgprot_noncached(prot) __pgprot((pgprot_val(prot) | _PAGE_NO_CACHE))
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* pte_val refers to a page in the 0x4xxxxxxx physical DRAM interval
|
|
|
|
* __pte_page(pte_val) refers to the "virtual" DRAM interval
|
|
|
|
* pte_pagenr refers to the page-number counted starting from the virtual DRAM start
|
|
|
|
*/
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline unsigned long __pte_page(pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
/* the PTE contains a physical address */
|
|
|
|
return (unsigned long)__va(pte_val(pte) & PAGE_MASK);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define pte_pagenr(pte) ((__pte_page(pte) - PAGE_OFFSET) >> PAGE_SHIFT)
|
|
|
|
|
|
|
|
/* permanent address of a page */
|
|
|
|
|
|
|
|
#define __page_address(page) (PAGE_OFFSET + (((page) - mem_map) << PAGE_SHIFT))
|
|
|
|
#define pte_page(pte) (mem_map+pte_pagenr(pte))
|
|
|
|
|
|
|
|
/* only the pte's themselves need to point to physical DRAM (see above)
|
|
|
|
* the pagetable links are purely handled within the kernel SW and thus
|
|
|
|
* don't need the __pa and __va transformations.
|
|
|
|
*/
|
|
|
|
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline void pmd_set(pmd_t * pmdp, pte_t * ptep)
|
2005-04-16 16:20:36 -06:00
|
|
|
{ pmd_val(*pmdp) = _PAGE_TABLE | (unsigned long) ptep; }
|
|
|
|
|
|
|
|
#define pmd_page(pmd) (pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT))
|
2006-09-26 00:31:48 -06:00
|
|
|
#define pmd_page_vaddr(pmd) ((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* to find an entry in a page-table-directory. */
|
2005-07-27 12:44:43 -06:00
|
|
|
#define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1))
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* to find an entry in a page-table-directory */
|
2008-04-28 03:13:51 -06:00
|
|
|
static inline pgd_t * pgd_offset(const struct mm_struct *mm, unsigned long address)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
return mm->pgd + pgd_index(address);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* to find an entry in a kernel page-table-directory */
|
|
|
|
#define pgd_offset_k(address) pgd_offset(&init_mm, address)
|
|
|
|
|
|
|
|
/* Find an entry in the third-level page table.. */
|
|
|
|
#define __pte_offset(address) \
|
|
|
|
(((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
|
|
|
|
#define pte_offset_kernel(dir, address) \
|
2006-09-26 00:31:48 -06:00
|
|
|
((pte_t *) pmd_page_vaddr(*(dir)) + __pte_offset(address))
|
2005-04-16 16:20:36 -06:00
|
|
|
#define pte_offset_map(dir, address) \
|
|
|
|
((pte_t *)page_address(pmd_page(*(dir))) + __pte_offset(address))
|
|
|
|
|
|
|
|
#define pte_unmap(pte) do { } while (0)
|
|
|
|
#define pte_pfn(x) ((unsigned long)(__va((x).pte)) >> PAGE_SHIFT)
|
2008-01-21 07:49:43 -07:00
|
|
|
#define pfn_pte(pfn, prot) __pte(((pfn) << PAGE_SHIFT) | pgprot_val(prot))
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#define pte_ERROR(e) \
|
|
|
|
printk("%s:%d: bad pte %p(%08lx).\n", __FILE__, __LINE__, &(e), pte_val(e))
|
|
|
|
#define pgd_ERROR(e) \
|
|
|
|
printk("%s:%d: bad pgd %p(%08lx).\n", __FILE__, __LINE__, &(e), pgd_val(e))
|
|
|
|
|
|
|
|
|
|
|
|
extern pgd_t swapper_pg_dir[PTRS_PER_PGD]; /* defined in head.S */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* CRIS doesn't have any external MMU info: the kernel page
|
|
|
|
* tables contain all the necessary information.
|
|
|
|
*
|
|
|
|
* Actually I am not sure on what this could be used for.
|
|
|
|
*/
|
2005-11-07 01:58:44 -07:00
|
|
|
static inline void update_mmu_cache(struct vm_area_struct * vma,
|
MM: Pass a PTE pointer to update_mmu_cache() rather than the PTE itself
On VIVT ARM, when we have multiple shared mappings of the same file
in the same MM, we need to ensure that we have coherency across all
copies. We do this via make_coherent() by making the pages
uncacheable.
This used to work fine, until we allowed highmem with highpte - we
now have a page table which is mapped as required, and is not available
for modification via update_mmu_cache().
Ralf Beache suggested getting rid of the PTE value passed to
update_mmu_cache():
On MIPS update_mmu_cache() calls __update_tlb() which walks pagetables
to construct a pointer to the pte again. Passing a pte_t * is much
more elegant. Maybe we might even replace the pte argument with the
pte_t?
Ben Herrenschmidt would also like the pte pointer for PowerPC:
Passing the ptep in there is exactly what I want. I want that
-instead- of the PTE value, because I have issue on some ppc cases,
for I$/D$ coherency, where set_pte_at() may decide to mask out the
_PAGE_EXEC.
So, pass in the mapped page table pointer into update_mmu_cache(), and
remove the PTE value, updating all implementations and call sites to
suit.
Includes a fix from Stephen Rothwell:
sparc: fix fallout from update_mmu_cache API change
Signed-off-by: Stephen Rothwell <sfr@canb.auug.org.au>
Acked-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Signed-off-by: Russell King <rmk+kernel@arm.linux.org.uk>
2009-12-18 09:40:18 -07:00
|
|
|
unsigned long address, pte_t *ptep)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Encode and de-code a swap entry (must be !pte_none(e) && !pte_present(e)) */
|
|
|
|
/* Since the PAGE_PRESENT bit is bit 4, we can use the bits above */
|
|
|
|
|
|
|
|
#define __swp_type(x) (((x).val >> 5) & 0x7f)
|
|
|
|
#define __swp_offset(x) ((x).val >> 12)
|
|
|
|
#define __swp_entry(type, offset) ((swp_entry_t) { ((type) << 5) | ((offset) << 12) })
|
|
|
|
#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
|
|
|
|
#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
|
|
|
|
|
|
|
|
#define kern_addr_valid(addr) (1)
|
|
|
|
|
|
|
|
#include <asm-generic/pgtable.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No page table caches to initialise
|
|
|
|
*/
|
|
|
|
#define pgtable_cache_init() do { } while (0)
|
|
|
|
|
|
|
|
#define pte_to_pgoff(x) (pte_val(x) >> 6)
|
|
|
|
#define pgoff_to_pte(x) __pte(((x) << 6) | _PAGE_FILE)
|
|
|
|
|
2005-07-27 12:44:43 -06:00
|
|
|
typedef pte_t *pte_addr_t;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif /* __ASSEMBLY__ */
|
|
|
|
#endif /* _CRIS_PGTABLE_H */
|