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

Diff Legend

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