aboutsummaryrefslogtreecommitdiff
path: root/src/unittest/test_objdef.cpp
diff options
context:
space:
mode:
authorAuke Kok <sofar@foo-projects.org>2017-10-19 21:39:45 -0700
committerAuke Kok <sofar@foo-projects.org>2017-10-19 21:39:45 -0700
commitc60abb2aeccba2920d55a518fcffd2ad57f9f59a (patch)
tree6da89203a29f6dadb2d384b10ec779d1633fe2b4 /src/unittest/test_objdef.cpp
parentcdedaac5e299f71df72c2eb49ec52506467af831 (diff)
downloadminetest-c60abb2aeccba2920d55a518fcffd2ad57f9f59a.tar.gz
minetest-c60abb2aeccba2920d55a518fcffd2ad57f9f59a.tar.bz2
minetest-c60abb2aeccba2920d55a518fcffd2ad57f9f59a.zip
Correct `prot_vers` in lua_api.txt.
We should avoid providing incorrect struct members in documentation since people will be coding based on them.
Diffstat (limited to 'src/unittest/test_objdef.cpp')
0 files changed, 0 insertions, 0 deletions
a> 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205
/*
Minetest
Copyright (C) 2016 MillersMan <millersman@users.noreply.github.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.
*/

#include "reflowscan.h"
#include "map.h"
#include "mapblock.h"
#include "nodedef.h"
#include "util/timetaker.h"


ReflowScan::ReflowScan(Map *map, const NodeDefManager *ndef) :
	m_map(map),
	m_ndef(ndef)
{
}

void ReflowScan::scan(MapBlock *block, UniqueQueue<v3s16> *liquid_queue)
{
	m_block_pos = block->getPos();
	m_rel_block_pos = block->getPosRelative();
	m_liquid_queue = liquid_queue;

	// Prepare the lookup which is a 3x3x3 array of the blocks surrounding the
	// scanned block. Blocks are only added to the lookup if they are really
	// needed. The lookup is indexed manually to use the same index in a
	// bit-array (of uint32 type) which stores for unloaded blocks that they
	// were already fetched from Map but were actually nullptr.
	memset(m_lookup, 0, sizeof(m_lookup));
	int block_idx = 1 + (1 * 9) + (1 * 3);
	m_lookup[block_idx] = block;
	m_lookup_state_bitset = 1 << block_idx;

	// Scan the columns in the block
	for (s16 z = 0; z < MAP_BLOCKSIZE; z++)
	for (s16 x = 0; x < MAP_BLOCKSIZE; x++) {
		scanColumn(x, z);
	}

	// Scan neighbouring columns from the nearby blocks as they might contain
	// liquid nodes that weren't allowed to flow to prevent gaps.
	for (s16 i = 0; i < MAP_BLOCKSIZE; i++) {