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