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()) || n2.getContent() == CONTENT_AIR)
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()) || n2.getContent() == CONTENT_AIR)
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 enum NeighborType {
1544         NEIGHBOR_UPPER,
1545         NEIGHBOR_SAME_LEVEL,
1546         NEIGHBOR_LOWER
1547 };
1548 struct NodeNeighbor {
1549         MapNode n;
1550         NeighborType t;
1551         v3s16 p;
1552 };
1553
1554 void Map::transformLiquids(core::map<v3s16, MapBlock*> & modified_blocks)
1555 {
1556         DSTACK(__FUNCTION_NAME);
1557         //TimeTaker timer("transformLiquids()");
1558
1559         u32 loopcount = 0;
1560         u32 initial_size = m_transforming_liquid.size();
1561
1562         /*if(initial_size != 0)
1563                 dstream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
1564
1565         // list of nodes that due to viscosity have not reached their max level height
1566         UniqueQueue<v3s16> must_reflow;
1567
1568         // List of MapBlocks that will require a lighting update (due to lava)
1569         core::map<v3s16, MapBlock*> lighting_modified_blocks;
1570
1571         while(m_transforming_liquid.size() != 0)
1572         {
1573                 // This should be done here so that it is done when continue is used
1574                 if(loopcount >= initial_size * 3)
1575                         break;
1576                 loopcount++;
1577
1578                 /*
1579                         Get a queued transforming liquid node
1580                 */
1581                 v3s16 p0 = m_transforming_liquid.pop_front();
1582
1583                 MapNode n0 = getNodeNoEx(p0);
1584
1585                 /*
1586                         Collect information about current node
1587                  */
1588                 s8 liquid_level = -1;
1589                 u8 liquid_kind = CONTENT_IGNORE;
1590                 LiquidType liquid_type = content_features(n0.getContent()).liquid_type;
1591                 switch (liquid_type) {
1592                         case LIQUID_SOURCE:
1593                                 liquid_level = LIQUID_LEVEL_SOURCE;
1594                                 liquid_kind = content_features(n0.getContent()).liquid_alternative_flowing;
1595                                 break;
1596                         case LIQUID_FLOWING:
1597                                 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
1598                                 liquid_kind = n0.getContent();
1599                                 break;
1600                         case LIQUID_NONE:
1601                                 // if this is an air node, it *could* be transformed into a liquid. otherwise,
1602                                 // continue with the next node.
1603                                 if (n0.getContent() != CONTENT_AIR)
1604                                         continue;
1605                                 liquid_kind = CONTENT_AIR;
1606                                 break;
1607                 }
1608
1609                 /*
1610                         Collect information about the environment
1611                  */
1612                 const v3s16 *dirs = g_6dirs;
1613                 NodeNeighbor sources[6]; // surrounding sources
1614                 int num_sources = 0;
1615                 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
1616                 int num_flows = 0;
1617                 NodeNeighbor airs[6]; // surrounding air
1618                 int num_airs = 0;
1619                 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
1620                 int num_neutrals = 0;
1621                 bool flowing_down = false;
1622                 for (u16 i = 0; i < 6; i++) {
1623                         NeighborType nt = NEIGHBOR_SAME_LEVEL;
1624                         switch (i) {
1625                                 case 1:
1626                                         nt = NEIGHBOR_UPPER;
1627                                         break;
1628                                 case 4:
1629                                         nt = NEIGHBOR_LOWER;
1630                                         break;
1631                         }
1632                         v3s16 npos = p0 + dirs[i];
1633                         NodeNeighbor nb = {getNodeNoEx(npos), nt, npos};
1634                         switch (content_features(nb.n.getContent()).liquid_type) {
1635                                 case LIQUID_NONE:
1636                                         if (nb.n.getContent() == CONTENT_AIR) {
1637                                                 airs[num_airs++] = nb;
1638                                                 // if the current node is a water source the neighbor
1639                                                 // should be enqueded for transformation regardless of whether the
1640                                                 // current node changes or not.
1641                                                 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
1642                                                         m_transforming_liquid.push_back(npos);
1643                                                 // if the current node happens to be a flowing node, it will start to flow down here.
1644                                                 if (nb.t == NEIGHBOR_LOWER) {
1645                                                         flowing_down = true;
1646                                                 }
1647                                         } else {
1648                                                 neutrals[num_neutrals++] = nb;
1649                                         }
1650                                         break;
1651                                 case LIQUID_SOURCE:
1652                                         // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1653                                         if (liquid_kind == CONTENT_AIR)
1654                                                 liquid_kind = content_features(nb.n.getContent()).liquid_alternative_flowing;
1655                                         if (content_features(nb.n.getContent()).liquid_alternative_flowing !=liquid_kind) {
1656                                                 neutrals[num_neutrals++] = nb;
1657                                         } else {
1658                                                 sources[num_sources++] = nb;
1659                                         }
1660                                         break;
1661                                 case LIQUID_FLOWING:
1662                                         // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1663                                         if (liquid_kind == CONTENT_AIR)
1664                                                 liquid_kind = content_features(nb.n.getContent()).liquid_alternative_flowing;
1665                                         if (content_features(nb.n.getContent()).liquid_alternative_flowing != liquid_kind) {
1666                                                 neutrals[num_neutrals++] = nb;
1667                                         } else {
1668                                                 flows[num_flows++] = nb;
1669                                                 if (nb.t == NEIGHBOR_LOWER)
1670                                                         flowing_down = true;
1671                                         }
1672                                         break;
1673                         }
1674                 }
1675
1676                 /*
1677                         decide on the type (and possibly level) of the current node
1678                  */
1679                 content_t new_node_content;
1680                 s8 new_node_level = -1;
1681                 s8 max_node_level = -1;
1682                 if (num_sources >= 2 || liquid_type == LIQUID_SOURCE) {
1683                         // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
1684                         // or the flowing alternative of the first of the surrounding sources (if it's air), so
1685                         // it's perfectly safe to use liquid_kind here to determine the new node content.
1686                         new_node_content = content_features(liquid_kind).liquid_alternative_source;
1687                 } else if (num_sources == 1 && sources[0].t != NEIGHBOR_LOWER) {
1688                         // liquid_kind is set properly, see above
1689                         new_node_content = liquid_kind;
1690                         max_node_level = new_node_level = LIQUID_LEVEL_MAX;
1691                 } else {
1692                         // no surrounding sources, so get the maximum level that can flow into this node
1693                         for (u16 i = 0; i < num_flows; i++) {
1694                                 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1695                                 switch (flows[i].t) {
1696                                         case NEIGHBOR_UPPER:
1697                                                 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
1698                                                         max_node_level = LIQUID_LEVEL_MAX;
1699                                                         if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
1700                                                                 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
1701                                                 } else if (nb_liquid_level > max_node_level)
1702                                                         max_node_level = nb_liquid_level;
1703                                                 break;
1704                                         case NEIGHBOR_LOWER:
1705                                                 break;
1706                                         case NEIGHBOR_SAME_LEVEL:
1707                                                 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
1708                                                         nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level) {
1709                                                         max_node_level = nb_liquid_level - 1;
1710                                                 }
1711                                                 break;
1712                                 }
1713                         }
1714
1715                         u8 viscosity = content_features(liquid_kind).liquid_viscosity;
1716                         if (viscosity > 1 && max_node_level != liquid_level) {
1717                                 // amount to gain, limited by viscosity
1718                                 // must be at least 1 in absolute value
1719                                 s8 level_inc = max_node_level - liquid_level;
1720                                 if (level_inc < -viscosity || level_inc > viscosity)
1721                                         new_node_level = liquid_level + level_inc/viscosity;
1722                                 else if (level_inc < 0)
1723                                         new_node_level = liquid_level - 1;
1724                                 else if (level_inc > 0)
1725                                         new_node_level = liquid_level + 1;
1726                                 if (new_node_level != max_node_level)
1727                                         must_reflow.push_back(p0);
1728                         } else
1729                                 new_node_level = max_node_level;
1730
1731                         if (new_node_level >= 0)
1732                                 new_node_content = liquid_kind;
1733                         else
1734                                 new_node_content = CONTENT_AIR;
1735
1736                 }
1737
1738                 /*
1739                         check if anything has changed. if not, just continue with the next node.
1740                  */
1741                 if (new_node_content == n0.getContent() && (content_features(n0.getContent()).liquid_type != LIQUID_FLOWING ||
1742                                                                                  ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
1743                                                                                  ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
1744                                                                                  == flowing_down)))
1745                         continue;
1746
1747
1748                 /*
1749                         update the current node
1750                  */
1751                 bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
1752                 if (content_features(new_node_content).liquid_type == LIQUID_FLOWING) {
1753                         // set level to last 3 bits, flowing down bit to 4th bit
1754                         n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
1755                 } else {
1756                         // set the liquid level and flow bit to 0
1757                         n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
1758                 }
1759                 n0.setContent(new_node_content);
1760                 setNode(p0, n0);
1761                 v3s16 blockpos = getNodeBlockPos(p0);
1762                 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1763                 if(block != NULL) {
1764                         modified_blocks.insert(blockpos, block);
1765                         // If node emits light, MapBlock requires lighting update
1766                         if(content_features(n0).light_source != 0)
1767                                 lighting_modified_blocks[block->getPos()] = block;
1768                 }
1769
1770                 /*
1771                         enqueue neighbors for update if neccessary
1772                  */
1773                 switch (content_features(n0.getContent()).liquid_type) {
1774                         case LIQUID_SOURCE:
1775                         case LIQUID_FLOWING:
1776                                 // make sure source flows into all neighboring nodes
1777                                 for (u16 i = 0; i < num_flows; i++)
1778                                         if (flows[i].t != NEIGHBOR_UPPER)
1779                                                 m_transforming_liquid.push_back(flows[i].p);
1780                                 for (u16 i = 0; i < num_airs; i++)
1781                                         if (airs[i].t != NEIGHBOR_UPPER)
1782                                                 m_transforming_liquid.push_back(airs[i].p);
1783                                 break;
1784                         case LIQUID_NONE:
1785                                 // this flow has turned to air; neighboring flows might need to do the same
1786                                 for (u16 i = 0; i < num_flows; i++)
1787                                         m_transforming_liquid.push_back(flows[i].p);
1788                                 break;
1789                 }
1790         }
1791         //dstream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
1792         while (must_reflow.size() > 0)
1793                 m_transforming_liquid.push_back(must_reflow.pop_front());
1794         updateLighting(lighting_modified_blocks, modified_blocks);
1795 }
1796
1797 NodeMetadata* Map::getNodeMetadata(v3s16 p)
1798 {
1799         v3s16 blockpos = getNodeBlockPos(p);
1800         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1801         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1802         if(block == NULL)
1803         {
1804                 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1805                                 <<std::endl;
1806                 return NULL;
1807         }
1808         NodeMetadata *meta = block->m_node_metadata.get(p_rel);
1809         return meta;
1810 }
1811
1812 void Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
1813 {
1814         v3s16 blockpos = getNodeBlockPos(p);
1815         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1816         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1817         if(block == NULL)
1818         {
1819                 dstream<<"WARNING: Map::setNodeMetadata(): Block not found"
1820                                 <<std::endl;
1821                 return;
1822         }
1823         block->m_node_metadata.set(p_rel, meta);
1824 }
1825
1826 void Map::removeNodeMetadata(v3s16 p)
1827 {
1828         v3s16 blockpos = getNodeBlockPos(p);
1829         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
1830         MapBlock *block = getBlockNoCreateNoEx(blockpos);
1831         if(block == NULL)
1832         {
1833                 dstream<<"WARNING: Map::removeNodeMetadata(): Block not found"
1834                                 <<std::endl;
1835                 return;
1836         }
1837         block->m_node_metadata.remove(p_rel);
1838 }
1839
1840 void Map::nodeMetadataStep(float dtime,
1841                 core::map<v3s16, MapBlock*> &changed_blocks)
1842 {
1843         /*
1844                 NOTE:
1845                 Currently there is no way to ensure that all the necessary
1846                 blocks are loaded when this is run. (They might get unloaded)
1847                 NOTE: ^- Actually, that might not be so. In a quick test it
1848                 reloaded a block with a furnace when I walked back to it from
1849                 a distance.
1850         */
1851         core::map<v2s16, MapSector*>::Iterator si;
1852         si = m_sectors.getIterator();
1853         for(; si.atEnd() == false; si++)
1854         {
1855                 MapSector *sector = si.getNode()->getValue();
1856                 core::list< MapBlock * > sectorblocks;
1857                 sector->getBlocks(sectorblocks);
1858                 core::list< MapBlock * >::Iterator i;
1859                 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
1860                 {
1861                         MapBlock *block = *i;
1862                         bool changed = block->m_node_metadata.step(dtime);
1863                         if(changed)
1864                                 changed_blocks[block->getPos()] = block;
1865                 }
1866         }
1867 }
1868
1869 /*
1870         ServerMap
1871 */
1872
1873 ServerMap::ServerMap(std::string savedir):
1874         Map(dout_server),
1875         m_seed(0),
1876         m_map_metadata_changed(true)
1877 {
1878         dstream<<__FUNCTION_NAME<<std::endl;
1879
1880         //m_chunksize = 8; // Takes a few seconds
1881
1882         m_seed = (((u64)(myrand()%0xffff)<<0)
1883                         + ((u64)(myrand()%0xffff)<<16)
1884                         + ((u64)(myrand()%0xffff)<<32)
1885                         + ((u64)(myrand()%0xffff)<<48));
1886
1887         /*
1888                 Experimental and debug stuff
1889         */
1890
1891         {
1892         }
1893
1894         /*
1895                 Try to load map; if not found, create a new one.
1896         */
1897
1898         m_savedir = savedir;
1899         m_map_saving_enabled = false;
1900
1901         try
1902         {
1903                 // If directory exists, check contents and load if possible
1904                 if(fs::PathExists(m_savedir))
1905                 {
1906                         // If directory is empty, it is safe to save into it.
1907                         if(fs::GetDirListing(m_savedir).size() == 0)
1908                         {
1909                                 dstream<<DTIME<<"Server: Empty save directory is valid."
1910                                                 <<std::endl;
1911                                 m_map_saving_enabled = true;
1912                         }
1913                         else
1914                         {
1915                                 try{
1916                                         // Load map metadata (seed, chunksize)
1917                                         loadMapMeta();
1918                                 }
1919                                 catch(FileNotGoodException &e){
1920                                         dstream<<DTIME<<"WARNING: Could not load map metadata"
1921                                                         //<<" Disabling chunk-based generator."
1922                                                         <<std::endl;
1923                                         //m_chunksize = 0;
1924                                 }
1925
1926                                 /*try{
1927                                         // Load chunk metadata
1928                                         loadChunkMeta();
1929                                 }
1930                                 catch(FileNotGoodException &e){
1931                                         dstream<<DTIME<<"WARNING: Could not load chunk metadata."
1932                                                         <<" Disabling chunk-based generator."
1933                                                         <<std::endl;
1934                                         m_chunksize = 0;
1935                                 }*/
1936
1937                                 /*dstream<<DTIME<<"Server: Successfully loaded chunk "
1938                                                 "metadata and sector (0,0) from "<<savedir<<
1939                                                 ", assuming valid save directory."
1940                                                 <<std::endl;*/
1941
1942                                 dstream<<DTIME<<"INFO: Server: Successfully loaded map "
1943                                                 <<"and chunk metadata from "<<savedir
1944                                                 <<", assuming valid save directory."
1945                                                 <<std::endl;
1946
1947                                 m_map_saving_enabled = true;
1948                                 // Map loaded, not creating new one
1949                                 return;
1950                         }
1951                 }
1952                 // If directory doesn't exist, it is safe to save to it
1953                 else{
1954                         m_map_saving_enabled = true;
1955                 }
1956         }
1957         catch(std::exception &e)
1958         {
1959                 dstream<<DTIME<<"WARNING: Server: Failed to load map from "<<savedir
1960                                 <<", exception: "<<e.what()<<std::endl;
1961                 dstream<<"Please remove the map or fix it."<<std::endl;
1962                 dstream<<"WARNING: Map saving will be disabled."<<std::endl;
1963         }
1964
1965         dstream<<DTIME<<"INFO: Initializing new map."<<std::endl;
1966
1967         // Create zero sector
1968         emergeSector(v2s16(0,0));
1969
1970         // Initially write whole map
1971         save(false);
1972 }
1973
1974 ServerMap::~ServerMap()
1975 {
1976         dstream<<__FUNCTION_NAME<<std::endl;
1977
1978         try
1979         {
1980                 if(m_map_saving_enabled)
1981                 {
1982                         // Save only changed parts
1983                         save(true);
1984                         dstream<<DTIME<<"Server: saved map to "<<m_savedir<<std::endl;
1985                 }
1986                 else
1987                 {
1988                         dstream<<DTIME<<"Server: map not saved"<<std::endl;
1989                 }
1990         }
1991         catch(std::exception &e)
1992         {
1993                 dstream<<DTIME<<"Server: Failed to save map to "<<m_savedir
1994                                 <<", exception: "<<e.what()<<std::endl;
1995         }
1996
1997 #if 0
1998         /*
1999                 Free all MapChunks
2000         */
2001         core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
2002         for(; i.atEnd() == false; i++)
2003         {
2004                 MapChunk *chunk = i.getNode()->getValue();
2005                 delete chunk;
2006         }
2007 #endif
2008 }
2009
2010 void ServerMap::initBlockMake(mapgen::BlockMakeData *data, v3s16 blockpos)
2011 {
2012         bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2013         if(enable_mapgen_debug_info)
2014                 dstream<<"initBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2015                                 <<blockpos.Z<<")"<<std::endl;
2016
2017         // Do nothing if not inside limits (+-1 because of neighbors)
2018         if(blockpos_over_limit(blockpos - v3s16(1,1,1)) ||
2019                 blockpos_over_limit(blockpos + v3s16(1,1,1)))
2020         {
2021                 data->no_op = true;
2022                 return;
2023         }
2024
2025         data->no_op = false;
2026         data->seed = m_seed;
2027         data->blockpos = blockpos;
2028
2029         /*
2030                 Create the whole area of this and the neighboring blocks
2031         */
2032         {
2033                 //TimeTaker timer("initBlockMake() create area");
2034
2035                 for(s16 x=-1; x<=1; x++)
2036                 for(s16 z=-1; z<=1; z++)
2037                 {
2038                         v2s16 sectorpos(blockpos.X+x, blockpos.Z+z);
2039                         // Sector metadata is loaded from disk if not already loaded.
2040                         ServerMapSector *sector = createSector(sectorpos);
2041                         assert(sector);
2042
2043                         for(s16 y=-1; y<=1; y++)
2044                         {
2045                                 v3s16 p(blockpos.X+x, blockpos.Y+y, blockpos.Z+z);
2046                                 //MapBlock *block = createBlock(p);
2047                                 // 1) get from memory, 2) load from disk
2048                                 MapBlock *block = emergeBlock(p, false);
2049                                 // 3) create a blank one
2050                                 if(block == NULL)
2051                                 {
2052                                         block = createBlock(p);
2053
2054                                         /*
2055                                                 Block gets sunlight if this is true.
2056
2057                                                 Refer to the map generator heuristics.
2058                                         */
2059                                         bool ug = mapgen::block_is_underground(data->seed, p);
2060                                         block->setIsUnderground(ug);
2061                                 }
2062
2063                                 // Lighting will not be valid after make_chunk is called
2064                                 block->setLightingExpired(true);
2065                                 // Lighting will be calculated
2066                                 //block->setLightingExpired(false);
2067                         }
2068                 }
2069         }
2070
2071         /*
2072                 Now we have a big empty area.
2073
2074                 Make a ManualMapVoxelManipulator that contains this and the
2075                 neighboring blocks
2076         */
2077
2078         // The area that contains this block and it's neighbors
2079         v3s16 bigarea_blocks_min = blockpos - v3s16(1,1,1);
2080         v3s16 bigarea_blocks_max = blockpos + v3s16(1,1,1);
2081
2082         data->vmanip = new ManualMapVoxelManipulator(this);
2083         //data->vmanip->setMap(this);
2084
2085         // Add the area
2086         {
2087                 //TimeTaker timer("initBlockMake() initialEmerge");
2088                 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2089         }
2090
2091         // Data is ready now.
2092 }
2093
2094 MapBlock* ServerMap::finishBlockMake(mapgen::BlockMakeData *data,
2095                 core::map<v3s16, MapBlock*> &changed_blocks)
2096 {
2097         v3s16 blockpos = data->blockpos;
2098         /*dstream<<"finishBlockMake(): ("<<blockpos.X<<","<<blockpos.Y<<","
2099                         <<blockpos.Z<<")"<<std::endl;*/
2100
2101         if(data->no_op)
2102         {
2103                 //dstream<<"finishBlockMake(): no-op"<<std::endl;
2104                 return NULL;
2105         }
2106
2107         bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2108
2109         /*dstream<<"Resulting vmanip:"<<std::endl;
2110         data->vmanip.print(dstream);*/
2111
2112         /*
2113                 Blit generated stuff to map
2114                 NOTE: blitBackAll adds nearly everything to changed_blocks
2115         */
2116         {
2117                 // 70ms @cs=8
2118                 //TimeTaker timer("finishBlockMake() blitBackAll");
2119                 data->vmanip->blitBackAll(&changed_blocks);
2120         }
2121
2122         if(enable_mapgen_debug_info)
2123                 dstream<<"finishBlockMake: changed_blocks.size()="
2124                                 <<changed_blocks.size()<<std::endl;
2125
2126         /*
2127                 Copy transforming liquid information
2128         */
2129         while(data->transforming_liquid.size() > 0)
2130         {
2131                 v3s16 p = data->transforming_liquid.pop_front();
2132                 m_transforming_liquid.push_back(p);
2133         }
2134
2135         /*
2136                 Get central block
2137         */
2138         MapBlock *block = getBlockNoCreateNoEx(data->blockpos);
2139         assert(block);
2140
2141         /*
2142                 Set is_underground flag for lighting with sunlight.
2143
2144                 Refer to map generator heuristics.
2145
2146                 NOTE: This is done in initChunkMake
2147         */
2148         //block->setIsUnderground(mapgen::block_is_underground(data->seed, blockpos));
2149
2150
2151         /*
2152                 Add sunlight to central block.
2153                 This makes in-dark-spawning monsters to not flood the whole thing.
2154                 Do not spread the light, though.
2155         */
2156         /*core::map<v3s16, bool> light_sources;
2157         bool black_air_left = false;
2158         block->propagateSunlight(light_sources, true, &black_air_left);*/
2159
2160         /*
2161                 NOTE: Lighting and object adding shouldn't really be here, but
2162                 lighting is a bit tricky to move properly to makeBlock.
2163                 TODO: Do this the right way anyway, that is, move it to makeBlock.
2164                       - There needs to be some way for makeBlock to report back if
2165                             the lighting update is going further down because of the
2166                                 new block blocking light
2167         */
2168
2169         /*
2170                 Update lighting
2171                 NOTE: This takes ~60ms, TODO: Investigate why
2172         */
2173         {
2174                 TimeTaker t("finishBlockMake lighting update");
2175
2176                 core::map<v3s16, MapBlock*> lighting_update_blocks;
2177 #if 1
2178                 // Center block
2179                 lighting_update_blocks.insert(block->getPos(), block);
2180
2181                 /*{
2182                         s16 x = 0;
2183                         s16 z = 0;
2184                         v3s16 p = block->getPos()+v3s16(x,1,z);
2185                         lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2186                 }*/
2187 #endif
2188 #if 0
2189                 // All modified blocks
2190                 // NOTE: Should this be done? If this is not done, then the lighting
2191                 // of the others will be updated in a different place, one by one, i
2192                 // think... or they might not? Well, at least they are left marked as
2193                 // "lighting expired"; it seems that is not handled at all anywhere,
2194                 // so enabling this will slow it down A LOT because otherwise it
2195                 // would not do this at all. This causes the black trees.
2196                 for(core::map<v3s16, MapBlock*>::Iterator
2197                                 i = changed_blocks.getIterator();
2198                                 i.atEnd() == false; i++)
2199                 {
2200                         lighting_update_blocks.insert(i.getNode()->getKey(),
2201                                         i.getNode()->getValue());
2202                 }
2203                 /*// Also force-add all the upmost blocks for proper sunlight
2204                 for(s16 x=-1; x<=1; x++)
2205                 for(s16 z=-1; z<=1; z++)
2206                 {
2207                         v3s16 p = block->getPos()+v3s16(x,1,z);
2208                         lighting_update_blocks[p] = getBlockNoCreateNoEx(p);
2209                 }*/
2210 #endif
2211                 updateLighting(lighting_update_blocks, changed_blocks);
2212
2213                 /*
2214                         Set lighting to non-expired state in all of them.
2215                         This is cheating, but it is not fast enough if all of them
2216                         would actually be updated.
2217                 */
2218                 for(s16 x=-1; x<=1; x++)
2219                 for(s16 y=-1; y<=1; y++)
2220                 for(s16 z=-1; z<=1; z++)
2221                 {
2222                         v3s16 p = block->getPos()+v3s16(x,y,z);
2223                         getBlockNoCreateNoEx(p)->setLightingExpired(false);
2224                 }
2225
2226                 if(enable_mapgen_debug_info == false)
2227                         t.stop(true); // Hide output
2228         }
2229
2230         /*
2231                 Add random objects to block
2232         */
2233         mapgen::add_random_objects(block);
2234
2235         /*
2236                 Go through changed blocks
2237         */
2238         for(core::map<v3s16, MapBlock*>::Iterator i = changed_blocks.getIterator();
2239                         i.atEnd() == false; i++)
2240         {
2241                 MapBlock *block = i.getNode()->getValue();
2242                 assert(block);
2243                 /*
2244                         Update day/night difference cache of the MapBlocks
2245                 */
2246                 block->updateDayNightDiff();
2247                 /*
2248                         Set block as modified
2249                 */
2250                 block->raiseModified(MOD_STATE_WRITE_NEEDED);
2251         }
2252
2253         /*
2254                 Set central block as generated
2255         */
2256         block->setGenerated(true);
2257
2258         /*
2259                 Save changed parts of map
2260                 NOTE: Will be saved later.
2261         */
2262         //save(true);
2263
2264         /*dstream<<"finishBlockMake() done for ("<<blockpos.X<<","<<blockpos.Y<<","
2265                         <<blockpos.Z<<")"<<std::endl;*/
2266 #if 0
2267         if(enable_mapgen_debug_info)
2268         {
2269                 /*
2270                         Analyze resulting blocks
2271                 */
2272                 for(s16 x=-1; x<=1; x++)
2273                 for(s16 y=-1; y<=1; y++)
2274                 for(s16 z=-1; z<=1; z++)
2275                 {
2276                         v3s16 p = block->getPos()+v3s16(x,y,z);
2277                         MapBlock *block = getBlockNoCreateNoEx(p);
2278                         char spos[20];
2279                         snprintf(spos, 20, "(%2d,%2d,%2d)", x, y, z);
2280                         dstream<<"Generated "<<spos<<": "
2281                                         <<analyze_block(block)<<std::endl;
2282                 }
2283         }
2284 #endif
2285
2286         return block;
2287 }
2288
2289 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2290 {
2291         DSTACKF("%s: p2d=(%d,%d)",
2292                         __FUNCTION_NAME,
2293                         p2d.X, p2d.Y);
2294
2295         /*
2296                 Check if it exists already in memory
2297         */
2298         ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2299         if(sector != NULL)
2300                 return sector;
2301
2302         /*
2303                 Try to load it from disk (with blocks)
2304         */
2305         //if(loadSectorFull(p2d) == true)
2306
2307         /*
2308                 Try to load metadata from disk
2309         */
2310         if(loadSectorMeta(p2d) == true)
2311         {
2312                 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2313                 if(sector == NULL)
2314                 {
2315                         dstream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2316                         throw InvalidPositionException("");
2317                 }
2318                 return sector;
2319         }
2320
2321         /*
2322                 Do not create over-limit
2323         */
2324         if(p2d.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2325         || p2d.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2326         || p2d.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2327         || p2d.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2328                 throw InvalidPositionException("createSector(): pos. over limit");
2329
2330         /*
2331                 Generate blank sector
2332         */
2333
2334         sector = new ServerMapSector(this, p2d);
2335
2336         // Sector position on map in nodes
2337         v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2338
2339         /*
2340                 Insert to container
2341         */
2342         m_sectors.insert(p2d, sector);
2343
2344         return sector;
2345 }
2346
2347 /*
2348         This is a quick-hand function for calling makeBlock().
2349 */
2350 MapBlock * ServerMap::generateBlock(
2351                 v3s16 p,
2352                 core::map<v3s16, MapBlock*> &modified_blocks
2353 )
2354 {
2355         DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2356
2357         /*dstream<<"generateBlock(): "
2358                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2359                         <<std::endl;*/
2360
2361         bool enable_mapgen_debug_info = g_settings.getBool("enable_mapgen_debug_info");
2362
2363         TimeTaker timer("generateBlock");
2364
2365         //MapBlock *block = original_dummy;
2366
2367         v2s16 p2d(p.X, p.Z);
2368         v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2369
2370         /*
2371                 Do not generate over-limit
2372         */
2373         if(blockpos_over_limit(p))
2374         {
2375                 dstream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2376                 throw InvalidPositionException("generateBlock(): pos. over limit");
2377         }
2378
2379         /*
2380                 Create block make data
2381         */
2382         mapgen::BlockMakeData data;
2383         initBlockMake(&data, p);
2384
2385         /*
2386                 Generate block
2387         */
2388         {
2389                 TimeTaker t("mapgen::make_block()");
2390                 mapgen::make_block(&data);
2391
2392                 if(enable_mapgen_debug_info == false)
2393                         t.stop(true); // Hide output
2394         }
2395
2396         /*
2397                 Blit data back on map, update lighting, add mobs and whatever this does
2398         */
2399         finishBlockMake(&data, modified_blocks);
2400
2401         /*
2402                 Get central block
2403         */
2404         MapBlock *block = getBlockNoCreateNoEx(p);
2405
2406 #if 0
2407         /*
2408                 Check result
2409         */
2410         if(block)
2411         {
2412                 bool erroneus_content = false;
2413                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2414                 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2415                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2416                 {
2417                         v3s16 p(x0,y0,z0);
2418                         MapNode n = block->getNode(p);
2419                         if(n.getContent() == CONTENT_IGNORE)
2420                         {
2421                                 dstream<<"CONTENT_IGNORE at "
2422                                                 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2423                                                 <<std::endl;
2424                                 erroneus_content = true;
2425                                 assert(0);
2426                         }
2427                 }
2428                 if(erroneus_content)
2429                 {
2430                         assert(0);
2431                 }
2432         }
2433 #endif
2434
2435 #if 0
2436         /*
2437                 Generate a completely empty block
2438         */
2439         if(block)
2440         {
2441                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2442                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2443                 {
2444                         for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2445                         {
2446                                 MapNode n;
2447                                 if(y0%2==0)
2448                                         n.setContent(CONTENT_AIR);
2449                                 else
2450                                         n.setContent(CONTENT_STONE);
2451                                 block->setNode(v3s16(x0,y0,z0), n);
2452                         }
2453                 }
2454         }
2455 #endif
2456
2457         if(enable_mapgen_debug_info == false)
2458                 timer.stop(true); // Hide output
2459
2460         return block;
2461 }
2462
2463 MapBlock * ServerMap::createBlock(v3s16 p)
2464 {
2465         DSTACKF("%s: p=(%d,%d,%d)",
2466                         __FUNCTION_NAME, p.X, p.Y, p.Z);
2467
2468         /*
2469                 Do not create over-limit
2470         */
2471         if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2472         || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2473         || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2474         || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2475         || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2476         || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2477                 throw InvalidPositionException("createBlock(): pos. over limit");
2478
2479         v2s16 p2d(p.X, p.Z);
2480         s16 block_y = p.Y;
2481         /*
2482                 This will create or load a sector if not found in memory.
2483                 If block exists on disk, it will be loaded.
2484
2485                 NOTE: On old save formats, this will be slow, as it generates
2486                       lighting on blocks for them.
2487         */
2488         ServerMapSector *sector;
2489         try{
2490                 sector = (ServerMapSector*)createSector(p2d);
2491                 assert(sector->getId() == MAPSECTOR_SERVER);
2492         }
2493         catch(InvalidPositionException &e)
2494         {
2495                 dstream<<"createBlock: createSector() failed"<<std::endl;
2496                 throw e;
2497         }
2498         /*
2499                 NOTE: This should not be done, or at least the exception
2500                 should not be passed on as std::exception, because it
2501                 won't be catched at all.
2502         */
2503         /*catch(std::exception &e)
2504         {
2505                 dstream<<"createBlock: createSector() failed: "
2506                                 <<e.what()<<std::endl;
2507                 throw e;
2508         }*/
2509
2510         /*
2511                 Try to get a block from the sector
2512         */
2513
2514         MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2515         if(block)
2516         {
2517                 if(block->isDummy())
2518                         block->unDummify();
2519                 return block;
2520         }
2521         // Create blank
2522         block = sector->createBlankBlock(block_y);
2523         return block;
2524 }
2525
2526 MapBlock * ServerMap::emergeBlock(v3s16 p, bool allow_generate)
2527 {
2528         DSTACKF("%s: p=(%d,%d,%d), allow_generate=%d",
2529                         __FUNCTION_NAME,
2530                         p.X, p.Y, p.Z, allow_generate);
2531
2532         {
2533                 MapBlock *block = getBlockNoCreateNoEx(p);
2534                 if(block && block->isDummy() == false)
2535                         return block;
2536         }
2537
2538         {
2539                 MapBlock *block = loadBlock(p);
2540                 if(block)
2541                         return block;
2542         }
2543
2544         if(allow_generate)
2545         {
2546                 core::map<v3s16, MapBlock*> modified_blocks;
2547                 MapBlock *block = generateBlock(p, modified_blocks);
2548                 if(block)
2549                 {
2550                         MapEditEvent event;
2551                         event.type = MEET_OTHER;
2552                         event.p = p;
2553
2554                         // Copy modified_blocks to event
2555                         for(core::map<v3s16, MapBlock*>::Iterator
2556                                         i = modified_blocks.getIterator();
2557                                         i.atEnd()==false; i++)
2558                         {
2559                                 event.modified_blocks.insert(i.getNode()->getKey(), false);
2560                         }
2561
2562                         // Queue event
2563                         dispatchEvent(&event);
2564
2565                         return block;
2566                 }
2567         }
2568
2569         return NULL;
2570 }
2571
2572 #if 0
2573         /*
2574                 Do not generate over-limit
2575         */
2576         if(p.X < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2577         || p.X > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2578         || p.Y < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2579         || p.Y > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2580         || p.Z < -MAP_GENERATION_LIMIT / MAP_BLOCKSIZE
2581         || p.Z > MAP_GENERATION_LIMIT / MAP_BLOCKSIZE)
2582                 throw InvalidPositionException("emergeBlock(): pos. over limit");
2583
2584         v2s16 p2d(p.X, p.Z);
2585         s16 block_y = p.Y;
2586         /*
2587                 This will create or load a sector if not found in memory.
2588                 If block exists on disk, it will be loaded.
2589         */
2590         ServerMapSector *sector;
2591         try{
2592                 sector = createSector(p2d);
2593                 //sector = emergeSector(p2d, changed_blocks);
2594         }
2595         catch(InvalidPositionException &e)
2596         {
2597                 dstream<<"emergeBlock: createSector() failed: "
2598                                 <<e.what()<<std::endl;
2599                 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2600                                 <<std::endl
2601                                 <<"You could try to delete it."<<std::endl;
2602                 throw e;
2603         }
2604         catch(VersionMismatchException &e)
2605         {
2606                 dstream<<"emergeBlock: createSector() failed: "
2607                                 <<e.what()<<std::endl;
2608                 dstream<<"Path to failed sector: "<<getSectorDir(p2d)
2609                                 <<std::endl
2610                                 <<"You could try to delete it."<<std::endl;
2611                 throw e;
2612         }
2613
2614         /*
2615                 Try to get a block from the sector
2616         */
2617
2618         bool does_not_exist = false;
2619         bool lighting_expired = false;
2620         MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2621
2622         // If not found, try loading from disk
2623         if(block == NULL)
2624         {
2625                 block = loadBlock(p);
2626         }
2627
2628         // Handle result
2629         if(block == NULL)
2630         {
2631                 does_not_exist = true;
2632         }
2633         else if(block->isDummy() == true)
2634         {
2635                 does_not_exist = true;
2636         }
2637         else if(block->getLightingExpired())
2638         {
2639                 lighting_expired = true;
2640         }
2641         else
2642         {
2643                 // Valid block
2644                 //dstream<<"emergeBlock(): Returning already valid block"<<std::endl;
2645                 return block;
2646         }
2647
2648         /*
2649                 If block was not found on disk and not going to generate a
2650                 new one, make sure there is a dummy block in place.
2651         */
2652         if(only_from_disk && (does_not_exist || lighting_expired))
2653         {
2654                 //dstream<<"emergeBlock(): Was not on disk but not generating"<<std::endl;
2655
2656                 if(block == NULL)
2657                 {
2658                         // Create dummy block
2659                         block = new MapBlock(this, p, true);
2660
2661                         // Add block to sector
2662                         sector->insertBlock(block);
2663                 }
2664                 // Done.
2665                 return block;
2666         }
2667
2668         //dstream<<"Not found on disk, generating."<<std::endl;
2669         // 0ms
2670         //TimeTaker("emergeBlock() generate");
2671
2672         //dstream<<"emergeBlock(): Didn't find valid block -> making one"<<std::endl;
2673
2674         /*
2675                 If the block doesn't exist, generate the block.
2676         */
2677         if(does_not_exist)
2678         {
2679                 block = generateBlock(p, block, sector, changed_blocks,
2680                                 lighting_invalidated_blocks);
2681         }
2682
2683         if(lighting_expired)
2684         {
2685                 lighting_invalidated_blocks.insert(p, block);
2686         }
2687
2688 #if 0
2689         /*
2690                 Initially update sunlight
2691         */
2692         {
2693                 core::map<v3s16, bool> light_sources;
2694                 bool black_air_left = false;
2695                 bool bottom_invalid =
2696                                 block->propagateSunlight(light_sources, true,
2697                                 &black_air_left);
2698
2699                 // If sunlight didn't reach everywhere and part of block is
2700                 // above ground, lighting has to be properly updated
2701                 //if(black_air_left && some_part_underground)
2702                 if(black_air_left)
2703                 {
2704                         lighting_invalidated_blocks[block->getPos()] = block;
2705                 }
2706
2707                 if(bottom_invalid)
2708                 {
2709                         lighting_invalidated_blocks[block->getPos()] = block;
2710                 }
2711         }
2712 #endif
2713
2714         return block;
2715 }
2716 #endif
2717
2718 s16 ServerMap::findGroundLevel(v2s16 p2d)
2719 {
2720 #if 0
2721         /*
2722                 Uh, just do something random...
2723         */
2724         // Find existing map from top to down
2725         s16 max=63;
2726         s16 min=-64;
2727         v3s16 p(p2d.X, max, p2d.Y);
2728         for(; p.Y>min; p.Y--)
2729         {
2730                 MapNode n = getNodeNoEx(p);
2731                 if(n.getContent() != CONTENT_IGNORE)
2732                         break;
2733         }
2734         if(p.Y == min)
2735                 goto plan_b;
2736         // If this node is not air, go to plan b
2737         if(getNodeNoEx(p).getContent() != CONTENT_AIR)
2738                 goto plan_b;
2739         // Search existing walkable and return it
2740         for(; p.Y>min; p.Y--)
2741         {
2742                 MapNode n = getNodeNoEx(p);
2743                 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
2744                         return p.Y;
2745         }
2746
2747         // Move to plan b
2748 plan_b:
2749 #endif
2750
2751         /*
2752                 Determine from map generator noise functions
2753         */
2754
2755         s16 level = mapgen::find_ground_level_from_noise(m_seed, p2d, 1);
2756         return level;
2757
2758         //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2759         //return (s16)level;
2760 }
2761
2762 void ServerMap::createDirs(std::string path)
2763 {
2764         if(fs::CreateAllDirs(path) == false)
2765         {
2766                 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2767                                 <<"\""<<path<<"\""<<std::endl;
2768                 throw BaseException("ServerMap failed to create directory");
2769         }
2770 }
2771
2772 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2773 {
2774         char cc[9];
2775         switch(layout)
2776         {
2777                 case 1:
2778                         snprintf(cc, 9, "%.4x%.4x",
2779                                 (unsigned int)pos.X&0xffff,
2780                                 (unsigned int)pos.Y&0xffff);
2781
2782                         return m_savedir + "/sectors/" + cc;
2783                 case 2:
2784                         snprintf(cc, 9, "%.3x/%.3x",
2785                                 (unsigned int)pos.X&0xfff,
2786                                 (unsigned int)pos.Y&0xfff);
2787
2788                         return m_savedir + "/sectors2/" + cc;
2789                 default:
2790                         assert(false);
2791         }
2792 }
2793
2794 v2s16 ServerMap::getSectorPos(std::string dirname)
2795 {
2796         unsigned int x, y;
2797         int r;
2798         size_t spos = dirname.rfind('/') + 1;
2799         assert(spos != std::string::npos);
2800         if(dirname.size() - spos == 8)
2801         {
2802                 // Old layout
2803                 r = sscanf(dirname.substr(spos).c_str(), "%4x%4x", &x, &y);
2804         }
2805         else if(dirname.size() - spos == 3)
2806         {
2807                 // New layout
2808                 r = sscanf(dirname.substr(spos-4).c_str(), "%3x/%3x", &x, &y);
2809                 // Sign-extend the 12 bit values up to 16 bits...
2810                 if(x&0x800) x|=0xF000;
2811                 if(y&0x800) y|=0xF000;
2812         }
2813         else
2814         {
2815                 assert(false);
2816         }
2817         assert(r == 2);
2818         v2s16 pos((s16)x, (s16)y);
2819         return pos;
2820 }
2821
2822 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2823 {
2824         v2s16 p2d = getSectorPos(sectordir);
2825
2826         if(blockfile.size() != 4){
2827                 throw InvalidFilenameException("Invalid block filename");
2828         }
2829         unsigned int y;
2830         int r = sscanf(blockfile.c_str(), "%4x", &y);
2831         if(r != 1)
2832                 throw InvalidFilenameException("Invalid block filename");
2833         return v3s16(p2d.X, y, p2d.Y);
2834 }
2835
2836 std::string ServerMap::getBlockFilename(v3s16 p)
2837 {
2838         char cc[5];
2839         snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2840         return cc;
2841 }
2842
2843 void ServerMap::save(bool only_changed)
2844 {
2845         DSTACK(__FUNCTION_NAME);
2846         if(m_map_saving_enabled == false)
2847         {
2848                 dstream<<DTIME<<"WARNING: Not saving map, saving disabled."<<std::endl;
2849                 return;
2850         }
2851
2852         if(only_changed == false)
2853                 dstream<<DTIME<<"ServerMap: Saving whole map, this can take time."
2854                                 <<std::endl;
2855
2856         if(only_changed == false || m_map_metadata_changed)
2857         {
2858                 saveMapMeta();
2859         }
2860
2861         u32 sector_meta_count = 0;
2862         u32 block_count = 0;
2863         u32 block_count_all = 0; // Number of blocks in memory
2864
2865         core::map<v2s16, MapSector*>::Iterator i = m_sectors.getIterator();
2866         for(; i.atEnd() == false; i++)
2867         {
2868                 ServerMapSector *sector = (ServerMapSector*)i.getNode()->getValue();
2869                 assert(sector->getId() == MAPSECTOR_SERVER);
2870
2871                 if(sector->differs_from_disk || only_changed == false)
2872                 {
2873                         saveSectorMeta(sector);
2874                         sector_meta_count++;
2875                 }
2876                 core::list<MapBlock*> blocks;
2877                 sector->getBlocks(blocks);
2878                 core::list<MapBlock*>::Iterator j;
2879                 for(j=blocks.begin(); j!=blocks.end(); j++)
2880                 {
2881                         MapBlock *block = *j;
2882
2883                         block_count_all++;
2884
2885                         if(block->getModified() >= MOD_STATE_WRITE_NEEDED
2886                                         || only_changed == false)
2887                         {
2888                                 saveBlock(block);
2889                                 block_count++;
2890
2891                                 /*dstream<<"ServerMap: Written block ("
2892                                                 <<block->getPos().X<<","
2893                                                 <<block->getPos().Y<<","
2894                                                 <<block->getPos().Z<<")"
2895                                                 <<std::endl;*/
2896                         }
2897                 }
2898         }
2899
2900         /*
2901                 Only print if something happened or saved whole map
2902         */
2903         if(only_changed == false || sector_meta_count != 0
2904                         || block_count != 0)
2905         {
2906                 dstream<<DTIME<<"ServerMap: Written: "
2907                                 <<sector_meta_count<<" sector metadata files, "
2908                                 <<block_count<<" block files"
2909                                 <<", "<<block_count_all<<" blocks in memory."
2910                                 <<std::endl;
2911         }
2912 }
2913
2914 void ServerMap::saveMapMeta()
2915 {
2916         DSTACK(__FUNCTION_NAME);
2917
2918         dstream<<"INFO: ServerMap::saveMapMeta(): "
2919                         <<"seed="<<m_seed
2920                         <<std::endl;
2921
2922         createDirs(m_savedir);
2923
2924         std::string fullpath = m_savedir + "/map_meta.txt";
2925         std::ofstream os(fullpath.c_str(), std::ios_base::binary);
2926         if(os.good() == false)
2927         {
2928                 dstream<<"ERROR: ServerMap::saveMapMeta(): "
2929                                 <<"could not open"<<fullpath<<std::endl;
2930                 throw FileNotGoodException("Cannot open chunk metadata");
2931         }
2932
2933         Settings params;
2934         params.setU64("seed", m_seed);
2935
2936         params.writeLines(os);
2937
2938         os<<"[end_of_params]\n";
2939
2940         m_map_metadata_changed = false;
2941 }
2942
2943 void ServerMap::loadMapMeta()
2944 {
2945         DSTACK(__FUNCTION_NAME);
2946
2947         dstream<<"INFO: ServerMap::loadMapMeta(): Loading map metadata"
2948                         <<std::endl;
2949
2950         std::string fullpath = m_savedir + "/map_meta.txt";
2951         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
2952         if(is.good() == false)
2953         {
2954                 dstream<<"ERROR: ServerMap::loadMapMeta(): "
2955                                 <<"could not open"<<fullpath<<std::endl;
2956                 throw FileNotGoodException("Cannot open map metadata");
2957         }
2958
2959         Settings params;
2960
2961         for(;;)
2962         {
2963                 if(is.eof())
2964                         throw SerializationError
2965                                         ("ServerMap::loadMapMeta(): [end_of_params] not found");
2966                 std::string line;
2967                 std::getline(is, line);
2968                 std::string trimmedline = trim(line);
2969                 if(trimmedline == "[end_of_params]")
2970                         break;
2971                 params.parseConfigLine(line);
2972         }
2973
2974         m_seed = params.getU64("seed");
2975
2976         dstream<<"INFO: ServerMap::loadMapMeta(): "
2977                         <<"seed="<<m_seed
2978                         <<std::endl;
2979 }
2980
2981 void ServerMap::saveSectorMeta(ServerMapSector *sector)
2982 {
2983         DSTACK(__FUNCTION_NAME);
2984         // Format used for writing
2985         u8 version = SER_FMT_VER_HIGHEST;
2986         // Get destination
2987         v2s16 pos = sector->getPos();
2988         std::string dir = getSectorDir(pos);
2989         createDirs(dir);
2990
2991         std::string fullpath = dir + "/meta";
2992         std::ofstream o(fullpath.c_str(), std::ios_base::binary);
2993         if(o.good() == false)
2994                 throw FileNotGoodException("Cannot open sector metafile");
2995
2996         sector->serialize(o, version);
2997
2998         sector->differs_from_disk = false;
2999 }
3000
3001 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
3002 {
3003         DSTACK(__FUNCTION_NAME);
3004         // Get destination
3005         v2s16 p2d = getSectorPos(sectordir);
3006
3007         ServerMapSector *sector = NULL;
3008
3009         std::string fullpath = sectordir + "/meta";
3010         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3011         if(is.good() == false)
3012         {
3013                 // If the directory exists anyway, it probably is in some old
3014                 // format. Just go ahead and create the sector.
3015                 if(fs::PathExists(sectordir))
3016                 {
3017                         /*dstream<<"ServerMap::loadSectorMeta(): Sector metafile "
3018                                         <<fullpath<<" doesn't exist but directory does."
3019                                         <<" Continuing with a sector with no metadata."
3020                                         <<std::endl;*/
3021                         sector = new ServerMapSector(this, p2d);
3022                         m_sectors.insert(p2d, sector);
3023                 }
3024                 else
3025                 {
3026                         throw FileNotGoodException("Cannot open sector metafile");
3027                 }
3028         }
3029         else
3030         {
3031                 sector = ServerMapSector::deSerialize
3032                                 (is, this, p2d, m_sectors);
3033                 if(save_after_load)
3034                         saveSectorMeta(sector);
3035         }
3036
3037         sector->differs_from_disk = false;
3038
3039         return sector;
3040 }
3041
3042 bool ServerMap::loadSectorMeta(v2s16 p2d)
3043 {
3044         DSTACK(__FUNCTION_NAME);
3045
3046         MapSector *sector = NULL;
3047
3048         // The directory layout we're going to load from.
3049         //  1 - original sectors/xxxxzzzz/
3050         //  2 - new sectors2/xxx/zzz/
3051         //  If we load from anything but the latest structure, we will
3052         //  immediately save to the new one, and remove the old.
3053         int loadlayout = 1;
3054         std::string sectordir1 = getSectorDir(p2d, 1);
3055         std::string sectordir;
3056         if(fs::PathExists(sectordir1))
3057         {
3058                 sectordir = sectordir1;
3059         }
3060         else
3061         {
3062                 loadlayout = 2;
3063                 sectordir = getSectorDir(p2d, 2);
3064         }
3065
3066         try{
3067                 sector = loadSectorMeta(sectordir, loadlayout != 2);
3068         }
3069         catch(InvalidFilenameException &e)
3070         {
3071                 return false;
3072         }
3073         catch(FileNotGoodException &e)
3074         {
3075                 return false;
3076         }
3077         catch(std::exception &e)
3078         {
3079                 return false;
3080         }
3081
3082         return true;
3083 }
3084
3085 #if 0
3086 bool ServerMap::loadSectorFull(v2s16 p2d)
3087 {
3088         DSTACK(__FUNCTION_NAME);
3089
3090         MapSector *sector = NULL;
3091
3092         // The directory layout we're going to load from.
3093         //  1 - original sectors/xxxxzzzz/
3094         //  2 - new sectors2/xxx/zzz/
3095         //  If we load from anything but the latest structure, we will
3096         //  immediately save to the new one, and remove the old.
3097         int loadlayout = 1;
3098         std::string sectordir1 = getSectorDir(p2d, 1);
3099         std::string sectordir;
3100         if(fs::PathExists(sectordir1))
3101         {
3102                 sectordir = sectordir1;
3103         }
3104         else
3105         {
3106                 loadlayout = 2;
3107                 sectordir = getSectorDir(p2d, 2);
3108         }
3109
3110         try{
3111                 sector = loadSectorMeta(sectordir, loadlayout != 2);
3112         }
3113         catch(InvalidFilenameException &e)
3114         {
3115                 return false;
3116         }
3117         catch(FileNotGoodException &e)
3118         {
3119                 return false;
3120         }
3121         catch(std::exception &e)
3122         {
3123                 return false;
3124         }
3125
3126         /*
3127                 Load blocks
3128         */
3129         std::vector<fs::DirListNode> list2 = fs::GetDirListing
3130                         (sectordir);
3131         std::vector<fs::DirListNode>::iterator i2;
3132         for(i2=list2.begin(); i2!=list2.end(); i2++)
3133         {
3134                 // We want files
3135                 if(i2->dir)
3136                         continue;
3137                 try{
3138                         loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3139                 }
3140                 catch(InvalidFilenameException &e)
3141                 {
3142                         // This catches unknown crap in directory
3143                 }
3144         }
3145
3146         if(loadlayout != 2)
3147         {
3148                 dstream<<"Sector converted to new layout - deleting "<<
3149                         sectordir1<<std::endl;
3150                 fs::RecursiveDelete(sectordir1);
3151         }
3152
3153         return true;
3154 }
3155 #endif
3156
3157 void ServerMap::saveBlock(MapBlock *block)
3158 {
3159         DSTACK(__FUNCTION_NAME);
3160         /*
3161                 Dummy blocks are not written
3162         */
3163         if(block->isDummy())
3164         {
3165                 /*v3s16 p = block->getPos();
3166                 dstream<<"ServerMap::saveBlock(): WARNING: Not writing dummy block "
3167                                 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
3168                 return;
3169         }
3170
3171         // Format used for writing
3172         u8 version = SER_FMT_VER_HIGHEST;
3173         // Get destination
3174         v3s16 p3d = block->getPos();
3175
3176         v2s16 p2d(p3d.X, p3d.Z);
3177         std::string sectordir = getSectorDir(p2d);
3178
3179         createDirs(sectordir);
3180
3181         std::string fullpath = sectordir+"/"+getBlockFilename(p3d);
3182         std::ofstream o(fullpath.c_str(), std::ios_base::binary);
3183         if(o.good() == false)
3184                 throw FileNotGoodException("Cannot open block data");
3185
3186         /*
3187                 [0] u8 serialization version
3188                 [1] data
3189         */
3190         o.write((char*)&version, 1);
3191
3192         // Write basic data
3193         block->serialize(o, version);
3194
3195         // Write extra data stored on disk
3196         block->serializeDiskExtra(o, version);
3197
3198         // We just wrote it to the disk so clear modified flag
3199         block->resetModified();
3200 }
3201
3202 void ServerMap::loadBlock(std::string sectordir, std::string blockfile, MapSector *sector, bool save_after_load)
3203 {
3204         DSTACK(__FUNCTION_NAME);
3205
3206         std::string fullpath = sectordir+"/"+blockfile;
3207         try{
3208
3209                 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3210                 if(is.good() == false)
3211                         throw FileNotGoodException("Cannot open block file");
3212
3213                 v3s16 p3d = getBlockPos(sectordir, blockfile);
3214                 v2s16 p2d(p3d.X, p3d.Z);
3215
3216                 assert(sector->getPos() == p2d);
3217
3218                 u8 version = SER_FMT_VER_INVALID;
3219                 is.read((char*)&version, 1);
3220
3221                 if(is.fail())
3222                         throw SerializationError("ServerMap::loadBlock(): Failed"
3223                                         " to read MapBlock version");
3224
3225                 /*u32 block_size = MapBlock::serializedLength(version);
3226                 SharedBuffer<u8> data(block_size);
3227                 is.read((char*)*data, block_size);*/
3228
3229                 // This will always return a sector because we're the server
3230                 //MapSector *sector = emergeSector(p2d);
3231
3232                 MapBlock *block = NULL;
3233                 bool created_new = false;
3234                 block = sector->getBlockNoCreateNoEx(p3d.Y);
3235                 if(block == NULL)
3236                 {
3237                         block = sector->createBlankBlockNoInsert(p3d.Y);
3238                         created_new = true;
3239                 }
3240
3241                 // Read basic data
3242                 block->deSerialize(is, version);
3243
3244                 // Read extra data stored on disk
3245                 block->deSerializeDiskExtra(is, version);
3246
3247                 // If it's a new block, insert it to the map
3248                 if(created_new)
3249                         sector->insertBlock(block);
3250
3251                 /*
3252                         Save blocks loaded in old format in new format
3253                 */
3254
3255                 if(version < SER_FMT_VER_HIGHEST || save_after_load)
3256                 {
3257                         saveBlock(block);
3258                 }
3259
3260                 // We just loaded it from the disk, so it's up-to-date.
3261                 block->resetModified();
3262
3263         }
3264         catch(SerializationError &e)
3265         {
3266                 dstream<<"WARNING: Invalid block data on disk "
3267                                 <<"fullpath="<<fullpath
3268                                 <<" (SerializationError). "
3269                                 <<"what()="<<e.what()
3270                                 <<std::endl;
3271                                 //" Ignoring. A new one will be generated.
3272                 assert(0);
3273
3274                 // TODO: Backup file; name is in fullpath.
3275         }
3276 }
3277
3278 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3279 {
3280         DSTACK(__FUNCTION_NAME);
3281
3282         v2s16 p2d(blockpos.X, blockpos.Z);
3283
3284         // The directory layout we're going to load from.
3285         //  1 - original sectors/xxxxzzzz/
3286         //  2 - new sectors2/xxx/zzz/
3287         //  If we load from anything but the latest structure, we will
3288         //  immediately save to the new one, and remove the old.
3289         int loadlayout = 1;
3290         std::string sectordir1 = getSectorDir(p2d, 1);
3291         std::string sectordir;
3292         if(fs::PathExists(sectordir1))
3293         {
3294                 sectordir = sectordir1;
3295         }
3296         else
3297         {
3298                 loadlayout = 2;
3299                 sectordir = getSectorDir(p2d, 2);
3300         }
3301
3302         /*
3303                 Make sure sector is loaded
3304         */
3305         MapSector *sector = getSectorNoGenerateNoEx(p2d);
3306         if(sector == NULL)
3307         {
3308                 try{
3309                         sector = loadSectorMeta(sectordir, loadlayout != 2);
3310                 }
3311                 catch(InvalidFilenameException &e)
3312                 {
3313                         return false;
3314                 }
3315                 catch(FileNotGoodException &e)
3316                 {
3317                         return false;
3318                 }
3319                 catch(std::exception &e)
3320                 {
3321                         return false;
3322                 }
3323         }
3324
3325         /*
3326                 Make sure file exists
3327         */
3328
3329         std::string blockfilename = getBlockFilename(blockpos);
3330         if(fs::PathExists(sectordir+"/"+blockfilename) == false)
3331                 return NULL;
3332
3333         /*
3334                 Load block
3335         */
3336         loadBlock(sectordir, blockfilename, sector, loadlayout != 2);
3337         return getBlockNoCreateNoEx(blockpos);
3338 }
3339
3340 void ServerMap::PrintInfo(std::ostream &out)
3341 {
3342         out<<"ServerMap: ";
3343 }
3344
3345 #ifndef SERVER
3346
3347 /*
3348         ClientMap
3349 */
3350
3351 ClientMap::ClientMap(
3352                 Client *client,
3353                 MapDrawControl &control,
3354                 scene::ISceneNode* parent,
3355                 scene::ISceneManager* mgr,
3356                 s32 id
3357 ):
3358         Map(dout_client),
3359         scene::ISceneNode(parent, mgr, id),
3360         m_client(client),
3361         m_control(control),
3362         m_camera_position(0,0,0),
3363         m_camera_direction(0,0,1)
3364 {
3365         m_camera_mutex.Init();
3366         assert(m_camera_mutex.IsInitialized());
3367
3368         m_box = core::aabbox3d<f32>(-BS*1000000,-BS*1000000,-BS*1000000,
3369                         BS*1000000,BS*1000000,BS*1000000);
3370 }
3371
3372 ClientMap::~ClientMap()
3373 {
3374         /*JMutexAutoLock lock(mesh_mutex);
3375
3376         if(mesh != NULL)
3377         {
3378                 mesh->drop();
3379                 mesh = NULL;
3380         }*/
3381 }
3382
3383 MapSector * ClientMap::emergeSector(v2s16 p2d)
3384 {
3385         DSTACK(__FUNCTION_NAME);
3386         // Check that it doesn't exist already
3387         try{
3388                 return getSectorNoGenerate(p2d);
3389         }
3390         catch(InvalidPositionException &e)
3391         {
3392         }
3393
3394         // Create a sector
3395         ClientMapSector *sector = new ClientMapSector(this, p2d);
3396
3397         {
3398                 //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3399                 m_sectors.insert(p2d, sector);
3400         }
3401
3402         return sector;
3403 }
3404
3405 #if 0
3406 void ClientMap::deSerializeSector(v2s16 p2d, std::istream &is)
3407 {
3408         DSTACK(__FUNCTION_NAME);
3409         ClientMapSector *sector = NULL;
3410
3411         //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3412
3413         core::map<v2s16, MapSector*>::Node *n = m_sectors.find(p2d);
3414
3415         if(n != NULL)
3416         {
3417                 sector = (ClientMapSector*)n->getValue();
3418                 assert(sector->getId() == MAPSECTOR_CLIENT);
3419         }
3420         else
3421         {
3422                 sector = new ClientMapSector(this, p2d);
3423                 {
3424                         //JMutexAutoLock lock(m_sector_mutex); // Bulk comment-out
3425                         m_sectors.insert(p2d, sector);
3426                 }
3427         }
3428
3429         sector->deSerialize(is);
3430 }
3431 #endif
3432
3433 void ClientMap::OnRegisterSceneNode()
3434 {
3435         if(IsVisible)
3436         {
3437                 SceneManager->registerNodeForRendering(this, scene::ESNRP_SOLID);
3438                 SceneManager->registerNodeForRendering(this, scene::ESNRP_TRANSPARENT);
3439         }
3440
3441         ISceneNode::OnRegisterSceneNode();
3442 }
3443
3444 void ClientMap::renderMap(video::IVideoDriver* driver, s32 pass)
3445 {
3446         //m_dout<<DTIME<<"Rendering map..."<<std::endl;
3447         DSTACK(__FUNCTION_NAME);
3448
3449         bool is_transparent_pass = pass == scene::ESNRP_TRANSPARENT;
3450
3451         /*
3452                 This is called two times per frame, reset on the non-transparent one
3453         */
3454         if(pass == scene::ESNRP_SOLID)
3455         {
3456                 m_last_drawn_sectors.clear();
3457         }
3458
3459         /*
3460                 Get time for measuring timeout.
3461
3462                 Measuring time is very useful for long delays when the
3463                 machine is swapping a lot.
3464         */
3465         int time1 = time(0);
3466
3467         //u32 daynight_ratio = m_client->getDayNightRatio();
3468
3469         m_camera_mutex.Lock();
3470         v3f camera_position = m_camera_position;
3471         v3f camera_direction = m_camera_direction;
3472         m_camera_mutex.Unlock();
3473
3474         /*
3475                 Get all blocks and draw all visible ones
3476         */
3477
3478         v3s16 cam_pos_nodes(
3479                         camera_position.X / BS,
3480                         camera_position.Y / BS,
3481                         camera_position.Z / BS);
3482
3483         v3s16 box_nodes_d = m_control.wanted_range * v3s16(1,1,1);
3484
3485         v3s16 p_nodes_min = cam_pos_nodes - box_nodes_d;
3486         v3s16 p_nodes_max = cam_pos_nodes + box_nodes_d;
3487
3488         // Take a fair amount as we will be dropping more out later
3489         v3s16 p_blocks_min(
3490                         p_nodes_min.X / MAP_BLOCKSIZE - 2,
3491                         p_nodes_min.Y / MAP_BLOCKSIZE - 2,
3492                         p_nodes_min.Z / MAP_BLOCKSIZE - 2);
3493         v3s16 p_blocks_max(
3494                         p_nodes_max.X / MAP_BLOCKSIZE + 1,
3495                         p_nodes_max.Y / MAP_BLOCKSIZE + 1,
3496                         p_nodes_max.Z / MAP_BLOCKSIZE + 1);
3497
3498         u32 vertex_count = 0;
3499
3500         // For limiting number of mesh updates per frame
3501         u32 mesh_update_count = 0;
3502
3503         u32 blocks_would_have_drawn = 0;
3504         u32 blocks_drawn = 0;
3505
3506         int timecheck_counter = 0;
3507         core::map<v2s16, MapSector*>::Iterator si;
3508         si = m_sectors.getIterator();
3509         for(; si.atEnd() == false; si++)
3510         {
3511                 {
3512                         timecheck_counter++;
3513                         if(timecheck_counter > 50)
3514                         {
3515                                 timecheck_counter = 0;
3516                                 int time2 = time(0);
3517                                 if(time2 > time1 + 4)
3518                                 {
3519                                         dstream<<"ClientMap::renderMap(): "
3520                                                 "Rendering takes ages, returning."
3521                                                 <<std::endl;
3522                                         return;
3523                                 }
3524                         }
3525                 }
3526
3527                 MapSector *sector = si.getNode()->getValue();
3528                 v2s16 sp = sector->getPos();
3529
3530                 if(m_control.range_all == false)
3531                 {
3532                         if(sp.X < p_blocks_min.X
3533                         || sp.X > p_blocks_max.X
3534                         || sp.Y < p_blocks_min.Z
3535                         || sp.Y > p_blocks_max.Z)
3536                                 continue;
3537                 }
3538
3539                 core::list< MapBlock * > sectorblocks;
3540                 sector->getBlocks(sectorblocks);
3541
3542                 /*
3543                         Draw blocks
3544                 */
3545
3546                 u32 sector_blocks_drawn = 0;
3547
3548                 core::list< MapBlock * >::Iterator i;
3549                 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3550                 {
3551                         MapBlock *block = *i;
3552
3553                         /*
3554                                 Compare block position to camera position, skip
3555                                 if not seen on display
3556                         */
3557
3558                         float range = 100000 * BS;
3559                         if(m_control.range_all == false)
3560                                 range = m_control.wanted_range * BS;
3561
3562                         float d = 0.0;
3563                         if(isBlockInSight(block->getPos(), camera_position,
3564                                         camera_direction, range, &d) == false)
3565                         {
3566                                 continue;
3567                         }
3568
3569                         // Okay, this block will be drawn. Reset usage timer.
3570                         block->resetUsageTimer();
3571
3572                         // This is ugly (spherical distance limit?)
3573                         /*if(m_control.range_all == false &&
3574                                         d - 0.5*BS*MAP_BLOCKSIZE > range)
3575                                 continue;*/
3576
3577 #if 1
3578                         /*
3579                                 Update expired mesh (used for day/night change)
3580
3581                                 It doesn't work exactly like it should now with the
3582                                 tasked mesh update but whatever.
3583                         */
3584
3585                         bool mesh_expired = false;
3586
3587                         {
3588                                 JMutexAutoLock lock(block->mesh_mutex);
3589
3590                                 mesh_expired = block->getMeshExpired();
3591
3592                                 // Mesh has not been expired and there is no mesh:
3593                                 // block has no content
3594                                 if(block->mesh == NULL && mesh_expired == false)
3595                                         continue;
3596                         }
3597
3598                         f32 faraway = BS*50;
3599                         //f32 faraway = m_control.wanted_range * BS;
3600
3601                         /*
3602                                 This has to be done with the mesh_mutex unlocked
3603                         */
3604                         // Pretty random but this should work somewhat nicely
3605                         if(mesh_expired && (
3606                                         (mesh_update_count < 3
3607                                                 && (d < faraway || mesh_update_count < 2)
3608                                         )
3609                                         ||
3610                                         (m_control.range_all && mesh_update_count < 20)
3611                                 )
3612                         )
3613                         /*if(mesh_expired && mesh_update_count < 6
3614                                         && (d < faraway || mesh_update_count < 3))*/
3615                         {
3616                                 mesh_update_count++;
3617
3618                                 // Mesh has been expired: generate new mesh
3619                                 //block->updateMesh(daynight_ratio);
3620                                 m_client->addUpdateMeshTask(block->getPos());
3621
3622                                 mesh_expired = false;
3623                         }
3624
3625 #endif
3626                         /*
3627                                 Draw the faces of the block
3628                         */
3629                         {
3630                                 JMutexAutoLock lock(block->mesh_mutex);
3631
3632                                 scene::SMesh *mesh = block->mesh;
3633
3634                                 if(mesh == NULL)
3635                                         continue;
3636
3637                                 blocks_would_have_drawn++;
3638                                 if(blocks_drawn >= m_control.wanted_max_blocks
3639                                                 && m_control.range_all == false
3640                                                 && d > m_control.wanted_min_range * BS)
3641                                         continue;
3642
3643                                 blocks_drawn++;
3644                                 sector_blocks_drawn++;
3645
3646                                 u32 c = mesh->getMeshBufferCount();
3647
3648                                 for(u32 i=0; i<c; i++)
3649                                 {
3650                                         scene::IMeshBuffer *buf = mesh->getMeshBuffer(i);
3651                                         const video::SMaterial& material = buf->getMaterial();
3652                                         video::IMaterialRenderer* rnd =
3653                                                         driver->getMaterialRenderer(material.MaterialType);
3654                                         bool transparent = (rnd && rnd->isTransparent());
3655                                         // Render transparent on transparent pass and likewise.
3656                                         if(transparent == is_transparent_pass)
3657                                         {
3658                                                 /*
3659                                                         This *shouldn't* hurt too much because Irrlicht
3660                                                         doesn't change opengl textures if the old
3661                                                         material is set again.
3662                                                 */
3663                                                 driver->setMaterial(buf->getMaterial());
3664                                                 driver->drawMeshBuffer(buf);
3665                                                 vertex_count += buf->getVertexCount();
3666                                         }
3667                                 }
3668                         }
3669                 } // foreach sectorblocks
3670
3671                 if(sector_blocks_drawn != 0)
3672                 {
3673                         m_last_drawn_sectors[sp] = true;
3674                 }
3675         }
3676
3677         m_control.blocks_drawn = blocks_drawn;
3678         m_control.blocks_would_have_drawn = blocks_would_have_drawn;
3679
3680         /*dstream<<"renderMap(): is_transparent_pass="<<is_transparent_pass
3681                         <<", rendered "<<vertex_count<<" vertices."<<std::endl;*/
3682 }
3683
3684 bool ClientMap::setTempMod(v3s16 p, NodeMod mod,
3685                 core::map<v3s16, MapBlock*> *affected_blocks)
3686 {
3687         bool changed = false;
3688         /*
3689                 Add it to all blocks touching it
3690         */
3691         v3s16 dirs[7] = {
3692                 v3s16(0,0,0), // this
3693                 v3s16(0,0,1), // back
3694                 v3s16(0,1,0), // top
3695                 v3s16(1,0,0), // right
3696                 v3s16(0,0,-1), // front
3697                 v3s16(0,-1,0), // bottom
3698                 v3s16(-1,0,0), // left
3699         };
3700         for(u16 i=0; i<7; i++)
3701         {
3702                 v3s16 p2 = p + dirs[i];
3703                 // Block position of neighbor (or requested) node
3704                 v3s16 blockpos = getNodeBlockPos(p2);
3705                 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3706                 if(blockref == NULL)
3707                         continue;
3708                 // Relative position of requested node
3709                 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3710                 if(blockref->setTempMod(relpos, mod))
3711                 {
3712                         changed = true;
3713                 }
3714         }
3715         if(changed && affected_blocks!=NULL)
3716         {
3717                 for(u16 i=0; i<7; i++)
3718                 {
3719                         v3s16 p2 = p + dirs[i];
3720                         // Block position of neighbor (or requested) node
3721                         v3s16 blockpos = getNodeBlockPos(p2);
3722                         MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3723                         if(blockref == NULL)
3724                                 continue;
3725                         affected_blocks->insert(blockpos, blockref);
3726                 }
3727         }
3728         return changed;
3729 }
3730
3731 bool ClientMap::clearTempMod(v3s16 p,
3732                 core::map<v3s16, MapBlock*> *affected_blocks)
3733 {
3734         bool changed = false;
3735         v3s16 dirs[7] = {
3736                 v3s16(0,0,0), // this
3737                 v3s16(0,0,1), // back
3738                 v3s16(0,1,0), // top
3739                 v3s16(1,0,0), // right
3740                 v3s16(0,0,-1), // front
3741                 v3s16(0,-1,0), // bottom
3742                 v3s16(-1,0,0), // left
3743         };
3744         for(u16 i=0; i<7; i++)
3745         {
3746                 v3s16 p2 = p + dirs[i];
3747                 // Block position of neighbor (or requested) node
3748                 v3s16 blockpos = getNodeBlockPos(p2);
3749                 MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3750                 if(blockref == NULL)
3751                         continue;
3752                 // Relative position of requested node
3753                 v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
3754                 if(blockref->clearTempMod(relpos))
3755                 {
3756                         changed = true;
3757                 }
3758         }
3759         if(changed && affected_blocks!=NULL)
3760         {
3761                 for(u16 i=0; i<7; i++)
3762                 {
3763                         v3s16 p2 = p + dirs[i];
3764                         // Block position of neighbor (or requested) node
3765                         v3s16 blockpos = getNodeBlockPos(p2);
3766                         MapBlock * blockref = getBlockNoCreateNoEx(blockpos);
3767                         if(blockref == NULL)
3768                                 continue;
3769                         affected_blocks->insert(blockpos, blockref);
3770                 }
3771         }
3772         return changed;
3773 }
3774
3775 void ClientMap::expireMeshes(bool only_daynight_diffed)
3776 {
3777         TimeTaker timer("expireMeshes()");
3778
3779         core::map<v2s16, MapSector*>::Iterator si;
3780         si = m_sectors.getIterator();
3781         for(; si.atEnd() == false; si++)
3782         {
3783                 MapSector *sector = si.getNode()->getValue();
3784
3785                 core::list< MapBlock * > sectorblocks;
3786                 sector->getBlocks(sectorblocks);
3787
3788                 core::list< MapBlock * >::Iterator i;
3789                 for(i=sectorblocks.begin(); i!=sectorblocks.end(); i++)
3790                 {
3791                         MapBlock *block = *i;
3792
3793                         if(only_daynight_diffed && dayNightDiffed(block->getPos()) == false)
3794                         {
3795                                 continue;
3796                         }
3797
3798                         {
3799                                 JMutexAutoLock lock(block->mesh_mutex);
3800                                 if(block->mesh != NULL)
3801                                 {
3802                                         /*block->mesh->drop();
3803                                         block->mesh = NULL;*/
3804                                         block->setMeshExpired(true);
3805                                 }
3806                         }
3807                 }
3808         }
3809 }
3810
3811 void ClientMap::updateMeshes(v3s16 blockpos, u32 daynight_ratio)
3812 {
3813         assert(mapType() == MAPTYPE_CLIENT);
3814
3815         try{
3816                 v3s16 p = blockpos + v3s16(0,0,0);
3817                 MapBlock *b = getBlockNoCreate(p);
3818                 b->updateMesh(daynight_ratio);
3819                 //b->setMeshExpired(true);
3820         }
3821         catch(InvalidPositionException &e){}
3822         // Leading edge
3823         try{
3824                 v3s16 p = blockpos + v3s16(-1,0,0);
3825                 MapBlock *b = getBlockNoCreate(p);
3826                 b->updateMesh(daynight_ratio);
3827                 //b->setMeshExpired(true);
3828         }
3829         catch(InvalidPositionException &e){}
3830         try{
3831                 v3s16 p = blockpos + v3s16(0,-1,0);
3832                 MapBlock *b = getBlockNoCreate(p);
3833                 b->updateMesh(daynight_ratio);
3834                 //b->setMeshExpired(true);
3835         }
3836         catch(InvalidPositionException &e){}
3837         try{
3838                 v3s16 p = blockpos + v3s16(0,0,-1);
3839                 MapBlock *b = getBlockNoCreate(p);
3840                 b->updateMesh(daynight_ratio);
3841                 //b->setMeshExpired(true);
3842         }
3843         catch(InvalidPositionException &e){}
3844 }
3845
3846 #if 0
3847 /*
3848         Update mesh of block in which the node is, and if the node is at the
3849         leading edge, update the appropriate leading blocks too.
3850 */
3851 void ClientMap::updateNodeMeshes(v3s16 nodepos, u32 daynight_ratio)
3852 {
3853         v3s16 dirs[4] = {
3854                 v3s16(0,0,0),
3855                 v3s16(-1,0,0),
3856                 v3s16(0,-1,0),
3857                 v3s16(0,0,-1),
3858         };
3859         v3s16 blockposes[4];
3860         for(u32 i=0; i<4; i++)
3861         {
3862                 v3s16 np = nodepos + dirs[i];
3863                 blockposes[i] = getNodeBlockPos(np);
3864                 // Don't update mesh of block if it has been done already
3865                 bool already_updated = false;
3866                 for(u32 j=0; j<i; j++)
3867                 {
3868                         if(blockposes[j] == blockposes[i])
3869                         {
3870                                 already_updated = true;
3871                                 break;
3872                         }
3873                 }
3874                 if(already_updated)
3875                         continue;
3876                 // Update mesh
3877                 MapBlock *b = getBlockNoCreate(blockposes[i]);
3878                 b->updateMesh(daynight_ratio);
3879         }
3880 }
3881 #endif
3882
3883 void ClientMap::PrintInfo(std::ostream &out)
3884 {
3885         out<<"ClientMap: ";
3886 }
3887
3888 #endif // !SERVER
3889
3890 /*
3891         MapVoxelManipulator
3892 */
3893
3894 MapVoxelManipulator::MapVoxelManipulator(Map *map)
3895 {
3896         m_map = map;
3897 }
3898
3899 MapVoxelManipulator::~MapVoxelManipulator()
3900 {
3901         /*dstream<<"MapVoxelManipulator: blocks: "<<m_loaded_blocks.size()
3902                         <<std::endl;*/
3903 }
3904
3905 void MapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
3906 {
3907         TimeTaker timer1("emerge", &emerge_time);
3908
3909         // Units of these are MapBlocks
3910         v3s16 p_min = getNodeBlockPos(a.MinEdge);
3911         v3s16 p_max = getNodeBlockPos(a.MaxEdge);
3912
3913         VoxelArea block_area_nodes
3914                         (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3915
3916         addArea(block_area_nodes);
3917
3918         for(s32 z=p_min.Z; z<=p_max.Z; z++)
3919         for(s32 y=p_min.Y; y<=p_max.Y; y++)
3920         for(s32 x=p_min.X; x<=p_max.X; x++)
3921         {
3922                 v3s16 p(x,y,z);
3923                 core::map<v3s16, bool>::Node *n;
3924                 n = m_loaded_blocks.find(p);
3925                 if(n != NULL)
3926                         continue;
3927
3928                 bool block_data_inexistent = false;
3929                 try
3930                 {
3931                         TimeTaker timer1("emerge load", &emerge_load_time);
3932
3933                         /*dstream<<"Loading block (caller_id="<<caller_id<<")"
3934                                         <<" ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
3935                                         <<" wanted area: ";
3936                         a.print(dstream);
3937                         dstream<<std::endl;*/
3938
3939                         MapBlock *block = m_map->getBlockNoCreate(p);
3940                         if(block->isDummy())
3941                                 block_data_inexistent = true;
3942                         else
3943                                 block->copyTo(*this);
3944                 }
3945                 catch(InvalidPositionException &e)
3946                 {
3947                         block_data_inexistent = true;
3948                 }
3949
3950                 if(block_data_inexistent)
3951                 {
3952                         VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3953                         // Fill with VOXELFLAG_INEXISTENT
3954                         for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3955                         for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3956                         {
3957                                 s32 i = m_area.index(a.MinEdge.X,y,z);
3958                                 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
3959                         }
3960                 }
3961
3962                 m_loaded_blocks.insert(p, !block_data_inexistent);
3963         }
3964
3965         //dstream<<"emerge done"<<std::endl;
3966 }
3967
3968 /*
3969         SUGG: Add an option to only update eg. water and air nodes.
3970               This will make it interfere less with important stuff if
3971                   run on background.
3972 */
3973 void MapVoxelManipulator::blitBack
3974                 (core::map<v3s16, MapBlock*> & modified_blocks)
3975 {
3976         if(m_area.getExtent() == v3s16(0,0,0))
3977                 return;
3978
3979         //TimeTaker timer1("blitBack");
3980
3981         /*dstream<<"blitBack(): m_loaded_blocks.size()="
3982                         <<m_loaded_blocks.size()<<std::endl;*/
3983
3984         /*
3985                 Initialize block cache
3986         */
3987         v3s16 blockpos_last;
3988         MapBlock *block = NULL;
3989         bool block_checked_in_modified = false;
3990
3991         for(s32 z=m_area.MinEdge.Z; z<=m_area.MaxEdge.Z; z++)
3992         for(s32 y=m_area.MinEdge.Y; y<=m_area.MaxEdge.Y; y++)
3993         for(s32 x=m_area.MinEdge.X; x<=m_area.MaxEdge.X; x++)
3994         {
3995                 v3s16 p(x,y,z);
3996
3997                 u8 f = m_flags[m_area.index(p)];
3998                 if(f & (VOXELFLAG_NOT_LOADED|VOXELFLAG_INEXISTENT))
3999                         continue;
4000
4001                 MapNode &n = m_data[m_area.index(p)];
4002
4003                 v3s16 blockpos = getNodeBlockPos(p);
4004
4005                 try
4006                 {
4007                         // Get block
4008                         if(block == NULL || blockpos != blockpos_last){
4009                                 block = m_map->getBlockNoCreate(blockpos);
4010                                 blockpos_last = blockpos;
4011                                 block_checked_in_modified = false;
4012                         }
4013
4014                         // Calculate relative position in block
4015                         v3s16 relpos = p - blockpos * MAP_BLOCKSIZE;
4016
4017                         // Don't continue if nothing has changed here
4018                         if(block->getNode(relpos) == n)
4019                                 continue;
4020
4021                         //m_map->setNode(m_area.MinEdge + p, n);
4022                         block->setNode(relpos, n);
4023
4024                         /*
4025                                 Make sure block is in modified_blocks
4026                         */
4027                         if(block_checked_in_modified == false)
4028                         {
4029                                 modified_blocks[blockpos] = block;
4030                                 block_checked_in_modified = true;
4031                         }
4032                 }
4033                 catch(InvalidPositionException &e)
4034                 {
4035                 }
4036         }
4037 }
4038
4039 ManualMapVoxelManipulator::ManualMapVoxelManipulator(Map *map):
4040                 MapVoxelManipulator(map),
4041                 m_create_area(false)
4042 {
4043 }
4044
4045 ManualMapVoxelManipulator::~ManualMapVoxelManipulator()
4046 {
4047 }
4048
4049 void ManualMapVoxelManipulator::emerge(VoxelArea a, s32 caller_id)
4050 {
4051         // Just create the area so that it can be pointed to
4052         VoxelManipulator::emerge(a, caller_id);
4053 }
4054
4055 void ManualMapVoxelManipulator::initialEmerge(
4056                 v3s16 blockpos_min, v3s16 blockpos_max)
4057 {
4058         TimeTaker timer1("initialEmerge", &emerge_time);
4059
4060         // Units of these are MapBlocks
4061         v3s16 p_min = blockpos_min;
4062         v3s16 p_max = blockpos_max;
4063
4064         VoxelArea block_area_nodes
4065                         (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4066
4067         u32 size_MB = block_area_nodes.getVolume()*4/1000000;
4068         if(size_MB >= 1)
4069         {
4070                 dstream<<"initialEmerge: area: ";
4071                 block_area_nodes.print(dstream);
4072                 dstream<<" ("<<size_MB<<"MB)";
4073                 dstream<<std::endl;
4074         }
4075
4076         addArea(block_area_nodes);
4077
4078         for(s32 z=p_min.Z; z<=p_max.Z; z++)
4079         for(s32 y=p_min.Y; y<=p_max.Y; y++)
4080         for(s32 x=p_min.X; x<=p_max.X; x++)
4081         {
4082                 v3s16 p(x,y,z);
4083                 core::map<v3s16, bool>::Node *n;
4084                 n = m_loaded_blocks.find(p);
4085                 if(n != NULL)
4086                         continue;
4087
4088                 bool block_data_inexistent = false;
4089                 try
4090                 {
4091                         TimeTaker timer1("emerge load", &emerge_load_time);
4092
4093                         MapBlock *block = m_map->getBlockNoCreate(p);
4094                         if(block->isDummy())
4095                                 block_data_inexistent = true;
4096                         else
4097                                 block->copyTo(*this);
4098                 }
4099                 catch(InvalidPositionException &e)
4100                 {
4101                         block_data_inexistent = true;
4102                 }
4103
4104                 if(block_data_inexistent)
4105                 {
4106                         /*
4107                                 Mark area inexistent
4108                         */
4109                         VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
4110                         // Fill with VOXELFLAG_INEXISTENT
4111                         for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
4112                         for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
4113                         {
4114                                 s32 i = m_area.index(a.MinEdge.X,y,z);
4115                                 memset(&m_flags[i], VOXELFLAG_INEXISTENT, MAP_BLOCKSIZE);
4116                         }
4117                 }
4118
4119                 m_loaded_blocks.insert(p, !block_data_inexistent);
4120         }
4121 }
4122
4123 void ManualMapVoxelManipulator::blitBackAll(
4124                 core::map<v3s16, MapBlock*> * modified_blocks)
4125 {
4126         if(m_area.getExtent() == v3s16(0,0,0))
4127                 return;
4128
4129         /*
4130                 Copy data of all blocks
4131         */
4132         for(core::map<v3s16, bool>::Iterator
4133                         i = m_loaded_blocks.getIterator();
4134                         i.atEnd() == false; i++)
4135         {
4136                 v3s16 p = i.getNode()->getKey();
4137                 bool existed = i.getNode()->getValue();
4138                 if(existed == false)
4139                 {
4140                         // The Great Bug was found using this
4141                         /*dstream<<"ManualMapVoxelManipulator::blitBackAll: "
4142                                         <<"Inexistent ("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4143                                         <<std::endl;*/
4144                         continue;
4145                 }
4146                 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
4147                 if(block == NULL)
4148                 {
4149                         dstream<<"WARNING: "<<__FUNCTION_NAME
4150                                         <<": got NULL block "
4151                                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
4152                                         <<std::endl;
4153                         continue;
4154                 }
4155
4156                 block->copyFrom(*this);
4157
4158                 if(modified_blocks)
4159                         modified_blocks->insert(p, block);
4160         }
4161 }
4162
4163 //END