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 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939
|
/*
===========================================================================
Copyright (C) 2025 the OpenMoHAA team
This file is part of OpenMoHAA source code.
OpenMoHAA source code is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the License,
or (at your option) any later version.
OpenMoHAA source code 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with OpenMoHAA source code; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===========================================================================
*/
/******
.c
GameSpy Query & Reporting SDK
Copyright 2000 GameSpy Industries, Inc
18002 Skypark Circle
Irvine, CA 92614
(949)798-4200
Fax(949)798-4299
******
Please see the GameSpy Query & Reporting SDK documentation for more
information
Updated 6/9/99 - DDW
Added get_sockaddrin function, and use for resolving
Made portable with additions from CEngine code
Double check that we don't bind to localhost (instead use INADDR_ANY)
Updated 9/1/99 - DDW
Add the ability to pass in 0 as the queryport, to allocate it
automatically.
Updated 10/11/99 - DDW
TCP Heartbeat support (#define TCP_HEARTBEATS)
Updated 11/20/99 - BGW
Split goa_process_queries into two functions: goa_check_queries() and
goa_check_send_heartbeat().
Updated 3/19/00 - DDW
Added Dreamcast CE Support
Updated 4/5/00 - DDW
Added Dreamcast Shinobi Support (use sendto/recvfrom for UDP sockets to work
around connect bug)
Updated 4/17/00 - DDW
Use a single socket for heartbeats/queries (conserve sockets on DC)
Updated 5/23/00 - DDW
Developer SDK renamed "Query & Reporting SDK"
Encapsulate global data in a structure so multiple simultaneous instances
can run in the same process. Most developers can just pass NULL for the extra
parameter.
qr_init now scans for an open port, starting from a base port.
heartbeats are sent every 30 seconds now until the first query is received,
then they are sent every 5 minutes as recommened by the developer spec
this helps remove the problem of dropped heartbeats causing a server to not
show up for 5 minutes.
Updated 10/2/00 - DDW
Added qr_process_queries_no_heartbeat, so you can advertise a server on the
LAN only.
Updated 11/9/00 - DDW
Use common alloc/re-alloc functions
******/
/********
INCLUDES
********/
#if defined(applec) || defined(THINK_C) || defined(__MWERKS__) && !defined(__KATANA__) && !defined(__mips64)
#include "::nonport.h"
#else
#include "nonport.h"
#endif
#include "sv_gqueryreporting.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#if !defined(UNDER_CE) && !defined(__KATANA__)
#include <assert.h>
#else
#define assert(a)
#endif
#ifdef __cplusplus
extern "C" {
#endif
/*****
TCP_HEARTBEATS
Define this to use reliable heartbeats. Only needed for certain
classes of peer-to-peer games, please contact us if you are unsure
whether you need this or not.
******/
//#define TCP_HEARTBEATS
/********
TYPEDEFS
********/
typedef unsigned char uchar;
#if defined(_LINUX) || defined(__linux__)
typedef unsigned int qrsocklen_t;
#else
typedef int qrsocklen_t;
#endif
typedef enum
{
qtunknown,
qtbasic,
qtinfo,
qtrules,
qtplayers,
qtstatus,
qtpackets,
qtecho,
qtsecure
} query_t;
typedef struct qr_implementation_s
{
SOCKET querysock;
SOCKET hbsock;
char gamename[64];
char secret_key[128];
qr_querycallback_t qr_basic_callback;
qr_querycallback_t qr_info_callback;
qr_querycallback_t qr_rules_callback;
qr_querycallback_t qr_players_callback;
unsigned long lastheartbeat;
int queryid;
int packetnumber;
int qport;
char no_query;
struct sockaddr_in hbaddr;
qr_cdkey_process_t cdkeyprocess;
void* udata;
//
// Added in OPM
//
unsigned long next_master_delay;
int current_master_id;
unsigned long next_master_time;
int next_master_pending;
int last_statechanged;
}* qr_t;
/********
VARS
********/
static const char* queries[] = {"", "basic", "info", "rules", "players", "status", "packets", "echo", "secure"};
static struct sockaddr_in hbaddr;
struct qr_implementation_s static_rec = {INVALID_SOCKET, INVALID_SOCKET};
static qr_t current_rec = &static_rec;
//char qr_hostname[64] = MASTER_ADDR;
//static struct sockaddr_in MasterList[8];
static struct sockaddr_in *MasterList = NULL;
static char keyvalue[8192];
static int MasterCount;
static int MasterMaxCount;
/********
PROTOTYPES
********/
static void send_heartbeat(qr_t qrec, int statechanged);
static void qr_parse_query(qr_t qrec, char* query, int len, struct sockaddr* sender);
static int do_connect(SOCKET sock, char* addr, int port, struct sockaddr_in* hbaddr);
static int do_connect_multi();
void qr_check_queries(qr_t qrec);
void qr_check_send_heartbeat(qr_t qrec);
static void init_qrec(qr_t* qrec,
int baseport,
SOCKET hbsock,
SOCKET querysock,
const char* gamename,
const char* secret_key,
qr_querycallback_t qr_basic_callback,
qr_querycallback_t qr_info_callback,
qr_querycallback_t qr_rules_callback,
qr_querycallback_t qr_players_callback,
void* userdata);
/****************************************************************************/
/* PUBLIC FUNCTIONS */
/****************************************************************************/
/* qr_init: Initializes the sockets, etc. Returns an error value
if an error occured, or 0 otherwise */
int qr_init(qr_t* qrec,
const char* ip,
int baseport,
const char* gamename,
const char* secret_key,
qr_querycallback_t qr_basic_callback,
qr_querycallback_t qr_info_callback,
qr_querycallback_t qr_rules_callback,
qr_querycallback_t qr_players_callback,
void* userdata)
{
int lasterror;
struct sockaddr_in saddr;
qrsocklen_t saddrlen;
int maxport;
SOCKET querysock;
SOCKET hbsock;
if (qrec != NULL) //init it to empty
*qrec = NULL;
//create our sockets
SocketStartUp();
querysock = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
#ifdef TCP_HEARTBEATS
hbsock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
#else
hbsock = querysock; //share the socket
#endif
if (INVALID_SOCKET == querysock || INVALID_SOCKET == hbsock) {
return E_GOA_WSOCKERROR;
}
lasterror = 0;
maxport = baseport + NUM_PORTS_TO_TRY;
while (baseport < maxport) {
get_sockaddrin(ip, baseport, &saddr, NULL);
if (saddr.sin_addr.s_addr == htonl(0x7F000001)) //localhost -- we don't want that!
saddr.sin_addr.s_addr = INADDR_ANY;
lasterror = bind(querysock, (struct sockaddr*)&saddr, sizeof(saddr));
if (lasterror == 0)
break; //we found a port
baseport++;
}
if (lasterror != 0) //we weren't able to find a port
{
return E_GOA_BINDERROR;
}
if (baseport == 0) //we bound it dynamically
{
saddrlen = sizeof(saddr);
lasterror = getsockname(querysock, (struct sockaddr*)&saddr, &saddrlen);
if (lasterror)
return E_GOA_BINDERROR;
baseport = ntohs(saddr.sin_port);
}
init_qrec(qrec,
baseport,
hbsock,
querysock,
gamename,
secret_key,
qr_basic_callback,
qr_info_callback,
qr_rules_callback,
qr_players_callback,
userdata);
if (!qrec) {
qrec = ¤t_rec;
}
return do_connect_multi();
}
void init_qrec(qr_t* qrec,
int qport,
SOCKET hbsock,
SOCKET querysock,
const char* gamename,
const char* secret_key,
qr_querycallback_t qr_basic_callback,
qr_querycallback_t qr_info_callback,
qr_querycallback_t qr_rules_callback,
qr_querycallback_t qr_players_callback,
void* userdata)
{
qr_t cr;
if (qrec == NULL) {
cr = &static_rec;
} else {
*qrec = (qr_t)malloc(sizeof(struct qr_implementation_s));
cr = *qrec;
}
strcpy(cr->gamename, gamename);
strcpy(cr->secret_key, secret_key);
cr->qport = qport;
cr->lastheartbeat = 0;
cr->hbsock = hbsock;
cr->querysock = querysock;
cr->packetnumber = 0;
cr->queryid = 1;
cr->no_query = 1;
cr->udata = userdata;
cr->qr_basic_callback = qr_basic_callback;
cr->qr_info_callback = qr_info_callback;
cr->qr_players_callback = qr_players_callback;
cr->qr_rules_callback = qr_rules_callback;
cr->cdkeyprocess = NULL;
//
// Added in OPM
//
cr->next_master_delay = HB_SEND_DELAY;
cr->next_master_time = 0;
cr->next_master_pending = 0;
cr->current_master_id = 0;
cr->last_statechanged = -1;
}
int qr_init_socket(qr_t* qrec,
unsigned int s,
const char* gamename,
const char* secret_key,
qr_querycallback_t qr_basic_callback,
qr_querycallback_t qr_info_callback,
qr_querycallback_t qr_rules_callback,
qr_querycallback_t qr_players_callback,
void* userdata)
{
if (qrec) {
*qrec = NULL;
}
SocketStartUp();
init_qrec(qrec,
0,
s,
s,
gamename,
secret_key,
qr_basic_callback,
qr_info_callback,
qr_rules_callback,
qr_players_callback,
userdata);
return do_connect_multi();
}
/* qr_process_queries: Processes any waiting queries, and sends a
heartbeat if 5 minutes have elapsed */
void qr_process_queries(qr_t qrec)
{
if (qrec == NULL)
qrec = current_rec;
qr_check_send_heartbeat(qrec);
qr_check_queries(qrec);
}
/* qr_process_queries_no_heartbeat: Processes any waiting queries, but
never sends heartbeats */
void qr_process_queries_no_heartbeat(qr_t qrec)
{
if (qrec == NULL)
qrec = current_rec;
qr_check_queries(qrec);
}
/* qr_check_queries: Processes any waiting queries */
void qr_check_queries(qr_t qrec)
{
static char indata[INBUF_LEN]; //256 byte input buffer
struct sockaddr_in saddr;
qrsocklen_t saddrlen = sizeof(struct sockaddr_in);
fd_set set;
struct timeval timeout = {0, 0};
int error;
if (0 == qrec->qport)
return;
FD_ZERO(&set);
FD_SET(qrec->querysock, &set);
while (1) {
error = select(FD_SETSIZE, &set, NULL, NULL, &timeout);
if (gsiSocketIsError(error) || error == 0)
return;
//else we have data
error = recvfrom(qrec->querysock, indata, INBUF_LEN - 1, 0, (struct sockaddr*)&saddr, &saddrlen);
if (gsiSocketIsNotError(error)) {
indata[error] = '\0';
qr_parse_query(qrec, indata, error, (struct sockaddr*)&saddr);
}
}
}
/* check_send_heartbeat: Perform any scheduled outgoing
heartbeats, (every 5 minutes) */
void qr_check_send_heartbeat(qr_t qrec)
{
unsigned long tc = current_time();
if (INVALID_SOCKET == qrec->hbsock)
return; //no sockets to work with!
if (qrec->next_master_pending) {
// Added in OPM
if (tc >= qrec->next_master_time) {
// Wait a bit some time before sending UDP backets
send_heartbeat(qrec, qrec->last_statechanged);
}
return;
}
//check if we need to send a heartbet
if (tc - qrec->lastheartbeat > HB_TIME || qrec->lastheartbeat == 0 || tc < qrec->lastheartbeat)
send_heartbeat(qrec, 0);
else if (qrec->no_query > 0
&& tc - qrec->lastheartbeat > FIRST_HB_TIME) { //check to see if we haven't gotten a query yet
send_heartbeat(qrec, 0);
qrec->no_query++;
if (qrec->no_query > MAX_FIRST_COUNT)
qrec->no_query = 0; //stop trying to get first query
}
}
/* qr_send_statechanged: Sends a statechanged heartbeat, call when
your gamemode changes */
void qr_send_statechanged(qr_t qrec)
{
if (qrec == NULL)
qrec = current_rec;
send_heartbeat(qrec, 1);
}
void qr_send_exiting(qr_t qrec)
{
if (qrec == NULL)
qrec = current_rec;
send_heartbeat(qrec, 2);
}
/* qr_shutdown: Cleans up the sockets and shuts down */
void qr_shutdown(qr_t qrec)
{
if (qrec == NULL)
qrec = current_rec;
if (INVALID_SOCKET != qrec->querysock && qrec->qport != 0) {
closesocket(qrec->querysock);
}
if (INVALID_SOCKET != qrec->hbsock && qrec->hbsock != qrec->querysock) {
closesocket(qrec->hbsock);
}
qrec->hbsock = INVALID_SOCKET;
qrec->querysock = INVALID_SOCKET;
qrec->lastheartbeat = 0;
if (qrec != &static_rec) //need to gsifree it, it was dynamically allocated
{
gsifree(qrec);
}
if (MasterList) {
gsifree(MasterList);
MasterList = NULL;
}
MasterCount = 0;
SocketShutDown();
}
/****************************************************************************/
static int do_connect(SOCKET sock, char* addr, int port, struct sockaddr_in* hbaddr)
{
#ifdef TCP_HEARTBEATS
struct sockaddr_in saddr;
get_sockaddrin(addr, port, &saddr, NULL);
if (connect(sock, (struct sockaddr*)&saddr, sizeof(saddr)) == SOCKET_ERROR) {
return E_GOA_CONNERROR;
}
add_master(&saddr);
#else
get_sockaddrin(addr, port, hbaddr, NULL);
add_master(hbaddr);
#endif
return 0;
}
static int do_connect_multi()
{
int i;
MasterMaxCount = qr_get_num_masters();
if (MasterList) {
gsifree(MasterList);
MasterList = NULL;
}
MasterList = gsimalloc(sizeof(struct sockaddr_in) * MasterMaxCount);
MasterCount = 0;
for(i = 0; i < MasterMaxCount; i++) {
struct sockaddr_in hbaddr;
if (get_sockaddrin(qr_get_master_host(i), qr_get_master_port(i), &hbaddr, NULL)) {
// Valid, add it
add_master(&hbaddr);
}
}
return 0;
}
/* Return a sockaddrin for the given host (numeric or DNS) and port)
Returns the hostent in savehent if it is not NULL */
int get_sockaddrin(const char* host, int port, struct sockaddr_in* saddr, struct hostent** savehent)
{
struct hostent* hent;
char broadcast_t[] = {
'2', '5', '5', '.', '2', '5', '5', '.', '2', '5', '5', '.', '2', '5', '5', '\0'}; //255.255.255.255
hent = 0;
memset(saddr, 0, sizeof(struct sockaddr_in));
saddr->sin_family = AF_INET;
saddr->sin_port = htons((unsigned short)port);
if (host == NULL)
saddr->sin_addr.s_addr = INADDR_ANY;
else
saddr->sin_addr.s_addr = inet_addr(host);
if (saddr->sin_addr.s_addr == INADDR_NONE && strcmp(host, broadcast_t) != 0) {
hent = gethostbyname(host);
if (!hent)
return 0;
saddr->sin_addr.s_addr = *(u_long*)hent->h_addr_list[0];
}
if (savehent != NULL)
*savehent = hent;
return 1;
}
/* value_for_key: this returns a value for a certain key in s, where s is a string
containing key\value pairs. If the key does not exist, it returns NULL.
Note: the value is stored in a common buffer. If you want to keep it, make a copy! */
static char* value_for_key(const char* s, const char* key)
{
static int valueindex;
char *pos, *pos2;
char keyspec[256] = "\\";
static char value[2][256];
valueindex ^= 1;
strcat(keyspec, key);
strcat(keyspec, "\\");
pos = strstr(s, keyspec);
if (!pos)
return NULL;
pos += strlen(keyspec);
pos2 = value[valueindex];
while (*pos && *pos != '\\')
*pos2++ = *pos++;
*pos2 = '\0';
return value[valueindex];
}
/*****************************************************************************/
/* Various encryption / encoding routines */
#ifndef _GUTIL
#define _GUTIL
static void swap_byte(uchar* a, uchar* b)
{
uchar swapByte;
swapByte = *a;
*a = *b;
*b = swapByte;
}
static uchar encode_ct(uchar c)
{
if (c < 26)
return ('A' + c);
if (c < 52)
return ('a' + c - 26);
if (c < 62)
return ('0' + c - 52);
if (c == 62)
return ('+');
if (c == 63)
return ('/');
return 0;
}
static void gs_encode(uchar* ins, int size, uchar* result)
{
int i, pos;
uchar trip[3];
uchar kwart[4];
i = 0;
while (i < size) {
for (pos = 0; pos <= 2; pos++, i++)
if (i < size)
trip[pos] = *ins++;
else
trip[pos] = '\0';
kwart[0] = (trip[0]) >> 2;
kwart[1] = (((trip[0]) & 3) << 4) + ((trip[1]) >> 4);
kwart[2] = (((trip[1]) & 15) << 2) + ((trip[2]) >> 6);
kwart[3] = (trip[2]) & 63;
for (pos = 0; pos <= 3; pos++)
*result++ = encode_ct(kwart[pos]);
}
*result = '\0';
}
static void gs_encrypt(uchar* key, int key_len, uchar* buffer_ptr, int buffer_len)
{
short counter;
uchar x, y, xorIndex;
uchar state[256];
for (counter = 0; counter < 256; counter++)
state[counter] = (uchar)counter;
x = 0;
y = 0;
for (counter = 0; counter < 256; counter++) {
y = (key[x] + state[counter] + y) % 256;
x = (x + 1) % key_len;
swap_byte(&state[counter], &state[y]);
}
x = 0;
y = 0;
for (counter = 0; counter < buffer_len; counter++) {
x = (x + buffer_ptr[counter] + 1) % 256;
y = (state[x] + y) % 256;
swap_byte(&state[x], &state[y]);
xorIndex = (state[x] + state[y]) % 256;
buffer_ptr[counter] ^= state[xorIndex];
}
}
/*****************************************************************************/
#endif
/* packet_send: sends a key\value packet. Appends the queryid
key\value pair. Clears the buffer */
static void packet_send(qr_t qrec, struct sockaddr* addr, char* buffer)
{
char keyvalue[80];
if (strlen(buffer) == 0)
return; //dont need to send an empty one!
qrec->packetnumber++; //packet numbers start at 1
snprintf(keyvalue, sizeof(keyvalue), "\\queryid\\%d.%d", qrec->queryid, qrec->packetnumber);
strcat(buffer, keyvalue);
sendto(qrec->querysock, buffer, (int)strlen(buffer), 0, addr, sizeof(struct sockaddr_in));
buffer[0] = '\0';
}
/* buffer_send: appends buffer with newdata. If the combined
size would be too large, it flushes buffer first. Space is reserved
on the total size to allow for the queryid key\value */
static void buffer_send(qr_t qrec, struct sockaddr* sender, char* buffer, char* newdata)
{
char *pos, *lastkey;
int bcount = 0;
if (strlen(buffer) + strlen(newdata) < MAX_DATA_SIZE - 50) {
strcat(buffer, newdata);
} else {
if (strlen(newdata) > MAX_DATA_SIZE - 50) //incoming data is too big already!
{
lastkey = pos = newdata;
while (pos - newdata < MAX_DATA_SIZE - 50) {
if ('\\' == *pos) {
if (bcount % 2 == 0)
lastkey = pos;
bcount++;
}
pos++;
}
if (lastkey == newdata)
return; //endless loop - single key was too big!
*lastkey = '\0';
buffer_send(qrec, sender, buffer, newdata);
*lastkey = '\\';
buffer_send(qrec, sender, buffer, lastkey); //send the rest!
} else {
packet_send(qrec, sender, buffer);
strcpy(buffer, newdata);
}
}
}
/* send_basic: sends a response to the basic query */
static void send_basic(qr_t qrec, struct sockaddr* sender, char* outbuf)
{
char keyvalue[BUF_SIZE] = "";
assert(qrec->qr_basic_callback);
qrec->qr_basic_callback(keyvalue, sizeof(keyvalue), qrec->udata);
buffer_send(qrec, sender, outbuf, keyvalue);
}
/* send_info: sends a response to the info query */
static void send_info(qr_t qrec, struct sockaddr* sender, char* outbuf)
{
char keyvalue[BUF_SIZE] = "";
assert(qrec->qr_info_callback);
qrec->qr_info_callback(keyvalue, sizeof(keyvalue), qrec->udata);
buffer_send(qrec, sender, outbuf, keyvalue);
}
/* send_rules: sends a response to the rules query. */
static void send_rules(qr_t qrec, struct sockaddr* sender, char* outbuf)
{
char keyvalue[BUF_SIZE] = "";
assert(qrec->qr_rules_callback);
qrec->qr_rules_callback(keyvalue, sizeof(keyvalue), qrec->udata);
buffer_send(qrec, sender, outbuf, keyvalue);
}
/* send_players: sends the players and their information.*/
static void send_players(qr_t qrec, struct sockaddr* sender, char* outbuf)
{
assert(qrec->qr_players_callback);
qrec->qr_players_callback(keyvalue, sizeof(keyvalue), qrec->udata);
buffer_send(qrec, sender, outbuf, keyvalue);
}
/* send_echo: bounces the echostr back to sender
Note: you should always make sure that your echostr doesn't exceed the MAX_DATA_SIZE*/
static void send_echo(qr_t qrec, struct sockaddr* sender, char* outbuf, char* echostr)
{
char keyvalue[MAX_DATA_SIZE];
if (strlen(echostr) > MAX_DATA_SIZE - 50)
return;
snprintf(keyvalue, sizeof(keyvalue), "\\echo\\%s", echostr);
buffer_send(qrec, sender, outbuf, keyvalue);
}
/* send_final: sends the remaining data in outbuf. Appends the final
key\value to the end. Also adds validation if required. */
static void send_final(qr_t qrec, struct sockaddr* sender, char* outbuf, char* validation)
{
char keyvalue[256];
char encrypted_val[128]; //don't need to null terminate
char encoded_val[200];
int keylen;
if (validation[0]) {
keylen = (int)strlen(validation);
if (keylen > 128)
return;
strcpy(encrypted_val, validation);
gs_encrypt((uchar*)qrec->secret_key, (int)strlen(qrec->secret_key), (uchar*)encrypted_val, keylen);
gs_encode((uchar*)encrypted_val, keylen, (uchar*)encoded_val);
snprintf(keyvalue, sizeof(keyvalue), "\\validate\\%s", encoded_val);
buffer_send(qrec, sender, outbuf, keyvalue);
}
snprintf(keyvalue, sizeof(keyvalue), "\\final\\");
buffer_send(qrec, sender, outbuf, keyvalue);
packet_send(qrec, sender, outbuf);
}
/* parse_query: parse an incoming query (which may contain 1 or more
individual queries) and reply to each query */
static void qr_parse_query(qr_t qrec, char* query, int len, struct sockaddr* sender)
{
int querytype;
char buffer[MAX_DATA_SIZE] = "";
char* value;
char validation[256] = "";
if (qrec == NULL)
qrec = current_rec;
if (query[0] == 0x3B) /* a cdkey query */
{
if (qrec->cdkeyprocess != NULL) {
qrec->cdkeyprocess(query, len, sender);
}
return;
}
qrec->queryid++;
qrec->packetnumber = 0;
if (qrec->no_query > 0)
qrec->no_query = 0;
for (querytype = qtbasic; querytype <= qtsecure; querytype++) {
if ((value = value_for_key(query, queries[querytype])))
switch (querytype) {
case qtbasic:
send_basic(qrec, sender, buffer);
break;
case qtinfo:
send_info(qrec, sender, buffer);
break;
case qtrules:
send_rules(qrec, sender, buffer);
break;
case qtplayers:
send_players(qrec, sender, buffer);
break;
case qtstatus:
send_basic(qrec, sender, buffer);
send_info(qrec, sender, buffer);
send_rules(qrec, sender, buffer);
send_players(qrec, sender, buffer);
break;
case qtpackets:
/*note: "packets" is NOT a real query type. It is simply here to illustrate how a large query would look if broken into packets */
send_basic(qrec, sender, buffer);
packet_send(qrec, sender, buffer);
send_info(qrec, sender, buffer);
packet_send(qrec, sender, buffer);
send_rules(qrec, sender, buffer);
packet_send(qrec, sender, buffer);
send_players(qrec, sender, buffer);
break;
case qtecho:
//note: \echo\value is the syntax here
send_echo(qrec, sender, buffer, value);
break;
case qtsecure:
strcpy(validation, value);
break;
case qtunknown:
break;
}
}
send_final(qrec, sender, buffer, validation);
}
int get_master_count()
{
return MasterCount;
}
void clear_master_list()
{
memset(MasterList, 0, sizeof(MasterList));
MasterCount = 0;
}
void add_master(struct sockaddr_in* addr)
{
int i;
for (i = 0; i < MasterCount; i++) {
if (memcmp(addr, &MasterList[i], sizeof(MasterList[i])) == 0) {
return;
}
}
if (i == MasterMaxCount) {
return;
} else {
MasterList[i] = *addr;
MasterCount++;
}
}
/* send_heartbeat: Sends a heartbeat to the gamemaster,
adds \statechanged\ if statechanged != 0 */
static void send_heartbeat(qr_t qrec, int statechanged)
{
char buf[256];
int ret;
int i;
snprintf(buf, sizeof(buf), "\\heartbeat\\%d\\gamename\\%s", qrec->qport, qrec->gamename);
if (statechanged)
snprintf(&buf[strlen(buf)], sizeof(buf) - strlen(buf), "\\statechanged\\");
if (qrec->next_master_delay > 0 && statechanged != 2) {
//
// Added in OPM
// Delay sends between multiple masters
//
if (qrec->last_statechanged != statechanged) {
// different state
qrec->current_master_id = 0;
qrec->last_statechanged = statechanged;
}
i = qrec->current_master_id;
ret = sendto(qrec->hbsock, buf, (int)strlen(buf), 0, (struct sockaddr*)&MasterList[i], sizeof(MasterList[i]));
qrec->current_master_id++;
if (qrec->current_master_id < MasterCount) {
qrec->next_master_time = current_time() + qrec->next_master_delay;
qrec->next_master_pending = 1;
} else {
qrec->current_master_id = 0;
qrec->next_master_time = 0;
qrec->next_master_pending = 0;
qrec->last_statechanged = -1;
}
} else {
// send everything all at once
for (i = 0; i < MasterCount; i++) {
ret = sendto(qrec->hbsock, buf, (int)strlen(buf), 0, (struct sockaddr*)&MasterList[i], sizeof(MasterList[i]));
}
}
qrec->lastheartbeat = current_time();
}
#ifdef __cplusplus
}
#endif
|