| 1 | /* |
1 | /* |
| 2 | * static char *rcsid_map_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * "$Id: random_map.h,v 1.5 2006/12/15 20:08:45 root Exp $"; |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
|
|
9 | * the terms of the Affero GNU General Public License as published by the |
|
|
10 | * Free Software Foundation, either version 3 of the License, or (at your |
|
|
11 | * option) any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, |
|
|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
16 | * GNU General Public License for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the Affero GNU General Public License |
|
|
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
|
|
21 | * |
|
|
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 4 | */ |
23 | */ |
| 5 | |
|
|
| 6 | /* |
|
|
| 7 | CrossFire, A Multiplayer game for X-windows |
|
|
| 8 | |
|
|
| 9 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
|
|
| 10 | Copyright (C) 1992 Frank Tore Johansen |
|
|
| 11 | |
|
|
| 12 | This program is free software; you can redistribute it and/or modify |
|
|
| 13 | it under the terms of the GNU General Public License as published by |
|
|
| 14 | the Free Software Foundation; either version 2 of the License, or |
|
|
| 15 | (at your option) any later version. |
|
|
| 16 | |
|
|
| 17 | This program is distributed in the hope that it will be useful, |
|
|
| 18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
| 19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
| 20 | GNU General Public License for more details. |
|
|
| 21 | |
|
|
| 22 | You should have received a copy of the GNU General Public License |
|
|
| 23 | along with this program; if not, write to the Free Software |
|
|
| 24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
| 25 | |
|
|
| 26 | The authors can be reached via e-mail at crossfire@schmorp.de |
|
|
| 27 | */ |
|
|
| 28 | |
24 | |
| 29 | #ifndef RANDOM_MAP_H |
25 | #ifndef RANDOM_MAP_H |
| 30 | #define RANDOM_MAP_H |
26 | #define RANDOM_MAP_H |
| 31 | |
27 | |
| 32 | typedef struct { |
28 | #include "util.h" |
| 33 | char wallstyle[512]; |
29 | |
|
|
30 | struct random_map_params : zero_initialised |
|
|
31 | { |
| 34 | char wall_name[512]; |
32 | char wall_name[512]; |
| 35 | char floorstyle[512]; |
33 | |
| 36 | char monsterstyle[512]; |
34 | int xsize, ysize; |
| 37 | char treasurestyle[512]; |
|
|
| 38 | char layoutstyle[512]; |
|
|
| 39 | char doorstyle[512]; |
|
|
| 40 | char decorstyle[512]; |
|
|
| 41 | char origin_map[512]; |
|
|
| 42 | char final_map[512]; |
|
|
| 43 | char exitstyle[512]; |
|
|
| 44 | char this_map[512]; |
|
|
| 45 | char exit_on_final_map[512]; |
|
|
| 46 | |
|
|
| 47 | int Xsize; |
|
|
| 48 | int Ysize; |
|
|
| 49 | int expand2x; |
35 | int expand2x; |
| 50 | int layoutoptions1; |
36 | int layoutoptions1; |
| 51 | int layoutoptions2; |
37 | int layoutoptions2; |
| 52 | int layoutoptions3; |
38 | int layoutoptions3; |
| 53 | int symmetry; |
39 | int symmetry; |
| 54 | int difficulty; |
40 | int difficulty; |
| 55 | int difficulty_given; |
41 | int difficulty_given; |
| 56 | float difficulty_increase; |
42 | float difficulty_increase; |
|
|
43 | |
| 57 | int dungeon_level; |
44 | int dungeon_level; |
| 58 | int dungeon_depth; |
45 | int dungeon_depth; |
| 59 | int decoroptions; |
46 | |
| 60 | int orientation; |
47 | int orientation; |
| 61 | int origin_y; |
|
|
| 62 | int origin_x; |
|
|
| 63 | int random_seed; |
48 | uint32_t random_seed; |
| 64 | long unsigned int total_map_hp; |
49 | uint64_t total_map_hp; |
| 65 | int map_layout_style; |
50 | int map_layout_style; |
| 66 | int treasureoptions; |
|
|
| 67 | int symmetry_used; |
51 | int symmetry_used; |
| 68 | struct region *region; |
|
|
| 69 | } RMParms; |
|
|
| 70 | |
52 | |
| 71 | int load_parameters(FILE *fp, int bufstate,RMParms *RP); |
53 | HV *hv; |
|
|
54 | void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv }) |
| 72 | |
55 | |
|
|
56 | shstr_tmp as_shstr () const; |
| 73 | |
57 | |
| 74 | #define ONION_LAYOUT 1 |
58 | // fetch something from the options hash |
| 75 | #define MAZE_LAYOUT 2 |
59 | SV *get_sv (const char *option) const; |
| 76 | #define SPIRAL_LAYOUT 3 |
60 | const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const; |
| 77 | #define ROGUELIKE_LAYOUT 4 |
61 | IV get_iv (const char *option, IV fallback = 0) const; |
| 78 | #define SNAKE_LAYOUT 5 |
62 | UV get_uv (const char *option, UV fallback = 0) const; |
| 79 | #define SQUARE_SPIRAL_LAYOUT 6 |
63 | NV get_nv (const char *option, NV fallback = 0) const; |
| 80 | #define NROFLAYOUTS 6 |
64 | |
|
|
65 | void set (const char *option, SV *value) const; |
|
|
66 | void set (const char *option, const_utf8_string value) const; |
|
|
67 | void set (const char *option, IV value) const; |
|
|
68 | void set (const char *option, UV value) const; |
|
|
69 | void set (const char *option, NV value) const; |
|
|
70 | |
|
|
71 | void set (const char *option, int value) const { set (option, (IV)value); } |
|
|
72 | |
|
|
73 | // "private", adjusted sizes |
|
|
74 | int Xsize; |
|
|
75 | int Ysize; |
|
|
76 | |
|
|
77 | random_map_params (); |
|
|
78 | random_map_params (HV *hv); |
|
|
79 | ~random_map_params (); |
|
|
80 | }; |
|
|
81 | |
|
|
82 | enum { |
|
|
83 | LAYOUT_NONE, |
|
|
84 | LAYOUT_ONION, |
|
|
85 | LAYOUT_MAZE, |
|
|
86 | LAYOUT_SPIRAL, |
|
|
87 | LAYOUT_ROGUELIKE, |
|
|
88 | LAYOUT_SNAKE, |
|
|
89 | LAYOUT_SQUARE_SPIRAL, |
|
|
90 | LAYOUT_CAVE, |
|
|
91 | NROFLAYOUTS, |
|
|
92 | }; |
| 81 | |
93 | |
| 82 | /* |
94 | /* |
| 83 | * Move these defines out of room_gen_onion.c to here, as |
95 | * Move these defines out of room_gen_onion.c to here, as |
| 84 | * other files (like square_spiral) also uses them. |
96 | * other files (like square_spiral) also uses them. |
| 85 | |
97 | |
| … | |
… | |
| 92 | 16 irregularly/randomly spaced layers (default: regular) |
104 | 16 irregularly/randomly spaced layers (default: regular) |
| 93 | 32 outer wall off: i.e., no outer wall. |
105 | 32 outer wall off: i.e., no outer wall. |
| 94 | |
106 | |
| 95 | */ |
107 | */ |
| 96 | |
108 | |
| 97 | #define OPT_RANDOM 0 |
109 | enum { |
| 98 | #define OPT_CENTERED 1 |
110 | RMOPT_RANDOM = 0, |
| 99 | #define OPT_LINEAR 2 |
111 | RMOPT_CENTERED = 1, |
| 100 | #define OPT_BOTTOM_C 4 |
112 | RMOPT_LINEAR = 2, |
| 101 | #define OPT_BOTTOM_R 8 |
113 | RMOPT_BOTTOM_C = 4, |
| 102 | #define OPT_IRR_SPACE 16 |
114 | RMOPT_BOTTOM_R = 8, |
| 103 | #define OPT_WALL_OFF 32 |
115 | RMOPT_IRR_SPACE = 16, |
| 104 | #define OPT_WALLS_ONLY 64 |
116 | RMOPT_WALL_OFF = 32, |
|
|
117 | RMOPT_WALLS_ONLY = 64, |
| 105 | #define OPT_NO_DOORS 256 /* Place walls insead of doors. Produces broken map. */ |
118 | RMOPT_NO_DOORS = 256, /* Place walls insead of doors. Produces broken map. */ |
| 106 | |
119 | }; |
| 107 | |
|
|
| 108 | |
120 | |
| 109 | /* symmetry definitions--used in this file AND in treasure.c: |
121 | /* symmetry definitions--used in this file AND in treasure.c: |
| 110 | the numerical values matter so don't change them. */ |
122 | the numerical values matter so don't change them. */ |
| 111 | #define RANDOM_SYM 0 |
123 | enum { |
| 112 | #define NO_SYM 1 |
124 | SYMMETRY_RANDOM, |
| 113 | #define X_SYM 2 |
125 | SYMMETRY_NONE, |
| 114 | #define Y_SYM 3 |
126 | SYMMETRY_X, |
| 115 | #define XY_SYM 4 |
127 | SYMMETRY_Y, |
|
|
128 | SYMMETRY_XY, |
|
|
129 | }; |
| 116 | |
130 | |
|
|
131 | // 12 has been experimentally :( determined ot be a lot more stable |
|
|
132 | // than 11 or 10, leading to the assumption that something inherently |
|
|
133 | // needs a minimum size of at least 12 |
| 117 | #define MIN_RANDOM_MAP_SIZE 10 |
134 | #define MIN_RANDOM_MAP_SIZE 12 |
| 118 | |
135 | |
| 119 | /* a macro to get a strongly centered random distribution, |
136 | // we often use signed chars for coordinates (and U8 for distances) |
| 120 | from 0 to x, centered at x/2 */ |
137 | #define MAX_RANDOM_MAP_SIZE 120 |
| 121 | #define BC_RANDOM(x) ((int) ((RANDOM() % (x)+RANDOM()%(x)+RANDOM()%(x))/3.)) |
|
|
| 122 | |
138 | |
| 123 | int set_random_map_variable(RMParms *rp,const char *buf); |
139 | // reference |
|
|
140 | // |
|
|
141 | // \0 floor only |
|
|
142 | // # wall |
|
|
143 | // D door |
|
|
144 | // < up |
|
|
145 | // > down |
|
|
146 | // C "center" (of onion maze) |
|
|
147 | // . ?? (rogue) |
|
|
148 | // |
|
|
149 | |
|
|
150 | // use this in new code |
|
|
151 | INTERFACE_CLASS(layout) |
|
|
152 | struct layout |
|
|
153 | { |
|
|
154 | typedef char cell; |
|
|
155 | |
|
|
156 | cell **data; |
|
|
157 | int w, h; |
|
|
158 | |
|
|
159 | layout (int w, int h); |
|
|
160 | layout (layout ©); |
|
|
161 | ~layout (); |
|
|
162 | |
|
|
163 | operator cell **() const |
|
|
164 | { |
|
|
165 | return data; |
|
|
166 | } |
|
|
167 | |
|
|
168 | void swap (layout &maze) |
|
|
169 | { |
|
|
170 | ::swap (maze.data, data); |
|
|
171 | ::swap (maze.w , w ); |
|
|
172 | ::swap (maze.h , h ); |
|
|
173 | } |
|
|
174 | |
|
|
175 | MTH void swap (layout *maze) { swap (*maze); } |
|
|
176 | |
|
|
177 | // for debugging, print maze to stdout |
|
|
178 | MTH void print () const; |
|
|
179 | |
|
|
180 | // simple inpainting |
|
|
181 | MTH void fill (char fill); |
|
|
182 | MTH void clear () { fill (0); } |
|
|
183 | MTH void border (char fill = '#'); |
|
|
184 | MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
|
|
185 | MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
|
|
186 | |
|
|
187 | MTH void fill_rand (int perc); |
|
|
188 | |
|
|
189 | // makes sure all areas are connected |
|
|
190 | MTH void isolation_remover (); |
|
|
191 | |
|
|
192 | // generates a cave, subtype 0 is a rough cave, randomly open or closed |
|
|
193 | MTH void gen_cave (int subtype); |
|
|
194 | |
|
|
195 | // helper functions to modify the maze |
|
|
196 | MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1); |
|
|
197 | MTH void doorify (); |
|
|
198 | MTH void roomify (); // make some rooms in it, works best on onions |
|
|
199 | MTH void expand2x (); |
|
|
200 | MTH void symmetrize (int symmetry); |
|
|
201 | MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees |
|
|
202 | |
|
|
203 | void generate (random_map_params *RP); |
|
|
204 | private: |
|
|
205 | void alloc (int w, int h); |
|
|
206 | }; |
|
|
207 | |
|
|
208 | // utility functions, to use rmg_rndm instead of rndm. |
|
|
209 | static inline int |
|
|
210 | rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
|
|
211 | { |
|
|
212 | swap (rmg_rndm, rndm); |
|
|
213 | int i = find_free_spot (ob, m, x, y, start, stop); |
|
|
214 | swap (rmg_rndm, rndm); |
|
|
215 | return i; |
|
|
216 | } |
|
|
217 | |
|
|
218 | // a simple point helper struct |
|
|
219 | struct point |
|
|
220 | { |
|
|
221 | short x; |
|
|
222 | short y; |
|
|
223 | |
|
|
224 | point () |
|
|
225 | { |
|
|
226 | } |
|
|
227 | |
|
|
228 | point (int x, int y) |
|
|
229 | : x(x), y(y) |
|
|
230 | { |
|
|
231 | } |
|
|
232 | }; |
|
|
233 | |
|
|
234 | // something like a vector or stack, but without |
|
|
235 | // out of bounds checking |
|
|
236 | template<typename T> |
|
|
237 | struct fixed_stack |
|
|
238 | { |
|
|
239 | T *data; |
|
|
240 | int size; |
|
|
241 | int max; |
|
|
242 | |
|
|
243 | fixed_stack () |
|
|
244 | : size (0), data (0) |
|
|
245 | { |
|
|
246 | } |
|
|
247 | |
|
|
248 | fixed_stack (int max) |
|
|
249 | : size (0), max (max) |
|
|
250 | { |
|
|
251 | data = salloc<T> (max); |
|
|
252 | } |
|
|
253 | |
|
|
254 | void reset (int new_max) |
|
|
255 | { |
|
|
256 | sfree (data, max); |
|
|
257 | size = 0; |
|
|
258 | max = new_max; |
|
|
259 | data = salloc<T> (max); |
|
|
260 | } |
|
|
261 | |
|
|
262 | void free () |
|
|
263 | { |
|
|
264 | sfree (data, max); |
|
|
265 | data = 0; |
|
|
266 | } |
|
|
267 | |
|
|
268 | ~fixed_stack () |
|
|
269 | { |
|
|
270 | sfree (data, max); |
|
|
271 | } |
|
|
272 | |
|
|
273 | T &operator[](int idx) |
|
|
274 | { |
|
|
275 | return data [idx]; |
|
|
276 | } |
|
|
277 | |
|
|
278 | void push (T v) |
|
|
279 | { |
|
|
280 | data [size++] = v; |
|
|
281 | } |
|
|
282 | |
|
|
283 | T &pop () |
|
|
284 | { |
|
|
285 | return data [--size]; |
|
|
286 | } |
|
|
287 | |
|
|
288 | T remove (int idx) |
|
|
289 | { |
|
|
290 | T v = data [idx]; |
|
|
291 | |
|
|
292 | data [idx] = data [--size]; |
|
|
293 | |
|
|
294 | return v; |
|
|
295 | } |
|
|
296 | }; |
| 124 | |
297 | |
| 125 | #endif |
298 | #endif |
|
|
299 | |
