2010-11-27 00:02:21 +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
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef MAPBLOCK_HEADER
|
|
|
|
#define MAPBLOCK_HEADER
|
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
#include <set>
|
2010-11-27 00:02:21 +01:00
|
|
|
#include "debug.h"
|
2012-06-17 03:00:31 +02:00
|
|
|
#include "irr_v3d.h"
|
2010-11-27 00:02:21 +01:00
|
|
|
#include "mapnode.h"
|
|
|
|
#include "exceptions.h"
|
|
|
|
#include "constants.h"
|
2011-04-10 03:15:10 +02:00
|
|
|
#include "staticobject.h"
|
2012-03-19 01:08:04 +01:00
|
|
|
#include "nodemetadata.h"
|
|
|
|
#include "nodetimer.h"
|
2011-11-27 23:45:34 +01:00
|
|
|
#include "modifiedstate.h"
|
2012-06-17 01:40:36 +02:00
|
|
|
#include "util/numeric.h" // getContainerPos
|
2015-07-13 17:01:31 +02:00
|
|
|
#include "settings.h"
|
2011-06-17 22:20:31 +02:00
|
|
|
|
2011-06-26 00:31:43 +02:00
|
|
|
class Map;
|
2011-11-13 11:54:33 +01:00
|
|
|
class NodeMetadataList;
|
2011-11-13 23:19:48 +01:00
|
|
|
class IGameDef;
|
2012-03-13 18:56:12 +01:00
|
|
|
class MapBlockMesh;
|
2013-08-11 04:09:45 +02:00
|
|
|
class VoxelManipulator;
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
#define BLOCK_TIMESTAMP_UNDEFINED 0xffffffff
|
2011-04-03 18:50:54 +02:00
|
|
|
|
2011-06-17 22:20:31 +02:00
|
|
|
/*// Named by looking towards z+
|
2010-11-27 00:02:21 +01:00
|
|
|
enum{
|
|
|
|
FACE_BACK=0,
|
|
|
|
FACE_TOP,
|
|
|
|
FACE_RIGHT,
|
|
|
|
FACE_FRONT,
|
|
|
|
FACE_BOTTOM,
|
|
|
|
FACE_LEFT
|
2011-06-17 22:20:31 +02:00
|
|
|
};*/
|
2011-01-30 00:44:54 +01:00
|
|
|
|
2011-06-25 03:25:14 +02:00
|
|
|
// NOTE: If this is enabled, set MapBlock to be initialized with
|
|
|
|
// CONTENT_IGNORE.
|
|
|
|
/*enum BlockGenerationStatus
|
|
|
|
{
|
|
|
|
// Completely non-generated (filled with CONTENT_IGNORE).
|
|
|
|
BLOCKGEN_UNTOUCHED=0,
|
|
|
|
// Trees or similar might have been blitted from other blocks to here.
|
|
|
|
// Otherwise, the block contains CONTENT_IGNORE
|
|
|
|
BLOCKGEN_FROM_NEIGHBORS=2,
|
|
|
|
// Has been generated, but some neighbors might put some stuff in here
|
|
|
|
// when they are generated.
|
|
|
|
// Does not contain any CONTENT_IGNORE
|
|
|
|
BLOCKGEN_SELF_GENERATED=4,
|
|
|
|
// The block and all its neighbors have been generated
|
|
|
|
BLOCKGEN_FULLY_GENERATED=6
|
|
|
|
};*/
|
|
|
|
|
2011-06-26 00:31:43 +02:00
|
|
|
#if 0
|
2010-11-27 00:02:21 +01:00
|
|
|
enum
|
|
|
|
{
|
|
|
|
NODECONTAINER_ID_MAPBLOCK,
|
|
|
|
NODECONTAINER_ID_MAPSECTOR,
|
2010-11-29 09:52:07 +01:00
|
|
|
NODECONTAINER_ID_MAP,
|
|
|
|
NODECONTAINER_ID_MAPBLOCKCACHE,
|
|
|
|
NODECONTAINER_ID_VOXELMANIPULATOR,
|
2010-11-27 00:02:21 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
class NodeContainer
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual bool isValidPosition(v3s16 p) = 0;
|
|
|
|
virtual MapNode getNode(v3s16 p) = 0;
|
|
|
|
virtual void setNode(v3s16 p, MapNode & n) = 0;
|
|
|
|
virtual u16 nodeContainerId() const = 0;
|
2011-04-04 01:05:12 +02:00
|
|
|
|
|
|
|
MapNode getNodeNoEx(v3s16 p)
|
|
|
|
{
|
|
|
|
try{
|
|
|
|
return getNode(p);
|
|
|
|
}
|
|
|
|
catch(InvalidPositionException &e){
|
|
|
|
return MapNode(CONTENT_IGNORE);
|
|
|
|
}
|
|
|
|
}
|
2010-11-27 00:02:21 +01:00
|
|
|
};
|
2011-06-26 00:31:43 +02:00
|
|
|
#endif
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// MapBlock modified reason flags
|
|
|
|
////
|
|
|
|
|
|
|
|
#define MOD_REASON_INITIAL (1 << 0)
|
|
|
|
#define MOD_REASON_REALLOCATE (1 << 1)
|
|
|
|
#define MOD_REASON_SET_IS_UNDERGROUND (1 << 2)
|
|
|
|
#define MOD_REASON_SET_LIGHTING_EXPIRED (1 << 3)
|
|
|
|
#define MOD_REASON_SET_GENERATED (1 << 4)
|
|
|
|
#define MOD_REASON_SET_NODE (1 << 5)
|
|
|
|
#define MOD_REASON_SET_NODE_NO_CHECK (1 << 6)
|
|
|
|
#define MOD_REASON_SET_TIMESTAMP (1 << 7)
|
|
|
|
#define MOD_REASON_REPORT_META_CHANGE (1 << 8)
|
|
|
|
#define MOD_REASON_CLEAR_ALL_OBJECTS (1 << 9)
|
|
|
|
#define MOD_REASON_BLOCK_EXPIRED (1 << 10)
|
|
|
|
#define MOD_REASON_ADD_ACTIVE_OBJECT_RAW (1 << 11)
|
|
|
|
#define MOD_REASON_REMOVE_OBJECTS_REMOVE (1 << 12)
|
|
|
|
#define MOD_REASON_REMOVE_OBJECTS_DEACTIVATE (1 << 13)
|
|
|
|
#define MOD_REASON_TOO_MANY_OBJECTS (1 << 14)
|
|
|
|
#define MOD_REASON_STATIC_DATA_ADDED (1 << 15)
|
|
|
|
#define MOD_REASON_STATIC_DATA_REMOVED (1 << 16)
|
|
|
|
#define MOD_REASON_STATIC_DATA_CHANGED (1 << 17)
|
|
|
|
#define MOD_REASON_EXPIRE_DAYNIGHTDIFF (1 << 18)
|
|
|
|
#define MOD_REASON_UNKNOWN (1 << 19)
|
|
|
|
|
|
|
|
////
|
|
|
|
//// MapBlock itself
|
|
|
|
////
|
2011-04-03 18:50:54 +02:00
|
|
|
|
2011-06-26 00:31:43 +02:00
|
|
|
class MapBlock /*: public NodeContainer*/
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
public:
|
2011-11-14 20:41:30 +01:00
|
|
|
MapBlock(Map *parent, v3s16 pos, IGameDef *gamedef, bool dummy=false);
|
2010-12-19 15:51:45 +01:00
|
|
|
~MapBlock();
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2011-06-26 00:31:43 +02:00
|
|
|
/*virtual u16 nodeContainerId() const
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
return NODECONTAINER_ID_MAPBLOCK;
|
2011-06-26 00:31:43 +02:00
|
|
|
}*/
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2011-06-26 00:31:43 +02:00
|
|
|
Map * getParent()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
return m_parent;
|
|
|
|
}
|
|
|
|
|
2011-01-30 00:44:54 +01:00
|
|
|
void reallocate()
|
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
delete[] data;
|
2015-05-31 06:23:10 +02:00
|
|
|
data = new MapNode[nodecount];
|
|
|
|
for (u32 i = 0; i < nodecount; i++)
|
2011-06-25 03:25:14 +02:00
|
|
|
data[i] = MapNode(CONTENT_IGNORE);
|
2011-01-30 00:44:54 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_REALLOCATE);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2011-11-27 23:45:34 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Modification tracking methods
|
|
|
|
////
|
|
|
|
void raiseModified(u32 mod, u32 reason=MOD_REASON_UNKNOWN)
|
2015-01-13 15:19:54 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (mod > m_modified) {
|
2015-01-13 15:19:54 +01:00
|
|
|
m_modified = mod;
|
|
|
|
m_modified_reason = reason;
|
2015-05-18 04:14:26 +02:00
|
|
|
if (m_modified >= MOD_STATE_WRITE_AT_UNLOAD)
|
2015-01-13 15:19:54 +01:00
|
|
|
m_disk_timestamp = m_timestamp;
|
2015-05-18 04:14:26 +02:00
|
|
|
} else if (mod == m_modified) {
|
|
|
|
m_modified_reason |= reason;
|
2015-01-13 15:19:54 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline u32 getModified()
|
2011-06-25 03:25:14 +02:00
|
|
|
{
|
|
|
|
return m_modified;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline u32 getModifiedReason()
|
2011-11-21 12:29:16 +01:00
|
|
|
{
|
|
|
|
return m_modified_reason;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
std::string getModifiedReasonString();
|
|
|
|
|
|
|
|
inline void resetModified()
|
2011-06-25 03:25:14 +02:00
|
|
|
{
|
|
|
|
m_modified = MOD_STATE_CLEAN;
|
2015-05-18 04:14:26 +02:00
|
|
|
m_modified_reason = 0;
|
2011-06-25 03:25:14 +02:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
////
|
|
|
|
//// Flags
|
|
|
|
////
|
|
|
|
|
|
|
|
inline bool isDummy()
|
|
|
|
{
|
|
|
|
return (data == NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void unDummify()
|
|
|
|
{
|
|
|
|
assert(isDummy()); // Pre-condition
|
|
|
|
reallocate();
|
|
|
|
}
|
|
|
|
|
2011-06-25 03:25:14 +02:00
|
|
|
// is_underground getter/setter
|
2015-05-18 04:14:26 +02:00
|
|
|
inline bool getIsUnderground()
|
2011-01-30 00:44:54 +01:00
|
|
|
{
|
|
|
|
return is_underground;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void setIsUnderground(bool a_is_underground)
|
2011-01-30 00:44:54 +01:00
|
|
|
{
|
|
|
|
is_underground = a_is_underground;
|
2015-05-18 04:14:26 +02:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_SET_IS_UNDERGROUND);
|
2011-01-30 00:44:54 +01:00
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline void setLightingExpired(bool expired)
|
2011-01-30 00:44:54 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (expired != m_lighting_expired){
|
2011-10-12 09:53:37 +02:00
|
|
|
m_lighting_expired = expired;
|
2015-05-18 04:14:26 +02:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_SET_LIGHTING_EXPIRED);
|
2011-10-12 09:53:37 +02:00
|
|
|
}
|
2011-01-30 00:44:54 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline bool getLightingExpired()
|
2011-01-30 00:44:54 +01:00
|
|
|
{
|
|
|
|
return m_lighting_expired;
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline bool isGenerated()
|
2011-04-02 19:55:22 +02:00
|
|
|
{
|
2011-06-25 03:25:14 +02:00
|
|
|
return m_generated;
|
2011-04-02 19:55:22 +02:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void setGenerated(bool b)
|
2011-04-02 19:55:22 +02:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (b != m_generated) {
|
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_SET_GENERATED);
|
2011-10-12 09:53:37 +02:00
|
|
|
m_generated = b;
|
|
|
|
}
|
2011-06-25 03:25:14 +02:00
|
|
|
}
|
2011-04-02 19:55:22 +02:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline bool isValid()
|
2011-01-30 00:44:54 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (m_lighting_expired)
|
2011-01-30 00:44:54 +01:00
|
|
|
return false;
|
2015-05-18 04:14:26 +02:00
|
|
|
if (data == NULL)
|
2011-01-30 00:44:54 +01:00
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Position stuff
|
|
|
|
////
|
2011-01-30 00:44:54 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline v3s16 getPos()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
return m_pos;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline v3s16 getPosRelative()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2015-07-29 10:49:40 +02:00
|
|
|
return m_pos_relative;
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline core::aabbox3d<s16> getBox()
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
return core::aabbox3d<s16>(getPosRelative(),
|
|
|
|
getPosRelative()
|
|
|
|
+ v3s16(MAP_BLOCKSIZE, MAP_BLOCKSIZE, MAP_BLOCKSIZE)
|
|
|
|
- v3s16(1,1,1));
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Regular MapNode get-setters
|
|
|
|
////
|
|
|
|
|
|
|
|
inline bool isValidPosition(s16 x, s16 y, s16 z)
|
2014-11-14 09:05:34 +01:00
|
|
|
{
|
|
|
|
return data != NULL
|
2015-05-18 04:14:26 +02:00
|
|
|
&& x >= 0 && x < MAP_BLOCKSIZE
|
|
|
|
&& y >= 0 && y < MAP_BLOCKSIZE
|
|
|
|
&& z >= 0 && z < MAP_BLOCKSIZE;
|
2014-11-14 09:05:34 +01:00
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline bool isValidPosition(v3s16 p)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2014-11-14 09:05:34 +01:00
|
|
|
return isValidPosition(p.X, p.Y, p.Z);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline MapNode getNode(s16 x, s16 y, s16 z, bool *valid_position)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2014-11-14 09:05:34 +01:00
|
|
|
*valid_position = isValidPosition(x, y, z);
|
|
|
|
|
|
|
|
if (!*valid_position)
|
|
|
|
return MapNode(CONTENT_IGNORE);
|
|
|
|
|
2015-05-31 06:23:10 +02:00
|
|
|
return data[z * zstride + y * ystride + x];
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline MapNode getNode(v3s16 p, bool *valid_position)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2014-11-14 09:05:34 +01:00
|
|
|
return getNode(p.X, p.Y, p.Z, valid_position);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline MapNode getNodeNoEx(v3s16 p)
|
2011-05-22 16:00:09 +02:00
|
|
|
{
|
2014-11-14 09:05:34 +01:00
|
|
|
bool is_valid;
|
2017-01-04 20:11:55 +01:00
|
|
|
return getNode(p.X, p.Y, p.Z, &is_valid);
|
2011-05-22 16:00:09 +02:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void setNode(s16 x, s16 y, s16 z, MapNode & n)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (!isValidPosition(x, y, z))
|
2010-11-27 00:02:21 +01:00
|
|
|
throw InvalidPositionException();
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
data[z * zstride + y * ystride + x] = n;
|
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_SET_NODE);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void setNode(v3s16 p, MapNode & n)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
setNode(p.X, p.Y, p.Z, n);
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Non-checking variants of the above
|
|
|
|
////
|
2010-11-29 09:52:07 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline MapNode getNodeNoCheck(s16 x, s16 y, s16 z, bool *valid_position)
|
2010-11-29 09:52:07 +01:00
|
|
|
{
|
2014-11-14 09:05:34 +01:00
|
|
|
*valid_position = data != NULL;
|
2015-05-18 04:14:26 +02:00
|
|
|
if (!valid_position)
|
2014-11-14 09:05:34 +01:00
|
|
|
return MapNode(CONTENT_IGNORE);
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
return data[z * zstride + y * ystride + x];
|
2010-11-29 09:52:07 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline MapNode getNodeNoCheck(v3s16 p, bool *valid_position)
|
2010-11-29 09:52:07 +01:00
|
|
|
{
|
2014-11-14 09:05:34 +01:00
|
|
|
return getNodeNoCheck(p.X, p.Y, p.Z, valid_position);
|
2010-11-29 09:52:07 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2017-01-04 20:11:55 +01:00
|
|
|
////
|
|
|
|
//// Non-checking, unsafe variants of the above
|
|
|
|
//// MapBlock must be loaded by another function in the same scope/function
|
|
|
|
//// Caller must ensure that this is not a dummy block (by calling isDummy())
|
|
|
|
////
|
|
|
|
|
|
|
|
inline const MapNode &getNodeUnsafe(s16 x, s16 y, s16 z)
|
|
|
|
{
|
|
|
|
return data[z * zstride + y * ystride + x];
|
|
|
|
}
|
|
|
|
|
|
|
|
inline const MapNode &getNodeUnsafe(v3s16 &p)
|
|
|
|
{
|
|
|
|
return getNodeUnsafe(p.X, p.Y, p.Z);
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline void setNodeNoCheck(s16 x, s16 y, s16 z, MapNode & n)
|
2010-11-29 09:52:07 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (data == NULL)
|
2010-11-29 09:52:07 +01:00
|
|
|
throw InvalidPositionException();
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
data[z * zstride + y * ystride + x] = n;
|
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_SET_NODE_NO_CHECK);
|
2010-11-29 09:52:07 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void setNodeNoCheck(v3s16 p, MapNode & n)
|
2010-11-29 09:52:07 +01:00
|
|
|
{
|
|
|
|
setNodeNoCheck(p.X, p.Y, p.Z, n);
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
// These functions consult the parent container if the position
|
|
|
|
// is not valid on this MapBlock.
|
2010-11-27 00:02:21 +01:00
|
|
|
bool isValidPositionParent(v3s16 p);
|
2014-11-14 09:05:34 +01:00
|
|
|
MapNode getNodeParent(v3s16 p, bool *is_valid_position = NULL);
|
2010-11-27 00:02:21 +01:00
|
|
|
void setNodeParent(v3s16 p, MapNode & n);
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline void drawbox(s16 x0, s16 y0, s16 z0, s16 w, s16 h, s16 d, MapNode node)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
for (u16 z = 0; z < d; z++)
|
|
|
|
for (u16 y = 0; y < h; y++)
|
|
|
|
for (u16 x = 0; x < w; x++)
|
|
|
|
setNode(x0 + x, y0 + y, z0 + z, node);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
2010-12-26 13:34:34 +01:00
|
|
|
// See comments in mapblock.cpp
|
2015-05-18 04:14:26 +02:00
|
|
|
bool propagateSunlight(std::set<v3s16> &light_sources,
|
|
|
|
bool remove_light=false, bool *black_air_left=NULL);
|
|
|
|
|
2010-12-11 17:11:03 +01:00
|
|
|
// Copies data to VoxelManipulator to getPosRelative()
|
|
|
|
void copyTo(VoxelManipulator &dst);
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2011-02-01 02:06:02 +01:00
|
|
|
// Copies data from VoxelManipulator getPosRelative()
|
|
|
|
void copyFrom(VoxelManipulator &dst);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
// Update day-night lighting difference flag.
|
|
|
|
// Sets m_day_night_differs to appropriate value.
|
|
|
|
// These methods don't care about neighboring blocks.
|
2012-03-28 23:28:48 +02:00
|
|
|
void actuallyUpdateDayNightDiff();
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
// Call this to schedule what the previous function does to be done
|
|
|
|
// when the value is actually needed.
|
2012-03-28 23:28:48 +02:00
|
|
|
void expireDayNightDiff();
|
2010-12-19 15:51:45 +01:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline bool getDayNightDiff()
|
2010-12-19 15:51:45 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (m_day_night_differs_expired)
|
2012-03-28 23:28:48 +02:00
|
|
|
actuallyUpdateDayNightDiff();
|
2010-12-19 15:51:45 +01:00
|
|
|
return m_day_night_differs;
|
|
|
|
}
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Miscellaneous stuff
|
|
|
|
////
|
|
|
|
|
2010-12-21 17:08:24 +01:00
|
|
|
/*
|
|
|
|
Tries to measure ground level.
|
|
|
|
Return value:
|
|
|
|
-1 = only air
|
|
|
|
-2 = only ground
|
|
|
|
-3 = random fail
|
|
|
|
0...MAP_BLOCKSIZE-1 = ground level
|
|
|
|
*/
|
|
|
|
s16 getGroundLevel(v2s16 p2d);
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Timestamp (see m_timestamp)
|
|
|
|
////
|
|
|
|
|
|
|
|
// NOTE: BLOCK_TIMESTAMP_UNDEFINED=0xffffffff means there is no timestamp.
|
|
|
|
|
|
|
|
inline void setTimestamp(u32 time)
|
2011-05-22 16:00:09 +02:00
|
|
|
{
|
|
|
|
m_timestamp = time;
|
2015-05-18 04:14:26 +02:00
|
|
|
raiseModified(MOD_STATE_WRITE_AT_UNLOAD, MOD_REASON_SET_TIMESTAMP);
|
2011-05-22 16:00:09 +02:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void setTimestampNoChangedFlag(u32 time)
|
2011-06-05 17:57:36 +02:00
|
|
|
{
|
|
|
|
m_timestamp = time;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline u32 getTimestamp()
|
2011-05-22 16:00:09 +02:00
|
|
|
{
|
|
|
|
return m_timestamp;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline u32 getDiskTimestamp()
|
2011-11-27 23:45:34 +01:00
|
|
|
{
|
|
|
|
return m_disk_timestamp;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
////
|
|
|
|
//// Usage timer (see m_usage_timer)
|
|
|
|
////
|
|
|
|
|
|
|
|
inline void resetUsageTimer()
|
2011-06-25 03:25:14 +02:00
|
|
|
{
|
|
|
|
m_usage_timer = 0;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void incrementUsageTimer(float dtime)
|
2011-06-25 03:25:14 +02:00
|
|
|
{
|
|
|
|
m_usage_timer += dtime;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline float getUsageTimer()
|
2011-06-25 03:25:14 +02:00
|
|
|
{
|
|
|
|
return m_usage_timer;
|
|
|
|
}
|
2012-09-04 08:48:26 +02:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Reference counting (see m_refcount)
|
|
|
|
////
|
|
|
|
|
|
|
|
inline void refGrab()
|
2012-09-04 08:48:26 +02:00
|
|
|
{
|
|
|
|
m_refcount++;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void refDrop()
|
2012-09-04 08:48:26 +02:00
|
|
|
{
|
|
|
|
m_refcount--;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline int refGet()
|
2012-09-04 08:48:26 +02:00
|
|
|
{
|
|
|
|
return m_refcount;
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
////
|
|
|
|
//// Node Timers
|
|
|
|
////
|
|
|
|
|
|
|
|
inline NodeTimer getNodeTimer(v3s16 p)
|
|
|
|
{
|
2012-07-17 15:00:04 +02:00
|
|
|
return m_node_timers.get(p);
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void removeNodeTimer(v3s16 p)
|
|
|
|
{
|
2012-07-17 15:00:04 +02:00
|
|
|
m_node_timers.remove(p);
|
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2016-03-21 12:58:52 +01:00
|
|
|
inline void setNodeTimer(const NodeTimer &t)
|
2015-05-18 04:14:26 +02:00
|
|
|
{
|
2016-03-21 12:58:52 +01:00
|
|
|
m_node_timers.set(t);
|
2012-07-17 15:00:04 +02:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline void clearNodeTimers()
|
|
|
|
{
|
2012-07-17 15:00:04 +02:00
|
|
|
m_node_timers.clear();
|
|
|
|
}
|
2011-05-22 16:00:09 +02:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
////
|
|
|
|
//// Serialization
|
|
|
|
///
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
// These don't write or read version by itself
|
2012-01-21 00:11:44 +01:00
|
|
|
// Set disk to true for on-disk format, false for over-the-network format
|
2015-09-14 06:02:41 +02:00
|
|
|
// Precondition: version >= SER_FMT_VER_LOWEST_WRITE
|
2012-01-21 00:11:44 +01:00
|
|
|
void serialize(std::ostream &os, u8 version, bool disk);
|
|
|
|
// If disk == true: In addition to doing other things, will add
|
|
|
|
// unknown blocks from id-name mapping to wndef
|
|
|
|
void deSerialize(std::istream &is, u8 version, bool disk);
|
2010-12-11 17:11:03 +01:00
|
|
|
|
2013-08-01 22:51:36 +02:00
|
|
|
void serializeNetworkSpecific(std::ostream &os, u16 net_proto_version);
|
|
|
|
void deSerializeNetworkSpecific(std::istream &is);
|
2011-01-30 00:44:54 +01:00
|
|
|
private:
|
2010-12-19 18:11:05 +01:00
|
|
|
/*
|
2011-01-30 00:44:54 +01:00
|
|
|
Private methods
|
2010-12-19 18:11:05 +01:00
|
|
|
*/
|
|
|
|
|
2012-01-21 00:11:44 +01:00
|
|
|
void deSerialize_pre22(std::istream &is, u8 version, bool disk);
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
|
|
|
Used only internally, because changes can't be tracked
|
|
|
|
*/
|
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
inline MapNode &getNodeRef(s16 x, s16 y, s16 z)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
2015-05-18 04:14:26 +02:00
|
|
|
if (!isValidPosition(x, y, z))
|
2010-12-21 17:08:24 +01:00
|
|
|
throw InvalidPositionException();
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
return data[z * zstride + y * ystride + x];
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
2015-05-18 04:14:26 +02:00
|
|
|
|
|
|
|
inline MapNode &getNodeRef(v3s16 &p)
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
return getNodeRef(p.X, p.Y, p.Z);
|
|
|
|
}
|
2010-12-11 17:11:03 +01:00
|
|
|
|
2011-01-30 00:44:54 +01:00
|
|
|
public:
|
|
|
|
/*
|
|
|
|
Public member variables
|
|
|
|
*/
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
#ifndef SERVER // Only on client
|
2012-03-13 18:56:12 +01:00
|
|
|
MapBlockMesh *mesh;
|
2011-01-30 00:44:54 +01:00
|
|
|
#endif
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2012-03-19 01:08:04 +01:00
|
|
|
NodeMetadataList m_node_metadata;
|
|
|
|
NodeTimerList m_node_timers;
|
2011-04-10 03:15:10 +02:00
|
|
|
StaticObjectList m_static_objects;
|
2013-07-27 20:34:30 +02:00
|
|
|
|
2015-05-18 04:14:26 +02:00
|
|
|
static const u32 ystride = MAP_BLOCKSIZE;
|
|
|
|
static const u32 zstride = MAP_BLOCKSIZE * MAP_BLOCKSIZE;
|
|
|
|
|
2015-05-31 06:23:10 +02:00
|
|
|
static const u32 nodecount = MAP_BLOCKSIZE * MAP_BLOCKSIZE * MAP_BLOCKSIZE;
|
|
|
|
|
2011-01-30 00:44:54 +01:00
|
|
|
private:
|
|
|
|
/*
|
|
|
|
Private member variables
|
|
|
|
*/
|
|
|
|
|
2011-04-04 01:05:12 +02:00
|
|
|
// NOTE: Lots of things rely on this being the Map
|
2011-06-26 00:31:43 +02:00
|
|
|
Map *m_parent;
|
2010-12-11 17:11:03 +01:00
|
|
|
// Position in blocks on parent
|
|
|
|
v3s16 m_pos;
|
2011-11-14 20:41:30 +01:00
|
|
|
|
2015-07-29 10:49:40 +02:00
|
|
|
/* This is the precalculated m_pos_relative value
|
|
|
|
* This caches the value, improving performance by removing 3 s16 multiplications
|
|
|
|
* at runtime on each getPosRelative call
|
|
|
|
* For a 5 minutes runtime with valgrind this removes 3 * 19M s16 multiplications
|
|
|
|
* The gain can be estimated in Release Build to 3 * 100M multiply operations for 5 mins
|
|
|
|
*/
|
|
|
|
v3s16 m_pos_relative;
|
|
|
|
|
2011-11-14 20:41:30 +01:00
|
|
|
IGameDef *m_gamedef;
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2010-12-11 17:11:03 +01:00
|
|
|
/*
|
|
|
|
If NULL, block is a dummy block.
|
|
|
|
Dummy blocks are used for caching not-found-on-disk blocks.
|
|
|
|
*/
|
2015-05-18 04:14:26 +02:00
|
|
|
MapNode *data;
|
2011-01-30 00:44:54 +01:00
|
|
|
|
2010-12-11 17:11:03 +01:00
|
|
|
/*
|
|
|
|
- On the server, this is used for telling whether the
|
2011-06-25 03:25:14 +02:00
|
|
|
block has been modified from the one on disk.
|
2011-01-30 00:44:54 +01:00
|
|
|
- On the client, this is used for nothing.
|
2010-12-11 17:11:03 +01:00
|
|
|
*/
|
2011-06-25 03:25:14 +02:00
|
|
|
u32 m_modified;
|
2015-05-18 04:14:26 +02:00
|
|
|
u32 m_modified_reason;
|
2011-01-30 00:44:54 +01:00
|
|
|
|
2010-12-11 17:11:03 +01:00
|
|
|
/*
|
2011-01-30 00:44:54 +01:00
|
|
|
When propagating sunlight and the above block doesn't exist,
|
|
|
|
sunlight is assumed if this is false.
|
|
|
|
|
|
|
|
In practice this is set to true if the block is completely
|
|
|
|
undeground with nothing visible above the ground except
|
|
|
|
caves.
|
2010-12-11 17:11:03 +01:00
|
|
|
*/
|
|
|
|
bool is_underground;
|
2011-01-30 00:44:54 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
Set to true if changes has been made that make the old lighting
|
|
|
|
values wrong but the lighting hasn't been actually updated.
|
|
|
|
|
|
|
|
If this is false, lighting is exactly right.
|
|
|
|
If this is true, lighting might be wrong or right.
|
|
|
|
*/
|
|
|
|
bool m_lighting_expired;
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2010-12-19 15:51:45 +01:00
|
|
|
// Whether day and night lighting differs
|
|
|
|
bool m_day_night_differs;
|
2012-03-28 23:28:48 +02:00
|
|
|
bool m_day_night_differs_expired;
|
2011-06-25 03:25:14 +02:00
|
|
|
|
|
|
|
bool m_generated;
|
2015-05-18 04:14:26 +02:00
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
When block is removed from active blocks, this is set to gametime.
|
|
|
|
Value BLOCK_TIMESTAMP_UNDEFINED=0xffffffff means there is no timestamp.
|
|
|
|
*/
|
|
|
|
u32 m_timestamp;
|
2011-11-27 23:45:34 +01:00
|
|
|
// The on-disk (or to-be on-disk) timestamp value
|
|
|
|
u32 m_disk_timestamp;
|
2011-06-25 03:25:14 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
When the block is accessed, this is set to 0.
|
|
|
|
Map will unload the block when this reaches a timeout.
|
|
|
|
*/
|
|
|
|
float m_usage_timer;
|
2012-09-04 08:48:26 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
Reference count; currently used for determining if this block is in
|
|
|
|
the list of blocks to be drawn.
|
|
|
|
*/
|
|
|
|
int m_refcount;
|
2010-11-27 00:02:21 +01:00
|
|
|
};
|
|
|
|
|
2015-02-17 15:28:49 +01:00
|
|
|
typedef std::vector<MapBlock*> MapBlockVect;
|
|
|
|
|
2015-09-15 18:37:58 +02:00
|
|
|
inline bool objectpos_over_limit(v3f p)
|
|
|
|
{
|
2015-09-16 16:12:59 +02:00
|
|
|
const static float map_gen_limit_bs = MYMIN(MAX_MAP_GENERATION_LIMIT,
|
|
|
|
g_settings->getU16("map_generation_limit")) * BS;
|
|
|
|
return (p.X < -map_gen_limit_bs
|
2016-12-27 18:00:47 +01:00
|
|
|
|| p.X > map_gen_limit_bs
|
2015-09-16 16:12:59 +02:00
|
|
|
|| p.Y < -map_gen_limit_bs
|
2016-12-27 18:00:47 +01:00
|
|
|
|| p.Y > map_gen_limit_bs
|
2015-09-16 16:12:59 +02:00
|
|
|
|| p.Z < -map_gen_limit_bs
|
2016-12-27 18:00:47 +01:00
|
|
|
|| p.Z > map_gen_limit_bs);
|
2015-09-15 18:37:58 +02:00
|
|
|
}
|
|
|
|
|
2016-12-27 18:00:47 +01:00
|
|
|
/*
|
|
|
|
We are checking for any node of the mapblock being beyond the limit.
|
|
|
|
|
|
|
|
At the negative limit we are checking for
|
|
|
|
block minimum nodepos < -mapgenlimit.
|
|
|
|
At the positive limit we are checking for
|
|
|
|
block maximum nodepos > mapgenlimit.
|
|
|
|
|
|
|
|
Block minimum nodepos = blockpos * mapblocksize.
|
|
|
|
Block maximum nodepos = (blockpos + 1) * mapblocksize - 1.
|
|
|
|
*/
|
2010-11-27 00:02:21 +01:00
|
|
|
inline bool blockpos_over_limit(v3s16 p)
|
|
|
|
{
|
2015-07-13 17:01:31 +02:00
|
|
|
const static u16 map_gen_limit = MYMIN(MAX_MAP_GENERATION_LIMIT,
|
|
|
|
g_settings->getU16("map_generation_limit"));
|
2016-12-27 18:00:47 +01:00
|
|
|
return (p.X * MAP_BLOCKSIZE < -map_gen_limit
|
|
|
|
|| (p.X + 1) * MAP_BLOCKSIZE - 1 > map_gen_limit
|
|
|
|
|| p.Y * MAP_BLOCKSIZE < -map_gen_limit
|
|
|
|
|| (p.Y + 1) * MAP_BLOCKSIZE - 1 > map_gen_limit
|
|
|
|
|| p.Z * MAP_BLOCKSIZE < -map_gen_limit
|
|
|
|
|| (p.Z + 1) * MAP_BLOCKSIZE - 1 > map_gen_limit);
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Returns the position of the block where the node is located
|
|
|
|
*/
|
|
|
|
inline v3s16 getNodeBlockPos(v3s16 p)
|
|
|
|
{
|
|
|
|
return getContainerPos(p, MAP_BLOCKSIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline v2s16 getNodeSectorPos(v2s16 p)
|
|
|
|
{
|
|
|
|
return getContainerPos(p, MAP_BLOCKSIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline s16 getNodeBlockY(s16 y)
|
|
|
|
{
|
|
|
|
return getContainerPos(y, MAP_BLOCKSIZE);
|
|
|
|
}
|
|
|
|
|
2015-01-13 15:19:54 +01:00
|
|
|
inline void getNodeBlockPosWithOffset(const v3s16 &p, v3s16 &block, v3s16 &offset)
|
|
|
|
{
|
|
|
|
getContainerPosWithOffset(p, MAP_BLOCKSIZE, block, offset);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void getNodeSectorPosWithOffset(const v2s16 &p, v2s16 &block, v2s16 &offset)
|
|
|
|
{
|
|
|
|
getContainerPosWithOffset(p, MAP_BLOCKSIZE, block, offset);
|
|
|
|
}
|
|
|
|
|
2011-07-24 11:09:33 +02:00
|
|
|
/*
|
|
|
|
Get a quick string to describe what a block actually contains
|
|
|
|
*/
|
|
|
|
std::string analyze_block(MapBlock *block);
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
#endif
|