uaccess_64.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458
  1. #ifndef __X86_64_UACCESS_H
  2. #define __X86_64_UACCESS_H
  3. /*
  4. * User space memory access functions
  5. */
  6. #include <linux/compiler.h>
  7. #include <linux/errno.h>
  8. #include <linux/prefetch.h>
  9. #include <asm/page.h>
  10. #define VERIFY_READ 0
  11. #define VERIFY_WRITE 1
  12. /*
  13. * The fs value determines whether argument validity checking should be
  14. * performed or not. If get_fs() == USER_DS, checking is performed, with
  15. * get_fs() == KERNEL_DS, checking is bypassed.
  16. *
  17. * For historical reasons, these macros are grossly misnamed.
  18. */
  19. #define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
  20. #define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFFFFFFFFFFUL)
  21. #define USER_DS MAKE_MM_SEG(PAGE_OFFSET)
  22. #define get_ds() (KERNEL_DS)
  23. #define get_fs() (current_thread_info()->addr_limit)
  24. #define set_fs(x) (current_thread_info()->addr_limit = (x))
  25. #define segment_eq(a, b) ((a).seg == (b).seg)
  26. #define __addr_ok(addr) (!((unsigned long)(addr) & \
  27. (current_thread_info()->addr_limit.seg)))
  28. /*
  29. * Uhhuh, this needs 65-bit arithmetic. We have a carry..
  30. */
  31. #define __range_not_ok(addr, size) \
  32. ({ \
  33. unsigned long flag, roksum; \
  34. __chk_user_ptr(addr); \
  35. asm("# range_ok\n\r" \
  36. "addq %3,%1 ; sbbq %0,%0 ; cmpq %1,%4 ; sbbq $0,%0" \
  37. : "=&r" (flag), "=r" (roksum) \
  38. : "1" (addr), "g" ((long)(size)), \
  39. "g" (current_thread_info()->addr_limit.seg)); \
  40. flag; \
  41. })
  42. #define access_ok(type, addr, size) (__range_not_ok(addr, size) == 0)
  43. /*
  44. * The exception table consists of pairs of addresses: the first is the
  45. * address of an instruction that is allowed to fault, and the second is
  46. * the address at which the program should continue. No registers are
  47. * modified, so it is entirely up to the continuation code to figure out
  48. * what to do.
  49. *
  50. * All the routines below use bits of fixup code that are out of line
  51. * with the main instruction path. This means when everything is well,
  52. * we don't even have to jump over them. Further, they do not intrude
  53. * on our cache or tlb entries.
  54. */
  55. struct exception_table_entry {
  56. unsigned long insn, fixup;
  57. };
  58. extern int fixup_exception(struct pt_regs *regs);
  59. #define ARCH_HAS_SEARCH_EXTABLE
  60. /*
  61. * These are the main single-value transfer routines. They automatically
  62. * use the right size if we just have the right pointer type.
  63. *
  64. * This gets kind of ugly. We want to return _two_ values in "get_user()"
  65. * and yet we don't want to do any pointers, because that is too much
  66. * of a performance impact. Thus we have a few rather ugly macros here,
  67. * and hide all the ugliness from the user.
  68. *
  69. * The "__xxx" versions of the user access functions are versions that
  70. * do not verify the address space, that must have been done previously
  71. * with a separate "access_ok()" call (this is used when we do multiple
  72. * accesses to the same area of user memory).
  73. */
  74. #define __get_user_x(size, ret, x, ptr) \
  75. asm volatile("call __get_user_" #size \
  76. : "=a" (ret),"=d" (x) \
  77. : "c" (ptr) \
  78. : "r8")
  79. /* Careful: we have to cast the result to the type of the pointer
  80. * for sign reasons */
  81. #define get_user(x, ptr) \
  82. ({ \
  83. unsigned long __val_gu; \
  84. int __ret_gu; \
  85. __chk_user_ptr(ptr); \
  86. switch (sizeof(*(ptr))) { \
  87. case 1: \
  88. __get_user_x(1, __ret_gu, __val_gu, ptr); \
  89. break; \
  90. case 2: \
  91. __get_user_x(2, __ret_gu, __val_gu, ptr); \
  92. break; \
  93. case 4: \
  94. __get_user_x(4, __ret_gu, __val_gu, ptr); \
  95. break; \
  96. case 8: \
  97. __get_user_x(8, __ret_gu, __val_gu, ptr); \
  98. break; \
  99. default: \
  100. __get_user_bad(); \
  101. break; \
  102. } \
  103. (x) = (__force typeof(*(ptr)))__val_gu; \
  104. __ret_gu; \
  105. })
  106. extern void __put_user_1(void);
  107. extern void __put_user_2(void);
  108. extern void __put_user_4(void);
  109. extern void __put_user_8(void);
  110. extern void __put_user_bad(void);
  111. #define __put_user_x(size, ret, x, ptr) \
  112. asm volatile("call __put_user_" #size \
  113. :"=a" (ret) \
  114. :"c" (ptr),"d" (x) \
  115. :"r8")
  116. #define put_user(x, ptr) \
  117. __put_user_check((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
  118. #define __get_user(x, ptr) \
  119. __get_user_nocheck((x), (ptr), sizeof(*(ptr)))
  120. #define __put_user(x, ptr) \
  121. __put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
  122. #define __get_user_unaligned __get_user
  123. #define __put_user_unaligned __put_user
  124. #define __put_user_nocheck(x, ptr, size) \
  125. ({ \
  126. int __pu_err; \
  127. __put_user_size((x), (ptr), (size), __pu_err); \
  128. __pu_err; \
  129. })
  130. #define __put_user_check(x, ptr, size) \
  131. ({ \
  132. int __pu_err; \
  133. typeof(*(ptr)) __user *__pu_addr = (ptr); \
  134. switch (size) { \
  135. case 1: \
  136. __put_user_x(1, __pu_err, x, __pu_addr); \
  137. break; \
  138. case 2: \
  139. __put_user_x(2, __pu_err, x, __pu_addr); \
  140. break; \
  141. case 4: \
  142. __put_user_x(4, __pu_err, x, __pu_addr); \
  143. break; \
  144. case 8: \
  145. __put_user_x(8, __pu_err, x, __pu_addr); \
  146. break; \
  147. default: \
  148. __put_user_bad(); \
  149. } \
  150. __pu_err; \
  151. })
  152. #define __put_user_size(x, ptr, size, retval) \
  153. do { \
  154. retval = 0; \
  155. __chk_user_ptr(ptr); \
  156. switch (size) { \
  157. case 1: \
  158. __put_user_asm(x, ptr, retval, "b", "b", "iq", -EFAULT);\
  159. break; \
  160. case 2: \
  161. __put_user_asm(x, ptr, retval, "w", "w", "ir", -EFAULT);\
  162. break; \
  163. case 4: \
  164. __put_user_asm(x, ptr, retval, "l", "k", "ir", -EFAULT);\
  165. break; \
  166. case 8: \
  167. __put_user_asm(x, ptr, retval, "q", "", "Zr", -EFAULT); \
  168. break; \
  169. default: \
  170. __put_user_bad(); \
  171. } \
  172. } while (0)
  173. /* FIXME: this hack is definitely wrong -AK */
  174. struct __large_struct { unsigned long buf[100]; };
  175. #define __m(x) (*(struct __large_struct __user *)(x))
  176. /*
  177. * Tell gcc we read from memory instead of writing: this is because
  178. * we do not write to any memory gcc knows about, so there are no
  179. * aliasing issues.
  180. */
  181. #define __put_user_asm(x, addr, err, itype, rtype, ltype, errno) \
  182. asm volatile("1: mov"itype" %"rtype"1,%2\n" \
  183. "2:\n" \
  184. ".section .fixup, \"ax\"\n" \
  185. "3: mov %3,%0\n" \
  186. " jmp 2b\n" \
  187. ".previous\n" \
  188. _ASM_EXTABLE(1b, 3b) \
  189. : "=r"(err) \
  190. : ltype (x), "m" (__m(addr)), "i" (errno), "0" (err))
  191. #define __get_user_nocheck(x, ptr, size) \
  192. ({ \
  193. int __gu_err; \
  194. unsigned long __gu_val; \
  195. __get_user_size(__gu_val, (ptr), (size), __gu_err); \
  196. (x) = (__force typeof(*(ptr)))__gu_val; \
  197. __gu_err; \
  198. })
  199. extern int __get_user_1(void);
  200. extern int __get_user_2(void);
  201. extern int __get_user_4(void);
  202. extern int __get_user_8(void);
  203. extern int __get_user_bad(void);
  204. #define __get_user_size(x, ptr, size, retval) \
  205. do { \
  206. retval = 0; \
  207. __chk_user_ptr(ptr); \
  208. switch (size) { \
  209. case 1: \
  210. __get_user_asm(x, ptr, retval, "b", "b", "=q", -EFAULT);\
  211. break; \
  212. case 2: \
  213. __get_user_asm(x, ptr, retval, "w", "w", "=r", -EFAULT);\
  214. break; \
  215. case 4: \
  216. __get_user_asm(x, ptr, retval, "l", "k", "=r", -EFAULT);\
  217. break; \
  218. case 8: \
  219. __get_user_asm(x, ptr, retval, "q", "", "=r", -EFAULT); \
  220. break; \
  221. default: \
  222. (x) = __get_user_bad(); \
  223. } \
  224. } while (0)
  225. #define __get_user_asm(x, addr, err, itype, rtype, ltype, errno) \
  226. asm volatile("1: mov"itype" %2,%"rtype"1\n" \
  227. "2:\n" \
  228. ".section .fixup, \"ax\"\n" \
  229. "3: mov %3,%0\n" \
  230. " xor"itype" %"rtype"1,%"rtype"1\n" \
  231. " jmp 2b\n" \
  232. ".previous\n" \
  233. _ASM_EXTABLE(1b, 3b) \
  234. : "=r" (err), ltype (x) \
  235. : "m" (__m(addr)), "i"(errno), "0"(err))
  236. /*
  237. * Copy To/From Userspace
  238. */
  239. /* Handles exceptions in both to and from, but doesn't do access_ok */
  240. __must_check unsigned long
  241. copy_user_generic(void *to, const void *from, unsigned len);
  242. __must_check unsigned long
  243. copy_to_user(void __user *to, const void *from, unsigned len);
  244. __must_check unsigned long
  245. copy_from_user(void *to, const void __user *from, unsigned len);
  246. __must_check unsigned long
  247. copy_in_user(void __user *to, const void __user *from, unsigned len);
  248. static __always_inline __must_check
  249. int __copy_from_user(void *dst, const void __user *src, unsigned size)
  250. {
  251. int ret = 0;
  252. if (!__builtin_constant_p(size))
  253. return copy_user_generic(dst, (__force void *)src, size);
  254. switch (size) {
  255. case 1:__get_user_asm(*(u8 *)dst, (u8 __user *)src,
  256. ret, "b", "b", "=q", 1);
  257. return ret;
  258. case 2:__get_user_asm(*(u16 *)dst, (u16 __user *)src,
  259. ret, "w", "w", "=r", 2);
  260. return ret;
  261. case 4:__get_user_asm(*(u32 *)dst, (u32 __user *)src,
  262. ret, "l", "k", "=r", 4);
  263. return ret;
  264. case 8:__get_user_asm(*(u64 *)dst, (u64 __user *)src,
  265. ret, "q", "", "=r", 8);
  266. return ret;
  267. case 10:
  268. __get_user_asm(*(u64 *)dst, (u64 __user *)src,
  269. ret, "q", "", "=r", 16);
  270. if (unlikely(ret))
  271. return ret;
  272. __get_user_asm(*(u16 *)(8 + (char *)dst),
  273. (u16 __user *)(8 + (char __user *)src),
  274. ret, "w", "w", "=r", 2);
  275. return ret;
  276. case 16:
  277. __get_user_asm(*(u64 *)dst, (u64 __user *)src,
  278. ret, "q", "", "=r", 16);
  279. if (unlikely(ret))
  280. return ret;
  281. __get_user_asm(*(u64 *)(8 + (char *)dst),
  282. (u64 __user *)(8 + (char __user *)src),
  283. ret, "q", "", "=r", 8);
  284. return ret;
  285. default:
  286. return copy_user_generic(dst, (__force void *)src, size);
  287. }
  288. }
  289. static __always_inline __must_check
  290. int __copy_to_user(void __user *dst, const void *src, unsigned size)
  291. {
  292. int ret = 0;
  293. if (!__builtin_constant_p(size))
  294. return copy_user_generic((__force void *)dst, src, size);
  295. switch (size) {
  296. case 1:__put_user_asm(*(u8 *)src, (u8 __user *)dst,
  297. ret, "b", "b", "iq", 1);
  298. return ret;
  299. case 2:__put_user_asm(*(u16 *)src, (u16 __user *)dst,
  300. ret, "w", "w", "ir", 2);
  301. return ret;
  302. case 4:__put_user_asm(*(u32 *)src, (u32 __user *)dst,
  303. ret, "l", "k", "ir", 4);
  304. return ret;
  305. case 8:__put_user_asm(*(u64 *)src, (u64 __user *)dst,
  306. ret, "q", "", "ir", 8);
  307. return ret;
  308. case 10:
  309. __put_user_asm(*(u64 *)src, (u64 __user *)dst,
  310. ret, "q", "", "ir", 10);
  311. if (unlikely(ret))
  312. return ret;
  313. asm("":::"memory");
  314. __put_user_asm(4[(u16 *)src], 4 + (u16 __user *)dst,
  315. ret, "w", "w", "ir", 2);
  316. return ret;
  317. case 16:
  318. __put_user_asm(*(u64 *)src, (u64 __user *)dst,
  319. ret, "q", "", "ir", 16);
  320. if (unlikely(ret))
  321. return ret;
  322. asm("":::"memory");
  323. __put_user_asm(1[(u64 *)src], 1 + (u64 __user *)dst,
  324. ret, "q", "", "ir", 8);
  325. return ret;
  326. default:
  327. return copy_user_generic((__force void *)dst, src, size);
  328. }
  329. }
  330. static __always_inline __must_check
  331. int __copy_in_user(void __user *dst, const void __user *src, unsigned size)
  332. {
  333. int ret = 0;
  334. if (!__builtin_constant_p(size))
  335. return copy_user_generic((__force void *)dst,
  336. (__force void *)src, size);
  337. switch (size) {
  338. case 1: {
  339. u8 tmp;
  340. __get_user_asm(tmp, (u8 __user *)src,
  341. ret, "b", "b", "=q", 1);
  342. if (likely(!ret))
  343. __put_user_asm(tmp, (u8 __user *)dst,
  344. ret, "b", "b", "iq", 1);
  345. return ret;
  346. }
  347. case 2: {
  348. u16 tmp;
  349. __get_user_asm(tmp, (u16 __user *)src,
  350. ret, "w", "w", "=r", 2);
  351. if (likely(!ret))
  352. __put_user_asm(tmp, (u16 __user *)dst,
  353. ret, "w", "w", "ir", 2);
  354. return ret;
  355. }
  356. case 4: {
  357. u32 tmp;
  358. __get_user_asm(tmp, (u32 __user *)src,
  359. ret, "l", "k", "=r", 4);
  360. if (likely(!ret))
  361. __put_user_asm(tmp, (u32 __user *)dst,
  362. ret, "l", "k", "ir", 4);
  363. return ret;
  364. }
  365. case 8: {
  366. u64 tmp;
  367. __get_user_asm(tmp, (u64 __user *)src,
  368. ret, "q", "", "=r", 8);
  369. if (likely(!ret))
  370. __put_user_asm(tmp, (u64 __user *)dst,
  371. ret, "q", "", "ir", 8);
  372. return ret;
  373. }
  374. default:
  375. return copy_user_generic((__force void *)dst,
  376. (__force void *)src, size);
  377. }
  378. }
  379. __must_check long
  380. strncpy_from_user(char *dst, const char __user *src, long count);
  381. __must_check long
  382. __strncpy_from_user(char *dst, const char __user *src, long count);
  383. __must_check long strnlen_user(const char __user *str, long n);
  384. __must_check long __strnlen_user(const char __user *str, long n);
  385. __must_check long strlen_user(const char __user *str);
  386. __must_check unsigned long clear_user(void __user *mem, unsigned long len);
  387. __must_check unsigned long __clear_user(void __user *mem, unsigned long len);
  388. __must_check long __copy_from_user_inatomic(void *dst, const void __user *src,
  389. unsigned size);
  390. static __must_check __always_inline int
  391. __copy_to_user_inatomic(void __user *dst, const void *src, unsigned size)
  392. {
  393. return copy_user_generic((__force void *)dst, src, size);
  394. }
  395. #define ARCH_HAS_NOCACHE_UACCESS 1
  396. extern long __copy_user_nocache(void *dst, const void __user *src,
  397. unsigned size, int zerorest);
  398. static inline int __copy_from_user_nocache(void *dst, const void __user *src,
  399. unsigned size)
  400. {
  401. might_sleep();
  402. return __copy_user_nocache(dst, src, size, 1);
  403. }
  404. static inline int __copy_from_user_inatomic_nocache(void *dst,
  405. const void __user *src,
  406. unsigned size)
  407. {
  408. return __copy_user_nocache(dst, src, size, 0);
  409. }
  410. #endif /* __X86_64_UACCESS_H */