1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 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 | { |
83 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
81 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
84 | return 1; |
82 | return 1; |
85 | } |
83 | } |
86 | |
84 | |
87 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
85 | mapspace &ms = m->at (sx, sy); |
88 | * directly. |
|
|
89 | */ |
|
|
90 | mflags = m->at (sx, sy).flags (); |
|
|
91 | |
86 | |
92 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
87 | int mflags = ms.flags (); |
|
|
88 | int blocked = ms.move_block; |
93 | |
89 | |
94 | /* If space is currently not blocked by anything, no need to |
90 | /* If space is currently not blocked by anything, no need to |
95 | * go further. Not true for players - all sorts of special |
91 | * go further. Not true for players - all sorts of special |
96 | * things we need to do for players. |
92 | * things we need to do for players. |
97 | */ |
93 | */ |
98 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
94 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
99 | return 0; |
95 | return 0; |
100 | |
96 | |
101 | /* if there isn't anytyhing alive on this space, and this space isn't |
97 | /* 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 |
98 | * 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 |
99 | * 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 |
100 | * or another. Likewise, only if something is blocking us do we |
105 | * need to investigate if there is a special circumstance that would |
101 | * need to investigate if there is a special circumstance that would |
106 | * let the player through (inventory checkers for example) |
102 | * let the player through (inventory checkers for example) |
… | |
… | |
113 | /* We basically go through the stack of objects, and if there is |
109 | /* 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 |
110 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
115 | * true. If we get through the entire stack, that must mean |
111 | * true. If we get through the entire stack, that must mean |
116 | * ob is blocking it, so return 0. |
112 | * ob is blocking it, so return 0. |
117 | */ |
113 | */ |
118 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
114 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
119 | { |
115 | { |
120 | |
116 | if (OB_MOVE_BLOCK (ob, tmp)) |
121 | /* This must be before the checks below. Code for inventory checkers. */ |
|
|
122 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
|
|
123 | { |
117 | { |
124 | /* If last_sp is set, the player/monster needs an object, |
118 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
125 | * so we check for it. If they don't have it, they can't |
119 | if (RESULT_INT (0)) |
126 | * pass through this space. |
120 | return 1; |
127 | */ |
121 | else |
128 | if (tmp->last_sp) |
122 | continue; |
|
|
123 | |
|
|
124 | if (tmp->type == CHECK_INV) |
129 | { |
125 | { |
130 | if (check_inv_recursive (ob, tmp) == NULL) |
126 | bool have = check_inv_recursive (ob, tmp); |
|
|
127 | |
|
|
128 | // last_sp set means we block if we don't have. |
|
|
129 | if (logical_xor (have, tmp->last_sp)) |
131 | return 1; |
130 | return 1; |
132 | else |
131 | } |
133 | continue; |
132 | else if (tmp->type == T_MATCH) |
|
|
133 | { |
|
|
134 | // T_MATCH allows "entrance" iff the match is true |
|
|
135 | // == blocks if the match fails |
|
|
136 | |
|
|
137 | // we could have used an INVOKE_OBJECT, but decided against it, as we |
|
|
138 | // assume that T_MATCH is relatively common. |
|
|
139 | if (!match (tmp->slaying, ob, tmp, ob)) |
|
|
140 | return 1; |
134 | } |
141 | } |
135 | else |
142 | else |
136 | { |
143 | return 1; // unconditional block |
137 | /* In this case, the player must not have the object - |
144 | |
138 | * if they do, they can't pass through. |
|
|
139 | */ |
|
|
140 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
|
|
141 | return 1; |
|
|
142 | else |
|
|
143 | continue; |
|
|
144 | } |
|
|
145 | } /* if check_inv */ |
|
|
146 | else |
145 | } else { |
147 | { |
146 | // space does not block the ob, directly, but |
148 | /* Broke apart a big nasty if into several here to make |
147 | // anything alive that is not a door still |
149 | * this more readable. first check - if the space blocks |
148 | // blocks anything but wizards. |
150 | * movement, can't move here. |
|
|
151 | * second - if a monster, can't move there, unless it is a |
|
|
152 | * hidden dm |
|
|
153 | */ |
|
|
154 | if (OB_MOVE_BLOCK (ob, tmp)) |
|
|
155 | return 1; |
|
|
156 | |
149 | |
157 | if (tmp->flag [FLAG_ALIVE] |
150 | if (tmp->flag [FLAG_ALIVE] |
158 | && tmp->head_ () != ob |
151 | && tmp->head_ () != ob |
159 | && tmp != ob |
152 | && tmp != ob |
160 | && tmp->type != DOOR |
153 | && tmp->type != DOOR |
161 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
154 | && !tmp->flag [FLAG_WIZPASS]) |
162 | return 1; |
155 | return 1; |
163 | } |
156 | } |
164 | |
|
|
165 | } |
157 | } |
|
|
158 | |
166 | return 0; |
159 | return 0; |
167 | } |
160 | } |
168 | |
161 | |
169 | /* |
162 | /* |
170 | * Returns qthe blocking object if the given object can't fit in the given |
163 | * 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)) |
327 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
335 | { |
328 | { |
336 | // we insert manually because |
329 | // we insert manually because |
337 | // a) its way faster |
330 | // a) its way faster |
338 | // b) we remove manually, too, and there are good reasons for that |
331 | // b) we remove manually, too, and there are good reasons for that |
339 | // c) its correct |
332 | // c) it's correct |
340 | mapspace &ms = at (op->x, op->y); |
333 | mapspace &ms = at (op->x, op->y); |
341 | |
334 | |
342 | op->flag [FLAG_REMOVED] = false; |
335 | op->flag [FLAG_REMOVED] = false; |
343 | |
336 | |
344 | op->above = 0; |
337 | op->above = 0; |
345 | op->below = ms.top; |
338 | op->below = ms.top; |
346 | |
339 | |
347 | if (ms.top) |
|
|
348 | ms.top->above = op; |
340 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
349 | else |
|
|
350 | ms.bot = op; |
|
|
351 | |
341 | |
352 | ms.top = op; |
342 | ms.top = op; |
353 | ms.flags_ = 0; |
343 | ms.flags_ = 0; |
354 | } |
344 | } |
355 | else |
345 | else |
… | |
… | |
567 | return items; |
557 | return items; |
568 | } |
558 | } |
569 | |
559 | |
570 | /* opposite of parse string, this puts the string that was originally fed in to |
560 | /* opposite of parse string, this puts the string that was originally fed in to |
571 | * the map (or something equivilent) into output_string. */ |
561 | * the map (or something equivilent) into output_string. */ |
572 | static void |
562 | static const char * |
573 | print_shop_string (maptile *m, char *output_string) |
563 | print_shop_string (maptile *m) |
574 | { |
564 | { |
575 | int i; |
565 | static dynbuf_text buf; buf.clear (); |
576 | char tmp[MAX_BUF]; |
|
|
577 | |
566 | |
578 | strcpy (output_string, ""); |
|
|
579 | for (i = 0; i < m->shopitems[0].index; i++) |
567 | for (int i = 0; i < m->shopitems[0].index; i++) |
580 | { |
568 | { |
581 | if (m->shopitems[i].typenum) |
569 | if (m->shopitems[i].typenum) |
582 | { |
570 | { |
583 | if (m->shopitems[i].strength) |
571 | if (m->shopitems[i].strength) |
584 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
572 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
585 | else |
573 | else |
586 | sprintf (tmp, "%s;", m->shopitems[i].name); |
574 | buf.printf ("%s;", m->shopitems[i].name); |
587 | } |
575 | } |
588 | else |
576 | else |
589 | { |
577 | { |
590 | if (m->shopitems[i].strength) |
578 | if (m->shopitems[i].strength) |
591 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
579 | buf.printf ("*:%d;", m->shopitems[i].strength); |
592 | else |
580 | else |
593 | sprintf (tmp, "*"); |
581 | buf.printf ("*"); |
594 | } |
582 | } |
595 | |
|
|
596 | strcat (output_string, tmp); |
|
|
597 | } |
583 | } |
|
|
584 | |
|
|
585 | return buf; |
598 | } |
586 | } |
599 | |
587 | |
600 | /* This loads the header information of the map. The header |
588 | /* This loads the header information of the map. The header |
601 | * contains things like difficulty, size, timeout, etc. |
589 | * contains things like difficulty, size, timeout, etc. |
602 | * this used to be stored in the map object, but with the |
590 | * this used to be stored in the map object, but with the |
… | |
… | |
737 | MAP_OUT (reset_timeout); |
725 | MAP_OUT (reset_timeout); |
738 | MAP_OUT (fixed_resettime); |
726 | MAP_OUT (fixed_resettime); |
739 | MAP_OUT (no_reset); |
727 | MAP_OUT (no_reset); |
740 | MAP_OUT (no_drop); |
728 | MAP_OUT (no_drop); |
741 | MAP_OUT (difficulty); |
729 | MAP_OUT (difficulty); |
742 | |
|
|
743 | if (default_region) MAP_OUT2 (region, default_region->name); |
730 | if (default_region) MAP_OUT2 (region, default_region->name); |
744 | |
731 | |
745 | if (shopitems) |
732 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
746 | { |
|
|
747 | char shop[MAX_BUF]; |
|
|
748 | print_shop_string (this, shop); |
|
|
749 | MAP_OUT2 (shopitems, shop); |
|
|
750 | } |
|
|
751 | |
|
|
752 | MAP_OUT (shopgreed); |
733 | MAP_OUT (shopgreed); |
753 | MAP_OUT (shopmin); |
734 | MAP_OUT (shopmin); |
754 | MAP_OUT (shopmax); |
735 | MAP_OUT (shopmax); |
755 | if (shoprace) MAP_OUT (shoprace); |
736 | if (shoprace) MAP_OUT (shoprace); |
|
|
737 | |
756 | MAP_OUT (darkness); |
738 | MAP_OUT (darkness); |
757 | MAP_OUT (width); |
739 | MAP_OUT (width); |
758 | MAP_OUT (height); |
740 | MAP_OUT (height); |
759 | MAP_OUT (enter_x); |
741 | MAP_OUT (enter_x); |
760 | MAP_OUT (enter_y); |
742 | MAP_OUT (enter_y); |
… | |
… | |
937 | op->destroy (); |
919 | op->destroy (); |
938 | } |
920 | } |
939 | } |
921 | } |
940 | |
922 | |
941 | /* |
923 | /* |
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. |
924 | * This routine is supposed to find out the difficulty of the map. |
967 | * difficulty does not have a lot to do with character level, |
925 | * difficulty does not have a lot to do with character level, |
968 | * but does have a lot to do with treasure on the map. |
926 | * but does have a lot to do with treasure on the map. |
969 | * |
927 | * |
970 | * Difficulty can now be set by the map creator. If the value stored |
928 | * Difficulty can now be set by the map creator. If the value stored |
… | |
… | |
1216 | vol += op->volume (); |
1174 | vol += op->volume (); |
1217 | |
1175 | |
1218 | return vol; |
1176 | return vol; |
1219 | } |
1177 | } |
1220 | |
1178 | |
1221 | bool |
1179 | maptile * |
1222 | maptile::tile_available (int dir, bool load) |
1180 | maptile::tile_available (int dir, bool load) |
1223 | { |
1181 | { |
1224 | if (!tile_path[dir]) |
1182 | if (tile_path[dir]) |
1225 | return 0; |
1183 | { |
1226 | |
|
|
1227 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1184 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1228 | return 1; |
1185 | return tile_map[dir]; |
1229 | |
1186 | |
1230 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1187 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1231 | return 1; |
1188 | return tile_map[dir]; |
|
|
1189 | } |
1232 | |
1190 | |
1233 | return 0; |
1191 | return 0; |
1234 | } |
1192 | } |
1235 | |
1193 | |
1236 | /* this returns TRUE if the coordinates (x,y) are out of |
1194 | /* this returns TRUE if the coordinates (x,y) are out of |
… | |
… | |
1542 | else |
1500 | else |
1543 | { |
1501 | { |
1544 | retval->distance_x += op2->x - x; |
1502 | retval->distance_x += op2->x - x; |
1545 | retval->distance_y += op2->y - y; |
1503 | retval->distance_y += op2->y - y; |
1546 | |
1504 | |
1547 | retval->part = NULL; |
1505 | retval->part = 0; |
1548 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1506 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1549 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1507 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1550 | } |
1508 | } |
1551 | } |
1509 | } |
1552 | |
1510 | |
1553 | /* Returns true of op1 and op2 are effectively on the same map |
1511 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1628 | if (distance <= MAX_SOUND_DISTANCE) |
1586 | if (distance <= MAX_SOUND_DISTANCE) |
1629 | ns->play_sound (sound, dx, dy); |
1587 | ns->play_sound (sound, dx, dy); |
1630 | } |
1588 | } |
1631 | } |
1589 | } |
1632 | |
1590 | |
|
|
1591 | void |
|
|
1592 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1593 | { |
|
|
1594 | for_all_players (pl) |
|
|
1595 | if (client *ns = pl->ns) |
|
|
1596 | { |
|
|
1597 | int dx = x - pl->ob->x; |
|
|
1598 | int dy = y - pl->ob->y; |
|
|
1599 | |
|
|
1600 | int distance = idistance (dx, dy); |
|
|
1601 | |
|
|
1602 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1603 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
|
|
1604 | } |
|
|
1605 | } |
|
|
1606 | |
|
|
1607 | static void |
|
|
1608 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1609 | { |
|
|
1610 | // clip to map to the left |
|
|
1611 | if (x0 < 0) |
|
|
1612 | { |
|
|
1613 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1614 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1615 | |
|
|
1616 | if (x1 < 0) // entirely to the left |
|
|
1617 | return; |
|
|
1618 | |
|
|
1619 | x0 = 0; |
|
|
1620 | } |
|
|
1621 | |
|
|
1622 | // clip to map to the right |
|
|
1623 | if (x1 > m->width) |
|
|
1624 | { |
|
|
1625 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1626 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1627 | |
|
|
1628 | if (x0 > m->width) // entirely to the right |
|
|
1629 | return; |
|
|
1630 | |
|
|
1631 | x1 = m->width; |
|
|
1632 | } |
|
|
1633 | |
|
|
1634 | // clip to map above |
|
|
1635 | if (y0 < 0) |
|
|
1636 | { |
|
|
1637 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1638 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1639 | |
|
|
1640 | if (y1 < 0) // entirely above |
|
|
1641 | return; |
|
|
1642 | |
|
|
1643 | y0 = 0; |
|
|
1644 | } |
|
|
1645 | |
|
|
1646 | // clip to map below |
|
|
1647 | if (y1 > m->height) |
|
|
1648 | { |
|
|
1649 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1650 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1651 | |
|
|
1652 | if (y0 > m->height) // entirely below |
|
|
1653 | return; |
|
|
1654 | |
|
|
1655 | y1 = m->height; |
|
|
1656 | } |
|
|
1657 | |
|
|
1658 | // if we get here, the rect is within the current map |
|
|
1659 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1660 | |
|
|
1661 | r->m = m; |
|
|
1662 | r->x0 = x0; |
|
|
1663 | r->y0 = y0; |
|
|
1664 | r->x1 = x1; |
|
|
1665 | r->y1 = y1; |
|
|
1666 | r->dx = dx; |
|
|
1667 | r->dy = dy; |
|
|
1668 | } |
|
|
1669 | |
|
|
1670 | maprect * |
|
|
1671 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1672 | { |
|
|
1673 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1674 | buf.clear (); |
|
|
1675 | |
|
|
1676 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1677 | |
|
|
1678 | // add end marker |
|
|
1679 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1680 | r->m = 0; |
|
|
1681 | |
|
|
1682 | return (maprect *)buf.linearise (); |
|
|
1683 | } |
|
|
1684 | |