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

Comparing cf.schmorp.de/server/common/map.C (file contents):
Revision 1.46 by root, Wed Dec 20 11:36:38 2006 UTC vs.
Revision 1.51 by root, Mon Dec 25 17:11:16 2006 UTC

… …
32 32
33/* 33/*
34 * Returns the maptile which has a name matching the given argument. 34 * Returns the maptile which has a name matching the given argument.
35 * return NULL if no match is found. 35 * return NULL if no match is found.
36 */ 36 */
37
38maptile * 37maptile *
39has_been_loaded (const char *name) 38has_been_loaded (const char *name)
40{ 39{
41 maptile *map; 40 maptile *map;
42 41
43 if (!name || !*name) 42 if (!name || !*name)
44 return 0; 43 return 0;
44
45 for (map = first_map; map; map = map->next) 45 for (map = first_map; map; map = map->next)
46 if (!strcmp (name, map->path)) 46 if (!strcmp (name, map->path))
47 break; 47 break;
48
48 return (map); 49 return (map);
49} 50}
50 51
51/* 52/*
52 * This makes a path absolute outside the world of Crossfire. 53 * This makes a path absolute outside the world of Crossfire.
… …
196 197
197void 198void
198dump_map (const maptile *m) 199dump_map (const maptile *m)
199{ 200{
200 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); 201 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
201 LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m)); 202 LOG (llevError, "Size: %dx%d Start: %d,%d\n", m->width, m->height, m->enter_x, m->enter_y);
202 203
203 if (m->msg != NULL) 204 if (m->msg != NULL)
204 LOG (llevError, "Message:\n%s", m->msg); 205 LOG (llevError, "Message:\n%s", m->msg);
205 206
206 if (m->maplore != NULL) 207 if (m->maplore != NULL)
… …
409 flag = get_map_flags (m, &m1, x, y, &sx, &sy); 410 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
410 if (flag & P_OUT_OF_MAP) 411 if (flag & P_OUT_OF_MAP)
411 return P_OUT_OF_MAP; 412 return P_OUT_OF_MAP;
412 413
413 /* don't have object, so don't know what types would block */ 414 /* don't have object, so don't know what types would block */
414 return (GET_MAP_MOVE_BLOCK (m1, sx, sy)); 415 return m1->at (sx, sy).move_block;
415 } 416 }
416 417
417 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more) 418 for (tmp = ob->arch; tmp; tmp = tmp->more)
418 { 419 {
419 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 420 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
420 421
421 if (flag & P_OUT_OF_MAP) 422 if (flag & P_OUT_OF_MAP)
422 return P_OUT_OF_MAP; 423 return P_OUT_OF_MAP;
423 if (flag & P_IS_ALIVE) 424 if (flag & P_IS_ALIVE)
424 return P_IS_ALIVE; 425 return P_IS_ALIVE;
425 426
427 mapspace &ms = m1->at (sx, sy);
428
429
426 /* find_first_free_spot() calls this function. However, often 430 /* find_first_free_spot() calls this function. However, often
427 * ob doesn't have any move type (when used to place exits) 431 * ob doesn't have any move type (when used to place exits)
428 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 432 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
429 */ 433 */
430 434
431 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL) 435 if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
432 continue; 436 continue;
433 437
434 /* Note it is intentional that we check ob - the movement type of the 438 /* Note it is intentional that we check ob - the movement type of the
435 * head of the object should correspond for the entire object. 439 * head of the object should correspond for the entire object.
436 */ 440 */
437 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) 441 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
438 return P_NO_PASS; 442 return P_NO_PASS;
439 } 443 }
440 444
441 return 0; 445 return 0;
442} 446}
… …
480{ 484{
481 int x, y; 485 int x, y;
482 object *tmp, *op, *last, *above; 486 object *tmp, *op, *last, *above;
483 archetype *at; 487 archetype *at;
484 488
485 for (x = 0; x < MAP_WIDTH (m); x++) 489 for (x = 0; x < m->width; x++)
486 for (y = 0; y < MAP_HEIGHT (m); y++) 490 for (y = 0; y < m->height; y++)
487 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above) 491 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above)
488 { 492 {
489 above = tmp->above; 493 above = tmp->above;
490 494
491 /* already multipart - don't do anything more */ 495 /* already multipart - don't do anything more */
… …
542 { 546 {
543 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 547 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
544 continue; 548 continue;
545 } 549 }
546 550
547
548 switch (i) 551 switch (i)
549 { 552 {
550 case LL_NORMAL: 553 case LL_NORMAL:
551 /* if we are loading an overlay, put the floors on the bottom */ 554 /* if we are loading an overlay, put the floors on the bottom */
552 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) 555 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
… …
598 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 601 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
599 * and we only save the head of multi part objects - this is needed 602 * and we only save the head of multi part objects - this is needed
600 * in order to do map tiling properly. 603 * in order to do map tiling properly.
601 */ 604 */
602void 605void
603save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag) 606save_objects (maptile *m, object_freezer &fp, object_freezer &fp2, int flag)
604{ 607{
605 int i, j = 0, unique = 0; 608 int i, j = 0, unique = 0;
606 object *op; 609 object *op;
607 610
608 /* first pass - save one-part objects */ 611 /* first pass - save one-part objects */
609 for (i = 0; i < MAP_WIDTH (m); i++) 612 for (i = 0; i < m->width; i++)
610 for (j = 0; j < MAP_HEIGHT (m); j++) 613 for (j = 0; j < m->height; j++)
611 { 614 {
612 unique = 0; 615 unique = 0;
616
613 for (op = GET_MAP_OB (m, i, j); op; op = op->above) 617 for (op = m->at (i, j).bot; op; op = op->above)
614 { 618 {
615 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 619 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
616 unique = 1; 620 unique = 1;
617 621
618 if (op->type == PLAYER) 622 if (op->type == PLAYER)
619 continue; 623 continue;
620 624
621 if (op->head || op->owner) 625 if (op->head || op->owner)
622 continue; 626 continue;
623 627
624 if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) 628 if (unique || op->flag [FLAG_UNIQUE])
625 save_object (fp2, op, 3); 629 save_object (fp2, op, 1);
626 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) 630 else if (flag == 0 || (flag == 2 && (!op->flag [FLAG_OBJ_ORIGINAL] && !op->flag [FLAG_UNPAID])))
627 save_object (fp, op, 3); 631 save_object (fp, op, 1);
628 } 632 }
629 } 633 }
630} 634}
631 635
632maptile::maptile () 636maptile::maptile ()
633{ 637{
634 in_memory = MAP_SWAPPED; 638 in_memory = MAP_SWAPPED;
635 /* The maps used to pick up default x and y values from the 639 /* The maps used to pick up default x and y values from the
636 * map archetype. Mimic that behaviour. 640 * map archetype. Mimic that behaviour.
637 */ 641 */
638 MAP_WIDTH (this) = 16; 642 this->width = 16;
639 MAP_HEIGHT (this) = 16; 643 this->height = 16;
640 MAP_RESET_TIMEOUT (this) = 0; 644 this->reset_timeout = 0;
641 MAP_TIMEOUT (this) = 300; 645 this->timeout = 300;
642 MAP_ENTER_X (this) = 0; 646 this->enter_x = 0;
643 MAP_ENTER_Y (this) = 0; 647 this->enter_y = 0;
644 /*set part to -1 indicating conversion to weather map not yet done */ 648 /*set part to -1 indicating conversion to weather map not yet done */
645 MAP_WORLDPARTX (this) = -1; 649 this->worldpartx = -1;
646 MAP_WORLDPARTY (this) = -1; 650 this->worldparty = -1;
647} 651}
648 652
649/* 653/*
650 * Allocates, initialises, and returns a pointer to a maptile. 654 * Allocates, initialises, and returns a pointer to a maptile.
651 * Modified to no longer take a path option which was not being 655 * Modified to no longer take a path option which was not being
… …
1121 strcpy (m->path, filename); 1125 strcpy (m->path, filename);
1122 if (load_map_header (thawer, m)) 1126 if (load_map_header (thawer, m))
1123 { 1127 {
1124 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags); 1128 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1125 delete_map (m); 1129 delete_map (m);
1126 return NULL; 1130 return 0;
1127 } 1131 }
1128 1132
1129 m->allocate (); 1133 m->allocate ();
1130 1134
1131 m->in_memory = MAP_LOADING; 1135 m->in_memory = MAP_LOADING;
1132 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE)); 1136 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1133 1137
1134 m->in_memory = MAP_IN_MEMORY; 1138 m->in_memory = MAP_IN_MEMORY;
1135 if (!MAP_DIFFICULTY (m)) 1139 if (!m->difficulty)
1136 MAP_DIFFICULTY (m) = calculate_difficulty (m); 1140 m->difficulty = calculate_difficulty (m);
1137 set_map_reset_time (m); 1141 set_map_reset_time (m);
1138 m->instantiate (); 1142 m->instantiate ();
1139 return (m); 1143 return (m);
1140} 1144}
1141 1145
… …
1214 if (load_map_header (thawer, m)) 1218 if (load_map_header (thawer, m))
1215 { 1219 {
1216 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname); 1220 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1217 delete_map (m); 1221 delete_map (m);
1218 m = load_original_map (m->path, 0); 1222 m = load_original_map (m->path, 0);
1219 return NULL; 1223 return 0;
1220 } 1224 }
1221 /*m->allocate ();*/ 1225 /*m->allocate ();*/
1222 1226
1223 m->in_memory = MAP_LOADING; 1227 m->in_memory = MAP_LOADING;
1224 load_objects (m, thawer, MAP_OVERLAY); 1228 load_objects (m, thawer, MAP_OVERLAY);
… …
1236delete_unique_items (maptile *m) 1240delete_unique_items (maptile *m)
1237{ 1241{
1238 int i, j, unique; 1242 int i, j, unique;
1239 object *op, *next; 1243 object *op, *next;
1240 1244
1241 for (i = 0; i < MAP_WIDTH (m); i++) 1245 for (i = 0; i < m->width; i++)
1242 for (j = 0; j < MAP_HEIGHT (m); j++) 1246 for (j = 0; j < m->height; j++)
1243 { 1247 {
1244 unique = 0; 1248 unique = 0;
1245 1249
1246 for (op = GET_MAP_OB (m, i, j); op; op = next) 1250 for (op = GET_MAP_OB (m, i, j); op; op = next)
1247 { 1251 {
… …
1250 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 1254 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1251 unique = 1; 1255 unique = 1;
1252 1256
1253 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 1257 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1254 { 1258 {
1255 clean_object (op); 1259 op->destroy_inv (false);
1256
1257 if (QUERY_FLAG (op, FLAG_IS_LINKED))
1258 remove_button_link (op);
1259
1260 op->destroy (); 1260 op->destroy ();
1261 } 1261 }
1262 } 1262 }
1263 } 1263 }
1264} 1264}
… …
1290 return; 1290 return;
1291 1291
1292 m->in_memory = MAP_LOADING; 1292 m->in_memory = MAP_LOADING;
1293 if (m->tmpname == NULL) /* if we have loaded unique items from */ 1293 if (m->tmpname == NULL) /* if we have loaded unique items from */
1294 delete_unique_items (m); /* original map before, don't duplicate them */ 1294 delete_unique_items (m); /* original map before, don't duplicate them */
1295
1295 load_objects (m, thawer, 0); 1296 load_objects (m, thawer, 0);
1296 1297
1297 m->in_memory = MAP_IN_MEMORY; 1298 m->in_memory = MAP_IN_MEMORY;
1298} 1299}
1299
1300 1300
1301/* 1301/*
1302 * Saves a map to file. If flag is set, it is saved into the same 1302 * Saves a map to file. If flag is set, it is saved into the same
1303 * file it was (originally) loaded from. Otherwise a temporary 1303 * file it was (originally) loaded from. Otherwise a temporary
1304 * filename will be genarated, and the file will be stored there. 1304 * filename will be genarated, and the file will be stored there.
1305 * The temporary filename will be stored in the maptileure. 1305 * The temporary filename will be stored in the maptileure.
1306 * If the map is unique, we also save to the filename in the map 1306 * If the map is unique, we also save to the filename in the map
1307 * (this should have been updated when first loaded) 1307 * (this should have been updated when first loaded)
1308 */ 1308 */
1309
1310int 1309int
1311new_save_map (maptile *m, int flag) 1310new_save_map (maptile *m, int flag)
1312{ 1311{
1313 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; 1312 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1314 int i; 1313 int i;
… …
1446 freezer.save (filename); 1445 freezer.save (filename);
1447 1446
1448 return 0; 1447 return 0;
1449} 1448}
1450 1449
1451
1452/*
1453 * Remove and free all objects in the inventory of the given object.
1454 * object.c ?
1455 */
1456
1457void
1458clean_object (object *op)
1459{
1460 object *tmp, *next;
1461
1462 for (tmp = op->inv; tmp; tmp = next)
1463 {
1464 next = tmp->below;
1465
1466 clean_object (tmp);
1467 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1468 remove_button_link (tmp);
1469
1470 tmp->destroy ();
1471 }
1472}
1473
1474/* 1450/*
1475 * Remove and free all objects in the given map. 1451 * Remove and free all objects in the given map.
1476 */ 1452 */
1477
1478void 1453void
1479free_all_objects (maptile *m) 1454free_all_objects (maptile *m)
1480{ 1455{
1481 int i, j; 1456 if (!m->spaces)
1482 object *op; 1457 return;
1483 1458
1484 for (i = 0; i < MAP_WIDTH (m); i++) 1459 for (int i = 0; i < m->width; i++)
1485 for (j = 0; j < MAP_HEIGHT (m); j++) 1460 for (int j = 0; j < m->height; j++)
1486 { 1461 {
1487 object *previous_obj = NULL; 1462 mapspace &ms = m->at (i, j);
1488 1463
1489 while ((op = GET_MAP_OB (m, i, j)) != NULL) 1464 while (object *op = ms.bot)
1490 { 1465 {
1491 if (op == previous_obj)
1492 {
1493 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1494 break;
1495 }
1496
1497 previous_obj = op;
1498
1499 if (op->head != NULL) 1466 if (op->head)
1500 op = op->head; 1467 op = op->head;
1501 1468
1502 /* If the map isn't in memory, free_object will remove and 1469 op->destroy_inv (false);
1503 * free objects in op's inventory. So let it do the job.
1504 */
1505 if (m->in_memory == MAP_IN_MEMORY)
1506 clean_object (op);
1507
1508 op->destroy (); 1470 op->destroy ();
1509 } 1471 }
1510 } 1472 }
1511} 1473}
1512 1474
1513/* 1475/*
1514 * Frees everything allocated by the given maptileure. 1476 * Frees everything allocated by the given maptileure.
1515 * don't free tmpname - our caller is left to do that 1477 * don't free tmpname - our caller is left to do that
1516 */ 1478 */
1517
1518void 1479void
1519free_map (maptile *m, int flag) 1480free_map (maptile *m, int flag)
1520{ 1481{
1521 int i; 1482 if (!m->in_memory) //TODO: makes no sense to me?
1522
1523 if (!m->in_memory)
1524 {
1525 LOG (llevError, "Trying to free freed map.\n");
1526 return; 1483 return;
1527 } 1484
1485 m->in_memory = MAP_SAVING;
1528 1486
1529 // TODO: use new/delete 1487 // TODO: use new/delete
1530#define FREE_AND_CLEAR(p) { free (p); p = NULL; }
1531 1488
1532 if (flag && m->spaces) 1489 if (flag && m->spaces)
1533 free_all_objects (m); 1490 free_all_objects (m);
1534 if (m->name)
1535 FREE_AND_CLEAR (m->name);
1536 if (m->spaces)
1537 FREE_AND_CLEAR (m->spaces);
1538 if (m->msg)
1539 FREE_AND_CLEAR (m->msg);
1540 if (m->maplore)
1541 FREE_AND_CLEAR (m->maplore);
1542 1491
1543 delete [] m->shopitems; 1492 free (m->name), m->name = 0;
1544 m->shopitems = 0; 1493 free (m->spaces), m->spaces = 0;
1545 1494 free (m->msg), m->msg = 0;
1546 if (m->shoprace) 1495 free (m->maplore), m->maplore = 0;
1547 FREE_AND_CLEAR (m->shoprace); 1496 free (m->shoprace), m->shoprace = 0;
1497 delete [] m->shopitems, m->shopitems = 0;
1548 1498
1549 if (m->buttons) 1499 if (m->buttons)
1550 free_objectlinkpt (m->buttons); 1500 free_objectlinkpt (m->buttons), m->buttons = 0;
1551 1501
1552 m->buttons = NULL;
1553
1554 for (i = 0; i < 4; i++) 1502 for (int i = 0; i < 4; i++)
1555 { 1503 {
1556 if (m->tile_path[i]) 1504 if (m->tile_path[i])
1557 FREE_AND_CLEAR (m->tile_path[i]); 1505 free (m->tile_path[i]), m->tile_path[i] = 0;
1506
1558 m->tile_map[i] = NULL; 1507 m->tile_map[i] = 0;
1559 } 1508 }
1560 1509
1561 m->in_memory = MAP_SWAPPED; 1510 m->in_memory = MAP_SWAPPED;
1562
1563#undef FREE_AND_CLEAR
1564
1565} 1511}
1566 1512
1567/* 1513maptile::~maptile ()
1568 * function: vanish maptile 1514{
1569 * m : pointer to maptile, if NULL no action 1515 free_map (this, 1);
1570 * this deletes all the data on the map (freeing pointers) 1516 free (tmpname);
1571 * and then removes this map from the global linked list of maps. 1517}
1518
1519void
1520maptile::do_destroy ()
1521{
1522 attachable::do_destroy ();
1523
1524 free_all_objects (this);
1525
1526 /* We need to look through all the maps and see if any maps
1527 * are pointing at this one for tiling information. Since
1528 * tiling can be asymetric, we just can not look to see which
1529 * maps this map tiles with and clears those.
1572 */ 1530 */
1531 //TODO: non-euclidean-tiling MUST GO
1532 for (maptile *m = first_map; m; m = m->next)
1533 for (int i = 0; i < 4; i++)
1534 if (m->tile_map[i] == this)
1535 m->tile_map[i] = 0;
1573 1536
1537 if (first_map == this)
1538 first_map = next;
1539 else
1540 for (maptile *m = first_map; m; m = m->next)
1541 if (m->next = this)
1542 {
1543 m->next = next;
1544 break;
1545 }
1546}
1547
1548//TODO: must go
1574void 1549void
1575delete_map (maptile *m) 1550delete_map (maptile *m)
1576{ 1551{
1577 maptile *tmp, *last;
1578 int i;
1579
1580 if (!m) 1552 if (m)
1581 return; 1553 m->destroy ();
1582
1583 m->clear ();
1584
1585 if (m->in_memory == MAP_IN_MEMORY)
1586 {
1587 /* change to MAP_SAVING, even though we are not,
1588 * so that remove_ob doesn't do as much work.
1589 */
1590 m->in_memory = MAP_SAVING;
1591 free_map (m, 1);
1592 }
1593 /* move this out of free_map, since tmpname can still be needed if
1594 * the map is swapped out.
1595 */
1596 if (m->tmpname)
1597 {
1598 free (m->tmpname);
1599 m->tmpname = NULL;
1600 }
1601 last = NULL;
1602 /* We need to look through all the maps and see if any maps
1603 * are pointing at this one for tiling information. Since
1604 * tiling can be assymetric, we just can not look to see which
1605 * maps this map tiles with and clears those.
1606 */
1607 for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1608 {
1609 if (tmp->next == m)
1610 last = tmp;
1611
1612 /* This should hopefully get unrolled on a decent compiler */
1613 for (i = 0; i < 4; i++)
1614 if (tmp->tile_map[i] == m)
1615 tmp->tile_map[i] = NULL;
1616 }
1617
1618 /* If last is null, then this should be the first map in the list */
1619 if (!last)
1620 {
1621 if (m == first_map)
1622 first_map = m->next;
1623 else
1624 /* m->path is a static char, so should hopefully still have
1625 * some useful data in it.
1626 */
1627 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1628 }
1629 else
1630 last->next = m->next;
1631
1632 delete m;
1633} 1554}
1634 1555
1635/* 1556/*
1636 * Makes sure the given map is loaded and swapped in. 1557 * Makes sure the given map is loaded and swapped in.
1637 * name is path name of the map. 1558 * name is path name of the map.
… …
1644 * Returns a pointer to the given map. 1565 * Returns a pointer to the given map.
1645 */ 1566 */
1646maptile * 1567maptile *
1647ready_map_name (const char *name, int flags) 1568ready_map_name (const char *name, int flags)
1648{ 1569{
1649 maptile *m;
1650
1651 if (!name) 1570 if (!name)
1652 return (NULL); 1571 return 0;
1653 1572
1654 /* Have we been at this level before? */ 1573 /* Have we been at this level before? */
1655 m = has_been_loaded (name); 1574 maptile *m = has_been_loaded (name);
1656 1575
1657 /* Map is good to go, so just return it */ 1576 /* Map is good to go, so just return it */
1658 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) 1577 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1659 {
1660 return m; 1578 return m;
1661 }
1662 1579
1663 /* unique maps always get loaded from their original location, and never 1580 /* unique maps always get loaded from their original location, and never
1664 * a temp location. Likewise, if map_flush is set, or we have never loaded 1581 * a temp location. Likewise, if map_flush is set, or we have never loaded
1665 * this map, load it now. I removed the reset checking from here - 1582 * this map, load it now. I removed the reset checking from here -
1666 * it seems the probability of a player trying to enter a map that should 1583 * it seems the probability of a player trying to enter a map that should
… …
1668 * a bit cleaner (and players probably shouldn't rely on exact timing for 1585 * a bit cleaner (and players probably shouldn't rely on exact timing for
1669 * resets in any case - if they really care, they should use the 'maps command. 1586 * resets in any case - if they really care, they should use the 'maps command.
1670 */ 1587 */
1671 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m) 1588 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1672 { 1589 {
1673
1674 /* first visit or time to reset */ 1590 /* first visit or time to reset */
1675 if (m) 1591 if (m)
1676 { 1592 {
1677 clean_tmp_map (m); /* Doesn't make much difference */ 1593 clean_tmp_map (m); /* Doesn't make much difference */
1678 delete_map (m); 1594 delete_map (m);
… …
1765 int x, y, i; 1681 int x, y, i;
1766 long monster_cnt = 0; 1682 long monster_cnt = 0;
1767 double avgexp = 0; 1683 double avgexp = 0;
1768 sint64 total_exp = 0; 1684 sint64 total_exp = 0;
1769 1685
1770 if (MAP_DIFFICULTY (m)) 1686 if (m->difficulty)
1771 { 1687 {
1772 LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m)); 1688 LOG (llevDebug, "Using stored map difficulty: %d\n", m->difficulty);
1773 return MAP_DIFFICULTY (m); 1689 return m->difficulty;
1774 } 1690 }
1775 1691
1776 for (x = 0; x < MAP_WIDTH (m); x++) 1692 for (x = 0; x < m->width; x++)
1777 for (y = 0; y < MAP_HEIGHT (m); y++) 1693 for (y = 0; y < m->height; y++)
1778 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above) 1694 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1779 { 1695 {
1780 if (QUERY_FLAG (op, FLAG_MONSTER)) 1696 if (QUERY_FLAG (op, FLAG_MONSTER))
1781 { 1697 {
1782 total_exp += op->stats.exp; 1698 total_exp += op->stats.exp;
… …
1899 1815
1900 middle_obj = 0; 1816 middle_obj = 0;
1901 top_obj = 0; 1817 top_obj = 0;
1902 floor_obj = 0; 1818 floor_obj = 0;
1903 1819
1904 for (tmp = bottom; tmp; last = tmp, tmp = tmp->above) 1820 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1905 { 1821 {
1906 /* This could be made additive I guess (two lights better than 1822 /* This could be made additive I guess (two lights better than
1907 * one). But if so, it shouldn't be a simple additive - 2 1823 * one). But if so, it shouldn't be a simple additive - 2
1908 * light bulbs do not illuminate twice as far as once since 1824 * light bulbs do not illuminate twice as far as once since
1909 * it is a dissapation factor that is cubed. 1825 * it is a dissapation factor that is cubed.
… …
2059void 1975void
2060set_map_reset_time (maptile *map) 1976set_map_reset_time (maptile *map)
2061{ 1977{
2062 int timeout; 1978 int timeout;
2063 1979
2064 timeout = MAP_RESET_TIMEOUT (map); 1980 timeout = map->reset_timeout;
2065 if (timeout <= 0) 1981 if (timeout <= 0)
2066 timeout = MAP_DEFAULTRESET; 1982 timeout = MAP_DEFAULTRESET;
2067 if (timeout >= MAP_MAXRESET) 1983 if (timeout >= MAP_MAXRESET)
2068 timeout = MAP_MAXRESET; 1984 timeout = MAP_MAXRESET;
2069 MAP_WHEN_RESET (map) = time (0) + timeout; 1985 map->reset_time = time (0) + timeout;
2070} 1986}
2071 1987
2072/* this updates the orig_map->tile_map[tile_num] value after loading 1988/* this updates the orig_map->tile_map[tile_num] value after loading
2073 * the map. It also takes care of linking back the freshly loaded 1989 * the map. It also takes care of linking back the freshly loaded
2074 * maps tile_map values if it tiles back to this one. It returns 1990 * maps tile_map values if it tiles back to this one. It returns
… …
2117 return 1; 2033 return 1;
2118 2034
2119 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2035 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2120 load_and_link_tiled_map (m, 3); 2036 load_and_link_tiled_map (m, 3);
2121 2037
2122 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); 2038 return (out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y));
2123 } 2039 }
2124 2040
2125 if (x >= MAP_WIDTH (m)) 2041 if (x >= m->width)
2126 { 2042 {
2127 if (!m->tile_path[1]) 2043 if (!m->tile_path[1])
2128 return 1; 2044 return 1;
2129 2045
2130 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2046 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2131 load_and_link_tiled_map (m, 1); 2047 load_and_link_tiled_map (m, 1);
2132 2048
2133 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); 2049 return (out_of_map (m->tile_map[1], x - m->width, y));
2134 } 2050 }
2135 2051
2136 if (y < 0) 2052 if (y < 0)
2137 { 2053 {
2138 if (!m->tile_path[0]) 2054 if (!m->tile_path[0])
2139 return 1; 2055 return 1;
2140 2056
2141 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2057 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2142 load_and_link_tiled_map (m, 0); 2058 load_and_link_tiled_map (m, 0);
2143 2059
2144 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); 2060 return (out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height));
2145 } 2061 }
2146 2062
2147 if (y >= MAP_HEIGHT (m)) 2063 if (y >= m->height)
2148 { 2064 {
2149 if (!m->tile_path[2]) 2065 if (!m->tile_path[2])
2150 return 1; 2066 return 1;
2151 2067
2152 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2068 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2153 load_and_link_tiled_map (m, 2); 2069 load_and_link_tiled_map (m, 2);
2154 2070
2155 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); 2071 return (out_of_map (m->tile_map[2], x, y - m->height));
2156 } 2072 }
2157 2073
2158 /* Simple case - coordinates are within this local 2074 /* Simple case - coordinates are within this local
2159 * map. 2075 * map.
2160 */ 2076 */
… …
2178 if (!m->tile_path[3]) 2094 if (!m->tile_path[3])
2179 return 0; 2095 return 0;
2180 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2096 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2181 load_and_link_tiled_map (m, 3); 2097 load_and_link_tiled_map (m, 3);
2182 2098
2183 *x += MAP_WIDTH (m->tile_map[3]); 2099 *x += m->tile_map[3]->width;
2184 return (get_map_from_coord (m->tile_map[3], x, y)); 2100 return (get_map_from_coord (m->tile_map[3], x, y));
2185 } 2101 }
2186 2102
2187 if (*x >= MAP_WIDTH (m)) 2103 if (*x >= m->width)
2188 { 2104 {
2189 if (!m->tile_path[1]) 2105 if (!m->tile_path[1])
2190 return 0; 2106 return 0;
2191 2107
2192 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2108 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2193 load_and_link_tiled_map (m, 1); 2109 load_and_link_tiled_map (m, 1);
2194 2110
2195 *x -= MAP_WIDTH (m); 2111 *x -= m->width;
2196 return (get_map_from_coord (m->tile_map[1], x, y)); 2112 return (get_map_from_coord (m->tile_map[1], x, y));
2197 } 2113 }
2198 2114
2199 if (*y < 0) 2115 if (*y < 0)
2200 { 2116 {
… …
2202 return 0; 2118 return 0;
2203 2119
2204 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2120 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2205 load_and_link_tiled_map (m, 0); 2121 load_and_link_tiled_map (m, 0);
2206 2122
2207 *y += MAP_HEIGHT (m->tile_map[0]); 2123 *y += m->tile_map[0]->height;
2208 return (get_map_from_coord (m->tile_map[0], x, y)); 2124 return (get_map_from_coord (m->tile_map[0], x, y));
2209 } 2125 }
2210 2126
2211 if (*y >= MAP_HEIGHT (m)) 2127 if (*y >= m->height)
2212 { 2128 {
2213 if (!m->tile_path[2]) 2129 if (!m->tile_path[2])
2214 return 0; 2130 return 0;
2215 2131
2216 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2132 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2217 load_and_link_tiled_map (m, 2); 2133 load_and_link_tiled_map (m, 2);
2218 2134
2219 *y -= MAP_HEIGHT (m); 2135 *y -= m->height;
2220 return (get_map_from_coord (m->tile_map[2], x, y)); 2136 return (get_map_from_coord (m->tile_map[2], x, y));
2221 } 2137 }
2222 2138
2223 /* Simple case - coordinates are within this local 2139 /* Simple case - coordinates are within this local
2224 * map. 2140 * map.
… …
2244 2160
2245 } 2161 }
2246 else if (map1->tile_map[0] == map2) 2162 else if (map1->tile_map[0] == map2)
2247 { /* up */ 2163 { /* up */
2248 *dx = 0; 2164 *dx = 0;
2249 *dy = -MAP_HEIGHT (map2); 2165 *dy = -map2->height;
2250 } 2166 }
2251 else if (map1->tile_map[1] == map2) 2167 else if (map1->tile_map[1] == map2)
2252 { /* right */ 2168 { /* right */
2253 *dx = MAP_WIDTH (map1); 2169 *dx = map1->width;
2254 *dy = 0; 2170 *dy = 0;
2255 } 2171 }
2256 else if (map1->tile_map[2] == map2) 2172 else if (map1->tile_map[2] == map2)
2257 { /* down */ 2173 { /* down */
2258 *dx = 0; 2174 *dx = 0;
2259 *dy = MAP_HEIGHT (map1); 2175 *dy = map1->height;
2260 } 2176 }
2261 else if (map1->tile_map[3] == map2) 2177 else if (map1->tile_map[3] == map2)
2262 { /* left */ 2178 { /* left */
2263 *dx = -MAP_WIDTH (map2); 2179 *dx = -map2->width;
2264 *dy = 0; 2180 *dy = 0;
2265 2181
2266 } 2182 }
2267 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 2183 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)
2268 { /* up right */ 2184 { /* up right */
2269 *dx = MAP_WIDTH (map1->tile_map[0]); 2185 *dx = map1->tile_map[0]->width;
2270 *dy = -MAP_HEIGHT (map1->tile_map[0]); 2186 *dy = -map1->tile_map[0]->height;
2271 } 2187 }
2272 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 2188 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)
2273 { /* up left */ 2189 { /* up left */
2274 *dx = -MAP_WIDTH (map2); 2190 *dx = -map2->width;
2275 *dy = -MAP_HEIGHT (map1->tile_map[0]); 2191 *dy = -map1->tile_map[0]->height;
2276 } 2192 }
2277 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 2193 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)
2278 { /* right up */ 2194 { /* right up */
2279 *dx = MAP_WIDTH (map1); 2195 *dx = map1->width;
2280 *dy = -MAP_HEIGHT (map2); 2196 *dy = -map2->height;
2281 } 2197 }
2282 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 2198 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)
2283 { /* right down */ 2199 { /* right down */
2284 *dx = MAP_WIDTH (map1); 2200 *dx = map1->width;
2285 *dy = MAP_HEIGHT (map1->tile_map[1]); 2201 *dy = map1->tile_map[1]->height;
2286 } 2202 }
2287 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 2203 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)
2288 { /* down right */ 2204 { /* down right */
2289 *dx = MAP_WIDTH (map1->tile_map[2]); 2205 *dx = map1->tile_map[2]->width;
2290 *dy = MAP_HEIGHT (map1); 2206 *dy = map1->height;
2291 } 2207 }
2292 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 2208 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)
2293 { /* down left */ 2209 { /* down left */
2294 *dx = -MAP_WIDTH (map2); 2210 *dx = -map2->width;
2295 *dy = MAP_HEIGHT (map1); 2211 *dy = map1->height;
2296 } 2212 }
2297 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 2213 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)
2298 { /* left up */ 2214 { /* left up */
2299 *dx = -MAP_WIDTH (map1->tile_map[3]); 2215 *dx = -map1->tile_map[3]->width;
2300 *dy = -MAP_HEIGHT (map2); 2216 *dy = -map2->height;
2301 } 2217 }
2302 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 2218 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)
2303 { /* left down */ 2219 { /* left down */
2304 *dx = -MAP_WIDTH (map1->tile_map[3]); 2220 *dx = -map1->tile_map[3]->width;
2305 *dy = MAP_HEIGHT (map1->tile_map[3]); 2221 *dy = map1->tile_map[3]->height;
2306 2222
2307 } 2223 }
2308 else 2224 else
2309 { /* not "adjacent" enough */ 2225 { /* not "adjacent" enough */
2310 return 0; 2226 return 0;

Diff Legend

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