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,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * 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 Affero GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * 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> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <unistd.h> |
25 | #include <unistd.h> |
26 | |
26 | |
… | |
… | |
59 | return mp->at (newx, newy).flags () | (mp != oldmap ? P_NEW_MAP : 0); |
59 | return mp->at (newx, newy).flags () | (mp != oldmap ? P_NEW_MAP : 0); |
60 | } |
60 | } |
61 | |
61 | |
62 | /* |
62 | /* |
63 | * Returns true if the given coordinate is blocked except by the |
63 | * Returns true if the given coordinate is blocked except by the |
64 | * object passed is not blocking. This is used with |
64 | * object passed is not blocking. This is used with |
65 | * multipart monsters - if we want to see if a 2x2 monster |
65 | * multipart monsters - if we want to see if a 2x2 monster |
66 | * can move 1 space to the left, we don't want its own area |
66 | * can move 1 space to the left, we don't want its own area |
67 | * to block it from moving there. |
67 | * to block it from moving there. |
68 | * Returns TRUE if the space is blocked by something other than the |
68 | * Returns TRUE if the space is blocked by something other than the |
69 | * monster. |
69 | * monster. |
… | |
… | |
369 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
369 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (object *op = ms->bot; op; op = op->above) |
370 | for (object *op = ms->bot; op; op = op->above) |
371 | op->activate_recursive (); |
371 | op->activate_recursive (); |
372 | |
372 | |
373 | state = MAP_ACTIVE; |
373 | state = MAP_ACTIVE; |
|
|
374 | |
|
|
375 | activate_physics (); |
374 | } |
376 | } |
375 | |
377 | |
376 | void |
378 | void |
377 | maptile::deactivate () |
379 | maptile::deactivate () |
378 | { |
380 | { |
… | |
… | |
481 | spaces = salloc0<mapspace> (size ()); |
483 | spaces = salloc0<mapspace> (size ()); |
482 | } |
484 | } |
483 | |
485 | |
484 | //+GPL |
486 | //+GPL |
485 | |
487 | |
486 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
488 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
487 | * corresponding to that string. Memory is allocated for this, it must be freed |
489 | * corresponding to that string. Memory is allocated for this, it must be freed |
488 | * at a later date. |
490 | * at a later date. |
489 | * Called by parse_map_headers below. |
491 | * Called by parse_map_headers below. |
490 | */ |
492 | */ |
491 | static shopitems * |
493 | static shopitems * |
492 | parse_shop_string (const char *input_string) |
494 | parse_shop_string (const char *input_string) |
… | |
… | |
541 | *q = '\0'; |
543 | *q = '\0'; |
542 | |
544 | |
543 | current_type = get_typedata_by_name (p); |
545 | current_type = get_typedata_by_name (p); |
544 | if (current_type) |
546 | if (current_type) |
545 | { |
547 | { |
546 | items[i].name = current_type->name; |
548 | items[i].name = current_type->name; |
547 | items[i].typenum = current_type->number; |
549 | items[i].typenum = current_type->number; |
548 | items[i].name_pl = current_type->name_pl; |
550 | items[i].name_pl = current_type->name_pl; |
549 | } |
551 | } |
550 | else |
552 | else |
551 | { /* oh uh, something's wrong, let's free up this one, and try |
553 | { /* oh uh, something's wrong, let's free up this one, and try |
552 | * the next entry while we're at it, better print a warning |
554 | * the next entry while we're at it, better print a warning |
553 | */ |
555 | */ |
554 | LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string); |
556 | LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string); |
555 | } |
557 | } |
556 | } |
558 | } |
557 | |
559 | |
… | |
… | |
669 | case KW_value: case KW_swap_time: thawer.get (timeout); break; |
671 | case KW_value: case KW_swap_time: thawer.get (timeout); break; |
670 | case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break; |
672 | case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break; |
671 | case KW_invisible: case KW_darkness: thawer.get (darkness); break; |
673 | case KW_invisible: case KW_darkness: thawer.get (darkness); break; |
672 | case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break; |
674 | case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break; |
673 | |
675 | |
674 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
676 | case KW_tile_path_1: thawer.get (tile_path [TILE_NORTH]); break; |
675 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
677 | case KW_tile_path_2: thawer.get (tile_path [TILE_EAST ]); break; |
676 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
678 | case KW_tile_path_3: thawer.get (tile_path [TILE_SOUTH]); break; |
677 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
679 | case KW_tile_path_4: thawer.get (tile_path [TILE_WEST ]); break; |
678 | case KW_tile_path_5: thawer.get (tile_path [4]); break; |
680 | case KW_tile_path_5: thawer.get (tile_path [TILE_UP ]); break; |
679 | case KW_tile_path_6: thawer.get (tile_path [5]); break; |
681 | case KW_tile_path_6: thawer.get (tile_path [TILE_DOWN ]); break; |
680 | |
682 | |
681 | case KW_ERROR: |
683 | case KW_ERROR: |
682 | set_key_text (thawer.kw_str, thawer.value); |
684 | set_key_text (thawer.kw_str, thawer.value); |
683 | break; |
685 | break; |
684 | |
686 | |
… | |
… | |
763 | if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); |
765 | if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); |
764 | |
766 | |
765 | MAP_OUT (per_player); |
767 | MAP_OUT (per_player); |
766 | MAP_OUT (per_party); |
768 | MAP_OUT (per_party); |
767 | |
769 | |
768 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
770 | if (tile_path [TILE_NORTH]) MAP_OUT2 (tile_path_1, tile_path [TILE_NORTH]); |
769 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
771 | if (tile_path [TILE_EAST ]) MAP_OUT2 (tile_path_2, tile_path [TILE_EAST ]); |
770 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
772 | if (tile_path [TILE_SOUTH]) MAP_OUT2 (tile_path_3, tile_path [TILE_SOUTH]); |
771 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
773 | if (tile_path [TILE_WEST ]) MAP_OUT2 (tile_path_4, tile_path [TILE_WEST ]); |
772 | if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]); |
774 | if (tile_path [TILE_UP ]) MAP_OUT2 (tile_path_5, tile_path [TILE_UP ]); |
773 | if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]); |
775 | if (tile_path [TILE_DOWN ]) MAP_OUT2 (tile_path_6, tile_path [TILE_DOWN ]); |
774 | |
776 | |
775 | freezer.put (this); |
777 | freezer.put (this); |
776 | freezer.put (KW(end)); |
778 | freezer.put (KW(end)); |
777 | |
779 | |
778 | return true; |
780 | return true; |
… | |
… | |
835 | msg = 0; |
837 | msg = 0; |
836 | maplore = 0; |
838 | maplore = 0; |
837 | shoprace = 0; |
839 | shoprace = 0; |
838 | delete [] shopitems, shopitems = 0; |
840 | delete [] shopitems, shopitems = 0; |
839 | |
841 | |
840 | for (int i = 0; i < TILE_NUM; i++) |
842 | for (int i = 0; i < array_length (tile_path); i++) |
841 | tile_path [i] = 0; |
843 | tile_path [i] = 0; |
842 | } |
844 | } |
843 | |
845 | |
844 | maptile::~maptile () |
846 | maptile::~maptile () |
845 | { |
847 | { |
… | |
… | |
852 | /* We need to look through all the maps and see if any maps |
854 | /* We need to look through all the maps and see if any maps |
853 | * are pointing at this one for tiling information. Since |
855 | * are pointing at this one for tiling information. Since |
854 | * tiling can be asymetric, we just can not look to see which |
856 | * tiling can be asymetric, we just can not look to see which |
855 | * maps this map tiles with and clears those. |
857 | * maps this map tiles with and clears those. |
856 | */ |
858 | */ |
857 | for (int i = 0; i < TILE_NUM; i++) |
859 | for (int i = 0; i < array_length (tile_path); i++) |
858 | if (tile_map[i] == m) |
860 | if (tile_map[i] == m) |
859 | tile_map[i] = 0; |
861 | tile_map[i] = 0; |
860 | } |
862 | } |
861 | |
863 | |
862 | void |
864 | void |
… | |
… | |
1015 | update_all_map_los (this); |
1017 | update_all_map_los (this); |
1016 | |
1018 | |
1017 | return 1; |
1019 | return 1; |
1018 | } |
1020 | } |
1019 | |
1021 | |
1020 | /* |
1022 | /* |
1021 | * This function updates various attributes about a specific space |
1023 | * This function updates various attributes about a specific space |
1022 | * on the map (what it looks like, whether it blocks magic, |
1024 | * on the map (what it looks like, whether it blocks magic, |
1023 | * has a living creatures, prevents people from passing |
1025 | * has a living creatures, prevents people from passing |
1024 | * through, etc) |
1026 | * through, etc) |
1025 | */ |
1027 | */ |
… | |
… | |
1129 | this->items_ = upos_min (items, 65535); // assume nrof <= 2**31 |
1131 | this->items_ = upos_min (items, 65535); // assume nrof <= 2**31 |
1130 | |
1132 | |
1131 | /* At this point, we have a floor face (if there is a floor), |
1133 | /* At this point, we have a floor face (if there is a floor), |
1132 | * and the floor is set - we are not going to touch it at |
1134 | * and the floor is set - we are not going to touch it at |
1133 | * this point. |
1135 | * this point. |
1134 | * middle contains the highest visibility face. |
1136 | * middle contains the highest visibility face. |
1135 | * top contains a player/monster face, if there is one. |
1137 | * top contains a player/monster face, if there is one. |
1136 | * |
1138 | * |
1137 | * We now need to fill in top.face and/or middle.face. |
1139 | * We now need to fill in top.face and/or middle.face. |
1138 | */ |
1140 | */ |
1139 | |
1141 | |
1140 | /* If the top face also happens to be high visibility, re-do our |
1142 | /* If the top face also happens to be high visibility, re-do our |
1141 | * middle face. This should not happen, as we already have the |
1143 | * middle face. This should not happen, as we already have the |
1142 | * else statement above so middle should not get set. OTOH, it |
1144 | * else statement above so middle should not get set. OTOH, it |
1143 | * may be possible for the faces to match but be different objects. |
1145 | * may be possible for the faces to match but be different objects. |
1144 | */ |
1146 | */ |
1145 | if (top == middle) |
1147 | if (top == middle) |
1146 | middle = 0; |
1148 | middle = 0; |
1147 | |
1149 | |
… | |
… | |
1176 | /* top is already set - we should only get here if |
1178 | /* top is already set - we should only get here if |
1177 | * middle is not set |
1179 | * middle is not set |
1178 | * |
1180 | * |
1179 | * Set the middle face and break out, since there is nothing |
1181 | * Set the middle face and break out, since there is nothing |
1180 | * more to fill in. We don't check visiblity here, since |
1182 | * more to fill in. We don't check visiblity here, since |
1181 | * |
1183 | * |
1182 | */ |
1184 | */ |
1183 | if (tmp != top) |
1185 | if (tmp != top) |
1184 | { |
1186 | { |
1185 | middle = tmp; |
1187 | middle = tmp; |
1186 | break; |
1188 | break; |
… | |
… | |
1193 | middle = 0; |
1195 | middle = 0; |
1194 | |
1196 | |
1195 | if (top == middle) |
1197 | if (top == middle) |
1196 | middle = 0; |
1198 | middle = 0; |
1197 | |
1199 | |
|
|
1200 | // set lower map transparent floor flag if applicable |
|
|
1201 | if (floor && floor->flag [FLAG_IS_TRANSPARENT_FLOOR] && !middle && !top) |
|
|
1202 | { |
|
|
1203 | floor->set_anim_frame (0); |
|
|
1204 | |
|
|
1205 | if (maptile *m = floor->map->tile_map [TILE_DOWN]) |
|
|
1206 | { |
|
|
1207 | mapspace &ms = m->at (floor->x, floor->y); |
|
|
1208 | ms.update (); |
|
|
1209 | |
|
|
1210 | if (object *floor2 = ms.faces_obj [2]) |
|
|
1211 | if (!floor2->flag [FLAG_IS_TRANSPARENT_FLOOR]) |
|
|
1212 | { |
|
|
1213 | floor->set_anim_frame (1); |
|
|
1214 | top = floor; |
|
|
1215 | middle = ms.faces_obj [0]; |
|
|
1216 | floor = floor2; |
|
|
1217 | } |
|
|
1218 | |
|
|
1219 | ms.pflags |= PF_VIS_UP; |
|
|
1220 | } |
|
|
1221 | } |
|
|
1222 | |
1198 | #if 0 |
1223 | #if 0 |
1199 | faces_obj [0] = top; |
1224 | faces_obj [0] = top; |
1200 | faces_obj [1] = middle; |
1225 | faces_obj [1] = middle; |
1201 | faces_obj [2] = floor; |
1226 | faces_obj [2] = floor; |
1202 | #endif |
1227 | #endif |
1203 | } |
1228 | } |
1204 | |
1229 | |
|
|
1230 | void |
|
|
1231 | mapspace::update_up () |
|
|
1232 | { |
|
|
1233 | // invalidate up |
|
|
1234 | if (!(pflags & PF_VIS_UP)) |
|
|
1235 | return; |
|
|
1236 | |
|
|
1237 | pflags &= ~PF_VIS_UP; |
|
|
1238 | |
|
|
1239 | if (bot) |
|
|
1240 | if (maptile *m = bot->map->tile_map [TILE_UP]) |
|
|
1241 | m->at (bot->x, bot->y).invalidate (); |
|
|
1242 | } |
|
|
1243 | |
1205 | maptile * |
1244 | maptile * |
1206 | maptile::tile_available (int dir, bool load) |
1245 | maptile::tile_available (int dir, bool load) |
1207 | { |
1246 | { |
1208 | if (tile_path[dir]) |
|
|
1209 | { |
|
|
1210 | // map is there and we don't need to load it OR it's loaded => return what we have |
1247 | // map is there and we don't need to load it OR it's loaded => return what we have |
1211 | if (tile_map[dir] && (!load || tile_map[dir]->linkable ())) |
1248 | if (tile_map [dir] && (!load || tile_map [dir]->linkable ())) |
1212 | return tile_map[dir]; |
1249 | return tile_map [dir]; |
1213 | |
1250 | |
|
|
1251 | if (tile_path [dir]) |
|
|
1252 | { |
1214 | // well, try to locate it then, if possible - maybe it's there already |
1253 | // well, try to locate it then, if possible - maybe it's there already |
|
|
1254 | // this is the ONLY place in the server that links maps with each other, |
|
|
1255 | // so any kind of inter-map stuff has to be initiated here. |
1215 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1256 | if (maptile *m = find_async (tile_path [dir], this, load)) |
|
|
1257 | { |
|
|
1258 | bool mismatch = false; |
|
|
1259 | |
|
|
1260 | if (dir == TILE_NORTH || dir == TILE_SOUTH || dir == TILE_UP || dir == TILE_DOWN) |
|
|
1261 | if (width != m->width) |
|
|
1262 | mismatch = true; |
|
|
1263 | |
|
|
1264 | if (dir == TILE_EAST || dir == TILE_WEST || dir == TILE_UP || dir == TILE_DOWN) |
|
|
1265 | if (height != m->height) |
|
|
1266 | mismatch = true; |
|
|
1267 | |
|
|
1268 | if (mismatch) |
|
|
1269 | { |
|
|
1270 | LOG (llevError, "tile dimension mismatch for direction %d from %s to %s\n", |
|
|
1271 | dir, &path, &m->path); |
|
|
1272 | m = 0; |
|
|
1273 | } |
|
|
1274 | else if (0)//D |
|
|
1275 | { |
|
|
1276 | // as an optimisation, link us against the other map if the other map |
|
|
1277 | // has us as neighbour, which is very common, but not guaranteed. |
|
|
1278 | int dir2 = REVERSE_TILE_DIR (dir); |
|
|
1279 | |
|
|
1280 | if (m->tile_path [dir2] == path) |
|
|
1281 | m->tile_map [dir2] = this; |
|
|
1282 | } |
|
|
1283 | |
|
|
1284 | |
1216 | return tile_map[dir]; |
1285 | return tile_map [dir] = m; |
|
|
1286 | } |
1217 | } |
1287 | } |
1218 | |
1288 | |
1219 | return 0; |
1289 | return 0; |
1220 | } |
1290 | } |
1221 | |
1291 | |
1222 | /* this returns TRUE if the coordinates (x,y) are out of |
1292 | /* this returns TRUE if the coordinates (x,y) are out of |
1223 | * map m. This function also takes into account any |
1293 | * map m. This function also takes into account any |
1224 | * tiling considerations, loading adjacant maps as needed. |
1294 | * tiling considerations, loading adjacant maps as needed. |
1225 | * This is the function should always be used when it |
1295 | * This is the function should always be used when it |
1226 | * necessary to check for valid coordinates. |
1296 | * necessary to check for valid coordinates. |
1227 | * This function will recursively call itself for the |
1297 | * This function will recursively call itself for the |
1228 | * tiled maps. |
1298 | * tiled maps. |
1229 | */ |
1299 | */ |
1230 | int |
1300 | int |
1231 | out_of_map (maptile *m, int x, int y) |
1301 | out_of_map (maptile *m, int x, int y) |
1232 | { |
1302 | { |
… | |
… | |
1237 | if (!m) |
1307 | if (!m) |
1238 | return 0; |
1308 | return 0; |
1239 | |
1309 | |
1240 | if (x < 0) |
1310 | if (x < 0) |
1241 | { |
1311 | { |
1242 | if (!m->tile_available (3)) |
1312 | if (!m->tile_available (TILE_WEST)) |
1243 | return 1; |
1313 | return 1; |
1244 | |
1314 | |
1245 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1315 | return out_of_map (m->tile_map [TILE_WEST], x + m->tile_map [TILE_WEST]->width, y); |
1246 | } |
1316 | } |
1247 | |
1317 | |
1248 | if (x >= m->width) |
1318 | if (x >= m->width) |
1249 | { |
1319 | { |
1250 | if (!m->tile_available (1)) |
1320 | if (!m->tile_available (TILE_EAST)) |
1251 | return 1; |
1321 | return 1; |
1252 | |
1322 | |
1253 | return out_of_map (m->tile_map[1], x - m->width, y); |
1323 | return out_of_map (m->tile_map [TILE_EAST], x - m->width, y); |
1254 | } |
1324 | } |
1255 | |
1325 | |
1256 | if (y < 0) |
1326 | if (y < 0) |
1257 | { |
1327 | { |
1258 | if (!m->tile_available (0)) |
1328 | if (!m->tile_available (TILE_NORTH)) |
1259 | return 1; |
1329 | return 1; |
1260 | |
1330 | |
1261 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1331 | return out_of_map (m->tile_map [TILE_NORTH], x, y + m->tile_map [TILE_NORTH]->height); |
1262 | } |
1332 | } |
1263 | |
1333 | |
1264 | if (y >= m->height) |
1334 | if (y >= m->height) |
1265 | { |
1335 | { |
1266 | if (!m->tile_available (2)) |
1336 | if (!m->tile_available (TILE_SOUTH)) |
1267 | return 1; |
1337 | return 1; |
1268 | |
1338 | |
1269 | return out_of_map (m->tile_map[2], x, y - m->height); |
1339 | return out_of_map (m->tile_map [TILE_SOUTH], x, y - m->height); |
1270 | } |
1340 | } |
1271 | |
1341 | |
1272 | /* Simple case - coordinates are within this local |
1342 | /* Simple case - coordinates are within this local |
1273 | * map. |
1343 | * map. |
1274 | */ |
1344 | */ |
… | |
… | |
1276 | } |
1346 | } |
1277 | |
1347 | |
1278 | /* This is basically the same as out_of_map above, but |
1348 | /* This is basically the same as out_of_map above, but |
1279 | * instead we return NULL if no map is valid (coordinates |
1349 | * instead we return NULL if no map is valid (coordinates |
1280 | * out of bounds and no tiled map), otherwise it returns |
1350 | * out of bounds and no tiled map), otherwise it returns |
1281 | * the map as that the coordinates are really on, and |
1351 | * the map as that the coordinates are really on, and |
1282 | * updates x and y to be the localised coordinates. |
1352 | * updates x and y to be the localised coordinates. |
1283 | * Using this is more efficient of calling out_of_map |
1353 | * Using this is more efficient of calling out_of_map |
1284 | * and then figuring out what the real map is |
1354 | * and then figuring out what the real map is |
1285 | */ |
1355 | */ |
1286 | maptile * |
1356 | maptile * |
1287 | maptile::xy_find (sint16 &x, sint16 &y) |
1357 | maptile::xy_find (sint16 &x, sint16 &y) |
1288 | { |
1358 | { |
1289 | if (x < 0) |
1359 | if (x < 0) |
1290 | { |
1360 | { |
1291 | if (!tile_available (3)) |
1361 | if (!tile_available (TILE_WEST)) |
1292 | return 0; |
1362 | return 0; |
1293 | |
1363 | |
1294 | x += tile_map[3]->width; |
1364 | x += tile_map [TILE_WEST]->width; |
1295 | return tile_map[3]->xy_find (x, y); |
1365 | return tile_map [TILE_WEST]->xy_find (x, y); |
1296 | } |
1366 | } |
1297 | |
1367 | |
1298 | if (x >= width) |
1368 | if (x >= width) |
1299 | { |
1369 | { |
1300 | if (!tile_available (1)) |
1370 | if (!tile_available (TILE_EAST)) |
1301 | return 0; |
1371 | return 0; |
1302 | |
1372 | |
1303 | x -= width; |
1373 | x -= width; |
1304 | return tile_map[1]->xy_find (x, y); |
1374 | return tile_map [TILE_EAST]->xy_find (x, y); |
1305 | } |
1375 | } |
1306 | |
1376 | |
1307 | if (y < 0) |
1377 | if (y < 0) |
1308 | { |
1378 | { |
1309 | if (!tile_available (0)) |
1379 | if (!tile_available (TILE_NORTH)) |
1310 | return 0; |
1380 | return 0; |
1311 | |
1381 | |
1312 | y += tile_map[0]->height; |
1382 | y += tile_map [TILE_NORTH]->height; |
1313 | return tile_map[0]->xy_find (x, y); |
1383 | return tile_map [TILE_NORTH]->xy_find (x, y); |
1314 | } |
1384 | } |
1315 | |
1385 | |
1316 | if (y >= height) |
1386 | if (y >= height) |
1317 | { |
1387 | { |
1318 | if (!tile_available (2)) |
1388 | if (!tile_available (TILE_SOUTH)) |
1319 | return 0; |
1389 | return 0; |
1320 | |
1390 | |
1321 | y -= height; |
1391 | y -= height; |
1322 | return tile_map[2]->xy_find (x, y); |
1392 | return tile_map [TILE_SOUTH]->xy_find (x, y); |
1323 | } |
1393 | } |
1324 | |
1394 | |
1325 | /* Simple case - coordinates are within this local |
1395 | /* Simple case - coordinates are within this local |
1326 | * map. |
1396 | * map. |
1327 | */ |
1397 | */ |
… | |
… | |
1434 | * so you just can not look the the map coordinates and get the |
1504 | * so you just can not look the the map coordinates and get the |
1435 | * righte value. distance_x/y are distance away, which |
1505 | * righte value. distance_x/y are distance away, which |
1436 | * can be negative. direction is the crossfire direction scheme |
1506 | * can be negative. direction is the crossfire direction scheme |
1437 | * that the creature should head. part is the part of the |
1507 | * that the creature should head. part is the part of the |
1438 | * monster that is closest. |
1508 | * monster that is closest. |
1439 | * |
1509 | * |
1440 | * get_rangevector looks at op1 and op2, and fills in the |
1510 | * get_rangevector looks at op1 and op2, and fills in the |
1441 | * structure for op1 to get to op2. |
1511 | * structure for op1 to get to op2. |
1442 | * We already trust that the caller has verified that the |
1512 | * We already trust that the caller has verified that the |
1443 | * two objects are at least on adjacent maps. If not, |
1513 | * two objects are at least on adjacent maps. If not, |
1444 | * results are not likely to be what is desired. |
1514 | * results are not likely to be what is desired. |
… | |
… | |
1500 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1570 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1501 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1571 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1502 | } |
1572 | } |
1503 | } |
1573 | } |
1504 | |
1574 | |
1505 | /* this is basically the same as get_rangevector above, but instead of |
1575 | /* this is basically the same as get_rangevector above, but instead of |
1506 | * the first parameter being an object, it instead is the map |
1576 | * the first parameter being an object, it instead is the map |
1507 | * and x,y coordinates - this is used for path to player - |
1577 | * and x,y coordinates - this is used for path to player - |
1508 | * since the object is not infact moving but we are trying to traverse |
1578 | * since the object is not infact moving but we are trying to traverse |
1509 | * the path, we need this. |
1579 | * the path, we need this. |
1510 | * flags has no meaning for this function at this time - I kept it in to |
1580 | * flags has no meaning for this function at this time - I kept it in to |
1511 | * be more consistant with the above function and also in case they are needed |
1581 | * be more consistant with the above function and also in case they are needed |
1512 | * for something in the future. Also, since no object is pasted, the best |
1582 | * for something in the future. Also, since no object is pasted, the best |
… | |
… | |
1658 | if (x1 > m->width) |
1728 | if (x1 > m->width) |
1659 | { |
1729 | { |
1660 | if (maptile *tile = m->tile_available (TILE_EAST, 1)) |
1730 | if (maptile *tile = m->tile_available (TILE_EAST, 1)) |
1661 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
1731 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
1662 | |
1732 | |
1663 | if (x0 > m->width) // entirely to the right |
1733 | if (x0 >= m->width) // entirely to the right |
1664 | return; |
1734 | return; |
1665 | |
1735 | |
1666 | x1 = m->width; |
1736 | x1 = m->width; |
1667 | } |
1737 | } |
1668 | |
1738 | |
1669 | // clip to map above |
1739 | // clip to map to the north |
1670 | if (y0 < 0) |
1740 | if (y0 < 0) |
1671 | { |
1741 | { |
1672 | if (maptile *tile = m->tile_available (TILE_NORTH, 1)) |
1742 | if (maptile *tile = m->tile_available (TILE_NORTH, 1)) |
1673 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
1743 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
1674 | |
1744 | |
1675 | if (y1 < 0) // entirely above |
1745 | if (y1 < 0) // entirely to the north |
1676 | return; |
1746 | return; |
1677 | |
1747 | |
1678 | y0 = 0; |
1748 | y0 = 0; |
1679 | } |
1749 | } |
1680 | |
1750 | |
1681 | // clip to map below |
1751 | // clip to map to the south |
1682 | if (y1 > m->height) |
1752 | if (y1 > m->height) |
1683 | { |
1753 | { |
1684 | if (maptile *tile = m->tile_available (TILE_SOUTH, 1)) |
1754 | if (maptile *tile = m->tile_available (TILE_SOUTH, 1)) |
1685 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
1755 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
1686 | |
1756 | |
1687 | if (y0 > m->height) // entirely below |
1757 | if (y0 >= m->height) // entirely to the south |
1688 | return; |
1758 | return; |
1689 | |
1759 | |
1690 | y1 = m->height; |
1760 | y1 = m->height; |
1691 | } |
1761 | } |
1692 | |
1762 | |