2 * linux/kernel/futex_compat.c
4 * Futex compatibililty routines.
6 * Copyright 2006, Red Hat, Inc., Ingo Molnar
9 #include <linux/linkage.h>
10 #include <linux/compat.h>
11 #include <linux/nsproxy.h>
12 #include <linux/futex.h>
14 #include <asm/uaccess.h>
18 * Fetch a robust-list pointer. Bit 0 signals PI futexes:
21 fetch_robust_entry(compat_uptr_t *uentry, struct robust_list __user **entry,
22 compat_uptr_t __user *head, int *pi)
24 if (get_user(*uentry, head))
27 *entry = compat_ptr((*uentry) & ~1);
28 *pi = (unsigned int)(*uentry) & 1;
33 static void __user *futex_uaddr(struct robust_list *entry,
34 compat_long_t futex_offset)
36 compat_uptr_t base = ptr_to_compat(entry);
37 void __user *uaddr = compat_ptr(base + futex_offset);
43 * Walk curr->robust_list (very carefully, it's a userspace list!)
44 * and mark any locks found there dead, and notify any waiters.
46 * We silently return on any sign of list-walking problem.
48 void compat_exit_robust_list(struct task_struct *curr)
50 struct compat_robust_list_head __user *head = curr->compat_robust_list;
51 struct robust_list __user *entry, *next_entry, *pending;
52 unsigned int limit = ROBUST_LIST_LIMIT, pi, next_pi, pip;
53 compat_uptr_t uentry, next_uentry, upending;
54 compat_long_t futex_offset;
58 * Fetch the list head (which was registered earlier, via
59 * sys_set_robust_list()):
61 if (fetch_robust_entry(&uentry, &entry, &head->list.next, &pi))
64 * Fetch the relative futex offset:
66 if (get_user(futex_offset, &head->futex_offset))
69 * Fetch any possibly pending lock-add first, and handle it
72 if (fetch_robust_entry(&upending, &pending,
73 &head->list_op_pending, &pip))
76 next_entry = NULL; /* avoid warning with gcc */
77 while (entry != (struct robust_list __user *) &head->list) {
79 * Fetch the next entry in the list before calling
82 rc = fetch_robust_entry(&next_uentry, &next_entry,
83 (compat_uptr_t __user *)&entry->next, &next_pi);
85 * A pending lock might already be on the list, so
86 * dont process it twice:
88 if (entry != pending) {
89 void __user *uaddr = futex_uaddr(entry, futex_offset);
91 if (handle_futex_death(uaddr, curr, pi))
100 * Avoid excessively long or circular lists:
108 void __user *uaddr = futex_uaddr(pending, futex_offset);
110 handle_futex_death(uaddr, curr, pip);
115 compat_sys_set_robust_list(struct compat_robust_list_head __user *head,
118 if (unlikely(len != sizeof(*head)))
121 current->compat_robust_list = head;
127 compat_sys_get_robust_list(int pid, compat_uptr_t __user *head_ptr,
128 compat_size_t __user *len_ptr)
130 struct compat_robust_list_head __user *head;
134 head = current->compat_robust_list;
136 struct task_struct *p;
139 read_lock(&tasklist_lock);
140 p = find_task_by_vpid(pid);
144 if ((current->euid != p->euid) && (current->euid != p->uid) &&
145 !capable(CAP_SYS_PTRACE))
147 head = p->compat_robust_list;
148 read_unlock(&tasklist_lock);
151 if (put_user(sizeof(*head), len_ptr))
153 return put_user(ptr_to_compat(head), head_ptr);
156 read_unlock(&tasklist_lock);
161 asmlinkage long compat_sys_futex(u32 __user *uaddr, int op, u32 val,
162 struct compat_timespec __user *utime, u32 __user *uaddr2,
166 ktime_t t, *tp = NULL;
168 int cmd = op & FUTEX_CMD_MASK;
170 if (utime && (cmd == FUTEX_WAIT || cmd == FUTEX_LOCK_PI)) {
171 if (get_compat_timespec(&ts, utime))
173 if (!timespec_valid(&ts))
176 t = timespec_to_ktime(ts);
177 if (cmd == FUTEX_WAIT)
178 t = ktime_add(ktime_get(), t);
181 if (cmd == FUTEX_REQUEUE || cmd == FUTEX_CMP_REQUEUE)
182 val2 = (int) (unsigned long) utime;
184 return do_futex(uaddr, op, val, tp, uaddr2, val2, val3);