2005-04-16 15:20:36 -07:00
|
|
|
#ifndef __ASM_SYSTEM_H
|
|
|
|
#define __ASM_SYSTEM_H
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <asm/segment.h>
|
|
|
|
#include <asm/cpufeature.h>
|
2007-05-08 00:35:02 -07:00
|
|
|
#include <asm/cmpxchg.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
2007-10-16 23:30:12 -07:00
|
|
|
#define AT_VECTOR_SIZE_ARCH 2 /* entries in ARCH_DLINFO */
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
struct task_struct; /* one of the stranger aspects of C forward declarations.. */
|
|
|
|
extern struct task_struct * FASTCALL(__switch_to(struct task_struct *prev, struct task_struct *next));
|
|
|
|
|
2006-09-18 16:20:40 -07:00
|
|
|
/*
|
|
|
|
* Saving eflags is important. It switches not only IOPL between tasks,
|
|
|
|
* it also protects other tasks from NT leaking through sysenter etc.
|
|
|
|
*/
|
2005-04-16 15:20:36 -07:00
|
|
|
#define switch_to(prev,next,last) do { \
|
|
|
|
unsigned long esi,edi; \
|
2006-09-18 16:20:40 -07:00
|
|
|
asm volatile("pushfl\n\t" /* Save flags */ \
|
|
|
|
"pushl %%ebp\n\t" \
|
2005-04-16 15:20:36 -07:00
|
|
|
"movl %%esp,%0\n\t" /* save ESP */ \
|
|
|
|
"movl %5,%%esp\n\t" /* restore ESP */ \
|
|
|
|
"movl $1f,%1\n\t" /* save EIP */ \
|
|
|
|
"pushl %6\n\t" /* restore EIP */ \
|
|
|
|
"jmp __switch_to\n" \
|
|
|
|
"1:\t" \
|
|
|
|
"popl %%ebp\n\t" \
|
2006-09-18 16:20:40 -07:00
|
|
|
"popfl" \
|
2005-04-16 15:20:36 -07:00
|
|
|
:"=m" (prev->thread.esp),"=m" (prev->thread.eip), \
|
|
|
|
"=a" (last),"=S" (esi),"=D" (edi) \
|
|
|
|
:"m" (next->thread.esp),"m" (next->thread.eip), \
|
|
|
|
"2" (prev), "d" (next)); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define _set_base(addr,base) do { unsigned long __pr; \
|
|
|
|
__asm__ __volatile__ ("movw %%dx,%1\n\t" \
|
|
|
|
"rorl $16,%%edx\n\t" \
|
|
|
|
"movb %%dl,%2\n\t" \
|
|
|
|
"movb %%dh,%3" \
|
|
|
|
:"=&d" (__pr) \
|
|
|
|
:"m" (*((addr)+2)), \
|
|
|
|
"m" (*((addr)+4)), \
|
|
|
|
"m" (*((addr)+7)), \
|
|
|
|
"0" (base) \
|
|
|
|
); } while(0)
|
|
|
|
|
|
|
|
#define _set_limit(addr,limit) do { unsigned long __lr; \
|
|
|
|
__asm__ __volatile__ ("movw %%dx,%1\n\t" \
|
|
|
|
"rorl $16,%%edx\n\t" \
|
|
|
|
"movb %2,%%dh\n\t" \
|
|
|
|
"andb $0xf0,%%dh\n\t" \
|
|
|
|
"orb %%dh,%%dl\n\t" \
|
|
|
|
"movb %%dl,%2" \
|
|
|
|
:"=&d" (__lr) \
|
|
|
|
:"m" (*(addr)), \
|
|
|
|
"m" (*((addr)+6)), \
|
|
|
|
"0" (limit) \
|
|
|
|
); } while(0)
|
|
|
|
|
|
|
|
#define set_base(ldt,base) _set_base( ((char *)&(ldt)) , (base) )
|
[PATCH] x86: Pnp byte granularity
The one remaining caller of set_limit, the PnP BIOS code, calls into the PnP
BIOS, passing kernel parameters in and out. These parameteres may be passed
from arbitrary kernel virtual memory, so they deserve strict protection to
stop a bad BIOS from smashing beyond the object size.
Unfortunately, the use of set_limit was badly botching this by setting the
limit in terms of pages, when it really should have byte granularity.
When doing this, I discovered my BIOS had the buggy code during the "get
system device node" call:
mov ax, es:[bx]
Which is harmless, but has a trivial workaround.
Signed-off-by: Zachary Amsden <zach@vmware.com>
Cc: "Seth, Rohit" <rohit.seth@intel.com>
Cc: Stephen Rothwell <sfr@canb.auug.org.au>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-01-06 01:11:55 -07:00
|
|
|
#define set_limit(ldt,limit) _set_limit( ((char *)&(ldt)) , ((limit)-1) )
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Load a segment. Fall back on loading the zero
|
|
|
|
* segment if something goes wrong..
|
|
|
|
*/
|
|
|
|
#define loadsegment(seg,value) \
|
|
|
|
asm volatile("\n" \
|
|
|
|
"1:\t" \
|
[PATCH] i386/x86_64 segment register access update
The new i386/x86_64 assemblers no longer accept instructions for moving
between a segment register and a 32bit memory location, i.e.,
movl (%eax),%ds
movl %ds,(%eax)
To generate instructions for moving between a segment register and a
16bit memory location without the 16bit operand size prefix, 0x66,
mov (%eax),%ds
mov %ds,(%eax)
should be used. It will work with both new and old assemblers. The
assembler starting from 2.16.90.0.1 will also support
movw (%eax),%ds
movw %ds,(%eax)
without the 0x66 prefix. I am enclosing patches for 2.4 and 2.6 kernels
here. The resulting kernel binaries should be unchanged as before, with
old and new assemblers, if gcc never generates memory access for
unsigned gsindex;
asm volatile("movl %%gs,%0" : "=g" (gsindex));
If gcc does generate memory access for the code above, the upper bits
in gsindex are undefined and the new assembler doesn't allow it.
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-05-01 08:58:48 -07:00
|
|
|
"mov %0,%%" #seg "\n" \
|
2005-04-16 15:20:36 -07:00
|
|
|
"2:\n" \
|
|
|
|
".section .fixup,\"ax\"\n" \
|
|
|
|
"3:\t" \
|
|
|
|
"pushl $0\n\t" \
|
|
|
|
"popl %%" #seg "\n\t" \
|
|
|
|
"jmp 2b\n" \
|
|
|
|
".previous\n" \
|
|
|
|
".section __ex_table,\"a\"\n\t" \
|
|
|
|
".align 4\n\t" \
|
|
|
|
".long 1b,3b\n" \
|
|
|
|
".previous" \
|
2005-09-03 15:56:38 -07:00
|
|
|
: :"rm" (value))
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Save a segment register away
|
|
|
|
*/
|
|
|
|
#define savesegment(seg, value) \
|
2005-09-03 15:56:38 -07:00
|
|
|
asm volatile("mov %%" #seg ",%0":"=rm" (value))
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2007-05-02 10:27:10 -07:00
|
|
|
|
|
|
|
static inline void native_clts(void)
|
|
|
|
{
|
|
|
|
asm volatile ("clts");
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long native_read_cr0(void)
|
|
|
|
{
|
|
|
|
unsigned long val;
|
|
|
|
asm volatile("movl %%cr0,%0\n\t" :"=r" (val));
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_write_cr0(unsigned long val)
|
|
|
|
{
|
|
|
|
asm volatile("movl %0,%%cr0": :"r" (val));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long native_read_cr2(void)
|
|
|
|
{
|
|
|
|
unsigned long val;
|
|
|
|
asm volatile("movl %%cr2,%0\n\t" :"=r" (val));
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_write_cr2(unsigned long val)
|
|
|
|
{
|
|
|
|
asm volatile("movl %0,%%cr2": :"r" (val));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long native_read_cr3(void)
|
|
|
|
{
|
|
|
|
unsigned long val;
|
|
|
|
asm volatile("movl %%cr3,%0\n\t" :"=r" (val));
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_write_cr3(unsigned long val)
|
|
|
|
{
|
|
|
|
asm volatile("movl %0,%%cr3": :"r" (val));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long native_read_cr4(void)
|
|
|
|
{
|
|
|
|
unsigned long val;
|
|
|
|
asm volatile("movl %%cr4,%0\n\t" :"=r" (val));
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long native_read_cr4_safe(void)
|
|
|
|
{
|
|
|
|
unsigned long val;
|
|
|
|
/* This could fault if %cr4 does not exist */
|
2007-10-17 09:04:33 -07:00
|
|
|
asm volatile("1: movl %%cr4, %0 \n"
|
2007-05-02 10:27:10 -07:00
|
|
|
"2: \n"
|
|
|
|
".section __ex_table,\"a\" \n"
|
|
|
|
".long 1b,2b \n"
|
|
|
|
".previous \n"
|
|
|
|
: "=r" (val): "0" (0));
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_write_cr4(unsigned long val)
|
|
|
|
{
|
|
|
|
asm volatile("movl %0,%%cr4": :"r" (val));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_wbinvd(void)
|
|
|
|
{
|
|
|
|
asm volatile("wbinvd": : :"memory");
|
|
|
|
}
|
|
|
|
|
2007-10-17 09:04:37 -07:00
|
|
|
static inline void clflush(volatile void *__p)
|
|
|
|
{
|
|
|
|
asm volatile("clflush %0" : "+m" (*(char __force *)__p));
|
|
|
|
}
|
2007-05-02 10:27:10 -07:00
|
|
|
|
2006-12-06 18:14:07 -07:00
|
|
|
#ifdef CONFIG_PARAVIRT
|
|
|
|
#include <asm/paravirt.h>
|
|
|
|
#else
|
2007-05-02 10:27:10 -07:00
|
|
|
#define read_cr0() (native_read_cr0())
|
|
|
|
#define write_cr0(x) (native_write_cr0(x))
|
|
|
|
#define read_cr2() (native_read_cr2())
|
|
|
|
#define write_cr2(x) (native_write_cr2(x))
|
|
|
|
#define read_cr3() (native_read_cr3())
|
|
|
|
#define write_cr3(x) (native_write_cr3(x))
|
|
|
|
#define read_cr4() (native_read_cr4())
|
|
|
|
#define read_cr4_safe() (native_read_cr4_safe())
|
|
|
|
#define write_cr4(x) (native_write_cr4(x))
|
|
|
|
#define wbinvd() (native_wbinvd())
|
2006-12-06 18:14:07 -07:00
|
|
|
|
|
|
|
/* Clear the 'TS' bit */
|
2007-05-02 10:27:10 -07:00
|
|
|
#define clts() (native_clts())
|
|
|
|
|
2006-12-06 18:14:07 -07:00
|
|
|
#endif/* CONFIG_PARAVIRT */
|
|
|
|
|
|
|
|
/* Set the 'TS' bit */
|
2005-04-16 15:20:36 -07:00
|
|
|
#define stts() write_cr0(8 | read_cr0())
|
|
|
|
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
|
|
|
|
static inline unsigned long get_limit(unsigned long segment)
|
|
|
|
{
|
|
|
|
unsigned long __limit;
|
|
|
|
__asm__("lsll %1,%0"
|
|
|
|
:"=r" (__limit):"r" (segment));
|
|
|
|
return __limit+1;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define nop() __asm__ __volatile__ ("nop")
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Force strict CPU ordering.
|
|
|
|
* And yes, this is required on UP too when we're talking
|
|
|
|
* to devices.
|
|
|
|
*
|
|
|
|
* For now, "wmb()" doesn't actually do anything, as all
|
|
|
|
* Intel CPU's follow what Intel calls a *Processor Order*,
|
|
|
|
* in which all writes are seen in the program order even
|
|
|
|
* outside the CPU.
|
|
|
|
*
|
|
|
|
* I expect future Intel CPU's to have a weaker ordering,
|
|
|
|
* but I'd also expect them to finally get their act together
|
|
|
|
* and add some real memory barriers if so.
|
|
|
|
*
|
|
|
|
* Some non intel clones support out of order store. wmb() ceases to be a
|
|
|
|
* nop for these.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#define mb() alternative("lock; addl $0,0(%%esp)", "mfence", X86_FEATURE_XMM2)
|
|
|
|
#define rmb() alternative("lock; addl $0,0(%%esp)", "lfence", X86_FEATURE_XMM2)
|
2007-10-12 18:06:55 -07:00
|
|
|
#define wmb() alternative("lock; addl $0,0(%%esp)", "sfence", X86_FEATURE_XMM)
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
/**
|
|
|
|
* read_barrier_depends - Flush all pending reads that subsequents reads
|
|
|
|
* depend on.
|
|
|
|
*
|
|
|
|
* No data-dependent reads from memory-like regions are ever reordered
|
|
|
|
* over this barrier. All reads preceding this primitive are guaranteed
|
|
|
|
* to access memory (but not necessarily other CPUs' caches) before any
|
|
|
|
* reads following this primitive that depend on the data return by
|
|
|
|
* any of the preceding reads. This primitive is much lighter weight than
|
|
|
|
* rmb() on most CPUs, and is never heavier weight than is
|
|
|
|
* rmb().
|
|
|
|
*
|
|
|
|
* These ordering constraints are respected by both the local CPU
|
|
|
|
* and the compiler.
|
|
|
|
*
|
|
|
|
* Ordering is not guaranteed by anything other than these primitives,
|
|
|
|
* not even by data dependencies. See the documentation for
|
|
|
|
* memory_barrier() for examples and URLs to more information.
|
|
|
|
*
|
|
|
|
* For example, the following code would force ordering (the initial
|
|
|
|
* value of "a" is zero, "b" is one, and "p" is "&a"):
|
|
|
|
*
|
|
|
|
* <programlisting>
|
|
|
|
* CPU 0 CPU 1
|
|
|
|
*
|
|
|
|
* b = 2;
|
|
|
|
* memory_barrier();
|
|
|
|
* p = &b; q = p;
|
|
|
|
* read_barrier_depends();
|
|
|
|
* d = *q;
|
|
|
|
* </programlisting>
|
|
|
|
*
|
|
|
|
* because the read of "*q" depends on the read of "p" and these
|
|
|
|
* two reads are separated by a read_barrier_depends(). However,
|
|
|
|
* the following code, with the same initial values for "a" and "b":
|
|
|
|
*
|
|
|
|
* <programlisting>
|
|
|
|
* CPU 0 CPU 1
|
|
|
|
*
|
|
|
|
* a = 2;
|
|
|
|
* memory_barrier();
|
|
|
|
* b = 3; y = b;
|
|
|
|
* read_barrier_depends();
|
|
|
|
* x = a;
|
|
|
|
* </programlisting>
|
|
|
|
*
|
|
|
|
* does not enforce ordering, since there is no data dependency between
|
|
|
|
* the read of "a" and the read of "b". Therefore, on some CPUs, such
|
|
|
|
* as Alpha, "y" could be set to 3 and "x" to 0. Use rmb()
|
2006-06-26 09:35:02 -07:00
|
|
|
* in cases like this where there are no data dependencies.
|
2005-04-16 15:20:36 -07:00
|
|
|
**/
|
|
|
|
|
|
|
|
#define read_barrier_depends() do { } while(0)
|
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
#define smp_mb() mb()
|
x86: optimise barriers
According to latest memory ordering specification documents from Intel
and AMD, both manufacturers are committed to in-order loads from
cacheable memory for the x86 architecture. Hence, smp_rmb() may be a
simple barrier.
Also according to those documents, and according to existing practice in
Linux (eg. spin_unlock doesn't enforce ordering), stores to cacheable
memory are visible in program order too. Special string stores are safe
-- their constituent stores may be out of order, but they must complete
in order WRT surrounding stores. Nontemporal stores to WB memory can go
out of order, and so they should be fenced explicitly to make them
appear in-order WRT other stores. Hence, smp_wmb() may be a simple
barrier.
http://developer.intel.com/products/processor/manuals/318147.pdf
http://www.amd.com/us-en/assets/content_type/white_papers_and_tech_docs/24593.pdf
In userspace microbenchmarks on a core2 system, fence instructions range
anywhere from around 15 cycles to 50, which may not be totally
insignificant in performance critical paths (code size will go down
too).
However the primary motivation for this is to have the canonical barrier
implementation for x86 architecture.
smp_rmb on buggy pentium pros remains a locked op, which is apparently
required.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-12 18:07:38 -07:00
|
|
|
#ifdef CONFIG_X86_PPRO_FENCE
|
|
|
|
# define smp_rmb() rmb()
|
|
|
|
#else
|
|
|
|
# define smp_rmb() barrier()
|
|
|
|
#endif
|
2007-10-12 18:06:55 -07:00
|
|
|
#ifdef CONFIG_X86_OOSTORE
|
|
|
|
# define smp_wmb() wmb()
|
|
|
|
#else
|
|
|
|
# define smp_wmb() barrier()
|
|
|
|
#endif
|
2005-04-16 15:20:36 -07:00
|
|
|
#define smp_read_barrier_depends() read_barrier_depends()
|
2006-02-05 00:28:05 -07:00
|
|
|
#define set_mb(var, value) do { (void) xchg(&var, value); } while (0)
|
2005-04-16 15:20:36 -07:00
|
|
|
#else
|
|
|
|
#define smp_mb() barrier()
|
|
|
|
#define smp_rmb() barrier()
|
|
|
|
#define smp_wmb() barrier()
|
|
|
|
#define smp_read_barrier_depends() do { } while(0)
|
|
|
|
#define set_mb(var, value) do { var = value; barrier(); } while (0)
|
|
|
|
#endif
|
|
|
|
|
2006-07-03 00:24:43 -07:00
|
|
|
#include <linux/irqflags.h>
|
2005-04-16 15:20:36 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* disable hlt during certain critical i/o operations
|
|
|
|
*/
|
|
|
|
#define HAVE_DISABLE_HLT
|
|
|
|
void disable_hlt(void);
|
|
|
|
void enable_hlt(void);
|
|
|
|
|
|
|
|
extern int es7000_plat;
|
|
|
|
void cpu_idle_wait(void);
|
|
|
|
|
|
|
|
extern unsigned long arch_align_stack(unsigned long sp);
|
2006-03-23 03:59:32 -07:00
|
|
|
extern void free_init_pages(char *what, unsigned long begin, unsigned long end);
|
2005-04-16 15:20:36 -07:00
|
|
|
|
2006-03-24 04:15:57 -07:00
|
|
|
void default_idle(void);
|
2007-10-19 11:35:03 -07:00
|
|
|
void __show_registers(struct pt_regs *, int all);
|
2006-03-24 04:15:57 -07:00
|
|
|
|
2005-04-16 15:20:36 -07:00
|
|
|
#endif
|