minetest/src/voxel.cpp

509 lines
12 KiB
C++
Raw Normal View History

/*
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>
This program is free software; you can redistribute it and/or modify
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
(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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser 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-29 09:57:05 +01:00
#include "voxel.h"
#include "map.h"
2010-12-21 17:08:24 +01:00
#include "gettime.h"
2011-11-14 20:41:30 +01:00
#include "nodedef.h"
#include "util/directiontables.h"
#include "util/timetaker.h"
#include <cstring> // memcpy, memset
/*
Debug stuff
*/
u64 addarea_time = 0;
u64 emerge_time = 0;
u64 emerge_load_time = 0;
u64 clearflag_time = 0;
2010-11-29 09:57:05 +01:00
VoxelManipulator::~VoxelManipulator()
{
2010-12-01 14:20:12 +01:00
clear();
}
void VoxelManipulator::clear()
{
// Reset area to volume=0
m_area = VoxelArea();
delete[] m_data;
m_data = nullptr;
delete[] m_flags;
m_flags = nullptr;
2010-12-01 14:20:12 +01:00
}
void VoxelManipulator::print(std::ostream &o, INodeDefManager *ndef,
2011-11-14 20:41:30 +01:00
VoxelPrintMode mode)
2010-12-01 14:20:12 +01:00
{
const v3s16 &em = m_area.getExtent();
2010-12-01 14:20:12 +01:00
v3s16 of = m_area.MinEdge;
o<<"size: "<<em.X<<"x"<<em.Y<<"x"<<em.Z
<<" offset: ("<<of.X<<","<<of.Y<<","<<of.Z<<")"<<std::endl;
2010-12-01 14:20:12 +01:00
for(s32 y=m_area.MaxEdge.Y; y>=m_area.MinEdge.Y; y--)
{
if(em.X >= 3 && em.Y >= 3)
{
if (y==m_area.MinEdge.Y+2) o<<"^ ";
else if(y==m_area.MinEdge.Y+1) o<<"| ";
else if(y==m_area.MinEdge.Y+0) o<<"y x-> ";
else o<<" ";
}
for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
{
for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
{
u8 f = m_flags[m_area.index(x,y,z)];
char c;
if(f & VOXELFLAG_NO_DATA)
2010-12-01 14:20:12 +01:00
c = 'N';
else
{
c = 'X';
MapNode n = m_data[m_area.index(x,y,z)];
content_t m = n.getContent();
u8 pr = n.param2;
if(mode == VOXELPRINT_MATERIAL)
{
if(m <= 9)
c = m + '0';
}
else if(mode == VOXELPRINT_WATERPRESSURE)
{
if(ndef->get(m).isLiquid())
{
c = 'w';
if(pr <= 9)
c = pr + '0';
}
else if(m == CONTENT_AIR)
{
c = ' ';
}
else
{
c = '#';
}
}
else if(mode == VOXELPRINT_LIGHT_DAY)
{
if(ndef->get(m).light_source != 0)
c = 'S';
else if(!ndef->get(m).light_propagates)
c = 'X';
else
{
u8 light = n.getLight(LIGHTBANK_DAY, ndef);
if(light < 10)
c = '0' + light;
else
c = 'a' + (light-10);
}
}
2010-12-01 14:20:12 +01:00
}
o<<c;
}
o<<' ';
}
o<<std::endl;
}
2010-11-29 09:57:05 +01:00
}
void VoxelManipulator::addArea(const VoxelArea &area)
2010-11-29 09:57:05 +01:00
{
2010-12-01 14:20:12 +01:00
// Cancel if requested area has zero volume
2015-01-13 14:23:31 +01:00
if (area.hasEmptyExtent())
2010-11-29 09:57:05 +01:00
return;
2010-12-01 14:20:12 +01:00
// Cancel if m_area already contains the requested area
if(m_area.contains(area))
return;
2010-12-21 17:08:24 +01:00
TimeTaker timer("addArea", &addarea_time);
2010-11-29 09:57:05 +01:00
// Calculate new area
VoxelArea new_area;
2010-12-01 14:20:12 +01:00
// New area is the requested area if m_area has zero volume
2015-01-13 14:23:31 +01:00
if(m_area.hasEmptyExtent())
2010-11-29 09:57:05 +01:00
{
new_area = area;
}
2010-12-01 14:20:12 +01:00
// Else add requested area to m_area
2010-11-29 09:57:05 +01:00
else
{
new_area = m_area;
new_area.addArea(area);
}
s32 new_size = new_area.getVolume();
/*dstream<<"adding area ";
area.print(dstream);
dstream<<", old area ";
m_area.print(dstream);
dstream<<", new area ";
new_area.print(dstream);
dstream<<", new_size="<<new_size;
dstream<<std::endl;*/
// Allocate new data and clear flags
MapNode *new_data = new MapNode[new_size];
assert(new_data);
2010-12-01 14:20:12 +01:00
u8 *new_flags = new u8[new_size];
assert(new_flags);
memset(new_flags, VOXELFLAG_NO_DATA, new_size);
2010-11-29 09:57:05 +01:00
// Copy old data
s32 old_x_width = m_area.MaxEdge.X - m_area.MinEdge.X + 1;
2010-11-29 09:57:05 +01:00
for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
{
unsigned int old_index = m_area.index(m_area.MinEdge.X,y,z);
unsigned int new_index = new_area.index(m_area.MinEdge.X,y,z);
memcpy(&new_data[new_index], &m_data[old_index],
old_x_width * sizeof(MapNode));
memcpy(&new_flags[new_index], &m_flags[old_index],
old_x_width * sizeof(u8));
2010-11-29 09:57:05 +01:00
}
2010-12-01 14:20:12 +01:00
// Replace area, data and flags
2010-11-29 09:57:05 +01:00
m_area = new_area;
2010-11-29 09:57:05 +01:00
MapNode *old_data = m_data;
2010-12-01 14:20:12 +01:00
u8 *old_flags = m_flags;
2010-11-29 09:57:05 +01:00
2010-12-01 14:20:12 +01:00
/*dstream<<"old_data="<<(int)old_data<<", new_data="<<(int)new_data
<<", old_flags="<<(int)m_flags<<", new_flags="<<(int)new_flags<<std::endl;*/
2010-11-29 09:57:05 +01:00
2010-12-01 14:20:12 +01:00
m_data = new_data;
m_flags = new_flags;
delete[] old_data;
delete[] old_flags;
//dstream<<"addArea done"<<std::endl;
}
void VoxelManipulator::copyFrom(MapNode *src, const VoxelArea& src_area,
v3s16 from_pos, v3s16 to_pos, const v3s16 &size)
{
/* The reason for this optimised code is that we're a member function
* and the data type/layout of m_data is know to us: it's stored as
* [z*h*w + y*h + x]. Therefore we can take the calls to m_area index
* (which performs the preceding mapping/indexing of m_data) out of the
* inner loop and calculate the next index as we're iterating to gain
* performance.
*
* src_step and dest_step is the amount required to be added to our index
* every time y increments. Because the destination area may be larger
* than the source area we need one additional variable (otherwise we could
* just continue adding dest_step as is done for the source data): dest_mod.
* dest_mod is the difference in size between a "row" in the source data
* and a "row" in the destination data (I am using the term row loosely
* and for illustrative purposes). E.g.
*
* src <-------------------->|'''''' dest mod ''''''''
* dest <--------------------------------------------->
*
* dest_mod (it's essentially a modulus) is added to the destination index
* after every full iteration of the y span.
*
* This method falls under the category "linear array and incrementing
* index".
*/
s32 src_step = src_area.getExtent().X;
s32 dest_step = m_area.getExtent().X;
s32 dest_mod = m_area.index(to_pos.X, to_pos.Y, to_pos.Z + 1)
- m_area.index(to_pos.X, to_pos.Y, to_pos.Z)
- dest_step * size.Y;
s32 i_src = src_area.index(from_pos.X, from_pos.Y, from_pos.Z);
s32 i_local = m_area.index(to_pos.X, to_pos.Y, to_pos.Z);
for (s16 z = 0; z < size.Z; z++) {
for (s16 y = 0; y < size.Y; y++) {
memcpy(&m_data[i_local], &src[i_src], size.X * sizeof(*m_data));
memset(&m_flags[i_local], 0, size.X);
i_src += src_step;
i_local += dest_step;
}
i_local += dest_mod;
}
2010-11-29 09:57:05 +01:00
}
void VoxelManipulator::copyTo(MapNode *dst, const VoxelArea& dst_area,
v3s16 dst_pos, v3s16 from_pos, const v3s16 &size)
{
for(s16 z=0; z<size.Z; z++)
for(s16 y=0; y<size.Y; y++)
{
s32 i_dst = dst_area.index(dst_pos.X, dst_pos.Y+y, dst_pos.Z+z);
s32 i_local = m_area.index(from_pos.X, from_pos.Y+y, from_pos.Z+z);
2013-02-22 04:26:21 +01:00
for (s16 x = 0; x < size.X; x++) {
if (m_data[i_local].getContent() != CONTENT_IGNORE)
dst[i_dst] = m_data[i_local];
i_dst++;
i_local++;
}
}
}
/*
Algorithms
-----------------------------------------------------
*/
void VoxelManipulator::clearFlag(u8 flags)
{
// 0-1ms on moderate area
2010-12-21 17:08:24 +01:00
TimeTaker timer("clearFlag", &clearflag_time);
2013-05-20 03:26:08 +02:00
//v3s16 s = m_area.getExtent();
/*dstream<<"clearFlag clearing area of size "
<<""<<s.X<<"x"<<s.Y<<"x"<<s.Z<<""
<<std::endl;*/
//s32 count = 0;
/*for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
{
u8 f = m_flags[m_area.index(x,y,z)];
m_flags[m_area.index(x,y,z)] &= ~flags;
if(m_flags[m_area.index(x,y,z)] != f)
count++;
}*/
s32 volume = m_area.getVolume();
for(s32 i=0; i<volume; i++)
{
m_flags[i] &= ~flags;
}
/*s32 volume = m_area.getVolume();
for(s32 i=0; i<volume; i++)
{
u8 f = m_flags[i];
m_flags[i] &= ~flags;
if(m_flags[i] != f)
count++;
}
dstream<<"clearFlag changed "<<count<<" flags out of "
<<volume<<" nodes"<<std::endl;*/
}
2011-01-24 15:36:58 +01:00
void VoxelManipulator::unspreadLight(enum LightBank bank, v3s16 p, u8 oldlight,
2012-12-20 18:19:49 +01:00
std::set<v3s16> & light_sources, INodeDefManager *nodemgr)
2011-01-24 15:36:58 +01:00
{
VoxelArea voxel_area(p - v3s16(1,1,1), p + v3s16(1,1,1));
addArea(voxel_area);
2011-01-24 15:36:58 +01:00
// Loop through 6 neighbors
for (const v3s16 &dir : g_6dirs) {
2011-01-24 15:36:58 +01:00
// Get the position of the neighbor node
v3s16 n2pos = p + dir;
2011-01-24 15:36:58 +01:00
u32 n2i = m_area.index(n2pos);
if(m_flags[n2i] & VOXELFLAG_NO_DATA)
2011-01-24 15:36:58 +01:00
continue;
MapNode &n2 = m_data[n2i];
2011-01-24 15:36:58 +01:00
/*
If the neighbor is dimmer than what was specified
as oldlight (the light of the previous node)
*/
2011-11-27 10:52:49 +01:00
u8 light2 = n2.getLight(bank, nodemgr);
if(light2 < oldlight)
2011-01-24 15:36:58 +01:00
{
/*
And the neighbor is transparent and it has some light
*/
2011-11-27 10:52:49 +01:00
if(nodemgr->get(n2).light_propagates && light2 != 0)
2011-01-24 15:36:58 +01:00
{
/*
Set light to 0 and add to queue
*/
2011-11-14 20:41:30 +01:00
n2.setLight(bank, 0, nodemgr);
2011-11-27 10:52:49 +01:00
unspreadLight(bank, n2pos, light2, light_sources, nodemgr);
2011-01-24 15:36:58 +01:00
/*
Remove from light_sources if it is there
NOTE: This doesn't happen nearly at all
*/
/*if(light_sources.find(n2pos))
{
std::cout<<"Removed from light_sources"<<std::endl;
light_sources.remove(n2pos);
}*/
}
}
else{
2012-12-20 18:19:49 +01:00
light_sources.insert(n2pos);
2011-01-24 15:36:58 +01:00
}
}
}
2011-11-14 20:41:30 +01:00
void VoxelManipulator::spreadLight(enum LightBank bank, v3s16 p,
INodeDefManager *nodemgr)
2011-01-24 15:36:58 +01:00
{
VoxelArea voxel_area(p - v3s16(1,1,1), p + v3s16(1,1,1));
addArea(voxel_area);
2011-01-24 15:36:58 +01:00
u32 i = m_area.index(p);
if(m_flags[i] & VOXELFLAG_NO_DATA)
2011-01-24 15:36:58 +01:00
return;
MapNode &n = m_data[i];
2011-11-14 20:41:30 +01:00
u8 oldlight = n.getLight(bank, nodemgr);
2011-01-24 15:36:58 +01:00
u8 newlight = diminish_light(oldlight);
// Loop through 6 neighbors
for (const auto &dir : g_6dirs) {
2011-01-24 15:36:58 +01:00
// Get the position of the neighbor node
v3s16 n2pos = p + dir;
2011-01-24 15:36:58 +01:00
u32 n2i = m_area.index(n2pos);
if(m_flags[n2i] & VOXELFLAG_NO_DATA)
2011-01-24 15:36:58 +01:00
continue;
MapNode &n2 = m_data[n2i];
2011-11-27 10:52:49 +01:00
u8 light2 = n2.getLight(bank, nodemgr);
2011-01-24 15:36:58 +01:00
/*
If the neighbor is brighter than the current node,
add to list (it will light up this node on its turn)
*/
2011-11-27 10:52:49 +01:00
if(light2 > undiminish_light(oldlight))
2011-01-24 15:36:58 +01:00
{
2011-11-14 20:41:30 +01:00
spreadLight(bank, n2pos, nodemgr);
2011-01-24 15:36:58 +01:00
}
/*
If the neighbor is dimmer than how much light this node
would spread on it, add to list
*/
2011-11-27 10:52:49 +01:00
if(light2 < newlight)
2011-01-24 15:36:58 +01:00
{
2011-11-14 20:41:30 +01:00
if(nodemgr->get(n2).light_propagates)
2011-01-24 15:36:58 +01:00
{
2011-11-14 20:41:30 +01:00
n2.setLight(bank, newlight, nodemgr);
spreadLight(bank, n2pos, nodemgr);
2011-01-24 15:36:58 +01:00
}
}
}
}
const MapNode VoxelManipulator::ContentIgnoreNode = MapNode(CONTENT_IGNORE);
2011-01-24 15:36:58 +01:00
/*
Lights neighbors of from_nodes, collects all them and then
goes on recursively.
*/
void VoxelManipulator::spreadLight(enum LightBank bank,
2012-12-20 18:19:49 +01:00
std::set<v3s16> & from_nodes, INodeDefManager *nodemgr)
2011-01-24 15:36:58 +01:00
{
if(from_nodes.empty())
2011-01-24 15:36:58 +01:00
return;
2012-12-20 18:19:49 +01:00
std::set<v3s16> lighted_nodes;
2011-01-24 15:36:58 +01:00
for (const v3s16 &pos : from_nodes) {
VoxelArea voxel_area(pos - v3s16(1,1,1), pos + v3s16(1,1,1));
addArea(voxel_area);
2011-01-24 15:36:58 +01:00
u32 i = m_area.index(pos);
if(m_flags[i] & VOXELFLAG_NO_DATA)
2011-01-24 15:36:58 +01:00
continue;
MapNode &n = m_data[i];
2011-11-14 20:41:30 +01:00
u8 oldlight = n.getLight(bank, nodemgr);
2011-01-24 15:36:58 +01:00
u8 newlight = diminish_light(oldlight);
// Loop through 6 neighbors
for (const v3s16 &dir : g_6dirs) {
2011-01-24 15:36:58 +01:00
// Get the position of the neighbor node
v3s16 n2pos = pos + dir;
2011-01-24 15:36:58 +01:00
try
{
u32 n2i = m_area.index(n2pos);
if(m_flags[n2i] & VOXELFLAG_NO_DATA)
2011-01-24 15:36:58 +01:00
continue;
MapNode &n2 = m_data[n2i];
2011-11-27 10:52:49 +01:00
u8 light2 = n2.getLight(bank, nodemgr);
2011-01-24 15:36:58 +01:00
/*
If the neighbor is brighter than the current node,
add to list (it will light up this node on its turn)
*/
2011-11-27 10:52:49 +01:00
if(light2 > undiminish_light(oldlight))
2011-01-24 15:36:58 +01:00
{
2012-12-20 18:19:49 +01:00
lighted_nodes.insert(n2pos);
2011-01-24 15:36:58 +01:00
}
/*
If the neighbor is dimmer than how much light this node
would spread on it, add to list
*/
2011-11-27 10:52:49 +01:00
if(light2 < newlight)
2011-01-24 15:36:58 +01:00
{
2011-11-14 20:41:30 +01:00
if(nodemgr->get(n2).light_propagates)
2011-01-24 15:36:58 +01:00
{
2011-11-14 20:41:30 +01:00
n2.setLight(bank, newlight, nodemgr);
2012-12-20 18:19:49 +01:00
lighted_nodes.insert(n2pos);
2011-01-24 15:36:58 +01:00
}
}
}
catch(InvalidPositionException &e)
{
continue;
}
}
}
/*dstream<<"spreadLight(): Changed block "
<<blockchangecount<<" times"
<<" for "<<from_nodes.size()<<" nodes"
<<std::endl;*/
if(!lighted_nodes.empty())
2011-11-14 20:41:30 +01:00
spreadLight(bank, lighted_nodes, nodemgr);
2011-01-24 15:36:58 +01:00
}
2010-11-29 09:57:05 +01:00
//END