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);
2030 // 1) get from memory, 2) load from disk
2031 MapBlock *block = emergeBlock(blockpos, false);
2032 // 3) create a blank one
2034 block = createBlock(blockpos);
2036 // Lighting will not be valid after make_chunk is called
2037 block->setLightingExpired(true);
2038 // Lighting will be calculated
2039 //block->setLightingExpired(false);
2042 Block gets sunlight if this is true.
2044 This should be set to true when the top side of a block
2045 is completely exposed to the sky.
2047 block->setIsUnderground(false);
2053 Now we have a big empty area.
2055 Make a ManualMapVoxelManipulator that contains this and the
2059 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2060 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2062 data->vmanip = new ManualMapVoxelManipulator(this);
2063 //data->vmanip->setMap(this);
2067 //TimeTaker timer("initBlockMake() initialEmerge");
2068 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2071 // Data is ready now.
2074 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2075 core::map<v3s16, MapBlock*> &changed_blocks)
2077 v3s16 blockpos = data->blockpos;
2078 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2079 <<blockpos.Z<<")"<<std::endl;*/
2083 dstream<<"finishBlockMake(): no-op"<<std::endl;
2087 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2089 /*dstream<<"Resulting vmanip:"<<std::endl;
2090 data->vmanip.print(dstream);*/
2093 Blit generated stuff to map
2094 NOTE: blitBackAll adds nearly everything to changed_blocks
2098 //TimeTaker timer("finishBlockMake() blitBackAll");
2099 data->vmanip->blitBackAll(&changed_blocks);
2102 if(enable_mapgen_debug_info)
2103 dstream<<"finishBlockMake: changed_blocks.size()="
2104 <<changed_blocks.size()<<std::endl;
2107 Copy transforming liquid information
2109 while(data->transforming_liquid.size() > 0)
2111 v3s16 p = data->transforming_liquid.pop_front();
2112 m_transforming_liquid.push_back(p);
2118 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2122 Set is_underground flag for lighting with sunlight
2125 block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2128 Add sunlight to central block.
2129 This makes in-dark-spawning monsters to not flood the whole thing.
2130 Do not spread the light, though.
2132 /*core::map<v3s16, bool> light_sources;
2133 bool black_air_left = false;
2134 block->propagateSunlight(light_sources, true, &black_air_left);*/
2137 NOTE: Lighting and object adding shouldn't really be here, but
2138 lighting is a bit tricky to move properly to makeBlock.
2139 TODO: Do this the right way anyway, that is, move it to makeBlock.
2140 - There needs to be some way for makeBlock to report back if
2141 the lighting update is going further down because of the
2142 new block blocking light
2147 NOTE: This takes ~60ms, TODO: Investigate why
2150 TimeTaker t("finishBlockMake lighting update");
2152 core::map<v3s16, MapBlock*> lighting_update_blocks;
2155 lighting_update_blocks.insert(block->getPos(), block);
2158 // All modified blocks
2159 // NOTE: Should this be done? If this is not done, then the lighting
2160 // of the others will be updated in a different place, one by one, i
2161 // think... or they might not? Well, at least they are left marked as
2162 // "lighting expired"; it seems that is not handled at all anywhere,
2163 // so enabling this will slow it down A LOT because otherwise it
2164 // would not do this at all. This causes the black trees.
2165 for(core::map<v3s16, MapBlock*>::Iterator
2166 i = changed_blocks.getIterator();
2167 i.atEnd() == false; i++)
2169 lighting_update_blocks.insert(i.getNode()->getKey(),
2170 i.getNode()->getValue());
2173 updateLighting(lighting_update_blocks, changed_blocks);
2175 if(enable_mapgen_debug_info == false)
2176 t.stop(true); // Hide output
2180 Add random objects to block
2182 mapgen::add_random_objects(block);
2185 Go through changed blocks
2187 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2188 i.atEnd() == false; i++)
2190 MapBlock *block = i.getNode()->getValue();
2193 Update day/night difference cache of the MapBlocks
2195 block->updateDayNightDiff();
2197 Set block as modified
2199 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2203 Set central block as generated
2205 block->setGenerated(true);
2208 Save changed parts of map
2209 NOTE: Will be saved later.
2213 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2214 <<blockpos.Z<<")"<<std::endl;*/
2219 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2221 DSTACKF("%s: p2d=(%d,%d)",
2226 Check if it exists already in memory
2228 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2233 Try to load it from disk (with blocks)
2235 //if(loadSectorFull(p2d) == true)
2238 Try to load metadata from disk
2240 if(loadSectorMeta(p2d) == true)
2242 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2245 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2246 throw InvalidPositionException("");
2252 Do not create over-limit
2254 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2255 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2256 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2257 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2258 throw InvalidPositionException("createSector(): pos. over limit");
2261 Generate blank sector
2264 sector = new ServerMapSector(this, p2d);
2266 // Sector position on map in nodes
2267 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2272 m_sectors.insert(p2d, sector);
2278 This is a quick-hand function for calling makeBlock().
2280 MapBlock * ServerMap::generateBlock(
2282 core::map<v3s16, MapBlock*> &modified_blocks
2285 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2287 /*dstream<<"generateBlock(): "
2288 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2291 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2293 TimeTaker timer("generateBlock");
2295 //MapBlock *block = original_dummy;
2297 v2s16 p2d(p.X, p.Z);
2298 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2301 Do not generate over-limit
2303 if(blockpos_over_limit(p))
2305 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2306 throw InvalidPositionException("generateBlock(): pos. over limit");
2310 Create block make data
2312 mapgen::BlockMakeData data;
2313 initBlockMake(&data, p);
2319 TimeTaker t("mapgen::make_block()");
2320 mapgen::make_block(&data);
2322 if(enable_mapgen_debug_info == false)
2323 t.stop(true); // Hide output
2327 Blit data back on map, update lighting, add mobs and whatever this does
2329 finishBlockMake(&data, modified_blocks);
2334 MapBlock *block = getBlockNoCreateNoEx(p);
2341 bool erroneus_content = false;
2342 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2343 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2344 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2347 MapNode n = block->getNode(p);
2348 if(n.d == CONTENT_IGNORE)
2350 dstream<<"CONTENT_IGNORE at "
2351 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2353 erroneus_content = true;
2357 if(erroneus_content)
2365 Generate a completely empty block
2367 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2368 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2370 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2376 n.d = CONTENT_STONE;
2377 block->setNode(v3s16(x0,y0,z0), n);
2382 if(enable_mapgen_debug_info == false)
2383 timer.stop(true); // Hide output
2388 MapBlock * ServerMap::createBlock(v3s16 p)
2390 DSTACKF("%s: p=(%d,%d,%d)",
2391 __FUNCTION_NAME, p.X, p.Y, p.Z);
2394 Do not create over-limit
2396 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2397 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2398 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2399 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2400 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2401 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2402 throw InvalidPositionException("createBlock(): pos. over limit");
2404 v2s16 p2d(p.X, p.Z);
2407 This will create or load a sector if not found in memory.
2408 If block exists on disk, it will be loaded.
2410 NOTE: On old save formats, this will be slow, as it generates
2411 lighting on blocks for them.
2413 ServerMapSector *sector;
2415 sector = (ServerMapSector*)createSector(p2d);
2416 assert(sector->getId() == MAPSECTOR_SERVER);
2418 catch(InvalidPositionException &e)
2420 dstream<<"createBlock: createSector() failed"<<std::endl;
2424 NOTE: This should not be done, or at least the exception
2425 should not be passed on as std::exception, because it
2426 won't be catched at all.
2428 /*catch(std::exception &e)
2430 dstream<<"createBlock: createSector() failed: "
2431 <<e.what()<<std::endl;
2436 Try to get a block from the sector
2439 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2442 if(block->isDummy())
2447 block = sector->createBlankBlock(block_y);
2451 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2453 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2455 p.X, p.Y, p.Z, allow_generate);
2458 MapBlock *block = getBlockNoCreateNoEx(p);
2464 MapBlock *block = loadBlock(p);
2471 core::map<v3s16, MapBlock*> modified_blocks;
2472 MapBlock *block = generateBlock(p, modified_blocks);
2476 event.type = MEET_OTHER;
2479 // Copy modified_blocks to event
2480 for(core::map<v3s16, MapBlock*>::Iterator
2481 i = modified_blocks.getIterator();
2482 i.atEnd()==false; i++)
2484 event.modified_blocks.insert(i.getNode()->getKey(), false);
2488 dispatchEvent(&event);
2499 Do not generate over-limit
2501 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2502 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2503 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2504 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2505 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2506 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2507 throw InvalidPositionException("emergeBlock(): pos. over limit");
2509 v2s16 p2d(p.X, p.Z);
2512 This will create or load a sector if not found in memory.
2513 If block exists on disk, it will be loaded.
2515 ServerMapSector *sector;
2517 sector = createSector(p2d);
2518 //sector = emergeSector(p2d, changed_blocks);
2520 catch(InvalidPositionException &e)
2522 dstream<<"emergeBlock: createSector() failed: "
2523 <<e.what()<<std::endl;
2524 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2526 <<"You could try to delete it."<<std::endl;
2529 catch(VersionMismatchException &e)
2531 dstream<<"emergeBlock: createSector() failed: "
2532 <<e.what()<<std::endl;
2533 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2535 <<"You could try to delete it."<<std::endl;
2540 Try to get a block from the sector
2543 bool does_not_exist = false;
2544 bool lighting_expired = false;
2545 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2547 // If not found, try loading from disk
2550 block = loadBlock(p);
2556 does_not_exist = true;
2558 else if(block->isDummy() == true)
2560 does_not_exist = true;
2562 else if(block->getLightingExpired())
2564 lighting_expired = true;
2569 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2574 If block was not found on disk and not going to generate a
2575 new one, make sure there is a dummy block in place.
2577 if(only_from_disk && (does_not_exist || lighting_expired))
2579 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2583 // Create dummy block
2584 block = new MapBlock(this, p, true);
2586 // Add block to sector
2587 sector->insertBlock(block);
2593 //dstream<<"Not found on disk, generating."<<std::endl;
2595 //TimeTaker("emergeBlock() generate");
2597 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2600 If the block doesn't exist, generate the block.
2604 block = generateBlock(p, block, sector, changed_blocks,
2605 lighting_invalidated_blocks);
2608 if(lighting_expired)
2610 lighting_invalidated_blocks.insert(p, block);
2615 Initially update sunlight
2618 core::map<v3s16, bool> light_sources;
2619 bool black_air_left = false;
2620 bool bottom_invalid =
2621 block->propagateSunlight(light_sources, true,
2624 // If sunlight didn't reach everywhere and part of block is
2625 // above ground, lighting has to be properly updated
2626 //if(black_air_left && some_part_underground)
2629 lighting_invalidated_blocks[block->getPos()] = block;
2634 lighting_invalidated_blocks[block->getPos()] = block;
2643 s16 ServerMap::findGroundLevel(v2s16 p2d)
2647 Uh, just do something random...
2649 // Find existing map from top to down
2652 v3s16 p(p2d.X, max, p2d.Y);
2653 for(; p.Y>min; p.Y--)
2655 MapNode n = getNodeNoEx(p);
2656 if(n.d != CONTENT_IGNORE)
2661 // If this node is not air, go to plan b
2662 if(getNodeNoEx(p).d != CONTENT_AIR)
2664 // Search existing walkable and return it
2665 for(; p.Y>min; p.Y--)
2667 MapNode n = getNodeNoEx(p);
2668 if(content_walkable(n.d) && n.d != CONTENT_IGNORE)
2677 Determine from map generator noise functions
2680 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2683 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2684 //return (s16)level;
2687 void ServerMap::createDirs(std::string path)
2689 if(fs::CreateAllDirs(path) == false)
2691 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2692 <<"\""<<path<<"\""<<std::endl;
2693 throw BaseException("ServerMap failed to create directory");
2697 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2703 snprintf(cc, 9, "%.4x%.4x",
2704 (unsigned int)pos.X&0xffff,
2705 (unsigned int)pos.Y&0xffff);
2707 return m_savedir + "/sectors/" + cc;
2709 snprintf(cc, 9, "%.3x/%.3x",
2710 (unsigned int)pos.X&0xfff,
2711 (unsigned int)pos.Y&0xfff);
2713 return m_savedir + "/sectors2/" + cc;
2719 v2s16 ServerMap::getSectorPos(std::string dirname)
2723 size_t spos = dirname.rfind('/') + 1;
2724 assert(spos != std::string::npos);
2725 if(dirname.size() - spos == 8)
2728 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2730 else if(dirname.size() - spos == 3)
2733 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2734 // Sign-extend the 12 bit values up to 16 bits...
2735 if(x&0x800) x|=0xF000;
2736 if(y&0x800) y|=0xF000;
2743 v2s16 pos((s16)x, (s16)y);
2747 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2749 v2s16 p2d = getSectorPos(sectordir);
2751 if(blockfile.size() != 4){
2752 throw InvalidFilenameException("Invalid block filename");
2755 int r = sscanf(blockfile.c_str(), "%4x", &y);
2757 throw InvalidFilenameException("Invalid block filename");
2758 return v3s16(p2d.X, y, p2d.Y);
2761 std::string ServerMap::getBlockFilename(v3s16 p)
2764 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2768 void ServerMap::save(bool only_changed)
2770 DSTACK(__FUNCTION_NAME);
2771 if(m_map_saving_enabled == false)
2773 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2777 if(only_changed == false)
2778 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2781 if(only_changed == false || m_map_metadata_changed)
2786 u32 sector_meta_count = 0;
2787 u32 block_count = 0;
2788 u32 block_count_all = 0; // Number of blocks in memory
2790 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2791 for(; i.atEnd() == false; i++)
2793 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2794 assert(sector->getId() == MAPSECTOR_SERVER);
2796 if(sector->differs_from_disk || only_changed == false)
2798 saveSectorMeta(sector);
2799 sector_meta_count++;
2801 core::list<MapBlock*> blocks;
2802 sector->getBlocks(blocks);
2803 core::list<MapBlock*>::Iterator j;
2804 for(j=blocks.begin(); j!=blocks.end(); j++)
2806 MapBlock *block = *j;
2810 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2811 || only_changed == false)
2816 /*dstream<<"ServerMap: Written block ("
2817 <<block->getPos().X<<","
2818 <<block->getPos().Y<<","
2819 <<block->getPos().Z<<")"
2826 Only print if something happened or saved whole map
2828 if(only_changed == false || sector_meta_count != 0
2829 || block_count != 0)
2831 dstream<<DTIME<<"ServerMap: Written: "
2832 <<sector_meta_count<<" sector metadata files, "
2833 <<block_count<<" block files"
2834 <<", "<<block_count_all<<" blocks in memory."
2839 void ServerMap::saveMapMeta()
2841 DSTACK(__FUNCTION_NAME);
2843 dstream<<"INFO: ServerMap::saveMapMeta(): "
2847 createDirs(m_savedir);
2849 std::string fullpath = m_savedir + "/map_meta.txt";
2850 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2851 if(os.good() == false)
2853 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2854 <<"could not open"<<fullpath<<std::endl;
2855 throw FileNotGoodException("Cannot open chunk metadata");
2859 params.setU64("seed", m_seed);
2861 params.writeLines(os);
2863 os<<"[end_of_params]\n";
2865 m_map_metadata_changed = false;
2868 void ServerMap::loadMapMeta()
2870 DSTACK(__FUNCTION_NAME);
2872 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2875 std::string fullpath = m_savedir + "/map_meta.txt";
2876 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2877 if(is.good() == false)
2879 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2880 <<"could not open"<<fullpath<<std::endl;
2881 throw FileNotGoodException("Cannot open map metadata");
2889 throw SerializationError
2890 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2892 std::getline(is, line);
2893 std::string trimmedline = trim(line);
2894 if(trimmedline == "[end_of_params]")
2896 params.parseConfigLine(line);
2899 m_seed = params.getU64("seed");
2901 dstream<<"INFO: ServerMap::loadMapMeta(): "
2906 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2908 DSTACK(__FUNCTION_NAME);
2909 // Format used for writing
2910 u8 version = SER_FMT_VER_HIGHEST;
2912 v2s16 pos = sector->getPos();
2913 std::string dir = getSectorDir(pos);
2916 std::string fullpath = dir + "/meta";
2917 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2918 if(o.good() == false)
2919 throw FileNotGoodException("Cannot open sector metafile");
2921 sector->serialize(o, version);
2923 sector->differs_from_disk = false;
2926 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2928 DSTACK(__FUNCTION_NAME);
2930 v2s16 p2d = getSectorPos(sectordir);
2932 ServerMapSector *sector = NULL;
2934 std::string fullpath = sectordir + "/meta";
2935 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2936 if(is.good() == false)
2938 // If the directory exists anyway, it probably is in some old
2939 // format. Just go ahead and create the sector.
2940 if(fs::PathExists(sectordir))
2942 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
2943 <<fullpath<<" doesn't exist but directory does."
2944 <<" Continuing with a sector with no metadata."
2946 sector = new ServerMapSector(this, p2d);
2947 m_sectors.insert(p2d, sector);
2951 throw FileNotGoodException("Cannot open sector metafile");
2956 sector = ServerMapSector::deSerialize
2957 (is, this, p2d, m_sectors);
2959 saveSectorMeta(sector);
2962 sector->differs_from_disk = false;
2967 bool ServerMap::loadSectorMeta(v2s16 p2d)
2969 DSTACK(__FUNCTION_NAME);
2971 MapSector *sector = NULL;
2973 // The directory layout we're going to load from.
2974 // 1 - original sectors/xxxxzzzz/
2975 // 2 - new sectors2/xxx/zzz/
2976 // If we load from anything but the latest structure, we will
2977 // immediately save to the new one, and remove the old.
2979 std::string sectordir1 = getSectorDir(p2d, 1);
2980 std::string sectordir;
2981 if(fs::PathExists(sectordir1))
2983 sectordir = sectordir1;
2988 sectordir = getSectorDir(p2d, 2);
2992 sector = loadSectorMeta(sectordir, loadlayout != 2);
2994 catch(InvalidFilenameException &e)
2998 catch(FileNotGoodException &e)
3002 catch(std::exception &e)
3011 bool ServerMap::loadSectorFull(v2s16 p2d)
3013 DSTACK(__FUNCTION_NAME);
3015 MapSector *sector = NULL;
3017 // The directory layout we're going to load from.
3018 // 1 - original sectors/xxxxzzzz/
3019 // 2 - new sectors2/xxx/zzz/
3020 // If we load from anything but the latest structure, we will
3021 // immediately save to the new one, and remove the old.
3023 std::string sectordir1 = getSectorDir(p2d, 1);
3024 std::string sectordir;
3025 if(fs::PathExists(sectordir1))
3027 sectordir = sectordir1;
3032 sectordir = getSectorDir(p2d, 2);
3036 sector = loadSectorMeta(sectordir, loadlayout != 2);
3038 catch(InvalidFilenameException &e)
3042 catch(FileNotGoodException &e)
3046 catch(std::exception &e)
3054 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3056 std::vector<fs::DirListNode>::iterator i2;
3057 for(i2=list2.begin(); i2!=list2.end(); i2++)
3063 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3065 catch(InvalidFilenameException &e)
3067 // This catches unknown crap in directory
3073 dstream<<"Sector converted to new layout - deleting "<<
3074 sectordir1<<std::endl;
3075 fs::RecursiveDelete(sectordir1);
3082 void ServerMap::saveBlock(MapBlock *block)
3084 DSTACK(__FUNCTION_NAME);
3086 Dummy blocks are not written
3088 if(block->isDummy())
3090 /*v3s16 p = block->getPos();
3091 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3092 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3096 // Format used for writing
3097 u8 version = SER_FMT_VER_HIGHEST;
3099 v3s16 p3d = block->getPos();
3101 v2s16 p2d(p3d.X, p3d.Z);
3102 std::string sectordir = getSectorDir(p2d);
3104 createDirs(sectordir);
3106 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3107 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3108 if(o.good() == false)
3109 throw FileNotGoodException("Cannot open block data");
3112 [0] u8 serialization version
3115 o.write((char*)&version, 1);
3118 block->serialize(o, version);
3120 // Write extra data stored on disk
3121 block->serializeDiskExtra(o, version);
3123 // We just wrote it to the disk so clear modified flag
3124 block->resetModified();
3127 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3129 DSTACK(__FUNCTION_NAME);
3131 std::string fullpath = sectordir+"/"+blockfile;
3134 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3135 if(is.good() == false)
3136 throw FileNotGoodException("Cannot open block file");
3138 v3s16 p3d = getBlockPos(sectordir, blockfile);
3139 v2s16 p2d(p3d.X, p3d.Z);
3141 assert(sector->getPos() == p2d);
3143 u8 version = SER_FMT_VER_INVALID;
3144 is.read((char*)&version, 1);
3147 throw SerializationError("ServerMap::loadBlock(): Failed"
3148 " to read MapBlock version");
3150 /*u32 block_size = MapBlock::serializedLength(version);
3151 SharedBuffer<u8> data(block_size);
3152 is.read((char*)*data, block_size);*/
3154 // This will always return a sector because we're the server
3155 //MapSector *sector = emergeSector(p2d);
3157 MapBlock *block = NULL;
3158 bool created_new = false;
3159 block = sector->getBlockNoCreateNoEx(p3d.Y);
3162 block = sector->createBlankBlockNoInsert(p3d.Y);
3167 block->deSerialize(is, version);
3169 // Read extra data stored on disk
3170 block->deSerializeDiskExtra(is, version);
3172 // If it's a new block, insert it to the map
3174 sector->insertBlock(block);
3177 Save blocks loaded in old format in new format
3180 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3185 // We just loaded it from the disk, so it's up-to-date.
3186 block->resetModified();
3189 catch(SerializationError &e)
3191 dstream<<"WARNING: Invalid block data on disk "
3192 <<"fullpath="<<fullpath
3193 <<" (SerializationError). "
3194 <<"what()="<<e.what()
3196 //" Ignoring. A new one will be generated.
3199 // TODO: Backup file; name is in fullpath.
3203 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3205 DSTACK(__FUNCTION_NAME);
3207 v2s16 p2d(blockpos.X, blockpos.Z);
3209 // The directory layout we're going to load from.
3210 // 1 - original sectors/xxxxzzzz/
3211 // 2 - new sectors2/xxx/zzz/
3212 // If we load from anything but the latest structure, we will
3213 // immediately save to the new one, and remove the old.
3215 std::string sectordir1 = getSectorDir(p2d, 1);
3216 std::string sectordir;
3217 if(fs::PathExists(sectordir1))
3219 sectordir = sectordir1;
3224 sectordir = getSectorDir(p2d, 2);
3228 Make sure sector is loaded
3230 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3234 sector = loadSectorMeta(sectordir, loadlayout != 2);
3236 catch(InvalidFilenameException &e)
3240 catch(FileNotGoodException &e)
3244 catch(std::exception &e)
3251 Make sure file exists
3254 std::string blockfilename = getBlockFilename(blockpos);
3255 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3261 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3262 return getBlockNoCreateNoEx(blockpos);
3265 void ServerMap::PrintInfo(std::ostream &out)
3276 ClientMap::ClientMap(
3278 MapDrawControl &control,
3279 scene::ISceneNode* parent,
3280 scene::ISceneManager* mgr,
3284 scene::ISceneNode(parent, mgr, id),
3287 m_camera_position(0,0,0),
3288 m_camera_direction(0,0,1)
3290 m_camera_mutex.Init();
3291 assert(m_camera_mutex.IsInitialized());
3293 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3294 BS*1000000,BS*1000000,BS*1000000);
3297 ClientMap::~ClientMap()
3299 /*JMutexAutoLock lock(mesh_mutex);
3308 MapSector * ClientMap::emergeSector(v2s16 p2d)
3310 DSTACK(__FUNCTION_NAME);
3311 // Check that it doesn't exist already
3313 return getSectorNoGenerate(p2d);
3315 catch(InvalidPositionException &e)
3320 ClientMapSector *sector = new ClientMapSector(this, p2d);
3323 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3324 m_sectors.insert(p2d, sector);
3331 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3333 DSTACK(__FUNCTION_NAME);
3334 ClientMapSector *sector = NULL;
3336 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3338 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3342 sector = (ClientMapSector*)n->getValue();
3343 assert(sector->getId() == MAPSECTOR_CLIENT);
3347 sector = new ClientMapSector(this, p2d);
3349 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3350 m_sectors.insert(p2d, sector);
3354 sector->deSerialize(is);
3358 void ClientMap::OnRegisterSceneNode()
3362 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3363 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3366 ISceneNode::OnRegisterSceneNode();
3369 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3371 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3372 DSTACK(__FUNCTION_NAME);
3374 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3377 This is called two times per frame, reset on the non-transparent one
3379 if(pass == scene::ESNRP_SOLID)
3381 m_last_drawn_sectors.clear();
3385 Get time for measuring timeout.
3387 Measuring time is very useful for long delays when the
3388 machine is swapping a lot.
3390 int time1 = time(0);
3392 //u32 daynight_ratio = m_client->getDayNightRatio();
3394 m_camera_mutex.Lock();
3395 v3f camera_position = m_camera_position;
3396 v3f camera_direction = m_camera_direction;
3397 m_camera_mutex.Unlock();
3400 Get all blocks and draw all visible ones
3403 v3s16 cam_pos_nodes(
3404 camera_position.X / BS,
3405 camera_position.Y / BS,
3406 camera_position.Z / BS);
3408 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3410 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3411 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3413 // Take a fair amount as we will be dropping more out later
3415 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3416 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3417 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3419 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3420 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3421 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3423 u32 vertex_count = 0;
3425 // For limiting number of mesh updates per frame
3426 u32 mesh_update_count = 0;
3428 u32 blocks_would_have_drawn = 0;
3429 u32 blocks_drawn = 0;
3431 int timecheck_counter = 0;
3432 core::map<v2s16, MapSector*>::Iterator si;
3433 si = m_sectors.getIterator();
3434 for(; si.atEnd() == false; si++)
3437 timecheck_counter++;
3438 if(timecheck_counter > 50)
3440 timecheck_counter = 0;
3441 int time2 = time(0);
3442 if(time2 > time1 + 4)
3444 dstream<<"ClientMap::renderMap(): "
3445 "Rendering takes ages, returning."
3452 MapSector *sector = si.getNode()->getValue();
3453 v2s16 sp = sector->getPos();
3455 if(m_control.range_all == false)
3457 if(sp.X < p_blocks_min.X
3458 || sp.X > p_blocks_max.X
3459 || sp.Y < p_blocks_min.Z
3460 || sp.Y > p_blocks_max.Z)
3464 core::list< MapBlock * > sectorblocks;
3465 sector->getBlocks(sectorblocks);
3471 u32 sector_blocks_drawn = 0;
3473 core::list< MapBlock * >::Iterator i;
3474 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3476 MapBlock *block = *i;
3479 Compare block position to camera position, skip
3480 if not seen on display
3483 float range = 100000 * BS;
3484 if(m_control.range_all == false)
3485 range = m_control.wanted_range * BS;
3488 if(isBlockInSight(block->getPos(), camera_position,
3489 camera_direction, range, &d) == false)
3494 // Okay, this block will be drawn. Reset usage timer.
3495 block->resetUsageTimer();
3497 // This is ugly (spherical distance limit?)
3498 /*if(m_control.range_all == false &&
3499 d - 0.5*BS*MAP_BLOCKSIZE > range)
3504 Update expired mesh (used for day/night change)
3506 It doesn't work exactly like it should now with the
3507 tasked mesh update but whatever.
3510 bool mesh_expired = false;
3513 JMutexAutoLock lock(block->mesh_mutex);
3515 mesh_expired = block->getMeshExpired();
3517 // Mesh has not been expired and there is no mesh:
3518 // block has no content
3519 if(block->mesh == NULL && mesh_expired == false)
3523 f32 faraway = BS*50;
3524 //f32 faraway = m_control.wanted_range * BS;
3527 This has to be done with the mesh_mutex unlocked
3529 // Pretty random but this should work somewhat nicely
3530 if(mesh_expired && (
3531 (mesh_update_count < 3
3532 && (d < faraway || mesh_update_count < 2)
3535 (m_control.range_all && mesh_update_count < 20)
3538 /*if(mesh_expired && mesh_update_count < 6
3539 && (d < faraway || mesh_update_count < 3))*/
3541 mesh_update_count++;
3543 // Mesh has been expired: generate new mesh
3544 //block->updateMesh(daynight_ratio);
3545 m_client->addUpdateMeshTask(block->getPos());
3547 mesh_expired = false;
3552 Draw the faces of the block
3555 JMutexAutoLock lock(block->mesh_mutex);
3557 scene::SMesh *mesh = block->mesh;
3562 blocks_would_have_drawn++;
3563 if(blocks_drawn >= m_control.wanted_max_blocks
3564 && m_control.range_all == false
3565 && d > m_control.wanted_min_range * BS)
3569 sector_blocks_drawn++;
3571 u32 c = mesh->getMeshBufferCount();
3573 for(u32 i=0; i<c; i++)
3575 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3576 const video::SMaterial& material = buf->getMaterial();
3577 video::IMaterialRenderer* rnd =
3578 driver->getMaterialRenderer(material.MaterialType);
3579 bool transparent = (rnd && rnd->isTransparent());
3580 // Render transparent on transparent pass and likewise.
3581 if(transparent == is_transparent_pass)
3584 This *shouldn't* hurt too much because Irrlicht
3585 doesn't change opengl textures if the old
3586 material is set again.
3588 driver->setMaterial(buf->getMaterial());
3589 driver->drawMeshBuffer(buf);
3590 vertex_count += buf->getVertexCount();
3594 } // foreach sectorblocks
3596 if(sector_blocks_drawn != 0)
3598 m_last_drawn_sectors[sp] = true;
3602 m_control.blocks_drawn = blocks_drawn;
3603 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3605 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3606 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3609 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3610 core::map<v3s16, MapBlock*> *affected_blocks)
3612 bool changed = false;
3614 Add it to all blocks touching it
3617 v3s16(0,0,0), // this
3618 v3s16(0,0,1), // back
3619 v3s16(0,1,0), // top
3620 v3s16(1,0,0), // right
3621 v3s16(0,0,-1), // front
3622 v3s16(0,-1,0), // bottom
3623 v3s16(-1,0,0), // left
3625 for(u16 i=0; i<7; i++)
3627 v3s16 p2 = p + dirs[i];
3628 // Block position of neighbor (or requested) node
3629 v3s16 blockpos = getNodeBlockPos(p2);
3630 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3631 if(blockref == NULL)
3633 // Relative position of requested node
3634 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3635 if(blockref->setTempMod(relpos, mod))
3640 if(changed && affected_blocks!=NULL)
3642 for(u16 i=0; i<7; i++)
3644 v3s16 p2 = p + dirs[i];
3645 // Block position of neighbor (or requested) node
3646 v3s16 blockpos = getNodeBlockPos(p2);
3647 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3648 if(blockref == NULL)
3650 affected_blocks->insert(blockpos, blockref);
3656 bool ClientMap::clearTempMod(v3s16 p,
3657 core::map<v3s16, MapBlock*> *affected_blocks)
3659 bool changed = false;
3661 v3s16(0,0,0), // this
3662 v3s16(0,0,1), // back
3663 v3s16(0,1,0), // top
3664 v3s16(1,0,0), // right
3665 v3s16(0,0,-1), // front
3666 v3s16(0,-1,0), // bottom
3667 v3s16(-1,0,0), // left
3669 for(u16 i=0; i<7; i++)
3671 v3s16 p2 = p + dirs[i];
3672 // Block position of neighbor (or requested) node
3673 v3s16 blockpos = getNodeBlockPos(p2);
3674 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3675 if(blockref == NULL)
3677 // Relative position of requested node
3678 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3679 if(blockref->clearTempMod(relpos))
3684 if(changed && affected_blocks!=NULL)
3686 for(u16 i=0; i<7; i++)
3688 v3s16 p2 = p + dirs[i];
3689 // Block position of neighbor (or requested) node
3690 v3s16 blockpos = getNodeBlockPos(p2);
3691 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3692 if(blockref == NULL)
3694 affected_blocks->insert(blockpos, blockref);
3700 void ClientMap::expireMeshes(bool only_daynight_diffed)
3702 TimeTaker timer("expireMeshes()");
3704 core::map<v2s16, MapSector*>::Iterator si;
3705 si = m_sectors.getIterator();
3706 for(; si.atEnd() == false; si++)
3708 MapSector *sector = si.getNode()->getValue();
3710 core::list< MapBlock * > sectorblocks;
3711 sector->getBlocks(sectorblocks);
3713 core::list< MapBlock * >::Iterator i;
3714 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3716 MapBlock *block = *i;
3718 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3724 JMutexAutoLock lock(block->mesh_mutex);
3725 if(block->mesh != NULL)
3727 /*block->mesh->drop();
3728 block->mesh = NULL;*/
3729 block->setMeshExpired(true);
3736 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3738 assert(mapType() == MAPTYPE_CLIENT);
3741 v3s16 p = blockpos + v3s16(0,0,0);
3742 MapBlock *b = getBlockNoCreate(p);
3743 b->updateMesh(daynight_ratio);
3744 //b->setMeshExpired(true);
3746 catch(InvalidPositionException &e){}
3749 v3s16 p = blockpos + v3s16(-1,0,0);
3750 MapBlock *b = getBlockNoCreate(p);
3751 b->updateMesh(daynight_ratio);
3752 //b->setMeshExpired(true);
3754 catch(InvalidPositionException &e){}
3756 v3s16 p = blockpos + v3s16(0,-1,0);
3757 MapBlock *b = getBlockNoCreate(p);
3758 b->updateMesh(daynight_ratio);
3759 //b->setMeshExpired(true);
3761 catch(InvalidPositionException &e){}
3763 v3s16 p = blockpos + v3s16(0,0,-1);
3764 MapBlock *b = getBlockNoCreate(p);
3765 b->updateMesh(daynight_ratio);
3766 //b->setMeshExpired(true);
3768 catch(InvalidPositionException &e){}
3773 Update mesh of block in which the node is, and if the node is at the
3774 leading edge, update the appropriate leading blocks too.
3776 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3784 v3s16 blockposes[4];
3785 for(u32 i=0; i<4; i++)
3787 v3s16 np = nodepos + dirs[i];
3788 blockposes[i] = getNodeBlockPos(np);
3789 // Don't update mesh of block if it has been done already
3790 bool already_updated = false;
3791 for(u32 j=0; j<i; j++)
3793 if(blockposes[j] == blockposes[i])
3795 already_updated = true;
3802 MapBlock *b = getBlockNoCreate(blockposes[i]);
3803 b->updateMesh(daynight_ratio);
3808 void ClientMap::PrintInfo(std::ostream &out)
3819 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3824 MapVoxelManipulator::~MapVoxelManipulator()
3826 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3830 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3832 TimeTaker timer1("emerge", &emerge_time);
3834 // Units of these are MapBlocks
3835 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3836 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3838 VoxelArea block_area_nodes
3839 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3841 addArea(block_area_nodes);
3843 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3844 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3845 for(s32 x=p_min.X; x<=p_max.X; x++)
3848 core::map<v3s16, bool>::Node *n;
3849 n = m_loaded_blocks.find(p);
3853 bool block_data_inexistent = false;
3856 TimeTaker timer1("emerge load", &emerge_load_time);
3858 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3859 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3862 dstream<<std::endl;*/
3864 MapBlock *block = m_map->getBlockNoCreate(p);
3865 if(block->isDummy())
3866 block_data_inexistent = true;
3868 block->copyTo(*this);
3870 catch(InvalidPositionException &e)
3872 block_data_inexistent = true;
3875 if(block_data_inexistent)
3877 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3878 // Fill with VOXELFLAG_INEXISTENT
3879 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3880 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3882 s32 i = m_area.index(a.MinEdge.X,y,z);
3883 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3887 m_loaded_blocks.insert(p, !block_data_inexistent);
3890 //dstream<<"emerge done"<<std::endl;
3894 SUGG: Add an option to only update eg. water and air nodes.
3895 This will make it interfere less with important stuff if
3898 void MapVoxelManipulator::blitBack
3899 (core::map<v3s16, MapBlock*> & modified_blocks)
3901 if(m_area.getExtent() == v3s16(0,0,0))
3904 //TimeTaker timer1("blitBack");
3906 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3907 <<m_loaded_blocks.size()<<std::endl;*/
3910 Initialize block cache
3912 v3s16 blockpos_last;
3913 MapBlock *block = NULL;
3914 bool block_checked_in_modified = false;
3916 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3917 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3918 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3922 u8 f = m_flags[m_area.index(p)];
3923 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3926 MapNode &n = m_data[m_area.index(p)];
3928 v3s16 blockpos = getNodeBlockPos(p);
3933 if(block == NULL || blockpos != blockpos_last){
3934 block = m_map->getBlockNoCreate(blockpos);
3935 blockpos_last = blockpos;
3936 block_checked_in_modified = false;
3939 // Calculate relative position in block
3940 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
3942 // Don't continue if nothing has changed here
3943 if(block->getNode(relpos) == n)
3946 //m_map->setNode(m_area.MinEdge + p, n);
3947 block->setNode(relpos, n);
3950 Make sure block is in modified_blocks
3952 if(block_checked_in_modified == false)
3954 modified_blocks[blockpos] = block;
3955 block_checked_in_modified = true;
3958 catch(InvalidPositionException &e)
3964 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
3965 MapVoxelManipulator(map),
3966 m_create_area(false)
3970 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
3974 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3976 // Just create the area so that it can be pointed to
3977 VoxelManipulator::emerge(a, caller_id);
3980 void ManualMapVoxelManipulator::initialEmerge(
3981 v3s16 blockpos_min, v3s16 blockpos_max)
3983 TimeTaker timer1("initialEmerge", &emerge_time);
3985 // Units of these are MapBlocks
3986 v3s16 p_min = blockpos_min;
3987 v3s16 p_max = blockpos_max;
3989 VoxelArea block_area_nodes
3990 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3992 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
3995 dstream<<"initialEmerge: area: ";
3996 block_area_nodes.print(dstream);
3997 dstream<<" ("<<size_MB<<"MB)";
4001 addArea(block_area_nodes);
4003 for(s32 z=p_min.Z; z<=p_max.Z; z++)
4004 for(s32 y=p_min.Y; y<=p_max.Y; y++)
4005 for(s32 x=p_min.X; x<=p_max.X; x++)
4008 core::map<v3s16, bool>::Node *n;
4009 n = m_loaded_blocks.find(p);
4013 bool block_data_inexistent = false;
4016 TimeTaker timer1("emerge load", &emerge_load_time);
4018 MapBlock *block = m_map->getBlockNoCreate(p);
4019 if(block->isDummy())
4020 block_data_inexistent = true;
4022 block->copyTo(*this);
4024 catch(InvalidPositionException &e)
4026 block_data_inexistent = true;
4029 if(block_data_inexistent)
4032 Mark area inexistent
4034 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4035 // Fill with VOXELFLAG_INEXISTENT
4036 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4037 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4039 s32 i = m_area.index(a.MinEdge.X,y,z);
4040 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4044 m_loaded_blocks.insert(p, !block_data_inexistent);
4048 void ManualMapVoxelManipulator::blitBackAll(
4049 core::map<v3s16, MapBlock*> * modified_blocks)
4051 if(m_area.getExtent() == v3s16(0,0,0))
4055 Copy data of all blocks
4057 for(core::map<v3s16, bool>::Iterator
4058 i = m_loaded_blocks.getIterator();
4059 i.atEnd() == false; i++)
4061 bool existed = i.getNode()->getValue();
4062 if(existed == false)
4064 v3s16 p = i.getNode()->getKey();
4065 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4068 dstream<<"WARNING: "<<__FUNCTION_NAME
4069 <<": got NULL block "
4070 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4075 block->copyFrom(*this);
4078 modified_blocks->insert(p, block);