uaccess_64.h 12 KB

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