3 Copyright (C) 2010-2011 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 General Public License as published by
7 the Free Software Foundation; either version 2 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 General Public License for more details.
15 You should have received a copy of the GNU 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"
30 #include "nodemetadata.h"
36 SQLite format specification:
37 - Initially only replaces sectors/ and sectors2/
44 Map::Map(std::ostream &dout):
48 /*m_sector_mutex.Init();
49 assert(m_sector_mutex.IsInitialized());*/
57 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
58 for(; i.atEnd() == false; i++)
60 MapSector *sector = i.getNode()->getValue();
65 void Map::addEventReceiver(MapEventReceiver *event_receiver)
67 m_event_receivers.insert(event_receiver, false);
70 void Map::removeEventReceiver(MapEventReceiver *event_receiver)
72 if(m_event_receivers.find(event_receiver) == NULL)
74 m_event_receivers.remove(event_receiver);
77 void Map::dispatchEvent(MapEditEvent *event)
79 for(core::map<MapEventReceiver*, bool>::Iterator
80 i = m_event_receivers.getIterator();
81 i.atEnd()==false; i++)
83 MapEventReceiver* event_receiver = i.getNode()->getKey();
84 event_receiver->onMapEditEvent(event);
88 MapSector * Map::getSectorNoGenerateNoExNoLock(v2s16 p)
90 if(m_sector_cache != NULL && p == m_sector_cache_p){
91 MapSector * sector = m_sector_cache;
95 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p);
100 MapSector *sector = n->getValue();
102 // Cache the last result
103 m_sector_cache_p = p;
104 m_sector_cache = sector;
109 MapSector * Map::getSectorNoGenerateNoEx(v2s16 p)
111 return getSectorNoGenerateNoExNoLock(p);
114 MapSector * Map::getSectorNoGenerate(v2s16 p)
116 MapSector *sector = getSectorNoGenerateNoEx(p);
118 throw InvalidPositionException();
123 MapBlock * Map::getBlockNoCreateNoEx(v3s16 p3d)
125 v2s16 p2d(p3d.X, p3d.Z);
126 MapSector * sector = getSectorNoGenerateNoEx(p2d);
129 MapBlock *block = sector->getBlockNoCreateNoEx(p3d.Y);
133 MapBlock * Map::getBlockNoCreate(v3s16 p3d)
135 MapBlock *block = getBlockNoCreateNoEx(p3d);
137 throw InvalidPositionException();
141 bool Map::isNodeUnderground(v3s16 p)
143 v3s16 blockpos = getNodeBlockPos(p);
145 MapBlock * block = getBlockNoCreate(blockpos);
146 return block->getIsUnderground();
148 catch(InvalidPositionException &e)
154 bool Map::isValidPosition(v3s16 p)
156 v3s16 blockpos = getNodeBlockPos(p);
157 MapBlock *block = getBlockNoCreate(blockpos);
158 return (block != NULL);
161 // Returns a CONTENT_IGNORE node if not found
162 MapNode Map::getNodeNoEx(v3s16 p)
164 v3s16 blockpos = getNodeBlockPos(p);
165 MapBlock *block = getBlockNoCreateNoEx(blockpos);
167 return MapNode(CONTENT_IGNORE);
168 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
169 return block->getNodeNoCheck(relpos);
172 // throws InvalidPositionException if not found
173 MapNode Map::getNode(v3s16 p)
175 v3s16 blockpos = getNodeBlockPos(p);
176 MapBlock *block = getBlockNoCreateNoEx(blockpos);
178 throw InvalidPositionException();
179 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
180 return block->getNodeNoCheck(relpos);
183 // throws InvalidPositionException if not found
184 void Map::setNode(v3s16 p, MapNode & n)
186 v3s16 blockpos = getNodeBlockPos(p);
187 MapBlock *block = getBlockNoCreate(blockpos);
188 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
189 block->setNodeNoCheck(relpos, n);
194 Goes recursively through the neighbours of the node.
196 Alters only transparent nodes.
198 If the lighting of the neighbour is lower than the lighting of
199 the node was (before changing it to 0 at the step before), the
200 lighting of the neighbour is set to 0 and then the same stuff
201 repeats for the neighbour.
203 The ending nodes of the routine are stored in light_sources.
204 This is useful when a light is removed. In such case, this
205 routine can be called for the light node and then again for
206 light_sources to re-light the area without the removed light.
208 values of from_nodes are lighting values.
210 void Map::unspreadLight(enum LightBank bank,
211 core::map<v3s16, u8> & from_nodes,
212 core::map<v3s16, bool> & light_sources,
213 core::map<v3s16, MapBlock*> & modified_blocks)
216 v3s16(0,0,1), // back
218 v3s16(1,0,0), // right
219 v3s16(0,0,-1), // front
220 v3s16(0,-1,0), // bottom
221 v3s16(-1,0,0), // left
224 if(from_nodes.size() == 0)
227 u32 blockchangecount = 0;
229 core::map<v3s16, u8> unlighted_nodes;
230 core::map<v3s16, u8>::Iterator j;
231 j = from_nodes.getIterator();
234 Initialize block cache
237 MapBlock *block = NULL;
238 // Cache this a bit, too
239 bool block_checked_in_modified = false;
241 for(; j.atEnd() == false; j++)
243 v3s16 pos = j.getNode()->getKey();
244 v3s16 blockpos = getNodeBlockPos(pos);
246 // Only fetch a new block if the block position has changed
248 if(block == NULL || blockpos != blockpos_last){
249 block = getBlockNoCreate(blockpos);
250 blockpos_last = blockpos;
252 block_checked_in_modified = false;
256 catch(InvalidPositionException &e)
264 // Calculate relative position in block
265 v3s16 relpos = pos - blockpos_last * MAP_BLOCKSIZE;
267 // Get node straight from the block
268 MapNode n = block->getNode(relpos);
270 u8 oldlight = j.getNode()->getValue();
272 // Loop through 6 neighbors
273 for(u16 i=0; i<6; i++)
275 // Get the position of the neighbor node
276 v3s16 n2pos = pos + dirs[i];
278 // Get the block where the node is located
279 v3s16 blockpos = getNodeBlockPos(n2pos);
283 // Only fetch a new block if the block position has changed
285 if(block == NULL || blockpos != blockpos_last){
286 block = getBlockNoCreate(blockpos);
287 blockpos_last = blockpos;
289 block_checked_in_modified = false;
293 catch(InvalidPositionException &e)
298 // Calculate relative position in block
299 v3s16 relpos = n2pos - blockpos * MAP_BLOCKSIZE;
300 // Get node straight from the block
301 MapNode n2 = block->getNode(relpos);
303 bool changed = false;
305 //TODO: Optimize output by optimizing light_sources?
308 If the neighbor is dimmer than what was specified
309 as oldlight (the light of the previous node)
311 if(n2.getLight(bank) < oldlight)
314 And the neighbor is transparent and it has some light
316 if(n2.light_propagates() && n2.getLight(bank) != 0)
319 Set light to 0 and add to queue
322 u8 current_light = n2.getLight(bank);
323 n2.setLight(bank, 0);
324 block->setNode(relpos, n2);
326 unlighted_nodes.insert(n2pos, current_light);
330 Remove from light_sources if it is there
331 NOTE: This doesn't happen nearly at all
333 /*if(light_sources.find(n2pos))
335 std::cout<<"Removed from light_sources"<<std::endl;
336 light_sources.remove(n2pos);
341 if(light_sources.find(n2pos) != NULL)
342 light_sources.remove(n2pos);*/
345 light_sources.insert(n2pos, true);
348 // Add to modified_blocks
349 if(changed == true && block_checked_in_modified == false)
351 // If the block is not found in modified_blocks, add.
352 if(modified_blocks.find(blockpos) == NULL)
354 modified_blocks.insert(blockpos, block);
356 block_checked_in_modified = true;
359 catch(InvalidPositionException &e)
366 /*dstream<<"unspreadLight(): Changed block "
367 <<blockchangecount<<" times"
368 <<" for "<<from_nodes.size()<<" nodes"
371 if(unlighted_nodes.size() > 0)
372 unspreadLight(bank, unlighted_nodes, light_sources, modified_blocks);
376 A single-node wrapper of the above
378 void Map::unLightNeighbors(enum LightBank bank,
379 v3s16 pos, u8 lightwas,
380 core::map<v3s16, bool> & light_sources,
381 core::map<v3s16, MapBlock*> & modified_blocks)
383 core::map<v3s16, u8> from_nodes;
384 from_nodes.insert(pos, lightwas);
386 unspreadLight(bank, from_nodes, light_sources, modified_blocks);
390 Lights neighbors of from_nodes, collects all them and then
393 void Map::spreadLight(enum LightBank bank,
394 core::map<v3s16, bool> & from_nodes,
395 core::map<v3s16, MapBlock*> & modified_blocks)
397 const v3s16 dirs[6] = {
398 v3s16(0,0,1), // back
400 v3s16(1,0,0), // right
401 v3s16(0,0,-1), // front
402 v3s16(0,-1,0), // bottom
403 v3s16(-1,0,0), // left
406 if(from_nodes.size() == 0)
409 u32 blockchangecount = 0;
411 core::map<v3s16, bool> lighted_nodes;
412 core::map<v3s16, bool>::Iterator j;
413 j = from_nodes.getIterator();
416 Initialize block cache
419 MapBlock *block = NULL;
420 // Cache this a bit, too
421 bool block_checked_in_modified = false;
423 for(; j.atEnd() == false; j++)
424 //for(; j != from_nodes.end(); j++)
426 v3s16 pos = j.getNode()->getKey();
428 //dstream<<"pos=("<<pos.X<<","<<pos.Y<<","<<pos.Z<<")"<<std::endl;
429 v3s16 blockpos = getNodeBlockPos(pos);
431 // Only fetch a new block if the block position has changed
433 if(block == NULL || blockpos != blockpos_last){
434 block = getBlockNoCreate(blockpos);
435 blockpos_last = blockpos;
437 block_checked_in_modified = false;
441 catch(InvalidPositionException &e)
449 // Calculate relative position in block
450 v3s16 relpos = pos - blockpos_last * MAP_BLOCKSIZE;
452 // Get node straight from the block
453 MapNode n = block->getNode(relpos);
455 u8 oldlight = n.getLight(bank);
456 u8 newlight = diminish_light(oldlight);
458 // Loop through 6 neighbors
459 for(u16 i=0; i<6; i++){
460 // Get the position of the neighbor node
461 v3s16 n2pos = pos + dirs[i];
463 // Get the block where the node is located
464 v3s16 blockpos = getNodeBlockPos(n2pos);
468 // Only fetch a new block if the block position has changed
470 if(block == NULL || blockpos != blockpos_last){
471 block = getBlockNoCreate(blockpos);
472 blockpos_last = blockpos;
474 block_checked_in_modified = false;
478 catch(InvalidPositionException &e)
483 // Calculate relative position in block
484 v3s16 relpos = n2pos - blockpos * MAP_BLOCKSIZE;
485 // Get node straight from the block
486 MapNode n2 = block->getNode(relpos);
488 bool changed = false;
490 If the neighbor is brighter than the current node,
491 add to list (it will light up this node on its turn)
493 if(n2.getLight(bank) > undiminish_light(oldlight))
495 lighted_nodes.insert(n2pos, true);
496 //lighted_nodes.push_back(n2pos);
500 If the neighbor is dimmer than how much light this node
501 would spread on it, add to list
503 if(n2.getLight(bank) < newlight)
505 if(n2.light_propagates())
507 n2.setLight(bank, newlight);
508 block->setNode(relpos, n2);
509 lighted_nodes.insert(n2pos, true);
510 //lighted_nodes.push_back(n2pos);
515 // Add to modified_blocks
516 if(changed == true && block_checked_in_modified == false)
518 // If the block is not found in modified_blocks, add.
519 if(modified_blocks.find(blockpos) == NULL)
521 modified_blocks.insert(blockpos, block);
523 block_checked_in_modified = true;
526 catch(InvalidPositionException &e)
533 /*dstream<<"spreadLight(): Changed block "
534 <<blockchangecount<<" times"
535 <<" for "<<from_nodes.size()<<" nodes"
538 if(lighted_nodes.size() > 0)
539 spreadLight(bank, lighted_nodes, modified_blocks);
543 A single-node source variation of the above.
545 void Map::lightNeighbors(enum LightBank bank,
547 core::map<v3s16, MapBlock*> & modified_blocks)
549 core::map<v3s16, bool> from_nodes;
550 from_nodes.insert(pos, true);
551 spreadLight(bank, from_nodes, modified_blocks);
554 v3s16 Map::getBrightestNeighbour(enum LightBank bank, v3s16 p)
557 v3s16(0,0,1), // back
559 v3s16(1,0,0), // right
560 v3s16(0,0,-1), // front
561 v3s16(0,-1,0), // bottom
562 v3s16(-1,0,0), // left
565 u8 brightest_light = 0;
566 v3s16 brightest_pos(0,0,0);
567 bool found_something = false;
569 // Loop through 6 neighbors
570 for(u16 i=0; i<6; i++){
571 // Get the position of the neighbor node
572 v3s16 n2pos = p + dirs[i];
577 catch(InvalidPositionException &e)
581 if(n2.getLight(bank) > brightest_light || found_something == false){
582 brightest_light = n2.getLight(bank);
583 brightest_pos = n2pos;
584 found_something = true;
588 if(found_something == false)
589 throw InvalidPositionException();
591 return brightest_pos;
595 Propagates sunlight down from a node.
596 Starting point gets sunlight.
598 Returns the lowest y value of where the sunlight went.
600 Mud is turned into grass in where the sunlight stops.
602 s16 Map::propagateSunlight(v3s16 start,
603 core::map<v3s16, MapBlock*> & modified_blocks)
608 v3s16 pos(start.X, y, start.Z);
610 v3s16 blockpos = getNodeBlockPos(pos);
613 block = getBlockNoCreate(blockpos);
615 catch(InvalidPositionException &e)
620 v3s16 relpos = pos - blockpos*MAP_BLOCKSIZE;
621 MapNode n = block->getNode(relpos);
623 if(n.sunlight_propagates())
625 n.setLight(LIGHTBANK_DAY, LIGHT_SUN);
626 block->setNode(relpos, n);
628 modified_blocks.insert(blockpos, block);
632 /*// Turn mud into grass
633 if(n.getContent() == CONTENT_MUD)
635 n.setContent(CONTENT_GRASS);
636 block->setNode(relpos, n);
637 modified_blocks.insert(blockpos, block);
640 // Sunlight goes no further
647 void Map::updateLighting(enum LightBank bank,
648 core::map<v3s16, MapBlock*> & a_blocks,
649 core::map<v3s16, MapBlock*> & modified_blocks)
651 /*m_dout<<DTIME<<"Map::updateLighting(): "
652 <<a_blocks.size()<<" blocks."<<std::endl;*/
654 //TimeTaker timer("updateLighting");
658 //u32 count_was = modified_blocks.size();
660 core::map<v3s16, MapBlock*> blocks_to_update;
662 core::map<v3s16, bool> light_sources;
664 core::map<v3s16, u8> unlight_from;
666 core::map<v3s16, MapBlock*>::Iterator i;
667 i = a_blocks.getIterator();
668 for(; i.atEnd() == false; i++)
670 MapBlock *block = i.getNode()->getValue();
674 // Don't bother with dummy blocks.
678 v3s16 pos = block->getPos();
679 modified_blocks.insert(pos, block);
681 blocks_to_update.insert(pos, block);
684 Clear all light from block
686 for(s16 z=0; z<MAP_BLOCKSIZE; z++)
687 for(s16 x=0; x<MAP_BLOCKSIZE; x++)
688 for(s16 y=0; y<MAP_BLOCKSIZE; y++)
693 MapNode n = block->getNode(v3s16(x,y,z));
694 u8 oldlight = n.getLight(bank);
696 block->setNode(v3s16(x,y,z), n);
698 // Collect borders for unlighting
699 if(x==0 || x == MAP_BLOCKSIZE-1
700 || y==0 || y == MAP_BLOCKSIZE-1
701 || z==0 || z == MAP_BLOCKSIZE-1)
703 v3s16 p_map = p + v3s16(
706 MAP_BLOCKSIZE*pos.Z);
707 unlight_from.insert(p_map, oldlight);
710 catch(InvalidPositionException &e)
713 This would happen when dealing with a
717 dstream<<"updateLighting(): InvalidPositionException"
722 if(bank == LIGHTBANK_DAY)
724 bool bottom_valid = block->propagateSunlight(light_sources);
726 // If bottom is valid, we're done.
730 else if(bank == LIGHTBANK_NIGHT)
732 // For night lighting, sunlight is not propagated
737 // Invalid lighting bank
741 /*dstream<<"Bottom for sunlight-propagated block ("
742 <<pos.X<<","<<pos.Y<<","<<pos.Z<<") not valid"
745 // Bottom sunlight is not valid; get the block and loop to it
749 block = getBlockNoCreate(pos);
751 catch(InvalidPositionException &e)
760 Enable this to disable proper lighting for speeding up map
761 generation for testing or whatever
764 //if(g_settings.get(""))
766 core::map<v3s16, MapBlock*>::Iterator i;
767 i = blocks_to_update.getIterator();
768 for(; i.atEnd() == false; i++)
770 MapBlock *block = i.getNode()->getValue();
771 v3s16 p = block->getPos();
772 block->setLightingExpired(false);
780 TimeTaker timer("unspreadLight");
781 unspreadLight(bank, unlight_from, light_sources, modified_blocks);
786 u32 diff = modified_blocks.size() - count_was;
787 count_was = modified_blocks.size();
788 dstream<<"unspreadLight modified "<<diff<<std::endl;
792 TimeTaker timer("spreadLight");
793 spreadLight(bank, light_sources, modified_blocks);
798 u32 diff = modified_blocks.size() - count_was;
799 count_was = modified_blocks.size();
800 dstream<<"spreadLight modified "<<diff<<std::endl;
805 //MapVoxelManipulator vmanip(this);
807 // Make a manual voxel manipulator and load all the blocks
808 // that touch the requested blocks
809 ManualMapVoxelManipulator vmanip(this);
810 core::map<v3s16, MapBlock*>::Iterator i;
811 i = blocks_to_update.getIterator();
812 for(; i.atEnd() == false; i++)
814 MapBlock *block = i.getNode()->getValue();
815 v3s16 p = block->getPos();
817 // Add all surrounding blocks
818 vmanip.initialEmerge(p - v3s16(1,1,1), p + v3s16(1,1,1));
821 Add all surrounding blocks that have up-to-date lighting
822 NOTE: This doesn't quite do the job (not everything
823 appropriate is lighted)
825 /*for(s16 z=-1; z<=1; z++)
826 for(s16 y=-1; y<=1; y++)
827 for(s16 x=-1; x<=1; x++)
830 MapBlock *block = getBlockNoCreateNoEx(p);
835 if(block->getLightingExpired())
837 vmanip.initialEmerge(p, p);
840 // Lighting of block will be updated completely
841 block->setLightingExpired(false);
845 //TimeTaker timer("unSpreadLight");
846 vmanip.unspreadLight(bank, unlight_from, light_sources);
849 //TimeTaker timer("spreadLight");
850 vmanip.spreadLight(bank, light_sources);
853 //TimeTaker timer("blitBack");
854 vmanip.blitBack(modified_blocks);
856 /*dstream<<"emerge_time="<<emerge_time<<std::endl;
860 //m_dout<<"Done ("<<getTimestamp()<<")"<<std::endl;
863 void Map::updateLighting(core::map<v3s16, MapBlock*> & a_blocks,
864 core::map<v3s16, MapBlock*> & modified_blocks)
866 updateLighting(LIGHTBANK_DAY, a_blocks, modified_blocks);
867 updateLighting(LIGHTBANK_NIGHT, a_blocks, modified_blocks);
870 Update information about whether day and night light differ
872 for(core::map<v3s16, MapBlock*>::Iterator
873 i = modified_blocks.getIterator();
874 i.atEnd() == false; i++)
876 MapBlock *block = i.getNode()->getValue();
877 block->updateDayNightDiff();
883 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
884 core::map<v3s16, MapBlock*> &modified_blocks)
887 m_dout<<DTIME<<"Map::addNodeAndUpdate(): p=("
888 <<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
891 From this node to nodes underneath:
892 If lighting is sunlight (1.0), unlight neighbours and
897 v3s16 toppos = p + v3s16(0,1,0);
898 v3s16 bottompos = p + v3s16(0,-1,0);
900 bool node_under_sunlight = true;
901 core::map<v3s16, bool> light_sources;
904 If there is a node at top and it doesn't have sunlight,
905 there has not been any sunlight going down.
907 Otherwise there probably is.
910 MapNode topnode = getNode(toppos);
912 if(topnode.getLight(LIGHTBANK_DAY) != LIGHT_SUN)
913 node_under_sunlight = false;
915 catch(InvalidPositionException &e)
921 If the new node is solid and there is grass below, change it to mud
923 if(content_features(n).walkable == true)
926 MapNode bottomnode = getNode(bottompos);
928 if(bottomnode.getContent() == CONTENT_GRASS
929 || bottomnode.getContent() == CONTENT_GRASS_FOOTSTEPS)
931 bottomnode.setContent(CONTENT_MUD);
932 setNode(bottompos, bottomnode);
935 catch(InvalidPositionException &e)
943 If the new node is mud and it is under sunlight, change it
946 if(n.getContent() == CONTENT_MUD && node_under_sunlight)
948 n.setContent(CONTENT_GRASS);
953 Remove all light that has come out of this node
956 enum LightBank banks[] =
961 for(s32 i=0; i<2; i++)
963 enum LightBank bank = banks[i];
965 u8 lightwas = getNode(p).getLight(bank);
967 // Add the block of the added node to modified_blocks
968 v3s16 blockpos = getNodeBlockPos(p);
969 MapBlock * block = getBlockNoCreate(blockpos);
970 assert(block != NULL);
971 modified_blocks.insert(blockpos, block);
973 assert(isValidPosition(p));
975 // Unlight neighbours of node.
976 // This means setting light of all consequent dimmer nodes
978 // This also collects the nodes at the border which will spread
979 // light again into this.
980 unLightNeighbors(bank, p, lightwas, light_sources, modified_blocks);
986 If node lets sunlight through and is under sunlight, it has
989 if(node_under_sunlight && content_features(n).sunlight_propagates)
991 n.setLight(LIGHTBANK_DAY, LIGHT_SUN);
995 Set the node on the map
1004 NodeMetadata *meta_proto = content_features(n).initial_metadata;
1007 NodeMetadata *meta = meta_proto->clone();
1008 setNodeMetadata(p, meta);
1012 If node is under sunlight and doesn't let sunlight through,
1013 take all sunlighted nodes under it and clear light from them
1014 and from where the light has been spread.
1015 TODO: This could be optimized by mass-unlighting instead
1018 if(node_under_sunlight && !content_features(n).sunlight_propagates)
1022 //m_dout<<DTIME<<"y="<<y<<std::endl;
1023 v3s16 n2pos(p.X, y, p.Z);
1027 n2 = getNode(n2pos);
1029 catch(InvalidPositionException &e)
1034 if(n2.getLight(LIGHTBANK_DAY) == LIGHT_SUN)
1036 unLightNeighbors(LIGHTBANK_DAY,
1037 n2pos, n2.getLight(LIGHTBANK_DAY),
1038 light_sources, modified_blocks);
1039 n2.setLight(LIGHTBANK_DAY, 0);
1047 for(s32 i=0; i<2; i++)
1049 enum LightBank bank = banks[i];
1052 Spread light from all nodes that might be capable of doing so
1054 spreadLight(bank, light_sources, modified_blocks);
1058 Update information about whether day and night light differ
1060 for(core::map<v3s16, MapBlock*>::Iterator
1061 i = modified_blocks.getIterator();
1062 i.atEnd() == false; i++)
1064 MapBlock *block = i.getNode()->getValue();
1065 block->updateDayNightDiff();
1069 Add neighboring liquid nodes and the node itself if it is
1070 liquid (=water node was added) to transform queue.
1073 v3s16(0,0,0), // self
1074 v3s16(0,0,1), // back
1075 v3s16(0,1,0), // top
1076 v3s16(1,0,0), // right
1077 v3s16(0,0,-1), // front
1078 v3s16(0,-1,0), // bottom
1079 v3s16(-1,0,0), // left
1081 for(u16 i=0; i<7; i++)
1086 v3s16 p2 = p + dirs[i];
1088 MapNode n2 = getNode(p2);
1089 if(content_liquid(n2.getContent()) || n2.getContent() == CONTENT_AIR)
1091 m_transforming_liquid.push_back(p2);
1094 }catch(InvalidPositionException &e)
1102 void Map::removeNodeAndUpdate(v3s16 p,
1103 core::map<v3s16, MapBlock*> &modified_blocks)
1105 /*PrintInfo(m_dout);
1106 m_dout<<DTIME<<"Map::removeNodeAndUpdate(): p=("
1107 <<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
1109 bool node_under_sunlight = true;
1111 v3s16 toppos = p + v3s16(0,1,0);
1113 // Node will be replaced with this
1114 content_t replace_material = CONTENT_AIR;
1117 If there is a node at top and it doesn't have sunlight,
1118 there will be no sunlight going down.
1121 MapNode topnode = getNode(toppos);
1123 if(topnode.getLight(LIGHTBANK_DAY) != LIGHT_SUN)
1124 node_under_sunlight = false;
1126 catch(InvalidPositionException &e)
1130 core::map<v3s16, bool> light_sources;
1132 enum LightBank banks[] =
1137 for(s32 i=0; i<2; i++)
1139 enum LightBank bank = banks[i];
1142 Unlight neighbors (in case the node is a light source)
1144 unLightNeighbors(bank, p,
1145 getNode(p).getLight(bank),
1146 light_sources, modified_blocks);
1150 Remove node metadata
1153 removeNodeMetadata(p);
1157 This also clears the lighting.
1161 n.setContent(replace_material);
1164 for(s32 i=0; i<2; i++)
1166 enum LightBank bank = banks[i];
1169 Recalculate lighting
1171 spreadLight(bank, light_sources, modified_blocks);
1174 // Add the block of the removed node to modified_blocks
1175 v3s16 blockpos = getNodeBlockPos(p);
1176 MapBlock * block = getBlockNoCreate(blockpos);
1177 assert(block != NULL);
1178 modified_blocks.insert(blockpos, block);
1181 If the removed node was under sunlight, propagate the
1182 sunlight down from it and then light all neighbors
1183 of the propagated blocks.
1185 if(node_under_sunlight)
1187 s16 ybottom = propagateSunlight(p, modified_blocks);
1188 /*m_dout<<DTIME<<"Node was under sunlight. "
1189 "Propagating sunlight";
1190 m_dout<<DTIME<<" -> ybottom="<<ybottom<<std::endl;*/
1192 for(; y >= ybottom; y--)
1194 v3s16 p2(p.X, y, p.Z);
1195 /*m_dout<<DTIME<<"lighting neighbors of node ("
1196 <<p2.X<<","<<p2.Y<<","<<p2.Z<<")"
1198 lightNeighbors(LIGHTBANK_DAY, p2, modified_blocks);
1203 // Set the lighting of this node to 0
1204 // TODO: Is this needed? Lighting is cleared up there already.
1206 MapNode n = getNode(p);
1207 n.setLight(LIGHTBANK_DAY, 0);
1210 catch(InvalidPositionException &e)
1216 for(s32 i=0; i<2; i++)
1218 enum LightBank bank = banks[i];
1220 // Get the brightest neighbour node and propagate light from it
1221 v3s16 n2p = getBrightestNeighbour(bank, p);
1223 MapNode n2 = getNode(n2p);
1224 lightNeighbors(bank, n2p, modified_blocks);
1226 catch(InvalidPositionException &e)
1232 Update information about whether day and night light differ
1234 for(core::map<v3s16, MapBlock*>::Iterator
1235 i = modified_blocks.getIterator();
1236 i.atEnd() == false; i++)
1238 MapBlock *block = i.getNode()->getValue();
1239 block->updateDayNightDiff();
1243 Add neighboring liquid nodes and this node to transform queue.
1244 (it's vital for the node itself to get updated last.)
1247 v3s16(0,0,1), // back
1248 v3s16(0,1,0), // top
1249 v3s16(1,0,0), // right
1250 v3s16(0,0,-1), // front
1251 v3s16(0,-1,0), // bottom
1252 v3s16(-1,0,0), // left
1253 v3s16(0,0,0), // self
1255 for(u16 i=0; i<7; i++)
1260 v3s16 p2 = p + dirs[i];
1262 MapNode n2 = getNode(p2);
1263 if(content_liquid(n2.getContent()) || n2.getContent() == CONTENT_AIR)
1265 m_transforming_liquid.push_back(p2);
1268 }catch(InvalidPositionException &e)
1274 bool Map::addNodeWithEvent(v3s16 p, MapNode n)
1277 event.type = MEET_ADDNODE;
1281 bool succeeded = true;
1283 core::map<v3s16, MapBlock*> modified_blocks;
1284 addNodeAndUpdate(p, n, modified_blocks);
1286 // Copy modified_blocks to event
1287 for(core::map<v3s16, MapBlock*>::Iterator
1288 i = modified_blocks.getIterator();
1289 i.atEnd()==false; i++)
1291 event.modified_blocks.insert(i.getNode()->getKey(), false);
1294 catch(InvalidPositionException &e){
1298 dispatchEvent(&event);
1303 bool Map::removeNodeWithEvent(v3s16 p)
1306 event.type = MEET_REMOVENODE;
1309 bool succeeded = true;
1311 core::map<v3s16, MapBlock*> modified_blocks;
1312 removeNodeAndUpdate(p, modified_blocks);
1314 // Copy modified_blocks to event
1315 for(core::map<v3s16, MapBlock*>::Iterator
1316 i = modified_blocks.getIterator();
1317 i.atEnd()==false; i++)
1319 event.modified_blocks.insert(i.getNode()->getKey(), false);
1322 catch(InvalidPositionException &e){
1326 dispatchEvent(&event);
1331 bool Map::dayNightDiffed(v3s16 blockpos)
1334 v3s16 p = blockpos + v3s16(0,0,0);
1335 MapBlock *b = getBlockNoCreate(p);
1336 if(b->dayNightDiffed())
1339 catch(InvalidPositionException &e){}
1342 v3s16 p = blockpos + v3s16(-1,0,0);
1343 MapBlock *b = getBlockNoCreate(p);
1344 if(b->dayNightDiffed())
1347 catch(InvalidPositionException &e){}
1349 v3s16 p = blockpos + v3s16(0,-1,0);
1350 MapBlock *b = getBlockNoCreate(p);
1351 if(b->dayNightDiffed())
1354 catch(InvalidPositionException &e){}
1356 v3s16 p = blockpos + v3s16(0,0,-1);
1357 MapBlock *b = getBlockNoCreate(p);
1358 if(b->dayNightDiffed())
1361 catch(InvalidPositionException &e){}
1364 v3s16 p = blockpos + v3s16(1,0,0);
1365 MapBlock *b = getBlockNoCreate(p);
1366 if(b->dayNightDiffed())
1369 catch(InvalidPositionException &e){}
1371 v3s16 p = blockpos + v3s16(0,1,0);
1372 MapBlock *b = getBlockNoCreate(p);
1373 if(b->dayNightDiffed())
1376 catch(InvalidPositionException &e){}
1378 v3s16 p = blockpos + v3s16(0,0,1);
1379 MapBlock *b = getBlockNoCreate(p);
1380 if(b->dayNightDiffed())
1383 catch(InvalidPositionException &e){}
1389 Updates usage timers
1391 void Map::timerUpdate(float dtime, float unload_timeout,
1392 core::list<v3s16> *unloaded_blocks)
1394 bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
1396 core::list<v2s16> sector_deletion_queue;
1397 u32 deleted_blocks_count = 0;
1398 u32 saved_blocks_count = 0;
1400 core::map<v2s16, MapSector*>::Iterator si;
1402 si = m_sectors.getIterator();
1403 for(; si.atEnd() == false; si++)
1405 MapSector *sector = si.getNode()->getValue();
1407 bool all_blocks_deleted = true;
1409 core::list<MapBlock*> blocks;
1410 sector->getBlocks(blocks);
1411 for(core::list<MapBlock*>::Iterator i = blocks.begin();
1412 i != blocks.end(); i++)
1414 MapBlock *block = (*i);
1416 block->incrementUsageTimer(dtime);
1418 if(block->getUsageTimer() > unload_timeout)
1420 v3s16 p = block->getPos();
1423 if(block->getModified() != MOD_STATE_CLEAN
1424 && save_before_unloading)
1427 saved_blocks_count++;
1430 // Delete from memory
1431 sector->deleteBlock(block);
1434 unloaded_blocks->push_back(p);
1436 deleted_blocks_count++;
1440 all_blocks_deleted = false;
1444 if(all_blocks_deleted)
1446 sector_deletion_queue.push_back(si.getNode()->getKey());
1450 // Finally delete the empty sectors
1451 deleteSectors(sector_deletion_queue);
1453 if(deleted_blocks_count != 0)
1455 PrintInfo(dstream); // ServerMap/ClientMap:
1456 dstream<<"Unloaded "<<deleted_blocks_count
1457 <<" blocks from memory";
1458 if(save_before_unloading)
1459 dstream<<", of which "<<saved_blocks_count<<" were written";
1460 dstream<<"."<<std::endl;
1464 void Map::deleteSectors(core::list<v2s16> &list)
1466 core::list<v2s16>::Iterator j;
1467 for(j=list.begin(); j!=list.end(); j++)
1469 MapSector *sector = m_sectors[*j];
1470 // If sector is in sector cache, remove it from there
1471 if(m_sector_cache == sector)
1472 m_sector_cache = NULL;
1473 // Remove from map and delete
1474 m_sectors.remove(*j);
1480 void Map::unloadUnusedData(float timeout,
1481 core::list<v3s16> *deleted_blocks)
1483 core::list<v2s16> sector_deletion_queue;
1484 u32 deleted_blocks_count = 0;
1485 u32 saved_blocks_count = 0;
1487 core::map<v2s16, MapSector*>::Iterator si = m_sectors.getIterator();
1488 for(; si.atEnd() == false; si++)
1490 MapSector *sector = si.getNode()->getValue();
1492 bool all_blocks_deleted = true;
1494 core::list<MapBlock*> blocks;
1495 sector->getBlocks(blocks);
1496 for(core::list<MapBlock*>::Iterator i = blocks.begin();
1497 i != blocks.end(); i++)
1499 MapBlock *block = (*i);
1501 if(block->getUsageTimer() > timeout)
1504 if(block->getModified() != MOD_STATE_CLEAN)
1507 saved_blocks_count++;
1509 // Delete from memory
1510 sector->deleteBlock(block);
1511 deleted_blocks_count++;
1515 all_blocks_deleted = false;
1519 if(all_blocks_deleted)
1521 sector_deletion_queue.push_back(si.getNode()->getKey());
1525 deleteSectors(sector_deletion_queue);
1527 dstream<<"Map: Unloaded "<<deleted_blocks_count<<" blocks from memory"
1528 <<", of which "<<saved_blocks_count<<" were wr."
1531 //return sector_deletion_queue.getSize();
1532 //return deleted_blocks_count;
1536 void Map::PrintInfo(std::ostream &out)
1541 #define WATER_DROP_BOOST 4
1545 NEIGHBOR_SAME_LEVEL,
1548 struct NodeNeighbor {
1554 void Map::transformLiquids(core::map<v3s16, MapBlock*> & modified_blocks)
1556 DSTACK(__FUNCTION_NAME);
1557 //TimeTaker timer("transformLiquids()");
1560 u32 initial_size = m_transforming_liquid.size();
1562 /*if(initial_size != 0)
1563 dstream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
1565 while(m_transforming_liquid.size() != 0)
1567 // This should be done here so that it is done when continue is used
1568 if(loopcount >= initial_size * 3)
1573 Get a queued transforming liquid node
1575 v3s16 p0 = m_transforming_liquid.pop_front();
1577 MapNode n0 = getNodeNoEx(p0);
1580 Collect information about current node
1582 s8 liquid_level = -1;
1583 u8 liquid_kind = CONTENT_IGNORE;
1584 LiquidType liquid_type = content_features(n0.getContent()).liquid_type;
1585 switch (liquid_type) {
1588 liquid_kind = content_features(n0.getContent()).liquid_alternative_flowing;
1590 case LIQUID_FLOWING:
1591 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
1592 liquid_kind = n0.getContent();
1595 // if this is an air node, it *could* be transformed into a liquid. otherwise,
1596 // continue with the next node.
1597 if (n0.getContent() != CONTENT_AIR)
1599 liquid_kind = CONTENT_AIR;
1604 Collect information about the environment
1607 v3s16( 0, 1, 0), // top
1608 v3s16( 0,-1, 0), // bottom
1609 v3s16( 1, 0, 0), // right
1610 v3s16(-1, 0, 0), // left
1611 v3s16( 0, 0, 1), // back
1612 v3s16( 0, 0,-1), // front
1614 NodeNeighbor sources[6]; // surrounding sources
1615 int num_sources = 0;
1616 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
1618 NodeNeighbor airs[6]; // surrounding air
1620 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
1621 int num_neutrals = 0;
1622 bool flowing_down = false;
1623 for (u16 i = 0; i < 6; i++) {
1624 NeighborType nt = NEIGHBOR_SAME_LEVEL;
1627 nt = NEIGHBOR_UPPER;
1630 nt = NEIGHBOR_LOWER;
1633 v3s16 npos = p0 + dirs[i];
1634 NodeNeighbor nb = {getNodeNoEx(npos), nt, npos};
1635 switch (content_features(nb.n.getContent()).liquid_type) {
1637 if (nb.n.getContent() == CONTENT_AIR) {
1638 airs[num_airs++] = nb;
1639 // if the current node happens to be a flowing node, it will start to flow down here.
1640 if (nb.t == NEIGHBOR_LOWER)
1641 flowing_down = true;
1643 neutrals[num_neutrals++] = nb;
1647 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1648 if (liquid_kind == CONTENT_AIR)
1649 liquid_kind = content_features(nb.n.getContent()).liquid_alternative_flowing;
1650 if (content_features(nb.n.getContent()).liquid_alternative_flowing !=liquid_kind) {
1651 neutrals[num_neutrals++] = nb;
1653 sources[num_sources++] = nb;
1656 case LIQUID_FLOWING:
1657 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1658 if (liquid_kind == CONTENT_AIR)
1659 liquid_kind = content_features(nb.n.getContent()).liquid_alternative_flowing;
1660 if (content_features(nb.n.getContent()).liquid_alternative_flowing != liquid_kind) {
1661 neutrals[num_neutrals++] = nb;
1663 flows[num_flows++] = nb;
1664 if (nb.t == NEIGHBOR_LOWER)
1665 flowing_down = true;
1672 decide on the type (and possibly level) of the current node
1674 content_t new_node_content;
1675 s8 new_node_level = -1;
1676 if (num_sources >= 2 || liquid_type == LIQUID_SOURCE) {
1677 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
1678 // or the flowing alternative of the first of the surrounding sources (if it's air), so
1679 // it's perfectly safe to use liquid_kind here to determine the new node content.
1680 new_node_content = content_features(liquid_kind).liquid_alternative_source;
1681 } else if (num_sources == 1 && sources[0].t != NEIGHBOR_LOWER) {
1682 // liquid_kind is set properly, see above
1683 new_node_content = liquid_kind;
1686 // no surrounding sources, so get the maximum level that can flow into this node
1687 for (u16 i = 0; i < num_flows; i++) {
1688 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1689 switch (flows[i].t) {
1690 case NEIGHBOR_UPPER:
1691 if (nb_liquid_level + WATER_DROP_BOOST > new_node_level) {
1693 if (nb_liquid_level + WATER_DROP_BOOST < 7)
1694 new_node_level = nb_liquid_level + WATER_DROP_BOOST;
1697 case NEIGHBOR_LOWER:
1699 case NEIGHBOR_SAME_LEVEL:
1700 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
1701 nb_liquid_level > 0 && nb_liquid_level - 1 > new_node_level) {
1702 new_node_level = nb_liquid_level - 1;
1707 // don't flow as far in open terrain - if there isn't at least one adjacent solid block,
1708 // substract another unit from the resulting water level.
1709 if (!flowing_down && new_node_level >= 1) {
1710 bool at_wall = false;
1711 for (u16 i = 0; i < num_neutrals; i++) {
1712 if (neutrals[i].t == NEIGHBOR_SAME_LEVEL) {
1718 new_node_level -= 1;
1721 if (new_node_level >= 0)
1722 new_node_content = liquid_kind;
1724 new_node_content = CONTENT_AIR;
1728 check if anything has changed. if not, just continue with the next node.
1730 if (new_node_content == n0.getContent() && (content_features(n0.getContent()).liquid_type != LIQUID_FLOWING ||
1731 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
1732 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
1738 update the current node
1740 bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
1741 n0.setContent(new_node_content);
1742 if (content_features(n0.getContent()).liquid_type == LIQUID_FLOWING) {
1743 // set level to last 3 bits, flowing down bit to 4th bit
1744 n0.param2 |= (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
1746 // set the liquid level and flow bit to 0
1747 n0.param2 &= ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
1750 v3s16 blockpos = getNodeBlockPos(p0);
1751 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1753 modified_blocks.insert(blockpos, block);
1756 enqueue neighbors for update if neccessary
1758 switch (content_features(n0.getContent()).liquid_type) {
1760 // make sure source flows into all neighboring nodes
1761 for (u16 i = 0; i < num_flows; i++)
1762 if (flows[i].t != NEIGHBOR_UPPER)
1763 m_transforming_liquid.push_back(flows[i].p);
1764 for (u16 i = 0; i < num_airs; i++)
1765 if (airs[i].t != NEIGHBOR_UPPER)
1766 m_transforming_liquid.push_back(airs[i].p);
1769 // this flow has turned to air; neighboring flows might need to do the same
1770 for (u16 i = 0; i < num_flows; i++)
1771 m_transforming_liquid.push_back(flows[i].p);
1773 case LIQUID_FLOWING:
1774 for (u16 i = 0; i < num_flows; i++) {
1775 u8 flow_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1776 // liquid_level is still the ORIGINAL level of this node.
1777 if (flows[i].t != NEIGHBOR_UPPER && ((flow_level < liquid_level || flow_level < new_node_level) ||
1779 m_transforming_liquid.push_back(flows[i].p);
1781 for (u16 i = 0; i < num_airs; i++) {
1782 if (airs[i].t != NEIGHBOR_UPPER && (airs[i].t == NEIGHBOR_LOWER || new_node_level > 0))
1783 m_transforming_liquid.push_back(airs[i].p);
1788 //dstream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
1791 NodeMetadata* Map::getNodeMetadata(v3s16 p)
1793 v3s16 blockpos = getNodeBlockPos(p);
1794 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1795 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1798 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1802 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
1806 void Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
1808 v3s16 blockpos = getNodeBlockPos(p);
1809 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1810 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1813 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1817 block->m_node_metadata.set(p_rel, meta);
1820 void Map::removeNodeMetadata(v3s16 p)
1822 v3s16 blockpos = getNodeBlockPos(p);
1823 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1824 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1827 dstream<<"WARNING: Map::removeNodeMetadata(): Block not found"
1831 block->m_node_metadata.remove(p_rel);
1834 void Map::nodeMetadataStep(float dtime,
1835 core::map<v3s16, MapBlock*> &changed_blocks)
1839 Currently there is no way to ensure that all the necessary
1840 blocks are loaded when this is run. (They might get unloaded)
1841 NOTE: ^- Actually, that might not be so. In a quick test it
1842 reloaded a block with a furnace when I walked back to it from
1845 core::map<v2s16, MapSector*>::Iterator si;
1846 si = m_sectors.getIterator();
1847 for(; si.atEnd() == false; si++)
1849 MapSector *sector = si.getNode()->getValue();
1850 core::list< MapBlock * > sectorblocks;
1851 sector->getBlocks(sectorblocks);
1852 core::list< MapBlock * >::Iterator i;
1853 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
1855 MapBlock *block = *i;
1856 bool changed = block->m_node_metadata.step(dtime);
1858 changed_blocks[block->getPos()] = block;
1867 ServerMap::ServerMap(std::string savedir):
1870 m_map_metadata_changed(true)
1872 dstream<<__FUNCTION_NAME<<std::endl;
1874 //m_chunksize = 8; // Takes a few seconds
1876 m_seed = (((u64)(myrand()%0xffff)<<0)
1877 + ((u64)(myrand()%0xffff)<<16)
1878 + ((u64)(myrand()%0xffff)<<32)
1879 + ((u64)(myrand()%0xffff)<<48));
1882 Experimental and debug stuff
1889 Try to load map; if not found, create a new one.
1892 m_savedir = savedir;
1893 m_map_saving_enabled = false;
1897 // If directory exists, check contents and load if possible
1898 if(fs::PathExists(m_savedir))
1900 // If directory is empty, it is safe to save into it.
1901 if(fs::GetDirListing(m_savedir).size() == 0)
1903 dstream<<DTIME<<"Server: Empty save directory is valid."
1905 m_map_saving_enabled = true;
1910 // Load map metadata (seed, chunksize)
1913 catch(FileNotGoodException &e){
1914 dstream<<DTIME<<"WARNING: Could not load map metadata"
1915 //<<" Disabling chunk-based generator."
1921 // Load chunk metadata
1924 catch(FileNotGoodException &e){
1925 dstream<<DTIME<<"WARNING: Could not load chunk metadata."
1926 <<" Disabling chunk-based generator."
1931 /*dstream<<DTIME<<"Server: Successfully loaded chunk "
1932 "metadata and sector (0,0) from "<<savedir<<
1933 ", assuming valid save directory."
1936 dstream<<DTIME<<"INFO: Server: Successfully loaded map "
1937 <<"and chunk metadata from "<<savedir
1938 <<", assuming valid save directory."
1941 m_map_saving_enabled = true;
1942 // Map loaded, not creating new one
1946 // If directory doesn't exist, it is safe to save to it
1948 m_map_saving_enabled = true;
1951 catch(std::exception &e)
1953 dstream<<DTIME<<"WARNING: Server: Failed to load map from "<<savedir
1954 <<", exception: "<<e.what()<<std::endl;
1955 dstream<<"Please remove the map or fix it."<<std::endl;
1956 dstream<<"WARNING: Map saving will be disabled."<<std::endl;
1959 dstream<<DTIME<<"INFO: Initializing new map."<<std::endl;
1961 // Create zero sector
1962 emergeSector(v2s16(0,0));
1964 // Initially write whole map
1968 ServerMap::~ServerMap()
1970 dstream<<__FUNCTION_NAME<<std::endl;
1974 if(m_map_saving_enabled)
1976 // Save only changed parts
1978 dstream<<DTIME<<"Server: saved map to "<<m_savedir<<std::endl;
1982 dstream<<DTIME<<"Server: map not saved"<<std::endl;
1985 catch(std::exception &e)
1987 dstream<<DTIME<<"Server: Failed to save map to "<<m_savedir
1988 <<", exception: "<<e.what()<<std::endl;
1995 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1996 for(; i.atEnd() == false; i++)
1998 MapChunk *chunk = i.getNode()->getValue();
2004 void ServerMap::initBlockMake(mapgen::BlockMakeData *data, v3s16 blockpos)
2006 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2007 if(enable_mapgen_debug_info)
2008 dstream<<"initBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2009 <<blockpos.Z<<")"<<std::endl;
2011 // Do nothing if not inside limits (+-1 because of neighbors)
2012 if(blockpos_over_limit(blockpos - v3s16(1,1,1)) ||
2013 blockpos_over_limit(blockpos + v3s16(1,1,1)))
2019 data->no_op = false;
2020 data->seed = m_seed;
2021 data->blockpos = blockpos;
2024 Create the whole area of this and the neighboring blocks
2027 //TimeTaker timer("initBlockMake() create area");
2029 for(s16 x=-1; x<=1; x++)
2030 for(s16 z=-1; z<=1; z++)
2032 v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2033 // Sector metadata is loaded from disk if not already loaded.
2034 ServerMapSector *sector = createSector(sectorpos);
2037 for(s16 y=-1; y<=1; y++)
2039 v3s16 p(blockpos.X+x, blockpos.Y+y, blockpos.Z+z);
2040 //MapBlock *block = createBlock(p);
2041 // 1) get from memory, 2) load from disk
2042 MapBlock *block = emergeBlock(p, false);
2043 // 3) create a blank one
2046 block = createBlock(p);
2049 Block gets sunlight if this is true.
2051 Refer to the map generator heuristics.
2053 bool ug = mapgen::block_is_underground(data->seed, p);
2054 block->setIsUnderground(ug);
2057 // Lighting will not be valid after make_chunk is called
2058 block->setLightingExpired(true);
2059 // Lighting will be calculated
2060 //block->setLightingExpired(false);
2066 Now we have a big empty area.
2068 Make a ManualMapVoxelManipulator that contains this and the
2072 // The area that contains this block and it's neighbors
2073 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2074 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2076 data->vmanip = new ManualMapVoxelManipulator(this);
2077 //data->vmanip->setMap(this);
2081 //TimeTaker timer("initBlockMake() initialEmerge");
2082 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2085 // Data is ready now.
2088 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2089 core::map<v3s16, MapBlock*> &changed_blocks)
2091 v3s16 blockpos = data->blockpos;
2092 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2093 <<blockpos.Z<<")"<<std::endl;*/
2097 //dstream<<"finishBlockMake(): no-op"<<std::endl;
2101 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2103 /*dstream<<"Resulting vmanip:"<<std::endl;
2104 data->vmanip.print(dstream);*/
2107 Blit generated stuff to map
2108 NOTE: blitBackAll adds nearly everything to changed_blocks
2112 //TimeTaker timer("finishBlockMake() blitBackAll");
2113 data->vmanip->blitBackAll(&changed_blocks);
2116 if(enable_mapgen_debug_info)
2117 dstream<<"finishBlockMake: changed_blocks.size()="
2118 <<changed_blocks.size()<<std::endl;
2121 Copy transforming liquid information
2123 while(data->transforming_liquid.size() > 0)
2125 v3s16 p = data->transforming_liquid.pop_front();
2126 m_transforming_liquid.push_back(p);
2132 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2136 Set is_underground flag for lighting with sunlight.
2138 Refer to map generator heuristics.
2140 NOTE: This is done in initChunkMake
2142 //block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2146 Add sunlight to central block.
2147 This makes in-dark-spawning monsters to not flood the whole thing.
2148 Do not spread the light, though.
2150 /*core::map<v3s16, bool> light_sources;
2151 bool black_air_left = false;
2152 block->propagateSunlight(light_sources, true, &black_air_left);*/
2155 NOTE: Lighting and object adding shouldn't really be here, but
2156 lighting is a bit tricky to move properly to makeBlock.
2157 TODO: Do this the right way anyway, that is, move it to makeBlock.
2158 - There needs to be some way for makeBlock to report back if
2159 the lighting update is going further down because of the
2160 new block blocking light
2165 NOTE: This takes ~60ms, TODO: Investigate why
2168 TimeTaker t("finishBlockMake lighting update");
2170 core::map<v3s16, MapBlock*> lighting_update_blocks;
2173 lighting_update_blocks.insert(block->getPos(), block);
2178 v3s16 p = block->getPos()+v3s16(x,1,z);
2179 lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2183 // All modified blocks
2184 // NOTE: Should this be done? If this is not done, then the lighting
2185 // of the others will be updated in a different place, one by one, i
2186 // think... or they might not? Well, at least they are left marked as
2187 // "lighting expired"; it seems that is not handled at all anywhere,
2188 // so enabling this will slow it down A LOT because otherwise it
2189 // would not do this at all. This causes the black trees.
2190 for(core::map<v3s16, MapBlock*>::Iterator
2191 i = changed_blocks.getIterator();
2192 i.atEnd() == false; i++)
2194 lighting_update_blocks.insert(i.getNode()->getKey(),
2195 i.getNode()->getValue());
2197 /*// Also force-add all the upmost blocks for proper sunlight
2198 for(s16 x=-1; x<=1; x++)
2199 for(s16 z=-1; z<=1; z++)
2201 v3s16 p = block->getPos()+v3s16(x,1,z);
2202 lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2205 updateLighting(lighting_update_blocks, changed_blocks);
2208 Set lighting to non-expired state in all of them.
2209 This is cheating, but it is not fast enough if all of them
2210 would actually be updated.
2212 for(s16 x=-1; x<=1; x++)
2213 for(s16 y=-1; y<=1; y++)
2214 for(s16 z=-1; z<=1; z++)
2216 v3s16 p = block->getPos()+v3s16(x,y,z);
2217 getBlockNoCreateNoEx(p)->setLightingExpired(false);
2220 if(enable_mapgen_debug_info == false)
2221 t.stop(true); // Hide output
2225 Add random objects to block
2227 mapgen::add_random_objects(block);
2230 Go through changed blocks
2232 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2233 i.atEnd() == false; i++)
2235 MapBlock *block = i.getNode()->getValue();
2238 Update day/night difference cache of the MapBlocks
2240 block->updateDayNightDiff();
2242 Set block as modified
2244 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2248 Set central block as generated
2250 block->setGenerated(true);
2253 Save changed parts of map
2254 NOTE: Will be saved later.
2258 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2259 <<blockpos.Z<<")"<<std::endl;*/
2261 if(enable_mapgen_debug_info)
2264 Analyze resulting blocks
2266 for(s16 x=-1; x<=1; x++)
2267 for(s16 y=-1; y<=1; y++)
2268 for(s16 z=-1; z<=1; z++)
2270 v3s16 p = block->getPos()+v3s16(x,y,z);
2271 MapBlock *block = getBlockNoCreateNoEx(p);
2273 snprintf(spos, 20, "(%2d,%2d,%2d)", x, y, z);
2274 dstream<<"Generated "<<spos<<": "
2275 <<analyze_block(block)<<std::endl;
2283 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2285 DSTACKF("%s: p2d=(%d,%d)",
2290 Check if it exists already in memory
2292 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2297 Try to load it from disk (with blocks)
2299 //if(loadSectorFull(p2d) == true)
2302 Try to load metadata from disk
2304 if(loadSectorMeta(p2d) == true)
2306 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2309 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2310 throw InvalidPositionException("");
2316 Do not create over-limit
2318 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2319 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2320 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2321 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2322 throw InvalidPositionException("createSector(): pos. over limit");
2325 Generate blank sector
2328 sector = new ServerMapSector(this, p2d);
2330 // Sector position on map in nodes
2331 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2336 m_sectors.insert(p2d, sector);
2342 This is a quick-hand function for calling makeBlock().
2344 MapBlock * ServerMap::generateBlock(
2346 core::map<v3s16, MapBlock*> &modified_blocks
2349 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2351 /*dstream<<"generateBlock(): "
2352 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2355 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2357 TimeTaker timer("generateBlock");
2359 //MapBlock *block = original_dummy;
2361 v2s16 p2d(p.X, p.Z);
2362 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2365 Do not generate over-limit
2367 if(blockpos_over_limit(p))
2369 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2370 throw InvalidPositionException("generateBlock(): pos. over limit");
2374 Create block make data
2376 mapgen::BlockMakeData data;
2377 initBlockMake(&data, p);
2383 TimeTaker t("mapgen::make_block()");
2384 mapgen::make_block(&data);
2386 if(enable_mapgen_debug_info == false)
2387 t.stop(true); // Hide output
2391 Blit data back on map, update lighting, add mobs and whatever this does
2393 finishBlockMake(&data, modified_blocks);
2398 MapBlock *block = getBlockNoCreateNoEx(p);
2406 bool erroneus_content = false;
2407 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2408 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2409 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2412 MapNode n = block->getNode(p);
2413 if(n.getContent() == CONTENT_IGNORE)
2415 dstream<<"CONTENT_IGNORE at "
2416 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2418 erroneus_content = true;
2422 if(erroneus_content)
2431 Generate a completely empty block
2435 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2436 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2438 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2442 n.setContent(CONTENT_AIR);
2444 n.setContent(CONTENT_STONE);
2445 block->setNode(v3s16(x0,y0,z0), n);
2451 if(enable_mapgen_debug_info == false)
2452 timer.stop(true); // Hide output
2457 MapBlock * ServerMap::createBlock(v3s16 p)
2459 DSTACKF("%s: p=(%d,%d,%d)",
2460 __FUNCTION_NAME, p.X, p.Y, p.Z);
2463 Do not create over-limit
2465 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2466 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2467 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2468 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2469 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2470 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2471 throw InvalidPositionException("createBlock(): pos. over limit");
2473 v2s16 p2d(p.X, p.Z);
2476 This will create or load a sector if not found in memory.
2477 If block exists on disk, it will be loaded.
2479 NOTE: On old save formats, this will be slow, as it generates
2480 lighting on blocks for them.
2482 ServerMapSector *sector;
2484 sector = (ServerMapSector*)createSector(p2d);
2485 assert(sector->getId() == MAPSECTOR_SERVER);
2487 catch(InvalidPositionException &e)
2489 dstream<<"createBlock: createSector() failed"<<std::endl;
2493 NOTE: This should not be done, or at least the exception
2494 should not be passed on as std::exception, because it
2495 won't be catched at all.
2497 /*catch(std::exception &e)
2499 dstream<<"createBlock: createSector() failed: "
2500 <<e.what()<<std::endl;
2505 Try to get a block from the sector
2508 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2511 if(block->isDummy())
2516 block = sector->createBlankBlock(block_y);
2520 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2522 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2524 p.X, p.Y, p.Z, allow_generate);
2527 MapBlock *block = getBlockNoCreateNoEx(p);
2528 if(block && block->isDummy() == false)
2533 MapBlock *block = loadBlock(p);
2540 core::map<v3s16, MapBlock*> modified_blocks;
2541 MapBlock *block = generateBlock(p, modified_blocks);
2545 event.type = MEET_OTHER;
2548 // Copy modified_blocks to event
2549 for(core::map<v3s16, MapBlock*>::Iterator
2550 i = modified_blocks.getIterator();
2551 i.atEnd()==false; i++)
2553 event.modified_blocks.insert(i.getNode()->getKey(), false);
2557 dispatchEvent(&event);
2568 Do not generate over-limit
2570 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2571 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2572 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2573 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2574 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2575 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2576 throw InvalidPositionException("emergeBlock(): pos. over limit");
2578 v2s16 p2d(p.X, p.Z);
2581 This will create or load a sector if not found in memory.
2582 If block exists on disk, it will be loaded.
2584 ServerMapSector *sector;
2586 sector = createSector(p2d);
2587 //sector = emergeSector(p2d, changed_blocks);
2589 catch(InvalidPositionException &e)
2591 dstream<<"emergeBlock: createSector() failed: "
2592 <<e.what()<<std::endl;
2593 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2595 <<"You could try to delete it."<<std::endl;
2598 catch(VersionMismatchException &e)
2600 dstream<<"emergeBlock: createSector() failed: "
2601 <<e.what()<<std::endl;
2602 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2604 <<"You could try to delete it."<<std::endl;
2609 Try to get a block from the sector
2612 bool does_not_exist = false;
2613 bool lighting_expired = false;
2614 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2616 // If not found, try loading from disk
2619 block = loadBlock(p);
2625 does_not_exist = true;
2627 else if(block->isDummy() == true)
2629 does_not_exist = true;
2631 else if(block->getLightingExpired())
2633 lighting_expired = true;
2638 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2643 If block was not found on disk and not going to generate a
2644 new one, make sure there is a dummy block in place.
2646 if(only_from_disk && (does_not_exist || lighting_expired))
2648 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2652 // Create dummy block
2653 block = new MapBlock(this, p, true);
2655 // Add block to sector
2656 sector->insertBlock(block);
2662 //dstream<<"Not found on disk, generating."<<std::endl;
2664 //TimeTaker("emergeBlock() generate");
2666 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2669 If the block doesn't exist, generate the block.
2673 block = generateBlock(p, block, sector, changed_blocks,
2674 lighting_invalidated_blocks);
2677 if(lighting_expired)
2679 lighting_invalidated_blocks.insert(p, block);
2684 Initially update sunlight
2687 core::map<v3s16, bool> light_sources;
2688 bool black_air_left = false;
2689 bool bottom_invalid =
2690 block->propagateSunlight(light_sources, true,
2693 // If sunlight didn't reach everywhere and part of block is
2694 // above ground, lighting has to be properly updated
2695 //if(black_air_left && some_part_underground)
2698 lighting_invalidated_blocks[block->getPos()] = block;
2703 lighting_invalidated_blocks[block->getPos()] = block;
2712 s16 ServerMap::findGroundLevel(v2s16 p2d)
2716 Uh, just do something random...
2718 // Find existing map from top to down
2721 v3s16 p(p2d.X, max, p2d.Y);
2722 for(; p.Y>min; p.Y--)
2724 MapNode n = getNodeNoEx(p);
2725 if(n.getContent() != CONTENT_IGNORE)
2730 // If this node is not air, go to plan b
2731 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
2733 // Search existing walkable and return it
2734 for(; p.Y>min; p.Y--)
2736 MapNode n = getNodeNoEx(p);
2737 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
2746 Determine from map generator noise functions
2749 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2752 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2753 //return (s16)level;
2756 void ServerMap::createDirs(std::string path)
2758 if(fs::CreateAllDirs(path) == false)
2760 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2761 <<"\""<<path<<"\""<<std::endl;
2762 throw BaseException("ServerMap failed to create directory");
2766 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2772 snprintf(cc, 9, "%.4x%.4x",
2773 (unsigned int)pos.X&0xffff,
2774 (unsigned int)pos.Y&0xffff);
2776 return m_savedir + "/sectors/" + cc;
2778 snprintf(cc, 9, "%.3x/%.3x",
2779 (unsigned int)pos.X&0xfff,
2780 (unsigned int)pos.Y&0xfff);
2782 return m_savedir + "/sectors2/" + cc;
2788 v2s16 ServerMap::getSectorPos(std::string dirname)
2792 size_t spos = dirname.rfind('/') + 1;
2793 assert(spos != std::string::npos);
2794 if(dirname.size() - spos == 8)
2797 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2799 else if(dirname.size() - spos == 3)
2802 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2803 // Sign-extend the 12 bit values up to 16 bits...
2804 if(x&0x800) x|=0xF000;
2805 if(y&0x800) y|=0xF000;
2812 v2s16 pos((s16)x, (s16)y);
2816 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2818 v2s16 p2d = getSectorPos(sectordir);
2820 if(blockfile.size() != 4){
2821 throw InvalidFilenameException("Invalid block filename");
2824 int r = sscanf(blockfile.c_str(), "%4x", &y);
2826 throw InvalidFilenameException("Invalid block filename");
2827 return v3s16(p2d.X, y, p2d.Y);
2830 std::string ServerMap::getBlockFilename(v3s16 p)
2833 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2837 void ServerMap::save(bool only_changed)
2839 DSTACK(__FUNCTION_NAME);
2840 if(m_map_saving_enabled == false)
2842 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2846 if(only_changed == false)
2847 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2850 if(only_changed == false || m_map_metadata_changed)
2855 u32 sector_meta_count = 0;
2856 u32 block_count = 0;
2857 u32 block_count_all = 0; // Number of blocks in memory
2859 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2860 for(; i.atEnd() == false; i++)
2862 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2863 assert(sector->getId() == MAPSECTOR_SERVER);
2865 if(sector->differs_from_disk || only_changed == false)
2867 saveSectorMeta(sector);
2868 sector_meta_count++;
2870 core::list<MapBlock*> blocks;
2871 sector->getBlocks(blocks);
2872 core::list<MapBlock*>::Iterator j;
2873 for(j=blocks.begin(); j!=blocks.end(); j++)
2875 MapBlock *block = *j;
2879 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2880 || only_changed == false)
2885 /*dstream<<"ServerMap: Written block ("
2886 <<block->getPos().X<<","
2887 <<block->getPos().Y<<","
2888 <<block->getPos().Z<<")"
2895 Only print if something happened or saved whole map
2897 if(only_changed == false || sector_meta_count != 0
2898 || block_count != 0)
2900 dstream<<DTIME<<"ServerMap: Written: "
2901 <<sector_meta_count<<" sector metadata files, "
2902 <<block_count<<" block files"
2903 <<", "<<block_count_all<<" blocks in memory."
2908 void ServerMap::saveMapMeta()
2910 DSTACK(__FUNCTION_NAME);
2912 dstream<<"INFO: ServerMap::saveMapMeta(): "
2916 createDirs(m_savedir);
2918 std::string fullpath = m_savedir + "/map_meta.txt";
2919 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2920 if(os.good() == false)
2922 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2923 <<"could not open"<<fullpath<<std::endl;
2924 throw FileNotGoodException("Cannot open chunk metadata");
2928 params.setU64("seed", m_seed);
2930 params.writeLines(os);
2932 os<<"[end_of_params]\n";
2934 m_map_metadata_changed = false;
2937 void ServerMap::loadMapMeta()
2939 DSTACK(__FUNCTION_NAME);
2941 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2944 std::string fullpath = m_savedir + "/map_meta.txt";
2945 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2946 if(is.good() == false)
2948 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2949 <<"could not open"<<fullpath<<std::endl;
2950 throw FileNotGoodException("Cannot open map metadata");
2958 throw SerializationError
2959 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2961 std::getline(is, line);
2962 std::string trimmedline = trim(line);
2963 if(trimmedline == "[end_of_params]")
2965 params.parseConfigLine(line);
2968 m_seed = params.getU64("seed");
2970 dstream<<"INFO: ServerMap::loadMapMeta(): "
2975 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2977 DSTACK(__FUNCTION_NAME);
2978 // Format used for writing
2979 u8 version = SER_FMT_VER_HIGHEST;
2981 v2s16 pos = sector->getPos();
2982 std::string dir = getSectorDir(pos);
2985 std::string fullpath = dir + "/meta";
2986 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2987 if(o.good() == false)
2988 throw FileNotGoodException("Cannot open sector metafile");
2990 sector->serialize(o, version);
2992 sector->differs_from_disk = false;
2995 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2997 DSTACK(__FUNCTION_NAME);
2999 v2s16 p2d = getSectorPos(sectordir);
3001 ServerMapSector *sector = NULL;
3003 std::string fullpath = sectordir + "/meta";
3004 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3005 if(is.good() == false)
3007 // If the directory exists anyway, it probably is in some old
3008 // format. Just go ahead and create the sector.
3009 if(fs::PathExists(sectordir))
3011 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
3012 <<fullpath<<" doesn't exist but directory does."
3013 <<" Continuing with a sector with no metadata."
3015 sector = new ServerMapSector(this, p2d);
3016 m_sectors.insert(p2d, sector);
3020 throw FileNotGoodException("Cannot open sector metafile");
3025 sector = ServerMapSector::deSerialize
3026 (is, this, p2d, m_sectors);
3028 saveSectorMeta(sector);
3031 sector->differs_from_disk = false;
3036 bool ServerMap::loadSectorMeta(v2s16 p2d)
3038 DSTACK(__FUNCTION_NAME);
3040 MapSector *sector = NULL;
3042 // The directory layout we're going to load from.
3043 // 1 - original sectors/xxxxzzzz/
3044 // 2 - new sectors2/xxx/zzz/
3045 // If we load from anything but the latest structure, we will
3046 // immediately save to the new one, and remove the old.
3048 std::string sectordir1 = getSectorDir(p2d, 1);
3049 std::string sectordir;
3050 if(fs::PathExists(sectordir1))
3052 sectordir = sectordir1;
3057 sectordir = getSectorDir(p2d, 2);
3061 sector = loadSectorMeta(sectordir, loadlayout != 2);
3063 catch(InvalidFilenameException &e)
3067 catch(FileNotGoodException &e)
3071 catch(std::exception &e)
3080 bool ServerMap::loadSectorFull(v2s16 p2d)
3082 DSTACK(__FUNCTION_NAME);
3084 MapSector *sector = NULL;
3086 // The directory layout we're going to load from.
3087 // 1 - original sectors/xxxxzzzz/
3088 // 2 - new sectors2/xxx/zzz/
3089 // If we load from anything but the latest structure, we will
3090 // immediately save to the new one, and remove the old.
3092 std::string sectordir1 = getSectorDir(p2d, 1);
3093 std::string sectordir;
3094 if(fs::PathExists(sectordir1))
3096 sectordir = sectordir1;
3101 sectordir = getSectorDir(p2d, 2);
3105 sector = loadSectorMeta(sectordir, loadlayout != 2);
3107 catch(InvalidFilenameException &e)
3111 catch(FileNotGoodException &e)
3115 catch(std::exception &e)
3123 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3125 std::vector<fs::DirListNode>::iterator i2;
3126 for(i2=list2.begin(); i2!=list2.end(); i2++)
3132 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3134 catch(InvalidFilenameException &e)
3136 // This catches unknown crap in directory
3142 dstream<<"Sector converted to new layout - deleting "<<
3143 sectordir1<<std::endl;
3144 fs::RecursiveDelete(sectordir1);
3151 void ServerMap::saveBlock(MapBlock *block)
3153 DSTACK(__FUNCTION_NAME);
3155 Dummy blocks are not written
3157 if(block->isDummy())
3159 /*v3s16 p = block->getPos();
3160 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3161 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3165 // Format used for writing
3166 u8 version = SER_FMT_VER_HIGHEST;
3168 v3s16 p3d = block->getPos();
3170 v2s16 p2d(p3d.X, p3d.Z);
3171 std::string sectordir = getSectorDir(p2d);
3173 createDirs(sectordir);
3175 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3176 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3177 if(o.good() == false)
3178 throw FileNotGoodException("Cannot open block data");
3181 [0] u8 serialization version
3184 o.write((char*)&version, 1);
3187 block->serialize(o, version);
3189 // Write extra data stored on disk
3190 block->serializeDiskExtra(o, version);
3192 // We just wrote it to the disk so clear modified flag
3193 block->resetModified();
3196 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3198 DSTACK(__FUNCTION_NAME);
3200 std::string fullpath = sectordir+"/"+blockfile;
3203 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3204 if(is.good() == false)
3205 throw FileNotGoodException("Cannot open block file");
3207 v3s16 p3d = getBlockPos(sectordir, blockfile);
3208 v2s16 p2d(p3d.X, p3d.Z);
3210 assert(sector->getPos() == p2d);
3212 u8 version = SER_FMT_VER_INVALID;
3213 is.read((char*)&version, 1);
3216 throw SerializationError("ServerMap::loadBlock(): Failed"
3217 " to read MapBlock version");
3219 /*u32 block_size = MapBlock::serializedLength(version);
3220 SharedBuffer<u8> data(block_size);
3221 is.read((char*)*data, block_size);*/
3223 // This will always return a sector because we're the server
3224 //MapSector *sector = emergeSector(p2d);
3226 MapBlock *block = NULL;
3227 bool created_new = false;
3228 block = sector->getBlockNoCreateNoEx(p3d.Y);
3231 block = sector->createBlankBlockNoInsert(p3d.Y);
3236 block->deSerialize(is, version);
3238 // Read extra data stored on disk
3239 block->deSerializeDiskExtra(is, version);
3241 // If it's a new block, insert it to the map
3243 sector->insertBlock(block);
3246 Save blocks loaded in old format in new format
3249 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3254 // We just loaded it from the disk, so it's up-to-date.
3255 block->resetModified();
3258 catch(SerializationError &e)
3260 dstream<<"WARNING: Invalid block data on disk "
3261 <<"fullpath="<<fullpath
3262 <<" (SerializationError). "
3263 <<"what()="<<e.what()
3265 //" Ignoring. A new one will be generated.
3268 // TODO: Backup file; name is in fullpath.
3272 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3274 DSTACK(__FUNCTION_NAME);
3276 v2s16 p2d(blockpos.X, blockpos.Z);
3278 // The directory layout we're going to load from.
3279 // 1 - original sectors/xxxxzzzz/
3280 // 2 - new sectors2/xxx/zzz/
3281 // If we load from anything but the latest structure, we will
3282 // immediately save to the new one, and remove the old.
3284 std::string sectordir1 = getSectorDir(p2d, 1);
3285 std::string sectordir;
3286 if(fs::PathExists(sectordir1))
3288 sectordir = sectordir1;
3293 sectordir = getSectorDir(p2d, 2);
3297 Make sure sector is loaded
3299 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3303 sector = loadSectorMeta(sectordir, loadlayout != 2);
3305 catch(InvalidFilenameException &e)
3309 catch(FileNotGoodException &e)
3313 catch(std::exception &e)
3320 Make sure file exists
3323 std::string blockfilename = getBlockFilename(blockpos);
3324 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3330 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3331 return getBlockNoCreateNoEx(blockpos);
3334 void ServerMap::PrintInfo(std::ostream &out)
3345 ClientMap::ClientMap(
3347 MapDrawControl &control,
3348 scene::ISceneNode* parent,
3349 scene::ISceneManager* mgr,
3353 scene::ISceneNode(parent, mgr, id),
3356 m_camera_position(0,0,0),
3357 m_camera_direction(0,0,1)
3359 m_camera_mutex.Init();
3360 assert(m_camera_mutex.IsInitialized());
3362 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3363 BS*1000000,BS*1000000,BS*1000000);
3366 ClientMap::~ClientMap()
3368 /*JMutexAutoLock lock(mesh_mutex);
3377 MapSector * ClientMap::emergeSector(v2s16 p2d)
3379 DSTACK(__FUNCTION_NAME);
3380 // Check that it doesn't exist already
3382 return getSectorNoGenerate(p2d);
3384 catch(InvalidPositionException &e)
3389 ClientMapSector *sector = new ClientMapSector(this, p2d);
3392 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3393 m_sectors.insert(p2d, sector);
3400 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3402 DSTACK(__FUNCTION_NAME);
3403 ClientMapSector *sector = NULL;
3405 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3407 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3411 sector = (ClientMapSector*)n->getValue();
3412 assert(sector->getId() == MAPSECTOR_CLIENT);
3416 sector = new ClientMapSector(this, p2d);
3418 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3419 m_sectors.insert(p2d, sector);
3423 sector->deSerialize(is);
3427 void ClientMap::OnRegisterSceneNode()
3431 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3432 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3435 ISceneNode::OnRegisterSceneNode();
3438 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3440 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3441 DSTACK(__FUNCTION_NAME);
3443 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3446 This is called two times per frame, reset on the non-transparent one
3448 if(pass == scene::ESNRP_SOLID)
3450 m_last_drawn_sectors.clear();
3454 Get time for measuring timeout.
3456 Measuring time is very useful for long delays when the
3457 machine is swapping a lot.
3459 int time1 = time(0);
3461 //u32 daynight_ratio = m_client->getDayNightRatio();
3463 m_camera_mutex.Lock();
3464 v3f camera_position = m_camera_position;
3465 v3f camera_direction = m_camera_direction;
3466 m_camera_mutex.Unlock();
3469 Get all blocks and draw all visible ones
3472 v3s16 cam_pos_nodes(
3473 camera_position.X / BS,
3474 camera_position.Y / BS,
3475 camera_position.Z / BS);
3477 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3479 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3480 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3482 // Take a fair amount as we will be dropping more out later
3484 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3485 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3486 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3488 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3489 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3490 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3492 u32 vertex_count = 0;
3494 // For limiting number of mesh updates per frame
3495 u32 mesh_update_count = 0;
3497 u32 blocks_would_have_drawn = 0;
3498 u32 blocks_drawn = 0;
3500 int timecheck_counter = 0;
3501 core::map<v2s16, MapSector*>::Iterator si;
3502 si = m_sectors.getIterator();
3503 for(; si.atEnd() == false; si++)
3506 timecheck_counter++;
3507 if(timecheck_counter > 50)
3509 timecheck_counter = 0;
3510 int time2 = time(0);
3511 if(time2 > time1 + 4)
3513 dstream<<"ClientMap::renderMap(): "
3514 "Rendering takes ages, returning."
3521 MapSector *sector = si.getNode()->getValue();
3522 v2s16 sp = sector->getPos();
3524 if(m_control.range_all == false)
3526 if(sp.X < p_blocks_min.X
3527 || sp.X > p_blocks_max.X
3528 || sp.Y < p_blocks_min.Z
3529 || sp.Y > p_blocks_max.Z)
3533 core::list< MapBlock * > sectorblocks;
3534 sector->getBlocks(sectorblocks);
3540 u32 sector_blocks_drawn = 0;
3542 core::list< MapBlock * >::Iterator i;
3543 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3545 MapBlock *block = *i;
3548 Compare block position to camera position, skip
3549 if not seen on display
3552 float range = 100000 * BS;
3553 if(m_control.range_all == false)
3554 range = m_control.wanted_range * BS;
3557 if(isBlockInSight(block->getPos(), camera_position,
3558 camera_direction, range, &d) == false)
3563 // Okay, this block will be drawn. Reset usage timer.
3564 block->resetUsageTimer();
3566 // This is ugly (spherical distance limit?)
3567 /*if(m_control.range_all == false &&
3568 d - 0.5*BS*MAP_BLOCKSIZE > range)
3573 Update expired mesh (used for day/night change)
3575 It doesn't work exactly like it should now with the
3576 tasked mesh update but whatever.
3579 bool mesh_expired = false;
3582 JMutexAutoLock lock(block->mesh_mutex);
3584 mesh_expired = block->getMeshExpired();
3586 // Mesh has not been expired and there is no mesh:
3587 // block has no content
3588 if(block->mesh == NULL && mesh_expired == false)
3592 f32 faraway = BS*50;
3593 //f32 faraway = m_control.wanted_range * BS;
3596 This has to be done with the mesh_mutex unlocked
3598 // Pretty random but this should work somewhat nicely
3599 if(mesh_expired && (
3600 (mesh_update_count < 3
3601 && (d < faraway || mesh_update_count < 2)
3604 (m_control.range_all && mesh_update_count < 20)
3607 /*if(mesh_expired && mesh_update_count < 6
3608 && (d < faraway || mesh_update_count < 3))*/
3610 mesh_update_count++;
3612 // Mesh has been expired: generate new mesh
3613 //block->updateMesh(daynight_ratio);
3614 m_client->addUpdateMeshTask(block->getPos());
3616 mesh_expired = false;
3621 Draw the faces of the block
3624 JMutexAutoLock lock(block->mesh_mutex);
3626 scene::SMesh *mesh = block->mesh;
3631 blocks_would_have_drawn++;
3632 if(blocks_drawn >= m_control.wanted_max_blocks
3633 && m_control.range_all == false
3634 && d > m_control.wanted_min_range * BS)
3638 sector_blocks_drawn++;
3640 u32 c = mesh->getMeshBufferCount();
3642 for(u32 i=0; i<c; i++)
3644 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3645 const video::SMaterial& material = buf->getMaterial();
3646 video::IMaterialRenderer* rnd =
3647 driver->getMaterialRenderer(material.MaterialType);
3648 bool transparent = (rnd && rnd->isTransparent());
3649 // Render transparent on transparent pass and likewise.
3650 if(transparent == is_transparent_pass)
3653 This *shouldn't* hurt too much because Irrlicht
3654 doesn't change opengl textures if the old
3655 material is set again.
3657 driver->setMaterial(buf->getMaterial());
3658 driver->drawMeshBuffer(buf);
3659 vertex_count += buf->getVertexCount();
3663 } // foreach sectorblocks
3665 if(sector_blocks_drawn != 0)
3667 m_last_drawn_sectors[sp] = true;
3671 m_control.blocks_drawn = blocks_drawn;
3672 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3674 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3675 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3678 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3679 core::map<v3s16, MapBlock*> *affected_blocks)
3681 bool changed = false;
3683 Add it to all blocks touching it
3686 v3s16(0,0,0), // this
3687 v3s16(0,0,1), // back
3688 v3s16(0,1,0), // top
3689 v3s16(1,0,0), // right
3690 v3s16(0,0,-1), // front
3691 v3s16(0,-1,0), // bottom
3692 v3s16(-1,0,0), // left
3694 for(u16 i=0; i<7; i++)
3696 v3s16 p2 = p + dirs[i];
3697 // Block position of neighbor (or requested) node
3698 v3s16 blockpos = getNodeBlockPos(p2);
3699 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3700 if(blockref == NULL)
3702 // Relative position of requested node
3703 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3704 if(blockref->setTempMod(relpos, mod))
3709 if(changed && affected_blocks!=NULL)
3711 for(u16 i=0; i<7; i++)
3713 v3s16 p2 = p + dirs[i];
3714 // Block position of neighbor (or requested) node
3715 v3s16 blockpos = getNodeBlockPos(p2);
3716 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3717 if(blockref == NULL)
3719 affected_blocks->insert(blockpos, blockref);
3725 bool ClientMap::clearTempMod(v3s16 p,
3726 core::map<v3s16, MapBlock*> *affected_blocks)
3728 bool changed = false;
3730 v3s16(0,0,0), // this
3731 v3s16(0,0,1), // back
3732 v3s16(0,1,0), // top
3733 v3s16(1,0,0), // right
3734 v3s16(0,0,-1), // front
3735 v3s16(0,-1,0), // bottom
3736 v3s16(-1,0,0), // left
3738 for(u16 i=0; i<7; i++)
3740 v3s16 p2 = p + dirs[i];
3741 // Block position of neighbor (or requested) node
3742 v3s16 blockpos = getNodeBlockPos(p2);
3743 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3744 if(blockref == NULL)
3746 // Relative position of requested node
3747 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3748 if(blockref->clearTempMod(relpos))
3753 if(changed && affected_blocks!=NULL)
3755 for(u16 i=0; i<7; i++)
3757 v3s16 p2 = p + dirs[i];
3758 // Block position of neighbor (or requested) node
3759 v3s16 blockpos = getNodeBlockPos(p2);
3760 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3761 if(blockref == NULL)
3763 affected_blocks->insert(blockpos, blockref);
3769 void ClientMap::expireMeshes(bool only_daynight_diffed)
3771 TimeTaker timer("expireMeshes()");
3773 core::map<v2s16, MapSector*>::Iterator si;
3774 si = m_sectors.getIterator();
3775 for(; si.atEnd() == false; si++)
3777 MapSector *sector = si.getNode()->getValue();
3779 core::list< MapBlock * > sectorblocks;
3780 sector->getBlocks(sectorblocks);
3782 core::list< MapBlock * >::Iterator i;
3783 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3785 MapBlock *block = *i;
3787 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3793 JMutexAutoLock lock(block->mesh_mutex);
3794 if(block->mesh != NULL)
3796 /*block->mesh->drop();
3797 block->mesh = NULL;*/
3798 block->setMeshExpired(true);
3805 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3807 assert(mapType() == MAPTYPE_CLIENT);
3810 v3s16 p = blockpos + v3s16(0,0,0);
3811 MapBlock *b = getBlockNoCreate(p);
3812 b->updateMesh(daynight_ratio);
3813 //b->setMeshExpired(true);
3815 catch(InvalidPositionException &e){}
3818 v3s16 p = blockpos + v3s16(-1,0,0);
3819 MapBlock *b = getBlockNoCreate(p);
3820 b->updateMesh(daynight_ratio);
3821 //b->setMeshExpired(true);
3823 catch(InvalidPositionException &e){}
3825 v3s16 p = blockpos + v3s16(0,-1,0);
3826 MapBlock *b = getBlockNoCreate(p);
3827 b->updateMesh(daynight_ratio);
3828 //b->setMeshExpired(true);
3830 catch(InvalidPositionException &e){}
3832 v3s16 p = blockpos + v3s16(0,0,-1);
3833 MapBlock *b = getBlockNoCreate(p);
3834 b->updateMesh(daynight_ratio);
3835 //b->setMeshExpired(true);
3837 catch(InvalidPositionException &e){}
3842 Update mesh of block in which the node is, and if the node is at the
3843 leading edge, update the appropriate leading blocks too.
3845 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3853 v3s16 blockposes[4];
3854 for(u32 i=0; i<4; i++)
3856 v3s16 np = nodepos + dirs[i];
3857 blockposes[i] = getNodeBlockPos(np);
3858 // Don't update mesh of block if it has been done already
3859 bool already_updated = false;
3860 for(u32 j=0; j<i; j++)
3862 if(blockposes[j] == blockposes[i])
3864 already_updated = true;
3871 MapBlock *b = getBlockNoCreate(blockposes[i]);
3872 b->updateMesh(daynight_ratio);
3877 void ClientMap::PrintInfo(std::ostream &out)
3888 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3893 MapVoxelManipulator::~MapVoxelManipulator()
3895 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3899 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3901 TimeTaker timer1("emerge", &emerge_time);
3903 // Units of these are MapBlocks
3904 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3905 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3907 VoxelArea block_area_nodes
3908 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3910 addArea(block_area_nodes);
3912 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3913 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3914 for(s32 x=p_min.X; x<=p_max.X; x++)
3917 core::map<v3s16, bool>::Node *n;
3918 n = m_loaded_blocks.find(p);
3922 bool block_data_inexistent = false;
3925 TimeTaker timer1("emerge load", &emerge_load_time);
3927 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3928 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3931 dstream<<std::endl;*/
3933 MapBlock *block = m_map->getBlockNoCreate(p);
3934 if(block->isDummy())
3935 block_data_inexistent = true;
3937 block->copyTo(*this);
3939 catch(InvalidPositionException &e)
3941 block_data_inexistent = true;
3944 if(block_data_inexistent)
3946 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3947 // Fill with VOXELFLAG_INEXISTENT
3948 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3949 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3951 s32 i = m_area.index(a.MinEdge.X,y,z);
3952 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3956 m_loaded_blocks.insert(p, !block_data_inexistent);
3959 //dstream<<"emerge done"<<std::endl;
3963 SUGG: Add an option to only update eg. water and air nodes.
3964 This will make it interfere less with important stuff if
3967 void MapVoxelManipulator::blitBack
3968 (core::map<v3s16, MapBlock*> & modified_blocks)
3970 if(m_area.getExtent() == v3s16(0,0,0))
3973 //TimeTaker timer1("blitBack");
3975 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3976 <<m_loaded_blocks.size()<<std::endl;*/
3979 Initialize block cache
3981 v3s16 blockpos_last;
3982 MapBlock *block = NULL;
3983 bool block_checked_in_modified = false;
3985 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3986 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3987 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3991 u8 f = m_flags[m_area.index(p)];
3992 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3995 MapNode &n = m_data[m_area.index(p)];
3997 v3s16 blockpos = getNodeBlockPos(p);
4002 if(block == NULL || blockpos != blockpos_last){
4003 block = m_map->getBlockNoCreate(blockpos);
4004 blockpos_last = blockpos;
4005 block_checked_in_modified = false;
4008 // Calculate relative position in block
4009 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
4011 // Don't continue if nothing has changed here
4012 if(block->getNode(relpos) == n)
4015 //m_map->setNode(m_area.MinEdge + p, n);
4016 block->setNode(relpos, n);
4019 Make sure block is in modified_blocks
4021 if(block_checked_in_modified == false)
4023 modified_blocks[blockpos] = block;
4024 block_checked_in_modified = true;
4027 catch(InvalidPositionException &e)
4033 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
4034 MapVoxelManipulator(map),
4035 m_create_area(false)
4039 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
4043 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
4045 // Just create the area so that it can be pointed to
4046 VoxelManipulator::emerge(a, caller_id);
4049 void ManualMapVoxelManipulator::initialEmerge(
4050 v3s16 blockpos_min, v3s16 blockpos_max)
4052 TimeTaker timer1("initialEmerge", &emerge_time);
4054 // Units of these are MapBlocks
4055 v3s16 p_min = blockpos_min;
4056 v3s16 p_max = blockpos_max;
4058 VoxelArea block_area_nodes
4059 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4061 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
4064 dstream<<"initialEmerge: area: ";
4065 block_area_nodes.print(dstream);
4066 dstream<<" ("<<size_MB<<"MB)";
4070 addArea(block_area_nodes);
4072 for(s32 z=p_min.Z; z<=p_max.Z; z++)
4073 for(s32 y=p_min.Y; y<=p_max.Y; y++)
4074 for(s32 x=p_min.X; x<=p_max.X; x++)
4077 core::map<v3s16, bool>::Node *n;
4078 n = m_loaded_blocks.find(p);
4082 bool block_data_inexistent = false;
4085 TimeTaker timer1("emerge load", &emerge_load_time);
4087 MapBlock *block = m_map->getBlockNoCreate(p);
4088 if(block->isDummy())
4089 block_data_inexistent = true;
4091 block->copyTo(*this);
4093 catch(InvalidPositionException &e)
4095 block_data_inexistent = true;
4098 if(block_data_inexistent)
4101 Mark area inexistent
4103 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4104 // Fill with VOXELFLAG_INEXISTENT
4105 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4106 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4108 s32 i = m_area.index(a.MinEdge.X,y,z);
4109 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4113 m_loaded_blocks.insert(p, !block_data_inexistent);
4117 void ManualMapVoxelManipulator::blitBackAll(
4118 core::map<v3s16, MapBlock*> * modified_blocks)
4120 if(m_area.getExtent() == v3s16(0,0,0))
4124 Copy data of all blocks
4126 for(core::map<v3s16, bool>::Iterator
4127 i = m_loaded_blocks.getIterator();
4128 i.atEnd() == false; i++)
4130 v3s16 p = i.getNode()->getKey();
4131 bool existed = i.getNode()->getValue();
4132 if(existed == false)
4134 // The Great Bug was found using this
4135 /*dstream<<"ManualMapVoxelManipulator::blitBackAll: "
4136 <<"Inexistent ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4140 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4143 dstream<<"WARNING: "<<__FUNCTION_NAME
4144 <<": got NULL block "
4145 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4150 block->copyFrom(*this);
4153 modified_blocks->insert(p, block);