uaccess.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431
  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 - 1) > (memory_start + memory_size - 1)));
  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. static inline int access_ok(int type, const void __user *addr,
  77. unsigned long size)
  78. {
  79. if (!size)
  80. goto ok;
  81. if ((get_fs().seg < ((unsigned long)addr)) ||
  82. (get_fs().seg < ((unsigned long)addr + size - 1))) {
  83. pr_devel("ACCESS fail: %s at 0x%08x (size 0x%x), seg 0x%08x\n",
  84. type ? "WRITE" : "READ ", (__force u32)addr, (u32)size,
  85. (u32)get_fs().seg);
  86. return 0;
  87. }
  88. ok:
  89. pr_devel("ACCESS OK: %s at 0x%08x (size 0x%x), seg 0x%08x\n",
  90. type ? "WRITE" : "READ ", (__force u32)addr, (u32)size,
  91. (u32)get_fs().seg);
  92. return 1;
  93. }
  94. #endif
  95. #ifdef CONFIG_MMU
  96. # define __FIXUP_SECTION ".section .fixup,\"ax\"\n"
  97. # define __EX_TABLE_SECTION ".section __ex_table,\"a\"\n"
  98. #else
  99. # define __FIXUP_SECTION ".section .discard,\"ax\"\n"
  100. # define __EX_TABLE_SECTION ".section .discard,\"ax\"\n"
  101. #endif
  102. extern unsigned long __copy_tofrom_user(void __user *to,
  103. const void __user *from, unsigned long size);
  104. /* Return: number of not copied bytes, i.e. 0 if OK or non-zero if fail. */
  105. static inline unsigned long __must_check __clear_user(void __user *to,
  106. unsigned long n)
  107. {
  108. /* normal memset with two words to __ex_table */
  109. __asm__ __volatile__ ( \
  110. "1: sb r0, %1, r0;" \
  111. " addik %0, %0, -1;" \
  112. " bneid %0, 1b;" \
  113. " addik %1, %1, 1;" \
  114. "2: " \
  115. __EX_TABLE_SECTION \
  116. ".word 1b,2b;" \
  117. ".previous;" \
  118. : "=r"(n), "=r"(to) \
  119. : "0"(n), "1"(to)
  120. );
  121. return n;
  122. }
  123. static inline unsigned long __must_check clear_user(void __user *to,
  124. unsigned long n)
  125. {
  126. might_fault();
  127. if (unlikely(!access_ok(VERIFY_WRITE, to, n)))
  128. return n;
  129. return __clear_user(to, n);
  130. }
  131. /* put_user and get_user macros */
  132. extern long __user_bad(void);
  133. #define __get_user_asm(insn, __gu_ptr, __gu_val, __gu_err) \
  134. ({ \
  135. __asm__ __volatile__ ( \
  136. "1:" insn " %1, %2, r0;" \
  137. " addk %0, r0, r0;" \
  138. "2: " \
  139. __FIXUP_SECTION \
  140. "3: brid 2b;" \
  141. " addik %0, r0, %3;" \
  142. ".previous;" \
  143. __EX_TABLE_SECTION \
  144. ".word 1b,3b;" \
  145. ".previous;" \
  146. : "=&r"(__gu_err), "=r"(__gu_val) \
  147. : "r"(__gu_ptr), "i"(-EFAULT) \
  148. ); \
  149. })
  150. /**
  151. * get_user: - Get a simple variable from user space.
  152. * @x: Variable to store result.
  153. * @ptr: Source address, in user space.
  154. *
  155. * Context: User context only. This function may sleep if pagefaults are
  156. * enabled.
  157. *
  158. * This macro copies a single simple variable from user space to kernel
  159. * space. It supports simple types like char and int, but not larger
  160. * data types like structures or arrays.
  161. *
  162. * @ptr must have pointer-to-simple-variable type, and the result of
  163. * dereferencing @ptr must be assignable to @x without a cast.
  164. *
  165. * Returns zero on success, or -EFAULT on error.
  166. * On error, the variable @x is set to zero.
  167. */
  168. #define get_user(x, ptr) \
  169. __get_user_check((x), (ptr), sizeof(*(ptr)))
  170. #define __get_user_check(x, ptr, size) \
  171. ({ \
  172. unsigned long __gu_val = 0; \
  173. const typeof(*(ptr)) __user *__gu_addr = (ptr); \
  174. int __gu_err = 0; \
  175. \
  176. if (access_ok(VERIFY_READ, __gu_addr, size)) { \
  177. switch (size) { \
  178. case 1: \
  179. __get_user_asm("lbu", __gu_addr, __gu_val, \
  180. __gu_err); \
  181. break; \
  182. case 2: \
  183. __get_user_asm("lhu", __gu_addr, __gu_val, \
  184. __gu_err); \
  185. break; \
  186. case 4: \
  187. __get_user_asm("lw", __gu_addr, __gu_val, \
  188. __gu_err); \
  189. break; \
  190. default: \
  191. __gu_err = __user_bad(); \
  192. break; \
  193. } \
  194. } else { \
  195. __gu_err = -EFAULT; \
  196. } \
  197. x = (__force typeof(*(ptr)))__gu_val; \
  198. __gu_err; \
  199. })
  200. #define __get_user(x, ptr) \
  201. ({ \
  202. unsigned long __gu_val = 0; \
  203. /*unsigned long __gu_ptr = (unsigned long)(ptr);*/ \
  204. long __gu_err; \
  205. switch (sizeof(*(ptr))) { \
  206. case 1: \
  207. __get_user_asm("lbu", (ptr), __gu_val, __gu_err); \
  208. break; \
  209. case 2: \
  210. __get_user_asm("lhu", (ptr), __gu_val, __gu_err); \
  211. break; \
  212. case 4: \
  213. __get_user_asm("lw", (ptr), __gu_val, __gu_err); \
  214. break; \
  215. default: \
  216. /* __gu_val = 0; __gu_err = -EINVAL;*/ __gu_err = __user_bad();\
  217. } \
  218. x = (__force __typeof__(*(ptr))) __gu_val; \
  219. __gu_err; \
  220. })
  221. #define __put_user_asm(insn, __gu_ptr, __gu_val, __gu_err) \
  222. ({ \
  223. __asm__ __volatile__ ( \
  224. "1:" insn " %1, %2, r0;" \
  225. " addk %0, r0, r0;" \
  226. "2: " \
  227. __FIXUP_SECTION \
  228. "3: brid 2b;" \
  229. " addik %0, r0, %3;" \
  230. ".previous;" \
  231. __EX_TABLE_SECTION \
  232. ".word 1b,3b;" \
  233. ".previous;" \
  234. : "=&r"(__gu_err) \
  235. : "r"(__gu_val), "r"(__gu_ptr), "i"(-EFAULT) \
  236. ); \
  237. })
  238. #define __put_user_asm_8(__gu_ptr, __gu_val, __gu_err) \
  239. ({ \
  240. __asm__ __volatile__ (" lwi %0, %1, 0;" \
  241. "1: swi %0, %2, 0;" \
  242. " lwi %0, %1, 4;" \
  243. "2: swi %0, %2, 4;" \
  244. " addk %0, r0, r0;" \
  245. "3: " \
  246. __FIXUP_SECTION \
  247. "4: brid 3b;" \
  248. " addik %0, r0, %3;" \
  249. ".previous;" \
  250. __EX_TABLE_SECTION \
  251. ".word 1b,4b,2b,4b;" \
  252. ".previous;" \
  253. : "=&r"(__gu_err) \
  254. : "r"(&__gu_val), "r"(__gu_ptr), "i"(-EFAULT) \
  255. ); \
  256. })
  257. /**
  258. * put_user: - Write a simple value into user space.
  259. * @x: Value to copy to user space.
  260. * @ptr: Destination address, in user space.
  261. *
  262. * Context: User context only. This function may sleep if pagefaults are
  263. * enabled.
  264. *
  265. * This macro copies a single simple value from kernel space to user
  266. * space. It supports simple types like char and int, but not larger
  267. * data types like structures or arrays.
  268. *
  269. * @ptr must have pointer-to-simple-variable type, and @x must be assignable
  270. * to the result of dereferencing @ptr.
  271. *
  272. * Returns zero on success, or -EFAULT on error.
  273. */
  274. #define put_user(x, ptr) \
  275. __put_user_check((x), (ptr), sizeof(*(ptr)))
  276. #define __put_user_check(x, ptr, size) \
  277. ({ \
  278. typeof(*(ptr)) volatile __pu_val = x; \
  279. typeof(*(ptr)) __user *__pu_addr = (ptr); \
  280. int __pu_err = 0; \
  281. \
  282. if (access_ok(VERIFY_WRITE, __pu_addr, size)) { \
  283. switch (size) { \
  284. case 1: \
  285. __put_user_asm("sb", __pu_addr, __pu_val, \
  286. __pu_err); \
  287. break; \
  288. case 2: \
  289. __put_user_asm("sh", __pu_addr, __pu_val, \
  290. __pu_err); \
  291. break; \
  292. case 4: \
  293. __put_user_asm("sw", __pu_addr, __pu_val, \
  294. __pu_err); \
  295. break; \
  296. case 8: \
  297. __put_user_asm_8(__pu_addr, __pu_val, __pu_err);\
  298. break; \
  299. default: \
  300. __pu_err = __user_bad(); \
  301. break; \
  302. } \
  303. } else { \
  304. __pu_err = -EFAULT; \
  305. } \
  306. __pu_err; \
  307. })
  308. #define __put_user(x, ptr) \
  309. ({ \
  310. __typeof__(*(ptr)) volatile __gu_val = (x); \
  311. long __gu_err = 0; \
  312. switch (sizeof(__gu_val)) { \
  313. case 1: \
  314. __put_user_asm("sb", (ptr), __gu_val, __gu_err); \
  315. break; \
  316. case 2: \
  317. __put_user_asm("sh", (ptr), __gu_val, __gu_err); \
  318. break; \
  319. case 4: \
  320. __put_user_asm("sw", (ptr), __gu_val, __gu_err); \
  321. break; \
  322. case 8: \
  323. __put_user_asm_8((ptr), __gu_val, __gu_err); \
  324. break; \
  325. default: \
  326. /*__gu_err = -EINVAL;*/ __gu_err = __user_bad(); \
  327. } \
  328. __gu_err; \
  329. })
  330. /* copy_to_from_user */
  331. #define __copy_from_user(to, from, n) \
  332. __copy_tofrom_user((__force void __user *)(to), \
  333. (void __user *)(from), (n))
  334. #define __copy_from_user_inatomic(to, from, n) \
  335. __copy_from_user((to), (from), (n))
  336. static inline long copy_from_user(void *to,
  337. const void __user *from, unsigned long n)
  338. {
  339. unsigned long res = n;
  340. might_fault();
  341. if (likely(access_ok(VERIFY_READ, from, n)))
  342. res = __copy_from_user(to, from, n);
  343. if (unlikely(res))
  344. memset(to + (n - res), 0, res);
  345. return res;
  346. }
  347. #define __copy_to_user(to, from, n) \
  348. __copy_tofrom_user((void __user *)(to), \
  349. (__force const void __user *)(from), (n))
  350. #define __copy_to_user_inatomic(to, from, n) __copy_to_user((to), (from), (n))
  351. static inline long copy_to_user(void __user *to,
  352. const void *from, unsigned long n)
  353. {
  354. might_fault();
  355. if (access_ok(VERIFY_WRITE, to, n))
  356. return __copy_to_user(to, from, n);
  357. return n;
  358. }
  359. /*
  360. * Copy a null terminated string from userspace.
  361. */
  362. extern int __strncpy_user(char *to, const char __user *from, int len);
  363. #define __strncpy_from_user __strncpy_user
  364. static inline long
  365. strncpy_from_user(char *dst, const char __user *src, long count)
  366. {
  367. if (!access_ok(VERIFY_READ, src, 1))
  368. return -EFAULT;
  369. return __strncpy_from_user(dst, src, count);
  370. }
  371. /*
  372. * Return the size of a string (including the ending 0)
  373. *
  374. * Return 0 on exception, a value greater than N if too long
  375. */
  376. extern int __strnlen_user(const char __user *sstr, int len);
  377. static inline long strnlen_user(const char __user *src, long n)
  378. {
  379. if (!access_ok(VERIFY_READ, src, 1))
  380. return 0;
  381. return __strnlen_user(src, n);
  382. }
  383. #endif /* __ASSEMBLY__ */
  384. #endif /* __KERNEL__ */
  385. #endif /* _ASM_MICROBLAZE_UACCESS_H */