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

Diff Legend

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