1 |
elmex |
1.1 |
/* |
2 |
root |
1.31 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
pippijn |
1.20 |
* |
4 |
root |
1.47 |
* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
root |
1.46 |
* Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 |
|
|
* Copyright (©) 1992 Frank Tore Johansen |
7 |
pippijn |
1.20 |
* |
8 |
root |
1.42 |
* 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 |
pippijn |
1.20 |
* |
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 |
root |
1.30 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
pippijn |
1.20 |
* GNU General Public License for more details. |
17 |
|
|
* |
18 |
root |
1.42 |
* 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 |
root |
1.30 |
* |
22 |
root |
1.31 |
* The authors can be reached via e-mail to <support@deliantra.net> |
23 |
pippijn |
1.20 |
*/ |
24 |
elmex |
1.1 |
|
25 |
|
|
#include <time.h> |
26 |
|
|
#include <stdio.h> |
27 |
|
|
#include <global.h> |
28 |
|
|
#include <random_map.h> |
29 |
|
|
#include <rproto.h> |
30 |
|
|
#include <sproto.h> |
31 |
|
|
|
32 |
root |
1.39 |
#define CEDE coroapi::cede_to_tick () |
33 |
root |
1.22 |
|
34 |
root |
1.34 |
static void symmetrize_layout (Layout maze, random_map_params *RP); |
35 |
|
|
static void rotate_layout (Layout maze, int rotation); |
36 |
root |
1.33 |
|
37 |
root |
1.3 |
void |
38 |
root |
1.34 |
dump_layout (Layout layout) |
39 |
root |
1.3 |
{ |
40 |
root |
1.36 |
for (int j = 0; j < layout->h; j++) |
41 |
root |
1.34 |
{ |
42 |
root |
1.36 |
for (int i = 0; i < layout->w; i++) |
43 |
root |
1.34 |
putc (layout[i][j] ? layout[i][j] : ' ', stdout); |
44 |
|
|
|
45 |
|
|
putc ('\n', stdout); |
46 |
|
|
} |
47 |
root |
1.3 |
|
48 |
root |
1.34 |
putc ('\n', stdout); |
49 |
elmex |
1.1 |
} |
50 |
root |
1.8 |
|
51 |
root |
1.34 |
/* takes a map and makes it symmetric: adjusts Xsize and |
52 |
|
|
* Ysize to produce a symmetric map. |
53 |
|
|
*/ |
54 |
root |
1.33 |
static void |
55 |
root |
1.34 |
symmetrize_layout (Layout layout, random_map_params *RP) |
56 |
root |
1.3 |
{ |
57 |
root |
1.33 |
if (RP->symmetry_used == SYMMETRY_NONE) |
58 |
|
|
return; |
59 |
root |
1.32 |
|
60 |
root |
1.34 |
Layout sym_layout ( |
61 |
|
|
RP->symmetry_used == SYMMETRY_X || RP->symmetry_used == SYMMETRY_XY ? layout->w * 2 - 3 : layout->w, |
62 |
|
|
RP->symmetry_used == SYMMETRY_Y || RP->symmetry_used == SYMMETRY_XY ? layout->h * 2 - 3 : layout->h |
63 |
root |
1.33 |
); |
64 |
root |
1.32 |
|
65 |
root |
1.33 |
if (RP->symmetry_used == SYMMETRY_X) |
66 |
root |
1.34 |
for (int i = 0; i < sym_layout->w / 2 + 1; i++) |
67 |
|
|
for (int j = 0; j < sym_layout->h; j++) |
68 |
root |
1.3 |
{ |
69 |
root |
1.34 |
sym_layout[i ][j] = |
70 |
|
|
sym_layout[sym_layout->w - i - 1][j] = layout[i][j]; |
71 |
root |
1.32 |
} |
72 |
|
|
|
73 |
root |
1.33 |
if (RP->symmetry_used == SYMMETRY_Y) |
74 |
root |
1.34 |
for (int i = 0; i < sym_layout->w; i++) |
75 |
|
|
for (int j = 0; j < sym_layout->h / 2 + 1; j++) |
76 |
root |
1.3 |
{ |
77 |
root |
1.34 |
sym_layout[i][j ] = |
78 |
|
|
sym_layout[i][sym_layout->h - j - 1] = layout[i][j]; |
79 |
root |
1.3 |
} |
80 |
root |
1.32 |
|
81 |
root |
1.33 |
if (RP->symmetry_used == SYMMETRY_XY) |
82 |
root |
1.34 |
for (int i = 0; i < sym_layout->w / 2 + 1; i++) |
83 |
|
|
for (int j = 0; j < sym_layout->h / 2 + 1; j++) |
84 |
root |
1.3 |
{ |
85 |
root |
1.34 |
sym_layout[i ][j ] = |
86 |
|
|
sym_layout[i ][sym_layout->h - j - 1] = |
87 |
|
|
sym_layout[sym_layout->w - i - 1][j ] = |
88 |
|
|
sym_layout[sym_layout->w - i - 1][sym_layout->h - j - 1] = layout[i][j]; |
89 |
root |
1.3 |
} |
90 |
root |
1.32 |
|
91 |
root |
1.34 |
layout.swap (sym_layout); |
92 |
|
|
sym_layout.free (); |
93 |
root |
1.32 |
|
94 |
elmex |
1.1 |
/* reconnect disjointed spirals */ |
95 |
root |
1.34 |
/* reconnect disjointed nethacklayouts: the routine for |
96 |
root |
1.3 |
spirals will do the trick? */ |
97 |
root |
1.33 |
if (RP->map_layout_style == LAYOUT_SPIRAL |
98 |
|
|
|| RP->map_layout_style == LAYOUT_ROGUELIKE) |
99 |
root |
1.34 |
connect_spirals (layout->w, layout->h, RP->symmetry_used, layout); |
100 |
elmex |
1.1 |
} |
101 |
|
|
|
102 |
|
|
/* takes a map and rotates it. This completes the |
103 |
|
|
onion layouts, making them possibly centered on any wall. |
104 |
|
|
It'll modify Xsize and Ysize if they're swapped. |
105 |
|
|
*/ |
106 |
root |
1.33 |
static void |
107 |
root |
1.34 |
rotate_layout (Layout layout, int rotation) |
108 |
root |
1.3 |
{ |
109 |
root |
1.34 |
int w = layout->w; |
110 |
|
|
int h = layout->h; |
111 |
|
|
|
112 |
root |
1.3 |
switch (rotation) |
113 |
|
|
{ |
114 |
root |
1.13 |
case 2: /* a reflection */ |
115 |
root |
1.11 |
{ |
116 |
root |
1.34 |
Layout new_layout (w, h); |
117 |
root |
1.32 |
|
118 |
root |
1.34 |
for (int i = 0; i < w; i++) /* copy a reflection back */ |
119 |
|
|
for (int j = 0; j < h; j++) |
120 |
|
|
new_layout[i][j] = layout[w - i - 1][h - j - 1]; |
121 |
root |
1.11 |
|
122 |
root |
1.34 |
layout.swap (new_layout); |
123 |
|
|
new_layout.free (); |
124 |
root |
1.11 |
} |
125 |
root |
1.34 |
break; |
126 |
root |
1.32 |
|
127 |
root |
1.11 |
case 1: |
128 |
|
|
case 3: |
129 |
|
|
{ |
130 |
root |
1.34 |
Layout new_layout (h, w); |
131 |
root |
1.32 |
|
132 |
root |
1.13 |
if (rotation == 1) /* swap x and y */ |
133 |
root |
1.34 |
for (int i = 0; i < w; i++) |
134 |
|
|
for (int j = 0; j < h; j++) |
135 |
|
|
new_layout[j][i] = layout[i][j]; |
136 |
root |
1.3 |
|
137 |
root |
1.32 |
if (rotation == 3) /* swap x and y */ |
138 |
root |
1.34 |
for (int i = 0; i < w; i++) |
139 |
|
|
for (int j = 0; j < h; j++) |
140 |
|
|
new_layout[j][i] = layout[w - i - 1][h - j - 1]; |
141 |
root |
1.33 |
|
142 |
root |
1.34 |
layout.swap (new_layout); |
143 |
|
|
new_layout.free (); |
144 |
root |
1.11 |
} |
145 |
root |
1.34 |
break; |
146 |
elmex |
1.1 |
} |
147 |
|
|
} |
148 |
|
|
|
149 |
|
|
/* checks the layout to see if I can stick a horizontal(dir = 0) wall |
150 |
|
|
(or vertical, dir == 1) |
151 |
|
|
here which ends up on other walls sensibly. */ |
152 |
root |
1.44 |
static int |
153 |
root |
1.13 |
can_make_wall (char **maze, int dx, int dy, int dir, random_map_params *RP) |
154 |
root |
1.3 |
{ |
155 |
elmex |
1.1 |
int i1; |
156 |
root |
1.3 |
int length = 0; |
157 |
elmex |
1.1 |
|
158 |
|
|
/* dont make walls if we're on the edge. */ |
159 |
root |
1.3 |
if (dx == 0 || dx == (RP->Xsize - 1) || dy == 0 || dy == (RP->Ysize - 1)) |
160 |
|
|
return -1; |
161 |
elmex |
1.1 |
|
162 |
|
|
/* don't make walls if we're ON a wall. */ |
163 |
root |
1.3 |
if (maze[dx][dy] != 0) |
164 |
|
|
return -1; |
165 |
elmex |
1.1 |
|
166 |
root |
1.3 |
if (dir == 0) /* horizontal */ |
167 |
elmex |
1.1 |
{ |
168 |
|
|
int y = dy; |
169 |
root |
1.3 |
|
170 |
|
|
for (i1 = dx - 1; i1 > 0; i1--) |
171 |
|
|
{ |
172 |
|
|
int sindex = surround_flag2 (maze, i1, y, RP); |
173 |
|
|
|
174 |
|
|
if (sindex == 1) |
175 |
|
|
break; |
176 |
|
|
if (sindex != 0) |
177 |
|
|
return -1; /* can't make horiz. wall here */ |
178 |
|
|
if (maze[i1][y] != 0) |
179 |
|
|
return -1; /* can't make horiz. wall here */ |
180 |
|
|
length++; |
181 |
|
|
} |
182 |
|
|
|
183 |
|
|
for (i1 = dx + 1; i1 < RP->Xsize - 1; i1++) |
184 |
|
|
{ |
185 |
|
|
int sindex = surround_flag2 (maze, i1, y, RP); |
186 |
|
|
|
187 |
|
|
if (sindex == 2) |
188 |
|
|
break; |
189 |
|
|
if (sindex != 0) |
190 |
|
|
return -1; /* can't make horiz. wall here */ |
191 |
|
|
if (maze[i1][y] != 0) |
192 |
|
|
return -1; /* can't make horiz. wall here */ |
193 |
|
|
length++; |
194 |
|
|
} |
195 |
elmex |
1.1 |
return length; |
196 |
|
|
} |
197 |
root |
1.3 |
else |
198 |
|
|
{ /* vertical */ |
199 |
|
|
int x = dx; |
200 |
|
|
|
201 |
|
|
for (i1 = dy - 1; i1 > 0; i1--) |
202 |
|
|
{ |
203 |
|
|
int sindex = surround_flag2 (maze, x, i1, RP); |
204 |
|
|
|
205 |
|
|
if (sindex == 4) |
206 |
|
|
break; |
207 |
|
|
if (sindex != 0) |
208 |
|
|
return -1; /* can't make vert. wall here */ |
209 |
|
|
if (maze[x][i1] != 0) |
210 |
|
|
return -1; /* can't make horiz. wall here */ |
211 |
|
|
length++; |
212 |
|
|
} |
213 |
|
|
|
214 |
|
|
for (i1 = dy + 1; i1 < RP->Ysize - 1; i1++) |
215 |
|
|
{ |
216 |
root |
1.43 |
int sindex = surround_flag2 (maze, x, i1, RP); |
217 |
|
|
|
218 |
|
|
if (sindex == 8) |
219 |
|
|
break; |
220 |
|
|
if (sindex != 0) |
221 |
|
|
return -1; /* can't make verti. wall here */ |
222 |
|
|
if (maze[x][i1] != 0) |
223 |
|
|
return -1; /* can't make horiz. wall here */ |
224 |
|
|
length++; |
225 |
|
|
} |
226 |
|
|
|
227 |
|
|
return length; |
228 |
|
|
} |
229 |
|
|
|
230 |
|
|
return -1; |
231 |
|
|
} |
232 |
|
|
|
233 |
|
|
/* take a layout and make some rooms in it. |
234 |
|
|
--works best on onions.*/ |
235 |
root |
1.44 |
static void |
236 |
root |
1.43 |
roomify_layout (char **maze, random_map_params *RP) |
237 |
|
|
{ |
238 |
|
|
int tries = RP->Xsize * RP->Ysize / 30; |
239 |
|
|
int ti; |
240 |
|
|
|
241 |
|
|
for (ti = 0; ti < tries; ti++) |
242 |
|
|
{ |
243 |
|
|
int dx, dy; /* starting location for looking at creating a door */ |
244 |
|
|
int cx, cy; /* results of checking on creating walls. */ |
245 |
|
|
|
246 |
|
|
dx = rmg_rndm (RP->Xsize); |
247 |
|
|
dy = rmg_rndm (RP->Ysize); |
248 |
|
|
|
249 |
|
|
cx = can_make_wall (maze, dx, dy, 0, RP); /* horizontal */ |
250 |
|
|
cy = can_make_wall (maze, dx, dy, 1, RP); /* vertical */ |
251 |
|
|
if (cx == -1) |
252 |
|
|
{ |
253 |
|
|
if (cy != -1) |
254 |
|
|
make_wall (maze, dx, dy, 1); |
255 |
|
|
|
256 |
|
|
continue; |
257 |
|
|
} |
258 |
|
|
|
259 |
|
|
if (cy == -1) |
260 |
|
|
{ |
261 |
|
|
make_wall (maze, dx, dy, 0); |
262 |
|
|
continue; |
263 |
|
|
} |
264 |
root |
1.3 |
|
265 |
root |
1.43 |
if (cx < cy) |
266 |
|
|
make_wall (maze, dx, dy, 0); |
267 |
|
|
else |
268 |
|
|
make_wall (maze, dx, dy, 1); |
269 |
elmex |
1.1 |
} |
270 |
|
|
} |
271 |
|
|
|
272 |
root |
1.3 |
int |
273 |
|
|
make_wall (char **maze, int x, int y, int dir) |
274 |
|
|
{ |
275 |
|
|
maze[x][y] = 'D'; /* mark a door */ |
276 |
|
|
switch (dir) |
277 |
elmex |
1.1 |
{ |
278 |
root |
1.13 |
case 0: /* horizontal */ |
279 |
|
|
{ |
280 |
|
|
int i1; |
281 |
root |
1.3 |
|
282 |
root |
1.13 |
for (i1 = x - 1; maze[i1][y] == 0; i1--) |
283 |
|
|
maze[i1][y] = '#'; |
284 |
|
|
for (i1 = x + 1; maze[i1][y] == 0; i1++) |
285 |
|
|
maze[i1][y] = '#'; |
286 |
|
|
break; |
287 |
|
|
} |
288 |
|
|
case 1: /* vertical */ |
289 |
|
|
{ |
290 |
|
|
int i1; |
291 |
root |
1.3 |
|
292 |
root |
1.13 |
for (i1 = y - 1; maze[x][i1] == 0; i1--) |
293 |
|
|
maze[x][i1] = '#'; |
294 |
|
|
for (i1 = y + 1; maze[x][i1] == 0; i1++) |
295 |
|
|
maze[x][i1] = '#'; |
296 |
|
|
break; |
297 |
|
|
} |
298 |
elmex |
1.1 |
} |
299 |
|
|
|
300 |
|
|
return 0; |
301 |
|
|
} |
302 |
|
|
|
303 |
|
|
/* puts doors at appropriate locations in a layout. */ |
304 |
root |
1.44 |
static void |
305 |
root |
1.13 |
doorify_layout (char **maze, random_map_params *RP) |
306 |
root |
1.3 |
{ |
307 |
|
|
int ndoors = RP->Xsize * RP->Ysize / 60; /* reasonable number of doors. */ |
308 |
|
|
int doorlocs = 0; /* # of available doorlocations */ |
309 |
|
|
|
310 |
root |
1.41 |
uint16 *doorlist_x = salloc<uint16> (RP->Xsize * RP->Ysize); |
311 |
|
|
uint16 *doorlist_y = salloc<uint16> (RP->Xsize * RP->Ysize); |
312 |
elmex |
1.1 |
|
313 |
|
|
/* make a list of possible door locations */ |
314 |
root |
1.41 |
for (int i = 1; i < RP->Xsize - 1; i++) |
315 |
|
|
for (int j = 1; j < RP->Ysize - 1; j++) |
316 |
root |
1.3 |
{ |
317 |
|
|
int sindex = surround_flag (maze, i, j, RP); |
318 |
|
|
|
319 |
|
|
if (sindex == 3 || sindex == 12) /* these are possible door sindex */ |
320 |
|
|
{ |
321 |
|
|
doorlist_x[doorlocs] = i; |
322 |
|
|
doorlist_y[doorlocs] = j; |
323 |
|
|
doorlocs++; |
324 |
|
|
} |
325 |
|
|
} |
326 |
root |
1.12 |
|
327 |
root |
1.3 |
while (ndoors > 0 && doorlocs > 0) |
328 |
|
|
{ |
329 |
root |
1.41 |
int di = rmg_rndm (doorlocs); |
330 |
|
|
int i = doorlist_x[di]; |
331 |
|
|
int j = doorlist_y[di]; |
332 |
|
|
int sindex = surround_flag (maze, i, j, RP); |
333 |
root |
1.27 |
|
334 |
root |
1.3 |
if (sindex == 3 || sindex == 12) /* these are possible door sindex */ |
335 |
|
|
{ |
336 |
|
|
maze[i][j] = 'D'; |
337 |
|
|
ndoors--; |
338 |
elmex |
1.1 |
} |
339 |
root |
1.27 |
|
340 |
root |
1.3 |
/* reduce the size of the list */ |
341 |
|
|
doorlocs--; |
342 |
|
|
doorlist_x[di] = doorlist_x[doorlocs]; |
343 |
|
|
doorlist_y[di] = doorlist_y[doorlocs]; |
344 |
elmex |
1.1 |
} |
345 |
root |
1.12 |
|
346 |
root |
1.32 |
sfree (doorlist_x, RP->Xsize * RP->Ysize); |
347 |
|
|
sfree (doorlist_y, RP->Xsize * RP->Ysize); |
348 |
elmex |
1.1 |
} |
349 |
|
|
|
350 |
root |
1.3 |
void |
351 |
root |
1.13 |
write_map_parameters_to_string (char *buf, random_map_params *RP) |
352 |
root |
1.3 |
{ |
353 |
root |
1.18 |
char small_buf[16384]; |
354 |
elmex |
1.1 |
|
355 |
root |
1.24 |
sprintf (buf, "xsize %d\nysize %d\n", RP->xsize, RP->ysize); |
356 |
root |
1.3 |
|
357 |
|
|
if (RP->wallstyle[0]) |
358 |
|
|
{ |
359 |
|
|
sprintf (small_buf, "wallstyle %s\n", RP->wallstyle); |
360 |
|
|
strcat (buf, small_buf); |
361 |
|
|
} |
362 |
|
|
|
363 |
root |
1.49 |
if (RP->miningstyle[0]) |
364 |
|
|
{ |
365 |
|
|
sprintf (small_buf, "miningstyle %s\n", RP->miningstyle); |
366 |
|
|
strcat (buf, small_buf); |
367 |
|
|
} |
368 |
|
|
|
369 |
root |
1.3 |
if (RP->floorstyle[0]) |
370 |
|
|
{ |
371 |
|
|
sprintf (small_buf, "floorstyle %s\n", RP->floorstyle); |
372 |
|
|
strcat (buf, small_buf); |
373 |
|
|
} |
374 |
|
|
|
375 |
|
|
if (RP->monsterstyle[0]) |
376 |
|
|
{ |
377 |
|
|
sprintf (small_buf, "monsterstyle %s\n", RP->monsterstyle); |
378 |
|
|
strcat (buf, small_buf); |
379 |
|
|
} |
380 |
elmex |
1.1 |
|
381 |
root |
1.3 |
if (RP->treasurestyle[0]) |
382 |
|
|
{ |
383 |
|
|
sprintf (small_buf, "treasurestyle %s\n", RP->treasurestyle); |
384 |
|
|
strcat (buf, small_buf); |
385 |
|
|
} |
386 |
elmex |
1.1 |
|
387 |
root |
1.3 |
if (RP->layoutstyle[0]) |
388 |
|
|
{ |
389 |
|
|
sprintf (small_buf, "layoutstyle %s\n", RP->layoutstyle); |
390 |
|
|
strcat (buf, small_buf); |
391 |
|
|
} |
392 |
elmex |
1.1 |
|
393 |
root |
1.3 |
if (RP->decorstyle[0]) |
394 |
|
|
{ |
395 |
|
|
sprintf (small_buf, "decorstyle %s\n", RP->decorstyle); |
396 |
|
|
strcat (buf, small_buf); |
397 |
|
|
} |
398 |
elmex |
1.1 |
|
399 |
root |
1.3 |
if (RP->doorstyle[0]) |
400 |
|
|
{ |
401 |
|
|
sprintf (small_buf, "doorstyle %s\n", RP->doorstyle); |
402 |
|
|
strcat (buf, small_buf); |
403 |
|
|
} |
404 |
elmex |
1.1 |
|
405 |
root |
1.3 |
if (RP->exitstyle[0]) |
406 |
|
|
{ |
407 |
|
|
sprintf (small_buf, "exitstyle %s\n", RP->exitstyle); |
408 |
|
|
strcat (buf, small_buf); |
409 |
|
|
} |
410 |
elmex |
1.1 |
|
411 |
root |
1.14 |
if (RP->final_map.length ()) |
412 |
root |
1.3 |
{ |
413 |
root |
1.14 |
sprintf (small_buf, "final_map %s\n", &RP->final_map); |
414 |
root |
1.3 |
strcat (buf, small_buf); |
415 |
|
|
} |
416 |
elmex |
1.1 |
|
417 |
root |
1.3 |
if (RP->exit_on_final_map[0]) |
418 |
|
|
{ |
419 |
|
|
sprintf (small_buf, "exit_on_final_map %s\n", RP->exit_on_final_map); |
420 |
|
|
strcat (buf, small_buf); |
421 |
|
|
} |
422 |
elmex |
1.1 |
|
423 |
root |
1.14 |
if (RP->this_map.length ()) |
424 |
root |
1.3 |
{ |
425 |
root |
1.14 |
sprintf (small_buf, "origin_map %s\n", &RP->this_map); |
426 |
root |
1.3 |
strcat (buf, small_buf); |
427 |
|
|
} |
428 |
elmex |
1.1 |
|
429 |
root |
1.3 |
if (RP->expand2x) |
430 |
|
|
{ |
431 |
|
|
sprintf (small_buf, "expand2x %d\n", RP->expand2x); |
432 |
|
|
strcat (buf, small_buf); |
433 |
|
|
} |
434 |
elmex |
1.1 |
|
435 |
root |
1.3 |
if (RP->layoutoptions1) |
436 |
|
|
{ |
437 |
|
|
sprintf (small_buf, "layoutoptions1 %d\n", RP->layoutoptions1); |
438 |
|
|
strcat (buf, small_buf); |
439 |
|
|
} |
440 |
elmex |
1.1 |
|
441 |
root |
1.3 |
if (RP->layoutoptions2) |
442 |
|
|
{ |
443 |
|
|
sprintf (small_buf, "layoutoptions2 %d\n", RP->layoutoptions2); |
444 |
|
|
strcat (buf, small_buf); |
445 |
|
|
} |
446 |
elmex |
1.1 |
|
447 |
root |
1.3 |
if (RP->layoutoptions3) |
448 |
|
|
{ |
449 |
|
|
sprintf (small_buf, "layoutoptions3 %d\n", RP->layoutoptions3); |
450 |
|
|
strcat (buf, small_buf); |
451 |
|
|
} |
452 |
elmex |
1.1 |
|
453 |
root |
1.3 |
if (RP->symmetry) |
454 |
|
|
{ |
455 |
|
|
sprintf (small_buf, "symmetry %d\n", RP->symmetry); |
456 |
|
|
strcat (buf, small_buf); |
457 |
|
|
} |
458 |
elmex |
1.1 |
|
459 |
root |
1.3 |
if (RP->difficulty && RP->difficulty_given) |
460 |
|
|
{ |
461 |
|
|
sprintf (small_buf, "difficulty %d\n", RP->difficulty); |
462 |
|
|
strcat (buf, small_buf); |
463 |
|
|
} |
464 |
elmex |
1.1 |
|
465 |
root |
1.45 |
if (fabs (RP->difficulty_increase - 1.f) >= (1.f / 1024.f)) |
466 |
root |
1.3 |
{ |
467 |
|
|
sprintf (small_buf, "difficulty_increase %f\n", RP->difficulty_increase); |
468 |
|
|
strcat (buf, small_buf); |
469 |
|
|
} |
470 |
elmex |
1.1 |
|
471 |
root |
1.3 |
sprintf (small_buf, "dungeon_level %d\n", RP->dungeon_level); |
472 |
|
|
strcat (buf, small_buf); |
473 |
elmex |
1.1 |
|
474 |
root |
1.3 |
if (RP->dungeon_depth) |
475 |
|
|
{ |
476 |
|
|
sprintf (small_buf, "dungeon_depth %d\n", RP->dungeon_depth); |
477 |
|
|
strcat (buf, small_buf); |
478 |
|
|
} |
479 |
elmex |
1.1 |
|
480 |
root |
1.3 |
if (RP->decoroptions) |
481 |
|
|
{ |
482 |
|
|
sprintf (small_buf, "decoroptions %d\n", RP->decoroptions); |
483 |
|
|
strcat (buf, small_buf); |
484 |
|
|
} |
485 |
elmex |
1.1 |
|
486 |
root |
1.3 |
if (RP->orientation) |
487 |
|
|
{ |
488 |
|
|
sprintf (small_buf, "orientation %d\n", RP->orientation); |
489 |
|
|
strcat (buf, small_buf); |
490 |
|
|
} |
491 |
elmex |
1.1 |
|
492 |
root |
1.3 |
if (RP->origin_x) |
493 |
|
|
{ |
494 |
|
|
sprintf (small_buf, "origin_x %d\n", RP->origin_x); |
495 |
|
|
strcat (buf, small_buf); |
496 |
|
|
} |
497 |
elmex |
1.1 |
|
498 |
root |
1.3 |
if (RP->origin_y) |
499 |
|
|
{ |
500 |
|
|
sprintf (small_buf, "origin_y %d\n", RP->origin_y); |
501 |
|
|
strcat (buf, small_buf); |
502 |
|
|
} |
503 |
root |
1.11 |
|
504 |
root |
1.3 |
if (RP->treasureoptions) |
505 |
|
|
{ |
506 |
|
|
sprintf (small_buf, "treasureoptions %d\n", RP->treasureoptions); |
507 |
|
|
strcat (buf, small_buf); |
508 |
|
|
} |
509 |
root |
1.14 |
|
510 |
|
|
if (RP->random_seed) |
511 |
|
|
{ |
512 |
root |
1.25 |
sprintf (small_buf, "random_seed %u\n", RP->random_seed); |
513 |
root |
1.14 |
strcat (buf, small_buf); |
514 |
|
|
} |
515 |
root |
1.18 |
|
516 |
|
|
if (RP->custom) |
517 |
|
|
{ |
518 |
|
|
sprintf (small_buf, "custom %s\n", RP->custom); |
519 |
|
|
strcat (buf, small_buf); |
520 |
|
|
} |
521 |
elmex |
1.1 |
} |
522 |
|
|
|
523 |
root |
1.34 |
///////////////////////////////////////////////////////////////////////////// |
524 |
|
|
|
525 |
|
|
LayoutData::LayoutData (int w, int h) |
526 |
root |
1.33 |
: w(w), h(h) |
527 |
root |
1.32 |
{ |
528 |
root |
1.33 |
int size = (sizeof (char *) + sizeof (char) * h) * w; |
529 |
root |
1.32 |
|
530 |
root |
1.33 |
col = (char **)salloc<char> (size); |
531 |
root |
1.32 |
|
532 |
root |
1.33 |
char *data = (char *)(col + w); |
533 |
root |
1.32 |
|
534 |
root |
1.33 |
for (int x = w; x--; ) |
535 |
|
|
col [x] = data + x * h; |
536 |
root |
1.32 |
} |
537 |
|
|
|
538 |
root |
1.34 |
LayoutData::~LayoutData () |
539 |
root |
1.32 |
{ |
540 |
root |
1.33 |
int size = (sizeof (char *) + sizeof (char) * h) * w; |
541 |
|
|
|
542 |
root |
1.32 |
sfree ((char *)col, size); |
543 |
|
|
} |
544 |
|
|
|
545 |
root |
1.34 |
void LayoutData::clear (char fill) |
546 |
root |
1.33 |
{ |
547 |
|
|
memset (col [0], fill, w * h); |
548 |
|
|
} |
549 |
|
|
|
550 |
root |
1.34 |
void LayoutData::border (char fill) |
551 |
root |
1.33 |
{ |
552 |
|
|
for (int i = 0; i < w; i++) col [i][0] = col [i][h - 1] = fill; |
553 |
|
|
for (int j = 0; j < h; j++) col [0][j] = col [w - 1][j] = fill; |
554 |
|
|
} |
555 |
|
|
|
556 |
root |
1.43 |
/* function selects the layout function and gives it whatever |
557 |
|
|
arguments it needs. */ |
558 |
root |
1.44 |
static Layout |
559 |
root |
1.43 |
layoutgen (random_map_params *RP) |
560 |
|
|
{ |
561 |
|
|
Layout layout (RP); |
562 |
|
|
|
563 |
|
|
switch (RP->map_layout_style) |
564 |
|
|
{ |
565 |
|
|
case LAYOUT_ONION: |
566 |
|
|
map_gen_onion (layout, RP->layoutoptions1, RP->layoutoptions2); |
567 |
|
|
|
568 |
|
|
if (!(rmg_rndm (3)) && !(RP->layoutoptions1 & RMOPT_WALLS_ONLY)) |
569 |
|
|
roomify_layout (layout, RP); |
570 |
|
|
|
571 |
|
|
break; |
572 |
|
|
|
573 |
|
|
case LAYOUT_MAZE: |
574 |
|
|
maze_gen (layout, rmg_rndm (2)); |
575 |
|
|
|
576 |
|
|
if (!(rmg_rndm (2))) |
577 |
|
|
doorify_layout (layout, RP); |
578 |
|
|
|
579 |
|
|
break; |
580 |
|
|
|
581 |
|
|
case LAYOUT_SPIRAL: |
582 |
|
|
map_gen_spiral (layout, RP->layoutoptions1); |
583 |
|
|
|
584 |
|
|
if (!(rmg_rndm (2))) |
585 |
|
|
doorify_layout (layout, RP); |
586 |
|
|
|
587 |
|
|
break; |
588 |
|
|
|
589 |
|
|
case LAYOUT_ROGUELIKE: |
590 |
|
|
/* Don't put symmetry in rogue maps. There isn't much reason to |
591 |
|
|
* do so in the first place (doesn't make it any more interesting), |
592 |
|
|
* but more importantly, the symmetry code presumes we are symmetrizing |
593 |
|
|
* spirals, or maps with lots of passages - making a symmetric rogue |
594 |
|
|
* map fails because its likely that the passages the symmetry process |
595 |
|
|
* creates may not connect the rooms. |
596 |
|
|
*/ |
597 |
|
|
RP->symmetry_used = SYMMETRY_NONE; |
598 |
|
|
roguelike_layout_gen (layout, RP->layoutoptions1); |
599 |
|
|
/* no doorifying... done already */ |
600 |
|
|
break; |
601 |
|
|
|
602 |
|
|
case LAYOUT_SNAKE: |
603 |
|
|
make_snake_layout (layout, RP->layoutoptions1); |
604 |
|
|
|
605 |
|
|
if (rmg_rndm (2)) |
606 |
|
|
roomify_layout (layout, RP); |
607 |
|
|
|
608 |
|
|
break; |
609 |
|
|
|
610 |
|
|
case LAYOUT_SQUARE_SPIRAL: |
611 |
|
|
make_square_spiral_layout (layout, RP->layoutoptions1); |
612 |
|
|
|
613 |
|
|
if (rmg_rndm (2)) |
614 |
|
|
roomify_layout (layout, RP); |
615 |
|
|
|
616 |
|
|
break; |
617 |
|
|
|
618 |
|
|
default: |
619 |
|
|
abort (); |
620 |
|
|
} |
621 |
|
|
|
622 |
|
|
/* rotate the layout randomly */ |
623 |
|
|
rotate_layout (layout, rmg_rndm (4)); |
624 |
|
|
|
625 |
|
|
symmetrize_layout (layout, RP); |
626 |
|
|
|
627 |
|
|
#ifdef RMAP_DEBUG |
628 |
|
|
dump_layout (layout); |
629 |
|
|
#endif |
630 |
|
|
|
631 |
|
|
if (RP->expand2x) |
632 |
|
|
expand2x (layout); |
633 |
|
|
|
634 |
|
|
return layout; |
635 |
|
|
} |
636 |
|
|
|
637 |
|
|
bool |
638 |
|
|
maptile::generate_random_map (random_map_params *RP) |
639 |
|
|
{ |
640 |
|
|
char buf[16384]; |
641 |
|
|
int i; |
642 |
|
|
|
643 |
|
|
RP->Xsize = RP->xsize; |
644 |
|
|
RP->Ysize = RP->ysize; |
645 |
|
|
|
646 |
|
|
/* pick a random seed, or use the one from the input file */ |
647 |
|
|
RP->random_seed = RP->random_seed |
648 |
|
|
? RP->random_seed + RP->dungeon_level |
649 |
|
|
: time (0); |
650 |
|
|
|
651 |
|
|
// we run "single-threaded" |
652 |
|
|
rmg_rndm.seed (RP->random_seed); |
653 |
|
|
|
654 |
|
|
write_map_parameters_to_string (buf, RP); |
655 |
|
|
|
656 |
|
|
if (RP->difficulty == 0) |
657 |
|
|
{ |
658 |
|
|
RP->difficulty = RP->dungeon_level; /* use this instead of a map difficulty */ |
659 |
|
|
|
660 |
|
|
if (RP->difficulty_increase > 0.001) |
661 |
|
|
RP->difficulty = (int) ((float) RP->dungeon_level * RP->difficulty_increase); |
662 |
|
|
|
663 |
|
|
if (RP->difficulty < 1) |
664 |
|
|
RP->difficulty = 1; |
665 |
|
|
} |
666 |
|
|
else |
667 |
|
|
RP->difficulty_given = 1; |
668 |
|
|
|
669 |
|
|
if (RP->Xsize < MIN_RANDOM_MAP_SIZE) |
670 |
|
|
RP->Xsize = MIN_RANDOM_MAP_SIZE + rmg_rndm (25) + 5; |
671 |
|
|
|
672 |
|
|
if (RP->Ysize < MIN_RANDOM_MAP_SIZE) |
673 |
|
|
RP->Ysize = MIN_RANDOM_MAP_SIZE + rmg_rndm (25) + 5; |
674 |
|
|
|
675 |
|
|
if (RP->symmetry == SYMMETRY_RANDOM) |
676 |
|
|
RP->symmetry_used = rmg_rndm (SYMMETRY_XY) + 1; |
677 |
|
|
else |
678 |
|
|
RP->symmetry_used = RP->symmetry; |
679 |
|
|
|
680 |
|
|
if (RP->symmetry_used == SYMMETRY_Y || RP->symmetry_used == SYMMETRY_XY) |
681 |
|
|
RP->Ysize = RP->Ysize / 2 + 1; |
682 |
|
|
|
683 |
|
|
if (RP->symmetry_used == SYMMETRY_X || RP->symmetry_used == SYMMETRY_XY) |
684 |
|
|
RP->Xsize = RP->Xsize / 2 + 1; |
685 |
|
|
|
686 |
|
|
if (RP->expand2x > 0) |
687 |
|
|
{ |
688 |
|
|
RP->Xsize /= 2; |
689 |
|
|
RP->Ysize /= 2; |
690 |
|
|
} |
691 |
|
|
|
692 |
|
|
RP->map_layout_style = LAYOUT_NONE; |
693 |
|
|
|
694 |
|
|
/* Redo this - there was a lot of redundant code of checking for preset |
695 |
|
|
* layout style and then random layout style. Instead, figure out |
696 |
|
|
* the numeric layoutstyle, so there is only one area that actually |
697 |
|
|
* calls the code to make the maps. |
698 |
|
|
*/ |
699 |
|
|
if (strstr (RP->layoutstyle, "onion")) |
700 |
|
|
RP->map_layout_style = LAYOUT_ONION; |
701 |
|
|
else if (strstr (RP->layoutstyle, "maze")) |
702 |
|
|
RP->map_layout_style = LAYOUT_MAZE; |
703 |
|
|
else if (strstr (RP->layoutstyle, "spiral")) |
704 |
|
|
RP->map_layout_style = LAYOUT_SPIRAL; |
705 |
|
|
else if (strstr (RP->layoutstyle, "rogue")) |
706 |
|
|
RP->map_layout_style = LAYOUT_ROGUELIKE; |
707 |
|
|
else if (strstr (RP->layoutstyle, "snake")) |
708 |
|
|
RP->map_layout_style = LAYOUT_SNAKE; |
709 |
|
|
else if (strstr (RP->layoutstyle, "squarespiral")) |
710 |
|
|
RP->map_layout_style = LAYOUT_SQUARE_SPIRAL; |
711 |
|
|
else if (RP->map_layout_style == LAYOUT_NONE) |
712 |
|
|
RP->map_layout_style = rmg_rndm (NROFLAYOUTS - 1) + 1; /* No style found - choose one randomly */ |
713 |
|
|
else |
714 |
|
|
abort (); |
715 |
|
|
|
716 |
|
|
Layout layout = layoutgen (RP); |
717 |
|
|
|
718 |
|
|
#ifdef RMAP_DEBUG |
719 |
|
|
dump_layout (layout); |
720 |
|
|
#endif |
721 |
|
|
|
722 |
|
|
/* increment these for the current map */ |
723 |
|
|
++RP->dungeon_level; |
724 |
|
|
|
725 |
|
|
// need to patch RP becasue following code doesn't use the Layout object |
726 |
|
|
RP->Xsize = layout->w; |
727 |
|
|
RP->Ysize = layout->h; |
728 |
|
|
|
729 |
|
|
/* allocate the map and set the floor */ |
730 |
|
|
make_map_floor (layout, RP->floorstyle, RP); |
731 |
|
|
|
732 |
|
|
/* set region */ |
733 |
|
|
default_region = RP->region; |
734 |
|
|
|
735 |
|
|
CEDE; |
736 |
|
|
|
737 |
|
|
place_specials_in_map (this, layout, RP); |
738 |
|
|
|
739 |
|
|
CEDE; |
740 |
|
|
|
741 |
|
|
/* create walls unless the wallstyle is "none" */ |
742 |
|
|
if (strcmp (RP->wallstyle, "none")) |
743 |
|
|
{ |
744 |
root |
1.48 |
make_map_walls (this, layout, RP->wallstyle, RP->miningstyle, RP); |
745 |
root |
1.43 |
|
746 |
|
|
/* place doors unless doorstyle or wallstyle is "none" */ |
747 |
|
|
if (strcmp (RP->doorstyle, "none")) |
748 |
|
|
put_doors (this, layout, RP->doorstyle, RP); |
749 |
|
|
} |
750 |
|
|
|
751 |
|
|
CEDE; |
752 |
|
|
|
753 |
|
|
/* create exits unless the exitstyle is "none" */ |
754 |
|
|
if (strcmp (RP->exitstyle, "none")) |
755 |
|
|
place_exits (this, layout, RP->exitstyle, RP->orientation, RP); |
756 |
|
|
|
757 |
|
|
CEDE; |
758 |
|
|
|
759 |
|
|
/* create monsters unless the monsterstyle is "none" */ |
760 |
|
|
if (strcmp (RP->monsterstyle, "none")) |
761 |
|
|
place_monsters (this, RP->monsterstyle, RP->difficulty, RP); |
762 |
|
|
|
763 |
|
|
CEDE; |
764 |
|
|
|
765 |
|
|
/* treasures needs to have a proper difficulty set for the map. */ |
766 |
|
|
difficulty = estimate_difficulty (); |
767 |
|
|
|
768 |
|
|
CEDE; |
769 |
|
|
|
770 |
|
|
/* create treasure unless the treasurestyle is "none" */ |
771 |
|
|
place_treasure (this, layout, RP->treasurestyle, RP->treasureoptions, RP); |
772 |
|
|
|
773 |
|
|
CEDE; |
774 |
|
|
|
775 |
|
|
/* create decor unless the decorstyle is "none" */ |
776 |
|
|
if (strcmp (RP->decorstyle, "none")) |
777 |
|
|
put_decor (this, layout, RP->decorstyle, RP->decoroptions, RP); |
778 |
|
|
|
779 |
|
|
CEDE; |
780 |
|
|
|
781 |
|
|
/* generate treasures, etc. */ |
782 |
|
|
fix_auto_apply (); |
783 |
|
|
|
784 |
|
|
CEDE; |
785 |
|
|
|
786 |
|
|
unblock_exits (this, layout, RP); |
787 |
|
|
|
788 |
|
|
msg = strdup (buf); |
789 |
|
|
in_memory = MAP_ACTIVE; |
790 |
|
|
|
791 |
|
|
CEDE; |
792 |
|
|
|
793 |
|
|
return 1; |
794 |
|
|
} |
795 |
|
|
|