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.64 by root, Mon Jan 1 12:28:45 2007 UTC vs.
Revision 1.110 by root, Sun Jul 1 05:00:17 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software: you can redistribute it and/or modify
8 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
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22*/ 22 */
23 23
24#include <global.h>
25#include <funcpoint.h>
26
27#include <loader.h>
28#include <unistd.h> 24#include <unistd.h>
25
26#include "global.h"
27#include "funcpoint.h"
28
29#include "loader.h"
29 30
30#include "path.h" 31#include "path.h"
31 32
32/* 33/*
33 * This makes a path absolute outside the world of Crossfire. 34 * This makes a path absolute outside the world of Crossfire.
… …
66 char *endbuf; 67 char *endbuf;
67 struct stat statbuf; 68 struct stat statbuf;
68 int mode = 0; 69 int mode = 0;
69 70
70 if (prepend_dir) 71 if (prepend_dir)
71 strcpy (buf, create_pathname (name)); 72 assign (buf, create_pathname (name));
72 else 73 else
73 strcpy (buf, name); 74 assign (buf, name);
74 75
75 /* old method (strchr(buf, '\0')) seemd very odd to me - 76 /* old method (strchr(buf, '\0')) seemd very odd to me -
76 * this method should be equivalant and is clearer. 77 * this method should be equivalant and is clearer.
77 * Can not use strcat because we need to cycle through 78 * Can not use strcat because we need to cycle through
78 * all the names. 79 * all the names.
… …
172 * let the player through (inventory checkers for example) 173 * let the player through (inventory checkers for example)
173 */ 174 */
174 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 175 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
175 return 0; 176 return 0;
176 177
177 if (ob->head != NULL)
178 ob = ob->head; 178 ob = ob->head_ ();
179 179
180 /* We basically go through the stack of objects, and if there is 180 /* We basically go through the stack of objects, and if there is
181 * some other object that has NO_PASS or FLAG_ALIVE set, return 181 * some other object that has NO_PASS or FLAG_ALIVE set, return
182 * true. If we get through the entire stack, that must mean 182 * true. If we get through the entire stack, that must mean
183 * ob is blocking it, so return 0. 183 * ob is blocking it, so return 0.
… …
213 else 213 else
214 { 214 {
215 /* Broke apart a big nasty if into several here to make 215 /* Broke apart a big nasty if into several here to make
216 * this more readable. first check - if the space blocks 216 * this more readable. first check - if the space blocks
217 * movement, can't move here. 217 * movement, can't move here.
218 * second - if a monster, can't move there, unles it is a 218 * second - if a monster, can't move there, unless it is a
219 * hidden dm 219 * hidden dm
220 */ 220 */
221 if (OB_MOVE_BLOCK (ob, tmp)) 221 if (OB_MOVE_BLOCK (ob, tmp))
222 return 1; 222 return 1;
223 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 223
224 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 224 if (tmp->flag [FLAG_ALIVE]
225 && tmp->head_ () != ob
226 && tmp != ob
227 && tmp->type != DOOR
228 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
225 return 1; 229 return 1;
226 } 230 }
227 231
228 } 232 }
229 return 0; 233 return 0;
230} 234}
231
232 235
233/* 236/*
234 * Returns true if the given object can't fit in the given spot. 237 * Returns true if the given object can't fit in the given spot.
235 * This is meant for multi space objects - for single space objecs, 238 * This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 239 * just calling get_map_blocked and checking that against movement type
… …
272 275
273 /* don't have object, so don't know what types would block */ 276 /* don't have object, so don't know what types would block */
274 return m1->at (sx, sy).move_block; 277 return m1->at (sx, sy).move_block;
275 } 278 }
276 279
277 for (tmp = ob->arch; tmp; tmp = tmp->more) 280 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)
278 { 281 {
279 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 282 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
280 283
281 if (flag & P_OUT_OF_MAP) 284 if (flag & P_OUT_OF_MAP)
282 return P_OUT_OF_MAP; 285 return P_OUT_OF_MAP;
283 if (flag & P_IS_ALIVE) 286 if (flag & P_IS_ALIVE)
284 return P_IS_ALIVE; 287 return P_IS_ALIVE;
… …
343} 346}
344 347
345/* link_multipart_objects go through all the objects on the map looking 348/* link_multipart_objects go through all the objects on the map looking
346 * for objects whose arch says they are multipart yet according to the 349 * for objects whose arch says they are multipart yet according to the
347 * info we have, they only have the head (as would be expected when 350 * info we have, they only have the head (as would be expected when
348 * they are saved). We do have to look for the old maps that did save 351 * they are saved).
349 * the more sections and not re-add sections for them.
350 */ 352 */
351void 353void
352maptile::link_multipart_objects () 354maptile::link_multipart_objects ()
353{ 355{
354 if (!spaces) 356 if (!spaces)
355 return; 357 return;
356 358
357 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 359 for (mapspace *ms = spaces + size (); ms-- > spaces; )
358 for (object *tmp = ms->bot; tmp; ) 360 for (object *op = ms->bot; op; op = op->above)
359 { 361 {
360 object *above = tmp->above;
361
362 /* already multipart - don't do anything more */ 362 /* already multipart - don't do anything more */
363 if (!tmp->head && !tmp->more) 363 if (op->head_ () == op && !op->more && op->arch->more)
364 { 364 {
365 /* If there is nothing more to this object, this for loop 365 op->remove ();
366 * won't do anything. 366 op->expand_tail ();
367 */
368 archetype *at;
369 object *last, *op;
370 for (at = tmp->arch->more, last = tmp;
371 at;
372 at = at->more, last = op)
373 {
374 op = arch_to_object (at);
375
376 /* update x,y coordinates */
377 op->x += tmp->x;
378 op->y += tmp->y;
379 op->head = tmp;
380 op->map = this;
381 last->more = op;
382 op->name = tmp->name;
383 op->title = tmp->title;
384
385 /* we could link all the parts onto tmp, and then just
386 * call insert_ob_in_map once, but the effect is the same,
387 * as insert_ob_in_map will call itself with each part, and
388 * the coding is simpler to just to it here with each part.
389 */
390 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 367 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);
391 }
392 } 368 }
393
394 tmp = above;
395 } 369 }
396} 370}
397 371
398/* 372/*
399 * Loads (ands parses) the objects into a given map from the specified 373 * Loads (ands parses) the objects into a given map from the specified
400 * file pointer. 374 * file pointer.
401 * mapflags is the same as we get with load_original_map
402 */ 375 */
403bool 376bool
404maptile::load_objects (object_thawer &thawer) 377maptile::_load_objects (object_thawer &f)
405{ 378{
406 int unique; 379 for (;;)
407 object *op, *prev = NULL, *last_more = NULL, *otmp;
408
409 op = object::create ();
410 op->map = this; /* To handle buttons correctly */
411
412 while (int i = load_object (thawer, op, 0))
413 { 380 {
414 /* if the archetype for the object is null, means that we 381 coroapi::cede_to_tick_every (100); // cede once in a while
415 * got an invalid object. Don't do anything with it - the game 382
416 * or editor will not be able to do anything with it either. 383 switch (f.kw)
417 */
418 if (op->arch == NULL)
419 { 384 {
420 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 385 case KW_arch:
421 continue; 386 if (object *op = object::read (f, this))
422 }
423
424 switch (i)
425 { 387 {
426 case LL_NORMAL: 388 if (op->inv)
389 sum_weight (op);
390
427 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 391 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
392 }
428 393
429 if (op->inv) 394 continue;
430 sum_weight (op);
431 395
432 prev = op, last_more = op;
433 break;
434
435 case LL_MORE: 396 case KW_EOF:
436 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 397 return true;
437 op->head = prev, last_more->more = op, last_more = op; 398
399 default:
400 if (!f.parse_error ("map file"))
401 return false;
438 break; 402 break;
439 } 403 }
440 404
441 op = object::create (); 405 f.next ();
442 op->map = this;
443 }
444
445 op->destroy ();
446
447#if 0
448 for (i = 0; i < width; i++)
449 for (j = 0; j < height; j++)
450 {
451 unique = 0;
452 /* check for unique items, or unique squares */
453 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
454 {
455 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
456 unique = 1;
457
458 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
459 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
460 }
461 } 406 }
462#endif
463 407
464 return true; 408 return true;
465} 409}
466 410
467void 411void
468maptile::activate () 412maptile::activate ()
469{ 413{
414 active = true;
415
470 if (!spaces) 416 if (spaces)
471 return;
472
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 417 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 418 for (object *op = ms->bot; op; op = op->above)
475 op->activate_recursive (); 419 op->activate_recursive ();
476} 420}
477 421
478void 422void
479maptile::deactivate () 423maptile::deactivate ()
480{ 424{
425 active = false;
426
481 if (!spaces) 427 if (spaces)
482 return;
483
484 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 428 for (mapspace *ms = spaces + size (); ms-- > spaces; )
485 for (object *op = ms->bot; op; op = op->above) 429 for (object *op = ms->bot; op; op = op->above)
486 op->deactivate_recursive (); 430 op->deactivate_recursive ();
487} 431}
488 432
489bool 433bool
490maptile::save_objects (object_freezer &freezer, int flags) 434maptile::_save_objects (object_freezer &f, int flags)
491{ 435{
436 coroapi::cede_to_tick ();
437
492 if (flags & IO_HEADER) 438 if (flags & IO_HEADER)
493 save_header (freezer); 439 _save_header (f);
494 440
495 if (!spaces) 441 if (!spaces)
496 return false; 442 return false;
497 443
498 for (int i = 0; i < size (); ++i) 444 for (int i = 0; i < size (); ++i)
… …
507 continue; 453 continue;
508 454
509 if (unique || op->flag [FLAG_UNIQUE]) 455 if (unique || op->flag [FLAG_UNIQUE])
510 { 456 {
511 if (flags & IO_UNIQUES) 457 if (flags & IO_UNIQUES)
512 save_object (freezer, op, 1); 458 op->write (f);
513 } 459 }
514 else if (flags & IO_OBJECTS) 460 else if (flags & IO_OBJECTS)
515 save_object (freezer, op, 1); 461 op->write (f);
516 } 462 }
517 } 463 }
518 464
465 coroapi::cede_to_tick ();
466
519 return true; 467 return true;
520} 468}
521 469
522bool 470bool
523maptile::load_objects (const char *path, bool skip_header) 471maptile::_load_objects (const char *path, bool skip_header)
524{ 472{
525 object_thawer thawer (path); 473 object_thawer f (path);
526 474
527 if (!thawer) 475 if (!f)
528 return false; 476 return false;
477
478 f.next ();
529 479
530 if (skip_header) 480 if (skip_header)
531 for (;;) 481 for (;;)
532 { 482 {
533 keyword kw = thawer.get_kv (); 483 keyword kw = f.kw;
534 484 f.skip ();
535 if (kw == KW_end) 485 if (kw == KW_end)
536 break; 486 break;
537
538 thawer.skip_kv (kw);
539 } 487 }
540 488
541 return load_objects (thawer); 489 return _load_objects (f);
542} 490}
543 491
544bool 492bool
545maptile::save_objects (const char *path, int flags) 493maptile::_save_objects (const char *path, int flags)
546{ 494{
547 object_freezer freezer; 495 object_freezer freezer;
548 496
549 if (!save_objects (freezer, flags)) 497 if (!_save_objects (freezer, flags))
550 return false; 498 return false;
551 499
552 return freezer.save (path); 500 return freezer.save (path);
553} 501}
554 502
555maptile::maptile () 503maptile::maptile ()
556{ 504{
557 in_memory = MAP_SWAPPED; 505 in_memory = MAP_SWAPPED;
558 506
559 /* The maps used to pick up default x and y values from the 507 /* The maps used to pick up default x and y values from the
560 * map archetype. Mimic that behaviour. 508 * map archetype. Mimic that behaviour.
561 */ 509 */
562 width = 16; 510 width = 16;
563 height = 16; 511 height = 16;
564 reset_timeout = 0;
565 timeout = 300; 512 timeout = 300;
566 enter_x = 0; 513 max_nrof = 1000; // 1000 items of anything
567 enter_y = 0; 514 max_volume = 2000000; // 2m³
568} 515}
569 516
570maptile::maptile (int w, int h) 517maptile::maptile (int w, int h)
571{ 518{
572 in_memory = MAP_SWAPPED; 519 in_memory = MAP_SWAPPED;
… …
718 * This could be done in lex (like the object loader), but I think 665 * This could be done in lex (like the object loader), but I think
719 * currently, there are few enough fields this is not a big deal. 666 * currently, there are few enough fields this is not a big deal.
720 * MSW 2001-07-01 667 * MSW 2001-07-01
721 */ 668 */
722bool 669bool
723maptile::load_header (object_thawer &thawer) 670maptile::_load_header (object_thawer &thawer)
724{ 671{
725 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
726 int msgpos = 0;
727 int maplorepos = 0;
728
729 for (;;) 672 for (;;)
730 { 673 {
731 keyword kw = thawer.get_kv (); 674 thawer.next ();
732 675
733 switch (kw) 676 switch (thawer.kw)
734 { 677 {
735 case KW_EOF:
736 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
737 return false;
738
739 case KW_end:
740 return true;
741
742 case KW_msg: 678 case KW_msg:
743 thawer.get_ml (KW_endmsg, msg); 679 thawer.get_ml (KW_endmsg, msg);
744 break; 680 break;
745 681
746 case KW_lore: // CF+ extension 682 case KW_lore: // CF+ extension
… …
777 case KW_winddir: thawer.get (winddir); break; 713 case KW_winddir: thawer.get (winddir); break;
778 case KW_sky: thawer.get (sky); break; 714 case KW_sky: thawer.get (sky); break;
779 715
780 case KW_per_player: thawer.get (per_player); break; 716 case KW_per_player: thawer.get (per_player); break;
781 case KW_per_party: thawer.get (per_party); break; 717 case KW_per_party: thawer.get (per_party); break;
718 case KW_no_reset: thawer.get (no_reset); break;
782 719
783 case KW_region: get_region_by_name (thawer.get_str ()); break; 720 case KW_region: default_region = region::find (thawer.get_str ()); break;
784 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 721 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
785 722
786 // old names new names 723 // old names new names
787 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 724 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
788 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 725 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
797 case KW_tile_path_1: thawer.get (tile_path [0]); break; 734 case KW_tile_path_1: thawer.get (tile_path [0]); break;
798 case KW_tile_path_2: thawer.get (tile_path [1]); break; 735 case KW_tile_path_2: thawer.get (tile_path [1]); break;
799 case KW_tile_path_3: thawer.get (tile_path [2]); break; 736 case KW_tile_path_3: thawer.get (tile_path [2]); break;
800 case KW_tile_path_4: thawer.get (tile_path [3]); break; 737 case KW_tile_path_4: thawer.get (tile_path [3]); break;
801 738
739 case KW_end:
740 return true;
741
802 default: 742 default:
803 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); 743 if (!thawer.parse_error ("map", 0))
744 return false;
804 break; 745 break;
805 } 746 }
806 } 747 }
807 748
808 abort (); 749 abort ();
809} 750}
810 751
811bool 752bool
812maptile::load_header (const char *path) 753maptile::_load_header (const char *path)
813{ 754{
814 object_thawer thawer (path); 755 object_thawer thawer (path);
815 756
816 if (!thawer) 757 if (!thawer)
817 return false; 758 return false;
818 759
819 return load_header (thawer); 760 return _load_header (thawer);
820} 761}
821 762
822/****************************************************************************** 763/******************************************************************************
823 * This is the start of unique map handling code 764 * This is the start of unique map handling code
824 *****************************************************************************/ 765 *****************************************************************************/
… …
835 object *above = op->above; 776 object *above = op->above;
836 777
837 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 778 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
838 unique = 1; 779 unique = 1;
839 780
840 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 781 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
841 { 782 {
842 op->destroy_inv (false); 783 op->destroy_inv (false);
843 op->destroy (); 784 op->destroy ();
844 } 785 }
845 786
… …
847 } 788 }
848 } 789 }
849} 790}
850 791
851bool 792bool
852maptile::save_header (object_freezer &freezer) 793maptile::_save_header (object_freezer &freezer)
853{ 794{
854#define MAP_OUT(k) freezer.put (KW_ ## k, k) 795#define MAP_OUT(k) freezer.put (KW_ ## k, k)
855#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 796#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
856 797
857 MAP_OUT2 (arch, "map"); 798 MAP_OUT2 (arch, "map");
… …
859 if (name) MAP_OUT (name); 800 if (name) MAP_OUT (name);
860 MAP_OUT (swap_time); 801 MAP_OUT (swap_time);
861 MAP_OUT (reset_time); 802 MAP_OUT (reset_time);
862 MAP_OUT (reset_timeout); 803 MAP_OUT (reset_timeout);
863 MAP_OUT (fixed_resettime); 804 MAP_OUT (fixed_resettime);
805 MAP_OUT (no_reset);
864 MAP_OUT (difficulty); 806 MAP_OUT (difficulty);
865 807
866 if (region) MAP_OUT2 (region, region->name); 808 if (default_region) MAP_OUT2 (region, default_region->name);
867 809
868 if (shopitems) 810 if (shopitems)
869 { 811 {
870 char shop[MAX_BUF]; 812 char shop[MAX_BUF];
871 print_shop_string (this, shop); 813 print_shop_string (this, shop);
… …
906 848
907 return true; 849 return true;
908} 850}
909 851
910bool 852bool
911maptile::save_header (const char *path) 853maptile::_save_header (const char *path)
912{ 854{
913 object_freezer freezer; 855 object_freezer freezer;
914 856
915 if (!save_header (freezer)) 857 if (!_save_header (freezer))
916 return false; 858 return false;
917 859
918 return freezer.save (path); 860 return freezer.save (path);
919} 861}
920 862
… …
922 * Remove and free all objects in the given map. 864 * Remove and free all objects in the given map.
923 */ 865 */
924void 866void
925maptile::clear () 867maptile::clear ()
926{ 868{
869 sfree (regions, size ()), regions = 0;
870 free (regionmap), regionmap = 0;
871
927 if (!spaces) 872 if (spaces)
928 return; 873 {
929
930 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 874 for (mapspace *ms = spaces + size (); ms-- > spaces; )
931 while (object *op = ms->bot) 875 while (object *op = ms->bot)
932 { 876 {
933 if (op->head)
934 op = op->head; 877 op = op->head_ ();
935
936 op->destroy_inv (false); 878 op->destroy_inv (false);
937 op->destroy (); 879 op->destroy ();
938 } 880 }
939 881
940 sfree (spaces, size ()), spaces = 0; 882 sfree (spaces, size ()), spaces = 0;
883 }
941 884
942 if (buttons) 885 if (buttons)
943 free_objectlinkpt (buttons), buttons = 0; 886 free_objectlinkpt (buttons), buttons = 0;
944} 887}
945 888
… …
978maptile::do_destroy () 921maptile::do_destroy ()
979{ 922{
980 attachable::do_destroy (); 923 attachable::do_destroy ();
981 924
982 clear (); 925 clear ();
926}
927
928/* decay and destroy perishable items in a map */
929void
930maptile::do_decay_objects ()
931{
932 if (!spaces)
933 return;
934
935 for (mapspace *ms = spaces + size (); ms-- > spaces; )
936 for (object *above, *op = ms->bot; op; op = above)
937 {
938 above = op->above;
939
940 bool destroy = 0;
941
942 // do not decay anything above unique floor tiles (yet :)
943 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
944 break;
945
946 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
947 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
948 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
949 || QUERY_FLAG (op, FLAG_UNIQUE)
950 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
951 || QUERY_FLAG (op, FLAG_UNPAID)
952 || op->is_alive ())
953 ; // do not decay
954 else if (op->is_weapon ())
955 {
956 op->stats.dam--;
957 if (op->stats.dam < 0)
958 destroy = 1;
959 }
960 else if (op->is_armor ())
961 {
962 op->stats.ac--;
963 if (op->stats.ac < 0)
964 destroy = 1;
965 }
966 else if (op->type == FOOD)
967 {
968 op->stats.food -= rndm (5, 20);
969 if (op->stats.food < 0)
970 destroy = 1;
971 }
972 else
973 {
974 int mat = op->materials;
975
976 if (mat & M_PAPER
977 || mat & M_LEATHER
978 || mat & M_WOOD
979 || mat & M_ORGANIC
980 || mat & M_CLOTH
981 || mat & M_LIQUID
982 || (mat & M_IRON && rndm (1, 5) == 1)
983 || (mat & M_GLASS && rndm (1, 2) == 1)
984 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
985 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
986 || (mat & M_ICE && temp > 32))
987 destroy = 1;
988 }
989
990 /* adjust overall chance below */
991 if (destroy && rndm (0, 1))
992 op->destroy ();
993 }
983} 994}
984 995
985/* 996/*
986 * Updates every button on the map (by calling update_button() for them). 997 * Updates every button on the map (by calling update_button() for them).
987 */ 998 */
… …
1035 if (QUERY_FLAG (op, FLAG_GENERATOR)) 1046 if (QUERY_FLAG (op, FLAG_GENERATOR))
1036 { 1047 {
1037 total_exp += op->stats.exp; 1048 total_exp += op->stats.exp;
1038 1049
1039 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 1050 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1040 total_exp += at->clone.stats.exp * 8; 1051 total_exp += at->stats.exp * 8;
1041 1052
1042 monster_cnt++; 1053 monster_cnt++;
1043 } 1054 }
1044 } 1055 }
1045 1056
… …
1099 */ 1110 */
1100void 1111void
1101mapspace::update_ () 1112mapspace::update_ ()
1102{ 1113{
1103 object *tmp, *last = 0; 1114 object *tmp, *last = 0;
1104 uint8 flags = 0, light = 0, anywhere = 0; 1115 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1105 New_Face *top, *floor, *middle;
1106 object *top_obj, *floor_obj, *middle_obj;
1107 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1116 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1108 1117
1109 middle = blank_face; 1118 //object *middle = 0;
1110 top = blank_face; 1119 //object *top = 0;
1111 floor = blank_face; 1120 //object *floor = 0;
1112 1121 // this seems to generate better code than using locals, above
1113 middle_obj = 0; 1122 object *&top = faces_obj[0] = 0;
1114 top_obj = 0; 1123 object *&middle = faces_obj[1] = 0;
1115 floor_obj = 0; 1124 object *&floor = faces_obj[2] = 0;
1116 1125
1117 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1126 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1118 { 1127 {
1119 /* This could be made additive I guess (two lights better than 1128 /* This could be made additive I guess (two lights better than
1120 * one). But if so, it shouldn't be a simple additive - 2 1129 * one). But if so, it shouldn't be a simple additive - 2
… …
1133 * Always put the player down for drawing. 1142 * Always put the player down for drawing.
1134 */ 1143 */
1135 if (!tmp->invisible) 1144 if (!tmp->invisible)
1136 { 1145 {
1137 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1146 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1138 {
1139 top = tmp->face;
1140 top_obj = tmp; 1147 top = tmp;
1141 }
1142 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1148 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1143 { 1149 {
1144 /* If we got a floor, that means middle and top were below it, 1150 /* If we got a floor, that means middle and top were below it,
1145 * so should not be visible, so we clear them. 1151 * so should not be visible, so we clear them.
1146 */ 1152 */
1147 middle = blank_face; 1153 middle = 0;
1148 top = blank_face; 1154 top = 0;
1149 floor = tmp->face;
1150 floor_obj = tmp; 1155 floor = tmp;
1151 } 1156 }
1152 /* Flag anywhere have high priority */ 1157 /* Flag anywhere have high priority */
1153 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1158 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1154 { 1159 {
1155 middle = tmp->face;
1156
1157 middle_obj = tmp; 1160 middle = tmp;
1158 anywhere = 1; 1161 anywhere = 1;
1159 } 1162 }
1160 /* Find the highest visible face around. If equal 1163 /* Find the highest visible face around. If equal
1161 * visibilities, we still want the one nearer to the 1164 * visibilities, we still want the one nearer to the
1162 * top 1165 * top
1163 */ 1166 */
1164 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1167 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1165 {
1166 middle = tmp->face;
1167 middle_obj = tmp; 1168 middle = tmp;
1168 }
1169 } 1169 }
1170 1170
1171 if (tmp == tmp->above) 1171 if (tmp == tmp->above)
1172 { 1172 {
1173 LOG (llevError, "Error in structure of map\n"); 1173 LOG (llevError, "Error in structure of map\n");
… …
1208 * middle face. This should not happen, as we already have the 1208 * middle face. This should not happen, as we already have the
1209 * else statement above so middle should not get set. OTOH, it 1209 * else statement above so middle should not get set. OTOH, it
1210 * may be possible for the faces to match but be different objects. 1210 * may be possible for the faces to match but be different objects.
1211 */ 1211 */
1212 if (top == middle) 1212 if (top == middle)
1213 middle = blank_face; 1213 middle = 0;
1214 1214
1215 /* There are three posibilities at this point: 1215 /* There are three posibilities at this point:
1216 * 1) top face is set, need middle to be set. 1216 * 1) top face is set, need middle to be set.
1217 * 2) middle is set, need to set top. 1217 * 2) middle is set, need to set top.
1218 * 3) neither middle or top is set - need to set both. 1218 * 3) neither middle or top is set - need to set both.
… …
1223 /* Once we get to a floor, stop, since we already have a floor object */ 1223 /* Once we get to a floor, stop, since we already have a floor object */
1224 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1224 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1225 break; 1225 break;
1226 1226
1227 /* If two top faces are already set, quit processing */ 1227 /* If two top faces are already set, quit processing */
1228 if ((top != blank_face) && (middle != blank_face)) 1228 if (top && middle)
1229 break; 1229 break;
1230 1230
1231 /* Only show visible faces, unless its the editor - show all */ 1231 /* Only show visible faces */
1232 if (!tmp->invisible || editor) 1232 if (!tmp->invisible)
1233 { 1233 {
1234 /* Fill in top if needed */ 1234 /* Fill in top if needed */
1235 if (top == blank_face) 1235 if (!top)
1236 { 1236 {
1237 top = tmp->face;
1238 top_obj = tmp; 1237 top = tmp;
1239 if (top == middle) 1238 if (top == middle)
1240 middle = blank_face; 1239 middle = 0;
1241 } 1240 }
1242 else 1241 else
1243 { 1242 {
1244 /* top is already set - we should only get here if 1243 /* top is already set - we should only get here if
1245 * middle is not set 1244 * middle is not set
1246 * 1245 *
1247 * Set the middle face and break out, since there is nothing 1246 * Set the middle face and break out, since there is nothing
1248 * more to fill in. We don't check visiblity here, since 1247 * more to fill in. We don't check visiblity here, since
1249 * 1248 *
1250 */ 1249 */
1251 if (tmp->face != top) 1250 if (tmp != top)
1252 { 1251 {
1253 middle = tmp->face;
1254 middle_obj = tmp; 1252 middle = tmp;
1255 break; 1253 break;
1256 } 1254 }
1257 } 1255 }
1258 } 1256 }
1259 } 1257 }
1260 1258
1261 if (middle == floor) 1259 if (middle == floor)
1262 middle = blank_face; 1260 middle = 0;
1263 1261
1264 if (top == middle) 1262 if (top == middle)
1265 middle = blank_face; 1263 middle = 0;
1266 1264
1267 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1265#if 0
1268 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1266 faces_obj [0] = top;
1269 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1267 faces_obj [1] = middle;
1268 faces_obj [2] = floor;
1269#endif
1270} 1270}
1271 1271
1272uint64
1273mapspace::volume () const
1274{
1275 uint64 vol = 0;
1276
1277 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1278 vol += op->volume ();
1279
1280 return vol;
1281}
1282
1272/* this updates the orig_map->tile_map[tile_num] value after loading 1283/* this updates the orig_map->tile_map[tile_num] value after finding
1273 * the map. It also takes care of linking back the freshly loaded 1284 * the map. It also takes care of linking back the freshly found
1274 * maps tile_map values if it tiles back to this one. It returns 1285 * maps tile_map values if it tiles back to this one. It returns
1275 * the value of orig_map->tile_map[tile_num]. It really only does this 1286 * the value of orig_map->tile_map[tile_num].
1276 * so that it is easier for calling functions to verify success.
1277 */ 1287 */
1278static maptile * 1288static inline maptile *
1279load_and_link_tiled_map (maptile *orig_map, int tile_num) 1289find_and_link (maptile *orig_map, int tile_num)
1280{ 1290{
1291 maptile *mp = orig_map->tile_map [tile_num];
1292
1293 if (!mp)
1294 {
1281 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1295 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1282 1296
1283 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1297 if (!mp)
1284 { 1298 {
1285 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1299 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1286 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1300 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1287 &orig_map->tile_path[tile_num], &orig_map->path); 1301 &orig_map->tile_path[tile_num], &orig_map->path);
1288 mp = new maptile (1, 1); 1302 mp = new maptile (1, 1);
1289 mp->alloc (); 1303 mp->alloc ();
1290 mp->in_memory = MAP_IN_MEMORY; 1304 mp->in_memory = MAP_IN_MEMORY;
1305 }
1291 } 1306 }
1292 1307
1293 int dest_tile = (tile_num + 2) % 4; 1308 int dest_tile = (tile_num + 2) % 4;
1294 1309
1295 orig_map->tile_map[tile_num] = mp; 1310 orig_map->tile_map [tile_num] = mp;
1296 1311
1297 // optimisation: back-link map to origin map if euclidean 1312 // optimisation: back-link map to origin map if euclidean
1298 //TODO: non-euclidean maps MUST GO 1313 //TODO: non-euclidean maps MUST GO
1299 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) 1314 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1300 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 1315 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1301 1316
1302 return mp; 1317 return mp;
1318}
1319
1320static inline void
1321load_and_link (maptile *orig_map, int tile_num)
1322{
1323 find_and_link (orig_map, tile_num)->load_sync ();
1303} 1324}
1304 1325
1305/* this returns TRUE if the coordinates (x,y) are out of 1326/* this returns TRUE if the coordinates (x,y) are out of
1306 * map m. This function also takes into account any 1327 * map m. This function also takes into account any
1307 * tiling considerations, loading adjacant maps as needed. 1328 * tiling considerations, loading adjacant maps as needed.
… …
1324 { 1345 {
1325 if (!m->tile_path[3]) 1346 if (!m->tile_path[3])
1326 return 1; 1347 return 1;
1327 1348
1328 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1349 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1329 load_and_link_tiled_map (m, 3); 1350 find_and_link (m, 3);
1330 1351
1331 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1352 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1332 } 1353 }
1333 1354
1334 if (x >= m->width) 1355 if (x >= m->width)
1335 { 1356 {
1336 if (!m->tile_path[1]) 1357 if (!m->tile_path[1])
1337 return 1; 1358 return 1;
1338 1359
1339 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1360 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1340 load_and_link_tiled_map (m, 1); 1361 find_and_link (m, 1);
1341 1362
1342 return out_of_map (m->tile_map[1], x - m->width, y); 1363 return out_of_map (m->tile_map[1], x - m->width, y);
1343 } 1364 }
1344 1365
1345 if (y < 0) 1366 if (y < 0)
1346 { 1367 {
1347 if (!m->tile_path[0]) 1368 if (!m->tile_path[0])
1348 return 1; 1369 return 1;
1349 1370
1350 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1371 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1351 load_and_link_tiled_map (m, 0); 1372 find_and_link (m, 0);
1352 1373
1353 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1374 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1354 } 1375 }
1355 1376
1356 if (y >= m->height) 1377 if (y >= m->height)
1357 { 1378 {
1358 if (!m->tile_path[2]) 1379 if (!m->tile_path[2])
1359 return 1; 1380 return 1;
1360 1381
1361 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1382 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1362 load_and_link_tiled_map (m, 2); 1383 find_and_link (m, 2);
1363 1384
1364 return out_of_map (m->tile_map[2], x, y - m->height); 1385 return out_of_map (m->tile_map[2], x, y - m->height);
1365 } 1386 }
1366 1387
1367 /* Simple case - coordinates are within this local 1388 /* Simple case - coordinates are within this local
… …
1372 1393
1373/* This is basically the same as out_of_map above, but 1394/* This is basically the same as out_of_map above, but
1374 * instead we return NULL if no map is valid (coordinates 1395 * instead we return NULL if no map is valid (coordinates
1375 * out of bounds and no tiled map), otherwise it returns 1396 * out of bounds and no tiled map), otherwise it returns
1376 * the map as that the coordinates are really on, and 1397 * the map as that the coordinates are really on, and
1377 * updates x and y to be the localized coordinates. 1398 * updates x and y to be the localised coordinates.
1378 * Using this is more efficient of calling out_of_map 1399 * Using this is more efficient of calling out_of_map
1379 * and then figuring out what the real map is 1400 * and then figuring out what the real map is
1380 */ 1401 */
1381maptile * 1402maptile *
1382get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1403maptile::xy_find (sint16 &x, sint16 &y)
1383{ 1404{
1384 if (*x < 0) 1405 if (x < 0)
1385 { 1406 {
1386 if (!m->tile_path[3]) 1407 if (!tile_path[3])
1387 return 0; 1408 return 0;
1388 1409
1389 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1410 find_and_link (this, 3);
1390 load_and_link_tiled_map (m, 3);
1391
1392 *x += m->tile_map[3]->width; 1411 x += tile_map[3]->width;
1393 return (get_map_from_coord (m->tile_map[3], x, y)); 1412 return tile_map[3]->xy_find (x, y);
1394 } 1413 }
1395 1414
1396 if (*x >= m->width) 1415 if (x >= width)
1397 { 1416 {
1398 if (!m->tile_path[1]) 1417 if (!tile_path[1])
1399 return 0; 1418 return 0;
1400 1419
1401 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1420 find_and_link (this, 1);
1402 load_and_link_tiled_map (m, 1);
1403
1404 *x -= m->width; 1421 x -= width;
1405 return (get_map_from_coord (m->tile_map[1], x, y)); 1422 return tile_map[1]->xy_find (x, y);
1406 } 1423 }
1407 1424
1408 if (*y < 0) 1425 if (y < 0)
1409 { 1426 {
1410 if (!m->tile_path[0]) 1427 if (!tile_path[0])
1411 return 0; 1428 return 0;
1412 1429
1413 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1430 find_and_link (this, 0);
1414 load_and_link_tiled_map (m, 0);
1415
1416 *y += m->tile_map[0]->height; 1431 y += tile_map[0]->height;
1417 return (get_map_from_coord (m->tile_map[0], x, y)); 1432 return tile_map[0]->xy_find (x, y);
1418 } 1433 }
1419 1434
1420 if (*y >= m->height) 1435 if (y >= height)
1421 { 1436 {
1422 if (!m->tile_path[2]) 1437 if (!tile_path[2])
1423 return 0; 1438 return 0;
1424 1439
1425 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1440 find_and_link (this, 2);
1426 load_and_link_tiled_map (m, 2);
1427
1428 *y -= m->height; 1441 y -= height;
1429 return (get_map_from_coord (m->tile_map[2], x, y)); 1442 return tile_map[2]->xy_find (x, y);
1430 } 1443 }
1431 1444
1432 /* Simple case - coordinates are within this local 1445 /* Simple case - coordinates are within this local
1433 * map. 1446 * map.
1434 */ 1447 */
1435 return m; 1448 return this;
1436} 1449}
1437 1450
1438/** 1451/**
1439 * Return whether map2 is adjacent to map1. If so, store the distance from 1452 * Return whether map2 is adjacent to map1. If so, store the distance from
1440 * map1 to map2 in dx/dy. 1453 * map1 to map2 in dx/dy.
1441 */ 1454 */
1442static int 1455int
1443adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1456adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1444{ 1457{
1445 if (!map1 || !map2) 1458 if (!map1 || !map2)
1446 return 0; 1459 return 0;
1447 1460
1461 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded
1462 //fix: compare paths instead (this is likely faster, too!)
1448 if (map1 == map2) 1463 if (map1 == map2)
1449 { 1464 {
1450 *dx = 0; 1465 *dx = 0;
1451 *dy = 0; 1466 *dy = 0;
1452 } 1467 }
… …
1512 } 1527 }
1513 else 1528 else
1514 return 0; 1529 return 0;
1515 1530
1516 return 1; 1531 return 1;
1532}
1533
1534maptile *
1535maptile::xy_load (sint16 &x, sint16 &y)
1536{
1537 maptile *map = xy_find (x, y);
1538
1539 if (map)
1540 map->load_sync ();
1541
1542 return map;
1543}
1544
1545maptile *
1546get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1547{
1548 return m->xy_load (*x, *y);
1517} 1549}
1518 1550
1519/* From map.c 1551/* From map.c
1520 * This is used by get_player to determine where the other 1552 * This is used by get_player to determine where the other
1521 * creature is. get_rangevector takes into account map tiling, 1553 * creature is. get_rangevector takes into account map tiling,
1522 * so you just can not look the the map coordinates and get the 1554 * so you just can not look the the map coordinates and get the
1523 * righte value. distance_x/y are distance away, which 1555 * righte value. distance_x/y are distance away, which
1524 * can be negativbe. direction is the crossfire direction scheme 1556 * can be negative. direction is the crossfire direction scheme
1525 * that the creature should head. part is the part of the 1557 * that the creature should head. part is the part of the
1526 * monster that is closest. 1558 * monster that is closest.
1527 * 1559 *
1528 * get_rangevector looks at op1 and op2, and fills in the 1560 * get_rangevector looks at op1 and op2, and fills in the
1529 * structure for op1 to get to op2. 1561 * structure for op1 to get to op2.
… …
1540get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1572get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1541{ 1573{
1542 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1574 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1543 { 1575 {
1544 /* be conservative and fill in _some_ data */ 1576 /* be conservative and fill in _some_ data */
1545 retval->distance = 100000; 1577 retval->distance = 10000;
1546 retval->distance_x = 32767; 1578 retval->distance_x = 10000;
1547 retval->distance_y = 32767; 1579 retval->distance_y = 10000;
1548 retval->direction = 0; 1580 retval->direction = 0;
1549 retval->part = 0; 1581 retval->part = 0;
1550 } 1582 }
1551 else 1583 else
1552 { 1584 {
… …
1557 1589
1558 best = op1; 1590 best = op1;
1559 /* If this is multipart, find the closest part now */ 1591 /* If this is multipart, find the closest part now */
1560 if (!(flags & 0x1) && op1->more) 1592 if (!(flags & 0x1) && op1->more)
1561 { 1593 {
1562 object *tmp;
1563 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1594 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1564 1595
1565 /* we just take the offset of the piece to head to figure 1596 /* we just take the offset of the piece to head to figure
1566 * distance instead of doing all that work above again 1597 * distance instead of doing all that work above again
1567 * since the distance fields we set above are positive in the 1598 * since the distance fields we set above are positive in the
1568 * same axis as is used for multipart objects, the simply arithmetic 1599 * same axis as is used for multipart objects, the simply arithmetic
1569 * below works. 1600 * below works.
1570 */ 1601 */
1571 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1602 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1572 { 1603 {
1573 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1604 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1574 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1605 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1575 if (tmpi < best_distance) 1606 if (tmpi < best_distance)
1576 { 1607 {
1577 best_distance = tmpi; 1608 best_distance = tmpi;
1578 best = tmp; 1609 best = tmp;
1579 } 1610 }
1580 } 1611 }
1612
1581 if (best != op1) 1613 if (best != op1)
1582 { 1614 {
1583 retval->distance_x += op1->x - best->x; 1615 retval->distance_x += op1->x - best->x;
1584 retval->distance_y += op1->y - best->y; 1616 retval->distance_y += op1->y - best->y;
1585 } 1617 }
1586 } 1618 }
1619
1587 retval->part = best; 1620 retval->part = best;
1588 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1621 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1589 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1622 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1590 } 1623 }
1591} 1624}
1592 1625
1593/* this is basically the same as get_rangevector above, but instead of 1626/* this is basically the same as get_rangevector above, but instead of
… …
1598 * flags has no meaning for this function at this time - I kept it in to 1631 * flags has no meaning for this function at this time - I kept it in to
1599 * be more consistant with the above function and also in case they are needed 1632 * be more consistant with the above function and also in case they are needed
1600 * for something in the future. Also, since no object is pasted, the best 1633 * for something in the future. Also, since no object is pasted, the best
1601 * field of the rv_vector is set to NULL. 1634 * field of the rv_vector is set to NULL.
1602 */ 1635 */
1603
1604void 1636void
1605get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1637get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1606{ 1638{
1607 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1639 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1608 { 1640 {
1609 /* be conservative and fill in _some_ data */ 1641 /* be conservative and fill in _some_ data */
1610 retval->distance = 100000; 1642 retval->distance = 100000;
… …
1617 { 1649 {
1618 retval->distance_x += op2->x - x; 1650 retval->distance_x += op2->x - x;
1619 retval->distance_y += op2->y - y; 1651 retval->distance_y += op2->y - y;
1620 1652
1621 retval->part = NULL; 1653 retval->part = NULL;
1622 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1654 retval->distance = idistance (retval->distance_x, retval->distance_y);
1623 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1655 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1624 } 1656 }
1625} 1657}
1626 1658
1627/* Returns true of op1 and op2 are effectively on the same map 1659/* Returns true of op1 and op2 are effectively on the same map
… …
1647 op->remove (); 1679 op->remove ();
1648 1680
1649 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1681 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1650} 1682}
1651 1683
1684region *
1685maptile::region (int x, int y) const
1686{
1687 if (regions
1688 && regionmap
1689 && !OUT_OF_REAL_MAP (this, x, y))
1690 if (struct region *reg = regionmap [regions [y * width + x]])
1691 return reg;
1692
1693 if (default_region)
1694 return default_region;
1695
1696 return ::region::default_region ();
1697}
1698
1699/* picks a random object from a style map.
1700 * Redone by MSW so it should be faster and not use static
1701 * variables to generate tables.
1702 */
1703object *
1704maptile::pick_random_object () const
1705{
1706 /* while returning a null object will result in a crash, that
1707 * is actually preferable to an infinite loop. That is because
1708 * most servers will automatically restart in case of crash.
1709 * Change the logic on getting the random space - shouldn't make
1710 * any difference, but this seems clearer to me.
1711 */
1712 for (int i = 1000; --i;)
1713 {
1714 object *pick = at (rndm (width), rndm (height)).bot;
1715
1716 // do not prefer big monsters just because they are big.
1717 if (pick && pick->head_ () == pick)
1718 return pick->head_ ();
1719 }
1720
1721 // instead of crashing in the unlikely(?) case, try to return *something*
1722 return get_archetype ("blocked");
1723}
1724

Diff Legend

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