-
Notifications
You must be signed in to change notification settings - Fork 34
/
haze.c
553 lines (460 loc) · 12.4 KB
/
haze.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
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
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
/*
* qstat
* by Steve Jankowski
*
* New Haze query protocol
* Copyright 2005 Steven Hartland
*
* Licensed under the Artistic License, see LICENSE.txt for license terms
*
*/
#include <sys/types.h>
#ifndef _WIN32
#include <netinet/in.h>
#include <sys/socket.h>
#endif
#include <stdlib.h>
#include <stdio.h>
#include "debug.h"
#include "qstat.h"
#include "packet_manip.h"
// Format:
// 1 - 8: Challenge Request / Response
char haze_challenge[] =
{
'f', 'r', 'd', 'c', '_', '_', '_', '_'
};
int process_haze_packet(struct qserver *server);
// Player headers
#define PLAYER_NAME_HEADER 1
#define PLAYER_SCORE_HEADER 2
#define PLAYER_DEATHS_HEADER 3
#define PLAYER_PING_HEADER 4
#define PLAYER_KILLS_HEADER 5
#define PLAYER_TEAM_HEADER 6
#define PLAYER_OTHER_HEADER 7
// Team headers
#define TEAM_NAME_HEADER 1
#define TEAM_OTHER_HEADER 2
// Challenge response algorithum
// Before sending a qr2 query (type 0x00) the client must first send a
// challenge request (type 0x09). The host will respond with the same
// packet type containing a string signed integer.
//
// Once the challenge is received the client should convert the string to a
// network byte order integer and embed it in the keys query.
//
// Example:
//
// challenge request: [0xFE][0xFD][0x09][0x.. 4-byte-instance]
// challenge response: [0x09][0x.. 4-byte-instance]["-1287574694"]
// query: [0xFE][0xFD][0x00][0x.. 4-byte-instance][0xb3412b5a "-1287574694"]
//
query_status_t
deal_with_haze_packet(struct qserver *server, char *rawpkt, int pktlen)
{
char *ptr = rawpkt;
unsigned int pkt_id;
unsigned short len;
unsigned char pkt_max, pkt_index;
debug(2, "packet...");
if (pktlen < 8) {
// invalid packet
malformed_packet(server, "too short");
return (PKT_ERROR);
}
if (0 == strncmp(ptr, "frdcr", 5)) {
// challenge response
ptr += 8;
server->challenge = 1;
// Correct the stats due to two phase protocol
server->retry1++;
server->n_packets--;
if ((server->retry1 == n_retries) || server->flags & FLAG_BROADCAST) {
//server->n_requests--;
} else {
server->n_retries--;
}
return (send_haze_request_packet(server));
}
if (pktlen < 12) {
// invalid packet
malformed_packet(server, "too short");
return (PKT_ERROR);
}
server->n_servers++;
if (server->server_name == NULL) {
server->ping_total += time_delta(&packet_recv_time, &server->packet_time1);
} else {
gettimeofday(&server->packet_time1, NULL);
}
// Query version ID
ptr += 4;
// Could check the header here should
// match the 4 byte id sent
memcpy(&pkt_id, ptr, 4);
ptr += 4;
// Max plackets
pkt_max = ((unsigned char)*ptr);
ptr++;
// Packet ID
pkt_index = ((unsigned char)*ptr);
ptr++;
// Query Length
debug(1, "%04hx, %04hx", (unsigned short)ptr[0], (unsigned short)(ptr[1] << 8));
// TODO: fix this crap
memcpy(&len, ptr + 1, 1);
ptr += 2;
debug(1, "pkt_index = %d, pkt_max = %d, len = %d", pkt_index, pkt_max, len);
if (0 != pkt_max) {
// not a single packet response or callback
debug(2, "pkt_max %d", pkt_max);
if (0 == pkt_index) {
// to prevent reprocessing when we get the call back
// override the packet flag so it looks like a single
// packet response
rawpkt[8] = '\0';
}
// add the packet recalcing maxes
if (!add_packet(server, pkt_id, pkt_index, pkt_max, pktlen, rawpkt, 1)) {
// fatal error e.g. out of memory
return (MEM_ERROR);
}
// combine_packets will call us recursively
return (combine_packets(server));
}
// if we get here we have what should be a full packet
return (process_haze_packet(server));
}
query_status_t
deal_with_haze_status(struct qserver *server, char *rawpkt, int pktlen)
{
char *pkt = rawpkt;
int len;
debug(1, "status packet");
// Server name
server->server_name = strdup(pkt);
pkt += strlen(pkt) + 1;
// gametype
add_rule(server, "gametype", pkt, NO_FLAGS);
pkt += strlen(pkt) + 1;
// map
len = strlen(pkt);
// remove .res from map names
if (0 == strncmp(pkt + len - 4, ".res", 4)) {
*(pkt + len - 4) = '\0';
}
server->map_name = strdup(pkt);
pkt += len + 1;
// num players
server->num_players = atoi(pkt);
pkt += strlen(pkt) + 1;
// max_players
server->max_players = atoi(pkt);
pkt += strlen(pkt) + 1;
// hostport
change_server_port(server, atoi(pkt), 0);
pkt += strlen(pkt) + 1;
return (DONE_FORCE);
}
int
process_haze_packet(struct qserver *server)
{
unsigned char state = 0;
unsigned char no_players = 0;
unsigned char total_players = 0;
unsigned char no_teams = 0;
unsigned char total_teams = 0;
int pkt_index = 0;
SavedData *fragment;
debug(2, "processing packet...");
while (NULL != (fragment = get_packet_fragment(pkt_index++))) {
int pktlen = fragment->datalen;
char *ptr = fragment->data;
char *end = ptr + pktlen;
debug(2, "processing fragment[%d]...", fragment->pkt_index);
// check we have a full header
if (pktlen < 12) {
// invalid packet
malformed_packet(server, "too short");
return (PKT_ERROR);
}
// skip over the header
//server->protocol_version = atoi( val+1 );
ptr += 12;
// 4 * null's signifies the end of a section
// Basic Info
while (0 == state && ptr < end) {
// name value pairs null seperated
char *var, *val;
int var_len, val_len;
if ((ptr + 4 <= end) && (0x00 == ptr[0]) && (0x00 == ptr[1]) && (0x00 == ptr[2]) && (0x00 == ptr[3])) {
// end of rules
state++;
ptr += 4;
break;
}
var = ptr;
var_len = strlen(var);
ptr += var_len + 1;
if (ptr + 1 > end) {
malformed_packet(server, "no basic value");
return (PKT_ERROR);
}
val = ptr;
val_len = strlen(val);
ptr += val_len + 1;
debug(2, "var:%s (%d)=%s (%d)\n", var, var_len, val, val_len);
// Lets see what we've got
if (0 == strcmp(var, "serverName")) {
server->server_name = strdup(val);
} else if (0 == strcmp(var, "map")) {
// remove .res from map names
if (0 == strncmp(val + val_len - 4, ".res", 4)) {
*(val + val_len - 4) = '\0';
}
server->map_name = strdup(val);
} else if (0 == strcmp(var, "maxPlayers")) {
server->max_players = atoi(val);
} else if (0 == strcmp(var, "currentPlayers")) {
server->num_players = no_players = atoi(val);
} else {
add_rule(server, var, val, NO_FLAGS);
}
}
// rules
while (1 == state && ptr < end) {
// name value pairs null seperated
char *var, *val;
int var_len, val_len;
if ((ptr + 4 <= end) && (0x00 == ptr[0]) && (0x00 == ptr[1]) && (0x00 == ptr[2]) && (0x00 == ptr[3])) {
// end of basic
state++;
ptr += 4;
break;
}
var = ptr;
var_len = strlen(var);
ptr += var_len + 1;
if (ptr + 1 > end) {
malformed_packet(server, "no basic value");
return (PKT_ERROR);
}
val = ptr;
val_len = strlen(val);
ptr += val_len + 1;
debug(2, "var:%s (%d)=%s (%d)\n", var, var_len, val, val_len);
// add the rule
add_rule(server, var, val, NO_FLAGS);
}
// players
while (2 == state && ptr < end) {
// first we have the header
char *header = ptr;
int head_len = strlen(header);
ptr += head_len + 1;
if ((ptr + 2 <= end) && (0x00 == ptr[0]) && (0x00 == ptr[1])) {
// end of player headers
state++;
ptr += 2;
break;
}
if (0 == head_len) {
// no more info
debug(3, "All done");
return (DONE_FORCE);
}
debug(2, "player header '%s'", header);
if (ptr > end) {
malformed_packet(server, "no details for header '%s'", header);
return (PKT_ERROR);
}
}
while (3 == state && ptr < end) {
char *header = ptr;
int head_len = strlen(header);
int header_type;
// the next byte is the starting number
total_players = *ptr++;
if ((0 == strcmp(header, "player_")) || (0 == strcmp(header, "name_"))) {
header_type = PLAYER_NAME_HEADER;
} else if (0 == strcmp(header, "score_")) {
header_type = PLAYER_SCORE_HEADER;
} else if (0 == strcmp(header, "deaths_")) {
header_type = PLAYER_DEATHS_HEADER;
} else if (0 == strcmp(header, "ping_")) {
header_type = PLAYER_PING_HEADER;
} else if (0 == strcmp(header, "kills_")) {
header_type = PLAYER_KILLS_HEADER;
} else if (0 == strcmp(header, "team_")) {
header_type = PLAYER_TEAM_HEADER;
} else {
header_type = PLAYER_OTHER_HEADER;
}
while (ptr < end) {
// now each player details
// add the player
struct player *player;
char *val;
int val_len;
// check for end of this headers player info
if (0x00 == *ptr) {
debug(3, "end of '%s' detail", header);
ptr++;
// Note: can't check ( total_players != no_players ) here as we may have more packets
if ((ptr < end) && (0x00 == *ptr)) {
debug(3, "end of players");
// end of all player headers / detail
state = 2;
ptr++;
}
break;
}
player = get_player_by_number(server, total_players);
if (NULL == player) {
player = add_player(server, total_players);
}
if (ptr >= end) {
malformed_packet(server, "short player detail");
return (PKT_ERROR);
}
val = ptr;
val_len = strlen(val);
ptr += val_len + 1;
debug(2, "Player[%d][%s]=%s\n", total_players, header, val);
// lets see what we got
switch (header_type) {
case PLAYER_NAME_HEADER:
player->name = strdup(val);
break;
case PLAYER_SCORE_HEADER:
player->score = atoi(val);
break;
case PLAYER_DEATHS_HEADER:
player->deaths = atoi(val);
break;
case PLAYER_PING_HEADER:
player->ping = atoi(val);
break;
case PLAYER_KILLS_HEADER:
player->frags = atoi(val);
break;
case PLAYER_TEAM_HEADER:
player->team = atoi(val);
break;
case PLAYER_OTHER_HEADER:
default:
if ('_' == header[head_len - 1]) {
header[head_len - 1] = '\0';
player_add_info(player, header, val, NO_FLAGS);
header[head_len - 1] = '_';
} else {
player_add_info(player, header, val, NO_FLAGS);
}
break;
}
total_players++;
if (total_players > no_players) {
malformed_packet(server, "to many players %d > %d", total_players, no_players);
return (PKT_ERROR);
}
}
}
if (3 == state) {
no_teams = (unsigned char)*ptr;
ptr++;
debug(2, "No teams:%d\n", no_teams);
state = 3;
}
while (4 == state && ptr < end) {
// first we have the header
char *header = ptr;
int head_len = strlen(header);
int header_type;
ptr += head_len + 1;
if (0 == head_len) {
// no more info
debug(3, "All done");
return (DONE_FORCE);
}
debug(2, "team header '%s'", header);
if (0 == strcmp(header, "team_t")) {
header_type = TEAM_NAME_HEADER;
} else {
header_type = TEAM_OTHER_HEADER;
}
// the next byte is the starting number
total_teams = *ptr++;
while (ptr < end) {
// now each teams details
char *val;
int val_len;
char rule[512];
if (ptr >= end) {
malformed_packet(server, "short team detail");
return (PKT_ERROR);
}
val = ptr;
val_len = strlen(val);
ptr += val_len + 1;
debug(2, "Team[%d][%s]=%s\n", total_teams, header, val);
// lets see what we got
switch (header_type) {
case TEAM_NAME_HEADER:
// BF being stupid again teams 1 based instead of 0
players_set_teamname(server, total_teams + 1, val);
// N.B. yes no break
case TEAM_OTHER_HEADER:
default:
// add as a server rule
sprintf(rule, "%s%d", header, total_teams);
add_rule(server, rule, val, NO_FLAGS);
break;
}
total_teams++;
if (0x00 == *ptr) {
// end of this headers teams
ptr++;
break;
}
}
}
}
return (DONE_FORCE);
}
query_status_t
send_haze_request_packet(struct qserver *server)
{
char *packet;
char query_buf[128];
size_t len;
unsigned char required = HAZE_BASIC_INFO;
if (get_server_rules) {
required |= HAZE_GAME_RULES;
server->flags |= TF_PLAYER_QUERY;
}
if (get_player_info) {
required |= HAZE_PLAYER_INFO;
required |= HAZE_TEAM_INFO;
server->flags |= TF_RULES_QUERY;
}
server->flags |= TF_STATUS_QUERY;
if (server->challenge) {
// we've recieved a challenge response, send the query + challenge id
len = sprintf(
query_buf,
"frdquery%c%c%c%c%c",
(unsigned char)(server->challenge >> 24),
(unsigned char)(server->challenge >> 16),
(unsigned char)(server->challenge >> 8),
(unsigned char)(server->challenge >> 0),
required
);
packet = query_buf;
} else {
// Either basic v3 protocol or challenge request
packet = haze_challenge;
len = sizeof(haze_challenge);
}
return (send_packet(server, packet, len));
}