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

Comparing deliantra/server/random_maps/treasure.C (file contents):
Revision 1.25 by root, Sat Feb 17 23:32:11 2007 UTC vs.
Revision 1.48 by root, Sun Nov 29 17:41:07 2009 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * 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
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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 Affero GNU General Public License
19 * 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
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * 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>
23 */ 23 */
24 24
25/* placing treasure in maps, where appropriate. */ 25/* placing treasure in maps, where appropriate. */
26 26
27#include <global.h> 27#include <global.h>
… …
41#define LAST_OPTION 64 /* set this to the last real option, for random */ 41#define LAST_OPTION 64 /* set this to the last real option, for random */
42 42
43#define NO_PASS_DOORS 0 43#define NO_PASS_DOORS 0
44#define PASS_DOORS 1 44#define PASS_DOORS 1
45 45
46static object *find_closest_monster (maptile *map, int x, int y, random_map_params *RP);
47static object *find_monster_in_room (maptile *map, int x, int y, random_map_params *RP);
48static void find_spot_in_room_recursive (char **layout, int x, int y, random_map_params *RP);
49static void find_spot_in_room (maptile *map, int x, int y, int *kx, int *ky, random_map_params *RP);
50static object *place_chest (int treasureoptions, int x, int y, maptile *map, maptile *style_map, int n_treasures, random_map_params *RP);
51static object **find_doors_in_room (maptile *map, int x, int y, random_map_params *RP);
52static void lock_and_hide_doors (object **doorlist, maptile *map, int opts, random_map_params *RP);
53static void find_enclosed_spot (maptile *map, int *cx, int *cy, random_map_params *RP);
54static object **surround_by_doors (maptile *map, char **layout, int x, int y, int opts);
55
46/* a macro to get a strongly centered random distribution, 56/* a macro to get a strongly centered random distribution,
47 from 0 to x, centered at x/2 */ 57 from 0 to x, centered at x/2 */
48static int 58static int
49bc_random (int x) 59bc_random (int x)
50{ 60{
51 return (rndm (x) + rndm (x) + rndm (x)) / 3; 61 return (rmg_rndm (x) + rmg_rndm (x) + rmg_rndm (x)) / 3;
62}
63
64static object *
65gen_key (const shstr &keycode)
66{
67 /* get a key and set its keycode */
68 object *key = archetype::get (shstr_key_random_map);
69 key->slaying = keycode;
70 return key;
71}
72
73/* places keys in the map, preferably in something alive.
74 keycode is the key's code,
75 door_flag is either PASS_DOORS or NO_PASS_DOORS.
76 NO_PASS_DOORS won't cross doors or walls to keyplace, PASS_DOORS will.
77 if n_keys is 1, it will place 1 key. if n_keys >1, it will place 2-4 keys:
78 it will place 2-4 keys regardless of what nkeys is provided nkeys > 1.
79
80 The idea is that you call keyplace on x,y where a door is, and it'll make
81 sure a key is placed on both sides of the door.
82*/
83static int
84keyplace (maptile *map, int x, int y, const shstr &keycode, int door_flag, int n_keys, random_map_params *RP)
85{
86 int i, j;
87 int kx = 0, ky = 0;
88 object *the_keymaster; /* the monster that gets the key. */
89 object *the_key = gen_key (keycode);
90
91 if (door_flag == PASS_DOORS)
92 {
93 int tries = 0;
94
95 the_keymaster = 0;
96 while (tries < 15 && !the_keymaster)
97 {
98 i = rmg_rndm (RP->Xsize - 2) + 1;
99 j = rmg_rndm (RP->Ysize - 2) + 1;
100 tries++;
101 the_keymaster = find_closest_monster (map, i, j, RP);
102 }
103
104 /* if we don't find a good keymaster, drop the key on the ground. */
105 if (!the_keymaster)
106 {
107 int freeindex;
108
109 freeindex = -1;
110 for (tries = 0; tries < 15 && freeindex == -1; tries++)
111 {
112 kx = rmg_rndm (RP->Xsize - 2) + 1;
113 ky = rmg_rndm (RP->Ysize - 2) + 1;
114 freeindex = find_free_spot (the_key, map, kx, ky, 1, SIZEOFFREE1 + 1);
115 }
116
117 // can freeindex ever be < 0?
118 if (freeindex >= 0)
119 {
120 kx += freearr_x [freeindex];
121 ky += freearr_y [freeindex];
122 }
123 }
124 }
125 else
126 { /* NO_PASS_DOORS --we have to work harder. */
127 /* don't try to keyplace if we're sitting on a blocked square and
128 NO_PASS_DOORS is set. */
129 if (n_keys == 1)
130 {
131 if (wall_blocked (map, x, y))
132 {
133 the_key->destroy ();
134 return 0;
135 }
136
137 the_keymaster = find_monster_in_room (map, x, y, RP);
138 if (!the_keymaster) /* if fail, find a spot to drop the key. */
139 find_spot_in_room (map, x, y, &kx, &ky, RP);
140 }
141 else
142 {
143 int sum = 0; /* count how many keys we actually place */
144
145 /* I'm lazy, so just try to place in all 4 directions. */
146 sum += keyplace (map, x + 1, y, keycode, NO_PASS_DOORS, 1, RP);
147 sum += keyplace (map, x, y + 1, keycode, NO_PASS_DOORS, 1, RP);
148 sum += keyplace (map, x - 1, y, keycode, NO_PASS_DOORS, 1, RP);
149 sum += keyplace (map, x, y - 1, keycode, NO_PASS_DOORS, 1, RP);
150
151 if (sum < 2) /* we might have made a disconnected map-place more keys. */
152 { /* diagonally this time. */
153 keyplace (map, x + 1, y + 1, keycode, NO_PASS_DOORS, 1, RP);
154 keyplace (map, x + 1, y - 1, keycode, NO_PASS_DOORS, 1, RP);
155 keyplace (map, x - 1, y + 1, keycode, NO_PASS_DOORS, 1, RP);
156 keyplace (map, x - 1, y - 1, keycode, NO_PASS_DOORS, 1, RP);
157 }
158
159 the_key->destroy ();
160 return 1;
161 }
162 }
163
164 if (the_keymaster)
165 the_keymaster->head_ ()->insert (the_key);
166 else
167 {
168 the_key->x = kx;
169 the_key->y = ky;
170 insert_ob_in_map (the_key, map, NULL, 0);
171 }
172
173 return 1;
52} 174}
53 175
54/* returns true if square x,y has P_NO_PASS set, which is true for walls 176/* returns true if square x,y has P_NO_PASS set, which is true for walls
55 * and doors but not monsters. 177 * and doors but not monsters.
56 * This function is not map tile aware. 178 * This function is not map tile aware.
… …
59wall_blocked (maptile *m, int x, int y) 181wall_blocked (maptile *m, int x, int y)
60{ 182{
61 if (OUT_OF_REAL_MAP (m, x, y)) 183 if (OUT_OF_REAL_MAP (m, x, y))
62 return 1; 184 return 1;
63 185
186 m->at (x, y).update ();
64 int r = GET_MAP_MOVE_BLOCK (m, x, y) & ~MOVE_BLOCK_DEFAULT; 187 return GET_MAP_MOVE_BLOCK (m, x, y) & MOVE_WALK;
65 return r;
66} 188}
67 189
68/* place treasures in the map, given the 190/* place treasures in the map, given the
69map, (required) 191map, (required)
70layout, (required) 192layout, (required)
… …
83 if (treasure_style) 205 if (treasure_style)
84 if (!strcmp (treasure_style, "none")) 206 if (!strcmp (treasure_style, "none"))
85 return; 207 return;
86 208
87 if (treasureoptions <= 0) 209 if (treasureoptions <= 0)
88 treasureoptions = rndm (2 * LAST_OPTION); 210 treasureoptions = rmg_rndm (2 * LAST_OPTION);
89 211
90 /* filter out the mutually exclusive options */ 212 /* filter out the mutually exclusive options */
91 if ((treasureoptions & RICH) && (treasureoptions & SPARSE)) 213 if ((treasureoptions & RICH) && (treasureoptions & SPARSE))
92 { 214 {
93 if (rndm (2)) 215 if (rmg_rndm (2))
94 treasureoptions -= 1; 216 treasureoptions -= 1;
95 else 217 else
96 treasureoptions -= 2; 218 treasureoptions -= 2;
97 } 219 }
98 220
… …
119 } 241 }
120 242
121 /* all the treasure at one spot in the map. */ 243 /* all the treasure at one spot in the map. */
122 if (treasureoptions & CONCENTRATED) 244 if (treasureoptions & CONCENTRATED)
123 { 245 {
124
125 /* map_layout_style global, and is previously set */ 246 /* map_layout_style global, and is previously set */
126 switch (RP->map_layout_style) 247 switch (RP->map_layout_style)
127 { 248 {
128 case LAYOUT_ONION: 249 case LAYOUT_ONION:
129 case LAYOUT_SPIRAL: 250 case LAYOUT_SPIRAL:
… …
137 for (j = 0; j < RP->Ysize; j++) 258 for (j = 0; j < RP->Ysize; j++)
138 { 259 {
139 if (layout[i][j] == 'C' || layout[i][j] == '>') 260 if (layout[i][j] == 'C' || layout[i][j] == '>')
140 { 261 {
141 int tdiv = RP->symmetry_used; 262 int tdiv = RP->symmetry_used;
142 object **doorlist;
143 object *chest; 263 object *chest;
144 264
145 if (tdiv == 3) 265 if (tdiv == 3)
146 tdiv = 2; /* this symmetry uses a divisor of 2 */ 266 tdiv = 2; /* this symmetry uses a divisor of 2 */
267
147 /* don't put a chest on an exit. */ 268 /* don't put a chest on an exit. */
148 chest = place_chest (treasureoptions, i, j, map, style_map, num_treasures / tdiv, RP); 269 chest = place_chest (treasureoptions, i, j, map, style_map, num_treasures / tdiv, RP);
270
149 if (!chest) 271 if (!chest)
150 continue; /* if no chest was placed NEXT */ 272 continue; /* if no chest was placed NEXT */
273
151 if (treasureoptions & (DOORED | HIDDEN)) 274 if (treasureoptions & (DOORED | HIDDEN))
152 { 275 {
153 doorlist = find_doors_in_room (map, i, j, RP); 276 object **doorlist = find_doors_in_room (map, i, j, RP);
154 lock_and_hide_doors (doorlist, map, treasureoptions, RP); 277 lock_and_hide_doors (doorlist, map, treasureoptions, RP);
155 free (doorlist); 278 free (doorlist);
156 } 279 }
157 } 280 }
158 } 281 }
159 } 282 }
160 break; 283 break;
161 } 284 }
285
162 default: 286 default:
163 { 287 {
164 int i, j, tries; 288 int i, j, tries;
165 object *chest; 289 object *chest;
166 object **doorlist; 290 object **doorlist;
167 291
168 i = j = -1; 292 i = j = -1;
169 tries = 0; 293 tries = 0;
170 while (i == -1 && tries < 100) 294 while (i == -1 && tries < 100)
171 { 295 {
172 i = rndm (RP->Xsize - 2) + 1; 296 i = rmg_rndm (RP->Xsize - 2) + 1;
173 j = rndm (RP->Ysize - 2) + 1; 297 j = rmg_rndm (RP->Ysize - 2) + 1;
174 find_enclosed_spot (map, &i, &j, RP); 298 find_enclosed_spot (map, &i, &j, RP);
299
175 if (wall_blocked (map, i, j)) 300 if (wall_blocked (map, i, j))
176 i = -1; 301 i = -1;
302
177 tries++; 303 tries++;
178 } 304 }
305
179 chest = place_chest (treasureoptions, i, j, map, style_map, num_treasures, RP); 306 chest = place_chest (treasureoptions, i, j, map, style_map, num_treasures, RP);
307
180 if (!chest) 308 if (!chest)
181 return; 309 return;
310
182 i = chest->x; 311 i = chest->x;
183 j = chest->y; 312 j = chest->y;
184 if (treasureoptions & (DOORED | HIDDEN)) 313 if (treasureoptions & (DOORED | HIDDEN))
185 { 314 {
186 doorlist = surround_by_doors (map, layout, i, j, treasureoptions); 315 doorlist = surround_by_doors (map, layout, i, j, treasureoptions);
… …
194 { /* DIFFUSE treasure layout */ 323 { /* DIFFUSE treasure layout */
195 int ti, i, j; 324 int ti, i, j;
196 325
197 for (ti = 0; ti < num_treasures; ti++) 326 for (ti = 0; ti < num_treasures; ti++)
198 { 327 {
199 i = rndm (RP->Xsize - 2) + 1; 328 i = rmg_rndm (RP->Xsize - 2) + 1;
200 j = rndm (RP->Ysize - 2) + 1; 329 j = rmg_rndm (RP->Ysize - 2) + 1;
201 place_chest (treasureoptions, i, j, map, style_map, 1, RP); 330 place_chest (treasureoptions, i, j, map, style_map, 1, RP);
202 } 331 }
203 } 332 }
204} 333}
205 334
206/* put a chest into the map, near x and y, with the treasure style 335/* put a chest into the map, near x and y, with the treasure style
207 determined (may be null, or may be a treasure list from lib/treasures, 336 determined (may be null, or may be a treasure list from lib/treasures,
208 if the global variable "treasurestyle" is set to that treasure list's name */ 337 if the global variable "treasurestyle" is set to that treasure list's name */
209 338static object *
210object *
211place_chest (int treasureoptions, int x, int y, maptile *map, maptile *style_map, int n_treasures, random_map_params *RP) 339place_chest (int treasureoptions, int x, int y, maptile *map, maptile *style_map, int n_treasures, random_map_params *RP)
212{ 340{
213 object *the_chest;
214 int i, xl, yl;
215
216 the_chest = get_archetype ("chest"); /* was "chest_2" */ 341 object *the_chest = archetype::get (shstr_chest); /* was "chest_2" */
217 342
218 /* first, find a place to put the chest. */ 343 /* first, find a place to put the chest. */
219 i = find_first_free_spot (the_chest, map, x, y); 344 int i = find_first_free_spot (the_chest, map, x, y); // this call uses the main rng
220 if (i == -1) 345 if (i == -1)
221 { 346 {
222 the_chest->destroy (); 347 the_chest->destroy ();
223 return NULL; 348 return NULL;
224 } 349 }
225 350
226 xl = x + freearr_x[i]; 351 int xl = x + freearr_x[i];
227 yl = y + freearr_y[i]; 352 int yl = y + freearr_y[i];
228 353
229 /* if the placement is blocked, return a fail. */ 354 /* if the placement is blocked, return a fail. */
230 if (wall_blocked (map, xl, yl)) 355 if (wall_blocked (map, xl, yl))
231 return 0; 356 return 0;
232 357
… …
239 treasurelist *tlist = find_treasurelist (RP->treasurestyle); 364 treasurelist *tlist = find_treasurelist (RP->treasurestyle);
240 365
241 if (tlist != NULL) 366 if (tlist != NULL)
242 for (ti = 0; ti < n_treasures; ti++) 367 for (ti = 0; ti < n_treasures; ti++)
243 { /* use the treasure list */ 368 { /* use the treasure list */
244 object *new_treasure = style_map->pick_random_object (); 369 object *new_treasure = style_map->pick_random_object (rmg_rndm);
245 370
246 insert_ob_in_ob (arch_to_object (new_treasure->arch), the_chest); 371 insert_ob_in_ob (new_treasure->arch->instance (), the_chest);
247 } 372 }
248 else 373 else
249 { /* use the style map */ 374 { /* use the style map */
250 the_chest->randomitems = tlist; 375 the_chest->randomitems = tlist;
251 the_chest->stats.hp = n_treasures; 376 the_chest->stats.hp = n_treasures;
252 } 377 }
253#endif 378#endif
254 { /* neither style_map no treasure list given */ 379 { /* neither style_map no treasure list given */
255 treasurelist *tlist = find_treasurelist ("chest"); 380 treasurelist *tlist = treasurelist::find ("chest");
256 381
257 the_chest->randomitems = tlist; 382 the_chest->randomitems = tlist;
258 the_chest->stats.hp = n_treasures; 383 the_chest->stats.hp = n_treasures;
259 } 384 }
260 385
261 /* stick a trap in the chest if required */ 386 /* stick a trap in the chest if required */
262 if (treasureoptions & TRAPPED) 387 if (treasureoptions & TRAPPED)
263 { 388 {
264 maptile *trap_map = find_style ("/styles/trapstyles", "traps", -1); 389 maptile *trap_map = find_style ("/styles/trapstyles", "traps", -1);
265 object *the_trap;
266 390
267 if (trap_map) 391 if (trap_map)
268 { 392 {
269 the_trap = trap_map->pick_random_object (); 393 object *the_trap = trap_map->pick_random_object (rmg_rndm);
394
270 the_trap->stats.Cha = 10 + RP->difficulty; 395 the_trap->stats.Cha = 10 + RP->difficulty;
271 the_trap->level = bc_random ((3 * RP->difficulty) / 2); 396 the_trap->level = bc_random ((3 * RP->difficulty) / 2);
397
272 if (the_trap) 398 if (the_trap)
273 { 399 {
274 object *new_trap; 400 object *new_trap = the_trap->arch->instance ();//TODO: why not clone?
275 401
276 new_trap = arch_to_object (the_trap->arch);
277 new_trap->copy_to (the_trap);
278 new_trap->x = x; 402 new_trap->x = x;
279 new_trap->y = y; 403 new_trap->y = y;
280 insert_ob_in_ob (new_trap, the_chest); 404 insert_ob_in_ob (new_trap, the_chest);
281 } 405 }
282 } 406 }
… …
285 /* set the chest lock code, and call the keyplacer routine with 409 /* set the chest lock code, and call the keyplacer routine with
286 the lockcode. It's not worth bothering to lock the chest if 410 the lockcode. It's not worth bothering to lock the chest if
287 there's only 1 treasure.... */ 411 there's only 1 treasure.... */
288 if ((treasureoptions & KEYREQUIRED) && n_treasures > 1) 412 if ((treasureoptions & KEYREQUIRED) && n_treasures > 1)
289 { 413 {
290 char keybuf[1024]; 414 the_chest->slaying = format ("RMG-%d-%d", (int)rmg_rndm (1000000000), (int)rmg_rndm (1000000000));
291
292 sprintf (keybuf, "%d", rndm (1000000000));
293 the_chest->slaying = keybuf;
294 keyplace (map, x, y, keybuf, PASS_DOORS, 1, RP); 415 keyplace (map, x, y, the_chest->slaying, PASS_DOORS, 1, RP);
295 } 416 }
296 417
297 /* actually place the chest. */ 418 /* actually place the chest. */
298 the_chest->x = xl; 419 the_chest->x = xl;
299 the_chest->y = yl; 420 the_chest->y = yl;
300 insert_ob_in_map (the_chest, map, NULL, 0); 421 insert_ob_in_map (the_chest, map, NULL, 0);
301 return the_chest; 422 return the_chest;
302} 423}
303 424
304
305/* finds the closest monster and returns him, regardless of doors 425/* finds the closest monster and returns him, regardless of doors or walls */
306 or walls */ 426static object *
307object *
308find_closest_monster (maptile *map, int x, int y, random_map_params *RP) 427find_closest_monster (maptile *map, int x, int y, random_map_params *RP)
309{ 428{
310 int i; 429 int i;
311 430
312 for (i = 0; i < SIZEOFFREE; i++) 431 for (i = 0; i < SIZEOFFREE; i++)
… …
328 } 447 }
329 } 448 }
330 return NULL; 449 return NULL;
331} 450}
332 451
333
334
335/* places keys in the map, preferably in something alive.
336 keycode is the key's code,
337 door_flag is either PASS_DOORS or NO_PASS_DOORS.
338 NO_PASS_DOORS won't cross doors or walls to keyplace, PASS_DOORS will.
339 if n_keys is 1, it will place 1 key. if n_keys >1, it will place 2-4 keys:
340 it will place 2-4 keys regardless of what nkeys is provided nkeys > 1.
341
342 The idea is that you call keyplace on x,y where a door is, and it'll make
343 sure a key is placed on both sides of the door.
344*/
345int
346keyplace (maptile *map, int x, int y, char *keycode, int door_flag, int n_keys, random_map_params *RP)
347{
348 int i, j;
349 int kx = 0, ky = 0;
350 object *the_keymaster; /* the monster that gets the key. */
351 object *the_key;
352
353 /* get a key and set its keycode */
354 the_key = get_archetype ("key2");
355 the_key->slaying = keycode;
356
357 if (door_flag == PASS_DOORS)
358 {
359 int tries = 0;
360
361 the_keymaster = 0;
362 while (tries < 15 && !the_keymaster)
363 {
364 i = rndm (RP->Xsize - 2) + 1;
365 j = rndm (RP->Ysize - 2) + 1;
366 tries++;
367 the_keymaster = find_closest_monster (map, i, j, RP);
368 }
369
370 /* if we don't find a good keymaster, drop the key on the ground. */
371 if (!the_keymaster)
372 {
373 int freeindex;
374
375 freeindex = -1;
376 for (tries = 0; tries < 15 && freeindex == -1; tries++)
377 {
378 kx = rndm (RP->Xsize - 2) + 1;
379 ky = rndm (RP->Ysize - 2) + 1;
380 freeindex = find_free_spot (the_key, map, kx, ky, 1, SIZEOFFREE1 + 1);
381 }
382
383 // can freeindex ever be < 0?
384 if (freeindex >= 0)
385 {
386 kx += freearr_x [freeindex];
387 ky += freearr_y [freeindex];
388 }
389 }
390 }
391 else
392 { /* NO_PASS_DOORS --we have to work harder. */
393 /* don't try to keyplace if we're sitting on a blocked square and
394 NO_PASS_DOORS is set. */
395 if (n_keys == 1)
396 {
397 if (wall_blocked (map, x, y))
398 return 0;
399
400 the_keymaster = find_monster_in_room (map, x, y, RP);
401 if (!the_keymaster) /* if fail, find a spot to drop the key. */
402 find_spot_in_room (map, x, y, &kx, &ky, RP);
403 }
404 else
405 {
406 int sum = 0; /* count how many keys we actually place */
407
408 /* I'm lazy, so just try to place in all 4 directions. */
409 sum += keyplace (map, x + 1, y, keycode, NO_PASS_DOORS, 1, RP);
410 sum += keyplace (map, x, y + 1, keycode, NO_PASS_DOORS, 1, RP);
411 sum += keyplace (map, x - 1, y, keycode, NO_PASS_DOORS, 1, RP);
412 sum += keyplace (map, x, y - 1, keycode, NO_PASS_DOORS, 1, RP);
413
414 if (sum < 2) /* we might have made a disconnected map-place more keys. */
415 { /* diagonally this time. */
416 keyplace (map, x + 1, y + 1, keycode, NO_PASS_DOORS, 1, RP);
417 keyplace (map, x + 1, y - 1, keycode, NO_PASS_DOORS, 1, RP);
418 keyplace (map, x - 1, y + 1, keycode, NO_PASS_DOORS, 1, RP);
419 keyplace (map, x - 1, y - 1, keycode, NO_PASS_DOORS, 1, RP);
420 }
421
422 return 1;
423 }
424 }
425
426 if (!the_keymaster)
427 {
428 the_key->x = kx;
429 the_key->y = ky;
430 insert_ob_in_map (the_key, map, NULL, 0);
431 return 1;
432 }
433
434 insert_ob_in_ob (the_key, the_keymaster);
435 return 1;
436}
437
438
439
440/* both find_monster_in_room routines need to have access to this. */ 452/* both find_monster_in_room routines need to have access to this. */
441 453
442object *theMonsterToFind; 454static object *theMonsterToFind;
443 455
444/* a recursive routine which will return a monster, eventually,if there is one. 456/* a recursive routine which will return a monster, eventually,if there is one.
445 it does a check-off on the layout, converting 0's to 1's */ 457 it does a check-off on the layout, converting 0's to 1's */
446 458static object *
447object *
448find_monster_in_room_recursive (char **layout, maptile *map, int x, int y, random_map_params *RP) 459find_monster_in_room_recursive (char **layout, maptile *map, int x, int y, random_map_params *RP)
449{ 460{
450 int i, j; 461 int i, j;
451 462
452 /* if we've found a monster already, leave */ 463 /* if we've found a monster already, leave */
… …
476 return theMonsterToFind; 487 return theMonsterToFind;
477 } 488 }
478 } 489 }
479 490
480 /* now search all the 8 squares around recursively for a monster,in random order */ 491 /* now search all the 8 squares around recursively for a monster,in random order */
481 for (i = rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++) 492 for (i = rmg_rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
482 { 493 {
483 theMonsterToFind = find_monster_in_room_recursive (layout, map, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], RP); 494 theMonsterToFind = find_monster_in_room_recursive (layout, map, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], RP);
484 if (theMonsterToFind != NULL) 495 if (theMonsterToFind != NULL)
485 return theMonsterToFind; 496 return theMonsterToFind;
486 } 497 }
498
487 return theMonsterToFind; 499 return theMonsterToFind;
488} 500}
489
490 501
491/* sets up some data structures: the _recursive form does the 502/* sets up some data structures: the _recursive form does the
492 real work. */ 503 real work. */
493 504static object *
494object *
495find_monster_in_room (maptile *map, int x, int y, random_map_params *RP) 505find_monster_in_room (maptile *map, int x, int y, random_map_params *RP)
496{ 506{
497 char **layout2; 507 Layout layout2 (RP);
498 int i, j; 508
509 layout2->clear ();
510
511 /* allocate and copy the layout, converting C to 0. */
512 for (int i = 0; i < layout2->w; i++)
513 for (int j = 0; j < layout2->h; j++)
514 if (wall_blocked (map, i, j))
515 layout2[i][j] = '#';
499 516
500 theMonsterToFind = 0; 517 theMonsterToFind = 0;
501 layout2 = (char **) calloc (sizeof (char *), RP->Xsize);
502 /* allocate and copy the layout, converting C to 0. */
503 for (i = 0; i < RP->Xsize; i++)
504 {
505 layout2[i] = (char *) calloc (sizeof (char), RP->Ysize);
506 for (j = 0; j < RP->Ysize; j++)
507 {
508 if (wall_blocked (map, i, j))
509 layout2[i][j] = '#';
510 }
511 }
512 theMonsterToFind = find_monster_in_room_recursive (layout2, map, x, y, RP); 518 theMonsterToFind = find_monster_in_room_recursive (layout2, map, x, y, RP);
513 519
514 /* deallocate the temp. layout */ 520 layout2.free ();
515 for (i = 0; i < RP->Xsize; i++)
516 {
517 free (layout2[i]);
518 }
519 free (layout2);
520 521
521 return theMonsterToFind; 522 return theMonsterToFind;
522} 523}
523 524
524/* a datastructure needed by find_spot_in_room and find_spot_in_room_recursive */ 525/* a datastructure needed by find_spot_in_room and find_spot_in_room_recursive */
525int *room_free_spots_x; 526static int *room_free_spots_x;
526int *room_free_spots_y; 527static int *room_free_spots_y;
527int number_of_free_spots_in_room; 528static int number_of_free_spots_in_room;
528 529
529/* the workhorse routine, which finds the free spots in a room: 530/* the workhorse routine, which finds the free spots in a room:
530a datastructure of free points is set up, and a position chosen from 531a datastructure of free points is set up, and a position chosen from
531that datastructure. */ 532that datastructure. */
532void 533static void
533find_spot_in_room_recursive (char **layout, int x, int y, random_map_params *RP) 534find_spot_in_room_recursive (char **layout, int x, int y, random_map_params *RP)
534{ 535{
535 int i, j; 536 int i, j;
536 537
537 /* bounds check x and y */ 538 /* bounds check x and y */
… …
549 room_free_spots_x[number_of_free_spots_in_room] = x; 550 room_free_spots_x[number_of_free_spots_in_room] = x;
550 room_free_spots_y[number_of_free_spots_in_room] = y; 551 room_free_spots_y[number_of_free_spots_in_room] = y;
551 number_of_free_spots_in_room++; 552 number_of_free_spots_in_room++;
552 553
553 /* now search all the 8 squares around recursively for free spots,in random order */ 554 /* now search all the 8 squares around recursively for free spots,in random order */
554 for (i = rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++) 555 for (i = rmg_rndm (8), j = 0; j < 8 && theMonsterToFind == NULL; i++, j++)
555 find_spot_in_room_recursive (layout, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], RP); 556 find_spot_in_room_recursive (layout, x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], RP);
556 557
557} 558}
558 559
559/* find a random non-blocked spot in this room to drop a key. */ 560/* find a random non-blocked spot in this room to drop a key. */
560void 561static void
561find_spot_in_room (maptile *map, int x, int y, int *kx, int *ky, random_map_params *RP) 562find_spot_in_room (maptile *map, int x, int y, int *kx, int *ky, random_map_params *RP)
562{ 563{
563 char **layout2; 564 char **layout2;
564 int i, j; 565 int i, j;
565 566
… …
580 /* setup num_free_spots and room_free_spots */ 581 /* setup num_free_spots and room_free_spots */
581 find_spot_in_room_recursive (layout2, x, y, RP); 582 find_spot_in_room_recursive (layout2, x, y, RP);
582 583
583 if (number_of_free_spots_in_room > 0) 584 if (number_of_free_spots_in_room > 0)
584 { 585 {
585 i = rndm (number_of_free_spots_in_room); 586 i = rmg_rndm (number_of_free_spots_in_room);
586 *kx = room_free_spots_x[i]; 587 *kx = room_free_spots_x[i];
587 *ky = room_free_spots_y[i]; 588 *ky = room_free_spots_y[i];
588 } 589 }
589 590
590 /* deallocate the temp. layout */ 591 /* deallocate the temp. layout */
… …
598 599
599 600
600/* searches the map for a spot with walls around it. The more 601/* searches the map for a spot with walls around it. The more
601 walls the better, but it'll settle for 1 wall, or even 0, but 602 walls the better, but it'll settle for 1 wall, or even 0, but
602 it'll return 0 if no FREE spots are found.*/ 603 it'll return 0 if no FREE spots are found.*/
603void 604static void
604find_enclosed_spot (maptile *map, int *cx, int *cy, random_map_params *RP) 605find_enclosed_spot (maptile *map, int *cx, int *cy, random_map_params *RP)
605{ 606{
606 int x, y; 607 int x, y;
607 int i; 608 int i;
608 609
… …
658 *cy = ly; 659 *cy = ly;
659 return; 660 return;
660 } 661 }
661 } 662 }
662 /* give up and return the closest free spot. */ 663 /* give up and return the closest free spot. */
663 i = find_free_spot (&archetype::find ("chest")->clone, map, x, y, 1, SIZEOFFREE1 + 1); 664 i = find_free_spot (archetype::find (shstr_chest), map, x, y, 1, SIZEOFFREE1 + 1);
664 665
665 if (i != -1) 666 if (i != -1)
666 { 667 {
667 *cx = x + freearr_x[i]; 668 *cx = x + freearr_x[i];
668 *cy = y + freearr_y[i]; 669 *cy = y + freearr_y[i];
… …
673 *cx = -1; 674 *cx = -1;
674 *cy = -1; 675 *cy = -1;
675 } 676 }
676} 677}
677 678
678void 679static void
679remove_monsters (int x, int y, maptile *map) 680remove_monsters (int x, int y, maptile *map)
680{ 681{
681 object *tmp;
682
683 for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) 682 for (object *tmp = GET_MAP_OB (map, x, y); tmp; )
684 if (QUERY_FLAG (tmp, FLAG_ALIVE))
685 { 683 {
686 if (tmp->head) 684 object *next = tmp->above;
687 tmp = tmp->head; 685
688 tmp->remove (); 686 if (tmp->flag [FLAG_ALIVE])
689 tmp->destroy (); 687 tmp->head_ ()->destroy ();
690 tmp = GET_MAP_OB (map, x, y); 688
691 if (tmp == NULL) 689 tmp = next;
692 break;
693 }; 690 }
694} 691}
695 692
696/* surrounds the point x,y by doors, so as to enclose something, like 693/* surrounds the point x,y by doors, so as to enclose something, like
697 a chest. It only goes as far as the 8 squares surrounding, and 694 a chest. It only goes as far as the 8 squares surrounding, and
698 it'll remove any monsters it finds.*/ 695 it'll remove any monsters it finds.*/
699object ** 696static object **
700surround_by_doors (maptile *map, char **layout, int x, int y, int opts) 697surround_by_doors (maptile *map, char **layout, int x, int y, int opts)
701{ 698{
702 int i; 699 int i;
703 char *doors[2]; 700 const char *doors[2];
704 object **doorlist; 701 object **doorlist;
705 int ndoors_made = 0; 702 int ndoors_made = 0;
706 doorlist = (object **) calloc (9, sizeof (object *)); /* 9 doors so we can hold termination null */ 703 doorlist = (object **) calloc (9, sizeof (object *)); /* 9 doors so we can hold termination null */
707 704
708 /* this is a list we pick from, for horizontal and vertical doors */ 705 /* this is a list we pick from, for horizontal and vertical doors */
… …
734 } 731 }
735 732
736 return doorlist; 733 return doorlist;
737} 734}
738 735
739
740/* returns the first door in this square, or NULL if there isn't a door. */ 736/* returns the first door in this square, or NULL if there isn't a door. */
741object * 737static object *
742door_in_square (maptile *map, int x, int y) 738door_in_square (maptile *map, int x, int y)
743{ 739{
744 object *tmp;
745
746 for (tmp = GET_MAP_OB (map, x, y); tmp != NULL; tmp = tmp->above) 740 for (object *tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)
747 if (tmp->type == DOOR || tmp->type == LOCKED_DOOR) 741 if (tmp->type == DOOR || tmp->type == LOCKED_DOOR)
748 return tmp; 742 return tmp;
743
749 return NULL; 744 return NULL;
750} 745}
751 746
752
753/* the workhorse routine, which finds the doors in a room */ 747/* the workhorse routine, which finds the doors in a room */
754void 748static void
755find_doors_in_room_recursive (char **layout, maptile *map, int x, int y, object **doorlist, int *ndoors, random_map_params *RP) 749find_doors_in_room_recursive (char **layout, maptile *map, int x, int y, object **doorlist, int *ndoors, random_map_params *RP)
756{ 750{
757 int i, j; 751 int i, j;
758 object *door; 752 object *door;
759 753
… …
771 layout[x][y] = 1; 765 layout[x][y] = 1;
772 door = door_in_square (map, x, y); 766 door = door_in_square (map, x, y);
773 if (door) 767 if (door)
774 { 768 {
775 doorlist[*ndoors] = door; 769 doorlist[*ndoors] = door;
770
776 if (*ndoors > 1022) /* eek! out of memory */ 771 if (*ndoors > 1022) /* eek! out of memory */
777 { 772 {
778 LOG (llevError, "find_doors_in_room_recursive:Too many doors for memory allocated!\n"); 773 LOG (llevError, "find_doors_in_room_recursive:Too many doors for memory allocated!\n");
779 return; 774 return;
780 } 775 }
… …
785 else 780 else
786 { 781 {
787 layout[x][y] = 1; 782 layout[x][y] = 1;
788 783
789 /* now search all the 8 squares around recursively for free spots,in random order */ 784 /* now search all the 8 squares around recursively for free spots,in random order */
790 for (i = rndm (8), j = 0; j < 8 && !theMonsterToFind; i++, j++) 785 for (i = rmg_rndm (8), j = 0; j < 8 && !theMonsterToFind; i++, j++)
791 find_doors_in_room_recursive (layout, map, 786 find_doors_in_room_recursive (layout, map,
792 x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1], 787 x + freearr_x[i % 8 + 1], y + freearr_y[i % 8 + 1],
793 doorlist, ndoors, RP); 788 doorlist, ndoors, RP);
794 } 789 }
795} 790}
796 791
797/* find a random non-blocked spot in this room to drop a key. */ 792/* find a random non-blocked spot in this room to drop a key. */
798object ** 793static object **
799find_doors_in_room (maptile *map, int x, int y, random_map_params *RP) 794find_doors_in_room (maptile *map, int x, int y, random_map_params *RP)
800{ 795{
801 char **layout2;
802 object **doorlist;
803 int i, j; 796 int i, j;
804 int ndoors = 0; 797 int ndoors = 0;
805 798
806 doorlist = (object **) calloc (sizeof (int), 1024); 799 object **doorlist = (object **)calloc (sizeof (int), 1024);
807 800
808 layout2 = (char **) calloc (sizeof (char *), RP->Xsize); 801 LayoutData layout2 (RP->Xsize, RP->Ysize);
802 layout2.clear ();
803
809 /* allocate and copy the layout, converting C to 0. */ 804 /* allocate and copy the layout, converting C to 0. */
810 for (i = 0; i < RP->Xsize; i++) 805 for (i = 0; i < RP->Xsize; i++)
811 {
812 layout2[i] = (char *) calloc (sizeof (char), RP->Ysize);
813 for (j = 0; j < RP->Ysize; j++) 806 for (j = 0; j < RP->Ysize; j++)
814 { 807 layout2[i][j] = wall_blocked (map, i, j) ? '#' : 0;
815 if (wall_blocked (map, i, j))
816 layout2[i][j] = '#';
817 }
818 }
819 808
820 /* setup num_free_spots and room_free_spots */ 809 /* setup num_free_spots and room_free_spots */
821 find_doors_in_room_recursive (layout2, map, x, y, doorlist, &ndoors, RP); 810 find_doors_in_room_recursive (layout2, map, x, y, doorlist, &ndoors, RP);
822 811
823 /* deallocate the temp. layout */
824 for (i = 0; i < RP->Xsize; i++)
825 free (layout2[i]);
826
827 free (layout2);
828 return doorlist; 812 return doorlist;
829} 813}
830
831
832 814
833/* locks and/or hides all the doors in doorlist, or does nothing if 815/* locks and/or hides all the doors in doorlist, or does nothing if
834 opts doesn't say to lock/hide doors. */ 816 opts doesn't say to lock/hide doors. */
835 817static void
836void
837lock_and_hide_doors (object **doorlist, maptile *map, int opts, random_map_params *RP) 818lock_and_hide_doors (object **doorlist, maptile *map, int opts, random_map_params *RP)
838{ 819{
839 object *door; 820 object *door;
840 int i; 821 int i;
841 822
842 /* lock the doors and hide the keys. */ 823 /* lock the doors and hide the keys. */
843 824
844 if (opts & DOORED) 825 if (opts & DOORED)
845 { 826 {
846 for (i = 0, door = doorlist[0]; doorlist[i] != NULL; i++) 827 for (i = 0, door = doorlist[0]; doorlist[i]; i++)
847 { 828 {
848 object *new_door = get_archetype ("locked_door1"); 829 object *new_door = get_archetype (shstr_locked_door1);
849 char keybuf[1024];
850 830
851 door = doorlist[i]; 831 door = doorlist[i];
852 new_door->face = door->face; 832 new_door->face = door->face;
853 new_door->x = door->x; 833 new_door->x = door->x;
854 new_door->y = door->y; 834 new_door->y = door->y;
855 door->remove ();
856 door->destroy (); 835 door->destroy ();
857 doorlist[i] = new_door; 836 doorlist[i] = new_door;
858 insert_ob_in_map (new_door, map, NULL, 0); 837 insert_ob_in_map (new_door, map, NULL, 0);
859 sprintf (keybuf, "%d", rndm (1000000000)); 838 new_door->slaying = format ("RMG-%d-%d", (int)rmg_rndm (1000000000), (int)rmg_rndm (1000000000));
860 new_door->slaying = keybuf;
861 keyplace (map, new_door->x, new_door->y, keybuf, NO_PASS_DOORS, 2, RP); 839 keyplace (map, new_door->x, new_door->y, new_door->slaying, NO_PASS_DOORS, 2, RP);
862 } 840 }
863 } 841 }
864 842
865 /* change the faces of the doors and surrounding walls to hide them. */ 843 /* change the faces of the doors and surrounding walls to hide them. */
866 if (opts & HIDDEN) 844 if (opts & HIDDEN)
… …
875 { 853 {
876 retrofit_joined_wall (map, door->x - 1, door->y, 0, RP); 854 retrofit_joined_wall (map, door->x - 1, door->y, 0, RP);
877 retrofit_joined_wall (map, door->x + 1, door->y, 0, RP); 855 retrofit_joined_wall (map, door->x + 1, door->y, 0, RP);
878 retrofit_joined_wall (map, door->x, door->y - 1, 0, RP); 856 retrofit_joined_wall (map, door->x, door->y - 1, 0, RP);
879 retrofit_joined_wall (map, door->x, door->y + 1, 0, RP); 857 retrofit_joined_wall (map, door->x, door->y + 1, 0, RP);
858
880 door->face = wallface->face; 859 door->face = wallface->face;
881 if (!QUERY_FLAG (wallface, FLAG_REMOVED)) 860
882 wallface->remove ();
883 wallface->destroy (); 861 wallface->destroy ();
884 } 862 }
885 } 863 }
886 } 864 }
887} 865}

Diff Legend

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