1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
|
|
5 | * Copyright (©) 2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) Crossfire Development Team (restored, original file without copyright notice) |
6 | * Copyright (©) 1994-2004 Crossfire Development Team (restored, original file without copyright notice) |
6 | * |
7 | * |
7 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * option) any later version. |
11 | * option) any later version. |
11 | * |
12 | * |
12 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | * |
17 | * |
17 | * You should have received a copy of the Affero GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
18 | * and the GNU General Public License along with this program. If not, see |
19 | * and the GNU General Public License along with this program. If not, see |
19 | * <http://www.gnu.org/licenses/>. |
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <random_map.h> |
26 | #include <rmg.h> |
26 | #include <rproto.h> |
27 | #include <rproto.h> |
27 | |
28 | |
28 | void |
29 | ecb_noinline void |
29 | layout::alloc (int w, int h) |
30 | layout::alloc (int w, int h) |
30 | { |
31 | { |
31 | assert (sizeof (cell) == 1); |
32 | assert (sizeof (cell) == 1); |
32 | |
33 | |
33 | this->w = w; |
34 | this->w = w; |
… | |
… | |
74 | layout::~layout () |
75 | layout::~layout () |
75 | { |
76 | { |
76 | sfree ((char *)data, size); |
77 | sfree ((char *)data, size); |
77 | } |
78 | } |
78 | |
79 | |
79 | void |
80 | ecb_noinline void |
80 | layout::fill (char fill) |
81 | layout::fill (char fill) |
81 | { |
82 | { |
82 | //memset (data [0], fill, w * h); // only when contiguous :/ |
83 | //memset (data [0], fill, w * h); // only when contiguous :/ |
83 | fill_rect (0, 0, w, h, fill); |
84 | fill_rect (0, 0, w, h, fill); |
84 | } |
85 | } |
85 | |
86 | |
86 | void |
87 | ecb_noinline void |
|
|
88 | layout::replace (char from, char to) |
|
|
89 | { |
|
|
90 | for (int x = 0; x < w; ++x) |
|
|
91 | for (int y = 0; y < h; ++y) |
|
|
92 | if (data [x][y] == from) |
|
|
93 | data [x][y] = to; |
|
|
94 | } |
|
|
95 | |
|
|
96 | ecb_noinline void |
87 | layout::rect (int x1, int y1, int x2, int y2, char fill) |
97 | layout::rect (int x1, int y1, int x2, int y2, char fill) |
88 | { |
98 | { |
89 | --x2; |
99 | --x2; |
90 | |
100 | |
91 | memset (data [x1] + y1, fill, y2 - y1); |
101 | memset (data [x1] + y1, fill, y2 - y1); |
… | |
… | |
93 | |
103 | |
94 | while (++x1 < x2) |
104 | while (++x1 < x2) |
95 | data [x1][y1] = data [x1][y2 - 1] = fill; |
105 | data [x1][y1] = data [x1][y2 - 1] = fill; |
96 | } |
106 | } |
97 | |
107 | |
98 | void |
108 | ecb_noinline void |
99 | layout::fill_rect (int x1, int y1, int x2, int y2, char fill) |
109 | layout::fill_rect (int x1, int y1, int x2, int y2, char fill) |
100 | { |
110 | { |
101 | for (; x1 < x2; ++x1) |
111 | for (; x1 < x2; ++x1) |
102 | memset (data [x1] + y1, fill, y2 - y1); |
112 | memset (data [x1] + y1, fill, y2 - y1); |
103 | } |
113 | } |
104 | |
114 | |
|
|
115 | void |
105 | void layout::border (char fill) |
116 | layout::border (char fill) |
106 | { |
117 | { |
107 | rect (0, 0, w, h, fill); |
118 | rect (0, 0, w, h, fill); |
108 | } |
119 | } |
109 | |
120 | |
110 | void |
121 | ecb_noinline void |
111 | layout::fill_rand (int percent) |
122 | layout::fill_rand (int percent) |
112 | { |
123 | { |
113 | percent = lerp (percent, 0, 100, 0, 256); |
124 | percent = lerp (percent, 0, 100, 0, 256); |
114 | |
125 | |
115 | for (int x = w - 1; --x > 0; ) |
126 | for (int x = 0; x < w; ++x) |
116 | for (int y = h - 1; --y > 0; ) |
127 | for (int y = 0; y < h; ++y) |
117 | data [x][y] = rmg_rndm (256) > percent ? 0 : '#'; |
128 | data [x][y] = rmg_rndm (256) > percent ? 0 : '#'; |
118 | } |
129 | } |
119 | |
130 | |
120 | ///////////////////////////////////////////////////////////////////////////// |
131 | ///////////////////////////////////////////////////////////////////////////// |
121 | |
132 | |
122 | // erode by cellular automata |
133 | // erode by cellular automata |
123 | void |
134 | ecb_noinline void |
124 | layout::erode_1_2 (int c1, int c2, int repeat) |
135 | layout::erode_1_2 (int c1, int c2, int repeat) |
125 | { |
136 | { |
126 | layout neu (w, h); |
137 | layout neu (w, h); |
127 | |
138 | |
128 | while (repeat--) |
139 | while (repeat--) |
… | |
… | |
194 | ///////////////////////////////////////////////////////////////////////////// |
205 | ///////////////////////////////////////////////////////////////////////////// |
195 | // isolation remover - ensures single connected area |
206 | // isolation remover - ensures single connected area |
196 | |
207 | |
197 | typedef fixed_stack<point> pointlist; |
208 | typedef fixed_stack<point> pointlist; |
198 | |
209 | |
199 | static void noinline |
210 | ecb_noinline static void |
200 | push_flood_fill (layout &dist, pointlist &seeds, int x, int y) |
211 | push_flood_fill (layout &dist, pointlist &seeds, int x, int y) |
201 | { |
212 | { |
202 | if (dist [x][y]) |
213 | if (dist [x][y]) |
203 | return; |
214 | return; |
204 | |
215 | |
… | |
… | |
220 | if (x > 0 && !dist [x - 1][y]) push_flood_fill (dist, seeds, x - 1, y); |
231 | if (x > 0 && !dist [x - 1][y]) push_flood_fill (dist, seeds, x - 1, y); |
221 | if (x < dist.w - 1 && !dist [x + 1][y]) push_flood_fill (dist, seeds, x + 1, y); |
232 | if (x < dist.w - 1 && !dist [x + 1][y]) push_flood_fill (dist, seeds, x + 1, y); |
222 | } |
233 | } |
223 | } |
234 | } |
224 | |
235 | |
225 | static inline void |
236 | static void inline |
226 | make_tunnel (layout &dist, pointlist &seeds, int x, int y, U8 d, int perturb) |
237 | make_tunnel (layout &dist, pointlist &seeds, int x, int y, U8 d, int perturb) |
227 | { |
238 | { |
228 | for (;;) |
239 | for (;;) |
229 | { |
240 | { |
230 | point neigh[4]; |
241 | point neigh[4]; |
… | |
… | |
265 | seeds.push (point (x, y)); |
276 | seeds.push (point (x, y)); |
266 | } |
277 | } |
267 | |
278 | |
268 | // isolation remover, works on a "distance" map |
279 | // isolation remover, works on a "distance" map |
269 | // the map must be initialised with 0 == rooms, 255 = walls |
280 | // the map must be initialised with 0 == rooms, 255 = walls |
270 | static void noinline |
281 | ecb_noinline static void |
271 | isolation_remover (layout &dist, unsigned int perturb = 2) |
282 | isolation_remover (layout &dist, unsigned int perturb = 2) |
272 | { |
283 | { |
273 | // dist contains |
284 | // dist contains |
274 | // 0 == invisited rooms |
285 | // 0 == invisited rooms |
275 | // 1 == visited rooms |
286 | // 1 == visited rooms |
… | |
… | |
302 | seeds.push (point (x, y)); |
313 | seeds.push (point (x, y)); |
303 | |
314 | |
304 | // phase 2, while we have seeds, if |
315 | // phase 2, while we have seeds, if |
305 | // seed is empty, floodfill, else grow |
316 | // seed is empty, floodfill, else grow |
306 | |
317 | |
|
|
318 | int rem_index = 0; // used to remove "somewhat ordered" |
|
|
319 | |
307 | while (seeds.size) |
320 | while (seeds.size) |
308 | { |
321 | { |
309 | coroapi::cede_to_tick (); |
322 | coroapi::cede_to_tick (); |
310 | |
323 | |
|
|
324 | int i = perturb |
|
|
325 | ? rmg_rndm (max (0, seeds.size - 8), seeds.size - 1) |
|
|
326 | : rem_index ++ % seeds.size; |
|
|
327 | |
311 | point p = seeds.remove (rmg_rndm (seeds.size)); |
328 | point p = seeds.remove (i); |
312 | |
329 | |
313 | x = p.x; |
330 | x = p.x; |
314 | y = p.y; |
331 | y = p.y; |
315 | |
332 | |
316 | if (!dist [x][y]) |
333 | if (!dist [x][y]) |
… | |
… | |
358 | void |
375 | void |
359 | layout::doorify () |
376 | layout::doorify () |
360 | { |
377 | { |
361 | int ndoors = w * h / 60; /* reasonable number of doors. */ |
378 | int ndoors = w * h / 60; /* reasonable number of doors. */ |
362 | |
379 | |
|
|
380 | coroapi::cede_to_tick (); |
|
|
381 | |
363 | fixed_stack<point> doorloc (w * h); |
382 | fixed_stack<point> doorloc (w * h); |
364 | |
383 | |
365 | /* make a list of possible door locations */ |
384 | /* make a list of possible door locations */ |
366 | for (int i = 1; i < w - 1; i++) |
385 | for (int i = 1; i < w - 1; i++) |
367 | for (int j = 1; j < h - 1; j++) |
386 | for (int j = 1; j < h - 1; j++) |
… | |
… | |
449 | //-GPL |
468 | //-GPL |
450 | |
469 | |
451 | void |
470 | void |
452 | layout::rotate (int rotation) |
471 | layout::rotate (int rotation) |
453 | { |
472 | { |
|
|
473 | coroapi::cede_to_tick (); |
|
|
474 | |
454 | switch (rotation & 3) |
475 | switch (rotation & 3) |
455 | { |
476 | { |
456 | case 2: /* a reflection */ |
477 | case 2: /* a reflection */ |
457 | { |
478 | { |
458 | layout new_layout (w, h); |
479 | layout new_layout (w, h); |
… | |
… | |
513 | * 1 match on (i+1, j) |
534 | * 1 match on (i+1, j) |
514 | * 2 match on (i, j+1) |
535 | * 2 match on (i, j+1) |
515 | * 4 match on (i+1, j+1) |
536 | * 4 match on (i+1, j+1) |
516 | * and the possible combinations thereof. |
537 | * and the possible combinations thereof. |
517 | */ |
538 | */ |
518 | static int noinline |
539 | ecb_noinline static int |
519 | calc_pattern (char ch, layout &maze, int i, int j) |
540 | calc_pattern (char ch, layout &maze, int i, int j) |
520 | { |
541 | { |
521 | int pattern = 0; |
542 | int pattern = 0; |
522 | |
543 | |
523 | if (i + 1 < maze.w && maze[i + 1][j] == ch) |
544 | if (i + 1 < maze.w && maze[i + 1][j] == ch) |
… | |
… | |
610 | { |
631 | { |
611 | layout new_layout (w * 2 - 1, h * 2 - 1); |
632 | layout new_layout (w * 2 - 1, h * 2 - 1); |
612 | |
633 | |
613 | new_layout.clear (); |
634 | new_layout.clear (); |
614 | |
635 | |
|
|
636 | coroapi::cede_to_tick (); |
|
|
637 | |
615 | for (int i = 0; i < w; i++) |
638 | for (int i = 0; i < w; i++) |
616 | for (int j = 0; j < h; j++) |
639 | for (int j = 0; j < h; j++) |
617 | switch (data [i][j]) |
640 | switch (data [i][j]) |
618 | { |
641 | { |
619 | case '#': expand_wall (new_layout, i, j, *this); break; |
642 | case '#': expand_wall (new_layout, i, j, *this); break; |
620 | case 'D': expand_door (new_layout, i, j, *this); break; |
643 | case 'D': expand_door (new_layout, i, j, *this); break; |
621 | default: expand_misc (new_layout, i, j, *this); break; |
644 | default: expand_misc (new_layout, i, j, *this); break; |
622 | } |
645 | } |
623 | |
646 | |
624 | swap (new_layout); |
647 | swap (new_layout); |
625 | } |
648 | } |
… | |
… | |
701 | |
724 | |
702 | return -1; |
725 | return -1; |
703 | } |
726 | } |
704 | |
727 | |
705 | int |
728 | int |
706 | make_wall (char **maze, int x, int y, int dir) |
729 | make_wall (layout &maze, int x, int y, int dir) |
707 | { |
730 | { |
708 | maze[x][y] = 'D'; /* mark a door */ |
731 | maze[x][y] = 'D'; /* mark a door */ |
709 | |
732 | |
710 | switch (dir) |
733 | switch (dir) |
711 | { |
734 | { |
… | |
… | |
728 | |
751 | |
729 | void |
752 | void |
730 | layout::roomify () |
753 | layout::roomify () |
731 | { |
754 | { |
732 | int tries = w * h / 30; |
755 | int tries = w * h / 30; |
|
|
756 | |
|
|
757 | coroapi::cede_to_tick (); |
733 | |
758 | |
734 | for (int ti = 0; ti < tries; ti++) |
759 | for (int ti = 0; ti < tries; ti++) |
735 | { |
760 | { |
736 | /* starting location for looking at creating a door */ |
761 | /* starting location for looking at creating a door */ |
737 | int dx = rmg_rndm (w); |
762 | int dx = rmg_rndm (w); |
… | |
… | |
827 | border (); |
852 | border (); |
828 | isolation_remover (0); |
853 | isolation_remover (0); |
829 | } |
854 | } |
830 | |
855 | |
831 | static void |
856 | static void |
832 | gen_mixed_ (layout &maze, random_map_params *RP, int dir) |
857 | gen_mixed_ (layout &maze, random_map_params *RP) |
833 | { |
858 | { |
834 | if (maze.w < 20 && maze.h < 20 && !rmg_rndm (3)) |
859 | if (maze.w > maze.h && maze.w > 16) |
835 | dir = 2; // stop recursion randomly |
|
|
836 | |
|
|
837 | if (dir == 0 && maze.w > 16) |
|
|
838 | { |
860 | { |
839 | int m = rmg_rndm (8, maze.w - 8); |
861 | int m = rmg_rndm (8, maze.w - 8); |
840 | |
862 | |
841 | layout m1 (maze, 0, 0, m , maze.h); gen_mixed_ (m1, RP, !dir); |
863 | layout m1 (maze, 0, 0, m , maze.h); gen_mixed_ (m1, RP); |
842 | layout m2 (maze, m, 0, maze.w, maze.h); gen_mixed_ (m2, RP, !dir); |
864 | layout m2 (maze, m, 0, maze.w, maze.h); gen_mixed_ (m2, RP); |
843 | } |
865 | } |
844 | else if (dir == 1 && maze.h > 16) |
866 | else if (maze.h > 16) |
845 | { |
867 | { |
846 | int m = rmg_rndm (8, maze.h - 8); |
868 | int m = rmg_rndm (8, maze.h - 8); |
847 | |
869 | |
848 | layout m1 (maze, 0, 0, maze.w, m ); gen_mixed_ (m1, RP, !dir); |
870 | layout m1 (maze, 0, 0, maze.w, m ); gen_mixed_ (m1, RP); |
849 | layout m2 (maze, 0, m, maze.w, maze.h); gen_mixed_ (m2, RP, !dir); |
871 | layout m2 (maze, 0, m, maze.w, maze.h); gen_mixed_ (m2, RP); |
850 | } |
872 | } |
851 | else |
873 | else |
852 | { |
874 | { |
853 | RP->map_layout_style = rmg_rndm (NROFLAYOUTS - 2) + 1; |
875 | RP->map_layout_style = rmg_rndm (NROFLAYOUTS - 2) + 1; |
854 | |
876 | |
855 | if (RP->map_layout_style == LAYOUT_MULTIPLE) |
877 | if (RP->map_layout_style == LAYOUT_MULTIPLE) |
856 | ++RP->map_layout_style; |
878 | ++RP->map_layout_style; |
857 | |
879 | |
858 | maze.generate (RP); |
880 | maze.generate (RP); |
859 | } |
881 | } |
|
|
882 | |
|
|
883 | coroapi::cede_to_tick (); |
860 | } |
884 | } |
861 | |
885 | |
862 | // recursive subdivision with random sublayouts |
886 | // recursive subdivision with random sublayouts |
863 | static void |
887 | static void |
864 | gen_mixed (layout &maze, random_map_params *RP) |
888 | gen_mixed (layout &maze, random_map_params *RP) |
865 | { |
889 | { |
866 | random_map_params &rp = *new random_map_params (RP); |
890 | random_map_params &rp = *new random_map_params (RP); |
867 | gen_mixed_ (maze, &rp, rmg_rndm (2)); |
891 | gen_mixed_ (maze, &rp); |
868 | delete &rp; |
892 | delete &rp; |
869 | |
893 | |
870 | maze.border (); |
894 | maze.border (); |
|
|
895 | |
|
|
896 | // exits currently do not work so well, as they |
|
|
897 | // are currently often found together, so nuke entrances |
|
|
898 | maze.replace ('<', ' '); |
|
|
899 | |
871 | maze.isolation_remover (0); |
900 | maze.isolation_remover (0); |
872 | } |
901 | } |
873 | |
902 | |
874 | //+GPL |
903 | //+GPL |
875 | |
904 | |
… | |
… | |
985 | static struct demo |
1014 | static struct demo |
986 | { |
1015 | { |
987 | demo () |
1016 | demo () |
988 | { |
1017 | { |
989 | rmg_rndm.seed (time (0)); |
1018 | rmg_rndm.seed (time (0)); |
|
|
1019 | extern void hack();hack (); |
990 | |
1020 | |
991 | for(int i=1;i<100;i++) |
1021 | for(int i=1;i<100;i++) |
992 | { |
1022 | { |
993 | layout maze (40, 30); |
1023 | layout maze (40, 30); |
994 | gen_village (maze); |
1024 | maze.fill_rand (99); |
995 | maze.doorify (); |
1025 | maze.border (); |
|
|
1026 | maze.isolation_remover (2); |
996 | maze.print (); |
1027 | maze.print (); |
997 | exit(0); |
|
|
998 | } |
1028 | } |
999 | |
1029 | |
1000 | exit (1); |
1030 | exit (1); |
1001 | } |
1031 | } |
1002 | } demo; |
1032 | } demo; |