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.113 by root, Fri Jul 13 15:54:40 2007 UTC vs.
Revision 1.124 by root, Tue Sep 4 05:43:20 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 ();
478 408
479 return true; 409 return true;
480}
481
482bool
483maptile::_load_objects (const char *path, bool skip_header)
484{
485 object_thawer f (path);
486
487 if (!f)
488 return false;
489
490 f.next ();
491
492 if (skip_header)
493 for (;;)
494 {
495 keyword kw = f.kw;
496 f.skip ();
497 if (kw == KW_end)
498 break;
499 }
500
501 return _load_objects (f);
502} 410}
503 411
504bool 412bool
505maptile::_save_objects (const char *path, int flags) 413maptile::_save_objects (const char *path, int flags)
506{ 414{
681bool 589bool
682maptile::_load_header (object_thawer &thawer) 590maptile::_load_header (object_thawer &thawer)
683{ 591{
684 for (;;) 592 for (;;)
685 { 593 {
686 thawer.next ();
687
688 switch (thawer.kw) 594 switch (thawer.kw)
689 { 595 {
690 case KW_msg: 596 case KW_msg:
691 thawer.get_ml (KW_endmsg, msg); 597 thawer.get_ml (KW_endmsg, msg);
692 break; 598 break;
747 case KW_tile_path_2: thawer.get (tile_path [1]); break; 653 case KW_tile_path_2: thawer.get (tile_path [1]); break;
748 case KW_tile_path_3: thawer.get (tile_path [2]); break; 654 case KW_tile_path_3: thawer.get (tile_path [2]); break;
749 case KW_tile_path_4: thawer.get (tile_path [3]); break; 655 case KW_tile_path_4: thawer.get (tile_path [3]); break;
750 656
751 case KW_ERROR: 657 case KW_ERROR:
752 set_key (thawer.kw_str, thawer.value); 658 set_key_text (thawer.kw_str, thawer.value);
753 break; 659 break;
754 660
755 case KW_end: 661 case KW_end:
662 thawer.next ();
756 return true; 663 return true;
757 664
758 default: 665 default:
759 if (!thawer.parse_error ("map", 0)) 666 if (!thawer.parse_error ("map", 0))
760 return false; 667 return false;
761 break; 668 break;
762 } 669 }
670
671 thawer.next ();
763 } 672 }
764 673
765 abort (); 674 abort ();
766}
767
768bool
769maptile::_load_header (const char *path)
770{
771 object_thawer thawer (path);
772
773 if (!thawer)
774 return false;
775
776 return _load_header (thawer);
777} 675}
778 676
779/****************************************************************************** 677/******************************************************************************
780 * This is the start of unique map handling code 678 * This is the start of unique map handling code
781 *****************************************************************************/ 679 *****************************************************************************/
959 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 857 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
960 break; 858 break;
961 859
962 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 860 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
963 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 861 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
964 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
965 || QUERY_FLAG (op, FLAG_UNIQUE) 862 || QUERY_FLAG (op, FLAG_UNIQUE)
966 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 863 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
967 || QUERY_FLAG (op, FLAG_UNPAID) 864 || QUERY_FLAG (op, FLAG_UNPAID)
968 || op->is_alive ()) 865 || op->is_alive ())
969 ; // do not decay 866 ; // do not decay
1294 vol += op->volume (); 1191 vol += op->volume ();
1295 1192
1296 return vol; 1193 return vol;
1297} 1194}
1298 1195
1299/* this updates the orig_map->tile_map[tile_num] value after finding 1196bool
1300 * the map. It also takes care of linking back the freshly found 1197maptile::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 */
1304static inline maptile *
1305find_and_link (maptile *orig_map, int tile_num)
1306{ 1198{
1307 maptile *mp = orig_map->tile_map [tile_num]; 1199 if (!tile_path[dir])
1200 return 0;
1308 1201
1309 if (!mp) 1202 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1310 { 1203 return 1;
1311 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1312 1204
1313 if (!mp) 1205 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1314 { 1206 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 1207
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; 1208 return 0;
1334}
1335
1336static inline void
1337load_and_link (maptile *orig_map, int tile_num)
1338{
1339 find_and_link (orig_map, tile_num)->load_sync ();
1340} 1209}
1341 1210
1342/* this returns TRUE if the coordinates (x,y) are out of 1211/* this returns TRUE if the coordinates (x,y) are out of
1343 * map m. This function also takes into account any 1212 * map m. This function also takes into account any
1344 * tiling considerations, loading adjacant maps as needed. 1213 * tiling considerations, loading adjacant maps as needed.
1357 if (!m) 1226 if (!m)
1358 return 0; 1227 return 0;
1359 1228
1360 if (x < 0) 1229 if (x < 0)
1361 { 1230 {
1362 if (!m->tile_path[3]) 1231 if (!m->tile_available (3))
1363 return 1; 1232 return 1;
1364 1233
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); 1234 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1369 } 1235 }
1370 1236
1371 if (x >= m->width) 1237 if (x >= m->width)
1372 { 1238 {
1373 if (!m->tile_path[1]) 1239 if (!m->tile_available (1))
1374 return 1; 1240 return 1;
1375 1241
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); 1242 return out_of_map (m->tile_map[1], x - m->width, y);
1380 } 1243 }
1381 1244
1382 if (y < 0) 1245 if (y < 0)
1383 { 1246 {
1384 if (!m->tile_path[0]) 1247 if (!m->tile_available (0))
1385 return 1; 1248 return 1;
1386 1249
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); 1250 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1391 } 1251 }
1392 1252
1393 if (y >= m->height) 1253 if (y >= m->height)
1394 { 1254 {
1395 if (!m->tile_path[2]) 1255 if (!m->tile_available (2))
1396 return 1; 1256 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 1257
1401 return out_of_map (m->tile_map[2], x, y - m->height); 1258 return out_of_map (m->tile_map[2], x, y - m->height);
1402 } 1259 }
1403 1260
1404 /* Simple case - coordinates are within this local 1261 /* Simple case - coordinates are within this local
1418maptile * 1275maptile *
1419maptile::xy_find (sint16 &x, sint16 &y) 1276maptile::xy_find (sint16 &x, sint16 &y)
1420{ 1277{
1421 if (x < 0) 1278 if (x < 0)
1422 { 1279 {
1423 if (!tile_path[3]) 1280 if (!tile_available (3))
1424 return 0; 1281 return 0;
1425 1282
1426 find_and_link (this, 3);
1427 x += tile_map[3]->width; 1283 x += tile_map[3]->width;
1428 return tile_map[3]->xy_find (x, y); 1284 return tile_map[3]->xy_find (x, y);
1429 } 1285 }
1430 1286
1431 if (x >= width) 1287 if (x >= width)
1432 { 1288 {
1433 if (!tile_path[1]) 1289 if (!tile_available (1))
1434 return 0; 1290 return 0;
1435 1291
1436 find_and_link (this, 1);
1437 x -= width; 1292 x -= width;
1438 return tile_map[1]->xy_find (x, y); 1293 return tile_map[1]->xy_find (x, y);
1439 } 1294 }
1440 1295
1441 if (y < 0) 1296 if (y < 0)
1442 { 1297 {
1443 if (!tile_path[0]) 1298 if (!tile_available (0))
1444 return 0; 1299 return 0;
1445 1300
1446 find_and_link (this, 0);
1447 y += tile_map[0]->height; 1301 y += tile_map[0]->height;
1448 return tile_map[0]->xy_find (x, y); 1302 return tile_map[0]->xy_find (x, y);
1449 } 1303 }
1450 1304
1451 if (y >= height) 1305 if (y >= height)
1452 { 1306 {
1453 if (!tile_path[2]) 1307 if (!tile_available (2))
1454 return 0; 1308 return 0;
1455 1309
1456 find_and_link (this, 2);
1457 y -= height; 1310 y -= height;
1458 return tile_map[2]->xy_find (x, y); 1311 return tile_map[2]->xy_find (x, y);
1459 } 1312 }
1460 1313
1461 /* Simple case - coordinates are within this local 1314 /* Simple case - coordinates are within this local
1472adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1325adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1473{ 1326{
1474 if (!map1 || !map2) 1327 if (!map1 || !map2)
1475 return 0; 1328 return 0;
1476 1329
1477 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1330 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1478 //fix: compare paths instead (this is likely faster, too!) 1331 //fix: compare paths instead (this is likely faster, too!)
1479 if (map1 == map2) 1332 if (map1 == map2)
1480 { 1333 {
1481 *dx = 0; 1334 *dx = 0;
1482 *dy = 0; 1335 *dy = 0;
1736 1589
1737 // instead of crashing in the unlikely(?) case, try to return *something* 1590 // instead of crashing in the unlikely(?) case, try to return *something*
1738 return get_archetype ("blocked"); 1591 return get_archetype ("blocked");
1739} 1592}
1740 1593
1594void
1595maptile::play_sound (faceidx sound, int x, int y) const
1596{
1597 if (!sound)
1598 return;
1599
1600 for_all_players (pl)
1601 if (pl->ob->map == this)
1602 if (client *ns = pl->ns)
1603 {
1604 int dx = x - pl->ob->x;
1605 int dy = y - pl->ob->y;
1606
1607 int distance = idistance (dx, dy);
1608
1609 if (distance <= MAX_SOUND_DISTANCE)
1610 ns->play_sound (sound, dx, dy);
1611 }
1612}
1613

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines