1 /* $Id: uaccess.h,v 1.11 2003/10/13 07:21:20 lethal Exp $
3 * User space memory access functions
5 * Copyright (C) 1999, 2002 Niibe Yutaka
6 * Copyright (C) 2003 Paul Mundt
9 * MIPS implementation version 1.15 by
10 * Copyright (C) 1996, 1997, 1998 by Ralf Baechle
13 #ifndef __ASM_SH_UACCESS_H
14 #define __ASM_SH_UACCESS_H
16 #include <linux/errno.h>
17 #include <linux/sched.h>
20 #define VERIFY_WRITE 1
23 * The fs value determines whether argument validity checking should be
24 * performed or not. If get_fs() == USER_DS, checking is performed, with
25 * get_fs() == KERNEL_DS, checking is bypassed.
27 * For historical reasons (Data Segment Register?), these macros are misnamed.
30 #define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
32 #define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFFUL)
33 #define USER_DS MAKE_MM_SEG(PAGE_OFFSET)
35 #define segment_eq(a,b) ((a).seg == (b).seg)
37 #define get_ds() (KERNEL_DS)
39 #if !defined(CONFIG_MMU)
40 /* NOMMU is always true */
41 #define __addr_ok(addr) (1)
43 static inline mm_segment_t get_fs(void)
48 static inline void set_fs(mm_segment_t s)
53 * __access_ok: Check if address with size is OK or not.
55 * If we don't have an MMU (or if its disabled) the only thing we really have
56 * to look out for is if the address resides somewhere outside of what
57 * available RAM we have.
59 * TODO: This check could probably also stand to be restricted somewhat more..
60 * though it still does the Right Thing(tm) for the time being.
62 static inline int __access_ok(unsigned long addr, unsigned long size)
64 extern unsigned long memory_start, memory_end;
66 return ((addr >= memory_start) && ((addr + size) < memory_end));
68 #else /* CONFIG_MMU */
69 #define __addr_ok(addr) \
70 ((unsigned long)(addr) < (current_thread_info()->addr_limit.seg))
72 #define get_fs() (current_thread_info()->addr_limit)
73 #define set_fs(x) (current_thread_info()->addr_limit = (x))
76 * __access_ok: Check if address with size is OK or not.
79 * (1) is it user space?
80 * (2) addr + size --> carry?
81 * (3) addr + size >= 0x80000000 (PAGE_OFFSET)
83 * (1) (2) (3) | RESULT
93 static inline int __access_ok(unsigned long addr, unsigned long size)
95 unsigned long flag, tmp;
97 __asm__("stc r7_bank, %0\n\t"
98 "mov.l @(8,%0), %0\n\t"
105 : "=&z" (flag), "=r" (tmp)
106 : "r" (addr), "1" (size)
111 #endif /* CONFIG_MMU */
113 static inline int access_ok(int type, const void __user *p, unsigned long size)
115 unsigned long addr = (unsigned long)p;
116 return __access_ok(addr, size);
120 * Uh, these should become the main single-value transfer routines ...
121 * They automatically use the right size if we just have the right
124 * As SuperH uses the same address space for kernel and user data, we
125 * can just do these as direct assignments.
128 * (a) re-use the arguments for side effects (sizeof is ok)
129 * (b) require any knowledge of processes at this stage
131 #define put_user(x,ptr) __put_user_check((x),(ptr),sizeof(*(ptr)))
132 #define get_user(x,ptr) __get_user_check((x),(ptr),sizeof(*(ptr)))
135 * The "__xxx" versions do not do address space checking, useful when
136 * doing multiple accesses to the same area (the user has to do the
137 * checks by hand with "access_ok()")
139 #define __put_user(x,ptr) \
140 __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
141 #define __get_user(x,ptr) \
142 __get_user_nocheck((x),(ptr),sizeof(*(ptr)))
144 struct __large_struct { unsigned long buf[100]; };
145 #define __m(x) (*(struct __large_struct *)(x))
147 #define __get_user_size(x,ptr,size,retval) \
152 __get_user_asm(x, ptr, retval, "b"); \
155 __get_user_asm(x, ptr, retval, "w"); \
158 __get_user_asm(x, ptr, retval, "l"); \
161 __get_user_unknown(); \
166 #define __get_user_nocheck(x,ptr,size) \
168 long __gu_err, __gu_val; \
169 __get_user_size(__gu_val, (ptr), (size), __gu_err); \
170 (x) = (__typeof__(*(ptr)))__gu_val; \
175 #define __get_user_check(x,ptr,size) \
177 long __gu_err, __gu_val; \
180 __get_user_1(__gu_val, (ptr), __gu_err); \
183 __get_user_2(__gu_val, (ptr), __gu_err); \
186 __get_user_4(__gu_val, (ptr), __gu_err); \
189 __get_user_unknown(); \
193 (x) = (__typeof__(*(ptr)))__gu_val; \
197 #define __get_user_1(x,addr,err) ({ \
198 __asm__("stc r7_bank, %1\n\t" \
199 "mov.l @(8,%1), %1\n\t" \
209 "mov.b @%2, %1\n\t" \
212 ".section __ex_table,\"a\"\n\t" \
215 : "=&r" (err), "=&r" (x) \
220 #define __get_user_2(x,addr,err) ({ \
221 __asm__("stc r7_bank, %1\n\t" \
222 "mov.l @(8,%1), %1\n\t" \
232 "mov.w @%2, %1\n\t" \
235 ".section __ex_table,\"a\"\n\t" \
238 : "=&r" (err), "=&r" (x) \
243 #define __get_user_4(x,addr,err) ({ \
244 __asm__("stc r7_bank, %1\n\t" \
245 "mov.l @(8,%1), %1\n\t" \
255 "mov.l @%2, %1\n\t" \
257 ".section __ex_table,\"a\"\n\t" \
260 : "=&r" (err), "=&r" (x) \
264 #else /* CONFIG_MMU */
265 #define __get_user_check(x,ptr,size) \
267 long __gu_err, __gu_val; \
268 if (__access_ok((unsigned long)(ptr), (size))) { \
269 __get_user_size(__gu_val, (ptr), (size), __gu_err); \
270 (x) = (__typeof__(*(ptr)))__gu_val; \
272 __gu_err = -EFAULT; \
277 #define __get_user_asm(x, addr, err, insn) \
279 __asm__ __volatile__( \
281 "mov." insn " %2, %1\n\t" \
284 ".section .fixup,\"ax\"\n" \
292 ".section __ex_table,\"a\"\n\t" \
295 :"=&r" (err), "=&r" (x) \
296 :"m" (__m(addr)), "i" (-EFAULT)); })
298 extern void __get_user_unknown(void);
300 #define __put_user_size(x,ptr,size,retval) \
305 __put_user_asm(x, ptr, retval, "b"); \
308 __put_user_asm(x, ptr, retval, "w"); \
311 __put_user_asm(x, ptr, retval, "l"); \
314 __put_user_u64(x, ptr, retval); \
317 __put_user_unknown(); \
321 #define __put_user_nocheck(x,ptr,size) \
324 __put_user_size((x),(ptr),(size),__pu_err); \
328 #define __put_user_check(x,ptr,size) \
330 long __pu_err = -EFAULT; \
331 __typeof__(*(ptr)) *__pu_addr = (ptr); \
333 if (__access_ok((unsigned long)__pu_addr,size)) \
334 __put_user_size((x),__pu_addr,(size),__pu_err); \
338 #define __put_user_asm(x, addr, err, insn) \
340 __asm__ __volatile__( \
342 "mov." insn " %1, %2\n\t" \
345 ".section .fixup,\"ax\"\n" \
353 ".section __ex_table,\"a\"\n\t" \
357 :"r" (x), "m" (__m(addr)), "i" (-EFAULT) \
360 #if defined(__LITTLE_ENDIAN__)
361 #define __put_user_u64(val,addr,retval) \
363 __asm__ __volatile__( \
366 "mov.l %S1,%T2\n\t" \
369 ".section .fixup,\"ax\"\n" \
377 ".section __ex_table,\"a\"\n\t" \
381 : "r" (val), "m" (__m(addr)), "i" (-EFAULT) \
384 #define __put_user_u64(val,addr,retval) \
386 __asm__ __volatile__( \
389 "mov.l %R1,%T2\n\t" \
392 ".section .fixup,\"ax\"\n" \
400 ".section __ex_table,\"a\"\n\t" \
404 : "r" (val), "m" (__m(addr)), "i" (-EFAULT) \
408 extern void __put_user_unknown(void);
410 /* Generic arbitrary sized copy. */
411 /* Return the number of bytes NOT copied */
412 extern __kernel_size_t __copy_user(void *to, const void *from, __kernel_size_t n);
414 #define copy_to_user(to,from,n) ({ \
415 void *__copy_to = (void *) (to); \
416 __kernel_size_t __copy_size = (__kernel_size_t) (n); \
417 __kernel_size_t __copy_res; \
418 if(__copy_size && __access_ok((unsigned long)__copy_to, __copy_size)) { \
419 __copy_res = __copy_user(__copy_to, (void *) (from), __copy_size); \
420 } else __copy_res = __copy_size; \
423 #define __copy_to_user(to,from,n) \
424 __copy_user((void *)(to), \
427 #define __copy_to_user_inatomic __copy_to_user
428 #define __copy_from_user_inatomic __copy_from_user
431 #define copy_from_user(to,from,n) ({ \
432 void *__copy_to = (void *) (to); \
433 void *__copy_from = (void *) (from); \
434 __kernel_size_t __copy_size = (__kernel_size_t) (n); \
435 __kernel_size_t __copy_res; \
436 if(__copy_size && __access_ok((unsigned long)__copy_from, __copy_size)) { \
437 __copy_res = __copy_user(__copy_to, __copy_from, __copy_size); \
438 } else __copy_res = __copy_size; \
441 #define __copy_from_user(to,from,n) \
442 __copy_user((void *)(to), \
446 * Clear the area and return remaining number of bytes
447 * (on failure. Usually it's 0.)
449 extern __kernel_size_t __clear_user(void *addr, __kernel_size_t size);
451 #define clear_user(addr,n) ({ \
452 void * __cl_addr = (addr); \
453 unsigned long __cl_size = (n); \
454 if (__cl_size && __access_ok(((unsigned long)(__cl_addr)), __cl_size)) \
455 __cl_size = __clear_user(__cl_addr, __cl_size); \
458 static __inline__ int
459 __strncpy_from_user(unsigned long __dest, unsigned long __user __src, int __count)
462 unsigned long __dummy, _d, _s;
464 __asm__ __volatile__(
477 ".section .fixup,\"ax\"\n"
485 ".section __ex_table,\"a\"\n"
489 : "=r" (res), "=&z" (__dummy), "=r" (_s), "=r" (_d)
490 : "0" (__count), "2" (__src), "3" (__dest), "r" (__count),
497 #define strncpy_from_user(dest,src,count) ({ \
498 unsigned long __sfu_src = (unsigned long) (src); \
499 int __sfu_count = (int) (count); \
500 long __sfu_res = -EFAULT; \
501 if(__access_ok(__sfu_src, __sfu_count)) { \
502 __sfu_res = __strncpy_from_user((unsigned long) (dest), __sfu_src, __sfu_count); \
506 * Return the size of a string (including the ending 0!)
508 static __inline__ long __strnlen_user(const char __user *__s, long __n)
511 unsigned long __dummy;
513 __asm__ __volatile__(
518 "mov.b @(%0,%3), %1\n\t"
523 ".section .fixup,\"ax\"\n"
531 ".section __ex_table,\"a\"\n"
535 : "=z" (res), "=&r" (__dummy)
536 : "0" (0), "r" (__s), "r" (__n)
541 static __inline__ long strnlen_user(const char __user *s, long n)
546 return __strnlen_user(s, n);
549 #define strlen_user(str) strnlen_user(str, ~0UL >> 1)
552 * The exception table consists of pairs of addresses: the first is the
553 * address of an instruction that is allowed to fault, and the second is
554 * the address at which the program should continue. No registers are
555 * modified, so it is entirely up to the continuation code to figure out
558 * All the routines below use bits of fixup code that are out of line
559 * with the main instruction path. This means when everything is well,
560 * we don't even have to jump over them. Further, they do not intrude
561 * on our cache or tlb entries.
564 struct exception_table_entry
566 unsigned long insn, fixup;
569 extern int fixup_exception(struct pt_regs *regs);
571 #endif /* __ASM_SH_UACCESS_H */