]> git.lizzy.rs Git - minetest.git/blob - src/mapgen.cpp
Add map feature generation notify Lua API
[minetest.git] / src / mapgen.cpp
1 /*
2 Minetest
3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
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 "mapgen.h"
21 #include "voxel.h"
22 #include "noise.h"
23 #include "biome.h"
24 #include "mapblock.h"
25 #include "mapnode.h"
26 #include "map.h"
27 //#include "serverobject.h"
28 #include "content_sao.h"
29 #include "nodedef.h"
30 #include "content_mapnode.h" // For content_mapnode_get_new_name
31 #include "voxelalgorithms.h"
32 #include "profiler.h"
33 #include "settings.h" // For g_settings
34 #include "main.h" // For g_profiler
35 #include "treegen.h"
36 #include "mapgen_v6.h"
37 #include "mapgen_v7.h"
38 #include "serialization.h"
39 #include "util/serialize.h"
40 #include "filesys.h"
41
42 FlagDesc flagdesc_mapgen[] = {
43         {"trees",          MG_TREES},
44         {"caves",          MG_CAVES},
45         {"dungeons",       MG_DUNGEONS},
46         {"v6_jungles",     MGV6_JUNGLES},
47         {"v6_biome_blend", MGV6_BIOME_BLEND},
48         {"flat",           MG_FLAT},
49         {"nolight",        MG_NOLIGHT},
50         {NULL,             0}
51 };
52
53 FlagDesc flagdesc_ore[] = {
54         {"absheight",            OREFLAG_ABSHEIGHT},
55         {"scatter_noisedensity", OREFLAG_DENSITY},
56         {"claylike_nodeisnt",    OREFLAG_NODEISNT},
57         {NULL,                   0}
58 };
59
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},
64         {NULL,             0}
65 };
66
67 FlagDesc flagdesc_gennotify[] = {
68         {"dungeon",          1 << GENNOTIFY_DUNGEON},
69         {"temple",           1 << GENNOTIFY_TEMPLE},
70         {"cave_begin",       1 << GENNOTIFY_CAVE_BEGIN},
71         {"cave_end",         1 << GENNOTIFY_CAVE_END},
72         {"large_cave_begin", 1 << GENNOTIFY_LARGECAVE_BEGIN},
73         {"large_cave_end",   1 << GENNOTIFY_LARGECAVE_END},
74         {NULL,               0}
75 };
76
77 ///////////////////////////////////////////////////////////////////////////////
78
79
80 Ore *createOre(OreType type) {
81         switch (type) {
82                 case ORE_SCATTER:
83                         return new OreScatter;
84                 case ORE_SHEET:
85                         return new OreSheet;
86                 //case ORE_CLAYLIKE: //TODO: implement this!
87                 //      return new OreClaylike;
88                 default:
89                         return NULL;
90         }
91 }
92
93
94 Ore::~Ore() {
95         delete np;
96         delete noise;
97 }
98
99
100 void Ore::resolveNodeNames(INodeDefManager *ndef) {
101         if (ore == CONTENT_IGNORE) {
102                 ore = ndef->getId(ore_name);
103                 if (ore == CONTENT_IGNORE) {
104                         errorstream << "Ore::resolveNodeNames: ore node '"
105                                 << ore_name << "' not defined";
106                         ore = CONTENT_AIR;
107                         wherein.push_back(CONTENT_AIR);
108                         return;
109                 }
110         }
111
112         for (size_t i=0; i != wherein_names.size(); i++) {
113                 std::string name = wherein_names[i];
114                 content_t c = ndef->getId(name);
115                 if (c != CONTENT_IGNORE) {
116                         wherein.push_back(c);
117                 }
118         }
119 }
120
121
122 void Ore::placeOre(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
123         int in_range = 0;
124
125         in_range |= (nmin.Y <= height_max && nmax.Y >= height_min);
126         if (flags & OREFLAG_ABSHEIGHT)
127                 in_range |= (nmin.Y >= -height_max && nmax.Y <= -height_min) << 1;
128         if (!in_range)
129                 return;
130
131         int ymin, ymax;
132         if (in_range & ORE_RANGE_MIRROR) {
133                 ymin = MYMAX(nmin.Y, -height_max);
134                 ymax = MYMIN(nmax.Y, -height_min);
135         } else {
136                 ymin = MYMAX(nmin.Y, height_min);
137                 ymax = MYMIN(nmax.Y, height_max);
138         }
139         if (clust_size >= ymax - ymin + 1)
140                 return;
141
142         nmin.Y = ymin;
143         nmax.Y = ymax;
144         generate(mg->vm, mg->seed, blockseed, nmin, nmax);
145 }
146
147
148 void OreScatter::generate(ManualMapVoxelManipulator *vm, int seed,
149                                                   u32 blockseed, v3s16 nmin, v3s16 nmax) {
150         PseudoRandom pr(blockseed);
151         MapNode n_ore(ore, 0, ore_param2);
152
153         int volume = (nmax.X - nmin.X + 1) *
154                                  (nmax.Y - nmin.Y + 1) *
155                                  (nmax.Z - nmin.Z + 1);
156         int csize     = clust_size;
157         int orechance = (csize * csize * csize) / clust_num_ores;
158         int nclusters = volume / clust_scarcity;
159
160         for (int i = 0; i != nclusters; i++) {
161                 int x0 = pr.range(nmin.X, nmax.X - csize + 1);
162                 int y0 = pr.range(nmin.Y, nmax.Y - csize + 1);
163                 int z0 = pr.range(nmin.Z, nmax.Z - csize + 1);
164
165                 if (np && (NoisePerlin3D(np, x0, y0, z0, seed) < nthresh))
166                         continue;
167
168                 for (int z1 = 0; z1 != csize; z1++)
169                 for (int y1 = 0; y1 != csize; y1++)
170                 for (int x1 = 0; x1 != csize; x1++) {
171                         if (pr.range(1, orechance) != 1)
172                                 continue;
173
174                         u32 i = vm->m_area.index(x0 + x1, y0 + y1, z0 + z1);
175                         for (size_t ii = 0; ii < wherein.size(); ii++)
176                                 if (vm->m_data[i].getContent() == wherein[ii])
177                                         vm->m_data[i] = n_ore;
178                 }
179         }
180 }
181
182
183 void OreSheet::generate(ManualMapVoxelManipulator *vm, int seed,
184                                                 u32 blockseed, v3s16 nmin, v3s16 nmax) {
185         PseudoRandom pr(blockseed + 4234);
186         MapNode n_ore(ore, 0, ore_param2);
187
188         int max_height = clust_size;
189         int y_start = pr.range(nmin.Y, nmax.Y - max_height);
190
191         if (!noise) {
192                 int sx = nmax.X - nmin.X + 1;
193                 int sz = nmax.Z - nmin.Z + 1;
194                 noise = new Noise(np, 0, sx, sz);
195         }
196         noise->seed = seed + y_start;
197         noise->perlinMap2D(nmin.X, nmin.Z);
198
199         int index = 0;
200         for (int z = nmin.Z; z <= nmax.Z; z++)
201         for (int x = nmin.X; x <= nmax.X; x++) {
202                 float noiseval = noise->result[index++];
203                 if (noiseval < nthresh)
204                         continue;
205
206                 int height = max_height * (1. / pr.range(1, 3));
207                 int y0 = y_start + np->scale * noiseval; //pr.range(1, 3) - 1;
208                 int y1 = y0 + height;
209                 for (int y = y0; y != y1; y++) {
210                         u32 i = vm->m_area.index(x, y, z);
211                         if (!vm->m_area.contains(i))
212                                 continue;
213
214                         for (size_t ii = 0; ii < wherein.size(); ii++)
215                                 if (vm->m_data[i].getContent() == wherein[ii])
216                                         vm->m_data[i] = n_ore;
217                 }
218         }
219 }
220
221
222 ///////////////////////////////////////////////////////////////////////////////
223
224
225 Decoration *createDecoration(DecorationType type) {
226         switch (type) {
227                 case DECO_SIMPLE:
228                         return new DecoSimple;
229                 case DECO_SCHEMATIC:
230                         return new DecoSchematic;
231                 //case DECO_LSYSTEM:
232                 //      return new DecoLSystem;
233                 default:
234                         return NULL;
235         }
236 }
237
238
239 Decoration::Decoration() {
240         mapseed    = 0;
241         np         = NULL;
242         fill_ratio = 0;
243         sidelen    = 1;
244 }
245
246
247 Decoration::~Decoration() {
248         delete np;
249 }
250
251
252 void Decoration::resolveNodeNames(INodeDefManager *ndef) {
253         this->ndef = ndef;
254
255         if (c_place_on == CONTENT_IGNORE)
256                 c_place_on = ndef->getId(place_on_name);
257 }
258
259
260 void Decoration::placeDeco(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
261         PseudoRandom ps(blockseed + 53);
262         int carea_size = nmax.X - nmin.X + 1;
263
264         // Divide area into parts
265         if (carea_size % sidelen) {
266                 errorstream << "Decoration::placeDeco: chunk size is not divisible by "
267                         "sidelen; setting sidelen to " << carea_size << std::endl;
268                 sidelen = carea_size;
269         }
270
271         s16 divlen = carea_size / sidelen;
272         int area = sidelen * sidelen;
273
274         for (s16 z0 = 0; z0 < divlen; z0++)
275         for (s16 x0 = 0; x0 < divlen; x0++) {
276                 v2s16 p2d_center( // Center position of part of division
277                         nmin.X + sidelen / 2 + sidelen * x0,
278                         nmin.Z + sidelen / 2 + sidelen * z0
279                 );
280                 v2s16 p2d_min( // Minimum edge of part of division
281                         nmin.X + sidelen * x0,
282                         nmin.Z + sidelen * z0
283                 );
284                 v2s16 p2d_max( // Maximum edge of part of division
285                         nmin.X + sidelen + sidelen * x0 - 1,
286                         nmin.Z + sidelen + sidelen * z0 - 1
287                 );
288
289                 // Amount of decorations
290                 float nval = np ?
291                         NoisePerlin2D(np, p2d_center.X, p2d_center.Y, mapseed) :
292                         fill_ratio;
293                 u32 deco_count = area * MYMAX(nval, 0.f);
294
295                 for (u32 i = 0; i < deco_count; i++) {
296                         s16 x = ps.range(p2d_min.X, p2d_max.X);
297                         s16 z = ps.range(p2d_min.Y, p2d_max.Y);
298
299                         int mapindex = carea_size * (z - nmin.Z) + (x - nmin.X);
300
301                         s16 y = mg->heightmap ?
302                                         mg->heightmap[mapindex] :
303                                         mg->findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
304
305                         if (y < nmin.Y || y > nmax.Y)
306                                 continue;
307
308                         int height = getHeight();
309                         int max_y = nmax.Y;// + MAP_BLOCKSIZE - 1;
310                         if (y + 1 + height > max_y) {
311                                 continue;
312 #if 0
313                                 printf("Decoration at (%d %d %d) cut off\n", x, y, z);
314                                 //add to queue
315                                 JMutexAutoLock cutofflock(cutoff_mutex);
316                                 cutoffs.push_back(CutoffData(x, y, z, height));
317 #endif
318                         }
319
320                         if (mg->biomemap) {
321                                 std::set<u8>::iterator iter;
322
323                                 if (biomes.size()) {
324                                         iter = biomes.find(mg->biomemap[mapindex]);
325                                         if (iter == biomes.end())
326                                                 continue;
327                                 }
328                         }
329
330                         generate(mg, &ps, max_y, v3s16(x, y, z));
331                 }
332         }
333 }
334
335
336 #if 0
337 void Decoration::placeCutoffs(Mapgen *mg, u32 blockseed, v3s16 nmin, v3s16 nmax) {
338         PseudoRandom pr(blockseed + 53);
339         std::vector<CutoffData> handled_cutoffs;
340
341         // Copy over the cutoffs we're interested in so we don't needlessly hold a lock
342         {
343                 JMutexAutoLock cutofflock(cutoff_mutex);
344                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
345                         i != cutoffs.end(); ++i) {
346                         CutoffData cutoff = *i;
347                         v3s16 p    = cutoff.p;
348                         s16 height = cutoff.height;
349                         if (p.X < nmin.X || p.X > nmax.X ||
350                                 p.Z < nmin.Z || p.Z > nmax.Z)
351                                 continue;
352                         if (p.Y + height < nmin.Y || p.Y > nmax.Y)
353                                 continue;
354
355                         handled_cutoffs.push_back(cutoff);
356                 }
357         }
358
359         // Generate the cutoffs
360         for (size_t i = 0; i != handled_cutoffs.size(); i++) {
361                 v3s16 p    = handled_cutoffs[i].p;
362                 s16 height = handled_cutoffs[i].height;
363
364                 if (p.Y + height > nmax.Y) {
365                         //printf("Decoration at (%d %d %d) cut off again!\n", p.X, p.Y, p.Z);
366                         cuttoffs.push_back(v3s16(p.X, p.Y, p.Z));
367                 }
368
369                 generate(mg, &pr, nmax.Y, nmin.Y - p.Y, v3s16(p.X, nmin.Y, p.Z));
370         }
371
372         // Remove cutoffs that were handled from the cutoff list
373         {
374                 JMutexAutoLock cutofflock(cutoff_mutex);
375                 for (std::list<CutoffData>::iterator i = cutoffs.begin();
376                         i != cutoffs.end(); ++i) {
377
378                         for (size_t j = 0; j != handled_cutoffs.size(); j++) {
379                                 CutoffData coff = *i;
380                                 if (coff.p == handled_cutoffs[j].p)
381                                         i = cutoffs.erase(i);
382                         }
383                 }
384         }
385 }
386 #endif
387
388
389 ///////////////////////////////////////////////////////////////////////////////
390
391
392 void DecoSimple::resolveNodeNames(INodeDefManager *ndef) {
393         Decoration::resolveNodeNames(ndef);
394
395         if (c_deco == CONTENT_IGNORE && !decolist_names.size()) {
396                 c_deco = ndef->getId(deco_name);
397                 if (c_deco == CONTENT_IGNORE) {
398                         errorstream << "DecoSimple::resolveNodeNames: decoration node '"
399                                 << deco_name << "' not defined" << std::endl;
400                         c_deco = CONTENT_AIR;
401                 }
402         }
403         if (c_spawnby == CONTENT_IGNORE) {
404                 c_spawnby = ndef->getId(spawnby_name);
405                 if (c_spawnby == CONTENT_IGNORE) {
406                         errorstream << "DecoSimple::resolveNodeNames: spawnby node '"
407                                 << spawnby_name << "' not defined" << std::endl;
408                         nspawnby = -1;
409                         c_spawnby = CONTENT_AIR;
410                 }
411         }
412
413         if (c_decolist.size())
414                 return;
415
416         for (size_t i = 0; i != decolist_names.size(); i++) {
417                 content_t c = ndef->getId(decolist_names[i]);
418                 if (c == CONTENT_IGNORE) {
419                         errorstream << "DecoSimple::resolveNodeNames: decolist node '"
420                                 << decolist_names[i] << "' not defined" << std::endl;
421                         c = CONTENT_AIR;
422                 }
423                 c_decolist.push_back(c);
424         }
425 }
426
427
428 void DecoSimple::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
429         ManualMapVoxelManipulator *vm = mg->vm;
430
431         u32 vi = vm->m_area.index(p);
432         if (vm->m_data[vi].getContent() != c_place_on &&
433                 c_place_on != CONTENT_IGNORE)
434                 return;
435
436         if (nspawnby != -1) {
437                 int nneighs = 0;
438                 v3s16 dirs[8] = { // a Moore neighborhood
439                         v3s16( 0, 0,  1),
440                         v3s16( 0, 0, -1),
441                         v3s16( 1, 0,  0),
442                         v3s16(-1, 0,  0),
443                         v3s16( 1, 0,  1),
444                         v3s16(-1, 0,  1),
445                         v3s16(-1, 0, -1),
446                         v3s16( 1, 0, -1)
447                 };
448
449                 for (int i = 0; i != 8; i++) {
450                         u32 index = vm->m_area.index(p + dirs[i]);
451                         if (vm->m_area.contains(index) &&
452                                 vm->m_data[index].getContent() == c_spawnby)
453                                 nneighs++;
454                 }
455
456                 if (nneighs < nspawnby)
457                         return;
458         }
459
460         size_t ndecos = c_decolist.size();
461         content_t c_place = ndecos ? c_decolist[pr->range(0, ndecos - 1)] : c_deco;
462
463         s16 height = (deco_height_max > 0) ?
464                 pr->range(deco_height, deco_height_max) : deco_height;
465
466         height = MYMIN(height, max_y - p.Y);
467
468         v3s16 em = vm->m_area.getExtent();
469         for (int i = 0; i < height; i++) {
470                 vm->m_area.add_y(em, vi, 1);
471
472                 content_t c = vm->m_data[vi].getContent();
473                 if (c != CONTENT_AIR && c != CONTENT_IGNORE)
474                         break;
475
476                 vm->m_data[vi] = MapNode(c_place);
477         }
478 }
479
480
481 int DecoSimple::getHeight() {
482         return (deco_height_max > 0) ? deco_height_max : deco_height;
483 }
484
485
486 std::string DecoSimple::getName() {
487         return deco_name;
488 }
489
490
491 ///////////////////////////////////////////////////////////////////////////////
492
493
494 DecoSchematic::DecoSchematic() {
495         node_names  = NULL;
496         schematic   = NULL;
497         slice_probs = NULL;
498         flags       = 0;
499         size        = v3s16(0, 0, 0);
500 }
501
502
503 DecoSchematic::~DecoSchematic() {
504         delete node_names;
505         delete []schematic;
506         delete []slice_probs;
507 }
508
509
510 void DecoSchematic::resolveNodeNames(INodeDefManager *ndef) {
511         Decoration::resolveNodeNames(ndef);
512
513         if (filename.empty())
514                 return;
515
516         if (!node_names) {
517                 errorstream << "DecoSchematic::resolveNodeNames: node name list was "
518                         "not created" << std::endl;
519                 return;
520         }
521
522         for (size_t i = 0; i != node_names->size(); i++) {
523                 std::string name = node_names->at(i);
524
525                 std::map<std::string, std::string>::iterator it;
526                 it = replacements.find(name);
527                 if (it != replacements.end())
528                         name = it->second;
529
530                 content_t c = ndef->getId(name);
531                 if (c == CONTENT_IGNORE) {
532                         errorstream << "DecoSchematic::resolveNodeNames: node '"
533                                 << name << "' not defined" << std::endl;
534                         c = CONTENT_AIR;
535                 }
536
537                 c_nodes.push_back(c);
538         }
539
540         for (int i = 0; i != size.X * size.Y * size.Z; i++)
541                 schematic[i].setContent(c_nodes[schematic[i].getContent()]);
542
543         delete node_names;
544         node_names = NULL;
545 }
546
547
548 void DecoSchematic::generate(Mapgen *mg, PseudoRandom *pr, s16 max_y, v3s16 p) {
549         ManualMapVoxelManipulator *vm = mg->vm;
550
551         if (flags & DECO_PLACE_CENTER_X)
552                 p.X -= (size.X + 1) / 2;
553         if (flags & DECO_PLACE_CENTER_Y)
554                 p.Y -= (size.Y + 1) / 2;
555         if (flags & DECO_PLACE_CENTER_Z)
556                 p.Z -= (size.Z + 1) / 2;
557
558         u32 vi = vm->m_area.index(p);
559         if (vm->m_data[vi].getContent() != c_place_on &&
560                 c_place_on != CONTENT_IGNORE)
561                 return;
562
563         Rotation rot = (rotation == ROTATE_RAND) ?
564                 (Rotation)pr->range(ROTATE_0, ROTATE_270) : rotation;
565
566         blitToVManip(p, vm, rot, false);
567 }
568
569
570 int DecoSchematic::getHeight() {
571         return size.Y;
572 }
573
574
575 std::string DecoSchematic::getName() {
576         return filename;
577 }
578
579
580 void DecoSchematic::blitToVManip(v3s16 p, ManualMapVoxelManipulator *vm,
581                                                                 Rotation rot, bool force_placement) {
582         int xstride = 1;
583         int ystride = size.X;
584         int zstride = size.X * size.Y;
585
586         s16 sx = size.X;
587         s16 sy = size.Y;
588         s16 sz = size.Z;
589
590         int i_start, i_step_x, i_step_z;
591         switch (rot) {
592                 case ROTATE_90:
593                         i_start  = sx - 1;
594                         i_step_x = zstride;
595                         i_step_z = -xstride;
596                         SWAP(s16, sx, sz);
597                         break;
598                 case ROTATE_180:
599                         i_start  = zstride * (sz - 1) + sx - 1;
600                         i_step_x = -xstride;
601                         i_step_z = -zstride;
602                         break;
603                 case ROTATE_270:
604                         i_start  = zstride * (sz - 1);
605                         i_step_x = -zstride;
606                         i_step_z = xstride;
607                         SWAP(s16, sx, sz);
608                         break;
609                 default:
610                         i_start  = 0;
611                         i_step_x = xstride;
612                         i_step_z = zstride;
613         }
614
615         s16 y_map = p.Y;
616         for (s16 y = 0; y != sy; y++) {
617                 if (slice_probs[y] != MTSCHEM_PROB_ALWAYS &&
618                         myrand_range(1, 255) > slice_probs[y])
619                         continue;
620
621                 for (s16 z = 0; z != sz; z++) {
622                         u32 i = z * i_step_z + y * ystride + i_start;
623                         for (s16 x = 0; x != sx; x++, i += i_step_x) {
624                                 u32 vi = vm->m_area.index(p.X + x, y_map, p.Z + z);
625                                 if (!vm->m_area.contains(vi))
626                                         continue;
627
628                                 if (schematic[i].getContent() == CONTENT_IGNORE)
629                                         continue;
630
631                                 if (schematic[i].param1 == MTSCHEM_PROB_NEVER)
632                                         continue;
633
634                                 if (!force_placement) {
635                                         content_t c = vm->m_data[vi].getContent();
636                                         if (c != CONTENT_AIR && c != CONTENT_IGNORE)
637                                                 continue;
638                                 }
639
640                                 if (schematic[i].param1 != MTSCHEM_PROB_ALWAYS &&
641                                         myrand_range(1, 255) > schematic[i].param1)
642                                         continue;
643
644                                 vm->m_data[vi] = schematic[i];
645                                 vm->m_data[vi].param1 = 0;
646
647                                 if (rot)
648                                         vm->m_data[vi].rotateAlongYAxis(ndef, rot);
649                         }
650                 }
651                 y_map++;
652         }
653 }
654
655
656 void DecoSchematic::placeStructure(Map *map, v3s16 p) {
657         assert(schematic != NULL);
658         ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
659
660         Rotation rot = (rotation == ROTATE_RAND) ?
661                 (Rotation)myrand_range(ROTATE_0, ROTATE_270) : rotation;
662
663         v3s16 s = (rot == ROTATE_90 || rot == ROTATE_270) ?
664                                 v3s16(size.Z, size.Y, size.X) : size;
665
666         if (flags & DECO_PLACE_CENTER_X)
667                 p.X -= (s.X + 1) / 2;
668         if (flags & DECO_PLACE_CENTER_Y)
669                 p.Y -= (s.Y + 1) / 2;
670         if (flags & DECO_PLACE_CENTER_Z)
671                 p.Z -= (s.Z + 1) / 2;
672
673         v3s16 bp1 = getNodeBlockPos(p);
674         v3s16 bp2 = getNodeBlockPos(p + s - v3s16(1,1,1));
675         vm->initialEmerge(bp1, bp2);
676
677         blitToVManip(p, vm, rot, true);
678
679         std::map<v3s16, MapBlock *> lighting_modified_blocks;
680         std::map<v3s16, MapBlock *> modified_blocks;
681         vm->blitBackAll(&modified_blocks);
682
683         // TODO: Optimize this by using Mapgen::calcLighting() instead
684         lighting_modified_blocks.insert(modified_blocks.begin(), modified_blocks.end());
685         map->updateLighting(lighting_modified_blocks, modified_blocks);
686
687         MapEditEvent event;
688         event.type = MEET_OTHER;
689         for (std::map<v3s16, MapBlock *>::iterator
690                 it = modified_blocks.begin();
691                 it != modified_blocks.end(); ++it)
692                 event.modified_blocks.insert(it->first);
693
694         map->dispatchEvent(&event);
695 }
696
697
698 bool DecoSchematic::loadSchematicFile() {
699         content_t cignore = CONTENT_IGNORE;
700         bool have_cignore = false;
701
702         std::ifstream is(filename.c_str(), std::ios_base::binary);
703
704         u32 signature = readU32(is);
705         if (signature != MTSCHEM_FILE_SIGNATURE) {
706                 errorstream << "loadSchematicFile: invalid schematic "
707                         "file" << std::endl;
708                 return false;
709         }
710
711         u16 version = readU16(is);
712         if (version > MTSCHEM_FILE_VER_HIGHEST_READ) {
713                 errorstream << "loadSchematicFile: unsupported schematic "
714                         "file version" << std::endl;
715                 return false;
716         }
717
718         size = readV3S16(is);
719
720         delete []slice_probs;
721         slice_probs = new u8[size.Y];
722         if (version >= 3) {
723                 for (int y = 0; y != size.Y; y++)
724                         slice_probs[y] = readU8(is);
725         } else {
726                 for (int y = 0; y != size.Y; y++)
727                         slice_probs[y] = MTSCHEM_PROB_ALWAYS;
728         }
729
730         int nodecount = size.X * size.Y * size.Z;
731
732         u16 nidmapcount = readU16(is);
733
734         node_names = new std::vector<std::string>;
735         for (int i = 0; i != nidmapcount; i++) {
736                 std::string name = deSerializeString(is);
737                 if (name == "ignore") {
738                         name = "air";
739                         cignore = i;
740                         have_cignore = true;
741                 }
742                 node_names->push_back(name);
743         }
744
745         delete []schematic;
746         schematic = new MapNode[nodecount];
747         MapNode::deSerializeBulk(is, SER_FMT_VER_HIGHEST_READ, schematic,
748                                 nodecount, 2, 2, true);
749
750         if (version == 1) { // fix up the probability values
751                 for (int i = 0; i != nodecount; i++) {
752                         if (schematic[i].param1 == 0)
753                                 schematic[i].param1 = MTSCHEM_PROB_ALWAYS;
754                         if (have_cignore && schematic[i].getContent() == cignore)
755                                 schematic[i].param1 = MTSCHEM_PROB_NEVER;
756                 }
757         }
758
759         return true;
760 }
761
762
763 /*
764         Minetest Schematic File Format
765
766         All values are stored in big-endian byte order.
767         [u32] signature: 'MTSM'
768         [u16] version: 3
769         [u16] size X
770         [u16] size Y
771         [u16] size Z
772         For each Y:
773                 [u8] slice probability value
774         [Name-ID table] Name ID Mapping Table
775                 [u16] name-id count
776                 For each name-id mapping:
777                         [u16] name length
778                         [u8[]] name
779         ZLib deflated {
780         For each node in schematic:  (for z, y, x)
781                 [u16] content
782         For each node in schematic:
783                 [u8] probability of occurance (param1)
784         For each node in schematic:
785                 [u8] param2
786         }
787
788         Version changes:
789         1 - Initial version
790         2 - Fixed messy never/always place; 0 probability is now never, 0xFF is always
791 */
792 void DecoSchematic::saveSchematicFile(INodeDefManager *ndef) {
793         std::ostringstream ss(std::ios_base::binary);
794
795         writeU32(ss, MTSCHEM_FILE_SIGNATURE);         // signature
796         writeU16(ss, MTSCHEM_FILE_VER_HIGHEST_WRITE); // version
797         writeV3S16(ss, size);                         // schematic size
798
799         for (int y = 0; y != size.Y; y++)             // Y slice probabilities
800                 writeU8(ss, slice_probs[y]);
801
802         std::vector<content_t> usednodes;
803         int nodecount = size.X * size.Y * size.Z;
804         build_nnlist_and_update_ids(schematic, nodecount, &usednodes);
805
806         u16 numids = usednodes.size();
807         writeU16(ss, numids); // name count
808         for (int i = 0; i != numids; i++)
809                 ss << serializeString(ndef->get(usednodes[i]).name); // node names
810
811         // compressed bulk node data
812         MapNode::serializeBulk(ss, SER_FMT_VER_HIGHEST_WRITE, schematic,
813                                 nodecount, 2, 2, true);
814
815         fs::safeWriteToFile(filename, ss.str());
816 }
817
818
819 void build_nnlist_and_update_ids(MapNode *nodes, u32 nodecount,
820                                                 std::vector<content_t> *usednodes) {
821         std::map<content_t, content_t> nodeidmap;
822         content_t numids = 0;
823
824         for (u32 i = 0; i != nodecount; i++) {
825                 content_t id;
826                 content_t c = nodes[i].getContent();
827
828                 std::map<content_t, content_t>::const_iterator it = nodeidmap.find(c);
829                 if (it == nodeidmap.end()) {
830                         id = numids;
831                         numids++;
832
833                         usednodes->push_back(c);
834                         nodeidmap.insert(std::make_pair(c, id));
835                 } else {
836                         id = it->second;
837                 }
838                 nodes[i].setContent(id);
839         }
840 }
841
842
843 bool DecoSchematic::getSchematicFromMap(Map *map, v3s16 p1, v3s16 p2) {
844         ManualMapVoxelManipulator *vm = new ManualMapVoxelManipulator(map);
845
846         v3s16 bp1 = getNodeBlockPos(p1);
847         v3s16 bp2 = getNodeBlockPos(p2);
848         vm->initialEmerge(bp1, bp2);
849
850         size = p2 - p1 + 1;
851
852         slice_probs = new u8[size.Y];
853         for (s16 y = 0; y != size.Y; y++)
854                 slice_probs[y] = MTSCHEM_PROB_ALWAYS;
855
856         schematic = new MapNode[size.X * size.Y * size.Z];
857
858         u32 i = 0;
859         for (s16 z = p1.Z; z <= p2.Z; z++)
860         for (s16 y = p1.Y; y <= p2.Y; y++) {
861                 u32 vi = vm->m_area.index(p1.X, y, z);
862                 for (s16 x = p1.X; x <= p2.X; x++, i++, vi++) {
863                         schematic[i] = vm->m_data[vi];
864                         schematic[i].param1 = MTSCHEM_PROB_ALWAYS;
865                 }
866         }
867
868         delete vm;
869         return true;
870 }
871
872
873 void DecoSchematic::applyProbabilities(v3s16 p0,
874         std::vector<std::pair<v3s16, u8> > *plist,
875         std::vector<std::pair<s16, u8> > *splist) {
876
877         for (size_t i = 0; i != plist->size(); i++) {
878                 v3s16 p = (*plist)[i].first - p0;
879                 int index = p.Z * (size.Y * size.X) + p.Y * size.X + p.X;
880                 if (index < size.Z * size.Y * size.X) {
881                         u8 prob = (*plist)[i].second;
882                         schematic[index].param1 = prob;
883
884                         // trim unnecessary node names from schematic
885                         if (prob == MTSCHEM_PROB_NEVER)
886                                 schematic[index].setContent(CONTENT_AIR);
887                 }
888         }
889
890         for (size_t i = 0; i != splist->size(); i++) {
891                 s16 y = (*splist)[i].first - p0.Y;
892                 slice_probs[y] = (*splist)[i].second;
893         }
894 }
895
896
897 ///////////////////////////////////////////////////////////////////////////////
898
899
900 Mapgen::Mapgen() {
901         seed        = 0;
902         water_level = 0;
903         generating  = false;
904         id          = -1;
905         vm          = NULL;
906         ndef        = NULL;
907         heightmap   = NULL;
908         biomemap    = NULL;
909
910         for (unsigned int i = 0; i != NUM_GEN_NOTIFY; i++)
911                 gen_notifications[i] = new std::vector<v3s16>;
912 }
913
914
915 Mapgen::~Mapgen() {
916         for (unsigned int i = 0; i != NUM_GEN_NOTIFY; i++)
917                 delete gen_notifications[i];
918 }
919
920
921 // Returns Y one under area minimum if not found
922 s16 Mapgen::findGroundLevelFull(v2s16 p2d) {
923         v3s16 em = vm->m_area.getExtent();
924         s16 y_nodes_max = vm->m_area.MaxEdge.Y;
925         s16 y_nodes_min = vm->m_area.MinEdge.Y;
926         u32 i = vm->m_area.index(p2d.X, y_nodes_max, p2d.Y);
927         s16 y;
928
929         for (y = y_nodes_max; y >= y_nodes_min; y--) {
930                 MapNode &n = vm->m_data[i];
931                 if (ndef->get(n).walkable)
932                         break;
933
934                 vm->m_area.add_y(em, i, -1);
935         }
936         return (y >= y_nodes_min) ? y : y_nodes_min - 1;
937 }
938
939
940 s16 Mapgen::findGroundLevel(v2s16 p2d, s16 ymin, s16 ymax) {
941         v3s16 em = vm->m_area.getExtent();
942         u32 i = vm->m_area.index(p2d.X, ymax, p2d.Y);
943         s16 y;
944
945         for (y = ymax; y >= ymin; y--) {
946                 MapNode &n = vm->m_data[i];
947                 if (ndef->get(n).walkable)
948                         break;
949
950                 vm->m_area.add_y(em, i, -1);
951         }
952         return y;
953 }
954
955
956 void Mapgen::updateHeightmap(v3s16 nmin, v3s16 nmax) {
957         if (!heightmap)
958                 return;
959
960         //TimeTaker t("Mapgen::updateHeightmap", NULL, PRECISION_MICRO);
961         int index = 0;
962         for (s16 z = nmin.Z; z <= nmax.Z; z++) {
963                 for (s16 x = nmin.X; x <= nmax.X; x++, index++) {
964                         s16 y = findGroundLevel(v2s16(x, z), nmin.Y, nmax.Y);
965
966                         // if the values found are out of range, trust the old heightmap
967                         if (y == nmax.Y && heightmap[index] > nmax.Y)
968                                 continue;
969                         if (y == nmin.Y - 1 && heightmap[index] < nmin.Y)
970                                 continue;
971
972                         heightmap[index] = y;
973                 }
974         }
975         //printf("updateHeightmap: %dus\n", t.stop());
976 }
977
978
979 void Mapgen::updateLiquid(UniqueQueue<v3s16> *trans_liquid, v3s16 nmin, v3s16 nmax) {
980         bool isliquid, wasliquid, rare;
981         v3s16 em  = vm->m_area.getExtent();
982         rare = g_settings->getBool("liquid_finite");
983         int rarecnt = 0;
984
985         for (s16 z = nmin.Z; z <= nmax.Z; z++) {
986                 for (s16 x = nmin.X; x <= nmax.X; x++) {
987                         wasliquid = true;
988
989                         u32 i = vm->m_area.index(x, nmax.Y, z);
990                         for (s16 y = nmax.Y; y >= nmin.Y; y--) {
991                                 isliquid = ndef->get(vm->m_data[i]).isLiquid();
992
993                                 // there was a change between liquid and nonliquid, add to queue. no need to add every with liquid_finite
994                                 if (isliquid != wasliquid && (!rare || !(rarecnt++ % 36)))
995                                         trans_liquid->push_back(v3s16(x, y, z));
996
997                                 wasliquid = isliquid;
998                                 vm->m_area.add_y(em, i, -1);
999                         }
1000                 }
1001         }
1002 }
1003
1004
1005 void Mapgen::setLighting(v3s16 nmin, v3s16 nmax, u8 light) {
1006         ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
1007         VoxelArea a(nmin, nmax);
1008
1009         for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
1010                 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
1011                         u32 i = vm->m_area.index(a.MinEdge.X, y, z);
1012                         for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++)
1013                                 vm->m_data[i].param1 = light;
1014                 }
1015         }
1016 }
1017
1018
1019 void Mapgen::lightSpread(VoxelArea &a, v3s16 p, u8 light) {
1020         if (light <= 1 || !a.contains(p))
1021                 return;
1022
1023         u32 vi = vm->m_area.index(p);
1024         MapNode &nn = vm->m_data[vi];
1025
1026         light--;
1027         // should probably compare masked, but doesn't seem to make a difference
1028         if (light <= nn.param1 || !ndef->get(nn).light_propagates)
1029                 return;
1030
1031         nn.param1 = light;
1032
1033         lightSpread(a, p + v3s16(0, 0, 1), light);
1034         lightSpread(a, p + v3s16(0, 1, 0), light);
1035         lightSpread(a, p + v3s16(1, 0, 0), light);
1036         lightSpread(a, p - v3s16(0, 0, 1), light);
1037         lightSpread(a, p - v3s16(0, 1, 0), light);
1038         lightSpread(a, p - v3s16(1, 0, 0), light);
1039 }
1040
1041
1042 void Mapgen::calcLighting(v3s16 nmin, v3s16 nmax) {
1043         VoxelArea a(nmin, nmax);
1044         bool block_is_underground = (water_level >= nmax.Y);
1045
1046         ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
1047         //TimeTaker t("updateLighting");
1048
1049         // first, send vertical rays of sunshine downward
1050         v3s16 em = vm->m_area.getExtent();
1051         for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
1052                 for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++) {
1053                         // see if we can get a light value from the overtop
1054                         u32 i = vm->m_area.index(x, a.MaxEdge.Y + 1, z);
1055                         if (vm->m_data[i].getContent() == CONTENT_IGNORE) {
1056                                 if (block_is_underground)
1057                                         continue;
1058                         } else if ((vm->m_data[i].param1 & 0x0F) != LIGHT_SUN) {
1059                                 continue;
1060                         }
1061                         vm->m_area.add_y(em, i, -1);
1062
1063                         for (int y = a.MaxEdge.Y; y >= a.MinEdge.Y; y--) {
1064                                 MapNode &n = vm->m_data[i];
1065                                 if (!ndef->get(n).sunlight_propagates)
1066                                         break;
1067                                 n.param1 = LIGHT_SUN;
1068                                 vm->m_area.add_y(em, i, -1);
1069                         }
1070                 }
1071         }
1072
1073         // now spread the sunlight and light up any sources
1074         for (int z = a.MinEdge.Z; z <= a.MaxEdge.Z; z++) {
1075                 for (int y = a.MinEdge.Y; y <= a.MaxEdge.Y; y++) {
1076                         u32 i = vm->m_area.index(a.MinEdge.X, y, z);
1077                         for (int x = a.MinEdge.X; x <= a.MaxEdge.X; x++, i++) {
1078                                 MapNode &n = vm->m_data[i];
1079                                 if (n.getContent() == CONTENT_IGNORE ||
1080                                         !ndef->get(n).light_propagates)
1081                                         continue;
1082
1083                                 u8 light_produced = ndef->get(n).light_source & 0x0F;
1084                                 if (light_produced)
1085                                         n.param1 = light_produced;
1086
1087                                 u8 light = n.param1 & 0x0F;
1088                                 if (light) {
1089                                         lightSpread(a, v3s16(x,     y,     z + 1), light - 1);
1090                                         lightSpread(a, v3s16(x,     y + 1, z    ), light - 1);
1091                                         lightSpread(a, v3s16(x + 1, y,     z    ), light - 1);
1092                                         lightSpread(a, v3s16(x,     y,     z - 1), light - 1);
1093                                         lightSpread(a, v3s16(x,     y - 1, z    ), light - 1);
1094                                         lightSpread(a, v3s16(x - 1, y,     z    ), light - 1);
1095                                 }
1096                         }
1097                 }
1098         }
1099
1100         //printf("updateLighting: %dms\n", t.stop());
1101 }
1102
1103
1104 void Mapgen::calcLightingOld(v3s16 nmin, v3s16 nmax) {
1105         enum LightBank banks[2] = {LIGHTBANK_DAY, LIGHTBANK_NIGHT};
1106         VoxelArea a(nmin, nmax);
1107         bool block_is_underground = (water_level > nmax.Y);
1108         bool sunlight = !block_is_underground;
1109
1110         ScopeProfiler sp(g_profiler, "EmergeThread: mapgen lighting update", SPT_AVG);
1111
1112         for (int i = 0; i < 2; i++) {
1113                 enum LightBank bank = banks[i];
1114                 std::set<v3s16> light_sources;
1115                 std::map<v3s16, u8> unlight_from;
1116
1117                 voxalgo::clearLightAndCollectSources(*vm, a, bank, ndef,
1118                                                                                          light_sources, unlight_from);
1119                 voxalgo::propagateSunlight(*vm, a, sunlight, light_sources, ndef);
1120
1121                 vm->unspreadLight(bank, unlight_from, light_sources, ndef);
1122                 vm->spreadLight(bank, light_sources, ndef);
1123         }
1124 }
1125
1126
1127 //////////////////////// Mapgen V6 parameter read/write
1128
1129 bool MapgenV6Params::readParams(Settings *settings) {
1130         freq_desert = settings->getFloat("mgv6_freq_desert");
1131         freq_beach  = settings->getFloat("mgv6_freq_beach");
1132
1133         bool success =
1134                 settings->getNoiseParams("mgv6_np_terrain_base",   np_terrain_base)   &&
1135                 settings->getNoiseParams("mgv6_np_terrain_higher", np_terrain_higher) &&
1136                 settings->getNoiseParams("mgv6_np_steepness",      np_steepness)      &&
1137                 settings->getNoiseParams("mgv6_np_height_select",  np_height_select)  &&
1138                 settings->getNoiseParams("mgv6_np_mud",            np_mud)            &&
1139                 settings->getNoiseParams("mgv6_np_beach",          np_beach)          &&
1140                 settings->getNoiseParams("mgv6_np_biome",          np_biome)          &&
1141                 settings->getNoiseParams("mgv6_np_cave",           np_cave)           &&
1142                 settings->getNoiseParams("mgv6_np_humidity",       np_humidity)       &&
1143                 settings->getNoiseParams("mgv6_np_trees",          np_trees)          &&
1144                 settings->getNoiseParams("mgv6_np_apple_trees",    np_apple_trees);
1145         return success;
1146 }
1147
1148
1149 void MapgenV6Params::writeParams(Settings *settings) {
1150         settings->setFloat("mgv6_freq_desert", freq_desert);
1151         settings->setFloat("mgv6_freq_beach",  freq_beach);
1152
1153         settings->setNoiseParams("mgv6_np_terrain_base",   np_terrain_base);
1154         settings->setNoiseParams("mgv6_np_terrain_higher", np_terrain_higher);
1155         settings->setNoiseParams("mgv6_np_steepness",      np_steepness);
1156         settings->setNoiseParams("mgv6_np_height_select",  np_height_select);
1157         settings->setNoiseParams("mgv6_np_mud",            np_mud);
1158         settings->setNoiseParams("mgv6_np_beach",          np_beach);
1159         settings->setNoiseParams("mgv6_np_biome",          np_biome);
1160         settings->setNoiseParams("mgv6_np_cave",           np_cave);
1161         settings->setNoiseParams("mgv6_np_humidity",       np_humidity);
1162         settings->setNoiseParams("mgv6_np_trees",          np_trees);
1163         settings->setNoiseParams("mgv6_np_apple_trees",    np_apple_trees);
1164 }
1165
1166
1167 bool MapgenV7Params::readParams(Settings *settings) {
1168         bool success =
1169                 settings->getNoiseParams("mgv7_np_terrain_base",    np_terrain_base)    &&
1170                 settings->getNoiseParams("mgv7_np_terrain_alt",     np_terrain_alt)     &&
1171                 settings->getNoiseParams("mgv7_np_terrain_persist", np_terrain_persist) &&
1172                 settings->getNoiseParams("mgv7_np_height_select",   np_height_select)   &&
1173                 settings->getNoiseParams("mgv7_np_filler_depth",    np_filler_depth)    &&
1174                 settings->getNoiseParams("mgv7_np_mount_height",    np_mount_height)    &&
1175                 settings->getNoiseParams("mgv7_np_ridge_uwater",    np_ridge_uwater)    &&
1176                 settings->getNoiseParams("mgv7_np_mountain",        np_mountain)        &&
1177                 settings->getNoiseParams("mgv7_np_ridge",           np_ridge);
1178         return success;
1179 }
1180
1181
1182 void MapgenV7Params::writeParams(Settings *settings) {
1183         settings->setNoiseParams("mgv7_np_terrain_base",    np_terrain_base);
1184         settings->setNoiseParams("mgv7_np_terrain_alt",     np_terrain_alt);
1185         settings->setNoiseParams("mgv7_np_terrain_persist", np_terrain_persist);
1186         settings->setNoiseParams("mgv7_np_height_select",   np_height_select);
1187         settings->setNoiseParams("mgv7_np_filler_depth",    np_filler_depth);
1188         settings->setNoiseParams("mgv7_np_mount_height",    np_mount_height);
1189         settings->setNoiseParams("mgv7_np_ridge_uwater",    np_ridge_uwater);
1190         settings->setNoiseParams("mgv7_np_mountain",        np_mountain);
1191         settings->setNoiseParams("mgv7_np_ridge",           np_ridge);
1192 }