uaccess_32.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339
  1. /*
  2. * uaccess.h: User space memore access functions.
  3. *
  4. * Copyright (C) 1996 David S. Miller (davem@caip.rutgers.edu)
  5. * Copyright (C) 1996,1997 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
  6. */
  7. #ifndef _ASM_UACCESS_H
  8. #define _ASM_UACCESS_H
  9. #ifdef __KERNEL__
  10. #include <linux/compiler.h>
  11. #include <linux/sched.h>
  12. #include <linux/string.h>
  13. #include <linux/errno.h>
  14. #include <asm/vac-ops.h>
  15. #endif
  16. #ifndef __ASSEMBLY__
  17. #define ARCH_HAS_SORT_EXTABLE
  18. #define ARCH_HAS_SEARCH_EXTABLE
  19. /* Sparc is not segmented, however we need to be able to fool access_ok()
  20. * when doing system calls from kernel mode legitimately.
  21. *
  22. * "For historical reasons, these macros are grossly misnamed." -Linus
  23. */
  24. #define KERNEL_DS ((mm_segment_t) { 0 })
  25. #define USER_DS ((mm_segment_t) { -1 })
  26. #define VERIFY_READ 0
  27. #define VERIFY_WRITE 1
  28. #define get_ds() (KERNEL_DS)
  29. #define get_fs() (current->thread.current_ds)
  30. #define set_fs(val) ((current->thread.current_ds) = (val))
  31. #define segment_eq(a,b) ((a).seg == (b).seg)
  32. /* We have there a nice not-mapped page at PAGE_OFFSET - PAGE_SIZE, so that this test
  33. * can be fairly lightweight.
  34. * No one can read/write anything from userland in the kernel space by setting
  35. * large size and address near to PAGE_OFFSET - a fault will break his intentions.
  36. */
  37. #define __user_ok(addr, size) ({ (void)(size); (addr) < STACK_TOP; })
  38. #define __kernel_ok (segment_eq(get_fs(), KERNEL_DS))
  39. #define __access_ok(addr,size) (__user_ok((addr) & get_fs().seg,(size)))
  40. #define access_ok(type, addr, size) \
  41. ({ (void)(type); __access_ok((unsigned long)(addr), size); })
  42. /*
  43. * The exception table consists of pairs of addresses: the first is the
  44. * address of an instruction that is allowed to fault, and the second is
  45. * the address at which the program should continue. No registers are
  46. * modified, so it is entirely up to the continuation code to figure out
  47. * what to do.
  48. *
  49. * All the routines below use bits of fixup code that are out of line
  50. * with the main instruction path. This means when everything is well,
  51. * we don't even have to jump over them. Further, they do not intrude
  52. * on our cache or tlb entries.
  53. *
  54. * There is a special way how to put a range of potentially faulting
  55. * insns (like twenty ldd/std's with now intervening other instructions)
  56. * You specify address of first in insn and 0 in fixup and in the next
  57. * exception_table_entry you specify last potentially faulting insn + 1
  58. * and in fixup the routine which should handle the fault.
  59. * That fixup code will get
  60. * (faulting_insn_address - first_insn_in_the_range_address)/4
  61. * in %g2 (ie. index of the faulting instruction in the range).
  62. */
  63. struct exception_table_entry
  64. {
  65. unsigned long insn, fixup;
  66. };
  67. /* Returns 0 if exception not found and fixup otherwise. */
  68. extern unsigned long search_extables_range(unsigned long addr, unsigned long *g2);
  69. extern void __ret_efault(void);
  70. /* Uh, these should become the main single-value transfer routines..
  71. * They automatically use the right size if we just have the right
  72. * pointer type..
  73. *
  74. * This gets kind of ugly. We want to return _two_ values in "get_user()"
  75. * and yet we don't want to do any pointers, because that is too much
  76. * of a performance impact. Thus we have a few rather ugly macros here,
  77. * and hide all the ugliness from the user.
  78. */
  79. #define put_user(x,ptr) ({ \
  80. unsigned long __pu_addr = (unsigned long)(ptr); \
  81. __chk_user_ptr(ptr); \
  82. __put_user_check((__typeof__(*(ptr)))(x),__pu_addr,sizeof(*(ptr))); })
  83. #define get_user(x,ptr) ({ \
  84. unsigned long __gu_addr = (unsigned long)(ptr); \
  85. __chk_user_ptr(ptr); \
  86. __get_user_check((x),__gu_addr,sizeof(*(ptr)),__typeof__(*(ptr))); })
  87. /*
  88. * The "__xxx" versions do not do address space checking, useful when
  89. * doing multiple accesses to the same area (the user has to do the
  90. * checks by hand with "access_ok()")
  91. */
  92. #define __put_user(x,ptr) __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
  93. #define __get_user(x,ptr) __get_user_nocheck((x),(ptr),sizeof(*(ptr)),__typeof__(*(ptr)))
  94. struct __large_struct { unsigned long buf[100]; };
  95. #define __m(x) ((struct __large_struct __user *)(x))
  96. #define __put_user_check(x,addr,size) ({ \
  97. register int __pu_ret; \
  98. if (__access_ok(addr,size)) { \
  99. switch (size) { \
  100. case 1: __put_user_asm(x,b,addr,__pu_ret); break; \
  101. case 2: __put_user_asm(x,h,addr,__pu_ret); break; \
  102. case 4: __put_user_asm(x,,addr,__pu_ret); break; \
  103. case 8: __put_user_asm(x,d,addr,__pu_ret); break; \
  104. default: __pu_ret = __put_user_bad(); break; \
  105. } } else { __pu_ret = -EFAULT; } __pu_ret; })
  106. #define __put_user_nocheck(x,addr,size) ({ \
  107. register int __pu_ret; \
  108. switch (size) { \
  109. case 1: __put_user_asm(x,b,addr,__pu_ret); break; \
  110. case 2: __put_user_asm(x,h,addr,__pu_ret); break; \
  111. case 4: __put_user_asm(x,,addr,__pu_ret); break; \
  112. case 8: __put_user_asm(x,d,addr,__pu_ret); break; \
  113. default: __pu_ret = __put_user_bad(); break; \
  114. } __pu_ret; })
  115. #define __put_user_asm(x,size,addr,ret) \
  116. __asm__ __volatile__( \
  117. "/* Put user asm, inline. */\n" \
  118. "1:\t" "st"#size " %1, %2\n\t" \
  119. "clr %0\n" \
  120. "2:\n\n\t" \
  121. ".section .fixup,#alloc,#execinstr\n\t" \
  122. ".align 4\n" \
  123. "3:\n\t" \
  124. "b 2b\n\t" \
  125. " mov %3, %0\n\t" \
  126. ".previous\n\n\t" \
  127. ".section __ex_table,#alloc\n\t" \
  128. ".align 4\n\t" \
  129. ".word 1b, 3b\n\t" \
  130. ".previous\n\n\t" \
  131. : "=&r" (ret) : "r" (x), "m" (*__m(addr)), \
  132. "i" (-EFAULT))
  133. extern int __put_user_bad(void);
  134. #define __get_user_check(x,addr,size,type) ({ \
  135. register int __gu_ret; \
  136. register unsigned long __gu_val; \
  137. if (__access_ok(addr,size)) { \
  138. switch (size) { \
  139. case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
  140. case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
  141. case 4: __get_user_asm(__gu_val,,addr,__gu_ret); break; \
  142. case 8: __get_user_asm(__gu_val,d,addr,__gu_ret); break; \
  143. default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
  144. } } else { __gu_val = 0; __gu_ret = -EFAULT; } x = (type) __gu_val; __gu_ret; })
  145. #define __get_user_check_ret(x,addr,size,type,retval) ({ \
  146. register unsigned long __gu_val __asm__ ("l1"); \
  147. if (__access_ok(addr,size)) { \
  148. switch (size) { \
  149. case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
  150. case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
  151. case 4: __get_user_asm_ret(__gu_val,,addr,retval); break; \
  152. case 8: __get_user_asm_ret(__gu_val,d,addr,retval); break; \
  153. default: if (__get_user_bad()) return retval; \
  154. } x = (type) __gu_val; } else return retval; })
  155. #define __get_user_nocheck(x,addr,size,type) ({ \
  156. register int __gu_ret; \
  157. register unsigned long __gu_val; \
  158. switch (size) { \
  159. case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
  160. case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
  161. case 4: __get_user_asm(__gu_val,,addr,__gu_ret); break; \
  162. case 8: __get_user_asm(__gu_val,d,addr,__gu_ret); break; \
  163. default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
  164. } x = (type) __gu_val; __gu_ret; })
  165. #define __get_user_nocheck_ret(x,addr,size,type,retval) ({ \
  166. register unsigned long __gu_val __asm__ ("l1"); \
  167. switch (size) { \
  168. case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
  169. case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
  170. case 4: __get_user_asm_ret(__gu_val,,addr,retval); break; \
  171. case 8: __get_user_asm_ret(__gu_val,d,addr,retval); break; \
  172. default: if (__get_user_bad()) return retval; \
  173. } x = (type) __gu_val; })
  174. #define __get_user_asm(x,size,addr,ret) \
  175. __asm__ __volatile__( \
  176. "/* Get user asm, inline. */\n" \
  177. "1:\t" "ld"#size " %2, %1\n\t" \
  178. "clr %0\n" \
  179. "2:\n\n\t" \
  180. ".section .fixup,#alloc,#execinstr\n\t" \
  181. ".align 4\n" \
  182. "3:\n\t" \
  183. "clr %1\n\t" \
  184. "b 2b\n\t" \
  185. " mov %3, %0\n\n\t" \
  186. ".previous\n\t" \
  187. ".section __ex_table,#alloc\n\t" \
  188. ".align 4\n\t" \
  189. ".word 1b, 3b\n\n\t" \
  190. ".previous\n\t" \
  191. : "=&r" (ret), "=&r" (x) : "m" (*__m(addr)), \
  192. "i" (-EFAULT))
  193. #define __get_user_asm_ret(x,size,addr,retval) \
  194. if (__builtin_constant_p(retval) && retval == -EFAULT) \
  195. __asm__ __volatile__( \
  196. "/* Get user asm ret, inline. */\n" \
  197. "1:\t" "ld"#size " %1, %0\n\n\t" \
  198. ".section __ex_table,#alloc\n\t" \
  199. ".align 4\n\t" \
  200. ".word 1b,__ret_efault\n\n\t" \
  201. ".previous\n\t" \
  202. : "=&r" (x) : "m" (*__m(addr))); \
  203. else \
  204. __asm__ __volatile__( \
  205. "/* Get user asm ret, inline. */\n" \
  206. "1:\t" "ld"#size " %1, %0\n\n\t" \
  207. ".section .fixup,#alloc,#execinstr\n\t" \
  208. ".align 4\n" \
  209. "3:\n\t" \
  210. "ret\n\t" \
  211. " restore %%g0, %2, %%o0\n\n\t" \
  212. ".previous\n\t" \
  213. ".section __ex_table,#alloc\n\t" \
  214. ".align 4\n\t" \
  215. ".word 1b, 3b\n\n\t" \
  216. ".previous\n\t" \
  217. : "=&r" (x) : "m" (*__m(addr)), "i" (retval))
  218. extern int __get_user_bad(void);
  219. extern unsigned long __copy_user(void __user *to, const void __user *from, unsigned long size);
  220. static inline unsigned long copy_to_user(void __user *to, const void *from, unsigned long n)
  221. {
  222. if (n && __access_ok((unsigned long) to, n))
  223. return __copy_user(to, (__force void __user *) from, n);
  224. else
  225. return n;
  226. }
  227. static inline unsigned long __copy_to_user(void __user *to, const void *from, unsigned long n)
  228. {
  229. return __copy_user(to, (__force void __user *) from, n);
  230. }
  231. static inline unsigned long copy_from_user(void *to, const void __user *from, unsigned long n)
  232. {
  233. if (n && __access_ok((unsigned long) from, n))
  234. return __copy_user((__force void __user *) to, from, n);
  235. else
  236. return n;
  237. }
  238. static inline unsigned long __copy_from_user(void *to, const void __user *from, unsigned long n)
  239. {
  240. return __copy_user((__force void __user *) to, from, n);
  241. }
  242. #define __copy_to_user_inatomic __copy_to_user
  243. #define __copy_from_user_inatomic __copy_from_user
  244. static inline unsigned long __clear_user(void __user *addr, unsigned long size)
  245. {
  246. unsigned long ret;
  247. __asm__ __volatile__ (
  248. ".section __ex_table,#alloc\n\t"
  249. ".align 4\n\t"
  250. ".word 1f,3\n\t"
  251. ".previous\n\t"
  252. "mov %2, %%o1\n"
  253. "1:\n\t"
  254. "call __bzero\n\t"
  255. " mov %1, %%o0\n\t"
  256. "mov %%o0, %0\n"
  257. : "=r" (ret) : "r" (addr), "r" (size) :
  258. "o0", "o1", "o2", "o3", "o4", "o5", "o7",
  259. "g1", "g2", "g3", "g4", "g5", "g7", "cc");
  260. return ret;
  261. }
  262. static inline unsigned long clear_user(void __user *addr, unsigned long n)
  263. {
  264. if (n && __access_ok((unsigned long) addr, n))
  265. return __clear_user(addr, n);
  266. else
  267. return n;
  268. }
  269. extern long __strncpy_from_user(char *dest, const char __user *src, long count);
  270. static inline long strncpy_from_user(char *dest, const char __user *src, long count)
  271. {
  272. if (__access_ok((unsigned long) src, count))
  273. return __strncpy_from_user(dest, src, count);
  274. else
  275. return -EFAULT;
  276. }
  277. extern long __strlen_user(const char __user *);
  278. extern long __strnlen_user(const char __user *, long len);
  279. static inline long strlen_user(const char __user *str)
  280. {
  281. if (!access_ok(VERIFY_READ, str, 0))
  282. return 0;
  283. else
  284. return __strlen_user(str);
  285. }
  286. static inline long strnlen_user(const char __user *str, long len)
  287. {
  288. if (!access_ok(VERIFY_READ, str, 0))
  289. return 0;
  290. else
  291. return __strnlen_user(str, len);
  292. }
  293. #endif /* __ASSEMBLY__ */
  294. #endif /* _ASM_UACCESS_H */