3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
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.
27 //#include "serverobject.h"
28 #include "content_sao.h"
30 #include "content_mapnode.h" // For content_mapnode_get_new_name
31 #include "voxelalgorithms.h"
33 #include "settings.h" // For g_settings
34 #include "main.h" // For g_profiler
36 #include "mapgen_v6.h"
37 #include "mapgen_v7.h"
38 #include "util/serialize.h"
40 FlagDesc flagdesc_mapgen[] = {
43 {"dungeons", MG_DUNGEONS},
44 {"v6_jungles", MGV6_JUNGLES},
45 {"v6_biome_blend", MGV6_BIOME_BLEND},
47 {"nolight", MG_NOLIGHT},
51 FlagDesc flagdesc_ore[] = {
52 {"absheight", OREFLAG_ABSHEIGHT},
53 {"scatter_noisedensity", OREFLAG_DENSITY},
54 {"claylike_nodeisnt", OREFLAG_NODEISNT},
58 FlagDesc flagdesc_deco_schematic[] = {
59 {"place_center_x", DECO_PLACE_CENTER_X},
60 {"place_center_y", DECO_PLACE_CENTER_Y},
61 {"place_center_z", DECO_PLACE_CENTER_Z},
65 ///////////////////////////////////////////////////////////////////////////////
68 Ore *createOre(OreType type) {
71 return new OreScatter;
74 //case ORE_CLAYLIKE: //TODO: implement this!
75 // return new OreClaylike;
88 void Ore::resolveNodeNames(INodeDefManager *ndef) {
89 if (ore == CONTENT_IGNORE) {
90 ore = ndef->getId(ore_name);
91 if (ore == CONTENT_IGNORE) {
92 errorstream << "Ore::resolveNodeNames: ore node '"
93 << ore_name << "' not defined";
95 wherein.push_back(CONTENT_AIR);
100 for (size_t i=0; i != wherein_names.size(); i++) {
101 std::string name = wherein_names[i];
102 content_t c = ndef->getId(name);
103 if (c != CONTENT_IGNORE) {
104 wherein.push_back(c);
110 void Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
113 in_range |= (nmin.Y <= height_max && nmax.Y >= height_min);
114 if (flags & OREFLAG_ABSHEIGHT)
115 in_range |= (nmin.Y >= -height_max && nmax.Y <= -height_min) << 1;
120 if (in_range & ORE_RANGE_MIRROR) {
121 ymin = MYMAX(nmin.Y, -height_max);
122 ymax = MYMIN(nmax.Y, -height_min);
124 ymin = MYMAX(nmin.Y, height_min);
125 ymax = MYMIN(nmax.Y, height_max);
127 if (clust_size >= ymax - ymin + 1)
132 generate(mg->vm, mg->seed, blockseed, nmin, nmax);
136 void OreScatter::generate(ManualMapVoxelManipulator *vm, int seed,
137 u32 blockseed, v3s16 nmin, v3s16 nmax) {
138 PseudoRandom pr(blockseed);
139 MapNode n_ore(ore, 0, ore_param2);
141 int volume = (nmax.X - nmin.X + 1) *
142 (nmax.Y - nmin.Y + 1) *
143 (nmax.Z - nmin.Z + 1);
144 int csize = clust_size;
145 int orechance = (csize * csize * csize) / clust_num_ores;
146 int nclusters = volume / clust_scarcity;
148 for (int i = 0; i != nclusters; i++) {
149 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
150 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
151 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
153 if (np && (NoisePerlin3D(np, x0, y0, z0, seed) < nthresh))
156 for (int z1 = 0; z1 != csize; z1++)
157 for (int y1 = 0; y1 != csize; y1++)
158 for (int x1 = 0; x1 != csize; x1++) {
159 if (pr.range(1, orechance) != 1)
162 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
163 for (size_t ii = 0; ii < wherein.size(); ii++)
164 if (vm->m_data[i].getContent() == wherein[ii])
165 vm->m_data[i] = n_ore;
171 void OreSheet::generate(ManualMapVoxelManipulator *vm, int seed,
172 u32 blockseed, v3s16 nmin, v3s16 nmax) {
173 PseudoRandom pr(blockseed + 4234);
174 MapNode n_ore(ore, 0, ore_param2);
176 int max_height = clust_size;
177 int y_start = pr.range(nmin.Y, nmax.Y - max_height);
180 int sx = nmax.X - nmin.X + 1;
181 int sz = nmax.Z - nmin.Z + 1;
182 noise = new Noise(np, 0, sx, sz);
184 noise->seed = seed + y_start;
185 noise->perlinMap2D(nmin.X, nmin.Z);
188 for (int z = nmin.Z; z <= nmax.Z; z++)
189 for (int x = nmin.X; x <= nmax.X; x++) {
190 float noiseval = noise->result[index++];
191 if (noiseval < nthresh)
194 int height = max_height * (1. / pr.range(1, 3));
195 int y0 = y_start + np->scale * noiseval; //pr.range(1, 3) - 1;
196 int y1 = y0 + height;
197 for (int y = y0; y != y1; y++) {
198 u32 i = vm->m_area.index(x, y, z);
199 if (!vm->m_area.contains(i))
202 for (size_t ii = 0; ii < wherein.size(); ii++)
203 if (vm->m_data[i].getContent() == wherein[ii])
204 vm->m_data[i] = n_ore;
210 ///////////////////////////////////////////////////////////////////////////////
213 Decoration *createDecoration(DecorationType type) {
216 return new DecoSimple;
218 return new DecoSchematic;
220 // return new DecoLSystem;
227 Decoration::Decoration() {
235 Decoration::~Decoration() {
240 void Decoration::resolveNodeNames(INodeDefManager *ndef) {
243 if (c_place_on == CONTENT_IGNORE)
244 c_place_on = ndef->getId(place_on_name);
248 void Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
249 PseudoRandom ps(blockseed + 53);
250 int carea_size = nmax.X - nmin.X + 1;
252 // Divide area into parts
253 if (carea_size % sidelen) {
254 errorstream << "Decoration::placeDeco: chunk size is not divisible by "
255 "sidelen; setting sidelen to " << carea_size << std::endl;
256 sidelen = carea_size;
259 s16 divlen = carea_size / sidelen;
260 int area = sidelen * sidelen;
262 for (s16 z0 = 0; z0 < divlen; z0++)
263 for (s16 x0 = 0; x0 < divlen; x0++) {
264 v2s16 p2d_center( // Center position of part of division
265 nmin.X + sidelen / 2 + sidelen * x0,
266 nmin.Z + sidelen / 2 + sidelen * z0
268 v2s16 p2d_min( // Minimum edge of part of division
269 nmin.X + sidelen * x0,
270 nmin.Z + sidelen * z0
272 v2s16 p2d_max( // Maximum edge of part of division
273 nmin.X + sidelen + sidelen * x0 - 1,
274 nmin.Z + sidelen + sidelen * z0 - 1
277 // Amount of decorations
279 NoisePerlin2D(np, p2d_center.X, p2d_center.Y, mapseed) :
281 u32 deco_count = area * MYMAX(nval, 0.f);
283 for (u32 i = 0; i < deco_count; i++) {
284 s16 x = ps.range(p2d_min.X, p2d_max.X);
285 s16 z = ps.range(p2d_min.Y, p2d_max.Y);
287 int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
289 s16 y = mg->heightmap ?
290 mg->heightmap[mapindex] :
291 mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
293 if (y < nmin.Y || y > nmax.Y)
296 int height = getHeight();
297 int max_y = nmax.Y;// + MAP_BLOCKSIZE - 1;
298 if (y + 1 + height > max_y) {
301 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
303 JMutexAutoLock cutofflock(cutoff_mutex);
304 cutoffs.push_back(CutoffData(x, y, z, height));
309 std::set<u8>::iterator iter;
312 iter = biomes.find(mg->biomemap[mapindex]);
313 if (iter == biomes.end())
318 generate(mg, &ps, max_y, v3s16(x, y, z));
325 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
326 PseudoRandom pr(blockseed + 53);
327 std::vector<CutoffData> handled_cutoffs;
329 // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
331 JMutexAutoLock cutofflock(cutoff_mutex);
332 for (std::list<CutoffData>::iterator i = cutoffs.begin();
333 i != cutoffs.end(); ++i) {
334 CutoffData cutoff = *i;
336 s16 height = cutoff.height;
337 if (p.X < nmin.X || p.X > nmax.X ||
338 p.Z < nmin.Z || p.Z > nmax.Z)
340 if (p.Y + height < nmin.Y || p.Y > nmax.Y)
343 handled_cutoffs.push_back(cutoff);
347 // Generate the cutoffs
348 for (size_t i = 0; i != handled_cutoffs.size(); i++) {
349 v3s16 p = handled_cutoffs[i].p;
350 s16 height = handled_cutoffs[i].height;
352 if (p.Y + height > nmax.Y) {
353 //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
354 cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
357 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
360 // Remove cutoffs that were handled from the cutoff list
362 JMutexAutoLock cutofflock(cutoff_mutex);
363 for (std::list<CutoffData>::iterator i = cutoffs.begin();
364 i != cutoffs.end(); ++i) {
366 for (size_t j = 0; j != handled_cutoffs.size(); j++) {
367 CutoffData coff = *i;
368 if (coff.p == handled_cutoffs[j].p)
369 i = cutoffs.erase(i);
377 ///////////////////////////////////////////////////////////////////////////////
380 void DecoSimple::resolveNodeNames(INodeDefManager *ndef) {
381 Decoration::resolveNodeNames(ndef);
383 if (c_deco == CONTENT_IGNORE) {
384 c_deco = ndef->getId(deco_name);
385 if (c_deco == CONTENT_IGNORE) {
386 errorstream << "DecoSimple::resolveNodeNames: decoration node '"
387 << deco_name << "' not defined" << std::endl;
388 c_deco = CONTENT_AIR;
391 if (c_spawnby == CONTENT_IGNORE) {
392 c_spawnby = ndef->getId(spawnby_name);
393 if (c_spawnby == CONTENT_IGNORE) {
394 errorstream << "DecoSimple::resolveNodeNames: spawnby node '"
395 << deco_name << "' not defined" << std::endl;
397 c_spawnby = CONTENT_AIR;
401 if (c_decolist.size())
404 for (size_t i = 0; i != decolist_names.size(); i++) {
405 content_t c = ndef->getId(decolist_names[i]);
406 if (c == CONTENT_IGNORE) {
407 errorstream << "DecoSimple::resolveNodeNames: decolist node '"
408 << decolist_names[i] << "' not defined" << std::endl;
411 c_decolist.push_back(c);
416 void DecoSimple::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
417 ManualMapVoxelManipulator *vm = mg->vm;
419 u32 vi = vm->m_area.index(p);
420 if (vm->m_data[vi].getContent() != c_place_on &&
421 c_place_on != CONTENT_IGNORE)
424 if (nspawnby != -1) {
426 v3s16 dirs[8] = { // a Moore neighborhood
437 for (int i = 0; i != 8; i++) {
438 u32 index = vm->m_area.index(p + dirs[i]);
439 if (vm->m_area.contains(index) &&
440 vm->m_data[index].getContent() == c_spawnby)
444 if (nneighs < nspawnby)
448 size_t ndecos = c_decolist.size();
449 content_t c_place = ndecos ? c_decolist[pr->range(0, ndecos - 1)] : c_deco;
451 s16 height = (deco_height_max > 0) ?
452 pr->range(deco_height, deco_height_max) : deco_height;
454 height = MYMIN(height, max_y - p.Y);
456 v3s16 em = vm->m_area.getExtent();
457 for (int i = 0; i < height; i++) {
458 vm->m_area.add_y(em, vi, 1);
460 content_t c = vm->m_data[vi].getContent();
461 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
464 vm->m_data[vi] = MapNode(c_place);
469 int DecoSimple::getHeight() {
470 return (deco_height_max > 0) ? deco_height_max : deco_height;
474 std::string DecoSimple::getName() {
479 ///////////////////////////////////////////////////////////////////////////////
482 DecoSchematic::DecoSchematic() {
486 size = v3s16(0, 0, 0);
490 DecoSchematic::~DecoSchematic() {
496 void DecoSchematic::resolveNodeNames(INodeDefManager *ndef) {
497 Decoration::resolveNodeNames(ndef);
499 if (filename.empty())
503 errorstream << "DecoSchematic::resolveNodeNames: node name list was "
504 "not created" << std::endl;
508 for (size_t i = 0; i != node_names->size(); i++) {
509 content_t c = ndef->getId(node_names->at(i));
510 if (c == CONTENT_IGNORE) {
511 errorstream << "DecoSchematic::resolveNodeNames: node '"
512 << node_names->at(i) << "' not defined" << std::endl;
515 c_nodes.push_back(c);
518 for (int i = 0; i != size.X * size.Y * size.Z; i++)
519 schematic[i].setContent(c_nodes[schematic[i].getContent()]);
526 void DecoSchematic::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
527 ManualMapVoxelManipulator *vm = mg->vm;
529 if (flags & DECO_PLACE_CENTER_X)
530 p.X -= (size.X + 1) / 2;
531 if (flags & DECO_PLACE_CENTER_Y)
532 p.Y -= (size.Y + 1) / 2;
533 if (flags & DECO_PLACE_CENTER_Z)
534 p.Z -= (size.Z + 1) / 2;
536 u32 vi = vm->m_area.index(p);
537 if (vm->m_data[vi].getContent() != c_place_on &&
538 c_place_on != CONTENT_IGNORE)
541 Rotation rot = (rotation == ROTATE_RAND) ?
542 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
544 blitToVManip(p, vm, rot, false);
548 int DecoSchematic::getHeight() {
553 std::string DecoSchematic::getName() {
558 void DecoSchematic::blitToVManip(v3s16 p, ManualMapVoxelManipulator *vm,
559 Rotation rot, bool force_placement) {
561 int ystride = size.X;
562 int zstride = size.X * size.Y;
568 int i_start, i_step_x, i_step_z;
577 i_start = zstride * (sz - 1) + sx - 1;
582 i_start = zstride * (sz - 1);
593 for (s16 z = 0; z != sz; z++)
594 for (s16 y = 0; y != sy; y++) {
595 u32 i = z * i_step_z + y * ystride + i_start;
596 for (s16 x = 0; x != sx; x++, i += i_step_x) {
597 u32 vi = vm->m_area.index(p.X + x, p.Y + y, p.Z + z);
598 if (!vm->m_area.contains(vi))
601 if (schematic[i].getContent() == CONTENT_IGNORE)
604 if (!force_placement) {
605 content_t c = vm->m_data[vi].getContent();
606 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
610 if (schematic[i].param1 && myrand_range(1, 256) > schematic[i].param1)
613 vm->m_data[vi] = schematic[i];
614 vm->m_data[vi].param1 = 0;
617 vm->m_data[vi].rotateAlongYAxis(ndef, rot);
623 void DecoSchematic::placeStructure(Map *map, v3s16 p) {
624 assert(schematic != NULL);
625 ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
627 Rotation rot = (rotation == ROTATE_RAND) ?
628 (Rotation)myrand_range(ROTATE_0, ROTATE_270) : rotation;
630 v3s16 s = (rot == ROTATE_90 || rot == ROTATE_270) ?
631 v3s16(size.Z, size.Y, size.X) : size;
633 if (flags & DECO_PLACE_CENTER_X)
634 p.X -= (s.X + 1) / 2;
635 if (flags & DECO_PLACE_CENTER_Y)
636 p.Y -= (s.Y + 1) / 2;
637 if (flags & DECO_PLACE_CENTER_Z)
638 p.Z -= (s.Z + 1) / 2;
640 v3s16 bp1 = getNodeBlockPos(p);
641 v3s16 bp2 = getNodeBlockPos(p + s - v3s16(1,1,1));
642 vm->initialEmerge(bp1, bp2);
644 blitToVManip(p, vm, rot, true);
646 std::map<v3s16, MapBlock *> lighting_modified_blocks;
647 std::map<v3s16, MapBlock *> modified_blocks;
648 vm->blitBackAll(&modified_blocks);
650 // TODO: Optimize this by using Mapgen::calcLighting() instead
651 lighting_modified_blocks.insert(modified_blocks.begin(), modified_blocks.end());
652 map->updateLighting(lighting_modified_blocks, modified_blocks);
655 event.type = MEET_OTHER;
656 for (std::map<v3s16, MapBlock *>::iterator
657 it = modified_blocks.begin();
658 it != modified_blocks.end(); ++it)
659 event.modified_blocks.insert(it->first);
661 map->dispatchEvent(&event);
665 bool DecoSchematic::loadSchematicFile() {
666 std::ifstream is(filename.c_str(), std::ios_base::binary);
668 u32 signature = readU32(is);
669 if (signature != MTSCHEM_FILE_SIGNATURE) {
670 errorstream << "loadSchematicFile: invalid schematic "
675 u16 version = readU16(is);
677 errorstream << "loadSchematicFile: unsupported schematic "
678 "file version" << std::endl;
682 size = readV3S16(is);
683 int nodecount = size.X * size.Y * size.Z;
685 u16 nidmapcount = readU16(is);
687 node_names = new std::vector<std::string>;
688 for (int i = 0; i != nidmapcount; i++) {
689 std::string name = deSerializeString(is);
690 node_names->push_back(name);
694 schematic = new MapNode[nodecount];
695 MapNode::deSerializeBulk(is, SER_FMT_VER_HIGHEST_READ, schematic,
696 nodecount, 2, 2, true);
703 Minetest Schematic File Format
705 All values are stored in big-endian byte order.
706 [u32] signature: 'MTSM'
711 [Name-ID table] Name ID Mapping Table
713 For each name-id mapping:
717 For each node in schematic: (for z, y, x)
719 For each node in schematic:
720 [u8] probability of occurance (param1)
721 For each node in schematic:
725 void DecoSchematic::saveSchematicFile(INodeDefManager *ndef) {
726 std::ofstream os(filename.c_str(), std::ios_base::binary);
728 writeU32(os, MTSCHEM_FILE_SIGNATURE); // signature
729 writeU16(os, 1); // version
730 writeV3S16(os, size); // schematic size
732 std::vector<content_t> usednodes;
733 int nodecount = size.X * size.Y * size.Z;
734 build_nnlist_and_update_ids(schematic, nodecount, &usednodes);
736 u16 numids = usednodes.size();
737 writeU16(os, numids); // name count
738 for (int i = 0; i != numids; i++)
739 os << serializeString(ndef->get(usednodes[i]).name); // node names
741 // compressed bulk node data
742 MapNode::serializeBulk(os, SER_FMT_VER_HIGHEST_WRITE, schematic,
743 nodecount, 2, 2, true);
747 void build_nnlist_and_update_ids(MapNode *nodes, u32 nodecount,
748 std::vector<content_t> *usednodes) {
749 std::map<content_t, content_t> nodeidmap;
750 content_t numids = 0;
752 for (u32 i = 0; i != nodecount; i++) {
754 content_t c = nodes[i].getContent();
756 std::map<content_t, content_t>::const_iterator it = nodeidmap.find(c);
757 if (it == nodeidmap.end()) {
761 usednodes->push_back(c);
762 nodeidmap.insert(std::make_pair(c, id));
766 nodes[i].setContent(id);
771 bool DecoSchematic::getSchematicFromMap(Map *map, v3s16 p1, v3s16 p2) {
772 ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
774 v3s16 bp1 = getNodeBlockPos(p1);
775 v3s16 bp2 = getNodeBlockPos(p2);
776 vm->initialEmerge(bp1, bp2);
779 schematic = new MapNode[size.X * size.Y * size.Z];
782 for (s16 z = p1.Z; z <= p2.Z; z++)
783 for (s16 y = p1.Y; y <= p2.Y; y++) {
784 u32 vi = vm->m_area.index(p1.X, y, z);
785 for (s16 x = p1.X; x <= p2.X; x++, i++, vi++) {
786 schematic[i] = vm->m_data[vi];
787 schematic[i].param1 = 0;
796 void DecoSchematic::applyProbabilities(std::vector<std::pair<v3s16, s16> > *plist, v3s16 p0) {
797 for (size_t i = 0; i != plist->size(); i++) {
798 v3s16 p = (*plist)[i].first - p0;
799 int index = p.Z * (size.Y * size.X) + p.Y * size.X + p.X;
800 if (index < size.Z * size.Y * size.X) {
801 s16 prob = (*plist)[i].second;
803 schematic[index].param1 = prob;
805 schematic[index].setContent(CONTENT_IGNORE);
811 ///////////////////////////////////////////////////////////////////////////////
826 // Returns Y one under area minimum if not found
827 s16 Mapgen::findGroundLevelFull(v2s16 p2d) {
828 v3s16 em = vm->m_area.getExtent();
829 s16 y_nodes_max = vm->m_area.MaxEdge.Y;
830 s16 y_nodes_min = vm->m_area.MinEdge.Y;
831 u32 i = vm->m_area.index(p2d.X, y_nodes_max, p2d.Y);
834 for (y = y_nodes_max; y >= y_nodes_min; y--) {
835 MapNode &n = vm->m_data[i];
836 if (ndef->get(n).walkable)
839 vm->m_area.add_y(em, i, -1);
841 return (y >= y_nodes_min) ? y : y_nodes_min - 1;
845 s16 Mapgen::findGroundLevel(v2s16 p2d, s16 ymin, s16 ymax) {
846 v3s16 em = vm->m_area.getExtent();
847 u32 i = vm->m_area.index(p2d.X, ymax, p2d.Y);
850 for (y = ymax; y >= ymin; y--) {
851 MapNode &n = vm->m_data[i];
852 if (ndef->get(n).walkable)
855 vm->m_area.add_y(em, i, -1);
861 void Mapgen::updateHeightmap(v3s16 nmin, v3s16 nmax) {
865 //TimeTaker t("Mapgen::updateHeightmap", NULL, PRECISION_MICRO);
867 for (s16 z = nmin.Z; z <= nmax.Z; z++) {
868 for (s16 x = nmin.X; x <= nmax.X; x++, index++) {
869 s16 y = findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
871 // if the values found are out of range, trust the old heightmap
872 if (y == nmax.Y && heightmap[index] > nmax.Y)
874 if (y == nmin.Y - 1 && heightmap[index] < nmin.Y)
877 heightmap[index] = y;
880 //printf("updateHeightmap: %dus\n", t.stop());
884 void Mapgen::updateLiquid(UniqueQueue<v3s16> *trans_liquid, v3s16 nmin, v3s16 nmax) {
885 bool isliquid, wasliquid, rare;
886 v3s16 em = vm->m_area.getExtent();
887 rare = g_settings->getBool("liquid_finite");
890 for (s16 z = nmin.Z; z <= nmax.Z; z++) {
891 for (s16 x = nmin.X; x <= nmax.X; x++) {
894 u32 i = vm->m_area.index(x, nmax.Y, z);
895 for (s16 y = nmax.Y; y >= nmin.Y; y--) {
896 isliquid = ndef->get(vm->m_data[i]).isLiquid();
898 // there was a change between liquid and nonliquid, add to queue. no need to add every with liquid_finite
899 if (isliquid != wasliquid && (!rare || !(rarecnt++ % 36)))
900 trans_liquid->push_back(v3s16(x, y, z));
902 wasliquid = isliquid;
903 vm->m_area.add_y(em, i, -1);
910 void Mapgen::setLighting(v3s16 nmin, v3s16 nmax, u8 light) {
911 ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
912 VoxelArea a(nmin, nmax);
914 for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
915 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
916 u32 i = vm->m_area.index(a.MinEdge.X, y, z);
917 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++)
918 vm->m_data[i].param1 = light;
924 void Mapgen::lightSpread(VoxelArea &a, v3s16 p, u8 light) {
925 if (light <= 1 || !a.contains(p))
928 u32 vi = vm->m_area.index(p);
929 MapNode &nn = vm->m_data[vi];
932 // should probably compare masked, but doesn't seem to make a difference
933 if (light <= nn.param1 || !ndef->get(nn).light_propagates)
938 lightSpread(a, p + v3s16(0, 0, 1), light);
939 lightSpread(a, p + v3s16(0, 1, 0), light);
940 lightSpread(a, p + v3s16(1, 0, 0), light);
941 lightSpread(a, p - v3s16(0, 0, 1), light);
942 lightSpread(a, p - v3s16(0, 1, 0), light);
943 lightSpread(a, p - v3s16(1, 0, 0), light);
947 void Mapgen::calcLighting(v3s16 nmin, v3s16 nmax) {
948 VoxelArea a(nmin, nmax);
949 bool block_is_underground = (water_level >= nmax.Y);
951 ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
952 //TimeTaker t("updateLighting");
954 // first, send vertical rays of sunshine downward
955 v3s16 em = vm->m_area.getExtent();
956 for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
957 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++) {
958 // see if we can get a light value from the overtop
959 u32 i = vm->m_area.index(x, a.MaxEdge.Y + 1, z);
960 if (vm->m_data[i].getContent() == CONTENT_IGNORE) {
961 if (block_is_underground)
963 } else if ((vm->m_data[i].param1 & 0x0F) != LIGHT_SUN) {
966 vm->m_area.add_y(em, i, -1);
968 for (int y = a.MaxEdge.Y; y >= a.MinEdge.Y; y--) {
969 MapNode &n = vm->m_data[i];
970 if (!ndef->get(n).sunlight_propagates)
972 n.param1 = LIGHT_SUN;
973 vm->m_area.add_y(em, i, -1);
978 // now spread the sunlight and light up any sources
979 for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
980 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
981 u32 i = vm->m_area.index(a.MinEdge.X, y, z);
982 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++) {
983 MapNode &n = vm->m_data[i];
984 if (n.getContent() == CONTENT_IGNORE ||
985 !ndef->get(n).light_propagates)
988 u8 light_produced = ndef->get(n).light_source & 0x0F;
990 n.param1 = light_produced;
992 u8 light = n.param1 & 0x0F;
994 lightSpread(a, v3s16(x, y, z + 1), light - 1);
995 lightSpread(a, v3s16(x, y + 1, z ), light - 1);
996 lightSpread(a, v3s16(x + 1, y, z ), light - 1);
997 lightSpread(a, v3s16(x, y, z - 1), light - 1);
998 lightSpread(a, v3s16(x, y - 1, z ), light - 1);
999 lightSpread(a, v3s16(x - 1, y, z ), light - 1);
1005 //printf("updateLighting: %dms\n", t.stop());
1009 void Mapgen::calcLightingOld(v3s16 nmin, v3s16 nmax) {
1010 enum LightBank banks[2] = {LIGHTBANK_DAY, LIGHTBANK_NIGHT};
1011 VoxelArea a(nmin, nmax);
1012 bool block_is_underground = (water_level > nmax.Y);
1013 bool sunlight = !block_is_underground;
1015 ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
1017 for (int i = 0; i < 2; i++) {
1018 enum LightBank bank = banks[i];
1019 std::set<v3s16> light_sources;
1020 std::map<v3s16, u8> unlight_from;
1022 voxalgo::clearLightAndCollectSources(*vm, a, bank, ndef,
1023 light_sources, unlight_from);
1024 voxalgo::propagateSunlight(*vm, a, sunlight, light_sources, ndef);
1026 vm->unspreadLight(bank, unlight_from, light_sources, ndef);
1027 vm->spreadLight(bank, light_sources, ndef);
1032 //////////////////////// Mapgen V6 parameter read/write
1034 bool MapgenV6Params::readParams(Settings *settings) {
1035 freq_desert = settings->getFloat("mgv6_freq_desert");
1036 freq_beach = settings->getFloat("mgv6_freq_beach");
1039 settings->getNoiseParams("mgv6_np_terrain_base", np_terrain_base) &&
1040 settings->getNoiseParams("mgv6_np_terrain_higher", np_terrain_higher) &&
1041 settings->getNoiseParams("mgv6_np_steepness", np_steepness) &&
1042 settings->getNoiseParams("mgv6_np_height_select", np_height_select) &&
1043 settings->getNoiseParams("mgv6_np_mud", np_mud) &&
1044 settings->getNoiseParams("mgv6_np_beach", np_beach) &&
1045 settings->getNoiseParams("mgv6_np_biome", np_biome) &&
1046 settings->getNoiseParams("mgv6_np_cave", np_cave) &&
1047 settings->getNoiseParams("mgv6_np_humidity", np_humidity) &&
1048 settings->getNoiseParams("mgv6_np_trees", np_trees) &&
1049 settings->getNoiseParams("mgv6_np_apple_trees", np_apple_trees);
1054 void MapgenV6Params::writeParams(Settings *settings) {
1055 settings->setFloat("mgv6_freq_desert", freq_desert);
1056 settings->setFloat("mgv6_freq_beach", freq_beach);
1058 settings->setNoiseParams("mgv6_np_terrain_base", np_terrain_base);
1059 settings->setNoiseParams("mgv6_np_terrain_higher", np_terrain_higher);
1060 settings->setNoiseParams("mgv6_np_steepness", np_steepness);
1061 settings->setNoiseParams("mgv6_np_height_select", np_height_select);
1062 settings->setNoiseParams("mgv6_np_mud", np_mud);
1063 settings->setNoiseParams("mgv6_np_beach", np_beach);
1064 settings->setNoiseParams("mgv6_np_biome", np_biome);
1065 settings->setNoiseParams("mgv6_np_cave", np_cave);
1066 settings->setNoiseParams("mgv6_np_humidity", np_humidity);
1067 settings->setNoiseParams("mgv6_np_trees", np_trees);
1068 settings->setNoiseParams("mgv6_np_apple_trees", np_apple_trees);
1072 bool MapgenV7Params::readParams(Settings *settings) {
1074 settings->getNoiseParams("mgv7_np_terrain_base", np_terrain_base) &&
1075 settings->getNoiseParams("mgv7_np_terrain_alt", np_terrain_alt) &&
1076 settings->getNoiseParams("mgv7_np_terrain_persist", np_terrain_persist) &&
1077 settings->getNoiseParams("mgv7_np_height_select", np_height_select) &&
1078 settings->getNoiseParams("mgv7_np_filler_depth", np_filler_depth) &&
1079 settings->getNoiseParams("mgv7_np_mount_height", np_mount_height) &&
1080 settings->getNoiseParams("mgv7_np_ridge_uwater", np_ridge_uwater) &&
1081 settings->getNoiseParams("mgv7_np_mountain", np_mountain) &&
1082 settings->getNoiseParams("mgv7_np_ridge", np_ridge);
1087 void MapgenV7Params::writeParams(Settings *settings) {
1088 settings->setNoiseParams("mgv7_np_terrain_base", np_terrain_base);
1089 settings->setNoiseParams("mgv7_np_terrain_alt", np_terrain_alt);
1090 settings->setNoiseParams("mgv7_np_terrain_persist", np_terrain_persist);
1091 settings->setNoiseParams("mgv7_np_height_select", np_height_select);
1092 settings->setNoiseParams("mgv7_np_filler_depth", np_filler_depth);
1093 settings->setNoiseParams("mgv7_np_mount_height", np_mount_height);
1094 settings->setNoiseParams("mgv7_np_ridge_uwater", np_ridge_uwater);
1095 settings->setNoiseParams("mgv7_np_mountain", np_mountain);
1096 settings->setNoiseParams("mgv7_np_ridge", np_ridge);
1100 /////////////////////////////////// legacy static functions for farmesh
1102 s16 Mapgen::find_ground_level_from_noise(u64 seed, v2s16 p2d, s16 precision) {
1103 //just need to return something
1109 bool Mapgen::get_have_beach(u64 seed, v2s16 p2d) {
1110 double sandnoise = noise2d_perlin(
1111 0.2+(float)p2d.X/250, 0.7+(float)p2d.Y/250,
1112 seed+59420, 3, 0.50);
1114 return (sandnoise > 0.15);
1118 double Mapgen::tree_amount_2d(u64 seed, v2s16 p) {
1119 double noise = noise2d_perlin(
1120 0.5+(float)p.X/125, 0.5+(float)p.Y/125,
1122 double zeroval = -0.39;
1126 return 0.04 * (noise-zeroval) / (1.0-zeroval);