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))
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 to transform queue.
1246 v3s16(0,0,1), // back
1247 v3s16(0,1,0), // top
1248 v3s16(1,0,0), // right
1249 v3s16(0,0,-1), // front
1250 v3s16(0,-1,0), // bottom
1251 v3s16(-1,0,0), // left
1253 for(u16 i=0; i<6; i++)
1258 v3s16 p2 = p + dirs[i];
1260 MapNode n2 = getNode(p2);
1261 if(content_liquid(n2.d))
1263 m_transforming_liquid.push_back(p2);
1266 }catch(InvalidPositionException &e)
1272 bool Map::addNodeWithEvent(v3s16 p, MapNode n)
1275 event.type = MEET_ADDNODE;
1279 bool succeeded = true;
1281 core::map<v3s16, MapBlock*> modified_blocks;
1282 addNodeAndUpdate(p, n, modified_blocks);
1284 // Copy modified_blocks to event
1285 for(core::map<v3s16, MapBlock*>::Iterator
1286 i = modified_blocks.getIterator();
1287 i.atEnd()==false; i++)
1289 event.modified_blocks.insert(i.getNode()->getKey(), false);
1292 catch(InvalidPositionException &e){
1296 dispatchEvent(&event);
1301 bool Map::removeNodeWithEvent(v3s16 p)
1304 event.type = MEET_REMOVENODE;
1307 bool succeeded = true;
1309 core::map<v3s16, MapBlock*> modified_blocks;
1310 removeNodeAndUpdate(p, modified_blocks);
1312 // Copy modified_blocks to event
1313 for(core::map<v3s16, MapBlock*>::Iterator
1314 i = modified_blocks.getIterator();
1315 i.atEnd()==false; i++)
1317 event.modified_blocks.insert(i.getNode()->getKey(), false);
1320 catch(InvalidPositionException &e){
1324 dispatchEvent(&event);
1329 bool Map::dayNightDiffed(v3s16 blockpos)
1332 v3s16 p = blockpos + v3s16(0,0,0);
1333 MapBlock *b = getBlockNoCreate(p);
1334 if(b->dayNightDiffed())
1337 catch(InvalidPositionException &e){}
1340 v3s16 p = blockpos + v3s16(-1,0,0);
1341 MapBlock *b = getBlockNoCreate(p);
1342 if(b->dayNightDiffed())
1345 catch(InvalidPositionException &e){}
1347 v3s16 p = blockpos + v3s16(0,-1,0);
1348 MapBlock *b = getBlockNoCreate(p);
1349 if(b->dayNightDiffed())
1352 catch(InvalidPositionException &e){}
1354 v3s16 p = blockpos + v3s16(0,0,-1);
1355 MapBlock *b = getBlockNoCreate(p);
1356 if(b->dayNightDiffed())
1359 catch(InvalidPositionException &e){}
1362 v3s16 p = blockpos + v3s16(1,0,0);
1363 MapBlock *b = getBlockNoCreate(p);
1364 if(b->dayNightDiffed())
1367 catch(InvalidPositionException &e){}
1369 v3s16 p = blockpos + v3s16(0,1,0);
1370 MapBlock *b = getBlockNoCreate(p);
1371 if(b->dayNightDiffed())
1374 catch(InvalidPositionException &e){}
1376 v3s16 p = blockpos + v3s16(0,0,1);
1377 MapBlock *b = getBlockNoCreate(p);
1378 if(b->dayNightDiffed())
1381 catch(InvalidPositionException &e){}
1387 Updates usage timers
1389 void Map::timerUpdate(float dtime, float unload_timeout,
1390 core::list<v3s16> *unloaded_blocks)
1392 bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
1394 core::list<v2s16> sector_deletion_queue;
1395 u32 deleted_blocks_count = 0;
1396 u32 saved_blocks_count = 0;
1398 core::map<v2s16, MapSector*>::Iterator si;
1400 si = m_sectors.getIterator();
1401 for(; si.atEnd() == false; si++)
1403 MapSector *sector = si.getNode()->getValue();
1405 bool all_blocks_deleted = true;
1407 core::list<MapBlock*> blocks;
1408 sector->getBlocks(blocks);
1409 for(core::list<MapBlock*>::Iterator i = blocks.begin();
1410 i != blocks.end(); i++)
1412 MapBlock *block = (*i);
1414 block->incrementUsageTimer(dtime);
1416 if(block->getUsageTimer() > unload_timeout)
1418 v3s16 p = block->getPos();
1421 if(block->getModified() != MOD_STATE_CLEAN
1422 && save_before_unloading)
1425 saved_blocks_count++;
1428 // Delete from memory
1429 sector->deleteBlock(block);
1432 unloaded_blocks->push_back(p);
1434 deleted_blocks_count++;
1438 all_blocks_deleted = false;
1442 if(all_blocks_deleted)
1444 sector_deletion_queue.push_back(si.getNode()->getKey());
1448 // Finally delete the empty sectors
1449 deleteSectors(sector_deletion_queue);
1451 if(deleted_blocks_count != 0)
1453 PrintInfo(dstream); // ServerMap/ClientMap:
1454 dstream<<"Unloaded "<<deleted_blocks_count
1455 <<" blocks from memory";
1456 if(save_before_unloading)
1457 dstream<<", of which "<<saved_blocks_count<<" were written";
1458 dstream<<"."<<std::endl;
1462 void Map::deleteSectors(core::list<v2s16> &list)
1464 core::list<v2s16>::Iterator j;
1465 for(j=list.begin(); j!=list.end(); j++)
1467 MapSector *sector = m_sectors[*j];
1468 // If sector is in sector cache, remove it from there
1469 if(m_sector_cache == sector)
1470 m_sector_cache = NULL;
1471 // Remove from map and delete
1472 m_sectors.remove(*j);
1478 void Map::unloadUnusedData(float timeout,
1479 core::list<v3s16> *deleted_blocks)
1481 core::list<v2s16> sector_deletion_queue;
1482 u32 deleted_blocks_count = 0;
1483 u32 saved_blocks_count = 0;
1485 core::map<v2s16, MapSector*>::Iterator si = m_sectors.getIterator();
1486 for(; si.atEnd() == false; si++)
1488 MapSector *sector = si.getNode()->getValue();
1490 bool all_blocks_deleted = true;
1492 core::list<MapBlock*> blocks;
1493 sector->getBlocks(blocks);
1494 for(core::list<MapBlock*>::Iterator i = blocks.begin();
1495 i != blocks.end(); i++)
1497 MapBlock *block = (*i);
1499 if(block->getUsageTimer() > timeout)
1502 if(block->getModified() != MOD_STATE_CLEAN)
1505 saved_blocks_count++;
1507 // Delete from memory
1508 sector->deleteBlock(block);
1509 deleted_blocks_count++;
1513 all_blocks_deleted = false;
1517 if(all_blocks_deleted)
1519 sector_deletion_queue.push_back(si.getNode()->getKey());
1523 deleteSectors(sector_deletion_queue);
1525 dstream<<"Map: Unloaded "<<deleted_blocks_count<<" blocks from memory"
1526 <<", of which "<<saved_blocks_count<<" were wr."
1529 //return sector_deletion_queue.getSize();
1530 //return deleted_blocks_count;
1534 void Map::PrintInfo(std::ostream &out)
1539 #define WATER_DROP_BOOST 4
1541 void Map::transformLiquids(core::map<v3s16, MapBlock*> & modified_blocks)
1543 DSTACK(__FUNCTION_NAME);
1544 //TimeTaker timer("transformLiquids()");
1547 u32 initial_size = m_transforming_liquid.size();
1549 /*if(initial_size != 0)
1550 dstream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
1552 while(m_transforming_liquid.size() != 0)
1555 Get a queued transforming liquid node
1557 v3s16 p0 = m_transforming_liquid.pop_front();
1559 MapNode n0 = getNodeNoEx(p0);
1561 // Don't deal with non-liquids
1562 if(content_liquid(n0.d) == false)
1565 bool is_source = !content_flowing_liquid(n0.d);
1567 u8 liquid_level = 8;
1568 if(is_source == false)
1569 liquid_level = n0.param2 & 0x0f;
1571 // Turn possible source into non-source
1572 u8 nonsource_c = make_liquid_flowing(n0.d);
1575 If not source, check that some node flows into this one
1576 and what is the level of liquid in this one
1578 if(is_source == false)
1580 s8 new_liquid_level_max = -1;
1582 v3s16 dirs_from[5] = {
1583 v3s16(0,1,0), // top
1584 v3s16(0,0,1), // back
1585 v3s16(1,0,0), // right
1586 v3s16(0,0,-1), // front
1587 v3s16(-1,0,0), // left
1589 for(u16 i=0; i<5; i++)
1591 bool from_top = (i==0);
1593 v3s16 p2 = p0 + dirs_from[i];
1594 MapNode n2 = getNodeNoEx(p2);
1596 if(content_liquid(n2.d))
1598 u8 n2_nonsource_c = make_liquid_flowing(n2.d);
1599 // Check that the liquids are the same type
1600 if(n2_nonsource_c != nonsource_c)
1602 dstream<<"WARNING: Not handling: different liquids"
1603 " collide"<<std::endl;
1606 bool n2_is_source = !content_flowing_liquid(n2.d);
1607 s8 n2_liquid_level = 8;
1608 if(n2_is_source == false)
1609 n2_liquid_level = n2.param2 & 0x07;
1611 s8 new_liquid_level = -1;
1614 //new_liquid_level = 7;
1615 if(n2_liquid_level >= 7 - WATER_DROP_BOOST)
1616 new_liquid_level = 7;
1618 new_liquid_level = n2_liquid_level + WATER_DROP_BOOST;
1620 else if(n2_liquid_level > 0)
1622 new_liquid_level = n2_liquid_level - 1;
1625 if(new_liquid_level > new_liquid_level_max)
1626 new_liquid_level_max = new_liquid_level;
1631 If liquid level should be something else, update it and
1632 add all the neighboring water nodes to the transform queue.
1634 if(new_liquid_level_max != liquid_level)
1636 if(new_liquid_level_max == -1)
1638 // Remove water alltoghether
1645 n0.param2 = new_liquid_level_max;
1649 // Block has been modified
1651 v3s16 blockpos = getNodeBlockPos(p0);
1652 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1654 modified_blocks.insert(blockpos, block);
1658 Add neighboring non-source liquid nodes to transform queue.
1661 v3s16(0,0,1), // back
1662 v3s16(0,1,0), // top
1663 v3s16(1,0,0), // right
1664 v3s16(0,0,-1), // front
1665 v3s16(0,-1,0), // bottom
1666 v3s16(-1,0,0), // left
1668 for(u16 i=0; i<6; i++)
1670 v3s16 p2 = p0 + dirs[i];
1672 MapNode n2 = getNodeNoEx(p2);
1673 if(content_flowing_liquid(n2.d))
1675 m_transforming_liquid.push_back(p2);
1681 // Get a new one from queue if the node has turned into non-water
1682 if(content_liquid(n0.d) == false)
1686 Flow water from this node
1688 v3s16 dirs_to[5] = {
1689 v3s16(0,-1,0), // bottom
1690 v3s16(0,0,1), // back
1691 v3s16(1,0,0), // right
1692 v3s16(0,0,-1), // front
1693 v3s16(-1,0,0), // left
1695 for(u16 i=0; i<5; i++)
1697 bool to_bottom = (i == 0);
1699 // If liquid is at lowest possible height, it's not going
1700 // anywhere except down
1701 if(liquid_level == 0 && to_bottom == false)
1704 u8 liquid_next_level = 0;
1705 // If going to bottom
1708 //liquid_next_level = 7;
1709 if(liquid_level >= 7 - WATER_DROP_BOOST)
1710 liquid_next_level = 7;
1712 liquid_next_level = liquid_level + WATER_DROP_BOOST;
1715 liquid_next_level = liquid_level - 1;
1717 bool n2_changed = false;
1718 bool flowed = false;
1720 v3s16 p2 = p0 + dirs_to[i];
1722 MapNode n2 = getNodeNoEx(p2);
1723 //dstream<<"[1] n2.param="<<(int)n2.param<<std::endl;
1725 if(content_liquid(n2.d))
1727 u8 n2_nonsource_c = make_liquid_flowing(n2.d);
1728 // Check that the liquids are the same type
1729 if(n2_nonsource_c != nonsource_c)
1731 dstream<<"WARNING: Not handling: different liquids"
1732 " collide"<<std::endl;
1735 bool n2_is_source = !content_flowing_liquid(n2.d);
1736 u8 n2_liquid_level = 8;
1737 if(n2_is_source == false)
1738 n2_liquid_level = n2.param2 & 0x07;
1747 // Just flow into the source, nothing changes.
1748 // n2_changed is not set because destination didn't change
1753 if(liquid_next_level > liquid_level)
1755 n2.param2 = liquid_next_level;
1763 else if(n2.d == CONTENT_AIR)
1766 n2.param2 = liquid_next_level;
1773 //dstream<<"[2] n2.param="<<(int)n2.param<<std::endl;
1777 m_transforming_liquid.push_back(p2);
1779 v3s16 blockpos = getNodeBlockPos(p2);
1780 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1782 modified_blocks.insert(blockpos, block);
1785 // If n2_changed to bottom, don't flow anywhere else
1786 if(to_bottom && flowed && !is_source)
1791 //if(loopcount >= 100000)
1792 if(loopcount >= initial_size * 1)
1795 //dstream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
1798 NodeMetadata* Map::getNodeMetadata(v3s16 p)
1800 v3s16 blockpos = getNodeBlockPos(p);
1801 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1802 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1805 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1809 NodeMetadata *meta = block->m_node_metadata.get(p_rel);
1813 void Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
1815 v3s16 blockpos = getNodeBlockPos(p);
1816 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1817 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1820 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1824 block->m_node_metadata.set(p_rel, meta);
1827 void Map::removeNodeMetadata(v3s16 p)
1829 v3s16 blockpos = getNodeBlockPos(p);
1830 v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1831 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1834 dstream<<"WARNING: Map::removeNodeMetadata(): Block not found"
1838 block->m_node_metadata.remove(p_rel);
1841 void Map::nodeMetadataStep(float dtime,
1842 core::map<v3s16, MapBlock*> &changed_blocks)
1846 Currently there is no way to ensure that all the necessary
1847 blocks are loaded when this is run. (They might get unloaded)
1848 NOTE: ^- Actually, that might not be so. In a quick test it
1849 reloaded a block with a furnace when I walked back to it from
1852 core::map<v2s16, MapSector*>::Iterator si;
1853 si = m_sectors.getIterator();
1854 for(; si.atEnd() == false; si++)
1856 MapSector *sector = si.getNode()->getValue();
1857 core::list< MapBlock * > sectorblocks;
1858 sector->getBlocks(sectorblocks);
1859 core::list< MapBlock * >::Iterator i;
1860 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
1862 MapBlock *block = *i;
1863 bool changed = block->m_node_metadata.step(dtime);
1865 changed_blocks[block->getPos()] = block;
1874 ServerMap::ServerMap(std::string savedir):
1877 m_map_metadata_changed(true)
1879 dstream<<__FUNCTION_NAME<<std::endl;
1881 //m_chunksize = 8; // Takes a few seconds
1883 m_seed = (((u64)(myrand()%0xffff)<<0)
1884 + ((u64)(myrand()%0xffff)<<16)
1885 + ((u64)(myrand()%0xffff)<<32)
1886 + ((u64)(myrand()%0xffff)<<48));
1889 Experimental and debug stuff
1896 Try to load map; if not found, create a new one.
1899 m_savedir = savedir;
1900 m_map_saving_enabled = false;
1904 // If directory exists, check contents and load if possible
1905 if(fs::PathExists(m_savedir))
1907 // If directory is empty, it is safe to save into it.
1908 if(fs::GetDirListing(m_savedir).size() == 0)
1910 dstream<<DTIME<<"Server: Empty save directory is valid."
1912 m_map_saving_enabled = true;
1917 // Load map metadata (seed, chunksize)
1920 catch(FileNotGoodException &e){
1921 dstream<<DTIME<<"WARNING: Could not load map metadata"
1922 //<<" Disabling chunk-based generator."
1928 // Load chunk metadata
1931 catch(FileNotGoodException &e){
1932 dstream<<DTIME<<"WARNING: Could not load chunk metadata."
1933 <<" Disabling chunk-based generator."
1938 /*dstream<<DTIME<<"Server: Successfully loaded chunk "
1939 "metadata and sector (0,0) from "<<savedir<<
1940 ", assuming valid save directory."
1943 dstream<<DTIME<<"INFO: Server: Successfully loaded map "
1944 <<"and chunk metadata from "<<savedir
1945 <<", assuming valid save directory."
1948 m_map_saving_enabled = true;
1949 // Map loaded, not creating new one
1953 // If directory doesn't exist, it is safe to save to it
1955 m_map_saving_enabled = true;
1958 catch(std::exception &e)
1960 dstream<<DTIME<<"WARNING: Server: Failed to load map from "<<savedir
1961 <<", exception: "<<e.what()<<std::endl;
1962 dstream<<"Please remove the map or fix it."<<std::endl;
1963 dstream<<"WARNING: Map saving will be disabled."<<std::endl;
1966 dstream<<DTIME<<"INFO: Initializing new map."<<std::endl;
1968 // Create zero sector
1969 emergeSector(v2s16(0,0));
1971 // Initially write whole map
1975 ServerMap::~ServerMap()
1977 dstream<<__FUNCTION_NAME<<std::endl;
1981 if(m_map_saving_enabled)
1983 // Save only changed parts
1985 dstream<<DTIME<<"Server: saved map to "<<m_savedir<<std::endl;
1989 dstream<<DTIME<<"Server: map not saved"<<std::endl;
1992 catch(std::exception &e)
1994 dstream<<DTIME<<"Server: Failed to save map to "<<m_savedir
1995 <<", exception: "<<e.what()<<std::endl;
2002 core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
2003 for(; i.atEnd() == false; i++)
2005 MapChunk *chunk = i.getNode()->getValue();
2011 void ServerMap::initBlockMake(mapgen::BlockMakeData *data, v3s16 blockpos)
2013 /*dstream<<"initBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2014 <<blockpos.Z<<")"<<std::endl;*/
2016 // Do nothing if not inside limits (+-1 because of neighbors)
2017 if(blockpos_over_limit(blockpos - v3s16(1,1,1)) ||
2018 blockpos_over_limit(blockpos + v3s16(1,1,1)))
2024 data->no_op = false;
2025 data->seed = m_seed;
2026 data->blockpos = blockpos;
2029 Create the whole area of this and the neighboring blocks
2032 //TimeTaker timer("initBlockMake() create area");
2034 for(s16 x=-1; x<=1; x++)
2035 for(s16 z=-1; z<=1; z++)
2037 v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2038 // Sector metadata is loaded from disk if not already loaded.
2039 ServerMapSector *sector = createSector(sectorpos);
2042 for(s16 y=-1; y<=1; y++)
2044 //MapBlock *block = createBlock(blockpos);
2045 // 1) get from memory, 2) load from disk
2046 MapBlock *block = emergeBlock(blockpos, false);
2047 // 3) create a blank one
2049 block = createBlock(blockpos);
2051 // Lighting will not be valid after make_chunk is called
2052 block->setLightingExpired(true);
2053 // Lighting will be calculated
2054 //block->setLightingExpired(false);
2057 Block gets sunlight if this is true.
2059 This should be set to true when the top side of a block
2060 is completely exposed to the sky.
2062 block->setIsUnderground(false);
2068 Now we have a big empty area.
2070 Make a ManualMapVoxelManipulator that contains this and the
2074 // The area that contains this block and it's neighbors
2075 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2076 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2078 data->vmanip = new ManualMapVoxelManipulator(this);
2079 //data->vmanip->setMap(this);
2083 //TimeTaker timer("initBlockMake() initialEmerge");
2084 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2087 // Data is ready now.
2090 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2091 core::map<v3s16, MapBlock*> &changed_blocks)
2093 v3s16 blockpos = data->blockpos;
2094 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2095 <<blockpos.Z<<")"<<std::endl;*/
2099 //dstream<<"finishBlockMake(): no-op"<<std::endl;
2103 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2105 /*dstream<<"Resulting vmanip:"<<std::endl;
2106 data->vmanip.print(dstream);*/
2109 Blit generated stuff to map
2110 NOTE: blitBackAll adds nearly everything to changed_blocks
2114 //TimeTaker timer("finishBlockMake() blitBackAll");
2115 data->vmanip->blitBackAll(&changed_blocks);
2118 if(enable_mapgen_debug_info)
2119 dstream<<"finishBlockMake: changed_blocks.size()="
2120 <<changed_blocks.size()<<std::endl;
2123 Copy transforming liquid information
2125 while(data->transforming_liquid.size() > 0)
2127 v3s16 p = data->transforming_liquid.pop_front();
2128 m_transforming_liquid.push_back(p);
2134 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2138 Set is_underground flag for lighting with sunlight
2141 block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2144 Add sunlight to central block.
2145 This makes in-dark-spawning monsters to not flood the whole thing.
2146 Do not spread the light, though.
2148 /*core::map<v3s16, bool> light_sources;
2149 bool black_air_left = false;
2150 block->propagateSunlight(light_sources, true, &black_air_left);*/
2153 NOTE: Lighting and object adding shouldn't really be here, but
2154 lighting is a bit tricky to move properly to makeBlock.
2155 TODO: Do this the right way anyway, that is, move it to makeBlock.
2156 - There needs to be some way for makeBlock to report back if
2157 the lighting update is going further down because of the
2158 new block blocking light
2163 NOTE: This takes ~60ms, TODO: Investigate why
2166 TimeTaker t("finishBlockMake lighting update");
2168 core::map<v3s16, MapBlock*> lighting_update_blocks;
2171 lighting_update_blocks.insert(block->getPos(), block);
2174 // All modified blocks
2175 // NOTE: Should this be done? If this is not done, then the lighting
2176 // of the others will be updated in a different place, one by one, i
2177 // think... or they might not? Well, at least they are left marked as
2178 // "lighting expired"; it seems that is not handled at all anywhere,
2179 // so enabling this will slow it down A LOT because otherwise it
2180 // would not do this at all. This causes the black trees.
2181 for(core::map<v3s16, MapBlock*>::Iterator
2182 i = changed_blocks.getIterator();
2183 i.atEnd() == false; i++)
2185 lighting_update_blocks.insert(i.getNode()->getKey(),
2186 i.getNode()->getValue());
2189 updateLighting(lighting_update_blocks, changed_blocks);
2191 if(enable_mapgen_debug_info == false)
2192 t.stop(true); // Hide output
2196 Add random objects to block
2198 mapgen::add_random_objects(block);
2201 Go through changed blocks
2203 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2204 i.atEnd() == false; i++)
2206 MapBlock *block = i.getNode()->getValue();
2209 Update day/night difference cache of the MapBlocks
2211 block->updateDayNightDiff();
2213 Set block as modified
2215 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2219 Set central block as generated
2221 block->setGenerated(true);
2224 Save changed parts of map
2225 NOTE: Will be saved later.
2229 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2230 <<blockpos.Z<<")"<<std::endl;*/
2235 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2237 DSTACKF("%s: p2d=(%d,%d)",
2242 Check if it exists already in memory
2244 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2249 Try to load it from disk (with blocks)
2251 //if(loadSectorFull(p2d) == true)
2254 Try to load metadata from disk
2256 if(loadSectorMeta(p2d) == true)
2258 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2261 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2262 throw InvalidPositionException("");
2268 Do not create over-limit
2270 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2271 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2272 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2273 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2274 throw InvalidPositionException("createSector(): pos. over limit");
2277 Generate blank sector
2280 sector = new ServerMapSector(this, p2d);
2282 // Sector position on map in nodes
2283 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2288 m_sectors.insert(p2d, sector);
2294 This is a quick-hand function for calling makeBlock().
2296 MapBlock * ServerMap::generateBlock(
2298 core::map<v3s16, MapBlock*> &modified_blocks
2301 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2303 /*dstream<<"generateBlock(): "
2304 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2307 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2309 TimeTaker timer("generateBlock");
2311 //MapBlock *block = original_dummy;
2313 v2s16 p2d(p.X, p.Z);
2314 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2317 Do not generate over-limit
2319 if(blockpos_over_limit(p))
2321 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2322 throw InvalidPositionException("generateBlock(): pos. over limit");
2326 Create block make data
2328 mapgen::BlockMakeData data;
2329 initBlockMake(&data, p);
2335 TimeTaker t("mapgen::make_block()");
2336 mapgen::make_block(&data);
2338 if(enable_mapgen_debug_info == false)
2339 t.stop(true); // Hide output
2343 Blit data back on map, update lighting, add mobs and whatever this does
2345 finishBlockMake(&data, modified_blocks);
2350 MapBlock *block = getBlockNoCreateNoEx(p);
2358 bool erroneus_content = false;
2359 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2360 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2361 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2364 MapNode n = block->getNode(p);
2365 if(n.d == CONTENT_IGNORE)
2367 dstream<<"CONTENT_IGNORE at "
2368 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2370 erroneus_content = true;
2374 if(erroneus_content)
2383 Generate a completely empty block
2387 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2388 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2390 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2396 n.d = CONTENT_STONE;
2397 block->setNode(v3s16(x0,y0,z0), n);
2403 if(enable_mapgen_debug_info == false)
2404 timer.stop(true); // Hide output
2409 MapBlock * ServerMap::createBlock(v3s16 p)
2411 DSTACKF("%s: p=(%d,%d,%d)",
2412 __FUNCTION_NAME, p.X, p.Y, p.Z);
2415 Do not create over-limit
2417 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2418 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2419 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2420 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2421 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2422 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2423 throw InvalidPositionException("createBlock(): pos. over limit");
2425 v2s16 p2d(p.X, p.Z);
2428 This will create or load a sector if not found in memory.
2429 If block exists on disk, it will be loaded.
2431 NOTE: On old save formats, this will be slow, as it generates
2432 lighting on blocks for them.
2434 ServerMapSector *sector;
2436 sector = (ServerMapSector*)createSector(p2d);
2437 assert(sector->getId() == MAPSECTOR_SERVER);
2439 catch(InvalidPositionException &e)
2441 dstream<<"createBlock: createSector() failed"<<std::endl;
2445 NOTE: This should not be done, or at least the exception
2446 should not be passed on as std::exception, because it
2447 won't be catched at all.
2449 /*catch(std::exception &e)
2451 dstream<<"createBlock: createSector() failed: "
2452 <<e.what()<<std::endl;
2457 Try to get a block from the sector
2460 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2463 if(block->isDummy())
2468 block = sector->createBlankBlock(block_y);
2472 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2474 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2476 p.X, p.Y, p.Z, allow_generate);
2479 MapBlock *block = getBlockNoCreateNoEx(p);
2485 MapBlock *block = loadBlock(p);
2492 core::map<v3s16, MapBlock*> modified_blocks;
2493 MapBlock *block = generateBlock(p, modified_blocks);
2497 event.type = MEET_OTHER;
2500 // Copy modified_blocks to event
2501 for(core::map<v3s16, MapBlock*>::Iterator
2502 i = modified_blocks.getIterator();
2503 i.atEnd()==false; i++)
2505 event.modified_blocks.insert(i.getNode()->getKey(), false);
2509 dispatchEvent(&event);
2520 Do not generate over-limit
2522 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2523 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2524 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2525 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2526 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2527 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2528 throw InvalidPositionException("emergeBlock(): pos. over limit");
2530 v2s16 p2d(p.X, p.Z);
2533 This will create or load a sector if not found in memory.
2534 If block exists on disk, it will be loaded.
2536 ServerMapSector *sector;
2538 sector = createSector(p2d);
2539 //sector = emergeSector(p2d, changed_blocks);
2541 catch(InvalidPositionException &e)
2543 dstream<<"emergeBlock: createSector() failed: "
2544 <<e.what()<<std::endl;
2545 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2547 <<"You could try to delete it."<<std::endl;
2550 catch(VersionMismatchException &e)
2552 dstream<<"emergeBlock: createSector() failed: "
2553 <<e.what()<<std::endl;
2554 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2556 <<"You could try to delete it."<<std::endl;
2561 Try to get a block from the sector
2564 bool does_not_exist = false;
2565 bool lighting_expired = false;
2566 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2568 // If not found, try loading from disk
2571 block = loadBlock(p);
2577 does_not_exist = true;
2579 else if(block->isDummy() == true)
2581 does_not_exist = true;
2583 else if(block->getLightingExpired())
2585 lighting_expired = true;
2590 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2595 If block was not found on disk and not going to generate a
2596 new one, make sure there is a dummy block in place.
2598 if(only_from_disk && (does_not_exist || lighting_expired))
2600 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2604 // Create dummy block
2605 block = new MapBlock(this, p, true);
2607 // Add block to sector
2608 sector->insertBlock(block);
2614 //dstream<<"Not found on disk, generating."<<std::endl;
2616 //TimeTaker("emergeBlock() generate");
2618 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2621 If the block doesn't exist, generate the block.
2625 block = generateBlock(p, block, sector, changed_blocks,
2626 lighting_invalidated_blocks);
2629 if(lighting_expired)
2631 lighting_invalidated_blocks.insert(p, block);
2636 Initially update sunlight
2639 core::map<v3s16, bool> light_sources;
2640 bool black_air_left = false;
2641 bool bottom_invalid =
2642 block->propagateSunlight(light_sources, true,
2645 // If sunlight didn't reach everywhere and part of block is
2646 // above ground, lighting has to be properly updated
2647 //if(black_air_left && some_part_underground)
2650 lighting_invalidated_blocks[block->getPos()] = block;
2655 lighting_invalidated_blocks[block->getPos()] = block;
2664 s16 ServerMap::findGroundLevel(v2s16 p2d)
2668 Uh, just do something random...
2670 // Find existing map from top to down
2673 v3s16 p(p2d.X, max, p2d.Y);
2674 for(; p.Y>min; p.Y--)
2676 MapNode n = getNodeNoEx(p);
2677 if(n.d != CONTENT_IGNORE)
2682 // If this node is not air, go to plan b
2683 if(getNodeNoEx(p).d != CONTENT_AIR)
2685 // Search existing walkable and return it
2686 for(; p.Y>min; p.Y--)
2688 MapNode n = getNodeNoEx(p);
2689 if(content_walkable(n.d) && n.d != CONTENT_IGNORE)
2698 Determine from map generator noise functions
2701 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2704 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2705 //return (s16)level;
2708 void ServerMap::createDirs(std::string path)
2710 if(fs::CreateAllDirs(path) == false)
2712 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2713 <<"\""<<path<<"\""<<std::endl;
2714 throw BaseException("ServerMap failed to create directory");
2718 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2724 snprintf(cc, 9, "%.4x%.4x",
2725 (unsigned int)pos.X&0xffff,
2726 (unsigned int)pos.Y&0xffff);
2728 return m_savedir + "/sectors/" + cc;
2730 snprintf(cc, 9, "%.3x/%.3x",
2731 (unsigned int)pos.X&0xfff,
2732 (unsigned int)pos.Y&0xfff);
2734 return m_savedir + "/sectors2/" + cc;
2740 v2s16 ServerMap::getSectorPos(std::string dirname)
2744 size_t spos = dirname.rfind('/') + 1;
2745 assert(spos != std::string::npos);
2746 if(dirname.size() - spos == 8)
2749 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2751 else if(dirname.size() - spos == 3)
2754 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2755 // Sign-extend the 12 bit values up to 16 bits...
2756 if(x&0x800) x|=0xF000;
2757 if(y&0x800) y|=0xF000;
2764 v2s16 pos((s16)x, (s16)y);
2768 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2770 v2s16 p2d = getSectorPos(sectordir);
2772 if(blockfile.size() != 4){
2773 throw InvalidFilenameException("Invalid block filename");
2776 int r = sscanf(blockfile.c_str(), "%4x", &y);
2778 throw InvalidFilenameException("Invalid block filename");
2779 return v3s16(p2d.X, y, p2d.Y);
2782 std::string ServerMap::getBlockFilename(v3s16 p)
2785 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2789 void ServerMap::save(bool only_changed)
2791 DSTACK(__FUNCTION_NAME);
2792 if(m_map_saving_enabled == false)
2794 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2798 if(only_changed == false)
2799 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2802 if(only_changed == false || m_map_metadata_changed)
2807 u32 sector_meta_count = 0;
2808 u32 block_count = 0;
2809 u32 block_count_all = 0; // Number of blocks in memory
2811 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2812 for(; i.atEnd() == false; i++)
2814 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2815 assert(sector->getId() == MAPSECTOR_SERVER);
2817 if(sector->differs_from_disk || only_changed == false)
2819 saveSectorMeta(sector);
2820 sector_meta_count++;
2822 core::list<MapBlock*> blocks;
2823 sector->getBlocks(blocks);
2824 core::list<MapBlock*>::Iterator j;
2825 for(j=blocks.begin(); j!=blocks.end(); j++)
2827 MapBlock *block = *j;
2831 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2832 || only_changed == false)
2837 /*dstream<<"ServerMap: Written block ("
2838 <<block->getPos().X<<","
2839 <<block->getPos().Y<<","
2840 <<block->getPos().Z<<")"
2847 Only print if something happened or saved whole map
2849 if(only_changed == false || sector_meta_count != 0
2850 || block_count != 0)
2852 dstream<<DTIME<<"ServerMap: Written: "
2853 <<sector_meta_count<<" sector metadata files, "
2854 <<block_count<<" block files"
2855 <<", "<<block_count_all<<" blocks in memory."
2860 void ServerMap::saveMapMeta()
2862 DSTACK(__FUNCTION_NAME);
2864 dstream<<"INFO: ServerMap::saveMapMeta(): "
2868 createDirs(m_savedir);
2870 std::string fullpath = m_savedir + "/map_meta.txt";
2871 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2872 if(os.good() == false)
2874 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2875 <<"could not open"<<fullpath<<std::endl;
2876 throw FileNotGoodException("Cannot open chunk metadata");
2880 params.setU64("seed", m_seed);
2882 params.writeLines(os);
2884 os<<"[end_of_params]\n";
2886 m_map_metadata_changed = false;
2889 void ServerMap::loadMapMeta()
2891 DSTACK(__FUNCTION_NAME);
2893 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2896 std::string fullpath = m_savedir + "/map_meta.txt";
2897 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2898 if(is.good() == false)
2900 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2901 <<"could not open"<<fullpath<<std::endl;
2902 throw FileNotGoodException("Cannot open map metadata");
2910 throw SerializationError
2911 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2913 std::getline(is, line);
2914 std::string trimmedline = trim(line);
2915 if(trimmedline == "[end_of_params]")
2917 params.parseConfigLine(line);
2920 m_seed = params.getU64("seed");
2922 dstream<<"INFO: ServerMap::loadMapMeta(): "
2927 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2929 DSTACK(__FUNCTION_NAME);
2930 // Format used for writing
2931 u8 version = SER_FMT_VER_HIGHEST;
2933 v2s16 pos = sector->getPos();
2934 std::string dir = getSectorDir(pos);
2937 std::string fullpath = dir + "/meta";
2938 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2939 if(o.good() == false)
2940 throw FileNotGoodException("Cannot open sector metafile");
2942 sector->serialize(o, version);
2944 sector->differs_from_disk = false;
2947 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2949 DSTACK(__FUNCTION_NAME);
2951 v2s16 p2d = getSectorPos(sectordir);
2953 ServerMapSector *sector = NULL;
2955 std::string fullpath = sectordir + "/meta";
2956 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2957 if(is.good() == false)
2959 // If the directory exists anyway, it probably is in some old
2960 // format. Just go ahead and create the sector.
2961 if(fs::PathExists(sectordir))
2963 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
2964 <<fullpath<<" doesn't exist but directory does."
2965 <<" Continuing with a sector with no metadata."
2967 sector = new ServerMapSector(this, p2d);
2968 m_sectors.insert(p2d, sector);
2972 throw FileNotGoodException("Cannot open sector metafile");
2977 sector = ServerMapSector::deSerialize
2978 (is, this, p2d, m_sectors);
2980 saveSectorMeta(sector);
2983 sector->differs_from_disk = false;
2988 bool ServerMap::loadSectorMeta(v2s16 p2d)
2990 DSTACK(__FUNCTION_NAME);
2992 MapSector *sector = NULL;
2994 // The directory layout we're going to load from.
2995 // 1 - original sectors/xxxxzzzz/
2996 // 2 - new sectors2/xxx/zzz/
2997 // If we load from anything but the latest structure, we will
2998 // immediately save to the new one, and remove the old.
3000 std::string sectordir1 = getSectorDir(p2d, 1);
3001 std::string sectordir;
3002 if(fs::PathExists(sectordir1))
3004 sectordir = sectordir1;
3009 sectordir = getSectorDir(p2d, 2);
3013 sector = loadSectorMeta(sectordir, loadlayout != 2);
3015 catch(InvalidFilenameException &e)
3019 catch(FileNotGoodException &e)
3023 catch(std::exception &e)
3032 bool ServerMap::loadSectorFull(v2s16 p2d)
3034 DSTACK(__FUNCTION_NAME);
3036 MapSector *sector = NULL;
3038 // The directory layout we're going to load from.
3039 // 1 - original sectors/xxxxzzzz/
3040 // 2 - new sectors2/xxx/zzz/
3041 // If we load from anything but the latest structure, we will
3042 // immediately save to the new one, and remove the old.
3044 std::string sectordir1 = getSectorDir(p2d, 1);
3045 std::string sectordir;
3046 if(fs::PathExists(sectordir1))
3048 sectordir = sectordir1;
3053 sectordir = getSectorDir(p2d, 2);
3057 sector = loadSectorMeta(sectordir, loadlayout != 2);
3059 catch(InvalidFilenameException &e)
3063 catch(FileNotGoodException &e)
3067 catch(std::exception &e)
3075 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3077 std::vector<fs::DirListNode>::iterator i2;
3078 for(i2=list2.begin(); i2!=list2.end(); i2++)
3084 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3086 catch(InvalidFilenameException &e)
3088 // This catches unknown crap in directory
3094 dstream<<"Sector converted to new layout - deleting "<<
3095 sectordir1<<std::endl;
3096 fs::RecursiveDelete(sectordir1);
3103 void ServerMap::saveBlock(MapBlock *block)
3105 DSTACK(__FUNCTION_NAME);
3107 Dummy blocks are not written
3109 if(block->isDummy())
3111 /*v3s16 p = block->getPos();
3112 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3113 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3117 // Format used for writing
3118 u8 version = SER_FMT_VER_HIGHEST;
3120 v3s16 p3d = block->getPos();
3122 v2s16 p2d(p3d.X, p3d.Z);
3123 std::string sectordir = getSectorDir(p2d);
3125 createDirs(sectordir);
3127 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3128 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3129 if(o.good() == false)
3130 throw FileNotGoodException("Cannot open block data");
3133 [0] u8 serialization version
3136 o.write((char*)&version, 1);
3139 block->serialize(o, version);
3141 // Write extra data stored on disk
3142 block->serializeDiskExtra(o, version);
3144 // We just wrote it to the disk so clear modified flag
3145 block->resetModified();
3148 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3150 DSTACK(__FUNCTION_NAME);
3152 std::string fullpath = sectordir+"/"+blockfile;
3155 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3156 if(is.good() == false)
3157 throw FileNotGoodException("Cannot open block file");
3159 v3s16 p3d = getBlockPos(sectordir, blockfile);
3160 v2s16 p2d(p3d.X, p3d.Z);
3162 assert(sector->getPos() == p2d);
3164 u8 version = SER_FMT_VER_INVALID;
3165 is.read((char*)&version, 1);
3168 throw SerializationError("ServerMap::loadBlock(): Failed"
3169 " to read MapBlock version");
3171 /*u32 block_size = MapBlock::serializedLength(version);
3172 SharedBuffer<u8> data(block_size);
3173 is.read((char*)*data, block_size);*/
3175 // This will always return a sector because we're the server
3176 //MapSector *sector = emergeSector(p2d);
3178 MapBlock *block = NULL;
3179 bool created_new = false;
3180 block = sector->getBlockNoCreateNoEx(p3d.Y);
3183 block = sector->createBlankBlockNoInsert(p3d.Y);
3188 block->deSerialize(is, version);
3190 // Read extra data stored on disk
3191 block->deSerializeDiskExtra(is, version);
3193 // If it's a new block, insert it to the map
3195 sector->insertBlock(block);
3198 Save blocks loaded in old format in new format
3201 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3206 // We just loaded it from the disk, so it's up-to-date.
3207 block->resetModified();
3210 catch(SerializationError &e)
3212 dstream<<"WARNING: Invalid block data on disk "
3213 <<"fullpath="<<fullpath
3214 <<" (SerializationError). "
3215 <<"what()="<<e.what()
3217 //" Ignoring. A new one will be generated.
3220 // TODO: Backup file; name is in fullpath.
3224 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3226 DSTACK(__FUNCTION_NAME);
3228 v2s16 p2d(blockpos.X, blockpos.Z);
3230 // The directory layout we're going to load from.
3231 // 1 - original sectors/xxxxzzzz/
3232 // 2 - new sectors2/xxx/zzz/
3233 // If we load from anything but the latest structure, we will
3234 // immediately save to the new one, and remove the old.
3236 std::string sectordir1 = getSectorDir(p2d, 1);
3237 std::string sectordir;
3238 if(fs::PathExists(sectordir1))
3240 sectordir = sectordir1;
3245 sectordir = getSectorDir(p2d, 2);
3249 Make sure sector is loaded
3251 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3255 sector = loadSectorMeta(sectordir, loadlayout != 2);
3257 catch(InvalidFilenameException &e)
3261 catch(FileNotGoodException &e)
3265 catch(std::exception &e)
3272 Make sure file exists
3275 std::string blockfilename = getBlockFilename(blockpos);
3276 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3282 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3283 return getBlockNoCreateNoEx(blockpos);
3286 void ServerMap::PrintInfo(std::ostream &out)
3297 ClientMap::ClientMap(
3299 MapDrawControl &control,
3300 scene::ISceneNode* parent,
3301 scene::ISceneManager* mgr,
3305 scene::ISceneNode(parent, mgr, id),
3308 m_camera_position(0,0,0),
3309 m_camera_direction(0,0,1)
3311 m_camera_mutex.Init();
3312 assert(m_camera_mutex.IsInitialized());
3314 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3315 BS*1000000,BS*1000000,BS*1000000);
3318 ClientMap::~ClientMap()
3320 /*JMutexAutoLock lock(mesh_mutex);
3329 MapSector * ClientMap::emergeSector(v2s16 p2d)
3331 DSTACK(__FUNCTION_NAME);
3332 // Check that it doesn't exist already
3334 return getSectorNoGenerate(p2d);
3336 catch(InvalidPositionException &e)
3341 ClientMapSector *sector = new ClientMapSector(this, p2d);
3344 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3345 m_sectors.insert(p2d, sector);
3352 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3354 DSTACK(__FUNCTION_NAME);
3355 ClientMapSector *sector = NULL;
3357 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3359 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3363 sector = (ClientMapSector*)n->getValue();
3364 assert(sector->getId() == MAPSECTOR_CLIENT);
3368 sector = new ClientMapSector(this, p2d);
3370 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3371 m_sectors.insert(p2d, sector);
3375 sector->deSerialize(is);
3379 void ClientMap::OnRegisterSceneNode()
3383 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3384 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3387 ISceneNode::OnRegisterSceneNode();
3390 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3392 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3393 DSTACK(__FUNCTION_NAME);
3395 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3398 This is called two times per frame, reset on the non-transparent one
3400 if(pass == scene::ESNRP_SOLID)
3402 m_last_drawn_sectors.clear();
3406 Get time for measuring timeout.
3408 Measuring time is very useful for long delays when the
3409 machine is swapping a lot.
3411 int time1 = time(0);
3413 //u32 daynight_ratio = m_client->getDayNightRatio();
3415 m_camera_mutex.Lock();
3416 v3f camera_position = m_camera_position;
3417 v3f camera_direction = m_camera_direction;
3418 m_camera_mutex.Unlock();
3421 Get all blocks and draw all visible ones
3424 v3s16 cam_pos_nodes(
3425 camera_position.X / BS,
3426 camera_position.Y / BS,
3427 camera_position.Z / BS);
3429 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3431 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3432 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3434 // Take a fair amount as we will be dropping more out later
3436 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3437 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3438 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3440 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3441 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3442 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3444 u32 vertex_count = 0;
3446 // For limiting number of mesh updates per frame
3447 u32 mesh_update_count = 0;
3449 u32 blocks_would_have_drawn = 0;
3450 u32 blocks_drawn = 0;
3452 int timecheck_counter = 0;
3453 core::map<v2s16, MapSector*>::Iterator si;
3454 si = m_sectors.getIterator();
3455 for(; si.atEnd() == false; si++)
3458 timecheck_counter++;
3459 if(timecheck_counter > 50)
3461 timecheck_counter = 0;
3462 int time2 = time(0);
3463 if(time2 > time1 + 4)
3465 dstream<<"ClientMap::renderMap(): "
3466 "Rendering takes ages, returning."
3473 MapSector *sector = si.getNode()->getValue();
3474 v2s16 sp = sector->getPos();
3476 if(m_control.range_all == false)
3478 if(sp.X < p_blocks_min.X
3479 || sp.X > p_blocks_max.X
3480 || sp.Y < p_blocks_min.Z
3481 || sp.Y > p_blocks_max.Z)
3485 core::list< MapBlock * > sectorblocks;
3486 sector->getBlocks(sectorblocks);
3492 u32 sector_blocks_drawn = 0;
3494 core::list< MapBlock * >::Iterator i;
3495 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3497 MapBlock *block = *i;
3500 Compare block position to camera position, skip
3501 if not seen on display
3504 float range = 100000 * BS;
3505 if(m_control.range_all == false)
3506 range = m_control.wanted_range * BS;
3509 if(isBlockInSight(block->getPos(), camera_position,
3510 camera_direction, range, &d) == false)
3515 // Okay, this block will be drawn. Reset usage timer.
3516 block->resetUsageTimer();
3518 // This is ugly (spherical distance limit?)
3519 /*if(m_control.range_all == false &&
3520 d - 0.5*BS*MAP_BLOCKSIZE > range)
3525 Update expired mesh (used for day/night change)
3527 It doesn't work exactly like it should now with the
3528 tasked mesh update but whatever.
3531 bool mesh_expired = false;
3534 JMutexAutoLock lock(block->mesh_mutex);
3536 mesh_expired = block->getMeshExpired();
3538 // Mesh has not been expired and there is no mesh:
3539 // block has no content
3540 if(block->mesh == NULL && mesh_expired == false)
3544 f32 faraway = BS*50;
3545 //f32 faraway = m_control.wanted_range * BS;
3548 This has to be done with the mesh_mutex unlocked
3550 // Pretty random but this should work somewhat nicely
3551 if(mesh_expired && (
3552 (mesh_update_count < 3
3553 && (d < faraway || mesh_update_count < 2)
3556 (m_control.range_all && mesh_update_count < 20)
3559 /*if(mesh_expired && mesh_update_count < 6
3560 && (d < faraway || mesh_update_count < 3))*/
3562 mesh_update_count++;
3564 // Mesh has been expired: generate new mesh
3565 //block->updateMesh(daynight_ratio);
3566 m_client->addUpdateMeshTask(block->getPos());
3568 mesh_expired = false;
3573 Draw the faces of the block
3576 JMutexAutoLock lock(block->mesh_mutex);
3578 scene::SMesh *mesh = block->mesh;
3583 blocks_would_have_drawn++;
3584 if(blocks_drawn >= m_control.wanted_max_blocks
3585 && m_control.range_all == false
3586 && d > m_control.wanted_min_range * BS)
3590 sector_blocks_drawn++;
3592 u32 c = mesh->getMeshBufferCount();
3594 for(u32 i=0; i<c; i++)
3596 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3597 const video::SMaterial& material = buf->getMaterial();
3598 video::IMaterialRenderer* rnd =
3599 driver->getMaterialRenderer(material.MaterialType);
3600 bool transparent = (rnd && rnd->isTransparent());
3601 // Render transparent on transparent pass and likewise.
3602 if(transparent == is_transparent_pass)
3605 This *shouldn't* hurt too much because Irrlicht
3606 doesn't change opengl textures if the old
3607 material is set again.
3609 driver->setMaterial(buf->getMaterial());
3610 driver->drawMeshBuffer(buf);
3611 vertex_count += buf->getVertexCount();
3615 } // foreach sectorblocks
3617 if(sector_blocks_drawn != 0)
3619 m_last_drawn_sectors[sp] = true;
3623 m_control.blocks_drawn = blocks_drawn;
3624 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3626 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3627 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3630 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3631 core::map<v3s16, MapBlock*> *affected_blocks)
3633 bool changed = false;
3635 Add it to all blocks touching it
3638 v3s16(0,0,0), // this
3639 v3s16(0,0,1), // back
3640 v3s16(0,1,0), // top
3641 v3s16(1,0,0), // right
3642 v3s16(0,0,-1), // front
3643 v3s16(0,-1,0), // bottom
3644 v3s16(-1,0,0), // left
3646 for(u16 i=0; i<7; i++)
3648 v3s16 p2 = p + dirs[i];
3649 // Block position of neighbor (or requested) node
3650 v3s16 blockpos = getNodeBlockPos(p2);
3651 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3652 if(blockref == NULL)
3654 // Relative position of requested node
3655 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3656 if(blockref->setTempMod(relpos, mod))
3661 if(changed && affected_blocks!=NULL)
3663 for(u16 i=0; i<7; i++)
3665 v3s16 p2 = p + dirs[i];
3666 // Block position of neighbor (or requested) node
3667 v3s16 blockpos = getNodeBlockPos(p2);
3668 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3669 if(blockref == NULL)
3671 affected_blocks->insert(blockpos, blockref);
3677 bool ClientMap::clearTempMod(v3s16 p,
3678 core::map<v3s16, MapBlock*> *affected_blocks)
3680 bool changed = false;
3682 v3s16(0,0,0), // this
3683 v3s16(0,0,1), // back
3684 v3s16(0,1,0), // top
3685 v3s16(1,0,0), // right
3686 v3s16(0,0,-1), // front
3687 v3s16(0,-1,0), // bottom
3688 v3s16(-1,0,0), // left
3690 for(u16 i=0; i<7; i++)
3692 v3s16 p2 = p + dirs[i];
3693 // Block position of neighbor (or requested) node
3694 v3s16 blockpos = getNodeBlockPos(p2);
3695 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3696 if(blockref == NULL)
3698 // Relative position of requested node
3699 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3700 if(blockref->clearTempMod(relpos))
3705 if(changed && affected_blocks!=NULL)
3707 for(u16 i=0; i<7; i++)
3709 v3s16 p2 = p + dirs[i];
3710 // Block position of neighbor (or requested) node
3711 v3s16 blockpos = getNodeBlockPos(p2);
3712 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3713 if(blockref == NULL)
3715 affected_blocks->insert(blockpos, blockref);
3721 void ClientMap::expireMeshes(bool only_daynight_diffed)
3723 TimeTaker timer("expireMeshes()");
3725 core::map<v2s16, MapSector*>::Iterator si;
3726 si = m_sectors.getIterator();
3727 for(; si.atEnd() == false; si++)
3729 MapSector *sector = si.getNode()->getValue();
3731 core::list< MapBlock * > sectorblocks;
3732 sector->getBlocks(sectorblocks);
3734 core::list< MapBlock * >::Iterator i;
3735 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3737 MapBlock *block = *i;
3739 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3745 JMutexAutoLock lock(block->mesh_mutex);
3746 if(block->mesh != NULL)
3748 /*block->mesh->drop();
3749 block->mesh = NULL;*/
3750 block->setMeshExpired(true);
3757 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3759 assert(mapType() == MAPTYPE_CLIENT);
3762 v3s16 p = blockpos + v3s16(0,0,0);
3763 MapBlock *b = getBlockNoCreate(p);
3764 b->updateMesh(daynight_ratio);
3765 //b->setMeshExpired(true);
3767 catch(InvalidPositionException &e){}
3770 v3s16 p = blockpos + v3s16(-1,0,0);
3771 MapBlock *b = getBlockNoCreate(p);
3772 b->updateMesh(daynight_ratio);
3773 //b->setMeshExpired(true);
3775 catch(InvalidPositionException &e){}
3777 v3s16 p = blockpos + v3s16(0,-1,0);
3778 MapBlock *b = getBlockNoCreate(p);
3779 b->updateMesh(daynight_ratio);
3780 //b->setMeshExpired(true);
3782 catch(InvalidPositionException &e){}
3784 v3s16 p = blockpos + v3s16(0,0,-1);
3785 MapBlock *b = getBlockNoCreate(p);
3786 b->updateMesh(daynight_ratio);
3787 //b->setMeshExpired(true);
3789 catch(InvalidPositionException &e){}
3794 Update mesh of block in which the node is, and if the node is at the
3795 leading edge, update the appropriate leading blocks too.
3797 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3805 v3s16 blockposes[4];
3806 for(u32 i=0; i<4; i++)
3808 v3s16 np = nodepos + dirs[i];
3809 blockposes[i] = getNodeBlockPos(np);
3810 // Don't update mesh of block if it has been done already
3811 bool already_updated = false;
3812 for(u32 j=0; j<i; j++)
3814 if(blockposes[j] == blockposes[i])
3816 already_updated = true;
3823 MapBlock *b = getBlockNoCreate(blockposes[i]);
3824 b->updateMesh(daynight_ratio);
3829 void ClientMap::PrintInfo(std::ostream &out)
3840 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3845 MapVoxelManipulator::~MapVoxelManipulator()
3847 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3851 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3853 TimeTaker timer1("emerge", &emerge_time);
3855 // Units of these are MapBlocks
3856 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3857 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3859 VoxelArea block_area_nodes
3860 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3862 addArea(block_area_nodes);
3864 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3865 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3866 for(s32 x=p_min.X; x<=p_max.X; x++)
3869 core::map<v3s16, bool>::Node *n;
3870 n = m_loaded_blocks.find(p);
3874 bool block_data_inexistent = false;
3877 TimeTaker timer1("emerge load", &emerge_load_time);
3879 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3880 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3883 dstream<<std::endl;*/
3885 MapBlock *block = m_map->getBlockNoCreate(p);
3886 if(block->isDummy())
3887 block_data_inexistent = true;
3889 block->copyTo(*this);
3891 catch(InvalidPositionException &e)
3893 block_data_inexistent = true;
3896 if(block_data_inexistent)
3898 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3899 // Fill with VOXELFLAG_INEXISTENT
3900 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3901 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3903 s32 i = m_area.index(a.MinEdge.X,y,z);
3904 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3908 m_loaded_blocks.insert(p, !block_data_inexistent);
3911 //dstream<<"emerge done"<<std::endl;
3915 SUGG: Add an option to only update eg. water and air nodes.
3916 This will make it interfere less with important stuff if
3919 void MapVoxelManipulator::blitBack
3920 (core::map<v3s16, MapBlock*> & modified_blocks)
3922 if(m_area.getExtent() == v3s16(0,0,0))
3925 //TimeTaker timer1("blitBack");
3927 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3928 <<m_loaded_blocks.size()<<std::endl;*/
3931 Initialize block cache
3933 v3s16 blockpos_last;
3934 MapBlock *block = NULL;
3935 bool block_checked_in_modified = false;
3937 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3938 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3939 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3943 u8 f = m_flags[m_area.index(p)];
3944 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3947 MapNode &n = m_data[m_area.index(p)];
3949 v3s16 blockpos = getNodeBlockPos(p);
3954 if(block == NULL || blockpos != blockpos_last){
3955 block = m_map->getBlockNoCreate(blockpos);
3956 blockpos_last = blockpos;
3957 block_checked_in_modified = false;
3960 // Calculate relative position in block
3961 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
3963 // Don't continue if nothing has changed here
3964 if(block->getNode(relpos) == n)
3967 //m_map->setNode(m_area.MinEdge + p, n);
3968 block->setNode(relpos, n);
3971 Make sure block is in modified_blocks
3973 if(block_checked_in_modified == false)
3975 modified_blocks[blockpos] = block;
3976 block_checked_in_modified = true;
3979 catch(InvalidPositionException &e)
3985 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
3986 MapVoxelManipulator(map),
3987 m_create_area(false)
3991 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
3995 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3997 // Just create the area so that it can be pointed to
3998 VoxelManipulator::emerge(a, caller_id);
4001 void ManualMapVoxelManipulator::initialEmerge(
4002 v3s16 blockpos_min, v3s16 blockpos_max)
4004 TimeTaker timer1("initialEmerge", &emerge_time);
4006 // Units of these are MapBlocks
4007 v3s16 p_min = blockpos_min;
4008 v3s16 p_max = blockpos_max;
4010 VoxelArea block_area_nodes
4011 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4013 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
4016 dstream<<"initialEmerge: area: ";
4017 block_area_nodes.print(dstream);
4018 dstream<<" ("<<size_MB<<"MB)";
4022 addArea(block_area_nodes);
4024 for(s32 z=p_min.Z; z<=p_max.Z; z++)
4025 for(s32 y=p_min.Y; y<=p_max.Y; y++)
4026 for(s32 x=p_min.X; x<=p_max.X; x++)
4029 core::map<v3s16, bool>::Node *n;
4030 n = m_loaded_blocks.find(p);
4034 bool block_data_inexistent = false;
4037 TimeTaker timer1("emerge load", &emerge_load_time);
4039 MapBlock *block = m_map->getBlockNoCreate(p);
4040 if(block->isDummy())
4041 block_data_inexistent = true;
4043 block->copyTo(*this);
4045 catch(InvalidPositionException &e)
4047 block_data_inexistent = true;
4050 if(block_data_inexistent)
4053 Mark area inexistent
4055 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4056 // Fill with VOXELFLAG_INEXISTENT
4057 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4058 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4060 s32 i = m_area.index(a.MinEdge.X,y,z);
4061 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4065 m_loaded_blocks.insert(p, !block_data_inexistent);
4069 void ManualMapVoxelManipulator::blitBackAll(
4070 core::map<v3s16, MapBlock*> * modified_blocks)
4072 if(m_area.getExtent() == v3s16(0,0,0))
4076 Copy data of all blocks
4078 for(core::map<v3s16, bool>::Iterator
4079 i = m_loaded_blocks.getIterator();
4080 i.atEnd() == false; i++)
4082 bool existed = i.getNode()->getValue();
4083 if(existed == false)
4085 v3s16 p = i.getNode()->getKey();
4086 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4089 dstream<<"WARNING: "<<__FUNCTION_NAME
4090 <<": got NULL block "
4091 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4096 block->copyFrom(*this);
4099 modified_blocks->insert(p, block);