1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <time.h> |
25 | #include <time.h> |
25 | #include <stdio.h> |
26 | #include <stdio.h> |
26 | #include <global.h> |
27 | #include <global.h> |
27 | #include <maze_gen.h> |
28 | #include <maze_gen.h> |
28 | #include <room_gen.h> |
29 | #include <room_gen.h> |
29 | #include <random_map.h> |
30 | #include <random_map.h> |
30 | #include <rproto.h> |
31 | #include <rproto.h> |
31 | #include <sproto.h> |
32 | #include <sproto.h> |
32 | |
33 | |
|
|
34 | #define CEDE coroapi::cede (); rndm.seed (RP->random_seed + __LINE__); |
|
|
35 | |
33 | void |
36 | void |
34 | dump_layout (char **layout, RMParms * RP) |
37 | dump_layout (char **layout, random_map_params *RP) |
35 | { |
38 | { |
36 | { |
39 | { |
37 | int i, j; |
40 | int i, j; |
38 | |
41 | |
39 | for (i = 0; i < RP->Xsize; i++) |
42 | for (i = 0; i < RP->Xsize; i++) |
… | |
… | |
49 | printf ("\n"); |
52 | printf ("\n"); |
50 | } |
53 | } |
51 | } |
54 | } |
52 | printf ("\n"); |
55 | printf ("\n"); |
53 | } |
56 | } |
54 | EXTERN FILE *logfile; |
57 | |
55 | maptile * |
58 | bool |
56 | generate_random_map (const char *OutFileName, RMParms * RP) |
59 | maptile::generate_random_map (random_map_params *RP) |
57 | { |
60 | { |
58 | char **layout, buf[HUGE_BUF]; |
61 | char **layout, buf[16384]; |
59 | maptile *theMap; |
|
|
60 | int i; |
62 | int i; |
61 | |
63 | |
|
|
64 | RP->Xsize = RP->xsize; |
|
|
65 | RP->Ysize = RP->ysize; |
|
|
66 | |
62 | /* pick a random seed, or use the one from the input file */ |
67 | /* pick a random seed, or use the one from the input file */ |
63 | if (RP->random_seed == 0) |
68 | RP->random_seed = RP->random_seed |
64 | RP->random_seed = time (0); |
69 | ? RP->random_seed + RP->dungeon_level |
65 | |
70 | : time (0); |
66 | SRANDOM (RP->random_seed); |
71 | CEDE; |
67 | |
72 | |
68 | write_map_parameters_to_string (buf, RP); |
73 | write_map_parameters_to_string (buf, RP); |
69 | |
74 | |
70 | if (RP->difficulty == 0) |
75 | if (RP->difficulty == 0) |
71 | { |
76 | { |
… | |
… | |
79 | } |
84 | } |
80 | else |
85 | else |
81 | RP->difficulty_given = 1; |
86 | RP->difficulty_given = 1; |
82 | |
87 | |
83 | if (RP->Xsize < MIN_RANDOM_MAP_SIZE) |
88 | if (RP->Xsize < MIN_RANDOM_MAP_SIZE) |
84 | RP->Xsize = MIN_RANDOM_MAP_SIZE + RANDOM () % 25 + 5; |
89 | RP->Xsize = MIN_RANDOM_MAP_SIZE + rndm (25) + 5; |
85 | |
90 | |
86 | if (RP->Ysize < MIN_RANDOM_MAP_SIZE) |
91 | if (RP->Ysize < MIN_RANDOM_MAP_SIZE) |
87 | RP->Ysize = MIN_RANDOM_MAP_SIZE + RANDOM () % 25 + 5; |
92 | RP->Ysize = MIN_RANDOM_MAP_SIZE + rndm (25) + 5; |
|
|
93 | |
|
|
94 | if (RP->symmetry == SYMMETRY_RANDOM) |
|
|
95 | RP->symmetry_used = (RANDOM () % (SYMMETRY_XY)) + 1; |
|
|
96 | else |
|
|
97 | RP->symmetry_used = RP->symmetry; |
|
|
98 | |
|
|
99 | if (RP->symmetry_used == SYMMETRY_Y || RP->symmetry_used == SYMMETRY_XY) |
|
|
100 | RP->Ysize = RP->Ysize / 2 + 1; |
|
|
101 | |
|
|
102 | if (RP->symmetry_used == SYMMETRY_X || RP->symmetry_used == SYMMETRY_XY) |
|
|
103 | RP->Xsize = RP->Xsize / 2 + 1; |
88 | |
104 | |
89 | if (RP->expand2x > 0) |
105 | if (RP->expand2x > 0) |
90 | { |
106 | { |
91 | RP->Xsize /= 2; |
107 | RP->Xsize /= 2; |
92 | RP->Ysize /= 2; |
108 | RP->Ysize /= 2; |
93 | } |
109 | } |
94 | |
110 | |
95 | layout = layoutgen (RP); |
|
|
96 | |
|
|
97 | #ifdef RMAP_DEBUG |
|
|
98 | dump_layout (layout, RP); |
|
|
99 | #endif |
|
|
100 | |
|
|
101 | /* increment these for the current map */ |
|
|
102 | RP->dungeon_level += 1; |
|
|
103 | /* allow constant-difficulty maps. */ |
|
|
104 | /* difficulty+=1; */ |
|
|
105 | |
|
|
106 | /* rotate the layout randomly */ |
|
|
107 | layout = rotate_layout (layout, RANDOM () % 4, RP); |
|
|
108 | #ifdef RMAP_DEBUG |
|
|
109 | dump_layout (layout, RP); |
|
|
110 | #endif |
|
|
111 | |
|
|
112 | /* allocate the map and set the floor */ |
|
|
113 | theMap = make_map_floor (layout, RP->floorstyle, RP); |
|
|
114 | |
|
|
115 | /* set the name of the map. */ |
|
|
116 | strcpy (theMap->path, OutFileName); |
|
|
117 | |
|
|
118 | /* set region */ |
|
|
119 | theMap->region = RP->region; |
|
|
120 | |
|
|
121 | /* create walls unless the wallstyle is "none" */ |
|
|
122 | if (strcmp (RP->wallstyle, "none")) |
|
|
123 | { |
|
|
124 | make_map_walls (theMap, layout, RP->wallstyle, RP); |
|
|
125 | |
|
|
126 | /* place doors unless doorstyle or wallstyle is "none" */ |
|
|
127 | if (strcmp (RP->doorstyle, "none")) |
|
|
128 | put_doors (theMap, layout, RP->doorstyle, RP); |
|
|
129 | |
|
|
130 | } |
|
|
131 | |
|
|
132 | /* create exits unless the exitstyle is "none" */ |
|
|
133 | if (strcmp (RP->exitstyle, "none")) |
|
|
134 | place_exits (theMap, layout, RP->exitstyle, RP->orientation, RP); |
|
|
135 | |
|
|
136 | place_specials_in_map (theMap, layout, RP); |
|
|
137 | |
|
|
138 | /* create monsters unless the monsterstyle is "none" */ |
|
|
139 | if (strcmp (RP->monsterstyle, "none")) |
|
|
140 | place_monsters (theMap, RP->monsterstyle, RP->difficulty, RP); |
|
|
141 | |
|
|
142 | /* treasures needs to have a proper difficulty set for the map. */ |
|
|
143 | theMap->difficulty = calculate_difficulty (theMap); |
|
|
144 | |
|
|
145 | /* create treasure unless the treasurestyle is "none" */ |
|
|
146 | if (strcmp (RP->treasurestyle, "none")) |
|
|
147 | place_treasure (theMap, layout, RP->treasurestyle, RP->treasureoptions, RP); |
|
|
148 | |
|
|
149 | /* create decor unless the decorstyle is "none" */ |
|
|
150 | if (strcmp (RP->decorstyle, "none")) |
|
|
151 | put_decor (theMap, layout, RP->decorstyle, RP->decoroptions, RP); |
|
|
152 | |
|
|
153 | /* generate treasures, etc. */ |
|
|
154 | fix_auto_apply (theMap); |
|
|
155 | |
|
|
156 | unblock_exits (theMap, layout, RP); |
|
|
157 | |
|
|
158 | /* free the layout */ |
|
|
159 | for (i = 0; i < RP->Xsize; i++) |
|
|
160 | free (layout[i]); |
|
|
161 | free (layout); |
|
|
162 | |
|
|
163 | theMap->msg = strdup_local (buf); |
|
|
164 | |
|
|
165 | return theMap; |
|
|
166 | } |
|
|
167 | |
|
|
168 | /* function selects the layout function and gives it whatever |
|
|
169 | arguments it needs. */ |
|
|
170 | char ** |
|
|
171 | layoutgen (RMParms * RP) |
|
|
172 | { |
|
|
173 | char **maze = 0; |
|
|
174 | int oxsize = RP->Xsize, oysize = RP->Ysize; |
|
|
175 | |
|
|
176 | if (RP->symmetry == RANDOM_SYM) |
|
|
177 | RP->symmetry_used = (RANDOM () % (XY_SYM)) + 1; |
|
|
178 | else |
|
|
179 | RP->symmetry_used = RP->symmetry; |
|
|
180 | |
|
|
181 | if (RP->symmetry_used == Y_SYM || RP->symmetry_used == XY_SYM) |
|
|
182 | RP->Ysize = RP->Ysize / 2 + 1; |
|
|
183 | if (RP->symmetry_used == X_SYM || RP->symmetry_used == XY_SYM) |
|
|
184 | RP->Xsize = RP->Xsize / 2 + 1; |
|
|
185 | |
|
|
186 | if (RP->Xsize < MIN_RANDOM_MAP_SIZE) |
|
|
187 | RP->Xsize = MIN_RANDOM_MAP_SIZE + RANDOM () % 5; |
|
|
188 | if (RP->Ysize < MIN_RANDOM_MAP_SIZE) |
|
|
189 | RP->Ysize = MIN_RANDOM_MAP_SIZE + RANDOM () % 5; |
|
|
190 | RP->map_layout_style = 0; |
111 | RP->map_layout_style = LAYOUT_NONE; |
191 | |
112 | |
192 | /* Redo this - there was a lot of redundant code of checking for preset |
113 | /* Redo this - there was a lot of redundant code of checking for preset |
193 | * layout style and then random layout style. Instead, figure out |
114 | * layout style and then random layout style. Instead, figure out |
194 | * the numeric layoutstyle, so there is only one area that actually |
115 | * the numeric layoutstyle, so there is only one area that actually |
195 | * calls the code to make the maps. |
116 | * calls the code to make the maps. |
196 | */ |
117 | */ |
197 | if (strstr (RP->layoutstyle, "onion")) |
118 | if (strstr (RP->layoutstyle, "onion")) |
198 | { |
|
|
199 | RP->map_layout_style = ONION_LAYOUT; |
119 | RP->map_layout_style = LAYOUT_ONION; |
200 | } |
|
|
201 | |
120 | |
202 | if (strstr (RP->layoutstyle, "maze")) |
121 | if (strstr (RP->layoutstyle, "maze")) |
203 | { |
|
|
204 | RP->map_layout_style = MAZE_LAYOUT; |
122 | RP->map_layout_style = LAYOUT_MAZE; |
205 | } |
|
|
206 | |
123 | |
207 | if (strstr (RP->layoutstyle, "spiral")) |
124 | if (strstr (RP->layoutstyle, "spiral")) |
208 | { |
|
|
209 | RP->map_layout_style = SPIRAL_LAYOUT; |
125 | RP->map_layout_style = LAYOUT_SPIRAL; |
210 | } |
|
|
211 | |
126 | |
212 | if (strstr (RP->layoutstyle, "rogue")) |
127 | if (strstr (RP->layoutstyle, "rogue")) |
213 | { |
|
|
214 | RP->map_layout_style = ROGUELIKE_LAYOUT; |
128 | RP->map_layout_style = LAYOUT_ROGUELIKE; |
215 | } |
|
|
216 | |
129 | |
217 | if (strstr (RP->layoutstyle, "snake")) |
130 | if (strstr (RP->layoutstyle, "snake")) |
218 | { |
|
|
219 | RP->map_layout_style = SNAKE_LAYOUT; |
131 | RP->map_layout_style = LAYOUT_SNAKE; |
220 | } |
|
|
221 | |
132 | |
222 | if (strstr (RP->layoutstyle, "squarespiral")) |
133 | if (strstr (RP->layoutstyle, "squarespiral")) |
223 | { |
|
|
224 | RP->map_layout_style = SQUARE_SPIRAL_LAYOUT; |
134 | RP->map_layout_style = LAYOUT_SQUARE_SPIRAL; |
225 | } |
135 | |
226 | /* No style found - choose one ranomdly */ |
136 | /* No style found - choose one randomly */ |
227 | if (RP->map_layout_style == 0) |
137 | if (RP->map_layout_style == LAYOUT_NONE) |
228 | { |
|
|
229 | RP->map_layout_style = (RANDOM () % NROFLAYOUTS) + 1; |
138 | RP->map_layout_style = (RANDOM () % (NROFLAYOUTS - 1)) + 1; |
|
|
139 | |
|
|
140 | layout = layoutgen (RP); |
|
|
141 | |
|
|
142 | #ifdef RMAP_DEBUG |
|
|
143 | dump_layout (layout, RP); |
|
|
144 | #endif |
|
|
145 | |
|
|
146 | /* increment these for the current map */ |
|
|
147 | RP->dungeon_level += 1; |
|
|
148 | /* allow constant-difficulty maps. */ |
|
|
149 | /* difficulty+=1; */ |
|
|
150 | |
|
|
151 | /* rotate the layout randomly */ |
|
|
152 | layout = rotate_layout (layout, rndm (4), RP); |
|
|
153 | #ifdef RMAP_DEBUG |
|
|
154 | dump_layout (layout, RP); |
|
|
155 | #endif |
|
|
156 | |
|
|
157 | /* allocate the map and set the floor */ |
|
|
158 | make_map_floor (layout, RP->floorstyle, RP); |
|
|
159 | |
|
|
160 | /* set region */ |
|
|
161 | default_region = RP->region; |
|
|
162 | |
|
|
163 | CEDE; |
|
|
164 | |
|
|
165 | /* create walls unless the wallstyle is "none" */ |
|
|
166 | if (strcmp (RP->wallstyle, "none")) |
230 | } |
167 | { |
|
|
168 | make_map_walls (this, layout, RP->wallstyle, RP); |
|
|
169 | |
|
|
170 | /* place doors unless doorstyle or wallstyle is "none" */ |
|
|
171 | if (strcmp (RP->doorstyle, "none")) |
|
|
172 | put_doors (this, layout, RP->doorstyle, RP); |
|
|
173 | } |
|
|
174 | |
|
|
175 | CEDE; |
|
|
176 | |
|
|
177 | /* create exits unless the exitstyle is "none" */ |
|
|
178 | if (strcmp (RP->exitstyle, "none")) |
|
|
179 | place_exits (this, layout, RP->exitstyle, RP->orientation, RP); |
|
|
180 | |
|
|
181 | CEDE; |
|
|
182 | |
|
|
183 | place_specials_in_map (this, layout, RP); |
|
|
184 | |
|
|
185 | CEDE; |
|
|
186 | |
|
|
187 | /* create monsters unless the monsterstyle is "none" */ |
|
|
188 | if (strcmp (RP->monsterstyle, "none")) |
|
|
189 | place_monsters (this, RP->monsterstyle, RP->difficulty, RP); |
|
|
190 | |
|
|
191 | CEDE; |
|
|
192 | |
|
|
193 | /* treasures needs to have a proper difficulty set for the map. */ |
|
|
194 | difficulty = estimate_difficulty (); |
|
|
195 | |
|
|
196 | CEDE; |
|
|
197 | |
|
|
198 | /* create treasure unless the treasurestyle is "none" */ |
|
|
199 | if (strcmp (RP->treasurestyle, "none")) |
|
|
200 | place_treasure (this, layout, RP->treasurestyle, RP->treasureoptions, RP); |
|
|
201 | |
|
|
202 | CEDE; |
|
|
203 | |
|
|
204 | /* create decor unless the decorstyle is "none" */ |
|
|
205 | if (strcmp (RP->decorstyle, "none")) |
|
|
206 | put_decor (this, layout, RP->decorstyle, RP->decoroptions, RP); |
|
|
207 | |
|
|
208 | CEDE; |
|
|
209 | |
|
|
210 | /* generate treasures, etc. */ |
|
|
211 | fix_auto_apply (); |
|
|
212 | |
|
|
213 | CEDE; |
|
|
214 | |
|
|
215 | unblock_exits (this, layout, RP); |
|
|
216 | |
|
|
217 | /* free the layout */ |
|
|
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; |
|
|
225 | |
|
|
226 | CEDE; |
|
|
227 | |
|
|
228 | return 1; |
|
|
229 | } |
|
|
230 | |
|
|
231 | /* function selects the layout function and gives it whatever |
|
|
232 | arguments it needs. */ |
|
|
233 | char ** |
|
|
234 | layoutgen (random_map_params *RP) |
|
|
235 | { |
|
|
236 | char **maze = 0; |
|
|
237 | int oxsize = RP->Xsize, oysize = RP->Ysize; |
231 | |
238 | |
232 | switch (RP->map_layout_style) |
239 | switch (RP->map_layout_style) |
233 | { |
240 | { |
234 | |
241 | case LAYOUT_ONION: |
235 | case ONION_LAYOUT: |
|
|
236 | maze = map_gen_onion (RP->Xsize, RP->Ysize, RP->layoutoptions1, RP->layoutoptions2); |
242 | maze = map_gen_onion (RP->Xsize, RP->Ysize, RP->layoutoptions1, RP->layoutoptions2); |
237 | if (!(RANDOM () % 3) && !(RP->layoutoptions1 & OPT_WALLS_ONLY)) |
243 | if (!(rndm (3)) && !(RP->layoutoptions1 & RMOPT_WALLS_ONLY)) |
238 | roomify_layout (maze, RP); |
244 | roomify_layout (maze, RP); |
239 | break; |
245 | break; |
240 | |
246 | |
241 | case MAZE_LAYOUT: |
247 | case LAYOUT_MAZE: |
242 | maze = maze_gen (RP->Xsize, RP->Ysize, RANDOM () % 2); |
248 | maze = maze_gen (RP->Xsize, RP->Ysize, rndm (2)); |
243 | if (!(RANDOM () % 2)) |
249 | if (!(rndm (2))) |
244 | doorify_layout (maze, RP); |
250 | doorify_layout (maze, RP); |
245 | break; |
251 | break; |
246 | |
252 | |
247 | case SPIRAL_LAYOUT: |
253 | case LAYOUT_SPIRAL: |
248 | maze = map_gen_spiral (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
254 | maze = map_gen_spiral (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
249 | if (!(RANDOM () % 2)) |
255 | if (!(rndm (2))) |
250 | doorify_layout (maze, RP); |
256 | doorify_layout (maze, RP); |
251 | break; |
257 | break; |
252 | |
258 | |
253 | case ROGUELIKE_LAYOUT: |
259 | case LAYOUT_ROGUELIKE: |
254 | /* Don't put symmetry in rogue maps. There isn't much reason to |
260 | /* Don't put symmetry in rogue maps. There isn't much reason to |
255 | * do so in the first place (doesn't make it any more interesting), |
261 | * do so in the first place (doesn't make it any more interesting), |
256 | * but more importantly, the symmetry code presumes we are symmetrizing |
262 | * but more importantly, the symmetry code presumes we are symmetrizing |
257 | * spirals, or maps with lots of passages - making a symmetric rogue |
263 | * spirals, or maps with lots of passages - making a symmetric rogue |
258 | * map fails because its likely that the passages the symmetry process |
264 | * map fails because its likely that the passages the symmetry process |
259 | * creates may not connect the rooms. |
265 | * creates may not connect the rooms. |
260 | */ |
266 | */ |
261 | RP->symmetry_used = NO_SYM; |
267 | RP->symmetry_used = SYMMETRY_NONE; |
262 | RP->Ysize = oysize; |
268 | RP->Ysize = oysize; |
263 | RP->Xsize = oxsize; |
269 | RP->Xsize = oxsize; |
264 | maze = roguelike_layout_gen (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
270 | maze = roguelike_layout_gen (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
265 | /* no doorifying... done already */ |
271 | /* no doorifying... done already */ |
266 | break; |
272 | break; |
267 | |
273 | |
268 | case SNAKE_LAYOUT: |
274 | case LAYOUT_SNAKE: |
269 | maze = make_snake_layout (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
275 | maze = make_snake_layout (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
270 | if (RANDOM () % 2) |
276 | if (rndm (2)) |
271 | roomify_layout (maze, RP); |
277 | roomify_layout (maze, RP); |
272 | break; |
278 | break; |
273 | |
279 | |
274 | case SQUARE_SPIRAL_LAYOUT: |
280 | case LAYOUT_SQUARE_SPIRAL: |
275 | maze = make_square_spiral_layout (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
281 | maze = make_square_spiral_layout (RP->Xsize, RP->Ysize, RP->layoutoptions1); |
276 | if (RANDOM () % 2) |
282 | if (rndm (2)) |
277 | roomify_layout (maze, RP); |
283 | roomify_layout (maze, RP); |
278 | break; |
284 | break; |
279 | } |
285 | } |
280 | |
286 | |
281 | maze = symmetrize_layout (maze, RP->symmetry_used, RP); |
287 | maze = symmetrize_layout (maze, RP->symmetry_used, RP); |
|
|
288 | |
282 | #ifdef RMAP_DEBUG |
289 | #ifdef RMAP_DEBUG |
283 | dump_layout (maze, RP); |
290 | dump_layout (maze, RP); |
284 | #endif |
291 | #endif |
|
|
292 | |
285 | if (RP->expand2x) |
293 | if (RP->expand2x) |
286 | { |
294 | { |
287 | maze = expand2x (maze, RP->Xsize, RP->Ysize); |
295 | maze = expand2x (maze, RP->Xsize, RP->Ysize); |
288 | RP->Xsize = RP->Xsize * 2 - 1; |
296 | RP->Xsize = RP->Xsize * 2 - 1; |
289 | RP->Ysize = RP->Ysize * 2 - 1; |
297 | RP->Ysize = RP->Ysize * 2 - 1; |
290 | } |
298 | } |
|
|
299 | |
291 | return maze; |
300 | return maze; |
292 | } |
301 | } |
293 | |
|
|
294 | |
302 | |
295 | /* takes a map and makes it symmetric: adjusts Xsize and |
303 | /* takes a map and makes it symmetric: adjusts Xsize and |
296 | Ysize to produce a symmetric map. */ |
304 | Ysize to produce a symmetric map. */ |
297 | |
|
|
298 | char ** |
305 | char ** |
299 | symmetrize_layout (char **maze, int sym, RMParms * RP) |
306 | symmetrize_layout (char **maze, int sym, random_map_params *RP) |
300 | { |
307 | { |
301 | int i, j; |
308 | int i, j; |
302 | char **sym_maze; |
309 | char **sym_maze; |
303 | int Xsize_orig, Ysize_orig; |
310 | int Xsize_orig, Ysize_orig; |
304 | |
311 | |
305 | Xsize_orig = RP->Xsize; |
312 | Xsize_orig = RP->Xsize; |
306 | Ysize_orig = RP->Ysize; |
313 | Ysize_orig = RP->Ysize; |
307 | RP->symmetry_used = sym; /* tell everyone else what sort of symmetry is used. */ |
314 | RP->symmetry_used = sym; /* tell everyone else what sort of symmetry is used. */ |
308 | if (sym == NO_SYM) |
315 | if (sym == SYMMETRY_NONE) |
309 | { |
316 | { |
310 | RP->Xsize = Xsize_orig; |
317 | RP->Xsize = Xsize_orig; |
311 | RP->Ysize = Ysize_orig; |
318 | RP->Ysize = Ysize_orig; |
312 | return maze; |
319 | return maze; |
313 | } |
320 | } |
314 | /* pick new sizes */ |
321 | /* pick new sizes */ |
315 | RP->Xsize = ((sym == X_SYM || sym == XY_SYM) ? RP->Xsize * 2 - 3 : RP->Xsize); |
322 | RP->Xsize = ((sym == SYMMETRY_X || sym == SYMMETRY_XY) ? RP->Xsize * 2 - 3 : RP->Xsize); |
316 | RP->Ysize = ((sym == Y_SYM || sym == XY_SYM) ? RP->Ysize * 2 - 3 : RP->Ysize); |
323 | RP->Ysize = ((sym == SYMMETRY_Y || sym == SYMMETRY_XY) ? RP->Ysize * 2 - 3 : RP->Ysize); |
317 | |
324 | |
318 | sym_maze = (char **) calloc (sizeof (char *), RP->Xsize); |
325 | sym_maze = (char **) calloc (sizeof (char *), RP->Xsize); |
319 | for (i = 0; i < RP->Xsize; i++) |
326 | for (i = 0; i < RP->Xsize; i++) |
320 | sym_maze[i] = (char *) calloc (sizeof (char), RP->Ysize); |
327 | sym_maze[i] = (char *) calloc (sizeof (char), RP->Ysize); |
321 | |
328 | |
322 | if (sym == X_SYM) |
329 | if (sym == SYMMETRY_X) |
323 | for (i = 0; i < RP->Xsize / 2 + 1; i++) |
330 | for (i = 0; i < RP->Xsize / 2 + 1; i++) |
324 | for (j = 0; j < RP->Ysize; j++) |
331 | for (j = 0; j < RP->Ysize; j++) |
325 | { |
332 | { |
326 | sym_maze[i][j] = maze[i][j]; |
333 | sym_maze[i][j] = maze[i][j]; |
327 | sym_maze[RP->Xsize - i - 1][j] = maze[i][j]; |
334 | sym_maze[RP->Xsize - i - 1][j] = maze[i][j]; |
328 | }; |
335 | }; |
329 | if (sym == Y_SYM) |
336 | if (sym == SYMMETRY_Y) |
330 | for (i = 0; i < RP->Xsize; i++) |
337 | for (i = 0; i < RP->Xsize; i++) |
331 | for (j = 0; j < RP->Ysize / 2 + 1; j++) |
338 | for (j = 0; j < RP->Ysize / 2 + 1; j++) |
332 | { |
339 | { |
333 | sym_maze[i][j] = maze[i][j]; |
340 | sym_maze[i][j] = maze[i][j]; |
334 | sym_maze[i][RP->Ysize - j - 1] = maze[i][j]; |
341 | sym_maze[i][RP->Ysize - j - 1] = maze[i][j]; |
335 | } |
342 | } |
336 | if (sym == XY_SYM) |
343 | if (sym == SYMMETRY_XY) |
337 | for (i = 0; i < RP->Xsize / 2 + 1; i++) |
344 | for (i = 0; i < RP->Xsize / 2 + 1; i++) |
338 | for (j = 0; j < RP->Ysize / 2 + 1; j++) |
345 | for (j = 0; j < RP->Ysize / 2 + 1; j++) |
339 | { |
346 | { |
340 | sym_maze[i][j] = maze[i][j]; |
347 | sym_maze[i][j] = maze[i][j]; |
341 | sym_maze[i][RP->Ysize - j - 1] = maze[i][j]; |
348 | sym_maze[i][RP->Ysize - j - 1] = maze[i][j]; |
… | |
… | |
345 | /* delete the old maze */ |
352 | /* delete the old maze */ |
346 | for (i = 0; i < Xsize_orig; i++) |
353 | for (i = 0; i < Xsize_orig; i++) |
347 | free (maze[i]); |
354 | free (maze[i]); |
348 | free (maze); |
355 | free (maze); |
349 | /* reconnect disjointed spirals */ |
356 | /* reconnect disjointed spirals */ |
350 | if (RP->map_layout_style == SPIRAL_LAYOUT) |
357 | if (RP->map_layout_style == LAYOUT_SPIRAL) |
351 | connect_spirals (RP->Xsize, RP->Ysize, sym, sym_maze); |
358 | connect_spirals (RP->Xsize, RP->Ysize, sym, sym_maze); |
352 | /* reconnect disjointed nethackmazes: the routine for |
359 | /* reconnect disjointed nethackmazes: the routine for |
353 | spirals will do the trick? */ |
360 | spirals will do the trick? */ |
354 | if (RP->map_layout_style == ROGUELIKE_LAYOUT) |
361 | if (RP->map_layout_style == LAYOUT_ROGUELIKE) |
355 | connect_spirals (RP->Xsize, RP->Ysize, sym, sym_maze); |
362 | connect_spirals (RP->Xsize, RP->Ysize, sym, sym_maze); |
356 | |
363 | |
357 | return sym_maze; |
364 | return sym_maze; |
358 | } |
365 | } |
359 | |
366 | |
… | |
… | |
362 | onion layouts, making them possibly centered on any wall. |
369 | onion layouts, making them possibly centered on any wall. |
363 | It'll modify Xsize and Ysize if they're swapped. |
370 | It'll modify Xsize and Ysize if they're swapped. |
364 | */ |
371 | */ |
365 | |
372 | |
366 | char ** |
373 | char ** |
367 | rotate_layout (char **maze, int rotation, RMParms * RP) |
374 | rotate_layout (char **maze, int rotation, random_map_params *RP) |
368 | { |
375 | { |
369 | char **new_maze; |
376 | char **new_maze; |
370 | int i, j; |
377 | int i, j; |
371 | |
378 | |
372 | switch (rotation) |
379 | switch (rotation) |
373 | { |
380 | { |
374 | case 0: |
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); |
375 | return maze; |
403 | return maze; |
376 | break; |
404 | break; |
377 | case 2: /* a reflection */ |
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++) |
378 | { |
412 | { |
379 | char *newmaze = (char *) malloc (sizeof (char) * RP->Xsize * RP->Ysize); |
413 | new_maze[i] = (char *) calloc (sizeof (char), RP->Xsize); |
380 | |
414 | } |
|
|
415 | if (rotation == 1) /* swap x and y */ |
381 | for (i = 0; i < RP->Xsize; i++) |
416 | for (i = 0; i < RP->Xsize; i++) |
382 | { /* make a copy */ |
|
|
383 | for (j = 0; j < RP->Ysize; j++) |
417 | for (j = 0; j < RP->Ysize; j++) |
384 | { |
|
|
385 | newmaze[i * RP->Ysize + j] = maze[i][j]; |
418 | new_maze[j][i] = maze[i][j]; |
386 | } |
419 | |
387 | } |
420 | if (rotation == 3) |
388 | for (i = 0; i < RP->Xsize; i++) |
421 | { /* swap x and y */ |
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++) |
422 | for (i = 0; i < RP->Xsize; i++) |
410 | for (j = 0; j < RP->Ysize; j++) |
423 | 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]; |
424 | new_maze[j][i] = maze[RP->Xsize - i - 1][RP->Ysize - j - 1]; |
418 | } |
425 | } |
419 | |
426 | |
420 | /* delete the old layout */ |
427 | /* delete the old layout */ |
421 | for (i = 0; i < RP->Xsize; i++) |
428 | for (i = 0; i < RP->Xsize; i++) |
422 | free (maze[i]); |
429 | free (maze[i]); |
423 | free (maze); |
430 | free (maze); |
424 | |
431 | |
425 | swap = RP->Ysize; |
432 | swap = RP->Ysize; |
426 | RP->Ysize = RP->Xsize; |
433 | RP->Ysize = RP->Xsize; |
427 | RP->Xsize = swap; |
434 | RP->Xsize = swap; |
428 | return new_maze; |
435 | return new_maze; |
429 | break; |
436 | break; |
430 | } |
437 | } |
431 | } |
438 | } |
432 | return NULL; |
439 | return NULL; |
433 | } |
440 | } |
434 | |
441 | |
435 | /* take a layout and make some rooms in it. |
442 | /* take a layout and make some rooms in it. |
436 | --works best on onions.*/ |
443 | --works best on onions.*/ |
437 | void |
444 | void |
438 | roomify_layout (char **maze, RMParms * RP) |
445 | roomify_layout (char **maze, random_map_params *RP) |
439 | { |
446 | { |
440 | int tries = RP->Xsize * RP->Ysize / 30; |
447 | int tries = RP->Xsize * RP->Ysize / 30; |
441 | int ti; |
448 | int ti; |
442 | |
449 | |
443 | for (ti = 0; ti < tries; ti++) |
450 | for (ti = 0; ti < tries; ti++) |
… | |
… | |
470 | /* checks the layout to see if I can stick a horizontal(dir = 0) wall |
477 | /* checks the layout to see if I can stick a horizontal(dir = 0) wall |
471 | (or vertical, dir == 1) |
478 | (or vertical, dir == 1) |
472 | here which ends up on other walls sensibly. */ |
479 | here which ends up on other walls sensibly. */ |
473 | |
480 | |
474 | int |
481 | int |
475 | can_make_wall (char **maze, int dx, int dy, int dir, RMParms * RP) |
482 | can_make_wall (char **maze, int dx, int dy, int dir, random_map_params *RP) |
476 | { |
483 | { |
477 | int i1; |
484 | int i1; |
478 | int length = 0; |
485 | int length = 0; |
479 | |
486 | |
480 | /* dont make walls if we're on the edge. */ |
487 | /* dont make walls if we're on the edge. */ |
… | |
… | |
555 | make_wall (char **maze, int x, int y, int dir) |
562 | make_wall (char **maze, int x, int y, int dir) |
556 | { |
563 | { |
557 | maze[x][y] = 'D'; /* mark a door */ |
564 | maze[x][y] = 'D'; /* mark a door */ |
558 | switch (dir) |
565 | switch (dir) |
559 | { |
566 | { |
560 | case 0: /* horizontal */ |
567 | case 0: /* horizontal */ |
561 | { |
568 | { |
562 | int i1; |
569 | int i1; |
563 | |
570 | |
564 | for (i1 = x - 1; maze[i1][y] == 0; i1--) |
571 | for (i1 = x - 1; maze[i1][y] == 0; i1--) |
565 | maze[i1][y] = '#'; |
572 | maze[i1][y] = '#'; |
566 | for (i1 = x + 1; maze[i1][y] == 0; i1++) |
573 | for (i1 = x + 1; maze[i1][y] == 0; i1++) |
567 | maze[i1][y] = '#'; |
574 | maze[i1][y] = '#'; |
568 | break; |
575 | break; |
569 | } |
576 | } |
570 | case 1: /* vertical */ |
577 | case 1: /* vertical */ |
571 | { |
578 | { |
572 | int i1; |
579 | int i1; |
573 | |
580 | |
574 | for (i1 = y - 1; maze[x][i1] == 0; i1--) |
581 | for (i1 = y - 1; maze[x][i1] == 0; i1--) |
575 | maze[x][i1] = '#'; |
582 | maze[x][i1] = '#'; |
576 | for (i1 = y + 1; maze[x][i1] == 0; i1++) |
583 | for (i1 = y + 1; maze[x][i1] == 0; i1++) |
577 | maze[x][i1] = '#'; |
584 | maze[x][i1] = '#'; |
578 | break; |
585 | break; |
579 | } |
586 | } |
580 | } |
587 | } |
581 | |
588 | |
582 | return 0; |
589 | return 0; |
583 | } |
590 | } |
584 | |
591 | |
585 | /* puts doors at appropriate locations in a layout. */ |
592 | /* puts doors at appropriate locations in a layout. */ |
586 | |
|
|
587 | void |
593 | void |
588 | doorify_layout (char **maze, RMParms * RP) |
594 | doorify_layout (char **maze, random_map_params *RP) |
589 | { |
595 | { |
590 | int ndoors = RP->Xsize * RP->Ysize / 60; /* reasonable number of doors. */ |
596 | int ndoors = RP->Xsize * RP->Ysize / 60; /* reasonable number of doors. */ |
591 | char *doorlist_x; |
597 | char *doorlist_x; |
592 | char *doorlist_y; |
598 | char *doorlist_y; |
593 | int doorlocs = 0; /* # of available doorlocations */ |
599 | int doorlocs = 0; /* # of available doorlocations */ |
… | |
… | |
608 | doorlist_x[doorlocs] = i; |
614 | doorlist_x[doorlocs] = i; |
609 | doorlist_y[doorlocs] = j; |
615 | doorlist_y[doorlocs] = j; |
610 | doorlocs++; |
616 | doorlocs++; |
611 | } |
617 | } |
612 | } |
618 | } |
|
|
619 | |
613 | while (ndoors > 0 && doorlocs > 0) |
620 | while (ndoors > 0 && doorlocs > 0) |
614 | { |
621 | { |
615 | int di; |
622 | int di; |
616 | int sindex; |
623 | int sindex; |
617 | |
624 | |
… | |
… | |
627 | /* reduce the size of the list */ |
634 | /* reduce the size of the list */ |
628 | doorlocs--; |
635 | doorlocs--; |
629 | doorlist_x[di] = doorlist_x[doorlocs]; |
636 | doorlist_x[di] = doorlist_x[doorlocs]; |
630 | doorlist_y[di] = doorlist_y[doorlocs]; |
637 | doorlist_y[di] = doorlist_y[doorlocs]; |
631 | } |
638 | } |
|
|
639 | |
632 | free (doorlist_x); |
640 | free (doorlist_x); |
633 | free (doorlist_y); |
641 | free (doorlist_y); |
634 | } |
642 | } |
635 | |
643 | |
636 | |
|
|
637 | void |
644 | void |
638 | write_map_parameters_to_string (char *buf, RMParms * RP) |
645 | write_map_parameters_to_string (char *buf, random_map_params *RP) |
639 | { |
646 | { |
640 | |
|
|
641 | char small_buf[256]; |
647 | char small_buf[16384]; |
642 | |
648 | |
643 | sprintf (buf, "xsize %d\nysize %d\n", RP->Xsize, RP->Ysize); |
649 | sprintf (buf, "xsize %d\nysize %d\n", RP->xsize, RP->ysize); |
644 | |
650 | |
645 | if (RP->wallstyle[0]) |
651 | if (RP->wallstyle[0]) |
646 | { |
652 | { |
647 | sprintf (small_buf, "wallstyle %s\n", RP->wallstyle); |
653 | sprintf (small_buf, "wallstyle %s\n", RP->wallstyle); |
648 | strcat (buf, small_buf); |
654 | strcat (buf, small_buf); |
… | |
… | |
688 | { |
694 | { |
689 | sprintf (small_buf, "exitstyle %s\n", RP->exitstyle); |
695 | sprintf (small_buf, "exitstyle %s\n", RP->exitstyle); |
690 | strcat (buf, small_buf); |
696 | strcat (buf, small_buf); |
691 | } |
697 | } |
692 | |
698 | |
693 | if (RP->final_map[0]) |
699 | if (RP->final_map.length ()) |
694 | { |
700 | { |
695 | sprintf (small_buf, "final_map %s\n", RP->final_map); |
701 | sprintf (small_buf, "final_map %s\n", &RP->final_map); |
696 | strcat (buf, small_buf); |
702 | strcat (buf, small_buf); |
697 | } |
703 | } |
698 | |
704 | |
699 | if (RP->exit_on_final_map[0]) |
705 | if (RP->exit_on_final_map[0]) |
700 | { |
706 | { |
701 | sprintf (small_buf, "exit_on_final_map %s\n", RP->exit_on_final_map); |
707 | sprintf (small_buf, "exit_on_final_map %s\n", RP->exit_on_final_map); |
702 | strcat (buf, small_buf); |
708 | strcat (buf, small_buf); |
703 | } |
709 | } |
704 | |
710 | |
705 | if (RP->this_map[0]) |
711 | if (RP->this_map.length ()) |
706 | { |
712 | { |
707 | sprintf (small_buf, "origin_map %s\n", RP->this_map); |
713 | sprintf (small_buf, "origin_map %s\n", &RP->this_map); |
708 | strcat (buf, small_buf); |
714 | strcat (buf, small_buf); |
709 | } |
715 | } |
710 | |
716 | |
711 | if (RP->expand2x) |
717 | if (RP->expand2x) |
712 | { |
718 | { |
… | |
… | |
718 | { |
724 | { |
719 | sprintf (small_buf, "layoutoptions1 %d\n", RP->layoutoptions1); |
725 | sprintf (small_buf, "layoutoptions1 %d\n", RP->layoutoptions1); |
720 | strcat (buf, small_buf); |
726 | strcat (buf, small_buf); |
721 | } |
727 | } |
722 | |
728 | |
723 | |
|
|
724 | if (RP->layoutoptions2) |
729 | if (RP->layoutoptions2) |
725 | { |
730 | { |
726 | sprintf (small_buf, "layoutoptions2 %d\n", RP->layoutoptions2); |
731 | sprintf (small_buf, "layoutoptions2 %d\n", RP->layoutoptions2); |
727 | strcat (buf, small_buf); |
732 | strcat (buf, small_buf); |
728 | } |
733 | } |
729 | |
734 | |
730 | |
|
|
731 | if (RP->layoutoptions3) |
735 | if (RP->layoutoptions3) |
732 | { |
736 | { |
733 | sprintf (small_buf, "layoutoptions3 %d\n", RP->layoutoptions3); |
737 | sprintf (small_buf, "layoutoptions3 %d\n", RP->layoutoptions3); |
734 | strcat (buf, small_buf); |
738 | strcat (buf, small_buf); |
735 | } |
739 | } |
… | |
… | |
737 | if (RP->symmetry) |
741 | if (RP->symmetry) |
738 | { |
742 | { |
739 | sprintf (small_buf, "symmetry %d\n", RP->symmetry); |
743 | sprintf (small_buf, "symmetry %d\n", RP->symmetry); |
740 | strcat (buf, small_buf); |
744 | strcat (buf, small_buf); |
741 | } |
745 | } |
742 | |
|
|
743 | |
746 | |
744 | if (RP->difficulty && RP->difficulty_given) |
747 | if (RP->difficulty && RP->difficulty_given) |
745 | { |
748 | { |
746 | sprintf (small_buf, "difficulty %d\n", RP->difficulty); |
749 | sprintf (small_buf, "difficulty %d\n", RP->difficulty); |
747 | strcat (buf, small_buf); |
750 | strcat (buf, small_buf); |
… | |
… | |
783 | if (RP->origin_y) |
786 | if (RP->origin_y) |
784 | { |
787 | { |
785 | sprintf (small_buf, "origin_y %d\n", RP->origin_y); |
788 | sprintf (small_buf, "origin_y %d\n", RP->origin_y); |
786 | strcat (buf, small_buf); |
789 | strcat (buf, small_buf); |
787 | } |
790 | } |
|
|
791 | |
|
|
792 | if (RP->treasureoptions) |
|
|
793 | { |
|
|
794 | sprintf (small_buf, "treasureoptions %d\n", RP->treasureoptions); |
|
|
795 | strcat (buf, small_buf); |
|
|
796 | } |
|
|
797 | |
788 | if (RP->random_seed) |
798 | if (RP->random_seed) |
789 | { |
799 | { |
790 | /* Add one so that the next map is a bit different */ |
|
|
791 | sprintf (small_buf, "random_seed %d\n", RP->random_seed + 1); |
800 | sprintf (small_buf, "random_seed %u\n", RP->random_seed); |
792 | strcat (buf, small_buf); |
801 | strcat (buf, small_buf); |
793 | } |
|
|
794 | |
|
|
795 | if (RP->treasureoptions) |
|
|
796 | { |
802 | } |
797 | sprintf (small_buf, "treasureoptions %d\n", RP->treasureoptions); |
803 | |
798 | strcat (buf, small_buf); |
804 | if (RP->custom) |
799 | } |
805 | { |
800 | |
806 | sprintf (small_buf, "custom %s\n", RP->custom); |
801 | |
807 | strcat (buf, small_buf); |
|
|
808 | } |
802 | } |
809 | } |
803 | |
810 | |
804 | void |
811 | void |
805 | write_parameters_to_string (char *buf, |
812 | write_parameters_to_string (char *buf, |
806 | int xsize_n, |
813 | int xsize_n, |
… | |
… | |
824 | int dungeon_level_n, |
831 | int dungeon_level_n, |
825 | int difficulty_n, |
832 | int difficulty_n, |
826 | int difficulty_given_n, |
833 | int difficulty_given_n, |
827 | int decoroptions_n, |
834 | int decoroptions_n, |
828 | int orientation_n, |
835 | int orientation_n, |
829 | int origin_x_n, int origin_y_n, int random_seed_n, int treasureoptions_n, float difficulty_increase) |
836 | int origin_x_n, int origin_y_n, uint32_t random_seed_n, int treasureoptions_n, float difficulty_increase) |
830 | { |
837 | { |
831 | |
|
|
832 | char small_buf[256]; |
838 | char small_buf[16384]; |
833 | |
839 | |
834 | sprintf (buf, "xsize %d\nysize %d\n", xsize_n, ysize_n); |
840 | sprintf (buf, "xsize %d\nysize %d\n", xsize_n, ysize_n); |
835 | |
841 | |
836 | if (wallstyle_n && wallstyle_n[0]) |
842 | if (wallstyle_n && wallstyle_n[0]) |
837 | { |
843 | { |
… | |
… | |
902 | if (layoutoptions1_n) |
908 | if (layoutoptions1_n) |
903 | { |
909 | { |
904 | sprintf (small_buf, "layoutoptions1 %d\n", layoutoptions1_n); |
910 | sprintf (small_buf, "layoutoptions1 %d\n", layoutoptions1_n); |
905 | strcat (buf, small_buf); |
911 | strcat (buf, small_buf); |
906 | } |
912 | } |
907 | |
|
|
908 | |
913 | |
909 | if (layoutoptions2_n) |
914 | if (layoutoptions2_n) |
910 | { |
915 | { |
911 | sprintf (small_buf, "layoutoptions2 %d\n", layoutoptions2_n); |
916 | sprintf (small_buf, "layoutoptions2 %d\n", layoutoptions2_n); |
912 | strcat (buf, small_buf); |
917 | strcat (buf, small_buf); |
… | |
… | |
968 | if (origin_y_n) |
973 | if (origin_y_n) |
969 | { |
974 | { |
970 | sprintf (small_buf, "origin_y %d\n", origin_y_n); |
975 | sprintf (small_buf, "origin_y %d\n", origin_y_n); |
971 | strcat (buf, small_buf); |
976 | strcat (buf, small_buf); |
972 | } |
977 | } |
|
|
978 | |
973 | if (random_seed_n) |
979 | if (random_seed_n) |
974 | { |
980 | { |
975 | /* Add one so that the next map is a bit different */ |
981 | /* Add one so that the next map is a bit different */ |
976 | sprintf (small_buf, "random_seed %d\n", random_seed_n + 1); |
982 | sprintf (small_buf, "random_seed %u\n", random_seed_n + 1); |
977 | strcat (buf, small_buf); |
983 | strcat (buf, small_buf); |
978 | } |
984 | } |
979 | |
985 | |
980 | if (treasureoptions_n) |
986 | if (treasureoptions_n) |
981 | { |
987 | { |
982 | sprintf (small_buf, "treasureoptions %d\n", treasureoptions_n); |
988 | sprintf (small_buf, "treasureoptions %d\n", treasureoptions_n); |
983 | strcat (buf, small_buf); |
989 | strcat (buf, small_buf); |
984 | } |
990 | } |
985 | |
|
|
986 | |
|
|
987 | } |
991 | } |
988 | |
992 | |
989 | /* copy an object with an inventory... i.e., duplicate the inv too. */ |
993 | /* copy an object with an inventory... i.e., duplicate the inv too. */ |
990 | void |
994 | void |
991 | copy_object_with_inv (object *src_ob, object *dest_ob) |
995 | copy_object_with_inv (object *src_ob, object *dest_ob) |
992 | { |
996 | { |
993 | object *walk, *tmp; |
997 | object *walk, *tmp; |
994 | |
998 | |
995 | src_ob->copy_to (dest_ob); |
999 | src_ob->copy_to (dest_ob); |
996 | |
1000 | |
997 | for (walk = src_ob->inv; walk != NULL; walk = walk->below) |
1001 | for (walk = src_ob->inv; walk; walk = walk->below) |
998 | { |
1002 | { |
999 | tmp = object::create (); |
1003 | tmp = object::create (); |
|
|
1004 | |
1000 | walk->copy_to (tmp); |
1005 | walk->copy_to (tmp); |
1001 | insert_ob_in_ob (tmp, dest_ob); |
1006 | insert_ob_in_ob (tmp, dest_ob); |
1002 | } |
1007 | } |
1003 | } |
1008 | } |