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::getSectorNoGenerateNoLock(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::getSectorNoGenerate(v2s16 p)
122 return getSectorNoGenerateNoLock(p);
125 MapBlock * Map::getBlockNoCreateNoEx(v3s16 p3d)
127 v2s16 p2d(p3d.X, p3d.Z);
128 MapSector * sector = getSectorNoGenerate(p2d);
131 MapBlock *block = sector->getBlockNoCreateNoEx(p3d.Y);
135 MapBlock * Map::getBlockNoCreate(v3s16 p3d)
137 MapBlock *block = getBlockNoCreateNoEx(p3d);
139 throw InvalidPositionException();
143 bool Map::isNodeUnderground(v3s16 p)
145 v3s16 blockpos = getNodeBlockPos(p);
146 MapBlock *block = getBlockNoCreateNoEx(blockpos);
147 return block && block->getIsUnderground();
150 bool Map::isValidPosition(v3s16 p)
152 v3s16 blockpos = getNodeBlockPos(p);
153 MapBlock *block = getBlockNoCreateNoEx(blockpos);
154 return (block != NULL);
157 // Returns a CONTENT_IGNORE node if not found
158 MapNode Map::getNode(v3s16 p, bool *is_valid_position)
160 v3s16 blockpos = getNodeBlockPos(p);
161 MapBlock *block = getBlockNoCreateNoEx(blockpos);
163 if (is_valid_position != NULL)
164 *is_valid_position = false;
165 return {CONTENT_IGNORE};
168 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
170 MapNode node = block->getNodeNoCheck(relpos, &is_valid_p);
171 if (is_valid_position != NULL)
172 *is_valid_position = is_valid_p;
176 // throws InvalidPositionException if not found
177 void Map::setNode(v3s16 p, MapNode & n)
179 v3s16 blockpos = getNodeBlockPos(p);
180 MapBlock *block = getBlockNoCreate(blockpos);
181 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
182 // Never allow placing CONTENT_IGNORE, it fucks up stuff
183 if(n.getContent() == CONTENT_IGNORE){
185 errorstream<<"Map::setNode(): Not allowing to place CONTENT_IGNORE"
186 <<" while trying to replace \""
187 <<m_nodedef->get(block->getNodeNoCheck(relpos, &temp_bool)).name
188 <<"\" at "<<PP(p)<<" (block "<<PP(blockpos)<<")"<<std::endl;
191 block->setNodeNoCheck(relpos, n);
194 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
195 std::map<v3s16, MapBlock*> &modified_blocks,
196 bool remove_metadata)
198 // Collect old node for rollback
199 RollbackNode rollback_oldnode(this, p, m_gamedef);
201 // This is needed for updating the lighting
202 MapNode oldnode = getNode(p);
204 // Remove node metadata
205 if (remove_metadata) {
206 removeNodeMetadata(p);
209 // Set the node on the map
210 // Ignore light (because calling voxalgo::update_lighting_nodes)
211 n.setLight(LIGHTBANK_DAY, 0, m_nodedef);
212 n.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
216 std::vector<std::pair<v3s16, MapNode> > oldnodes;
217 oldnodes.emplace_back(p, oldnode);
218 voxalgo::update_lighting_nodes(this, oldnodes, modified_blocks);
220 for (auto &modified_block : modified_blocks) {
221 modified_block.second->expireDayNightDiff();
224 // Report for rollback
225 if(m_gamedef->rollback())
227 RollbackNode rollback_newnode(this, p, m_gamedef);
228 RollbackAction action;
229 action.setSetNode(p, rollback_oldnode, rollback_newnode);
230 m_gamedef->rollback()->reportAction(action);
234 Add neighboring liquid nodes and this node to transform queue.
235 (it's vital for the node itself to get updated last, if it was removed.)
238 for (const v3s16 &dir : g_7dirs) {
241 bool is_valid_position;
242 MapNode n2 = getNode(p2, &is_valid_position);
243 if(is_valid_position &&
244 (m_nodedef->get(n2).isLiquid() ||
245 n2.getContent() == CONTENT_AIR))
246 m_transforming_liquid.push_back(p2);
250 void Map::removeNodeAndUpdate(v3s16 p,
251 std::map<v3s16, MapBlock*> &modified_blocks)
253 addNodeAndUpdate(p, MapNode(CONTENT_AIR), modified_blocks, true);
256 bool Map::addNodeWithEvent(v3s16 p, MapNode n, bool remove_metadata)
259 event.type = remove_metadata ? MEET_ADDNODE : MEET_SWAPNODE;
263 bool succeeded = true;
265 std::map<v3s16, MapBlock*> modified_blocks;
266 addNodeAndUpdate(p, n, modified_blocks, remove_metadata);
268 // Copy modified_blocks to event
269 for (auto &modified_block : modified_blocks) {
270 event.modified_blocks.insert(modified_block.first);
273 catch(InvalidPositionException &e){
277 dispatchEvent(&event);
282 bool Map::removeNodeWithEvent(v3s16 p)
285 event.type = MEET_REMOVENODE;
288 bool succeeded = true;
290 std::map<v3s16, MapBlock*> modified_blocks;
291 removeNodeAndUpdate(p, modified_blocks);
293 // Copy modified_blocks to event
294 for (auto &modified_block : modified_blocks) {
295 event.modified_blocks.insert(modified_block.first);
298 catch(InvalidPositionException &e){
302 dispatchEvent(&event);
307 struct TimeOrderedMapBlock {
311 TimeOrderedMapBlock(MapSector *sect, MapBlock *block) :
316 bool operator<(const TimeOrderedMapBlock &b) const
318 return block->getUsageTimer() < b.block->getUsageTimer();
325 void Map::timerUpdate(float dtime, float unload_timeout, u32 max_loaded_blocks,
326 std::vector<v3s16> *unloaded_blocks)
328 bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
330 // Profile modified reasons
331 Profiler modprofiler;
333 std::vector<v2s16> sector_deletion_queue;
334 u32 deleted_blocks_count = 0;
335 u32 saved_blocks_count = 0;
336 u32 block_count_all = 0;
340 // If there is no practical limit, we spare creation of mapblock_queue
341 if (max_loaded_blocks == U32_MAX) {
342 for (auto §or_it : m_sectors) {
343 MapSector *sector = sector_it.second;
345 bool all_blocks_deleted = true;
348 sector->getBlocks(blocks);
350 for (MapBlock *block : blocks) {
351 block->incrementUsageTimer(dtime);
353 if (block->refGet() == 0
354 && block->getUsageTimer() > unload_timeout) {
355 v3s16 p = block->getPos();
358 if (block->getModified() != MOD_STATE_CLEAN
359 && save_before_unloading) {
360 modprofiler.add(block->getModifiedReasonString(), 1);
361 if (!saveBlock(block))
363 saved_blocks_count++;
366 // Delete from memory
367 sector->deleteBlock(block);
370 unloaded_blocks->push_back(p);
372 deleted_blocks_count++;
374 all_blocks_deleted = false;
379 if (all_blocks_deleted) {
380 sector_deletion_queue.push_back(sector_it.first);
384 std::priority_queue<TimeOrderedMapBlock> mapblock_queue;
385 for (auto §or_it : m_sectors) {
386 MapSector *sector = sector_it.second;
389 sector->getBlocks(blocks);
391 for (MapBlock *block : blocks) {
392 block->incrementUsageTimer(dtime);
393 mapblock_queue.push(TimeOrderedMapBlock(sector, block));
396 block_count_all = mapblock_queue.size();
397 // Delete old blocks, and blocks over the limit from the memory
398 while (!mapblock_queue.empty() && (mapblock_queue.size() > max_loaded_blocks
399 || mapblock_queue.top().block->getUsageTimer() > unload_timeout)) {
400 TimeOrderedMapBlock b = mapblock_queue.top();
401 mapblock_queue.pop();
403 MapBlock *block = b.block;
405 if (block->refGet() != 0)
408 v3s16 p = block->getPos();
411 if (block->getModified() != MOD_STATE_CLEAN && save_before_unloading) {
412 modprofiler.add(block->getModifiedReasonString(), 1);
413 if (!saveBlock(block))
415 saved_blocks_count++;
418 // Delete from memory
419 b.sect->deleteBlock(block);
422 unloaded_blocks->push_back(p);
424 deleted_blocks_count++;
427 // Delete empty sectors
428 for (auto §or_it : m_sectors) {
429 if (sector_it.second->empty()) {
430 sector_deletion_queue.push_back(sector_it.first);
436 // Finally delete the empty sectors
437 deleteSectors(sector_deletion_queue);
439 if(deleted_blocks_count != 0)
441 PrintInfo(infostream); // ServerMap/ClientMap:
442 infostream<<"Unloaded "<<deleted_blocks_count
443 <<" blocks from memory";
444 if(save_before_unloading)
445 infostream<<", of which "<<saved_blocks_count<<" were written";
446 infostream<<", "<<block_count_all<<" blocks in memory";
447 infostream<<"."<<std::endl;
448 if(saved_blocks_count != 0){
449 PrintInfo(infostream); // ServerMap/ClientMap:
450 infostream<<"Blocks modified by: "<<std::endl;
451 modprofiler.print(infostream);
456 void Map::unloadUnreferencedBlocks(std::vector<v3s16> *unloaded_blocks)
458 timerUpdate(0.0, -1.0, 0, unloaded_blocks);
461 void Map::deleteSectors(std::vector<v2s16> §orList)
463 for (v2s16 j : sectorList) {
464 MapSector *sector = m_sectors[j];
465 // If sector is in sector cache, remove it from there
466 if(m_sector_cache == sector)
467 m_sector_cache = NULL;
468 // Remove from map and delete
474 void Map::PrintInfo(std::ostream &out)
479 #define WATER_DROP_BOOST 4
481 enum NeighborType : u8 {
487 struct NodeNeighbor {
493 : n(CONTENT_AIR), t(NEIGHBOR_SAME_LEVEL)
496 NodeNeighbor(const MapNode &node, NeighborType n_type, const v3s16 &pos)
503 void Map::transforming_liquid_add(v3s16 p) {
504 m_transforming_liquid.push_back(p);
507 void Map::transformLiquids(std::map<v3s16, MapBlock*> &modified_blocks,
508 ServerEnvironment *env)
511 u32 initial_size = m_transforming_liquid.size();
513 /*if(initial_size != 0)
514 infostream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
516 // list of nodes that due to viscosity have not reached their max level height
517 std::deque<v3s16> must_reflow;
519 std::vector<std::pair<v3s16, MapNode> > changed_nodes;
521 u32 liquid_loop_max = g_settings->getS32("liquid_loop_max");
522 u32 loop_max = liquid_loop_max;
526 /* If liquid_loop_max is not keeping up with the queue size increase
527 * loop_max up to a maximum of liquid_loop_max * dedicated_server_step.
529 if (m_transforming_liquid.size() > loop_max * 2) {
531 float server_step = g_settings->getFloat("dedicated_server_step");
532 if (m_transforming_liquid_loop_count_multiplier - 1.0 < server_step)
533 m_transforming_liquid_loop_count_multiplier *= 1.0 + server_step / 10;
535 m_transforming_liquid_loop_count_multiplier = 1.0;
538 loop_max *= m_transforming_liquid_loop_count_multiplier;
541 while (m_transforming_liquid.size() != 0)
543 // This should be done here so that it is done when continue is used
544 if (loopcount >= initial_size || loopcount >= loop_max)
549 Get a queued transforming liquid node
551 v3s16 p0 = m_transforming_liquid.front();
552 m_transforming_liquid.pop_front();
554 MapNode n0 = getNode(p0);
557 Collect information about current node
559 s8 liquid_level = -1;
560 // The liquid node which will be placed there if
561 // the liquid flows into this node.
562 content_t liquid_kind = CONTENT_IGNORE;
563 // The node which will be placed there if liquid
564 // can't flow into this node.
565 content_t floodable_node = CONTENT_AIR;
566 const ContentFeatures &cf = m_nodedef->get(n0);
567 LiquidType liquid_type = cf.liquid_type;
568 switch (liquid_type) {
570 liquid_level = LIQUID_LEVEL_SOURCE;
571 liquid_kind = m_nodedef->getId(cf.liquid_alternative_flowing);
574 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
575 liquid_kind = n0.getContent();
578 // if this node is 'floodable', it *could* be transformed
579 // into a liquid, otherwise, continue with the next node.
582 floodable_node = n0.getContent();
583 liquid_kind = CONTENT_AIR;
588 Collect information about the environment
590 const v3s16 *dirs = g_6dirs;
591 NodeNeighbor sources[6]; // surrounding sources
593 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
595 NodeNeighbor airs[6]; // surrounding air
597 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
598 int num_neutrals = 0;
599 bool flowing_down = false;
600 bool ignored_sources = false;
601 for (u16 i = 0; i < 6; i++) {
602 NeighborType nt = NEIGHBOR_SAME_LEVEL;
613 v3s16 npos = p0 + dirs[i];
614 NodeNeighbor nb(getNode(npos), nt, npos);
615 const ContentFeatures &cfnb = m_nodedef->get(nb.n);
616 switch (m_nodedef->get(nb.n.getContent()).liquid_type) {
618 if (cfnb.floodable) {
619 airs[num_airs++] = nb;
620 // if the current node is a water source the neighbor
621 // should be enqueded for transformation regardless of whether the
622 // current node changes or not.
623 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
624 m_transforming_liquid.push_back(npos);
625 // if the current node happens to be a flowing node, it will start to flow down here.
626 if (nb.t == NEIGHBOR_LOWER)
629 neutrals[num_neutrals++] = nb;
630 if (nb.n.getContent() == CONTENT_IGNORE) {
631 // If node below is ignore prevent water from
632 // spreading outwards and otherwise prevent from
633 // flowing away as ignore node might be the source
634 if (nb.t == NEIGHBOR_LOWER)
637 ignored_sources = true;
642 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
643 if (liquid_kind == CONTENT_AIR)
644 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
645 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
646 neutrals[num_neutrals++] = nb;
648 // Do not count bottom source, it will screw things up
650 sources[num_sources++] = nb;
654 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
655 if (liquid_kind == CONTENT_AIR)
656 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
657 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
658 neutrals[num_neutrals++] = nb;
660 flows[num_flows++] = nb;
661 if (nb.t == NEIGHBOR_LOWER)
669 decide on the type (and possibly level) of the current node
671 content_t new_node_content;
672 s8 new_node_level = -1;
673 s8 max_node_level = -1;
675 u8 range = m_nodedef->get(liquid_kind).liquid_range;
676 if (range > LIQUID_LEVEL_MAX + 1)
677 range = LIQUID_LEVEL_MAX + 1;
679 if ((num_sources >= 2 && m_nodedef->get(liquid_kind).liquid_renewable) || liquid_type == LIQUID_SOURCE) {
680 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
681 // or the flowing alternative of the first of the surrounding sources (if it's air), so
682 // it's perfectly safe to use liquid_kind here to determine the new node content.
683 new_node_content = m_nodedef->getId(m_nodedef->get(liquid_kind).liquid_alternative_source);
684 } else if (num_sources >= 1 && sources[0].t != NEIGHBOR_LOWER) {
685 // liquid_kind is set properly, see above
686 max_node_level = new_node_level = LIQUID_LEVEL_MAX;
687 if (new_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
688 new_node_content = liquid_kind;
690 new_node_content = floodable_node;
691 } else if (ignored_sources && liquid_level >= 0) {
692 // Maybe there are neighbouring sources that aren't loaded yet
693 // so prevent flowing away.
694 new_node_level = liquid_level;
695 new_node_content = liquid_kind;
697 // no surrounding sources, so get the maximum level that can flow into this node
698 for (u16 i = 0; i < num_flows; i++) {
699 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
700 switch (flows[i].t) {
702 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
703 max_node_level = LIQUID_LEVEL_MAX;
704 if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
705 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
706 } else if (nb_liquid_level > max_node_level) {
707 max_node_level = nb_liquid_level;
712 case NEIGHBOR_SAME_LEVEL:
713 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
714 nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level)
715 max_node_level = nb_liquid_level - 1;
720 u8 viscosity = m_nodedef->get(liquid_kind).liquid_viscosity;
721 if (viscosity > 1 && max_node_level != liquid_level) {
722 // amount to gain, limited by viscosity
723 // must be at least 1 in absolute value
724 s8 level_inc = max_node_level - liquid_level;
725 if (level_inc < -viscosity || level_inc > viscosity)
726 new_node_level = liquid_level + level_inc/viscosity;
727 else if (level_inc < 0)
728 new_node_level = liquid_level - 1;
729 else if (level_inc > 0)
730 new_node_level = liquid_level + 1;
731 if (new_node_level != max_node_level)
732 must_reflow.push_back(p0);
734 new_node_level = max_node_level;
737 if (max_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
738 new_node_content = liquid_kind;
740 new_node_content = floodable_node;
745 check if anything has changed. if not, just continue with the next node.
747 if (new_node_content == n0.getContent() &&
748 (m_nodedef->get(n0.getContent()).liquid_type != LIQUID_FLOWING ||
749 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
750 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
756 update the current node
759 //bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
760 if (m_nodedef->get(new_node_content).liquid_type == LIQUID_FLOWING) {
761 // set level to last 3 bits, flowing down bit to 4th bit
762 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
764 // set the liquid level and flow bit to 0
765 n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
769 n0.setContent(new_node_content);
771 // on_flood() the node
772 if (floodable_node != CONTENT_AIR) {
773 if (env->getScriptIface()->node_on_flood(p0, n00, n0))
777 // Ignore light (because calling voxalgo::update_lighting_nodes)
778 n0.setLight(LIGHTBANK_DAY, 0, m_nodedef);
779 n0.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
781 // Find out whether there is a suspect for this action
783 if (m_gamedef->rollback())
784 suspect = m_gamedef->rollback()->getSuspect(p0, 83, 1);
786 if (m_gamedef->rollback() && !suspect.empty()) {
788 RollbackScopeActor rollback_scope(m_gamedef->rollback(), suspect, true);
789 // Get old node for rollback
790 RollbackNode rollback_oldnode(this, p0, m_gamedef);
794 RollbackNode rollback_newnode(this, p0, m_gamedef);
795 RollbackAction action;
796 action.setSetNode(p0, rollback_oldnode, rollback_newnode);
797 m_gamedef->rollback()->reportAction(action);
803 v3s16 blockpos = getNodeBlockPos(p0);
804 MapBlock *block = getBlockNoCreateNoEx(blockpos);
806 modified_blocks[blockpos] = block;
807 changed_nodes.emplace_back(p0, n00);
811 enqueue neighbors for update if neccessary
813 switch (m_nodedef->get(n0.getContent()).liquid_type) {
816 // make sure source flows into all neighboring nodes
817 for (u16 i = 0; i < num_flows; i++)
818 if (flows[i].t != NEIGHBOR_UPPER)
819 m_transforming_liquid.push_back(flows[i].p);
820 for (u16 i = 0; i < num_airs; i++)
821 if (airs[i].t != NEIGHBOR_UPPER)
822 m_transforming_liquid.push_back(airs[i].p);
825 // this flow has turned to air; neighboring flows might need to do the same
826 for (u16 i = 0; i < num_flows; i++)
827 m_transforming_liquid.push_back(flows[i].p);
831 //infostream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
833 for (auto &iter : must_reflow)
834 m_transforming_liquid.push_back(iter);
836 voxalgo::update_lighting_nodes(this, changed_nodes, modified_blocks);
839 /* ----------------------------------------------------------------------
840 * Manage the queue so that it does not grow indefinately
842 u16 time_until_purge = g_settings->getU16("liquid_queue_purge_time");
844 if (time_until_purge == 0)
845 return; // Feature disabled
847 time_until_purge *= 1000; // seconds -> milliseconds
849 u64 curr_time = porting::getTimeMs();
850 u32 prev_unprocessed = m_unprocessed_count;
851 m_unprocessed_count = m_transforming_liquid.size();
853 // if unprocessed block count is decreasing or stable
854 if (m_unprocessed_count <= prev_unprocessed) {
855 m_queue_size_timer_started = false;
857 if (!m_queue_size_timer_started)
858 m_inc_trending_up_start_time = curr_time;
859 m_queue_size_timer_started = true;
862 // Account for curr_time overflowing
863 if (m_queue_size_timer_started && m_inc_trending_up_start_time > curr_time)
864 m_queue_size_timer_started = false;
866 /* If the queue has been growing for more than liquid_queue_purge_time seconds
867 * and the number of unprocessed blocks is still > liquid_loop_max then we
868 * cannot keep up; dump the oldest blocks from the queue so that the queue
869 * has liquid_loop_max items in it
871 if (m_queue_size_timer_started
872 && curr_time - m_inc_trending_up_start_time > time_until_purge
873 && m_unprocessed_count > liquid_loop_max) {
875 size_t dump_qty = m_unprocessed_count - liquid_loop_max;
877 infostream << "transformLiquids(): DUMPING " << dump_qty
878 << " blocks from the queue" << std::endl;
881 m_transforming_liquid.pop_front();
883 m_queue_size_timer_started = false; // optimistically assume we can keep up now
884 m_unprocessed_count = m_transforming_liquid.size();
888 std::vector<v3s16> Map::findNodesWithMetadata(v3s16 p1, v3s16 p2)
890 std::vector<v3s16> positions_with_meta;
892 sortBoxVerticies(p1, p2);
893 v3s16 bpmin = getNodeBlockPos(p1);
894 v3s16 bpmax = getNodeBlockPos(p2);
896 VoxelArea area(p1, p2);
898 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
899 for (s16 y = bpmin.Y; y <= bpmax.Y; y++)
900 for (s16 x = bpmin.X; x <= bpmax.X; x++) {
901 v3s16 blockpos(x, y, z);
903 MapBlock *block = getBlockNoCreateNoEx(blockpos);
905 verbosestream << "Map::getNodeMetadata(): Need to emerge "
906 << PP(blockpos) << std::endl;
907 block = emergeBlock(blockpos, false);
910 infostream << "WARNING: Map::getNodeMetadata(): Block not found"
915 v3s16 p_base = blockpos * MAP_BLOCKSIZE;
916 std::vector<v3s16> keys = block->m_node_metadata.getAllKeys();
917 for (size_t i = 0; i != keys.size(); i++) {
918 v3s16 p(keys[i] + p_base);
919 if (!area.contains(p))
922 positions_with_meta.push_back(p);
926 return positions_with_meta;
929 NodeMetadata *Map::getNodeMetadata(v3s16 p)
931 v3s16 blockpos = getNodeBlockPos(p);
932 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
933 MapBlock *block = getBlockNoCreateNoEx(blockpos);
935 infostream<<"Map::getNodeMetadata(): Need to emerge "
936 <<PP(blockpos)<<std::endl;
937 block = emergeBlock(blockpos, false);
940 warningstream<<"Map::getNodeMetadata(): Block not found"
944 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
948 bool Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
950 v3s16 blockpos = getNodeBlockPos(p);
951 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
952 MapBlock *block = getBlockNoCreateNoEx(blockpos);
954 infostream<<"Map::setNodeMetadata(): Need to emerge "
955 <<PP(blockpos)<<std::endl;
956 block = emergeBlock(blockpos, false);
959 warningstream<<"Map::setNodeMetadata(): Block not found"
963 block->m_node_metadata.set(p_rel, meta);
967 void Map::removeNodeMetadata(v3s16 p)
969 v3s16 blockpos = getNodeBlockPos(p);
970 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
971 MapBlock *block = getBlockNoCreateNoEx(blockpos);
974 warningstream<<"Map::removeNodeMetadata(): Block not found"
978 block->m_node_metadata.remove(p_rel);
981 NodeTimer Map::getNodeTimer(v3s16 p)
983 v3s16 blockpos = getNodeBlockPos(p);
984 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
985 MapBlock *block = getBlockNoCreateNoEx(blockpos);
987 infostream<<"Map::getNodeTimer(): Need to emerge "
988 <<PP(blockpos)<<std::endl;
989 block = emergeBlock(blockpos, false);
992 warningstream<<"Map::getNodeTimer(): Block not found"
996 NodeTimer t = block->m_node_timers.get(p_rel);
997 NodeTimer nt(t.timeout, t.elapsed, p);
1001 void Map::setNodeTimer(const NodeTimer &t)
1003 v3s16 p = t.position;
1004 v3s16 blockpos = getNodeBlockPos(p);
1005 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1006 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1008 infostream<<"Map::setNodeTimer(): Need to emerge "
1009 <<PP(blockpos)<<std::endl;
1010 block = emergeBlock(blockpos, false);
1013 warningstream<<"Map::setNodeTimer(): Block not found"
1017 NodeTimer nt(t.timeout, t.elapsed, p_rel);
1018 block->m_node_timers.set(nt);
1021 void Map::removeNodeTimer(v3s16 p)
1023 v3s16 blockpos = getNodeBlockPos(p);
1024 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1025 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1028 warningstream<<"Map::removeNodeTimer(): Block not found"
1032 block->m_node_timers.remove(p_rel);
1035 bool Map::isOccluded(v3s16 p0, v3s16 p1, float step, float stepfac,
1036 float start_off, float end_off, u32 needed_count)
1038 float d0 = (float)BS * p0.getDistanceFrom(p1);
1040 v3f uf = v3f(u0.X, u0.Y, u0.Z) * BS;
1042 v3f p0f = v3f(p0.X, p0.Y, p0.Z) * BS;
1044 for(float s=start_off; s<d0+end_off; s+=step){
1045 v3f pf = p0f + uf * s;
1046 v3s16 p = floatToInt(pf, BS);
1047 MapNode n = getNode(p);
1048 const ContentFeatures &f = m_nodedef->get(n);
1049 if(f.drawtype == NDT_NORMAL){
1050 // not transparent, see ContentFeature::updateTextures
1052 if(count >= needed_count)
1060 bool Map::isBlockOccluded(MapBlock *block, v3s16 cam_pos_nodes) {
1061 v3s16 cpn = block->getPos() * MAP_BLOCKSIZE;
1062 cpn += v3s16(MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2);
1063 float step = BS * 1;
1064 float stepfac = 1.1;
1065 float startoff = BS * 1;
1066 // The occlusion search of 'isOccluded()' must stop short of the target
1067 // point by distance 'endoff' (end offset) to not enter the target mapblock.
1068 // For the 8 mapblock corners 'endoff' must therefore be the maximum diagonal
1069 // of a mapblock, because we must consider all view angles.
1070 // sqrt(1^2 + 1^2 + 1^2) = 1.732
1071 float endoff = -BS * MAP_BLOCKSIZE * 1.732050807569;
1072 s16 bs2 = MAP_BLOCKSIZE / 2 + 1;
1073 // to reduce the likelihood of falsely occluded blocks
1074 // require at least two solid blocks
1075 // this is a HACK, we should think of a more precise algorithm
1076 u32 needed_count = 2;
1079 // For the central point of the mapblock 'endoff' can be halved
1080 isOccluded(cam_pos_nodes, cpn,
1081 step, stepfac, startoff, endoff / 2.0f, needed_count) &&
1082 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,bs2),
1083 step, stepfac, startoff, endoff, needed_count) &&
1084 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,-bs2),
1085 step, stepfac, startoff, endoff, needed_count) &&
1086 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,-bs2,bs2),
1087 step, stepfac, startoff, endoff, needed_count) &&
1088 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,-bs2,-bs2),
1089 step, stepfac, startoff, endoff, needed_count) &&
1090 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,bs2,bs2),
1091 step, stepfac, startoff, endoff, needed_count) &&
1092 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,bs2,-bs2),
1093 step, stepfac, startoff, endoff, needed_count) &&
1094 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,-bs2,bs2),
1095 step, stepfac, startoff, endoff, needed_count) &&
1096 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,-bs2,-bs2),
1097 step, stepfac, startoff, endoff, needed_count));
1103 ServerMap::ServerMap(const std::string &savedir, IGameDef *gamedef,
1104 EmergeManager *emerge):
1105 Map(dout_server, gamedef),
1106 settings_mgr(g_settings, savedir + DIR_DELIM + "map_meta.txt"),
1109 verbosestream<<FUNCTION_NAME<<std::endl;
1111 // Tell the EmergeManager about our MapSettingsManager
1112 emerge->map_settings_mgr = &settings_mgr;
1115 Try to load map; if not found, create a new one.
1118 // Determine which database backend to use
1119 std::string conf_path = savedir + DIR_DELIM + "world.mt";
1121 bool succeeded = conf.readConfigFile(conf_path.c_str());
1122 if (!succeeded || !conf.exists("backend")) {
1123 // fall back to sqlite3
1124 conf.set("backend", "sqlite3");
1126 std::string backend = conf.get("backend");
1127 dbase = createDatabase(backend, savedir, conf);
1128 if (conf.exists("readonly_backend")) {
1129 std::string readonly_dir = savedir + DIR_DELIM + "readonly";
1130 dbase_ro = createDatabase(conf.get("readonly_backend"), readonly_dir, conf);
1132 if (!conf.updateConfigFile(conf_path.c_str()))
1133 errorstream << "ServerMap::ServerMap(): Failed to update world.mt!" << std::endl;
1135 m_savedir = savedir;
1136 m_map_saving_enabled = false;
1139 // If directory exists, check contents and load if possible
1140 if (fs::PathExists(m_savedir)) {
1141 // If directory is empty, it is safe to save into it.
1142 if (fs::GetDirListing(m_savedir).empty()) {
1143 infostream<<"ServerMap: Empty save directory is valid."
1145 m_map_saving_enabled = true;
1150 if (settings_mgr.loadMapMeta()) {
1151 infostream << "ServerMap: Metadata loaded from "
1152 << savedir << std::endl;
1154 infostream << "ServerMap: Metadata could not be loaded "
1155 "from " << savedir << ", assuming valid save "
1156 "directory." << std::endl;
1159 m_map_saving_enabled = true;
1160 // Map loaded, not creating new one
1164 // If directory doesn't exist, it is safe to save to it
1166 m_map_saving_enabled = true;
1169 catch(std::exception &e)
1171 warningstream<<"ServerMap: Failed to load map from "<<savedir
1172 <<", exception: "<<e.what()<<std::endl;
1173 infostream<<"Please remove the map or fix it."<<std::endl;
1174 warningstream<<"Map saving will be disabled."<<std::endl;
1178 ServerMap::~ServerMap()
1180 verbosestream<<FUNCTION_NAME<<std::endl;
1184 if (m_map_saving_enabled) {
1185 // Save only changed parts
1186 save(MOD_STATE_WRITE_AT_UNLOAD);
1187 infostream << "ServerMap: Saved map to " << m_savedir << std::endl;
1189 infostream << "ServerMap: Map not saved" << std::endl;
1192 catch(std::exception &e)
1194 infostream<<"ServerMap: Failed to save map to "<<m_savedir
1195 <<", exception: "<<e.what()<<std::endl;
1199 Close database if it was opened
1209 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1210 for(; i.atEnd() == false; i++)
1212 MapChunk *chunk = i.getNode()->getValue();
1218 MapgenParams *ServerMap::getMapgenParams()
1220 // getMapgenParams() should only ever be called after Server is initialized
1221 assert(settings_mgr.mapgen_params != NULL);
1222 return settings_mgr.mapgen_params;
1225 u64 ServerMap::getSeed()
1227 return getMapgenParams()->seed;
1230 s16 ServerMap::getWaterLevel()
1232 return getMapgenParams()->water_level;
1235 bool ServerMap::blockpos_over_mapgen_limit(v3s16 p)
1237 const s16 mapgen_limit_bp = rangelim(
1238 getMapgenParams()->mapgen_limit, 0, MAX_MAP_GENERATION_LIMIT) /
1240 return p.X < -mapgen_limit_bp ||
1241 p.X > mapgen_limit_bp ||
1242 p.Y < -mapgen_limit_bp ||
1243 p.Y > mapgen_limit_bp ||
1244 p.Z < -mapgen_limit_bp ||
1245 p.Z > mapgen_limit_bp;
1248 bool ServerMap::initBlockMake(v3s16 blockpos, BlockMakeData *data)
1250 s16 csize = getMapgenParams()->chunksize;
1251 v3s16 bpmin = EmergeManager::getContainingChunk(blockpos, csize);
1252 v3s16 bpmax = bpmin + v3s16(1, 1, 1) * (csize - 1);
1254 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1255 EMERGE_DBG_OUT("initBlockMake(): " PP(bpmin) " - " PP(bpmax));
1257 v3s16 extra_borders(1, 1, 1);
1258 v3s16 full_bpmin = bpmin - extra_borders;
1259 v3s16 full_bpmax = bpmax + extra_borders;
1261 // Do nothing if not inside mapgen limits (+-1 because of neighbors)
1262 if (blockpos_over_mapgen_limit(full_bpmin) ||
1263 blockpos_over_mapgen_limit(full_bpmax))
1266 data->seed = getSeed();
1267 data->blockpos_min = bpmin;
1268 data->blockpos_max = bpmax;
1269 data->blockpos_requested = blockpos;
1270 data->nodedef = m_nodedef;
1273 Create the whole area of this and the neighboring blocks
1275 for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
1276 for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++) {
1277 v2s16 sectorpos(x, z);
1278 // Sector metadata is loaded from disk if not already loaded.
1279 MapSector *sector = createSector(sectorpos);
1280 FATAL_ERROR_IF(sector == NULL, "createSector() failed");
1282 for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
1285 MapBlock *block = emergeBlock(p, false);
1286 if (block == NULL) {
1287 block = createBlock(p);
1289 // Block gets sunlight if this is true.
1290 // Refer to the map generator heuristics.
1291 bool ug = m_emerge->isBlockUnderground(p);
1292 block->setIsUnderground(ug);
1298 Now we have a big empty area.
1300 Make a ManualMapVoxelManipulator that contains this and the
1304 data->vmanip = new MMVManip(this);
1305 data->vmanip->initialEmerge(full_bpmin, full_bpmax);
1307 // Note: we may need this again at some point.
1309 // Ensure none of the blocks to be generated were marked as
1310 // containing CONTENT_IGNORE
1311 for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
1312 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
1313 for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
1314 core::map<v3s16, u8>::Node *n;
1315 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
1318 u8 flags = n->getValue();
1319 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
1326 // Data is ready now.
1330 void ServerMap::finishBlockMake(BlockMakeData *data,
1331 std::map<v3s16, MapBlock*> *changed_blocks)
1333 v3s16 bpmin = data->blockpos_min;
1334 v3s16 bpmax = data->blockpos_max;
1336 v3s16 extra_borders(1, 1, 1);
1338 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1339 EMERGE_DBG_OUT("finishBlockMake(): " PP(bpmin) " - " PP(bpmax));
1342 Blit generated stuff to map
1343 NOTE: blitBackAll adds nearly everything to changed_blocks
1345 data->vmanip->blitBackAll(changed_blocks);
1347 EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()="
1348 << changed_blocks->size());
1351 Copy transforming liquid information
1353 while (data->transforming_liquid.size()) {
1354 m_transforming_liquid.push_back(data->transforming_liquid.front());
1355 data->transforming_liquid.pop_front();
1358 for (auto &changed_block : *changed_blocks) {
1359 MapBlock *block = changed_block.second;
1363 Update day/night difference cache of the MapBlocks
1365 block->expireDayNightDiff();
1367 Set block as modified
1369 block->raiseModified(MOD_STATE_WRITE_NEEDED,
1370 MOD_REASON_EXPIRE_DAYNIGHTDIFF);
1374 Set central blocks as generated
1376 for (s16 x = bpmin.X; x <= bpmax.X; x++)
1377 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
1378 for (s16 y = bpmin.Y; y <= bpmax.Y; y++) {
1379 MapBlock *block = getBlockNoCreateNoEx(v3s16(x, y, z));
1383 block->setGenerated(true);
1387 Save changed parts of map
1388 NOTE: Will be saved later.
1390 //save(MOD_STATE_WRITE_AT_UNLOAD);
1393 MapSector *ServerMap::createSector(v2s16 p2d)
1396 Check if it exists already in memory
1398 MapSector *sector = getSectorNoGenerate(p2d);
1403 Do not create over max mapgen limit
1405 const s16 max_limit_bp = MAX_MAP_GENERATION_LIMIT / MAP_BLOCKSIZE;
1406 if (p2d.X < -max_limit_bp ||
1407 p2d.X > max_limit_bp ||
1408 p2d.Y < -max_limit_bp ||
1409 p2d.Y > max_limit_bp)
1410 throw InvalidPositionException("createSector(): pos. over max mapgen limit");
1413 Generate blank sector
1416 sector = new MapSector(this, p2d, m_gamedef);
1418 // Sector position on map in nodes
1419 //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
1424 m_sectors[p2d] = sector;
1431 This is a quick-hand function for calling makeBlock().
1433 MapBlock * ServerMap::generateBlock(
1435 std::map<v3s16, MapBlock*> &modified_blocks
1438 bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
1440 TimeTaker timer("generateBlock");
1442 //MapBlock *block = original_dummy;
1444 v2s16 p2d(p.X, p.Z);
1445 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
1448 Do not generate over-limit
1450 if(blockpos_over_limit(p))
1452 infostream<<FUNCTION_NAME<<": Block position over limit"<<std::endl;
1453 throw InvalidPositionException("generateBlock(): pos. over limit");
1457 Create block make data
1460 initBlockMake(&data, p);
1466 TimeTaker t("mapgen::make_block()");
1467 mapgen->makeChunk(&data);
1468 //mapgen::make_block(&data);
1470 if(enable_mapgen_debug_info == false)
1471 t.stop(true); // Hide output
1475 Blit data back on map, update lighting, add mobs and whatever this does
1477 finishBlockMake(&data, modified_blocks);
1482 MapBlock *block = getBlockNoCreateNoEx(p);
1490 bool erroneus_content = false;
1491 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1492 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1493 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1496 MapNode n = block->getNode(p);
1497 if(n.getContent() == CONTENT_IGNORE)
1499 infostream<<"CONTENT_IGNORE at "
1500 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
1502 erroneus_content = true;
1506 if(erroneus_content)
1515 Generate a completely empty block
1519 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1520 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1522 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1525 n.setContent(CONTENT_AIR);
1526 block->setNode(v3s16(x0,y0,z0), n);
1532 if(enable_mapgen_debug_info == false)
1533 timer.stop(true); // Hide output
1539 MapBlock * ServerMap::createBlock(v3s16 p)
1542 Do not create over max mapgen limit
1544 if (blockpos_over_max_limit(p))
1545 throw InvalidPositionException("createBlock(): pos. over max mapgen limit");
1547 v2s16 p2d(p.X, p.Z);
1550 This will create or load a sector if not found in memory.
1551 If block exists on disk, it will be loaded.
1553 NOTE: On old save formats, this will be slow, as it generates
1554 lighting on blocks for them.
1558 sector = createSector(p2d);
1559 } catch (InvalidPositionException &e) {
1560 infostream<<"createBlock: createSector() failed"<<std::endl;
1565 Try to get a block from the sector
1568 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
1570 if(block->isDummy())
1575 block = sector->createBlankBlock(block_y);
1580 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
1583 MapBlock *block = getBlockNoCreateNoEx(p);
1584 if (block && !block->isDummy())
1589 MapBlock *block = loadBlock(p);
1595 MapSector *sector = createSector(v2s16(p.X, p.Z));
1596 MapBlock *block = sector->createBlankBlock(p.Y);
1604 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
1606 MapBlock *block = getBlockNoCreateNoEx(p3d);
1608 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
1613 // N.B. This requires no synchronization, since data will not be modified unless
1614 // the VoxelManipulator being updated belongs to the same thread.
1615 void ServerMap::updateVManip(v3s16 pos)
1617 Mapgen *mg = m_emerge->getCurrentMapgen();
1621 MMVManip *vm = mg->vm;
1625 if (!vm->m_area.contains(pos))
1628 s32 idx = vm->m_area.index(pos);
1629 vm->m_data[idx] = getNode(pos);
1630 vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
1632 vm->m_is_dirty = true;
1635 s16 ServerMap::findGroundLevel(v2s16 p2d)
1639 Uh, just do something random...
1641 // Find existing map from top to down
1644 v3s16 p(p2d.X, max, p2d.Y);
1645 for(; p.Y>min; p.Y--)
1647 MapNode n = getNodeNoEx(p);
1648 if(n.getContent() != CONTENT_IGNORE)
1653 // If this node is not air, go to plan b
1654 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
1656 // Search existing walkable and return it
1657 for(; p.Y>min; p.Y--)
1659 MapNode n = getNodeNoEx(p);
1660 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
1669 Determine from map generator noise functions
1672 s16 level = m_emerge->getGroundLevelAtPoint(p2d);
1675 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
1676 //return (s16)level;
1679 bool ServerMap::loadFromFolders() {
1680 if (!dbase->initialized() &&
1681 !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
1686 void ServerMap::createDirs(const std::string &path)
1688 if (!fs::CreateAllDirs(path)) {
1689 m_dout<<"ServerMap: Failed to create directory "
1690 <<"\""<<path<<"\""<<std::endl;
1691 throw BaseException("ServerMap failed to create directory");
1695 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
1701 porting::mt_snprintf(cc, sizeof(cc), "%.4x%.4x",
1702 (unsigned int) pos.X & 0xffff,
1703 (unsigned int) pos.Y & 0xffff);
1705 return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
1707 porting::mt_snprintf(cc, sizeof(cc), (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
1708 (unsigned int) pos.X & 0xfff,
1709 (unsigned int) pos.Y & 0xfff);
1711 return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
1718 v2s16 ServerMap::getSectorPos(const std::string &dirname)
1720 unsigned int x = 0, y = 0;
1722 std::string component;
1723 fs::RemoveLastPathComponent(dirname, &component, 1);
1724 if(component.size() == 8)
1727 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
1729 else if(component.size() == 3)
1732 fs::RemoveLastPathComponent(dirname, &component, 2);
1733 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
1734 // Sign-extend the 12 bit values up to 16 bits...
1735 if(x & 0x800) x |= 0xF000;
1736 if(y & 0x800) y |= 0xF000;
1743 FATAL_ERROR_IF(r != 2, "getSectorPos()");
1744 v2s16 pos((s16)x, (s16)y);
1748 v3s16 ServerMap::getBlockPos(const std::string §ordir, const std::string &blockfile)
1750 v2s16 p2d = getSectorPos(sectordir);
1752 if(blockfile.size() != 4){
1753 throw InvalidFilenameException("Invalid block filename");
1756 int r = sscanf(blockfile.c_str(), "%4x", &y);
1758 throw InvalidFilenameException("Invalid block filename");
1759 return v3s16(p2d.X, y, p2d.Y);
1762 std::string ServerMap::getBlockFilename(v3s16 p)
1765 porting::mt_snprintf(cc, sizeof(cc), "%.4x", (unsigned int)p.Y&0xffff);
1769 void ServerMap::save(ModifiedState save_level)
1771 if (!m_map_saving_enabled) {
1772 warningstream<<"Not saving map, saving disabled."<<std::endl;
1776 if(save_level == MOD_STATE_CLEAN)
1777 infostream<<"ServerMap: Saving whole map, this can take time."
1780 if (m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
1781 if (settings_mgr.saveMapMeta())
1782 m_map_metadata_changed = false;
1785 // Profile modified reasons
1786 Profiler modprofiler;
1788 u32 block_count = 0;
1789 u32 block_count_all = 0; // Number of blocks in memory
1791 // Don't do anything with sqlite unless something is really saved
1792 bool save_started = false;
1794 for (auto §or_it : m_sectors) {
1795 MapSector *sector = sector_it.second;
1797 MapBlockVect blocks;
1798 sector->getBlocks(blocks);
1800 for (MapBlock *block : blocks) {
1803 if(block->getModified() >= (u32)save_level) {
1807 save_started = true;
1810 modprofiler.add(block->getModifiedReasonString(), 1);
1822 Only print if something happened or saved whole map
1824 if(save_level == MOD_STATE_CLEAN
1825 || block_count != 0) {
1826 infostream<<"ServerMap: Written: "
1827 <<block_count<<" block files"
1828 <<", "<<block_count_all<<" blocks in memory."
1830 PrintInfo(infostream); // ServerMap/ClientMap:
1831 infostream<<"Blocks modified by: "<<std::endl;
1832 modprofiler.print(infostream);
1836 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
1838 if (loadFromFolders()) {
1839 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
1840 << "all blocks that are stored in flat files." << std::endl;
1842 dbase->listAllLoadableBlocks(dst);
1844 dbase_ro->listAllLoadableBlocks(dst);
1847 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
1849 for (auto §or_it : m_sectors) {
1850 MapSector *sector = sector_it.second;
1852 MapBlockVect blocks;
1853 sector->getBlocks(blocks);
1855 for (MapBlock *block : blocks) {
1856 v3s16 p = block->getPos();
1862 MapDatabase *ServerMap::createDatabase(
1863 const std::string &name,
1864 const std::string &savedir,
1867 if (name == "sqlite3")
1868 return new MapDatabaseSQLite3(savedir);
1869 if (name == "dummy")
1870 return new Database_Dummy();
1872 if (name == "leveldb")
1873 return new Database_LevelDB(savedir);
1876 if (name == "redis")
1877 return new Database_Redis(conf);
1880 if (name == "postgresql") {
1881 std::string connect_string;
1882 conf.getNoEx("pgsql_connection", connect_string);
1883 return new MapDatabasePostgreSQL(connect_string);
1887 throw BaseException(std::string("Database backend ") + name + " not supported.");
1890 void ServerMap::beginSave()
1895 void ServerMap::endSave()
1900 bool ServerMap::saveBlock(MapBlock *block)
1902 return saveBlock(block, dbase);
1905 bool ServerMap::saveBlock(MapBlock *block, MapDatabase *db)
1907 v3s16 p3d = block->getPos();
1909 // Dummy blocks are not written
1910 if (block->isDummy()) {
1911 warningstream << "saveBlock: Not writing dummy block "
1912 << PP(p3d) << std::endl;
1916 // Format used for writing
1917 u8 version = SER_FMT_VER_HIGHEST_WRITE;
1920 [0] u8 serialization version
1923 std::ostringstream o(std::ios_base::binary);
1924 o.write((char*) &version, 1);
1925 block->serialize(o, version, true);
1927 bool ret = db->saveBlock(p3d, o.str());
1929 // We just wrote it to the disk so clear modified flag
1930 block->resetModified();
1935 void ServerMap::loadBlock(const std::string §ordir, const std::string &blockfile,
1936 MapSector *sector, bool save_after_load)
1938 std::string fullpath = sectordir + DIR_DELIM + blockfile;
1940 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
1942 throw FileNotGoodException("Cannot open block file");
1944 v3s16 p3d = getBlockPos(sectordir, blockfile);
1945 v2s16 p2d(p3d.X, p3d.Z);
1947 assert(sector->getPos() == p2d);
1949 u8 version = SER_FMT_VER_INVALID;
1950 is.read((char*)&version, 1);
1953 throw SerializationError("ServerMap::loadBlock(): Failed"
1954 " to read MapBlock version");
1956 /*u32 block_size = MapBlock::serializedLength(version);
1957 SharedBuffer<u8> data(block_size);
1958 is.read((char*)*data, block_size);*/
1960 // This will always return a sector because we're the server
1961 //MapSector *sector = emergeSector(p2d);
1963 MapBlock *block = NULL;
1964 bool created_new = false;
1965 block = sector->getBlockNoCreateNoEx(p3d.Y);
1968 block = sector->createBlankBlockNoInsert(p3d.Y);
1973 block->deSerialize(is, version, true);
1975 // If it's a new block, insert it to the map
1977 sector->insertBlock(block);
1978 ReflowScan scanner(this, m_emerge->ndef);
1979 scanner.scan(block, &m_transforming_liquid);
1983 Save blocks loaded in old format in new format
1986 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
1990 // Should be in database now, so delete the old file
1991 fs::RecursiveDelete(fullpath);
1994 // We just loaded it from the disk, so it's up-to-date.
1995 block->resetModified();
1998 catch(SerializationError &e)
2000 warningstream<<"Invalid block data on disk "
2001 <<"fullpath="<<fullpath
2002 <<" (SerializationError). "
2003 <<"what()="<<e.what()
2005 // Ignoring. A new one will be generated.
2008 // TODO: Backup file; name is in fullpath.
2012 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
2015 std::istringstream is(*blob, std::ios_base::binary);
2017 u8 version = SER_FMT_VER_INVALID;
2018 is.read((char*)&version, 1);
2021 throw SerializationError("ServerMap::loadBlock(): Failed"
2022 " to read MapBlock version");
2024 MapBlock *block = NULL;
2025 bool created_new = false;
2026 block = sector->getBlockNoCreateNoEx(p3d.Y);
2029 block = sector->createBlankBlockNoInsert(p3d.Y);
2034 block->deSerialize(is, version, true);
2036 // If it's a new block, insert it to the map
2038 sector->insertBlock(block);
2039 ReflowScan scanner(this, m_emerge->ndef);
2040 scanner.scan(block, &m_transforming_liquid);
2044 Save blocks loaded in old format in new format
2047 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
2048 // Only save if asked to; no need to update version
2052 // We just loaded it from, so it's up-to-date.
2053 block->resetModified();
2055 catch(SerializationError &e)
2057 errorstream<<"Invalid block data in database"
2058 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
2059 <<" (SerializationError): "<<e.what()<<std::endl;
2061 // TODO: Block should be marked as invalid in memory so that it is
2062 // not touched but the game can run
2064 if(g_settings->getBool("ignore_world_load_errors")){
2065 errorstream<<"Ignoring block load error. Duck and cover! "
2066 <<"(ignore_world_load_errors)"<<std::endl;
2068 throw SerializationError("Invalid block data in database");
2073 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
2075 bool created_new = (getBlockNoCreateNoEx(blockpos) == NULL);
2077 v2s16 p2d(blockpos.X, blockpos.Z);
2080 dbase->loadBlock(blockpos, &ret);
2082 loadBlock(&ret, blockpos, createSector(p2d), false);
2083 } else if (dbase_ro) {
2084 dbase_ro->loadBlock(blockpos, &ret);
2086 loadBlock(&ret, blockpos, createSector(p2d), false);
2089 // Not found in database, try the files
2091 // The directory layout we're going to load from.
2092 // 1 - original sectors/xxxxzzzz/
2093 // 2 - new sectors2/xxx/zzz/
2094 // If we load from anything but the latest structure, we will
2095 // immediately save to the new one, and remove the old.
2096 std::string sectordir1 = getSectorDir(p2d, 1);
2097 std::string sectordir;
2098 if (fs::PathExists(sectordir1)) {
2099 sectordir = sectordir1;
2101 sectordir = getSectorDir(p2d, 2);
2105 Make sure sector is loaded
2108 MapSector *sector = getSectorNoGenerate(p2d);
2111 Make sure file exists
2114 std::string blockfilename = getBlockFilename(blockpos);
2115 if (!fs::PathExists(sectordir + DIR_DELIM + blockfilename))
2119 Load block and save it to the database
2121 loadBlock(sectordir, blockfilename, sector, true);
2124 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2125 if (created_new && (block != NULL)) {
2126 std::map<v3s16, MapBlock*> modified_blocks;
2127 // Fix lighting if necessary
2128 voxalgo::update_block_border_lighting(this, block, modified_blocks);
2129 if (!modified_blocks.empty()) {
2130 //Modified lighting, send event
2132 event.type = MEET_OTHER;
2133 std::map<v3s16, MapBlock *>::iterator it;
2134 for (it = modified_blocks.begin();
2135 it != modified_blocks.end(); ++it)
2136 event.modified_blocks.insert(it->first);
2137 dispatchEvent(&event);
2143 bool ServerMap::deleteBlock(v3s16 blockpos)
2145 if (!dbase->deleteBlock(blockpos))
2148 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2150 v2s16 p2d(blockpos.X, blockpos.Z);
2151 MapSector *sector = getSectorNoGenerate(p2d);
2154 sector->deleteBlock(block);
2160 void ServerMap::PrintInfo(std::ostream &out)
2165 bool ServerMap::repairBlockLight(v3s16 blockpos,
2166 std::map<v3s16, MapBlock *> *modified_blocks)
2168 MapBlock *block = emergeBlock(blockpos, false);
2169 if (!block || !block->isGenerated())
2171 voxalgo::repair_block_light(this, block, modified_blocks);
2175 MMVManip::MMVManip(Map *map):
2181 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
2182 bool load_if_inexistent)
2184 TimeTaker timer1("initialEmerge", &emerge_time);
2186 // Units of these are MapBlocks
2187 v3s16 p_min = blockpos_min;
2188 v3s16 p_max = blockpos_max;
2190 VoxelArea block_area_nodes
2191 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2193 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
2196 infostream<<"initialEmerge: area: ";
2197 block_area_nodes.print(infostream);
2198 infostream<<" ("<<size_MB<<"MB)";
2199 infostream<<std::endl;
2202 addArea(block_area_nodes);
2204 for(s32 z=p_min.Z; z<=p_max.Z; z++)
2205 for(s32 y=p_min.Y; y<=p_max.Y; y++)
2206 for(s32 x=p_min.X; x<=p_max.X; x++)
2211 std::map<v3s16, u8>::iterator n;
2212 n = m_loaded_blocks.find(p);
2213 if(n != m_loaded_blocks.end())
2216 bool block_data_inexistent = false;
2218 TimeTaker timer2("emerge load", &emerge_load_time);
2220 block = m_map->getBlockNoCreateNoEx(p);
2221 if (!block || block->isDummy())
2222 block_data_inexistent = true;
2224 block->copyTo(*this);
2227 if(block_data_inexistent)
2230 if (load_if_inexistent && !blockpos_over_max_limit(p)) {
2231 ServerMap *svrmap = (ServerMap *)m_map;
2232 block = svrmap->emergeBlock(p, false);
2234 block = svrmap->createBlock(p);
2235 block->copyTo(*this);
2237 flags |= VMANIP_BLOCK_DATA_INEXIST;
2240 Mark area inexistent
2242 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2243 // Fill with VOXELFLAG_NO_DATA
2244 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
2245 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
2247 s32 i = m_area.index(a.MinEdge.X,y,z);
2248 memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
2252 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
2254 // Mark that block was loaded as blank
2255 flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
2258 m_loaded_blocks[p] = flags;
2264 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
2265 bool overwrite_generated)
2267 if(m_area.getExtent() == v3s16(0,0,0))
2271 Copy data of all blocks
2273 for (auto &loaded_block : m_loaded_blocks) {
2274 v3s16 p = loaded_block.first;
2275 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
2276 bool existed = !(loaded_block.second & VMANIP_BLOCK_DATA_INEXIST);
2277 if (!existed || (block == NULL) ||
2278 (!overwrite_generated && block->isGenerated()))
2281 block->copyFrom(*this);
2282 block->raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_VMANIP);
2285 (*modified_blocks)[p] = block;