2 * This file is subject to the terms and conditions of the GNU General Public
3 * License. See the file "COPYING" in the main directory of this archive
6 * Copyright (C) 1994, 95, 96, 97, 98, 99, 2003 by Ralf Baechle
7 * Copyright (C) 1996 by Paul M. Antoine
8 * Copyright (C) 1999 Silicon Graphics
9 * Kevin D. Kissell, kevink@mips.org and Carsten Langgaard, carstenl@mips.com
10 * Copyright (C) 2000 MIPS Technologies, Inc.
15 #include <linux/config.h>
16 #include <linux/types.h>
18 #include <asm/addrspace.h>
19 #include <asm/cpu-features.h>
21 #include <asm/ptrace.h>
23 #include <asm/interrupt.h>
26 * read_barrier_depends - Flush all pending reads that subsequents reads
29 * No data-dependent reads from memory-like regions are ever reordered
30 * over this barrier. All reads preceding this primitive are guaranteed
31 * to access memory (but not necessarily other CPUs' caches) before any
32 * reads following this primitive that depend on the data return by
33 * any of the preceding reads. This primitive is much lighter weight than
34 * rmb() on most CPUs, and is never heavier weight than is
37 * These ordering constraints are respected by both the local CPU
40 * Ordering is not guaranteed by anything other than these primitives,
41 * not even by data dependencies. See the documentation for
42 * memory_barrier() for examples and URLs to more information.
44 * For example, the following code would force ordering (the initial
45 * value of "a" is zero, "b" is one, and "p" is "&a"):
53 * read_barrier_depends();
57 * because the read of "*q" depends on the read of "p" and these
58 * two reads are separated by a read_barrier_depends(). However,
59 * the following code, with the same initial values for "a" and "b":
67 * read_barrier_depends();
71 * does not enforce ordering, since there is no data dependency between
72 * the read of "a" and the read of "b". Therefore, on some CPUs, such
73 * as Alpha, "y" could be set to 3 and "x" to 0. Use rmb()
74 * in cases like this where there are no data dependencies.
77 #define read_barrier_depends() do { } while(0)
79 #ifdef CONFIG_CPU_HAS_SYNC
81 __asm__ __volatile__( \
83 ".set noreorder\n\t" \
91 #define __sync() do { } while(0)
94 #define __fast_iob() \
95 __asm__ __volatile__( \
97 ".set noreorder\n\t" \
102 : "m" (*(int *)CKSEG1) \
105 #define fast_wmb() __sync()
106 #define fast_rmb() __sync()
107 #define fast_mb() __sync()
114 #ifdef CONFIG_CPU_HAS_WB
116 #include <asm/wbflush.h>
118 #define wmb() fast_wmb()
119 #define rmb() fast_rmb()
120 #define mb() wbflush()
121 #define iob() wbflush()
123 #else /* !CONFIG_CPU_HAS_WB */
125 #define wmb() fast_wmb()
126 #define rmb() fast_rmb()
127 #define mb() fast_mb()
128 #define iob() fast_iob()
130 #endif /* !CONFIG_CPU_HAS_WB */
133 #define smp_mb() mb()
134 #define smp_rmb() rmb()
135 #define smp_wmb() wmb()
136 #define smp_read_barrier_depends() read_barrier_depends()
138 #define smp_mb() barrier()
139 #define smp_rmb() barrier()
140 #define smp_wmb() barrier()
141 #define smp_read_barrier_depends() do { } while(0)
144 #define set_mb(var, value) \
145 do { var = value; mb(); } while (0)
147 #define set_wmb(var, value) \
148 do { var = value; wmb(); } while (0)
151 * switch_to(n) should switch tasks to task nr n, first
152 * checking that n isn't the current task, in which case it does nothing.
154 extern asmlinkage
void *resume(void *last
, void *next
, void *next_ti
);
158 #define switch_to(prev,next,last) \
162 (last) = resume(prev, next, task_thread_info(next)); \
164 __restore_dsp(current); \
168 * On SMP systems, when the scheduler does migration-cost autodetection,
169 * it needs a way to flush as much of the CPU's caches as possible.
171 * TODO: fill this in!
173 static inline void sched_cacheflush(void)
177 static inline unsigned long __xchg_u32(volatile int * m
, unsigned int val
)
181 if (cpu_has_llsc
&& R10000_LLSC_WAR
) {
184 __asm__
__volatile__(
186 "1: ll %0, %3 # xchg_u32 \n"
196 : "=&r" (retval
), "=m" (*m
), "=&r" (dummy
)
197 : "R" (*m
), "Jr" (val
)
199 } else if (cpu_has_llsc
) {
202 __asm__
__volatile__(
204 "1: ll %0, %3 # xchg_u32 \n"
214 : "=&r" (retval
), "=m" (*m
), "=&r" (dummy
)
215 : "R" (*m
), "Jr" (val
)
220 local_irq_save(flags
);
223 local_irq_restore(flags
); /* implies memory barrier */
230 static inline __u64
__xchg_u64(volatile __u64
* m
, __u64 val
)
234 if (cpu_has_llsc
&& R10000_LLSC_WAR
) {
237 __asm__
__volatile__(
239 "1: lld %0, %3 # xchg_u64 \n"
247 : "=&r" (retval
), "=m" (*m
), "=&r" (dummy
)
248 : "R" (*m
), "Jr" (val
)
250 } else if (cpu_has_llsc
) {
253 __asm__
__volatile__(
255 "1: lld %0, %3 # xchg_u64 \n"
263 : "=&r" (retval
), "=m" (*m
), "=&r" (dummy
)
264 : "R" (*m
), "Jr" (val
)
269 local_irq_save(flags
);
272 local_irq_restore(flags
); /* implies memory barrier */
278 extern __u64
__xchg_u64_unsupported_on_32bit_kernels(volatile __u64
* m
, __u64 val
);
279 #define __xchg_u64 __xchg_u64_unsupported_on_32bit_kernels
282 /* This function doesn't exist, so you'll get a linker error
283 if something tries to do an invalid xchg(). */
284 extern void __xchg_called_with_bad_pointer(void);
286 static inline unsigned long __xchg(unsigned long x
, volatile void * ptr
, int size
)
290 return __xchg_u32(ptr
, x
);
292 return __xchg_u64(ptr
, x
);
294 __xchg_called_with_bad_pointer();
298 #define xchg(ptr,x) ((__typeof__(*(ptr)))__xchg((unsigned long)(x),(ptr),sizeof(*(ptr))))
299 #define tas(ptr) (xchg((ptr),1))
301 #define __HAVE_ARCH_CMPXCHG 1
303 static inline unsigned long __cmpxchg_u32(volatile int * m
, unsigned long old
,
308 if (cpu_has_llsc
&& R10000_LLSC_WAR
) {
309 __asm__
__volatile__(
313 "1: ll %0, %2 # __cmpxchg_u32 \n"
314 " bne %0, %z3, 2f \n"
325 : "=&r" (retval
), "=m" (*m
)
326 : "R" (*m
), "Jr" (old
), "Jr" (new)
328 } else if (cpu_has_llsc
) {
329 __asm__
__volatile__(
333 "1: ll %0, %2 # __cmpxchg_u32 \n"
334 " bne %0, %z3, 2f \n"
345 : "=&r" (retval
), "=m" (*m
)
346 : "R" (*m
), "Jr" (old
), "Jr" (new)
351 local_irq_save(flags
);
355 local_irq_restore(flags
); /* implies memory barrier */
362 static inline unsigned long __cmpxchg_u64(volatile int * m
, unsigned long old
,
368 __asm__
__volatile__(
372 "1: lld %0, %2 # __cmpxchg_u64 \n"
373 " bne %0, %z3, 2f \n"
382 : "=&r" (retval
), "=m" (*m
)
383 : "R" (*m
), "Jr" (old
), "Jr" (new)
385 } else if (cpu_has_llsc
) {
386 __asm__
__volatile__(
390 "1: lld %0, %2 # __cmpxchg_u64 \n"
391 " bne %0, %z3, 2f \n"
400 : "=&r" (retval
), "=m" (*m
)
401 : "R" (*m
), "Jr" (old
), "Jr" (new)
406 local_irq_save(flags
);
410 local_irq_restore(flags
); /* implies memory barrier */
416 extern unsigned long __cmpxchg_u64_unsupported_on_32bit_kernels(
417 volatile int * m
, unsigned long old
, unsigned long new);
418 #define __cmpxchg_u64 __cmpxchg_u64_unsupported_on_32bit_kernels
421 /* This function doesn't exist, so you'll get a linker error
422 if something tries to do an invalid cmpxchg(). */
423 extern void __cmpxchg_called_with_bad_pointer(void);
425 static inline unsigned long __cmpxchg(volatile void * ptr
, unsigned long old
,
426 unsigned long new, int size
)
430 return __cmpxchg_u32(ptr
, old
, new);
432 return __cmpxchg_u64(ptr
, old
, new);
434 __cmpxchg_called_with_bad_pointer();
438 #define cmpxchg(ptr,old,new) ((__typeof__(*(ptr)))__cmpxchg((ptr), (unsigned long)(old), (unsigned long)(new),sizeof(*(ptr))))
440 extern void set_handler (unsigned long offset
, void *addr
, unsigned long len
);
441 extern void set_uncached_handler (unsigned long offset
, void *addr
, unsigned long len
);
442 extern void *set_vi_handler (int n
, void *addr
);
443 extern void *set_vi_srs_handler (int n
, void *addr
, int regset
);
444 extern void *set_except_vector(int n
, void *addr
);
445 extern void per_cpu_trap_init(void);
447 extern NORET_TYPE
void die(const char *, struct pt_regs
*);
449 static inline void die_if_kernel(const char *str
, struct pt_regs
*regs
)
451 if (unlikely(!user_mode(regs
)))
455 extern int stop_a_enabled
;
458 * See include/asm-ia64/system.h; prevents deadlock on SMP
461 #define __ARCH_WANT_UNLOCKED_CTXSW
463 #define arch_align_stack(x) (x)
465 #endif /* _ASM_SYSTEM_H */