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 | { |
118 | |
119 | if (OB_MOVE_BLOCK (ob, tmp)) |
119 | /* This must be before the checks below. Code for inventory checkers. */ |
|
|
120 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
|
|
121 | { |
120 | { |
122 | /* If last_sp is set, the player/monster needs an object, |
121 | if (tmp->type == CHECK_INV) |
123 | * so we check for it. If they don't have it, they can't |
|
|
124 | * pass through this space. |
|
|
125 | */ |
|
|
126 | if (tmp->last_sp) |
|
|
127 | { |
122 | { |
128 | if (check_inv_recursive (ob, tmp) == NULL) |
123 | bool have = check_inv_recursive (ob, tmp); |
|
|
124 | |
|
|
125 | // last_sp set means we block if we don't have. |
|
|
126 | if (logical_xor (have, tmp->last_sp)) |
129 | return 1; |
127 | return 1; |
130 | else |
128 | } |
131 | continue; |
129 | else if (tmp->type == T_MATCH) |
|
|
130 | { |
|
|
131 | // T_MATCH allows "entrance" iff the match is true |
|
|
132 | // == blocks if the match fails |
|
|
133 | |
|
|
134 | // we could have used an INVOKE_OBJECT, but decided against it, as we |
|
|
135 | // assume that T_MATCH is very common. |
|
|
136 | if (!match (tmp->slaying, ob, tmp, ob)) |
|
|
137 | return 1; |
132 | } |
138 | } |
133 | else |
139 | else |
134 | { |
140 | return 1; // unconditional block |
135 | /* In this case, the player must not have the object - |
141 | |
136 | * if they do, they can't pass through. |
|
|
137 | */ |
|
|
138 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
|
|
139 | return 1; |
|
|
140 | else |
|
|
141 | continue; |
|
|
142 | } |
|
|
143 | } /* if check_inv */ |
|
|
144 | else |
142 | } else { |
145 | { |
143 | // space does not block the ob, directly, but |
146 | /* Broke apart a big nasty if into several here to make |
144 | // anything alive that is not a door still |
147 | * this more readable. first check - if the space blocks |
145 | // blocks anything but wizards. |
148 | * movement, can't move here. |
|
|
149 | * second - if a monster, can't move there, unless it is a |
|
|
150 | * hidden dm |
|
|
151 | */ |
|
|
152 | if (OB_MOVE_BLOCK (ob, tmp)) |
|
|
153 | return 1; |
|
|
154 | |
146 | |
155 | if (tmp->flag [FLAG_ALIVE] |
147 | if (tmp->flag [FLAG_ALIVE] |
156 | && tmp->head_ () != ob |
148 | && tmp->head_ () != ob |
157 | && tmp != ob |
149 | && tmp != ob |
158 | && tmp->type != DOOR |
150 | && tmp->type != DOOR |
159 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
151 | && !tmp->flag [FLAG_WIZPASS]) |
160 | return 1; |
152 | return 1; |
161 | } |
153 | } |
162 | |
|
|
163 | } |
154 | } |
|
|
155 | |
164 | return 0; |
156 | return 0; |
165 | } |
157 | } |
166 | |
158 | |
167 | /* |
159 | /* |
168 | * Returns qthe blocking object if the given object can't fit in the given |
160 | * 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)) |
324 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
333 | { |
325 | { |
334 | // we insert manually because |
326 | // we insert manually because |
335 | // a) its way faster |
327 | // a) its way faster |
336 | // b) we remove manually, too, and there are good reasons for that |
328 | // b) we remove manually, too, and there are good reasons for that |
337 | // c) its correct |
329 | // c) it's correct |
338 | mapspace &ms = at (op->x, op->y); |
330 | mapspace &ms = at (op->x, op->y); |
339 | |
331 | |
340 | op->flag [FLAG_REMOVED] = false; |
332 | op->flag [FLAG_REMOVED] = false; |
341 | |
333 | |
342 | op->above = 0; |
334 | op->above = 0; |
343 | op->below = ms.top; |
335 | op->below = ms.top; |
344 | |
336 | |
345 | if (ms.top) |
|
|
346 | ms.top->above = op; |
337 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
347 | else |
|
|
348 | ms.bot = op; |
|
|
349 | |
338 | |
350 | ms.top = op; |
339 | ms.top = op; |
351 | ms.flags_ = 0; |
340 | ms.flags_ = 0; |
352 | } |
341 | } |
353 | else |
342 | else |
… | |
… | |
565 | return items; |
554 | return items; |
566 | } |
555 | } |
567 | |
556 | |
568 | /* opposite of parse string, this puts the string that was originally fed in to |
557 | /* opposite of parse string, this puts the string that was originally fed in to |
569 | * the map (or something equivilent) into output_string. */ |
558 | * the map (or something equivilent) into output_string. */ |
570 | static void |
559 | static const char * |
571 | print_shop_string (maptile *m, char *output_string) |
560 | print_shop_string (maptile *m) |
572 | { |
561 | { |
573 | int i; |
562 | static dynbuf_text buf; buf.clear (); |
574 | char tmp[MAX_BUF]; |
|
|
575 | |
563 | |
576 | strcpy (output_string, ""); |
|
|
577 | for (i = 0; i < m->shopitems[0].index; i++) |
564 | for (int i = 0; i < m->shopitems[0].index; i++) |
578 | { |
565 | { |
579 | if (m->shopitems[i].typenum) |
566 | if (m->shopitems[i].typenum) |
580 | { |
567 | { |
581 | if (m->shopitems[i].strength) |
568 | if (m->shopitems[i].strength) |
582 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
569 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
583 | else |
570 | else |
584 | sprintf (tmp, "%s;", m->shopitems[i].name); |
571 | buf.printf ("%s;", m->shopitems[i].name); |
585 | } |
572 | } |
586 | else |
573 | else |
587 | { |
574 | { |
588 | if (m->shopitems[i].strength) |
575 | if (m->shopitems[i].strength) |
589 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
576 | buf.printf ("*:%d;", m->shopitems[i].strength); |
590 | else |
577 | else |
591 | sprintf (tmp, "*"); |
578 | buf.printf ("*"); |
592 | } |
579 | } |
593 | |
|
|
594 | strcat (output_string, tmp); |
|
|
595 | } |
580 | } |
|
|
581 | |
|
|
582 | return buf; |
596 | } |
583 | } |
597 | |
584 | |
598 | /* This loads the header information of the map. The header |
585 | /* This loads the header information of the map. The header |
599 | * contains things like difficulty, size, timeout, etc. |
586 | * contains things like difficulty, size, timeout, etc. |
600 | * this used to be stored in the map object, but with the |
587 | * this used to be stored in the map object, but with the |
… | |
… | |
735 | MAP_OUT (reset_timeout); |
722 | MAP_OUT (reset_timeout); |
736 | MAP_OUT (fixed_resettime); |
723 | MAP_OUT (fixed_resettime); |
737 | MAP_OUT (no_reset); |
724 | MAP_OUT (no_reset); |
738 | MAP_OUT (no_drop); |
725 | MAP_OUT (no_drop); |
739 | MAP_OUT (difficulty); |
726 | MAP_OUT (difficulty); |
740 | |
|
|
741 | if (default_region) MAP_OUT2 (region, default_region->name); |
727 | if (default_region) MAP_OUT2 (region, default_region->name); |
742 | |
728 | |
743 | if (shopitems) |
729 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
744 | { |
|
|
745 | char shop[MAX_BUF]; |
|
|
746 | print_shop_string (this, shop); |
|
|
747 | MAP_OUT2 (shopitems, shop); |
|
|
748 | } |
|
|
749 | |
|
|
750 | MAP_OUT (shopgreed); |
730 | MAP_OUT (shopgreed); |
751 | MAP_OUT (shopmin); |
731 | MAP_OUT (shopmin); |
752 | MAP_OUT (shopmax); |
732 | MAP_OUT (shopmax); |
753 | if (shoprace) MAP_OUT (shoprace); |
733 | if (shoprace) MAP_OUT (shoprace); |
|
|
734 | |
754 | MAP_OUT (darkness); |
735 | MAP_OUT (darkness); |
755 | MAP_OUT (width); |
736 | MAP_OUT (width); |
756 | MAP_OUT (height); |
737 | MAP_OUT (height); |
757 | MAP_OUT (enter_x); |
738 | MAP_OUT (enter_x); |
758 | MAP_OUT (enter_y); |
739 | MAP_OUT (enter_y); |
… | |
… | |
935 | op->destroy (); |
916 | op->destroy (); |
936 | } |
917 | } |
937 | } |
918 | } |
938 | |
919 | |
939 | /* |
920 | /* |
940 | * Updates every button on the map (by calling update_button() for them). |
|
|
941 | */ |
|
|
942 | void |
|
|
943 | maptile::update_buttons () |
|
|
944 | { |
|
|
945 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
946 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
947 | { |
|
|
948 | if (!ol->ob) |
|
|
949 | { |
|
|
950 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
951 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
952 | continue; |
|
|
953 | } |
|
|
954 | |
|
|
955 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
956 | { |
|
|
957 | update_button (ol->ob); |
|
|
958 | break; |
|
|
959 | } |
|
|
960 | } |
|
|
961 | } |
|
|
962 | |
|
|
963 | /* |
|
|
964 | * This routine is supposed to find out the difficulty of the map. |
921 | * This routine is supposed to find out the difficulty of the map. |
965 | * difficulty does not have a lot to do with character level, |
922 | * difficulty does not have a lot to do with character level, |
966 | * but does have a lot to do with treasure on the map. |
923 | * but does have a lot to do with treasure on the map. |
967 | * |
924 | * |
968 | * Difficulty can now be set by the map creature. If the value stored |
925 | * Difficulty can now be set by the map creator. If the value stored |
969 | * in the map is zero, then use this routine. Maps should really |
926 | * in the map is zero, then use this routine. Maps should really |
970 | * have a difficulty set than using this function - human calculation |
927 | * have a difficulty set rather than using this function - human calculation |
971 | * is much better than this functions guesswork. |
928 | * is much better than this function's guesswork. |
972 | */ |
929 | */ |
973 | int |
930 | int |
974 | maptile::estimate_difficulty () const |
931 | maptile::estimate_difficulty () const |
975 | { |
932 | { |
976 | long monster_cnt = 0; |
933 | long monster_cnt = 0; |
… | |
… | |
1021 | * postive values make it darker, negative make it brighter |
978 | * postive values make it darker, negative make it brighter |
1022 | */ |
979 | */ |
1023 | int |
980 | int |
1024 | maptile::change_map_light (int change) |
981 | maptile::change_map_light (int change) |
1025 | { |
982 | { |
1026 | int new_level = darkness + change; |
|
|
1027 | |
|
|
1028 | /* Nothing to do */ |
983 | /* Nothing to do */ |
1029 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
984 | if (!change) |
1030 | return 0; |
985 | return 0; |
1031 | |
986 | |
1032 | /* inform all players on the map */ |
987 | /* inform all players on the map */ |
1033 | if (change > 0) |
988 | if (change > 0) |
1034 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
989 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1035 | else |
990 | else |
1036 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
991 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1037 | |
992 | |
1038 | /* Do extra checking. since darkness is a unsigned value, |
993 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1039 | * we need to be extra careful about negative values. |
|
|
1040 | * In general, the checks below are only needed if change |
|
|
1041 | * is not +/-1 |
|
|
1042 | */ |
|
|
1043 | if (new_level < 0) |
|
|
1044 | darkness = 0; |
|
|
1045 | else if (new_level >= MAX_DARKNESS) |
|
|
1046 | darkness = MAX_DARKNESS; |
|
|
1047 | else |
|
|
1048 | darkness = new_level; |
|
|
1049 | |
994 | |
1050 | /* All clients need to get re-updated for the change */ |
995 | /* All clients need to get re-updated for the change */ |
1051 | update_all_map_los (this); |
996 | update_all_map_los (this); |
1052 | |
997 | |
1053 | return 1; |
998 | return 1; |
… | |
… | |
1226 | vol += op->volume (); |
1171 | vol += op->volume (); |
1227 | |
1172 | |
1228 | return vol; |
1173 | return vol; |
1229 | } |
1174 | } |
1230 | |
1175 | |
1231 | bool |
1176 | maptile * |
1232 | maptile::tile_available (int dir, bool load) |
1177 | maptile::tile_available (int dir, bool load) |
1233 | { |
1178 | { |
1234 | if (!tile_path[dir]) |
1179 | if (tile_path[dir]) |
1235 | return 0; |
1180 | { |
1236 | |
|
|
1237 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1181 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1238 | return 1; |
1182 | return tile_map[dir]; |
1239 | |
1183 | |
1240 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1184 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1241 | return 1; |
1185 | return tile_map[dir]; |
|
|
1186 | } |
1242 | |
1187 | |
1243 | return 0; |
1188 | return 0; |
1244 | } |
1189 | } |
1245 | |
1190 | |
1246 | /* this returns TRUE if the coordinates (x,y) are out of |
1191 | /* this returns TRUE if the coordinates (x,y) are out of |
… | |
… | |
1552 | else |
1497 | else |
1553 | { |
1498 | { |
1554 | retval->distance_x += op2->x - x; |
1499 | retval->distance_x += op2->x - x; |
1555 | retval->distance_y += op2->y - y; |
1500 | retval->distance_y += op2->y - y; |
1556 | |
1501 | |
1557 | retval->part = NULL; |
1502 | retval->part = 0; |
1558 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1503 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1559 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1504 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1560 | } |
1505 | } |
1561 | } |
1506 | } |
1562 | |
1507 | |
1563 | /* Returns true of op1 and op2 are effectively on the same map |
1508 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1638 | if (distance <= MAX_SOUND_DISTANCE) |
1583 | if (distance <= MAX_SOUND_DISTANCE) |
1639 | ns->play_sound (sound, dx, dy); |
1584 | ns->play_sound (sound, dx, dy); |
1640 | } |
1585 | } |
1641 | } |
1586 | } |
1642 | |
1587 | |
|
|
1588 | void |
|
|
1589 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1590 | { |
|
|
1591 | for_all_players (pl) |
|
|
1592 | if (client *ns = pl->ns) |
|
|
1593 | { |
|
|
1594 | int dx = x - pl->ob->x; |
|
|
1595 | int dy = y - pl->ob->y; |
|
|
1596 | |
|
|
1597 | int distance = idistance (dx, dy); |
|
|
1598 | |
|
|
1599 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1600 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
|
|
1601 | } |
|
|
1602 | } |
|
|
1603 | |
|
|
1604 | static void |
|
|
1605 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1606 | { |
|
|
1607 | // clip to map to the left |
|
|
1608 | if (x0 < 0) |
|
|
1609 | { |
|
|
1610 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1611 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1612 | |
|
|
1613 | if (x1 < 0) // entirely to the left |
|
|
1614 | return; |
|
|
1615 | |
|
|
1616 | x0 = 0; |
|
|
1617 | } |
|
|
1618 | |
|
|
1619 | // clip to map to the right |
|
|
1620 | if (x1 > m->width) |
|
|
1621 | { |
|
|
1622 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1623 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1624 | |
|
|
1625 | if (x0 > m->width) // entirely to the right |
|
|
1626 | return; |
|
|
1627 | |
|
|
1628 | x1 = m->width; |
|
|
1629 | } |
|
|
1630 | |
|
|
1631 | // clip to map above |
|
|
1632 | if (y0 < 0) |
|
|
1633 | { |
|
|
1634 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1635 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1636 | |
|
|
1637 | if (y1 < 0) // entirely above |
|
|
1638 | return; |
|
|
1639 | |
|
|
1640 | y0 = 0; |
|
|
1641 | } |
|
|
1642 | |
|
|
1643 | // clip to map below |
|
|
1644 | if (y1 > m->height) |
|
|
1645 | { |
|
|
1646 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1647 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1648 | |
|
|
1649 | if (y0 > m->height) // entirely below |
|
|
1650 | return; |
|
|
1651 | |
|
|
1652 | y1 = m->height; |
|
|
1653 | } |
|
|
1654 | |
|
|
1655 | // if we get here, the rect is within the current map |
|
|
1656 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1657 | |
|
|
1658 | r->m = m; |
|
|
1659 | r->x0 = x0; |
|
|
1660 | r->y0 = y0; |
|
|
1661 | r->x1 = x1; |
|
|
1662 | r->y1 = y1; |
|
|
1663 | r->dx = dx; |
|
|
1664 | r->dy = dy; |
|
|
1665 | } |
|
|
1666 | |
|
|
1667 | maprect * |
|
|
1668 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1669 | { |
|
|
1670 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1671 | buf.clear (); |
|
|
1672 | |
|
|
1673 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1674 | |
|
|
1675 | // add end marker |
|
|
1676 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1677 | r->m = 0; |
|
|
1678 | |
|
|
1679 | return (maprect *)buf.linearise (); |
|
|
1680 | } |
|
|
1681 | |