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.63 by root, Mon Jan 1 00:41:02 2007 UTC vs.
Revision 1.106 by root, Mon May 28 21:21:40 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
8 it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
9 the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
10 (at your option) any later version. 11 * 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, but
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 GNU General Public License for more details. 16 * 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 along
18 along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22*/ 23 */
23 24
24#include <global.h>
25#include <funcpoint.h>
26
27#include <loader.h>
28#include <unistd.h> 25#include <unistd.h>
26
27#include "global.h"
28#include "funcpoint.h"
29
30#include "loader.h"
29 31
30#include "path.h" 32#include "path.h"
31 33
32/* 34/*
33 * This makes a path absolute outside the world of Crossfire. 35 * This makes a path absolute outside the world of Crossfire.
… …
66 char *endbuf; 68 char *endbuf;
67 struct stat statbuf; 69 struct stat statbuf;
68 int mode = 0; 70 int mode = 0;
69 71
70 if (prepend_dir) 72 if (prepend_dir)
71 strcpy (buf, create_pathname (name)); 73 assign (buf, create_pathname (name));
72 else 74 else
73 strcpy (buf, name); 75 assign (buf, name);
74 76
75 /* old method (strchr(buf, '\0')) seemd very odd to me - 77 /* old method (strchr(buf, '\0')) seemd very odd to me -
76 * this method should be equivalant and is clearer. 78 * this method should be equivalant and is clearer.
77 * Can not use strcat because we need to cycle through 79 * Can not use strcat because we need to cycle through
78 * all the names. 80 * all the names.
… …
172 * let the player through (inventory checkers for example) 174 * let the player through (inventory checkers for example)
173 */ 175 */
174 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 176 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
175 return 0; 177 return 0;
176 178
177 if (ob->head != NULL)
178 ob = ob->head; 179 ob = ob->head_ ();
179 180
180 /* We basically go through the stack of objects, and if there is 181 /* 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 182 * some other object that has NO_PASS or FLAG_ALIVE set, return
182 * true. If we get through the entire stack, that must mean 183 * true. If we get through the entire stack, that must mean
183 * ob is blocking it, so return 0. 184 * ob is blocking it, so return 0.
… …
213 else 214 else
214 { 215 {
215 /* Broke apart a big nasty if into several here to make 216 /* Broke apart a big nasty if into several here to make
216 * this more readable. first check - if the space blocks 217 * this more readable. first check - if the space blocks
217 * movement, can't move here. 218 * movement, can't move here.
218 * second - if a monster, can't move there, unles it is a 219 * second - if a monster, can't move there, unless it is a
219 * hidden dm 220 * hidden dm
220 */ 221 */
221 if (OB_MOVE_BLOCK (ob, tmp)) 222 if (OB_MOVE_BLOCK (ob, tmp))
222 return 1; 223 return 1;
223 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 224
224 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 225 if (tmp->flag [FLAG_ALIVE]
226 && tmp->head_ () != ob
227 && tmp != ob
228 && tmp->type != DOOR
229 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
225 return 1; 230 return 1;
226 } 231 }
227 232
228 } 233 }
229 return 0; 234 return 0;
230} 235}
231
232 236
233/* 237/*
234 * Returns true if the given object can't fit in the given spot. 238 * 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, 239 * This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 240 * just calling get_map_blocked and checking that against movement type
… …
329 * carrying. 333 * carrying.
330 */ 334 */
331 sum_weight (container); 335 sum_weight (container);
332} 336}
333 337
338void
339maptile::set_object_flag (int flag, int value)
340{
341 if (!spaces)
342 return;
343
344 for (mapspace *ms = spaces + size (); ms-- > spaces; )
345 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
346 tmp->flag [flag] = value;
347}
348
334/* link_multipart_objects go through all the objects on the map looking 349/* link_multipart_objects go through all the objects on the map looking
335 * for objects whose arch says they are multipart yet according to the 350 * for objects whose arch says they are multipart yet according to the
336 * info we have, they only have the head (as would be expected when 351 * info we have, they only have the head (as would be expected when
337 * they are saved). We do have to look for the old maps that did save 352 * they are saved).
338 * the more sections and not re-add sections for them.
339 */ 353 */
340void 354void
341maptile::link_multipart_objects () 355maptile::link_multipart_objects ()
342{ 356{
343 if (!spaces) 357 if (!spaces)
344 return; 358 return;
345 359
346 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 360 for (mapspace *ms = spaces + size (); ms-- > spaces; )
347 for (object *tmp = ms->bot; tmp; ) 361 for (object *op = ms->bot; op; op = op->above)
348 { 362 {
349 object *above = tmp->above;
350
351 /* already multipart - don't do anything more */ 363 /* already multipart - don't do anything more */
352 if (!tmp->head && !tmp->more) 364 if (op->head_ () == op && !op->more && op->arch->more)
353 { 365 {
354 /* If there is nothing more to this object, this for loop 366 op->remove ();
355 * won't do anything. 367 op->expand_tail ();
356 */
357 archetype *at;
358 object *last, *op;
359 for (at = tmp->arch->more, last = tmp;
360 at;
361 at = at->more, last = op)
362 {
363 op = arch_to_object (at);
364
365 /* update x,y coordinates */
366 op->x += tmp->x;
367 op->y += tmp->y;
368 op->head = tmp;
369 op->map = this;
370 last->more = op;
371 op->name = tmp->name;
372 op->title = tmp->title;
373
374 /* we could link all the parts onto tmp, and then just
375 * call insert_ob_in_map once, but the effect is the same,
376 * as insert_ob_in_map will call itself with each part, and
377 * the coding is simpler to just to it here with each part.
378 */
379 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 368 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);
380 }
381 } 369 }
382
383 tmp = above;
384 } 370 }
385} 371}
386 372
387/* 373/*
388 * Loads (ands parses) the objects into a given map from the specified 374 * Loads (ands parses) the objects into a given map from the specified
389 * file pointer. 375 * file pointer.
390 * mapflags is the same as we get with load_original_map
391 */ 376 */
392bool 377bool
393maptile::load_objects (object_thawer &thawer) 378maptile::_load_objects (object_thawer &f)
394{ 379{
395 int unique; 380 for (;;)
396 object *op, *prev = NULL, *last_more = NULL, *otmp;
397
398 op = object::create ();
399 op->map = this; /* To handle buttons correctly */
400
401 while (int i = load_object (thawer, op, 0))
402 { 381 {
403 /* if the archetype for the object is null, means that we 382 coroapi::cede_to_tick_every (100); // cede once in a while
404 * got an invalid object. Don't do anything with it - the game 383
405 * or editor will not be able to do anything with it either. 384 switch (f.kw)
406 */
407 if (op->arch == NULL)
408 { 385 {
409 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 386 case KW_arch:
410 continue; 387 if (object *op = object::read (f, this))
411 }
412
413 switch (i)
414 { 388 {
415 case LL_NORMAL: 389 if (op->inv)
390 sum_weight (op);
391
416 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 392 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
393 }
417 394
418 if (op->inv) 395 continue;
419 sum_weight (op);
420 396
421 prev = op, last_more = op;
422 break;
423
424 case LL_MORE: 397 case KW_EOF:
425 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 398 return true;
426 op->head = prev, last_more->more = op, last_more = op; 399
400 default:
401 if (!f.parse_error ("map file"))
402 return false;
427 break; 403 break;
428 } 404 }
429 405
430 op = object::create (); 406 f.next ();
431 op->map = this;
432 }
433
434 op->destroy ();
435
436#if 0
437 for (i = 0; i < width; i++)
438 for (j = 0; j < height; j++)
439 {
440 unique = 0;
441 /* check for unique items, or unique squares */
442 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
443 {
444 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
445 unique = 1;
446
447 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
448 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
449 }
450 } 407 }
451#endif
452 408
453 return true; 409 return true;
454} 410}
455 411
456void 412void
457maptile::activate () 413maptile::activate ()
458{ 414{
415 active = true;
416
459 if (!spaces) 417 if (spaces)
460 return;
461
462 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 418 for (mapspace *ms = spaces + size (); ms-- > spaces; )
463 for (object *op = ms->bot; op; op = op->above) 419 for (object *op = ms->bot; op; op = op->above)
464 op->activate_recursive (); 420 op->activate_recursive ();
465} 421}
466 422
467void 423void
468maptile::deactivate () 424maptile::deactivate ()
469{ 425{
426 active = false;
427
470 if (!spaces) 428 if (spaces)
471 return;
472
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 429 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 430 for (object *op = ms->bot; op; op = op->above)
475 op->deactivate_recursive (); 431 op->deactivate_recursive ();
476} 432}
477 433
478bool 434bool
479maptile::save_objects (object_freezer &freezer, int flags) 435maptile::_save_objects (object_freezer &f, int flags)
480{ 436{
437 coroapi::cede_to_tick ();
438
481 if (flags & IO_HEADER) 439 if (flags & IO_HEADER)
482 save_header (freezer); 440 _save_header (f);
483 441
484 if (!spaces) 442 if (!spaces)
485 return false; 443 return false;
486 444
487 for (int i = 0; i < size (); ++i) 445 for (int i = 0; i < size (); ++i)
… …
496 continue; 454 continue;
497 455
498 if (unique || op->flag [FLAG_UNIQUE]) 456 if (unique || op->flag [FLAG_UNIQUE])
499 { 457 {
500 if (flags & IO_UNIQUES) 458 if (flags & IO_UNIQUES)
501 save_object (freezer, op, 1); 459 op->write (f);
502 } 460 }
503 else if (flags & IO_OBJECTS) 461 else if (flags & IO_OBJECTS)
504 save_object (freezer, op, 1); 462 op->write (f);
505 } 463 }
506 } 464 }
507 465
466 coroapi::cede_to_tick ();
467
508 return true; 468 return true;
509} 469}
510 470
511bool 471bool
512maptile::load_objects (const char *path, bool skip_header) 472maptile::_load_objects (const char *path, bool skip_header)
513{ 473{
514 object_thawer thawer (path); 474 object_thawer f (path);
515 475
516 if (!thawer) 476 if (!f)
517 return false; 477 return false;
478
479 f.next ();
518 480
519 if (skip_header) 481 if (skip_header)
520 for (;;) 482 for (;;)
521 { 483 {
522 keyword kw = thawer.get_kv (); 484 keyword kw = f.kw;
523 485 f.skip ();
524 if (kw == KW_end) 486 if (kw == KW_end)
525 break; 487 break;
526
527 thawer.skip_kv (kw);
528 } 488 }
529 489
530 return load_objects (thawer); 490 return _load_objects (f);
531} 491}
532 492
533bool 493bool
534maptile::save_objects (const char *path, int flags) 494maptile::_save_objects (const char *path, int flags)
535{ 495{
536 object_freezer freezer; 496 object_freezer freezer;
537 497
538 if (!save_objects (freezer, flags)) 498 if (!_save_objects (freezer, flags))
539 return false; 499 return false;
540 500
541 return freezer.save (path); 501 return freezer.save (path);
542} 502}
543 503
544maptile::maptile () 504maptile::maptile ()
545{ 505{
546 in_memory = MAP_SWAPPED; 506 in_memory = MAP_SWAPPED;
547 507
548 /* The maps used to pick up default x and y values from the 508 /* The maps used to pick up default x and y values from the
549 * map archetype. Mimic that behaviour. 509 * map archetype. Mimic that behaviour.
550 */ 510 */
551 width = 16; 511 width = 16;
552 height = 16; 512 height = 16;
553 reset_timeout = 0;
554 timeout = 300; 513 timeout = 300;
555 enter_x = 0; 514 max_nrof = 1000; // 1000 items of anything
556 enter_y = 0; 515 max_volume = 2000000; // 2m³
557} 516}
558 517
559maptile::maptile (int w, int h) 518maptile::maptile (int w, int h)
560{ 519{
561 in_memory = MAP_SWAPPED; 520 in_memory = MAP_SWAPPED;
… …
707 * This could be done in lex (like the object loader), but I think 666 * This could be done in lex (like the object loader), but I think
708 * currently, there are few enough fields this is not a big deal. 667 * currently, there are few enough fields this is not a big deal.
709 * MSW 2001-07-01 668 * MSW 2001-07-01
710 */ 669 */
711bool 670bool
712maptile::load_header (object_thawer &thawer) 671maptile::_load_header (object_thawer &thawer)
713{ 672{
714 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
715 int msgpos = 0;
716 int maplorepos = 0;
717
718 for (;;) 673 for (;;)
719 { 674 {
720 keyword kw = thawer.get_kv (); 675 thawer.next ();
721 676
722 switch (kw) 677 switch (thawer.kw)
723 { 678 {
724 case KW_EOF:
725 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
726 return false;
727
728 case KW_end:
729 return true;
730
731 case KW_msg: 679 case KW_msg:
732 thawer.get_ml (KW_endmsg, msg); 680 thawer.get_ml (KW_endmsg, msg);
733 break; 681 break;
734 682
735 case KW_lore: // CF+ extension 683 case KW_lore: // CF+ extension
… …
767 case KW_sky: thawer.get (sky); break; 715 case KW_sky: thawer.get (sky); break;
768 716
769 case KW_per_player: thawer.get (per_player); break; 717 case KW_per_player: thawer.get (per_player); break;
770 case KW_per_party: thawer.get (per_party); break; 718 case KW_per_party: thawer.get (per_party); break;
771 719
772 case KW_region: get_region_by_name (thawer.get_str ()); break; 720 case KW_region: default_region = region::find (thawer.get_str ()); break;
773 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 721 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
774 722
775 // old names new names 723 // old names new names
776 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;
777 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;
… …
786 case KW_tile_path_1: thawer.get (tile_path [0]); break; 734 case KW_tile_path_1: thawer.get (tile_path [0]); break;
787 case KW_tile_path_2: thawer.get (tile_path [1]); break; 735 case KW_tile_path_2: thawer.get (tile_path [1]); break;
788 case KW_tile_path_3: thawer.get (tile_path [2]); break; 736 case KW_tile_path_3: thawer.get (tile_path [2]); break;
789 case KW_tile_path_4: thawer.get (tile_path [3]); break; 737 case KW_tile_path_4: thawer.get (tile_path [3]); break;
790 738
739 case KW_end:
740 return true;
741
791 default: 742 default:
792 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;
793 break; 745 break;
794 } 746 }
795 } 747 }
796 748
797 abort (); 749 abort ();
798} 750}
799 751
800bool 752bool
801maptile::load_header (const char *path) 753maptile::_load_header (const char *path)
802{ 754{
803 object_thawer thawer (path); 755 object_thawer thawer (path);
804 756
805 if (!thawer) 757 if (!thawer)
806 return false; 758 return false;
807 759
808 return load_header (thawer); 760 return _load_header (thawer);
809} 761}
810 762
811/****************************************************************************** 763/******************************************************************************
812 * This is the start of unique map handling code 764 * This is the start of unique map handling code
813 *****************************************************************************/ 765 *****************************************************************************/
… …
824 object *above = op->above; 776 object *above = op->above;
825 777
826 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))
827 unique = 1; 779 unique = 1;
828 780
829 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 781 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
830 { 782 {
831 op->destroy_inv (false); 783 op->destroy_inv (false);
832 op->destroy (); 784 op->destroy ();
833 } 785 }
834 786
… …
836 } 788 }
837 } 789 }
838} 790}
839 791
840bool 792bool
841maptile::save_header (object_freezer &freezer) 793maptile::_save_header (object_freezer &freezer)
842{ 794{
843#define MAP_OUT(k) freezer.put (KW_ ## k, k) 795#define MAP_OUT(k) freezer.put (KW_ ## k, k)
844#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 796#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
845 797
846 MAP_OUT2 (arch, "map"); 798 MAP_OUT2 (arch, "map");
… …
850 MAP_OUT (reset_time); 802 MAP_OUT (reset_time);
851 MAP_OUT (reset_timeout); 803 MAP_OUT (reset_timeout);
852 MAP_OUT (fixed_resettime); 804 MAP_OUT (fixed_resettime);
853 MAP_OUT (difficulty); 805 MAP_OUT (difficulty);
854 806
855 if (region) MAP_OUT2 (region, region->name); 807 if (default_region) MAP_OUT2 (region, default_region->name);
856 808
857 if (shopitems) 809 if (shopitems)
858 { 810 {
859 char shop[MAX_BUF]; 811 char shop[MAX_BUF];
860 print_shop_string (this, shop); 812 print_shop_string (this, shop);
… …
895 847
896 return true; 848 return true;
897} 849}
898 850
899bool 851bool
900maptile::save_header (const char *path) 852maptile::_save_header (const char *path)
901{ 853{
902 object_freezer freezer; 854 object_freezer freezer;
903 855
904 if (!save_header (freezer)) 856 if (!_save_header (freezer))
905 return false; 857 return false;
906 858
907 return freezer.save (path); 859 return freezer.save (path);
908} 860}
909 861
… …
911 * Remove and free all objects in the given map. 863 * Remove and free all objects in the given map.
912 */ 864 */
913void 865void
914maptile::clear () 866maptile::clear ()
915{ 867{
868 sfree (regions, size ()), regions = 0;
869 free (regionmap), regionmap = 0;
870
916 if (!spaces) 871 if (spaces)
917 return; 872 {
918
919 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 873 for (mapspace *ms = spaces + size (); ms-- > spaces; )
920 while (object *op = ms->bot) 874 while (object *op = ms->bot)
921 { 875 {
922 if (op->head)
923 op = op->head; 876 op = op->head_ ();
924
925 op->destroy_inv (false); 877 op->destroy_inv (false);
926 op->destroy (); 878 op->destroy ();
927 } 879 }
928 880
929 sfree (spaces, size ()), spaces = 0; 881 sfree (spaces, size ()), spaces = 0;
882 }
930 883
931 if (buttons) 884 if (buttons)
932 free_objectlinkpt (buttons), buttons = 0; 885 free_objectlinkpt (buttons), buttons = 0;
933} 886}
934 887
… …
1088 */ 1041 */
1089void 1042void
1090mapspace::update_ () 1043mapspace::update_ ()
1091{ 1044{
1092 object *tmp, *last = 0; 1045 object *tmp, *last = 0;
1093 uint8 flags = 0, light = 0, anywhere = 0; 1046 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1094 New_Face *top, *floor, *middle;
1095 object *top_obj, *floor_obj, *middle_obj;
1096 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1047 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1097 1048
1098 middle = blank_face; 1049 //object *middle = 0;
1099 top = blank_face; 1050 //object *top = 0;
1100 floor = blank_face; 1051 //object *floor = 0;
1101 1052 // this seems to generate better code than using locals, above
1102 middle_obj = 0; 1053 object *&top = faces_obj[0] = 0;
1103 top_obj = 0; 1054 object *&middle = faces_obj[1] = 0;
1104 floor_obj = 0; 1055 object *&floor = faces_obj[2] = 0;
1105 1056
1106 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1057 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1107 { 1058 {
1108 /* This could be made additive I guess (two lights better than 1059 /* This could be made additive I guess (two lights better than
1109 * one). But if so, it shouldn't be a simple additive - 2 1060 * one). But if so, it shouldn't be a simple additive - 2
… …
1122 * Always put the player down for drawing. 1073 * Always put the player down for drawing.
1123 */ 1074 */
1124 if (!tmp->invisible) 1075 if (!tmp->invisible)
1125 { 1076 {
1126 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1077 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1127 {
1128 top = tmp->face;
1129 top_obj = tmp; 1078 top = tmp;
1130 }
1131 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1079 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1132 { 1080 {
1133 /* If we got a floor, that means middle and top were below it, 1081 /* If we got a floor, that means middle and top were below it,
1134 * so should not be visible, so we clear them. 1082 * so should not be visible, so we clear them.
1135 */ 1083 */
1136 middle = blank_face; 1084 middle = 0;
1137 top = blank_face; 1085 top = 0;
1138 floor = tmp->face;
1139 floor_obj = tmp; 1086 floor = tmp;
1140 } 1087 }
1141 /* Flag anywhere have high priority */ 1088 /* Flag anywhere have high priority */
1142 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1089 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1143 { 1090 {
1144 middle = tmp->face;
1145
1146 middle_obj = tmp; 1091 middle = tmp;
1147 anywhere = 1; 1092 anywhere = 1;
1148 } 1093 }
1149 /* Find the highest visible face around. If equal 1094 /* Find the highest visible face around. If equal
1150 * visibilities, we still want the one nearer to the 1095 * visibilities, we still want the one nearer to the
1151 * top 1096 * top
1152 */ 1097 */
1153 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1098 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1154 {
1155 middle = tmp->face;
1156 middle_obj = tmp; 1099 middle = tmp;
1157 }
1158 } 1100 }
1159 1101
1160 if (tmp == tmp->above) 1102 if (tmp == tmp->above)
1161 { 1103 {
1162 LOG (llevError, "Error in structure of map\n"); 1104 LOG (llevError, "Error in structure of map\n");
… …
1197 * middle face. This should not happen, as we already have the 1139 * middle face. This should not happen, as we already have the
1198 * else statement above so middle should not get set. OTOH, it 1140 * else statement above so middle should not get set. OTOH, it
1199 * may be possible for the faces to match but be different objects. 1141 * may be possible for the faces to match but be different objects.
1200 */ 1142 */
1201 if (top == middle) 1143 if (top == middle)
1202 middle = blank_face; 1144 middle = 0;
1203 1145
1204 /* There are three posibilities at this point: 1146 /* There are three posibilities at this point:
1205 * 1) top face is set, need middle to be set. 1147 * 1) top face is set, need middle to be set.
1206 * 2) middle is set, need to set top. 1148 * 2) middle is set, need to set top.
1207 * 3) neither middle or top is set - need to set both. 1149 * 3) neither middle or top is set - need to set both.
… …
1212 /* Once we get to a floor, stop, since we already have a floor object */ 1154 /* Once we get to a floor, stop, since we already have a floor object */
1213 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1155 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1214 break; 1156 break;
1215 1157
1216 /* If two top faces are already set, quit processing */ 1158 /* If two top faces are already set, quit processing */
1217 if ((top != blank_face) && (middle != blank_face)) 1159 if (top && middle)
1218 break; 1160 break;
1219 1161
1220 /* Only show visible faces, unless its the editor - show all */ 1162 /* Only show visible faces */
1221 if (!tmp->invisible || editor) 1163 if (!tmp->invisible)
1222 { 1164 {
1223 /* Fill in top if needed */ 1165 /* Fill in top if needed */
1224 if (top == blank_face) 1166 if (!top)
1225 { 1167 {
1226 top = tmp->face;
1227 top_obj = tmp; 1168 top = tmp;
1228 if (top == middle) 1169 if (top == middle)
1229 middle = blank_face; 1170 middle = 0;
1230 } 1171 }
1231 else 1172 else
1232 { 1173 {
1233 /* top is already set - we should only get here if 1174 /* top is already set - we should only get here if
1234 * middle is not set 1175 * middle is not set
1235 * 1176 *
1236 * Set the middle face and break out, since there is nothing 1177 * Set the middle face and break out, since there is nothing
1237 * more to fill in. We don't check visiblity here, since 1178 * more to fill in. We don't check visiblity here, since
1238 * 1179 *
1239 */ 1180 */
1240 if (tmp->face != top) 1181 if (tmp != top)
1241 { 1182 {
1242 middle = tmp->face;
1243 middle_obj = tmp; 1183 middle = tmp;
1244 break; 1184 break;
1245 } 1185 }
1246 } 1186 }
1247 } 1187 }
1248 } 1188 }
1249 1189
1250 if (middle == floor) 1190 if (middle == floor)
1251 middle = blank_face; 1191 middle = 0;
1252 1192
1253 if (top == middle) 1193 if (top == middle)
1254 middle = blank_face; 1194 middle = 0;
1255 1195
1256 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1196#if 0
1257 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1197 faces_obj [0] = top;
1258 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1198 faces_obj [1] = middle;
1199 faces_obj [2] = floor;
1200#endif
1259} 1201}
1260 1202
1203uint64
1204mapspace::volume () const
1205{
1206 uint64 vol = 0;
1207
1208 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1209 vol += op->volume ();
1210
1211 return vol;
1212}
1213
1261/* this updates the orig_map->tile_map[tile_num] value after loading 1214/* this updates the orig_map->tile_map[tile_num] value after finding
1262 * the map. It also takes care of linking back the freshly loaded 1215 * the map. It also takes care of linking back the freshly found
1263 * maps tile_map values if it tiles back to this one. It returns 1216 * maps tile_map values if it tiles back to this one. It returns
1264 * the value of orig_map->tile_map[tile_num]. It really only does this 1217 * the value of orig_map->tile_map[tile_num].
1265 * so that it is easier for calling functions to verify success.
1266 */ 1218 */
1267static maptile * 1219static inline maptile *
1268load_and_link_tiled_map (maptile *orig_map, int tile_num) 1220find_and_link (maptile *orig_map, int tile_num)
1269{ 1221{
1222 maptile *mp = orig_map->tile_map [tile_num];
1223
1224 if (!mp)
1225 {
1270 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1226 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1271 1227
1272 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1228 if (!mp)
1273 { 1229 {
1274 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1230 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1275 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1231 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1276 &orig_map->tile_path[tile_num], &orig_map->path); 1232 &orig_map->tile_path[tile_num], &orig_map->path);
1277 mp = new maptile (1, 1); 1233 mp = new maptile (1, 1);
1278 mp->alloc (); 1234 mp->alloc ();
1279 mp->in_memory = MAP_IN_MEMORY; 1235 mp->in_memory = MAP_IN_MEMORY;
1236 }
1280 } 1237 }
1281 1238
1282 int dest_tile = (tile_num + 2) % 4; 1239 int dest_tile = (tile_num + 2) % 4;
1283 1240
1284 orig_map->tile_map[tile_num] = mp; 1241 orig_map->tile_map [tile_num] = mp;
1285 1242
1286 // optimisation: back-link map to origin map if euclidean 1243 // optimisation: back-link map to origin map if euclidean
1287 //TODO: non-euclidean maps MUST GO 1244 //TODO: non-euclidean maps MUST GO
1288 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) 1245 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1289 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 1246 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1290 1247
1291 return mp; 1248 return mp;
1249}
1250
1251static inline void
1252load_and_link (maptile *orig_map, int tile_num)
1253{
1254 find_and_link (orig_map, tile_num)->load_sync ();
1292} 1255}
1293 1256
1294/* this returns TRUE if the coordinates (x,y) are out of 1257/* this returns TRUE if the coordinates (x,y) are out of
1295 * map m. This function also takes into account any 1258 * map m. This function also takes into account any
1296 * tiling considerations, loading adjacant maps as needed. 1259 * tiling considerations, loading adjacant maps as needed.
… …
1313 { 1276 {
1314 if (!m->tile_path[3]) 1277 if (!m->tile_path[3])
1315 return 1; 1278 return 1;
1316 1279
1317 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1280 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1318 load_and_link_tiled_map (m, 3); 1281 find_and_link (m, 3);
1319 1282
1320 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1283 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1321 } 1284 }
1322 1285
1323 if (x >= m->width) 1286 if (x >= m->width)
1324 { 1287 {
1325 if (!m->tile_path[1]) 1288 if (!m->tile_path[1])
1326 return 1; 1289 return 1;
1327 1290
1328 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1291 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1329 load_and_link_tiled_map (m, 1); 1292 find_and_link (m, 1);
1330 1293
1331 return out_of_map (m->tile_map[1], x - m->width, y); 1294 return out_of_map (m->tile_map[1], x - m->width, y);
1332 } 1295 }
1333 1296
1334 if (y < 0) 1297 if (y < 0)
1335 { 1298 {
1336 if (!m->tile_path[0]) 1299 if (!m->tile_path[0])
1337 return 1; 1300 return 1;
1338 1301
1339 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1302 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1340 load_and_link_tiled_map (m, 0); 1303 find_and_link (m, 0);
1341 1304
1342 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1305 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1343 } 1306 }
1344 1307
1345 if (y >= m->height) 1308 if (y >= m->height)
1346 { 1309 {
1347 if (!m->tile_path[2]) 1310 if (!m->tile_path[2])
1348 return 1; 1311 return 1;
1349 1312
1350 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1313 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1351 load_and_link_tiled_map (m, 2); 1314 find_and_link (m, 2);
1352 1315
1353 return out_of_map (m->tile_map[2], x, y - m->height); 1316 return out_of_map (m->tile_map[2], x, y - m->height);
1354 } 1317 }
1355 1318
1356 /* Simple case - coordinates are within this local 1319 /* Simple case - coordinates are within this local
… …
1361 1324
1362/* This is basically the same as out_of_map above, but 1325/* This is basically the same as out_of_map above, but
1363 * instead we return NULL if no map is valid (coordinates 1326 * instead we return NULL if no map is valid (coordinates
1364 * out of bounds and no tiled map), otherwise it returns 1327 * out of bounds and no tiled map), otherwise it returns
1365 * the map as that the coordinates are really on, and 1328 * the map as that the coordinates are really on, and
1366 * updates x and y to be the localized coordinates. 1329 * updates x and y to be the localised coordinates.
1367 * Using this is more efficient of calling out_of_map 1330 * Using this is more efficient of calling out_of_map
1368 * and then figuring out what the real map is 1331 * and then figuring out what the real map is
1369 */ 1332 */
1370maptile * 1333maptile *
1371get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1334maptile::xy_find (sint16 &x, sint16 &y)
1372{ 1335{
1373 if (*x < 0) 1336 if (x < 0)
1374 { 1337 {
1375 if (!m->tile_path[3]) 1338 if (!tile_path[3])
1376 return 0; 1339 return 0;
1377 1340
1378 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1341 find_and_link (this, 3);
1379 load_and_link_tiled_map (m, 3);
1380
1381 *x += m->tile_map[3]->width; 1342 x += tile_map[3]->width;
1382 return (get_map_from_coord (m->tile_map[3], x, y)); 1343 return tile_map[3]->xy_find (x, y);
1383 } 1344 }
1384 1345
1385 if (*x >= m->width) 1346 if (x >= width)
1386 { 1347 {
1387 if (!m->tile_path[1]) 1348 if (!tile_path[1])
1388 return 0; 1349 return 0;
1389 1350
1390 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1351 find_and_link (this, 1);
1391 load_and_link_tiled_map (m, 1);
1392
1393 *x -= m->width; 1352 x -= width;
1394 return (get_map_from_coord (m->tile_map[1], x, y)); 1353 return tile_map[1]->xy_find (x, y);
1395 } 1354 }
1396 1355
1397 if (*y < 0) 1356 if (y < 0)
1398 { 1357 {
1399 if (!m->tile_path[0]) 1358 if (!tile_path[0])
1400 return 0; 1359 return 0;
1401 1360
1402 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1361 find_and_link (this, 0);
1403 load_and_link_tiled_map (m, 0);
1404
1405 *y += m->tile_map[0]->height; 1362 y += tile_map[0]->height;
1406 return (get_map_from_coord (m->tile_map[0], x, y)); 1363 return tile_map[0]->xy_find (x, y);
1407 } 1364 }
1408 1365
1409 if (*y >= m->height) 1366 if (y >= height)
1410 { 1367 {
1411 if (!m->tile_path[2]) 1368 if (!tile_path[2])
1412 return 0; 1369 return 0;
1413 1370
1414 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1371 find_and_link (this, 2);
1415 load_and_link_tiled_map (m, 2);
1416
1417 *y -= m->height; 1372 y -= height;
1418 return (get_map_from_coord (m->tile_map[2], x, y)); 1373 return tile_map[2]->xy_find (x, y);
1419 } 1374 }
1420 1375
1421 /* Simple case - coordinates are within this local 1376 /* Simple case - coordinates are within this local
1422 * map. 1377 * map.
1423 */ 1378 */
1424 return m; 1379 return this;
1425} 1380}
1426 1381
1427/** 1382/**
1428 * Return whether map2 is adjacent to map1. If so, store the distance from 1383 * Return whether map2 is adjacent to map1. If so, store the distance from
1429 * map1 to map2 in dx/dy. 1384 * map1 to map2 in dx/dy.
1430 */ 1385 */
1431static int 1386int
1432adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1387adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1433{ 1388{
1434 if (!map1 || !map2) 1389 if (!map1 || !map2)
1435 return 0; 1390 return 0;
1436 1391
1392 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded
1393 //fix: compare paths instead (this is likely faster, too!)
1437 if (map1 == map2) 1394 if (map1 == map2)
1438 { 1395 {
1439 *dx = 0; 1396 *dx = 0;
1440 *dy = 0; 1397 *dy = 0;
1441 } 1398 }
… …
1501 } 1458 }
1502 else 1459 else
1503 return 0; 1460 return 0;
1504 1461
1505 return 1; 1462 return 1;
1463}
1464
1465maptile *
1466maptile::xy_load (sint16 &x, sint16 &y)
1467{
1468 maptile *map = xy_find (x, y);
1469
1470 if (map)
1471 map->load_sync ();
1472
1473 return map;
1474}
1475
1476maptile *
1477get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1478{
1479 return m->xy_load (*x, *y);
1506} 1480}
1507 1481
1508/* From map.c 1482/* From map.c
1509 * This is used by get_player to determine where the other 1483 * This is used by get_player to determine where the other
1510 * creature is. get_rangevector takes into account map tiling, 1484 * creature is. get_rangevector takes into account map tiling,
1511 * so you just can not look the the map coordinates and get the 1485 * so you just can not look the the map coordinates and get the
1512 * righte value. distance_x/y are distance away, which 1486 * righte value. distance_x/y are distance away, which
1513 * can be negativbe. direction is the crossfire direction scheme 1487 * can be negative. direction is the crossfire direction scheme
1514 * that the creature should head. part is the part of the 1488 * that the creature should head. part is the part of the
1515 * monster that is closest. 1489 * monster that is closest.
1516 * 1490 *
1517 * get_rangevector looks at op1 and op2, and fills in the 1491 * get_rangevector looks at op1 and op2, and fills in the
1518 * structure for op1 to get to op2. 1492 * structure for op1 to get to op2.
… …
1529get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1503get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1530{ 1504{
1531 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1505 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1532 { 1506 {
1533 /* be conservative and fill in _some_ data */ 1507 /* be conservative and fill in _some_ data */
1534 retval->distance = 100000; 1508 retval->distance = 10000;
1535 retval->distance_x = 32767; 1509 retval->distance_x = 10000;
1536 retval->distance_y = 32767; 1510 retval->distance_y = 10000;
1537 retval->direction = 0; 1511 retval->direction = 0;
1538 retval->part = 0; 1512 retval->part = 0;
1539 } 1513 }
1540 else 1514 else
1541 { 1515 {
… …
1546 1520
1547 best = op1; 1521 best = op1;
1548 /* If this is multipart, find the closest part now */ 1522 /* If this is multipart, find the closest part now */
1549 if (!(flags & 0x1) && op1->more) 1523 if (!(flags & 0x1) && op1->more)
1550 { 1524 {
1551 object *tmp;
1552 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1525 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1553 1526
1554 /* we just take the offset of the piece to head to figure 1527 /* we just take the offset of the piece to head to figure
1555 * distance instead of doing all that work above again 1528 * distance instead of doing all that work above again
1556 * since the distance fields we set above are positive in the 1529 * since the distance fields we set above are positive in the
1557 * same axis as is used for multipart objects, the simply arithmetic 1530 * same axis as is used for multipart objects, the simply arithmetic
1558 * below works. 1531 * below works.
1559 */ 1532 */
1560 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1533 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1561 { 1534 {
1562 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1535 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1563 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1536 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1564 if (tmpi < best_distance) 1537 if (tmpi < best_distance)
1565 { 1538 {
1566 best_distance = tmpi; 1539 best_distance = tmpi;
1567 best = tmp; 1540 best = tmp;
1568 } 1541 }
1569 } 1542 }
1543
1570 if (best != op1) 1544 if (best != op1)
1571 { 1545 {
1572 retval->distance_x += op1->x - best->x; 1546 retval->distance_x += op1->x - best->x;
1573 retval->distance_y += op1->y - best->y; 1547 retval->distance_y += op1->y - best->y;
1574 } 1548 }
1575 } 1549 }
1550
1576 retval->part = best; 1551 retval->part = best;
1577 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1552 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1578 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1553 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1579 } 1554 }
1580} 1555}
1581 1556
1582/* this is basically the same as get_rangevector above, but instead of 1557/* this is basically the same as get_rangevector above, but instead of
… …
1587 * flags has no meaning for this function at this time - I kept it in to 1562 * flags has no meaning for this function at this time - I kept it in to
1588 * be more consistant with the above function and also in case they are needed 1563 * be more consistant with the above function and also in case they are needed
1589 * for something in the future. Also, since no object is pasted, the best 1564 * for something in the future. Also, since no object is pasted, the best
1590 * field of the rv_vector is set to NULL. 1565 * field of the rv_vector is set to NULL.
1591 */ 1566 */
1592
1593void 1567void
1594get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1568get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1595{ 1569{
1596 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1570 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1597 { 1571 {
1598 /* be conservative and fill in _some_ data */ 1572 /* be conservative and fill in _some_ data */
1599 retval->distance = 100000; 1573 retval->distance = 100000;
… …
1606 { 1580 {
1607 retval->distance_x += op2->x - x; 1581 retval->distance_x += op2->x - x;
1608 retval->distance_y += op2->y - y; 1582 retval->distance_y += op2->y - y;
1609 1583
1610 retval->part = NULL; 1584 retval->part = NULL;
1611 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1585 retval->distance = idistance (retval->distance_x, retval->distance_y);
1612 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1586 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1613 } 1587 }
1614} 1588}
1615 1589
1616/* Returns true of op1 and op2 are effectively on the same map 1590/* Returns true of op1 and op2 are effectively on the same map
… …
1636 op->remove (); 1610 op->remove ();
1637 1611
1638 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1612 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1639} 1613}
1640 1614
1615region *
1616maptile::region (int x, int y) const
1617{
1618 if (regions
1619 && regionmap
1620 && !OUT_OF_REAL_MAP (this, x, y))
1621 if (struct region *reg = regionmap [regions [y * width + x]])
1622 return reg;
1623
1624 if (default_region)
1625 return default_region;
1626
1627 return ::region::default_region ();
1628}
1629
1630/* picks a random object from a style map.
1631 * Redone by MSW so it should be faster and not use static
1632 * variables to generate tables.
1633 */
1634object *
1635maptile::pick_random_object () const
1636{
1637 /* while returning a null object will result in a crash, that
1638 * is actually preferable to an infinite loop. That is because
1639 * most servers will automatically restart in case of crash.
1640 * Change the logic on getting the random space - shouldn't make
1641 * any difference, but this seems clearer to me.
1642 */
1643 for (int i = 1000; --i;)
1644 {
1645 object *pick = at (rndm (width), rndm (height)).bot;
1646
1647 // do not prefer big monsters just because they are big.
1648 if (pick && pick->head_ () == pick)
1649 return pick->head_ ();
1650 }
1651
1652 // instead of crashing in the unlikely(?) case, try to return *something*
1653 return get_archetype ("blocked");
1654}
1655

Diff Legend

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