blob: ee839ee58ac84894515d328b78f1bb73dc43119f [file] [log] [blame]
Michael Trimarchi0c912232008-11-25 21:37:14 +09001/*
2 * arch/sh/include/asm/mutex-llsc.h
3 *
4 * SH-4A optimized mutex locking primitives
5 *
6 * Please look into asm-generic/mutex-xchg.h for a formal definition.
7 */
8#ifndef __ASM_SH_MUTEX_LLSC_H
9#define __ASM_SH_MUTEX_LLSC_H
10
11/*
12 * Attempting to lock a mutex on SH4A is done like in ARMv6+ architecure.
13 * with a bastardized atomic decrement (it is not a reliable atomic decrement
14 * but it satisfies the defined semantics for our purpose, while being
15 * smaller and faster than a real atomic decrement or atomic swap.
16 * The idea is to attempt decrementing the lock value only once. If once
17 * decremented it isn't zero, or if its store-back fails due to a dispute
18 * on the exclusive store, we simply bail out immediately through the slow
19 * path where the lock will be reattempted until it succeeds.
20 */
21static inline void
22__mutex_fastpath_lock(atomic_t *count, void (*fail_fn)(atomic_t *))
23{
Paul Mundt77ba93a2008-12-08 11:25:50 +090024 int __ex_flag, __res;
Michael Trimarchi0c912232008-11-25 21:37:14 +090025
26 __asm__ __volatile__ (
Paul Mundt77ba93a2008-12-08 11:25:50 +090027 "movli.l @%2, %0 \n"
28 "add #-1, %0 \n"
29 "movco.l %0, @%2 \n"
30 "movt %1 \n"
31 : "=&z" (__res), "=&r" (__ex_flag)
Michael Trimarchi0c912232008-11-25 21:37:14 +090032 : "r" (&(count)->counter)
33 : "t");
34
Paul Mundt77ba93a2008-12-08 11:25:50 +090035 __res |= !__ex_flag;
Michael Trimarchi0c912232008-11-25 21:37:14 +090036 if (unlikely(__res != 0))
37 fail_fn(count);
38}
39
40static inline int
41__mutex_fastpath_lock_retval(atomic_t *count, int (*fail_fn)(atomic_t *))
42{
Paul Mundt77ba93a2008-12-08 11:25:50 +090043 int __ex_flag, __res;
Michael Trimarchi0c912232008-11-25 21:37:14 +090044
45 __asm__ __volatile__ (
Paul Mundt77ba93a2008-12-08 11:25:50 +090046 "movli.l @%2, %0 \n"
47 "add #-1, %0 \n"
48 "movco.l %0, @%2 \n"
49 "movt %1 \n"
50 : "=&z" (__res), "=&r" (__ex_flag)
Michael Trimarchi0c912232008-11-25 21:37:14 +090051 : "r" (&(count)->counter)
52 : "t");
53
Paul Mundt77ba93a2008-12-08 11:25:50 +090054 __res |= !__ex_flag;
Michael Trimarchi0c912232008-11-25 21:37:14 +090055 if (unlikely(__res != 0))
56 __res = fail_fn(count);
57
58 return __res;
59}
60
61static inline void
62__mutex_fastpath_unlock(atomic_t *count, void (*fail_fn)(atomic_t *))
63{
Paul Mundt77ba93a2008-12-08 11:25:50 +090064 int __ex_flag, __res;
Michael Trimarchi0c912232008-11-25 21:37:14 +090065
66 __asm__ __volatile__ (
Paul Mundt77ba93a2008-12-08 11:25:50 +090067 "movli.l @%2, %0 \n\t"
Michael Trimarchi0c912232008-11-25 21:37:14 +090068 "add #1, %0 \n\t"
Paul Mundt77ba93a2008-12-08 11:25:50 +090069 "movco.l %0, @%2 \n\t"
70 "movt %1 \n\t"
71 : "=&z" (__res), "=&r" (__ex_flag)
Michael Trimarchi0c912232008-11-25 21:37:14 +090072 : "r" (&(count)->counter)
73 : "t");
74
Paul Mundt77ba93a2008-12-08 11:25:50 +090075 __res |= !__ex_flag;
Paul Mundt06be3722008-12-08 17:01:40 +090076 if (unlikely(__res <= 0))
Michael Trimarchi0c912232008-11-25 21:37:14 +090077 fail_fn(count);
78}
79
80/*
81 * If the unlock was done on a contended lock, or if the unlock simply fails
82 * then the mutex remains locked.
83 */
84#define __mutex_slowpath_needs_to_unlock() 1
85
86/*
87 * For __mutex_fastpath_trylock we do an atomic decrement and check the
88 * result and put it in the __res variable.
89 */
90static inline int
91__mutex_fastpath_trylock(atomic_t *count, int (*fail_fn)(atomic_t *))
92{
93 int __res, __orig;
94
95 __asm__ __volatile__ (
96 "1: movli.l @%2, %0 \n\t"
97 "dt %0 \n\t"
98 "movco.l %0,@%2 \n\t"
99 "bf 1b \n\t"
100 "cmp/eq #0,%0 \n\t"
101 "bt 2f \n\t"
102 "mov #0, %1 \n\t"
103 "bf 3f \n\t"
104 "2: mov #1, %1 \n\t"
105 "3: "
106 : "=&z" (__orig), "=&r" (__res)
107 : "r" (&count->counter)
108 : "t");
109
110 return __res;
111}
112#endif /* __ASM_SH_MUTEX_LLSC_H */