]> git.lizzy.rs Git - dragonfireclient.git/blob - src/mg_decoration.cpp
Cpp11 patchset 11: continue working on constructor style migration (#6004)
[dragonfireclient.git] / src / mg_decoration.cpp
1 /*
2 Minetest
3 Copyright (C) 2014-2016 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
4 Copyright (C) 2015-2017 paramat
5
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU Lesser General Public License as published by
8 the Free Software Foundation; either version 2.1 of the License, or
9 (at your option) any later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14 GNU Lesser General Public License for more details.
15
16 You should have received a copy of the GNU Lesser General Public License along
17 with this program; if not, write to the Free Software Foundation, Inc.,
18 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
19 */
20
21 #include "mg_decoration.h"
22 #include "mg_schematic.h"
23 #include "mapgen.h"
24 #include "noise.h"
25 #include "map.h"
26 #include "log.h"
27 #include "util/numeric.h"
28 #include <algorithm>
29
30
31 FlagDesc flagdesc_deco[] = {
32         {"place_center_x",  DECO_PLACE_CENTER_X},
33         {"place_center_y",  DECO_PLACE_CENTER_Y},
34         {"place_center_z",  DECO_PLACE_CENTER_Z},
35         {"force_placement", DECO_FORCE_PLACEMENT},
36         {"liquid_surface",  DECO_LIQUID_SURFACE},
37         {NULL,              0}
38 };
39
40
41 ///////////////////////////////////////////////////////////////////////////////
42
43
44 DecorationManager::DecorationManager(IGameDef *gamedef) :
45         ObjDefManager(gamedef, OBJDEF_DECORATION)
46 {
47 }
48
49
50 size_t DecorationManager::placeAllDecos(Mapgen *mg, u32 blockseed,
51         v3s16 nmin, v3s16 nmax)
52 {
53         size_t nplaced = 0;
54
55         for (size_t i = 0; i != m_objects.size(); i++) {
56                 Decoration *deco = (Decoration *)m_objects[i];
57                 if (!deco)
58                         continue;
59
60                 nplaced += deco->placeDeco(mg, blockseed, nmin, nmax);
61                 blockseed++;
62         }
63
64         return nplaced;
65 }
66
67
68 ///////////////////////////////////////////////////////////////////////////////
69
70 void Decoration::resolveNodeNames()
71 {
72         getIdsFromNrBacklog(&c_place_on);
73         getIdsFromNrBacklog(&c_spawnby);
74 }
75
76
77 bool Decoration::canPlaceDecoration(MMVManip *vm, v3s16 p)
78 {
79         // Check if the decoration can be placed on this node
80         u32 vi = vm->m_area.index(p);
81         if (!CONTAINS(c_place_on, vm->m_data[vi].getContent()))
82                 return false;
83
84         // Don't continue if there are no spawnby constraints
85         if (nspawnby == -1)
86                 return true;
87
88         int nneighs = 0;
89         static const v3s16 dirs[16] = {
90                 v3s16( 0, 0,  1),
91                 v3s16( 0, 0, -1),
92                 v3s16( 1, 0,  0),
93                 v3s16(-1, 0,  0),
94                 v3s16( 1, 0,  1),
95                 v3s16(-1, 0,  1),
96                 v3s16(-1, 0, -1),
97                 v3s16( 1, 0, -1),
98
99                 v3s16( 0, 1,  1),
100                 v3s16( 0, 1, -1),
101                 v3s16( 1, 1,  0),
102                 v3s16(-1, 1,  0),
103                 v3s16( 1, 1,  1),
104                 v3s16(-1, 1,  1),
105                 v3s16(-1, 1, -1),
106                 v3s16( 1, 1, -1)
107         };
108
109         // Check these 16 neighbouring nodes for enough spawnby nodes
110         for (size_t i = 0; i != ARRLEN(dirs); i++) {
111                 u32 index = vm->m_area.index(p + dirs[i]);
112                 if (!vm->m_area.contains(index))
113                         continue;
114
115                 if (CONTAINS(c_spawnby, vm->m_data[index].getContent()))
116                         nneighs++;
117         }
118
119         if (nneighs < nspawnby)
120                 return false;
121
122         return true;
123 }
124
125
126 size_t Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
127 {
128         PcgRandom ps(blockseed + 53);
129         int carea_size = nmax.X - nmin.X + 1;
130
131         // Divide area into parts
132         // If chunksize is changed it may no longer be divisable by sidelen
133         if (carea_size % sidelen)
134                 sidelen = carea_size;
135
136         s16 divlen = carea_size / sidelen;
137         int area = sidelen * sidelen;
138
139         for (s16 z0 = 0; z0 < divlen; z0++)
140         for (s16 x0 = 0; x0 < divlen; x0++) {
141                 v2s16 p2d_center( // Center position of part of division
142                         nmin.X + sidelen / 2 + sidelen * x0,
143                         nmin.Z + sidelen / 2 + sidelen * z0
144                 );
145                 v2s16 p2d_min( // Minimum edge of part of division
146                         nmin.X + sidelen * x0,
147                         nmin.Z + sidelen * z0
148                 );
149                 v2s16 p2d_max( // Maximum edge of part of division
150                         nmin.X + sidelen + sidelen * x0 - 1,
151                         nmin.Z + sidelen + sidelen * z0 - 1
152                 );
153
154                 // Amount of decorations
155                 float nval = (flags & DECO_USE_NOISE) ?
156                         NoisePerlin2D(&np, p2d_center.X, p2d_center.Y, mapseed) :
157                         fill_ratio;
158                 u32 deco_count = 0;
159                 float deco_count_f = (float)area * nval;
160                 if (deco_count_f >= 1.f) {
161                         deco_count = deco_count_f;
162                 } else if (deco_count_f > 0.f) {
163                         // For low density decorations calculate a chance for 1 decoration
164                         if (ps.range(1000) <= deco_count_f * 1000.f)
165                                 deco_count = 1;
166                 }
167
168                 for (u32 i = 0; i < deco_count; i++) {
169                         s16 x = ps.range(p2d_min.X, p2d_max.X);
170                         s16 z = ps.range(p2d_min.Y, p2d_max.Y);
171
172                         int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
173
174                         s16 y = -MAX_MAP_GENERATION_LIMIT;
175                         if (flags & DECO_LIQUID_SURFACE)
176                                 y = mg->findLiquidSurface(v2s16(x, z), nmin.Y, nmax.Y);
177                         else if (mg->heightmap)
178                                 y = mg->heightmap[mapindex];
179                         else
180                                 y = mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
181
182                         if (y < nmin.Y || y > nmax.Y ||
183                                 y < y_min  || y > y_max)
184                                 continue;
185
186                         if (y + getHeight() > mg->vm->m_area.MaxEdge.Y) {
187                                 continue;
188 #if 0
189                                 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
190                                 //add to queue
191                                 MutexAutoLock cutofflock(cutoff_mutex);
192                                 cutoffs.push_back(CutoffData(x, y, z, height));
193 #endif
194                         }
195
196                         if (mg->biomemap && !biomes.empty()) {
197                                 std::unordered_set<u8>::const_iterator iter =
198                                         biomes.find(mg->biomemap[mapindex]);
199                                 if (iter == biomes.end())
200                                         continue;
201                         }
202
203                         v3s16 pos(x, y, z);
204                         if (generate(mg->vm, &ps, pos))
205                                 mg->gennotify.addEvent(GENNOTIFY_DECORATION, pos, index);
206                 }
207         }
208
209         return 0;
210 }
211
212
213 #if 0
214 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
215 {
216         PcgRandom pr(blockseed + 53);
217         std::vector<CutoffData> handled_cutoffs;
218
219         // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
220         {
221                 MutexAutoLock cutofflock(cutoff_mutex);
222                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
223                         i != cutoffs.end(); ++i) {
224                         CutoffData cutoff = *i;
225                         v3s16 p    = cutoff.p;
226                         s16 height = cutoff.height;
227                         if (p.X < nmin.X || p.X > nmax.X ||
228                                 p.Z < nmin.Z || p.Z > nmax.Z)
229                                 continue;
230                         if (p.Y + height < nmin.Y || p.Y > nmax.Y)
231                                 continue;
232
233                         handled_cutoffs.push_back(cutoff);
234                 }
235         }
236
237         // Generate the cutoffs
238         for (size_t i = 0; i != handled_cutoffs.size(); i++) {
239                 v3s16 p    = handled_cutoffs[i].p;
240                 s16 height = handled_cutoffs[i].height;
241
242                 if (p.Y + height > nmax.Y) {
243                         //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
244                         cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
245                 }
246
247                 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
248         }
249
250         // Remove cutoffs that were handled from the cutoff list
251         {
252                 MutexAutoLock cutofflock(cutoff_mutex);
253                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
254                         i != cutoffs.end(); ++i) {
255
256                         for (size_t j = 0; j != handled_cutoffs.size(); j++) {
257                                 CutoffData coff = *i;
258                                 if (coff.p == handled_cutoffs[j].p)
259                                         i = cutoffs.erase(i);
260                         }
261                 }
262         }
263 }
264 #endif
265
266
267 ///////////////////////////////////////////////////////////////////////////////
268
269
270 void DecoSimple::resolveNodeNames()
271 {
272         Decoration::resolveNodeNames();
273         getIdsFromNrBacklog(&c_decos);
274 }
275
276
277 size_t DecoSimple::generate(MMVManip *vm, PcgRandom *pr, v3s16 p)
278 {
279         // Don't bother if there aren't any decorations to place
280         if (c_decos.size() == 0)
281                 return 0;
282
283         if (!canPlaceDecoration(vm, p))
284                 return 0;
285
286         content_t c_place = c_decos[pr->range(0, c_decos.size() - 1)];
287
288         s16 height = (deco_height_max > 0) ?
289                 pr->range(deco_height, deco_height_max) : deco_height;
290
291         bool force_placement = (flags & DECO_FORCE_PLACEMENT);
292
293         v3s16 em = vm->m_area.getExtent();
294         u32 vi = vm->m_area.index(p);
295         for (int i = 0; i < height; i++) {
296                 vm->m_area.add_y(em, vi, 1);
297
298                 content_t c = vm->m_data[vi].getContent();
299                 if (c != CONTENT_AIR && c != CONTENT_IGNORE &&
300                                 !force_placement)
301                         break;
302
303                 vm->m_data[vi] = MapNode(c_place, 0, deco_param2);
304         }
305
306         return 1;
307 }
308
309
310 int DecoSimple::getHeight()
311 {
312         return (deco_height_max > 0) ? deco_height_max : deco_height;
313 }
314
315
316 ///////////////////////////////////////////////////////////////////////////////
317
318 size_t DecoSchematic::generate(MMVManip *vm, PcgRandom *pr, v3s16 p)
319 {
320         // Schematic could have been unloaded but not the decoration
321         // In this case generate() does nothing (but doesn't *fail*)
322         if (schematic == NULL)
323                 return 0;
324
325         if (!canPlaceDecoration(vm, p))
326                 return 0;
327
328         if (flags & DECO_PLACE_CENTER_X)
329                 p.X -= (schematic->size.X - 1) / 2;
330         if (flags & DECO_PLACE_CENTER_Y)
331                 p.Y -= (schematic->size.Y - 1) / 2;
332         if (flags & DECO_PLACE_CENTER_Z)
333                 p.Z -= (schematic->size.Z - 1) / 2;
334
335         Rotation rot = (rotation == ROTATE_RAND) ?
336                 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
337
338         bool force_placement = (flags & DECO_FORCE_PLACEMENT);
339
340         schematic->blitToVManip(vm, p, rot, force_placement);
341
342         return 1;
343 }
344
345
346 int DecoSchematic::getHeight()
347 {
348         // Account for a schematic being sunk into the ground by flag.
349         // When placed normally account for how a schematic is placed
350         // sunk 1 node into the ground.
351         return (flags & DECO_PLACE_CENTER_Y) ?
352                 (schematic->size.Y - 1) / 2 : schematic->size.Y - 1;
353 }