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 <global.h> |
25 | #include <funcpoint.h> |
26 | #include <funcpoint.h> |
26 | |
27 | |
27 | #include <loader.h> |
28 | #include <loader.h> |
… | |
… | |
227 | |
228 | |
228 | } |
229 | } |
229 | return 0; |
230 | return 0; |
230 | } |
231 | } |
231 | |
232 | |
232 | |
|
|
233 | /* |
233 | /* |
234 | * Returns true if the given object can't fit in the given spot. |
234 | * 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, |
235 | * This is meant for multi space objects - for single space objecs, |
236 | * just calling get_map_blocked and checking that against movement type |
236 | * just calling get_map_blocked and checking that against movement type |
237 | * of object. This function goes through all the parts of the |
237 | * of object. This function goes through all the parts of the |
… | |
… | |
329 | * carrying. |
329 | * carrying. |
330 | */ |
330 | */ |
331 | sum_weight (container); |
331 | sum_weight (container); |
332 | } |
332 | } |
333 | |
333 | |
|
|
334 | void |
|
|
335 | maptile::set_object_flag (int flag, int value) |
|
|
336 | { |
|
|
337 | if (!spaces) |
|
|
338 | return; |
|
|
339 | |
|
|
340 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
341 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
342 | tmp->flag [flag] = value; |
|
|
343 | } |
|
|
344 | |
334 | /* link_multipart_objects go through all the objects on the map looking |
345 | /* 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 |
346 | * 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 |
347 | * 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 |
348 | * 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. |
349 | * the more sections and not re-add sections for them. |
… | |
… | |
388 | * Loads (ands parses) the objects into a given map from the specified |
399 | * Loads (ands parses) the objects into a given map from the specified |
389 | * file pointer. |
400 | * file pointer. |
390 | * mapflags is the same as we get with load_original_map |
401 | * mapflags is the same as we get with load_original_map |
391 | */ |
402 | */ |
392 | bool |
403 | bool |
393 | maptile::load_objects (object_thawer &thawer) |
404 | maptile::_load_objects (object_thawer &thawer) |
394 | { |
405 | { |
395 | int unique; |
406 | int unique; |
396 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
407 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
397 | |
408 | |
398 | op = object::create (); |
409 | op = object::create (); |
… | |
… | |
474 | for (object *op = ms->bot; op; op = op->above) |
485 | for (object *op = ms->bot; op; op = op->above) |
475 | op->deactivate_recursive (); |
486 | op->deactivate_recursive (); |
476 | } |
487 | } |
477 | |
488 | |
478 | bool |
489 | bool |
479 | maptile::save_objects (object_freezer &freezer, int flags) |
490 | maptile::_save_objects (object_freezer &freezer, int flags) |
480 | { |
491 | { |
|
|
492 | static int cede_count = 0; |
|
|
493 | |
481 | if (flags & IO_HEADER) |
494 | if (flags & IO_HEADER) |
482 | save_header (freezer); |
495 | _save_header (freezer); |
483 | |
496 | |
484 | if (!spaces) |
497 | if (!spaces) |
485 | return false; |
498 | return false; |
486 | |
499 | |
487 | for (int i = 0; i < size (); ++i) |
500 | for (int i = 0; i < size (); ++i) |
488 | { |
501 | { |
|
|
502 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
|
|
503 | if (cede_count >= 500) |
|
|
504 | { |
|
|
505 | cede_count = 0; |
|
|
506 | coroapi::cede (); |
|
|
507 | } |
|
|
508 | #endif |
|
|
509 | |
489 | int unique = 0; |
510 | int unique = 0; |
490 | for (object *op = spaces [i].bot; op; op = op->above) |
511 | for (object *op = spaces [i].bot; op; op = op->above) |
491 | { |
512 | { |
|
|
513 | // count per-object, but cede only when modification-safe |
|
|
514 | cede_count++; |
|
|
515 | |
492 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
516 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
493 | unique = 1; |
517 | unique = 1; |
494 | |
518 | |
495 | if (!op->can_map_save ()) |
519 | if (!op->can_map_save ()) |
496 | continue; |
520 | continue; |
… | |
… | |
507 | |
531 | |
508 | return true; |
532 | return true; |
509 | } |
533 | } |
510 | |
534 | |
511 | bool |
535 | bool |
512 | maptile::load_objects (const char *path, bool skip_header) |
536 | maptile::_load_objects (const char *path, bool skip_header) |
513 | { |
537 | { |
514 | object_thawer thawer (path); |
538 | object_thawer thawer (path); |
515 | |
539 | |
516 | if (!thawer) |
540 | if (!thawer) |
517 | return false; |
541 | return false; |
… | |
… | |
525 | break; |
549 | break; |
526 | |
550 | |
527 | thawer.skip_kv (kw); |
551 | thawer.skip_kv (kw); |
528 | } |
552 | } |
529 | |
553 | |
530 | return load_objects (thawer); |
554 | return _load_objects (thawer); |
531 | } |
555 | } |
532 | |
556 | |
533 | bool |
557 | bool |
534 | maptile::save_objects (const char *path, int flags) |
558 | maptile::_save_objects (const char *path, int flags) |
535 | { |
559 | { |
536 | object_freezer freezer; |
560 | object_freezer freezer; |
537 | |
561 | |
538 | if (!save_objects (freezer, flags)) |
562 | if (!_save_objects (freezer, flags)) |
539 | return false; |
563 | return false; |
540 | |
564 | |
541 | return freezer.save (path); |
565 | return freezer.save (path); |
542 | } |
566 | } |
543 | |
567 | |
… | |
… | |
707 | * 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 |
708 | * 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. |
709 | * MSW 2001-07-01 |
733 | * MSW 2001-07-01 |
710 | */ |
734 | */ |
711 | bool |
735 | bool |
712 | maptile::load_header (object_thawer &thawer) |
736 | maptile::_load_header (object_thawer &thawer) |
713 | { |
737 | { |
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 (;;) |
738 | for (;;) |
719 | { |
739 | { |
720 | keyword kw = thawer.get_kv (); |
740 | keyword kw = thawer.get_kv (); |
721 | |
741 | |
722 | switch (kw) |
742 | switch (kw) |
… | |
… | |
725 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
745 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
726 | return false; |
746 | return false; |
727 | |
747 | |
728 | case KW_end: |
748 | case KW_end: |
729 | return true; |
749 | return true; |
|
|
750 | |
|
|
751 | default: |
|
|
752 | case KW_ERROR: |
|
|
753 | LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword); |
|
|
754 | break; |
730 | |
755 | |
731 | case KW_msg: |
756 | case KW_msg: |
732 | thawer.get_ml (KW_endmsg, msg); |
757 | thawer.get_ml (KW_endmsg, msg); |
733 | break; |
758 | break; |
734 | |
759 | |
… | |
… | |
767 | case KW_sky: thawer.get (sky); break; |
792 | case KW_sky: thawer.get (sky); break; |
768 | |
793 | |
769 | case KW_per_player: thawer.get (per_player); break; |
794 | case KW_per_player: thawer.get (per_player); break; |
770 | case KW_per_party: thawer.get (per_party); break; |
795 | case KW_per_party: thawer.get (per_party); break; |
771 | |
796 | |
772 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
797 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
773 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
798 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
774 | |
799 | |
775 | // old names new names |
800 | // old names new names |
776 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
801 | 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; |
802 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
785 | |
810 | |
786 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
811 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
787 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
812 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
788 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
813 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
789 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
814 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
790 | |
|
|
791 | default: |
|
|
792 | LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); |
|
|
793 | break; |
|
|
794 | } |
815 | } |
795 | } |
816 | } |
796 | |
817 | |
797 | abort (); |
818 | abort (); |
798 | } |
819 | } |
799 | |
820 | |
800 | bool |
821 | bool |
801 | maptile::load_header (const char *path) |
822 | maptile::_load_header (const char *path) |
802 | { |
823 | { |
803 | object_thawer thawer (path); |
824 | object_thawer thawer (path); |
804 | |
825 | |
805 | if (!thawer) |
826 | if (!thawer) |
806 | return false; |
827 | return false; |
807 | |
828 | |
808 | return load_header (thawer); |
829 | return _load_header (thawer); |
809 | } |
830 | } |
810 | |
831 | |
811 | /****************************************************************************** |
832 | /****************************************************************************** |
812 | * This is the start of unique map handling code |
833 | * This is the start of unique map handling code |
813 | *****************************************************************************/ |
834 | *****************************************************************************/ |
… | |
… | |
836 | } |
857 | } |
837 | } |
858 | } |
838 | } |
859 | } |
839 | |
860 | |
840 | bool |
861 | bool |
841 | maptile::save_header (object_freezer &freezer) |
862 | maptile::_save_header (object_freezer &freezer) |
842 | { |
863 | { |
843 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
864 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
844 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
865 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
845 | |
866 | |
846 | MAP_OUT2 (arch, "map"); |
867 | MAP_OUT2 (arch, "map"); |
… | |
… | |
850 | MAP_OUT (reset_time); |
871 | MAP_OUT (reset_time); |
851 | MAP_OUT (reset_timeout); |
872 | MAP_OUT (reset_timeout); |
852 | MAP_OUT (fixed_resettime); |
873 | MAP_OUT (fixed_resettime); |
853 | MAP_OUT (difficulty); |
874 | MAP_OUT (difficulty); |
854 | |
875 | |
855 | if (region) MAP_OUT2 (region, region->name); |
876 | if (default_region) MAP_OUT2 (region, default_region->name); |
856 | |
877 | |
857 | if (shopitems) |
878 | if (shopitems) |
858 | { |
879 | { |
859 | char shop[MAX_BUF]; |
880 | char shop[MAX_BUF]; |
860 | print_shop_string (this, shop); |
881 | print_shop_string (this, shop); |
… | |
… | |
895 | |
916 | |
896 | return true; |
917 | return true; |
897 | } |
918 | } |
898 | |
919 | |
899 | bool |
920 | bool |
900 | maptile::save_header (const char *path) |
921 | maptile::_save_header (const char *path) |
901 | { |
922 | { |
902 | object_freezer freezer; |
923 | object_freezer freezer; |
903 | |
924 | |
904 | if (!save_header (freezer)) |
925 | if (!_save_header (freezer)) |
905 | return false; |
926 | return false; |
906 | |
927 | |
907 | return freezer.save (path); |
928 | return freezer.save (path); |
908 | } |
929 | } |
909 | |
930 | |
… | |
… | |
911 | * Remove and free all objects in the given map. |
932 | * Remove and free all objects in the given map. |
912 | */ |
933 | */ |
913 | void |
934 | void |
914 | maptile::clear () |
935 | maptile::clear () |
915 | { |
936 | { |
|
|
937 | sfree (regions, size ()), regions = 0; |
|
|
938 | free (regionmap), regionmap = 0; |
|
|
939 | |
916 | if (!spaces) |
940 | if (spaces) |
917 | return; |
941 | { |
918 | |
|
|
919 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
942 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
920 | while (object *op = ms->bot) |
943 | while (object *op = ms->bot) |
921 | { |
944 | { |
922 | if (op->head) |
945 | if (op->head) |
923 | op = op->head; |
946 | op = op->head; |
924 | |
947 | |
925 | op->destroy_inv (false); |
948 | op->destroy_inv (false); |
926 | op->destroy (); |
949 | op->destroy (); |
927 | } |
950 | } |
928 | |
951 | |
929 | sfree (spaces, size ()), spaces = 0; |
952 | sfree (spaces, size ()), spaces = 0; |
|
|
953 | } |
930 | |
954 | |
931 | if (buttons) |
955 | if (buttons) |
932 | free_objectlinkpt (buttons), buttons = 0; |
956 | free_objectlinkpt (buttons), buttons = 0; |
933 | } |
957 | } |
934 | |
958 | |
… | |
… | |
1088 | */ |
1112 | */ |
1089 | void |
1113 | void |
1090 | mapspace::update_ () |
1114 | mapspace::update_ () |
1091 | { |
1115 | { |
1092 | object *tmp, *last = 0; |
1116 | object *tmp, *last = 0; |
1093 | uint8 flags = 0, light = 0, anywhere = 0; |
1117 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1094 | New_Face *top, *floor, *middle; |
1118 | facetile *top, *floor, *middle; |
1095 | object *top_obj, *floor_obj, *middle_obj; |
1119 | object *top_obj, *floor_obj, *middle_obj; |
1096 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1120 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1097 | |
1121 | |
1098 | middle = blank_face; |
1122 | middle = blank_face; |
1099 | top = blank_face; |
1123 | top = blank_face; |
… | |
… | |
1215 | |
1239 | |
1216 | /* If two top faces are already set, quit processing */ |
1240 | /* If two top faces are already set, quit processing */ |
1217 | if ((top != blank_face) && (middle != blank_face)) |
1241 | if ((top != blank_face) && (middle != blank_face)) |
1218 | break; |
1242 | break; |
1219 | |
1243 | |
1220 | /* Only show visible faces, unless its the editor - show all */ |
1244 | /* Only show visible faces */ |
1221 | if (!tmp->invisible || editor) |
1245 | if (!tmp->invisible) |
1222 | { |
1246 | { |
1223 | /* Fill in top if needed */ |
1247 | /* Fill in top if needed */ |
1224 | if (top == blank_face) |
1248 | if (top == blank_face) |
1225 | { |
1249 | { |
1226 | top = tmp->face; |
1250 | top = tmp->face; |
… | |
… | |
1256 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1280 | 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; |
1281 | 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; |
1282 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1259 | } |
1283 | } |
1260 | |
1284 | |
1261 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1285 | /* 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 |
1286 | * 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 |
1287 | * 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 |
1288 | * the value of orig_map->tile_map[tile_num]. |
1265 | * so that it is easier for calling functions to verify success. |
|
|
1266 | */ |
1289 | */ |
1267 | static maptile * |
1290 | static inline maptile * |
1268 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
1291 | find_and_link (maptile *orig_map, int tile_num) |
1269 | { |
1292 | { |
|
|
1293 | maptile *mp = orig_map->tile_map [tile_num]; |
|
|
1294 | |
|
|
1295 | if (!mp) |
|
|
1296 | { |
1270 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1297 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
1271 | |
1298 | |
1272 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1299 | if (!mp) |
1273 | { |
1300 | { |
1274 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1301 | // 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", |
1302 | 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); |
1303 | &orig_map->tile_path[tile_num], &orig_map->path); |
1277 | mp = new maptile (1, 1); |
1304 | mp = new maptile (1, 1); |
1278 | mp->alloc (); |
1305 | mp->alloc (); |
1279 | mp->in_memory = MAP_IN_MEMORY; |
1306 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1307 | } |
1280 | } |
1308 | } |
1281 | |
1309 | |
1282 | int dest_tile = (tile_num + 2) % 4; |
1310 | int dest_tile = (tile_num + 2) % 4; |
1283 | |
1311 | |
1284 | orig_map->tile_map[tile_num] = mp; |
1312 | orig_map->tile_map [tile_num] = mp; |
1285 | |
1313 | |
1286 | // optimisation: back-link map to origin map if euclidean |
1314 | // optimisation: back-link map to origin map if euclidean |
1287 | //TODO: non-euclidean maps MUST GO |
1315 | //TODO: non-euclidean maps MUST GO |
1288 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1316 | 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; |
1317 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1290 | |
1318 | |
1291 | return mp; |
1319 | return mp; |
|
|
1320 | } |
|
|
1321 | |
|
|
1322 | static inline void |
|
|
1323 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1324 | { |
|
|
1325 | find_and_link (orig_map, tile_num)->load_sync (); |
1292 | } |
1326 | } |
1293 | |
1327 | |
1294 | /* this returns TRUE if the coordinates (x,y) are out of |
1328 | /* this returns TRUE if the coordinates (x,y) are out of |
1295 | * map m. This function also takes into account any |
1329 | * map m. This function also takes into account any |
1296 | * tiling considerations, loading adjacant maps as needed. |
1330 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1313 | { |
1347 | { |
1314 | if (!m->tile_path[3]) |
1348 | if (!m->tile_path[3]) |
1315 | return 1; |
1349 | return 1; |
1316 | |
1350 | |
1317 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1351 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1318 | load_and_link_tiled_map (m, 3); |
1352 | find_and_link (m, 3); |
1319 | |
1353 | |
1320 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1354 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1321 | } |
1355 | } |
1322 | |
1356 | |
1323 | if (x >= m->width) |
1357 | if (x >= m->width) |
1324 | { |
1358 | { |
1325 | if (!m->tile_path[1]) |
1359 | if (!m->tile_path[1]) |
1326 | return 1; |
1360 | return 1; |
1327 | |
1361 | |
1328 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1362 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1329 | load_and_link_tiled_map (m, 1); |
1363 | find_and_link (m, 1); |
1330 | |
1364 | |
1331 | return out_of_map (m->tile_map[1], x - m->width, y); |
1365 | return out_of_map (m->tile_map[1], x - m->width, y); |
1332 | } |
1366 | } |
1333 | |
1367 | |
1334 | if (y < 0) |
1368 | if (y < 0) |
1335 | { |
1369 | { |
1336 | if (!m->tile_path[0]) |
1370 | if (!m->tile_path[0]) |
1337 | return 1; |
1371 | return 1; |
1338 | |
1372 | |
1339 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1373 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1340 | load_and_link_tiled_map (m, 0); |
1374 | find_and_link (m, 0); |
1341 | |
1375 | |
1342 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1376 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1343 | } |
1377 | } |
1344 | |
1378 | |
1345 | if (y >= m->height) |
1379 | if (y >= m->height) |
1346 | { |
1380 | { |
1347 | if (!m->tile_path[2]) |
1381 | if (!m->tile_path[2]) |
1348 | return 1; |
1382 | return 1; |
1349 | |
1383 | |
1350 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1384 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1351 | load_and_link_tiled_map (m, 2); |
1385 | find_and_link (m, 2); |
1352 | |
1386 | |
1353 | return out_of_map (m->tile_map[2], x, y - m->height); |
1387 | return out_of_map (m->tile_map[2], x, y - m->height); |
1354 | } |
1388 | } |
1355 | |
1389 | |
1356 | /* Simple case - coordinates are within this local |
1390 | /* Simple case - coordinates are within this local |
… | |
… | |
1361 | |
1395 | |
1362 | /* This is basically the same as out_of_map above, but |
1396 | /* This is basically the same as out_of_map above, but |
1363 | * instead we return NULL if no map is valid (coordinates |
1397 | * instead we return NULL if no map is valid (coordinates |
1364 | * out of bounds and no tiled map), otherwise it returns |
1398 | * out of bounds and no tiled map), otherwise it returns |
1365 | * the map as that the coordinates are really on, and |
1399 | * the map as that the coordinates are really on, and |
1366 | * updates x and y to be the localized coordinates. |
1400 | * updates x and y to be the localised coordinates. |
1367 | * Using this is more efficient of calling out_of_map |
1401 | * Using this is more efficient of calling out_of_map |
1368 | * and then figuring out what the real map is |
1402 | * and then figuring out what the real map is |
1369 | */ |
1403 | */ |
1370 | maptile * |
1404 | maptile * |
1371 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1405 | maptile::xy_find (sint16 &x, sint16 &y) |
1372 | { |
1406 | { |
1373 | if (*x < 0) |
1407 | if (x < 0) |
1374 | { |
1408 | { |
1375 | if (!m->tile_path[3]) |
1409 | if (!tile_path[3]) |
1376 | return 0; |
1410 | return 0; |
1377 | |
1411 | |
1378 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1412 | find_and_link (this, 3); |
1379 | load_and_link_tiled_map (m, 3); |
|
|
1380 | |
|
|
1381 | *x += m->tile_map[3]->width; |
1413 | x += tile_map[3]->width; |
1382 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1414 | return tile_map[3]->xy_find (x, y); |
1383 | } |
1415 | } |
1384 | |
1416 | |
1385 | if (*x >= m->width) |
1417 | if (x >= width) |
1386 | { |
1418 | { |
1387 | if (!m->tile_path[1]) |
1419 | if (!tile_path[1]) |
1388 | return 0; |
1420 | return 0; |
1389 | |
1421 | |
1390 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1422 | find_and_link (this, 1); |
1391 | load_and_link_tiled_map (m, 1); |
|
|
1392 | |
|
|
1393 | *x -= m->width; |
1423 | x -= width; |
1394 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1424 | return tile_map[1]->xy_find (x, y); |
1395 | } |
1425 | } |
1396 | |
1426 | |
1397 | if (*y < 0) |
1427 | if (y < 0) |
1398 | { |
1428 | { |
1399 | if (!m->tile_path[0]) |
1429 | if (!tile_path[0]) |
1400 | return 0; |
1430 | return 0; |
1401 | |
1431 | |
1402 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1432 | find_and_link (this, 0); |
1403 | load_and_link_tiled_map (m, 0); |
|
|
1404 | |
|
|
1405 | *y += m->tile_map[0]->height; |
1433 | y += tile_map[0]->height; |
1406 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1434 | return tile_map[0]->xy_find (x, y); |
1407 | } |
1435 | } |
1408 | |
1436 | |
1409 | if (*y >= m->height) |
1437 | if (y >= height) |
1410 | { |
1438 | { |
1411 | if (!m->tile_path[2]) |
1439 | if (!tile_path[2]) |
1412 | return 0; |
1440 | return 0; |
1413 | |
1441 | |
1414 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1442 | find_and_link (this, 2); |
1415 | load_and_link_tiled_map (m, 2); |
|
|
1416 | |
|
|
1417 | *y -= m->height; |
1443 | y -= height; |
1418 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1444 | return tile_map[2]->xy_find (x, y); |
1419 | } |
1445 | } |
1420 | |
1446 | |
1421 | /* Simple case - coordinates are within this local |
1447 | /* Simple case - coordinates are within this local |
1422 | * map. |
1448 | * map. |
1423 | */ |
1449 | */ |
1424 | return m; |
1450 | return this; |
1425 | } |
1451 | } |
1426 | |
1452 | |
1427 | /** |
1453 | /** |
1428 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1454 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1429 | * map1 to map2 in dx/dy. |
1455 | * map1 to map2 in dx/dy. |
… | |
… | |
1432 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1458 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1433 | { |
1459 | { |
1434 | if (!map1 || !map2) |
1460 | if (!map1 || !map2) |
1435 | return 0; |
1461 | return 0; |
1436 | |
1462 | |
|
|
1463 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
|
|
1464 | //fix: compare paths instead (this is likely faster, too!) |
1437 | if (map1 == map2) |
1465 | if (map1 == map2) |
1438 | { |
1466 | { |
1439 | *dx = 0; |
1467 | *dx = 0; |
1440 | *dy = 0; |
1468 | *dy = 0; |
1441 | } |
1469 | } |
… | |
… | |
1501 | } |
1529 | } |
1502 | else |
1530 | else |
1503 | return 0; |
1531 | return 0; |
1504 | |
1532 | |
1505 | return 1; |
1533 | return 1; |
|
|
1534 | } |
|
|
1535 | |
|
|
1536 | maptile * |
|
|
1537 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1538 | { |
|
|
1539 | maptile *map = xy_find (x, y); |
|
|
1540 | |
|
|
1541 | if (map) |
|
|
1542 | map->load_sync (); |
|
|
1543 | |
|
|
1544 | return map; |
|
|
1545 | } |
|
|
1546 | |
|
|
1547 | maptile * |
|
|
1548 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1549 | { |
|
|
1550 | return m->xy_load (*x, *y); |
1506 | } |
1551 | } |
1507 | |
1552 | |
1508 | /* From map.c |
1553 | /* From map.c |
1509 | * This is used by get_player to determine where the other |
1554 | * This is used by get_player to determine where the other |
1510 | * creature is. get_rangevector takes into account map tiling, |
1555 | * creature is. get_rangevector takes into account map tiling, |
1511 | * so you just can not look the the map coordinates and get the |
1556 | * so you just can not look the the map coordinates and get the |
1512 | * righte value. distance_x/y are distance away, which |
1557 | * righte value. distance_x/y are distance away, which |
1513 | * can be negativbe. direction is the crossfire direction scheme |
1558 | * can be negative. direction is the crossfire direction scheme |
1514 | * that the creature should head. part is the part of the |
1559 | * that the creature should head. part is the part of the |
1515 | * monster that is closest. |
1560 | * monster that is closest. |
1516 | * |
1561 | * |
1517 | * get_rangevector looks at op1 and op2, and fills in the |
1562 | * get_rangevector looks at op1 and op2, and fills in the |
1518 | * structure for op1 to get to op2. |
1563 | * structure for op1 to get to op2. |
… | |
… | |
1565 | { |
1610 | { |
1566 | best_distance = tmpi; |
1611 | best_distance = tmpi; |
1567 | best = tmp; |
1612 | best = tmp; |
1568 | } |
1613 | } |
1569 | } |
1614 | } |
|
|
1615 | |
1570 | if (best != op1) |
1616 | if (best != op1) |
1571 | { |
1617 | { |
1572 | retval->distance_x += op1->x - best->x; |
1618 | retval->distance_x += op1->x - best->x; |
1573 | retval->distance_y += op1->y - best->y; |
1619 | retval->distance_y += op1->y - best->y; |
1574 | } |
1620 | } |
1575 | } |
1621 | } |
|
|
1622 | |
1576 | retval->part = best; |
1623 | retval->part = best; |
1577 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1624 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1578 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1625 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1579 | } |
1626 | } |
1580 | } |
1627 | } |
1581 | |
1628 | |
1582 | /* this is basically the same as get_rangevector above, but instead of |
1629 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1606 | { |
1653 | { |
1607 | retval->distance_x += op2->x - x; |
1654 | retval->distance_x += op2->x - x; |
1608 | retval->distance_y += op2->y - y; |
1655 | retval->distance_y += op2->y - y; |
1609 | |
1656 | |
1610 | retval->part = NULL; |
1657 | retval->part = NULL; |
1611 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1658 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1612 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1659 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1613 | } |
1660 | } |
1614 | } |
1661 | } |
1615 | |
1662 | |
1616 | /* Returns true of op1 and op2 are effectively on the same map |
1663 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1636 | op->remove (); |
1683 | op->remove (); |
1637 | |
1684 | |
1638 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1685 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1639 | } |
1686 | } |
1640 | |
1687 | |
|
|
1688 | region * |
|
|
1689 | maptile::region (int x, int y) const |
|
|
1690 | { |
|
|
1691 | if (regions |
|
|
1692 | && regionmap |
|
|
1693 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1694 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1695 | return reg; |
|
|
1696 | |
|
|
1697 | if (default_region) |
|
|
1698 | return default_region; |
|
|
1699 | |
|
|
1700 | return ::region::default_region (); |
|
|
1701 | } |
|
|
1702 | |