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> |
25 | #include <global.h> |
26 | #include <funcpoint.h> |
26 | #include <funcpoint.h> |
27 | |
27 | |
28 | #include <loader.h> |
28 | #include <loader.h> |
… | |
… | |
1110 | */ |
1110 | */ |
1111 | void |
1111 | void |
1112 | mapspace::update_ () |
1112 | mapspace::update_ () |
1113 | { |
1113 | { |
1114 | object *tmp, *last = 0; |
1114 | object *tmp, *last = 0; |
1115 | uint8 flags = 0, light = 0, anywhere = 0; |
1115 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1116 | New_Face *top, *floor, *middle; |
1116 | New_Face *top, *floor, *middle; |
1117 | object *top_obj, *floor_obj, *middle_obj; |
1117 | object *top_obj, *floor_obj, *middle_obj; |
1118 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1118 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1119 | |
1119 | |
1120 | middle = blank_face; |
1120 | middle = blank_face; |
… | |
… | |
1608 | { |
1608 | { |
1609 | best_distance = tmpi; |
1609 | best_distance = tmpi; |
1610 | best = tmp; |
1610 | best = tmp; |
1611 | } |
1611 | } |
1612 | } |
1612 | } |
|
|
1613 | |
1613 | if (best != op1) |
1614 | if (best != op1) |
1614 | { |
1615 | { |
1615 | retval->distance_x += op1->x - best->x; |
1616 | retval->distance_x += op1->x - best->x; |
1616 | retval->distance_y += op1->y - best->y; |
1617 | retval->distance_y += op1->y - best->y; |
1617 | } |
1618 | } |
1618 | } |
1619 | } |
|
|
1620 | |
1619 | retval->part = best; |
1621 | retval->part = best; |
1620 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1622 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1621 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1623 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1622 | } |
1624 | } |
1623 | } |
1625 | } |
1624 | |
1626 | |
1625 | /* this is basically the same as get_rangevector above, but instead of |
1627 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1649 | { |
1651 | { |
1650 | retval->distance_x += op2->x - x; |
1652 | retval->distance_x += op2->x - x; |
1651 | retval->distance_y += op2->y - y; |
1653 | retval->distance_y += op2->y - y; |
1652 | |
1654 | |
1653 | retval->part = NULL; |
1655 | retval->part = NULL; |
1654 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1656 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1655 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1657 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1656 | } |
1658 | } |
1657 | } |
1659 | } |
1658 | |
1660 | |
1659 | /* Returns true of op1 and op2 are effectively on the same map |
1661 | /* Returns true of op1 and op2 are effectively on the same map |