blob: 37b057b63b465afa0edf3e372cb561d7670a3089 [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. */
17#define MAX_STACK_ALLOC 832
18#define FRONTEND_STACK_ALLOC 256
19#define SELECT_STACK_ALLOC FRONTEND_STACK_ALLOC
20#define POLL_STACK_ALLOC FRONTEND_STACK_ALLOC
21#define WQUEUES_STACK_ALLOC (MAX_STACK_ALLOC - FRONTEND_STACK_ALLOC)
22#define N_INLINE_POLL_ENTRIES (WQUEUES_STACK_ALLOC / sizeof(struct poll_table_entry))
23
Alexey Dobriyandd23aae2007-09-11 15:23:55 -070024#define DEFAULT_POLLMASK (POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM)
25
Linus Torvalds1da177e2005-04-16 15:20:36 -070026struct poll_table_struct;
27
28/*
29 * structures and helpers for f_op->poll implementations
30 */
31typedef void (*poll_queue_proc)(struct file *, wait_queue_head_t *, struct poll_table_struct *);
32
Hans Verkuil626cf232012-03-23 15:02:27 -070033/*
34 * Do not touch the structure directly, use the access functions
35 * poll_does_not_wait() and poll_requested_events() instead.
36 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070037typedef struct poll_table_struct {
Hans Verkuil626cf232012-03-23 15:02:27 -070038 poll_queue_proc _qproc;
39 unsigned long _key;
Linus Torvalds1da177e2005-04-16 15:20:36 -070040} poll_table;
41
42static inline void poll_wait(struct file * filp, wait_queue_head_t * wait_address, poll_table *p)
43{
Hans Verkuil626cf232012-03-23 15:02:27 -070044 if (p && p->_qproc && wait_address)
45 p->_qproc(filp, wait_address, p);
46}
47
48/*
49 * Return true if it is guaranteed that poll will not wait. This is the case
50 * if the poll() of another file descriptor in the set got an event, so there
51 * is no need for waiting.
52 */
53static inline bool poll_does_not_wait(const poll_table *p)
54{
55 return p == NULL || p->_qproc == NULL;
56}
57
58/*
59 * Return the set of events that the application wants to poll for.
60 * This is useful for drivers that need to know whether a DMA transfer has
61 * to be started implicitly on poll(). You typically only want to do that
62 * if the application is actually polling for POLLIN and/or POLLOUT.
63 */
64static inline unsigned long poll_requested_events(const poll_table *p)
65{
66 return p ? p->_key : ~0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -070067}
68
69static inline void init_poll_funcptr(poll_table *pt, poll_queue_proc qproc)
70{
Hans Verkuil626cf232012-03-23 15:02:27 -070071 pt->_qproc = qproc;
72 pt->_key = ~0UL; /* all events enabled */
Linus Torvalds1da177e2005-04-16 15:20:36 -070073}
74
Andi Kleen70674f92006-03-28 01:56:33 -080075struct poll_table_entry {
Tejun Heo5f820f62009-01-06 14:40:59 -080076 struct file *filp;
Eric Dumazet4938d7e2009-06-16 15:33:36 -070077 unsigned long key;
Andi Kleen70674f92006-03-28 01:56:33 -080078 wait_queue_t wait;
Tejun Heo5f820f62009-01-06 14:40:59 -080079 wait_queue_head_t *wait_address;
Andi Kleen70674f92006-03-28 01:56:33 -080080};
81
Linus Torvalds1da177e2005-04-16 15:20:36 -070082/*
Namhyung Kimdac36dd2010-12-10 01:57:07 +090083 * Structures and helpers for select/poll syscall
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 */
85struct poll_wqueues {
86 poll_table pt;
Tejun Heo5f820f62009-01-06 14:40:59 -080087 struct poll_table_page *table;
88 struct task_struct *polling_task;
89 int triggered;
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 int error;
Andi Kleen70674f92006-03-28 01:56:33 -080091 int inline_index;
92 struct poll_table_entry inline_entries[N_INLINE_POLL_ENTRIES];
Linus Torvalds1da177e2005-04-16 15:20:36 -070093};
94
95extern void poll_initwait(struct poll_wqueues *pwq);
96extern void poll_freewait(struct poll_wqueues *pwq);
Tejun Heo5f820f62009-01-06 14:40:59 -080097extern int poll_schedule_timeout(struct poll_wqueues *pwq, int state,
98 ktime_t *expires, unsigned long slack);
Deepa Dinamani766b9f92016-05-19 17:09:05 -070099extern u64 select_estimate_accuracy(struct timespec64 *tv);
Shawn Bohrer95aac7b2010-10-27 15:34:54 -0700100
Tejun Heo5f820f62009-01-06 14:40:59 -0800101
102static inline int poll_schedule(struct poll_wqueues *pwq, int state)
103{
104 return poll_schedule_timeout(pwq, state, NULL, 0);
105}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106
107/*
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300108 * Scalable version of the fd_set.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109 */
110
111typedef struct {
112 unsigned long *in, *out, *ex;
113 unsigned long *res_in, *res_out, *res_ex;
114} fd_set_bits;
115
116/*
117 * How many longwords for "nr" bits?
118 */
119#define FDS_BITPERLONG (8*sizeof(long))
120#define FDS_LONGS(nr) (((nr)+FDS_BITPERLONG-1)/FDS_BITPERLONG)
121#define FDS_BYTES(nr) (FDS_LONGS(nr)*sizeof(long))
122
123/*
124 * We do a VERIFY_WRITE here even though we are only reading this time:
125 * we'll write to it eventually..
126 *
127 * Use "unsigned long" accesses to let user-mode fd_set's be long-aligned.
128 */
129static inline
130int get_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
131{
132 nr = FDS_BYTES(nr);
133 if (ufdset)
134 return copy_from_user(fdset, ufdset, nr) ? -EFAULT : 0;
135
136 memset(fdset, 0, nr);
137 return 0;
138}
139
140static inline unsigned long __must_check
141set_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
142{
143 if (ufdset)
144 return __copy_to_user(ufdset, fdset, FDS_BYTES(nr));
145 return 0;
146}
147
148static inline
149void zero_fd_set(unsigned long nr, unsigned long *fdset)
150{
151 memset(fdset, 0, FDS_BYTES(nr));
152}
153
David Woodhouse9f729492006-01-18 17:44:05 -0800154#define MAX_INT64_SECONDS (((s64)(~((u64)0)>>1)/HZ)-1)
155
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700156extern int do_select(int n, fd_set_bits *fds, struct timespec64 *end_time);
David Woodhouse9f729492006-01-18 17:44:05 -0800157extern int do_sys_poll(struct pollfd __user * ufds, unsigned int nfds,
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700158 struct timespec64 *end_time);
Al Viroa2dcb442008-04-23 14:05:15 -0400159extern int core_sys_select(int n, fd_set __user *inp, fd_set __user *outp,
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700160 fd_set __user *exp, struct timespec64 *end_time);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161
Deepa Dinamani766b9f92016-05-19 17:09:05 -0700162extern int poll_select_set_timeout(struct timespec64 *to, time64_t sec,
163 long nsec);
Thomas Gleixnerb773ad42008-08-31 08:16:57 -0700164
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165#endif /* _LINUX_POLL_H */