mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2024-12-18 00:21:31 +00:00
516 lines
11 KiB
C
516 lines
11 KiB
C
/*
|
|
cl_slist.c
|
|
|
|
serverlist addressbook
|
|
|
|
Copyright (C) 2000 Brian Koropoff <brian.hk@home.com>
|
|
|
|
Author: Brian Koropoff
|
|
Date: 03 May 2000
|
|
|
|
This program 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.
|
|
|
|
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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to:
|
|
|
|
Free Software Foundation, Inc.
|
|
59 Temple Place - Suite 330
|
|
Boston, MA 02111-1307, USA
|
|
|
|
$Id$
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include "config.h"
|
|
#endif
|
|
#ifdef HAVE_NETINET_IN_H
|
|
# include <netinet/in.h>
|
|
#endif
|
|
#ifdef HAVE_STRING_H
|
|
# include <string.h>
|
|
#endif
|
|
#ifdef HAVE_STRINGS_H
|
|
# include <strings.h>
|
|
#endif
|
|
#ifdef HAVE_SYS_TIME_H
|
|
# include <sys/time.h>
|
|
#endif
|
|
#ifdef HAVE_UNISTD_H
|
|
# include <unistd.h>
|
|
#endif
|
|
#ifdef HAVE_WINDOWS_H
|
|
# include <windows.h>
|
|
#endif
|
|
#include <stdlib.h>
|
|
|
|
#include "QF/cmd.h"
|
|
#include "QF/console.h"
|
|
#include "QF/cvar.h"
|
|
#include "QF/sys.h"
|
|
#include "QF/va.h"
|
|
#include "QF/vfile.h"
|
|
|
|
#include "bothdefs.h"
|
|
#include "cl_main.h"
|
|
#include "cl_slist.h"
|
|
#include "client.h"
|
|
|
|
server_entry_t *slist;
|
|
server_entry_t *all_slist;
|
|
|
|
int slist_last_details;
|
|
|
|
server_entry_t *
|
|
SL_Add (server_entry_t *start, char *ip, char *desc)
|
|
{
|
|
server_entry_t *p;
|
|
|
|
p = start;
|
|
if (!start) { // Nothing at beginning of list,
|
|
// create it
|
|
start = calloc (1, sizeof (server_entry_t));
|
|
|
|
start->prev = 0;
|
|
start->next = 0;
|
|
start->server = malloc (strlen (ip) + 1);
|
|
start->desc = malloc (strlen (desc ? desc : ip) + 1);
|
|
strcpy (start->server, ip);
|
|
strcpy (start->desc, desc ? desc : ip);
|
|
return (start);
|
|
}
|
|
|
|
for (p = start; p->next; p = p->next); // Get to end of list
|
|
|
|
p->next = calloc (1, sizeof (server_entry_t));
|
|
|
|
p->next->prev = p;
|
|
p->next->server = malloc (strlen (ip) + 1);
|
|
p->next->desc = malloc (strlen (desc ? desc : ip) + 1);
|
|
|
|
strcpy (p->next->server, ip);
|
|
strcpy (p->next->desc, desc ? desc : ip);
|
|
|
|
return (start);
|
|
}
|
|
|
|
server_entry_t *
|
|
SL_Del (server_entry_t *start, server_entry_t *del)
|
|
{
|
|
server_entry_t *n;
|
|
|
|
if (del == start) {
|
|
free (start->server);
|
|
free (start->desc);
|
|
n = start->next;
|
|
if (n)
|
|
n->prev = 0;
|
|
free (start);
|
|
return (n);
|
|
}
|
|
|
|
free (del->server);
|
|
free (del->desc);
|
|
if (del->status)
|
|
free (del->status);
|
|
if (del->prev)
|
|
del->prev->next = del->next;
|
|
if (del->next)
|
|
del->next->prev = del->prev;
|
|
free (del);
|
|
return (start);
|
|
}
|
|
|
|
server_entry_t *
|
|
SL_InsB (server_entry_t *start, server_entry_t *place, char *ip, char *desc)
|
|
{
|
|
server_entry_t *new;
|
|
server_entry_t *other;
|
|
|
|
new = calloc (1, sizeof (server_entry_t));
|
|
|
|
new->server = malloc (strlen (ip) + 1);
|
|
new->desc = malloc (strlen (desc) + 1);
|
|
strcpy (new->server, ip);
|
|
strcpy (new->desc, desc);
|
|
other = place->prev;
|
|
if (other)
|
|
other->next = new;
|
|
place->prev = new;
|
|
new->next = place;
|
|
new->prev = other;
|
|
if (!other)
|
|
return new;
|
|
return start;
|
|
}
|
|
|
|
void
|
|
SL_Swap (server_entry_t *swap1, server_entry_t *swap2)
|
|
{
|
|
server_entry_t *next1, *next2, *prev1, *prev2;
|
|
int i;
|
|
|
|
next1 = swap1->next;
|
|
next2 = swap2->next;
|
|
prev1 = swap1->prev;
|
|
prev2 = swap2->prev;
|
|
|
|
for (i = 0; i < sizeof(server_entry_t); i++)
|
|
{
|
|
((char *)swap1)[i] ^= ((char *)swap2)[i];
|
|
((char *)swap2)[i] ^= ((char *)swap1)[i];
|
|
((char *)swap1)[i] ^= ((char *)swap2)[i];
|
|
}
|
|
|
|
swap1->next = next1;
|
|
swap2->next = next2;
|
|
swap1->prev = prev1;
|
|
swap2->prev = prev2;
|
|
}
|
|
|
|
server_entry_t *
|
|
SL_Get_By_Num (server_entry_t *start, int n)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < n; i++)
|
|
start = start->next;
|
|
if (!start)
|
|
return (0);
|
|
return (start);
|
|
}
|
|
|
|
int
|
|
SL_Len (server_entry_t *start)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; start; i++)
|
|
start = start->next;
|
|
return i;
|
|
}
|
|
|
|
server_entry_t *
|
|
SL_LoadF (VFile *f, server_entry_t *start)
|
|
{ // This could get messy
|
|
char line[256]; /* Long lines get truncated. */
|
|
int c = ' '; /* int so it can be compared to EOF
|
|
|
|
properly */
|
|
int len;
|
|
int i;
|
|
char *st;
|
|
char *addr;
|
|
|
|
while (1) {
|
|
// First, get a line
|
|
i = 0;
|
|
c = ' ';
|
|
while (c != '\n' && c != EOF) {
|
|
c = Qgetc (f);
|
|
if (i < 255) {
|
|
line[i] = c;
|
|
i++;
|
|
}
|
|
}
|
|
line[i - 1] = '\0'; // Now we can parse it
|
|
if ((st = gettokstart (line, 1, ' ')) != NULL) {
|
|
len = gettoklen (line, 1, ' ');
|
|
addr = malloc (len + 1);
|
|
strncpy (addr, &line[0], len);
|
|
addr[len] = '\0';
|
|
if ((st = gettokstart (line, 2, ' '))) {
|
|
start = SL_Add (start, addr, st);
|
|
} else {
|
|
start = SL_Add (start, addr, "Unknown");
|
|
}
|
|
}
|
|
if (c == EOF) // We're done
|
|
return start;
|
|
}
|
|
}
|
|
|
|
void
|
|
SL_SaveF (VFile *f, server_entry_t *start)
|
|
{
|
|
do {
|
|
Qprintf (f, "%s %s\n", start->server, start->desc);
|
|
start = start->next;
|
|
|
|
} while (start);
|
|
}
|
|
|
|
void
|
|
SL_Shutdown (server_entry_t *start)
|
|
{
|
|
VFile *f;
|
|
char e_path[MAX_OSPATH];
|
|
|
|
if (start) {
|
|
Qexpand_squiggle (fs_userpath->string, e_path);
|
|
if ((f = Qopen (va ("%s/servers.txt", e_path), "w"))) {
|
|
SL_SaveF (f, start);
|
|
Qclose (f);
|
|
}
|
|
SL_Del_All (start);
|
|
}
|
|
}
|
|
|
|
void
|
|
SL_Del_All (server_entry_t *start)
|
|
{
|
|
server_entry_t *n;
|
|
|
|
while (start) {
|
|
n = start->next;
|
|
free (start->server);
|
|
free (start->desc);
|
|
if (start->status)
|
|
free (start->status);
|
|
free (start);
|
|
start = n;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
gettokstart (char *str, int req, char delim)
|
|
{
|
|
char *start = str;
|
|
|
|
int tok = 1;
|
|
|
|
while (*start == delim) {
|
|
start++;
|
|
}
|
|
if (*start == '\0')
|
|
return '\0';
|
|
while (tok < req) { // Stop when we get to the requested
|
|
// token
|
|
if (*++start == delim) { // Increment pointer and test
|
|
while (*start == delim) { // Get to next token
|
|
start++;
|
|
}
|
|
tok++;
|
|
}
|
|
if (*start == '\0') {
|
|
return '\0';
|
|
}
|
|
}
|
|
return start;
|
|
}
|
|
|
|
int
|
|
gettoklen (char *str, int req, char delim)
|
|
{
|
|
char *start = 0;
|
|
|
|
int len = 0;
|
|
|
|
start = gettokstart (str, req, delim);
|
|
if (start == '\0') {
|
|
return 0;
|
|
}
|
|
while (*start != delim && *start != '\0') {
|
|
start++;
|
|
len++;
|
|
}
|
|
return len;
|
|
}
|
|
|
|
void timepassed (double time1, double *time2)
|
|
{
|
|
*time2 -= time1;
|
|
}
|
|
|
|
void
|
|
SL_Con_List (server_entry_t *sldata)
|
|
{
|
|
int serv;
|
|
server_entry_t *cp;
|
|
|
|
for(serv = 0; serv < SL_Len (sldata); serv++)
|
|
{
|
|
cp = SL_Get_By_Num (sldata, serv);
|
|
Con_Printf("%i) %s\n",(serv + 1),cp->desc);
|
|
}
|
|
}
|
|
|
|
void
|
|
SL_Connect (server_entry_t *sldata, int slitemno)
|
|
{
|
|
CL_Disconnect ();
|
|
strncpy (cls.servername, SL_Get_By_Num (sldata, (slitemno - 1))->server,
|
|
sizeof (cls.servername) - 0);
|
|
CL_BeginServerConnect ();
|
|
}
|
|
|
|
|
|
void
|
|
SL_Update (server_entry_t *sldata)
|
|
{
|
|
// FIXME - Need to change this so the info is not sent in 1 burst
|
|
// as it appears to be causing the occasional problem
|
|
// with some servers
|
|
|
|
int serv;
|
|
netadr_t addy;
|
|
server_entry_t *cp;
|
|
char data_ping[] = "\377\377\377\377k";
|
|
char data_status[] = "\377\377\377\377status";
|
|
|
|
for (serv = 0; serv < SL_Len (sldata); serv++)
|
|
{
|
|
cp = SL_Get_By_Num (sldata, serv);
|
|
NET_StringToAdr (cp->server, &addy);
|
|
|
|
if (!addy.port)
|
|
addy.port = ntohs (27500);
|
|
|
|
cp->pingsent = Sys_DoubleTime ();
|
|
cp->pongback = 0;
|
|
NET_SendPacket (6, data_ping, addy);
|
|
NET_SendPacket (11, data_status, addy);
|
|
cp->waitstatus = 1;
|
|
|
|
}
|
|
}
|
|
|
|
void
|
|
SL_Con_Details (server_entry_t *sldata, int slitemno)
|
|
{
|
|
int i, playercount;
|
|
server_entry_t *cp;
|
|
playercount = 0;
|
|
slist_last_details = slitemno;
|
|
cp = SL_Get_By_Num (sldata, (slitemno - 1));
|
|
Con_Printf("Server: %s\n", cp->server);
|
|
Con_Printf("Ping: ");
|
|
if (cp->pongback)
|
|
Con_Printf("%i\n", (int)(cp->pongback * 1000));
|
|
else
|
|
Con_Printf("N/A\n");
|
|
if (cp->status)
|
|
{
|
|
Con_Printf("Game: %s\n", Info_ValueForKey (cp->status, "*gamedir"));
|
|
Con_Printf("Map: %s\n", Info_ValueForKey (cp->status, "map"));
|
|
for (i = 0; i < strlen(cp->status); i++)
|
|
if (cp->status[i] == '\n')
|
|
playercount++;
|
|
Con_Printf("Players: %i/%s\n", playercount, Info_ValueForKey(cp->status, "maxclients"));
|
|
} else
|
|
Con_Printf("No Details Available\n");
|
|
}
|
|
|
|
void
|
|
SL_MasterUpdate(void)
|
|
{
|
|
netadr_t addy;
|
|
char data[] = "c\n";
|
|
NET_StringToAdr ("qwmaster.ocrana.de:27000", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("qwmaster.barrysworld.com:27000", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("203.55.240.100:27000", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("192.246.40.37:27000", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("192.246.40.37:27002", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("192.246.40.37:27003", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("192.246.40.37:27004", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("192.246.40.37:27006", &addy);
|
|
NET_SendPacket (3, data, addy);
|
|
NET_StringToAdr ("203.9.148.7:27000", &addy);
|
|
}
|
|
|
|
void
|
|
SL_Command (void)
|
|
{
|
|
int sltemp = 0;
|
|
|
|
if (Cmd_Argc () == 1)
|
|
SL_Con_List(slist);
|
|
else if (strcasecmp(Cmd_Argv(1),"update") == 0)
|
|
{
|
|
if (Cmd_Argc () == 2)
|
|
SL_Update(slist);
|
|
else
|
|
Con_Printf("Syntax: slist update\n");
|
|
}
|
|
else if (strcasecmp(Cmd_Argv(1),"masterupdate") == 0)
|
|
{
|
|
SL_MasterUpdate();
|
|
}
|
|
else if (strcasecmp(Cmd_Argv(1),"masterlist") == 0)
|
|
{
|
|
SL_Con_List(all_slist);
|
|
}
|
|
else if (strcasecmp(Cmd_Argv(1),"connect") == 0)
|
|
{
|
|
if (Cmd_Argc () == 3)
|
|
{
|
|
sltemp = atoi(Cmd_Argv(2));
|
|
if(sltemp && (sltemp <= SL_Len (slist)))
|
|
SL_Connect(slist,sltemp);
|
|
else
|
|
Con_Printf("Error: Invalid Server Number -> %s\n",Cmd_Argv(2));
|
|
}
|
|
else if ((Cmd_Argc () == 2) && slist_last_details)
|
|
SL_Connect(slist,slist_last_details);
|
|
else
|
|
Con_Printf("Syntax: slist connect #\n");
|
|
}
|
|
else
|
|
{
|
|
sltemp = atoi(Cmd_Argv(1));
|
|
if((Cmd_Argc () == 2) && sltemp && (sltemp <= SL_Len (slist)))
|
|
SL_Con_Details(slist,sltemp);
|
|
}
|
|
}
|
|
void
|
|
MSL_ParseServerList(char *msl_data)
|
|
{
|
|
int msl_ptr;
|
|
for (msl_ptr = 0; msl_ptr < strlen(msl_data); msl_ptr = msl_ptr + 6)
|
|
{
|
|
all_slist = SL_Add(all_slist, va("%i.%i.%i.%i:%i",
|
|
(byte)msl_data[msl_ptr],
|
|
(byte)msl_data[msl_ptr+1],
|
|
(byte)msl_data[msl_ptr+2],
|
|
(byte)msl_data[msl_ptr+3],
|
|
((byte)msl_data[msl_ptr+4]<<8)|(byte)msl_data[msl_ptr+5]), NULL);
|
|
}
|
|
}
|
|
|
|
void SList_Init (void)
|
|
{
|
|
VFile *servlist;
|
|
char e_path[MAX_OSPATH];
|
|
|
|
Qexpand_squiggle (fs_userpath->string, e_path);
|
|
if ((servlist = Qopen (va ("%s/servers.txt", e_path), "r"))) {
|
|
slist = SL_LoadF (servlist, slist);
|
|
Qclose (servlist);
|
|
} else {
|
|
Qexpand_squiggle (fs_sharepath->string, e_path);
|
|
if ((servlist = Qopen (va ("%s/servers.txt", e_path), "r"))) {
|
|
slist = SL_LoadF (servlist, slist);
|
|
Qclose (servlist);
|
|
}
|
|
all_slist = NULL;
|
|
}
|
|
Cmd_AddCommand("slist",SL_Command,"console commands to access server list\n");
|
|
}
|
|
|