futex_compat.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185
  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 *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. /*
  48. * Fetch the list head (which was registered earlier, via
  49. * sys_set_robust_list()):
  50. */
  51. if (fetch_robust_entry(&uentry, &entry, &head->list.next, &pi))
  52. return;
  53. /*
  54. * Fetch the relative futex offset:
  55. */
  56. if (get_user(futex_offset, &head->futex_offset))
  57. return;
  58. /*
  59. * Fetch any possibly pending lock-add first, and handle it
  60. * if it exists:
  61. */
  62. if (fetch_robust_entry(&upending, &pending,
  63. &head->list_op_pending, &pip))
  64. return;
  65. next_entry = NULL; /* avoid warning with gcc */
  66. while (entry != (struct robust_list __user *) &head->list) {
  67. /*
  68. * Fetch the next entry in the list before calling
  69. * handle_futex_death:
  70. */
  71. rc = fetch_robust_entry(&next_uentry, &next_entry,
  72. (compat_uptr_t __user *)&entry->next, &next_pi);
  73. /*
  74. * A pending lock might already be on the list, so
  75. * dont process it twice:
  76. */
  77. if (entry != pending) {
  78. void __user *uaddr = futex_uaddr(entry, futex_offset);
  79. if (handle_futex_death(uaddr, curr, pi))
  80. return;
  81. }
  82. if (rc)
  83. return;
  84. uentry = next_uentry;
  85. entry = next_entry;
  86. pi = next_pi;
  87. /*
  88. * Avoid excessively long or circular lists:
  89. */
  90. if (!--limit)
  91. break;
  92. cond_resched();
  93. }
  94. if (pending) {
  95. void __user *uaddr = futex_uaddr(pending, futex_offset);
  96. handle_futex_death(uaddr, curr, pip);
  97. }
  98. }
  99. asmlinkage long
  100. compat_sys_set_robust_list(struct compat_robust_list_head __user *head,
  101. compat_size_t len)
  102. {
  103. if (unlikely(len != sizeof(*head)))
  104. return -EINVAL;
  105. current->compat_robust_list = head;
  106. return 0;
  107. }
  108. asmlinkage long
  109. compat_sys_get_robust_list(int pid, compat_uptr_t __user *head_ptr,
  110. compat_size_t __user *len_ptr)
  111. {
  112. struct compat_robust_list_head __user *head;
  113. unsigned long ret;
  114. if (!pid)
  115. head = current->compat_robust_list;
  116. else {
  117. struct task_struct *p;
  118. ret = -ESRCH;
  119. read_lock(&tasklist_lock);
  120. p = find_task_by_vpid(pid);
  121. if (!p)
  122. goto err_unlock;
  123. ret = -EPERM;
  124. if ((current->euid != p->euid) && (current->euid != p->uid) &&
  125. !capable(CAP_SYS_PTRACE))
  126. goto err_unlock;
  127. head = p->compat_robust_list;
  128. read_unlock(&tasklist_lock);
  129. }
  130. if (put_user(sizeof(*head), len_ptr))
  131. return -EFAULT;
  132. return put_user(ptr_to_compat(head), head_ptr);
  133. err_unlock:
  134. read_unlock(&tasklist_lock);
  135. return ret;
  136. }
  137. asmlinkage long compat_sys_futex(u32 __user *uaddr, int op, u32 val,
  138. struct compat_timespec __user *utime, u32 __user *uaddr2,
  139. u32 val3)
  140. {
  141. struct timespec ts;
  142. ktime_t t, *tp = NULL;
  143. int val2 = 0;
  144. int cmd = op & FUTEX_CMD_MASK;
  145. if (utime && (cmd == FUTEX_WAIT || cmd == FUTEX_LOCK_PI)) {
  146. if (get_compat_timespec(&ts, utime))
  147. return -EFAULT;
  148. if (!timespec_valid(&ts))
  149. return -EINVAL;
  150. t = timespec_to_ktime(ts);
  151. if (cmd == FUTEX_WAIT)
  152. t = ktime_add(ktime_get(), t);
  153. tp = &t;
  154. }
  155. if (cmd == FUTEX_REQUEUE || cmd == FUTEX_CMP_REQUEUE)
  156. val2 = (int) (unsigned long) utime;
  157. return do_futex(uaddr, op, val, tp, uaddr2, val2, val3);
  158. }