1 // SPDX-License-Identifier: GPL-2.0
3 * This file contains the procedures for the handling of select and poll
5 * Created for Linux based loosely upon Mathius Lattner's minix
6 * patches by Peter MacDonald. Heavily edited by Linus.
9 * COFF/ELF binary emulation. If the process has the STICKY_TIMEOUTS
10 * flag set in its personality we do *not* modify the given timeout
11 * parameter to reflect time remaining.
14 * Changed sys_poll()/do_poll() to use PAGE_SIZE chunk-based allocation
15 * of fds to overcome nfds < 16390 descriptors limit (Tigran Aivazian).
18 #include <linux/compat.h>
19 #include <linux/kernel.h>
20 #include <linux/sched/signal.h>
21 #include <linux/sched/rt.h>
22 #include <linux/syscalls.h>
23 #include <linux/export.h>
24 #include <linux/slab.h>
25 #include <linux/poll.h>
26 #include <linux/personality.h> /* for STICKY_TIMEOUTS */
27 #include <linux/file.h>
28 #include <linux/fdtable.h>
30 #include <linux/rcupdate.h>
31 #include <linux/hrtimer.h>
32 #include <linux/freezer.h>
33 #include <net/busy_poll.h>
34 #include <linux/vmalloc.h>
36 #include <linux/uaccess.h>
40 * Estimate expected accuracy in ns from a timeval.
42 * After quite a bit of churning around, we've settled on
43 * a simple thing of taking 0.1% of the timeout as the
44 * slack, with a cap of 100 msec.
45 * "nice" tasks get a 0.5% slack instead.
47 * Consider this comment an open invitation to come up with even
51 #define MAX_SLACK (100 * NSEC_PER_MSEC)
53 static long __estimate_accuracy(struct timespec64 *tv)
61 if (task_nice(current) > 0)
62 divfactor = divfactor / 5;
64 if (tv->tv_sec > MAX_SLACK / (NSEC_PER_SEC/divfactor))
67 slack = tv->tv_nsec / divfactor;
68 slack += tv->tv_sec * (NSEC_PER_SEC/divfactor);
70 if (slack > MAX_SLACK)
76 u64 select_estimate_accuracy(struct timespec64 *tv)
79 struct timespec64 now;
82 * Realtime tasks get a slack of 0 for obvious reasons.
89 now = timespec64_sub(*tv, now);
90 ret = __estimate_accuracy(&now);
91 if (ret < current->timer_slack_ns)
92 return current->timer_slack_ns;
98 struct poll_table_page {
99 struct poll_table_page * next;
100 struct poll_table_entry * entry;
101 struct poll_table_entry entries[];
104 #define POLL_TABLE_FULL(table) \
105 ((unsigned long)((table)->entry+1) > PAGE_SIZE + (unsigned long)(table))
108 * Ok, Peter made a complicated, but straightforward multiple_wait() function.
109 * I have rewritten this, taking some shortcuts: This code may not be easy to
110 * follow, but it should be free of race-conditions, and it's practical. If you
111 * understand what I'm doing here, then you understand how the linux
112 * sleep/wakeup mechanism works.
114 * Two very simple procedures, poll_wait() and poll_freewait() make all the
115 * work. poll_wait() is an inline-function defined in <linux/poll.h>,
116 * as all select/poll functions have to call it to add an entry to the
119 static void __pollwait(struct file *filp, wait_queue_head_t *wait_address,
122 void poll_initwait(struct poll_wqueues *pwq)
124 init_poll_funcptr(&pwq->pt, __pollwait);
125 pwq->polling_task = current;
129 pwq->inline_index = 0;
131 EXPORT_SYMBOL(poll_initwait);
133 static void free_poll_entry(struct poll_table_entry *entry)
135 remove_wait_queue(entry->wait_address, &entry->wait);
139 void poll_freewait(struct poll_wqueues *pwq)
141 struct poll_table_page * p = pwq->table;
143 for (i = 0; i < pwq->inline_index; i++)
144 free_poll_entry(pwq->inline_entries + i);
146 struct poll_table_entry * entry;
147 struct poll_table_page *old;
152 free_poll_entry(entry);
153 } while (entry > p->entries);
156 free_page((unsigned long) old);
159 EXPORT_SYMBOL(poll_freewait);
161 static struct poll_table_entry *poll_get_entry(struct poll_wqueues *p)
163 struct poll_table_page *table = p->table;
165 if (p->inline_index < N_INLINE_POLL_ENTRIES)
166 return p->inline_entries + p->inline_index++;
168 if (!table || POLL_TABLE_FULL(table)) {
169 struct poll_table_page *new_table;
171 new_table = (struct poll_table_page *) __get_free_page(GFP_KERNEL);
176 new_table->entry = new_table->entries;
177 new_table->next = table;
178 p->table = new_table;
182 return table->entry++;
185 static int __pollwake(wait_queue_entry_t *wait, unsigned mode, int sync, void *key)
187 struct poll_wqueues *pwq = wait->private;
188 DECLARE_WAITQUEUE(dummy_wait, pwq->polling_task);
191 * Although this function is called under waitqueue lock, LOCK
192 * doesn't imply write barrier and the users expect write
193 * barrier semantics on wakeup functions. The following
194 * smp_wmb() is equivalent to smp_wmb() in try_to_wake_up()
195 * and is paired with smp_store_mb() in poll_schedule_timeout.
201 * Perform the default wake up operation using a dummy
204 * TODO: This is hacky but there currently is no interface to
205 * pass in @sync. @sync is scheduled to be removed and once
206 * that happens, wake_up_process() can be used directly.
208 return default_wake_function(&dummy_wait, mode, sync, key);
211 static int pollwake(wait_queue_entry_t *wait, unsigned mode, int sync, void *key)
213 struct poll_table_entry *entry;
215 entry = container_of(wait, struct poll_table_entry, wait);
216 if (key && !(key_to_poll(key) & entry->key))
218 return __pollwake(wait, mode, sync, key);
221 /* Add a new entry */
222 static void __pollwait(struct file *filp, wait_queue_head_t *wait_address,
225 struct poll_wqueues *pwq = container_of(p, struct poll_wqueues, pt);
226 struct poll_table_entry *entry = poll_get_entry(pwq);
229 entry->filp = get_file(filp);
230 entry->wait_address = wait_address;
231 entry->key = p->_key;
232 init_waitqueue_func_entry(&entry->wait, pollwake);
233 entry->wait.private = pwq;
234 add_wait_queue(wait_address, &entry->wait);
237 int poll_schedule_timeout(struct poll_wqueues *pwq, int state,
238 ktime_t *expires, unsigned long slack)
242 set_current_state(state);
244 rc = schedule_hrtimeout_range(expires, slack, HRTIMER_MODE_ABS);
245 __set_current_state(TASK_RUNNING);
248 * Prepare for the next iteration.
250 * The following smp_store_mb() serves two purposes. First, it's
251 * the counterpart rmb of the wmb in pollwake() such that data
252 * written before wake up is always visible after wake up.
253 * Second, the full barrier guarantees that triggered clearing
254 * doesn't pass event check of the next iteration. Note that
255 * this problem doesn't exist for the first iteration as
256 * add_wait_queue() has full barrier semantics.
258 smp_store_mb(pwq->triggered, 0);
262 EXPORT_SYMBOL(poll_schedule_timeout);
265 * poll_select_set_timeout - helper function to setup the timeout value
266 * @to: pointer to timespec64 variable for the final timeout
267 * @sec: seconds (from user space)
268 * @nsec: nanoseconds (from user space)
270 * Note, we do not use a timespec for the user space value here, That
271 * way we can use the function for timeval and compat interfaces as well.
273 * Returns -EINVAL if sec/nsec are not normalized. Otherwise 0.
275 int poll_select_set_timeout(struct timespec64 *to, time64_t sec, long nsec)
277 struct timespec64 ts = {.tv_sec = sec, .tv_nsec = nsec};
279 if (!timespec64_valid(&ts))
282 /* Optimize for the zero timeout value here */
284 to->tv_sec = to->tv_nsec = 0;
287 *to = timespec64_add_safe(*to, ts);
292 enum poll_time_type {
299 static int poll_select_finish(struct timespec64 *end_time,
301 enum poll_time_type pt_type, int ret)
303 struct timespec64 rts;
305 restore_saved_sigmask_unless(ret == -ERESTARTNOHAND);
310 if (current->personality & STICKY_TIMEOUTS)
313 /* No update for zero timeout */
314 if (!end_time->tv_sec && !end_time->tv_nsec)
317 ktime_get_ts64(&rts);
318 rts = timespec64_sub(*end_time, rts);
320 rts.tv_sec = rts.tv_nsec = 0;
326 struct __kernel_old_timeval rtv;
328 if (sizeof(rtv) > sizeof(rtv.tv_sec) + sizeof(rtv.tv_usec))
329 memset(&rtv, 0, sizeof(rtv));
330 rtv.tv_sec = rts.tv_sec;
331 rtv.tv_usec = rts.tv_nsec / NSEC_PER_USEC;
332 if (!copy_to_user(p, &rtv, sizeof(rtv)))
338 struct old_timeval32 rtv;
340 rtv.tv_sec = rts.tv_sec;
341 rtv.tv_usec = rts.tv_nsec / NSEC_PER_USEC;
342 if (!copy_to_user(p, &rtv, sizeof(rtv)))
347 if (!put_timespec64(&rts, p))
350 case PT_OLD_TIMESPEC:
351 if (!put_old_timespec32(&rts, p))
358 * If an application puts its timeval in read-only memory, we
359 * don't want the Linux-specific update to the timeval to
360 * cause a fault after the select has completed
361 * successfully. However, because we're not updating the
362 * timeval, we can't restart the system call.
366 if (ret == -ERESTARTNOHAND)
372 * Scalable version of the fd_set.
376 unsigned long *in, *out, *ex;
377 unsigned long *res_in, *res_out, *res_ex;
381 * How many longwords for "nr" bits?
383 #define FDS_BITPERLONG (8*sizeof(long))
384 #define FDS_LONGS(nr) (((nr)+FDS_BITPERLONG-1)/FDS_BITPERLONG)
385 #define FDS_BYTES(nr) (FDS_LONGS(nr)*sizeof(long))
388 * Use "unsigned long" accesses to let user-mode fd_set's be long-aligned.
391 int get_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
395 return copy_from_user(fdset, ufdset, nr) ? -EFAULT : 0;
397 memset(fdset, 0, nr);
401 static inline unsigned long __must_check
402 set_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
405 return __copy_to_user(ufdset, fdset, FDS_BYTES(nr));
410 void zero_fd_set(unsigned long nr, unsigned long *fdset)
412 memset(fdset, 0, FDS_BYTES(nr));
415 #define FDS_IN(fds, n) (fds->in + n)
416 #define FDS_OUT(fds, n) (fds->out + n)
417 #define FDS_EX(fds, n) (fds->ex + n)
419 #define BITS(fds, n) (*FDS_IN(fds, n)|*FDS_OUT(fds, n)|*FDS_EX(fds, n))
421 static int max_select_fd(unsigned long n, fd_set_bits *fds)
423 unsigned long *open_fds;
428 /* handle last in-complete long-word first */
429 set = ~(~0UL << (n & (BITS_PER_LONG-1)));
431 fdt = files_fdtable(current->files);
432 open_fds = fdt->open_fds + n;
437 if (!(set & ~*open_fds))
448 if (set & ~*open_fds)
457 max += n * BITS_PER_LONG;
463 #define POLLIN_SET (EPOLLRDNORM | EPOLLRDBAND | EPOLLIN | EPOLLHUP | EPOLLERR |\
465 #define POLLOUT_SET (EPOLLWRBAND | EPOLLWRNORM | EPOLLOUT | EPOLLERR |\
467 #define POLLEX_SET (EPOLLPRI | EPOLLNVAL)
469 static inline void wait_key_set(poll_table *wait, unsigned long in,
470 unsigned long out, unsigned long bit,
473 wait->_key = POLLEX_SET | ll_flag;
475 wait->_key |= POLLIN_SET;
477 wait->_key |= POLLOUT_SET;
480 static int do_select(int n, fd_set_bits *fds, struct timespec64 *end_time)
482 ktime_t expire, *to = NULL;
483 struct poll_wqueues table;
485 int retval, i, timed_out = 0;
487 __poll_t busy_flag = net_busy_loop_on() ? POLL_BUSY_LOOP : 0;
488 unsigned long busy_start = 0;
491 retval = max_select_fd(n, fds);
498 poll_initwait(&table);
500 if (end_time && !end_time->tv_sec && !end_time->tv_nsec) {
505 if (end_time && !timed_out)
506 slack = select_estimate_accuracy(end_time);
510 unsigned long *rinp, *routp, *rexp, *inp, *outp, *exp;
511 bool can_busy_loop = false;
513 inp = fds->in; outp = fds->out; exp = fds->ex;
514 rinp = fds->res_in; routp = fds->res_out; rexp = fds->res_ex;
516 for (i = 0; i < n; ++rinp, ++routp, ++rexp) {
517 unsigned long in, out, ex, all_bits, bit = 1, j;
518 unsigned long res_in = 0, res_out = 0, res_ex = 0;
521 in = *inp++; out = *outp++; ex = *exp++;
522 all_bits = in | out | ex;
528 for (j = 0; j < BITS_PER_LONG; ++j, ++i, bit <<= 1) {
532 if (!(bit & all_bits))
537 wait_key_set(wait, in, out, bit,
539 mask = vfs_poll(f.file, wait);
543 if ((mask & POLLIN_SET) && (in & bit)) {
548 if ((mask & POLLOUT_SET) && (out & bit)) {
553 if ((mask & POLLEX_SET) && (ex & bit)) {
558 /* got something, stop busy polling */
560 can_busy_loop = false;
564 * only remember a returned
565 * POLL_BUSY_LOOP if we asked for it
567 } else if (busy_flag & mask)
568 can_busy_loop = true;
580 if (retval || timed_out || signal_pending(current))
583 retval = table.error;
587 /* only if found POLL_BUSY_LOOP sockets && not out of time */
588 if (can_busy_loop && !need_resched()) {
590 busy_start = busy_loop_current_time();
593 if (!busy_loop_timeout(busy_start))
599 * If this is the first loop and we have a timeout
600 * given, then we convert to ktime_t and set the to
601 * pointer to the expiry value.
603 if (end_time && !to) {
604 expire = timespec64_to_ktime(*end_time);
608 if (!poll_schedule_timeout(&table, TASK_INTERRUPTIBLE,
613 poll_freewait(&table);
619 * We can actually return ERESTARTSYS instead of EINTR, but I'd
620 * like to be certain this leads to no problems. So I return
621 * EINTR just for safety.
623 * Update: ERESTARTSYS breaks at least the xview clock binary, so
624 * I'm trying ERESTARTNOHAND which restart only when you want to.
626 int core_sys_select(int n, fd_set __user *inp, fd_set __user *outp,
627 fd_set __user *exp, struct timespec64 *end_time)
632 size_t size, alloc_size;
634 /* Allocate small arguments on the stack to save memory and be faster */
635 long stack_fds[SELECT_STACK_ALLOC/sizeof(long)];
641 /* max_fds can increase, so grab it once to avoid race */
643 fdt = files_fdtable(current->files);
644 max_fds = fdt->max_fds;
650 * We need 6 bitmaps (in/out/ex for both incoming and outgoing),
651 * since we used fdset we need to allocate memory in units of
656 if (size > sizeof(stack_fds) / 6) {
657 /* Not enough space in on-stack array; must use kmalloc */
659 if (size > (SIZE_MAX / 6))
662 alloc_size = 6 * size;
663 bits = kvmalloc(alloc_size, GFP_KERNEL);
668 fds.out = bits + size;
669 fds.ex = bits + 2*size;
670 fds.res_in = bits + 3*size;
671 fds.res_out = bits + 4*size;
672 fds.res_ex = bits + 5*size;
674 if ((ret = get_fd_set(n, inp, fds.in)) ||
675 (ret = get_fd_set(n, outp, fds.out)) ||
676 (ret = get_fd_set(n, exp, fds.ex)))
678 zero_fd_set(n, fds.res_in);
679 zero_fd_set(n, fds.res_out);
680 zero_fd_set(n, fds.res_ex);
682 ret = do_select(n, &fds, end_time);
687 ret = -ERESTARTNOHAND;
688 if (signal_pending(current))
693 if (set_fd_set(n, inp, fds.res_in) ||
694 set_fd_set(n, outp, fds.res_out) ||
695 set_fd_set(n, exp, fds.res_ex))
699 if (bits != stack_fds)
705 static int kern_select(int n, fd_set __user *inp, fd_set __user *outp,
706 fd_set __user *exp, struct __kernel_old_timeval __user *tvp)
708 struct timespec64 end_time, *to = NULL;
709 struct __kernel_old_timeval tv;
713 if (copy_from_user(&tv, tvp, sizeof(tv)))
717 if (poll_select_set_timeout(to,
718 tv.tv_sec + (tv.tv_usec / USEC_PER_SEC),
719 (tv.tv_usec % USEC_PER_SEC) * NSEC_PER_USEC))
723 ret = core_sys_select(n, inp, outp, exp, to);
724 return poll_select_finish(&end_time, tvp, PT_TIMEVAL, ret);
727 SYSCALL_DEFINE5(select, int, n, fd_set __user *, inp, fd_set __user *, outp,
728 fd_set __user *, exp, struct __kernel_old_timeval __user *, tvp)
730 return kern_select(n, inp, outp, exp, tvp);
733 static long do_pselect(int n, fd_set __user *inp, fd_set __user *outp,
734 fd_set __user *exp, void __user *tsp,
735 const sigset_t __user *sigmask, size_t sigsetsize,
736 enum poll_time_type type)
738 struct timespec64 ts, end_time, *to = NULL;
744 if (get_timespec64(&ts, tsp))
747 case PT_OLD_TIMESPEC:
748 if (get_old_timespec32(&ts, tsp))
756 if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec))
760 ret = set_user_sigmask(sigmask, sigsetsize);
764 ret = core_sys_select(n, inp, outp, exp, to);
765 return poll_select_finish(&end_time, tsp, type, ret);
769 * Most architectures can't handle 7-argument syscalls. So we provide a
770 * 6-argument version where the sixth argument is a pointer to a structure
771 * which has a pointer to the sigset_t itself followed by a size_t containing
774 struct sigset_argpack {
779 static inline int get_sigset_argpack(struct sigset_argpack *to,
780 struct sigset_argpack __user *from)
782 // the path is hot enough for overhead of copy_from_user() to matter
784 if (!user_read_access_begin(from, sizeof(*from)))
786 unsafe_get_user(to->p, &from->p, Efault);
787 unsafe_get_user(to->size, &from->size, Efault);
788 user_read_access_end();
796 SYSCALL_DEFINE6(pselect6, int, n, fd_set __user *, inp, fd_set __user *, outp,
797 fd_set __user *, exp, struct __kernel_timespec __user *, tsp,
800 struct sigset_argpack x = {NULL, 0};
802 if (get_sigset_argpack(&x, sig))
805 return do_pselect(n, inp, outp, exp, tsp, x.p, x.size, PT_TIMESPEC);
808 #if defined(CONFIG_COMPAT_32BIT_TIME) && !defined(CONFIG_64BIT)
810 SYSCALL_DEFINE6(pselect6_time32, int, n, fd_set __user *, inp, fd_set __user *, outp,
811 fd_set __user *, exp, struct old_timespec32 __user *, tsp,
814 struct sigset_argpack x = {NULL, 0};
816 if (get_sigset_argpack(&x, sig))
819 return do_pselect(n, inp, outp, exp, tsp, x.p, x.size, PT_OLD_TIMESPEC);
824 #ifdef __ARCH_WANT_SYS_OLD_SELECT
825 struct sel_arg_struct {
827 fd_set __user *inp, *outp, *exp;
828 struct __kernel_old_timeval __user *tvp;
831 SYSCALL_DEFINE1(old_select, struct sel_arg_struct __user *, arg)
833 struct sel_arg_struct a;
835 if (copy_from_user(&a, arg, sizeof(a)))
837 return kern_select(a.n, a.inp, a.outp, a.exp, a.tvp);
842 struct poll_list *next;
844 struct pollfd entries[];
847 #define POLLFD_PER_PAGE ((PAGE_SIZE-sizeof(struct poll_list)) / sizeof(struct pollfd))
850 * Fish for pollable events on the pollfd->fd file descriptor. We're only
851 * interested in events matching the pollfd->events mask, and the result
852 * matching that mask is both recorded in pollfd->revents and returned. The
853 * pwait poll_table will be used by the fd-provided poll handler for waiting,
854 * if pwait->_qproc is non-NULL.
856 static inline __poll_t do_pollfd(struct pollfd *pollfd, poll_table *pwait,
861 __poll_t mask = 0, filter;
871 /* userland u16 ->events contains POLL... bitmap */
872 filter = demangle_poll(pollfd->events) | EPOLLERR | EPOLLHUP;
873 pwait->_key = filter | busy_flag;
874 mask = vfs_poll(f.file, pwait);
875 if (mask & busy_flag)
876 *can_busy_poll = true;
877 mask &= filter; /* Mask out unneeded events. */
881 /* ... and so does ->revents */
882 pollfd->revents = mangle_poll(mask);
886 static int do_poll(struct poll_list *list, struct poll_wqueues *wait,
887 struct timespec64 *end_time)
889 poll_table* pt = &wait->pt;
890 ktime_t expire, *to = NULL;
891 int timed_out = 0, count = 0;
893 __poll_t busy_flag = net_busy_loop_on() ? POLL_BUSY_LOOP : 0;
894 unsigned long busy_start = 0;
896 /* Optimise the no-wait case */
897 if (end_time && !end_time->tv_sec && !end_time->tv_nsec) {
902 if (end_time && !timed_out)
903 slack = select_estimate_accuracy(end_time);
906 struct poll_list *walk;
907 bool can_busy_loop = false;
909 for (walk = list; walk != NULL; walk = walk->next) {
910 struct pollfd * pfd, * pfd_end;
913 pfd_end = pfd + walk->len;
914 for (; pfd != pfd_end; pfd++) {
916 * Fish for events. If we found one, record it
917 * and kill poll_table->_qproc, so we don't
918 * needlessly register any other waiters after
919 * this. They'll get immediately deregistered
920 * when we break out and return.
922 if (do_pollfd(pfd, pt, &can_busy_loop,
926 /* found something, stop busy polling */
928 can_busy_loop = false;
933 * All waiters have already been registered, so don't provide
934 * a poll_table->_qproc to them on the next loop iteration.
939 if (signal_pending(current))
940 count = -ERESTARTNOHAND;
942 if (count || timed_out)
945 /* only if found POLL_BUSY_LOOP sockets && not out of time */
946 if (can_busy_loop && !need_resched()) {
948 busy_start = busy_loop_current_time();
951 if (!busy_loop_timeout(busy_start))
957 * If this is the first loop and we have a timeout
958 * given, then we convert to ktime_t and set the to
959 * pointer to the expiry value.
961 if (end_time && !to) {
962 expire = timespec64_to_ktime(*end_time);
966 if (!poll_schedule_timeout(wait, TASK_INTERRUPTIBLE, to, slack))
972 #define N_STACK_PPS ((sizeof(stack_pps) - sizeof(struct poll_list)) / \
973 sizeof(struct pollfd))
975 static int do_sys_poll(struct pollfd __user *ufds, unsigned int nfds,
976 struct timespec64 *end_time)
978 struct poll_wqueues table;
979 int err = -EFAULT, fdcount, len;
980 /* Allocate small arguments on the stack to save memory and be
981 faster - use long to make sure the buffer is aligned properly
982 on 64 bit archs to avoid unaligned access */
983 long stack_pps[POLL_STACK_ALLOC/sizeof(long)];
984 struct poll_list *const head = (struct poll_list *)stack_pps;
985 struct poll_list *walk = head;
986 unsigned long todo = nfds;
988 if (nfds > rlimit(RLIMIT_NOFILE))
991 len = min_t(unsigned int, nfds, N_STACK_PPS);
998 if (copy_from_user(walk->entries, ufds + nfds-todo,
999 sizeof(struct pollfd) * walk->len))
1006 len = min(todo, POLLFD_PER_PAGE);
1007 walk = walk->next = kmalloc(struct_size(walk, entries, len),
1015 poll_initwait(&table);
1016 fdcount = do_poll(head, &table, end_time);
1017 poll_freewait(&table);
1019 if (!user_write_access_begin(ufds, nfds * sizeof(*ufds)))
1022 for (walk = head; walk; walk = walk->next) {
1023 struct pollfd *fds = walk->entries;
1026 for (j = walk->len; j; fds++, ufds++, j--)
1027 unsafe_put_user(fds->revents, &ufds->revents, Efault);
1029 user_write_access_end();
1035 struct poll_list *pos = walk;
1043 user_write_access_end();
1048 static long do_restart_poll(struct restart_block *restart_block)
1050 struct pollfd __user *ufds = restart_block->poll.ufds;
1051 int nfds = restart_block->poll.nfds;
1052 struct timespec64 *to = NULL, end_time;
1055 if (restart_block->poll.has_timeout) {
1056 end_time.tv_sec = restart_block->poll.tv_sec;
1057 end_time.tv_nsec = restart_block->poll.tv_nsec;
1061 ret = do_sys_poll(ufds, nfds, to);
1063 if (ret == -ERESTARTNOHAND)
1064 ret = set_restart_fn(restart_block, do_restart_poll);
1069 SYSCALL_DEFINE3(poll, struct pollfd __user *, ufds, unsigned int, nfds,
1072 struct timespec64 end_time, *to = NULL;
1075 if (timeout_msecs >= 0) {
1077 poll_select_set_timeout(to, timeout_msecs / MSEC_PER_SEC,
1078 NSEC_PER_MSEC * (timeout_msecs % MSEC_PER_SEC));
1081 ret = do_sys_poll(ufds, nfds, to);
1083 if (ret == -ERESTARTNOHAND) {
1084 struct restart_block *restart_block;
1086 restart_block = ¤t->restart_block;
1087 restart_block->poll.ufds = ufds;
1088 restart_block->poll.nfds = nfds;
1090 if (timeout_msecs >= 0) {
1091 restart_block->poll.tv_sec = end_time.tv_sec;
1092 restart_block->poll.tv_nsec = end_time.tv_nsec;
1093 restart_block->poll.has_timeout = 1;
1095 restart_block->poll.has_timeout = 0;
1097 ret = set_restart_fn(restart_block, do_restart_poll);
1102 SYSCALL_DEFINE5(ppoll, struct pollfd __user *, ufds, unsigned int, nfds,
1103 struct __kernel_timespec __user *, tsp, const sigset_t __user *, sigmask,
1106 struct timespec64 ts, end_time, *to = NULL;
1110 if (get_timespec64(&ts, tsp))
1114 if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec))
1118 ret = set_user_sigmask(sigmask, sigsetsize);
1122 ret = do_sys_poll(ufds, nfds, to);
1123 return poll_select_finish(&end_time, tsp, PT_TIMESPEC, ret);
1126 #if defined(CONFIG_COMPAT_32BIT_TIME) && !defined(CONFIG_64BIT)
1128 SYSCALL_DEFINE5(ppoll_time32, struct pollfd __user *, ufds, unsigned int, nfds,
1129 struct old_timespec32 __user *, tsp, const sigset_t __user *, sigmask,
1132 struct timespec64 ts, end_time, *to = NULL;
1136 if (get_old_timespec32(&ts, tsp))
1140 if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec))
1144 ret = set_user_sigmask(sigmask, sigsetsize);
1148 ret = do_sys_poll(ufds, nfds, to);
1149 return poll_select_finish(&end_time, tsp, PT_OLD_TIMESPEC, ret);
1153 #ifdef CONFIG_COMPAT
1154 #define __COMPAT_NFDBITS (8 * sizeof(compat_ulong_t))
1157 * Ooo, nasty. We need here to frob 32-bit unsigned longs to
1158 * 64-bit unsigned longs.
1161 int compat_get_fd_set(unsigned long nr, compat_ulong_t __user *ufdset,
1162 unsigned long *fdset)
1165 return compat_get_bitmap(fdset, ufdset, nr);
1167 zero_fd_set(nr, fdset);
1173 int compat_set_fd_set(unsigned long nr, compat_ulong_t __user *ufdset,
1174 unsigned long *fdset)
1178 return compat_put_bitmap(ufdset, fdset, nr);
1183 * This is a virtual copy of sys_select from fs/select.c and probably
1184 * should be compared to it from time to time
1188 * We can actually return ERESTARTSYS instead of EINTR, but I'd
1189 * like to be certain this leads to no problems. So I return
1190 * EINTR just for safety.
1192 * Update: ERESTARTSYS breaks at least the xview clock binary, so
1193 * I'm trying ERESTARTNOHAND which restart only when you want to.
1195 static int compat_core_sys_select(int n, compat_ulong_t __user *inp,
1196 compat_ulong_t __user *outp, compat_ulong_t __user *exp,
1197 struct timespec64 *end_time)
1201 int size, max_fds, ret = -EINVAL;
1202 struct fdtable *fdt;
1203 long stack_fds[SELECT_STACK_ALLOC/sizeof(long)];
1208 /* max_fds can increase, so grab it once to avoid race */
1210 fdt = files_fdtable(current->files);
1211 max_fds = fdt->max_fds;
1217 * We need 6 bitmaps (in/out/ex for both incoming and outgoing),
1218 * since we used fdset we need to allocate memory in units of
1221 size = FDS_BYTES(n);
1223 if (size > sizeof(stack_fds) / 6) {
1224 bits = kmalloc_array(6, size, GFP_KERNEL);
1229 fds.in = (unsigned long *) bits;
1230 fds.out = (unsigned long *) (bits + size);
1231 fds.ex = (unsigned long *) (bits + 2*size);
1232 fds.res_in = (unsigned long *) (bits + 3*size);
1233 fds.res_out = (unsigned long *) (bits + 4*size);
1234 fds.res_ex = (unsigned long *) (bits + 5*size);
1236 if ((ret = compat_get_fd_set(n, inp, fds.in)) ||
1237 (ret = compat_get_fd_set(n, outp, fds.out)) ||
1238 (ret = compat_get_fd_set(n, exp, fds.ex)))
1240 zero_fd_set(n, fds.res_in);
1241 zero_fd_set(n, fds.res_out);
1242 zero_fd_set(n, fds.res_ex);
1244 ret = do_select(n, &fds, end_time);
1249 ret = -ERESTARTNOHAND;
1250 if (signal_pending(current))
1255 if (compat_set_fd_set(n, inp, fds.res_in) ||
1256 compat_set_fd_set(n, outp, fds.res_out) ||
1257 compat_set_fd_set(n, exp, fds.res_ex))
1260 if (bits != stack_fds)
1266 static int do_compat_select(int n, compat_ulong_t __user *inp,
1267 compat_ulong_t __user *outp, compat_ulong_t __user *exp,
1268 struct old_timeval32 __user *tvp)
1270 struct timespec64 end_time, *to = NULL;
1271 struct old_timeval32 tv;
1275 if (copy_from_user(&tv, tvp, sizeof(tv)))
1279 if (poll_select_set_timeout(to,
1280 tv.tv_sec + (tv.tv_usec / USEC_PER_SEC),
1281 (tv.tv_usec % USEC_PER_SEC) * NSEC_PER_USEC))
1285 ret = compat_core_sys_select(n, inp, outp, exp, to);
1286 return poll_select_finish(&end_time, tvp, PT_OLD_TIMEVAL, ret);
1289 COMPAT_SYSCALL_DEFINE5(select, int, n, compat_ulong_t __user *, inp,
1290 compat_ulong_t __user *, outp, compat_ulong_t __user *, exp,
1291 struct old_timeval32 __user *, tvp)
1293 return do_compat_select(n, inp, outp, exp, tvp);
1296 struct compat_sel_arg_struct {
1304 COMPAT_SYSCALL_DEFINE1(old_select, struct compat_sel_arg_struct __user *, arg)
1306 struct compat_sel_arg_struct a;
1308 if (copy_from_user(&a, arg, sizeof(a)))
1310 return do_compat_select(a.n, compat_ptr(a.inp), compat_ptr(a.outp),
1311 compat_ptr(a.exp), compat_ptr(a.tvp));
1314 static long do_compat_pselect(int n, compat_ulong_t __user *inp,
1315 compat_ulong_t __user *outp, compat_ulong_t __user *exp,
1316 void __user *tsp, compat_sigset_t __user *sigmask,
1317 compat_size_t sigsetsize, enum poll_time_type type)
1319 struct timespec64 ts, end_time, *to = NULL;
1324 case PT_OLD_TIMESPEC:
1325 if (get_old_timespec32(&ts, tsp))
1329 if (get_timespec64(&ts, tsp))
1337 if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec))
1341 ret = set_compat_user_sigmask(sigmask, sigsetsize);
1345 ret = compat_core_sys_select(n, inp, outp, exp, to);
1346 return poll_select_finish(&end_time, tsp, type, ret);
1349 struct compat_sigset_argpack {
1353 static inline int get_compat_sigset_argpack(struct compat_sigset_argpack *to,
1354 struct compat_sigset_argpack __user *from)
1357 if (!user_read_access_begin(from, sizeof(*from)))
1359 unsafe_get_user(to->p, &from->p, Efault);
1360 unsafe_get_user(to->size, &from->size, Efault);
1361 user_read_access_end();
1369 COMPAT_SYSCALL_DEFINE6(pselect6_time64, int, n, compat_ulong_t __user *, inp,
1370 compat_ulong_t __user *, outp, compat_ulong_t __user *, exp,
1371 struct __kernel_timespec __user *, tsp, void __user *, sig)
1373 struct compat_sigset_argpack x = {0, 0};
1375 if (get_compat_sigset_argpack(&x, sig))
1378 return do_compat_pselect(n, inp, outp, exp, tsp, compat_ptr(x.p),
1379 x.size, PT_TIMESPEC);
1382 #if defined(CONFIG_COMPAT_32BIT_TIME)
1384 COMPAT_SYSCALL_DEFINE6(pselect6_time32, int, n, compat_ulong_t __user *, inp,
1385 compat_ulong_t __user *, outp, compat_ulong_t __user *, exp,
1386 struct old_timespec32 __user *, tsp, void __user *, sig)
1388 struct compat_sigset_argpack x = {0, 0};
1390 if (get_compat_sigset_argpack(&x, sig))
1393 return do_compat_pselect(n, inp, outp, exp, tsp, compat_ptr(x.p),
1394 x.size, PT_OLD_TIMESPEC);
1399 #if defined(CONFIG_COMPAT_32BIT_TIME)
1400 COMPAT_SYSCALL_DEFINE5(ppoll_time32, struct pollfd __user *, ufds,
1401 unsigned int, nfds, struct old_timespec32 __user *, tsp,
1402 const compat_sigset_t __user *, sigmask, compat_size_t, sigsetsize)
1404 struct timespec64 ts, end_time, *to = NULL;
1408 if (get_old_timespec32(&ts, tsp))
1412 if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec))
1416 ret = set_compat_user_sigmask(sigmask, sigsetsize);
1420 ret = do_sys_poll(ufds, nfds, to);
1421 return poll_select_finish(&end_time, tsp, PT_OLD_TIMESPEC, ret);
1425 /* New compat syscall for 64 bit time_t*/
1426 COMPAT_SYSCALL_DEFINE5(ppoll_time64, struct pollfd __user *, ufds,
1427 unsigned int, nfds, struct __kernel_timespec __user *, tsp,
1428 const compat_sigset_t __user *, sigmask, compat_size_t, sigsetsize)
1430 struct timespec64 ts, end_time, *to = NULL;
1434 if (get_timespec64(&ts, tsp))
1438 if (poll_select_set_timeout(to, ts.tv_sec, ts.tv_nsec))
1442 ret = set_compat_user_sigmask(sigmask, sigsetsize);
1446 ret = do_sys_poll(ufds, nfds, to);
1447 return poll_select_finish(&end_time, tsp, PT_TIMESPEC, ret);