Import 2.3.6
[davej-history.git] / include / asm-sparc64 / uaccess.h
bloba6f5c9a44bb24c74897cdb3accd470a10c12be90
1 /* $Id: uaccess.h,v 1.30 1999/05/25 16:53:32 jj Exp $ */
2 #ifndef _ASM_UACCESS_H
3 #define _ASM_UACCESS_H
5 /*
6 * User space memory access functions
7 */
9 #ifdef __KERNEL__
10 #include <linux/sched.h>
11 #include <linux/string.h>
12 #include <asm/a.out.h>
13 #include <asm/asi.h>
14 #include <asm/system.h>
15 #include <asm/spitfire.h>
16 #endif
18 #ifndef __ASSEMBLY__
21 * Sparc64 is segmented, though more like the M68K than the I386.
22 * We use the secondary ASI to address user memory, which references a
23 * completely different VM map, thus there is zero chance of the user
24 * doing something queer and tricking us into poking kernel memory.
26 * What is left here is basically what is needed for the other parts of
27 * the kernel that expect to be able to manipulate, erum, "segments".
28 * Or perhaps more properly, permissions.
30 * "For historical reasons, these macros are grossly misnamed." -Linus
33 #define KERNEL_DS ((mm_segment_t) { ASI_P })
34 #define USER_DS ((mm_segment_t) { ASI_AIUS }) /* har har har */
36 #define VERIFY_READ 0
37 #define VERIFY_WRITE 1
39 #define get_fs() (current->tss.current_ds)
40 #define get_ds() (KERNEL_DS)
42 #define segment_eq(a,b) ((a).seg == (b).seg)
44 #define set_fs(val) \
45 do { \
46 current->tss.current_ds = (val); \
47 __asm__ __volatile__ ("wr %%g0, %0, %%asi" : : "r" ((val).seg)); \
48 } while(0)
50 #define __user_ok(addr,size) 1
51 #define __kernel_ok (segment_eq(get_fs(), KERNEL_DS))
52 #define __access_ok(addr,size) 1
53 #define access_ok(type,addr,size) 1
55 extern inline int verify_area(int type, const void * addr, unsigned long size)
57 return 0;
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
65 * what to do.
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.
72 * There is a special way how to put a range of potentially faulting
73 * insns (like twenty ldd/std's with now intervening other instructions)
74 * You specify address of first in insn and 0 in fixup and in the next
75 * exception_table_entry you specify last potentially faulting insn + 1
76 * and in fixup the routine which should handle the fault.
77 * That fixup code will get
78 * (faulting_insn_address - first_insn_in_the_range_address)/4
79 * in %g2 (ie. index of the faulting instruction in the range).
82 struct exception_table_entry
84 unsigned insn, fixup;
87 /* Returns 0 if exception not found and fixup otherwise. */
88 extern unsigned long search_exception_table(unsigned long, unsigned long *);
90 extern void __ret_efault(void);
92 /* Uh, these should become the main single-value transfer routines..
93 * They automatically use the right size if we just have the right
94 * pointer type..
96 * This gets kind of ugly. We want to return _two_ values in "get_user()"
97 * and yet we don't want to do any pointers, because that is too much
98 * of a performance impact. Thus we have a few rather ugly macros here,
99 * and hide all the uglyness from the user.
101 #define put_user(x,ptr) ({ \
102 unsigned long __pu_addr = (unsigned long)(ptr); \
103 __put_user_nocheck((__typeof__(*(ptr)))(x),__pu_addr,sizeof(*(ptr))); })
105 #define put_user_ret(x,ptr,retval) ({ \
106 unsigned long __pu_addr = (unsigned long)(ptr); \
107 __put_user_nocheck_ret((__typeof__(*(ptr)))(x),__pu_addr,sizeof(*(ptr)),retval); })
109 #define get_user(x,ptr) ({ \
110 unsigned long __gu_addr = (unsigned long)(ptr); \
111 __get_user_nocheck((x),__gu_addr,sizeof(*(ptr)),__typeof__(*(ptr))); })
113 #define get_user_ret(x,ptr,retval) ({ \
114 unsigned long __gu_addr = (unsigned long)(ptr); \
115 __get_user_nocheck_ret((x),__gu_addr,sizeof(*(ptr)),__typeof__(*(ptr)),retval); })
117 #define __put_user(x,ptr) put_user(x,ptr)
118 #define __put_user_ret(x,ptr,retval) put_user_ret(x,ptr,retval)
119 #define __get_user(x,ptr) get_user(x,ptr)
120 #define __get_user_ret(x,ptr,retval) get_user_ret(x,ptr,retval)
122 struct __large_struct { unsigned long buf[100]; };
123 #define __m(x) ((struct __large_struct *)(x))
125 #define __put_user_nocheck(data,addr,size) ({ \
126 register int __pu_ret; \
127 switch (size) { \
128 case 1: __put_user_asm(data,b,addr,__pu_ret); break; \
129 case 2: __put_user_asm(data,h,addr,__pu_ret); break; \
130 case 4: __put_user_asm(data,w,addr,__pu_ret); break; \
131 case 8: __put_user_asm(data,x,addr,__pu_ret); break; \
132 default: __pu_ret = __put_user_bad(); break; \
133 } __pu_ret; })
135 #define __put_user_nocheck_ret(data,addr,size,retval) ({ \
136 register int __foo __asm__ ("l1"); \
137 switch (size) { \
138 case 1: __put_user_asm_ret(data,b,addr,retval,__foo); break; \
139 case 2: __put_user_asm_ret(data,h,addr,retval,__foo); break; \
140 case 4: __put_user_asm_ret(data,w,addr,retval,__foo); break; \
141 case 8: __put_user_asm_ret(data,x,addr,retval,__foo); break; \
142 default: if (__put_user_bad()) return retval; break; \
143 } })
145 #define __put_user_asm(x,size,addr,ret) \
146 __asm__ __volatile__( \
147 "/* Put user asm, inline. */\n" \
148 "1:\t" "st"#size "a %1, [%2] %%asi\n\t" \
149 "clr %0\n" \
150 "2:\n\n\t" \
151 ".section .fixup,#alloc,#execinstr\n\t" \
152 ".align 4\n" \
153 "3:\n\t" \
154 "b 2b\n\t" \
155 " mov %3, %0\n\n\t" \
156 ".previous\n\t" \
157 ".section __ex_table,#alloc\n\t" \
158 ".align 4\n\t" \
159 ".word 1b, 3b\n\t" \
160 ".previous\n\n\t" \
161 : "=r" (ret) : "r" (x), "r" (__m(addr)), \
162 "i" (-EFAULT))
164 #define __put_user_asm_ret(x,size,addr,ret,foo) \
165 if (__builtin_constant_p(ret) && ret == -EFAULT) \
166 __asm__ __volatile__( \
167 "/* Put user asm ret, inline. */\n" \
168 "1:\t" "st"#size "a %1, [%2] %%asi\n\n\t" \
169 ".section __ex_table,#alloc\n\t" \
170 ".align 4\n\t" \
171 ".word 1b, __ret_efault\n\n\t" \
172 ".previous\n\n\t" \
173 : "=r" (foo) : "r" (x), "r" (__m(addr))); \
174 else \
175 __asm__ __volatile( \
176 "/* Put user asm ret, inline. */\n" \
177 "1:\t" "st"#size "a %1, [%2] %%asi\n\n\t" \
178 ".section .fixup,#alloc,#execinstr\n\t" \
179 ".align 4\n" \
180 "3:\n\t" \
181 "ret\n\t" \
182 " restore %%g0, %3, %%o0\n\n\t" \
183 ".previous\n\t" \
184 ".section __ex_table,#alloc\n\t" \
185 ".align 4\n\t" \
186 ".word 1b, 3b\n\n\t" \
187 ".previous\n\n\t" \
188 : "=r" (foo) : "r" (x), "r" (__m(addr)), \
189 "i" (ret))
191 extern int __put_user_bad(void);
193 #define __get_user_nocheck(data,addr,size,type) ({ \
194 register int __gu_ret; \
195 register unsigned long __gu_val; \
196 switch (size) { \
197 case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
198 case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
199 case 4: __get_user_asm(__gu_val,uw,addr,__gu_ret); break; \
200 case 8: __get_user_asm(__gu_val,x,addr,__gu_ret); break; \
201 default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
202 } data = (type) __gu_val; __gu_ret; })
204 #define __get_user_nocheck_ret(data,addr,size,type,retval) ({ \
205 register unsigned long __gu_val __asm__ ("l1"); \
206 switch (size) { \
207 case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
208 case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
209 case 4: __get_user_asm_ret(__gu_val,uw,addr,retval); break; \
210 case 8: __get_user_asm_ret(__gu_val,x,addr,retval); break; \
211 default: if (__get_user_bad()) return retval; \
212 } data = (type) __gu_val; })
214 #define __get_user_asm(x,size,addr,ret) \
215 __asm__ __volatile__( \
216 "/* Get user asm, inline. */\n" \
217 "1:\t" "ld"#size "a [%2] %%asi, %1\n\t" \
218 "clr %0\n" \
219 "2:\n\n\t" \
220 ".section .fixup,#alloc,#execinstr\n\t" \
221 ".align 4\n" \
222 "3:\n\t" \
223 "clr %1\n\t" \
224 "b 2b\n\t" \
225 " mov %3, %0\n\n\t" \
226 ".previous\n\t" \
227 ".section __ex_table,#alloc\n\t" \
228 ".align 4\n\t" \
229 ".word 1b, 3b\n\n\t" \
230 ".previous\n\t" \
231 : "=r" (ret), "=r" (x) : "r" (__m(addr)), \
232 "i" (-EFAULT))
234 #define __get_user_asm_ret(x,size,addr,retval) \
235 if (__builtin_constant_p(retval) && retval == -EFAULT) \
236 __asm__ __volatile__( \
237 "/* Get user asm ret, inline. */\n" \
238 "1:\t" "ld"#size "a [%1] %%asi, %0\n\n\t" \
239 ".section __ex_table,#alloc\n\t" \
240 ".align 4\n\t" \
241 ".word 1b,__ret_efault\n\n\t" \
242 ".previous\n\t" \
243 : "=r" (x) : "r" (__m(addr))); \
244 else \
245 __asm__ __volatile__( \
246 "/* Get user asm ret, inline. */\n" \
247 "1:\t" "ld"#size "a [%1] %%asi, %0\n\n\t" \
248 ".section .fixup,#alloc,#execinstr\n\t" \
249 ".align 4\n" \
250 "3:\n\t" \
251 "ret\n\t" \
252 " restore %%g0, %2, %%o0\n\n\t" \
253 ".previous\n\t" \
254 ".section __ex_table,#alloc\n\t" \
255 ".align 4\n\t" \
256 ".word 1b, 3b\n\n\t" \
257 ".previous\n\t" \
258 : "=r" (x) : "r" (__m(addr)), "i" (retval))
260 extern int __get_user_bad(void);
262 extern __kernel_size_t __memcpy_short(void *to, const void *from,
263 __kernel_size_t size,
264 long asi_src, long asi_dst);
266 extern __kernel_size_t __memcpy_entry(void *to, const void *from,
267 __kernel_size_t size,
268 long asi_src, long asi_dst);
270 extern __kernel_size_t __memcpy_16plus(void *to, const void *from,
271 __kernel_size_t size,
272 long asi_src, long asi_dst);
274 extern __kernel_size_t __memcpy_386plus(void *to, const void *from,
275 __kernel_size_t size,
276 long asi_src, long asi_dst);
278 extern __kernel_size_t __copy_from_user(void *to, const void *from,
279 __kernel_size_t size);
281 extern __kernel_size_t __copy_to_user(void *to, const void *from,
282 __kernel_size_t size);
284 extern __kernel_size_t __copy_in_user(void *to, const void *from,
285 __kernel_size_t size);
287 #define copy_from_user(to,from,n) \
288 __copy_from_user((void *)(to), \
289 (void *)(from), (__kernel_size_t)(n))
291 #define copy_from_user_ret(to,from,n,retval) ({ \
292 if (copy_from_user(to,from,n)) \
293 return retval; \
296 #define __copy_from_user_ret(to,from,n,retval) ({ \
297 if (__copy_from_user(to,from,n)) \
298 return retval; \
301 #define copy_to_user(to,from,n) \
302 __copy_to_user((void *)(to), \
303 (void *) (from), (__kernel_size_t)(n))
305 #define copy_to_user_ret(to,from,n,retval) ({ \
306 if (copy_to_user(to,from,n)) \
307 return retval; \
310 #define __copy_to_user_ret(to,from,n,retval) ({ \
311 if (__copy_to_user(to,from,n)) \
312 return retval; \
315 #define copy_in_user(to,from,n) \
316 __copy_in_user((void *)(to), \
317 (void *) (from), (__kernel_size_t)(n))
319 #define copy_in_user_ret(to,from,n,retval) ({ \
320 if (copy_in_user(to,from,n)) \
321 return retval; \
324 #define __copy_in_user_ret(to,from,n,retval) ({ \
325 if (__copy_in_user(to,from,n)) \
326 return retval; \
329 extern __inline__ __kernel_size_t __clear_user(void *addr, __kernel_size_t size)
331 extern __kernel_size_t __bzero_noasi(void *addr, __kernel_size_t size);
333 return __bzero_noasi(addr, size);
336 #define clear_user(addr,n) \
337 __clear_user((void *)(addr), (__kernel_size_t)(n))
339 #define clear_user_ret(addr,size,retval) ({ \
340 if (clear_user(addr,size)) \
341 return retval; \
344 extern int __strncpy_from_user(unsigned long dest, unsigned long src, int count);
346 #define strncpy_from_user(dest,src,count) \
347 __strncpy_from_user((unsigned long)(dest), (unsigned long)(src), (int)(count))
349 extern int __strlen_user(const char *);
351 #define strlen_user __strlen_user
353 #endif /* __ASSEMBLY__ */
355 #endif /* _ASM_UACCESS_H */