uaccess.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600
  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. /* this function will go away soon - use access_ok() instead */
  131. static inline int __deprecated verify_area(int type, const void __user * addr, unsigned long size)
  132. {
  133. return access_ok(type,addr,size) ? 0 : -EFAULT;
  134. }
  135. /*
  136. * Uh, these should become the main single-value transfer routines ...
  137. * They automatically use the right size if we just have the right
  138. * pointer type ...
  139. *
  140. * As SuperH uses the same address space for kernel and user data, we
  141. * can just do these as direct assignments.
  142. *
  143. * Careful to not
  144. * (a) re-use the arguments for side effects (sizeof is ok)
  145. * (b) require any knowledge of processes at this stage
  146. */
  147. #define put_user(x,ptr) __put_user_check((x),(ptr),sizeof(*(ptr)))
  148. #define get_user(x,ptr) __get_user_check((x),(ptr),sizeof(*(ptr)))
  149. /*
  150. * The "__xxx" versions do not do address space checking, useful when
  151. * doing multiple accesses to the same area (the user has to do the
  152. * checks by hand with "access_ok()")
  153. */
  154. #define __put_user(x,ptr) \
  155. __put_user_nocheck((__typeof__(*(ptr)))(x),(ptr),sizeof(*(ptr)))
  156. #define __get_user(x,ptr) \
  157. __get_user_nocheck((x),(ptr),sizeof(*(ptr)))
  158. struct __large_struct { unsigned long buf[100]; };
  159. #define __m(x) (*(struct __large_struct *)(x))
  160. #define __get_user_size(x,ptr,size,retval) \
  161. do { \
  162. retval = 0; \
  163. switch (size) { \
  164. case 1: \
  165. __get_user_asm(x, ptr, retval, "b"); \
  166. break; \
  167. case 2: \
  168. __get_user_asm(x, ptr, retval, "w"); \
  169. break; \
  170. case 4: \
  171. __get_user_asm(x, ptr, retval, "l"); \
  172. break; \
  173. default: \
  174. __get_user_unknown(); \
  175. break; \
  176. } \
  177. } while (0)
  178. #define __get_user_nocheck(x,ptr,size) \
  179. ({ \
  180. long __gu_err, __gu_val; \
  181. __get_user_size(__gu_val, (ptr), (size), __gu_err); \
  182. (x) = (__typeof__(*(ptr)))__gu_val; \
  183. __gu_err; \
  184. })
  185. #define __get_user_check(x,ptr,size) \
  186. ({ \
  187. long __gu_err, __gu_val; \
  188. switch (size) { \
  189. case 1: \
  190. __get_user_1(__gu_val, (ptr), __gu_err); \
  191. break; \
  192. case 2: \
  193. __get_user_2(__gu_val, (ptr), __gu_err); \
  194. break; \
  195. case 4: \
  196. __get_user_4(__gu_val, (ptr), __gu_err); \
  197. break; \
  198. default: \
  199. __get_user_unknown(); \
  200. break; \
  201. } \
  202. \
  203. (x) = (__typeof__(*(ptr)))__gu_val; \
  204. __gu_err; \
  205. })
  206. #define __get_user_1(x,addr,err) ({ \
  207. __asm__("stc r7_bank, %1\n\t" \
  208. "mov.l @(8,%1), %1\n\t" \
  209. "and %2, %1\n\t" \
  210. "cmp/pz %1\n\t" \
  211. "bt/s 1f\n\t" \
  212. " mov #0, %0\n\t" \
  213. "0:\n" \
  214. "mov #-14, %0\n\t" \
  215. "bra 2f\n\t" \
  216. " mov #0, %1\n" \
  217. "1:\n\t" \
  218. "mov.b @%2, %1\n\t" \
  219. "extu.b %1, %1\n" \
  220. "2:\n" \
  221. ".section __ex_table,\"a\"\n\t" \
  222. ".long 1b, 0b\n\t" \
  223. ".previous" \
  224. : "=&r" (err), "=&r" (x) \
  225. : "r" (addr) \
  226. : "t"); \
  227. })
  228. #define __get_user_2(x,addr,err) ({ \
  229. __asm__("stc r7_bank, %1\n\t" \
  230. "mov.l @(8,%1), %1\n\t" \
  231. "and %2, %1\n\t" \
  232. "cmp/pz %1\n\t" \
  233. "bt/s 1f\n\t" \
  234. " mov #0, %0\n\t" \
  235. "0:\n" \
  236. "mov #-14, %0\n\t" \
  237. "bra 2f\n\t" \
  238. " mov #0, %1\n" \
  239. "1:\n\t" \
  240. "mov.w @%2, %1\n\t" \
  241. "extu.w %1, %1\n" \
  242. "2:\n" \
  243. ".section __ex_table,\"a\"\n\t" \
  244. ".long 1b, 0b\n\t" \
  245. ".previous" \
  246. : "=&r" (err), "=&r" (x) \
  247. : "r" (addr) \
  248. : "t"); \
  249. })
  250. #define __get_user_4(x,addr,err) ({ \
  251. __asm__("stc r7_bank, %1\n\t" \
  252. "mov.l @(8,%1), %1\n\t" \
  253. "and %2, %1\n\t" \
  254. "cmp/pz %1\n\t" \
  255. "bt/s 1f\n\t" \
  256. " mov #0, %0\n\t" \
  257. "0:\n" \
  258. "mov #-14, %0\n\t" \
  259. "bra 2f\n\t" \
  260. " mov #0, %1\n" \
  261. "1:\n\t" \
  262. "mov.l @%2, %1\n\t" \
  263. "2:\n" \
  264. ".section __ex_table,\"a\"\n\t" \
  265. ".long 1b, 0b\n\t" \
  266. ".previous" \
  267. : "=&r" (err), "=&r" (x) \
  268. : "r" (addr) \
  269. : "t"); \
  270. })
  271. #define __get_user_asm(x, addr, err, insn) \
  272. ({ \
  273. __asm__ __volatile__( \
  274. "1:\n\t" \
  275. "mov." insn " %2, %1\n\t" \
  276. "mov #0, %0\n" \
  277. "2:\n" \
  278. ".section .fixup,\"ax\"\n" \
  279. "3:\n\t" \
  280. "mov #0, %1\n\t" \
  281. "mov.l 4f, %0\n\t" \
  282. "jmp @%0\n\t" \
  283. " mov %3, %0\n" \
  284. "4: .long 2b\n\t" \
  285. ".previous\n" \
  286. ".section __ex_table,\"a\"\n\t" \
  287. ".long 1b, 3b\n\t" \
  288. ".previous" \
  289. :"=&r" (err), "=&r" (x) \
  290. :"m" (__m(addr)), "i" (-EFAULT)); })
  291. extern void __get_user_unknown(void);
  292. #define __put_user_size(x,ptr,size,retval) \
  293. do { \
  294. retval = 0; \
  295. switch (size) { \
  296. case 1: \
  297. __put_user_asm(x, ptr, retval, "b"); \
  298. break; \
  299. case 2: \
  300. __put_user_asm(x, ptr, retval, "w"); \
  301. break; \
  302. case 4: \
  303. __put_user_asm(x, ptr, retval, "l"); \
  304. break; \
  305. case 8: \
  306. __put_user_u64(x, ptr, retval); \
  307. break; \
  308. default: \
  309. __put_user_unknown(); \
  310. } \
  311. } while (0)
  312. #define __put_user_nocheck(x,ptr,size) \
  313. ({ \
  314. long __pu_err; \
  315. __put_user_size((x),(ptr),(size),__pu_err); \
  316. __pu_err; \
  317. })
  318. #define __put_user_check(x,ptr,size) \
  319. ({ \
  320. long __pu_err = -EFAULT; \
  321. __typeof__(*(ptr)) *__pu_addr = (ptr); \
  322. \
  323. if (__access_ok((unsigned long)__pu_addr,size)) \
  324. __put_user_size((x),__pu_addr,(size),__pu_err); \
  325. __pu_err; \
  326. })
  327. #define __put_user_asm(x, addr, err, insn) \
  328. ({ \
  329. __asm__ __volatile__( \
  330. "1:\n\t" \
  331. "mov." insn " %1, %2\n\t" \
  332. "mov #0, %0\n" \
  333. "2:\n" \
  334. ".section .fixup,\"ax\"\n" \
  335. "3:\n\t" \
  336. "nop\n\t" \
  337. "mov.l 4f, %0\n\t" \
  338. "jmp @%0\n\t" \
  339. "mov %3, %0\n" \
  340. "4: .long 2b\n\t" \
  341. ".previous\n" \
  342. ".section __ex_table,\"a\"\n\t" \
  343. ".long 1b, 3b\n\t" \
  344. ".previous" \
  345. :"=&r" (err) \
  346. :"r" (x), "m" (__m(addr)), "i" (-EFAULT) \
  347. :"memory"); })
  348. #if defined(__LITTLE_ENDIAN__)
  349. #define __put_user_u64(val,addr,retval) \
  350. ({ \
  351. __asm__ __volatile__( \
  352. "1:\n\t" \
  353. "mov.l %R1,%2\n\t" \
  354. "mov.l %S1,%T2\n\t" \
  355. "mov #0,%0\n" \
  356. "2:\n" \
  357. ".section .fixup,\"ax\"\n" \
  358. "3:\n\t" \
  359. "nop\n\t" \
  360. "mov.l 4f,%0\n\t" \
  361. "jmp @%0\n\t" \
  362. " mov %3,%0\n" \
  363. "4: .long 2b\n\t" \
  364. ".previous\n" \
  365. ".section __ex_table,\"a\"\n\t" \
  366. ".long 1b, 3b\n\t" \
  367. ".previous" \
  368. : "=r" (retval) \
  369. : "r" (val), "m" (__m(addr)), "i" (-EFAULT) \
  370. : "memory"); })
  371. #else
  372. #define __put_user_u64(val,addr,retval) \
  373. ({ \
  374. __asm__ __volatile__( \
  375. "1:\n\t" \
  376. "mov.l %S1,%2\n\t" \
  377. "mov.l %R1,%T2\n\t" \
  378. "mov #0,%0\n" \
  379. "2:\n" \
  380. ".section .fixup,\"ax\"\n" \
  381. "3:\n\t" \
  382. "nop\n\t" \
  383. "mov.l 4f,%0\n\t" \
  384. "jmp @%0\n\t" \
  385. " mov %3,%0\n" \
  386. "4: .long 2b\n\t" \
  387. ".previous\n" \
  388. ".section __ex_table,\"a\"\n\t" \
  389. ".long 1b, 3b\n\t" \
  390. ".previous" \
  391. : "=r" (retval) \
  392. : "r" (val), "m" (__m(addr)), "i" (-EFAULT) \
  393. : "memory"); })
  394. #endif
  395. extern void __put_user_unknown(void);
  396. /* Generic arbitrary sized copy. */
  397. /* Return the number of bytes NOT copied */
  398. extern __kernel_size_t __copy_user(void *to, const void *from, __kernel_size_t n);
  399. #define copy_to_user(to,from,n) ({ \
  400. void *__copy_to = (void *) (to); \
  401. __kernel_size_t __copy_size = (__kernel_size_t) (n); \
  402. __kernel_size_t __copy_res; \
  403. if(__copy_size && __access_ok((unsigned long)__copy_to, __copy_size)) { \
  404. __copy_res = __copy_user(__copy_to, (void *) (from), __copy_size); \
  405. } else __copy_res = __copy_size; \
  406. __copy_res; })
  407. #define __copy_to_user(to,from,n) \
  408. __copy_user((void *)(to), \
  409. (void *)(from), n)
  410. #define __copy_to_user_inatomic __copy_to_user
  411. #define __copy_from_user_inatomic __copy_from_user
  412. #define copy_from_user(to,from,n) ({ \
  413. void *__copy_to = (void *) (to); \
  414. void *__copy_from = (void *) (from); \
  415. __kernel_size_t __copy_size = (__kernel_size_t) (n); \
  416. __kernel_size_t __copy_res; \
  417. if(__copy_size && __access_ok((unsigned long)__copy_from, __copy_size)) { \
  418. __copy_res = __copy_user(__copy_to, __copy_from, __copy_size); \
  419. } else __copy_res = __copy_size; \
  420. __copy_res; })
  421. #define __copy_from_user(to,from,n) \
  422. __copy_user((void *)(to), \
  423. (void *)(from), n)
  424. /*
  425. * Clear the area and return remaining number of bytes
  426. * (on failure. Usually it's 0.)
  427. */
  428. extern __kernel_size_t __clear_user(void *addr, __kernel_size_t size);
  429. #define clear_user(addr,n) ({ \
  430. void * __cl_addr = (addr); \
  431. unsigned long __cl_size = (n); \
  432. if (__cl_size && __access_ok(((unsigned long)(__cl_addr)), __cl_size)) \
  433. __cl_size = __clear_user(__cl_addr, __cl_size); \
  434. __cl_size; })
  435. static __inline__ int
  436. __strncpy_from_user(unsigned long __dest, unsigned long __user __src, int __count)
  437. {
  438. __kernel_size_t res;
  439. unsigned long __dummy, _d, _s;
  440. __asm__ __volatile__(
  441. "9:\n"
  442. "mov.b @%2+, %1\n\t"
  443. "cmp/eq #0, %1\n\t"
  444. "bt/s 2f\n"
  445. "1:\n"
  446. "mov.b %1, @%3\n\t"
  447. "dt %7\n\t"
  448. "bf/s 9b\n\t"
  449. " add #1, %3\n\t"
  450. "2:\n\t"
  451. "sub %7, %0\n"
  452. "3:\n"
  453. ".section .fixup,\"ax\"\n"
  454. "4:\n\t"
  455. "mov.l 5f, %1\n\t"
  456. "jmp @%1\n\t"
  457. " mov %8, %0\n\t"
  458. ".balign 4\n"
  459. "5: .long 3b\n"
  460. ".previous\n"
  461. ".section __ex_table,\"a\"\n"
  462. " .balign 4\n"
  463. " .long 9b,4b\n"
  464. ".previous"
  465. : "=r" (res), "=&z" (__dummy), "=r" (_s), "=r" (_d)
  466. : "0" (__count), "2" (__src), "3" (__dest), "r" (__count),
  467. "i" (-EFAULT)
  468. : "memory", "t");
  469. return res;
  470. }
  471. #define strncpy_from_user(dest,src,count) ({ \
  472. unsigned long __sfu_src = (unsigned long) (src); \
  473. int __sfu_count = (int) (count); \
  474. long __sfu_res = -EFAULT; \
  475. if(__access_ok(__sfu_src, __sfu_count)) { \
  476. __sfu_res = __strncpy_from_user((unsigned long) (dest), __sfu_src, __sfu_count); \
  477. } __sfu_res; })
  478. /*
  479. * Return the size of a string (including the ending 0!)
  480. */
  481. static __inline__ long __strnlen_user(const char __user *__s, long __n)
  482. {
  483. unsigned long res;
  484. unsigned long __dummy;
  485. __asm__ __volatile__(
  486. "9:\n"
  487. "cmp/eq %4, %0\n\t"
  488. "bt 2f\n"
  489. "1:\t"
  490. "mov.b @(%0,%3), %1\n\t"
  491. "tst %1, %1\n\t"
  492. "bf/s 9b\n\t"
  493. " add #1, %0\n"
  494. "2:\n"
  495. ".section .fixup,\"ax\"\n"
  496. "3:\n\t"
  497. "mov.l 4f, %1\n\t"
  498. "jmp @%1\n\t"
  499. " mov %5, %0\n"
  500. ".balign 4\n"
  501. "4: .long 2b\n"
  502. ".previous\n"
  503. ".section __ex_table,\"a\"\n"
  504. " .balign 4\n"
  505. " .long 1b,3b\n"
  506. ".previous"
  507. : "=z" (res), "=&r" (__dummy)
  508. : "0" (0), "r" (__s), "r" (__n), "i" (-EFAULT)
  509. : "t");
  510. return res;
  511. }
  512. static __inline__ long strnlen_user(const char __user *s, long n)
  513. {
  514. if (!access_ok(VERIFY_READ, s, n))
  515. return 0;
  516. else
  517. return __strnlen_user(s, n);
  518. }
  519. static __inline__ long strlen_user(const char __user *s)
  520. {
  521. if (!access_ok(VERIFY_READ, s, 0))
  522. return 0;
  523. else
  524. return __strnlen_user(s, ~0UL >> 1);
  525. }
  526. /*
  527. * The exception table consists of pairs of addresses: the first is the
  528. * address of an instruction that is allowed to fault, and the second is
  529. * the address at which the program should continue. No registers are
  530. * modified, so it is entirely up to the continuation code to figure out
  531. * what to do.
  532. *
  533. * All the routines below use bits of fixup code that are out of line
  534. * with the main instruction path. This means when everything is well,
  535. * we don't even have to jump over them. Further, they do not intrude
  536. * on our cache or tlb entries.
  537. */
  538. struct exception_table_entry
  539. {
  540. unsigned long insn, fixup;
  541. };
  542. extern int fixup_exception(struct pt_regs *regs);
  543. #endif /* __ASM_SH_UACCESS_H */