uaccess.h 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318
  1. /* uaccess.h: userspace accessor functions
  2. *
  3. * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
  4. * Written by David Howells (dhowells@redhat.com)
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. */
  11. #ifndef _ASM_UACCESS_H
  12. #define _ASM_UACCESS_H
  13. /*
  14. * User space memory access functions
  15. */
  16. #include <linux/sched.h>
  17. #include <linux/mm.h>
  18. #include <asm/segment.h>
  19. #include <asm/sections.h>
  20. #define HAVE_ARCH_UNMAPPED_AREA /* we decide where to put mmaps */
  21. #define __ptr(x) ((unsigned long *)(x))
  22. #define VERIFY_READ 0
  23. #define VERIFY_WRITE 1
  24. #define __addr_ok(addr) ((unsigned long)(addr) < get_addr_limit())
  25. /*
  26. * check that a range of addresses falls within the current address limit
  27. */
  28. static inline int ___range_ok(unsigned long addr, unsigned long size)
  29. {
  30. #ifdef CONFIG_MMU
  31. int flag = -EFAULT, tmp;
  32. asm volatile (
  33. " addcc %3,%2,%1,icc0 \n" /* set C-flag if addr+size>4GB */
  34. " subcc.p %1,%4,gr0,icc1 \n" /* jump if addr+size>limit */
  35. " bc icc0,#0,0f \n"
  36. " bhi icc1,#0,0f \n"
  37. " setlos #0,%0 \n" /* mark okay */
  38. "0: \n"
  39. : "=r"(flag), "=&r"(tmp)
  40. : "r"(addr), "r"(size), "r"(get_addr_limit()), "0"(flag)
  41. );
  42. return flag;
  43. #else
  44. if (addr < memory_start ||
  45. addr > memory_end ||
  46. size > memory_end - memory_start ||
  47. addr + size > memory_end)
  48. return -EFAULT;
  49. return 0;
  50. #endif
  51. }
  52. #define __range_ok(addr,size) ___range_ok((unsigned long) (addr), (unsigned long) (size))
  53. #define access_ok(type,addr,size) (__range_ok((addr), (size)) == 0)
  54. #define __access_ok(addr,size) (__range_ok((addr), (size)) == 0)
  55. /* this function will go away soon - use access_ok() / __range_ok() instead */
  56. static inline int __deprecated verify_area(int type, const void * addr, unsigned long size)
  57. {
  58. return __range_ok(addr, size);
  59. }
  60. /*
  61. * The exception table consists of pairs of addresses: the first is the
  62. * address of an instruction that is allowed to fault, and the second is
  63. * the address at which the program should continue. No registers are
  64. * modified, so it is entirely up to the continuation code to figure out
  65. * what to do.
  66. *
  67. * All the routines below use bits of fixup code that are out of line
  68. * with the main instruction path. This means when everything is well,
  69. * we don't even have to jump over them. Further, they do not intrude
  70. * on our cache or tlb entries.
  71. */
  72. struct exception_table_entry
  73. {
  74. unsigned long insn, fixup;
  75. };
  76. /* Returns 0 if exception not found and fixup otherwise. */
  77. extern unsigned long search_exception_table(unsigned long);
  78. /*
  79. * These are the main single-value transfer routines. They automatically
  80. * use the right size if we just have the right pointer type.
  81. */
  82. #define __put_user(x, ptr) \
  83. ({ \
  84. int __pu_err = 0; \
  85. \
  86. typeof(*(ptr)) __pu_val = (x); \
  87. \
  88. switch (sizeof (*(ptr))) { \
  89. case 1: \
  90. __put_user_asm(__pu_err, __pu_val, ptr, "b", "r"); \
  91. break; \
  92. case 2: \
  93. __put_user_asm(__pu_err, __pu_val, ptr, "h", "r"); \
  94. break; \
  95. case 4: \
  96. __put_user_asm(__pu_err, __pu_val, ptr, "", "r"); \
  97. break; \
  98. case 8: \
  99. __put_user_asm(__pu_err, __pu_val, ptr, "d", "e"); \
  100. break; \
  101. default: \
  102. __pu_err = __put_user_bad(); \
  103. break; \
  104. } \
  105. __pu_err; \
  106. })
  107. #define put_user(x, ptr) \
  108. ({ \
  109. typeof(&*ptr) _p = (ptr); \
  110. int _e; \
  111. \
  112. _e = __range_ok(_p, sizeof(*_p)); \
  113. if (_e == 0) \
  114. _e = __put_user((x), _p); \
  115. _e; \
  116. })
  117. extern int __put_user_bad(void);
  118. /*
  119. * Tell gcc we read from memory instead of writing: this is because
  120. * we do not write to any memory gcc knows about, so there are no
  121. * aliasing issues.
  122. */
  123. #ifdef CONFIG_MMU
  124. #define __put_user_asm(err,x,ptr,dsize,constraint) \
  125. do { \
  126. asm volatile("1: st"dsize"%I1 %2,%M1 \n" \
  127. "2: \n" \
  128. ".subsection 2 \n" \
  129. "3: setlos %3,%0 \n" \
  130. " bra 2b \n" \
  131. ".previous \n" \
  132. ".section __ex_table,\"a\" \n" \
  133. " .balign 8 \n" \
  134. " .long 1b,3b \n" \
  135. ".previous" \
  136. : "=r" (err) \
  137. : "m" (*__ptr(ptr)), constraint (x), "i"(-EFAULT), "0"(err) \
  138. : "memory"); \
  139. } while (0)
  140. #else
  141. #define __put_user_asm(err,x,ptr,bwl,con) \
  142. do { \
  143. asm(" st"bwl"%I0 %1,%M0 \n" \
  144. " membar \n" \
  145. : \
  146. : "m" (*__ptr(ptr)), con (x) \
  147. : "memory"); \
  148. } while (0)
  149. #endif
  150. /*****************************************************************************/
  151. /*
  152. *
  153. */
  154. #define __get_user(x, ptr) \
  155. ({ \
  156. typeof(*(ptr)) __gu_val = 0; \
  157. int __gu_err = 0; \
  158. \
  159. switch (sizeof(*(ptr))) { \
  160. case 1: \
  161. __get_user_asm(__gu_err, __gu_val, ptr, "ub", "=r"); \
  162. break; \
  163. case 2: \
  164. __get_user_asm(__gu_err, __gu_val, ptr, "uh", "=r"); \
  165. break; \
  166. case 4: \
  167. __get_user_asm(__gu_err, __gu_val, ptr, "", "=r"); \
  168. break; \
  169. case 8: \
  170. __get_user_asm(__gu_err, __gu_val, ptr, "d", "=e"); \
  171. break; \
  172. default: \
  173. __gu_err = __get_user_bad(); \
  174. break; \
  175. } \
  176. (x) = __gu_val; \
  177. __gu_err; \
  178. })
  179. #define get_user(x, ptr) \
  180. ({ \
  181. typeof(&*ptr) _p = (ptr); \
  182. int _e; \
  183. \
  184. _e = __range_ok(_p, sizeof(*_p)); \
  185. if (likely(_e == 0)) \
  186. _e = __get_user((x), _p); \
  187. else \
  188. (x) = (typeof(x)) 0; \
  189. _e; \
  190. })
  191. extern int __get_user_bad(void);
  192. #ifdef CONFIG_MMU
  193. #define __get_user_asm(err,x,ptr,dtype,constraint) \
  194. do { \
  195. asm("1: ld"dtype"%I2 %M2,%1 \n" \
  196. "2: \n" \
  197. ".subsection 2 \n" \
  198. "3: setlos %3,%0 \n" \
  199. " setlos #0,%1 \n" \
  200. " bra 2b \n" \
  201. ".previous \n" \
  202. ".section __ex_table,\"a\" \n" \
  203. " .balign 8 \n" \
  204. " .long 1b,3b \n" \
  205. ".previous" \
  206. : "=r" (err), constraint (x) \
  207. : "m" (*__ptr(ptr)), "i"(-EFAULT), "0"(err) \
  208. ); \
  209. } while(0)
  210. #else
  211. #define __get_user_asm(err,x,ptr,bwl,con) \
  212. asm(" ld"bwl"%I1 %M1,%0 \n" \
  213. " membar \n" \
  214. : con(x) \
  215. : "m" (*__ptr(ptr)))
  216. #endif
  217. /*****************************************************************************/
  218. /*
  219. *
  220. */
  221. #ifdef CONFIG_MMU
  222. extern long __memset_user(void *dst, unsigned long count);
  223. extern long __memcpy_user(void *dst, const void *src, unsigned long count);
  224. #define clear_user(dst,count) __memset_user((dst), (count))
  225. #define __copy_from_user_inatomic(to, from, n) __memcpy_user((to), (from), (n))
  226. #define __copy_to_user_inatomic(to, from, n) __memcpy_user((to), (from), (n))
  227. #else
  228. #define clear_user(dst,count) (memset((dst), 0, (count)), 0)
  229. #define __copy_from_user_inatomic(to, from, n) (memcpy((to), (from), (n)), 0)
  230. #define __copy_to_user_inatomic(to, from, n) (memcpy((to), (from), (n)), 0)
  231. #endif
  232. static inline unsigned long __must_check
  233. __copy_to_user(void __user *to, const void *from, unsigned long n)
  234. {
  235. might_sleep();
  236. return __copy_to_user_inatomic(to, from, n);
  237. }
  238. static inline unsigned long
  239. __copy_from_user(void *to, const void __user *from, unsigned long n)
  240. {
  241. might_sleep();
  242. return __copy_from_user_inatomic(to, from, n);
  243. }
  244. static inline long copy_from_user(void *to, const void *from, unsigned long n)
  245. {
  246. unsigned long ret = n;
  247. if (likely(__access_ok(from, n)))
  248. ret = __copy_from_user(to, from, n);
  249. if (unlikely(ret != 0))
  250. memset(to + (n - ret), 0, ret);
  251. return ret;
  252. }
  253. static inline long copy_to_user(void *to, const void *from, unsigned long n)
  254. {
  255. return likely(__access_ok(to, n)) ? __copy_to_user(to, from, n) : n;
  256. }
  257. #define copy_to_user_ret(to,from,n,retval) ({ if (copy_to_user(to,from,n)) return retval; })
  258. #define copy_from_user_ret(to,from,n,retval) ({ if (copy_from_user(to,from,n)) return retval; })
  259. extern long strncpy_from_user(char *dst, const char *src, long count);
  260. extern long strnlen_user(const char *src, long count);
  261. #define strlen_user(str) strnlen_user(str, 32767)
  262. extern unsigned long search_exception_table(unsigned long addr);
  263. #define copy_to_user_page(vma, page, vaddr, dst, src, len) memcpy(dst, src, len)
  264. #define copy_from_user_page(vma, page, vaddr, dst, src, len) memcpy(dst, src, len)
  265. #endif /* _ASM_UACCESS_H */