1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | #include <unistd.h> |
24 | #include <unistd.h> |
… | |
… | |
28 | #include "funcpoint.h" |
27 | #include "funcpoint.h" |
29 | |
28 | |
30 | #include "loader.h" |
29 | #include "loader.h" |
31 | |
30 | |
32 | #include "path.h" |
31 | #include "path.h" |
33 | |
|
|
34 | /* |
|
|
35 | * This makes a path absolute outside the world of Crossfire. |
|
|
36 | * In other words, it prepends LIBDIR/MAPDIR/ to the given path |
|
|
37 | * and returns the pointer to a static array containing the result. |
|
|
38 | * it really should be called create_mapname |
|
|
39 | */ |
|
|
40 | const char * |
|
|
41 | create_pathname (const char *name) |
|
|
42 | { |
|
|
43 | static char buf[8192]; |
|
|
44 | snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name); |
|
|
45 | return buf; |
|
|
46 | } |
|
|
47 | |
|
|
48 | /* |
|
|
49 | * This function checks if a file with the given path exists. |
|
|
50 | * -1 is returned if it fails, otherwise the mode of the file |
|
|
51 | * is returned. |
|
|
52 | * It tries out all the compression suffixes listed in the uncomp[] array. |
|
|
53 | * |
|
|
54 | * If prepend_dir is set, then we call create_pathname (which prepends |
|
|
55 | * libdir & mapdir). Otherwise, we assume the name given is fully |
|
|
56 | * complete. |
|
|
57 | * Only the editor actually cares about the writablity of this - |
|
|
58 | * the rest of the code only cares that the file is readable. |
|
|
59 | * when the editor goes away, the call to stat should probably be |
|
|
60 | * replaced by an access instead (similar to the windows one, but |
|
|
61 | * that seems to be missing the prepend_dir processing |
|
|
62 | */ |
|
|
63 | int |
|
|
64 | check_path (const char *name, int prepend_dir) |
|
|
65 | { |
|
|
66 | char buf[MAX_BUF]; |
|
|
67 | |
|
|
68 | char *endbuf; |
|
|
69 | struct stat statbuf; |
|
|
70 | int mode = 0; |
|
|
71 | |
|
|
72 | if (prepend_dir) |
|
|
73 | assign (buf, create_pathname (name)); |
|
|
74 | else |
|
|
75 | assign (buf, name); |
|
|
76 | |
|
|
77 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
|
|
78 | * this method should be equivalant and is clearer. |
|
|
79 | * Can not use strcat because we need to cycle through |
|
|
80 | * all the names. |
|
|
81 | */ |
|
|
82 | endbuf = buf + strlen (buf); |
|
|
83 | |
|
|
84 | if (stat (buf, &statbuf)) |
|
|
85 | return -1; |
|
|
86 | if (!S_ISREG (statbuf.st_mode)) |
|
|
87 | return (-1); |
|
|
88 | |
|
|
89 | if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) || |
|
|
90 | ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH)) |
|
|
91 | mode |= 4; |
|
|
92 | |
|
|
93 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
|
|
94 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
|
|
95 | mode |= 2; |
|
|
96 | |
|
|
97 | return (mode); |
|
|
98 | } |
|
|
99 | |
32 | |
100 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
101 | * one function that just returns a P_.. value (see map.h) |
34 | * one function that just returns a P_.. value (see map.h) |
102 | * it will also do map translation for tiled maps, returning |
35 | * it will also do map translation for tiled maps, returning |
103 | * new values into newmap, nx, and ny. Any and all of those |
36 | * new values into newmap, nx, and ny. Any and all of those |
… | |
… | |
356 | { |
289 | { |
357 | if (!spaces) |
290 | if (!spaces) |
358 | return; |
291 | return; |
359 | |
292 | |
360 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
293 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (object *op = ms->bot; op; op = op->above) |
294 | { |
|
|
295 | object *op = ms->bot; |
|
|
296 | while (op) |
362 | { |
297 | { |
363 | /* already multipart - don't do anything more */ |
298 | /* already multipart - don't do anything more */ |
364 | if (op->head_ () == op && !op->more && op->arch->more) |
299 | if (op->head_ () == op && !op->more && op->arch->more) |
365 | { |
300 | { |
366 | op->remove (); |
301 | op->remove (); |
367 | op->expand_tail (); |
302 | op->expand_tail (); |
|
|
303 | |
|
|
304 | // FIXME: INS_ON_TOP is just a workaround for the pentagram vs. |
|
|
305 | // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters |
|
|
306 | // below the pentagrams... hopefully INS_ON_TOP doesn't break anything |
368 | insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); |
307 | insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON); |
|
|
308 | |
|
|
309 | op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP |
|
|
310 | // so we have to reset the iteration through the mapspace |
369 | } |
311 | } |
|
|
312 | else |
|
|
313 | op = op->above; |
370 | } |
314 | } |
|
|
315 | } |
371 | } |
316 | } |
372 | |
317 | |
373 | /* |
318 | /* |
374 | * Loads (ands parses) the objects into a given map from the specified |
319 | * Loads (ands parses) the objects into a given map from the specified |
375 | * file pointer. |
320 | * file pointer. |
… | |
… | |
410 | } |
355 | } |
411 | |
356 | |
412 | void |
357 | void |
413 | maptile::activate () |
358 | maptile::activate () |
414 | { |
359 | { |
415 | active = true; |
|
|
416 | |
|
|
417 | if (spaces) |
360 | if (spaces) |
418 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
419 | for (object *op = ms->bot; op; op = op->above) |
362 | for (object *op = ms->bot; op; op = op->above) |
420 | op->activate_recursive (); |
363 | op->activate_recursive (); |
421 | } |
364 | } |
422 | |
365 | |
423 | void |
366 | void |
424 | maptile::deactivate () |
367 | maptile::deactivate () |
425 | { |
368 | { |
426 | active = false; |
|
|
427 | |
|
|
428 | if (spaces) |
369 | if (spaces) |
429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
430 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
431 | op->deactivate_recursive (); |
372 | op->deactivate_recursive (); |
432 | } |
373 | } |
… | |
… | |
735 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
676 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
736 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
677 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
737 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
678 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
738 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
679 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
739 | |
680 | |
|
|
681 | case KW_ERROR: |
|
|
682 | set_key (thawer.kw_str, thawer.value); |
|
|
683 | break; |
|
|
684 | |
740 | case KW_end: |
685 | case KW_end: |
741 | return true; |
686 | return true; |
742 | |
687 | |
743 | default: |
688 | default: |
744 | if (!thawer.parse_error ("map", 0)) |
689 | if (!thawer.parse_error ("map", 0)) |
… | |
… | |
865 | * Remove and free all objects in the given map. |
810 | * Remove and free all objects in the given map. |
866 | */ |
811 | */ |
867 | void |
812 | void |
868 | maptile::clear () |
813 | maptile::clear () |
869 | { |
814 | { |
870 | sfree (regions, size ()), regions = 0; |
815 | sfree (regions, size ()); regions = 0; |
871 | free (regionmap), regionmap = 0; |
816 | delete [] regionmap; regionmap = 0; |
872 | |
817 | |
873 | if (spaces) |
818 | if (spaces) |
874 | { |
819 | { |
875 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
820 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
876 | while (object *op = ms->bot) |
821 | while (object *op = ms->bot) |
… | |
… | |
1279 | vol += op->volume (); |
1224 | vol += op->volume (); |
1280 | |
1225 | |
1281 | return vol; |
1226 | return vol; |
1282 | } |
1227 | } |
1283 | |
1228 | |
1284 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1229 | bool |
1285 | * the map. It also takes care of linking back the freshly found |
1230 | maptile::tile_available (int dir, bool load) |
1286 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1287 | * the value of orig_map->tile_map[tile_num]. |
|
|
1288 | */ |
|
|
1289 | static inline maptile * |
|
|
1290 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1291 | { |
1231 | { |
1292 | maptile *mp = orig_map->tile_map [tile_num]; |
1232 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
|
|
1233 | return 1; |
1293 | |
1234 | |
1294 | if (!mp) |
1235 | if (!tile_path[dir]) |
1295 | { |
1236 | return 0; |
1296 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1297 | |
1237 | |
1298 | if (!mp) |
1238 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1299 | { |
1239 | return 1; |
1300 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1301 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1302 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1303 | mp = new maptile (1, 1); |
|
|
1304 | mp->alloc (); |
|
|
1305 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1306 | } |
|
|
1307 | } |
|
|
1308 | |
1240 | |
1309 | int dest_tile = (tile_num + 2) % 4; |
|
|
1310 | |
|
|
1311 | orig_map->tile_map [tile_num] = mp; |
|
|
1312 | |
|
|
1313 | // optimisation: back-link map to origin map if euclidean |
|
|
1314 | //TODO: non-euclidean maps MUST GO |
|
|
1315 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1316 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1317 | |
|
|
1318 | return mp; |
1241 | return 0; |
1319 | } |
|
|
1320 | |
|
|
1321 | static inline void |
|
|
1322 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1323 | { |
|
|
1324 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1325 | } |
1242 | } |
1326 | |
1243 | |
1327 | /* this returns TRUE if the coordinates (x,y) are out of |
1244 | /* this returns TRUE if the coordinates (x,y) are out of |
1328 | * map m. This function also takes into account any |
1245 | * map m. This function also takes into account any |
1329 | * tiling considerations, loading adjacant maps as needed. |
1246 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1342 | if (!m) |
1259 | if (!m) |
1343 | return 0; |
1260 | return 0; |
1344 | |
1261 | |
1345 | if (x < 0) |
1262 | if (x < 0) |
1346 | { |
1263 | { |
1347 | if (!m->tile_path[3]) |
1264 | if (!m->tile_available (3, 0)) |
1348 | return 1; |
1265 | return 1; |
1349 | |
1266 | |
1350 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1351 | find_and_link (m, 3); |
|
|
1352 | |
|
|
1353 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1267 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1354 | } |
1268 | } |
1355 | |
1269 | |
1356 | if (x >= m->width) |
1270 | if (x >= m->width) |
1357 | { |
1271 | { |
1358 | if (!m->tile_path[1]) |
1272 | if (!m->tile_available (1, 0)) |
1359 | return 1; |
1273 | return 1; |
1360 | |
1274 | |
1361 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1362 | find_and_link (m, 1); |
|
|
1363 | |
|
|
1364 | return out_of_map (m->tile_map[1], x - m->width, y); |
1275 | return out_of_map (m->tile_map[1], x - m->width, y); |
1365 | } |
1276 | } |
1366 | |
1277 | |
1367 | if (y < 0) |
1278 | if (y < 0) |
1368 | { |
1279 | { |
1369 | if (!m->tile_path[0]) |
1280 | if (!m->tile_available (0, 0)) |
1370 | return 1; |
1281 | return 1; |
1371 | |
1282 | |
1372 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1373 | find_and_link (m, 0); |
|
|
1374 | |
|
|
1375 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1283 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1376 | } |
1284 | } |
1377 | |
1285 | |
1378 | if (y >= m->height) |
1286 | if (y >= m->height) |
1379 | { |
1287 | { |
1380 | if (!m->tile_path[2]) |
1288 | if (!m->tile_available (2, 0)) |
1381 | return 1; |
1289 | return 1; |
1382 | |
|
|
1383 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1384 | find_and_link (m, 2); |
|
|
1385 | |
1290 | |
1386 | return out_of_map (m->tile_map[2], x, y - m->height); |
1291 | return out_of_map (m->tile_map[2], x, y - m->height); |
1387 | } |
1292 | } |
1388 | |
1293 | |
1389 | /* Simple case - coordinates are within this local |
1294 | /* Simple case - coordinates are within this local |
… | |
… | |
1403 | maptile * |
1308 | maptile * |
1404 | maptile::xy_find (sint16 &x, sint16 &y) |
1309 | maptile::xy_find (sint16 &x, sint16 &y) |
1405 | { |
1310 | { |
1406 | if (x < 0) |
1311 | if (x < 0) |
1407 | { |
1312 | { |
1408 | if (!tile_path[3]) |
1313 | if (!tile_available (3, 1)) |
1409 | return 0; |
1314 | return 0; |
1410 | |
1315 | |
1411 | find_and_link (this, 3); |
|
|
1412 | x += tile_map[3]->width; |
1316 | x += tile_map[3]->width; |
1413 | return tile_map[3]->xy_find (x, y); |
1317 | return tile_map[3]->xy_find (x, y); |
1414 | } |
1318 | } |
1415 | |
1319 | |
1416 | if (x >= width) |
1320 | if (x >= width) |
1417 | { |
1321 | { |
1418 | if (!tile_path[1]) |
1322 | if (!tile_available (1, 1)) |
1419 | return 0; |
1323 | return 0; |
1420 | |
1324 | |
1421 | find_and_link (this, 1); |
|
|
1422 | x -= width; |
1325 | x -= width; |
1423 | return tile_map[1]->xy_find (x, y); |
1326 | return tile_map[1]->xy_find (x, y); |
1424 | } |
1327 | } |
1425 | |
1328 | |
1426 | if (y < 0) |
1329 | if (y < 0) |
1427 | { |
1330 | { |
1428 | if (!tile_path[0]) |
1331 | if (!tile_available (0, 1)) |
1429 | return 0; |
1332 | return 0; |
1430 | |
1333 | |
1431 | find_and_link (this, 0); |
|
|
1432 | y += tile_map[0]->height; |
1334 | y += tile_map[0]->height; |
1433 | return tile_map[0]->xy_find (x, y); |
1335 | return tile_map[0]->xy_find (x, y); |
1434 | } |
1336 | } |
1435 | |
1337 | |
1436 | if (y >= height) |
1338 | if (y >= height) |
1437 | { |
1339 | { |
1438 | if (!tile_path[2]) |
1340 | if (!tile_available (2, 1)) |
1439 | return 0; |
1341 | return 0; |
1440 | |
1342 | |
1441 | find_and_link (this, 2); |
|
|
1442 | y -= height; |
1343 | y -= height; |
1443 | return tile_map[2]->xy_find (x, y); |
1344 | return tile_map[2]->xy_find (x, y); |
1444 | } |
1345 | } |
1445 | |
1346 | |
1446 | /* Simple case - coordinates are within this local |
1347 | /* Simple case - coordinates are within this local |
… | |
… | |
1721 | |
1622 | |
1722 | // instead of crashing in the unlikely(?) case, try to return *something* |
1623 | // instead of crashing in the unlikely(?) case, try to return *something* |
1723 | return get_archetype ("blocked"); |
1624 | return get_archetype ("blocked"); |
1724 | } |
1625 | } |
1725 | |
1626 | |
|
|
1627 | void |
|
|
1628 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1629 | { |
|
|
1630 | if (!sound) |
|
|
1631 | return; |
|
|
1632 | |
|
|
1633 | for_all_players (pl) |
|
|
1634 | if (pl->ob->map == this) |
|
|
1635 | if (client *ns = pl->ns) |
|
|
1636 | { |
|
|
1637 | int dx = x - pl->ob->x; |
|
|
1638 | int dy = y - pl->ob->y; |
|
|
1639 | |
|
|
1640 | int distance = idistance (dx, dy); |
|
|
1641 | |
|
|
1642 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1643 | ns->play_sound (sound, dx, dy); |
|
|
1644 | } |
|
|
1645 | } |
|
|
1646 | |