… | |
… | |
27 | #include "funcpoint.h" |
27 | #include "funcpoint.h" |
28 | |
28 | |
29 | #include "loader.h" |
29 | #include "loader.h" |
30 | |
30 | |
31 | #include "path.h" |
31 | #include "path.h" |
32 | |
|
|
33 | /* |
|
|
34 | * This makes a path absolute outside the world of Crossfire. |
|
|
35 | * In other words, it prepends LIBDIR/MAPDIR/ to the given path |
|
|
36 | * and returns the pointer to a static array containing the result. |
|
|
37 | * it really should be called create_mapname |
|
|
38 | */ |
|
|
39 | const char * |
|
|
40 | create_pathname (const char *name) |
|
|
41 | { |
|
|
42 | static char buf[8192]; |
|
|
43 | snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name); |
|
|
44 | return buf; |
|
|
45 | } |
|
|
46 | |
|
|
47 | /* |
|
|
48 | * This function checks if a file with the given path exists. |
|
|
49 | * -1 is returned if it fails, otherwise the mode of the file |
|
|
50 | * is returned. |
|
|
51 | * It tries out all the compression suffixes listed in the uncomp[] array. |
|
|
52 | * |
|
|
53 | * If prepend_dir is set, then we call create_pathname (which prepends |
|
|
54 | * libdir & mapdir). Otherwise, we assume the name given is fully |
|
|
55 | * complete. |
|
|
56 | * Only the editor actually cares about the writablity of this - |
|
|
57 | * the rest of the code only cares that the file is readable. |
|
|
58 | * when the editor goes away, the call to stat should probably be |
|
|
59 | * replaced by an access instead (similar to the windows one, but |
|
|
60 | * that seems to be missing the prepend_dir processing |
|
|
61 | */ |
|
|
62 | int |
|
|
63 | check_path (const char *name, int prepend_dir) |
|
|
64 | { |
|
|
65 | char buf[MAX_BUF]; |
|
|
66 | |
|
|
67 | char *endbuf; |
|
|
68 | struct stat statbuf; |
|
|
69 | int mode = 0; |
|
|
70 | |
|
|
71 | if (prepend_dir) |
|
|
72 | assign (buf, create_pathname (name)); |
|
|
73 | else |
|
|
74 | assign (buf, name); |
|
|
75 | |
|
|
76 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
|
|
77 | * this method should be equivalant and is clearer. |
|
|
78 | * Can not use strcat because we need to cycle through |
|
|
79 | * all the names. |
|
|
80 | */ |
|
|
81 | endbuf = buf + strlen (buf); |
|
|
82 | |
|
|
83 | if (stat (buf, &statbuf)) |
|
|
84 | return -1; |
|
|
85 | if (!S_ISREG (statbuf.st_mode)) |
|
|
86 | return (-1); |
|
|
87 | |
|
|
88 | if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) || |
|
|
89 | ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH)) |
|
|
90 | mode |= 4; |
|
|
91 | |
|
|
92 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
|
|
93 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
|
|
94 | mode |= 2; |
|
|
95 | |
|
|
96 | return (mode); |
|
|
97 | } |
|
|
98 | |
32 | |
99 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
100 | * one function that just returns a P_.. value (see map.h) |
34 | * one function that just returns a P_.. value (see map.h) |
101 | * it will also do map translation for tiled maps, returning |
35 | * it will also do map translation for tiled maps, returning |
102 | * 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 |
… | |
… | |
421 | } |
355 | } |
422 | |
356 | |
423 | void |
357 | void |
424 | maptile::activate () |
358 | maptile::activate () |
425 | { |
359 | { |
426 | active = true; |
|
|
427 | |
|
|
428 | if (spaces) |
360 | if (spaces) |
429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
430 | for (object *op = ms->bot; op; op = op->above) |
362 | for (object *op = ms->bot; op; op = op->above) |
431 | op->activate_recursive (); |
363 | op->activate_recursive (); |
432 | } |
364 | } |
433 | |
365 | |
434 | void |
366 | void |
435 | maptile::deactivate () |
367 | maptile::deactivate () |
436 | { |
368 | { |
437 | active = false; |
|
|
438 | |
|
|
439 | if (spaces) |
369 | if (spaces) |
440 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
441 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
442 | op->deactivate_recursive (); |
372 | op->deactivate_recursive (); |
443 | } |
373 | } |
… | |
… | |
453 | if (!spaces) |
383 | if (!spaces) |
454 | return false; |
384 | return false; |
455 | |
385 | |
456 | for (int i = 0; i < size (); ++i) |
386 | for (int i = 0; i < size (); ++i) |
457 | { |
387 | { |
458 | int unique = 0; |
388 | bool unique = 0; |
|
|
389 | |
459 | for (object *op = spaces [i].bot; op; op = op->above) |
390 | for (object *op = spaces [i].bot; op; op = op->above) |
460 | { |
391 | { |
461 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
392 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
462 | unique = 1; |
|
|
463 | |
393 | |
464 | if (!op->can_map_save ()) |
394 | if (expect_false (!op->can_map_save ())) |
465 | continue; |
395 | continue; |
466 | |
396 | |
467 | if (unique || op->flag [FLAG_UNIQUE]) |
397 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
468 | { |
398 | { |
469 | if (flags & IO_UNIQUES) |
399 | if (flags & IO_UNIQUES) |
470 | op->write (f); |
400 | op->write (f); |
471 | } |
401 | } |
472 | else if (flags & IO_OBJECTS) |
402 | else if (expect_true (flags & IO_OBJECTS)) |
473 | op->write (f); |
403 | op->write (f); |
474 | } |
404 | } |
475 | } |
405 | } |
476 | |
406 | |
477 | coroapi::cede_to_tick (); |
407 | coroapi::cede_to_tick (); |
… | |
… | |
959 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
889 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
960 | break; |
890 | break; |
961 | |
891 | |
962 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
892 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
963 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
893 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
964 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
965 | || QUERY_FLAG (op, FLAG_UNIQUE) |
894 | || QUERY_FLAG (op, FLAG_UNIQUE) |
966 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
895 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
967 | || QUERY_FLAG (op, FLAG_UNPAID) |
896 | || QUERY_FLAG (op, FLAG_UNPAID) |
968 | || op->is_alive ()) |
897 | || op->is_alive ()) |
969 | ; // do not decay |
898 | ; // do not decay |
… | |
… | |
1294 | vol += op->volume (); |
1223 | vol += op->volume (); |
1295 | |
1224 | |
1296 | return vol; |
1225 | return vol; |
1297 | } |
1226 | } |
1298 | |
1227 | |
1299 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1228 | bool |
1300 | * the map. It also takes care of linking back the freshly found |
1229 | maptile::tile_available (int dir, bool load) |
1301 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1302 | * the value of orig_map->tile_map[tile_num]. |
|
|
1303 | */ |
|
|
1304 | static inline maptile * |
|
|
1305 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1306 | { |
1230 | { |
1307 | maptile *mp = orig_map->tile_map [tile_num]; |
1231 | if (!tile_path[dir]) |
|
|
1232 | return 0; |
1308 | |
1233 | |
1309 | if (!mp) |
1234 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1310 | { |
1235 | return 1; |
1311 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1312 | |
1236 | |
1313 | if (!mp) |
1237 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1314 | { |
1238 | return 1; |
1315 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1316 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1317 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1318 | mp = new maptile (1, 1); |
|
|
1319 | mp->alloc (); |
|
|
1320 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1321 | } |
|
|
1322 | } |
|
|
1323 | |
1239 | |
1324 | int dest_tile = (tile_num + 2) % 4; |
|
|
1325 | |
|
|
1326 | orig_map->tile_map [tile_num] = mp; |
|
|
1327 | |
|
|
1328 | // optimisation: back-link map to origin map if euclidean |
|
|
1329 | //TODO: non-euclidean maps MUST GO |
|
|
1330 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1331 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1332 | |
|
|
1333 | return mp; |
1240 | return 0; |
1334 | } |
|
|
1335 | |
|
|
1336 | static inline void |
|
|
1337 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1338 | { |
|
|
1339 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1340 | } |
1241 | } |
1341 | |
1242 | |
1342 | /* this returns TRUE if the coordinates (x,y) are out of |
1243 | /* this returns TRUE if the coordinates (x,y) are out of |
1343 | * map m. This function also takes into account any |
1244 | * map m. This function also takes into account any |
1344 | * tiling considerations, loading adjacant maps as needed. |
1245 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1357 | if (!m) |
1258 | if (!m) |
1358 | return 0; |
1259 | return 0; |
1359 | |
1260 | |
1360 | if (x < 0) |
1261 | if (x < 0) |
1361 | { |
1262 | { |
1362 | if (!m->tile_path[3]) |
1263 | if (!m->tile_available (3)) |
1363 | return 1; |
1264 | return 1; |
1364 | |
1265 | |
1365 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1366 | find_and_link (m, 3); |
|
|
1367 | |
|
|
1368 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1266 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1369 | } |
1267 | } |
1370 | |
1268 | |
1371 | if (x >= m->width) |
1269 | if (x >= m->width) |
1372 | { |
1270 | { |
1373 | if (!m->tile_path[1]) |
1271 | if (!m->tile_available (1)) |
1374 | return 1; |
1272 | return 1; |
1375 | |
1273 | |
1376 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1377 | find_and_link (m, 1); |
|
|
1378 | |
|
|
1379 | return out_of_map (m->tile_map[1], x - m->width, y); |
1274 | return out_of_map (m->tile_map[1], x - m->width, y); |
1380 | } |
1275 | } |
1381 | |
1276 | |
1382 | if (y < 0) |
1277 | if (y < 0) |
1383 | { |
1278 | { |
1384 | if (!m->tile_path[0]) |
1279 | if (!m->tile_available (0)) |
1385 | return 1; |
1280 | return 1; |
1386 | |
1281 | |
1387 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1388 | find_and_link (m, 0); |
|
|
1389 | |
|
|
1390 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1282 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1391 | } |
1283 | } |
1392 | |
1284 | |
1393 | if (y >= m->height) |
1285 | if (y >= m->height) |
1394 | { |
1286 | { |
1395 | if (!m->tile_path[2]) |
1287 | if (!m->tile_available (2)) |
1396 | return 1; |
1288 | return 1; |
1397 | |
|
|
1398 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1399 | find_and_link (m, 2); |
|
|
1400 | |
1289 | |
1401 | return out_of_map (m->tile_map[2], x, y - m->height); |
1290 | return out_of_map (m->tile_map[2], x, y - m->height); |
1402 | } |
1291 | } |
1403 | |
1292 | |
1404 | /* Simple case - coordinates are within this local |
1293 | /* Simple case - coordinates are within this local |
… | |
… | |
1418 | maptile * |
1307 | maptile * |
1419 | maptile::xy_find (sint16 &x, sint16 &y) |
1308 | maptile::xy_find (sint16 &x, sint16 &y) |
1420 | { |
1309 | { |
1421 | if (x < 0) |
1310 | if (x < 0) |
1422 | { |
1311 | { |
1423 | if (!tile_path[3]) |
1312 | if (!tile_available (3)) |
1424 | return 0; |
1313 | return 0; |
1425 | |
1314 | |
1426 | find_and_link (this, 3); |
|
|
1427 | x += tile_map[3]->width; |
1315 | x += tile_map[3]->width; |
1428 | return tile_map[3]->xy_find (x, y); |
1316 | return tile_map[3]->xy_find (x, y); |
1429 | } |
1317 | } |
1430 | |
1318 | |
1431 | if (x >= width) |
1319 | if (x >= width) |
1432 | { |
1320 | { |
1433 | if (!tile_path[1]) |
1321 | if (!tile_available (1)) |
1434 | return 0; |
1322 | return 0; |
1435 | |
1323 | |
1436 | find_and_link (this, 1); |
|
|
1437 | x -= width; |
1324 | x -= width; |
1438 | return tile_map[1]->xy_find (x, y); |
1325 | return tile_map[1]->xy_find (x, y); |
1439 | } |
1326 | } |
1440 | |
1327 | |
1441 | if (y < 0) |
1328 | if (y < 0) |
1442 | { |
1329 | { |
1443 | if (!tile_path[0]) |
1330 | if (!tile_available (0)) |
1444 | return 0; |
1331 | return 0; |
1445 | |
1332 | |
1446 | find_and_link (this, 0); |
|
|
1447 | y += tile_map[0]->height; |
1333 | y += tile_map[0]->height; |
1448 | return tile_map[0]->xy_find (x, y); |
1334 | return tile_map[0]->xy_find (x, y); |
1449 | } |
1335 | } |
1450 | |
1336 | |
1451 | if (y >= height) |
1337 | if (y >= height) |
1452 | { |
1338 | { |
1453 | if (!tile_path[2]) |
1339 | if (!tile_available (2)) |
1454 | return 0; |
1340 | return 0; |
1455 | |
1341 | |
1456 | find_and_link (this, 2); |
|
|
1457 | y -= height; |
1342 | y -= height; |
1458 | return tile_map[2]->xy_find (x, y); |
1343 | return tile_map[2]->xy_find (x, y); |
1459 | } |
1344 | } |
1460 | |
1345 | |
1461 | /* Simple case - coordinates are within this local |
1346 | /* Simple case - coordinates are within this local |
… | |
… | |
1472 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1357 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1473 | { |
1358 | { |
1474 | if (!map1 || !map2) |
1359 | if (!map1 || !map2) |
1475 | return 0; |
1360 | return 0; |
1476 | |
1361 | |
1477 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
1362 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
1478 | //fix: compare paths instead (this is likely faster, too!) |
1363 | //fix: compare paths instead (this is likely faster, too!) |
1479 | if (map1 == map2) |
1364 | if (map1 == map2) |
1480 | { |
1365 | { |
1481 | *dx = 0; |
1366 | *dx = 0; |
1482 | *dy = 0; |
1367 | *dy = 0; |
… | |
… | |
1736 | |
1621 | |
1737 | // instead of crashing in the unlikely(?) case, try to return *something* |
1622 | // instead of crashing in the unlikely(?) case, try to return *something* |
1738 | return get_archetype ("blocked"); |
1623 | return get_archetype ("blocked"); |
1739 | } |
1624 | } |
1740 | |
1625 | |
|
|
1626 | void |
|
|
1627 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1628 | { |
|
|
1629 | if (!sound) |
|
|
1630 | return; |
|
|
1631 | |
|
|
1632 | for_all_players (pl) |
|
|
1633 | if (pl->ob->map == this) |
|
|
1634 | if (client *ns = pl->ns) |
|
|
1635 | { |
|
|
1636 | int dx = x - pl->ob->x; |
|
|
1637 | int dy = y - pl->ob->y; |
|
|
1638 | |
|
|
1639 | int distance = idistance (dx, dy); |
|
|
1640 | |
|
|
1641 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1642 | ns->play_sound (sound, dx, dy); |
|
|
1643 | } |
|
|
1644 | } |
|
|
1645 | |