ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_epoll.c
(Generate patch)

Comparing libev/ev_epoll.c (file contents):
Revision 1.3 by root, Wed Oct 31 00:24:16 2007 UTC vs.
Revision 1.28 by root, Wed Dec 5 13:54:36 2007 UTC

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
3static int epoll_fd = -1;
4
5static void 34static void
6epoll_modify (int fd, int oev, int nev) 35epoll_modify (EV_P_ int fd, int oev, int nev)
7{ 36{
8 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;
9 38
10 struct epoll_event ev; 39 struct epoll_event ev;
11 ev.data.fd = fd; 40 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */
12 ev.events = 41 ev.events =
13 (nev & EV_READ ? EPOLLIN : 0) 42 (nev & EV_READ ? EPOLLIN : 0)
14 | (nev & EV_WRITE ? EPOLLOUT : 0); 43 | (nev & EV_WRITE ? EPOLLOUT : 0);
15 44
16 fprintf (stderr, "reify %d,%d,%d m%d (r=%d)\n", fd, oev, nev, mode,//D
17 epoll_ctl (epoll_fd, mode, fd, &ev) 45 if (epoll_ctl (backend_fd, mode, fd, &ev))
18 );//D 46 if (errno != ENOENT /* on ENOENT the fd went away, so try to do the right thing */
47 || (nev && epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev)))
48 fd_kill (EV_A_ fd);
19} 49}
20 50
21void epoll_postfork_child (void) 51static void
52epoll_poll (EV_P_ ev_tstamp timeout)
22{ 53{
23 int fd;
24
25 epoll_fd = epoll_create (256);
26 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
27
28 /* re-register interest in fds */
29 for (fd = 0; fd < anfdmax; ++fd)
30 if (anfds [fd].wev)
31 epoll_modify (fd, EV_NONE, anfds [fd].wev);
32}
33
34static struct epoll_event *events;
35static int eventmax;
36
37static void epoll_poll (ev_tstamp timeout)
38{
39 int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.));
40 int i; 54 int i;
55 int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.));
41 56
42 if (eventcnt < 0) 57 if (eventcnt < 0)
58 {
59 if (errno != EINTR)
60 syserr ("(libev) epoll_wait");
61
43 return; 62 return;
63 }
44 64
45 for (i = 0; i < eventcnt; ++i) 65 for (i = 0; i < eventcnt; ++i)
46 fd_event ( 66 fd_event (
67 EV_A_
47 events [i].data.fd, 68 epoll_events [i].data.u64,
48 (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) 69 (epoll_events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
49 | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) 70 | (epoll_events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0)
50 ); 71 );
51 72
52 /* if the receive array was full, increase its size */ 73 /* if the receive array was full, increase its size */
53 if (eventcnt == eventmax) 74 if (expect_false (eventcnt == epoll_eventmax))
54 { 75 {
55 free (events); 76 ev_free (epoll_events);
56 eventmax += eventmax >> 1; 77 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
57 events = malloc (sizeof (struct epoll_event) * eventmax); 78 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
58 } 79 }
59} 80}
60 81
82int inline_size
61void epoll_init (int flags) 83epoll_init (EV_P_ int flags)
62{ 84{
63 epoll_fd = epoll_create (256); 85 backend_fd = epoll_create (256);
64 86
65 if (epoll_fd < 0) 87 if (backend_fd < 0)
66 return; 88 return 0;
67 89
68 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 90 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
69 91
70 ev_method = EVMETHOD_EPOLL;
71 method_fudge = 1e-3; /* needed to compensate for epoll returning early */ 92 backend_fudge = 1e-3; /* needed to compensate for epoll returning early */
72 method_modify = epoll_modify; 93 backend_modify = epoll_modify;
73 method_poll = epoll_poll; 94 backend_poll = epoll_poll;
74 95
75 eventmax = 64; /* intiial number of events receivable per poll */ 96 epoll_eventmax = 64; /* intiial number of events receivable per poll */
76 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;
77} 100}
101
102void inline_size
103epoll_destroy (EV_P)
104{
105 ev_free (epoll_events);
106}
107
108void inline_size
109epoll_fork (EV_P)
110{
111 close (backend_fd);
112
113 while ((backend_fd = epoll_create (256)) < 0)
114 syserr ("(libev) epoll_create");
115
116 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
117
118 fd_rearm_all (EV_A);
119}
120

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines