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 |
… | |
… | |
399 | * 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 |
400 | * file pointer. |
400 | * file pointer. |
401 | * mapflags is the same as we get with load_original_map |
401 | * mapflags is the same as we get with load_original_map |
402 | */ |
402 | */ |
403 | bool |
403 | bool |
404 | maptile::load_objects (object_thawer &thawer) |
404 | maptile::_load_objects (object_thawer &thawer) |
405 | { |
405 | { |
406 | int unique; |
406 | int unique; |
407 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
407 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
408 | |
408 | |
409 | op = object::create (); |
409 | op = object::create (); |
… | |
… | |
485 | for (object *op = ms->bot; op; op = op->above) |
485 | for (object *op = ms->bot; op; op = op->above) |
486 | op->deactivate_recursive (); |
486 | op->deactivate_recursive (); |
487 | } |
487 | } |
488 | |
488 | |
489 | bool |
489 | bool |
490 | maptile::save_objects (object_freezer &freezer, int flags) |
490 | maptile::_save_objects (object_freezer &freezer, int flags) |
491 | { |
491 | { |
492 | static int cede_count = 0; |
492 | static int cede_count = 0; |
493 | |
493 | |
494 | if (flags & IO_HEADER) |
494 | if (flags & IO_HEADER) |
495 | save_header (freezer); |
495 | _save_header (freezer); |
496 | |
496 | |
497 | if (!spaces) |
497 | if (!spaces) |
498 | return false; |
498 | return false; |
499 | |
499 | |
500 | for (int i = 0; i < size (); ++i) |
500 | for (int i = 0; i < size (); ++i) |
501 | { |
501 | { |
|
|
502 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
502 | if (cede_count >= 500) |
503 | if (cede_count >= 500) |
503 | { |
504 | { |
504 | cede_count = 0; |
505 | cede_count = 0; |
505 | coroapi::cede (); |
506 | coroapi::cede (); |
506 | } |
507 | } |
|
|
508 | #endif |
507 | |
509 | |
508 | int unique = 0; |
510 | int unique = 0; |
509 | for (object *op = spaces [i].bot; op; op = op->above) |
511 | for (object *op = spaces [i].bot; op; op = op->above) |
510 | { |
512 | { |
511 | // count per-object, but cede only when modification-safe |
513 | // count per-object, but cede only when modification-safe |
… | |
… | |
529 | |
531 | |
530 | return true; |
532 | return true; |
531 | } |
533 | } |
532 | |
534 | |
533 | bool |
535 | bool |
534 | maptile::load_objects (const char *path, bool skip_header) |
536 | maptile::_load_objects (const char *path, bool skip_header) |
535 | { |
537 | { |
536 | object_thawer thawer (path); |
538 | object_thawer thawer (path); |
537 | |
539 | |
538 | if (!thawer) |
540 | if (!thawer) |
539 | return false; |
541 | return false; |
… | |
… | |
547 | break; |
549 | break; |
548 | |
550 | |
549 | thawer.skip_kv (kw); |
551 | thawer.skip_kv (kw); |
550 | } |
552 | } |
551 | |
553 | |
552 | return load_objects (thawer); |
554 | return _load_objects (thawer); |
553 | } |
555 | } |
554 | |
556 | |
555 | bool |
557 | bool |
556 | maptile::save_objects (const char *path, int flags) |
558 | maptile::_save_objects (const char *path, int flags) |
557 | { |
559 | { |
558 | object_freezer freezer; |
560 | object_freezer freezer; |
559 | |
561 | |
560 | if (!save_objects (freezer, flags)) |
562 | if (!_save_objects (freezer, flags)) |
561 | return false; |
563 | return false; |
562 | |
564 | |
563 | return freezer.save (path); |
565 | return freezer.save (path); |
564 | } |
566 | } |
565 | |
567 | |
… | |
… | |
729 | * 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 |
730 | * 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. |
731 | * MSW 2001-07-01 |
733 | * MSW 2001-07-01 |
732 | */ |
734 | */ |
733 | bool |
735 | bool |
734 | maptile::load_header (object_thawer &thawer) |
736 | maptile::_load_header (object_thawer &thawer) |
735 | { |
737 | { |
736 | char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; |
|
|
737 | int msgpos = 0; |
|
|
738 | int maplorepos = 0; |
|
|
739 | |
|
|
740 | for (;;) |
738 | for (;;) |
741 | { |
739 | { |
742 | keyword kw = thawer.get_kv (); |
740 | keyword kw = thawer.get_kv (); |
743 | |
741 | |
744 | switch (kw) |
742 | switch (kw) |
… | |
… | |
747 | 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); |
748 | return false; |
746 | return false; |
749 | |
747 | |
750 | case KW_end: |
748 | case KW_end: |
751 | 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; |
752 | |
755 | |
753 | case KW_msg: |
756 | case KW_msg: |
754 | thawer.get_ml (KW_endmsg, msg); |
757 | thawer.get_ml (KW_endmsg, msg); |
755 | break; |
758 | break; |
756 | |
759 | |
… | |
… | |
807 | |
810 | |
808 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
811 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
809 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
812 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
810 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
813 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
811 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
814 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
812 | |
|
|
813 | default: |
|
|
814 | LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); |
|
|
815 | break; |
|
|
816 | } |
815 | } |
817 | } |
816 | } |
818 | |
817 | |
819 | abort (); |
818 | abort (); |
820 | } |
819 | } |
821 | |
820 | |
822 | bool |
821 | bool |
823 | maptile::load_header (const char *path) |
822 | maptile::_load_header (const char *path) |
824 | { |
823 | { |
825 | object_thawer thawer (path); |
824 | object_thawer thawer (path); |
826 | |
825 | |
827 | if (!thawer) |
826 | if (!thawer) |
828 | return false; |
827 | return false; |
829 | |
828 | |
830 | return load_header (thawer); |
829 | return _load_header (thawer); |
831 | } |
830 | } |
832 | |
831 | |
833 | /****************************************************************************** |
832 | /****************************************************************************** |
834 | * This is the start of unique map handling code |
833 | * This is the start of unique map handling code |
835 | *****************************************************************************/ |
834 | *****************************************************************************/ |
… | |
… | |
858 | } |
857 | } |
859 | } |
858 | } |
860 | } |
859 | } |
861 | |
860 | |
862 | bool |
861 | bool |
863 | maptile::save_header (object_freezer &freezer) |
862 | maptile::_save_header (object_freezer &freezer) |
864 | { |
863 | { |
865 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
864 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
866 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
865 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
867 | |
866 | |
868 | MAP_OUT2 (arch, "map"); |
867 | MAP_OUT2 (arch, "map"); |
… | |
… | |
917 | |
916 | |
918 | return true; |
917 | return true; |
919 | } |
918 | } |
920 | |
919 | |
921 | bool |
920 | bool |
922 | maptile::save_header (const char *path) |
921 | maptile::_save_header (const char *path) |
923 | { |
922 | { |
924 | object_freezer freezer; |
923 | object_freezer freezer; |
925 | |
924 | |
926 | if (!save_header (freezer)) |
925 | if (!_save_header (freezer)) |
927 | return false; |
926 | return false; |
928 | |
927 | |
929 | return freezer.save (path); |
928 | return freezer.save (path); |
930 | } |
929 | } |
931 | |
930 | |
… | |
… | |
1110 | */ |
1109 | */ |
1111 | void |
1110 | void |
1112 | mapspace::update_ () |
1111 | mapspace::update_ () |
1113 | { |
1112 | { |
1114 | object *tmp, *last = 0; |
1113 | object *tmp, *last = 0; |
1115 | uint8 flags = 0, light = 0, anywhere = 0; |
1114 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1116 | New_Face *top, *floor, *middle; |
1115 | facetile *top, *floor, *middle; |
1117 | object *top_obj, *floor_obj, *middle_obj; |
1116 | object *top_obj, *floor_obj, *middle_obj; |
1118 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1117 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1119 | |
1118 | |
1120 | middle = blank_face; |
1119 | middle = blank_face; |
1121 | top = blank_face; |
1120 | top = blank_face; |
… | |
… | |
1237 | |
1236 | |
1238 | /* If two top faces are already set, quit processing */ |
1237 | /* If two top faces are already set, quit processing */ |
1239 | if ((top != blank_face) && (middle != blank_face)) |
1238 | if ((top != blank_face) && (middle != blank_face)) |
1240 | break; |
1239 | break; |
1241 | |
1240 | |
1242 | /* Only show visible faces, unless its the editor - show all */ |
1241 | /* Only show visible faces */ |
1243 | if (!tmp->invisible || editor) |
1242 | if (!tmp->invisible) |
1244 | { |
1243 | { |
1245 | /* Fill in top if needed */ |
1244 | /* Fill in top if needed */ |
1246 | if (top == blank_face) |
1245 | if (top == blank_face) |
1247 | { |
1246 | { |
1248 | top = tmp->face; |
1247 | top = tmp->face; |
… | |
… | |
1278 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1277 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1279 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1278 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1280 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1279 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1281 | } |
1280 | } |
1282 | |
1281 | |
1283 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1282 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1284 | * the map. It also takes care of linking back the freshly loaded |
1283 | * the map. It also takes care of linking back the freshly found |
1285 | * maps tile_map values if it tiles back to this one. It returns |
1284 | * maps tile_map values if it tiles back to this one. It returns |
1286 | * the value of orig_map->tile_map[tile_num]. It really only does this |
1285 | * the value of orig_map->tile_map[tile_num]. |
1287 | * so that it is easier for calling functions to verify success. |
|
|
1288 | */ |
1286 | */ |
1289 | static maptile * |
1287 | static inline maptile * |
1290 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
1288 | find_and_link (maptile *orig_map, int tile_num) |
1291 | { |
1289 | { |
|
|
1290 | maptile *mp = orig_map->tile_map [tile_num]; |
|
|
1291 | |
|
|
1292 | if (!mp) |
|
|
1293 | { |
1292 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1294 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
1293 | |
1295 | |
1294 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1296 | if (!mp) |
1295 | { |
1297 | { |
1296 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1298 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1297 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
1299 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
1298 | &orig_map->tile_path[tile_num], &orig_map->path); |
1300 | &orig_map->tile_path[tile_num], &orig_map->path); |
1299 | mp = new maptile (1, 1); |
1301 | mp = new maptile (1, 1); |
1300 | mp->alloc (); |
1302 | mp->alloc (); |
1301 | mp->in_memory = MAP_IN_MEMORY; |
1303 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1304 | } |
1302 | } |
1305 | } |
1303 | |
1306 | |
1304 | int dest_tile = (tile_num + 2) % 4; |
1307 | int dest_tile = (tile_num + 2) % 4; |
1305 | |
1308 | |
1306 | orig_map->tile_map[tile_num] = mp; |
1309 | orig_map->tile_map [tile_num] = mp; |
1307 | |
1310 | |
1308 | // optimisation: back-link map to origin map if euclidean |
1311 | // optimisation: back-link map to origin map if euclidean |
1309 | //TODO: non-euclidean maps MUST GO |
1312 | //TODO: non-euclidean maps MUST GO |
1310 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1313 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1311 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1314 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1312 | |
1315 | |
1313 | return mp; |
1316 | return mp; |
|
|
1317 | } |
|
|
1318 | |
|
|
1319 | static inline void |
|
|
1320 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1321 | { |
|
|
1322 | find_and_link (orig_map, tile_num)->load_sync (); |
1314 | } |
1323 | } |
1315 | |
1324 | |
1316 | /* this returns TRUE if the coordinates (x,y) are out of |
1325 | /* this returns TRUE if the coordinates (x,y) are out of |
1317 | * map m. This function also takes into account any |
1326 | * map m. This function also takes into account any |
1318 | * tiling considerations, loading adjacant maps as needed. |
1327 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1335 | { |
1344 | { |
1336 | if (!m->tile_path[3]) |
1345 | if (!m->tile_path[3]) |
1337 | return 1; |
1346 | return 1; |
1338 | |
1347 | |
1339 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1348 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1340 | load_and_link_tiled_map (m, 3); |
1349 | find_and_link (m, 3); |
1341 | |
1350 | |
1342 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1351 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1343 | } |
1352 | } |
1344 | |
1353 | |
1345 | if (x >= m->width) |
1354 | if (x >= m->width) |
1346 | { |
1355 | { |
1347 | if (!m->tile_path[1]) |
1356 | if (!m->tile_path[1]) |
1348 | return 1; |
1357 | return 1; |
1349 | |
1358 | |
1350 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1359 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1351 | load_and_link_tiled_map (m, 1); |
1360 | find_and_link (m, 1); |
1352 | |
1361 | |
1353 | return out_of_map (m->tile_map[1], x - m->width, y); |
1362 | return out_of_map (m->tile_map[1], x - m->width, y); |
1354 | } |
1363 | } |
1355 | |
1364 | |
1356 | if (y < 0) |
1365 | if (y < 0) |
1357 | { |
1366 | { |
1358 | if (!m->tile_path[0]) |
1367 | if (!m->tile_path[0]) |
1359 | return 1; |
1368 | return 1; |
1360 | |
1369 | |
1361 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1370 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1362 | load_and_link_tiled_map (m, 0); |
1371 | find_and_link (m, 0); |
1363 | |
1372 | |
1364 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1373 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1365 | } |
1374 | } |
1366 | |
1375 | |
1367 | if (y >= m->height) |
1376 | if (y >= m->height) |
1368 | { |
1377 | { |
1369 | if (!m->tile_path[2]) |
1378 | if (!m->tile_path[2]) |
1370 | return 1; |
1379 | return 1; |
1371 | |
1380 | |
1372 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1381 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1373 | load_and_link_tiled_map (m, 2); |
1382 | find_and_link (m, 2); |
1374 | |
1383 | |
1375 | return out_of_map (m->tile_map[2], x, y - m->height); |
1384 | return out_of_map (m->tile_map[2], x, y - m->height); |
1376 | } |
1385 | } |
1377 | |
1386 | |
1378 | /* Simple case - coordinates are within this local |
1387 | /* Simple case - coordinates are within this local |
… | |
… | |
1383 | |
1392 | |
1384 | /* This is basically the same as out_of_map above, but |
1393 | /* This is basically the same as out_of_map above, but |
1385 | * instead we return NULL if no map is valid (coordinates |
1394 | * instead we return NULL if no map is valid (coordinates |
1386 | * out of bounds and no tiled map), otherwise it returns |
1395 | * out of bounds and no tiled map), otherwise it returns |
1387 | * the map as that the coordinates are really on, and |
1396 | * the map as that the coordinates are really on, and |
1388 | * updates x and y to be the localized coordinates. |
1397 | * updates x and y to be the localised coordinates. |
1389 | * Using this is more efficient of calling out_of_map |
1398 | * Using this is more efficient of calling out_of_map |
1390 | * and then figuring out what the real map is |
1399 | * and then figuring out what the real map is |
1391 | */ |
1400 | */ |
1392 | maptile * |
1401 | maptile * |
1393 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1402 | maptile::xy_find (sint16 &x, sint16 &y) |
1394 | { |
1403 | { |
1395 | if (*x < 0) |
1404 | if (x < 0) |
1396 | { |
1405 | { |
1397 | if (!m->tile_path[3]) |
1406 | if (!tile_path[3]) |
1398 | return 0; |
1407 | return 0; |
1399 | |
1408 | |
1400 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1409 | find_and_link (this, 3); |
1401 | load_and_link_tiled_map (m, 3); |
|
|
1402 | |
|
|
1403 | *x += m->tile_map[3]->width; |
1410 | x += tile_map[3]->width; |
1404 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1411 | return tile_map[3]->xy_find (x, y); |
1405 | } |
1412 | } |
1406 | |
1413 | |
1407 | if (*x >= m->width) |
1414 | if (x >= width) |
1408 | { |
1415 | { |
1409 | if (!m->tile_path[1]) |
1416 | if (!tile_path[1]) |
1410 | return 0; |
1417 | return 0; |
1411 | |
1418 | |
1412 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1419 | find_and_link (this, 1); |
1413 | load_and_link_tiled_map (m, 1); |
|
|
1414 | |
|
|
1415 | *x -= m->width; |
1420 | x -= width; |
1416 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1421 | return tile_map[1]->xy_find (x, y); |
1417 | } |
1422 | } |
1418 | |
1423 | |
1419 | if (*y < 0) |
1424 | if (y < 0) |
1420 | { |
1425 | { |
1421 | if (!m->tile_path[0]) |
1426 | if (!tile_path[0]) |
1422 | return 0; |
1427 | return 0; |
1423 | |
1428 | |
1424 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1429 | find_and_link (this, 0); |
1425 | load_and_link_tiled_map (m, 0); |
|
|
1426 | |
|
|
1427 | *y += m->tile_map[0]->height; |
1430 | y += tile_map[0]->height; |
1428 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1431 | return tile_map[0]->xy_find (x, y); |
1429 | } |
1432 | } |
1430 | |
1433 | |
1431 | if (*y >= m->height) |
1434 | if (y >= height) |
1432 | { |
1435 | { |
1433 | if (!m->tile_path[2]) |
1436 | if (!tile_path[2]) |
1434 | return 0; |
1437 | return 0; |
1435 | |
1438 | |
1436 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1439 | find_and_link (this, 2); |
1437 | load_and_link_tiled_map (m, 2); |
|
|
1438 | |
|
|
1439 | *y -= m->height; |
1440 | y -= height; |
1440 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1441 | return tile_map[2]->xy_find (x, y); |
1441 | } |
1442 | } |
1442 | |
1443 | |
1443 | /* Simple case - coordinates are within this local |
1444 | /* Simple case - coordinates are within this local |
1444 | * map. |
1445 | * map. |
1445 | */ |
1446 | */ |
1446 | return m; |
1447 | return this; |
1447 | } |
1448 | } |
1448 | |
1449 | |
1449 | /** |
1450 | /** |
1450 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1451 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1451 | * map1 to map2 in dx/dy. |
1452 | * map1 to map2 in dx/dy. |
… | |
… | |
1454 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1455 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1455 | { |
1456 | { |
1456 | if (!map1 || !map2) |
1457 | if (!map1 || !map2) |
1457 | return 0; |
1458 | return 0; |
1458 | |
1459 | |
|
|
1460 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
|
|
1461 | //fix: compare paths instead (this is likely faster, too!) |
1459 | if (map1 == map2) |
1462 | if (map1 == map2) |
1460 | { |
1463 | { |
1461 | *dx = 0; |
1464 | *dx = 0; |
1462 | *dy = 0; |
1465 | *dy = 0; |
1463 | } |
1466 | } |
… | |
… | |
1523 | } |
1526 | } |
1524 | else |
1527 | else |
1525 | return 0; |
1528 | return 0; |
1526 | |
1529 | |
1527 | return 1; |
1530 | return 1; |
|
|
1531 | } |
|
|
1532 | |
|
|
1533 | maptile * |
|
|
1534 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1535 | { |
|
|
1536 | maptile *map = xy_find (x, y); |
|
|
1537 | |
|
|
1538 | if (map) |
|
|
1539 | map->load_sync (); |
|
|
1540 | |
|
|
1541 | return map; |
|
|
1542 | } |
|
|
1543 | |
|
|
1544 | maptile * |
|
|
1545 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1546 | { |
|
|
1547 | return m->xy_load (*x, *y); |
1528 | } |
1548 | } |
1529 | |
1549 | |
1530 | /* From map.c |
1550 | /* From map.c |
1531 | * This is used by get_player to determine where the other |
1551 | * This is used by get_player to determine where the other |
1532 | * creature is. get_rangevector takes into account map tiling, |
1552 | * creature is. get_rangevector takes into account map tiling, |
1533 | * so you just can not look the the map coordinates and get the |
1553 | * so you just can not look the the map coordinates and get the |
1534 | * righte value. distance_x/y are distance away, which |
1554 | * righte value. distance_x/y are distance away, which |
1535 | * can be negativbe. direction is the crossfire direction scheme |
1555 | * can be negative. direction is the crossfire direction scheme |
1536 | * that the creature should head. part is the part of the |
1556 | * that the creature should head. part is the part of the |
1537 | * monster that is closest. |
1557 | * monster that is closest. |
1538 | * |
1558 | * |
1539 | * get_rangevector looks at op1 and op2, and fills in the |
1559 | * get_rangevector looks at op1 and op2, and fills in the |
1540 | * structure for op1 to get to op2. |
1560 | * structure for op1 to get to op2. |
… | |
… | |
1587 | { |
1607 | { |
1588 | best_distance = tmpi; |
1608 | best_distance = tmpi; |
1589 | best = tmp; |
1609 | best = tmp; |
1590 | } |
1610 | } |
1591 | } |
1611 | } |
|
|
1612 | |
1592 | if (best != op1) |
1613 | if (best != op1) |
1593 | { |
1614 | { |
1594 | retval->distance_x += op1->x - best->x; |
1615 | retval->distance_x += op1->x - best->x; |
1595 | retval->distance_y += op1->y - best->y; |
1616 | retval->distance_y += op1->y - best->y; |
1596 | } |
1617 | } |
1597 | } |
1618 | } |
|
|
1619 | |
1598 | retval->part = best; |
1620 | retval->part = best; |
1599 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1621 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1600 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1622 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1601 | } |
1623 | } |
1602 | } |
1624 | } |
1603 | |
1625 | |
1604 | /* this is basically the same as get_rangevector above, but instead of |
1626 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1628 | { |
1650 | { |
1629 | retval->distance_x += op2->x - x; |
1651 | retval->distance_x += op2->x - x; |
1630 | retval->distance_y += op2->y - y; |
1652 | retval->distance_y += op2->y - y; |
1631 | |
1653 | |
1632 | retval->part = NULL; |
1654 | retval->part = NULL; |
1633 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1655 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1634 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1656 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1635 | } |
1657 | } |
1636 | } |
1658 | } |
1637 | |
1659 | |
1638 | /* Returns true of op1 and op2 are effectively on the same map |
1660 | /* Returns true of op1 and op2 are effectively on the same map |