-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpoller_epoll.c
98 lines (84 loc) · 2.63 KB
/
poller_epoll.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*
* Copyright (c) 2013 Per Johansson
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <errno.h>
#include <unistd.h>
#include <sys/epoll.h>
#include "poller.h"
#include "timefuncs.h"
int
hey_poller_init(struct hey_poller *poller)
{
poller->epfd = epoll_create(POLLER_MAX_FDS);
poller->activefds = 0;
if (poller->epfd < 0)
return -1;
return 0;
}
int
hey_poller_cleanup(struct hey_poller *poller)
{
close(poller->epfd);
return 0;
}
void
hey_poller_reset_timeout(struct hey_poller *poller, const struct timespec *absto)
{
poller->absto = *absto;
}
int
hey_poller_poll(struct hey_poller *poller, int *fds, int nfds, bool *ready)
{
struct epoll_event event;
struct timespec to;
int r;
while (poller->activefds < nfds)
{
int fd = fds[poller->activefds++];
struct epoll_event addev = { .events = EPOLLOUT, .data = { .fd = fd } };
if (epoll_ctl(poller->epfd, EPOLL_CTL_ADD, fd, &addev))
return POLLER_FATAL;
}
do {
if (ts_now(&to))
return -1;
if (ts_cmp(&to, &poller->absto) > 0)
to.tv_sec = to.tv_nsec = 0;
else
ts_sub_ts(&to, &poller->absto, &to);
r = epoll_wait(poller->epfd, &event, 1, to.tv_sec * 1000 + to.tv_nsec / 1000000);
} while (r == -1 && errno == EINTR);
if (r < 0)
return POLLER_FATAL;
if (r == 0)
return POLLER_TIMEOUT;
while (--nfds >= 0)
{
if (event.data.fd == fds[nfds])
break;
}
*ready = event.events & EPOLLHUP ? false : true;
poller->activefds--;
return nfds;
}