1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
7 | |
7 | * |
8 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
9 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
11 | (at your option) any later version. |
11 | * (at your option) any later version. |
12 | |
12 | * |
13 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | |
17 | * |
18 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 | |
21 | * |
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
|
|
26 | #include <funcpoint.h> |
|
|
27 | |
|
|
28 | #include <loader.h> |
|
|
29 | #include <unistd.h> |
25 | #include <unistd.h> |
|
|
26 | |
|
|
27 | #include "global.h" |
|
|
28 | #include "funcpoint.h" |
|
|
29 | |
|
|
30 | #include "loader.h" |
30 | |
31 | |
31 | #include "path.h" |
32 | #include "path.h" |
32 | |
33 | |
33 | /* |
34 | /* |
34 | * This makes a path absolute outside the world of Crossfire. |
35 | * This makes a path absolute outside the world of Crossfire. |
… | |
… | |
67 | char *endbuf; |
68 | char *endbuf; |
68 | struct stat statbuf; |
69 | struct stat statbuf; |
69 | int mode = 0; |
70 | int mode = 0; |
70 | |
71 | |
71 | if (prepend_dir) |
72 | if (prepend_dir) |
72 | strcpy (buf, create_pathname (name)); |
73 | assign (buf, create_pathname (name)); |
73 | else |
74 | else |
74 | strcpy (buf, name); |
75 | assign (buf, name); |
75 | |
76 | |
76 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
77 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
77 | * this method should be equivalant and is clearer. |
78 | * this method should be equivalant and is clearer. |
78 | * Can not use strcat because we need to cycle through |
79 | * Can not use strcat because we need to cycle through |
79 | * all the names. |
80 | * all the names. |
… | |
… | |
228 | |
229 | |
229 | } |
230 | } |
230 | return 0; |
231 | return 0; |
231 | } |
232 | } |
232 | |
233 | |
233 | |
|
|
234 | /* |
234 | /* |
235 | * Returns true if the given object can't fit in the given spot. |
235 | * Returns true if the given object can't fit in the given spot. |
236 | * This is meant for multi space objects - for single space objecs, |
236 | * This is meant for multi space objects - for single space objecs, |
237 | * just calling get_map_blocked and checking that against movement type |
237 | * just calling get_map_blocked and checking that against movement type |
238 | * of object. This function goes through all the parts of the |
238 | * of object. This function goes through all the parts of the |
… | |
… | |
569 | maptile::maptile () |
569 | maptile::maptile () |
570 | { |
570 | { |
571 | in_memory = MAP_SWAPPED; |
571 | in_memory = MAP_SWAPPED; |
572 | |
572 | |
573 | /* The maps used to pick up default x and y values from the |
573 | /* The maps used to pick up default x and y values from the |
574 | * map archetype. Mimic that behaviour. |
574 | * map archetype. Mimic that behaviour. |
575 | */ |
575 | */ |
576 | width = 16; |
576 | width = 16; |
577 | height = 16; |
577 | height = 16; |
578 | reset_timeout = 0; |
|
|
579 | timeout = 300; |
578 | timeout = 300; |
580 | enter_x = 0; |
579 | max_nrof = 1000; // 1000 items of anything |
581 | enter_y = 0; |
580 | max_volume = 2000000; // 2m³ |
582 | } |
581 | } |
583 | |
582 | |
584 | maptile::maptile (int w, int h) |
583 | maptile::maptile (int w, int h) |
585 | { |
584 | { |
586 | in_memory = MAP_SWAPPED; |
585 | in_memory = MAP_SWAPPED; |
… | |
… | |
740 | { |
739 | { |
741 | keyword kw = thawer.get_kv (); |
740 | keyword kw = thawer.get_kv (); |
742 | |
741 | |
743 | switch (kw) |
742 | switch (kw) |
744 | { |
743 | { |
745 | case KW_EOF: |
|
|
746 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
|
|
747 | return false; |
|
|
748 | |
|
|
749 | case KW_end: |
|
|
750 | return true; |
|
|
751 | |
|
|
752 | default: |
|
|
753 | case KW_ERROR: |
|
|
754 | LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword); |
|
|
755 | break; |
|
|
756 | |
|
|
757 | case KW_msg: |
744 | case KW_msg: |
758 | thawer.get_ml (KW_endmsg, msg); |
745 | thawer.get_ml (KW_endmsg, msg); |
759 | break; |
746 | break; |
760 | |
747 | |
761 | case KW_lore: // CF+ extension |
748 | case KW_lore: // CF+ extension |
… | |
… | |
793 | case KW_sky: thawer.get (sky); break; |
780 | case KW_sky: thawer.get (sky); break; |
794 | |
781 | |
795 | case KW_per_player: thawer.get (per_player); break; |
782 | case KW_per_player: thawer.get (per_player); break; |
796 | case KW_per_party: thawer.get (per_party); break; |
783 | case KW_per_party: thawer.get (per_party); break; |
797 | |
784 | |
798 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
785 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
799 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
786 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
800 | |
787 | |
801 | // old names new names |
788 | // old names new names |
802 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
789 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
803 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
790 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
811 | |
798 | |
812 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
799 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
813 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
800 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
814 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
801 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
815 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
802 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
|
|
803 | |
|
|
804 | case KW_end: |
|
|
805 | return true; |
|
|
806 | |
|
|
807 | default: |
|
|
808 | if (!thawer.parse_error (kw, "map", 0)) |
|
|
809 | return false; |
|
|
810 | break; |
816 | } |
811 | } |
817 | } |
812 | } |
818 | |
813 | |
819 | abort (); |
814 | abort (); |
820 | } |
815 | } |
… | |
… | |
872 | MAP_OUT (reset_time); |
867 | MAP_OUT (reset_time); |
873 | MAP_OUT (reset_timeout); |
868 | MAP_OUT (reset_timeout); |
874 | MAP_OUT (fixed_resettime); |
869 | MAP_OUT (fixed_resettime); |
875 | MAP_OUT (difficulty); |
870 | MAP_OUT (difficulty); |
876 | |
871 | |
877 | if (region) MAP_OUT2 (region, region->name); |
872 | if (default_region) MAP_OUT2 (region, default_region->name); |
878 | |
873 | |
879 | if (shopitems) |
874 | if (shopitems) |
880 | { |
875 | { |
881 | char shop[MAX_BUF]; |
876 | char shop[MAX_BUF]; |
882 | print_shop_string (this, shop); |
877 | print_shop_string (this, shop); |
… | |
… | |
933 | * Remove and free all objects in the given map. |
928 | * Remove and free all objects in the given map. |
934 | */ |
929 | */ |
935 | void |
930 | void |
936 | maptile::clear () |
931 | maptile::clear () |
937 | { |
932 | { |
|
|
933 | sfree (regions, size ()), regions = 0; |
|
|
934 | free (regionmap), regionmap = 0; |
|
|
935 | |
938 | if (!spaces) |
936 | if (spaces) |
939 | return; |
937 | { |
940 | |
|
|
941 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
938 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
942 | while (object *op = ms->bot) |
939 | while (object *op = ms->bot) |
943 | { |
940 | { |
944 | if (op->head) |
941 | if (op->head) |
945 | op = op->head; |
942 | op = op->head; |
946 | |
943 | |
947 | op->destroy_inv (false); |
944 | op->destroy_inv (false); |
948 | op->destroy (); |
945 | op->destroy (); |
949 | } |
946 | } |
950 | |
947 | |
951 | sfree (spaces, size ()), spaces = 0; |
948 | sfree (spaces, size ()), spaces = 0; |
|
|
949 | } |
952 | |
950 | |
953 | if (buttons) |
951 | if (buttons) |
954 | free_objectlinkpt (buttons), buttons = 0; |
952 | free_objectlinkpt (buttons), buttons = 0; |
955 | } |
953 | } |
956 | |
954 | |
… | |
… | |
1110 | */ |
1108 | */ |
1111 | void |
1109 | void |
1112 | mapspace::update_ () |
1110 | mapspace::update_ () |
1113 | { |
1111 | { |
1114 | object *tmp, *last = 0; |
1112 | object *tmp, *last = 0; |
1115 | uint8 flags = 0, light = 0, anywhere = 0; |
1113 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1116 | New_Face *top, *floor, *middle; |
1114 | facetile *top, *floor, *middle; |
1117 | object *top_obj, *floor_obj, *middle_obj; |
1115 | object *top_obj, *floor_obj, *middle_obj; |
1118 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1116 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1119 | |
1117 | |
1120 | middle = blank_face; |
1118 | middle = blank_face; |
1121 | top = blank_face; |
1119 | top = blank_face; |
… | |
… | |
1278 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1276 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1279 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1277 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1280 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1278 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1281 | } |
1279 | } |
1282 | |
1280 | |
|
|
1281 | uint64 |
|
|
1282 | mapspace::volume () const |
|
|
1283 | { |
|
|
1284 | uint64 vol = 0; |
|
|
1285 | |
|
|
1286 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1287 | vol += op->volume (); |
|
|
1288 | |
|
|
1289 | return vol; |
|
|
1290 | } |
|
|
1291 | |
1283 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1292 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1284 | * the map. It also takes care of linking back the freshly found |
1293 | * the map. It also takes care of linking back the freshly found |
1285 | * maps tile_map values if it tiles back to this one. It returns |
1294 | * maps tile_map values if it tiles back to this one. It returns |
1286 | * the value of orig_map->tile_map[tile_num]. |
1295 | * the value of orig_map->tile_map[tile_num]. |
1287 | */ |
1296 | */ |
… | |
… | |
1450 | |
1459 | |
1451 | /** |
1460 | /** |
1452 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1461 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1453 | * map1 to map2 in dx/dy. |
1462 | * map1 to map2 in dx/dy. |
1454 | */ |
1463 | */ |
1455 | static int |
1464 | int |
1456 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1465 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1457 | { |
1466 | { |
1458 | if (!map1 || !map2) |
1467 | if (!map1 || !map2) |
1459 | return 0; |
1468 | return 0; |
1460 | |
1469 | |
… | |
… | |
1551 | /* From map.c |
1560 | /* From map.c |
1552 | * This is used by get_player to determine where the other |
1561 | * This is used by get_player to determine where the other |
1553 | * creature is. get_rangevector takes into account map tiling, |
1562 | * creature is. get_rangevector takes into account map tiling, |
1554 | * so you just can not look the the map coordinates and get the |
1563 | * so you just can not look the the map coordinates and get the |
1555 | * righte value. distance_x/y are distance away, which |
1564 | * righte value. distance_x/y are distance away, which |
1556 | * can be negativbe. direction is the crossfire direction scheme |
1565 | * can be negative. direction is the crossfire direction scheme |
1557 | * that the creature should head. part is the part of the |
1566 | * that the creature should head. part is the part of the |
1558 | * monster that is closest. |
1567 | * monster that is closest. |
1559 | * |
1568 | * |
1560 | * get_rangevector looks at op1 and op2, and fills in the |
1569 | * get_rangevector looks at op1 and op2, and fills in the |
1561 | * structure for op1 to get to op2. |
1570 | * structure for op1 to get to op2. |
… | |
… | |
1572 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1581 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1573 | { |
1582 | { |
1574 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1583 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1575 | { |
1584 | { |
1576 | /* be conservative and fill in _some_ data */ |
1585 | /* be conservative and fill in _some_ data */ |
1577 | retval->distance = 100000; |
1586 | retval->distance = 10000; |
1578 | retval->distance_x = 32767; |
1587 | retval->distance_x = 10000; |
1579 | retval->distance_y = 32767; |
1588 | retval->distance_y = 10000; |
1580 | retval->direction = 0; |
1589 | retval->direction = 0; |
1581 | retval->part = 0; |
1590 | retval->part = 0; |
1582 | } |
1591 | } |
1583 | else |
1592 | else |
1584 | { |
1593 | { |
… | |
… | |
1589 | |
1598 | |
1590 | best = op1; |
1599 | best = op1; |
1591 | /* If this is multipart, find the closest part now */ |
1600 | /* If this is multipart, find the closest part now */ |
1592 | if (!(flags & 0x1) && op1->more) |
1601 | if (!(flags & 0x1) && op1->more) |
1593 | { |
1602 | { |
1594 | object *tmp; |
|
|
1595 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1603 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1596 | |
1604 | |
1597 | /* we just take the offset of the piece to head to figure |
1605 | /* we just take the offset of the piece to head to figure |
1598 | * distance instead of doing all that work above again |
1606 | * distance instead of doing all that work above again |
1599 | * since the distance fields we set above are positive in the |
1607 | * since the distance fields we set above are positive in the |
1600 | * same axis as is used for multipart objects, the simply arithmetic |
1608 | * same axis as is used for multipart objects, the simply arithmetic |
1601 | * below works. |
1609 | * below works. |
1602 | */ |
1610 | */ |
1603 | for (tmp = op1->more; tmp != NULL; tmp = tmp->more) |
1611 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1604 | { |
1612 | { |
1605 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1613 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1606 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1614 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1607 | if (tmpi < best_distance) |
1615 | if (tmpi < best_distance) |
1608 | { |
1616 | { |
1609 | best_distance = tmpi; |
1617 | best_distance = tmpi; |
1610 | best = tmp; |
1618 | best = tmp; |
1611 | } |
1619 | } |
1612 | } |
1620 | } |
|
|
1621 | |
1613 | if (best != op1) |
1622 | if (best != op1) |
1614 | { |
1623 | { |
1615 | retval->distance_x += op1->x - best->x; |
1624 | retval->distance_x += op1->x - best->x; |
1616 | retval->distance_y += op1->y - best->y; |
1625 | retval->distance_y += op1->y - best->y; |
1617 | } |
1626 | } |
1618 | } |
1627 | } |
|
|
1628 | |
1619 | retval->part = best; |
1629 | retval->part = best; |
1620 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1630 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1621 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1631 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1622 | } |
1632 | } |
1623 | } |
1633 | } |
1624 | |
1634 | |
1625 | /* this is basically the same as get_rangevector above, but instead of |
1635 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1630 | * flags has no meaning for this function at this time - I kept it in to |
1640 | * flags has no meaning for this function at this time - I kept it in to |
1631 | * be more consistant with the above function and also in case they are needed |
1641 | * be more consistant with the above function and also in case they are needed |
1632 | * for something in the future. Also, since no object is pasted, the best |
1642 | * for something in the future. Also, since no object is pasted, the best |
1633 | * field of the rv_vector is set to NULL. |
1643 | * field of the rv_vector is set to NULL. |
1634 | */ |
1644 | */ |
1635 | |
|
|
1636 | void |
1645 | void |
1637 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
1646 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1638 | { |
1647 | { |
1639 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1648 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1640 | { |
1649 | { |
1641 | /* be conservative and fill in _some_ data */ |
1650 | /* be conservative and fill in _some_ data */ |
1642 | retval->distance = 100000; |
1651 | retval->distance = 100000; |
… | |
… | |
1649 | { |
1658 | { |
1650 | retval->distance_x += op2->x - x; |
1659 | retval->distance_x += op2->x - x; |
1651 | retval->distance_y += op2->y - y; |
1660 | retval->distance_y += op2->y - y; |
1652 | |
1661 | |
1653 | retval->part = NULL; |
1662 | retval->part = NULL; |
1654 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1663 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1655 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1664 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1656 | } |
1665 | } |
1657 | } |
1666 | } |
1658 | |
1667 | |
1659 | /* Returns true of op1 and op2 are effectively on the same map |
1668 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1679 | op->remove (); |
1688 | op->remove (); |
1680 | |
1689 | |
1681 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1690 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1682 | } |
1691 | } |
1683 | |
1692 | |
|
|
1693 | region * |
|
|
1694 | maptile::region (int x, int y) const |
|
|
1695 | { |
|
|
1696 | if (regions |
|
|
1697 | && regionmap |
|
|
1698 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1699 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1700 | return reg; |
|
|
1701 | |
|
|
1702 | if (default_region) |
|
|
1703 | return default_region; |
|
|
1704 | |
|
|
1705 | return ::region::default_region (); |
|
|
1706 | } |
|
|
1707 | |
|
|
1708 | |