]> git.lizzy.rs Git - dragonfireclient.git/blob - src/map.cpp
Added a mapblock analyzing function for debugging use and fixed remaining mapgen...
[dragonfireclient.git] / src / map.cpp
1 /*
2 Minetest-c55
3 Copyright (C) 2010-2011 celeron55, Perttu Ahola <celeron55@gmail.com>
4
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.
9
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.
14
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.
18 */
19
20 #include "map.h"
21 #include "mapsector.h"
22 #include "mapblock.h"
23 #include "main.h"
24 #include "client.h"
25 #include "filesys.h"
26 #include "utility.h"
27 #include "voxel.h"
28 #include "porting.h"
29 #include "mapgen.h"
30 #include "nodemetadata.h"
31
32 extern "C" {
33         #include "sqlite3.h"
34 }
35 /*
36         SQLite format specification:
37         - Initially only replaces sectors/ and sectors2/
38 */
39
40 /*
41         Map
42 */
43
44 Map::Map(std::ostream &dout):
45         m_dout(dout),
46         m_sector_cache(NULL)
47 {
48         /*m_sector_mutex.Init();
49         assert(m_sector_mutex.IsInitialized());*/
50 }
51
52 Map::~Map()
53 {
54         /*
55                 Free all MapSectors
56         */
57         core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
58         for(; i.atEnd() == false; i++)
59         {
60                 MapSector *sector = i.getNode()->getValue();
61                 delete sector;
62         }
63 }
64
65 void Map::addEventReceiver(MapEventReceiver *event_receiver)
66 {
67         m_event_receivers.insert(event_receiver, false);
68 }
69
70 void Map::removeEventReceiver(MapEventReceiver *event_receiver)
71 {
72         if(m_event_receivers.find(event_receiver) == NULL)
73                 return;
74         m_event_receivers.remove(event_receiver);
75 }
76
77 void Map::dispatchEvent(MapEditEvent *event)
78 {
79         for(core::map<MapEventReceiver*, bool>::Iterator
80                         i = m_event_receivers.getIterator();
81                         i.atEnd()==false; i++)
82         {
83                 MapEventReceiver* event_receiver = i.getNode()->getKey();
84                 event_receiver->onMapEditEvent(event);
85         }
86 }
87
88 MapSector * Map::getSectorNoGenerateNoExNoLock(v2s16 p)
89 {
90         if(m_sector_cache != NULL && p == m_sector_cache_p){
91                 MapSector * sector = m_sector_cache;
92                 return sector;
93         }
94         
95         core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p);
96         
97         if(n == NULL)
98                 return NULL;
99         
100         MapSector *sector = n->getValue();
101         
102         // Cache the last result
103         m_sector_cache_p = p;
104         m_sector_cache = sector;
105
106         return sector;
107 }
108
109 MapSector * Map::getSectorNoGenerateNoEx(v2s16 p)
110 {
111         return getSectorNoGenerateNoExNoLock(p);
112 }
113
114 MapSector * Map::getSectorNoGenerate(v2s16 p)
115 {
116         MapSector *sector = getSectorNoGenerateNoEx(p);
117         if(sector == NULL)
118                 throw InvalidPositionException();
119         
120         return sector;
121 }
122
123 MapBlock * Map::getBlockNoCreateNoEx(v3s16 p3d)
124 {
125         v2s16 p2d(p3d.X, p3d.Z);
126         MapSector * sector = getSectorNoGenerateNoEx(p2d);
127         if(sector == NULL)
128                 return NULL;
129         MapBlock *block = sector->getBlockNoCreateNoEx(p3d.Y);
130         return block;
131 }
132
133 MapBlock * Map::getBlockNoCreate(v3s16 p3d)
134 {       
135         MapBlock *block = getBlockNoCreateNoEx(p3d);
136         if(block == NULL)
137                 throw InvalidPositionException();
138         return block;
139 }
140
141 bool Map::isNodeUnderground(v3s16 p)
142 {
143         v3s16 blockpos = getNodeBlockPos(p);
144         try{
145                 MapBlock * block = getBlockNoCreate(blockpos);
146                 return block->getIsUnderground();
147         }
148         catch(InvalidPositionException &e)
149         {
150                 return false;
151         }
152 }
153
154 bool Map::isValidPosition(v3s16 p)
155 {
156         v3s16 blockpos = getNodeBlockPos(p);
157         MapBlock *block = getBlockNoCreate(blockpos);
158         return (block != NULL);
159 }
160
161 // Returns a CONTENT_IGNORE node if not found
162 MapNode Map::getNodeNoEx(v3s16 p)
163 {
164         v3s16 blockpos = getNodeBlockPos(p);
165         MapBlock *block = getBlockNoCreateNoEx(blockpos);
166         if(block == NULL)
167                 return MapNode(CONTENT_IGNORE);
168         v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
169         return block->getNodeNoCheck(relpos);
170 }
171
172 // throws InvalidPositionException if not found
173 MapNode Map::getNode(v3s16 p)
174 {
175         v3s16 blockpos = getNodeBlockPos(p);
176         MapBlock *block = getBlockNoCreateNoEx(blockpos);
177         if(block == NULL)
178                 throw InvalidPositionException();
179         v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
180         return block->getNodeNoCheck(relpos);
181 }
182
183 // throws InvalidPositionException if not found
184 void Map::setNode(v3s16 p, MapNode & n)
185 {
186         v3s16 blockpos = getNodeBlockPos(p);
187         MapBlock *block = getBlockNoCreate(blockpos);
188         v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
189         block->setNodeNoCheck(relpos, n);
190 }
191
192
193 /*
194         Goes recursively through the neighbours of the node.
195
196         Alters only transparent nodes.
197
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.
202
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.
207
208         values of from_nodes are lighting values.
209 */
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)
214 {
215         v3s16 dirs[6] = {
216                 v3s16(0,0,1), // back
217                 v3s16(0,1,0), // top
218                 v3s16(1,0,0), // right
219                 v3s16(0,0,-1), // front
220                 v3s16(0,-1,0), // bottom
221                 v3s16(-1,0,0), // left
222         };
223         
224         if(from_nodes.size() == 0)
225                 return;
226         
227         u32 blockchangecount = 0;
228
229         core::map<v3s16, u8> unlighted_nodes;
230         core::map<v3s16, u8>::Iterator j;
231         j = from_nodes.getIterator();
232
233         /*
234                 Initialize block cache
235         */
236         v3s16 blockpos_last;
237         MapBlock *block = NULL;
238         // Cache this a bit, too
239         bool block_checked_in_modified = false;
240         
241         for(; j.atEnd() == false; j++)
242         {
243                 v3s16 pos = j.getNode()->getKey();
244                 v3s16 blockpos = getNodeBlockPos(pos);
245                 
246                 // Only fetch a new block if the block position has changed
247                 try{
248                         if(block == NULL || blockpos != blockpos_last){
249                                 block = getBlockNoCreate(blockpos);
250                                 blockpos_last = blockpos;
251
252                                 block_checked_in_modified = false;
253                                 blockchangecount++;
254                         }
255                 }
256                 catch(InvalidPositionException &e)
257                 {
258                         continue;
259                 }
260
261                 if(block->isDummy())
262                         continue;
263
264                 // Calculate relative position in block
265                 v3s16 relpos = pos - blockpos_last * MAP_BLOCKSIZE;
266
267                 // Get node straight from the block
268                 MapNode n = block->getNode(relpos);
269
270                 u8 oldlight = j.getNode()->getValue();
271
272                 // Loop through 6 neighbors
273                 for(u16 i=0; i<6; i++)
274                 {
275                         // Get the position of the neighbor node
276                         v3s16 n2pos = pos + dirs[i];
277
278                         // Get the block where the node is located
279                         v3s16 blockpos = getNodeBlockPos(n2pos);
280
281                         try
282                         {
283                                 // Only fetch a new block if the block position has changed
284                                 try{
285                                         if(block == NULL || blockpos != blockpos_last){
286                                                 block = getBlockNoCreate(blockpos);
287                                                 blockpos_last = blockpos;
288
289                                                 block_checked_in_modified = false;
290                                                 blockchangecount++;
291                                         }
292                                 }
293                                 catch(InvalidPositionException &e)
294                                 {
295                                         continue;
296                                 }
297
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);
302
303                                 bool changed = false;
304
305                                 //TODO: Optimize output by optimizing light_sources?
306
307                                 /*
308                                         If the neighbor is dimmer than what was specified
309                                         as oldlight (the light of the previous node)
310                                 */
311                                 if(n2.getLight(bank) < oldlight)
312                                 {
313                                         /*
314                                                 And the neighbor is transparent and it has some light
315                                         */
316                                         if(n2.light_propagates() && n2.getLight(bank) != 0)
317                                         {
318                                                 /*
319                                                         Set light to 0 and add to queue
320                                                 */
321
322                                                 u8 current_light = n2.getLight(bank);
323                                                 n2.setLight(bank, 0);
324                                                 block->setNode(relpos, n2);
325
326                                                 unlighted_nodes.insert(n2pos, current_light);
327                                                 changed = true;
328
329                                                 /*
330                                                         Remove from light_sources if it is there
331                                                         NOTE: This doesn't happen nearly at all
332                                                 */
333                                                 /*if(light_sources.find(n2pos))
334                                                 {
335                                                         std::cout<<"Removed from light_sources"<<std::endl;
336                                                         light_sources.remove(n2pos);
337                                                 }*/
338                                         }
339
340                                         /*// DEBUG
341                                         if(light_sources.find(n2pos) != NULL)
342                                                 light_sources.remove(n2pos);*/
343                                 }
344                                 else{
345                                         light_sources.insert(n2pos, true);
346                                 }
347
348                                 // Add to modified_blocks
349                                 if(changed == true && block_checked_in_modified == false)
350                                 {
351                                         // If the block is not found in modified_blocks, add.
352                                         if(modified_blocks.find(blockpos) == NULL)
353                                         {
354                                                 modified_blocks.insert(blockpos, block);
355                                         }
356                                         block_checked_in_modified = true;
357                                 }
358                         }
359                         catch(InvalidPositionException &e)
360                         {
361                                 continue;
362                         }
363                 }
364         }
365
366         /*dstream<<"unspreadLight(): Changed block "
367                         <<blockchangecount<<" times"
368                         <<" for "<<from_nodes.size()<<" nodes"
369                         <<std::endl;*/
370
371         if(unlighted_nodes.size() > 0)
372                 unspreadLight(bank, unlighted_nodes, light_sources, modified_blocks);
373 }
374
375 /*
376         A single-node wrapper of the above
377 */
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)
382 {
383         core::map<v3s16, u8> from_nodes;
384         from_nodes.insert(pos, lightwas);
385
386         unspreadLight(bank, from_nodes, light_sources, modified_blocks);
387 }
388
389 /*
390         Lights neighbors of from_nodes, collects all them and then
391         goes on recursively.
392 */
393 void Map::spreadLight(enum LightBank bank,
394                 core::map<v3s16, bool> & from_nodes,
395                 core::map<v3s16, MapBlock*> & modified_blocks)
396 {
397         const v3s16 dirs[6] = {
398                 v3s16(0,0,1), // back
399                 v3s16(0,1,0), // top
400                 v3s16(1,0,0), // right
401                 v3s16(0,0,-1), // front
402                 v3s16(0,-1,0), // bottom
403                 v3s16(-1,0,0), // left
404         };
405
406         if(from_nodes.size() == 0)
407                 return;
408
409         u32 blockchangecount = 0;
410
411         core::map<v3s16, bool> lighted_nodes;
412         core::map<v3s16, bool>::Iterator j;
413         j = from_nodes.getIterator();
414
415         /*
416                 Initialize block cache
417         */
418         v3s16 blockpos_last;
419         MapBlock *block = NULL;
420         // Cache this a bit, too
421         bool block_checked_in_modified = false;
422
423         for(; j.atEnd() == false; j++)
424         //for(; j != from_nodes.end(); j++)
425         {
426                 v3s16 pos = j.getNode()->getKey();
427                 //v3s16 pos = *j;
428                 //dstream<<"pos=("<<pos.X<<","<<pos.Y<<","<<pos.Z<<")"<<std::endl;
429                 v3s16 blockpos = getNodeBlockPos(pos);
430
431                 // Only fetch a new block if the block position has changed
432                 try{
433                         if(block == NULL || blockpos != blockpos_last){
434                                 block = getBlockNoCreate(blockpos);
435                                 blockpos_last = blockpos;
436
437                                 block_checked_in_modified = false;
438                                 blockchangecount++;
439                         }
440                 }
441                 catch(InvalidPositionException &e)
442                 {
443                         continue;
444                 }
445
446                 if(block->isDummy())
447                         continue;
448
449                 // Calculate relative position in block
450                 v3s16 relpos = pos - blockpos_last * MAP_BLOCKSIZE;
451
452                 // Get node straight from the block
453                 MapNode n = block->getNode(relpos);
454
455                 u8 oldlight = n.getLight(bank);
456                 u8 newlight = diminish_light(oldlight);
457
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];
462
463                         // Get the block where the node is located
464                         v3s16 blockpos = getNodeBlockPos(n2pos);
465
466                         try
467                         {
468                                 // Only fetch a new block if the block position has changed
469                                 try{
470                                         if(block == NULL || blockpos != blockpos_last){
471                                                 block = getBlockNoCreate(blockpos);
472                                                 blockpos_last = blockpos;
473
474                                                 block_checked_in_modified = false;
475                                                 blockchangecount++;
476                                         }
477                                 }
478                                 catch(InvalidPositionException &e)
479                                 {
480                                         continue;
481                                 }
482
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);
487
488                                 bool changed = false;
489                                 /*
490                                         If the neighbor is brighter than the current node,
491                                         add to list (it will light up this node on its turn)
492                                 */
493                                 if(n2.getLight(bank) > undiminish_light(oldlight))
494                                 {
495                                         lighted_nodes.insert(n2pos, true);
496                                         //lighted_nodes.push_back(n2pos);
497                                         changed = true;
498                                 }
499                                 /*
500                                         If the neighbor is dimmer than how much light this node
501                                         would spread on it, add to list
502                                 */
503                                 if(n2.getLight(bank) < newlight)
504                                 {
505                                         if(n2.light_propagates())
506                                         {
507                                                 n2.setLight(bank, newlight);
508                                                 block->setNode(relpos, n2);
509                                                 lighted_nodes.insert(n2pos, true);
510                                                 //lighted_nodes.push_back(n2pos);
511                                                 changed = true;
512                                         }
513                                 }
514
515                                 // Add to modified_blocks
516                                 if(changed == true && block_checked_in_modified == false)
517                                 {
518                                         // If the block is not found in modified_blocks, add.
519                                         if(modified_blocks.find(blockpos) == NULL)
520                                         {
521                                                 modified_blocks.insert(blockpos, block);
522                                         }
523                                         block_checked_in_modified = true;
524                                 }
525                         }
526                         catch(InvalidPositionException &e)
527                         {
528                                 continue;
529                         }
530                 }
531         }
532
533         /*dstream<<"spreadLight(): Changed block "
534                         <<blockchangecount<<" times"
535                         <<" for "<<from_nodes.size()<<" nodes"
536                         <<std::endl;*/
537
538         if(lighted_nodes.size() > 0)
539                 spreadLight(bank, lighted_nodes, modified_blocks);
540 }
541
542 /*
543         A single-node source variation of the above.
544 */
545 void Map::lightNeighbors(enum LightBank bank,
546                 v3s16 pos,
547                 core::map<v3s16, MapBlock*> & modified_blocks)
548 {
549         core::map<v3s16, bool> from_nodes;
550         from_nodes.insert(pos, true);
551         spreadLight(bank, from_nodes, modified_blocks);
552 }
553
554 v3s16 Map::getBrightestNeighbour(enum LightBank bank, v3s16 p)
555 {
556         v3s16 dirs[6] = {
557                 v3s16(0,0,1), // back
558                 v3s16(0,1,0), // top
559                 v3s16(1,0,0), // right
560                 v3s16(0,0,-1), // front
561                 v3s16(0,-1,0), // bottom
562                 v3s16(-1,0,0), // left
563         };
564
565         u8 brightest_light = 0;
566         v3s16 brightest_pos(0,0,0);
567         bool found_something = false;
568
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];
573                 MapNode n2;
574                 try{
575                         n2 = getNode(n2pos);
576                 }
577                 catch(InvalidPositionException &e)
578                 {
579                         continue;
580                 }
581                 if(n2.getLight(bank) > brightest_light || found_something == false){
582                         brightest_light = n2.getLight(bank);
583                         brightest_pos = n2pos;
584                         found_something = true;
585                 }
586         }
587
588         if(found_something == false)
589                 throw InvalidPositionException();
590
591         return brightest_pos;
592 }
593
594 /*
595         Propagates sunlight down from a node.
596         Starting point gets sunlight.
597
598         Returns the lowest y value of where the sunlight went.
599
600         Mud is turned into grass in where the sunlight stops.
601 */
602 s16 Map::propagateSunlight(v3s16 start,
603                 core::map<v3s16, MapBlock*> & modified_blocks)
604 {
605         s16 y = start.Y;
606         for(; ; y--)
607         {
608                 v3s16 pos(start.X, y, start.Z);
609
610                 v3s16 blockpos = getNodeBlockPos(pos);
611                 MapBlock *block;
612                 try{
613                         block = getBlockNoCreate(blockpos);
614                 }
615                 catch(InvalidPositionException &e)
616                 {
617                         break;
618                 }
619
620                 v3s16 relpos = pos - blockpos*MAP_BLOCKSIZE;
621                 MapNode n = block->getNode(relpos);
622
623                 if(n.sunlight_propagates())
624                 {
625                         n.setLight(LIGHTBANK_DAY, LIGHT_SUN);
626                         block->setNode(relpos, n);
627
628                         modified_blocks.insert(blockpos, block);
629                 }
630                 else
631                 {
632                         /*// Turn mud into grass
633                         if(n.getContent() == CONTENT_MUD)
634                         {
635                                 n.setContent(CONTENT_GRASS);
636                                 block->setNode(relpos, n);
637                                 modified_blocks.insert(blockpos, block);
638                         }*/
639
640                         // Sunlight goes no further
641                         break;
642                 }
643         }
644         return y + 1;
645 }
646
647 void Map::updateLighting(enum LightBank bank,
648                 core::map<v3s16, MapBlock*> & a_blocks,
649                 core::map<v3s16, MapBlock*> & modified_blocks)
650 {
651         /*m_dout<<DTIME<<"Map::updateLighting(): "
652                         <<a_blocks.size()<<" blocks."<<std::endl;*/
653
654         //TimeTaker timer("updateLighting");
655
656         // For debugging
657         //bool debug=true;
658         //u32 count_was = modified_blocks.size();
659
660         core::map<v3s16, MapBlock*> blocks_to_update;
661
662         core::map<v3s16, bool> light_sources;
663
664         core::map<v3s16, u8> unlight_from;
665
666         core::map<v3s16, MapBlock*>::Iterator i;
667         i = a_blocks.getIterator();
668         for(; i.atEnd() == false; i++)
669         {
670                 MapBlock *block = i.getNode()->getValue();
671
672                 for(;;)
673                 {
674                         // Don't bother with dummy blocks.
675                         if(block->isDummy())
676                                 break;
677
678                         v3s16 pos = block->getPos();
679                         modified_blocks.insert(pos, block);
680
681                         blocks_to_update.insert(pos, block);
682
683                         /*
684                                 Clear all light from block
685                         */
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++)
689                         {
690
691                                 try{
692                                         v3s16 p(x,y,z);
693                                         MapNode n = block->getNode(v3s16(x,y,z));
694                                         u8 oldlight = n.getLight(bank);
695                                         n.setLight(bank, 0);
696                                         block->setNode(v3s16(x,y,z), n);
697
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)
702                                         {
703                                                 v3s16 p_map = p + v3s16(
704                                                                 MAP_BLOCKSIZE*pos.X,
705                                                                 MAP_BLOCKSIZE*pos.Y,
706                                                                 MAP_BLOCKSIZE*pos.Z);
707                                                 unlight_from.insert(p_map, oldlight);
708                                         }
709                                 }
710                                 catch(InvalidPositionException &e)
711                                 {
712                                         /*
713                                                 This would happen when dealing with a
714                                                 dummy block.
715                                         */
716                                         //assert(0);
717                                         dstream<<"updateLighting(): InvalidPositionException"
718                                                         <<std::endl;
719                                 }
720                         }
721
722                         if(bank == LIGHTBANK_DAY)
723                         {
724                                 bool bottom_valid = block->propagateSunlight(light_sources);
725
726                                 // If bottom is valid, we're done.
727                                 if(bottom_valid)
728                                         break;
729                         }
730                         else if(bank == LIGHTBANK_NIGHT)
731                         {
732                                 // For night lighting, sunlight is not propagated
733                                 break;
734                         }
735                         else
736                         {
737                                 // Invalid lighting bank
738                                 assert(0);
739                         }
740
741                         /*dstream<<"Bottom for sunlight-propagated block ("
742                                         <<pos.X<<","<<pos.Y<<","<<pos.Z<<") not valid"
743                                         <<std::endl;*/
744
745                         // Bottom sunlight is not valid; get the block and loop to it
746
747                         pos.Y--;
748                         try{
749                                 block = getBlockNoCreate(pos);
750                         }
751                         catch(InvalidPositionException &e)
752                         {
753                                 assert(0);
754                         }
755
756                 }
757         }
758         
759         /*
760                 Enable this to disable proper lighting for speeding up map
761                 generation for testing or whatever
762         */
763 #if 0
764         //if(g_settings.get(""))
765         {
766                 core::map<v3s16, MapBlock*>::Iterator i;
767                 i = blocks_to_update.getIterator();
768                 for(; i.atEnd() == false; i++)
769                 {
770                         MapBlock *block = i.getNode()->getValue();
771                         v3s16 p = block->getPos();
772                         block->setLightingExpired(false);
773                 }
774                 return;
775         }
776 #endif
777
778 #if 0
779         {
780                 TimeTaker timer("unspreadLight");
781                 unspreadLight(bank, unlight_from, light_sources, modified_blocks);
782         }
783
784         if(debug)
785         {
786                 u32 diff = modified_blocks.size() - count_was;
787                 count_was = modified_blocks.size();
788                 dstream<<"unspreadLight modified "<<diff<<std::endl;
789         }
790
791         {
792                 TimeTaker timer("spreadLight");
793                 spreadLight(bank, light_sources, modified_blocks);
794         }
795
796         if(debug)
797         {
798                 u32 diff = modified_blocks.size() - count_was;
799                 count_was = modified_blocks.size();
800                 dstream<<"spreadLight modified "<<diff<<std::endl;
801         }
802 #endif
803
804         {
805                 //MapVoxelManipulator vmanip(this);
806
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++)
813                 {
814                         MapBlock *block = i.getNode()->getValue();
815                         v3s16 p = block->getPos();
816
817                         // Add all surrounding blocks
818                         vmanip.initialEmerge(p - v3s16(1,1,1), p + v3s16(1,1,1));
819
820                         /*
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)
824                         */
825                         /*for(s16 z=-1; z<=1; z++)
826                         for(s16 y=-1; y<=1; y++)
827                         for(s16 x=-1; x<=1; x++)
828                         {
829                                 v3s16 p(x,y,z);
830                                 MapBlock *block = getBlockNoCreateNoEx(p);
831                                 if(block == NULL)
832                                         continue;
833                                 if(block->isDummy())
834                                         continue;
835                                 if(block->getLightingExpired())
836                                         continue;
837                                 vmanip.initialEmerge(p, p);
838                         }*/
839
840                         // Lighting of block will be updated completely
841                         block->setLightingExpired(false);
842                 }
843
844                 {
845                         //TimeTaker timer("unSpreadLight");
846                         vmanip.unspreadLight(bank, unlight_from, light_sources);
847                 }
848                 {
849                         //TimeTaker timer("spreadLight");
850                         vmanip.spreadLight(bank, light_sources);
851                 }
852                 {
853                         //TimeTaker timer("blitBack");
854                         vmanip.blitBack(modified_blocks);
855                 }
856                 /*dstream<<"emerge_time="<<emerge_time<<std::endl;
857                 emerge_time = 0;*/
858         }
859
860         //m_dout<<"Done ("<<getTimestamp()<<")"<<std::endl;
861 }
862
863 void Map::updateLighting(core::map<v3s16, MapBlock*> & a_blocks,
864                 core::map<v3s16, MapBlock*> & modified_blocks)
865 {
866         updateLighting(LIGHTBANK_DAY, a_blocks, modified_blocks);
867         updateLighting(LIGHTBANK_NIGHT, a_blocks, modified_blocks);
868
869         /*
870                 Update information about whether day and night light differ
871         */
872         for(core::map<v3s16, MapBlock*>::Iterator
873                         i = modified_blocks.getIterator();
874                         i.atEnd() == false; i++)
875         {
876                 MapBlock *block = i.getNode()->getValue();
877                 block->updateDayNightDiff();
878         }
879 }
880
881 /*
882 */
883 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
884                 core::map<v3s16, MapBlock*> &modified_blocks)
885 {
886         /*PrintInfo(m_dout);
887         m_dout<<DTIME<<"Map::addNodeAndUpdate(): p=("
888                         <<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
889
890         /*
891                 From this node to nodes underneath:
892                 If lighting is sunlight (1.0), unlight neighbours and
893                 set lighting to 0.
894                 Else discontinue.
895         */
896
897         v3s16 toppos = p + v3s16(0,1,0);
898         v3s16 bottompos = p + v3s16(0,-1,0);
899
900         bool node_under_sunlight = true;
901         core::map<v3s16, bool> light_sources;
902
903         /*
904                 If there is a node at top and it doesn't have sunlight,
905                 there has not been any sunlight going down.
906
907                 Otherwise there probably is.
908         */
909         try{
910                 MapNode topnode = getNode(toppos);
911
912                 if(topnode.getLight(LIGHTBANK_DAY) != LIGHT_SUN)
913                         node_under_sunlight = false;
914         }
915         catch(InvalidPositionException &e)
916         {
917         }
918
919 #if 0
920         /*
921                 If the new node is solid and there is grass below, change it to mud
922         */
923         if(content_features(n).walkable == true)
924         {
925                 try{
926                         MapNode bottomnode = getNode(bottompos);
927
928                         if(bottomnode.getContent() == CONTENT_GRASS
929                                         || bottomnode.getContent() == CONTENT_GRASS_FOOTSTEPS)
930                         {
931                                 bottomnode.setContent(CONTENT_MUD);
932                                 setNode(bottompos, bottomnode);
933                         }
934                 }
935                 catch(InvalidPositionException &e)
936                 {
937                 }
938         }
939 #endif
940
941 #if 0
942         /*
943                 If the new node is mud and it is under sunlight, change it
944                 to grass
945         */
946         if(n.getContent() == CONTENT_MUD && node_under_sunlight)
947         {
948                 n.setContent(CONTENT_GRASS);
949         }
950 #endif
951
952         /*
953                 Remove all light that has come out of this node
954         */
955
956         enum LightBank banks[] =
957         {
958                 LIGHTBANK_DAY,
959                 LIGHTBANK_NIGHT
960         };
961         for(s32 i=0; i<2; i++)
962         {
963                 enum LightBank bank = banks[i];
964
965                 u8 lightwas = getNode(p).getLight(bank);
966
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);
972
973                 assert(isValidPosition(p));
974
975                 // Unlight neighbours of node.
976                 // This means setting light of all consequent dimmer nodes
977                 // to 0.
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);
981
982                 n.setLight(bank, 0);
983         }
984
985         /*
986                 If node lets sunlight through and is under sunlight, it has
987                 sunlight too.
988         */
989         if(node_under_sunlight && content_features(n).sunlight_propagates)
990         {
991                 n.setLight(LIGHTBANK_DAY, LIGHT_SUN);
992         }
993
994         /*
995                 Set the node on the map
996         */
997
998         setNode(p, n);
999
1000         /*
1001                 Add intial metadata
1002         */
1003
1004         NodeMetadata *meta_proto = content_features(n).initial_metadata;
1005         if(meta_proto)
1006         {
1007                 NodeMetadata *meta = meta_proto->clone();
1008                 setNodeMetadata(p, meta);
1009         }
1010
1011         /*
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
1016                           of looping
1017         */
1018         if(node_under_sunlight && !content_features(n).sunlight_propagates)
1019         {
1020                 s16 y = p.Y - 1;
1021                 for(;; y--){
1022                         //m_dout<<DTIME<<"y="<<y<<std::endl;
1023                         v3s16 n2pos(p.X, y, p.Z);
1024
1025                         MapNode n2;
1026                         try{
1027                                 n2 = getNode(n2pos);
1028                         }
1029                         catch(InvalidPositionException &e)
1030                         {
1031                                 break;
1032                         }
1033
1034                         if(n2.getLight(LIGHTBANK_DAY) == LIGHT_SUN)
1035                         {
1036                                 unLightNeighbors(LIGHTBANK_DAY,
1037                                                 n2pos, n2.getLight(LIGHTBANK_DAY),
1038                                                 light_sources, modified_blocks);
1039                                 n2.setLight(LIGHTBANK_DAY, 0);
1040                                 setNode(n2pos, n2);
1041                         }
1042                         else
1043                                 break;
1044                 }
1045         }
1046
1047         for(s32 i=0; i<2; i++)
1048         {
1049                 enum LightBank bank = banks[i];
1050
1051                 /*
1052                         Spread light from all nodes that might be capable of doing so
1053                 */
1054                 spreadLight(bank, light_sources, modified_blocks);
1055         }
1056
1057         /*
1058                 Update information about whether day and night light differ
1059         */
1060         for(core::map<v3s16, MapBlock*>::Iterator
1061                         i = modified_blocks.getIterator();
1062                         i.atEnd() == false; i++)
1063         {
1064                 MapBlock *block = i.getNode()->getValue();
1065                 block->updateDayNightDiff();
1066         }
1067
1068         /*
1069                 Add neighboring liquid nodes and the node itself if it is
1070                 liquid (=water node was added) to transform queue.
1071         */
1072         v3s16 dirs[7] = {
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
1080         };
1081         for(u16 i=0; i<7; i++)
1082         {
1083                 try
1084                 {
1085
1086                 v3s16 p2 = p + dirs[i];
1087
1088                 MapNode n2 = getNode(p2);
1089                 if(content_liquid(n2.getContent()))
1090                 {
1091                         m_transforming_liquid.push_back(p2);
1092                 }
1093
1094                 }catch(InvalidPositionException &e)
1095                 {
1096                 }
1097         }
1098 }
1099
1100 /*
1101 */
1102 void Map::removeNodeAndUpdate(v3s16 p,
1103                 core::map<v3s16, MapBlock*> &modified_blocks)
1104 {
1105         /*PrintInfo(m_dout);
1106         m_dout<<DTIME<<"Map::removeNodeAndUpdate(): p=("
1107                         <<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
1108
1109         bool node_under_sunlight = true;
1110
1111         v3s16 toppos = p + v3s16(0,1,0);
1112
1113         // Node will be replaced with this
1114         content_t replace_material = CONTENT_AIR;
1115
1116         /*
1117                 If there is a node at top and it doesn't have sunlight,
1118                 there will be no sunlight going down.
1119         */
1120         try{
1121                 MapNode topnode = getNode(toppos);
1122
1123                 if(topnode.getLight(LIGHTBANK_DAY) != LIGHT_SUN)
1124                         node_under_sunlight = false;
1125         }
1126         catch(InvalidPositionException &e)
1127         {
1128         }
1129
1130         core::map<v3s16, bool> light_sources;
1131
1132         enum LightBank banks[] =
1133         {
1134                 LIGHTBANK_DAY,
1135                 LIGHTBANK_NIGHT
1136         };
1137         for(s32 i=0; i<2; i++)
1138         {
1139                 enum LightBank bank = banks[i];
1140
1141                 /*
1142                         Unlight neighbors (in case the node is a light source)
1143                 */
1144                 unLightNeighbors(bank, p,
1145                                 getNode(p).getLight(bank),
1146                                 light_sources, modified_blocks);
1147         }
1148
1149         /*
1150                 Remove node metadata
1151         */
1152
1153         removeNodeMetadata(p);
1154
1155         /*
1156                 Remove the node.
1157                 This also clears the lighting.
1158         */
1159
1160         MapNode n;
1161         n.setContent(replace_material);
1162         setNode(p, n);
1163
1164         for(s32 i=0; i<2; i++)
1165         {
1166                 enum LightBank bank = banks[i];
1167
1168                 /*
1169                         Recalculate lighting
1170                 */
1171                 spreadLight(bank, light_sources, modified_blocks);
1172         }
1173
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);
1179
1180         /*
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.
1184         */
1185         if(node_under_sunlight)
1186         {
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;*/
1191                 s16 y = p.Y;
1192                 for(; y >= ybottom; y--)
1193                 {
1194                         v3s16 p2(p.X, y, p.Z);
1195                         /*m_dout<<DTIME<<"lighting neighbors of node ("
1196                                         <<p2.X<<","<<p2.Y<<","<<p2.Z<<")"
1197                                         <<std::endl;*/
1198                         lightNeighbors(LIGHTBANK_DAY, p2, modified_blocks);
1199                 }
1200         }
1201         else
1202         {
1203                 // Set the lighting of this node to 0
1204                 // TODO: Is this needed? Lighting is cleared up there already.
1205                 try{
1206                         MapNode n = getNode(p);
1207                         n.setLight(LIGHTBANK_DAY, 0);
1208                         setNode(p, n);
1209                 }
1210                 catch(InvalidPositionException &e)
1211                 {
1212                         assert(0);
1213                 }
1214         }
1215
1216         for(s32 i=0; i<2; i++)
1217         {
1218                 enum LightBank bank = banks[i];
1219
1220                 // Get the brightest neighbour node and propagate light from it
1221                 v3s16 n2p = getBrightestNeighbour(bank, p);
1222                 try{
1223                         MapNode n2 = getNode(n2p);
1224                         lightNeighbors(bank, n2p, modified_blocks);
1225                 }
1226                 catch(InvalidPositionException &e)
1227                 {
1228                 }
1229         }
1230
1231         /*
1232                 Update information about whether day and night light differ
1233         */
1234         for(core::map<v3s16, MapBlock*>::Iterator
1235                         i = modified_blocks.getIterator();
1236                         i.atEnd() == false; i++)
1237         {
1238                 MapBlock *block = i.getNode()->getValue();
1239                 block->updateDayNightDiff();
1240         }
1241
1242         /*
1243                 Add neighboring liquid nodes and this node to transform queue.
1244                 (it's vital for the node itself to get updated last.)
1245         */
1246         v3s16 dirs[7] = {
1247                 v3s16(0,0,1), // back
1248                 v3s16(0,1,0), // top
1249                 v3s16(1,0,0), // right
1250                 v3s16(0,0,-1), // front
1251                 v3s16(0,-1,0), // bottom
1252                 v3s16(-1,0,0), // left
1253                 v3s16(0,0,0), // self
1254         };
1255         for(u16 i=0; i<7; i++)
1256         {
1257                 try
1258                 {
1259
1260                 v3s16 p2 = p + dirs[i];
1261
1262                 MapNode n2 = getNode(p2);
1263                 if(content_liquid(n2.getContent()))
1264                 {
1265                         m_transforming_liquid.push_back(p2);
1266                 }
1267
1268                 }catch(InvalidPositionException &e)
1269                 {
1270                 }
1271         }
1272 }
1273
1274 bool Map::addNodeWithEvent(v3s16 p, MapNode n)
1275 {
1276         MapEditEvent event;
1277         event.type = MEET_ADDNODE;
1278         event.p = p;
1279         event.n = n;
1280
1281         bool succeeded = true;
1282         try{
1283                 core::map<v3s16, MapBlock*> modified_blocks;
1284                 addNodeAndUpdate(p, n, modified_blocks);
1285
1286                 // Copy modified_blocks to event
1287                 for(core::map<v3s16, MapBlock*>::Iterator
1288                                 i = modified_blocks.getIterator();
1289                                 i.atEnd()==false; i++)
1290                 {
1291                         event.modified_blocks.insert(i.getNode()->getKey(), false);
1292                 }
1293         }
1294         catch(InvalidPositionException &e){
1295                 succeeded = false;
1296         }
1297
1298         dispatchEvent(&event);
1299
1300         return succeeded;
1301 }
1302
1303 bool Map::removeNodeWithEvent(v3s16 p)
1304 {
1305         MapEditEvent event;
1306         event.type = MEET_REMOVENODE;
1307         event.p = p;
1308
1309         bool succeeded = true;
1310         try{
1311                 core::map<v3s16, MapBlock*> modified_blocks;
1312                 removeNodeAndUpdate(p, modified_blocks);
1313
1314                 // Copy modified_blocks to event
1315                 for(core::map<v3s16, MapBlock*>::Iterator
1316                                 i = modified_blocks.getIterator();
1317                                 i.atEnd()==false; i++)
1318                 {
1319                         event.modified_blocks.insert(i.getNode()->getKey(), false);
1320                 }
1321         }
1322         catch(InvalidPositionException &e){
1323                 succeeded = false;
1324         }
1325
1326         dispatchEvent(&event);
1327
1328         return succeeded;
1329 }
1330
1331 bool Map::dayNightDiffed(v3s16 blockpos)
1332 {
1333         try{
1334                 v3s16 p = blockpos + v3s16(0,0,0);
1335                 MapBlock *b = getBlockNoCreate(p);
1336                 if(b->dayNightDiffed())
1337                         return true;
1338         }
1339         catch(InvalidPositionException &e){}
1340         // Leading edges
1341         try{
1342                 v3s16 p = blockpos + v3s16(-1,0,0);
1343                 MapBlock *b = getBlockNoCreate(p);
1344                 if(b->dayNightDiffed())
1345                         return true;
1346         }
1347         catch(InvalidPositionException &e){}
1348         try{
1349                 v3s16 p = blockpos + v3s16(0,-1,0);
1350                 MapBlock *b = getBlockNoCreate(p);
1351                 if(b->dayNightDiffed())
1352                         return true;
1353         }
1354         catch(InvalidPositionException &e){}
1355         try{
1356                 v3s16 p = blockpos + v3s16(0,0,-1);
1357                 MapBlock *b = getBlockNoCreate(p);
1358                 if(b->dayNightDiffed())
1359                         return true;
1360         }
1361         catch(InvalidPositionException &e){}
1362         // Trailing edges
1363         try{
1364                 v3s16 p = blockpos + v3s16(1,0,0);
1365                 MapBlock *b = getBlockNoCreate(p);
1366                 if(b->dayNightDiffed())
1367                         return true;
1368         }
1369         catch(InvalidPositionException &e){}
1370         try{
1371                 v3s16 p = blockpos + v3s16(0,1,0);
1372                 MapBlock *b = getBlockNoCreate(p);
1373                 if(b->dayNightDiffed())
1374                         return true;
1375         }
1376         catch(InvalidPositionException &e){}
1377         try{
1378                 v3s16 p = blockpos + v3s16(0,0,1);
1379                 MapBlock *b = getBlockNoCreate(p);
1380                 if(b->dayNightDiffed())
1381                         return true;
1382         }
1383         catch(InvalidPositionException &e){}
1384
1385         return false;
1386 }
1387
1388 /*
1389         Updates usage timers
1390 */
1391 void Map::timerUpdate(float dtime, float unload_timeout,
1392                 core::list<v3s16> *unloaded_blocks)
1393 {
1394         bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
1395         
1396         core::list<v2s16> sector_deletion_queue;
1397         u32 deleted_blocks_count = 0;
1398         u32 saved_blocks_count = 0;
1399
1400         core::map<v2s16, MapSector*>::Iterator si;
1401
1402         si = m_sectors.getIterator();
1403         for(; si.atEnd() == false; si++)
1404         {
1405                 MapSector *sector = si.getNode()->getValue();
1406
1407                 bool all_blocks_deleted = true;
1408
1409                 core::list<MapBlock*> blocks;
1410                 sector->getBlocks(blocks);
1411                 for(core::list<MapBlock*>::Iterator i = blocks.begin();
1412                                 i != blocks.end(); i++)
1413                 {
1414                         MapBlock *block = (*i);
1415                         
1416                         block->incrementUsageTimer(dtime);
1417                         
1418                         if(block->getUsageTimer() > unload_timeout)
1419                         {
1420                                 v3s16 p = block->getPos();
1421
1422                                 // Save if modified
1423                                 if(block->getModified() != MOD_STATE_CLEAN
1424                                                 && save_before_unloading)
1425                                 {
1426                                         saveBlock(block);
1427                                         saved_blocks_count++;
1428                                 }
1429
1430                                 // Delete from memory
1431                                 sector->deleteBlock(block);
1432
1433                                 if(unloaded_blocks)
1434                                         unloaded_blocks->push_back(p);
1435
1436                                 deleted_blocks_count++;
1437                         }
1438                         else
1439                         {
1440                                 all_blocks_deleted = false;
1441                         }
1442                 }
1443
1444                 if(all_blocks_deleted)
1445                 {
1446                         sector_deletion_queue.push_back(si.getNode()->getKey());
1447                 }
1448         }
1449         
1450         // Finally delete the empty sectors
1451         deleteSectors(sector_deletion_queue);
1452         
1453         if(deleted_blocks_count != 0)
1454         {
1455                 PrintInfo(dstream); // ServerMap/ClientMap:
1456                 dstream<<"Unloaded "<<deleted_blocks_count
1457                                 <<" blocks from memory";
1458                 if(save_before_unloading)
1459                         dstream<<", of which "<<saved_blocks_count<<" were written";
1460                 dstream<<"."<<std::endl;
1461         }
1462 }
1463
1464 void Map::deleteSectors(core::list<v2s16> &list)
1465 {
1466         core::list<v2s16>::Iterator j;
1467         for(j=list.begin(); j!=list.end(); j++)
1468         {
1469                 MapSector *sector = m_sectors[*j];
1470                 // If sector is in sector cache, remove it from there
1471                 if(m_sector_cache == sector)
1472                         m_sector_cache = NULL;
1473                 // Remove from map and delete
1474                 m_sectors.remove(*j);
1475                 delete sector;
1476         }
1477 }
1478
1479 #if 0
1480 void Map::unloadUnusedData(float timeout,
1481                 core::list<v3s16> *deleted_blocks)
1482 {
1483         core::list<v2s16> sector_deletion_queue;
1484         u32 deleted_blocks_count = 0;
1485         u32 saved_blocks_count = 0;
1486
1487         core::map<v2s16, MapSector*>::Iterator si = m_sectors.getIterator();
1488         for(; si.atEnd() == false; si++)
1489         {
1490                 MapSector *sector = si.getNode()->getValue();
1491
1492                 bool all_blocks_deleted = true;
1493
1494                 core::list<MapBlock*> blocks;
1495                 sector->getBlocks(blocks);
1496                 for(core::list<MapBlock*>::Iterator i = blocks.begin();
1497                                 i != blocks.end(); i++)
1498                 {
1499                         MapBlock *block = (*i);
1500                         
1501                         if(block->getUsageTimer() > timeout)
1502                         {
1503                                 // Save if modified
1504                                 if(block->getModified() != MOD_STATE_CLEAN)
1505                                 {
1506                                         saveBlock(block);
1507                                         saved_blocks_count++;
1508                                 }
1509                                 // Delete from memory
1510                                 sector->deleteBlock(block);
1511                                 deleted_blocks_count++;
1512                         }
1513                         else
1514                         {
1515                                 all_blocks_deleted = false;
1516                         }
1517                 }
1518
1519                 if(all_blocks_deleted)
1520                 {
1521                         sector_deletion_queue.push_back(si.getNode()->getKey());
1522                 }
1523         }
1524
1525         deleteSectors(sector_deletion_queue);
1526
1527         dstream<<"Map: Unloaded "<<deleted_blocks_count<<" blocks from memory"
1528                         <<", of which "<<saved_blocks_count<<" were wr."
1529                         <<std::endl;
1530
1531         //return sector_deletion_queue.getSize();
1532         //return deleted_blocks_count;
1533 }
1534 #endif
1535
1536 void Map::PrintInfo(std::ostream &out)
1537 {
1538         out<<"Map: ";
1539 }
1540
1541 #define WATER_DROP_BOOST 4
1542
1543 void Map::transformLiquids(core::map<v3s16, MapBlock*> & modified_blocks)
1544 {
1545         DSTACK(__FUNCTION_NAME);
1546         //TimeTaker timer("transformLiquids()");
1547
1548         u32 loopcount = 0;
1549         u32 initial_size = m_transforming_liquid.size();
1550
1551         /*if(initial_size != 0)
1552                 dstream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
1553
1554         while(m_transforming_liquid.size() != 0)
1555         {
1556                 /*
1557                         Get a queued transforming liquid node
1558                 */
1559                 v3s16 p0 = m_transforming_liquid.pop_front();
1560
1561                 MapNode n0 = getNodeNoEx(p0);
1562
1563                 // Don't deal with non-liquids
1564                 if(content_liquid(n0.getContent()) == false)
1565                         continue;
1566
1567                 bool is_source = !content_flowing_liquid(n0.getContent());
1568
1569                 u8 liquid_level = 8;
1570                 if(is_source == false)
1571                         liquid_level = n0.param2 & 0x0f;
1572
1573                 // Turn possible source into non-source
1574                 u8 nonsource_c = make_liquid_flowing(n0.getContent());
1575
1576                 /*
1577                         If not source, check that some node flows into this one
1578                         and what is the level of liquid in this one
1579                 */
1580                 if(is_source == false)
1581                 {
1582                         s8 new_liquid_level_max = -1;
1583
1584                         v3s16 dirs_from[5] = {
1585                                 v3s16(0,1,0), // top
1586                                 v3s16(0,0,1), // back
1587                                 v3s16(1,0,0), // right
1588                                 v3s16(0,0,-1), // front
1589                                 v3s16(-1,0,0), // left
1590                         };
1591                         for(u16 i=0; i<5; i++)
1592                         {
1593                                 bool from_top = (i==0);
1594
1595                                 v3s16 p2 = p0 + dirs_from[i];
1596                                 MapNode n2 = getNodeNoEx(p2);
1597
1598                                 if(content_liquid(n2.getContent()))
1599                                 {
1600                                         u8 n2_nonsource_c = make_liquid_flowing(n2.getContent());
1601                                         // Check that the liquids are the same type
1602                                         if(n2_nonsource_c != nonsource_c)
1603                                         {
1604                                                 dstream<<"WARNING: Not handling: different liquids"
1605                                                                 " collide"<<std::endl;
1606                                                 continue;
1607                                         }
1608                                         bool n2_is_source = !content_flowing_liquid(n2.getContent());
1609                                         s8 n2_liquid_level = 8;
1610                                         if(n2_is_source == false)
1611                                                 n2_liquid_level = n2.param2 & 0x07;
1612
1613                                         s8 new_liquid_level = -1;
1614                                         if(from_top)
1615                                         {
1616                                                 //new_liquid_level = 7;
1617                                                 if(n2_liquid_level >= 7 - WATER_DROP_BOOST)
1618                                                         new_liquid_level = 7;
1619                                                 else
1620                                                         new_liquid_level = n2_liquid_level + WATER_DROP_BOOST;
1621                                         }
1622                                         else if(n2_liquid_level > 0)
1623                                         {
1624                                                 new_liquid_level = n2_liquid_level - 1;
1625                                         }
1626
1627                                         if(new_liquid_level > new_liquid_level_max)
1628                                                 new_liquid_level_max = new_liquid_level;
1629                                 }
1630                         } //for
1631
1632                         /*
1633                                 If liquid level should be something else, update it and
1634                                 add all the neighboring water nodes to the transform queue.
1635                         */
1636                         if(new_liquid_level_max != liquid_level)
1637                         {
1638                                 if(new_liquid_level_max == -1)
1639                                 {
1640                                         // Remove water alltoghether
1641                                         n0.setContent(CONTENT_AIR);
1642                                         n0.param2 = 0;
1643                                         setNode(p0, n0);
1644                                 }
1645                                 else
1646                                 {
1647                                         n0.param2 = new_liquid_level_max;
1648                                         setNode(p0, n0);
1649                                 }
1650
1651                                 // Block has been modified
1652                                 {
1653                                         v3s16 blockpos = getNodeBlockPos(p0);
1654                                         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1655                                         if(block != NULL)
1656                                                 modified_blocks.insert(blockpos, block);
1657                                 }
1658
1659                                 /*
1660                                         Add neighboring non-source liquid nodes to transform queue.
1661                                 */
1662                                 v3s16 dirs[6] = {
1663                                         v3s16(0,0,1), // back
1664                                         v3s16(0,1,0), // top
1665                                         v3s16(1,0,0), // right
1666                                         v3s16(0,0,-1), // front
1667                                         v3s16(0,-1,0), // bottom
1668                                         v3s16(-1,0,0), // left
1669                                 };
1670                                 for(u16 i=0; i<6; i++)
1671                                 {
1672                                         v3s16 p2 = p0 + dirs[i];
1673
1674                                         MapNode n2 = getNodeNoEx(p2);
1675                                         if(content_flowing_liquid(n2.getContent()))
1676                                         {
1677                                                 m_transforming_liquid.push_back(p2);
1678                                         }
1679                                 }
1680                         }
1681                 }
1682
1683                 // Get a new one from queue if the node has turned into non-water
1684                 if(content_liquid(n0.getContent()) == false)
1685                         continue;
1686
1687                 /*
1688                         Flow water from this node
1689                 */
1690                 v3s16 dirs_to[5] = {
1691                         v3s16(0,-1,0), // bottom
1692                         v3s16(0,0,1), // back
1693                         v3s16(1,0,0), // right
1694                         v3s16(0,0,-1), // front
1695                         v3s16(-1,0,0), // left
1696                 };
1697                 for(u16 i=0; i<5; i++)
1698                 {
1699                         bool to_bottom = (i == 0);
1700
1701                         // If liquid is at lowest possible height, it's not going
1702                         // anywhere except down
1703                         if(liquid_level == 0 && to_bottom == false)
1704                                 continue;
1705
1706                         u8 liquid_next_level = 0;
1707                         // If going to bottom
1708                         if(to_bottom)
1709                         {
1710                                 //liquid_next_level = 7;
1711                                 if(liquid_level >= 7 - WATER_DROP_BOOST)
1712                                         liquid_next_level = 7;
1713                                 else
1714                                         liquid_next_level = liquid_level + WATER_DROP_BOOST;
1715                         }
1716                         else
1717                                 liquid_next_level = liquid_level - 1;
1718
1719                         bool n2_changed = false;
1720                         bool flowed = false;
1721
1722                         v3s16 p2 = p0 + dirs_to[i];
1723
1724                         MapNode n2 = getNodeNoEx(p2);
1725                         //dstream<<"[1] n2.param="<<(int)n2.param<<std::endl;
1726
1727                         if(content_liquid(n2.getContent()))
1728                         {
1729                                 u8 n2_nonsource_c = make_liquid_flowing(n2.getContent());
1730                                 // Check that the liquids are the same type
1731                                 if(n2_nonsource_c != nonsource_c)
1732                                 {
1733                                         dstream<<"WARNING: Not handling: different liquids"
1734                                                         " collide"<<std::endl;
1735                                         continue;
1736                                 }
1737                                 bool n2_is_source = !content_flowing_liquid(n2.getContent());
1738                                 u8 n2_liquid_level = 8;
1739                                 if(n2_is_source == false)
1740                                         n2_liquid_level = n2.param2 & 0x07;
1741
1742                                 if(to_bottom)
1743                                 {
1744                                         flowed = true;
1745                                 }
1746
1747                                 if(n2_is_source)
1748                                 {
1749                                         // Just flow into the source, nothing changes.
1750                                         // n2_changed is not set because destination didn't change
1751                                         flowed = true;
1752                                 }
1753                                 else
1754                                 {
1755                                         if(liquid_next_level > liquid_level)
1756                                         {
1757                                                 n2.param2 = liquid_next_level;
1758                                                 setNode(p2, n2);
1759
1760                                                 n2_changed = true;
1761                                                 flowed = true;
1762                                         }
1763                                 }
1764                         }
1765                         else if(n2.getContent() == CONTENT_AIR)
1766                         {
1767                                 n2.setContent(nonsource_c);
1768                                 n2.param2 = liquid_next_level;
1769                                 setNode(p2, n2);
1770
1771                                 n2_changed = true;
1772                                 flowed = true;
1773                         }
1774
1775                         //dstream<<"[2] n2.param="<<(int)n2.param<<std::endl;
1776
1777                         if(n2_changed)
1778                         {
1779                                 m_transforming_liquid.push_back(p2);
1780
1781                                 v3s16 blockpos = getNodeBlockPos(p2);
1782                                 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1783                                 if(block != NULL)
1784                                         modified_blocks.insert(blockpos, block);
1785                         }
1786
1787                         // If n2_changed to bottom, don't flow anywhere else
1788                         if(to_bottom && flowed && !is_source)
1789                                 break;
1790                 }
1791
1792                 loopcount++;
1793                 //if(loopcount >= 100000)
1794                 if(loopcount >= initial_size * 1)
1795                         break;
1796         }
1797         //dstream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
1798 }
1799
1800 NodeMetadata* Map::getNodeMetadata(v3s16 p)
1801 {
1802         v3s16 blockpos = getNodeBlockPos(p);
1803         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1804         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1805         if(block == NULL)
1806         {
1807                 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1808                                 <<std::endl;
1809                 return NULL;
1810         }
1811         NodeMetadata *meta = block->m_node_metadata.get(p_rel);
1812         return meta;
1813 }
1814
1815 void Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
1816 {
1817         v3s16 blockpos = getNodeBlockPos(p);
1818         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1819         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1820         if(block == NULL)
1821         {
1822                 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1823                                 <<std::endl;
1824                 return;
1825         }
1826         block->m_node_metadata.set(p_rel, meta);
1827 }
1828
1829 void Map::removeNodeMetadata(v3s16 p)
1830 {
1831         v3s16 blockpos = getNodeBlockPos(p);
1832         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1833         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1834         if(block == NULL)
1835         {
1836                 dstream<<"WARNING: Map::removeNodeMetadata(): Block not found"
1837                                 <<std::endl;
1838                 return;
1839         }
1840         block->m_node_metadata.remove(p_rel);
1841 }
1842
1843 void Map::nodeMetadataStep(float dtime,
1844                 core::map<v3s16, MapBlock*> &changed_blocks)
1845 {
1846         /*
1847                 NOTE:
1848                 Currently there is no way to ensure that all the necessary
1849                 blocks are loaded when this is run. (They might get unloaded)
1850                 NOTE: ^- Actually, that might not be so. In a quick test it
1851                 reloaded a block with a furnace when I walked back to it from
1852                 a distance.
1853         */
1854         core::map<v2s16, MapSector*>::Iterator si;
1855         si = m_sectors.getIterator();
1856         for(; si.atEnd() == false; si++)
1857         {
1858                 MapSector *sector = si.getNode()->getValue();
1859                 core::list< MapBlock * > sectorblocks;
1860                 sector->getBlocks(sectorblocks);
1861                 core::list< MapBlock * >::Iterator i;
1862                 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
1863                 {
1864                         MapBlock *block = *i;
1865                         bool changed = block->m_node_metadata.step(dtime);
1866                         if(changed)
1867                                 changed_blocks[block->getPos()] = block;
1868                 }
1869         }
1870 }
1871
1872 /*
1873         ServerMap
1874 */
1875
1876 ServerMap::ServerMap(std::string savedir):
1877         Map(dout_server),
1878         m_seed(0),
1879         m_map_metadata_changed(true)
1880 {
1881         dstream<<__FUNCTION_NAME<<std::endl;
1882
1883         //m_chunksize = 8; // Takes a few seconds
1884
1885         m_seed = (((u64)(myrand()%0xffff)<<0)
1886                         + ((u64)(myrand()%0xffff)<<16)
1887                         + ((u64)(myrand()%0xffff)<<32)
1888                         + ((u64)(myrand()%0xffff)<<48));
1889
1890         /*
1891                 Experimental and debug stuff
1892         */
1893
1894         {
1895         }
1896
1897         /*
1898                 Try to load map; if not found, create a new one.
1899         */
1900
1901         m_savedir = savedir;
1902         m_map_saving_enabled = false;
1903
1904         try
1905         {
1906                 // If directory exists, check contents and load if possible
1907                 if(fs::PathExists(m_savedir))
1908                 {
1909                         // If directory is empty, it is safe to save into it.
1910                         if(fs::GetDirListing(m_savedir).size() == 0)
1911                         {
1912                                 dstream<<DTIME<<"Server: Empty save directory is valid."
1913                                                 <<std::endl;
1914                                 m_map_saving_enabled = true;
1915                         }
1916                         else
1917                         {
1918                                 try{
1919                                         // Load map metadata (seed, chunksize)
1920                                         loadMapMeta();
1921                                 }
1922                                 catch(FileNotGoodException &e){
1923                                         dstream<<DTIME<<"WARNING: Could not load map metadata"
1924                                                         //<<" Disabling chunk-based generator."
1925                                                         <<std::endl;
1926                                         //m_chunksize = 0;
1927                                 }
1928
1929                                 /*try{
1930                                         // Load chunk metadata
1931                                         loadChunkMeta();
1932                                 }
1933                                 catch(FileNotGoodException &e){
1934                                         dstream<<DTIME<<"WARNING: Could not load chunk metadata."
1935                                                         <<" Disabling chunk-based generator."
1936                                                         <<std::endl;
1937                                         m_chunksize = 0;
1938                                 }*/
1939
1940                                 /*dstream<<DTIME<<"Server: Successfully loaded chunk "
1941                                                 "metadata and sector (0,0) from "<<savedir<<
1942                                                 ", assuming valid save directory."
1943                                                 <<std::endl;*/
1944
1945                                 dstream<<DTIME<<"INFO: Server: Successfully loaded map "
1946                                                 <<"and chunk metadata from "<<savedir
1947                                                 <<", assuming valid save directory."
1948                                                 <<std::endl;
1949
1950                                 m_map_saving_enabled = true;
1951                                 // Map loaded, not creating new one
1952                                 return;
1953                         }
1954                 }
1955                 // If directory doesn't exist, it is safe to save to it
1956                 else{
1957                         m_map_saving_enabled = true;
1958                 }
1959         }
1960         catch(std::exception &e)
1961         {
1962                 dstream<<DTIME<<"WARNING: Server: Failed to load map from "<<savedir
1963                                 <<", exception: "<<e.what()<<std::endl;
1964                 dstream<<"Please remove the map or fix it."<<std::endl;
1965                 dstream<<"WARNING: Map saving will be disabled."<<std::endl;
1966         }
1967
1968         dstream<<DTIME<<"INFO: Initializing new map."<<std::endl;
1969
1970         // Create zero sector
1971         emergeSector(v2s16(0,0));
1972
1973         // Initially write whole map
1974         save(false);
1975 }
1976
1977 ServerMap::~ServerMap()
1978 {
1979         dstream<<__FUNCTION_NAME<<std::endl;
1980
1981         try
1982         {
1983                 if(m_map_saving_enabled)
1984                 {
1985                         // Save only changed parts
1986                         save(true);
1987                         dstream<<DTIME<<"Server: saved map to "<<m_savedir<<std::endl;
1988                 }
1989                 else
1990                 {
1991                         dstream<<DTIME<<"Server: map not saved"<<std::endl;
1992                 }
1993         }
1994         catch(std::exception &e)
1995         {
1996                 dstream<<DTIME<<"Server: Failed to save map to "<<m_savedir
1997                                 <<", exception: "<<e.what()<<std::endl;
1998         }
1999
2000 #if 0
2001         /*
2002                 Free all MapChunks
2003         */
2004         core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
2005         for(; i.atEnd() == false; i++)
2006         {
2007                 MapChunk *chunk = i.getNode()->getValue();
2008                 delete chunk;
2009         }
2010 #endif
2011 }
2012
2013 void ServerMap::initBlockMake(mapgen::BlockMakeData *data, v3s16 blockpos)
2014 {
2015         dstream<<"initBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2016                         <<blockpos.Z<<")"<<std::endl;
2017         
2018         // Do nothing if not inside limits (+-1 because of neighbors)
2019         if(blockpos_over_limit(blockpos - v3s16(1,1,1)) ||
2020                 blockpos_over_limit(blockpos + v3s16(1,1,1)))
2021         {
2022                 data->no_op = true;
2023                 return;
2024         }
2025         
2026         data->no_op = false;
2027         data->seed = m_seed;
2028         data->blockpos = blockpos;
2029
2030         /*
2031                 Create the whole area of this and the neighboring blocks
2032         */
2033         {
2034                 //TimeTaker timer("initBlockMake() create area");
2035                 
2036                 for(s16 x=-1; x<=1; x++)
2037                 for(s16 z=-1; z<=1; z++)
2038                 {
2039                         v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2040                         // Sector metadata is loaded from disk if not already loaded.
2041                         ServerMapSector *sector = createSector(sectorpos);
2042                         assert(sector);
2043
2044                         for(s16 y=-1; y<=1; y++)
2045                         {
2046                                 v3s16 p(blockpos.X+x, blockpos.Y+y, blockpos.Z+z);
2047                                 //MapBlock *block = createBlock(p);
2048                                 // 1) get from memory, 2) load from disk
2049                                 MapBlock *block = emergeBlock(p, false);
2050                                 // 3) create a blank one
2051                                 if(block == NULL)
2052                                 {
2053                                         block = createBlock(p);
2054
2055                                         /*
2056                                                 Block gets sunlight if this is true.
2057
2058                                                 Refer to the map generator heuristics.
2059                                         */
2060                                         bool ug = mapgen::block_is_underground(data->seed, p);
2061                                         block->setIsUnderground(ug);
2062                                 }
2063
2064                                 // Lighting will not be valid after make_chunk is called
2065                                 block->setLightingExpired(true);
2066                                 // Lighting will be calculated
2067                                 //block->setLightingExpired(false);
2068                         }
2069                 }
2070         }
2071         
2072         /*
2073                 Now we have a big empty area.
2074
2075                 Make a ManualMapVoxelManipulator that contains this and the
2076                 neighboring blocks
2077         */
2078         
2079         // The area that contains this block and it's neighbors
2080         v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2081         v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2082         
2083         data->vmanip = new ManualMapVoxelManipulator(this);
2084         //data->vmanip->setMap(this);
2085
2086         // Add the area
2087         {
2088                 //TimeTaker timer("initBlockMake() initialEmerge");
2089                 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2090         }
2091
2092         // Data is ready now.
2093 }
2094
2095 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2096                 core::map<v3s16, MapBlock*> &changed_blocks)
2097 {
2098         v3s16 blockpos = data->blockpos;
2099         /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2100                         <<blockpos.Z<<")"<<std::endl;*/
2101
2102         if(data->no_op)
2103         {
2104                 //dstream<<"finishBlockMake(): no-op"<<std::endl;
2105                 return NULL;
2106         }
2107
2108         bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2109
2110         /*dstream<<"Resulting vmanip:"<<std::endl;
2111         data->vmanip.print(dstream);*/
2112         
2113         /*
2114                 Blit generated stuff to map
2115                 NOTE: blitBackAll adds nearly everything to changed_blocks
2116         */
2117         {
2118                 // 70ms @cs=8
2119                 //TimeTaker timer("finishBlockMake() blitBackAll");
2120                 data->vmanip->blitBackAll(&changed_blocks);
2121         }
2122
2123         if(enable_mapgen_debug_info)
2124                 dstream<<"finishBlockMake: changed_blocks.size()="
2125                                 <<changed_blocks.size()<<std::endl;
2126
2127         /*
2128                 Copy transforming liquid information
2129         */
2130         while(data->transforming_liquid.size() > 0)
2131         {
2132                 v3s16 p = data->transforming_liquid.pop_front();
2133                 m_transforming_liquid.push_back(p);
2134         }
2135         
2136         /*
2137                 Get central block
2138         */
2139         MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2140         assert(block);
2141
2142         /*
2143                 Set is_underground flag for lighting with sunlight.
2144
2145                 Refer to map generator heuristics.
2146
2147                 NOTE: This is done in initChunkMake
2148         */
2149         //block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2150
2151
2152         /*
2153                 Add sunlight to central block.
2154                 This makes in-dark-spawning monsters to not flood the whole thing.
2155                 Do not spread the light, though.
2156         */
2157         /*core::map<v3s16, bool> light_sources;
2158         bool black_air_left = false;
2159         block->propagateSunlight(light_sources, true, &black_air_left);*/
2160
2161         /*
2162                 NOTE: Lighting and object adding shouldn't really be here, but
2163                 lighting is a bit tricky to move properly to makeBlock.
2164                 TODO: Do this the right way anyway, that is, move it to makeBlock.
2165                       - There needs to be some way for makeBlock to report back if
2166                             the lighting update is going further down because of the
2167                                 new block blocking light
2168         */
2169
2170         /*
2171                 Update lighting
2172                 NOTE: This takes ~60ms, TODO: Investigate why
2173         */
2174         {
2175                 TimeTaker t("finishBlockMake lighting update");
2176
2177                 core::map<v3s16, MapBlock*> lighting_update_blocks;
2178 #if 1
2179                 // Center block
2180                 lighting_update_blocks.insert(block->getPos(), block);
2181
2182                 /*{
2183                         s16 x = 0;
2184                         s16 z = 0;
2185                         v3s16 p = block->getPos()+v3s16(x,1,z);
2186                         lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2187                 }*/
2188 #endif
2189 #if 0
2190                 // All modified blocks
2191                 // NOTE: Should this be done? If this is not done, then the lighting
2192                 // of the others will be updated in a different place, one by one, i
2193                 // think... or they might not? Well, at least they are left marked as
2194                 // "lighting expired"; it seems that is not handled at all anywhere,
2195                 // so enabling this will slow it down A LOT because otherwise it
2196                 // would not do this at all. This causes the black trees.
2197                 for(core::map<v3s16, MapBlock*>::Iterator
2198                                 i = changed_blocks.getIterator();
2199                                 i.atEnd() == false; i++)
2200                 {
2201                         lighting_update_blocks.insert(i.getNode()->getKey(),
2202                                         i.getNode()->getValue());
2203                 }
2204                 /*// Also force-add all the upmost blocks for proper sunlight
2205                 for(s16 x=-1; x<=1; x++)
2206                 for(s16 z=-1; z<=1; z++)
2207                 {
2208                         v3s16 p = block->getPos()+v3s16(x,1,z);
2209                         lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2210                 }*/
2211 #endif
2212                 updateLighting(lighting_update_blocks, changed_blocks);
2213                 
2214                 /*
2215                         Set lighting to non-expired state in all of them.
2216                         This is cheating, but it is not fast enough if all of them
2217                         would actually be updated.
2218                 */
2219                 for(s16 x=-1; x<=1; x++)
2220                 for(s16 y=-1; y<=1; y++)
2221                 for(s16 z=-1; z<=1; z++)
2222                 {
2223                         v3s16 p = block->getPos()+v3s16(x,y,z);
2224                         getBlockNoCreateNoEx(p)->setLightingExpired(false);
2225                 }
2226
2227                 if(enable_mapgen_debug_info == false)
2228                         t.stop(true); // Hide output
2229         }
2230
2231         /*
2232                 Add random objects to block
2233         */
2234         mapgen::add_random_objects(block);
2235
2236         /*
2237                 Go through changed blocks
2238         */
2239         for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2240                         i.atEnd() == false; i++)
2241         {
2242                 MapBlock *block = i.getNode()->getValue();
2243                 assert(block);
2244                 /*
2245                         Update day/night difference cache of the MapBlocks
2246                 */
2247                 block->updateDayNightDiff();
2248                 /*
2249                         Set block as modified
2250                 */
2251                 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2252         }
2253
2254         /*
2255                 Set central block as generated
2256         */
2257         block->setGenerated(true);
2258         
2259         /*
2260                 Save changed parts of map
2261                 NOTE: Will be saved later.
2262         */
2263         //save(true);
2264
2265         /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2266                         <<blockpos.Z<<")"<<std::endl;*/
2267 #if 0
2268         if(enable_mapgen_debug_info)
2269         {
2270                 /*
2271                         Analyze resulting blocks
2272                 */
2273                 for(s16 x=-1; x<=1; x++)
2274                 for(s16 y=-1; y<=1; y++)
2275                 for(s16 z=-1; z<=1; z++)
2276                 {
2277                         v3s16 p = block->getPos()+v3s16(x,y,z);
2278                         MapBlock *block = getBlockNoCreateNoEx(p);
2279                         char spos[20];
2280                         snprintf(spos, 20, "(%2d,%2d,%2d)", x, y, z);
2281                         dstream<<"Generated "<<spos<<": "
2282                                         <<analyze_block(block)<<std::endl;
2283                 }
2284         }
2285 #endif
2286
2287         return block;
2288 }
2289
2290 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2291 {
2292         DSTACKF("%s: p2d=(%d,%d)",
2293                         __FUNCTION_NAME,
2294                         p2d.X, p2d.Y);
2295         
2296         /*
2297                 Check if it exists already in memory
2298         */
2299         ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2300         if(sector != NULL)
2301                 return sector;
2302         
2303         /*
2304                 Try to load it from disk (with blocks)
2305         */
2306         //if(loadSectorFull(p2d) == true)
2307
2308         /*
2309                 Try to load metadata from disk
2310         */
2311         if(loadSectorMeta(p2d) == true)
2312         {
2313                 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2314                 if(sector == NULL)
2315                 {
2316                         dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2317                         throw InvalidPositionException("");
2318                 }
2319                 return sector;
2320         }
2321
2322         /*
2323                 Do not create over-limit
2324         */
2325         if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2326         || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2327         || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2328         || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2329                 throw InvalidPositionException("createSector(): pos. over limit");
2330
2331         /*
2332                 Generate blank sector
2333         */
2334         
2335         sector = new ServerMapSector(this, p2d);
2336         
2337         // Sector position on map in nodes
2338         v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2339
2340         /*
2341                 Insert to container
2342         */
2343         m_sectors.insert(p2d, sector);
2344         
2345         return sector;
2346 }
2347
2348 /*
2349         This is a quick-hand function for calling makeBlock().
2350 */
2351 MapBlock * ServerMap::generateBlock(
2352                 v3s16 p,
2353                 core::map<v3s16, MapBlock*> &modified_blocks
2354 )
2355 {
2356         DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2357         
2358         /*dstream<<"generateBlock(): "
2359                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2360                         <<std::endl;*/
2361         
2362         bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2363
2364         TimeTaker timer("generateBlock");
2365         
2366         //MapBlock *block = original_dummy;
2367                         
2368         v2s16 p2d(p.X, p.Z);
2369         v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2370         
2371         /*
2372                 Do not generate over-limit
2373         */
2374         if(blockpos_over_limit(p))
2375         {
2376                 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2377                 throw InvalidPositionException("generateBlock(): pos. over limit");
2378         }
2379
2380         /*
2381                 Create block make data
2382         */
2383         mapgen::BlockMakeData data;
2384         initBlockMake(&data, p);
2385
2386         /*
2387                 Generate block
2388         */
2389         {
2390                 TimeTaker t("mapgen::make_block()");
2391                 mapgen::make_block(&data);
2392
2393                 if(enable_mapgen_debug_info == false)
2394                         t.stop(true); // Hide output
2395         }
2396
2397         /*
2398                 Blit data back on map, update lighting, add mobs and whatever this does
2399         */
2400         finishBlockMake(&data, modified_blocks);
2401
2402         /*
2403                 Get central block
2404         */
2405         MapBlock *block = getBlockNoCreateNoEx(p);
2406
2407 #if 0
2408         /*
2409                 Check result
2410         */
2411         if(block)
2412         {
2413                 bool erroneus_content = false;
2414                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2415                 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2416                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2417                 {
2418                         v3s16 p(x0,y0,z0);
2419                         MapNode n = block->getNode(p);
2420                         if(n.getContent() == CONTENT_IGNORE)
2421                         {
2422                                 dstream<<"CONTENT_IGNORE at "
2423                                                 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2424                                                 <<std::endl;
2425                                 erroneus_content = true;
2426                                 assert(0);
2427                         }
2428                 }
2429                 if(erroneus_content)
2430                 {
2431                         assert(0);
2432                 }
2433         }
2434 #endif
2435
2436 #if 0
2437         /*
2438                 Generate a completely empty block
2439         */
2440         if(block)
2441         {
2442                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2443                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2444                 {
2445                         for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2446                         {
2447                                 MapNode n;
2448                                 if(y0%2==0)
2449                                         n.setContent(CONTENT_AIR);
2450                                 else
2451                                         n.setContent(CONTENT_STONE);
2452                                 block->setNode(v3s16(x0,y0,z0), n);
2453                         }
2454                 }
2455         }
2456 #endif
2457
2458         if(enable_mapgen_debug_info == false)
2459                 timer.stop(true); // Hide output
2460
2461         return block;
2462 }
2463
2464 MapBlock * ServerMap::createBlock(v3s16 p)
2465 {
2466         DSTACKF("%s: p=(%d,%d,%d)",
2467                         __FUNCTION_NAME, p.X, p.Y, p.Z);
2468         
2469         /*
2470                 Do not create over-limit
2471         */
2472         if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2473         || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2474         || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2475         || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2476         || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2477         || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2478                 throw InvalidPositionException("createBlock(): pos. over limit");
2479         
2480         v2s16 p2d(p.X, p.Z);
2481         s16 block_y = p.Y;
2482         /*
2483                 This will create or load a sector if not found in memory.
2484                 If block exists on disk, it will be loaded.
2485
2486                 NOTE: On old save formats, this will be slow, as it generates
2487                       lighting on blocks for them.
2488         */
2489         ServerMapSector *sector;
2490         try{
2491                 sector = (ServerMapSector*)createSector(p2d);
2492                 assert(sector->getId() == MAPSECTOR_SERVER);
2493         }
2494         catch(InvalidPositionException &e)
2495         {
2496                 dstream<<"createBlock: createSector() failed"<<std::endl;
2497                 throw e;
2498         }
2499         /*
2500                 NOTE: This should not be done, or at least the exception
2501                 should not be passed on as std::exception, because it
2502                 won't be catched at all.
2503         */
2504         /*catch(std::exception &e)
2505         {
2506                 dstream<<"createBlock: createSector() failed: "
2507                                 <<e.what()<<std::endl;
2508                 throw e;
2509         }*/
2510
2511         /*
2512                 Try to get a block from the sector
2513         */
2514
2515         MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2516         if(block)
2517         {
2518                 if(block->isDummy())
2519                         block->unDummify();
2520                 return block;
2521         }
2522         // Create blank
2523         block = sector->createBlankBlock(block_y);
2524         return block;
2525 }
2526
2527 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2528 {
2529         DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2530                         __FUNCTION_NAME,
2531                         p.X, p.Y, p.Z, allow_generate);
2532         
2533         {
2534                 MapBlock *block = getBlockNoCreateNoEx(p);
2535                 if(block && block->isDummy() == false)
2536                         return block;
2537         }
2538
2539         {
2540                 MapBlock *block = loadBlock(p);
2541                 if(block)
2542                         return block;
2543         }
2544
2545         if(allow_generate)
2546         {
2547                 core::map<v3s16, MapBlock*> modified_blocks;
2548                 MapBlock *block = generateBlock(p, modified_blocks);
2549                 if(block)
2550                 {
2551                         MapEditEvent event;
2552                         event.type = MEET_OTHER;
2553                         event.p = p;
2554
2555                         // Copy modified_blocks to event
2556                         for(core::map<v3s16, MapBlock*>::Iterator
2557                                         i = modified_blocks.getIterator();
2558                                         i.atEnd()==false; i++)
2559                         {
2560                                 event.modified_blocks.insert(i.getNode()->getKey(), false);
2561                         }
2562
2563                         // Queue event
2564                         dispatchEvent(&event);
2565                                                                 
2566                         return block;
2567                 }
2568         }
2569
2570         return NULL;
2571 }
2572
2573 #if 0
2574         /*
2575                 Do not generate over-limit
2576         */
2577         if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2578         || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2579         || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2580         || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2581         || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2582         || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2583                 throw InvalidPositionException("emergeBlock(): pos. over limit");
2584         
2585         v2s16 p2d(p.X, p.Z);
2586         s16 block_y = p.Y;
2587         /*
2588                 This will create or load a sector if not found in memory.
2589                 If block exists on disk, it will be loaded.
2590         */
2591         ServerMapSector *sector;
2592         try{
2593                 sector = createSector(p2d);
2594                 //sector = emergeSector(p2d, changed_blocks);
2595         }
2596         catch(InvalidPositionException &e)
2597         {
2598                 dstream<<"emergeBlock: createSector() failed: "
2599                                 <<e.what()<<std::endl;
2600                 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2601                                 <<std::endl
2602                                 <<"You could try to delete it."<<std::endl;
2603                 throw e;
2604         }
2605         catch(VersionMismatchException &e)
2606         {
2607                 dstream<<"emergeBlock: createSector() failed: "
2608                                 <<e.what()<<std::endl;
2609                 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2610                                 <<std::endl
2611                                 <<"You could try to delete it."<<std::endl;
2612                 throw e;
2613         }
2614
2615         /*
2616                 Try to get a block from the sector
2617         */
2618
2619         bool does_not_exist = false;
2620         bool lighting_expired = false;
2621         MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2622         
2623         // If not found, try loading from disk
2624         if(block == NULL)
2625         {
2626                 block = loadBlock(p);
2627         }
2628         
2629         // Handle result
2630         if(block == NULL)
2631         {
2632                 does_not_exist = true;
2633         }
2634         else if(block->isDummy() == true)
2635         {
2636                 does_not_exist = true;
2637         }
2638         else if(block->getLightingExpired())
2639         {
2640                 lighting_expired = true;
2641         }
2642         else
2643         {
2644                 // Valid block
2645                 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2646                 return block;
2647         }
2648         
2649         /*
2650                 If block was not found on disk and not going to generate a
2651                 new one, make sure there is a dummy block in place.
2652         */
2653         if(only_from_disk && (does_not_exist || lighting_expired))
2654         {
2655                 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2656
2657                 if(block == NULL)
2658                 {
2659                         // Create dummy block
2660                         block = new MapBlock(this, p, true);
2661
2662                         // Add block to sector
2663                         sector->insertBlock(block);
2664                 }
2665                 // Done.
2666                 return block;
2667         }
2668
2669         //dstream<<"Not found on disk, generating."<<std::endl;
2670         // 0ms
2671         //TimeTaker("emergeBlock() generate");
2672
2673         //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2674
2675         /*
2676                 If the block doesn't exist, generate the block.
2677         */
2678         if(does_not_exist)
2679         {
2680                 block = generateBlock(p, block, sector, changed_blocks,
2681                                 lighting_invalidated_blocks); 
2682         }
2683
2684         if(lighting_expired)
2685         {
2686                 lighting_invalidated_blocks.insert(p, block);
2687         }
2688
2689 #if 0
2690         /*
2691                 Initially update sunlight
2692         */
2693         {
2694                 core::map<v3s16, bool> light_sources;
2695                 bool black_air_left = false;
2696                 bool bottom_invalid =
2697                                 block->propagateSunlight(light_sources, true,
2698                                 &black_air_left);
2699
2700                 // If sunlight didn't reach everywhere and part of block is
2701                 // above ground, lighting has to be properly updated
2702                 //if(black_air_left && some_part_underground)
2703                 if(black_air_left)
2704                 {
2705                         lighting_invalidated_blocks[block->getPos()] = block;
2706                 }
2707
2708                 if(bottom_invalid)
2709                 {
2710                         lighting_invalidated_blocks[block->getPos()] = block;
2711                 }
2712         }
2713 #endif
2714         
2715         return block;
2716 }
2717 #endif
2718
2719 s16 ServerMap::findGroundLevel(v2s16 p2d)
2720 {
2721 #if 0
2722         /*
2723                 Uh, just do something random...
2724         */
2725         // Find existing map from top to down
2726         s16 max=63;
2727         s16 min=-64;
2728         v3s16 p(p2d.X, max, p2d.Y);
2729         for(; p.Y>min; p.Y--)
2730         {
2731                 MapNode n = getNodeNoEx(p);
2732                 if(n.getContent() != CONTENT_IGNORE)
2733                         break;
2734         }
2735         if(p.Y == min)
2736                 goto plan_b;
2737         // If this node is not air, go to plan b
2738         if(getNodeNoEx(p).getContent() != CONTENT_AIR)
2739                 goto plan_b;
2740         // Search existing walkable and return it
2741         for(; p.Y>min; p.Y--)
2742         {
2743                 MapNode n = getNodeNoEx(p);
2744                 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
2745                         return p.Y;
2746         }
2747
2748         // Move to plan b
2749 plan_b:
2750 #endif
2751
2752         /*
2753                 Determine from map generator noise functions
2754         */
2755         
2756         s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2757         return level;
2758
2759         //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2760         //return (s16)level;
2761 }
2762
2763 void ServerMap::createDirs(std::string path)
2764 {
2765         if(fs::CreateAllDirs(path) == false)
2766         {
2767                 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2768                                 <<"\""<<path<<"\""<<std::endl;
2769                 throw BaseException("ServerMap failed to create directory");
2770         }
2771 }
2772
2773 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2774 {
2775         char cc[9];
2776         switch(layout)
2777         {
2778                 case 1:
2779                         snprintf(cc, 9, "%.4x%.4x",
2780                                 (unsigned int)pos.X&0xffff,
2781                                 (unsigned int)pos.Y&0xffff);
2782
2783                         return m_savedir + "/sectors/" + cc;
2784                 case 2:
2785                         snprintf(cc, 9, "%.3x/%.3x",
2786                                 (unsigned int)pos.X&0xfff,
2787                                 (unsigned int)pos.Y&0xfff);
2788
2789                         return m_savedir + "/sectors2/" + cc;
2790                 default:
2791                         assert(false);
2792         }
2793 }
2794
2795 v2s16 ServerMap::getSectorPos(std::string dirname)
2796 {
2797         unsigned int x, y;
2798         int r;
2799         size_t spos = dirname.rfind('/') + 1;
2800         assert(spos != std::string::npos);
2801         if(dirname.size() - spos == 8)
2802         {
2803                 // Old layout
2804                 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2805         }
2806         else if(dirname.size() - spos == 3)
2807         {
2808                 // New layout
2809                 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2810                 // Sign-extend the 12 bit values up to 16 bits...
2811                 if(x&0x800) x|=0xF000;
2812                 if(y&0x800) y|=0xF000;
2813         }
2814         else
2815         {
2816                 assert(false);
2817         }
2818         assert(r == 2);
2819         v2s16 pos((s16)x, (s16)y);
2820         return pos;
2821 }
2822
2823 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2824 {
2825         v2s16 p2d = getSectorPos(sectordir);
2826
2827         if(blockfile.size() != 4){
2828                 throw InvalidFilenameException("Invalid block filename");
2829         }
2830         unsigned int y;
2831         int r = sscanf(blockfile.c_str(), "%4x", &y);
2832         if(r != 1)
2833                 throw InvalidFilenameException("Invalid block filename");
2834         return v3s16(p2d.X, y, p2d.Y);
2835 }
2836
2837 std::string ServerMap::getBlockFilename(v3s16 p)
2838 {
2839         char cc[5];
2840         snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2841         return cc;
2842 }
2843
2844 void ServerMap::save(bool only_changed)
2845 {
2846         DSTACK(__FUNCTION_NAME);
2847         if(m_map_saving_enabled == false)
2848         {
2849                 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2850                 return;
2851         }
2852         
2853         if(only_changed == false)
2854                 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2855                                 <<std::endl;
2856         
2857         if(only_changed == false || m_map_metadata_changed)
2858         {
2859                 saveMapMeta();
2860         }
2861
2862         u32 sector_meta_count = 0;
2863         u32 block_count = 0;
2864         u32 block_count_all = 0; // Number of blocks in memory
2865         
2866         core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2867         for(; i.atEnd() == false; i++)
2868         {
2869                 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2870                 assert(sector->getId() == MAPSECTOR_SERVER);
2871         
2872                 if(sector->differs_from_disk || only_changed == false)
2873                 {
2874                         saveSectorMeta(sector);
2875                         sector_meta_count++;
2876                 }
2877                 core::list<MapBlock*> blocks;
2878                 sector->getBlocks(blocks);
2879                 core::list<MapBlock*>::Iterator j;
2880                 for(j=blocks.begin(); j!=blocks.end(); j++)
2881                 {
2882                         MapBlock *block = *j;
2883                         
2884                         block_count_all++;
2885
2886                         if(block->getModified() >= MOD_STATE_WRITE_NEEDED 
2887                                         || only_changed == false)
2888                         {
2889                                 saveBlock(block);
2890                                 block_count++;
2891
2892                                 /*dstream<<"ServerMap: Written block ("
2893                                                 <<block->getPos().X<<","
2894                                                 <<block->getPos().Y<<","
2895                                                 <<block->getPos().Z<<")"
2896                                                 <<std::endl;*/
2897                         }
2898                 }
2899         }
2900
2901         /*
2902                 Only print if something happened or saved whole map
2903         */
2904         if(only_changed == false || sector_meta_count != 0
2905                         || block_count != 0)
2906         {
2907                 dstream<<DTIME<<"ServerMap: Written: "
2908                                 <<sector_meta_count<<" sector metadata files, "
2909                                 <<block_count<<" block files"
2910                                 <<", "<<block_count_all<<" blocks in memory."
2911                                 <<std::endl;
2912         }
2913 }
2914
2915 void ServerMap::saveMapMeta()
2916 {
2917         DSTACK(__FUNCTION_NAME);
2918         
2919         dstream<<"INFO: ServerMap::saveMapMeta(): "
2920                         <<"seed="<<m_seed
2921                         <<std::endl;
2922
2923         createDirs(m_savedir);
2924         
2925         std::string fullpath = m_savedir + "/map_meta.txt";
2926         std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2927         if(os.good() == false)
2928         {
2929                 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2930                                 <<"could not open"<<fullpath<<std::endl;
2931                 throw FileNotGoodException("Cannot open chunk metadata");
2932         }
2933         
2934         Settings params;
2935         params.setU64("seed", m_seed);
2936
2937         params.writeLines(os);
2938
2939         os<<"[end_of_params]\n";
2940         
2941         m_map_metadata_changed = false;
2942 }
2943
2944 void ServerMap::loadMapMeta()
2945 {
2946         DSTACK(__FUNCTION_NAME);
2947         
2948         dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2949                         <<std::endl;
2950
2951         std::string fullpath = m_savedir + "/map_meta.txt";
2952         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2953         if(is.good() == false)
2954         {
2955                 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2956                                 <<"could not open"<<fullpath<<std::endl;
2957                 throw FileNotGoodException("Cannot open map metadata");
2958         }
2959
2960         Settings params;
2961
2962         for(;;)
2963         {
2964                 if(is.eof())
2965                         throw SerializationError
2966                                         ("ServerMap::loadMapMeta(): [end_of_params] not found");
2967                 std::string line;
2968                 std::getline(is, line);
2969                 std::string trimmedline = trim(line);
2970                 if(trimmedline == "[end_of_params]")
2971                         break;
2972                 params.parseConfigLine(line);
2973         }
2974
2975         m_seed = params.getU64("seed");
2976
2977         dstream<<"INFO: ServerMap::loadMapMeta(): "
2978                         <<"seed="<<m_seed
2979                         <<std::endl;
2980 }
2981
2982 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2983 {
2984         DSTACK(__FUNCTION_NAME);
2985         // Format used for writing
2986         u8 version = SER_FMT_VER_HIGHEST;
2987         // Get destination
2988         v2s16 pos = sector->getPos();
2989         std::string dir = getSectorDir(pos);
2990         createDirs(dir);
2991         
2992         std::string fullpath = dir + "/meta";
2993         std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2994         if(o.good() == false)
2995                 throw FileNotGoodException("Cannot open sector metafile");
2996
2997         sector->serialize(o, version);
2998         
2999         sector->differs_from_disk = false;
3000 }
3001
3002 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
3003 {
3004         DSTACK(__FUNCTION_NAME);
3005         // Get destination
3006         v2s16 p2d = getSectorPos(sectordir);
3007
3008         ServerMapSector *sector = NULL;
3009
3010         std::string fullpath = sectordir + "/meta";
3011         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3012         if(is.good() == false)
3013         {
3014                 // If the directory exists anyway, it probably is in some old
3015                 // format. Just go ahead and create the sector.
3016                 if(fs::PathExists(sectordir))
3017                 {
3018                         /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
3019                                         <<fullpath<<" doesn't exist but directory does."
3020                                         <<" Continuing with a sector with no metadata."
3021                                         <<std::endl;*/
3022                         sector = new ServerMapSector(this, p2d);
3023                         m_sectors.insert(p2d, sector);
3024                 }
3025                 else
3026                 {
3027                         throw FileNotGoodException("Cannot open sector metafile");
3028                 }
3029         }
3030         else
3031         {
3032                 sector = ServerMapSector::deSerialize
3033                                 (is, this, p2d, m_sectors);
3034                 if(save_after_load)
3035                         saveSectorMeta(sector);
3036         }
3037         
3038         sector->differs_from_disk = false;
3039
3040         return sector;
3041 }
3042
3043 bool ServerMap::loadSectorMeta(v2s16 p2d)
3044 {
3045         DSTACK(__FUNCTION_NAME);
3046
3047         MapSector *sector = NULL;
3048
3049         // The directory layout we're going to load from.
3050         //  1 - original sectors/xxxxzzzz/
3051         //  2 - new sectors2/xxx/zzz/
3052         //  If we load from anything but the latest structure, we will
3053         //  immediately save to the new one, and remove the old.
3054         int loadlayout = 1;
3055         std::string sectordir1 = getSectorDir(p2d, 1);
3056         std::string sectordir;
3057         if(fs::PathExists(sectordir1))
3058         {
3059                 sectordir = sectordir1;
3060         }
3061         else
3062         {
3063                 loadlayout = 2;
3064                 sectordir = getSectorDir(p2d, 2);
3065         }
3066
3067         try{
3068                 sector = loadSectorMeta(sectordir, loadlayout != 2);
3069         }
3070         catch(InvalidFilenameException &e)
3071         {
3072                 return false;
3073         }
3074         catch(FileNotGoodException &e)
3075         {
3076                 return false;
3077         }
3078         catch(std::exception &e)
3079         {
3080                 return false;
3081         }
3082         
3083         return true;
3084 }
3085
3086 #if 0
3087 bool ServerMap::loadSectorFull(v2s16 p2d)
3088 {
3089         DSTACK(__FUNCTION_NAME);
3090
3091         MapSector *sector = NULL;
3092
3093         // The directory layout we're going to load from.
3094         //  1 - original sectors/xxxxzzzz/
3095         //  2 - new sectors2/xxx/zzz/
3096         //  If we load from anything but the latest structure, we will
3097         //  immediately save to the new one, and remove the old.
3098         int loadlayout = 1;
3099         std::string sectordir1 = getSectorDir(p2d, 1);
3100         std::string sectordir;
3101         if(fs::PathExists(sectordir1))
3102         {
3103                 sectordir = sectordir1;
3104         }
3105         else
3106         {
3107                 loadlayout = 2;
3108                 sectordir = getSectorDir(p2d, 2);
3109         }
3110
3111         try{
3112                 sector = loadSectorMeta(sectordir, loadlayout != 2);
3113         }
3114         catch(InvalidFilenameException &e)
3115         {
3116                 return false;
3117         }
3118         catch(FileNotGoodException &e)
3119         {
3120                 return false;
3121         }
3122         catch(std::exception &e)
3123         {
3124                 return false;
3125         }
3126         
3127         /*
3128                 Load blocks
3129         */
3130         std::vector<fs::DirListNode> list2 = fs::GetDirListing
3131                         (sectordir);
3132         std::vector<fs::DirListNode>::iterator i2;
3133         for(i2=list2.begin(); i2!=list2.end(); i2++)
3134         {
3135                 // We want files
3136                 if(i2->dir)
3137                         continue;
3138                 try{
3139                         loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3140                 }
3141                 catch(InvalidFilenameException &e)
3142                 {
3143                         // This catches unknown crap in directory
3144                 }
3145         }
3146
3147         if(loadlayout != 2)
3148         {
3149                 dstream<<"Sector converted to new layout - deleting "<<
3150                         sectordir1<<std::endl;
3151                 fs::RecursiveDelete(sectordir1);
3152         }
3153
3154         return true;
3155 }
3156 #endif
3157
3158 void ServerMap::saveBlock(MapBlock *block)
3159 {
3160         DSTACK(__FUNCTION_NAME);
3161         /*
3162                 Dummy blocks are not written
3163         */
3164         if(block->isDummy())
3165         {
3166                 /*v3s16 p = block->getPos();
3167                 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3168                                 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3169                 return;
3170         }
3171
3172         // Format used for writing
3173         u8 version = SER_FMT_VER_HIGHEST;
3174         // Get destination
3175         v3s16 p3d = block->getPos();
3176         
3177         v2s16 p2d(p3d.X, p3d.Z);
3178         std::string sectordir = getSectorDir(p2d);
3179
3180         createDirs(sectordir);
3181
3182         std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3183         std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3184         if(o.good() == false)
3185                 throw FileNotGoodException("Cannot open block data");
3186
3187         /*
3188                 [0] u8 serialization version
3189                 [1] data
3190         */
3191         o.write((char*)&version, 1);
3192         
3193         // Write basic data
3194         block->serialize(o, version);
3195         
3196         // Write extra data stored on disk
3197         block->serializeDiskExtra(o, version);
3198
3199         // We just wrote it to the disk so clear modified flag
3200         block->resetModified();
3201 }
3202
3203 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3204 {
3205         DSTACK(__FUNCTION_NAME);
3206
3207         std::string fullpath = sectordir+"/"+blockfile;
3208         try{
3209
3210                 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3211                 if(is.good() == false)
3212                         throw FileNotGoodException("Cannot open block file");
3213                 
3214                 v3s16 p3d = getBlockPos(sectordir, blockfile);
3215                 v2s16 p2d(p3d.X, p3d.Z);
3216                 
3217                 assert(sector->getPos() == p2d);
3218                 
3219                 u8 version = SER_FMT_VER_INVALID;
3220                 is.read((char*)&version, 1);
3221
3222                 if(is.fail())
3223                         throw SerializationError("ServerMap::loadBlock(): Failed"
3224                                         " to read MapBlock version");
3225
3226                 /*u32 block_size = MapBlock::serializedLength(version);
3227                 SharedBuffer<u8> data(block_size);
3228                 is.read((char*)*data, block_size);*/
3229
3230                 // This will always return a sector because we're the server
3231                 //MapSector *sector = emergeSector(p2d);
3232
3233                 MapBlock *block = NULL;
3234                 bool created_new = false;
3235                 block = sector->getBlockNoCreateNoEx(p3d.Y);
3236                 if(block == NULL)
3237                 {
3238                         block = sector->createBlankBlockNoInsert(p3d.Y);
3239                         created_new = true;
3240                 }
3241                 
3242                 // Read basic data
3243                 block->deSerialize(is, version);
3244
3245                 // Read extra data stored on disk
3246                 block->deSerializeDiskExtra(is, version);
3247                 
3248                 // If it's a new block, insert it to the map
3249                 if(created_new)
3250                         sector->insertBlock(block);
3251                 
3252                 /*
3253                         Save blocks loaded in old format in new format
3254                 */
3255
3256                 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3257                 {
3258                         saveBlock(block);
3259                 }
3260                 
3261                 // We just loaded it from the disk, so it's up-to-date.
3262                 block->resetModified();
3263
3264         }
3265         catch(SerializationError &e)
3266         {
3267                 dstream<<"WARNING: Invalid block data on disk "
3268                                 <<"fullpath="<<fullpath
3269                                 <<" (SerializationError). "
3270                                 <<"what()="<<e.what()
3271                                 <<std::endl;
3272                                 //" Ignoring. A new one will be generated.
3273                 assert(0);
3274
3275                 // TODO: Backup file; name is in fullpath.
3276         }
3277 }
3278
3279 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3280 {
3281         DSTACK(__FUNCTION_NAME);
3282
3283         v2s16 p2d(blockpos.X, blockpos.Z);
3284
3285         // The directory layout we're going to load from.
3286         //  1 - original sectors/xxxxzzzz/
3287         //  2 - new sectors2/xxx/zzz/
3288         //  If we load from anything but the latest structure, we will
3289         //  immediately save to the new one, and remove the old.
3290         int loadlayout = 1;
3291         std::string sectordir1 = getSectorDir(p2d, 1);
3292         std::string sectordir;
3293         if(fs::PathExists(sectordir1))
3294         {
3295                 sectordir = sectordir1;
3296         }
3297         else
3298         {
3299                 loadlayout = 2;
3300                 sectordir = getSectorDir(p2d, 2);
3301         }
3302         
3303         /*
3304                 Make sure sector is loaded
3305         */
3306         MapSector *sector = getSectorNoGenerateNoEx(p2d);
3307         if(sector == NULL)
3308         {
3309                 try{
3310                         sector = loadSectorMeta(sectordir, loadlayout != 2);
3311                 }
3312                 catch(InvalidFilenameException &e)
3313                 {
3314                         return false;
3315                 }
3316                 catch(FileNotGoodException &e)
3317                 {
3318                         return false;
3319                 }
3320                 catch(std::exception &e)
3321                 {
3322                         return false;
3323                 }
3324         }
3325         
3326         /*
3327                 Make sure file exists
3328         */
3329
3330         std::string blockfilename = getBlockFilename(blockpos);
3331         if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3332                 return NULL;
3333
3334         /*
3335                 Load block
3336         */
3337         loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3338         return getBlockNoCreateNoEx(blockpos);
3339 }
3340
3341 void ServerMap::PrintInfo(std::ostream &out)
3342 {
3343         out<<"ServerMap: ";
3344 }
3345
3346 #ifndef SERVER
3347
3348 /*
3349         ClientMap
3350 */
3351
3352 ClientMap::ClientMap(
3353                 Client *client,
3354                 MapDrawControl &control,
3355                 scene::ISceneNode* parent,
3356                 scene::ISceneManager* mgr,
3357                 s32 id
3358 ):
3359         Map(dout_client),
3360         scene::ISceneNode(parent, mgr, id),
3361         m_client(client),
3362         m_control(control),
3363         m_camera_position(0,0,0),
3364         m_camera_direction(0,0,1)
3365 {
3366         m_camera_mutex.Init();
3367         assert(m_camera_mutex.IsInitialized());
3368         
3369         m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3370                         BS*1000000,BS*1000000,BS*1000000);
3371 }
3372
3373 ClientMap::~ClientMap()
3374 {
3375         /*JMutexAutoLock lock(mesh_mutex);
3376         
3377         if(mesh != NULL)
3378         {
3379                 mesh->drop();
3380                 mesh = NULL;
3381         }*/
3382 }
3383
3384 MapSector * ClientMap::emergeSector(v2s16 p2d)
3385 {
3386         DSTACK(__FUNCTION_NAME);
3387         // Check that it doesn't exist already
3388         try{
3389                 return getSectorNoGenerate(p2d);
3390         }
3391         catch(InvalidPositionException &e)
3392         {
3393         }
3394         
3395         // Create a sector
3396         ClientMapSector *sector = new ClientMapSector(this, p2d);
3397         
3398         {
3399                 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3400                 m_sectors.insert(p2d, sector);
3401         }
3402         
3403         return sector;
3404 }
3405
3406 #if 0
3407 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3408 {
3409         DSTACK(__FUNCTION_NAME);
3410         ClientMapSector *sector = NULL;
3411
3412         //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3413         
3414         core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3415
3416         if(n != NULL)
3417         {
3418                 sector = (ClientMapSector*)n->getValue();
3419                 assert(sector->getId() == MAPSECTOR_CLIENT);
3420         }
3421         else
3422         {
3423                 sector = new ClientMapSector(this, p2d);
3424                 {
3425                         //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3426                         m_sectors.insert(p2d, sector);
3427                 }
3428         }
3429
3430         sector->deSerialize(is);
3431 }
3432 #endif
3433
3434 void ClientMap::OnRegisterSceneNode()
3435 {
3436         if(IsVisible)
3437         {
3438                 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3439                 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3440         }
3441
3442         ISceneNode::OnRegisterSceneNode();
3443 }
3444
3445 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3446 {
3447         //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3448         DSTACK(__FUNCTION_NAME);
3449
3450         bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3451         
3452         /*
3453                 This is called two times per frame, reset on the non-transparent one
3454         */
3455         if(pass == scene::ESNRP_SOLID)
3456         {
3457                 m_last_drawn_sectors.clear();
3458         }
3459
3460         /*
3461                 Get time for measuring timeout.
3462                 
3463                 Measuring time is very useful for long delays when the
3464                 machine is swapping a lot.
3465         */
3466         int time1 = time(0);
3467
3468         //u32 daynight_ratio = m_client->getDayNightRatio();
3469
3470         m_camera_mutex.Lock();
3471         v3f camera_position = m_camera_position;
3472         v3f camera_direction = m_camera_direction;
3473         m_camera_mutex.Unlock();
3474
3475         /*
3476                 Get all blocks and draw all visible ones
3477         */
3478
3479         v3s16 cam_pos_nodes(
3480                         camera_position.X / BS,
3481                         camera_position.Y / BS,
3482                         camera_position.Z / BS);
3483
3484         v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3485
3486         v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3487         v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3488
3489         // Take a fair amount as we will be dropping more out later
3490         v3s16 p_blocks_min(
3491                         p_nodes_min.X / MAP_BLOCKSIZE - 2,
3492                         p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3493                         p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3494         v3s16 p_blocks_max(
3495                         p_nodes_max.X / MAP_BLOCKSIZE + 1,
3496                         p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3497                         p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3498         
3499         u32 vertex_count = 0;
3500         
3501         // For limiting number of mesh updates per frame
3502         u32 mesh_update_count = 0;
3503         
3504         u32 blocks_would_have_drawn = 0;
3505         u32 blocks_drawn = 0;
3506
3507         int timecheck_counter = 0;
3508         core::map<v2s16, MapSector*>::Iterator si;
3509         si = m_sectors.getIterator();
3510         for(; si.atEnd() == false; si++)
3511         {
3512                 {
3513                         timecheck_counter++;
3514                         if(timecheck_counter > 50)
3515                         {
3516                                 timecheck_counter = 0;
3517                                 int time2 = time(0);
3518                                 if(time2 > time1 + 4)
3519                                 {
3520                                         dstream<<"ClientMap::renderMap(): "
3521                                                 "Rendering takes ages, returning."
3522                                                 <<std::endl;
3523                                         return;
3524                                 }
3525                         }
3526                 }
3527
3528                 MapSector *sector = si.getNode()->getValue();
3529                 v2s16 sp = sector->getPos();
3530                 
3531                 if(m_control.range_all == false)
3532                 {
3533                         if(sp.X < p_blocks_min.X
3534                         || sp.X > p_blocks_max.X
3535                         || sp.Y < p_blocks_min.Z
3536                         || sp.Y > p_blocks_max.Z)
3537                                 continue;
3538                 }
3539
3540                 core::list< MapBlock * > sectorblocks;
3541                 sector->getBlocks(sectorblocks);
3542                 
3543                 /*
3544                         Draw blocks
3545                 */
3546                 
3547                 u32 sector_blocks_drawn = 0;
3548
3549                 core::list< MapBlock * >::Iterator i;
3550                 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3551                 {
3552                         MapBlock *block = *i;
3553
3554                         /*
3555                                 Compare block position to camera position, skip
3556                                 if not seen on display
3557                         */
3558                         
3559                         float range = 100000 * BS;
3560                         if(m_control.range_all == false)
3561                                 range = m_control.wanted_range * BS;
3562                         
3563                         float d = 0.0;
3564                         if(isBlockInSight(block->getPos(), camera_position,
3565                                         camera_direction, range, &d) == false)
3566                         {
3567                                 continue;
3568                         }
3569
3570                         // Okay, this block will be drawn. Reset usage timer.
3571                         block->resetUsageTimer();
3572                         
3573                         // This is ugly (spherical distance limit?)
3574                         /*if(m_control.range_all == false &&
3575                                         d - 0.5*BS*MAP_BLOCKSIZE > range)
3576                                 continue;*/
3577
3578 #if 1
3579                         /*
3580                                 Update expired mesh (used for day/night change)
3581
3582                                 It doesn't work exactly like it should now with the
3583                                 tasked mesh update but whatever.
3584                         */
3585
3586                         bool mesh_expired = false;
3587                         
3588                         {
3589                                 JMutexAutoLock lock(block->mesh_mutex);
3590
3591                                 mesh_expired = block->getMeshExpired();
3592
3593                                 // Mesh has not been expired and there is no mesh:
3594                                 // block has no content
3595                                 if(block->mesh == NULL && mesh_expired == false)
3596                                         continue;
3597                         }
3598
3599                         f32 faraway = BS*50;
3600                         //f32 faraway = m_control.wanted_range * BS;
3601                         
3602                         /*
3603                                 This has to be done with the mesh_mutex unlocked
3604                         */
3605                         // Pretty random but this should work somewhat nicely
3606                         if(mesh_expired && (
3607                                         (mesh_update_count < 3
3608                                                 && (d < faraway || mesh_update_count < 2)
3609                                         )
3610                                         || 
3611                                         (m_control.range_all && mesh_update_count < 20)
3612                                 )
3613                         )
3614                         /*if(mesh_expired && mesh_update_count < 6
3615                                         && (d < faraway || mesh_update_count < 3))*/
3616                         {
3617                                 mesh_update_count++;
3618
3619                                 // Mesh has been expired: generate new mesh
3620                                 //block->updateMesh(daynight_ratio);
3621                                 m_client->addUpdateMeshTask(block->getPos());
3622
3623                                 mesh_expired = false;
3624                         }
3625                         
3626 #endif
3627                         /*
3628                                 Draw the faces of the block
3629                         */
3630                         {
3631                                 JMutexAutoLock lock(block->mesh_mutex);
3632
3633                                 scene::SMesh *mesh = block->mesh;
3634
3635                                 if(mesh == NULL)
3636                                         continue;
3637                                 
3638                                 blocks_would_have_drawn++;
3639                                 if(blocks_drawn >= m_control.wanted_max_blocks
3640                                                 && m_control.range_all == false
3641                                                 && d > m_control.wanted_min_range * BS)
3642                                         continue;
3643
3644                                 blocks_drawn++;
3645                                 sector_blocks_drawn++;
3646
3647                                 u32 c = mesh->getMeshBufferCount();
3648
3649                                 for(u32 i=0; i<c; i++)
3650                                 {
3651                                         scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3652                                         const video::SMaterial& material = buf->getMaterial();
3653                                         video::IMaterialRenderer* rnd =
3654                                                         driver->getMaterialRenderer(material.MaterialType);
3655                                         bool transparent = (rnd && rnd->isTransparent());
3656                                         // Render transparent on transparent pass and likewise.
3657                                         if(transparent == is_transparent_pass)
3658                                         {
3659                                                 /*
3660                                                         This *shouldn't* hurt too much because Irrlicht
3661                                                         doesn't change opengl textures if the old
3662                                                         material is set again.
3663                                                 */
3664                                                 driver->setMaterial(buf->getMaterial());
3665                                                 driver->drawMeshBuffer(buf);
3666                                                 vertex_count += buf->getVertexCount();
3667                                         }
3668                                 }
3669                         }
3670                 } // foreach sectorblocks
3671
3672                 if(sector_blocks_drawn != 0)
3673                 {
3674                         m_last_drawn_sectors[sp] = true;
3675                 }
3676         }
3677         
3678         m_control.blocks_drawn = blocks_drawn;
3679         m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3680
3681         /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3682                         <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3683 }
3684
3685 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3686                 core::map<v3s16, MapBlock*> *affected_blocks)
3687 {
3688         bool changed = false;
3689         /*
3690                 Add it to all blocks touching it
3691         */
3692         v3s16 dirs[7] = {
3693                 v3s16(0,0,0), // this
3694                 v3s16(0,0,1), // back
3695                 v3s16(0,1,0), // top
3696                 v3s16(1,0,0), // right
3697                 v3s16(0,0,-1), // front
3698                 v3s16(0,-1,0), // bottom
3699                 v3s16(-1,0,0), // left
3700         };
3701         for(u16 i=0; i<7; i++)
3702         {
3703                 v3s16 p2 = p + dirs[i];
3704                 // Block position of neighbor (or requested) node
3705                 v3s16 blockpos = getNodeBlockPos(p2);
3706                 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3707                 if(blockref == NULL)
3708                         continue;
3709                 // Relative position of requested node
3710                 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3711                 if(blockref->setTempMod(relpos, mod))
3712                 {
3713                         changed = true;
3714                 }
3715         }
3716         if(changed && affected_blocks!=NULL)
3717         {
3718                 for(u16 i=0; i<7; i++)
3719                 {
3720                         v3s16 p2 = p + dirs[i];
3721                         // Block position of neighbor (or requested) node
3722                         v3s16 blockpos = getNodeBlockPos(p2);
3723                         MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3724                         if(blockref == NULL)
3725                                 continue;
3726                         affected_blocks->insert(blockpos, blockref);
3727                 }
3728         }
3729         return changed;
3730 }
3731
3732 bool ClientMap::clearTempMod(v3s16 p,
3733                 core::map<v3s16, MapBlock*> *affected_blocks)
3734 {
3735         bool changed = false;
3736         v3s16 dirs[7] = {
3737                 v3s16(0,0,0), // this
3738                 v3s16(0,0,1), // back
3739                 v3s16(0,1,0), // top
3740                 v3s16(1,0,0), // right
3741                 v3s16(0,0,-1), // front
3742                 v3s16(0,-1,0), // bottom
3743                 v3s16(-1,0,0), // left
3744         };
3745         for(u16 i=0; i<7; i++)
3746         {
3747                 v3s16 p2 = p + dirs[i];
3748                 // Block position of neighbor (or requested) node
3749                 v3s16 blockpos = getNodeBlockPos(p2);
3750                 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3751                 if(blockref == NULL)
3752                         continue;
3753                 // Relative position of requested node
3754                 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3755                 if(blockref->clearTempMod(relpos))
3756                 {
3757                         changed = true;
3758                 }
3759         }
3760         if(changed && affected_blocks!=NULL)
3761         {
3762                 for(u16 i=0; i<7; i++)
3763                 {
3764                         v3s16 p2 = p + dirs[i];
3765                         // Block position of neighbor (or requested) node
3766                         v3s16 blockpos = getNodeBlockPos(p2);
3767                         MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3768                         if(blockref == NULL)
3769                                 continue;
3770                         affected_blocks->insert(blockpos, blockref);
3771                 }
3772         }
3773         return changed;
3774 }
3775
3776 void ClientMap::expireMeshes(bool only_daynight_diffed)
3777 {
3778         TimeTaker timer("expireMeshes()");
3779
3780         core::map<v2s16, MapSector*>::Iterator si;
3781         si = m_sectors.getIterator();
3782         for(; si.atEnd() == false; si++)
3783         {
3784                 MapSector *sector = si.getNode()->getValue();
3785
3786                 core::list< MapBlock * > sectorblocks;
3787                 sector->getBlocks(sectorblocks);
3788                 
3789                 core::list< MapBlock * >::Iterator i;
3790                 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3791                 {
3792                         MapBlock *block = *i;
3793
3794                         if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3795                         {
3796                                 continue;
3797                         }
3798                         
3799                         {
3800                                 JMutexAutoLock lock(block->mesh_mutex);
3801                                 if(block->mesh != NULL)
3802                                 {
3803                                         /*block->mesh->drop();
3804                                         block->mesh = NULL;*/
3805                                         block->setMeshExpired(true);
3806                                 }
3807                         }
3808                 }
3809         }
3810 }
3811
3812 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3813 {
3814         assert(mapType() == MAPTYPE_CLIENT);
3815
3816         try{
3817                 v3s16 p = blockpos + v3s16(0,0,0);
3818                 MapBlock *b = getBlockNoCreate(p);
3819                 b->updateMesh(daynight_ratio);
3820                 //b->setMeshExpired(true);
3821         }
3822         catch(InvalidPositionException &e){}
3823         // Leading edge
3824         try{
3825                 v3s16 p = blockpos + v3s16(-1,0,0);
3826                 MapBlock *b = getBlockNoCreate(p);
3827                 b->updateMesh(daynight_ratio);
3828                 //b->setMeshExpired(true);
3829         }
3830         catch(InvalidPositionException &e){}
3831         try{
3832                 v3s16 p = blockpos + v3s16(0,-1,0);
3833                 MapBlock *b = getBlockNoCreate(p);
3834                 b->updateMesh(daynight_ratio);
3835                 //b->setMeshExpired(true);
3836         }
3837         catch(InvalidPositionException &e){}
3838         try{
3839                 v3s16 p = blockpos + v3s16(0,0,-1);
3840                 MapBlock *b = getBlockNoCreate(p);
3841                 b->updateMesh(daynight_ratio);
3842                 //b->setMeshExpired(true);
3843         }
3844         catch(InvalidPositionException &e){}
3845 }
3846
3847 #if 0
3848 /*
3849         Update mesh of block in which the node is, and if the node is at the
3850         leading edge, update the appropriate leading blocks too.
3851 */
3852 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3853 {
3854         v3s16 dirs[4] = {
3855                 v3s16(0,0,0),
3856                 v3s16(-1,0,0),
3857                 v3s16(0,-1,0),
3858                 v3s16(0,0,-1),
3859         };
3860         v3s16 blockposes[4];
3861         for(u32 i=0; i<4; i++)
3862         {
3863                 v3s16 np = nodepos + dirs[i];
3864                 blockposes[i] = getNodeBlockPos(np);
3865                 // Don't update mesh of block if it has been done already
3866                 bool already_updated = false;
3867                 for(u32 j=0; j<i; j++)
3868                 {
3869                         if(blockposes[j] == blockposes[i])
3870                         {
3871                                 already_updated = true;
3872                                 break;
3873                         }
3874                 }
3875                 if(already_updated)
3876                         continue;
3877                 // Update mesh
3878                 MapBlock *b = getBlockNoCreate(blockposes[i]);
3879                 b->updateMesh(daynight_ratio);
3880         }
3881 }
3882 #endif
3883
3884 void ClientMap::PrintInfo(std::ostream &out)
3885 {
3886         out<<"ClientMap: ";
3887 }
3888
3889 #endif // !SERVER
3890
3891 /*
3892         MapVoxelManipulator
3893 */
3894
3895 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3896 {
3897         m_map = map;
3898 }
3899
3900 MapVoxelManipulator::~MapVoxelManipulator()
3901 {
3902         /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3903                         <<std::endl;*/
3904 }
3905
3906 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3907 {
3908         TimeTaker timer1("emerge", &emerge_time);
3909
3910         // Units of these are MapBlocks
3911         v3s16 p_min = getNodeBlockPos(a.MinEdge);
3912         v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3913
3914         VoxelArea block_area_nodes
3915                         (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3916
3917         addArea(block_area_nodes);
3918
3919         for(s32 z=p_min.Z; z<=p_max.Z; z++)
3920         for(s32 y=p_min.Y; y<=p_max.Y; y++)
3921         for(s32 x=p_min.X; x<=p_max.X; x++)
3922         {
3923                 v3s16 p(x,y,z);
3924                 core::map<v3s16, bool>::Node *n;
3925                 n = m_loaded_blocks.find(p);
3926                 if(n != NULL)
3927                         continue;
3928                 
3929                 bool block_data_inexistent = false;
3930                 try
3931                 {
3932                         TimeTaker timer1("emerge load", &emerge_load_time);
3933
3934                         /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3935                                         <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3936                                         <<" wanted area: ";
3937                         a.print(dstream);
3938                         dstream<<std::endl;*/
3939                         
3940                         MapBlock *block = m_map->getBlockNoCreate(p);
3941                         if(block->isDummy())
3942                                 block_data_inexistent = true;
3943                         else
3944                                 block->copyTo(*this);
3945                 }
3946                 catch(InvalidPositionException &e)
3947                 {
3948                         block_data_inexistent = true;
3949                 }
3950
3951                 if(block_data_inexistent)
3952                 {
3953                         VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3954                         // Fill with VOXELFLAG_INEXISTENT
3955                         for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3956                         for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3957                         {
3958                                 s32 i = m_area.index(a.MinEdge.X,y,z);
3959                                 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3960                         }
3961                 }
3962
3963                 m_loaded_blocks.insert(p, !block_data_inexistent);
3964         }
3965
3966         //dstream<<"emerge done"<<std::endl;
3967 }
3968
3969 /*
3970         SUGG: Add an option to only update eg. water and air nodes.
3971               This will make it interfere less with important stuff if
3972                   run on background.
3973 */
3974 void MapVoxelManipulator::blitBack
3975                 (core::map<v3s16, MapBlock*> & modified_blocks)
3976 {
3977         if(m_area.getExtent() == v3s16(0,0,0))
3978                 return;
3979         
3980         //TimeTaker timer1("blitBack");
3981
3982         /*dstream<<"blitBack(): m_loaded_blocks.size()="
3983                         <<m_loaded_blocks.size()<<std::endl;*/
3984         
3985         /*
3986                 Initialize block cache
3987         */
3988         v3s16 blockpos_last;
3989         MapBlock *block = NULL;
3990         bool block_checked_in_modified = false;
3991
3992         for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3993         for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3994         for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3995         {
3996                 v3s16 p(x,y,z);
3997
3998                 u8 f = m_flags[m_area.index(p)];
3999                 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
4000                         continue;
4001
4002                 MapNode &n = m_data[m_area.index(p)];
4003                         
4004                 v3s16 blockpos = getNodeBlockPos(p);
4005                 
4006                 try
4007                 {
4008                         // Get block
4009                         if(block == NULL || blockpos != blockpos_last){
4010                                 block = m_map->getBlockNoCreate(blockpos);
4011                                 blockpos_last = blockpos;
4012                                 block_checked_in_modified = false;
4013                         }
4014                         
4015                         // Calculate relative position in block
4016                         v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
4017
4018                         // Don't continue if nothing has changed here
4019                         if(block->getNode(relpos) == n)
4020                                 continue;
4021
4022                         //m_map->setNode(m_area.MinEdge + p, n);
4023                         block->setNode(relpos, n);
4024                         
4025                         /*
4026                                 Make sure block is in modified_blocks
4027                         */
4028                         if(block_checked_in_modified == false)
4029                         {
4030                                 modified_blocks[blockpos] = block;
4031                                 block_checked_in_modified = true;
4032                         }
4033                 }
4034                 catch(InvalidPositionException &e)
4035                 {
4036                 }
4037         }
4038 }
4039
4040 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
4041                 MapVoxelManipulator(map),
4042                 m_create_area(false)
4043 {
4044 }
4045
4046 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
4047 {
4048 }
4049
4050 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
4051 {
4052         // Just create the area so that it can be pointed to
4053         VoxelManipulator::emerge(a, caller_id);
4054 }
4055
4056 void ManualMapVoxelManipulator::initialEmerge(
4057                 v3s16 blockpos_min, v3s16 blockpos_max)
4058 {
4059         TimeTaker timer1("initialEmerge", &emerge_time);
4060
4061         // Units of these are MapBlocks
4062         v3s16 p_min = blockpos_min;
4063         v3s16 p_max = blockpos_max;
4064
4065         VoxelArea block_area_nodes
4066                         (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4067         
4068         u32 size_MB = block_area_nodes.getVolume()*4/1000000;
4069         if(size_MB >= 1)
4070         {
4071                 dstream<<"initialEmerge: area: ";
4072                 block_area_nodes.print(dstream);
4073                 dstream<<" ("<<size_MB<<"MB)";
4074                 dstream<<std::endl;
4075         }
4076
4077         addArea(block_area_nodes);
4078
4079         for(s32 z=p_min.Z; z<=p_max.Z; z++)
4080         for(s32 y=p_min.Y; y<=p_max.Y; y++)
4081         for(s32 x=p_min.X; x<=p_max.X; x++)
4082         {
4083                 v3s16 p(x,y,z);
4084                 core::map<v3s16, bool>::Node *n;
4085                 n = m_loaded_blocks.find(p);
4086                 if(n != NULL)
4087                         continue;
4088                 
4089                 bool block_data_inexistent = false;
4090                 try
4091                 {
4092                         TimeTaker timer1("emerge load", &emerge_load_time);
4093
4094                         MapBlock *block = m_map->getBlockNoCreate(p);
4095                         if(block->isDummy())
4096                                 block_data_inexistent = true;
4097                         else
4098                                 block->copyTo(*this);
4099                 }
4100                 catch(InvalidPositionException &e)
4101                 {
4102                         block_data_inexistent = true;
4103                 }
4104
4105                 if(block_data_inexistent)
4106                 {
4107                         /*
4108                                 Mark area inexistent
4109                         */
4110                         VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4111                         // Fill with VOXELFLAG_INEXISTENT
4112                         for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4113                         for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4114                         {
4115                                 s32 i = m_area.index(a.MinEdge.X,y,z);
4116                                 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4117                         }
4118                 }
4119
4120                 m_loaded_blocks.insert(p, !block_data_inexistent);
4121         }
4122 }
4123
4124 void ManualMapVoxelManipulator::blitBackAll(
4125                 core::map<v3s16, MapBlock*> * modified_blocks)
4126 {
4127         if(m_area.getExtent() == v3s16(0,0,0))
4128                 return;
4129         
4130         /*
4131                 Copy data of all blocks
4132         */
4133         for(core::map<v3s16, bool>::Iterator
4134                         i = m_loaded_blocks.getIterator();
4135                         i.atEnd() == false; i++)
4136         {
4137                 v3s16 p = i.getNode()->getKey();
4138                 bool existed = i.getNode()->getValue();
4139                 if(existed == false)
4140                 {
4141                         // The Great Bug was found using this
4142                         /*dstream<<"ManualMapVoxelManipulator::blitBackAll: "
4143                                         <<"Inexistent ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4144                                         <<std::endl;*/
4145                         continue;
4146                 }
4147                 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4148                 if(block == NULL)
4149                 {
4150                         dstream<<"WARNING: "<<__FUNCTION_NAME
4151                                         <<": got NULL block "
4152                                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4153                                         <<std::endl;
4154                         continue;
4155                 }
4156
4157                 block->copyFrom(*this);
4158
4159                 if(modified_blocks)
4160                         modified_blocks->insert(p, block);
4161         }
4162 }
4163
4164 //END