blob: 4bee398ed2facd9655c48f3b5ffbf442335aa1ee [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef _LINUX_POLL_H
2#define _LINUX_POLL_H
3
Linus Torvalds1da177e2005-04-16 15:20:36 -07004
5#include <linux/compiler.h>
Alexey Dobriyana99bbaf2009-10-04 16:11:37 +04006#include <linux/ktime.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07007#include <linux/wait.h>
8#include <linux/string.h>
Al Virof23f6e02006-10-20 15:17:02 -04009#include <linux/fs.h>
Dave Young9ff99332010-03-10 15:24:10 -080010#include <linux/sysctl.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070011#include <asm/uaccess.h>
David Howells607ca462012-10-13 10:46:48 +010012#include <uapi/linux/poll.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070013
Dave Young9ff99332010-03-10 15:24:10 -080014extern struct ctl_table epoll_table[]; /* for sysctl */
Andi Kleen70674f92006-03-28 01:56:33 -080015/* ~832 bytes of stack space used max in sys_select/sys_poll before allocating
16 additional memory. */
Arnd Bergmanncbad0dc2019-05-14 15:41:42 -070017#ifdef __clang__
18#define MAX_STACK_ALLOC 768
19#else
Andi Kleen70674f92006-03-28 01:56:33 -080020#define MAX_STACK_ALLOC 832
Arnd Bergmanncbad0dc2019-05-14 15:41:42 -070021#endif
Andi Kleen70674f92006-03-28 01:56:33 -080022#define FRONTEND_STACK_ALLOC 256
23#define SELECT_STACK_ALLOC FRONTEND_STACK_ALLOC
24#define POLL_STACK_ALLOC FRONTEND_STACK_ALLOC
25#define WQUEUES_STACK_ALLOC (MAX_STACK_ALLOC - FRONTEND_STACK_ALLOC)
26#define N_INLINE_POLL_ENTRIES (WQUEUES_STACK_ALLOC / sizeof(struct poll_table_entry))
27
Alexey Dobriyandd23aae2007-09-11 15:23:55 -070028#define DEFAULT_POLLMASK (POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM)
29
Linus Torvalds1da177e2005-04-16 15:20:36 -070030struct poll_table_struct;
31
32/*
33 * structures and helpers for f_op->poll implementations
34 */
35typedef void (*poll_queue_proc)(struct file *, wait_queue_head_t *, struct poll_table_struct *);
36
Hans Verkuil626cf232012-03-23 15:02:27 -070037/*
38 * Do not touch the structure directly, use the access functions
39 * poll_does_not_wait() and poll_requested_events() instead.
40 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070041typedef struct poll_table_struct {
Hans Verkuil626cf232012-03-23 15:02:27 -070042 poll_queue_proc _qproc;
43 unsigned long _key;
Linus Torvalds1da177e2005-04-16 15:20:36 -070044} poll_table;
45
46static inline void poll_wait(struct file * filp, wait_queue_head_t * wait_address, poll_table *p)
47{
Hans Verkuil626cf232012-03-23 15:02:27 -070048 if (p && p->_qproc && wait_address)
49 p->_qproc(filp, wait_address, p);
50}
51
52/*
53 * Return true if it is guaranteed that poll will not wait. This is the case
54 * if the poll() of another file descriptor in the set got an event, so there
55 * is no need for waiting.
56 */
57static inline bool poll_does_not_wait(const poll_table *p)
58{
59 return p == NULL || p->_qproc == NULL;
60}
61
62/*
63 * Return the set of events that the application wants to poll for.
64 * This is useful for drivers that need to know whether a DMA transfer has
65 * to be started implicitly on poll(). You typically only want to do that
66 * if the application is actually polling for POLLIN and/or POLLOUT.
67 */
68static inline unsigned long poll_requested_events(const poll_table *p)
69{
70 return p ? p->_key : ~0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -070071}
72
73static inline void init_poll_funcptr(poll_table *pt, poll_queue_proc qproc)
74{
Hans Verkuil626cf232012-03-23 15:02:27 -070075 pt->_qproc = qproc;
76 pt->_key = ~0UL; /* all events enabled */
Linus Torvalds1da177e2005-04-16 15:20:36 -070077}
78
Andi Kleen70674f92006-03-28 01:56:33 -080079struct poll_table_entry {
Tejun Heo5f820f62009-01-06 14:40:59 -080080 struct file *filp;
Eric Dumazet4938d7e2009-06-16 15:33:36 -070081 unsigned long key;
Andi Kleen70674f92006-03-28 01:56:33 -080082 wait_queue_t wait;
Tejun Heo5f820f62009-01-06 14:40:59 -080083 wait_queue_head_t *wait_address;
Andi Kleen70674f92006-03-28 01:56:33 -080084};
85
Linus Torvalds1da177e2005-04-16 15:20:36 -070086/*
Namhyung Kimdac36dd2010-12-10 01:57:07 +090087 * Structures and helpers for select/poll syscall
Linus Torvalds1da177e2005-04-16 15:20:36 -070088 */
89struct poll_wqueues {
90 poll_table pt;
Tejun Heo5f820f62009-01-06 14:40:59 -080091 struct poll_table_page *table;
92 struct task_struct *polling_task;
93 int triggered;
Linus Torvalds1da177e2005-04-16 15:20:36 -070094 int error;
Andi Kleen70674f92006-03-28 01:56:33 -080095 int inline_index;
96 struct poll_table_entry inline_entries[N_INLINE_POLL_ENTRIES];
Linus Torvalds1da177e2005-04-16 15:20:36 -070097};
98
99extern void poll_initwait(struct poll_wqueues *pwq);
100extern void poll_freewait(struct poll_wqueues *pwq);
Tejun Heo5f820f62009-01-06 14:40:59 -0800101extern int poll_schedule_timeout(struct poll_wqueues *pwq, int state,
102 ktime_t *expires, unsigned long slack);
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700103extern u64 select_estimate_accuracy(struct timespec64 *tv);
Shawn Bohrer95aac7b2010-10-27 15:34:54 -0700104
Tejun Heo5f820f62009-01-06 14:40:59 -0800105
106static inline int poll_schedule(struct poll_wqueues *pwq, int state)
107{
108 return poll_schedule_timeout(pwq, state, NULL, 0);
109}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110
111/*
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300112 * Scalable version of the fd_set.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 */
114
115typedef struct {
116 unsigned long *in, *out, *ex;
117 unsigned long *res_in, *res_out, *res_ex;
118} fd_set_bits;
119
120/*
121 * How many longwords for "nr" bits?
122 */
123#define FDS_BITPERLONG (8*sizeof(long))
124#define FDS_LONGS(nr) (((nr)+FDS_BITPERLONG-1)/FDS_BITPERLONG)
125#define FDS_BYTES(nr) (FDS_LONGS(nr)*sizeof(long))
126
127/*
128 * We do a VERIFY_WRITE here even though we are only reading this time:
129 * we'll write to it eventually..
130 *
131 * Use "unsigned long" accesses to let user-mode fd_set's be long-aligned.
132 */
133static inline
134int get_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
135{
136 nr = FDS_BYTES(nr);
137 if (ufdset)
138 return copy_from_user(fdset, ufdset, nr) ? -EFAULT : 0;
139
140 memset(fdset, 0, nr);
141 return 0;
142}
143
144static inline unsigned long __must_check
145set_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
146{
147 if (ufdset)
148 return __copy_to_user(ufdset, fdset, FDS_BYTES(nr));
149 return 0;
150}
151
152static inline
153void zero_fd_set(unsigned long nr, unsigned long *fdset)
154{
155 memset(fdset, 0, FDS_BYTES(nr));
156}
157
David Woodhouse9f729492006-01-18 17:44:05 -0800158#define MAX_INT64_SECONDS (((s64)(~((u64)0)>>1)/HZ)-1)
159
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700160extern int do_select(int n, fd_set_bits *fds, struct timespec64 *end_time);
David Woodhouse9f729492006-01-18 17:44:05 -0800161extern int do_sys_poll(struct pollfd __user * ufds, unsigned int nfds,
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700162 struct timespec64 *end_time);
Al Viroa2dcb442008-04-23 14:05:15 -0400163extern int core_sys_select(int n, fd_set __user *inp, fd_set __user *outp,
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700164 fd_set __user *exp, struct timespec64 *end_time);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700166extern int poll_select_set_timeout(struct timespec64 *to, time64_t sec,
167 long nsec);
Thomas Gleixnerb773ad42008-08-31 08:16:57 -0700168
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169#endif /* _LINUX_POLL_H */