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

Diff Legend

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