|
|
1 | /* |
|
|
2 | * libev epoll fd activity backend |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
|
|
5 | * All rights reserved. |
|
|
6 | * |
|
|
7 | * Redistribution and use in source and binary forms, with or without |
|
|
8 | * modification, are permitted provided that the following conditions are |
|
|
9 | * met: |
|
|
10 | * |
|
|
11 | * * Redistributions of source code must retain the above copyright |
|
|
12 | * notice, this list of conditions and the following disclaimer. |
|
|
13 | * |
|
|
14 | * * Redistributions in binary form must reproduce the above |
|
|
15 | * copyright notice, this list of conditions and the following |
|
|
16 | * disclaimer in the documentation and/or other materials provided |
|
|
17 | * with the distribution. |
|
|
18 | * |
|
|
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
|
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
|
21 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
|
22 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
|
23 | * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
|
24 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
|
25 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
|
26 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
|
27 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
|
28 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
|
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
30 | */ |
|
|
31 | |
1 | #include <sys/epoll.h> |
32 | #include <sys/epoll.h> |
2 | |
33 | |
3 | static int epoll_fd = -1; |
34 | static int epoll_fd = -1; |
4 | |
35 | |
5 | static void |
36 | static void |
… | |
… | |
14 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
45 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
15 | |
46 | |
16 | epoll_ctl (epoll_fd, mode, fd, &ev); |
47 | epoll_ctl (epoll_fd, mode, fd, &ev); |
17 | } |
48 | } |
18 | |
49 | |
|
|
50 | static void |
19 | void epoll_postfork_child (void) |
51 | epoll_postfork_child (void) |
20 | { |
52 | { |
21 | int fd; |
53 | int fd; |
22 | |
54 | |
23 | epoll_fd = epoll_create (256); |
55 | epoll_fd = epoll_create (256); |
24 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
56 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
25 | |
57 | |
26 | /* re-register interest in fds */ |
58 | /* re-register interest in fds */ |
27 | for (fd = 0; fd < anfdmax; ++fd) |
59 | for (fd = 0; fd < anfdmax; ++fd) |
28 | if (anfds [fd].wev) |
60 | if (anfds [fd].events)//D |
29 | epoll_modify (fd, EV_NONE, anfds [fd].wev); |
61 | epoll_modify (fd, EV_NONE, anfds [fd].events); |
30 | } |
62 | } |
31 | |
63 | |
32 | static struct epoll_event *events; |
64 | static struct epoll_event *events; |
33 | static int eventmax; |
65 | static int eventmax; |
34 | |
66 | |
|
|
67 | static void |
35 | static void epoll_poll (ev_tstamp timeout) |
68 | epoll_poll (ev_tstamp timeout) |
36 | { |
69 | { |
37 | int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); |
70 | int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); |
38 | int i; |
71 | int i; |
39 | |
72 | |
40 | if (eventcnt < 0) |
73 | if (eventcnt < 0) |
… | |
… | |
46 | (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
79 | (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
47 | | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) |
80 | | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) |
48 | ); |
81 | ); |
49 | |
82 | |
50 | /* if the receive array was full, increase its size */ |
83 | /* if the receive array was full, increase its size */ |
51 | if (eventcnt == eventmax) |
84 | if (expect_false (eventcnt == eventmax)) |
52 | { |
85 | { |
53 | free (events); |
86 | free (events); |
54 | eventmax += eventmax >> 1; |
87 | eventmax = array_roundsize (events, eventmax << 1); |
55 | events = malloc (sizeof (struct epoll_event) * eventmax); |
88 | events = malloc (sizeof (struct epoll_event) * eventmax); |
56 | } |
89 | } |
57 | } |
90 | } |
58 | |
91 | |
|
|
92 | static void |
59 | void epoll_init (int flags) |
93 | epoll_init (int flags) |
60 | { |
94 | { |
61 | epoll_fd = epoll_create (256); |
95 | epoll_fd = epoll_create (256); |
62 | |
96 | |
63 | if (epoll_fd < 0) |
97 | if (epoll_fd < 0) |
64 | return; |
98 | return; |
… | |
… | |
71 | method_poll = epoll_poll; |
105 | method_poll = epoll_poll; |
72 | |
106 | |
73 | eventmax = 64; /* intiial number of events receivable per poll */ |
107 | eventmax = 64; /* intiial number of events receivable per poll */ |
74 | events = malloc (sizeof (struct epoll_event) * eventmax); |
108 | events = malloc (sizeof (struct epoll_event) * eventmax); |
75 | } |
109 | } |
|
|
110 | |