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