ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.64 by root, Mon Jan 1 12:28:45 2007 UTC vs.
Revision 1.82 by root, Mon Jan 29 16:11:48 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 23 */
23 24
24#include <global.h> 25#include <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 */
403bool 403bool
404maptile::load_objects (object_thawer &thawer) 404maptile::_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
489bool 489bool
490maptile::save_objects (object_freezer &freezer, int flags) 490maptile::_save_objects (object_freezer &freezer, int flags)
491{ 491{
492 static int cede_count = 0;
493
492 if (flags & IO_HEADER) 494 if (flags & IO_HEADER)
493 save_header (freezer); 495 _save_header (freezer);
494 496
495 if (!spaces) 497 if (!spaces)
496 return false; 498 return false;
497 499
498 for (int i = 0; i < size (); ++i) 500 for (int i = 0; i < size (); ++i)
499 { 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
500 int unique = 0; 510 int unique = 0;
501 for (object *op = spaces [i].bot; op; op = op->above) 511 for (object *op = spaces [i].bot; op; op = op->above)
502 { 512 {
513 // count per-object, but cede only when modification-safe
514 cede_count++;
515
503 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 516 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
504 unique = 1; 517 unique = 1;
505 518
506 if (!op->can_map_save ()) 519 if (!op->can_map_save ())
507 continue; 520 continue;
… …
518 531
519 return true; 532 return true;
520} 533}
521 534
522bool 535bool
523maptile::load_objects (const char *path, bool skip_header) 536maptile::_load_objects (const char *path, bool skip_header)
524{ 537{
525 object_thawer thawer (path); 538 object_thawer thawer (path);
526 539
527 if (!thawer) 540 if (!thawer)
528 return false; 541 return false;
… …
536 break; 549 break;
537 550
538 thawer.skip_kv (kw); 551 thawer.skip_kv (kw);
539 } 552 }
540 553
541 return load_objects (thawer); 554 return _load_objects (thawer);
542} 555}
543 556
544bool 557bool
545maptile::save_objects (const char *path, int flags) 558maptile::_save_objects (const char *path, int flags)
546{ 559{
547 object_freezer freezer; 560 object_freezer freezer;
548 561
549 if (!save_objects (freezer, flags)) 562 if (!_save_objects (freezer, flags))
550 return false; 563 return false;
551 564
552 return freezer.save (path); 565 return freezer.save (path);
553} 566}
554 567
… …
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 */
722bool 735bool
723maptile::load_header (object_thawer &thawer) 736maptile::_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)
… …
736 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);
737 return false; 746 return false;
738 747
739 case KW_end: 748 case KW_end:
740 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;
741 755
742 case KW_msg: 756 case KW_msg:
743 thawer.get_ml (KW_endmsg, msg); 757 thawer.get_ml (KW_endmsg, msg);
744 break; 758 break;
745 759
… …
778 case KW_sky: thawer.get (sky); break; 792 case KW_sky: thawer.get (sky); break;
779 793
780 case KW_per_player: thawer.get (per_player); break; 794 case KW_per_player: thawer.get (per_player); break;
781 case KW_per_party: thawer.get (per_party); break; 795 case KW_per_party: thawer.get (per_party); break;
782 796
783 case KW_region: get_region_by_name (thawer.get_str ()); break; 797 case KW_region: default_region = region::find (thawer.get_str ()); break;
784 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 798 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
785 799
786 // old names new names 800 // old names new names
787 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;
788 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;
… …
796 810
797 case KW_tile_path_1: thawer.get (tile_path [0]); break; 811 case KW_tile_path_1: thawer.get (tile_path [0]); break;
798 case KW_tile_path_2: thawer.get (tile_path [1]); break; 812 case KW_tile_path_2: thawer.get (tile_path [1]); break;
799 case KW_tile_path_3: thawer.get (tile_path [2]); break; 813 case KW_tile_path_3: thawer.get (tile_path [2]); break;
800 case KW_tile_path_4: thawer.get (tile_path [3]); break; 814 case KW_tile_path_4: thawer.get (tile_path [3]); break;
801
802 default:
803 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]);
804 break;
805 } 815 }
806 } 816 }
807 817
808 abort (); 818 abort ();
809} 819}
810 820
811bool 821bool
812maptile::load_header (const char *path) 822maptile::_load_header (const char *path)
813{ 823{
814 object_thawer thawer (path); 824 object_thawer thawer (path);
815 825
816 if (!thawer) 826 if (!thawer)
817 return false; 827 return false;
818 828
819 return load_header (thawer); 829 return _load_header (thawer);
820} 830}
821 831
822/****************************************************************************** 832/******************************************************************************
823 * This is the start of unique map handling code 833 * This is the start of unique map handling code
824 *****************************************************************************/ 834 *****************************************************************************/
… …
847 } 857 }
848 } 858 }
849} 859}
850 860
851bool 861bool
852maptile::save_header (object_freezer &freezer) 862maptile::_save_header (object_freezer &freezer)
853{ 863{
854#define MAP_OUT(k) freezer.put (KW_ ## k, k) 864#define MAP_OUT(k) freezer.put (KW_ ## k, k)
855#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 865#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
856 866
857 MAP_OUT2 (arch, "map"); 867 MAP_OUT2 (arch, "map");
… …
861 MAP_OUT (reset_time); 871 MAP_OUT (reset_time);
862 MAP_OUT (reset_timeout); 872 MAP_OUT (reset_timeout);
863 MAP_OUT (fixed_resettime); 873 MAP_OUT (fixed_resettime);
864 MAP_OUT (difficulty); 874 MAP_OUT (difficulty);
865 875
866 if (region) MAP_OUT2 (region, region->name); 876 if (default_region) MAP_OUT2 (region, default_region->name);
867 877
868 if (shopitems) 878 if (shopitems)
869 { 879 {
870 char shop[MAX_BUF]; 880 char shop[MAX_BUF];
871 print_shop_string (this, shop); 881 print_shop_string (this, shop);
… …
906 916
907 return true; 917 return true;
908} 918}
909 919
910bool 920bool
911maptile::save_header (const char *path) 921maptile::_save_header (const char *path)
912{ 922{
913 object_freezer freezer; 923 object_freezer freezer;
914 924
915 if (!save_header (freezer)) 925 if (!_save_header (freezer))
916 return false; 926 return false;
917 927
918 return freezer.save (path); 928 return freezer.save (path);
919} 929}
920 930
… …
922 * Remove and free all objects in the given map. 932 * Remove and free all objects in the given map.
923 */ 933 */
924void 934void
925maptile::clear () 935maptile::clear ()
926{ 936{
937 sfree (regions, size ()), regions = 0;
938 free (regionmap), regionmap = 0;
939
927 if (!spaces) 940 if (spaces)
928 return; 941 {
929
930 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 942 for (mapspace *ms = spaces + size (); ms-- > spaces; )
931 while (object *op = ms->bot) 943 while (object *op = ms->bot)
932 { 944 {
933 if (op->head) 945 if (op->head)
934 op = op->head; 946 op = op->head;
935 947
936 op->destroy_inv (false); 948 op->destroy_inv (false);
937 op->destroy (); 949 op->destroy ();
938 } 950 }
939 951
940 sfree (spaces, size ()), spaces = 0; 952 sfree (spaces, size ()), spaces = 0;
953 }
941 954
942 if (buttons) 955 if (buttons)
943 free_objectlinkpt (buttons), buttons = 0; 956 free_objectlinkpt (buttons), buttons = 0;
944} 957}
945 958
… …
1099 */ 1112 */
1100void 1113void
1101mapspace::update_ () 1114mapspace::update_ ()
1102{ 1115{
1103 object *tmp, *last = 0; 1116 object *tmp, *last = 0;
1104 uint8 flags = 0, light = 0, anywhere = 0; 1117 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1105 New_Face *top, *floor, *middle; 1118 facetile *top, *floor, *middle;
1106 object *top_obj, *floor_obj, *middle_obj; 1119 object *top_obj, *floor_obj, *middle_obj;
1107 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;
1108 1121
1109 middle = blank_face; 1122 middle = blank_face;
1110 top = blank_face; 1123 top = blank_face;
… …
1226 1239
1227 /* If two top faces are already set, quit processing */ 1240 /* If two top faces are already set, quit processing */
1228 if ((top != blank_face) && (middle != blank_face)) 1241 if ((top != blank_face) && (middle != blank_face))
1229 break; 1242 break;
1230 1243
1231 /* Only show visible faces, unless its the editor - show all */ 1244 /* Only show visible faces */
1232 if (!tmp->invisible || editor) 1245 if (!tmp->invisible)
1233 { 1246 {
1234 /* Fill in top if needed */ 1247 /* Fill in top if needed */
1235 if (top == blank_face) 1248 if (top == blank_face)
1236 { 1249 {
1237 top = tmp->face; 1250 top = tmp->face;
… …
1267 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;
1268 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;
1269 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;
1270} 1283}
1271 1284
1272/* 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
1273 * 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
1274 * 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
1275 * the value of orig_map->tile_map[tile_num]. It really only does this 1288 * the value of orig_map->tile_map[tile_num].
1276 * so that it is easier for calling functions to verify success.
1277 */ 1289 */
1278static maptile * 1290static inline maptile *
1279load_and_link_tiled_map (maptile *orig_map, int tile_num) 1291find_and_link (maptile *orig_map, int tile_num)
1280{ 1292{
1293 maptile *mp = orig_map->tile_map [tile_num];
1294
1295 if (!mp)
1296 {
1281 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);
1282 1298
1283 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1299 if (!mp)
1284 { 1300 {
1285 // 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
1286 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",
1287 &orig_map->tile_path[tile_num], &orig_map->path); 1303 &orig_map->tile_path[tile_num], &orig_map->path);
1288 mp = new maptile (1, 1); 1304 mp = new maptile (1, 1);
1289 mp->alloc (); 1305 mp->alloc ();
1290 mp->in_memory = MAP_IN_MEMORY; 1306 mp->in_memory = MAP_IN_MEMORY;
1307 }
1291 } 1308 }
1292 1309
1293 int dest_tile = (tile_num + 2) % 4; 1310 int dest_tile = (tile_num + 2) % 4;
1294 1311
1295 orig_map->tile_map[tile_num] = mp; 1312 orig_map->tile_map [tile_num] = mp;
1296 1313
1297 // optimisation: back-link map to origin map if euclidean 1314 // optimisation: back-link map to origin map if euclidean
1298 //TODO: non-euclidean maps MUST GO 1315 //TODO: non-euclidean maps MUST GO
1299 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)
1300 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;
1301 1318
1302 return mp; 1319 return mp;
1320}
1321
1322static inline void
1323load_and_link (maptile *orig_map, int tile_num)
1324{
1325 find_and_link (orig_map, tile_num)->load_sync ();
1303} 1326}
1304 1327
1305/* this returns TRUE if the coordinates (x,y) are out of 1328/* this returns TRUE if the coordinates (x,y) are out of
1306 * map m. This function also takes into account any 1329 * map m. This function also takes into account any
1307 * tiling considerations, loading adjacant maps as needed. 1330 * tiling considerations, loading adjacant maps as needed.
… …
1324 { 1347 {
1325 if (!m->tile_path[3]) 1348 if (!m->tile_path[3])
1326 return 1; 1349 return 1;
1327 1350
1328 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)
1329 load_and_link_tiled_map (m, 3); 1352 find_and_link (m, 3);
1330 1353
1331 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);
1332 } 1355 }
1333 1356
1334 if (x >= m->width) 1357 if (x >= m->width)
1335 { 1358 {
1336 if (!m->tile_path[1]) 1359 if (!m->tile_path[1])
1337 return 1; 1360 return 1;
1338 1361
1339 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)
1340 load_and_link_tiled_map (m, 1); 1363 find_and_link (m, 1);
1341 1364
1342 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);
1343 } 1366 }
1344 1367
1345 if (y < 0) 1368 if (y < 0)
1346 { 1369 {
1347 if (!m->tile_path[0]) 1370 if (!m->tile_path[0])
1348 return 1; 1371 return 1;
1349 1372
1350 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)
1351 load_and_link_tiled_map (m, 0); 1374 find_and_link (m, 0);
1352 1375
1353 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);
1354 } 1377 }
1355 1378
1356 if (y >= m->height) 1379 if (y >= m->height)
1357 { 1380 {
1358 if (!m->tile_path[2]) 1381 if (!m->tile_path[2])
1359 return 1; 1382 return 1;
1360 1383
1361 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)
1362 load_and_link_tiled_map (m, 2); 1385 find_and_link (m, 2);
1363 1386
1364 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);
1365 } 1388 }
1366 1389
1367 /* Simple case - coordinates are within this local 1390 /* Simple case - coordinates are within this local
… …
1372 1395
1373/* This is basically the same as out_of_map above, but 1396/* This is basically the same as out_of_map above, but
1374 * instead we return NULL if no map is valid (coordinates 1397 * instead we return NULL if no map is valid (coordinates
1375 * out of bounds and no tiled map), otherwise it returns 1398 * out of bounds and no tiled map), otherwise it returns
1376 * the map as that the coordinates are really on, and 1399 * the map as that the coordinates are really on, and
1377 * updates x and y to be the localized coordinates. 1400 * updates x and y to be the localised coordinates.
1378 * Using this is more efficient of calling out_of_map 1401 * Using this is more efficient of calling out_of_map
1379 * and then figuring out what the real map is 1402 * and then figuring out what the real map is
1380 */ 1403 */
1381maptile * 1404maptile *
1382get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1405maptile::xy_find (sint16 &x, sint16 &y)
1383{ 1406{
1384 if (*x < 0) 1407 if (x < 0)
1385 { 1408 {
1386 if (!m->tile_path[3]) 1409 if (!tile_path[3])
1387 return 0; 1410 return 0;
1388 1411
1389 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1412 find_and_link (this, 3);
1390 load_and_link_tiled_map (m, 3);
1391
1392 *x += m->tile_map[3]->width; 1413 x += tile_map[3]->width;
1393 return (get_map_from_coord (m->tile_map[3], x, y)); 1414 return tile_map[3]->xy_find (x, y);
1394 } 1415 }
1395 1416
1396 if (*x >= m->width) 1417 if (x >= width)
1397 { 1418 {
1398 if (!m->tile_path[1]) 1419 if (!tile_path[1])
1399 return 0; 1420 return 0;
1400 1421
1401 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1422 find_and_link (this, 1);
1402 load_and_link_tiled_map (m, 1);
1403
1404 *x -= m->width; 1423 x -= width;
1405 return (get_map_from_coord (m->tile_map[1], x, y)); 1424 return tile_map[1]->xy_find (x, y);
1406 } 1425 }
1407 1426
1408 if (*y < 0) 1427 if (y < 0)
1409 { 1428 {
1410 if (!m->tile_path[0]) 1429 if (!tile_path[0])
1411 return 0; 1430 return 0;
1412 1431
1413 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1432 find_and_link (this, 0);
1414 load_and_link_tiled_map (m, 0);
1415
1416 *y += m->tile_map[0]->height; 1433 y += tile_map[0]->height;
1417 return (get_map_from_coord (m->tile_map[0], x, y)); 1434 return tile_map[0]->xy_find (x, y);
1418 } 1435 }
1419 1436
1420 if (*y >= m->height) 1437 if (y >= height)
1421 { 1438 {
1422 if (!m->tile_path[2]) 1439 if (!tile_path[2])
1423 return 0; 1440 return 0;
1424 1441
1425 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1442 find_and_link (this, 2);
1426 load_and_link_tiled_map (m, 2);
1427
1428 *y -= m->height; 1443 y -= height;
1429 return (get_map_from_coord (m->tile_map[2], x, y)); 1444 return tile_map[2]->xy_find (x, y);
1430 } 1445 }
1431 1446
1432 /* Simple case - coordinates are within this local 1447 /* Simple case - coordinates are within this local
1433 * map. 1448 * map.
1434 */ 1449 */
1435 return m; 1450 return this;
1436} 1451}
1437 1452
1438/** 1453/**
1439 * 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
1440 * map1 to map2 in dx/dy. 1455 * map1 to map2 in dx/dy.
1441 */ 1456 */
1442static int 1457int
1443adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1458adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1444{ 1459{
1445 if (!map1 || !map2) 1460 if (!map1 || !map2)
1446 return 0; 1461 return 0;
1447 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!)
1448 if (map1 == map2) 1465 if (map1 == map2)
1449 { 1466 {
1450 *dx = 0; 1467 *dx = 0;
1451 *dy = 0; 1468 *dy = 0;
1452 } 1469 }
… …
1512 } 1529 }
1513 else 1530 else
1514 return 0; 1531 return 0;
1515 1532
1516 return 1; 1533 return 1;
1534}
1535
1536maptile *
1537maptile::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
1547maptile *
1548get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1549{
1550 return m->xy_load (*x, *y);
1517} 1551}
1518 1552
1519/* From map.c 1553/* From map.c
1520 * This is used by get_player to determine where the other 1554 * This is used by get_player to determine where the other
1521 * creature is. get_rangevector takes into account map tiling, 1555 * creature is. get_rangevector takes into account map tiling,
1522 * 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
1523 * righte value. distance_x/y are distance away, which 1557 * righte value. distance_x/y are distance away, which
1524 * can be negativbe. direction is the crossfire direction scheme 1558 * can be negative. direction is the crossfire direction scheme
1525 * that the creature should head. part is the part of the 1559 * that the creature should head. part is the part of the
1526 * monster that is closest. 1560 * monster that is closest.
1527 * 1561 *
1528 * get_rangevector looks at op1 and op2, and fills in the 1562 * get_rangevector looks at op1 and op2, and fills in the
1529 * structure for op1 to get to op2. 1563 * structure for op1 to get to op2.
… …
1576 { 1610 {
1577 best_distance = tmpi; 1611 best_distance = tmpi;
1578 best = tmp; 1612 best = tmp;
1579 } 1613 }
1580 } 1614 }
1615
1581 if (best != op1) 1616 if (best != op1)
1582 { 1617 {
1583 retval->distance_x += op1->x - best->x; 1618 retval->distance_x += op1->x - best->x;
1584 retval->distance_y += op1->y - best->y; 1619 retval->distance_y += op1->y - best->y;
1585 } 1620 }
1586 } 1621 }
1622
1587 retval->part = best; 1623 retval->part = best;
1588 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);
1589 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1625 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1590 } 1626 }
1591} 1627}
1592 1628
1593/* 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
… …
1598 * flags has no meaning for this function at this time - I kept it in to 1634 * 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 1635 * 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 1636 * for something in the future. Also, since no object is pasted, the best
1601 * field of the rv_vector is set to NULL. 1637 * field of the rv_vector is set to NULL.
1602 */ 1638 */
1603
1604void 1639void
1605get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1640get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1606{ 1641{
1607 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1642 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1608 { 1643 {
1609 /* be conservative and fill in _some_ data */ 1644 /* be conservative and fill in _some_ data */
1610 retval->distance = 100000; 1645 retval->distance = 100000;
… …
1617 { 1652 {
1618 retval->distance_x += op2->x - x; 1653 retval->distance_x += op2->x - x;
1619 retval->distance_y += op2->y - y; 1654 retval->distance_y += op2->y - y;
1620 1655
1621 retval->part = NULL; 1656 retval->part = NULL;
1622 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1657 retval->distance = idistance (retval->distance_x, retval->distance_y);
1623 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1658 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1624 } 1659 }
1625} 1660}
1626 1661
1627/* Returns true of op1 and op2 are effectively on the same map 1662/* Returns true of op1 and op2 are effectively on the same map
… …
1647 op->remove (); 1682 op->remove ();
1648 1683
1649 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1684 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1650} 1685}
1651 1686
1687region *
1688maptile::region (int x, int y) const
1689{
1690 if (regions
1691 && regionmap
1692 && !OUT_OF_REAL_MAP (this, x, y))
1693 if (struct region *reg = regionmap [regions [y * width + x]])
1694 return reg;
1695
1696 if (default_region)
1697 return default_region;
1698
1699 return ::region::default_region ();
1700}
1701

Diff Legend

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