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

Diff Legend

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