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
515 enum NeighborType : u8 {
521 struct NodeNeighbor {
527 : n(CONTENT_AIR), t(NEIGHBOR_SAME_LEVEL)
530 NodeNeighbor(const MapNode &node, NeighborType n_type, const v3s16 &pos)
537 void Map::transforming_liquid_add(v3s16 p) {
538 m_transforming_liquid.push_back(p);
541 void Map::transformLiquids(std::map<v3s16, MapBlock*> &modified_blocks,
542 ServerEnvironment *env)
545 u32 initial_size = m_transforming_liquid.size();
547 /*if(initial_size != 0)
548 infostream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
550 // list of nodes that due to viscosity have not reached their max level height
551 std::deque<v3s16> must_reflow;
553 std::vector<std::pair<v3s16, MapNode> > changed_nodes;
555 u32 liquid_loop_max = g_settings->getS32("liquid_loop_max");
556 u32 loop_max = liquid_loop_max;
560 /* If liquid_loop_max is not keeping up with the queue size increase
561 * loop_max up to a maximum of liquid_loop_max * dedicated_server_step.
563 if (m_transforming_liquid.size() > loop_max * 2) {
565 float server_step = g_settings->getFloat("dedicated_server_step");
566 if (m_transforming_liquid_loop_count_multiplier - 1.0 < server_step)
567 m_transforming_liquid_loop_count_multiplier *= 1.0 + server_step / 10;
569 m_transforming_liquid_loop_count_multiplier = 1.0;
572 loop_max *= m_transforming_liquid_loop_count_multiplier;
575 while (m_transforming_liquid.size() != 0)
577 // This should be done here so that it is done when continue is used
578 if (loopcount >= initial_size || loopcount >= loop_max)
583 Get a queued transforming liquid node
585 v3s16 p0 = m_transforming_liquid.front();
586 m_transforming_liquid.pop_front();
588 MapNode n0 = getNodeNoEx(p0);
591 Collect information about current node
593 s8 liquid_level = -1;
594 // The liquid node which will be placed there if
595 // the liquid flows into this node.
596 content_t liquid_kind = CONTENT_IGNORE;
597 // The node which will be placed there if liquid
598 // can't flow into this node.
599 content_t floodable_node = CONTENT_AIR;
600 const ContentFeatures &cf = m_nodedef->get(n0);
601 LiquidType liquid_type = cf.liquid_type;
602 switch (liquid_type) {
604 liquid_level = LIQUID_LEVEL_SOURCE;
605 liquid_kind = m_nodedef->getId(cf.liquid_alternative_flowing);
608 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
609 liquid_kind = n0.getContent();
612 // if this node is 'floodable', it *could* be transformed
613 // into a liquid, otherwise, continue with the next node.
616 floodable_node = n0.getContent();
617 liquid_kind = CONTENT_AIR;
622 Collect information about the environment
624 const v3s16 *dirs = g_6dirs;
625 NodeNeighbor sources[6]; // surrounding sources
627 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
629 NodeNeighbor airs[6]; // surrounding air
631 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
632 int num_neutrals = 0;
633 bool flowing_down = false;
634 bool ignored_sources = false;
635 for (u16 i = 0; i < 6; i++) {
636 NeighborType nt = NEIGHBOR_SAME_LEVEL;
647 v3s16 npos = p0 + dirs[i];
648 NodeNeighbor nb(getNodeNoEx(npos), nt, npos);
649 const ContentFeatures &cfnb = m_nodedef->get(nb.n);
650 switch (m_nodedef->get(nb.n.getContent()).liquid_type) {
652 if (cfnb.floodable) {
653 airs[num_airs++] = nb;
654 // if the current node is a water source the neighbor
655 // should be enqueded for transformation regardless of whether the
656 // current node changes or not.
657 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
658 m_transforming_liquid.push_back(npos);
659 // if the current node happens to be a flowing node, it will start to flow down here.
660 if (nb.t == NEIGHBOR_LOWER)
663 neutrals[num_neutrals++] = nb;
664 if (nb.n.getContent() == CONTENT_IGNORE) {
665 // If node below is ignore prevent water from
666 // spreading outwards and otherwise prevent from
667 // flowing away as ignore node might be the source
668 if (nb.t == NEIGHBOR_LOWER)
671 ignored_sources = true;
676 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
677 if (liquid_kind == CONTENT_AIR)
678 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
679 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
680 neutrals[num_neutrals++] = nb;
682 // Do not count bottom source, it will screw things up
684 sources[num_sources++] = nb;
688 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
689 if (liquid_kind == CONTENT_AIR)
690 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
691 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
692 neutrals[num_neutrals++] = nb;
694 flows[num_flows++] = nb;
695 if (nb.t == NEIGHBOR_LOWER)
703 decide on the type (and possibly level) of the current node
705 content_t new_node_content;
706 s8 new_node_level = -1;
707 s8 max_node_level = -1;
709 u8 range = m_nodedef->get(liquid_kind).liquid_range;
710 if (range > LIQUID_LEVEL_MAX + 1)
711 range = LIQUID_LEVEL_MAX + 1;
713 if ((num_sources >= 2 && m_nodedef->get(liquid_kind).liquid_renewable) || liquid_type == LIQUID_SOURCE) {
714 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
715 // or the flowing alternative of the first of the surrounding sources (if it's air), so
716 // it's perfectly safe to use liquid_kind here to determine the new node content.
717 new_node_content = m_nodedef->getId(m_nodedef->get(liquid_kind).liquid_alternative_source);
718 } else if (num_sources >= 1 && sources[0].t != NEIGHBOR_LOWER) {
719 // liquid_kind is set properly, see above
720 max_node_level = new_node_level = LIQUID_LEVEL_MAX;
721 if (new_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
722 new_node_content = liquid_kind;
724 new_node_content = floodable_node;
725 } else if (ignored_sources && liquid_level >= 0) {
726 // Maybe there are neighbouring sources that aren't loaded yet
727 // so prevent flowing away.
728 new_node_level = liquid_level;
729 new_node_content = liquid_kind;
731 // no surrounding sources, so get the maximum level that can flow into this node
732 for (u16 i = 0; i < num_flows; i++) {
733 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
734 switch (flows[i].t) {
736 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
737 max_node_level = LIQUID_LEVEL_MAX;
738 if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
739 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
740 } else if (nb_liquid_level > max_node_level) {
741 max_node_level = nb_liquid_level;
746 case NEIGHBOR_SAME_LEVEL:
747 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
748 nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level)
749 max_node_level = nb_liquid_level - 1;
754 u8 viscosity = m_nodedef->get(liquid_kind).liquid_viscosity;
755 if (viscosity > 1 && max_node_level != liquid_level) {
756 // amount to gain, limited by viscosity
757 // must be at least 1 in absolute value
758 s8 level_inc = max_node_level - liquid_level;
759 if (level_inc < -viscosity || level_inc > viscosity)
760 new_node_level = liquid_level + level_inc/viscosity;
761 else if (level_inc < 0)
762 new_node_level = liquid_level - 1;
763 else if (level_inc > 0)
764 new_node_level = liquid_level + 1;
765 if (new_node_level != max_node_level)
766 must_reflow.push_back(p0);
768 new_node_level = max_node_level;
771 if (max_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
772 new_node_content = liquid_kind;
774 new_node_content = floodable_node;
779 check if anything has changed. if not, just continue with the next node.
781 if (new_node_content == n0.getContent() &&
782 (m_nodedef->get(n0.getContent()).liquid_type != LIQUID_FLOWING ||
783 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
784 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
790 update the current node
793 //bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
794 if (m_nodedef->get(new_node_content).liquid_type == LIQUID_FLOWING) {
795 // set level to last 3 bits, flowing down bit to 4th bit
796 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
798 // set the liquid level and flow bit to 0
799 n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
803 n0.setContent(new_node_content);
805 // on_flood() the node
806 if (floodable_node != CONTENT_AIR) {
807 if (env->getScriptIface()->node_on_flood(p0, n00, n0))
811 // Ignore light (because calling voxalgo::update_lighting_nodes)
812 n0.setLight(LIGHTBANK_DAY, 0, m_nodedef);
813 n0.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
815 // Find out whether there is a suspect for this action
817 if (m_gamedef->rollback())
818 suspect = m_gamedef->rollback()->getSuspect(p0, 83, 1);
820 if (m_gamedef->rollback() && !suspect.empty()) {
822 RollbackScopeActor rollback_scope(m_gamedef->rollback(), suspect, true);
823 // Get old node for rollback
824 RollbackNode rollback_oldnode(this, p0, m_gamedef);
828 RollbackNode rollback_newnode(this, p0, m_gamedef);
829 RollbackAction action;
830 action.setSetNode(p0, rollback_oldnode, rollback_newnode);
831 m_gamedef->rollback()->reportAction(action);
837 v3s16 blockpos = getNodeBlockPos(p0);
838 MapBlock *block = getBlockNoCreateNoEx(blockpos);
840 modified_blocks[blockpos] = block;
841 changed_nodes.emplace_back(p0, n00);
845 enqueue neighbors for update if neccessary
847 switch (m_nodedef->get(n0.getContent()).liquid_type) {
850 // make sure source flows into all neighboring nodes
851 for (u16 i = 0; i < num_flows; i++)
852 if (flows[i].t != NEIGHBOR_UPPER)
853 m_transforming_liquid.push_back(flows[i].p);
854 for (u16 i = 0; i < num_airs; i++)
855 if (airs[i].t != NEIGHBOR_UPPER)
856 m_transforming_liquid.push_back(airs[i].p);
859 // this flow has turned to air; neighboring flows might need to do the same
860 for (u16 i = 0; i < num_flows; i++)
861 m_transforming_liquid.push_back(flows[i].p);
865 //infostream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
867 for (auto &iter : must_reflow)
868 m_transforming_liquid.push_back(iter);
870 voxalgo::update_lighting_nodes(this, changed_nodes, modified_blocks);
873 /* ----------------------------------------------------------------------
874 * Manage the queue so that it does not grow indefinately
876 u16 time_until_purge = g_settings->getU16("liquid_queue_purge_time");
878 if (time_until_purge == 0)
879 return; // Feature disabled
881 time_until_purge *= 1000; // seconds -> milliseconds
883 u64 curr_time = porting::getTimeMs();
884 u32 prev_unprocessed = m_unprocessed_count;
885 m_unprocessed_count = m_transforming_liquid.size();
887 // if unprocessed block count is decreasing or stable
888 if (m_unprocessed_count <= prev_unprocessed) {
889 m_queue_size_timer_started = false;
891 if (!m_queue_size_timer_started)
892 m_inc_trending_up_start_time = curr_time;
893 m_queue_size_timer_started = true;
896 // Account for curr_time overflowing
897 if (m_queue_size_timer_started && m_inc_trending_up_start_time > curr_time)
898 m_queue_size_timer_started = false;
900 /* If the queue has been growing for more than liquid_queue_purge_time seconds
901 * and the number of unprocessed blocks is still > liquid_loop_max then we
902 * cannot keep up; dump the oldest blocks from the queue so that the queue
903 * has liquid_loop_max items in it
905 if (m_queue_size_timer_started
906 && curr_time - m_inc_trending_up_start_time > time_until_purge
907 && m_unprocessed_count > liquid_loop_max) {
909 size_t dump_qty = m_unprocessed_count - liquid_loop_max;
911 infostream << "transformLiquids(): DUMPING " << dump_qty
912 << " blocks from the queue" << std::endl;
915 m_transforming_liquid.pop_front();
917 m_queue_size_timer_started = false; // optimistically assume we can keep up now
918 m_unprocessed_count = m_transforming_liquid.size();
922 std::vector<v3s16> Map::findNodesWithMetadata(v3s16 p1, v3s16 p2)
924 std::vector<v3s16> positions_with_meta;
926 sortBoxVerticies(p1, p2);
927 v3s16 bpmin = getNodeBlockPos(p1);
928 v3s16 bpmax = getNodeBlockPos(p2);
930 VoxelArea area(p1, p2);
932 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
933 for (s16 y = bpmin.Y; y <= bpmax.Y; y++)
934 for (s16 x = bpmin.X; x <= bpmax.X; x++) {
935 v3s16 blockpos(x, y, z);
937 MapBlock *block = getBlockNoCreateNoEx(blockpos);
939 verbosestream << "Map::getNodeMetadata(): Need to emerge "
940 << PP(blockpos) << std::endl;
941 block = emergeBlock(blockpos, false);
944 infostream << "WARNING: Map::getNodeMetadata(): Block not found"
949 v3s16 p_base = blockpos * MAP_BLOCKSIZE;
950 std::vector<v3s16> keys = block->m_node_metadata.getAllKeys();
951 for (size_t i = 0; i != keys.size(); i++) {
952 v3s16 p(keys[i] + p_base);
953 if (!area.contains(p))
956 positions_with_meta.push_back(p);
960 return positions_with_meta;
963 NodeMetadata *Map::getNodeMetadata(v3s16 p)
965 v3s16 blockpos = getNodeBlockPos(p);
966 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
967 MapBlock *block = getBlockNoCreateNoEx(blockpos);
969 infostream<<"Map::getNodeMetadata(): Need to emerge "
970 <<PP(blockpos)<<std::endl;
971 block = emergeBlock(blockpos, false);
974 warningstream<<"Map::getNodeMetadata(): Block not found"
978 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
982 bool Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
984 v3s16 blockpos = getNodeBlockPos(p);
985 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
986 MapBlock *block = getBlockNoCreateNoEx(blockpos);
988 infostream<<"Map::setNodeMetadata(): Need to emerge "
989 <<PP(blockpos)<<std::endl;
990 block = emergeBlock(blockpos, false);
993 warningstream<<"Map::setNodeMetadata(): Block not found"
997 block->m_node_metadata.set(p_rel, meta);
1001 void Map::removeNodeMetadata(v3s16 p)
1003 v3s16 blockpos = getNodeBlockPos(p);
1004 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1005 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1008 warningstream<<"Map::removeNodeMetadata(): Block not found"
1012 block->m_node_metadata.remove(p_rel);
1015 NodeTimer Map::getNodeTimer(v3s16 p)
1017 v3s16 blockpos = getNodeBlockPos(p);
1018 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1019 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1021 infostream<<"Map::getNodeTimer(): Need to emerge "
1022 <<PP(blockpos)<<std::endl;
1023 block = emergeBlock(blockpos, false);
1026 warningstream<<"Map::getNodeTimer(): Block not found"
1030 NodeTimer t = block->m_node_timers.get(p_rel);
1031 NodeTimer nt(t.timeout, t.elapsed, p);
1035 void Map::setNodeTimer(const NodeTimer &t)
1037 v3s16 p = t.position;
1038 v3s16 blockpos = getNodeBlockPos(p);
1039 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1040 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1042 infostream<<"Map::setNodeTimer(): Need to emerge "
1043 <<PP(blockpos)<<std::endl;
1044 block = emergeBlock(blockpos, false);
1047 warningstream<<"Map::setNodeTimer(): Block not found"
1051 NodeTimer nt(t.timeout, t.elapsed, p_rel);
1052 block->m_node_timers.set(nt);
1055 void Map::removeNodeTimer(v3s16 p)
1057 v3s16 blockpos = getNodeBlockPos(p);
1058 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1059 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1062 warningstream<<"Map::removeNodeTimer(): Block not found"
1066 block->m_node_timers.remove(p_rel);
1069 bool Map::isOccluded(v3s16 p0, v3s16 p1, float step, float stepfac,
1070 float start_off, float end_off, u32 needed_count)
1072 float d0 = (float)BS * p0.getDistanceFrom(p1);
1074 v3f uf = v3f(u0.X, u0.Y, u0.Z) * BS;
1076 v3f p0f = v3f(p0.X, p0.Y, p0.Z) * BS;
1078 for(float s=start_off; s<d0+end_off; s+=step){
1079 v3f pf = p0f + uf * s;
1080 v3s16 p = floatToInt(pf, BS);
1081 MapNode n = getNodeNoEx(p);
1082 const ContentFeatures &f = m_nodedef->get(n);
1083 if(f.drawtype == NDT_NORMAL){
1084 // not transparent, see ContentFeature::updateTextures
1086 if(count >= needed_count)
1094 bool Map::isBlockOccluded(MapBlock *block, v3s16 cam_pos_nodes) {
1095 v3s16 cpn = block->getPos() * MAP_BLOCKSIZE;
1096 cpn += v3s16(MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2);
1097 float step = BS * 1;
1098 float stepfac = 1.1;
1099 float startoff = BS * 1;
1100 // The occlusion search of 'isOccluded()' must stop short of the target
1101 // point by distance 'endoff' (end offset) to not enter the target mapblock.
1102 // For the 8 mapblock corners 'endoff' must therefore be the maximum diagonal
1103 // of a mapblock, because we must consider all view angles.
1104 // sqrt(1^2 + 1^2 + 1^2) = 1.732
1105 float endoff = -BS * MAP_BLOCKSIZE * 1.732050807569;
1106 s16 bs2 = MAP_BLOCKSIZE / 2 + 1;
1107 // to reduce the likelihood of falsely occluded blocks
1108 // require at least two solid blocks
1109 // this is a HACK, we should think of a more precise algorithm
1110 u32 needed_count = 2;
1113 // For the central point of the mapblock 'endoff' can be halved
1114 isOccluded(cam_pos_nodes, cpn,
1115 step, stepfac, startoff, endoff / 2.0f, needed_count) &&
1116 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,bs2),
1117 step, stepfac, startoff, endoff, 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));
1137 ServerMap::ServerMap(const std::string &savedir, IGameDef *gamedef,
1138 EmergeManager *emerge):
1139 Map(dout_server, gamedef),
1140 settings_mgr(g_settings, savedir + DIR_DELIM + "map_meta.txt"),
1143 verbosestream<<FUNCTION_NAME<<std::endl;
1145 // Tell the EmergeManager about our MapSettingsManager
1146 emerge->map_settings_mgr = &settings_mgr;
1149 Try to load map; if not found, create a new one.
1152 // Determine which database backend to use
1153 std::string conf_path = savedir + DIR_DELIM + "world.mt";
1155 bool succeeded = conf.readConfigFile(conf_path.c_str());
1156 if (!succeeded || !conf.exists("backend")) {
1157 // fall back to sqlite3
1158 conf.set("backend", "sqlite3");
1160 std::string backend = conf.get("backend");
1161 dbase = createDatabase(backend, savedir, conf);
1163 if (!conf.updateConfigFile(conf_path.c_str()))
1164 errorstream << "ServerMap::ServerMap(): Failed to update world.mt!" << std::endl;
1166 m_savedir = savedir;
1167 m_map_saving_enabled = false;
1170 // If directory exists, check contents and load if possible
1171 if (fs::PathExists(m_savedir)) {
1172 // If directory is empty, it is safe to save into it.
1173 if (fs::GetDirListing(m_savedir).empty()) {
1174 infostream<<"ServerMap: Empty save directory is valid."
1176 m_map_saving_enabled = true;
1181 if (settings_mgr.loadMapMeta()) {
1182 infostream << "ServerMap: Metadata loaded from "
1183 << savedir << std::endl;
1185 infostream << "ServerMap: Metadata could not be loaded "
1186 "from " << savedir << ", assuming valid save "
1187 "directory." << std::endl;
1190 m_map_saving_enabled = true;
1191 // Map loaded, not creating new one
1195 // If directory doesn't exist, it is safe to save to it
1197 m_map_saving_enabled = true;
1200 catch(std::exception &e)
1202 warningstream<<"ServerMap: Failed to load map from "<<savedir
1203 <<", exception: "<<e.what()<<std::endl;
1204 infostream<<"Please remove the map or fix it."<<std::endl;
1205 warningstream<<"Map saving will be disabled."<<std::endl;
1209 ServerMap::~ServerMap()
1211 verbosestream<<FUNCTION_NAME<<std::endl;
1215 if (m_map_saving_enabled) {
1216 // Save only changed parts
1217 save(MOD_STATE_WRITE_AT_UNLOAD);
1218 infostream << "ServerMap: Saved map to " << m_savedir << std::endl;
1220 infostream << "ServerMap: Map not saved" << std::endl;
1223 catch(std::exception &e)
1225 infostream<<"ServerMap: Failed to save map to "<<m_savedir
1226 <<", exception: "<<e.what()<<std::endl;
1230 Close database if it was opened
1238 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1239 for(; i.atEnd() == false; i++)
1241 MapChunk *chunk = i.getNode()->getValue();
1247 MapgenParams *ServerMap::getMapgenParams()
1249 // getMapgenParams() should only ever be called after Server is initialized
1250 assert(settings_mgr.mapgen_params != NULL);
1251 return settings_mgr.mapgen_params;
1254 u64 ServerMap::getSeed()
1256 return getMapgenParams()->seed;
1259 s16 ServerMap::getWaterLevel()
1261 return getMapgenParams()->water_level;
1264 bool ServerMap::blockpos_over_mapgen_limit(v3s16 p)
1266 const s16 mapgen_limit_bp = rangelim(
1267 getMapgenParams()->mapgen_limit, 0, MAX_MAP_GENERATION_LIMIT) /
1269 return p.X < -mapgen_limit_bp ||
1270 p.X > mapgen_limit_bp ||
1271 p.Y < -mapgen_limit_bp ||
1272 p.Y > mapgen_limit_bp ||
1273 p.Z < -mapgen_limit_bp ||
1274 p.Z > mapgen_limit_bp;
1277 bool ServerMap::initBlockMake(v3s16 blockpos, BlockMakeData *data)
1279 s16 csize = getMapgenParams()->chunksize;
1280 v3s16 bpmin = EmergeManager::getContainingChunk(blockpos, csize);
1281 v3s16 bpmax = bpmin + v3s16(1, 1, 1) * (csize - 1);
1283 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1284 EMERGE_DBG_OUT("initBlockMake(): " PP(bpmin) " - " PP(bpmax));
1286 v3s16 extra_borders(1, 1, 1);
1287 v3s16 full_bpmin = bpmin - extra_borders;
1288 v3s16 full_bpmax = bpmax + extra_borders;
1290 // Do nothing if not inside mapgen limits (+-1 because of neighbors)
1291 if (blockpos_over_mapgen_limit(full_bpmin) ||
1292 blockpos_over_mapgen_limit(full_bpmax))
1295 data->seed = getSeed();
1296 data->blockpos_min = bpmin;
1297 data->blockpos_max = bpmax;
1298 data->blockpos_requested = blockpos;
1299 data->nodedef = m_nodedef;
1302 Create the whole area of this and the neighboring blocks
1304 for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
1305 for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++) {
1306 v2s16 sectorpos(x, z);
1307 // Sector metadata is loaded from disk if not already loaded.
1308 MapSector *sector = createSector(sectorpos);
1309 FATAL_ERROR_IF(sector == NULL, "createSector() failed");
1311 for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
1314 MapBlock *block = emergeBlock(p, false);
1315 if (block == NULL) {
1316 block = createBlock(p);
1318 // Block gets sunlight if this is true.
1319 // Refer to the map generator heuristics.
1320 bool ug = m_emerge->isBlockUnderground(p);
1321 block->setIsUnderground(ug);
1327 Now we have a big empty area.
1329 Make a ManualMapVoxelManipulator that contains this and the
1333 data->vmanip = new MMVManip(this);
1334 data->vmanip->initialEmerge(full_bpmin, full_bpmax);
1336 // Note: we may need this again at some point.
1338 // Ensure none of the blocks to be generated were marked as
1339 // containing CONTENT_IGNORE
1340 for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
1341 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
1342 for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
1343 core::map<v3s16, u8>::Node *n;
1344 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
1347 u8 flags = n->getValue();
1348 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
1355 // Data is ready now.
1359 void ServerMap::finishBlockMake(BlockMakeData *data,
1360 std::map<v3s16, MapBlock*> *changed_blocks)
1362 v3s16 bpmin = data->blockpos_min;
1363 v3s16 bpmax = data->blockpos_max;
1365 v3s16 extra_borders(1, 1, 1);
1367 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1368 EMERGE_DBG_OUT("finishBlockMake(): " PP(bpmin) " - " PP(bpmax));
1371 Blit generated stuff to map
1372 NOTE: blitBackAll adds nearly everything to changed_blocks
1374 data->vmanip->blitBackAll(changed_blocks);
1376 EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()="
1377 << changed_blocks->size());
1380 Copy transforming liquid information
1382 while (data->transforming_liquid.size()) {
1383 m_transforming_liquid.push_back(data->transforming_liquid.front());
1384 data->transforming_liquid.pop_front();
1387 for (auto &changed_block : *changed_blocks) {
1388 MapBlock *block = changed_block.second;
1392 Update day/night difference cache of the MapBlocks
1394 block->expireDayNightDiff();
1396 Set block as modified
1398 block->raiseModified(MOD_STATE_WRITE_NEEDED,
1399 MOD_REASON_EXPIRE_DAYNIGHTDIFF);
1403 Set central blocks as generated
1405 for (s16 x = bpmin.X; x <= bpmax.X; x++)
1406 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
1407 for (s16 y = bpmin.Y; y <= bpmax.Y; y++) {
1408 MapBlock *block = getBlockNoCreateNoEx(v3s16(x, y, z));
1412 block->setGenerated(true);
1416 Save changed parts of map
1417 NOTE: Will be saved later.
1419 //save(MOD_STATE_WRITE_AT_UNLOAD);
1422 MapSector *ServerMap::createSector(v2s16 p2d)
1425 Check if it exists already in memory
1427 MapSector *sector = getSectorNoGenerateNoEx(p2d);
1432 Do not create over max mapgen limit
1434 const s16 max_limit_bp = MAX_MAP_GENERATION_LIMIT / MAP_BLOCKSIZE;
1435 if (p2d.X < -max_limit_bp ||
1436 p2d.X > max_limit_bp ||
1437 p2d.Y < -max_limit_bp ||
1438 p2d.Y > max_limit_bp)
1439 throw InvalidPositionException("createSector(): pos. over max mapgen limit");
1442 Generate blank sector
1445 sector = new MapSector(this, p2d, m_gamedef);
1447 // Sector position on map in nodes
1448 //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
1453 m_sectors[p2d] = sector;
1460 This is a quick-hand function for calling makeBlock().
1462 MapBlock * ServerMap::generateBlock(
1464 std::map<v3s16, MapBlock*> &modified_blocks
1467 bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
1469 TimeTaker timer("generateBlock");
1471 //MapBlock *block = original_dummy;
1473 v2s16 p2d(p.X, p.Z);
1474 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
1477 Do not generate over-limit
1479 if(blockpos_over_limit(p))
1481 infostream<<FUNCTION_NAME<<": Block position over limit"<<std::endl;
1482 throw InvalidPositionException("generateBlock(): pos. over limit");
1486 Create block make data
1489 initBlockMake(&data, p);
1495 TimeTaker t("mapgen::make_block()");
1496 mapgen->makeChunk(&data);
1497 //mapgen::make_block(&data);
1499 if(enable_mapgen_debug_info == false)
1500 t.stop(true); // Hide output
1504 Blit data back on map, update lighting, add mobs and whatever this does
1506 finishBlockMake(&data, modified_blocks);
1511 MapBlock *block = getBlockNoCreateNoEx(p);
1519 bool erroneus_content = false;
1520 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1521 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1522 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1525 MapNode n = block->getNode(p);
1526 if(n.getContent() == CONTENT_IGNORE)
1528 infostream<<"CONTENT_IGNORE at "
1529 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
1531 erroneus_content = true;
1535 if(erroneus_content)
1544 Generate a completely empty block
1548 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1549 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1551 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1554 n.setContent(CONTENT_AIR);
1555 block->setNode(v3s16(x0,y0,z0), n);
1561 if(enable_mapgen_debug_info == false)
1562 timer.stop(true); // Hide output
1568 MapBlock * ServerMap::createBlock(v3s16 p)
1571 Do not create over max mapgen limit
1573 if (blockpos_over_max_limit(p))
1574 throw InvalidPositionException("createBlock(): pos. over max mapgen limit");
1576 v2s16 p2d(p.X, p.Z);
1579 This will create or load a sector if not found in memory.
1580 If block exists on disk, it will be loaded.
1582 NOTE: On old save formats, this will be slow, as it generates
1583 lighting on blocks for them.
1587 sector = createSector(p2d);
1588 } catch (InvalidPositionException &e) {
1589 infostream<<"createBlock: createSector() failed"<<std::endl;
1594 Try to get a block from the sector
1597 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
1599 if(block->isDummy())
1604 block = sector->createBlankBlock(block_y);
1609 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
1612 MapBlock *block = getBlockNoCreateNoEx(p);
1613 if (block && !block->isDummy())
1618 MapBlock *block = loadBlock(p);
1624 MapSector *sector = createSector(v2s16(p.X, p.Z));
1625 MapBlock *block = sector->createBlankBlock(p.Y);
1633 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
1635 MapBlock *block = getBlockNoCreateNoEx(p3d);
1637 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
1642 // N.B. This requires no synchronization, since data will not be modified unless
1643 // the VoxelManipulator being updated belongs to the same thread.
1644 void ServerMap::updateVManip(v3s16 pos)
1646 Mapgen *mg = m_emerge->getCurrentMapgen();
1650 MMVManip *vm = mg->vm;
1654 if (!vm->m_area.contains(pos))
1657 s32 idx = vm->m_area.index(pos);
1658 vm->m_data[idx] = getNodeNoEx(pos);
1659 vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
1661 vm->m_is_dirty = true;
1664 s16 ServerMap::findGroundLevel(v2s16 p2d)
1668 Uh, just do something random...
1670 // Find existing map from top to down
1673 v3s16 p(p2d.X, max, p2d.Y);
1674 for(; p.Y>min; p.Y--)
1676 MapNode n = getNodeNoEx(p);
1677 if(n.getContent() != CONTENT_IGNORE)
1682 // If this node is not air, go to plan b
1683 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
1685 // Search existing walkable and return it
1686 for(; p.Y>min; p.Y--)
1688 MapNode n = getNodeNoEx(p);
1689 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
1698 Determine from map generator noise functions
1701 s16 level = m_emerge->getGroundLevelAtPoint(p2d);
1704 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
1705 //return (s16)level;
1708 bool ServerMap::loadFromFolders() {
1709 if (!dbase->initialized() &&
1710 !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
1715 void ServerMap::createDirs(std::string path)
1717 if (!fs::CreateAllDirs(path)) {
1718 m_dout<<"ServerMap: Failed to create directory "
1719 <<"\""<<path<<"\""<<std::endl;
1720 throw BaseException("ServerMap failed to create directory");
1724 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
1730 snprintf(cc, 9, "%.4x%.4x",
1731 (unsigned int) pos.X & 0xffff,
1732 (unsigned int) pos.Y & 0xffff);
1734 return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
1736 snprintf(cc, 9, (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
1737 (unsigned int) pos.X & 0xfff,
1738 (unsigned int) pos.Y & 0xfff);
1740 return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
1747 v2s16 ServerMap::getSectorPos(const std::string &dirname)
1749 unsigned int x = 0, y = 0;
1751 std::string component;
1752 fs::RemoveLastPathComponent(dirname, &component, 1);
1753 if(component.size() == 8)
1756 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
1758 else if(component.size() == 3)
1761 fs::RemoveLastPathComponent(dirname, &component, 2);
1762 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
1763 // Sign-extend the 12 bit values up to 16 bits...
1764 if(x & 0x800) x |= 0xF000;
1765 if(y & 0x800) y |= 0xF000;
1772 FATAL_ERROR_IF(r != 2, "getSectorPos()");
1773 v2s16 pos((s16)x, (s16)y);
1777 v3s16 ServerMap::getBlockPos(const std::string §ordir, const std::string &blockfile)
1779 v2s16 p2d = getSectorPos(sectordir);
1781 if(blockfile.size() != 4){
1782 throw InvalidFilenameException("Invalid block filename");
1785 int r = sscanf(blockfile.c_str(), "%4x", &y);
1787 throw InvalidFilenameException("Invalid block filename");
1788 return v3s16(p2d.X, y, p2d.Y);
1791 std::string ServerMap::getBlockFilename(v3s16 p)
1794 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
1798 void ServerMap::save(ModifiedState save_level)
1800 if (!m_map_saving_enabled) {
1801 warningstream<<"Not saving map, saving disabled."<<std::endl;
1805 if(save_level == MOD_STATE_CLEAN)
1806 infostream<<"ServerMap: Saving whole map, this can take time."
1809 if (m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
1810 if (settings_mgr.saveMapMeta())
1811 m_map_metadata_changed = false;
1814 // Profile modified reasons
1815 Profiler modprofiler;
1817 u32 block_count = 0;
1818 u32 block_count_all = 0; // Number of blocks in memory
1820 // Don't do anything with sqlite unless something is really saved
1821 bool save_started = false;
1823 for (auto §or_it : m_sectors) {
1824 MapSector *sector = sector_it.second;
1826 MapBlockVect blocks;
1827 sector->getBlocks(blocks);
1829 for (MapBlock *block : blocks) {
1832 if(block->getModified() >= (u32)save_level) {
1836 save_started = true;
1839 modprofiler.add(block->getModifiedReasonString(), 1);
1851 Only print if something happened or saved whole map
1853 if(save_level == MOD_STATE_CLEAN
1854 || block_count != 0) {
1855 infostream<<"ServerMap: Written: "
1856 <<block_count<<" block files"
1857 <<", "<<block_count_all<<" blocks in memory."
1859 PrintInfo(infostream); // ServerMap/ClientMap:
1860 infostream<<"Blocks modified by: "<<std::endl;
1861 modprofiler.print(infostream);
1865 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
1867 if (loadFromFolders()) {
1868 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
1869 << "all blocks that are stored in flat files." << std::endl;
1871 dbase->listAllLoadableBlocks(dst);
1874 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
1876 for (auto §or_it : m_sectors) {
1877 MapSector *sector = sector_it.second;
1879 MapBlockVect blocks;
1880 sector->getBlocks(blocks);
1882 for (MapBlock *block : blocks) {
1883 v3s16 p = block->getPos();
1889 MapDatabase *ServerMap::createDatabase(
1890 const std::string &name,
1891 const std::string &savedir,
1894 if (name == "sqlite3")
1895 return new MapDatabaseSQLite3(savedir);
1896 if (name == "dummy")
1897 return new Database_Dummy();
1899 if (name == "leveldb")
1900 return new Database_LevelDB(savedir);
1903 if (name == "redis")
1904 return new Database_Redis(conf);
1907 if (name == "postgresql") {
1908 std::string connect_string;
1909 conf.getNoEx("pgsql_connection", connect_string);
1910 return new MapDatabasePostgreSQL(connect_string);
1914 throw BaseException(std::string("Database backend ") + name + " not supported.");
1917 void ServerMap::beginSave()
1922 void ServerMap::endSave()
1927 bool ServerMap::saveBlock(MapBlock *block)
1929 return saveBlock(block, dbase);
1932 bool ServerMap::saveBlock(MapBlock *block, MapDatabase *db)
1934 v3s16 p3d = block->getPos();
1936 // Dummy blocks are not written
1937 if (block->isDummy()) {
1938 warningstream << "saveBlock: Not writing dummy block "
1939 << PP(p3d) << std::endl;
1943 // Format used for writing
1944 u8 version = SER_FMT_VER_HIGHEST_WRITE;
1947 [0] u8 serialization version
1950 std::ostringstream o(std::ios_base::binary);
1951 o.write((char*) &version, 1);
1952 block->serialize(o, version, true);
1954 bool ret = db->saveBlock(p3d, o.str());
1956 // We just wrote it to the disk so clear modified flag
1957 block->resetModified();
1962 void ServerMap::loadBlock(const std::string §ordir, const std::string &blockfile,
1963 MapSector *sector, bool save_after_load)
1965 std::string fullpath = sectordir + DIR_DELIM + blockfile;
1967 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
1969 throw FileNotGoodException("Cannot open block file");
1971 v3s16 p3d = getBlockPos(sectordir, blockfile);
1972 v2s16 p2d(p3d.X, p3d.Z);
1974 assert(sector->getPos() == p2d);
1976 u8 version = SER_FMT_VER_INVALID;
1977 is.read((char*)&version, 1);
1980 throw SerializationError("ServerMap::loadBlock(): Failed"
1981 " to read MapBlock version");
1983 /*u32 block_size = MapBlock::serializedLength(version);
1984 SharedBuffer<u8> data(block_size);
1985 is.read((char*)*data, block_size);*/
1987 // This will always return a sector because we're the server
1988 //MapSector *sector = emergeSector(p2d);
1990 MapBlock *block = NULL;
1991 bool created_new = false;
1992 block = sector->getBlockNoCreateNoEx(p3d.Y);
1995 block = sector->createBlankBlockNoInsert(p3d.Y);
2000 block->deSerialize(is, version, true);
2002 // If it's a new block, insert it to the map
2004 sector->insertBlock(block);
2005 ReflowScan scanner(this, m_emerge->ndef);
2006 scanner.scan(block, &m_transforming_liquid);
2010 Save blocks loaded in old format in new format
2013 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
2017 // Should be in database now, so delete the old file
2018 fs::RecursiveDelete(fullpath);
2021 // We just loaded it from the disk, so it's up-to-date.
2022 block->resetModified();
2025 catch(SerializationError &e)
2027 warningstream<<"Invalid block data on disk "
2028 <<"fullpath="<<fullpath
2029 <<" (SerializationError). "
2030 <<"what()="<<e.what()
2032 // Ignoring. A new one will be generated.
2035 // TODO: Backup file; name is in fullpath.
2039 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
2042 std::istringstream is(*blob, std::ios_base::binary);
2044 u8 version = SER_FMT_VER_INVALID;
2045 is.read((char*)&version, 1);
2048 throw SerializationError("ServerMap::loadBlock(): Failed"
2049 " to read MapBlock version");
2051 MapBlock *block = NULL;
2052 bool created_new = false;
2053 block = sector->getBlockNoCreateNoEx(p3d.Y);
2056 block = sector->createBlankBlockNoInsert(p3d.Y);
2061 block->deSerialize(is, version, true);
2063 // If it's a new block, insert it to the map
2065 sector->insertBlock(block);
2066 ReflowScan scanner(this, m_emerge->ndef);
2067 scanner.scan(block, &m_transforming_liquid);
2071 Save blocks loaded in old format in new format
2074 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
2075 // Only save if asked to; no need to update version
2079 // We just loaded it from, so it's up-to-date.
2080 block->resetModified();
2082 catch(SerializationError &e)
2084 errorstream<<"Invalid block data in database"
2085 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
2086 <<" (SerializationError): "<<e.what()<<std::endl;
2088 // TODO: Block should be marked as invalid in memory so that it is
2089 // not touched but the game can run
2091 if(g_settings->getBool("ignore_world_load_errors")){
2092 errorstream<<"Ignoring block load error. Duck and cover! "
2093 <<"(ignore_world_load_errors)"<<std::endl;
2095 throw SerializationError("Invalid block data in database");
2100 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
2102 bool created_new = (getBlockNoCreateNoEx(blockpos) == NULL);
2104 v2s16 p2d(blockpos.X, blockpos.Z);
2107 dbase->loadBlock(blockpos, &ret);
2109 loadBlock(&ret, blockpos, createSector(p2d), false);
2111 // Not found in database, try the files
2113 // The directory layout we're going to load from.
2114 // 1 - original sectors/xxxxzzzz/
2115 // 2 - new sectors2/xxx/zzz/
2116 // If we load from anything but the latest structure, we will
2117 // immediately save to the new one, and remove the old.
2118 std::string sectordir1 = getSectorDir(p2d, 1);
2119 std::string sectordir;
2120 if (fs::PathExists(sectordir1)) {
2121 sectordir = sectordir1;
2123 sectordir = getSectorDir(p2d, 2);
2127 Make sure sector is loaded
2130 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2133 Make sure file exists
2136 std::string blockfilename = getBlockFilename(blockpos);
2137 if (!fs::PathExists(sectordir + DIR_DELIM + blockfilename))
2141 Load block and save it to the database
2143 loadBlock(sectordir, blockfilename, sector, true);
2146 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2147 if (created_new && (block != NULL)) {
2148 std::map<v3s16, MapBlock*> modified_blocks;
2149 // Fix lighting if necessary
2150 voxalgo::update_block_border_lighting(this, block, modified_blocks);
2151 if (!modified_blocks.empty()) {
2152 //Modified lighting, send event
2154 event.type = MEET_OTHER;
2155 std::map<v3s16, MapBlock *>::iterator it;
2156 for (it = modified_blocks.begin();
2157 it != modified_blocks.end(); ++it)
2158 event.modified_blocks.insert(it->first);
2159 dispatchEvent(&event);
2165 bool ServerMap::deleteBlock(v3s16 blockpos)
2167 if (!dbase->deleteBlock(blockpos))
2170 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2172 v2s16 p2d(blockpos.X, blockpos.Z);
2173 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2176 sector->deleteBlock(block);
2182 void ServerMap::PrintInfo(std::ostream &out)
2187 bool ServerMap::repairBlockLight(v3s16 blockpos,
2188 std::map<v3s16, MapBlock *> *modified_blocks)
2190 MapBlock *block = emergeBlock(blockpos, false);
2191 if (!block || !block->isGenerated())
2193 voxalgo::repair_block_light(this, block, modified_blocks);
2197 MMVManip::MMVManip(Map *map):
2203 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
2204 bool load_if_inexistent)
2206 TimeTaker timer1("initialEmerge", &emerge_time);
2208 // Units of these are MapBlocks
2209 v3s16 p_min = blockpos_min;
2210 v3s16 p_max = blockpos_max;
2212 VoxelArea block_area_nodes
2213 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2215 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
2218 infostream<<"initialEmerge: area: ";
2219 block_area_nodes.print(infostream);
2220 infostream<<" ("<<size_MB<<"MB)";
2221 infostream<<std::endl;
2224 addArea(block_area_nodes);
2226 for(s32 z=p_min.Z; z<=p_max.Z; z++)
2227 for(s32 y=p_min.Y; y<=p_max.Y; y++)
2228 for(s32 x=p_min.X; x<=p_max.X; x++)
2233 std::map<v3s16, u8>::iterator n;
2234 n = m_loaded_blocks.find(p);
2235 if(n != m_loaded_blocks.end())
2238 bool block_data_inexistent = false;
2241 TimeTaker timer1("emerge load", &emerge_load_time);
2243 block = m_map->getBlockNoCreate(p);
2244 if(block->isDummy())
2245 block_data_inexistent = true;
2247 block->copyTo(*this);
2249 catch(InvalidPositionException &e)
2251 block_data_inexistent = true;
2254 if(block_data_inexistent)
2257 if (load_if_inexistent && !blockpos_over_max_limit(p)) {
2258 ServerMap *svrmap = (ServerMap *)m_map;
2259 block = svrmap->emergeBlock(p, false);
2261 block = svrmap->createBlock(p);
2262 block->copyTo(*this);
2264 flags |= VMANIP_BLOCK_DATA_INEXIST;
2267 Mark area inexistent
2269 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2270 // Fill with VOXELFLAG_NO_DATA
2271 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
2272 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
2274 s32 i = m_area.index(a.MinEdge.X,y,z);
2275 memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
2279 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
2281 // Mark that block was loaded as blank
2282 flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
2285 m_loaded_blocks[p] = flags;
2291 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
2292 bool overwrite_generated)
2294 if(m_area.getExtent() == v3s16(0,0,0))
2298 Copy data of all blocks
2300 for (auto &loaded_block : m_loaded_blocks) {
2301 v3s16 p = loaded_block.first;
2302 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
2303 bool existed = !(loaded_block.second & VMANIP_BLOCK_DATA_INEXIST);
2304 if (!existed || (block == NULL) ||
2305 (!overwrite_generated && block->isGenerated()))
2308 block->copyFrom(*this);
2309 block->raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_VMANIP);
2312 (*modified_blocks)[p] = block;