ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.111 by elmex, Thu Jul 12 18:28:09 2007 UTC vs.
Revision 1.122 by root, Thu Aug 30 05:24:14 2007 UTC

… …
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 */
39const char *
40create_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 */
62int
63check_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
423void 357void
424maptile::activate () 358maptile::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
434void 366void
435maptile::deactivate () 367maptile::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 ();
… …
746 case KW_tile_path_1: thawer.get (tile_path [0]); break; 676 case KW_tile_path_1: thawer.get (tile_path [0]); break;
747 case KW_tile_path_2: thawer.get (tile_path [1]); break; 677 case KW_tile_path_2: thawer.get (tile_path [1]); break;
748 case KW_tile_path_3: thawer.get (tile_path [2]); break; 678 case KW_tile_path_3: thawer.get (tile_path [2]); break;
749 case KW_tile_path_4: thawer.get (tile_path [3]); break; 679 case KW_tile_path_4: thawer.get (tile_path [3]); break;
750 680
681 case KW_ERROR:
682 set_key (thawer.kw_str, thawer.value);
683 break;
684
751 case KW_end: 685 case KW_end:
752 return true; 686 return true;
753 687
754 default: 688 default:
755 if (!thawer.parse_error ("map", 0)) 689 if (!thawer.parse_error ("map", 0))
… …
876 * Remove and free all objects in the given map. 810 * Remove and free all objects in the given map.
877 */ 811 */
878void 812void
879maptile::clear () 813maptile::clear ()
880{ 814{
881 sfree (regions, size ()), regions = 0; 815 sfree (regions, size ()); regions = 0;
882 free (regionmap), regionmap = 0; 816 delete [] regionmap; regionmap = 0;
883 817
884 if (spaces) 818 if (spaces)
885 { 819 {
886 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 820 for (mapspace *ms = spaces + size (); ms-- > spaces; )
887 while (object *op = ms->bot) 821 while (object *op = ms->bot)
… …
955 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))
956 break; 890 break;
957 891
958 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 892 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
959 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 893 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
960 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
961 || QUERY_FLAG (op, FLAG_UNIQUE) 894 || QUERY_FLAG (op, FLAG_UNIQUE)
962 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 895 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
963 || QUERY_FLAG (op, FLAG_UNPAID) 896 || QUERY_FLAG (op, FLAG_UNPAID)
964 || op->is_alive ()) 897 || op->is_alive ())
965 ; // do not decay 898 ; // do not decay
… …
1290 vol += op->volume (); 1223 vol += op->volume ();
1291 1224
1292 return vol; 1225 return vol;
1293} 1226}
1294 1227
1295/* this updates the orig_map->tile_map[tile_num] value after finding 1228bool
1296 * the map. It also takes care of linking back the freshly found 1229maptile::tile_available (int dir, bool load)
1297 * maps tile_map values if it tiles back to this one. It returns
1298 * the value of orig_map->tile_map[tile_num].
1299 */
1300static inline maptile *
1301find_and_link (maptile *orig_map, int tile_num)
1302{ 1230{
1303 maptile *mp = orig_map->tile_map [tile_num]; 1231 if (!tile_path[dir])
1232 return 0;
1304 1233
1305 if (!mp) 1234 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1306 { 1235 return 1;
1307 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1308 1236
1309 if (!mp) 1237 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1310 { 1238 return 1;
1311 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1312 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1313 &orig_map->tile_path[tile_num], &orig_map->path);
1314 mp = new maptile (1, 1);
1315 mp->alloc ();
1316 mp->in_memory = MAP_IN_MEMORY;
1317 }
1318 }
1319 1239
1320 int dest_tile = (tile_num + 2) % 4;
1321
1322 orig_map->tile_map [tile_num] = mp;
1323
1324 // optimisation: back-link map to origin map if euclidean
1325 //TODO: non-euclidean maps MUST GO
1326 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1327 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1328
1329 return mp; 1240 return 0;
1330}
1331
1332static inline void
1333load_and_link (maptile *orig_map, int tile_num)
1334{
1335 find_and_link (orig_map, tile_num)->load_sync ();
1336} 1241}
1337 1242
1338/* this returns TRUE if the coordinates (x,y) are out of 1243/* this returns TRUE if the coordinates (x,y) are out of
1339 * map m. This function also takes into account any 1244 * map m. This function also takes into account any
1340 * tiling considerations, loading adjacant maps as needed. 1245 * tiling considerations, loading adjacant maps as needed.
… …
1353 if (!m) 1258 if (!m)
1354 return 0; 1259 return 0;
1355 1260
1356 if (x < 0) 1261 if (x < 0)
1357 { 1262 {
1358 if (!m->tile_path[3]) 1263 if (!m->tile_available (3))
1359 return 1; 1264 return 1;
1360 1265
1361 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1362 find_and_link (m, 3);
1363
1364 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);
1365 } 1267 }
1366 1268
1367 if (x >= m->width) 1269 if (x >= m->width)
1368 { 1270 {
1369 if (!m->tile_path[1]) 1271 if (!m->tile_available (1))
1370 return 1; 1272 return 1;
1371 1273
1372 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1373 find_and_link (m, 1);
1374
1375 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);
1376 } 1275 }
1377 1276
1378 if (y < 0) 1277 if (y < 0)
1379 { 1278 {
1380 if (!m->tile_path[0]) 1279 if (!m->tile_available (0))
1381 return 1; 1280 return 1;
1382 1281
1383 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1384 find_and_link (m, 0);
1385
1386 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);
1387 } 1283 }
1388 1284
1389 if (y >= m->height) 1285 if (y >= m->height)
1390 { 1286 {
1391 if (!m->tile_path[2]) 1287 if (!m->tile_available (2))
1392 return 1; 1288 return 1;
1393
1394 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1395 find_and_link (m, 2);
1396 1289
1397 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);
1398 } 1291 }
1399 1292
1400 /* Simple case - coordinates are within this local 1293 /* Simple case - coordinates are within this local
… …
1414maptile * 1307maptile *
1415maptile::xy_find (sint16 &x, sint16 &y) 1308maptile::xy_find (sint16 &x, sint16 &y)
1416{ 1309{
1417 if (x < 0) 1310 if (x < 0)
1418 { 1311 {
1419 if (!tile_path[3]) 1312 if (!tile_available (3))
1420 return 0; 1313 return 0;
1421 1314
1422 find_and_link (this, 3);
1423 x += tile_map[3]->width; 1315 x += tile_map[3]->width;
1424 return tile_map[3]->xy_find (x, y); 1316 return tile_map[3]->xy_find (x, y);
1425 } 1317 }
1426 1318
1427 if (x >= width) 1319 if (x >= width)
1428 { 1320 {
1429 if (!tile_path[1]) 1321 if (!tile_available (1))
1430 return 0; 1322 return 0;
1431 1323
1432 find_and_link (this, 1);
1433 x -= width; 1324 x -= width;
1434 return tile_map[1]->xy_find (x, y); 1325 return tile_map[1]->xy_find (x, y);
1435 } 1326 }
1436 1327
1437 if (y < 0) 1328 if (y < 0)
1438 { 1329 {
1439 if (!tile_path[0]) 1330 if (!tile_available (0))
1440 return 0; 1331 return 0;
1441 1332
1442 find_and_link (this, 0);
1443 y += tile_map[0]->height; 1333 y += tile_map[0]->height;
1444 return tile_map[0]->xy_find (x, y); 1334 return tile_map[0]->xy_find (x, y);
1445 } 1335 }
1446 1336
1447 if (y >= height) 1337 if (y >= height)
1448 { 1338 {
1449 if (!tile_path[2]) 1339 if (!tile_available (2))
1450 return 0; 1340 return 0;
1451 1341
1452 find_and_link (this, 2);
1453 y -= height; 1342 y -= height;
1454 return tile_map[2]->xy_find (x, y); 1343 return tile_map[2]->xy_find (x, y);
1455 } 1344 }
1456 1345
1457 /* Simple case - coordinates are within this local 1346 /* Simple case - coordinates are within this local
… …
1468adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1357adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1469{ 1358{
1470 if (!map1 || !map2) 1359 if (!map1 || !map2)
1471 return 0; 1360 return 0;
1472 1361
1473 //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
1474 //fix: compare paths instead (this is likely faster, too!) 1363 //fix: compare paths instead (this is likely faster, too!)
1475 if (map1 == map2) 1364 if (map1 == map2)
1476 { 1365 {
1477 *dx = 0; 1366 *dx = 0;
1478 *dy = 0; 1367 *dy = 0;
… …
1732 1621
1733 // instead of crashing in the unlikely(?) case, try to return *something* 1622 // instead of crashing in the unlikely(?) case, try to return *something*
1734 return get_archetype ("blocked"); 1623 return get_archetype ("blocked");
1735} 1624}
1736 1625
1626void
1627maptile::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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines