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);
155 MapBlock *block = getBlockNoCreateNoEx(blockpos);
156 return block && block->getIsUnderground();
159 bool Map::isValidPosition(v3s16 p)
161 v3s16 blockpos = getNodeBlockPos(p);
162 MapBlock *block = getBlockNoCreateNoEx(blockpos);
163 return (block != NULL);
166 // Returns a CONTENT_IGNORE node if not found
167 MapNode Map::getNode(v3s16 p, bool *is_valid_position)
169 v3s16 blockpos = getNodeBlockPos(p);
170 MapBlock *block = getBlockNoCreateNoEx(blockpos);
172 if (is_valid_position != NULL)
173 *is_valid_position = false;
174 return {CONTENT_IGNORE};
177 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
179 MapNode node = block->getNodeNoCheck(relpos, &is_valid_p);
180 if (is_valid_position != NULL)
181 *is_valid_position = is_valid_p;
185 // throws InvalidPositionException if not found
186 void Map::setNode(v3s16 p, MapNode & n)
188 v3s16 blockpos = getNodeBlockPos(p);
189 MapBlock *block = getBlockNoCreate(blockpos);
190 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
191 // Never allow placing CONTENT_IGNORE, it fucks up stuff
192 if(n.getContent() == CONTENT_IGNORE){
194 errorstream<<"Map::setNode(): Not allowing to place CONTENT_IGNORE"
195 <<" while trying to replace \""
196 <<m_nodedef->get(block->getNodeNoCheck(relpos, &temp_bool)).name
197 <<"\" at "<<PP(p)<<" (block "<<PP(blockpos)<<")"<<std::endl;
200 block->setNodeNoCheck(relpos, n);
203 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
204 std::map<v3s16, MapBlock*> &modified_blocks,
205 bool remove_metadata)
207 // Collect old node for rollback
208 RollbackNode rollback_oldnode(this, p, m_gamedef);
210 // This is needed for updating the lighting
211 MapNode oldnode = getNode(p);
213 // Remove node metadata
214 if (remove_metadata) {
215 removeNodeMetadata(p);
218 // Set the node on the map
219 // Ignore light (because calling voxalgo::update_lighting_nodes)
220 n.setLight(LIGHTBANK_DAY, 0, m_nodedef);
221 n.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
225 std::vector<std::pair<v3s16, MapNode> > oldnodes;
226 oldnodes.emplace_back(p, oldnode);
227 voxalgo::update_lighting_nodes(this, oldnodes, modified_blocks);
229 for (auto &modified_block : modified_blocks) {
230 modified_block.second->expireDayNightDiff();
233 // Report for rollback
234 if(m_gamedef->rollback())
236 RollbackNode rollback_newnode(this, p, m_gamedef);
237 RollbackAction action;
238 action.setSetNode(p, rollback_oldnode, rollback_newnode);
239 m_gamedef->rollback()->reportAction(action);
243 Add neighboring liquid nodes and this node to transform queue.
244 (it's vital for the node itself to get updated last, if it was removed.)
247 for (const v3s16 &dir : g_7dirs) {
250 bool is_valid_position;
251 MapNode n2 = getNode(p2, &is_valid_position);
252 if(is_valid_position &&
253 (m_nodedef->get(n2).isLiquid() ||
254 n2.getContent() == CONTENT_AIR))
255 m_transforming_liquid.push_back(p2);
259 void Map::removeNodeAndUpdate(v3s16 p,
260 std::map<v3s16, MapBlock*> &modified_blocks)
262 addNodeAndUpdate(p, MapNode(CONTENT_AIR), modified_blocks, true);
265 bool Map::addNodeWithEvent(v3s16 p, MapNode n, bool remove_metadata)
268 event.type = remove_metadata ? MEET_ADDNODE : MEET_SWAPNODE;
272 bool succeeded = true;
274 std::map<v3s16, MapBlock*> modified_blocks;
275 addNodeAndUpdate(p, n, modified_blocks, remove_metadata);
277 // Copy modified_blocks to event
278 for (auto &modified_block : modified_blocks) {
279 event.modified_blocks.insert(modified_block.first);
282 catch(InvalidPositionException &e){
286 dispatchEvent(&event);
291 bool Map::removeNodeWithEvent(v3s16 p)
294 event.type = MEET_REMOVENODE;
297 bool succeeded = true;
299 std::map<v3s16, MapBlock*> modified_blocks;
300 removeNodeAndUpdate(p, modified_blocks);
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 struct TimeOrderedMapBlock {
320 TimeOrderedMapBlock(MapSector *sect, MapBlock *block) :
325 bool operator<(const TimeOrderedMapBlock &b) const
327 return block->getUsageTimer() < b.block->getUsageTimer();
334 void Map::timerUpdate(float dtime, float unload_timeout, u32 max_loaded_blocks,
335 std::vector<v3s16> *unloaded_blocks)
337 bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
339 // Profile modified reasons
340 Profiler modprofiler;
342 std::vector<v2s16> sector_deletion_queue;
343 u32 deleted_blocks_count = 0;
344 u32 saved_blocks_count = 0;
345 u32 block_count_all = 0;
349 // If there is no practical limit, we spare creation of mapblock_queue
350 if (max_loaded_blocks == U32_MAX) {
351 for (auto §or_it : m_sectors) {
352 MapSector *sector = sector_it.second;
354 bool all_blocks_deleted = true;
357 sector->getBlocks(blocks);
359 for (MapBlock *block : blocks) {
360 block->incrementUsageTimer(dtime);
362 if (block->refGet() == 0
363 && block->getUsageTimer() > unload_timeout) {
364 v3s16 p = block->getPos();
367 if (block->getModified() != MOD_STATE_CLEAN
368 && save_before_unloading) {
369 modprofiler.add(block->getModifiedReasonString(), 1);
370 if (!saveBlock(block))
372 saved_blocks_count++;
375 // Delete from memory
376 sector->deleteBlock(block);
379 unloaded_blocks->push_back(p);
381 deleted_blocks_count++;
383 all_blocks_deleted = false;
388 if (all_blocks_deleted) {
389 sector_deletion_queue.push_back(sector_it.first);
393 std::priority_queue<TimeOrderedMapBlock> mapblock_queue;
394 for (auto §or_it : m_sectors) {
395 MapSector *sector = sector_it.second;
398 sector->getBlocks(blocks);
400 for (MapBlock *block : blocks) {
401 block->incrementUsageTimer(dtime);
402 mapblock_queue.push(TimeOrderedMapBlock(sector, block));
405 block_count_all = mapblock_queue.size();
406 // Delete old blocks, and blocks over the limit from the memory
407 while (!mapblock_queue.empty() && (mapblock_queue.size() > max_loaded_blocks
408 || mapblock_queue.top().block->getUsageTimer() > unload_timeout)) {
409 TimeOrderedMapBlock b = mapblock_queue.top();
410 mapblock_queue.pop();
412 MapBlock *block = b.block;
414 if (block->refGet() != 0)
417 v3s16 p = block->getPos();
420 if (block->getModified() != MOD_STATE_CLEAN && save_before_unloading) {
421 modprofiler.add(block->getModifiedReasonString(), 1);
422 if (!saveBlock(block))
424 saved_blocks_count++;
427 // Delete from memory
428 b.sect->deleteBlock(block);
431 unloaded_blocks->push_back(p);
433 deleted_blocks_count++;
436 // Delete empty sectors
437 for (auto §or_it : m_sectors) {
438 if (sector_it.second->empty()) {
439 sector_deletion_queue.push_back(sector_it.first);
445 // Finally delete the empty sectors
446 deleteSectors(sector_deletion_queue);
448 if(deleted_blocks_count != 0)
450 PrintInfo(infostream); // ServerMap/ClientMap:
451 infostream<<"Unloaded "<<deleted_blocks_count
452 <<" blocks from memory";
453 if(save_before_unloading)
454 infostream<<", of which "<<saved_blocks_count<<" were written";
455 infostream<<", "<<block_count_all<<" blocks in memory";
456 infostream<<"."<<std::endl;
457 if(saved_blocks_count != 0){
458 PrintInfo(infostream); // ServerMap/ClientMap:
459 infostream<<"Blocks modified by: "<<std::endl;
460 modprofiler.print(infostream);
465 void Map::unloadUnreferencedBlocks(std::vector<v3s16> *unloaded_blocks)
467 timerUpdate(0.0, -1.0, 0, unloaded_blocks);
470 void Map::deleteSectors(std::vector<v2s16> §orList)
472 for (v2s16 j : sectorList) {
473 MapSector *sector = m_sectors[j];
474 // If sector is in sector cache, remove it from there
475 if(m_sector_cache == sector)
476 m_sector_cache = NULL;
477 // Remove from map and delete
483 void Map::PrintInfo(std::ostream &out)
488 #define WATER_DROP_BOOST 4
490 enum NeighborType : u8 {
496 struct NodeNeighbor {
502 : n(CONTENT_AIR), t(NEIGHBOR_SAME_LEVEL)
505 NodeNeighbor(const MapNode &node, NeighborType n_type, const v3s16 &pos)
512 void Map::transforming_liquid_add(v3s16 p) {
513 m_transforming_liquid.push_back(p);
516 void Map::transformLiquids(std::map<v3s16, MapBlock*> &modified_blocks,
517 ServerEnvironment *env)
520 u32 initial_size = m_transforming_liquid.size();
522 /*if(initial_size != 0)
523 infostream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
525 // list of nodes that due to viscosity have not reached their max level height
526 std::deque<v3s16> must_reflow;
528 std::vector<std::pair<v3s16, MapNode> > changed_nodes;
530 u32 liquid_loop_max = g_settings->getS32("liquid_loop_max");
531 u32 loop_max = liquid_loop_max;
535 /* If liquid_loop_max is not keeping up with the queue size increase
536 * loop_max up to a maximum of liquid_loop_max * dedicated_server_step.
538 if (m_transforming_liquid.size() > loop_max * 2) {
540 float server_step = g_settings->getFloat("dedicated_server_step");
541 if (m_transforming_liquid_loop_count_multiplier - 1.0 < server_step)
542 m_transforming_liquid_loop_count_multiplier *= 1.0 + server_step / 10;
544 m_transforming_liquid_loop_count_multiplier = 1.0;
547 loop_max *= m_transforming_liquid_loop_count_multiplier;
550 while (m_transforming_liquid.size() != 0)
552 // This should be done here so that it is done when continue is used
553 if (loopcount >= initial_size || loopcount >= loop_max)
558 Get a queued transforming liquid node
560 v3s16 p0 = m_transforming_liquid.front();
561 m_transforming_liquid.pop_front();
563 MapNode n0 = getNode(p0);
566 Collect information about current node
568 s8 liquid_level = -1;
569 // The liquid node which will be placed there if
570 // the liquid flows into this node.
571 content_t liquid_kind = CONTENT_IGNORE;
572 // The node which will be placed there if liquid
573 // can't flow into this node.
574 content_t floodable_node = CONTENT_AIR;
575 const ContentFeatures &cf = m_nodedef->get(n0);
576 LiquidType liquid_type = cf.liquid_type;
577 switch (liquid_type) {
579 liquid_level = LIQUID_LEVEL_SOURCE;
580 liquid_kind = m_nodedef->getId(cf.liquid_alternative_flowing);
583 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
584 liquid_kind = n0.getContent();
587 // if this node is 'floodable', it *could* be transformed
588 // into a liquid, otherwise, continue with the next node.
591 floodable_node = n0.getContent();
592 liquid_kind = CONTENT_AIR;
597 Collect information about the environment
599 const v3s16 *dirs = g_6dirs;
600 NodeNeighbor sources[6]; // surrounding sources
602 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
604 NodeNeighbor airs[6]; // surrounding air
606 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
607 int num_neutrals = 0;
608 bool flowing_down = false;
609 bool ignored_sources = false;
610 for (u16 i = 0; i < 6; i++) {
611 NeighborType nt = NEIGHBOR_SAME_LEVEL;
622 v3s16 npos = p0 + dirs[i];
623 NodeNeighbor nb(getNode(npos), nt, npos);
624 const ContentFeatures &cfnb = m_nodedef->get(nb.n);
625 switch (m_nodedef->get(nb.n.getContent()).liquid_type) {
627 if (cfnb.floodable) {
628 airs[num_airs++] = nb;
629 // if the current node is a water source the neighbor
630 // should be enqueded for transformation regardless of whether the
631 // current node changes or not.
632 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
633 m_transforming_liquid.push_back(npos);
634 // if the current node happens to be a flowing node, it will start to flow down here.
635 if (nb.t == NEIGHBOR_LOWER)
638 neutrals[num_neutrals++] = nb;
639 if (nb.n.getContent() == CONTENT_IGNORE) {
640 // If node below is ignore prevent water from
641 // spreading outwards and otherwise prevent from
642 // flowing away as ignore node might be the source
643 if (nb.t == NEIGHBOR_LOWER)
646 ignored_sources = true;
651 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
652 if (liquid_kind == CONTENT_AIR)
653 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
654 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
655 neutrals[num_neutrals++] = nb;
657 // Do not count bottom source, it will screw things up
659 sources[num_sources++] = nb;
663 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
664 if (liquid_kind == CONTENT_AIR)
665 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
666 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
667 neutrals[num_neutrals++] = nb;
669 flows[num_flows++] = nb;
670 if (nb.t == NEIGHBOR_LOWER)
678 decide on the type (and possibly level) of the current node
680 content_t new_node_content;
681 s8 new_node_level = -1;
682 s8 max_node_level = -1;
684 u8 range = m_nodedef->get(liquid_kind).liquid_range;
685 if (range > LIQUID_LEVEL_MAX + 1)
686 range = LIQUID_LEVEL_MAX + 1;
688 if ((num_sources >= 2 && m_nodedef->get(liquid_kind).liquid_renewable) || liquid_type == LIQUID_SOURCE) {
689 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
690 // or the flowing alternative of the first of the surrounding sources (if it's air), so
691 // it's perfectly safe to use liquid_kind here to determine the new node content.
692 new_node_content = m_nodedef->getId(m_nodedef->get(liquid_kind).liquid_alternative_source);
693 } else if (num_sources >= 1 && sources[0].t != NEIGHBOR_LOWER) {
694 // liquid_kind is set properly, see above
695 max_node_level = new_node_level = LIQUID_LEVEL_MAX;
696 if (new_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
697 new_node_content = liquid_kind;
699 new_node_content = floodable_node;
700 } else if (ignored_sources && liquid_level >= 0) {
701 // Maybe there are neighbouring sources that aren't loaded yet
702 // so prevent flowing away.
703 new_node_level = liquid_level;
704 new_node_content = liquid_kind;
706 // no surrounding sources, so get the maximum level that can flow into this node
707 for (u16 i = 0; i < num_flows; i++) {
708 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
709 switch (flows[i].t) {
711 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
712 max_node_level = LIQUID_LEVEL_MAX;
713 if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
714 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
715 } else if (nb_liquid_level > max_node_level) {
716 max_node_level = nb_liquid_level;
721 case NEIGHBOR_SAME_LEVEL:
722 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
723 nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level)
724 max_node_level = nb_liquid_level - 1;
729 u8 viscosity = m_nodedef->get(liquid_kind).liquid_viscosity;
730 if (viscosity > 1 && max_node_level != liquid_level) {
731 // amount to gain, limited by viscosity
732 // must be at least 1 in absolute value
733 s8 level_inc = max_node_level - liquid_level;
734 if (level_inc < -viscosity || level_inc > viscosity)
735 new_node_level = liquid_level + level_inc/viscosity;
736 else if (level_inc < 0)
737 new_node_level = liquid_level - 1;
738 else if (level_inc > 0)
739 new_node_level = liquid_level + 1;
740 if (new_node_level != max_node_level)
741 must_reflow.push_back(p0);
743 new_node_level = max_node_level;
746 if (max_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
747 new_node_content = liquid_kind;
749 new_node_content = floodable_node;
754 check if anything has changed. if not, just continue with the next node.
756 if (new_node_content == n0.getContent() &&
757 (m_nodedef->get(n0.getContent()).liquid_type != LIQUID_FLOWING ||
758 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
759 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
765 update the current node
768 //bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
769 if (m_nodedef->get(new_node_content).liquid_type == LIQUID_FLOWING) {
770 // set level to last 3 bits, flowing down bit to 4th bit
771 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
773 // set the liquid level and flow bit to 0
774 n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
778 n0.setContent(new_node_content);
780 // on_flood() the node
781 if (floodable_node != CONTENT_AIR) {
782 if (env->getScriptIface()->node_on_flood(p0, n00, n0))
786 // Ignore light (because calling voxalgo::update_lighting_nodes)
787 n0.setLight(LIGHTBANK_DAY, 0, m_nodedef);
788 n0.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
790 // Find out whether there is a suspect for this action
792 if (m_gamedef->rollback())
793 suspect = m_gamedef->rollback()->getSuspect(p0, 83, 1);
795 if (m_gamedef->rollback() && !suspect.empty()) {
797 RollbackScopeActor rollback_scope(m_gamedef->rollback(), suspect, true);
798 // Get old node for rollback
799 RollbackNode rollback_oldnode(this, p0, m_gamedef);
803 RollbackNode rollback_newnode(this, p0, m_gamedef);
804 RollbackAction action;
805 action.setSetNode(p0, rollback_oldnode, rollback_newnode);
806 m_gamedef->rollback()->reportAction(action);
812 v3s16 blockpos = getNodeBlockPos(p0);
813 MapBlock *block = getBlockNoCreateNoEx(blockpos);
815 modified_blocks[blockpos] = block;
816 changed_nodes.emplace_back(p0, n00);
820 enqueue neighbors for update if neccessary
822 switch (m_nodedef->get(n0.getContent()).liquid_type) {
825 // make sure source flows into all neighboring nodes
826 for (u16 i = 0; i < num_flows; i++)
827 if (flows[i].t != NEIGHBOR_UPPER)
828 m_transforming_liquid.push_back(flows[i].p);
829 for (u16 i = 0; i < num_airs; i++)
830 if (airs[i].t != NEIGHBOR_UPPER)
831 m_transforming_liquid.push_back(airs[i].p);
834 // this flow has turned to air; neighboring flows might need to do the same
835 for (u16 i = 0; i < num_flows; i++)
836 m_transforming_liquid.push_back(flows[i].p);
840 //infostream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
842 for (auto &iter : must_reflow)
843 m_transforming_liquid.push_back(iter);
845 voxalgo::update_lighting_nodes(this, changed_nodes, modified_blocks);
848 /* ----------------------------------------------------------------------
849 * Manage the queue so that it does not grow indefinately
851 u16 time_until_purge = g_settings->getU16("liquid_queue_purge_time");
853 if (time_until_purge == 0)
854 return; // Feature disabled
856 time_until_purge *= 1000; // seconds -> milliseconds
858 u64 curr_time = porting::getTimeMs();
859 u32 prev_unprocessed = m_unprocessed_count;
860 m_unprocessed_count = m_transforming_liquid.size();
862 // if unprocessed block count is decreasing or stable
863 if (m_unprocessed_count <= prev_unprocessed) {
864 m_queue_size_timer_started = false;
866 if (!m_queue_size_timer_started)
867 m_inc_trending_up_start_time = curr_time;
868 m_queue_size_timer_started = true;
871 // Account for curr_time overflowing
872 if (m_queue_size_timer_started && m_inc_trending_up_start_time > curr_time)
873 m_queue_size_timer_started = false;
875 /* If the queue has been growing for more than liquid_queue_purge_time seconds
876 * and the number of unprocessed blocks is still > liquid_loop_max then we
877 * cannot keep up; dump the oldest blocks from the queue so that the queue
878 * has liquid_loop_max items in it
880 if (m_queue_size_timer_started
881 && curr_time - m_inc_trending_up_start_time > time_until_purge
882 && m_unprocessed_count > liquid_loop_max) {
884 size_t dump_qty = m_unprocessed_count - liquid_loop_max;
886 infostream << "transformLiquids(): DUMPING " << dump_qty
887 << " blocks from the queue" << std::endl;
890 m_transforming_liquid.pop_front();
892 m_queue_size_timer_started = false; // optimistically assume we can keep up now
893 m_unprocessed_count = m_transforming_liquid.size();
897 std::vector<v3s16> Map::findNodesWithMetadata(v3s16 p1, v3s16 p2)
899 std::vector<v3s16> positions_with_meta;
901 sortBoxVerticies(p1, p2);
902 v3s16 bpmin = getNodeBlockPos(p1);
903 v3s16 bpmax = getNodeBlockPos(p2);
905 VoxelArea area(p1, p2);
907 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
908 for (s16 y = bpmin.Y; y <= bpmax.Y; y++)
909 for (s16 x = bpmin.X; x <= bpmax.X; x++) {
910 v3s16 blockpos(x, y, z);
912 MapBlock *block = getBlockNoCreateNoEx(blockpos);
914 verbosestream << "Map::getNodeMetadata(): Need to emerge "
915 << PP(blockpos) << std::endl;
916 block = emergeBlock(blockpos, false);
919 infostream << "WARNING: Map::getNodeMetadata(): Block not found"
924 v3s16 p_base = blockpos * MAP_BLOCKSIZE;
925 std::vector<v3s16> keys = block->m_node_metadata.getAllKeys();
926 for (size_t i = 0; i != keys.size(); i++) {
927 v3s16 p(keys[i] + p_base);
928 if (!area.contains(p))
931 positions_with_meta.push_back(p);
935 return positions_with_meta;
938 NodeMetadata *Map::getNodeMetadata(v3s16 p)
940 v3s16 blockpos = getNodeBlockPos(p);
941 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
942 MapBlock *block = getBlockNoCreateNoEx(blockpos);
944 infostream<<"Map::getNodeMetadata(): Need to emerge "
945 <<PP(blockpos)<<std::endl;
946 block = emergeBlock(blockpos, false);
949 warningstream<<"Map::getNodeMetadata(): Block not found"
953 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
957 bool Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
959 v3s16 blockpos = getNodeBlockPos(p);
960 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
961 MapBlock *block = getBlockNoCreateNoEx(blockpos);
963 infostream<<"Map::setNodeMetadata(): Need to emerge "
964 <<PP(blockpos)<<std::endl;
965 block = emergeBlock(blockpos, false);
968 warningstream<<"Map::setNodeMetadata(): Block not found"
972 block->m_node_metadata.set(p_rel, meta);
976 void Map::removeNodeMetadata(v3s16 p)
978 v3s16 blockpos = getNodeBlockPos(p);
979 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
980 MapBlock *block = getBlockNoCreateNoEx(blockpos);
983 warningstream<<"Map::removeNodeMetadata(): Block not found"
987 block->m_node_metadata.remove(p_rel);
990 NodeTimer Map::getNodeTimer(v3s16 p)
992 v3s16 blockpos = getNodeBlockPos(p);
993 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
994 MapBlock *block = getBlockNoCreateNoEx(blockpos);
996 infostream<<"Map::getNodeTimer(): Need to emerge "
997 <<PP(blockpos)<<std::endl;
998 block = emergeBlock(blockpos, false);
1001 warningstream<<"Map::getNodeTimer(): Block not found"
1005 NodeTimer t = block->m_node_timers.get(p_rel);
1006 NodeTimer nt(t.timeout, t.elapsed, p);
1010 void Map::setNodeTimer(const NodeTimer &t)
1012 v3s16 p = t.position;
1013 v3s16 blockpos = getNodeBlockPos(p);
1014 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1015 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1017 infostream<<"Map::setNodeTimer(): Need to emerge "
1018 <<PP(blockpos)<<std::endl;
1019 block = emergeBlock(blockpos, false);
1022 warningstream<<"Map::setNodeTimer(): Block not found"
1026 NodeTimer nt(t.timeout, t.elapsed, p_rel);
1027 block->m_node_timers.set(nt);
1030 void Map::removeNodeTimer(v3s16 p)
1032 v3s16 blockpos = getNodeBlockPos(p);
1033 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1034 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1037 warningstream<<"Map::removeNodeTimer(): Block not found"
1041 block->m_node_timers.remove(p_rel);
1044 bool Map::isOccluded(v3s16 p0, v3s16 p1, float step, float stepfac,
1045 float start_off, float end_off, u32 needed_count)
1047 float d0 = (float)BS * p0.getDistanceFrom(p1);
1049 v3f uf = v3f(u0.X, u0.Y, u0.Z) * BS;
1051 v3f p0f = v3f(p0.X, p0.Y, p0.Z) * BS;
1053 for(float s=start_off; s<d0+end_off; s+=step){
1054 v3f pf = p0f + uf * s;
1055 v3s16 p = floatToInt(pf, BS);
1056 MapNode n = getNode(p);
1057 const ContentFeatures &f = m_nodedef->get(n);
1058 if(f.drawtype == NDT_NORMAL){
1059 // not transparent, see ContentFeature::updateTextures
1061 if(count >= needed_count)
1069 bool Map::isBlockOccluded(MapBlock *block, v3s16 cam_pos_nodes) {
1070 v3s16 cpn = block->getPos() * MAP_BLOCKSIZE;
1071 cpn += v3s16(MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2);
1072 float step = BS * 1;
1073 float stepfac = 1.1;
1074 float startoff = BS * 1;
1075 // The occlusion search of 'isOccluded()' must stop short of the target
1076 // point by distance 'endoff' (end offset) to not enter the target mapblock.
1077 // For the 8 mapblock corners 'endoff' must therefore be the maximum diagonal
1078 // of a mapblock, because we must consider all view angles.
1079 // sqrt(1^2 + 1^2 + 1^2) = 1.732
1080 float endoff = -BS * MAP_BLOCKSIZE * 1.732050807569;
1081 s16 bs2 = MAP_BLOCKSIZE / 2 + 1;
1082 // to reduce the likelihood of falsely occluded blocks
1083 // require at least two solid blocks
1084 // this is a HACK, we should think of a more precise algorithm
1085 u32 needed_count = 2;
1088 // For the central point of the mapblock 'endoff' can be halved
1089 isOccluded(cam_pos_nodes, cpn,
1090 step, stepfac, startoff, endoff / 2.0f, needed_count) &&
1091 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,bs2),
1092 step, stepfac, startoff, endoff, needed_count) &&
1093 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,bs2,-bs2),
1094 step, stepfac, startoff, endoff, needed_count) &&
1095 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,-bs2,bs2),
1096 step, stepfac, startoff, endoff, needed_count) &&
1097 isOccluded(cam_pos_nodes, cpn + v3s16(bs2,-bs2,-bs2),
1098 step, stepfac, startoff, endoff, needed_count) &&
1099 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,bs2,bs2),
1100 step, stepfac, startoff, endoff, needed_count) &&
1101 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,bs2,-bs2),
1102 step, stepfac, startoff, endoff, needed_count) &&
1103 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,-bs2,bs2),
1104 step, stepfac, startoff, endoff, needed_count) &&
1105 isOccluded(cam_pos_nodes, cpn + v3s16(-bs2,-bs2,-bs2),
1106 step, stepfac, startoff, endoff, needed_count));
1112 ServerMap::ServerMap(const std::string &savedir, IGameDef *gamedef,
1113 EmergeManager *emerge):
1114 Map(dout_server, gamedef),
1115 settings_mgr(g_settings, savedir + DIR_DELIM + "map_meta.txt"),
1118 verbosestream<<FUNCTION_NAME<<std::endl;
1120 // Tell the EmergeManager about our MapSettingsManager
1121 emerge->map_settings_mgr = &settings_mgr;
1124 Try to load map; if not found, create a new one.
1127 // Determine which database backend to use
1128 std::string conf_path = savedir + DIR_DELIM + "world.mt";
1130 bool succeeded = conf.readConfigFile(conf_path.c_str());
1131 if (!succeeded || !conf.exists("backend")) {
1132 // fall back to sqlite3
1133 conf.set("backend", "sqlite3");
1135 std::string backend = conf.get("backend");
1136 dbase = createDatabase(backend, savedir, conf);
1137 if (conf.exists("readonly_backend")) {
1138 std::string readonly_dir = savedir + DIR_DELIM + "readonly";
1139 dbase_ro = createDatabase(conf.get("readonly_backend"), readonly_dir, conf);
1141 if (!conf.updateConfigFile(conf_path.c_str()))
1142 errorstream << "ServerMap::ServerMap(): Failed to update world.mt!" << std::endl;
1144 m_savedir = savedir;
1145 m_map_saving_enabled = false;
1148 // If directory exists, check contents and load if possible
1149 if (fs::PathExists(m_savedir)) {
1150 // If directory is empty, it is safe to save into it.
1151 if (fs::GetDirListing(m_savedir).empty()) {
1152 infostream<<"ServerMap: Empty save directory is valid."
1154 m_map_saving_enabled = true;
1159 if (settings_mgr.loadMapMeta()) {
1160 infostream << "ServerMap: Metadata loaded from "
1161 << savedir << std::endl;
1163 infostream << "ServerMap: Metadata could not be loaded "
1164 "from " << savedir << ", assuming valid save "
1165 "directory." << std::endl;
1168 m_map_saving_enabled = true;
1169 // Map loaded, not creating new one
1173 // If directory doesn't exist, it is safe to save to it
1175 m_map_saving_enabled = true;
1178 catch(std::exception &e)
1180 warningstream<<"ServerMap: Failed to load map from "<<savedir
1181 <<", exception: "<<e.what()<<std::endl;
1182 infostream<<"Please remove the map or fix it."<<std::endl;
1183 warningstream<<"Map saving will be disabled."<<std::endl;
1187 ServerMap::~ServerMap()
1189 verbosestream<<FUNCTION_NAME<<std::endl;
1193 if (m_map_saving_enabled) {
1194 // Save only changed parts
1195 save(MOD_STATE_WRITE_AT_UNLOAD);
1196 infostream << "ServerMap: Saved map to " << m_savedir << std::endl;
1198 infostream << "ServerMap: Map not saved" << std::endl;
1201 catch(std::exception &e)
1203 infostream<<"ServerMap: Failed to save map to "<<m_savedir
1204 <<", exception: "<<e.what()<<std::endl;
1208 Close database if it was opened
1218 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1219 for(; i.atEnd() == false; i++)
1221 MapChunk *chunk = i.getNode()->getValue();
1227 MapgenParams *ServerMap::getMapgenParams()
1229 // getMapgenParams() should only ever be called after Server is initialized
1230 assert(settings_mgr.mapgen_params != NULL);
1231 return settings_mgr.mapgen_params;
1234 u64 ServerMap::getSeed()
1236 return getMapgenParams()->seed;
1239 s16 ServerMap::getWaterLevel()
1241 return getMapgenParams()->water_level;
1244 bool ServerMap::blockpos_over_mapgen_limit(v3s16 p)
1246 const s16 mapgen_limit_bp = rangelim(
1247 getMapgenParams()->mapgen_limit, 0, MAX_MAP_GENERATION_LIMIT) /
1249 return p.X < -mapgen_limit_bp ||
1250 p.X > mapgen_limit_bp ||
1251 p.Y < -mapgen_limit_bp ||
1252 p.Y > mapgen_limit_bp ||
1253 p.Z < -mapgen_limit_bp ||
1254 p.Z > mapgen_limit_bp;
1257 bool ServerMap::initBlockMake(v3s16 blockpos, BlockMakeData *data)
1259 s16 csize = getMapgenParams()->chunksize;
1260 v3s16 bpmin = EmergeManager::getContainingChunk(blockpos, csize);
1261 v3s16 bpmax = bpmin + v3s16(1, 1, 1) * (csize - 1);
1263 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1264 EMERGE_DBG_OUT("initBlockMake(): " PP(bpmin) " - " PP(bpmax));
1266 v3s16 extra_borders(1, 1, 1);
1267 v3s16 full_bpmin = bpmin - extra_borders;
1268 v3s16 full_bpmax = bpmax + extra_borders;
1270 // Do nothing if not inside mapgen limits (+-1 because of neighbors)
1271 if (blockpos_over_mapgen_limit(full_bpmin) ||
1272 blockpos_over_mapgen_limit(full_bpmax))
1275 data->seed = getSeed();
1276 data->blockpos_min = bpmin;
1277 data->blockpos_max = bpmax;
1278 data->blockpos_requested = blockpos;
1279 data->nodedef = m_nodedef;
1282 Create the whole area of this and the neighboring blocks
1284 for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
1285 for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++) {
1286 v2s16 sectorpos(x, z);
1287 // Sector metadata is loaded from disk if not already loaded.
1288 MapSector *sector = createSector(sectorpos);
1289 FATAL_ERROR_IF(sector == NULL, "createSector() failed");
1291 for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
1294 MapBlock *block = emergeBlock(p, false);
1295 if (block == NULL) {
1296 block = createBlock(p);
1298 // Block gets sunlight if this is true.
1299 // Refer to the map generator heuristics.
1300 bool ug = m_emerge->isBlockUnderground(p);
1301 block->setIsUnderground(ug);
1307 Now we have a big empty area.
1309 Make a ManualMapVoxelManipulator that contains this and the
1313 data->vmanip = new MMVManip(this);
1314 data->vmanip->initialEmerge(full_bpmin, full_bpmax);
1316 // Note: we may need this again at some point.
1318 // Ensure none of the blocks to be generated were marked as
1319 // containing CONTENT_IGNORE
1320 for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
1321 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
1322 for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
1323 core::map<v3s16, u8>::Node *n;
1324 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
1327 u8 flags = n->getValue();
1328 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
1335 // Data is ready now.
1339 void ServerMap::finishBlockMake(BlockMakeData *data,
1340 std::map<v3s16, MapBlock*> *changed_blocks)
1342 v3s16 bpmin = data->blockpos_min;
1343 v3s16 bpmax = data->blockpos_max;
1345 v3s16 extra_borders(1, 1, 1);
1347 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1348 EMERGE_DBG_OUT("finishBlockMake(): " PP(bpmin) " - " PP(bpmax));
1351 Blit generated stuff to map
1352 NOTE: blitBackAll adds nearly everything to changed_blocks
1354 data->vmanip->blitBackAll(changed_blocks);
1356 EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()="
1357 << changed_blocks->size());
1360 Copy transforming liquid information
1362 while (data->transforming_liquid.size()) {
1363 m_transforming_liquid.push_back(data->transforming_liquid.front());
1364 data->transforming_liquid.pop_front();
1367 for (auto &changed_block : *changed_blocks) {
1368 MapBlock *block = changed_block.second;
1372 Update day/night difference cache of the MapBlocks
1374 block->expireDayNightDiff();
1376 Set block as modified
1378 block->raiseModified(MOD_STATE_WRITE_NEEDED,
1379 MOD_REASON_EXPIRE_DAYNIGHTDIFF);
1383 Set central blocks as generated
1385 for (s16 x = bpmin.X; x <= bpmax.X; x++)
1386 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
1387 for (s16 y = bpmin.Y; y <= bpmax.Y; y++) {
1388 MapBlock *block = getBlockNoCreateNoEx(v3s16(x, y, z));
1392 block->setGenerated(true);
1396 Save changed parts of map
1397 NOTE: Will be saved later.
1399 //save(MOD_STATE_WRITE_AT_UNLOAD);
1402 MapSector *ServerMap::createSector(v2s16 p2d)
1405 Check if it exists already in memory
1407 MapSector *sector = getSectorNoGenerateNoEx(p2d);
1412 Do not create over max mapgen limit
1414 const s16 max_limit_bp = MAX_MAP_GENERATION_LIMIT / MAP_BLOCKSIZE;
1415 if (p2d.X < -max_limit_bp ||
1416 p2d.X > max_limit_bp ||
1417 p2d.Y < -max_limit_bp ||
1418 p2d.Y > max_limit_bp)
1419 throw InvalidPositionException("createSector(): pos. over max mapgen limit");
1422 Generate blank sector
1425 sector = new MapSector(this, p2d, m_gamedef);
1427 // Sector position on map in nodes
1428 //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
1433 m_sectors[p2d] = sector;
1440 This is a quick-hand function for calling makeBlock().
1442 MapBlock * ServerMap::generateBlock(
1444 std::map<v3s16, MapBlock*> &modified_blocks
1447 bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
1449 TimeTaker timer("generateBlock");
1451 //MapBlock *block = original_dummy;
1453 v2s16 p2d(p.X, p.Z);
1454 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
1457 Do not generate over-limit
1459 if(blockpos_over_limit(p))
1461 infostream<<FUNCTION_NAME<<": Block position over limit"<<std::endl;
1462 throw InvalidPositionException("generateBlock(): pos. over limit");
1466 Create block make data
1469 initBlockMake(&data, p);
1475 TimeTaker t("mapgen::make_block()");
1476 mapgen->makeChunk(&data);
1477 //mapgen::make_block(&data);
1479 if(enable_mapgen_debug_info == false)
1480 t.stop(true); // Hide output
1484 Blit data back on map, update lighting, add mobs and whatever this does
1486 finishBlockMake(&data, modified_blocks);
1491 MapBlock *block = getBlockNoCreateNoEx(p);
1499 bool erroneus_content = false;
1500 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1501 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1502 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1505 MapNode n = block->getNode(p);
1506 if(n.getContent() == CONTENT_IGNORE)
1508 infostream<<"CONTENT_IGNORE at "
1509 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
1511 erroneus_content = true;
1515 if(erroneus_content)
1524 Generate a completely empty block
1528 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1529 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1531 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1534 n.setContent(CONTENT_AIR);
1535 block->setNode(v3s16(x0,y0,z0), n);
1541 if(enable_mapgen_debug_info == false)
1542 timer.stop(true); // Hide output
1548 MapBlock * ServerMap::createBlock(v3s16 p)
1551 Do not create over max mapgen limit
1553 if (blockpos_over_max_limit(p))
1554 throw InvalidPositionException("createBlock(): pos. over max mapgen limit");
1556 v2s16 p2d(p.X, p.Z);
1559 This will create or load a sector if not found in memory.
1560 If block exists on disk, it will be loaded.
1562 NOTE: On old save formats, this will be slow, as it generates
1563 lighting on blocks for them.
1567 sector = createSector(p2d);
1568 } catch (InvalidPositionException &e) {
1569 infostream<<"createBlock: createSector() failed"<<std::endl;
1574 Try to get a block from the sector
1577 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
1579 if(block->isDummy())
1584 block = sector->createBlankBlock(block_y);
1589 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
1592 MapBlock *block = getBlockNoCreateNoEx(p);
1593 if (block && !block->isDummy())
1598 MapBlock *block = loadBlock(p);
1604 MapSector *sector = createSector(v2s16(p.X, p.Z));
1605 MapBlock *block = sector->createBlankBlock(p.Y);
1613 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
1615 MapBlock *block = getBlockNoCreateNoEx(p3d);
1617 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
1622 // N.B. This requires no synchronization, since data will not be modified unless
1623 // the VoxelManipulator being updated belongs to the same thread.
1624 void ServerMap::updateVManip(v3s16 pos)
1626 Mapgen *mg = m_emerge->getCurrentMapgen();
1630 MMVManip *vm = mg->vm;
1634 if (!vm->m_area.contains(pos))
1637 s32 idx = vm->m_area.index(pos);
1638 vm->m_data[idx] = getNode(pos);
1639 vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
1641 vm->m_is_dirty = true;
1644 s16 ServerMap::findGroundLevel(v2s16 p2d)
1648 Uh, just do something random...
1650 // Find existing map from top to down
1653 v3s16 p(p2d.X, max, p2d.Y);
1654 for(; p.Y>min; p.Y--)
1656 MapNode n = getNodeNoEx(p);
1657 if(n.getContent() != CONTENT_IGNORE)
1662 // If this node is not air, go to plan b
1663 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
1665 // Search existing walkable and return it
1666 for(; p.Y>min; p.Y--)
1668 MapNode n = getNodeNoEx(p);
1669 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
1678 Determine from map generator noise functions
1681 s16 level = m_emerge->getGroundLevelAtPoint(p2d);
1684 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
1685 //return (s16)level;
1688 bool ServerMap::loadFromFolders() {
1689 if (!dbase->initialized() &&
1690 !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
1695 void ServerMap::createDirs(const std::string &path)
1697 if (!fs::CreateAllDirs(path)) {
1698 m_dout<<"ServerMap: Failed to create directory "
1699 <<"\""<<path<<"\""<<std::endl;
1700 throw BaseException("ServerMap failed to create directory");
1704 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
1710 porting::mt_snprintf(cc, sizeof(cc), "%.4x%.4x",
1711 (unsigned int) pos.X & 0xffff,
1712 (unsigned int) pos.Y & 0xffff);
1714 return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
1716 porting::mt_snprintf(cc, sizeof(cc), (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
1717 (unsigned int) pos.X & 0xfff,
1718 (unsigned int) pos.Y & 0xfff);
1720 return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
1727 v2s16 ServerMap::getSectorPos(const std::string &dirname)
1729 unsigned int x = 0, y = 0;
1731 std::string component;
1732 fs::RemoveLastPathComponent(dirname, &component, 1);
1733 if(component.size() == 8)
1736 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
1738 else if(component.size() == 3)
1741 fs::RemoveLastPathComponent(dirname, &component, 2);
1742 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
1743 // Sign-extend the 12 bit values up to 16 bits...
1744 if(x & 0x800) x |= 0xF000;
1745 if(y & 0x800) y |= 0xF000;
1752 FATAL_ERROR_IF(r != 2, "getSectorPos()");
1753 v2s16 pos((s16)x, (s16)y);
1757 v3s16 ServerMap::getBlockPos(const std::string §ordir, const std::string &blockfile)
1759 v2s16 p2d = getSectorPos(sectordir);
1761 if(blockfile.size() != 4){
1762 throw InvalidFilenameException("Invalid block filename");
1765 int r = sscanf(blockfile.c_str(), "%4x", &y);
1767 throw InvalidFilenameException("Invalid block filename");
1768 return v3s16(p2d.X, y, p2d.Y);
1771 std::string ServerMap::getBlockFilename(v3s16 p)
1774 porting::mt_snprintf(cc, sizeof(cc), "%.4x", (unsigned int)p.Y&0xffff);
1778 void ServerMap::save(ModifiedState save_level)
1780 if (!m_map_saving_enabled) {
1781 warningstream<<"Not saving map, saving disabled."<<std::endl;
1785 if(save_level == MOD_STATE_CLEAN)
1786 infostream<<"ServerMap: Saving whole map, this can take time."
1789 if (m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
1790 if (settings_mgr.saveMapMeta())
1791 m_map_metadata_changed = false;
1794 // Profile modified reasons
1795 Profiler modprofiler;
1797 u32 block_count = 0;
1798 u32 block_count_all = 0; // Number of blocks in memory
1800 // Don't do anything with sqlite unless something is really saved
1801 bool save_started = false;
1803 for (auto §or_it : m_sectors) {
1804 MapSector *sector = sector_it.second;
1806 MapBlockVect blocks;
1807 sector->getBlocks(blocks);
1809 for (MapBlock *block : blocks) {
1812 if(block->getModified() >= (u32)save_level) {
1816 save_started = true;
1819 modprofiler.add(block->getModifiedReasonString(), 1);
1831 Only print if something happened or saved whole map
1833 if(save_level == MOD_STATE_CLEAN
1834 || block_count != 0) {
1835 infostream<<"ServerMap: Written: "
1836 <<block_count<<" block files"
1837 <<", "<<block_count_all<<" blocks in memory."
1839 PrintInfo(infostream); // ServerMap/ClientMap:
1840 infostream<<"Blocks modified by: "<<std::endl;
1841 modprofiler.print(infostream);
1845 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
1847 if (loadFromFolders()) {
1848 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
1849 << "all blocks that are stored in flat files." << std::endl;
1851 dbase->listAllLoadableBlocks(dst);
1853 dbase_ro->listAllLoadableBlocks(dst);
1856 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
1858 for (auto §or_it : m_sectors) {
1859 MapSector *sector = sector_it.second;
1861 MapBlockVect blocks;
1862 sector->getBlocks(blocks);
1864 for (MapBlock *block : blocks) {
1865 v3s16 p = block->getPos();
1871 MapDatabase *ServerMap::createDatabase(
1872 const std::string &name,
1873 const std::string &savedir,
1876 if (name == "sqlite3")
1877 return new MapDatabaseSQLite3(savedir);
1878 if (name == "dummy")
1879 return new Database_Dummy();
1881 if (name == "leveldb")
1882 return new Database_LevelDB(savedir);
1885 if (name == "redis")
1886 return new Database_Redis(conf);
1889 if (name == "postgresql") {
1890 std::string connect_string;
1891 conf.getNoEx("pgsql_connection", connect_string);
1892 return new MapDatabasePostgreSQL(connect_string);
1896 throw BaseException(std::string("Database backend ") + name + " not supported.");
1899 void ServerMap::beginSave()
1904 void ServerMap::endSave()
1909 bool ServerMap::saveBlock(MapBlock *block)
1911 return saveBlock(block, dbase);
1914 bool ServerMap::saveBlock(MapBlock *block, MapDatabase *db)
1916 v3s16 p3d = block->getPos();
1918 // Dummy blocks are not written
1919 if (block->isDummy()) {
1920 warningstream << "saveBlock: Not writing dummy block "
1921 << PP(p3d) << std::endl;
1925 // Format used for writing
1926 u8 version = SER_FMT_VER_HIGHEST_WRITE;
1929 [0] u8 serialization version
1932 std::ostringstream o(std::ios_base::binary);
1933 o.write((char*) &version, 1);
1934 block->serialize(o, version, true);
1936 bool ret = db->saveBlock(p3d, o.str());
1938 // We just wrote it to the disk so clear modified flag
1939 block->resetModified();
1944 void ServerMap::loadBlock(const std::string §ordir, const std::string &blockfile,
1945 MapSector *sector, bool save_after_load)
1947 std::string fullpath = sectordir + DIR_DELIM + blockfile;
1949 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
1951 throw FileNotGoodException("Cannot open block file");
1953 v3s16 p3d = getBlockPos(sectordir, blockfile);
1954 v2s16 p2d(p3d.X, p3d.Z);
1956 assert(sector->getPos() == p2d);
1958 u8 version = SER_FMT_VER_INVALID;
1959 is.read((char*)&version, 1);
1962 throw SerializationError("ServerMap::loadBlock(): Failed"
1963 " to read MapBlock version");
1965 /*u32 block_size = MapBlock::serializedLength(version);
1966 SharedBuffer<u8> data(block_size);
1967 is.read((char*)*data, block_size);*/
1969 // This will always return a sector because we're the server
1970 //MapSector *sector = emergeSector(p2d);
1972 MapBlock *block = NULL;
1973 bool created_new = false;
1974 block = sector->getBlockNoCreateNoEx(p3d.Y);
1977 block = sector->createBlankBlockNoInsert(p3d.Y);
1982 block->deSerialize(is, version, true);
1984 // If it's a new block, insert it to the map
1986 sector->insertBlock(block);
1987 ReflowScan scanner(this, m_emerge->ndef);
1988 scanner.scan(block, &m_transforming_liquid);
1992 Save blocks loaded in old format in new format
1995 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
1999 // Should be in database now, so delete the old file
2000 fs::RecursiveDelete(fullpath);
2003 // We just loaded it from the disk, so it's up-to-date.
2004 block->resetModified();
2007 catch(SerializationError &e)
2009 warningstream<<"Invalid block data on disk "
2010 <<"fullpath="<<fullpath
2011 <<" (SerializationError). "
2012 <<"what()="<<e.what()
2014 // Ignoring. A new one will be generated.
2017 // TODO: Backup file; name is in fullpath.
2021 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
2024 std::istringstream is(*blob, std::ios_base::binary);
2026 u8 version = SER_FMT_VER_INVALID;
2027 is.read((char*)&version, 1);
2030 throw SerializationError("ServerMap::loadBlock(): Failed"
2031 " to read MapBlock version");
2033 MapBlock *block = NULL;
2034 bool created_new = false;
2035 block = sector->getBlockNoCreateNoEx(p3d.Y);
2038 block = sector->createBlankBlockNoInsert(p3d.Y);
2043 block->deSerialize(is, version, true);
2045 // If it's a new block, insert it to the map
2047 sector->insertBlock(block);
2048 ReflowScan scanner(this, m_emerge->ndef);
2049 scanner.scan(block, &m_transforming_liquid);
2053 Save blocks loaded in old format in new format
2056 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
2057 // Only save if asked to; no need to update version
2061 // We just loaded it from, so it's up-to-date.
2062 block->resetModified();
2064 catch(SerializationError &e)
2066 errorstream<<"Invalid block data in database"
2067 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
2068 <<" (SerializationError): "<<e.what()<<std::endl;
2070 // TODO: Block should be marked as invalid in memory so that it is
2071 // not touched but the game can run
2073 if(g_settings->getBool("ignore_world_load_errors")){
2074 errorstream<<"Ignoring block load error. Duck and cover! "
2075 <<"(ignore_world_load_errors)"<<std::endl;
2077 throw SerializationError("Invalid block data in database");
2082 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
2084 bool created_new = (getBlockNoCreateNoEx(blockpos) == NULL);
2086 v2s16 p2d(blockpos.X, blockpos.Z);
2089 dbase->loadBlock(blockpos, &ret);
2091 loadBlock(&ret, blockpos, createSector(p2d), false);
2092 } else if (dbase_ro) {
2093 dbase_ro->loadBlock(blockpos, &ret);
2095 loadBlock(&ret, blockpos, createSector(p2d), false);
2098 // Not found in database, try the files
2100 // The directory layout we're going to load from.
2101 // 1 - original sectors/xxxxzzzz/
2102 // 2 - new sectors2/xxx/zzz/
2103 // If we load from anything but the latest structure, we will
2104 // immediately save to the new one, and remove the old.
2105 std::string sectordir1 = getSectorDir(p2d, 1);
2106 std::string sectordir;
2107 if (fs::PathExists(sectordir1)) {
2108 sectordir = sectordir1;
2110 sectordir = getSectorDir(p2d, 2);
2114 Make sure sector is loaded
2117 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2120 Make sure file exists
2123 std::string blockfilename = getBlockFilename(blockpos);
2124 if (!fs::PathExists(sectordir + DIR_DELIM + blockfilename))
2128 Load block and save it to the database
2130 loadBlock(sectordir, blockfilename, sector, true);
2133 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2134 if (created_new && (block != NULL)) {
2135 std::map<v3s16, MapBlock*> modified_blocks;
2136 // Fix lighting if necessary
2137 voxalgo::update_block_border_lighting(this, block, modified_blocks);
2138 if (!modified_blocks.empty()) {
2139 //Modified lighting, send event
2141 event.type = MEET_OTHER;
2142 std::map<v3s16, MapBlock *>::iterator it;
2143 for (it = modified_blocks.begin();
2144 it != modified_blocks.end(); ++it)
2145 event.modified_blocks.insert(it->first);
2146 dispatchEvent(&event);
2152 bool ServerMap::deleteBlock(v3s16 blockpos)
2154 if (!dbase->deleteBlock(blockpos))
2157 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2159 v2s16 p2d(blockpos.X, blockpos.Z);
2160 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2163 sector->deleteBlock(block);
2169 void ServerMap::PrintInfo(std::ostream &out)
2174 bool ServerMap::repairBlockLight(v3s16 blockpos,
2175 std::map<v3s16, MapBlock *> *modified_blocks)
2177 MapBlock *block = emergeBlock(blockpos, false);
2178 if (!block || !block->isGenerated())
2180 voxalgo::repair_block_light(this, block, modified_blocks);
2184 MMVManip::MMVManip(Map *map):
2190 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
2191 bool load_if_inexistent)
2193 TimeTaker timer1("initialEmerge", &emerge_time);
2195 // Units of these are MapBlocks
2196 v3s16 p_min = blockpos_min;
2197 v3s16 p_max = blockpos_max;
2199 VoxelArea block_area_nodes
2200 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2202 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
2205 infostream<<"initialEmerge: area: ";
2206 block_area_nodes.print(infostream);
2207 infostream<<" ("<<size_MB<<"MB)";
2208 infostream<<std::endl;
2211 addArea(block_area_nodes);
2213 for(s32 z=p_min.Z; z<=p_max.Z; z++)
2214 for(s32 y=p_min.Y; y<=p_max.Y; y++)
2215 for(s32 x=p_min.X; x<=p_max.X; x++)
2220 std::map<v3s16, u8>::iterator n;
2221 n = m_loaded_blocks.find(p);
2222 if(n != m_loaded_blocks.end())
2225 bool block_data_inexistent = false;
2228 TimeTaker timer2("emerge load", &emerge_load_time);
2230 block = m_map->getBlockNoCreate(p);
2231 if(block->isDummy())
2232 block_data_inexistent = true;
2234 block->copyTo(*this);
2236 catch(InvalidPositionException &e)
2238 block_data_inexistent = true;
2241 if(block_data_inexistent)
2244 if (load_if_inexistent && !blockpos_over_max_limit(p)) {
2245 ServerMap *svrmap = (ServerMap *)m_map;
2246 block = svrmap->emergeBlock(p, false);
2248 block = svrmap->createBlock(p);
2249 block->copyTo(*this);
2251 flags |= VMANIP_BLOCK_DATA_INEXIST;
2254 Mark area inexistent
2256 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2257 // Fill with VOXELFLAG_NO_DATA
2258 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
2259 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
2261 s32 i = m_area.index(a.MinEdge.X,y,z);
2262 memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
2266 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
2268 // Mark that block was loaded as blank
2269 flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
2272 m_loaded_blocks[p] = flags;
2278 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
2279 bool overwrite_generated)
2281 if(m_area.getExtent() == v3s16(0,0,0))
2285 Copy data of all blocks
2287 for (auto &loaded_block : m_loaded_blocks) {
2288 v3s16 p = loaded_block.first;
2289 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
2290 bool existed = !(loaded_block.second & VMANIP_BLOCK_DATA_INEXIST);
2291 if (!existed || (block == NULL) ||
2292 (!overwrite_generated && block->isGenerated()))
2295 block->copyFrom(*this);
2296 block->raiseModified(MOD_STATE_WRITE_NEEDED, MOD_REASON_VMANIP);
2299 (*modified_blocks)[p] = block;