src/mg_decoration.cpp

   1 /*
   2 Minetest
   3 Copyright (C) 2010-2014 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
   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 "mg_decoration.h"
  21 #include "mg_schematic.h"
  22 #include "mapgen.h"
  23 #include "noise.h"
  24 #include "map.h"
  25 #include "log.h"
  26 #include "util/numeric.h"
  27
  28 const char *DecorationManager::ELEMENT_TITLE = "decoration";
  29
  30 FlagDesc flagdesc_deco_schematic[] = {
  31         {"place_center_x", DECO_PLACE_CENTER_X},
  32         {"place_center_y", DECO_PLACE_CENTER_Y},
  33         {"place_center_z", DECO_PLACE_CENTER_Z},
  34         {NULL,             0}
  35 };
  36
  37
  38 ///////////////////////////////////////////////////////////////////////////////
  39
  40
  41 size_t DecorationManager::placeAllDecos(Mapgen *mg, u32 seed, v3s16 nmin, v3s16 nmax)
  42 {
  43         size_t nplaced = 0;
  44
  45         for (size_t i = 0; i != m_elements.size(); i++) {
  46                 Decoration *deco = (Decoration *)m_elements[i];
  47                 if (!deco)
  48                         continue;
  49
  50                 nplaced += deco->placeDeco(mg, seed, nmin, nmax);
  51                 seed++;
  52         }
  53
  54         return nplaced;
  55 }
  56
  57
  58 ///////////////////////////////////////////////////////////////////////////////
  59
  60
  61 Decoration::Decoration()
  62 {
  63         mapseed    = 0;
  64         np         = NULL;
  65         fill_ratio = 0;
  66         sidelen    = 1;
  67 }
  68
  69
  70 Decoration::~Decoration()
  71 {
  72         delete np;
  73 }
  74
  75
  76 size_t Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
  77 {
  78         PseudoRandom ps(blockseed + 53);
  79         int carea_size = nmax.X - nmin.X + 1;
  80
  81         // Divide area into parts
  82         if (carea_size % sidelen) {
  83                 errorstream << "Decoration::placeDeco: chunk size is not divisible by "
  84                         "sidelen; setting sidelen to " << carea_size << std::endl;
  85                 sidelen = carea_size;
  86         }
  87
  88         s16 divlen = carea_size / sidelen;
  89         int area = sidelen * sidelen;
  90
  91         for (s16 z0 = 0; z0 < divlen; z0++)
  92         for (s16 x0 = 0; x0 < divlen; x0++) {
  93                 v2s16 p2d_center( // Center position of part of division
  94                         nmin.X + sidelen / 2 + sidelen * x0,
  95                         nmin.Z + sidelen / 2 + sidelen * z0
  96                 );
  97                 v2s16 p2d_min( // Minimum edge of part of division
  98                         nmin.X + sidelen * x0,
  99                         nmin.Z + sidelen * z0
 100                 );
 101                 v2s16 p2d_max( // Maximum edge of part of division
 102                         nmin.X + sidelen + sidelen * x0 - 1,
 103                         nmin.Z + sidelen + sidelen * z0 - 1
 104                 );
 105
 106                 // Amount of decorations
 107                 float nval = np ?
 108                         NoisePerlin2D(np, p2d_center.X, p2d_center.Y, mapseed) :
 109                         fill_ratio;
 110                 u32 deco_count = area * MYMAX(nval, 0.f);
 111
 112                 for (u32 i = 0; i < deco_count; i++) {
 113                         s16 x = ps.range(p2d_min.X, p2d_max.X);
 114                         s16 z = ps.range(p2d_min.Y, p2d_max.Y);
 115
 116                         int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
 117
 118                         s16 y = mg->heightmap ?
 119                                         mg->heightmap[mapindex] :
 120                                         mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
 121
 122                         if (y < nmin.Y || y > nmax.Y)
 123                                 continue;
 124
 125                         int height = getHeight();
 126                         int max_y = nmax.Y;// + MAP_BLOCKSIZE - 1;
 127                         if (y + 1 + height > max_y) {
 128                                 continue;
 129 #if 0
 130                                 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
 131                                 //add to queue
 132                                 JMutexAutoLock cutofflock(cutoff_mutex);
 133                                 cutoffs.push_back(CutoffData(x, y, z, height));
 134 #endif
 135                         }
 136
 137                         if (mg->biomemap) {
 138                                 std::set<u8>::iterator iter;
 139
 140                                 if (biomes.size()) {
 141                                         iter = biomes.find(mg->biomemap[mapindex]);
 142                                         if (iter == biomes.end())
 143                                                 continue;
 144                                 }
 145                         }
 146
 147                         generate(mg, &ps, max_y, v3s16(x, y, z));
 148                 }
 149         }
 150
 151         return 0;
 152 }
 153
 154
 155 #if 0
 156 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
 157 {
 158         PseudoRandom pr(blockseed + 53);
 159         std::vector<CutoffData> handled_cutoffs;
 160
 161         // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
 162         {
 163                 JMutexAutoLock cutofflock(cutoff_mutex);
 164                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
 165                         i != cutoffs.end(); ++i) {
 166                         CutoffData cutoff = *i;
 167                         v3s16 p    = cutoff.p;
 168                         s16 height = cutoff.height;
 169                         if (p.X < nmin.X || p.X > nmax.X ||
 170                                 p.Z < nmin.Z || p.Z > nmax.Z)
 171                                 continue;
 172                         if (p.Y + height < nmin.Y || p.Y > nmax.Y)
 173                                 continue;
 174
 175                         handled_cutoffs.push_back(cutoff);
 176                 }
 177         }
 178
 179         // Generate the cutoffs
 180         for (size_t i = 0; i != handled_cutoffs.size(); i++) {
 181                 v3s16 p    = handled_cutoffs[i].p;
 182                 s16 height = handled_cutoffs[i].height;
 183
 184                 if (p.Y + height > nmax.Y) {
 185                         //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
 186                         cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
 187                 }
 188
 189                 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
 190         }
 191
 192         // Remove cutoffs that were handled from the cutoff list
 193         {
 194                 JMutexAutoLock cutofflock(cutoff_mutex);
 195                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
 196                         i != cutoffs.end(); ++i) {
 197
 198                         for (size_t j = 0; j != handled_cutoffs.size(); j++) {
 199                                 CutoffData coff = *i;
 200                                 if (coff.p == handled_cutoffs[j].p)
 201                                         i = cutoffs.erase(i);
 202                         }
 203                 }
 204         }
 205 }
 206 #endif
 207
 208
 209 ///////////////////////////////////////////////////////////////////////////////
 210
 211
 212 bool DecoSimple::canPlaceDecoration(ManualMapVoxelManipulator *vm, v3s16 p)
 213 {
 214         // Don't bother if there aren't any decorations to place
 215         if (c_decos.size() == 0)
 216                 return false;
 217
 218         u32 vi = vm->m_area.index(p);
 219
 220         // Check if the decoration can be placed on this node
 221         if (!CONTAINS(c_place_on, vm->m_data[vi].getContent()))
 222                 return false;
 223
 224         // Don't continue if there are no spawnby constraints
 225         if (nspawnby == -1)
 226                 return true;
 227
 228         int nneighs = 0;
 229         v3s16 dirs[8] = {
 230                 v3s16( 0, 0,  1),
 231                 v3s16( 0, 0, -1),
 232                 v3s16( 1, 0,  0),
 233                 v3s16(-1, 0,  0),
 234                 v3s16( 1, 0,  1),
 235                 v3s16(-1, 0,  1),
 236                 v3s16(-1, 0, -1),
 237                 v3s16( 1, 0, -1)
 238         };
 239
 240         // Check a Moore neighborhood if there are enough spawnby nodes
 241         for (size_t i = 0; i != ARRLEN(dirs); i++) {
 242                 u32 index = vm->m_area.index(p + dirs[i]);
 243                 if (!vm->m_area.contains(index))
 244                         continue;
 245
 246                 if (CONTAINS(c_spawnby, vm->m_data[index].getContent()))
 247                         nneighs++;
 248         }
 249
 250         if (nneighs < nspawnby)
 251                 return false;
 252
 253         return true;
 254 }
 255
 256
 257 void DecoSimple::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p)
 258 {
 259         ManualMapVoxelManipulator *vm = mg->vm;
 260
 261         if (!canPlaceDecoration(vm, p))
 262                 return;
 263
 264         content_t c_place = c_decos[pr->range(0, c_decos.size() - 1)];
 265
 266         s16 height = (deco_height_max > 0) ?
 267                 pr->range(deco_height, deco_height_max) : deco_height;
 268
 269         height = MYMIN(height, max_y - p.Y);
 270
 271         v3s16 em = vm->m_area.getExtent();
 272         u32 vi = vm->m_area.index(p);
 273         for (int i = 0; i < height; i++) {
 274                 vm->m_area.add_y(em, vi, 1);
 275
 276                 content_t c = vm->m_data[vi].getContent();
 277                 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
 278                         break;
 279
 280                 vm->m_data[vi] = MapNode(c_place);
 281         }
 282 }
 283
 284
 285 int DecoSimple::getHeight()
 286 {
 287         return (deco_height_max > 0) ? deco_height_max : deco_height;
 288 }
 289
 290
 291 ///////////////////////////////////////////////////////////////////////////////
 292
 293
 294 void DecoSchematic::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p)
 295 {
 296         ManualMapVoxelManipulator *vm = mg->vm;
 297
 298         if (flags & DECO_PLACE_CENTER_X)
 299                 p.X -= (schematic->size.X + 1) / 2;
 300         if (flags & DECO_PLACE_CENTER_Y)
 301                 p.Y -= (schematic->size.Y + 1) / 2;
 302         if (flags & DECO_PLACE_CENTER_Z)
 303                 p.Z -= (schematic->size.Z + 1) / 2;
 304
 305         u32 vi = vm->m_area.index(p);
 306         content_t c = vm->m_data[vi].getContent();
 307         if (!CONTAINS(c_place_on, c))
 308                 return;
 309
 310         Rotation rot = (rotation == ROTATE_RAND) ?
 311                 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
 312
 313         schematic->blitToVManip(p, vm, rot, false, mg->ndef);
 314 }
 315
 316
 317 int DecoSchematic::getHeight()
 318 {
 319         return schematic->size.Y;
 320 }