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.62 by root, Sun Dec 31 22:23:11 2006 UTC vs.
Revision 1.70 by root, Thu Jan 4 20:29:45 2007 UTC

… …
329 * carrying. 329 * carrying.
330 */ 330 */
331 sum_weight (container); 331 sum_weight (container);
332} 332}
333 333
334void
335maptile::set_object_flag (int flag, int value)
336{
337 if (!spaces)
338 return;
339
340 for (mapspace *ms = spaces + size (); ms-- > spaces; )
341 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
342 tmp->flag [flag] = value;
343}
344
334/* link_multipart_objects go through all the objects on the map looking 345/* link_multipart_objects go through all the objects on the map looking
335 * for objects whose arch says they are multipart yet according to the 346 * for objects whose arch says they are multipart yet according to the
336 * info we have, they only have the head (as would be expected when 347 * info we have, they only have the head (as would be expected when
337 * they are saved). We do have to look for the old maps that did save 348 * they are saved). We do have to look for the old maps that did save
338 * the more sections and not re-add sections for them. 349 * the more sections and not re-add sections for them.
… …
476} 487}
477 488
478bool 489bool
479maptile::save_objects (object_freezer &freezer, int flags) 490maptile::save_objects (object_freezer &freezer, int flags)
480{ 491{
492 static int cede_count = 0;
493
481 if (flags & IO_HEADER) 494 if (flags & IO_HEADER)
482 save_header (freezer); 495 save_header (freezer);
483 496
484 if (!spaces) 497 if (!spaces)
485 return false; 498 return false;
486 499
487 for (int i = 0; i < size (); ++i) 500 for (int i = 0; i < size (); ++i)
488 { 501 {
502 if (cede_count >= 500)
503 {
504 cede_count = 0;
505 coroapi::cede ();
506 }
507
489 int unique = 0; 508 int unique = 0;
490 for (object *op = spaces [i].bot; op; op = op->above) 509 for (object *op = spaces [i].bot; op; op = op->above)
491 { 510 {
511 // count per-object, but cede only when modification-safe
512 cede_count++;
513
492 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 514 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
493 unique = 1; 515 unique = 1;
494 516
495 if (!op->can_map_save ()) 517 if (!op->can_map_save ())
496 continue; 518 continue;
… …
709 * MSW 2001-07-01 731 * MSW 2001-07-01
710 */ 732 */
711bool 733bool
712maptile::load_header (object_thawer &thawer) 734maptile::load_header (object_thawer &thawer)
713{ 735{
714 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
715 int msgpos = 0;
716 int maplorepos = 0;
717
718 for (;;) 736 for (;;)
719 { 737 {
720 keyword kw = thawer.get_kv (); 738 keyword kw = thawer.get_kv ();
721 739
722 switch (kw) 740 switch (kw)
… …
725 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); 743 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
726 return false; 744 return false;
727 745
728 case KW_end: 746 case KW_end:
729 return true; 747 return true;
748
749 default:
750 case KW_ERROR:
751 LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
752 break;
730 753
731 case KW_msg: 754 case KW_msg:
732 thawer.get_ml (KW_endmsg, msg); 755 thawer.get_ml (KW_endmsg, msg);
733 break; 756 break;
734 757
… …
785 808
786 case KW_tile_path_1: thawer.get (tile_path [0]); break; 809 case KW_tile_path_1: thawer.get (tile_path [0]); break;
787 case KW_tile_path_2: thawer.get (tile_path [1]); break; 810 case KW_tile_path_2: thawer.get (tile_path [1]); break;
788 case KW_tile_path_3: thawer.get (tile_path [2]); break; 811 case KW_tile_path_3: thawer.get (tile_path [2]); break;
789 case KW_tile_path_4: thawer.get (tile_path [3]); break; 812 case KW_tile_path_4: thawer.get (tile_path [3]); break;
790
791 default:
792 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]);
793 break;
794 } 813 }
795 } 814 }
796 815
797 abort (); 816 abort ();
798} 817}
… …
888 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 907 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
889 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 908 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
890 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 909 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
891 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 910 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
892 911
912 freezer.put (this);
893 freezer.put (KW_end); 913 freezer.put (KW_end);
894 914
895 return true; 915 return true;
896} 916}
897 917
… …
1214 1234
1215 /* If two top faces are already set, quit processing */ 1235 /* If two top faces are already set, quit processing */
1216 if ((top != blank_face) && (middle != blank_face)) 1236 if ((top != blank_face) && (middle != blank_face))
1217 break; 1237 break;
1218 1238
1219 /* Only show visible faces, unless its the editor - show all */ 1239 /* Only show visible faces */
1220 if (!tmp->invisible || editor) 1240 if (!tmp->invisible)
1221 { 1241 {
1222 /* Fill in top if needed */ 1242 /* Fill in top if needed */
1223 if (top == blank_face) 1243 if (top == blank_face)
1224 { 1244 {
1225 top = tmp->face; 1245 top = tmp->face;
… …
1255 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1275 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1256 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1276 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1257 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1277 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1258} 1278}
1259 1279
1260/* this updates the orig_map->tile_map[tile_num] value after loading 1280/* this updates the orig_map->tile_map[tile_num] value after finding
1261 * the map. It also takes care of linking back the freshly loaded 1281 * the map. It also takes care of linking back the freshly found
1262 * maps tile_map values if it tiles back to this one. It returns 1282 * maps tile_map values if it tiles back to this one. It returns
1263 * the value of orig_map->tile_map[tile_num]. It really only does this 1283 * the value of orig_map->tile_map[tile_num].
1264 * so that it is easier for calling functions to verify success.
1265 */ 1284 */
1266static maptile * 1285static inline maptile *
1267load_and_link_tiled_map (maptile *orig_map, int tile_num) 1286find_and_link (maptile *orig_map, int tile_num)
1268{ 1287{
1288 maptile *mp = orig_map->tile_map [tile_num];
1289
1290 if (!mp)
1291 {
1269 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1292 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1270 1293
1271 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1294 if (!mp)
1272 { 1295 {
1273 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1296 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1274 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1297 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1275 &orig_map->tile_path[tile_num], &orig_map->path); 1298 &orig_map->tile_path[tile_num], &orig_map->path);
1276 mp = new maptile (1, 1); 1299 mp = new maptile (1, 1);
1277 mp->alloc (); 1300 mp->alloc ();
1278 mp->in_memory = MAP_IN_MEMORY; 1301 mp->in_memory = MAP_IN_MEMORY;
1302 }
1279 } 1303 }
1280 1304
1281 int dest_tile = (tile_num + 2) % 4; 1305 int dest_tile = (tile_num + 2) % 4;
1282 1306
1283 orig_map->tile_map[tile_num] = mp; 1307 orig_map->tile_map [tile_num] = mp;
1284 1308
1285 // optimisation: back-link map to origin map if euclidean 1309 // optimisation: back-link map to origin map if euclidean
1286 //TODO: non-euclidean maps MUST GO 1310 //TODO: non-euclidean maps MUST GO
1287 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) 1311 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1288 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 1312 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1289 1313
1290 return mp; 1314 return mp;
1315}
1316
1317static inline void
1318load_and_link (maptile *orig_map, int tile_num)
1319{
1320 find_and_link (orig_map, tile_num)->load_sync ();
1291} 1321}
1292 1322
1293/* this returns TRUE if the coordinates (x,y) are out of 1323/* this returns TRUE if the coordinates (x,y) are out of
1294 * map m. This function also takes into account any 1324 * map m. This function also takes into account any
1295 * tiling considerations, loading adjacant maps as needed. 1325 * tiling considerations, loading adjacant maps as needed.
… …
1312 { 1342 {
1313 if (!m->tile_path[3]) 1343 if (!m->tile_path[3])
1314 return 1; 1344 return 1;
1315 1345
1316 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1346 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1317 load_and_link_tiled_map (m, 3); 1347 find_and_link (m, 3);
1318 1348
1319 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1349 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1320 } 1350 }
1321 1351
1322 if (x >= m->width) 1352 if (x >= m->width)
1323 { 1353 {
1324 if (!m->tile_path[1]) 1354 if (!m->tile_path[1])
1325 return 1; 1355 return 1;
1326 1356
1327 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1357 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1328 load_and_link_tiled_map (m, 1); 1358 find_and_link (m, 1);
1329 1359
1330 return out_of_map (m->tile_map[1], x - m->width, y); 1360 return out_of_map (m->tile_map[1], x - m->width, y);
1331 } 1361 }
1332 1362
1333 if (y < 0) 1363 if (y < 0)
1334 { 1364 {
1335 if (!m->tile_path[0]) 1365 if (!m->tile_path[0])
1336 return 1; 1366 return 1;
1337 1367
1338 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1368 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1339 load_and_link_tiled_map (m, 0); 1369 find_and_link (m, 0);
1340 1370
1341 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1371 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1342 } 1372 }
1343 1373
1344 if (y >= m->height) 1374 if (y >= m->height)
1345 { 1375 {
1346 if (!m->tile_path[2]) 1376 if (!m->tile_path[2])
1347 return 1; 1377 return 1;
1348 1378
1349 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1379 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1350 load_and_link_tiled_map (m, 2); 1380 find_and_link (m, 2);
1351 1381
1352 return out_of_map (m->tile_map[2], x, y - m->height); 1382 return out_of_map (m->tile_map[2], x, y - m->height);
1353 } 1383 }
1354 1384
1355 /* Simple case - coordinates are within this local 1385 /* Simple case - coordinates are within this local
… …
1360 1390
1361/* This is basically the same as out_of_map above, but 1391/* This is basically the same as out_of_map above, but
1362 * instead we return NULL if no map is valid (coordinates 1392 * instead we return NULL if no map is valid (coordinates
1363 * out of bounds and no tiled map), otherwise it returns 1393 * out of bounds and no tiled map), otherwise it returns
1364 * the map as that the coordinates are really on, and 1394 * the map as that the coordinates are really on, and
1365 * updates x and y to be the localized coordinates. 1395 * updates x and y to be the localised coordinates.
1366 * Using this is more efficient of calling out_of_map 1396 * Using this is more efficient of calling out_of_map
1367 * and then figuring out what the real map is 1397 * and then figuring out what the real map is
1368 */ 1398 */
1369maptile * 1399maptile *
1370get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1400maptile::xy_find (sint16 &x, sint16 &y)
1371{ 1401{
1372 if (*x < 0) 1402 if (x < 0)
1373 { 1403 {
1374 if (!m->tile_path[3]) 1404 if (!tile_path[3])
1375 return 0; 1405 return 0;
1376 1406
1377 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1407 find_and_link (this, 3);
1378 load_and_link_tiled_map (m, 3);
1379
1380 *x += m->tile_map[3]->width; 1408 x += tile_map[3]->width;
1381 return (get_map_from_coord (m->tile_map[3], x, y)); 1409 return tile_map[3]->xy_find (x, y);
1382 } 1410 }
1383 1411
1384 if (*x >= m->width) 1412 if (x >= width)
1385 { 1413 {
1386 if (!m->tile_path[1]) 1414 if (!tile_path[1])
1387 return 0; 1415 return 0;
1388 1416
1389 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1417 find_and_link (this, 1);
1390 load_and_link_tiled_map (m, 1);
1391
1392 *x -= m->width; 1418 x -= width;
1393 return (get_map_from_coord (m->tile_map[1], x, y)); 1419 return tile_map[1]->xy_find (x, y);
1394 } 1420 }
1395 1421
1396 if (*y < 0) 1422 if (y < 0)
1397 { 1423 {
1398 if (!m->tile_path[0]) 1424 if (!tile_path[0])
1399 return 0; 1425 return 0;
1400 1426
1401 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1427 find_and_link (this, 0);
1402 load_and_link_tiled_map (m, 0);
1403
1404 *y += m->tile_map[0]->height; 1428 y += tile_map[0]->height;
1405 return (get_map_from_coord (m->tile_map[0], x, y)); 1429 return tile_map[0]->xy_find (x, y);
1406 } 1430 }
1407 1431
1408 if (*y >= m->height) 1432 if (y >= height)
1409 { 1433 {
1410 if (!m->tile_path[2]) 1434 if (!tile_path[2])
1411 return 0; 1435 return 0;
1412 1436
1413 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1437 find_and_link (this, 2);
1414 load_and_link_tiled_map (m, 2);
1415
1416 *y -= m->height; 1438 y -= height;
1417 return (get_map_from_coord (m->tile_map[2], x, y)); 1439 return tile_map[2]->xy_find (x, y);
1418 } 1440 }
1419 1441
1420 /* Simple case - coordinates are within this local 1442 /* Simple case - coordinates are within this local
1421 * map. 1443 * map.
1422 */ 1444 */
1423 return m; 1445 return this;
1424} 1446}
1425 1447
1426/** 1448/**
1427 * Return whether map2 is adjacent to map1. If so, store the distance from 1449 * Return whether map2 is adjacent to map1. If so, store the distance from
1428 * map1 to map2 in dx/dy. 1450 * map1 to map2 in dx/dy.
… …
1431adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1453adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1432{ 1454{
1433 if (!map1 || !map2) 1455 if (!map1 || !map2)
1434 return 0; 1456 return 0;
1435 1457
1458 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded
1459 //fix: compare paths instead (this is likely faster, too!)
1436 if (map1 == map2) 1460 if (map1 == map2)
1437 { 1461 {
1438 *dx = 0; 1462 *dx = 0;
1439 *dy = 0; 1463 *dy = 0;
1440 } 1464 }
… …
1500 } 1524 }
1501 else 1525 else
1502 return 0; 1526 return 0;
1503 1527
1504 return 1; 1528 return 1;
1529}
1530
1531maptile *
1532maptile::xy_load (sint16 &x, sint16 &y)
1533{
1534 maptile *map = xy_find (x, y);
1535
1536 if (map)
1537 map->load_sync ();
1538
1539 return map;
1540}
1541
1542maptile *
1543get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1544{
1545 return m->xy_load (*x, *y);
1505} 1546}
1506 1547
1507/* From map.c 1548/* From map.c
1508 * This is used by get_player to determine where the other 1549 * This is used by get_player to determine where the other
1509 * creature is. get_rangevector takes into account map tiling, 1550 * creature is. get_rangevector takes into account map tiling,

Diff Legend

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