| 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. |
| … | |
… | |
| 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. |
| … | |
… | |
| 227 | |
229 | |
| 228 | } |
230 | } |
| 229 | return 0; |
231 | return 0; |
| 230 | } |
232 | } |
| 231 | |
233 | |
| 232 | |
|
|
| 233 | /* |
234 | /* |
| 234 | * 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. |
| 235 | * This is meant for multi space objects - for single space objecs, |
236 | * This is meant for multi space objects - for single space objecs, |
| 236 | * just calling get_map_blocked and checking that against movement type |
237 | * just calling get_map_blocked and checking that against movement type |
| 237 | * of object. This function goes through all the parts of the |
238 | * of object. This function goes through all the parts of the |
| … | |
… | |
| 329 | * carrying. |
330 | * carrying. |
| 330 | */ |
331 | */ |
| 331 | sum_weight (container); |
332 | sum_weight (container); |
| 332 | } |
333 | } |
| 333 | |
334 | |
|
|
335 | void |
|
|
336 | maptile::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 | |
| 334 | /* 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 |
| 335 | * 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 |
| 336 | * 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 |
| 337 | * 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 |
| 338 | * the more sections and not re-add sections for them. |
350 | * the more sections and not re-add sections for them. |
| … | |
… | |
| 388 | * 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 |
| 389 | * file pointer. |
401 | * file pointer. |
| 390 | * mapflags is the same as we get with load_original_map |
402 | * mapflags is the same as we get with load_original_map |
| 391 | */ |
403 | */ |
| 392 | bool |
404 | bool |
| 393 | maptile::load_objects (object_thawer &thawer) |
405 | maptile::_load_objects (object_thawer &thawer) |
| 394 | { |
406 | { |
| 395 | int unique; |
407 | int unique; |
| 396 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
408 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
| 397 | |
409 | |
| 398 | op = object::create (); |
410 | op = object::create (); |
| … | |
… | |
| 474 | for (object *op = ms->bot; op; op = op->above) |
486 | for (object *op = ms->bot; op; op = op->above) |
| 475 | op->deactivate_recursive (); |
487 | op->deactivate_recursive (); |
| 476 | } |
488 | } |
| 477 | |
489 | |
| 478 | bool |
490 | bool |
| 479 | maptile::save_objects (object_freezer &freezer, int flags) |
491 | maptile::_save_objects (object_freezer &freezer, int flags) |
| 480 | { |
492 | { |
|
|
493 | static int cede_count = 0; |
|
|
494 | |
| 481 | if (flags & IO_HEADER) |
495 | if (flags & IO_HEADER) |
| 482 | save_header (freezer); |
496 | _save_header (freezer); |
| 483 | |
497 | |
| 484 | if (!spaces) |
498 | if (!spaces) |
| 485 | return false; |
499 | return false; |
| 486 | |
500 | |
| 487 | for (int i = 0; i < size (); ++i) |
501 | for (int i = 0; i < size (); ++i) |
| 488 | { |
502 | { |
|
|
503 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
|
|
504 | if (cede_count >= 500) |
|
|
505 | { |
|
|
506 | cede_count = 0; |
|
|
507 | coroapi::cede (); |
|
|
508 | } |
|
|
509 | #endif |
|
|
510 | |
| 489 | int unique = 0; |
511 | int unique = 0; |
| 490 | for (object *op = spaces [i].bot; op; op = op->above) |
512 | for (object *op = spaces [i].bot; op; op = op->above) |
| 491 | { |
513 | { |
|
|
514 | // count per-object, but cede only when modification-safe |
|
|
515 | cede_count++; |
|
|
516 | |
| 492 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
517 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
| 493 | unique = 1; |
518 | unique = 1; |
| 494 | |
519 | |
| 495 | if (!op->can_map_save ()) |
520 | if (!op->can_map_save ()) |
| 496 | continue; |
521 | continue; |
| … | |
… | |
| 507 | |
532 | |
| 508 | return true; |
533 | return true; |
| 509 | } |
534 | } |
| 510 | |
535 | |
| 511 | bool |
536 | bool |
| 512 | maptile::load_objects (const char *path, bool skip_header) |
537 | maptile::_load_objects (const char *path, bool skip_header) |
| 513 | { |
538 | { |
| 514 | object_thawer thawer (path); |
539 | object_thawer thawer (path); |
| 515 | |
540 | |
| 516 | if (!thawer) |
541 | if (!thawer) |
| 517 | return false; |
542 | return false; |
| 518 | |
543 | |
| 519 | if (skip_header) |
544 | if (skip_header) |
| 520 | for (;;) |
545 | for (;;) |
| 521 | { |
546 | { |
| 522 | keyword kw = thawer.get_kv (); |
|
|
| 523 | |
|
|
| 524 | if (kw == KW_end) |
547 | if (thawer.kw == KW_end) |
| 525 | break; |
548 | break; |
| 526 | |
549 | |
| 527 | thawer.skip_kv (kw); |
550 | thawer.skip_kv (); |
| 528 | } |
551 | } |
| 529 | |
552 | |
| 530 | return load_objects (thawer); |
553 | return _load_objects (thawer); |
| 531 | } |
554 | } |
| 532 | |
555 | |
| 533 | bool |
556 | bool |
| 534 | maptile::save_objects (const char *path, int flags) |
557 | maptile::_save_objects (const char *path, int flags) |
| 535 | { |
558 | { |
| 536 | object_freezer freezer; |
559 | object_freezer freezer; |
| 537 | |
560 | |
| 538 | if (!save_objects (freezer, flags)) |
561 | if (!_save_objects (freezer, flags)) |
| 539 | return false; |
562 | return false; |
| 540 | |
563 | |
| 541 | return freezer.save (path); |
564 | return freezer.save (path); |
| 542 | } |
565 | } |
| 543 | |
566 | |
| 544 | maptile::maptile () |
567 | maptile::maptile () |
| 545 | { |
568 | { |
| 546 | in_memory = MAP_SWAPPED; |
569 | in_memory = MAP_SWAPPED; |
| 547 | |
570 | |
| 548 | /* The maps used to pick up default x and y values from the |
571 | /* The maps used to pick up default x and y values from the |
| 549 | * map archetype. Mimic that behaviour. |
572 | * map archetype. Mimic that behaviour. |
| 550 | */ |
573 | */ |
| 551 | width = 16; |
574 | width = 16; |
| 552 | height = 16; |
575 | height = 16; |
| 553 | reset_timeout = 0; |
|
|
| 554 | timeout = 300; |
576 | timeout = 300; |
| 555 | enter_x = 0; |
577 | max_nrof = 1000; // 1000 items of anything |
| 556 | enter_y = 0; |
578 | max_volume = 2000000; // 2m³ |
| 557 | } |
579 | } |
| 558 | |
580 | |
| 559 | maptile::maptile (int w, int h) |
581 | maptile::maptile (int w, int h) |
| 560 | { |
582 | { |
| 561 | in_memory = MAP_SWAPPED; |
583 | in_memory = MAP_SWAPPED; |
| … | |
… | |
| 707 | * This could be done in lex (like the object loader), but I think |
729 | * 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. |
730 | * currently, there are few enough fields this is not a big deal. |
| 709 | * MSW 2001-07-01 |
731 | * MSW 2001-07-01 |
| 710 | */ |
732 | */ |
| 711 | bool |
733 | bool |
| 712 | maptile::load_header (object_thawer &thawer) |
734 | maptile::_load_header (object_thawer &thawer) |
| 713 | { |
735 | { |
| 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 (;;) |
736 | for (;;) |
| 719 | { |
737 | { |
| 720 | keyword kw = thawer.get_kv (); |
738 | keyword kw = thawer.get_kv (); |
| 721 | |
739 | |
| 722 | switch (kw) |
740 | switch (kw) |
| 723 | { |
741 | { |
| 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: |
742 | case KW_msg: |
| 732 | thawer.get_ml (KW_endmsg, msg); |
743 | thawer.get_ml (KW_endmsg, msg); |
| 733 | break; |
744 | break; |
| 734 | |
745 | |
| 735 | case KW_lore: // CF+ extension |
746 | case KW_lore: // CF+ extension |
| … | |
… | |
| 767 | case KW_sky: thawer.get (sky); break; |
778 | case KW_sky: thawer.get (sky); break; |
| 768 | |
779 | |
| 769 | case KW_per_player: thawer.get (per_player); break; |
780 | case KW_per_player: thawer.get (per_player); break; |
| 770 | case KW_per_party: thawer.get (per_party); break; |
781 | case KW_per_party: thawer.get (per_party); break; |
| 771 | |
782 | |
| 772 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
783 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
| 773 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
784 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
| 774 | |
785 | |
| 775 | // old names new names |
786 | // old names new names |
| 776 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
787 | 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; |
788 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
| … | |
… | |
| 786 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
797 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
| 787 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
798 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
| 788 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
799 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
| 789 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
800 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
| 790 | |
801 | |
|
|
802 | case KW_end: |
|
|
803 | return true; |
|
|
804 | |
| 791 | default: |
805 | default: |
| 792 | LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); |
806 | if (!thawer.parse_error ("map", 0)) |
|
|
807 | return false; |
| 793 | break; |
808 | break; |
| 794 | } |
809 | } |
| 795 | } |
810 | } |
| 796 | |
811 | |
| 797 | abort (); |
812 | abort (); |
| 798 | } |
813 | } |
| 799 | |
814 | |
| 800 | bool |
815 | bool |
| 801 | maptile::load_header (const char *path) |
816 | maptile::_load_header (const char *path) |
| 802 | { |
817 | { |
| 803 | object_thawer thawer (path); |
818 | object_thawer thawer (path); |
| 804 | |
819 | |
| 805 | if (!thawer) |
820 | if (!thawer) |
| 806 | return false; |
821 | return false; |
| 807 | |
822 | |
| 808 | return load_header (thawer); |
823 | return _load_header (thawer); |
| 809 | } |
824 | } |
| 810 | |
825 | |
| 811 | /****************************************************************************** |
826 | /****************************************************************************** |
| 812 | * This is the start of unique map handling code |
827 | * This is the start of unique map handling code |
| 813 | *****************************************************************************/ |
828 | *****************************************************************************/ |
| … | |
… | |
| 836 | } |
851 | } |
| 837 | } |
852 | } |
| 838 | } |
853 | } |
| 839 | |
854 | |
| 840 | bool |
855 | bool |
| 841 | maptile::save_header (object_freezer &freezer) |
856 | maptile::_save_header (object_freezer &freezer) |
| 842 | { |
857 | { |
| 843 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
858 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
| 844 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
859 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
| 845 | |
860 | |
| 846 | MAP_OUT2 (arch, "map"); |
861 | MAP_OUT2 (arch, "map"); |
| … | |
… | |
| 850 | MAP_OUT (reset_time); |
865 | MAP_OUT (reset_time); |
| 851 | MAP_OUT (reset_timeout); |
866 | MAP_OUT (reset_timeout); |
| 852 | MAP_OUT (fixed_resettime); |
867 | MAP_OUT (fixed_resettime); |
| 853 | MAP_OUT (difficulty); |
868 | MAP_OUT (difficulty); |
| 854 | |
869 | |
| 855 | if (region) MAP_OUT2 (region, region->name); |
870 | if (default_region) MAP_OUT2 (region, default_region->name); |
| 856 | |
871 | |
| 857 | if (shopitems) |
872 | if (shopitems) |
| 858 | { |
873 | { |
| 859 | char shop[MAX_BUF]; |
874 | char shop[MAX_BUF]; |
| 860 | print_shop_string (this, shop); |
875 | print_shop_string (this, shop); |
| … | |
… | |
| 895 | |
910 | |
| 896 | return true; |
911 | return true; |
| 897 | } |
912 | } |
| 898 | |
913 | |
| 899 | bool |
914 | bool |
| 900 | maptile::save_header (const char *path) |
915 | maptile::_save_header (const char *path) |
| 901 | { |
916 | { |
| 902 | object_freezer freezer; |
917 | object_freezer freezer; |
| 903 | |
918 | |
| 904 | if (!save_header (freezer)) |
919 | if (!_save_header (freezer)) |
| 905 | return false; |
920 | return false; |
| 906 | |
921 | |
| 907 | return freezer.save (path); |
922 | return freezer.save (path); |
| 908 | } |
923 | } |
| 909 | |
924 | |
| … | |
… | |
| 911 | * Remove and free all objects in the given map. |
926 | * Remove and free all objects in the given map. |
| 912 | */ |
927 | */ |
| 913 | void |
928 | void |
| 914 | maptile::clear () |
929 | maptile::clear () |
| 915 | { |
930 | { |
|
|
931 | sfree (regions, size ()), regions = 0; |
|
|
932 | free (regionmap), regionmap = 0; |
|
|
933 | |
| 916 | if (!spaces) |
934 | if (spaces) |
| 917 | return; |
935 | { |
| 918 | |
|
|
| 919 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
936 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 920 | while (object *op = ms->bot) |
937 | while (object *op = ms->bot) |
| 921 | { |
938 | { |
| 922 | if (op->head) |
939 | if (op->head) |
| 923 | op = op->head; |
940 | op = op->head; |
| 924 | |
941 | |
| 925 | op->destroy_inv (false); |
942 | op->destroy_inv (false); |
| 926 | op->destroy (); |
943 | op->destroy (); |
| 927 | } |
944 | } |
| 928 | |
945 | |
| 929 | sfree (spaces, size ()), spaces = 0; |
946 | sfree (spaces, size ()), spaces = 0; |
|
|
947 | } |
| 930 | |
948 | |
| 931 | if (buttons) |
949 | if (buttons) |
| 932 | free_objectlinkpt (buttons), buttons = 0; |
950 | free_objectlinkpt (buttons), buttons = 0; |
| 933 | } |
951 | } |
| 934 | |
952 | |
| … | |
… | |
| 1088 | */ |
1106 | */ |
| 1089 | void |
1107 | void |
| 1090 | mapspace::update_ () |
1108 | mapspace::update_ () |
| 1091 | { |
1109 | { |
| 1092 | object *tmp, *last = 0; |
1110 | object *tmp, *last = 0; |
| 1093 | uint8 flags = 0, light = 0, anywhere = 0; |
1111 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
| 1094 | New_Face *top, *floor, *middle; |
1112 | facetile *top, *floor, *middle; |
| 1095 | object *top_obj, *floor_obj, *middle_obj; |
1113 | object *top_obj, *floor_obj, *middle_obj; |
| 1096 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1114 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
| 1097 | |
1115 | |
| 1098 | middle = blank_face; |
1116 | middle = blank_face; |
| 1099 | top = blank_face; |
1117 | top = blank_face; |
| … | |
… | |
| 1215 | |
1233 | |
| 1216 | /* If two top faces are already set, quit processing */ |
1234 | /* If two top faces are already set, quit processing */ |
| 1217 | if ((top != blank_face) && (middle != blank_face)) |
1235 | if ((top != blank_face) && (middle != blank_face)) |
| 1218 | break; |
1236 | break; |
| 1219 | |
1237 | |
| 1220 | /* Only show visible faces, unless its the editor - show all */ |
1238 | /* Only show visible faces */ |
| 1221 | if (!tmp->invisible || editor) |
1239 | if (!tmp->invisible) |
| 1222 | { |
1240 | { |
| 1223 | /* Fill in top if needed */ |
1241 | /* Fill in top if needed */ |
| 1224 | if (top == blank_face) |
1242 | if (top == blank_face) |
| 1225 | { |
1243 | { |
| 1226 | top = tmp->face; |
1244 | top = tmp->face; |
| … | |
… | |
| 1256 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1274 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
| 1257 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1275 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
| 1258 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1276 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
| 1259 | } |
1277 | } |
| 1260 | |
1278 | |
|
|
1279 | uint64 |
|
|
1280 | mapspace::volume () const |
|
|
1281 | { |
|
|
1282 | uint64 vol = 0; |
|
|
1283 | |
|
|
1284 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1285 | vol += op->volume (); |
|
|
1286 | |
|
|
1287 | return vol; |
|
|
1288 | } |
|
|
1289 | |
| 1261 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1290 | /* 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 |
1291 | * 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 |
1292 | * 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 |
1293 | * the value of orig_map->tile_map[tile_num]. |
| 1265 | * so that it is easier for calling functions to verify success. |
|
|
| 1266 | */ |
1294 | */ |
| 1267 | static maptile * |
1295 | static inline maptile * |
| 1268 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
1296 | find_and_link (maptile *orig_map, int tile_num) |
| 1269 | { |
1297 | { |
|
|
1298 | maptile *mp = orig_map->tile_map [tile_num]; |
|
|
1299 | |
|
|
1300 | if (!mp) |
|
|
1301 | { |
| 1270 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1302 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
| 1271 | |
1303 | |
| 1272 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1304 | if (!mp) |
| 1273 | { |
1305 | { |
| 1274 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1306 | // 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", |
1307 | 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); |
1308 | &orig_map->tile_path[tile_num], &orig_map->path); |
| 1277 | mp = new maptile (1, 1); |
1309 | mp = new maptile (1, 1); |
| 1278 | mp->alloc (); |
1310 | mp->alloc (); |
| 1279 | mp->in_memory = MAP_IN_MEMORY; |
1311 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1312 | } |
| 1280 | } |
1313 | } |
| 1281 | |
1314 | |
| 1282 | int dest_tile = (tile_num + 2) % 4; |
1315 | int dest_tile = (tile_num + 2) % 4; |
| 1283 | |
1316 | |
| 1284 | orig_map->tile_map[tile_num] = mp; |
1317 | orig_map->tile_map [tile_num] = mp; |
| 1285 | |
1318 | |
| 1286 | // optimisation: back-link map to origin map if euclidean |
1319 | // optimisation: back-link map to origin map if euclidean |
| 1287 | //TODO: non-euclidean maps MUST GO |
1320 | //TODO: non-euclidean maps MUST GO |
| 1288 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1321 | 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; |
1322 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
| 1290 | |
1323 | |
| 1291 | return mp; |
1324 | return mp; |
|
|
1325 | } |
|
|
1326 | |
|
|
1327 | static inline void |
|
|
1328 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1329 | { |
|
|
1330 | find_and_link (orig_map, tile_num)->load_sync (); |
| 1292 | } |
1331 | } |
| 1293 | |
1332 | |
| 1294 | /* this returns TRUE if the coordinates (x,y) are out of |
1333 | /* this returns TRUE if the coordinates (x,y) are out of |
| 1295 | * map m. This function also takes into account any |
1334 | * map m. This function also takes into account any |
| 1296 | * tiling considerations, loading adjacant maps as needed. |
1335 | * tiling considerations, loading adjacant maps as needed. |
| … | |
… | |
| 1313 | { |
1352 | { |
| 1314 | if (!m->tile_path[3]) |
1353 | if (!m->tile_path[3]) |
| 1315 | return 1; |
1354 | return 1; |
| 1316 | |
1355 | |
| 1317 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1356 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
| 1318 | load_and_link_tiled_map (m, 3); |
1357 | find_and_link (m, 3); |
| 1319 | |
1358 | |
| 1320 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1359 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
| 1321 | } |
1360 | } |
| 1322 | |
1361 | |
| 1323 | if (x >= m->width) |
1362 | if (x >= m->width) |
| 1324 | { |
1363 | { |
| 1325 | if (!m->tile_path[1]) |
1364 | if (!m->tile_path[1]) |
| 1326 | return 1; |
1365 | return 1; |
| 1327 | |
1366 | |
| 1328 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1367 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
| 1329 | load_and_link_tiled_map (m, 1); |
1368 | find_and_link (m, 1); |
| 1330 | |
1369 | |
| 1331 | return out_of_map (m->tile_map[1], x - m->width, y); |
1370 | return out_of_map (m->tile_map[1], x - m->width, y); |
| 1332 | } |
1371 | } |
| 1333 | |
1372 | |
| 1334 | if (y < 0) |
1373 | if (y < 0) |
| 1335 | { |
1374 | { |
| 1336 | if (!m->tile_path[0]) |
1375 | if (!m->tile_path[0]) |
| 1337 | return 1; |
1376 | return 1; |
| 1338 | |
1377 | |
| 1339 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1378 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
| 1340 | load_and_link_tiled_map (m, 0); |
1379 | find_and_link (m, 0); |
| 1341 | |
1380 | |
| 1342 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1381 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
| 1343 | } |
1382 | } |
| 1344 | |
1383 | |
| 1345 | if (y >= m->height) |
1384 | if (y >= m->height) |
| 1346 | { |
1385 | { |
| 1347 | if (!m->tile_path[2]) |
1386 | if (!m->tile_path[2]) |
| 1348 | return 1; |
1387 | return 1; |
| 1349 | |
1388 | |
| 1350 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1389 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
| 1351 | load_and_link_tiled_map (m, 2); |
1390 | find_and_link (m, 2); |
| 1352 | |
1391 | |
| 1353 | return out_of_map (m->tile_map[2], x, y - m->height); |
1392 | return out_of_map (m->tile_map[2], x, y - m->height); |
| 1354 | } |
1393 | } |
| 1355 | |
1394 | |
| 1356 | /* Simple case - coordinates are within this local |
1395 | /* Simple case - coordinates are within this local |
| … | |
… | |
| 1361 | |
1400 | |
| 1362 | /* This is basically the same as out_of_map above, but |
1401 | /* This is basically the same as out_of_map above, but |
| 1363 | * instead we return NULL if no map is valid (coordinates |
1402 | * instead we return NULL if no map is valid (coordinates |
| 1364 | * out of bounds and no tiled map), otherwise it returns |
1403 | * out of bounds and no tiled map), otherwise it returns |
| 1365 | * the map as that the coordinates are really on, and |
1404 | * the map as that the coordinates are really on, and |
| 1366 | * updates x and y to be the localized coordinates. |
1405 | * updates x and y to be the localised coordinates. |
| 1367 | * Using this is more efficient of calling out_of_map |
1406 | * Using this is more efficient of calling out_of_map |
| 1368 | * and then figuring out what the real map is |
1407 | * and then figuring out what the real map is |
| 1369 | */ |
1408 | */ |
| 1370 | maptile * |
1409 | maptile * |
| 1371 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1410 | maptile::xy_find (sint16 &x, sint16 &y) |
| 1372 | { |
1411 | { |
| 1373 | if (*x < 0) |
1412 | if (x < 0) |
| 1374 | { |
1413 | { |
| 1375 | if (!m->tile_path[3]) |
1414 | if (!tile_path[3]) |
| 1376 | return 0; |
1415 | return 0; |
| 1377 | |
1416 | |
| 1378 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1417 | find_and_link (this, 3); |
| 1379 | load_and_link_tiled_map (m, 3); |
|
|
| 1380 | |
|
|
| 1381 | *x += m->tile_map[3]->width; |
1418 | x += tile_map[3]->width; |
| 1382 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1419 | return tile_map[3]->xy_find (x, y); |
| 1383 | } |
1420 | } |
| 1384 | |
1421 | |
| 1385 | if (*x >= m->width) |
1422 | if (x >= width) |
| 1386 | { |
1423 | { |
| 1387 | if (!m->tile_path[1]) |
1424 | if (!tile_path[1]) |
| 1388 | return 0; |
1425 | return 0; |
| 1389 | |
1426 | |
| 1390 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1427 | find_and_link (this, 1); |
| 1391 | load_and_link_tiled_map (m, 1); |
|
|
| 1392 | |
|
|
| 1393 | *x -= m->width; |
1428 | x -= width; |
| 1394 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1429 | return tile_map[1]->xy_find (x, y); |
| 1395 | } |
1430 | } |
| 1396 | |
1431 | |
| 1397 | if (*y < 0) |
1432 | if (y < 0) |
| 1398 | { |
1433 | { |
| 1399 | if (!m->tile_path[0]) |
1434 | if (!tile_path[0]) |
| 1400 | return 0; |
1435 | return 0; |
| 1401 | |
1436 | |
| 1402 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1437 | find_and_link (this, 0); |
| 1403 | load_and_link_tiled_map (m, 0); |
|
|
| 1404 | |
|
|
| 1405 | *y += m->tile_map[0]->height; |
1438 | y += tile_map[0]->height; |
| 1406 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1439 | return tile_map[0]->xy_find (x, y); |
| 1407 | } |
1440 | } |
| 1408 | |
1441 | |
| 1409 | if (*y >= m->height) |
1442 | if (y >= height) |
| 1410 | { |
1443 | { |
| 1411 | if (!m->tile_path[2]) |
1444 | if (!tile_path[2]) |
| 1412 | return 0; |
1445 | return 0; |
| 1413 | |
1446 | |
| 1414 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1447 | find_and_link (this, 2); |
| 1415 | load_and_link_tiled_map (m, 2); |
|
|
| 1416 | |
|
|
| 1417 | *y -= m->height; |
1448 | y -= height; |
| 1418 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1449 | return tile_map[2]->xy_find (x, y); |
| 1419 | } |
1450 | } |
| 1420 | |
1451 | |
| 1421 | /* Simple case - coordinates are within this local |
1452 | /* Simple case - coordinates are within this local |
| 1422 | * map. |
1453 | * map. |
| 1423 | */ |
1454 | */ |
| 1424 | return m; |
1455 | return this; |
| 1425 | } |
1456 | } |
| 1426 | |
1457 | |
| 1427 | /** |
1458 | /** |
| 1428 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1459 | * Return whether map2 is adjacent to map1. If so, store the distance from |
| 1429 | * map1 to map2 in dx/dy. |
1460 | * map1 to map2 in dx/dy. |
| 1430 | */ |
1461 | */ |
| 1431 | static int |
1462 | int |
| 1432 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1463 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
| 1433 | { |
1464 | { |
| 1434 | if (!map1 || !map2) |
1465 | if (!map1 || !map2) |
| 1435 | return 0; |
1466 | return 0; |
| 1436 | |
1467 | |
|
|
1468 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
|
|
1469 | //fix: compare paths instead (this is likely faster, too!) |
| 1437 | if (map1 == map2) |
1470 | if (map1 == map2) |
| 1438 | { |
1471 | { |
| 1439 | *dx = 0; |
1472 | *dx = 0; |
| 1440 | *dy = 0; |
1473 | *dy = 0; |
| 1441 | } |
1474 | } |
| … | |
… | |
| 1501 | } |
1534 | } |
| 1502 | else |
1535 | else |
| 1503 | return 0; |
1536 | return 0; |
| 1504 | |
1537 | |
| 1505 | return 1; |
1538 | return 1; |
|
|
1539 | } |
|
|
1540 | |
|
|
1541 | maptile * |
|
|
1542 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1543 | { |
|
|
1544 | maptile *map = xy_find (x, y); |
|
|
1545 | |
|
|
1546 | if (map) |
|
|
1547 | map->load_sync (); |
|
|
1548 | |
|
|
1549 | return map; |
|
|
1550 | } |
|
|
1551 | |
|
|
1552 | maptile * |
|
|
1553 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1554 | { |
|
|
1555 | return m->xy_load (*x, *y); |
| 1506 | } |
1556 | } |
| 1507 | |
1557 | |
| 1508 | /* From map.c |
1558 | /* From map.c |
| 1509 | * This is used by get_player to determine where the other |
1559 | * This is used by get_player to determine where the other |
| 1510 | * creature is. get_rangevector takes into account map tiling, |
1560 | * creature is. get_rangevector takes into account map tiling, |
| 1511 | * so you just can not look the the map coordinates and get the |
1561 | * so you just can not look the the map coordinates and get the |
| 1512 | * righte value. distance_x/y are distance away, which |
1562 | * righte value. distance_x/y are distance away, which |
| 1513 | * can be negativbe. direction is the crossfire direction scheme |
1563 | * can be negative. direction is the crossfire direction scheme |
| 1514 | * that the creature should head. part is the part of the |
1564 | * that the creature should head. part is the part of the |
| 1515 | * monster that is closest. |
1565 | * monster that is closest. |
| 1516 | * |
1566 | * |
| 1517 | * get_rangevector looks at op1 and op2, and fills in the |
1567 | * get_rangevector looks at op1 and op2, and fills in the |
| 1518 | * structure for op1 to get to op2. |
1568 | * structure for op1 to get to op2. |
| … | |
… | |
| 1529 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1579 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
| 1530 | { |
1580 | { |
| 1531 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1581 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
| 1532 | { |
1582 | { |
| 1533 | /* be conservative and fill in _some_ data */ |
1583 | /* be conservative and fill in _some_ data */ |
| 1534 | retval->distance = 100000; |
1584 | retval->distance = 10000; |
| 1535 | retval->distance_x = 32767; |
1585 | retval->distance_x = 10000; |
| 1536 | retval->distance_y = 32767; |
1586 | retval->distance_y = 10000; |
| 1537 | retval->direction = 0; |
1587 | retval->direction = 0; |
| 1538 | retval->part = 0; |
1588 | retval->part = 0; |
| 1539 | } |
1589 | } |
| 1540 | else |
1590 | else |
| 1541 | { |
1591 | { |
| … | |
… | |
| 1546 | |
1596 | |
| 1547 | best = op1; |
1597 | best = op1; |
| 1548 | /* If this is multipart, find the closest part now */ |
1598 | /* If this is multipart, find the closest part now */ |
| 1549 | if (!(flags & 0x1) && op1->more) |
1599 | if (!(flags & 0x1) && op1->more) |
| 1550 | { |
1600 | { |
| 1551 | object *tmp; |
|
|
| 1552 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1601 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
| 1553 | |
1602 | |
| 1554 | /* we just take the offset of the piece to head to figure |
1603 | /* we just take the offset of the piece to head to figure |
| 1555 | * distance instead of doing all that work above again |
1604 | * distance instead of doing all that work above again |
| 1556 | * since the distance fields we set above are positive in the |
1605 | * since the distance fields we set above are positive in the |
| 1557 | * same axis as is used for multipart objects, the simply arithmetic |
1606 | * same axis as is used for multipart objects, the simply arithmetic |
| 1558 | * below works. |
1607 | * below works. |
| 1559 | */ |
1608 | */ |
| 1560 | for (tmp = op1->more; tmp != NULL; tmp = tmp->more) |
1609 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
| 1561 | { |
1610 | { |
| 1562 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1611 | 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); |
1612 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
| 1564 | if (tmpi < best_distance) |
1613 | if (tmpi < best_distance) |
| 1565 | { |
1614 | { |
| 1566 | best_distance = tmpi; |
1615 | best_distance = tmpi; |
| 1567 | best = tmp; |
1616 | best = tmp; |
| 1568 | } |
1617 | } |
| 1569 | } |
1618 | } |
|
|
1619 | |
| 1570 | if (best != op1) |
1620 | if (best != op1) |
| 1571 | { |
1621 | { |
| 1572 | retval->distance_x += op1->x - best->x; |
1622 | retval->distance_x += op1->x - best->x; |
| 1573 | retval->distance_y += op1->y - best->y; |
1623 | retval->distance_y += op1->y - best->y; |
| 1574 | } |
1624 | } |
| 1575 | } |
1625 | } |
|
|
1626 | |
| 1576 | retval->part = best; |
1627 | retval->part = best; |
| 1577 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1628 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
| 1578 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1629 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
| 1579 | } |
1630 | } |
| 1580 | } |
1631 | } |
| 1581 | |
1632 | |
| 1582 | /* this is basically the same as get_rangevector above, but instead of |
1633 | /* 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 |
1638 | * 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 |
1639 | * 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 |
1640 | * for something in the future. Also, since no object is pasted, the best |
| 1590 | * field of the rv_vector is set to NULL. |
1641 | * field of the rv_vector is set to NULL. |
| 1591 | */ |
1642 | */ |
| 1592 | |
|
|
| 1593 | void |
1643 | void |
| 1594 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
1644 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
| 1595 | { |
1645 | { |
| 1596 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1646 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
| 1597 | { |
1647 | { |
| 1598 | /* be conservative and fill in _some_ data */ |
1648 | /* be conservative and fill in _some_ data */ |
| 1599 | retval->distance = 100000; |
1649 | retval->distance = 100000; |
| … | |
… | |
| 1606 | { |
1656 | { |
| 1607 | retval->distance_x += op2->x - x; |
1657 | retval->distance_x += op2->x - x; |
| 1608 | retval->distance_y += op2->y - y; |
1658 | retval->distance_y += op2->y - y; |
| 1609 | |
1659 | |
| 1610 | retval->part = NULL; |
1660 | retval->part = NULL; |
| 1611 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1661 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
| 1612 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1662 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
| 1613 | } |
1663 | } |
| 1614 | } |
1664 | } |
| 1615 | |
1665 | |
| 1616 | /* Returns true of op1 and op2 are effectively on the same map |
1666 | /* Returns true of op1 and op2 are effectively on the same map |
| … | |
… | |
| 1636 | op->remove (); |
1686 | op->remove (); |
| 1637 | |
1687 | |
| 1638 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1688 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
| 1639 | } |
1689 | } |
| 1640 | |
1690 | |
|
|
1691 | region * |
|
|
1692 | maptile::region (int x, int y) const |
|
|
1693 | { |
|
|
1694 | if (regions |
|
|
1695 | && regionmap |
|
|
1696 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1697 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1698 | return reg; |
|
|
1699 | |
|
|
1700 | if (default_region) |
|
|
1701 | return default_region; |
|
|
1702 | |
|
|
1703 | return ::region::default_region (); |
|
|
1704 | } |
|
|
1705 | |
|
|
1706 | |
