src/mapgen_v6.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 "mapblock.h"
  24 #include "mapnode.h"
  25 #include "map.h"
  26 //#include "serverobject.h"
  27 #include "content_sao.h"
  28 #include "nodedef.h"
  29 #include "content_mapnode.h" // For content_mapnode_get_new_name
  30 #include "voxelalgorithms.h"
  31 #include "profiler.h"
  32 #include "settings.h" // For g_settings
  33 #include "main.h" // For g_profiler
  34 #include "emerge.h"
  35 #include "dungeongen.h"
  36 #include "treegen.h"
  37 #include "mapgen_v6.h"
  38
  39 /////////////////// Mapgen V6 perlin noise default values
  40 NoiseParams nparams_v6_def_terrain_base =
  41         {-AVERAGE_MUD_AMOUNT, 20.0, v3f(250.0, 250.0, 250.0), 82341, 5, 0.6};
  42 NoiseParams nparams_v6_def_terrain_higher =
  43         {20.0, 16.0, v3f(500.0, 500.0, 500.0), 85039, 5, 0.6};
  44 NoiseParams nparams_v6_def_steepness =
  45         {0.85, 0.5, v3f(125.0, 125.0, 125.0), -932, 5, 0.7};
  46 NoiseParams nparams_v6_def_height_select =
  47         {0.5, 1.0, v3f(250.0, 250.0, 250.0), 4213, 5, 0.69};
  48 NoiseParams nparams_v6_def_mud =
  49         {AVERAGE_MUD_AMOUNT, 2.0, v3f(200.0, 200.0, 200.0), 91013, 3, 0.55};
  50 NoiseParams nparams_v6_def_beach =
  51         {0.0, 1.0, v3f(250.0, 250.0, 250.0), 59420, 3, 0.50};
  52 NoiseParams nparams_v6_def_biome =
  53         {0.0, 1.0, v3f(250.0, 250.0, 250.0), 9130, 3, 0.50};
  54 NoiseParams nparams_v6_def_cave =
  55         {6.0, 6.0, v3f(250.0, 250.0, 250.0), 34329, 3, 0.50};
  56 NoiseParams nparams_v6_def_humidity =
  57         {0.5, 0.5, v3f(500.0, 500.0, 500.0), 72384, 4, 0.66};
  58 NoiseParams nparams_v6_def_trees =
  59         {0.0, 1.0, v3f(125.0, 125.0, 125.0), 2, 4, 0.66};
  60 NoiseParams nparams_v6_def_apple_trees =
  61         {0.0, 1.0, v3f(100.0, 100.0, 100.0), 342902, 3, 0.45};
  62
  63
  64 ///////////////////////////////////////////////////////////////////////////////
  65
  66
  67 MapgenV6::MapgenV6(int mapgenid, MapgenV6Params *params, EmergeManager *emerge) {
  68         this->generating  = false;
  69         this->id       = mapgenid;
  70         this->emerge   = emerge;
  71
  72         this->seed     = (int)params->seed;
  73         this->water_level = params->water_level;
  74         this->flags   = params->flags;
  75         this->csize   = v3s16(1, 1, 1) * params->chunksize * MAP_BLOCKSIZE;
  76
  77         this->freq_desert = params->freq_desert;
  78         this->freq_beach  = params->freq_beach;
  79
  80         this->ystride = csize.X; //////fix this
  81
  82         np_cave        = params->np_cave;
  83         np_humidity    = params->np_humidity;
  84         np_trees       = params->np_trees;
  85         np_apple_trees = params->np_apple_trees;
  86
  87         noise_terrain_base   = new Noise(params->np_terrain_base,   seed, csize.X, csize.Y);
  88         noise_terrain_higher = new Noise(params->np_terrain_higher, seed, csize.X, csize.Y);
  89         noise_steepness      = new Noise(params->np_steepness,      seed, csize.X, csize.Y);
  90         noise_height_select  = new Noise(params->np_height_select,  seed, csize.X, csize.Y);
  91         noise_mud            = new Noise(params->np_mud,            seed, csize.X, csize.Y);
  92         noise_beach          = new Noise(params->np_beach,          seed, csize.X, csize.Y);
  93         noise_biome          = new Noise(params->np_biome,          seed, csize.X, csize.Y);
  94 }
  95
  96
  97 MapgenV6::~MapgenV6() {
  98         delete noise_terrain_base;
  99         delete noise_terrain_higher;
 100         delete noise_steepness;
 101         delete noise_height_select;
 102         delete noise_mud;
 103         delete noise_beach;
 104         delete noise_biome;
 105 }
 106
 107
 108 //////////////////////// Some helper functions for the map generator
 109
 110 // Returns Y one under area minimum if not found
 111 s16 MapgenV6::find_ground_level(v2s16 p2d) {
 112         v3s16 em = vm->m_area.getExtent();
 113         s16 y_nodes_max = vm->m_area.MaxEdge.Y;
 114         s16 y_nodes_min = vm->m_area.MinEdge.Y;
 115         u32 i = vm->m_area.index(p2d.X, y_nodes_max, p2d.Y);
 116         s16 y;
 117
 118         for (y = y_nodes_max; y >= y_nodes_min; y--) {
 119                 MapNode &n = vm->m_data[i];
 120                 if(ndef->get(n).walkable)
 121                         break;
 122
 123                 vm->m_area.add_y(em, i, -1);
 124         }
 125         return (y >= y_nodes_min) ? y : y_nodes_min - 1;
 126 }
 127
 128 // Returns Y one under area minimum if not found
 129 s16 MapgenV6::find_stone_level(v2s16 p2d) {
 130         v3s16 em = vm->m_area.getExtent();
 131         s16 y_nodes_max = vm->m_area.MaxEdge.Y;
 132         s16 y_nodes_min = vm->m_area.MinEdge.Y;
 133         u32 i = vm->m_area.index(p2d.X, y_nodes_max, p2d.Y);
 134         s16 y;
 135
 136         for (y = y_nodes_max; y >= y_nodes_min; y--) {
 137                 MapNode &n = vm->m_data[i];
 138                 content_t c = n.getContent();
 139                 if (c != CONTENT_IGNORE && (
 140                         c == c_stone || c == c_desert_stone))
 141                         break;
 142
 143                 vm->m_area.add_y(em, i, -1);
 144         }
 145         return (y >= y_nodes_min) ? y : y_nodes_min - 1;
 146 }
 147
 148
 149 // Required by mapgen.h
 150 bool MapgenV6::block_is_underground(u64 seed, v3s16 blockpos)
 151 {
 152         /*s16 minimum_groundlevel = (s16)get_sector_minimum_ground_level(
 153                         seed, v2s16(blockpos.X, blockpos.Z));*/
 154         // Nah, this is just a heuristic, just return something
 155         s16 minimum_groundlevel = water_level;
 156
 157         if(blockpos.Y*MAP_BLOCKSIZE + MAP_BLOCKSIZE <= minimum_groundlevel)
 158                 return true;
 159         else
 160                 return false;
 161 }
 162
 163
 164 //////////////////////// Base terrain height functions
 165
 166 float MapgenV6::baseTerrainLevel(float terrain_base, float terrain_higher,
 167                                                                         float steepness, float height_select) {
 168         float base   = water_level + terrain_base;
 169         float higher = water_level + terrain_higher;
 170
 171         // Limit higher ground level to at least base
 172         if(higher < base)
 173                 higher = base;
 174
 175         // Steepness factor of cliffs
 176         float b = steepness;
 177         b = rangelim(b, 0.0, 1000.0);
 178         b = 5 * b * b * b * b * b * b * b;
 179         b = rangelim(b, 0.5, 1000.0);
 180
 181         // Values 1.5...100 give quite horrible looking slopes
 182         if (b > 1.5 && b < 100.0)
 183                 b = (b < 10.0) ? 1.5 : 100.0;
 184
 185         float a_off = -0.20; // Offset to more low
 186         float a = 0.5 + b * (a_off + height_select);
 187         a = rangelim(a, 0.0, 1.0); // Limit
 188
 189         return base * (1.0 - a) + higher * a;
 190 }
 191
 192
 193 float MapgenV6::baseTerrainLevelFromNoise(v2s16 p) {
 194         if (flags & MG_FLAT)
 195                 return water_level;
 196
 197         float terrain_base   = NoisePerlin2DPosOffset(noise_terrain_base->np,
 198                                                         p.X, 0.5, p.Y, 0.5, seed);
 199         float terrain_higher = NoisePerlin2DPosOffset(noise_terrain_higher->np,
 200                                                         p.X, 0.5, p.Y, 0.5, seed);
 201         float steepness      = NoisePerlin2DPosOffset(noise_steepness->np,
 202                                                         p.X, 0.5, p.Y, 0.5, seed);
 203         float height_select  = NoisePerlin2DNoTxfmPosOffset(noise_height_select->np,
 204                                                         p.X, 0.5, p.Y, 0.5, seed);
 205
 206         return baseTerrainLevel(terrain_base, terrain_higher,
 207                                                         steepness,    height_select);
 208 }
 209
 210
 211 float MapgenV6::baseTerrainLevelFromMap(v2s16 p) {
 212         int index = (p.Y - node_min.Z) * ystride + (p.X - node_min.X);
 213         return baseTerrainLevelFromMap(index);
 214 }
 215
 216
 217 float MapgenV6::baseTerrainLevelFromMap(int index) {
 218         if (flags & MG_FLAT)
 219                 return water_level;
 220
 221         float terrain_base   = noise_terrain_base->result[index];
 222         float terrain_higher = noise_terrain_higher->result[index];
 223         float steepness      = noise_steepness->result[index];
 224         float height_select  = noise_height_select->result[index];
 225
 226         return baseTerrainLevel(terrain_base, terrain_higher,
 227                                                         steepness,    height_select);
 228 }
 229
 230
 231 s16 MapgenV6::find_ground_level_from_noise(u64 seed, v2s16 p2d, s16 precision) {
 232         return baseTerrainLevelFromNoise(p2d) + AVERAGE_MUD_AMOUNT;
 233 }
 234
 235
 236 int MapgenV6::getGroundLevelAtPoint(v2s16 p) {
 237         return baseTerrainLevelFromNoise(p) + AVERAGE_MUD_AMOUNT;
 238 }
 239
 240
 241 //////////////////////// Noise functions
 242
 243 float MapgenV6::getMudAmount(v2s16 p) {
 244         int index = (p.Y - node_min.Z) * ystride + (p.X - node_min.X);
 245         return getMudAmount(index);
 246 }
 247
 248
 249 bool MapgenV6::getHaveBeach(v2s16 p) {
 250         int index = (p.Y - node_min.Z) * ystride + (p.X - node_min.X);
 251         return getHaveBeach(index);
 252 }
 253
 254
 255 BiomeType MapgenV6::getBiome(v2s16 p) {
 256         int index = (p.Y - node_min.Z) * ystride + (p.X - node_min.X);
 257         return getBiome(index, p);
 258 }
 259
 260
 261 float MapgenV6::getHumidity(v2s16 p)
 262 {
 263         /*double noise = noise2d_perlin(
 264                 0.5+(float)p.X/500, 0.5+(float)p.Y/500,
 265                 seed+72384, 4, 0.66);
 266         noise = (noise + 1.0)/2.0;*/
 267
 268         float noise = NoisePerlin2D(np_humidity, p.X, p.Y, seed);
 269
 270         if (noise < 0.0)
 271                 noise = 0.0;
 272         if (noise > 1.0)
 273                 noise = 1.0;
 274         return noise;
 275 }
 276
 277
 278 float MapgenV6::getTreeAmount(v2s16 p)
 279 {
 280         /*double noise = noise2d_perlin(
 281                         0.5+(float)p.X/125, 0.5+(float)p.Y/125,
 282                         seed+2, 4, 0.66);*/
 283
 284         float noise = NoisePerlin2D(np_trees, p.X, p.Y, seed);
 285         float zeroval = -0.39;
 286         if (noise < zeroval)
 287                 return 0;
 288         else
 289                 return 0.04 * (noise-zeroval) / (1.0-zeroval);
 290 }
 291
 292
 293 bool MapgenV6::getHaveAppleTree(v2s16 p)
 294 {
 295         /*is_apple_tree = noise2d_perlin(
 296                 0.5+(float)p.X/100, 0.5+(float)p.Z/100,
 297                 data->seed+342902, 3, 0.45) > 0.2;*/
 298
 299         float noise = NoisePerlin2D(np_apple_trees, p.X, p.Y, seed);
 300
 301         return noise > 0.2;
 302 }
 303
 304
 305 float MapgenV6::getMudAmount(int index)
 306 {
 307         if (flags & MG_FLAT)
 308                 return AVERAGE_MUD_AMOUNT;
 309
 310         /*return ((float)AVERAGE_MUD_AMOUNT + 2.0 * noise2d_perlin(
 311                         0.5+(float)p.X/200, 0.5+(float)p.Y/200,
 312                         seed+91013, 3, 0.55));*/
 313
 314         return noise_mud->result[index];
 315 }
 316
 317
 318 bool MapgenV6::getHaveBeach(int index)
 319 {
 320         // Determine whether to have sand here
 321         /*double sandnoise = noise2d_perlin(
 322                         0.2+(float)p2d.X/250, 0.7+(float)p2d.Y/250,
 323                         seed+59420, 3, 0.50);*/
 324
 325         float sandnoise = noise_beach->result[index];
 326         return (sandnoise > freq_beach);
 327 }
 328
 329
 330 BiomeType MapgenV6::getBiome(int index, v2s16 p)
 331 {
 332         // Just do something very simple as for now
 333         /*double d = noise2d_perlin(
 334                         0.6+(float)p2d.X/250, 0.2+(float)p2d.Y/250,
 335                         seed+9130, 3, 0.50);*/
 336
 337         float d = noise_biome->result[index];
 338         if (d > freq_desert)
 339                 return BT_DESERT;
 340
 341         if ((flags & MGV6_BIOME_BLEND) &&
 342                 (d > freq_desert - 0.10) &&
 343                 ((noise2d(p.X, p.Y, seed) + 1.0) > (freq_desert - d) * 20.0))
 344                 return BT_DESERT;
 345
 346         return BT_NORMAL;
 347 }
 348
 349
 350 u32 MapgenV6::get_blockseed(u64 seed, v3s16 p)
 351 {
 352         s32 x=p.X, y=p.Y, z=p.Z;
 353         return (u32)(seed%0x100000000ULL) + z*38134234 + y*42123 + x*23;
 354 }
 355
 356
 357 //////////////////////// Map generator
 358
 359 void MapgenV6::makeChunk(BlockMakeData *data) {
 360         assert(data->vmanip);
 361         assert(data->nodedef);
 362         assert(data->blockpos_requested.X >= data->blockpos_min.X &&
 363                    data->blockpos_requested.Y >= data->blockpos_min.Y &&
 364                    data->blockpos_requested.Z >= data->blockpos_min.Z);
 365         assert(data->blockpos_requested.X <= data->blockpos_max.X &&
 366                    data->blockpos_requested.Y <= data->blockpos_max.Y &&
 367                    data->blockpos_requested.Z <= data->blockpos_max.Z);
 368
 369         this->generating = true;
 370         this->vm   = data->vmanip;
 371         this->ndef = data->nodedef;
 372
 373         // Hack: use minimum block coords for old code that assumes a single block
 374         v3s16 blockpos = data->blockpos_requested;
 375         v3s16 blockpos_min = data->blockpos_min;
 376         v3s16 blockpos_max = data->blockpos_max;
 377         v3s16 blockpos_full_min = blockpos_min - v3s16(1,1,1);
 378         v3s16 blockpos_full_max = blockpos_max + v3s16(1,1,1);
 379
 380         // Area of central chunk
 381         node_min = blockpos_min*MAP_BLOCKSIZE;
 382         node_max = (blockpos_max+v3s16(1,1,1))*MAP_BLOCKSIZE-v3s16(1,1,1);
 383
 384         // Full allocated area
 385         full_node_min = (blockpos_min-1)*MAP_BLOCKSIZE;
 386         full_node_max = (blockpos_max+2)*MAP_BLOCKSIZE-v3s16(1,1,1);
 387
 388         central_area_size = node_max - node_min + v3s16(1,1,1);
 389         assert(central_area_size.X == central_area_size.Z);
 390
 391         int volume_blocks = (blockpos_max.X - blockpos_min.X + 1)
 392                                           * (blockpos_max.Y - blockpos_min.Y + 1)
 393                                           * (blockpos_max.Z - blockpos_max.Z + 1);
 394
 395         volume_nodes = volume_blocks *
 396                 MAP_BLOCKSIZE * MAP_BLOCKSIZE * MAP_BLOCKSIZE;
 397
 398         // Create a block-specific seed
 399         blockseed = get_blockseed(data->seed, full_node_min);
 400
 401         // Make some noise
 402         calculateNoise();
 403
 404         c_stone           = ndef->getId("mapgen_stone");
 405         c_dirt            = ndef->getId("mapgen_dirt");
 406         c_dirt_with_grass = ndef->getId("mapgen_dirt_with_grass");
 407         c_sand            = ndef->getId("mapgen_sand");
 408         c_water_source    = ndef->getId("mapgen_water_source");
 409         c_lava_source     = ndef->getId("mapgen_lava_source");
 410         c_gravel          = ndef->getId("mapgen_gravel");
 411         c_cobble          = ndef->getId("mapgen_cobble");
 412         c_desert_sand     = ndef->getId("mapgen_desert_sand");
 413         c_desert_stone    = ndef->getId("mapgen_desert_stone");
 414         if (c_desert_sand == CONTENT_IGNORE)
 415                 c_desert_sand = c_sand;
 416         if (c_desert_stone == CONTENT_IGNORE)
 417                 c_desert_stone = c_stone;
 418
 419         // Maximum height of the stone surface and obstacles.
 420         // This is used to guide the cave generation
 421         s16 stone_surface_max_y;
 422
 423         // Generate general ground level to full area
 424         stone_surface_max_y = generateGround();
 425
 426         generateSomething();
 427
 428         const s16 max_spread_amount = MAP_BLOCKSIZE;
 429         // Limit dirt flow area by 1 because mud is flown into neighbors.
 430         s16 mudflow_minpos = -max_spread_amount + 1;
 431         s16 mudflow_maxpos = central_area_size.X + max_spread_amount - 2;
 432
 433         // Loop this part, it will make stuff look older and newer nicely
 434         const u32 age_loops = 2;
 435         for (u32 i_age = 0; i_age < age_loops; i_age++) { // Aging loop
 436                 // Make caves (this code is relatively horrible)
 437                 if (flags & MG_CAVES)
 438                         generateCaves(stone_surface_max_y);
 439
 440                 // Add mud to the central chunk
 441                 addMud();
 442
 443                 // Add blobs of dirt and gravel underground
 444                 addDirtGravelBlobs();
 445
 446                 // Flow mud away from steep edges
 447                 flowMud(mudflow_minpos, mudflow_maxpos);
 448
 449         }
 450
 451         // Add dungeons
 452         if (flags & MG_DUNGEONS) {
 453                 DungeonGen dgen(ndef, data->seed, water_level);
 454                 dgen.generate(vm, blockseed, full_node_min, full_node_max);
 455         }
 456
 457         // Add top and bottom side of water to transforming_liquid queue
 458         updateLiquid(&data->transforming_liquid, full_node_min, full_node_max);
 459
 460         // Grow grass
 461         growGrass();
 462
 463         // Generate some trees, and add grass, if a jungle
 464         if (flags & MG_TREES)
 465                 placeTreesAndJungleGrass();
 466
 467         // Generate the registered ores
 468         for (unsigned int i = 0; i != emerge->ores.size(); i++) {
 469                 Ore *ore = emerge->ores[i];
 470                 ore->generate(this, blockseed + i, node_min, node_max);
 471         }
 472
 473         // Calculate lighting
 474         calcLighting(node_min, node_max);
 475
 476         this->generating = false;
 477 }
 478
 479
 480 void MapgenV6::calculateNoise() {
 481         int x = node_min.X;
 482         int z = node_min.Z;
 483
 484         // Need to adjust for the original implementation's +.5 offset...
 485         if (!(flags & MG_FLAT)) {
 486                 noise_terrain_base->perlinMap2D(
 487                         x + 0.5 * noise_terrain_base->np->spread.X,
 488                         z + 0.5 * noise_terrain_base->np->spread.Z);
 489                 noise_terrain_base->transformNoiseMap();
 490
 491                 noise_terrain_higher->perlinMap2D(
 492                         x + 0.5 * noise_terrain_higher->np->spread.X,
 493                         z + 0.5 * noise_terrain_higher->np->spread.Z);
 494                 noise_terrain_higher->transformNoiseMap();
 495
 496                 noise_steepness->perlinMap2D(
 497                         x + 0.5 * noise_steepness->np->spread.X,
 498                         z + 0.5 * noise_steepness->np->spread.Z);
 499                 noise_steepness->transformNoiseMap();
 500
 501                 noise_height_select->perlinMap2D(
 502                         x + 0.5 * noise_height_select->np->spread.X,
 503                         z + 0.5 * noise_height_select->np->spread.Z);
 504
 505                 noise_mud->perlinMap2D(
 506                         x + 0.5 * noise_mud->np->spread.X,
 507                         z + 0.5 * noise_mud->np->spread.Z);
 508                 noise_mud->transformNoiseMap();
 509         }
 510
 511         noise_beach->perlinMap2D(
 512                 x + 0.2 * noise_beach->np->spread.X,
 513                 z + 0.7 * noise_beach->np->spread.Z);
 514
 515         noise_biome->perlinMap2D(
 516                 x + 0.6 * noise_biome->np->spread.X,
 517                 z + 0.2 * noise_biome->np->spread.Z);
 518 }
 519
 520
 521 int MapgenV6::generateGround() {
 522         //TimeTaker timer1("Generating ground level");
 523         MapNode n_air(CONTENT_AIR), n_water_source(c_water_source);
 524         MapNode n_stone(c_stone), n_desert_stone(c_desert_stone);
 525         int stone_surface_max_y = -MAP_GENERATION_LIMIT;
 526         u32 index = 0;
 527
 528         for (s16 z = node_min.Z; z <= node_max.Z; z++)
 529         for (s16 x = node_min.X; x <= node_max.X; x++, index++) {
 530                 // Surface height
 531                 s16 surface_y = (s16)baseTerrainLevelFromMap(index);
 532
 533                 // Log it
 534                 if (surface_y > stone_surface_max_y)
 535                         stone_surface_max_y = surface_y;
 536
 537                 BiomeType bt = getBiome(index, v2s16(x, z));
 538
 539                 // Fill ground with stone
 540                 v3s16 em = vm->m_area.getExtent();
 541                 u32 i = vm->m_area.index(x, node_min.Y, z);
 542                 for (s16 y = node_min.Y; y <= node_max.Y; y++) {
 543                         if (vm->m_data[i].getContent() == CONTENT_IGNORE) {
 544                                 if (y <= surface_y) {
 545                                         vm->m_data[i] = (y > water_level && bt == BT_DESERT) ?
 546                                                 n_desert_stone : n_stone;
 547                                 } else if (y <= water_level) {
 548                                         vm->m_data[i] = n_water_source;
 549                                 } else {
 550                                         vm->m_data[i] = n_air;
 551                                 }
 552                         }
 553                         vm->m_area.add_y(em, i, 1);
 554                 }
 555         }
 556
 557         return stone_surface_max_y;
 558 }
 559
 560
 561 void MapgenV6::addMud() {
 562         // 15ms @cs=8
 563         //TimeTaker timer1("add mud");
 564         MapNode n_dirt(c_dirt), n_gravel(c_gravel);
 565         MapNode n_sand(c_sand), n_desert_sand(c_desert_sand);
 566         MapNode addnode;
 567
 568         u32 index = 0;
 569         for (s16 z = node_min.Z; z <= node_max.Z; z++)
 570         for (s16 x = node_min.X; x <= node_max.X; x++, index++) {
 571                 // Randomize mud amount
 572                 s16 mud_add_amount = getMudAmount(index) / 2.0 + 0.5;
 573
 574                 // Find ground level
 575                 s16 surface_y = find_stone_level(v2s16(x, z)); /////////////////optimize this!
 576
 577                 // Handle area not found
 578                 if (surface_y == vm->m_area.MinEdge.Y - 1)
 579                         continue;
 580
 581                 BiomeType bt = getBiome(index, v2s16(x, z));
 582                 addnode = (bt == BT_DESERT) ? n_desert_sand : n_dirt;
 583
 584                 if (bt == BT_DESERT && surface_y + mud_add_amount <= water_level + 1) {
 585                         addnode = n_sand;
 586                 } else if (mud_add_amount <= 0) {
 587                         mud_add_amount = 1 - mud_add_amount;
 588                         addnode = n_gravel;
 589                 } else if (bt == BT_NORMAL && getHaveBeach(index) &&
 590                                 surface_y + mud_add_amount <= water_level + 2) {
 591                         addnode = n_sand;
 592                 }
 593
 594                 if (bt == BT_DESERT && surface_y > 20)
 595                         mud_add_amount = MYMAX(0, mud_add_amount - (surface_y - 20) / 5);
 596
 597                 // If topmost node is grass, change it to mud.  It might be if it was
 598                 // flown to there from a neighboring chunk and then converted.
 599                 u32 i = vm->m_area.index(x, surface_y, z);
 600                 if (vm->m_data[i].getContent() == c_dirt_with_grass)
 601                         vm->m_data[i] = n_dirt;
 602
 603                 // Add mud on ground
 604                 s16 mudcount = 0;
 605                 v3s16 em = vm->m_area.getExtent();
 606                 s16 y_start = surface_y + 1;
 607                 i = vm->m_area.index(x, y_start, z);
 608                 for (s16 y = y_start; y <= node_max.Y; y++) {
 609                         if (mudcount >= mud_add_amount)
 610                                 break;
 611
 612                         vm->m_data[i] = addnode;
 613                         mudcount++;
 614
 615                         vm->m_area.add_y(em, i, 1);
 616                 }
 617         }
 618 }
 619
 620
 621 void MapgenV6::flowMud(s16 &mudflow_minpos, s16 &mudflow_maxpos) {
 622         // 340ms @cs=8
 623         TimeTaker timer1("flow mud");
 624
 625         // Iterate a few times
 626         for(s16 k = 0; k < 3; k++) {
 627                 for (s16 z = mudflow_minpos; z <= mudflow_maxpos; z++)
 628                 for (s16 x = mudflow_minpos; x <= mudflow_maxpos; x++) {
 629                         // Invert coordinates every 2nd iteration
 630                         if (k % 2 == 0) {
 631                                 x = mudflow_maxpos - (x - mudflow_minpos);
 632                                 z = mudflow_maxpos - (z - mudflow_minpos);
 633                         }
 634
 635                         // Node position in 2d
 636                         v2s16 p2d = v2s16(node_min.X, node_min.Z) + v2s16(x, z);
 637
 638                         v3s16 em = vm->m_area.getExtent();
 639                         u32 i = vm->m_area.index(p2d.X, node_max.Y, p2d.Y);
 640                         s16 y = node_max.Y;
 641
 642                         while(y >= node_min.Y)
 643                         {
 644
 645                         for(;; y--)
 646                         {
 647                                 MapNode *n = NULL;
 648                                 // Find mud
 649                                 for(; y >= node_min.Y; y--) {
 650                                         n = &vm->m_data[i];
 651                                         if (n->getContent() == c_dirt ||
 652                                                 n->getContent() == c_dirt_with_grass ||
 653                                                 n->getContent() == c_gravel)
 654                                                 break;
 655
 656                                         vm->m_area.add_y(em, i, -1);
 657                                 }
 658
 659                                 // Stop if out of area
 660                                 //if(vmanip.m_area.contains(i) == false)
 661                                 if (y < node_min.Y)
 662                                         break;
 663
 664                                 if (n->getContent() == c_dirt ||
 665                                         n->getContent() == c_dirt_with_grass)
 666                                 {
 667                                         // Make it exactly mud
 668                                         n->setContent(c_dirt);
 669
 670                                         // Don't flow it if the stuff under it is not mud
 671                                         {
 672                                                 u32 i2 = i;
 673                                                 vm->m_area.add_y(em, i2, -1);
 674                                                 // Cancel if out of area
 675                                                 if(vm->m_area.contains(i2) == false)
 676                                                         continue;
 677                                                 MapNode *n2 = &vm->m_data[i2];
 678                                                 if (n2->getContent() != c_dirt &&
 679                                                         n2->getContent() != c_dirt_with_grass)
 680                                                         continue;
 681                                         }
 682                                 }
 683
 684                                 v3s16 dirs4[4] = {
 685                                         v3s16(0,0,1), // back
 686                                         v3s16(1,0,0), // right
 687                                         v3s16(0,0,-1), // front
 688                                         v3s16(-1,0,0), // left
 689                                 };
 690
 691                                 // Check that upper is air or doesn't exist.
 692                                 // Cancel dropping if upper keeps it in place
 693                                 u32 i3 = i;
 694                                 vm->m_area.add_y(em, i3, 1);
 695                                 if (vm->m_area.contains(i3) == true &&
 696                                         ndef->get(vm->m_data[i3]).walkable)
 697                                         continue;
 698
 699                                 // Drop mud on side
 700                                 for(u32 di=0; di<4; di++) {
 701                                         v3s16 dirp = dirs4[di];
 702                                         u32 i2 = i;
 703                                         // Move to side
 704                                         vm->m_area.add_p(em, i2, dirp);
 705                                         // Fail if out of area
 706                                         if (vm->m_area.contains(i2) == false)
 707                                                 continue;
 708                                         // Check that side is air
 709                                         MapNode *n2 = &vm->m_data[i2];
 710                                         if (ndef->get(*n2).walkable)
 711                                                 continue;
 712                                         // Check that under side is air
 713                                         vm->m_area.add_y(em, i2, -1);
 714                                         if (vm->m_area.contains(i2) == false)
 715                                                 continue;
 716                                         n2 = &vm->m_data[i2];
 717                                         if (ndef->get(*n2).walkable)
 718                                                 continue;
 719                                         // Loop further down until not air
 720                                         bool dropped_to_unknown = false;
 721                                         do {
 722                                                 vm->m_area.add_y(em, i2, -1);
 723                                                 n2 = &vm->m_data[i2];
 724                                                 // if out of known area
 725                                                 if(vm->m_area.contains(i2) == false ||
 726                                                         n2->getContent() == CONTENT_IGNORE) {
 727                                                         dropped_to_unknown = true;
 728                                                         break;
 729                                                 }
 730                                         } while (ndef->get(*n2).walkable == false);
 731                                         // Loop one up so that we're in air
 732                                         vm->m_area.add_y(em, i2, 1);
 733                                         n2 = &vm->m_data[i2];
 734
 735                                         bool old_is_water = (n->getContent() == c_water_source);
 736                                         // Move mud to new place
 737                                         if (!dropped_to_unknown) {
 738                                                 *n2 = *n;
 739                                                 // Set old place to be air (or water)
 740                                                 if(old_is_water)
 741                                                         *n = MapNode(c_water_source);
 742                                                 else
 743                                                         *n = MapNode(CONTENT_AIR);
 744                                         }
 745
 746                                         // Done
 747                                         break;
 748                                 }
 749                         }
 750                         }
 751                 }
 752         }
 753 }
 754
 755
 756 void MapgenV6::addDirtGravelBlobs() {
 757         if (getBiome(v2s16(node_min.X, node_min.Z)) != BT_NORMAL)
 758                 return;
 759
 760         PseudoRandom pr(blockseed + 983);
 761         for (int i = 0; i < volume_nodes/10/10/10; i++) {
 762                 bool only_fill_cave = (myrand_range(0,1) != 0);
 763                 v3s16 size(
 764                         pr.range(1, 8),
 765                         pr.range(1, 8),
 766                         pr.range(1, 8)
 767                 );
 768                 v3s16 p0(
 769                         pr.range(node_min.X, node_max.X) - size.X / 2,
 770                         pr.range(node_min.Y, node_max.Y) - size.Y / 2,
 771                         pr.range(node_min.Z, node_max.Z) - size.Z / 2
 772                 );
 773
 774                 MapNode n1((p0.Y > -32 && !pr.range(0, 1)) ? c_dirt : c_gravel);
 775                 for (int z1 = 0; z1 < size.Z; z1++)
 776                 for (int y1 = 0; y1 < size.Y; y1++)
 777                 for (int x1 = 0; x1 < size.X; x1++) {
 778                         v3s16 p = p0 + v3s16(x1, y1, z1);
 779                         u32 i = vm->m_area.index(p);
 780                         if (!vm->m_area.contains(i))
 781                                 continue;
 782                         // Cancel if not stone and not cave air
 783                         if (vm->m_data[i].getContent() != c_stone &&
 784                                 !(vm->m_flags[i] & VMANIP_FLAG_CAVE))
 785                                 continue;
 786                         if (only_fill_cave && !(vm->m_flags[i] & VMANIP_FLAG_CAVE))
 787                                 continue;
 788                         vm->m_data[i] = n1;
 789                 }
 790         }
 791 }
 792
 793
 794 void MapgenV6::placeTreesAndJungleGrass() {
 795         //TimeTaker t("placeTrees");
 796         if (node_max.Y < water_level)
 797                 return;
 798
 799         PseudoRandom grassrandom(blockseed + 53);
 800         content_t c_junglegrass = ndef->getId("mapgen_junglegrass");
 801         // if we don't have junglegrass, don't place cignore... that's bad
 802         if (c_junglegrass == CONTENT_IGNORE)
 803                 c_junglegrass = CONTENT_AIR;
 804         MapNode n_junglegrass(c_junglegrass);
 805         v3s16 em = vm->m_area.getExtent();
 806
 807         // Divide area into parts
 808         s16 div = 8;
 809         s16 sidelen = central_area_size.X / div;
 810         double area = sidelen * sidelen;
 811
 812         // N.B.  We must add jungle grass first, since tree leaves will
 813         // obstruct the ground, giving us a false ground level
 814         for (s16 z0 = 0; z0 < div; z0++)
 815         for (s16 x0 = 0; x0 < div; x0++) {
 816                 // Center position of part of division
 817                 v2s16 p2d_center(
 818                         node_min.X + sidelen / 2 + sidelen * x0,
 819                         node_min.Z + sidelen / 2 + sidelen * z0
 820                 );
 821                 // Minimum edge of part of division
 822                 v2s16 p2d_min(
 823                         node_min.X + sidelen * x0,
 824                         node_min.Z + sidelen * z0
 825                 );
 826                 // Maximum edge of part of division
 827                 v2s16 p2d_max(
 828                         node_min.X + sidelen + sidelen * x0 - 1,
 829                         node_min.Z + sidelen + sidelen * z0 - 1
 830                 );
 831
 832                 // Amount of trees, jungle area
 833                 u32 tree_count = area * getTreeAmount(p2d_center);
 834
 835                 float humidity;
 836                 bool is_jungle = false;
 837                 if (flags & MGV6_JUNGLES) {
 838                         humidity = getHumidity(p2d_center);
 839                         if (humidity > 0.75) {
 840                                 is_jungle = true;
 841                                 tree_count *= 4;
 842                         }
 843                 }
 844
 845                 // Add jungle grass
 846                 if (is_jungle) {
 847                         u32 grass_count = 5 * humidity * tree_count;
 848                         for (u32 i = 0; i < grass_count; i++) {
 849                                 s16 x = grassrandom.range(p2d_min.X, p2d_max.X);
 850                                 s16 z = grassrandom.range(p2d_min.Y, p2d_max.Y);
 851
 852                                 s16 y = find_ground_level(v2s16(x, z)); ////////////////optimize this!
 853                                 if (y < water_level || y < node_min.Y || y > node_max.Y)
 854                                         continue;
 855
 856                                 u32 vi = vm->m_area.index(x, y, z);
 857                                 // place on dirt_with_grass, since we know it is exposed to sunlight
 858                                 if (vm->m_data[vi].getContent() == c_dirt_with_grass) {
 859                                         vm->m_area.add_y(em, vi, 1);
 860                                         vm->m_data[vi] = n_junglegrass;
 861                                 }
 862                         }
 863                 }
 864
 865                 // Put trees in random places on part of division
 866                 for (u32 i = 0; i < tree_count; i++) {
 867                         s16 x = myrand_range(p2d_min.X, p2d_max.X);
 868                         s16 z = myrand_range(p2d_min.Y, p2d_max.Y);
 869                         s16 y = find_ground_level(v2s16(x, z)); ////////////////////optimize this!
 870                         // Don't make a tree under water level
 871                         // Don't make a tree so high that it doesn't fit
 872                         if(y < water_level || y > node_max.Y - 6)
 873                                 continue;
 874
 875                         v3s16 p(x,y,z);
 876                         // Trees grow only on mud and grass
 877                         {
 878                                 u32 i = vm->m_area.index(p);
 879                                 MapNode *n = &vm->m_data[i];
 880                                 if (n->getContent() != c_dirt &&
 881                                         n->getContent() != c_dirt_with_grass)
 882                                         continue;
 883                         }
 884                         p.Y++;
 885
 886                         // Make a tree
 887                         if (is_jungle) {
 888                                 treegen::make_jungletree(*vm, p, ndef, myrand());
 889                         } else {
 890                                 bool is_apple_tree = (myrand_range(0, 3) == 0) &&
 891                                                                                 getHaveAppleTree(v2s16(x, z));
 892                                 treegen::make_tree(*vm, p, is_apple_tree, ndef, myrand());
 893                         }
 894                 }
 895         }
 896         //printf("placeTreesAndJungleGrass: %dms\n", t.stop());
 897 }
 898
 899
 900 void MapgenV6::growGrass() {
 901         for (s16 z = full_node_min.Z; z <= full_node_max.Z; z++)
 902         for (s16 x = full_node_min.X; x <= full_node_max.X; x++) {
 903                 // Find the lowest surface to which enough light ends up to make
 904                 // grass grow.  Basically just wait until not air and not leaves.
 905                 s16 surface_y = 0;
 906                 {
 907                         v3s16 em = vm->m_area.getExtent();
 908                         u32 i = vm->m_area.index(x, node_max.Y, z);
 909                         s16 y;
 910                         // Go to ground level
 911                         for (y = node_max.Y; y >= full_node_min.Y; y--) {
 912                                 MapNode &n = vm->m_data[i];
 913                                 if (ndef->get(n).param_type != CPT_LIGHT ||
 914                                         ndef->get(n).liquid_type != LIQUID_NONE)
 915                                         break;
 916                                 vm->m_area.add_y(em, i, -1);
 917                         }
 918                         surface_y = (y >= full_node_min.Y) ? y : full_node_min.Y;
 919                 }
 920
 921                 u32 i = vm->m_area.index(x, surface_y, z);
 922                 MapNode *n = &vm->m_data[i];
 923                 if (n->getContent() == c_dirt && surface_y >= water_level - 20)
 924                         n->setContent(c_dirt_with_grass);
 925         }
 926 }
 927
 928
 929 void MapgenV6::defineCave(Cave &cave, PseudoRandom ps,
 930                                                  v3s16 node_min, bool large_cave) {
 931                 cave.min_tunnel_diameter = 2;
 932                 cave.max_tunnel_diameter = ps.range(2,6);
 933                 cave.dswitchint = ps.range(1,14);
 934                 cave.flooded = true; //large_cave && ps.range(0,4);
 935                 if(large_cave){
 936                         cave.part_max_length_rs = ps.range(2,4);
 937                         cave.tunnel_routepoints = ps.range(5, ps.range(15,30));
 938                         cave.min_tunnel_diameter = 5;
 939                         cave.max_tunnel_diameter = ps.range(7, ps.range(8,24));
 940                 } else {
 941                         cave.part_max_length_rs = ps.range(2,9);
 942                         cave.tunnel_routepoints = ps.range(10, ps.range(15,30));
 943                 }
 944                 cave.large_cave_is_flat = (ps.range(0,1) == 0);
 945 }
 946
 947
 948 void MapgenV6::generateCaves(int max_stone_y) {
 949         // 24ms @cs=8
 950         //TimeTaker timer1("caves");
 951
 952         /*double cave_amount = 6.0 + 6.0 * noise2d_perlin(
 953                 0.5+(double)node_min.X/250, 0.5+(double)node_min.Y/250,
 954                 data->seed+34329, 3, 0.50);*/
 955         const s16 max_spread_amount = MAP_BLOCKSIZE;
 956         float cave_amount = NoisePerlin2D(np_cave, node_min.X, node_min.Y, seed);
 957
 958         cave_amount = MYMAX(0.0, cave_amount);
 959         u32 caves_count = cave_amount * volume_nodes / 50000;
 960         u32 bruises_count = 1;
 961         PseudoRandom ps(blockseed + 21343);
 962         PseudoRandom ps2(blockseed + 1032);
 963
 964         if (ps.range(1, 6) == 1)
 965                 bruises_count = ps.range(0, ps.range(0, 2));
 966
 967         if (getBiome(v2s16(node_min.X, node_min.Z)) == BT_DESERT) {
 968                 caves_count   /= 3;
 969                 bruises_count /= 3;
 970         }
 971
 972         for(u32 jj = 0; jj < caves_count + bruises_count; jj++) {
 973                 /*int avg_height = (int)
 974                           ((base_rock_level_2d(data->seed, v2s16(node_min.X, node_min.Z)) +
 975                                 base_rock_level_2d(data->seed, v2s16(node_max.X, node_max.Z))) / 2);
 976                 if ((node_max.Y + node_min.Y) / 2 > avg_height)
 977                         break;*/
 978
 979                 bool large_cave = (jj >= caves_count);
 980
 981                 Cave cave;
 982                 defineCave(cave, ps, node_min, large_cave);
 983
 984                 v3f main_direction(0,0,0);
 985
 986                 // Allowed route area size in nodes
 987                 v3s16 ar = central_area_size;
 988
 989                 // Area starting point in nodes
 990                 v3s16 of = node_min;
 991
 992                 // Allow a bit more
 993                 //(this should be more than the maximum radius of the tunnel)
 994                 s16 insure = 10;
 995                 s16 more = max_spread_amount - cave.max_tunnel_diameter / 2 - insure;
 996                 ar += v3s16(1,0,1) * more * 2;
 997                 of -= v3s16(1,0,1) * more;
 998
 999                 s16 route_y_min = 0;
1000                 // Allow half a diameter + 7 over stone surface
1001                 s16 route_y_max = -of.Y + max_stone_y + cave.max_tunnel_diameter/2 + 7;
1002
1003                 // Limit maximum to area
1004                 route_y_max = rangelim(route_y_max, 0, ar.Y-1);
1005
1006                 if(large_cave)
1007                 {
1008                         s16 min = 0;
1009                         if(node_min.Y < water_level && node_max.Y > water_level)
1010                         {
1011                                 min = water_level - cave.max_tunnel_diameter/3 - of.Y;
1012                                 route_y_max = water_level + cave.max_tunnel_diameter/3 - of.Y;
1013                         }
1014                         route_y_min = ps.range(min, min + cave.max_tunnel_diameter);
1015                         route_y_min = rangelim(route_y_min, 0, route_y_max);
1016                 }
1017
1018                 s16 route_start_y_min = route_y_min;
1019                 s16 route_start_y_max = route_y_max;
1020
1021                 route_start_y_min = rangelim(route_start_y_min, 0, ar.Y-1);
1022                 route_start_y_max = rangelim(route_start_y_max, route_start_y_min, ar.Y-1);
1023
1024                 // Randomize starting position
1025                 v3f orp(
1026                         (float)(ps.next()%ar.X)+0.5,
1027                         (float)(ps.range(route_start_y_min, route_start_y_max))+0.5,
1028                         (float)(ps.next()%ar.Z)+0.5
1029                 );
1030
1031                 v3s16 startp(orp.X, orp.Y, orp.Z);
1032                 startp += of;
1033
1034                 MapNode airnode(CONTENT_AIR);
1035                 MapNode waternode(c_water_source);
1036                 MapNode lavanode(c_lava_source);
1037
1038                 /*
1039                         Generate some tunnel starting from orp
1040                 */
1041
1042                 for(u16 j=0; j<cave.tunnel_routepoints; j++)
1043                 {
1044                         if(j%cave.dswitchint==0 && large_cave == false)
1045                         {
1046                                 main_direction = v3f(
1047                                         ((float)(ps.next()%20)-(float)10)/10,
1048                                         ((float)(ps.next()%20)-(float)10)/30,
1049                                         ((float)(ps.next()%20)-(float)10)/10
1050                                 );
1051                                 main_direction *= (float)ps.range(0, 10)/10;
1052                         }
1053
1054                         // Randomize size
1055                         s16 min_d = cave.min_tunnel_diameter;
1056                         s16 max_d = cave.max_tunnel_diameter;
1057                         s16 rs = ps.range(min_d, max_d);
1058
1059                         // Every second section is rough
1060                         bool randomize_xz = (ps2.range(1,2) == 1);
1061
1062                         v3s16 maxlen;
1063                         if(large_cave)
1064                         {
1065                                 maxlen = v3s16(
1066                                         rs*cave.part_max_length_rs,
1067                                         rs*cave.part_max_length_rs/2,
1068                                         rs*cave.part_max_length_rs
1069                                 );
1070                         }
1071                         else
1072                         {
1073                                 maxlen = v3s16(
1074                                         rs*cave.part_max_length_rs,
1075                                         ps.range(1, rs*cave.part_max_length_rs),
1076                                         rs*cave.part_max_length_rs
1077                                 );
1078                         }
1079
1080                         v3f vec;
1081
1082                         vec = v3f(
1083                                 (float)(ps.next()%(maxlen.X*1))-(float)maxlen.X/2,
1084                                 (float)(ps.next()%(maxlen.Y*1))-(float)maxlen.Y/2,
1085                                 (float)(ps.next()%(maxlen.Z*1))-(float)maxlen.Z/2
1086                         );
1087
1088                         // Jump downward sometimes
1089                         if(!large_cave && ps.range(0,12) == 0)
1090                         {
1091                                 vec = v3f(
1092                                         (float)(ps.next()%(maxlen.X*1))-(float)maxlen.X/2,
1093                                         (float)(ps.next()%(maxlen.Y*2))-(float)maxlen.Y*2/2,
1094                                         (float)(ps.next()%(maxlen.Z*1))-(float)maxlen.Z/2
1095                                 );
1096                         }
1097
1098                         /*if(large_cave){
1099                                 v3f p = orp + vec;
1100                                 s16 h = find_ground_level_clever(vmanip,
1101                                                 v2s16(p.X, p.Z), ndef);
1102                                 route_y_min = h - rs/3;
1103                                 route_y_max = h + rs;
1104                         }*/
1105
1106                         vec += main_direction;
1107
1108                         v3f rp = orp + vec;
1109                         if(rp.X < 0)
1110                                 rp.X = 0;
1111                         else if(rp.X >= ar.X)
1112                                 rp.X = ar.X-1;
1113                         if(rp.Y < route_y_min)
1114                                 rp.Y = route_y_min;
1115                         else if(rp.Y >= route_y_max)
1116                                 rp.Y = route_y_max-1;
1117                         if(rp.Z < 0)
1118                                 rp.Z = 0;
1119                         else if(rp.Z >= ar.Z)
1120                                 rp.Z = ar.Z-1;
1121                         vec = rp - orp;
1122
1123                         for(float f=0; f<1.0; f+=1.0/vec.getLength())
1124                         {
1125                                 v3f fp = orp + vec * f;
1126                                 fp.X += 0.1*ps.range(-10,10);
1127                                 fp.Z += 0.1*ps.range(-10,10);
1128                                 v3s16 cp(fp.X, fp.Y, fp.Z);
1129
1130                                 s16 d0 = -rs/2;
1131                                 s16 d1 = d0 + rs;
1132                                 if(randomize_xz){
1133                                         d0 += ps.range(-1,1);
1134                                         d1 += ps.range(-1,1);
1135                                 }
1136                                 for(s16 z0=d0; z0<=d1; z0++)
1137                                 {
1138                                         s16 si = rs/2 - MYMAX(0, abs(z0)-rs/7-1);
1139                                         for(s16 x0=-si-ps.range(0,1); x0<=si-1+ps.range(0,1); x0++)
1140                                         {
1141                                                 s16 maxabsxz = MYMAX(abs(x0), abs(z0));
1142                                                 s16 si2 = rs/2 - MYMAX(0, maxabsxz-rs/7-1);
1143                                                 for(s16 y0=-si2; y0<=si2; y0++)
1144                                                 {
1145                                                         /*// Make better floors in small caves
1146                                                         if(y0 <= -rs/2 && rs<=7)
1147                                                                 continue;*/
1148                                                         if (cave.large_cave_is_flat) {
1149                                                                 // Make large caves not so tall
1150                                                                 if (rs > 7 && abs(y0) >= rs/3)
1151                                                                         continue;
1152                                                         }
1153
1154                                                         s16 z = cp.Z + z0;
1155                                                         s16 y = cp.Y + y0;
1156                                                         s16 x = cp.X + x0;
1157                                                         v3s16 p(x,y,z);
1158                                                         p += of;
1159
1160                                                         if(vm->m_area.contains(p) == false)
1161                                                                 continue;
1162
1163                                                         u32 i = vm->m_area.index(p);
1164
1165                                                         if(large_cave) {
1166                                                                 if (cave.flooded && full_node_min.Y < water_level &&
1167                                                                         full_node_max.Y > water_level) {
1168                                                                         if (p.Y <= water_level)
1169                                                                                 vm->m_data[i] = waternode;
1170                                                                         else
1171                                                                                 vm->m_data[i] = airnode;
1172                                                                 } else if (cave.flooded && full_node_max.Y < water_level) {
1173                                                                         if (p.Y < startp.Y - 2)
1174                                                                                 vm->m_data[i] = lavanode;
1175                                                                         else
1176                                                                                 vm->m_data[i] = airnode;
1177                                                                 } else {
1178                                                                         vm->m_data[i] = airnode;
1179                                                                 }
1180                                                         } else {
1181                                                                 // Don't replace air or water or lava or ignore
1182                                                                 if (vm->m_data[i].getContent() == CONTENT_IGNORE ||
1183                                                                         vm->m_data[i].getContent() == CONTENT_AIR ||
1184                                                                         vm->m_data[i].getContent() == c_water_source ||
1185                                                                         vm->m_data[i].getContent() == c_lava_source)
1186                                                                         continue;
1187
1188                                                                 vm->m_data[i] = airnode;
1189
1190                                                                 // Set tunnel flag
1191                                                                 vm->m_flags[i] |= VMANIP_FLAG_CAVE;
1192                                                         }
1193                                                 }
1194                                         }
1195                                 }
1196                         }
1197                         orp = rp;
1198                 }
1199         }
1200 }