ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/random_map.C
(Generate patch)

Comparing deliantra/server/random_maps/random_map.C (file contents):
Revision 1.29 by root, Tue Apr 17 10:06:34 2007 UTC vs.
Revision 1.63 by root, Sat Jul 3 01:49:18 2010 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#include <time.h> 25#include <time.h>
26#include <stdio.h> 26#include <stdio.h>
27#include <global.h> 27#include <global.h>
28#include <maze_gen.h>
29#include <room_gen.h>
30#include <random_map.h> 28#include <random_map.h>
31#include <rproto.h> 29#include <rproto.h>
32#include <sproto.h> 30#include <sproto.h>
33 31
34#define CEDE coroapi::cede_to_tick (); rndm.seed (RP->random_seed + __LINE__); 32#define CEDE coroapi::cede_to_tick ()
33
34random_map_params::random_map_params ()
35{
36 hv = newHV ();
37}
38
39random_map_params::random_map_params (HV *hv)
40{
41 this->hv = (HV *)SvREFCNT_inc_NN ((SV *)hv);
42
43 assign (wall_name, get_str ("wall_name"));
44
45 xsize = get_iv ("xsize");
46 ysize = get_iv ("ysize");
47 expand2x = get_iv ("expand2x");
48 layoutoptions1 = get_iv ("layoutoptions1");
49 layoutoptions2 = get_iv ("layoutoptions2");
50 layoutoptions3 = get_iv ("layoutoptions3");
51 symmetry = get_iv ("symmetry");
52 difficulty = get_iv ("difficulty");
53 difficulty_given = get_iv ("difficulty_given");
54 difficulty_increase = get_nv ("difficulty_increase");
55 dungeon_level = get_iv ("dungeon_level");
56 dungeon_depth = get_iv ("dungeon_depth");
57 orientation = get_iv ("orientation");
58 random_seed = get_uv ("random_seed");
59 total_map_hp = get_nv ("total_map_hp"); // actually val64, but I am too lazy
60 map_layout_style = get_iv ("map_layout_style");
61 symmetry_used = get_iv ("symmetry_used");
62}
63
64random_map_params::~random_map_params ()
65{
66 SvREFCNT_dec (hv);
67}
68
69shstr_tmp
70random_map_params::as_shstr () const
71{
72 set ("xsize" , xsize);
73 set ("ysize" , ysize);
74 set ("layoutoptions1" , layoutoptions1);
75 set ("layoutoptions2" , layoutoptions2);
76 set ("layoutoptions3" , layoutoptions3);
77 set ("symmetry" , symmetry);
78 set ("dungeon_depth" , dungeon_depth);
79 set ("orientation" , orientation);
80 set ("random_seed" , (UV)random_seed);
81 set ("difficulty" , difficulty && difficulty_given ? difficulty : 0);
82 set ("difficulty_increase", difficulty_increase);
83 set ("dungeon_level" , dungeon_level);
84
85 dynbuf_text buf;
86 hv_iterinit (hv);
87
88 // does not work for utf-8 keys
89 while (HE *he = hv_iternext (hv))
90 {
91 STRLEN klen; const char *key = HePV (he, klen);
92 STRLEN vlen; const char *value = SvPVutf8 (HeVAL (he), vlen);
93
94 buf.fadd (key, klen);
95 buf << ' ';
96 buf.fadd (value, vlen);
97 buf << '\n';
98 }
99
100 return shstr (buf);
101}
102
103noinline SV *
104random_map_params::get_sv (const char *option) const
105{
106 SV **he = hv_fetch (hv, option, strlen (option), 0);
107
108 return he ? *he : 0;
109}
110
111noinline const_utf8_string
112random_map_params::get_str (const char *option, const_utf8_string fallback) const
113{
114 SV *sv = get_sv (option);
115 return sv ? cfSvPVutf8_nolen (sv) : fallback;
116}
117
118noinline IV
119random_map_params::get_iv (const char *option, IV fallback) const
120{
121 SV *sv = get_sv (option);
122 return sv ? SvIV (sv) : fallback;
123}
124
125noinline UV
126random_map_params::get_uv (const char *option, UV fallback) const
127{
128 SV *sv = get_sv (option);
129 return sv ? SvUV (sv) : fallback;
130}
131
132noinline NV
133random_map_params::get_nv (const char *option, NV fallback) const
134{
135 SV *sv = get_sv (option);
136 return sv ? SvNV (sv) : fallback;
137}
138
139noinline void
140random_map_params::set (const char *option, SV *value) const
141{
142 int len = strlen (option);
143
144 if (value)
145 hv_store (hv, option, len, value, 0);
146 else
147 hv_delete (hv, option, len, G_DISCARD);
148}
149
150noinline void
151random_map_params::set (const char *option, const_utf8_string value) const
152{
153 set (option, value && *value ? newSVpvn_utf8 (value, strlen (value), 1) : 0);
154}
35 155
36void 156void
37dump_layout (char **layout, random_map_params *RP) 157random_map_params::set (const char *option, IV value) const
38{ 158{
39 { 159 set (option, newSViv (value));
40 int i, j; 160}
41 161
42 for (i = 0; i < RP->Xsize; i++) 162void
163random_map_params::set (const char *option, UV value) const
164{
165 set (option, newSVuv (value));
166}
167
168void
169random_map_params::set (const char *option, NV value) const
170{
171 set (option, newSVnv (value));
172}
173
174void
175random_map_params::hv_clone ()
176{
177 HV *copy = newHV ();
178
179 hv_iterinit (hv);
180
181 // does not work for utf-8 keys
182 while (HE *he = hv_iternext (hv))
43 { 183 {
44 for (j = 0; j < RP->Ysize; j++) 184 STRLEN klen; const char *key = HePV (he, klen);
45 { 185 hv_store (copy, key, klen, newSVsv (HeVAL (he)), HeHASH (he));
46 if (layout[i][j] == 0)
47 layout[i][j] = ' ';
48 printf ("%c", layout[i][j]);
49 if (layout[i][j] == ' ')
50 layout[i][j] = 0;
51 }
52 printf ("\n");
53 } 186 }
54 } 187
55 printf ("\n"); 188 SvREFCNT_dec (hv);
189 hv = copy;
56} 190}
57 191
58bool 192bool
59maptile::generate_random_map (random_map_params *RP) 193maptile::generate_random_map (random_map_params *RP)
60{ 194{
61 char **layout, buf[16384];
62 int i;
63
64 RP->Xsize = RP->xsize; 195 RP->Xsize = RP->xsize;
65 RP->Ysize = RP->ysize; 196 RP->Ysize = RP->ysize;
66 197
67 /* pick a random seed, or use the one from the input file */ 198 /* pick a random seed, or use the one from the input file */
68 RP->random_seed = RP->random_seed 199 RP->random_seed = RP->random_seed
69 ? RP->random_seed + RP->dungeon_level 200 ? RP->random_seed + RP->dungeon_level
70 : time (0); 201 : time (0);
71 CEDE;
72 202
73 write_map_parameters_to_string (buf, RP); 203 // we run "single-threaded"
204 rmg_rndm.seed (RP->random_seed);
205
206 shstr buf = RP->as_shstr ();
74 207
75 if (RP->difficulty == 0) 208 if (RP->difficulty == 0)
76 { 209 {
77 RP->difficulty = RP->dungeon_level; /* use this instead of a map difficulty */ 210 RP->difficulty = RP->dungeon_level; /* use this instead of a map difficulty */
78 211
… …
84 } 217 }
85 else 218 else
86 RP->difficulty_given = 1; 219 RP->difficulty_given = 1;
87 220
88 if (RP->Xsize < MIN_RANDOM_MAP_SIZE) 221 if (RP->Xsize < MIN_RANDOM_MAP_SIZE)
89 RP->Xsize = MIN_RANDOM_MAP_SIZE + rndm (25) + 5; 222 RP->Xsize = MIN_RANDOM_MAP_SIZE + rmg_rndm (25) + 5;
90 223
91 if (RP->Ysize < MIN_RANDOM_MAP_SIZE) 224 if (RP->Ysize < MIN_RANDOM_MAP_SIZE)
92 RP->Ysize = MIN_RANDOM_MAP_SIZE + rndm (25) + 5; 225 RP->Ysize = MIN_RANDOM_MAP_SIZE + rmg_rndm (25) + 5;
226
227 min_it (RP->Xsize, MAX_RANDOM_MAP_SIZE);
228 min_it (RP->Ysize, MAX_RANDOM_MAP_SIZE);
93 229
94 if (RP->symmetry == SYMMETRY_RANDOM) 230 if (RP->symmetry == SYMMETRY_RANDOM)
95 RP->symmetry_used = rndm (SYMMETRY_XY) + 1; 231 RP->symmetry_used = rmg_rndm (SYMMETRY_XY) + 1;
96 else 232 else
97 RP->symmetry_used = RP->symmetry; 233 RP->symmetry_used = RP->symmetry;
98 234
99 if (RP->symmetry_used == SYMMETRY_Y || RP->symmetry_used == SYMMETRY_XY) 235 if (RP->symmetry_used == SYMMETRY_Y || RP->symmetry_used == SYMMETRY_XY)
100 RP->Ysize = RP->Ysize / 2 + 1; 236 RP->Ysize = RP->Ysize / 2 + 1;
… …
106 { 242 {
107 RP->Xsize /= 2; 243 RP->Xsize /= 2;
108 RP->Ysize /= 2; 244 RP->Ysize /= 2;
109 } 245 }
110 246
111 RP->map_layout_style = LAYOUT_NONE; 247 const char *layoutstyle = RP->get_str ("layoutstyle", "");
112 248
113 /* Redo this - there was a lot of redundant code of checking for preset
114 * layout style and then random layout style. Instead, figure out
115 * the numeric layoutstyle, so there is only one area that actually
116 * calls the code to make the maps.
117 */
118 if (strstr (RP->layoutstyle, "onion")) 249 if (strstr (layoutstyle, "onion"))
119 RP->map_layout_style = LAYOUT_ONION; 250 RP->map_layout_style = LAYOUT_ONION;
120
121 if (strstr (RP->layoutstyle, "maze")) 251 else if (strstr (layoutstyle, "maze"))
122 RP->map_layout_style = LAYOUT_MAZE; 252 RP->map_layout_style = LAYOUT_MAZE;
123
124 if (strstr (RP->layoutstyle, "spiral")) 253 else if (strstr (layoutstyle, "spiral"))
125 RP->map_layout_style = LAYOUT_SPIRAL; 254 RP->map_layout_style = LAYOUT_SPIRAL;
126
127 if (strstr (RP->layoutstyle, "rogue")) 255 else if (strstr (layoutstyle, "rogue"))
128 RP->map_layout_style = LAYOUT_ROGUELIKE; 256 RP->map_layout_style = LAYOUT_ROGUELIKE;
129
130 if (strstr (RP->layoutstyle, "snake")) 257 else if (strstr (layoutstyle, "snake"))
131 RP->map_layout_style = LAYOUT_SNAKE; 258 RP->map_layout_style = LAYOUT_SNAKE;
132
133 if (strstr (RP->layoutstyle, "squarespiral")) 259 else if (strstr (layoutstyle, "squarespiral"))
134 RP->map_layout_style = LAYOUT_SQUARE_SPIRAL; 260 RP->map_layout_style = LAYOUT_SQUARE_SPIRAL;
135 261 else if (strstr (layoutstyle, "cave"))
136 /* No style found - choose one randomly */
137 if (RP->map_layout_style == LAYOUT_NONE) 262 RP->map_layout_style = LAYOUT_CAVE;
138 RP->map_layout_style = rndm (NROFLAYOUTS - 1) + 1; 263 else
264 RP->map_layout_style = rmg_rndm (NROFLAYOUTS - 1) + 1; /* No style found - choose one randomly */
139 265
140 layout = layoutgen (RP); 266 layout maze (RP->Xsize, RP->Ysize);
141 267 maze.generate (RP);
142#ifdef RMAP_DEBUG
143 dump_layout (layout, RP);
144#endif
145 268
146 /* increment these for the current map */ 269 /* increment these for the current map */
147 RP->dungeon_level += 1; 270 ++RP->dungeon_level;
148 /* allow constant-difficulty maps. */
149 /* difficulty+=1; */
150 271
151 /* rotate the layout randomly */ 272 // need to patch RP becasue following code doesn't use the layout object
152 layout = rotate_layout (layout, rndm (4), RP); 273 RP->Xsize = maze.w;
153#ifdef RMAP_DEBUG 274 RP->Ysize = maze.h;
154 dump_layout (layout, RP);
155#endif
156 275
157 /* allocate the map and set the floor */ 276 /* allocate the map and set the floor */
158 make_map_floor (layout, RP->floorstyle, RP); 277 make_map_floor (maze, RP->get_str ("floorstyle", ""), RP);
159 278
160 /* set region */ 279 /* set region */
161 default_region = RP->region; 280 default_region = region::find (RP->get_str ("region", 0));
162 281
163 CEDE; 282 CEDE;
283
284 place_specials_in_map (this, maze, RP);
285
286 CEDE;
287
288 const char *wallstyle = RP->get_str ("wallstyle", "");
164 289
165 /* create walls unless the wallstyle is "none" */ 290 /* create walls unless the wallstyle is "none" */
166 if (strcmp (RP->wallstyle, "none")) 291 if (strcmp (wallstyle, "none"))
167 { 292 {
168 make_map_walls (this, layout, RP->wallstyle, RP); 293 make_map_walls (this, maze, wallstyle, RP->get_str ("miningstyle", ""), RP);
294
295 const char *doorstyle = RP->get_str ("doorstyle", "");
169 296
170 /* place doors unless doorstyle or wallstyle is "none" */ 297 /* place doors unless doorstyle or wallstyle is "none" */
171 if (strcmp (RP->doorstyle, "none")) 298 if (strcmp (doorstyle, "none"))
172 put_doors (this, layout, RP->doorstyle, RP); 299 put_doors (this, maze, doorstyle, RP);
173 } 300 }
174 301
175 CEDE; 302 CEDE;
303
304 const char *exitstyle = RP->get_str ("exitstyle", "");
176 305
177 /* create exits unless the exitstyle is "none" */ 306 /* create exits unless the exitstyle is "none" */
178 if (strcmp (RP->exitstyle, "none")) 307 if (strcmp (exitstyle, "none"))
179 place_exits (this, layout, RP->exitstyle, RP->orientation, RP); 308 place_exits (this, maze, exitstyle, RP->orientation, RP);
180 309
181 CEDE; 310 CEDE;
182 311
183 place_specials_in_map (this, layout, RP); 312 const char *monsterstyle = RP->get_str ("monsterstyle", "");
184
185 CEDE;
186 313
187 /* create monsters unless the monsterstyle is "none" */ 314 /* create monsters unless the monsterstyle is "none" */
188 if (strcmp (RP->monsterstyle, "none")) 315 if (strcmp (monsterstyle, "none"))
189 place_monsters (this, RP->monsterstyle, RP->difficulty, RP); 316 place_monsters (this, monsterstyle, RP->difficulty, RP);
190 317
191 CEDE; 318 CEDE;
192 319
193 /* treasures needs to have a proper difficulty set for the map. */ 320 /* treasures needs to have a proper difficulty set for the map. */
194 difficulty = estimate_difficulty (); 321 difficulty = estimate_difficulty ();
195 322
196 CEDE; 323 CEDE;
197 324
325 const char *treasurestyle = RP->get_str ("treasurestyle", "");
326
198 /* create treasure unless the treasurestyle is "none" */ 327 /* create treasure unless the treasurestyle is "none" */
199 if (strcmp (RP->treasurestyle, "none"))
200 place_treasure (this, layout, RP->treasurestyle, RP->treasureoptions, RP); 328 place_treasure (this, maze, treasurestyle, RP->get_iv ("treasureoptions"), RP);
201 329
202 CEDE; 330 CEDE;
331
332 const char *decorstyle = RP->get_str ("treasurestyle", "");
203 333
204 /* create decor unless the decorstyle is "none" */ 334 /* create decor unless the decorstyle is "none" */
205 if (strcmp (RP->decorstyle, "none")) 335 if (strcmp (decorstyle, "none"))
206 put_decor (this, layout, RP->decorstyle, RP->decoroptions, RP); 336 put_decor (this, maze, decorstyle, RP->get_iv ("decoroptions"), RP);
207 337
208 CEDE; 338 CEDE;
209 339
210 /* generate treasures, etc. */ 340 /* generate treasures, etc. */
211 fix_auto_apply (); 341 fix_auto_apply ();
212 342
213 CEDE; 343 CEDE;
214 344
215 unblock_exits (this, layout, RP); 345 unblock_exits (this, maze, RP);
216 346
217 /* free the layout */ 347 msg = buf;
218 for (i = 0; i < RP->Xsize; i++)
219 free (layout[i]);
220
221 free (layout);
222
223 msg = strdup (buf);
224 in_memory = MAP_IN_MEMORY; 348 in_memory = MAP_ACTIVE;
225 349
226 CEDE; 350 CEDE;
227 351
228 return 1; 352 return 1;
229} 353}
230 354
231/* function selects the layout function and gives it whatever
232 arguments it needs. */
233char **
234layoutgen (random_map_params *RP)
235{
236 char **maze = 0;
237 int oxsize = RP->Xsize, oysize = RP->Ysize;
238
239 switch (RP->map_layout_style)
240 {
241 case LAYOUT_ONION:
242 maze = map_gen_onion (RP->Xsize, RP->Ysize, RP->layoutoptions1, RP->layoutoptions2);
243 if (!(rndm (3)) && !(RP->layoutoptions1 & RMOPT_WALLS_ONLY))
244 roomify_layout (maze, RP);
245 break;
246
247 case LAYOUT_MAZE:
248 maze = maze_gen (RP->Xsize, RP->Ysize, rndm (2));
249 if (!(rndm (2)))
250 doorify_layout (maze, RP);
251 break;
252
253 case LAYOUT_SPIRAL:
254 maze = map_gen_spiral (RP->Xsize, RP->Ysize, RP->layoutoptions1);
255 if (!(rndm (2)))
256 doorify_layout (maze, RP);
257 break;
258
259 case LAYOUT_ROGUELIKE:
260 /* Don't put symmetry in rogue maps. There isn't much reason to
261 * do so in the first place (doesn't make it any more interesting),
262 * but more importantly, the symmetry code presumes we are symmetrizing
263 * spirals, or maps with lots of passages - making a symmetric rogue
264 * map fails because its likely that the passages the symmetry process
265 * creates may not connect the rooms.
266 */
267 RP->symmetry_used = SYMMETRY_NONE;
268 RP->Ysize = oysize;
269 RP->Xsize = oxsize;
270 maze = roguelike_layout_gen (RP->Xsize, RP->Ysize, RP->layoutoptions1);
271 /* no doorifying... done already */
272 break;
273
274 case LAYOUT_SNAKE:
275 maze = make_snake_layout (RP->Xsize, RP->Ysize, RP->layoutoptions1);
276 if (rndm (2))
277 roomify_layout (maze, RP);
278 break;
279
280 case LAYOUT_SQUARE_SPIRAL:
281 maze = make_square_spiral_layout (RP->Xsize, RP->Ysize, RP->layoutoptions1);
282 if (rndm (2))
283 roomify_layout (maze, RP);
284 break;
285 }
286
287 maze = symmetrize_layout (maze, RP->symmetry_used, RP);
288
289#ifdef RMAP_DEBUG
290 dump_layout (maze, RP);
291#endif
292
293 if (RP->expand2x)
294 {
295 maze = expand2x (maze, RP->Xsize, RP->Ysize);
296 RP->Xsize = RP->Xsize * 2 - 1;
297 RP->Ysize = RP->Ysize * 2 - 1;
298 }
299
300 return maze;
301}
302
303/* takes a map and makes it symmetric: adjusts Xsize and
304Ysize to produce a symmetric map. */
305char **
306symmetrize_layout (char **maze, int sym, random_map_params *RP)
307{
308 int i, j;
309 char **sym_maze;
310 int Xsize_orig, Ysize_orig;
311
312 Xsize_orig = RP->Xsize;
313 Ysize_orig = RP->Ysize;
314 RP->symmetry_used = sym; /* tell everyone else what sort of symmetry is used. */
315 if (sym == SYMMETRY_NONE)
316 {
317 RP->Xsize = Xsize_orig;
318 RP->Ysize = Ysize_orig;
319 return maze;
320 }
321 /* pick new sizes */
322 RP->Xsize = ((sym == SYMMETRY_X || sym == SYMMETRY_XY) ? RP->Xsize * 2 - 3 : RP->Xsize);
323 RP->Ysize = ((sym == SYMMETRY_Y || sym == SYMMETRY_XY) ? RP->Ysize * 2 - 3 : RP->Ysize);
324
325 sym_maze = (char **) calloc (sizeof (char *), RP->Xsize);
326 for (i = 0; i < RP->Xsize; i++)
327 sym_maze[i] = (char *) calloc (sizeof (char), RP->Ysize);
328
329 if (sym == SYMMETRY_X)
330 for (i = 0; i < RP->Xsize / 2 + 1; i++)
331 for (j = 0; j < RP->Ysize; j++)
332 {
333 sym_maze[i][j] = maze[i][j];
334 sym_maze[RP->Xsize - i - 1][j] = maze[i][j];
335 };
336 if (sym == SYMMETRY_Y)
337 for (i = 0; i < RP->Xsize; i++)
338 for (j = 0; j < RP->Ysize / 2 + 1; j++)
339 {
340 sym_maze[i][j] = maze[i][j];
341 sym_maze[i][RP->Ysize - j - 1] = maze[i][j];
342 }
343 if (sym == SYMMETRY_XY)
344 for (i = 0; i < RP->Xsize / 2 + 1; i++)
345 for (j = 0; j < RP->Ysize / 2 + 1; j++)
346 {
347 sym_maze[i][j] = maze[i][j];
348 sym_maze[i][RP->Ysize - j - 1] = maze[i][j];
349 sym_maze[RP->Xsize - i - 1][j] = maze[i][j];
350 sym_maze[RP->Xsize - i - 1][RP->Ysize - j - 1] = maze[i][j];
351 }
352 /* delete the old maze */
353 for (i = 0; i < Xsize_orig; i++)
354 free (maze[i]);
355 free (maze);
356 /* reconnect disjointed spirals */
357 if (RP->map_layout_style == LAYOUT_SPIRAL)
358 connect_spirals (RP->Xsize, RP->Ysize, sym, sym_maze);
359 /* reconnect disjointed nethackmazes: the routine for
360 spirals will do the trick? */
361 if (RP->map_layout_style == LAYOUT_ROGUELIKE)
362 connect_spirals (RP->Xsize, RP->Ysize, sym, sym_maze);
363
364 return sym_maze;
365}
366
367
368/* takes a map and rotates it. This completes the
369 onion layouts, making them possibly centered on any wall.
370 It'll modify Xsize and Ysize if they're swapped.
371*/
372
373char **
374rotate_layout (char **maze, int rotation, random_map_params *RP)
375{
376 char **new_maze;
377 int i, j;
378
379 switch (rotation)
380 {
381 case 0:
382 return maze;
383 break;
384 case 2: /* a reflection */
385 {
386 char *newmaze = (char *) malloc (sizeof (char) * RP->Xsize * RP->Ysize);
387
388 for (i = 0; i < RP->Xsize; i++)
389 { /* make a copy */
390 for (j = 0; j < RP->Ysize; j++)
391 {
392 newmaze[i * RP->Ysize + j] = maze[i][j];
393 }
394 }
395 for (i = 0; i < RP->Xsize; i++)
396 { /* copy a reflection back */
397 for (j = 0; j < RP->Ysize; j++)
398 {
399 maze[i][j] = newmaze[(RP->Xsize - i - 1) * RP->Ysize + RP->Ysize - j - 1];
400 }
401 }
402 free (newmaze);
403 return maze;
404 break;
405 }
406 case 1:
407 case 3:
408 {
409 int swap;
410 new_maze = (char **) calloc (sizeof (char *), RP->Ysize);
411 for (i = 0; i < RP->Ysize; i++)
412 {
413 new_maze[i] = (char *) calloc (sizeof (char), RP->Xsize);
414 }
415 if (rotation == 1) /* swap x and y */
416 for (i = 0; i < RP->Xsize; i++)
417 for (j = 0; j < RP->Ysize; j++)
418 new_maze[j][i] = maze[i][j];
419
420 if (rotation == 3)
421 { /* swap x and y */
422 for (i = 0; i < RP->Xsize; i++)
423 for (j = 0; j < RP->Ysize; j++)
424 new_maze[j][i] = maze[RP->Xsize - i - 1][RP->Ysize - j - 1];
425 }
426
427 /* delete the old layout */
428 for (i = 0; i < RP->Xsize; i++)
429 free (maze[i]);
430 free (maze);
431
432 swap = RP->Ysize;
433 RP->Ysize = RP->Xsize;
434 RP->Xsize = swap;
435 return new_maze;
436 break;
437 }
438 }
439 return NULL;
440}
441
442/* take a layout and make some rooms in it.
443 --works best on onions.*/
444void
445roomify_layout (char **maze, random_map_params *RP)
446{
447 int tries = RP->Xsize * RP->Ysize / 30;
448 int ti;
449
450 for (ti = 0; ti < tries; ti++)
451 {
452 int dx, dy; /* starting location for looking at creating a door */
453 int cx, cy; /* results of checking on creating walls. */
454
455 dx = rndm (RP->Xsize);
456 dy = rndm (RP->Ysize);
457
458 cx = can_make_wall (maze, dx, dy, 0, RP); /* horizontal */
459 cy = can_make_wall (maze, dx, dy, 1, RP); /* vertical */
460 if (cx == -1)
461 {
462 if (cy != -1)
463 make_wall (maze, dx, dy, 1);
464
465 continue;
466 }
467
468 if (cy == -1)
469 {
470 make_wall (maze, dx, dy, 0);
471 continue;
472 }
473
474 if (cx < cy)
475 make_wall (maze, dx, dy, 0);
476 else
477 make_wall (maze, dx, dy, 1);
478 }
479}
480
481/* checks the layout to see if I can stick a horizontal(dir = 0) wall
482 (or vertical, dir == 1)
483 here which ends up on other walls sensibly. */
484
485int
486can_make_wall (char **maze, int dx, int dy, int dir, random_map_params *RP)
487{
488 int i1;
489 int length = 0;
490
491 /* dont make walls if we're on the edge. */
492 if (dx == 0 || dx == (RP->Xsize - 1) || dy == 0 || dy == (RP->Ysize - 1))
493 return -1;
494
495 /* don't make walls if we're ON a wall. */
496 if (maze[dx][dy] != 0)
497 return -1;
498
499 if (dir == 0) /* horizontal */
500 {
501 int y = dy;
502
503 for (i1 = dx - 1; i1 > 0; i1--)
504 {
505 int sindex = surround_flag2 (maze, i1, y, RP);
506
507 if (sindex == 1)
508 break;
509 if (sindex != 0)
510 return -1; /* can't make horiz. wall here */
511 if (maze[i1][y] != 0)
512 return -1; /* can't make horiz. wall here */
513 length++;
514 }
515
516 for (i1 = dx + 1; i1 < RP->Xsize - 1; i1++)
517 {
518 int sindex = surround_flag2 (maze, i1, y, RP);
519
520 if (sindex == 2)
521 break;
522 if (sindex != 0)
523 return -1; /* can't make horiz. wall here */
524 if (maze[i1][y] != 0)
525 return -1; /* can't make horiz. wall here */
526 length++;
527 }
528 return length;
529 }
530 else
531 { /* vertical */
532 int x = dx;
533
534 for (i1 = dy - 1; i1 > 0; i1--)
535 {
536 int sindex = surround_flag2 (maze, x, i1, RP);
537
538 if (sindex == 4)
539 break;
540 if (sindex != 0)
541 return -1; /* can't make vert. wall here */
542 if (maze[x][i1] != 0)
543 return -1; /* can't make horiz. wall here */
544 length++;
545 }
546
547 for (i1 = dy + 1; i1 < RP->Ysize - 1; i1++)
548 {
549 int sindex = surround_flag2 (maze, x, i1, RP);
550
551 if (sindex == 8)
552 break;
553 if (sindex != 0)
554 return -1; /* can't make verti. wall here */
555 if (maze[x][i1] != 0)
556 return -1; /* can't make horiz. wall here */
557 length++;
558 }
559 return length;
560 }
561 return -1;
562}
563
564
565int
566make_wall (char **maze, int x, int y, int dir)
567{
568 maze[x][y] = 'D'; /* mark a door */
569 switch (dir)
570 {
571 case 0: /* horizontal */
572 {
573 int i1;
574
575 for (i1 = x - 1; maze[i1][y] == 0; i1--)
576 maze[i1][y] = '#';
577 for (i1 = x + 1; maze[i1][y] == 0; i1++)
578 maze[i1][y] = '#';
579 break;
580 }
581 case 1: /* vertical */
582 {
583 int i1;
584
585 for (i1 = y - 1; maze[x][i1] == 0; i1--)
586 maze[x][i1] = '#';
587 for (i1 = y + 1; maze[x][i1] == 0; i1++)
588 maze[x][i1] = '#';
589 break;
590 }
591 }
592
593 return 0;
594}
595
596/* puts doors at appropriate locations in a layout. */
597void
598doorify_layout (char **maze, random_map_params *RP)
599{
600 int ndoors = RP->Xsize * RP->Ysize / 60; /* reasonable number of doors. */
601 char *doorlist_x;
602 char *doorlist_y;
603 int doorlocs = 0; /* # of available doorlocations */
604 int i, j;
605
606 doorlist_x = (char *) malloc (sizeof (int) * RP->Xsize * RP->Ysize);
607 doorlist_y = (char *) malloc (sizeof (int) * RP->Xsize * RP->Ysize);
608
609
610 /* make a list of possible door locations */
611 for (i = 1; i < RP->Xsize - 1; i++)
612 for (j = 1; j < RP->Ysize - 1; j++)
613 {
614 int sindex = surround_flag (maze, i, j, RP);
615
616 if (sindex == 3 || sindex == 12) /* these are possible door sindex */
617 {
618 doorlist_x[doorlocs] = i;
619 doorlist_y[doorlocs] = j;
620 doorlocs++;
621 }
622 }
623
624 while (ndoors > 0 && doorlocs > 0)
625 {
626 int di;
627 int sindex;
628
629 di = rndm (doorlocs);
630 i = doorlist_x[di];
631 j = doorlist_y[di];
632 sindex = surround_flag (maze, i, j, RP);
633
634 if (sindex == 3 || sindex == 12) /* these are possible door sindex */
635 {
636 maze[i][j] = 'D';
637 ndoors--;
638 }
639
640 /* reduce the size of the list */
641 doorlocs--;
642 doorlist_x[di] = doorlist_x[doorlocs];
643 doorlist_y[di] = doorlist_y[doorlocs];
644 }
645
646 free (doorlist_x);
647 free (doorlist_y);
648}
649
650void
651write_map_parameters_to_string (char *buf, random_map_params *RP)
652{
653 char small_buf[16384];
654
655 sprintf (buf, "xsize %d\nysize %d\n", RP->xsize, RP->ysize);
656
657 if (RP->wallstyle[0])
658 {
659 sprintf (small_buf, "wallstyle %s\n", RP->wallstyle);
660 strcat (buf, small_buf);
661 }
662
663 if (RP->floorstyle[0])
664 {
665 sprintf (small_buf, "floorstyle %s\n", RP->floorstyle);
666 strcat (buf, small_buf);
667 }
668
669 if (RP->monsterstyle[0])
670 {
671 sprintf (small_buf, "monsterstyle %s\n", RP->monsterstyle);
672 strcat (buf, small_buf);
673 }
674
675 if (RP->treasurestyle[0])
676 {
677 sprintf (small_buf, "treasurestyle %s\n", RP->treasurestyle);
678 strcat (buf, small_buf);
679 }
680
681 if (RP->layoutstyle[0])
682 {
683 sprintf (small_buf, "layoutstyle %s\n", RP->layoutstyle);
684 strcat (buf, small_buf);
685 }
686
687 if (RP->decorstyle[0])
688 {
689 sprintf (small_buf, "decorstyle %s\n", RP->decorstyle);
690 strcat (buf, small_buf);
691 }
692
693 if (RP->doorstyle[0])
694 {
695 sprintf (small_buf, "doorstyle %s\n", RP->doorstyle);
696 strcat (buf, small_buf);
697 }
698
699 if (RP->exitstyle[0])
700 {
701 sprintf (small_buf, "exitstyle %s\n", RP->exitstyle);
702 strcat (buf, small_buf);
703 }
704
705 if (RP->final_map.length ())
706 {
707 sprintf (small_buf, "final_map %s\n", &RP->final_map);
708 strcat (buf, small_buf);
709 }
710
711 if (RP->exit_on_final_map[0])
712 {
713 sprintf (small_buf, "exit_on_final_map %s\n", RP->exit_on_final_map);
714 strcat (buf, small_buf);
715 }
716
717 if (RP->this_map.length ())
718 {
719 sprintf (small_buf, "origin_map %s\n", &RP->this_map);
720 strcat (buf, small_buf);
721 }
722
723 if (RP->expand2x)
724 {
725 sprintf (small_buf, "expand2x %d\n", RP->expand2x);
726 strcat (buf, small_buf);
727 }
728
729 if (RP->layoutoptions1)
730 {
731 sprintf (small_buf, "layoutoptions1 %d\n", RP->layoutoptions1);
732 strcat (buf, small_buf);
733 }
734
735 if (RP->layoutoptions2)
736 {
737 sprintf (small_buf, "layoutoptions2 %d\n", RP->layoutoptions2);
738 strcat (buf, small_buf);
739 }
740
741 if (RP->layoutoptions3)
742 {
743 sprintf (small_buf, "layoutoptions3 %d\n", RP->layoutoptions3);
744 strcat (buf, small_buf);
745 }
746
747 if (RP->symmetry)
748 {
749 sprintf (small_buf, "symmetry %d\n", RP->symmetry);
750 strcat (buf, small_buf);
751 }
752
753 if (RP->difficulty && RP->difficulty_given)
754 {
755 sprintf (small_buf, "difficulty %d\n", RP->difficulty);
756 strcat (buf, small_buf);
757 }
758
759 if (RP->difficulty_increase != 1.0)
760 {
761 sprintf (small_buf, "difficulty_increase %f\n", RP->difficulty_increase);
762 strcat (buf, small_buf);
763 }
764
765 sprintf (small_buf, "dungeon_level %d\n", RP->dungeon_level);
766 strcat (buf, small_buf);
767
768 if (RP->dungeon_depth)
769 {
770 sprintf (small_buf, "dungeon_depth %d\n", RP->dungeon_depth);
771 strcat (buf, small_buf);
772 }
773
774 if (RP->decoroptions)
775 {
776 sprintf (small_buf, "decoroptions %d\n", RP->decoroptions);
777 strcat (buf, small_buf);
778 }
779
780 if (RP->orientation)
781 {
782 sprintf (small_buf, "orientation %d\n", RP->orientation);
783 strcat (buf, small_buf);
784 }
785
786 if (RP->origin_x)
787 {
788 sprintf (small_buf, "origin_x %d\n", RP->origin_x);
789 strcat (buf, small_buf);
790 }
791
792 if (RP->origin_y)
793 {
794 sprintf (small_buf, "origin_y %d\n", RP->origin_y);
795 strcat (buf, small_buf);
796 }
797
798 if (RP->treasureoptions)
799 {
800 sprintf (small_buf, "treasureoptions %d\n", RP->treasureoptions);
801 strcat (buf, small_buf);
802 }
803
804 if (RP->random_seed)
805 {
806 sprintf (small_buf, "random_seed %u\n", RP->random_seed);
807 strcat (buf, small_buf);
808 }
809
810 if (RP->custom)
811 {
812 sprintf (small_buf, "custom %s\n", RP->custom);
813 strcat (buf, small_buf);
814 }
815}
816
817void
818write_parameters_to_string (char *buf,
819 int xsize_n,
820 int ysize_n,
821 const char *wallstyle_n,
822 const char *floorstyle_n,
823 const char *monsterstyle_n,
824 const char *treasurestyle_n,
825 const char *layoutstyle_n,
826 const char *decorstyle_n,
827 const char *doorstyle_n,
828 const char *exitstyle_n,
829 const char *final_map_n,
830 const char *exit_on_final_map_n,
831 const char *this_map_n,
832 int layoutoptions1_n,
833 int layoutoptions2_n,
834 int layoutoptions3_n,
835 int symmetry_n,
836 int dungeon_depth_n,
837 int dungeon_level_n,
838 int difficulty_n,
839 int difficulty_given_n,
840 int decoroptions_n,
841 int orientation_n,
842 int origin_x_n,
843 int origin_y_n,
844 uint32_t random_seed_n,
845 int treasureoptions_n,
846 float difficulty_increase)
847{
848 char small_buf[16384];
849
850 sprintf (buf, "xsize %d\nysize %d\n", xsize_n, ysize_n);
851
852 if (wallstyle_n && wallstyle_n[0])
853 {
854 sprintf (small_buf, "wallstyle %s\n", wallstyle_n);
855 strcat (buf, small_buf);
856 }
857
858 if (floorstyle_n && floorstyle_n[0])
859 {
860 sprintf (small_buf, "floorstyle %s\n", floorstyle_n);
861 strcat (buf, small_buf);
862 }
863
864 if (monsterstyle_n && monsterstyle_n[0])
865 {
866 sprintf (small_buf, "monsterstyle %s\n", monsterstyle_n);
867 strcat (buf, small_buf);
868 }
869
870 if (treasurestyle_n && treasurestyle_n[0])
871 {
872 sprintf (small_buf, "treasurestyle %s\n", treasurestyle_n);
873 strcat (buf, small_buf);
874 }
875
876 if (layoutstyle_n && layoutstyle_n[0])
877 {
878 sprintf (small_buf, "layoutstyle %s\n", layoutstyle_n);
879 strcat (buf, small_buf);
880 }
881
882 if (decorstyle_n && decorstyle_n[0])
883 {
884 sprintf (small_buf, "decorstyle %s\n", decorstyle_n);
885 strcat (buf, small_buf);
886 }
887
888 if (doorstyle_n && doorstyle_n[0])
889 {
890 sprintf (small_buf, "doorstyle %s\n", doorstyle_n);
891 strcat (buf, small_buf);
892 }
893
894 if (exitstyle_n && exitstyle_n[0])
895 {
896 sprintf (small_buf, "exitstyle %s\n", exitstyle_n);
897 strcat (buf, small_buf);
898 }
899
900 if (final_map_n && final_map_n[0])
901 {
902 sprintf (small_buf, "final_map %s\n", final_map_n);
903 strcat (buf, small_buf);
904 }
905
906 if (exit_on_final_map_n && exit_on_final_map_n[0])
907 {
908 sprintf (small_buf, "exit_on_final_map %s\n", exit_on_final_map_n);
909 strcat (buf, small_buf);
910 }
911
912 if (this_map_n && this_map_n[0])
913 {
914 sprintf (small_buf, "origin_map %s\n", this_map_n);
915 strcat (buf, small_buf);
916 }
917
918 if (layoutoptions1_n)
919 {
920 sprintf (small_buf, "layoutoptions1 %d\n", layoutoptions1_n);
921 strcat (buf, small_buf);
922 }
923
924 if (layoutoptions2_n)
925 {
926 sprintf (small_buf, "layoutoptions2 %d\n", layoutoptions2_n);
927 strcat (buf, small_buf);
928 }
929
930
931 if (layoutoptions3_n)
932 {
933 sprintf (small_buf, "layoutoptions3 %d\n", layoutoptions3_n);
934 strcat (buf, small_buf);
935 }
936
937 if (symmetry_n)
938 {
939 sprintf (small_buf, "symmetry %d\n", symmetry_n);
940 strcat (buf, small_buf);
941 }
942
943
944 if (difficulty_n && difficulty_given_n)
945 {
946 sprintf (small_buf, "difficulty %d\n", difficulty_n);
947 strcat (buf, small_buf);
948 }
949
950 if (difficulty_increase > 0.001)
951 {
952 sprintf (small_buf, "difficulty_increase %f\n", difficulty_increase);
953 strcat (buf, small_buf);
954 }
955
956 sprintf (small_buf, "dungeon_level %d\n", dungeon_level_n);
957 strcat (buf, small_buf);
958
959 if (dungeon_depth_n)
960 {
961 sprintf (small_buf, "dungeon_depth %d\n", dungeon_depth_n);
962 strcat (buf, small_buf);
963 }
964
965 if (decoroptions_n)
966 {
967 sprintf (small_buf, "decoroptions %d\n", decoroptions_n);
968 strcat (buf, small_buf);
969 }
970
971 if (orientation_n)
972 {
973 sprintf (small_buf, "orientation %d\n", orientation_n);
974 strcat (buf, small_buf);
975 }
976
977 if (origin_x_n)
978 {
979 sprintf (small_buf, "origin_x %d\n", origin_x_n);
980 strcat (buf, small_buf);
981 }
982
983 if (origin_y_n)
984 {
985 sprintf (small_buf, "origin_y %d\n", origin_y_n);
986 strcat (buf, small_buf);
987 }
988
989 if (random_seed_n)
990 {
991 /* Add one so that the next map is a bit different */
992 sprintf (small_buf, "random_seed %u\n", random_seed_n + 1);
993 strcat (buf, small_buf);
994 }
995
996 if (treasureoptions_n)
997 {
998 sprintf (small_buf, "treasureoptions %d\n", treasureoptions_n);
999 strcat (buf, small_buf);
1000 }
1001}
1002
1003/* copy an object with an inventory... i.e., duplicate the inv too. */
1004void
1005copy_object_with_inv (object *src_ob, object *dest_ob)
1006{
1007 object *walk, *tmp;
1008
1009 src_ob->copy_to (dest_ob);
1010
1011 for (walk = src_ob->inv; walk; walk = walk->below)
1012 {
1013 tmp = object::create ();
1014
1015 walk->copy_to (tmp);
1016 insert_ob_in_ob (tmp, dest_ob);
1017 }
1018}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines