uaccess.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393
  1. #ifdef __KERNEL__
  2. #ifndef _PPC_UACCESS_H
  3. #define _PPC_UACCESS_H
  4. #ifndef __ASSEMBLY__
  5. #include <linux/sched.h>
  6. #include <linux/errno.h>
  7. #include <asm/processor.h>
  8. #define VERIFY_READ 0
  9. #define VERIFY_WRITE 1
  10. /*
  11. * The fs value determines whether argument validity checking should be
  12. * performed or not. If get_fs() == USER_DS, checking is performed, with
  13. * get_fs() == KERNEL_DS, checking is bypassed.
  14. *
  15. * For historical reasons, these macros are grossly misnamed.
  16. *
  17. * The fs/ds values are now the highest legal address in the "segment".
  18. * This simplifies the checking in the routines below.
  19. */
  20. #define KERNEL_DS ((mm_segment_t) { ~0UL })
  21. #define USER_DS ((mm_segment_t) { TASK_SIZE - 1 })
  22. #define get_ds() (KERNEL_DS)
  23. #define get_fs() (current->thread.fs)
  24. #define set_fs(val) (current->thread.fs = (val))
  25. #define segment_eq(a,b) ((a).seg == (b).seg)
  26. #define __access_ok(addr,size) \
  27. ((addr) <= current->thread.fs.seg \
  28. && ((size) == 0 || (size) - 1 <= current->thread.fs.seg - (addr)))
  29. #define access_ok(type, addr, size) \
  30. (__chk_user_ptr(addr),__access_ok((unsigned long)(addr),(size)))
  31. /*
  32. * The exception table consists of pairs of addresses: the first is the
  33. * address of an instruction that is allowed to fault, and the second is
  34. * the address at which the program should continue. No registers are
  35. * modified, so it is entirely up to the continuation code to figure out
  36. * what to do.
  37. *
  38. * All the routines below use bits of fixup code that are out of line
  39. * with the main instruction path. This means when everything is well,
  40. * we don't even have to jump over them. Further, they do not intrude
  41. * on our cache or tlb entries.
  42. */
  43. struct exception_table_entry
  44. {
  45. unsigned long insn, fixup;
  46. };
  47. /*
  48. * These are the main single-value transfer routines. They automatically
  49. * use the right size if we just have the right pointer type.
  50. *
  51. * This gets kind of ugly. We want to return _two_ values in "get_user()"
  52. * and yet we don't want to do any pointers, because that is too much
  53. * of a performance impact. Thus we have a few rather ugly macros here,
  54. * and hide all the ugliness from the user.
  55. *
  56. * The "__xxx" versions of the user access functions are versions that
  57. * do not verify the address space, that must have been done previously
  58. * with a separate "access_ok()" call (this is used when we do multiple
  59. * accesses to the same area of user memory).
  60. *
  61. * As we use the same address space for kernel and user data on the
  62. * PowerPC, we can just do these as direct assignments. (Of course, the
  63. * exception handling means that it's no longer "just"...)
  64. *
  65. * The "user64" versions of the user access functions are versions that
  66. * allow access of 64-bit data. The "get_user" functions do not
  67. * properly handle 64-bit data because the value gets down cast to a long.
  68. * The "put_user" functions already handle 64-bit data properly but we add
  69. * "user64" versions for completeness
  70. */
  71. #define get_user(x,ptr) \
  72. __get_user_check((x),(ptr),sizeof(*(ptr)))
  73. #define get_user64(x,ptr) \
  74. __get_user64_check((x),(ptr),sizeof(*(ptr)))
  75. #define put_user(x,ptr) \
  76. __put_user_check((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
  77. #define put_user64(x,ptr) put_user(x,ptr)
  78. #define __get_user(x,ptr) \
  79. __get_user_nocheck((x),(ptr),sizeof(*(ptr)))
  80. #define __get_user64(x,ptr) \
  81. __get_user64_nocheck((x),(ptr),sizeof(*(ptr)))
  82. #define __put_user(x,ptr) \
  83. __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
  84. #define __put_user64(x,ptr) __put_user(x,ptr)
  85. extern long __put_user_bad(void);
  86. #define __put_user_nocheck(x,ptr,size) \
  87. ({ \
  88. long __pu_err; \
  89. __chk_user_ptr(ptr); \
  90. __put_user_size((x),(ptr),(size),__pu_err); \
  91. __pu_err; \
  92. })
  93. #define __put_user_check(x,ptr,size) \
  94. ({ \
  95. long __pu_err = -EFAULT; \
  96. __typeof__(*(ptr)) __user *__pu_addr = (ptr); \
  97. if (access_ok(VERIFY_WRITE,__pu_addr,size)) \
  98. __put_user_size((x),__pu_addr,(size),__pu_err); \
  99. __pu_err; \
  100. })
  101. #define __put_user_size(x,ptr,size,retval) \
  102. do { \
  103. retval = 0; \
  104. switch (size) { \
  105. case 1: \
  106. __put_user_asm(x, ptr, retval, "stb"); \
  107. break; \
  108. case 2: \
  109. __put_user_asm(x, ptr, retval, "sth"); \
  110. break; \
  111. case 4: \
  112. __put_user_asm(x, ptr, retval, "stw"); \
  113. break; \
  114. case 8: \
  115. __put_user_asm2(x, ptr, retval); \
  116. break; \
  117. default: \
  118. __put_user_bad(); \
  119. } \
  120. } while (0)
  121. /*
  122. * We don't tell gcc that we are accessing memory, but this is OK
  123. * because we do not write to any memory gcc knows about, so there
  124. * are no aliasing issues.
  125. */
  126. #define __put_user_asm(x, addr, err, op) \
  127. __asm__ __volatile__( \
  128. "1: "op" %1,0(%2)\n" \
  129. "2:\n" \
  130. ".section .fixup,\"ax\"\n" \
  131. "3: li %0,%3\n" \
  132. " b 2b\n" \
  133. ".previous\n" \
  134. ".section __ex_table,\"a\"\n" \
  135. " .align 2\n" \
  136. " .long 1b,3b\n" \
  137. ".previous" \
  138. : "=r" (err) \
  139. : "r" (x), "b" (addr), "i" (-EFAULT), "0" (err))
  140. #define __put_user_asm2(x, addr, err) \
  141. __asm__ __volatile__( \
  142. "1: stw %1,0(%2)\n" \
  143. "2: stw %1+1,4(%2)\n" \
  144. "3:\n" \
  145. ".section .fixup,\"ax\"\n" \
  146. "4: li %0,%3\n" \
  147. " b 3b\n" \
  148. ".previous\n" \
  149. ".section __ex_table,\"a\"\n" \
  150. " .align 2\n" \
  151. " .long 1b,4b\n" \
  152. " .long 2b,4b\n" \
  153. ".previous" \
  154. : "=r" (err) \
  155. : "r" (x), "b" (addr), "i" (-EFAULT), "0" (err))
  156. #define __get_user_nocheck(x, ptr, size) \
  157. ({ \
  158. long __gu_err; \
  159. unsigned long __gu_val; \
  160. __chk_user_ptr(ptr); \
  161. __get_user_size(__gu_val, (ptr), (size), __gu_err); \
  162. (x) = (__typeof__(*(ptr)))__gu_val; \
  163. __gu_err; \
  164. })
  165. #define __get_user64_nocheck(x, ptr, size) \
  166. ({ \
  167. long __gu_err; \
  168. long long __gu_val; \
  169. __chk_user_ptr(ptr); \
  170. __get_user_size64(__gu_val, (ptr), (size), __gu_err); \
  171. (x) = (__typeof__(*(ptr)))__gu_val; \
  172. __gu_err; \
  173. })
  174. #define __get_user_check(x, ptr, size) \
  175. ({ \
  176. long __gu_err = -EFAULT; \
  177. unsigned long __gu_val = 0; \
  178. const __typeof__(*(ptr)) __user *__gu_addr = (ptr); \
  179. if (access_ok(VERIFY_READ, __gu_addr, (size))) \
  180. __get_user_size(__gu_val, __gu_addr, (size), __gu_err); \
  181. (x) = (__typeof__(*(ptr)))__gu_val; \
  182. __gu_err; \
  183. })
  184. #define __get_user64_check(x, ptr, size) \
  185. ({ \
  186. long __gu_err = -EFAULT; \
  187. long long __gu_val = 0; \
  188. const __typeof__(*(ptr)) __user *__gu_addr = (ptr); \
  189. if (access_ok(VERIFY_READ, __gu_addr, (size))) \
  190. __get_user_size64(__gu_val, __gu_addr, (size), __gu_err); \
  191. (x) = (__typeof__(*(ptr)))__gu_val; \
  192. __gu_err; \
  193. })
  194. extern long __get_user_bad(void);
  195. #define __get_user_size(x, ptr, size, retval) \
  196. do { \
  197. retval = 0; \
  198. switch (size) { \
  199. case 1: \
  200. __get_user_asm(x, ptr, retval, "lbz"); \
  201. break; \
  202. case 2: \
  203. __get_user_asm(x, ptr, retval, "lhz"); \
  204. break; \
  205. case 4: \
  206. __get_user_asm(x, ptr, retval, "lwz"); \
  207. break; \
  208. default: \
  209. x = __get_user_bad(); \
  210. } \
  211. } while (0)
  212. #define __get_user_size64(x, ptr, size, retval) \
  213. do { \
  214. retval = 0; \
  215. switch (size) { \
  216. case 1: \
  217. __get_user_asm(x, ptr, retval, "lbz"); \
  218. break; \
  219. case 2: \
  220. __get_user_asm(x, ptr, retval, "lhz"); \
  221. break; \
  222. case 4: \
  223. __get_user_asm(x, ptr, retval, "lwz"); \
  224. break; \
  225. case 8: \
  226. __get_user_asm2(x, ptr, retval); \
  227. break; \
  228. default: \
  229. x = __get_user_bad(); \
  230. } \
  231. } while (0)
  232. #define __get_user_asm(x, addr, err, op) \
  233. __asm__ __volatile__( \
  234. "1: "op" %1,0(%2)\n" \
  235. "2:\n" \
  236. ".section .fixup,\"ax\"\n" \
  237. "3: li %0,%3\n" \
  238. " li %1,0\n" \
  239. " b 2b\n" \
  240. ".previous\n" \
  241. ".section __ex_table,\"a\"\n" \
  242. " .align 2\n" \
  243. " .long 1b,3b\n" \
  244. ".previous" \
  245. : "=r"(err), "=r"(x) \
  246. : "b"(addr), "i"(-EFAULT), "0"(err))
  247. #define __get_user_asm2(x, addr, err) \
  248. __asm__ __volatile__( \
  249. "1: lwz %1,0(%2)\n" \
  250. "2: lwz %1+1,4(%2)\n" \
  251. "3:\n" \
  252. ".section .fixup,\"ax\"\n" \
  253. "4: li %0,%3\n" \
  254. " li %1,0\n" \
  255. " li %1+1,0\n" \
  256. " b 3b\n" \
  257. ".previous\n" \
  258. ".section __ex_table,\"a\"\n" \
  259. " .align 2\n" \
  260. " .long 1b,4b\n" \
  261. " .long 2b,4b\n" \
  262. ".previous" \
  263. : "=r"(err), "=&r"(x) \
  264. : "b"(addr), "i"(-EFAULT), "0"(err))
  265. /* more complex routines */
  266. extern int __copy_tofrom_user(void __user *to, const void __user *from,
  267. unsigned long size);
  268. extern inline unsigned long
  269. copy_from_user(void *to, const void __user *from, unsigned long n)
  270. {
  271. unsigned long over;
  272. if (access_ok(VERIFY_READ, from, n))
  273. return __copy_tofrom_user((__force void __user *)to, from, n);
  274. if ((unsigned long)from < TASK_SIZE) {
  275. over = (unsigned long)from + n - TASK_SIZE;
  276. return __copy_tofrom_user((__force void __user *)to, from, n - over) + over;
  277. }
  278. return n;
  279. }
  280. extern inline unsigned long
  281. copy_to_user(void __user *to, const void *from, unsigned long n)
  282. {
  283. unsigned long over;
  284. if (access_ok(VERIFY_WRITE, to, n))
  285. return __copy_tofrom_user(to, (__force void __user *) from, n);
  286. if ((unsigned long)to < TASK_SIZE) {
  287. over = (unsigned long)to + n - TASK_SIZE;
  288. return __copy_tofrom_user(to, (__force void __user *) from, n - over) + over;
  289. }
  290. return n;
  291. }
  292. static inline unsigned long __copy_from_user(void *to, const void __user *from, unsigned long size)
  293. {
  294. return __copy_tofrom_user((__force void __user *)to, from, size);
  295. }
  296. static inline unsigned long __copy_to_user(void __user *to, const void *from, unsigned long size)
  297. {
  298. return __copy_tofrom_user(to, (__force void __user *)from, size);
  299. }
  300. #define __copy_to_user_inatomic __copy_to_user
  301. #define __copy_from_user_inatomic __copy_from_user
  302. extern unsigned long __clear_user(void __user *addr, unsigned long size);
  303. extern inline unsigned long
  304. clear_user(void __user *addr, unsigned long size)
  305. {
  306. if (access_ok(VERIFY_WRITE, addr, size))
  307. return __clear_user(addr, size);
  308. if ((unsigned long)addr < TASK_SIZE) {
  309. unsigned long over = (unsigned long)addr + size - TASK_SIZE;
  310. return __clear_user(addr, size - over) + over;
  311. }
  312. return size;
  313. }
  314. extern int __strncpy_from_user(char *dst, const char __user *src, long count);
  315. extern inline long
  316. strncpy_from_user(char *dst, const char __user *src, long count)
  317. {
  318. if (access_ok(VERIFY_READ, src, 1))
  319. return __strncpy_from_user(dst, src, count);
  320. return -EFAULT;
  321. }
  322. /*
  323. * Return the size of a string (including the ending 0)
  324. *
  325. * Return 0 for error
  326. */
  327. extern int __strnlen_user(const char __user *str, long len, unsigned long top);
  328. /*
  329. * Returns the length of the string at str (including the null byte),
  330. * or 0 if we hit a page we can't access,
  331. * or something > len if we didn't find a null byte.
  332. *
  333. * The `top' parameter to __strnlen_user is to make sure that
  334. * we can never overflow from the user area into kernel space.
  335. */
  336. extern __inline__ int strnlen_user(const char __user *str, long len)
  337. {
  338. unsigned long top = current->thread.fs.seg;
  339. if ((unsigned long)str > top)
  340. return 0;
  341. return __strnlen_user(str, len, top);
  342. }
  343. #define strlen_user(str) strnlen_user((str), 0x7ffffffe)
  344. #endif /* __ASSEMBLY__ */
  345. #endif /* _PPC_UACCESS_H */
  346. #endif /* __KERNEL__ */