uaccess.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594
  1. /* $Id: uaccess.h,v 1.11 2003/10/13 07:21:20 lethal Exp $
  2. *
  3. * User space memory access functions
  4. *
  5. * Copyright (C) 1999, 2002 Niibe Yutaka
  6. * Copyright (C) 2003 Paul Mundt
  7. *
  8. * Based on:
  9. * MIPS implementation version 1.15 by
  10. * Copyright (C) 1996, 1997, 1998 by Ralf Baechle
  11. * and i386 version.
  12. */
  13. #ifndef __ASM_SH_UACCESS_H
  14. #define __ASM_SH_UACCESS_H
  15. #include <linux/errno.h>
  16. #include <linux/sched.h>
  17. /*
  18. * NOTE: Macro/functions in this file depends on threads_info.h implementation.
  19. * Assumes:
  20. * TI_FLAGS == 8
  21. * TIF_USERSPACE == 31
  22. * USER_ADDR_LIMIT == 0x80000000
  23. */
  24. #define VERIFY_READ 0
  25. #define VERIFY_WRITE 1
  26. typedef struct {
  27. unsigned int is_user_space;
  28. } mm_segment_t;
  29. /*
  30. * The fs value determines whether argument validity checking should be
  31. * performed or not. If get_fs() == USER_DS, checking is performed, with
  32. * get_fs() == KERNEL_DS, checking is bypassed.
  33. *
  34. * For historical reasons (Data Segment Register?), these macros are misnamed.
  35. */
  36. #define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
  37. #define segment_eq(a,b) ((a).is_user_space == (b).is_user_space)
  38. #define USER_ADDR_LIMIT 0x80000000
  39. #define KERNEL_DS MAKE_MM_SEG(0)
  40. #define USER_DS MAKE_MM_SEG(1)
  41. #define get_ds() (KERNEL_DS)
  42. #if !defined(CONFIG_MMU)
  43. static inline mm_segment_t get_fs(void)
  44. {
  45. return USER_DS;
  46. }
  47. static inline void set_fs(mm_segment_t s)
  48. {
  49. }
  50. /*
  51. * __access_ok: Check if address with size is OK or not.
  52. *
  53. * If we don't have an MMU (or if its disabled) the only thing we really have
  54. * to look out for is if the address resides somewhere outside of what
  55. * available RAM we have.
  56. *
  57. * TODO: This check could probably also stand to be restricted somewhat more..
  58. * though it still does the Right Thing(tm) for the time being.
  59. */
  60. static inline int __access_ok(unsigned long addr, unsigned long size)
  61. {
  62. extern unsigned long memory_start, memory_end;
  63. return ((addr >= memory_start) && ((addr + size) < memory_end));
  64. }
  65. #else /* CONFIG_MMU */
  66. static inline mm_segment_t get_fs(void)
  67. {
  68. return MAKE_MM_SEG(test_thread_flag(TIF_USERSPACE));
  69. }
  70. static inline void set_fs(mm_segment_t s)
  71. {
  72. unsigned long ti, flag;
  73. __asm__ __volatile__(
  74. "stc r7_bank, %0\n\t"
  75. "mov.l @(8,%0), %1\n\t"
  76. "shal %1\n\t"
  77. "cmp/pl %2\n\t"
  78. "rotcr %1\n\t"
  79. "mov.l %1, @(8,%0)"
  80. : "=&r" (ti), "=&r" (flag)
  81. : "r" (s.is_user_space)
  82. : "t");
  83. /****
  84. if (s.is_user_space)
  85. set_thread_flag(TIF_USERSPACE);
  86. else
  87. clear_thread_flag(TIF_USERSPACE);
  88. ****/
  89. }
  90. /*
  91. * __access_ok: Check if address with size is OK or not.
  92. *
  93. * We do three checks:
  94. * (1) is it user space?
  95. * (2) addr + size --> carry?
  96. * (3) addr + size >= 0x80000000 (USER_ADDR_LIMIT)
  97. *
  98. * (1) (2) (3) | RESULT
  99. * 0 0 0 | ok
  100. * 0 0 1 | ok
  101. * 0 1 0 | bad
  102. * 0 1 1 | bad
  103. * 1 0 0 | ok
  104. * 1 0 1 | bad
  105. * 1 1 0 | bad
  106. * 1 1 1 | bad
  107. */
  108. static inline int __access_ok(unsigned long addr, unsigned long size)
  109. {
  110. unsigned long flag, tmp;
  111. __asm__("stc r7_bank, %0\n\t"
  112. "mov.l @(8,%0), %0\n\t"
  113. "clrt\n\t"
  114. "addc %2, %1\n\t"
  115. "and %1, %0\n\t"
  116. "rotcl %0\n\t"
  117. "rotcl %0\n\t"
  118. "and #3, %0"
  119. : "=&z" (flag), "=r" (tmp)
  120. : "r" (addr), "1" (size)
  121. : "t");
  122. return flag == 0;
  123. }
  124. #endif /* CONFIG_MMU */
  125. static inline int access_ok(int type, const void __user *p, unsigned long size)
  126. {
  127. unsigned long addr = (unsigned long)p;
  128. return __access_ok(addr, size);
  129. }
  130. /*
  131. * Uh, these should become the main single-value transfer routines ...
  132. * They automatically use the right size if we just have the right
  133. * pointer type ...
  134. *
  135. * As SuperH uses the same address space for kernel and user data, we
  136. * can just do these as direct assignments.
  137. *
  138. * Careful to not
  139. * (a) re-use the arguments for side effects (sizeof is ok)
  140. * (b) require any knowledge of processes at this stage
  141. */
  142. #define put_user(x,ptr) __put_user_check((x),(ptr),sizeof(*(ptr)))
  143. #define get_user(x,ptr) __get_user_check((x),(ptr),sizeof(*(ptr)))
  144. /*
  145. * The "__xxx" versions do not do address space checking, useful when
  146. * doing multiple accesses to the same area (the user has to do the
  147. * checks by hand with "access_ok()")
  148. */
  149. #define __put_user(x,ptr) \
  150. __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
  151. #define __get_user(x,ptr) \
  152. __get_user_nocheck((x),(ptr),sizeof(*(ptr)))
  153. struct __large_struct { unsigned long buf[100]; };
  154. #define __m(x) (*(struct __large_struct *)(x))
  155. #define __get_user_size(x,ptr,size,retval) \
  156. do { \
  157. retval = 0; \
  158. switch (size) { \
  159. case 1: \
  160. __get_user_asm(x, ptr, retval, "b"); \
  161. break; \
  162. case 2: \
  163. __get_user_asm(x, ptr, retval, "w"); \
  164. break; \
  165. case 4: \
  166. __get_user_asm(x, ptr, retval, "l"); \
  167. break; \
  168. default: \
  169. __get_user_unknown(); \
  170. break; \
  171. } \
  172. } while (0)
  173. #define __get_user_nocheck(x,ptr,size) \
  174. ({ \
  175. long __gu_err, __gu_val; \
  176. __get_user_size(__gu_val, (ptr), (size), __gu_err); \
  177. (x) = (__typeof__(*(ptr)))__gu_val; \
  178. __gu_err; \
  179. })
  180. #define __get_user_check(x,ptr,size) \
  181. ({ \
  182. long __gu_err, __gu_val; \
  183. switch (size) { \
  184. case 1: \
  185. __get_user_1(__gu_val, (ptr), __gu_err); \
  186. break; \
  187. case 2: \
  188. __get_user_2(__gu_val, (ptr), __gu_err); \
  189. break; \
  190. case 4: \
  191. __get_user_4(__gu_val, (ptr), __gu_err); \
  192. break; \
  193. default: \
  194. __get_user_unknown(); \
  195. break; \
  196. } \
  197. \
  198. (x) = (__typeof__(*(ptr)))__gu_val; \
  199. __gu_err; \
  200. })
  201. #define __get_user_1(x,addr,err) ({ \
  202. __asm__("stc r7_bank, %1\n\t" \
  203. "mov.l @(8,%1), %1\n\t" \
  204. "and %2, %1\n\t" \
  205. "cmp/pz %1\n\t" \
  206. "bt/s 1f\n\t" \
  207. " mov #0, %0\n\t" \
  208. "0:\n" \
  209. "mov #-14, %0\n\t" \
  210. "bra 2f\n\t" \
  211. " mov #0, %1\n" \
  212. "1:\n\t" \
  213. "mov.b @%2, %1\n\t" \
  214. "extu.b %1, %1\n" \
  215. "2:\n" \
  216. ".section __ex_table,\"a\"\n\t" \
  217. ".long 1b, 0b\n\t" \
  218. ".previous" \
  219. : "=&r" (err), "=&r" (x) \
  220. : "r" (addr) \
  221. : "t"); \
  222. })
  223. #define __get_user_2(x,addr,err) ({ \
  224. __asm__("stc r7_bank, %1\n\t" \
  225. "mov.l @(8,%1), %1\n\t" \
  226. "and %2, %1\n\t" \
  227. "cmp/pz %1\n\t" \
  228. "bt/s 1f\n\t" \
  229. " mov #0, %0\n\t" \
  230. "0:\n" \
  231. "mov #-14, %0\n\t" \
  232. "bra 2f\n\t" \
  233. " mov #0, %1\n" \
  234. "1:\n\t" \
  235. "mov.w @%2, %1\n\t" \
  236. "extu.w %1, %1\n" \
  237. "2:\n" \
  238. ".section __ex_table,\"a\"\n\t" \
  239. ".long 1b, 0b\n\t" \
  240. ".previous" \
  241. : "=&r" (err), "=&r" (x) \
  242. : "r" (addr) \
  243. : "t"); \
  244. })
  245. #define __get_user_4(x,addr,err) ({ \
  246. __asm__("stc r7_bank, %1\n\t" \
  247. "mov.l @(8,%1), %1\n\t" \
  248. "and %2, %1\n\t" \
  249. "cmp/pz %1\n\t" \
  250. "bt/s 1f\n\t" \
  251. " mov #0, %0\n\t" \
  252. "0:\n" \
  253. "mov #-14, %0\n\t" \
  254. "bra 2f\n\t" \
  255. " mov #0, %1\n" \
  256. "1:\n\t" \
  257. "mov.l @%2, %1\n\t" \
  258. "2:\n" \
  259. ".section __ex_table,\"a\"\n\t" \
  260. ".long 1b, 0b\n\t" \
  261. ".previous" \
  262. : "=&r" (err), "=&r" (x) \
  263. : "r" (addr) \
  264. : "t"); \
  265. })
  266. #define __get_user_asm(x, addr, err, insn) \
  267. ({ \
  268. __asm__ __volatile__( \
  269. "1:\n\t" \
  270. "mov." insn " %2, %1\n\t" \
  271. "mov #0, %0\n" \
  272. "2:\n" \
  273. ".section .fixup,\"ax\"\n" \
  274. "3:\n\t" \
  275. "mov #0, %1\n\t" \
  276. "mov.l 4f, %0\n\t" \
  277. "jmp @%0\n\t" \
  278. " mov %3, %0\n" \
  279. "4: .long 2b\n\t" \
  280. ".previous\n" \
  281. ".section __ex_table,\"a\"\n\t" \
  282. ".long 1b, 3b\n\t" \
  283. ".previous" \
  284. :"=&r" (err), "=&r" (x) \
  285. :"m" (__m(addr)), "i" (-EFAULT)); })
  286. extern void __get_user_unknown(void);
  287. #define __put_user_size(x,ptr,size,retval) \
  288. do { \
  289. retval = 0; \
  290. switch (size) { \
  291. case 1: \
  292. __put_user_asm(x, ptr, retval, "b"); \
  293. break; \
  294. case 2: \
  295. __put_user_asm(x, ptr, retval, "w"); \
  296. break; \
  297. case 4: \
  298. __put_user_asm(x, ptr, retval, "l"); \
  299. break; \
  300. case 8: \
  301. __put_user_u64(x, ptr, retval); \
  302. break; \
  303. default: \
  304. __put_user_unknown(); \
  305. } \
  306. } while (0)
  307. #define __put_user_nocheck(x,ptr,size) \
  308. ({ \
  309. long __pu_err; \
  310. __put_user_size((x),(ptr),(size),__pu_err); \
  311. __pu_err; \
  312. })
  313. #define __put_user_check(x,ptr,size) \
  314. ({ \
  315. long __pu_err = -EFAULT; \
  316. __typeof__(*(ptr)) *__pu_addr = (ptr); \
  317. \
  318. if (__access_ok((unsigned long)__pu_addr,size)) \
  319. __put_user_size((x),__pu_addr,(size),__pu_err); \
  320. __pu_err; \
  321. })
  322. #define __put_user_asm(x, addr, err, insn) \
  323. ({ \
  324. __asm__ __volatile__( \
  325. "1:\n\t" \
  326. "mov." insn " %1, %2\n\t" \
  327. "mov #0, %0\n" \
  328. "2:\n" \
  329. ".section .fixup,\"ax\"\n" \
  330. "3:\n\t" \
  331. "nop\n\t" \
  332. "mov.l 4f, %0\n\t" \
  333. "jmp @%0\n\t" \
  334. "mov %3, %0\n" \
  335. "4: .long 2b\n\t" \
  336. ".previous\n" \
  337. ".section __ex_table,\"a\"\n\t" \
  338. ".long 1b, 3b\n\t" \
  339. ".previous" \
  340. :"=&r" (err) \
  341. :"r" (x), "m" (__m(addr)), "i" (-EFAULT) \
  342. :"memory"); })
  343. #if defined(__LITTLE_ENDIAN__)
  344. #define __put_user_u64(val,addr,retval) \
  345. ({ \
  346. __asm__ __volatile__( \
  347. "1:\n\t" \
  348. "mov.l %R1,%2\n\t" \
  349. "mov.l %S1,%T2\n\t" \
  350. "mov #0,%0\n" \
  351. "2:\n" \
  352. ".section .fixup,\"ax\"\n" \
  353. "3:\n\t" \
  354. "nop\n\t" \
  355. "mov.l 4f,%0\n\t" \
  356. "jmp @%0\n\t" \
  357. " mov %3,%0\n" \
  358. "4: .long 2b\n\t" \
  359. ".previous\n" \
  360. ".section __ex_table,\"a\"\n\t" \
  361. ".long 1b, 3b\n\t" \
  362. ".previous" \
  363. : "=r" (retval) \
  364. : "r" (val), "m" (__m(addr)), "i" (-EFAULT) \
  365. : "memory"); })
  366. #else
  367. #define __put_user_u64(val,addr,retval) \
  368. ({ \
  369. __asm__ __volatile__( \
  370. "1:\n\t" \
  371. "mov.l %S1,%2\n\t" \
  372. "mov.l %R1,%T2\n\t" \
  373. "mov #0,%0\n" \
  374. "2:\n" \
  375. ".section .fixup,\"ax\"\n" \
  376. "3:\n\t" \
  377. "nop\n\t" \
  378. "mov.l 4f,%0\n\t" \
  379. "jmp @%0\n\t" \
  380. " mov %3,%0\n" \
  381. "4: .long 2b\n\t" \
  382. ".previous\n" \
  383. ".section __ex_table,\"a\"\n\t" \
  384. ".long 1b, 3b\n\t" \
  385. ".previous" \
  386. : "=r" (retval) \
  387. : "r" (val), "m" (__m(addr)), "i" (-EFAULT) \
  388. : "memory"); })
  389. #endif
  390. extern void __put_user_unknown(void);
  391. /* Generic arbitrary sized copy. */
  392. /* Return the number of bytes NOT copied */
  393. extern __kernel_size_t __copy_user(void *to, const void *from, __kernel_size_t n);
  394. #define copy_to_user(to,from,n) ({ \
  395. void *__copy_to = (void *) (to); \
  396. __kernel_size_t __copy_size = (__kernel_size_t) (n); \
  397. __kernel_size_t __copy_res; \
  398. if(__copy_size && __access_ok((unsigned long)__copy_to, __copy_size)) { \
  399. __copy_res = __copy_user(__copy_to, (void *) (from), __copy_size); \
  400. } else __copy_res = __copy_size; \
  401. __copy_res; })
  402. #define __copy_to_user(to,from,n) \
  403. __copy_user((void *)(to), \
  404. (void *)(from), n)
  405. #define __copy_to_user_inatomic __copy_to_user
  406. #define __copy_from_user_inatomic __copy_from_user
  407. #define copy_from_user(to,from,n) ({ \
  408. void *__copy_to = (void *) (to); \
  409. void *__copy_from = (void *) (from); \
  410. __kernel_size_t __copy_size = (__kernel_size_t) (n); \
  411. __kernel_size_t __copy_res; \
  412. if(__copy_size && __access_ok((unsigned long)__copy_from, __copy_size)) { \
  413. __copy_res = __copy_user(__copy_to, __copy_from, __copy_size); \
  414. } else __copy_res = __copy_size; \
  415. __copy_res; })
  416. #define __copy_from_user(to,from,n) \
  417. __copy_user((void *)(to), \
  418. (void *)(from), n)
  419. /*
  420. * Clear the area and return remaining number of bytes
  421. * (on failure. Usually it's 0.)
  422. */
  423. extern __kernel_size_t __clear_user(void *addr, __kernel_size_t size);
  424. #define clear_user(addr,n) ({ \
  425. void * __cl_addr = (addr); \
  426. unsigned long __cl_size = (n); \
  427. if (__cl_size && __access_ok(((unsigned long)(__cl_addr)), __cl_size)) \
  428. __cl_size = __clear_user(__cl_addr, __cl_size); \
  429. __cl_size; })
  430. static __inline__ int
  431. __strncpy_from_user(unsigned long __dest, unsigned long __user __src, int __count)
  432. {
  433. __kernel_size_t res;
  434. unsigned long __dummy, _d, _s;
  435. __asm__ __volatile__(
  436. "9:\n"
  437. "mov.b @%2+, %1\n\t"
  438. "cmp/eq #0, %1\n\t"
  439. "bt/s 2f\n"
  440. "1:\n"
  441. "mov.b %1, @%3\n\t"
  442. "dt %7\n\t"
  443. "bf/s 9b\n\t"
  444. " add #1, %3\n\t"
  445. "2:\n\t"
  446. "sub %7, %0\n"
  447. "3:\n"
  448. ".section .fixup,\"ax\"\n"
  449. "4:\n\t"
  450. "mov.l 5f, %1\n\t"
  451. "jmp @%1\n\t"
  452. " mov %8, %0\n\t"
  453. ".balign 4\n"
  454. "5: .long 3b\n"
  455. ".previous\n"
  456. ".section __ex_table,\"a\"\n"
  457. " .balign 4\n"
  458. " .long 9b,4b\n"
  459. ".previous"
  460. : "=r" (res), "=&z" (__dummy), "=r" (_s), "=r" (_d)
  461. : "0" (__count), "2" (__src), "3" (__dest), "r" (__count),
  462. "i" (-EFAULT)
  463. : "memory", "t");
  464. return res;
  465. }
  466. #define strncpy_from_user(dest,src,count) ({ \
  467. unsigned long __sfu_src = (unsigned long) (src); \
  468. int __sfu_count = (int) (count); \
  469. long __sfu_res = -EFAULT; \
  470. if(__access_ok(__sfu_src, __sfu_count)) { \
  471. __sfu_res = __strncpy_from_user((unsigned long) (dest), __sfu_src, __sfu_count); \
  472. } __sfu_res; })
  473. /*
  474. * Return the size of a string (including the ending 0!)
  475. */
  476. static __inline__ long __strnlen_user(const char __user *__s, long __n)
  477. {
  478. unsigned long res;
  479. unsigned long __dummy;
  480. __asm__ __volatile__(
  481. "9:\n"
  482. "cmp/eq %4, %0\n\t"
  483. "bt 2f\n"
  484. "1:\t"
  485. "mov.b @(%0,%3), %1\n\t"
  486. "tst %1, %1\n\t"
  487. "bf/s 9b\n\t"
  488. " add #1, %0\n"
  489. "2:\n"
  490. ".section .fixup,\"ax\"\n"
  491. "3:\n\t"
  492. "mov.l 4f, %1\n\t"
  493. "jmp @%1\n\t"
  494. " mov %5, %0\n"
  495. ".balign 4\n"
  496. "4: .long 2b\n"
  497. ".previous\n"
  498. ".section __ex_table,\"a\"\n"
  499. " .balign 4\n"
  500. " .long 1b,3b\n"
  501. ".previous"
  502. : "=z" (res), "=&r" (__dummy)
  503. : "0" (0), "r" (__s), "r" (__n), "i" (-EFAULT)
  504. : "t");
  505. return res;
  506. }
  507. static __inline__ long strnlen_user(const char __user *s, long n)
  508. {
  509. if (!access_ok(VERIFY_READ, s, n))
  510. return 0;
  511. else
  512. return __strnlen_user(s, n);
  513. }
  514. static __inline__ long strlen_user(const char __user *s)
  515. {
  516. if (!access_ok(VERIFY_READ, s, 0))
  517. return 0;
  518. else
  519. return __strnlen_user(s, ~0UL >> 1);
  520. }
  521. /*
  522. * The exception table consists of pairs of addresses: the first is the
  523. * address of an instruction that is allowed to fault, and the second is
  524. * the address at which the program should continue. No registers are
  525. * modified, so it is entirely up to the continuation code to figure out
  526. * what to do.
  527. *
  528. * All the routines below use bits of fixup code that are out of line
  529. * with the main instruction path. This means when everything is well,
  530. * we don't even have to jump over them. Further, they do not intrude
  531. * on our cache or tlb entries.
  532. */
  533. struct exception_table_entry
  534. {
  535. unsigned long insn, fixup;
  536. };
  537. extern int fixup_exception(struct pt_regs *regs);
  538. #endif /* __ASM_SH_UACCESS_H */