3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>,
4 2012-2013 RealBadAngel, Maciej Kasatkin <mk@realbadangel.pl>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
22 #include "util/pointer.h"
23 #include "util/numeric.h"
25 #include "serverenvironment.h"
28 #include "voxelalgorithms.h"
33 void make_tree(MMVManip &vmanip, v3s16 p0,
34 bool is_apple_tree, INodeDefManager *ndef, s32 seed)
37 NOTE: Tree-placing code is currently duplicated in the engine
38 and in games that have saplings; both are deprecated but not
41 MapNode treenode(ndef->getId("mapgen_tree"));
42 MapNode leavesnode(ndef->getId("mapgen_leaves"));
43 MapNode applenode(ndef->getId("mapgen_apple"));
45 PseudoRandom pr(seed);
46 s16 trunk_h = pr.range(4, 5);
48 for (s16 ii = 0; ii < trunk_h; ii++) {
49 if (vmanip.m_area.contains(p1)) {
50 u32 vi = vmanip.m_area.index(p1);
51 vmanip.m_data[vi] = treenode;
56 // p1 is now the last piece of the trunk
59 VoxelArea leaves_a(v3s16(-2, -1, -2), v3s16(2, 2, 2));
60 //SharedPtr<u8> leaves_d(new u8[leaves_a.getVolume()]);
61 Buffer<u8> leaves_d(leaves_a.getVolume());
62 for (s32 i = 0; i < leaves_a.getVolume(); i++)
65 // Force leaves at near the end of the trunk
67 for (s16 z = -d; z <= d; z++)
68 for (s16 y = -d; y <= d; y++)
69 for (s16 x = -d; x <= d; x++) {
70 leaves_d[leaves_a.index(v3s16(x, y, z))] = 1;
73 // Add leaves randomly
74 for (u32 iii = 0; iii < 7; iii++) {
76 pr.range(leaves_a.MinEdge.X, leaves_a.MaxEdge.X - d),
77 pr.range(leaves_a.MinEdge.Y, leaves_a.MaxEdge.Y - d),
78 pr.range(leaves_a.MinEdge.Z, leaves_a.MaxEdge.Z - d)
81 for (s16 z = 0; z <= d; z++)
82 for (s16 y = 0; y <= d; y++)
83 for (s16 x = 0; x <= d; x++) {
84 leaves_d[leaves_a.index(p + v3s16(x, y, z))] = 1;
88 // Blit leaves to vmanip
89 for (s16 z = leaves_a.MinEdge.Z; z <= leaves_a.MaxEdge.Z; z++)
90 for (s16 y = leaves_a.MinEdge.Y; y <= leaves_a.MaxEdge.Y; y++) {
91 v3s16 pmin(leaves_a.MinEdge.X, y, z);
92 u32 i = leaves_a.index(pmin);
93 u32 vi = vmanip.m_area.index(pmin + p1);
94 for (s16 x = leaves_a.MinEdge.X; x <= leaves_a.MaxEdge.X; x++) {
96 if (vmanip.m_area.contains(p + p1) == true &&
97 (vmanip.m_data[vi].getContent() == CONTENT_AIR ||
98 vmanip.m_data[vi].getContent() == CONTENT_IGNORE)) {
99 if (leaves_d[i] == 1) {
100 bool is_apple = pr.range(0, 99) < 10;
101 if (is_apple_tree && is_apple)
102 vmanip.m_data[vi] = applenode;
104 vmanip.m_data[vi] = leavesnode;
114 // L-System tree LUA spawner
115 treegen::error spawn_ltree(ServerEnvironment *env, v3s16 p0,
116 INodeDefManager *ndef, const TreeDef &tree_definition)
118 ServerMap *map = &env->getServerMap();
119 std::map<v3s16, MapBlock*> modified_blocks;
120 MMVManip vmanip(map);
121 v3s16 tree_blockp = getNodeBlockPos(p0);
124 vmanip.initialEmerge(tree_blockp - v3s16(1, 1, 1), tree_blockp + v3s16(1, 3, 1));
125 e = make_ltree(vmanip, p0, ndef, tree_definition);
129 voxalgo::blit_back_with_light(map, &vmanip, &modified_blocks);
131 // Send a MEET_OTHER event
133 event.type = MEET_OTHER;
134 for (std::map<v3s16, MapBlock*>::iterator
135 i = modified_blocks.begin();
136 i != modified_blocks.end(); ++i)
137 event.modified_blocks.insert(i->first);
138 map->dispatchEvent(&event);
143 //L-System tree generator
144 treegen::error make_ltree(MMVManip &vmanip, v3s16 p0,
145 INodeDefManager *ndef, TreeDef tree_definition)
147 MapNode dirtnode(ndef->getId("mapgen_dirt"));
149 if (tree_definition.explicit_seed)
150 seed = tree_definition.seed + 14002;
152 seed = p0.X * 2 + p0.Y * 4 + p0.Z; // use the tree position to seed PRNG
153 PseudoRandom ps(seed);
155 // chance of inserting abcd rules
161 //randomize tree growth level, minimum=2
162 s16 iterations = tree_definition.iterations;
163 if (tree_definition.iterations_random_level > 0)
164 iterations -= ps.range(0, tree_definition.iterations_random_level);
168 s16 MAX_ANGLE_OFFSET = 5;
169 double angle_in_radians = (double)tree_definition.angle * M_PI / 180;
170 double angleOffset_in_radians = (s16)(ps.range(0, 1) % MAX_ANGLE_OFFSET) * M_PI / 180;
172 //initialize rotation matrix, position and stacks for branches
173 core::matrix4 rotation;
174 rotation = setRotationAxisRadians(rotation, M_PI / 2, v3f(0, 0, 1));
179 std::stack <core::matrix4> stack_orientation;
180 std::stack <v3f> stack_position;
183 std::string axiom = tree_definition.initial_axiom;
184 for (s16 i = 0; i < iterations; i++) {
185 std::string temp = "";
186 for (s16 j = 0; j < (s16)axiom.size(); j++) {
187 char axiom_char = axiom.at(j);
188 switch (axiom_char) {
190 temp += tree_definition.rules_a;
193 temp += tree_definition.rules_b;
196 temp += tree_definition.rules_c;
199 temp += tree_definition.rules_d;
202 if (prop_a >= ps.range(1, 10))
203 temp += tree_definition.rules_a;
206 if (prop_b >= ps.range(1, 10))
207 temp += tree_definition.rules_b;
210 if (prop_c >= ps.range(1, 10))
211 temp += tree_definition.rules_c;
214 if (prop_d >= ps.range(1, 10))
215 temp += tree_definition.rules_d;
225 //make sure tree is not floating in the air
226 if (tree_definition.trunk_type == "double") {
229 v3f(position.X + 1, position.Y - 1, position.Z),
234 v3f(position.X, position.Y - 1, position.Z + 1),
239 v3f(position.X + 1, position.Y - 1, position.Z + 1),
242 } else if (tree_definition.trunk_type == "crossed") {
245 v3f(position.X + 1, position.Y - 1, position.Z),
250 v3f(position.X - 1, position.Y - 1, position.Z),
255 v3f(position.X, position.Y - 1, position.Z + 1),
260 v3f(position.X, position.Y - 1, position.Z - 1),
265 /* build tree out of generated axiom
267 Key for Special L-System Symbols used in Axioms
269 G - move forward one unit with the pen up
270 F - move forward one unit with the pen down drawing trunks and branches
271 f - move forward one unit with the pen down drawing leaves (100% chance)
272 T - move forward one unit with the pen down drawing trunks only
273 R - move forward one unit with the pen down placing fruit
274 A - replace with rules set A
275 B - replace with rules set B
276 C - replace with rules set C
277 D - replace with rules set D
278 a - replace with rules set A, chance 90%
279 b - replace with rules set B, chance 80%
280 c - replace with rules set C, chance 70%
281 d - replace with rules set D, chance 60%
282 + - yaw the turtle right by angle degrees
283 - - yaw the turtle left by angle degrees
284 & - pitch the turtle down by angle degrees
285 ^ - pitch the turtle up by angle degrees
286 / - roll the turtle to the right by angle degrees
287 * - roll the turtle to the left by angle degrees
288 [ - save in stack current state info
289 ] - recover from stack state info
294 for (s16 i = 0; i < (s16)axiom.size(); i++) {
295 char axiom_char = axiom.at(i);
296 core::matrix4 temp_rotation;
297 temp_rotation.makeIdentity();
299 switch (axiom_char) {
302 dir = transposeMatrix(rotation, dir);
306 tree_trunk_placement(
308 v3f(position.X, position.Y, position.Z),
311 if (tree_definition.trunk_type == "double" &&
312 !tree_definition.thin_branches) {
313 tree_trunk_placement(
315 v3f(position.X + 1, position.Y, position.Z),
318 tree_trunk_placement(
320 v3f(position.X, position.Y, position.Z + 1),
323 tree_trunk_placement(
325 v3f(position.X + 1, position.Y, position.Z + 1),
328 } else if (tree_definition.trunk_type == "crossed" &&
329 !tree_definition.thin_branches) {
330 tree_trunk_placement(
332 v3f(position.X + 1, position.Y, position.Z),
335 tree_trunk_placement(
337 v3f(position.X - 1, position.Y, position.Z),
340 tree_trunk_placement(
342 v3f(position.X, position.Y, position.Z + 1),
345 tree_trunk_placement(
347 v3f(position.X, position.Y, position.Z - 1),
352 dir = transposeMatrix(rotation, dir);
356 tree_trunk_placement(
358 v3f(position.X, position.Y, position.Z),
361 if ((stack_orientation.empty() &&
362 tree_definition.trunk_type == "double") ||
363 (!stack_orientation.empty() &&
364 tree_definition.trunk_type == "double" &&
365 !tree_definition.thin_branches)) {
366 tree_trunk_placement(
368 v3f(position.X +1 , position.Y, position.Z),
371 tree_trunk_placement(
373 v3f(position.X, position.Y, position.Z + 1),
376 tree_trunk_placement(
378 v3f(position.X + 1, position.Y, position.Z + 1),
381 } else if ((stack_orientation.empty() &&
382 tree_definition.trunk_type == "crossed") ||
383 (!stack_orientation.empty() &&
384 tree_definition.trunk_type == "crossed" &&
385 !tree_definition.thin_branches)) {
386 tree_trunk_placement(
388 v3f(position.X + 1, position.Y, position.Z),
391 tree_trunk_placement(
393 v3f(position.X - 1, position.Y, position.Z),
396 tree_trunk_placement(
398 v3f(position.X, position.Y, position.Z + 1),
401 tree_trunk_placement(
403 v3f(position.X, position.Y, position.Z - 1),
406 } if (stack_orientation.empty() == false) {
408 for (x = -size; x <= size; x++)
409 for (y = -size; y <= size; y++)
410 for (z = -size; z <= size; z++) {
411 if (abs(x) == size &&
414 tree_leaves_placement(
416 v3f(position.X + x + 1, position.Y + y,
421 tree_leaves_placement(
423 v3f(position.X + x - 1, position.Y + y,
428 tree_leaves_placement(
429 vmanip,v3f(position.X + x, position.Y + y,
434 tree_leaves_placement(
435 vmanip,v3f(position.X + x, position.Y + y,
444 dir = transposeMatrix(rotation, dir);
448 tree_single_leaves_placement(
450 v3f(position.X, position.Y, position.Z),
455 dir = transposeMatrix(rotation, dir);
459 tree_fruit_placement(
461 v3f(position.X, position.Y, position.Z),
465 dir = transposeMatrix(rotation, dir);
469 // turtle orientation commands
471 stack_orientation.push(rotation);
472 stack_position.push(position);
475 if (stack_orientation.empty())
476 return UNBALANCED_BRACKETS;
477 rotation = stack_orientation.top();
478 stack_orientation.pop();
479 position = stack_position.top();
480 stack_position.pop();
483 temp_rotation.makeIdentity();
484 temp_rotation = setRotationAxisRadians(temp_rotation,
485 angle_in_radians + angleOffset_in_radians, v3f(0, 0, 1));
486 rotation *= temp_rotation;
489 temp_rotation.makeIdentity();
490 temp_rotation = setRotationAxisRadians(temp_rotation,
491 angle_in_radians + angleOffset_in_radians, v3f(0, 0, -1));
492 rotation *= temp_rotation;
495 temp_rotation.makeIdentity();
496 temp_rotation = setRotationAxisRadians(temp_rotation,
497 angle_in_radians + angleOffset_in_radians, v3f(0, 1, 0));
498 rotation *= temp_rotation;
501 temp_rotation.makeIdentity();
502 temp_rotation = setRotationAxisRadians(temp_rotation,
503 angle_in_radians + angleOffset_in_radians, v3f(0, -1, 0));
504 rotation *= temp_rotation;
507 temp_rotation.makeIdentity();
508 temp_rotation = setRotationAxisRadians(temp_rotation,
509 angle_in_radians, v3f(1, 0, 0));
510 rotation *= temp_rotation;
513 temp_rotation.makeIdentity();
514 temp_rotation = setRotationAxisRadians(temp_rotation,
515 angle_in_radians, v3f(-1, 0, 0));
516 rotation *= temp_rotation;
527 void tree_node_placement(MMVManip &vmanip, v3f p0, MapNode node)
529 v3s16 p1 = v3s16(myround(p0.X), myround(p0.Y), myround(p0.Z));
530 if (vmanip.m_area.contains(p1) == false)
532 u32 vi = vmanip.m_area.index(p1);
533 if (vmanip.m_data[vi].getContent() != CONTENT_AIR
534 && vmanip.m_data[vi].getContent() != CONTENT_IGNORE)
536 vmanip.m_data[vmanip.m_area.index(p1)] = node;
540 void tree_trunk_placement(MMVManip &vmanip, v3f p0, TreeDef &tree_definition)
542 v3s16 p1 = v3s16(myround(p0.X), myround(p0.Y), myround(p0.Z));
543 if (vmanip.m_area.contains(p1) == false)
545 u32 vi = vmanip.m_area.index(p1);
546 if (vmanip.m_data[vi].getContent() != CONTENT_AIR
547 && vmanip.m_data[vi].getContent() != CONTENT_IGNORE)
549 vmanip.m_data[vmanip.m_area.index(p1)] = tree_definition.trunknode;
553 void tree_leaves_placement(MMVManip &vmanip, v3f p0,
554 PseudoRandom ps, TreeDef &tree_definition)
556 MapNode leavesnode = tree_definition.leavesnode;
557 if (ps.range(1, 100) > 100 - tree_definition.leaves2_chance)
558 leavesnode = tree_definition.leaves2node;
559 v3s16 p1 = v3s16(myround(p0.X), myround(p0.Y), myround(p0.Z));
560 if (vmanip.m_area.contains(p1) == false)
562 u32 vi = vmanip.m_area.index(p1);
563 if (vmanip.m_data[vi].getContent() != CONTENT_AIR
564 && vmanip.m_data[vi].getContent() != CONTENT_IGNORE)
566 if (tree_definition.fruit_chance > 0) {
567 if (ps.range(1, 100) > 100 - tree_definition.fruit_chance)
568 vmanip.m_data[vmanip.m_area.index(p1)] = tree_definition.fruitnode;
570 vmanip.m_data[vmanip.m_area.index(p1)] = leavesnode;
571 } else if (ps.range(1, 100) > 20) {
572 vmanip.m_data[vmanip.m_area.index(p1)] = leavesnode;
577 void tree_single_leaves_placement(MMVManip &vmanip, v3f p0,
578 PseudoRandom ps, TreeDef &tree_definition)
580 MapNode leavesnode = tree_definition.leavesnode;
581 if (ps.range(1, 100) > 100 - tree_definition.leaves2_chance)
582 leavesnode = tree_definition.leaves2node;
583 v3s16 p1 = v3s16(myround(p0.X), myround(p0.Y), myround(p0.Z));
584 if (vmanip.m_area.contains(p1) == false)
586 u32 vi = vmanip.m_area.index(p1);
587 if (vmanip.m_data[vi].getContent() != CONTENT_AIR
588 && vmanip.m_data[vi].getContent() != CONTENT_IGNORE)
590 vmanip.m_data[vmanip.m_area.index(p1)] = leavesnode;
594 void tree_fruit_placement(MMVManip &vmanip, v3f p0, TreeDef &tree_definition)
596 v3s16 p1 = v3s16(myround(p0.X), myround(p0.Y), myround(p0.Z));
597 if (vmanip.m_area.contains(p1) == false)
599 u32 vi = vmanip.m_area.index(p1);
600 if (vmanip.m_data[vi].getContent() != CONTENT_AIR
601 && vmanip.m_data[vi].getContent() != CONTENT_IGNORE)
603 vmanip.m_data[vmanip.m_area.index(p1)] = tree_definition.fruitnode;
607 irr::core::matrix4 setRotationAxisRadians(irr::core::matrix4 M, double angle, v3f axis)
609 double c = cos(angle);
610 double s = sin(angle);
613 double tx = t * axis.X;
614 double ty = t * axis.Y;
615 double tz = t * axis.Z;
616 double sx = s * axis.X;
617 double sy = s * axis.Y;
618 double sz = s * axis.Z;
620 M[0] = tx * axis.X + c;
621 M[1] = tx * axis.Y + sz;
622 M[2] = tx * axis.Z - sy;
624 M[4] = ty * axis.X - sz;
625 M[5] = ty * axis.Y + c;
626 M[6] = ty * axis.Z + sx;
628 M[8] = tz * axis.X + sy;
629 M[9] = tz * axis.Y - sx;
630 M[10] = tz * axis.Z + c;
635 v3f transposeMatrix(irr::core::matrix4 M, v3f v)
638 double x = M[0] * v.X + M[4] * v.Y + M[8] * v.Z +M[12];
639 double y = M[1] * v.X + M[5] * v.Y + M[9] * v.Z +M[13];
640 double z = M[2] * v.X + M[6] * v.Y + M[10] * v.Z +M[14];
648 void make_jungletree(MMVManip &vmanip, v3s16 p0, INodeDefManager *ndef, s32 seed)
651 NOTE: Tree-placing code is currently duplicated in the engine
652 and in games that have saplings; both are deprecated but not
655 content_t c_tree = ndef->getId("mapgen_jungletree");
656 content_t c_leaves = ndef->getId("mapgen_jungleleaves");
657 if (c_tree == CONTENT_IGNORE)
658 c_tree = ndef->getId("mapgen_tree");
659 if (c_leaves == CONTENT_IGNORE)
660 c_leaves = ndef->getId("mapgen_leaves");
662 MapNode treenode(c_tree);
663 MapNode leavesnode(c_leaves);
665 PseudoRandom pr(seed);
666 for (s16 x= -1; x <= 1; x++)
667 for (s16 z= -1; z <= 1; z++) {
668 if (pr.range(0, 2) == 0)
670 v3s16 p1 = p0 + v3s16(x, 0, z);
671 v3s16 p2 = p0 + v3s16(x, -1, z);
672 u32 vi1 = vmanip.m_area.index(p1);
673 u32 vi2 = vmanip.m_area.index(p2);
675 if (vmanip.m_area.contains(p2) &&
676 vmanip.m_data[vi2].getContent() == CONTENT_AIR)
677 vmanip.m_data[vi2] = treenode;
678 else if (vmanip.m_area.contains(p1) &&
679 vmanip.m_data[vi1].getContent() == CONTENT_AIR)
680 vmanip.m_data[vi1] = treenode;
682 vmanip.m_data[vmanip.m_area.index(p0)] = treenode;
684 s16 trunk_h = pr.range(8, 12);
686 for (s16 ii = 0; ii < trunk_h; ii++) {
687 if (vmanip.m_area.contains(p1)) {
688 u32 vi = vmanip.m_area.index(p1);
689 vmanip.m_data[vi] = treenode;
694 // p1 is now the last piece of the trunk
697 VoxelArea leaves_a(v3s16(-3, -2, -3), v3s16(3, 2, 3));
698 //SharedPtr<u8> leaves_d(new u8[leaves_a.getVolume()]);
699 Buffer<u8> leaves_d(leaves_a.getVolume());
700 for (s32 i = 0; i < leaves_a.getVolume(); i++)
703 // Force leaves at near the end of the trunk
705 for (s16 z = -d; z <= d; z++)
706 for (s16 y = -d; y <= d; y++)
707 for (s16 x = -d; x <= d; x++) {
708 leaves_d[leaves_a.index(v3s16(x,y,z))] = 1;
711 // Add leaves randomly
712 for (u32 iii = 0; iii < 30; iii++) {
714 pr.range(leaves_a.MinEdge.X, leaves_a.MaxEdge.X - d),
715 pr.range(leaves_a.MinEdge.Y, leaves_a.MaxEdge.Y - d),
716 pr.range(leaves_a.MinEdge.Z, leaves_a.MaxEdge.Z - d)
719 for (s16 z = 0; z <= d; z++)
720 for (s16 y = 0; y <= d; y++)
721 for (s16 x = 0; x <= d; x++) {
722 leaves_d[leaves_a.index(p + v3s16(x, y, z))] = 1;
726 // Blit leaves to vmanip
727 for (s16 z = leaves_a.MinEdge.Z; z <= leaves_a.MaxEdge.Z; z++)
728 for (s16 y = leaves_a.MinEdge.Y; y <= leaves_a.MaxEdge.Y; y++) {
729 v3s16 pmin(leaves_a.MinEdge.X, y, z);
730 u32 i = leaves_a.index(pmin);
731 u32 vi = vmanip.m_area.index(pmin + p1);
732 for (s16 x = leaves_a.MinEdge.X; x <= leaves_a.MaxEdge.X; x++) {
734 if (vmanip.m_area.contains(p + p1) == true &&
735 (vmanip.m_data[vi].getContent() == CONTENT_AIR ||
736 vmanip.m_data[vi].getContent() == CONTENT_IGNORE)) {
737 if (leaves_d[i] == 1)
738 vmanip.m_data[vi] = leavesnode;
747 void make_pine_tree(MMVManip &vmanip, v3s16 p0, INodeDefManager *ndef, s32 seed)
750 NOTE: Tree-placing code is currently duplicated in the engine
751 and in games that have saplings; both are deprecated but not
754 content_t c_tree = ndef->getId("mapgen_pine_tree");
755 content_t c_leaves = ndef->getId("mapgen_pine_needles");
756 content_t c_snow = ndef->getId("mapgen_snow");
757 if (c_tree == CONTENT_IGNORE)
758 c_tree = ndef->getId("mapgen_tree");
759 if (c_leaves == CONTENT_IGNORE)
760 c_leaves = ndef->getId("mapgen_leaves");
761 if (c_snow == CONTENT_IGNORE)
762 c_snow = CONTENT_AIR;
764 MapNode treenode(c_tree);
765 MapNode leavesnode(c_leaves);
766 MapNode snownode(c_snow);
768 PseudoRandom pr(seed);
769 u16 trunk_h = pr.range(9, 13);
771 for (u16 ii = 0; ii < trunk_h; ii++) {
772 if (vmanip.m_area.contains(p1)) {
773 u32 vi = vmanip.m_area.index(p1);
774 vmanip.m_data[vi] = treenode;
779 // Make p1 the top node of the trunk
782 VoxelArea leaves_a(v3s16(-3, -6, -3), v3s16(3, 3, 3));
783 //SharedPtr<u8> leaves_d(new u8[leaves_a.getVolume()]);
784 Buffer<u8> leaves_d(leaves_a.getVolume());
785 for (s32 i = 0; i < leaves_a.getVolume(); i++)
790 for (s16 yy = -1; yy <= 1; yy++) {
791 for (s16 zz = -dev; zz <= dev; zz++) {
792 u32 i = leaves_a.index(v3s16(-dev, yy, zz));
793 u32 ia = leaves_a.index(v3s16(-dev, yy+1, zz));
794 for (s16 xx = -dev; xx <= dev; xx++) {
795 if (pr.range(0, 20) <= 19 - dev) {
807 u32 i = leaves_a.index(v3s16(0, 1, 0));
809 i = leaves_a.index(v3s16(0, 2, 0));
811 i = leaves_a.index(v3s16(0, 3, 0));
816 for (u32 iii = 0; iii < 20; iii++) {
817 s16 xi = pr.range(-3, 2);
818 s16 yy = pr.range(-6, -5);
819 s16 zi = pr.range(-3, 2);
822 for (s16 zz = zi; zz <= zi + 1; zz++) {
823 u32 i = leaves_a.index(v3s16(xi, yy, zz));
824 u32 ia = leaves_a.index(v3s16(xi, yy + 1, zz));
825 for (s16 xx = xi; xx <= xi + 1; xx++) {
827 if (leaves_d[ia] == 0)
836 for (s16 yy = my + 1; yy <= my + 2; yy++) {
837 for (s16 zz = -dev; zz <= dev; zz++) {
838 u32 i = leaves_a.index(v3s16(-dev, yy, zz));
839 u32 ia = leaves_a.index(v3s16(-dev, yy + 1, zz));
840 for (s16 xx = -dev; xx <= dev; xx++) {
841 if (pr.range(0, 20) <= 19 - dev) {
852 // Blit leaves to vmanip
853 for (s16 z = leaves_a.MinEdge.Z; z <= leaves_a.MaxEdge.Z; z++)
854 for (s16 y = leaves_a.MinEdge.Y; y <= leaves_a.MaxEdge.Y; y++) {
855 v3s16 pmin(leaves_a.MinEdge.X, y, z);
856 u32 i = leaves_a.index(pmin);
857 u32 vi = vmanip.m_area.index(pmin + p1);
858 for (s16 x = leaves_a.MinEdge.X; x <= leaves_a.MaxEdge.X; x++) {
860 if (vmanip.m_area.contains(p + p1) == true &&
861 (vmanip.m_data[vi].getContent() == CONTENT_AIR ||
862 vmanip.m_data[vi].getContent() == CONTENT_IGNORE ||
863 vmanip.m_data[vi] == snownode)) {
864 if (leaves_d[i] == 1)
865 vmanip.m_data[vi] = leavesnode;
866 else if (leaves_d[i] == 2)
867 vmanip.m_data[vi] = snownode;
875 }; // namespace treegen