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.4 by root, Wed Oct 31 11:56:34 2007 UTC vs.
Revision 1.8 by root, Thu Nov 1 11:11:22 2007 UTC

1/*
2 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met:
8 *
9 * * Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * * Redistributions in binary form must reproduce the above
13 * copyright notice, this list of conditions and the following
14 * disclaimer in the documentation and/or other materials provided
15 * with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
1#include <sys/epoll.h> 30#include <sys/epoll.h>
2 31
3static int epoll_fd = -1; 32static int epoll_fd = -1;
4 33
5static void 34static void
… …
14 | (nev & EV_WRITE ? EPOLLOUT : 0); 43 | (nev & EV_WRITE ? EPOLLOUT : 0);
15 44
16 epoll_ctl (epoll_fd, mode, fd, &ev); 45 epoll_ctl (epoll_fd, mode, fd, &ev);
17} 46}
18 47
48static void
19void epoll_postfork_child (void) 49epoll_postfork_child (void)
20{ 50{
21 int fd; 51 int fd;
22 52
23 epoll_fd = epoll_create (256); 53 epoll_fd = epoll_create (256);
24 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 54 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
25 55
26 /* re-register interest in fds */ 56 /* re-register interest in fds */
27 for (fd = 0; fd < anfdmax; ++fd) 57 for (fd = 0; fd < anfdmax; ++fd)
28 if (anfds [fd].wev) 58 if (anfds [fd].events)//D
29 epoll_modify (fd, EV_NONE, anfds [fd].wev); 59 epoll_modify (fd, EV_NONE, anfds [fd].events);
30} 60}
31 61
32static struct epoll_event *events; 62static struct epoll_event *events;
33static int eventmax; 63static int eventmax;
34 64
65static void
35static void epoll_poll (ev_tstamp timeout) 66epoll_poll (ev_tstamp timeout)
36{ 67{
37 int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); 68 int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.));
38 int i; 69 int i;
39 70
40 if (eventcnt < 0) 71 if (eventcnt < 0)
… …
54 eventmax += eventmax >> 1; 85 eventmax += eventmax >> 1;
55 events = malloc (sizeof (struct epoll_event) * eventmax); 86 events = malloc (sizeof (struct epoll_event) * eventmax);
56 } 87 }
57} 88}
58 89
90static void
59void epoll_init (int flags) 91epoll_init (int flags)
60{ 92{
61 epoll_fd = epoll_create (256); 93 epoll_fd = epoll_create (256);
62 94
63 if (epoll_fd < 0) 95 if (epoll_fd < 0)
64 return; 96 return;
… …
71 method_poll = epoll_poll; 103 method_poll = epoll_poll;
72 104
73 eventmax = 64; /* intiial number of events receivable per poll */ 105 eventmax = 64; /* intiial number of events receivable per poll */
74 events = malloc (sizeof (struct epoll_event) * eventmax); 106 events = malloc (sizeof (struct epoll_event) * eventmax);
75} 107}
108

Diff Legend

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