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<<"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<<"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<<"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<<"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<<"Node was under sunlight. "
1201                                 "Propagating sunlight";
1202                 m_dout<<" -> 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<<"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_MAX) {
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                 warningstream<<"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                 warningstream<<"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                 warningstream<<"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                 warningstream<<"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                 warningstream<<"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                 warningstream<<"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                                         warningstream<<"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                 warningstream<<"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                 warningstream<<"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(v3s16 blockpos, BlockMakeData *data)
2258 {
2259         s16 csize = m_emerge->params.chunksize;
2260         v3s16 bpmin = EmergeManager::getContainingChunk(blockpos, csize);
2261         v3s16 bpmax = bpmin + v3s16(1, 1, 1) * (csize - 1);
2262
2263         bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
2264         EMERGE_DBG_OUT("initBlockMake(): " PP(bpmin) " - " PP(bpmax));
2265
2266         v3s16 extra_borders(1, 1, 1);
2267         v3s16 full_bpmin = bpmin - extra_borders;
2268         v3s16 full_bpmax = bpmax + extra_borders;
2269
2270         // Do nothing if not inside limits (+-1 because of neighbors)
2271         if (blockpos_over_limit(full_bpmin) ||
2272                 blockpos_over_limit(full_bpmax))
2273                 return false;
2274
2275         data->seed = m_emerge->params.seed;
2276         data->blockpos_min = bpmin;
2277         data->blockpos_max = bpmax;
2278         data->blockpos_requested = blockpos;
2279         data->nodedef = m_gamedef->ndef();
2280
2281         /*
2282                 Create the whole area of this and the neighboring blocks
2283         */
2284         for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
2285         for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++) {
2286                 v2s16 sectorpos(x, z);
2287                 // Sector metadata is loaded from disk if not already loaded.
2288                 ServerMapSector *sector = createSector(sectorpos);
2289                 FATAL_ERROR_IF(sector == NULL, "createSector() failed");
2290
2291                 for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
2292                         v3s16 p(x, y, z);
2293
2294                         MapBlock *block = emergeBlock(p, false);
2295                         if (block == NULL) {
2296                                 block = createBlock(p);
2297
2298                                 // Block gets sunlight if this is true.
2299                                 // Refer to the map generator heuristics.
2300                                 bool ug = m_emerge->isBlockUnderground(p);
2301                                 block->setIsUnderground(ug);
2302                         }
2303                 }
2304         }
2305
2306         /*
2307                 Now we have a big empty area.
2308
2309                 Make a ManualMapVoxelManipulator that contains this and the
2310                 neighboring blocks
2311         */
2312
2313         data->vmanip = new MMVManip(this);
2314         data->vmanip->initialEmerge(full_bpmin, full_bpmax);
2315
2316         // Note: we may need this again at some point.
2317 #if 0
2318         // Ensure none of the blocks to be generated were marked as
2319         // containing CONTENT_IGNORE
2320         for (s16 z = blockpos_min.Z; z <= blockpos_max.Z; z++) {
2321                 for (s16 y = blockpos_min.Y; y <= blockpos_max.Y; y++) {
2322                         for (s16 x = blockpos_min.X; x <= blockpos_max.X; x++) {
2323                                 core::map<v3s16, u8>::Node *n;
2324                                 n = data->vmanip->m_loaded_blocks.find(v3s16(x, y, z));
2325                                 if (n == NULL)
2326                                         continue;
2327                                 u8 flags = n->getValue();
2328                                 flags &= ~VMANIP_BLOCK_CONTAINS_CIGNORE;
2329                                 n->setValue(flags);
2330                         }
2331                 }
2332         }
2333 #endif
2334
2335         // Data is ready now.
2336         return true;
2337 }
2338
2339 void ServerMap::finishBlockMake(BlockMakeData *data,
2340         std::map<v3s16, MapBlock*> *changed_blocks)
2341 {
2342         v3s16 bpmin = data->blockpos_min;
2343         v3s16 bpmax = data->blockpos_max;
2344
2345         v3s16 extra_borders(1, 1, 1);
2346         v3s16 full_bpmin = bpmin - extra_borders;
2347         v3s16 full_bpmax = bpmax + extra_borders;
2348
2349         bool enable_mapgen_debug_info = m_emerge->enable_mapgen_debug_info;
2350         EMERGE_DBG_OUT("finishBlockMake(): " PP(bpmin) " - " PP(bpmax));
2351
2352         /*
2353                 Set lighting to non-expired state in all of them.
2354                 This is cheating, but it is not fast enough if all of them
2355                 would actually be updated.
2356         */
2357         for (s16 x = full_bpmin.X; x <= full_bpmax.X; x++)
2358         for (s16 z = full_bpmin.Z; z <= full_bpmax.Z; z++)
2359         for (s16 y = full_bpmin.Y; y <= full_bpmax.Y; y++) {
2360                 MapBlock *block = emergeBlock(v3s16(x, y, z), false);
2361                 if (!block)
2362                         continue;
2363
2364                 block->setLightingExpired(false);
2365         }
2366
2367         /*
2368                 Blit generated stuff to map
2369                 NOTE: blitBackAll adds nearly everything to changed_blocks
2370         */
2371         data->vmanip->blitBackAll(changed_blocks);
2372
2373         EMERGE_DBG_OUT("finishBlockMake: changed_blocks.size()="
2374                 << changed_blocks->size());
2375
2376         /*
2377                 Copy transforming liquid information
2378         */
2379         while (data->transforming_liquid.size()) {
2380                 m_transforming_liquid.push_back(data->transforming_liquid.front());
2381                 data->transforming_liquid.pop_front();
2382         }
2383
2384         for (std::map<v3s16, MapBlock *>::iterator
2385                         it = changed_blocks->begin();
2386                         it != changed_blocks->end(); ++it) {
2387                 MapBlock *block = it->second;
2388                 if (!block)
2389                         continue;
2390                 /*
2391                         Update day/night difference cache of the MapBlocks
2392                 */
2393                 block->expireDayNightDiff();
2394                 /*
2395                         Set block as modified
2396                 */
2397                 block->raiseModified(MOD_STATE_WRITE_NEEDED,
2398                         MOD_REASON_EXPIRE_DAYNIGHTDIFF);
2399         }
2400
2401         /*
2402                 Set central blocks as generated
2403         */
2404         for (s16 x = bpmin.X; x <= bpmax.X; x++)
2405         for (s16 z = bpmin.Z; z <= bpmax.Z; z++)
2406         for (s16 y = bpmin.Y; y <= bpmax.Y; y++) {
2407                 MapBlock *block = getBlockNoCreateNoEx(v3s16(x, y, z));
2408                 if (!block)
2409                         continue;
2410
2411                 block->setGenerated(true);
2412         }
2413
2414         /*
2415                 Save changed parts of map
2416                 NOTE: Will be saved later.
2417         */
2418         //save(MOD_STATE_WRITE_AT_UNLOAD);
2419 }
2420
2421 ServerMapSector *ServerMap::createSector(v2s16 p2d)
2422 {
2423         DSTACKF("%s: p2d=(%d,%d)",
2424                         FUNCTION_NAME,
2425                         p2d.X, p2d.Y);
2426
2427         /*
2428                 Check if it exists already in memory
2429         */
2430         ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2431         if(sector != NULL)
2432                 return sector;
2433
2434         /*
2435                 Try to load it from disk (with blocks)
2436         */
2437         //if(loadSectorFull(p2d) == true)
2438
2439         /*
2440                 Try to load metadata from disk
2441         */
2442 #if 0
2443         if(loadSectorMeta(p2d) == true)
2444         {
2445                 ServerMapSector *sector = (ServerMapSector*)getSectorNoGenerateNoEx(p2d);
2446                 if(sector == NULL)
2447                 {
2448                         infostream<<"ServerMap::createSector(): loadSectorFull didn't make a sector"<<std::endl;
2449                         throw InvalidPositionException("");
2450                 }
2451                 return sector;
2452         }
2453 #endif
2454         /*
2455                 Do not create over-limit
2456         */
2457         const static u16 map_gen_limit = MYMIN(MAX_MAP_GENERATION_LIMIT,
2458                 g_settings->getU16("map_generation_limit"));
2459         if(p2d.X < -map_gen_limit / MAP_BLOCKSIZE
2460                         || p2d.X >  map_gen_limit / MAP_BLOCKSIZE
2461                         || p2d.Y < -map_gen_limit / MAP_BLOCKSIZE
2462                         || p2d.Y >  map_gen_limit / MAP_BLOCKSIZE)
2463                 throw InvalidPositionException("createSector(): pos. over limit");
2464
2465         /*
2466                 Generate blank sector
2467         */
2468
2469         sector = new ServerMapSector(this, p2d, m_gamedef);
2470
2471         // Sector position on map in nodes
2472         //v2s16 nodepos2d = p2d * MAP_BLOCKSIZE;
2473
2474         /*
2475                 Insert to container
2476         */
2477         m_sectors[p2d] = sector;
2478
2479         return sector;
2480 }
2481
2482 #if 0
2483 /*
2484         This is a quick-hand function for calling makeBlock().
2485 */
2486 MapBlock * ServerMap::generateBlock(
2487                 v3s16 p,
2488                 std::map<v3s16, MapBlock*> &modified_blocks
2489 )
2490 {
2491         DSTACKF("%s: p=(%d,%d,%d)", FUNCTION_NAME, p.X, p.Y, p.Z);
2492
2493         /*infostream<<"generateBlock(): "
2494                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2495                         <<std::endl;*/
2496
2497         bool enable_mapgen_debug_info = g_settings->getBool("enable_mapgen_debug_info");
2498
2499         TimeTaker timer("generateBlock");
2500
2501         //MapBlock *block = original_dummy;
2502
2503         v2s16 p2d(p.X, p.Z);
2504         v2s16 p2d_nodes = p2d * MAP_BLOCKSIZE;
2505
2506         /*
2507                 Do not generate over-limit
2508         */
2509         if(blockpos_over_limit(p))
2510         {
2511                 infostream<<FUNCTION_NAME<<": Block position over limit"<<std::endl;
2512                 throw InvalidPositionException("generateBlock(): pos. over limit");
2513         }
2514
2515         /*
2516                 Create block make data
2517         */
2518         BlockMakeData data;
2519         initBlockMake(&data, p);
2520
2521         /*
2522                 Generate block
2523         */
2524         {
2525                 TimeTaker t("mapgen::make_block()");
2526                 mapgen->makeChunk(&data);
2527                 //mapgen::make_block(&data);
2528
2529                 if(enable_mapgen_debug_info == false)
2530                         t.stop(true); // Hide output
2531         }
2532
2533         /*
2534                 Blit data back on map, update lighting, add mobs and whatever this does
2535         */
2536         finishBlockMake(&data, modified_blocks);
2537
2538         /*
2539                 Get central block
2540         */
2541         MapBlock *block = getBlockNoCreateNoEx(p);
2542
2543 #if 0
2544         /*
2545                 Check result
2546         */
2547         if(block)
2548         {
2549                 bool erroneus_content = false;
2550                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2551                 for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2552                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2553                 {
2554                         v3s16 p(x0,y0,z0);
2555                         MapNode n = block->getNode(p);
2556                         if(n.getContent() == CONTENT_IGNORE)
2557                         {
2558                                 infostream<<"CONTENT_IGNORE at "
2559                                                 <<"("<<p.X<<","<<p.Y<<","<<p.Z<<")"
2560                                                 <<std::endl;
2561                                 erroneus_content = true;
2562                                 assert(0);
2563                         }
2564                 }
2565                 if(erroneus_content)
2566                 {
2567                         assert(0);
2568                 }
2569         }
2570 #endif
2571
2572 #if 0
2573         /*
2574                 Generate a completely empty block
2575         */
2576         if(block)
2577         {
2578                 for(s16 z0=0; z0<MAP_BLOCKSIZE; z0++)
2579                 for(s16 x0=0; x0<MAP_BLOCKSIZE; x0++)
2580                 {
2581                         for(s16 y0=0; y0<MAP_BLOCKSIZE; y0++)
2582                         {
2583                                 MapNode n;
2584                                 n.setContent(CONTENT_AIR);
2585                                 block->setNode(v3s16(x0,y0,z0), n);
2586                         }
2587                 }
2588         }
2589 #endif
2590
2591         if(enable_mapgen_debug_info == false)
2592                 timer.stop(true); // Hide output
2593
2594         return block;
2595 }
2596 #endif
2597
2598 MapBlock * ServerMap::createBlock(v3s16 p)
2599 {
2600         DSTACKF("%s: p=(%d,%d,%d)",
2601                         FUNCTION_NAME, p.X, p.Y, p.Z);
2602
2603         /*
2604                 Do not create over-limit
2605         */
2606         if (blockpos_over_limit(p))
2607                 throw InvalidPositionException("createBlock(): pos. over limit");
2608
2609         v2s16 p2d(p.X, p.Z);
2610         s16 block_y = p.Y;
2611         /*
2612                 This will create or load a sector if not found in memory.
2613                 If block exists on disk, it will be loaded.
2614
2615                 NOTE: On old save formats, this will be slow, as it generates
2616                       lighting on blocks for them.
2617         */
2618         ServerMapSector *sector;
2619         try {
2620                 sector = (ServerMapSector*)createSector(p2d);
2621                 assert(sector->getId() == MAPSECTOR_SERVER);
2622         }
2623         catch(InvalidPositionException &e)
2624         {
2625                 infostream<<"createBlock: createSector() failed"<<std::endl;
2626                 throw e;
2627         }
2628         /*
2629                 NOTE: This should not be done, or at least the exception
2630                 should not be passed on as std::exception, because it
2631                 won't be catched at all.
2632         */
2633         /*catch(std::exception &e)
2634         {
2635                 infostream<<"createBlock: createSector() failed: "
2636                                 <<e.what()<<std::endl;
2637                 throw e;
2638         }*/
2639
2640         /*
2641                 Try to get a block from the sector
2642         */
2643
2644         MapBlock *block = sector->getBlockNoCreateNoEx(block_y);
2645         if(block)
2646         {
2647                 if(block->isDummy())
2648                         block->unDummify();
2649                 return block;
2650         }
2651         // Create blank
2652         block = sector->createBlankBlock(block_y);
2653
2654         return block;
2655 }
2656
2657 MapBlock * ServerMap::emergeBlock(v3s16 p, bool create_blank)
2658 {
2659         DSTACKF("%s: p=(%d,%d,%d), create_blank=%d",
2660                         FUNCTION_NAME,
2661                         p.X, p.Y, p.Z, create_blank);
2662
2663         {
2664                 MapBlock *block = getBlockNoCreateNoEx(p);
2665                 if(block && block->isDummy() == false)
2666                         return block;
2667         }
2668
2669         {
2670                 MapBlock *block = loadBlock(p);
2671                 if(block)
2672                         return block;
2673         }
2674
2675         if (create_blank) {
2676                 ServerMapSector *sector = createSector(v2s16(p.X, p.Z));
2677                 MapBlock *block = sector->createBlankBlock(p.Y);
2678
2679                 return block;
2680         }
2681
2682 #if 0
2683         if(allow_generate)
2684         {
2685                 std::map<v3s16, MapBlock*> modified_blocks;
2686                 MapBlock *block = generateBlock(p, modified_blocks);
2687                 if(block)
2688                 {
2689                         MapEditEvent event;
2690                         event.type = MEET_OTHER;
2691                         event.p = p;
2692
2693                         // Copy modified_blocks to event
2694                         for(std::map<v3s16, MapBlock*>::iterator
2695                                         i = modified_blocks.begin();
2696                                         i != modified_blocks.end(); ++i)
2697                         {
2698                                 event.modified_blocks.insert(i->first);
2699                         }
2700
2701                         // Queue event
2702                         dispatchEvent(&event);
2703
2704                         return block;
2705                 }
2706         }
2707 #endif
2708
2709         return NULL;
2710 }
2711
2712 MapBlock *ServerMap::getBlockOrEmerge(v3s16 p3d)
2713 {
2714         MapBlock *block = getBlockNoCreateNoEx(p3d);
2715         if (block == NULL)
2716                 m_emerge->enqueueBlockEmerge(PEER_ID_INEXISTENT, p3d, false);
2717
2718         return block;
2719 }
2720
2721 void ServerMap::prepareBlock(MapBlock *block) {
2722 }
2723
2724 // N.B.  This requires no synchronization, since data will not be modified unless
2725 // the VoxelManipulator being updated belongs to the same thread.
2726 void ServerMap::updateVManip(v3s16 pos)
2727 {
2728         Mapgen *mg = m_emerge->getCurrentMapgen();
2729         if (!mg)
2730                 return;
2731
2732         MMVManip *vm = mg->vm;
2733         if (!vm)
2734                 return;
2735
2736         if (!vm->m_area.contains(pos))
2737                 return;
2738
2739         s32 idx = vm->m_area.index(pos);
2740         vm->m_data[idx] = getNodeNoEx(pos);
2741         vm->m_flags[idx] &= ~VOXELFLAG_NO_DATA;
2742
2743         vm->m_is_dirty = true;
2744 }
2745
2746 s16 ServerMap::findGroundLevel(v2s16 p2d)
2747 {
2748 #if 0
2749         /*
2750                 Uh, just do something random...
2751         */
2752         // Find existing map from top to down
2753         s16 max=63;
2754         s16 min=-64;
2755         v3s16 p(p2d.X, max, p2d.Y);
2756         for(; p.Y>min; p.Y--)
2757         {
2758                 MapNode n = getNodeNoEx(p);
2759                 if(n.getContent() != CONTENT_IGNORE)
2760                         break;
2761         }
2762         if(p.Y == min)
2763                 goto plan_b;
2764         // If this node is not air, go to plan b
2765         if(getNodeNoEx(p).getContent() != CONTENT_AIR)
2766                 goto plan_b;
2767         // Search existing walkable and return it
2768         for(; p.Y>min; p.Y--)
2769         {
2770                 MapNode n = getNodeNoEx(p);
2771                 if(content_walkable(n.d) && n.getContent() != CONTENT_IGNORE)
2772                         return p.Y;
2773         }
2774
2775         // Move to plan b
2776 plan_b:
2777 #endif
2778
2779         /*
2780                 Determine from map generator noise functions
2781         */
2782
2783         s16 level = m_emerge->getGroundLevelAtPoint(p2d);
2784         return level;
2785
2786         //double level = base_rock_level_2d(m_seed, p2d) + AVERAGE_MUD_AMOUNT;
2787         //return (s16)level;
2788 }
2789
2790 bool ServerMap::loadFromFolders() {
2791         if (!dbase->initialized() &&
2792                         !fs::PathExists(m_savedir + DIR_DELIM + "map.sqlite"))
2793                 return true;
2794         return false;
2795 }
2796
2797 void ServerMap::createDirs(std::string path)
2798 {
2799         if(fs::CreateAllDirs(path) == false)
2800         {
2801                 m_dout<<"ServerMap: Failed to create directory "
2802                                 <<"\""<<path<<"\""<<std::endl;
2803                 throw BaseException("ServerMap failed to create directory");
2804         }
2805 }
2806
2807 std::string ServerMap::getSectorDir(v2s16 pos, int layout)
2808 {
2809         char cc[9];
2810         switch(layout)
2811         {
2812                 case 1:
2813                         snprintf(cc, 9, "%.4x%.4x",
2814                                 (unsigned int) pos.X & 0xffff,
2815                                 (unsigned int) pos.Y & 0xffff);
2816
2817                         return m_savedir + DIR_DELIM + "sectors" + DIR_DELIM + cc;
2818                 case 2:
2819                         snprintf(cc, 9, (std::string("%.3x") + DIR_DELIM + "%.3x").c_str(),
2820                                 (unsigned int) pos.X & 0xfff,
2821                                 (unsigned int) pos.Y & 0xfff);
2822
2823                         return m_savedir + DIR_DELIM + "sectors2" + DIR_DELIM + cc;
2824                 default:
2825                         assert(false);
2826                         return "";
2827         }
2828 }
2829
2830 v2s16 ServerMap::getSectorPos(std::string dirname)
2831 {
2832         unsigned int x = 0, y = 0;
2833         int r;
2834         std::string component;
2835         fs::RemoveLastPathComponent(dirname, &component, 1);
2836         if(component.size() == 8)
2837         {
2838                 // Old layout
2839                 r = sscanf(component.c_str(), "%4x%4x", &x, &y);
2840         }
2841         else if(component.size() == 3)
2842         {
2843                 // New layout
2844                 fs::RemoveLastPathComponent(dirname, &component, 2);
2845                 r = sscanf(component.c_str(), (std::string("%3x") + DIR_DELIM + "%3x").c_str(), &x, &y);
2846                 // Sign-extend the 12 bit values up to 16 bits...
2847                 if(x & 0x800) x |= 0xF000;
2848                 if(y & 0x800) y |= 0xF000;
2849         }
2850         else
2851         {
2852                 r = -1;
2853         }
2854
2855         FATAL_ERROR_IF(r != 2, "getSectorPos()");
2856         v2s16 pos((s16)x, (s16)y);
2857         return pos;
2858 }
2859
2860 v3s16 ServerMap::getBlockPos(std::string sectordir, std::string blockfile)
2861 {
2862         v2s16 p2d = getSectorPos(sectordir);
2863
2864         if(blockfile.size() != 4){
2865                 throw InvalidFilenameException("Invalid block filename");
2866         }
2867         unsigned int y;
2868         int r = sscanf(blockfile.c_str(), "%4x", &y);
2869         if(r != 1)
2870                 throw InvalidFilenameException("Invalid block filename");
2871         return v3s16(p2d.X, y, p2d.Y);
2872 }
2873
2874 std::string ServerMap::getBlockFilename(v3s16 p)
2875 {
2876         char cc[5];
2877         snprintf(cc, 5, "%.4x", (unsigned int)p.Y&0xffff);
2878         return cc;
2879 }
2880
2881 void ServerMap::save(ModifiedState save_level)
2882 {
2883         DSTACK(FUNCTION_NAME);
2884         if(m_map_saving_enabled == false) {
2885                 warningstream<<"Not saving map, saving disabled."<<std::endl;
2886                 return;
2887         }
2888
2889         if(save_level == MOD_STATE_CLEAN)
2890                 infostream<<"ServerMap: Saving whole map, this can take time."
2891                                 <<std::endl;
2892
2893         if(m_map_metadata_changed || save_level == MOD_STATE_CLEAN) {
2894                 saveMapMeta();
2895         }
2896
2897         // Profile modified reasons
2898         Profiler modprofiler;
2899
2900         u32 sector_meta_count = 0;
2901         u32 block_count = 0;
2902         u32 block_count_all = 0; // Number of blocks in memory
2903
2904         // Don't do anything with sqlite unless something is really saved
2905         bool save_started = false;
2906
2907         for(std::map<v2s16, MapSector*>::iterator i = m_sectors.begin();
2908                 i != m_sectors.end(); ++i) {
2909                 ServerMapSector *sector = (ServerMapSector*)i->second;
2910                 assert(sector->getId() == MAPSECTOR_SERVER);
2911
2912                 if(sector->differs_from_disk || save_level == MOD_STATE_CLEAN) {
2913                         saveSectorMeta(sector);
2914                         sector_meta_count++;
2915                 }
2916
2917                 MapBlockVect blocks;
2918                 sector->getBlocks(blocks);
2919
2920                 for(MapBlockVect::iterator j = blocks.begin();
2921                         j != blocks.end(); ++j) {
2922                         MapBlock *block = *j;
2923
2924                         block_count_all++;
2925
2926                         if(block->getModified() >= (u32)save_level) {
2927                                 // Lazy beginSave()
2928                                 if(!save_started) {
2929                                         beginSave();
2930                                         save_started = true;
2931                                 }
2932
2933                                 modprofiler.add(block->getModifiedReasonString(), 1);
2934
2935                                 saveBlock(block);
2936                                 block_count++;
2937
2938                                 /*infostream<<"ServerMap: Written block ("
2939                                                 <<block->getPos().X<<","
2940                                                 <<block->getPos().Y<<","
2941                                                 <<block->getPos().Z<<")"
2942                                                 <<std::endl;*/
2943                         }
2944                 }
2945         }
2946
2947         if(save_started)
2948                 endSave();
2949
2950         /*
2951                 Only print if something happened or saved whole map
2952         */
2953         if(save_level == MOD_STATE_CLEAN || sector_meta_count != 0
2954                         || block_count != 0) {
2955                 infostream<<"ServerMap: Written: "
2956                                 <<sector_meta_count<<" sector metadata files, "
2957                                 <<block_count<<" block files"
2958                                 <<", "<<block_count_all<<" blocks in memory."
2959                                 <<std::endl;
2960                 PrintInfo(infostream); // ServerMap/ClientMap:
2961                 infostream<<"Blocks modified by: "<<std::endl;
2962                 modprofiler.print(infostream);
2963         }
2964 }
2965
2966 void ServerMap::listAllLoadableBlocks(std::vector<v3s16> &dst)
2967 {
2968         if (loadFromFolders()) {
2969                 errorstream << "Map::listAllLoadableBlocks(): Result will be missing "
2970                                 << "all blocks that are stored in flat files." << std::endl;
2971         }
2972         dbase->listAllLoadableBlocks(dst);
2973 }
2974
2975 void ServerMap::listAllLoadedBlocks(std::vector<v3s16> &dst)
2976 {
2977         for(std::map<v2s16, MapSector*>::iterator si = m_sectors.begin();
2978                 si != m_sectors.end(); ++si)
2979         {
2980                 MapSector *sector = si->second;
2981
2982                 MapBlockVect blocks;
2983                 sector->getBlocks(blocks);
2984
2985                 for(MapBlockVect::iterator i = blocks.begin();
2986                                 i != blocks.end(); ++i) {
2987                         v3s16 p = (*i)->getPos();
2988                         dst.push_back(p);
2989                 }
2990         }
2991 }
2992
2993 void ServerMap::saveMapMeta()
2994 {
2995         DSTACK(FUNCTION_NAME);
2996
2997         createDirs(m_savedir);
2998
2999         std::string fullpath = m_savedir + DIR_DELIM + "map_meta.txt";
3000         std::ostringstream oss(std::ios_base::binary);
3001         Settings conf;
3002
3003         m_emerge->params.save(conf);
3004         conf.writeLines(oss);
3005
3006         oss << "[end_of_params]\n";
3007
3008         if(!fs::safeWriteToFile(fullpath, oss.str())) {
3009                 errorstream << "ServerMap::saveMapMeta(): "
3010                                 << "could not write " << fullpath << std::endl;
3011                 throw FileNotGoodException("Cannot save chunk metadata");
3012         }
3013
3014         m_map_metadata_changed = false;
3015 }
3016
3017 void ServerMap::loadMapMeta()
3018 {
3019         DSTACK(FUNCTION_NAME);
3020
3021         Settings conf;
3022         std::string fullpath = m_savedir + DIR_DELIM + "map_meta.txt";
3023
3024         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3025         if (!is.good()) {
3026                 errorstream << "ServerMap::loadMapMeta(): "
3027                         "could not open " << fullpath << std::endl;
3028                 throw FileNotGoodException("Cannot open map metadata");
3029         }
3030
3031         if (!conf.parseConfigLines(is, "[end_of_params]")) {
3032                 throw SerializationError("ServerMap::loadMapMeta(): "
3033                                 "[end_of_params] not found!");
3034         }
3035
3036         m_emerge->params.load(conf);
3037
3038         verbosestream << "ServerMap::loadMapMeta(): seed="
3039                 << m_emerge->params.seed << std::endl;
3040 }
3041
3042 void ServerMap::saveSectorMeta(ServerMapSector *sector)
3043 {
3044         DSTACK(FUNCTION_NAME);
3045         // Format used for writing
3046         u8 version = SER_FMT_VER_HIGHEST_WRITE;
3047         // Get destination
3048         v2s16 pos = sector->getPos();
3049         std::string dir = getSectorDir(pos);
3050         createDirs(dir);
3051
3052         std::string fullpath = dir + DIR_DELIM + "meta";
3053         std::ostringstream ss(std::ios_base::binary);
3054
3055         sector->serialize(ss, version);
3056
3057         if(!fs::safeWriteToFile(fullpath, ss.str()))
3058                 throw FileNotGoodException("Cannot write sector metafile");
3059
3060         sector->differs_from_disk = false;
3061 }
3062
3063 MapSector* ServerMap::loadSectorMeta(std::string sectordir, bool save_after_load)
3064 {
3065         DSTACK(FUNCTION_NAME);
3066         // Get destination
3067         v2s16 p2d = getSectorPos(sectordir);
3068
3069         ServerMapSector *sector = NULL;
3070
3071         std::string fullpath = sectordir + DIR_DELIM + "meta";
3072         std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3073         if(is.good() == false)
3074         {
3075                 // If the directory exists anyway, it probably is in some old
3076                 // format. Just go ahead and create the sector.
3077                 if(fs::PathExists(sectordir))
3078                 {
3079                         /*infostream<<"ServerMap::loadSectorMeta(): Sector metafile "
3080                                         <<fullpath<<" doesn't exist but directory does."
3081                                         <<" Continuing with a sector with no metadata."
3082                                         <<std::endl;*/
3083                         sector = new ServerMapSector(this, p2d, m_gamedef);
3084                         m_sectors[p2d] = sector;
3085                 }
3086                 else
3087                 {
3088                         throw FileNotGoodException("Cannot open sector metafile");
3089                 }
3090         }
3091         else
3092         {
3093                 sector = ServerMapSector::deSerialize
3094                                 (is, this, p2d, m_sectors, m_gamedef);
3095                 if(save_after_load)
3096                         saveSectorMeta(sector);
3097         }
3098
3099         sector->differs_from_disk = false;
3100
3101         return sector;
3102 }
3103
3104 bool ServerMap::loadSectorMeta(v2s16 p2d)
3105 {
3106         DSTACK(FUNCTION_NAME);
3107
3108         // The directory layout we're going to load from.
3109         //  1 - original sectors/xxxxzzzz/
3110         //  2 - new sectors2/xxx/zzz/
3111         //  If we load from anything but the latest structure, we will
3112         //  immediately save to the new one, and remove the old.
3113         int loadlayout = 1;
3114         std::string sectordir1 = getSectorDir(p2d, 1);
3115         std::string sectordir;
3116         if(fs::PathExists(sectordir1))
3117         {
3118                 sectordir = sectordir1;
3119         }
3120         else
3121         {
3122                 loadlayout = 2;
3123                 sectordir = getSectorDir(p2d, 2);
3124         }
3125
3126         try{
3127                 loadSectorMeta(sectordir, loadlayout != 2);
3128         }
3129         catch(InvalidFilenameException &e)
3130         {
3131                 return false;
3132         }
3133         catch(FileNotGoodException &e)
3134         {
3135                 return false;
3136         }
3137         catch(std::exception &e)
3138         {
3139                 return false;
3140         }
3141
3142         return true;
3143 }
3144
3145 #if 0
3146 bool ServerMap::loadSectorFull(v2s16 p2d)
3147 {
3148         DSTACK(FUNCTION_NAME);
3149
3150         MapSector *sector = NULL;
3151
3152         // The directory layout we're going to load from.
3153         //  1 - original sectors/xxxxzzzz/
3154         //  2 - new sectors2/xxx/zzz/
3155         //  If we load from anything but the latest structure, we will
3156         //  immediately save to the new one, and remove the old.
3157         int loadlayout = 1;
3158         std::string sectordir1 = getSectorDir(p2d, 1);
3159         std::string sectordir;
3160         if(fs::PathExists(sectordir1))
3161         {
3162                 sectordir = sectordir1;
3163         }
3164         else
3165         {
3166                 loadlayout = 2;
3167                 sectordir = getSectorDir(p2d, 2);
3168         }
3169
3170         try{
3171                 sector = loadSectorMeta(sectordir, loadlayout != 2);
3172         }
3173         catch(InvalidFilenameException &e)
3174         {
3175                 return false;
3176         }
3177         catch(FileNotGoodException &e)
3178         {
3179                 return false;
3180         }
3181         catch(std::exception &e)
3182         {
3183                 return false;
3184         }
3185
3186         /*
3187                 Load blocks
3188         */
3189         std::vector<fs::DirListNode> list2 = fs::GetDirListing
3190                         (sectordir);
3191         std::vector<fs::DirListNode>::iterator i2;
3192         for(i2=list2.begin(); i2!=list2.end(); i2++)
3193         {
3194                 // We want files
3195                 if(i2->dir)
3196                         continue;
3197                 try{
3198                         loadBlock(sectordir, i2->name, sector, loadlayout != 2);
3199                 }
3200                 catch(InvalidFilenameException &e)
3201                 {
3202                         // This catches unknown crap in directory
3203                 }
3204         }
3205
3206         if(loadlayout != 2)
3207         {
3208                 infostream<<"Sector converted to new layout - deleting "<<
3209                         sectordir1<<std::endl;
3210                 fs::RecursiveDelete(sectordir1);
3211         }
3212
3213         return true;
3214 }
3215 #endif
3216
3217 Database *ServerMap::createDatabase(
3218         const std::string &name,
3219         const std::string &savedir,
3220         Settings &conf)
3221 {
3222         if (name == "sqlite3")
3223                 return new Database_SQLite3(savedir);
3224         if (name == "dummy")
3225                 return new Database_Dummy();
3226         #if USE_LEVELDB
3227         else if (name == "leveldb")
3228                 return new Database_LevelDB(savedir);
3229         #endif
3230         #if USE_REDIS
3231         else if (name == "redis")
3232                 return new Database_Redis(conf);
3233         #endif
3234         else
3235                 throw BaseException(std::string("Database backend ") + name + " not supported.");
3236 }
3237
3238 void ServerMap::beginSave()
3239 {
3240         dbase->beginSave();
3241 }
3242
3243 void ServerMap::endSave()
3244 {
3245         dbase->endSave();
3246 }
3247
3248 bool ServerMap::saveBlock(MapBlock *block)
3249 {
3250         return saveBlock(block, dbase);
3251 }
3252
3253 bool ServerMap::saveBlock(MapBlock *block, Database *db)
3254 {
3255         v3s16 p3d = block->getPos();
3256
3257         // Dummy blocks are not written
3258         if (block->isDummy()) {
3259                 warningstream << "saveBlock: Not writing dummy block "
3260                         << PP(p3d) << std::endl;
3261                 return true;
3262         }
3263
3264         // Format used for writing
3265         u8 version = SER_FMT_VER_HIGHEST_WRITE;
3266
3267         /*
3268                 [0] u8 serialization version
3269                 [1] data
3270         */
3271         std::ostringstream o(std::ios_base::binary);
3272         o.write((char*) &version, 1);
3273         block->serialize(o, version, true);
3274
3275         std::string data = o.str();
3276         bool ret = db->saveBlock(p3d, data);
3277         if (ret) {
3278                 // We just wrote it to the disk so clear modified flag
3279                 block->resetModified();
3280         }
3281         return ret;
3282 }
3283
3284 void ServerMap::loadBlock(std::string sectordir, std::string blockfile,
3285                 MapSector *sector, bool save_after_load)
3286 {
3287         DSTACK(FUNCTION_NAME);
3288
3289         std::string fullpath = sectordir + DIR_DELIM + blockfile;
3290         try {
3291
3292                 std::ifstream is(fullpath.c_str(), std::ios_base::binary);
3293                 if(is.good() == false)
3294                         throw FileNotGoodException("Cannot open block file");
3295
3296                 v3s16 p3d = getBlockPos(sectordir, blockfile);
3297                 v2s16 p2d(p3d.X, p3d.Z);
3298
3299                 assert(sector->getPos() == p2d);
3300
3301                 u8 version = SER_FMT_VER_INVALID;
3302                 is.read((char*)&version, 1);
3303
3304                 if(is.fail())
3305                         throw SerializationError("ServerMap::loadBlock(): Failed"
3306                                         " to read MapBlock version");
3307
3308                 /*u32 block_size = MapBlock::serializedLength(version);
3309                 SharedBuffer<u8> data(block_size);
3310                 is.read((char*)*data, block_size);*/
3311
3312                 // This will always return a sector because we're the server
3313                 //MapSector *sector = emergeSector(p2d);
3314
3315                 MapBlock *block = NULL;
3316                 bool created_new = false;
3317                 block = sector->getBlockNoCreateNoEx(p3d.Y);
3318                 if(block == NULL)
3319                 {
3320                         block = sector->createBlankBlockNoInsert(p3d.Y);
3321                         created_new = true;
3322                 }
3323
3324                 // Read basic data
3325                 block->deSerialize(is, version, true);
3326
3327                 // If it's a new block, insert it to the map
3328                 if(created_new)
3329                         sector->insertBlock(block);
3330
3331                 /*
3332                         Save blocks loaded in old format in new format
3333                 */
3334
3335                 if(version < SER_FMT_VER_HIGHEST_WRITE || save_after_load)
3336                 {
3337                         saveBlock(block);
3338
3339                         // Should be in database now, so delete the old file
3340                         fs::RecursiveDelete(fullpath);
3341                 }
3342
3343                 // We just loaded it from the disk, so it's up-to-date.
3344                 block->resetModified();
3345
3346         }
3347         catch(SerializationError &e)
3348         {
3349                 warningstream<<"Invalid block data on disk "
3350                                 <<"fullpath="<<fullpath
3351                                 <<" (SerializationError). "
3352                                 <<"what()="<<e.what()
3353                                 <<std::endl;
3354                                 // Ignoring. A new one will be generated.
3355                 abort();
3356
3357                 // TODO: Backup file; name is in fullpath.
3358         }
3359 }
3360
3361 void ServerMap::loadBlock(std::string *blob, v3s16 p3d, MapSector *sector, bool save_after_load)
3362 {
3363         DSTACK(FUNCTION_NAME);
3364
3365         try {
3366                 std::istringstream is(*blob, std::ios_base::binary);
3367
3368                 u8 version = SER_FMT_VER_INVALID;
3369                 is.read((char*)&version, 1);
3370
3371                 if(is.fail())
3372                         throw SerializationError("ServerMap::loadBlock(): Failed"
3373                                         " to read MapBlock version");
3374
3375                 /*u32 block_size = MapBlock::serializedLength(version);
3376                 SharedBuffer<u8> data(block_size);
3377                 is.read((char*)*data, block_size);*/
3378
3379                 // This will always return a sector because we're the server
3380                 //MapSector *sector = emergeSector(p2d);
3381
3382                 MapBlock *block = NULL;
3383                 bool created_new = false;
3384                 block = sector->getBlockNoCreateNoEx(p3d.Y);
3385                 if(block == NULL)
3386                 {
3387                         block = sector->createBlankBlockNoInsert(p3d.Y);
3388                         created_new = true;
3389                 }
3390
3391                 // Read basic data
3392                 block->deSerialize(is, version, true);
3393
3394                 // If it's a new block, insert it to the map
3395                 if(created_new)
3396                         sector->insertBlock(block);
3397
3398                 /*
3399                         Save blocks loaded in old format in new format
3400                 */
3401
3402                 //if(version < SER_FMT_VER_HIGHEST_READ || save_after_load)
3403                 // Only save if asked to; no need to update version
3404                 if(save_after_load)
3405                         saveBlock(block);
3406
3407                 // We just loaded it from, so it's up-to-date.
3408                 block->resetModified();
3409
3410         }
3411         catch(SerializationError &e)
3412         {
3413                 errorstream<<"Invalid block data in database"
3414                                 <<" ("<<p3d.X<<","<<p3d.Y<<","<<p3d.Z<<")"
3415                                 <<" (SerializationError): "<<e.what()<<std::endl;
3416
3417                 // TODO: Block should be marked as invalid in memory so that it is
3418                 // not touched but the game can run
3419
3420                 if(g_settings->getBool("ignore_world_load_errors")){
3421                         errorstream<<"Ignoring block load error. Duck and cover! "
3422                                         <<"(ignore_world_load_errors)"<<std::endl;
3423                 } else {
3424                         throw SerializationError("Invalid block data in database");
3425                 }
3426         }
3427 }
3428
3429 MapBlock* ServerMap::loadBlock(v3s16 blockpos)
3430 {
3431         DSTACK(FUNCTION_NAME);
3432
3433         v2s16 p2d(blockpos.X, blockpos.Z);
3434
3435         std::string ret;
3436
3437         ret = dbase->loadBlock(blockpos);
3438         if (ret != "") {
3439                 loadBlock(&ret, blockpos, createSector(p2d), false);
3440                 return getBlockNoCreateNoEx(blockpos);
3441         }
3442         // Not found in database, try the files
3443
3444         // The directory layout we're going to load from.
3445         //  1 - original sectors/xxxxzzzz/
3446         //  2 - new sectors2/xxx/zzz/
3447         //  If we load from anything but the latest structure, we will
3448         //  immediately save to the new one, and remove the old.
3449         int loadlayout = 1;
3450         std::string sectordir1 = getSectorDir(p2d, 1);
3451         std::string sectordir;
3452         if(fs::PathExists(sectordir1))
3453         {
3454                 sectordir = sectordir1;
3455         }
3456         else
3457         {
3458                 loadlayout = 2;
3459                 sectordir = getSectorDir(p2d, 2);
3460         }
3461
3462         /*
3463                 Make sure sector is loaded
3464         */
3465
3466         MapSector *sector = getSectorNoGenerateNoEx(p2d);
3467         if(sector == NULL)
3468         {
3469                 try{
3470                         sector = loadSectorMeta(sectordir, loadlayout != 2);
3471                 }
3472                 catch(InvalidFilenameException &e)
3473                 {
3474                         return NULL;
3475                 }
3476                 catch(FileNotGoodException &e)
3477                 {
3478                         return NULL;
3479                 }
3480                 catch(std::exception &e)
3481                 {
3482                         return NULL;
3483                 }
3484         }
3485
3486         /*
3487                 Make sure file exists
3488         */
3489
3490         std::string blockfilename = getBlockFilename(blockpos);
3491         if(fs::PathExists(sectordir + DIR_DELIM + blockfilename) == false)
3492                 return NULL;
3493
3494         /*
3495                 Load block and save it to the database
3496         */
3497         loadBlock(sectordir, blockfilename, sector, true);
3498         return getBlockNoCreateNoEx(blockpos);
3499 }
3500
3501 bool ServerMap::deleteBlock(v3s16 blockpos)
3502 {
3503         if (!dbase->deleteBlock(blockpos))
3504                 return false;
3505
3506         MapBlock *block = getBlockNoCreateNoEx(blockpos);
3507         if (block) {
3508                 v2s16 p2d(blockpos.X, blockpos.Z);
3509                 MapSector *sector = getSectorNoGenerateNoEx(p2d);
3510                 if (!sector)
3511                         return false;
3512                 sector->deleteBlock(block);
3513         }
3514
3515         return true;
3516 }
3517
3518 void ServerMap::PrintInfo(std::ostream &out)
3519 {
3520         out<<"ServerMap: ";
3521 }
3522
3523 MMVManip::MMVManip(Map *map):
3524                 VoxelManipulator(),
3525                 m_is_dirty(false),
3526                 m_create_area(false),
3527                 m_map(map)
3528 {
3529 }
3530
3531 MMVManip::~MMVManip()
3532 {
3533 }
3534
3535 void MMVManip::initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
3536         bool load_if_inexistent)
3537 {
3538         TimeTaker timer1("initialEmerge", &emerge_time);
3539
3540         // Units of these are MapBlocks
3541         v3s16 p_min = blockpos_min;
3542         v3s16 p_max = blockpos_max;
3543
3544         VoxelArea block_area_nodes
3545                         (p_min*MAP_BLOCKSIZE, (p_max+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3546
3547         u32 size_MB = block_area_nodes.getVolume()*4/1000000;
3548         if(size_MB >= 1)
3549         {
3550                 infostream<<"initialEmerge: area: ";
3551                 block_area_nodes.print(infostream);
3552                 infostream<<" ("<<size_MB<<"MB)";
3553                 infostream<<std::endl;
3554         }
3555
3556         addArea(block_area_nodes);
3557
3558         for(s32 z=p_min.Z; z<=p_max.Z; z++)
3559         for(s32 y=p_min.Y; y<=p_max.Y; y++)
3560         for(s32 x=p_min.X; x<=p_max.X; x++)
3561         {
3562                 u8 flags = 0;
3563                 MapBlock *block;
3564                 v3s16 p(x,y,z);
3565                 std::map<v3s16, u8>::iterator n;
3566                 n = m_loaded_blocks.find(p);
3567                 if(n != m_loaded_blocks.end())
3568                         continue;
3569
3570                 bool block_data_inexistent = false;
3571                 try
3572                 {
3573                         TimeTaker timer1("emerge load", &emerge_load_time);
3574
3575                         block = m_map->getBlockNoCreate(p);
3576                         if(block->isDummy())
3577                                 block_data_inexistent = true;
3578                         else
3579                                 block->copyTo(*this);
3580                 }
3581                 catch(InvalidPositionException &e)
3582                 {
3583                         block_data_inexistent = true;
3584                 }
3585
3586                 if(block_data_inexistent)
3587                 {
3588
3589                         if (load_if_inexistent) {
3590                                 ServerMap *svrmap = (ServerMap *)m_map;
3591                                 block = svrmap->emergeBlock(p, false);
3592                                 if (block == NULL)
3593                                         block = svrmap->createBlock(p);
3594                                 block->copyTo(*this);
3595                         } else {
3596                                 flags |= VMANIP_BLOCK_DATA_INEXIST;
3597
3598                                 /*
3599                                         Mark area inexistent
3600                                 */
3601                                 VoxelArea a(p*MAP_BLOCKSIZE, (p+1)*MAP_BLOCKSIZE-v3s16(1,1,1));
3602                                 // Fill with VOXELFLAG_NO_DATA
3603                                 for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
3604                                 for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
3605                                 {
3606                                         s32 i = m_area.index(a.MinEdge.X,y,z);
3607                                         memset(&m_flags[i], VOXELFLAG_NO_DATA, MAP_BLOCKSIZE);
3608                                 }
3609                         }
3610                 }
3611                 /*else if (block->getNode(0, 0, 0).getContent() == CONTENT_IGNORE)
3612                 {
3613                         // Mark that block was loaded as blank
3614                         flags |= VMANIP_BLOCK_CONTAINS_CIGNORE;
3615                 }*/
3616
3617                 m_loaded_blocks[p] = flags;
3618         }
3619
3620         m_is_dirty = false;
3621 }
3622
3623 void MMVManip::blitBackAll(std::map<v3s16, MapBlock*> *modified_blocks,
3624         bool overwrite_generated)
3625 {
3626         if(m_area.getExtent() == v3s16(0,0,0))
3627                 return;
3628
3629         /*
3630                 Copy data of all blocks
3631         */
3632         for(std::map<v3s16, u8>::iterator
3633                         i = m_loaded_blocks.begin();
3634                         i != m_loaded_blocks.end(); ++i)
3635         {
3636                 v3s16 p = i->first;
3637                 MapBlock *block = m_map->getBlockNoCreateNoEx(p);
3638                 bool existed = !(i->second & VMANIP_BLOCK_DATA_INEXIST);
3639                 if ((existed == false) || (block == NULL) ||
3640                         (overwrite_generated == false && block->isGenerated() == true))
3641                         continue;
3642
3643                 block->copyFrom(*this);
3644
3645                 if(modified_blocks)
3646                         (*modified_blocks)[p] = block;
3647         }
3648 }
3649
3650 //END