uaccess.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  1. /* $Id: uaccess.h,v 1.24 2001/10/30 04:32:24 davem Exp $
  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. #include <asm/a.out.h>
  16. #endif
  17. #ifndef __ASSEMBLY__
  18. /* Sparc is not segmented, however we need to be able to fool access_ok()
  19. * when doing system calls from kernel mode legitimately.
  20. *
  21. * "For historical reasons, these macros are grossly misnamed." -Linus
  22. */
  23. #define KERNEL_DS ((mm_segment_t) { 0 })
  24. #define USER_DS ((mm_segment_t) { -1 })
  25. #define VERIFY_READ 0
  26. #define VERIFY_WRITE 1
  27. #define get_ds() (KERNEL_DS)
  28. #define get_fs() (current->thread.current_ds)
  29. #define set_fs(val) ((current->thread.current_ds) = (val))
  30. #define segment_eq(a,b) ((a).seg == (b).seg)
  31. /* We have there a nice not-mapped page at PAGE_OFFSET - PAGE_SIZE, so that this test
  32. * can be fairly lightweight.
  33. * No one can read/write anything from userland in the kernel space by setting
  34. * large size and address near to PAGE_OFFSET - a fault will break his intentions.
  35. */
  36. #define __user_ok(addr, size) ({ (void)(size); (addr) < STACK_TOP; })
  37. #define __kernel_ok (segment_eq(get_fs(), KERNEL_DS))
  38. #define __access_ok(addr,size) (__user_ok((addr) & get_fs().seg,(size)))
  39. #define access_ok(type, addr, size) \
  40. ({ (void)(type); __access_ok((unsigned long)(addr), size); })
  41. /* this function will go away soon - use access_ok() instead */
  42. static 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. * There is a special way how to put a range of potentially faulting
  59. * insns (like twenty ldd/std's with now intervening other instructions)
  60. * You specify address of first in insn and 0 in fixup and in the next
  61. * exception_table_entry you specify last potentially faulting insn + 1
  62. * and in fixup the routine which should handle the fault.
  63. * That fixup code will get
  64. * (faulting_insn_address - first_insn_in_the_range_address)/4
  65. * in %g2 (ie. index of the faulting instruction in the range).
  66. */
  67. struct exception_table_entry
  68. {
  69. unsigned long insn, fixup;
  70. };
  71. /* Returns 0 if exception not found and fixup otherwise. */
  72. extern unsigned long search_extables_range(unsigned long addr, unsigned long *g2);
  73. extern void __ret_efault(void);
  74. /* Uh, these should become the main single-value transfer routines..
  75. * They automatically use the right size if we just have the right
  76. * pointer type..
  77. *
  78. * This gets kind of ugly. We want to return _two_ values in "get_user()"
  79. * and yet we don't want to do any pointers, because that is too much
  80. * of a performance impact. Thus we have a few rather ugly macros here,
  81. * and hide all the ugliness from the user.
  82. */
  83. #define put_user(x,ptr) ({ \
  84. unsigned long __pu_addr = (unsigned long)(ptr); \
  85. __chk_user_ptr(ptr); \
  86. __put_user_check((__typeof__(*(ptr)))(x),__pu_addr,sizeof(*(ptr))); })
  87. #define get_user(x,ptr) ({ \
  88. unsigned long __gu_addr = (unsigned long)(ptr); \
  89. __chk_user_ptr(ptr); \
  90. __get_user_check((x),__gu_addr,sizeof(*(ptr)),__typeof__(*(ptr))); })
  91. /*
  92. * The "__xxx" versions do not do address space checking, useful when
  93. * doing multiple accesses to the same area (the user has to do the
  94. * checks by hand with "access_ok()")
  95. */
  96. #define __put_user(x,ptr) __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
  97. #define __get_user(x,ptr) __get_user_nocheck((x),(ptr),sizeof(*(ptr)),__typeof__(*(ptr)))
  98. struct __large_struct { unsigned long buf[100]; };
  99. #define __m(x) ((struct __large_struct __user *)(x))
  100. #define __put_user_check(x,addr,size) ({ \
  101. register int __pu_ret; \
  102. if (__access_ok(addr,size)) { \
  103. switch (size) { \
  104. case 1: __put_user_asm(x,b,addr,__pu_ret); break; \
  105. case 2: __put_user_asm(x,h,addr,__pu_ret); break; \
  106. case 4: __put_user_asm(x,,addr,__pu_ret); break; \
  107. case 8: __put_user_asm(x,d,addr,__pu_ret); break; \
  108. default: __pu_ret = __put_user_bad(); break; \
  109. } } else { __pu_ret = -EFAULT; } __pu_ret; })
  110. #define __put_user_check_ret(x,addr,size,retval) ({ \
  111. register int __foo __asm__ ("l1"); \
  112. if (__access_ok(addr,size)) { \
  113. switch (size) { \
  114. case 1: __put_user_asm_ret(x,b,addr,retval,__foo); break; \
  115. case 2: __put_user_asm_ret(x,h,addr,retval,__foo); break; \
  116. case 4: __put_user_asm_ret(x,,addr,retval,__foo); break; \
  117. case 8: __put_user_asm_ret(x,d,addr,retval,__foo); break; \
  118. default: if (__put_user_bad()) return retval; break; \
  119. } } else return retval; })
  120. #define __put_user_nocheck(x,addr,size) ({ \
  121. register int __pu_ret; \
  122. switch (size) { \
  123. case 1: __put_user_asm(x,b,addr,__pu_ret); break; \
  124. case 2: __put_user_asm(x,h,addr,__pu_ret); break; \
  125. case 4: __put_user_asm(x,,addr,__pu_ret); break; \
  126. case 8: __put_user_asm(x,d,addr,__pu_ret); break; \
  127. default: __pu_ret = __put_user_bad(); break; \
  128. } __pu_ret; })
  129. #define __put_user_nocheck_ret(x,addr,size,retval) ({ \
  130. register int __foo __asm__ ("l1"); \
  131. switch (size) { \
  132. case 1: __put_user_asm_ret(x,b,addr,retval,__foo); break; \
  133. case 2: __put_user_asm_ret(x,h,addr,retval,__foo); break; \
  134. case 4: __put_user_asm_ret(x,,addr,retval,__foo); break; \
  135. case 8: __put_user_asm_ret(x,d,addr,retval,__foo); break; \
  136. default: if (__put_user_bad()) return retval; break; \
  137. } })
  138. #define __put_user_asm(x,size,addr,ret) \
  139. __asm__ __volatile__( \
  140. "/* Put user asm, inline. */\n" \
  141. "1:\t" "st"#size " %1, %2\n\t" \
  142. "clr %0\n" \
  143. "2:\n\n\t" \
  144. ".section .fixup,#alloc,#execinstr\n\t" \
  145. ".align 4\n" \
  146. "3:\n\t" \
  147. "b 2b\n\t" \
  148. " mov %3, %0\n\t" \
  149. ".previous\n\n\t" \
  150. ".section __ex_table,#alloc\n\t" \
  151. ".align 4\n\t" \
  152. ".word 1b, 3b\n\t" \
  153. ".previous\n\n\t" \
  154. : "=&r" (ret) : "r" (x), "m" (*__m(addr)), \
  155. "i" (-EFAULT))
  156. #define __put_user_asm_ret(x,size,addr,ret,foo) \
  157. if (__builtin_constant_p(ret) && ret == -EFAULT) \
  158. __asm__ __volatile__( \
  159. "/* Put user asm ret, inline. */\n" \
  160. "1:\t" "st"#size " %1, %2\n\n\t" \
  161. ".section __ex_table,#alloc\n\t" \
  162. ".align 4\n\t" \
  163. ".word 1b, __ret_efault\n\n\t" \
  164. ".previous\n\n\t" \
  165. : "=r" (foo) : "r" (x), "m" (*__m(addr))); \
  166. else \
  167. __asm__ __volatile( \
  168. "/* Put user asm ret, inline. */\n" \
  169. "1:\t" "st"#size " %1, %2\n\n\t" \
  170. ".section .fixup,#alloc,#execinstr\n\t" \
  171. ".align 4\n" \
  172. "3:\n\t" \
  173. "ret\n\t" \
  174. " restore %%g0, %3, %%o0\n\t" \
  175. ".previous\n\n\t" \
  176. ".section __ex_table,#alloc\n\t" \
  177. ".align 4\n\t" \
  178. ".word 1b, 3b\n\n\t" \
  179. ".previous\n\n\t" \
  180. : "=r" (foo) : "r" (x), "m" (*__m(addr)), "i" (ret))
  181. extern int __put_user_bad(void);
  182. #define __get_user_check(x,addr,size,type) ({ \
  183. register int __gu_ret; \
  184. register unsigned long __gu_val; \
  185. if (__access_ok(addr,size)) { \
  186. switch (size) { \
  187. case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
  188. case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
  189. case 4: __get_user_asm(__gu_val,,addr,__gu_ret); break; \
  190. case 8: __get_user_asm(__gu_val,d,addr,__gu_ret); break; \
  191. default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
  192. } } else { __gu_val = 0; __gu_ret = -EFAULT; } x = (type) __gu_val; __gu_ret; })
  193. #define __get_user_check_ret(x,addr,size,type,retval) ({ \
  194. register unsigned long __gu_val __asm__ ("l1"); \
  195. if (__access_ok(addr,size)) { \
  196. switch (size) { \
  197. case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
  198. case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
  199. case 4: __get_user_asm_ret(__gu_val,,addr,retval); break; \
  200. case 8: __get_user_asm_ret(__gu_val,d,addr,retval); break; \
  201. default: if (__get_user_bad()) return retval; \
  202. } x = (type) __gu_val; } else return retval; })
  203. #define __get_user_nocheck(x,addr,size,type) ({ \
  204. register int __gu_ret; \
  205. register unsigned long __gu_val; \
  206. switch (size) { \
  207. case 1: __get_user_asm(__gu_val,ub,addr,__gu_ret); break; \
  208. case 2: __get_user_asm(__gu_val,uh,addr,__gu_ret); break; \
  209. case 4: __get_user_asm(__gu_val,,addr,__gu_ret); break; \
  210. case 8: __get_user_asm(__gu_val,d,addr,__gu_ret); break; \
  211. default: __gu_val = 0; __gu_ret = __get_user_bad(); break; \
  212. } x = (type) __gu_val; __gu_ret; })
  213. #define __get_user_nocheck_ret(x,addr,size,type,retval) ({ \
  214. register unsigned long __gu_val __asm__ ("l1"); \
  215. switch (size) { \
  216. case 1: __get_user_asm_ret(__gu_val,ub,addr,retval); break; \
  217. case 2: __get_user_asm_ret(__gu_val,uh,addr,retval); break; \
  218. case 4: __get_user_asm_ret(__gu_val,,addr,retval); break; \
  219. case 8: __get_user_asm_ret(__gu_val,d,addr,retval); break; \
  220. default: if (__get_user_bad()) return retval; \
  221. } x = (type) __gu_val; })
  222. #define __get_user_asm(x,size,addr,ret) \
  223. __asm__ __volatile__( \
  224. "/* Get user asm, inline. */\n" \
  225. "1:\t" "ld"#size " %2, %1\n\t" \
  226. "clr %0\n" \
  227. "2:\n\n\t" \
  228. ".section .fixup,#alloc,#execinstr\n\t" \
  229. ".align 4\n" \
  230. "3:\n\t" \
  231. "clr %1\n\t" \
  232. "b 2b\n\t" \
  233. " mov %3, %0\n\n\t" \
  234. ".previous\n\t" \
  235. ".section __ex_table,#alloc\n\t" \
  236. ".align 4\n\t" \
  237. ".word 1b, 3b\n\n\t" \
  238. ".previous\n\t" \
  239. : "=&r" (ret), "=&r" (x) : "m" (*__m(addr)), \
  240. "i" (-EFAULT))
  241. #define __get_user_asm_ret(x,size,addr,retval) \
  242. if (__builtin_constant_p(retval) && retval == -EFAULT) \
  243. __asm__ __volatile__( \
  244. "/* Get user asm ret, inline. */\n" \
  245. "1:\t" "ld"#size " %1, %0\n\n\t" \
  246. ".section __ex_table,#alloc\n\t" \
  247. ".align 4\n\t" \
  248. ".word 1b,__ret_efault\n\n\t" \
  249. ".previous\n\t" \
  250. : "=&r" (x) : "m" (*__m(addr))); \
  251. else \
  252. __asm__ __volatile__( \
  253. "/* Get user asm ret, inline. */\n" \
  254. "1:\t" "ld"#size " %1, %0\n\n\t" \
  255. ".section .fixup,#alloc,#execinstr\n\t" \
  256. ".align 4\n" \
  257. "3:\n\t" \
  258. "ret\n\t" \
  259. " restore %%g0, %2, %%o0\n\n\t" \
  260. ".previous\n\t" \
  261. ".section __ex_table,#alloc\n\t" \
  262. ".align 4\n\t" \
  263. ".word 1b, 3b\n\n\t" \
  264. ".previous\n\t" \
  265. : "=&r" (x) : "m" (*__m(addr)), "i" (retval))
  266. extern int __get_user_bad(void);
  267. extern unsigned long __copy_user(void __user *to, const void __user *from, unsigned long size);
  268. static inline unsigned long copy_to_user(void __user *to, const void *from, unsigned long n)
  269. {
  270. if (n && __access_ok((unsigned long) to, n))
  271. return __copy_user(to, (__force void __user *) from, n);
  272. else
  273. return n;
  274. }
  275. static inline unsigned long __copy_to_user(void __user *to, const void *from, unsigned long n)
  276. {
  277. return __copy_user(to, (__force void __user *) from, n);
  278. }
  279. static inline unsigned long copy_from_user(void *to, const void __user *from, unsigned long n)
  280. {
  281. if (n && __access_ok((unsigned long) from, n))
  282. return __copy_user((__force void __user *) to, from, n);
  283. else
  284. return n;
  285. }
  286. static inline unsigned long __copy_from_user(void *to, const void __user *from, unsigned long n)
  287. {
  288. return __copy_user((__force void __user *) to, from, n);
  289. }
  290. #define __copy_to_user_inatomic __copy_to_user
  291. #define __copy_from_user_inatomic __copy_from_user
  292. static inline unsigned long __clear_user(void __user *addr, unsigned long size)
  293. {
  294. unsigned long ret;
  295. __asm__ __volatile__ (
  296. ".section __ex_table,#alloc\n\t"
  297. ".align 4\n\t"
  298. ".word 1f,3\n\t"
  299. ".previous\n\t"
  300. "mov %2, %%o1\n"
  301. "1:\n\t"
  302. "call __bzero\n\t"
  303. " mov %1, %%o0\n\t"
  304. "mov %%o0, %0\n"
  305. : "=r" (ret) : "r" (addr), "r" (size) :
  306. "o0", "o1", "o2", "o3", "o4", "o5", "o7",
  307. "g1", "g2", "g3", "g4", "g5", "g7", "cc");
  308. return ret;
  309. }
  310. static inline unsigned long clear_user(void __user *addr, unsigned long n)
  311. {
  312. if (n && __access_ok((unsigned long) addr, n))
  313. return __clear_user(addr, n);
  314. else
  315. return n;
  316. }
  317. extern long __strncpy_from_user(char *dest, const char __user *src, long count);
  318. static inline long strncpy_from_user(char *dest, const char __user *src, long count)
  319. {
  320. if (__access_ok((unsigned long) src, count))
  321. return __strncpy_from_user(dest, src, count);
  322. else
  323. return -EFAULT;
  324. }
  325. extern long __strlen_user(const char __user *);
  326. extern long __strnlen_user(const char __user *, long len);
  327. static inline long strlen_user(const char __user *str)
  328. {
  329. if (!access_ok(VERIFY_READ, str, 0))
  330. return 0;
  331. else
  332. return __strlen_user(str);
  333. }
  334. static inline long strnlen_user(const char __user *str, long len)
  335. {
  336. if (!access_ok(VERIFY_READ, str, 0))
  337. return 0;
  338. else
  339. return __strnlen_user(str, len);
  340. }
  341. #endif /* __ASSEMBLY__ */
  342. #endif /* _ASM_UACCESS_H */