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) {
1587 liquid_level = LIQUID_LEVEL_SOURCE;
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
1606 const v3s16 *dirs = g_6dirs;
1607 NodeNeighbor sources[6]; // surrounding sources
1608 int num_sources = 0;
1609 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
1611 NodeNeighbor airs[6]; // surrounding air
1613 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
1614 int num_neutrals = 0;
1615 bool flowing_down = false;
1616 for (u16 i = 0; i < 6; i++) {
1617 NeighborType nt = NEIGHBOR_SAME_LEVEL;
1620 nt = NEIGHBOR_UPPER;
1623 nt = NEIGHBOR_LOWER;
1626 v3s16 npos = p0 + dirs[i];
1627 NodeNeighbor nb = {getNodeNoEx(npos), nt, npos};
1628 switch (content_features(nb.n.getContent()).liquid_type) {
1630 if (nb.n.getContent() == CONTENT_AIR) {
1631 airs[num_airs++] = nb;
1632 // if the current node is a water source the neighbor
1633 // should be enqueded for transformation regardless of whether the
1634 // current node changes or not.
1635 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
1636 m_transforming_liquid.push_back(npos);
1637 // if the current node happens to be a flowing node, it will start to flow down here.
1638 if (nb.t == NEIGHBOR_LOWER) {
1639 flowing_down = true;
1642 neutrals[num_neutrals++] = nb;
1646 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1647 if (liquid_kind == CONTENT_AIR)
1648 liquid_kind = content_features(nb.n.getContent()).liquid_alternative_flowing;
1649 if (content_features(nb.n.getContent()).liquid_alternative_flowing !=liquid_kind) {
1650 neutrals[num_neutrals++] = nb;
1652 sources[num_sources++] = nb;
1655 case LIQUID_FLOWING:
1656 // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1657 if (liquid_kind == CONTENT_AIR)
1658 liquid_kind = content_features(nb.n.getContent()).liquid_alternative_flowing;
1659 if (content_features(nb.n.getContent()).liquid_alternative_flowing != liquid_kind) {
1660 neutrals[num_neutrals++] = nb;
1662 flows[num_flows++] = nb;
1663 if (nb.t == NEIGHBOR_LOWER)
1664 flowing_down = true;
1671 decide on the type (and possibly level) of the current node
1673 content_t new_node_content;
1674 s8 new_node_level = -1;
1675 if (num_sources >= 2 || liquid_type == LIQUID_SOURCE) {
1676 // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
1677 // or the flowing alternative of the first of the surrounding sources (if it's air), so
1678 // it's perfectly safe to use liquid_kind here to determine the new node content.
1679 new_node_content = content_features(liquid_kind).liquid_alternative_source;
1680 } else if (num_sources == 1 && sources[0].t != NEIGHBOR_LOWER) {
1681 // liquid_kind is set properly, see above
1682 new_node_content = liquid_kind;
1683 new_node_level = LIQUID_LEVEL_MAX;
1685 // no surrounding sources, so get the maximum level that can flow into this node
1686 for (u16 i = 0; i < num_flows; i++) {
1687 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1688 switch (flows[i].t) {
1689 case NEIGHBOR_UPPER:
1690 if (nb_liquid_level + WATER_DROP_BOOST > new_node_level) {
1691 new_node_level = LIQUID_LEVEL_MAX;
1692 if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
1693 new_node_level = nb_liquid_level + WATER_DROP_BOOST;
1696 case NEIGHBOR_LOWER:
1698 case NEIGHBOR_SAME_LEVEL:
1699 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
1700 nb_liquid_level > 0 && nb_liquid_level - 1 > new_node_level) {
1701 new_node_level = nb_liquid_level - 1;
1706 // don't flow as far in open terrain - if there isn't at least one adjacent solid block,
1707 // substract another unit from the resulting water level.
1708 if (!flowing_down && new_node_level >= 1) {
1709 bool at_wall = false;
1710 for (u16 i = 0; i < num_neutrals; i++) {
1711 if (neutrals[i].t == NEIGHBOR_SAME_LEVEL) {
1717 new_node_level -= 1;
1720 if (new_node_level >= 0)
1721 new_node_content = liquid_kind;
1723 new_node_content = CONTENT_AIR;
1727 check if anything has changed. if not, just continue with the next node.
1729 if (new_node_content == n0.getContent() && (content_features(n0.getContent()).liquid_type != LIQUID_FLOWING ||
1730 ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
1731 ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
1737 update the current node
1739 bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
1740 if (content_features(new_node_content).liquid_type == LIQUID_FLOWING) {
1741 // set level to last 3 bits, flowing down bit to 4th bit
1742 n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
1744 // set the liquid level and flow bit to 0
1745 n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
1747 n0.setContent(new_node_content);
1749 v3s16 blockpos = getNodeBlockPos(p0);
1750 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1752 modified_blocks.insert(blockpos, block);
1755 enqueue neighbors for update if neccessary
1757 switch (content_features(n0.getContent()).liquid_type) {
1759 // make sure source flows into all neighboring nodes
1760 for (u16 i = 0; i < num_flows; i++)
1761 if (flows[i].t != NEIGHBOR_UPPER)
1762 m_transforming_liquid.push_back(flows[i].p);
1763 for (u16 i = 0; i < num_airs; i++)
1764 if (airs[i].t != NEIGHBOR_UPPER)
1765 m_transforming_liquid.push_back(airs[i].p);
1768 // this flow has turned to air; neighboring flows might need to do the same
1769 for (u16 i = 0; i < num_flows; i++)
1770 m_transforming_liquid.push_back(flows[i].p);
1772 case LIQUID_FLOWING:
1773 for (u16 i = 0; i < num_flows; i++) {
1774 u8 flow_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1775 // liquid_level is still the ORIGINAL level of this node.
1776 if (flows[i].t != NEIGHBOR_UPPER && ((flow_level < liquid_level || flow_level < new_node_level) ||
1778 m_transforming_liquid.push_back(flows[i].p);
1780 for (u16 i = 0; i < num_airs; i++) {
1781 if (airs[i].t != NEIGHBOR_UPPER && (airs[i].t == NEIGHBOR_LOWER || new_node_level > 0))
1782 m_transforming_liquid.push_back(airs[i].p);
1787 //dstream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
1790 NodeMetadata* Map::getNodeMetadata(v3s16 p)
1792 v3s16 blockpos = getNodeBlockPos(p);
1793 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1794 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1797 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1801 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
1805 void Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
1807 v3s16 blockpos = getNodeBlockPos(p);
1808 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1809 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1812 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1816 block->m_node_metadata.set(p_rel, meta);
1819 void Map::removeNodeMetadata(v3s16 p)
1821 v3s16 blockpos = getNodeBlockPos(p);
1822 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1823 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1826 dstream<<"WARNING: Map::removeNodeMetadata(): Block not found"
1830 block->m_node_metadata.remove(p_rel);
1833 void Map::nodeMetadataStep(float dtime,
1834 core::map<v3s16, MapBlock*> &changed_blocks)
1838 Currently there is no way to ensure that all the necessary
1839 blocks are loaded when this is run. (They might get unloaded)
1840 NOTE: ^- Actually, that might not be so. In a quick test it
1841 reloaded a block with a furnace when I walked back to it from
1844 core::map<v2s16, MapSector*>::Iterator si;
1845 si = m_sectors.getIterator();
1846 for(; si.atEnd() == false; si++)
1848 MapSector *sector = si.getNode()->getValue();
1849 core::list< MapBlock * > sectorblocks;
1850 sector->getBlocks(sectorblocks);
1851 core::list< MapBlock * >::Iterator i;
1852 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
1854 MapBlock *block = *i;
1855 bool changed = block->m_node_metadata.step(dtime);
1857 changed_blocks[block->getPos()] = block;
1866 ServerMap::ServerMap(std::string savedir):
1869 m_map_metadata_changed(true)
1871 dstream<<__FUNCTION_NAME<<std::endl;
1873 //m_chunksize = 8; // Takes a few seconds
1875 m_seed = (((u64)(myrand()%0xffff)<<0)
1876 + ((u64)(myrand()%0xffff)<<16)
1877 + ((u64)(myrand()%0xffff)<<32)
1878 + ((u64)(myrand()%0xffff)<<48));
1881 Experimental and debug stuff
1888 Try to load map; if not found, create a new one.
1891 m_savedir = savedir;
1892 m_map_saving_enabled = false;
1896 // If directory exists, check contents and load if possible
1897 if(fs::PathExists(m_savedir))
1899 // If directory is empty, it is safe to save into it.
1900 if(fs::GetDirListing(m_savedir).size() == 0)
1902 dstream<<DTIME<<"Server: Empty save directory is valid."
1904 m_map_saving_enabled = true;
1909 // Load map metadata (seed, chunksize)
1912 catch(FileNotGoodException &e){
1913 dstream<<DTIME<<"WARNING: Could not load map metadata"
1914 //<<" Disabling chunk-based generator."
1920 // Load chunk metadata
1923 catch(FileNotGoodException &e){
1924 dstream<<DTIME<<"WARNING: Could not load chunk metadata."
1925 <<" Disabling chunk-based generator."
1930 /*dstream<<DTIME<<"Server: Successfully loaded chunk "
1931 "metadata and sector (0,0) from "<<savedir<<
1932 ", assuming valid save directory."
1935 dstream<<DTIME<<"INFO: Server: Successfully loaded map "
1936 <<"and chunk metadata from "<<savedir
1937 <<", assuming valid save directory."
1940 m_map_saving_enabled = true;
1941 // Map loaded, not creating new one
1945 // If directory doesn't exist, it is safe to save to it
1947 m_map_saving_enabled = true;
1950 catch(std::exception &e)
1952 dstream<<DTIME<<"WARNING: Server: Failed to load map from "<<savedir
1953 <<", exception: "<<e.what()<<std::endl;
1954 dstream<<"Please remove the map or fix it."<<std::endl;
1955 dstream<<"WARNING: Map saving will be disabled."<<std::endl;
1958 dstream<<DTIME<<"INFO: Initializing new map."<<std::endl;
1960 // Create zero sector
1961 emergeSector(v2s16(0,0));
1963 // Initially write whole map
1967 ServerMap::~ServerMap()
1969 dstream<<__FUNCTION_NAME<<std::endl;
1973 if(m_map_saving_enabled)
1975 // Save only changed parts
1977 dstream<<DTIME<<"Server: saved map to "<<m_savedir<<std::endl;
1981 dstream<<DTIME<<"Server: map not saved"<<std::endl;
1984 catch(std::exception &e)
1986 dstream<<DTIME<<"Server: Failed to save map to "<<m_savedir
1987 <<", exception: "<<e.what()<<std::endl;
1994 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
1995 for(; i.atEnd() == false; i++)
1997 MapChunk *chunk = i.getNode()->getValue();
2003 void ServerMap::initBlockMake(mapgen::BlockMakeData *data, v3s16 blockpos)
2005 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2006 if(enable_mapgen_debug_info)
2007 dstream<<"initBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2008 <<blockpos.Z<<")"<<std::endl;
2010 // Do nothing if not inside limits (+-1 because of neighbors)
2011 if(blockpos_over_limit(blockpos - v3s16(1,1,1)) ||
2012 blockpos_over_limit(blockpos + v3s16(1,1,1)))
2018 data->no_op = false;
2019 data->seed = m_seed;
2020 data->blockpos = blockpos;
2023 Create the whole area of this and the neighboring blocks
2026 //TimeTaker timer("initBlockMake() create area");
2028 for(s16 x=-1; x<=1; x++)
2029 for(s16 z=-1; z<=1; z++)
2031 v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2032 // Sector metadata is loaded from disk if not already loaded.
2033 ServerMapSector *sector = createSector(sectorpos);
2036 for(s16 y=-1; y<=1; y++)
2038 v3s16 p(blockpos.X+x, blockpos.Y+y, blockpos.Z+z);
2039 //MapBlock *block = createBlock(p);
2040 // 1) get from memory, 2) load from disk
2041 MapBlock *block = emergeBlock(p, false);
2042 // 3) create a blank one
2045 block = createBlock(p);
2048 Block gets sunlight if this is true.
2050 Refer to the map generator heuristics.
2052 bool ug = mapgen::block_is_underground(data->seed, p);
2053 block->setIsUnderground(ug);
2056 // Lighting will not be valid after make_chunk is called
2057 block->setLightingExpired(true);
2058 // Lighting will be calculated
2059 //block->setLightingExpired(false);
2065 Now we have a big empty area.
2067 Make a ManualMapVoxelManipulator that contains this and the
2071 // The area that contains this block and it's neighbors
2072 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2073 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2075 data->vmanip = new ManualMapVoxelManipulator(this);
2076 //data->vmanip->setMap(this);
2080 //TimeTaker timer("initBlockMake() initialEmerge");
2081 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2084 // Data is ready now.
2087 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2088 core::map<v3s16, MapBlock*> &changed_blocks)
2090 v3s16 blockpos = data->blockpos;
2091 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2092 <<blockpos.Z<<")"<<std::endl;*/
2096 //dstream<<"finishBlockMake(): no-op"<<std::endl;
2100 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2102 /*dstream<<"Resulting vmanip:"<<std::endl;
2103 data->vmanip.print(dstream);*/
2106 Blit generated stuff to map
2107 NOTE: blitBackAll adds nearly everything to changed_blocks
2111 //TimeTaker timer("finishBlockMake() blitBackAll");
2112 data->vmanip->blitBackAll(&changed_blocks);
2115 if(enable_mapgen_debug_info)
2116 dstream<<"finishBlockMake: changed_blocks.size()="
2117 <<changed_blocks.size()<<std::endl;
2120 Copy transforming liquid information
2122 while(data->transforming_liquid.size() > 0)
2124 v3s16 p = data->transforming_liquid.pop_front();
2125 m_transforming_liquid.push_back(p);
2131 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2135 Set is_underground flag for lighting with sunlight.
2137 Refer to map generator heuristics.
2139 NOTE: This is done in initChunkMake
2141 //block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2145 Add sunlight to central block.
2146 This makes in-dark-spawning monsters to not flood the whole thing.
2147 Do not spread the light, though.
2149 /*core::map<v3s16, bool> light_sources;
2150 bool black_air_left = false;
2151 block->propagateSunlight(light_sources, true, &black_air_left);*/
2154 NOTE: Lighting and object adding shouldn't really be here, but
2155 lighting is a bit tricky to move properly to makeBlock.
2156 TODO: Do this the right way anyway, that is, move it to makeBlock.
2157 - There needs to be some way for makeBlock to report back if
2158 the lighting update is going further down because of the
2159 new block blocking light
2164 NOTE: This takes ~60ms, TODO: Investigate why
2167 TimeTaker t("finishBlockMake lighting update");
2169 core::map<v3s16, MapBlock*> lighting_update_blocks;
2172 lighting_update_blocks.insert(block->getPos(), block);
2177 v3s16 p = block->getPos()+v3s16(x,1,z);
2178 lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2182 // All modified blocks
2183 // NOTE: Should this be done? If this is not done, then the lighting
2184 // of the others will be updated in a different place, one by one, i
2185 // think... or they might not? Well, at least they are left marked as
2186 // "lighting expired"; it seems that is not handled at all anywhere,
2187 // so enabling this will slow it down A LOT because otherwise it
2188 // would not do this at all. This causes the black trees.
2189 for(core::map<v3s16, MapBlock*>::Iterator
2190 i = changed_blocks.getIterator();
2191 i.atEnd() == false; i++)
2193 lighting_update_blocks.insert(i.getNode()->getKey(),
2194 i.getNode()->getValue());
2196 /*// Also force-add all the upmost blocks for proper sunlight
2197 for(s16 x=-1; x<=1; x++)
2198 for(s16 z=-1; z<=1; z++)
2200 v3s16 p = block->getPos()+v3s16(x,1,z);
2201 lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2204 updateLighting(lighting_update_blocks, changed_blocks);
2207 Set lighting to non-expired state in all of them.
2208 This is cheating, but it is not fast enough if all of them
2209 would actually be updated.
2211 for(s16 x=-1; x<=1; x++)
2212 for(s16 y=-1; y<=1; y++)
2213 for(s16 z=-1; z<=1; z++)
2215 v3s16 p = block->getPos()+v3s16(x,y,z);
2216 getBlockNoCreateNoEx(p)->setLightingExpired(false);
2219 if(enable_mapgen_debug_info == false)
2220 t.stop(true); // Hide output
2224 Add random objects to block
2226 mapgen::add_random_objects(block);
2229 Go through changed blocks
2231 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2232 i.atEnd() == false; i++)
2234 MapBlock *block = i.getNode()->getValue();
2237 Update day/night difference cache of the MapBlocks
2239 block->updateDayNightDiff();
2241 Set block as modified
2243 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2247 Set central block as generated
2249 block->setGenerated(true);
2252 Save changed parts of map
2253 NOTE: Will be saved later.
2257 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2258 <<blockpos.Z<<")"<<std::endl;*/
2260 if(enable_mapgen_debug_info)
2263 Analyze resulting blocks
2265 for(s16 x=-1; x<=1; x++)
2266 for(s16 y=-1; y<=1; y++)
2267 for(s16 z=-1; z<=1; z++)
2269 v3s16 p = block->getPos()+v3s16(x,y,z);
2270 MapBlock *block = getBlockNoCreateNoEx(p);
2272 snprintf(spos, 20, "(%2d,%2d,%2d)", x, y, z);
2273 dstream<<"Generated "<<spos<<": "
2274 <<analyze_block(block)<<std::endl;
2282 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2284 DSTACKF("%s: p2d=(%d,%d)",
2289 Check if it exists already in memory
2291 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2296 Try to load it from disk (with blocks)
2298 //if(loadSectorFull(p2d) == true)
2301 Try to load metadata from disk
2303 if(loadSectorMeta(p2d) == true)
2305 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2308 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2309 throw InvalidPositionException("");
2315 Do not create over-limit
2317 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2318 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2319 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2320 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2321 throw InvalidPositionException("createSector(): pos. over limit");
2324 Generate blank sector
2327 sector = new ServerMapSector(this, p2d);
2329 // Sector position on map in nodes
2330 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2335 m_sectors.insert(p2d, sector);
2341 This is a quick-hand function for calling makeBlock().
2343 MapBlock * ServerMap::generateBlock(
2345 core::map<v3s16, MapBlock*> &modified_blocks
2348 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2350 /*dstream<<"generateBlock(): "
2351 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2354 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2356 TimeTaker timer("generateBlock");
2358 //MapBlock *block = original_dummy;
2360 v2s16 p2d(p.X, p.Z);
2361 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2364 Do not generate over-limit
2366 if(blockpos_over_limit(p))
2368 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2369 throw InvalidPositionException("generateBlock(): pos. over limit");
2373 Create block make data
2375 mapgen::BlockMakeData data;
2376 initBlockMake(&data, p);
2382 TimeTaker t("mapgen::make_block()");
2383 mapgen::make_block(&data);
2385 if(enable_mapgen_debug_info == false)
2386 t.stop(true); // Hide output
2390 Blit data back on map, update lighting, add mobs and whatever this does
2392 finishBlockMake(&data, modified_blocks);
2397 MapBlock *block = getBlockNoCreateNoEx(p);
2405 bool erroneus_content = false;
2406 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2407 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2408 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2411 MapNode n = block->getNode(p);
2412 if(n.getContent() == CONTENT_IGNORE)
2414 dstream<<"CONTENT_IGNORE at "
2415 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2417 erroneus_content = true;
2421 if(erroneus_content)
2430 Generate a completely empty block
2434 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2435 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2437 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2441 n.setContent(CONTENT_AIR);
2443 n.setContent(CONTENT_STONE);
2444 block->setNode(v3s16(x0,y0,z0), n);
2450 if(enable_mapgen_debug_info == false)
2451 timer.stop(true); // Hide output
2456 MapBlock * ServerMap::createBlock(v3s16 p)
2458 DSTACKF("%s: p=(%d,%d,%d)",
2459 __FUNCTION_NAME, p.X, p.Y, p.Z);
2462 Do not create over-limit
2464 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2465 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2466 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2467 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2468 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2469 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2470 throw InvalidPositionException("createBlock(): pos. over limit");
2472 v2s16 p2d(p.X, p.Z);
2475 This will create or load a sector if not found in memory.
2476 If block exists on disk, it will be loaded.
2478 NOTE: On old save formats, this will be slow, as it generates
2479 lighting on blocks for them.
2481 ServerMapSector *sector;
2483 sector = (ServerMapSector*)createSector(p2d);
2484 assert(sector->getId() == MAPSECTOR_SERVER);
2486 catch(InvalidPositionException &e)
2488 dstream<<"createBlock: createSector() failed"<<std::endl;
2492 NOTE: This should not be done, or at least the exception
2493 should not be passed on as std::exception, because it
2494 won't be catched at all.
2496 /*catch(std::exception &e)
2498 dstream<<"createBlock: createSector() failed: "
2499 <<e.what()<<std::endl;
2504 Try to get a block from the sector
2507 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2510 if(block->isDummy())
2515 block = sector->createBlankBlock(block_y);
2519 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2521 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2523 p.X, p.Y, p.Z, allow_generate);
2526 MapBlock *block = getBlockNoCreateNoEx(p);
2527 if(block && block->isDummy() == false)
2532 MapBlock *block = loadBlock(p);
2539 core::map<v3s16, MapBlock*> modified_blocks;
2540 MapBlock *block = generateBlock(p, modified_blocks);
2544 event.type = MEET_OTHER;
2547 // Copy modified_blocks to event
2548 for(core::map<v3s16, MapBlock*>::Iterator
2549 i = modified_blocks.getIterator();
2550 i.atEnd()==false; i++)
2552 event.modified_blocks.insert(i.getNode()->getKey(), false);
2556 dispatchEvent(&event);
2567 Do not generate over-limit
2569 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2570 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2571 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2572 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2573 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2574 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2575 throw InvalidPositionException("emergeBlock(): pos. over limit");
2577 v2s16 p2d(p.X, p.Z);
2580 This will create or load a sector if not found in memory.
2581 If block exists on disk, it will be loaded.
2583 ServerMapSector *sector;
2585 sector = createSector(p2d);
2586 //sector = emergeSector(p2d, changed_blocks);
2588 catch(InvalidPositionException &e)
2590 dstream<<"emergeBlock: createSector() failed: "
2591 <<e.what()<<std::endl;
2592 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2594 <<"You could try to delete it."<<std::endl;
2597 catch(VersionMismatchException &e)
2599 dstream<<"emergeBlock: createSector() failed: "
2600 <<e.what()<<std::endl;
2601 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2603 <<"You could try to delete it."<<std::endl;
2608 Try to get a block from the sector
2611 bool does_not_exist = false;
2612 bool lighting_expired = false;
2613 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2615 // If not found, try loading from disk
2618 block = loadBlock(p);
2624 does_not_exist = true;
2626 else if(block->isDummy() == true)
2628 does_not_exist = true;
2630 else if(block->getLightingExpired())
2632 lighting_expired = true;
2637 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2642 If block was not found on disk and not going to generate a
2643 new one, make sure there is a dummy block in place.
2645 if(only_from_disk && (does_not_exist || lighting_expired))
2647 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2651 // Create dummy block
2652 block = new MapBlock(this, p, true);
2654 // Add block to sector
2655 sector->insertBlock(block);
2661 //dstream<<"Not found on disk, generating."<<std::endl;
2663 //TimeTaker("emergeBlock() generate");
2665 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2668 If the block doesn't exist, generate the block.
2672 block = generateBlock(p, block, sector, changed_blocks,
2673 lighting_invalidated_blocks);
2676 if(lighting_expired)
2678 lighting_invalidated_blocks.insert(p, block);
2683 Initially update sunlight
2686 core::map<v3s16, bool> light_sources;
2687 bool black_air_left = false;
2688 bool bottom_invalid =
2689 block->propagateSunlight(light_sources, true,
2692 // If sunlight didn't reach everywhere and part of block is
2693 // above ground, lighting has to be properly updated
2694 //if(black_air_left && some_part_underground)
2697 lighting_invalidated_blocks[block->getPos()] = block;
2702 lighting_invalidated_blocks[block->getPos()] = block;
2711 s16 ServerMap::findGroundLevel(v2s16 p2d)
2715 Uh, just do something random...
2717 // Find existing map from top to down
2720 v3s16 p(p2d.X, max, p2d.Y);
2721 for(; p.Y>min; p.Y--)
2723 MapNode n = getNodeNoEx(p);
2724 if(n.getContent() != CONTENT_IGNORE)
2729 // If this node is not air, go to plan b
2730 if(getNodeNoEx(p).getContent() != CONTENT_AIR)
2732 // Search existing walkable and return it
2733 for(; p.Y>min; p.Y--)
2735 MapNode n = getNodeNoEx(p);
2736 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
2745 Determine from map generator noise functions
2748 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2751 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2752 //return (s16)level;
2755 void ServerMap::createDirs(std::string path)
2757 if(fs::CreateAllDirs(path) == false)
2759 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2760 <<"\""<<path<<"\""<<std::endl;
2761 throw BaseException("ServerMap failed to create directory");
2765 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2771 snprintf(cc, 9, "%.4x%.4x",
2772 (unsigned int)pos.X&0xffff,
2773 (unsigned int)pos.Y&0xffff);
2775 return m_savedir + "/sectors/" + cc;
2777 snprintf(cc, 9, "%.3x/%.3x",
2778 (unsigned int)pos.X&0xfff,
2779 (unsigned int)pos.Y&0xfff);
2781 return m_savedir + "/sectors2/" + cc;
2787 v2s16 ServerMap::getSectorPos(std::string dirname)
2791 size_t spos = dirname.rfind('/') + 1;
2792 assert(spos != std::string::npos);
2793 if(dirname.size() - spos == 8)
2796 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2798 else if(dirname.size() - spos == 3)
2801 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2802 // Sign-extend the 12 bit values up to 16 bits...
2803 if(x&0x800) x|=0xF000;
2804 if(y&0x800) y|=0xF000;
2811 v2s16 pos((s16)x, (s16)y);
2815 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2817 v2s16 p2d = getSectorPos(sectordir);
2819 if(blockfile.size() != 4){
2820 throw InvalidFilenameException("Invalid block filename");
2823 int r = sscanf(blockfile.c_str(), "%4x", &y);
2825 throw InvalidFilenameException("Invalid block filename");
2826 return v3s16(p2d.X, y, p2d.Y);
2829 std::string ServerMap::getBlockFilename(v3s16 p)
2832 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2836 void ServerMap::save(bool only_changed)
2838 DSTACK(__FUNCTION_NAME);
2839 if(m_map_saving_enabled == false)
2841 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2845 if(only_changed == false)
2846 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2849 if(only_changed == false || m_map_metadata_changed)
2854 u32 sector_meta_count = 0;
2855 u32 block_count = 0;
2856 u32 block_count_all = 0; // Number of blocks in memory
2858 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2859 for(; i.atEnd() == false; i++)
2861 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2862 assert(sector->getId() == MAPSECTOR_SERVER);
2864 if(sector->differs_from_disk || only_changed == false)
2866 saveSectorMeta(sector);
2867 sector_meta_count++;
2869 core::list<MapBlock*> blocks;
2870 sector->getBlocks(blocks);
2871 core::list<MapBlock*>::Iterator j;
2872 for(j=blocks.begin(); j!=blocks.end(); j++)
2874 MapBlock *block = *j;
2878 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2879 || only_changed == false)
2884 /*dstream<<"ServerMap: Written block ("
2885 <<block->getPos().X<<","
2886 <<block->getPos().Y<<","
2887 <<block->getPos().Z<<")"
2894 Only print if something happened or saved whole map
2896 if(only_changed == false || sector_meta_count != 0
2897 || block_count != 0)
2899 dstream<<DTIME<<"ServerMap: Written: "
2900 <<sector_meta_count<<" sector metadata files, "
2901 <<block_count<<" block files"
2902 <<", "<<block_count_all<<" blocks in memory."
2907 void ServerMap::saveMapMeta()
2909 DSTACK(__FUNCTION_NAME);
2911 dstream<<"INFO: ServerMap::saveMapMeta(): "
2915 createDirs(m_savedir);
2917 std::string fullpath = m_savedir + "/map_meta.txt";
2918 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2919 if(os.good() == false)
2921 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2922 <<"could not open"<<fullpath<<std::endl;
2923 throw FileNotGoodException("Cannot open chunk metadata");
2927 params.setU64("seed", m_seed);
2929 params.writeLines(os);
2931 os<<"[end_of_params]\n";
2933 m_map_metadata_changed = false;
2936 void ServerMap::loadMapMeta()
2938 DSTACK(__FUNCTION_NAME);
2940 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2943 std::string fullpath = m_savedir + "/map_meta.txt";
2944 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2945 if(is.good() == false)
2947 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2948 <<"could not open"<<fullpath<<std::endl;
2949 throw FileNotGoodException("Cannot open map metadata");
2957 throw SerializationError
2958 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2960 std::getline(is, line);
2961 std::string trimmedline = trim(line);
2962 if(trimmedline == "[end_of_params]")
2964 params.parseConfigLine(line);
2967 m_seed = params.getU64("seed");
2969 dstream<<"INFO: ServerMap::loadMapMeta(): "
2974 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2976 DSTACK(__FUNCTION_NAME);
2977 // Format used for writing
2978 u8 version = SER_FMT_VER_HIGHEST;
2980 v2s16 pos = sector->getPos();
2981 std::string dir = getSectorDir(pos);
2984 std::string fullpath = dir + "/meta";
2985 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2986 if(o.good() == false)
2987 throw FileNotGoodException("Cannot open sector metafile");
2989 sector->serialize(o, version);
2991 sector->differs_from_disk = false;
2994 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2996 DSTACK(__FUNCTION_NAME);
2998 v2s16 p2d = getSectorPos(sectordir);
3000 ServerMapSector *sector = NULL;
3002 std::string fullpath = sectordir + "/meta";
3003 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3004 if(is.good() == false)
3006 // If the directory exists anyway, it probably is in some old
3007 // format. Just go ahead and create the sector.
3008 if(fs::PathExists(sectordir))
3010 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
3011 <<fullpath<<" doesn't exist but directory does."
3012 <<" Continuing with a sector with no metadata."
3014 sector = new ServerMapSector(this, p2d);
3015 m_sectors.insert(p2d, sector);
3019 throw FileNotGoodException("Cannot open sector metafile");
3024 sector = ServerMapSector::deSerialize
3025 (is, this, p2d, m_sectors);
3027 saveSectorMeta(sector);
3030 sector->differs_from_disk = false;
3035 bool ServerMap::loadSectorMeta(v2s16 p2d)
3037 DSTACK(__FUNCTION_NAME);
3039 MapSector *sector = NULL;
3041 // The directory layout we're going to load from.
3042 // 1 - original sectors/xxxxzzzz/
3043 // 2 - new sectors2/xxx/zzz/
3044 // If we load from anything but the latest structure, we will
3045 // immediately save to the new one, and remove the old.
3047 std::string sectordir1 = getSectorDir(p2d, 1);
3048 std::string sectordir;
3049 if(fs::PathExists(sectordir1))
3051 sectordir = sectordir1;
3056 sectordir = getSectorDir(p2d, 2);
3060 sector = loadSectorMeta(sectordir, loadlayout != 2);
3062 catch(InvalidFilenameException &e)
3066 catch(FileNotGoodException &e)
3070 catch(std::exception &e)
3079 bool ServerMap::loadSectorFull(v2s16 p2d)
3081 DSTACK(__FUNCTION_NAME);
3083 MapSector *sector = NULL;
3085 // The directory layout we're going to load from.
3086 // 1 - original sectors/xxxxzzzz/
3087 // 2 - new sectors2/xxx/zzz/
3088 // If we load from anything but the latest structure, we will
3089 // immediately save to the new one, and remove the old.
3091 std::string sectordir1 = getSectorDir(p2d, 1);
3092 std::string sectordir;
3093 if(fs::PathExists(sectordir1))
3095 sectordir = sectordir1;
3100 sectordir = getSectorDir(p2d, 2);
3104 sector = loadSectorMeta(sectordir, loadlayout != 2);
3106 catch(InvalidFilenameException &e)
3110 catch(FileNotGoodException &e)
3114 catch(std::exception &e)
3122 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3124 std::vector<fs::DirListNode>::iterator i2;
3125 for(i2=list2.begin(); i2!=list2.end(); i2++)
3131 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3133 catch(InvalidFilenameException &e)
3135 // This catches unknown crap in directory
3141 dstream<<"Sector converted to new layout - deleting "<<
3142 sectordir1<<std::endl;
3143 fs::RecursiveDelete(sectordir1);
3150 void ServerMap::saveBlock(MapBlock *block)
3152 DSTACK(__FUNCTION_NAME);
3154 Dummy blocks are not written
3156 if(block->isDummy())
3158 /*v3s16 p = block->getPos();
3159 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3160 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3164 // Format used for writing
3165 u8 version = SER_FMT_VER_HIGHEST;
3167 v3s16 p3d = block->getPos();
3169 v2s16 p2d(p3d.X, p3d.Z);
3170 std::string sectordir = getSectorDir(p2d);
3172 createDirs(sectordir);
3174 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3175 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3176 if(o.good() == false)
3177 throw FileNotGoodException("Cannot open block data");
3180 [0] u8 serialization version
3183 o.write((char*)&version, 1);
3186 block->serialize(o, version);
3188 // Write extra data stored on disk
3189 block->serializeDiskExtra(o, version);
3191 // We just wrote it to the disk so clear modified flag
3192 block->resetModified();
3195 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3197 DSTACK(__FUNCTION_NAME);
3199 std::string fullpath = sectordir+"/"+blockfile;
3202 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3203 if(is.good() == false)
3204 throw FileNotGoodException("Cannot open block file");
3206 v3s16 p3d = getBlockPos(sectordir, blockfile);
3207 v2s16 p2d(p3d.X, p3d.Z);
3209 assert(sector->getPos() == p2d);
3211 u8 version = SER_FMT_VER_INVALID;
3212 is.read((char*)&version, 1);
3215 throw SerializationError("ServerMap::loadBlock(): Failed"
3216 " to read MapBlock version");
3218 /*u32 block_size = MapBlock::serializedLength(version);
3219 SharedBuffer<u8> data(block_size);
3220 is.read((char*)*data, block_size);*/
3222 // This will always return a sector because we're the server
3223 //MapSector *sector = emergeSector(p2d);
3225 MapBlock *block = NULL;
3226 bool created_new = false;
3227 block = sector->getBlockNoCreateNoEx(p3d.Y);
3230 block = sector->createBlankBlockNoInsert(p3d.Y);
3235 block->deSerialize(is, version);
3237 // Read extra data stored on disk
3238 block->deSerializeDiskExtra(is, version);
3240 // If it's a new block, insert it to the map
3242 sector->insertBlock(block);
3245 Save blocks loaded in old format in new format
3248 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3253 // We just loaded it from the disk, so it's up-to-date.
3254 block->resetModified();
3257 catch(SerializationError &e)
3259 dstream<<"WARNING: Invalid block data on disk "
3260 <<"fullpath="<<fullpath
3261 <<" (SerializationError). "
3262 <<"what()="<<e.what()
3264 //" Ignoring. A new one will be generated.
3267 // TODO: Backup file; name is in fullpath.
3271 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3273 DSTACK(__FUNCTION_NAME);
3275 v2s16 p2d(blockpos.X, blockpos.Z);
3277 // The directory layout we're going to load from.
3278 // 1 - original sectors/xxxxzzzz/
3279 // 2 - new sectors2/xxx/zzz/
3280 // If we load from anything but the latest structure, we will
3281 // immediately save to the new one, and remove the old.
3283 std::string sectordir1 = getSectorDir(p2d, 1);
3284 std::string sectordir;
3285 if(fs::PathExists(sectordir1))
3287 sectordir = sectordir1;
3292 sectordir = getSectorDir(p2d, 2);
3296 Make sure sector is loaded
3298 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3302 sector = loadSectorMeta(sectordir, loadlayout != 2);
3304 catch(InvalidFilenameException &e)
3308 catch(FileNotGoodException &e)
3312 catch(std::exception &e)
3319 Make sure file exists
3322 std::string blockfilename = getBlockFilename(blockpos);
3323 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3329 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3330 return getBlockNoCreateNoEx(blockpos);
3333 void ServerMap::PrintInfo(std::ostream &out)
3344 ClientMap::ClientMap(
3346 MapDrawControl &control,
3347 scene::ISceneNode* parent,
3348 scene::ISceneManager* mgr,
3352 scene::ISceneNode(parent, mgr, id),
3355 m_camera_position(0,0,0),
3356 m_camera_direction(0,0,1)
3358 m_camera_mutex.Init();
3359 assert(m_camera_mutex.IsInitialized());
3361 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3362 BS*1000000,BS*1000000,BS*1000000);
3365 ClientMap::~ClientMap()
3367 /*JMutexAutoLock lock(mesh_mutex);
3376 MapSector * ClientMap::emergeSector(v2s16 p2d)
3378 DSTACK(__FUNCTION_NAME);
3379 // Check that it doesn't exist already
3381 return getSectorNoGenerate(p2d);
3383 catch(InvalidPositionException &e)
3388 ClientMapSector *sector = new ClientMapSector(this, p2d);
3391 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3392 m_sectors.insert(p2d, sector);
3399 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3401 DSTACK(__FUNCTION_NAME);
3402 ClientMapSector *sector = NULL;
3404 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3406 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3410 sector = (ClientMapSector*)n->getValue();
3411 assert(sector->getId() == MAPSECTOR_CLIENT);
3415 sector = new ClientMapSector(this, p2d);
3417 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3418 m_sectors.insert(p2d, sector);
3422 sector->deSerialize(is);
3426 void ClientMap::OnRegisterSceneNode()
3430 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3431 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3434 ISceneNode::OnRegisterSceneNode();
3437 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3439 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3440 DSTACK(__FUNCTION_NAME);
3442 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3445 This is called two times per frame, reset on the non-transparent one
3447 if(pass == scene::ESNRP_SOLID)
3449 m_last_drawn_sectors.clear();
3453 Get time for measuring timeout.
3455 Measuring time is very useful for long delays when the
3456 machine is swapping a lot.
3458 int time1 = time(0);
3460 //u32 daynight_ratio = m_client->getDayNightRatio();
3462 m_camera_mutex.Lock();
3463 v3f camera_position = m_camera_position;
3464 v3f camera_direction = m_camera_direction;
3465 m_camera_mutex.Unlock();
3468 Get all blocks and draw all visible ones
3471 v3s16 cam_pos_nodes(
3472 camera_position.X / BS,
3473 camera_position.Y / BS,
3474 camera_position.Z / BS);
3476 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3478 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3479 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3481 // Take a fair amount as we will be dropping more out later
3483 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3484 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3485 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3487 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3488 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3489 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3491 u32 vertex_count = 0;
3493 // For limiting number of mesh updates per frame
3494 u32 mesh_update_count = 0;
3496 u32 blocks_would_have_drawn = 0;
3497 u32 blocks_drawn = 0;
3499 int timecheck_counter = 0;
3500 core::map<v2s16, MapSector*>::Iterator si;
3501 si = m_sectors.getIterator();
3502 for(; si.atEnd() == false; si++)
3505 timecheck_counter++;
3506 if(timecheck_counter > 50)
3508 timecheck_counter = 0;
3509 int time2 = time(0);
3510 if(time2 > time1 + 4)
3512 dstream<<"ClientMap::renderMap(): "
3513 "Rendering takes ages, returning."
3520 MapSector *sector = si.getNode()->getValue();
3521 v2s16 sp = sector->getPos();
3523 if(m_control.range_all == false)
3525 if(sp.X < p_blocks_min.X
3526 || sp.X > p_blocks_max.X
3527 || sp.Y < p_blocks_min.Z
3528 || sp.Y > p_blocks_max.Z)
3532 core::list< MapBlock * > sectorblocks;
3533 sector->getBlocks(sectorblocks);
3539 u32 sector_blocks_drawn = 0;
3541 core::list< MapBlock * >::Iterator i;
3542 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3544 MapBlock *block = *i;
3547 Compare block position to camera position, skip
3548 if not seen on display
3551 float range = 100000 * BS;
3552 if(m_control.range_all == false)
3553 range = m_control.wanted_range * BS;
3556 if(isBlockInSight(block->getPos(), camera_position,
3557 camera_direction, range, &d) == false)
3562 // Okay, this block will be drawn. Reset usage timer.
3563 block->resetUsageTimer();
3565 // This is ugly (spherical distance limit?)
3566 /*if(m_control.range_all == false &&
3567 d - 0.5*BS*MAP_BLOCKSIZE > range)
3572 Update expired mesh (used for day/night change)
3574 It doesn't work exactly like it should now with the
3575 tasked mesh update but whatever.
3578 bool mesh_expired = false;
3581 JMutexAutoLock lock(block->mesh_mutex);
3583 mesh_expired = block->getMeshExpired();
3585 // Mesh has not been expired and there is no mesh:
3586 // block has no content
3587 if(block->mesh == NULL && mesh_expired == false)
3591 f32 faraway = BS*50;
3592 //f32 faraway = m_control.wanted_range * BS;
3595 This has to be done with the mesh_mutex unlocked
3597 // Pretty random but this should work somewhat nicely
3598 if(mesh_expired && (
3599 (mesh_update_count < 3
3600 && (d < faraway || mesh_update_count < 2)
3603 (m_control.range_all && mesh_update_count < 20)
3606 /*if(mesh_expired && mesh_update_count < 6
3607 && (d < faraway || mesh_update_count < 3))*/
3609 mesh_update_count++;
3611 // Mesh has been expired: generate new mesh
3612 //block->updateMesh(daynight_ratio);
3613 m_client->addUpdateMeshTask(block->getPos());
3615 mesh_expired = false;
3620 Draw the faces of the block
3623 JMutexAutoLock lock(block->mesh_mutex);
3625 scene::SMesh *mesh = block->mesh;
3630 blocks_would_have_drawn++;
3631 if(blocks_drawn >= m_control.wanted_max_blocks
3632 && m_control.range_all == false
3633 && d > m_control.wanted_min_range * BS)
3637 sector_blocks_drawn++;
3639 u32 c = mesh->getMeshBufferCount();
3641 for(u32 i=0; i<c; i++)
3643 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3644 const video::SMaterial& material = buf->getMaterial();
3645 video::IMaterialRenderer* rnd =
3646 driver->getMaterialRenderer(material.MaterialType);
3647 bool transparent = (rnd && rnd->isTransparent());
3648 // Render transparent on transparent pass and likewise.
3649 if(transparent == is_transparent_pass)
3652 This *shouldn't* hurt too much because Irrlicht
3653 doesn't change opengl textures if the old
3654 material is set again.
3656 driver->setMaterial(buf->getMaterial());
3657 driver->drawMeshBuffer(buf);
3658 vertex_count += buf->getVertexCount();
3662 } // foreach sectorblocks
3664 if(sector_blocks_drawn != 0)
3666 m_last_drawn_sectors[sp] = true;
3670 m_control.blocks_drawn = blocks_drawn;
3671 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3673 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3674 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3677 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3678 core::map<v3s16, MapBlock*> *affected_blocks)
3680 bool changed = false;
3682 Add it to all blocks touching it
3685 v3s16(0,0,0), // this
3686 v3s16(0,0,1), // back
3687 v3s16(0,1,0), // top
3688 v3s16(1,0,0), // right
3689 v3s16(0,0,-1), // front
3690 v3s16(0,-1,0), // bottom
3691 v3s16(-1,0,0), // left
3693 for(u16 i=0; i<7; i++)
3695 v3s16 p2 = p + dirs[i];
3696 // Block position of neighbor (or requested) node
3697 v3s16 blockpos = getNodeBlockPos(p2);
3698 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3699 if(blockref == NULL)
3701 // Relative position of requested node
3702 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3703 if(blockref->setTempMod(relpos, mod))
3708 if(changed && affected_blocks!=NULL)
3710 for(u16 i=0; i<7; i++)
3712 v3s16 p2 = p + dirs[i];
3713 // Block position of neighbor (or requested) node
3714 v3s16 blockpos = getNodeBlockPos(p2);
3715 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3716 if(blockref == NULL)
3718 affected_blocks->insert(blockpos, blockref);
3724 bool ClientMap::clearTempMod(v3s16 p,
3725 core::map<v3s16, MapBlock*> *affected_blocks)
3727 bool changed = false;
3729 v3s16(0,0,0), // this
3730 v3s16(0,0,1), // back
3731 v3s16(0,1,0), // top
3732 v3s16(1,0,0), // right
3733 v3s16(0,0,-1), // front
3734 v3s16(0,-1,0), // bottom
3735 v3s16(-1,0,0), // left
3737 for(u16 i=0; i<7; i++)
3739 v3s16 p2 = p + dirs[i];
3740 // Block position of neighbor (or requested) node
3741 v3s16 blockpos = getNodeBlockPos(p2);
3742 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3743 if(blockref == NULL)
3745 // Relative position of requested node
3746 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3747 if(blockref->clearTempMod(relpos))
3752 if(changed && affected_blocks!=NULL)
3754 for(u16 i=0; i<7; i++)
3756 v3s16 p2 = p + dirs[i];
3757 // Block position of neighbor (or requested) node
3758 v3s16 blockpos = getNodeBlockPos(p2);
3759 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3760 if(blockref == NULL)
3762 affected_blocks->insert(blockpos, blockref);
3768 void ClientMap::expireMeshes(bool only_daynight_diffed)
3770 TimeTaker timer("expireMeshes()");
3772 core::map<v2s16, MapSector*>::Iterator si;
3773 si = m_sectors.getIterator();
3774 for(; si.atEnd() == false; si++)
3776 MapSector *sector = si.getNode()->getValue();
3778 core::list< MapBlock * > sectorblocks;
3779 sector->getBlocks(sectorblocks);
3781 core::list< MapBlock * >::Iterator i;
3782 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3784 MapBlock *block = *i;
3786 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3792 JMutexAutoLock lock(block->mesh_mutex);
3793 if(block->mesh != NULL)
3795 /*block->mesh->drop();
3796 block->mesh = NULL;*/
3797 block->setMeshExpired(true);
3804 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3806 assert(mapType() == MAPTYPE_CLIENT);
3809 v3s16 p = blockpos + v3s16(0,0,0);
3810 MapBlock *b = getBlockNoCreate(p);
3811 b->updateMesh(daynight_ratio);
3812 //b->setMeshExpired(true);
3814 catch(InvalidPositionException &e){}
3817 v3s16 p = blockpos + v3s16(-1,0,0);
3818 MapBlock *b = getBlockNoCreate(p);
3819 b->updateMesh(daynight_ratio);
3820 //b->setMeshExpired(true);
3822 catch(InvalidPositionException &e){}
3824 v3s16 p = blockpos + v3s16(0,-1,0);
3825 MapBlock *b = getBlockNoCreate(p);
3826 b->updateMesh(daynight_ratio);
3827 //b->setMeshExpired(true);
3829 catch(InvalidPositionException &e){}
3831 v3s16 p = blockpos + v3s16(0,0,-1);
3832 MapBlock *b = getBlockNoCreate(p);
3833 b->updateMesh(daynight_ratio);
3834 //b->setMeshExpired(true);
3836 catch(InvalidPositionException &e){}
3841 Update mesh of block in which the node is, and if the node is at the
3842 leading edge, update the appropriate leading blocks too.
3844 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3852 v3s16 blockposes[4];
3853 for(u32 i=0; i<4; i++)
3855 v3s16 np = nodepos + dirs[i];
3856 blockposes[i] = getNodeBlockPos(np);
3857 // Don't update mesh of block if it has been done already
3858 bool already_updated = false;
3859 for(u32 j=0; j<i; j++)
3861 if(blockposes[j] == blockposes[i])
3863 already_updated = true;
3870 MapBlock *b = getBlockNoCreate(blockposes[i]);
3871 b->updateMesh(daynight_ratio);
3876 void ClientMap::PrintInfo(std::ostream &out)
3887 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3892 MapVoxelManipulator::~MapVoxelManipulator()
3894 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3898 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3900 TimeTaker timer1("emerge", &emerge_time);
3902 // Units of these are MapBlocks
3903 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3904 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3906 VoxelArea block_area_nodes
3907 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3909 addArea(block_area_nodes);
3911 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3912 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3913 for(s32 x=p_min.X; x<=p_max.X; x++)
3916 core::map<v3s16, bool>::Node *n;
3917 n = m_loaded_blocks.find(p);
3921 bool block_data_inexistent = false;
3924 TimeTaker timer1("emerge load", &emerge_load_time);
3926 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3927 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3930 dstream<<std::endl;*/
3932 MapBlock *block = m_map->getBlockNoCreate(p);
3933 if(block->isDummy())
3934 block_data_inexistent = true;
3936 block->copyTo(*this);
3938 catch(InvalidPositionException &e)
3940 block_data_inexistent = true;
3943 if(block_data_inexistent)
3945 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3946 // Fill with VOXELFLAG_INEXISTENT
3947 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3948 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3950 s32 i = m_area.index(a.MinEdge.X,y,z);
3951 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3955 m_loaded_blocks.insert(p, !block_data_inexistent);
3958 //dstream<<"emerge done"<<std::endl;
3962 SUGG: Add an option to only update eg. water and air nodes.
3963 This will make it interfere less with important stuff if
3966 void MapVoxelManipulator::blitBack
3967 (core::map<v3s16, MapBlock*> & modified_blocks)
3969 if(m_area.getExtent() == v3s16(0,0,0))
3972 //TimeTaker timer1("blitBack");
3974 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3975 <<m_loaded_blocks.size()<<std::endl;*/
3978 Initialize block cache
3980 v3s16 blockpos_last;
3981 MapBlock *block = NULL;
3982 bool block_checked_in_modified = false;
3984 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3985 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3986 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3990 u8 f = m_flags[m_area.index(p)];
3991 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3994 MapNode &n = m_data[m_area.index(p)];
3996 v3s16 blockpos = getNodeBlockPos(p);
4001 if(block == NULL || blockpos != blockpos_last){
4002 block = m_map->getBlockNoCreate(blockpos);
4003 blockpos_last = blockpos;
4004 block_checked_in_modified = false;
4007 // Calculate relative position in block
4008 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
4010 // Don't continue if nothing has changed here
4011 if(block->getNode(relpos) == n)
4014 //m_map->setNode(m_area.MinEdge + p, n);
4015 block->setNode(relpos, n);
4018 Make sure block is in modified_blocks
4020 if(block_checked_in_modified == false)
4022 modified_blocks[blockpos] = block;
4023 block_checked_in_modified = true;
4026 catch(InvalidPositionException &e)
4032 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
4033 MapVoxelManipulator(map),
4034 m_create_area(false)
4038 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
4042 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
4044 // Just create the area so that it can be pointed to
4045 VoxelManipulator::emerge(a, caller_id);
4048 void ManualMapVoxelManipulator::initialEmerge(
4049 v3s16 blockpos_min, v3s16 blockpos_max)
4051 TimeTaker timer1("initialEmerge", &emerge_time);
4053 // Units of these are MapBlocks
4054 v3s16 p_min = blockpos_min;
4055 v3s16 p_max = blockpos_max;
4057 VoxelArea block_area_nodes
4058 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4060 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
4063 dstream<<"initialEmerge: area: ";
4064 block_area_nodes.print(dstream);
4065 dstream<<" ("<<size_MB<<"MB)";
4069 addArea(block_area_nodes);
4071 for(s32 z=p_min.Z; z<=p_max.Z; z++)
4072 for(s32 y=p_min.Y; y<=p_max.Y; y++)
4073 for(s32 x=p_min.X; x<=p_max.X; x++)
4076 core::map<v3s16, bool>::Node *n;
4077 n = m_loaded_blocks.find(p);
4081 bool block_data_inexistent = false;
4084 TimeTaker timer1("emerge load", &emerge_load_time);
4086 MapBlock *block = m_map->getBlockNoCreate(p);
4087 if(block->isDummy())
4088 block_data_inexistent = true;
4090 block->copyTo(*this);
4092 catch(InvalidPositionException &e)
4094 block_data_inexistent = true;
4097 if(block_data_inexistent)
4100 Mark area inexistent
4102 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4103 // Fill with VOXELFLAG_INEXISTENT
4104 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4105 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4107 s32 i = m_area.index(a.MinEdge.X,y,z);
4108 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4112 m_loaded_blocks.insert(p, !block_data_inexistent);
4116 void ManualMapVoxelManipulator::blitBackAll(
4117 core::map<v3s16, MapBlock*> * modified_blocks)
4119 if(m_area.getExtent() == v3s16(0,0,0))
4123 Copy data of all blocks
4125 for(core::map<v3s16, bool>::Iterator
4126 i = m_loaded_blocks.getIterator();
4127 i.atEnd() == false; i++)
4129 v3s16 p = i.getNode()->getKey();
4130 bool existed = i.getNode()->getValue();
4131 if(existed == false)
4133 // The Great Bug was found using this
4134 /*dstream<<"ManualMapVoxelManipulator::blitBackAll: "
4135 <<"Inexistent ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4139 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4142 dstream<<"WARNING: "<<__FUNCTION_NAME
4143 <<": got NULL block "
4144 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4149 block->copyFrom(*this);
4152 modified_blocks->insert(p, block);