1 | /* |
1 | /* |
|
|
2 | * libev epoll fd activity backend |
|
|
3 | * |
2 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
3 | * All rights reserved. |
5 | * All rights reserved. |
4 | * |
6 | * |
5 | * Redistribution and use in source and binary forms, with or without |
7 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions are |
8 | * modification, are permitted provided that the following conditions are |
… | |
… | |
27 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
30 | */ |
29 | |
31 | |
30 | #include <sys/epoll.h> |
32 | #include <sys/epoll.h> |
31 | |
33 | |
32 | static int epoll_fd = -1; |
|
|
33 | |
|
|
34 | static void |
34 | static void |
35 | epoll_modify (int fd, int oev, int nev) |
35 | epoll_modify (EV_P_ int fd, int oev, int nev) |
36 | { |
36 | { |
37 | int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL; |
37 | int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL; |
38 | |
38 | |
39 | struct epoll_event ev; |
39 | struct epoll_event ev; |
40 | ev.data.fd = fd; |
40 | ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */ |
41 | ev.events = |
41 | ev.events = |
42 | (nev & EV_READ ? EPOLLIN : 0) |
42 | (nev & EV_READ ? EPOLLIN : 0) |
43 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
43 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
44 | |
44 | |
45 | epoll_ctl (epoll_fd, mode, fd, &ev); |
45 | if (epoll_ctl (epoll_fd, mode, fd, &ev)) |
|
|
46 | if (errno != ENOENT /* on ENOENT the fd went away, so try to do the right thing */ |
|
|
47 | || (nev && epoll_ctl (epoll_fd, EPOLL_CTL_ADD, fd, &ev))) |
|
|
48 | fd_kill (EV_A_ fd); |
46 | } |
49 | } |
47 | |
50 | |
48 | void epoll_postfork_child (void) |
51 | static void |
|
|
52 | epoll_poll (EV_P_ ev_tstamp timeout) |
49 | { |
53 | { |
50 | int fd; |
|
|
51 | |
|
|
52 | epoll_fd = epoll_create (256); |
|
|
53 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
|
|
54 | |
|
|
55 | /* re-register interest in fds */ |
|
|
56 | for (fd = 0; fd < anfdmax; ++fd) |
|
|
57 | if (anfds [fd].wev) |
|
|
58 | epoll_modify (fd, EV_NONE, anfds [fd].wev); |
|
|
59 | } |
|
|
60 | |
|
|
61 | static struct epoll_event *events; |
|
|
62 | static int eventmax; |
|
|
63 | |
|
|
64 | static void epoll_poll (ev_tstamp timeout) |
|
|
65 | { |
|
|
66 | int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); |
|
|
67 | int i; |
54 | int i; |
|
|
55 | int eventcnt = epoll_wait (epoll_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); |
68 | |
56 | |
69 | if (eventcnt < 0) |
57 | if (eventcnt < 0) |
|
|
58 | { |
|
|
59 | if (errno != EINTR) |
|
|
60 | syserr ("(libev) epoll_wait"); |
|
|
61 | |
70 | return; |
62 | return; |
|
|
63 | } |
71 | |
64 | |
72 | for (i = 0; i < eventcnt; ++i) |
65 | for (i = 0; i < eventcnt; ++i) |
73 | fd_event ( |
66 | fd_event ( |
|
|
67 | EV_A_ |
74 | events [i].data.fd, |
68 | epoll_events [i].data.u64, |
75 | (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
69 | (epoll_events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
76 | | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) |
70 | | (epoll_events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) |
77 | ); |
71 | ); |
78 | |
72 | |
79 | /* if the receive array was full, increase its size */ |
73 | /* if the receive array was full, increase its size */ |
80 | if (eventcnt == eventmax) |
74 | if (expect_false (eventcnt == epoll_eventmax)) |
81 | { |
75 | { |
82 | free (events); |
76 | ev_free (epoll_events); |
83 | eventmax += eventmax >> 1; |
77 | epoll_eventmax = array_roundsize (epoll_events, epoll_eventmax << 1); |
84 | events = malloc (sizeof (struct epoll_event) * eventmax); |
78 | epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
85 | } |
79 | } |
86 | } |
80 | } |
87 | |
81 | |
|
|
82 | static int |
88 | void epoll_init (int flags) |
83 | epoll_init (EV_P_ int flags) |
89 | { |
84 | { |
90 | epoll_fd = epoll_create (256); |
85 | epoll_fd = epoll_create (256); |
91 | |
86 | |
92 | if (epoll_fd < 0) |
87 | if (epoll_fd < 0) |
93 | return; |
88 | return 0; |
94 | |
89 | |
95 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
90 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
96 | |
91 | |
97 | ev_method = EVMETHOD_EPOLL; |
|
|
98 | method_fudge = 1e-3; /* needed to compensate for epoll returning early */ |
92 | method_fudge = 1e-3; /* needed to compensate for epoll returning early */ |
99 | method_modify = epoll_modify; |
93 | method_modify = epoll_modify; |
100 | method_poll = epoll_poll; |
94 | method_poll = epoll_poll; |
101 | |
95 | |
102 | eventmax = 64; /* intiial number of events receivable per poll */ |
96 | epoll_eventmax = 64; /* intiial number of events receivable per poll */ |
103 | events = malloc (sizeof (struct epoll_event) * eventmax); |
97 | epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
|
|
98 | |
|
|
99 | return EVBACKEND_EPOLL; |
104 | } |
100 | } |
|
|
101 | |
|
|
102 | static void |
|
|
103 | epoll_destroy (EV_P) |
|
|
104 | { |
|
|
105 | close (epoll_fd); |
|
|
106 | |
|
|
107 | ev_free (epoll_events); |
|
|
108 | } |
|
|
109 | |
|
|
110 | static void |
|
|
111 | epoll_fork (EV_P) |
|
|
112 | { |
|
|
113 | close (epoll_fd); |
|
|
114 | |
|
|
115 | while ((epoll_fd = epoll_create (256)) < 0) |
|
|
116 | syserr ("(libev) epoll_create"); |
|
|
117 | |
|
|
118 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
|
|
119 | |
|
|
120 | fd_rearm_all (EV_A); |
|
|
121 | } |
|
|
122 | |