src/map.cpp

   1 /*
   2 Minetest
   3 Copyright (C) 2010-2013 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 Lesser General Public License as published by
   7 the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details.
  14
  15 You should have received a copy of the GNU Lesser 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 "filesys.h"
  24 #include "voxel.h"
  25 #include "porting.h"
  26 #include "serialization.h"
  27 #include "nodemetadata.h"
  28 #include "settings.h"
  29 #include "log.h"
  30 #include "profiler.h"
  31 #include "nodedef.h"
  32 #include "gamedef.h"
  33 #include "util/directiontables.h"
  34 #include "util/mathconstants.h"
  35 #include "rollback_interface.h"
  36 #include "environment.h"
  37 #include "emerge.h"
  38 #include "mapgen_v6.h"
  39 #include "mg_biome.h"
  40 #include "config.h"
  41 #include "server.h"
  42 #include "database.h"
  43 #include "database-dummy.h"
  44 #include "database-sqlite3.h"
  45 #include <deque>
  46 #include <queue>
  47 #if USE_LEVELDB
  48 #include "database-leveldb.h"
  49 #endif
  50 #if USE_REDIS
  51 #include "database-redis.h"
  52 #endif
  53
  54 #define PP(x) "("<<(x).X<<","<<(x).Y<<","<<(x).Z<<")"
  55
  56
  57 /*
  58         Map
  59 */
  60
  61 Map::Map(std::ostream &dout, IGameDef *gamedef):
  62         m_dout(dout),
  63         m_gamedef(gamedef),
  64         m_sector_cache(NULL),
  65         m_transforming_liquid_loop_count_multiplier(1.0f),
  66         m_unprocessed_count(0),
  67         m_inc_trending_up_start_time(0),
  68         m_queue_size_timer_started(false)
  69 {
  70 }
  71
  72 Map::~Map()
  73 {
  74         /*
  75                 Free all MapSectors
  76         */
  77         for(std::map<v2s16, MapSector*>::iterator i = m_sectors.begin();
  78                 i != m_sectors.end(); ++i)
  79         {
  80                 delete i->second;
  81         }
  82 }
  83
  84 void Map::addEventReceiver(MapEventReceiver *event_receiver)
  85 {
  86         m_event_receivers.insert(event_receiver);
  87 }
  88
  89 void Map::removeEventReceiver(MapEventReceiver *event_receiver)
  90 {
  91         m_event_receivers.erase(event_receiver);
  92 }
  93
  94 void Map::dispatchEvent(MapEditEvent *event)
  95 {
  96         for(std::set<MapEventReceiver*>::iterator
  97                         i = m_event_receivers.begin();
  98                         i != m_event_receivers.end(); ++i)
  99         {
 100                 (*i)->onMapEditEvent(event);
 101         }
 102 }
 103
 104 MapSector * Map::getSectorNoGenerateNoExNoLock(v2s16 p)
 105 {
 106         if(m_sector_cache != NULL && p == m_sector_cache_p){
 107                 MapSector * sector = m_sector_cache;
 108                 return sector;
 109         }
 110
 111         std::map<v2s16, MapSector*>::iterator n = m_sectors.find(p);
 112
 113         if(n == m_sectors.end())
 114                 return NULL;
 115
 116         MapSector *sector = n->second;
 117
 118         // Cache the last result
 119         m_sector_cache_p = p;
 120         m_sector_cache = sector;
 121
 122         return sector;
 123 }
 124
 125 MapSector * Map::getSectorNoGenerateNoEx(v2s16 p)
 126 {
 127         return getSectorNoGenerateNoExNoLock(p);
 128 }
 129
 130 MapSector * Map::getSectorNoGenerate(v2s16 p)
 131 {
 132         MapSector *sector = getSectorNoGenerateNoEx(p);
 133         if(sector == NULL)
 134                 throw InvalidPositionException();
 135
 136         return sector;
 137 }
 138
 139 MapBlock * Map::getBlockNoCreateNoEx(v3s16 p3d)
 140 {
 141         v2s16 p2d(p3d.X, p3d.Z);
 142         MapSector * sector = getSectorNoGenerateNoEx(p2d);
 143         if(sector == NULL)
 144                 return NULL;
 145         MapBlock *block = sector->getBlockNoCreateNoEx(p3d.Y);
 146         return block;
 147 }
 148
 149 MapBlock * Map::getBlockNoCreate(v3s16 p3d)
 150 {
 151         MapBlock *block = getBlockNoCreateNoEx(p3d);
 152         if(block == NULL)
 153                 throw InvalidPositionException();
 154         return block;
 155 }
 156
 157 bool Map::isNodeUnderground(v3s16 p)
 158 {
 159         v3s16 blockpos = getNodeBlockPos(p);
 160         try{
 161                 MapBlock * block = getBlockNoCreate(blockpos);
 162                 return block->getIsUnderground();
 163         }
 164         catch(InvalidPositionException &e)
 165         {
 166                 return false;
 167         }
 168 }
 169
 170 bool Map::isValidPosition(v3s16 p)
 171 {
 172         v3s16 blockpos = getNodeBlockPos(p);
 173         MapBlock *block = getBlockNoCreate(blockpos);
 174         return (block != NULL);
 175 }
 176
 177 // Returns a CONTENT_IGNORE node if not found
 178 MapNode Map::getNodeNoEx(v3s16 p, bool *is_valid_position)
 179 {
 180         v3s16 blockpos = getNodeBlockPos(p);
 181         MapBlock *block = getBlockNoCreateNoEx(blockpos);
 182         if (block == NULL) {
 183                 if (is_valid_position != NULL)
 184                         *is_valid_position = false;
 185                 return MapNode(CONTENT_IGNORE);
 186         }
 187
 188         v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
 189         bool is_valid_p;
 190         MapNode node = block->getNodeNoCheck(relpos, &is_valid_p);
 191         if (is_valid_position != NULL)
 192                 *is_valid_position = is_valid_p;
 193         return node;
 194 }
 195
 196 #if 0
 197 // Deprecated
 198 // throws InvalidPositionException if not found
 199 // TODO: Now this is deprecated, getNodeNoEx should be renamed
 200 MapNode Map::getNode(v3s16 p)
 201 {
 202         v3s16 blockpos = getNodeBlockPos(p);
 203         MapBlock *block = getBlockNoCreateNoEx(blockpos);
 204         if (block == NULL)
 205                 throw InvalidPositionException();
 206         v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
 207         bool is_valid_position;
 208         MapNode node = block->getNodeNoCheck(relpos, &is_valid_position);
 209         if (!is_valid_position)
 210                 throw InvalidPositionException();
 211         return node;
 212 }
 213 #endif
 214
 215 // throws InvalidPositionException if not found
 216 void Map::setNode(v3s16 p, MapNode & n)
 217 {
 218         v3s16 blockpos = getNodeBlockPos(p);
 219         MapBlock *block = getBlockNoCreate(blockpos);
 220         v3s16 relpos = p - blockpos*MAP_BLOCKSIZE;
 221         // Never allow placing CONTENT_IGNORE, it fucks up stuff
 222         if(n.getContent() == CONTENT_IGNORE){
 223                 bool temp_bool;
 224                 errorstream<<"Map::setNode(): Not allowing to place CONTENT_IGNORE"
 225                                 <<" while trying to replace \""
 226                                 <<m_gamedef->ndef()->get(block->getNodeNoCheck(relpos, &temp_bool)).name
 227                                 <<"\" at "<<PP(p)<<" (block "<<PP(blockpos)<<")"<<std::endl;
 228                 debug_stacks_print_to(infostream);
 229                 return;
 230         }
 231         block->setNodeNoCheck(relpos, n);
 232 }
 233
 234
 235 /*
 236         Goes recursively through the neighbours of the node.
 237
 238         Alters only transparent nodes.
 239
 240         If the lighting of the neighbour is lower than the lighting of
 241         the node was (before changing it to 0 at the step before), the
 242         lighting of the neighbour is set to 0 and then the same stuff
 243         repeats for the neighbour.
 244
 245         The ending nodes of the routine are stored in light_sources.
 246         This is useful when a light is removed. In such case, this
 247         routine can be called for the light node and then again for
 248         light_sources to re-light the area without the removed light.
 249
 250         values of from_nodes are lighting values.
 251 */
 252 void Map::unspreadLight(enum LightBank bank,
 253                 std::map<v3s16, u8> & from_nodes,
 254                 std::set<v3s16> & light_sources,
 255                 std::map<v3s16, MapBlock*>  & modified_blocks)
 256 {
 257         INodeDefManager *nodemgr = m_gamedef->ndef();
 258
 259         v3s16 dirs[6] = {
 260                 v3s16(0,0,1), // back
 261                 v3s16(0,1,0), // top
 262                 v3s16(1,0,0), // right
 263                 v3s16(0,0,-1), // front
 264                 v3s16(0,-1,0), // bottom
 265                 v3s16(-1,0,0), // left
 266         };
 267
 268         if(from_nodes.empty())
 269                 return;
 270
 271         u32 blockchangecount = 0;
 272
 273         std::map<v3s16, u8> unlighted_nodes;
 274
 275         /*
 276                 Initialize block cache
 277         */
 278         v3s16 blockpos_last;
 279         MapBlock *block = NULL;
 280         // Cache this a bit, too
 281         bool block_checked_in_modified = false;
 282
 283         for(std::map<v3s16, u8>::iterator j = from_nodes.begin();
 284                 j != from_nodes.end(); ++j)
 285         {
 286                 v3s16 pos = j->first;
 287                 v3s16 blockpos = getNodeBlockPos(pos);
 288
 289                 // Only fetch a new block if the block position has changed
 290                 try{
 291                         if(block == NULL || blockpos != blockpos_last){
 292                                 block = getBlockNoCreate(blockpos);
 293                                 blockpos_last = blockpos;
 294
 295                                 block_checked_in_modified = false;
 296                                 blockchangecount++;
 297                         }
 298                 }
 299                 catch(InvalidPositionException &e)
 300                 {
 301                         continue;
 302                 }
 303
 304                 if(block->isDummy())
 305                         continue;
 306
 307                 // Calculate relative position in block
 308                 //v3s16 relpos = pos - blockpos_last * MAP_BLOCKSIZE;
 309
 310                 // Get node straight from the block
 311                 //MapNode n = block->getNode(relpos);
 312
 313                 u8 oldlight = j->second;
 314
 315                 // Loop through 6 neighbors
 316                 for(u16 i=0; i<6; i++)
 317                 {
 318                         // Get the position of the neighbor node
 319                         v3s16 n2pos = pos + dirs[i];
 320
 321                         // Get the block where the node is located
 322                         v3s16 blockpos, relpos;
 323                         getNodeBlockPosWithOffset(n2pos, blockpos, relpos);
 324
 325                         // Only fetch a new block if the block position has changed
 326                         try {
 327                                 if(block == NULL || blockpos != blockpos_last){
 328                                         block = getBlockNoCreate(blockpos);
 329                                         blockpos_last = blockpos;
 330
 331                                         block_checked_in_modified = false;
 332                                         blockchangecount++;
 333                                 }
 334                         }
 335                         catch(InvalidPositionException &e) {
 336                                 continue;
 337                         }
 338
 339                         // Get node straight from the block
 340                         bool is_valid_position;
 341                         MapNode n2 = block->getNode(relpos, &is_valid_position);
 342                         if (!is_valid_position)
 343                                 continue;
 344
 345                         bool changed = false;
 346
 347                         //TODO: Optimize output by optimizing light_sources?
 348
 349                         /*
 350                                 If the neighbor is dimmer than what was specified
 351                                 as oldlight (the light of the previous node)
 352                         */
 353                         if(n2.getLight(bank, nodemgr) < oldlight)
 354                         {
 355                                 /*
 356                                         And the neighbor is transparent and it has some light
 357                                 */
 358                                 if(nodemgr->get(n2).light_propagates
 359                                                 && n2.getLight(bank, nodemgr) != 0)
 360                                 {
 361                                         /*
 362                                                 Set light to 0 and add to queue
 363                                         */
 364
 365                                         u8 current_light = n2.getLight(bank, nodemgr);
 366                                         n2.setLight(bank, 0, nodemgr);
 367                                         block->setNode(relpos, n2);
 368
 369                                         unlighted_nodes[n2pos] = current_light;
 370                                         changed = true;
 371
 372                                         /*
 373                                                 Remove from light_sources if it is there
 374                                                 NOTE: This doesn't happen nearly at all
 375                                         */
 376                                         /*if(light_sources.find(n2pos))
 377                                         {
 378                                                 infostream<<"Removed from light_sources"<<std::endl;
 379                                                 light_sources.remove(n2pos);
 380                                         }*/
 381                                 }
 382
 383                                 /*// DEBUG
 384                                 if(light_sources.find(n2pos) != NULL)
 385                                         light_sources.remove(n2pos);*/
 386                         }
 387                         else{
 388                                 light_sources.insert(n2pos);
 389                         }
 390
 391                         // Add to modified_blocks
 392                         if(changed == true && block_checked_in_modified == false)
 393                         {
 394                                 // If the block is not found in modified_blocks, add.
 395                                 if(modified_blocks.find(blockpos) == modified_blocks.end())
 396                                 {
 397                                         modified_blocks[blockpos] = block;
 398                                 }
 399                                 block_checked_in_modified = true;
 400                         }
 401                 }
 402         }
 403
 404         /*infostream<<"unspreadLight(): Changed block "
 405         <<blockchangecount<<" times"
 406         <<" for "<<from_nodes.size()<<" nodes"
 407         <<std::endl;*/
 408
 409         if(!unlighted_nodes.empty())
 410                 unspreadLight(bank, unlighted_nodes, light_sources, modified_blocks);
 411 }
 412
 413 /*
 414         A single-node wrapper of the above
 415 */
 416 void Map::unLightNeighbors(enum LightBank bank,
 417                 v3s16 pos, u8 lightwas,
 418                 std::set<v3s16> & light_sources,
 419                 std::map<v3s16, MapBlock*>  & modified_blocks)
 420 {
 421         std::map<v3s16, u8> from_nodes;
 422         from_nodes[pos] = lightwas;
 423
 424         unspreadLight(bank, from_nodes, light_sources, modified_blocks);
 425 }
 426
 427 /*
 428         Lights neighbors of from_nodes, collects all them and then
 429         goes on recursively.
 430 */
 431 void Map::spreadLight(enum LightBank bank,
 432                 std::set<v3s16> & from_nodes,
 433                 std::map<v3s16, MapBlock*> & modified_blocks)
 434 {
 435         INodeDefManager *nodemgr = m_gamedef->ndef();
 436
 437         const v3s16 dirs[6] = {
 438                 v3s16(0,0,1), // back
 439                 v3s16(0,1,0), // top
 440                 v3s16(1,0,0), // right
 441                 v3s16(0,0,-1), // front
 442                 v3s16(0,-1,0), // bottom
 443                 v3s16(-1,0,0), // left
 444         };
 445
 446         if(from_nodes.empty())
 447                 return;
 448
 449         u32 blockchangecount = 0;
 450
 451         std::set<v3s16> lighted_nodes;
 452
 453         /*
 454                 Initialize block cache
 455         */
 456         v3s16 blockpos_last;
 457         MapBlock *block = NULL;
 458                 // Cache this a bit, too
 459         bool block_checked_in_modified = false;
 460
 461         for(std::set<v3s16>::iterator j = from_nodes.begin();
 462                 j != from_nodes.end(); ++j)
 463         {
 464                 v3s16 pos = *j;
 465                 v3s16 blockpos, relpos;
 466
 467                 getNodeBlockPosWithOffset(pos, blockpos, relpos);
 468
 469                 // Only fetch a new block if the block position has changed
 470                 try {
 471                         if(block == NULL || blockpos != blockpos_last){
 472                                 block = getBlockNoCreate(blockpos);
 473                                 blockpos_last = blockpos;
 474
 475                                 block_checked_in_modified = false;
 476                                 blockchangecount++;
 477                         }
 478                 }
 479                 catch(InvalidPositionException &e) {
 480                         continue;
 481                 }
 482
 483                 if(block->isDummy())
 484                         continue;
 485
 486                 // Get node straight from the block
 487                 bool is_valid_position;
 488                 MapNode n = block->getNode(relpos, &is_valid_position);
 489
 490                 u8 oldlight = is_valid_position ? n.getLight(bank, nodemgr) : 0;
 491                 u8 newlight = diminish_light(oldlight);
 492
 493                 // Loop through 6 neighbors
 494                 for(u16 i=0; i<6; i++){
 495                         // Get the position of the neighbor node
 496                         v3s16 n2pos = pos + dirs[i];
 497
 498                         // Get the block where the node is located
 499                         v3s16 blockpos, relpos;
 500                         getNodeBlockPosWithOffset(n2pos, blockpos, relpos);
 501
 502                         // Only fetch a new block if the block position has changed
 503                         try {
 504                                 if(block == NULL || blockpos != blockpos_last){
 505                                         block = getBlockNoCreate(blockpos);
 506                                         blockpos_last = blockpos;
 507
 508                                         block_checked_in_modified = false;
 509                                         blockchangecount++;
 510                                 }
 511                         }
 512                         catch(InvalidPositionException &e) {
 513                                 continue;
 514                         }
 515
 516                         // Get node straight from the block
 517                         MapNode n2 = block->getNode(relpos, &is_valid_position);
 518                         if (!is_valid_position)
 519                                 continue;
 520
 521                         bool changed = false;
 522                         /*
 523                                 If the neighbor is brighter than the current node,
 524                                 add to list (it will light up this node on its turn)
 525                         */
 526                         if(n2.getLight(bank, nodemgr) > undiminish_light(oldlight))
 527                         {
 528                                 lighted_nodes.insert(n2pos);
 529                                 changed = true;
 530                         }
 531                         /*
 532                                 If the neighbor is dimmer than how much light this node
 533                                 would spread on it, add to list
 534                         */
 535                         if(n2.getLight(bank, nodemgr) < newlight)
 536                         {
 537                                 if(nodemgr->get(n2).light_propagates)
 538                                 {
 539                                         n2.setLight(bank, newlight, nodemgr);
 540                                         block->setNode(relpos, n2);
 541                                         lighted_nodes.insert(n2pos);
 542                                         changed = true;
 543                                 }
 544                         }
 545
 546                         // Add to modified_blocks
 547                         if(changed == true && block_checked_in_modified == false)
 548                         {
 549                                 // If the block is not found in modified_blocks, add.
 550                                 if(modified_blocks.find(blockpos) == modified_blocks.end())
 551                                 {
 552                                         modified_blocks[blockpos] = block;
 553                                 }
 554                                 block_checked_in_modified = true;
 555                         }
 556                 }
 557         }
 558
 559         /*infostream<<"spreadLight(): Changed block "
 560                         <<blockchangecount<<" times"
 561                         <<" for "<<from_nodes.size()<<" nodes"
 562                         <<std::endl;*/
 563
 564         if(!lighted_nodes.empty())
 565                 spreadLight(bank, lighted_nodes, modified_blocks);
 566 }
 567
 568 /*
 569         A single-node source variation of the above.
 570 */
 571 void Map::lightNeighbors(enum LightBank bank,
 572                 v3s16 pos,
 573                 std::map<v3s16, MapBlock*> & modified_blocks)
 574 {
 575         std::set<v3s16> from_nodes;
 576         from_nodes.insert(pos);
 577         spreadLight(bank, from_nodes, modified_blocks);
 578 }
 579
 580 v3s16 Map::getBrightestNeighbour(enum LightBank bank, v3s16 p)
 581 {
 582         INodeDefManager *nodemgr = m_gamedef->ndef();
 583
 584         v3s16 dirs[6] = {
 585                 v3s16(0,0,1), // back
 586                 v3s16(0,1,0), // top
 587                 v3s16(1,0,0), // right
 588                 v3s16(0,0,-1), // front
 589                 v3s16(0,-1,0), // bottom
 590                 v3s16(-1,0,0), // left
 591         };
 592
 593         u8 brightest_light = 0;
 594         v3s16 brightest_pos(0,0,0);
 595         bool found_something = false;
 596
 597         // Loop through 6 neighbors
 598         for(u16 i=0; i<6; i++){
 599                 // Get the position of the neighbor node
 600                 v3s16 n2pos = p + dirs[i];
 601                 MapNode n2;
 602                 bool is_valid_position;
 603                 n2 = getNodeNoEx(n2pos, &is_valid_position);
 604                 if (!is_valid_position)
 605                         continue;
 606
 607                 if(n2.getLight(bank, nodemgr) > brightest_light || found_something == false){
 608                         brightest_light = n2.getLight(bank, nodemgr);
 609                         brightest_pos = n2pos;
 610                         found_something = true;
 611                 }
 612         }
 613
 614         if(found_something == false)
 615                 throw InvalidPositionException();
 616
 617         return brightest_pos;
 618 }
 619
 620 /*
 621         Propagates sunlight down from a node.
 622         Starting point gets sunlight.
 623
 624         Returns the lowest y value of where the sunlight went.
 625
 626         Mud is turned into grass in where the sunlight stops.
 627 */
 628 s16 Map::propagateSunlight(v3s16 start,
 629                 std::map<v3s16, MapBlock*> & modified_blocks)
 630 {
 631         INodeDefManager *nodemgr = m_gamedef->ndef();
 632
 633         s16 y = start.Y;
 634         for(; ; y--)
 635         {
 636                 v3s16 pos(start.X, y, start.Z);
 637
 638                 v3s16 blockpos = getNodeBlockPos(pos);
 639                 MapBlock *block;
 640                 try{
 641                         block = getBlockNoCreate(blockpos);
 642                 }
 643                 catch(InvalidPositionException &e)
 644                 {
 645                         break;
 646                 }
 647
 648                 v3s16 relpos = pos - blockpos*MAP_BLOCKSIZE;
 649                 bool is_valid_position;
 650                 MapNode n = block->getNode(relpos, &is_valid_position);
 651                 if (!is_valid_position)
 652                         break;
 653
 654                 if(nodemgr->get(n).sunlight_propagates)
 655                 {
 656                         n.setLight(LIGHTBANK_DAY, LIGHT_SUN, nodemgr);
 657                         block->setNode(relpos, n);
 658
 659                         modified_blocks[blockpos] = block;
 660                 }
 661                 else
 662                 {
 663                         // Sunlight goes no further
 664                         break;
 665                 }
 666         }
 667         return y + 1;
 668 }
 669
 670 void Map::updateLighting(enum LightBank bank,
 671                 std::map<v3s16, MapBlock*> & a_blocks,
 672                 std::map<v3s16, MapBlock*> & modified_blocks)
 673 {
 674         INodeDefManager *nodemgr = m_gamedef->ndef();
 675
 676         /*m_dout<<DTIME<<"Map::updateLighting(): "
 677                         <<a_blocks.size()<<" blocks."<<std::endl;*/
 678
 679         //TimeTaker timer("updateLighting");
 680
 681         // For debugging
 682         //bool debug=true;
 683         //u32 count_was = modified_blocks.size();
 684
 685         //std::map<v3s16, MapBlock*> blocks_to_update;
 686
 687         std::set<v3s16> light_sources;
 688
 689         std::map<v3s16, u8> unlight_from;
 690
 691         int num_bottom_invalid = 0;
 692
 693         {
 694         //TimeTaker t("first stuff");
 695
 696         for(std::map<v3s16, MapBlock*>::iterator i = a_blocks.begin();
 697                 i != a_blocks.end(); ++i)
 698         {
 699                 MapBlock *block = i->second;
 700
 701                 for(;;)
 702                 {
 703                         // Don't bother with dummy blocks.
 704                         if(block->isDummy())
 705                                 break;
 706
 707                         v3s16 pos = block->getPos();
 708                         v3s16 posnodes = block->getPosRelative();
 709                         modified_blocks[pos] = block;
 710                         //blocks_to_update[pos] = block;
 711
 712                         /*
 713                                 Clear all light from block
 714                         */
 715                         for(s16 z=0; z<MAP_BLOCKSIZE; z++)
 716                         for(s16 x=0; x<MAP_BLOCKSIZE; x++)
 717                         for(s16 y=0; y<MAP_BLOCKSIZE; y++)
 718                         {
 719                                 v3s16 p(x,y,z);
 720                                 bool is_valid_position;
 721                                 MapNode n = block->getNode(p, &is_valid_position);
 722                                 if (!is_valid_position) {
 723                                         /* This would happen when dealing with a
 724                                            dummy block.
 725                                         */
 726                                         infostream<<"updateLighting(): InvalidPositionException"
 727                                                         <<std::endl;
 728                                         continue;
 729                                 }
 730                                 u8 oldlight = n.getLight(bank, nodemgr);
 731                                 n.setLight(bank, 0, nodemgr);
 732                                 block->setNode(p, n);
 733
 734                                 // If node sources light, add to list
 735                                 u8 source = nodemgr->get(n).light_source;
 736                                 if(source != 0)
 737                                         light_sources.insert(p + posnodes);
 738
 739                                 // Collect borders for unlighting
 740                                 if((x==0 || x == MAP_BLOCKSIZE-1
 741                                                 || y==0 || y == MAP_BLOCKSIZE-1
 742                                                 || z==0 || z == MAP_BLOCKSIZE-1)
 743                                                 && oldlight != 0)
 744                                 {
 745                                         v3s16 p_map = p + posnodes;
 746                                         unlight_from[p_map] = oldlight;
 747                                 }
 748
 749
 750                         }
 751
 752                         if(bank == LIGHTBANK_DAY)
 753                         {
 754                                 bool bottom_valid = block->propagateSunlight(light_sources);
 755
 756                                 if(!bottom_valid)
 757                                         num_bottom_invalid++;
 758
 759                                 // If bottom is valid, we're done.
 760                                 if(bottom_valid)
 761                                         break;
 762                         }
 763                         else if(bank == LIGHTBANK_NIGHT)
 764                         {
 765                                 // For night lighting, sunlight is not propagated
 766                                 break;
 767                         }
 768                         else
 769                         {
 770                                 assert("Invalid lighting bank" == NULL);
 771                         }
 772
 773                         /*infostream<<"Bottom for sunlight-propagated block ("
 774                                         <<pos.X<<","<<pos.Y<<","<<pos.Z<<") not valid"
 775                                         <<std::endl;*/
 776
 777                         // Bottom sunlight is not valid; get the block and loop to it
 778
 779                         pos.Y--;
 780                         try{
 781                                 block = getBlockNoCreate(pos);
 782                         }
 783                         catch(InvalidPositionException &e)
 784                         {
 785                                 FATAL_ERROR("Invalid position");
 786                         }
 787
 788                 }
 789         }
 790
 791         }
 792
 793         /*
 794                 Enable this to disable proper lighting for speeding up map
 795                 generation for testing or whatever
 796         */
 797 #if 0
 798         //if(g_settings->get(""))
 799         {
 800                 core::map<v3s16, MapBlock*>::Iterator i;
 801                 i = blocks_to_update.getIterator();
 802                 for(; i.atEnd() == false; i++)
 803                 {
 804                         MapBlock *block = i.getNode()->getValue();
 805                         v3s16 p = block->getPos();
 806                         block->setLightingExpired(false);
 807                 }
 808                 return;
 809         }
 810 #endif
 811
 812 #if 1
 813         {
 814                 //TimeTaker timer("unspreadLight");
 815                 unspreadLight(bank, unlight_from, light_sources, modified_blocks);
 816         }
 817
 818         /*if(debug)
 819         {
 820                 u32 diff = modified_blocks.size() - count_was;
 821                 count_was = modified_blocks.size();
 822                 infostream<<"unspreadLight modified "<<diff<<std::endl;
 823         }*/
 824
 825         {
 826                 //TimeTaker timer("spreadLight");
 827                 spreadLight(bank, light_sources, modified_blocks);
 828         }
 829
 830         /*if(debug)
 831         {
 832                 u32 diff = modified_blocks.size() - count_was;
 833                 count_was = modified_blocks.size();
 834                 infostream<<"spreadLight modified "<<diff<<std::endl;
 835         }*/
 836 #endif
 837
 838 #if 0
 839         {
 840                 //MapVoxelManipulator vmanip(this);
 841
 842                 // Make a manual voxel manipulator and load all the blocks
 843                 // that touch the requested blocks
 844                 ManualMapVoxelManipulator vmanip(this);
 845
 846                 {
 847                 //TimeTaker timer("initialEmerge");
 848
 849                 core::map<v3s16, MapBlock*>::Iterator i;
 850                 i = blocks_to_update.getIterator();
 851                 for(; i.atEnd() == false; i++)
 852                 {
 853                         MapBlock *block = i.getNode()->getValue();
 854                         v3s16 p = block->getPos();
 855
 856                         // Add all surrounding blocks
 857                         vmanip.initialEmerge(p - v3s16(1,1,1), p + v3s16(1,1,1));
 858
 859                         /*
 860                                 Add all surrounding blocks that have up-to-date lighting
 861                                 NOTE: This doesn't quite do the job (not everything
 862                                           appropriate is lighted)
 863                         */
 864                         /*for(s16 z=-1; z<=1; z++)
 865                         for(s16 y=-1; y<=1; y++)
 866                         for(s16 x=-1; x<=1; x++)
 867                         {
 868                                 v3s16 p2 = p + v3s16(x,y,z);
 869                                 MapBlock *block = getBlockNoCreateNoEx(p2);
 870                                 if(block == NULL)
 871                                         continue;
 872                                 if(block->isDummy())
 873                                         continue;
 874                                 if(block->getLightingExpired())
 875                                         continue;
 876                                 vmanip.initialEmerge(p2, p2);
 877                         }*/
 878
 879                         // Lighting of block will be updated completely
 880                         block->setLightingExpired(false);
 881                 }
 882                 }
 883
 884                 {
 885                         //TimeTaker timer("unSpreadLight");
 886                         vmanip.unspreadLight(bank, unlight_from, light_sources, nodemgr);
 887                 }
 888                 {
 889                         //TimeTaker timer("spreadLight");
 890                         vmanip.spreadLight(bank, light_sources, nodemgr);
 891                 }
 892                 {
 893                         //TimeTaker timer("blitBack");
 894                         vmanip.blitBack(modified_blocks);
 895                 }
 896                 /*infostream<<"emerge_time="<<emerge_time<<std::endl;
 897                 emerge_time = 0;*/
 898         }
 899 #endif
 900
 901         //m_dout<<"Done ("<<getTimestamp()<<")"<<std::endl;
 902 }
 903
 904 void Map::updateLighting(std::map<v3s16, MapBlock*> & a_blocks,
 905                 std::map<v3s16, MapBlock*> & modified_blocks)
 906 {
 907         updateLighting(LIGHTBANK_DAY, a_blocks, modified_blocks);
 908         updateLighting(LIGHTBANK_NIGHT, a_blocks, modified_blocks);
 909
 910         /*
 911                 Update information about whether day and night light differ
 912         */
 913         for(std::map<v3s16, MapBlock*>::iterator
 914                         i = modified_blocks.begin();
 915                         i != modified_blocks.end(); ++i)
 916         {
 917                 MapBlock *block = i->second;
 918                 block->expireDayNightDiff();
 919         }
 920 }
 921
 922 /*
 923 */
 924 void Map::addNodeAndUpdate(v3s16 p, MapNode n,
 925                 std::map<v3s16, MapBlock*> &modified_blocks,
 926                 bool remove_metadata)
 927 {
 928         INodeDefManager *ndef = m_gamedef->ndef();
 929
 930         /*PrintInfo(m_dout);
 931         m_dout<<DTIME<<"Map::addNodeAndUpdate(): p=("
 932                         <<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
 933
 934         /*
 935                 From this node to nodes underneath:
 936                 If lighting is sunlight (1.0), unlight neighbours and
 937                 set lighting to 0.
 938                 Else discontinue.
 939         */
 940
 941         v3s16 toppos = p + v3s16(0,1,0);
 942         //v3s16 bottompos = p + v3s16(0,-1,0);
 943
 944         bool node_under_sunlight = true;
 945         std::set<v3s16> light_sources;
 946
 947         /*
 948                 Collect old node for rollback
 949         */
 950         RollbackNode rollback_oldnode(this, p, m_gamedef);
 951
 952         /*
 953                 If there is a node at top and it doesn't have sunlight,
 954                 there has not been any sunlight going down.
 955
 956                 Otherwise there probably is.
 957         */
 958
 959         bool is_valid_position;
 960         MapNode topnode = getNodeNoEx(toppos, &is_valid_position);
 961
 962         if(is_valid_position && topnode.getLight(LIGHTBANK_DAY, ndef) != LIGHT_SUN)
 963                 node_under_sunlight = false;
 964
 965         /*
 966                 Remove all light that has come out of this node
 967         */
 968
 969         enum LightBank banks[] =
 970         {
 971                 LIGHTBANK_DAY,
 972                 LIGHTBANK_NIGHT
 973         };
 974         for(s32 i=0; i<2; i++)
 975         {
 976                 enum LightBank bank = banks[i];
 977
 978                 u8 lightwas = getNodeNoEx(p).getLight(bank, ndef);
 979
 980                 // Add the block of the added node to modified_blocks
 981                 v3s16 blockpos = getNodeBlockPos(p);
 982                 MapBlock * block = getBlockNoCreate(blockpos);
 983                 assert(block != NULL);
 984                 modified_blocks[blockpos] = block;
 985
 986                 assert(isValidPosition(p));
 987
 988                 // Unlight neighbours of node.
 989                 // This means setting light of all consequent dimmer nodes
 990                 // to 0.
 991                 // This also collects the nodes at the border which will spread
 992                 // light again into this.
 993                 unLightNeighbors(bank, p, lightwas, light_sources, modified_blocks);
 994
 995                 n.setLight(bank, 0, ndef);
 996         }
 997
 998         /*
 999                 If node lets sunlight through and is under sunlight, it has
1000                 sunlight too.
1001         */
1002         if(node_under_sunlight && ndef->get(n).sunlight_propagates)
1003         {
1004                 n.setLight(LIGHTBANK_DAY, LIGHT_SUN, ndef);
1005         }
1006
1007         /*
1008                 Remove node metadata
1009         */
1010         if (remove_metadata) {
1011                 removeNodeMetadata(p);
1012         }
1013
1014         /*
1015                 Set the node on the map
1016         */
1017
1018         setNode(p, n);
1019
1020         /*
1021                 If node is under sunlight and doesn't let sunlight through,
1022                 take all sunlighted nodes under it and clear light from them
1023                 and from where the light has been spread.
1024                 TODO: This could be optimized by mass-unlighting instead
1025                           of looping
1026         */
1027         if(node_under_sunlight && !ndef->get(n).sunlight_propagates)
1028         {
1029                 s16 y = p.Y - 1;
1030                 for(;; y--){
1031                         //m_dout<<DTIME<<"y="<<y<<std::endl;
1032                         v3s16 n2pos(p.X, y, p.Z);
1033
1034                         MapNode n2;
1035
1036                         n2 = getNodeNoEx(n2pos, &is_valid_position);
1037                         if (!is_valid_position)
1038                                 break;
1039
1040                         if(n2.getLight(LIGHTBANK_DAY, ndef) == LIGHT_SUN)
1041                         {
1042                                 unLightNeighbors(LIGHTBANK_DAY,
1043                                                 n2pos, n2.getLight(LIGHTBANK_DAY, ndef),
1044                                                 light_sources, modified_blocks);
1045                                 n2.setLight(LIGHTBANK_DAY, 0, ndef);
1046                                 setNode(n2pos, n2);
1047                         }
1048                         else
1049                                 break;
1050                 }
1051         }
1052
1053         for(s32 i=0; i<2; i++)
1054         {
1055                 enum LightBank bank = banks[i];
1056
1057                 /*
1058                         Spread light from all nodes that might be capable of doing so
1059                 */
1060                 spreadLight(bank, light_sources, modified_blocks);
1061         }
1062
1063         /*
1064                 Update information about whether day and night light differ
1065         */
1066         for(std::map<v3s16, MapBlock*>::iterator
1067                         i = modified_blocks.begin();
1068                         i != modified_blocks.end(); ++i)
1069         {
1070                 i->second->expireDayNightDiff();
1071         }
1072
1073         /*
1074                 Report for rollback
1075         */
1076         if(m_gamedef->rollback())
1077         {
1078                 RollbackNode rollback_newnode(this, p, m_gamedef);
1079                 RollbackAction action;
1080                 action.setSetNode(p, rollback_oldnode, rollback_newnode);
1081                 m_gamedef->rollback()->reportAction(action);
1082         }
1083
1084         /*
1085                 Add neighboring liquid nodes and the node itself if it is
1086                 liquid (=water node was added) to transform queue.
1087         */
1088         v3s16 dirs[7] = {
1089                 v3s16(0,0,0), // self
1090                 v3s16(0,0,1), // back
1091                 v3s16(0,1,0), // top
1092                 v3s16(1,0,0), // right
1093                 v3s16(0,0,-1), // front
1094                 v3s16(0,-1,0), // bottom
1095                 v3s16(-1,0,0), // left
1096         };
1097         for(u16 i=0; i<7; i++)
1098         {
1099                 v3s16 p2 = p + dirs[i];
1100
1101                 MapNode n2 = getNodeNoEx(p2, &is_valid_position);
1102                 if(is_valid_position
1103                                 && (ndef->get(n2).isLiquid() || n2.getContent() == CONTENT_AIR))
1104                 {
1105                         m_transforming_liquid.push_back(p2);
1106                 }
1107         }
1108 }
1109
1110 /*
1111 */
1112 void Map::removeNodeAndUpdate(v3s16 p,
1113                 std::map<v3s16, MapBlock*> &modified_blocks)
1114 {
1115         INodeDefManager *ndef = m_gamedef->ndef();
1116
1117         /*PrintInfo(m_dout);
1118         m_dout<<DTIME<<"Map::removeNodeAndUpdate(): p=("
1119                         <<p.X<<","<<p.Y<<","<<p.Z<<")"<<std::endl;*/
1120
1121         bool node_under_sunlight = true;
1122
1123         v3s16 toppos = p + v3s16(0,1,0);
1124
1125         // Node will be replaced with this
1126         content_t replace_material = CONTENT_AIR;
1127
1128         /*
1129                 Collect old node for rollback
1130         */
1131         RollbackNode rollback_oldnode(this, p, m_gamedef);
1132
1133         /*
1134                 If there is a node at top and it doesn't have sunlight,
1135                 there will be no sunlight going down.
1136         */
1137         bool is_valid_position;
1138         MapNode topnode = getNodeNoEx(toppos, &is_valid_position);
1139
1140         if(is_valid_position && topnode.getLight(LIGHTBANK_DAY, ndef) != LIGHT_SUN)
1141                 node_under_sunlight = false;
1142
1143         std::set<v3s16> light_sources;
1144
1145         enum LightBank banks[] =
1146         {
1147                 LIGHTBANK_DAY,
1148                 LIGHTBANK_NIGHT
1149         };
1150         for(s32 i=0; i<2; i++)
1151         {
1152                 enum LightBank bank = banks[i];
1153
1154                 /*
1155                         Unlight neighbors (in case the node is a light source)
1156                 */
1157                 unLightNeighbors(bank, p,
1158                                 getNodeNoEx(p).getLight(bank, ndef),
1159                                 light_sources, modified_blocks);
1160         }
1161
1162         /*
1163                 Remove node metadata
1164         */
1165
1166         removeNodeMetadata(p);
1167
1168         /*
1169                 Remove the node.
1170                 This also clears the lighting.
1171         */
1172
1173         MapNode n(replace_material);
1174         setNode(p, n);
1175
1176         for(s32 i=0; i<2; i++)
1177         {
1178                 enum LightBank bank = banks[i];
1179
1180                 /*
1181                         Recalculate lighting
1182                 */
1183                 spreadLight(bank, light_sources, modified_blocks);
1184         }
1185
1186         // Add the block of the removed node to modified_blocks
1187         v3s16 blockpos = getNodeBlockPos(p);
1188         MapBlock * block = getBlockNoCreate(blockpos);
1189         assert(block != NULL);
1190         modified_blocks[blockpos] = block;
1191
1192         /*
1193                 If the removed node was under sunlight, propagate the
1194                 sunlight down from it and then light all neighbors
1195                 of the propagated blocks.
1196         */
1197         if(node_under_sunlight)
1198         {
1199                 s16 ybottom = propagateSunlight(p, modified_blocks);
1200                 /*m_dout<<DTIME<<"Node was under sunlight. "
1201                                 "Propagating sunlight";
1202                 m_dout<<DTIME<<" -> ybottom="<<ybottom<<std::endl;*/
1203                 s16 y = p.Y;
1204                 for(; y >= ybottom; y--)
1205                 {
1206                         v3s16 p2(p.X, y, p.Z);
1207                         /*m_dout<<DTIME<<"lighting neighbors of node ("
1208                                         <<p2.X<<","<<p2.Y<<","<<p2.Z<<")"
1209                                         <<std::endl;*/
1210                         lightNeighbors(LIGHTBANK_DAY, p2, modified_blocks);
1211                 }
1212         }
1213         else
1214         {
1215                 // Set the lighting of this node to 0
1216                 // TODO: Is this needed? Lighting is cleared up there already.
1217                 MapNode n = getNodeNoEx(p, &is_valid_position);
1218                 if (is_valid_position) {
1219                         n.setLight(LIGHTBANK_DAY, 0, ndef);
1220                         setNode(p, n);
1221                 } else {
1222                         FATAL_ERROR("Invalid position");
1223                 }
1224         }
1225
1226         for(s32 i=0; i<2; i++)
1227         {
1228                 enum LightBank bank = banks[i];
1229
1230                 // Get the brightest neighbour node and propagate light from it
1231                 v3s16 n2p = getBrightestNeighbour(bank, p);
1232                 try{
1233                         //MapNode n2 = getNode(n2p);
1234                         lightNeighbors(bank, n2p, modified_blocks);
1235                 }
1236                 catch(InvalidPositionException &e)
1237                 {
1238                 }
1239         }
1240
1241         /*
1242                 Update information about whether day and night light differ
1243         */
1244         for(std::map<v3s16, MapBlock*>::iterator
1245                         i = modified_blocks.begin();
1246                         i != modified_blocks.end(); ++i)
1247         {
1248                 i->second->expireDayNightDiff();
1249         }
1250
1251         /*
1252                 Report for rollback
1253         */
1254         if(m_gamedef->rollback())
1255         {
1256                 RollbackNode rollback_newnode(this, p, m_gamedef);
1257                 RollbackAction action;
1258                 action.setSetNode(p, rollback_oldnode, rollback_newnode);
1259                 m_gamedef->rollback()->reportAction(action);
1260         }
1261
1262         /*
1263                 Add neighboring liquid nodes and this node to transform queue.
1264                 (it's vital for the node itself to get updated last.)
1265         */
1266         v3s16 dirs[7] = {
1267                 v3s16(0,0,1), // back
1268                 v3s16(0,1,0), // top
1269                 v3s16(1,0,0), // right
1270                 v3s16(0,0,-1), // front
1271                 v3s16(0,-1,0), // bottom
1272                 v3s16(-1,0,0), // left
1273                 v3s16(0,0,0), // self
1274         };
1275         for(u16 i=0; i<7; i++)
1276         {
1277                 v3s16 p2 = p + dirs[i];
1278
1279                 bool is_position_valid;
1280                 MapNode n2 = getNodeNoEx(p2, &is_position_valid);
1281                 if (is_position_valid
1282                                 && (ndef->get(n2).isLiquid() || n2.getContent() == CONTENT_AIR))
1283                 {
1284                         m_transforming_liquid.push_back(p2);
1285                 }
1286         }
1287 }
1288
1289 bool Map::addNodeWithEvent(v3s16 p, MapNode n, bool remove_metadata)
1290 {
1291         MapEditEvent event;
1292         event.type = remove_metadata ? MEET_ADDNODE : MEET_SWAPNODE;
1293         event.p = p;
1294         event.n = n;
1295
1296         bool succeeded = true;
1297         try{
1298                 std::map<v3s16, MapBlock*> modified_blocks;
1299                 addNodeAndUpdate(p, n, modified_blocks, remove_metadata);
1300
1301                 // Copy modified_blocks to event
1302                 for(std::map<v3s16, MapBlock*>::iterator
1303                                 i = modified_blocks.begin();
1304                                 i != modified_blocks.end(); ++i)
1305                 {
1306                         event.modified_blocks.insert(i->first);
1307                 }
1308         }
1309         catch(InvalidPositionException &e){
1310                 succeeded = false;
1311         }
1312
1313         dispatchEvent(&event);
1314
1315         return succeeded;
1316 }
1317
1318 bool Map::removeNodeWithEvent(v3s16 p)
1319 {
1320         MapEditEvent event;
1321         event.type = MEET_REMOVENODE;
1322         event.p = p;
1323
1324         bool succeeded = true;
1325         try{
1326                 std::map<v3s16, MapBlock*> modified_blocks;
1327                 removeNodeAndUpdate(p, modified_blocks);
1328
1329                 // Copy modified_blocks to event
1330                 for(std::map<v3s16, MapBlock*>::iterator
1331                                 i = modified_blocks.begin();
1332                                 i != modified_blocks.end(); ++i)
1333                 {
1334                         event.modified_blocks.insert(i->first);
1335                 }
1336         }
1337         catch(InvalidPositionException &e){
1338                 succeeded = false;
1339         }
1340
1341         dispatchEvent(&event);
1342
1343         return succeeded;
1344 }
1345
1346 bool Map::getDayNightDiff(v3s16 blockpos)
1347 {
1348         try{
1349                 v3s16 p = blockpos + v3s16(0,0,0);
1350                 MapBlock *b = getBlockNoCreate(p);
1351                 if(b->getDayNightDiff())
1352                         return true;
1353         }
1354         catch(InvalidPositionException &e){}
1355         // Leading edges
1356         try{
1357                 v3s16 p = blockpos + v3s16(-1,0,0);
1358                 MapBlock *b = getBlockNoCreate(p);
1359                 if(b->getDayNightDiff())
1360                         return true;
1361         }
1362         catch(InvalidPositionException &e){}
1363         try{
1364                 v3s16 p = blockpos + v3s16(0,-1,0);
1365                 MapBlock *b = getBlockNoCreate(p);
1366                 if(b->getDayNightDiff())
1367                         return true;
1368         }
1369         catch(InvalidPositionException &e){}
1370         try{
1371                 v3s16 p = blockpos + v3s16(0,0,-1);
1372                 MapBlock *b = getBlockNoCreate(p);
1373                 if(b->getDayNightDiff())
1374                         return true;
1375         }
1376         catch(InvalidPositionException &e){}
1377         // Trailing edges
1378         try{
1379                 v3s16 p = blockpos + v3s16(1,0,0);
1380                 MapBlock *b = getBlockNoCreate(p);
1381                 if(b->getDayNightDiff())
1382                         return true;
1383         }
1384         catch(InvalidPositionException &e){}
1385         try{
1386                 v3s16 p = blockpos + v3s16(0,1,0);
1387                 MapBlock *b = getBlockNoCreate(p);
1388                 if(b->getDayNightDiff())
1389                         return true;
1390         }
1391         catch(InvalidPositionException &e){}
1392         try{
1393                 v3s16 p = blockpos + v3s16(0,0,1);
1394                 MapBlock *b = getBlockNoCreate(p);
1395                 if(b->getDayNightDiff())
1396                         return true;
1397         }
1398         catch(InvalidPositionException &e){}
1399
1400         return false;
1401 }
1402
1403 struct TimeOrderedMapBlock {
1404         MapSector *sect;
1405         MapBlock *block;
1406
1407         TimeOrderedMapBlock(MapSector *sect, MapBlock *block) :
1408                 sect(sect),
1409                 block(block)
1410         {}
1411
1412         bool operator<(const TimeOrderedMapBlock &b) const
1413         {
1414                 return block->getUsageTimer() < b.block->getUsageTimer();
1415         };
1416 };
1417
1418 /*
1419         Updates usage timers
1420 */
1421 void Map::timerUpdate(float dtime, float unload_timeout, u32 max_loaded_blocks,
1422                 std::vector<v3s16> *unloaded_blocks)
1423 {
1424         bool save_before_unloading = (mapType() == MAPTYPE_SERVER);
1425
1426         // Profile modified reasons
1427         Profiler modprofiler;
1428
1429         std::vector<v2s16> sector_deletion_queue;
1430         u32 deleted_blocks_count = 0;
1431         u32 saved_blocks_count = 0;
1432         u32 block_count_all = 0;
1433
1434         beginSave();
1435
1436         // If there is no practical limit, we spare creation of mapblock_queue
1437         if (max_loaded_blocks == (u32)-1) {
1438                 for (std::map<v2s16, MapSector*>::iterator si = m_sectors.begin();
1439                                 si != m_sectors.end(); ++si) {
1440                         MapSector *sector = si->second;
1441
1442                         bool all_blocks_deleted = true;
1443
1444                         MapBlockVect blocks;
1445                         sector->getBlocks(blocks);
1446
1447                         for (MapBlockVect::iterator i = blocks.begin();
1448                                         i != blocks.end(); ++i) {
1449                                 MapBlock *block = (*i);
1450
1451                                 block->incrementUsageTimer(dtime);
1452
1453                                 if (block->refGet() == 0
1454                                                 && block->getUsageTimer() > unload_timeout) {
1455                                         v3s16 p = block->getPos();
1456
1457                                         // Save if modified
1458                                         if (block->getModified() != MOD_STATE_CLEAN
1459                                                         && save_before_unloading) {
1460                                                 modprofiler.add(block->getModifiedReasonString(), 1);
1461                                                 if (!saveBlock(block))
1462                                                         continue;
1463                                                 saved_blocks_count++;
1464                                         }
1465
1466                                         // Delete from memory
1467                                         sector->deleteBlock(block);
1468
1469                                         if (unloaded_blocks)
1470                                                 unloaded_blocks->push_back(p);
1471
1472                                         deleted_blocks_count++;
1473                                 } else {
1474                                         all_blocks_deleted = false;
1475                                         block_count_all++;
1476                                 }
1477                         }
1478
1479                         if (all_blocks_deleted) {
1480                                 sector_deletion_queue.push_back(si->first);
1481                         }
1482                 }
1483         } else {
1484                 std::priority_queue<TimeOrderedMapBlock> mapblock_queue;
1485                 for (std::map<v2s16, MapSector*>::iterator si = m_sectors.begin();
1486                                 si != m_sectors.end(); ++si) {
1487                         MapSector *sector = si->second;
1488
1489                         MapBlockVect blocks;
1490                         sector->getBlocks(blocks);
1491
1492                         for(MapBlockVect::iterator i = blocks.begin();
1493                                         i != blocks.end(); ++i) {
1494                                 MapBlock *block = (*i);
1495
1496                                 block->incrementUsageTimer(dtime);
1497                                 mapblock_queue.push(TimeOrderedMapBlock(sector, block));
1498                         }
1499                 }
1500                 block_count_all = mapblock_queue.size();
1501                 // Delete old blocks, and blocks over the limit from the memory
1502                 while (!mapblock_queue.empty() && (mapblock_queue.size() > max_loaded_blocks
1503                                 || mapblock_queue.top().block->getUsageTimer() > unload_timeout)) {
1504                         TimeOrderedMapBlock b = mapblock_queue.top();
1505                         mapblock_queue.pop();
1506
1507                         MapBlock *block = b.block;
1508
1509                         if (block->refGet() != 0)
1510                                 continue;
1511
1512                         v3s16 p = block->getPos();
1513
1514                         // Save if modified
1515                         if (block->getModified() != MOD_STATE_CLEAN && save_before_unloading) {
1516                                 modprofiler.add(block->getModifiedReasonString(), 1);
1517                                 if (!saveBlock(block))
1518                                         continue;
1519                                 saved_blocks_count++;
1520                         }
1521
1522                         // Delete from memory
1523                         b.sect->deleteBlock(block);
1524
1525                         if (unloaded_blocks)
1526                                 unloaded_blocks->push_back(p);
1527
1528                         deleted_blocks_count++;
1529                         block_count_all--;
1530                 }
1531                 // Delete empty sectors
1532                 for (std::map<v2s16, MapSector*>::iterator si = m_sectors.begin();
1533                         si != m_sectors.end(); ++si) {
1534                         if (si->second->empty()) {
1535                                 sector_deletion_queue.push_back(si->first);
1536                         }
1537                 }
1538         }
1539         endSave();
1540
1541         // Finally delete the empty sectors
1542         deleteSectors(sector_deletion_queue);
1543
1544         if(deleted_blocks_count != 0)
1545         {
1546                 PrintInfo(infostream); // ServerMap/ClientMap:
1547                 infostream<<"Unloaded "<<deleted_blocks_count
1548                                 <<" blocks from memory";
1549                 if(save_before_unloading)
1550                         infostream<<", of which "<<saved_blocks_count<<" were written";
1551                 infostream<<", "<<block_count_all<<" blocks in memory";
1552                 infostream<<"."<<std::endl;
1553                 if(saved_blocks_count != 0){
1554                         PrintInfo(infostream); // ServerMap/ClientMap:
1555                         infostream<<"Blocks modified by: "<<std::endl;
1556                         modprofiler.print(infostream);
1557                 }
1558         }
1559 }
1560
1561 void Map::unloadUnreferencedBlocks(std::vector<v3s16> *unloaded_blocks)
1562 {
1563         timerUpdate(0.0, -1.0, 0, unloaded_blocks);
1564 }
1565
1566 void Map::deleteSectors(std::vector<v2s16> &sectorList)
1567 {
1568         for(std::vector<v2s16>::iterator j = sectorList.begin();
1569                 j != sectorList.end(); ++j) {
1570                 MapSector *sector = m_sectors[*j];
1571                 // If sector is in sector cache, remove it from there
1572                 if(m_sector_cache == sector)
1573                         m_sector_cache = NULL;
1574                 // Remove from map and delete
1575                 m_sectors.erase(*j);
1576                 delete sector;
1577         }
1578 }
1579
1580 void Map::PrintInfo(std::ostream &out)
1581 {
1582         out<<"Map: ";
1583 }
1584
1585 #define WATER_DROP_BOOST 4
1586
1587 enum NeighborType {
1588         NEIGHBOR_UPPER,
1589         NEIGHBOR_SAME_LEVEL,
1590         NEIGHBOR_LOWER
1591 };
1592 struct NodeNeighbor {
1593         MapNode n;
1594         NeighborType t;
1595         v3s16 p;
1596         bool l; //can liquid
1597
1598         NodeNeighbor()
1599                 : n(CONTENT_AIR)
1600         { }
1601
1602         NodeNeighbor(const MapNode &node, NeighborType n_type, v3s16 pos)
1603                 : n(node),
1604                   t(n_type),
1605                   p(pos)
1606         { }
1607 };
1608
1609 void Map::transforming_liquid_add(v3s16 p) {
1610         m_transforming_liquid.push_back(p);
1611 }
1612
1613 s32 Map::transforming_liquid_size() {
1614         return m_transforming_liquid.size();
1615 }
1616
1617 void Map::transformLiquids(std::map<v3s16, MapBlock*> & modified_blocks)
1618 {
1619
1620         INodeDefManager *nodemgr = m_gamedef->ndef();
1621
1622         DSTACK(__FUNCTION_NAME);
1623         //TimeTaker timer("transformLiquids()");
1624
1625         u32 loopcount = 0;
1626         u32 initial_size = m_transforming_liquid.size();
1627
1628         /*if(initial_size != 0)
1629                 infostream<<"transformLiquids(): initial_size="<<initial_size<<std::endl;*/
1630
1631         // list of nodes that due to viscosity have not reached their max level height
1632         std::deque<v3s16> must_reflow;
1633
1634         // List of MapBlocks that will require a lighting update (due to lava)
1635         std::map<v3s16, MapBlock*> lighting_modified_blocks;
1636
1637         u32 liquid_loop_max = g_settings->getS32("liquid_loop_max");
1638         u32 loop_max = liquid_loop_max;
1639
1640 #if 0
1641
1642         /* If liquid_loop_max is not keeping up with the queue size increase
1643          * loop_max up to a maximum of liquid_loop_max * dedicated_server_step.
1644          */
1645         if (m_transforming_liquid.size() > loop_max * 2) {
1646                 // "Burst" mode
1647                 float server_step = g_settings->getFloat("dedicated_server_step");
1648                 if (m_transforming_liquid_loop_count_multiplier - 1.0 < server_step)
1649                         m_transforming_liquid_loop_count_multiplier *= 1.0 + server_step / 10;
1650         } else {
1651                 m_transforming_liquid_loop_count_multiplier = 1.0;
1652         }
1653
1654         loop_max *= m_transforming_liquid_loop_count_multiplier;
1655 #endif
1656
1657         while(m_transforming_liquid.size() != 0)
1658         {
1659                 // This should be done here so that it is done when continue is used
1660                 if(loopcount >= initial_size || loopcount >= loop_max)
1661                         break;
1662                 loopcount++;
1663
1664                 /*
1665                         Get a queued transforming liquid node
1666                 */
1667                 v3s16 p0 = m_transforming_liquid.front();
1668                 m_transforming_liquid.pop_front();
1669
1670                 MapNode n0 = getNodeNoEx(p0);
1671
1672                 /*
1673                         Collect information about current node
1674                  */
1675                 s8 liquid_level = -1;
1676                 content_t liquid_kind = CONTENT_IGNORE;
1677                 LiquidType liquid_type = nodemgr->get(n0).liquid_type;
1678                 switch (liquid_type) {
1679                         case LIQUID_SOURCE:
1680                                 liquid_level = LIQUID_LEVEL_SOURCE;
1681                                 liquid_kind = nodemgr->getId(nodemgr->get(n0).liquid_alternative_flowing);
1682                                 break;
1683                         case LIQUID_FLOWING:
1684                                 liquid_level = (n0.param2 & LIQUID_LEVEL_MASK);
1685                                 liquid_kind = n0.getContent();
1686                                 break;
1687                         case LIQUID_NONE:
1688                                 // if this is an air node, it *could* be transformed into a liquid. otherwise,
1689                                 // continue with the next node.
1690                                 if (n0.getContent() != CONTENT_AIR)
1691                                         continue;
1692                                 liquid_kind = CONTENT_AIR;
1693                                 break;
1694                 }
1695
1696                 /*
1697                         Collect information about the environment
1698                  */
1699                 const v3s16 *dirs = g_6dirs;
1700                 NodeNeighbor sources[6]; // surrounding sources
1701                 int num_sources = 0;
1702                 NodeNeighbor flows[6]; // surrounding flowing liquid nodes
1703                 int num_flows = 0;
1704                 NodeNeighbor airs[6]; // surrounding air
1705                 int num_airs = 0;
1706                 NodeNeighbor neutrals[6]; // nodes that are solid or another kind of liquid
1707                 int num_neutrals = 0;
1708                 bool flowing_down = false;
1709                 for (u16 i = 0; i < 6; i++) {
1710                         NeighborType nt = NEIGHBOR_SAME_LEVEL;
1711                         switch (i) {
1712                                 case 1:
1713                                         nt = NEIGHBOR_UPPER;
1714                                         break;
1715                                 case 4:
1716                                         nt = NEIGHBOR_LOWER;
1717                                         break;
1718                         }
1719                         v3s16 npos = p0 + dirs[i];
1720                         NodeNeighbor nb(getNodeNoEx(npos), nt, npos);
1721                         switch (nodemgr->get(nb.n.getContent()).liquid_type) {
1722                                 case LIQUID_NONE:
1723                                         if (nb.n.getContent() == CONTENT_AIR) {
1724                                                 airs[num_airs++] = nb;
1725                                                 // if the current node is a water source the neighbor
1726                                                 // should be enqueded for transformation regardless of whether the
1727                                                 // current node changes or not.
1728                                                 if (nb.t != NEIGHBOR_UPPER && liquid_type != LIQUID_NONE)
1729                                                         m_transforming_liquid.push_back(npos);
1730                                                 // if the current node happens to be a flowing node, it will start to flow down here.
1731                                                 if (nb.t == NEIGHBOR_LOWER) {
1732                                                         flowing_down = true;
1733                                                 }
1734                                         } else {
1735                                                 neutrals[num_neutrals++] = nb;
1736                                         }
1737                                         break;
1738                                 case LIQUID_SOURCE:
1739                                         // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1740                                         if (liquid_kind == CONTENT_AIR)
1741                                                 liquid_kind = nodemgr->getId(nodemgr->get(nb.n).liquid_alternative_flowing);
1742                                         if (nodemgr->getId(nodemgr->get(nb.n).liquid_alternative_flowing) != liquid_kind) {
1743                                                 neutrals[num_neutrals++] = nb;
1744                                         } else {
1745                                                 // Do not count bottom source, it will screw things up
1746                                                 if(dirs[i].Y != -1)
1747                                                         sources[num_sources++] = nb;
1748                                         }
1749                                         break;
1750                                 case LIQUID_FLOWING:
1751                                         // if this node is not (yet) of a liquid type, choose the first liquid type we encounter
1752                                         if (liquid_kind == CONTENT_AIR)
1753                                                 liquid_kind = nodemgr->getId(nodemgr->get(nb.n).liquid_alternative_flowing);
1754                                         if (nodemgr->getId(nodemgr->get(nb.n).liquid_alternative_flowing) != liquid_kind) {
1755                                                 neutrals[num_neutrals++] = nb;
1756                                         } else {
1757                                                 flows[num_flows++] = nb;
1758                                                 if (nb.t == NEIGHBOR_LOWER)
1759                                                         flowing_down = true;
1760                                         }
1761                                         break;
1762                         }
1763                 }
1764
1765                 /*
1766                         decide on the type (and possibly level) of the current node
1767                  */
1768                 content_t new_node_content;
1769                 s8 new_node_level = -1;
1770                 s8 max_node_level = -1;
1771
1772                 u8 range = nodemgr->get(liquid_kind).liquid_range;
1773                 if (range > LIQUID_LEVEL_MAX+1)
1774                         range = LIQUID_LEVEL_MAX+1;
1775
1776                 if ((num_sources >= 2 && nodemgr->get(liquid_kind).liquid_renewable) || liquid_type == LIQUID_SOURCE) {
1777                         // liquid_kind will be set to either the flowing alternative of the node (if it's a liquid)
1778                         // or the flowing alternative of the first of the surrounding sources (if it's air), so
1779                         // it's perfectly safe to use liquid_kind here to determine the new node content.
1780                         new_node_content = nodemgr->getId(nodemgr->get(liquid_kind).liquid_alternative_source);
1781                 } else if (num_sources >= 1 && sources[0].t != NEIGHBOR_LOWER) {
1782                         // liquid_kind is set properly, see above
1783                         new_node_content = liquid_kind;
1784                         max_node_level = new_node_level = LIQUID_LEVEL_MAX;
1785                         if (new_node_level < (LIQUID_LEVEL_MAX+1-range))
1786                                 new_node_content = CONTENT_AIR;
1787                 } else {
1788                         // no surrounding sources, so get the maximum level that can flow into this node
1789                         for (u16 i = 0; i < num_flows; i++) {
1790                                 u8 nb_liquid_level = (flows[i].n.param2 & LIQUID_LEVEL_MASK);
1791                                 switch (flows[i].t) {
1792                                         case NEIGHBOR_UPPER:
1793                                                 if (nb_liquid_level + WATER_DROP_BOOST > max_node_level) {
1794                                                         max_node_level = LIQUID_LEVEL_MAX;
1795                                                         if (nb_liquid_level + WATER_DROP_BOOST < LIQUID_LEVEL_MAX)
1796                                                                 max_node_level = nb_liquid_level + WATER_DROP_BOOST;
1797                                                 } else if (nb_liquid_level > max_node_level)
1798                                                         max_node_level = nb_liquid_level;
1799                                                 break;
1800                                         case NEIGHBOR_LOWER:
1801                                                 break;
1802                                         case NEIGHBOR_SAME_LEVEL:
1803                                                 if ((flows[i].n.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK &&
1804                                                         nb_liquid_level > 0 && nb_liquid_level - 1 > max_node_level) {
1805                                                         max_node_level = nb_liquid_level - 1;
1806                                                 }
1807                                                 break;
1808                                 }
1809                         }
1810
1811                         u8 viscosity = nodemgr->get(liquid_kind).liquid_viscosity;
1812                         if (viscosity > 1 && max_node_level != liquid_level) {
1813                                 // amount to gain, limited by viscosity
1814                                 // must be at least 1 in absolute value
1815                                 s8 level_inc = max_node_level - liquid_level;
1816                                 if (level_inc < -viscosity || level_inc > viscosity)
1817                                         new_node_level = liquid_level + level_inc/viscosity;
1818                                 else if (level_inc < 0)
1819                                         new_node_level = liquid_level - 1;
1820                                 else if (level_inc > 0)
1821                                         new_node_level = liquid_level + 1;
1822                                 if (new_node_level != max_node_level)
1823                                         must_reflow.push_back(p0);
1824                         } else
1825                                 new_node_level = max_node_level;
1826
1827                         if (max_node_level >= (LIQUID_LEVEL_MAX+1-range))
1828                                 new_node_content = liquid_kind;
1829                         else
1830                                 new_node_content = CONTENT_AIR;
1831
1832                 }
1833
1834                 /*
1835                         check if anything has changed. if not, just continue with the next node.
1836                  */
1837                 if (new_node_content == n0.getContent() && (nodemgr->get(n0.getContent()).liquid_type != LIQUID_FLOWING ||
1838                                                                                  ((n0.param2 & LIQUID_LEVEL_MASK) == (u8)new_node_level &&
1839                                                                                  ((n0.param2 & LIQUID_FLOW_DOWN_MASK) == LIQUID_FLOW_DOWN_MASK)
1840                                                                                  == flowing_down)))
1841                         continue;
1842
1843
1844                 /*
1845                         update the current node
1846                  */
1847                 MapNode n00 = n0;
1848                 //bool flow_down_enabled = (flowing_down && ((n0.param2 & LIQUID_FLOW_DOWN_MASK) != LIQUID_FLOW_DOWN_MASK));
1849                 if (nodemgr->get(new_node_content).liquid_type == LIQUID_FLOWING) {
1850                         // set level to last 3 bits, flowing down bit to 4th bit
1851                         n0.param2 = (flowing_down ? LIQUID_FLOW_DOWN_MASK : 0x00) | (new_node_level & LIQUID_LEVEL_MASK);
1852                 } else {
1853                         // set the liquid level and flow bit to 0
1854                         n0.param2 = ~(LIQUID_LEVEL_MASK | LIQUID_FLOW_DOWN_MASK);
1855                 }
1856                 n0.setContent(new_node_content);
1857
1858                 // Find out whether there is a suspect for this action
1859                 std::string suspect;
1860                 if(m_gamedef->rollback()) {
1861                         suspect = m_gamedef->rollback()->getSuspect(p0, 83, 1);
1862                 }
1863
1864                 if(m_gamedef->rollback() && !suspect.empty()){
1865                         // Blame suspect
1866                         RollbackScopeActor rollback_scope(m_gamedef->rollback(), suspect, true);
1867                         // Get old node for rollback
1868                         RollbackNode rollback_oldnode(this, p0, m_gamedef);
1869                         // Set node
1870                         setNode(p0, n0);
1871                         // Report
1872                         RollbackNode rollback_newnode(this, p0, m_gamedef);
1873                         RollbackAction action;
1874                         action.setSetNode(p0, rollback_oldnode, rollback_newnode);
1875                         m_gamedef->rollback()->reportAction(action);
1876                 } else {
1877                         // Set node
1878                         setNode(p0, n0);
1879                 }
1880
1881                 v3s16 blockpos = getNodeBlockPos(p0);
1882                 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1883                 if(block != NULL) {
1884                         modified_blocks[blockpos] =  block;
1885                         // If new or old node emits light, MapBlock requires lighting update
1886                         if(nodemgr->get(n0).light_source != 0 ||
1887                                         nodemgr->get(n00).light_source != 0)
1888                                 lighting_modified_blocks[block->getPos()] = block;
1889                 }
1890
1891                 /*
1892                         enqueue neighbors for update if neccessary
1893                  */
1894                 switch (nodemgr->get(n0.getContent()).liquid_type) {
1895                         case LIQUID_SOURCE:
1896                         case LIQUID_FLOWING:
1897                                 // make sure source flows into all neighboring nodes
1898                                 for (u16 i = 0; i < num_flows; i++)
1899                                         if (flows[i].t != NEIGHBOR_UPPER)
1900                                                 m_transforming_liquid.push_back(flows[i].p);
1901                                 for (u16 i = 0; i < num_airs; i++)
1902                                         if (airs[i].t != NEIGHBOR_UPPER)
1903                                                 m_transforming_liquid.push_back(airs[i].p);
1904                                 break;
1905                         case LIQUID_NONE:
1906                                 // this flow has turned to air; neighboring flows might need to do the same
1907                                 for (u16 i = 0; i < num_flows; i++)
1908                                         m_transforming_liquid.push_back(flows[i].p);
1909                                 break;
1910                 }
1911         }
1912         //infostream<<"Map::transformLiquids(): loopcount="<<loopcount<<std::endl;
1913
1914         for (std::deque<v3s16>::iterator iter = must_reflow.begin(); iter != must_reflow.end(); ++iter)
1915                 m_transforming_liquid.push_back(*iter);
1916
1917         updateLighting(lighting_modified_blocks, modified_blocks);
1918
1919
1920         /* ----------------------------------------------------------------------
1921          * Manage the queue so that it does not grow indefinately
1922          */
1923         u16 time_until_purge = g_settings->getU16("liquid_queue_purge_time");
1924
1925         if (time_until_purge == 0)
1926                 return; // Feature disabled
1927
1928         time_until_purge *= 1000;       // seconds -> milliseconds
1929
1930         u32 curr_time = getTime(PRECISION_MILLI);
1931         u32 prev_unprocessed = m_unprocessed_count;
1932         m_unprocessed_count = m_transforming_liquid.size();
1933
1934         // if unprocessed block count is decreasing or stable
1935         if (m_unprocessed_count <= prev_unprocessed) {
1936                 m_queue_size_timer_started = false;
1937         } else {
1938                 if (!m_queue_size_timer_started)
1939                         m_inc_trending_up_start_time = curr_time;
1940                 m_queue_size_timer_started = true;
1941         }
1942
1943         // Account for curr_time overflowing
1944         if (m_queue_size_timer_started && m_inc_trending_up_start_time > curr_time)
1945                 m_queue_size_timer_started = false;
1946
1947         /* If the queue has been growing for more than liquid_queue_purge_time seconds
1948          * and the number of unprocessed blocks is still > liquid_loop_max then we
1949          * cannot keep up; dump the oldest blocks from the queue so that the queue
1950          * has liquid_loop_max items in it
1951          */
1952         if (m_queue_size_timer_started
1953                         && curr_time - m_inc_trending_up_start_time > time_until_purge
1954                         && m_unprocessed_count > liquid_loop_max) {
1955
1956                 size_t dump_qty = m_unprocessed_count - liquid_loop_max;
1957
1958                 infostream << "transformLiquids(): DUMPING " << dump_qty
1959                            << " blocks from the queue" << std::endl;
1960
1961                 while (dump_qty--)
1962                         m_transforming_liquid.pop_front();
1963
1964                 m_queue_size_timer_started = false; // optimistically assume we can keep up now
1965                 m_unprocessed_count = m_transforming_liquid.size();
1966         }
1967 }
1968
1969 std::vector<v3s16> Map::findNodesWithMetadata(v3s16 p1, v3s16 p2)
1970 {
1971         std::vector<v3s16> positions_with_meta;
1972
1973         sortBoxVerticies(p1, p2);
1974         v3s16 bpmin = getNodeBlockPos(p1);
1975         v3s16 bpmax = getNodeBlockPos(p2);
1976
1977         VoxelArea area(p1, p2);
1978
1979         for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
1980         for (s16 y = bpmin.Y; y <= bpmax.Y; y++)
1981         for (s16 x = bpmin.X; x <= bpmax.X; x++) {
1982                 v3s16 blockpos(x, y, z);
1983
1984                 MapBlock *block = getBlockNoCreateNoEx(blockpos);
1985                 if (!block) {
1986                         verbosestream << "Map::getNodeMetadata(): Need to emerge "
1987                                 << PP(blockpos) << std::endl;
1988                         block = emergeBlock(blockpos, false);
1989                 }
1990                 if (!block) {
1991                         infostream << "WARNING: Map::getNodeMetadata(): Block not found"
1992                                 << std::endl;
1993                         continue;
1994                 }
1995
1996                 v3s16 p_base = blockpos * MAP_BLOCKSIZE;
1997                 std::vector<v3s16> keys = block->m_node_metadata.getAllKeys();
1998                 for (size_t i = 0; i != keys.size(); i++) {
1999                         v3s16 p(keys[i] + p_base);
2000                         if (!area.contains(p))
2001                                 continue;
2002
2003                         positions_with_meta.push_back(p);
2004                 }
2005         }
2006
2007         return positions_with_meta;
2008 }
2009
2010 NodeMetadata *Map::getNodeMetadata(v3s16 p)
2011 {
2012         v3s16 blockpos = getNodeBlockPos(p);
2013         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
2014         MapBlock *block = getBlockNoCreateNoEx(blockpos);
2015         if(!block){
2016                 infostream<<"Map::getNodeMetadata(): Need to emerge "
2017                                 <<PP(blockpos)<<std::endl;
2018                 block = emergeBlock(blockpos, false);
2019         }
2020         if(!block){
2021                 infostream<<"WARNING: Map::getNodeMetadata(): Block not found"
2022                                 <<std::endl;
2023                 return NULL;
2024         }
2025         NodeMetadata *meta = block->m_node_metadata.get(p_rel);
2026         return meta;
2027 }
2028
2029 bool Map::setNodeMetadata(v3s16 p, NodeMetadata *meta)
2030 {
2031         v3s16 blockpos = getNodeBlockPos(p);
2032         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
2033         MapBlock *block = getBlockNoCreateNoEx(blockpos);
2034         if(!block){
2035                 infostream<<"Map::setNodeMetadata(): Need to emerge "
2036                                 <<PP(blockpos)<<std::endl;
2037                 block = emergeBlock(blockpos, false);
2038         }
2039         if(!block){
2040                 infostream<<"WARNING: Map::setNodeMetadata(): Block not found"
2041                                 <<std::endl;
2042                 return false;
2043         }
2044         block->m_node_metadata.set(p_rel, meta);
2045         return true;
2046 }
2047
2048 void Map::removeNodeMetadata(v3s16 p)
2049 {
2050         v3s16 blockpos = getNodeBlockPos(p);
2051         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
2052         MapBlock *block = getBlockNoCreateNoEx(blockpos);
2053         if(block == NULL)
2054         {
2055                 infostream<<"WARNING: Map::removeNodeMetadata(): Block not found"
2056                                 <<std::endl;
2057                 return;
2058         }
2059         block->m_node_metadata.remove(p_rel);
2060 }
2061
2062 NodeTimer Map::getNodeTimer(v3s16 p)
2063 {
2064         v3s16 blockpos = getNodeBlockPos(p);
2065         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
2066         MapBlock *block = getBlockNoCreateNoEx(blockpos);
2067         if(!block){
2068                 infostream<<"Map::getNodeTimer(): Need to emerge "
2069                                 <<PP(blockpos)<<std::endl;
2070                 block = emergeBlock(blockpos, false);
2071         }
2072         if(!block){
2073                 infostream<<"WARNING: Map::getNodeTimer(): Block not found"
2074                                 <<std::endl;
2075                 return NodeTimer();
2076         }
2077         NodeTimer t = block->m_node_timers.get(p_rel);
2078         return t;
2079 }
2080
2081 void Map::setNodeTimer(v3s16 p, NodeTimer t)
2082 {
2083         v3s16 blockpos = getNodeBlockPos(p);
2084         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
2085         MapBlock *block = getBlockNoCreateNoEx(blockpos);
2086         if(!block){
2087                 infostream<<"Map::setNodeTimer(): Need to emerge "
2088                                 <<PP(blockpos)<<std::endl;
2089                 block = emergeBlock(blockpos, false);
2090         }
2091         if(!block){
2092                 infostream<<"WARNING: Map::setNodeTimer(): Block not found"
2093                                 <<std::endl;
2094                 return;
2095         }
2096         block->m_node_timers.set(p_rel, t);
2097 }
2098
2099 void Map::removeNodeTimer(v3s16 p)
2100 {
2101         v3s16 blockpos = getNodeBlockPos(p);
2102         v3s16 p_rel = p - blockpos*MAP_BLOCKSIZE;
2103         MapBlock *block = getBlockNoCreateNoEx(blockpos);
2104         if(block == NULL)
2105         {
2106                 infostream<<"WARNING: Map::removeNodeTimer(): Block not found"
2107                                 <<std::endl;
2108                 return;
2109         }
2110         block->m_node_timers.remove(p_rel);
2111 }
2112
2113 /*
2114         ServerMap
2115 */
2116 ServerMap::ServerMap(std::string savedir, IGameDef *gamedef, EmergeManager *emerge):
2117         Map(dout_server, gamedef),
2118         m_emerge(emerge),
2119         m_map_metadata_changed(true)
2120 {
2121         verbosestream<<__FUNCTION_NAME<<std::endl;
2122
2123         /*
2124                 Try to load map; if not found, create a new one.
2125         */
2126
2127         // Determine which database backend to use
2128         std::string conf_path = savedir + DIR_DELIM + "world.mt";
2129         Settings conf;
2130         bool succeeded = conf.readConfigFile(conf_path.c_str());
2131         if (!succeeded || !conf.exists("backend")) {
2132                 // fall back to sqlite3
2133                 conf.set("backend", "sqlite3");
2134         }
2135         std::string backend = conf.get("backend");
2136         dbase = createDatabase(backend, savedir, conf);
2137
2138         if (!conf.updateConfigFile(conf_path.c_str()))
2139                 errorstream << "ServerMap::ServerMap(): Failed to update world.mt!" << std::endl;
2140
2141         m_savedir = savedir;
2142         m_map_saving_enabled = false;
2143
2144         try
2145         {
2146                 // If directory exists, check contents and load if possible
2147                 if(fs::PathExists(m_savedir))
2148                 {
2149                         // If directory is empty, it is safe to save into it.
2150                         if(fs::GetDirListing(m_savedir).size() == 0)
2151                         {
2152                                 infostream<<"ServerMap: Empty save directory is valid."
2153                                                 <<std::endl;
2154                                 m_map_saving_enabled = true;
2155                         }
2156                         else
2157                         {
2158                                 try{
2159                                         // Load map metadata (seed, chunksize)
2160                                         loadMapMeta();
2161                                 }
2162                                 catch(SettingNotFoundException &e){
2163                                         infostream<<"ServerMap:  Some metadata not found."
2164                                                           <<" Using default settings."<<std::endl;
2165                                 }
2166                                 catch(FileNotGoodException &e){
2167                                         infostream<<"WARNING: Could not load map metadata"
2168                                                         //<<" Disabling chunk-based generator."
2169                                                         <<std::endl;
2170                                         //m_chunksize = 0;
2171                                 }
2172
2173                                 infostream<<"ServerMap: Successfully loaded map "
2174                                                 <<"metadata from "<<savedir
2175                                                 <<", assuming valid save directory."
2176                                                 <<" seed="<< m_emerge->params.seed <<"."
2177                                                 <<std::endl;
2178
2179                                 m_map_saving_enabled = true;
2180                                 // Map loaded, not creating new one
2181                                 return;
2182                         }
2183                 }
2184                 // If directory doesn't exist, it is safe to save to it
2185                 else{
2186                         m_map_saving_enabled = true;
2187                 }
2188         }
2189         catch(std::exception &e)
2190         {
2191                 infostream<<"WARNING: ServerMap: Failed to load map from "<<savedir
2192                                 <<", exception: "<<e.what()<<std::endl;
2193                 infostream<<"Please remove the map or fix it."<<std::endl;
2194                 infostream<<"WARNING: Map saving will be disabled."<<std::endl;
2195         }
2196
2197         infostream<<"Initializing new map."<<std::endl;
2198
2199         // Create zero sector
2200         emergeSector(v2s16(0,0));
2201
2202         // Initially write whole map
2203         save(MOD_STATE_CLEAN);
2204 }
2205
2206 ServerMap::~ServerMap()
2207 {
2208         verbosestream<<__FUNCTION_NAME<<std::endl;
2209
2210         try
2211         {
2212                 if(m_map_saving_enabled)
2213                 {
2214                         // Save only changed parts
2215                         save(MOD_STATE_WRITE_AT_UNLOAD);
2216                         infostream<<"ServerMap: Saved map to "<<m_savedir<<std::endl;
2217                 }
2218                 else
2219                 {
2220                         infostream<<"ServerMap: Map not saved"<<std::endl;
2221                 }
2222         }
2223         catch(std::exception &e)
2224         {
2225                 infostream<<"ServerMap: Failed to save map to "<<m_savedir
2226                                 <<", exception: "<<e.what()<<std::endl;
2227         }
2228
2229         /*
2230                 Close database if it was opened
2231         */
2232         delete dbase;
2233
2234 #if 0
2235         /*
2236                 Free all MapChunks
2237         */
2238         core::map<v2s16, MapChunk*>::Iterator i = m_chunks.getIterator();
2239         for(; i.atEnd() == false; i++)
2240         {
2241                 MapChunk *chunk = i.getNode()->getValue();
2242                 delete chunk;
2243         }
2244 #endif
2245 }
2246
2247 u64 ServerMap::getSeed()
2248 {
2249         return m_emerge->params.seed;
2250 }
2251
2252 s16 ServerMap::getWaterLevel()
2253 {
2254         return m_emerge->params.water_level;
2255 }
2256
2257 bool ServerMap::initBlockMake(BlockMakeData *data, v3s16 blockpos)
2258 {
2259         bool enable_mapgen_debug_info = m_emerge->mapgen_debug_info;
2260         EMERGE_DBG_OUT("initBlockMake(): " PP(blockpos) " - " PP(blockpos));
2261
2262         s16 csize = m_emerge->params.chunksize;
2263         v3s16 blockpos_min = EmergeManager::getContainingChunk(blockpos, csize);
2264         v3s16 blockpos_max = blockpos_min + v3s16(1, 1, 1) * (csize - 1);
2265
2266         v3s16 extra_borders(1,1,1);
2267
2268         // Do nothing if not inside limits (+-1 because of neighbors)
2269         if(blockpos_over_limit(blockpos_min - extra_borders) ||
2270                 blockpos_over_limit(blockpos_max + extra_borders))
2271                 return false;
2272
2273         data->seed = m_emerge->params.seed;
2274         data->blockpos_min = blockpos_min;
2275         data->blockpos_max = blockpos_max;
2276         data->blockpos_requested = blockpos;
2277         data->nodedef = m_gamedef->ndef();
2278
2279         /*
2280                 Create the whole area of this and the neighboring blocks
2281         */
2282         {
2283                 //TimeTaker timer("initBlockMake() create area");
2284
2285                 for(s16 x=blockpos_min.X-extra_borders.X;
2286                                 x<=blockpos_max.X+extra_borders.X; x++)
2287                 for(s16 z=blockpos_min.Z-extra_borders.Z;
2288                                 z<=blockpos_max.Z+extra_borders.Z; z++)
2289                 {
2290                         v2s16 sectorpos(x, z);
2291                         // Sector metadata is loaded from disk if not already loaded.
2292                         ServerMapSector *sector = createSector(sectorpos);
2293                         FATAL_ERROR_IF(sector == NULL, "createSector() failed");
2294                         (void) sector;
2295
2296                         for(s16 y=blockpos_min.Y-extra_borders.Y;
2297                                         y<=blockpos_max.Y+extra_borders.Y; y++)
2298                         {
2299                                 v3s16 p(x,y,z);
2300                                 //MapBlock *block = createBlock(p);
2301                                 // 1) get from memory, 2) load from disk
2302                                 MapBlock *block = emergeBlock(p, false);
2303                                 // 3) create a blank one
2304                                 if(block == NULL)
2305                                 {
2306                                         block = createBlock(p);
2307
2308                                         /*
2309                                                 Block gets sunlight if this is true.
2310
2311                                                 Refer to the map generator heuristics.
2312                                         */
2313                                         bool ug = m_emerge->isBlockUnderground(p);
2314                                         block->setIsUnderground(ug);
2315                                 }
2316
2317                                 // Lighting will not be valid after make_chunk is called
2318                                 block->setLightingExpired(true);
2319                                 // Lighting will be calculated
2320                                 //block->setLightingExpired(false);
2321                         }
2322                 }
2323         }
2324
2325         /*
2326                 Now we have a big empty area.
2327
2328                 Make a ManualMapVoxelManipulator that contains this and the
2329                 neighboring blocks
2330         */
2331
2332         // The area that contains this block and it's neighbors
2333         v3s16 bigarea_blocks_min = blockpos_min - extra_borders;
2334         v3s16 bigarea_blocks_max = blockpos_max + extra_borders;
2335
2336         data->vmanip = new MMVManip(this);
2337         //data->vmanip->setMap(this);
2338
2339         // Add the area
2340         {
2341                 //TimeTaker timer("initBlockMake() initialEmerge");
2342                 data->vmanip->initialEmerge(bigarea_blocks_min, bigarea_blocks_max);
2343         }
2344
2345         // Ensure none of the blocks to be generated were marked as containing CONTENT_IGNORE
2346 /*      for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
2347                 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
2348                         for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
2349                                 core::map<v3s16, u8>::Node *n;
2350                                 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
2351                                 if (n == NULL)
2352                                         continue;
2353                                 u8 flags = n->getValue();
2354                                 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
2355                                 n->setValue(flags);
2356                         }
2357                 }
2358         }*/
2359
2360         // Data is ready now.
2361         return true;
2362 }
2363
2364 void ServerMap::finishBlockMake(BlockMakeData *data,
2365                 std::map<v3s16, MapBlock*> &changed_blocks)
2366 {
2367         v3s16 blockpos_min = data->blockpos_min;
2368         v3s16 blockpos_max = data->blockpos_max;
2369         v3s16 blockpos_requested = data->blockpos_requested;
2370         /*infostream<<"finishBlockMake(): ("<<blockpos_requested.X<<","
2371                         <<blockpos_requested.Y<<","
2372                         <<blockpos_requested.Z<<")"<<std::endl;*/
2373
2374         v3s16 extra_borders(1,1,1);
2375
2376         bool enable_mapgen_debug_info = m_emerge->mapgen_debug_info;
2377
2378         /*infostream<<"Resulting vmanip:"<<std::endl;
2379         data->vmanip.print(infostream);*/
2380
2381         // Make sure affected blocks are loaded
2382         for(s16 x=blockpos_min.X-extra_borders.X;
2383                         x<=blockpos_max.X+extra_borders.X; x++)
2384         for(s16 z=blockpos_min.Z-extra_borders.Z;
2385                         z<=blockpos_max.Z+extra_borders.Z; z++)
2386         for(s16 y=blockpos_min.Y-extra_borders.Y;
2387                         y<=blockpos_max.Y+extra_borders.Y; y++)
2388         {
2389                 v3s16 p(x, y, z);
2390                 // Load from disk if not already in memory
2391                 emergeBlock(p, false);
2392         }
2393
2394         /*
2395                 Blit generated stuff to map
2396                 NOTE: blitBackAll adds nearly everything to changed_blocks
2397         */
2398         {
2399                 // 70ms @cs=8
2400                 //TimeTaker timer("finishBlockMake() blitBackAll");
2401                 data->vmanip->blitBackAll(&changed_blocks);
2402         }
2403
2404         EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()=" << changed_blocks.size());
2405
2406         /*
2407                 Copy transforming liquid information
2408         */
2409         while(data->transforming_liquid.size() > 0)
2410         {
2411                 m_transforming_liquid.push_back(data->transforming_liquid.front());
2412                 data->transforming_liquid.pop_front();
2413         }
2414
2415         /*
2416                 Do stuff in central blocks
2417         */
2418
2419         /*
2420                 Update lighting
2421         */
2422         {
2423 #if 0
2424                 TimeTaker t("finishBlockMake lighting update");
2425
2426                 core::map<v3s16, MapBlock*> lighting_update_blocks;
2427
2428                 // Center blocks
2429                 for(s16 x=blockpos_min.X-extra_borders.X;
2430                                 x<=blockpos_max.X+extra_borders.X; x++)
2431                 for(s16 z=blockpos_min.Z-extra_borders.Z;
2432                                 z<=blockpos_max.Z+extra_borders.Z; z++)
2433                 for(s16 y=blockpos_min.Y-extra_borders.Y;
2434                                 y<=blockpos_max.Y+extra_borders.Y; y++)
2435                 {
2436                         v3s16 p(x, y, z);
2437                         MapBlock *block = getBlockNoCreateNoEx(p);
2438                         assert(block);
2439                         lighting_update_blocks.insert(block->getPos(), block);
2440                 }
2441
2442                 updateLighting(lighting_update_blocks, changed_blocks);
2443 #endif
2444
2445                 /*
2446                         Set lighting to non-expired state in all of them.
2447                         This is cheating, but it is not fast enough if all of them
2448                         would actually be updated.
2449                 */
2450                 for(s16 x=blockpos_min.X-extra_borders.X;
2451                                 x<=blockpos_max.X+extra_borders.X; x++)
2452                 for(s16 z=blockpos_min.Z-extra_borders.Z;
2453                                 z<=blockpos_max.Z+extra_borders.Z; z++)
2454                 for(s16 y=blockpos_min.Y-extra_borders.Y;
2455                                 y<=blockpos_max.Y+extra_borders.Y; y++)
2456                 {
2457                         v3s16 p(x, y, z);
2458                         MapBlock * block = getBlockNoCreateNoEx(p);
2459                         if (block != NULL)
2460                                 block->setLightingExpired(false);
2461                 }
2462
2463 #if 0
2464                 if(enable_mapgen_debug_info == false)
2465                         t.stop(true); // Hide output
2466 #endif
2467         }
2468
2469         /*
2470                 Go through changed blocks
2471         */
2472         for(std::map<v3s16, MapBlock*>::iterator i = changed_blocks.begin();
2473                         i != changed_blocks.end(); ++i)
2474         {
2475                 MapBlock *block = i->second;
2476                 if (!block)
2477                         continue;
2478                 /*
2479                         Update day/night difference cache of the MapBlocks
2480                 */
2481                 block->expireDayNightDiff();
2482                 /*
2483                         Set block as modified
2484                 */
2485                 block->raiseModified(MOD_STATE_WRITE_NEEDED,
2486                         MOD_REASON_EXPIRE_DAYNIGHTDIFF);
2487         }
2488
2489         /*
2490                 Set central blocks as generated
2491         */
2492         for(s16 x=blockpos_min.X; x<=blockpos_max.X; x++)
2493         for(s16 z=blockpos_min.Z; z<=blockpos_max.Z; z++)
2494         for(s16 y=blockpos_min.Y; y<=blockpos_max.Y; y++)
2495         {
2496                 v3s16 p(x, y, z);
2497                 MapBlock *block = getBlockNoCreateNoEx(p);
2498                 if (!block)
2499                         continue;
2500                 block->setGenerated(true);
2501         }
2502
2503         /*
2504                 Save changed parts of map
2505                 NOTE: Will be saved later.
2506         */
2507         //save(MOD_STATE_WRITE_AT_UNLOAD);
2508
2509         /*infostream<<"finishBlockMake() done for ("<<blockpos_requested.X
2510                         <<","<<blockpos_requested.Y<<","
2511                         <<blockpos_requested.Z<<")"<<std::endl;*/
2512
2513
2514 #if 0
2515         if(enable_mapgen_debug_info)
2516         {
2517                 /*
2518                         Analyze resulting blocks
2519                 */
2520                 /*for(s16 x=blockpos_min.X-1; x<=blockpos_max.X+1; x++)
2521                 for(s16 z=blockpos_min.Z-1; z<=blockpos_max.Z+1; z++)
2522                 for(s16 y=blockpos_min.Y-1; y<=blockpos_max.Y+1; y++)*/
2523                 for(s16 x=blockpos_min.X-0; x<=blockpos_max.X+0; x++)
2524                 for(s16 z=blockpos_min.Z-0; z<=blockpos_max.Z+0; z++)
2525                 for(s16 y=blockpos_min.Y-0; y<=blockpos_max.Y+0; y++)
2526                 {
2527                         v3s16 p = v3s16(x,y,z);
2528                         MapBlock *block = getBlockNoCreateNoEx(p);
2529                         char spos[20];
2530                         snprintf(spos, 20, "(%2d,%2d,%2d)", x, y, z);
2531                         infostream<<"Generated "<<spos<<": "
2532                                         <<analyze_block(block)<<std::endl;
2533                 }
2534         }
2535 #endif
2536
2537         getBlockNoCreateNoEx(blockpos_requested);
2538 }
2539
2540 ServerMapSector * ServerMap::createSector(v2s16 p2d)
2541 {
2542         DSTACKF("%s: p2d=(%d,%d)",
2543                         __FUNCTION_NAME,
2544                         p2d.X, p2d.Y);
2545
2546         /*
2547                 Check if it exists already in memory
2548         */
2549         ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2550         if(sector != NULL)
2551                 return sector;
2552
2553         /*
2554                 Try to load it from disk (with blocks)
2555         */
2556         //if(loadSectorFull(p2d) == true)
2557
2558         /*
2559                 Try to load metadata from disk
2560         */
2561 #if 0
2562         if(loadSectorMeta(p2d) == true)
2563         {
2564                 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2565                 if(sector == NULL)
2566                 {
2567                         infostream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2568                         throw InvalidPositionException("");
2569                 }
2570                 return sector;
2571         }
2572 #endif
2573         /*
2574                 Do not create over-limit
2575         */
2576         const static u16 map_gen_limit = MYMIN(MAX_MAP_GENERATION_LIMIT,
2577                 g_settings->getU16("map_generation_limit"));
2578         if(p2d.X < -map_gen_limit / MAP_BLOCKSIZE
2579                         || p2d.X >  map_gen_limit / MAP_BLOCKSIZE
2580                         || p2d.Y < -map_gen_limit / MAP_BLOCKSIZE
2581                         || p2d.Y >  map_gen_limit / MAP_BLOCKSIZE)
2582                 throw InvalidPositionException("createSector(): pos. over limit");
2583
2584         /*
2585                 Generate blank sector
2586         */
2587
2588         sector = new ServerMapSector(this, p2d, m_gamedef);
2589
2590         // Sector position on map in nodes
2591         //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2592
2593         /*
2594                 Insert to container
2595         */
2596         m_sectors[p2d] = sector;
2597
2598         return sector;
2599 }
2600
2601 #if 0
2602 /*
2603         This is a quick-hand function for calling makeBlock().
2604 */
2605 MapBlock * ServerMap::generateBlock(
2606                 v3s16 p,
2607                 std::map<v3s16, MapBlock*> &modified_blocks
2608 )
2609 {
2610         DSTACKF("%s: p=(%d,%d,%d)", __FUNCTION_NAME, p.X, p.Y, p.Z);
2611
2612         /*infostream<<"generateBlock(): "
2613                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2614                         <<std::endl;*/
2615
2616         bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
2617
2618         TimeTaker timer("generateBlock");
2619
2620         //MapBlock *block = original_dummy;
2621
2622         v2s16 p2d(p.X, p.Z);
2623         v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2624
2625         /*
2626                 Do not generate over-limit
2627         */
2628         if(blockpos_over_limit(p))
2629         {
2630                 infostream<<__FUNCTION_NAME<<": Block position over limit"<<std::endl;
2631                 throw InvalidPositionException("generateBlock(): pos. over limit");
2632         }
2633
2634         /*
2635                 Create block make data
2636         */
2637         BlockMakeData data;
2638         initBlockMake(&data, p);
2639
2640         /*
2641                 Generate block
2642         */
2643         {
2644                 TimeTaker t("mapgen::make_block()");
2645                 mapgen->makeChunk(&data);
2646                 //mapgen::make_block(&data);
2647
2648                 if(enable_mapgen_debug_info == false)
2649                         t.stop(true); // Hide output
2650         }
2651
2652         /*
2653                 Blit data back on map, update lighting, add mobs and whatever this does
2654         */
2655         finishBlockMake(&data, modified_blocks);
2656
2657         /*
2658                 Get central block
2659         */
2660         MapBlock *block = getBlockNoCreateNoEx(p);
2661
2662 #if 0
2663         /*
2664                 Check result
2665         */
2666         if(block)
2667         {
2668                 bool erroneus_content = false;
2669                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2670                 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2671                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2672                 {
2673                         v3s16 p(x0,y0,z0);
2674                         MapNode n = block->getNode(p);
2675                         if(n.getContent() == CONTENT_IGNORE)
2676                         {
2677                                 infostream<<"CONTENT_IGNORE at "
2678                                                 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2679                                                 <<std::endl;
2680                                 erroneus_content = true;
2681                                 assert(0);
2682                         }
2683                 }
2684                 if(erroneus_content)
2685                 {
2686                         assert(0);
2687                 }
2688         }
2689 #endif
2690
2691 #if 0
2692         /*
2693                 Generate a completely empty block
2694         */
2695         if(block)
2696         {
2697                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2698                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2699                 {
2700                         for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2701                         {
2702                                 MapNode n;
2703                                 n.setContent(CONTENT_AIR);
2704                                 block->setNode(v3s16(x0,y0,z0), n);
2705                         }
2706                 }
2707         }
2708 #endif
2709
2710         if(enable_mapgen_debug_info == false)
2711                 timer.stop(true); // Hide output
2712
2713         return block;
2714 }
2715 #endif
2716
2717 MapBlock * ServerMap::createBlock(v3s16 p)
2718 {
2719         DSTACKF("%s: p=(%d,%d,%d)",
2720                         __FUNCTION_NAME, p.X, p.Y, p.Z);
2721
2722         /*
2723                 Do not create over-limit
2724         */
2725         if (blockpos_over_limit(p))
2726                 throw InvalidPositionException("createBlock(): pos. over limit");
2727
2728         v2s16 p2d(p.X, p.Z);
2729         s16 block_y = p.Y;
2730         /*
2731                 This will create or load a sector if not found in memory.
2732                 If block exists on disk, it will be loaded.
2733
2734                 NOTE: On old save formats, this will be slow, as it generates
2735                       lighting on blocks for them.
2736         */
2737         ServerMapSector *sector;
2738         try {
2739                 sector = (ServerMapSector*)createSector(p2d);
2740                 assert(sector->getId() == MAPSECTOR_SERVER);
2741         }
2742         catch(InvalidPositionException &e)
2743         {
2744                 infostream<<"createBlock: createSector() failed"<<std::endl;
2745                 throw e;
2746         }
2747         /*
2748                 NOTE: This should not be done, or at least the exception
2749                 should not be passed on as std::exception, because it
2750                 won't be catched at all.
2751         */
2752         /*catch(std::exception &e)
2753         {
2754                 infostream<<"createBlock: createSector() failed: "
2755                                 <<e.what()<<std::endl;
2756                 throw e;
2757         }*/
2758
2759         /*
2760                 Try to get a block from the sector
2761         */
2762
2763         MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2764         if(block)
2765         {
2766                 if(block->isDummy())
2767                         block->unDummify();
2768                 return block;
2769         }
2770         // Create blank
2771         block = sector->createBlankBlock(block_y);
2772
2773         return block;
2774 }
2775
2776 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
2777 {
2778         DSTACKF("%s: p=(%d,%d,%d), create_blank=%d",
2779                         __FUNCTION_NAME,
2780                         p.X, p.Y, p.Z, create_blank);
2781
2782         {
2783                 MapBlock *block = getBlockNoCreateNoEx(p);
2784                 if(block && block->isDummy() == false)
2785                         return block;
2786         }
2787
2788         {
2789                 MapBlock *block = loadBlock(p);
2790                 if(block)
2791                         return block;
2792         }
2793
2794         if (create_blank) {
2795                 ServerMapSector *sector = createSector(v2s16(p.X, p.Z));
2796                 MapBlock *block = sector->createBlankBlock(p.Y);
2797
2798                 return block;
2799         }
2800
2801 #if 0
2802         if(allow_generate)
2803         {
2804                 std::map<v3s16, MapBlock*> modified_blocks;
2805                 MapBlock *block = generateBlock(p, modified_blocks);
2806                 if(block)
2807                 {
2808                         MapEditEvent event;
2809                         event.type = MEET_OTHER;
2810                         event.p = p;
2811
2812                         // Copy modified_blocks to event
2813                         for(std::map<v3s16, MapBlock*>::iterator
2814                                         i = modified_blocks.begin();
2815                                         i != modified_blocks.end(); ++i)
2816                         {
2817                                 event.modified_blocks.insert(i->first);
2818                         }
2819
2820                         // Queue event
2821                         dispatchEvent(&event);
2822
2823                         return block;
2824                 }
2825         }
2826 #endif
2827
2828         return NULL;
2829 }
2830
2831 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
2832 {
2833         MapBlock *block = getBlockNoCreateNoEx(p3d);
2834         if (block == NULL)
2835                 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
2836
2837         return block;
2838 }
2839
2840 void ServerMap::prepareBlock(MapBlock *block) {
2841 }
2842
2843 // N.B.  This requires no synchronization, since data will not be modified unless
2844 // the VoxelManipulator being updated belongs to the same thread.
2845 void ServerMap::updateVManip(v3s16 pos)
2846 {
2847         Mapgen *mg = m_emerge->getCurrentMapgen();
2848         if (!mg)
2849                 return;
2850
2851         MMVManip *vm = mg->vm;
2852         if (!vm)
2853                 return;
2854
2855         if (!vm->m_area.contains(pos))
2856                 return;
2857
2858         s32 idx = vm->m_area.index(pos);
2859         vm->m_data[idx] = getNodeNoEx(pos);
2860         vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
2861
2862         vm->m_is_dirty = true;
2863 }
2864
2865 s16 ServerMap::findGroundLevel(v2s16 p2d)
2866 {
2867 #if 0
2868         /*
2869                 Uh, just do something random...
2870         */
2871         // Find existing map from top to down
2872         s16 max=63;
2873         s16 min=-64;
2874         v3s16 p(p2d.X, max, p2d.Y);
2875         for(; p.Y>min; p.Y--)
2876         {
2877                 MapNode n = getNodeNoEx(p);
2878                 if(n.getContent() != CONTENT_IGNORE)
2879                         break;
2880         }
2881         if(p.Y == min)
2882                 goto plan_b;
2883         // If this node is not air, go to plan b
2884         if(getNodeNoEx(p).getContent() != CONTENT_AIR)
2885                 goto plan_b;
2886         // Search existing walkable and return it
2887         for(; p.Y>min; p.Y--)
2888         {
2889                 MapNode n = getNodeNoEx(p);
2890                 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
2891                         return p.Y;
2892         }
2893
2894         // Move to plan b
2895 plan_b:
2896 #endif
2897
2898         /*
2899                 Determine from map generator noise functions
2900         */
2901
2902         s16 level = m_emerge->getGroundLevelAtPoint(p2d);
2903         return level;
2904
2905         //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2906         //return (s16)level;
2907 }
2908
2909 bool ServerMap::loadFromFolders() {
2910         if (!dbase->initialized() &&
2911                         !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
2912                 return true;
2913         return false;
2914 }
2915
2916 void ServerMap::createDirs(std::string path)
2917 {
2918         if(fs::CreateAllDirs(path) == false)
2919         {
2920                 m_dout<<DTIME<<"ServerMap: Failed to create directory "
2921                                 <<"\""<<path<<"\""<<std::endl;
2922                 throw BaseException("ServerMap failed to create directory");
2923         }
2924 }
2925
2926 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2927 {
2928         char cc[9];
2929         switch(layout)
2930         {
2931                 case 1:
2932                         snprintf(cc, 9, "%.4x%.4x",
2933                                 (unsigned int) pos.X & 0xffff,
2934                                 (unsigned int) pos.Y & 0xffff);
2935
2936                         return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
2937                 case 2:
2938                         snprintf(cc, 9, (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
2939                                 (unsigned int) pos.X & 0xfff,
2940                                 (unsigned int) pos.Y & 0xfff);
2941
2942                         return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
2943                 default:
2944                         assert(false);
2945                         return "";
2946         }
2947 }
2948
2949 v2s16 ServerMap::getSectorPos(std::string dirname)
2950 {
2951         unsigned int x = 0, y = 0;
2952         int r;
2953         std::string component;
2954         fs::RemoveLastPathComponent(dirname, &component, 1);
2955         if(component.size() == 8)
2956         {
2957                 // Old layout
2958                 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
2959         }
2960         else if(component.size() == 3)
2961         {
2962                 // New layout
2963                 fs::RemoveLastPathComponent(dirname, &component, 2);
2964                 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
2965                 // Sign-extend the 12 bit values up to 16 bits...
2966                 if(x & 0x800) x |= 0xF000;
2967                 if(y & 0x800) y |= 0xF000;
2968         }
2969         else
2970         {
2971                 r = -1;
2972         }
2973
2974         FATAL_ERROR_IF(r != 2, "getSectorPos()");
2975         v2s16 pos((s16)x, (s16)y);
2976         return pos;
2977 }
2978
2979 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2980 {
2981         v2s16 p2d = getSectorPos(sectordir);
2982
2983         if(blockfile.size() != 4){
2984                 throw InvalidFilenameException("Invalid block filename");
2985         }
2986         unsigned int y;
2987         int r = sscanf(blockfile.c_str(), "%4x", &y);
2988         if(r != 1)
2989                 throw InvalidFilenameException("Invalid block filename");
2990         return v3s16(p2d.X, y, p2d.Y);
2991 }
2992
2993 std::string ServerMap::getBlockFilename(v3s16 p)
2994 {
2995         char cc[5];
2996         snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2997         return cc;
2998 }
2999
3000 void ServerMap::save(ModifiedState save_level)
3001 {
3002         DSTACK(__FUNCTION_NAME);
3003         if(m_map_saving_enabled == false) {
3004                 infostream<<"WARNING: Not saving map, saving disabled."<<std::endl;
3005                 return;
3006         }
3007
3008         if(save_level == MOD_STATE_CLEAN)
3009                 infostream<<"ServerMap: Saving whole map, this can take time."
3010                                 <<std::endl;
3011
3012         if(m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
3013                 saveMapMeta();
3014         }
3015
3016         // Profile modified reasons
3017         Profiler modprofiler;
3018
3019         u32 sector_meta_count = 0;
3020         u32 block_count = 0;
3021         u32 block_count_all = 0; // Number of blocks in memory
3022
3023         // Don't do anything with sqlite unless something is really saved
3024         bool save_started = false;
3025
3026         for(std::map<v2s16, MapSector*>::iterator i = m_sectors.begin();
3027                 i != m_sectors.end(); ++i) {
3028                 ServerMapSector *sector = (ServerMapSector*)i->second;
3029                 assert(sector->getId() == MAPSECTOR_SERVER);
3030
3031                 if(sector->differs_from_disk || save_level == MOD_STATE_CLEAN) {
3032                         saveSectorMeta(sector);
3033                         sector_meta_count++;
3034                 }
3035
3036                 MapBlockVect blocks;
3037                 sector->getBlocks(blocks);
3038
3039                 for(MapBlockVect::iterator j = blocks.begin();
3040                         j != blocks.end(); ++j) {
3041                         MapBlock *block = *j;
3042
3043                         block_count_all++;
3044
3045                         if(block->getModified() >= (u32)save_level) {
3046                                 // Lazy beginSave()
3047                                 if(!save_started) {
3048                                         beginSave();
3049                                         save_started = true;
3050                                 }
3051
3052                                 modprofiler.add(block->getModifiedReasonString(), 1);
3053
3054                                 saveBlock(block);
3055                                 block_count++;
3056
3057                                 /*infostream<<"ServerMap: Written block ("
3058                                                 <<block->getPos().X<<","
3059                                                 <<block->getPos().Y<<","
3060                                                 <<block->getPos().Z<<")"
3061                                                 <<std::endl;*/
3062                         }
3063                 }
3064         }
3065
3066         if(save_started)
3067                 endSave();
3068
3069         /*
3070                 Only print if something happened or saved whole map
3071         */
3072         if(save_level == MOD_STATE_CLEAN || sector_meta_count != 0
3073                         || block_count != 0) {
3074                 infostream<<"ServerMap: Written: "
3075                                 <<sector_meta_count<<" sector metadata files, "
3076                                 <<block_count<<" block files"
3077                                 <<", "<<block_count_all<<" blocks in memory."
3078                                 <<std::endl;
3079                 PrintInfo(infostream); // ServerMap/ClientMap:
3080                 infostream<<"Blocks modified by: "<<std::endl;
3081                 modprofiler.print(infostream);
3082         }
3083 }
3084
3085 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
3086 {
3087         if (loadFromFolders()) {
3088                 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
3089                                 << "all blocks that are stored in flat files." << std::endl;
3090         }
3091         dbase->listAllLoadableBlocks(dst);
3092 }
3093
3094 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
3095 {
3096         for(std::map<v2s16, MapSector*>::iterator si = m_sectors.begin();
3097                 si != m_sectors.end(); ++si)
3098         {
3099                 MapSector *sector = si->second;
3100
3101                 MapBlockVect blocks;
3102                 sector->getBlocks(blocks);
3103
3104                 for(MapBlockVect::iterator i = blocks.begin();
3105                                 i != blocks.end(); ++i) {
3106                         v3s16 p = (*i)->getPos();
3107                         dst.push_back(p);
3108                 }
3109         }
3110 }
3111
3112 void ServerMap::saveMapMeta()
3113 {
3114         DSTACK(__FUNCTION_NAME);
3115
3116         createDirs(m_savedir);
3117
3118         std::string fullpath = m_savedir + DIR_DELIM + "map_meta.txt";
3119         std::ostringstream oss(std::ios_base::binary);
3120         Settings conf;
3121
3122         m_emerge->params.save(conf);
3123         conf.writeLines(oss);
3124
3125         oss << "[end_of_params]\n";
3126
3127         if(!fs::safeWriteToFile(fullpath, oss.str())) {
3128                 errorstream << "ServerMap::saveMapMeta(): "
3129                                 << "could not write " << fullpath << std::endl;
3130                 throw FileNotGoodException("Cannot save chunk metadata");
3131         }
3132
3133         m_map_metadata_changed = false;
3134 }
3135
3136 void ServerMap::loadMapMeta()
3137 {
3138         DSTACK(__FUNCTION_NAME);
3139
3140         Settings conf;
3141         std::string fullpath = m_savedir + DIR_DELIM + "map_meta.txt";
3142
3143         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3144         if (!is.good()) {
3145                 errorstream << "ServerMap::loadMapMeta(): "
3146                         "could not open " << fullpath << std::endl;
3147                 throw FileNotGoodException("Cannot open map metadata");
3148         }
3149
3150         if (!conf.parseConfigLines(is, "[end_of_params]")) {
3151                 throw SerializationError("ServerMap::loadMapMeta(): "
3152                                 "[end_of_params] not found!");
3153         }
3154
3155         m_emerge->params.load(conf);
3156
3157         verbosestream << "ServerMap::loadMapMeta(): seed="
3158                 << m_emerge->params.seed << std::endl;
3159 }
3160
3161 void ServerMap::saveSectorMeta(ServerMapSector *sector)
3162 {
3163         DSTACK(__FUNCTION_NAME);
3164         // Format used for writing
3165         u8 version = SER_FMT_VER_HIGHEST_WRITE;
3166         // Get destination
3167         v2s16 pos = sector->getPos();
3168         std::string dir = getSectorDir(pos);
3169         createDirs(dir);
3170
3171         std::string fullpath = dir + DIR_DELIM + "meta";
3172         std::ostringstream ss(std::ios_base::binary);
3173
3174         sector->serialize(ss, version);
3175
3176         if(!fs::safeWriteToFile(fullpath, ss.str()))
3177                 throw FileNotGoodException("Cannot write sector metafile");
3178
3179         sector->differs_from_disk = false;
3180 }
3181
3182 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
3183 {
3184         DSTACK(__FUNCTION_NAME);
3185         // Get destination
3186         v2s16 p2d = getSectorPos(sectordir);
3187
3188         ServerMapSector *sector = NULL;
3189
3190         std::string fullpath = sectordir + DIR_DELIM + "meta";
3191         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3192         if(is.good() == false)
3193         {
3194                 // If the directory exists anyway, it probably is in some old
3195                 // format. Just go ahead and create the sector.
3196                 if(fs::PathExists(sectordir))
3197                 {
3198                         /*infostream<<"ServerMap::loadSectorMeta(): Sector metafile "
3199                                         <<fullpath<<" doesn't exist but directory does."
3200                                         <<" Continuing with a sector with no metadata."
3201                                         <<std::endl;*/
3202                         sector = new ServerMapSector(this, p2d, m_gamedef);
3203                         m_sectors[p2d] = sector;
3204                 }
3205                 else
3206                 {
3207                         throw FileNotGoodException("Cannot open sector metafile");
3208                 }
3209         }
3210         else
3211         {
3212                 sector = ServerMapSector::deSerialize
3213                                 (is, this, p2d, m_sectors, m_gamedef);
3214                 if(save_after_load)
3215                         saveSectorMeta(sector);
3216         }
3217
3218         sector->differs_from_disk = false;
3219
3220         return sector;
3221 }
3222
3223 bool ServerMap::loadSectorMeta(v2s16 p2d)
3224 {
3225         DSTACK(__FUNCTION_NAME);
3226
3227         // The directory layout we're going to load from.
3228         //  1 - original sectors/xxxxzzzz/
3229         //  2 - new sectors2/xxx/zzz/
3230         //  If we load from anything but the latest structure, we will
3231         //  immediately save to the new one, and remove the old.
3232         int loadlayout = 1;
3233         std::string sectordir1 = getSectorDir(p2d, 1);
3234         std::string sectordir;
3235         if(fs::PathExists(sectordir1))
3236         {
3237                 sectordir = sectordir1;
3238         }
3239         else
3240         {
3241                 loadlayout = 2;
3242                 sectordir = getSectorDir(p2d, 2);
3243         }
3244
3245         try{
3246                 loadSectorMeta(sectordir, loadlayout != 2);
3247         }
3248         catch(InvalidFilenameException &e)
3249         {
3250                 return false;
3251         }
3252         catch(FileNotGoodException &e)
3253         {
3254                 return false;
3255         }
3256         catch(std::exception &e)
3257         {
3258                 return false;
3259         }
3260
3261         return true;
3262 }
3263
3264 #if 0
3265 bool ServerMap::loadSectorFull(v2s16 p2d)
3266 {
3267         DSTACK(__FUNCTION_NAME);
3268
3269         MapSector *sector = NULL;
3270
3271         // The directory layout we're going to load from.
3272         //  1 - original sectors/xxxxzzzz/
3273         //  2 - new sectors2/xxx/zzz/
3274         //  If we load from anything but the latest structure, we will
3275         //  immediately save to the new one, and remove the old.
3276         int loadlayout = 1;
3277         std::string sectordir1 = getSectorDir(p2d, 1);
3278         std::string sectordir;
3279         if(fs::PathExists(sectordir1))
3280         {
3281                 sectordir = sectordir1;
3282         }
3283         else
3284         {
3285                 loadlayout = 2;
3286                 sectordir = getSectorDir(p2d, 2);
3287         }
3288
3289         try{
3290                 sector = loadSectorMeta(sectordir, loadlayout != 2);
3291         }
3292         catch(InvalidFilenameException &e)
3293         {
3294                 return false;
3295         }
3296         catch(FileNotGoodException &e)
3297         {
3298                 return false;
3299         }
3300         catch(std::exception &e)
3301         {
3302                 return false;
3303         }
3304
3305         /*
3306                 Load blocks
3307         */
3308         std::vector<fs::DirListNode> list2 = fs::GetDirListing
3309                         (sectordir);
3310         std::vector<fs::DirListNode>::iterator i2;
3311         for(i2=list2.begin(); i2!=list2.end(); i2++)
3312         {
3313                 // We want files
3314                 if(i2->dir)
3315                         continue;
3316                 try{
3317                         loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3318                 }
3319                 catch(InvalidFilenameException &e)
3320                 {
3321                         // This catches unknown crap in directory
3322                 }
3323         }
3324
3325         if(loadlayout != 2)
3326         {
3327                 infostream<<"Sector converted to new layout - deleting "<<
3328                         sectordir1<<std::endl;
3329                 fs::RecursiveDelete(sectordir1);
3330         }
3331
3332         return true;
3333 }
3334 #endif
3335
3336 Database *ServerMap::createDatabase(const std::string &name, const std::string &savedir, Settings &conf)
3337 {
3338         if (name == "sqlite3")
3339                 return new Database_SQLite3(savedir);
3340         if (name == "dummy")
3341                 return new Database_Dummy();
3342         #if USE_LEVELDB
3343         else if (name == "leveldb")
3344                 return new Database_LevelDB(savedir);
3345         #endif
3346         #if USE_REDIS
3347         else if (name == "redis")
3348                 return new Database_Redis(conf);
3349         #endif
3350         else
3351                 throw BaseException(std::string("Database backend ") + name + " not supported.");
3352 }
3353
3354 void ServerMap::beginSave()
3355 {
3356         dbase->beginSave();
3357 }
3358
3359 void ServerMap::endSave()
3360 {
3361         dbase->endSave();
3362 }
3363
3364 bool ServerMap::saveBlock(MapBlock *block)
3365 {
3366         return saveBlock(block, dbase);
3367 }
3368
3369 bool ServerMap::saveBlock(MapBlock *block, Database *db)
3370 {
3371         v3s16 p3d = block->getPos();
3372
3373         // Dummy blocks are not written
3374         if (block->isDummy()) {
3375                 errorstream << "WARNING: saveBlock: Not writing dummy block "
3376                         << PP(p3d) << std::endl;
3377                 return true;
3378         }
3379
3380         // Format used for writing
3381         u8 version = SER_FMT_VER_HIGHEST_WRITE;
3382
3383         /*
3384                 [0] u8 serialization version
3385                 [1] data
3386         */
3387         std::ostringstream o(std::ios_base::binary);
3388         o.write((char*) &version, 1);
3389         block->serialize(o, version, true);
3390
3391         std::string data = o.str();
3392         bool ret = db->saveBlock(p3d, data);
3393         if (ret) {
3394                 // We just wrote it to the disk so clear modified flag
3395                 block->resetModified();
3396         }
3397         return ret;
3398 }
3399
3400 void ServerMap::loadBlock(std::string sectordir, std::string blockfile,
3401                 MapSector *sector, bool save_after_load)
3402 {
3403         DSTACK(__FUNCTION_NAME);
3404
3405         std::string fullpath = sectordir + DIR_DELIM + blockfile;
3406         try {
3407
3408                 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3409                 if(is.good() == false)
3410                         throw FileNotGoodException("Cannot open block file");
3411
3412                 v3s16 p3d = getBlockPos(sectordir, blockfile);
3413                 v2s16 p2d(p3d.X, p3d.Z);
3414
3415                 assert(sector->getPos() == p2d);
3416
3417                 u8 version = SER_FMT_VER_INVALID;
3418                 is.read((char*)&version, 1);
3419
3420                 if(is.fail())
3421                         throw SerializationError("ServerMap::loadBlock(): Failed"
3422                                         " to read MapBlock version");
3423
3424                 /*u32 block_size = MapBlock::serializedLength(version);
3425                 SharedBuffer<u8> data(block_size);
3426                 is.read((char*)*data, block_size);*/
3427
3428                 // This will always return a sector because we're the server
3429                 //MapSector *sector = emergeSector(p2d);
3430
3431                 MapBlock *block = NULL;
3432                 bool created_new = false;
3433                 block = sector->getBlockNoCreateNoEx(p3d.Y);
3434                 if(block == NULL)
3435                 {
3436                         block = sector->createBlankBlockNoInsert(p3d.Y);
3437                         created_new = true;
3438                 }
3439
3440                 // Read basic data
3441                 block->deSerialize(is, version, true);
3442
3443                 // If it's a new block, insert it to the map
3444                 if(created_new)
3445                         sector->insertBlock(block);
3446
3447                 /*
3448                         Save blocks loaded in old format in new format
3449                 */
3450
3451                 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
3452                 {
3453                         saveBlock(block);
3454
3455                         // Should be in database now, so delete the old file
3456                         fs::RecursiveDelete(fullpath);
3457                 }
3458
3459                 // We just loaded it from the disk, so it's up-to-date.
3460                 block->resetModified();
3461
3462         }
3463         catch(SerializationError &e)
3464         {
3465                 infostream<<"WARNING: Invalid block data on disk "
3466                                 <<"fullpath="<<fullpath
3467                                 <<" (SerializationError). "
3468                                 <<"what()="<<e.what()
3469                                 <<std::endl;
3470                                 // Ignoring. A new one will be generated.
3471                 abort();
3472
3473                 // TODO: Backup file; name is in fullpath.
3474         }
3475 }
3476
3477 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
3478 {
3479         DSTACK(__FUNCTION_NAME);
3480
3481         try {
3482                 std::istringstream is(*blob, std::ios_base::binary);
3483
3484                 u8 version = SER_FMT_VER_INVALID;
3485                 is.read((char*)&version, 1);
3486
3487                 if(is.fail())
3488                         throw SerializationError("ServerMap::loadBlock(): Failed"
3489                                         " to read MapBlock version");
3490
3491                 /*u32 block_size = MapBlock::serializedLength(version);
3492                 SharedBuffer<u8> data(block_size);
3493                 is.read((char*)*data, block_size);*/
3494
3495                 // This will always return a sector because we're the server
3496                 //MapSector *sector = emergeSector(p2d);
3497
3498                 MapBlock *block = NULL;
3499                 bool created_new = false;
3500                 block = sector->getBlockNoCreateNoEx(p3d.Y);
3501                 if(block == NULL)
3502                 {
3503                         block = sector->createBlankBlockNoInsert(p3d.Y);
3504                         created_new = true;
3505                 }
3506
3507                 // Read basic data
3508                 block->deSerialize(is, version, true);
3509
3510                 // If it's a new block, insert it to the map
3511                 if(created_new)
3512                         sector->insertBlock(block);
3513
3514                 /*
3515                         Save blocks loaded in old format in new format
3516                 */
3517
3518                 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
3519                 // Only save if asked to; no need to update version
3520                 if(save_after_load)
3521                         saveBlock(block);
3522
3523                 // We just loaded it from, so it's up-to-date.
3524                 block->resetModified();
3525
3526         }
3527         catch(SerializationError &e)
3528         {
3529                 errorstream<<"Invalid block data in database"
3530                                 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
3531                                 <<" (SerializationError): "<<e.what()<<std::endl;
3532
3533                 // TODO: Block should be marked as invalid in memory so that it is
3534                 // not touched but the game can run
3535
3536                 if(g_settings->getBool("ignore_world_load_errors")){
3537                         errorstream<<"Ignoring block load error. Duck and cover! "
3538                                         <<"(ignore_world_load_errors)"<<std::endl;
3539                 } else {
3540                         throw SerializationError("Invalid block data in database");
3541                 }
3542         }
3543 }
3544
3545 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3546 {
3547         DSTACK(__FUNCTION_NAME);
3548
3549         v2s16 p2d(blockpos.X, blockpos.Z);
3550
3551         std::string ret;
3552
3553         ret = dbase->loadBlock(blockpos);
3554         if (ret != "") {
3555                 loadBlock(&ret, blockpos, createSector(p2d), false);
3556                 return getBlockNoCreateNoEx(blockpos);
3557         }
3558         // Not found in database, try the files
3559
3560         // The directory layout we're going to load from.
3561         //  1 - original sectors/xxxxzzzz/
3562         //  2 - new sectors2/xxx/zzz/
3563         //  If we load from anything but the latest structure, we will
3564         //  immediately save to the new one, and remove the old.
3565         int loadlayout = 1;
3566         std::string sectordir1 = getSectorDir(p2d, 1);
3567         std::string sectordir;
3568         if(fs::PathExists(sectordir1))
3569         {
3570                 sectordir = sectordir1;
3571         }
3572         else
3573         {
3574                 loadlayout = 2;
3575                 sectordir = getSectorDir(p2d, 2);
3576         }
3577
3578         /*
3579                 Make sure sector is loaded
3580         */
3581         MapSector *sector = getSectorNoGenerateNoEx(p2d);
3582         if(sector == NULL)
3583         {
3584                 try{
3585                         sector = loadSectorMeta(sectordir, loadlayout != 2);
3586                 }
3587                 catch(InvalidFilenameException &e)
3588                 {
3589                         return NULL;
3590                 }
3591                 catch(FileNotGoodException &e)
3592                 {
3593                         return NULL;
3594                 }
3595                 catch(std::exception &e)
3596                 {
3597                         return NULL;
3598                 }
3599         }
3600
3601         /*
3602                 Make sure file exists
3603         */
3604
3605         std::string blockfilename = getBlockFilename(blockpos);
3606         if(fs::PathExists(sectordir + DIR_DELIM + blockfilename) == false)
3607                 return NULL;
3608
3609         /*
3610                 Load block and save it to the database
3611         */
3612         loadBlock(sectordir, blockfilename, sector, true);
3613         return getBlockNoCreateNoEx(blockpos);
3614 }
3615
3616 bool ServerMap::deleteBlock(v3s16 blockpos)
3617 {
3618         if (!dbase->deleteBlock(blockpos))
3619                 return false;
3620
3621         MapBlock *block = getBlockNoCreateNoEx(blockpos);
3622         if (block) {
3623                 v2s16 p2d(blockpos.X, blockpos.Z);
3624                 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3625                 if (!sector)
3626                         return false;
3627                 sector->deleteBlock(block);
3628         }
3629
3630         return true;
3631 }
3632
3633 void ServerMap::PrintInfo(std::ostream &out)
3634 {
3635         out<<"ServerMap: ";
3636 }
3637
3638 MMVManip::MMVManip(Map *map):
3639                 VoxelManipulator(),
3640                 m_is_dirty(false),
3641                 m_create_area(false),
3642                 m_map(map)
3643 {
3644 }
3645
3646 MMVManip::~MMVManip()
3647 {
3648 }
3649
3650 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
3651         bool load_if_inexistent)
3652 {
3653         TimeTaker timer1("initialEmerge", &emerge_time);
3654
3655         // Units of these are MapBlocks
3656         v3s16 p_min = blockpos_min;
3657         v3s16 p_max = blockpos_max;
3658
3659         VoxelArea block_area_nodes
3660                         (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3661
3662         u32 size_MB = block_area_nodes.getVolume()*4/1000000;
3663         if(size_MB >= 1)
3664         {
3665                 infostream<<"initialEmerge: area: ";
3666                 block_area_nodes.print(infostream);
3667                 infostream<<" ("<<size_MB<<"MB)";
3668                 infostream<<std::endl;
3669         }
3670
3671         addArea(block_area_nodes);
3672
3673         for(s32 z=p_min.Z; z<=p_max.Z; z++)
3674         for(s32 y=p_min.Y; y<=p_max.Y; y++)
3675         for(s32 x=p_min.X; x<=p_max.X; x++)
3676         {
3677                 u8 flags = 0;
3678                 MapBlock *block;
3679                 v3s16 p(x,y,z);
3680                 std::map<v3s16, u8>::iterator n;
3681                 n = m_loaded_blocks.find(p);
3682                 if(n != m_loaded_blocks.end())
3683                         continue;
3684
3685                 bool block_data_inexistent = false;
3686                 try
3687                 {
3688                         TimeTaker timer1("emerge load", &emerge_load_time);
3689
3690                         block = m_map->getBlockNoCreate(p);
3691                         if(block->isDummy())
3692                                 block_data_inexistent = true;
3693                         else
3694                                 block->copyTo(*this);
3695                 }
3696                 catch(InvalidPositionException &e)
3697                 {
3698                         block_data_inexistent = true;
3699                 }
3700
3701                 if(block_data_inexistent)
3702                 {
3703
3704                         if (load_if_inexistent) {
3705                                 ServerMap *svrmap = (ServerMap *)m_map;
3706                                 block = svrmap->emergeBlock(p, false);
3707                                 if (block == NULL)
3708                                         block = svrmap->createBlock(p);
3709                                 block->copyTo(*this);
3710                         } else {
3711                                 flags |= VMANIP_BLOCK_DATA_INEXIST;
3712
3713                                 /*
3714                                         Mark area inexistent
3715                                 */
3716                                 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3717                                 // Fill with VOXELFLAG_NO_DATA
3718                                 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3719                                 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3720                                 {
3721                                         s32 i = m_area.index(a.MinEdge.X,y,z);
3722                                         memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
3723                                 }
3724                         }
3725                 }
3726                 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
3727                 {
3728                         // Mark that block was loaded as blank
3729                         flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
3730                 }*/
3731
3732                 m_loaded_blocks[p] = flags;
3733         }
3734
3735         m_is_dirty = false;
3736 }
3737
3738 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
3739         bool overwrite_generated)
3740 {
3741         if(m_area.getExtent() == v3s16(0,0,0))
3742                 return;
3743
3744         /*
3745                 Copy data of all blocks
3746         */
3747         for(std::map<v3s16, u8>::iterator
3748                         i = m_loaded_blocks.begin();
3749                         i != m_loaded_blocks.end(); ++i)
3750         {
3751                 v3s16 p = i->first;
3752                 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
3753                 bool existed = !(i->second & VMANIP_BLOCK_DATA_INEXIST);
3754                 if ((existed == false) || (block == NULL) ||
3755                         (overwrite_generated == false && block->isGenerated() == true))
3756                         continue;
3757
3758                 block->copyFrom(*this);
3759
3760                 if(modified_blocks)
3761                         (*modified_blocks)[p] = block;
3762         }
3763 }
3764
3765 //END