1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | #include <unistd.h> |
24 | #include <unistd.h> |
26 | |
25 | |
27 | #include "global.h" |
26 | #include "global.h" |
28 | #include "funcpoint.h" |
27 | #include "funcpoint.h" |
29 | |
28 | |
30 | #include "loader.h" |
29 | #include "loader.h" |
31 | |
30 | |
32 | #include "path.h" |
31 | #include "path.h" |
33 | |
|
|
34 | /* |
|
|
35 | * This makes a path absolute outside the world of Crossfire. |
|
|
36 | * In other words, it prepends LIBDIR/MAPDIR/ to the given path |
|
|
37 | * and returns the pointer to a static array containing the result. |
|
|
38 | * it really should be called create_mapname |
|
|
39 | */ |
|
|
40 | const char * |
|
|
41 | create_pathname (const char *name) |
|
|
42 | { |
|
|
43 | static char buf[8192]; |
|
|
44 | snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name); |
|
|
45 | return buf; |
|
|
46 | } |
|
|
47 | |
|
|
48 | /* |
|
|
49 | * This function checks if a file with the given path exists. |
|
|
50 | * -1 is returned if it fails, otherwise the mode of the file |
|
|
51 | * is returned. |
|
|
52 | * It tries out all the compression suffixes listed in the uncomp[] array. |
|
|
53 | * |
|
|
54 | * If prepend_dir is set, then we call create_pathname (which prepends |
|
|
55 | * libdir & mapdir). Otherwise, we assume the name given is fully |
|
|
56 | * complete. |
|
|
57 | * Only the editor actually cares about the writablity of this - |
|
|
58 | * the rest of the code only cares that the file is readable. |
|
|
59 | * when the editor goes away, the call to stat should probably be |
|
|
60 | * replaced by an access instead (similar to the windows one, but |
|
|
61 | * that seems to be missing the prepend_dir processing |
|
|
62 | */ |
|
|
63 | int |
|
|
64 | check_path (const char *name, int prepend_dir) |
|
|
65 | { |
|
|
66 | char buf[MAX_BUF]; |
|
|
67 | |
|
|
68 | char *endbuf; |
|
|
69 | struct stat statbuf; |
|
|
70 | int mode = 0; |
|
|
71 | |
|
|
72 | if (prepend_dir) |
|
|
73 | assign (buf, create_pathname (name)); |
|
|
74 | else |
|
|
75 | assign (buf, name); |
|
|
76 | |
|
|
77 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
|
|
78 | * this method should be equivalant and is clearer. |
|
|
79 | * Can not use strcat because we need to cycle through |
|
|
80 | * all the names. |
|
|
81 | */ |
|
|
82 | endbuf = buf + strlen (buf); |
|
|
83 | |
|
|
84 | if (stat (buf, &statbuf)) |
|
|
85 | return -1; |
|
|
86 | if (!S_ISREG (statbuf.st_mode)) |
|
|
87 | return (-1); |
|
|
88 | |
|
|
89 | if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) || |
|
|
90 | ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH)) |
|
|
91 | mode |= 4; |
|
|
92 | |
|
|
93 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
|
|
94 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
|
|
95 | mode |= 2; |
|
|
96 | |
|
|
97 | return (mode); |
|
|
98 | } |
|
|
99 | |
32 | |
100 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
101 | * one function that just returns a P_.. value (see map.h) |
34 | * one function that just returns a P_.. value (see map.h) |
102 | * it will also do map translation for tiled maps, returning |
35 | * it will also do map translation for tiled maps, returning |
103 | * 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 |
… | |
… | |
276 | |
209 | |
277 | /* don't have object, so don't know what types would block */ |
210 | /* don't have object, so don't know what types would block */ |
278 | return m1->at (sx, sy).move_block; |
211 | return m1->at (sx, sy).move_block; |
279 | } |
212 | } |
280 | |
213 | |
281 | for (tmp = ob->arch; tmp; tmp = tmp->more) |
214 | for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) |
282 | { |
215 | { |
283 | flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); |
216 | flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy); |
284 | |
217 | |
285 | if (flag & P_OUT_OF_MAP) |
218 | if (flag & P_OUT_OF_MAP) |
286 | return P_OUT_OF_MAP; |
219 | return P_OUT_OF_MAP; |
287 | if (flag & P_IS_ALIVE) |
220 | if (flag & P_IS_ALIVE) |
288 | return P_IS_ALIVE; |
221 | return P_IS_ALIVE; |
… | |
… | |
356 | { |
289 | { |
357 | if (!spaces) |
290 | if (!spaces) |
358 | return; |
291 | return; |
359 | |
292 | |
360 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
293 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (object *op = ms->bot; op; op = op->above) |
294 | { |
|
|
295 | object *op = ms->bot; |
|
|
296 | while (op) |
362 | { |
297 | { |
363 | /* already multipart - don't do anything more */ |
298 | /* already multipart - don't do anything more */ |
364 | if (op->head_ () == op && !op->more && op->arch->more) |
299 | if (op->head_ () == op && !op->more && op->arch->more) |
365 | { |
300 | { |
366 | op->remove (); |
301 | op->remove (); |
367 | op->expand_tail (); |
302 | op->expand_tail (); |
|
|
303 | |
|
|
304 | // FIXME: INS_ON_TOP is just a workaround for the pentagram vs. |
|
|
305 | // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters |
|
|
306 | // below the pentagrams... hopefully INS_ON_TOP doesn't break anything |
368 | insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); |
307 | insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON); |
|
|
308 | |
|
|
309 | op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP |
|
|
310 | // so we have to reset the iteration through the mapspace |
369 | } |
311 | } |
|
|
312 | else |
|
|
313 | op = op->above; |
370 | } |
314 | } |
|
|
315 | } |
371 | } |
316 | } |
372 | |
317 | |
373 | /* |
318 | /* |
374 | * Loads (ands parses) the objects into a given map from the specified |
319 | * Loads (ands parses) the objects into a given map from the specified |
375 | * file pointer. |
320 | * file pointer. |
… | |
… | |
410 | } |
355 | } |
411 | |
356 | |
412 | void |
357 | void |
413 | maptile::activate () |
358 | maptile::activate () |
414 | { |
359 | { |
415 | active = true; |
|
|
416 | |
|
|
417 | if (spaces) |
360 | if (spaces) |
418 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
419 | for (object *op = ms->bot; op; op = op->above) |
362 | for (object *op = ms->bot; op; op = op->above) |
420 | op->activate_recursive (); |
363 | op->activate_recursive (); |
421 | } |
364 | } |
422 | |
365 | |
423 | void |
366 | void |
424 | maptile::deactivate () |
367 | maptile::deactivate () |
425 | { |
368 | { |
426 | active = false; |
|
|
427 | |
|
|
428 | if (spaces) |
369 | if (spaces) |
429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
430 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
431 | op->deactivate_recursive (); |
372 | op->deactivate_recursive (); |
432 | } |
373 | } |
… | |
… | |
714 | case KW_winddir: thawer.get (winddir); break; |
655 | case KW_winddir: thawer.get (winddir); break; |
715 | case KW_sky: thawer.get (sky); break; |
656 | case KW_sky: thawer.get (sky); break; |
716 | |
657 | |
717 | case KW_per_player: thawer.get (per_player); break; |
658 | case KW_per_player: thawer.get (per_player); break; |
718 | case KW_per_party: thawer.get (per_party); break; |
659 | case KW_per_party: thawer.get (per_party); break; |
|
|
660 | case KW_no_reset: thawer.get (no_reset); break; |
719 | |
661 | |
720 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
662 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
721 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
663 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
722 | |
664 | |
723 | // old names new names |
665 | // old names new names |
… | |
… | |
734 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
676 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
735 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
677 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
736 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
678 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
737 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
679 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
738 | |
680 | |
|
|
681 | case KW_ERROR: |
|
|
682 | set_key (thawer.kw_str, thawer.value); |
|
|
683 | break; |
|
|
684 | |
739 | case KW_end: |
685 | case KW_end: |
740 | return true; |
686 | return true; |
741 | |
687 | |
742 | default: |
688 | default: |
743 | if (!thawer.parse_error ("map", 0)) |
689 | if (!thawer.parse_error ("map", 0)) |
… | |
… | |
800 | if (name) MAP_OUT (name); |
746 | if (name) MAP_OUT (name); |
801 | MAP_OUT (swap_time); |
747 | MAP_OUT (swap_time); |
802 | MAP_OUT (reset_time); |
748 | MAP_OUT (reset_time); |
803 | MAP_OUT (reset_timeout); |
749 | MAP_OUT (reset_timeout); |
804 | MAP_OUT (fixed_resettime); |
750 | MAP_OUT (fixed_resettime); |
|
|
751 | MAP_OUT (no_reset); |
805 | MAP_OUT (difficulty); |
752 | MAP_OUT (difficulty); |
806 | |
753 | |
807 | if (default_region) MAP_OUT2 (region, default_region->name); |
754 | if (default_region) MAP_OUT2 (region, default_region->name); |
808 | |
755 | |
809 | if (shopitems) |
756 | if (shopitems) |
… | |
… | |
863 | * Remove and free all objects in the given map. |
810 | * Remove and free all objects in the given map. |
864 | */ |
811 | */ |
865 | void |
812 | void |
866 | maptile::clear () |
813 | maptile::clear () |
867 | { |
814 | { |
868 | sfree (regions, size ()), regions = 0; |
815 | sfree (regions, size ()); regions = 0; |
869 | free (regionmap), regionmap = 0; |
816 | delete [] regionmap; regionmap = 0; |
870 | |
817 | |
871 | if (spaces) |
818 | if (spaces) |
872 | { |
819 | { |
873 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
820 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
874 | while (object *op = ms->bot) |
821 | while (object *op = ms->bot) |
… | |
… | |
920 | maptile::do_destroy () |
867 | maptile::do_destroy () |
921 | { |
868 | { |
922 | attachable::do_destroy (); |
869 | attachable::do_destroy (); |
923 | |
870 | |
924 | clear (); |
871 | clear (); |
|
|
872 | } |
|
|
873 | |
|
|
874 | /* decay and destroy perishable items in a map */ |
|
|
875 | void |
|
|
876 | maptile::do_decay_objects () |
|
|
877 | { |
|
|
878 | if (!spaces) |
|
|
879 | return; |
|
|
880 | |
|
|
881 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
882 | for (object *above, *op = ms->bot; op; op = above) |
|
|
883 | { |
|
|
884 | above = op->above; |
|
|
885 | |
|
|
886 | bool destroy = 0; |
|
|
887 | |
|
|
888 | // do not decay anything above unique floor tiles (yet :) |
|
|
889 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
890 | break; |
|
|
891 | |
|
|
892 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
893 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
894 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
895 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
896 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
897 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
898 | || op->is_alive ()) |
|
|
899 | ; // do not decay |
|
|
900 | else if (op->is_weapon ()) |
|
|
901 | { |
|
|
902 | op->stats.dam--; |
|
|
903 | if (op->stats.dam < 0) |
|
|
904 | destroy = 1; |
|
|
905 | } |
|
|
906 | else if (op->is_armor ()) |
|
|
907 | { |
|
|
908 | op->stats.ac--; |
|
|
909 | if (op->stats.ac < 0) |
|
|
910 | destroy = 1; |
|
|
911 | } |
|
|
912 | else if (op->type == FOOD) |
|
|
913 | { |
|
|
914 | op->stats.food -= rndm (5, 20); |
|
|
915 | if (op->stats.food < 0) |
|
|
916 | destroy = 1; |
|
|
917 | } |
|
|
918 | else |
|
|
919 | { |
|
|
920 | int mat = op->materials; |
|
|
921 | |
|
|
922 | if (mat & M_PAPER |
|
|
923 | || mat & M_LEATHER |
|
|
924 | || mat & M_WOOD |
|
|
925 | || mat & M_ORGANIC |
|
|
926 | || mat & M_CLOTH |
|
|
927 | || mat & M_LIQUID |
|
|
928 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
929 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
930 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
931 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
932 | || (mat & M_ICE && temp > 32)) |
|
|
933 | destroy = 1; |
|
|
934 | } |
|
|
935 | |
|
|
936 | /* adjust overall chance below */ |
|
|
937 | if (destroy && rndm (0, 1)) |
|
|
938 | op->destroy (); |
|
|
939 | } |
925 | } |
940 | } |
926 | |
941 | |
927 | /* |
942 | /* |
928 | * Updates every button on the map (by calling update_button() for them). |
943 | * Updates every button on the map (by calling update_button() for them). |
929 | */ |
944 | */ |
… | |
… | |
977 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
992 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
978 | { |
993 | { |
979 | total_exp += op->stats.exp; |
994 | total_exp += op->stats.exp; |
980 | |
995 | |
981 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
996 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
982 | total_exp += at->clone.stats.exp * 8; |
997 | total_exp += at->stats.exp * 8; |
983 | |
998 | |
984 | monster_cnt++; |
999 | monster_cnt++; |
985 | } |
1000 | } |
986 | } |
1001 | } |
987 | |
1002 | |
… | |
… | |
1209 | vol += op->volume (); |
1224 | vol += op->volume (); |
1210 | |
1225 | |
1211 | return vol; |
1226 | return vol; |
1212 | } |
1227 | } |
1213 | |
1228 | |
1214 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1229 | bool |
1215 | * the map. It also takes care of linking back the freshly found |
1230 | maptile::tile_available (int dir, bool load) |
1216 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1217 | * the value of orig_map->tile_map[tile_num]. |
|
|
1218 | */ |
|
|
1219 | static inline maptile * |
|
|
1220 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1221 | { |
1231 | { |
1222 | maptile *mp = orig_map->tile_map [tile_num]; |
1232 | if (!tile_path[dir]) |
|
|
1233 | return 0; |
1223 | |
1234 | |
1224 | if (!mp) |
1235 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1225 | { |
1236 | return 1; |
1226 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1227 | |
1237 | |
1228 | if (!mp) |
1238 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1229 | { |
1239 | return 1; |
1230 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1231 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1232 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1233 | mp = new maptile (1, 1); |
|
|
1234 | mp->alloc (); |
|
|
1235 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1236 | } |
|
|
1237 | } |
|
|
1238 | |
1240 | |
1239 | int dest_tile = (tile_num + 2) % 4; |
|
|
1240 | |
|
|
1241 | orig_map->tile_map [tile_num] = mp; |
|
|
1242 | |
|
|
1243 | // optimisation: back-link map to origin map if euclidean |
|
|
1244 | //TODO: non-euclidean maps MUST GO |
|
|
1245 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1246 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1247 | |
|
|
1248 | return mp; |
1241 | return 0; |
1249 | } |
|
|
1250 | |
|
|
1251 | static inline void |
|
|
1252 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1253 | { |
|
|
1254 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1255 | } |
1242 | } |
1256 | |
1243 | |
1257 | /* this returns TRUE if the coordinates (x,y) are out of |
1244 | /* this returns TRUE if the coordinates (x,y) are out of |
1258 | * map m. This function also takes into account any |
1245 | * map m. This function also takes into account any |
1259 | * tiling considerations, loading adjacant maps as needed. |
1246 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1272 | if (!m) |
1259 | if (!m) |
1273 | return 0; |
1260 | return 0; |
1274 | |
1261 | |
1275 | if (x < 0) |
1262 | if (x < 0) |
1276 | { |
1263 | { |
1277 | if (!m->tile_path[3]) |
1264 | if (!m->tile_available (3, 0)) |
1278 | return 1; |
1265 | return 1; |
1279 | |
1266 | |
1280 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1281 | find_and_link (m, 3); |
|
|
1282 | |
|
|
1283 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1267 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1284 | } |
1268 | } |
1285 | |
1269 | |
1286 | if (x >= m->width) |
1270 | if (x >= m->width) |
1287 | { |
1271 | { |
1288 | if (!m->tile_path[1]) |
1272 | if (!m->tile_available (1, 0)) |
1289 | return 1; |
1273 | return 1; |
1290 | |
1274 | |
1291 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1292 | find_and_link (m, 1); |
|
|
1293 | |
|
|
1294 | return out_of_map (m->tile_map[1], x - m->width, y); |
1275 | return out_of_map (m->tile_map[1], x - m->width, y); |
1295 | } |
1276 | } |
1296 | |
1277 | |
1297 | if (y < 0) |
1278 | if (y < 0) |
1298 | { |
1279 | { |
1299 | if (!m->tile_path[0]) |
1280 | if (!m->tile_available (0, 0)) |
1300 | return 1; |
1281 | return 1; |
1301 | |
1282 | |
1302 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1303 | find_and_link (m, 0); |
|
|
1304 | |
|
|
1305 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1283 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1306 | } |
1284 | } |
1307 | |
1285 | |
1308 | if (y >= m->height) |
1286 | if (y >= m->height) |
1309 | { |
1287 | { |
1310 | if (!m->tile_path[2]) |
1288 | if (!m->tile_available (2, 0)) |
1311 | return 1; |
1289 | return 1; |
1312 | |
|
|
1313 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1314 | find_and_link (m, 2); |
|
|
1315 | |
1290 | |
1316 | return out_of_map (m->tile_map[2], x, y - m->height); |
1291 | return out_of_map (m->tile_map[2], x, y - m->height); |
1317 | } |
1292 | } |
1318 | |
1293 | |
1319 | /* Simple case - coordinates are within this local |
1294 | /* Simple case - coordinates are within this local |
… | |
… | |
1333 | maptile * |
1308 | maptile * |
1334 | maptile::xy_find (sint16 &x, sint16 &y) |
1309 | maptile::xy_find (sint16 &x, sint16 &y) |
1335 | { |
1310 | { |
1336 | if (x < 0) |
1311 | if (x < 0) |
1337 | { |
1312 | { |
1338 | if (!tile_path[3]) |
1313 | if (!tile_available (3, 1)) |
1339 | return 0; |
1314 | return 0; |
1340 | |
1315 | |
1341 | find_and_link (this, 3); |
|
|
1342 | x += tile_map[3]->width; |
1316 | x += tile_map[3]->width; |
1343 | return tile_map[3]->xy_find (x, y); |
1317 | return tile_map[3]->xy_find (x, y); |
1344 | } |
1318 | } |
1345 | |
1319 | |
1346 | if (x >= width) |
1320 | if (x >= width) |
1347 | { |
1321 | { |
1348 | if (!tile_path[1]) |
1322 | if (!tile_available (1, 1)) |
1349 | return 0; |
1323 | return 0; |
1350 | |
1324 | |
1351 | find_and_link (this, 1); |
|
|
1352 | x -= width; |
1325 | x -= width; |
1353 | return tile_map[1]->xy_find (x, y); |
1326 | return tile_map[1]->xy_find (x, y); |
1354 | } |
1327 | } |
1355 | |
1328 | |
1356 | if (y < 0) |
1329 | if (y < 0) |
1357 | { |
1330 | { |
1358 | if (!tile_path[0]) |
1331 | if (!tile_available (0, 1)) |
1359 | return 0; |
1332 | return 0; |
1360 | |
1333 | |
1361 | find_and_link (this, 0); |
|
|
1362 | y += tile_map[0]->height; |
1334 | y += tile_map[0]->height; |
1363 | return tile_map[0]->xy_find (x, y); |
1335 | return tile_map[0]->xy_find (x, y); |
1364 | } |
1336 | } |
1365 | |
1337 | |
1366 | if (y >= height) |
1338 | if (y >= height) |
1367 | { |
1339 | { |
1368 | if (!tile_path[2]) |
1340 | if (!tile_available (2, 1)) |
1369 | return 0; |
1341 | return 0; |
1370 | |
1342 | |
1371 | find_and_link (this, 2); |
|
|
1372 | y -= height; |
1343 | y -= height; |
1373 | return tile_map[2]->xy_find (x, y); |
1344 | return tile_map[2]->xy_find (x, y); |
1374 | } |
1345 | } |
1375 | |
1346 | |
1376 | /* Simple case - coordinates are within this local |
1347 | /* Simple case - coordinates are within this local |
… | |
… | |
1651 | |
1622 | |
1652 | // instead of crashing in the unlikely(?) case, try to return *something* |
1623 | // instead of crashing in the unlikely(?) case, try to return *something* |
1653 | return get_archetype ("blocked"); |
1624 | return get_archetype ("blocked"); |
1654 | } |
1625 | } |
1655 | |
1626 | |
|
|
1627 | void |
|
|
1628 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1629 | { |
|
|
1630 | if (!sound) |
|
|
1631 | return; |
|
|
1632 | |
|
|
1633 | for_all_players (pl) |
|
|
1634 | if (pl->ob->map == this) |
|
|
1635 | if (client *ns = pl->ns) |
|
|
1636 | { |
|
|
1637 | int dx = x - pl->ob->x; |
|
|
1638 | int dy = y - pl->ob->y; |
|
|
1639 | |
|
|
1640 | int distance = idistance (dx, dy); |
|
|
1641 | |
|
|
1642 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1643 | ns->play_sound (sound, dx, dy); |
|
|
1644 | } |
|
|
1645 | } |
|
|
1646 | |