2 * Authors: Bjorn Wesen (bjornw@axis.com)
3 * Hans-Peter Nilsson (hp@axis.com)
6 /* Asm:s have been tweaked (within the domain of correctness) to give
7 satisfactory results for "gcc version 2.96 20000427 (experimental)".
11 Register $r9 is chosen for temporaries, being a call-clobbered register
12 first in line to be used (notably for local blocks), not colliding with
13 parameter registers. */
15 #ifndef _CRIS_UACCESS_H
16 #define _CRIS_UACCESS_H
19 #include <linux/sched.h>
20 #include <linux/errno.h>
21 #include <asm/processor.h>
25 #define VERIFY_WRITE 1
28 * The fs value determines whether argument validity checking should be
29 * performed or not. If get_fs() == USER_DS, checking is performed, with
30 * get_fs() == KERNEL_DS, checking is bypassed.
32 * For historical reasons, these macros are grossly misnamed.
35 #define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
37 /* addr_limit is the maximum accessible address for the task. we misuse
38 * the KERNEL_DS and USER_DS values to both assign and compare the
39 * addr_limit values through the equally misnamed get/set_fs macros.
43 #define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFF)
44 #define USER_DS MAKE_MM_SEG(TASK_SIZE)
46 #define get_ds() (KERNEL_DS)
47 #define get_fs() (current_thread_info()->addr_limit)
48 #define set_fs(x) (current_thread_info()->addr_limit = (x))
50 #define segment_eq(a, b) ((a).seg == (b).seg)
52 #define __kernel_ok (segment_eq(get_fs(), KERNEL_DS))
53 #define __user_ok(addr, size) \
54 (((size) <= TASK_SIZE) && ((addr) <= TASK_SIZE-(size)))
55 #define __access_ok(addr, size) (__kernel_ok || __user_ok((addr), (size)))
56 #define access_ok(type, addr, size) __access_ok((unsigned long)(addr), (size))
58 #include <arch/uaccess.h>
61 * The exception table consists of pairs of addresses: the first is the
62 * address of an instruction that is allowed to fault, and the second is
63 * the address at which the program should continue. No registers are
64 * modified, so it is entirely up to the continuation code to figure out
67 * All the routines below use bits of fixup code that are out of line
68 * with the main instruction path. This means when everything is well,
69 * we don't even have to jump over them. Further, they do not intrude
70 * on our cache or tlb entries.
73 struct exception_table_entry
{
74 unsigned long insn
, fixup
;
78 * These are the main single-value transfer routines. They automatically
79 * use the right size if we just have the right pointer type.
81 * This gets kind of ugly. We want to return _two_ values in "get_user()"
82 * and yet we don't want to do any pointers, because that is too much
83 * of a performance impact. Thus we have a few rather ugly macros here,
84 * and hide all the ugliness from the user.
86 * The "__xxx" versions of the user access functions are versions that
87 * do not verify the address space, that must have been done previously
88 * with a separate "access_ok()" call (this is used when we do multiple
89 * accesses to the same area of user memory).
91 * As we use the same address space for kernel and user data on
92 * CRIS, we can just do these as direct assignments. (Of course, the
93 * exception handling means that it's no longer "just"...)
95 #define get_user(x, ptr) \
96 __get_user_check((x), (ptr), sizeof(*(ptr)))
97 #define put_user(x, ptr) \
98 __put_user_check((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
100 #define __get_user(x, ptr) \
101 __get_user_nocheck((x), (ptr), sizeof(*(ptr)))
102 #define __put_user(x, ptr) \
103 __put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
105 extern long __put_user_bad(void);
107 #define __put_user_size(x, ptr, size, retval) \
112 __put_user_asm(x, ptr, retval, "move.b"); \
115 __put_user_asm(x, ptr, retval, "move.w"); \
118 __put_user_asm(x, ptr, retval, "move.d"); \
121 __put_user_asm_64(x, ptr, retval); \
128 #define __get_user_size(x, ptr, size, retval) \
133 __get_user_asm(x, ptr, retval, "move.b"); \
136 __get_user_asm(x, ptr, retval, "move.w"); \
139 __get_user_asm(x, ptr, retval, "move.d"); \
142 __get_user_asm_64(x, ptr, retval); \
145 (x) = __get_user_bad(); \
149 #define __put_user_nocheck(x, ptr, size) \
152 __put_user_size((x), (ptr), (size), __pu_err); \
156 #define __put_user_check(x, ptr, size) \
158 long __pu_err = -EFAULT; \
159 __typeof__(*(ptr)) *__pu_addr = (ptr); \
160 if (access_ok(VERIFY_WRITE, __pu_addr, size)) \
161 __put_user_size((x), __pu_addr, (size), __pu_err); \
165 struct __large_struct
{ unsigned long buf
[100]; };
166 #define __m(x) (*(struct __large_struct *)(x))
170 #define __get_user_nocheck(x, ptr, size) \
172 long __gu_err, __gu_val; \
173 __get_user_size(__gu_val, (ptr), (size), __gu_err); \
174 (x) = (__force __typeof__(*(ptr)))__gu_val; \
178 #define __get_user_check(x, ptr, size) \
180 long __gu_err = -EFAULT, __gu_val = 0; \
181 const __typeof__(*(ptr)) *__gu_addr = (ptr); \
182 if (access_ok(VERIFY_READ, __gu_addr, size)) \
183 __get_user_size(__gu_val, __gu_addr, (size), __gu_err); \
184 (x) = (__force __typeof__(*(ptr)))__gu_val; \
188 extern long __get_user_bad(void);
190 /* More complex functions. Most are inline, but some call functions that
191 live in lib/usercopy.c */
193 extern unsigned long __copy_user(void __user
*to
, const void *from
, unsigned long n
);
194 extern unsigned long __copy_user_zeroing(void *to
, const void __user
*from
, unsigned long n
);
195 extern unsigned long __do_clear_user(void __user
*to
, unsigned long n
);
198 __strncpy_from_user(char *dst
, const char __user
*src
, long count
)
200 return __do_strncpy_from_user(dst
, src
, count
);
204 strncpy_from_user(char *dst
, const char __user
*src
, long count
)
208 if (access_ok(VERIFY_READ
, src
, 1))
209 res
= __do_strncpy_from_user(dst
, src
, count
);
214 /* Note that these expand awfully if made into switch constructs, so
217 static inline unsigned long
218 __constant_copy_from_user(void *to
, const void __user
*from
, unsigned long n
)
220 unsigned long ret
= 0;
225 __asm_copy_from_user_1(to
, from
, ret
);
227 __asm_copy_from_user_2(to
, from
, ret
);
229 __asm_copy_from_user_3(to
, from
, ret
);
231 __asm_copy_from_user_4(to
, from
, ret
);
233 __asm_copy_from_user_5(to
, from
, ret
);
235 __asm_copy_from_user_6(to
, from
, ret
);
237 __asm_copy_from_user_7(to
, from
, ret
);
239 __asm_copy_from_user_8(to
, from
, ret
);
241 __asm_copy_from_user_9(to
, from
, ret
);
243 __asm_copy_from_user_10(to
, from
, ret
);
245 __asm_copy_from_user_11(to
, from
, ret
);
247 __asm_copy_from_user_12(to
, from
, ret
);
249 __asm_copy_from_user_13(to
, from
, ret
);
251 __asm_copy_from_user_14(to
, from
, ret
);
253 __asm_copy_from_user_15(to
, from
, ret
);
255 __asm_copy_from_user_16(to
, from
, ret
);
257 __asm_copy_from_user_20(to
, from
, ret
);
259 __asm_copy_from_user_24(to
, from
, ret
);
261 ret
= __copy_user_zeroing(to
, from
, n
);
266 /* Ditto, don't make a switch out of this. */
268 static inline unsigned long
269 __constant_copy_to_user(void __user
*to
, const void *from
, unsigned long n
)
271 unsigned long ret
= 0;
276 __asm_copy_to_user_1(to
, from
, ret
);
278 __asm_copy_to_user_2(to
, from
, ret
);
280 __asm_copy_to_user_3(to
, from
, ret
);
282 __asm_copy_to_user_4(to
, from
, ret
);
284 __asm_copy_to_user_5(to
, from
, ret
);
286 __asm_copy_to_user_6(to
, from
, ret
);
288 __asm_copy_to_user_7(to
, from
, ret
);
290 __asm_copy_to_user_8(to
, from
, ret
);
292 __asm_copy_to_user_9(to
, from
, ret
);
294 __asm_copy_to_user_10(to
, from
, ret
);
296 __asm_copy_to_user_11(to
, from
, ret
);
298 __asm_copy_to_user_12(to
, from
, ret
);
300 __asm_copy_to_user_13(to
, from
, ret
);
302 __asm_copy_to_user_14(to
, from
, ret
);
304 __asm_copy_to_user_15(to
, from
, ret
);
306 __asm_copy_to_user_16(to
, from
, ret
);
308 __asm_copy_to_user_20(to
, from
, ret
);
310 __asm_copy_to_user_24(to
, from
, ret
);
312 ret
= __copy_user(to
, from
, n
);
317 /* No switch, please. */
319 static inline unsigned long
320 __constant_clear_user(void __user
*to
, unsigned long n
)
322 unsigned long ret
= 0;
327 __asm_clear_1(to
, ret
);
329 __asm_clear_2(to
, ret
);
331 __asm_clear_3(to
, ret
);
333 __asm_clear_4(to
, ret
);
335 __asm_clear_8(to
, ret
);
337 __asm_clear_12(to
, ret
);
339 __asm_clear_16(to
, ret
);
341 __asm_clear_20(to
, ret
);
343 __asm_clear_24(to
, ret
);
345 ret
= __do_clear_user(to
, n
);
351 static inline size_t clear_user(void __user
*to
, size_t n
)
353 if (unlikely(!access_ok(VERIFY_WRITE
, to
, n
)))
355 if (__builtin_constant_p(n
))
356 return __constant_clear_user(to
, n
);
358 return __do_clear_user(to
, n
);
361 static inline size_t copy_from_user(void *to
, const void __user
*from
, size_t n
)
363 if (unlikely(!access_ok(VERIFY_READ
, from
, n
))) {
367 if (__builtin_constant_p(n
))
368 return __constant_copy_from_user(to
, from
, n
);
370 return __copy_user_zeroing(to
, from
, n
);
373 static inline size_t copy_to_user(void __user
*to
, const void *from
, size_t n
)
375 if (unlikely(!access_ok(VERIFY_WRITE
, to
, n
)))
377 if (__builtin_constant_p(n
))
378 return __constant_copy_to_user(to
, from
, n
);
380 return __copy_user(to
, from
, n
);
383 /* We let the __ versions of copy_from/to_user inline, because they're often
384 * used in fast paths and have only a small space overhead.
387 static inline unsigned long
388 __generic_copy_from_user_nocheck(void *to
, const void __user
*from
,
391 return __copy_user_zeroing(to
, from
, n
);
394 static inline unsigned long
395 __generic_copy_to_user_nocheck(void __user
*to
, const void *from
,
398 return __copy_user(to
, from
, n
);
401 static inline unsigned long
402 __generic_clear_user_nocheck(void __user
*to
, unsigned long n
)
404 return __do_clear_user(to
, n
);
407 /* without checking */
409 #define __copy_to_user(to, from, n) \
410 __generic_copy_to_user_nocheck((to), (from), (n))
411 #define __copy_from_user(to, from, n) \
412 __generic_copy_from_user_nocheck((to), (from), (n))
413 #define __copy_to_user_inatomic __copy_to_user
414 #define __copy_from_user_inatomic __copy_from_user
415 #define __clear_user(to, n) __generic_clear_user_nocheck((to), (n))
417 #define strlen_user(str) strnlen_user((str), 0x7ffffffe)
419 #endif /* __ASSEMBLY__ */
421 #endif /* _CRIS_UACCESS_H */