3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
21 #include "mapsector.h"
25 #include "voxelalgorithms.h"
27 #include "serialization.h"
28 #include "nodemetadata.h"
34 #include "util/directiontables.h"
35 #include "util/basic_macros.h"
36 #include "rollback_interface.h"
37 #include "environment.h"
38 #include "reflowscan.h"
40 #include "mapgen/mapgen_v6.h"
41 #include "mapgen/mg_biome.h"
44 #include "database/database.h"
45 #include "database/database-dummy.h"
46 #include "database/database-sqlite3.h"
47 #include "script/scripting_server.h"
51 #include "database/database-leveldb.h"
54 #include "database/database-redis.h"
57 #include "database/database-postgresql.h"
65 Map::Map(std::ostream &dout, IGameDef *gamedef):
68 m_nodedef(gamedef->ndef())
77 for (auto §or : m_sectors) {
82 void Map::addEventReceiver(MapEventReceiver *event_receiver)
84 m_event_receivers.insert(event_receiver);
87 void Map::removeEventReceiver(MapEventReceiver *event_receiver)
89 m_event_receivers.erase(event_receiver);
92 void Map::dispatchEvent(MapEditEvent *event)
94 for (MapEventReceiver *event_receiver : m_event_receivers) {
95 event_receiver->onMapEditEvent(event);
99 MapSector * Map::getSectorNoGenerateNoExNoLock(v2s16 p)
101 if(m_sector_cache != NULL && p == m_sector_cache_p){
102 MapSector * sector = m_sector_cache;
106 std::map<v2s16, MapSector*>::iterator n = m_sectors.find(p);
108 if (n == m_sectors.end())
111 MapSector *sector = n->second;
113 // Cache the last result
114 m_sector_cache_p = p;
115 m_sector_cache = sector;
120 MapSector * Map::getSectorNoGenerateNoEx(v2s16 p)
122 return getSectorNoGenerateNoExNoLock(p);
125 MapSector * Map::getSectorNoGenerate(v2s16 p)
127 MapSector *sector = getSectorNoGenerateNoEx(p);
129 throw InvalidPositionException();
134 MapBlock * Map::getBlockNoCreateNoEx(v3s16 p3d)
136 v2s16 p2d(p3d.X, p3d.Z);
137 MapSector * sector = getSectorNoGenerateNoEx(p2d);
140 MapBlock *block = sector->getBlockNoCreateNoEx(p3d.Y);
144 MapBlock * Map::getBlockNoCreate(v3s16 p3d)
146 MapBlock *block = getBlockNoCreateNoEx(p3d);
148 throw InvalidPositionException();
152 bool Map::isNodeUnderground(v3s16 p)
154 v3s16 blockpos = getNodeBlockPos(p);
156 MapBlock * block = getBlockNoCreate(blockpos);
157 return block->getIsUnderground();
159 catch(InvalidPositionException &e)
165 bool Map::isValidPosition(v3s16 p)
167 v3s16 blockpos = getNodeBlockPos(p);
168 MapBlock *block = getBlockNoCreateNoEx(blockpos);
169 return (block != NULL);
172 // Returns a CONTENT_IGNORE node if not found
173 MapNode Map::getNodeNoEx(v3s16 p, bool *is_valid_position)
175 v3s16 blockpos = getNodeBlockPos(p);
176 MapBlock *block = getBlockNoCreateNoEx(blockpos);
178 if (is_valid_position != NULL)
179 *is_valid_position = false;
180 return {CONTENT_IGNORE};
183 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
185 MapNode node = block->getNodeNoCheck(relpos, &is_valid_p);
186 if (is_valid_position != NULL)
187 *is_valid_position = is_valid_p;
193 // throws InvalidPositionException if not found
194 // TODO: Now this is deprecated, getNodeNoEx should be renamed
195 MapNode Map::getNode(v3s16 p)
197 v3s16 blockpos = getNodeBlockPos(p);
198 MapBlock *block = getBlockNoCreateNoEx(blockpos);
200 throw InvalidPositionException();
201 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
202 bool is_valid_position;
203 MapNode node = block->getNodeNoCheck(relpos, &is_valid_position);
204 if (!is_valid_position)
205 throw InvalidPositionException();
210 // throws InvalidPositionException if not found
211 void Map::setNode(v3s16 p, MapNode & n)
213 v3s16 blockpos = getNodeBlockPos(p);
214 MapBlock *block = getBlockNoCreate(blockpos);
215 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
216 // Never allow placing CONTENT_IGNORE, it fucks up stuff
217 if(n.getContent() == CONTENT_IGNORE){
219 errorstream<<"Map::setNode(): Not allowing to place CONTENT_IGNORE"
220 <<" while trying to replace \""
221 <<m_nodedef->get(block->getNodeNoCheck(relpos, &temp_bool)).name
222 <<"\" at "<<PP(p)<<" (block "<<PP(blockpos)<<")"<<std::endl;
225 block->setNodeNoCheck(relpos, n);
228 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
229 std::map<v3s16, MapBlock*> &modified_blocks,
230 bool remove_metadata)
232 // Collect old node for rollback
233 RollbackNode rollback_oldnode(this, p, m_gamedef);
235 // This is needed for updating the lighting
236 MapNode oldnode = getNodeNoEx(p);
238 // Remove node metadata
239 if (remove_metadata) {
240 removeNodeMetadata(p);
243 // Set the node on the map
244 // Ignore light (because calling voxalgo::update_lighting_nodes)
245 n.setLight(LIGHTBANK_DAY, 0, m_nodedef);
246 n.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
250 std::vector<std::pair<v3s16, MapNode> > oldnodes;
251 oldnodes.emplace_back(p, oldnode);
252 voxalgo::update_lighting_nodes(this, oldnodes, modified_blocks);
254 for (auto &modified_block : modified_blocks) {
255 modified_block.second->expireDayNightDiff();
258 // Report for rollback
259 if(m_gamedef->rollback())
261 RollbackNode rollback_newnode(this, p, m_gamedef);
262 RollbackAction action;
263 action.setSetNode(p, rollback_oldnode, rollback_newnode);
264 m_gamedef->rollback()->reportAction(action);
268 Add neighboring liquid nodes and this node to transform queue.
269 (it's vital for the node itself to get updated last, if it was removed.)
272 for (const v3s16 &dir : g_7dirs) {
275 bool is_valid_position;
276 MapNode n2 = getNodeNoEx(p2, &is_valid_position);
277 if(is_valid_position &&
278 (m_nodedef->get(n2).isLiquid() ||
279 n2.getContent() == CONTENT_AIR))
280 m_transforming_liquid.push_back(p2);
284 void Map::removeNodeAndUpdate(v3s16 p,
285 std::map<v3s16, MapBlock*> &modified_blocks)
287 addNodeAndUpdate(p, MapNode(CONTENT_AIR), modified_blocks, true);
290 bool Map::addNodeWithEvent(v3s16 p, MapNode n, bool remove_metadata)
293 event.type = remove_metadata ? MEET_ADDNODE : MEET_SWAPNODE;
297 bool succeeded = true;
299 std::map<v3s16, MapBlock*> modified_blocks;
300 addNodeAndUpdate(p, n, modified_blocks, remove_metadata);
302 // Copy modified_blocks to event
303 for (auto &modified_block : modified_blocks) {
304 event.modified_blocks.insert(modified_block.first);
307 catch(InvalidPositionException &e){
311 dispatchEvent(&event);
316 bool Map::removeNodeWithEvent(v3s16 p)
319 event.type = MEET_REMOVENODE;
322 bool succeeded = true;
324 std::map<v3s16, MapBlock*> modified_blocks;
325 removeNodeAndUpdate(p, modified_blocks);
327 // Copy modified_blocks to event
328 for (auto &modified_block : modified_blocks) {
329 event.modified_blocks.insert(modified_block.first);
332 catch(InvalidPositionException &e){
336 dispatchEvent(&event);
341 struct TimeOrderedMapBlock {
345 TimeOrderedMapBlock(MapSector *sect, MapBlock *block) :
350 bool operator<(const TimeOrderedMapBlock &b) const
352 return block->getUsageTimer() < b.block->getUsageTimer();
359 void Map::timerUpdate(float dtime, float unload_timeout, u32 max_loaded_blocks,
360 std::vector<v3s16> *unloaded_blocks)
362 bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
364 // Profile modified reasons
365 Profiler modprofiler;
367 std::vector<v2s16> sector_deletion_queue;
368 u32 deleted_blocks_count = 0;
369 u32 saved_blocks_count = 0;
370 u32 block_count_all = 0;
374 // If there is no practical limit, we spare creation of mapblock_queue
375 if (max_loaded_blocks == U32_MAX) {
376 for (auto §or_it : m_sectors) {
377 MapSector *sector = sector_it.second;
379 bool all_blocks_deleted = true;
382 sector->getBlocks(blocks);
384 for (MapBlock *block : blocks) {
385 block->incrementUsageTimer(dtime);
387 if (block->refGet() == 0
388 && block->getUsageTimer() > unload_timeout) {
389 v3s16 p = block->getPos();
392 if (block->getModified() != MOD_STATE_CLEAN
393 && save_before_unloading) {
394 modprofiler.add(block->getModifiedReasonString(), 1);
395 if (!saveBlock(block))
397 saved_blocks_count++;
400 // Delete from memory
401 sector->deleteBlock(block);
404 unloaded_blocks->push_back(p);
406 deleted_blocks_count++;
408 all_blocks_deleted = false;
413 if (all_blocks_deleted) {
414 sector_deletion_queue.push_back(sector_it.first);
418 std::priority_queue<TimeOrderedMapBlock> mapblock_queue;
419 for (auto §or_it : m_sectors) {
420 MapSector *sector = sector_it.second;
423 sector->getBlocks(blocks);
425 for (MapBlock *block : blocks) {
426 block->incrementUsageTimer(dtime);
427 mapblock_queue.push(TimeOrderedMapBlock(sector, block));
430 block_count_all = mapblock_queue.size();
431 // Delete old blocks, and blocks over the limit from the memory
432 while (!mapblock_queue.empty() && (mapblock_queue.size() > max_loaded_blocks
433 || mapblock_queue.top().block->getUsageTimer() > unload_timeout)) {
434 TimeOrderedMapBlock b = mapblock_queue.top();
435 mapblock_queue.pop();
437 MapBlock *block = b.block;
439 if (block->refGet() != 0)
442 v3s16 p = block->getPos();
445 if (block->getModified() != MOD_STATE_CLEAN && save_before_unloading) {
446 modprofiler.add(block->getModifiedReasonString(), 1);
447 if (!saveBlock(block))
449 saved_blocks_count++;
452 // Delete from memory
453 b.sect->deleteBlock(block);
456 unloaded_blocks->push_back(p);
458 deleted_blocks_count++;
461 // Delete empty sectors
462 for (auto §or_it : m_sectors) {
463 if (sector_it.second->empty()) {
464 sector_deletion_queue.push_back(sector_it.first);
470 // Finally delete the empty sectors
471 deleteSectors(sector_deletion_queue);
473 if(deleted_blocks_count != 0)
475 PrintInfo(infostream); // ServerMap/ClientMap:
476 infostream<<"Unloaded "<<deleted_blocks_count
477 <<" blocks from memory";
478 if(save_before_unloading)
479 infostream<<", of which "<<saved_blocks_count<<" were written";
480 infostream<<", "<<block_count_all<<" blocks in memory";
481 infostream<<"."<<std::endl;
482 if(saved_blocks_count != 0){
483 PrintInfo(infostream); // ServerMap/ClientMap:
484 infostream<<"Blocks modified by: "<<std::endl;
485 modprofiler.print(infostream);
490 void Map::unloadUnreferencedBlocks(std::vector<v3s16> *unloaded_blocks)
492 timerUpdate(0.0, -1.0, 0, unloaded_blocks);
495 void Map::deleteSectors(std::vector<v2s16> §orList)
497 for (v2s16 j : sectorList) {
498 MapSector *sector = m_sectors[j];
499 // If sector is in sector cache, remove it from there
500 if(m_sector_cache == sector)
501 m_sector_cache = NULL;
502 // Remove from map and delete
508 void Map::PrintInfo(std::ostream &out)
513 #define WATER_DROP_BOOST 4
520 struct NodeNeighbor {
530 NodeNeighbor(const MapNode &node, NeighborType n_type, v3s16 pos)
537 void Map::transforming_liquid_add(v3s16 p) {
538 m_transforming_liquid.push_back(p);
541 s32 Map::transforming_liquid_size() {
542 return m_transforming_liquid.size();
545 void Map::transformLiquids(std::map<v3s16, MapBlock*> &modified_blocks,
546 ServerEnvironment *env)
549 u32 initial_size = m_transforming_liquid.size();
551 /*if(initial_size != 0)
552 infostream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
554 // list of nodes that due to viscosity have not reached their max level height
555 std::deque<v3s16> must_reflow;
557 std::vector<std::pair<v3s16, MapNode> > changed_nodes;
559 u32 liquid_loop_max = g_settings->getS32("liquid_loop_max");
560 u32 loop_max = liquid_loop_max;
564 /* If liquid_loop_max is not keeping up with the queue size increase
565 * loop_max up to a maximum of liquid_loop_max * dedicated_server_step.
567 if (m_transforming_liquid.size() > loop_max * 2) {
569 float server_step = g_settings->getFloat("dedicated_server_step");
570 if (m_transforming_liquid_loop_count_multiplier - 1.0 < server_step)
571 m_transforming_liquid_loop_count_multiplier *= 1.0 + server_step / 10;
573 m_transforming_liquid_loop_count_multiplier = 1.0;
576 loop_max *= m_transforming_liquid_loop_count_multiplier;
579 while (m_transforming_liquid.size() != 0)
581 // This should be done here so that it is done when continue is used
582 if (loopcount >= initial_size || loopcount >= loop_max)
587 Get a queued transforming liquid node
589 v3s16 p0 = m_transforming_liquid.front();
590 m_transforming_liquid.pop_front();
592 MapNode n0 = getNodeNoEx(p0);
595 Collect information about current node
597 s8 liquid_level = -1;
598 // The liquid node which will be placed there if
599 // the liquid flows into this node.
600 content_t liquid_kind = CONTENT_IGNORE;
601 // The node which will be placed there if liquid
602 // can't flow into this node.
603 content_t floodable_node = CONTENT_AIR;
604 const ContentFeatures &cf = m_nodedef->get(n0);
605 LiquidType liquid_type = cf.liquid_type;
606 switch (liquid_type) {
608 liquid_level = LIQUID_LEVEL_SOURCE;
609 liquid_kind = m_nodedef->getId(cf.liquid_alternative_flowing);
612 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
613 liquid_kind = n0.getContent();
616 // if this node is 'floodable', it *could* be transformed
617 // into a liquid, otherwise, continue with the next node.
620 floodable_node = n0.getContent();
621 liquid_kind = CONTENT_AIR;
626 Collect information about the environment
628 const v3s16 *dirs = g_6dirs;
629 NodeNeighbor sources[6]; // surrounding sources
631 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
633 NodeNeighbor airs[6]; // surrounding air
635 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
636 int num_neutrals = 0;
637 bool flowing_down = false;
638 bool ignored_sources = false;
639 for (u16 i = 0; i < 6; i++) {
640 NeighborType nt = NEIGHBOR_SAME_LEVEL;
649 v3s16 npos = p0 + dirs[i];
650 NodeNeighbor nb(getNodeNoEx(npos), nt, npos);
651 const ContentFeatures &cfnb = m_nodedef->get(nb.n);
652 switch (m_nodedef->get(nb.n.getContent()).liquid_type) {
654 if (cfnb.floodable) {
655 airs[num_airs++] = nb;
656 // if the current node is a water source the neighbor
657 // should be enqueded for transformation regardless of whether the
658 // current node changes or not.
659 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
660 m_transforming_liquid.push_back(npos);
661 // if the current node happens to be a flowing node, it will start to flow down here.
662 if (nb.t == NEIGHBOR_LOWER)
665 neutrals[num_neutrals++] = nb;
666 if (nb.n.getContent() == CONTENT_IGNORE) {
667 // If node below is ignore prevent water from
668 // spreading outwards and otherwise prevent from
669 // flowing away as ignore node might be the source
670 if (nb.t == NEIGHBOR_LOWER)
673 ignored_sources = true;
678 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
679 if (liquid_kind == CONTENT_AIR)
680 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
681 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
682 neutrals[num_neutrals++] = nb;
684 // Do not count bottom source, it will screw things up
686 sources[num_sources++] = nb;
690 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
691 if (liquid_kind == CONTENT_AIR)
692 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
693 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
694 neutrals[num_neutrals++] = nb;
696 flows[num_flows++] = nb;
697 if (nb.t == NEIGHBOR_LOWER)
705 decide on the type (and possibly level) of the current node
707 content_t new_node_content;
708 s8 new_node_level = -1;
709 s8 max_node_level = -1;
711 u8 range = m_nodedef->get(liquid_kind).liquid_range;
712 if (range > LIQUID_LEVEL_MAX + 1)
713 range = LIQUID_LEVEL_MAX + 1;
715 if ((num_sources >= 2 && m_nodedef->get(liquid_kind).liquid_renewable) || liquid_type == LIQUID_SOURCE) {
716 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
717 // or the flowing alternative of the first of the surrounding sources (if it's air), so
718 // it's perfectly safe to use liquid_kind here to determine the new node content.
719 new_node_content = m_nodedef->getId(m_nodedef->get(liquid_kind).liquid_alternative_source);
720 } else if (num_sources >= 1 && sources[0].t != NEIGHBOR_LOWER) {
721 // liquid_kind is set properly, see above
722 max_node_level = new_node_level = LIQUID_LEVEL_MAX;
723 if (new_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
724 new_node_content = liquid_kind;
726 new_node_content = floodable_node;
727 } else if (ignored_sources && liquid_level >= 0) {
728 // Maybe there are neighbouring sources that aren't loaded yet
729 // so prevent flowing away.
730 new_node_level = liquid_level;
731 new_node_content = liquid_kind;
733 // no surrounding sources, so get the maximum level that can flow into this node
734 for (u16 i = 0; i < num_flows; i++) {
735 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
736 switch (flows[i].t) {
738 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
739 max_node_level = LIQUID_LEVEL_MAX;
740 if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
741 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
742 } else if (nb_liquid_level > max_node_level) {
743 max_node_level = nb_liquid_level;
748 case NEIGHBOR_SAME_LEVEL:
749 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
750 nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level)
751 max_node_level = nb_liquid_level - 1;
756 u8 viscosity = m_nodedef->get(liquid_kind).liquid_viscosity;
757 if (viscosity > 1 && max_node_level != liquid_level) {
758 // amount to gain, limited by viscosity
759 // must be at least 1 in absolute value
760 s8 level_inc = max_node_level - liquid_level;
761 if (level_inc < -viscosity || level_inc > viscosity)
762 new_node_level = liquid_level + level_inc/viscosity;
763 else if (level_inc < 0)
764 new_node_level = liquid_level - 1;
765 else if (level_inc > 0)
766 new_node_level = liquid_level + 1;
767 if (new_node_level != max_node_level)
768 must_reflow.push_back(p0);
770 new_node_level = max_node_level;
773 if (max_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
774 new_node_content = liquid_kind;
776 new_node_content = floodable_node;
781 check if anything has changed. if not, just continue with the next node.
783 if (new_node_content == n0.getContent() &&
784 (m_nodedef->get(n0.getContent()).liquid_type != LIQUID_FLOWING ||
785 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
786 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
792 update the current node
795 //bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
796 if (m_nodedef->get(new_node_content).liquid_type == LIQUID_FLOWING) {
797 // set level to last 3 bits, flowing down bit to 4th bit
798 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
800 // set the liquid level and flow bit to 0
801 n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
805 n0.setContent(new_node_content);
807 // on_flood() the node
808 if (floodable_node != CONTENT_AIR) {
809 if (env->getScriptIface()->node_on_flood(p0, n00, n0))
813 // Ignore light (because calling voxalgo::update_lighting_nodes)
814 n0.setLight(LIGHTBANK_DAY, 0, m_nodedef);
815 n0.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
817 // Find out whether there is a suspect for this action
819 if (m_gamedef->rollback())
820 suspect = m_gamedef->rollback()->getSuspect(p0, 83, 1);
822 if (m_gamedef->rollback() && !suspect.empty()) {
824 RollbackScopeActor rollback_scope(m_gamedef->rollback(), suspect, true);
825 // Get old node for rollback
826 RollbackNode rollback_oldnode(this, p0, m_gamedef);
830 RollbackNode rollback_newnode(this, p0, m_gamedef);
831 RollbackAction action;
832 action.setSetNode(p0, rollback_oldnode, rollback_newnode);
833 m_gamedef->rollback()->reportAction(action);
839 v3s16 blockpos = getNodeBlockPos(p0);
840 MapBlock *block = getBlockNoCreateNoEx(blockpos);
842 modified_blocks[blockpos] = block;
843 changed_nodes.emplace_back(p0, n00);
847 enqueue neighbors for update if neccessary
849 switch (m_nodedef->get(n0.getContent()).liquid_type) {
852 // make sure source flows into all neighboring nodes
853 for (u16 i = 0; i < num_flows; i++)
854 if (flows[i].t != NEIGHBOR_UPPER)
855 m_transforming_liquid.push_back(flows[i].p);
856 for (u16 i = 0; i < num_airs; i++)
857 if (airs[i].t != NEIGHBOR_UPPER)
858 m_transforming_liquid.push_back(airs[i].p);
861 // this flow has turned to air; neighboring flows might need to do the same
862 for (u16 i = 0; i < num_flows; i++)
863 m_transforming_liquid.push_back(flows[i].p);
867 //infostream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
869 for (auto &iter : must_reflow)
870 m_transforming_liquid.push_back(iter);
872 voxalgo::update_lighting_nodes(this, changed_nodes, modified_blocks);
875 /* ----------------------------------------------------------------------
876 * Manage the queue so that it does not grow indefinately
878 u16 time_until_purge = g_settings->getU16("liquid_queue_purge_time");
880 if (time_until_purge == 0)
881 return; // Feature disabled
883 time_until_purge *= 1000; // seconds -> milliseconds
885 u64 curr_time = porting::getTimeMs();
886 u32 prev_unprocessed = m_unprocessed_count;
887 m_unprocessed_count = m_transforming_liquid.size();
889 // if unprocessed block count is decreasing or stable
890 if (m_unprocessed_count <= prev_unprocessed) {
891 m_queue_size_timer_started = false;
893 if (!m_queue_size_timer_started)
894 m_inc_trending_up_start_time = curr_time;
895 m_queue_size_timer_started = true;
898 // Account for curr_time overflowing
899 if (m_queue_size_timer_started && m_inc_trending_up_start_time > curr_time)
900 m_queue_size_timer_started = false;
902 /* If the queue has been growing for more than liquid_queue_purge_time seconds
903 * and the number of unprocessed blocks is still > liquid_loop_max then we
904 * cannot keep up; dump the oldest blocks from the queue so that the queue
905 * has liquid_loop_max items in it
907 if (m_queue_size_timer_started
908 && curr_time - m_inc_trending_up_start_time > time_until_purge
909 && m_unprocessed_count > liquid_loop_max) {
911 size_t dump_qty = m_unprocessed_count - liquid_loop_max;
913 infostream << "transformLiquids(): DUMPING " << dump_qty
914 << " blocks from the queue" << std::endl;
917 m_transforming_liquid.pop_front();
919 m_queue_size_timer_started = false; // optimistically assume we can keep up now
920 m_unprocessed_count = m_transforming_liquid.size();
924 std::vector<v3s16> Map::findNodesWithMetadata(v3s16 p1, v3s16 p2)
926 std::vector<v3s16> positions_with_meta;
928 sortBoxVerticies(p1, p2);
929 v3s16 bpmin = getNodeBlockPos(p1);
930 v3s16 bpmax = getNodeBlockPos(p2);
932 VoxelArea area(p1, p2);
934 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
935 for (s16 y = bpmin.Y; y <= bpmax.Y; y++)
936 for (s16 x = bpmin.X; x <= bpmax.X; x++) {
937 v3s16 blockpos(x, y, z);
939 MapBlock *block = getBlockNoCreateNoEx(blockpos);
941 verbosestream << "Map::getNodeMetadata(): Need to emerge "
942 << PP(blockpos) << std::endl;
943 block = emergeBlock(blockpos, false);
946 infostream << "WARNING: Map::getNodeMetadata(): Block not found"
951 v3s16 p_base = blockpos * MAP_BLOCKSIZE;
952 std::vector<v3s16> keys = block->m_node_metadata.getAllKeys();
953 for (size_t i = 0; i != keys.size(); i++) {
954 v3s16 p(keys[i] + p_base);
955 if (!area.contains(p))
958 positions_with_meta.push_back(p);
962 return positions_with_meta;
965 NodeMetadata *Map::getNodeMetadata(v3s16 p)
967 v3s16 blockpos = getNodeBlockPos(p);
968 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
969 MapBlock *block = getBlockNoCreateNoEx(blockpos);
971 infostream<<"Map::getNodeMetadata(): Need to emerge "
972 <<PP(blockpos)<<std::endl;
973 block = emergeBlock(blockpos, false);
976 warningstream<<"Map::getNodeMetadata(): Block not found"
980 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
984 bool Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
986 v3s16 blockpos = getNodeBlockPos(p);
987 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
988 MapBlock *block = getBlockNoCreateNoEx(blockpos);
990 infostream<<"Map::setNodeMetadata(): Need to emerge "
991 <<PP(blockpos)<<std::endl;
992 block = emergeBlock(blockpos, false);
995 warningstream<<"Map::setNodeMetadata(): Block not found"
999 block->m_node_metadata.set(p_rel, meta);
1003 void Map::removeNodeMetadata(v3s16 p)
1005 v3s16 blockpos = getNodeBlockPos(p);
1006 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1007 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1010 warningstream<<"Map::removeNodeMetadata(): Block not found"
1014 block->m_node_metadata.remove(p_rel);
1017 NodeTimer Map::getNodeTimer(v3s16 p)
1019 v3s16 blockpos = getNodeBlockPos(p);
1020 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1021 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1023 infostream<<"Map::getNodeTimer(): Need to emerge "
1024 <<PP(blockpos)<<std::endl;
1025 block = emergeBlock(blockpos, false);
1028 warningstream<<"Map::getNodeTimer(): Block not found"
1032 NodeTimer t = block->m_node_timers.get(p_rel);
1033 NodeTimer nt(t.timeout, t.elapsed, p);
1037 void Map::setNodeTimer(const NodeTimer &t)
1039 v3s16 p = t.position;
1040 v3s16 blockpos = getNodeBlockPos(p);
1041 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1042 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1044 infostream<<"Map::setNodeTimer(): Need to emerge "
1045 <<PP(blockpos)<<std::endl;
1046 block = emergeBlock(blockpos, false);
1049 warningstream<<"Map::setNodeTimer(): Block not found"
1053 NodeTimer nt(t.timeout, t.elapsed, p_rel);
1054 block->m_node_timers.set(nt);
1057 void Map::removeNodeTimer(v3s16 p)
1059 v3s16 blockpos = getNodeBlockPos(p);
1060 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1061 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1064 warningstream<<"Map::removeNodeTimer(): Block not found"
1068 block->m_node_timers.remove(p_rel);
1071 bool Map::isOccluded(v3s16 p0, v3s16 p1, float step, float stepfac,
1072 float start_off, float end_off, u32 needed_count)
1074 float d0 = (float)BS * p0.getDistanceFrom(p1);
1076 v3f uf = v3f(u0.X, u0.Y, u0.Z) * BS;
1078 v3f p0f = v3f(p0.X, p0.Y, p0.Z) * BS;
1080 for(float s=start_off; s<d0+end_off; s+=step){
1081 v3f pf = p0f + uf * s;
1082 v3s16 p = floatToInt(pf, BS);
1083 MapNode n = getNodeNoEx(p);
1084 const ContentFeatures &f = m_nodedef->get(n);
1085 if(f.drawtype == NDT_NORMAL){
1086 // not transparent, see ContentFeature::updateTextures
1088 if(count >= needed_count)
1096 bool Map::isBlockOccluded(MapBlock *block, v3s16 cam_pos_nodes) {
1097 v3s16 cpn = block->getPos() * MAP_BLOCKSIZE;
1098 cpn += v3s16(MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2);
1099 float step = BS * 1;
1100 float stepfac = 1.1;
1101 float startoff = BS * 1;
1102 // The occlusion search of 'isOccluded()' must stop short of the target
1103 // point by distance 'endoff' (end offset) to not enter the target mapblock.
1104 // For the 8 mapblock corners 'endoff' must therefore be the maximum diagonal
1105 // of a mapblock, because we must consider all view angles.
1106 // sqrt(1^2 + 1^2 + 1^2) = 1.732
1107 float endoff = -BS * MAP_BLOCKSIZE * 1.732050807569;
1108 s16 bs2 = MAP_BLOCKSIZE / 2 + 1;
1109 // to reduce the likelihood of falsely occluded blocks
1110 // require at least two solid blocks
1111 // this is a HACK, we should think of a more precise algorithm
1112 u32 needed_count = 2;
1115 // For the central point of the mapblock 'endoff' can be halved
1116 isOccluded(cam_pos_nodes, cpn,
1117 step, stepfac, startoff, endoff / 2.0f, needed_count) &&
1118 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,bs2),
1119 step, stepfac, startoff, endoff, needed_count) &&
1120 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,-bs2),
1121 step, stepfac, startoff, endoff, needed_count) &&
1122 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,-bs2,bs2),
1123 step, stepfac, startoff, endoff, needed_count) &&
1124 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,-bs2,-bs2),
1125 step, stepfac, startoff, endoff, needed_count) &&
1126 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,bs2,bs2),
1127 step, stepfac, startoff, endoff, needed_count) &&
1128 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,bs2,-bs2),
1129 step, stepfac, startoff, endoff, needed_count) &&
1130 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,-bs2,bs2),
1131 step, stepfac, startoff, endoff, needed_count) &&
1132 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,-bs2,-bs2),
1133 step, stepfac, startoff, endoff, needed_count));
1139 ServerMap::ServerMap(const std::string &savedir, IGameDef *gamedef,
1140 EmergeManager *emerge):
1141 Map(dout_server, gamedef),
1142 settings_mgr(g_settings, savedir + DIR_DELIM + "map_meta.txt"),
1145 verbosestream<<FUNCTION_NAME<<std::endl;
1147 // Tell the EmergeManager about our MapSettingsManager
1148 emerge->map_settings_mgr = &settings_mgr;
1151 Try to load map; if not found, create a new one.
1154 // Determine which database backend to use
1155 std::string conf_path = savedir + DIR_DELIM + "world.mt";
1157 bool succeeded = conf.readConfigFile(conf_path.c_str());
1158 if (!succeeded || !conf.exists("backend")) {
1159 // fall back to sqlite3
1160 conf.set("backend", "sqlite3");
1162 std::string backend = conf.get("backend");
1163 dbase = createDatabase(backend, savedir, conf);
1165 if (!conf.updateConfigFile(conf_path.c_str()))
1166 errorstream << "ServerMap::ServerMap(): Failed to update world.mt!" << std::endl;
1168 m_savedir = savedir;
1169 m_map_saving_enabled = false;
1172 // If directory exists, check contents and load if possible
1173 if (fs::PathExists(m_savedir)) {
1174 // If directory is empty, it is safe to save into it.
1175 if (fs::GetDirListing(m_savedir).empty()) {
1176 infostream<<"ServerMap: Empty save directory is valid."
1178 m_map_saving_enabled = true;
1183 if (settings_mgr.loadMapMeta()) {
1184 infostream << "ServerMap: Metadata loaded from "
1185 << savedir << std::endl;
1187 infostream << "ServerMap: Metadata could not be loaded "
1188 "from " << savedir << ", assuming valid save "
1189 "directory." << std::endl;
1192 m_map_saving_enabled = true;
1193 // Map loaded, not creating new one
1197 // If directory doesn't exist, it is safe to save to it
1199 m_map_saving_enabled = true;
1202 catch(std::exception &e)
1204 warningstream<<"ServerMap: Failed to load map from "<<savedir
1205 <<", exception: "<<e.what()<<std::endl;
1206 infostream<<"Please remove the map or fix it."<<std::endl;
1207 warningstream<<"Map saving will be disabled."<<std::endl;
1211 ServerMap::~ServerMap()
1213 verbosestream<<FUNCTION_NAME<<std::endl;
1217 if (m_map_saving_enabled) {
1218 // Save only changed parts
1219 save(MOD_STATE_WRITE_AT_UNLOAD);
1220 infostream << "ServerMap: Saved map to " << m_savedir << std::endl;
1222 infostream << "ServerMap: Map not saved" << std::endl;
1225 catch(std::exception &e)
1227 infostream<<"ServerMap: Failed to save map to "<<m_savedir
1228 <<", exception: "<<e.what()<<std::endl;
1232 Close database if it was opened
1240 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1241 for(; i.atEnd() == false; i++)
1243 MapChunk *chunk = i.getNode()->getValue();
1249 MapgenParams *ServerMap::getMapgenParams()
1251 // getMapgenParams() should only ever be called after Server is initialized
1252 assert(settings_mgr.mapgen_params != NULL);
1253 return settings_mgr.mapgen_params;
1256 u64 ServerMap::getSeed()
1258 return getMapgenParams()->seed;
1261 s16 ServerMap::getWaterLevel()
1263 return getMapgenParams()->water_level;
1266 bool ServerMap::saoPositionOverLimit(const v3f &p)
1268 return getMapgenParams()->saoPosOverLimit(p);
1271 bool ServerMap::blockpos_over_mapgen_limit(v3s16 p)
1273 const s16 mapgen_limit_bp = rangelim(
1274 getMapgenParams()->mapgen_limit, 0, MAX_MAP_GENERATION_LIMIT) /
1276 return p.X < -mapgen_limit_bp ||
1277 p.X > mapgen_limit_bp ||
1278 p.Y < -mapgen_limit_bp ||
1279 p.Y > mapgen_limit_bp ||
1280 p.Z < -mapgen_limit_bp ||
1281 p.Z > mapgen_limit_bp;
1284 bool ServerMap::initBlockMake(v3s16 blockpos, BlockMakeData *data)
1286 s16 csize = getMapgenParams()->chunksize;
1287 v3s16 bpmin = EmergeManager::getContainingChunk(blockpos, csize);
1288 v3s16 bpmax = bpmin + v3s16(1, 1, 1) * (csize - 1);
1290 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1291 EMERGE_DBG_OUT("initBlockMake(): " PP(bpmin) " - " PP(bpmax));
1293 v3s16 extra_borders(1, 1, 1);
1294 v3s16 full_bpmin = bpmin - extra_borders;
1295 v3s16 full_bpmax = bpmax + extra_borders;
1297 // Do nothing if not inside mapgen limits (+-1 because of neighbors)
1298 if (blockpos_over_mapgen_limit(full_bpmin) ||
1299 blockpos_over_mapgen_limit(full_bpmax))
1302 data->seed = getSeed();
1303 data->blockpos_min = bpmin;
1304 data->blockpos_max = bpmax;
1305 data->blockpos_requested = blockpos;
1306 data->nodedef = m_nodedef;
1309 Create the whole area of this and the neighboring blocks
1311 for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
1312 for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++) {
1313 v2s16 sectorpos(x, z);
1314 // Sector metadata is loaded from disk if not already loaded.
1315 MapSector *sector = createSector(sectorpos);
1316 FATAL_ERROR_IF(sector == NULL, "createSector() failed");
1318 for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
1321 MapBlock *block = emergeBlock(p, false);
1322 if (block == NULL) {
1323 block = createBlock(p);
1325 // Block gets sunlight if this is true.
1326 // Refer to the map generator heuristics.
1327 bool ug = m_emerge->isBlockUnderground(p);
1328 block->setIsUnderground(ug);
1334 Now we have a big empty area.
1336 Make a ManualMapVoxelManipulator that contains this and the
1340 data->vmanip = new MMVManip(this);
1341 data->vmanip->initialEmerge(full_bpmin, full_bpmax);
1343 // Note: we may need this again at some point.
1345 // Ensure none of the blocks to be generated were marked as
1346 // containing CONTENT_IGNORE
1347 for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
1348 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
1349 for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
1350 core::map<v3s16, u8>::Node *n;
1351 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
1354 u8 flags = n->getValue();
1355 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
1362 // Data is ready now.
1366 void ServerMap::finishBlockMake(BlockMakeData *data,
1367 std::map<v3s16, MapBlock*> *changed_blocks)
1369 v3s16 bpmin = data->blockpos_min;
1370 v3s16 bpmax = data->blockpos_max;
1372 v3s16 extra_borders(1, 1, 1);
1374 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1375 EMERGE_DBG_OUT("finishBlockMake(): " PP(bpmin) " - " PP(bpmax));
1378 Blit generated stuff to map
1379 NOTE: blitBackAll adds nearly everything to changed_blocks
1381 data->vmanip->blitBackAll(changed_blocks);
1383 EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()="
1384 << changed_blocks->size());
1387 Copy transforming liquid information
1389 while (data->transforming_liquid.size()) {
1390 m_transforming_liquid.push_back(data->transforming_liquid.front());
1391 data->transforming_liquid.pop_front();
1394 for (auto &changed_block : *changed_blocks) {
1395 MapBlock *block = changed_block.second;
1399 Update day/night difference cache of the MapBlocks
1401 block->expireDayNightDiff();
1403 Set block as modified
1405 block->raiseModified(MOD_STATE_WRITE_NEEDED,
1406 MOD_REASON_EXPIRE_DAYNIGHTDIFF);
1410 Set central blocks as generated
1412 for (s16 x = bpmin.X; x <= bpmax.X; x++)
1413 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
1414 for (s16 y = bpmin.Y; y <= bpmax.Y; y++) {
1415 MapBlock *block = getBlockNoCreateNoEx(v3s16(x, y, z));
1419 block->setGenerated(true);
1423 Save changed parts of map
1424 NOTE: Will be saved later.
1426 //save(MOD_STATE_WRITE_AT_UNLOAD);
1429 MapSector *ServerMap::createSector(v2s16 p2d)
1432 Check if it exists already in memory
1434 MapSector *sector = getSectorNoGenerateNoEx(p2d);
1439 Do not create over max mapgen limit
1441 const s16 max_limit_bp = MAX_MAP_GENERATION_LIMIT / MAP_BLOCKSIZE;
1442 if (p2d.X < -max_limit_bp ||
1443 p2d.X > max_limit_bp ||
1444 p2d.Y < -max_limit_bp ||
1445 p2d.Y > max_limit_bp)
1446 throw InvalidPositionException("createSector(): pos. over max mapgen limit");
1449 Generate blank sector
1452 sector = new MapSector(this, p2d, m_gamedef);
1454 // Sector position on map in nodes
1455 //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
1460 m_sectors[p2d] = sector;
1467 This is a quick-hand function for calling makeBlock().
1469 MapBlock * ServerMap::generateBlock(
1471 std::map<v3s16, MapBlock*> &modified_blocks
1474 bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
1476 TimeTaker timer("generateBlock");
1478 //MapBlock *block = original_dummy;
1480 v2s16 p2d(p.X, p.Z);
1481 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
1484 Do not generate over-limit
1486 if(blockpos_over_limit(p))
1488 infostream<<FUNCTION_NAME<<": Block position over limit"<<std::endl;
1489 throw InvalidPositionException("generateBlock(): pos. over limit");
1493 Create block make data
1496 initBlockMake(&data, p);
1502 TimeTaker t("mapgen::make_block()");
1503 mapgen->makeChunk(&data);
1504 //mapgen::make_block(&data);
1506 if(enable_mapgen_debug_info == false)
1507 t.stop(true); // Hide output
1511 Blit data back on map, update lighting, add mobs and whatever this does
1513 finishBlockMake(&data, modified_blocks);
1518 MapBlock *block = getBlockNoCreateNoEx(p);
1526 bool erroneus_content = false;
1527 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1528 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1529 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1532 MapNode n = block->getNode(p);
1533 if(n.getContent() == CONTENT_IGNORE)
1535 infostream<<"CONTENT_IGNORE at "
1536 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
1538 erroneus_content = true;
1542 if(erroneus_content)
1551 Generate a completely empty block
1555 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1556 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1558 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1561 n.setContent(CONTENT_AIR);
1562 block->setNode(v3s16(x0,y0,z0), n);
1568 if(enable_mapgen_debug_info == false)
1569 timer.stop(true); // Hide output
1575 MapBlock * ServerMap::createBlock(v3s16 p)
1578 Do not create over max mapgen limit
1580 if (blockpos_over_max_limit(p))
1581 throw InvalidPositionException("createBlock(): pos. over max mapgen limit");
1583 v2s16 p2d(p.X, p.Z);
1586 This will create or load a sector if not found in memory.
1587 If block exists on disk, it will be loaded.
1589 NOTE: On old save formats, this will be slow, as it generates
1590 lighting on blocks for them.
1594 sector = createSector(p2d);
1595 } catch (InvalidPositionException &e) {
1596 infostream<<"createBlock: createSector() failed"<<std::endl;
1601 Try to get a block from the sector
1604 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
1606 if(block->isDummy())
1611 block = sector->createBlankBlock(block_y);
1616 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
1619 MapBlock *block = getBlockNoCreateNoEx(p);
1620 if (block && !block->isDummy())
1625 MapBlock *block = loadBlock(p);
1631 MapSector *sector = createSector(v2s16(p.X, p.Z));
1632 MapBlock *block = sector->createBlankBlock(p.Y);
1640 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
1642 MapBlock *block = getBlockNoCreateNoEx(p3d);
1644 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
1649 // N.B. This requires no synchronization, since data will not be modified unless
1650 // the VoxelManipulator being updated belongs to the same thread.
1651 void ServerMap::updateVManip(v3s16 pos)
1653 Mapgen *mg = m_emerge->getCurrentMapgen();
1657 MMVManip *vm = mg->vm;
1661 if (!vm->m_area.contains(pos))
1664 s32 idx = vm->m_area.index(pos);
1665 vm->m_data[idx] = getNodeNoEx(pos);
1666 vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
1668 vm->m_is_dirty = true;
1671 s16 ServerMap::findGroundLevel(v2s16 p2d)
1675 Uh, just do something random...
1677 // Find existing map from top to down
1680 v3s16 p(p2d.X, max, p2d.Y);
1681 for(; p.Y>min; p.Y--)
1683 MapNode n = getNodeNoEx(p);
1684 if(n.getContent() != CONTENT_IGNORE)
1689 // If this node is not air, go to plan b
1690 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
1692 // Search existing walkable and return it
1693 for(; p.Y>min; p.Y--)
1695 MapNode n = getNodeNoEx(p);
1696 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
1705 Determine from map generator noise functions
1708 s16 level = m_emerge->getGroundLevelAtPoint(p2d);
1711 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
1712 //return (s16)level;
1715 bool ServerMap::loadFromFolders() {
1716 if (!dbase->initialized() &&
1717 !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
1722 void ServerMap::createDirs(std::string path)
1724 if (!fs::CreateAllDirs(path)) {
1725 m_dout<<"ServerMap: Failed to create directory "
1726 <<"\""<<path<<"\""<<std::endl;
1727 throw BaseException("ServerMap failed to create directory");
1731 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
1737 snprintf(cc, 9, "%.4x%.4x",
1738 (unsigned int) pos.X & 0xffff,
1739 (unsigned int) pos.Y & 0xffff);
1741 return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
1743 snprintf(cc, 9, (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
1744 (unsigned int) pos.X & 0xfff,
1745 (unsigned int) pos.Y & 0xfff);
1747 return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
1754 v2s16 ServerMap::getSectorPos(const std::string &dirname)
1756 unsigned int x = 0, y = 0;
1758 std::string component;
1759 fs::RemoveLastPathComponent(dirname, &component, 1);
1760 if(component.size() == 8)
1763 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
1765 else if(component.size() == 3)
1768 fs::RemoveLastPathComponent(dirname, &component, 2);
1769 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
1770 // Sign-extend the 12 bit values up to 16 bits...
1771 if(x & 0x800) x |= 0xF000;
1772 if(y & 0x800) y |= 0xF000;
1779 FATAL_ERROR_IF(r != 2, "getSectorPos()");
1780 v2s16 pos((s16)x, (s16)y);
1784 v3s16 ServerMap::getBlockPos(const std::string §ordir, const std::string &blockfile)
1786 v2s16 p2d = getSectorPos(sectordir);
1788 if(blockfile.size() != 4){
1789 throw InvalidFilenameException("Invalid block filename");
1792 int r = sscanf(blockfile.c_str(), "%4x", &y);
1794 throw InvalidFilenameException("Invalid block filename");
1795 return v3s16(p2d.X, y, p2d.Y);
1798 std::string ServerMap::getBlockFilename(v3s16 p)
1801 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
1805 void ServerMap::save(ModifiedState save_level)
1807 if (!m_map_saving_enabled) {
1808 warningstream<<"Not saving map, saving disabled."<<std::endl;
1812 if(save_level == MOD_STATE_CLEAN)
1813 infostream<<"ServerMap: Saving whole map, this can take time."
1816 if (m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
1817 if (settings_mgr.saveMapMeta())
1818 m_map_metadata_changed = false;
1821 // Profile modified reasons
1822 Profiler modprofiler;
1824 u32 block_count = 0;
1825 u32 block_count_all = 0; // Number of blocks in memory
1827 // Don't do anything with sqlite unless something is really saved
1828 bool save_started = false;
1830 for (auto §or_it : m_sectors) {
1831 MapSector *sector = sector_it.second;
1833 MapBlockVect blocks;
1834 sector->getBlocks(blocks);
1836 for (MapBlock *block : blocks) {
1839 if(block->getModified() >= (u32)save_level) {
1843 save_started = true;
1846 modprofiler.add(block->getModifiedReasonString(), 1);
1858 Only print if something happened or saved whole map
1860 if(save_level == MOD_STATE_CLEAN
1861 || block_count != 0) {
1862 infostream<<"ServerMap: Written: "
1863 <<block_count<<" block files"
1864 <<", "<<block_count_all<<" blocks in memory."
1866 PrintInfo(infostream); // ServerMap/ClientMap:
1867 infostream<<"Blocks modified by: "<<std::endl;
1868 modprofiler.print(infostream);
1872 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
1874 if (loadFromFolders()) {
1875 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
1876 << "all blocks that are stored in flat files." << std::endl;
1878 dbase->listAllLoadableBlocks(dst);
1881 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
1883 for (auto §or_it : m_sectors) {
1884 MapSector *sector = sector_it.second;
1886 MapBlockVect blocks;
1887 sector->getBlocks(blocks);
1889 for (MapBlock *block : blocks) {
1890 v3s16 p = block->getPos();
1896 MapDatabase *ServerMap::createDatabase(
1897 const std::string &name,
1898 const std::string &savedir,
1901 if (name == "sqlite3")
1902 return new MapDatabaseSQLite3(savedir);
1903 if (name == "dummy")
1904 return new Database_Dummy();
1906 if (name == "leveldb")
1907 return new Database_LevelDB(savedir);
1910 if (name == "redis")
1911 return new Database_Redis(conf);
1914 if (name == "postgresql") {
1915 std::string connect_string;
1916 conf.getNoEx("pgsql_connection", connect_string);
1917 return new MapDatabasePostgreSQL(connect_string);
1921 throw BaseException(std::string("Database backend ") + name + " not supported.");
1924 void ServerMap::beginSave()
1929 void ServerMap::endSave()
1934 bool ServerMap::saveBlock(MapBlock *block)
1936 return saveBlock(block, dbase);
1939 bool ServerMap::saveBlock(MapBlock *block, MapDatabase *db)
1941 v3s16 p3d = block->getPos();
1943 // Dummy blocks are not written
1944 if (block->isDummy()) {
1945 warningstream << "saveBlock: Not writing dummy block "
1946 << PP(p3d) << std::endl;
1950 // Format used for writing
1951 u8 version = SER_FMT_VER_HIGHEST_WRITE;
1954 [0] u8 serialization version
1957 std::ostringstream o(std::ios_base::binary);
1958 o.write((char*) &version, 1);
1959 block->serialize(o, version, true);
1961 bool ret = db->saveBlock(p3d, o.str());
1963 // We just wrote it to the disk so clear modified flag
1964 block->resetModified();
1969 void ServerMap::loadBlock(const std::string §ordir, const std::string &blockfile,
1970 MapSector *sector, bool save_after_load)
1972 std::string fullpath = sectordir + DIR_DELIM + blockfile;
1974 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
1976 throw FileNotGoodException("Cannot open block file");
1978 v3s16 p3d = getBlockPos(sectordir, blockfile);
1979 v2s16 p2d(p3d.X, p3d.Z);
1981 assert(sector->getPos() == p2d);
1983 u8 version = SER_FMT_VER_INVALID;
1984 is.read((char*)&version, 1);
1987 throw SerializationError("ServerMap::loadBlock(): Failed"
1988 " to read MapBlock version");
1990 /*u32 block_size = MapBlock::serializedLength(version);
1991 SharedBuffer<u8> data(block_size);
1992 is.read((char*)*data, block_size);*/
1994 // This will always return a sector because we're the server
1995 //MapSector *sector = emergeSector(p2d);
1997 MapBlock *block = NULL;
1998 bool created_new = false;
1999 block = sector->getBlockNoCreateNoEx(p3d.Y);
2002 block = sector->createBlankBlockNoInsert(p3d.Y);
2007 block->deSerialize(is, version, true);
2009 // If it's a new block, insert it to the map
2011 sector->insertBlock(block);
2012 ReflowScan scanner(this, m_emerge->ndef);
2013 scanner.scan(block, &m_transforming_liquid);
2017 Save blocks loaded in old format in new format
2020 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
2024 // Should be in database now, so delete the old file
2025 fs::RecursiveDelete(fullpath);
2028 // We just loaded it from the disk, so it's up-to-date.
2029 block->resetModified();
2032 catch(SerializationError &e)
2034 warningstream<<"Invalid block data on disk "
2035 <<"fullpath="<<fullpath
2036 <<" (SerializationError). "
2037 <<"what()="<<e.what()
2039 // Ignoring. A new one will be generated.
2042 // TODO: Backup file; name is in fullpath.
2046 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
2049 std::istringstream is(*blob, std::ios_base::binary);
2051 u8 version = SER_FMT_VER_INVALID;
2052 is.read((char*)&version, 1);
2055 throw SerializationError("ServerMap::loadBlock(): Failed"
2056 " to read MapBlock version");
2058 MapBlock *block = NULL;
2059 bool created_new = false;
2060 block = sector->getBlockNoCreateNoEx(p3d.Y);
2063 block = sector->createBlankBlockNoInsert(p3d.Y);
2068 block->deSerialize(is, version, true);
2070 // If it's a new block, insert it to the map
2072 sector->insertBlock(block);
2073 ReflowScan scanner(this, m_emerge->ndef);
2074 scanner.scan(block, &m_transforming_liquid);
2078 Save blocks loaded in old format in new format
2081 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
2082 // Only save if asked to; no need to update version
2086 // We just loaded it from, so it's up-to-date.
2087 block->resetModified();
2089 catch(SerializationError &e)
2091 errorstream<<"Invalid block data in database"
2092 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
2093 <<" (SerializationError): "<<e.what()<<std::endl;
2095 // TODO: Block should be marked as invalid in memory so that it is
2096 // not touched but the game can run
2098 if(g_settings->getBool("ignore_world_load_errors")){
2099 errorstream<<"Ignoring block load error. Duck and cover! "
2100 <<"(ignore_world_load_errors)"<<std::endl;
2102 throw SerializationError("Invalid block data in database");
2107 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
2109 bool created_new = (getBlockNoCreateNoEx(blockpos) == NULL);
2111 v2s16 p2d(blockpos.X, blockpos.Z);
2114 dbase->loadBlock(blockpos, &ret);
2116 loadBlock(&ret, blockpos, createSector(p2d), false);
2118 // Not found in database, try the files
2120 // The directory layout we're going to load from.
2121 // 1 - original sectors/xxxxzzzz/
2122 // 2 - new sectors2/xxx/zzz/
2123 // If we load from anything but the latest structure, we will
2124 // immediately save to the new one, and remove the old.
2125 std::string sectordir1 = getSectorDir(p2d, 1);
2126 std::string sectordir;
2127 if (fs::PathExists(sectordir1)) {
2128 sectordir = sectordir1;
2130 sectordir = getSectorDir(p2d, 2);
2134 Make sure sector is loaded
2137 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2140 Make sure file exists
2143 std::string blockfilename = getBlockFilename(blockpos);
2144 if (!fs::PathExists(sectordir + DIR_DELIM + blockfilename))
2148 Load block and save it to the database
2150 loadBlock(sectordir, blockfilename, sector, true);
2153 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2154 if (created_new && (block != NULL)) {
2155 std::map<v3s16, MapBlock*> modified_blocks;
2156 // Fix lighting if necessary
2157 voxalgo::update_block_border_lighting(this, block, modified_blocks);
2158 if (!modified_blocks.empty()) {
2159 //Modified lighting, send event
2161 event.type = MEET_OTHER;
2162 std::map<v3s16, MapBlock *>::iterator it;
2163 for (it = modified_blocks.begin();
2164 it != modified_blocks.end(); ++it)
2165 event.modified_blocks.insert(it->first);
2166 dispatchEvent(&event);
2172 bool ServerMap::deleteBlock(v3s16 blockpos)
2174 if (!dbase->deleteBlock(blockpos))
2177 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2179 v2s16 p2d(blockpos.X, blockpos.Z);
2180 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2183 sector->deleteBlock(block);
2189 void ServerMap::PrintInfo(std::ostream &out)
2194 bool ServerMap::repairBlockLight(v3s16 blockpos,
2195 std::map<v3s16, MapBlock *> *modified_blocks)
2197 MapBlock *block = emergeBlock(blockpos, false);
2198 if (!block || !block->isGenerated())
2200 voxalgo::repair_block_light(this, block, modified_blocks);
2204 MMVManip::MMVManip(Map *map):
2210 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
2211 bool load_if_inexistent)
2213 TimeTaker timer1("initialEmerge", &emerge_time);
2215 // Units of these are MapBlocks
2216 v3s16 p_min = blockpos_min;
2217 v3s16 p_max = blockpos_max;
2219 VoxelArea block_area_nodes
2220 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2222 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
2225 infostream<<"initialEmerge: area: ";
2226 block_area_nodes.print(infostream);
2227 infostream<<" ("<<size_MB<<"MB)";
2228 infostream<<std::endl;
2231 addArea(block_area_nodes);
2233 for(s32 z=p_min.Z; z<=p_max.Z; z++)
2234 for(s32 y=p_min.Y; y<=p_max.Y; y++)
2235 for(s32 x=p_min.X; x<=p_max.X; x++)
2240 std::map<v3s16, u8>::iterator n;
2241 n = m_loaded_blocks.find(p);
2242 if(n != m_loaded_blocks.end())
2245 bool block_data_inexistent = false;
2248 TimeTaker timer1("emerge load", &emerge_load_time);
2250 block = m_map->getBlockNoCreate(p);
2251 if(block->isDummy())
2252 block_data_inexistent = true;
2254 block->copyTo(*this);
2256 catch(InvalidPositionException &e)
2258 block_data_inexistent = true;
2261 if(block_data_inexistent)
2264 if (load_if_inexistent && !blockpos_over_max_limit(p)) {
2265 ServerMap *svrmap = (ServerMap *)m_map;
2266 block = svrmap->emergeBlock(p, false);
2268 block = svrmap->createBlock(p);
2269 block->copyTo(*this);
2271 flags |= VMANIP_BLOCK_DATA_INEXIST;
2274 Mark area inexistent
2276 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2277 // Fill with VOXELFLAG_NO_DATA
2278 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
2279 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
2281 s32 i = m_area.index(a.MinEdge.X,y,z);
2282 memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
2286 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
2288 // Mark that block was loaded as blank
2289 flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
2292 m_loaded_blocks[p] = flags;
2298 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
2299 bool overwrite_generated)
2301 if(m_area.getExtent() == v3s16(0,0,0))
2305 Copy data of all blocks
2307 for (auto &loaded_block : m_loaded_blocks) {
2308 v3s16 p = loaded_block.first;
2309 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
2310 bool existed = !(loaded_block.second & VMANIP_BLOCK_DATA_INEXIST);
2311 if (!existed || (block == NULL) ||
2312 (!overwrite_generated && block->isGenerated()))
2315 block->copyFrom(*this);
2316 block->raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_VMANIP);
2319 (*modified_blocks)[p] = block;