uaccess.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543
  1. #ifndef _ASM_X86_UACCESS_H
  2. #define _ASM_X86_UACCESS_H
  3. /*
  4. * User space memory access functions
  5. */
  6. #include <linux/errno.h>
  7. #include <linux/compiler.h>
  8. #include <linux/thread_info.h>
  9. #include <linux/string.h>
  10. #include <asm/asm.h>
  11. #include <asm/page.h>
  12. #include <asm/smap.h>
  13. #define VERIFY_READ 0
  14. #define VERIFY_WRITE 1
  15. /*
  16. * The fs value determines whether argument validity checking should be
  17. * performed or not. If get_fs() == USER_DS, checking is performed, with
  18. * get_fs() == KERNEL_DS, checking is bypassed.
  19. *
  20. * For historical reasons, these macros are grossly misnamed.
  21. */
  22. #define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
  23. #define KERNEL_DS MAKE_MM_SEG(-1UL)
  24. #define USER_DS MAKE_MM_SEG(TASK_SIZE_MAX)
  25. #define get_ds() (KERNEL_DS)
  26. #define get_fs() (current_thread_info()->addr_limit)
  27. #define set_fs(x) (current_thread_info()->addr_limit = (x))
  28. #define segment_eq(a, b) ((a).seg == (b).seg)
  29. #define user_addr_max() (current_thread_info()->addr_limit.seg)
  30. #define __addr_ok(addr) \
  31. ((unsigned long __force)(addr) < user_addr_max())
  32. /*
  33. * Test whether a block of memory is a valid user space address.
  34. * Returns 0 if the range is valid, nonzero otherwise.
  35. *
  36. * This is equivalent to the following test:
  37. * (u33)addr + (u33)size > (u33)current->addr_limit.seg (u65 for x86_64)
  38. *
  39. * This needs 33-bit (65-bit for x86_64) arithmetic. We have a carry...
  40. */
  41. #define __range_not_ok(addr, size, limit) \
  42. ({ \
  43. unsigned long flag, roksum; \
  44. __chk_user_ptr(addr); \
  45. asm("add %3,%1 ; sbb %0,%0 ; cmp %1,%4 ; sbb $0,%0" \
  46. : "=&r" (flag), "=r" (roksum) \
  47. : "1" (addr), "g" ((long)(size)), \
  48. "rm" (limit)); \
  49. flag; \
  50. })
  51. /**
  52. * access_ok: - Checks if a user space pointer is valid
  53. * @type: Type of access: %VERIFY_READ or %VERIFY_WRITE. Note that
  54. * %VERIFY_WRITE is a superset of %VERIFY_READ - if it is safe
  55. * to write to a block, it is always safe to read from it.
  56. * @addr: User space pointer to start of block to check
  57. * @size: Size of block to check
  58. *
  59. * Context: User context only. This function may sleep.
  60. *
  61. * Checks if a pointer to a block of memory in user space is valid.
  62. *
  63. * Returns true (nonzero) if the memory block may be valid, false (zero)
  64. * if it is definitely invalid.
  65. *
  66. * Note that, depending on architecture, this function probably just
  67. * checks that the pointer is in the user space range - after calling
  68. * this function, memory access functions may still return -EFAULT.
  69. */
  70. #define access_ok(type, addr, size) \
  71. (likely(__range_not_ok(addr, size, user_addr_max()) == 0))
  72. /*
  73. * The exception table consists of pairs of addresses relative to the
  74. * exception table enty itself: the first is the address of an
  75. * instruction that is allowed to fault, and the second is the address
  76. * at which the program should continue. No registers are modified,
  77. * so it is entirely up to the continuation code to figure out what to
  78. * do.
  79. *
  80. * All the routines below use bits of fixup code that are out of line
  81. * with the main instruction path. This means when everything is well,
  82. * we don't even have to jump over them. Further, they do not intrude
  83. * on our cache or tlb entries.
  84. */
  85. struct exception_table_entry {
  86. int insn, fixup;
  87. };
  88. /* This is not the generic standard exception_table_entry format */
  89. #define ARCH_HAS_SORT_EXTABLE
  90. #define ARCH_HAS_SEARCH_EXTABLE
  91. extern int fixup_exception(struct pt_regs *regs);
  92. extern int early_fixup_exception(unsigned long *ip);
  93. /*
  94. * These are the main single-value transfer routines. They automatically
  95. * use the right size if we just have the right pointer type.
  96. *
  97. * This gets kind of ugly. We want to return _two_ values in "get_user()"
  98. * and yet we don't want to do any pointers, because that is too much
  99. * of a performance impact. Thus we have a few rather ugly macros here,
  100. * and hide all the ugliness from the user.
  101. *
  102. * The "__xxx" versions of the user access functions are versions that
  103. * do not verify the address space, that must have been done previously
  104. * with a separate "access_ok()" call (this is used when we do multiple
  105. * accesses to the same area of user memory).
  106. */
  107. extern int __get_user_1(void);
  108. extern int __get_user_2(void);
  109. extern int __get_user_4(void);
  110. extern int __get_user_8(void);
  111. extern int __get_user_bad(void);
  112. /*
  113. * This is a type: either unsigned long, if the argument fits into
  114. * that type, or otherwise unsigned long long.
  115. */
  116. #define __inttype(x) \
  117. __typeof__(__builtin_choose_expr(sizeof(x) > sizeof(0UL), 0ULL, 0UL))
  118. /**
  119. * get_user: - Get a simple variable from user space.
  120. * @x: Variable to store result.
  121. * @ptr: Source address, in user space.
  122. *
  123. * Context: User context only. This function may sleep.
  124. *
  125. * This macro copies a single simple variable from user space to kernel
  126. * space. It supports simple types like char and int, but not larger
  127. * data types like structures or arrays.
  128. *
  129. * @ptr must have pointer-to-simple-variable type, and the result of
  130. * dereferencing @ptr must be assignable to @x without a cast.
  131. *
  132. * Returns zero on success, or -EFAULT on error.
  133. * On error, the variable @x is set to zero.
  134. */
  135. /*
  136. * Careful: we have to cast the result to the type of the pointer
  137. * for sign reasons.
  138. *
  139. * The use of %edx as the register specifier is a bit of a
  140. * simplification, as gcc only cares about it as the starting point
  141. * and not size: for a 64-bit value it will use %ecx:%edx on 32 bits
  142. * (%ecx being the next register in gcc's x86 register sequence), and
  143. * %rdx on 64 bits.
  144. */
  145. #define get_user(x, ptr) \
  146. ({ \
  147. int __ret_gu; \
  148. register __inttype(*(ptr)) __val_gu asm("%edx"); \
  149. __chk_user_ptr(ptr); \
  150. might_fault(); \
  151. asm volatile("call __get_user_%P3" \
  152. : "=a" (__ret_gu), "=r" (__val_gu) \
  153. : "0" (ptr), "i" (sizeof(*(ptr)))); \
  154. (x) = (__typeof__(*(ptr))) __val_gu; \
  155. __ret_gu; \
  156. })
  157. #define __put_user_x(size, x, ptr, __ret_pu) \
  158. asm volatile("call __put_user_" #size : "=a" (__ret_pu) \
  159. : "0" ((typeof(*(ptr)))(x)), "c" (ptr) : "ebx")
  160. #ifdef CONFIG_X86_32
  161. #define __put_user_asm_u64(x, addr, err, errret) \
  162. asm volatile(ASM_STAC "\n" \
  163. "1: movl %%eax,0(%2)\n" \
  164. "2: movl %%edx,4(%2)\n" \
  165. "3: " ASM_CLAC "\n" \
  166. ".section .fixup,\"ax\"\n" \
  167. "4: movl %3,%0\n" \
  168. " jmp 3b\n" \
  169. ".previous\n" \
  170. _ASM_EXTABLE(1b, 4b) \
  171. _ASM_EXTABLE(2b, 4b) \
  172. : "=r" (err) \
  173. : "A" (x), "r" (addr), "i" (errret), "0" (err))
  174. #define __put_user_asm_ex_u64(x, addr) \
  175. asm volatile(ASM_STAC "\n" \
  176. "1: movl %%eax,0(%1)\n" \
  177. "2: movl %%edx,4(%1)\n" \
  178. "3: " ASM_CLAC "\n" \
  179. _ASM_EXTABLE_EX(1b, 2b) \
  180. _ASM_EXTABLE_EX(2b, 3b) \
  181. : : "A" (x), "r" (addr))
  182. #define __put_user_x8(x, ptr, __ret_pu) \
  183. asm volatile("call __put_user_8" : "=a" (__ret_pu) \
  184. : "A" ((typeof(*(ptr)))(x)), "c" (ptr) : "ebx")
  185. #else
  186. #define __put_user_asm_u64(x, ptr, retval, errret) \
  187. __put_user_asm(x, ptr, retval, "q", "", "er", errret)
  188. #define __put_user_asm_ex_u64(x, addr) \
  189. __put_user_asm_ex(x, addr, "q", "", "er")
  190. #define __put_user_x8(x, ptr, __ret_pu) __put_user_x(8, x, ptr, __ret_pu)
  191. #endif
  192. extern void __put_user_bad(void);
  193. /*
  194. * Strange magic calling convention: pointer in %ecx,
  195. * value in %eax(:%edx), return value in %eax. clobbers %rbx
  196. */
  197. extern void __put_user_1(void);
  198. extern void __put_user_2(void);
  199. extern void __put_user_4(void);
  200. extern void __put_user_8(void);
  201. /**
  202. * put_user: - Write a simple value into user space.
  203. * @x: Value to copy to user space.
  204. * @ptr: Destination address, in user space.
  205. *
  206. * Context: User context only. This function may sleep.
  207. *
  208. * This macro copies a single simple value from kernel space to user
  209. * space. It supports simple types like char and int, but not larger
  210. * data types like structures or arrays.
  211. *
  212. * @ptr must have pointer-to-simple-variable type, and @x must be assignable
  213. * to the result of dereferencing @ptr.
  214. *
  215. * Returns zero on success, or -EFAULT on error.
  216. */
  217. #define put_user(x, ptr) \
  218. ({ \
  219. int __ret_pu; \
  220. __typeof__(*(ptr)) __pu_val; \
  221. __chk_user_ptr(ptr); \
  222. might_fault(); \
  223. __pu_val = x; \
  224. switch (sizeof(*(ptr))) { \
  225. case 1: \
  226. __put_user_x(1, __pu_val, ptr, __ret_pu); \
  227. break; \
  228. case 2: \
  229. __put_user_x(2, __pu_val, ptr, __ret_pu); \
  230. break; \
  231. case 4: \
  232. __put_user_x(4, __pu_val, ptr, __ret_pu); \
  233. break; \
  234. case 8: \
  235. __put_user_x8(__pu_val, ptr, __ret_pu); \
  236. break; \
  237. default: \
  238. __put_user_x(X, __pu_val, ptr, __ret_pu); \
  239. break; \
  240. } \
  241. __ret_pu; \
  242. })
  243. #define __put_user_size(x, ptr, size, retval, errret) \
  244. do { \
  245. retval = 0; \
  246. __chk_user_ptr(ptr); \
  247. switch (size) { \
  248. case 1: \
  249. __put_user_asm(x, ptr, retval, "b", "b", "iq", errret); \
  250. break; \
  251. case 2: \
  252. __put_user_asm(x, ptr, retval, "w", "w", "ir", errret); \
  253. break; \
  254. case 4: \
  255. __put_user_asm(x, ptr, retval, "l", "k", "ir", errret); \
  256. break; \
  257. case 8: \
  258. __put_user_asm_u64((__typeof__(*ptr))(x), ptr, retval, \
  259. errret); \
  260. break; \
  261. default: \
  262. __put_user_bad(); \
  263. } \
  264. } while (0)
  265. #define __put_user_size_ex(x, ptr, size) \
  266. do { \
  267. __chk_user_ptr(ptr); \
  268. switch (size) { \
  269. case 1: \
  270. __put_user_asm_ex(x, ptr, "b", "b", "iq"); \
  271. break; \
  272. case 2: \
  273. __put_user_asm_ex(x, ptr, "w", "w", "ir"); \
  274. break; \
  275. case 4: \
  276. __put_user_asm_ex(x, ptr, "l", "k", "ir"); \
  277. break; \
  278. case 8: \
  279. __put_user_asm_ex_u64((__typeof__(*ptr))(x), ptr); \
  280. break; \
  281. default: \
  282. __put_user_bad(); \
  283. } \
  284. } while (0)
  285. #ifdef CONFIG_X86_32
  286. #define __get_user_asm_u64(x, ptr, retval, errret) (x) = __get_user_bad()
  287. #define __get_user_asm_ex_u64(x, ptr) (x) = __get_user_bad()
  288. #else
  289. #define __get_user_asm_u64(x, ptr, retval, errret) \
  290. __get_user_asm(x, ptr, retval, "q", "", "=r", errret)
  291. #define __get_user_asm_ex_u64(x, ptr) \
  292. __get_user_asm_ex(x, ptr, "q", "", "=r")
  293. #endif
  294. #define __get_user_size(x, ptr, size, retval, errret) \
  295. do { \
  296. retval = 0; \
  297. __chk_user_ptr(ptr); \
  298. switch (size) { \
  299. case 1: \
  300. __get_user_asm(x, ptr, retval, "b", "b", "=q", errret); \
  301. break; \
  302. case 2: \
  303. __get_user_asm(x, ptr, retval, "w", "w", "=r", errret); \
  304. break; \
  305. case 4: \
  306. __get_user_asm(x, ptr, retval, "l", "k", "=r", errret); \
  307. break; \
  308. case 8: \
  309. __get_user_asm_u64(x, ptr, retval, errret); \
  310. break; \
  311. default: \
  312. (x) = __get_user_bad(); \
  313. } \
  314. } while (0)
  315. #define __get_user_asm(x, addr, err, itype, rtype, ltype, errret) \
  316. asm volatile(ASM_STAC "\n" \
  317. "1: mov"itype" %2,%"rtype"1\n" \
  318. "2: " ASM_CLAC "\n" \
  319. ".section .fixup,\"ax\"\n" \
  320. "3: mov %3,%0\n" \
  321. " xor"itype" %"rtype"1,%"rtype"1\n" \
  322. " jmp 2b\n" \
  323. ".previous\n" \
  324. _ASM_EXTABLE(1b, 3b) \
  325. : "=r" (err), ltype(x) \
  326. : "m" (__m(addr)), "i" (errret), "0" (err))
  327. #define __get_user_size_ex(x, ptr, size) \
  328. do { \
  329. __chk_user_ptr(ptr); \
  330. switch (size) { \
  331. case 1: \
  332. __get_user_asm_ex(x, ptr, "b", "b", "=q"); \
  333. break; \
  334. case 2: \
  335. __get_user_asm_ex(x, ptr, "w", "w", "=r"); \
  336. break; \
  337. case 4: \
  338. __get_user_asm_ex(x, ptr, "l", "k", "=r"); \
  339. break; \
  340. case 8: \
  341. __get_user_asm_ex_u64(x, ptr); \
  342. break; \
  343. default: \
  344. (x) = __get_user_bad(); \
  345. } \
  346. } while (0)
  347. #define __get_user_asm_ex(x, addr, itype, rtype, ltype) \
  348. asm volatile("1: mov"itype" %1,%"rtype"0\n" \
  349. "2:\n" \
  350. _ASM_EXTABLE_EX(1b, 2b) \
  351. : ltype(x) : "m" (__m(addr)))
  352. #define __put_user_nocheck(x, ptr, size) \
  353. ({ \
  354. int __pu_err; \
  355. __put_user_size((x), (ptr), (size), __pu_err, -EFAULT); \
  356. __pu_err; \
  357. })
  358. #define __get_user_nocheck(x, ptr, size) \
  359. ({ \
  360. int __gu_err; \
  361. unsigned long __gu_val; \
  362. __get_user_size(__gu_val, (ptr), (size), __gu_err, -EFAULT); \
  363. (x) = (__force __typeof__(*(ptr)))__gu_val; \
  364. __gu_err; \
  365. })
  366. /* FIXME: this hack is definitely wrong -AK */
  367. struct __large_struct { unsigned long buf[100]; };
  368. #define __m(x) (*(struct __large_struct __user *)(x))
  369. /*
  370. * Tell gcc we read from memory instead of writing: this is because
  371. * we do not write to any memory gcc knows about, so there are no
  372. * aliasing issues.
  373. */
  374. #define __put_user_asm(x, addr, err, itype, rtype, ltype, errret) \
  375. asm volatile(ASM_STAC "\n" \
  376. "1: mov"itype" %"rtype"1,%2\n" \
  377. "2: " ASM_CLAC "\n" \
  378. ".section .fixup,\"ax\"\n" \
  379. "3: mov %3,%0\n" \
  380. " jmp 2b\n" \
  381. ".previous\n" \
  382. _ASM_EXTABLE(1b, 3b) \
  383. : "=r"(err) \
  384. : ltype(x), "m" (__m(addr)), "i" (errret), "0" (err))
  385. #define __put_user_asm_ex(x, addr, itype, rtype, ltype) \
  386. asm volatile("1: mov"itype" %"rtype"0,%1\n" \
  387. "2:\n" \
  388. _ASM_EXTABLE_EX(1b, 2b) \
  389. : : ltype(x), "m" (__m(addr)))
  390. /*
  391. * uaccess_try and catch
  392. */
  393. #define uaccess_try do { \
  394. current_thread_info()->uaccess_err = 0; \
  395. stac(); \
  396. barrier();
  397. #define uaccess_catch(err) \
  398. clac(); \
  399. (err) |= (current_thread_info()->uaccess_err ? -EFAULT : 0); \
  400. } while (0)
  401. /**
  402. * __get_user: - Get a simple variable from user space, with less checking.
  403. * @x: Variable to store result.
  404. * @ptr: Source address, in user space.
  405. *
  406. * Context: User context only. This function may sleep.
  407. *
  408. * This macro copies a single simple variable from user space to kernel
  409. * space. It supports simple types like char and int, but not larger
  410. * data types like structures or arrays.
  411. *
  412. * @ptr must have pointer-to-simple-variable type, and the result of
  413. * dereferencing @ptr must be assignable to @x without a cast.
  414. *
  415. * Caller must check the pointer with access_ok() before calling this
  416. * function.
  417. *
  418. * Returns zero on success, or -EFAULT on error.
  419. * On error, the variable @x is set to zero.
  420. */
  421. #define __get_user(x, ptr) \
  422. __get_user_nocheck((x), (ptr), sizeof(*(ptr)))
  423. /**
  424. * __put_user: - Write a simple value into user space, with less checking.
  425. * @x: Value to copy to user space.
  426. * @ptr: Destination address, in user space.
  427. *
  428. * Context: User context only. This function may sleep.
  429. *
  430. * This macro copies a single simple value from kernel space to user
  431. * space. It supports simple types like char and int, but not larger
  432. * data types like structures or arrays.
  433. *
  434. * @ptr must have pointer-to-simple-variable type, and @x must be assignable
  435. * to the result of dereferencing @ptr.
  436. *
  437. * Caller must check the pointer with access_ok() before calling this
  438. * function.
  439. *
  440. * Returns zero on success, or -EFAULT on error.
  441. */
  442. #define __put_user(x, ptr) \
  443. __put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
  444. #define __get_user_unaligned __get_user
  445. #define __put_user_unaligned __put_user
  446. /*
  447. * {get|put}_user_try and catch
  448. *
  449. * get_user_try {
  450. * get_user_ex(...);
  451. * } get_user_catch(err)
  452. */
  453. #define get_user_try uaccess_try
  454. #define get_user_catch(err) uaccess_catch(err)
  455. #define get_user_ex(x, ptr) do { \
  456. unsigned long __gue_val; \
  457. __get_user_size_ex((__gue_val), (ptr), (sizeof(*(ptr)))); \
  458. (x) = (__force __typeof__(*(ptr)))__gue_val; \
  459. } while (0)
  460. #define put_user_try uaccess_try
  461. #define put_user_catch(err) uaccess_catch(err)
  462. #define put_user_ex(x, ptr) \
  463. __put_user_size_ex((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
  464. extern unsigned long
  465. copy_from_user_nmi(void *to, const void __user *from, unsigned long n);
  466. extern __must_check long
  467. strncpy_from_user(char *dst, const char __user *src, long count);
  468. extern __must_check long strlen_user(const char __user *str);
  469. extern __must_check long strnlen_user(const char __user *str, long n);
  470. unsigned long __must_check clear_user(void __user *mem, unsigned long len);
  471. unsigned long __must_check __clear_user(void __user *mem, unsigned long len);
  472. /*
  473. * movsl can be slow when source and dest are not both 8-byte aligned
  474. */
  475. #ifdef CONFIG_X86_INTEL_USERCOPY
  476. extern struct movsl_mask {
  477. int mask;
  478. } ____cacheline_aligned_in_smp movsl_mask;
  479. #endif
  480. #define ARCH_HAS_NOCACHE_UACCESS 1
  481. #ifdef CONFIG_X86_32
  482. # include <asm/uaccess_32.h>
  483. #else
  484. # include <asm/uaccess_64.h>
  485. #endif
  486. #endif /* _ASM_X86_UACCESS_H */