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.61 by root, Sun Dec 31 17:17:22 2006 UTC vs.
Revision 1.88 by root, Fri Feb 16 19:43:40 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program 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 2 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, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, 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 at <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.
… …
36 * it really should be called create_mapname 38 * it really should be called create_mapname
37 */ 39 */
38const char * 40const char *
39create_pathname (const char *name) 41create_pathname (const char *name)
40{ 42{
41 static char buf[MAX_BUF]; 43 static char buf[8192];
42
43 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
44 * someplace else in the code? msw 2-17-97
45 */
46 if (*name == '/')
47 sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
48 else
49 sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name); 44 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
50 return (buf); 45 return buf;
51}
52
53/*
54 * same as create_pathname, but for the overlay maps.
55 */
56const char *
57create_overlay_pathname (const char *name)
58{
59 static char buf[MAX_BUF];
60
61 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
62 * someplace else in the code? msw 2-17-97
63 */
64 if (*name == '/')
65 sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
66 else
67 sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
68 return (buf);
69}
70
71/*
72 * same as create_pathname, but for the template maps.
73 */
74const char *
75create_template_pathname (const char *name)
76{
77 static char buf[MAX_BUF];
78
79 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
80 * someplace else in the code? msw 2-17-97
81 */
82 if (*name == '/')
83 sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
84 else
85 sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
86 return (buf);
87}
88
89/*
90 * This makes absolute path to the itemfile where unique objects
91 * will be saved. Converts '/' to '@'. I think it's essier maintain
92 * files than full directory structure, but if this is problem it can
93 * be changed.
94 */
95static const char *
96create_items_path (const char *s)
97{
98 static char buf[MAX_BUF];
99 char *t;
100
101 if (*s == '/')
102 s++;
103
104 sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
105
106 for (t = buf + strlen (buf); *s; s++, t++)
107 if (*s == '/')
108 *t = '@';
109 else
110 *t = *s;
111 *t = 0;
112 return (buf);
113} 46}
114 47
115/* 48/*
116 * This function checks if a file with the given path exists. 49 * This function checks if a file with the given path exists.
117 * -1 is returned if it fails, otherwise the mode of the file 50 * -1 is returned if it fails, otherwise the mode of the file
… …
135 char *endbuf; 68 char *endbuf;
136 struct stat statbuf; 69 struct stat statbuf;
137 int mode = 0; 70 int mode = 0;
138 71
139 if (prepend_dir) 72 if (prepend_dir)
140 strcpy (buf, create_pathname (name)); 73 assign (buf, create_pathname (name));
141 else 74 else
142 strcpy (buf, name); 75 assign (buf, name);
143 76
144 /* old method (strchr(buf, '\0')) seemd very odd to me - 77 /* old method (strchr(buf, '\0')) seemd very odd to me -
145 * this method should be equivalant and is clearer. 78 * this method should be equivalant and is clearer.
146 * Can not use strcat because we need to cycle through 79 * Can not use strcat because we need to cycle through
147 * all the names. 80 * all the names.
… …
296 229
297 } 230 }
298 return 0; 231 return 0;
299} 232}
300 233
301
302/* 234/*
303 * Returns true if the given object can't fit in the given spot. 235 * Returns true if the given object can't fit in the given spot.
304 * This is meant for multi space objects - for single space objecs, 236 * This is meant for multi space objects - for single space objecs,
305 * just calling get_map_blocked and checking that against movement type 237 * just calling get_map_blocked and checking that against movement type
306 * of object. This function goes through all the parts of the 238 * of object. This function goes through all the parts of the
… …
398 * carrying. 330 * carrying.
399 */ 331 */
400 sum_weight (container); 332 sum_weight (container);
401} 333}
402 334
335void
336maptile::set_object_flag (int flag, int value)
337{
338 if (!spaces)
339 return;
340
341 for (mapspace *ms = spaces + size (); ms-- > spaces; )
342 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343 tmp->flag [flag] = value;
344}
345
403/* link_multipart_objects go through all the objects on the map looking 346/* link_multipart_objects go through all the objects on the map looking
404 * for objects whose arch says they are multipart yet according to the 347 * for objects whose arch says they are multipart yet according to the
405 * info we have, they only have the head (as would be expected when 348 * info we have, they only have the head (as would be expected when
406 * they are saved). We do have to look for the old maps that did save 349 * they are saved). We do have to look for the old maps that did save
407 * the more sections and not re-add sections for them. 350 * the more sections and not re-add sections for them.
… …
454} 397}
455 398
456/* 399/*
457 * Loads (ands parses) the objects into a given map from the specified 400 * Loads (ands parses) the objects into a given map from the specified
458 * file pointer. 401 * file pointer.
459 * mapflags is the same as we get with load_original_map
460 */ 402 */
461bool 403bool
462maptile::load_objects (object_thawer &thawer) 404maptile::_load_objects (object_thawer &f)
463{ 405{
464 int unique; 406 for (;;)
465 object *op, *prev = NULL, *last_more = NULL, *otmp;
466
467 op = object::create ();
468 op->map = this; /* To handle buttons correctly */
469
470 while (int i = load_object (thawer, op, 0))
471 { 407 {
472 /* if the archetype for the object is null, means that we 408 coroapi::cede_every (1000); // cede once in a while
473 * got an invalid object. Don't do anything with it - the game 409
474 * or editor will not be able to do anything with it either. 410 switch (f.kw)
475 */
476 if (op->arch == NULL)
477 { 411 {
478 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 412 case KW_arch:
479 continue; 413 if (object *op = object::read (f))
480 }
481
482 switch (i)
483 { 414 {
484 case LL_NORMAL: 415 if (op->inv)
416 sum_weight (op);
417
485 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 418 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
419 }
486 420
487 if (op->inv) 421 continue;
488 sum_weight (op);
489 422
490 prev = op, last_more = op;
491 break;
492
493 case LL_MORE: 423 case KW_EOF:
494 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 424 return true;
495 op->head = prev, last_more->more = op, last_more = op; 425
426 default:
427 if (!f.parse_error ("map file"))
428 return false;
496 break; 429 break;
497 } 430 }
498 431
499 op = object::create (); 432 f.next ();
500 op->map = this;
501 }
502
503 op->destroy ();
504
505#if 0
506 for (i = 0; i < width; i++)
507 for (j = 0; j < height; j++)
508 {
509 unique = 0;
510 /* check for unique items, or unique squares */
511 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
512 {
513 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
514 unique = 1;
515
516 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
517 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
518 }
519 } 433 }
520#endif
521 434
522 return true; 435 return true;
523} 436}
524 437
525void 438void
… …
543 for (object *op = ms->bot; op; op = op->above) 456 for (object *op = ms->bot; op; op = op->above)
544 op->deactivate_recursive (); 457 op->deactivate_recursive ();
545} 458}
546 459
547bool 460bool
548maptile::save_objects (object_freezer &freezer, int flags) 461maptile::_save_objects (object_freezer &f, int flags)
549{ 462{
463 static int cede_count = 0;
464
550 if (flags & IO_HEADER) 465 if (flags & IO_HEADER)
551 save_header (freezer); 466 _save_header (f);
552 467
553 if (!spaces) 468 if (!spaces)
554 return false; 469 return false;
555 470
556 for (int i = 0; i < size (); ++i) 471 for (int i = 0; i < size (); ++i)
557 { 472 {
473#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
474 if (cede_count >= 500)
475 {
476 cede_count = 0;
477 coroapi::cede ();
478 }
479#endif
480
558 int unique = 0; 481 int unique = 0;
559 for (object *op = spaces [i].bot; op; op = op->above) 482 for (object *op = spaces [i].bot; op; op = op->above)
560 { 483 {
484 // count per-object, but cede only when modification-safe
485 cede_count++;
486
561 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 487 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
562 unique = 1; 488 unique = 1;
563 489
564 if (!op->can_map_save ()) 490 if (!op->can_map_save ())
565 continue; 491 continue;
566 492
567 if (unique || op->flag [FLAG_UNIQUE]) 493 if (unique || op->flag [FLAG_UNIQUE])
568 { 494 {
569 if (flags & IO_UNIQUES) 495 if (flags & IO_UNIQUES)
570 save_object (freezer, op, 1); 496 op->write (f);
571 } 497 }
572 else if (flags & IO_OBJECTS) 498 else if (flags & IO_OBJECTS)
573 save_object (freezer, op, 1); 499 op->write (f);
574 } 500 }
575 } 501 }
576 502
577 return true; 503 return true;
578} 504}
579 505
580bool 506bool
581maptile::load_objects (const char *path, bool skip_header) 507maptile::_load_objects (const char *path, bool skip_header)
582{ 508{
583 object_thawer thawer (path); 509 object_thawer f (path);
584 510
585 if (!thawer) 511 if (!f)
586 return false; 512 return false;
513
514 f.next ();
587 515
588 if (skip_header) 516 if (skip_header)
589 for (;;) 517 for (;;)
590 { 518 {
591 keyword kw = thawer.get_kv (); 519 keyword kw = f.kw;
592 520 f.skip ();
593 if (kw == KW_end) 521 if (kw == KW_end)
594 break; 522 break;
595
596 thawer.skip_kv (kw);
597 } 523 }
598 524
599 return load_objects (thawer); 525 return _load_objects (f);
600} 526}
601 527
602bool 528bool
603maptile::save_objects (const char *path, int flags) 529maptile::_save_objects (const char *path, int flags)
604{ 530{
605 object_freezer freezer; 531 object_freezer freezer;
606 532
607 if (!save_objects (freezer, flags)) 533 if (!_save_objects (freezer, flags))
608 return false; 534 return false;
609 535
610 return freezer.save (path); 536 return freezer.save (path);
611} 537}
612 538
613maptile::maptile () 539maptile::maptile ()
614{ 540{
615 in_memory = MAP_SWAPPED; 541 in_memory = MAP_SWAPPED;
616 542
617 /* The maps used to pick up default x and y values from the 543 /* The maps used to pick up default x and y values from the
618 * map archetype. Mimic that behaviour. 544 * map archetype. Mimic that behaviour.
619 */ 545 */
620 width = 16; 546 width = 16;
621 height = 16; 547 height = 16;
622 reset_timeout = 0;
623 timeout = 300; 548 timeout = 300;
624 enter_x = 0; 549 max_nrof = 1000; // 1000 items of anything
625 enter_y = 0; 550 max_volume = 2000000; // 2m³
626} 551}
627 552
628maptile::maptile (int w, int h) 553maptile::maptile (int w, int h)
629{ 554{
630 in_memory = MAP_SWAPPED; 555 in_memory = MAP_SWAPPED;
… …
776 * This could be done in lex (like the object loader), but I think 701 * This could be done in lex (like the object loader), but I think
777 * currently, there are few enough fields this is not a big deal. 702 * currently, there are few enough fields this is not a big deal.
778 * MSW 2001-07-01 703 * MSW 2001-07-01
779 */ 704 */
780bool 705bool
781maptile::load_header (object_thawer &thawer) 706maptile::_load_header (object_thawer &thawer)
782{ 707{
783 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
784 int msgpos = 0;
785 int maplorepos = 0;
786
787 for (;;) 708 for (;;)
788 { 709 {
789 keyword kw = thawer.get_kv (); 710 keyword kw = thawer.get_kv ();
790 711
791 switch (kw) 712 switch (kw)
792 { 713 {
793 case KW_EOF:
794 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
795 return false;
796
797 case KW_end:
798 return true;
799
800 case KW_msg: 714 case KW_msg:
801 thawer.get_ml (KW_endmsg, msg); 715 thawer.get_ml (KW_endmsg, msg);
802 break; 716 break;
803 717
804 case KW_lore: // CF+ extension 718 case KW_lore: // CF+ extension
… …
836 case KW_sky: thawer.get (sky); break; 750 case KW_sky: thawer.get (sky); break;
837 751
838 case KW_per_player: thawer.get (per_player); break; 752 case KW_per_player: thawer.get (per_player); break;
839 case KW_per_party: thawer.get (per_party); break; 753 case KW_per_party: thawer.get (per_party); break;
840 754
841 case KW_region: get_region_by_name (thawer.get_str ()); break; 755 case KW_region: default_region = region::find (thawer.get_str ()); break;
842 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 756 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
843 757
844 // old names new names 758 // old names new names
845 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 759 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
846 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 760 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
855 case KW_tile_path_1: thawer.get (tile_path [0]); break; 769 case KW_tile_path_1: thawer.get (tile_path [0]); break;
856 case KW_tile_path_2: thawer.get (tile_path [1]); break; 770 case KW_tile_path_2: thawer.get (tile_path [1]); break;
857 case KW_tile_path_3: thawer.get (tile_path [2]); break; 771 case KW_tile_path_3: thawer.get (tile_path [2]); break;
858 case KW_tile_path_4: thawer.get (tile_path [3]); break; 772 case KW_tile_path_4: thawer.get (tile_path [3]); break;
859 773
774 case KW_end:
775 return true;
776
860 default: 777 default:
861 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); 778 if (!thawer.parse_error ("map", 0))
779 return false;
862 break; 780 break;
863 } 781 }
864 } 782 }
865 783
866 abort (); 784 abort ();
867} 785}
868 786
869bool 787bool
870maptile::load_header (const char *path) 788maptile::_load_header (const char *path)
871{ 789{
872 object_thawer thawer (path); 790 object_thawer thawer (path);
873 791
874 if (!thawer) 792 if (!thawer)
875 return false; 793 return false;
876 794
877 return load_header (thawer); 795 return _load_header (thawer);
878} 796}
879 797
880/****************************************************************************** 798/******************************************************************************
881 * This is the start of unique map handling code 799 * This is the start of unique map handling code
882 *****************************************************************************/ 800 *****************************************************************************/
… …
905 } 823 }
906 } 824 }
907} 825}
908 826
909bool 827bool
910maptile::save_header (object_freezer &freezer) 828maptile::_save_header (object_freezer &freezer)
911{ 829{
912#define MAP_OUT(k) freezer.put (KW_ ## k, k) 830#define MAP_OUT(k) freezer.put (KW_ ## k, k)
913#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 831#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
914 832
915 MAP_OUT2 (arch, "map"); 833 MAP_OUT2 (arch, "map");
… …
919 MAP_OUT (reset_time); 837 MAP_OUT (reset_time);
920 MAP_OUT (reset_timeout); 838 MAP_OUT (reset_timeout);
921 MAP_OUT (fixed_resettime); 839 MAP_OUT (fixed_resettime);
922 MAP_OUT (difficulty); 840 MAP_OUT (difficulty);
923 841
924 if (region) MAP_OUT2 (region, region->name); 842 if (default_region) MAP_OUT2 (region, default_region->name);
925 843
926 if (shopitems) 844 if (shopitems)
927 { 845 {
928 char shop[MAX_BUF]; 846 char shop[MAX_BUF];
929 print_shop_string (this, shop); 847 print_shop_string (this, shop);
… …
957 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 875 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
958 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 876 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
959 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 877 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
960 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 878 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
961 879
880 freezer.put (this);
962 freezer.put (KW_end); 881 freezer.put (KW_end);
963 882
964 return true; 883 return true;
965} 884}
966 885
967bool 886bool
968maptile::save_header (const char *path) 887maptile::_save_header (const char *path)
969{ 888{
970 object_freezer freezer; 889 object_freezer freezer;
971 890
972 if (!save_header (freezer)) 891 if (!_save_header (freezer))
973 return false; 892 return false;
974 893
975 return freezer.save (path); 894 return freezer.save (path);
976} 895}
977 896
… …
979 * Remove and free all objects in the given map. 898 * Remove and free all objects in the given map.
980 */ 899 */
981void 900void
982maptile::clear () 901maptile::clear ()
983{ 902{
903 sfree (regions, size ()), regions = 0;
904 free (regionmap), regionmap = 0;
905
984 if (!spaces) 906 if (spaces)
985 return; 907 {
986
987 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 908 for (mapspace *ms = spaces + size (); ms-- > spaces; )
988 while (object *op = ms->bot) 909 while (object *op = ms->bot)
989 { 910 {
990 if (op->head) 911 if (op->head)
991 op = op->head; 912 op = op->head;
992 913
993 op->destroy_inv (false); 914 op->destroy_inv (false);
994 op->destroy (); 915 op->destroy ();
995 } 916 }
996 917
997 sfree (spaces, size ()), spaces = 0; 918 sfree (spaces, size ()), spaces = 0;
919 }
998 920
999 if (buttons) 921 if (buttons)
1000 free_objectlinkpt (buttons), buttons = 0; 922 free_objectlinkpt (buttons), buttons = 0;
1001} 923}
1002 924
… …
1156 */ 1078 */
1157void 1079void
1158mapspace::update_ () 1080mapspace::update_ ()
1159{ 1081{
1160 object *tmp, *last = 0; 1082 object *tmp, *last = 0;
1161 uint8 flags = 0, light = 0, anywhere = 0; 1083 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1162 New_Face *top, *floor, *middle; 1084 facetile *top, *floor, *middle;
1163 object *top_obj, *floor_obj, *middle_obj; 1085 object *top_obj, *floor_obj, *middle_obj;
1164 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1086 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1165 1087
1166 middle = blank_face; 1088 middle = blank_face;
1167 top = blank_face; 1089 top = blank_face;
… …
1283 1205
1284 /* If two top faces are already set, quit processing */ 1206 /* If two top faces are already set, quit processing */
1285 if ((top != blank_face) && (middle != blank_face)) 1207 if ((top != blank_face) && (middle != blank_face))
1286 break; 1208 break;
1287 1209
1288 /* Only show visible faces, unless its the editor - show all */ 1210 /* Only show visible faces */
1289 if (!tmp->invisible || editor) 1211 if (!tmp->invisible)
1290 { 1212 {
1291 /* Fill in top if needed */ 1213 /* Fill in top if needed */
1292 if (top == blank_face) 1214 if (top == blank_face)
1293 { 1215 {
1294 top = tmp->face; 1216 top = tmp->face;
… …
1324 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1246 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1325 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1247 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1326 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1248 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1327} 1249}
1328 1250
1251uint64
1252mapspace::volume () const
1253{
1254 uint64 vol = 0;
1255
1256 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1257 vol += op->volume ();
1258
1259 return vol;
1260}
1261
1329/* this updates the orig_map->tile_map[tile_num] value after loading 1262/* this updates the orig_map->tile_map[tile_num] value after finding
1330 * the map. It also takes care of linking back the freshly loaded 1263 * the map. It also takes care of linking back the freshly found
1331 * maps tile_map values if it tiles back to this one. It returns 1264 * maps tile_map values if it tiles back to this one. It returns
1332 * the value of orig_map->tile_map[tile_num]. It really only does this 1265 * the value of orig_map->tile_map[tile_num].
1333 * so that it is easier for calling functions to verify success.
1334 */ 1266 */
1335static maptile * 1267static inline maptile *
1336load_and_link_tiled_map (maptile *orig_map, int tile_num) 1268find_and_link (maptile *orig_map, int tile_num)
1337{ 1269{
1270 maptile *mp = orig_map->tile_map [tile_num];
1271
1272 if (!mp)
1273 {
1338 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1274 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1339 1275
1340 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1276 if (!mp)
1341 { 1277 {
1342 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1278 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1343 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1279 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1344 &orig_map->tile_path[tile_num], &orig_map->path); 1280 &orig_map->tile_path[tile_num], &orig_map->path);
1345 mp = new maptile (1, 1); 1281 mp = new maptile (1, 1);
1346 mp->alloc (); 1282 mp->alloc ();
1347 mp->in_memory = MAP_IN_MEMORY; 1283 mp->in_memory = MAP_IN_MEMORY;
1284 }
1348 } 1285 }
1349 1286
1350 int dest_tile = (tile_num + 2) % 4; 1287 int dest_tile = (tile_num + 2) % 4;
1351 1288
1352 orig_map->tile_map[tile_num] = mp; 1289 orig_map->tile_map [tile_num] = mp;
1353 1290
1354 // optimisation: back-link map to origin map if euclidean 1291 // optimisation: back-link map to origin map if euclidean
1355 //TODO: non-euclidean maps MUST GO 1292 //TODO: non-euclidean maps MUST GO
1356 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) 1293 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1357 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 1294 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1358 1295
1359 return mp; 1296 return mp;
1297}
1298
1299static inline void
1300load_and_link (maptile *orig_map, int tile_num)
1301{
1302 find_and_link (orig_map, tile_num)->load_sync ();
1360} 1303}
1361 1304
1362/* this returns TRUE if the coordinates (x,y) are out of 1305/* this returns TRUE if the coordinates (x,y) are out of
1363 * map m. This function also takes into account any 1306 * map m. This function also takes into account any
1364 * tiling considerations, loading adjacant maps as needed. 1307 * tiling considerations, loading adjacant maps as needed.
… …
1381 { 1324 {
1382 if (!m->tile_path[3]) 1325 if (!m->tile_path[3])
1383 return 1; 1326 return 1;
1384 1327
1385 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1328 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1386 load_and_link_tiled_map (m, 3); 1329 find_and_link (m, 3);
1387 1330
1388 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1331 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1389 } 1332 }
1390 1333
1391 if (x >= m->width) 1334 if (x >= m->width)
1392 { 1335 {
1393 if (!m->tile_path[1]) 1336 if (!m->tile_path[1])
1394 return 1; 1337 return 1;
1395 1338
1396 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1339 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1397 load_and_link_tiled_map (m, 1); 1340 find_and_link (m, 1);
1398 1341
1399 return out_of_map (m->tile_map[1], x - m->width, y); 1342 return out_of_map (m->tile_map[1], x - m->width, y);
1400 } 1343 }
1401 1344
1402 if (y < 0) 1345 if (y < 0)
1403 { 1346 {
1404 if (!m->tile_path[0]) 1347 if (!m->tile_path[0])
1405 return 1; 1348 return 1;
1406 1349
1407 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1350 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1408 load_and_link_tiled_map (m, 0); 1351 find_and_link (m, 0);
1409 1352
1410 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1353 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1411 } 1354 }
1412 1355
1413 if (y >= m->height) 1356 if (y >= m->height)
1414 { 1357 {
1415 if (!m->tile_path[2]) 1358 if (!m->tile_path[2])
1416 return 1; 1359 return 1;
1417 1360
1418 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1361 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1419 load_and_link_tiled_map (m, 2); 1362 find_and_link (m, 2);
1420 1363
1421 return out_of_map (m->tile_map[2], x, y - m->height); 1364 return out_of_map (m->tile_map[2], x, y - m->height);
1422 } 1365 }
1423 1366
1424 /* Simple case - coordinates are within this local 1367 /* Simple case - coordinates are within this local
… …
1429 1372
1430/* This is basically the same as out_of_map above, but 1373/* This is basically the same as out_of_map above, but
1431 * instead we return NULL if no map is valid (coordinates 1374 * instead we return NULL if no map is valid (coordinates
1432 * out of bounds and no tiled map), otherwise it returns 1375 * out of bounds and no tiled map), otherwise it returns
1433 * the map as that the coordinates are really on, and 1376 * the map as that the coordinates are really on, and
1434 * updates x and y to be the localized coordinates. 1377 * updates x and y to be the localised coordinates.
1435 * Using this is more efficient of calling out_of_map 1378 * Using this is more efficient of calling out_of_map
1436 * and then figuring out what the real map is 1379 * and then figuring out what the real map is
1437 */ 1380 */
1438maptile * 1381maptile *
1439get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1382maptile::xy_find (sint16 &x, sint16 &y)
1440{ 1383{
1441 if (*x < 0) 1384 if (x < 0)
1442 { 1385 {
1443 if (!m->tile_path[3]) 1386 if (!tile_path[3])
1444 return 0; 1387 return 0;
1445 1388
1446 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1389 find_and_link (this, 3);
1447 load_and_link_tiled_map (m, 3);
1448
1449 *x += m->tile_map[3]->width; 1390 x += tile_map[3]->width;
1450 return (get_map_from_coord (m->tile_map[3], x, y)); 1391 return tile_map[3]->xy_find (x, y);
1451 } 1392 }
1452 1393
1453 if (*x >= m->width) 1394 if (x >= width)
1454 { 1395 {
1455 if (!m->tile_path[1]) 1396 if (!tile_path[1])
1456 return 0; 1397 return 0;
1457 1398
1458 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1399 find_and_link (this, 1);
1459 load_and_link_tiled_map (m, 1);
1460
1461 *x -= m->width; 1400 x -= width;
1462 return (get_map_from_coord (m->tile_map[1], x, y)); 1401 return tile_map[1]->xy_find (x, y);
1463 } 1402 }
1464 1403
1465 if (*y < 0) 1404 if (y < 0)
1466 { 1405 {
1467 if (!m->tile_path[0]) 1406 if (!tile_path[0])
1468 return 0; 1407 return 0;
1469 1408
1470 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1409 find_and_link (this, 0);
1471 load_and_link_tiled_map (m, 0);
1472
1473 *y += m->tile_map[0]->height; 1410 y += tile_map[0]->height;
1474 return (get_map_from_coord (m->tile_map[0], x, y)); 1411 return tile_map[0]->xy_find (x, y);
1475 } 1412 }
1476 1413
1477 if (*y >= m->height) 1414 if (y >= height)
1478 { 1415 {
1479 if (!m->tile_path[2]) 1416 if (!tile_path[2])
1480 return 0; 1417 return 0;
1481 1418
1482 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1419 find_and_link (this, 2);
1483 load_and_link_tiled_map (m, 2);
1484
1485 *y -= m->height; 1420 y -= height;
1486 return (get_map_from_coord (m->tile_map[2], x, y)); 1421 return tile_map[2]->xy_find (x, y);
1487 } 1422 }
1488 1423
1489 /* Simple case - coordinates are within this local 1424 /* Simple case - coordinates are within this local
1490 * map. 1425 * map.
1491 */ 1426 */
1492 return m; 1427 return this;
1493} 1428}
1494 1429
1495/** 1430/**
1496 * Return whether map2 is adjacent to map1. If so, store the distance from 1431 * Return whether map2 is adjacent to map1. If so, store the distance from
1497 * map1 to map2 in dx/dy. 1432 * map1 to map2 in dx/dy.
1498 */ 1433 */
1499static int 1434int
1500adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1435adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1501{ 1436{
1502 if (!map1 || !map2) 1437 if (!map1 || !map2)
1503 return 0; 1438 return 0;
1504 1439
1440 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded
1441 //fix: compare paths instead (this is likely faster, too!)
1505 if (map1 == map2) 1442 if (map1 == map2)
1506 { 1443 {
1507 *dx = 0; 1444 *dx = 0;
1508 *dy = 0; 1445 *dy = 0;
1509 } 1446 }
… …
1569 } 1506 }
1570 else 1507 else
1571 return 0; 1508 return 0;
1572 1509
1573 return 1; 1510 return 1;
1511}
1512
1513maptile *
1514maptile::xy_load (sint16 &x, sint16 &y)
1515{
1516 maptile *map = xy_find (x, y);
1517
1518 if (map)
1519 map->load_sync ();
1520
1521 return map;
1522}
1523
1524maptile *
1525get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1526{
1527 return m->xy_load (*x, *y);
1574} 1528}
1575 1529
1576/* From map.c 1530/* From map.c
1577 * This is used by get_player to determine where the other 1531 * This is used by get_player to determine where the other
1578 * creature is. get_rangevector takes into account map tiling, 1532 * creature is. get_rangevector takes into account map tiling,
1579 * so you just can not look the the map coordinates and get the 1533 * so you just can not look the the map coordinates and get the
1580 * righte value. distance_x/y are distance away, which 1534 * righte value. distance_x/y are distance away, which
1581 * can be negativbe. direction is the crossfire direction scheme 1535 * can be negative. direction is the crossfire direction scheme
1582 * that the creature should head. part is the part of the 1536 * that the creature should head. part is the part of the
1583 * monster that is closest. 1537 * monster that is closest.
1584 * 1538 *
1585 * get_rangevector looks at op1 and op2, and fills in the 1539 * get_rangevector looks at op1 and op2, and fills in the
1586 * structure for op1 to get to op2. 1540 * structure for op1 to get to op2.
… …
1597get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1551get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1598{ 1552{
1599 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1553 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1600 { 1554 {
1601 /* be conservative and fill in _some_ data */ 1555 /* be conservative and fill in _some_ data */
1602 retval->distance = 100000; 1556 retval->distance = 10000;
1603 retval->distance_x = 32767; 1557 retval->distance_x = 10000;
1604 retval->distance_y = 32767; 1558 retval->distance_y = 10000;
1605 retval->direction = 0; 1559 retval->direction = 0;
1606 retval->part = 0; 1560 retval->part = 0;
1607 } 1561 }
1608 else 1562 else
1609 { 1563 {
… …
1614 1568
1615 best = op1; 1569 best = op1;
1616 /* If this is multipart, find the closest part now */ 1570 /* If this is multipart, find the closest part now */
1617 if (!(flags & 0x1) && op1->more) 1571 if (!(flags & 0x1) && op1->more)
1618 { 1572 {
1619 object *tmp;
1620 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1573 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1621 1574
1622 /* we just take the offset of the piece to head to figure 1575 /* we just take the offset of the piece to head to figure
1623 * distance instead of doing all that work above again 1576 * distance instead of doing all that work above again
1624 * since the distance fields we set above are positive in the 1577 * since the distance fields we set above are positive in the
1625 * same axis as is used for multipart objects, the simply arithmetic 1578 * same axis as is used for multipart objects, the simply arithmetic
1626 * below works. 1579 * below works.
1627 */ 1580 */
1628 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1581 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1629 { 1582 {
1630 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1583 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1631 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1584 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1632 if (tmpi < best_distance) 1585 if (tmpi < best_distance)
1633 { 1586 {
1634 best_distance = tmpi; 1587 best_distance = tmpi;
1635 best = tmp; 1588 best = tmp;
1636 } 1589 }
1637 } 1590 }
1591
1638 if (best != op1) 1592 if (best != op1)
1639 { 1593 {
1640 retval->distance_x += op1->x - best->x; 1594 retval->distance_x += op1->x - best->x;
1641 retval->distance_y += op1->y - best->y; 1595 retval->distance_y += op1->y - best->y;
1642 } 1596 }
1643 } 1597 }
1598
1644 retval->part = best; 1599 retval->part = best;
1645 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1600 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1646 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1601 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1647 } 1602 }
1648} 1603}
1649 1604
1650/* this is basically the same as get_rangevector above, but instead of 1605/* this is basically the same as get_rangevector above, but instead of
… …
1655 * flags has no meaning for this function at this time - I kept it in to 1610 * flags has no meaning for this function at this time - I kept it in to
1656 * be more consistant with the above function and also in case they are needed 1611 * be more consistant with the above function and also in case they are needed
1657 * for something in the future. Also, since no object is pasted, the best 1612 * for something in the future. Also, since no object is pasted, the best
1658 * field of the rv_vector is set to NULL. 1613 * field of the rv_vector is set to NULL.
1659 */ 1614 */
1660
1661void 1615void
1662get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1616get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1663{ 1617{
1664 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1618 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1665 { 1619 {
1666 /* be conservative and fill in _some_ data */ 1620 /* be conservative and fill in _some_ data */
1667 retval->distance = 100000; 1621 retval->distance = 100000;
… …
1674 { 1628 {
1675 retval->distance_x += op2->x - x; 1629 retval->distance_x += op2->x - x;
1676 retval->distance_y += op2->y - y; 1630 retval->distance_y += op2->y - y;
1677 1631
1678 retval->part = NULL; 1632 retval->part = NULL;
1679 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1633 retval->distance = idistance (retval->distance_x, retval->distance_y);
1680 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1634 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1681 } 1635 }
1682} 1636}
1683 1637
1684/* Returns true of op1 and op2 are effectively on the same map 1638/* Returns true of op1 and op2 are effectively on the same map
… …
1704 op->remove (); 1658 op->remove ();
1705 1659
1706 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1660 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1707} 1661}
1708 1662
1663region *
1664maptile::region (int x, int y) const
1665{
1666 if (regions
1667 && regionmap
1668 && !OUT_OF_REAL_MAP (this, x, y))
1669 if (struct region *reg = regionmap [regions [y * width + x]])
1670 return reg;
1671
1672 if (default_region)
1673 return default_region;
1674
1675 return ::region::default_region ();
1676}
1677
1678

Diff Legend

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