ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/special.C
Revision: 1.29
Committed: Fri May 2 21:01:53 2008 UTC (16 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.28: +3 -7 lines
Log Message:
remove all easy cases of copy_to, mostly replace by clone or instance

File Contents

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