uaccess.h 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565
  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. #define __get_user_x(size, ret, x, ptr) \
  113. asm volatile("call __get_user_" #size \
  114. : "=a" (ret), "=d" (x) \
  115. : "0" (ptr)) \
  116. /* Careful: we have to cast the result to the type of the pointer
  117. * for sign reasons */
  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. #ifdef CONFIG_X86_32
  136. #define __get_user_8(ret, x, ptr) \
  137. do { \
  138. register unsigned long long __xx asm("%edx"); \
  139. asm volatile("call __get_user_8" \
  140. : "=a" (ret), "=r" (__xx) \
  141. : "0" (ptr)); \
  142. (x) = __xx; \
  143. } while (0)
  144. #else
  145. #define __get_user_8(__ret_gu, __val_gu, ptr) \
  146. __get_user_x(8, __ret_gu, __val_gu, ptr)
  147. #endif
  148. #define get_user(x, ptr) \
  149. ({ \
  150. int __ret_gu; \
  151. struct { \
  152. unsigned long long __val_n : 8*sizeof(*(ptr)); \
  153. } __val_gu; \
  154. __chk_user_ptr(ptr); \
  155. might_fault(); \
  156. switch (sizeof(*(ptr))) { \
  157. case 1: \
  158. __get_user_x(1, __ret_gu, __val_gu.__val_n, ptr); \
  159. break; \
  160. case 2: \
  161. __get_user_x(2, __ret_gu, __val_gu.__val_n, ptr); \
  162. break; \
  163. case 4: \
  164. __get_user_x(4, __ret_gu, __val_gu.__val_n, ptr); \
  165. break; \
  166. case 8: \
  167. __get_user_8(__ret_gu, __val_gu.__val_n, ptr); \
  168. break; \
  169. default: \
  170. __get_user_x(X, __ret_gu, __val_gu.__val_n, ptr); \
  171. break; \
  172. } \
  173. (x) = (__typeof__(*(ptr)))__val_gu.__val_n; \
  174. __ret_gu; \
  175. })
  176. #define __put_user_x(size, x, ptr, __ret_pu) \
  177. asm volatile("call __put_user_" #size : "=a" (__ret_pu) \
  178. : "0" ((typeof(*(ptr)))(x)), "c" (ptr) : "ebx")
  179. #ifdef CONFIG_X86_32
  180. #define __put_user_asm_u64(x, addr, err, errret) \
  181. asm volatile(ASM_STAC "\n" \
  182. "1: movl %%eax,0(%2)\n" \
  183. "2: movl %%edx,4(%2)\n" \
  184. "3: " ASM_CLAC "\n" \
  185. ".section .fixup,\"ax\"\n" \
  186. "4: movl %3,%0\n" \
  187. " jmp 3b\n" \
  188. ".previous\n" \
  189. _ASM_EXTABLE(1b, 4b) \
  190. _ASM_EXTABLE(2b, 4b) \
  191. : "=r" (err) \
  192. : "A" (x), "r" (addr), "i" (errret), "0" (err))
  193. #define __put_user_asm_ex_u64(x, addr) \
  194. asm volatile(ASM_STAC "\n" \
  195. "1: movl %%eax,0(%1)\n" \
  196. "2: movl %%edx,4(%1)\n" \
  197. "3: " ASM_CLAC "\n" \
  198. _ASM_EXTABLE_EX(1b, 2b) \
  199. _ASM_EXTABLE_EX(2b, 3b) \
  200. : : "A" (x), "r" (addr))
  201. #define __put_user_x8(x, ptr, __ret_pu) \
  202. asm volatile("call __put_user_8" : "=a" (__ret_pu) \
  203. : "A" ((typeof(*(ptr)))(x)), "c" (ptr) : "ebx")
  204. #else
  205. #define __put_user_asm_u64(x, ptr, retval, errret) \
  206. __put_user_asm(x, ptr, retval, "q", "", "er", errret)
  207. #define __put_user_asm_ex_u64(x, addr) \
  208. __put_user_asm_ex(x, addr, "q", "", "er")
  209. #define __put_user_x8(x, ptr, __ret_pu) __put_user_x(8, x, ptr, __ret_pu)
  210. #endif
  211. extern void __put_user_bad(void);
  212. /*
  213. * Strange magic calling convention: pointer in %ecx,
  214. * value in %eax(:%edx), return value in %eax. clobbers %rbx
  215. */
  216. extern void __put_user_1(void);
  217. extern void __put_user_2(void);
  218. extern void __put_user_4(void);
  219. extern void __put_user_8(void);
  220. /**
  221. * put_user: - Write a simple value into user space.
  222. * @x: Value to copy to user space.
  223. * @ptr: Destination address, in user space.
  224. *
  225. * Context: User context only. This function may sleep.
  226. *
  227. * This macro copies a single simple value from kernel space to user
  228. * space. It supports simple types like char and int, but not larger
  229. * data types like structures or arrays.
  230. *
  231. * @ptr must have pointer-to-simple-variable type, and @x must be assignable
  232. * to the result of dereferencing @ptr.
  233. *
  234. * Returns zero on success, or -EFAULT on error.
  235. */
  236. #define put_user(x, ptr) \
  237. ({ \
  238. int __ret_pu; \
  239. __typeof__(*(ptr)) __pu_val; \
  240. __chk_user_ptr(ptr); \
  241. might_fault(); \
  242. __pu_val = x; \
  243. switch (sizeof(*(ptr))) { \
  244. case 1: \
  245. __put_user_x(1, __pu_val, ptr, __ret_pu); \
  246. break; \
  247. case 2: \
  248. __put_user_x(2, __pu_val, ptr, __ret_pu); \
  249. break; \
  250. case 4: \
  251. __put_user_x(4, __pu_val, ptr, __ret_pu); \
  252. break; \
  253. case 8: \
  254. __put_user_x8(__pu_val, ptr, __ret_pu); \
  255. break; \
  256. default: \
  257. __put_user_x(X, __pu_val, ptr, __ret_pu); \
  258. break; \
  259. } \
  260. __ret_pu; \
  261. })
  262. #define __put_user_size(x, ptr, size, retval, errret) \
  263. do { \
  264. retval = 0; \
  265. __chk_user_ptr(ptr); \
  266. switch (size) { \
  267. case 1: \
  268. __put_user_asm(x, ptr, retval, "b", "b", "iq", errret); \
  269. break; \
  270. case 2: \
  271. __put_user_asm(x, ptr, retval, "w", "w", "ir", errret); \
  272. break; \
  273. case 4: \
  274. __put_user_asm(x, ptr, retval, "l", "k", "ir", errret); \
  275. break; \
  276. case 8: \
  277. __put_user_asm_u64((__typeof__(*ptr))(x), ptr, retval, \
  278. errret); \
  279. break; \
  280. default: \
  281. __put_user_bad(); \
  282. } \
  283. } while (0)
  284. #define __put_user_size_ex(x, ptr, size) \
  285. do { \
  286. __chk_user_ptr(ptr); \
  287. switch (size) { \
  288. case 1: \
  289. __put_user_asm_ex(x, ptr, "b", "b", "iq"); \
  290. break; \
  291. case 2: \
  292. __put_user_asm_ex(x, ptr, "w", "w", "ir"); \
  293. break; \
  294. case 4: \
  295. __put_user_asm_ex(x, ptr, "l", "k", "ir"); \
  296. break; \
  297. case 8: \
  298. __put_user_asm_ex_u64((__typeof__(*ptr))(x), ptr); \
  299. break; \
  300. default: \
  301. __put_user_bad(); \
  302. } \
  303. } while (0)
  304. #ifdef CONFIG_X86_32
  305. #define __get_user_asm_u64(x, ptr, retval, errret) (x) = __get_user_bad()
  306. #define __get_user_asm_ex_u64(x, ptr) (x) = __get_user_bad()
  307. #else
  308. #define __get_user_asm_u64(x, ptr, retval, errret) \
  309. __get_user_asm(x, ptr, retval, "q", "", "=r", errret)
  310. #define __get_user_asm_ex_u64(x, ptr) \
  311. __get_user_asm_ex(x, ptr, "q", "", "=r")
  312. #endif
  313. #define __get_user_size(x, ptr, size, retval, errret) \
  314. do { \
  315. retval = 0; \
  316. __chk_user_ptr(ptr); \
  317. switch (size) { \
  318. case 1: \
  319. __get_user_asm(x, ptr, retval, "b", "b", "=q", errret); \
  320. break; \
  321. case 2: \
  322. __get_user_asm(x, ptr, retval, "w", "w", "=r", errret); \
  323. break; \
  324. case 4: \
  325. __get_user_asm(x, ptr, retval, "l", "k", "=r", errret); \
  326. break; \
  327. case 8: \
  328. __get_user_asm_u64(x, ptr, retval, errret); \
  329. break; \
  330. default: \
  331. (x) = __get_user_bad(); \
  332. } \
  333. } while (0)
  334. #define __get_user_asm(x, addr, err, itype, rtype, ltype, errret) \
  335. asm volatile(ASM_STAC "\n" \
  336. "1: mov"itype" %2,%"rtype"1\n" \
  337. "2: " ASM_CLAC "\n" \
  338. ".section .fixup,\"ax\"\n" \
  339. "3: mov %3,%0\n" \
  340. " xor"itype" %"rtype"1,%"rtype"1\n" \
  341. " jmp 2b\n" \
  342. ".previous\n" \
  343. _ASM_EXTABLE(1b, 3b) \
  344. : "=r" (err), ltype(x) \
  345. : "m" (__m(addr)), "i" (errret), "0" (err))
  346. #define __get_user_size_ex(x, ptr, size) \
  347. do { \
  348. __chk_user_ptr(ptr); \
  349. switch (size) { \
  350. case 1: \
  351. __get_user_asm_ex(x, ptr, "b", "b", "=q"); \
  352. break; \
  353. case 2: \
  354. __get_user_asm_ex(x, ptr, "w", "w", "=r"); \
  355. break; \
  356. case 4: \
  357. __get_user_asm_ex(x, ptr, "l", "k", "=r"); \
  358. break; \
  359. case 8: \
  360. __get_user_asm_ex_u64(x, ptr); \
  361. break; \
  362. default: \
  363. (x) = __get_user_bad(); \
  364. } \
  365. } while (0)
  366. #define __get_user_asm_ex(x, addr, itype, rtype, ltype) \
  367. asm volatile("1: mov"itype" %1,%"rtype"0\n" \
  368. "2:\n" \
  369. _ASM_EXTABLE_EX(1b, 2b) \
  370. : ltype(x) : "m" (__m(addr)))
  371. #define __put_user_nocheck(x, ptr, size) \
  372. ({ \
  373. int __pu_err; \
  374. __put_user_size((x), (ptr), (size), __pu_err, -EFAULT); \
  375. __pu_err; \
  376. })
  377. #define __get_user_nocheck(x, ptr, size) \
  378. ({ \
  379. int __gu_err; \
  380. unsigned long __gu_val; \
  381. __get_user_size(__gu_val, (ptr), (size), __gu_err, -EFAULT); \
  382. (x) = (__force __typeof__(*(ptr)))__gu_val; \
  383. __gu_err; \
  384. })
  385. /* FIXME: this hack is definitely wrong -AK */
  386. struct __large_struct { unsigned long buf[100]; };
  387. #define __m(x) (*(struct __large_struct __user *)(x))
  388. /*
  389. * Tell gcc we read from memory instead of writing: this is because
  390. * we do not write to any memory gcc knows about, so there are no
  391. * aliasing issues.
  392. */
  393. #define __put_user_asm(x, addr, err, itype, rtype, ltype, errret) \
  394. asm volatile(ASM_STAC "\n" \
  395. "1: mov"itype" %"rtype"1,%2\n" \
  396. "2: " ASM_CLAC "\n" \
  397. ".section .fixup,\"ax\"\n" \
  398. "3: mov %3,%0\n" \
  399. " jmp 2b\n" \
  400. ".previous\n" \
  401. _ASM_EXTABLE(1b, 3b) \
  402. : "=r"(err) \
  403. : ltype(x), "m" (__m(addr)), "i" (errret), "0" (err))
  404. #define __put_user_asm_ex(x, addr, itype, rtype, ltype) \
  405. asm volatile("1: mov"itype" %"rtype"0,%1\n" \
  406. "2:\n" \
  407. _ASM_EXTABLE_EX(1b, 2b) \
  408. : : ltype(x), "m" (__m(addr)))
  409. /*
  410. * uaccess_try and catch
  411. */
  412. #define uaccess_try do { \
  413. current_thread_info()->uaccess_err = 0; \
  414. stac(); \
  415. barrier();
  416. #define uaccess_catch(err) \
  417. clac(); \
  418. (err) |= (current_thread_info()->uaccess_err ? -EFAULT : 0); \
  419. } while (0)
  420. /**
  421. * __get_user: - Get a simple variable from user space, with less checking.
  422. * @x: Variable to store result.
  423. * @ptr: Source address, in user space.
  424. *
  425. * Context: User context only. This function may sleep.
  426. *
  427. * This macro copies a single simple variable from user space to kernel
  428. * space. It supports simple types like char and int, but not larger
  429. * data types like structures or arrays.
  430. *
  431. * @ptr must have pointer-to-simple-variable type, and the result of
  432. * dereferencing @ptr must be assignable to @x without a cast.
  433. *
  434. * Caller must check the pointer with access_ok() before calling this
  435. * function.
  436. *
  437. * Returns zero on success, or -EFAULT on error.
  438. * On error, the variable @x is set to zero.
  439. */
  440. #define __get_user(x, ptr) \
  441. __get_user_nocheck((x), (ptr), sizeof(*(ptr)))
  442. /**
  443. * __put_user: - Write a simple value into user space, with less checking.
  444. * @x: Value to copy to user space.
  445. * @ptr: Destination address, in user space.
  446. *
  447. * Context: User context only. This function may sleep.
  448. *
  449. * This macro copies a single simple value from kernel space to user
  450. * space. It supports simple types like char and int, but not larger
  451. * data types like structures or arrays.
  452. *
  453. * @ptr must have pointer-to-simple-variable type, and @x must be assignable
  454. * to the result of dereferencing @ptr.
  455. *
  456. * Caller must check the pointer with access_ok() before calling this
  457. * function.
  458. *
  459. * Returns zero on success, or -EFAULT on error.
  460. */
  461. #define __put_user(x, ptr) \
  462. __put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
  463. #define __get_user_unaligned __get_user
  464. #define __put_user_unaligned __put_user
  465. /*
  466. * {get|put}_user_try and catch
  467. *
  468. * get_user_try {
  469. * get_user_ex(...);
  470. * } get_user_catch(err)
  471. */
  472. #define get_user_try uaccess_try
  473. #define get_user_catch(err) uaccess_catch(err)
  474. #define get_user_ex(x, ptr) do { \
  475. unsigned long __gue_val; \
  476. __get_user_size_ex((__gue_val), (ptr), (sizeof(*(ptr)))); \
  477. (x) = (__force __typeof__(*(ptr)))__gue_val; \
  478. } while (0)
  479. #define put_user_try uaccess_try
  480. #define put_user_catch(err) uaccess_catch(err)
  481. #define put_user_ex(x, ptr) \
  482. __put_user_size_ex((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
  483. extern unsigned long
  484. copy_from_user_nmi(void *to, const void __user *from, unsigned long n);
  485. extern __must_check long
  486. strncpy_from_user(char *dst, const char __user *src, long count);
  487. extern __must_check long strlen_user(const char __user *str);
  488. extern __must_check long strnlen_user(const char __user *str, long n);
  489. unsigned long __must_check clear_user(void __user *mem, unsigned long len);
  490. unsigned long __must_check __clear_user(void __user *mem, unsigned long len);
  491. /*
  492. * movsl can be slow when source and dest are not both 8-byte aligned
  493. */
  494. #ifdef CONFIG_X86_INTEL_USERCOPY
  495. extern struct movsl_mask {
  496. int mask;
  497. } ____cacheline_aligned_in_smp movsl_mask;
  498. #endif
  499. #define ARCH_HAS_NOCACHE_UACCESS 1
  500. #ifdef CONFIG_X86_32
  501. # include <asm/uaccess_32.h>
  502. #else
  503. # include <asm/uaccess_64.h>
  504. #endif
  505. #endif /* _ASM_X86_UACCESS_H */