2005-04-16 16:20:36 -06:00
|
|
|
#ifndef _I386_PGTABLE_3LEVEL_H
|
|
|
|
|
#define _I386_PGTABLE_3LEVEL_H
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Intel Physical Address Extension (PAE) Mode - three-level page
|
|
|
|
|
* tables on PPro+ CPUs.
|
|
|
|
|
*
|
|
|
|
|
* Copyright (C) 1999 Ingo Molnar <mingo@redhat.com>
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define pte_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pte %p(%08lx%08lx).\n", __FILE__, __LINE__, &(e), (e).pte_high, (e).pte_low)
|
|
|
|
|
#define pmd_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pmd %p(%016Lx).\n", __FILE__, __LINE__, &(e), pmd_val(e))
|
|
|
|
|
#define pgd_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pgd %p(%016Lx).\n", __FILE__, __LINE__, &(e), pgd_val(e))
|
|
|
|
|
|
2008-01-30 05:34:11 -07:00
|
|
|
|
|
|
|
|
static inline int pud_none(pud_t pud)
|
|
|
|
|
{
|
|
|
|
|
return pud_val(pud) == 0;
|
|
|
|
|
}
|
|
|
|
|
static inline int pud_bad(pud_t pud)
|
|
|
|
|
{
|
|
|
|
|
return (pud_val(pud) & ~(PTE_MASK | _KERNPG_TABLE | _PAGE_USER)) != 0;
|
|
|
|
|
}
|
|
|
|
|
static inline int pud_present(pud_t pud)
|
|
|
|
|
{
|
|
|
|
|
return pud_val(pud) & _PAGE_PRESENT;
|
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
|
/* Rules for using set_pte: the pte being assigned *must* be
|
|
|
|
|
* either not present or in a state where the hardware will
|
|
|
|
|
* not attempt to update the pte. In places where this is
|
|
|
|
|
* not possible, use pte_get_and_clear to obtain the old pte
|
|
|
|
|
* value and then use set_pte to update it. -ben
|
|
|
|
|
*/
|
2007-05-02 11:27:13 -06:00
|
|
|
static inline void native_set_pte(pte_t *ptep, pte_t pte)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
|
ptep->pte_high = pte.pte_high;
|
|
|
|
|
smp_wmb();
|
|
|
|
|
ptep->pte_low = pte.pte_low;
|
|
|
|
|
}
|
|
|
|
|
|
2006-10-01 00:29:36 -06:00
|
|
|
/*
|
|
|
|
|
* Since this is only called on user PTEs, and the page fault handler
|
|
|
|
|
* must handle the already racy situation of simultaneous page faults,
|
|
|
|
|
* we are justified in merely clearing the PTE present bit, followed
|
|
|
|
|
* by a set. The ordering here is important.
|
|
|
|
|
*/
|
2007-05-02 11:27:13 -06:00
|
|
|
static inline void native_set_pte_present(struct mm_struct *mm, unsigned long addr,
|
|
|
|
|
pte_t *ptep, pte_t pte)
|
2006-10-01 00:29:36 -06:00
|
|
|
{
|
|
|
|
|
ptep->pte_low = 0;
|
|
|
|
|
smp_wmb();
|
|
|
|
|
ptep->pte_high = pte.pte_high;
|
|
|
|
|
smp_wmb();
|
|
|
|
|
ptep->pte_low = pte.pte_low;
|
|
|
|
|
}
|
|
|
|
|
|
2007-05-02 11:27:13 -06:00
|
|
|
static inline void native_set_pte_atomic(pte_t *ptep, pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
set_64bit((unsigned long long *)(ptep),native_pte_val(pte));
|
|
|
|
|
}
|
|
|
|
|
static inline void native_set_pmd(pmd_t *pmdp, pmd_t pmd)
|
|
|
|
|
{
|
|
|
|
|
set_64bit((unsigned long long *)(pmdp),native_pmd_val(pmd));
|
|
|
|
|
}
|
|
|
|
|
static inline void native_set_pud(pud_t *pudp, pud_t pud)
|
|
|
|
|
{
|
2008-01-30 05:34:11 -07:00
|
|
|
set_64bit((unsigned long long *)(pudp),native_pud_val(pud));
|
2007-05-02 11:27:13 -06:00
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
[PATCH] x86/PAE: Fix pte_clear for the >4GB RAM case
Proposed fix for ptep_get_and_clear_full PAE bug. Pte_clear had the same bug,
so use the same fix for both. Turns out pmd_clear had it as well, but pgds
are not affected.
The problem is rather intricate. Page table entries in PAE mode are 64-bits
wide, but the only atomic 8-byte write operation available in 32-bit mode is
cmpxchg8b, which is expensive (at least on P4), and thus avoided. But it can
happen that the processor may prefetch entries into the TLB in the middle of an
operation which clears a page table entry. So one must always clear the P-bit
in the low word of the page table entry first when clearing it.
Since the sequence *ptep = __pte(0) leaves the order of the write dependent on
the compiler, it must be coded explicitly as a clear of the low word followed
by a clear of the high word. Further, there must be a write memory barrier
here to enforce proper ordering by the compiler (and, in the future, by the
processor as well).
On > 4GB memory machines, the implementation of pte_clear for PAE was clearly
deficient, as it could leave virtual mappings of physical memory above 4GB
aliased to memory below 4GB in the TLB. The implementation of
ptep_get_and_clear_full has a similar bug, although not nearly as likely to
occur, since the mappings being cleared are in the process of being destroyed,
and should never be dereferenced again.
But, as luck would have it, it is possible to trigger bugs even without ever
dereferencing these bogus TLB mappings, even if the clear is followed fairly
soon after with a TLB flush or invalidation. The problem is that memory above
4GB may now be aliased into the first 4GB of memory, and in fact, may hit a
region of memory with non-memory semantics. These regions include AGP and PCI
space. As such, these memory regions are not cached by the processor. This
introduces the bug.
The processor can speculate memory operations, including memory writes, as long
as they are committed with the proper ordering. Speculating a memory write to
a linear address that has a bogus TLB mapping is possible. Normally, the
speculation is harmless. But for cached memory, it does leave the falsely
speculated cacheline unmodified, but in a dirty state. This cache line will be
eventually written back. If this cacheline happens to intersect a region of
memory that is not protected by the cache coherency protocol, it can corrupt
data in I/O memory, which is generally a very bad thing to do, and can cause
total system failure or just plain undefined behavior.
These bugs are extremely unlikely, but the severity is of such magnitude, and
the fix so simple that I think fixing them immediately is justified. Also,
they are nearly impossible to debug.
Signed-off-by: Zachary Amsden <zach@vmware.com>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-27 12:32:29 -06:00
|
|
|
/*
|
|
|
|
|
* For PTEs and PDEs, we must clear the P-bit first when clearing a page table
|
|
|
|
|
* entry, so clear the bottom half first and enforce ordering with a compiler
|
|
|
|
|
* barrier.
|
|
|
|
|
*/
|
2007-05-02 11:27:13 -06:00
|
|
|
static inline void native_pte_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
|
[PATCH] x86/PAE: Fix pte_clear for the >4GB RAM case
Proposed fix for ptep_get_and_clear_full PAE bug. Pte_clear had the same bug,
so use the same fix for both. Turns out pmd_clear had it as well, but pgds
are not affected.
The problem is rather intricate. Page table entries in PAE mode are 64-bits
wide, but the only atomic 8-byte write operation available in 32-bit mode is
cmpxchg8b, which is expensive (at least on P4), and thus avoided. But it can
happen that the processor may prefetch entries into the TLB in the middle of an
operation which clears a page table entry. So one must always clear the P-bit
in the low word of the page table entry first when clearing it.
Since the sequence *ptep = __pte(0) leaves the order of the write dependent on
the compiler, it must be coded explicitly as a clear of the low word followed
by a clear of the high word. Further, there must be a write memory barrier
here to enforce proper ordering by the compiler (and, in the future, by the
processor as well).
On > 4GB memory machines, the implementation of pte_clear for PAE was clearly
deficient, as it could leave virtual mappings of physical memory above 4GB
aliased to memory below 4GB in the TLB. The implementation of
ptep_get_and_clear_full has a similar bug, although not nearly as likely to
occur, since the mappings being cleared are in the process of being destroyed,
and should never be dereferenced again.
But, as luck would have it, it is possible to trigger bugs even without ever
dereferencing these bogus TLB mappings, even if the clear is followed fairly
soon after with a TLB flush or invalidation. The problem is that memory above
4GB may now be aliased into the first 4GB of memory, and in fact, may hit a
region of memory with non-memory semantics. These regions include AGP and PCI
space. As such, these memory regions are not cached by the processor. This
introduces the bug.
The processor can speculate memory operations, including memory writes, as long
as they are committed with the proper ordering. Speculating a memory write to
a linear address that has a bogus TLB mapping is possible. Normally, the
speculation is harmless. But for cached memory, it does leave the falsely
speculated cacheline unmodified, but in a dirty state. This cache line will be
eventually written back. If this cacheline happens to intersect a region of
memory that is not protected by the cache coherency protocol, it can corrupt
data in I/O memory, which is generally a very bad thing to do, and can cause
total system failure or just plain undefined behavior.
These bugs are extremely unlikely, but the severity is of such magnitude, and
the fix so simple that I think fixing them immediately is justified. Also,
they are nearly impossible to debug.
Signed-off-by: Zachary Amsden <zach@vmware.com>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-27 12:32:29 -06:00
|
|
|
{
|
|
|
|
|
ptep->pte_low = 0;
|
|
|
|
|
smp_wmb();
|
|
|
|
|
ptep->pte_high = 0;
|
|
|
|
|
}
|
|
|
|
|
|
2007-05-02 11:27:13 -06:00
|
|
|
static inline void native_pmd_clear(pmd_t *pmd)
|
[PATCH] x86/PAE: Fix pte_clear for the >4GB RAM case
Proposed fix for ptep_get_and_clear_full PAE bug. Pte_clear had the same bug,
so use the same fix for both. Turns out pmd_clear had it as well, but pgds
are not affected.
The problem is rather intricate. Page table entries in PAE mode are 64-bits
wide, but the only atomic 8-byte write operation available in 32-bit mode is
cmpxchg8b, which is expensive (at least on P4), and thus avoided. But it can
happen that the processor may prefetch entries into the TLB in the middle of an
operation which clears a page table entry. So one must always clear the P-bit
in the low word of the page table entry first when clearing it.
Since the sequence *ptep = __pte(0) leaves the order of the write dependent on
the compiler, it must be coded explicitly as a clear of the low word followed
by a clear of the high word. Further, there must be a write memory barrier
here to enforce proper ordering by the compiler (and, in the future, by the
processor as well).
On > 4GB memory machines, the implementation of pte_clear for PAE was clearly
deficient, as it could leave virtual mappings of physical memory above 4GB
aliased to memory below 4GB in the TLB. The implementation of
ptep_get_and_clear_full has a similar bug, although not nearly as likely to
occur, since the mappings being cleared are in the process of being destroyed,
and should never be dereferenced again.
But, as luck would have it, it is possible to trigger bugs even without ever
dereferencing these bogus TLB mappings, even if the clear is followed fairly
soon after with a TLB flush or invalidation. The problem is that memory above
4GB may now be aliased into the first 4GB of memory, and in fact, may hit a
region of memory with non-memory semantics. These regions include AGP and PCI
space. As such, these memory regions are not cached by the processor. This
introduces the bug.
The processor can speculate memory operations, including memory writes, as long
as they are committed with the proper ordering. Speculating a memory write to
a linear address that has a bogus TLB mapping is possible. Normally, the
speculation is harmless. But for cached memory, it does leave the falsely
speculated cacheline unmodified, but in a dirty state. This cache line will be
eventually written back. If this cacheline happens to intersect a region of
memory that is not protected by the cache coherency protocol, it can corrupt
data in I/O memory, which is generally a very bad thing to do, and can cause
total system failure or just plain undefined behavior.
These bugs are extremely unlikely, but the severity is of such magnitude, and
the fix so simple that I think fixing them immediately is justified. Also,
they are nearly impossible to debug.
Signed-off-by: Zachary Amsden <zach@vmware.com>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-27 12:32:29 -06:00
|
|
|
{
|
|
|
|
|
u32 *tmp = (u32 *)pmd;
|
|
|
|
|
*tmp = 0;
|
|
|
|
|
smp_wmb();
|
|
|
|
|
*(tmp + 1) = 0;
|
|
|
|
|
}
|
2007-05-02 11:27:13 -06:00
|
|
|
|
2008-01-30 05:34:11 -07:00
|
|
|
static inline void pud_clear(pud_t *pudp)
|
|
|
|
|
{
|
2008-02-04 08:48:02 -07:00
|
|
|
unsigned long pgd;
|
|
|
|
|
|
2008-01-30 05:34:11 -07:00
|
|
|
set_pud(pudp, __pud(0));
|
|
|
|
|
|
|
|
|
|
/*
|
2008-02-04 08:48:02 -07:00
|
|
|
* According to Intel App note "TLBs, Paging-Structure Caches,
|
|
|
|
|
* and Their Invalidation", April 2007, document 317080-001,
|
|
|
|
|
* section 8.1: in PAE mode we explicitly have to flush the
|
|
|
|
|
* TLB via cr3 if the top-level pgd is changed...
|
2008-01-30 05:34:11 -07:00
|
|
|
*
|
2008-02-04 08:48:02 -07:00
|
|
|
* Make sure the pud entry we're updating is within the
|
|
|
|
|
* current pgd to avoid unnecessary TLB flushes.
|
2008-01-30 05:34:11 -07:00
|
|
|
*/
|
2008-02-04 08:48:02 -07:00
|
|
|
pgd = read_cr3();
|
|
|
|
|
if (__pa(pudp) >= pgd && __pa(pudp) < (pgd + sizeof(pgd_t)*PTRS_PER_PGD))
|
|
|
|
|
write_cr3(pgd);
|
2008-01-30 05:34:11 -07:00
|
|
|
}
|
2006-12-06 18:14:08 -07:00
|
|
|
|
|
|
|
|
#define pud_page(pud) \
|
|
|
|
|
((struct page *) __va(pud_val(pud) & PAGE_MASK))
|
|
|
|
|
|
|
|
|
|
#define pud_page_vaddr(pud) \
|
|
|
|
|
((unsigned long) __va(pud_val(pud) & PAGE_MASK))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Find an entry in the second-level page table.. */
|
|
|
|
|
#define pmd_offset(pud, address) ((pmd_t *) pud_page(*(pud)) + \
|
|
|
|
|
pmd_index(address))
|
[PATCH] x86/PAE: Fix pte_clear for the >4GB RAM case
Proposed fix for ptep_get_and_clear_full PAE bug. Pte_clear had the same bug,
so use the same fix for both. Turns out pmd_clear had it as well, but pgds
are not affected.
The problem is rather intricate. Page table entries in PAE mode are 64-bits
wide, but the only atomic 8-byte write operation available in 32-bit mode is
cmpxchg8b, which is expensive (at least on P4), and thus avoided. But it can
happen that the processor may prefetch entries into the TLB in the middle of an
operation which clears a page table entry. So one must always clear the P-bit
in the low word of the page table entry first when clearing it.
Since the sequence *ptep = __pte(0) leaves the order of the write dependent on
the compiler, it must be coded explicitly as a clear of the low word followed
by a clear of the high word. Further, there must be a write memory barrier
here to enforce proper ordering by the compiler (and, in the future, by the
processor as well).
On > 4GB memory machines, the implementation of pte_clear for PAE was clearly
deficient, as it could leave virtual mappings of physical memory above 4GB
aliased to memory below 4GB in the TLB. The implementation of
ptep_get_and_clear_full has a similar bug, although not nearly as likely to
occur, since the mappings being cleared are in the process of being destroyed,
and should never be dereferenced again.
But, as luck would have it, it is possible to trigger bugs even without ever
dereferencing these bogus TLB mappings, even if the clear is followed fairly
soon after with a TLB flush or invalidation. The problem is that memory above
4GB may now be aliased into the first 4GB of memory, and in fact, may hit a
region of memory with non-memory semantics. These regions include AGP and PCI
space. As such, these memory regions are not cached by the processor. This
introduces the bug.
The processor can speculate memory operations, including memory writes, as long
as they are committed with the proper ordering. Speculating a memory write to
a linear address that has a bogus TLB mapping is possible. Normally, the
speculation is harmless. But for cached memory, it does leave the falsely
speculated cacheline unmodified, but in a dirty state. This cache line will be
eventually written back. If this cacheline happens to intersect a region of
memory that is not protected by the cache coherency protocol, it can corrupt
data in I/O memory, which is generally a very bad thing to do, and can cause
total system failure or just plain undefined behavior.
These bugs are extremely unlikely, but the severity is of such magnitude, and
the fix so simple that I think fixing them immediately is justified. Also,
they are nearly impossible to debug.
Signed-off-by: Zachary Amsden <zach@vmware.com>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-27 12:32:29 -06:00
|
|
|
|
2007-05-02 11:27:19 -06:00
|
|
|
#ifdef CONFIG_SMP
|
2007-05-02 11:27:13 -06:00
|
|
|
static inline pte_t native_ptep_get_and_clear(pte_t *ptep)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
|
pte_t res;
|
|
|
|
|
|
|
|
|
|
/* xchg acts as a barrier before the setting of the high bits */
|
|
|
|
|
res.pte_low = xchg(&ptep->pte_low, 0);
|
|
|
|
|
res.pte_high = ptep->pte_high;
|
|
|
|
|
ptep->pte_high = 0;
|
|
|
|
|
|
|
|
|
|
return res;
|
|
|
|
|
}
|
2007-05-02 11:27:19 -06:00
|
|
|
#else
|
|
|
|
|
#define native_ptep_get_and_clear(xp) native_local_ptep_get_and_clear(xp)
|
|
|
|
|
#endif
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-09-26 00:32:30 -06:00
|
|
|
#define __HAVE_ARCH_PTE_SAME
|
2005-04-16 16:20:36 -06:00
|
|
|
static inline int pte_same(pte_t a, pte_t b)
|
|
|
|
|
{
|
|
|
|
|
return a.pte_low == b.pte_low && a.pte_high == b.pte_high;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define pte_page(x) pfn_to_page(pte_pfn(x))
|
|
|
|
|
|
|
|
|
|
static inline int pte_none(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return !pte.pte_low && !pte.pte_high;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline unsigned long pte_pfn(pte_t pte)
|
|
|
|
|
{
|
2008-01-30 05:32:57 -07:00
|
|
|
return (pte_val(pte) & ~_PAGE_NX) >> PAGE_SHIFT;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Bits 0, 6 and 7 are taken in the low part of the pte,
|
|
|
|
|
* put the 32 bits of offset into the high part.
|
|
|
|
|
*/
|
|
|
|
|
#define pte_to_pgoff(pte) ((pte).pte_high)
|
2008-01-30 05:32:57 -07:00
|
|
|
#define pgoff_to_pte(off) ((pte_t) { { .pte_low = _PAGE_FILE, .pte_high = (off) } })
|
2005-04-16 16:20:36 -06:00
|
|
|
#define PTE_FILE_MAX_BITS 32
|
|
|
|
|
|
|
|
|
|
/* Encode and de-code a swap entry */
|
|
|
|
|
#define __swp_type(x) (((x).val) & 0x1f)
|
|
|
|
|
#define __swp_offset(x) ((x).val >> 5)
|
|
|
|
|
#define __swp_entry(type, offset) ((swp_entry_t){(type) | (offset) << 5})
|
|
|
|
|
#define __pte_to_swp_entry(pte) ((swp_entry_t){ (pte).pte_high })
|
2008-01-30 05:32:57 -07:00
|
|
|
#define __swp_entry_to_pte(x) ((pte_t){ { .pte_high = (x).val } })
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
|
#endif /* _I386_PGTABLE_3LEVEL_H */
|