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.24 by root, Sun Jul 1 05:00:19 2007 UTC vs.
Revision 1.35 by root, Mon Sep 29 10:32:50 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 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 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 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * 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,
… …
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * 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
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/* Specials in this file: 24/* Specials in this file:
25 included maps */ 25 included maps */
26 26
… …
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
43is cleared with the top left corner at xstart, ystart */ 44 * is cleared with the top left corner at xstart, ystart
44 45 */
45void 46static void
46nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize) 47nuke_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 tmp->remove ();
61 tmp->destroy (); 61 head->destroy ();
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 67static void
74
75void
76include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) 68include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y)
77{ 69{
78 int i, j;
79 object *tmp;
80 object *new_ob;
81
82 /* First, splatter everything in the dest map at the location */
83 nuke_map_region (dest_map, x, y, in_map->width, in_map->height);
84
85 for (i = 0; i < in_map->width; i++) 70 for (int i = 0; i < in_map->width; i++)
86 for (j = 0; j < in_map->height; j++) 71 for (int j = 0; j < in_map->height; 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
105int 87static int
106find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) 88find_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 || 2 * ysize > map->height) 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 = rndm (map->width - xsize - 2) + 1; 103 i = rmg_rndm (1, map->width - xsize - 2);
123 j = rndm (map->height - 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 = rndm (map->width - xsize - 2) + 1; 123 i = rmg_rndm (1, map->width - xsize - 2);
141 j = rndm (map->height - 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 147static void
157void
158place_fountain_with_specials (maptile *map) 148place_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);
162 152
… …
164 { 154 {
165 LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); 155 LOG (llevError, "unable to load stylemap /styles/misc fountains\n");
166 return; 156 return;
167 } 157 }
168 158
169 object *fountain = get_archetype ("fountain"); 159 object *fountain = archetype::get (shstr_fountain);
170 object *potion = object::create (); 160 object *potion = fountain_style->pick_random_object (rmg_rndm)->clone ();
171
172 fountain_style->pick_random_object ()->copy_to (potion);
173 161
174 while (i < 0 && tries < 10) 162 while (i < 0 && tries < 10)
175 { 163 {
176 ix = rndm (map->width - 2) + 1; 164 ix = rmg_rndm (map->width - 2) + 1;
177 iy = rndm (map->height - 2) + 1; 165 iy = rmg_rndm (map->height - 2) + 1;
178 i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); 166 i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1);
179 tries++; 167 tries++;
180 } 168 }
181 169
182 if (i == -1) 170 if (i == -1)
… …
199 fountain->y = iy; 187 fountain->y = iy;
200 insert_ob_in_map (fountain, map, NULL, 0); 188 insert_ob_in_map (fountain, map, NULL, 0);
201 insert_ob_in_map (potion, map, NULL, 0); 189 insert_ob_in_map (potion, map, NULL, 0);
202} 190}
203 191
204void 192static void
205place_special_exit (maptile *map, int hole_type, random_map_params *RP) 193place_special_exit (maptile *map, int hole_type, random_map_params *RP)
206{ 194{
207 int ix, iy, i = -1; 195 int ix, iy, i = -1;
208 char buf[16384]; 196 char buf[16384];
209 const char *style, *decor, *mon; 197 const char *style, *decor, *mon;
210 maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); 198 maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1);
211 int g_xsize, g_ysize; 199 int g_xsize, g_ysize;
212 200
213 if (!exit_style) 201 if (!exit_style)
214 { 202 {
215 LOG (llevError, "unabel to load stylemap /styles/misc obscure_exits\n"); 203 LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n");
216 return; 204 return;
217 } 205 }
218
219 object *the_exit = object::create ();
220 206
221 if (!exit_style) 207 if (!exit_style)
222 return; 208 return;
223 209
224 exit_style->pick_random_object ()->copy_to (the_exit); 210 object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone ();
225 211
226 while (i < 0) 212 // put an upper bound here, just in case
213 for (int repeat = 8192; --repeat; )
227 { 214 {
228 ix = rndm (map->width - 2) + 1; 215 ix = rmg_rndm (1, map->width - 2);
229 iy = rndm (map->height - 2) + 1; 216 iy = rmg_rndm (1, map->height - 2);
217
230 i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); 218 i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1);
231 } 219 if (i >= 0)
232 220 {
233 ix += freearr_x[i]; 221 ix += freearr_x[i];
234 iy += freearr_y[i]; 222 iy += freearr_y[i];
223 break;
224 }
225 }
226
235 the_exit->x = ix; 227 the_exit->x = ix;
236 the_exit->y = iy; 228 the_exit->y = iy;
237 229
238 if (!hole_type) 230 if (!hole_type)
239 hole_type = rndm (NR_OF_HOLE_TYPES) + 1; 231 hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1;
240 232
241 switch (hole_type) 233 switch (hole_type)
242 { 234 {
243 case GLORY_HOLE: /* treasures */ 235 case GLORY_HOLE: /* treasures */
244 { 236 {
245 g_xsize = rndm (3) + 4 + RP->difficulty / 4; 237 g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
246 g_ysize = rndm (3) + 4 + RP->difficulty / 4; 238 g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
247 style = "onion"; 239 style = "onion";
248 decor = "wealth2"; 240 decor = "wealth2";
249 mon = "none"; 241 mon = "none";
250 break; 242 break;
251 } 243 }
252 244
253 case ORC_ZONE: /* hole with orcs in it. */ 245 case ORC_ZONE: /* hole with orcs in it. */
254 { 246 {
255 g_xsize = rndm (3) + 4 + RP->difficulty / 4; 247 g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
256 g_ysize = rndm (3) + 4 + RP->difficulty / 4; 248 g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
257 style = "onion"; 249 style = "onion";
258 decor = "wealth2"; 250 decor = "wealth2";
259 mon = "orc"; 251 mon = "orc";
260 break; 252 break;
261 } 253 }
262 254
263 case MINING_ZONE: /* hole with orcs in it. */ 255 case MINING_ZONE: /* hole with orcs in it. */
264 { 256 {
265 g_xsize = rndm (9) + 4 + RP->difficulty / 4; 257 g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4;
266 g_ysize = rndm (9) + 4 + RP->difficulty / 4; 258 g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4;
267 style = "maze"; 259 style = "maze";
268 decor = "minerals2"; 260 decor = "minerals2";
269 mon = "none"; 261 mon = "none";
270 break; 262 break;
271 } 263 }
… …
277 } 269 }
278 270
279 /* Need to be at least this size, otherwise the load 271 /* Need to be at least this size, otherwise the load
280 * code will generate new size values which are too large. 272 * code will generate new size values which are too large.
281 */ 273 */
282 if (g_xsize < MIN_RANDOM_MAP_SIZE) 274 if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE;
283 g_xsize = MIN_RANDOM_MAP_SIZE; 275 if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE;
284 if (g_ysize < MIN_RANDOM_MAP_SIZE)
285 g_ysize = MIN_RANDOM_MAP_SIZE;
286 276
287 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,
288 "none", style, decor, "none", RP->exitstyle, 0, 0, 0, 278 "none", style, decor, "none", RP->exitstyle, 0, 0, 0,
289 RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, 279 RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level,
290 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);
… …
292 the_exit->msg = buf; 282 the_exit->msg = buf;
293 283
294 insert_ob_in_map (the_exit, map, NULL, 0); 284 insert_ob_in_map (the_exit, map, NULL, 0);
295} 285}
296 286
297
298void 287void
299place_specials_in_map (maptile *map, char **layout, random_map_params *RP) 288place_specials_in_map (maptile *map, char **layout, random_map_params *RP)
300{ 289{
301 maptile *special_map; 290 switch (rmg_rndm (NUM_OF_SPECIAL_TYPES))
302 int ix, iy; /* map insertion locatons */
303 int special_type; /* type of special to make */
304
305 special_type = rndm (NUM_OF_SPECIAL_TYPES);
306
307 switch (special_type)
308 { 291 {
309 case SPECIAL_SUBMAP: 292 case SPECIAL_SUBMAP:
293 {
310 /* includes a special map into the random map being made. */ 294 /* includes a special map into the random map being made. */
311 special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); 295 maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
312 296
313 if (!special_map) 297 if (!special_map)
314 return; 298 break;
315 299
300 int ix, iy; /* map insertion locatons */
301
316 if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) 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);
317 include_map_in_map (map, special_map, ix, iy); 306 include_map_in_map (map, special_map, ix, iy);
307 }
308 }
318 309
319 break; 310 break;
320 311
321 case SPECIAL_FOUNTAIN: 312 case SPECIAL_FOUNTAIN:
322 /* Make a special fountain: an unpickable potion disguised as 313 /* Make a special fountain: an unpickable potion disguised as
… …
327 case SPECIAL_EXIT: 318 case SPECIAL_EXIT:
328 /* Make an exit to another random map, e.g. a gloryhole. */ 319 /* Make an exit to another random map, e.g. a gloryhole. */
329 place_special_exit (map, 0, RP); 320 place_special_exit (map, 0, RP);
330 break; 321 break;
331 } 322 }
332
333} 323}
324

Diff Legend

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