2012-06-14 09:06:06 -04:00
|
|
|
|
|
|
|
// ChunkSender.cpp
|
|
|
|
|
|
|
|
// Interfaces to the cChunkSender class representing the thread that waits for chunks becoming ready (loaded / generated) and sends them to clients
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "Globals.h"
|
|
|
|
#include "ChunkSender.h"
|
2012-09-23 18:09:57 -04:00
|
|
|
#include "World.h"
|
2013-05-28 16:36:35 -04:00
|
|
|
#include "BlockEntities/BlockEntity.h"
|
2012-09-23 17:37:46 -04:00
|
|
|
#include "Protocol/ChunkDataSerializer.h"
|
2014-09-26 13:13:19 -04:00
|
|
|
#include "ClientHandle.h"
|
2015-05-30 12:22:03 -04:00
|
|
|
#include "Chunk.h"
|
2012-06-14 09:06:06 -04:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-05-31 10:28:38 -04:00
|
|
|
|
2014-07-17 16:15:34 -04:00
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
2012-06-14 09:06:06 -04:00
|
|
|
// cNotifyChunkSender:
|
|
|
|
|
2015-05-30 06:11:17 -04:00
|
|
|
|
|
|
|
/// Callback that can be used to notify chunk sender upon another chunkcoord notification
|
|
|
|
class cNotifyChunkSender :
|
|
|
|
public cChunkCoordCallback
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-30 06:11:17 -04:00
|
|
|
virtual void Call(int a_ChunkX, int a_ChunkZ) override
|
|
|
|
{
|
2015-05-30 12:22:03 -04:00
|
|
|
cChunkSender & ChunkSender = m_ChunkSender;
|
|
|
|
m_World.DoWithChunk(
|
2015-05-31 13:51:31 -04:00
|
|
|
a_ChunkX, a_ChunkZ,
|
2015-05-30 12:22:03 -04:00
|
|
|
[&ChunkSender] (cChunk & a_Chunk) -> bool
|
|
|
|
{
|
|
|
|
ChunkSender.QueueSendChunkTo(a_Chunk.GetPosX(), a_Chunk.GetPosZ(), cChunkSender::PRIORITY_BROADCAST, a_Chunk.GetAllClients());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
);
|
2015-05-30 06:11:17 -04:00
|
|
|
}
|
|
|
|
|
2015-05-30 12:22:03 -04:00
|
|
|
cChunkSender & m_ChunkSender;
|
2012-06-14 09:06:06 -04:00
|
|
|
|
2015-05-30 12:22:03 -04:00
|
|
|
cWorld & m_World;
|
|
|
|
public:
|
|
|
|
cNotifyChunkSender(cChunkSender & a_ChunkSender, cWorld & a_World) : m_ChunkSender(a_ChunkSender), m_World(a_World) {}
|
2012-06-14 09:06:06 -04:00
|
|
|
|
|
|
|
|
2015-05-30 12:22:03 -04:00
|
|
|
};
|
2012-06-14 09:06:06 -04:00
|
|
|
|
2015-05-30 12:22:03 -04:00
|
|
|
cChunkSender::cChunkSender(cWorld & a_World) :
|
2012-06-14 09:06:06 -04:00
|
|
|
super("ChunkSender"),
|
2015-05-30 12:22:03 -04:00
|
|
|
m_World(a_World),
|
2015-05-30 06:11:17 -04:00
|
|
|
m_RemoveCount(0)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
cChunkSender::~cChunkSender()
|
|
|
|
{
|
|
|
|
Stop();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-05-30 12:22:03 -04:00
|
|
|
bool cChunkSender::Start()
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2012-10-25 15:20:29 -04:00
|
|
|
m_ShouldTerminate = false;
|
2012-06-14 09:06:06 -04:00
|
|
|
return super::Start();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void cChunkSender::Stop(void)
|
|
|
|
{
|
|
|
|
m_ShouldTerminate = true;
|
|
|
|
m_evtQueue.Set();
|
|
|
|
Wait();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2014-10-06 15:27:53 -04:00
|
|
|
void cChunkSender::QueueSendChunkTo(int a_ChunkX, int a_ChunkZ, eChunkPriority a_Priority, cClientHandle * a_Client)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2014-10-20 16:55:07 -04:00
|
|
|
ASSERT(a_Client != nullptr);
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
cChunkCoords Chunk{a_ChunkX, a_ChunkZ};
|
2012-06-14 09:06:06 -04:00
|
|
|
cCSLock Lock(m_CS);
|
2015-05-31 10:28:38 -04:00
|
|
|
auto iter = m_ChunkInfo.find(Chunk);
|
|
|
|
if (iter != m_ChunkInfo.end())
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
auto & info = iter->second;
|
|
|
|
if (info.m_Priority > a_Priority)
|
2014-10-23 15:19:43 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
m_SendChunks.push(sChunkQueue{a_Priority, Chunk});
|
|
|
|
info.m_Priority = a_Priority;
|
2015-05-30 12:22:03 -04:00
|
|
|
}
|
2015-05-31 10:28:38 -04:00
|
|
|
info.m_Clients.insert(a_Client);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_SendChunks.push(sChunkQueue{a_Priority, Chunk});
|
|
|
|
auto info = sSendChunk{Chunk, a_Priority};
|
|
|
|
info.m_Clients.insert(a_Client);
|
|
|
|
m_ChunkInfo.emplace(Chunk, info);
|
2015-05-30 12:22:03 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
m_evtQueue.Set();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void cChunkSender::QueueSendChunkTo(int a_ChunkX, int a_ChunkZ, eChunkPriority a_Priority, std::list<cClientHandle *> a_Clients)
|
|
|
|
{
|
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
cChunkCoords Chunk{a_ChunkX, a_ChunkZ};
|
2015-05-30 12:22:03 -04:00
|
|
|
cCSLock Lock(m_CS);
|
2015-05-31 10:28:38 -04:00
|
|
|
auto iter = m_ChunkInfo.find(Chunk);
|
|
|
|
if (iter != m_ChunkInfo.end())
|
2015-05-30 12:22:03 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
auto & info = iter->second;
|
|
|
|
if (info.m_Priority > a_Priority)
|
2015-05-30 12:22:03 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
m_SendChunks.push(sChunkQueue{a_Priority, Chunk});
|
|
|
|
info.m_Priority = a_Priority;
|
2015-05-30 12:22:03 -04:00
|
|
|
}
|
2015-05-31 10:28:38 -04:00
|
|
|
info.m_Clients.insert(a_Clients.begin(), a_Clients.end());
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_SendChunks.push(sChunkQueue{a_Priority, Chunk});
|
|
|
|
auto info = sSendChunk{Chunk, a_Priority};
|
|
|
|
info.m_Clients.insert(a_Clients.begin(), a_Clients.end());
|
|
|
|
m_ChunkInfo.emplace(Chunk, info);
|
2014-10-21 11:35:23 -04:00
|
|
|
}
|
2012-06-14 09:06:06 -04:00
|
|
|
}
|
|
|
|
m_evtQueue.Set();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void cChunkSender::RemoveClient(cClientHandle * a_Client)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
cCSLock Lock(m_CS);
|
2015-05-31 10:28:38 -04:00
|
|
|
for (auto && pair : m_ChunkInfo)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
auto && clients = pair.second.m_Clients;
|
2015-05-31 13:51:31 -04:00
|
|
|
clients.erase(a_Client); // nop for sets that do not contain a_Client
|
2015-05-31 10:28:38 -04:00
|
|
|
}
|
|
|
|
|
2012-06-14 09:06:06 -04:00
|
|
|
m_RemoveCount++;
|
|
|
|
}
|
|
|
|
m_evtQueue.Set();
|
|
|
|
m_evtRemoved.Wait(); // Wait for removal confirmation
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void cChunkSender::Execute(void)
|
|
|
|
{
|
|
|
|
while (!m_ShouldTerminate)
|
|
|
|
{
|
|
|
|
cCSLock Lock(m_CS);
|
2015-05-31 10:28:38 -04:00
|
|
|
do
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
int RemoveCount = m_RemoveCount;
|
|
|
|
m_RemoveCount = 0;
|
|
|
|
cCSUnlock Unlock(Lock);
|
|
|
|
for (int i = 0; i < RemoveCount; i++)
|
|
|
|
{
|
|
|
|
m_evtRemoved.Set(); // Notify that the removed clients are safe to be deleted
|
|
|
|
}
|
|
|
|
m_evtQueue.Wait();
|
|
|
|
if (m_ShouldTerminate)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2015-05-31 10:28:38 -04:00
|
|
|
} while (m_SendChunks.empty());
|
2015-05-30 12:22:03 -04:00
|
|
|
|
2015-05-31 10:28:38 -04:00
|
|
|
// Take one from the queue:
|
|
|
|
auto Chunk = m_SendChunks.top().m_Chunk;
|
|
|
|
m_SendChunks.pop();
|
|
|
|
auto itr = m_ChunkInfo.find(Chunk);
|
|
|
|
if (itr == m_ChunkInfo.end())
|
2014-10-23 15:19:43 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
continue;
|
2014-10-23 15:19:43 -04:00
|
|
|
}
|
2015-05-31 10:28:38 -04:00
|
|
|
|
|
|
|
std::unordered_set<cClientHandle *> clients;
|
|
|
|
std::swap(itr->second.m_Clients, clients);
|
|
|
|
m_ChunkInfo.erase(itr);
|
2014-10-06 15:27:53 -04:00
|
|
|
|
2012-06-14 09:06:06 -04:00
|
|
|
Lock.Unlock();
|
2015-05-31 10:28:38 -04:00
|
|
|
|
|
|
|
SendChunk(Chunk.m_ChunkX, Chunk.m_ChunkZ, clients);
|
2012-06-14 09:06:06 -04:00
|
|
|
} // while (!mShouldTerminate)
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-05-31 10:28:38 -04:00
|
|
|
void cChunkSender::SendChunk(int a_ChunkX, int a_ChunkZ, std::unordered_set<cClientHandle *> a_Clients)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
|
|
|
|
// Ask the client if it still wants the chunk:
|
2015-05-31 13:51:31 -04:00
|
|
|
for (auto itr = a_Clients.begin(); itr != a_Clients.end();)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-31 13:51:31 -04:00
|
|
|
if (!(*itr)->WantsSendChunk(a_ChunkX, a_ChunkZ))
|
2015-05-31 10:28:38 -04:00
|
|
|
{
|
2015-06-01 05:08:00 -04:00
|
|
|
itr = a_Clients.erase(itr);
|
2015-05-31 10:28:38 -04:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
itr++;
|
|
|
|
}
|
2012-06-14 09:06:06 -04:00
|
|
|
}
|
2014-10-02 17:50:41 -04:00
|
|
|
|
2012-06-14 09:06:06 -04:00
|
|
|
// If the chunk has no clients, no need to packetize it:
|
2015-05-30 12:22:03 -04:00
|
|
|
if (!m_World.HasChunkAnyClients(a_ChunkX, a_ChunkZ))
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2014-10-02 17:50:41 -04:00
|
|
|
|
2012-06-14 09:06:06 -04:00
|
|
|
// If the chunk is not valid, do nothing - whoever needs it has queued it for loading / generating
|
2015-05-30 12:22:03 -04:00
|
|
|
if (!m_World.IsChunkValid(a_ChunkX, a_ChunkZ))
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2014-10-02 17:50:41 -04:00
|
|
|
|
2012-06-14 09:06:06 -04:00
|
|
|
// If the chunk is not lighted, queue it for relighting and get notified when it's ready:
|
2015-05-30 12:22:03 -04:00
|
|
|
if (!m_World.IsChunkLighted(a_ChunkX, a_ChunkZ))
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-30 12:22:03 -04:00
|
|
|
m_World.QueueLightChunk(a_ChunkX, a_ChunkZ, cpp14::make_unique<cNotifyChunkSender>(*this, m_World));
|
2012-06-14 09:06:06 -04:00
|
|
|
return;
|
|
|
|
}
|
2014-10-02 17:50:41 -04:00
|
|
|
|
2012-08-26 17:01:07 -04:00
|
|
|
// Query and prepare chunk data:
|
2015-05-30 12:22:03 -04:00
|
|
|
if (!m_World.GetChunkData(a_ChunkX, a_ChunkZ, *this))
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
2012-08-26 17:01:07 -04:00
|
|
|
cChunkDataSerializer Data(m_BlockTypes, m_BlockMetas, m_BlockLight, m_BlockSkyLight, m_BiomeMap);
|
2014-10-02 17:50:41 -04:00
|
|
|
|
2015-05-31 10:28:38 -04:00
|
|
|
for (auto client : a_Clients)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
// Send:
|
|
|
|
client->SendChunkData(a_ChunkX, a_ChunkZ, Data);
|
|
|
|
|
|
|
|
// Send block-entity packets:
|
|
|
|
for (auto Pos : m_BlockEntities)
|
|
|
|
{
|
|
|
|
m_World.SendBlockEntity(Pos.x, Pos.y, Pos.z, *client);
|
|
|
|
} // for itr - m_Packets[]
|
|
|
|
|
|
|
|
}
|
2012-08-24 03:58:26 -04:00
|
|
|
m_BlockEntities.clear();
|
2014-10-02 17:50:41 -04:00
|
|
|
|
2012-08-24 03:58:26 -04:00
|
|
|
// TODO: Send entity spawn packets
|
2012-06-14 09:06:06 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void cChunkSender::BlockEntity(cBlockEntity * a_Entity)
|
|
|
|
{
|
2015-05-31 10:28:38 -04:00
|
|
|
m_BlockEntities.push_back(a_Entity->GetPos());
|
2012-06-14 09:06:06 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2013-12-21 10:00:31 -05:00
|
|
|
void cChunkSender::Entity(cEntity *)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
// Nothing needed yet, perhaps in the future when we save entities into chunks we'd like to send them upon load, too ;)
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void cChunkSender::BiomeData(const cChunkDef::BiomeMap * a_BiomeMap)
|
|
|
|
{
|
2013-12-20 10:01:34 -05:00
|
|
|
for (size_t i = 0; i < ARRAYCOUNT(m_BiomeMap); i++)
|
2012-06-14 09:06:06 -04:00
|
|
|
{
|
|
|
|
if ((*a_BiomeMap)[i] < 255)
|
|
|
|
{
|
|
|
|
// Normal MC biome, copy as-is:
|
2015-05-24 07:56:56 -04:00
|
|
|
m_BiomeMap[i] = static_cast<unsigned char>((*a_BiomeMap)[i]);
|
2012-06-14 09:06:06 -04:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// TODO: MCS-specific biome, need to map to some basic MC biome:
|
|
|
|
ASSERT(!"Unimplemented MCS-specific biome");
|
|
|
|
}
|
|
|
|
} // for i - m_BiomeMap[]
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|