futex_compat.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200
  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 <asm/uaccess.h>
  13. /*
  14. * Fetch a robust-list pointer. Bit 0 signals PI futexes:
  15. */
  16. static inline int
  17. fetch_robust_entry(compat_uptr_t *uentry, struct robust_list __user **entry,
  18. compat_uptr_t __user *head, int *pi)
  19. {
  20. if (get_user(*uentry, head))
  21. return -EFAULT;
  22. *entry = compat_ptr((*uentry) & ~1);
  23. *pi = (unsigned int)(*uentry) & 1;
  24. return 0;
  25. }
  26. static void __user *futex_uaddr(struct robust_list __user *entry,
  27. compat_long_t futex_offset)
  28. {
  29. compat_uptr_t base = ptr_to_compat(entry);
  30. void __user *uaddr = compat_ptr(base + futex_offset);
  31. return uaddr;
  32. }
  33. /*
  34. * Walk curr->robust_list (very carefully, it's a userspace list!)
  35. * and mark any locks found there dead, and notify any waiters.
  36. *
  37. * We silently return on any sign of list-walking problem.
  38. */
  39. void compat_exit_robust_list(struct task_struct *curr)
  40. {
  41. struct compat_robust_list_head __user *head = curr->compat_robust_list;
  42. struct robust_list __user *entry, *next_entry, *pending;
  43. unsigned int limit = ROBUST_LIST_LIMIT, pi, next_pi, pip;
  44. compat_uptr_t uentry, next_uentry, upending;
  45. compat_long_t futex_offset;
  46. int rc;
  47. if (!futex_cmpxchg_enabled)
  48. return;
  49. /*
  50. * Fetch the list head (which was registered earlier, via
  51. * sys_set_robust_list()):
  52. */
  53. if (fetch_robust_entry(&uentry, &entry, &head->list.next, &pi))
  54. return;
  55. /*
  56. * Fetch the relative futex offset:
  57. */
  58. if (get_user(futex_offset, &head->futex_offset))
  59. return;
  60. /*
  61. * Fetch any possibly pending lock-add first, and handle it
  62. * if it exists:
  63. */
  64. if (fetch_robust_entry(&upending, &pending,
  65. &head->list_op_pending, &pip))
  66. return;
  67. next_entry = NULL; /* avoid warning with gcc */
  68. while (entry != (struct robust_list __user *) &head->list) {
  69. /*
  70. * Fetch the next entry in the list before calling
  71. * handle_futex_death:
  72. */
  73. rc = fetch_robust_entry(&next_uentry, &next_entry,
  74. (compat_uptr_t __user *)&entry->next, &next_pi);
  75. /*
  76. * A pending lock might already be on the list, so
  77. * dont process it twice:
  78. */
  79. if (entry != pending) {
  80. void __user *uaddr = futex_uaddr(entry, futex_offset);
  81. if (handle_futex_death(uaddr, curr, pi))
  82. return;
  83. }
  84. if (rc)
  85. return;
  86. uentry = next_uentry;
  87. entry = next_entry;
  88. pi = next_pi;
  89. /*
  90. * Avoid excessively long or circular lists:
  91. */
  92. if (!--limit)
  93. break;
  94. cond_resched();
  95. }
  96. if (pending) {
  97. void __user *uaddr = futex_uaddr(pending, futex_offset);
  98. handle_futex_death(uaddr, curr, pip);
  99. }
  100. }
  101. asmlinkage long
  102. compat_sys_set_robust_list(struct compat_robust_list_head __user *head,
  103. compat_size_t len)
  104. {
  105. if (!futex_cmpxchg_enabled)
  106. return -ENOSYS;
  107. if (unlikely(len != sizeof(*head)))
  108. return -EINVAL;
  109. current->compat_robust_list = head;
  110. return 0;
  111. }
  112. asmlinkage long
  113. compat_sys_get_robust_list(int pid, compat_uptr_t __user *head_ptr,
  114. compat_size_t __user *len_ptr)
  115. {
  116. struct compat_robust_list_head __user *head;
  117. unsigned long ret;
  118. const struct cred *cred = current_cred(), *pcred;
  119. if (!futex_cmpxchg_enabled)
  120. return -ENOSYS;
  121. if (!pid)
  122. head = current->compat_robust_list;
  123. else {
  124. struct task_struct *p;
  125. ret = -ESRCH;
  126. read_lock(&tasklist_lock);
  127. p = find_task_by_vpid(pid);
  128. if (!p)
  129. goto err_unlock;
  130. ret = -EPERM;
  131. pcred = __task_cred(p);
  132. if (cred->euid != pcred->euid &&
  133. cred->euid != pcred->uid &&
  134. !capable(CAP_SYS_PTRACE))
  135. goto err_unlock;
  136. head = p->compat_robust_list;
  137. read_unlock(&tasklist_lock);
  138. }
  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. read_unlock(&tasklist_lock);
  144. return ret;
  145. }
  146. asmlinkage long compat_sys_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. }