uaccess.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335
  1. /* $Id: uaccess.h,v 1.35 2002/02/09 19:49:31 davem Exp $ */
  2. #ifndef _ASM_UACCESS_H
  3. #define _ASM_UACCESS_H
  4. /*
  5. * User space memory access functions
  6. */
  7. #ifdef __KERNEL__
  8. #include <linux/compiler.h>
  9. #include <linux/sched.h>
  10. #include <linux/string.h>
  11. #include <asm/a.out.h>
  12. #include <asm/asi.h>
  13. #include <asm/system.h>
  14. #include <asm/spitfire.h>
  15. #include <asm-generic/uaccess.h>
  16. #endif
  17. #ifndef __ASSEMBLY__
  18. /*
  19. * Sparc64 is segmented, though more like the M68K than the I386.
  20. * We use the secondary ASI to address user memory, which references a
  21. * completely different VM map, thus there is zero chance of the user
  22. * doing something queer and tricking us into poking kernel memory.
  23. *
  24. * What is left here is basically what is needed for the other parts of
  25. * the kernel that expect to be able to manipulate, erum, "segments".
  26. * Or perhaps more properly, permissions.
  27. *
  28. * "For historical reasons, these macros are grossly misnamed." -Linus
  29. */
  30. #define KERNEL_DS ((mm_segment_t) { ASI_P })
  31. #define USER_DS ((mm_segment_t) { ASI_AIUS }) /* har har har */
  32. #define VERIFY_READ 0
  33. #define VERIFY_WRITE 1
  34. #define get_fs() ((mm_segment_t) { get_thread_current_ds() })
  35. #define get_ds() (KERNEL_DS)
  36. #define segment_eq(a,b) ((a).seg == (b).seg)
  37. #define set_fs(val) \
  38. do { \
  39. set_thread_current_ds((val).seg); \
  40. __asm__ __volatile__ ("wr %%g0, %0, %%asi" : : "r" ((val).seg)); \
  41. } while(0)
  42. static inline int __access_ok(const void __user * addr, unsigned long size)
  43. {
  44. return 1;
  45. }
  46. static inline int access_ok(int type, const void __user * addr, unsigned long size)
  47. {
  48. return 1;
  49. }
  50. /* this function will go away soon - use access_ok() instead */
  51. static inline int __deprecated verify_area(int type, const void __user * addr, unsigned long size)
  52. {
  53. return 0;
  54. }
  55. /*
  56. * The exception table consists of pairs of addresses: the first is the
  57. * address of an instruction that is allowed to fault, and the second is
  58. * the address at which the program should continue. No registers are
  59. * modified, so it is entirely up to the continuation code to figure out
  60. * what to do.
  61. *
  62. * All the routines below use bits of fixup code that are out of line
  63. * with the main instruction path. This means when everything is well,
  64. * we don't even have to jump over them. Further, they do not intrude
  65. * on our cache or tlb entries.
  66. *
  67. * There is a special way how to put a range of potentially faulting
  68. * insns (like twenty ldd/std's with now intervening other instructions)
  69. * You specify address of first in insn and 0 in fixup and in the next
  70. * exception_table_entry you specify last potentially faulting insn + 1
  71. * and in fixup the routine which should handle the fault.
  72. * That fixup code will get
  73. * (faulting_insn_address - first_insn_in_the_range_address)/4
  74. * in %g2 (ie. index of the faulting instruction in the range).
  75. */
  76. struct exception_table_entry
  77. {
  78. unsigned insn, fixup;
  79. };
  80. /* Special exable search, which handles ranges. Returns fixup */
  81. unsigned long search_extables_range(unsigned long addr, unsigned long *g2);
  82. extern void __ret_efault(void);
  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) ({ \
  93. unsigned long __pu_addr = (unsigned long)(ptr); \
  94. __chk_user_ptr(ptr); \
  95. __put_user_nocheck((__typeof__(*(ptr)))(x),__pu_addr,sizeof(*(ptr))); })
  96. #define get_user(x,ptr) ({ \
  97. unsigned long __gu_addr = (unsigned long)(ptr); \
  98. __chk_user_ptr(ptr); \
  99. __get_user_nocheck((x),__gu_addr,sizeof(*(ptr)),__typeof__(*(ptr))); })
  100. #define __put_user(x,ptr) put_user(x,ptr)
  101. #define __get_user(x,ptr) get_user(x,ptr)
  102. struct __large_struct { unsigned long buf[100]; };
  103. #define __m(x) ((struct __large_struct *)(x))
  104. #define __put_user_nocheck(data,addr,size) ({ \
  105. register int __pu_ret; \
  106. switch (size) { \
  107. case 1: __put_user_asm(data,b,addr,__pu_ret); break; \
  108. case 2: __put_user_asm(data,h,addr,__pu_ret); break; \
  109. case 4: __put_user_asm(data,w,addr,__pu_ret); break; \
  110. case 8: __put_user_asm(data,x,addr,__pu_ret); break; \
  111. default: __pu_ret = __put_user_bad(); break; \
  112. } __pu_ret; })
  113. #define __put_user_nocheck_ret(data,addr,size,retval) ({ \
  114. register int __foo __asm__ ("l1"); \
  115. switch (size) { \
  116. case 1: __put_user_asm_ret(data,b,addr,retval,__foo); break; \
  117. case 2: __put_user_asm_ret(data,h,addr,retval,__foo); break; \
  118. case 4: __put_user_asm_ret(data,w,addr,retval,__foo); break; \
  119. case 8: __put_user_asm_ret(data,x,addr,retval,__foo); break; \
  120. default: if (__put_user_bad()) return retval; break; \
  121. } })
  122. #define __put_user_asm(x,size,addr,ret) \
  123. __asm__ __volatile__( \
  124. "/* Put user asm, inline. */\n" \
  125. "1:\t" "st"#size "a %1, [%2] %%asi\n\t" \
  126. "clr %0\n" \
  127. "2:\n\n\t" \
  128. ".section .fixup,#alloc,#execinstr\n\t" \
  129. ".align 4\n" \
  130. "3:\n\t" \
  131. "b 2b\n\t" \
  132. " mov %3, %0\n\n\t" \
  133. ".previous\n\t" \
  134. ".section __ex_table,#alloc\n\t" \
  135. ".align 4\n\t" \
  136. ".word 1b, 3b\n\t" \
  137. ".previous\n\n\t" \
  138. : "=r" (ret) : "r" (x), "r" (__m(addr)), \
  139. "i" (-EFAULT))
  140. #define __put_user_asm_ret(x,size,addr,ret,foo) \
  141. if (__builtin_constant_p(ret) && ret == -EFAULT) \
  142. __asm__ __volatile__( \
  143. "/* Put user asm ret, inline. */\n" \
  144. "1:\t" "st"#size "a %1, [%2] %%asi\n\n\t" \
  145. ".section __ex_table,#alloc\n\t" \
  146. ".align 4\n\t" \
  147. ".word 1b, __ret_efault\n\n\t" \
  148. ".previous\n\n\t" \
  149. : "=r" (foo) : "r" (x), "r" (__m(addr))); \
  150. else \
  151. __asm__ __volatile__( \
  152. "/* Put user asm ret, inline. */\n" \
  153. "1:\t" "st"#size "a %1, [%2] %%asi\n\n\t" \
  154. ".section .fixup,#alloc,#execinstr\n\t" \
  155. ".align 4\n" \
  156. "3:\n\t" \
  157. "ret\n\t" \
  158. " restore %%g0, %3, %%o0\n\n\t" \
  159. ".previous\n\t" \
  160. ".section __ex_table,#alloc\n\t" \
  161. ".align 4\n\t" \
  162. ".word 1b, 3b\n\n\t" \
  163. ".previous\n\n\t" \
  164. : "=r" (foo) : "r" (x), "r" (__m(addr)), \
  165. "i" (ret))
  166. extern int __put_user_bad(void);
  167. #define __get_user_nocheck(data,addr,size,type) ({ \
  168. register int __gu_ret; \
  169. register unsigned long __gu_val; \
  170. switch (size) { \
  171. case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
  172. case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
  173. case 4: __get_user_asm(__gu_val,uw,addr,__gu_ret); break; \
  174. case 8: __get_user_asm(__gu_val,x,addr,__gu_ret); break; \
  175. default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
  176. } data = (type) __gu_val; __gu_ret; })
  177. #define __get_user_nocheck_ret(data,addr,size,type,retval) ({ \
  178. register unsigned long __gu_val __asm__ ("l1"); \
  179. switch (size) { \
  180. case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
  181. case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
  182. case 4: __get_user_asm_ret(__gu_val,uw,addr,retval); break; \
  183. case 8: __get_user_asm_ret(__gu_val,x,addr,retval); break; \
  184. default: if (__get_user_bad()) return retval; \
  185. } data = (type) __gu_val; })
  186. #define __get_user_asm(x,size,addr,ret) \
  187. __asm__ __volatile__( \
  188. "/* Get user asm, inline. */\n" \
  189. "1:\t" "ld"#size "a [%2] %%asi, %1\n\t" \
  190. "clr %0\n" \
  191. "2:\n\n\t" \
  192. ".section .fixup,#alloc,#execinstr\n\t" \
  193. ".align 4\n" \
  194. "3:\n\t" \
  195. "clr %1\n\t" \
  196. "b 2b\n\t" \
  197. " mov %3, %0\n\n\t" \
  198. ".previous\n\t" \
  199. ".section __ex_table,#alloc\n\t" \
  200. ".align 4\n\t" \
  201. ".word 1b, 3b\n\n\t" \
  202. ".previous\n\t" \
  203. : "=r" (ret), "=r" (x) : "r" (__m(addr)), \
  204. "i" (-EFAULT))
  205. #define __get_user_asm_ret(x,size,addr,retval) \
  206. if (__builtin_constant_p(retval) && retval == -EFAULT) \
  207. __asm__ __volatile__( \
  208. "/* Get user asm ret, inline. */\n" \
  209. "1:\t" "ld"#size "a [%1] %%asi, %0\n\n\t" \
  210. ".section __ex_table,#alloc\n\t" \
  211. ".align 4\n\t" \
  212. ".word 1b,__ret_efault\n\n\t" \
  213. ".previous\n\t" \
  214. : "=r" (x) : "r" (__m(addr))); \
  215. else \
  216. __asm__ __volatile__( \
  217. "/* Get user asm ret, inline. */\n" \
  218. "1:\t" "ld"#size "a [%1] %%asi, %0\n\n\t" \
  219. ".section .fixup,#alloc,#execinstr\n\t" \
  220. ".align 4\n" \
  221. "3:\n\t" \
  222. "ret\n\t" \
  223. " restore %%g0, %2, %%o0\n\n\t" \
  224. ".previous\n\t" \
  225. ".section __ex_table,#alloc\n\t" \
  226. ".align 4\n\t" \
  227. ".word 1b, 3b\n\n\t" \
  228. ".previous\n\t" \
  229. : "=r" (x) : "r" (__m(addr)), "i" (retval))
  230. extern int __get_user_bad(void);
  231. extern unsigned long __must_check ___copy_from_user(void *to,
  232. const void __user *from,
  233. unsigned long size);
  234. extern unsigned long copy_from_user_fixup(void *to, const void __user *from,
  235. unsigned long size);
  236. static inline unsigned long __must_check
  237. copy_from_user(void *to, const void __user *from, unsigned long size)
  238. {
  239. unsigned long ret = ___copy_from_user(to, from, size);
  240. if (ret)
  241. ret = copy_from_user_fixup(to, from, size);
  242. return ret;
  243. }
  244. #define __copy_from_user copy_from_user
  245. extern unsigned long __must_check ___copy_to_user(void __user *to,
  246. const void *from,
  247. unsigned long size);
  248. extern unsigned long copy_to_user_fixup(void __user *to, const void *from,
  249. unsigned long size);
  250. static inline unsigned long __must_check
  251. copy_to_user(void __user *to, const void *from, unsigned long size)
  252. {
  253. unsigned long ret = ___copy_to_user(to, from, size);
  254. if (ret)
  255. ret = copy_to_user_fixup(to, from, size);
  256. return ret;
  257. }
  258. #define __copy_to_user copy_to_user
  259. extern unsigned long __must_check ___copy_in_user(void __user *to,
  260. const void __user *from,
  261. unsigned long size);
  262. extern unsigned long copy_in_user_fixup(void __user *to, void __user *from,
  263. unsigned long size);
  264. static inline unsigned long __must_check
  265. copy_in_user(void __user *to, void __user *from, unsigned long size)
  266. {
  267. unsigned long ret = ___copy_in_user(to, from, size);
  268. if (ret)
  269. ret = copy_in_user_fixup(to, from, size);
  270. return ret;
  271. }
  272. #define __copy_in_user copy_in_user
  273. extern unsigned long __must_check __bzero_noasi(void __user *, unsigned long);
  274. static inline unsigned long __must_check
  275. __clear_user(void __user *addr, unsigned long size)
  276. {
  277. return __bzero_noasi(addr, size);
  278. }
  279. #define clear_user __clear_user
  280. extern long __must_check __strncpy_from_user(char *dest, const char __user *src, long count);
  281. #define strncpy_from_user __strncpy_from_user
  282. extern long __strlen_user(const char __user *);
  283. extern long __strnlen_user(const char __user *, long len);
  284. #define strlen_user __strlen_user
  285. #define strnlen_user __strnlen_user
  286. #define __copy_to_user_inatomic __copy_to_user
  287. #define __copy_from_user_inatomic __copy_from_user
  288. #endif /* __ASSEMBLY__ */
  289. #endif /* _ASM_UACCESS_H */