summaryrefslogtreecommitdiffstats
path: root/src/poll.c
blob: 2a2ef34a79228463fae2602afcf12aa1452913f4 (plain)
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
/*
  Copyright (c) 2012-2014, Matthias Schiffer <mschiffer@universe-factory.net>
  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 COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT HOLDER OR CONTRIBUTORS 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 "poll.h"
#include "async.h"
#include "peer.h"

#ifdef USE_EPOLL

#include <sys/epoll.h>

#endif


static inline bool handle_tap(fastd_buffer_t buffer) {
	if (conf.mode != MODE_TAP)
		return false;

	if (buffer.len < ETH_HLEN) {
		pr_debug("truncated packet on tap interface");
		fastd_buffer_free(buffer);
		return true;
	}

	fastd_eth_addr_t dest_addr = fastd_get_dest_address(buffer);
	if (!fastd_eth_addr_is_unicast(dest_addr))
		return false;

	fastd_peer_t *peer = fastd_peer_find_by_eth_addr(dest_addr);

	if (!peer)
		return false;

	conf.protocol->send(peer, buffer);
	return true;
}

static void handle_tuntap(void) {
	fastd_buffer_t buffer = fastd_tuntap_read();
	if (!buffer.len)
		return;

	if (handle_tap(buffer))
		return;

	/* TUN mode or multicast packet */
	fastd_send_all(NULL, buffer);
}

static inline int handshake_timeout(void) {
	if (!ctx.handshake_queue.next)
		return -1;

	fastd_peer_t *peer = container_of(ctx.handshake_queue.next, fastd_peer_t, handshake_entry);

	int diff_msec = timespec_diff(&peer->next_handshake, &ctx.now);
	if (diff_msec < 0)
		return 0;
	else
		return diff_msec;
}


#ifdef USE_EPOLL

#include <fcntl.h>
#include <sys/epoll.h>


void fastd_poll_init(void) {
	ctx.epoll_fd = epoll_create1(EPOLL_CLOEXEC);
	if (ctx.epoll_fd < 0)
		exit_errno("epoll_create1");

	struct epoll_event event = {
		.events = EPOLLIN,
		.data.ptr = &ctx.async_rfd,
	};
	if (epoll_ctl(ctx.epoll_fd, EPOLL_CTL_ADD, ctx.async_rfd, &event) < 0)
		exit_errno("epoll_ctl");
}

void fastd_poll_free(void) {
	if (close(ctx.epoll_fd))
		pr_warn_errno("closing EPOLL: close");
}


void fastd_poll_set_fd_tuntap(void) {
	struct epoll_event event = {
		.events = EPOLLIN,
		.data.ptr = &ctx.tunfd,
	};
	if (epoll_ctl(ctx.epoll_fd, EPOLL_CTL_ADD, ctx.tunfd, &event) < 0)
		exit_errno("epoll_ctl");
}

void fastd_poll_set_fd_sock(size_t i) {
	struct epoll_event event = {
		.events = EPOLLIN,
		.data.ptr = &ctx.socks[i],
	};
	if (epoll_ctl(ctx.epoll_fd, EPOLL_CTL_ADD, ctx.socks[i].fd, &event) < 0)
		exit_errno("epoll_ctl");
}

void fastd_poll_set_fd_peer(size_t i) {
	fastd_peer_t *peer = VECTOR_INDEX(ctx.peers, i);

	if (!peer->sock || !fastd_peer_is_socket_dynamic(peer))
		return;

	struct epoll_event event = {
		.events = EPOLLIN,
		.data.ptr = peer->sock,
	};
	if (epoll_ctl(ctx.epoll_fd, EPOLL_CTL_ADD, peer->sock->fd, &event) < 0)
		exit_errno("epoll_ctl");
}

void fastd_poll_add_peer(void) {
}

void fastd_poll_delete_peer(size_t i UNUSED) {
}


void fastd_poll_handle(void) {
	int maintenance_timeout = timespec_diff(&ctx.next_maintenance, &ctx.now);

	if (maintenance_timeout < 0)
		maintenance_timeout = 0;

	int timeout = handshake_timeout();
	if (timeout < 0 || timeout > maintenance_timeout)
		timeout = maintenance_timeout;

	fastd_update_time();

	struct epoll_event events[16];
	int ret = epoll_wait(ctx.epoll_fd, events, 16, timeout);
	if (ret < 0) {
		if (errno == EINTR)
			return;

		exit_errno("epoll_wait");
	}

	size_t i;
	for (i = 0; i < (size_t)ret; i++) {
		if (events[i].data.ptr == &ctx.tunfd) {
			if (events[i].events & EPOLLIN)
				handle_tuntap();
		}
		else if (events[i].data.ptr == &ctx.async_rfd) {
			if (events[i].events & EPOLLIN)
				fastd_async_handle();
		}
		else {
			fastd_socket_t *sock = events[i].data.ptr;

			if (events[i].events & (EPOLLERR|EPOLLHUP)) {
				if (sock->peer)
					fastd_peer_reset_socket(sock->peer);
				else
					fastd_socket_error(sock);
			}
			else if (events[i].events & EPOLLIN) {
				fastd_receive(sock);
			}
		}
	}
}

