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 |
… | |
… | |
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 | { |
492 | static int cede_count = 0; |
493 | static int cede_count = 0; |
493 | |
494 | |
494 | if (flags & IO_HEADER) |
495 | if (flags & IO_HEADER) |
495 | save_header (freezer); |
496 | _save_header (freezer); |
496 | |
497 | |
497 | if (!spaces) |
498 | if (!spaces) |
498 | return false; |
499 | return false; |
499 | |
500 | |
500 | for (int i = 0; i < size (); ++i) |
501 | for (int i = 0; i < size (); ++i) |
501 | { |
502 | { |
|
|
503 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
502 | if (cede_count >= 500) |
504 | if (cede_count >= 500) |
503 | { |
505 | { |
504 | cede_count = 0; |
506 | cede_count = 0; |
505 | coroapi::cede (); |
507 | coroapi::cede (); |
506 | } |
508 | } |
|
|
509 | #endif |
507 | |
510 | |
508 | int unique = 0; |
511 | int unique = 0; |
509 | for (object *op = spaces [i].bot; op; op = op->above) |
512 | for (object *op = spaces [i].bot; op; op = op->above) |
510 | { |
513 | { |
511 | // count per-object, but cede only when modification-safe |
514 | // count per-object, but cede only when modification-safe |
… | |
… | |
529 | |
532 | |
530 | return true; |
533 | return true; |
531 | } |
534 | } |
532 | |
535 | |
533 | bool |
536 | bool |
534 | maptile::load_objects (const char *path, bool skip_header) |
537 | maptile::_load_objects (const char *path, bool skip_header) |
535 | { |
538 | { |
536 | object_thawer thawer (path); |
539 | object_thawer thawer (path); |
537 | |
540 | |
538 | if (!thawer) |
541 | if (!thawer) |
539 | return false; |
542 | return false; |
… | |
… | |
547 | break; |
550 | break; |
548 | |
551 | |
549 | thawer.skip_kv (kw); |
552 | thawer.skip_kv (kw); |
550 | } |
553 | } |
551 | |
554 | |
552 | return load_objects (thawer); |
555 | return _load_objects (thawer); |
553 | } |
556 | } |
554 | |
557 | |
555 | bool |
558 | bool |
556 | maptile::save_objects (const char *path, int flags) |
559 | maptile::_save_objects (const char *path, int flags) |
557 | { |
560 | { |
558 | object_freezer freezer; |
561 | object_freezer freezer; |
559 | |
562 | |
560 | if (!save_objects (freezer, flags)) |
563 | if (!_save_objects (freezer, flags)) |
561 | return false; |
564 | return false; |
562 | |
565 | |
563 | return freezer.save (path); |
566 | return freezer.save (path); |
564 | } |
567 | } |
565 | |
568 | |
… | |
… | |
729 | * This could be done in lex (like the object loader), but I think |
732 | * 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. |
733 | * currently, there are few enough fields this is not a big deal. |
731 | * MSW 2001-07-01 |
734 | * MSW 2001-07-01 |
732 | */ |
735 | */ |
733 | bool |
736 | bool |
734 | maptile::load_header (object_thawer &thawer) |
737 | maptile::_load_header (object_thawer &thawer) |
735 | { |
738 | { |
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 (;;) |
739 | for (;;) |
741 | { |
740 | { |
742 | keyword kw = thawer.get_kv (); |
741 | keyword kw = thawer.get_kv (); |
743 | |
742 | |
744 | switch (kw) |
743 | switch (kw) |
… | |
… | |
747 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
746 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
748 | return false; |
747 | return false; |
749 | |
748 | |
750 | case KW_end: |
749 | case KW_end: |
751 | return true; |
750 | return true; |
|
|
751 | |
|
|
752 | default: |
|
|
753 | case KW_ERROR: |
|
|
754 | LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword); |
|
|
755 | break; |
752 | |
756 | |
753 | case KW_msg: |
757 | case KW_msg: |
754 | thawer.get_ml (KW_endmsg, msg); |
758 | thawer.get_ml (KW_endmsg, msg); |
755 | break; |
759 | break; |
756 | |
760 | |
… | |
… | |
807 | |
811 | |
808 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
812 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
809 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
813 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
810 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
814 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
811 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
815 | 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 | } |
816 | } |
817 | } |
817 | } |
818 | |
818 | |
819 | abort (); |
819 | abort (); |
820 | } |
820 | } |
821 | |
821 | |
822 | bool |
822 | bool |
823 | maptile::load_header (const char *path) |
823 | maptile::_load_header (const char *path) |
824 | { |
824 | { |
825 | object_thawer thawer (path); |
825 | object_thawer thawer (path); |
826 | |
826 | |
827 | if (!thawer) |
827 | if (!thawer) |
828 | return false; |
828 | return false; |
829 | |
829 | |
830 | return load_header (thawer); |
830 | return _load_header (thawer); |
831 | } |
831 | } |
832 | |
832 | |
833 | /****************************************************************************** |
833 | /****************************************************************************** |
834 | * This is the start of unique map handling code |
834 | * This is the start of unique map handling code |
835 | *****************************************************************************/ |
835 | *****************************************************************************/ |
… | |
… | |
858 | } |
858 | } |
859 | } |
859 | } |
860 | } |
860 | } |
861 | |
861 | |
862 | bool |
862 | bool |
863 | maptile::save_header (object_freezer &freezer) |
863 | maptile::_save_header (object_freezer &freezer) |
864 | { |
864 | { |
865 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
865 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
866 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
866 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
867 | |
867 | |
868 | MAP_OUT2 (arch, "map"); |
868 | MAP_OUT2 (arch, "map"); |
… | |
… | |
917 | |
917 | |
918 | return true; |
918 | return true; |
919 | } |
919 | } |
920 | |
920 | |
921 | bool |
921 | bool |
922 | maptile::save_header (const char *path) |
922 | maptile::_save_header (const char *path) |
923 | { |
923 | { |
924 | object_freezer freezer; |
924 | object_freezer freezer; |
925 | |
925 | |
926 | if (!save_header (freezer)) |
926 | if (!_save_header (freezer)) |
927 | return false; |
927 | return false; |
928 | |
928 | |
929 | return freezer.save (path); |
929 | return freezer.save (path); |
930 | } |
930 | } |
931 | |
931 | |
… | |
… | |
1237 | |
1237 | |
1238 | /* If two top faces are already set, quit processing */ |
1238 | /* If two top faces are already set, quit processing */ |
1239 | if ((top != blank_face) && (middle != blank_face)) |
1239 | if ((top != blank_face) && (middle != blank_face)) |
1240 | break; |
1240 | break; |
1241 | |
1241 | |
1242 | /* Only show visible faces, unless its the editor - show all */ |
1242 | /* Only show visible faces */ |
1243 | if (!tmp->invisible || editor) |
1243 | if (!tmp->invisible) |
1244 | { |
1244 | { |
1245 | /* Fill in top if needed */ |
1245 | /* Fill in top if needed */ |
1246 | if (top == blank_face) |
1246 | if (top == blank_face) |
1247 | { |
1247 | { |
1248 | top = tmp->face; |
1248 | top = tmp->face; |
… | |
… | |
1278 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1278 | 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; |
1279 | 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; |
1280 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1281 | } |
1281 | } |
1282 | |
1282 | |
1283 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1283 | /* 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 |
1284 | * 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 |
1285 | * 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 |
1286 | * the value of orig_map->tile_map[tile_num]. |
1287 | * so that it is easier for calling functions to verify success. |
|
|
1288 | */ |
1287 | */ |
1289 | static maptile * |
1288 | static inline maptile * |
1290 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
1289 | find_and_link (maptile *orig_map, int tile_num) |
1291 | { |
1290 | { |
|
|
1291 | maptile *mp = orig_map->tile_map [tile_num]; |
|
|
1292 | |
|
|
1293 | if (!mp) |
|
|
1294 | { |
1292 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1295 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
1293 | |
1296 | |
1294 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1297 | if (!mp) |
1295 | { |
1298 | { |
1296 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1299 | // 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", |
1300 | 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); |
1301 | &orig_map->tile_path[tile_num], &orig_map->path); |
1299 | mp = new maptile (1, 1); |
1302 | mp = new maptile (1, 1); |
1300 | mp->alloc (); |
1303 | mp->alloc (); |
1301 | mp->in_memory = MAP_IN_MEMORY; |
1304 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1305 | } |
1302 | } |
1306 | } |
1303 | |
1307 | |
1304 | int dest_tile = (tile_num + 2) % 4; |
1308 | int dest_tile = (tile_num + 2) % 4; |
1305 | |
1309 | |
1306 | orig_map->tile_map[tile_num] = mp; |
1310 | orig_map->tile_map [tile_num] = mp; |
1307 | |
1311 | |
1308 | // optimisation: back-link map to origin map if euclidean |
1312 | // optimisation: back-link map to origin map if euclidean |
1309 | //TODO: non-euclidean maps MUST GO |
1313 | //TODO: non-euclidean maps MUST GO |
1310 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1314 | 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; |
1315 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1312 | |
1316 | |
1313 | return mp; |
1317 | return mp; |
|
|
1318 | } |
|
|
1319 | |
|
|
1320 | static inline void |
|
|
1321 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1322 | { |
|
|
1323 | find_and_link (orig_map, tile_num)->load_sync (); |
1314 | } |
1324 | } |
1315 | |
1325 | |
1316 | /* this returns TRUE if the coordinates (x,y) are out of |
1326 | /* this returns TRUE if the coordinates (x,y) are out of |
1317 | * map m. This function also takes into account any |
1327 | * map m. This function also takes into account any |
1318 | * tiling considerations, loading adjacant maps as needed. |
1328 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1335 | { |
1345 | { |
1336 | if (!m->tile_path[3]) |
1346 | if (!m->tile_path[3]) |
1337 | return 1; |
1347 | return 1; |
1338 | |
1348 | |
1339 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1349 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1340 | load_and_link_tiled_map (m, 3); |
1350 | find_and_link (m, 3); |
1341 | |
1351 | |
1342 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1352 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1343 | } |
1353 | } |
1344 | |
1354 | |
1345 | if (x >= m->width) |
1355 | if (x >= m->width) |
1346 | { |
1356 | { |
1347 | if (!m->tile_path[1]) |
1357 | if (!m->tile_path[1]) |
1348 | return 1; |
1358 | return 1; |
1349 | |
1359 | |
1350 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1360 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1351 | load_and_link_tiled_map (m, 1); |
1361 | find_and_link (m, 1); |
1352 | |
1362 | |
1353 | return out_of_map (m->tile_map[1], x - m->width, y); |
1363 | return out_of_map (m->tile_map[1], x - m->width, y); |
1354 | } |
1364 | } |
1355 | |
1365 | |
1356 | if (y < 0) |
1366 | if (y < 0) |
1357 | { |
1367 | { |
1358 | if (!m->tile_path[0]) |
1368 | if (!m->tile_path[0]) |
1359 | return 1; |
1369 | return 1; |
1360 | |
1370 | |
1361 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1371 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1362 | load_and_link_tiled_map (m, 0); |
1372 | find_and_link (m, 0); |
1363 | |
1373 | |
1364 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1374 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1365 | } |
1375 | } |
1366 | |
1376 | |
1367 | if (y >= m->height) |
1377 | if (y >= m->height) |
1368 | { |
1378 | { |
1369 | if (!m->tile_path[2]) |
1379 | if (!m->tile_path[2]) |
1370 | return 1; |
1380 | return 1; |
1371 | |
1381 | |
1372 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1382 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1373 | load_and_link_tiled_map (m, 2); |
1383 | find_and_link (m, 2); |
1374 | |
1384 | |
1375 | return out_of_map (m->tile_map[2], x, y - m->height); |
1385 | return out_of_map (m->tile_map[2], x, y - m->height); |
1376 | } |
1386 | } |
1377 | |
1387 | |
1378 | /* Simple case - coordinates are within this local |
1388 | /* Simple case - coordinates are within this local |
… | |
… | |
1383 | |
1393 | |
1384 | /* This is basically the same as out_of_map above, but |
1394 | /* This is basically the same as out_of_map above, but |
1385 | * instead we return NULL if no map is valid (coordinates |
1395 | * instead we return NULL if no map is valid (coordinates |
1386 | * out of bounds and no tiled map), otherwise it returns |
1396 | * out of bounds and no tiled map), otherwise it returns |
1387 | * the map as that the coordinates are really on, and |
1397 | * the map as that the coordinates are really on, and |
1388 | * updates x and y to be the localized coordinates. |
1398 | * updates x and y to be the localised coordinates. |
1389 | * Using this is more efficient of calling out_of_map |
1399 | * Using this is more efficient of calling out_of_map |
1390 | * and then figuring out what the real map is |
1400 | * and then figuring out what the real map is |
1391 | */ |
1401 | */ |
1392 | maptile * |
1402 | maptile * |
1393 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1403 | maptile::xy_find (sint16 &x, sint16 &y) |
1394 | { |
1404 | { |
1395 | if (*x < 0) |
1405 | if (x < 0) |
1396 | { |
1406 | { |
1397 | if (!m->tile_path[3]) |
1407 | if (!tile_path[3]) |
1398 | return 0; |
1408 | return 0; |
1399 | |
1409 | |
1400 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1410 | find_and_link (this, 3); |
1401 | load_and_link_tiled_map (m, 3); |
|
|
1402 | |
|
|
1403 | *x += m->tile_map[3]->width; |
1411 | x += tile_map[3]->width; |
1404 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1412 | return tile_map[3]->xy_find (x, y); |
1405 | } |
1413 | } |
1406 | |
1414 | |
1407 | if (*x >= m->width) |
1415 | if (x >= width) |
1408 | { |
1416 | { |
1409 | if (!m->tile_path[1]) |
1417 | if (!tile_path[1]) |
1410 | return 0; |
1418 | return 0; |
1411 | |
1419 | |
1412 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1420 | find_and_link (this, 1); |
1413 | load_and_link_tiled_map (m, 1); |
|
|
1414 | |
|
|
1415 | *x -= m->width; |
1421 | x -= width; |
1416 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1422 | return tile_map[1]->xy_find (x, y); |
1417 | } |
1423 | } |
1418 | |
1424 | |
1419 | if (*y < 0) |
1425 | if (y < 0) |
1420 | { |
1426 | { |
1421 | if (!m->tile_path[0]) |
1427 | if (!tile_path[0]) |
1422 | return 0; |
1428 | return 0; |
1423 | |
1429 | |
1424 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1430 | find_and_link (this, 0); |
1425 | load_and_link_tiled_map (m, 0); |
|
|
1426 | |
|
|
1427 | *y += m->tile_map[0]->height; |
1431 | y += tile_map[0]->height; |
1428 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1432 | return tile_map[0]->xy_find (x, y); |
1429 | } |
1433 | } |
1430 | |
1434 | |
1431 | if (*y >= m->height) |
1435 | if (y >= height) |
1432 | { |
1436 | { |
1433 | if (!m->tile_path[2]) |
1437 | if (!tile_path[2]) |
1434 | return 0; |
1438 | return 0; |
1435 | |
1439 | |
1436 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1440 | find_and_link (this, 2); |
1437 | load_and_link_tiled_map (m, 2); |
|
|
1438 | |
|
|
1439 | *y -= m->height; |
1441 | y -= height; |
1440 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1442 | return tile_map[2]->xy_find (x, y); |
1441 | } |
1443 | } |
1442 | |
1444 | |
1443 | /* Simple case - coordinates are within this local |
1445 | /* Simple case - coordinates are within this local |
1444 | * map. |
1446 | * map. |
1445 | */ |
1447 | */ |
1446 | return m; |
1448 | return this; |
1447 | } |
1449 | } |
1448 | |
1450 | |
1449 | /** |
1451 | /** |
1450 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1452 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1451 | * map1 to map2 in dx/dy. |
1453 | * map1 to map2 in dx/dy. |
… | |
… | |
1454 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1456 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1455 | { |
1457 | { |
1456 | if (!map1 || !map2) |
1458 | if (!map1 || !map2) |
1457 | return 0; |
1459 | return 0; |
1458 | |
1460 | |
|
|
1461 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
|
|
1462 | //fix: compare paths instead (this is likely faster, too!) |
1459 | if (map1 == map2) |
1463 | if (map1 == map2) |
1460 | { |
1464 | { |
1461 | *dx = 0; |
1465 | *dx = 0; |
1462 | *dy = 0; |
1466 | *dy = 0; |
1463 | } |
1467 | } |
… | |
… | |
1523 | } |
1527 | } |
1524 | else |
1528 | else |
1525 | return 0; |
1529 | return 0; |
1526 | |
1530 | |
1527 | return 1; |
1531 | return 1; |
|
|
1532 | } |
|
|
1533 | |
|
|
1534 | maptile * |
|
|
1535 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1536 | { |
|
|
1537 | maptile *map = xy_find (x, y); |
|
|
1538 | |
|
|
1539 | if (map) |
|
|
1540 | map->load_sync (); |
|
|
1541 | |
|
|
1542 | return map; |
|
|
1543 | } |
|
|
1544 | |
|
|
1545 | maptile * |
|
|
1546 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1547 | { |
|
|
1548 | return m->xy_load (*x, *y); |
1528 | } |
1549 | } |
1529 | |
1550 | |
1530 | /* From map.c |
1551 | /* From map.c |
1531 | * This is used by get_player to determine where the other |
1552 | * This is used by get_player to determine where the other |
1532 | * creature is. get_rangevector takes into account map tiling, |
1553 | * creature is. get_rangevector takes into account map tiling, |