2010-11-27 00:02:21 +01:00
|
|
|
/*
|
2013-02-24 18:40:43 +01:00
|
|
|
Minetest
|
2010-11-29 19:13:04 +01:00
|
|
|
Copyright (C) 2010 celeron55, Perttu Ahola <celeron55@gmail.com>
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
#include <jmutex.h>
|
|
|
|
#include <jmutexautolock.h>
|
|
|
|
#include <exception>
|
|
|
|
#include "debug.h"
|
2012-06-17 03:00:31 +02:00
|
|
|
#include "irrlichttypes.h"
|
|
|
|
#include "irr_v3d.h"
|
|
|
|
#include "irr_aabb3d.h"
|
2010-11-27 00:02:21 +01:00
|
|
|
#include "mapnode.h"
|
|
|
|
#include "exceptions.h"
|
|
|
|
#include "serialization.h"
|
|
|
|
#include "constants.h"
|
2010-12-11 17:11:03 +01:00
|
|
|
#include "voxel.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
|
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;
|
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
|
|
|
|
2011-04-03 18:50:54 +02:00
|
|
|
/*
|
|
|
|
MapBlock itself
|
|
|
|
*/
|
|
|
|
|
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();
|
2010-11-27 00:02:21 +01: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
|
|
|
}*/
|
2011-04-04 01:05:12 +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()
|
|
|
|
{
|
|
|
|
if(data != NULL)
|
|
|
|
delete[] data;
|
|
|
|
u32 l = MAP_BLOCKSIZE * MAP_BLOCKSIZE * MAP_BLOCKSIZE;
|
|
|
|
data = new MapNode[l];
|
|
|
|
for(u32 i=0; i<l; i++){
|
2011-06-25 03:25:14 +02:00
|
|
|
//data[i] = MapNode();
|
|
|
|
data[i] = MapNode(CONTENT_IGNORE);
|
2011-01-30 00:44:54 +01:00
|
|
|
}
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, "reallocate");
|
2011-01-30 00:44:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Flags
|
|
|
|
*/
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
bool isDummy()
|
|
|
|
{
|
|
|
|
return (data == NULL);
|
|
|
|
}
|
|
|
|
void unDummify()
|
|
|
|
{
|
|
|
|
assert(isDummy());
|
|
|
|
reallocate();
|
|
|
|
}
|
|
|
|
|
2011-06-25 03:25:14 +02:00
|
|
|
// m_modified methods
|
2011-11-21 12:29:16 +01:00
|
|
|
void raiseModified(u32 mod, const std::string &reason="unknown")
|
|
|
|
{
|
|
|
|
if(mod > m_modified){
|
|
|
|
m_modified = mod;
|
|
|
|
m_modified_reason = reason;
|
|
|
|
m_modified_reason_too_long = false;
|
2011-11-27 23:45:34 +01:00
|
|
|
|
|
|
|
if(m_modified >= MOD_STATE_WRITE_AT_UNLOAD){
|
|
|
|
m_disk_timestamp = m_timestamp;
|
|
|
|
}
|
2011-11-21 12:29:16 +01:00
|
|
|
} else if(mod == m_modified){
|
|
|
|
if(!m_modified_reason_too_long){
|
|
|
|
if(m_modified_reason.size() < 40)
|
|
|
|
m_modified_reason += ", " + reason;
|
|
|
|
else{
|
|
|
|
m_modified_reason += "...";
|
|
|
|
m_modified_reason_too_long = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-25 03:25:14 +02:00
|
|
|
}
|
|
|
|
u32 getModified()
|
|
|
|
{
|
|
|
|
return m_modified;
|
|
|
|
}
|
2011-11-21 12:29:16 +01:00
|
|
|
std::string getModifiedReason()
|
|
|
|
{
|
|
|
|
return m_modified_reason;
|
|
|
|
}
|
2011-06-25 03:25:14 +02:00
|
|
|
void resetModified()
|
|
|
|
{
|
|
|
|
m_modified = MOD_STATE_CLEAN;
|
2011-11-21 12:29:16 +01:00
|
|
|
m_modified_reason = "none";
|
|
|
|
m_modified_reason_too_long = false;
|
2011-06-25 03:25:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// is_underground getter/setter
|
2011-01-30 00:44:54 +01:00
|
|
|
bool getIsUnderground()
|
|
|
|
{
|
|
|
|
return is_underground;
|
|
|
|
}
|
|
|
|
void setIsUnderground(bool a_is_underground)
|
|
|
|
{
|
|
|
|
is_underground = a_is_underground;
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, "setIsUnderground");
|
2011-01-30 00:44:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void setLightingExpired(bool expired)
|
|
|
|
{
|
2011-10-12 09:53:37 +02:00
|
|
|
if(expired != m_lighting_expired){
|
|
|
|
m_lighting_expired = expired;
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, "setLightingExpired");
|
2011-10-12 09:53:37 +02:00
|
|
|
}
|
2011-01-30 00:44:54 +01:00
|
|
|
}
|
|
|
|
bool getLightingExpired()
|
|
|
|
{
|
|
|
|
return m_lighting_expired;
|
|
|
|
}
|
|
|
|
|
2011-06-25 03:25:14 +02:00
|
|
|
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
|
|
|
}
|
2011-06-25 03:25:14 +02:00
|
|
|
void setGenerated(bool b)
|
2011-04-02 19:55:22 +02:00
|
|
|
{
|
2011-10-12 09:53:37 +02:00
|
|
|
if(b != m_generated){
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, "setGenerated");
|
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
|
|
|
|
2011-01-30 00:44:54 +01:00
|
|
|
bool isValid()
|
|
|
|
{
|
|
|
|
if(m_lighting_expired)
|
|
|
|
return false;
|
|
|
|
if(data == NULL)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Position stuff
|
|
|
|
*/
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
v3s16 getPos()
|
|
|
|
{
|
|
|
|
return m_pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
v3s16 getPosRelative()
|
|
|
|
{
|
|
|
|
return m_pos * MAP_BLOCKSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
core::aabbox3d<s16> getBox()
|
|
|
|
{
|
|
|
|
return core::aabbox3d<s16>(getPosRelative(),
|
|
|
|
getPosRelative()
|
|
|
|
+ v3s16(MAP_BLOCKSIZE, MAP_BLOCKSIZE, MAP_BLOCKSIZE)
|
|
|
|
- v3s16(1,1,1));
|
|
|
|
}
|
|
|
|
|
2011-01-30 00:44:54 +01:00
|
|
|
/*
|
|
|
|
Regular MapNode get-setters
|
|
|
|
*/
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
bool isValidPosition(v3s16 p)
|
|
|
|
{
|
|
|
|
if(data == NULL)
|
|
|
|
return false;
|
|
|
|
return (p.X >= 0 && p.X < MAP_BLOCKSIZE
|
|
|
|
&& p.Y >= 0 && p.Y < MAP_BLOCKSIZE
|
|
|
|
&& p.Z >= 0 && p.Z < MAP_BLOCKSIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
MapNode getNode(s16 x, s16 y, s16 z)
|
|
|
|
{
|
|
|
|
if(data == NULL)
|
|
|
|
throw InvalidPositionException();
|
|
|
|
if(x < 0 || x >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
if(y < 0 || y >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
if(z < 0 || z >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
return data[z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + y*MAP_BLOCKSIZE + x];
|
|
|
|
}
|
|
|
|
|
|
|
|
MapNode getNode(v3s16 p)
|
|
|
|
{
|
|
|
|
return getNode(p.X, p.Y, p.Z);
|
|
|
|
}
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
MapNode getNodeNoEx(v3s16 p)
|
|
|
|
{
|
|
|
|
try{
|
|
|
|
return getNode(p.X, p.Y, p.Z);
|
|
|
|
}catch(InvalidPositionException &e){
|
|
|
|
return MapNode(CONTENT_IGNORE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
void setNode(s16 x, s16 y, s16 z, MapNode & n)
|
|
|
|
{
|
|
|
|
if(data == NULL)
|
|
|
|
throw InvalidPositionException();
|
|
|
|
if(x < 0 || x >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
if(y < 0 || y >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
if(z < 0 || z >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
data[z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + y*MAP_BLOCKSIZE + x] = n;
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, "setNode");
|
2010-11-27 00:02:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void setNode(v3s16 p, MapNode & n)
|
|
|
|
{
|
|
|
|
setNode(p.X, p.Y, p.Z, n);
|
|
|
|
}
|
|
|
|
|
2010-11-29 09:52:07 +01:00
|
|
|
/*
|
|
|
|
Non-checking variants of the above
|
|
|
|
*/
|
|
|
|
|
|
|
|
MapNode getNodeNoCheck(s16 x, s16 y, s16 z)
|
|
|
|
{
|
|
|
|
if(data == NULL)
|
|
|
|
throw InvalidPositionException();
|
|
|
|
return data[z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + y*MAP_BLOCKSIZE + x];
|
|
|
|
}
|
|
|
|
|
|
|
|
MapNode getNodeNoCheck(v3s16 p)
|
|
|
|
{
|
|
|
|
return getNodeNoCheck(p.X, p.Y, p.Z);
|
|
|
|
}
|
|
|
|
|
|
|
|
void setNodeNoCheck(s16 x, s16 y, s16 z, MapNode & n)
|
|
|
|
{
|
|
|
|
if(data == NULL)
|
|
|
|
throw InvalidPositionException();
|
|
|
|
data[z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + y*MAP_BLOCKSIZE + x] = n;
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_NEEDED, "setNodeNoCheck");
|
2010-11-29 09:52:07 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void setNodeNoCheck(v3s16 p, MapNode & n)
|
|
|
|
{
|
|
|
|
setNodeNoCheck(p.X, p.Y, p.Z, n);
|
|
|
|
}
|
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
|
|
|
These functions consult the parent container if the position
|
|
|
|
is not valid on this MapBlock.
|
|
|
|
*/
|
|
|
|
bool isValidPositionParent(v3s16 p);
|
|
|
|
MapNode getNodeParent(v3s16 p);
|
|
|
|
void setNodeParent(v3s16 p, MapNode & n);
|
2010-12-19 15:51:45 +01:00
|
|
|
MapNode getNodeParentNoEx(v3s16 p);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
void drawbox(s16 x0, s16 y0, s16 z0, s16 w, s16 h, s16 d, MapNode node)
|
|
|
|
{
|
|
|
|
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-12-26 13:34:34 +01:00
|
|
|
// See comments in mapblock.cpp
|
2011-01-15 12:50:13 +01:00
|
|
|
bool propagateSunlight(core::map<v3s16, bool> & light_sources,
|
2011-06-17 22:20:31 +02:00
|
|
|
bool remove_light=false, bool *black_air_left=NULL);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2010-12-11 17:11:03 +01:00
|
|
|
// Copies data to VoxelManipulator to getPosRelative()
|
|
|
|
void copyTo(VoxelManipulator &dst);
|
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
|
|
|
|
2010-12-19 15:51:45 +01:00
|
|
|
/*
|
2011-01-30 00:44:54 +01:00
|
|
|
Update day-night lighting difference flag.
|
|
|
|
Sets m_day_night_differs to appropriate value.
|
2010-12-19 15:51:45 +01:00
|
|
|
These methods don't care about neighboring blocks.
|
|
|
|
*/
|
2012-03-28 23:28:48 +02:00
|
|
|
void actuallyUpdateDayNightDiff();
|
|
|
|
/*
|
|
|
|
Call this to schedule what the previous function does to be done
|
|
|
|
when the value is actually needed.
|
|
|
|
*/
|
|
|
|
void expireDayNightDiff();
|
2010-12-19 15:51:45 +01:00
|
|
|
|
2012-03-28 23:28:48 +02:00
|
|
|
bool getDayNightDiff()
|
2010-12-19 15:51:45 +01:00
|
|
|
{
|
2012-03-28 23:28:48 +02:00
|
|
|
if(m_day_night_differs_expired)
|
|
|
|
actuallyUpdateDayNightDiff();
|
2010-12-19 15:51:45 +01:00
|
|
|
return m_day_night_differs;
|
|
|
|
}
|
|
|
|
|
2010-12-21 17:08:24 +01:00
|
|
|
/*
|
|
|
|
Miscellaneous stuff
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
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);
|
|
|
|
|
2011-05-22 16:00:09 +02:00
|
|
|
/*
|
|
|
|
Timestamp (see m_timestamp)
|
|
|
|
NOTE: BLOCK_TIMESTAMP_UNDEFINED=0xffffffff means there is no timestamp.
|
|
|
|
*/
|
|
|
|
void setTimestamp(u32 time)
|
|
|
|
{
|
|
|
|
m_timestamp = time;
|
2011-11-21 12:29:16 +01:00
|
|
|
raiseModified(MOD_STATE_WRITE_AT_UNLOAD, "setTimestamp");
|
2011-05-22 16:00:09 +02:00
|
|
|
}
|
2011-06-05 17:57:36 +02:00
|
|
|
void setTimestampNoChangedFlag(u32 time)
|
|
|
|
{
|
|
|
|
m_timestamp = time;
|
|
|
|
}
|
2011-05-22 16:00:09 +02:00
|
|
|
u32 getTimestamp()
|
|
|
|
{
|
|
|
|
return m_timestamp;
|
|
|
|
}
|
2011-11-27 23:45:34 +01:00
|
|
|
u32 getDiskTimestamp()
|
|
|
|
{
|
|
|
|
return m_disk_timestamp;
|
|
|
|
}
|
2011-06-25 03:25:14 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
See m_usage_timer
|
|
|
|
*/
|
|
|
|
void resetUsageTimer()
|
|
|
|
{
|
|
|
|
m_usage_timer = 0;
|
|
|
|
}
|
|
|
|
void incrementUsageTimer(float dtime)
|
|
|
|
{
|
|
|
|
m_usage_timer += dtime;
|
|
|
|
}
|
|
|
|
u32 getUsageTimer()
|
|
|
|
{
|
|
|
|
return m_usage_timer;
|
|
|
|
}
|
2012-09-04 08:48:26 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
See m_refcount
|
|
|
|
*/
|
|
|
|
void refGrab()
|
|
|
|
{
|
|
|
|
m_refcount++;
|
|
|
|
}
|
|
|
|
void refDrop()
|
|
|
|
{
|
|
|
|
m_refcount--;
|
|
|
|
}
|
|
|
|
int refGet()
|
|
|
|
{
|
|
|
|
return m_refcount;
|
|
|
|
}
|
2012-07-17 15:00:04 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
Node Timers
|
|
|
|
*/
|
|
|
|
// Get timer
|
|
|
|
NodeTimer getNodeTimer(v3s16 p){
|
|
|
|
return m_node_timers.get(p);
|
|
|
|
}
|
|
|
|
// Deletes timer
|
|
|
|
void removeNodeTimer(v3s16 p){
|
|
|
|
m_node_timers.remove(p);
|
|
|
|
}
|
|
|
|
// Deletes old timer and sets a new one
|
|
|
|
void setNodeTimer(v3s16 p, NodeTimer t){
|
|
|
|
m_node_timers.set(p,t);
|
|
|
|
}
|
|
|
|
// Deletes all timers
|
|
|
|
void clearNodeTimers(){
|
|
|
|
m_node_timers.clear();
|
|
|
|
}
|
2011-05-22 16:00:09 +02:00
|
|
|
|
2010-12-11 17:11:03 +01: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
|
|
|
|
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
|
|
|
|
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
|
|
|
|
*/
|
|
|
|
|
|
|
|
MapNode & getNodeRef(s16 x, s16 y, s16 z)
|
|
|
|
{
|
2010-12-21 17:08:24 +01:00
|
|
|
if(data == NULL)
|
|
|
|
throw InvalidPositionException();
|
2010-11-27 00:02:21 +01:00
|
|
|
if(x < 0 || x >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
if(y < 0 || y >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
if(z < 0 || z >= MAP_BLOCKSIZE) throw InvalidPositionException();
|
|
|
|
return data[z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + y*MAP_BLOCKSIZE + x];
|
|
|
|
}
|
|
|
|
MapNode & getNodeRef(v3s16 &p)
|
|
|
|
{
|
|
|
|
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;
|
|
|
|
//JMutex mesh_mutex;
|
2011-01-30 00:44:54 +01:00
|
|
|
#endif
|
2010-12-11 17:11:03 +01: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;
|
2011-04-03 15:21:06 +02:00
|
|
|
|
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
|
|
|
|
|
|
|
IGameDef *m_gamedef;
|
2011-01-30 00:44:54 +01: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.
|
|
|
|
*/
|
|
|
|
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;
|
2011-11-21 12:29:16 +01:00
|
|
|
std::string m_modified_reason;
|
|
|
|
bool m_modified_reason_too_long;
|
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;
|
2010-12-11 17:11:03 +01: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;
|
2010-12-19 15:51:45 +01: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
|
|
|
};
|
|
|
|
|
|
|
|
inline bool blockpos_over_limit(v3s16 p)
|
|
|
|
{
|
|
|
|
return
|
|
|
|
(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
|
|
|
|
|| p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
|
|
|
|
|| p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
|
|
|
|
|| p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
|
|
|
|
|| p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
|
|
|
|
|| p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
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
|
|
|
|
|