#else

void fastd_poll_init(void) {
	VECTOR_ALLOC(ctx.pollfds, 2 + ctx.n_socks);

	VECTOR_INDEX(ctx.pollfds, 0) = (struct pollfd) {
		.fd = -1,
		.events = POLLIN,
		.revents = 0,
	};

	VECTOR_INDEX(ctx.pollfds, 1) = (struct pollfd) {
		.fd = ctx.async_rfd,
		.events = POLLIN,
		.revents = 0,
	};

	size_t i;
	for (i = 0; i < ctx.n_socks; i++) {
		VECTOR_INDEX(ctx.pollfds, 2+i) = (struct pollfd) {
			.fd = -1,
			.events = POLLIN,
			.revents = 0,
		};
	}
}

void fastd_poll_free(void) {
	VECTOR_FREE(ctx.pollfds);
}


void fastd_poll_set_fd_tuntap(void) {
	VECTOR_INDEX(ctx.pollfds, 0).fd = ctx.tunfd;
}

void fastd_poll_set_fd_sock(size_t i) {
	VECTOR_INDEX(ctx.pollfds, 2+i).fd = ctx.socks[i].fd;
}

void fastd_poll_set_fd_peer(size_t i) {
	fastd_peer_t *peer = VECTOR_INDEX(ctx.peers, i);

	if (!peer->sock || !fastd_peer_is_socket_dynamic(peer))
		VECTOR_INDEX(ctx.pollfds, 2+ctx.n_socks+i).fd = -1;
	else
		VECTOR_INDEX(ctx.pollfds, 2+ctx.n_socks+i).fd = peer->sock->fd;
}

void fastd_poll_add_peer(void) {
	struct pollfd pollfd = {
		.fd = -1,
		.events = POLLIN,
		.revents = 0,
	};

	VECTOR_ADD(ctx.pollfds, pollfd);
}

void fastd_poll_delete_peer(size_t i) {
	VECTOR_DELETE(ctx.pollfds, 2+ctx.n_socks+i);
}


void fastd_poll_handle(void) {
	int maintenance_timeout = timespec_diff(&ctx.next_maintenance, &ctx.now);

	if (maintenance_timeout < 0)
		maintenance_timeout = 0;

	int timeout = handshake_timeout();
	if (timeout < 0 || timeout > maintenance_timeout)
		timeout = maintenance_timeout;

	if (VECTOR_LEN(ctx.pollfds) != 2 + ctx.n_socks + VECTOR_LEN(ctx.peers))
		exit_bug("fd count mismatch");

	int ret = poll(VECTOR_DATA(ctx.pollfds), VECTOR_LEN(ctx.pollfds), timeout);
	if (ret < 0) {
		if (errno == EINTR)
			return;

		exit_errno("poll");
	}

	fastd_update_time();

	if (VECTOR_INDEX(ctx.pollfds, 0).revents & POLLIN)
		handle_tuntap();
	if (VECTOR_INDEX(ctx.pollfds, 1).revents & POLLIN)
		fastd_async_handle();

	size_t i;
	for (i = 0; i < ctx.n_socks; i++) {
		if (VECTOR_INDEX(ctx.pollfds, 2+i).revents & (POLLERR|POLLHUP|POLLNVAL)) {
			fastd_socket_error(&ctx.socks[i]);
			VECTOR_INDEX(ctx.pollfds, 2+i).fd = -1;
		}
		else if (VECTOR_INDEX(ctx.pollfds, 2+i).revents & POLLIN) {
			fastd_receive(&ctx.socks[i]);
		}
	}

	for (i = 0; i < VECTOR_LEN(ctx.peers); i++) {
		fastd_peer_t *peer = VECTOR_INDEX(ctx.peers, i);

		if (VECTOR_INDEX(ctx.pollfds, 2+ctx.n_socks+i).revents & (POLLERR|POLLHUP|POLLNVAL)) {
			fastd_peer_reset_socket(peer);
		}
		else if (VECTOR_INDEX(ctx.pollfds, 2+ctx.n_socks+i).revents & POLLIN) {
			fastd_receive(peer->sock);
		}
	}

	if (VECTOR_LEN(ctx.pollfds) != 2 + ctx.n_socks + VECTOR_LEN(ctx.peers))
		exit_bug("fd count mismatch");
}

#endif