ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/special.C
(Generate patch)

Comparing deliantra/server/random_maps/special.C (file contents):
Revision 1.7 by root, Tue Dec 12 20:53:03 2006 UTC vs.
Revision 1.25 by root, Thu Aug 9 21:00:42 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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 at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <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>
… …
49 object *tmp; 49 object *tmp;
50 50
51 for (i = xstart; i < xstart + xsize; i++) 51 for (i = xstart; i < xstart + xsize; i++)
52 for (j = ystart; j < ystart + ysize; j++) 52 for (j = ystart; j < ystart + ysize; j++)
53 { 53 {
54 for (tmp = get_map_ob (map, i, j); tmp != NULL; tmp = tmp->above) 54 for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above)
55 { 55 {
56 if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 56 if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR))
57 { 57 {
58 if (tmp->head) 58 if (tmp->head)
59 tmp = tmp->head; 59 tmp = tmp->head;
60 tmp->remove (); 60 tmp->remove ();
61 tmp->destroy (0); 61 tmp->destroy ();
62 tmp = get_map_ob (map, i, j); 62 tmp = GET_MAP_OB (map, i, j);
63 } 63 }
64 if (tmp == NULL) 64 if (tmp == NULL)
65 break; 65 break;
66 } 66 }
67 } 67 }
… …
78 int i, j; 78 int i, j;
79 object *tmp; 79 object *tmp;
80 object *new_ob; 80 object *new_ob;
81 81
82 /* First, splatter everything in the dest map at the location */ 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)); 83 nuke_map_region (dest_map, x, y, in_map->width, in_map->height);
84 84
85 for (i = 0; i < MAP_WIDTH (in_map); i++) 85 for (i = 0; i < in_map->width; i++)
86 for (j = 0; j < MAP_HEIGHT (in_map); j++) 86 for (j = 0; j < in_map->height; j++)
87 { 87 {
88 for (tmp = get_map_ob (in_map, i, j); tmp != NULL; tmp = tmp->above) 88 for (tmp = GET_MAP_OB (in_map, i, j); tmp != NULL; tmp = tmp->above)
89 { 89 {
90 /* don't copy things with multiple squares: must be dealt with 90 /* don't copy things with multiple squares: must be dealt with
91 specially. */ 91 specially. */
92 if (tmp->head != NULL) 92 if (tmp->head != NULL)
93 continue; 93 continue;
… …
110 int is_occupied = 0; 110 int is_occupied = 0;
111 int l, m; 111 int l, m;
112 112
113 /* don't even try to place a submap into a map if the big map isn't 113 /* don't even try to place a submap into a map if the big map isn't
114 sufficiently large. */ 114 sufficiently large. */
115 if (2 * xsize > MAP_WIDTH (map) || 2 * ysize > MAP_HEIGHT (map)) 115 if (2 * xsize > map->width || 2 * ysize > map->height)
116 return 0; 116 return 0;
117 117
118 /* search a bit for a completely free spot. */ 118 /* search a bit for a completely free spot. */
119 for (tries = 0; tries < 20; tries++) 119 for (tries = 0; tries < 20; tries++)
120 { 120 {
121 /* pick a random location in the layout */ 121 /* pick a random location in the layout */
122 i = RANDOM () % (MAP_WIDTH (map) - xsize - 2) + 1; 122 i = rndm (map->width - xsize - 2) + 1;
123 j = RANDOM () % (MAP_HEIGHT (map) - ysize - 2) + 1; 123 j = rndm (map->height - ysize - 2) + 1;
124 is_occupied = 0; 124 is_occupied = 0;
125 for (l = i; l < i + xsize; l++) 125 for (l = i; l < i + xsize; l++)
126 for (m = j; m < j + ysize; m++) 126 for (m = j; m < j + ysize; m++)
127 is_occupied |= layout[l][m]; 127 is_occupied |= layout[l][m];
128 if (!is_occupied) 128 if (!is_occupied)
… …
135 if (is_occupied) 135 if (is_occupied)
136 { /* failure, try a relaxed placer. */ 136 { /* failure, try a relaxed placer. */
137 /* pick a random location in the layout */ 137 /* pick a random location in the layout */
138 for (tries = 0; tries < 10; tries++) 138 for (tries = 0; tries < 10; tries++)
139 { 139 {
140 i = RANDOM () % (MAP_WIDTH (map) - xsize - 2) + 1; 140 i = rndm (map->width - xsize - 2) + 1;
141 j = RANDOM () % (MAP_HEIGHT (map) - ysize - 2) + 1; 141 j = rndm (map->height - ysize - 2) + 1;
142 is_occupied = 0; 142 is_occupied = 0;
143 for (l = i; l < i + xsize; l++) 143 for (l = i; l < i + xsize; l++)
144 for (m = j; m < j + ysize; m++) 144 for (m = j; m < j + ysize; m++)
145 if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<') 145 if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<')
146 is_occupied |= 1; 146 is_occupied |= 1;
… …
157void 157void
158place_fountain_with_specials (maptile *map) 158place_fountain_with_specials (maptile *map)
159{ 159{
160 int ix, iy, i = -1, tries = 0; 160 int ix, iy, i = -1, tries = 0;
161 maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); 161 maptile *fountain_style = find_style ("/styles/misc", "fountains", -1);
162
163 if (!fountain_style)
164 {
165 LOG (llevError, "unable to load stylemap /styles/misc fountains\n");
166 return;
167 }
168
162 object *fountain = get_archetype ("fountain"); 169 object *fountain = get_archetype ("fountain");
163 object *potion = get_object (); 170 object *potion = object::create ();
164 171
165 copy_object (pick_random_object (fountain_style), potion); 172 fountain_style->pick_random_object ()->copy_to (potion);
173
166 while (i < 0 && tries < 10) 174 while (i < 0 && tries < 10)
167 { 175 {
168 ix = RANDOM () % (MAP_WIDTH (map) - 2) + 1; 176 ix = rndm (map->width - 2) + 1;
169 iy = RANDOM () % (MAP_HEIGHT (map) - 2) + 1; 177 iy = rndm (map->height - 2) + 1;
170 i = find_first_free_spot (fountain, map, ix, iy); 178 i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1);
171 tries++; 179 tries++;
172 }; 180 }
181
173 if (i == -1) 182 if (i == -1)
174 { /* can't place fountain */ 183 { /* can't place fountain */
175 fountain->destroy (0); 184 fountain->destroy ();
176 potion->destroy (0); 185 potion->destroy ();
177 return; 186 return;
178 } 187 }
188
179 ix += freearr_x[i]; 189 ix += freearr_x[i];
180 iy += freearr_y[i]; 190 iy += freearr_y[i];
181 potion->face = fountain->face; 191 potion->face = fountain->face;
182 SET_FLAG (potion, FLAG_NO_PICK); 192 SET_FLAG (potion, FLAG_NO_PICK);
183 SET_FLAG (potion, FLAG_IDENTIFIED); 193 SET_FLAG (potion, FLAG_IDENTIFIED);
184 potion->name = potion->name_pl = "fountain"; 194 potion->name = potion->name_pl = "fountain";
185 potion->x = ix; 195 potion->x = ix;
186 potion->y = iy; 196 potion->y = iy;
187 potion->material = M_ADAMANT; 197 potion->materialname = "adamantium";
188 fountain->x = ix; 198 fountain->x = ix;
189 fountain->y = iy; 199 fountain->y = iy;
190 insert_ob_in_map (fountain, map, NULL, 0); 200 insert_ob_in_map (fountain, map, NULL, 0);
191 insert_ob_in_map (potion, map, NULL, 0); 201 insert_ob_in_map (potion, map, NULL, 0);
192
193} 202}
194 203
195void 204void
196place_special_exit (maptile *map, int hole_type, RMParms * RP) 205place_special_exit (maptile *map, int hole_type, random_map_params *RP)
197{ 206{
198 int ix, iy, i = -1; 207 int ix, iy, i = -1;
199 char buf[HUGE_BUF], *style, *decor, *mon; 208 char buf[16384];
209 const char *style, *decor, *mon;
200 maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); 210 maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1);
201 int g_xsize, g_ysize; 211 int g_xsize, g_ysize;
202 212
213 if (!exit_style)
214 {
215 LOG (llevError, "unabel to load stylemap /styles/misc obscure_exits\n");
216 return;
217 }
218
203 object *the_exit = get_object (); 219 object *the_exit = object::create ();
204 220
205 if (!exit_style) 221 if (!exit_style)
206 return; 222 return;
207 223
208 copy_object (pick_random_object (exit_style), the_exit); 224 exit_style->pick_random_object ()->copy_to (the_exit);
209 225
210 while (i < 0) 226 // put an upper bound here, just in case
211 { 227 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 } 228 {
229 ix = rndm (map->width - 2) + 1;
230 iy = rndm (map->height - 2) + 1;
216 231
232 i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1);
233 if (i >= 0)
234 {
217 ix += freearr_x[i]; 235 ix += freearr_x[i];
218 iy += freearr_y[i]; 236 iy += freearr_y[i];
237 break;
238 }
239 }
240
219 the_exit->x = ix; 241 the_exit->x = ix;
220 the_exit->y = iy; 242 the_exit->y = iy;
221 243
222 if (!hole_type) 244 if (!hole_type)
223 hole_type = RANDOM () % NR_OF_HOLE_TYPES + 1; 245 hole_type = rndm (NR_OF_HOLE_TYPES) + 1;
224 246
225 switch (hole_type) 247 switch (hole_type)
226 { 248 {
227 case GLORY_HOLE: /* treasures */ 249 case GLORY_HOLE: /* treasures */
228 { 250 {
229 g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4; 251 g_xsize = rndm (3) + 4 + RP->difficulty / 4;
230 g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4; 252 g_ysize = rndm (3) + 4 + RP->difficulty / 4;
231 style = "onion"; 253 style = "onion";
232 decor = "wealth2"; 254 decor = "wealth2";
233 mon = "none"; 255 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; 256 break;
257 }
258
259 case ORC_ZONE: /* hole with orcs in it. */
260 {
261 g_xsize = rndm (3) + 4 + RP->difficulty / 4;
262 g_ysize = rndm (3) + 4 + RP->difficulty / 4;
263 style = "onion";
264 decor = "wealth2";
265 mon = "orc";
266 break;
267 }
268
269 case MINING_ZONE: /* hole with orcs in it. */
270 {
271 g_xsize = rndm (9) + 4 + RP->difficulty / 4;
272 g_ysize = rndm (9) + 4 + RP->difficulty / 4;
273 style = "maze";
274 decor = "minerals2";
275 mon = "none";
276 break;
277 }
278
279 default: /* undefined */
280 LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type);
281 return;
282 break;
261 } 283 }
262 284
263 /* Need to be at least this size, otherwise the load 285 /* Need to be at least this size, otherwise the load
264 * code will generate new size values which are too large. 286 * code will generate new size values which are too large.
265 */ 287 */
… …
268 if (g_ysize < MIN_RANDOM_MAP_SIZE) 290 if (g_ysize < MIN_RANDOM_MAP_SIZE)
269 g_ysize = MIN_RANDOM_MAP_SIZE; 291 g_ysize = MIN_RANDOM_MAP_SIZE;
270 292
271 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, 293 write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon,
272 "none", style, decor, "none", RP->exitstyle, 0, 0, 0, 294 "none", style, decor, "none", RP->exitstyle, 0, 0, 0,
273 OPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, 295 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); 296 RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase);
275 the_exit->slaying = "/!"; 297 the_exit->slaying = "/!";
276 the_exit->msg = buf; 298 the_exit->msg = buf;
277 299
278 insert_ob_in_map (the_exit, map, NULL, 0); 300 insert_ob_in_map (the_exit, map, NULL, 0);
279} 301}
280 302
281 303
282void 304void
283place_specials_in_map (maptile *map, char **layout, RMParms * RP) 305place_specials_in_map (maptile *map, char **layout, random_map_params *RP)
284{ 306{
285 maptile *special_map; 307 maptile *special_map;
286 int ix, iy; /* map insertion locatons */ 308 int ix, iy; /* map insertion locatons */
287 int special_type; /* type of special to make */ 309 int special_type; /* type of special to make */
288 310
289
290 special_type = RANDOM () % NUM_OF_SPECIAL_TYPES; 311 special_type = rndm (NUM_OF_SPECIAL_TYPES);
312
291 switch (special_type) 313 switch (special_type)
292 { 314 {
293 315 case SPECIAL_SUBMAP:
294 /* includes a special map into the random map being made. */ 316 /* 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); 317 special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
318
298 if (special_map == NULL) 319 if (!special_map)
299 return; 320 return;
300 321
301 if (find_spot_for_submap (map, layout, &ix, &iy, MAP_WIDTH (special_map), MAP_HEIGHT (special_map))) 322 if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height))
302 include_map_in_map (map, special_map, ix, iy); 323 include_map_in_map (map, special_map, ix, iy);
324
303 break; 325 break;
304 }
305 326
327 case SPECIAL_FOUNTAIN:
306 /* Make a special fountain: an unpickable potion disguised as 328 /* Make a special fountain: an unpickable potion disguised as
307 a fountain, or rather, colocated with a fountain. */ 329 a fountain, or rather, colocated with a fountain. */
308 case SPECIAL_FOUNTAIN:
309 {
310 place_fountain_with_specials (map); 330 place_fountain_with_specials (map);
311 break; 331 break;
312 }
313 332
333 case SPECIAL_EXIT:
314 /* Make an exit to another random map, e.g. a gloryhole. */ 334 /* Make an exit to another random map, e.g. a gloryhole. */
315 case SPECIAL_EXIT:
316 {
317 place_special_exit (map, 0, RP); 335 place_special_exit (map, 0, RP);
318 break; 336 break;
319 }
320 } 337 }
321 338
322} 339}

Diff Legend

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