ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_epoll.c
Revision: 1.13
Committed: Sat Nov 3 21:58:51 2007 UTC (16 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.12: +10 -13 lines
Log Message:
prepare for multiple bases

File Contents

# User Rev Content
1 root 1.5 /*
2 root 1.9 * libev epoll fd activity backend
3     *
4 root 1.5 * 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    
32 root 1.1 #include <sys/epoll.h>
33    
34     static void
35 root 1.13 epoll_modify (EV_P_ int fd, int oev, int nev)
36 root 1.1 {
37 root 1.2 int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL;
38 root 1.1
39 root 1.2 struct epoll_event ev;
40 root 1.11 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */
41 root 1.2 ev.events =
42     (nev & EV_READ ? EPOLLIN : 0)
43     | (nev & EV_WRITE ? EPOLLOUT : 0);
44    
45 root 1.4 epoll_ctl (epoll_fd, mode, fd, &ev);
46 root 1.1 }
47    
48 root 1.6 static void
49 root 1.13 epoll_postfork_child (EV_P)
50 root 1.1 {
51 root 1.2 int fd;
52 root 1.1
53     epoll_fd = epoll_create (256);
54 root 1.3 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
55 root 1.1
56 root 1.2 /* re-register interest in fds */
57     for (fd = 0; fd < anfdmax; ++fd)
58 root 1.8 if (anfds [fd].events)//D
59 root 1.13 epoll_modify (EV_A_ fd, EV_NONE, anfds [fd].events);
60 root 1.1 }
61    
62 root 1.6 static void
63 root 1.13 epoll_poll (EV_P_ ev_tstamp timeout)
64 root 1.1 {
65     int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.));
66     int i;
67    
68     if (eventcnt < 0)
69     return;
70    
71     for (i = 0; i < eventcnt; ++i)
72     fd_event (
73 root 1.13 EV_A_
74 root 1.12 events [i].data.u64,
75 root 1.2 (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
76     | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0)
77 root 1.1 );
78    
79     /* if the receive array was full, increase its size */
80 root 1.10 if (expect_false (eventcnt == eventmax))
81 root 1.1 {
82     free (events);
83 root 1.10 eventmax = array_roundsize (events, eventmax << 1);
84 root 1.1 events = malloc (sizeof (struct epoll_event) * eventmax);
85     }
86     }
87    
88 root 1.13 static int
89     epoll_init (EV_P_ int flags)
90 root 1.1 {
91     epoll_fd = epoll_create (256);
92    
93     if (epoll_fd < 0)
94 root 1.13 return 0;
95 root 1.3
96     fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
97 root 1.1
98 root 1.2 method_fudge = 1e-3; /* needed to compensate for epoll returning early */
99     method_modify = epoll_modify;
100     method_poll = epoll_poll;
101 root 1.1
102     eventmax = 64; /* intiial number of events receivable per poll */
103     events = malloc (sizeof (struct epoll_event) * eventmax);
104 root 1.13
105     return EVMETHOD_EPOLL;
106 root 1.1 }
107 root 1.6