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 "serialization.h"
39 #include "util/serialize.h"
42 FlagDesc flagdesc_mapgen[] = {
45 {"dungeons", MG_DUNGEONS},
46 {"v6_jungles", MGV6_JUNGLES},
47 {"v6_biome_blend", MGV6_BIOME_BLEND},
49 {"nolight", MG_NOLIGHT},
53 FlagDesc flagdesc_ore[] = {
54 {"absheight", OREFLAG_ABSHEIGHT},
55 {"scatter_noisedensity", OREFLAG_DENSITY},
56 {"claylike_nodeisnt", OREFLAG_NODEISNT},
60 FlagDesc flagdesc_deco_schematic[] = {
61 {"place_center_x", DECO_PLACE_CENTER_X},
62 {"place_center_y", DECO_PLACE_CENTER_Y},
63 {"place_center_z", DECO_PLACE_CENTER_Z},
67 ///////////////////////////////////////////////////////////////////////////////
70 Ore *createOre(OreType type) {
73 return new OreScatter;
76 //case ORE_CLAYLIKE: //TODO: implement this!
77 // return new OreClaylike;
90 void Ore::resolveNodeNames(INodeDefManager *ndef) {
91 if (ore == CONTENT_IGNORE) {
92 ore = ndef->getId(ore_name);
93 if (ore == CONTENT_IGNORE) {
94 errorstream << "Ore::resolveNodeNames: ore node '"
95 << ore_name << "' not defined";
97 wherein.push_back(CONTENT_AIR);
102 for (size_t i=0; i != wherein_names.size(); i++) {
103 std::string name = wherein_names[i];
104 content_t c = ndef->getId(name);
105 if (c != CONTENT_IGNORE) {
106 wherein.push_back(c);
112 void Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
115 in_range |= (nmin.Y <= height_max && nmax.Y >= height_min);
116 if (flags & OREFLAG_ABSHEIGHT)
117 in_range |= (nmin.Y >= -height_max && nmax.Y <= -height_min) << 1;
122 if (in_range & ORE_RANGE_MIRROR) {
123 ymin = MYMAX(nmin.Y, -height_max);
124 ymax = MYMIN(nmax.Y, -height_min);
126 ymin = MYMAX(nmin.Y, height_min);
127 ymax = MYMIN(nmax.Y, height_max);
129 if (clust_size >= ymax - ymin + 1)
134 generate(mg->vm, mg->seed, blockseed, nmin, nmax);
138 void OreScatter::generate(ManualMapVoxelManipulator *vm, int seed,
139 u32 blockseed, v3s16 nmin, v3s16 nmax) {
140 PseudoRandom pr(blockseed);
141 MapNode n_ore(ore, 0, ore_param2);
143 int volume = (nmax.X - nmin.X + 1) *
144 (nmax.Y - nmin.Y + 1) *
145 (nmax.Z - nmin.Z + 1);
146 int csize = clust_size;
147 int orechance = (csize * csize * csize) / clust_num_ores;
148 int nclusters = volume / clust_scarcity;
150 for (int i = 0; i != nclusters; i++) {
151 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
152 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
153 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
155 if (np && (NoisePerlin3D(np, x0, y0, z0, seed) < nthresh))
158 for (int z1 = 0; z1 != csize; z1++)
159 for (int y1 = 0; y1 != csize; y1++)
160 for (int x1 = 0; x1 != csize; x1++) {
161 if (pr.range(1, orechance) != 1)
164 u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
165 for (size_t ii = 0; ii < wherein.size(); ii++)
166 if (vm->m_data[i].getContent() == wherein[ii])
167 vm->m_data[i] = n_ore;
173 void OreSheet::generate(ManualMapVoxelManipulator *vm, int seed,
174 u32 blockseed, v3s16 nmin, v3s16 nmax) {
175 PseudoRandom pr(blockseed + 4234);
176 MapNode n_ore(ore, 0, ore_param2);
178 int max_height = clust_size;
179 int y_start = pr.range(nmin.Y, nmax.Y - max_height);
182 int sx = nmax.X - nmin.X + 1;
183 int sz = nmax.Z - nmin.Z + 1;
184 noise = new Noise(np, 0, sx, sz);
186 noise->seed = seed + y_start;
187 noise->perlinMap2D(nmin.X, nmin.Z);
190 for (int z = nmin.Z; z <= nmax.Z; z++)
191 for (int x = nmin.X; x <= nmax.X; x++) {
192 float noiseval = noise->result[index++];
193 if (noiseval < nthresh)
196 int height = max_height * (1. / pr.range(1, 3));
197 int y0 = y_start + np->scale * noiseval; //pr.range(1, 3) - 1;
198 int y1 = y0 + height;
199 for (int y = y0; y != y1; y++) {
200 u32 i = vm->m_area.index(x, y, z);
201 if (!vm->m_area.contains(i))
204 for (size_t ii = 0; ii < wherein.size(); ii++)
205 if (vm->m_data[i].getContent() == wherein[ii])
206 vm->m_data[i] = n_ore;
212 ///////////////////////////////////////////////////////////////////////////////
215 Decoration *createDecoration(DecorationType type) {
218 return new DecoSimple;
220 return new DecoSchematic;
222 // return new DecoLSystem;
229 Decoration::Decoration() {
237 Decoration::~Decoration() {
242 void Decoration::resolveNodeNames(INodeDefManager *ndef) {
245 if (c_place_on == CONTENT_IGNORE)
246 c_place_on = ndef->getId(place_on_name);
250 void Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
251 PseudoRandom ps(blockseed + 53);
252 int carea_size = nmax.X - nmin.X + 1;
254 // Divide area into parts
255 if (carea_size % sidelen) {
256 errorstream << "Decoration::placeDeco: chunk size is not divisible by "
257 "sidelen; setting sidelen to " << carea_size << std::endl;
258 sidelen = carea_size;
261 s16 divlen = carea_size / sidelen;
262 int area = sidelen * sidelen;
264 for (s16 z0 = 0; z0 < divlen; z0++)
265 for (s16 x0 = 0; x0 < divlen; x0++) {
266 v2s16 p2d_center( // Center position of part of division
267 nmin.X + sidelen / 2 + sidelen * x0,
268 nmin.Z + sidelen / 2 + sidelen * z0
270 v2s16 p2d_min( // Minimum edge of part of division
271 nmin.X + sidelen * x0,
272 nmin.Z + sidelen * z0
274 v2s16 p2d_max( // Maximum edge of part of division
275 nmin.X + sidelen + sidelen * x0 - 1,
276 nmin.Z + sidelen + sidelen * z0 - 1
279 // Amount of decorations
281 NoisePerlin2D(np, p2d_center.X, p2d_center.Y, mapseed) :
283 u32 deco_count = area * MYMAX(nval, 0.f);
285 for (u32 i = 0; i < deco_count; i++) {
286 s16 x = ps.range(p2d_min.X, p2d_max.X);
287 s16 z = ps.range(p2d_min.Y, p2d_max.Y);
289 int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
291 s16 y = mg->heightmap ?
292 mg->heightmap[mapindex] :
293 mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
295 if (y < nmin.Y || y > nmax.Y)
298 int height = getHeight();
299 int max_y = nmax.Y;// + MAP_BLOCKSIZE - 1;
300 if (y + 1 + height > max_y) {
303 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
305 JMutexAutoLock cutofflock(cutoff_mutex);
306 cutoffs.push_back(CutoffData(x, y, z, height));
311 std::set<u8>::iterator iter;
314 iter = biomes.find(mg->biomemap[mapindex]);
315 if (iter == biomes.end())
320 generate(mg, &ps, max_y, v3s16(x, y, z));
327 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
328 PseudoRandom pr(blockseed + 53);
329 std::vector<CutoffData> handled_cutoffs;
331 // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
333 JMutexAutoLock cutofflock(cutoff_mutex);
334 for (std::list<CutoffData>::iterator i = cutoffs.begin();
335 i != cutoffs.end(); ++i) {
336 CutoffData cutoff = *i;
338 s16 height = cutoff.height;
339 if (p.X < nmin.X || p.X > nmax.X ||
340 p.Z < nmin.Z || p.Z > nmax.Z)
342 if (p.Y + height < nmin.Y || p.Y > nmax.Y)
345 handled_cutoffs.push_back(cutoff);
349 // Generate the cutoffs
350 for (size_t i = 0; i != handled_cutoffs.size(); i++) {
351 v3s16 p = handled_cutoffs[i].p;
352 s16 height = handled_cutoffs[i].height;
354 if (p.Y + height > nmax.Y) {
355 //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
356 cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
359 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
362 // Remove cutoffs that were handled from the cutoff list
364 JMutexAutoLock cutofflock(cutoff_mutex);
365 for (std::list<CutoffData>::iterator i = cutoffs.begin();
366 i != cutoffs.end(); ++i) {
368 for (size_t j = 0; j != handled_cutoffs.size(); j++) {
369 CutoffData coff = *i;
370 if (coff.p == handled_cutoffs[j].p)
371 i = cutoffs.erase(i);
379 ///////////////////////////////////////////////////////////////////////////////
382 void DecoSimple::resolveNodeNames(INodeDefManager *ndef) {
383 Decoration::resolveNodeNames(ndef);
385 if (c_deco == CONTENT_IGNORE && !decolist_names.size()) {
386 c_deco = ndef->getId(deco_name);
387 if (c_deco == CONTENT_IGNORE) {
388 errorstream << "DecoSimple::resolveNodeNames: decoration node '"
389 << deco_name << "' not defined" << std::endl;
390 c_deco = CONTENT_AIR;
393 if (c_spawnby == CONTENT_IGNORE) {
394 c_spawnby = ndef->getId(spawnby_name);
395 if (c_spawnby == CONTENT_IGNORE) {
396 errorstream << "DecoSimple::resolveNodeNames: spawnby node '"
397 << spawnby_name << "' not defined" << std::endl;
399 c_spawnby = CONTENT_AIR;
403 if (c_decolist.size())
406 for (size_t i = 0; i != decolist_names.size(); i++) {
407 content_t c = ndef->getId(decolist_names[i]);
408 if (c == CONTENT_IGNORE) {
409 errorstream << "DecoSimple::resolveNodeNames: decolist node '"
410 << decolist_names[i] << "' not defined" << std::endl;
413 c_decolist.push_back(c);
418 void DecoSimple::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
419 ManualMapVoxelManipulator *vm = mg->vm;
421 u32 vi = vm->m_area.index(p);
422 if (vm->m_data[vi].getContent() != c_place_on &&
423 c_place_on != CONTENT_IGNORE)
426 if (nspawnby != -1) {
428 v3s16 dirs[8] = { // a Moore neighborhood
439 for (int i = 0; i != 8; i++) {
440 u32 index = vm->m_area.index(p + dirs[i]);
441 if (vm->m_area.contains(index) &&
442 vm->m_data[index].getContent() == c_spawnby)
446 if (nneighs < nspawnby)
450 size_t ndecos = c_decolist.size();
451 content_t c_place = ndecos ? c_decolist[pr->range(0, ndecos - 1)] : c_deco;
453 s16 height = (deco_height_max > 0) ?
454 pr->range(deco_height, deco_height_max) : deco_height;
456 height = MYMIN(height, max_y - p.Y);
458 v3s16 em = vm->m_area.getExtent();
459 for (int i = 0; i < height; i++) {
460 vm->m_area.add_y(em, vi, 1);
462 content_t c = vm->m_data[vi].getContent();
463 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
466 vm->m_data[vi] = MapNode(c_place);
471 int DecoSimple::getHeight() {
472 return (deco_height_max > 0) ? deco_height_max : deco_height;
476 std::string DecoSimple::getName() {
481 ///////////////////////////////////////////////////////////////////////////////
484 DecoSchematic::DecoSchematic() {
489 size = v3s16(0, 0, 0);
493 DecoSchematic::~DecoSchematic() {
496 delete []slice_probs;
500 void DecoSchematic::resolveNodeNames(INodeDefManager *ndef) {
501 Decoration::resolveNodeNames(ndef);
503 if (filename.empty())
507 errorstream << "DecoSchematic::resolveNodeNames: node name list was "
508 "not created" << std::endl;
512 for (size_t i = 0; i != node_names->size(); i++) {
513 std::string name = node_names->at(i);
515 std::map<std::string, std::string>::iterator it;
516 it = replacements.find(name);
517 if (it != replacements.end())
520 content_t c = ndef->getId(name);
521 if (c == CONTENT_IGNORE) {
522 errorstream << "DecoSchematic::resolveNodeNames: node '"
523 << name << "' not defined" << std::endl;
527 c_nodes.push_back(c);
530 for (int i = 0; i != size.X * size.Y * size.Z; i++)
531 schematic[i].setContent(c_nodes[schematic[i].getContent()]);
538 void DecoSchematic::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
539 ManualMapVoxelManipulator *vm = mg->vm;
541 if (flags & DECO_PLACE_CENTER_X)
542 p.X -= (size.X + 1) / 2;
543 if (flags & DECO_PLACE_CENTER_Y)
544 p.Y -= (size.Y + 1) / 2;
545 if (flags & DECO_PLACE_CENTER_Z)
546 p.Z -= (size.Z + 1) / 2;
548 u32 vi = vm->m_area.index(p);
549 if (vm->m_data[vi].getContent() != c_place_on &&
550 c_place_on != CONTENT_IGNORE)
553 Rotation rot = (rotation == ROTATE_RAND) ?
554 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
556 blitToVManip(p, vm, rot, false);
560 int DecoSchematic::getHeight() {
565 std::string DecoSchematic::getName() {
570 void DecoSchematic::blitToVManip(v3s16 p, ManualMapVoxelManipulator *vm,
571 Rotation rot, bool force_placement) {
573 int ystride = size.X;
574 int zstride = size.X * size.Y;
580 int i_start, i_step_x, i_step_z;
589 i_start = zstride * (sz - 1) + sx - 1;
594 i_start = zstride * (sz - 1);
606 for (s16 y = 0; y != sy; y++) {
607 if (slice_probs[y] != MTSCHEM_PROB_ALWAYS &&
608 myrand_range(1, 255) > slice_probs[y])
611 for (s16 z = 0; z != sz; z++) {
612 u32 i = z * i_step_z + y * ystride + i_start;
613 for (s16 x = 0; x != sx; x++, i += i_step_x) {
614 u32 vi = vm->m_area.index(p.X + x, y_map, p.Z + z);
615 if (!vm->m_area.contains(vi))
618 if (schematic[i].getContent() == CONTENT_IGNORE)
621 if (schematic[i].param1 == MTSCHEM_PROB_NEVER)
624 if (!force_placement) {
625 content_t c = vm->m_data[vi].getContent();
626 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
630 if (schematic[i].param1 != MTSCHEM_PROB_ALWAYS &&
631 myrand_range(1, 255) > schematic[i].param1)
634 vm->m_data[vi] = schematic[i];
635 vm->m_data[vi].param1 = 0;
638 vm->m_data[vi].rotateAlongYAxis(ndef, rot);
646 void DecoSchematic::placeStructure(Map *map, v3s16 p) {
647 assert(schematic != NULL);
648 ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
650 Rotation rot = (rotation == ROTATE_RAND) ?
651 (Rotation)myrand_range(ROTATE_0, ROTATE_270) : rotation;
653 v3s16 s = (rot == ROTATE_90 || rot == ROTATE_270) ?
654 v3s16(size.Z, size.Y, size.X) : size;
656 if (flags & DECO_PLACE_CENTER_X)
657 p.X -= (s.X + 1) / 2;
658 if (flags & DECO_PLACE_CENTER_Y)
659 p.Y -= (s.Y + 1) / 2;
660 if (flags & DECO_PLACE_CENTER_Z)
661 p.Z -= (s.Z + 1) / 2;
663 v3s16 bp1 = getNodeBlockPos(p);
664 v3s16 bp2 = getNodeBlockPos(p + s - v3s16(1,1,1));
665 vm->initialEmerge(bp1, bp2);
667 blitToVManip(p, vm, rot, true);
669 std::map<v3s16, MapBlock *> lighting_modified_blocks;
670 std::map<v3s16, MapBlock *> modified_blocks;
671 vm->blitBackAll(&modified_blocks);
673 // TODO: Optimize this by using Mapgen::calcLighting() instead
674 lighting_modified_blocks.insert(modified_blocks.begin(), modified_blocks.end());
675 map->updateLighting(lighting_modified_blocks, modified_blocks);
678 event.type = MEET_OTHER;
679 for (std::map<v3s16, MapBlock *>::iterator
680 it = modified_blocks.begin();
681 it != modified_blocks.end(); ++it)
682 event.modified_blocks.insert(it->first);
684 map->dispatchEvent(&event);
688 bool DecoSchematic::loadSchematicFile() {
689 content_t cignore = CONTENT_IGNORE;
690 bool have_cignore = false;
692 std::ifstream is(filename.c_str(), std::ios_base::binary);
694 u32 signature = readU32(is);
695 if (signature != MTSCHEM_FILE_SIGNATURE) {
696 errorstream << "loadSchematicFile: invalid schematic "
701 u16 version = readU16(is);
702 if (version > MTSCHEM_FILE_VER_HIGHEST_READ) {
703 errorstream << "loadSchematicFile: unsupported schematic "
704 "file version" << std::endl;
708 size = readV3S16(is);
710 delete []slice_probs;
711 slice_probs = new u8[size.Y];
713 for (int y = 0; y != size.Y; y++)
714 slice_probs[y] = readU8(is);
716 for (int y = 0; y != size.Y; y++)
717 slice_probs[y] = MTSCHEM_PROB_ALWAYS;
720 int nodecount = size.X * size.Y * size.Z;
722 u16 nidmapcount = readU16(is);
724 node_names = new std::vector<std::string>;
725 for (int i = 0; i != nidmapcount; i++) {
726 std::string name = deSerializeString(is);
727 if (name == "ignore") {
732 node_names->push_back(name);
736 schematic = new MapNode[nodecount];
737 MapNode::deSerializeBulk(is, SER_FMT_VER_HIGHEST_READ, schematic,
738 nodecount, 2, 2, true);
740 if (version == 1) { // fix up the probability values
741 for (int i = 0; i != nodecount; i++) {
742 if (schematic[i].param1 == 0)
743 schematic[i].param1 = MTSCHEM_PROB_ALWAYS;
744 if (have_cignore && schematic[i].getContent() == cignore)
745 schematic[i].param1 = MTSCHEM_PROB_NEVER;
754 Minetest Schematic File Format
756 All values are stored in big-endian byte order.
757 [u32] signature: 'MTSM'
763 [u8] slice probability value
764 [Name-ID table] Name ID Mapping Table
766 For each name-id mapping:
770 For each node in schematic: (for z, y, x)
772 For each node in schematic:
773 [u8] probability of occurance (param1)
774 For each node in schematic:
780 2 - Fixed messy never/always place; 0 probability is now never, 0xFF is always
782 void DecoSchematic::saveSchematicFile(INodeDefManager *ndef) {
783 std::ostringstream ss(std::ios_base::binary);
785 writeU32(ss, MTSCHEM_FILE_SIGNATURE); // signature
786 writeU16(ss, MTSCHEM_FILE_VER_HIGHEST_WRITE); // version
787 writeV3S16(ss, size); // schematic size
789 for (int y = 0; y != size.Y; y++) // Y slice probabilities
790 writeU8(ss, slice_probs[y]);
792 std::vector<content_t> usednodes;
793 int nodecount = size.X * size.Y * size.Z;
794 build_nnlist_and_update_ids(schematic, nodecount, &usednodes);
796 u16 numids = usednodes.size();
797 writeU16(ss, numids); // name count
798 for (int i = 0; i != numids; i++)
799 ss << serializeString(ndef->get(usednodes[i]).name); // node names
801 // compressed bulk node data
802 MapNode::serializeBulk(ss, SER_FMT_VER_HIGHEST_WRITE, schematic,
803 nodecount, 2, 2, true);
805 fs::safeWriteToFile(filename, ss.str());
809 void build_nnlist_and_update_ids(MapNode *nodes, u32 nodecount,
810 std::vector<content_t> *usednodes) {
811 std::map<content_t, content_t> nodeidmap;
812 content_t numids = 0;
814 for (u32 i = 0; i != nodecount; i++) {
816 content_t c = nodes[i].getContent();
818 std::map<content_t, content_t>::const_iterator it = nodeidmap.find(c);
819 if (it == nodeidmap.end()) {
823 usednodes->push_back(c);
824 nodeidmap.insert(std::make_pair(c, id));
828 nodes[i].setContent(id);
833 bool DecoSchematic::getSchematicFromMap(Map *map, v3s16 p1, v3s16 p2) {
834 ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
836 v3s16 bp1 = getNodeBlockPos(p1);
837 v3s16 bp2 = getNodeBlockPos(p2);
838 vm->initialEmerge(bp1, bp2);
842 slice_probs = new u8[size.Y];
843 for (s16 y = 0; y != size.Y; y++)
844 slice_probs[y] = MTSCHEM_PROB_ALWAYS;
846 schematic = new MapNode[size.X * size.Y * size.Z];
849 for (s16 z = p1.Z; z <= p2.Z; z++)
850 for (s16 y = p1.Y; y <= p2.Y; y++) {
851 u32 vi = vm->m_area.index(p1.X, y, z);
852 for (s16 x = p1.X; x <= p2.X; x++, i++, vi++) {
853 schematic[i] = vm->m_data[vi];
854 schematic[i].param1 = MTSCHEM_PROB_ALWAYS;
863 void DecoSchematic::applyProbabilities(v3s16 p0,
864 std::vector<std::pair<v3s16, u8> > *plist,
865 std::vector<std::pair<s16, u8> > *splist) {
867 for (size_t i = 0; i != plist->size(); i++) {
868 v3s16 p = (*plist)[i].first - p0;
869 int index = p.Z * (size.Y * size.X) + p.Y * size.X + p.X;
870 if (index < size.Z * size.Y * size.X) {
871 u8 prob = (*plist)[i].second;
872 schematic[index].param1 = prob;
874 // trim unnecessary node names from schematic
875 if (prob == MTSCHEM_PROB_NEVER)
876 schematic[index].setContent(CONTENT_AIR);
880 for (size_t i = 0; i != splist->size(); i++) {
881 s16 y = (*splist)[i].first - p0.Y;
882 slice_probs[y] = (*splist)[i].second;
887 ///////////////////////////////////////////////////////////////////////////////
902 // Returns Y one under area minimum if not found
903 s16 Mapgen::findGroundLevelFull(v2s16 p2d) {
904 v3s16 em = vm->m_area.getExtent();
905 s16 y_nodes_max = vm->m_area.MaxEdge.Y;
906 s16 y_nodes_min = vm->m_area.MinEdge.Y;
907 u32 i = vm->m_area.index(p2d.X, y_nodes_max, p2d.Y);
910 for (y = y_nodes_max; y >= y_nodes_min; y--) {
911 MapNode &n = vm->m_data[i];
912 if (ndef->get(n).walkable)
915 vm->m_area.add_y(em, i, -1);
917 return (y >= y_nodes_min) ? y : y_nodes_min - 1;
921 s16 Mapgen::findGroundLevel(v2s16 p2d, s16 ymin, s16 ymax) {
922 v3s16 em = vm->m_area.getExtent();
923 u32 i = vm->m_area.index(p2d.X, ymax, p2d.Y);
926 for (y = ymax; y >= ymin; y--) {
927 MapNode &n = vm->m_data[i];
928 if (ndef->get(n).walkable)
931 vm->m_area.add_y(em, i, -1);
937 void Mapgen::updateHeightmap(v3s16 nmin, v3s16 nmax) {
941 //TimeTaker t("Mapgen::updateHeightmap", NULL, PRECISION_MICRO);
943 for (s16 z = nmin.Z; z <= nmax.Z; z++) {
944 for (s16 x = nmin.X; x <= nmax.X; x++, index++) {
945 s16 y = findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
947 // if the values found are out of range, trust the old heightmap
948 if (y == nmax.Y && heightmap[index] > nmax.Y)
950 if (y == nmin.Y - 1 && heightmap[index] < nmin.Y)
953 heightmap[index] = y;
956 //printf("updateHeightmap: %dus\n", t.stop());
960 void Mapgen::updateLiquid(UniqueQueue<v3s16> *trans_liquid, v3s16 nmin, v3s16 nmax) {
961 bool isliquid, wasliquid, rare;
962 v3s16 em = vm->m_area.getExtent();
963 rare = g_settings->getBool("liquid_finite");
966 for (s16 z = nmin.Z; z <= nmax.Z; z++) {
967 for (s16 x = nmin.X; x <= nmax.X; x++) {
970 u32 i = vm->m_area.index(x, nmax.Y, z);
971 for (s16 y = nmax.Y; y >= nmin.Y; y--) {
972 isliquid = ndef->get(vm->m_data[i]).isLiquid();
974 // there was a change between liquid and nonliquid, add to queue. no need to add every with liquid_finite
975 if (isliquid != wasliquid && (!rare || !(rarecnt++ % 36)))
976 trans_liquid->push_back(v3s16(x, y, z));
978 wasliquid = isliquid;
979 vm->m_area.add_y(em, i, -1);
986 void Mapgen::setLighting(v3s16 nmin, v3s16 nmax, u8 light) {
987 ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
988 VoxelArea a(nmin, nmax);
990 for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
991 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
992 u32 i = vm->m_area.index(a.MinEdge.X, y, z);
993 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++)
994 vm->m_data[i].param1 = light;
1000 void Mapgen::lightSpread(VoxelArea &a, v3s16 p, u8 light) {
1001 if (light <= 1 || !a.contains(p))
1004 u32 vi = vm->m_area.index(p);
1005 MapNode &nn = vm->m_data[vi];
1008 // should probably compare masked, but doesn't seem to make a difference
1009 if (light <= nn.param1 || !ndef->get(nn).light_propagates)
1014 lightSpread(a, p + v3s16(0, 0, 1), light);
1015 lightSpread(a, p + v3s16(0, 1, 0), light);
1016 lightSpread(a, p + v3s16(1, 0, 0), light);
1017 lightSpread(a, p - v3s16(0, 0, 1), light);
1018 lightSpread(a, p - v3s16(0, 1, 0), light);
1019 lightSpread(a, p - v3s16(1, 0, 0), light);
1023 void Mapgen::calcLighting(v3s16 nmin, v3s16 nmax) {
1024 VoxelArea a(nmin, nmax);
1025 bool block_is_underground = (water_level >= nmax.Y);
1027 ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
1028 //TimeTaker t("updateLighting");
1030 // first, send vertical rays of sunshine downward
1031 v3s16 em = vm->m_area.getExtent();
1032 for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
1033 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++) {
1034 // see if we can get a light value from the overtop
1035 u32 i = vm->m_area.index(x, a.MaxEdge.Y + 1, z);
1036 if (vm->m_data[i].getContent() == CONTENT_IGNORE) {
1037 if (block_is_underground)
1039 } else if ((vm->m_data[i].param1 & 0x0F) != LIGHT_SUN) {
1042 vm->m_area.add_y(em, i, -1);
1044 for (int y = a.MaxEdge.Y; y >= a.MinEdge.Y; y--) {
1045 MapNode &n = vm->m_data[i];
1046 if (!ndef->get(n).sunlight_propagates)
1048 n.param1 = LIGHT_SUN;
1049 vm->m_area.add_y(em, i, -1);
1054 // now spread the sunlight and light up any sources
1055 for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
1056 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
1057 u32 i = vm->m_area.index(a.MinEdge.X, y, z);
1058 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++) {
1059 MapNode &n = vm->m_data[i];
1060 if (n.getContent() == CONTENT_IGNORE ||
1061 !ndef->get(n).light_propagates)
1064 u8 light_produced = ndef->get(n).light_source & 0x0F;
1066 n.param1 = light_produced;
1068 u8 light = n.param1 & 0x0F;
1070 lightSpread(a, v3s16(x, y, z + 1), light - 1);
1071 lightSpread(a, v3s16(x, y + 1, z ), light - 1);
1072 lightSpread(a, v3s16(x + 1, y, z ), light - 1);
1073 lightSpread(a, v3s16(x, y, z - 1), light - 1);
1074 lightSpread(a, v3s16(x, y - 1, z ), light - 1);
1075 lightSpread(a, v3s16(x - 1, y, z ), light - 1);
1081 //printf("updateLighting: %dms\n", t.stop());
1085 void Mapgen::calcLightingOld(v3s16 nmin, v3s16 nmax) {
1086 enum LightBank banks[2] = {LIGHTBANK_DAY, LIGHTBANK_NIGHT};
1087 VoxelArea a(nmin, nmax);
1088 bool block_is_underground = (water_level > nmax.Y);
1089 bool sunlight = !block_is_underground;
1091 ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
1093 for (int i = 0; i < 2; i++) {
1094 enum LightBank bank = banks[i];
1095 std::set<v3s16> light_sources;
1096 std::map<v3s16, u8> unlight_from;
1098 voxalgo::clearLightAndCollectSources(*vm, a, bank, ndef,
1099 light_sources, unlight_from);
1100 voxalgo::propagateSunlight(*vm, a, sunlight, light_sources, ndef);
1102 vm->unspreadLight(bank, unlight_from, light_sources, ndef);
1103 vm->spreadLight(bank, light_sources, ndef);
1108 //////////////////////// Mapgen V6 parameter read/write
1110 bool MapgenV6Params::readParams(Settings *settings) {
1111 freq_desert = settings->getFloat("mgv6_freq_desert");
1112 freq_beach = settings->getFloat("mgv6_freq_beach");
1115 settings->getNoiseParams("mgv6_np_terrain_base", np_terrain_base) &&
1116 settings->getNoiseParams("mgv6_np_terrain_higher", np_terrain_higher) &&
1117 settings->getNoiseParams("mgv6_np_steepness", np_steepness) &&
1118 settings->getNoiseParams("mgv6_np_height_select", np_height_select) &&
1119 settings->getNoiseParams("mgv6_np_mud", np_mud) &&
1120 settings->getNoiseParams("mgv6_np_beach", np_beach) &&
1121 settings->getNoiseParams("mgv6_np_biome", np_biome) &&
1122 settings->getNoiseParams("mgv6_np_cave", np_cave) &&
1123 settings->getNoiseParams("mgv6_np_humidity", np_humidity) &&
1124 settings->getNoiseParams("mgv6_np_trees", np_trees) &&
1125 settings->getNoiseParams("mgv6_np_apple_trees", np_apple_trees);
1130 void MapgenV6Params::writeParams(Settings *settings) {
1131 settings->setFloat("mgv6_freq_desert", freq_desert);
1132 settings->setFloat("mgv6_freq_beach", freq_beach);
1134 settings->setNoiseParams("mgv6_np_terrain_base", np_terrain_base);
1135 settings->setNoiseParams("mgv6_np_terrain_higher", np_terrain_higher);
1136 settings->setNoiseParams("mgv6_np_steepness", np_steepness);
1137 settings->setNoiseParams("mgv6_np_height_select", np_height_select);
1138 settings->setNoiseParams("mgv6_np_mud", np_mud);
1139 settings->setNoiseParams("mgv6_np_beach", np_beach);
1140 settings->setNoiseParams("mgv6_np_biome", np_biome);
1141 settings->setNoiseParams("mgv6_np_cave", np_cave);
1142 settings->setNoiseParams("mgv6_np_humidity", np_humidity);
1143 settings->setNoiseParams("mgv6_np_trees", np_trees);
1144 settings->setNoiseParams("mgv6_np_apple_trees", np_apple_trees);
1148 bool MapgenV7Params::readParams(Settings *settings) {
1150 settings->getNoiseParams("mgv7_np_terrain_base", np_terrain_base) &&
1151 settings->getNoiseParams("mgv7_np_terrain_alt", np_terrain_alt) &&
1152 settings->getNoiseParams("mgv7_np_terrain_persist", np_terrain_persist) &&
1153 settings->getNoiseParams("mgv7_np_height_select", np_height_select) &&
1154 settings->getNoiseParams("mgv7_np_filler_depth", np_filler_depth) &&
1155 settings->getNoiseParams("mgv7_np_mount_height", np_mount_height) &&
1156 settings->getNoiseParams("mgv7_np_ridge_uwater", np_ridge_uwater) &&
1157 settings->getNoiseParams("mgv7_np_mountain", np_mountain) &&
1158 settings->getNoiseParams("mgv7_np_ridge", np_ridge);
1163 void MapgenV7Params::writeParams(Settings *settings) {
1164 settings->setNoiseParams("mgv7_np_terrain_base", np_terrain_base);
1165 settings->setNoiseParams("mgv7_np_terrain_alt", np_terrain_alt);
1166 settings->setNoiseParams("mgv7_np_terrain_persist", np_terrain_persist);
1167 settings->setNoiseParams("mgv7_np_height_select", np_height_select);
1168 settings->setNoiseParams("mgv7_np_filler_depth", np_filler_depth);
1169 settings->setNoiseParams("mgv7_np_mount_height", np_mount_height);
1170 settings->setNoiseParams("mgv7_np_ridge_uwater", np_ridge_uwater);
1171 settings->setNoiseParams("mgv7_np_mountain", np_mountain);
1172 settings->setNoiseParams("mgv7_np_ridge", np_ridge);