uaccess.h 13 KB

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