uaccess.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419
  1. /*
  2. * Copyright (C) 2008-2009 Michal Simek <monstr@monstr.eu>
  3. * Copyright (C) 2008-2009 PetaLogix
  4. * Copyright (C) 2006 Atmark Techno, Inc.
  5. *
  6. * This file is subject to the terms and conditions of the GNU General Public
  7. * License. See the file "COPYING" in the main directory of this archive
  8. * for more details.
  9. */
  10. #ifndef _ASM_MICROBLAZE_UACCESS_H
  11. #define _ASM_MICROBLAZE_UACCESS_H
  12. #ifdef __KERNEL__
  13. #ifndef __ASSEMBLY__
  14. #include <linux/kernel.h>
  15. #include <linux/errno.h>
  16. #include <linux/sched.h> /* RLIMIT_FSIZE */
  17. #include <linux/mm.h>
  18. #include <asm/mmu.h>
  19. #include <asm/page.h>
  20. #include <asm/pgtable.h>
  21. #include <linux/string.h>
  22. #define VERIFY_READ 0
  23. #define VERIFY_WRITE 1
  24. /*
  25. * On Microblaze the fs value is actually the top of the corresponding
  26. * address space.
  27. *
  28. * The fs value determines whether argument validity checking should be
  29. * performed or not. If get_fs() == USER_DS, checking is performed, with
  30. * get_fs() == KERNEL_DS, checking is bypassed.
  31. *
  32. * For historical reasons, these macros are grossly misnamed.
  33. *
  34. * For non-MMU arch like Microblaze, KERNEL_DS and USER_DS is equal.
  35. */
  36. # define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
  37. # ifndef CONFIG_MMU
  38. # define KERNEL_DS MAKE_MM_SEG(0)
  39. # define USER_DS KERNEL_DS
  40. # else
  41. # define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFF)
  42. # define USER_DS MAKE_MM_SEG(TASK_SIZE - 1)
  43. # endif
  44. # define get_ds() (KERNEL_DS)
  45. # define get_fs() (current_thread_info()->addr_limit)
  46. # define set_fs(val) (current_thread_info()->addr_limit = (val))
  47. # define segment_eq(a, b) ((a).seg == (b).seg)
  48. /*
  49. * The exception table consists of pairs of addresses: the first is the
  50. * address of an instruction that is allowed to fault, and the second is
  51. * the address at which the program should continue. No registers are
  52. * modified, so it is entirely up to the continuation code to figure out
  53. * what to do.
  54. *
  55. * All the routines below use bits of fixup code that are out of line
  56. * with the main instruction path. This means when everything is well,
  57. * we don't even have to jump over them. Further, they do not intrude
  58. * on our cache or tlb entries.
  59. */
  60. struct exception_table_entry {
  61. unsigned long insn, fixup;
  62. };
  63. /* Returns 0 if exception not found and fixup otherwise. */
  64. extern unsigned long search_exception_table(unsigned long);
  65. #ifndef CONFIG_MMU
  66. /* Check against bounds of physical memory */
  67. static inline int ___range_ok(unsigned long addr, unsigned long size)
  68. {
  69. return ((addr < memory_start) ||
  70. ((addr + size) > memory_end));
  71. }
  72. #define __range_ok(addr, size) \
  73. ___range_ok((unsigned long)(addr), (unsigned long)(size))
  74. #define access_ok(type, addr, size) (__range_ok((addr), (size)) == 0)
  75. #else
  76. /*
  77. * Address is valid if:
  78. * - "addr", "addr + size" and "size" are all below the limit
  79. */
  80. #define access_ok(type, addr, size) \
  81. (get_fs().seg > (((unsigned long)(addr)) | \
  82. (size) | ((unsigned long)(addr) + (size))))
  83. /* || printk("access_ok failed for %s at 0x%08lx (size %d), seg 0x%08x\n",
  84. type?"WRITE":"READ",addr,size,get_fs().seg)) */
  85. #endif
  86. #ifdef CONFIG_MMU
  87. # define __FIXUP_SECTION ".section .fixup,\"ax\"\n"
  88. # define __EX_TABLE_SECTION ".section __ex_table,\"a\"\n"
  89. #else
  90. # define __FIXUP_SECTION ".section .discard,\"ax\"\n"
  91. # define __EX_TABLE_SECTION ".section .discard,\"a\"\n"
  92. #endif
  93. extern unsigned long __copy_tofrom_user(void __user *to,
  94. const void __user *from, unsigned long size);
  95. /* Return: number of not copied bytes, i.e. 0 if OK or non-zero if fail. */
  96. static inline unsigned long __must_check __clear_user(void __user *to,
  97. unsigned long n)
  98. {
  99. /* normal memset with two words to __ex_table */
  100. __asm__ __volatile__ ( \
  101. "1: sb r0, %1, r0;" \
  102. " addik %0, %0, -1;" \
  103. " bneid %0, 1b;" \
  104. " addik %1, %1, 1;" \
  105. "2: " \
  106. __EX_TABLE_SECTION \
  107. ".word 1b,2b;" \
  108. ".previous;" \
  109. : "=r"(n), "=r"(to) \
  110. : "0"(n), "1"(to)
  111. );
  112. return n;
  113. }
  114. static inline unsigned long __must_check clear_user(void __user *to,
  115. unsigned long n)
  116. {
  117. might_sleep();
  118. if (unlikely(!access_ok(VERIFY_WRITE, to, n)))
  119. return n;
  120. return __clear_user(to, n);
  121. }
  122. /* put_user and get_user macros */
  123. extern long __user_bad(void);
  124. #define __get_user_asm(insn, __gu_ptr, __gu_val, __gu_err) \
  125. ({ \
  126. __asm__ __volatile__ ( \
  127. "1:" insn " %1, %2, r0;" \
  128. " addk %0, r0, r0;" \
  129. "2: " \
  130. __FIXUP_SECTION \
  131. "3: brid 2b;" \
  132. " addik %0, r0, %3;" \
  133. ".previous;" \
  134. __EX_TABLE_SECTION \
  135. ".word 1b,3b;" \
  136. ".previous;" \
  137. : "=&r"(__gu_err), "=r"(__gu_val) \
  138. : "r"(__gu_ptr), "i"(-EFAULT) \
  139. ); \
  140. })
  141. /**
  142. * get_user: - Get a simple variable from user space.
  143. * @x: Variable to store result.
  144. * @ptr: Source address, in user space.
  145. *
  146. * Context: User context only. This function may sleep.
  147. *
  148. * This macro copies a single simple variable from user space to kernel
  149. * space. It supports simple types like char and int, but not larger
  150. * data types like structures or arrays.
  151. *
  152. * @ptr must have pointer-to-simple-variable type, and the result of
  153. * dereferencing @ptr must be assignable to @x without a cast.
  154. *
  155. * Returns zero on success, or -EFAULT on error.
  156. * On error, the variable @x is set to zero.
  157. */
  158. #define get_user(x, ptr) \
  159. __get_user_check((x), (ptr), sizeof(*(ptr)))
  160. #define __get_user_check(x, ptr, size) \
  161. ({ \
  162. unsigned long __gu_val = 0; \
  163. const typeof(*(ptr)) __user *__gu_addr = (ptr); \
  164. int __gu_err = 0; \
  165. \
  166. if (access_ok(VERIFY_READ, __gu_addr, size)) { \
  167. switch (size) { \
  168. case 1: \
  169. __get_user_asm("lbu", __gu_addr, __gu_val, \
  170. __gu_err); \
  171. break; \
  172. case 2: \
  173. __get_user_asm("lhu", __gu_addr, __gu_val, \
  174. __gu_err); \
  175. break; \
  176. case 4: \
  177. __get_user_asm("lw", __gu_addr, __gu_val, \
  178. __gu_err); \
  179. break; \
  180. default: \
  181. __gu_err = __user_bad(); \
  182. break; \
  183. } \
  184. } else { \
  185. __gu_err = -EFAULT; \
  186. } \
  187. x = (typeof(*(ptr)))__gu_val; \
  188. __gu_err; \
  189. })
  190. #define __get_user(x, ptr) \
  191. ({ \
  192. unsigned long __gu_val; \
  193. /*unsigned long __gu_ptr = (unsigned long)(ptr);*/ \
  194. long __gu_err; \
  195. switch (sizeof(*(ptr))) { \
  196. case 1: \
  197. __get_user_asm("lbu", (ptr), __gu_val, __gu_err); \
  198. break; \
  199. case 2: \
  200. __get_user_asm("lhu", (ptr), __gu_val, __gu_err); \
  201. break; \
  202. case 4: \
  203. __get_user_asm("lw", (ptr), __gu_val, __gu_err); \
  204. break; \
  205. default: \
  206. /* __gu_val = 0; __gu_err = -EINVAL;*/ __gu_err = __user_bad();\
  207. } \
  208. x = (__typeof__(*(ptr))) __gu_val; \
  209. __gu_err; \
  210. })
  211. #define __put_user_asm(insn, __gu_ptr, __gu_val, __gu_err) \
  212. ({ \
  213. __asm__ __volatile__ ( \
  214. "1:" insn " %1, %2, r0;" \
  215. " addk %0, r0, r0;" \
  216. "2: " \
  217. __FIXUP_SECTION \
  218. "3: brid 2b;" \
  219. " addik %0, r0, %3;" \
  220. ".previous;" \
  221. __EX_TABLE_SECTION \
  222. ".word 1b,3b;" \
  223. ".previous;" \
  224. : "=&r"(__gu_err) \
  225. : "r"(__gu_val), "r"(__gu_ptr), "i"(-EFAULT) \
  226. ); \
  227. })
  228. #define __put_user_asm_8(__gu_ptr, __gu_val, __gu_err) \
  229. ({ \
  230. __asm__ __volatile__ (" lwi %0, %1, 0;" \
  231. "1: swi %0, %2, 0;" \
  232. " lwi %0, %1, 4;" \
  233. "2: swi %0, %2, 4;" \
  234. " addk %0, r0, r0;" \
  235. "3: " \
  236. __FIXUP_SECTION \
  237. "4: brid 3b;" \
  238. " addik %0, r0, %3;" \
  239. ".previous;" \
  240. __EX_TABLE_SECTION \
  241. ".word 1b,4b,2b,4b;" \
  242. ".previous;" \
  243. : "=&r"(__gu_err) \
  244. : "r"(&__gu_val), "r"(__gu_ptr), "i"(-EFAULT) \
  245. ); \
  246. })
  247. /**
  248. * put_user: - Write a simple value into user space.
  249. * @x: Value to copy to user space.
  250. * @ptr: Destination address, in user space.
  251. *
  252. * Context: User context only. This function may sleep.
  253. *
  254. * This macro copies a single simple value from kernel space to user
  255. * space. It supports simple types like char and int, but not larger
  256. * data types like structures or arrays.
  257. *
  258. * @ptr must have pointer-to-simple-variable type, and @x must be assignable
  259. * to the result of dereferencing @ptr.
  260. *
  261. * Returns zero on success, or -EFAULT on error.
  262. */
  263. #define put_user(x, ptr) \
  264. __put_user_check((x), (ptr), sizeof(*(ptr)))
  265. #define __put_user_check(x, ptr, size) \
  266. ({ \
  267. typeof(*(ptr)) __pu_val; \
  268. typeof(*(ptr)) __user *__pu_addr = (ptr); \
  269. int __pu_err = 0; \
  270. \
  271. __pu_val = (x); \
  272. if (access_ok(VERIFY_WRITE, __pu_addr, size)) { \
  273. switch (size) { \
  274. case 1: \
  275. __put_user_asm("sb", __pu_addr, __pu_val, \
  276. __pu_err); \
  277. break; \
  278. case 2: \
  279. __put_user_asm("sh", __pu_addr, __pu_val, \
  280. __pu_err); \
  281. break; \
  282. case 4: \
  283. __put_user_asm("sw", __pu_addr, __pu_val, \
  284. __pu_err); \
  285. break; \
  286. case 8: \
  287. __put_user_asm_8(__pu_addr, __pu_val, __pu_err);\
  288. break; \
  289. default: \
  290. __pu_err = __user_bad(); \
  291. break; \
  292. } \
  293. } else { \
  294. __pu_err = -EFAULT; \
  295. } \
  296. __pu_err; \
  297. })
  298. #define __put_user(x, ptr) \
  299. ({ \
  300. __typeof__(*(ptr)) volatile __gu_val = (x); \
  301. long __gu_err = 0; \
  302. switch (sizeof(__gu_val)) { \
  303. case 1: \
  304. __put_user_asm("sb", (ptr), __gu_val, __gu_err); \
  305. break; \
  306. case 2: \
  307. __put_user_asm("sh", (ptr), __gu_val, __gu_err); \
  308. break; \
  309. case 4: \
  310. __put_user_asm("sw", (ptr), __gu_val, __gu_err); \
  311. break; \
  312. case 8: \
  313. __put_user_asm_8((ptr), __gu_val, __gu_err); \
  314. break; \
  315. default: \
  316. /*__gu_err = -EINVAL;*/ __gu_err = __user_bad(); \
  317. } \
  318. __gu_err; \
  319. })
  320. /* copy_to_from_user */
  321. #define __copy_from_user(to, from, n) \
  322. __copy_tofrom_user((__force void __user *)(to), \
  323. (void __user *)(from), (n))
  324. #define __copy_from_user_inatomic(to, from, n) \
  325. __copy_from_user((to), (from), (n))
  326. static inline long copy_from_user(void *to,
  327. const void __user *from, unsigned long n)
  328. {
  329. might_sleep();
  330. if (access_ok(VERIFY_READ, from, n))
  331. return __copy_from_user(to, from, n);
  332. return n;
  333. }
  334. #define __copy_to_user(to, from, n) \
  335. __copy_tofrom_user((void __user *)(to), \
  336. (__force const void __user *)(from), (n))
  337. #define __copy_to_user_inatomic(to, from, n) __copy_to_user((to), (from), (n))
  338. static inline long copy_to_user(void __user *to,
  339. const void *from, unsigned long n)
  340. {
  341. might_sleep();
  342. if (access_ok(VERIFY_WRITE, to, n))
  343. return __copy_to_user(to, from, n);
  344. return n;
  345. }
  346. /*
  347. * Copy a null terminated string from userspace.
  348. */
  349. extern int __strncpy_user(char *to, const char __user *from, int len);
  350. #define __strncpy_from_user __strncpy_user
  351. static inline long
  352. strncpy_from_user(char *dst, const char __user *src, long count)
  353. {
  354. if (!access_ok(VERIFY_READ, src, 1))
  355. return -EFAULT;
  356. return __strncpy_from_user(dst, src, count);
  357. }
  358. /*
  359. * Return the size of a string (including the ending 0)
  360. *
  361. * Return 0 on exception, a value greater than N if too long
  362. */
  363. extern int __strnlen_user(const char __user *sstr, int len);
  364. static inline long strnlen_user(const char __user *src, long n)
  365. {
  366. if (!access_ok(VERIFY_READ, src, 1))
  367. return 0;
  368. return __strnlen_user(src, n);
  369. }
  370. #endif /* __ASSEMBLY__ */
  371. #endif /* __KERNEL__ */
  372. #endif /* _ASM_MICROBLAZE_UACCESS_H */