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 data->no_op = false;
2017 data->seed = m_seed;
2018 data->blockpos = blockpos;
2021 Create the whole area of this and the neighboring blocks
2024 //TimeTaker timer("initBlockMake() create area");
2026 for(s16 x=-1; x<=1; x++)
2027 for(s16 z=-1; z<=1; z++)
2029 v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2030 // Sector metadata is loaded from disk if not already loaded.
2031 ServerMapSector *sector = createSector(sectorpos);
2034 for(s16 y=-1; y<=1; y++)
2036 //MapBlock *block = createBlock(blockpos);
2037 // 1) get from memory, 2) load from disk
2038 MapBlock *block = emergeBlock(blockpos, false);
2039 // 3) create a blank one
2041 block = createBlock(blockpos);
2043 // Lighting will not be valid after make_chunk is called
2044 block->setLightingExpired(true);
2045 // Lighting will be calculated
2046 //block->setLightingExpired(false);
2049 Block gets sunlight if this is true.
2051 This should be set to true when the top side of a block
2052 is completely exposed to the sky.
2054 block->setIsUnderground(false);
2060 Now we have a big empty area.
2062 Make a ManualMapVoxelManipulator that contains this and the
2066 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2067 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2069 data->vmanip = new ManualMapVoxelManipulator(this);
2070 //data->vmanip->setMap(this);
2074 //TimeTaker timer("initBlockMake() initialEmerge");
2075 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2078 // Data is ready now.
2081 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2082 core::map<v3s16, MapBlock*> &changed_blocks)
2084 v3s16 blockpos = data->blockpos;
2085 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2086 <<blockpos.Z<<")"<<std::endl;*/
2090 dstream<<"finishBlockMake(): no-op"<<std::endl;
2094 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2096 /*dstream<<"Resulting vmanip:"<<std::endl;
2097 data->vmanip.print(dstream);*/
2100 Blit generated stuff to map
2101 NOTE: blitBackAll adds nearly everything to changed_blocks
2105 //TimeTaker timer("finishBlockMake() blitBackAll");
2106 data->vmanip->blitBackAll(&changed_blocks);
2109 if(enable_mapgen_debug_info)
2110 dstream<<"finishBlockMake: changed_blocks.size()="
2111 <<changed_blocks.size()<<std::endl;
2114 Copy transforming liquid information
2116 while(data->transforming_liquid.size() > 0)
2118 v3s16 p = data->transforming_liquid.pop_front();
2119 m_transforming_liquid.push_back(p);
2125 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2129 Set is_underground flag for lighting with sunlight
2132 block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2135 Add sunlight to central block.
2136 This makes in-dark-spawning monsters to not flood the whole thing.
2137 Do not spread the light, though.
2139 /*core::map<v3s16, bool> light_sources;
2140 bool black_air_left = false;
2141 block->propagateSunlight(light_sources, true, &black_air_left);*/
2144 NOTE: Lighting and object adding shouldn't really be here, but
2145 lighting is a bit tricky to move properly to makeBlock.
2146 TODO: Do this the right way anyway, that is, move it to makeBlock.
2147 - There needs to be some way for makeBlock to report back if
2148 the lighting update is going further down because of the
2149 new block blocking light
2154 NOTE: This takes ~60ms, TODO: Investigate why
2157 TimeTaker t("finishBlockMake lighting update");
2159 core::map<v3s16, MapBlock*> lighting_update_blocks;
2162 lighting_update_blocks.insert(block->getPos(), block);
2165 // All modified blocks
2166 // NOTE: Should this be done? If this is not done, then the lighting
2167 // of the others will be updated in a different place, one by one, i
2168 // think... or they might not? Well, at least they are left marked as
2169 // "lighting expired"; it seems that is not handled at all anywhere,
2170 // so enabling this will slow it down A LOT because otherwise it
2171 // would not do this at all. This causes the black trees.
2172 for(core::map<v3s16, MapBlock*>::Iterator
2173 i = changed_blocks.getIterator();
2174 i.atEnd() == false; i++)
2176 lighting_update_blocks.insert(i.getNode()->getKey(),
2177 i.getNode()->getValue());
2180 updateLighting(lighting_update_blocks, changed_blocks);
2182 if(enable_mapgen_debug_info == false)
2183 t.stop(true); // Hide output
2187 Add random objects to block
2189 mapgen::add_random_objects(block);
2192 Go through changed blocks
2194 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2195 i.atEnd() == false; i++)
2197 MapBlock *block = i.getNode()->getValue();
2200 Update day/night difference cache of the MapBlocks
2202 block->updateDayNightDiff();
2204 Set block as modified
2206 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2210 Set central block as generated
2212 block->setGenerated(true);
2215 Save changed parts of map
2216 NOTE: Will be saved later.
2220 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2221 <<blockpos.Z<<")"<<std::endl;*/
2226 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2228 DSTACKF("%s: p2d=(%d,%d)",
2233 Check if it exists already in memory
2235 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2240 Try to load it from disk (with blocks)
2242 //if(loadSectorFull(p2d) == true)
2245 Try to load metadata from disk
2247 if(loadSectorMeta(p2d) == true)
2249 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2252 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2253 throw InvalidPositionException("");
2259 Do not create over-limit
2261 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2262 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2263 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2264 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2265 throw InvalidPositionException("createSector(): pos. over limit");
2268 Generate blank sector
2271 sector = new ServerMapSector(this, p2d);
2273 // Sector position on map in nodes
2274 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2279 m_sectors.insert(p2d, sector);
2285 This is a quick-hand function for calling makeBlock().
2287 MapBlock * ServerMap::generateBlock(
2289 core::map<v3s16, MapBlock*> &modified_blocks
2292 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2294 /*dstream<<"generateBlock(): "
2295 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2298 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2300 TimeTaker timer("generateBlock");
2302 //MapBlock *block = original_dummy;
2304 v2s16 p2d(p.X, p.Z);
2305 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2308 Do not generate over-limit
2310 if(blockpos_over_limit(p))
2312 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2313 throw InvalidPositionException("generateBlock(): pos. over limit");
2317 Create block make data
2319 mapgen::BlockMakeData data;
2320 initBlockMake(&data, p);
2326 TimeTaker t("mapgen::make_block()");
2327 mapgen::make_block(&data);
2329 if(enable_mapgen_debug_info == false)
2330 t.stop(true); // Hide output
2334 Blit data back on map, update lighting, add mobs and whatever this does
2336 finishBlockMake(&data, modified_blocks);
2341 MapBlock *block = getBlockNoCreateNoEx(p);
2348 bool erroneus_content = false;
2349 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2350 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2351 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2354 MapNode n = block->getNode(p);
2355 if(n.d == CONTENT_IGNORE)
2357 dstream<<"CONTENT_IGNORE at "
2358 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2360 erroneus_content = true;
2364 if(erroneus_content)
2372 Generate a completely empty block
2374 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2375 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2377 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2383 n.d = CONTENT_STONE;
2384 block->setNode(v3s16(x0,y0,z0), n);
2389 if(enable_mapgen_debug_info == false)
2390 timer.stop(true); // Hide output
2395 MapBlock * ServerMap::createBlock(v3s16 p)
2397 DSTACKF("%s: p=(%d,%d,%d)",
2398 __FUNCTION_NAME, p.X, p.Y, p.Z);
2401 Do not create over-limit
2403 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2404 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2405 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2406 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2407 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2408 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2409 throw InvalidPositionException("createBlock(): pos. over limit");
2411 v2s16 p2d(p.X, p.Z);
2414 This will create or load a sector if not found in memory.
2415 If block exists on disk, it will be loaded.
2417 NOTE: On old save formats, this will be slow, as it generates
2418 lighting on blocks for them.
2420 ServerMapSector *sector;
2422 sector = (ServerMapSector*)createSector(p2d);
2423 assert(sector->getId() == MAPSECTOR_SERVER);
2425 catch(InvalidPositionException &e)
2427 dstream<<"createBlock: createSector() failed"<<std::endl;
2431 NOTE: This should not be done, or at least the exception
2432 should not be passed on as std::exception, because it
2433 won't be catched at all.
2435 /*catch(std::exception &e)
2437 dstream<<"createBlock: createSector() failed: "
2438 <<e.what()<<std::endl;
2443 Try to get a block from the sector
2446 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2449 if(block->isDummy())
2454 block = sector->createBlankBlock(block_y);
2458 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2460 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2462 p.X, p.Y, p.Z, allow_generate);
2465 MapBlock *block = getBlockNoCreateNoEx(p);
2471 MapBlock *block = loadBlock(p);
2478 core::map<v3s16, MapBlock*> modified_blocks;
2479 MapBlock *block = generateBlock(p, modified_blocks);
2483 event.type = MEET_OTHER;
2486 // Copy modified_blocks to event
2487 for(core::map<v3s16, MapBlock*>::Iterator
2488 i = modified_blocks.getIterator();
2489 i.atEnd()==false; i++)
2491 event.modified_blocks.insert(i.getNode()->getKey(), false);
2495 dispatchEvent(&event);
2506 Do not generate over-limit
2508 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2509 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2510 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2511 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2512 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2513 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2514 throw InvalidPositionException("emergeBlock(): pos. over limit");
2516 v2s16 p2d(p.X, p.Z);
2519 This will create or load a sector if not found in memory.
2520 If block exists on disk, it will be loaded.
2522 ServerMapSector *sector;
2524 sector = createSector(p2d);
2525 //sector = emergeSector(p2d, changed_blocks);
2527 catch(InvalidPositionException &e)
2529 dstream<<"emergeBlock: createSector() failed: "
2530 <<e.what()<<std::endl;
2531 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2533 <<"You could try to delete it."<<std::endl;
2536 catch(VersionMismatchException &e)
2538 dstream<<"emergeBlock: createSector() failed: "
2539 <<e.what()<<std::endl;
2540 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2542 <<"You could try to delete it."<<std::endl;
2547 Try to get a block from the sector
2550 bool does_not_exist = false;
2551 bool lighting_expired = false;
2552 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2554 // If not found, try loading from disk
2557 block = loadBlock(p);
2563 does_not_exist = true;
2565 else if(block->isDummy() == true)
2567 does_not_exist = true;
2569 else if(block->getLightingExpired())
2571 lighting_expired = true;
2576 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2581 If block was not found on disk and not going to generate a
2582 new one, make sure there is a dummy block in place.
2584 if(only_from_disk && (does_not_exist || lighting_expired))
2586 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2590 // Create dummy block
2591 block = new MapBlock(this, p, true);
2593 // Add block to sector
2594 sector->insertBlock(block);
2600 //dstream<<"Not found on disk, generating."<<std::endl;
2602 //TimeTaker("emergeBlock() generate");
2604 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2607 If the block doesn't exist, generate the block.
2611 block = generateBlock(p, block, sector, changed_blocks,
2612 lighting_invalidated_blocks);
2615 if(lighting_expired)
2617 lighting_invalidated_blocks.insert(p, block);
2622 Initially update sunlight
2625 core::map<v3s16, bool> light_sources;
2626 bool black_air_left = false;
2627 bool bottom_invalid =
2628 block->propagateSunlight(light_sources, true,
2631 // If sunlight didn't reach everywhere and part of block is
2632 // above ground, lighting has to be properly updated
2633 //if(black_air_left && some_part_underground)
2636 lighting_invalidated_blocks[block->getPos()] = block;
2641 lighting_invalidated_blocks[block->getPos()] = block;
2650 s16 ServerMap::findGroundLevel(v2s16 p2d)
2654 Uh, just do something random...
2656 // Find existing map from top to down
2659 v3s16 p(p2d.X, max, p2d.Y);
2660 for(; p.Y>min; p.Y--)
2662 MapNode n = getNodeNoEx(p);
2663 if(n.d != CONTENT_IGNORE)
2668 // If this node is not air, go to plan b
2669 if(getNodeNoEx(p).d != CONTENT_AIR)
2671 // Search existing walkable and return it
2672 for(; p.Y>min; p.Y--)
2674 MapNode n = getNodeNoEx(p);
2675 if(content_walkable(n.d) && n.d != CONTENT_IGNORE)
2684 Determine from map generator noise functions
2687 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2690 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2691 //return (s16)level;
2694 void ServerMap::createDirs(std::string path)
2696 if(fs::CreateAllDirs(path) == false)
2698 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2699 <<"\""<<path<<"\""<<std::endl;
2700 throw BaseException("ServerMap failed to create directory");
2704 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2710 snprintf(cc, 9, "%.4x%.4x",
2711 (unsigned int)pos.X&0xffff,
2712 (unsigned int)pos.Y&0xffff);
2714 return m_savedir + "/sectors/" + cc;
2716 snprintf(cc, 9, "%.3x/%.3x",
2717 (unsigned int)pos.X&0xfff,
2718 (unsigned int)pos.Y&0xfff);
2720 return m_savedir + "/sectors2/" + cc;
2726 v2s16 ServerMap::getSectorPos(std::string dirname)
2730 size_t spos = dirname.rfind('/') + 1;
2731 assert(spos != std::string::npos);
2732 if(dirname.size() - spos == 8)
2735 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2737 else if(dirname.size() - spos == 3)
2740 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2741 // Sign-extend the 12 bit values up to 16 bits...
2742 if(x&0x800) x|=0xF000;
2743 if(y&0x800) y|=0xF000;
2750 v2s16 pos((s16)x, (s16)y);
2754 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2756 v2s16 p2d = getSectorPos(sectordir);
2758 if(blockfile.size() != 4){
2759 throw InvalidFilenameException("Invalid block filename");
2762 int r = sscanf(blockfile.c_str(), "%4x", &y);
2764 throw InvalidFilenameException("Invalid block filename");
2765 return v3s16(p2d.X, y, p2d.Y);
2768 std::string ServerMap::getBlockFilename(v3s16 p)
2771 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2775 void ServerMap::save(bool only_changed)
2777 DSTACK(__FUNCTION_NAME);
2778 if(m_map_saving_enabled == false)
2780 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2784 if(only_changed == false)
2785 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2788 if(only_changed == false || m_map_metadata_changed)
2793 u32 sector_meta_count = 0;
2794 u32 block_count = 0;
2795 u32 block_count_all = 0; // Number of blocks in memory
2797 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2798 for(; i.atEnd() == false; i++)
2800 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2801 assert(sector->getId() == MAPSECTOR_SERVER);
2803 if(sector->differs_from_disk || only_changed == false)
2805 saveSectorMeta(sector);
2806 sector_meta_count++;
2808 core::list<MapBlock*> blocks;
2809 sector->getBlocks(blocks);
2810 core::list<MapBlock*>::Iterator j;
2811 for(j=blocks.begin(); j!=blocks.end(); j++)
2813 MapBlock *block = *j;
2817 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2818 || only_changed == false)
2823 /*dstream<<"ServerMap: Written block ("
2824 <<block->getPos().X<<","
2825 <<block->getPos().Y<<","
2826 <<block->getPos().Z<<")"
2833 Only print if something happened or saved whole map
2835 if(only_changed == false || sector_meta_count != 0
2836 || block_count != 0)
2838 dstream<<DTIME<<"ServerMap: Written: "
2839 <<sector_meta_count<<" sector metadata files, "
2840 <<block_count<<" block files"
2841 <<", "<<block_count_all<<" blocks in memory."
2846 void ServerMap::saveMapMeta()
2848 DSTACK(__FUNCTION_NAME);
2850 dstream<<"INFO: ServerMap::saveMapMeta(): "
2854 createDirs(m_savedir);
2856 std::string fullpath = m_savedir + "/map_meta.txt";
2857 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2858 if(os.good() == false)
2860 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2861 <<"could not open"<<fullpath<<std::endl;
2862 throw FileNotGoodException("Cannot open chunk metadata");
2866 params.setU64("seed", m_seed);
2868 params.writeLines(os);
2870 os<<"[end_of_params]\n";
2872 m_map_metadata_changed = false;
2875 void ServerMap::loadMapMeta()
2877 DSTACK(__FUNCTION_NAME);
2879 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2882 std::string fullpath = m_savedir + "/map_meta.txt";
2883 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2884 if(is.good() == false)
2886 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2887 <<"could not open"<<fullpath<<std::endl;
2888 throw FileNotGoodException("Cannot open map metadata");
2896 throw SerializationError
2897 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2899 std::getline(is, line);
2900 std::string trimmedline = trim(line);
2901 if(trimmedline == "[end_of_params]")
2903 params.parseConfigLine(line);
2906 m_seed = params.getU64("seed");
2908 dstream<<"INFO: ServerMap::loadMapMeta(): "
2913 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2915 DSTACK(__FUNCTION_NAME);
2916 // Format used for writing
2917 u8 version = SER_FMT_VER_HIGHEST;
2919 v2s16 pos = sector->getPos();
2920 std::string dir = getSectorDir(pos);
2923 std::string fullpath = dir + "/meta";
2924 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2925 if(o.good() == false)
2926 throw FileNotGoodException("Cannot open sector metafile");
2928 sector->serialize(o, version);
2930 sector->differs_from_disk = false;
2933 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2935 DSTACK(__FUNCTION_NAME);
2937 v2s16 p2d = getSectorPos(sectordir);
2939 ServerMapSector *sector = NULL;
2941 std::string fullpath = sectordir + "/meta";
2942 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2943 if(is.good() == false)
2945 // If the directory exists anyway, it probably is in some old
2946 // format. Just go ahead and create the sector.
2947 if(fs::PathExists(sectordir))
2949 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
2950 <<fullpath<<" doesn't exist but directory does."
2951 <<" Continuing with a sector with no metadata."
2953 sector = new ServerMapSector(this, p2d);
2954 m_sectors.insert(p2d, sector);
2958 throw FileNotGoodException("Cannot open sector metafile");
2963 sector = ServerMapSector::deSerialize
2964 (is, this, p2d, m_sectors);
2966 saveSectorMeta(sector);
2969 sector->differs_from_disk = false;
2974 bool ServerMap::loadSectorMeta(v2s16 p2d)
2976 DSTACK(__FUNCTION_NAME);
2978 MapSector *sector = NULL;
2980 // The directory layout we're going to load from.
2981 // 1 - original sectors/xxxxzzzz/
2982 // 2 - new sectors2/xxx/zzz/
2983 // If we load from anything but the latest structure, we will
2984 // immediately save to the new one, and remove the old.
2986 std::string sectordir1 = getSectorDir(p2d, 1);
2987 std::string sectordir;
2988 if(fs::PathExists(sectordir1))
2990 sectordir = sectordir1;
2995 sectordir = getSectorDir(p2d, 2);
2999 sector = loadSectorMeta(sectordir, loadlayout != 2);
3001 catch(InvalidFilenameException &e)
3005 catch(FileNotGoodException &e)
3009 catch(std::exception &e)
3018 bool ServerMap::loadSectorFull(v2s16 p2d)
3020 DSTACK(__FUNCTION_NAME);
3022 MapSector *sector = NULL;
3024 // The directory layout we're going to load from.
3025 // 1 - original sectors/xxxxzzzz/
3026 // 2 - new sectors2/xxx/zzz/
3027 // If we load from anything but the latest structure, we will
3028 // immediately save to the new one, and remove the old.
3030 std::string sectordir1 = getSectorDir(p2d, 1);
3031 std::string sectordir;
3032 if(fs::PathExists(sectordir1))
3034 sectordir = sectordir1;
3039 sectordir = getSectorDir(p2d, 2);
3043 sector = loadSectorMeta(sectordir, loadlayout != 2);
3045 catch(InvalidFilenameException &e)
3049 catch(FileNotGoodException &e)
3053 catch(std::exception &e)
3061 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3063 std::vector<fs::DirListNode>::iterator i2;
3064 for(i2=list2.begin(); i2!=list2.end(); i2++)
3070 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3072 catch(InvalidFilenameException &e)
3074 // This catches unknown crap in directory
3080 dstream<<"Sector converted to new layout - deleting "<<
3081 sectordir1<<std::endl;
3082 fs::RecursiveDelete(sectordir1);
3089 void ServerMap::saveBlock(MapBlock *block)
3091 DSTACK(__FUNCTION_NAME);
3093 Dummy blocks are not written
3095 if(block->isDummy())
3097 /*v3s16 p = block->getPos();
3098 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3099 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3103 // Format used for writing
3104 u8 version = SER_FMT_VER_HIGHEST;
3106 v3s16 p3d = block->getPos();
3108 v2s16 p2d(p3d.X, p3d.Z);
3109 std::string sectordir = getSectorDir(p2d);
3111 createDirs(sectordir);
3113 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3114 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3115 if(o.good() == false)
3116 throw FileNotGoodException("Cannot open block data");
3119 [0] u8 serialization version
3122 o.write((char*)&version, 1);
3125 block->serialize(o, version);
3127 // Write extra data stored on disk
3128 block->serializeDiskExtra(o, version);
3130 // We just wrote it to the disk so clear modified flag
3131 block->resetModified();
3134 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3136 DSTACK(__FUNCTION_NAME);
3138 std::string fullpath = sectordir+"/"+blockfile;
3141 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3142 if(is.good() == false)
3143 throw FileNotGoodException("Cannot open block file");
3145 v3s16 p3d = getBlockPos(sectordir, blockfile);
3146 v2s16 p2d(p3d.X, p3d.Z);
3148 assert(sector->getPos() == p2d);
3150 u8 version = SER_FMT_VER_INVALID;
3151 is.read((char*)&version, 1);
3154 throw SerializationError("ServerMap::loadBlock(): Failed"
3155 " to read MapBlock version");
3157 /*u32 block_size = MapBlock::serializedLength(version);
3158 SharedBuffer<u8> data(block_size);
3159 is.read((char*)*data, block_size);*/
3161 // This will always return a sector because we're the server
3162 //MapSector *sector = emergeSector(p2d);
3164 MapBlock *block = NULL;
3165 bool created_new = false;
3166 block = sector->getBlockNoCreateNoEx(p3d.Y);
3169 block = sector->createBlankBlockNoInsert(p3d.Y);
3174 block->deSerialize(is, version);
3176 // Read extra data stored on disk
3177 block->deSerializeDiskExtra(is, version);
3179 // If it's a new block, insert it to the map
3181 sector->insertBlock(block);
3184 Save blocks loaded in old format in new format
3187 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3192 // We just loaded it from the disk, so it's up-to-date.
3193 block->resetModified();
3196 catch(SerializationError &e)
3198 dstream<<"WARNING: Invalid block data on disk "
3199 <<"fullpath="<<fullpath
3200 <<" (SerializationError). "
3201 <<"what()="<<e.what()
3203 //" Ignoring. A new one will be generated.
3206 // TODO: Backup file; name is in fullpath.
3210 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3212 DSTACK(__FUNCTION_NAME);
3214 v2s16 p2d(blockpos.X, blockpos.Z);
3216 // The directory layout we're going to load from.
3217 // 1 - original sectors/xxxxzzzz/
3218 // 2 - new sectors2/xxx/zzz/
3219 // If we load from anything but the latest structure, we will
3220 // immediately save to the new one, and remove the old.
3222 std::string sectordir1 = getSectorDir(p2d, 1);
3223 std::string sectordir;
3224 if(fs::PathExists(sectordir1))
3226 sectordir = sectordir1;
3231 sectordir = getSectorDir(p2d, 2);
3235 Make sure sector is loaded
3237 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3241 sector = loadSectorMeta(sectordir, loadlayout != 2);
3243 catch(InvalidFilenameException &e)
3247 catch(FileNotGoodException &e)
3251 catch(std::exception &e)
3258 Make sure file exists
3261 std::string blockfilename = getBlockFilename(blockpos);
3262 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3268 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3269 return getBlockNoCreateNoEx(blockpos);
3272 void ServerMap::PrintInfo(std::ostream &out)
3283 ClientMap::ClientMap(
3285 MapDrawControl &control,
3286 scene::ISceneNode* parent,
3287 scene::ISceneManager* mgr,
3291 scene::ISceneNode(parent, mgr, id),
3294 m_camera_position(0,0,0),
3295 m_camera_direction(0,0,1)
3297 m_camera_mutex.Init();
3298 assert(m_camera_mutex.IsInitialized());
3300 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3301 BS*1000000,BS*1000000,BS*1000000);
3304 ClientMap::~ClientMap()
3306 /*JMutexAutoLock lock(mesh_mutex);
3315 MapSector * ClientMap::emergeSector(v2s16 p2d)
3317 DSTACK(__FUNCTION_NAME);
3318 // Check that it doesn't exist already
3320 return getSectorNoGenerate(p2d);
3322 catch(InvalidPositionException &e)
3327 ClientMapSector *sector = new ClientMapSector(this, p2d);
3330 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3331 m_sectors.insert(p2d, sector);
3338 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3340 DSTACK(__FUNCTION_NAME);
3341 ClientMapSector *sector = NULL;
3343 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3345 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3349 sector = (ClientMapSector*)n->getValue();
3350 assert(sector->getId() == MAPSECTOR_CLIENT);
3354 sector = new ClientMapSector(this, p2d);
3356 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3357 m_sectors.insert(p2d, sector);
3361 sector->deSerialize(is);
3365 void ClientMap::OnRegisterSceneNode()
3369 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3370 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3373 ISceneNode::OnRegisterSceneNode();
3376 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3378 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3379 DSTACK(__FUNCTION_NAME);
3381 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3384 This is called two times per frame, reset on the non-transparent one
3386 if(pass == scene::ESNRP_SOLID)
3388 m_last_drawn_sectors.clear();
3392 Get time for measuring timeout.
3394 Measuring time is very useful for long delays when the
3395 machine is swapping a lot.
3397 int time1 = time(0);
3399 //u32 daynight_ratio = m_client->getDayNightRatio();
3401 m_camera_mutex.Lock();
3402 v3f camera_position = m_camera_position;
3403 v3f camera_direction = m_camera_direction;
3404 m_camera_mutex.Unlock();
3407 Get all blocks and draw all visible ones
3410 v3s16 cam_pos_nodes(
3411 camera_position.X / BS,
3412 camera_position.Y / BS,
3413 camera_position.Z / BS);
3415 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3417 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3418 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3420 // Take a fair amount as we will be dropping more out later
3422 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3423 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3424 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3426 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3427 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3428 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3430 u32 vertex_count = 0;
3432 // For limiting number of mesh updates per frame
3433 u32 mesh_update_count = 0;
3435 u32 blocks_would_have_drawn = 0;
3436 u32 blocks_drawn = 0;
3438 int timecheck_counter = 0;
3439 core::map<v2s16, MapSector*>::Iterator si;
3440 si = m_sectors.getIterator();
3441 for(; si.atEnd() == false; si++)
3444 timecheck_counter++;
3445 if(timecheck_counter > 50)
3447 timecheck_counter = 0;
3448 int time2 = time(0);
3449 if(time2 > time1 + 4)
3451 dstream<<"ClientMap::renderMap(): "
3452 "Rendering takes ages, returning."
3459 MapSector *sector = si.getNode()->getValue();
3460 v2s16 sp = sector->getPos();
3462 if(m_control.range_all == false)
3464 if(sp.X < p_blocks_min.X
3465 || sp.X > p_blocks_max.X
3466 || sp.Y < p_blocks_min.Z
3467 || sp.Y > p_blocks_max.Z)
3471 core::list< MapBlock * > sectorblocks;
3472 sector->getBlocks(sectorblocks);
3478 u32 sector_blocks_drawn = 0;
3480 core::list< MapBlock * >::Iterator i;
3481 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3483 MapBlock *block = *i;
3486 Compare block position to camera position, skip
3487 if not seen on display
3490 float range = 100000 * BS;
3491 if(m_control.range_all == false)
3492 range = m_control.wanted_range * BS;
3495 if(isBlockInSight(block->getPos(), camera_position,
3496 camera_direction, range, &d) == false)
3501 // Okay, this block will be drawn. Reset usage timer.
3502 block->resetUsageTimer();
3504 // This is ugly (spherical distance limit?)
3505 /*if(m_control.range_all == false &&
3506 d - 0.5*BS*MAP_BLOCKSIZE > range)
3511 Update expired mesh (used for day/night change)
3513 It doesn't work exactly like it should now with the
3514 tasked mesh update but whatever.
3517 bool mesh_expired = false;
3520 JMutexAutoLock lock(block->mesh_mutex);
3522 mesh_expired = block->getMeshExpired();
3524 // Mesh has not been expired and there is no mesh:
3525 // block has no content
3526 if(block->mesh == NULL && mesh_expired == false)
3530 f32 faraway = BS*50;
3531 //f32 faraway = m_control.wanted_range * BS;
3534 This has to be done with the mesh_mutex unlocked
3536 // Pretty random but this should work somewhat nicely
3537 if(mesh_expired && (
3538 (mesh_update_count < 3
3539 && (d < faraway || mesh_update_count < 2)
3542 (m_control.range_all && mesh_update_count < 20)
3545 /*if(mesh_expired && mesh_update_count < 6
3546 && (d < faraway || mesh_update_count < 3))*/
3548 mesh_update_count++;
3550 // Mesh has been expired: generate new mesh
3551 //block->updateMesh(daynight_ratio);
3552 m_client->addUpdateMeshTask(block->getPos());
3554 mesh_expired = false;
3559 Draw the faces of the block
3562 JMutexAutoLock lock(block->mesh_mutex);
3564 scene::SMesh *mesh = block->mesh;
3569 blocks_would_have_drawn++;
3570 if(blocks_drawn >= m_control.wanted_max_blocks
3571 && m_control.range_all == false
3572 && d > m_control.wanted_min_range * BS)
3576 sector_blocks_drawn++;
3578 u32 c = mesh->getMeshBufferCount();
3580 for(u32 i=0; i<c; i++)
3582 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3583 const video::SMaterial& material = buf->getMaterial();
3584 video::IMaterialRenderer* rnd =
3585 driver->getMaterialRenderer(material.MaterialType);
3586 bool transparent = (rnd && rnd->isTransparent());
3587 // Render transparent on transparent pass and likewise.
3588 if(transparent == is_transparent_pass)
3591 This *shouldn't* hurt too much because Irrlicht
3592 doesn't change opengl textures if the old
3593 material is set again.
3595 driver->setMaterial(buf->getMaterial());
3596 driver->drawMeshBuffer(buf);
3597 vertex_count += buf->getVertexCount();
3601 } // foreach sectorblocks
3603 if(sector_blocks_drawn != 0)
3605 m_last_drawn_sectors[sp] = true;
3609 m_control.blocks_drawn = blocks_drawn;
3610 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3612 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3613 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3616 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3617 core::map<v3s16, MapBlock*> *affected_blocks)
3619 bool changed = false;
3621 Add it to all blocks touching it
3624 v3s16(0,0,0), // this
3625 v3s16(0,0,1), // back
3626 v3s16(0,1,0), // top
3627 v3s16(1,0,0), // right
3628 v3s16(0,0,-1), // front
3629 v3s16(0,-1,0), // bottom
3630 v3s16(-1,0,0), // left
3632 for(u16 i=0; i<7; i++)
3634 v3s16 p2 = p + dirs[i];
3635 // Block position of neighbor (or requested) node
3636 v3s16 blockpos = getNodeBlockPos(p2);
3637 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3638 if(blockref == NULL)
3640 // Relative position of requested node
3641 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3642 if(blockref->setTempMod(relpos, mod))
3647 if(changed && affected_blocks!=NULL)
3649 for(u16 i=0; i<7; i++)
3651 v3s16 p2 = p + dirs[i];
3652 // Block position of neighbor (or requested) node
3653 v3s16 blockpos = getNodeBlockPos(p2);
3654 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3655 if(blockref == NULL)
3657 affected_blocks->insert(blockpos, blockref);
3663 bool ClientMap::clearTempMod(v3s16 p,
3664 core::map<v3s16, MapBlock*> *affected_blocks)
3666 bool changed = false;
3668 v3s16(0,0,0), // this
3669 v3s16(0,0,1), // back
3670 v3s16(0,1,0), // top
3671 v3s16(1,0,0), // right
3672 v3s16(0,0,-1), // front
3673 v3s16(0,-1,0), // bottom
3674 v3s16(-1,0,0), // left
3676 for(u16 i=0; i<7; i++)
3678 v3s16 p2 = p + dirs[i];
3679 // Block position of neighbor (or requested) node
3680 v3s16 blockpos = getNodeBlockPos(p2);
3681 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3682 if(blockref == NULL)
3684 // Relative position of requested node
3685 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3686 if(blockref->clearTempMod(relpos))
3691 if(changed && affected_blocks!=NULL)
3693 for(u16 i=0; i<7; i++)
3695 v3s16 p2 = p + dirs[i];
3696 // Block position of neighbor (or requested) node
3697 v3s16 blockpos = getNodeBlockPos(p2);
3698 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3699 if(blockref == NULL)
3701 affected_blocks->insert(blockpos, blockref);
3707 void ClientMap::expireMeshes(bool only_daynight_diffed)
3709 TimeTaker timer("expireMeshes()");
3711 core::map<v2s16, MapSector*>::Iterator si;
3712 si = m_sectors.getIterator();
3713 for(; si.atEnd() == false; si++)
3715 MapSector *sector = si.getNode()->getValue();
3717 core::list< MapBlock * > sectorblocks;
3718 sector->getBlocks(sectorblocks);
3720 core::list< MapBlock * >::Iterator i;
3721 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3723 MapBlock *block = *i;
3725 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3731 JMutexAutoLock lock(block->mesh_mutex);
3732 if(block->mesh != NULL)
3734 /*block->mesh->drop();
3735 block->mesh = NULL;*/
3736 block->setMeshExpired(true);
3743 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3745 assert(mapType() == MAPTYPE_CLIENT);
3748 v3s16 p = blockpos + v3s16(0,0,0);
3749 MapBlock *b = getBlockNoCreate(p);
3750 b->updateMesh(daynight_ratio);
3751 //b->setMeshExpired(true);
3753 catch(InvalidPositionException &e){}
3756 v3s16 p = blockpos + v3s16(-1,0,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,-1,0);
3764 MapBlock *b = getBlockNoCreate(p);
3765 b->updateMesh(daynight_ratio);
3766 //b->setMeshExpired(true);
3768 catch(InvalidPositionException &e){}
3770 v3s16 p = blockpos + v3s16(0,0,-1);
3771 MapBlock *b = getBlockNoCreate(p);
3772 b->updateMesh(daynight_ratio);
3773 //b->setMeshExpired(true);
3775 catch(InvalidPositionException &e){}
3780 Update mesh of block in which the node is, and if the node is at the
3781 leading edge, update the appropriate leading blocks too.
3783 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3791 v3s16 blockposes[4];
3792 for(u32 i=0; i<4; i++)
3794 v3s16 np = nodepos + dirs[i];
3795 blockposes[i] = getNodeBlockPos(np);
3796 // Don't update mesh of block if it has been done already
3797 bool already_updated = false;
3798 for(u32 j=0; j<i; j++)
3800 if(blockposes[j] == blockposes[i])
3802 already_updated = true;
3809 MapBlock *b = getBlockNoCreate(blockposes[i]);
3810 b->updateMesh(daynight_ratio);
3815 void ClientMap::PrintInfo(std::ostream &out)
3826 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3831 MapVoxelManipulator::~MapVoxelManipulator()
3833 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3837 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3839 TimeTaker timer1("emerge", &emerge_time);
3841 // Units of these are MapBlocks
3842 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3843 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3845 VoxelArea block_area_nodes
3846 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3848 addArea(block_area_nodes);
3850 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3851 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3852 for(s32 x=p_min.X; x<=p_max.X; x++)
3855 core::map<v3s16, bool>::Node *n;
3856 n = m_loaded_blocks.find(p);
3860 bool block_data_inexistent = false;
3863 TimeTaker timer1("emerge load", &emerge_load_time);
3865 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3866 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3869 dstream<<std::endl;*/
3871 MapBlock *block = m_map->getBlockNoCreate(p);
3872 if(block->isDummy())
3873 block_data_inexistent = true;
3875 block->copyTo(*this);
3877 catch(InvalidPositionException &e)
3879 block_data_inexistent = true;
3882 if(block_data_inexistent)
3884 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3885 // Fill with VOXELFLAG_INEXISTENT
3886 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3887 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3889 s32 i = m_area.index(a.MinEdge.X,y,z);
3890 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3894 m_loaded_blocks.insert(p, !block_data_inexistent);
3897 //dstream<<"emerge done"<<std::endl;
3901 SUGG: Add an option to only update eg. water and air nodes.
3902 This will make it interfere less with important stuff if
3905 void MapVoxelManipulator::blitBack
3906 (core::map<v3s16, MapBlock*> & modified_blocks)
3908 if(m_area.getExtent() == v3s16(0,0,0))
3911 //TimeTaker timer1("blitBack");
3913 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3914 <<m_loaded_blocks.size()<<std::endl;*/
3917 Initialize block cache
3919 v3s16 blockpos_last;
3920 MapBlock *block = NULL;
3921 bool block_checked_in_modified = false;
3923 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3924 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3925 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3929 u8 f = m_flags[m_area.index(p)];
3930 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3933 MapNode &n = m_data[m_area.index(p)];
3935 v3s16 blockpos = getNodeBlockPos(p);
3940 if(block == NULL || blockpos != blockpos_last){
3941 block = m_map->getBlockNoCreate(blockpos);
3942 blockpos_last = blockpos;
3943 block_checked_in_modified = false;
3946 // Calculate relative position in block
3947 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
3949 // Don't continue if nothing has changed here
3950 if(block->getNode(relpos) == n)
3953 //m_map->setNode(m_area.MinEdge + p, n);
3954 block->setNode(relpos, n);
3957 Make sure block is in modified_blocks
3959 if(block_checked_in_modified == false)
3961 modified_blocks[blockpos] = block;
3962 block_checked_in_modified = true;
3965 catch(InvalidPositionException &e)
3971 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
3972 MapVoxelManipulator(map),
3973 m_create_area(false)
3977 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
3981 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3983 // Just create the area so that it can be pointed to
3984 VoxelManipulator::emerge(a, caller_id);
3987 void ManualMapVoxelManipulator::initialEmerge(
3988 v3s16 blockpos_min, v3s16 blockpos_max)
3990 TimeTaker timer1("initialEmerge", &emerge_time);
3992 // Units of these are MapBlocks
3993 v3s16 p_min = blockpos_min;
3994 v3s16 p_max = blockpos_max;
3996 VoxelArea block_area_nodes
3997 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3999 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
4002 dstream<<"initialEmerge: area: ";
4003 block_area_nodes.print(dstream);
4004 dstream<<" ("<<size_MB<<"MB)";
4008 addArea(block_area_nodes);
4010 for(s32 z=p_min.Z; z<=p_max.Z; z++)
4011 for(s32 y=p_min.Y; y<=p_max.Y; y++)
4012 for(s32 x=p_min.X; x<=p_max.X; x++)
4015 core::map<v3s16, bool>::Node *n;
4016 n = m_loaded_blocks.find(p);
4020 bool block_data_inexistent = false;
4023 TimeTaker timer1("emerge load", &emerge_load_time);
4025 MapBlock *block = m_map->getBlockNoCreate(p);
4026 if(block->isDummy())
4027 block_data_inexistent = true;
4029 block->copyTo(*this);
4031 catch(InvalidPositionException &e)
4033 block_data_inexistent = true;
4036 if(block_data_inexistent)
4039 Mark area inexistent
4041 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4042 // Fill with VOXELFLAG_INEXISTENT
4043 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4044 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4046 s32 i = m_area.index(a.MinEdge.X,y,z);
4047 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4051 m_loaded_blocks.insert(p, !block_data_inexistent);
4055 void ManualMapVoxelManipulator::blitBackAll(
4056 core::map<v3s16, MapBlock*> * modified_blocks)
4058 if(m_area.getExtent() == v3s16(0,0,0))
4062 Copy data of all blocks
4064 for(core::map<v3s16, bool>::Iterator
4065 i = m_loaded_blocks.getIterator();
4066 i.atEnd() == false; i++)
4068 bool existed = i.getNode()->getValue();
4069 if(existed == false)
4071 v3s16 p = i.getNode()->getKey();
4072 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4075 dstream<<"WARNING: "<<__FUNCTION_NAME
4076 <<": got NULL block "
4077 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4082 block->copyFrom(*this);
4085 modified_blocks->insert(p, block);