uaccess_pt.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484
  1. /*
  2. * User access functions based on page table walks for enhanced
  3. * system layout without hardware support.
  4. *
  5. * Copyright IBM Corp. 2006, 2012
  6. * Author(s): Gerald Schaefer (gerald.schaefer@de.ibm.com)
  7. */
  8. #include <linux/errno.h>
  9. #include <linux/hardirq.h>
  10. #include <linux/mm.h>
  11. #include <linux/hugetlb.h>
  12. #include <asm/uaccess.h>
  13. #include <asm/futex.h>
  14. #include "uaccess.h"
  15. #ifndef CONFIG_64BIT
  16. #define AHI "ahi"
  17. #define SLR "slr"
  18. #else
  19. #define AHI "aghi"
  20. #define SLR "slgr"
  21. #endif
  22. static size_t strnlen_kernel(size_t count, const char __user *src)
  23. {
  24. register unsigned long reg0 asm("0") = 0UL;
  25. unsigned long tmp1, tmp2;
  26. asm volatile(
  27. " la %2,0(%1)\n"
  28. " la %3,0(%0,%1)\n"
  29. " "SLR" %0,%0\n"
  30. "0: srst %3,%2\n"
  31. " jo 0b\n"
  32. " la %0,1(%3)\n" /* strnlen_kernel results includes \0 */
  33. " "SLR" %0,%1\n"
  34. "1:\n"
  35. EX_TABLE(0b,1b)
  36. : "+a" (count), "+a" (src), "=a" (tmp1), "=a" (tmp2)
  37. : "d" (reg0) : "cc", "memory");
  38. return count;
  39. }
  40. static size_t copy_in_kernel(size_t count, void __user *to,
  41. const void __user *from)
  42. {
  43. unsigned long tmp1;
  44. asm volatile(
  45. " "AHI" %0,-1\n"
  46. " jo 5f\n"
  47. " bras %3,3f\n"
  48. "0:"AHI" %0,257\n"
  49. "1: mvc 0(1,%1),0(%2)\n"
  50. " la %1,1(%1)\n"
  51. " la %2,1(%2)\n"
  52. " "AHI" %0,-1\n"
  53. " jnz 1b\n"
  54. " j 5f\n"
  55. "2: mvc 0(256,%1),0(%2)\n"
  56. " la %1,256(%1)\n"
  57. " la %2,256(%2)\n"
  58. "3:"AHI" %0,-256\n"
  59. " jnm 2b\n"
  60. "4: ex %0,1b-0b(%3)\n"
  61. "5:"SLR" %0,%0\n"
  62. "6:\n"
  63. EX_TABLE(1b,6b) EX_TABLE(2b,0b) EX_TABLE(4b,0b)
  64. : "+a" (count), "+a" (to), "+a" (from), "=a" (tmp1)
  65. : : "cc", "memory");
  66. return count;
  67. }
  68. /*
  69. * Returns kernel address for user virtual address. If the returned address is
  70. * >= -4095 (IS_ERR_VALUE(x) returns true), a fault has occurred and the
  71. * address contains the (negative) exception code.
  72. */
  73. #ifdef CONFIG_64BIT
  74. static unsigned long follow_table(struct mm_struct *mm,
  75. unsigned long address, int write)
  76. {
  77. unsigned long *table = (unsigned long *)__pa(mm->pgd);
  78. if (unlikely(address > mm->context.asce_limit - 1))
  79. return -0x38UL;
  80. switch (mm->context.asce_bits & _ASCE_TYPE_MASK) {
  81. case _ASCE_TYPE_REGION1:
  82. table = table + ((address >> 53) & 0x7ff);
  83. if (unlikely(*table & _REGION_ENTRY_INVALID))
  84. return -0x39UL;
  85. table = (unsigned long *)(*table & _REGION_ENTRY_ORIGIN);
  86. /* fallthrough */
  87. case _ASCE_TYPE_REGION2:
  88. table = table + ((address >> 42) & 0x7ff);
  89. if (unlikely(*table & _REGION_ENTRY_INVALID))
  90. return -0x3aUL;
  91. table = (unsigned long *)(*table & _REGION_ENTRY_ORIGIN);
  92. /* fallthrough */
  93. case _ASCE_TYPE_REGION3:
  94. table = table + ((address >> 31) & 0x7ff);
  95. if (unlikely(*table & _REGION_ENTRY_INVALID))
  96. return -0x3bUL;
  97. table = (unsigned long *)(*table & _REGION_ENTRY_ORIGIN);
  98. /* fallthrough */
  99. case _ASCE_TYPE_SEGMENT:
  100. table = table + ((address >> 20) & 0x7ff);
  101. if (unlikely(*table & _SEGMENT_ENTRY_INVALID))
  102. return -0x10UL;
  103. if (unlikely(*table & _SEGMENT_ENTRY_LARGE)) {
  104. if (write && (*table & _SEGMENT_ENTRY_PROTECT))
  105. return -0x04UL;
  106. return (*table & _SEGMENT_ENTRY_ORIGIN_LARGE) +
  107. (address & ~_SEGMENT_ENTRY_ORIGIN_LARGE);
  108. }
  109. table = (unsigned long *)(*table & _SEGMENT_ENTRY_ORIGIN);
  110. }
  111. table = table + ((address >> 12) & 0xff);
  112. if (unlikely(*table & _PAGE_INVALID))
  113. return -0x11UL;
  114. if (write && (*table & _PAGE_PROTECT))
  115. return -0x04UL;
  116. return (*table & PAGE_MASK) + (address & ~PAGE_MASK);
  117. }
  118. #else /* CONFIG_64BIT */
  119. static unsigned long follow_table(struct mm_struct *mm,
  120. unsigned long address, int write)
  121. {
  122. unsigned long *table = (unsigned long *)__pa(mm->pgd);
  123. table = table + ((address >> 20) & 0x7ff);
  124. if (unlikely(*table & _SEGMENT_ENTRY_INVALID))
  125. return -0x10UL;
  126. table = (unsigned long *)(*table & _SEGMENT_ENTRY_ORIGIN);
  127. table = table + ((address >> 12) & 0xff);
  128. if (unlikely(*table & _PAGE_INVALID))
  129. return -0x11UL;
  130. if (write && (*table & _PAGE_PROTECT))
  131. return -0x04UL;
  132. return (*table & PAGE_MASK) + (address & ~PAGE_MASK);
  133. }
  134. #endif /* CONFIG_64BIT */
  135. static __always_inline size_t __user_copy_pt(unsigned long uaddr, void *kptr,
  136. size_t n, int write_user)
  137. {
  138. struct mm_struct *mm = current->mm;
  139. unsigned long offset, done, size, kaddr;
  140. void *from, *to;
  141. if (!mm)
  142. return n;
  143. done = 0;
  144. retry:
  145. spin_lock(&mm->page_table_lock);
  146. do {
  147. kaddr = follow_table(mm, uaddr, write_user);
  148. if (IS_ERR_VALUE(kaddr))
  149. goto fault;
  150. offset = uaddr & ~PAGE_MASK;
  151. size = min(n - done, PAGE_SIZE - offset);
  152. if (write_user) {
  153. to = (void *) kaddr;
  154. from = kptr + done;
  155. } else {
  156. from = (void *) kaddr;
  157. to = kptr + done;
  158. }
  159. memcpy(to, from, size);
  160. done += size;
  161. uaddr += size;
  162. } while (done < n);
  163. spin_unlock(&mm->page_table_lock);
  164. return n - done;
  165. fault:
  166. spin_unlock(&mm->page_table_lock);
  167. if (__handle_fault(uaddr, -kaddr, write_user))
  168. return n - done;
  169. goto retry;
  170. }
  171. /*
  172. * Do DAT for user address by page table walk, return kernel address.
  173. * This function needs to be called with current->mm->page_table_lock held.
  174. */
  175. static __always_inline unsigned long __dat_user_addr(unsigned long uaddr,
  176. int write)
  177. {
  178. struct mm_struct *mm = current->mm;
  179. unsigned long kaddr;
  180. int rc;
  181. retry:
  182. kaddr = follow_table(mm, uaddr, write);
  183. if (IS_ERR_VALUE(kaddr))
  184. goto fault;
  185. return kaddr;
  186. fault:
  187. spin_unlock(&mm->page_table_lock);
  188. rc = __handle_fault(uaddr, -kaddr, write);
  189. spin_lock(&mm->page_table_lock);
  190. if (!rc)
  191. goto retry;
  192. return 0;
  193. }
  194. static size_t copy_from_user_pt(size_t n, const void __user *from, void *to)
  195. {
  196. size_t rc;
  197. if (segment_eq(get_fs(), KERNEL_DS))
  198. return copy_in_kernel(n, (void __user *) to, from);
  199. rc = __user_copy_pt((unsigned long) from, to, n, 0);
  200. if (unlikely(rc))
  201. memset(to + n - rc, 0, rc);
  202. return rc;
  203. }
  204. static size_t copy_to_user_pt(size_t n, void __user *to, const void *from)
  205. {
  206. if (segment_eq(get_fs(), KERNEL_DS))
  207. return copy_in_kernel(n, to, (void __user *) from);
  208. return __user_copy_pt((unsigned long) to, (void *) from, n, 1);
  209. }
  210. static size_t clear_user_pt(size_t n, void __user *to)
  211. {
  212. void *zpage = (void *) empty_zero_page;
  213. long done, size, ret;
  214. done = 0;
  215. do {
  216. if (n - done > PAGE_SIZE)
  217. size = PAGE_SIZE;
  218. else
  219. size = n - done;
  220. if (segment_eq(get_fs(), KERNEL_DS))
  221. ret = copy_in_kernel(n, to, (void __user *) zpage);
  222. else
  223. ret = __user_copy_pt((unsigned long) to, zpage, size, 1);
  224. done += size;
  225. to += size;
  226. if (ret)
  227. return ret + n - done;
  228. } while (done < n);
  229. return 0;
  230. }
  231. static size_t strnlen_user_pt(size_t count, const char __user *src)
  232. {
  233. unsigned long uaddr = (unsigned long) src;
  234. struct mm_struct *mm = current->mm;
  235. unsigned long offset, done, len, kaddr;
  236. size_t len_str;
  237. if (unlikely(!count))
  238. return 0;
  239. if (segment_eq(get_fs(), KERNEL_DS))
  240. return strnlen_kernel(count, src);
  241. if (!mm)
  242. return 0;
  243. done = 0;
  244. retry:
  245. spin_lock(&mm->page_table_lock);
  246. do {
  247. kaddr = follow_table(mm, uaddr, 0);
  248. if (IS_ERR_VALUE(kaddr))
  249. goto fault;
  250. offset = uaddr & ~PAGE_MASK;
  251. len = min(count - done, PAGE_SIZE - offset);
  252. len_str = strnlen((char *) kaddr, len);
  253. done += len_str;
  254. uaddr += len_str;
  255. } while ((len_str == len) && (done < count));
  256. spin_unlock(&mm->page_table_lock);
  257. return done + 1;
  258. fault:
  259. spin_unlock(&mm->page_table_lock);
  260. if (__handle_fault(uaddr, -kaddr, 0))
  261. return 0;
  262. goto retry;
  263. }
  264. static size_t strncpy_from_user_pt(size_t count, const char __user *src,
  265. char *dst)
  266. {
  267. size_t done, len, offset, len_str;
  268. if (unlikely(!count))
  269. return 0;
  270. done = 0;
  271. do {
  272. offset = (size_t)src & ~PAGE_MASK;
  273. len = min(count - done, PAGE_SIZE - offset);
  274. if (segment_eq(get_fs(), KERNEL_DS)) {
  275. if (copy_in_kernel(len, (void __user *) dst, src))
  276. return -EFAULT;
  277. } else {
  278. if (__user_copy_pt((unsigned long) src, dst, len, 0))
  279. return -EFAULT;
  280. }
  281. len_str = strnlen(dst, len);
  282. done += len_str;
  283. src += len_str;
  284. dst += len_str;
  285. } while ((len_str == len) && (done < count));
  286. return done;
  287. }
  288. static size_t copy_in_user_pt(size_t n, void __user *to,
  289. const void __user *from)
  290. {
  291. struct mm_struct *mm = current->mm;
  292. unsigned long offset_max, uaddr, done, size, error_code;
  293. unsigned long uaddr_from = (unsigned long) from;
  294. unsigned long uaddr_to = (unsigned long) to;
  295. unsigned long kaddr_to, kaddr_from;
  296. int write_user;
  297. if (segment_eq(get_fs(), KERNEL_DS))
  298. return copy_in_kernel(n, to, from);
  299. if (!mm)
  300. return n;
  301. done = 0;
  302. retry:
  303. spin_lock(&mm->page_table_lock);
  304. do {
  305. write_user = 0;
  306. uaddr = uaddr_from;
  307. kaddr_from = follow_table(mm, uaddr_from, 0);
  308. error_code = kaddr_from;
  309. if (IS_ERR_VALUE(error_code))
  310. goto fault;
  311. write_user = 1;
  312. uaddr = uaddr_to;
  313. kaddr_to = follow_table(mm, uaddr_to, 1);
  314. error_code = (unsigned long) kaddr_to;
  315. if (IS_ERR_VALUE(error_code))
  316. goto fault;
  317. offset_max = max(uaddr_from & ~PAGE_MASK,
  318. uaddr_to & ~PAGE_MASK);
  319. size = min(n - done, PAGE_SIZE - offset_max);
  320. memcpy((void *) kaddr_to, (void *) kaddr_from, size);
  321. done += size;
  322. uaddr_from += size;
  323. uaddr_to += size;
  324. } while (done < n);
  325. spin_unlock(&mm->page_table_lock);
  326. return n - done;
  327. fault:
  328. spin_unlock(&mm->page_table_lock);
  329. if (__handle_fault(uaddr, -error_code, write_user))
  330. return n - done;
  331. goto retry;
  332. }
  333. #define __futex_atomic_op(insn, ret, oldval, newval, uaddr, oparg) \
  334. asm volatile("0: l %1,0(%6)\n" \
  335. "1: " insn \
  336. "2: cs %1,%2,0(%6)\n" \
  337. "3: jl 1b\n" \
  338. " lhi %0,0\n" \
  339. "4:\n" \
  340. EX_TABLE(0b,4b) EX_TABLE(2b,4b) EX_TABLE(3b,4b) \
  341. : "=d" (ret), "=&d" (oldval), "=&d" (newval), \
  342. "=m" (*uaddr) \
  343. : "0" (-EFAULT), "d" (oparg), "a" (uaddr), \
  344. "m" (*uaddr) : "cc" );
  345. static int __futex_atomic_op_pt(int op, u32 __user *uaddr, int oparg, int *old)
  346. {
  347. int oldval = 0, newval, ret;
  348. switch (op) {
  349. case FUTEX_OP_SET:
  350. __futex_atomic_op("lr %2,%5\n",
  351. ret, oldval, newval, uaddr, oparg);
  352. break;
  353. case FUTEX_OP_ADD:
  354. __futex_atomic_op("lr %2,%1\nar %2,%5\n",
  355. ret, oldval, newval, uaddr, oparg);
  356. break;
  357. case FUTEX_OP_OR:
  358. __futex_atomic_op("lr %2,%1\nor %2,%5\n",
  359. ret, oldval, newval, uaddr, oparg);
  360. break;
  361. case FUTEX_OP_ANDN:
  362. __futex_atomic_op("lr %2,%1\nnr %2,%5\n",
  363. ret, oldval, newval, uaddr, oparg);
  364. break;
  365. case FUTEX_OP_XOR:
  366. __futex_atomic_op("lr %2,%1\nxr %2,%5\n",
  367. ret, oldval, newval, uaddr, oparg);
  368. break;
  369. default:
  370. ret = -ENOSYS;
  371. }
  372. if (ret == 0)
  373. *old = oldval;
  374. return ret;
  375. }
  376. int futex_atomic_op_pt(int op, u32 __user *uaddr, int oparg, int *old)
  377. {
  378. int ret;
  379. if (segment_eq(get_fs(), KERNEL_DS))
  380. return __futex_atomic_op_pt(op, uaddr, oparg, old);
  381. if (unlikely(!current->mm))
  382. return -EFAULT;
  383. spin_lock(&current->mm->page_table_lock);
  384. uaddr = (u32 __force __user *)
  385. __dat_user_addr((__force unsigned long) uaddr, 1);
  386. if (!uaddr) {
  387. spin_unlock(&current->mm->page_table_lock);
  388. return -EFAULT;
  389. }
  390. get_page(virt_to_page(uaddr));
  391. spin_unlock(&current->mm->page_table_lock);
  392. ret = __futex_atomic_op_pt(op, uaddr, oparg, old);
  393. put_page(virt_to_page(uaddr));
  394. return ret;
  395. }
  396. static int __futex_atomic_cmpxchg_pt(u32 *uval, u32 __user *uaddr,
  397. u32 oldval, u32 newval)
  398. {
  399. int ret;
  400. asm volatile("0: cs %1,%4,0(%5)\n"
  401. "1: la %0,0\n"
  402. "2:\n"
  403. EX_TABLE(0b,2b) EX_TABLE(1b,2b)
  404. : "=d" (ret), "+d" (oldval), "=m" (*uaddr)
  405. : "0" (-EFAULT), "d" (newval), "a" (uaddr), "m" (*uaddr)
  406. : "cc", "memory" );
  407. *uval = oldval;
  408. return ret;
  409. }
  410. int futex_atomic_cmpxchg_pt(u32 *uval, u32 __user *uaddr,
  411. u32 oldval, u32 newval)
  412. {
  413. int ret;
  414. if (segment_eq(get_fs(), KERNEL_DS))
  415. return __futex_atomic_cmpxchg_pt(uval, uaddr, oldval, newval);
  416. if (unlikely(!current->mm))
  417. return -EFAULT;
  418. spin_lock(&current->mm->page_table_lock);
  419. uaddr = (u32 __force __user *)
  420. __dat_user_addr((__force unsigned long) uaddr, 1);
  421. if (!uaddr) {
  422. spin_unlock(&current->mm->page_table_lock);
  423. return -EFAULT;
  424. }
  425. get_page(virt_to_page(uaddr));
  426. spin_unlock(&current->mm->page_table_lock);
  427. ret = __futex_atomic_cmpxchg_pt(uval, uaddr, oldval, newval);
  428. put_page(virt_to_page(uaddr));
  429. return ret;
  430. }
  431. struct uaccess_ops uaccess_pt = {
  432. .copy_from_user = copy_from_user_pt,
  433. .copy_to_user = copy_to_user_pt,
  434. .copy_in_user = copy_in_user_pt,
  435. .clear_user = clear_user_pt,
  436. .strnlen_user = strnlen_user_pt,
  437. .strncpy_from_user = strncpy_from_user_pt,
  438. .futex_atomic_op = futex_atomic_op_pt,
  439. .futex_atomic_cmpxchg = futex_atomic_cmpxchg_pt,
  440. };