uaccess.h 11 KB

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