src/mapgen.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 "mapgen.h"
  21 #include "voxel.h"
  22 #include "noise.h"
  23 #include "biome.h"
  24 #include "mapblock.h"
  25 #include "mapnode.h"
  26 #include "map.h"
  27 //#include "serverobject.h"
  28 #include "content_sao.h"
  29 #include "nodedef.h"
  30 #include "content_mapnode.h" // For content_mapnode_get_new_name
  31 #include "voxelalgorithms.h"
  32 #include "profiler.h"
  33 #include "settings.h" // For g_settings
  34 #include "main.h" // For g_profiler
  35 #include "treegen.h"
  36 #include "mapgen_v6.h"
  37 #include "mapgen_v7.h"
  38 #include "util/serialize.h"
  39
  40 FlagDesc flagdesc_mapgen[] = {
  41         {"trees",          MG_TREES},
  42         {"caves",          MG_CAVES},
  43         {"dungeons",       MG_DUNGEONS},
  44         {"v6_jungles",     MGV6_JUNGLES},
  45         {"v6_biome_blend", MGV6_BIOME_BLEND},
  46         {"flat",           MG_FLAT},
  47         {NULL,             0}
  48 };
  49
  50 FlagDesc flagdesc_ore[] = {
  51         {"absheight",            OREFLAG_ABSHEIGHT},
  52         {"scatter_noisedensity", OREFLAG_DENSITY},
  53         {"claylike_nodeisnt",    OREFLAG_NODEISNT},
  54         {NULL,                   0}
  55 };
  56
  57 FlagDesc flagdesc_deco_schematic[] = {
  58         {"place_center_x", DECO_PLACE_CENTER_X},
  59         {"place_center_y", DECO_PLACE_CENTER_Y},
  60         {"place_center_z", DECO_PLACE_CENTER_Z},
  61         {NULL,             0}
  62 };
  63
  64 ///////////////////////////////////////////////////////////////////////////////
  65
  66
  67 Ore *createOre(OreType type) {
  68         switch (type) {
  69                 case ORE_SCATTER:
  70                         return new OreScatter;
  71                 case ORE_SHEET:
  72                         return new OreSheet;
  73                 //case ORE_CLAYLIKE: //TODO: implement this!
  74                 //      return new OreClaylike;
  75                 default:
  76                         return NULL;
  77         }
  78 }
  79
  80
  81 Ore::~Ore() {
  82         delete np;
  83         delete noise;
  84 }
  85
  86
  87 void Ore::resolveNodeNames(INodeDefManager *ndef) {
  88         if (ore == CONTENT_IGNORE) {
  89                 ore = ndef->getId(ore_name);
  90                 if (ore == CONTENT_IGNORE) {
  91                         errorstream << "Ore::resolveNodeNames: ore node '"
  92                                 << ore_name << "' not defined";
  93                         ore     = CONTENT_AIR;
  94                         wherein = CONTENT_AIR;
  95                 }
  96         }
  97
  98         if (wherein == CONTENT_IGNORE) {
  99                 wherein = ndef->getId(wherein_name);
 100                 if (wherein == CONTENT_IGNORE) {
 101                         errorstream << "Ore::resolveNodeNames: wherein node '"
 102                                 << wherein_name << "' not defined";
 103                         ore     = CONTENT_AIR;
 104                         wherein = CONTENT_AIR;
 105                 }
 106         }
 107 }
 108
 109
 110 void Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
 111         int in_range = 0;
 112
 113         in_range |= (nmin.Y <= height_max && nmax.Y >= height_min);
 114         if (flags & OREFLAG_ABSHEIGHT)
 115                 in_range |= (nmin.Y >= -height_max && nmax.Y <= -height_min) << 1;
 116         if (!in_range)
 117                 return;
 118
 119         int ymin, ymax;
 120         if (in_range & ORE_RANGE_MIRROR) {
 121                 ymin = MYMAX(nmin.Y, -height_max);
 122                 ymax = MYMIN(nmax.Y, -height_min);
 123         } else {
 124                 ymin = MYMAX(nmin.Y, height_min);
 125                 ymax = MYMIN(nmax.Y, height_max);
 126         }
 127         if (clust_size >= ymax - ymin + 1)
 128                 return;
 129
 130         nmin.Y = ymin;
 131         nmax.Y = ymax;
 132         generate(mg->vm, mg->seed, blockseed, nmin, nmax);
 133 }
 134
 135
 136 void OreScatter::generate(ManualMapVoxelManipulator *vm, int seed,
 137                                                   u32 blockseed, v3s16 nmin, v3s16 nmax) {
 138         PseudoRandom pr(blockseed);
 139         MapNode n_ore(ore, 0, ore_param2);
 140
 141         int volume = (nmax.X - nmin.X + 1) *
 142                                  (nmax.Y - nmin.Y + 1) *
 143                                  (nmax.Z - nmin.Z + 1);
 144         int csize     = clust_size;
 145         int orechance = (csize * csize * csize) / clust_num_ores;
 146         int nclusters = volume / clust_scarcity;
 147
 148         for (int i = 0; i != nclusters; i++) {
 149                 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
 150                 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
 151                 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
 152
 153                 if (np && (NoisePerlin3D(np, x0, y0, z0, seed) < nthresh))
 154                         continue;
 155
 156                 for (int z1 = 0; z1 != csize; z1++)
 157                 for (int y1 = 0; y1 != csize; y1++)
 158                 for (int x1 = 0; x1 != csize; x1++) {
 159                         if (pr.range(1, orechance) != 1)
 160                                 continue;
 161
 162                         u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
 163                         if (vm->m_data[i].getContent() == wherein)
 164                                 vm->m_data[i] = n_ore;
 165                 }
 166         }
 167 }
 168
 169
 170 void OreSheet::generate(ManualMapVoxelManipulator *vm, int seed,
 171                                                 u32 blockseed, v3s16 nmin, v3s16 nmax) {
 172         PseudoRandom pr(blockseed + 4234);
 173         MapNode n_ore(ore, 0, ore_param2);
 174
 175         int max_height = clust_size;
 176         int y_start = pr.range(nmin.Y, nmax.Y - max_height);
 177
 178         if (!noise) {
 179                 int sx = nmax.X - nmin.X + 1;
 180                 int sz = nmax.Z - nmin.Z + 1;
 181                 noise = new Noise(np, 0, sx, sz);
 182         }
 183         noise->seed = seed + y_start;
 184         noise->perlinMap2D(nmin.X, nmin.Z);
 185
 186         int index = 0;
 187         for (int z = nmin.Z; z <= nmax.Z; z++)
 188         for (int x = nmin.X; x <= nmax.X; x++) {
 189                 float noiseval = noise->result[index++];
 190                 if (noiseval < nthresh)
 191                         continue;
 192
 193                 int height = max_height * (1. / pr.range(1, 3));
 194                 int y0 = y_start + np->scale * noiseval; //pr.range(1, 3) - 1;
 195                 int y1 = y0 + height;
 196                 for (int y = y0; y != y1; y++) {
 197                         u32 i = vm->m_area.index(x, y, z);
 198                         if (!vm->m_area.contains(i))
 199                                 continue;
 200
 201                         if (vm->m_data[i].getContent() == wherein)
 202                                 vm->m_data[i] = n_ore;
 203                 }
 204         }
 205 }
 206
 207
 208 ///////////////////////////////////////////////////////////////////////////////
 209
 210
 211 Decoration *createDecoration(DecorationType type) {
 212         switch (type) {
 213                 case DECO_SIMPLE:
 214                         return new DecoSimple;
 215                 case DECO_SCHEMATIC:
 216                         return new DecoSchematic;
 217                 //case DECO_LSYSTEM:
 218                 //      return new DecoLSystem;
 219                 default:
 220                         return NULL;
 221         }
 222 }
 223
 224
 225 Decoration::Decoration() {
 226         mapseed    = 0;
 227         np         = NULL;
 228         fill_ratio = 0;
 229         sidelen    = 1;
 230 }
 231
 232
 233 Decoration::~Decoration() {
 234         delete np;
 235 }
 236
 237
 238 void Decoration::resolveNodeNames(INodeDefManager *ndef) {
 239         if (c_place_on == CONTENT_IGNORE)
 240                 c_place_on = ndef->getId(place_on_name);
 241 }
 242
 243
 244 void Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
 245         PseudoRandom ps(blockseed + 53);
 246         int carea_size = nmax.X - nmin.X + 1;
 247
 248         // Divide area into parts
 249         if (carea_size % sidelen) {
 250                 errorstream << "Decoration::placeDeco: chunk size is not divisible by "
 251                         "sidelen; setting sidelen to " << carea_size << std::endl;
 252                 sidelen = carea_size;
 253         }
 254
 255         s16 divlen = carea_size / sidelen;
 256         int area = sidelen * sidelen;
 257
 258         for (s16 z0 = 0; z0 < divlen; z0++)
 259         for (s16 x0 = 0; x0 < divlen; x0++) {
 260                 v2s16 p2d_center( // Center position of part of division
 261                         nmin.X + sidelen / 2 + sidelen * x0,
 262                         nmin.Z + sidelen / 2 + sidelen * z0
 263                 );
 264                 v2s16 p2d_min( // Minimum edge of part of division
 265                         nmin.X + sidelen * x0,
 266                         nmin.Z + sidelen * z0
 267                 );
 268                 v2s16 p2d_max( // Maximum edge of part of division
 269                         nmin.X + sidelen + sidelen * x0 - 1,
 270                         nmin.Z + sidelen + sidelen * z0 - 1
 271                 );
 272
 273                 // Amount of decorations
 274                 float nval = np ?
 275                         NoisePerlin2D(np, p2d_center.X, p2d_center.Y, mapseed) :
 276                         fill_ratio;
 277                 u32 deco_count = area * MYMAX(nval, 0.f);
 278
 279                 for (u32 i = 0; i < deco_count; i++) {
 280                         s16 x = ps.range(p2d_min.X, p2d_max.X);
 281                         s16 z = ps.range(p2d_min.Y, p2d_max.Y);
 282
 283                         int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
 284
 285                         s16 y = mg->heightmap ?
 286                                         mg->heightmap[mapindex] :
 287                                         mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
 288
 289                         if (y < nmin.Y || y > nmax.Y)
 290                                 continue;
 291
 292                         int height = getHeight();
 293                         int max_y = nmax.Y + MAP_BLOCKSIZE;
 294                         if (y + 1 + height > max_y) {
 295                                 continue;
 296 #if 0
 297                                 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
 298                                 //add to queue
 299                                 JMutexAutoLock cutofflock(cutoff_mutex);
 300                                 cutoffs.push_back(CutoffData(x, y, z, height));
 301 #endif
 302                         }
 303
 304                         if (mg->biomemap) {
 305                                 std::set<u8>::iterator iter;
 306
 307                                 if (biomes.size()) {
 308                                         iter = biomes.find(mg->biomemap[mapindex]);
 309                                         if (iter == biomes.end())
 310                                                 continue;
 311                                 }
 312                         }
 313
 314                         generate(mg, &ps, max_y, v3s16(x, y, z));
 315                 }
 316         }
 317 }
 318
 319
 320 #if 0
 321 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
 322         PseudoRandom pr(blockseed + 53);
 323         std::vector<CutoffData> handled_cutoffs;
 324
 325         // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
 326         {
 327                 JMutexAutoLock cutofflock(cutoff_mutex);
 328                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
 329                         i != cutoffs.end(); ++i) {
 330                         CutoffData cutoff = *i;
 331                         v3s16 p    = cutoff.p;
 332                         s16 height = cutoff.height;
 333                         if (p.X < nmin.X || p.X > nmax.X ||
 334                                 p.Z < nmin.Z || p.Z > nmax.Z)
 335                                 continue;
 336                         if (p.Y + height < nmin.Y || p.Y > nmax.Y)
 337                                 continue;
 338
 339                         handled_cutoffs.push_back(cutoff);
 340                 }
 341         }
 342
 343         // Generate the cutoffs
 344         for (size_t i = 0; i != handled_cutoffs.size(); i++) {
 345                 v3s16 p    = handled_cutoffs[i].p;
 346                 s16 height = handled_cutoffs[i].height;
 347
 348                 if (p.Y + height > nmax.Y) {
 349                         //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
 350                         cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
 351                 }
 352
 353                 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
 354         }
 355
 356         // Remove cutoffs that were handled from the cutoff list
 357         {
 358                 JMutexAutoLock cutofflock(cutoff_mutex);
 359                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
 360                         i != cutoffs.end(); ++i) {
 361
 362                         for (size_t j = 0; j != handled_cutoffs.size(); j++) {
 363                                 CutoffData coff = *i;
 364                                 if (coff.p == handled_cutoffs[j].p)
 365                                         i = cutoffs.erase(i);
 366                         }
 367                 }
 368         }
 369 }
 370 #endif
 371
 372
 373 ///////////////////////////////////////////////////////////////////////////////
 374
 375
 376 void DecoSimple::resolveNodeNames(INodeDefManager *ndef) {
 377         Decoration::resolveNodeNames(ndef);
 378
 379         if (c_deco == CONTENT_IGNORE) {
 380                 c_deco = ndef->getId(deco_name);
 381                 if (c_deco == CONTENT_IGNORE) {
 382                         errorstream << "DecoSimple::resolveNodeNames: decoration node '"
 383                                 << deco_name << "' not defined" << std::endl;
 384                         c_deco = CONTENT_AIR;
 385                 }
 386         }
 387         if (c_spawnby == CONTENT_IGNORE) {
 388                 c_spawnby = ndef->getId(spawnby_name);
 389                 if (c_spawnby == CONTENT_IGNORE) {
 390                         errorstream << "DecoSimple::resolveNodeNames: spawnby node '"
 391                                 << deco_name << "' not defined" << std::endl;
 392                         nspawnby = -1;
 393                         c_spawnby = CONTENT_AIR;
 394                 }
 395         }
 396
 397         if (c_decolist.size())
 398                 return;
 399
 400         for (size_t i = 0; i != decolist_names.size(); i++) {
 401                 content_t c = ndef->getId(decolist_names[i]);
 402                 if (c == CONTENT_IGNORE) {
 403                         errorstream << "DecoSimple::resolveNodeNames: decolist node '"
 404                                 << decolist_names[i] << "' not defined" << std::endl;
 405                         c = CONTENT_AIR;
 406                 }
 407                 c_decolist.push_back(c);
 408         }
 409 }
 410
 411
 412 void DecoSimple::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
 413         ManualMapVoxelManipulator *vm = mg->vm;
 414
 415         u32 vi = vm->m_area.index(p);
 416         if (vm->m_data[vi].getContent() != c_place_on &&
 417                 c_place_on != CONTENT_IGNORE)
 418                 return;
 419
 420         if (nspawnby != -1) {
 421                 int nneighs = 0;
 422                 v3s16 dirs[8] = { // a Moore neighborhood
 423                         v3s16( 0, 0,  1),
 424                         v3s16( 0, 0, -1),
 425                         v3s16( 1, 0,  0),
 426                         v3s16(-1, 0,  0),
 427                         v3s16( 1, 0,  1),
 428                         v3s16(-1, 0,  1),
 429                         v3s16(-1, 0, -1),
 430                         v3s16( 1, 0, -1)
 431                 };
 432
 433                 for (int i = 0; i != 8; i++) {
 434                         u32 index = vm->m_area.index(p + dirs[i]);
 435                         if (vm->m_area.contains(index) &&
 436                                 vm->m_data[index].getContent() == c_spawnby)
 437                                 nneighs++;
 438                 }
 439
 440                 if (nneighs < nspawnby)
 441                         return;
 442         }
 443
 444         size_t ndecos = c_decolist.size();
 445         content_t c_place = ndecos ? c_decolist[pr->range(0, ndecos - 1)] : c_deco;
 446
 447         s16 height = (deco_height_max > 0) ?
 448                 pr->range(deco_height, deco_height_max) : deco_height;
 449
 450         height = MYMIN(height, max_y - p.Y);
 451
 452         v3s16 em = vm->m_area.getExtent();
 453         for (int i = 0; i < height; i++) {
 454                 vm->m_area.add_y(em, vi, 1);
 455
 456                 content_t c = vm->m_data[vi].getContent();
 457                 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
 458                         break;
 459
 460                 vm->m_data[vi] = MapNode(c_place);
 461         }
 462 }
 463
 464
 465 int DecoSimple::getHeight() {
 466         return (deco_height_max > 0) ? deco_height_max : deco_height;
 467 }
 468
 469
 470 std::string DecoSimple::getName() {
 471         return deco_name;
 472 }
 473
 474
 475 ///////////////////////////////////////////////////////////////////////////////
 476
 477
 478 DecoSchematic::DecoSchematic() {
 479         node_names = NULL;
 480         schematic  = NULL;
 481         flags      = 0;
 482         size       = v3s16(0, 0, 0);
 483 }
 484
 485
 486 DecoSchematic::~DecoSchematic() {
 487         delete node_names;
 488         delete []schematic;
 489 }
 490
 491
 492 void DecoSchematic::resolveNodeNames(INodeDefManager *ndef) {
 493         Decoration::resolveNodeNames(ndef);
 494
 495         if (filename.empty())
 496                 return;
 497
 498         if (!node_names) {
 499                 errorstream << "DecoSchematic::resolveNodeNames: node name list was "
 500                         "not created" << std::endl;
 501                 return;
 502         }
 503
 504         for (size_t i = 0; i != node_names->size(); i++) {
 505                 content_t c = ndef->getId(node_names->at(i));
 506                 if (c == CONTENT_IGNORE) {
 507                         errorstream << "DecoSchematic::resolveNodeNames: node '"
 508                                 << node_names->at(i) << "' not defined" << std::endl;
 509                         c = CONTENT_AIR;
 510                 }
 511                 c_nodes.push_back(c);
 512         }
 513
 514         for (int i = 0; i != size.X * size.Y * size.Z; i++)
 515                 schematic[i].setContent(c_nodes[schematic[i].getContent()]);
 516
 517         delete node_names;
 518         node_names = NULL;
 519 }
 520
 521
 522 void DecoSchematic::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
 523         ManualMapVoxelManipulator *vm = mg->vm;
 524
 525         if (flags & DECO_PLACE_CENTER_X)
 526                 p.X -= (size.X + 1) / 2;
 527         if (flags & DECO_PLACE_CENTER_Y)
 528                 p.Y -= (size.Y + 1) / 2;
 529         if (flags & DECO_PLACE_CENTER_Z)
 530                 p.Z -= (size.Z + 1) / 2;
 531
 532         u32 vi = vm->m_area.index(p);
 533         if (vm->m_data[vi].getContent() != c_place_on &&
 534                 c_place_on != CONTENT_IGNORE)
 535                 return;
 536
 537         u32 i = 0;
 538         for (s16 z = 0; z != size.Z; z++)
 539         for (s16 y = 0; y != size.Y; y++) {
 540                 vi = vm->m_area.index(p.X, p.Y + y, p.Z + z);
 541                 for (s16 x = 0; x != size.X; x++, i++, vi++) {
 542                         if (!vm->m_area.contains(vi))
 543                                 continue;
 544
 545                         if (schematic[i].getContent() == CONTENT_IGNORE)
 546                                 continue;
 547
 548                         content_t c = vm->m_data[vi].getContent();
 549                         if (c != CONTENT_AIR && c != CONTENT_IGNORE)
 550                                 continue;
 551
 552                         if (schematic[i].param1 && myrand_range(1, 256) > schematic[i].param1)
 553                                 continue;
 554
 555                         vm->m_data[vi] = schematic[i];
 556                         vm->m_data[vi].param1 = 0;
 557                 }
 558         }
 559 }
 560
 561
 562 int DecoSchematic::getHeight() {
 563         return size.Y;
 564 }
 565
 566
 567 std::string DecoSchematic::getName() {
 568         return filename;
 569 }
 570
 571
 572 void DecoSchematic::placeStructure(Map *map, v3s16 p) {
 573         assert(schematic != NULL);
 574         ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
 575
 576         if (flags & DECO_PLACE_CENTER_X)
 577                 p.X -= (size.X + 1) / 2;
 578         if (flags & DECO_PLACE_CENTER_Y)
 579                 p.Y -= (size.Y + 1) / 2;
 580         if (flags & DECO_PLACE_CENTER_Z)
 581                 p.Z -= (size.Z + 1) / 2;
 582
 583         v3s16 bp1 = getNodeBlockPos(p);
 584         v3s16 bp2 = getNodeBlockPos(p + size - v3s16(1,1,1));
 585         vm->initialEmerge(bp1, bp2);
 586
 587         u32 i = 0;
 588         for (s16 z = 0; z != size.Z; z++)
 589         for (s16 y = 0; y != size.Y; y++) {
 590                 u32 vi = vm->m_area.index(p.X, p.Y + y, p.Z + z);
 591                 for (s16 x = 0; x != size.X; x++, i++, vi++) {
 592                         if (!vm->m_area.contains(vi))
 593                                 continue;
 594
 595                         if (schematic[i].getContent() == CONTENT_IGNORE)
 596                                 continue;
 597
 598                         if (schematic[i].param1 && myrand_range(1, 256) > schematic[i].param1)
 599                                 continue;
 600
 601                         vm->m_data[vi] = schematic[i];
 602                         vm->m_data[vi].param1 = 0;
 603                 }
 604         }
 605
 606         std::map<v3s16, MapBlock *> lighting_modified_blocks;
 607         std::map<v3s16, MapBlock *> modified_blocks;
 608         vm->blitBackAll(&modified_blocks);
 609
 610         // TODO: Optimize this by using Mapgen::calcLighting() instead
 611         lighting_modified_blocks.insert(modified_blocks.begin(), modified_blocks.end());
 612         map->updateLighting(lighting_modified_blocks, modified_blocks);
 613
 614         MapEditEvent event;
 615         event.type = MEET_OTHER;
 616         for (std::map<v3s16, MapBlock *>::iterator
 617                 it = modified_blocks.begin();
 618                 it != modified_blocks.end(); ++it)
 619                 event.modified_blocks.insert(it->first);
 620
 621         map->dispatchEvent(&event);
 622 }
 623
 624
 625 bool DecoSchematic::loadSchematicFile() {
 626         std::ifstream is(filename.c_str(), std::ios_base::binary);
 627
 628         u32 signature = readU32(is);
 629         if (signature != 'MTSM') {
 630                 errorstream << "loadSchematicFile: invalid schematic "
 631                         "file" << std::endl;
 632                 return false;
 633         }
 634
 635         u16 version = readU16(is);
 636         if (version != 1) {
 637                 errorstream << "loadSchematicFile: unsupported schematic "
 638                         "file version" << std::endl;
 639                 return false;
 640         }
 641
 642         size = readV3S16(is);
 643         int nodecount = size.X * size.Y * size.Z;
 644
 645         u16 nidmapcount = readU16(is);
 646
 647         node_names = new std::vector<std::string>;
 648         for (int i = 0; i != nidmapcount; i++) {
 649                 std::string name = deSerializeString(is);
 650                 node_names->push_back(name);
 651         }
 652
 653         delete schematic;
 654         schematic = new MapNode[nodecount];
 655         MapNode::deSerializeBulk(is, SER_FMT_VER_HIGHEST, schematic,
 656                                 nodecount, 2, 2, true);
 657
 658         return true;
 659 }
 660
 661
 662 /*
 663         Minetest Schematic File Format
 664
 665         All values are stored in big-endian byte order.
 666         [u32] signature: 'MTSM'
 667         [u16] version: 1
 668         [u16] size X
 669         [u16] size Y
 670         [u16] size Z
 671         [Name-ID table] Name ID Mapping Table
 672                 [u16] name-id count
 673                 For each name-id mapping:
 674                         [u16] name length
 675                         [u8[]] name
 676         ZLib deflated {
 677         For each node in schematic:  (for z, y, x)
 678                 [u16] content
 679         For each node in schematic:
 680                 [u8] probability of occurance (param1)
 681         For each node in schematic:
 682                 [u8] param2
 683         }
 684 */
 685 void DecoSchematic::saveSchematicFile(INodeDefManager *ndef) {
 686         std::ofstream os(filename.c_str(), std::ios_base::binary);
 687
 688         writeU32(os, 'MTSM'); // signature
 689         writeU16(os, 1);      // version
 690         writeV3S16(os, size); // schematic size
 691
 692         std::vector<content_t> usednodes;
 693         int nodecount = size.X * size.Y * size.Z;
 694         build_nnlist_and_update_ids(schematic, nodecount, &usednodes);
 695
 696         u16 numids = usednodes.size();
 697         writeU16(os, numids); // name count
 698         for (int i = 0; i != numids; i++)
 699                 os << serializeString(ndef->get(usednodes[i]).name); // node names
 700
 701         // compressed bulk node data
 702         MapNode::serializeBulk(os, SER_FMT_VER_HIGHEST, schematic,
 703                                 nodecount, 2, 2, true);
 704 }
 705
 706
 707 void build_nnlist_and_update_ids(MapNode *nodes, u32 nodecount,
 708                                                 std::vector<content_t> *usednodes) {
 709         std::map<content_t, content_t> nodeidmap;
 710         content_t numids = 0;
 711
 712         for (u32 i = 0; i != nodecount; i++) {
 713                 content_t id;
 714                 content_t c = nodes[i].getContent();
 715
 716                 std::map<content_t, content_t>::const_iterator it = nodeidmap.find(c);
 717                 if (it == nodeidmap.end()) {
 718                         id = numids;
 719                         numids++;
 720
 721                         usednodes->push_back(c);
 722                         nodeidmap.insert(std::make_pair(c, id));
 723                 } else {
 724                         id = it->second;
 725                 }
 726                 nodes[i].setContent(id);
 727         }
 728 }
 729
 730
 731 bool DecoSchematic::getSchematicFromMap(Map *map, v3s16 p1, v3s16 p2) {
 732         ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
 733
 734         v3s16 bp1 = getNodeBlockPos(p1);
 735         v3s16 bp2 = getNodeBlockPos(p2);
 736         vm->initialEmerge(bp1, bp2);
 737
 738         size = p2 - p1 + 1;
 739         schematic = new MapNode[size.X * size.Y * size.Z];
 740
 741         u32 i = 0;
 742         for (s16 z = p1.Z; z <= p2.Z; z++)
 743         for (s16 y = p1.Y; y <= p2.Y; y++) {
 744                 u32 vi = vm->m_area.index(p1.X, y, z);
 745                 for (s16 x = p1.X; x <= p2.X; x++, i++, vi++) {
 746                         schematic[i] = vm->m_data[vi];
 747                         schematic[i].param1 = 0;
 748                 }
 749         }
 750
 751         delete vm;
 752         return true;
 753 }
 754
 755
 756 void DecoSchematic::applyProbabilities(std::vector<std::pair<v3s16, s16> > *plist, v3s16 p0) {
 757         for (size_t i = 0; i != plist->size(); i++) {
 758                 v3s16 p = (*plist)[i].first - p0;
 759                 int index = p.Z * (size.Y * size.X) + p.Y * size.X + p.X;
 760                 if (index < size.Z * size.Y * size.X) {
 761                         s16 prob = (*plist)[i].second;
 762                         if (prob != -1)
 763                                 schematic[index].param1 = prob;
 764                         else
 765                                 schematic[index].setContent(CONTENT_IGNORE);
 766                 }
 767         }
 768 }
 769
 770
 771 ///////////////////////////////////////////////////////////////////////////////
 772
 773
 774 Mapgen::Mapgen() {
 775         seed        = 0;
 776         water_level = 0;
 777         generating  = false;
 778         id          = -1;
 779         vm          = NULL;
 780         ndef        = NULL;
 781         heightmap   = NULL;
 782         biomemap    = NULL;
 783 }
 784
 785
 786 // Returns Y one under area minimum if not found
 787 s16 Mapgen::findGroundLevelFull(v2s16 p2d) {
 788         v3s16 em = vm->m_area.getExtent();
 789         s16 y_nodes_max = vm->m_area.MaxEdge.Y;
 790         s16 y_nodes_min = vm->m_area.MinEdge.Y;
 791         u32 i = vm->m_area.index(p2d.X, y_nodes_max, p2d.Y);
 792         s16 y;
 793
 794         for (y = y_nodes_max; y >= y_nodes_min; y--) {
 795                 MapNode &n = vm->m_data[i];
 796                 if (ndef->get(n).walkable)
 797                         break;
 798
 799                 vm->m_area.add_y(em, i, -1);
 800         }
 801         return (y >= y_nodes_min) ? y : y_nodes_min - 1;
 802 }
 803
 804
 805 s16 Mapgen::findGroundLevel(v2s16 p2d, s16 ymin, s16 ymax) {
 806         v3s16 em = vm->m_area.getExtent();
 807         u32 i = vm->m_area.index(p2d.X, ymax, p2d.Y);
 808         s16 y;
 809
 810         for (y = ymax; y >= ymin; y--) {
 811                 MapNode &n = vm->m_data[i];
 812                 if (ndef->get(n).walkable)
 813                         break;
 814
 815                 vm->m_area.add_y(em, i, -1);
 816         }
 817         return y;
 818 }
 819
 820
 821 void Mapgen::updateHeightmap(v3s16 nmin, v3s16 nmax) {
 822         if (!heightmap)
 823                 return;
 824
 825         //TimeTaker t("Mapgen::updateHeightmap", NULL, PRECISION_MICRO);
 826         int index = 0;
 827         for (s16 z = nmin.Z; z <= nmax.Z; z++) {
 828                 for (s16 x = nmin.X; x <= nmax.X; x++) {
 829                         s16 y = findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
 830                         heightmap[index++] = y;
 831                 }
 832         }
 833         //printf("updateHeightmap: %dus\n", t.stop());
 834 }
 835
 836
 837 void Mapgen::updateLiquid(UniqueQueue<v3s16> *trans_liquid, v3s16 nmin, v3s16 nmax) {
 838         bool isliquid, wasliquid;
 839         v3s16 em  = vm->m_area.getExtent();
 840
 841         for (s16 z = nmin.Z; z <= nmax.Z; z++) {
 842                 for (s16 x = nmin.X; x <= nmax.X; x++) {
 843                         wasliquid = true;
 844
 845                         u32 i = vm->m_area.index(x, nmax.Y, z);
 846                         for (s16 y = nmax.Y; y >= nmin.Y; y--) {
 847                                 isliquid = ndef->get(vm->m_data[i]).isLiquid();
 848
 849                                 // there was a change between liquid and nonliquid, add to queue
 850                                 if (isliquid != wasliquid)
 851                                         trans_liquid->push_back(v3s16(x, y, z));
 852
 853                                 wasliquid = isliquid;
 854                                 vm->m_area.add_y(em, i, -1);
 855                         }
 856                 }
 857         }
 858 }
 859
 860
 861 void Mapgen::setLighting(v3s16 nmin, v3s16 nmax, u8 light) {
 862         ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
 863         VoxelArea a(nmin, nmax);
 864
 865         for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
 866                 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
 867                         u32 i = vm->m_area.index(a.MinEdge.X, y, z);
 868                         for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++)
 869                                 vm->m_data[i].param1 = light;
 870                 }
 871         }
 872 }
 873
 874
 875 void Mapgen::lightSpread(VoxelArea &a, v3s16 p, u8 light) {
 876         if (light <= 1 || !a.contains(p))
 877                 return;
 878
 879         u32 vi = vm->m_area.index(p);
 880         MapNode &nn = vm->m_data[vi];
 881
 882         light--;
 883         // should probably compare masked, but doesn't seem to make a difference
 884         if (light <= nn.param1 || !ndef->get(nn).light_propagates)
 885                 return;
 886
 887         nn.param1 = light;
 888
 889         lightSpread(a, p + v3s16(0, 0, 1), light);
 890         lightSpread(a, p + v3s16(0, 1, 0), light);
 891         lightSpread(a, p + v3s16(1, 0, 0), light);
 892         lightSpread(a, p - v3s16(0, 0, 1), light);
 893         lightSpread(a, p - v3s16(0, 1, 0), light);
 894         lightSpread(a, p - v3s16(1, 0, 0), light);
 895 }
 896
 897
 898 void Mapgen::calcLighting(v3s16 nmin, v3s16 nmax) {
 899         VoxelArea a(nmin, nmax);
 900         bool block_is_underground = (water_level >= nmax.Y);
 901
 902         ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
 903         //TimeTaker t("updateLighting");
 904
 905         // first, send vertical rays of sunshine downward
 906         v3s16 em = vm->m_area.getExtent();
 907         for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
 908                 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++) {
 909                         // see if we can get a light value from the overtop
 910                         u32 i = vm->m_area.index(x, a.MaxEdge.Y + 1, z);
 911                         if (vm->m_data[i].getContent() == CONTENT_IGNORE) {
 912                                 if (block_is_underground)
 913                                         continue;
 914                         } else if ((vm->m_data[i].param1 & 0x0F) != LIGHT_SUN) {
 915                                 continue;
 916                         }
 917                         vm->m_area.add_y(em, i, -1);
 918
 919                         for (int y = a.MaxEdge.Y; y >= a.MinEdge.Y; y--) {
 920                                 MapNode &n = vm->m_data[i];
 921                                 if (!ndef->get(n).sunlight_propagates)
 922                                         break;
 923                                 n.param1 = LIGHT_SUN;
 924                                 vm->m_area.add_y(em, i, -1);
 925                         }
 926                 }
 927         }
 928
 929         // now spread the sunlight and light up any sources
 930         for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
 931                 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
 932                         u32 i = vm->m_area.index(a.MinEdge.X, y, z);
 933                         for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++) {
 934                                 MapNode &n = vm->m_data[i];
 935                                 if (n.getContent() == CONTENT_IGNORE ||
 936                                         !ndef->get(n).light_propagates)
 937                                         continue;
 938
 939                                 u8 light_produced = ndef->get(n).light_source & 0x0F;
 940                                 if (light_produced)
 941                                         n.param1 = light_produced;
 942
 943                                 u8 light = n.param1 & 0x0F;
 944                                 if (light) {
 945                                         lightSpread(a, v3s16(x,     y,     z + 1), light);
 946                                         lightSpread(a, v3s16(x,     y + 1, z    ), light);
 947                                         lightSpread(a, v3s16(x + 1, y,     z    ), light);
 948                                         lightSpread(a, v3s16(x,     y,     z - 1), light);
 949                                         lightSpread(a, v3s16(x,     y - 1, z    ), light);
 950                                         lightSpread(a, v3s16(x - 1, y,     z    ), light);
 951                                 }
 952                         }
 953                 }
 954         }
 955
 956         //printf("updateLighting: %dms\n", t.stop());
 957 }
 958
 959
 960 void Mapgen::calcLightingOld(v3s16 nmin, v3s16 nmax) {
 961         enum LightBank banks[2] = {LIGHTBANK_DAY, LIGHTBANK_NIGHT};
 962         VoxelArea a(nmin, nmax);
 963         bool block_is_underground = (water_level > nmax.Y);
 964         bool sunlight = !block_is_underground;
 965
 966         ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
 967
 968         for (int i = 0; i < 2; i++) {
 969                 enum LightBank bank = banks[i];
 970                 std::set<v3s16> light_sources;
 971                 std::map<v3s16, u8> unlight_from;
 972
 973                 voxalgo::clearLightAndCollectSources(*vm, a, bank, ndef,
 974                                                                                          light_sources, unlight_from);
 975                 voxalgo::propagateSunlight(*vm, a, sunlight, light_sources, ndef);
 976
 977                 vm->unspreadLight(bank, unlight_from, light_sources, ndef);
 978                 vm->spreadLight(bank, light_sources, ndef);
 979         }
 980 }
 981
 982
 983 //////////////////////// Mapgen V6 parameter read/write
 984
 985 bool MapgenV6Params::readParams(Settings *settings) {
 986         freq_desert = settings->getFloat("mgv6_freq_desert");
 987         freq_beach  = settings->getFloat("mgv6_freq_beach");
 988
 989         bool success =
 990                 settings->getNoiseParams("mgv6_np_terrain_base",   np_terrain_base)   &&
 991                 settings->getNoiseParams("mgv6_np_terrain_higher", np_terrain_higher) &&
 992                 settings->getNoiseParams("mgv6_np_steepness",      np_steepness)      &&
 993                 settings->getNoiseParams("mgv6_np_height_select",  np_height_select)  &&
 994                 settings->getNoiseParams("mgv6_np_mud",            np_mud)            &&
 995                 settings->getNoiseParams("mgv6_np_beach",          np_beach)          &&
 996                 settings->getNoiseParams("mgv6_np_biome",          np_biome)          &&
 997                 settings->getNoiseParams("mgv6_np_cave",           np_cave)           &&
 998                 settings->getNoiseParams("mgv6_np_humidity",       np_humidity)       &&
 999                 settings->getNoiseParams("mgv6_np_trees",          np_trees)          &&
1000                 settings->getNoiseParams("mgv6_np_apple_trees",    np_apple_trees);
1001         return success;
1002 }
1003
1004
1005 void MapgenV6Params::writeParams(Settings *settings) {
1006         settings->setFloat("mgv6_freq_desert", freq_desert);
1007         settings->setFloat("mgv6_freq_beach",  freq_beach);
1008
1009         settings->setNoiseParams("mgv6_np_terrain_base",   np_terrain_base);
1010         settings->setNoiseParams("mgv6_np_terrain_higher", np_terrain_higher);
1011         settings->setNoiseParams("mgv6_np_steepness",      np_steepness);
1012         settings->setNoiseParams("mgv6_np_height_select",  np_height_select);
1013         settings->setNoiseParams("mgv6_np_mud",            np_mud);
1014         settings->setNoiseParams("mgv6_np_beach",          np_beach);
1015         settings->setNoiseParams("mgv6_np_biome",          np_biome);
1016         settings->setNoiseParams("mgv6_np_cave",           np_cave);
1017         settings->setNoiseParams("mgv6_np_humidity",       np_humidity);
1018         settings->setNoiseParams("mgv6_np_trees",          np_trees);
1019         settings->setNoiseParams("mgv6_np_apple_trees",    np_apple_trees);
1020 }
1021
1022
1023 bool MapgenV7Params::readParams(Settings *settings) {
1024         bool success =
1025                 settings->getNoiseParams("mgv7_np_terrain_base",    np_terrain_base)    &&
1026                 settings->getNoiseParams("mgv7_np_terrain_alt",     np_terrain_alt)     &&
1027                 settings->getNoiseParams("mgv7_np_terrain_mod",     np_terrain_mod)     &&
1028                 settings->getNoiseParams("mgv7_np_terrain_persist", np_terrain_persist) &&
1029                 settings->getNoiseParams("mgv7_np_height_select",   np_height_select)   &&
1030                 settings->getNoiseParams("mgv7_np_ridge",           np_ridge);
1031         return success;
1032 }
1033
1034
1035 void MapgenV7Params::writeParams(Settings *settings) {
1036         settings->setNoiseParams("mgv7_np_terrain_base",    np_terrain_base);
1037         settings->setNoiseParams("mgv7_np_terrain_alt",     np_terrain_alt);
1038         settings->setNoiseParams("mgv7_np_terrain_mod",     np_terrain_mod);
1039         settings->setNoiseParams("mgv7_np_terrain_persist", np_terrain_persist);
1040         settings->setNoiseParams("mgv7_np_height_select",   np_height_select);
1041         settings->setNoiseParams("mgv7_np_ridge",           np_ridge);
1042 }
1043
1044
1045 /////////////////////////////////// legacy static functions for farmesh
1046
1047 s16 Mapgen::find_ground_level_from_noise(u64 seed, v2s16 p2d, s16 precision) {
1048         //just need to return something
1049         s16 level = 5;
1050         return level;
1051 }
1052
1053
1054 bool Mapgen::get_have_beach(u64 seed, v2s16 p2d) {
1055         double sandnoise = noise2d_perlin(
1056                                 0.2+(float)p2d.X/250, 0.7+(float)p2d.Y/250,
1057                                 seed+59420, 3, 0.50);
1058
1059         return (sandnoise > 0.15);
1060 }
1061
1062
1063 double Mapgen::tree_amount_2d(u64 seed, v2s16 p) {
1064         double noise = noise2d_perlin(
1065                         0.5+(float)p.X/125, 0.5+(float)p.Y/125,
1066                         seed+2, 4, 0.66);
1067         double zeroval = -0.39;
1068         if(noise < zeroval)
1069                 return 0;
1070         else
1071                 return 0.04 * (noise-zeroval) / (1.0-zeroval);
1072 }