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 |
… | |
… | |
731 | * MSW 2001-07-01 |
732 | * MSW 2001-07-01 |
732 | */ |
733 | */ |
733 | bool |
734 | bool |
734 | maptile::load_header (object_thawer &thawer) |
735 | maptile::load_header (object_thawer &thawer) |
735 | { |
736 | { |
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 (;;) |
737 | for (;;) |
741 | { |
738 | { |
742 | keyword kw = thawer.get_kv (); |
739 | keyword kw = thawer.get_kv (); |
743 | |
740 | |
744 | switch (kw) |
741 | switch (kw) |
… | |
… | |
747 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
744 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
748 | return false; |
745 | return false; |
749 | |
746 | |
750 | case KW_end: |
747 | case KW_end: |
751 | return true; |
748 | return true; |
|
|
749 | |
|
|
750 | default: |
|
|
751 | case KW_ERROR: |
|
|
752 | LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword); |
|
|
753 | break; |
752 | |
754 | |
753 | case KW_msg: |
755 | case KW_msg: |
754 | thawer.get_ml (KW_endmsg, msg); |
756 | thawer.get_ml (KW_endmsg, msg); |
755 | break; |
757 | break; |
756 | |
758 | |
… | |
… | |
807 | |
809 | |
808 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
810 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
809 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
811 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
810 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
812 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
811 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
813 | 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 | } |
814 | } |
817 | } |
815 | } |
818 | |
816 | |
819 | abort (); |
817 | abort (); |
820 | } |
818 | } |
… | |
… | |
1278 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1276 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1279 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1277 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1280 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1278 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1281 | } |
1279 | } |
1282 | |
1280 | |
1283 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1281 | /* 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 |
1282 | * 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 |
1283 | * 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 |
1284 | * the value of orig_map->tile_map[tile_num]. |
1287 | * so that it is easier for calling functions to verify success. |
|
|
1288 | */ |
1285 | */ |
1289 | static maptile * |
1286 | static inline maptile * |
1290 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
1287 | find_and_link (maptile *orig_map, int tile_num) |
1291 | { |
1288 | { |
|
|
1289 | maptile *mp = orig_map->tile_map [tile_num]; |
|
|
1290 | |
|
|
1291 | if (!mp) |
|
|
1292 | { |
1292 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1293 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
1293 | |
1294 | |
1294 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1295 | if (!mp) |
1295 | { |
1296 | { |
1296 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
1297 | // 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", |
1298 | 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); |
1299 | &orig_map->tile_path[tile_num], &orig_map->path); |
1299 | mp = new maptile (1, 1); |
1300 | mp = new maptile (1, 1); |
1300 | mp->alloc (); |
1301 | mp->alloc (); |
1301 | mp->in_memory = MAP_IN_MEMORY; |
1302 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1303 | } |
1302 | } |
1304 | } |
1303 | |
1305 | |
1304 | int dest_tile = (tile_num + 2) % 4; |
1306 | int dest_tile = (tile_num + 2) % 4; |
1305 | |
1307 | |
1306 | orig_map->tile_map[tile_num] = mp; |
1308 | orig_map->tile_map [tile_num] = mp; |
1307 | |
1309 | |
1308 | // optimisation: back-link map to origin map if euclidean |
1310 | // optimisation: back-link map to origin map if euclidean |
1309 | //TODO: non-euclidean maps MUST GO |
1311 | //TODO: non-euclidean maps MUST GO |
1310 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
1312 | 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; |
1313 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
1312 | |
1314 | |
1313 | return mp; |
1315 | return mp; |
|
|
1316 | } |
|
|
1317 | |
|
|
1318 | static inline void |
|
|
1319 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1320 | { |
|
|
1321 | find_and_link (orig_map, tile_num)->load_sync (); |
1314 | } |
1322 | } |
1315 | |
1323 | |
1316 | /* this returns TRUE if the coordinates (x,y) are out of |
1324 | /* this returns TRUE if the coordinates (x,y) are out of |
1317 | * map m. This function also takes into account any |
1325 | * map m. This function also takes into account any |
1318 | * tiling considerations, loading adjacant maps as needed. |
1326 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1335 | { |
1343 | { |
1336 | if (!m->tile_path[3]) |
1344 | if (!m->tile_path[3]) |
1337 | return 1; |
1345 | return 1; |
1338 | |
1346 | |
1339 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1347 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1340 | load_and_link_tiled_map (m, 3); |
1348 | find_and_link (m, 3); |
1341 | |
1349 | |
1342 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1350 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1343 | } |
1351 | } |
1344 | |
1352 | |
1345 | if (x >= m->width) |
1353 | if (x >= m->width) |
1346 | { |
1354 | { |
1347 | if (!m->tile_path[1]) |
1355 | if (!m->tile_path[1]) |
1348 | return 1; |
1356 | return 1; |
1349 | |
1357 | |
1350 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1358 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1351 | load_and_link_tiled_map (m, 1); |
1359 | find_and_link (m, 1); |
1352 | |
1360 | |
1353 | return out_of_map (m->tile_map[1], x - m->width, y); |
1361 | return out_of_map (m->tile_map[1], x - m->width, y); |
1354 | } |
1362 | } |
1355 | |
1363 | |
1356 | if (y < 0) |
1364 | if (y < 0) |
1357 | { |
1365 | { |
1358 | if (!m->tile_path[0]) |
1366 | if (!m->tile_path[0]) |
1359 | return 1; |
1367 | return 1; |
1360 | |
1368 | |
1361 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1369 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1362 | load_and_link_tiled_map (m, 0); |
1370 | find_and_link (m, 0); |
1363 | |
1371 | |
1364 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1372 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1365 | } |
1373 | } |
1366 | |
1374 | |
1367 | if (y >= m->height) |
1375 | if (y >= m->height) |
1368 | { |
1376 | { |
1369 | if (!m->tile_path[2]) |
1377 | if (!m->tile_path[2]) |
1370 | return 1; |
1378 | return 1; |
1371 | |
1379 | |
1372 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1380 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1373 | load_and_link_tiled_map (m, 2); |
1381 | find_and_link (m, 2); |
1374 | |
1382 | |
1375 | return out_of_map (m->tile_map[2], x, y - m->height); |
1383 | return out_of_map (m->tile_map[2], x, y - m->height); |
1376 | } |
1384 | } |
1377 | |
1385 | |
1378 | /* Simple case - coordinates are within this local |
1386 | /* Simple case - coordinates are within this local |
… | |
… | |
1388 | * updates x and y to be the localised coordinates. |
1396 | * updates x and y to be the localised coordinates. |
1389 | * Using this is more efficient of calling out_of_map |
1397 | * Using this is more efficient of calling out_of_map |
1390 | * and then figuring out what the real map is |
1398 | * and then figuring out what the real map is |
1391 | */ |
1399 | */ |
1392 | maptile * |
1400 | maptile * |
1393 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1401 | maptile::xy_find (sint16 &x, sint16 &y) |
1394 | { |
1402 | { |
1395 | if (*x < 0) |
1403 | if (x < 0) |
1396 | { |
1404 | { |
1397 | if (!m->tile_path[3]) |
1405 | if (!tile_path[3]) |
1398 | return 0; |
1406 | return 0; |
1399 | |
1407 | |
1400 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
1408 | find_and_link (this, 3); |
1401 | load_and_link_tiled_map (m, 3); |
|
|
1402 | |
|
|
1403 | *x += m->tile_map[3]->width; |
1409 | x += tile_map[3]->width; |
1404 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1410 | return tile_map[3]->xy_find (x, y); |
1405 | } |
1411 | } |
1406 | |
1412 | |
1407 | if (*x >= m->width) |
1413 | if (x >= width) |
1408 | { |
1414 | { |
1409 | if (!m->tile_path[1]) |
1415 | if (!tile_path[1]) |
1410 | return 0; |
1416 | return 0; |
1411 | |
1417 | |
1412 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
1418 | find_and_link (this, 1); |
1413 | load_and_link_tiled_map (m, 1); |
|
|
1414 | |
|
|
1415 | *x -= m->width; |
1419 | x -= width; |
1416 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1420 | return tile_map[1]->xy_find (x, y); |
1417 | } |
1421 | } |
1418 | |
1422 | |
1419 | if (*y < 0) |
1423 | if (y < 0) |
1420 | { |
1424 | { |
1421 | if (!m->tile_path[0]) |
1425 | if (!tile_path[0]) |
1422 | return 0; |
1426 | return 0; |
1423 | |
1427 | |
1424 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
1428 | find_and_link (this, 0); |
1425 | load_and_link_tiled_map (m, 0); |
|
|
1426 | |
|
|
1427 | *y += m->tile_map[0]->height; |
1429 | y += tile_map[0]->height; |
1428 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1430 | return tile_map[0]->xy_find (x, y); |
1429 | } |
1431 | } |
1430 | |
1432 | |
1431 | if (*y >= m->height) |
1433 | if (y >= height) |
1432 | { |
1434 | { |
1433 | if (!m->tile_path[2]) |
1435 | if (!tile_path[2]) |
1434 | return 0; |
1436 | return 0; |
1435 | |
1437 | |
1436 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
1438 | find_and_link (this, 2); |
1437 | load_and_link_tiled_map (m, 2); |
|
|
1438 | |
|
|
1439 | *y -= m->height; |
1439 | y -= height; |
1440 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1440 | return tile_map[2]->xy_find (x, y); |
1441 | } |
1441 | } |
1442 | |
1442 | |
1443 | /* Simple case - coordinates are within this local |
1443 | /* Simple case - coordinates are within this local |
1444 | * map. |
1444 | * map. |
1445 | */ |
1445 | */ |
1446 | return m; |
1446 | return this; |
1447 | } |
1447 | } |
1448 | |
1448 | |
1449 | /** |
1449 | /** |
1450 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1450 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1451 | * map1 to map2 in dx/dy. |
1451 | * map1 to map2 in dx/dy. |
… | |
… | |
1454 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1454 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1455 | { |
1455 | { |
1456 | if (!map1 || !map2) |
1456 | if (!map1 || !map2) |
1457 | return 0; |
1457 | return 0; |
1458 | |
1458 | |
|
|
1459 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
|
|
1460 | //fix: compare paths instead (this is likely faster, too!) |
1459 | if (map1 == map2) |
1461 | if (map1 == map2) |
1460 | { |
1462 | { |
1461 | *dx = 0; |
1463 | *dx = 0; |
1462 | *dy = 0; |
1464 | *dy = 0; |
1463 | } |
1465 | } |
… | |
… | |
1523 | } |
1525 | } |
1524 | else |
1526 | else |
1525 | return 0; |
1527 | return 0; |
1526 | |
1528 | |
1527 | return 1; |
1529 | return 1; |
|
|
1530 | } |
|
|
1531 | |
|
|
1532 | maptile * |
|
|
1533 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1534 | { |
|
|
1535 | maptile *map = xy_find (x, y); |
|
|
1536 | |
|
|
1537 | if (map) |
|
|
1538 | map->load_sync (); |
|
|
1539 | |
|
|
1540 | return map; |
|
|
1541 | } |
|
|
1542 | |
|
|
1543 | maptile * |
|
|
1544 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1545 | { |
|
|
1546 | return m->xy_load (*x, *y); |
1528 | } |
1547 | } |
1529 | |
1548 | |
1530 | /* From map.c |
1549 | /* From map.c |
1531 | * This is used by get_player to determine where the other |
1550 | * This is used by get_player to determine where the other |
1532 | * creature is. get_rangevector takes into account map tiling, |
1551 | * creature is. get_rangevector takes into account map tiling, |