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.11 by root, Sat Nov 3 10:37:29 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 int epoll_fd = -1;
4 35
5static void 36static void
6epoll_reify_fd (int fd) 37epoll_modify (int fd, int oev, int nev)
7{ 38{
8 ANFD *anfd = anfds + fd; 39 int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL;
9 struct ev_io *w;
10 40
11 int wev = 0; 41 struct epoll_event ev;
42 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */
43 ev.events =
44 (nev & EV_READ ? EPOLLIN : 0)
45 | (nev & EV_WRITE ? EPOLLOUT : 0);
12 46
13 for (w = anfd->head; w; w = w->next)
14 wev |= w->events;
15
16 if (anfd->wev != wev)
17 {
18 int mode = wev ? anfd->wev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL;
19 struct epoll_event ev;
20 ev.events = wev;
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) 47 epoll_ctl (epoll_fd, mode, fd, &ev);
24 );//D
25 anfd->wev = wev;
26 }
27} 48}
28 49
50static void
29void epoll_postfork_child (void) 51epoll_postfork_child (void)
30{ 52{
31 int i; 53 int fd;
32 54
33 epoll_fd = epoll_create (256); 55 epoll_fd = epoll_create (256);
56 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
34 57
58 /* re-register interest in fds */
35 for (i = 0; i < anfdmax; ++i) 59 for (fd = 0; fd < anfdmax; ++fd)
36 epoll_reify_fd (i); 60 if (anfds [fd].events)//D
37} 61 epoll_modify (fd, EV_NONE, anfds [fd].events);
38
39static void epoll_reify (void)
40{
41 int i;
42 for (i = 0; i < fdchangecnt; ++i)
43 epoll_reify_fd (fdchanges [i]);
44} 62}
45 63
46static struct epoll_event *events; 64static struct epoll_event *events;
47static int eventmax; 65static int eventmax;
48 66
67static void
49static void epoll_poll (ev_tstamp timeout) 68epoll_poll (ev_tstamp timeout)
50{ 69{
51 int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); 70 int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.));
52 int i; 71 int i;
53 72
54 if (eventcnt < 0) 73 if (eventcnt < 0)
55 return; 74 return;
56 75
57 for (i = 0; i < eventcnt; ++i) 76 for (i = 0; i < eventcnt; ++i)
58 fd_event ( 77 fd_event (
59 events [i].data.fd, 78 events [i].data.fd,
60 (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP | EPOLLPRI) ? EV_WRITE : 0) 79 (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
61 | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) 80 | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0)
62 ); 81 );
63 82
64 /* if the receive array was full, increase its size */ 83 /* if the receive array was full, increase its size */
65 if (eventcnt == eventmax) 84 if (expect_false (eventcnt == eventmax))
66 { 85 {
67 free (events); 86 free (events);
68 eventmax += eventmax >> 1; 87 eventmax = array_roundsize (events, eventmax << 1);
69 events = malloc (sizeof (struct epoll_event) * eventmax); 88 events = malloc (sizeof (struct epoll_event) * eventmax);
70 } 89 }
71} 90}
72 91
92static void
73int epoll_init (int flags) 93epoll_init (int flags)
74{ 94{
75 epoll_fd = epoll_create (256); 95 epoll_fd = epoll_create (256);
76 96
77 if (epoll_fd < 0) 97 if (epoll_fd < 0)
78 return 0; 98 return;
79 99
100 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
101
80 ev_method = EVMETHOD_EPOLL; 102 ev_method = EVMETHOD_EPOLL;
81 method_fudge = 1e-3; /* needed to compensate fro epoll returning early */ 103 method_fudge = 1e-3; /* needed to compensate for epoll returning early */
82 method_reify = epoll_reify; 104 method_modify = epoll_modify;
83 method_poll = epoll_poll; 105 method_poll = epoll_poll;
84 106
85 eventmax = 64; /* intiial number of events receivable per poll */ 107 eventmax = 64; /* intiial number of events receivable per poll */
86 events = malloc (sizeof (struct epoll_event) * eventmax); 108 events = malloc (sizeof (struct epoll_event) * eventmax);
109}
87 110
88 return 1;
89}

Diff Legend

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