2010-11-29 19:13:04 +01:00
|
|
|
/*
|
2013-02-24 18:40:43 +01:00
|
|
|
Minetest
|
2013-02-24 19:38:45 +01:00
|
|
|
Copyright (C) 2013 celeron55, Perttu Ahola <celeron55@gmail.com>
|
2010-11-29 19:13:04 +01:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
2012-06-05 16:56:56 +02:00
|
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
2010-11-29 19:13:04 +01:00
|
|
|
(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
|
2012-06-05 16:56:56 +02:00
|
|
|
GNU Lesser General Public License for more details.
|
2010-11-29 19:13:04 +01:00
|
|
|
|
2012-06-05 16:56:56 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
2010-11-29 19:13:04 +01:00
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
#include "connection.h"
|
|
|
|
#include "main.h"
|
|
|
|
#include "serialization.h"
|
2011-10-20 22:04:09 +02:00
|
|
|
#include "log.h"
|
|
|
|
#include "porting.h"
|
2012-06-17 01:40:36 +02:00
|
|
|
#include "util/serialize.h"
|
|
|
|
#include "util/numeric.h"
|
|
|
|
#include "util/string.h"
|
2012-11-27 08:38:21 +01:00
|
|
|
#include "settings.h"
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
namespace con
|
|
|
|
{
|
|
|
|
|
2012-06-17 01:40:36 +02:00
|
|
|
static u16 readPeerId(u8 *packetdata)
|
|
|
|
{
|
|
|
|
return readU16(&packetdata[4]);
|
|
|
|
}
|
|
|
|
static u8 readChannel(u8 *packetdata)
|
|
|
|
{
|
|
|
|
return readU8(&packetdata[6]);
|
|
|
|
}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
BufferedPacket makePacket(Address &address, u8 *data, u32 datasize,
|
|
|
|
u32 protocol_id, u16 sender_peer_id, u8 channel)
|
|
|
|
{
|
|
|
|
u32 packet_size = datasize + BASE_HEADER_SIZE;
|
|
|
|
BufferedPacket p(packet_size);
|
|
|
|
p.address = address;
|
|
|
|
|
|
|
|
writeU32(&p.data[0], protocol_id);
|
|
|
|
writeU16(&p.data[4], sender_peer_id);
|
|
|
|
writeU8(&p.data[6], channel);
|
|
|
|
|
|
|
|
memcpy(&p.data[BASE_HEADER_SIZE], data, datasize);
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
BufferedPacket makePacket(Address &address, SharedBuffer<u8> &data,
|
|
|
|
u32 protocol_id, u16 sender_peer_id, u8 channel)
|
|
|
|
{
|
|
|
|
return makePacket(address, *data, data.getSize(),
|
|
|
|
protocol_id, sender_peer_id, channel);
|
|
|
|
}
|
|
|
|
|
|
|
|
SharedBuffer<u8> makeOriginalPacket(
|
|
|
|
SharedBuffer<u8> data)
|
|
|
|
{
|
|
|
|
u32 header_size = 1;
|
|
|
|
u32 packet_size = data.getSize() + header_size;
|
|
|
|
SharedBuffer<u8> b(packet_size);
|
|
|
|
|
|
|
|
writeU8(&b[0], TYPE_ORIGINAL);
|
|
|
|
|
|
|
|
memcpy(&b[header_size], *data, data.getSize());
|
|
|
|
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<SharedBuffer<u8> > makeSplitPacket(
|
2010-11-27 00:02:21 +01:00
|
|
|
SharedBuffer<u8> data,
|
|
|
|
u32 chunksize_max,
|
|
|
|
u16 seqnum)
|
|
|
|
{
|
|
|
|
// Chunk packets, containing the TYPE_SPLIT header
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<SharedBuffer<u8> > chunks;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
u32 chunk_header_size = 7;
|
|
|
|
u32 maximum_data_size = chunksize_max - chunk_header_size;
|
|
|
|
u32 start = 0;
|
|
|
|
u32 end = 0;
|
|
|
|
u32 chunk_num = 0;
|
2012-12-20 18:19:49 +01:00
|
|
|
u16 chunk_count = 0;
|
2010-11-27 00:02:21 +01:00
|
|
|
do{
|
|
|
|
end = start + maximum_data_size - 1;
|
|
|
|
if(end > data.getSize() - 1)
|
|
|
|
end = data.getSize() - 1;
|
|
|
|
|
|
|
|
u32 payload_size = end - start + 1;
|
|
|
|
u32 packet_size = chunk_header_size + payload_size;
|
|
|
|
|
|
|
|
SharedBuffer<u8> chunk(packet_size);
|
|
|
|
|
|
|
|
writeU8(&chunk[0], TYPE_SPLIT);
|
|
|
|
writeU16(&chunk[1], seqnum);
|
|
|
|
// [3] u16 chunk_count is written at next stage
|
|
|
|
writeU16(&chunk[5], chunk_num);
|
|
|
|
memcpy(&chunk[chunk_header_size], &data[start], payload_size);
|
|
|
|
|
|
|
|
chunks.push_back(chunk);
|
2012-12-20 18:19:49 +01:00
|
|
|
chunk_count++;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
start = end + 1;
|
|
|
|
chunk_num++;
|
|
|
|
}
|
|
|
|
while(end != data.getSize() - 1);
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<SharedBuffer<u8> >::iterator i = chunks.begin();
|
|
|
|
i != chunks.end(); ++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
// Write chunk_count
|
|
|
|
writeU16(&((*i)[3]), chunk_count);
|
|
|
|
}
|
|
|
|
|
|
|
|
return chunks;
|
|
|
|
}
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<SharedBuffer<u8> > makeAutoSplitPacket(
|
2010-11-27 00:02:21 +01:00
|
|
|
SharedBuffer<u8> data,
|
|
|
|
u32 chunksize_max,
|
|
|
|
u16 &split_seqnum)
|
|
|
|
{
|
|
|
|
u32 original_header_size = 1;
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<SharedBuffer<u8> > list;
|
2010-11-27 00:02:21 +01:00
|
|
|
if(data.getSize() + original_header_size > chunksize_max)
|
|
|
|
{
|
|
|
|
list = makeSplitPacket(data, chunksize_max, split_seqnum);
|
|
|
|
split_seqnum++;
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
list.push_back(makeOriginalPacket(data));
|
|
|
|
}
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
|
|
|
|
SharedBuffer<u8> makeReliablePacket(
|
|
|
|
SharedBuffer<u8> data,
|
|
|
|
u16 seqnum)
|
|
|
|
{
|
|
|
|
/*dstream<<"BEGIN SharedBuffer<u8> makeReliablePacket()"<<std::endl;
|
|
|
|
dstream<<"data.getSize()="<<data.getSize()<<", data[0]="
|
|
|
|
<<((unsigned int)data[0]&0xff)<<std::endl;*/
|
|
|
|
u32 header_size = 3;
|
|
|
|
u32 packet_size = data.getSize() + header_size;
|
|
|
|
SharedBuffer<u8> b(packet_size);
|
|
|
|
|
|
|
|
writeU8(&b[0], TYPE_RELIABLE);
|
|
|
|
writeU16(&b[1], seqnum);
|
|
|
|
|
|
|
|
memcpy(&b[header_size], *data, data.getSize());
|
|
|
|
|
|
|
|
/*dstream<<"data.getSize()="<<data.getSize()<<", data[0]="
|
|
|
|
<<((unsigned int)data[0]&0xff)<<std::endl;*/
|
|
|
|
//dstream<<"END SharedBuffer<u8> makeReliablePacket()"<<std::endl;
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
ReliablePacketBuffer
|
|
|
|
*/
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
ReliablePacketBuffer::ReliablePacketBuffer(): m_list_size(0) {}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
void ReliablePacketBuffer::print()
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<BufferedPacket>::iterator i = m_list.begin();
|
|
|
|
i != m_list.end();
|
|
|
|
++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
u16 s = readU16(&(i->data[BASE_HEADER_SIZE+1]));
|
|
|
|
dout_con<<s<<" ";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
bool ReliablePacketBuffer::empty()
|
|
|
|
{
|
|
|
|
return m_list.empty();
|
|
|
|
}
|
|
|
|
u32 ReliablePacketBuffer::size()
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
return m_list_size;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
RPBSearchResult ReliablePacketBuffer::findPacket(u16 seqnum)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<BufferedPacket>::iterator i = m_list.begin();
|
|
|
|
for(; i != m_list.end(); ++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
u16 s = readU16(&(i->data[BASE_HEADER_SIZE+1]));
|
|
|
|
/*dout_con<<"findPacket(): finding seqnum="<<seqnum
|
|
|
|
<<", comparing to s="<<s<<std::endl;*/
|
|
|
|
if(s == seqnum)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
RPBSearchResult ReliablePacketBuffer::notFound()
|
|
|
|
{
|
|
|
|
return m_list.end();
|
|
|
|
}
|
|
|
|
u16 ReliablePacketBuffer::getFirstSeqnum()
|
|
|
|
{
|
|
|
|
if(empty())
|
|
|
|
throw NotFoundException("Buffer is empty");
|
|
|
|
BufferedPacket p = *m_list.begin();
|
|
|
|
return readU16(&p.data[BASE_HEADER_SIZE+1]);
|
|
|
|
}
|
|
|
|
BufferedPacket ReliablePacketBuffer::popFirst()
|
|
|
|
{
|
|
|
|
if(empty())
|
|
|
|
throw NotFoundException("Buffer is empty");
|
|
|
|
BufferedPacket p = *m_list.begin();
|
2012-12-20 18:19:49 +01:00
|
|
|
m_list.erase(m_list.begin());
|
|
|
|
--m_list_size;
|
2010-11-27 00:02:21 +01:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
BufferedPacket ReliablePacketBuffer::popSeqnum(u16 seqnum)
|
|
|
|
{
|
|
|
|
RPBSearchResult r = findPacket(seqnum);
|
|
|
|
if(r == notFound()){
|
|
|
|
dout_con<<"Not found"<<std::endl;
|
|
|
|
throw NotFoundException("seqnum not found in buffer");
|
|
|
|
}
|
|
|
|
BufferedPacket p = *r;
|
|
|
|
m_list.erase(r);
|
2012-12-20 18:19:49 +01:00
|
|
|
--m_list_size;
|
2010-11-27 00:02:21 +01:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
void ReliablePacketBuffer::insert(BufferedPacket &p)
|
|
|
|
{
|
|
|
|
assert(p.data.getSize() >= BASE_HEADER_SIZE+3);
|
|
|
|
u8 type = readU8(&p.data[BASE_HEADER_SIZE+0]);
|
|
|
|
assert(type == TYPE_RELIABLE);
|
|
|
|
u16 seqnum = readU16(&p.data[BASE_HEADER_SIZE+1]);
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
++m_list_size;
|
2010-11-27 00:02:21 +01:00
|
|
|
// Find the right place for the packet and insert it there
|
|
|
|
|
|
|
|
// If list is empty, just add it
|
|
|
|
if(m_list.empty())
|
|
|
|
{
|
|
|
|
m_list.push_back(p);
|
|
|
|
// Done.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// Otherwise find the right place
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<BufferedPacket>::iterator i = m_list.begin();
|
2010-11-27 00:02:21 +01:00
|
|
|
// Find the first packet in the list which has a higher seqnum
|
2012-12-20 18:19:49 +01:00
|
|
|
for(; i != m_list.end(); ++i){
|
2010-11-27 00:02:21 +01:00
|
|
|
u16 s = readU16(&(i->data[BASE_HEADER_SIZE+1]));
|
|
|
|
if(s == seqnum){
|
2012-12-20 18:19:49 +01:00
|
|
|
--m_list_size;
|
2010-11-27 00:02:21 +01:00
|
|
|
throw AlreadyExistsException("Same seqnum in list");
|
|
|
|
}
|
|
|
|
if(seqnum_higher(s, seqnum)){
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// If we're at the end of the list, add the packet to the
|
|
|
|
// end of the list
|
|
|
|
if(i == m_list.end())
|
|
|
|
{
|
|
|
|
m_list.push_back(p);
|
|
|
|
// Done.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// Insert before i
|
2012-12-20 18:19:49 +01:00
|
|
|
m_list.insert(i, p);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void ReliablePacketBuffer::incrementTimeouts(float dtime)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<BufferedPacket>::iterator i = m_list.begin();
|
|
|
|
i != m_list.end(); ++i)
|
|
|
|
{
|
2010-11-27 00:02:21 +01:00
|
|
|
i->time += dtime;
|
|
|
|
i->totaltime += dtime;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void ReliablePacketBuffer::resetTimedOuts(float timeout)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<BufferedPacket>::iterator i = m_list.begin();
|
|
|
|
i != m_list.end(); ++i)
|
|
|
|
{
|
2010-11-27 00:02:21 +01:00
|
|
|
if(i->time >= timeout)
|
|
|
|
i->time = 0.0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ReliablePacketBuffer::anyTotaltimeReached(float timeout)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<BufferedPacket>::iterator i = m_list.begin();
|
|
|
|
i != m_list.end(); ++i)
|
|
|
|
{
|
2010-11-27 00:02:21 +01:00
|
|
|
if(i->totaltime >= timeout)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<BufferedPacket> ReliablePacketBuffer::getTimedOuts(float timeout)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<BufferedPacket> timed_outs;
|
|
|
|
for(std::list<BufferedPacket>::iterator i = m_list.begin();
|
|
|
|
i != m_list.end(); ++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
if(i->time >= timeout)
|
|
|
|
timed_outs.push_back(*i);
|
|
|
|
}
|
|
|
|
return timed_outs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
IncomingSplitBuffer
|
|
|
|
*/
|
|
|
|
|
|
|
|
IncomingSplitBuffer::~IncomingSplitBuffer()
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, IncomingSplitPacket*>::iterator i = m_buf.begin();
|
|
|
|
i != m_buf.end(); ++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
delete i->second;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
This will throw a GotSplitPacketException when a full
|
|
|
|
split packet is constructed.
|
|
|
|
*/
|
2011-05-21 11:25:08 +02:00
|
|
|
SharedBuffer<u8> IncomingSplitBuffer::insert(BufferedPacket &p, bool reliable)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
u32 headersize = BASE_HEADER_SIZE + 7;
|
|
|
|
assert(p.data.getSize() >= headersize);
|
|
|
|
u8 type = readU8(&p.data[BASE_HEADER_SIZE+0]);
|
|
|
|
assert(type == TYPE_SPLIT);
|
|
|
|
u16 seqnum = readU16(&p.data[BASE_HEADER_SIZE+1]);
|
|
|
|
u16 chunk_count = readU16(&p.data[BASE_HEADER_SIZE+3]);
|
|
|
|
u16 chunk_num = readU16(&p.data[BASE_HEADER_SIZE+5]);
|
|
|
|
|
|
|
|
// Add if doesn't exist
|
2012-12-20 18:19:49 +01:00
|
|
|
if(m_buf.find(seqnum) == m_buf.end())
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
IncomingSplitPacket *sp = new IncomingSplitPacket();
|
|
|
|
sp->chunk_count = chunk_count;
|
|
|
|
sp->reliable = reliable;
|
|
|
|
m_buf[seqnum] = sp;
|
|
|
|
}
|
|
|
|
|
|
|
|
IncomingSplitPacket *sp = m_buf[seqnum];
|
|
|
|
|
|
|
|
// TODO: These errors should be thrown or something? Dunno.
|
|
|
|
if(chunk_count != sp->chunk_count)
|
|
|
|
derr_con<<"Connection: WARNING: chunk_count="<<chunk_count
|
|
|
|
<<" != sp->chunk_count="<<sp->chunk_count
|
|
|
|
<<std::endl;
|
|
|
|
if(reliable != sp->reliable)
|
|
|
|
derr_con<<"Connection: WARNING: reliable="<<reliable
|
|
|
|
<<" != sp->reliable="<<sp->reliable
|
|
|
|
<<std::endl;
|
|
|
|
|
2012-06-04 21:43:33 +02:00
|
|
|
// If chunk already exists, ignore it.
|
|
|
|
// Sometimes two identical packets may arrive when there is network
|
|
|
|
// lag and the server re-sends stuff.
|
2012-12-20 18:19:49 +01:00
|
|
|
if(sp->chunks.find(chunk_num) != sp->chunks.end())
|
2012-06-04 21:43:33 +02:00
|
|
|
return SharedBuffer<u8>();
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
// Cut chunk data out of packet
|
|
|
|
u32 chunkdatasize = p.data.getSize() - headersize;
|
|
|
|
SharedBuffer<u8> chunkdata(chunkdatasize);
|
|
|
|
memcpy(*chunkdata, &(p.data[headersize]), chunkdatasize);
|
|
|
|
|
|
|
|
// Set chunk data in buffer
|
|
|
|
sp->chunks[chunk_num] = chunkdata;
|
|
|
|
|
2011-05-21 11:25:08 +02:00
|
|
|
// If not all chunks are received, return empty buffer
|
2010-11-27 00:02:21 +01:00
|
|
|
if(sp->allReceived() == false)
|
2011-05-21 11:25:08 +02:00
|
|
|
return SharedBuffer<u8>();
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
// Calculate total size
|
|
|
|
u32 totalsize = 0;
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, SharedBuffer<u8> >::iterator i = sp->chunks.begin();
|
|
|
|
i != sp->chunks.end(); ++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
totalsize += i->second.getSize();
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
SharedBuffer<u8> fulldata(totalsize);
|
|
|
|
|
|
|
|
// Copy chunks to data buffer
|
|
|
|
u32 start = 0;
|
|
|
|
for(u32 chunk_i=0; chunk_i<sp->chunk_count;
|
|
|
|
chunk_i++)
|
|
|
|
{
|
|
|
|
SharedBuffer<u8> buf = sp->chunks[chunk_i];
|
|
|
|
u16 chunkdatasize = buf.getSize();
|
|
|
|
memcpy(&fulldata[start], *buf, chunkdatasize);
|
|
|
|
start += chunkdatasize;;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove sp from buffer
|
2012-12-20 18:19:49 +01:00
|
|
|
m_buf.erase(seqnum);
|
2010-11-27 00:02:21 +01:00
|
|
|
delete sp;
|
2011-05-21 11:25:08 +02:00
|
|
|
|
|
|
|
return fulldata;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
void IncomingSplitBuffer::removeUnreliableTimedOuts(float dtime, float timeout)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<u16> remove_queue;
|
|
|
|
for(std::map<u16, IncomingSplitPacket*>::iterator i = m_buf.begin();
|
|
|
|
i != m_buf.end(); ++i)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
IncomingSplitPacket *p = i->second;
|
2010-11-27 00:02:21 +01:00
|
|
|
// Reliable ones are not removed by timeout
|
|
|
|
if(p->reliable == true)
|
|
|
|
continue;
|
|
|
|
p->time += dtime;
|
|
|
|
if(p->time >= timeout)
|
2012-12-20 18:19:49 +01:00
|
|
|
remove_queue.push_back(i->first);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<u16>::iterator j = remove_queue.begin();
|
|
|
|
j != remove_queue.end(); ++j)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
dout_con<<"NOTE: Removing timed out unreliable split packet"
|
|
|
|
<<std::endl;
|
|
|
|
delete m_buf[*j];
|
2012-12-20 18:19:49 +01:00
|
|
|
m_buf.erase(*j);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Channel
|
|
|
|
*/
|
|
|
|
|
|
|
|
Channel::Channel()
|
|
|
|
{
|
|
|
|
next_outgoing_seqnum = SEQNUM_INITIAL;
|
|
|
|
next_incoming_seqnum = SEQNUM_INITIAL;
|
|
|
|
next_outgoing_split_seqnum = SEQNUM_INITIAL;
|
|
|
|
}
|
|
|
|
Channel::~Channel()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Peer
|
|
|
|
*/
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Peer::Peer(u16 a_id, Address a_address):
|
|
|
|
address(a_address),
|
|
|
|
id(a_id),
|
|
|
|
timeout_counter(0.0),
|
|
|
|
ping_timer(0.0),
|
|
|
|
resend_timeout(0.5),
|
|
|
|
avg_rtt(-1.0),
|
|
|
|
has_sent_with_id(false),
|
|
|
|
m_sendtime_accu(0),
|
|
|
|
m_max_packets_per_second(10),
|
|
|
|
m_num_sent(0),
|
2012-11-27 08:38:21 +01:00
|
|
|
m_max_num_sent(0),
|
|
|
|
congestion_control_aim_rtt(0.2),
|
|
|
|
congestion_control_max_rate(400),
|
|
|
|
congestion_control_min_rate(10)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
}
|
|
|
|
Peer::~Peer()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void Peer::reportRTT(float rtt)
|
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
if(rtt >= 0.0){
|
|
|
|
if(rtt < 0.01){
|
2012-11-27 08:38:21 +01:00
|
|
|
if(m_max_packets_per_second < congestion_control_max_rate)
|
2011-10-20 22:04:09 +02:00
|
|
|
m_max_packets_per_second += 10;
|
2012-11-27 08:38:21 +01:00
|
|
|
} else if(rtt < congestion_control_aim_rtt){
|
|
|
|
if(m_max_packets_per_second < congestion_control_max_rate)
|
2011-10-20 22:04:09 +02:00
|
|
|
m_max_packets_per_second += 2;
|
|
|
|
} else {
|
2011-10-21 10:52:26 +02:00
|
|
|
m_max_packets_per_second *= 0.8;
|
2012-11-27 08:38:21 +01:00
|
|
|
if(m_max_packets_per_second < congestion_control_min_rate)
|
|
|
|
m_max_packets_per_second = congestion_control_min_rate;
|
2011-10-20 22:04:09 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
if(rtt < -0.999)
|
|
|
|
{}
|
|
|
|
else if(avg_rtt < 0.0)
|
|
|
|
avg_rtt = rtt;
|
|
|
|
else
|
|
|
|
avg_rtt = rtt * 0.1 + avg_rtt * 0.9;
|
|
|
|
|
|
|
|
// Calculate resend_timeout
|
|
|
|
|
|
|
|
/*int reliable_count = 0;
|
|
|
|
for(int i=0; i<CHANNEL_COUNT; i++)
|
|
|
|
{
|
|
|
|
reliable_count += channels[i].outgoing_reliables.size();
|
|
|
|
}
|
|
|
|
float timeout = avg_rtt * RESEND_TIMEOUT_FACTOR
|
|
|
|
* ((float)reliable_count * 1);*/
|
|
|
|
|
|
|
|
float timeout = avg_rtt * RESEND_TIMEOUT_FACTOR;
|
|
|
|
if(timeout < RESEND_TIMEOUT_MIN)
|
|
|
|
timeout = RESEND_TIMEOUT_MIN;
|
|
|
|
if(timeout > RESEND_TIMEOUT_MAX)
|
|
|
|
timeout = RESEND_TIMEOUT_MAX;
|
|
|
|
resend_timeout = timeout;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Connection
|
|
|
|
*/
|
|
|
|
|
2013-06-23 09:31:22 +02:00
|
|
|
Connection::Connection(u32 protocol_id, u32 max_packet_size, float timeout,
|
|
|
|
bool ipv6):
|
2011-10-20 22:04:09 +02:00
|
|
|
m_protocol_id(protocol_id),
|
|
|
|
m_max_packet_size(max_packet_size),
|
|
|
|
m_timeout(timeout),
|
2013-06-23 09:31:22 +02:00
|
|
|
m_socket(ipv6),
|
2011-10-20 22:04:09 +02:00
|
|
|
m_peer_id(0),
|
|
|
|
m_bc_peerhandler(NULL),
|
|
|
|
m_bc_receive_timeout(0),
|
|
|
|
m_indentation(0)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
m_socket.setTimeoutMs(5);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Start();
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Connection::Connection(u32 protocol_id, u32 max_packet_size, float timeout,
|
2013-06-23 09:31:22 +02:00
|
|
|
bool ipv6, PeerHandler *peerhandler):
|
2011-10-20 22:04:09 +02:00
|
|
|
m_protocol_id(protocol_id),
|
|
|
|
m_max_packet_size(max_packet_size),
|
|
|
|
m_timeout(timeout),
|
2013-06-23 09:31:22 +02:00
|
|
|
m_socket(ipv6),
|
2011-10-20 22:04:09 +02:00
|
|
|
m_peer_id(0),
|
|
|
|
m_bc_peerhandler(peerhandler),
|
|
|
|
m_bc_receive_timeout(0),
|
|
|
|
m_indentation(0)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
m_socket.setTimeoutMs(5);
|
|
|
|
|
|
|
|
Start();
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
Connection::~Connection()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
stop();
|
2012-03-20 16:55:34 +01:00
|
|
|
// Delete peers
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, Peer*>::iterator
|
|
|
|
j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2012-03-20 16:55:34 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
delete j->second;
|
2012-03-20 16:55:34 +01:00
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
/* Internal stuff */
|
|
|
|
|
|
|
|
void * Connection::Thread()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
ThreadStarted();
|
|
|
|
log_register_thread("Connection");
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
dout_con<<"Connection thread started"<<std::endl;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
u32 curtime = porting::getTimeMs();
|
|
|
|
u32 lasttime = curtime;
|
|
|
|
|
|
|
|
while(getRun())
|
|
|
|
{
|
|
|
|
BEGIN_DEBUG_EXCEPTION_HANDLER
|
|
|
|
|
|
|
|
lasttime = curtime;
|
|
|
|
curtime = porting::getTimeMs();
|
|
|
|
float dtime = (float)(curtime - lasttime) / 1000.;
|
|
|
|
if(dtime > 0.1)
|
|
|
|
dtime = 0.1;
|
|
|
|
if(dtime < 0.0)
|
|
|
|
dtime = 0.0;
|
|
|
|
|
|
|
|
runTimeouts(dtime);
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
while(!m_command_queue.empty()){
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionCommand c = m_command_queue.pop_front();
|
|
|
|
processCommand(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
send(dtime);
|
|
|
|
|
|
|
|
receive();
|
|
|
|
|
|
|
|
END_DEBUG_EXCEPTION_HANDLER(derr_con);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
return NULL;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::putEvent(ConnectionEvent &e)
|
2010-12-24 16:08:50 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
assert(e.type != CONNEVENT_NONE);
|
|
|
|
m_event_queue.push_back(e);
|
2010-12-24 16:08:50 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::processCommand(ConnectionCommand &c)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
switch(c.type){
|
|
|
|
case CONNCMD_NONE:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_NONE"<<std::endl;
|
|
|
|
return;
|
|
|
|
case CONNCMD_SERVE:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_SERVE port="
|
|
|
|
<<c.port<<std::endl;
|
|
|
|
serve(c.port);
|
|
|
|
return;
|
|
|
|
case CONNCMD_CONNECT:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_CONNECT"<<std::endl;
|
|
|
|
connect(c.address);
|
|
|
|
return;
|
|
|
|
case CONNCMD_DISCONNECT:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_DISCONNECT"<<std::endl;
|
|
|
|
disconnect();
|
|
|
|
return;
|
|
|
|
case CONNCMD_SEND:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_SEND"<<std::endl;
|
|
|
|
send(c.peer_id, c.channelnum, c.data, c.reliable);
|
|
|
|
return;
|
|
|
|
case CONNCMD_SEND_TO_ALL:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_SEND_TO_ALL"<<std::endl;
|
|
|
|
sendToAll(c.channelnum, c.data, c.reliable);
|
|
|
|
return;
|
|
|
|
case CONNCMD_DELETE_PEER:
|
|
|
|
dout_con<<getDesc()<<" processing CONNCMD_DELETE_PEER"<<std::endl;
|
|
|
|
deletePeer(c.peer_id, false);
|
|
|
|
return;
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::send(float dtime)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, Peer*>::iterator
|
|
|
|
j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
peer->m_sendtime_accu += dtime;
|
|
|
|
peer->m_num_sent = 0;
|
|
|
|
peer->m_max_num_sent = peer->m_sendtime_accu *
|
|
|
|
peer->m_max_packets_per_second;
|
|
|
|
}
|
|
|
|
Queue<OutgoingPacket> postponed_packets;
|
2012-12-20 18:19:49 +01:00
|
|
|
while(!m_outgoing_queue.empty()){
|
2011-10-20 22:04:09 +02:00
|
|
|
OutgoingPacket packet = m_outgoing_queue.pop_front();
|
|
|
|
Peer *peer = getPeerNoEx(packet.peer_id);
|
|
|
|
if(!peer)
|
|
|
|
continue;
|
|
|
|
if(peer->channels[packet.channelnum].outgoing_reliables.size() >= 5){
|
|
|
|
postponed_packets.push_back(packet);
|
|
|
|
} else if(peer->m_num_sent < peer->m_max_num_sent){
|
|
|
|
rawSendAsPacket(packet.peer_id, packet.channelnum,
|
|
|
|
packet.data, packet.reliable);
|
|
|
|
peer->m_num_sent++;
|
|
|
|
} else {
|
|
|
|
postponed_packets.push_back(packet);
|
|
|
|
}
|
|
|
|
}
|
2012-12-20 18:19:49 +01:00
|
|
|
while(!postponed_packets.empty()){
|
2011-10-20 22:04:09 +02:00
|
|
|
m_outgoing_queue.push_back(postponed_packets.pop_front());
|
|
|
|
}
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, Peer*>::iterator
|
|
|
|
j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
peer->m_sendtime_accu -= (float)peer->m_num_sent /
|
|
|
|
peer->m_max_packets_per_second;
|
|
|
|
if(peer->m_sendtime_accu > 10. / peer->m_max_packets_per_second)
|
|
|
|
peer->m_sendtime_accu = 10. / peer->m_max_packets_per_second;
|
|
|
|
}
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Receive packets from the network and buffers and create ConnectionEvents
|
|
|
|
void Connection::receive()
|
|
|
|
{
|
2012-01-12 06:10:39 +01:00
|
|
|
u32 datasize = m_max_packet_size * 2; // Double it just to be safe
|
2011-10-20 22:04:09 +02:00
|
|
|
// TODO: We can not know how many layers of header there are.
|
|
|
|
// For now, just assume there are no other than the base headers.
|
|
|
|
u32 packet_maxsize = datasize + BASE_HEADER_SIZE;
|
2011-10-30 10:59:23 +01:00
|
|
|
SharedBuffer<u8> packetdata(packet_maxsize);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
bool single_wait_done = false;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
for(;;)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
try{
|
|
|
|
/* Check if some buffer has relevant data */
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
u16 peer_id;
|
|
|
|
SharedBuffer<u8> resultdata;
|
|
|
|
bool got = getFromBuffers(peer_id, resultdata);
|
|
|
|
if(got){
|
|
|
|
ConnectionEvent e;
|
|
|
|
e.dataReceived(peer_id, resultdata);
|
|
|
|
putEvent(e);
|
|
|
|
continue;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if(single_wait_done){
|
|
|
|
if(m_socket.WaitData(0) == false)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
single_wait_done = true;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Address sender;
|
|
|
|
s32 received_size = m_socket.Receive(sender, *packetdata, packet_maxsize);
|
|
|
|
|
|
|
|
if(received_size < 0)
|
|
|
|
break;
|
|
|
|
if(received_size < BASE_HEADER_SIZE)
|
|
|
|
continue;
|
|
|
|
if(readU32(&packetdata[0]) != m_protocol_id)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
u16 peer_id = readPeerId(*packetdata);
|
|
|
|
u8 channelnum = readChannel(*packetdata);
|
|
|
|
if(channelnum > CHANNEL_COUNT-1){
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"Receive(): Invalid channel "<<channelnum<<std::endl;
|
|
|
|
throw InvalidIncomingDataException("Channel doesn't exist");
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
if(peer_id == PEER_ID_INEXISTENT)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
/*
|
|
|
|
Somebody is trying to send stuff to us with no peer id.
|
|
|
|
|
|
|
|
Check if the same address and port was added to our peer
|
|
|
|
list before.
|
|
|
|
Allow only entries that have has_sent_with_id==false.
|
|
|
|
*/
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<u16, Peer*>::iterator j;
|
|
|
|
j = m_peers.begin();
|
|
|
|
for(; j != m_peers.end(); ++j)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
if(peer->has_sent_with_id)
|
|
|
|
continue;
|
|
|
|
if(peer->address == sender)
|
|
|
|
break;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
If no peer was found with the same address and port,
|
|
|
|
we shall assume it is a new peer and create an entry.
|
|
|
|
*/
|
2012-12-20 18:19:49 +01:00
|
|
|
if(j == m_peers.end())
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
|
|
|
// Pass on to adding the peer
|
|
|
|
}
|
|
|
|
// Else: A peer was found.
|
2010-11-27 00:02:21 +01:00
|
|
|
else
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
peer_id = peer->id;
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"WARNING: Assuming unknown peer to be "
|
|
|
|
<<"peer_id="<<peer_id<<std::endl;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2010-12-24 16:08:50 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
The peer was not found in our lists. Add it.
|
|
|
|
*/
|
|
|
|
if(peer_id == PEER_ID_INEXISTENT)
|
2010-12-24 16:08:50 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
// Somebody wants to make a new connection
|
|
|
|
|
|
|
|
// Get a unique peer id (2 or higher)
|
|
|
|
u16 peer_id_new = 2;
|
|
|
|
/*
|
|
|
|
Find an unused peer id
|
|
|
|
*/
|
|
|
|
bool out_of_ids = false;
|
|
|
|
for(;;)
|
2010-12-24 16:08:50 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
// Check if exists
|
2012-12-20 18:19:49 +01:00
|
|
|
if(m_peers.find(peer_id_new) == m_peers.end())
|
2011-10-20 22:04:09 +02:00
|
|
|
break;
|
|
|
|
// Check for overflow
|
|
|
|
if(peer_id_new == 65535){
|
|
|
|
out_of_ids = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
peer_id_new++;
|
|
|
|
}
|
|
|
|
if(out_of_ids){
|
|
|
|
errorstream<<getDesc()<<" ran out of peer ids"<<std::endl;
|
|
|
|
continue;
|
2010-12-24 16:08:50 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"Receive(): Got a packet with peer_id=PEER_ID_INEXISTENT,"
|
|
|
|
" giving peer_id="<<peer_id_new<<std::endl;
|
|
|
|
|
|
|
|
// Create a peer
|
|
|
|
Peer *peer = new Peer(peer_id_new, sender);
|
2012-12-20 18:19:49 +01:00
|
|
|
m_peers[peer->id] = peer;
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
// Create peer addition event
|
|
|
|
ConnectionEvent e;
|
|
|
|
e.peerAdded(peer_id_new, sender);
|
|
|
|
putEvent(e);
|
|
|
|
|
|
|
|
// Create CONTROL packet to tell the peer id to the new peer.
|
|
|
|
SharedBuffer<u8> reply(4);
|
|
|
|
writeU8(&reply[0], TYPE_CONTROL);
|
|
|
|
writeU8(&reply[1], CONTROLTYPE_SET_PEER_ID);
|
|
|
|
writeU16(&reply[2], peer_id_new);
|
|
|
|
sendAsPacket(peer_id_new, 0, reply, true);
|
|
|
|
|
|
|
|
// We're now talking to a valid peer_id
|
|
|
|
peer_id = peer_id_new;
|
|
|
|
|
|
|
|
// Go on and process whatever it sent
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<u16, Peer*>::iterator node = m_peers.find(peer_id);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
if(node == m_peers.end())
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
// Peer not found
|
|
|
|
// This means that the peer id of the sender is not PEER_ID_INEXISTENT
|
|
|
|
// and it is invalid.
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"Receive(): Peer not found"<<std::endl;
|
|
|
|
throw InvalidIncomingDataException("Peer not found (possible timeout)");
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = node->second;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Validate peer address
|
|
|
|
if(peer->address != sender)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"Peer "<<peer_id<<" sending from different address."
|
|
|
|
" Ignoring."<<std::endl;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
peer->timeout_counter = 0.0;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Channel *channel = &(peer->channels[channelnum]);
|
|
|
|
|
|
|
|
// Throw the received packet to channel->processPacket()
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Make a new SharedBuffer from the data without the base headers
|
|
|
|
SharedBuffer<u8> strippeddata(received_size - BASE_HEADER_SIZE);
|
|
|
|
memcpy(*strippeddata, &packetdata[BASE_HEADER_SIZE],
|
|
|
|
strippeddata.getSize());
|
|
|
|
|
|
|
|
try{
|
|
|
|
// Process it (the result is some data with no headers made by us)
|
|
|
|
SharedBuffer<u8> resultdata = processPacket
|
|
|
|
(channel, strippeddata, peer_id, channelnum, false);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"ProcessPacket returned data of size "
|
|
|
|
<<resultdata.getSize()<<std::endl;
|
|
|
|
|
|
|
|
ConnectionEvent e;
|
|
|
|
e.dataReceived(peer_id, resultdata);
|
|
|
|
putEvent(e);
|
|
|
|
continue;
|
|
|
|
}catch(ProcessedSilentlyException &e){
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
}catch(InvalidIncomingDataException &e){
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
catch(ProcessedSilentlyException &e){
|
|
|
|
}
|
|
|
|
} // for
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::runTimeouts(float dtime)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-11-27 08:38:21 +01:00
|
|
|
float congestion_control_aim_rtt
|
|
|
|
= g_settings->getFloat("congestion_control_aim_rtt");
|
|
|
|
float congestion_control_max_rate
|
|
|
|
= g_settings->getFloat("congestion_control_max_rate");
|
|
|
|
float congestion_control_min_rate
|
|
|
|
= g_settings->getFloat("congestion_control_min_rate");
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<u16> timeouted_peers;
|
|
|
|
for(std::map<u16, Peer*>::iterator j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2012-11-27 08:38:21 +01:00
|
|
|
|
|
|
|
// Update congestion control values
|
|
|
|
peer->congestion_control_aim_rtt = congestion_control_aim_rtt;
|
|
|
|
peer->congestion_control_max_rate = congestion_control_max_rate;
|
|
|
|
peer->congestion_control_min_rate = congestion_control_min_rate;
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
Check peer timeout
|
|
|
|
*/
|
|
|
|
peer->timeout_counter += dtime;
|
|
|
|
if(peer->timeout_counter > m_timeout)
|
|
|
|
{
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"RunTimeouts(): Peer "<<peer->id
|
|
|
|
<<" has timed out."
|
|
|
|
<<" (source=peer->timeout_counter)"
|
|
|
|
<<std::endl;
|
|
|
|
// Add peer to the list
|
|
|
|
timeouted_peers.push_back(peer->id);
|
|
|
|
// Don't bother going through the buffers of this one
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
float resend_timeout = peer->resend_timeout;
|
2010-11-27 00:02:21 +01:00
|
|
|
for(u16 i=0; i<CHANNEL_COUNT; i++)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<BufferedPacket> timed_outs;
|
2011-10-20 22:04:09 +02:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
Channel *channel = &peer->channels[i];
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Remove timed out incomplete unreliable split packets
|
|
|
|
channel->incoming_splits.removeUnreliableTimedOuts(dtime, m_timeout);
|
|
|
|
|
|
|
|
// Increment reliable packet times
|
|
|
|
channel->outgoing_reliables.incrementTimeouts(dtime);
|
|
|
|
|
|
|
|
// Check reliable packet total times, remove peer if
|
|
|
|
// over timeout.
|
|
|
|
if(channel->outgoing_reliables.anyTotaltimeReached(m_timeout))
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"RunTimeouts(): Peer "<<peer->id
|
|
|
|
<<" has timed out."
|
|
|
|
<<" (source=reliable packet totaltime)"
|
|
|
|
<<std::endl;
|
|
|
|
// Add peer to the to-be-removed list
|
|
|
|
timeouted_peers.push_back(peer->id);
|
|
|
|
goto nextpeer;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
// Re-send timed out outgoing reliables
|
|
|
|
|
|
|
|
timed_outs = channel->
|
|
|
|
outgoing_reliables.getTimedOuts(resend_timeout);
|
|
|
|
|
|
|
|
channel->outgoing_reliables.resetTimedOuts(resend_timeout);
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<BufferedPacket>::iterator j = timed_outs.begin();
|
|
|
|
j != timed_outs.end(); ++j)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
u16 peer_id = readPeerId(*(j->data));
|
|
|
|
u8 channel = readChannel(*(j->data));
|
|
|
|
u16 seqnum = readU16(&(j->data[BASE_HEADER_SIZE+1]));
|
|
|
|
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"RE-SENDING timed-out RELIABLE to ";
|
|
|
|
j->address.print(&derr_con);
|
|
|
|
derr_con<<"(t/o="<<resend_timeout<<"): "
|
|
|
|
<<"from_peer_id="<<peer_id
|
|
|
|
<<", channel="<<((int)channel&0xff)
|
|
|
|
<<", seqnum="<<seqnum
|
|
|
|
<<std::endl;
|
|
|
|
|
|
|
|
rawSend(*j);
|
|
|
|
|
|
|
|
// Enlarge avg_rtt and resend_timeout:
|
|
|
|
// The rtt will be at least the timeout.
|
|
|
|
// NOTE: This won't affect the timeout of the next
|
|
|
|
// checked channel because it was cached.
|
|
|
|
peer->reportRTT(resend_timeout);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
2011-10-20 22:04:09 +02:00
|
|
|
Send pings
|
2010-11-27 00:02:21 +01:00
|
|
|
*/
|
2011-10-20 22:04:09 +02:00
|
|
|
peer->ping_timer += dtime;
|
|
|
|
if(peer->ping_timer >= 5.0)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
// Create and send PING packet
|
|
|
|
SharedBuffer<u8> data(2);
|
|
|
|
writeU8(&data[0], TYPE_CONTROL);
|
|
|
|
writeU8(&data[1], CONTROLTYPE_PING);
|
|
|
|
rawSendAsPacket(peer->id, 0, data, true);
|
|
|
|
|
|
|
|
peer->ping_timer = 0.0;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
nextpeer:
|
|
|
|
continue;
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Remove timed out peers
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<u16>::iterator i = timeouted_peers.begin();
|
|
|
|
i != timeouted_peers.end(); ++i)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"RunTimeouts(): Removing peer "<<(*i)<<std::endl;
|
|
|
|
deletePeer(*i, true);
|
|
|
|
}
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::serve(u16 port)
|
|
|
|
{
|
|
|
|
dout_con<<getDesc()<<" serving at port "<<port<<std::endl;
|
2012-03-11 19:45:43 +01:00
|
|
|
try{
|
|
|
|
m_socket.Bind(port);
|
|
|
|
m_peer_id = PEER_ID_SERVER;
|
|
|
|
}
|
|
|
|
catch(SocketException &e){
|
|
|
|
// Create event
|
2012-03-18 18:08:13 +01:00
|
|
|
ConnectionEvent ce;
|
|
|
|
ce.bindFailed();
|
|
|
|
putEvent(ce);
|
2012-03-11 19:45:43 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::connect(Address address)
|
|
|
|
{
|
|
|
|
dout_con<<getDesc()<<" connecting to "<<address.serializeString()
|
|
|
|
<<":"<<address.getPort()<<std::endl;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<u16, Peer*>::iterator node = m_peers.find(PEER_ID_SERVER);
|
|
|
|
if(node != m_peers.end()){
|
2011-10-20 22:04:09 +02:00
|
|
|
throw ConnectionException("Already connected to a server");
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Peer *peer = new Peer(PEER_ID_SERVER, address);
|
2012-12-20 18:19:49 +01:00
|
|
|
m_peers[peer->id] = peer;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Create event
|
|
|
|
ConnectionEvent e;
|
|
|
|
e.peerAdded(peer->id, peer->address);
|
|
|
|
putEvent(e);
|
|
|
|
|
|
|
|
m_socket.Bind(0);
|
|
|
|
|
|
|
|
// Send a dummy packet to server with peer_id = PEER_ID_INEXISTENT
|
|
|
|
m_peer_id = PEER_ID_INEXISTENT;
|
|
|
|
SharedBuffer<u8> data(0);
|
|
|
|
Send(PEER_ID_SERVER, 0, data, true);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::disconnect()
|
|
|
|
{
|
|
|
|
dout_con<<getDesc()<<" disconnecting"<<std::endl;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Create and send DISCO packet
|
|
|
|
SharedBuffer<u8> data(2);
|
|
|
|
writeU8(&data[0], TYPE_CONTROL);
|
|
|
|
writeU8(&data[1], CONTROLTYPE_DISCO);
|
|
|
|
|
|
|
|
// Send to all
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, Peer*>::iterator j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
rawSendAsPacket(peer->id, 0, data, false);
|
|
|
|
}
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::sendToAll(u8 channelnum, SharedBuffer<u8> data, bool reliable)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, Peer*>::iterator j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
send(peer->id, channelnum, data, reliable);
|
|
|
|
}
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::send(u16 peer_id, u8 channelnum,
|
|
|
|
SharedBuffer<u8> data, bool reliable)
|
|
|
|
{
|
|
|
|
dout_con<<getDesc()<<" sending to peer_id="<<peer_id<<std::endl;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
assert(channelnum < CHANNEL_COUNT);
|
|
|
|
|
|
|
|
Peer *peer = getPeerNoEx(peer_id);
|
|
|
|
if(peer == NULL)
|
|
|
|
return;
|
|
|
|
Channel *channel = &(peer->channels[channelnum]);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
u32 chunksize_max = m_max_packet_size - BASE_HEADER_SIZE;
|
|
|
|
if(reliable)
|
|
|
|
chunksize_max -= RELIABLE_HEADER_SIZE;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<SharedBuffer<u8> > originals;
|
2011-10-20 22:04:09 +02:00
|
|
|
originals = makeAutoSplitPacket(data, chunksize_max,
|
|
|
|
channel->next_outgoing_split_seqnum);
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::list<SharedBuffer<u8> >::iterator i = originals.begin();
|
|
|
|
i != originals.end(); ++i)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
|
|
|
SharedBuffer<u8> original = *i;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
sendAsPacket(peer_id, channelnum, original, reliable);
|
|
|
|
}
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::sendAsPacket(u16 peer_id, u8 channelnum,
|
|
|
|
SharedBuffer<u8> data, bool reliable)
|
|
|
|
{
|
|
|
|
OutgoingPacket packet(peer_id, channelnum, data, reliable);
|
|
|
|
m_outgoing_queue.push_back(packet);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Connection::rawSendAsPacket(u16 peer_id, u8 channelnum,
|
|
|
|
SharedBuffer<u8> data, bool reliable)
|
|
|
|
{
|
|
|
|
Peer *peer = getPeerNoEx(peer_id);
|
|
|
|
if(!peer)
|
|
|
|
return;
|
|
|
|
Channel *channel = &(peer->channels[channelnum]);
|
|
|
|
|
|
|
|
if(reliable)
|
|
|
|
{
|
|
|
|
u16 seqnum = channel->next_outgoing_seqnum;
|
|
|
|
channel->next_outgoing_seqnum++;
|
|
|
|
|
|
|
|
SharedBuffer<u8> reliable = makeReliablePacket(data, seqnum);
|
|
|
|
|
|
|
|
// Add base headers and make a packet
|
|
|
|
BufferedPacket p = makePacket(peer->address, reliable,
|
|
|
|
m_protocol_id, m_peer_id, channelnum);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
try{
|
2011-10-20 22:04:09 +02:00
|
|
|
// Buffer the packet
|
|
|
|
channel->outgoing_reliables.insert(p);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
catch(AlreadyExistsException &e)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"WARNING: Going to send a reliable packet "
|
|
|
|
"seqnum="<<seqnum<<" that is already "
|
|
|
|
"in outgoing buffer"<<std::endl;
|
|
|
|
//assert(0);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
// Send the packet
|
|
|
|
rawSend(p);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
else
|
2011-10-17 17:02:26 +02:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
// Add base headers and make a packet
|
|
|
|
BufferedPacket p = makePacket(peer->address, data,
|
|
|
|
m_protocol_id, m_peer_id, channelnum);
|
|
|
|
|
|
|
|
// Send the packet
|
|
|
|
rawSend(p);
|
2011-10-17 17:02:26 +02:00
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::rawSend(const BufferedPacket &packet)
|
|
|
|
{
|
|
|
|
try{
|
|
|
|
m_socket.Send(packet.address, *packet.data, packet.data.getSize());
|
|
|
|
} catch(SendFailedException &e){
|
|
|
|
derr_con<<"Connection::rawSend(): SendFailedException: "
|
|
|
|
<<packet.address.serializeString()<<std::endl;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Peer* Connection::getPeer(u16 peer_id)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<u16, Peer*>::iterator node = m_peers.find(peer_id);
|
2011-10-20 22:04:09 +02:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
if(node == m_peers.end()){
|
2011-10-20 22:04:09 +02:00
|
|
|
throw PeerNotFoundException("GetPeer: Peer not found (possible timeout)");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Error checking
|
2012-12-20 18:19:49 +01:00
|
|
|
assert(node->second->id == peer_id);
|
2011-10-20 22:04:09 +02:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
return node->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Peer* Connection::getPeerNoEx(u16 peer_id)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<u16, Peer*>::iterator node = m_peers.find(peer_id);
|
2011-10-20 22:04:09 +02:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
if(node == m_peers.end()){
|
2011-10-20 22:04:09 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Error checking
|
2012-12-20 18:19:49 +01:00
|
|
|
assert(node->second->id == peer_id);
|
2011-10-20 22:04:09 +02:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
return node->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
}
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<Peer*> Connection::getPeers()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
std::list<Peer*> list;
|
|
|
|
for(std::map<u16, Peer*>::iterator j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
list.push_back(peer);
|
|
|
|
}
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Connection::getFromBuffers(u16 &peer_id, SharedBuffer<u8> &dst)
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
for(std::map<u16, Peer*>::iterator j = m_peers.begin();
|
|
|
|
j != m_peers.end(); ++j)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
Peer *peer = j->second;
|
2011-10-20 22:04:09 +02:00
|
|
|
for(u16 i=0; i<CHANNEL_COUNT; i++)
|
|
|
|
{
|
|
|
|
Channel *channel = &peer->channels[i];
|
|
|
|
SharedBuffer<u8> resultdata;
|
|
|
|
bool got = checkIncomingBuffers(channel, peer_id, resultdata);
|
|
|
|
if(got){
|
|
|
|
dst = resultdata;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Connection::checkIncomingBuffers(Channel *channel, u16 &peer_id,
|
|
|
|
SharedBuffer<u8> &dst)
|
|
|
|
{
|
|
|
|
u16 firstseqnum = 0;
|
|
|
|
// Clear old packets from start of buffer
|
|
|
|
try{
|
|
|
|
for(;;){
|
|
|
|
firstseqnum = channel->incoming_reliables.getFirstSeqnum();
|
|
|
|
if(seqnum_higher(channel->next_incoming_seqnum, firstseqnum))
|
|
|
|
channel->incoming_reliables.popFirst();
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// This happens if all packets are old
|
|
|
|
}catch(con::NotFoundException)
|
|
|
|
{}
|
|
|
|
|
|
|
|
if(channel->incoming_reliables.empty() == false)
|
|
|
|
{
|
|
|
|
if(firstseqnum == channel->next_incoming_seqnum)
|
|
|
|
{
|
|
|
|
BufferedPacket p = channel->incoming_reliables.popFirst();
|
|
|
|
|
|
|
|
peer_id = readPeerId(*p.data);
|
|
|
|
u8 channelnum = readChannel(*p.data);
|
|
|
|
u16 seqnum = readU16(&p.data[BASE_HEADER_SIZE+1]);
|
|
|
|
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"UNBUFFERING TYPE_RELIABLE"
|
|
|
|
<<" seqnum="<<seqnum
|
|
|
|
<<" peer_id="<<peer_id
|
|
|
|
<<" channel="<<((int)channelnum&0xff)
|
|
|
|
<<std::endl;
|
|
|
|
|
|
|
|
channel->next_incoming_seqnum++;
|
|
|
|
|
|
|
|
u32 headers_size = BASE_HEADER_SIZE + RELIABLE_HEADER_SIZE;
|
|
|
|
// Get out the inside packet and re-process it
|
|
|
|
SharedBuffer<u8> payload(p.data.getSize() - headers_size);
|
|
|
|
memcpy(*payload, &p.data[headers_size], payload.getSize());
|
|
|
|
|
|
|
|
dst = processPacket(channel, payload, peer_id, channelnum, true);
|
|
|
|
return true;
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
return false;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
SharedBuffer<u8> Connection::processPacket(Channel *channel,
|
|
|
|
SharedBuffer<u8> packetdata, u16 peer_id,
|
|
|
|
u8 channelnum, bool reliable)
|
|
|
|
{
|
|
|
|
IndentationRaiser iraiser(&(m_indentation));
|
|
|
|
|
|
|
|
if(packetdata.getSize() < 1)
|
|
|
|
throw InvalidIncomingDataException("packetdata.getSize() < 1");
|
|
|
|
|
|
|
|
u8 type = readU8(&packetdata[0]);
|
|
|
|
|
|
|
|
if(type == TYPE_CONTROL)
|
|
|
|
{
|
|
|
|
if(packetdata.getSize() < 2)
|
|
|
|
throw InvalidIncomingDataException("packetdata.getSize() < 2");
|
|
|
|
|
|
|
|
u8 controltype = readU8(&packetdata[1]);
|
|
|
|
|
|
|
|
if(controltype == CONTROLTYPE_ACK)
|
|
|
|
{
|
|
|
|
if(packetdata.getSize() < 4)
|
|
|
|
throw InvalidIncomingDataException
|
|
|
|
("packetdata.getSize() < 4 (ACK header size)");
|
|
|
|
|
|
|
|
u16 seqnum = readU16(&packetdata[2]);
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"Got CONTROLTYPE_ACK: channelnum="
|
|
|
|
<<((int)channelnum&0xff)<<", peer_id="<<peer_id
|
|
|
|
<<", seqnum="<<seqnum<<std::endl;
|
|
|
|
|
|
|
|
try{
|
|
|
|
BufferedPacket p = channel->outgoing_reliables.popSeqnum(seqnum);
|
|
|
|
// Get round trip time
|
|
|
|
float rtt = p.totaltime;
|
|
|
|
|
|
|
|
// Let peer calculate stuff according to it
|
|
|
|
// (avg_rtt and resend_timeout)
|
|
|
|
Peer *peer = getPeer(peer_id);
|
|
|
|
peer->reportRTT(rtt);
|
|
|
|
|
|
|
|
//PrintInfo(dout_con);
|
|
|
|
//dout_con<<"RTT = "<<rtt<<std::endl;
|
|
|
|
|
|
|
|
/*dout_con<<"OUTGOING: ";
|
|
|
|
PrintInfo();
|
|
|
|
channel->outgoing_reliables.print();
|
|
|
|
dout_con<<std::endl;*/
|
|
|
|
}
|
|
|
|
catch(NotFoundException &e){
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"WARNING: ACKed packet not "
|
|
|
|
"in outgoing queue"
|
|
|
|
<<std::endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
throw ProcessedSilentlyException("Got an ACK");
|
|
|
|
}
|
|
|
|
else if(controltype == CONTROLTYPE_SET_PEER_ID)
|
|
|
|
{
|
|
|
|
if(packetdata.getSize() < 4)
|
|
|
|
throw InvalidIncomingDataException
|
|
|
|
("packetdata.getSize() < 4 (SET_PEER_ID header size)");
|
|
|
|
u16 peer_id_new = readU16(&packetdata[2]);
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"Got new peer id: "<<peer_id_new<<"... "<<std::endl;
|
|
|
|
|
|
|
|
if(GetPeerID() != PEER_ID_INEXISTENT)
|
|
|
|
{
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"WARNING: Not changing"
|
|
|
|
" existing peer id."<<std::endl;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
dout_con<<"changing."<<std::endl;
|
|
|
|
SetPeerID(peer_id_new);
|
|
|
|
}
|
|
|
|
throw ProcessedSilentlyException("Got a SET_PEER_ID");
|
|
|
|
}
|
|
|
|
else if(controltype == CONTROLTYPE_PING)
|
|
|
|
{
|
|
|
|
// Just ignore it, the incoming data already reset
|
|
|
|
// the timeout counter
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"PING"<<std::endl;
|
|
|
|
throw ProcessedSilentlyException("Got a PING");
|
|
|
|
}
|
|
|
|
else if(controltype == CONTROLTYPE_DISCO)
|
|
|
|
{
|
|
|
|
// Just ignore it, the incoming data already reset
|
|
|
|
// the timeout counter
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"DISCO: Removing peer "<<(peer_id)<<std::endl;
|
|
|
|
|
|
|
|
if(deletePeer(peer_id, false) == false)
|
|
|
|
{
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"DISCO: Peer not found"<<std::endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
throw ProcessedSilentlyException("Got a DISCO");
|
|
|
|
}
|
|
|
|
else{
|
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"INVALID TYPE_CONTROL: invalid controltype="
|
|
|
|
<<((int)controltype&0xff)<<std::endl;
|
|
|
|
throw InvalidIncomingDataException("Invalid control type");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(type == TYPE_ORIGINAL)
|
|
|
|
{
|
|
|
|
if(packetdata.getSize() < ORIGINAL_HEADER_SIZE)
|
|
|
|
throw InvalidIncomingDataException
|
|
|
|
("packetdata.getSize() < ORIGINAL_HEADER_SIZE");
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"RETURNING TYPE_ORIGINAL to user"
|
|
|
|
<<std::endl;
|
|
|
|
// Get the inside packet out and return it
|
|
|
|
SharedBuffer<u8> payload(packetdata.getSize() - ORIGINAL_HEADER_SIZE);
|
|
|
|
memcpy(*payload, &packetdata[ORIGINAL_HEADER_SIZE], payload.getSize());
|
|
|
|
return payload;
|
|
|
|
}
|
|
|
|
else if(type == TYPE_SPLIT)
|
|
|
|
{
|
|
|
|
// We have to create a packet again for buffering
|
|
|
|
// This isn't actually too bad an idea.
|
|
|
|
BufferedPacket packet = makePacket(
|
|
|
|
getPeer(peer_id)->address,
|
|
|
|
packetdata,
|
|
|
|
GetProtocolID(),
|
|
|
|
peer_id,
|
|
|
|
channelnum);
|
|
|
|
// Buffer the packet
|
|
|
|
SharedBuffer<u8> data = channel->incoming_splits.insert(packet, reliable);
|
|
|
|
if(data.getSize() != 0)
|
|
|
|
{
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"RETURNING TYPE_SPLIT: Constructed full data, "
|
|
|
|
<<"size="<<data.getSize()<<std::endl;
|
|
|
|
return data;
|
|
|
|
}
|
|
|
|
PrintInfo();
|
|
|
|
dout_con<<"BUFFERED TYPE_SPLIT"<<std::endl;
|
|
|
|
throw ProcessedSilentlyException("Buffered a split packet chunk");
|
|
|
|
}
|
|
|
|
else if(type == TYPE_RELIABLE)
|
|
|
|
{
|
|
|
|
// Recursive reliable packets not allowed
|
|
|
|
assert(reliable == false);
|
|
|
|
|
|
|
|
if(packetdata.getSize() < RELIABLE_HEADER_SIZE)
|
|
|
|
throw InvalidIncomingDataException
|
|
|
|
("packetdata.getSize() < RELIABLE_HEADER_SIZE");
|
|
|
|
|
|
|
|
u16 seqnum = readU16(&packetdata[1]);
|
|
|
|
|
|
|
|
bool is_future_packet = seqnum_higher(seqnum, channel->next_incoming_seqnum);
|
|
|
|
bool is_old_packet = seqnum_higher(channel->next_incoming_seqnum, seqnum);
|
|
|
|
|
|
|
|
PrintInfo();
|
|
|
|
if(is_future_packet)
|
|
|
|
dout_con<<"BUFFERING";
|
|
|
|
else if(is_old_packet)
|
|
|
|
dout_con<<"OLD";
|
|
|
|
else
|
|
|
|
dout_con<<"RECUR";
|
|
|
|
dout_con<<" TYPE_RELIABLE seqnum="<<seqnum
|
|
|
|
<<" next="<<channel->next_incoming_seqnum;
|
|
|
|
dout_con<<" [sending CONTROLTYPE_ACK"
|
|
|
|
" to peer_id="<<peer_id<<"]";
|
|
|
|
dout_con<<std::endl;
|
|
|
|
|
|
|
|
//DEBUG
|
|
|
|
//assert(channel->incoming_reliables.size() < 100);
|
|
|
|
|
|
|
|
// Send a CONTROLTYPE_ACK
|
|
|
|
SharedBuffer<u8> reply(4);
|
|
|
|
writeU8(&reply[0], TYPE_CONTROL);
|
|
|
|
writeU8(&reply[1], CONTROLTYPE_ACK);
|
|
|
|
writeU16(&reply[2], seqnum);
|
|
|
|
rawSendAsPacket(peer_id, channelnum, reply, false);
|
|
|
|
|
|
|
|
//if(seqnum_higher(seqnum, channel->next_incoming_seqnum))
|
|
|
|
if(is_future_packet)
|
|
|
|
{
|
|
|
|
/*PrintInfo();
|
|
|
|
dout_con<<"Buffering reliable packet (seqnum="
|
|
|
|
<<seqnum<<")"<<std::endl;*/
|
|
|
|
|
|
|
|
// This one comes later, buffer it.
|
|
|
|
// Actually we have to make a packet to buffer one.
|
|
|
|
// Well, we have all the ingredients, so just do it.
|
|
|
|
BufferedPacket packet = makePacket(
|
|
|
|
getPeer(peer_id)->address,
|
|
|
|
packetdata,
|
|
|
|
GetProtocolID(),
|
|
|
|
peer_id,
|
|
|
|
channelnum);
|
|
|
|
try{
|
|
|
|
channel->incoming_reliables.insert(packet);
|
|
|
|
|
|
|
|
/*PrintInfo();
|
|
|
|
dout_con<<"INCOMING: ";
|
|
|
|
channel->incoming_reliables.print();
|
|
|
|
dout_con<<std::endl;*/
|
|
|
|
}
|
|
|
|
catch(AlreadyExistsException &e)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
throw ProcessedSilentlyException("Buffered future reliable packet");
|
|
|
|
}
|
|
|
|
//else if(seqnum_higher(channel->next_incoming_seqnum, seqnum))
|
|
|
|
else if(is_old_packet)
|
|
|
|
{
|
|
|
|
// An old packet, dump it
|
|
|
|
throw InvalidIncomingDataException("Got an old reliable packet");
|
|
|
|
}
|
|
|
|
|
|
|
|
channel->next_incoming_seqnum++;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Get out the inside packet and re-process it
|
|
|
|
SharedBuffer<u8> payload(packetdata.getSize() - RELIABLE_HEADER_SIZE);
|
|
|
|
memcpy(*payload, &packetdata[RELIABLE_HEADER_SIZE], payload.getSize());
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
return processPacket(channel, payload, peer_id, channelnum, true);
|
|
|
|
}
|
|
|
|
else
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
PrintInfo(derr_con);
|
|
|
|
derr_con<<"Got invalid type="<<((int)type&0xff)<<std::endl;
|
|
|
|
throw InvalidIncomingDataException("Invalid packet type");
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
|
|
|
|
// We should never get here.
|
|
|
|
// If you get here, add an exception or a return to some of the
|
|
|
|
// above conditionals.
|
|
|
|
assert(0);
|
|
|
|
throw BaseException("Error in Channel::ProcessPacket()");
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
bool Connection::deletePeer(u16 peer_id, bool timeout)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
if(m_peers.find(peer_id) == m_peers.end())
|
2011-10-20 22:04:09 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
Peer *peer = m_peers[peer_id];
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
// Create event
|
|
|
|
ConnectionEvent e;
|
|
|
|
e.peerRemoved(peer_id, timeout, peer->address);
|
|
|
|
putEvent(e);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
delete m_peers[peer_id];
|
2012-12-20 18:19:49 +01:00
|
|
|
m_peers.erase(peer_id);
|
2011-10-20 22:04:09 +02:00
|
|
|
return true;
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
/* Interface */
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionEvent Connection::getEvent()
|
|
|
|
{
|
2012-12-20 18:19:49 +01:00
|
|
|
if(m_event_queue.empty()){
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionEvent e;
|
|
|
|
e.type = CONNEVENT_NONE;
|
|
|
|
return e;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
return m_event_queue.pop_front();
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionEvent Connection::waitEvent(u32 timeout_ms)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-18 02:42:23 +02:00
|
|
|
try{
|
2011-10-20 22:04:09 +02:00
|
|
|
return m_event_queue.pop_front(timeout_ms);
|
2011-10-21 17:37:43 +02:00
|
|
|
} catch(ItemNotFoundException &ex){
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionEvent e;
|
|
|
|
e.type = CONNEVENT_NONE;
|
|
|
|
return e;
|
2011-10-18 02:42:23 +02:00
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::putCommand(ConnectionCommand &c)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
m_command_queue.push_back(c);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::Serve(unsigned short port)
|
|
|
|
{
|
|
|
|
ConnectionCommand c;
|
|
|
|
c.serve(port);
|
|
|
|
putCommand(c);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::Connect(Address address)
|
|
|
|
{
|
|
|
|
ConnectionCommand c;
|
|
|
|
c.connect(address);
|
|
|
|
putCommand(c);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
bool Connection::Connected()
|
|
|
|
{
|
|
|
|
JMutexAutoLock peerlock(m_peers_mutex);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
if(m_peers.size() != 1)
|
|
|
|
return false;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<u16, Peer*>::iterator node = m_peers.find(PEER_ID_SERVER);
|
|
|
|
if(node == m_peers.end())
|
2011-10-20 22:04:09 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
if(m_peer_id == PEER_ID_INEXISTENT)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::Disconnect()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionCommand c;
|
|
|
|
c.disconnect();
|
|
|
|
putCommand(c);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-11-07 04:20:33 +01:00
|
|
|
u32 Connection::Receive(u16 &peer_id, SharedBuffer<u8> &data)
|
2011-10-20 22:04:09 +02:00
|
|
|
{
|
|
|
|
for(;;){
|
|
|
|
ConnectionEvent e = waitEvent(m_bc_receive_timeout);
|
|
|
|
if(e.type != CONNEVENT_NONE)
|
|
|
|
dout_con<<getDesc()<<": Receive: got event: "
|
|
|
|
<<e.describe()<<std::endl;
|
|
|
|
switch(e.type){
|
|
|
|
case CONNEVENT_NONE:
|
|
|
|
throw NoIncomingDataException("No incoming data");
|
|
|
|
case CONNEVENT_DATA_RECEIVED:
|
|
|
|
peer_id = e.peer_id;
|
2011-11-07 04:20:33 +01:00
|
|
|
data = SharedBuffer<u8>(e.data);
|
2011-10-20 22:04:09 +02:00
|
|
|
return e.data.getSize();
|
|
|
|
case CONNEVENT_PEER_ADDED: {
|
|
|
|
Peer tmp(e.peer_id, e.address);
|
|
|
|
if(m_bc_peerhandler)
|
|
|
|
m_bc_peerhandler->peerAdded(&tmp);
|
|
|
|
continue; }
|
|
|
|
case CONNEVENT_PEER_REMOVED: {
|
|
|
|
Peer tmp(e.peer_id, e.address);
|
|
|
|
if(m_bc_peerhandler)
|
|
|
|
m_bc_peerhandler->deletingPeer(&tmp, e.timeout);
|
|
|
|
continue; }
|
2012-03-11 19:45:43 +01:00
|
|
|
case CONNEVENT_BIND_FAILED:
|
|
|
|
throw ConnectionBindFailed("Failed to bind socket "
|
|
|
|
"(port already in use?)");
|
2011-10-20 22:04:09 +02:00
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-10-20 22:04:09 +02:00
|
|
|
throw NoIncomingDataException("No incoming data");
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::SendToAll(u8 channelnum, SharedBuffer<u8> data, bool reliable)
|
|
|
|
{
|
|
|
|
assert(channelnum < CHANNEL_COUNT);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionCommand c;
|
|
|
|
c.sendToAll(channelnum, data, reliable);
|
|
|
|
putCommand(c);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::Send(u16 peer_id, u8 channelnum,
|
|
|
|
SharedBuffer<u8> data, bool reliable)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
assert(channelnum < CHANNEL_COUNT);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionCommand c;
|
|
|
|
c.send(peer_id, channelnum, data, reliable);
|
|
|
|
putCommand(c);
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::RunTimeouts(float dtime)
|
|
|
|
{
|
|
|
|
// No-op
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
Address Connection::GetPeerAddress(u16 peer_id)
|
|
|
|
{
|
|
|
|
JMutexAutoLock peerlock(m_peers_mutex);
|
|
|
|
return getPeer(peer_id)->address;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
float Connection::GetPeerAvgRTT(u16 peer_id)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
JMutexAutoLock peerlock(m_peers_mutex);
|
|
|
|
return getPeer(peer_id)->avg_rtt;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
void Connection::DeletePeer(u16 peer_id)
|
2010-12-24 16:08:50 +01:00
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
ConnectionCommand c;
|
|
|
|
c.deletePeer(peer_id);
|
|
|
|
putCommand(c);
|
2010-12-24 16:08:50 +01:00
|
|
|
}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
void Connection::PrintInfo(std::ostream &out)
|
|
|
|
{
|
2011-10-20 22:04:09 +02:00
|
|
|
out<<getDesc()<<": ";
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void Connection::PrintInfo()
|
|
|
|
{
|
|
|
|
PrintInfo(dout_con);
|
|
|
|
}
|
|
|
|
|
2011-10-20 22:04:09 +02:00
|
|
|
std::string Connection::getDesc()
|
|
|
|
{
|
|
|
|
return std::string("con(")+itos(m_socket.GetHandle())+"/"+itos(m_peer_id)+")";
|
|
|
|
}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
} // namespace
|
|
|
|
|