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