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