blob: d50c310f5d3882b43419a975a93f44067ace4c4c [file] [log] [blame]
Sam Ravnborgf5e706a2008-07-17 21:55:51 -07001/*
2 * uaccess.h: User space memore access functions.
3 *
4 * Copyright (C) 1996 David S. Miller (davem@caip.rutgers.edu)
5 * Copyright (C) 1996,1997 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
6 */
7#ifndef _ASM_UACCESS_H
8#define _ASM_UACCESS_H
9
10#ifdef __KERNEL__
11#include <linux/compiler.h>
12#include <linux/sched.h>
13#include <linux/string.h>
14#include <linux/errno.h>
Sam Ravnborgf5e706a2008-07-17 21:55:51 -070015#endif
16
17#ifndef __ASSEMBLY__
18
Rusty Russellad6561d2009-06-12 21:47:03 -060019#define ARCH_HAS_SORT_EXTABLE
20#define ARCH_HAS_SEARCH_EXTABLE
21
Sam Ravnborgf5e706a2008-07-17 21:55:51 -070022/* Sparc is not segmented, however we need to be able to fool access_ok()
23 * when doing system calls from kernel mode legitimately.
24 *
25 * "For historical reasons, these macros are grossly misnamed." -Linus
26 */
27
28#define KERNEL_DS ((mm_segment_t) { 0 })
29#define USER_DS ((mm_segment_t) { -1 })
30
31#define VERIFY_READ 0
32#define VERIFY_WRITE 1
33
34#define get_ds() (KERNEL_DS)
35#define get_fs() (current->thread.current_ds)
36#define set_fs(val) ((current->thread.current_ds) = (val))
37
38#define segment_eq(a,b) ((a).seg == (b).seg)
39
40/* We have there a nice not-mapped page at PAGE_OFFSET - PAGE_SIZE, so that this test
41 * can be fairly lightweight.
42 * No one can read/write anything from userland in the kernel space by setting
43 * large size and address near to PAGE_OFFSET - a fault will break his intentions.
44 */
45#define __user_ok(addr, size) ({ (void)(size); (addr) < STACK_TOP; })
46#define __kernel_ok (segment_eq(get_fs(), KERNEL_DS))
47#define __access_ok(addr,size) (__user_ok((addr) & get_fs().seg,(size)))
48#define access_ok(type, addr, size) \
49 ({ (void)(type); __access_ok((unsigned long)(addr), size); })
50
51/*
52 * The exception table consists of pairs of addresses: the first is the
53 * address of an instruction that is allowed to fault, and the second is
54 * the address at which the program should continue. No registers are
55 * modified, so it is entirely up to the continuation code to figure out
56 * what to do.
57 *
58 * All the routines below use bits of fixup code that are out of line
59 * with the main instruction path. This means when everything is well,
60 * we don't even have to jump over them. Further, they do not intrude
61 * on our cache or tlb entries.
62 *
63 * There is a special way how to put a range of potentially faulting
64 * insns (like twenty ldd/std's with now intervening other instructions)
65 * You specify address of first in insn and 0 in fixup and in the next
66 * exception_table_entry you specify last potentially faulting insn + 1
67 * and in fixup the routine which should handle the fault.
68 * That fixup code will get
69 * (faulting_insn_address - first_insn_in_the_range_address)/4
70 * in %g2 (ie. index of the faulting instruction in the range).
71 */
72
73struct exception_table_entry
74{
75 unsigned long insn, fixup;
76};
77
78/* Returns 0 if exception not found and fixup otherwise. */
79extern unsigned long search_extables_range(unsigned long addr, unsigned long *g2);
80
81extern void __ret_efault(void);
82
83/* Uh, these should become the main single-value transfer routines..
84 * They automatically use the right size if we just have the right
85 * pointer type..
86 *
87 * This gets kind of ugly. We want to return _two_ values in "get_user()"
88 * and yet we don't want to do any pointers, because that is too much
89 * of a performance impact. Thus we have a few rather ugly macros here,
90 * and hide all the ugliness from the user.
91 */
92#define put_user(x,ptr) ({ \
93unsigned long __pu_addr = (unsigned long)(ptr); \
94__chk_user_ptr(ptr); \
95__put_user_check((__typeof__(*(ptr)))(x),__pu_addr,sizeof(*(ptr))); })
96
97#define get_user(x,ptr) ({ \
98unsigned long __gu_addr = (unsigned long)(ptr); \
99__chk_user_ptr(ptr); \
100__get_user_check((x),__gu_addr,sizeof(*(ptr)),__typeof__(*(ptr))); })
101
102/*
103 * The "__xxx" versions do not do address space checking, useful when
104 * doing multiple accesses to the same area (the user has to do the
105 * checks by hand with "access_ok()")
106 */
107#define __put_user(x,ptr) __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
108#define __get_user(x,ptr) __get_user_nocheck((x),(ptr),sizeof(*(ptr)),__typeof__(*(ptr)))
109
110struct __large_struct { unsigned long buf[100]; };
111#define __m(x) ((struct __large_struct __user *)(x))
112
113#define __put_user_check(x,addr,size) ({ \
114register int __pu_ret; \
115if (__access_ok(addr,size)) { \
116switch (size) { \
117case 1: __put_user_asm(x,b,addr,__pu_ret); break; \
118case 2: __put_user_asm(x,h,addr,__pu_ret); break; \
119case 4: __put_user_asm(x,,addr,__pu_ret); break; \
120case 8: __put_user_asm(x,d,addr,__pu_ret); break; \
121default: __pu_ret = __put_user_bad(); break; \
122} } else { __pu_ret = -EFAULT; } __pu_ret; })
123
124#define __put_user_nocheck(x,addr,size) ({ \
125register int __pu_ret; \
126switch (size) { \
127case 1: __put_user_asm(x,b,addr,__pu_ret); break; \
128case 2: __put_user_asm(x,h,addr,__pu_ret); break; \
129case 4: __put_user_asm(x,,addr,__pu_ret); break; \
130case 8: __put_user_asm(x,d,addr,__pu_ret); break; \
131default: __pu_ret = __put_user_bad(); break; \
132} __pu_ret; })
133
134#define __put_user_asm(x,size,addr,ret) \
135__asm__ __volatile__( \
136 "/* Put user asm, inline. */\n" \
137"1:\t" "st"#size " %1, %2\n\t" \
138 "clr %0\n" \
139"2:\n\n\t" \
140 ".section .fixup,#alloc,#execinstr\n\t" \
141 ".align 4\n" \
142"3:\n\t" \
143 "b 2b\n\t" \
144 " mov %3, %0\n\t" \
145 ".previous\n\n\t" \
146 ".section __ex_table,#alloc\n\t" \
147 ".align 4\n\t" \
148 ".word 1b, 3b\n\t" \
149 ".previous\n\n\t" \
150 : "=&r" (ret) : "r" (x), "m" (*__m(addr)), \
151 "i" (-EFAULT))
152
153extern int __put_user_bad(void);
154
155#define __get_user_check(x,addr,size,type) ({ \
156register int __gu_ret; \
157register unsigned long __gu_val; \
158if (__access_ok(addr,size)) { \
159switch (size) { \
160case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
161case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
162case 4: __get_user_asm(__gu_val,,addr,__gu_ret); break; \
163case 8: __get_user_asm(__gu_val,d,addr,__gu_ret); break; \
164default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
165} } else { __gu_val = 0; __gu_ret = -EFAULT; } x = (type) __gu_val; __gu_ret; })
166
167#define __get_user_check_ret(x,addr,size,type,retval) ({ \
168register unsigned long __gu_val __asm__ ("l1"); \
169if (__access_ok(addr,size)) { \
170switch (size) { \
171case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
172case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
173case 4: __get_user_asm_ret(__gu_val,,addr,retval); break; \
174case 8: __get_user_asm_ret(__gu_val,d,addr,retval); break; \
175default: if (__get_user_bad()) return retval; \
176} x = (type) __gu_val; } else return retval; })
177
178#define __get_user_nocheck(x,addr,size,type) ({ \
179register int __gu_ret; \
180register unsigned long __gu_val; \
181switch (size) { \
182case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
183case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
184case 4: __get_user_asm(__gu_val,,addr,__gu_ret); break; \
185case 8: __get_user_asm(__gu_val,d,addr,__gu_ret); break; \
186default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
187} x = (type) __gu_val; __gu_ret; })
188
189#define __get_user_nocheck_ret(x,addr,size,type,retval) ({ \
190register unsigned long __gu_val __asm__ ("l1"); \
191switch (size) { \
192case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
193case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
194case 4: __get_user_asm_ret(__gu_val,,addr,retval); break; \
195case 8: __get_user_asm_ret(__gu_val,d,addr,retval); break; \
196default: if (__get_user_bad()) return retval; \
197} x = (type) __gu_val; })
198
199#define __get_user_asm(x,size,addr,ret) \
200__asm__ __volatile__( \
201 "/* Get user asm, inline. */\n" \
202"1:\t" "ld"#size " %2, %1\n\t" \
203 "clr %0\n" \
204"2:\n\n\t" \
205 ".section .fixup,#alloc,#execinstr\n\t" \
206 ".align 4\n" \
207"3:\n\t" \
208 "clr %1\n\t" \
209 "b 2b\n\t" \
210 " mov %3, %0\n\n\t" \
211 ".previous\n\t" \
212 ".section __ex_table,#alloc\n\t" \
213 ".align 4\n\t" \
214 ".word 1b, 3b\n\n\t" \
215 ".previous\n\t" \
216 : "=&r" (ret), "=&r" (x) : "m" (*__m(addr)), \
217 "i" (-EFAULT))
218
219#define __get_user_asm_ret(x,size,addr,retval) \
220if (__builtin_constant_p(retval) && retval == -EFAULT) \
221__asm__ __volatile__( \
222 "/* Get user asm ret, inline. */\n" \
223"1:\t" "ld"#size " %1, %0\n\n\t" \
224 ".section __ex_table,#alloc\n\t" \
225 ".align 4\n\t" \
226 ".word 1b,__ret_efault\n\n\t" \
227 ".previous\n\t" \
228 : "=&r" (x) : "m" (*__m(addr))); \
229else \
230__asm__ __volatile__( \
231 "/* Get user asm ret, inline. */\n" \
232"1:\t" "ld"#size " %1, %0\n\n\t" \
233 ".section .fixup,#alloc,#execinstr\n\t" \
234 ".align 4\n" \
235"3:\n\t" \
236 "ret\n\t" \
237 " restore %%g0, %2, %%o0\n\n\t" \
238 ".previous\n\t" \
239 ".section __ex_table,#alloc\n\t" \
240 ".align 4\n\t" \
241 ".word 1b, 3b\n\n\t" \
242 ".previous\n\t" \
243 : "=&r" (x) : "m" (*__m(addr)), "i" (retval))
244
245extern int __get_user_bad(void);
246
247extern unsigned long __copy_user(void __user *to, const void __user *from, unsigned long size);
248
249static inline unsigned long copy_to_user(void __user *to, const void *from, unsigned long n)
250{
251 if (n && __access_ok((unsigned long) to, n))
252 return __copy_user(to, (__force void __user *) from, n);
253 else
254 return n;
255}
256
257static inline unsigned long __copy_to_user(void __user *to, const void *from, unsigned long n)
258{
259 return __copy_user(to, (__force void __user *) from, n);
260}
261
262static inline unsigned long copy_from_user(void *to, const void __user *from, unsigned long n)
263{
Sam Ravnborgf5e706a2008-07-17 21:55:51 -0700264 if (n && __access_ok((unsigned long) from, n))
265 return __copy_user((__force void __user *) to, from, n);
266 else
267 return n;
268}
269
270static inline unsigned long __copy_from_user(void *to, const void __user *from, unsigned long n)
271{
272 return __copy_user((__force void __user *) to, from, n);
273}
274
275#define __copy_to_user_inatomic __copy_to_user
276#define __copy_from_user_inatomic __copy_from_user
277
278static inline unsigned long __clear_user(void __user *addr, unsigned long size)
279{
280 unsigned long ret;
281
282 __asm__ __volatile__ (
283 ".section __ex_table,#alloc\n\t"
284 ".align 4\n\t"
285 ".word 1f,3\n\t"
286 ".previous\n\t"
287 "mov %2, %%o1\n"
288 "1:\n\t"
289 "call __bzero\n\t"
290 " mov %1, %%o0\n\t"
291 "mov %%o0, %0\n"
292 : "=r" (ret) : "r" (addr), "r" (size) :
293 "o0", "o1", "o2", "o3", "o4", "o5", "o7",
294 "g1", "g2", "g3", "g4", "g5", "g7", "cc");
295
296 return ret;
297}
298
299static inline unsigned long clear_user(void __user *addr, unsigned long n)
300{
301 if (n && __access_ok((unsigned long) addr, n))
302 return __clear_user(addr, n);
303 else
304 return n;
305}
306
307extern long __strncpy_from_user(char *dest, const char __user *src, long count);
308
309static inline long strncpy_from_user(char *dest, const char __user *src, long count)
310{
311 if (__access_ok((unsigned long) src, count))
312 return __strncpy_from_user(dest, src, count);
313 else
314 return -EFAULT;
315}
316
317extern long __strlen_user(const char __user *);
318extern long __strnlen_user(const char __user *, long len);
319
320static inline long strlen_user(const char __user *str)
321{
322 if (!access_ok(VERIFY_READ, str, 0))
323 return 0;
324 else
325 return __strlen_user(str);
326}
327
328static inline long strnlen_user(const char __user *str, long len)
329{
330 if (!access_ok(VERIFY_READ, str, 0))
331 return 0;
332 else
333 return __strnlen_user(str, len);
334}
335
336#endif /* __ASSEMBLY__ */
337
338#endif /* _ASM_UACCESS_H */