mirror of
https://github.com/DrBeef/ioq3quest.git
synced 2024-11-27 06:13:01 +00:00
Fix circumventing sv_maxping restriction, thanks to Amanieu for reporting. http://bugzilla.icculus.org/show_bug.cgi?id=3423
This commit is contained in:
parent
40c773d80e
commit
9b7543a905
2 changed files with 34 additions and 16 deletions
|
@ -208,6 +208,7 @@ typedef struct {
|
|||
int time; // time the last packet was sent to the autherize server
|
||||
int pingTime; // time the challenge response was sent to client
|
||||
int firstTime; // time the adr was first used, for authorize timeout checks
|
||||
qboolean wasrefused;
|
||||
qboolean connected;
|
||||
} challenge_t;
|
||||
|
||||
|
|
|
@ -82,7 +82,6 @@ void SV_GetChallenge(netadr_t from)
|
|||
{
|
||||
// this is the first time this client has asked for a challenge
|
||||
challenge = &svs.challenges[oldest];
|
||||
challenge->challenge = ( (rand() << 16) ^ rand() ) ^ svs.time;
|
||||
challenge->clientChallenge = 0;
|
||||
challenge->adr = from;
|
||||
challenge->firstTime = svs.time;
|
||||
|
@ -90,6 +89,11 @@ void SV_GetChallenge(netadr_t from)
|
|||
challenge->connected = qfalse;
|
||||
}
|
||||
|
||||
// always generate a new challenge number, so the client cannot circumvent sv_maxping
|
||||
challenge->challenge = ( (rand() << 16) ^ rand() ) ^ svs.time;
|
||||
challenge->wasrefused = qfalse;
|
||||
|
||||
|
||||
#ifndef STANDALONE
|
||||
// Drop the authorize stuff if this client is coming in via v6 as the auth server does not support ipv6.
|
||||
// Drop also for addresses coming in on local LAN and for stand-alone games independent from id's assets.
|
||||
|
@ -338,41 +342,54 @@ void SV_DirectConnect( netadr_t from ) {
|
|||
Info_SetValueForKey( userinfo, "ip", ip );
|
||||
|
||||
// see if the challenge is valid (LAN clients don't need to challenge)
|
||||
if ( !NET_IsLocalAddress (from) ) {
|
||||
if (!NET_IsLocalAddress(from))
|
||||
{
|
||||
int ping;
|
||||
challenge_t *challengeptr;
|
||||
|
||||
for (i=0 ; i<MAX_CHALLENGES ; i++) {
|
||||
if (NET_CompareAdr(from, svs.challenges[i].adr)) {
|
||||
for (i=0; i<MAX_CHALLENGES; i++)
|
||||
{
|
||||
if (NET_CompareAdr(from, svs.challenges[i].adr))
|
||||
{
|
||||
if(challenge == svs.challenges[i].challenge)
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (i == MAX_CHALLENGES) {
|
||||
NET_OutOfBandPrint( NS_SERVER, from, "print\nNo or bad challenge for address.\n" );
|
||||
|
||||
if (i == MAX_CHALLENGES)
|
||||
{
|
||||
NET_OutOfBandPrint( NS_SERVER, from, "print\nNo or bad challenge for your address.\n" );
|
||||
return;
|
||||
}
|
||||
|
||||
ping = svs.time - svs.challenges[i].pingTime;
|
||||
Com_Printf( "Client %i connecting with %i challenge ping\n", i, ping );
|
||||
svs.challenges[i].connected = qtrue;
|
||||
challengeptr = &svs.challenges[i];
|
||||
|
||||
if(challengeptr->wasrefused)
|
||||
{
|
||||
// Return silently, so that error messages written by the server keep being displayed.
|
||||
return;
|
||||
}
|
||||
|
||||
ping = svs.time - challengeptr->pingTime;
|
||||
|
||||
// never reject a LAN client based on ping
|
||||
if ( !Sys_IsLANAddress( from ) ) {
|
||||
if ( sv_minPing->value && ping < sv_minPing->value ) {
|
||||
// don't let them keep trying until they get a big delay
|
||||
NET_OutOfBandPrint( NS_SERVER, from, "print\nServer is for high pings only\n" );
|
||||
Com_DPrintf ("Client %i rejected on a too low ping\n", i);
|
||||
// reset the address otherwise their ping will keep increasing
|
||||
// with each connect message and they'd eventually be able to connect
|
||||
svs.challenges[i].adr.port = 0;
|
||||
challengeptr->wasrefused = qtrue;
|
||||
return;
|
||||
}
|
||||
if ( sv_maxPing->value && ping > sv_maxPing->value ) {
|
||||
NET_OutOfBandPrint( NS_SERVER, from, "print\nServer is for low pings only\n" );
|
||||
Com_DPrintf ("Client %i rejected on a too high ping\n", i);
|
||||
challengeptr->wasrefused = qtrue;
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
Com_Printf("Client %i connecting with %i challenge ping\n", i, ping);
|
||||
challengeptr->connected = qtrue;
|
||||
}
|
||||
|
||||
newcl = &temp;
|
||||
|
|
Loading…
Reference in a new issue