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.51 by root, Wed Jun 30 01:32:57 2010 UTC

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

Diff Legend

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