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> |
25 | |
26 | |
26 | #include "global.h" |
27 | #include "global.h" |
27 | #include "loader.h" |
28 | #include "loader.h" |
28 | #include "path.h" |
29 | #include "path.h" |
|
|
30 | |
|
|
31 | sint8 maptile::outdoor_darkness; |
29 | |
32 | |
30 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
31 | * one function that just returns a P_.. value (see map.h) |
34 | * one function that just returns a P_.. value (see map.h) |
32 | * it will also do map translation for tiled maps, returning |
35 | * it will also do map translation for tiled maps, returning |
33 | * new values into newmap, nx, and ny. Any and all of those |
36 | * new values into newmap, nx, and ny. Any and all of those |
… | |
… | |
68 | * by the caller. |
71 | * by the caller. |
69 | */ |
72 | */ |
70 | int |
73 | int |
71 | blocked_link (object *ob, maptile *m, int sx, int sy) |
74 | blocked_link (object *ob, maptile *m, int sx, int sy) |
72 | { |
75 | { |
73 | object *tmp; |
|
|
74 | int mflags, blocked; |
|
|
75 | |
|
|
76 | /* 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 |
77 | * have already checked this. |
77 | * have already checked this. |
78 | */ |
78 | */ |
79 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
79 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
80 | { |
80 | { |
… | |
… | |
83 | } |
83 | } |
84 | |
84 | |
85 | /* 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 |
86 | * directly. |
86 | * directly. |
87 | */ |
87 | */ |
88 | mflags = m->at (sx, sy).flags (); |
88 | mapspace &ms = m->at (sx, sy); |
89 | |
89 | |
90 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
90 | int mflags = ms.flags (); |
|
|
91 | int blocked = ms.move_block; |
91 | |
92 | |
92 | /* If space is currently not blocked by anything, no need to |
93 | /* If space is currently not blocked by anything, no need to |
93 | * go further. Not true for players - all sorts of special |
94 | * go further. Not true for players - all sorts of special |
94 | * things we need to do for players. |
95 | * things we need to do for players. |
95 | */ |
96 | */ |
96 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
97 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
97 | return 0; |
98 | return 0; |
98 | |
99 | |
99 | /* 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 |
100 | * 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 |
101 | * 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 |
102 | * or another. Likewise, only if something is blocking us do we |
103 | * or another. Likewise, only if something is blocking us do we |
103 | * need to investigate if there is a special circumstance that would |
104 | * need to investigate if there is a special circumstance that would |
104 | * let the player through (inventory checkers for example) |
105 | * let the player through (inventory checkers for example) |
… | |
… | |
111 | /* 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 |
112 | * 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 |
113 | * true. If we get through the entire stack, that must mean |
114 | * true. If we get through the entire stack, that must mean |
114 | * ob is blocking it, so return 0. |
115 | * ob is blocking it, so return 0. |
115 | */ |
116 | */ |
116 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
117 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
117 | { |
118 | { |
|
|
119 | bool block = OB_MOVE_BLOCK (ob, tmp); |
118 | |
120 | |
119 | /* This must be before the checks below. Code for inventory checkers. */ |
121 | /* This must be before the checks below. Code for inventory checkers. */ |
120 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
122 | if (block && tmp->type == CHECK_INV) |
121 | { |
123 | { |
|
|
124 | bool have = check_inv_recursive (ob, tmp); |
|
|
125 | |
122 | /* If last_sp is set, the player/monster needs an object, |
126 | /* If last_sp is set, the player/monster needs an object, |
123 | * so we check for it. If they don't have it, they can't |
127 | * so we check for it. If they don't have it, they can't |
124 | * pass through this space. |
128 | * pass through this space. |
125 | */ |
129 | */ |
126 | if (tmp->last_sp) |
130 | if (tmp->last_sp) |
127 | { |
131 | { |
128 | if (check_inv_recursive (ob, tmp) == NULL) |
132 | if (!have) |
129 | return 1; |
133 | return 1; |
130 | else |
|
|
131 | continue; |
|
|
132 | } |
134 | } |
133 | else |
135 | else |
134 | { |
136 | { |
135 | /* In this case, the player must not have the object - |
137 | /* In this case, the player must not have the object - |
136 | * if they do, they can't pass through. |
138 | * if they do, they can't pass through. |
137 | */ |
139 | */ |
138 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
140 | if (have) |
139 | return 1; |
141 | return 1; |
140 | else |
|
|
141 | continue; |
|
|
142 | } |
142 | } |
143 | } /* if check_inv */ |
143 | } |
|
|
144 | else if (block && tmp->type == T_MATCH) |
|
|
145 | { |
|
|
146 | //TODO |
|
|
147 | } |
144 | else |
148 | else |
145 | { |
149 | { |
146 | /* Broke apart a big nasty if into several here to make |
150 | /* Broke apart a big nasty if into several here to make |
147 | * this more readable. first check - if the space blocks |
151 | * this more readable. first check - if the space blocks |
148 | * movement, can't move here. |
152 | * movement, can't move here. |
149 | * second - if a monster, can't move there, unless it is a |
153 | * second - if a monster, can't move there, unless it is a |
150 | * hidden dm |
154 | * dm. |
151 | */ |
155 | */ |
152 | if (OB_MOVE_BLOCK (ob, tmp)) |
156 | if (block) |
153 | return 1; |
157 | return 1; |
154 | |
158 | |
155 | if (tmp->flag [FLAG_ALIVE] |
159 | if (tmp->flag [FLAG_ALIVE] |
156 | && tmp->head_ () != ob |
160 | && tmp->head_ () != ob |
157 | && tmp != ob |
161 | && tmp != ob |
158 | && tmp->type != DOOR |
162 | && tmp->type != DOOR |
159 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
163 | && !tmp->flag [FLAG_WIZ]) |
160 | return 1; |
164 | return 1; |
161 | } |
165 | } |
162 | |
|
|
163 | } |
166 | } |
|
|
167 | |
164 | return 0; |
168 | return 0; |
165 | } |
169 | } |
166 | |
170 | |
167 | /* |
171 | /* |
168 | * Returns qthe blocking object if the given object can't fit in the given |
172 | * Returns qthe blocking object if the given object can't fit in the given |
… | |
… | |
332 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
336 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
333 | { |
337 | { |
334 | // we insert manually because |
338 | // we insert manually because |
335 | // a) its way faster |
339 | // a) its way faster |
336 | // b) we remove manually, too, and there are good reasons for that |
340 | // b) we remove manually, too, and there are good reasons for that |
337 | // c) its correct |
341 | // c) it's correct |
338 | mapspace &ms = at (op->x, op->y); |
342 | mapspace &ms = at (op->x, op->y); |
339 | |
343 | |
340 | op->flag [FLAG_REMOVED] = false; |
344 | op->flag [FLAG_REMOVED] = false; |
341 | |
345 | |
342 | op->above = 0; |
346 | op->above = 0; |
343 | op->below = ms.top; |
347 | op->below = ms.top; |
344 | |
348 | |
345 | if (ms.top) |
|
|
346 | ms.top->above = op; |
349 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
347 | else |
|
|
348 | ms.bot = op; |
|
|
349 | |
350 | |
350 | ms.top = op; |
351 | ms.top = op; |
351 | ms.flags_ = 0; |
352 | ms.flags_ = 0; |
352 | } |
353 | } |
353 | else |
354 | else |
354 | { |
355 | { |
355 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
356 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
356 | op->destroy_inv (false); // be explicit about dropping |
|
|
357 | op->destroy (true); |
357 | op->destroy (); |
358 | } |
358 | } |
359 | } |
359 | } |
360 | |
360 | |
361 | continue; |
361 | continue; |
362 | |
362 | |
… | |
… | |
566 | return items; |
566 | return items; |
567 | } |
567 | } |
568 | |
568 | |
569 | /* opposite of parse string, this puts the string that was originally fed in to |
569 | /* opposite of parse string, this puts the string that was originally fed in to |
570 | * the map (or something equivilent) into output_string. */ |
570 | * the map (or something equivilent) into output_string. */ |
571 | static void |
571 | static const char * |
572 | print_shop_string (maptile *m, char *output_string) |
572 | print_shop_string (maptile *m) |
573 | { |
573 | { |
574 | int i; |
574 | static dynbuf_text buf; buf.clear (); |
575 | char tmp[MAX_BUF]; |
|
|
576 | |
575 | |
577 | strcpy (output_string, ""); |
|
|
578 | for (i = 0; i < m->shopitems[0].index; i++) |
576 | for (int i = 0; i < m->shopitems[0].index; i++) |
579 | { |
577 | { |
580 | if (m->shopitems[i].typenum) |
578 | if (m->shopitems[i].typenum) |
581 | { |
579 | { |
582 | if (m->shopitems[i].strength) |
580 | if (m->shopitems[i].strength) |
583 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
581 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
584 | else |
582 | else |
585 | sprintf (tmp, "%s;", m->shopitems[i].name); |
583 | buf.printf ("%s;", m->shopitems[i].name); |
586 | } |
584 | } |
587 | else |
585 | else |
588 | { |
586 | { |
589 | if (m->shopitems[i].strength) |
587 | if (m->shopitems[i].strength) |
590 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
588 | buf.printf ("*:%d;", m->shopitems[i].strength); |
591 | else |
589 | else |
592 | sprintf (tmp, "*"); |
590 | buf.printf ("*"); |
593 | } |
591 | } |
594 | |
|
|
595 | strcat (output_string, tmp); |
|
|
596 | } |
592 | } |
|
|
593 | |
|
|
594 | return buf; |
597 | } |
595 | } |
598 | |
596 | |
599 | /* This loads the header information of the map. The header |
597 | /* This loads the header information of the map. The header |
600 | * contains things like difficulty, size, timeout, etc. |
598 | * contains things like difficulty, size, timeout, etc. |
601 | * this used to be stored in the map object, but with the |
599 | * this used to be stored in the map object, but with the |
… | |
… | |
713 | |
711 | |
714 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
712 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
715 | unique = 1; |
713 | unique = 1; |
716 | |
714 | |
717 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
715 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
718 | { |
|
|
719 | op->destroy_inv (false); |
|
|
720 | op->destroy (true); |
716 | op->destroy (); |
721 | } |
|
|
722 | |
717 | |
723 | op = above; |
718 | op = above; |
724 | } |
719 | } |
725 | } |
720 | } |
726 | } |
721 | } |
… | |
… | |
739 | MAP_OUT (reset_timeout); |
734 | MAP_OUT (reset_timeout); |
740 | MAP_OUT (fixed_resettime); |
735 | MAP_OUT (fixed_resettime); |
741 | MAP_OUT (no_reset); |
736 | MAP_OUT (no_reset); |
742 | MAP_OUT (no_drop); |
737 | MAP_OUT (no_drop); |
743 | MAP_OUT (difficulty); |
738 | MAP_OUT (difficulty); |
744 | |
|
|
745 | if (default_region) MAP_OUT2 (region, default_region->name); |
739 | if (default_region) MAP_OUT2 (region, default_region->name); |
746 | |
740 | |
747 | if (shopitems) |
741 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
748 | { |
|
|
749 | char shop[MAX_BUF]; |
|
|
750 | print_shop_string (this, shop); |
|
|
751 | MAP_OUT2 (shopitems, shop); |
|
|
752 | } |
|
|
753 | |
|
|
754 | MAP_OUT (shopgreed); |
742 | MAP_OUT (shopgreed); |
755 | MAP_OUT (shopmin); |
743 | MAP_OUT (shopmin); |
756 | MAP_OUT (shopmax); |
744 | MAP_OUT (shopmax); |
757 | if (shoprace) MAP_OUT (shoprace); |
745 | if (shoprace) MAP_OUT (shoprace); |
|
|
746 | |
758 | MAP_OUT (darkness); |
747 | MAP_OUT (darkness); |
759 | MAP_OUT (width); |
748 | MAP_OUT (width); |
760 | MAP_OUT (height); |
749 | MAP_OUT (height); |
761 | MAP_OUT (enter_x); |
750 | MAP_OUT (enter_x); |
762 | MAP_OUT (enter_y); |
751 | MAP_OUT (enter_y); |
… | |
… | |
814 | |
803 | |
815 | op->flag [FLAG_REMOVED] = true; |
804 | op->flag [FLAG_REMOVED] = true; |
816 | |
805 | |
817 | object *head = op->head_ (); |
806 | object *head = op->head_ (); |
818 | if (op == head) |
807 | if (op == head) |
819 | { |
|
|
820 | op->destroy_inv (false); |
|
|
821 | op->destroy (true); |
808 | op->destroy (); |
822 | } |
|
|
823 | else if (head->map != op->map) |
809 | else if (head->map != op->map) |
824 | { |
810 | { |
825 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
811 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
826 | head->destroy (true); |
812 | head->destroy (); |
827 | } |
813 | } |
828 | } |
814 | } |
829 | |
815 | |
830 | sfree0 (spaces, size ()); |
816 | sfree0 (spaces, size ()); |
831 | } |
817 | } |
… | |
… | |
937 | destroy = 1; |
923 | destroy = 1; |
938 | } |
924 | } |
939 | |
925 | |
940 | /* adjust overall chance below */ |
926 | /* adjust overall chance below */ |
941 | if (destroy && rndm (0, 1)) |
927 | if (destroy && rndm (0, 1)) |
942 | op->destroy (true); |
928 | op->destroy (); |
943 | } |
|
|
944 | } |
|
|
945 | |
|
|
946 | /* |
|
|
947 | * Updates every button on the map (by calling update_button() for them). |
|
|
948 | */ |
|
|
949 | void |
|
|
950 | maptile::update_buttons () |
|
|
951 | { |
|
|
952 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
953 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
954 | { |
|
|
955 | if (!ol->ob) |
|
|
956 | { |
|
|
957 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
958 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
959 | continue; |
|
|
960 | } |
|
|
961 | |
|
|
962 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
963 | { |
|
|
964 | update_button (ol->ob); |
|
|
965 | break; |
|
|
966 | } |
|
|
967 | } |
929 | } |
968 | } |
930 | } |
969 | |
931 | |
970 | /* |
932 | /* |
971 | * This routine is supposed to find out the difficulty of the map. |
933 | * This routine is supposed to find out the difficulty of the map. |
972 | * difficulty does not have a lot to do with character level, |
934 | * difficulty does not have a lot to do with character level, |
973 | * but does have a lot to do with treasure on the map. |
935 | * but does have a lot to do with treasure on the map. |
974 | * |
936 | * |
975 | * Difficulty can now be set by the map creature. If the value stored |
937 | * Difficulty can now be set by the map creator. If the value stored |
976 | * in the map is zero, then use this routine. Maps should really |
938 | * in the map is zero, then use this routine. Maps should really |
977 | * have a difficulty set than using this function - human calculation |
939 | * have a difficulty set rather than using this function - human calculation |
978 | * is much better than this functions guesswork. |
940 | * is much better than this function's guesswork. |
979 | */ |
941 | */ |
980 | int |
942 | int |
981 | maptile::estimate_difficulty () const |
943 | maptile::estimate_difficulty () const |
982 | { |
944 | { |
983 | long monster_cnt = 0; |
945 | long monster_cnt = 0; |
… | |
… | |
1028 | * postive values make it darker, negative make it brighter |
990 | * postive values make it darker, negative make it brighter |
1029 | */ |
991 | */ |
1030 | int |
992 | int |
1031 | maptile::change_map_light (int change) |
993 | maptile::change_map_light (int change) |
1032 | { |
994 | { |
1033 | int new_level = darkness + change; |
|
|
1034 | |
|
|
1035 | /* Nothing to do */ |
995 | /* Nothing to do */ |
1036 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
996 | if (!change) |
1037 | return 0; |
997 | return 0; |
1038 | |
998 | |
1039 | /* inform all players on the map */ |
999 | /* inform all players on the map */ |
1040 | if (change > 0) |
1000 | if (change > 0) |
1041 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1001 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1042 | else |
1002 | else |
1043 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1003 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1044 | |
1004 | |
1045 | /* Do extra checking. since darkness is a unsigned value, |
1005 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1046 | * we need to be extra careful about negative values. |
|
|
1047 | * In general, the checks below are only needed if change |
|
|
1048 | * is not +/-1 |
|
|
1049 | */ |
|
|
1050 | if (new_level < 0) |
|
|
1051 | darkness = 0; |
|
|
1052 | else if (new_level >= MAX_DARKNESS) |
|
|
1053 | darkness = MAX_DARKNESS; |
|
|
1054 | else |
|
|
1055 | darkness = new_level; |
|
|
1056 | |
1006 | |
1057 | /* All clients need to get re-updated for the change */ |
1007 | /* All clients need to get re-updated for the change */ |
1058 | update_all_map_los (this); |
1008 | update_all_map_los (this); |
1059 | |
1009 | |
1060 | return 1; |
1010 | return 1; |
… | |
… | |
1068 | */ |
1018 | */ |
1069 | void |
1019 | void |
1070 | mapspace::update_ () |
1020 | mapspace::update_ () |
1071 | { |
1021 | { |
1072 | object *last = 0; |
1022 | object *last = 0; |
1073 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1023 | uint8 flags = P_UPTODATE, anywhere = 0; |
|
|
1024 | sint8 light = 0; |
1074 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1025 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1075 | |
1026 | |
1076 | //object *middle = 0; |
1027 | //object *middle = 0; |
1077 | //object *top = 0; |
1028 | //object *top = 0; |
1078 | //object *floor = 0; |
1029 | //object *floor = 0; |
… | |
… | |
1081 | object *&middle = faces_obj[1] = 0; |
1032 | object *&middle = faces_obj[1] = 0; |
1082 | object *&floor = faces_obj[2] = 0; |
1033 | object *&floor = faces_obj[2] = 0; |
1083 | |
1034 | |
1084 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1035 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1085 | { |
1036 | { |
1086 | /* This could be made additive I guess (two lights better than |
1037 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1087 | * one). But if so, it shouldn't be a simple additive - 2 |
|
|
1088 | * light bulbs do not illuminate twice as far as once since |
|
|
1089 | * it is a dissapation factor that is cubed. |
|
|
1090 | */ |
|
|
1091 | light = max (light, tmp->glow_radius); |
1038 | light += tmp->glow_radius; |
1092 | |
1039 | |
1093 | /* This call is needed in order to update objects the player |
1040 | /* This call is needed in order to update objects the player |
1094 | * is standing in that have animations (ie, grass, fire, etc). |
1041 | * is standing in that have animations (ie, grass, fire, etc). |
1095 | * However, it also causes the look window to be re-drawn |
1042 | * However, it also causes the look window to be re-drawn |
1096 | * 3 times each time the player moves, because many of the |
1043 | * 3 times each time the player moves, because many of the |
… | |
… | |
1144 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1091 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1145 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1092 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1146 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1093 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1147 | } |
1094 | } |
1148 | |
1095 | |
1149 | this->light = light; |
1096 | this->light = min (light, MAX_LIGHT_RADIUS); |
1150 | this->flags_ = flags; |
1097 | this->flags_ = flags; |
1151 | this->move_block = move_block & ~move_allow; |
1098 | this->move_block = move_block & ~move_allow; |
1152 | this->move_on = move_on; |
1099 | this->move_on = move_on; |
1153 | this->move_off = move_off; |
1100 | this->move_off = move_off; |
1154 | this->move_slow = move_slow; |
1101 | this->move_slow = move_slow; |
… | |
… | |
1236 | vol += op->volume (); |
1183 | vol += op->volume (); |
1237 | |
1184 | |
1238 | return vol; |
1185 | return vol; |
1239 | } |
1186 | } |
1240 | |
1187 | |
1241 | bool |
1188 | maptile * |
1242 | maptile::tile_available (int dir, bool load) |
1189 | maptile::tile_available (int dir, bool load) |
1243 | { |
1190 | { |
1244 | if (!tile_path[dir]) |
1191 | if (tile_path[dir]) |
1245 | return 0; |
1192 | { |
1246 | |
|
|
1247 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1193 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1248 | return 1; |
1194 | return tile_map[dir]; |
1249 | |
1195 | |
1250 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1196 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1251 | return 1; |
1197 | return tile_map[dir]; |
|
|
1198 | } |
1252 | |
1199 | |
1253 | return 0; |
1200 | return 0; |
1254 | } |
1201 | } |
1255 | |
1202 | |
1256 | /* this returns TRUE if the coordinates (x,y) are out of |
1203 | /* this returns TRUE if the coordinates (x,y) are out of |
… | |
… | |
1562 | else |
1509 | else |
1563 | { |
1510 | { |
1564 | retval->distance_x += op2->x - x; |
1511 | retval->distance_x += op2->x - x; |
1565 | retval->distance_y += op2->y - y; |
1512 | retval->distance_y += op2->y - y; |
1566 | |
1513 | |
1567 | retval->part = NULL; |
1514 | retval->part = 0; |
1568 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1515 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1569 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1516 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1570 | } |
1517 | } |
1571 | } |
1518 | } |
1572 | |
1519 | |
1573 | /* Returns true of op1 and op2 are effectively on the same map |
1520 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1635 | maptile::play_sound (faceidx sound, int x, int y) const |
1582 | maptile::play_sound (faceidx sound, int x, int y) const |
1636 | { |
1583 | { |
1637 | if (!sound) |
1584 | if (!sound) |
1638 | return; |
1585 | return; |
1639 | |
1586 | |
|
|
1587 | for_all_players_on_map (pl, this) |
|
|
1588 | if (client *ns = pl->ns) |
|
|
1589 | { |
|
|
1590 | int dx = x - pl->ob->x; |
|
|
1591 | int dy = y - pl->ob->y; |
|
|
1592 | |
|
|
1593 | int distance = idistance (dx, dy); |
|
|
1594 | |
|
|
1595 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1596 | ns->play_sound (sound, dx, dy); |
|
|
1597 | } |
|
|
1598 | } |
|
|
1599 | |
|
|
1600 | void |
|
|
1601 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1602 | { |
1640 | for_all_players (pl) |
1603 | for_all_players (pl) |
1641 | if (pl->ob->map == this) |
|
|
1642 | if (client *ns = pl->ns) |
1604 | if (client *ns = pl->ns) |
1643 | { |
1605 | { |
1644 | int dx = x - pl->ob->x; |
1606 | int dx = x - pl->ob->x; |
1645 | int dy = y - pl->ob->y; |
1607 | int dy = y - pl->ob->y; |
1646 | |
1608 | |
1647 | int distance = idistance (dx, dy); |
1609 | int distance = idistance (dx, dy); |
1648 | |
1610 | |
1649 | if (distance <= MAX_SOUND_DISTANCE) |
1611 | if (distance <= MAX_SOUND_DISTANCE) |
1650 | ns->play_sound (sound, dx, dy); |
1612 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1651 | } |
1613 | } |
1652 | } |
1614 | } |
1653 | |
1615 | |
|
|
1616 | static void |
|
|
1617 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1618 | { |
|
|
1619 | // clip to map to the left |
|
|
1620 | if (x0 < 0) |
|
|
1621 | { |
|
|
1622 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1623 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1624 | |
|
|
1625 | if (x1 < 0) // entirely to the left |
|
|
1626 | return; |
|
|
1627 | |
|
|
1628 | x0 = 0; |
|
|
1629 | } |
|
|
1630 | |
|
|
1631 | // clip to map to the right |
|
|
1632 | if (x1 > m->width) |
|
|
1633 | { |
|
|
1634 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1635 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1636 | |
|
|
1637 | if (x0 > m->width) // entirely to the right |
|
|
1638 | return; |
|
|
1639 | |
|
|
1640 | x1 = m->width; |
|
|
1641 | } |
|
|
1642 | |
|
|
1643 | // clip to map above |
|
|
1644 | if (y0 < 0) |
|
|
1645 | { |
|
|
1646 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1647 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1648 | |
|
|
1649 | if (y1 < 0) // entirely above |
|
|
1650 | return; |
|
|
1651 | |
|
|
1652 | y0 = 0; |
|
|
1653 | } |
|
|
1654 | |
|
|
1655 | // clip to map below |
|
|
1656 | if (y1 > m->height) |
|
|
1657 | { |
|
|
1658 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1659 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1660 | |
|
|
1661 | if (y0 > m->height) // entirely below |
|
|
1662 | return; |
|
|
1663 | |
|
|
1664 | y1 = m->height; |
|
|
1665 | } |
|
|
1666 | |
|
|
1667 | // if we get here, the rect is within the current map |
|
|
1668 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1669 | |
|
|
1670 | r->m = m; |
|
|
1671 | r->x0 = x0; |
|
|
1672 | r->y0 = y0; |
|
|
1673 | r->x1 = x1; |
|
|
1674 | r->y1 = y1; |
|
|
1675 | r->dx = dx; |
|
|
1676 | r->dy = dy; |
|
|
1677 | } |
|
|
1678 | |
|
|
1679 | maprect * |
|
|
1680 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1681 | { |
|
|
1682 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1683 | buf.clear (); |
|
|
1684 | |
|
|
1685 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1686 | |
|
|
1687 | // add end marker |
|
|
1688 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1689 | r->m = 0; |
|
|
1690 | |
|
|
1691 | return (maprect *)buf.linearise (); |
|
|
1692 | } |
|
|
1693 | |