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_v6.h"
45 #include "database-dummy.h"
46 #include "database-sqlite3.h"
47 #include "script/scripting_server.h"
51 #include "database-leveldb.h"
54 #include "database-redis.h"
57 #include "database-postgresql.h"
65 Map::Map(std::ostream &dout, IGameDef *gamedef):
68 m_nodedef(gamedef->ndef())
77 for (auto §or : m_sectors) {
82 void Map::addEventReceiver(MapEventReceiver *event_receiver)
84 m_event_receivers.insert(event_receiver);
87 void Map::removeEventReceiver(MapEventReceiver *event_receiver)
89 m_event_receivers.erase(event_receiver);
92 void Map::dispatchEvent(MapEditEvent *event)
94 for (MapEventReceiver *event_receiver : m_event_receivers) {
95 event_receiver->onMapEditEvent(event);
99 MapSector * Map::getSectorNoGenerateNoExNoLock(v2s16 p)
101 if(m_sector_cache != NULL && p == m_sector_cache_p){
102 MapSector * sector = m_sector_cache;
106 std::map<v2s16, MapSector*>::iterator n = m_sectors.find(p);
108 if (n == m_sectors.end())
111 MapSector *sector = n->second;
113 // Cache the last result
114 m_sector_cache_p = p;
115 m_sector_cache = sector;
120 MapSector * Map::getSectorNoGenerateNoEx(v2s16 p)
122 return getSectorNoGenerateNoExNoLock(p);
125 MapSector * Map::getSectorNoGenerate(v2s16 p)
127 MapSector *sector = getSectorNoGenerateNoEx(p);
129 throw InvalidPositionException();
134 MapBlock * Map::getBlockNoCreateNoEx(v3s16 p3d)
136 v2s16 p2d(p3d.X, p3d.Z);
137 MapSector * sector = getSectorNoGenerateNoEx(p2d);
140 MapBlock *block = sector->getBlockNoCreateNoEx(p3d.Y);
144 MapBlock * Map::getBlockNoCreate(v3s16 p3d)
146 MapBlock *block = getBlockNoCreateNoEx(p3d);
148 throw InvalidPositionException();
152 bool Map::isNodeUnderground(v3s16 p)
154 v3s16 blockpos = getNodeBlockPos(p);
156 MapBlock * block = getBlockNoCreate(blockpos);
157 return block->getIsUnderground();
159 catch(InvalidPositionException &e)
165 bool Map::isValidPosition(v3s16 p)
167 v3s16 blockpos = getNodeBlockPos(p);
168 MapBlock *block = getBlockNoCreateNoEx(blockpos);
169 return (block != NULL);
172 // Returns a CONTENT_IGNORE node if not found
173 MapNode Map::getNodeNoEx(v3s16 p, bool *is_valid_position)
175 v3s16 blockpos = getNodeBlockPos(p);
176 MapBlock *block = getBlockNoCreateNoEx(blockpos);
178 if (is_valid_position != NULL)
179 *is_valid_position = false;
180 return {CONTENT_IGNORE};
183 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
185 MapNode node = block->getNodeNoCheck(relpos, &is_valid_p);
186 if (is_valid_position != NULL)
187 *is_valid_position = is_valid_p;
193 // throws InvalidPositionException if not found
194 // TODO: Now this is deprecated, getNodeNoEx should be renamed
195 MapNode Map::getNode(v3s16 p)
197 v3s16 blockpos = getNodeBlockPos(p);
198 MapBlock *block = getBlockNoCreateNoEx(blockpos);
200 throw InvalidPositionException();
201 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
202 bool is_valid_position;
203 MapNode node = block->getNodeNoCheck(relpos, &is_valid_position);
204 if (!is_valid_position)
205 throw InvalidPositionException();
210 // throws InvalidPositionException if not found
211 void Map::setNode(v3s16 p, MapNode & n)
213 v3s16 blockpos = getNodeBlockPos(p);
214 MapBlock *block = getBlockNoCreate(blockpos);
215 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
216 // Never allow placing CONTENT_IGNORE, it fucks up stuff
217 if(n.getContent() == CONTENT_IGNORE){
219 errorstream<<"Map::setNode(): Not allowing to place CONTENT_IGNORE"
220 <<" while trying to replace \""
221 <<m_nodedef->get(block->getNodeNoCheck(relpos, &temp_bool)).name
222 <<"\" at "<<PP(p)<<" (block "<<PP(blockpos)<<")"<<std::endl;
223 debug_stacks_print_to(infostream);
226 block->setNodeNoCheck(relpos, n);
229 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
230 std::map<v3s16, MapBlock*> &modified_blocks,
231 bool remove_metadata)
233 // Collect old node for rollback
234 RollbackNode rollback_oldnode(this, p, m_gamedef);
236 // This is needed for updating the lighting
237 MapNode oldnode = getNodeNoEx(p);
239 // Remove node metadata
240 if (remove_metadata) {
241 removeNodeMetadata(p);
244 // Set the node on the map
245 // Ignore light (because calling voxalgo::update_lighting_nodes)
246 n.setLight(LIGHTBANK_DAY, 0, m_nodedef);
247 n.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
251 std::vector<std::pair<v3s16, MapNode> > oldnodes;
252 oldnodes.emplace_back(p, oldnode);
253 voxalgo::update_lighting_nodes(this, oldnodes, modified_blocks);
255 for (auto &modified_block : modified_blocks) {
256 modified_block.second->expireDayNightDiff();
259 // Report for rollback
260 if(m_gamedef->rollback())
262 RollbackNode rollback_newnode(this, p, m_gamedef);
263 RollbackAction action;
264 action.setSetNode(p, rollback_oldnode, rollback_newnode);
265 m_gamedef->rollback()->reportAction(action);
269 Add neighboring liquid nodes and this node to transform queue.
270 (it's vital for the node itself to get updated last, if it was removed.)
273 for (const v3s16 &dir : g_7dirs) {
276 bool is_valid_position;
277 MapNode n2 = getNodeNoEx(p2, &is_valid_position);
278 if(is_valid_position &&
279 (m_nodedef->get(n2).isLiquid() ||
280 n2.getContent() == CONTENT_AIR))
281 m_transforming_liquid.push_back(p2);
285 void Map::removeNodeAndUpdate(v3s16 p,
286 std::map<v3s16, MapBlock*> &modified_blocks)
288 addNodeAndUpdate(p, MapNode(CONTENT_AIR), modified_blocks, true);
291 bool Map::addNodeWithEvent(v3s16 p, MapNode n, bool remove_metadata)
294 event.type = remove_metadata ? MEET_ADDNODE : MEET_SWAPNODE;
298 bool succeeded = true;
300 std::map<v3s16, MapBlock*> modified_blocks;
301 addNodeAndUpdate(p, n, modified_blocks, remove_metadata);
303 // Copy modified_blocks to event
304 for (auto &modified_block : modified_blocks) {
305 event.modified_blocks.insert(modified_block.first);
308 catch(InvalidPositionException &e){
312 dispatchEvent(&event);
317 bool Map::removeNodeWithEvent(v3s16 p)
320 event.type = MEET_REMOVENODE;
323 bool succeeded = true;
325 std::map<v3s16, MapBlock*> modified_blocks;
326 removeNodeAndUpdate(p, modified_blocks);
328 // Copy modified_blocks to event
329 for (auto &modified_block : modified_blocks) {
330 event.modified_blocks.insert(modified_block.first);
333 catch(InvalidPositionException &e){
337 dispatchEvent(&event);
342 struct TimeOrderedMapBlock {
346 TimeOrderedMapBlock(MapSector *sect, MapBlock *block) :
351 bool operator<(const TimeOrderedMapBlock &b) const
353 return block->getUsageTimer() < b.block->getUsageTimer();
360 void Map::timerUpdate(float dtime, float unload_timeout, u32 max_loaded_blocks,
361 std::vector<v3s16> *unloaded_blocks)
363 bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
365 // Profile modified reasons
366 Profiler modprofiler;
368 std::vector<v2s16> sector_deletion_queue;
369 u32 deleted_blocks_count = 0;
370 u32 saved_blocks_count = 0;
371 u32 block_count_all = 0;
375 // If there is no practical limit, we spare creation of mapblock_queue
376 if (max_loaded_blocks == U32_MAX) {
377 for (auto §or_it : m_sectors) {
378 MapSector *sector = sector_it.second;
380 bool all_blocks_deleted = true;
383 sector->getBlocks(blocks);
385 for (MapBlock *block : blocks) {
386 block->incrementUsageTimer(dtime);
388 if (block->refGet() == 0
389 && block->getUsageTimer() > unload_timeout) {
390 v3s16 p = block->getPos();
393 if (block->getModified() != MOD_STATE_CLEAN
394 && save_before_unloading) {
395 modprofiler.add(block->getModifiedReasonString(), 1);
396 if (!saveBlock(block))
398 saved_blocks_count++;
401 // Delete from memory
402 sector->deleteBlock(block);
405 unloaded_blocks->push_back(p);
407 deleted_blocks_count++;
409 all_blocks_deleted = false;
414 if (all_blocks_deleted) {
415 sector_deletion_queue.push_back(sector_it.first);
419 std::priority_queue<TimeOrderedMapBlock> mapblock_queue;
420 for (auto §or_it : m_sectors) {
421 MapSector *sector = sector_it.second;
424 sector->getBlocks(blocks);
426 for (MapBlock *block : blocks) {
427 block->incrementUsageTimer(dtime);
428 mapblock_queue.push(TimeOrderedMapBlock(sector, block));
431 block_count_all = mapblock_queue.size();
432 // Delete old blocks, and blocks over the limit from the memory
433 while (!mapblock_queue.empty() && (mapblock_queue.size() > max_loaded_blocks
434 || mapblock_queue.top().block->getUsageTimer() > unload_timeout)) {
435 TimeOrderedMapBlock b = mapblock_queue.top();
436 mapblock_queue.pop();
438 MapBlock *block = b.block;
440 if (block->refGet() != 0)
443 v3s16 p = block->getPos();
446 if (block->getModified() != MOD_STATE_CLEAN && save_before_unloading) {
447 modprofiler.add(block->getModifiedReasonString(), 1);
448 if (!saveBlock(block))
450 saved_blocks_count++;
453 // Delete from memory
454 b.sect->deleteBlock(block);
457 unloaded_blocks->push_back(p);
459 deleted_blocks_count++;
462 // Delete empty sectors
463 for (auto §or_it : m_sectors) {
464 if (sector_it.second->empty()) {
465 sector_deletion_queue.push_back(sector_it.first);
471 // Finally delete the empty sectors
472 deleteSectors(sector_deletion_queue);
474 if(deleted_blocks_count != 0)
476 PrintInfo(infostream); // ServerMap/ClientMap:
477 infostream<<"Unloaded "<<deleted_blocks_count
478 <<" blocks from memory";
479 if(save_before_unloading)
480 infostream<<", of which "<<saved_blocks_count<<" were written";
481 infostream<<", "<<block_count_all<<" blocks in memory";
482 infostream<<"."<<std::endl;
483 if(saved_blocks_count != 0){
484 PrintInfo(infostream); // ServerMap/ClientMap:
485 infostream<<"Blocks modified by: "<<std::endl;
486 modprofiler.print(infostream);
491 void Map::unloadUnreferencedBlocks(std::vector<v3s16> *unloaded_blocks)
493 timerUpdate(0.0, -1.0, 0, unloaded_blocks);
496 void Map::deleteSectors(std::vector<v2s16> §orList)
498 for (v2s16 j : sectorList) {
499 MapSector *sector = m_sectors[j];
500 // If sector is in sector cache, remove it from there
501 if(m_sector_cache == sector)
502 m_sector_cache = NULL;
503 // Remove from map and delete
509 void Map::PrintInfo(std::ostream &out)
514 #define WATER_DROP_BOOST 4
521 struct NodeNeighbor {
531 NodeNeighbor(const MapNode &node, NeighborType n_type, v3s16 pos)
538 void Map::transforming_liquid_add(v3s16 p) {
539 m_transforming_liquid.push_back(p);
542 s32 Map::transforming_liquid_size() {
543 return m_transforming_liquid.size();
546 void Map::transformLiquids(std::map<v3s16, MapBlock*> &modified_blocks,
547 ServerEnvironment *env)
549 DSTACK(FUNCTION_NAME);
550 //TimeTaker timer("transformLiquids()");
553 u32 initial_size = m_transforming_liquid.size();
555 /*if(initial_size != 0)
556 infostream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
558 // list of nodes that due to viscosity have not reached their max level height
559 std::deque<v3s16> must_reflow;
561 std::vector<std::pair<v3s16, MapNode> > changed_nodes;
563 u32 liquid_loop_max = g_settings->getS32("liquid_loop_max");
564 u32 loop_max = liquid_loop_max;
568 /* If liquid_loop_max is not keeping up with the queue size increase
569 * loop_max up to a maximum of liquid_loop_max * dedicated_server_step.
571 if (m_transforming_liquid.size() > loop_max * 2) {
573 float server_step = g_settings->getFloat("dedicated_server_step");
574 if (m_transforming_liquid_loop_count_multiplier - 1.0 < server_step)
575 m_transforming_liquid_loop_count_multiplier *= 1.0 + server_step / 10;
577 m_transforming_liquid_loop_count_multiplier = 1.0;
580 loop_max *= m_transforming_liquid_loop_count_multiplier;
583 while (m_transforming_liquid.size() != 0)
585 // This should be done here so that it is done when continue is used
586 if (loopcount >= initial_size || loopcount >= loop_max)
591 Get a queued transforming liquid node
593 v3s16 p0 = m_transforming_liquid.front();
594 m_transforming_liquid.pop_front();
596 MapNode n0 = getNodeNoEx(p0);
599 Collect information about current node
601 s8 liquid_level = -1;
602 // The liquid node which will be placed there if
603 // the liquid flows into this node.
604 content_t liquid_kind = CONTENT_IGNORE;
605 // The node which will be placed there if liquid
606 // can't flow into this node.
607 content_t floodable_node = CONTENT_AIR;
608 const ContentFeatures &cf = m_nodedef->get(n0);
609 LiquidType liquid_type = cf.liquid_type;
610 switch (liquid_type) {
612 liquid_level = LIQUID_LEVEL_SOURCE;
613 liquid_kind = m_nodedef->getId(cf.liquid_alternative_flowing);
616 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
617 liquid_kind = n0.getContent();
620 // if this node is 'floodable', it *could* be transformed
621 // into a liquid, otherwise, continue with the next node.
624 floodable_node = n0.getContent();
625 liquid_kind = CONTENT_AIR;
630 Collect information about the environment
632 const v3s16 *dirs = g_6dirs;
633 NodeNeighbor sources[6]; // surrounding sources
635 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
637 NodeNeighbor airs[6]; // surrounding air
639 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
640 int num_neutrals = 0;
641 bool flowing_down = false;
642 bool ignored_sources = false;
643 for (u16 i = 0; i < 6; i++) {
644 NeighborType nt = NEIGHBOR_SAME_LEVEL;
653 v3s16 npos = p0 + dirs[i];
654 NodeNeighbor nb(getNodeNoEx(npos), nt, npos);
655 const ContentFeatures &cfnb = m_nodedef->get(nb.n);
656 switch (m_nodedef->get(nb.n.getContent()).liquid_type) {
658 if (cfnb.floodable) {
659 airs[num_airs++] = nb;
660 // if the current node is a water source the neighbor
661 // should be enqueded for transformation regardless of whether the
662 // current node changes or not.
663 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
664 m_transforming_liquid.push_back(npos);
665 // if the current node happens to be a flowing node, it will start to flow down here.
666 if (nb.t == NEIGHBOR_LOWER)
669 neutrals[num_neutrals++] = nb;
670 if (nb.n.getContent() == CONTENT_IGNORE) {
671 // If node below is ignore prevent water from
672 // spreading outwards and otherwise prevent from
673 // flowing away as ignore node might be the source
674 if (nb.t == NEIGHBOR_LOWER)
677 ignored_sources = true;
682 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
683 if (liquid_kind == CONTENT_AIR)
684 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
685 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
686 neutrals[num_neutrals++] = nb;
688 // Do not count bottom source, it will screw things up
690 sources[num_sources++] = nb;
694 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
695 if (liquid_kind == CONTENT_AIR)
696 liquid_kind = m_nodedef->getId(cfnb.liquid_alternative_flowing);
697 if (m_nodedef->getId(cfnb.liquid_alternative_flowing) != liquid_kind) {
698 neutrals[num_neutrals++] = nb;
700 flows[num_flows++] = nb;
701 if (nb.t == NEIGHBOR_LOWER)
709 decide on the type (and possibly level) of the current node
711 content_t new_node_content;
712 s8 new_node_level = -1;
713 s8 max_node_level = -1;
715 u8 range = m_nodedef->get(liquid_kind).liquid_range;
716 if (range > LIQUID_LEVEL_MAX + 1)
717 range = LIQUID_LEVEL_MAX + 1;
719 if ((num_sources >= 2 && m_nodedef->get(liquid_kind).liquid_renewable) || liquid_type == LIQUID_SOURCE) {
720 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
721 // or the flowing alternative of the first of the surrounding sources (if it's air), so
722 // it's perfectly safe to use liquid_kind here to determine the new node content.
723 new_node_content = m_nodedef->getId(m_nodedef->get(liquid_kind).liquid_alternative_source);
724 } else if (num_sources >= 1 && sources[0].t != NEIGHBOR_LOWER) {
725 // liquid_kind is set properly, see above
726 max_node_level = new_node_level = LIQUID_LEVEL_MAX;
727 if (new_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
728 new_node_content = liquid_kind;
730 new_node_content = floodable_node;
731 } else if (ignored_sources && liquid_level >= 0) {
732 // Maybe there are neighbouring sources that aren't loaded yet
733 // so prevent flowing away.
734 new_node_level = liquid_level;
735 new_node_content = liquid_kind;
737 // no surrounding sources, so get the maximum level that can flow into this node
738 for (u16 i = 0; i < num_flows; i++) {
739 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
740 switch (flows[i].t) {
742 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
743 max_node_level = LIQUID_LEVEL_MAX;
744 if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
745 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
746 } else if (nb_liquid_level > max_node_level) {
747 max_node_level = nb_liquid_level;
752 case NEIGHBOR_SAME_LEVEL:
753 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
754 nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level)
755 max_node_level = nb_liquid_level - 1;
760 u8 viscosity = m_nodedef->get(liquid_kind).liquid_viscosity;
761 if (viscosity > 1 && max_node_level != liquid_level) {
762 // amount to gain, limited by viscosity
763 // must be at least 1 in absolute value
764 s8 level_inc = max_node_level - liquid_level;
765 if (level_inc < -viscosity || level_inc > viscosity)
766 new_node_level = liquid_level + level_inc/viscosity;
767 else if (level_inc < 0)
768 new_node_level = liquid_level - 1;
769 else if (level_inc > 0)
770 new_node_level = liquid_level + 1;
771 if (new_node_level != max_node_level)
772 must_reflow.push_back(p0);
774 new_node_level = max_node_level;
777 if (max_node_level >= (LIQUID_LEVEL_MAX + 1 - range))
778 new_node_content = liquid_kind;
780 new_node_content = floodable_node;
785 check if anything has changed. if not, just continue with the next node.
787 if (new_node_content == n0.getContent() &&
788 (m_nodedef->get(n0.getContent()).liquid_type != LIQUID_FLOWING ||
789 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
790 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
796 update the current node
799 //bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
800 if (m_nodedef->get(new_node_content).liquid_type == LIQUID_FLOWING) {
801 // set level to last 3 bits, flowing down bit to 4th bit
802 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
804 // set the liquid level and flow bit to 0
805 n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
809 n0.setContent(new_node_content);
811 // on_flood() the node
812 if (floodable_node != CONTENT_AIR) {
813 if (env->getScriptIface()->node_on_flood(p0, n00, n0))
817 // Ignore light (because calling voxalgo::update_lighting_nodes)
818 n0.setLight(LIGHTBANK_DAY, 0, m_nodedef);
819 n0.setLight(LIGHTBANK_NIGHT, 0, m_nodedef);
821 // Find out whether there is a suspect for this action
823 if (m_gamedef->rollback())
824 suspect = m_gamedef->rollback()->getSuspect(p0, 83, 1);
826 if (m_gamedef->rollback() && !suspect.empty()) {
828 RollbackScopeActor rollback_scope(m_gamedef->rollback(), suspect, true);
829 // Get old node for rollback
830 RollbackNode rollback_oldnode(this, p0, m_gamedef);
834 RollbackNode rollback_newnode(this, p0, m_gamedef);
835 RollbackAction action;
836 action.setSetNode(p0, rollback_oldnode, rollback_newnode);
837 m_gamedef->rollback()->reportAction(action);
843 v3s16 blockpos = getNodeBlockPos(p0);
844 MapBlock *block = getBlockNoCreateNoEx(blockpos);
846 modified_blocks[blockpos] = block;
847 changed_nodes.emplace_back(p0, n00);
851 enqueue neighbors for update if neccessary
853 switch (m_nodedef->get(n0.getContent()).liquid_type) {
856 // make sure source flows into all neighboring nodes
857 for (u16 i = 0; i < num_flows; i++)
858 if (flows[i].t != NEIGHBOR_UPPER)
859 m_transforming_liquid.push_back(flows[i].p);
860 for (u16 i = 0; i < num_airs; i++)
861 if (airs[i].t != NEIGHBOR_UPPER)
862 m_transforming_liquid.push_back(airs[i].p);
865 // this flow has turned to air; neighboring flows might need to do the same
866 for (u16 i = 0; i < num_flows; i++)
867 m_transforming_liquid.push_back(flows[i].p);
871 //infostream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
873 for (auto &iter : must_reflow)
874 m_transforming_liquid.push_back(iter);
876 voxalgo::update_lighting_nodes(this, changed_nodes, modified_blocks);
879 /* ----------------------------------------------------------------------
880 * Manage the queue so that it does not grow indefinately
882 u16 time_until_purge = g_settings->getU16("liquid_queue_purge_time");
884 if (time_until_purge == 0)
885 return; // Feature disabled
887 time_until_purge *= 1000; // seconds -> milliseconds
889 u64 curr_time = porting::getTimeMs();
890 u32 prev_unprocessed = m_unprocessed_count;
891 m_unprocessed_count = m_transforming_liquid.size();
893 // if unprocessed block count is decreasing or stable
894 if (m_unprocessed_count <= prev_unprocessed) {
895 m_queue_size_timer_started = false;
897 if (!m_queue_size_timer_started)
898 m_inc_trending_up_start_time = curr_time;
899 m_queue_size_timer_started = true;
902 // Account for curr_time overflowing
903 if (m_queue_size_timer_started && m_inc_trending_up_start_time > curr_time)
904 m_queue_size_timer_started = false;
906 /* If the queue has been growing for more than liquid_queue_purge_time seconds
907 * and the number of unprocessed blocks is still > liquid_loop_max then we
908 * cannot keep up; dump the oldest blocks from the queue so that the queue
909 * has liquid_loop_max items in it
911 if (m_queue_size_timer_started
912 && curr_time - m_inc_trending_up_start_time > time_until_purge
913 && m_unprocessed_count > liquid_loop_max) {
915 size_t dump_qty = m_unprocessed_count - liquid_loop_max;
917 infostream << "transformLiquids(): DUMPING " << dump_qty
918 << " blocks from the queue" << std::endl;
921 m_transforming_liquid.pop_front();
923 m_queue_size_timer_started = false; // optimistically assume we can keep up now
924 m_unprocessed_count = m_transforming_liquid.size();
928 std::vector<v3s16> Map::findNodesWithMetadata(v3s16 p1, v3s16 p2)
930 std::vector<v3s16> positions_with_meta;
932 sortBoxVerticies(p1, p2);
933 v3s16 bpmin = getNodeBlockPos(p1);
934 v3s16 bpmax = getNodeBlockPos(p2);
936 VoxelArea area(p1, p2);
938 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
939 for (s16 y = bpmin.Y; y <= bpmax.Y; y++)
940 for (s16 x = bpmin.X; x <= bpmax.X; x++) {
941 v3s16 blockpos(x, y, z);
943 MapBlock *block = getBlockNoCreateNoEx(blockpos);
945 verbosestream << "Map::getNodeMetadata(): Need to emerge "
946 << PP(blockpos) << std::endl;
947 block = emergeBlock(blockpos, false);
950 infostream << "WARNING: Map::getNodeMetadata(): Block not found"
955 v3s16 p_base = blockpos * MAP_BLOCKSIZE;
956 std::vector<v3s16> keys = block->m_node_metadata.getAllKeys();
957 for (size_t i = 0; i != keys.size(); i++) {
958 v3s16 p(keys[i] + p_base);
959 if (!area.contains(p))
962 positions_with_meta.push_back(p);
966 return positions_with_meta;
969 NodeMetadata *Map::getNodeMetadata(v3s16 p)
971 v3s16 blockpos = getNodeBlockPos(p);
972 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
973 MapBlock *block = getBlockNoCreateNoEx(blockpos);
975 infostream<<"Map::getNodeMetadata(): Need to emerge "
976 <<PP(blockpos)<<std::endl;
977 block = emergeBlock(blockpos, false);
980 warningstream<<"Map::getNodeMetadata(): Block not found"
984 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
988 bool Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
990 v3s16 blockpos = getNodeBlockPos(p);
991 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
992 MapBlock *block = getBlockNoCreateNoEx(blockpos);
994 infostream<<"Map::setNodeMetadata(): Need to emerge "
995 <<PP(blockpos)<<std::endl;
996 block = emergeBlock(blockpos, false);
999 warningstream<<"Map::setNodeMetadata(): Block not found"
1003 block->m_node_metadata.set(p_rel, meta);
1007 void Map::removeNodeMetadata(v3s16 p)
1009 v3s16 blockpos = getNodeBlockPos(p);
1010 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1011 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1014 warningstream<<"Map::removeNodeMetadata(): Block not found"
1018 block->m_node_metadata.remove(p_rel);
1021 NodeTimer Map::getNodeTimer(v3s16 p)
1023 v3s16 blockpos = getNodeBlockPos(p);
1024 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1025 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1027 infostream<<"Map::getNodeTimer(): Need to emerge "
1028 <<PP(blockpos)<<std::endl;
1029 block = emergeBlock(blockpos, false);
1032 warningstream<<"Map::getNodeTimer(): Block not found"
1036 NodeTimer t = block->m_node_timers.get(p_rel);
1037 NodeTimer nt(t.timeout, t.elapsed, p);
1041 void Map::setNodeTimer(const NodeTimer &t)
1043 v3s16 p = t.position;
1044 v3s16 blockpos = getNodeBlockPos(p);
1045 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1046 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1048 infostream<<"Map::setNodeTimer(): Need to emerge "
1049 <<PP(blockpos)<<std::endl;
1050 block = emergeBlock(blockpos, false);
1053 warningstream<<"Map::setNodeTimer(): Block not found"
1057 NodeTimer nt(t.timeout, t.elapsed, p_rel);
1058 block->m_node_timers.set(nt);
1061 void Map::removeNodeTimer(v3s16 p)
1063 v3s16 blockpos = getNodeBlockPos(p);
1064 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1065 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1068 warningstream<<"Map::removeNodeTimer(): Block not found"
1072 block->m_node_timers.remove(p_rel);
1075 bool Map::isOccluded(v3s16 p0, v3s16 p1, float step, float stepfac,
1076 float start_off, float end_off, u32 needed_count)
1078 float d0 = (float)BS * p0.getDistanceFrom(p1);
1080 v3f uf = v3f(u0.X, u0.Y, u0.Z) * BS;
1082 v3f p0f = v3f(p0.X, p0.Y, p0.Z) * BS;
1084 for(float s=start_off; s<d0+end_off; s+=step){
1085 v3f pf = p0f + uf * s;
1086 v3s16 p = floatToInt(pf, BS);
1087 MapNode n = getNodeNoEx(p);
1088 const ContentFeatures &f = m_nodedef->get(n);
1089 if(f.drawtype == NDT_NORMAL){
1090 // not transparent, see ContentFeature::updateTextures
1092 if(count >= needed_count)
1100 bool Map::isBlockOccluded(MapBlock *block, v3s16 cam_pos_nodes) {
1101 v3s16 cpn = block->getPos() * MAP_BLOCKSIZE;
1102 cpn += v3s16(MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2, MAP_BLOCKSIZE / 2);
1103 float step = BS * 1;
1104 float stepfac = 1.1;
1105 float startoff = BS * 1;
1106 // The occlusion search of 'isOccluded()' must stop short of the target
1107 // point by distance 'endoff' (end offset) to not enter the target mapblock.
1108 // For the 8 mapblock corners 'endoff' must therefore be the maximum diagonal
1109 // of a mapblock, because we must consider all view angles.
1110 // sqrt(1^2 + 1^2 + 1^2) = 1.732
1111 float endoff = -BS * MAP_BLOCKSIZE * 1.732050807569;
1112 v3s16 spn = cam_pos_nodes;
1113 s16 bs2 = MAP_BLOCKSIZE / 2 + 1;
1114 // to reduce the likelihood of falsely occluded blocks
1115 // require at least two solid blocks
1116 // this is a HACK, we should think of a more precise algorithm
1117 u32 needed_count = 2;
1120 // For the central point of the mapblock 'endoff' can be halved
1121 isOccluded(spn, cpn,
1122 step, stepfac, startoff, endoff / 2.0f, needed_count) &&
1123 isOccluded(spn, cpn + v3s16(bs2,bs2,bs2),
1124 step, stepfac, startoff, endoff, needed_count) &&
1125 isOccluded(spn, cpn + v3s16(bs2,bs2,-bs2),
1126 step, stepfac, startoff, endoff, needed_count) &&
1127 isOccluded(spn, cpn + v3s16(bs2,-bs2,bs2),
1128 step, stepfac, startoff, endoff, needed_count) &&
1129 isOccluded(spn, cpn + v3s16(bs2,-bs2,-bs2),
1130 step, stepfac, startoff, endoff, needed_count) &&
1131 isOccluded(spn, cpn + v3s16(-bs2,bs2,bs2),
1132 step, stepfac, startoff, endoff, needed_count) &&
1133 isOccluded(spn, cpn + v3s16(-bs2,bs2,-bs2),
1134 step, stepfac, startoff, endoff, needed_count) &&
1135 isOccluded(spn, cpn + v3s16(-bs2,-bs2,bs2),
1136 step, stepfac, startoff, endoff, needed_count) &&
1137 isOccluded(spn, cpn + v3s16(-bs2,-bs2,-bs2),
1138 step, stepfac, startoff, endoff, needed_count));
1144 ServerMap::ServerMap(const std::string &savedir, IGameDef *gamedef,
1145 EmergeManager *emerge):
1146 Map(dout_server, gamedef),
1147 settings_mgr(g_settings, savedir + DIR_DELIM + "map_meta.txt"),
1150 verbosestream<<FUNCTION_NAME<<std::endl;
1152 // Tell the EmergeManager about our MapSettingsManager
1153 emerge->map_settings_mgr = &settings_mgr;
1156 Try to load map; if not found, create a new one.
1159 // Determine which database backend to use
1160 std::string conf_path = savedir + DIR_DELIM + "world.mt";
1162 bool succeeded = conf.readConfigFile(conf_path.c_str());
1163 if (!succeeded || !conf.exists("backend")) {
1164 // fall back to sqlite3
1165 conf.set("backend", "sqlite3");
1167 std::string backend = conf.get("backend");
1168 dbase = createDatabase(backend, savedir, conf);
1170 if (!conf.updateConfigFile(conf_path.c_str()))
1171 errorstream << "ServerMap::ServerMap(): Failed to update world.mt!" << std::endl;
1173 m_savedir = savedir;
1174 m_map_saving_enabled = false;
1177 // If directory exists, check contents and load if possible
1178 if (fs::PathExists(m_savedir)) {
1179 // If directory is empty, it is safe to save into it.
1180 if (fs::GetDirListing(m_savedir).empty()) {
1181 infostream<<"ServerMap: Empty save directory is valid."
1183 m_map_saving_enabled = true;
1188 if (settings_mgr.loadMapMeta()) {
1189 infostream << "ServerMap: Metadata loaded from "
1190 << savedir << std::endl;
1192 infostream << "ServerMap: Metadata could not be loaded "
1193 "from " << savedir << ", assuming valid save "
1194 "directory." << std::endl;
1197 m_map_saving_enabled = true;
1198 // Map loaded, not creating new one
1202 // If directory doesn't exist, it is safe to save to it
1204 m_map_saving_enabled = true;
1207 catch(std::exception &e)
1209 warningstream<<"ServerMap: Failed to load map from "<<savedir
1210 <<", exception: "<<e.what()<<std::endl;
1211 infostream<<"Please remove the map or fix it."<<std::endl;
1212 warningstream<<"Map saving will be disabled."<<std::endl;
1216 ServerMap::~ServerMap()
1218 verbosestream<<FUNCTION_NAME<<std::endl;
1222 if (m_map_saving_enabled) {
1223 // Save only changed parts
1224 save(MOD_STATE_WRITE_AT_UNLOAD);
1225 infostream << "ServerMap: Saved map to " << m_savedir << std::endl;
1227 infostream << "ServerMap: Map not saved" << std::endl;
1230 catch(std::exception &e)
1232 infostream<<"ServerMap: Failed to save map to "<<m_savedir
1233 <<", exception: "<<e.what()<<std::endl;
1237 Close database if it was opened
1245 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1246 for(; i.atEnd() == false; i++)
1248 MapChunk *chunk = i.getNode()->getValue();
1254 MapgenParams *ServerMap::getMapgenParams()
1256 // getMapgenParams() should only ever be called after Server is initialized
1257 assert(settings_mgr.mapgen_params != NULL);
1258 return settings_mgr.mapgen_params;
1261 u64 ServerMap::getSeed()
1263 return getMapgenParams()->seed;
1266 s16 ServerMap::getWaterLevel()
1268 return getMapgenParams()->water_level;
1271 bool ServerMap::saoPositionOverLimit(const v3f &p)
1273 return getMapgenParams()->saoPosOverLimit(p);
1276 bool ServerMap::blockpos_over_mapgen_limit(v3s16 p)
1278 const s16 mapgen_limit_bp = rangelim(
1279 getMapgenParams()->mapgen_limit, 0, MAX_MAP_GENERATION_LIMIT) /
1281 return p.X < -mapgen_limit_bp ||
1282 p.X > mapgen_limit_bp ||
1283 p.Y < -mapgen_limit_bp ||
1284 p.Y > mapgen_limit_bp ||
1285 p.Z < -mapgen_limit_bp ||
1286 p.Z > mapgen_limit_bp;
1289 bool ServerMap::initBlockMake(v3s16 blockpos, BlockMakeData *data)
1291 s16 csize = getMapgenParams()->chunksize;
1292 v3s16 bpmin = EmergeManager::getContainingChunk(blockpos, csize);
1293 v3s16 bpmax = bpmin + v3s16(1, 1, 1) * (csize - 1);
1295 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1296 EMERGE_DBG_OUT("initBlockMake(): " PP(bpmin) " - " PP(bpmax));
1298 v3s16 extra_borders(1, 1, 1);
1299 v3s16 full_bpmin = bpmin - extra_borders;
1300 v3s16 full_bpmax = bpmax + extra_borders;
1302 // Do nothing if not inside mapgen limits (+-1 because of neighbors)
1303 if (blockpos_over_mapgen_limit(full_bpmin) ||
1304 blockpos_over_mapgen_limit(full_bpmax))
1307 data->seed = getSeed();
1308 data->blockpos_min = bpmin;
1309 data->blockpos_max = bpmax;
1310 data->blockpos_requested = blockpos;
1311 data->nodedef = m_nodedef;
1314 Create the whole area of this and the neighboring blocks
1316 for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
1317 for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++) {
1318 v2s16 sectorpos(x, z);
1319 // Sector metadata is loaded from disk if not already loaded.
1320 MapSector *sector = createSector(sectorpos);
1321 FATAL_ERROR_IF(sector == NULL, "createSector() failed");
1323 for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
1326 MapBlock *block = emergeBlock(p, false);
1327 if (block == NULL) {
1328 block = createBlock(p);
1330 // Block gets sunlight if this is true.
1331 // Refer to the map generator heuristics.
1332 bool ug = m_emerge->isBlockUnderground(p);
1333 block->setIsUnderground(ug);
1339 Now we have a big empty area.
1341 Make a ManualMapVoxelManipulator that contains this and the
1345 data->vmanip = new MMVManip(this);
1346 data->vmanip->initialEmerge(full_bpmin, full_bpmax);
1348 // Note: we may need this again at some point.
1350 // Ensure none of the blocks to be generated were marked as
1351 // containing CONTENT_IGNORE
1352 for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
1353 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
1354 for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
1355 core::map<v3s16, u8>::Node *n;
1356 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
1359 u8 flags = n->getValue();
1360 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
1367 // Data is ready now.
1371 void ServerMap::finishBlockMake(BlockMakeData *data,
1372 std::map<v3s16, MapBlock*> *changed_blocks)
1374 v3s16 bpmin = data->blockpos_min;
1375 v3s16 bpmax = data->blockpos_max;
1377 v3s16 extra_borders(1, 1, 1);
1379 bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
1380 EMERGE_DBG_OUT("finishBlockMake(): " PP(bpmin) " - " PP(bpmax));
1383 Blit generated stuff to map
1384 NOTE: blitBackAll adds nearly everything to changed_blocks
1386 data->vmanip->blitBackAll(changed_blocks);
1388 EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()="
1389 << changed_blocks->size());
1392 Copy transforming liquid information
1394 while (data->transforming_liquid.size()) {
1395 m_transforming_liquid.push_back(data->transforming_liquid.front());
1396 data->transforming_liquid.pop_front();
1399 for (auto &changed_block : *changed_blocks) {
1400 MapBlock *block = changed_block.second;
1404 Update day/night difference cache of the MapBlocks
1406 block->expireDayNightDiff();
1408 Set block as modified
1410 block->raiseModified(MOD_STATE_WRITE_NEEDED,
1411 MOD_REASON_EXPIRE_DAYNIGHTDIFF);
1415 Set central blocks as generated
1417 for (s16 x = bpmin.X; x <= bpmax.X; x++)
1418 for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
1419 for (s16 y = bpmin.Y; y <= bpmax.Y; y++) {
1420 MapBlock *block = getBlockNoCreateNoEx(v3s16(x, y, z));
1424 block->setGenerated(true);
1428 Save changed parts of map
1429 NOTE: Will be saved later.
1431 //save(MOD_STATE_WRITE_AT_UNLOAD);
1434 MapSector *ServerMap::createSector(v2s16 p2d)
1436 DSTACKF("%s: p2d=(%d,%d)",
1441 Check if it exists already in memory
1443 MapSector *sector = getSectorNoGenerateNoEx(p2d);
1448 Do not create over max mapgen limit
1450 const s16 max_limit_bp = MAX_MAP_GENERATION_LIMIT / MAP_BLOCKSIZE;
1451 if (p2d.X < -max_limit_bp ||
1452 p2d.X > max_limit_bp ||
1453 p2d.Y < -max_limit_bp ||
1454 p2d.Y > max_limit_bp)
1455 throw InvalidPositionException("createSector(): pos. over max mapgen limit");
1458 Generate blank sector
1461 sector = new MapSector(this, p2d, m_gamedef);
1463 // Sector position on map in nodes
1464 //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
1469 m_sectors[p2d] = sector;
1476 This is a quick-hand function for calling makeBlock().
1478 MapBlock * ServerMap::generateBlock(
1480 std::map<v3s16, MapBlock*> &modified_blocks
1483 DSTACKF("%s: p=(%d,%d,%d)", FUNCTION_NAME, p.X, p.Y, p.Z);
1485 /*infostream<<"generateBlock(): "
1486 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
1489 bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
1491 TimeTaker timer("generateBlock");
1493 //MapBlock *block = original_dummy;
1495 v2s16 p2d(p.X, p.Z);
1496 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
1499 Do not generate over-limit
1501 if(blockpos_over_limit(p))
1503 infostream<<FUNCTION_NAME<<": Block position over limit"<<std::endl;
1504 throw InvalidPositionException("generateBlock(): pos. over limit");
1508 Create block make data
1511 initBlockMake(&data, p);
1517 TimeTaker t("mapgen::make_block()");
1518 mapgen->makeChunk(&data);
1519 //mapgen::make_block(&data);
1521 if(enable_mapgen_debug_info == false)
1522 t.stop(true); // Hide output
1526 Blit data back on map, update lighting, add mobs and whatever this does
1528 finishBlockMake(&data, modified_blocks);
1533 MapBlock *block = getBlockNoCreateNoEx(p);
1541 bool erroneus_content = false;
1542 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1543 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1544 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1547 MapNode n = block->getNode(p);
1548 if(n.getContent() == CONTENT_IGNORE)
1550 infostream<<"CONTENT_IGNORE at "
1551 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
1553 erroneus_content = true;
1557 if(erroneus_content)
1566 Generate a completely empty block
1570 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
1571 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
1573 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
1576 n.setContent(CONTENT_AIR);
1577 block->setNode(v3s16(x0,y0,z0), n);
1583 if(enable_mapgen_debug_info == false)
1584 timer.stop(true); // Hide output
1590 MapBlock * ServerMap::createBlock(v3s16 p)
1592 DSTACKF("%s: p=(%d,%d,%d)",
1593 FUNCTION_NAME, p.X, p.Y, p.Z);
1596 Do not create over max mapgen limit
1598 if (blockpos_over_max_limit(p))
1599 throw InvalidPositionException("createBlock(): pos. over max mapgen limit");
1601 v2s16 p2d(p.X, p.Z);
1604 This will create or load a sector if not found in memory.
1605 If block exists on disk, it will be loaded.
1607 NOTE: On old save formats, this will be slow, as it generates
1608 lighting on blocks for them.
1612 sector = createSector(p2d);
1613 } catch (InvalidPositionException &e) {
1614 infostream<<"createBlock: createSector() failed"<<std::endl;
1619 Try to get a block from the sector
1622 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
1624 if(block->isDummy())
1629 block = sector->createBlankBlock(block_y);
1634 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
1636 DSTACKF("%s: p=(%d,%d,%d), create_blank=%d",
1638 p.X, p.Y, p.Z, create_blank);
1641 MapBlock *block = getBlockNoCreateNoEx(p);
1642 if (block && !block->isDummy())
1647 MapBlock *block = loadBlock(p);
1653 MapSector *sector = createSector(v2s16(p.X, p.Z));
1654 MapBlock *block = sector->createBlankBlock(p.Y);
1662 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
1664 MapBlock *block = getBlockNoCreateNoEx(p3d);
1666 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
1671 // N.B. This requires no synchronization, since data will not be modified unless
1672 // the VoxelManipulator being updated belongs to the same thread.
1673 void ServerMap::updateVManip(v3s16 pos)
1675 Mapgen *mg = m_emerge->getCurrentMapgen();
1679 MMVManip *vm = mg->vm;
1683 if (!vm->m_area.contains(pos))
1686 s32 idx = vm->m_area.index(pos);
1687 vm->m_data[idx] = getNodeNoEx(pos);
1688 vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
1690 vm->m_is_dirty = true;
1693 s16 ServerMap::findGroundLevel(v2s16 p2d)
1697 Uh, just do something random...
1699 // Find existing map from top to down
1702 v3s16 p(p2d.X, max, p2d.Y);
1703 for(; p.Y>min; p.Y--)
1705 MapNode n = getNodeNoEx(p);
1706 if(n.getContent() != CONTENT_IGNORE)
1711 // If this node is not air, go to plan b
1712 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
1714 // Search existing walkable and return it
1715 for(; p.Y>min; p.Y--)
1717 MapNode n = getNodeNoEx(p);
1718 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
1727 Determine from map generator noise functions
1730 s16 level = m_emerge->getGroundLevelAtPoint(p2d);
1733 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
1734 //return (s16)level;
1737 bool ServerMap::loadFromFolders() {
1738 if (!dbase->initialized() &&
1739 !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
1744 void ServerMap::createDirs(std::string path)
1746 if (!fs::CreateAllDirs(path)) {
1747 m_dout<<"ServerMap: Failed to create directory "
1748 <<"\""<<path<<"\""<<std::endl;
1749 throw BaseException("ServerMap failed to create directory");
1753 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
1759 snprintf(cc, 9, "%.4x%.4x",
1760 (unsigned int) pos.X & 0xffff,
1761 (unsigned int) pos.Y & 0xffff);
1763 return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
1765 snprintf(cc, 9, (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
1766 (unsigned int) pos.X & 0xfff,
1767 (unsigned int) pos.Y & 0xfff);
1769 return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
1776 v2s16 ServerMap::getSectorPos(const std::string &dirname)
1778 unsigned int x = 0, y = 0;
1780 std::string component;
1781 fs::RemoveLastPathComponent(dirname, &component, 1);
1782 if(component.size() == 8)
1785 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
1787 else if(component.size() == 3)
1790 fs::RemoveLastPathComponent(dirname, &component, 2);
1791 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
1792 // Sign-extend the 12 bit values up to 16 bits...
1793 if(x & 0x800) x |= 0xF000;
1794 if(y & 0x800) y |= 0xF000;
1801 FATAL_ERROR_IF(r != 2, "getSectorPos()");
1802 v2s16 pos((s16)x, (s16)y);
1806 v3s16 ServerMap::getBlockPos(const std::string §ordir, const std::string &blockfile)
1808 v2s16 p2d = getSectorPos(sectordir);
1810 if(blockfile.size() != 4){
1811 throw InvalidFilenameException("Invalid block filename");
1814 int r = sscanf(blockfile.c_str(), "%4x", &y);
1816 throw InvalidFilenameException("Invalid block filename");
1817 return v3s16(p2d.X, y, p2d.Y);
1820 std::string ServerMap::getBlockFilename(v3s16 p)
1823 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
1827 void ServerMap::save(ModifiedState save_level)
1829 DSTACK(FUNCTION_NAME);
1830 if (!m_map_saving_enabled) {
1831 warningstream<<"Not saving map, saving disabled."<<std::endl;
1835 if(save_level == MOD_STATE_CLEAN)
1836 infostream<<"ServerMap: Saving whole map, this can take time."
1839 if (m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
1840 if (settings_mgr.saveMapMeta())
1841 m_map_metadata_changed = false;
1844 // Profile modified reasons
1845 Profiler modprofiler;
1847 u32 block_count = 0;
1848 u32 block_count_all = 0; // Number of blocks in memory
1850 // Don't do anything with sqlite unless something is really saved
1851 bool save_started = false;
1853 for (auto §or_it : m_sectors) {
1854 MapSector *sector = sector_it.second;
1856 MapBlockVect blocks;
1857 sector->getBlocks(blocks);
1859 for (MapBlock *block : blocks) {
1862 if(block->getModified() >= (u32)save_level) {
1866 save_started = true;
1869 modprofiler.add(block->getModifiedReasonString(), 1);
1881 Only print if something happened or saved whole map
1883 if(save_level == MOD_STATE_CLEAN
1884 || block_count != 0) {
1885 infostream<<"ServerMap: Written: "
1886 <<block_count<<" block files"
1887 <<", "<<block_count_all<<" blocks in memory."
1889 PrintInfo(infostream); // ServerMap/ClientMap:
1890 infostream<<"Blocks modified by: "<<std::endl;
1891 modprofiler.print(infostream);
1895 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
1897 if (loadFromFolders()) {
1898 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
1899 << "all blocks that are stored in flat files." << std::endl;
1901 dbase->listAllLoadableBlocks(dst);
1904 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
1906 for (auto §or_it : m_sectors) {
1907 MapSector *sector = sector_it.second;
1909 MapBlockVect blocks;
1910 sector->getBlocks(blocks);
1912 for (MapBlock *block : blocks) {
1913 v3s16 p = block->getPos();
1919 MapDatabase *ServerMap::createDatabase(
1920 const std::string &name,
1921 const std::string &savedir,
1924 if (name == "sqlite3")
1925 return new MapDatabaseSQLite3(savedir);
1926 if (name == "dummy")
1927 return new Database_Dummy();
1929 if (name == "leveldb")
1930 return new Database_LevelDB(savedir);
1933 if (name == "redis")
1934 return new Database_Redis(conf);
1937 if (name == "postgresql") {
1938 std::string connect_string;
1939 conf.getNoEx("pgsql_connection", connect_string);
1940 return new MapDatabasePostgreSQL(connect_string);
1944 throw BaseException(std::string("Database backend ") + name + " not supported.");
1947 void ServerMap::beginSave()
1952 void ServerMap::endSave()
1957 bool ServerMap::saveBlock(MapBlock *block)
1959 return saveBlock(block, dbase);
1962 bool ServerMap::saveBlock(MapBlock *block, MapDatabase *db)
1964 v3s16 p3d = block->getPos();
1966 // Dummy blocks are not written
1967 if (block->isDummy()) {
1968 warningstream << "saveBlock: Not writing dummy block "
1969 << PP(p3d) << std::endl;
1973 // Format used for writing
1974 u8 version = SER_FMT_VER_HIGHEST_WRITE;
1977 [0] u8 serialization version
1980 std::ostringstream o(std::ios_base::binary);
1981 o.write((char*) &version, 1);
1982 block->serialize(o, version, true);
1984 bool ret = db->saveBlock(p3d, o.str());
1986 // We just wrote it to the disk so clear modified flag
1987 block->resetModified();
1992 void ServerMap::loadBlock(const std::string §ordir, const std::string &blockfile,
1993 MapSector *sector, bool save_after_load)
1995 DSTACK(FUNCTION_NAME);
1997 std::string fullpath = sectordir + DIR_DELIM + blockfile;
1999 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2001 throw FileNotGoodException("Cannot open block file");
2003 v3s16 p3d = getBlockPos(sectordir, blockfile);
2004 v2s16 p2d(p3d.X, p3d.Z);
2006 assert(sector->getPos() == p2d);
2008 u8 version = SER_FMT_VER_INVALID;
2009 is.read((char*)&version, 1);
2012 throw SerializationError("ServerMap::loadBlock(): Failed"
2013 " to read MapBlock version");
2015 /*u32 block_size = MapBlock::serializedLength(version);
2016 SharedBuffer<u8> data(block_size);
2017 is.read((char*)*data, block_size);*/
2019 // This will always return a sector because we're the server
2020 //MapSector *sector = emergeSector(p2d);
2022 MapBlock *block = NULL;
2023 bool created_new = false;
2024 block = sector->getBlockNoCreateNoEx(p3d.Y);
2027 block = sector->createBlankBlockNoInsert(p3d.Y);
2032 block->deSerialize(is, version, true);
2034 // If it's a new block, insert it to the map
2036 sector->insertBlock(block);
2037 ReflowScan scanner(this, m_emerge->ndef);
2038 scanner.scan(block, &m_transforming_liquid);
2042 Save blocks loaded in old format in new format
2045 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
2049 // Should be in database now, so delete the old file
2050 fs::RecursiveDelete(fullpath);
2053 // We just loaded it from the disk, so it's up-to-date.
2054 block->resetModified();
2057 catch(SerializationError &e)
2059 warningstream<<"Invalid block data on disk "
2060 <<"fullpath="<<fullpath
2061 <<" (SerializationError). "
2062 <<"what()="<<e.what()
2064 // Ignoring. A new one will be generated.
2067 // TODO: Backup file; name is in fullpath.
2071 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
2073 DSTACK(FUNCTION_NAME);
2076 std::istringstream is(*blob, std::ios_base::binary);
2078 u8 version = SER_FMT_VER_INVALID;
2079 is.read((char*)&version, 1);
2082 throw SerializationError("ServerMap::loadBlock(): Failed"
2083 " to read MapBlock version");
2085 MapBlock *block = NULL;
2086 bool created_new = false;
2087 block = sector->getBlockNoCreateNoEx(p3d.Y);
2090 block = sector->createBlankBlockNoInsert(p3d.Y);
2095 block->deSerialize(is, version, true);
2097 // If it's a new block, insert it to the map
2099 sector->insertBlock(block);
2100 ReflowScan scanner(this, m_emerge->ndef);
2101 scanner.scan(block, &m_transforming_liquid);
2105 Save blocks loaded in old format in new format
2108 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
2109 // Only save if asked to; no need to update version
2113 // We just loaded it from, so it's up-to-date.
2114 block->resetModified();
2116 catch(SerializationError &e)
2118 errorstream<<"Invalid block data in database"
2119 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
2120 <<" (SerializationError): "<<e.what()<<std::endl;
2122 // TODO: Block should be marked as invalid in memory so that it is
2123 // not touched but the game can run
2125 if(g_settings->getBool("ignore_world_load_errors")){
2126 errorstream<<"Ignoring block load error. Duck and cover! "
2127 <<"(ignore_world_load_errors)"<<std::endl;
2129 throw SerializationError("Invalid block data in database");
2134 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
2136 DSTACK(FUNCTION_NAME);
2138 bool created_new = (getBlockNoCreateNoEx(blockpos) == NULL);
2140 v2s16 p2d(blockpos.X, blockpos.Z);
2143 dbase->loadBlock(blockpos, &ret);
2145 loadBlock(&ret, blockpos, createSector(p2d), false);
2147 // Not found in database, try the files
2149 // The directory layout we're going to load from.
2150 // 1 - original sectors/xxxxzzzz/
2151 // 2 - new sectors2/xxx/zzz/
2152 // If we load from anything but the latest structure, we will
2153 // immediately save to the new one, and remove the old.
2154 std::string sectordir1 = getSectorDir(p2d, 1);
2155 std::string sectordir;
2156 if (fs::PathExists(sectordir1)) {
2157 sectordir = sectordir1;
2159 sectordir = getSectorDir(p2d, 2);
2163 Make sure sector is loaded
2166 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2169 Make sure file exists
2172 std::string blockfilename = getBlockFilename(blockpos);
2173 if (!fs::PathExists(sectordir + DIR_DELIM + blockfilename))
2177 Load block and save it to the database
2179 loadBlock(sectordir, blockfilename, sector, true);
2182 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2183 if (created_new && (block != NULL)) {
2184 std::map<v3s16, MapBlock*> modified_blocks;
2185 // Fix lighting if necessary
2186 voxalgo::update_block_border_lighting(this, block, modified_blocks);
2187 if (!modified_blocks.empty()) {
2188 //Modified lighting, send event
2190 event.type = MEET_OTHER;
2191 std::map<v3s16, MapBlock *>::iterator it;
2192 for (it = modified_blocks.begin();
2193 it != modified_blocks.end(); ++it)
2194 event.modified_blocks.insert(it->first);
2195 dispatchEvent(&event);
2201 bool ServerMap::deleteBlock(v3s16 blockpos)
2203 if (!dbase->deleteBlock(blockpos))
2206 MapBlock *block = getBlockNoCreateNoEx(blockpos);
2208 v2s16 p2d(blockpos.X, blockpos.Z);
2209 MapSector *sector = getSectorNoGenerateNoEx(p2d);
2212 sector->deleteBlock(block);
2218 void ServerMap::PrintInfo(std::ostream &out)
2223 bool ServerMap::repairBlockLight(v3s16 blockpos,
2224 std::map<v3s16, MapBlock *> *modified_blocks)
2226 MapBlock *block = emergeBlock(blockpos, false);
2227 if (!block || !block->isGenerated())
2229 voxalgo::repair_block_light(this, block, modified_blocks);
2233 MMVManip::MMVManip(Map *map):
2239 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
2240 bool load_if_inexistent)
2242 TimeTaker timer1("initialEmerge", &emerge_time);
2244 // Units of these are MapBlocks
2245 v3s16 p_min = blockpos_min;
2246 v3s16 p_max = blockpos_max;
2248 VoxelArea block_area_nodes
2249 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2251 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
2254 infostream<<"initialEmerge: area: ";
2255 block_area_nodes.print(infostream);
2256 infostream<<" ("<<size_MB<<"MB)";
2257 infostream<<std::endl;
2260 addArea(block_area_nodes);
2262 for(s32 z=p_min.Z; z<=p_max.Z; z++)
2263 for(s32 y=p_min.Y; y<=p_max.Y; y++)
2264 for(s32 x=p_min.X; x<=p_max.X; x++)
2269 std::map<v3s16, u8>::iterator n;
2270 n = m_loaded_blocks.find(p);
2271 if(n != m_loaded_blocks.end())
2274 bool block_data_inexistent = false;
2277 TimeTaker timer1("emerge load", &emerge_load_time);
2279 block = m_map->getBlockNoCreate(p);
2280 if(block->isDummy())
2281 block_data_inexistent = true;
2283 block->copyTo(*this);
2285 catch(InvalidPositionException &e)
2287 block_data_inexistent = true;
2290 if(block_data_inexistent)
2293 if (load_if_inexistent && !blockpos_over_max_limit(p)) {
2294 ServerMap *svrmap = (ServerMap *)m_map;
2295 block = svrmap->emergeBlock(p, false);
2297 block = svrmap->createBlock(p);
2298 block->copyTo(*this);
2300 flags |= VMANIP_BLOCK_DATA_INEXIST;
2303 Mark area inexistent
2305 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
2306 // Fill with VOXELFLAG_NO_DATA
2307 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
2308 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
2310 s32 i = m_area.index(a.MinEdge.X,y,z);
2311 memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
2315 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
2317 // Mark that block was loaded as blank
2318 flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
2321 m_loaded_blocks[p] = flags;
2327 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
2328 bool overwrite_generated)
2330 if(m_area.getExtent() == v3s16(0,0,0))
2334 Copy data of all blocks
2336 for (auto &loaded_block : m_loaded_blocks) {
2337 v3s16 p = loaded_block.first;
2338 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
2339 bool existed = !(loaded_block.second & VMANIP_BLOCK_DATA_INEXIST);
2340 if (!existed || (block == NULL) ||
2341 (!overwrite_generated && block->isGenerated()))
2344 block->copyFrom(*this);
2347 (*modified_blocks)[p] = block;