aboutsummaryrefslogtreecommitdiffstats
path: root/include/asm-x86/local.h
blob: ae91994fd6c91dc607251a31d5e2df0db6d8f6af (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
#ifndef ASM_X86__LOCAL_H
#define ASM_X86__LOCAL_H

#include <linux/percpu.h>

#include <asm/system.h>
#include <asm/atomic.h>
#include <asm/asm.h>

typedef struct {
	atomic_long_t a;
} local_t;

#define LOCAL_INIT(i)	{ ATOMIC_LONG_INIT(i) }

#define local_read(l)	atomic_long_read(&(l)->a)
#define local_set(l, i)	atomic_long_set(&(l)->a, (i))

static inline void local_inc(local_t *l)
{
	asm volatile(_ASM_INC "%0"
		     : "+m" (l->a.counter));
}

static inline void local_dec(local_t *l)
{
	asm volatile(_ASM_DEC "%0"
		     : "+m" (l->a.counter));
}

static inline void local_add(long i, local_t *l)
{
	asm volatile(_ASM_ADD "%1,%0"
		     : "+m" (l->a.counter)
		     : "ir" (i));
}

static inline void local_sub(long i, local_t *l)
{
	asm volatile(_ASM_SUB "%1,%0"
		     : "+m" (l->a.counter)
		     : "ir" (i));
}

/**
 * local_sub_and_test - subtract value from variable and test result
 * @i: integer value to subtract
 * @l: pointer to type local_t
 *
 * Atomically subtracts @i from @l and returns
 * true if the result is zero, or false for all
 * other cases.
 */
static inline int local_sub_and_test(long i, local_t *l)
{
	unsigned char c;

	asm volatile(_ASM_SUB "%2,%0; sete %1"
		     : "+m" (l->a.counter), "=qm" (c)
		     : "ir" (i) : "memory");
	return c;
}

/**
 * local_dec_and_test - decrement and test
 * @l: pointer to type local_t
 *
 * Atomically decrements @l by 1 and
 * returns true if the result is 0, or false for all other
 * cases.
 */
static inline int local_dec_and_test(local_t *l)
{
	unsigned char c;

	asm volatile(_ASM_DEC "%0; sete %1"
		     : "+m" (l->a.counter), "=qm" (c)
		     : : "memory");
	return c != 0;
}

/**
 * local_inc_and_test - increment and test
 * @l: pointer to type local_t
 *
 * Atomically increments @l by 1
 * and returns true if the result is zero, or false for all
 * other cases.
 */
static inline int local_inc_and_test(local_t *l)
{
	unsigned char c;

	asm volatile(_ASM_INC "%0; sete %1"
		     : "+m" (l->a.counter), "=qm" (c)
		     : : "memory");
	return c != 0;
}

/**
 * local_add_negative - add and test if negative
 * @i: integer value to add
 * @l: pointer to type local_t
 *
 * Atomically adds @i to @l and returns true
 * if the result is negative, or false when
 * result is greater than or equal to zero.
 */
static inline int local_add_negative(long i, local_t *l)
{
	unsigned char c;

	asm volatile(_ASM_ADD "%2,%0; sets %1"
		     : "+m" (l->a.counter), "=qm" (c)
		     : "ir" (i) : "memory");
	return c;
}

/**
 * local_add_return - add and return
 * @i: integer value to add
 * @l: pointer to type local_t
 *
 * Atomically adds @i to @l and returns @i + @l
 */
static inline long local_add_return(long i, local_t *l)
{
	long __i;
#ifdef CONFIG_M386
	unsigned long flags;
	if (unlikely(boot_cpu_data.x86 <= 3))
		goto no_xadd;
#endif
	/* Modern 486+ processor */
	__i = i;
	asm volatile(_ASM_XADD "%0, %1;"
		     : "+r" (i), "+m" (l->a.counter)
		     : : "memory");
	return i + __i;

#ifdef CONFIG_M386
no_xadd: /* Legacy 386 processor */
	local_irq_save(flags);
	__i = local_read(l);
	local_set(l, i + __i);
	local_irq_restore(flags);
	return i + __i;
#endif
}

static inline long local_sub_return(long i, local_t *l)
{
	return local_add_return(-i, l);
}

#define local_inc_return(l)  (local_add_return(1, l))
#define local_dec_return(l)  (local_sub_return(1, l))

#define local_cmpxchg(l, o, n) \
	(cmpxchg_local(&((l)->a.counter), (o), (n)))
/* Always has a lock prefix */
#define local_xchg(l, n) (xchg(&((l)->a.counter), (n)))

/**
 * local_add_unless - add unless the number is a given value
 * @l: pointer of type local_t
 * @a: the amount to add to l...
 * @u: ...unless l is equal to u.
 *
 * Atomically adds @a to @l, so long as it was not @u.
 * Returns non-zero if @l was not @u, and zero otherwise.
 */
#define local_add_unless(l, a, u)				\
({								\
	long c, old;						\
	c = local_read((l));					\
	for (;;) {						\
		if (unlikely(c == (u)))				\
			break;					\
		old = local_cmpxchg((l), c, c + (a));		\
		if (likely(old == c))				\
			break;					\
		c = old;					\
	}							\
	c != (u);						\
})
#define local_inc_not_zero(l) local_add_unless((l), 1, 0)

/* On x86_32, these are no better than the atomic variants.
 * On x86-64 these are better than the atomic variants on SMP kernels
 * because they dont use a lock prefix.
 */
#define __local_inc(l)		local_inc(l)
#define __local_dec(l)		local_dec(l)
#define __local_add(i, l)	local_add((i), (l))
#define __local_sub(i, l)	local_sub((i), (l))

/* Use these for per-cpu local_t variables: on some archs they are
 * much more efficient than these naive implementations.  Note they take
 * a variable, not an address.
 *
 * X86_64: This could be done better if we moved the per cpu data directly
 * after GS.
 */

/* Need to disable preemption for the cpu local counters otherwise we could
   still access a variable of a previous CPU in a non atomic way. */
#define cpu_local_wrap_v(l)		\
({					\
	local_t res__;			\
	preempt_disable(); 		\
	res__ = (l);			\
	preempt_enable();		\
	res__;				\
})
#define cpu_local_wrap(l)		\
({					\
	preempt_disable();		\
	(l);				\
	preempt_enable();		\
})					\

#define cpu_local_read(l)    cpu_local_wrap_v(local_read(&__get_cpu_var((l))))
#define cpu_local_set(l, i)  cpu_local_wrap(local_set(&__get_cpu_var((l)), (i)))
#define cpu_local_inc(l)     cpu_local_wrap(local_inc(&__get_cpu_var((l))))
#define cpu_local_dec(l)     cpu_local_wrap(local_dec(&__get_cpu_var((l))))
#define cpu_local_add(i, l)  cpu_local_wrap(local_add((i), &__get_cpu_var((l))))
#define cpu_local_sub(i, l)  cpu_local_wrap(local_sub((i), &__get_cpu_var((l))))

#define __cpu_local_inc(l)	cpu_local_inc((l))
#define __cpu_local_dec(l)	cpu_local_dec((l))
#define __cpu_local_add(i, l)	cpu_local_add((i), (l))
#define __cpu_local_sub(i, l)	cpu_local_sub((i), (l))

#endif /* ASM_X86__LOCAL_H */
ppc"> case 2: __put_user_asm("hu"); break; \ case 4: __put_user_asm("" ); break; \ case 8: __put_user_asm8(); break; \ default: __pu_err = __put_user_unknown(); break; \ } \ __pu_err; \ }) #define __put_user_check(x, ptr, size) \ ({ \ union { \ __typeof__(*(ptr)) val; \ u32 bits[2]; \ } __pu_val; \ unsigned long __pu_addr; \ int __pu_err; \ __pu_val.val = (x); \ __pu_addr = (unsigned long) (ptr); \ if (likely(__access_ok(__pu_addr, size))) { \ switch (size) { \ case 1: __put_user_asm("bu"); break; \ case 2: __put_user_asm("hu"); break; \ case 4: __put_user_asm("" ); break; \ case 8: __put_user_asm8(); break; \ default: __pu_err = __put_user_unknown(); break; \ } \ } \ else { \ __pu_err = -EFAULT; \ } \ __pu_err; \ }) #define __put_user_asm(INSN) \ ({ \ asm volatile( \ "1:\n" \ " mov"INSN" %1,%2\n" \ " mov 0,%0\n" \ "2:\n" \ " .section .fixup,\"ax\"\n" \ "3:\n" \ " mov %3,%0\n" \ " jmp 2b\n" \ " .previous\n" \ " .section __ex_table,\"a\"\n" \ " .balign 4\n" \ " .long 1b, 3b\n" \ " .previous" \ : "=&r" (__pu_err) \ : "r" (__pu_val.val), "m" (__m(__pu_addr)), \ "i" (-EFAULT) \ ); \ }) #define __put_user_asm8() \ ({ \ asm volatile( \ "1: mov %1,%3 \n" \ "2: mov %2,%4 \n" \ " mov 0,%0 \n" \ "3: \n" \ " .section .fixup,\"ax\" \n" \ "4: \n" \ " mov %5,%0 \n" \ " jmp 2b \n" \ " .previous \n" \ " .section __ex_table,\"a\"\n" \ " .balign 4 \n" \ " .long 1b, 4b \n" \ " .long 2b, 4b \n" \ " .previous \n" \ : "=&r" (__pu_err) \ : "r" (__pu_val.bits[0]), "r" (__pu_val.bits[1]), \ "m" (__m(__pu_addr)), "m" (__m(__pu_addr+4)), \ "i" (-EFAULT) \ ); \ }) extern int __put_user_unknown(void); /* * Copy To/From Userspace */ /* Generic arbitrary sized copy. */ #define __copy_user(to, from, size) \ do { \ if (size) { \ void *__to = to; \ const void *__from = from; \ int w; \ asm volatile( \ "0: movbu (%0),%3;\n" \ "1: movbu %3,(%1);\n" \ " inc %0;\n" \ " inc %1;\n" \ " add -1,%2;\n" \ " bne 0b;\n" \ "2:\n" \ " .section .fixup,\"ax\"\n" \ "3: jmp 2b\n" \ " .previous\n" \ " .section __ex_table,\"a\"\n" \ " .balign 4\n" \ " .long 0b,3b\n" \ " .long 1b,3b\n" \ " .previous\n" \ : "=a"(__from), "=a"(__to), "=r"(size), "=&r"(w)\ : "0"(__from), "1"(__to), "2"(size) \ : "memory"); \ } \ } while (0) #define __copy_user_zeroing(to, from, size) \ do { \ if (size) { \ void *__to = to; \ const void *__from = from; \ int w; \ asm volatile( \ "0: movbu (%0),%3;\n" \ "1: movbu %3,(%1);\n" \ " inc %0;\n" \ " inc %1;\n" \ " add -1,%2;\n" \ " bne 0b;\n" \ "2:\n" \ " .section .fixup,\"ax\"\n" \ "3:\n" \ " mov %2,%0\n" \ " clr %3\n" \ "4: movbu %3,(%1);\n" \ " inc %1;\n" \ " add -1,%2;\n" \ " bne 4b;\n" \ " mov %0,%2\n" \ " jmp 2b\n" \ " .previous\n" \ " .section __ex_table,\"a\"\n" \ " .balign 4\n" \ " .long 0b,3b\n" \ " .long 1b,3b\n" \ " .previous\n" \ : "=a"(__from), "=a"(__to), "=r"(size), "=&r"(w)\ : "0"(__from), "1"(__to), "2"(size) \ : "memory"); \ } \ } while (0) /* We let the __ versions of copy_from/to_user inline, because they're often * used in fast paths and have only a small space overhead. */ static inline unsigned long __generic_copy_from_user_nocheck(void *to, const void *from, unsigned long n) { __copy_user_zeroing(to, from, n); return n; } static inline unsigned long __generic_copy_to_user_nocheck(void *to, const void *from, unsigned long n) { __copy_user(to, from, n); return n; } #if 0 #error don't use - these macros don't increment to & from pointers /* Optimize just a little bit when we know the size of the move. */ #define __constant_copy_user(to, from, size) \ do { \ asm volatile( \ " mov %0,a0;\n" \ "0: movbu (%1),d3;\n" \ "1: movbu d3,(%2);\n" \ " add -1,a0;\n" \ " bne 0b;\n" \ "2:;" \ ".section .fixup,\"ax\"\n" \ "3: jmp 2b\n" \ ".previous\n" \ ".section __ex_table,\"a\"\n" \ " .balign 4\n" \ " .long 0b,3b\n" \ " .long 1b,3b\n" \ ".previous" \ : \ : "d"(size), "d"(to), "d"(from) \ : "d3", "a0"); \ } while (0) /* Optimize just a little bit when we know the size of the move. */ #define __constant_copy_user_zeroing(to, from, size) \ do { \ asm volatile( \ " mov %0,a0;\n" \ "0: movbu (%1),d3;\n" \ "1: movbu d3,(%2);\n" \ " add -1,a0;\n" \ " bne 0b;\n" \ "2:;" \ ".section .fixup,\"ax\"\n" \ "3: jmp 2b\n" \ ".previous\n" \ ".section __ex_table,\"a\"\n" \ " .balign 4\n" \ " .long 0b,3b\n" \ " .long 1b,3b\n" \ ".previous" \ : \ : "d"(size), "d"(to), "d"(from) \ : "d3", "a0"); \ } while (0) static inline unsigned long __constant_copy_to_user(void *to, const void *from, unsigned long n) { if (access_ok(VERIFY_WRITE, to, n)) __constant_copy_user(to, from, n); return n; } static inline unsigned long __constant_copy_from_user(void *to, const void *from, unsigned long n) { if (access_ok(VERIFY_READ, from, n)) __constant_copy_user_zeroing(to, from, n); return n; } static inline unsigned long __constant_copy_to_user_nocheck(void *to, const void *from, unsigned long n) { __constant_copy_user(to, from, n); return n; } static inline unsigned long __constant_copy_from_user_nocheck(void *to, const void *from, unsigned long n) { __constant_copy_user_zeroing(to, from, n); return n; } #endif extern unsigned long __generic_copy_to_user(void __user *, const void *, unsigned long); extern unsigned long __generic_copy_from_user(void *, const void __user *, unsigned long); #define __copy_to_user_inatomic(to, from, n) \ __generic_copy_to_user_nocheck((to), (from), (n)) #define __copy_from_user_inatomic(to, from, n) \ __generic_copy_from_user_nocheck((to), (from), (n)) #define __copy_to_user(to, from, n) \ ({ \ might_sleep(); \ __copy_to_user_inatomic((to), (from), (n)); \ }) #define __copy_from_user(to, from, n) \ ({ \ might_sleep(); \ __copy_from_user_inatomic((to), (from), (n)); \ }) #define copy_to_user(to, from, n) __generic_copy_to_user((to), (from), (n)) #define copy_from_user(to, from, n) __generic_copy_from_user((to), (from), (n)) extern long strncpy_from_user(char *dst, const char __user *src, long count); extern long __strncpy_from_user(char *dst, const char __user *src, long count); extern long strnlen_user(const char __user *str, long n); #define strlen_user(str) strnlen_user(str, ~0UL >> 1) extern unsigned long clear_user(void __user *mem, unsigned long len); extern unsigned long __clear_user(void __user *mem, unsigned long len); #endif /* _ASM_UACCESS_H */