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"
28 const char *DecorationManager::ELEMENT_TITLE = "decoration";
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},
38 ///////////////////////////////////////////////////////////////////////////////
41 DecorationManager::DecorationManager(IGameDef *gamedef) :
42 GenElementManager(gamedef)
47 size_t DecorationManager::placeAllDecos(Mapgen *mg, u32 seed, v3s16 nmin, v3s16 nmax)
51 for (size_t i = 0; i != m_elements.size(); i++) {
52 Decoration *deco = (Decoration *)m_elements[i];
56 nplaced += deco->placeDeco(mg, seed, nmin, nmax);
64 void DecorationManager::clear()
66 for (size_t i = 0; i < m_elements.size(); i++) {
67 Decoration *deco = (Decoration *)m_elements[i];
71 deco->dropResolverEntries(m_resolver);
77 ///////////////////////////////////////////////////////////////////////////////
80 Decoration::Decoration()
89 Decoration::~Decoration()
94 size_t Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
96 PseudoRandom ps(blockseed + 53);
97 int carea_size = nmax.X - nmin.X + 1;
99 // Divide area into parts
100 if (carea_size % sidelen) {
101 errorstream << "Decoration::placeDeco: chunk size is not divisible by "
102 "sidelen; setting sidelen to " << carea_size << std::endl;
103 sidelen = carea_size;
106 s16 divlen = carea_size / sidelen;
107 int area = sidelen * sidelen;
109 for (s16 z0 = 0; z0 < divlen; z0++)
110 for (s16 x0 = 0; x0 < divlen; x0++) {
111 v2s16 p2d_center( // Center position of part of division
112 nmin.X + sidelen / 2 + sidelen * x0,
113 nmin.Z + sidelen / 2 + sidelen * z0
115 v2s16 p2d_min( // Minimum edge of part of division
116 nmin.X + sidelen * x0,
117 nmin.Z + sidelen * z0
119 v2s16 p2d_max( // Maximum edge of part of division
120 nmin.X + sidelen + sidelen * x0 - 1,
121 nmin.Z + sidelen + sidelen * z0 - 1
124 // Amount of decorations
125 float nval = (flags & DECO_USE_NOISE) ?
126 NoisePerlin2D(&np, p2d_center.X, p2d_center.Y, mapseed) :
128 u32 deco_count = area * MYMAX(nval, 0.f);
130 for (u32 i = 0; i < deco_count; i++) {
131 s16 x = ps.range(p2d_min.X, p2d_max.X);
132 s16 z = ps.range(p2d_min.Y, p2d_max.Y);
134 int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
136 s16 y = mg->heightmap ?
137 mg->heightmap[mapindex] :
138 mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
140 if (y < nmin.Y || y > nmax.Y)
143 int height = getHeight();
144 int max_y = nmax.Y;// + MAP_BLOCKSIZE - 1;
145 if (y + 1 + height > max_y) {
148 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
150 JMutexAutoLock cutofflock(cutoff_mutex);
151 cutoffs.push_back(CutoffData(x, y, z, height));
156 std::set<u8>::iterator iter;
159 iter = biomes.find(mg->biomemap[mapindex]);
160 if (iter == biomes.end())
166 if (generate(mg, &ps, max_y, pos))
167 mg->gennotify.addEvent(GENNOTIFY_DECORATION, pos, id);
176 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
178 PseudoRandom pr(blockseed + 53);
179 std::vector<CutoffData> handled_cutoffs;
181 // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
183 JMutexAutoLock cutofflock(cutoff_mutex);
184 for (std::list<CutoffData>::iterator i = cutoffs.begin();
185 i != cutoffs.end(); ++i) {
186 CutoffData cutoff = *i;
188 s16 height = cutoff.height;
189 if (p.X < nmin.X || p.X > nmax.X ||
190 p.Z < nmin.Z || p.Z > nmax.Z)
192 if (p.Y + height < nmin.Y || p.Y > nmax.Y)
195 handled_cutoffs.push_back(cutoff);
199 // Generate the cutoffs
200 for (size_t i = 0; i != handled_cutoffs.size(); i++) {
201 v3s16 p = handled_cutoffs[i].p;
202 s16 height = handled_cutoffs[i].height;
204 if (p.Y + height > nmax.Y) {
205 //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
206 cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
209 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
212 // Remove cutoffs that were handled from the cutoff list
214 JMutexAutoLock cutofflock(cutoff_mutex);
215 for (std::list<CutoffData>::iterator i = cutoffs.begin();
216 i != cutoffs.end(); ++i) {
218 for (size_t j = 0; j != handled_cutoffs.size(); j++) {
219 CutoffData coff = *i;
220 if (coff.p == handled_cutoffs[j].p)
221 i = cutoffs.erase(i);
229 ///////////////////////////////////////////////////////////////////////////////
232 bool DecoSimple::canPlaceDecoration(ManualMapVoxelManipulator *vm, v3s16 p)
234 // Don't bother if there aren't any decorations to place
235 if (c_decos.size() == 0)
238 u32 vi = vm->m_area.index(p);
240 // Check if the decoration can be placed on this node
241 if (!CONTAINS(c_place_on, vm->m_data[vi].getContent()))
244 // Don't continue if there are no spawnby constraints
260 // Check a Moore neighborhood if there are enough spawnby nodes
261 for (size_t i = 0; i != ARRLEN(dirs); i++) {
262 u32 index = vm->m_area.index(p + dirs[i]);
263 if (!vm->m_area.contains(index))
266 if (CONTAINS(c_spawnby, vm->m_data[index].getContent()))
270 if (nneighs < nspawnby)
277 size_t DecoSimple::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p)
279 ManualMapVoxelManipulator *vm = mg->vm;
281 if (!canPlaceDecoration(vm, p))
284 content_t c_place = c_decos[pr->range(0, c_decos.size() - 1)];
286 s16 height = (deco_height_max > 0) ?
287 pr->range(deco_height, deco_height_max) : deco_height;
289 height = MYMIN(height, max_y - p.Y);
291 v3s16 em = vm->m_area.getExtent();
292 u32 vi = vm->m_area.index(p);
293 for (int i = 0; i < height; i++) {
294 vm->m_area.add_y(em, vi, 1);
296 content_t c = vm->m_data[vi].getContent();
297 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
300 vm->m_data[vi] = MapNode(c_place);
307 int DecoSimple::getHeight()
309 return (deco_height_max > 0) ? deco_height_max : deco_height;
313 void DecoSimple::dropResolverEntries(NodeResolver *resolver)
315 resolver->cancelNodeList(&c_decos);
316 resolver->cancelNodeList(&c_spawnby);
320 ///////////////////////////////////////////////////////////////////////////////
323 size_t DecoSchematic::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p)
325 ManualMapVoxelManipulator *vm = mg->vm;
327 if (flags & DECO_PLACE_CENTER_X)
328 p.X -= (schematic->size.X + 1) / 2;
329 if (flags & DECO_PLACE_CENTER_Y)
330 p.Y -= (schematic->size.Y + 1) / 2;
331 if (flags & DECO_PLACE_CENTER_Z)
332 p.Z -= (schematic->size.Z + 1) / 2;
334 u32 vi = vm->m_area.index(p);
335 content_t c = vm->m_data[vi].getContent();
336 if (!CONTAINS(c_place_on, c))
339 Rotation rot = (rotation == ROTATE_RAND) ?
340 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
342 schematic->blitToVManip(p, vm, rot, false, mg->ndef);
348 int DecoSchematic::getHeight()
350 return schematic->size.Y;