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.15 by root, Mon Jan 15 15:54:19 2007 UTC vs.
Revision 1.52 by root, Fri Jul 2 15:03:57 2010 UTC

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

Diff Legend

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