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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.85 by root, Wed Feb 7 23:50:01 2007 UTC vs.
Revision 1.141 by root, Wed May 7 11:02:50 2008 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 (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-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,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
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 2 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,
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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25#include <unistd.h> 24#include <unistd.h>
26 25
27#include "global.h" 26#include "global.h"
28#include "funcpoint.h"
29 27
30#include "loader.h" 28#include "loader.h"
31 29
32#include "path.h" 30#include "path.h"
33
34/*
35 * This makes a path absolute outside the world of Crossfire.
36 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
37 * and returns the pointer to a static array containing the result.
38 * it really should be called create_mapname
39 */
40const char *
41create_pathname (const char *name)
42{
43 static char buf[8192];
44 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45 return buf;
46}
47
48/*
49 * This function checks if a file with the given path exists.
50 * -1 is returned if it fails, otherwise the mode of the file
51 * is returned.
52 * It tries out all the compression suffixes listed in the uncomp[] array.
53 *
54 * If prepend_dir is set, then we call create_pathname (which prepends
55 * libdir & mapdir). Otherwise, we assume the name given is fully
56 * complete.
57 * Only the editor actually cares about the writablity of this -
58 * the rest of the code only cares that the file is readable.
59 * when the editor goes away, the call to stat should probably be
60 * replaced by an access instead (similar to the windows one, but
61 * that seems to be missing the prepend_dir processing
62 */
63int
64check_path (const char *name, int prepend_dir)
65{
66 char buf[MAX_BUF];
67
68 char *endbuf;
69 struct stat statbuf;
70 int mode = 0;
71
72 if (prepend_dir)
73 assign (buf, create_pathname (name));
74 else
75 assign (buf, name);
76
77 /* old method (strchr(buf, '\0')) seemd very odd to me -
78 * this method should be equivalant and is clearer.
79 * Can not use strcat because we need to cycle through
80 * all the names.
81 */
82 endbuf = buf + strlen (buf);
83
84 if (stat (buf, &statbuf))
85 return -1;
86 if (!S_ISREG (statbuf.st_mode))
87 return (-1);
88
89 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
90 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
91 mode |= 4;
92
93 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
94 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
95 mode |= 2;
96
97 return (mode);
98}
99 31
100/* This rolls up wall, blocks_magic, blocks_view, etc, all into 32/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101 * one function that just returns a P_.. value (see map.h) 33 * one function that just returns a P_.. value (see map.h)
102 * it will also do map translation for tiled maps, returning 34 * it will also do map translation for tiled maps, returning
103 * new values into newmap, nx, and ny. Any and all of those 35 * new values into newmap, nx, and ny. Any and all of those
… …
174 * let the player through (inventory checkers for example) 106 * let the player through (inventory checkers for example)
175 */ 107 */
176 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 108 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
177 return 0; 109 return 0;
178 110
179 if (ob->head != NULL)
180 ob = ob->head; 111 ob = ob->head_ ();
181 112
182 /* We basically go through the stack of objects, and if there is 113 /* We basically go through the stack of objects, and if there is
183 * some other object that has NO_PASS or FLAG_ALIVE set, return 114 * some other object that has NO_PASS or FLAG_ALIVE set, return
184 * true. If we get through the entire stack, that must mean 115 * true. If we get through the entire stack, that must mean
185 * ob is blocking it, so return 0. 116 * ob is blocking it, so return 0.
… …
215 else 146 else
216 { 147 {
217 /* Broke apart a big nasty if into several here to make 148 /* Broke apart a big nasty if into several here to make
218 * this more readable. first check - if the space blocks 149 * this more readable. first check - if the space blocks
219 * movement, can't move here. 150 * movement, can't move here.
220 * second - if a monster, can't move there, unles it is a 151 * second - if a monster, can't move there, unless it is a
221 * hidden dm 152 * hidden dm
222 */ 153 */
223 if (OB_MOVE_BLOCK (ob, tmp)) 154 if (OB_MOVE_BLOCK (ob, tmp))
224 return 1; 155 return 1;
225 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 156
226 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 157 if (tmp->flag [FLAG_ALIVE]
158 && tmp->head_ () != ob
159 && tmp != ob
160 && tmp->type != DOOR
161 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
227 return 1; 162 return 1;
228 } 163 }
229 164
230 } 165 }
231 return 0; 166 return 0;
232} 167}
233 168
234/* 169/*
235 * Returns true if the given object can't fit in the given spot. 170 * Returns qthe blocking object if the given object can't fit in the given
236 * This is meant for multi space objects - for single space objecs, 171 * spot. This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 172 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 173 * of object. This function goes through all the parts of the multipart
239 * multipart object and makes sure they can be inserted. 174 * object and makes sure they can be inserted.
240 * 175 *
241 * While this doesn't call out of map, the get_map_flags does. 176 * While this doesn't call out of map, the get_map_flags does.
242 * 177 *
243 * This function has been used to deprecate arch_out_of_map - 178 * This function has been used to deprecate arch_out_of_map -
244 * this function also does that check, and since in most cases, 179 * this function also does that check, and since in most cases,
… …
255 * 190 *
256 * Note this used to be arch_blocked, but with new movement 191 * Note this used to be arch_blocked, but with new movement
257 * code, we need to have actual object to check its move_type 192 * code, we need to have actual object to check its move_type
258 * against the move_block values. 193 * against the move_block values.
259 */ 194 */
260int 195bool
261ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 196object::blocked (maptile *m, int x, int y) const
262{ 197{
263 archetype *tmp; 198 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
264 int flag;
265 maptile *m1;
266 sint16 sx, sy;
267
268 if (!ob)
269 {
270 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271 if (flag & P_OUT_OF_MAP)
272 return P_OUT_OF_MAP;
273
274 /* don't have object, so don't know what types would block */
275 return m1->at (sx, sy).move_block;
276 } 199 {
200 mapxy pos (m, x + tmp->x, y + tmp->y);
277 201
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 202 if (!pos.normalise ())
279 { 203 return 1;
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281 204
282 if (flag & P_OUT_OF_MAP) 205 mapspace &ms = *pos;
283 return P_OUT_OF_MAP; 206
284 if (flag & P_IS_ALIVE) 207 if (ms.flags () & P_IS_ALIVE)
285 return P_IS_ALIVE; 208 return 1;
286 209
287 mapspace &ms = m1->at (sx, sy); 210 /* However, often ob doesn't have any move type
288 211 * (signifying non-moving objects)
289 /* find_first_free_spot() calls this function. However, often
290 * ob doesn't have any move type (when used to place exits)
291 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 212 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292 */ 213 */
293
294 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 214 if (!move_type && ms.move_block != MOVE_ALL)
295 continue; 215 continue;
296 216
297 /* Note it is intentional that we check ob - the movement type of the 217 /* Note it is intentional that we check ob - the movement type of the
298 * head of the object should correspond for the entire object. 218 * head of the object should correspond for the entire object.
299 */ 219 */
300 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 220 if (ms.blocks (move_type))
301 return P_NO_PASS; 221 return 1;
302 } 222 }
303 223
304 return 0; 224 return 0;
305} 225}
306 226
… …
324 244
325 insert_ob_in_ob (tmp, container); 245 insert_ob_in_ob (tmp, container);
326 tmp = next; 246 tmp = next;
327 } 247 }
328 248
329 /* sum_weight will go through and calculate what all the containers are 249 // go through and calculate what all the containers are carrying.
330 * carrying. 250 //TODO: remove
331 */ 251 container->update_weight ();
332 sum_weight (container);
333} 252}
334 253
335void 254void
336maptile::set_object_flag (int flag, int value) 255maptile::set_object_flag (int flag, int value)
337{ 256{
… …
344} 263}
345 264
346/* link_multipart_objects go through all the objects on the map looking 265/* link_multipart_objects go through all the objects on the map looking
347 * for objects whose arch says they are multipart yet according to the 266 * for objects whose arch says they are multipart yet according to the
348 * info we have, they only have the head (as would be expected when 267 * info we have, they only have the head (as would be expected when
349 * they are saved). We do have to look for the old maps that did save 268 * they are saved).
350 * the more sections and not re-add sections for them.
351 */ 269 */
352void 270void
353maptile::link_multipart_objects () 271maptile::link_multipart_objects ()
354{ 272{
355 if (!spaces) 273 if (!spaces)
356 return; 274 return;
357 275
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 276 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; ) 277 {
278 object *op = ms->bot;
279 while (op)
360 { 280 {
361 object *above = tmp->above;
362
363 /* already multipart - don't do anything more */ 281 /* already multipart - don't do anything more */
364 if (!tmp->head && !tmp->more) 282 if (op->head_ () == op && !op->more && op->arch->more)
365 {
366 /* If there is nothing more to this object, this for loop
367 * won't do anything.
368 */
369 archetype *at;
370 object *last, *op;
371 for (at = tmp->arch->more, last = tmp;
372 at;
373 at = at->more, last = op)
374 { 283 {
375 op = arch_to_object (at); 284 op->remove ();
285 op->expand_tail ();
376 286
377 /* update x,y coordinates */ 287 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
378 op->x += tmp->x; 288 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
379 op->y += tmp->y; 289 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
380 op->head = tmp;
381 op->map = this;
382 last->more = op;
383 op->name = tmp->name;
384 op->title = tmp->title;
385
386 /* we could link all the parts onto tmp, and then just
387 * call insert_ob_in_map once, but the effect is the same,
388 * as insert_ob_in_map will call itself with each part, and
389 * the coding is simpler to just to it here with each part.
390 */
391 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 290 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
291
292 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
293 // so we have to reset the iteration through the mapspace
392 } 294 }
295 else
296 op = op->above;
393 } 297 }
394
395 tmp = above;
396 } 298 }
397} 299}
398 300
399/* 301/*
400 * Loads (ands parses) the objects into a given map from the specified 302 * Loads (ands parses) the objects into a given map from the specified
401 * file pointer. 303 * file pointer.
402 * mapflags is the same as we get with load_original_map
403 */ 304 */
404bool 305bool
405maptile::_load_objects (object_thawer &thawer) 306maptile::_load_objects (object_thawer &f)
406{ 307{
407 int unique; 308 for (;;)
408 object *op, *prev = NULL, *last_more = NULL, *otmp;
409
410 op = object::create ();
411 op->map = this; /* To handle buttons correctly */
412
413 while (int i = load_object (thawer, op, 0))
414 { 309 {
415 /* if the archetype for the object is null, means that we 310 coroapi::cede_to_tick (); // cede once in a while
416 * got an invalid object. Don't do anything with it - the game 311
417 * or editor will not be able to do anything with it either. 312 switch (f.kw)
418 */
419 if (op->arch == NULL)
420 { 313 {
421 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 314 case KW_arch:
315 if (object *op = object::read (f, this))
316 {
317 // TODO: why?
318 if (op->inv)
319 op->update_weight ();
320
321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 {
323 // we insert manually because
324 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that
326 // c) its correct
327 mapspace &ms = at (op->x, op->y);
328
329 op->flag [FLAG_REMOVED] = false;
330
331 op->above = 0;
332 op->below = ms.top;
333
334 if (ms.top)
335 ms.top->above = op;
336 else
337 ms.bot = op;
338
339 ms.top = op;
340 ms.flags_ = 0;
341 }
342 else
343 {
344 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
345 op->destroy ();
346 }
347 }
348
422 continue; 349 continue;
423 }
424 350
425 switch (i)
426 {
427 case LL_NORMAL:
428 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
429
430 if (op->inv)
431 sum_weight (op);
432
433 prev = op, last_more = op;
434 break;
435
436 case LL_MORE: 351 case KW_EOF:
437 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 352 return true;
438 op->head = prev, last_more->more = op, last_more = op; 353
354 default:
355 if (!f.parse_error ("map file"))
356 return false;
439 break; 357 break;
440 } 358 }
441 359
442 op = object::create (); 360 f.next ();
443 op->map = this;
444 }
445
446 op->destroy ();
447
448#if 0
449 for (i = 0; i < width; i++)
450 for (j = 0; j < height; j++)
451 {
452 unique = 0;
453 /* check for unique items, or unique squares */
454 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
455 {
456 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
457 unique = 1;
458
459 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
460 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
461 }
462 } 361 }
463#endif
464 362
465 return true; 363 return true;
466} 364}
467 365
468void 366void
469maptile::activate () 367maptile::activate ()
470{ 368{
471 if (!spaces) 369 if (spaces)
472 return;
473
474 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 370 for (mapspace *ms = spaces + size (); ms-- > spaces; )
475 for (object *op = ms->bot; op; op = op->above) 371 for (object *op = ms->bot; op; op = op->above)
476 op->activate_recursive (); 372 op->activate_recursive ();
477} 373}
478 374
479void 375void
480maptile::deactivate () 376maptile::deactivate ()
481{ 377{
482 if (!spaces) 378 if (spaces)
483 return;
484
485 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 379 for (mapspace *ms = spaces + size (); ms-- > spaces; )
486 for (object *op = ms->bot; op; op = op->above) 380 for (object *op = ms->bot; op; op = op->above)
487 op->deactivate_recursive (); 381 op->deactivate_recursive ();
488} 382}
489 383
490bool 384bool
491maptile::_save_objects (object_freezer &freezer, int flags) 385maptile::_save_objects (object_freezer &f, int flags)
492{ 386{
493 static int cede_count = 0; 387 coroapi::cede_to_tick ();
494 388
495 if (flags & IO_HEADER) 389 if (flags & IO_HEADER)
496 _save_header (freezer); 390 _save_header (f);
497 391
498 if (!spaces) 392 if (!spaces)
499 return false; 393 return false;
500 394
501 for (int i = 0; i < size (); ++i) 395 for (int i = 0; i < size (); ++i)
502 { 396 {
503#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
504 if (cede_count >= 500)
505 {
506 cede_count = 0;
507 coroapi::cede ();
508 }
509#endif
510
511 int unique = 0; 397 bool unique = 0;
398
512 for (object *op = spaces [i].bot; op; op = op->above) 399 for (object *op = spaces [i].bot; op; op = op->above)
513 { 400 {
514 // count per-object, but cede only when modification-safe
515 cede_count++;
516
517 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 401 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
518 unique = 1;
519 402
520 if (!op->can_map_save ()) 403 if (expect_false (!op->can_map_save ()))
521 continue; 404 continue;
522 405
523 if (unique || op->flag [FLAG_UNIQUE]) 406 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
524 { 407 {
525 if (flags & IO_UNIQUES) 408 if (flags & IO_UNIQUES)
526 save_object (freezer, op, 1); 409 op->write (f);
527 } 410 }
528 else if (flags & IO_OBJECTS) 411 else if (expect_true (flags & IO_OBJECTS))
529 save_object (freezer, op, 1); 412 op->write (f);
530 } 413 }
531 } 414 }
532 415
416 coroapi::cede_to_tick ();
417
533 return true; 418 return true;
534}
535
536bool
537maptile::_load_objects (const char *path, bool skip_header)
538{
539 object_thawer thawer (path);
540
541 if (!thawer)
542 return false;
543
544 if (skip_header)
545 for (;;)
546 {
547 keyword kw = thawer.get_kv ();
548
549 if (kw == KW_end)
550 break;
551
552 thawer.skip_kv (kw);
553 }
554
555 return _load_objects (thawer);
556} 419}
557 420
558bool 421bool
559maptile::_save_objects (const char *path, int flags) 422maptile::_save_objects (const char *path, int flags)
560{ 423{
… …
735bool 598bool
736maptile::_load_header (object_thawer &thawer) 599maptile::_load_header (object_thawer &thawer)
737{ 600{
738 for (;;) 601 for (;;)
739 { 602 {
740 keyword kw = thawer.get_kv ();
741
742 switch (kw) 603 switch (thawer.kw)
743 { 604 {
744 case KW_msg: 605 case KW_msg:
745 thawer.get_ml (KW_endmsg, msg); 606 thawer.get_ml (KW_endmsg, msg);
746 break; 607 break;
747 608
… …
779 case KW_winddir: thawer.get (winddir); break; 640 case KW_winddir: thawer.get (winddir); break;
780 case KW_sky: thawer.get (sky); break; 641 case KW_sky: thawer.get (sky); break;
781 642
782 case KW_per_player: thawer.get (per_player); break; 643 case KW_per_player: thawer.get (per_player); break;
783 case KW_per_party: thawer.get (per_party); break; 644 case KW_per_party: thawer.get (per_party); break;
645 case KW_no_reset: thawer.get (no_reset); break;
646 case KW_no_drop: thawer.get (no_drop); break;
784 647
785 case KW_region: default_region = region::find (thawer.get_str ()); break; 648 case KW_region: default_region = region::find (thawer.get_str ()); break;
786 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 649 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
787 650
788 // old names new names 651 // old names new names
… …
799 case KW_tile_path_1: thawer.get (tile_path [0]); break; 662 case KW_tile_path_1: thawer.get (tile_path [0]); break;
800 case KW_tile_path_2: thawer.get (tile_path [1]); break; 663 case KW_tile_path_2: thawer.get (tile_path [1]); break;
801 case KW_tile_path_3: thawer.get (tile_path [2]); break; 664 case KW_tile_path_3: thawer.get (tile_path [2]); break;
802 case KW_tile_path_4: thawer.get (tile_path [3]); break; 665 case KW_tile_path_4: thawer.get (tile_path [3]); break;
803 666
667 case KW_ERROR:
668 set_key_text (thawer.kw_str, thawer.value);
669 break;
670
804 case KW_end: 671 case KW_end:
672 thawer.next ();
805 return true; 673 return true;
806 674
807 default: 675 default:
808 if (!thawer.parse_error (kw, "map", 0)) 676 if (!thawer.parse_error ("map", 0))
809 return false; 677 return false;
810 break; 678 break;
811 } 679 }
680
681 thawer.next ();
812 } 682 }
813 683
814 abort (); 684 abort ();
815}
816
817bool
818maptile::_load_header (const char *path)
819{
820 object_thawer thawer (path);
821
822 if (!thawer)
823 return false;
824
825 return _load_header (thawer);
826} 685}
827 686
828/****************************************************************************** 687/******************************************************************************
829 * This is the start of unique map handling code 688 * This is the start of unique map handling code
830 *****************************************************************************/ 689 *****************************************************************************/
… …
841 object *above = op->above; 700 object *above = op->above;
842 701
843 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 702 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
844 unique = 1; 703 unique = 1;
845 704
846 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 705 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
847 { 706 {
848 op->destroy_inv (false); 707 op->destroy_inv (false);
849 op->destroy (); 708 op->destroy ();
850 } 709 }
851 710
… …
865 if (name) MAP_OUT (name); 724 if (name) MAP_OUT (name);
866 MAP_OUT (swap_time); 725 MAP_OUT (swap_time);
867 MAP_OUT (reset_time); 726 MAP_OUT (reset_time);
868 MAP_OUT (reset_timeout); 727 MAP_OUT (reset_timeout);
869 MAP_OUT (fixed_resettime); 728 MAP_OUT (fixed_resettime);
729 MAP_OUT (no_reset);
730 MAP_OUT (no_drop);
870 MAP_OUT (difficulty); 731 MAP_OUT (difficulty);
871 732
872 if (default_region) MAP_OUT2 (region, default_region->name); 733 if (default_region) MAP_OUT2 (region, default_region->name);
873 734
874 if (shopitems) 735 if (shopitems)
… …
928 * Remove and free all objects in the given map. 789 * Remove and free all objects in the given map.
929 */ 790 */
930void 791void
931maptile::clear () 792maptile::clear ()
932{ 793{
933 sfree (regions, size ()), regions = 0;
934 free (regionmap), regionmap = 0;
935
936 if (spaces) 794 if (spaces)
937 { 795 {
938 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 796 for (mapspace *ms = spaces + size (); ms-- > spaces; )
939 while (object *op = ms->bot) 797 while (object *op = ms->bot)
940 { 798 {
799 // manually remove, as to not trigger anything
800 if (ms->bot = op->above)
801 ms->bot->below = 0;
802
803 op->flag [FLAG_REMOVED] = true;
804
805 object *head = op->head_ ();
941 if (op->head) 806 if (op == head)
942 op = op->head; 807 {
943
944 op->destroy_inv (false); 808 op->destroy_inv (false);
945 op->destroy (); 809 op->destroy ();
810 }
811 else if (head->map != op->map)
812 {
813 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
814 head->destroy ();
815 }
946 } 816 }
947 817
948 sfree (spaces, size ()), spaces = 0; 818 sfree0 (spaces, size ());
949 } 819 }
950 820
951 if (buttons) 821 if (buttons)
952 free_objectlinkpt (buttons), buttons = 0; 822 free_objectlinkpt (buttons), buttons = 0;
823
824 sfree0 (regions, size ());
825 delete [] regionmap; regionmap = 0;
953} 826}
954 827
955void 828void
956maptile::clear_header () 829maptile::clear_header ()
957{ 830{
… …
987maptile::do_destroy () 860maptile::do_destroy ()
988{ 861{
989 attachable::do_destroy (); 862 attachable::do_destroy ();
990 863
991 clear (); 864 clear ();
865}
866
867/* decay and destroy perishable items in a map */
868void
869maptile::do_decay_objects ()
870{
871 if (!spaces)
872 return;
873
874 for (mapspace *ms = spaces + size (); ms-- > spaces; )
875 for (object *above, *op = ms->bot; op; op = above)
876 {
877 above = op->above;
878
879 bool destroy = 0;
880
881 // do not decay anything above unique floor tiles (yet :)
882 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
883 break;
884
885 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
886 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
887 || QUERY_FLAG (op, FLAG_UNIQUE)
888 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
889 || QUERY_FLAG (op, FLAG_UNPAID)
890 || op->is_alive ())
891 ; // do not decay
892 else if (op->is_weapon ())
893 {
894 op->stats.dam--;
895 if (op->stats.dam < 0)
896 destroy = 1;
897 }
898 else if (op->is_armor ())
899 {
900 op->stats.ac--;
901 if (op->stats.ac < 0)
902 destroy = 1;
903 }
904 else if (op->type == FOOD)
905 {
906 op->stats.food -= rndm (5, 20);
907 if (op->stats.food < 0)
908 destroy = 1;
909 }
910 else
911 {
912 int mat = op->materials;
913
914 if (mat & M_PAPER
915 || mat & M_LEATHER
916 || mat & M_WOOD
917 || mat & M_ORGANIC
918 || mat & M_CLOTH
919 || mat & M_LIQUID
920 || (mat & M_IRON && rndm (1, 5) == 1)
921 || (mat & M_GLASS && rndm (1, 2) == 1)
922 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
923 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
924 || (mat & M_ICE && temp > 32))
925 destroy = 1;
926 }
927
928 /* adjust overall chance below */
929 if (destroy && rndm (0, 1))
930 op->destroy ();
931 }
992} 932}
993 933
994/* 934/*
995 * Updates every button on the map (by calling update_button() for them). 935 * Updates every button on the map (by calling update_button() for them).
996 */ 936 */
… …
1043 983
1044 if (QUERY_FLAG (op, FLAG_GENERATOR)) 984 if (QUERY_FLAG (op, FLAG_GENERATOR))
1045 { 985 {
1046 total_exp += op->stats.exp; 986 total_exp += op->stats.exp;
1047 987
1048 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 988 if (archetype *at = op->other_arch)
989 {
1049 total_exp += at->clone.stats.exp * 8; 990 total_exp += at->stats.exp * 8;
1050
1051 monster_cnt++; 991 monster_cnt++;
992 }
993
994 for (object *inv = op->inv; inv; inv = inv->below)
995 {
996 total_exp += op->stats.exp * 8;
997 monster_cnt++;
998 }
1052 } 999 }
1053 } 1000 }
1054 1001
1055 avgexp = (double) total_exp / monster_cnt; 1002 avgexp = (double) total_exp / monster_cnt;
1056 1003
… …
1109void 1056void
1110mapspace::update_ () 1057mapspace::update_ ()
1111{ 1058{
1112 object *tmp, *last = 0; 1059 object *tmp, *last = 0;
1113 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1060 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1114 facetile *top, *floor, *middle;
1115 object *top_obj, *floor_obj, *middle_obj;
1116 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1061 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1117 1062
1118 middle = blank_face; 1063 //object *middle = 0;
1119 top = blank_face; 1064 //object *top = 0;
1120 floor = blank_face; 1065 //object *floor = 0;
1121 1066 // this seems to generate better code than using locals, above
1122 middle_obj = 0; 1067 object *&top = faces_obj[0] = 0;
1123 top_obj = 0; 1068 object *&middle = faces_obj[1] = 0;
1124 floor_obj = 0; 1069 object *&floor = faces_obj[2] = 0;
1125 1070
1126 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1071 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1127 { 1072 {
1128 /* This could be made additive I guess (two lights better than 1073 /* This could be made additive I guess (two lights better than
1129 * one). But if so, it shouldn't be a simple additive - 2 1074 * one). But if so, it shouldn't be a simple additive - 2
1130 * light bulbs do not illuminate twice as far as once since 1075 * light bulbs do not illuminate twice as far as once since
1131 * it is a dissapation factor that is cubed. 1076 * it is a dissapation factor that is cubed.
1132 */ 1077 */
1133 if (tmp->glow_radius > light)
1134 light = tmp->glow_radius; 1078 light = max (light, tmp->glow_radius);
1135 1079
1136 /* This call is needed in order to update objects the player 1080 /* This call is needed in order to update objects the player
1137 * is standing in that have animations (ie, grass, fire, etc). 1081 * is standing in that have animations (ie, grass, fire, etc).
1138 * However, it also causes the look window to be re-drawn 1082 * However, it also causes the look window to be re-drawn
1139 * 3 times each time the player moves, because many of the 1083 * 3 times each time the player moves, because many of the
… …
1142 * Always put the player down for drawing. 1086 * Always put the player down for drawing.
1143 */ 1087 */
1144 if (!tmp->invisible) 1088 if (!tmp->invisible)
1145 { 1089 {
1146 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1090 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1147 {
1148 top = tmp->face;
1149 top_obj = tmp; 1091 top = tmp;
1150 }
1151 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1092 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1152 { 1093 {
1153 /* If we got a floor, that means middle and top were below it, 1094 /* If we got a floor, that means middle and top were below it,
1154 * so should not be visible, so we clear them. 1095 * so should not be visible, so we clear them.
1155 */ 1096 */
1156 middle = blank_face; 1097 middle = 0;
1157 top = blank_face; 1098 top = 0;
1158 floor = tmp->face;
1159 floor_obj = tmp; 1099 floor = tmp;
1160 } 1100 }
1161 /* Flag anywhere have high priority */ 1101 /* Flag anywhere have high priority */
1162 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1102 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1163 { 1103 {
1164 middle = tmp->face;
1165
1166 middle_obj = tmp; 1104 middle = tmp;
1167 anywhere = 1; 1105 anywhere = 1;
1168 } 1106 }
1169 /* Find the highest visible face around. If equal 1107 /* Find the highest visible face around. If equal
1170 * visibilities, we still want the one nearer to the 1108 * visibilities, we still want the one nearer to the
1171 * top 1109 * top
1172 */ 1110 */
1173 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1111 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1174 {
1175 middle = tmp->face;
1176 middle_obj = tmp; 1112 middle = tmp;
1177 }
1178 } 1113 }
1179 1114
1180 if (tmp == tmp->above) 1115 if (tmp == tmp->above)
1181 { 1116 {
1182 LOG (llevError, "Error in structure of map\n"); 1117 LOG (llevError, "Error in structure of map\n");
… …
1217 * middle face. This should not happen, as we already have the 1152 * middle face. This should not happen, as we already have the
1218 * else statement above so middle should not get set. OTOH, it 1153 * else statement above so middle should not get set. OTOH, it
1219 * may be possible for the faces to match but be different objects. 1154 * may be possible for the faces to match but be different objects.
1220 */ 1155 */
1221 if (top == middle) 1156 if (top == middle)
1222 middle = blank_face; 1157 middle = 0;
1223 1158
1224 /* There are three posibilities at this point: 1159 /* There are three posibilities at this point:
1225 * 1) top face is set, need middle to be set. 1160 * 1) top face is set, need middle to be set.
1226 * 2) middle is set, need to set top. 1161 * 2) middle is set, need to set top.
1227 * 3) neither middle or top is set - need to set both. 1162 * 3) neither middle or top is set - need to set both.
… …
1232 /* Once we get to a floor, stop, since we already have a floor object */ 1167 /* Once we get to a floor, stop, since we already have a floor object */
1233 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1168 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1234 break; 1169 break;
1235 1170
1236 /* If two top faces are already set, quit processing */ 1171 /* If two top faces are already set, quit processing */
1237 if ((top != blank_face) && (middle != blank_face)) 1172 if (top && middle)
1238 break; 1173 break;
1239 1174
1240 /* Only show visible faces */ 1175 /* Only show visible faces */
1241 if (!tmp->invisible) 1176 if (!tmp->invisible)
1242 { 1177 {
1243 /* Fill in top if needed */ 1178 /* Fill in top if needed */
1244 if (top == blank_face) 1179 if (!top)
1245 { 1180 {
1246 top = tmp->face;
1247 top_obj = tmp; 1181 top = tmp;
1248 if (top == middle) 1182 if (top == middle)
1249 middle = blank_face; 1183 middle = 0;
1250 } 1184 }
1251 else 1185 else
1252 { 1186 {
1253 /* top is already set - we should only get here if 1187 /* top is already set - we should only get here if
1254 * middle is not set 1188 * middle is not set
1255 * 1189 *
1256 * Set the middle face and break out, since there is nothing 1190 * Set the middle face and break out, since there is nothing
1257 * more to fill in. We don't check visiblity here, since 1191 * more to fill in. We don't check visiblity here, since
1258 * 1192 *
1259 */ 1193 */
1260 if (tmp->face != top) 1194 if (tmp != top)
1261 { 1195 {
1262 middle = tmp->face;
1263 middle_obj = tmp; 1196 middle = tmp;
1264 break; 1197 break;
1265 } 1198 }
1266 } 1199 }
1267 } 1200 }
1268 } 1201 }
1269 1202
1270 if (middle == floor) 1203 if (middle == floor)
1271 middle = blank_face; 1204 middle = 0;
1272 1205
1273 if (top == middle) 1206 if (top == middle)
1274 middle = blank_face; 1207 middle = 0;
1275 1208
1276 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1209#if 0
1277 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1210 faces_obj [0] = top;
1278 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1211 faces_obj [1] = middle;
1212 faces_obj [2] = floor;
1213#endif
1279} 1214}
1280 1215
1281uint64 1216uint64
1282mapspace::volume () const 1217mapspace::volume () const
1283{ 1218{
… …
1287 vol += op->volume (); 1222 vol += op->volume ();
1288 1223
1289 return vol; 1224 return vol;
1290} 1225}
1291 1226
1292/* this updates the orig_map->tile_map[tile_num] value after finding 1227bool
1293 * the map. It also takes care of linking back the freshly found 1228maptile::tile_available (int dir, bool load)
1294 * maps tile_map values if it tiles back to this one. It returns
1295 * the value of orig_map->tile_map[tile_num].
1296 */
1297static inline maptile *
1298find_and_link (maptile *orig_map, int tile_num)
1299{ 1229{
1300 maptile *mp = orig_map->tile_map [tile_num]; 1230 if (!tile_path[dir])
1231 return 0;
1301 1232
1302 if (!mp) 1233 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1303 { 1234 return 1;
1304 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1305 1235
1306 if (!mp) 1236 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1307 { 1237 return 1;
1308 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1309 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1310 &orig_map->tile_path[tile_num], &orig_map->path);
1311 mp = new maptile (1, 1);
1312 mp->alloc ();
1313 mp->in_memory = MAP_IN_MEMORY;
1314 }
1315 }
1316 1238
1317 int dest_tile = (tile_num + 2) % 4;
1318
1319 orig_map->tile_map [tile_num] = mp;
1320
1321 // optimisation: back-link map to origin map if euclidean
1322 //TODO: non-euclidean maps MUST GO
1323 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1324 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1325
1326 return mp; 1239 return 0;
1327}
1328
1329static inline void
1330load_and_link (maptile *orig_map, int tile_num)
1331{
1332 find_and_link (orig_map, tile_num)->load_sync ();
1333} 1240}
1334 1241
1335/* this returns TRUE if the coordinates (x,y) are out of 1242/* this returns TRUE if the coordinates (x,y) are out of
1336 * map m. This function also takes into account any 1243 * map m. This function also takes into account any
1337 * tiling considerations, loading adjacant maps as needed. 1244 * tiling considerations, loading adjacant maps as needed.
… …
1350 if (!m) 1257 if (!m)
1351 return 0; 1258 return 0;
1352 1259
1353 if (x < 0) 1260 if (x < 0)
1354 { 1261 {
1355 if (!m->tile_path[3]) 1262 if (!m->tile_available (3))
1356 return 1; 1263 return 1;
1357 1264
1358 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1359 find_and_link (m, 3);
1360
1361 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1265 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1362 } 1266 }
1363 1267
1364 if (x >= m->width) 1268 if (x >= m->width)
1365 { 1269 {
1366 if (!m->tile_path[1]) 1270 if (!m->tile_available (1))
1367 return 1; 1271 return 1;
1368 1272
1369 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1370 find_and_link (m, 1);
1371
1372 return out_of_map (m->tile_map[1], x - m->width, y); 1273 return out_of_map (m->tile_map[1], x - m->width, y);
1373 } 1274 }
1374 1275
1375 if (y < 0) 1276 if (y < 0)
1376 { 1277 {
1377 if (!m->tile_path[0]) 1278 if (!m->tile_available (0))
1378 return 1; 1279 return 1;
1379 1280
1380 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1381 find_and_link (m, 0);
1382
1383 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1281 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1384 } 1282 }
1385 1283
1386 if (y >= m->height) 1284 if (y >= m->height)
1387 { 1285 {
1388 if (!m->tile_path[2]) 1286 if (!m->tile_available (2))
1389 return 1; 1287 return 1;
1390
1391 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1392 find_and_link (m, 2);
1393 1288
1394 return out_of_map (m->tile_map[2], x, y - m->height); 1289 return out_of_map (m->tile_map[2], x, y - m->height);
1395 } 1290 }
1396 1291
1397 /* Simple case - coordinates are within this local 1292 /* Simple case - coordinates are within this local
… …
1411maptile * 1306maptile *
1412maptile::xy_find (sint16 &x, sint16 &y) 1307maptile::xy_find (sint16 &x, sint16 &y)
1413{ 1308{
1414 if (x < 0) 1309 if (x < 0)
1415 { 1310 {
1416 if (!tile_path[3]) 1311 if (!tile_available (3))
1417 return 0; 1312 return 0;
1418 1313
1419 find_and_link (this, 3);
1420 x += tile_map[3]->width; 1314 x += tile_map[3]->width;
1421 return tile_map[3]->xy_find (x, y); 1315 return tile_map[3]->xy_find (x, y);
1422 } 1316 }
1423 1317
1424 if (x >= width) 1318 if (x >= width)
1425 { 1319 {
1426 if (!tile_path[1]) 1320 if (!tile_available (1))
1427 return 0; 1321 return 0;
1428 1322
1429 find_and_link (this, 1);
1430 x -= width; 1323 x -= width;
1431 return tile_map[1]->xy_find (x, y); 1324 return tile_map[1]->xy_find (x, y);
1432 } 1325 }
1433 1326
1434 if (y < 0) 1327 if (y < 0)
1435 { 1328 {
1436 if (!tile_path[0]) 1329 if (!tile_available (0))
1437 return 0; 1330 return 0;
1438 1331
1439 find_and_link (this, 0);
1440 y += tile_map[0]->height; 1332 y += tile_map[0]->height;
1441 return tile_map[0]->xy_find (x, y); 1333 return tile_map[0]->xy_find (x, y);
1442 } 1334 }
1443 1335
1444 if (y >= height) 1336 if (y >= height)
1445 { 1337 {
1446 if (!tile_path[2]) 1338 if (!tile_available (2))
1447 return 0; 1339 return 0;
1448 1340
1449 find_and_link (this, 2);
1450 y -= height; 1341 y -= height;
1451 return tile_map[2]->xy_find (x, y); 1342 return tile_map[2]->xy_find (x, y);
1452 } 1343 }
1453 1344
1454 /* Simple case - coordinates are within this local 1345 /* Simple case - coordinates are within this local
… …
1465adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1356adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1466{ 1357{
1467 if (!map1 || !map2) 1358 if (!map1 || !map2)
1468 return 0; 1359 return 0;
1469 1360
1470 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1361 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1471 //fix: compare paths instead (this is likely faster, too!) 1362 //fix: compare paths instead (this is likely faster, too!)
1472 if (map1 == map2) 1363 if (map1 == map2)
1473 { 1364 {
1474 *dx = 0; 1365 *dx = 0;
1475 *dy = 0; 1366 *dy = 0;
… …
1581get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1472get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1582{ 1473{
1583 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1474 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1584 { 1475 {
1585 /* be conservative and fill in _some_ data */ 1476 /* be conservative and fill in _some_ data */
1586 retval->distance = 100000; 1477 retval->distance = 10000;
1587 retval->distance_x = 32767; 1478 retval->distance_x = 10000;
1588 retval->distance_y = 32767; 1479 retval->distance_y = 10000;
1589 retval->direction = 0; 1480 retval->direction = 0;
1590 retval->part = 0; 1481 retval->part = 0;
1591 } 1482 }
1592 else 1483 else
1593 { 1484 {
… …
1598 1489
1599 best = op1; 1490 best = op1;
1600 /* If this is multipart, find the closest part now */ 1491 /* If this is multipart, find the closest part now */
1601 if (!(flags & 0x1) && op1->more) 1492 if (!(flags & 0x1) && op1->more)
1602 { 1493 {
1603 object *tmp;
1604 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1494 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1605 1495
1606 /* we just take the offset of the piece to head to figure 1496 /* we just take the offset of the piece to head to figure
1607 * distance instead of doing all that work above again 1497 * distance instead of doing all that work above again
1608 * since the distance fields we set above are positive in the 1498 * since the distance fields we set above are positive in the
1609 * same axis as is used for multipart objects, the simply arithmetic 1499 * same axis as is used for multipart objects, the simply arithmetic
1610 * below works. 1500 * below works.
1611 */ 1501 */
1612 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1502 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1613 { 1503 {
1614 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1504 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1615 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1505 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1616 if (tmpi < best_distance) 1506 if (tmpi < best_distance)
1617 { 1507 {
… …
1626 retval->distance_y += op1->y - best->y; 1516 retval->distance_y += op1->y - best->y;
1627 } 1517 }
1628 } 1518 }
1629 1519
1630 retval->part = best; 1520 retval->part = best;
1631 retval->distance = idistance (retval->distance_x, retval->distance_y); 1521 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1632 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1522 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1633 } 1523 }
1634} 1524}
1635 1525
1636/* this is basically the same as get_rangevector above, but instead of 1526/* this is basically the same as get_rangevector above, but instead of
… …
1704 return default_region; 1594 return default_region;
1705 1595
1706 return ::region::default_region (); 1596 return ::region::default_region ();
1707} 1597}
1708 1598
1599/* picks a random object from a style map.
1600 */
1601object *
1602maptile::pick_random_object (rand_gen &gen) const
1603{
1604 /* while returning a null object will result in a crash, that
1605 * is actually preferable to an infinite loop. That is because
1606 * most servers will automatically restart in case of crash.
1607 * Change the logic on getting the random space - shouldn't make
1608 * any difference, but this seems clearer to me.
1609 */
1610 for (int i = 1000; --i;)
1611 {
1612 object *pick = at (gen (width), gen (height)).bot;
1709 1613
1614 // do not prefer big monsters just because they are big.
1615 if (pick && pick->is_head ())
1616 return pick->head_ ();
1617 }
1618
1619 // instead of crashing in the unlikely(?) case, try to return *something*
1620 return archetype::find ("bug");
1621}
1622
1623void
1624maptile::play_sound (faceidx sound, int x, int y) const
1625{
1626 if (!sound)
1627 return;
1628
1629 for_all_players (pl)
1630 if (pl->ob->map == this)
1631 if (client *ns = pl->ns)
1632 {
1633 int dx = x - pl->ob->x;
1634 int dy = y - pl->ob->y;
1635
1636 int distance = idistance (dx, dy);
1637
1638 if (distance <= MAX_SOUND_DISTANCE)
1639 ns->play_sound (sound, dx, dy);
1640 }
1641}
1642

Diff Legend

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