ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.142 by root, Sun May 18 17:52:53 2008 UTC vs.
Revision 1.163 by root, Thu Oct 15 21:40:42 2009 UTC

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
28#include "loader.h" 28#include "loader.h"
29
30#include "path.h" 29#include "path.h"
30
31sint8 maptile::outdoor_darkness;
31 32
32/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
33 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
34 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
35 * 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
70 * by the caller. 71 * by the caller.
71 */ 72 */
72int 73int
73blocked_link (object *ob, maptile *m, int sx, int sy) 74blocked_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 {
119 bool block = OB_MOVE_BLOCK (ob, tmp);
120 120
121 /* This must be before the checks below. Code for inventory checkers. */ 121 /* This must be before the checks below. Code for inventory checkers. */
122 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 122 if (block && tmp->type == CHECK_INV)
123 { 123 {
124 bool have = check_inv_recursive (ob, tmp);
125
124 /* If last_sp is set, the player/monster needs an object, 126 /* 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 127 * so we check for it. If they don't have it, they can't
126 * pass through this space. 128 * pass through this space.
127 */ 129 */
128 if (tmp->last_sp) 130 if (tmp->last_sp)
129 { 131 {
130 if (check_inv_recursive (ob, tmp) == NULL) 132 if (!have)
131 return 1; 133 return 1;
132 else
133 continue;
134 } 134 }
135 else 135 else
136 { 136 {
137 /* In this case, the player must not have the object - 137 /* In this case, the player must not have the object -
138 * if they do, they can't pass through. 138 * if they do, they can't pass through.
139 */ 139 */
140 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ 140 if (have)
141 return 1; 141 return 1;
142 else
143 continue;
144 } 142 }
145 } /* if check_inv */ 143 }
144 else if (block && tmp->type == T_MATCH)
145 {
146 //TODO
147 }
146 else 148 else
147 { 149 {
148 /* Broke apart a big nasty if into several here to make 150 /* Broke apart a big nasty if into several here to make
149 * this more readable. first check - if the space blocks 151 * this more readable. first check - if the space blocks
150 * movement, can't move here. 152 * movement, can't move here.
151 * 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
152 * hidden dm 154 * dm.
153 */ 155 */
154 if (OB_MOVE_BLOCK (ob, tmp)) 156 if (block)
155 return 1; 157 return 1;
156 158
157 if (tmp->flag [FLAG_ALIVE] 159 if (tmp->flag [FLAG_ALIVE]
158 && tmp->head_ () != ob 160 && tmp->head_ () != ob
159 && tmp != ob 161 && tmp != ob
160 && tmp->type != DOOR 162 && tmp->type != DOOR
161 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) 163 && !tmp->flag [FLAG_WIZ])
162 return 1; 164 return 1;
163 } 165 }
164
165 } 166 }
167
166 return 0; 168 return 0;
167} 169}
168 170
169/* 171/*
170 * 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
260 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 262 for (mapspace *ms = spaces + size (); ms-- > spaces; )
261 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 263 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
262 tmp->flag [flag] = value; 264 tmp->flag [flag] = value;
263} 265}
264 266
267void
268maptile::post_load_original ()
269{
270 if (!spaces)
271 return;
272
273 set_object_flag (FLAG_OBJ_ORIGINAL);
274
275 for (mapspace *ms = spaces + size (); ms-- > spaces; )
276 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
277 INVOKE_OBJECT (RESET, tmp);
278}
279
265/* link_multipart_objects go through all the objects on the map looking 280/* link_multipart_objects go through all the objects on the map looking
266 * for objects whose arch says they are multipart yet according to the 281 * for objects whose arch says they are multipart yet according to the
267 * info we have, they only have the head (as would be expected when 282 * info we have, they only have the head (as would be expected when
268 * they are saved). 283 * they are saved).
269 */ 284 */
321 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))
322 { 337 {
323 // we insert manually because 338 // we insert manually because
324 // a) its way faster 339 // a) its way faster
325 // 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
326 // c) its correct 341 // c) it's correct
327 mapspace &ms = at (op->x, op->y); 342 mapspace &ms = at (op->x, op->y);
328 343
329 op->flag [FLAG_REMOVED] = false; 344 op->flag [FLAG_REMOVED] = false;
330 345
331 op->above = 0; 346 op->above = 0;
332 op->below = ms.top; 347 op->below = ms.top;
333 348
334 if (ms.top)
335 ms.top->above = op; 349 *(ms.top ? &ms.top->above : &ms.bot) = op;
336 else
337 ms.bot = op;
338 350
339 ms.top = op; 351 ms.top = op;
340 ms.flags_ = 0; 352 ms.flags_ = 0;
341 } 353 }
342 else 354 else
701 713
702 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 714 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
703 unique = 1; 715 unique = 1;
704 716
705 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 717 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
706 {
707 op->destroy_inv (false);
708 op->destroy (); 718 op->destroy ();
709 }
710 719
711 op = above; 720 op = above;
712 } 721 }
713 } 722 }
714} 723}
802 811
803 op->flag [FLAG_REMOVED] = true; 812 op->flag [FLAG_REMOVED] = true;
804 813
805 object *head = op->head_ (); 814 object *head = op->head_ ();
806 if (op == head) 815 if (op == head)
807 {
808 op->destroy_inv (false);
809 op->destroy (); 816 op->destroy ();
810 }
811 else if (head->map != op->map) 817 else if (head->map != op->map)
812 { 818 {
813 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); 819 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
814 head->destroy (); 820 head->destroy ();
815 } 821 }
930 op->destroy (); 936 op->destroy ();
931 } 937 }
932} 938}
933 939
934/* 940/*
935 * Updates every button on the map (by calling update_button() for them).
936 */
937void
938maptile::update_buttons ()
939{
940 for (oblinkpt *obp = buttons; obp; obp = obp->next)
941 for (objectlink *ol = obp->link; ol; ol = ol->next)
942 {
943 if (!ol->ob)
944 {
945 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
946 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
947 continue;
948 }
949
950 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
951 {
952 update_button (ol->ob);
953 break;
954 }
955 }
956}
957
958/*
959 * This routine is supposed to find out the difficulty of the map. 941 * This routine is supposed to find out the difficulty of the map.
960 * difficulty does not have a lot to do with character level, 942 * difficulty does not have a lot to do with character level,
961 * but does have a lot to do with treasure on the map. 943 * but does have a lot to do with treasure on the map.
962 * 944 *
963 * Difficulty can now be set by the map creature. If the value stored 945 * Difficulty can now be set by the map creator. If the value stored
964 * in the map is zero, then use this routine. Maps should really 946 * in the map is zero, then use this routine. Maps should really
965 * have a difficulty set than using this function - human calculation 947 * have a difficulty set rather than using this function - human calculation
966 * is much better than this functions guesswork. 948 * is much better than this function's guesswork.
967 */ 949 */
968int 950int
969maptile::estimate_difficulty () const 951maptile::estimate_difficulty () const
970{ 952{
971 long monster_cnt = 0; 953 long monster_cnt = 0;
1016 * postive values make it darker, negative make it brighter 998 * postive values make it darker, negative make it brighter
1017 */ 999 */
1018int 1000int
1019maptile::change_map_light (int change) 1001maptile::change_map_light (int change)
1020{ 1002{
1021 int new_level = darkness + change;
1022
1023 /* Nothing to do */ 1003 /* Nothing to do */
1024 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1004 if (!change)
1025 return 0; 1005 return 0;
1026 1006
1027 /* inform all players on the map */ 1007 /* inform all players on the map */
1028 if (change > 0) 1008 if (change > 0)
1029 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1009 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1030 else 1010 else
1031 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1011 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1032 1012
1033 /* Do extra checking. since darkness is a unsigned value, 1013 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1034 * we need to be extra careful about negative values.
1035 * In general, the checks below are only needed if change
1036 * is not +/-1
1037 */
1038 if (new_level < 0)
1039 darkness = 0;
1040 else if (new_level >= MAX_DARKNESS)
1041 darkness = MAX_DARKNESS;
1042 else
1043 darkness = new_level;
1044 1014
1045 /* All clients need to get re-updated for the change */ 1015 /* All clients need to get re-updated for the change */
1046 update_all_map_los (this); 1016 update_all_map_los (this);
1047 1017
1048 return 1; 1018 return 1;
1056 */ 1026 */
1057void 1027void
1058mapspace::update_ () 1028mapspace::update_ ()
1059{ 1029{
1060 object *last = 0; 1030 object *last = 0;
1061 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1031 uint8 flags = P_UPTODATE, anywhere = 0;
1032 sint8 light = 0;
1062 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1033 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1063 1034
1064 //object *middle = 0; 1035 //object *middle = 0;
1065 //object *top = 0; 1036 //object *top = 0;
1066 //object *floor = 0; 1037 //object *floor = 0;
1069 object *&middle = faces_obj[1] = 0; 1040 object *&middle = faces_obj[1] = 0;
1070 object *&floor = faces_obj[2] = 0; 1041 object *&floor = faces_obj[2] = 0;
1071 1042
1072 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) 1043 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073 { 1044 {
1074 /* This could be made additive I guess (two lights better than 1045 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1075 * one). But if so, it shouldn't be a simple additive - 2
1076 * light bulbs do not illuminate twice as far as once since
1077 * it is a dissapation factor that is cubed.
1078 */
1079 light = max (light, tmp->glow_radius); 1046 light += tmp->glow_radius;
1080 1047
1081 /* This call is needed in order to update objects the player 1048 /* This call is needed in order to update objects the player
1082 * is standing in that have animations (ie, grass, fire, etc). 1049 * is standing in that have animations (ie, grass, fire, etc).
1083 * However, it also causes the look window to be re-drawn 1050 * However, it also causes the look window to be re-drawn
1084 * 3 times each time the player moves, because many of the 1051 * 3 times each time the player moves, because many of the
1103 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1070 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1104 { 1071 {
1105 middle = tmp; 1072 middle = tmp;
1106 anywhere = 1; 1073 anywhere = 1;
1107 } 1074 }
1075
1108 /* Find the highest visible face around. If equal 1076 /* Find the highest visible face around. If equal
1109 * visibilities, we still want the one nearer to the 1077 * visibilities, we still want the one nearer to the
1110 * top 1078 * top
1111 */ 1079 */
1112 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1080 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1131 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1099 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1132 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1100 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1133 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1101 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1134 } 1102 }
1135 1103
1136 this->light = light; 1104 this->light = min (light, MAX_LIGHT_RADIUS);
1137 this->flags_ = flags; 1105 this->flags_ = flags;
1138 this->move_block = move_block & ~move_allow; 1106 this->move_block = move_block & ~move_allow;
1139 this->move_on = move_on; 1107 this->move_on = move_on;
1140 this->move_off = move_off; 1108 this->move_off = move_off;
1141 this->move_slow = move_slow; 1109 this->move_slow = move_slow;
1223 vol += op->volume (); 1191 vol += op->volume ();
1224 1192
1225 return vol; 1193 return vol;
1226} 1194}
1227 1195
1228bool 1196maptile *
1229maptile::tile_available (int dir, bool load) 1197maptile::tile_available (int dir, bool load)
1230{ 1198{
1231 if (!tile_path[dir]) 1199 if (tile_path[dir])
1232 return 0; 1200 {
1233
1234 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1201 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1235 return 1; 1202 return tile_map[dir];
1236 1203
1237 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1204 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1238 return 1; 1205 return tile_map[dir];
1206 }
1239 1207
1240 return 0; 1208 return 0;
1241} 1209}
1242 1210
1243/* this returns TRUE if the coordinates (x,y) are out of 1211/* this returns TRUE if the coordinates (x,y) are out of
1549 else 1517 else
1550 { 1518 {
1551 retval->distance_x += op2->x - x; 1519 retval->distance_x += op2->x - x;
1552 retval->distance_y += op2->y - y; 1520 retval->distance_y += op2->y - y;
1553 1521
1554 retval->part = NULL; 1522 retval->part = 0;
1555 retval->distance = idistance (retval->distance_x, retval->distance_y); 1523 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1556 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1524 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1557 } 1525 }
1558} 1526}
1559 1527
1560/* Returns true of op1 and op2 are effectively on the same map 1528/* Returns true of op1 and op2 are effectively on the same map
1622maptile::play_sound (faceidx sound, int x, int y) const 1590maptile::play_sound (faceidx sound, int x, int y) const
1623{ 1591{
1624 if (!sound) 1592 if (!sound)
1625 return; 1593 return;
1626 1594
1595 for_all_players_on_map (pl, this)
1596 if (client *ns = pl->ns)
1597 {
1598 int dx = x - pl->ob->x;
1599 int dy = y - pl->ob->y;
1600
1601 int distance = idistance (dx, dy);
1602
1603 if (distance <= MAX_SOUND_DISTANCE)
1604 ns->play_sound (sound, dx, dy);
1605 }
1606}
1607
1608void
1609maptile::say_msg (const char *msg, int x, int y) const
1610{
1627 for_all_players (pl) 1611 for_all_players (pl)
1628 if (pl->ob->map == this)
1629 if (client *ns = pl->ns) 1612 if (client *ns = pl->ns)
1630 { 1613 {
1631 int dx = x - pl->ob->x; 1614 int dx = x - pl->ob->x;
1632 int dy = y - pl->ob->y; 1615 int dy = y - pl->ob->y;
1633 1616
1634 int distance = idistance (dx, dy); 1617 int distance = idistance (dx, dy);
1635 1618
1636 if (distance <= MAX_SOUND_DISTANCE) 1619 if (distance <= MAX_SOUND_DISTANCE)
1637 ns->play_sound (sound, dx, dy); 1620 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1638 } 1621 }
1639} 1622}
1640 1623
1624static void
1625split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1626{
1627 // clip to map to the left
1628 if (x0 < 0)
1629 {
1630 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1631 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1632
1633 if (x1 < 0) // entirely to the left
1634 return;
1635
1636 x0 = 0;
1637 }
1638
1639 // clip to map to the right
1640 if (x1 > m->width)
1641 {
1642 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1643 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1644
1645 if (x0 > m->width) // entirely to the right
1646 return;
1647
1648 x1 = m->width;
1649 }
1650
1651 // clip to map above
1652 if (y0 < 0)
1653 {
1654 if (maptile *tile = m->tile_available (TILE_UP, 1))
1655 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1656
1657 if (y1 < 0) // entirely above
1658 return;
1659
1660 y0 = 0;
1661 }
1662
1663 // clip to map below
1664 if (y1 > m->height)
1665 {
1666 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1667 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1668
1669 if (y0 > m->height) // entirely below
1670 return;
1671
1672 y1 = m->height;
1673 }
1674
1675 // if we get here, the rect is within the current map
1676 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1677
1678 r->m = m;
1679 r->x0 = x0;
1680 r->y0 = y0;
1681 r->x1 = x1;
1682 r->y1 = y1;
1683 r->dx = dx;
1684 r->dy = dy;
1685}
1686
1687maprect *
1688maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1689{
1690 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1691 buf.clear ();
1692
1693 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1694
1695 // add end marker
1696 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1697 r->m = 0;
1698
1699 return (maprect *)buf.linearise ();
1700}
1701

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines