3 Copyright (C) 2010-2014 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
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.
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.
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.
20 #include "mg_decoration.h"
21 #include "mg_schematic.h"
26 #include "util/numeric.h"
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 {"force_placement", DECO_FORCE_PLACEMENT},
35 {"liquid_surface", DECO_LIQUID_SURFACE},
40 ///////////////////////////////////////////////////////////////////////////////
43 DecorationManager::DecorationManager(IGameDef *gamedef) :
44 ObjDefManager(gamedef, OBJDEF_DECORATION)
49 size_t DecorationManager::placeAllDecos(Mapgen *mg, u32 blockseed,
50 v3s16 nmin, v3s16 nmax)
54 for (size_t i = 0; i != m_objects.size(); i++) {
55 Decoration *deco = (Decoration *)m_objects[i];
59 nplaced += deco->placeDeco(mg, blockseed, nmin, nmax);
67 ///////////////////////////////////////////////////////////////////////////////
70 Decoration::Decoration()
79 Decoration::~Decoration()
84 void Decoration::resolveNodeNames()
86 getIdsFromNrBacklog(&c_place_on);
87 getIdsFromNrBacklog(&c_spawnby);
91 bool Decoration::canPlaceDecoration(MMVManip *vm, v3s16 p)
93 // Check if the decoration can be placed on this node
94 u32 vi = vm->m_area.index(p);
95 if (!CONTAINS(c_place_on, vm->m_data[vi].getContent()))
98 // Don't continue if there are no spawnby constraints
103 static const v3s16 dirs[16] = {
123 // Check these 16 neighbouring nodes for enough spawnby nodes
124 for (size_t i = 0; i != ARRLEN(dirs); i++) {
125 u32 index = vm->m_area.index(p + dirs[i]);
126 if (!vm->m_area.contains(index))
129 if (CONTAINS(c_spawnby, vm->m_data[index].getContent()))
133 if (nneighs < nspawnby)
140 size_t Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
142 PcgRandom ps(blockseed + 53);
143 int carea_size = nmax.X - nmin.X + 1;
145 // Divide area into parts
146 // If chunksize is changed it may no longer be divisable by sidelen
147 if (carea_size % sidelen)
148 sidelen = carea_size;
150 s16 divlen = carea_size / sidelen;
151 int area = sidelen * sidelen;
153 for (s16 z0 = 0; z0 < divlen; z0++)
154 for (s16 x0 = 0; x0 < divlen; x0++) {
155 v2s16 p2d_center( // Center position of part of division
156 nmin.X + sidelen / 2 + sidelen * x0,
157 nmin.Z + sidelen / 2 + sidelen * z0
159 v2s16 p2d_min( // Minimum edge of part of division
160 nmin.X + sidelen * x0,
161 nmin.Z + sidelen * z0
163 v2s16 p2d_max( // Maximum edge of part of division
164 nmin.X + sidelen + sidelen * x0 - 1,
165 nmin.Z + sidelen + sidelen * z0 - 1
168 // Amount of decorations
169 float nval = (flags & DECO_USE_NOISE) ?
170 NoisePerlin2D(&np, p2d_center.X, p2d_center.Y, mapseed) :
173 float deco_count_f = (float)area * nval;
174 if (deco_count_f >= 1.f) {
175 deco_count = deco_count_f;
176 } else if (deco_count_f > 0.f) {
177 // For low density decorations calculate a chance for 1 decoration
178 if (ps.range(1000) <= deco_count_f * 1000.f)
182 for (u32 i = 0; i < deco_count; i++) {
183 s16 x = ps.range(p2d_min.X, p2d_max.X);
184 s16 z = ps.range(p2d_min.Y, p2d_max.Y);
186 int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
188 s16 y = -MAX_MAP_GENERATION_LIMIT;
189 if (flags & DECO_LIQUID_SURFACE)
190 y = mg->findLiquidSurface(v2s16(x, z), nmin.Y, nmax.Y);
191 else if (mg->heightmap)
192 y = mg->heightmap[mapindex];
194 y = mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
196 if (y < nmin.Y || y > nmax.Y ||
197 y < y_min || y > y_max)
200 if (y + getHeight() > mg->vm->m_area.MaxEdge.Y) {
203 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
205 MutexAutoLock cutofflock(cutoff_mutex);
206 cutoffs.push_back(CutoffData(x, y, z, height));
211 UNORDERED_SET<u8>::iterator iter;
213 if (!biomes.empty()) {
214 iter = biomes.find(mg->biomemap[mapindex]);
215 if (iter == biomes.end())
221 if (generate(mg->vm, &ps, pos))
222 mg->gennotify.addEvent(GENNOTIFY_DECORATION, pos, index);
231 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
233 PcgRandom pr(blockseed + 53);
234 std::vector<CutoffData> handled_cutoffs;
236 // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
238 MutexAutoLock cutofflock(cutoff_mutex);
239 for (std::list<CutoffData>::iterator i = cutoffs.begin();
240 i != cutoffs.end(); ++i) {
241 CutoffData cutoff = *i;
243 s16 height = cutoff.height;
244 if (p.X < nmin.X || p.X > nmax.X ||
245 p.Z < nmin.Z || p.Z > nmax.Z)
247 if (p.Y + height < nmin.Y || p.Y > nmax.Y)
250 handled_cutoffs.push_back(cutoff);
254 // Generate the cutoffs
255 for (size_t i = 0; i != handled_cutoffs.size(); i++) {
256 v3s16 p = handled_cutoffs[i].p;
257 s16 height = handled_cutoffs[i].height;
259 if (p.Y + height > nmax.Y) {
260 //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
261 cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
264 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
267 // Remove cutoffs that were handled from the cutoff list
269 MutexAutoLock cutofflock(cutoff_mutex);
270 for (std::list<CutoffData>::iterator i = cutoffs.begin();
271 i != cutoffs.end(); ++i) {
273 for (size_t j = 0; j != handled_cutoffs.size(); j++) {
274 CutoffData coff = *i;
275 if (coff.p == handled_cutoffs[j].p)
276 i = cutoffs.erase(i);
284 ///////////////////////////////////////////////////////////////////////////////
287 void DecoSimple::resolveNodeNames()
289 Decoration::resolveNodeNames();
290 getIdsFromNrBacklog(&c_decos);
294 size_t DecoSimple::generate(MMVManip *vm, PcgRandom *pr, v3s16 p)
296 // Don't bother if there aren't any decorations to place
297 if (c_decos.size() == 0)
300 if (!canPlaceDecoration(vm, p))
303 content_t c_place = c_decos[pr->range(0, c_decos.size() - 1)];
305 s16 height = (deco_height_max > 0) ?
306 pr->range(deco_height, deco_height_max) : deco_height;
308 bool force_placement = (flags & DECO_FORCE_PLACEMENT);
310 v3s16 em = vm->m_area.getExtent();
311 u32 vi = vm->m_area.index(p);
312 for (int i = 0; i < height; i++) {
313 vm->m_area.add_y(em, vi, 1);
315 content_t c = vm->m_data[vi].getContent();
316 if (c != CONTENT_AIR && c != CONTENT_IGNORE &&
320 vm->m_data[vi] = MapNode(c_place, 0, deco_param2);
327 int DecoSimple::getHeight()
329 return (deco_height_max > 0) ? deco_height_max : deco_height;
333 ///////////////////////////////////////////////////////////////////////////////
336 DecoSchematic::DecoSchematic()
342 size_t DecoSchematic::generate(MMVManip *vm, PcgRandom *pr, v3s16 p)
344 // Schematic could have been unloaded but not the decoration
345 // In this case generate() does nothing (but doesn't *fail*)
346 if (schematic == NULL)
349 if (!canPlaceDecoration(vm, p))
352 if (flags & DECO_PLACE_CENTER_X)
353 p.X -= (schematic->size.X - 1) / 2;
354 if (flags & DECO_PLACE_CENTER_Y)
355 p.Y -= (schematic->size.Y - 1) / 2;
356 if (flags & DECO_PLACE_CENTER_Z)
357 p.Z -= (schematic->size.Z - 1) / 2;
359 Rotation rot = (rotation == ROTATE_RAND) ?
360 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
362 bool force_placement = (flags & DECO_FORCE_PLACEMENT);
364 schematic->blitToVManip(vm, p, rot, force_placement);
370 int DecoSchematic::getHeight()
372 // Account for a schematic being sunk into the ground by flag.
373 // When placed normally account for how a schematic is placed
374 // sunk 1 node into the ground.
375 return (flags & DECO_PLACE_CENTER_Y) ?
376 (schematic->size.Y - 1) / 2 : schematic->size.Y - 1;