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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
|
#ifndef __M68K_UACCESS_H
#define __M68K_UACCESS_H
/*
* User space memory access functions
*/
#include <linux/compiler.h>
#include <linux/errno.h>
#include <linux/types.h>
#include <asm/segment.h>
#define VERIFY_READ 0
#define VERIFY_WRITE 1
/* We let the MMU do all checking */
#define access_ok(type,addr,size) 1
/*
* The exception table consists of pairs of addresses: the first is the
* address of an instruction that is allowed to fault, and the second is
* the address at which the program should continue. No registers are
* modified, so it is entirely up to the continuation code to figure out
* what to do.
*
* All the routines below use bits of fixup code that are out of line
* with the main instruction path. This means when everything is well,
* we don't even have to jump over them. Further, they do not intrude
* on our cache or tlb entries.
*/
struct exception_table_entry
{
unsigned long insn, fixup;
};
extern int __put_user_bad(void);
extern int __get_user_bad(void);
#define __put_user_asm(res, x, ptr, bwl, reg, err) \
asm volatile ("\n" \
"1: moves."#bwl" %2,%1\n" \
"2:\n" \
" .section .fixup,\"ax\"\n" \
" .even\n" \
"10: moveq.l %3,%0\n" \
" jra 2b\n" \
" .previous\n" \
"\n" \
" .section __ex_table,\"a\"\n" \
" .align 4\n" \
" .long 1b,10b\n" \
" .long 2b,10b\n" \
" .previous" \
: "+d" (res), "=m" (*(ptr)) \
: #reg (x), "i" (err))
/*
* These are the main single-value transfer routines. They automatically
* use the right size if we just have the right pointer type.
*/
#define __put_user(x, ptr) \
({ \
typeof(*(ptr)) __pu_val = (x); \
int __pu_err = 0; \
__chk_user_ptr(ptr); \
switch (sizeof (*(ptr))) { \
case 1: \
__put_user_asm(__pu_err, __pu_val, ptr, b, d, -EFAULT); \
break; \
case 2: \
__put_user_asm(__pu_err, __pu_val, ptr, w, d, -EFAULT); \
break; \
case 4: \
__put_user_asm(__pu_err, __pu_val, ptr, l, r, -EFAULT); \
break; \
case 8: \
{ \
const void *__pu_ptr = (ptr); \
asm volatile ("\n" \
"1: moves.l %2,(%1)+\n" \
"2: moves.l %R2,(%1)\n" \
"3:\n" \
" .section .fixup,\"ax\"\n" \
" .even\n" \
"10: movel %3,%0\n" \
" jra 3b\n" \
" .previous\n" \
"\n" \
" .section __ex_table,\"a\"\n" \
" .align 4\n" \
" .long 1b,10b\n" \
" .long 2b,10b\n" \
" .long 3b,10b\n" \
" .previous" \
: "+d" (__pu_err), "+a" (__pu_ptr) \
: "r" (__pu_val), "i" (-EFAULT) \
: "memory"); \
break; \
} \
default: \
__pu_err = __put_user_bad(); \
break; \
} \
__pu_err; \
})
#define put_user(x, ptr) __put_user(x, ptr)
#define __get_user_asm(res, x, ptr, type, bwl, reg, err) ({ \
type __gu_val; \
asm volatile ("\n" \
"1: moves."#bwl" %2,%1\n" \
"2:\n" \
" .section .fixup,\"ax\"\n" \
" .even\n" \
"10: move.l %3,%0\n" \
" sub."#bwl" %1,%1\n" \
" jra 2b\n" \
" .previous\n" \
"\n" \
" .section __ex_table,\"a\"\n" \
" .align 4\n" \
" .long 1b,10b\n" \
" .previous" \
: "+d" (res), "=&" #reg (__gu_val) \
: "m" (*(ptr)), "i" (err)); \
(x) = (typeof(*(ptr)))(long)__gu_val; \
})
#define __get_user(x, ptr) \
({ \
int __gu_err = 0; \
__chk_user_ptr(ptr); \
switch (sizeof(*(ptr))) { \
case 1: \
__get_user_asm(__gu_err, x, ptr, u8, b, d, -EFAULT); \
break; \
case 2: \
__get_user_asm(__gu_err, x, ptr, u16, w, d, -EFAULT); \
break; \
case 4: \
__get_user_asm(__gu_err, x, ptr, u32, l, r, -EFAULT); \
break; \
/* case 8: disabled because gcc-4.1 has a broken typeof \
{ \
const void *__gu_ptr = (ptr); \
u64 __gu_val; \
asm volatile ("\n" \
"1: moves.l (%2)+,%1\n" \
"2: moves.l (%2),%R1\n" \
"3:\n" \
" .section .fixup,\"ax\"\n" \
" .even\n" \
"10: move.l %3,%0\n" \
" sub.l %1,%1\n" \
" sub.l %R1,%R1\n" \
" jra 3b\n" \
" .previous\n" \
"\n" \
" .section __ex_table,\"a\"\n" \
" .align 4\n" \
" .long 1b,10b\n" \
" .long 2b,10b\n" \
" .previous" \
: "+d" (__gu_err), "=&r" (__gu_val), \
"+a" (__gu_ptr) \
: "i" (-EFAULT) \
: "memory"); \
(x) = (typeof(*(ptr)))__gu_val; \
break; \
} */ \
default: \
__gu_err = __get_user_bad(); \
break; \
} \
__gu_err; \
})
#define get_user(x, ptr) __get_user(x, ptr)
unsigned long __generic_copy_from_user(void *to, const void __user *from, unsigned long n);
unsigned long __generic_copy_to_user(void __user *to, const void *from, unsigned long n);
static __always_inline unsigned long
__constant_copy_from_user(void *to, const void __user *from, unsigned long n)
{
unsigned long res = 0, tmp;
/* limit the inlined version to 3 moves */
if (n == 11 || n > 12)
return __generic_copy_from_user(to, from, n);
switch (n) {
case 1:
__get_user_asm(res, *(u8 *)to, (u8 *)from, u8, b, d, 1);
return res;
case 2:
__get_user_asm(res, *(u16 *)to, (u16 *)from, u16, w, d, 2);
return res;
case 4:
__get_user_asm(res, *(u32 *)to, (u32 *)from, u32, l, r, 4);
return res;
}
asm volatile ("\n"
" .ifndef .Lfrom_user\n"
" .set .Lfrom_user,1\n"
" .macro copy_from_user to,from,tmp\n"
" .if .Lcnt >= 4\n"
"1: moves.l (\\from)+,\\tmp\n"
" move.l \\tmp,(\\to)+\n"
" .set .Lcnt,.Lcnt-4\n"
" .elseif .Lcnt & 2\n"
"1: moves.w (\\from)+,\\tmp\n"
" move.w \\tmp,(\\to)+\n"
" .set .Lcnt,.Lcnt-2\n"
" .elseif .Lcnt & 1\n"
"1: moves.b (\\from)+,\\tmp\n"
" move.b \\tmp,(\\to)+\n"
" .set .Lcnt,.Lcnt-1\n"
" .else\n"
" .exitm\n"
" .endif\n"
"\n"
" .section __ex_table,\"a\"\n"
" .align 4\n"
" .long 1b,3f\n"
" .previous\n"
" .endm\n"
" .endif\n"
"\n"
" .set .Lcnt,%c4\n"
" copy_from_user %1,%2,%3\n"
" copy_from_user %1,%2,%3\n"
" copy_from_user %1,%2,%3\n"
"2:\n"
" .section .fixup,\"ax\"\n"
" .even\n"
"3: moveq.l %4,%0\n"
" move.l %5,%1\n"
" .rept %c4 / 4\n"
" clr.l (%1)+\n"
" .endr\n"
" .if %c4 & 2\n"
" clr.w (%1)+\n"
" .endif\n"
" .if %c4 & 1\n"
" clr.b (%1)+\n"
" .endif\n"
" jra 2b\n"
" .previous\n"
: "+r" (res), "+a" (to), "+a" (from), "=&d" (tmp)
: "i" (n), "g" (to)
: "memory");
return res;
}
static __always_inline unsigned long
__constant_copy_to_user(void __user *to, const void *from, unsigned long n)
{
unsigned long res = 0, tmp;
/* limit the inlined version to 3 moves */
if (n == 11 || n > 12)
return __generic_copy_to_user(to, from, n);
switch (n) {
case 1:
__put_user_asm(res, *(u8 *)from, (u8 *)to, b, d, 1);
return res;
case 2:
__put_user_asm(res, *(u16 *)from, (u16 *)to, w, d, 2);
return res;
case 4:
__put_user_asm(res, *(u32 *)from, (u32 *)to, l, r, 4);
return res;
}
asm volatile ("\n"
" .ifndef .Lto_user\n"
" .set .Lto_user,1\n"
" .macro copy_to_user to,from,tmp\n"
" .if .Lcnt >= 4\n"
" move.l (\\from)+,\\tmp\n"
"11: moves.l \\tmp,(\\to)+\n"
"12: .set .Lcnt,.Lcnt-4\n"
" .elseif .Lcnt & 2\n"
" move.w (\\from)+,\\tmp\n"
"11: moves.w \\tmp,(\\to)+\n"
"12: .set .Lcnt,.Lcnt-2\n"
" .elseif .Lcnt & 1\n"
" move.b (\\from)+,\\tmp\n"
"11: moves.b \\tmp,(\\to)+\n"
"12: .set .Lcnt,.Lcnt-1\n"
" .else\n"
" .exitm\n"
" .endif\n"
"\n"
" .section __ex_table,\"a\"\n"
" .align 4\n"
" .long 11b,3f\n"
" .long 12b,3f\n"
" .previous\n"
" .endm\n"
" .endif\n"
"\n"
" .set .Lcnt,%c4\n"
" copy_to_user %1,%2,%3\n"
" copy_to_user %1,%2,%3\n"
" copy_to_user %1,%2,%3\n"
"2:\n"
" .section .fixup,\"ax\"\n"
" .even\n"
"3: moveq.l %4,%0\n"
" jra 2b\n"
" .previous\n"
: "+r" (res), "+a" (to), "+a" (from), "=&d" (tmp)
: "i" (n)
: "memory");
return res;
}
#define __copy_from_user(to, from, n) \
(__builtin_constant_p(n) ? \
__constant_copy_from_user(to, from, n) : \
__generic_copy_from_user(to, from, n))
#define __copy_to_user(to, from, n) \
(__builtin_constant_p(n) ? \
__constant_copy_to_user(to, from, n) : \
__generic_copy_to_user(to, from, n))
#define __copy_to_user_inatomic __copy_to_user
#define __copy_from_user_inatomic __copy_from_user
#define copy_from_user(to, from, n) __copy_from_user(to, from, n)
#define copy_to_user(to, from, n) __copy_to_user(to, from, n)
long strncpy_from_user(char *dst, const char __user *src, long count);
long strnlen_user(const char __user *src, long n);
unsigned long clear_user(void __user *to, unsigned long n);
#define strlen_user(str) strnlen_user(str, 32767)
#endif /* _M68K_UACCESS_H */
|
