3 Copyright (C) 2014-2016 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
4 Copyright (C) 2015-2017 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.
29 FlagDesc flagdesc_ore[] = {
30 {"absheight", OREFLAG_ABSHEIGHT},
31 {"puff_cliffs", OREFLAG_PUFF_CLIFFS},
32 {"puff_additive_composition", OREFLAG_PUFF_ADDITIVE},
37 ///////////////////////////////////////////////////////////////////////////////
40 OreManager::OreManager(IGameDef *gamedef) :
41 ObjDefManager(gamedef, OBJDEF_ORE)
46 size_t OreManager::placeAllOres(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
50 for (size_t i = 0; i != m_objects.size(); i++) {
51 Ore *ore = (Ore *)m_objects[i];
55 nplaced += ore->placeOre(mg, blockseed, nmin, nmax);
63 void OreManager::clear()
65 for (size_t i = 0; i < m_objects.size(); i++) {
66 Ore *ore = (Ore *)m_objects[i];
73 ///////////////////////////////////////////////////////////////////////////////
89 void Ore::resolveNodeNames()
91 getIdFromNrBacklog(&c_ore, "", CONTENT_AIR);
92 getIdsFromNrBacklog(&c_wherein);
96 size_t Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax)
100 in_range |= (nmin.Y <= y_max && nmax.Y >= y_min);
101 if (flags & OREFLAG_ABSHEIGHT)
102 in_range |= (nmin.Y >= -y_max && nmax.Y <= -y_min) << 1;
106 int actual_ymin, actual_ymax;
107 if (in_range & ORE_RANGE_MIRROR) {
108 actual_ymin = MYMAX(nmin.Y, -y_max);
109 actual_ymax = MYMIN(nmax.Y, -y_min);
111 actual_ymin = MYMAX(nmin.Y, y_min);
112 actual_ymax = MYMIN(nmax.Y, y_max);
114 if (clust_size >= actual_ymax - actual_ymin + 1)
117 nmin.Y = actual_ymin;
118 nmax.Y = actual_ymax;
119 generate(mg->vm, mg->seed, blockseed, nmin, nmax, mg->biomemap);
125 ///////////////////////////////////////////////////////////////////////////////
128 void OreScatter::generate(MMVManip *vm, int mapseed, u32 blockseed,
129 v3s16 nmin, v3s16 nmax, u8 *biomemap)
131 PcgRandom pr(blockseed);
132 MapNode n_ore(c_ore, 0, ore_param2);
134 u32 sizex = (nmax.X - nmin.X + 1);
135 u32 volume = (nmax.X - nmin.X + 1) *
136 (nmax.Y - nmin.Y + 1) *
137 (nmax.Z - nmin.Z + 1);
138 u32 csize = clust_size;
139 u32 cvolume = csize * csize * csize;
140 u32 nclusters = volume / clust_scarcity;
142 for (u32 i = 0; i != nclusters; i++) {
143 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
144 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
145 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
147 if ((flags & OREFLAG_USE_NOISE) &&
148 (NoisePerlin3D(&np, x0, y0, z0, mapseed) < nthresh))
151 if (biomemap && !biomes.empty()) {
152 u32 index = sizex * (z0 - nmin.Z) + (x0 - nmin.X);
153 UNORDERED_SET<u8>::iterator it = biomes.find(biomemap[index]);
154 if (it == biomes.end())
158 for (u32 z1 = 0; z1 != csize; z1++)
159 for (u32 y1 = 0; y1 != csize; y1++)
160 for (u32 x1 = 0; x1 != csize; x1++) {
161 if (pr.range(1, cvolume) > clust_num_ores)
164 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
165 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
168 vm->m_data[i] = n_ore;
174 ///////////////////////////////////////////////////////////////////////////////
177 void OreSheet::generate(MMVManip *vm, int mapseed, u32 blockseed,
178 v3s16 nmin, v3s16 nmax, u8 *biomemap)
180 PcgRandom pr(blockseed + 4234);
181 MapNode n_ore(c_ore, 0, ore_param2);
183 u16 max_height = column_height_max;
184 int y_start_min = nmin.Y + max_height;
185 int y_start_max = nmax.Y - max_height;
187 int y_start = y_start_min < y_start_max ?
188 pr.range(y_start_min, y_start_max) :
189 (y_start_min + y_start_max) / 2;
192 int sx = nmax.X - nmin.X + 1;
193 int sz = nmax.Z - nmin.Z + 1;
194 noise = new Noise(&np, 0, sx, sz);
196 noise->seed = mapseed + y_start;
197 noise->perlinMap2D(nmin.X, nmin.Z);
200 for (int z = nmin.Z; z <= nmax.Z; z++)
201 for (int x = nmin.X; x <= nmax.X; x++, index++) {
202 float noiseval = noise->result[index];
203 if (noiseval < nthresh)
206 if (biomemap && !biomes.empty()) {
207 UNORDERED_SET<u8>::iterator it = biomes.find(biomemap[index]);
208 if (it == biomes.end())
212 u16 height = pr.range(column_height_min, column_height_max);
213 int ymidpoint = y_start + noiseval;
214 int y0 = MYMAX(nmin.Y, ymidpoint - height * (1 - column_midpoint_factor));
215 int y1 = MYMIN(nmax.Y, y0 + height - 1);
217 for (int y = y0; y <= y1; y++) {
218 u32 i = vm->m_area.index(x, y, z);
219 if (!vm->m_area.contains(i))
221 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
224 vm->m_data[i] = n_ore;
230 ///////////////////////////////////////////////////////////////////////////////
235 noise_puff_top = NULL;
236 noise_puff_bottom = NULL;
242 delete noise_puff_top;
243 delete noise_puff_bottom;
247 void OrePuff::generate(MMVManip *vm, int mapseed, u32 blockseed,
248 v3s16 nmin, v3s16 nmax, u8 *biomemap)
250 PcgRandom pr(blockseed + 4234);
251 MapNode n_ore(c_ore, 0, ore_param2);
253 int y_start = pr.range(nmin.Y, nmax.Y);
256 int sx = nmax.X - nmin.X + 1;
257 int sz = nmax.Z - nmin.Z + 1;
258 noise = new Noise(&np, 0, sx, sz);
259 noise_puff_top = new Noise(&np_puff_top, 0, sx, sz);
260 noise_puff_bottom = new Noise(&np_puff_bottom, 0, sx, sz);
263 noise->seed = mapseed + y_start;
264 noise->perlinMap2D(nmin.X, nmin.Z);
265 bool noise_generated = false;
268 for (int z = nmin.Z; z <= nmax.Z; z++)
269 for (int x = nmin.X; x <= nmax.X; x++, index++) {
270 float noiseval = noise->result[index];
271 if (noiseval < nthresh)
274 if (biomemap && !biomes.empty()) {
275 UNORDERED_SET<u8>::iterator it = biomes.find(biomemap[index]);
276 if (it == biomes.end())
280 if (!noise_generated) {
281 noise_generated = true;
282 noise_puff_top->perlinMap2D(nmin.X, nmin.Z);
283 noise_puff_bottom->perlinMap2D(nmin.X, nmin.Z);
286 float ntop = noise_puff_top->result[index];
287 float nbottom = noise_puff_bottom->result[index];
289 if (!(flags & OREFLAG_PUFF_CLIFFS)) {
290 float ndiff = noiseval - nthresh;
298 int y0 = ymid - nbottom;
299 int y1 = ymid + ntop;
301 if ((flags & OREFLAG_PUFF_ADDITIVE) && (y0 > y1))
304 for (int y = y0; y <= y1; y++) {
305 u32 i = vm->m_area.index(x, y, z);
306 if (!vm->m_area.contains(i))
308 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
311 vm->m_data[i] = n_ore;
317 ///////////////////////////////////////////////////////////////////////////////
320 void OreBlob::generate(MMVManip *vm, int mapseed, u32 blockseed,
321 v3s16 nmin, v3s16 nmax, u8 *biomemap)
323 PcgRandom pr(blockseed + 2404);
324 MapNode n_ore(c_ore, 0, ore_param2);
326 u32 sizex = (nmax.X - nmin.X + 1);
327 u32 volume = (nmax.X - nmin.X + 1) *
328 (nmax.Y - nmin.Y + 1) *
329 (nmax.Z - nmin.Z + 1);
330 u32 csize = clust_size;
331 u32 nblobs = volume / clust_scarcity;
334 noise = new Noise(&np, mapseed, csize, csize, csize);
336 for (u32 i = 0; i != nblobs; i++) {
337 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
338 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
339 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
341 if (biomemap && !biomes.empty()) {
342 u32 bmapidx = sizex * (z0 - nmin.Z) + (x0 - nmin.X);
343 UNORDERED_SET<u8>::iterator it = biomes.find(biomemap[bmapidx]);
344 if (it == biomes.end())
348 bool noise_generated = false;
349 noise->seed = blockseed + i;
352 for (u32 z1 = 0; z1 != csize; z1++)
353 for (u32 y1 = 0; y1 != csize; y1++)
354 for (u32 x1 = 0; x1 != csize; x1++, index++) {
355 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
356 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
359 // Lazily generate noise only if there's a chance of ore being placed
360 // This simple optimization makes calls 6x faster on average
361 if (!noise_generated) {
362 noise_generated = true;
363 noise->perlinMap3D(x0, y0, z0);
366 float noiseval = noise->result[index];
368 float xdist = (s32)x1 - (s32)csize / 2;
369 float ydist = (s32)y1 - (s32)csize / 2;
370 float zdist = (s32)z1 - (s32)csize / 2;
372 noiseval -= (sqrt(xdist * xdist + ydist * ydist + zdist * zdist) / csize);
374 if (noiseval < nthresh)
377 vm->m_data[i] = n_ore;
383 ///////////////////////////////////////////////////////////////////////////////
398 void OreVein::generate(MMVManip *vm, int mapseed, u32 blockseed,
399 v3s16 nmin, v3s16 nmax, u8 *biomemap)
401 PcgRandom pr(blockseed + 520);
402 MapNode n_ore(c_ore, 0, ore_param2);
404 u32 sizex = (nmax.X - nmin.X + 1);
407 int sx = nmax.X - nmin.X + 1;
408 int sy = nmax.Y - nmin.Y + 1;
409 int sz = nmax.Z - nmin.Z + 1;
410 noise = new Noise(&np, mapseed, sx, sy, sz);
411 noise2 = new Noise(&np, mapseed + 436, sx, sy, sz);
413 bool noise_generated = false;
416 for (int z = nmin.Z; z <= nmax.Z; z++)
417 for (int y = nmin.Y; y <= nmax.Y; y++)
418 for (int x = nmin.X; x <= nmax.X; x++, index++) {
419 u32 i = vm->m_area.index(x, y, z);
420 if (!vm->m_area.contains(i))
422 if (!CONTAINS(c_wherein, vm->m_data[i].getContent()))
425 if (biomemap && !biomes.empty()) {
426 u32 bmapidx = sizex * (z - nmin.Z) + (x - nmin.X);
427 UNORDERED_SET<u8>::iterator it = biomes.find(biomemap[bmapidx]);
428 if (it == biomes.end())
432 // Same lazy generation optimization as in OreBlob
433 if (!noise_generated) {
434 noise_generated = true;
435 noise->perlinMap3D(nmin.X, nmin.Y, nmin.Z);
436 noise2->perlinMap3D(nmin.X, nmin.Y, nmin.Z);
439 // randval ranges from -1..1
440 float randval = (float)pr.next() / (pr.RANDOM_RANGE / 2) - 1.f;
441 float noiseval = contour(noise->result[index]);
442 float noiseval2 = contour(noise2->result[index]);
443 if (noiseval * noiseval2 + randval * random_factor < nthresh)
446 vm->m_data[i] = n_ore;