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 | } |
… | |
… | |
1286 | * the value of orig_map->tile_map[tile_num]. |
1284 | * the value of orig_map->tile_map[tile_num]. |
1287 | */ |
1285 | */ |
1288 | static inline maptile * |
1286 | static inline maptile * |
1289 | find_and_link (maptile *orig_map, int tile_num) |
1287 | find_and_link (maptile *orig_map, int tile_num) |
1290 | { |
1288 | { |
1291 | maptile *mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
1289 | maptile *mp = orig_map->tile_map [tile_num]; |
1292 | |
1290 | |
1293 | if (!mp) |
1291 | if (!mp) |
1294 | { |
1292 | { |
|
|
1293 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1294 | |
|
|
1295 | if (!mp) |
|
|
1296 | { |
1295 | // 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 |
1296 | 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", |
1297 | &orig_map->tile_path[tile_num], &orig_map->path); |
1299 | &orig_map->tile_path[tile_num], &orig_map->path); |
1298 | mp = new maptile (1, 1); |
1300 | mp = new maptile (1, 1); |
1299 | mp->alloc (); |
1301 | mp->alloc (); |
1300 | mp->in_memory = MAP_IN_MEMORY; |
1302 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1303 | } |
1301 | } |
1304 | } |
1302 | |
1305 | |
1303 | int dest_tile = (tile_num + 2) % 4; |
1306 | int dest_tile = (tile_num + 2) % 4; |
1304 | |
1307 | |
1305 | orig_map->tile_map[tile_num] = mp; |
1308 | orig_map->tile_map [tile_num] = mp; |
1306 | |
1309 | |
1307 | // optimisation: back-link map to origin map if euclidean |
1310 | // optimisation: back-link map to origin map if euclidean |
1308 | //TODO: non-euclidean maps MUST GO |
1311 | //TODO: non-euclidean maps MUST GO |
1309 | 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) |
1310 | 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; |