… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * 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 Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <unistd.h> |
25 | #include <unistd.h> |
… | |
… | |
70 | * by the caller. |
71 | * by the caller. |
71 | */ |
72 | */ |
72 | int |
73 | int |
73 | blocked_link (object *ob, maptile *m, int sx, int sy) |
74 | blocked_link (object *ob, maptile *m, int sx, int sy) |
74 | { |
75 | { |
75 | object *tmp; |
|
|
76 | int mflags, blocked; |
|
|
77 | |
|
|
78 | /* Make sure the coordinates are valid - they should be, as caller should |
76 | /* Make sure the coordinates are valid - they should be, as caller should |
79 | * have already checked this. |
77 | * have already checked this. |
80 | */ |
78 | */ |
81 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
79 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
82 | { |
80 | { |
… | |
… | |
85 | } |
83 | } |
86 | |
84 | |
87 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
85 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
88 | * directly. |
86 | * directly. |
89 | */ |
87 | */ |
90 | mflags = m->at (sx, sy).flags (); |
88 | mapspace &ms = m->at (sx, sy); |
91 | |
89 | |
92 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
90 | int mflags = ms.flags (); |
|
|
91 | int blocked = ms.move_block; |
93 | |
92 | |
94 | /* If space is currently not blocked by anything, no need to |
93 | /* If space is currently not blocked by anything, no need to |
95 | * go further. Not true for players - all sorts of special |
94 | * go further. Not true for players - all sorts of special |
96 | * things we need to do for players. |
95 | * things we need to do for players. |
97 | */ |
96 | */ |
98 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
97 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
99 | return 0; |
98 | return 0; |
100 | |
99 | |
101 | /* if there isn't anytyhing alive on this space, and this space isn't |
100 | /* if there isn't anything alive on this space, and this space isn't |
102 | * otherwise blocked, we can return now. Only if there is a living |
101 | * otherwise blocked, we can return now. Only if there is a living |
103 | * creature do we need to investigate if it is part of this creature |
102 | * creature do we need to investigate if it is part of this creature |
104 | * or another. Likewise, only if something is blocking us do we |
103 | * or another. Likewise, only if something is blocking us do we |
105 | * need to investigate if there is a special circumstance that would |
104 | * need to investigate if there is a special circumstance that would |
106 | * let the player through (inventory checkers for example) |
105 | * let the player through (inventory checkers for example) |
… | |
… | |
113 | /* We basically go through the stack of objects, and if there is |
112 | /* We basically go through the stack of objects, and if there is |
114 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
113 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
115 | * true. If we get through the entire stack, that must mean |
114 | * true. If we get through the entire stack, that must mean |
116 | * ob is blocking it, so return 0. |
115 | * ob is blocking it, so return 0. |
117 | */ |
116 | */ |
118 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
117 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
119 | { |
118 | { |
120 | |
|
|
121 | /* This must be before the checks below. Code for inventory checkers. */ |
119 | /* This must be before the checks below. Code for inventory checkers. */ |
122 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
120 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
123 | { |
121 | { |
|
|
122 | bool have = check_inv_recursive (ob, tmp); |
|
|
123 | |
124 | /* If last_sp is set, the player/monster needs an object, |
124 | /* If last_sp is set, the player/monster needs an object, |
125 | * so we check for it. If they don't have it, they can't |
125 | * so we check for it. If they don't have it, they can't |
126 | * pass through this space. |
126 | * pass through this space. |
127 | */ |
127 | */ |
128 | if (tmp->last_sp) |
128 | if (tmp->last_sp) |
129 | { |
129 | { |
130 | if (check_inv_recursive (ob, tmp) == NULL) |
130 | if (!have) |
131 | return 1; |
131 | return 1; |
132 | else |
|
|
133 | continue; |
|
|
134 | } |
132 | } |
135 | else |
133 | else |
136 | { |
134 | { |
137 | /* In this case, the player must not have the object - |
135 | /* In this case, the player must not have the object - |
138 | * if they do, they can't pass through. |
136 | * if they do, they can't pass through. |
139 | */ |
137 | */ |
140 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
138 | if (have) |
141 | return 1; |
139 | return 1; |
142 | else |
|
|
143 | continue; |
|
|
144 | } |
140 | } |
145 | } /* if check_inv */ |
141 | } |
146 | else |
142 | else |
147 | { |
143 | { |
148 | /* Broke apart a big nasty if into several here to make |
144 | /* Broke apart a big nasty if into several here to make |
149 | * this more readable. first check - if the space blocks |
145 | * this more readable. first check - if the space blocks |
150 | * movement, can't move here. |
146 | * movement, can't move here. |
151 | * second - if a monster, can't move there, unless it is a |
147 | * second - if a monster, can't move there, unless it is a |
152 | * hidden dm |
148 | * dm. |
153 | */ |
149 | */ |
154 | if (OB_MOVE_BLOCK (ob, tmp)) |
150 | if (OB_MOVE_BLOCK (ob, tmp)) |
155 | return 1; |
151 | return 1; |
156 | |
152 | |
157 | if (tmp->flag [FLAG_ALIVE] |
153 | if (tmp->flag [FLAG_ALIVE] |
158 | && tmp->head_ () != ob |
154 | && tmp->head_ () != ob |
159 | && tmp != ob |
155 | && tmp != ob |
160 | && tmp->type != DOOR |
156 | && tmp->type != DOOR |
161 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
157 | && !tmp->flag [FLAG_WIZ]) |
162 | return 1; |
158 | return 1; |
163 | } |
159 | } |
164 | |
|
|
165 | } |
160 | } |
|
|
161 | |
166 | return 0; |
162 | return 0; |
167 | } |
163 | } |
168 | |
164 | |
169 | /* |
165 | /* |
170 | * Returns qthe blocking object if the given object can't fit in the given |
166 | * Returns qthe blocking object if the given object can't fit in the given |
… | |
… | |
334 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
330 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
335 | { |
331 | { |
336 | // we insert manually because |
332 | // we insert manually because |
337 | // a) its way faster |
333 | // a) its way faster |
338 | // b) we remove manually, too, and there are good reasons for that |
334 | // b) we remove manually, too, and there are good reasons for that |
339 | // c) its correct |
335 | // c) it's correct |
340 | mapspace &ms = at (op->x, op->y); |
336 | mapspace &ms = at (op->x, op->y); |
341 | |
337 | |
342 | op->flag [FLAG_REMOVED] = false; |
338 | op->flag [FLAG_REMOVED] = false; |
343 | |
339 | |
344 | op->above = 0; |
340 | op->above = 0; |
345 | op->below = ms.top; |
341 | op->below = ms.top; |
346 | |
342 | |
347 | if (ms.top) |
|
|
348 | ms.top->above = op; |
343 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
349 | else |
|
|
350 | ms.bot = op; |
|
|
351 | |
344 | |
352 | ms.top = op; |
345 | ms.top = op; |
353 | ms.flags_ = 0; |
346 | ms.flags_ = 0; |
354 | } |
347 | } |
355 | else |
348 | else |
… | |
… | |
937 | op->destroy (); |
930 | op->destroy (); |
938 | } |
931 | } |
939 | } |
932 | } |
940 | |
933 | |
941 | /* |
934 | /* |
942 | * Updates every button on the map (by calling update_button() for them). |
|
|
943 | */ |
|
|
944 | void |
|
|
945 | maptile::update_buttons () |
|
|
946 | { |
|
|
947 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
948 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
949 | { |
|
|
950 | if (!ol->ob) |
|
|
951 | { |
|
|
952 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
953 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
954 | continue; |
|
|
955 | } |
|
|
956 | |
|
|
957 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
958 | { |
|
|
959 | update_button (ol->ob); |
|
|
960 | break; |
|
|
961 | } |
|
|
962 | } |
|
|
963 | } |
|
|
964 | |
|
|
965 | /* |
|
|
966 | * This routine is supposed to find out the difficulty of the map. |
935 | * This routine is supposed to find out the difficulty of the map. |
967 | * difficulty does not have a lot to do with character level, |
936 | * difficulty does not have a lot to do with character level, |
968 | * but does have a lot to do with treasure on the map. |
937 | * but does have a lot to do with treasure on the map. |
969 | * |
938 | * |
970 | * Difficulty can now be set by the map creator. If the value stored |
939 | * Difficulty can now be set by the map creator. If the value stored |
… | |
… | |
1023 | * postive values make it darker, negative make it brighter |
992 | * postive values make it darker, negative make it brighter |
1024 | */ |
993 | */ |
1025 | int |
994 | int |
1026 | maptile::change_map_light (int change) |
995 | maptile::change_map_light (int change) |
1027 | { |
996 | { |
1028 | int new_level = darkness + change; |
|
|
1029 | |
|
|
1030 | /* Nothing to do */ |
997 | /* Nothing to do */ |
1031 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
998 | if (!change) |
1032 | return 0; |
999 | return 0; |
1033 | |
1000 | |
1034 | /* inform all players on the map */ |
1001 | /* inform all players on the map */ |
1035 | if (change > 0) |
1002 | if (change > 0) |
1036 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1003 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1037 | else |
1004 | else |
1038 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1005 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1039 | |
1006 | |
1040 | /* Do extra checking. since darkness is a unsigned value, |
1007 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1041 | * we need to be extra careful about negative values. |
|
|
1042 | * In general, the checks below are only needed if change |
|
|
1043 | * is not +/-1 |
|
|
1044 | */ |
|
|
1045 | if (new_level < 0) |
|
|
1046 | darkness = 0; |
|
|
1047 | else if (new_level >= MAX_DARKNESS) |
|
|
1048 | darkness = MAX_DARKNESS; |
|
|
1049 | else |
|
|
1050 | darkness = new_level; |
|
|
1051 | |
1008 | |
1052 | /* All clients need to get re-updated for the change */ |
1009 | /* All clients need to get re-updated for the change */ |
1053 | update_all_map_los (this); |
1010 | update_all_map_los (this); |
1054 | |
1011 | |
1055 | return 1; |
1012 | return 1; |
… | |
… | |
1228 | vol += op->volume (); |
1185 | vol += op->volume (); |
1229 | |
1186 | |
1230 | return vol; |
1187 | return vol; |
1231 | } |
1188 | } |
1232 | |
1189 | |
1233 | bool |
1190 | maptile * |
1234 | maptile::tile_available (int dir, bool load) |
1191 | maptile::tile_available (int dir, bool load) |
1235 | { |
1192 | { |
1236 | if (!tile_path[dir]) |
1193 | if (tile_path[dir]) |
1237 | return 0; |
1194 | { |
1238 | |
|
|
1239 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1195 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1240 | return 1; |
1196 | return tile_map[dir]; |
1241 | |
1197 | |
1242 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1198 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1243 | return 1; |
1199 | return tile_map[dir]; |
|
|
1200 | } |
1244 | |
1201 | |
1245 | return 0; |
1202 | return 0; |
1246 | } |
1203 | } |
1247 | |
1204 | |
1248 | /* this returns TRUE if the coordinates (x,y) are out of |
1205 | /* this returns TRUE if the coordinates (x,y) are out of |
… | |
… | |
1554 | else |
1511 | else |
1555 | { |
1512 | { |
1556 | retval->distance_x += op2->x - x; |
1513 | retval->distance_x += op2->x - x; |
1557 | retval->distance_y += op2->y - y; |
1514 | retval->distance_y += op2->y - y; |
1558 | |
1515 | |
1559 | retval->part = NULL; |
1516 | retval->part = 0; |
1560 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1517 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1561 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1518 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1562 | } |
1519 | } |
1563 | } |
1520 | } |
1564 | |
1521 | |
1565 | /* Returns true of op1 and op2 are effectively on the same map |
1522 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1640 | if (distance <= MAX_SOUND_DISTANCE) |
1597 | if (distance <= MAX_SOUND_DISTANCE) |
1641 | ns->play_sound (sound, dx, dy); |
1598 | ns->play_sound (sound, dx, dy); |
1642 | } |
1599 | } |
1643 | } |
1600 | } |
1644 | |
1601 | |
|
|
1602 | void |
|
|
1603 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1604 | { |
|
|
1605 | for_all_players (pl) |
|
|
1606 | if (client *ns = pl->ns) |
|
|
1607 | { |
|
|
1608 | int dx = x - pl->ob->x; |
|
|
1609 | int dy = y - pl->ob->y; |
|
|
1610 | |
|
|
1611 | int distance = idistance (dx, dy); |
|
|
1612 | |
|
|
1613 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1614 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
|
|
1615 | } |
|
|
1616 | } |
|
|
1617 | |
|
|
1618 | static void |
|
|
1619 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1620 | { |
|
|
1621 | // clip to map to the left |
|
|
1622 | if (x0 < 0) |
|
|
1623 | { |
|
|
1624 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1625 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1626 | |
|
|
1627 | if (x1 < 0) // entirely to the left |
|
|
1628 | return; |
|
|
1629 | |
|
|
1630 | x0 = 0; |
|
|
1631 | } |
|
|
1632 | |
|
|
1633 | // clip to map to the right |
|
|
1634 | if (x1 > m->width) |
|
|
1635 | { |
|
|
1636 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1637 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1638 | |
|
|
1639 | if (x0 > m->width) // entirely to the right |
|
|
1640 | return; |
|
|
1641 | |
|
|
1642 | x1 = m->width; |
|
|
1643 | } |
|
|
1644 | |
|
|
1645 | // clip to map above |
|
|
1646 | if (y0 < 0) |
|
|
1647 | { |
|
|
1648 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1649 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1650 | |
|
|
1651 | if (y1 < 0) // entirely above |
|
|
1652 | return; |
|
|
1653 | |
|
|
1654 | y0 = 0; |
|
|
1655 | } |
|
|
1656 | |
|
|
1657 | // clip to map below |
|
|
1658 | if (y1 > m->height) |
|
|
1659 | { |
|
|
1660 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1661 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1662 | |
|
|
1663 | if (y0 > m->height) // entirely below |
|
|
1664 | return; |
|
|
1665 | |
|
|
1666 | y1 = m->height; |
|
|
1667 | } |
|
|
1668 | |
|
|
1669 | // if we get here, the rect is within the current map |
|
|
1670 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1671 | |
|
|
1672 | r->m = m; |
|
|
1673 | r->x0 = x0; |
|
|
1674 | r->y0 = y0; |
|
|
1675 | r->x1 = x1; |
|
|
1676 | r->y1 = y1; |
|
|
1677 | r->dx = dx; |
|
|
1678 | r->dy = dy; |
|
|
1679 | } |
|
|
1680 | |
|
|
1681 | maprect * |
|
|
1682 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1683 | { |
|
|
1684 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1685 | buf.clear (); |
|
|
1686 | |
|
|
1687 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1688 | |
|
|
1689 | // add end marker |
|
|
1690 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1691 | r->m = 0; |
|
|
1692 | |
|
|
1693 | return (maprect *)buf.linearise (); |
|
|
1694 | } |
|
|
1695 | |