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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Specials in this file: |
24 | /* Specials in this file: |
25 | included maps */ |
25 | included maps */ |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
… | |
… | |
37 | #define GLORY_HOLE 1 |
37 | #define GLORY_HOLE 1 |
38 | #define ORC_ZONE 2 |
38 | #define ORC_ZONE 2 |
39 | #define MINING_ZONE 3 |
39 | #define MINING_ZONE 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
41 | |
41 | |
42 | /* clear map completely of all objects: a rectangular area of xsize, ysize |
42 | /* clear map completely of all !floor objects: |
|
|
43 | * a rectangular area of xsize, ysize |
43 | is cleared with the top left corner at xstart, ystart */ |
44 | * is cleared with the top left corner at xstart, ystart |
44 | |
45 | */ |
45 | void |
46 | static void |
46 | nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize) |
47 | nuke_map_region (maptile *map, char **layout, int xstart, int ystart, int xsize, int ysize) |
47 | { |
48 | { |
48 | int i, j; |
|
|
49 | object *tmp; |
|
|
50 | |
|
|
51 | for (i = xstart; i < xstart + xsize; i++) |
49 | for (int i = xstart; i < xstart + xsize; i++) |
52 | for (j = ystart; j < ystart + ysize; j++) |
50 | for (int j = ystart; j < ystart + ysize; j++) |
53 | { |
51 | { |
54 | for (tmp = get_map_ob (map, i, j); tmp != NULL; tmp = tmp->above) |
52 | layout[i][j] = 'S'; |
|
|
53 | |
|
|
54 | for (object *tmp = map->at (i, j).bot; tmp; ) |
|
|
55 | if (tmp->flag [FLAG_IS_FLOOR]) |
|
|
56 | tmp = tmp->above; |
55 | { |
57 | else |
56 | if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
|
|
57 | { |
58 | { |
58 | if (tmp->head) |
59 | object *head = tmp->head_ (); |
59 | tmp = tmp->head; |
60 | tmp = tmp->above; |
60 | remove_ob (tmp); |
61 | head->destroy (); |
61 | free_object (tmp); |
|
|
62 | tmp = get_map_ob (map, i, j); |
|
|
63 | } |
62 | } |
64 | if (tmp == NULL) |
|
|
65 | break; |
|
|
66 | } |
|
|
67 | } |
63 | } |
68 | } |
64 | } |
69 | |
65 | |
70 | |
|
|
71 | |
|
|
72 | /* copy in_map into dest_map at point x,y */ |
66 | /* copy in_map into dest_map at point x,y */ |
73 | |
67 | static void |
74 | |
|
|
75 | void |
|
|
76 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
68 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
77 | { |
69 | { |
78 | int i, j; |
70 | for (int i = 0; i < in_map->width; i++) |
79 | object *tmp; |
71 | for (int j = 0; j < in_map->height; j++) |
80 | object *new_ob; |
|
|
81 | |
|
|
82 | /* First, splatter everything in the dest map at the location */ |
|
|
83 | nuke_map_region (dest_map, x, y, MAP_WIDTH (in_map), MAP_HEIGHT (in_map)); |
|
|
84 | |
|
|
85 | for (i = 0; i < MAP_WIDTH (in_map); i++) |
|
|
86 | for (j = 0; j < MAP_HEIGHT (in_map); j++) |
|
|
87 | { |
|
|
88 | for (tmp = get_map_ob (in_map, i, j); tmp != NULL; tmp = tmp->above) |
72 | for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above) |
89 | { |
73 | { |
90 | /* don't copy things with multiple squares: must be dealt with |
74 | /* don't copy tails: must be dealt with specially. */ |
91 | specially. */ |
|
|
92 | if (tmp->head != NULL) |
75 | if (!tmp->is_head ()) |
93 | continue; |
76 | continue; |
94 | new_ob = arch_to_object (tmp->arch); |
77 | |
95 | copy_object_with_inv (tmp, new_ob); |
78 | object *new_ob = tmp->deep_clone (); |
|
|
79 | |
96 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
80 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
97 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
81 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
98 | new_ob->x = i + x; |
82 | |
99 | new_ob->y = j + y; |
83 | dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON); |
100 | insert_multisquare_ob_in_map (new_ob, dest_map); |
|
|
101 | } |
84 | } |
102 | } |
|
|
103 | } |
85 | } |
104 | |
86 | |
105 | int |
87 | static int |
106 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
88 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
107 | { |
89 | { |
108 | int tries; |
90 | int blocked, i, j; |
109 | int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */ |
|
|
110 | int is_occupied = 0; |
|
|
111 | int l, m; |
|
|
112 | |
91 | |
113 | /* don't even try to place a submap into a map if the big map isn't |
92 | /* don't even try to place a submap into a map if the big map isn't |
114 | sufficiently large. */ |
93 | sufficiently large. */ |
115 | if (2 * xsize > MAP_WIDTH (map) || 2 * ysize > MAP_HEIGHT (map)) |
94 | if (2 * xsize > map->width || 2 * ysize > map->height) |
116 | return 0; |
95 | return 0; |
117 | |
96 | |
118 | /* search a bit for a completely free spot. */ |
97 | /* search a bit for a completely free spot. */ |
119 | for (tries = 0; tries < 20; tries++) |
98 | for (int tries = 0; tries < 20; tries++) |
120 | { |
99 | { |
|
|
100 | blocked = 0; |
|
|
101 | |
121 | /* pick a random location in the layout */ |
102 | /* pick a random location in the layout */ |
122 | i = RANDOM () % (MAP_WIDTH (map) - xsize - 2) + 1; |
103 | i = rmg_rndm (1, map->width - xsize - 2); |
123 | j = RANDOM () % (MAP_HEIGHT (map) - ysize - 2) + 1; |
104 | j = rmg_rndm (1, map->height - ysize - 2); |
124 | is_occupied = 0; |
105 | |
125 | for (l = i; l < i + xsize; l++) |
106 | for (int l = i; l < i + xsize; l++) |
126 | for (m = j; m < j + ysize; m++) |
107 | for (int m = j; m < j + ysize; m++) |
127 | is_occupied |= layout[l][m]; |
108 | { |
128 | if (!is_occupied) |
109 | blocked = 1; |
129 | break; |
110 | break; |
130 | } |
111 | } |
131 | |
112 | |
|
|
113 | if (!blocked) |
|
|
114 | break; |
|
|
115 | } |
132 | |
116 | |
133 | /* if we failed, relax the restrictions */ |
117 | /* if we failed, relax the restrictions */ |
134 | |
118 | if (blocked) |
135 | if (is_occupied) |
|
|
136 | { /* failure, try a relaxed placer. */ |
119 | { /* failure, try a relaxed placer. */ |
137 | /* pick a random location in the layout */ |
120 | /* pick a random location in the layout */ |
138 | for (tries = 0; tries < 10; tries++) |
121 | for (int tries = 0; tries < 10; tries++) |
139 | { |
122 | { |
140 | i = RANDOM () % (MAP_WIDTH (map) - xsize - 2) + 1; |
123 | i = rmg_rndm (1, map->width - xsize - 2); |
141 | j = RANDOM () % (MAP_HEIGHT (map) - ysize - 2) + 1; |
124 | j = rmg_rndm (1, map->height - ysize - 2); |
|
|
125 | |
142 | is_occupied = 0; |
126 | blocked = 0; |
|
|
127 | |
143 | for (l = i; l < i + xsize; l++) |
128 | for (int l = i; l < i + xsize; l++) |
144 | for (m = j; m < j + ysize; m++) |
129 | for (int m = j; m < j + ysize; m++) |
145 | if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<') |
130 | if (layout[l][m] != '#' && layout[l][m] != 'D' && layout[l][m] != 0) |
|
|
131 | { |
146 | is_occupied |= 1; |
132 | blocked = 1; |
|
|
133 | break; |
|
|
134 | } |
147 | } |
135 | } |
148 | } |
136 | } |
149 | if (is_occupied) |
137 | |
|
|
138 | if (blocked) |
150 | return 0; |
139 | return 0; |
|
|
140 | |
151 | *ix = i; |
141 | *ix = i; |
152 | *iy = j; |
142 | *iy = j; |
|
|
143 | |
153 | return 1; |
144 | return 1; |
154 | } |
145 | } |
155 | |
146 | |
156 | |
147 | static void |
157 | void |
|
|
158 | place_fountain_with_specials (maptile *map) |
148 | place_fountain_with_specials (maptile *map) |
159 | { |
149 | { |
160 | int ix, iy, i = -1, tries = 0; |
150 | int ix, iy, i = -1, tries = 0; |
161 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
151 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
|
|
152 | |
|
|
153 | if (!fountain_style) |
|
|
154 | { |
|
|
155 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
|
|
156 | return; |
|
|
157 | } |
|
|
158 | |
162 | object *fountain = get_archetype ("fountain"); |
159 | object *fountain = archetype::get (shstr_fountain); |
163 | object *potion = get_object (); |
160 | object *potion = fountain_style->pick_random_object (rmg_rndm)->clone (); |
164 | |
161 | |
165 | copy_object (pick_random_object (fountain_style), potion); |
|
|
166 | while (i < 0 && tries < 10) |
162 | while (i < 0 && tries < 10) |
167 | { |
163 | { |
168 | ix = RANDOM () % (MAP_WIDTH (map) - 2) + 1; |
164 | ix = rmg_rndm (map->width - 2) + 1; |
169 | iy = RANDOM () % (MAP_HEIGHT (map) - 2) + 1; |
165 | iy = rmg_rndm (map->height - 2) + 1; |
170 | i = find_first_free_spot (fountain, map, ix, iy); |
166 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
171 | tries++; |
167 | tries++; |
172 | }; |
168 | } |
|
|
169 | |
173 | if (i == -1) |
170 | if (i == -1) |
174 | { /* can't place fountain */ |
171 | { /* can't place fountain */ |
175 | free_object (fountain); |
172 | fountain->destroy (); |
176 | free_object (potion); |
173 | potion->destroy (); |
177 | return; |
174 | return; |
178 | } |
175 | } |
|
|
176 | |
179 | ix += freearr_x[i]; |
177 | ix += freearr_x[i]; |
180 | iy += freearr_y[i]; |
178 | iy += freearr_y[i]; |
181 | potion->face = fountain->face; |
179 | potion->face = fountain->face; |
182 | SET_FLAG (potion, FLAG_NO_PICK); |
180 | SET_FLAG (potion, FLAG_NO_PICK); |
183 | SET_FLAG (potion, FLAG_IDENTIFIED); |
181 | SET_FLAG (potion, FLAG_IDENTIFIED); |
184 | potion->name = potion->name_pl = "fountain"; |
182 | potion->name = potion->name_pl = "fountain"; |
185 | potion->x = ix; |
183 | potion->x = ix; |
186 | potion->y = iy; |
184 | potion->y = iy; |
187 | potion->material = M_ADAMANT; |
185 | potion->materialname = "adamantium"; |
188 | fountain->x = ix; |
186 | fountain->x = ix; |
189 | fountain->y = iy; |
187 | fountain->y = iy; |
190 | insert_ob_in_map (fountain, map, NULL, 0); |
188 | insert_ob_in_map (fountain, map, NULL, 0); |
191 | insert_ob_in_map (potion, map, NULL, 0); |
189 | insert_ob_in_map (potion, map, NULL, 0); |
192 | |
|
|
193 | } |
190 | } |
194 | |
191 | |
195 | void |
192 | static void |
196 | place_special_exit (maptile *map, int hole_type, RMParms * RP) |
193 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
197 | { |
194 | { |
198 | int ix, iy, i = -1; |
195 | int ix, iy, i = -1; |
199 | char buf[HUGE_BUF], *style, *decor, *mon; |
196 | char buf[16384]; |
|
|
197 | const char *style, *decor, *mon; |
200 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); |
198 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); |
201 | int g_xsize, g_ysize; |
199 | int g_xsize, g_ysize; |
202 | |
200 | |
203 | object *the_exit = get_object (); |
201 | if (!exit_style) |
|
|
202 | { |
|
|
203 | LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n"); |
|
|
204 | return; |
|
|
205 | } |
204 | |
206 | |
205 | if (!exit_style) |
207 | if (!exit_style) |
206 | return; |
208 | return; |
207 | |
209 | |
208 | copy_object (pick_random_object (exit_style), the_exit); |
210 | object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone (); |
209 | |
211 | |
210 | while (i < 0) |
212 | // put an upper bound here, just in case |
211 | { |
213 | for (int repeat = 8192; --repeat; ) |
212 | ix = RANDOM () % (MAP_WIDTH (map) - 2) + 1; |
|
|
213 | iy = RANDOM () % (MAP_HEIGHT (map) - 2) + 1; |
|
|
214 | i = find_first_free_spot (the_exit, map, ix, iy); |
|
|
215 | } |
214 | { |
|
|
215 | ix = rmg_rndm (1, map->width - 2); |
|
|
216 | iy = rmg_rndm (1, map->height - 2); |
216 | |
217 | |
|
|
218 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
|
|
219 | if (i >= 0) |
|
|
220 | { |
217 | ix += freearr_x[i]; |
221 | ix += freearr_x[i]; |
218 | iy += freearr_y[i]; |
222 | iy += freearr_y[i]; |
|
|
223 | break; |
|
|
224 | } |
|
|
225 | } |
|
|
226 | |
219 | the_exit->x = ix; |
227 | the_exit->x = ix; |
220 | the_exit->y = iy; |
228 | the_exit->y = iy; |
221 | |
229 | |
222 | if (!hole_type) |
230 | if (!hole_type) |
223 | hole_type = RANDOM () % NR_OF_HOLE_TYPES + 1; |
231 | hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1; |
224 | |
232 | |
225 | switch (hole_type) |
233 | switch (hole_type) |
226 | { |
234 | { |
227 | case GLORY_HOLE: /* treasures */ |
235 | case GLORY_HOLE: /* treasures */ |
228 | { |
236 | { |
229 | g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4; |
237 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
230 | g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4; |
238 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
231 | style = "onion"; |
239 | style = "onion"; |
232 | decor = "wealth2"; |
240 | decor = "wealth2"; |
233 | mon = "none"; |
241 | mon = "none"; |
234 | break; |
|
|
235 | } |
|
|
236 | |
|
|
237 | case ORC_ZONE: /* hole with orcs in it. */ |
|
|
238 | { |
|
|
239 | g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4; |
|
|
240 | g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4; |
|
|
241 | style = "onion"; |
|
|
242 | decor = "wealth2"; |
|
|
243 | mon = "orc"; |
|
|
244 | break; |
|
|
245 | } |
|
|
246 | |
|
|
247 | case MINING_ZONE: /* hole with orcs in it. */ |
|
|
248 | { |
|
|
249 | g_xsize = RANDOM () % 9 + 4 + RP->difficulty / 4; |
|
|
250 | g_ysize = RANDOM () % 9 + 4 + RP->difficulty / 4; |
|
|
251 | style = "maze"; |
|
|
252 | decor = "minerals2"; |
|
|
253 | mon = "none"; |
|
|
254 | break; |
|
|
255 | } |
|
|
256 | |
|
|
257 | default: /* undefined */ |
|
|
258 | LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type); |
|
|
259 | return; |
|
|
260 | break; |
242 | break; |
|
|
243 | } |
|
|
244 | |
|
|
245 | case ORC_ZONE: /* hole with orcs in it. */ |
|
|
246 | { |
|
|
247 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
|
|
248 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
|
|
249 | style = "onion"; |
|
|
250 | decor = "wealth2"; |
|
|
251 | mon = "orc"; |
|
|
252 | break; |
|
|
253 | } |
|
|
254 | |
|
|
255 | case MINING_ZONE: /* hole with orcs in it. */ |
|
|
256 | { |
|
|
257 | g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
|
|
258 | g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
|
|
259 | style = "maze"; |
|
|
260 | decor = "minerals2"; |
|
|
261 | mon = "none"; |
|
|
262 | break; |
|
|
263 | } |
|
|
264 | |
|
|
265 | default: /* undefined */ |
|
|
266 | LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type); |
|
|
267 | return; |
|
|
268 | break; |
261 | } |
269 | } |
262 | |
270 | |
263 | /* Need to be at least this size, otherwise the load |
271 | /* Need to be at least this size, otherwise the load |
264 | * code will generate new size values which are too large. |
272 | * code will generate new size values which are too large. |
265 | */ |
273 | */ |
266 | if (g_xsize < MIN_RANDOM_MAP_SIZE) |
274 | if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE; |
267 | g_xsize = MIN_RANDOM_MAP_SIZE; |
275 | if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE; |
268 | if (g_ysize < MIN_RANDOM_MAP_SIZE) |
|
|
269 | g_ysize = MIN_RANDOM_MAP_SIZE; |
|
|
270 | |
276 | |
271 | write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, |
277 | write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, |
272 | "none", style, decor, "none", RP->exitstyle, 0, 0, 0, |
278 | "none", style, decor, "none", RP->exitstyle, 0, 0, 0, |
273 | OPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, |
279 | RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, |
274 | RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); |
280 | RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); |
275 | the_exit->slaying = "/!"; |
281 | the_exit->slaying = "/!"; |
276 | the_exit->msg = buf; |
282 | the_exit->msg = buf; |
277 | |
283 | |
278 | insert_ob_in_map (the_exit, map, NULL, 0); |
284 | insert_ob_in_map (the_exit, map, NULL, 0); |
279 | } |
285 | } |
280 | |
286 | |
281 | |
|
|
282 | void |
287 | void |
283 | place_specials_in_map (maptile *map, char **layout, RMParms * RP) |
288 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
284 | { |
289 | { |
285 | maptile *special_map; |
290 | switch (rmg_rndm (NUM_OF_SPECIAL_TYPES)) |
286 | int ix, iy; /* map insertion locatons */ |
|
|
287 | int special_type; /* type of special to make */ |
|
|
288 | |
|
|
289 | |
|
|
290 | special_type = RANDOM () % NUM_OF_SPECIAL_TYPES; |
|
|
291 | switch (special_type) |
|
|
292 | { |
291 | { |
293 | |
292 | case SPECIAL_SUBMAP: |
|
|
293 | { |
294 | /* includes a special map into the random map being made. */ |
294 | /* includes a special map into the random map being made. */ |
295 | case SPECIAL_SUBMAP: |
|
|
296 | { |
|
|
297 | special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
295 | maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
|
|
296 | |
298 | if (special_map == NULL) |
297 | if (!special_map) |
299 | return; |
298 | break; |
300 | |
299 | |
|
|
300 | int ix, iy; /* map insertion locatons */ |
|
|
301 | |
301 | if (find_spot_for_submap (map, layout, &ix, &iy, MAP_WIDTH (special_map), MAP_HEIGHT (special_map))) |
302 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
|
|
303 | { |
|
|
304 | /* First, splatter everything in the dest map at the location */ |
|
|
305 | nuke_map_region (map, layout, ix, iy, special_map->width, special_map->height); |
302 | include_map_in_map (map, special_map, ix, iy); |
306 | include_map_in_map (map, special_map, ix, iy); |
303 | break; |
|
|
304 | } |
307 | } |
|
|
308 | } |
305 | |
309 | |
|
|
310 | break; |
|
|
311 | |
|
|
312 | case SPECIAL_FOUNTAIN: |
306 | /* Make a special fountain: an unpickable potion disguised as |
313 | /* Make a special fountain: an unpickable potion disguised as |
307 | a fountain, or rather, colocated with a fountain. */ |
314 | a fountain, or rather, colocated with a fountain. */ |
308 | case SPECIAL_FOUNTAIN: |
|
|
309 | { |
|
|
310 | place_fountain_with_specials (map); |
315 | place_fountain_with_specials (map); |
311 | break; |
316 | break; |
312 | } |
|
|
313 | |
317 | |
|
|
318 | case SPECIAL_EXIT: |
314 | /* Make an exit to another random map, e.g. a gloryhole. */ |
319 | /* Make an exit to another random map, e.g. a gloryhole. */ |
315 | case SPECIAL_EXIT: |
|
|
316 | { |
|
|
317 | place_special_exit (map, 0, RP); |
320 | place_special_exit (map, 0, RP); |
318 | break; |
321 | break; |
319 | } |
|
|
320 | } |
322 | } |
321 | |
|
|
322 | } |
323 | } |
|
|
324 | |