futex_compat.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203
  1. /*
  2. * linux/kernel/futex_compat.c
  3. *
  4. * Futex compatibililty routines.
  5. *
  6. * Copyright 2006, Red Hat, Inc., Ingo Molnar
  7. */
  8. #include <linux/linkage.h>
  9. #include <linux/compat.h>
  10. #include <linux/nsproxy.h>
  11. #include <linux/futex.h>
  12. #include <linux/ptrace.h>
  13. #include <linux/syscalls.h>
  14. #include <asm/uaccess.h>
  15. /*
  16. * Fetch a robust-list pointer. Bit 0 signals PI futexes:
  17. */
  18. static inline int
  19. fetch_robust_entry(compat_uptr_t *uentry, struct robust_list __user **entry,
  20. compat_uptr_t __user *head, unsigned int *pi)
  21. {
  22. if (get_user(*uentry, head))
  23. return -EFAULT;
  24. *entry = compat_ptr((*uentry) & ~1);
  25. *pi = (unsigned int)(*uentry) & 1;
  26. return 0;
  27. }
  28. static void __user *futex_uaddr(struct robust_list __user *entry,
  29. compat_long_t futex_offset)
  30. {
  31. compat_uptr_t base = ptr_to_compat(entry);
  32. void __user *uaddr = compat_ptr(base + futex_offset);
  33. return uaddr;
  34. }
  35. /*
  36. * Walk curr->robust_list (very carefully, it's a userspace list!)
  37. * and mark any locks found there dead, and notify any waiters.
  38. *
  39. * We silently return on any sign of list-walking problem.
  40. */
  41. void compat_exit_robust_list(struct task_struct *curr)
  42. {
  43. struct compat_robust_list_head __user *head = curr->compat_robust_list;
  44. struct robust_list __user *entry, *next_entry, *pending;
  45. unsigned int limit = ROBUST_LIST_LIMIT, pi, pip;
  46. unsigned int uninitialized_var(next_pi);
  47. compat_uptr_t uentry, next_uentry, upending;
  48. compat_long_t futex_offset;
  49. int rc;
  50. if (!futex_cmpxchg_enabled)
  51. return;
  52. /*
  53. * Fetch the list head (which was registered earlier, via
  54. * sys_set_robust_list()):
  55. */
  56. if (fetch_robust_entry(&uentry, &entry, &head->list.next, &pi))
  57. return;
  58. /*
  59. * Fetch the relative futex offset:
  60. */
  61. if (get_user(futex_offset, &head->futex_offset))
  62. return;
  63. /*
  64. * Fetch any possibly pending lock-add first, and handle it
  65. * if it exists:
  66. */
  67. if (fetch_robust_entry(&upending, &pending,
  68. &head->list_op_pending, &pip))
  69. return;
  70. next_entry = NULL; /* avoid warning with gcc */
  71. while (entry != (struct robust_list __user *) &head->list) {
  72. /*
  73. * Fetch the next entry in the list before calling
  74. * handle_futex_death:
  75. */
  76. rc = fetch_robust_entry(&next_uentry, &next_entry,
  77. (compat_uptr_t __user *)&entry->next, &next_pi);
  78. /*
  79. * A pending lock might already be on the list, so
  80. * dont process it twice:
  81. */
  82. if (entry != pending) {
  83. void __user *uaddr = futex_uaddr(entry, futex_offset);
  84. if (handle_futex_death(uaddr, curr, pi))
  85. return;
  86. }
  87. if (rc)
  88. return;
  89. uentry = next_uentry;
  90. entry = next_entry;
  91. pi = next_pi;
  92. /*
  93. * Avoid excessively long or circular lists:
  94. */
  95. if (!--limit)
  96. break;
  97. cond_resched();
  98. }
  99. if (pending) {
  100. void __user *uaddr = futex_uaddr(pending, futex_offset);
  101. handle_futex_death(uaddr, curr, pip);
  102. }
  103. }
  104. COMPAT_SYSCALL_DEFINE2(set_robust_list,
  105. struct compat_robust_list_head __user *, head,
  106. compat_size_t, len)
  107. {
  108. if (!futex_cmpxchg_enabled)
  109. return -ENOSYS;
  110. if (unlikely(len != sizeof(*head)))
  111. return -EINVAL;
  112. current->compat_robust_list = head;
  113. return 0;
  114. }
  115. COMPAT_SYSCALL_DEFINE3(get_robust_list, int, pid,
  116. compat_uptr_t __user *, head_ptr,
  117. compat_size_t __user *, len_ptr)
  118. {
  119. struct compat_robust_list_head __user *head;
  120. unsigned long ret;
  121. struct task_struct *p;
  122. if (!futex_cmpxchg_enabled)
  123. return -ENOSYS;
  124. WARN_ONCE(1, "deprecated: get_robust_list will be deleted in 2013.\n");
  125. rcu_read_lock();
  126. ret = -ESRCH;
  127. if (!pid)
  128. p = current;
  129. else {
  130. p = find_task_by_vpid(pid);
  131. if (!p)
  132. goto err_unlock;
  133. }
  134. ret = -EPERM;
  135. if (!ptrace_may_access(p, PTRACE_MODE_READ))
  136. goto err_unlock;
  137. head = p->compat_robust_list;
  138. rcu_read_unlock();
  139. if (put_user(sizeof(*head), len_ptr))
  140. return -EFAULT;
  141. return put_user(ptr_to_compat(head), head_ptr);
  142. err_unlock:
  143. rcu_read_unlock();
  144. return ret;
  145. }
  146. COMPAT_SYSCALL_DEFINE6(futex, u32 __user *, uaddr, int, op, u32, val,
  147. struct compat_timespec __user *, utime, u32 __user *, uaddr2,
  148. u32, val3)
  149. {
  150. struct timespec ts;
  151. ktime_t t, *tp = NULL;
  152. int val2 = 0;
  153. int cmd = op & FUTEX_CMD_MASK;
  154. if (utime && (cmd == FUTEX_WAIT || cmd == FUTEX_LOCK_PI ||
  155. cmd == FUTEX_WAIT_BITSET ||
  156. cmd == FUTEX_WAIT_REQUEUE_PI)) {
  157. if (get_compat_timespec(&ts, utime))
  158. return -EFAULT;
  159. if (!timespec_valid(&ts))
  160. return -EINVAL;
  161. t = timespec_to_ktime(ts);
  162. if (cmd == FUTEX_WAIT)
  163. t = ktime_add_safe(ktime_get(), t);
  164. tp = &t;
  165. }
  166. if (cmd == FUTEX_REQUEUE || cmd == FUTEX_CMP_REQUEUE ||
  167. cmd == FUTEX_CMP_REQUEUE_PI || cmd == FUTEX_WAKE_OP)
  168. val2 = (int) (unsigned long) utime;
  169. return do_futex(uaddr, op, val, tp, uaddr2, val2, val3);
  170. }