summary refs log tree commit diff homepage
path: root/server.c
blob: 9cae5dd2c61a74078dcda51b4a855a9af4a183af (plain) (blame)
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
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
/* Copyright (C) 2017  June McEnroe <june@causal.agency>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#include <sys/types.h>

#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <signal.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <sys/event.h>
#include <sys/mman.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <sys/un.h>
#include <sysexits.h>
#include <time.h>
#include <unistd.h>

#include "torus.h"

static struct Tile *tiles;

static void tilesMap(void) {
	int fd = open("torus.dat", O_CREAT | O_RDWR, 0644);
	if (fd < 0) err(EX_CANTCREAT, "torus.dat");

	int error = ftruncate(fd, TILES_SIZE);
	if (error) err(EX_IOERR, "ftruncate");

	tiles = mmap(NULL, TILES_SIZE, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
	if (tiles == MAP_FAILED) err(EX_OSERR, "mmap");

	error = madvise(tiles, TILES_SIZE, MADV_RANDOM);
	if (error) err(EX_OSERR, "madvise");

#ifdef MADV_NOCORE
	error = madvise(tiles, TILES_SIZE, MADV_NOCORE);
	if (error) err(EX_OSERR, "madvise");
#endif
}

static struct Tile *tileGet(uint32_t tileX, uint32_t tileY) {
	struct Tile *tile = &tiles[tileY * TILE_ROWS + tileX];
	if (!tile->createTime) {
		memset(tile->cells, ' ', CELLS_SIZE);
		memset(tile->colors, COLOR_WHITE, CELLS_SIZE);
		tile->createTime = time(NULL);
	}
	return tile;
}

static struct Tile *tileAccess(uint32_t tileX, uint32_t tileY) {
	struct Tile *tile = tileGet(tileX, tileY);
	tile->accessTime = time(NULL);
	tile->accessCount++;
	return tile;
}

static struct Tile *tileModify(uint32_t tileX, uint32_t tileY) {
	struct Tile *tile = tileGet(tileX, tileY);
	tile->modifyTime = time(NULL);
	tile->modifyCount++;
	return tile;
}

static struct Client {
	int fd;

	uint32_t tileX;
	uint32_t tileY;
	uint8_t cellX;
	uint8_t cellY;

	struct Client *prev;
	struct Client *next;
} *clientHead;

static struct Client *clientAdd(int fd) {
	struct Client *client = malloc(sizeof(*client));
	if (!client) err(EX_OSERR, "malloc");

	client->fd = fd;
	client->tileX = TILE_VOID_X;
	client->tileY = TILE_VOID_Y;
	client->cellX = CELL_INIT_X;
	client->cellY = CELL_INIT_Y;

	client->prev = NULL;
	if (clientHead) {
		clientHead->prev = client;
		client->next = clientHead;
	} else {
		client->next = NULL;
	}
	clientHead = client;

	return client;
}

static bool clientSend(const struct Client *client, struct ServerMessage msg) {
	ssize_t size = send(client->fd, &msg, sizeof(msg), 0);
	if (size < 0) return false;

	if (msg.type == SERVER_TILE) {
		struct Tile *tile = tileAccess(client->tileX, client->tileY);
		size = send(client->fd, tile, sizeof(*tile), 0);
		if (size < 0) return false;
	}

	return true;
}

static void clientCast(const struct Client *origin, struct ServerMessage msg) {
	for (struct Client *client = clientHead; client; client = client->next) {
		if (client == origin) continue;
		if (client->tileX != origin->tileX) continue;
		if (client->tileY != origin->tileY) continue;
		clientSend(client, msg);
	}
}

static void clientRemove(struct Client *client) {
	if (client->prev) client->prev->next = client->next;
	if (client->next) client->next->prev = client->prev;
	if (clientHead == client) clientHead = client->next;

	struct ServerMessage msg = {
		.type = SERVER_CURSOR,
		.cursor = {
			.oldCellX = client->cellX, .oldCellY = client->cellY,
			.newCellX = CURSOR_NONE,   .newCellY = CURSOR_NONE,
		},
	};
	clientCast(client, msg);

	close(client->fd);
	free(client);
}

static bool clientCursors(const struct Client *client) {
	struct ServerMessage msg = {
		.type = SERVER_CURSOR,
		.cursor = { .oldCellX = CURSOR_NONE, .oldCellY = CURSOR_NONE },
	};

	for (struct Client *friend = clientHead; friend; friend = friend->next) {
		if (friend == client) continue;
		if (friend->tileX != client->tileX) continue;
		if (friend->tileY != client->tileY) continue;

		msg.cursor.newCellX = friend->cellX;
		msg.cursor.newCellY = friend->cellY;
		if (!clientSend(client, msg)) return false;
	}
	return true;
}

static bool clientUpdate(const struct Client *client, const struct Client *old) {
	struct ServerMessage msg = {
		.type = SERVER_MOVE,
		.move = { .cellX = client->cellX, .cellY = client->cellY },
	};
	if (!clientSend(client, msg)) return false;

	if (client->tileX != old->tileX || client->tileY != old->tileY) {
		msg.type = SERVER_TILE;
		if (!clientSend(client, msg)) return false;

		if (!clientCursors(client)) return false;

		msg = (struct ServerMessage) {
			.type = SERVER_CURSOR,
			.cursor = {
				.oldCellX = old->cellX,  .oldCellY = old->cellY,
				.newCellX = CURSOR_NONE, .newCellY = CURSOR_NONE,
			},
		};
		clientCast(old, msg);

		msg = (struct ServerMessage) {
			.type = SERVER_CURSOR,
			.cursor = {
				.oldCellX = CURSOR_NONE,   .oldCellY = CURSOR_NONE,
				.newCellX = client->cellX, .newCellY = client->cellY,
			},
		};
		clientCast(client, msg);

	} else {
		msg = (struct ServerMessage) {
			.type = SERVER_CURSOR,
			.cursor = {
				.oldCellX = old->cellX,    .oldCellY = old->cellY,
				.newCellX = client->cellX, .newCellY = client->cellY,
			},
		};
		clientCast(client, msg);
	}

	return true;
}

static bool clientSpawn(struct Client *client, uint8_t spawn) {
	if (spawn >= ARRAY_LEN(SPAWNS)) return false;
	struct Client old = *client;
	client->tileX = SPAWNS[spawn].tileX;
	client->tileY = SPAWNS[spawn].tileY;
	client->cellX = CELL_INIT_X;
	client->cellY = CELL_INIT_Y;
	return clientUpdate(client, &old);
}

static bool clientMove(struct Client *client, int8_t dx, int8_t dy) {
	struct Client old = *client;

	if (dx > CELL_COLS - client->cellX) dx = CELL_COLS - client->cellX;
	if (dx < -client->cellX - 1)        dx = -client->cellX - 1;
	if (dy > CELL_ROWS - client->cellY) dy = CELL_ROWS - client->cellY;
	if (dy < -client->cellY - 1)        dy = -client->cellY - 1;

	client->cellX += dx;
	client->cellY += dy;

	if (client->cellX == CELL_COLS) {
		client->tileX++;
		client->cellX = 0;
	}
	if (client->cellX == UINT8_MAX) {
		client->tileX--;
		client->cellX = CELL_COLS - 1;
	}
	if (client->cellY == CELL_ROWS) {
		client->tileY++;
		client->cellY = 0;
	}
	if (client->cellY == UINT8_MAX) {
		client->tileY--;
		client->cellY = CELL_ROWS - 1;
	}

	if (client->tileX == TILE_COLS)  client->tileX = 0;
	if (client->tileX == UINT32_MAX) client->tileX = TILE_COLS - 1;
	if (client->tileY == TILE_ROWS)  client->tileY = 0;
	if (client->tileY == UINT32_MAX) client->tileY = TILE_ROWS - 1;

	assert(client->cellX < CELL_COLS);
	assert(client->cellY < CELL_ROWS);
	assert(client->tileX < TILE_COLS);
	assert(client->tileY < TILE_ROWS);

	return clientUpdate(client, &old);
}

static bool clientPut(const struct Client *client, uint8_t color, char cell) {
	struct Tile *tile = tileModify(client->tileX, client->tileY);
	tile->colors[client->cellY][client->cellX] = color;
	tile->cells[client->cellY][client->cellX] = cell;

	struct ServerMessage msg = {
		.type = SERVER_PUT,
		.put = {
			.cellX = client->cellX,
			.cellY = client->cellY,
			.color = color,
			.cell = cell,
		},
	};
	bool success = clientSend(client, msg);
	clientCast(client, msg);
	return success;
}

static bool clientMap(const struct Client *client) {
	int32_t mapY = (int32_t)client->tileY - MAP_ROWS / 2;
	int32_t mapX = (int32_t)client->tileX - MAP_COLS / 2;

	struct Map map;
	for (int32_t y = 0; y < MAP_ROWS; ++y) {
		for (int32_t x = 0; x < MAP_COLS; ++x) {
			uint32_t tileY = ((mapY + y) % TILE_ROWS + TILE_ROWS) % TILE_ROWS;
			uint32_t tileX = ((mapX + x) % TILE_COLS + TILE_COLS) % TILE_COLS;

			const struct Tile *tile = &tiles[tileY * TILE_ROWS + tileX];
			map.tiles[y][x] = (struct MapTile) {
				.createTime = tile->createTime,
				.modifyTime = tile->modifyTime,
				.accessTime = tile->accessTime,
				.modifyCount = tile->modifyCount,
				.accessCount = tile->accessCount,
			};
		}
	}

	struct ServerMessage msg = { .type = SERVER_MAP };
	if (!clientSend(client, msg)) return false;
	if (0 > send(client->fd, &map, sizeof(map), 0)) return false;
	return true;
}

int main() {
	int error;

	tilesMap();

	int server = socket(PF_LOCAL, SOCK_STREAM, 0);
	if (server < 0) err(EX_OSERR, "socket");

	error = unlink("torus.sock");
	if (error && errno != ENOENT) err(EX_IOERR, "torus.sock");

	struct sockaddr_un addr = {
		.sun_family = AF_LOCAL,
		.sun_path = "torus.sock",
	};
	error = bind(server, (struct sockaddr *)&addr, sizeof(addr));
	if (error) err(EX_CANTCREAT, "torus.sock");

	error = listen(server, 0);
	if (error) err(EX_OSERR, "listen");

	int kq = kqueue();
	if (kq < 0) err(EX_OSERR, "kqueue");

	struct kevent event;
	EV_SET(&event, server, EVFILT_READ, EV_ADD, 0, 0, 0);
	int nevents = kevent(kq, &event, 1, NULL, 0, NULL);
	if (nevents < 0) err(EX_OSERR, "kevent");

	for (;;) {
		nevents = kevent(kq, NULL, 0, &event, 1, NULL);
		if (nevents < 0) err(EX_IOERR, "kevent");

		if (!event.udata) {
			int fd = accept(server, NULL, NULL);
			if (fd < 0) err(EX_IOERR, "accept");
			fcntl(fd, F_SETFL, O_NONBLOCK);

			int on = 1;
			error = setsockopt(fd, SOL_SOCKET, SO_NOSIGPIPE, &on, sizeof(on));
			if (error) err(EX_IOERR, "setsockopt");

			int size = 2 * sizeof(struct Tile);
			error = setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &size, sizeof(size));
			if (error) err(EX_IOERR, "setsockopt");

			struct Client *client = clientAdd(fd);

			EV_SET(&event, fd, EVFILT_READ, EV_ADD, 0, 0, client);
			nevents = kevent(kq, &event, 1, NULL, 0, NULL);
			if (nevents < 0) err(EX_IOERR, "kevent");

			if (!clientSpawn(client, 0)) clientRemove(client);

			continue;
		}

		struct Client *client = (struct Client *)event.udata;
		if (event.flags & EV_EOF) {
			clientRemove(client);
			continue;
		}

		struct ClientMessage msg;
		ssize_t size = recv(client->fd, &msg, sizeof(msg), 0);
		if (size != sizeof(msg)) {
			clientRemove(client);
			continue;
		}

		bool success = false;
		switch (msg.type) {
			break; case CLIENT_MOVE: {
				success = clientMove(client, msg.move.dx, msg.move.dy);
			}
			break; case CLIENT_PUT: {
				success = clientPut(client, msg.put.color, msg.put.cell);
			}
			break; case CLIENT_SPAWN: success = clientSpawn(client, msg.spawn);
			break; case CLIENT_MAP: success = clientMap(client);
		}
		if (!success) clientRemove(client);
	}
}