ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_epoll.c
Revision: 1.19
Committed: Sun Nov 4 23:14:11 2007 UTC (16 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.18: +3 -1 lines
Log Message:
- have to re-check potentially closed fds regularly for epoll. this hurts
  badly :(
- still more than twice as fats as libevent.
- many minor fixes

File Contents

# Content
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
32 #include <sys/epoll.h>
33
34 static void
35 epoll_modify (EV_P_ int fd, int oev, int nev)
36 {
37 int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL;
38
39 struct epoll_event ev;
40 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */
41 ev.events =
42 (nev & EV_READ ? EPOLLIN : 0)
43 | (nev & EV_WRITE ? EPOLLOUT : 0);
44
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);
49 }
50
51 static void
52 epoll_poll (EV_P_ ev_tstamp timeout)
53 {
54 int eventcnt = epoll_wait (epoll_fd, epoll_events, epoll_eventmax, ceil (timeout * 1000.));
55 int i;
56
57 if (eventcnt < 0)
58 return;
59
60 for (i = 0; i < eventcnt; ++i)
61 fd_event (
62 EV_A_
63 epoll_events [i].data.u64,
64 (epoll_events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
65 | (epoll_events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0)
66 );
67
68 /* if the receive array was full, increase its size */
69 if (expect_false (eventcnt == epoll_eventmax))
70 {
71 free (epoll_events);
72 epoll_eventmax = array_roundsize (epoll_events, epoll_eventmax << 1);
73 epoll_events = malloc (sizeof (struct epoll_event) * epoll_eventmax);
74 }
75 }
76
77 static int
78 epoll_init (EV_P_ int flags)
79 {
80 epoll_fd = epoll_create (256);
81
82 if (epoll_fd < 0)
83 return 0;
84
85 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
86
87 method_fudge = 1e-3; /* needed to compensate for epoll returning early */
88 method_modify = epoll_modify;
89 method_poll = epoll_poll;
90
91 epoll_eventmax = 64; /* intiial number of events receivable per poll */
92 epoll_events = malloc (sizeof (struct epoll_event) * epoll_eventmax);
93
94 return EVMETHOD_EPOLL;
95 }
96
97 static void
98 epoll_destroy (EV_P)
99 {
100 close (epoll_fd);
101
102 free (epoll_events);
103 }
104
105 static void
106 epoll_fork (EV_P)
107 {
108 epoll_fd = epoll_create (256);
109 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
110
111 fd_rearm_all (EV_A);
112 }
113