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.d == CONTENT_MUD)
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.d).walkable == true)
926 MapNode bottomnode = getNode(bottompos);
928 if(bottomnode.d == CONTENT_GRASS
929 || bottomnode.d == CONTENT_GRASS_FOOTSTEPS)
931 bottomnode.d = 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.d == CONTENT_MUD && node_under_sunlight)
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.d).sunlight_propagates)
991 n.setLight(LIGHTBANK_DAY, LIGHT_SUN);
995 Set the node on the map
1004 NodeMetadata *meta_proto = content_features(n.d).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.d).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.d) || n2.d == 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 u8 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.d = 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.d) || n2.d == 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)
1568 Get a queued transforming liquid node
1570 v3s16 p0 = m_transforming_liquid.pop_front();
1572 MapNode n0 = getNodeNoEx(p0);
1575 Collect information about current node
1577 s8 liquid_level = -1;
1578 u8 liquid_kind = CONTENT_IGNORE;
1579 LiquidType liquid_type = content_features(n0.d).liquid_type;
1580 switch (liquid_type) {
1583 liquid_kind = content_features(n0.d).liquid_alternative_flowing;
1585 case LIQUID_FLOWING:
1586 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
1590 // if this is an air node, it *could* be transformed into a liquid. otherwise,
1591 // continue with the next node.
1592 if (n0.d != CONTENT_AIR)
1594 liquid_kind = CONTENT_AIR;
1599 Collect information about the environment
1602 v3s16( 0, 1, 0), // top
1603 v3s16( 0,-1, 0), // bottom
1604 v3s16( 1, 0, 0), // right
1605 v3s16(-1, 0, 0), // left
1606 v3s16( 0, 0, 1), // back
1607 v3s16( 0, 0,-1), // front
1609 NodeNeighbor sources[6]; // surrounding sources
1610 int num_sources = 0;
1611 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
1613 NodeNeighbor airs[6]; // surrounding air
1615 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
1616 int num_neutrals = 0;
1617 bool flowing_down = false;
1618 for (u16 i = 0; i < 6; i++) {
1619 NeighborType nt = NEIGHBOR_SAME_LEVEL;
1622 nt = NEIGHBOR_UPPER;
1625 nt = NEIGHBOR_LOWER;
1628 v3s16 npos = p0 + dirs[i];
1629 NodeNeighbor nb = {getNodeNoEx(npos), nt, npos};
1630 switch (content_features(nb.n.d).liquid_type) {
1632 if (nb.n.d == CONTENT_AIR) {
1633 airs[num_airs++] = nb;
1634 // if the current node happens to be a flowing node, it will start to flow down here.
1635 if (nb.t == NEIGHBOR_LOWER)
1636 flowing_down = true;
1638 neutrals[num_neutrals++] = nb;
1642 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1643 if (liquid_kind == CONTENT_AIR)
1644 liquid_kind = content_features(nb.n.d).liquid_alternative_flowing;
1645 if (content_features(nb.n.d).liquid_alternative_flowing !=liquid_kind) {
1646 neutrals[num_neutrals++] = nb;
1648 sources[num_sources++] = nb;
1651 case LIQUID_FLOWING:
1652 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1653 if (liquid_kind == CONTENT_AIR)
1654 liquid_kind = content_features(nb.n.d).liquid_alternative_flowing;
1655 if (content_features(nb.n.d).liquid_alternative_flowing != liquid_kind) {
1656 neutrals[num_neutrals++] = nb;
1658 flows[num_flows++] = nb;
1659 if (nb.t == NEIGHBOR_LOWER)
1660 flowing_down = true;
1667 decide on the type (and possibly level) of the current node
1669 u8 new_node_content;
1670 s8 new_node_level = -1;
1671 if (num_sources >= 2 || liquid_type == LIQUID_SOURCE) {
1672 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
1673 // or the flowing alternative of the first of the surrounding sources (if it's air), so
1674 // it's perfectly safe to use liquid_kind here to determine the new node content.
1675 new_node_content = content_features(liquid_kind).liquid_alternative_source;
1676 } else if (num_sources == 1 && sources[0].t != NEIGHBOR_LOWER) {
1677 // liquid_kind is set properly, see above
1678 new_node_content = liquid_kind;
1681 // no surrounding sources, so get the maximum level that can flow into this node
1682 for (u16 i = 0; i < num_flows; i++) {
1683 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1684 switch (flows[i].t) {
1685 case NEIGHBOR_UPPER:
1686 if (nb_liquid_level + WATER_DROP_BOOST > new_node_level) {
1688 if (nb_liquid_level + WATER_DROP_BOOST < 7)
1689 new_node_level = nb_liquid_level + WATER_DROP_BOOST;
1692 case NEIGHBOR_LOWER:
1694 case NEIGHBOR_SAME_LEVEL:
1695 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
1696 nb_liquid_level > 0 && nb_liquid_level - 1 > new_node_level) {
1697 new_node_level = nb_liquid_level - 1;
1702 // don't flow as far in open terrain - if there isn't at least one adjacent solid block,
1703 // substract another unit from the resulting water level.
1704 if (!flowing_down && new_node_level >= 1) {
1705 bool at_wall = false;
1706 for (u16 i = 0; i < num_neutrals; i++) {
1707 if (neutrals[i].t == NEIGHBOR_SAME_LEVEL) {
1713 new_node_level -= 1;
1716 if (new_node_level >= 0)
1717 new_node_content = liquid_kind;
1719 new_node_content = CONTENT_AIR;
1723 check if anything has changed. if not, just continue with the next node.
1725 if (new_node_content == n0.d && (content_features(n0.d).liquid_type != LIQUID_FLOWING ||
1726 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
1727 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
1733 update the current node
1735 bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
1736 n0.d = new_node_content;
1737 if (content_features(n0.d).liquid_type == LIQUID_FLOWING) {
1738 // set level to last 3 bits, flowing down bit to 4th bit
1739 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
1744 v3s16 blockpos = getNodeBlockPos(p0);
1745 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1747 modified_blocks.insert(blockpos, block);
1750 enqueue neighbors for update if neccessary
1752 switch (content_features(n0.d).liquid_type) {
1754 // make sure source flows into all neighboring nodes
1755 for (u16 i = 0; i < num_flows; i++)
1756 if (flows[i].t != NEIGHBOR_UPPER)
1757 m_transforming_liquid.push_back(flows[i].p);
1758 for (u16 i = 0; i < num_airs; i++)
1759 if (airs[i].t != NEIGHBOR_UPPER)
1760 m_transforming_liquid.push_back(airs[i].p);
1763 // this flow has turned to air; neighboring flows might need to do the same
1764 for (u16 i = 0; i < num_flows; i++)
1765 m_transforming_liquid.push_back(flows[i].p);
1767 case LIQUID_FLOWING:
1768 for (u16 i = 0; i < num_flows; i++) {
1769 u8 flow_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1770 // liquid_level is still the ORIGINAL level of this node.
1771 if (flows[i].t != NEIGHBOR_UPPER && ((flow_level < liquid_level || flow_level < new_node_level) ||
1773 m_transforming_liquid.push_back(flows[i].p);
1775 for (u16 i = 0; i < num_airs; i++) {
1776 if (airs[i].t != NEIGHBOR_UPPER && (airs[i].t == NEIGHBOR_LOWER || new_node_level > 0))
1777 m_transforming_liquid.push_back(airs[i].p);
1783 //if(loopcount >= 100000)
1784 if(loopcount >= initial_size * 10) {
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 /*dstream<<"initBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2007 <<blockpos.Z<<")"<<std::endl;*/
2009 data->no_op = false;
2010 data->seed = m_seed;
2011 data->blockpos = blockpos;
2014 Create the whole area of this and the neighboring blocks
2017 //TimeTaker timer("initBlockMake() create area");
2019 for(s16 x=-1; x<=1; x++)
2020 for(s16 z=-1; z<=1; z++)
2022 v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2023 // Sector metadata is loaded from disk if not already loaded.
2024 ServerMapSector *sector = createSector(sectorpos);
2027 for(s16 y=-1; y<=1; y++)
2029 MapBlock *block = createBlock(blockpos);
2031 // Lighting won't be calculated
2032 block->setLightingExpired(true);
2033 // Lighting will be calculated
2034 //block->setLightingExpired(false);
2037 Block gets sunlight if this is true.
2039 This should be set to true when the top side of a block
2040 is completely exposed to the sky.
2042 block->setIsUnderground(false);
2048 Now we have a big empty area.
2050 Make a ManualMapVoxelManipulator that contains this and the
2054 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2055 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2057 data->vmanip = new ManualMapVoxelManipulator(this);
2058 //data->vmanip->setMap(this);
2062 //TimeTaker timer("initBlockMake() initialEmerge");
2063 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2066 // Data is ready now.
2069 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2070 core::map<v3s16, MapBlock*> &changed_blocks)
2072 v3s16 blockpos = data->blockpos;
2073 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2074 <<blockpos.Z<<")"<<std::endl;*/
2078 dstream<<"finishBlockMake(): no-op"<<std::endl;
2082 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2084 /*dstream<<"Resulting vmanip:"<<std::endl;
2085 data->vmanip.print(dstream);*/
2088 Blit generated stuff to map
2089 NOTE: blitBackAll adds nearly everything to changed_blocks
2093 //TimeTaker timer("finishBlockMake() blitBackAll");
2094 data->vmanip->blitBackAll(&changed_blocks);
2097 if(enable_mapgen_debug_info)
2098 dstream<<"finishBlockMake: changed_blocks.size()="
2099 <<changed_blocks.size()<<std::endl;
2102 Copy transforming liquid information
2104 while(data->transforming_liquid.size() > 0)
2106 v3s16 p = data->transforming_liquid.pop_front();
2107 m_transforming_liquid.push_back(p);
2113 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2117 Set is_underground flag for lighting with sunlight
2120 block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2123 Add sunlight to central block.
2124 This makes in-dark-spawning monsters to not flood the whole thing.
2125 Do not spread the light, though.
2127 /*core::map<v3s16, bool> light_sources;
2128 bool black_air_left = false;
2129 block->propagateSunlight(light_sources, true, &black_air_left);*/
2132 NOTE: Lighting and object adding shouldn't really be here, but
2133 lighting is a bit tricky to move properly to makeBlock.
2134 TODO: Do this the right way anyway, that is, move it to makeBlock.
2135 - There needs to be some way for makeBlock to report back if
2136 the lighting update is going further down because of the
2137 new block blocking light
2142 NOTE: This takes ~60ms, TODO: Investigate why
2145 TimeTaker t("finishBlockMake lighting update");
2147 core::map<v3s16, MapBlock*> lighting_update_blocks;
2149 lighting_update_blocks.insert(block->getPos(), block);
2151 // All modified blocks
2152 for(core::map<v3s16, MapBlock*>::Iterator
2153 i = changed_blocks.getIterator();
2154 i.atEnd() == false; i++)
2156 lighting_update_blocks.insert(i.getNode()->getKey(),
2157 i.getNode()->getValue());
2160 updateLighting(lighting_update_blocks, changed_blocks);
2162 if(enable_mapgen_debug_info == false)
2163 t.stop(true); // Hide output
2167 Add random objects to block
2169 mapgen::add_random_objects(block);
2172 Go through changed blocks
2174 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2175 i.atEnd() == false; i++)
2177 MapBlock *block = i.getNode()->getValue();
2180 Update day/night difference cache of the MapBlocks
2182 block->updateDayNightDiff();
2184 Set block as modified
2186 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2190 Set central block as generated
2192 block->setGenerated(true);
2195 Save changed parts of map
2196 NOTE: Will be saved later.
2200 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2201 <<blockpos.Z<<")"<<std::endl;*/
2206 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2208 DSTACKF("%s: p2d=(%d,%d)",
2213 Check if it exists already in memory
2215 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2220 Try to load it from disk (with blocks)
2222 //if(loadSectorFull(p2d) == true)
2225 Try to load metadata from disk
2227 if(loadSectorMeta(p2d) == true)
2229 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2232 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2233 throw InvalidPositionException("");
2239 Do not create over-limit
2241 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2242 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2243 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2244 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2245 throw InvalidPositionException("createSector(): pos. over limit");
2248 Generate blank sector
2251 sector = new ServerMapSector(this, p2d);
2253 // Sector position on map in nodes
2254 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2259 m_sectors.insert(p2d, sector);
2265 This is a quick-hand function for calling makeBlock().
2267 MapBlock * ServerMap::generateBlock(
2269 core::map<v3s16, MapBlock*> &modified_blocks
2272 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2274 /*dstream<<"generateBlock(): "
2275 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2278 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2280 TimeTaker timer("generateBlock");
2282 //MapBlock *block = original_dummy;
2284 v2s16 p2d(p.X, p.Z);
2285 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2288 Do not generate over-limit
2290 if(blockpos_over_limit(p))
2292 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2293 throw InvalidPositionException("generateBlock(): pos. over limit");
2297 Create block make data
2299 mapgen::BlockMakeData data;
2300 initBlockMake(&data, p);
2306 TimeTaker t("mapgen::make_block()");
2307 mapgen::make_block(&data);
2309 if(enable_mapgen_debug_info == false)
2310 t.stop(true); // Hide output
2314 Blit data back on map, update lighting, add mobs and whatever this does
2316 finishBlockMake(&data, modified_blocks);
2321 MapBlock *block = getBlockNoCreateNoEx(p);
2328 bool erroneus_content = false;
2329 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2330 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2331 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2334 MapNode n = block->getNode(p);
2335 if(n.d == CONTENT_IGNORE)
2337 dstream<<"CONTENT_IGNORE at "
2338 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2340 erroneus_content = true;
2344 if(erroneus_content)
2352 Generate a completely empty block
2354 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2355 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2357 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2363 n.d = CONTENT_STONE;
2364 block->setNode(v3s16(x0,y0,z0), n);
2369 if(enable_mapgen_debug_info == false)
2370 timer.stop(true); // Hide output
2375 MapBlock * ServerMap::createBlock(v3s16 p)
2377 DSTACKF("%s: p=(%d,%d,%d)",
2378 __FUNCTION_NAME, p.X, p.Y, p.Z);
2381 Do not create over-limit
2383 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2384 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2385 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2386 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2387 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2388 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2389 throw InvalidPositionException("createBlock(): pos. over limit");
2391 v2s16 p2d(p.X, p.Z);
2394 This will create or load a sector if not found in memory.
2395 If block exists on disk, it will be loaded.
2397 NOTE: On old save formats, this will be slow, as it generates
2398 lighting on blocks for them.
2400 ServerMapSector *sector;
2402 sector = (ServerMapSector*)createSector(p2d);
2403 assert(sector->getId() == MAPSECTOR_SERVER);
2405 catch(InvalidPositionException &e)
2407 dstream<<"createBlock: createSector() failed"<<std::endl;
2411 NOTE: This should not be done, or at least the exception
2412 should not be passed on as std::exception, because it
2413 won't be catched at all.
2415 /*catch(std::exception &e)
2417 dstream<<"createBlock: createSector() failed: "
2418 <<e.what()<<std::endl;
2423 Try to get a block from the sector
2426 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2429 if(block->isDummy())
2434 block = sector->createBlankBlock(block_y);
2438 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2440 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2442 p.X, p.Y, p.Z, allow_generate);
2445 MapBlock *block = getBlockNoCreateNoEx(p);
2451 MapBlock *block = loadBlock(p);
2458 core::map<v3s16, MapBlock*> modified_blocks;
2459 MapBlock *block = generateBlock(p, modified_blocks);
2463 event.type = MEET_OTHER;
2466 // Copy modified_blocks to event
2467 for(core::map<v3s16, MapBlock*>::Iterator
2468 i = modified_blocks.getIterator();
2469 i.atEnd()==false; i++)
2471 event.modified_blocks.insert(i.getNode()->getKey(), false);
2475 dispatchEvent(&event);
2486 Do not generate over-limit
2488 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2489 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2490 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2491 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2492 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2493 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2494 throw InvalidPositionException("emergeBlock(): pos. over limit");
2496 v2s16 p2d(p.X, p.Z);
2499 This will create or load a sector if not found in memory.
2500 If block exists on disk, it will be loaded.
2502 ServerMapSector *sector;
2504 sector = createSector(p2d);
2505 //sector = emergeSector(p2d, changed_blocks);
2507 catch(InvalidPositionException &e)
2509 dstream<<"emergeBlock: createSector() failed: "
2510 <<e.what()<<std::endl;
2511 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2513 <<"You could try to delete it."<<std::endl;
2516 catch(VersionMismatchException &e)
2518 dstream<<"emergeBlock: createSector() failed: "
2519 <<e.what()<<std::endl;
2520 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2522 <<"You could try to delete it."<<std::endl;
2527 Try to get a block from the sector
2530 bool does_not_exist = false;
2531 bool lighting_expired = false;
2532 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2534 // If not found, try loading from disk
2537 block = loadBlock(p);
2543 does_not_exist = true;
2545 else if(block->isDummy() == true)
2547 does_not_exist = true;
2549 else if(block->getLightingExpired())
2551 lighting_expired = true;
2556 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2561 If block was not found on disk and not going to generate a
2562 new one, make sure there is a dummy block in place.
2564 if(only_from_disk && (does_not_exist || lighting_expired))
2566 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2570 // Create dummy block
2571 block = new MapBlock(this, p, true);
2573 // Add block to sector
2574 sector->insertBlock(block);
2580 //dstream<<"Not found on disk, generating."<<std::endl;
2582 //TimeTaker("emergeBlock() generate");
2584 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2587 If the block doesn't exist, generate the block.
2591 block = generateBlock(p, block, sector, changed_blocks,
2592 lighting_invalidated_blocks);
2595 if(lighting_expired)
2597 lighting_invalidated_blocks.insert(p, block);
2602 Initially update sunlight
2605 core::map<v3s16, bool> light_sources;
2606 bool black_air_left = false;
2607 bool bottom_invalid =
2608 block->propagateSunlight(light_sources, true,
2611 // If sunlight didn't reach everywhere and part of block is
2612 // above ground, lighting has to be properly updated
2613 //if(black_air_left && some_part_underground)
2616 lighting_invalidated_blocks[block->getPos()] = block;
2621 lighting_invalidated_blocks[block->getPos()] = block;
2630 s16 ServerMap::findGroundLevel(v2s16 p2d)
2634 Uh, just do something random...
2636 // Find existing map from top to down
2639 v3s16 p(p2d.X, max, p2d.Y);
2640 for(; p.Y>min; p.Y--)
2642 MapNode n = getNodeNoEx(p);
2643 if(n.d != CONTENT_IGNORE)
2648 // If this node is not air, go to plan b
2649 if(getNodeNoEx(p).d != CONTENT_AIR)
2651 // Search existing walkable and return it
2652 for(; p.Y>min; p.Y--)
2654 MapNode n = getNodeNoEx(p);
2655 if(content_walkable(n.d) && n.d != CONTENT_IGNORE)
2664 Determine from map generator noise functions
2667 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2670 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2671 //return (s16)level;
2674 void ServerMap::createDirs(std::string path)
2676 if(fs::CreateAllDirs(path) == false)
2678 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2679 <<"\""<<path<<"\""<<std::endl;
2680 throw BaseException("ServerMap failed to create directory");
2684 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2690 snprintf(cc, 9, "%.4x%.4x",
2691 (unsigned int)pos.X&0xffff,
2692 (unsigned int)pos.Y&0xffff);
2694 return m_savedir + "/sectors/" + cc;
2696 snprintf(cc, 9, "%.3x/%.3x",
2697 (unsigned int)pos.X&0xfff,
2698 (unsigned int)pos.Y&0xfff);
2700 return m_savedir + "/sectors2/" + cc;
2706 v2s16 ServerMap::getSectorPos(std::string dirname)
2710 size_t spos = dirname.rfind('/') + 1;
2711 assert(spos != std::string::npos);
2712 if(dirname.size() - spos == 8)
2715 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2717 else if(dirname.size() - spos == 3)
2720 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2721 // Sign-extend the 12 bit values up to 16 bits...
2722 if(x&0x800) x|=0xF000;
2723 if(y&0x800) y|=0xF000;
2730 v2s16 pos((s16)x, (s16)y);
2734 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2736 v2s16 p2d = getSectorPos(sectordir);
2738 if(blockfile.size() != 4){
2739 throw InvalidFilenameException("Invalid block filename");
2742 int r = sscanf(blockfile.c_str(), "%4x", &y);
2744 throw InvalidFilenameException("Invalid block filename");
2745 return v3s16(p2d.X, y, p2d.Y);
2748 std::string ServerMap::getBlockFilename(v3s16 p)
2751 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2755 void ServerMap::save(bool only_changed)
2757 DSTACK(__FUNCTION_NAME);
2758 if(m_map_saving_enabled == false)
2760 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2764 if(only_changed == false)
2765 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2768 if(only_changed == false || m_map_metadata_changed)
2773 u32 sector_meta_count = 0;
2774 u32 block_count = 0;
2775 u32 block_count_all = 0; // Number of blocks in memory
2777 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2778 for(; i.atEnd() == false; i++)
2780 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2781 assert(sector->getId() == MAPSECTOR_SERVER);
2783 if(sector->differs_from_disk || only_changed == false)
2785 saveSectorMeta(sector);
2786 sector_meta_count++;
2788 core::list<MapBlock*> blocks;
2789 sector->getBlocks(blocks);
2790 core::list<MapBlock*>::Iterator j;
2791 for(j=blocks.begin(); j!=blocks.end(); j++)
2793 MapBlock *block = *j;
2797 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2798 || only_changed == false)
2803 /*dstream<<"ServerMap: Written block ("
2804 <<block->getPos().X<<","
2805 <<block->getPos().Y<<","
2806 <<block->getPos().Z<<")"
2813 Only print if something happened or saved whole map
2815 if(only_changed == false || sector_meta_count != 0
2816 || block_count != 0)
2818 dstream<<DTIME<<"ServerMap: Written: "
2819 <<sector_meta_count<<" sector metadata files, "
2820 <<block_count<<" block files"
2821 <<", "<<block_count_all<<" blocks in memory."
2826 void ServerMap::saveMapMeta()
2828 DSTACK(__FUNCTION_NAME);
2830 dstream<<"INFO: ServerMap::saveMapMeta(): "
2834 createDirs(m_savedir);
2836 std::string fullpath = m_savedir + "/map_meta.txt";
2837 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2838 if(os.good() == false)
2840 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2841 <<"could not open"<<fullpath<<std::endl;
2842 throw FileNotGoodException("Cannot open chunk metadata");
2846 params.setU64("seed", m_seed);
2848 params.writeLines(os);
2850 os<<"[end_of_params]\n";
2852 m_map_metadata_changed = false;
2855 void ServerMap::loadMapMeta()
2857 DSTACK(__FUNCTION_NAME);
2859 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2862 std::string fullpath = m_savedir + "/map_meta.txt";
2863 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2864 if(is.good() == false)
2866 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2867 <<"could not open"<<fullpath<<std::endl;
2868 throw FileNotGoodException("Cannot open map metadata");
2876 throw SerializationError
2877 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2879 std::getline(is, line);
2880 std::string trimmedline = trim(line);
2881 if(trimmedline == "[end_of_params]")
2883 params.parseConfigLine(line);
2886 m_seed = params.getU64("seed");
2888 dstream<<"INFO: ServerMap::loadMapMeta(): "
2893 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2895 DSTACK(__FUNCTION_NAME);
2896 // Format used for writing
2897 u8 version = SER_FMT_VER_HIGHEST;
2899 v2s16 pos = sector->getPos();
2900 std::string dir = getSectorDir(pos);
2903 std::string fullpath = dir + "/meta";
2904 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2905 if(o.good() == false)
2906 throw FileNotGoodException("Cannot open sector metafile");
2908 sector->serialize(o, version);
2910 sector->differs_from_disk = false;
2913 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2915 DSTACK(__FUNCTION_NAME);
2917 v2s16 p2d = getSectorPos(sectordir);
2919 ServerMapSector *sector = NULL;
2921 std::string fullpath = sectordir + "/meta";
2922 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2923 if(is.good() == false)
2925 // If the directory exists anyway, it probably is in some old
2926 // format. Just go ahead and create the sector.
2927 if(fs::PathExists(sectordir))
2929 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
2930 <<fullpath<<" doesn't exist but directory does."
2931 <<" Continuing with a sector with no metadata."
2933 sector = new ServerMapSector(this, p2d);
2934 m_sectors.insert(p2d, sector);
2938 throw FileNotGoodException("Cannot open sector metafile");
2943 sector = ServerMapSector::deSerialize
2944 (is, this, p2d, m_sectors);
2946 saveSectorMeta(sector);
2949 sector->differs_from_disk = false;
2954 bool ServerMap::loadSectorMeta(v2s16 p2d)
2956 DSTACK(__FUNCTION_NAME);
2958 MapSector *sector = NULL;
2960 // The directory layout we're going to load from.
2961 // 1 - original sectors/xxxxzzzz/
2962 // 2 - new sectors2/xxx/zzz/
2963 // If we load from anything but the latest structure, we will
2964 // immediately save to the new one, and remove the old.
2966 std::string sectordir1 = getSectorDir(p2d, 1);
2967 std::string sectordir;
2968 if(fs::PathExists(sectordir1))
2970 sectordir = sectordir1;
2975 sectordir = getSectorDir(p2d, 2);
2979 sector = loadSectorMeta(sectordir, loadlayout != 2);
2981 catch(InvalidFilenameException &e)
2985 catch(FileNotGoodException &e)
2989 catch(std::exception &e)
2998 bool ServerMap::loadSectorFull(v2s16 p2d)
3000 DSTACK(__FUNCTION_NAME);
3002 MapSector *sector = NULL;
3004 // The directory layout we're going to load from.
3005 // 1 - original sectors/xxxxzzzz/
3006 // 2 - new sectors2/xxx/zzz/
3007 // If we load from anything but the latest structure, we will
3008 // immediately save to the new one, and remove the old.
3010 std::string sectordir1 = getSectorDir(p2d, 1);
3011 std::string sectordir;
3012 if(fs::PathExists(sectordir1))
3014 sectordir = sectordir1;
3019 sectordir = getSectorDir(p2d, 2);
3023 sector = loadSectorMeta(sectordir, loadlayout != 2);
3025 catch(InvalidFilenameException &e)
3029 catch(FileNotGoodException &e)
3033 catch(std::exception &e)
3041 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3043 std::vector<fs::DirListNode>::iterator i2;
3044 for(i2=list2.begin(); i2!=list2.end(); i2++)
3050 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3052 catch(InvalidFilenameException &e)
3054 // This catches unknown crap in directory
3060 dstream<<"Sector converted to new layout - deleting "<<
3061 sectordir1<<std::endl;
3062 fs::RecursiveDelete(sectordir1);
3069 void ServerMap::saveBlock(MapBlock *block)
3071 DSTACK(__FUNCTION_NAME);
3073 Dummy blocks are not written
3075 if(block->isDummy())
3077 /*v3s16 p = block->getPos();
3078 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3079 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3083 // Format used for writing
3084 u8 version = SER_FMT_VER_HIGHEST;
3086 v3s16 p3d = block->getPos();
3088 v2s16 p2d(p3d.X, p3d.Z);
3089 std::string sectordir = getSectorDir(p2d);
3091 createDirs(sectordir);
3093 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3094 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3095 if(o.good() == false)
3096 throw FileNotGoodException("Cannot open block data");
3099 [0] u8 serialization version
3102 o.write((char*)&version, 1);
3105 block->serialize(o, version);
3107 // Write extra data stored on disk
3108 block->serializeDiskExtra(o, version);
3110 // We just wrote it to the disk so clear modified flag
3111 block->resetModified();
3114 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3116 DSTACK(__FUNCTION_NAME);
3118 std::string fullpath = sectordir+"/"+blockfile;
3121 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3122 if(is.good() == false)
3123 throw FileNotGoodException("Cannot open block file");
3125 v3s16 p3d = getBlockPos(sectordir, blockfile);
3126 v2s16 p2d(p3d.X, p3d.Z);
3128 assert(sector->getPos() == p2d);
3130 u8 version = SER_FMT_VER_INVALID;
3131 is.read((char*)&version, 1);
3134 throw SerializationError("ServerMap::loadBlock(): Failed"
3135 " to read MapBlock version");
3137 /*u32 block_size = MapBlock::serializedLength(version);
3138 SharedBuffer<u8> data(block_size);
3139 is.read((char*)*data, block_size);*/
3141 // This will always return a sector because we're the server
3142 //MapSector *sector = emergeSector(p2d);
3144 MapBlock *block = NULL;
3145 bool created_new = false;
3146 block = sector->getBlockNoCreateNoEx(p3d.Y);
3149 block = sector->createBlankBlockNoInsert(p3d.Y);
3154 block->deSerialize(is, version);
3156 // Read extra data stored on disk
3157 block->deSerializeDiskExtra(is, version);
3159 // If it's a new block, insert it to the map
3161 sector->insertBlock(block);
3164 Save blocks loaded in old format in new format
3167 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3172 // We just loaded it from the disk, so it's up-to-date.
3173 block->resetModified();
3176 catch(SerializationError &e)
3178 dstream<<"WARNING: Invalid block data on disk "
3179 <<"fullpath="<<fullpath
3180 <<" (SerializationError). "
3181 <<"what()="<<e.what()
3183 //" Ignoring. A new one will be generated.
3186 // TODO: Backup file; name is in fullpath.
3190 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3192 DSTACK(__FUNCTION_NAME);
3194 v2s16 p2d(blockpos.X, blockpos.Z);
3196 // The directory layout we're going to load from.
3197 // 1 - original sectors/xxxxzzzz/
3198 // 2 - new sectors2/xxx/zzz/
3199 // If we load from anything but the latest structure, we will
3200 // immediately save to the new one, and remove the old.
3202 std::string sectordir1 = getSectorDir(p2d, 1);
3203 std::string sectordir;
3204 if(fs::PathExists(sectordir1))
3206 sectordir = sectordir1;
3211 sectordir = getSectorDir(p2d, 2);
3215 Make sure sector is loaded
3217 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3221 sector = loadSectorMeta(sectordir, loadlayout != 2);
3223 catch(InvalidFilenameException &e)
3227 catch(FileNotGoodException &e)
3231 catch(std::exception &e)
3238 Make sure file exists
3241 std::string blockfilename = getBlockFilename(blockpos);
3242 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3248 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3249 return getBlockNoCreateNoEx(blockpos);
3252 void ServerMap::PrintInfo(std::ostream &out)
3263 ClientMap::ClientMap(
3265 MapDrawControl &control,
3266 scene::ISceneNode* parent,
3267 scene::ISceneManager* mgr,
3271 scene::ISceneNode(parent, mgr, id),
3274 m_camera_position(0,0,0),
3275 m_camera_direction(0,0,1)
3277 m_camera_mutex.Init();
3278 assert(m_camera_mutex.IsInitialized());
3280 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3281 BS*1000000,BS*1000000,BS*1000000);
3284 ClientMap::~ClientMap()
3286 /*JMutexAutoLock lock(mesh_mutex);
3295 MapSector * ClientMap::emergeSector(v2s16 p2d)
3297 DSTACK(__FUNCTION_NAME);
3298 // Check that it doesn't exist already
3300 return getSectorNoGenerate(p2d);
3302 catch(InvalidPositionException &e)
3307 ClientMapSector *sector = new ClientMapSector(this, p2d);
3310 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3311 m_sectors.insert(p2d, sector);
3318 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3320 DSTACK(__FUNCTION_NAME);
3321 ClientMapSector *sector = NULL;
3323 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3325 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3329 sector = (ClientMapSector*)n->getValue();
3330 assert(sector->getId() == MAPSECTOR_CLIENT);
3334 sector = new ClientMapSector(this, p2d);
3336 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3337 m_sectors.insert(p2d, sector);
3341 sector->deSerialize(is);
3345 void ClientMap::OnRegisterSceneNode()
3349 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3350 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3353 ISceneNode::OnRegisterSceneNode();
3356 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3358 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3359 DSTACK(__FUNCTION_NAME);
3361 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3364 This is called two times per frame, reset on the non-transparent one
3366 if(pass == scene::ESNRP_SOLID)
3368 m_last_drawn_sectors.clear();
3372 Get time for measuring timeout.
3374 Measuring time is very useful for long delays when the
3375 machine is swapping a lot.
3377 int time1 = time(0);
3379 //u32 daynight_ratio = m_client->getDayNightRatio();
3381 m_camera_mutex.Lock();
3382 v3f camera_position = m_camera_position;
3383 v3f camera_direction = m_camera_direction;
3384 m_camera_mutex.Unlock();
3387 Get all blocks and draw all visible ones
3390 v3s16 cam_pos_nodes(
3391 camera_position.X / BS,
3392 camera_position.Y / BS,
3393 camera_position.Z / BS);
3395 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3397 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3398 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3400 // Take a fair amount as we will be dropping more out later
3402 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3403 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3404 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3406 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3407 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3408 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3410 u32 vertex_count = 0;
3412 // For limiting number of mesh updates per frame
3413 u32 mesh_update_count = 0;
3415 u32 blocks_would_have_drawn = 0;
3416 u32 blocks_drawn = 0;
3418 int timecheck_counter = 0;
3419 core::map<v2s16, MapSector*>::Iterator si;
3420 si = m_sectors.getIterator();
3421 for(; si.atEnd() == false; si++)
3424 timecheck_counter++;
3425 if(timecheck_counter > 50)
3427 timecheck_counter = 0;
3428 int time2 = time(0);
3429 if(time2 > time1 + 4)
3431 dstream<<"ClientMap::renderMap(): "
3432 "Rendering takes ages, returning."
3439 MapSector *sector = si.getNode()->getValue();
3440 v2s16 sp = sector->getPos();
3442 if(m_control.range_all == false)
3444 if(sp.X < p_blocks_min.X
3445 || sp.X > p_blocks_max.X
3446 || sp.Y < p_blocks_min.Z
3447 || sp.Y > p_blocks_max.Z)
3451 core::list< MapBlock * > sectorblocks;
3452 sector->getBlocks(sectorblocks);
3458 u32 sector_blocks_drawn = 0;
3460 core::list< MapBlock * >::Iterator i;
3461 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3463 MapBlock *block = *i;
3466 Compare block position to camera position, skip
3467 if not seen on display
3470 float range = 100000 * BS;
3471 if(m_control.range_all == false)
3472 range = m_control.wanted_range * BS;
3475 if(isBlockInSight(block->getPos(), camera_position,
3476 camera_direction, range, &d) == false)
3481 // Okay, this block will be drawn. Reset usage timer.
3482 block->resetUsageTimer();
3484 // This is ugly (spherical distance limit?)
3485 /*if(m_control.range_all == false &&
3486 d - 0.5*BS*MAP_BLOCKSIZE > range)
3491 Update expired mesh (used for day/night change)
3493 It doesn't work exactly like it should now with the
3494 tasked mesh update but whatever.
3497 bool mesh_expired = false;
3500 JMutexAutoLock lock(block->mesh_mutex);
3502 mesh_expired = block->getMeshExpired();
3504 // Mesh has not been expired and there is no mesh:
3505 // block has no content
3506 if(block->mesh == NULL && mesh_expired == false)
3510 f32 faraway = BS*50;
3511 //f32 faraway = m_control.wanted_range * BS;
3514 This has to be done with the mesh_mutex unlocked
3516 // Pretty random but this should work somewhat nicely
3517 if(mesh_expired && (
3518 (mesh_update_count < 3
3519 && (d < faraway || mesh_update_count < 2)
3522 (m_control.range_all && mesh_update_count < 20)
3525 /*if(mesh_expired && mesh_update_count < 6
3526 && (d < faraway || mesh_update_count < 3))*/
3528 mesh_update_count++;
3530 // Mesh has been expired: generate new mesh
3531 //block->updateMesh(daynight_ratio);
3532 m_client->addUpdateMeshTask(block->getPos());
3534 mesh_expired = false;
3539 Draw the faces of the block
3542 JMutexAutoLock lock(block->mesh_mutex);
3544 scene::SMesh *mesh = block->mesh;
3549 blocks_would_have_drawn++;
3550 if(blocks_drawn >= m_control.wanted_max_blocks
3551 && m_control.range_all == false
3552 && d > m_control.wanted_min_range * BS)
3556 sector_blocks_drawn++;
3558 u32 c = mesh->getMeshBufferCount();
3560 for(u32 i=0; i<c; i++)
3562 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3563 const video::SMaterial& material = buf->getMaterial();
3564 video::IMaterialRenderer* rnd =
3565 driver->getMaterialRenderer(material.MaterialType);
3566 bool transparent = (rnd && rnd->isTransparent());
3567 // Render transparent on transparent pass and likewise.
3568 if(transparent == is_transparent_pass)
3571 This *shouldn't* hurt too much because Irrlicht
3572 doesn't change opengl textures if the old
3573 material is set again.
3575 driver->setMaterial(buf->getMaterial());
3576 driver->drawMeshBuffer(buf);
3577 vertex_count += buf->getVertexCount();
3581 } // foreach sectorblocks
3583 if(sector_blocks_drawn != 0)
3585 m_last_drawn_sectors[sp] = true;
3589 m_control.blocks_drawn = blocks_drawn;
3590 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3592 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3593 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3596 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3597 core::map<v3s16, MapBlock*> *affected_blocks)
3599 bool changed = false;
3601 Add it to all blocks touching it
3604 v3s16(0,0,0), // this
3605 v3s16(0,0,1), // back
3606 v3s16(0,1,0), // top
3607 v3s16(1,0,0), // right
3608 v3s16(0,0,-1), // front
3609 v3s16(0,-1,0), // bottom
3610 v3s16(-1,0,0), // left
3612 for(u16 i=0; i<7; i++)
3614 v3s16 p2 = p + dirs[i];
3615 // Block position of neighbor (or requested) node
3616 v3s16 blockpos = getNodeBlockPos(p2);
3617 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3618 if(blockref == NULL)
3620 // Relative position of requested node
3621 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3622 if(blockref->setTempMod(relpos, mod))
3627 if(changed && affected_blocks!=NULL)
3629 for(u16 i=0; i<7; i++)
3631 v3s16 p2 = p + dirs[i];
3632 // Block position of neighbor (or requested) node
3633 v3s16 blockpos = getNodeBlockPos(p2);
3634 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3635 if(blockref == NULL)
3637 affected_blocks->insert(blockpos, blockref);
3643 bool ClientMap::clearTempMod(v3s16 p,
3644 core::map<v3s16, MapBlock*> *affected_blocks)
3646 bool changed = false;
3648 v3s16(0,0,0), // this
3649 v3s16(0,0,1), // back
3650 v3s16(0,1,0), // top
3651 v3s16(1,0,0), // right
3652 v3s16(0,0,-1), // front
3653 v3s16(0,-1,0), // bottom
3654 v3s16(-1,0,0), // left
3656 for(u16 i=0; i<7; i++)
3658 v3s16 p2 = p + dirs[i];
3659 // Block position of neighbor (or requested) node
3660 v3s16 blockpos = getNodeBlockPos(p2);
3661 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3662 if(blockref == NULL)
3664 // Relative position of requested node
3665 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3666 if(blockref->clearTempMod(relpos))
3671 if(changed && affected_blocks!=NULL)
3673 for(u16 i=0; i<7; i++)
3675 v3s16 p2 = p + dirs[i];
3676 // Block position of neighbor (or requested) node
3677 v3s16 blockpos = getNodeBlockPos(p2);
3678 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3679 if(blockref == NULL)
3681 affected_blocks->insert(blockpos, blockref);
3687 void ClientMap::expireMeshes(bool only_daynight_diffed)
3689 TimeTaker timer("expireMeshes()");
3691 core::map<v2s16, MapSector*>::Iterator si;
3692 si = m_sectors.getIterator();
3693 for(; si.atEnd() == false; si++)
3695 MapSector *sector = si.getNode()->getValue();
3697 core::list< MapBlock * > sectorblocks;
3698 sector->getBlocks(sectorblocks);
3700 core::list< MapBlock * >::Iterator i;
3701 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3703 MapBlock *block = *i;
3705 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3711 JMutexAutoLock lock(block->mesh_mutex);
3712 if(block->mesh != NULL)
3714 /*block->mesh->drop();
3715 block->mesh = NULL;*/
3716 block->setMeshExpired(true);
3723 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3725 assert(mapType() == MAPTYPE_CLIENT);
3728 v3s16 p = blockpos + v3s16(0,0,0);
3729 MapBlock *b = getBlockNoCreate(p);
3730 b->updateMesh(daynight_ratio);
3731 //b->setMeshExpired(true);
3733 catch(InvalidPositionException &e){}
3736 v3s16 p = blockpos + v3s16(-1,0,0);
3737 MapBlock *b = getBlockNoCreate(p);
3738 b->updateMesh(daynight_ratio);
3739 //b->setMeshExpired(true);
3741 catch(InvalidPositionException &e){}
3743 v3s16 p = blockpos + v3s16(0,-1,0);
3744 MapBlock *b = getBlockNoCreate(p);
3745 b->updateMesh(daynight_ratio);
3746 //b->setMeshExpired(true);
3748 catch(InvalidPositionException &e){}
3750 v3s16 p = blockpos + v3s16(0,0,-1);
3751 MapBlock *b = getBlockNoCreate(p);
3752 b->updateMesh(daynight_ratio);
3753 //b->setMeshExpired(true);
3755 catch(InvalidPositionException &e){}
3760 Update mesh of block in which the node is, and if the node is at the
3761 leading edge, update the appropriate leading blocks too.
3763 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3771 v3s16 blockposes[4];
3772 for(u32 i=0; i<4; i++)
3774 v3s16 np = nodepos + dirs[i];
3775 blockposes[i] = getNodeBlockPos(np);
3776 // Don't update mesh of block if it has been done already
3777 bool already_updated = false;
3778 for(u32 j=0; j<i; j++)
3780 if(blockposes[j] == blockposes[i])
3782 already_updated = true;
3789 MapBlock *b = getBlockNoCreate(blockposes[i]);
3790 b->updateMesh(daynight_ratio);
3795 void ClientMap::PrintInfo(std::ostream &out)
3806 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3811 MapVoxelManipulator::~MapVoxelManipulator()
3813 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3817 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3819 TimeTaker timer1("emerge", &emerge_time);
3821 // Units of these are MapBlocks
3822 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3823 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3825 VoxelArea block_area_nodes
3826 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3828 addArea(block_area_nodes);
3830 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3831 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3832 for(s32 x=p_min.X; x<=p_max.X; x++)
3835 core::map<v3s16, bool>::Node *n;
3836 n = m_loaded_blocks.find(p);
3840 bool block_data_inexistent = false;
3843 TimeTaker timer1("emerge load", &emerge_load_time);
3845 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3846 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3849 dstream<<std::endl;*/
3851 MapBlock *block = m_map->getBlockNoCreate(p);
3852 if(block->isDummy())
3853 block_data_inexistent = true;
3855 block->copyTo(*this);
3857 catch(InvalidPositionException &e)
3859 block_data_inexistent = true;
3862 if(block_data_inexistent)
3864 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3865 // Fill with VOXELFLAG_INEXISTENT
3866 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3867 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3869 s32 i = m_area.index(a.MinEdge.X,y,z);
3870 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3874 m_loaded_blocks.insert(p, !block_data_inexistent);
3877 //dstream<<"emerge done"<<std::endl;
3881 SUGG: Add an option to only update eg. water and air nodes.
3882 This will make it interfere less with important stuff if
3885 void MapVoxelManipulator::blitBack
3886 (core::map<v3s16, MapBlock*> & modified_blocks)
3888 if(m_area.getExtent() == v3s16(0,0,0))
3891 //TimeTaker timer1("blitBack");
3893 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3894 <<m_loaded_blocks.size()<<std::endl;*/
3897 Initialize block cache
3899 v3s16 blockpos_last;
3900 MapBlock *block = NULL;
3901 bool block_checked_in_modified = false;
3903 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3904 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3905 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3909 u8 f = m_flags[m_area.index(p)];
3910 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3913 MapNode &n = m_data[m_area.index(p)];
3915 v3s16 blockpos = getNodeBlockPos(p);
3920 if(block == NULL || blockpos != blockpos_last){
3921 block = m_map->getBlockNoCreate(blockpos);
3922 blockpos_last = blockpos;
3923 block_checked_in_modified = false;
3926 // Calculate relative position in block
3927 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
3929 // Don't continue if nothing has changed here
3930 if(block->getNode(relpos) == n)
3933 //m_map->setNode(m_area.MinEdge + p, n);
3934 block->setNode(relpos, n);
3937 Make sure block is in modified_blocks
3939 if(block_checked_in_modified == false)
3941 modified_blocks[blockpos] = block;
3942 block_checked_in_modified = true;
3945 catch(InvalidPositionException &e)
3951 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
3952 MapVoxelManipulator(map),
3953 m_create_area(false)
3957 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
3961 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3963 // Just create the area so that it can be pointed to
3964 VoxelManipulator::emerge(a, caller_id);
3967 void ManualMapVoxelManipulator::initialEmerge(
3968 v3s16 blockpos_min, v3s16 blockpos_max)
3970 TimeTaker timer1("initialEmerge", &emerge_time);
3972 // Units of these are MapBlocks
3973 v3s16 p_min = blockpos_min;
3974 v3s16 p_max = blockpos_max;
3976 VoxelArea block_area_nodes
3977 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3979 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
3982 dstream<<"initialEmerge: area: ";
3983 block_area_nodes.print(dstream);
3984 dstream<<" ("<<size_MB<<"MB)";
3988 addArea(block_area_nodes);
3990 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3991 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3992 for(s32 x=p_min.X; x<=p_max.X; x++)
3995 core::map<v3s16, bool>::Node *n;
3996 n = m_loaded_blocks.find(p);
4000 bool block_data_inexistent = false;
4003 TimeTaker timer1("emerge load", &emerge_load_time);
4005 MapBlock *block = m_map->getBlockNoCreate(p);
4006 if(block->isDummy())
4007 block_data_inexistent = true;
4009 block->copyTo(*this);
4011 catch(InvalidPositionException &e)
4013 block_data_inexistent = true;
4016 if(block_data_inexistent)
4019 Mark area inexistent
4021 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4022 // Fill with VOXELFLAG_INEXISTENT
4023 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4024 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4026 s32 i = m_area.index(a.MinEdge.X,y,z);
4027 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4031 m_loaded_blocks.insert(p, !block_data_inexistent);
4035 void ManualMapVoxelManipulator::blitBackAll(
4036 core::map<v3s16, MapBlock*> * modified_blocks)
4038 if(m_area.getExtent() == v3s16(0,0,0))
4042 Copy data of all blocks
4044 for(core::map<v3s16, bool>::Iterator
4045 i = m_loaded_blocks.getIterator();
4046 i.atEnd() == false; i++)
4048 bool existed = i.getNode()->getValue();
4049 if(existed == false)
4051 v3s16 p = i.getNode()->getKey();
4052 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4055 dstream<<"WARNING: "<<__FUNCTION_NAME
4056 <<": got NULL block "
4057 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4062 block->copyFrom(*this);
4065 modified_blocks->insert(p, block);