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);
2038 // Lighting won't be calculated
2039 block->setLightingExpired(true);
2040 // Lighting will be calculated
2041 //block->setLightingExpired(false);
2044 Block gets sunlight if this is true.
2046 This should be set to true when the top side of a block
2047 is completely exposed to the sky.
2049 block->setIsUnderground(false);
2055 Now we have a big empty area.
2057 Make a ManualMapVoxelManipulator that contains this and the
2061 v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2062 v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2064 data->vmanip = new ManualMapVoxelManipulator(this);
2065 //data->vmanip->setMap(this);
2069 //TimeTaker timer("initBlockMake() initialEmerge");
2070 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2073 // Data is ready now.
2076 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2077 core::map<v3s16, MapBlock*> &changed_blocks)
2079 v3s16 blockpos = data->blockpos;
2080 /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2081 <<blockpos.Z<<")"<<std::endl;*/
2085 dstream<<"finishBlockMake(): no-op"<<std::endl;
2089 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2091 /*dstream<<"Resulting vmanip:"<<std::endl;
2092 data->vmanip.print(dstream);*/
2095 Blit generated stuff to map
2096 NOTE: blitBackAll adds nearly everything to changed_blocks
2100 //TimeTaker timer("finishBlockMake() blitBackAll");
2101 data->vmanip->blitBackAll(&changed_blocks);
2104 if(enable_mapgen_debug_info)
2105 dstream<<"finishBlockMake: changed_blocks.size()="
2106 <<changed_blocks.size()<<std::endl;
2109 Copy transforming liquid information
2111 while(data->transforming_liquid.size() > 0)
2113 v3s16 p = data->transforming_liquid.pop_front();
2114 m_transforming_liquid.push_back(p);
2120 MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2124 Set is_underground flag for lighting with sunlight
2127 block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2130 Add sunlight to central block.
2131 This makes in-dark-spawning monsters to not flood the whole thing.
2132 Do not spread the light, though.
2134 /*core::map<v3s16, bool> light_sources;
2135 bool black_air_left = false;
2136 block->propagateSunlight(light_sources, true, &black_air_left);*/
2139 NOTE: Lighting and object adding shouldn't really be here, but
2140 lighting is a bit tricky to move properly to makeBlock.
2141 TODO: Do this the right way anyway, that is, move it to makeBlock.
2142 - There needs to be some way for makeBlock to report back if
2143 the lighting update is going further down because of the
2144 new block blocking light
2149 NOTE: This takes ~60ms, TODO: Investigate why
2152 TimeTaker t("finishBlockMake lighting update");
2154 core::map<v3s16, MapBlock*> lighting_update_blocks;
2156 lighting_update_blocks.insert(block->getPos(), block);
2158 // All modified blocks
2159 for(core::map<v3s16, MapBlock*>::Iterator
2160 i = changed_blocks.getIterator();
2161 i.atEnd() == false; i++)
2163 lighting_update_blocks.insert(i.getNode()->getKey(),
2164 i.getNode()->getValue());
2167 updateLighting(lighting_update_blocks, changed_blocks);
2169 if(enable_mapgen_debug_info == false)
2170 t.stop(true); // Hide output
2174 Add random objects to block
2176 mapgen::add_random_objects(block);
2179 Go through changed blocks
2181 for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2182 i.atEnd() == false; i++)
2184 MapBlock *block = i.getNode()->getValue();
2187 Update day/night difference cache of the MapBlocks
2189 block->updateDayNightDiff();
2191 Set block as modified
2193 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2197 Set central block as generated
2199 block->setGenerated(true);
2202 Save changed parts of map
2203 NOTE: Will be saved later.
2207 /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2208 <<blockpos.Z<<")"<<std::endl;*/
2213 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2215 DSTACKF("%s: p2d=(%d,%d)",
2220 Check if it exists already in memory
2222 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2227 Try to load it from disk (with blocks)
2229 //if(loadSectorFull(p2d) == true)
2232 Try to load metadata from disk
2234 if(loadSectorMeta(p2d) == true)
2236 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2239 dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2240 throw InvalidPositionException("");
2246 Do not create over-limit
2248 if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2249 || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2250 || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2251 || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2252 throw InvalidPositionException("createSector(): pos. over limit");
2255 Generate blank sector
2258 sector = new ServerMapSector(this, p2d);
2260 // Sector position on map in nodes
2261 v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2266 m_sectors.insert(p2d, sector);
2272 This is a quick-hand function for calling makeBlock().
2274 MapBlock * ServerMap::generateBlock(
2276 core::map<v3s16, MapBlock*> &modified_blocks
2279 DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2281 /*dstream<<"generateBlock(): "
2282 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2285 bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2287 TimeTaker timer("generateBlock");
2289 //MapBlock *block = original_dummy;
2291 v2s16 p2d(p.X, p.Z);
2292 v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2295 Do not generate over-limit
2297 if(blockpos_over_limit(p))
2299 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2300 throw InvalidPositionException("generateBlock(): pos. over limit");
2304 Create block make data
2306 mapgen::BlockMakeData data;
2307 initBlockMake(&data, p);
2313 TimeTaker t("mapgen::make_block()");
2314 mapgen::make_block(&data);
2316 if(enable_mapgen_debug_info == false)
2317 t.stop(true); // Hide output
2321 Blit data back on map, update lighting, add mobs and whatever this does
2323 finishBlockMake(&data, modified_blocks);
2328 MapBlock *block = getBlockNoCreateNoEx(p);
2335 bool erroneus_content = false;
2336 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2337 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2338 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2341 MapNode n = block->getNode(p);
2342 if(n.d == CONTENT_IGNORE)
2344 dstream<<"CONTENT_IGNORE at "
2345 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2347 erroneus_content = true;
2351 if(erroneus_content)
2359 Generate a completely empty block
2361 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2362 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2364 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2370 n.d = CONTENT_STONE;
2371 block->setNode(v3s16(x0,y0,z0), n);
2376 if(enable_mapgen_debug_info == false)
2377 timer.stop(true); // Hide output
2382 MapBlock * ServerMap::createBlock(v3s16 p)
2384 DSTACKF("%s: p=(%d,%d,%d)",
2385 __FUNCTION_NAME, p.X, p.Y, p.Z);
2388 Do not create over-limit
2390 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2391 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2392 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2393 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2394 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2395 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2396 throw InvalidPositionException("createBlock(): pos. over limit");
2398 v2s16 p2d(p.X, p.Z);
2401 This will create or load a sector if not found in memory.
2402 If block exists on disk, it will be loaded.
2404 NOTE: On old save formats, this will be slow, as it generates
2405 lighting on blocks for them.
2407 ServerMapSector *sector;
2409 sector = (ServerMapSector*)createSector(p2d);
2410 assert(sector->getId() == MAPSECTOR_SERVER);
2412 catch(InvalidPositionException &e)
2414 dstream<<"createBlock: createSector() failed"<<std::endl;
2418 NOTE: This should not be done, or at least the exception
2419 should not be passed on as std::exception, because it
2420 won't be catched at all.
2422 /*catch(std::exception &e)
2424 dstream<<"createBlock: createSector() failed: "
2425 <<e.what()<<std::endl;
2430 Try to get a block from the sector
2433 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2436 if(block->isDummy())
2441 block = sector->createBlankBlock(block_y);
2445 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2447 DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2449 p.X, p.Y, p.Z, allow_generate);
2452 MapBlock *block = getBlockNoCreateNoEx(p);
2458 MapBlock *block = loadBlock(p);
2465 core::map<v3s16, MapBlock*> modified_blocks;
2466 MapBlock *block = generateBlock(p, modified_blocks);
2470 event.type = MEET_OTHER;
2473 // Copy modified_blocks to event
2474 for(core::map<v3s16, MapBlock*>::Iterator
2475 i = modified_blocks.getIterator();
2476 i.atEnd()==false; i++)
2478 event.modified_blocks.insert(i.getNode()->getKey(), false);
2482 dispatchEvent(&event);
2493 Do not generate over-limit
2495 if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2496 || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2497 || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2498 || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2499 || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2500 || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2501 throw InvalidPositionException("emergeBlock(): pos. over limit");
2503 v2s16 p2d(p.X, p.Z);
2506 This will create or load a sector if not found in memory.
2507 If block exists on disk, it will be loaded.
2509 ServerMapSector *sector;
2511 sector = createSector(p2d);
2512 //sector = emergeSector(p2d, changed_blocks);
2514 catch(InvalidPositionException &e)
2516 dstream<<"emergeBlock: createSector() failed: "
2517 <<e.what()<<std::endl;
2518 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2520 <<"You could try to delete it."<<std::endl;
2523 catch(VersionMismatchException &e)
2525 dstream<<"emergeBlock: createSector() failed: "
2526 <<e.what()<<std::endl;
2527 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2529 <<"You could try to delete it."<<std::endl;
2534 Try to get a block from the sector
2537 bool does_not_exist = false;
2538 bool lighting_expired = false;
2539 MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2541 // If not found, try loading from disk
2544 block = loadBlock(p);
2550 does_not_exist = true;
2552 else if(block->isDummy() == true)
2554 does_not_exist = true;
2556 else if(block->getLightingExpired())
2558 lighting_expired = true;
2563 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2568 If block was not found on disk and not going to generate a
2569 new one, make sure there is a dummy block in place.
2571 if(only_from_disk && (does_not_exist || lighting_expired))
2573 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2577 // Create dummy block
2578 block = new MapBlock(this, p, true);
2580 // Add block to sector
2581 sector->insertBlock(block);
2587 //dstream<<"Not found on disk, generating."<<std::endl;
2589 //TimeTaker("emergeBlock() generate");
2591 //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2594 If the block doesn't exist, generate the block.
2598 block = generateBlock(p, block, sector, changed_blocks,
2599 lighting_invalidated_blocks);
2602 if(lighting_expired)
2604 lighting_invalidated_blocks.insert(p, block);
2609 Initially update sunlight
2612 core::map<v3s16, bool> light_sources;
2613 bool black_air_left = false;
2614 bool bottom_invalid =
2615 block->propagateSunlight(light_sources, true,
2618 // If sunlight didn't reach everywhere and part of block is
2619 // above ground, lighting has to be properly updated
2620 //if(black_air_left && some_part_underground)
2623 lighting_invalidated_blocks[block->getPos()] = block;
2628 lighting_invalidated_blocks[block->getPos()] = block;
2637 s16 ServerMap::findGroundLevel(v2s16 p2d)
2641 Uh, just do something random...
2643 // Find existing map from top to down
2646 v3s16 p(p2d.X, max, p2d.Y);
2647 for(; p.Y>min; p.Y--)
2649 MapNode n = getNodeNoEx(p);
2650 if(n.d != CONTENT_IGNORE)
2655 // If this node is not air, go to plan b
2656 if(getNodeNoEx(p).d != CONTENT_AIR)
2658 // Search existing walkable and return it
2659 for(; p.Y>min; p.Y--)
2661 MapNode n = getNodeNoEx(p);
2662 if(content_walkable(n.d) && n.d != CONTENT_IGNORE)
2671 Determine from map generator noise functions
2674 s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2677 //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2678 //return (s16)level;
2681 void ServerMap::createDirs(std::string path)
2683 if(fs::CreateAllDirs(path) == false)
2685 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2686 <<"\""<<path<<"\""<<std::endl;
2687 throw BaseException("ServerMap failed to create directory");
2691 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2697 snprintf(cc, 9, "%.4x%.4x",
2698 (unsigned int)pos.X&0xffff,
2699 (unsigned int)pos.Y&0xffff);
2701 return m_savedir + "/sectors/" + cc;
2703 snprintf(cc, 9, "%.3x/%.3x",
2704 (unsigned int)pos.X&0xfff,
2705 (unsigned int)pos.Y&0xfff);
2707 return m_savedir + "/sectors2/" + cc;
2713 v2s16 ServerMap::getSectorPos(std::string dirname)
2717 size_t spos = dirname.rfind('/') + 1;
2718 assert(spos != std::string::npos);
2719 if(dirname.size() - spos == 8)
2722 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2724 else if(dirname.size() - spos == 3)
2727 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2728 // Sign-extend the 12 bit values up to 16 bits...
2729 if(x&0x800) x|=0xF000;
2730 if(y&0x800) y|=0xF000;
2737 v2s16 pos((s16)x, (s16)y);
2741 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2743 v2s16 p2d = getSectorPos(sectordir);
2745 if(blockfile.size() != 4){
2746 throw InvalidFilenameException("Invalid block filename");
2749 int r = sscanf(blockfile.c_str(), "%4x", &y);
2751 throw InvalidFilenameException("Invalid block filename");
2752 return v3s16(p2d.X, y, p2d.Y);
2755 std::string ServerMap::getBlockFilename(v3s16 p)
2758 snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2762 void ServerMap::save(bool only_changed)
2764 DSTACK(__FUNCTION_NAME);
2765 if(m_map_saving_enabled == false)
2767 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2771 if(only_changed == false)
2772 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2775 if(only_changed == false || m_map_metadata_changed)
2780 u32 sector_meta_count = 0;
2781 u32 block_count = 0;
2782 u32 block_count_all = 0; // Number of blocks in memory
2784 core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2785 for(; i.atEnd() == false; i++)
2787 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2788 assert(sector->getId() == MAPSECTOR_SERVER);
2790 if(sector->differs_from_disk || only_changed == false)
2792 saveSectorMeta(sector);
2793 sector_meta_count++;
2795 core::list<MapBlock*> blocks;
2796 sector->getBlocks(blocks);
2797 core::list<MapBlock*>::Iterator j;
2798 for(j=blocks.begin(); j!=blocks.end(); j++)
2800 MapBlock *block = *j;
2804 if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2805 || only_changed == false)
2810 /*dstream<<"ServerMap: Written block ("
2811 <<block->getPos().X<<","
2812 <<block->getPos().Y<<","
2813 <<block->getPos().Z<<")"
2820 Only print if something happened or saved whole map
2822 if(only_changed == false || sector_meta_count != 0
2823 || block_count != 0)
2825 dstream<<DTIME<<"ServerMap: Written: "
2826 <<sector_meta_count<<" sector metadata files, "
2827 <<block_count<<" block files"
2828 <<", "<<block_count_all<<" blocks in memory."
2833 void ServerMap::saveMapMeta()
2835 DSTACK(__FUNCTION_NAME);
2837 dstream<<"INFO: ServerMap::saveMapMeta(): "
2841 createDirs(m_savedir);
2843 std::string fullpath = m_savedir + "/map_meta.txt";
2844 std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2845 if(os.good() == false)
2847 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2848 <<"could not open"<<fullpath<<std::endl;
2849 throw FileNotGoodException("Cannot open chunk metadata");
2853 params.setU64("seed", m_seed);
2855 params.writeLines(os);
2857 os<<"[end_of_params]\n";
2859 m_map_metadata_changed = false;
2862 void ServerMap::loadMapMeta()
2864 DSTACK(__FUNCTION_NAME);
2866 dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2869 std::string fullpath = m_savedir + "/map_meta.txt";
2870 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2871 if(is.good() == false)
2873 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2874 <<"could not open"<<fullpath<<std::endl;
2875 throw FileNotGoodException("Cannot open map metadata");
2883 throw SerializationError
2884 ("ServerMap::loadMapMeta(): [end_of_params] not found");
2886 std::getline(is, line);
2887 std::string trimmedline = trim(line);
2888 if(trimmedline == "[end_of_params]")
2890 params.parseConfigLine(line);
2893 m_seed = params.getU64("seed");
2895 dstream<<"INFO: ServerMap::loadMapMeta(): "
2900 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2902 DSTACK(__FUNCTION_NAME);
2903 // Format used for writing
2904 u8 version = SER_FMT_VER_HIGHEST;
2906 v2s16 pos = sector->getPos();
2907 std::string dir = getSectorDir(pos);
2910 std::string fullpath = dir + "/meta";
2911 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2912 if(o.good() == false)
2913 throw FileNotGoodException("Cannot open sector metafile");
2915 sector->serialize(o, version);
2917 sector->differs_from_disk = false;
2920 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
2922 DSTACK(__FUNCTION_NAME);
2924 v2s16 p2d = getSectorPos(sectordir);
2926 ServerMapSector *sector = NULL;
2928 std::string fullpath = sectordir + "/meta";
2929 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2930 if(is.good() == false)
2932 // If the directory exists anyway, it probably is in some old
2933 // format. Just go ahead and create the sector.
2934 if(fs::PathExists(sectordir))
2936 /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
2937 <<fullpath<<" doesn't exist but directory does."
2938 <<" Continuing with a sector with no metadata."
2940 sector = new ServerMapSector(this, p2d);
2941 m_sectors.insert(p2d, sector);
2945 throw FileNotGoodException("Cannot open sector metafile");
2950 sector = ServerMapSector::deSerialize
2951 (is, this, p2d, m_sectors);
2953 saveSectorMeta(sector);
2956 sector->differs_from_disk = false;
2961 bool ServerMap::loadSectorMeta(v2s16 p2d)
2963 DSTACK(__FUNCTION_NAME);
2965 MapSector *sector = NULL;
2967 // The directory layout we're going to load from.
2968 // 1 - original sectors/xxxxzzzz/
2969 // 2 - new sectors2/xxx/zzz/
2970 // If we load from anything but the latest structure, we will
2971 // immediately save to the new one, and remove the old.
2973 std::string sectordir1 = getSectorDir(p2d, 1);
2974 std::string sectordir;
2975 if(fs::PathExists(sectordir1))
2977 sectordir = sectordir1;
2982 sectordir = getSectorDir(p2d, 2);
2986 sector = loadSectorMeta(sectordir, loadlayout != 2);
2988 catch(InvalidFilenameException &e)
2992 catch(FileNotGoodException &e)
2996 catch(std::exception &e)
3005 bool ServerMap::loadSectorFull(v2s16 p2d)
3007 DSTACK(__FUNCTION_NAME);
3009 MapSector *sector = NULL;
3011 // The directory layout we're going to load from.
3012 // 1 - original sectors/xxxxzzzz/
3013 // 2 - new sectors2/xxx/zzz/
3014 // If we load from anything but the latest structure, we will
3015 // immediately save to the new one, and remove the old.
3017 std::string sectordir1 = getSectorDir(p2d, 1);
3018 std::string sectordir;
3019 if(fs::PathExists(sectordir1))
3021 sectordir = sectordir1;
3026 sectordir = getSectorDir(p2d, 2);
3030 sector = loadSectorMeta(sectordir, loadlayout != 2);
3032 catch(InvalidFilenameException &e)
3036 catch(FileNotGoodException &e)
3040 catch(std::exception &e)
3048 std::vector<fs::DirListNode> list2 = fs::GetDirListing
3050 std::vector<fs::DirListNode>::iterator i2;
3051 for(i2=list2.begin(); i2!=list2.end(); i2++)
3057 loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3059 catch(InvalidFilenameException &e)
3061 // This catches unknown crap in directory
3067 dstream<<"Sector converted to new layout - deleting "<<
3068 sectordir1<<std::endl;
3069 fs::RecursiveDelete(sectordir1);
3076 void ServerMap::saveBlock(MapBlock *block)
3078 DSTACK(__FUNCTION_NAME);
3080 Dummy blocks are not written
3082 if(block->isDummy())
3084 /*v3s16 p = block->getPos();
3085 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3086 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3090 // Format used for writing
3091 u8 version = SER_FMT_VER_HIGHEST;
3093 v3s16 p3d = block->getPos();
3095 v2s16 p2d(p3d.X, p3d.Z);
3096 std::string sectordir = getSectorDir(p2d);
3098 createDirs(sectordir);
3100 std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3101 std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3102 if(o.good() == false)
3103 throw FileNotGoodException("Cannot open block data");
3106 [0] u8 serialization version
3109 o.write((char*)&version, 1);
3112 block->serialize(o, version);
3114 // Write extra data stored on disk
3115 block->serializeDiskExtra(o, version);
3117 // We just wrote it to the disk so clear modified flag
3118 block->resetModified();
3121 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3123 DSTACK(__FUNCTION_NAME);
3125 std::string fullpath = sectordir+"/"+blockfile;
3128 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3129 if(is.good() == false)
3130 throw FileNotGoodException("Cannot open block file");
3132 v3s16 p3d = getBlockPos(sectordir, blockfile);
3133 v2s16 p2d(p3d.X, p3d.Z);
3135 assert(sector->getPos() == p2d);
3137 u8 version = SER_FMT_VER_INVALID;
3138 is.read((char*)&version, 1);
3141 throw SerializationError("ServerMap::loadBlock(): Failed"
3142 " to read MapBlock version");
3144 /*u32 block_size = MapBlock::serializedLength(version);
3145 SharedBuffer<u8> data(block_size);
3146 is.read((char*)*data, block_size);*/
3148 // This will always return a sector because we're the server
3149 //MapSector *sector = emergeSector(p2d);
3151 MapBlock *block = NULL;
3152 bool created_new = false;
3153 block = sector->getBlockNoCreateNoEx(p3d.Y);
3156 block = sector->createBlankBlockNoInsert(p3d.Y);
3161 block->deSerialize(is, version);
3163 // Read extra data stored on disk
3164 block->deSerializeDiskExtra(is, version);
3166 // If it's a new block, insert it to the map
3168 sector->insertBlock(block);
3171 Save blocks loaded in old format in new format
3174 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3179 // We just loaded it from the disk, so it's up-to-date.
3180 block->resetModified();
3183 catch(SerializationError &e)
3185 dstream<<"WARNING: Invalid block data on disk "
3186 <<"fullpath="<<fullpath
3187 <<" (SerializationError). "
3188 <<"what()="<<e.what()
3190 //" Ignoring. A new one will be generated.
3193 // TODO: Backup file; name is in fullpath.
3197 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3199 DSTACK(__FUNCTION_NAME);
3201 v2s16 p2d(blockpos.X, blockpos.Z);
3203 // The directory layout we're going to load from.
3204 // 1 - original sectors/xxxxzzzz/
3205 // 2 - new sectors2/xxx/zzz/
3206 // If we load from anything but the latest structure, we will
3207 // immediately save to the new one, and remove the old.
3209 std::string sectordir1 = getSectorDir(p2d, 1);
3210 std::string sectordir;
3211 if(fs::PathExists(sectordir1))
3213 sectordir = sectordir1;
3218 sectordir = getSectorDir(p2d, 2);
3222 Make sure sector is loaded
3224 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3228 sector = loadSectorMeta(sectordir, loadlayout != 2);
3230 catch(InvalidFilenameException &e)
3234 catch(FileNotGoodException &e)
3238 catch(std::exception &e)
3245 Make sure file exists
3248 std::string blockfilename = getBlockFilename(blockpos);
3249 if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3255 loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3256 return getBlockNoCreateNoEx(blockpos);
3259 void ServerMap::PrintInfo(std::ostream &out)
3270 ClientMap::ClientMap(
3272 MapDrawControl &control,
3273 scene::ISceneNode* parent,
3274 scene::ISceneManager* mgr,
3278 scene::ISceneNode(parent, mgr, id),
3281 m_camera_position(0,0,0),
3282 m_camera_direction(0,0,1)
3284 m_camera_mutex.Init();
3285 assert(m_camera_mutex.IsInitialized());
3287 m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3288 BS*1000000,BS*1000000,BS*1000000);
3291 ClientMap::~ClientMap()
3293 /*JMutexAutoLock lock(mesh_mutex);
3302 MapSector * ClientMap::emergeSector(v2s16 p2d)
3304 DSTACK(__FUNCTION_NAME);
3305 // Check that it doesn't exist already
3307 return getSectorNoGenerate(p2d);
3309 catch(InvalidPositionException &e)
3314 ClientMapSector *sector = new ClientMapSector(this, p2d);
3317 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3318 m_sectors.insert(p2d, sector);
3325 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3327 DSTACK(__FUNCTION_NAME);
3328 ClientMapSector *sector = NULL;
3330 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3332 core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3336 sector = (ClientMapSector*)n->getValue();
3337 assert(sector->getId() == MAPSECTOR_CLIENT);
3341 sector = new ClientMapSector(this, p2d);
3343 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3344 m_sectors.insert(p2d, sector);
3348 sector->deSerialize(is);
3352 void ClientMap::OnRegisterSceneNode()
3356 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3357 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3360 ISceneNode::OnRegisterSceneNode();
3363 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3365 //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3366 DSTACK(__FUNCTION_NAME);
3368 bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3371 This is called two times per frame, reset on the non-transparent one
3373 if(pass == scene::ESNRP_SOLID)
3375 m_last_drawn_sectors.clear();
3379 Get time for measuring timeout.
3381 Measuring time is very useful for long delays when the
3382 machine is swapping a lot.
3384 int time1 = time(0);
3386 //u32 daynight_ratio = m_client->getDayNightRatio();
3388 m_camera_mutex.Lock();
3389 v3f camera_position = m_camera_position;
3390 v3f camera_direction = m_camera_direction;
3391 m_camera_mutex.Unlock();
3394 Get all blocks and draw all visible ones
3397 v3s16 cam_pos_nodes(
3398 camera_position.X / BS,
3399 camera_position.Y / BS,
3400 camera_position.Z / BS);
3402 v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3404 v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3405 v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3407 // Take a fair amount as we will be dropping more out later
3409 p_nodes_min.X / MAP_BLOCKSIZE - 2,
3410 p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3411 p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3413 p_nodes_max.X / MAP_BLOCKSIZE + 1,
3414 p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3415 p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3417 u32 vertex_count = 0;
3419 // For limiting number of mesh updates per frame
3420 u32 mesh_update_count = 0;
3422 u32 blocks_would_have_drawn = 0;
3423 u32 blocks_drawn = 0;
3425 int timecheck_counter = 0;
3426 core::map<v2s16, MapSector*>::Iterator si;
3427 si = m_sectors.getIterator();
3428 for(; si.atEnd() == false; si++)
3431 timecheck_counter++;
3432 if(timecheck_counter > 50)
3434 timecheck_counter = 0;
3435 int time2 = time(0);
3436 if(time2 > time1 + 4)
3438 dstream<<"ClientMap::renderMap(): "
3439 "Rendering takes ages, returning."
3446 MapSector *sector = si.getNode()->getValue();
3447 v2s16 sp = sector->getPos();
3449 if(m_control.range_all == false)
3451 if(sp.X < p_blocks_min.X
3452 || sp.X > p_blocks_max.X
3453 || sp.Y < p_blocks_min.Z
3454 || sp.Y > p_blocks_max.Z)
3458 core::list< MapBlock * > sectorblocks;
3459 sector->getBlocks(sectorblocks);
3465 u32 sector_blocks_drawn = 0;
3467 core::list< MapBlock * >::Iterator i;
3468 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3470 MapBlock *block = *i;
3473 Compare block position to camera position, skip
3474 if not seen on display
3477 float range = 100000 * BS;
3478 if(m_control.range_all == false)
3479 range = m_control.wanted_range * BS;
3482 if(isBlockInSight(block->getPos(), camera_position,
3483 camera_direction, range, &d) == false)
3488 // Okay, this block will be drawn. Reset usage timer.
3489 block->resetUsageTimer();
3491 // This is ugly (spherical distance limit?)
3492 /*if(m_control.range_all == false &&
3493 d - 0.5*BS*MAP_BLOCKSIZE > range)
3498 Update expired mesh (used for day/night change)
3500 It doesn't work exactly like it should now with the
3501 tasked mesh update but whatever.
3504 bool mesh_expired = false;
3507 JMutexAutoLock lock(block->mesh_mutex);
3509 mesh_expired = block->getMeshExpired();
3511 // Mesh has not been expired and there is no mesh:
3512 // block has no content
3513 if(block->mesh == NULL && mesh_expired == false)
3517 f32 faraway = BS*50;
3518 //f32 faraway = m_control.wanted_range * BS;
3521 This has to be done with the mesh_mutex unlocked
3523 // Pretty random but this should work somewhat nicely
3524 if(mesh_expired && (
3525 (mesh_update_count < 3
3526 && (d < faraway || mesh_update_count < 2)
3529 (m_control.range_all && mesh_update_count < 20)
3532 /*if(mesh_expired && mesh_update_count < 6
3533 && (d < faraway || mesh_update_count < 3))*/
3535 mesh_update_count++;
3537 // Mesh has been expired: generate new mesh
3538 //block->updateMesh(daynight_ratio);
3539 m_client->addUpdateMeshTask(block->getPos());
3541 mesh_expired = false;
3546 Draw the faces of the block
3549 JMutexAutoLock lock(block->mesh_mutex);
3551 scene::SMesh *mesh = block->mesh;
3556 blocks_would_have_drawn++;
3557 if(blocks_drawn >= m_control.wanted_max_blocks
3558 && m_control.range_all == false
3559 && d > m_control.wanted_min_range * BS)
3563 sector_blocks_drawn++;
3565 u32 c = mesh->getMeshBufferCount();
3567 for(u32 i=0; i<c; i++)
3569 scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3570 const video::SMaterial& material = buf->getMaterial();
3571 video::IMaterialRenderer* rnd =
3572 driver->getMaterialRenderer(material.MaterialType);
3573 bool transparent = (rnd && rnd->isTransparent());
3574 // Render transparent on transparent pass and likewise.
3575 if(transparent == is_transparent_pass)
3578 This *shouldn't* hurt too much because Irrlicht
3579 doesn't change opengl textures if the old
3580 material is set again.
3582 driver->setMaterial(buf->getMaterial());
3583 driver->drawMeshBuffer(buf);
3584 vertex_count += buf->getVertexCount();
3588 } // foreach sectorblocks
3590 if(sector_blocks_drawn != 0)
3592 m_last_drawn_sectors[sp] = true;
3596 m_control.blocks_drawn = blocks_drawn;
3597 m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3599 /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3600 <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3603 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3604 core::map<v3s16, MapBlock*> *affected_blocks)
3606 bool changed = false;
3608 Add it to all blocks touching it
3611 v3s16(0,0,0), // this
3612 v3s16(0,0,1), // back
3613 v3s16(0,1,0), // top
3614 v3s16(1,0,0), // right
3615 v3s16(0,0,-1), // front
3616 v3s16(0,-1,0), // bottom
3617 v3s16(-1,0,0), // left
3619 for(u16 i=0; i<7; i++)
3621 v3s16 p2 = p + dirs[i];
3622 // Block position of neighbor (or requested) node
3623 v3s16 blockpos = getNodeBlockPos(p2);
3624 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3625 if(blockref == NULL)
3627 // Relative position of requested node
3628 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3629 if(blockref->setTempMod(relpos, mod))
3634 if(changed && affected_blocks!=NULL)
3636 for(u16 i=0; i<7; i++)
3638 v3s16 p2 = p + dirs[i];
3639 // Block position of neighbor (or requested) node
3640 v3s16 blockpos = getNodeBlockPos(p2);
3641 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3642 if(blockref == NULL)
3644 affected_blocks->insert(blockpos, blockref);
3650 bool ClientMap::clearTempMod(v3s16 p,
3651 core::map<v3s16, MapBlock*> *affected_blocks)
3653 bool changed = false;
3655 v3s16(0,0,0), // this
3656 v3s16(0,0,1), // back
3657 v3s16(0,1,0), // top
3658 v3s16(1,0,0), // right
3659 v3s16(0,0,-1), // front
3660 v3s16(0,-1,0), // bottom
3661 v3s16(-1,0,0), // left
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 // Relative position of requested node
3672 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3673 if(blockref->clearTempMod(relpos))
3678 if(changed && affected_blocks!=NULL)
3680 for(u16 i=0; i<7; i++)
3682 v3s16 p2 = p + dirs[i];
3683 // Block position of neighbor (or requested) node
3684 v3s16 blockpos = getNodeBlockPos(p2);
3685 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3686 if(blockref == NULL)
3688 affected_blocks->insert(blockpos, blockref);
3694 void ClientMap::expireMeshes(bool only_daynight_diffed)
3696 TimeTaker timer("expireMeshes()");
3698 core::map<v2s16, MapSector*>::Iterator si;
3699 si = m_sectors.getIterator();
3700 for(; si.atEnd() == false; si++)
3702 MapSector *sector = si.getNode()->getValue();
3704 core::list< MapBlock * > sectorblocks;
3705 sector->getBlocks(sectorblocks);
3707 core::list< MapBlock * >::Iterator i;
3708 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3710 MapBlock *block = *i;
3712 if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3718 JMutexAutoLock lock(block->mesh_mutex);
3719 if(block->mesh != NULL)
3721 /*block->mesh->drop();
3722 block->mesh = NULL;*/
3723 block->setMeshExpired(true);
3730 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3732 assert(mapType() == MAPTYPE_CLIENT);
3735 v3s16 p = blockpos + v3s16(0,0,0);
3736 MapBlock *b = getBlockNoCreate(p);
3737 b->updateMesh(daynight_ratio);
3738 //b->setMeshExpired(true);
3740 catch(InvalidPositionException &e){}
3743 v3s16 p = blockpos + v3s16(-1,0,0);
3744 MapBlock *b = getBlockNoCreate(p);
3745 b->updateMesh(daynight_ratio);
3746 //b->setMeshExpired(true);
3748 catch(InvalidPositionException &e){}
3750 v3s16 p = blockpos + v3s16(0,-1,0);
3751 MapBlock *b = getBlockNoCreate(p);
3752 b->updateMesh(daynight_ratio);
3753 //b->setMeshExpired(true);
3755 catch(InvalidPositionException &e){}
3757 v3s16 p = blockpos + v3s16(0,0,-1);
3758 MapBlock *b = getBlockNoCreate(p);
3759 b->updateMesh(daynight_ratio);
3760 //b->setMeshExpired(true);
3762 catch(InvalidPositionException &e){}
3767 Update mesh of block in which the node is, and if the node is at the
3768 leading edge, update the appropriate leading blocks too.
3770 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3778 v3s16 blockposes[4];
3779 for(u32 i=0; i<4; i++)
3781 v3s16 np = nodepos + dirs[i];
3782 blockposes[i] = getNodeBlockPos(np);
3783 // Don't update mesh of block if it has been done already
3784 bool already_updated = false;
3785 for(u32 j=0; j<i; j++)
3787 if(blockposes[j] == blockposes[i])
3789 already_updated = true;
3796 MapBlock *b = getBlockNoCreate(blockposes[i]);
3797 b->updateMesh(daynight_ratio);
3802 void ClientMap::PrintInfo(std::ostream &out)
3813 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3818 MapVoxelManipulator::~MapVoxelManipulator()
3820 /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3824 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3826 TimeTaker timer1("emerge", &emerge_time);
3828 // Units of these are MapBlocks
3829 v3s16 p_min = getNodeBlockPos(a.MinEdge);
3830 v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3832 VoxelArea block_area_nodes
3833 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3835 addArea(block_area_nodes);
3837 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3838 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3839 for(s32 x=p_min.X; x<=p_max.X; x++)
3842 core::map<v3s16, bool>::Node *n;
3843 n = m_loaded_blocks.find(p);
3847 bool block_data_inexistent = false;
3850 TimeTaker timer1("emerge load", &emerge_load_time);
3852 /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3853 <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3856 dstream<<std::endl;*/
3858 MapBlock *block = m_map->getBlockNoCreate(p);
3859 if(block->isDummy())
3860 block_data_inexistent = true;
3862 block->copyTo(*this);
3864 catch(InvalidPositionException &e)
3866 block_data_inexistent = true;
3869 if(block_data_inexistent)
3871 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3872 // Fill with VOXELFLAG_INEXISTENT
3873 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3874 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3876 s32 i = m_area.index(a.MinEdge.X,y,z);
3877 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3881 m_loaded_blocks.insert(p, !block_data_inexistent);
3884 //dstream<<"emerge done"<<std::endl;
3888 SUGG: Add an option to only update eg. water and air nodes.
3889 This will make it interfere less with important stuff if
3892 void MapVoxelManipulator::blitBack
3893 (core::map<v3s16, MapBlock*> & modified_blocks)
3895 if(m_area.getExtent() == v3s16(0,0,0))
3898 //TimeTaker timer1("blitBack");
3900 /*dstream<<"blitBack(): m_loaded_blocks.size()="
3901 <<m_loaded_blocks.size()<<std::endl;*/
3904 Initialize block cache
3906 v3s16 blockpos_last;
3907 MapBlock *block = NULL;
3908 bool block_checked_in_modified = false;
3910 for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3911 for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3912 for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3916 u8 f = m_flags[m_area.index(p)];
3917 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3920 MapNode &n = m_data[m_area.index(p)];
3922 v3s16 blockpos = getNodeBlockPos(p);
3927 if(block == NULL || blockpos != blockpos_last){
3928 block = m_map->getBlockNoCreate(blockpos);
3929 blockpos_last = blockpos;
3930 block_checked_in_modified = false;
3933 // Calculate relative position in block
3934 v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
3936 // Don't continue if nothing has changed here
3937 if(block->getNode(relpos) == n)
3940 //m_map->setNode(m_area.MinEdge + p, n);
3941 block->setNode(relpos, n);
3944 Make sure block is in modified_blocks
3946 if(block_checked_in_modified == false)
3948 modified_blocks[blockpos] = block;
3949 block_checked_in_modified = true;
3952 catch(InvalidPositionException &e)
3958 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
3959 MapVoxelManipulator(map),
3960 m_create_area(false)
3964 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
3968 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3970 // Just create the area so that it can be pointed to
3971 VoxelManipulator::emerge(a, caller_id);
3974 void ManualMapVoxelManipulator::initialEmerge(
3975 v3s16 blockpos_min, v3s16 blockpos_max)
3977 TimeTaker timer1("initialEmerge", &emerge_time);
3979 // Units of these are MapBlocks
3980 v3s16 p_min = blockpos_min;
3981 v3s16 p_max = blockpos_max;
3983 VoxelArea block_area_nodes
3984 (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3986 u32 size_MB = block_area_nodes.getVolume()*4/1000000;
3989 dstream<<"initialEmerge: area: ";
3990 block_area_nodes.print(dstream);
3991 dstream<<" ("<<size_MB<<"MB)";
3995 addArea(block_area_nodes);
3997 for(s32 z=p_min.Z; z<=p_max.Z; z++)
3998 for(s32 y=p_min.Y; y<=p_max.Y; y++)
3999 for(s32 x=p_min.X; x<=p_max.X; x++)
4002 core::map<v3s16, bool>::Node *n;
4003 n = m_loaded_blocks.find(p);
4007 bool block_data_inexistent = false;
4010 TimeTaker timer1("emerge load", &emerge_load_time);
4012 MapBlock *block = m_map->getBlockNoCreate(p);
4013 if(block->isDummy())
4014 block_data_inexistent = true;
4016 block->copyTo(*this);
4018 catch(InvalidPositionException &e)
4020 block_data_inexistent = true;
4023 if(block_data_inexistent)
4026 Mark area inexistent
4028 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4029 // Fill with VOXELFLAG_INEXISTENT
4030 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4031 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4033 s32 i = m_area.index(a.MinEdge.X,y,z);
4034 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4038 m_loaded_blocks.insert(p, !block_data_inexistent);
4042 void ManualMapVoxelManipulator::blitBackAll(
4043 core::map<v3s16, MapBlock*> * modified_blocks)
4045 if(m_area.getExtent() == v3s16(0,0,0))
4049 Copy data of all blocks
4051 for(core::map<v3s16, bool>::Iterator
4052 i = m_loaded_blocks.getIterator();
4053 i.atEnd() == false; i++)
4055 bool existed = i.getNode()->getValue();
4056 if(existed == false)
4058 v3s16 p = i.getNode()->getKey();
4059 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4062 dstream<<"WARNING: "<<__FUNCTION_NAME
4063 <<": got NULL block "
4064 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4069 block->copyFrom(*this);
4072 modified_blocks->insert(p, block);