uaccess.h 17 KB

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