3 Copyright (C) 2014-2018 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
4 Copyright (C) 2015-2018 paramat
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.
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.
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.
26 #include "util/numeric.h"
31 FlagDesc flagdesc_ore[] = {
32 {"absheight", OREFLAG_ABSHEIGHT}, // Non-functional
33 {"puff_cliffs", OREFLAG_PUFF_CLIFFS},
34 {"puff_additive_composition", OREFLAG_PUFF_ADDITIVE},
39 ///////////////////////////////////////////////////////////////////////////////
42 OreManager::OreManager(IGameDef *gamedef) :
43 ObjDefManager(gamedef, OBJDEF_ORE)
48 size_t OreManager::placeAllOres(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
52 for (size_t i = 0; i != m_objects.size(); i++) {
53 Ore *ore = (Ore *)m_objects[i];
57 nplaced += ore->placeOre(mg, blockseed, nmin, nmax);
65 void OreManager::clear()
67 for (ObjDef *object : m_objects) {
68 Ore *ore = (Ore *) object;
75 ///////////////////////////////////////////////////////////////////////////////
84 void Ore::resolveNodeNames()
86 getIdFromNrBacklog(&c_ore, "", CONTENT_AIR);
87 getIdsFromNrBacklog(&c_wherein);
91 size_t Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
93 if (nmin.Y > y_max || nmax.Y < y_min)
96 int actual_ymin = MYMAX(nmin.Y, y_min);
97 int actual_ymax = MYMIN(nmax.Y, y_max);
98 if (clust_size >= actual_ymax - actual_ymin + 1)
101 nmin.Y = actual_ymin;
102 nmax.Y = actual_ymax;
103 generate(mg->vm, mg->seed, blockseed, nmin, nmax, mg->biomemap);
109 ///////////////////////////////////////////////////////////////////////////////
112 void OreScatter::generate(MMVManip *vm, int mapseed, u32 blockseed,
113 v3s16 nmin, v3s16 nmax, u8 *biomemap)
115 PcgRandom pr(blockseed);
116 MapNode n_ore(c_ore, 0, ore_param2);
118 u32 sizex = (nmax.X - nmin.X + 1);
119 u32 volume = (nmax.X - nmin.X + 1) *
120 (nmax.Y - nmin.Y + 1) *
121 (nmax.Z - nmin.Z + 1);
122 u32 csize = clust_size;
123 u32 cvolume = csize * csize * csize;
124 u32 nclusters = volume / clust_scarcity;
126 for (u32 i = 0; i != nclusters; i++) {
127 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
128 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
129 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
131 if ((flags & OREFLAG_USE_NOISE) &&
132 (NoisePerlin3D(&np, x0, y0, z0, mapseed) < nthresh))
135 if (biomemap && !biomes.empty()) {
136 u32 index = sizex * (z0 - nmin.Z) + (x0 - nmin.X);
137 std::unordered_set<u8>::const_iterator it = biomes.find(biomemap[index]);
138 if (it == biomes.end())
142 for (u32 z1 = 0; z1 != csize; z1++)
143 for (u32 y1 = 0; y1 != csize; y1++)
144 for (u32 x1 = 0; x1 != csize; x1++) {
145 if (pr.range(1, cvolume) > clust_num_ores)
148 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
149 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
152 vm->m_data[i] = n_ore;
158 ///////////////////////////////////////////////////////////////////////////////
161 void OreSheet::generate(MMVManip *vm, int mapseed, u32 blockseed,
162 v3s16 nmin, v3s16 nmax, u8 *biomemap)
164 PcgRandom pr(blockseed + 4234);
165 MapNode n_ore(c_ore, 0, ore_param2);
167 u16 max_height = column_height_max;
168 int y_start_min = nmin.Y + max_height;
169 int y_start_max = nmax.Y - max_height;
171 int y_start = y_start_min < y_start_max ?
172 pr.range(y_start_min, y_start_max) :
173 (y_start_min + y_start_max) / 2;
176 int sx = nmax.X - nmin.X + 1;
177 int sz = nmax.Z - nmin.Z + 1;
178 noise = new Noise(&np, 0, sx, sz);
180 noise->seed = mapseed + y_start;
181 noise->perlinMap2D(nmin.X, nmin.Z);
184 for (int z = nmin.Z; z <= nmax.Z; z++)
185 for (int x = nmin.X; x <= nmax.X; x++, index++) {
186 float noiseval = noise->result[index];
187 if (noiseval < nthresh)
190 if (biomemap && !biomes.empty()) {
191 std::unordered_set<u8>::const_iterator it = biomes.find(biomemap[index]);
192 if (it == biomes.end())
196 u16 height = pr.range(column_height_min, column_height_max);
197 int ymidpoint = y_start + noiseval;
198 int y0 = MYMAX(nmin.Y, ymidpoint - height * (1 - column_midpoint_factor));
199 int y1 = MYMIN(nmax.Y, y0 + height - 1);
201 for (int y = y0; y <= y1; y++) {
202 u32 i = vm->m_area.index(x, y, z);
203 if (!vm->m_area.contains(i))
205 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
208 vm->m_data[i] = n_ore;
214 ///////////////////////////////////////////////////////////////////////////////
219 delete noise_puff_top;
220 delete noise_puff_bottom;
224 void OrePuff::generate(MMVManip *vm, int mapseed, u32 blockseed,
225 v3s16 nmin, v3s16 nmax, u8 *biomemap)
227 PcgRandom pr(blockseed + 4234);
228 MapNode n_ore(c_ore, 0, ore_param2);
230 int y_start = pr.range(nmin.Y, nmax.Y);
233 int sx = nmax.X - nmin.X + 1;
234 int sz = nmax.Z - nmin.Z + 1;
235 noise = new Noise(&np, 0, sx, sz);
236 noise_puff_top = new Noise(&np_puff_top, 0, sx, sz);
237 noise_puff_bottom = new Noise(&np_puff_bottom, 0, sx, sz);
240 noise->seed = mapseed + y_start;
241 noise->perlinMap2D(nmin.X, nmin.Z);
242 bool noise_generated = false;
245 for (int z = nmin.Z; z <= nmax.Z; z++)
246 for (int x = nmin.X; x <= nmax.X; x++, index++) {
247 float noiseval = noise->result[index];
248 if (noiseval < nthresh)
251 if (biomemap && !biomes.empty()) {
252 std::unordered_set<u8>::const_iterator it = biomes.find(biomemap[index]);
253 if (it == biomes.end())
257 if (!noise_generated) {
258 noise_generated = true;
259 noise_puff_top->perlinMap2D(nmin.X, nmin.Z);
260 noise_puff_bottom->perlinMap2D(nmin.X, nmin.Z);
263 float ntop = noise_puff_top->result[index];
264 float nbottom = noise_puff_bottom->result[index];
266 if (!(flags & OREFLAG_PUFF_CLIFFS)) {
267 float ndiff = noiseval - nthresh;
275 int y0 = ymid - nbottom;
276 int y1 = ymid + ntop;
278 if ((flags & OREFLAG_PUFF_ADDITIVE) && (y0 > y1))
281 for (int y = y0; y <= y1; y++) {
282 u32 i = vm->m_area.index(x, y, z);
283 if (!vm->m_area.contains(i))
285 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
288 vm->m_data[i] = n_ore;
294 ///////////////////////////////////////////////////////////////////////////////
297 void OreBlob::generate(MMVManip *vm, int mapseed, u32 blockseed,
298 v3s16 nmin, v3s16 nmax, u8 *biomemap)
300 PcgRandom pr(blockseed + 2404);
301 MapNode n_ore(c_ore, 0, ore_param2);
303 u32 sizex = (nmax.X - nmin.X + 1);
304 u32 volume = (nmax.X - nmin.X + 1) *
305 (nmax.Y - nmin.Y + 1) *
306 (nmax.Z - nmin.Z + 1);
307 u32 csize = clust_size;
308 u32 nblobs = volume / clust_scarcity;
311 noise = new Noise(&np, mapseed, csize, csize, csize);
313 for (u32 i = 0; i != nblobs; i++) {
314 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
315 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
316 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
318 if (biomemap && !biomes.empty()) {
319 u32 bmapidx = sizex * (z0 - nmin.Z) + (x0 - nmin.X);
320 std::unordered_set<u8>::const_iterator it = biomes.find(biomemap[bmapidx]);
321 if (it == biomes.end())
325 bool noise_generated = false;
326 noise->seed = blockseed + i;
329 for (u32 z1 = 0; z1 != csize; z1++)
330 for (u32 y1 = 0; y1 != csize; y1++)
331 for (u32 x1 = 0; x1 != csize; x1++, index++) {
332 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
333 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
336 // Lazily generate noise only if there's a chance of ore being placed
337 // This simple optimization makes calls 6x faster on average
338 if (!noise_generated) {
339 noise_generated = true;
340 noise->perlinMap3D(x0, y0, z0);
343 float noiseval = noise->result[index];
345 float xdist = (s32)x1 - (s32)csize / 2;
346 float ydist = (s32)y1 - (s32)csize / 2;
347 float zdist = (s32)z1 - (s32)csize / 2;
349 noiseval -= std::sqrt(xdist * xdist + ydist * ydist + zdist * zdist) / csize;
351 if (noiseval < nthresh)
354 vm->m_data[i] = n_ore;
360 ///////////////////////////////////////////////////////////////////////////////
369 void OreVein::generate(MMVManip *vm, int mapseed, u32 blockseed,
370 v3s16 nmin, v3s16 nmax, u8 *biomemap)
372 PcgRandom pr(blockseed + 520);
373 MapNode n_ore(c_ore, 0, ore_param2);
375 int sizex = nmax.X - nmin.X + 1;
376 int sizey = nmax.Y - nmin.Y + 1;
377 // Because this ore uses 3D noise the perlinmap Y size can be different in
378 // different mapchunks due to ore Y limits. So recreate the noise objects
379 // if Y size has changed.
380 // Because these noise objects are created multiple times for this ore type
381 // it is necessary to 'delete' them here.
382 if (!noise || sizey != sizey_prev) {
385 int sizez = nmax.Z - nmin.Z + 1;
386 noise = new Noise(&np, mapseed, sizex, sizey, sizez);
387 noise2 = new Noise(&np, mapseed + 436, sizex, sizey, sizez);
391 bool noise_generated = false;
393 for (int z = nmin.Z; z <= nmax.Z; z++)
394 for (int y = nmin.Y; y <= nmax.Y; y++)
395 for (int x = nmin.X; x <= nmax.X; x++, index++) {
396 u32 i = vm->m_area.index(x, y, z);
397 if (!vm->m_area.contains(i))
399 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
402 if (biomemap && !biomes.empty()) {
403 u32 bmapidx = sizex * (z - nmin.Z) + (x - nmin.X);
404 std::unordered_set<u8>::const_iterator it = biomes.find(biomemap[bmapidx]);
405 if (it == biomes.end())
409 // Same lazy generation optimization as in OreBlob
410 if (!noise_generated) {
411 noise_generated = true;
412 noise->perlinMap3D(nmin.X, nmin.Y, nmin.Z);
413 noise2->perlinMap3D(nmin.X, nmin.Y, nmin.Z);
416 // randval ranges from -1..1
417 float randval = (float)pr.next() / (pr.RANDOM_RANGE / 2) - 1.f;
418 float noiseval = contour(noise->result[index]);
419 float noiseval2 = contour(noise2->result[index]);
420 if (noiseval * noiseval2 + randval * random_factor < nthresh)
423 vm->m_data[i] = n_ore;
428 ///////////////////////////////////////////////////////////////////////////////
431 OreStratum::~OreStratum()
433 delete noise_stratum_thickness;
437 void OreStratum::generate(MMVManip *vm, int mapseed, u32 blockseed,
438 v3s16 nmin, v3s16 nmax, u8 *biomemap)
440 PcgRandom pr(blockseed + 4234);
441 MapNode n_ore(c_ore, 0, ore_param2);
443 if (flags & OREFLAG_USE_NOISE) {
445 int sx = nmax.X - nmin.X + 1;
446 int sz = nmax.Z - nmin.Z + 1;
447 noise = new Noise(&np, 0, sx, sz);
449 noise->perlinMap2D(nmin.X, nmin.Z);
452 if (flags & OREFLAG_USE_NOISE2) {
453 if (!noise_stratum_thickness) {
454 int sx = nmax.X - nmin.X + 1;
455 int sz = nmax.Z - nmin.Z + 1;
456 noise_stratum_thickness = new Noise(&np_stratum_thickness, 0, sx, sz);
458 noise_stratum_thickness->perlinMap2D(nmin.X, nmin.Z);
463 for (int z = nmin.Z; z <= nmax.Z; z++)
464 for (int x = nmin.X; x <= nmax.X; x++, index++) {
465 if (biomemap && !biomes.empty()) {
466 std::unordered_set<u8>::const_iterator it = biomes.find(biomemap[index]);
467 if (it == biomes.end())
474 if (flags & OREFLAG_USE_NOISE) {
475 float nhalfthick = ((flags & OREFLAG_USE_NOISE2) ?
476 noise_stratum_thickness->result[index] : (float)stratum_thickness) /
478 float nmid = noise->result[index];
479 y0 = MYMAX(nmin.Y, std::ceil(nmid - nhalfthick));
480 y1 = MYMIN(nmax.Y, nmid + nhalfthick);
481 } else { // Simple horizontal stratum
486 for (int y = y0; y <= y1; y++) {
487 if (pr.range(1, clust_scarcity) != 1)
490 u32 i = vm->m_area.index(x, y, z);
491 if (!vm->m_area.contains(i))
493 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
496 vm->m_data[i] = n_ore;