2010-11-29 19:13:04 +01:00
|
|
|
/*
|
|
|
|
Minetest-c55
|
2011-04-30 01:12:32 +02:00
|
|
|
Copyright (C) 2010-2011 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
|
|
|
|
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 the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
#ifndef SERVER_HEADER
|
|
|
|
#define SERVER_HEADER
|
|
|
|
|
|
|
|
#include "connection.h"
|
|
|
|
#include "environment.h"
|
|
|
|
#include "common_irrlicht.h"
|
|
|
|
#include <string>
|
2010-12-19 15:51:45 +01:00
|
|
|
#include "utility.h"
|
2010-12-22 02:33:58 +01:00
|
|
|
#include "porting.h"
|
2011-02-23 01:49:57 +01:00
|
|
|
#include "map.h"
|
2011-04-04 14:13:19 +02:00
|
|
|
#include "inventory.h"
|
2011-05-29 20:11:16 +02:00
|
|
|
#include "auth.h"
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-04-21 18:35:17 +02:00
|
|
|
/*
|
|
|
|
Some random functions
|
|
|
|
*/
|
|
|
|
v3f findSpawnPos(ServerMap &map);
|
|
|
|
|
|
|
|
/*
|
|
|
|
A structure containing the data needed for queueing the fetching
|
|
|
|
of blocks.
|
|
|
|
*/
|
2010-11-27 00:02:21 +01:00
|
|
|
struct QueuedBlockEmerge
|
|
|
|
{
|
|
|
|
v3s16 pos;
|
|
|
|
// key = peer_id, value = flags
|
|
|
|
core::map<u16, u8> peer_ids;
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
This is a thread-safe class.
|
|
|
|
*/
|
|
|
|
class BlockEmergeQueue
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
BlockEmergeQueue()
|
|
|
|
{
|
|
|
|
m_mutex.Init();
|
|
|
|
}
|
|
|
|
|
|
|
|
~BlockEmergeQueue()
|
|
|
|
{
|
|
|
|
JMutexAutoLock lock(m_mutex);
|
|
|
|
|
|
|
|
core::list<QueuedBlockEmerge*>::Iterator i;
|
|
|
|
for(i=m_queue.begin(); i!=m_queue.end(); i++)
|
|
|
|
{
|
|
|
|
QueuedBlockEmerge *q = *i;
|
|
|
|
delete q;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
peer_id=0 adds with nobody to send to
|
|
|
|
*/
|
|
|
|
void addBlock(u16 peer_id, v3s16 pos, u8 flags)
|
|
|
|
{
|
2010-11-29 16:55:07 +01:00
|
|
|
DSTACK(__FUNCTION_NAME);
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
JMutexAutoLock lock(m_mutex);
|
|
|
|
|
|
|
|
if(peer_id != 0)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
Find if block is already in queue.
|
|
|
|
If it is, update the peer to it and quit.
|
|
|
|
*/
|
|
|
|
core::list<QueuedBlockEmerge*>::Iterator i;
|
|
|
|
for(i=m_queue.begin(); i!=m_queue.end(); i++)
|
|
|
|
{
|
|
|
|
QueuedBlockEmerge *q = *i;
|
|
|
|
if(q->pos == pos)
|
|
|
|
{
|
|
|
|
q->peer_ids[peer_id] = flags;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Add the block
|
|
|
|
*/
|
|
|
|
QueuedBlockEmerge *q = new QueuedBlockEmerge;
|
|
|
|
q->pos = pos;
|
|
|
|
if(peer_id != 0)
|
|
|
|
q->peer_ids[peer_id] = flags;
|
|
|
|
m_queue.push_back(q);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returned pointer must be deleted
|
|
|
|
// Returns NULL if queue is empty
|
|
|
|
QueuedBlockEmerge * pop()
|
|
|
|
{
|
|
|
|
JMutexAutoLock lock(m_mutex);
|
|
|
|
|
|
|
|
core::list<QueuedBlockEmerge*>::Iterator i = m_queue.begin();
|
|
|
|
if(i == m_queue.end())
|
|
|
|
return NULL;
|
|
|
|
QueuedBlockEmerge *q = *i;
|
|
|
|
m_queue.erase(i);
|
|
|
|
return q;
|
|
|
|
}
|
|
|
|
|
|
|
|
u32 size()
|
|
|
|
{
|
|
|
|
JMutexAutoLock lock(m_mutex);
|
|
|
|
return m_queue.size();
|
|
|
|
}
|
2010-11-29 09:52:07 +01:00
|
|
|
|
|
|
|
u32 peerItemCount(u16 peer_id)
|
|
|
|
{
|
|
|
|
JMutexAutoLock lock(m_mutex);
|
|
|
|
|
|
|
|
u32 count = 0;
|
|
|
|
|
|
|
|
core::list<QueuedBlockEmerge*>::Iterator i;
|
|
|
|
for(i=m_queue.begin(); i!=m_queue.end(); i++)
|
|
|
|
{
|
|
|
|
QueuedBlockEmerge *q = *i;
|
|
|
|
if(q->peer_ids.find(peer_id) != NULL)
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
private:
|
|
|
|
core::list<QueuedBlockEmerge*> m_queue;
|
|
|
|
JMutex m_mutex;
|
|
|
|
};
|
|
|
|
|
|
|
|
class Server;
|
|
|
|
|
|
|
|
class ServerThread : public SimpleThread
|
|
|
|
{
|
|
|
|
Server *m_server;
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
ServerThread(Server *server):
|
|
|
|
SimpleThread(),
|
|
|
|
m_server(server)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void * Thread();
|
|
|
|
};
|
|
|
|
|
|
|
|
class EmergeThread : public SimpleThread
|
|
|
|
{
|
|
|
|
Server *m_server;
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
EmergeThread(Server *server):
|
|
|
|
SimpleThread(),
|
|
|
|
m_server(server)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void * Thread();
|
|
|
|
|
|
|
|
void trigger()
|
|
|
|
{
|
|
|
|
setRun(true);
|
|
|
|
if(IsRunning() == false)
|
|
|
|
{
|
|
|
|
Start();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct PlayerInfo
|
|
|
|
{
|
|
|
|
u16 id;
|
|
|
|
char name[PLAYERNAME_SIZE];
|
|
|
|
v3f position;
|
|
|
|
Address address;
|
|
|
|
float avg_rtt;
|
|
|
|
|
|
|
|
PlayerInfo();
|
|
|
|
void PrintLine(std::ostream *s);
|
|
|
|
};
|
|
|
|
|
|
|
|
u32 PIChecksum(core::list<PlayerInfo> &l);
|
|
|
|
|
2010-11-27 16:18:34 +01:00
|
|
|
/*
|
|
|
|
Used for queueing and sorting block transfers in containers
|
|
|
|
|
|
|
|
Lower priority number means higher priority.
|
|
|
|
*/
|
|
|
|
struct PrioritySortedBlockTransfer
|
|
|
|
{
|
2010-11-27 17:10:11 +01:00
|
|
|
PrioritySortedBlockTransfer(float a_priority, v3s16 a_pos, u16 a_peer_id)
|
2010-11-27 16:18:34 +01:00
|
|
|
{
|
|
|
|
priority = a_priority;
|
|
|
|
pos = a_pos;
|
2010-11-27 17:10:11 +01:00
|
|
|
peer_id = a_peer_id;
|
2010-11-27 16:18:34 +01:00
|
|
|
}
|
|
|
|
bool operator < (PrioritySortedBlockTransfer &other)
|
|
|
|
{
|
|
|
|
return priority < other.priority;
|
|
|
|
}
|
|
|
|
float priority;
|
|
|
|
v3s16 pos;
|
2010-11-27 17:10:11 +01:00
|
|
|
u16 peer_id;
|
2010-11-27 16:18:34 +01:00
|
|
|
};
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
class RemoteClient
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
// peer_id=0 means this client has no associated peer
|
|
|
|
// NOTE: If client is made allowed to exist while peer doesn't,
|
|
|
|
// this has to be set to 0 when there is no peer.
|
|
|
|
// Also, the client must be moved to some other container.
|
|
|
|
u16 peer_id;
|
|
|
|
// The serialization version to use with the client
|
|
|
|
u8 serialization_version;
|
|
|
|
// Version is stored in here after INIT before INIT2
|
|
|
|
u8 pending_serialization_version;
|
|
|
|
|
|
|
|
RemoteClient():
|
2011-01-17 01:40:53 +01:00
|
|
|
m_time_from_building(9999),
|
|
|
|
m_excess_gotblocks(0)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
peer_id = 0;
|
|
|
|
serialization_version = SER_FMT_VER_INVALID;
|
|
|
|
pending_serialization_version = SER_FMT_VER_INVALID;
|
|
|
|
m_nearest_unsent_d = 0;
|
2010-12-19 15:51:45 +01:00
|
|
|
m_nearest_unsent_reset_timer = 0.0;
|
2011-04-25 23:23:38 +02:00
|
|
|
m_nothing_to_send_counter = 0;
|
|
|
|
m_nothing_to_send_pause_timer = 0;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
~RemoteClient()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2010-11-27 17:10:11 +01:00
|
|
|
/*
|
|
|
|
Finds block that should be sent next to the client.
|
|
|
|
Environment should be locked when this is called.
|
|
|
|
dtime is used for resetting send radius at slow interval
|
|
|
|
*/
|
|
|
|
void GetNextBlocks(Server *server, float dtime,
|
|
|
|
core::array<PrioritySortedBlockTransfer> &dest);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2010-12-20 13:04:31 +01:00
|
|
|
/*
|
|
|
|
Connection and environment should be locked when this is called.
|
|
|
|
steps() objects of blocks not found in active_blocks, then
|
|
|
|
adds those blocks to active_blocks
|
|
|
|
*/
|
2010-11-27 00:02:21 +01:00
|
|
|
void SendObjectData(
|
|
|
|
Server *server,
|
|
|
|
float dtime,
|
|
|
|
core::map<v3s16, bool> &stepped_blocks
|
|
|
|
);
|
|
|
|
|
|
|
|
void GotBlock(v3s16 p);
|
|
|
|
|
|
|
|
void SentBlock(v3s16 p);
|
|
|
|
|
|
|
|
void SetBlockNotSent(v3s16 p);
|
|
|
|
void SetBlocksNotSent(core::map<v3s16, MapBlock*> &blocks);
|
|
|
|
|
2010-11-27 17:10:11 +01:00
|
|
|
s32 SendingCount()
|
|
|
|
{
|
|
|
|
return m_blocks_sending.size();
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
// Increments timeouts and removes timed-out blocks from list
|
2010-11-27 16:18:34 +01:00
|
|
|
// NOTE: This doesn't fix the server-not-sending-block bug
|
|
|
|
// because it is related to emerging, not sending.
|
2010-11-27 00:02:21 +01:00
|
|
|
//void RunSendingTimeouts(float dtime, float timeout);
|
|
|
|
|
|
|
|
void PrintInfo(std::ostream &o)
|
|
|
|
{
|
|
|
|
o<<"RemoteClient "<<peer_id<<": "
|
2011-04-07 23:47:14 +02:00
|
|
|
<<"m_blocks_sent.size()="<<m_blocks_sent.size()
|
2010-11-27 00:02:21 +01:00
|
|
|
<<", m_blocks_sending.size()="<<m_blocks_sending.size()
|
|
|
|
<<", m_nearest_unsent_d="<<m_nearest_unsent_d
|
2011-01-17 01:40:53 +01:00
|
|
|
<<", m_excess_gotblocks="<<m_excess_gotblocks
|
2010-11-27 00:02:21 +01:00
|
|
|
<<std::endl;
|
2011-01-17 01:40:53 +01:00
|
|
|
m_excess_gotblocks = 0;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Time from last placing or removing blocks
|
2011-02-20 23:45:14 +01:00
|
|
|
float m_time_from_building;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2010-12-23 21:35:53 +01:00
|
|
|
/*JMutex m_dig_mutex;
|
2010-12-18 12:10:37 +01:00
|
|
|
float m_dig_time_remaining;
|
|
|
|
// -1 = not digging
|
|
|
|
s16 m_dig_tool_item;
|
2010-12-23 21:35:53 +01:00
|
|
|
v3s16 m_dig_position;*/
|
2011-02-20 23:45:14 +01:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
2011-02-20 23:45:14 +01:00
|
|
|
List of active objects that the client knows of.
|
|
|
|
Value is dummy.
|
2010-11-27 00:02:21 +01:00
|
|
|
*/
|
2011-02-20 23:45:14 +01:00
|
|
|
core::map<u16, bool> m_known_objects;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-02-20 23:45:14 +01:00
|
|
|
private:
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
|
|
|
Blocks that have been sent to client.
|
|
|
|
- These don't have to be sent again.
|
|
|
|
- A block is cleared from here when client says it has
|
|
|
|
deleted it from it's memory
|
|
|
|
|
|
|
|
Key is position, value is dummy.
|
|
|
|
No MapBlock* is stored here because the blocks can get deleted.
|
|
|
|
*/
|
|
|
|
core::map<v3s16, bool> m_blocks_sent;
|
|
|
|
s16 m_nearest_unsent_d;
|
|
|
|
v3s16 m_last_center;
|
2010-12-19 15:51:45 +01:00
|
|
|
float m_nearest_unsent_reset_timer;
|
2011-02-20 23:45:14 +01:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
|
|
|
Blocks that are currently on the line.
|
|
|
|
This is used for throttling the sending of blocks.
|
|
|
|
- The size of this list is limited to some value
|
|
|
|
Block is added when it is sent with BLOCKDATA.
|
|
|
|
Block is removed when GOTBLOCKS is received.
|
|
|
|
Value is time from sending. (not used at the moment)
|
|
|
|
*/
|
|
|
|
core::map<v3s16, float> m_blocks_sending;
|
2011-01-17 01:40:53 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
Count of excess GotBlocks().
|
|
|
|
There is an excess amount because the client sometimes
|
|
|
|
gets a block so late that the server sends it again,
|
|
|
|
and the client then sends two GOTBLOCKs.
|
|
|
|
This is resetted by PrintInfo()
|
|
|
|
*/
|
|
|
|
u32 m_excess_gotblocks;
|
2011-04-25 23:23:38 +02:00
|
|
|
|
|
|
|
// CPU usage optimization
|
|
|
|
u32 m_nothing_to_send_counter;
|
|
|
|
float m_nothing_to_send_pause_timer;
|
2010-11-27 00:02:21 +01:00
|
|
|
};
|
|
|
|
|
2011-04-04 14:13:19 +02:00
|
|
|
class Server : public con::PeerHandler, public MapEventReceiver,
|
|
|
|
public InventoryManager
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
/*
|
|
|
|
NOTE: Every public method should be thread-safe
|
|
|
|
*/
|
2011-02-23 01:49:57 +01:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
Server(
|
2011-02-05 13:55:16 +01:00
|
|
|
std::string mapsavedir
|
2010-11-29 09:52:07 +01:00
|
|
|
);
|
2010-11-27 00:02:21 +01:00
|
|
|
~Server();
|
|
|
|
void start(unsigned short port);
|
|
|
|
void stop();
|
2010-11-29 09:52:07 +01:00
|
|
|
// This is mainly a way to pass the time to the server.
|
|
|
|
// Actual processing is done in an another thread.
|
2010-11-27 00:02:21 +01:00
|
|
|
void step(float dtime);
|
2010-11-29 09:52:07 +01:00
|
|
|
// This is run by ServerThread and does the actual processing
|
2010-11-27 00:02:21 +01:00
|
|
|
void AsyncRunStep();
|
|
|
|
void Receive();
|
|
|
|
void ProcessData(u8 *data, u32 datasize, u16 peer_id);
|
|
|
|
|
|
|
|
core::list<PlayerInfo> getPlayerInfo();
|
2010-12-21 17:08:24 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*u32 getDayNightRatio()
|
2010-12-21 17:08:24 +01:00
|
|
|
{
|
2011-02-23 01:49:57 +01:00
|
|
|
return time_to_daynight_ratio(m_time_of_day.get());
|
2011-05-22 16:00:09 +02:00
|
|
|
}*/
|
|
|
|
|
|
|
|
// Environment must be locked when called
|
2011-05-16 11:41:19 +02:00
|
|
|
void setTimeOfDay(u32 time)
|
|
|
|
{
|
2011-05-22 16:00:09 +02:00
|
|
|
m_env.setTimeOfDay(time);
|
2011-05-16 11:41:19 +02:00
|
|
|
m_time_of_day_send_timer = 0;
|
|
|
|
}
|
|
|
|
|
2011-02-15 15:11:24 +01:00
|
|
|
bool getShutdownRequested()
|
|
|
|
{
|
2011-05-22 16:00:09 +02:00
|
|
|
return m_shutdown_requested;
|
2011-02-15 15:11:24 +01:00
|
|
|
}
|
2011-02-23 01:49:57 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
Shall be called with the environment locked.
|
|
|
|
This is accessed by the map, which is inside the environment,
|
|
|
|
so it shouldn't be a problem.
|
|
|
|
*/
|
|
|
|
void onMapEditEvent(MapEditEvent *event);
|
2011-02-15 15:11:24 +01:00
|
|
|
|
2011-04-04 14:13:19 +02:00
|
|
|
/*
|
|
|
|
Shall be called with the environment and the connection locked.
|
|
|
|
*/
|
|
|
|
Inventory* getInventory(InventoryContext *c, std::string id);
|
|
|
|
void inventoryModified(InventoryContext *c, std::string id);
|
|
|
|
|
2011-05-16 11:41:19 +02:00
|
|
|
// Connection must be locked when called
|
|
|
|
std::wstring getStatusString();
|
|
|
|
|
|
|
|
void requestShutdown(void)
|
|
|
|
{
|
2011-05-22 16:00:09 +02:00
|
|
|
m_shutdown_requested = true;
|
2011-05-16 11:41:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Envlock and conlock should be locked when calling this
|
|
|
|
void SendMovePlayer(Player *player);
|
2011-05-29 21:34:04 +02:00
|
|
|
|
|
|
|
u64 getPlayerAuthPrivs(const std::string &name)
|
|
|
|
{
|
|
|
|
try{
|
|
|
|
return m_authmanager.getPrivs(name);
|
|
|
|
}
|
|
|
|
catch(AuthNotFoundException &e)
|
|
|
|
{
|
|
|
|
dstream<<"WARNING: Auth not found for "<<name<<std::endl;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2011-05-16 11:41:19 +02:00
|
|
|
|
2011-05-29 21:34:04 +02:00
|
|
|
void setPlayerAuthPrivs(const std::string &name, u64 privs)
|
|
|
|
{
|
|
|
|
try{
|
|
|
|
return m_authmanager.setPrivs(name, privs);
|
|
|
|
}
|
|
|
|
catch(AuthNotFoundException &e)
|
|
|
|
{
|
|
|
|
dstream<<"WARNING: Auth not found for "<<name<<std::endl;
|
|
|
|
}
|
|
|
|
}
|
2011-05-16 11:41:19 +02:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
private:
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
// con::PeerHandler implementation.
|
|
|
|
// These queue stuff to be processed by handlePeerChanges().
|
2010-11-27 00:02:21 +01:00
|
|
|
// As of now, these create and remove clients and players.
|
|
|
|
void peerAdded(con::Peer *peer);
|
|
|
|
void deletingPeer(con::Peer *peer, bool timeout);
|
|
|
|
|
2011-04-21 18:35:17 +02:00
|
|
|
/*
|
|
|
|
Static send methods
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void SendHP(con::Connection &con, u16 peer_id, u8 hp);
|
2011-05-29 20:11:16 +02:00
|
|
|
static void SendAccessDenied(con::Connection &con, u16 peer_id,
|
|
|
|
const std::wstring &reason);
|
2011-04-21 18:35:17 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
Non-static send methods
|
|
|
|
*/
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
// Envlock and conlock should be locked when calling these
|
|
|
|
void SendObjectData(float dtime);
|
|
|
|
void SendPlayerInfos();
|
|
|
|
void SendInventory(u16 peer_id);
|
2010-12-23 21:35:53 +01:00
|
|
|
void SendChatMessage(u16 peer_id, const std::wstring &message);
|
|
|
|
void BroadcastChatMessage(const std::wstring &message);
|
2011-04-21 18:35:17 +02:00
|
|
|
void SendPlayerHP(Player *player);
|
2011-04-06 10:02:39 +02:00
|
|
|
/*
|
|
|
|
Send a node removal/addition event to all clients except ignore_id.
|
|
|
|
Additionally, if far_players!=NULL, players further away than
|
|
|
|
far_d_nodes are ignored and their peer_ids are added to far_players
|
|
|
|
*/
|
2011-05-31 19:02:55 +02:00
|
|
|
// Envlock and conlock should be locked when calling these
|
2011-04-06 10:02:39 +02:00
|
|
|
void sendRemoveNode(v3s16 p, u16 ignore_id=0,
|
|
|
|
core::list<u16> *far_players=NULL, float far_d_nodes=100);
|
|
|
|
void sendAddNode(v3s16 p, MapNode n, u16 ignore_id=0,
|
|
|
|
core::list<u16> *far_players=NULL, float far_d_nodes=100);
|
2011-05-31 19:02:55 +02:00
|
|
|
void setBlockNotSent(v3s16 p);
|
2011-02-23 01:49:57 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
// Environment and Connection must be locked when called
|
2011-02-23 01:49:57 +01:00
|
|
|
void SendBlockNoLock(u16 peer_id, MapBlock *block, u8 ver);
|
2010-12-23 21:35:53 +01:00
|
|
|
|
2011-05-31 19:02:55 +02:00
|
|
|
// Sends blocks to clients (locks env and con on its own)
|
2010-11-27 00:02:21 +01:00
|
|
|
void SendBlocks(float dtime);
|
2011-04-21 18:35:17 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
Something random
|
|
|
|
*/
|
|
|
|
|
|
|
|
void UpdateCrafting(u16 peer_id);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
// When called, connection mutex should be locked
|
|
|
|
RemoteClient* getClient(u16 peer_id);
|
2011-02-15 15:11:24 +01:00
|
|
|
|
2011-05-30 23:15:43 +02:00
|
|
|
// When called, environment mutex should be locked
|
|
|
|
std::string getPlayerName(u16 peer_id)
|
|
|
|
{
|
|
|
|
Player *player = m_env.getPlayer(peer_id);
|
|
|
|
if(player == NULL)
|
|
|
|
return "[id="+itos(peer_id);
|
|
|
|
return player->getName();
|
|
|
|
}
|
|
|
|
|
2011-01-17 23:26:09 +01:00
|
|
|
/*
|
|
|
|
Get a player from memory or creates one.
|
|
|
|
If player is already connected, return NULL
|
2011-05-20 21:28:03 +02:00
|
|
|
The password is not checked here - it is only used to
|
|
|
|
set the password if a new player is created.
|
2011-01-17 23:26:09 +01:00
|
|
|
|
|
|
|
Call with env and con locked.
|
|
|
|
*/
|
2011-05-20 21:28:03 +02:00
|
|
|
Player *emergePlayer(const char *name, const char *password, u16 peer_id);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2010-12-24 16:08:50 +01:00
|
|
|
// Locks environment and connection by its own
|
|
|
|
struct PeerChange;
|
|
|
|
void handlePeerChange(PeerChange &c);
|
|
|
|
void handlePeerChanges();
|
2011-05-22 16:00:09 +02:00
|
|
|
|
2011-05-29 21:34:04 +02:00
|
|
|
u64 getPlayerPrivs(Player *player);
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
Variables
|
|
|
|
*/
|
2010-12-24 16:08:50 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
// Some timers
|
2011-01-17 20:15:31 +01:00
|
|
|
float m_liquid_transform_timer;
|
2010-12-19 15:51:45 +01:00
|
|
|
float m_print_info_timer;
|
|
|
|
float m_objectdata_timer;
|
|
|
|
float m_emergethread_trigger_timer;
|
|
|
|
float m_savemap_timer;
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
// NOTE: If connection and environment are both to be locked,
|
|
|
|
// environment shall be locked first.
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
// Environment
|
|
|
|
ServerEnvironment m_env;
|
|
|
|
JMutex m_env_mutex;
|
|
|
|
|
|
|
|
// Connection
|
2010-11-27 00:02:21 +01:00
|
|
|
con::Connection m_con;
|
2011-05-22 16:00:09 +02:00
|
|
|
JMutex m_con_mutex;
|
|
|
|
// Connected clients (behind the con mutex)
|
|
|
|
core::map<u16, RemoteClient*> m_clients;
|
2011-05-29 20:11:16 +02:00
|
|
|
|
|
|
|
// User authentication
|
|
|
|
AuthManager m_authmanager;
|
2011-05-22 16:00:09 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
Threads
|
|
|
|
*/
|
|
|
|
|
|
|
|
// A buffer for time steps
|
|
|
|
// step() increments and AsyncRunStep() run by m_thread reads it.
|
2010-11-27 00:02:21 +01:00
|
|
|
float m_step_dtime;
|
|
|
|
JMutex m_step_dtime_mutex;
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
// The server mainly operates in this thread
|
2010-11-27 00:02:21 +01:00
|
|
|
ServerThread m_thread;
|
2011-05-22 16:00:09 +02:00
|
|
|
// This thread fetches and generates map
|
2010-11-27 00:02:21 +01:00
|
|
|
EmergeThread m_emergethread;
|
2011-05-22 16:00:09 +02:00
|
|
|
// Queue of block coordinates to be processed by the emerge thread
|
2010-11-27 00:02:21 +01:00
|
|
|
BlockEmergeQueue m_emerge_queue;
|
2010-11-27 16:18:34 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
Time related stuff
|
|
|
|
*/
|
2010-12-20 13:04:31 +01:00
|
|
|
|
|
|
|
// 0-23999
|
2011-05-22 16:00:09 +02:00
|
|
|
//MutexedVariable<u32> m_time_of_day;
|
2010-12-20 13:04:31 +01:00
|
|
|
// Used to buffer dtime for adding to m_time_of_day
|
|
|
|
float m_time_counter;
|
2011-05-22 16:00:09 +02:00
|
|
|
// Timer for sending time of day over network
|
2010-12-20 13:04:31 +01:00
|
|
|
float m_time_of_day_send_timer;
|
2011-05-22 16:00:09 +02:00
|
|
|
// Uptime of server in seconds
|
2011-01-07 18:39:27 +01:00
|
|
|
MutexedVariable<double> m_uptime;
|
2011-02-15 15:11:24 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
Peer change queue.
|
|
|
|
Queues stuff from peerAdded() and deletingPeer() to
|
|
|
|
handlePeerChanges()
|
|
|
|
*/
|
2010-12-24 16:08:50 +01:00
|
|
|
enum PeerChangeType
|
|
|
|
{
|
|
|
|
PEER_ADDED,
|
|
|
|
PEER_REMOVED
|
|
|
|
};
|
|
|
|
struct PeerChange
|
|
|
|
{
|
|
|
|
PeerChangeType type;
|
|
|
|
u16 peer_id;
|
|
|
|
bool timeout;
|
|
|
|
};
|
|
|
|
Queue<PeerChange> m_peer_change_queue;
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
Random stuff
|
|
|
|
*/
|
|
|
|
|
|
|
|
// Map directory
|
2011-01-28 00:38:16 +01:00
|
|
|
std::string m_mapsavedir;
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
bool m_shutdown_requested;
|
2011-02-23 01:49:57 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
Map edit event queue. Automatically receives all map edits.
|
|
|
|
The constructor of this class registers us to receive them through
|
|
|
|
onMapEditEvent
|
|
|
|
|
|
|
|
NOTE: Should these be moved to actually be members of
|
|
|
|
ServerEnvironment?
|
|
|
|
*/
|
|
|
|
|
2011-02-23 01:49:57 +01:00
|
|
|
/*
|
|
|
|
Queue of map edits from the environment for sending to the clients
|
|
|
|
This is behind m_env_mutex
|
|
|
|
*/
|
|
|
|
Queue<MapEditEvent*> m_unsent_map_edit_queue;
|
|
|
|
/*
|
|
|
|
Set to true when the server itself is modifying the map and does
|
|
|
|
all sending of information by itself.
|
|
|
|
This is behind m_env_mutex
|
|
|
|
*/
|
|
|
|
bool m_ignore_map_edit_events;
|
|
|
|
/*
|
|
|
|
If set to !=0, the incoming MapEditEvents are modified to have
|
|
|
|
this peed id as the disabled recipient
|
|
|
|
This is behind m_env_mutex
|
|
|
|
*/
|
|
|
|
u16 m_ignore_map_edit_events_peer_id;
|
2011-02-15 15:11:24 +01:00
|
|
|
|
2011-05-30 23:15:43 +02:00
|
|
|
Profiler *m_profiler;
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
friend class EmergeThread;
|
|
|
|
friend class RemoteClient;
|
|
|
|
};
|
|
|
|
|
2011-01-23 16:29:15 +01:00
|
|
|
/*
|
2011-02-15 15:11:24 +01:00
|
|
|
Runs a simple dedicated server loop.
|
|
|
|
|
|
|
|
Shuts down when run is set to false.
|
2011-01-23 16:29:15 +01:00
|
|
|
*/
|
2011-02-15 15:11:24 +01:00
|
|
|
void dedicated_server_loop(Server &server, bool &run);
|
2011-01-23 16:29:15 +01:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
#endif
|
|
|
|
|