uaccess_64.h 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283
  1. #ifndef __ASM_SH_UACCESS_64_H
  2. #define __ASM_SH_UACCESS_64_H
  3. /*
  4. * include/asm-sh/uaccess_64.h
  5. *
  6. * Copyright (C) 2000, 2001 Paolo Alberelli
  7. * Copyright (C) 2003, 2004 Paul Mundt
  8. *
  9. * User space memory access functions
  10. *
  11. * Copyright (C) 1999 Niibe Yutaka
  12. *
  13. * Based on:
  14. * MIPS implementation version 1.15 by
  15. * Copyright (C) 1996, 1997, 1998 by Ralf Baechle
  16. * and i386 version.
  17. *
  18. * This file is subject to the terms and conditions of the GNU General Public
  19. * License. See the file "COPYING" in the main directory of this archive
  20. * for more details.
  21. */
  22. #include <linux/errno.h>
  23. #include <linux/sched.h>
  24. #define VERIFY_READ 0
  25. #define VERIFY_WRITE 1
  26. /*
  27. * The fs value determines whether argument validity checking should be
  28. * performed or not. If get_fs() == USER_DS, checking is performed, with
  29. * get_fs() == KERNEL_DS, checking is bypassed.
  30. *
  31. * For historical reasons (Data Segment Register?), these macros are misnamed.
  32. */
  33. #define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
  34. #define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFF)
  35. #define USER_DS MAKE_MM_SEG(0x80000000)
  36. #define get_ds() (KERNEL_DS)
  37. #define get_fs() (current_thread_info()->addr_limit)
  38. #define set_fs(x) (current_thread_info()->addr_limit=(x))
  39. #define segment_eq(a,b) ((a).seg == (b).seg)
  40. #define __addr_ok(addr) ((unsigned long)(addr) < (current_thread_info()->addr_limit.seg))
  41. /*
  42. * Uhhuh, this needs 33-bit arithmetic. We have a carry..
  43. *
  44. * sum := addr + size; carry? --> flag = true;
  45. * if (sum >= addr_limit) flag = true;
  46. */
  47. #define __range_ok(addr,size) (((unsigned long) (addr) + (size) < (current_thread_info()->addr_limit.seg)) ? 0 : 1)
  48. #define access_ok(type,addr,size) (__range_ok(addr,size) == 0)
  49. #define __access_ok(addr,size) (__range_ok(addr,size) == 0)
  50. /*
  51. * Uh, these should become the main single-value transfer routines ...
  52. * They automatically use the right size if we just have the right
  53. * pointer type ...
  54. *
  55. * As MIPS uses the same address space for kernel and user data, we
  56. * can just do these as direct assignments.
  57. *
  58. * Careful to not
  59. * (a) re-use the arguments for side effects (sizeof is ok)
  60. * (b) require any knowledge of processes at this stage
  61. */
  62. #define put_user(x,ptr) __put_user_check((x),(ptr),sizeof(*(ptr)))
  63. #define get_user(x,ptr) __get_user_check((x),(ptr),sizeof(*(ptr)))
  64. /*
  65. * The "__xxx" versions do not do address space checking, useful when
  66. * doing multiple accesses to the same area (the user has to do the
  67. * checks by hand with "access_ok()")
  68. */
  69. #define __put_user(x,ptr) __put_user_nocheck((x),(ptr),sizeof(*(ptr)))
  70. #define __get_user(x,ptr) __get_user_nocheck((x),(ptr),sizeof(*(ptr)))
  71. /*
  72. * The "xxx_ret" versions return constant specified in third argument, if
  73. * something bad happens. These macros can be optimized for the
  74. * case of just returning from the function xxx_ret is used.
  75. */
  76. #define put_user_ret(x,ptr,ret) ({ \
  77. if (put_user(x,ptr)) return ret; })
  78. #define get_user_ret(x,ptr,ret) ({ \
  79. if (get_user(x,ptr)) return ret; })
  80. #define __put_user_ret(x,ptr,ret) ({ \
  81. if (__put_user(x,ptr)) return ret; })
  82. #define __get_user_ret(x,ptr,ret) ({ \
  83. if (__get_user(x,ptr)) return ret; })
  84. struct __large_struct { unsigned long buf[100]; };
  85. #define __m(x) (*(struct __large_struct *)(x))
  86. #define __get_user_size(x,ptr,size,retval) \
  87. do { \
  88. retval = 0; \
  89. switch (size) { \
  90. case 1: \
  91. retval = __get_user_asm_b(x, ptr); \
  92. break; \
  93. case 2: \
  94. retval = __get_user_asm_w(x, ptr); \
  95. break; \
  96. case 4: \
  97. retval = __get_user_asm_l(x, ptr); \
  98. break; \
  99. case 8: \
  100. retval = __get_user_asm_q(x, ptr); \
  101. break; \
  102. default: \
  103. __get_user_unknown(); \
  104. break; \
  105. } \
  106. } while (0)
  107. #define __get_user_nocheck(x,ptr,size) \
  108. ({ \
  109. long __gu_err, __gu_val; \
  110. __get_user_size((void *)&__gu_val, (long)(ptr), \
  111. (size), __gu_err); \
  112. (x) = (__typeof__(*(ptr)))__gu_val; \
  113. __gu_err; \
  114. })
  115. #define __get_user_check(x,ptr,size) \
  116. ({ \
  117. long __gu_addr = (long)(ptr); \
  118. long __gu_err = -EFAULT, __gu_val; \
  119. if (__access_ok(__gu_addr, (size))) \
  120. __get_user_size((void *)&__gu_val, __gu_addr, \
  121. (size), __gu_err); \
  122. (x) = (__typeof__(*(ptr))) __gu_val; \
  123. __gu_err; \
  124. })
  125. extern long __get_user_asm_b(void *, long);
  126. extern long __get_user_asm_w(void *, long);
  127. extern long __get_user_asm_l(void *, long);
  128. extern long __get_user_asm_q(void *, long);
  129. extern void __get_user_unknown(void);
  130. #define __put_user_size(x,ptr,size,retval) \
  131. do { \
  132. retval = 0; \
  133. switch (size) { \
  134. case 1: \
  135. retval = __put_user_asm_b(x, ptr); \
  136. break; \
  137. case 2: \
  138. retval = __put_user_asm_w(x, ptr); \
  139. break; \
  140. case 4: \
  141. retval = __put_user_asm_l(x, ptr); \
  142. break; \
  143. case 8: \
  144. retval = __put_user_asm_q(x, ptr); \
  145. break; \
  146. default: \
  147. __put_user_unknown(); \
  148. } \
  149. } while (0)
  150. #define __put_user_nocheck(x,ptr,size) \
  151. ({ \
  152. long __pu_err; \
  153. __typeof__(*(ptr)) __pu_val = (x); \
  154. __put_user_size((void *)&__pu_val, (long)(ptr), (size), __pu_err); \
  155. __pu_err; \
  156. })
  157. #define __put_user_check(x,ptr,size) \
  158. ({ \
  159. long __pu_err = -EFAULT; \
  160. long __pu_addr = (long)(ptr); \
  161. __typeof__(*(ptr)) __pu_val = (x); \
  162. \
  163. if (__access_ok(__pu_addr, (size))) \
  164. __put_user_size((void *)&__pu_val, __pu_addr, (size), __pu_err);\
  165. __pu_err; \
  166. })
  167. extern long __put_user_asm_b(void *, long);
  168. extern long __put_user_asm_w(void *, long);
  169. extern long __put_user_asm_l(void *, long);
  170. extern long __put_user_asm_q(void *, long);
  171. extern void __put_user_unknown(void);
  172. /* Generic arbitrary sized copy. */
  173. /* Return the number of bytes NOT copied */
  174. /* XXX: should be such that: 4byte and the rest. */
  175. extern __kernel_size_t __copy_user(void *__to, const void *__from, __kernel_size_t __n);
  176. #define copy_to_user_ret(to,from,n,retval) ({ \
  177. if (copy_to_user(to,from,n)) \
  178. return retval; \
  179. })
  180. #define __copy_to_user(to,from,n) \
  181. __copy_user((void *)(to), \
  182. (void *)(from), n)
  183. #define __copy_to_user_ret(to,from,n,retval) ({ \
  184. if (__copy_to_user(to,from,n)) \
  185. return retval; \
  186. })
  187. #define copy_from_user_ret(to,from,n,retval) ({ \
  188. if (copy_from_user(to,from,n)) \
  189. return retval; \
  190. })
  191. #define __copy_from_user(to,from,n) \
  192. __copy_user((void *)(to), \
  193. (void *)(from), n)
  194. #define __copy_from_user_ret(to,from,n,retval) ({ \
  195. if (__copy_from_user(to,from,n)) \
  196. return retval; \
  197. })
  198. #define __copy_to_user_inatomic __copy_to_user
  199. #define __copy_from_user_inatomic __copy_from_user
  200. /* XXX: Not sure it works well..
  201. should be such that: 4byte clear and the rest. */
  202. extern __kernel_size_t __clear_user(void *addr, __kernel_size_t size);
  203. #define clear_user(addr,n) ({ \
  204. void * __cl_addr = (addr); \
  205. unsigned long __cl_size = (n); \
  206. if (__cl_size && __access_ok(((unsigned long)(__cl_addr)), __cl_size)) \
  207. __cl_size = __clear_user(__cl_addr, __cl_size); \
  208. __cl_size; })
  209. extern int __strncpy_from_user(unsigned long __dest, unsigned long __src, int __count);
  210. #define strncpy_from_user(dest,src,count) ({ \
  211. unsigned long __sfu_src = (unsigned long) (src); \
  212. int __sfu_count = (int) (count); \
  213. long __sfu_res = -EFAULT; \
  214. if(__access_ok(__sfu_src, __sfu_count)) { \
  215. __sfu_res = __strncpy_from_user((unsigned long) (dest), __sfu_src, __sfu_count); \
  216. } __sfu_res; })
  217. #define strlen_user(str) strnlen_user(str, ~0UL >> 1)
  218. /*
  219. * Return the size of a string (including the ending 0!)
  220. */
  221. extern long __strnlen_user(const char *__s, long __n);
  222. static inline long strnlen_user(const char *s, long n)
  223. {
  224. if (!__addr_ok(s))
  225. return 0;
  226. else
  227. return __strnlen_user(s, n);
  228. }
  229. struct exception_table_entry
  230. {
  231. unsigned long insn, fixup;
  232. };
  233. #define ARCH_HAS_SEARCH_EXTABLE
  234. /* Returns 0 if exception not found and fixup.unit otherwise. */
  235. extern unsigned long search_exception_table(unsigned long addr);
  236. extern const struct exception_table_entry *search_exception_tables (unsigned long addr);
  237. #endif /* __ASM_SH_UACCESS_64_H */