-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgame_state.cpp
412 lines (371 loc) · 11.3 KB
/
game_state.cpp
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
401
402
403
404
405
406
407
408
409
410
411
412
#define _USE_MATH_DEFINES
#include "game_state.h"
Generator r(0);
GameState::GameState(uint32_t seed, uint32_t gs, uint32_t ts, uint32_t mx, uint32_t my)
: inner_counter{0}, head_in_progress{false}, head_expected_no{0}, board{gs, ts, mx, my}
{
r = Generator(seed);
}
GameProgress Round::is_active()
{
bool activated = snakes.size() > 0 ;
return GameProgress{activated, activated && !round_finished};
}
GameProgress GameState::has_active_round()
{
return round.is_active();
}
bool GameState::want_to_write()
{
return !pending_queue.empty();
}
void GameState::cycle()
{
round.recent_events = false;
round.cycle();
if (round.recent_events) {
notify_players();
}
}
size_t GameState::next_datagram(std::string &buffer, sockaddr_storage &addr)
{
size_t i;
uint64_t player_id;
bool front_removed = false;
// std::cout << "Look up pending " << std::endl;
while (!pending_queue.empty()) {
player_id = pending_queue.front();
//std::cout << player_id << "" << std::endl;
for (i = 0; i < players.size(); i++) {
if (players[i].inner_id == player_id) {
break;
}
}
if (i < players.size()) {
break;
}
pending.erase(pending_queue.front());
pending_queue.pop();
front_removed = true;
}
if (pending_queue.empty()) {
return 0;
}
//std::cerr << "Got here " << player_id << " " << players[i].expected_no << std::endl;
if (front_removed || !head_in_progress) {
head_in_progress = true;
head_expected_no = players[i].expected_no;
}
auto &indxs = round.history_indx();
auto &hist = round.history();
//std::cerr << "Got ist tot here " << head_expected_no << " " << indxs.size() << std::endl;
if (head_expected_no >= indxs.size()) {
//std::cout << "Already satisfied" << std::endl;
return 0;
}
size_t it = head_expected_no;
size_t mes_size = 0;
do {
mes_size += indxs[it] - ((it == 0)? 0 : indxs[it - 1]);
++it;
} while (mes_size <= MAX_FROM_SERVER_DATAGRAM_SIZE - 4 && it < indxs.size());
buffer = Event::serialize(round.get_game_id());
buffer.insert(buffer.size(), &hist[(head_expected_no == 0)? 0 : indxs[head_expected_no - 1]], mes_size);
addr = players[i].sockaddr;
//std::cerr << "Message to player number " << i << " " << head_expected_no << std::endl;
return it - head_expected_no;
}
void GameState::mark_sent(size_t events_no)
{
head_expected_no += events_no;
if (head_expected_no >= round.history_indx().size()) {
head_in_progress = false;
pending.erase(pending_queue.front());
pending_queue.pop();
}
}
void GameState::got_message(std::string &buffer, sockaddr_storage &addr, uint64_t rec_time)
{
Event::ClientEvent e;
// simply drop incorrect messages
if (!e.parse(buffer)) {
std::cerr << "Dropping incorrect message" << std::endl;
return;
}
disconnect_inactive(rec_time);
connect_or_update_player(e, addr, rec_time);
update_game_state_on_player_message();
}
void GameState::disconnect_inactive(uint64_t threshold)
{
size_t i = 0;
while (i < players.size()) {
if (threshold - players[i].last_contact < INACTIVITY_TOLERANCE) {
++i;
continue;
}
disconnect_player(i);
}
}
void GameState::disconnect_player(size_t id)
{
reserved_names.erase(players[id].name);
if (id < players.size() - 1) {
std::swap(players[id], players[players.size() - 1]);
}
players.pop_back();
//std::cerr << "Disconnected player" << std::endl;
}
void GameState::notify_player(Player &p)
{
auto inserted = pending.insert(p.inner_id);
if (inserted.second) {
pending_queue.push(p.inner_id);
}
}
void GameState::notify_players()
{
for (auto &p : players) {
notify_player(p);
}
}
void GameState::connect_player(
Event::ClientEvent const &e, sockaddr_storage &addr, uint64_t rec_time)
{
if (players.size() >= MAX_PLAYERS) {
return;
}
if (e.player_name.length() && !reserved_names.insert(e.player_name).second) {
return;
}
players.push_back(Player{e, addr, rec_time, inner_counter++});
//std::cerr << "Connected new player" << std::endl;
notify_player(players[players.size() - 1]);
}
void GameState::connect_or_update_player(
Event::ClientEvent const &e, sockaddr_storage &addr, uint64_t rec_time)
{
for (size_t i = 0; i < players.size(); ++i) {
Player &p = players[i];
if (!(p.sockaddr == addr)) {
continue;
}
if (p.session_id > e.session_id) {
return;
} else if (p.session_id < e.session_id) {
disconnect_player(i);
connect_player(e, addr, rec_time);
return;
} else {
//std::cerr << "Message from player number " << i << std::endl;
p.last_contact = rec_time;
p.expected_no = e.next_expected_event_no;
p.last_turn_direction = e.turn_direction;
p.pressed_arrow |= (e.turn_direction != 0);
if (!p.lurking && std::get<1>(round.is_active())) {
round.direction(p.snake_id, e.turn_direction);
}
notify_player(p);
return;
}
}
connect_player(e, addr, rec_time);
}
void GameState::update_game_state_on_player_message()
{
if (std::get<1>(round.is_active())) {
return;
}
//with the conditions above it means some round has finished recently
if (std::get<0>(round.is_active())) {
if (round.game_over_raised) {
//std::cerr << "Prepare for new round" << std::endl;
round.game_over_raised = false;
for (auto &p : players) {
p.pressed_arrow = false;
p.lurking = true;
}
}
}
size_t ready = 0, eager = 0;
for (auto &p : players) {
if (p.name.length()) {
++eager;
if (p.pressed_arrow) {
++ready;
}
}
}
if (ready >= REQUIRED_PLAYERS && eager == ready) {
//std::cerr << "Starting new game" << std::endl;
start_new_round();
}
}
void GameState::start_new_round()
{
std::vector<EagerPlayer> eager;
size_t i = 0;
for (auto &p : players) {
if (p.name.length() && p.pressed_arrow) {
eager.push_back(EagerPlayer{p.name, p.last_turn_direction, i});
}
++i;
}
std::sort(eager.begin(), eager.end());
// restrict number of players so that their names fit in single datagram
size_t fitting_no = 0;
uint32_t slen = 28; //it's overhead of additional data
for (auto &e : eager) {
slen += std::get<0>(e).length() + 1;
if (slen > MAX_FROM_SERVER_DATAGRAM_SIZE) {
break;
}
++fitting_no;
}
if (fitting_no < eager.size()) {
std::cerr << "Limiting the number of players due to long names" << std::endl;
eager.resize(fitting_no);
}
for (size_t j = 0; j < eager.size(); ++j) {
Player &p = players[std::get<2>(eager[j])];
p.snake_id = j;
p.lurking = false;
}
decltype(pending_queue) empty_pendign_queue;
std::swap(pending_queue, empty_pendign_queue);
head_in_progress = false;
pending.clear();
round = Round{board, eager};
}
Player::Player(Event::ClientEvent const &e, sockaddr_storage &addr, uint64_t rec_time,
uint64_t inner_id)
: lurking{true}, pressed_arrow{e.turn_direction != 0}, last_turn_direction{e.turn_direction},
name{e.player_name}, inner_id{inner_id}, expected_no{e.next_expected_event_no},
last_contact{rec_time}, sockaddr{addr}, session_id{e.session_id} {}
Player::Player() = default;
Round::Round() = default;
Round::Round(Board &board, std::vector<EagerPlayer> &eager)
: board{board}, game_id{r.next()}, eliminated{0}, round_finished{false}, recent_events{false},
game_over_raised{false}
{
for (auto &ep : eager) {
snakes.push_back(Snake{std::get<0>(ep), std::get<1>(ep), board});
}
new_game();
size_t i = 0;
for (auto &s : snakes) {
register_move(s.position(), s, i++);
}
}
void Round::direction(size_t snake_id, uint32_t direction)
{
snakes[snake_id].last_turn_direction = direction;
}
uint32_t Round::get_game_id()
{
return game_id;
}
std::vector<char> const &Round::history()
{
return events_history;
}
std::vector<size_t> const &Round::history_indx()
{
return events_positions;
}
void Round::event(Event::SerializableEvent &e)
{
recent_events = true;
std::string es = e.serialize();
uint32_t length = es.length() + 4;
uint32_t event_no = events_positions.size();
std::string s = Event::serialize(length, event_no, es);
uint32_t crc = crc32(0, reinterpret_cast<unsigned char *>(&s[0]), s.length());
s.resize(s.length() + 4);
*reinterpret_cast<uint32_t *>(&s[s.length() - 4]) = bswap(crc);
events_history.insert(events_history.end(), s.begin(), s.end());
events_positions.push_back(events_history.size());
}
void Round::new_game()
{
Event::NewGame e;
e.maxx = board.maxx;
e.maxy = board.maxy;
std::stringstream ss;
for (auto &snake : snakes) {
ss << snake.name << " ";
}
e.player_names = ss.str();
event(e);
}
void Round::game_over()
{
Event::GameOver e;
event(e);
}
void Round::pixel(Snake &s, size_t player)
{
Event::Pixel e;
Position p = s.position();
e.x = std::get<0>(p);
e.y = std::get<1>(p);
e.player_number = player;
event(e);
}
void Round::player_eliminated(size_t player)
{
Event::PlayerEliminated e;
e.player_number = player;
event(e);
}
void Round::register_move(Position const &new_position, Snake &s, size_t player)
{
if (std::get<0>(new_position) < board.maxx && std::get<1>(new_position) < board.maxy &&
board.taken_pxls.insert(new_position).second) {
pixel(s, player);
}
else {
player_eliminated(player);
s.eliminated = true;
++eliminated;
if (snakes.size() - eliminated <= 1) {
game_over();
round_finished = true;
game_over_raised = true;
}
}
}
void Round::move(Snake &s, size_t player)
{
auto old_position = s.position();
s.direction += 360 + s.last_turn_direction * board.turning_speed;
s.direction %= 360;
s.x += cos(M_PI * s.direction / 180.);
s.y += sin(M_PI * s.direction / 180.);
auto new_position = s.position();
if (old_position != new_position) {
register_move(new_position, s, player);
}
}
void Round::cycle()
{
size_t player = 0;
for (auto &snake: snakes) {
if (!snake.eliminated && !round_finished) {
move(snake, player);
}
player++;
}
}
Board::Board() = default;
Board::Board(uint32_t gs, uint32_t ts, uint32_t mx, uint32_t my)
: game_speed{gs}, turning_speed{ts}, maxx{mx}, maxy{my} {}
Round::Snake::Snake(std::string name, int32_t direction, Board const &board)
: eliminated{false}, x{r.next() % board.maxx + 0.5}, y{r.next() % board.maxy + 0.5},
direction{static_cast<int32_t>(r.next() % 360)}, last_turn_direction{direction},
name{name}
{
};
Position Round::Snake::position() {
return Position{static_cast<uint32_t>(x), static_cast<uint32_t>(y)};
}