]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
5071f97e DL |
2 | * fs/eventpoll.c (Efficient event retrieval implementation) |
3 | * Copyright (C) 2001,...,2009 Davide Libenzi | |
1da177e4 LT |
4 | * |
5 | * This program is free software; you can redistribute it and/or modify | |
6 | * it under the terms of the GNU General Public License as published by | |
7 | * the Free Software Foundation; either version 2 of the License, or | |
8 | * (at your option) any later version. | |
9 | * | |
10 | * Davide Libenzi <davidel@xmailserver.org> | |
11 | * | |
12 | */ | |
13 | ||
1da177e4 LT |
14 | #include <linux/init.h> |
15 | #include <linux/kernel.h> | |
174cd4b1 | 16 | #include <linux/sched/signal.h> |
1da177e4 LT |
17 | #include <linux/fs.h> |
18 | #include <linux/file.h> | |
19 | #include <linux/signal.h> | |
20 | #include <linux/errno.h> | |
21 | #include <linux/mm.h> | |
22 | #include <linux/slab.h> | |
23 | #include <linux/poll.h> | |
1da177e4 LT |
24 | #include <linux/string.h> |
25 | #include <linux/list.h> | |
26 | #include <linux/hash.h> | |
27 | #include <linux/spinlock.h> | |
28 | #include <linux/syscalls.h> | |
1da177e4 LT |
29 | #include <linux/rbtree.h> |
30 | #include <linux/wait.h> | |
31 | #include <linux/eventpoll.h> | |
32 | #include <linux/mount.h> | |
33 | #include <linux/bitops.h> | |
144efe3e | 34 | #include <linux/mutex.h> |
da66f7cb | 35 | #include <linux/anon_inodes.h> |
4d7e30d9 | 36 | #include <linux/device.h> |
7c0f6ba6 | 37 | #include <linux/uaccess.h> |
1da177e4 LT |
38 | #include <asm/io.h> |
39 | #include <asm/mman.h> | |
60063497 | 40 | #include <linux/atomic.h> |
138d22b5 CG |
41 | #include <linux/proc_fs.h> |
42 | #include <linux/seq_file.h> | |
35280bd4 | 43 | #include <linux/compat.h> |
ae10b2b4 | 44 | #include <linux/rculist.h> |
bf3b9f63 | 45 | #include <net/busy_poll.h> |
1da177e4 | 46 | |
1da177e4 LT |
47 | /* |
48 | * LOCKING: | |
49 | * There are three level of locking required by epoll : | |
50 | * | |
144efe3e | 51 | * 1) epmutex (mutex) |
c7ea7630 DL |
52 | * 2) ep->mtx (mutex) |
53 | * 3) ep->lock (spinlock) | |
1da177e4 LT |
54 | * |
55 | * The acquire order is the one listed above, from 1 to 3. | |
56 | * We need a spinlock (ep->lock) because we manipulate objects | |
57 | * from inside the poll callback, that might be triggered from | |
58 | * a wake_up() that in turn might be called from IRQ context. | |
59 | * So we can't sleep inside the poll callback and hence we need | |
60 | * a spinlock. During the event transfer loop (from kernel to | |
61 | * user space) we could end up sleeping due a copy_to_user(), so | |
62 | * we need a lock that will allow us to sleep. This lock is a | |
d47de16c DL |
63 | * mutex (ep->mtx). It is acquired during the event transfer loop, |
64 | * during epoll_ctl(EPOLL_CTL_DEL) and during eventpoll_release_file(). | |
65 | * Then we also need a global mutex to serialize eventpoll_release_file() | |
66 | * and ep_free(). | |
67 | * This mutex is acquired by ep_free() during the epoll file | |
1da177e4 LT |
68 | * cleanup path and it is also acquired by eventpoll_release_file() |
69 | * if a file has been pushed inside an epoll set and it is then | |
bf6a41db | 70 | * close()d without a previous call to epoll_ctl(EPOLL_CTL_DEL). |
22bacca4 DL |
71 | * It is also acquired when inserting an epoll fd onto another epoll |
72 | * fd. We do this so that we walk the epoll tree and ensure that this | |
73 | * insertion does not create a cycle of epoll file descriptors, which | |
74 | * could lead to deadlock. We need a global mutex to prevent two | |
75 | * simultaneous inserts (A into B and B into A) from racing and | |
76 | * constructing a cycle without either insert observing that it is | |
77 | * going to. | |
d8805e63 NE |
78 | * It is necessary to acquire multiple "ep->mtx"es at once in the |
79 | * case when one epoll fd is added to another. In this case, we | |
80 | * always acquire the locks in the order of nesting (i.e. after | |
81 | * epoll_ctl(e1, EPOLL_CTL_ADD, e2), e1->mtx will always be acquired | |
82 | * before e2->mtx). Since we disallow cycles of epoll file | |
83 | * descriptors, this ensures that the mutexes are well-ordered. In | |
84 | * order to communicate this nesting to lockdep, when walking a tree | |
85 | * of epoll file descriptors, we use the current recursion depth as | |
86 | * the lockdep subkey. | |
d47de16c DL |
87 | * It is possible to drop the "ep->mtx" and to use the global |
88 | * mutex "epmutex" (together with "ep->lock") to have it working, | |
89 | * but having "ep->mtx" will make the interface more scalable. | |
144efe3e | 90 | * Events that require holding "epmutex" are very rare, while for |
d47de16c DL |
91 | * normal operations the epoll private "ep->mtx" will guarantee |
92 | * a better scalability. | |
1da177e4 LT |
93 | */ |
94 | ||
1da177e4 | 95 | /* Epoll private bits inside the event mask */ |
df0108c5 | 96 | #define EP_PRIVATE_BITS (EPOLLWAKEUP | EPOLLONESHOT | EPOLLET | EPOLLEXCLUSIVE) |
1da177e4 | 97 | |
a9a08845 | 98 | #define EPOLLINOUT_BITS (EPOLLIN | EPOLLOUT) |
b6a515c8 | 99 | |
a9a08845 | 100 | #define EPOLLEXCLUSIVE_OK_BITS (EPOLLINOUT_BITS | EPOLLERR | EPOLLHUP | \ |
b6a515c8 JB |
101 | EPOLLWAKEUP | EPOLLET | EPOLLEXCLUSIVE) |
102 | ||
5071f97e DL |
103 | /* Maximum number of nesting allowed inside epoll sets */ |
104 | #define EP_MAX_NESTS 4 | |
1da177e4 | 105 | |
b611967d DL |
106 | #define EP_MAX_EVENTS (INT_MAX / sizeof(struct epoll_event)) |
107 | ||
d47de16c DL |
108 | #define EP_UNACTIVE_PTR ((void *) -1L) |
109 | ||
7ef9964e DL |
110 | #define EP_ITEM_COST (sizeof(struct epitem) + sizeof(struct eppoll_entry)) |
111 | ||
1da177e4 LT |
112 | struct epoll_filefd { |
113 | struct file *file; | |
114 | int fd; | |
39732ca5 | 115 | } __packed; |
1da177e4 LT |
116 | |
117 | /* | |
5071f97e DL |
118 | * Structure used to track possible nested calls, for too deep recursions |
119 | * and loop cycles. | |
1da177e4 | 120 | */ |
5071f97e | 121 | struct nested_call_node { |
1da177e4 | 122 | struct list_head llink; |
5071f97e | 123 | void *cookie; |
3fe4a975 | 124 | void *ctx; |
1da177e4 LT |
125 | }; |
126 | ||
127 | /* | |
5071f97e DL |
128 | * This structure is used as collector for nested calls, to check for |
129 | * maximum recursion dept and loop cycles. | |
1da177e4 | 130 | */ |
5071f97e DL |
131 | struct nested_calls { |
132 | struct list_head tasks_call_list; | |
1da177e4 LT |
133 | spinlock_t lock; |
134 | }; | |
135 | ||
d47de16c DL |
136 | /* |
137 | * Each file descriptor added to the eventpoll interface will | |
138 | * have an entry of this type linked to the "rbr" RB tree. | |
39732ca5 EW |
139 | * Avoid increasing the size of this struct, there can be many thousands |
140 | * of these on a server and we do not want this to take another cache line. | |
d47de16c DL |
141 | */ |
142 | struct epitem { | |
ae10b2b4 JB |
143 | union { |
144 | /* RB tree node links this structure to the eventpoll RB tree */ | |
145 | struct rb_node rbn; | |
146 | /* Used to free the struct epitem */ | |
147 | struct rcu_head rcu; | |
148 | }; | |
d47de16c DL |
149 | |
150 | /* List header used to link this structure to the eventpoll ready list */ | |
151 | struct list_head rdllink; | |
152 | ||
c7ea7630 DL |
153 | /* |
154 | * Works together "struct eventpoll"->ovflist in keeping the | |
155 | * single linked chain of items. | |
156 | */ | |
157 | struct epitem *next; | |
158 | ||
d47de16c DL |
159 | /* The file descriptor information this item refers to */ |
160 | struct epoll_filefd ffd; | |
161 | ||
162 | /* Number of active wait queue attached to poll operations */ | |
163 | int nwait; | |
164 | ||
165 | /* List containing poll wait queues */ | |
166 | struct list_head pwqlist; | |
167 | ||
168 | /* The "container" of this item */ | |
169 | struct eventpoll *ep; | |
170 | ||
d47de16c DL |
171 | /* List header used to link this item to the "struct file" items list */ |
172 | struct list_head fllink; | |
173 | ||
4d7e30d9 | 174 | /* wakeup_source used when EPOLLWAKEUP is set */ |
eea1d585 | 175 | struct wakeup_source __rcu *ws; |
4d7e30d9 | 176 | |
c7ea7630 DL |
177 | /* The structure that describe the interested events and the source fd */ |
178 | struct epoll_event event; | |
d47de16c DL |
179 | }; |
180 | ||
1da177e4 LT |
181 | /* |
182 | * This structure is stored inside the "private_data" member of the file | |
bf6a41db | 183 | * structure and represents the main data structure for the eventpoll |
1da177e4 LT |
184 | * interface. |
185 | */ | |
186 | struct eventpoll { | |
bf6a41db | 187 | /* Protect the access to this structure */ |
c7ea7630 | 188 | spinlock_t lock; |
1da177e4 LT |
189 | |
190 | /* | |
d47de16c DL |
191 | * This mutex is used to ensure that files are not removed |
192 | * while epoll is using them. This is held during the event | |
193 | * collection loop, the file cleanup path, the epoll file exit | |
194 | * code and the ctl operations. | |
1da177e4 | 195 | */ |
d47de16c | 196 | struct mutex mtx; |
1da177e4 LT |
197 | |
198 | /* Wait queue used by sys_epoll_wait() */ | |
199 | wait_queue_head_t wq; | |
200 | ||
201 | /* Wait queue used by file->poll() */ | |
202 | wait_queue_head_t poll_wait; | |
203 | ||
204 | /* List of ready file descriptors */ | |
205 | struct list_head rdllist; | |
206 | ||
67647d0f | 207 | /* RB tree root used to store monitored fd structs */ |
b2ac2ea6 | 208 | struct rb_root_cached rbr; |
d47de16c DL |
209 | |
210 | /* | |
211 | * This is a single linked list that chains all the "struct epitem" that | |
25985edc | 212 | * happened while transferring ready events to userspace w/out |
d47de16c DL |
213 | * holding ->lock. |
214 | */ | |
215 | struct epitem *ovflist; | |
7ef9964e | 216 | |
4d7e30d9 AH |
217 | /* wakeup_source used when ep_scan_ready_list is running */ |
218 | struct wakeup_source *ws; | |
219 | ||
7ef9964e DL |
220 | /* The user that created the eventpoll descriptor */ |
221 | struct user_struct *user; | |
28d82dc1 JB |
222 | |
223 | struct file *file; | |
224 | ||
225 | /* used to optimize loop detection check */ | |
226 | int visited; | |
227 | struct list_head visited_list_link; | |
bf3b9f63 SS |
228 | |
229 | #ifdef CONFIG_NET_RX_BUSY_POLL | |
230 | /* used to track busy poll napi_id */ | |
231 | unsigned int napi_id; | |
232 | #endif | |
1da177e4 LT |
233 | }; |
234 | ||
235 | /* Wait structure used by the poll hooks */ | |
236 | struct eppoll_entry { | |
237 | /* List header used to link this structure to the "struct epitem" */ | |
238 | struct list_head llink; | |
239 | ||
240 | /* The "base" pointer is set to the container "struct epitem" */ | |
4f0989db | 241 | struct epitem *base; |
1da177e4 LT |
242 | |
243 | /* | |
244 | * Wait queue item that will be linked to the target file wait | |
245 | * queue head. | |
246 | */ | |
ac6424b9 | 247 | wait_queue_entry_t wait; |
1da177e4 LT |
248 | |
249 | /* The wait queue head that linked the "wait" wait queue item */ | |
250 | wait_queue_head_t *whead; | |
251 | }; | |
252 | ||
1da177e4 LT |
253 | /* Wrapper struct used by poll queueing */ |
254 | struct ep_pqueue { | |
255 | poll_table pt; | |
256 | struct epitem *epi; | |
257 | }; | |
258 | ||
5071f97e DL |
259 | /* Used by the ep_send_events() function as callback private data */ |
260 | struct ep_send_events_data { | |
261 | int maxevents; | |
262 | struct epoll_event __user *events; | |
d7ebbe46 | 263 | int res; |
5071f97e DL |
264 | }; |
265 | ||
7ef9964e DL |
266 | /* |
267 | * Configuration options available inside /proc/sys/fs/epoll/ | |
268 | */ | |
7ef9964e | 269 | /* Maximum number of epoll watched descriptors, per user */ |
52bd19f7 | 270 | static long max_user_watches __read_mostly; |
7ef9964e | 271 | |
1da177e4 | 272 | /* |
d47de16c | 273 | * This mutex is used to serialize ep_free() and eventpoll_release_file(). |
1da177e4 | 274 | */ |
7ef9964e | 275 | static DEFINE_MUTEX(epmutex); |
1da177e4 | 276 | |
22bacca4 DL |
277 | /* Used to check for epoll file descriptor inclusion loops */ |
278 | static struct nested_calls poll_loop_ncalls; | |
279 | ||
1da177e4 | 280 | /* Slab cache used to allocate "struct epitem" */ |
e18b890b | 281 | static struct kmem_cache *epi_cache __read_mostly; |
1da177e4 LT |
282 | |
283 | /* Slab cache used to allocate "struct eppoll_entry" */ | |
e18b890b | 284 | static struct kmem_cache *pwq_cache __read_mostly; |
1da177e4 | 285 | |
28d82dc1 JB |
286 | /* Visited nodes during ep_loop_check(), so we can unset them when we finish */ |
287 | static LIST_HEAD(visited_list); | |
288 | ||
289 | /* | |
290 | * List of files with newly added links, where we may need to limit the number | |
291 | * of emanating paths. Protected by the epmutex. | |
292 | */ | |
293 | static LIST_HEAD(tfile_check_list); | |
294 | ||
7ef9964e DL |
295 | #ifdef CONFIG_SYSCTL |
296 | ||
297 | #include <linux/sysctl.h> | |
298 | ||
52bd19f7 RH |
299 | static long zero; |
300 | static long long_max = LONG_MAX; | |
7ef9964e | 301 | |
1f7e0616 | 302 | struct ctl_table epoll_table[] = { |
7ef9964e DL |
303 | { |
304 | .procname = "max_user_watches", | |
305 | .data = &max_user_watches, | |
52bd19f7 | 306 | .maxlen = sizeof(max_user_watches), |
7ef9964e | 307 | .mode = 0644, |
52bd19f7 | 308 | .proc_handler = proc_doulongvec_minmax, |
7ef9964e | 309 | .extra1 = &zero, |
52bd19f7 | 310 | .extra2 = &long_max, |
7ef9964e | 311 | }, |
ab09203e | 312 | { } |
7ef9964e DL |
313 | }; |
314 | #endif /* CONFIG_SYSCTL */ | |
315 | ||
28d82dc1 JB |
316 | static const struct file_operations eventpoll_fops; |
317 | ||
318 | static inline int is_file_epoll(struct file *f) | |
319 | { | |
320 | return f->f_op == &eventpoll_fops; | |
321 | } | |
b030a4dd | 322 | |
67647d0f | 323 | /* Setup the structure that is used as key for the RB tree */ |
b030a4dd PE |
324 | static inline void ep_set_ffd(struct epoll_filefd *ffd, |
325 | struct file *file, int fd) | |
326 | { | |
327 | ffd->file = file; | |
328 | ffd->fd = fd; | |
329 | } | |
330 | ||
67647d0f | 331 | /* Compare RB tree keys */ |
b030a4dd PE |
332 | static inline int ep_cmp_ffd(struct epoll_filefd *p1, |
333 | struct epoll_filefd *p2) | |
334 | { | |
335 | return (p1->file > p2->file ? +1: | |
336 | (p1->file < p2->file ? -1 : p1->fd - p2->fd)); | |
337 | } | |
338 | ||
b030a4dd PE |
339 | /* Tells us if the item is currently linked */ |
340 | static inline int ep_is_linked(struct list_head *p) | |
341 | { | |
342 | return !list_empty(p); | |
343 | } | |
344 | ||
ac6424b9 | 345 | static inline struct eppoll_entry *ep_pwq_from_wait(wait_queue_entry_t *p) |
971316f0 ON |
346 | { |
347 | return container_of(p, struct eppoll_entry, wait); | |
348 | } | |
349 | ||
b030a4dd | 350 | /* Get the "struct epitem" from a wait queue pointer */ |
ac6424b9 | 351 | static inline struct epitem *ep_item_from_wait(wait_queue_entry_t *p) |
b030a4dd PE |
352 | { |
353 | return container_of(p, struct eppoll_entry, wait)->base; | |
354 | } | |
355 | ||
356 | /* Get the "struct epitem" from an epoll queue wrapper */ | |
cdac75e6 | 357 | static inline struct epitem *ep_item_from_epqueue(poll_table *p) |
b030a4dd PE |
358 | { |
359 | return container_of(p, struct ep_pqueue, pt)->epi; | |
360 | } | |
361 | ||
362 | /* Tells if the epoll_ctl(2) operation needs an event copy from userspace */ | |
6192bd53 | 363 | static inline int ep_op_has_event(int op) |
b030a4dd | 364 | { |
a80a6b85 | 365 | return op != EPOLL_CTL_DEL; |
b030a4dd PE |
366 | } |
367 | ||
1da177e4 | 368 | /* Initialize the poll safe wake up structure */ |
5071f97e | 369 | static void ep_nested_calls_init(struct nested_calls *ncalls) |
1da177e4 | 370 | { |
5071f97e DL |
371 | INIT_LIST_HEAD(&ncalls->tasks_call_list); |
372 | spin_lock_init(&ncalls->lock); | |
1da177e4 LT |
373 | } |
374 | ||
3fb0e584 DL |
375 | /** |
376 | * ep_events_available - Checks if ready events might be available. | |
377 | * | |
378 | * @ep: Pointer to the eventpoll context. | |
379 | * | |
380 | * Returns: Returns a value different than zero if ready events are available, | |
381 | * or zero otherwise. | |
382 | */ | |
383 | static inline int ep_events_available(struct eventpoll *ep) | |
384 | { | |
385 | return !list_empty(&ep->rdllist) || ep->ovflist != EP_UNACTIVE_PTR; | |
386 | } | |
387 | ||
bf3b9f63 SS |
388 | #ifdef CONFIG_NET_RX_BUSY_POLL |
389 | static bool ep_busy_loop_end(void *p, unsigned long start_time) | |
390 | { | |
391 | struct eventpoll *ep = p; | |
392 | ||
393 | return ep_events_available(ep) || busy_loop_timeout(start_time); | |
394 | } | |
395 | #endif /* CONFIG_NET_RX_BUSY_POLL */ | |
396 | ||
397 | /* | |
398 | * Busy poll if globally on and supporting sockets found && no events, | |
399 | * busy loop will return if need_resched or ep_events_available. | |
400 | * | |
401 | * we must do our busy polling with irqs enabled | |
402 | */ | |
403 | static void ep_busy_loop(struct eventpoll *ep, int nonblock) | |
404 | { | |
405 | #ifdef CONFIG_NET_RX_BUSY_POLL | |
406 | unsigned int napi_id = READ_ONCE(ep->napi_id); | |
407 | ||
408 | if ((napi_id >= MIN_NAPI_ID) && net_busy_loop_on()) | |
409 | napi_busy_loop(napi_id, nonblock ? NULL : ep_busy_loop_end, ep); | |
410 | #endif | |
411 | } | |
412 | ||
413 | static inline void ep_reset_busy_poll_napi_id(struct eventpoll *ep) | |
414 | { | |
415 | #ifdef CONFIG_NET_RX_BUSY_POLL | |
416 | if (ep->napi_id) | |
417 | ep->napi_id = 0; | |
418 | #endif | |
419 | } | |
420 | ||
421 | /* | |
422 | * Set epoll busy poll NAPI ID from sk. | |
423 | */ | |
424 | static inline void ep_set_busy_poll_napi_id(struct epitem *epi) | |
425 | { | |
426 | #ifdef CONFIG_NET_RX_BUSY_POLL | |
427 | struct eventpoll *ep; | |
428 | unsigned int napi_id; | |
429 | struct socket *sock; | |
430 | struct sock *sk; | |
431 | int err; | |
432 | ||
433 | if (!net_busy_loop_on()) | |
434 | return; | |
435 | ||
436 | sock = sock_from_file(epi->ffd.file, &err); | |
437 | if (!sock) | |
438 | return; | |
439 | ||
440 | sk = sock->sk; | |
441 | if (!sk) | |
442 | return; | |
443 | ||
444 | napi_id = READ_ONCE(sk->sk_napi_id); | |
445 | ep = epi->ep; | |
446 | ||
447 | /* Non-NAPI IDs can be rejected | |
448 | * or | |
449 | * Nothing to do if we already have this ID | |
450 | */ | |
451 | if (napi_id < MIN_NAPI_ID || napi_id == ep->napi_id) | |
452 | return; | |
453 | ||
454 | /* record NAPI ID for use in next busy poll */ | |
455 | ep->napi_id = napi_id; | |
456 | #endif | |
457 | } | |
458 | ||
5071f97e DL |
459 | /** |
460 | * ep_call_nested - Perform a bound (possibly) nested call, by checking | |
461 | * that the recursion limit is not exceeded, and that | |
462 | * the same nested call (by the meaning of same cookie) is | |
463 | * no re-entered. | |
464 | * | |
465 | * @ncalls: Pointer to the nested_calls structure to be used for this call. | |
466 | * @max_nests: Maximum number of allowed nesting calls. | |
467 | * @nproc: Nested call core function pointer. | |
468 | * @priv: Opaque data to be passed to the @nproc callback. | |
469 | * @cookie: Cookie to be used to identify this nested call. | |
3fe4a975 | 470 | * @ctx: This instance context. |
5071f97e DL |
471 | * |
472 | * Returns: Returns the code returned by the @nproc callback, or -1 if | |
473 | * the maximum recursion limit has been exceeded. | |
1da177e4 | 474 | */ |
5071f97e DL |
475 | static int ep_call_nested(struct nested_calls *ncalls, int max_nests, |
476 | int (*nproc)(void *, void *, int), void *priv, | |
3fe4a975 | 477 | void *cookie, void *ctx) |
1da177e4 | 478 | { |
5071f97e | 479 | int error, call_nests = 0; |
1da177e4 | 480 | unsigned long flags; |
5071f97e DL |
481 | struct list_head *lsthead = &ncalls->tasks_call_list; |
482 | struct nested_call_node *tncur; | |
483 | struct nested_call_node tnode; | |
1da177e4 | 484 | |
5071f97e | 485 | spin_lock_irqsave(&ncalls->lock, flags); |
1da177e4 | 486 | |
5071f97e DL |
487 | /* |
488 | * Try to see if the current task is already inside this wakeup call. | |
489 | * We use a list here, since the population inside this set is always | |
490 | * very much limited. | |
491 | */ | |
b70c3940 | 492 | list_for_each_entry(tncur, lsthead, llink) { |
3fe4a975 | 493 | if (tncur->ctx == ctx && |
5071f97e | 494 | (tncur->cookie == cookie || ++call_nests > max_nests)) { |
1da177e4 LT |
495 | /* |
496 | * Ops ... loop detected or maximum nest level reached. | |
497 | * We abort this wake by breaking the cycle itself. | |
498 | */ | |
abff55ce TB |
499 | error = -1; |
500 | goto out_unlock; | |
1da177e4 LT |
501 | } |
502 | } | |
503 | ||
5071f97e | 504 | /* Add the current task and cookie to the list */ |
3fe4a975 | 505 | tnode.ctx = ctx; |
5071f97e | 506 | tnode.cookie = cookie; |
1da177e4 LT |
507 | list_add(&tnode.llink, lsthead); |
508 | ||
5071f97e | 509 | spin_unlock_irqrestore(&ncalls->lock, flags); |
1da177e4 | 510 | |
5071f97e DL |
511 | /* Call the nested function */ |
512 | error = (*nproc)(priv, cookie, call_nests); | |
1da177e4 LT |
513 | |
514 | /* Remove the current task from the list */ | |
5071f97e | 515 | spin_lock_irqsave(&ncalls->lock, flags); |
1da177e4 | 516 | list_del(&tnode.llink); |
3fe4a975 | 517 | out_unlock: |
5071f97e DL |
518 | spin_unlock_irqrestore(&ncalls->lock, flags); |
519 | ||
520 | return error; | |
521 | } | |
522 | ||
02edc6fc SR |
523 | /* |
524 | * As described in commit 0ccf831cb lockdep: annotate epoll | |
525 | * the use of wait queues used by epoll is done in a very controlled | |
526 | * manner. Wake ups can nest inside each other, but are never done | |
527 | * with the same locking. For example: | |
528 | * | |
529 | * dfd = socket(...); | |
530 | * efd1 = epoll_create(); | |
531 | * efd2 = epoll_create(); | |
532 | * epoll_ctl(efd1, EPOLL_CTL_ADD, dfd, ...); | |
533 | * epoll_ctl(efd2, EPOLL_CTL_ADD, efd1, ...); | |
534 | * | |
535 | * When a packet arrives to the device underneath "dfd", the net code will | |
536 | * issue a wake_up() on its poll wake list. Epoll (efd1) has installed a | |
537 | * callback wakeup entry on that queue, and the wake_up() performed by the | |
538 | * "dfd" net code will end up in ep_poll_callback(). At this point epoll | |
539 | * (efd1) notices that it may have some event ready, so it needs to wake up | |
540 | * the waiters on its poll wait list (efd2). So it calls ep_poll_safewake() | |
541 | * that ends up in another wake_up(), after having checked about the | |
542 | * recursion constraints. That are, no more than EP_MAX_POLLWAKE_NESTS, to | |
543 | * avoid stack blasting. | |
544 | * | |
545 | * When CONFIG_DEBUG_LOCK_ALLOC is enabled, make sure lockdep can handle | |
546 | * this special case of epoll. | |
547 | */ | |
2dfa4eea | 548 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
57a173bd JB |
549 | |
550 | static struct nested_calls poll_safewake_ncalls; | |
551 | ||
552 | static int ep_poll_wakeup_proc(void *priv, void *cookie, int call_nests) | |
2dfa4eea DL |
553 | { |
554 | unsigned long flags; | |
57a173bd | 555 | wait_queue_head_t *wqueue = (wait_queue_head_t *)cookie; |
2dfa4eea | 556 | |
57a173bd | 557 | spin_lock_irqsave_nested(&wqueue->lock, flags, call_nests + 1); |
a9a08845 | 558 | wake_up_locked_poll(wqueue, EPOLLIN); |
2dfa4eea | 559 | spin_unlock_irqrestore(&wqueue->lock, flags); |
2dfa4eea | 560 | |
5071f97e DL |
561 | return 0; |
562 | } | |
563 | ||
5071f97e DL |
564 | static void ep_poll_safewake(wait_queue_head_t *wq) |
565 | { | |
3fe4a975 DL |
566 | int this_cpu = get_cpu(); |
567 | ||
5071f97e | 568 | ep_call_nested(&poll_safewake_ncalls, EP_MAX_NESTS, |
3fe4a975 DL |
569 | ep_poll_wakeup_proc, NULL, wq, (void *) (long) this_cpu); |
570 | ||
571 | put_cpu(); | |
1da177e4 LT |
572 | } |
573 | ||
57a173bd JB |
574 | #else |
575 | ||
576 | static void ep_poll_safewake(wait_queue_head_t *wq) | |
577 | { | |
a9a08845 | 578 | wake_up_poll(wq, EPOLLIN); |
57a173bd JB |
579 | } |
580 | ||
581 | #endif | |
582 | ||
971316f0 ON |
583 | static void ep_remove_wait_queue(struct eppoll_entry *pwq) |
584 | { | |
585 | wait_queue_head_t *whead; | |
586 | ||
587 | rcu_read_lock(); | |
138e4ad6 ON |
588 | /* |
589 | * If it is cleared by POLLFREE, it should be rcu-safe. | |
590 | * If we read NULL we need a barrier paired with | |
591 | * smp_store_release() in ep_poll_callback(), otherwise | |
592 | * we rely on whead->lock. | |
593 | */ | |
594 | whead = smp_load_acquire(&pwq->whead); | |
971316f0 ON |
595 | if (whead) |
596 | remove_wait_queue(whead, &pwq->wait); | |
597 | rcu_read_unlock(); | |
598 | } | |
599 | ||
1da177e4 | 600 | /* |
d1bc90dd TB |
601 | * This function unregisters poll callbacks from the associated file |
602 | * descriptor. Must be called with "mtx" held (or "epmutex" if called from | |
603 | * ep_free). | |
1da177e4 | 604 | */ |
7699acd1 | 605 | static void ep_unregister_pollwait(struct eventpoll *ep, struct epitem *epi) |
1da177e4 | 606 | { |
7699acd1 DL |
607 | struct list_head *lsthead = &epi->pwqlist; |
608 | struct eppoll_entry *pwq; | |
1da177e4 | 609 | |
d1bc90dd TB |
610 | while (!list_empty(lsthead)) { |
611 | pwq = list_first_entry(lsthead, struct eppoll_entry, llink); | |
1da177e4 | 612 | |
d1bc90dd | 613 | list_del(&pwq->llink); |
971316f0 | 614 | ep_remove_wait_queue(pwq); |
d1bc90dd | 615 | kmem_cache_free(pwq_cache, pwq); |
1da177e4 | 616 | } |
1da177e4 LT |
617 | } |
618 | ||
eea1d585 EW |
619 | /* call only when ep->mtx is held */ |
620 | static inline struct wakeup_source *ep_wakeup_source(struct epitem *epi) | |
621 | { | |
622 | return rcu_dereference_check(epi->ws, lockdep_is_held(&epi->ep->mtx)); | |
623 | } | |
624 | ||
625 | /* call only when ep->mtx is held */ | |
626 | static inline void ep_pm_stay_awake(struct epitem *epi) | |
627 | { | |
628 | struct wakeup_source *ws = ep_wakeup_source(epi); | |
629 | ||
630 | if (ws) | |
631 | __pm_stay_awake(ws); | |
632 | } | |
633 | ||
634 | static inline bool ep_has_wakeup_source(struct epitem *epi) | |
635 | { | |
636 | return rcu_access_pointer(epi->ws) ? true : false; | |
637 | } | |
638 | ||
639 | /* call when ep->mtx cannot be held (ep_poll_callback) */ | |
640 | static inline void ep_pm_stay_awake_rcu(struct epitem *epi) | |
641 | { | |
642 | struct wakeup_source *ws; | |
643 | ||
644 | rcu_read_lock(); | |
645 | ws = rcu_dereference(epi->ws); | |
646 | if (ws) | |
647 | __pm_stay_awake(ws); | |
648 | rcu_read_unlock(); | |
649 | } | |
650 | ||
5071f97e DL |
651 | /** |
652 | * ep_scan_ready_list - Scans the ready list in a way that makes possible for | |
653 | * the scan code, to call f_op->poll(). Also allows for | |
654 | * O(NumReady) performance. | |
655 | * | |
656 | * @ep: Pointer to the epoll private data structure. | |
657 | * @sproc: Pointer to the scan callback. | |
658 | * @priv: Private opaque data passed to the @sproc callback. | |
d8805e63 | 659 | * @depth: The current depth of recursive f_op->poll calls. |
67347fe4 | 660 | * @ep_locked: caller already holds ep->mtx |
5071f97e DL |
661 | * |
662 | * Returns: The same integer error code returned by the @sproc callback. | |
663 | */ | |
d85e2aa2 AV |
664 | static __poll_t ep_scan_ready_list(struct eventpoll *ep, |
665 | __poll_t (*sproc)(struct eventpoll *, | |
5071f97e | 666 | struct list_head *, void *), |
67347fe4 | 667 | void *priv, int depth, bool ep_locked) |
5071f97e | 668 | { |
d85e2aa2 AV |
669 | __poll_t res; |
670 | int pwake = 0; | |
5071f97e DL |
671 | unsigned long flags; |
672 | struct epitem *epi, *nepi; | |
296e236e | 673 | LIST_HEAD(txlist); |
5071f97e DL |
674 | |
675 | /* | |
676 | * We need to lock this because we could be hit by | |
e057e15f | 677 | * eventpoll_release_file() and epoll_ctl(). |
5071f97e | 678 | */ |
67347fe4 JB |
679 | |
680 | if (!ep_locked) | |
681 | mutex_lock_nested(&ep->mtx, depth); | |
5071f97e DL |
682 | |
683 | /* | |
684 | * Steal the ready list, and re-init the original one to the | |
685 | * empty list. Also, set ep->ovflist to NULL so that events | |
686 | * happening while looping w/out locks, are not lost. We cannot | |
687 | * have the poll callback to queue directly on ep->rdllist, | |
688 | * because we want the "sproc" callback to be able to do it | |
689 | * in a lockless way. | |
690 | */ | |
691 | spin_lock_irqsave(&ep->lock, flags); | |
296e236e | 692 | list_splice_init(&ep->rdllist, &txlist); |
5071f97e DL |
693 | ep->ovflist = NULL; |
694 | spin_unlock_irqrestore(&ep->lock, flags); | |
695 | ||
696 | /* | |
697 | * Now call the callback function. | |
698 | */ | |
d85e2aa2 | 699 | res = (*sproc)(ep, &txlist, priv); |
5071f97e DL |
700 | |
701 | spin_lock_irqsave(&ep->lock, flags); | |
702 | /* | |
703 | * During the time we spent inside the "sproc" callback, some | |
704 | * other events might have been queued by the poll callback. | |
705 | * We re-insert them inside the main ready-list here. | |
706 | */ | |
707 | for (nepi = ep->ovflist; (epi = nepi) != NULL; | |
708 | nepi = epi->next, epi->next = EP_UNACTIVE_PTR) { | |
709 | /* | |
710 | * We need to check if the item is already in the list. | |
711 | * During the "sproc" callback execution time, items are | |
712 | * queued into ->ovflist but the "txlist" might already | |
713 | * contain them, and the list_splice() below takes care of them. | |
714 | */ | |
4d7e30d9 | 715 | if (!ep_is_linked(&epi->rdllink)) { |
5071f97e | 716 | list_add_tail(&epi->rdllink, &ep->rdllist); |
eea1d585 | 717 | ep_pm_stay_awake(epi); |
4d7e30d9 | 718 | } |
5071f97e DL |
719 | } |
720 | /* | |
721 | * We need to set back ep->ovflist to EP_UNACTIVE_PTR, so that after | |
722 | * releasing the lock, events will be queued in the normal way inside | |
723 | * ep->rdllist. | |
724 | */ | |
725 | ep->ovflist = EP_UNACTIVE_PTR; | |
726 | ||
727 | /* | |
728 | * Quickly re-inject items left on "txlist". | |
729 | */ | |
730 | list_splice(&txlist, &ep->rdllist); | |
4d7e30d9 | 731 | __pm_relax(ep->ws); |
5071f97e DL |
732 | |
733 | if (!list_empty(&ep->rdllist)) { | |
734 | /* | |
296e236e DL |
735 | * Wake up (if active) both the eventpoll wait list and |
736 | * the ->poll() wait list (delayed after we release the lock). | |
5071f97e DL |
737 | */ |
738 | if (waitqueue_active(&ep->wq)) | |
739 | wake_up_locked(&ep->wq); | |
740 | if (waitqueue_active(&ep->poll_wait)) | |
741 | pwake++; | |
742 | } | |
743 | spin_unlock_irqrestore(&ep->lock, flags); | |
744 | ||
67347fe4 JB |
745 | if (!ep_locked) |
746 | mutex_unlock(&ep->mtx); | |
5071f97e DL |
747 | |
748 | /* We have to call this outside the lock */ | |
749 | if (pwake) | |
750 | ep_poll_safewake(&ep->poll_wait); | |
751 | ||
d85e2aa2 | 752 | return res; |
5071f97e DL |
753 | } |
754 | ||
ae10b2b4 JB |
755 | static void epi_rcu_free(struct rcu_head *head) |
756 | { | |
757 | struct epitem *epi = container_of(head, struct epitem, rcu); | |
758 | kmem_cache_free(epi_cache, epi); | |
759 | } | |
760 | ||
7699acd1 DL |
761 | /* |
762 | * Removes a "struct epitem" from the eventpoll RB tree and deallocates | |
c7ea7630 | 763 | * all the associated resources. Must be called with "mtx" held. |
7699acd1 DL |
764 | */ |
765 | static int ep_remove(struct eventpoll *ep, struct epitem *epi) | |
766 | { | |
7699acd1 DL |
767 | unsigned long flags; |
768 | struct file *file = epi->ffd.file; | |
1da177e4 LT |
769 | |
770 | /* | |
7699acd1 DL |
771 | * Removes poll wait queue hooks. We _have_ to do this without holding |
772 | * the "ep->lock" otherwise a deadlock might occur. This because of the | |
773 | * sequence of the lock acquisition. Here we do "ep->lock" then the wait | |
774 | * queue head lock when unregistering the wait queue. The wakeup callback | |
775 | * will run by holding the wait queue head lock and will call our callback | |
776 | * that will try to get "ep->lock". | |
1da177e4 | 777 | */ |
7699acd1 | 778 | ep_unregister_pollwait(ep, epi); |
1da177e4 | 779 | |
7699acd1 | 780 | /* Remove the current item from the list of epoll hooks */ |
68499914 | 781 | spin_lock(&file->f_lock); |
ae10b2b4 | 782 | list_del_rcu(&epi->fllink); |
68499914 | 783 | spin_unlock(&file->f_lock); |
1da177e4 | 784 | |
b2ac2ea6 | 785 | rb_erase_cached(&epi->rbn, &ep->rbr); |
1da177e4 | 786 | |
c7ea7630 DL |
787 | spin_lock_irqsave(&ep->lock, flags); |
788 | if (ep_is_linked(&epi->rdllink)) | |
789 | list_del_init(&epi->rdllink); | |
790 | spin_unlock_irqrestore(&ep->lock, flags); | |
1da177e4 | 791 | |
eea1d585 | 792 | wakeup_source_unregister(ep_wakeup_source(epi)); |
ae10b2b4 JB |
793 | /* |
794 | * At this point it is safe to free the eventpoll item. Use the union | |
795 | * field epi->rcu, since we are trying to minimize the size of | |
796 | * 'struct epitem'. The 'rbn' field is no longer in use. Protected by | |
797 | * ep->mtx. The rcu read side, reverse_path_check_proc(), does not make | |
798 | * use of the rbn field. | |
799 | */ | |
800 | call_rcu(&epi->rcu, epi_rcu_free); | |
1da177e4 | 801 | |
52bd19f7 | 802 | atomic_long_dec(&ep->user->epoll_watches); |
7ef9964e | 803 | |
c7ea7630 | 804 | return 0; |
1da177e4 LT |
805 | } |
806 | ||
7699acd1 | 807 | static void ep_free(struct eventpoll *ep) |
1da177e4 | 808 | { |
7699acd1 DL |
809 | struct rb_node *rbp; |
810 | struct epitem *epi; | |
1da177e4 | 811 | |
7699acd1 DL |
812 | /* We need to release all tasks waiting for these file */ |
813 | if (waitqueue_active(&ep->poll_wait)) | |
5071f97e | 814 | ep_poll_safewake(&ep->poll_wait); |
1da177e4 | 815 | |
7699acd1 DL |
816 | /* |
817 | * We need to lock this because we could be hit by | |
818 | * eventpoll_release_file() while we're freeing the "struct eventpoll". | |
d47de16c | 819 | * We do not need to hold "ep->mtx" here because the epoll file |
7699acd1 DL |
820 | * is on the way to be removed and no one has references to it |
821 | * anymore. The only hit might come from eventpoll_release_file() but | |
25985edc | 822 | * holding "epmutex" is sufficient here. |
7699acd1 DL |
823 | */ |
824 | mutex_lock(&epmutex); | |
1da177e4 LT |
825 | |
826 | /* | |
7699acd1 | 827 | * Walks through the whole tree by unregistering poll callbacks. |
1da177e4 | 828 | */ |
b2ac2ea6 | 829 | for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { |
7699acd1 DL |
830 | epi = rb_entry(rbp, struct epitem, rbn); |
831 | ||
832 | ep_unregister_pollwait(ep, epi); | |
91cf5ab6 | 833 | cond_resched(); |
7699acd1 | 834 | } |
1da177e4 LT |
835 | |
836 | /* | |
7699acd1 DL |
837 | * Walks through the whole tree by freeing each "struct epitem". At this |
838 | * point we are sure no poll callbacks will be lingering around, and also by | |
d47de16c | 839 | * holding "epmutex" we can be sure that no file cleanup code will hit |
7699acd1 | 840 | * us during this operation. So we can avoid the lock on "ep->lock". |
ddf676c3 EW |
841 | * We do not need to lock ep->mtx, either, we only do it to prevent |
842 | * a lockdep warning. | |
1da177e4 | 843 | */ |
ddf676c3 | 844 | mutex_lock(&ep->mtx); |
b2ac2ea6 | 845 | while ((rbp = rb_first_cached(&ep->rbr)) != NULL) { |
7699acd1 DL |
846 | epi = rb_entry(rbp, struct epitem, rbn); |
847 | ep_remove(ep, epi); | |
91cf5ab6 | 848 | cond_resched(); |
7699acd1 | 849 | } |
ddf676c3 | 850 | mutex_unlock(&ep->mtx); |
1da177e4 | 851 | |
7699acd1 | 852 | mutex_unlock(&epmutex); |
d47de16c | 853 | mutex_destroy(&ep->mtx); |
7ef9964e | 854 | free_uid(ep->user); |
4d7e30d9 | 855 | wakeup_source_unregister(ep->ws); |
f0ee9aab | 856 | kfree(ep); |
7699acd1 | 857 | } |
1da177e4 | 858 | |
7699acd1 DL |
859 | static int ep_eventpoll_release(struct inode *inode, struct file *file) |
860 | { | |
861 | struct eventpoll *ep = file->private_data; | |
1da177e4 | 862 | |
f0ee9aab | 863 | if (ep) |
7699acd1 | 864 | ep_free(ep); |
7699acd1 | 865 | |
7699acd1 | 866 | return 0; |
1da177e4 LT |
867 | } |
868 | ||
d85e2aa2 | 869 | static __poll_t ep_read_events_proc(struct eventpoll *ep, struct list_head *head, |
37b5e521 JB |
870 | void *priv); |
871 | static void ep_ptable_queue_proc(struct file *file, wait_queue_head_t *whead, | |
872 | poll_table *pt); | |
873 | ||
874 | /* | |
875 | * Differs from ep_eventpoll_poll() in that internal callers already have | |
876 | * the ep->mtx so we need to start from depth=1, such that mutex_lock_nested() | |
877 | * is correctly annotated. | |
878 | */ | |
d85e2aa2 | 879 | static __poll_t ep_item_poll(const struct epitem *epi, poll_table *pt, |
bec1a502 | 880 | int depth) |
450d89ec | 881 | { |
37b5e521 JB |
882 | struct eventpoll *ep; |
883 | bool locked; | |
884 | ||
450d89ec | 885 | pt->_key = epi->event.events; |
37b5e521 | 886 | if (!is_file_epoll(epi->ffd.file)) |
9965ed17 | 887 | return vfs_poll(epi->ffd.file, pt) & epi->event.events; |
450d89ec | 888 | |
37b5e521 JB |
889 | ep = epi->ffd.file->private_data; |
890 | poll_wait(epi->ffd.file, &ep->poll_wait, pt); | |
891 | locked = pt && (pt->_qproc == ep_ptable_queue_proc); | |
450d89ec | 892 | |
37b5e521 JB |
893 | return ep_scan_ready_list(epi->ffd.file->private_data, |
894 | ep_read_events_proc, &depth, depth, | |
895 | locked) & epi->event.events; | |
450d89ec EW |
896 | } |
897 | ||
d85e2aa2 | 898 | static __poll_t ep_read_events_proc(struct eventpoll *ep, struct list_head *head, |
296e236e | 899 | void *priv) |
5071f97e DL |
900 | { |
901 | struct epitem *epi, *tmp; | |
626cf236 | 902 | poll_table pt; |
37b5e521 | 903 | int depth = *(int *)priv; |
5071f97e | 904 | |
626cf236 | 905 | init_poll_funcptr(&pt, NULL); |
37b5e521 | 906 | depth++; |
450d89ec | 907 | |
5071f97e | 908 | list_for_each_entry_safe(epi, tmp, head, rdllink) { |
37b5e521 | 909 | if (ep_item_poll(epi, &pt, depth)) { |
a9a08845 | 910 | return EPOLLIN | EPOLLRDNORM; |
37b5e521 | 911 | } else { |
5071f97e DL |
912 | /* |
913 | * Item has been dropped into the ready list by the poll | |
914 | * callback, but it's not actually ready, as far as | |
915 | * caller requested events goes. We can remove it here. | |
916 | */ | |
eea1d585 | 917 | __pm_relax(ep_wakeup_source(epi)); |
5071f97e | 918 | list_del_init(&epi->rdllink); |
296e236e | 919 | } |
5071f97e DL |
920 | } |
921 | ||
922 | return 0; | |
923 | } | |
924 | ||
11c5ad0e BN |
925 | static struct wait_queue_head *ep_eventpoll_get_poll_head(struct file *file, |
926 | __poll_t eventmask) | |
7699acd1 | 927 | { |
7699acd1 | 928 | struct eventpoll *ep = file->private_data; |
11c5ad0e BN |
929 | return &ep->poll_wait; |
930 | } | |
1da177e4 | 931 | |
11c5ad0e BN |
932 | static __poll_t ep_eventpoll_poll_mask(struct file *file, __poll_t eventmask) |
933 | { | |
934 | struct eventpoll *ep = file->private_data; | |
935 | int depth = 0; | |
7699acd1 | 936 | |
5071f97e DL |
937 | /* |
938 | * Proceed to find out if wanted events are really available inside | |
37b5e521 | 939 | * the ready list. |
5071f97e | 940 | */ |
37b5e521 JB |
941 | return ep_scan_ready_list(ep, ep_read_events_proc, |
942 | &depth, depth, false); | |
7699acd1 DL |
943 | } |
944 | ||
138d22b5 | 945 | #ifdef CONFIG_PROC_FS |
a3816ab0 | 946 | static void ep_show_fdinfo(struct seq_file *m, struct file *f) |
138d22b5 CG |
947 | { |
948 | struct eventpoll *ep = f->private_data; | |
949 | struct rb_node *rbp; | |
138d22b5 CG |
950 | |
951 | mutex_lock(&ep->mtx); | |
b2ac2ea6 | 952 | for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { |
138d22b5 | 953 | struct epitem *epi = rb_entry(rbp, struct epitem, rbn); |
77493f04 | 954 | struct inode *inode = file_inode(epi->ffd.file); |
138d22b5 | 955 | |
77493f04 CG |
956 | seq_printf(m, "tfd: %8d events: %8x data: %16llx " |
957 | " pos:%lli ino:%lx sdev:%x\n", | |
a3816ab0 | 958 | epi->ffd.fd, epi->event.events, |
77493f04 CG |
959 | (long long)epi->event.data, |
960 | (long long)epi->ffd.file->f_pos, | |
961 | inode->i_ino, inode->i_sb->s_dev); | |
a3816ab0 | 962 | if (seq_has_overflowed(m)) |
138d22b5 CG |
963 | break; |
964 | } | |
965 | mutex_unlock(&ep->mtx); | |
138d22b5 CG |
966 | } |
967 | #endif | |
968 | ||
7699acd1 DL |
969 | /* File callbacks that implement the eventpoll file behaviour */ |
970 | static const struct file_operations eventpoll_fops = { | |
138d22b5 CG |
971 | #ifdef CONFIG_PROC_FS |
972 | .show_fdinfo = ep_show_fdinfo, | |
973 | #endif | |
7699acd1 | 974 | .release = ep_eventpoll_release, |
11c5ad0e BN |
975 | .get_poll_head = ep_eventpoll_get_poll_head, |
976 | .poll_mask = ep_eventpoll_poll_mask, | |
6038f373 | 977 | .llseek = noop_llseek, |
7699acd1 DL |
978 | }; |
979 | ||
b611967d | 980 | /* |
7699acd1 DL |
981 | * This is called from eventpoll_release() to unlink files from the eventpoll |
982 | * interface. We need to have this facility to cleanup correctly files that are | |
983 | * closed without being removed from the eventpoll interface. | |
b611967d | 984 | */ |
7699acd1 | 985 | void eventpoll_release_file(struct file *file) |
b611967d | 986 | { |
7699acd1 | 987 | struct eventpoll *ep; |
ebe06187 | 988 | struct epitem *epi, *next; |
b611967d DL |
989 | |
990 | /* | |
68499914 | 991 | * We don't want to get "file->f_lock" because it is not |
7699acd1 | 992 | * necessary. It is not necessary because we're in the "struct file" |
25985edc | 993 | * cleanup path, and this means that no one is using this file anymore. |
5071f97e | 994 | * So, for example, epoll_ctl() cannot hit here since if we reach this |
67647d0f | 995 | * point, the file counter already went to zero and fget() would fail. |
d47de16c | 996 | * The only hit might come from ep_free() but by holding the mutex |
7699acd1 | 997 | * will correctly serialize the operation. We do need to acquire |
d47de16c | 998 | * "ep->mtx" after "epmutex" because ep_remove() requires it when called |
7699acd1 | 999 | * from anywhere but ep_free(). |
68499914 JC |
1000 | * |
1001 | * Besides, ep_remove() acquires the lock, so we can't hold it here. | |
b611967d | 1002 | */ |
7699acd1 | 1003 | mutex_lock(&epmutex); |
ebe06187 | 1004 | list_for_each_entry_safe(epi, next, &file->f_ep_links, fllink) { |
7699acd1 | 1005 | ep = epi->ep; |
d8805e63 | 1006 | mutex_lock_nested(&ep->mtx, 0); |
7699acd1 | 1007 | ep_remove(ep, epi); |
d47de16c | 1008 | mutex_unlock(&ep->mtx); |
b611967d | 1009 | } |
7699acd1 | 1010 | mutex_unlock(&epmutex); |
b611967d DL |
1011 | } |
1012 | ||
53d2be79 | 1013 | static int ep_alloc(struct eventpoll **pep) |
1da177e4 | 1014 | { |
7ef9964e DL |
1015 | int error; |
1016 | struct user_struct *user; | |
1017 | struct eventpoll *ep; | |
1da177e4 | 1018 | |
7ef9964e | 1019 | user = get_current_user(); |
7ef9964e DL |
1020 | error = -ENOMEM; |
1021 | ep = kzalloc(sizeof(*ep), GFP_KERNEL); | |
1022 | if (unlikely(!ep)) | |
1023 | goto free_uid; | |
1da177e4 | 1024 | |
c7ea7630 | 1025 | spin_lock_init(&ep->lock); |
d47de16c | 1026 | mutex_init(&ep->mtx); |
1da177e4 LT |
1027 | init_waitqueue_head(&ep->wq); |
1028 | init_waitqueue_head(&ep->poll_wait); | |
1029 | INIT_LIST_HEAD(&ep->rdllist); | |
b2ac2ea6 | 1030 | ep->rbr = RB_ROOT_CACHED; |
d47de16c | 1031 | ep->ovflist = EP_UNACTIVE_PTR; |
7ef9964e | 1032 | ep->user = user; |
1da177e4 | 1033 | |
53d2be79 | 1034 | *pep = ep; |
1da177e4 | 1035 | |
1da177e4 | 1036 | return 0; |
7ef9964e DL |
1037 | |
1038 | free_uid: | |
1039 | free_uid(user); | |
1040 | return error; | |
1da177e4 LT |
1041 | } |
1042 | ||
1da177e4 | 1043 | /* |
c7ea7630 DL |
1044 | * Search the file inside the eventpoll tree. The RB tree operations |
1045 | * are protected by the "mtx" mutex, and ep_find() must be called with | |
1046 | * "mtx" held. | |
1da177e4 LT |
1047 | */ |
1048 | static struct epitem *ep_find(struct eventpoll *ep, struct file *file, int fd) | |
1049 | { | |
1050 | int kcmp; | |
1da177e4 LT |
1051 | struct rb_node *rbp; |
1052 | struct epitem *epi, *epir = NULL; | |
1053 | struct epoll_filefd ffd; | |
1054 | ||
b030a4dd | 1055 | ep_set_ffd(&ffd, file, fd); |
b2ac2ea6 | 1056 | for (rbp = ep->rbr.rb_root.rb_node; rbp; ) { |
1da177e4 | 1057 | epi = rb_entry(rbp, struct epitem, rbn); |
b030a4dd | 1058 | kcmp = ep_cmp_ffd(&ffd, &epi->ffd); |
1da177e4 LT |
1059 | if (kcmp > 0) |
1060 | rbp = rbp->rb_right; | |
1061 | else if (kcmp < 0) | |
1062 | rbp = rbp->rb_left; | |
1063 | else { | |
1da177e4 LT |
1064 | epir = epi; |
1065 | break; | |
1066 | } | |
1067 | } | |
1da177e4 | 1068 | |
1da177e4 LT |
1069 | return epir; |
1070 | } | |
1071 | ||
92ef6da3 | 1072 | #ifdef CONFIG_CHECKPOINT_RESTORE |
0791e364 CG |
1073 | static struct epitem *ep_find_tfd(struct eventpoll *ep, int tfd, unsigned long toff) |
1074 | { | |
1075 | struct rb_node *rbp; | |
1076 | struct epitem *epi; | |
1077 | ||
b2ac2ea6 | 1078 | for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { |
0791e364 CG |
1079 | epi = rb_entry(rbp, struct epitem, rbn); |
1080 | if (epi->ffd.fd == tfd) { | |
1081 | if (toff == 0) | |
1082 | return epi; | |
1083 | else | |
1084 | toff--; | |
1085 | } | |
1086 | cond_resched(); | |
1087 | } | |
1088 | ||
1089 | return NULL; | |
1090 | } | |
1091 | ||
1092 | struct file *get_epoll_tfile_raw_ptr(struct file *file, int tfd, | |
1093 | unsigned long toff) | |
1094 | { | |
1095 | struct file *file_raw; | |
1096 | struct eventpoll *ep; | |
1097 | struct epitem *epi; | |
1098 | ||
1099 | if (!is_file_epoll(file)) | |
1100 | return ERR_PTR(-EINVAL); | |
1101 | ||
1102 | ep = file->private_data; | |
1103 | ||
1104 | mutex_lock(&ep->mtx); | |
1105 | epi = ep_find_tfd(ep, tfd, toff); | |
1106 | if (epi) | |
1107 | file_raw = epi->ffd.file; | |
1108 | else | |
1109 | file_raw = ERR_PTR(-ENOENT); | |
1110 | mutex_unlock(&ep->mtx); | |
1111 | ||
1112 | return file_raw; | |
1113 | } | |
92ef6da3 | 1114 | #endif /* CONFIG_CHECKPOINT_RESTORE */ |
0791e364 | 1115 | |
1da177e4 | 1116 | /* |
7699acd1 | 1117 | * This is the callback that is passed to the wait queue wakeup |
bf6a41db | 1118 | * mechanism. It is called by the stored file descriptors when they |
7699acd1 | 1119 | * have events to report. |
1da177e4 | 1120 | */ |
ac6424b9 | 1121 | static int ep_poll_callback(wait_queue_entry_t *wait, unsigned mode, int sync, void *key) |
1da177e4 | 1122 | { |
7699acd1 DL |
1123 | int pwake = 0; |
1124 | unsigned long flags; | |
1125 | struct epitem *epi = ep_item_from_wait(wait); | |
1126 | struct eventpoll *ep = epi->ep; | |
3ad6f93e | 1127 | __poll_t pollflags = key_to_poll(key); |
df0108c5 | 1128 | int ewake = 0; |
1da177e4 | 1129 | |
c7ea7630 | 1130 | spin_lock_irqsave(&ep->lock, flags); |
1da177e4 | 1131 | |
bf3b9f63 SS |
1132 | ep_set_busy_poll_napi_id(epi); |
1133 | ||
7699acd1 DL |
1134 | /* |
1135 | * If the event mask does not contain any poll(2) event, we consider the | |
1136 | * descriptor to be disabled. This condition is likely the effect of the | |
1137 | * EPOLLONESHOT bit that disables the descriptor when an event is received, | |
1138 | * until the next EPOLL_CTL_MOD will be issued. | |
1139 | */ | |
1140 | if (!(epi->event.events & ~EP_PRIVATE_BITS)) | |
d47de16c DL |
1141 | goto out_unlock; |
1142 | ||
2dfa4eea DL |
1143 | /* |
1144 | * Check the events coming with the callback. At this stage, not | |
1145 | * every device reports the events in the "key" parameter of the | |
1146 | * callback. We need to be able to handle both cases here, hence the | |
1147 | * test for "key" != NULL before the event match test. | |
1148 | */ | |
3ad6f93e | 1149 | if (pollflags && !(pollflags & epi->event.events)) |
2dfa4eea DL |
1150 | goto out_unlock; |
1151 | ||
d47de16c | 1152 | /* |
bf6a41db | 1153 | * If we are transferring events to userspace, we can hold no locks |
d47de16c | 1154 | * (because we're accessing user memory, and because of linux f_op->poll() |
bf6a41db | 1155 | * semantics). All the events that happen during that period of time are |
d47de16c DL |
1156 | * chained in ep->ovflist and requeued later on. |
1157 | */ | |
1158 | if (unlikely(ep->ovflist != EP_UNACTIVE_PTR)) { | |
1159 | if (epi->next == EP_UNACTIVE_PTR) { | |
1160 | epi->next = ep->ovflist; | |
1161 | ep->ovflist = epi; | |
4d7e30d9 AH |
1162 | if (epi->ws) { |
1163 | /* | |
1164 | * Activate ep->ws since epi->ws may get | |
1165 | * deactivated at any time. | |
1166 | */ | |
1167 | __pm_stay_awake(ep->ws); | |
1168 | } | |
1169 | ||
d47de16c DL |
1170 | } |
1171 | goto out_unlock; | |
1172 | } | |
1da177e4 | 1173 | |
7699acd1 | 1174 | /* If this file is already in the ready list we exit soon */ |
4d7e30d9 | 1175 | if (!ep_is_linked(&epi->rdllink)) { |
5071f97e | 1176 | list_add_tail(&epi->rdllink, &ep->rdllist); |
eea1d585 | 1177 | ep_pm_stay_awake_rcu(epi); |
4d7e30d9 | 1178 | } |
7699acd1 | 1179 | |
7699acd1 DL |
1180 | /* |
1181 | * Wake up ( if active ) both the eventpoll wait list and the ->poll() | |
1182 | * wait list. | |
1183 | */ | |
df0108c5 | 1184 | if (waitqueue_active(&ep->wq)) { |
b6a515c8 | 1185 | if ((epi->event.events & EPOLLEXCLUSIVE) && |
3ad6f93e AV |
1186 | !(pollflags & POLLFREE)) { |
1187 | switch (pollflags & EPOLLINOUT_BITS) { | |
a9a08845 LT |
1188 | case EPOLLIN: |
1189 | if (epi->event.events & EPOLLIN) | |
b6a515c8 JB |
1190 | ewake = 1; |
1191 | break; | |
a9a08845 LT |
1192 | case EPOLLOUT: |
1193 | if (epi->event.events & EPOLLOUT) | |
b6a515c8 JB |
1194 | ewake = 1; |
1195 | break; | |
1196 | case 0: | |
1197 | ewake = 1; | |
1198 | break; | |
1199 | } | |
1200 | } | |
4a6e9e2c | 1201 | wake_up_locked(&ep->wq); |
df0108c5 | 1202 | } |
7699acd1 DL |
1203 | if (waitqueue_active(&ep->poll_wait)) |
1204 | pwake++; | |
1205 | ||
d47de16c | 1206 | out_unlock: |
c7ea7630 | 1207 | spin_unlock_irqrestore(&ep->lock, flags); |
1da177e4 | 1208 | |
7699acd1 DL |
1209 | /* We have to call this outside the lock */ |
1210 | if (pwake) | |
5071f97e | 1211 | ep_poll_safewake(&ep->poll_wait); |
7699acd1 | 1212 | |
138e4ad6 ON |
1213 | if (!(epi->event.events & EPOLLEXCLUSIVE)) |
1214 | ewake = 1; | |
1215 | ||
3ad6f93e | 1216 | if (pollflags & POLLFREE) { |
138e4ad6 ON |
1217 | /* |
1218 | * If we race with ep_remove_wait_queue() it can miss | |
1219 | * ->whead = NULL and do another remove_wait_queue() after | |
1220 | * us, so we can't use __remove_wait_queue(). | |
1221 | */ | |
1222 | list_del_init(&wait->entry); | |
1223 | /* | |
1224 | * ->whead != NULL protects us from the race with ep_free() | |
1225 | * or ep_remove(), ep_remove_wait_queue() takes whead->lock | |
1226 | * held by the caller. Once we nullify it, nothing protects | |
1227 | * ep/epi or even wait. | |
1228 | */ | |
1229 | smp_store_release(&ep_pwq_from_wait(wait)->whead, NULL); | |
1230 | } | |
df0108c5 | 1231 | |
138e4ad6 | 1232 | return ewake; |
7699acd1 | 1233 | } |
1da177e4 LT |
1234 | |
1235 | /* | |
1236 | * This is the callback that is used to add our wait queue to the | |
1237 | * target file wakeup lists. | |
1238 | */ | |
1239 | static void ep_ptable_queue_proc(struct file *file, wait_queue_head_t *whead, | |
1240 | poll_table *pt) | |
1241 | { | |
b030a4dd | 1242 | struct epitem *epi = ep_item_from_epqueue(pt); |
1da177e4 LT |
1243 | struct eppoll_entry *pwq; |
1244 | ||
e94b1766 | 1245 | if (epi->nwait >= 0 && (pwq = kmem_cache_alloc(pwq_cache, GFP_KERNEL))) { |
1da177e4 LT |
1246 | init_waitqueue_func_entry(&pwq->wait, ep_poll_callback); |
1247 | pwq->whead = whead; | |
1248 | pwq->base = epi; | |
df0108c5 JB |
1249 | if (epi->event.events & EPOLLEXCLUSIVE) |
1250 | add_wait_queue_exclusive(whead, &pwq->wait); | |
1251 | else | |
1252 | add_wait_queue(whead, &pwq->wait); | |
1da177e4 LT |
1253 | list_add_tail(&pwq->llink, &epi->pwqlist); |
1254 | epi->nwait++; | |
296e236e | 1255 | } else { |
1da177e4 LT |
1256 | /* We have to signal that an error occurred */ |
1257 | epi->nwait = -1; | |
296e236e | 1258 | } |
1da177e4 LT |
1259 | } |
1260 | ||
1da177e4 LT |
1261 | static void ep_rbtree_insert(struct eventpoll *ep, struct epitem *epi) |
1262 | { | |
1263 | int kcmp; | |
b2ac2ea6 | 1264 | struct rb_node **p = &ep->rbr.rb_root.rb_node, *parent = NULL; |
1da177e4 | 1265 | struct epitem *epic; |
b2ac2ea6 | 1266 | bool leftmost = true; |
1da177e4 LT |
1267 | |
1268 | while (*p) { | |
1269 | parent = *p; | |
1270 | epic = rb_entry(parent, struct epitem, rbn); | |
b030a4dd | 1271 | kcmp = ep_cmp_ffd(&epi->ffd, &epic->ffd); |
b2ac2ea6 | 1272 | if (kcmp > 0) { |
1da177e4 | 1273 | p = &parent->rb_right; |
b2ac2ea6 DB |
1274 | leftmost = false; |
1275 | } else | |
1da177e4 LT |
1276 | p = &parent->rb_left; |
1277 | } | |
1278 | rb_link_node(&epi->rbn, parent, p); | |
b2ac2ea6 | 1279 | rb_insert_color_cached(&epi->rbn, &ep->rbr, leftmost); |
1da177e4 LT |
1280 | } |
1281 | ||
a80a6b85 AM |
1282 | |
1283 | ||
28d82dc1 JB |
1284 | #define PATH_ARR_SIZE 5 |
1285 | /* | |
1286 | * These are the number paths of length 1 to 5, that we are allowing to emanate | |
1287 | * from a single file of interest. For example, we allow 1000 paths of length | |
1288 | * 1, to emanate from each file of interest. This essentially represents the | |
1289 | * potential wakeup paths, which need to be limited in order to avoid massive | |
1290 | * uncontrolled wakeup storms. The common use case should be a single ep which | |
1291 | * is connected to n file sources. In this case each file source has 1 path | |
1292 | * of length 1. Thus, the numbers below should be more than sufficient. These | |
1293 | * path limits are enforced during an EPOLL_CTL_ADD operation, since a modify | |
1294 | * and delete can't add additional paths. Protected by the epmutex. | |
1295 | */ | |
1296 | static const int path_limits[PATH_ARR_SIZE] = { 1000, 500, 100, 50, 10 }; | |
1297 | static int path_count[PATH_ARR_SIZE]; | |
1298 | ||
1299 | static int path_count_inc(int nests) | |
1300 | { | |
93dc6107 JB |
1301 | /* Allow an arbitrary number of depth 1 paths */ |
1302 | if (nests == 0) | |
1303 | return 0; | |
1304 | ||
28d82dc1 JB |
1305 | if (++path_count[nests] > path_limits[nests]) |
1306 | return -1; | |
1307 | return 0; | |
1308 | } | |
1309 | ||
1310 | static void path_count_init(void) | |
1311 | { | |
1312 | int i; | |
1313 | ||
1314 | for (i = 0; i < PATH_ARR_SIZE; i++) | |
1315 | path_count[i] = 0; | |
1316 | } | |
1317 | ||
1318 | static int reverse_path_check_proc(void *priv, void *cookie, int call_nests) | |
1319 | { | |
1320 | int error = 0; | |
1321 | struct file *file = priv; | |
1322 | struct file *child_file; | |
1323 | struct epitem *epi; | |
1324 | ||
ae10b2b4 JB |
1325 | /* CTL_DEL can remove links here, but that can't increase our count */ |
1326 | rcu_read_lock(); | |
1327 | list_for_each_entry_rcu(epi, &file->f_ep_links, fllink) { | |
28d82dc1 JB |
1328 | child_file = epi->ep->file; |
1329 | if (is_file_epoll(child_file)) { | |
1330 | if (list_empty(&child_file->f_ep_links)) { | |
1331 | if (path_count_inc(call_nests)) { | |
1332 | error = -1; | |
1333 | break; | |
1334 | } | |
1335 | } else { | |
1336 | error = ep_call_nested(&poll_loop_ncalls, | |
1337 | EP_MAX_NESTS, | |
1338 | reverse_path_check_proc, | |
1339 | child_file, child_file, | |
1340 | current); | |
1341 | } | |
1342 | if (error != 0) | |
1343 | break; | |
1344 | } else { | |
1345 | printk(KERN_ERR "reverse_path_check_proc: " | |
1346 | "file is not an ep!\n"); | |
1347 | } | |
1348 | } | |
ae10b2b4 | 1349 | rcu_read_unlock(); |
28d82dc1 JB |
1350 | return error; |
1351 | } | |
1352 | ||
1353 | /** | |
1354 | * reverse_path_check - The tfile_check_list is list of file *, which have | |
1355 | * links that are proposed to be newly added. We need to | |
1356 | * make sure that those added links don't add too many | |
1357 | * paths such that we will spend all our time waking up | |
1358 | * eventpoll objects. | |
1359 | * | |
1360 | * Returns: Returns zero if the proposed links don't create too many paths, | |
1361 | * -1 otherwise. | |
1362 | */ | |
1363 | static int reverse_path_check(void) | |
1364 | { | |
28d82dc1 JB |
1365 | int error = 0; |
1366 | struct file *current_file; | |
1367 | ||
1368 | /* let's call this for all tfiles */ | |
1369 | list_for_each_entry(current_file, &tfile_check_list, f_tfile_llink) { | |
28d82dc1 JB |
1370 | path_count_init(); |
1371 | error = ep_call_nested(&poll_loop_ncalls, EP_MAX_NESTS, | |
1372 | reverse_path_check_proc, current_file, | |
1373 | current_file, current); | |
1374 | if (error) | |
1375 | break; | |
1376 | } | |
1377 | return error; | |
1378 | } | |
1379 | ||
4d7e30d9 AH |
1380 | static int ep_create_wakeup_source(struct epitem *epi) |
1381 | { | |
1382 | const char *name; | |
eea1d585 | 1383 | struct wakeup_source *ws; |
4d7e30d9 AH |
1384 | |
1385 | if (!epi->ep->ws) { | |
1386 | epi->ep->ws = wakeup_source_register("eventpoll"); | |
1387 | if (!epi->ep->ws) | |
1388 | return -ENOMEM; | |
1389 | } | |
1390 | ||
1391 | name = epi->ffd.file->f_path.dentry->d_name.name; | |
eea1d585 EW |
1392 | ws = wakeup_source_register(name); |
1393 | ||
1394 | if (!ws) | |
4d7e30d9 | 1395 | return -ENOMEM; |
eea1d585 | 1396 | rcu_assign_pointer(epi->ws, ws); |
4d7e30d9 AH |
1397 | |
1398 | return 0; | |
1399 | } | |
1400 | ||
eea1d585 EW |
1401 | /* rare code path, only used when EPOLL_CTL_MOD removes a wakeup source */ |
1402 | static noinline void ep_destroy_wakeup_source(struct epitem *epi) | |
4d7e30d9 | 1403 | { |
eea1d585 EW |
1404 | struct wakeup_source *ws = ep_wakeup_source(epi); |
1405 | ||
d6d67e72 | 1406 | RCU_INIT_POINTER(epi->ws, NULL); |
eea1d585 EW |
1407 | |
1408 | /* | |
1409 | * wait for ep_pm_stay_awake_rcu to finish, synchronize_rcu is | |
1410 | * used internally by wakeup_source_remove, too (called by | |
1411 | * wakeup_source_unregister), so we cannot use call_rcu | |
1412 | */ | |
1413 | synchronize_rcu(); | |
1414 | wakeup_source_unregister(ws); | |
4d7e30d9 AH |
1415 | } |
1416 | ||
c7ea7630 DL |
1417 | /* |
1418 | * Must be called with "mtx" held. | |
1419 | */ | |
bec1a502 | 1420 | static int ep_insert(struct eventpoll *ep, const struct epoll_event *event, |
67347fe4 | 1421 | struct file *tfile, int fd, int full_check) |
1da177e4 | 1422 | { |
d85e2aa2 AV |
1423 | int error, pwake = 0; |
1424 | __poll_t revents; | |
1da177e4 | 1425 | unsigned long flags; |
52bd19f7 | 1426 | long user_watches; |
1da177e4 LT |
1427 | struct epitem *epi; |
1428 | struct ep_pqueue epq; | |
1429 | ||
52bd19f7 RH |
1430 | user_watches = atomic_long_read(&ep->user->epoll_watches); |
1431 | if (unlikely(user_watches >= max_user_watches)) | |
7ef9964e | 1432 | return -ENOSPC; |
e94b1766 | 1433 | if (!(epi = kmem_cache_alloc(epi_cache, GFP_KERNEL))) |
7ef9964e | 1434 | return -ENOMEM; |
1da177e4 LT |
1435 | |
1436 | /* Item initialization follow here ... */ | |
1da177e4 LT |
1437 | INIT_LIST_HEAD(&epi->rdllink); |
1438 | INIT_LIST_HEAD(&epi->fllink); | |
1da177e4 LT |
1439 | INIT_LIST_HEAD(&epi->pwqlist); |
1440 | epi->ep = ep; | |
b030a4dd | 1441 | ep_set_ffd(&epi->ffd, tfile, fd); |
1da177e4 | 1442 | epi->event = *event; |
1da177e4 | 1443 | epi->nwait = 0; |
d47de16c | 1444 | epi->next = EP_UNACTIVE_PTR; |
4d7e30d9 AH |
1445 | if (epi->event.events & EPOLLWAKEUP) { |
1446 | error = ep_create_wakeup_source(epi); | |
1447 | if (error) | |
1448 | goto error_create_wakeup_source; | |
1449 | } else { | |
eea1d585 | 1450 | RCU_INIT_POINTER(epi->ws, NULL); |
4d7e30d9 | 1451 | } |
1da177e4 LT |
1452 | |
1453 | /* Initialize the poll table using the queue callback */ | |
1454 | epq.epi = epi; | |
1455 | init_poll_funcptr(&epq.pt, ep_ptable_queue_proc); | |
1456 | ||
1457 | /* | |
1458 | * Attach the item to the poll hooks and get current event bits. | |
1459 | * We can safely use the file* here because its usage count has | |
c7ea7630 DL |
1460 | * been increased by the caller of this function. Note that after |
1461 | * this operation completes, the poll callback can start hitting | |
1462 | * the new item. | |
1da177e4 | 1463 | */ |
37b5e521 | 1464 | revents = ep_item_poll(epi, &epq.pt, 1); |
1da177e4 LT |
1465 | |
1466 | /* | |
1467 | * We have to check if something went wrong during the poll wait queue | |
1468 | * install process. Namely an allocation for a wait queue failed due | |
1469 | * high memory pressure. | |
1470 | */ | |
7ef9964e | 1471 | error = -ENOMEM; |
1da177e4 | 1472 | if (epi->nwait < 0) |
7699acd1 | 1473 | goto error_unregister; |
1da177e4 LT |
1474 | |
1475 | /* Add the current item to the list of active epoll hook for this file */ | |
68499914 | 1476 | spin_lock(&tfile->f_lock); |
ae10b2b4 | 1477 | list_add_tail_rcu(&epi->fllink, &tfile->f_ep_links); |
68499914 | 1478 | spin_unlock(&tfile->f_lock); |
1da177e4 | 1479 | |
c7ea7630 DL |
1480 | /* |
1481 | * Add the current item to the RB tree. All RB tree operations are | |
1482 | * protected by "mtx", and ep_insert() is called with "mtx" held. | |
1483 | */ | |
1da177e4 LT |
1484 | ep_rbtree_insert(ep, epi); |
1485 | ||
28d82dc1 JB |
1486 | /* now check if we've created too many backpaths */ |
1487 | error = -EINVAL; | |
67347fe4 | 1488 | if (full_check && reverse_path_check()) |
28d82dc1 JB |
1489 | goto error_remove_epi; |
1490 | ||
c7ea7630 DL |
1491 | /* We have to drop the new item inside our item list to keep track of it */ |
1492 | spin_lock_irqsave(&ep->lock, flags); | |
1493 | ||
bf3b9f63 SS |
1494 | /* record NAPI ID of new item if present */ |
1495 | ep_set_busy_poll_napi_id(epi); | |
1496 | ||
1da177e4 | 1497 | /* If the file is already "ready" we drop it inside the ready list */ |
69112736 | 1498 | if (revents && !ep_is_linked(&epi->rdllink)) { |
1da177e4 | 1499 | list_add_tail(&epi->rdllink, &ep->rdllist); |
eea1d585 | 1500 | ep_pm_stay_awake(epi); |
1da177e4 LT |
1501 | |
1502 | /* Notify waiting tasks that events are available */ | |
1503 | if (waitqueue_active(&ep->wq)) | |
4a6e9e2c | 1504 | wake_up_locked(&ep->wq); |
1da177e4 LT |
1505 | if (waitqueue_active(&ep->poll_wait)) |
1506 | pwake++; | |
1507 | } | |
1508 | ||
c7ea7630 | 1509 | spin_unlock_irqrestore(&ep->lock, flags); |
1da177e4 | 1510 | |
52bd19f7 | 1511 | atomic_long_inc(&ep->user->epoll_watches); |
7ef9964e | 1512 | |
1da177e4 LT |
1513 | /* We have to call this outside the lock */ |
1514 | if (pwake) | |
5071f97e | 1515 | ep_poll_safewake(&ep->poll_wait); |
1da177e4 | 1516 | |
1da177e4 LT |
1517 | return 0; |
1518 | ||
28d82dc1 JB |
1519 | error_remove_epi: |
1520 | spin_lock(&tfile->f_lock); | |
ae10b2b4 | 1521 | list_del_rcu(&epi->fllink); |
28d82dc1 JB |
1522 | spin_unlock(&tfile->f_lock); |
1523 | ||
b2ac2ea6 | 1524 | rb_erase_cached(&epi->rbn, &ep->rbr); |
28d82dc1 | 1525 | |
7699acd1 | 1526 | error_unregister: |
1da177e4 LT |
1527 | ep_unregister_pollwait(ep, epi); |
1528 | ||
1529 | /* | |
1530 | * We need to do this because an event could have been arrived on some | |
67647d0f DL |
1531 | * allocated wait queue. Note that we don't care about the ep->ovflist |
1532 | * list, since that is used/cleaned only inside a section bound by "mtx". | |
1533 | * And ep_insert() is called with "mtx" held. | |
1da177e4 | 1534 | */ |
c7ea7630 | 1535 | spin_lock_irqsave(&ep->lock, flags); |
b030a4dd | 1536 | if (ep_is_linked(&epi->rdllink)) |
6192bd53 | 1537 | list_del_init(&epi->rdllink); |
c7ea7630 | 1538 | spin_unlock_irqrestore(&ep->lock, flags); |
1da177e4 | 1539 | |
eea1d585 | 1540 | wakeup_source_unregister(ep_wakeup_source(epi)); |
4d7e30d9 AH |
1541 | |
1542 | error_create_wakeup_source: | |
b030a4dd | 1543 | kmem_cache_free(epi_cache, epi); |
7ef9964e | 1544 | |
1da177e4 LT |
1545 | return error; |
1546 | } | |
1547 | ||
1da177e4 LT |
1548 | /* |
1549 | * Modify the interest event mask by dropping an event if the new mask | |
c7ea7630 | 1550 | * has a match in the current file status. Must be called with "mtx" held. |
1da177e4 | 1551 | */ |
bec1a502 AV |
1552 | static int ep_modify(struct eventpoll *ep, struct epitem *epi, |
1553 | const struct epoll_event *event) | |
1da177e4 LT |
1554 | { |
1555 | int pwake = 0; | |
626cf236 HV |
1556 | poll_table pt; |
1557 | ||
1558 | init_poll_funcptr(&pt, NULL); | |
1da177e4 LT |
1559 | |
1560 | /* | |
e057e15f TB |
1561 | * Set the new event interest mask before calling f_op->poll(); |
1562 | * otherwise we might miss an event that happens between the | |
1563 | * f_op->poll() call and the new event set registering. | |
1da177e4 | 1564 | */ |
128dd175 | 1565 | epi->event.events = event->events; /* need barrier below */ |
e057e15f | 1566 | epi->event.data = event->data; /* protected by mtx */ |
4d7e30d9 | 1567 | if (epi->event.events & EPOLLWAKEUP) { |
eea1d585 | 1568 | if (!ep_has_wakeup_source(epi)) |
4d7e30d9 | 1569 | ep_create_wakeup_source(epi); |
eea1d585 | 1570 | } else if (ep_has_wakeup_source(epi)) { |
4d7e30d9 AH |
1571 | ep_destroy_wakeup_source(epi); |
1572 | } | |
1da177e4 | 1573 | |
128dd175 EW |
1574 | /* |
1575 | * The following barrier has two effects: | |
1576 | * | |
1577 | * 1) Flush epi changes above to other CPUs. This ensures | |
1578 | * we do not miss events from ep_poll_callback if an | |
1579 | * event occurs immediately after we call f_op->poll(). | |
1580 | * We need this because we did not take ep->lock while | |
1581 | * changing epi above (but ep_poll_callback does take | |
1582 | * ep->lock). | |
1583 | * | |
1584 | * 2) We also need to ensure we do not miss _past_ events | |
1585 | * when calling f_op->poll(). This barrier also | |
1586 | * pairs with the barrier in wq_has_sleeper (see | |
1587 | * comments for wq_has_sleeper). | |
1588 | * | |
1589 | * This barrier will now guarantee ep_poll_callback or f_op->poll | |
1590 | * (or both) will notice the readiness of an item. | |
1591 | */ | |
1592 | smp_mb(); | |
1593 | ||
1da177e4 LT |
1594 | /* |
1595 | * Get current event bits. We can safely use the file* here because | |
1596 | * its usage count has been increased by the caller of this function. | |
c7ea7630 | 1597 | * If the item is "hot" and it is not registered inside the ready |
67647d0f | 1598 | * list, push it inside. |
1da177e4 | 1599 | */ |
69112736 | 1600 | if (ep_item_poll(epi, &pt, 1)) { |
e057e15f | 1601 | spin_lock_irq(&ep->lock); |
c7ea7630 DL |
1602 | if (!ep_is_linked(&epi->rdllink)) { |
1603 | list_add_tail(&epi->rdllink, &ep->rdllist); | |
eea1d585 | 1604 | ep_pm_stay_awake(epi); |
c7ea7630 DL |
1605 | |
1606 | /* Notify waiting tasks that events are available */ | |
1607 | if (waitqueue_active(&ep->wq)) | |
4a6e9e2c | 1608 | wake_up_locked(&ep->wq); |
c7ea7630 DL |
1609 | if (waitqueue_active(&ep->poll_wait)) |
1610 | pwake++; | |
7699acd1 | 1611 | } |
e057e15f | 1612 | spin_unlock_irq(&ep->lock); |
7699acd1 | 1613 | } |
1da177e4 | 1614 | |
7699acd1 DL |
1615 | /* We have to call this outside the lock */ |
1616 | if (pwake) | |
5071f97e | 1617 | ep_poll_safewake(&ep->poll_wait); |
1da177e4 | 1618 | |
7699acd1 | 1619 | return 0; |
1da177e4 LT |
1620 | } |
1621 | ||
d85e2aa2 | 1622 | static __poll_t ep_send_events_proc(struct eventpoll *ep, struct list_head *head, |
296e236e | 1623 | void *priv) |
1da177e4 | 1624 | { |
5071f97e | 1625 | struct ep_send_events_data *esed = priv; |
d85e2aa2 | 1626 | __poll_t revents; |
5071f97e DL |
1627 | struct epitem *epi; |
1628 | struct epoll_event __user *uevent; | |
eea1d585 | 1629 | struct wakeup_source *ws; |
626cf236 HV |
1630 | poll_table pt; |
1631 | ||
1632 | init_poll_funcptr(&pt, NULL); | |
1da177e4 | 1633 | |
296e236e | 1634 | /* |
5071f97e DL |
1635 | * We can loop without lock because we are passed a task private list. |
1636 | * Items cannot vanish during the loop because ep_scan_ready_list() is | |
1637 | * holding "mtx" during this call. | |
296e236e | 1638 | */ |
d7ebbe46 AV |
1639 | for (esed->res = 0, uevent = esed->events; |
1640 | !list_empty(head) && esed->res < esed->maxevents;) { | |
5071f97e | 1641 | epi = list_first_entry(head, struct epitem, rdllink); |
d47de16c | 1642 | |
4d7e30d9 AH |
1643 | /* |
1644 | * Activate ep->ws before deactivating epi->ws to prevent | |
1645 | * triggering auto-suspend here (in case we reactive epi->ws | |
1646 | * below). | |
1647 | * | |
1648 | * This could be rearranged to delay the deactivation of epi->ws | |
1649 | * instead, but then epi->ws would temporarily be out of sync | |
1650 | * with ep_is_linked(). | |
1651 | */ | |
eea1d585 EW |
1652 | ws = ep_wakeup_source(epi); |
1653 | if (ws) { | |
1654 | if (ws->active) | |
1655 | __pm_stay_awake(ep->ws); | |
1656 | __pm_relax(ws); | |
1657 | } | |
1658 | ||
d47de16c | 1659 | list_del_init(&epi->rdllink); |
1da177e4 | 1660 | |
37b5e521 | 1661 | revents = ep_item_poll(epi, &pt, 1); |
5071f97e | 1662 | |
296e236e | 1663 | /* |
5071f97e DL |
1664 | * If the event mask intersect the caller-requested one, |
1665 | * deliver the event to userspace. Again, ep_scan_ready_list() | |
1666 | * is holding "mtx", so no operations coming from userspace | |
1667 | * can change the item. | |
296e236e DL |
1668 | */ |
1669 | if (revents) { | |
5071f97e | 1670 | if (__put_user(revents, &uevent->events) || |
d0305882 TB |
1671 | __put_user(epi->event.data, &uevent->data)) { |
1672 | list_add(&epi->rdllink, head); | |
eea1d585 | 1673 | ep_pm_stay_awake(epi); |
d7ebbe46 AV |
1674 | if (!esed->res) |
1675 | esed->res = -EFAULT; | |
1676 | return 0; | |
d0305882 | 1677 | } |
d7ebbe46 | 1678 | esed->res++; |
5071f97e | 1679 | uevent++; |
296e236e DL |
1680 | if (epi->event.events & EPOLLONESHOT) |
1681 | epi->event.events &= EP_PRIVATE_BITS; | |
1682 | else if (!(epi->event.events & EPOLLET)) { | |
1683 | /* | |
1684 | * If this file has been added with Level | |
1685 | * Trigger mode, we need to insert back inside | |
1686 | * the ready list, so that the next call to | |
1687 | * epoll_wait() will check again the events | |
25985edc | 1688 | * availability. At this point, no one can insert |
296e236e DL |
1689 | * into ep->rdllist besides us. The epoll_ctl() |
1690 | * callers are locked out by | |
1691 | * ep_scan_ready_list() holding "mtx" and the | |
1692 | * poll callback will queue them in ep->ovflist. | |
1693 | */ | |
1694 | list_add_tail(&epi->rdllink, &ep->rdllist); | |
eea1d585 | 1695 | ep_pm_stay_awake(epi); |
296e236e DL |
1696 | } |
1697 | } | |
1698 | } | |
5071f97e | 1699 | |
d7ebbe46 | 1700 | return 0; |
5071f97e | 1701 | } |
d47de16c | 1702 | |
296e236e DL |
1703 | static int ep_send_events(struct eventpoll *ep, |
1704 | struct epoll_event __user *events, int maxevents) | |
5071f97e DL |
1705 | { |
1706 | struct ep_send_events_data esed; | |
1da177e4 | 1707 | |
5071f97e DL |
1708 | esed.maxevents = maxevents; |
1709 | esed.events = events; | |
6192bd53 | 1710 | |
d7ebbe46 AV |
1711 | ep_scan_ready_list(ep, ep_send_events_proc, &esed, 0, false); |
1712 | return esed.res; | |
1da177e4 LT |
1713 | } |
1714 | ||
766b9f92 | 1715 | static inline struct timespec64 ep_set_mstimeout(long ms) |
0781b909 | 1716 | { |
766b9f92 | 1717 | struct timespec64 now, ts = { |
0781b909 ED |
1718 | .tv_sec = ms / MSEC_PER_SEC, |
1719 | .tv_nsec = NSEC_PER_MSEC * (ms % MSEC_PER_SEC), | |
1720 | }; | |
1721 | ||
766b9f92 DD |
1722 | ktime_get_ts64(&now); |
1723 | return timespec64_add_safe(now, ts); | |
0781b909 ED |
1724 | } |
1725 | ||
f4d93ad7 SB |
1726 | /** |
1727 | * ep_poll - Retrieves ready events, and delivers them to the caller supplied | |
1728 | * event buffer. | |
1729 | * | |
1730 | * @ep: Pointer to the eventpoll context. | |
1731 | * @events: Pointer to the userspace buffer where the ready events should be | |
1732 | * stored. | |
1733 | * @maxevents: Size (in terms of number of events) of the caller event buffer. | |
1734 | * @timeout: Maximum timeout for the ready events fetch operation, in | |
1735 | * milliseconds. If the @timeout is zero, the function will not block, | |
1736 | * while if the @timeout is less than zero, the function will block | |
1737 | * until at least one event has been retrieved (or an error | |
1738 | * occurred). | |
1739 | * | |
1740 | * Returns: Returns the number of ready events which have been fetched, or an | |
1741 | * error code, in case of error. | |
1742 | */ | |
1da177e4 LT |
1743 | static int ep_poll(struct eventpoll *ep, struct epoll_event __user *events, |
1744 | int maxevents, long timeout) | |
1745 | { | |
f4d93ad7 | 1746 | int res = 0, eavail, timed_out = 0; |
1da177e4 | 1747 | unsigned long flags; |
da8b44d5 | 1748 | u64 slack = 0; |
ac6424b9 | 1749 | wait_queue_entry_t wait; |
95aac7b1 SB |
1750 | ktime_t expires, *to = NULL; |
1751 | ||
1752 | if (timeout > 0) { | |
766b9f92 | 1753 | struct timespec64 end_time = ep_set_mstimeout(timeout); |
0781b909 | 1754 | |
95aac7b1 SB |
1755 | slack = select_estimate_accuracy(&end_time); |
1756 | to = &expires; | |
766b9f92 | 1757 | *to = timespec64_to_ktime(end_time); |
95aac7b1 | 1758 | } else if (timeout == 0) { |
f4d93ad7 SB |
1759 | /* |
1760 | * Avoid the unnecessary trip to the wait queue loop, if the | |
1761 | * caller specified a non blocking operation. | |
1762 | */ | |
95aac7b1 | 1763 | timed_out = 1; |
f4d93ad7 SB |
1764 | spin_lock_irqsave(&ep->lock, flags); |
1765 | goto check_events; | |
95aac7b1 | 1766 | } |
1da177e4 | 1767 | |
f4d93ad7 | 1768 | fetch_events: |
bf3b9f63 SS |
1769 | |
1770 | if (!ep_events_available(ep)) | |
1771 | ep_busy_loop(ep, timed_out); | |
1772 | ||
c7ea7630 | 1773 | spin_lock_irqsave(&ep->lock, flags); |
1da177e4 | 1774 | |
3fb0e584 | 1775 | if (!ep_events_available(ep)) { |
bf3b9f63 SS |
1776 | /* |
1777 | * Busy poll timed out. Drop NAPI ID for now, we can add | |
1778 | * it back in when we have moved a socket with a valid NAPI | |
1779 | * ID onto the ready list. | |
1780 | */ | |
1781 | ep_reset_busy_poll_napi_id(ep); | |
1782 | ||
1da177e4 LT |
1783 | /* |
1784 | * We don't have any available event to return to the caller. | |
1785 | * We need to sleep here, and we will be wake up by | |
1786 | * ep_poll_callback() when events will become available. | |
1787 | */ | |
1788 | init_waitqueue_entry(&wait, current); | |
a93d2f17 | 1789 | __add_wait_queue_exclusive(&ep->wq, &wait); |
1da177e4 LT |
1790 | |
1791 | for (;;) { | |
1792 | /* | |
1793 | * We don't want to sleep if the ep_poll_callback() sends us | |
1794 | * a wakeup in between. That's why we set the task state | |
1795 | * to TASK_INTERRUPTIBLE before doing the checks. | |
1796 | */ | |
1797 | set_current_state(TASK_INTERRUPTIBLE); | |
c257a340 DR |
1798 | /* |
1799 | * Always short-circuit for fatal signals to allow | |
1800 | * threads to make a timely exit without the chance of | |
1801 | * finding more events available and fetching | |
1802 | * repeatedly. | |
1803 | */ | |
1804 | if (fatal_signal_pending(current)) { | |
1805 | res = -EINTR; | |
1806 | break; | |
1807 | } | |
3fb0e584 | 1808 | if (ep_events_available(ep) || timed_out) |
1da177e4 LT |
1809 | break; |
1810 | if (signal_pending(current)) { | |
1811 | res = -EINTR; | |
1812 | break; | |
1813 | } | |
1814 | ||
c7ea7630 | 1815 | spin_unlock_irqrestore(&ep->lock, flags); |
c511851d | 1816 | if (!schedule_hrtimeout_range(to, slack, HRTIMER_MODE_ABS)) |
95aac7b1 SB |
1817 | timed_out = 1; |
1818 | ||
c7ea7630 | 1819 | spin_lock_irqsave(&ep->lock, flags); |
1da177e4 | 1820 | } |
1da177e4 | 1821 | |
4d5755b1 DB |
1822 | __remove_wait_queue(&ep->wq, &wait); |
1823 | __set_current_state(TASK_RUNNING); | |
1da177e4 | 1824 | } |
f4d93ad7 | 1825 | check_events: |
1da177e4 | 1826 | /* Is it worth to try to dig for events ? */ |
3fb0e584 | 1827 | eavail = ep_events_available(ep); |
1da177e4 | 1828 | |
c7ea7630 | 1829 | spin_unlock_irqrestore(&ep->lock, flags); |
1da177e4 LT |
1830 | |
1831 | /* | |
1832 | * Try to transfer events to user space. In case we get 0 events and | |
1833 | * there's still timeout left over, we go trying again in search of | |
1834 | * more luck. | |
1835 | */ | |
1836 | if (!res && eavail && | |
95aac7b1 | 1837 | !(res = ep_send_events(ep, events, maxevents)) && !timed_out) |
f4d93ad7 | 1838 | goto fetch_events; |
1da177e4 LT |
1839 | |
1840 | return res; | |
1841 | } | |
1842 | ||
22bacca4 DL |
1843 | /** |
1844 | * ep_loop_check_proc - Callback function to be passed to the @ep_call_nested() | |
1845 | * API, to verify that adding an epoll file inside another | |
1846 | * epoll structure, does not violate the constraints, in | |
1847 | * terms of closed loops, or too deep chains (which can | |
1848 | * result in excessive stack usage). | |
1849 | * | |
1850 | * @priv: Pointer to the epoll file to be currently checked. | |
1851 | * @cookie: Original cookie for this call. This is the top-of-the-chain epoll | |
1852 | * data structure pointer. | |
1853 | * @call_nests: Current dept of the @ep_call_nested() call stack. | |
1854 | * | |
1855 | * Returns: Returns zero if adding the epoll @file inside current epoll | |
1856 | * structure @ep does not violate the constraints, or -1 otherwise. | |
1857 | */ | |
1858 | static int ep_loop_check_proc(void *priv, void *cookie, int call_nests) | |
1859 | { | |
1860 | int error = 0; | |
1861 | struct file *file = priv; | |
1862 | struct eventpoll *ep = file->private_data; | |
28d82dc1 | 1863 | struct eventpoll *ep_tovisit; |
22bacca4 DL |
1864 | struct rb_node *rbp; |
1865 | struct epitem *epi; | |
1866 | ||
d8805e63 | 1867 | mutex_lock_nested(&ep->mtx, call_nests + 1); |
28d82dc1 JB |
1868 | ep->visited = 1; |
1869 | list_add(&ep->visited_list_link, &visited_list); | |
b2ac2ea6 | 1870 | for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { |
22bacca4 DL |
1871 | epi = rb_entry(rbp, struct epitem, rbn); |
1872 | if (unlikely(is_file_epoll(epi->ffd.file))) { | |
28d82dc1 JB |
1873 | ep_tovisit = epi->ffd.file->private_data; |
1874 | if (ep_tovisit->visited) | |
1875 | continue; | |
22bacca4 | 1876 | error = ep_call_nested(&poll_loop_ncalls, EP_MAX_NESTS, |
28d82dc1 JB |
1877 | ep_loop_check_proc, epi->ffd.file, |
1878 | ep_tovisit, current); | |
22bacca4 DL |
1879 | if (error != 0) |
1880 | break; | |
28d82dc1 JB |
1881 | } else { |
1882 | /* | |
1883 | * If we've reached a file that is not associated with | |
1884 | * an ep, then we need to check if the newly added | |
1885 | * links are going to add too many wakeup paths. We do | |
1886 | * this by adding it to the tfile_check_list, if it's | |
1887 | * not already there, and calling reverse_path_check() | |
1888 | * during ep_insert(). | |
1889 | */ | |
1890 | if (list_empty(&epi->ffd.file->f_tfile_llink)) | |
1891 | list_add(&epi->ffd.file->f_tfile_llink, | |
1892 | &tfile_check_list); | |
22bacca4 DL |
1893 | } |
1894 | } | |
1895 | mutex_unlock(&ep->mtx); | |
1896 | ||
1897 | return error; | |
1898 | } | |
1899 | ||
1900 | /** | |
1901 | * ep_loop_check - Performs a check to verify that adding an epoll file (@file) | |
1902 | * another epoll file (represented by @ep) does not create | |
1903 | * closed loops or too deep chains. | |
1904 | * | |
1905 | * @ep: Pointer to the epoll private data structure. | |
1906 | * @file: Pointer to the epoll file to be checked. | |
1907 | * | |
1908 | * Returns: Returns zero if adding the epoll @file inside current epoll | |
1909 | * structure @ep does not violate the constraints, or -1 otherwise. | |
1910 | */ | |
1911 | static int ep_loop_check(struct eventpoll *ep, struct file *file) | |
1912 | { | |
28d82dc1 JB |
1913 | int ret; |
1914 | struct eventpoll *ep_cur, *ep_next; | |
1915 | ||
1916 | ret = ep_call_nested(&poll_loop_ncalls, EP_MAX_NESTS, | |
22bacca4 | 1917 | ep_loop_check_proc, file, ep, current); |
28d82dc1 JB |
1918 | /* clear visited list */ |
1919 | list_for_each_entry_safe(ep_cur, ep_next, &visited_list, | |
1920 | visited_list_link) { | |
1921 | ep_cur->visited = 0; | |
1922 | list_del(&ep_cur->visited_list_link); | |
1923 | } | |
1924 | return ret; | |
1925 | } | |
1926 | ||
1927 | static void clear_tfile_check_list(void) | |
1928 | { | |
1929 | struct file *file; | |
1930 | ||
1931 | /* first clear the tfile_check_list */ | |
1932 | while (!list_empty(&tfile_check_list)) { | |
1933 | file = list_first_entry(&tfile_check_list, struct file, | |
1934 | f_tfile_llink); | |
1935 | list_del_init(&file->f_tfile_llink); | |
1936 | } | |
1937 | INIT_LIST_HEAD(&tfile_check_list); | |
22bacca4 DL |
1938 | } |
1939 | ||
7699acd1 | 1940 | /* |
523723bb | 1941 | * Open an eventpoll file descriptor. |
7699acd1 | 1942 | */ |
791eb22e | 1943 | static int do_epoll_create(int flags) |
7699acd1 | 1944 | { |
28d82dc1 | 1945 | int error, fd; |
bb57c3ed | 1946 | struct eventpoll *ep = NULL; |
28d82dc1 | 1947 | struct file *file; |
7699acd1 | 1948 | |
e38b36f3 UD |
1949 | /* Check the EPOLL_* constant for consistency. */ |
1950 | BUILD_BUG_ON(EPOLL_CLOEXEC != O_CLOEXEC); | |
1951 | ||
296e236e DL |
1952 | if (flags & ~EPOLL_CLOEXEC) |
1953 | return -EINVAL; | |
7699acd1 | 1954 | /* |
bb57c3ed | 1955 | * Create the internal data structure ("struct eventpoll"). |
7699acd1 | 1956 | */ |
9fe5ad9c | 1957 | error = ep_alloc(&ep); |
bb57c3ed DL |
1958 | if (error < 0) |
1959 | return error; | |
7699acd1 DL |
1960 | /* |
1961 | * Creates all the items needed to setup an eventpoll file. That is, | |
2030a42c | 1962 | * a file structure and a free file descriptor. |
7699acd1 | 1963 | */ |
28d82dc1 JB |
1964 | fd = get_unused_fd_flags(O_RDWR | (flags & O_CLOEXEC)); |
1965 | if (fd < 0) { | |
1966 | error = fd; | |
1967 | goto out_free_ep; | |
1968 | } | |
1969 | file = anon_inode_getfile("[eventpoll]", &eventpoll_fops, ep, | |
628ff7c1 | 1970 | O_RDWR | (flags & O_CLOEXEC)); |
28d82dc1 JB |
1971 | if (IS_ERR(file)) { |
1972 | error = PTR_ERR(file); | |
1973 | goto out_free_fd; | |
1974 | } | |
28d82dc1 | 1975 | ep->file = file; |
98022748 | 1976 | fd_install(fd, file); |
28d82dc1 JB |
1977 | return fd; |
1978 | ||
1979 | out_free_fd: | |
1980 | put_unused_fd(fd); | |
1981 | out_free_ep: | |
1982 | ep_free(ep); | |
bb57c3ed | 1983 | return error; |
7699acd1 DL |
1984 | } |
1985 | ||
791eb22e DB |
1986 | SYSCALL_DEFINE1(epoll_create1, int, flags) |
1987 | { | |
1988 | return do_epoll_create(flags); | |
1989 | } | |
1990 | ||
5a8a82b1 | 1991 | SYSCALL_DEFINE1(epoll_create, int, size) |
a0998b50 | 1992 | { |
bfe3891a | 1993 | if (size <= 0) |
9fe5ad9c UD |
1994 | return -EINVAL; |
1995 | ||
791eb22e | 1996 | return do_epoll_create(0); |
a0998b50 UD |
1997 | } |
1998 | ||
7699acd1 DL |
1999 | /* |
2000 | * The following function implements the controller interface for | |
2001 | * the eventpoll file that enables the insertion/removal/change of | |
67647d0f | 2002 | * file descriptors inside the interest set. |
7699acd1 | 2003 | */ |
5a8a82b1 HC |
2004 | SYSCALL_DEFINE4(epoll_ctl, int, epfd, int, op, int, fd, |
2005 | struct epoll_event __user *, event) | |
7699acd1 DL |
2006 | { |
2007 | int error; | |
67347fe4 | 2008 | int full_check = 0; |
7e3fb584 | 2009 | struct fd f, tf; |
7699acd1 DL |
2010 | struct eventpoll *ep; |
2011 | struct epitem *epi; | |
2012 | struct epoll_event epds; | |
67347fe4 | 2013 | struct eventpoll *tep = NULL; |
7699acd1 | 2014 | |
7699acd1 DL |
2015 | error = -EFAULT; |
2016 | if (ep_op_has_event(op) && | |
2017 | copy_from_user(&epds, event, sizeof(struct epoll_event))) | |
2018 | goto error_return; | |
2019 | ||
7699acd1 | 2020 | error = -EBADF; |
7e3fb584 AV |
2021 | f = fdget(epfd); |
2022 | if (!f.file) | |
7699acd1 DL |
2023 | goto error_return; |
2024 | ||
2025 | /* Get the "struct file *" for the target file */ | |
7e3fb584 AV |
2026 | tf = fdget(fd); |
2027 | if (!tf.file) | |
7699acd1 DL |
2028 | goto error_fput; |
2029 | ||
2030 | /* The target file descriptor must support poll */ | |
2031 | error = -EPERM; | |
9965ed17 | 2032 | if (!file_can_poll(tf.file)) |
7699acd1 DL |
2033 | goto error_tgt_fput; |
2034 | ||
4d7e30d9 | 2035 | /* Check if EPOLLWAKEUP is allowed */ |
c680e41b NI |
2036 | if (ep_op_has_event(op)) |
2037 | ep_take_care_of_epollwakeup(&epds); | |
4d7e30d9 | 2038 | |
7699acd1 DL |
2039 | /* |
2040 | * We have to check that the file structure underneath the file descriptor | |
2041 | * the user passed to us _is_ an eventpoll file. And also we do not permit | |
2042 | * adding an epoll file descriptor inside itself. | |
2043 | */ | |
2044 | error = -EINVAL; | |
7e3fb584 | 2045 | if (f.file == tf.file || !is_file_epoll(f.file)) |
7699acd1 DL |
2046 | goto error_tgt_fput; |
2047 | ||
df0108c5 JB |
2048 | /* |
2049 | * epoll adds to the wakeup queue at EPOLL_CTL_ADD time only, | |
2050 | * so EPOLLEXCLUSIVE is not allowed for a EPOLL_CTL_MOD operation. | |
2051 | * Also, we do not currently supported nested exclusive wakeups. | |
2052 | */ | |
c857ab64 | 2053 | if (ep_op_has_event(op) && (epds.events & EPOLLEXCLUSIVE)) { |
b6a515c8 JB |
2054 | if (op == EPOLL_CTL_MOD) |
2055 | goto error_tgt_fput; | |
2056 | if (op == EPOLL_CTL_ADD && (is_file_epoll(tf.file) || | |
2057 | (epds.events & ~EPOLLEXCLUSIVE_OK_BITS))) | |
2058 | goto error_tgt_fput; | |
2059 | } | |
df0108c5 | 2060 | |
7699acd1 DL |
2061 | /* |
2062 | * At this point it is safe to assume that the "private_data" contains | |
2063 | * our own data structure. | |
2064 | */ | |
7e3fb584 | 2065 | ep = f.file->private_data; |
7699acd1 | 2066 | |
22bacca4 DL |
2067 | /* |
2068 | * When we insert an epoll file descriptor, inside another epoll file | |
2069 | * descriptor, there is the change of creating closed loops, which are | |
28d82dc1 JB |
2070 | * better be handled here, than in more critical paths. While we are |
2071 | * checking for loops we also determine the list of files reachable | |
2072 | * and hang them on the tfile_check_list, so we can check that we | |
2073 | * haven't created too many possible wakeup paths. | |
22bacca4 | 2074 | * |
67347fe4 JB |
2075 | * We do not need to take the global 'epumutex' on EPOLL_CTL_ADD when |
2076 | * the epoll file descriptor is attaching directly to a wakeup source, | |
2077 | * unless the epoll file descriptor is nested. The purpose of taking the | |
2078 | * 'epmutex' on add is to prevent complex toplogies such as loops and | |
2079 | * deep wakeup paths from forming in parallel through multiple | |
2080 | * EPOLL_CTL_ADD operations. | |
22bacca4 | 2081 | */ |
67347fe4 | 2082 | mutex_lock_nested(&ep->mtx, 0); |
28d82dc1 | 2083 | if (op == EPOLL_CTL_ADD) { |
67347fe4 JB |
2084 | if (!list_empty(&f.file->f_ep_links) || |
2085 | is_file_epoll(tf.file)) { | |
2086 | full_check = 1; | |
2087 | mutex_unlock(&ep->mtx); | |
2088 | mutex_lock(&epmutex); | |
2089 | if (is_file_epoll(tf.file)) { | |
2090 | error = -ELOOP; | |
2091 | if (ep_loop_check(ep, tf.file) != 0) { | |
2092 | clear_tfile_check_list(); | |
2093 | goto error_tgt_fput; | |
2094 | } | |
2095 | } else | |
2096 | list_add(&tf.file->f_tfile_llink, | |
2097 | &tfile_check_list); | |
2098 | mutex_lock_nested(&ep->mtx, 0); | |
2099 | if (is_file_epoll(tf.file)) { | |
2100 | tep = tf.file->private_data; | |
2101 | mutex_lock_nested(&tep->mtx, 1); | |
13d51807 | 2102 | } |
67347fe4 JB |
2103 | } |
2104 | } | |
7699acd1 | 2105 | |
67647d0f DL |
2106 | /* |
2107 | * Try to lookup the file inside our RB tree, Since we grabbed "mtx" | |
2108 | * above, we can be sure to be able to use the item looked up by | |
2109 | * ep_find() till we release the mutex. | |
2110 | */ | |
7e3fb584 | 2111 | epi = ep_find(ep, tf.file, fd); |
7699acd1 DL |
2112 | |
2113 | error = -EINVAL; | |
2114 | switch (op) { | |
2115 | case EPOLL_CTL_ADD: | |
2116 | if (!epi) { | |
a9a08845 | 2117 | epds.events |= EPOLLERR | EPOLLHUP; |
67347fe4 | 2118 | error = ep_insert(ep, &epds, tf.file, fd, full_check); |
7699acd1 DL |
2119 | } else |
2120 | error = -EEXIST; | |
67347fe4 JB |
2121 | if (full_check) |
2122 | clear_tfile_check_list(); | |
7699acd1 DL |
2123 | break; |
2124 | case EPOLL_CTL_DEL: | |
2125 | if (epi) | |
2126 | error = ep_remove(ep, epi); | |
2127 | else | |
2128 | error = -ENOENT; | |
2129 | break; | |
2130 | case EPOLL_CTL_MOD: | |
2131 | if (epi) { | |
b6a515c8 | 2132 | if (!(epi->event.events & EPOLLEXCLUSIVE)) { |
a9a08845 | 2133 | epds.events |= EPOLLERR | EPOLLHUP; |
b6a515c8 JB |
2134 | error = ep_modify(ep, epi, &epds); |
2135 | } | |
7699acd1 DL |
2136 | } else |
2137 | error = -ENOENT; | |
2138 | break; | |
2139 | } | |
67347fe4 JB |
2140 | if (tep != NULL) |
2141 | mutex_unlock(&tep->mtx); | |
d47de16c | 2142 | mutex_unlock(&ep->mtx); |
7699acd1 DL |
2143 | |
2144 | error_tgt_fput: | |
67347fe4 | 2145 | if (full_check) |
22bacca4 DL |
2146 | mutex_unlock(&epmutex); |
2147 | ||
7e3fb584 | 2148 | fdput(tf); |
7699acd1 | 2149 | error_fput: |
7e3fb584 | 2150 | fdput(f); |
7699acd1 | 2151 | error_return: |
7699acd1 DL |
2152 | |
2153 | return error; | |
2154 | } | |
2155 | ||
2156 | /* | |
2157 | * Implement the event wait interface for the eventpoll file. It is the kernel | |
2158 | * part of the user space epoll_wait(2). | |
2159 | */ | |
791eb22e DB |
2160 | static int do_epoll_wait(int epfd, struct epoll_event __user *events, |
2161 | int maxevents, int timeout) | |
7699acd1 | 2162 | { |
2903ff01 AV |
2163 | int error; |
2164 | struct fd f; | |
7699acd1 DL |
2165 | struct eventpoll *ep; |
2166 | ||
7699acd1 DL |
2167 | /* The maximum number of event must be greater than zero */ |
2168 | if (maxevents <= 0 || maxevents > EP_MAX_EVENTS) | |
2169 | return -EINVAL; | |
2170 | ||
2171 | /* Verify that the area passed by the user is writeable */ | |
2903ff01 AV |
2172 | if (!access_ok(VERIFY_WRITE, events, maxevents * sizeof(struct epoll_event))) |
2173 | return -EFAULT; | |
7699acd1 DL |
2174 | |
2175 | /* Get the "struct file *" for the eventpoll file */ | |
2903ff01 AV |
2176 | f = fdget(epfd); |
2177 | if (!f.file) | |
2178 | return -EBADF; | |
7699acd1 DL |
2179 | |
2180 | /* | |
2181 | * We have to check that the file structure underneath the fd | |
2182 | * the user passed to us _is_ an eventpoll file. | |
2183 | */ | |
2184 | error = -EINVAL; | |
2903ff01 | 2185 | if (!is_file_epoll(f.file)) |
7699acd1 DL |
2186 | goto error_fput; |
2187 | ||
2188 | /* | |
2189 | * At this point it is safe to assume that the "private_data" contains | |
2190 | * our own data structure. | |
2191 | */ | |
2903ff01 | 2192 | ep = f.file->private_data; |
7699acd1 DL |
2193 | |
2194 | /* Time to fish for events ... */ | |
2195 | error = ep_poll(ep, events, maxevents, timeout); | |
2196 | ||
2197 | error_fput: | |
2903ff01 | 2198 | fdput(f); |
7699acd1 DL |
2199 | return error; |
2200 | } | |
2201 | ||
791eb22e DB |
2202 | SYSCALL_DEFINE4(epoll_wait, int, epfd, struct epoll_event __user *, events, |
2203 | int, maxevents, int, timeout) | |
2204 | { | |
2205 | return do_epoll_wait(epfd, events, maxevents, timeout); | |
2206 | } | |
2207 | ||
7699acd1 DL |
2208 | /* |
2209 | * Implement the event wait interface for the eventpoll file. It is the kernel | |
2210 | * part of the user space epoll_pwait(2). | |
2211 | */ | |
5a8a82b1 HC |
2212 | SYSCALL_DEFINE6(epoll_pwait, int, epfd, struct epoll_event __user *, events, |
2213 | int, maxevents, int, timeout, const sigset_t __user *, sigmask, | |
2214 | size_t, sigsetsize) | |
7699acd1 DL |
2215 | { |
2216 | int error; | |
2217 | sigset_t ksigmask, sigsaved; | |
2218 | ||
2219 | /* | |
2220 | * If the caller wants a certain signal mask to be set during the wait, | |
2221 | * we apply it here. | |
2222 | */ | |
2223 | if (sigmask) { | |
2224 | if (sigsetsize != sizeof(sigset_t)) | |
2225 | return -EINVAL; | |
2226 | if (copy_from_user(&ksigmask, sigmask, sizeof(ksigmask))) | |
2227 | return -EFAULT; | |
77d55918 ON |
2228 | sigsaved = current->blocked; |
2229 | set_current_blocked(&ksigmask); | |
7699acd1 DL |
2230 | } |
2231 | ||
791eb22e | 2232 | error = do_epoll_wait(epfd, events, maxevents, timeout); |
7699acd1 DL |
2233 | |
2234 | /* | |
2235 | * If we changed the signal mask, we need to restore the original one. | |
2236 | * In case we've got a signal while waiting, we do not restore the | |
2237 | * signal mask yet, and we allow do_signal() to deliver the signal on | |
2238 | * the way back to userspace, before the signal mask is restored. | |
2239 | */ | |
2240 | if (sigmask) { | |
2241 | if (error == -EINTR) { | |
2242 | memcpy(¤t->saved_sigmask, &sigsaved, | |
c7ea7630 | 2243 | sizeof(sigsaved)); |
4e4c22c7 | 2244 | set_restore_sigmask(); |
7699acd1 | 2245 | } else |
77d55918 | 2246 | set_current_blocked(&sigsaved); |
7699acd1 DL |
2247 | } |
2248 | ||
2249 | return error; | |
2250 | } | |
2251 | ||
35280bd4 AV |
2252 | #ifdef CONFIG_COMPAT |
2253 | COMPAT_SYSCALL_DEFINE6(epoll_pwait, int, epfd, | |
2254 | struct epoll_event __user *, events, | |
2255 | int, maxevents, int, timeout, | |
2256 | const compat_sigset_t __user *, sigmask, | |
2257 | compat_size_t, sigsetsize) | |
2258 | { | |
2259 | long err; | |
35280bd4 AV |
2260 | sigset_t ksigmask, sigsaved; |
2261 | ||
2262 | /* | |
2263 | * If the caller wants a certain signal mask to be set during the wait, | |
2264 | * we apply it here. | |
2265 | */ | |
2266 | if (sigmask) { | |
2267 | if (sigsetsize != sizeof(compat_sigset_t)) | |
2268 | return -EINVAL; | |
3968cf62 | 2269 | if (get_compat_sigset(&ksigmask, sigmask)) |
35280bd4 | 2270 | return -EFAULT; |
77d55918 ON |
2271 | sigsaved = current->blocked; |
2272 | set_current_blocked(&ksigmask); | |
35280bd4 AV |
2273 | } |
2274 | ||
791eb22e | 2275 | err = do_epoll_wait(epfd, events, maxevents, timeout); |
35280bd4 AV |
2276 | |
2277 | /* | |
2278 | * If we changed the signal mask, we need to restore the original one. | |
2279 | * In case we've got a signal while waiting, we do not restore the | |
2280 | * signal mask yet, and we allow do_signal() to deliver the signal on | |
2281 | * the way back to userspace, before the signal mask is restored. | |
2282 | */ | |
2283 | if (sigmask) { | |
2284 | if (err == -EINTR) { | |
2285 | memcpy(¤t->saved_sigmask, &sigsaved, | |
2286 | sizeof(sigsaved)); | |
2287 | set_restore_sigmask(); | |
2288 | } else | |
77d55918 | 2289 | set_current_blocked(&sigsaved); |
35280bd4 AV |
2290 | } |
2291 | ||
2292 | return err; | |
2293 | } | |
2294 | #endif | |
2295 | ||
1da177e4 LT |
2296 | static int __init eventpoll_init(void) |
2297 | { | |
7ef9964e DL |
2298 | struct sysinfo si; |
2299 | ||
2300 | si_meminfo(&si); | |
9df04e1f DL |
2301 | /* |
2302 | * Allows top 4% of lomem to be allocated for epoll watches (per user). | |
2303 | */ | |
2304 | max_user_watches = (((si.totalram - si.totalhigh) / 25) << PAGE_SHIFT) / | |
7ef9964e | 2305 | EP_ITEM_COST; |
52bd19f7 | 2306 | BUG_ON(max_user_watches < 0); |
1da177e4 | 2307 | |
22bacca4 DL |
2308 | /* |
2309 | * Initialize the structure used to perform epoll file descriptor | |
2310 | * inclusion loops checks. | |
2311 | */ | |
2312 | ep_nested_calls_init(&poll_loop_ncalls); | |
2313 | ||
57a173bd | 2314 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
1da177e4 | 2315 | /* Initialize the structure used to perform safe poll wait head wake ups */ |
5071f97e | 2316 | ep_nested_calls_init(&poll_safewake_ncalls); |
57a173bd | 2317 | #endif |
1da177e4 | 2318 | |
39732ca5 EW |
2319 | /* |
2320 | * We can have many thousands of epitems, so prevent this from | |
2321 | * using an extra cache line on 64-bit (and smaller) CPUs | |
2322 | */ | |
2323 | BUILD_BUG_ON(sizeof(void *) <= 8 && sizeof(struct epitem) > 128); | |
2324 | ||
1da177e4 LT |
2325 | /* Allocates slab cache used to allocate "struct epitem" items */ |
2326 | epi_cache = kmem_cache_create("eventpoll_epi", sizeof(struct epitem), | |
2ae928a9 | 2327 | 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC|SLAB_ACCOUNT, NULL); |
1da177e4 LT |
2328 | |
2329 | /* Allocates slab cache used to allocate "struct eppoll_entry" */ | |
2330 | pwq_cache = kmem_cache_create("eventpoll_pwq", | |
2ae928a9 | 2331 | sizeof(struct eppoll_entry), 0, SLAB_PANIC|SLAB_ACCOUNT, NULL); |
1da177e4 | 2332 | |
1da177e4 | 2333 | return 0; |
1da177e4 | 2334 | } |
cea69241 | 2335 | fs_initcall(eventpoll_init); |