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