1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
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 |
… | |
… | |
174 | * let the player through (inventory checkers for example) |
107 | * let the player through (inventory checkers for example) |
175 | */ |
108 | */ |
176 | if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) |
109 | if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) |
177 | return 0; |
110 | return 0; |
178 | |
111 | |
179 | if (ob->head != NULL) |
|
|
180 | ob = ob->head; |
112 | ob = ob->head_ (); |
181 | |
113 | |
182 | /* We basically go through the stack of objects, and if there is |
114 | /* We basically go through the stack of objects, and if there is |
183 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
115 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
184 | * true. If we get through the entire stack, that must mean |
116 | * true. If we get through the entire stack, that must mean |
185 | * ob is blocking it, so return 0. |
117 | * ob is blocking it, so return 0. |
… | |
… | |
215 | else |
147 | else |
216 | { |
148 | { |
217 | /* Broke apart a big nasty if into several here to make |
149 | /* Broke apart a big nasty if into several here to make |
218 | * this more readable. first check - if the space blocks |
150 | * this more readable. first check - if the space blocks |
219 | * movement, can't move here. |
151 | * movement, can't move here. |
220 | * second - if a monster, can't move there, unles it is a |
152 | * second - if a monster, can't move there, unless it is a |
221 | * hidden dm |
153 | * hidden dm |
222 | */ |
154 | */ |
223 | if (OB_MOVE_BLOCK (ob, tmp)) |
155 | if (OB_MOVE_BLOCK (ob, tmp)) |
224 | return 1; |
156 | return 1; |
225 | if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && |
157 | |
226 | tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) |
158 | if (tmp->flag [FLAG_ALIVE] |
|
|
159 | && tmp->head_ () != ob |
|
|
160 | && tmp != ob |
|
|
161 | && tmp->type != DOOR |
|
|
162 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
227 | return 1; |
163 | return 1; |
228 | } |
164 | } |
229 | |
165 | |
230 | } |
166 | } |
231 | return 0; |
167 | return 0; |
… | |
… | |
273 | |
209 | |
274 | /* 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 */ |
275 | return m1->at (sx, sy).move_block; |
211 | return m1->at (sx, sy).move_block; |
276 | } |
212 | } |
277 | |
213 | |
278 | for (tmp = ob->arch; tmp; tmp = tmp->more) |
214 | for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) |
279 | { |
215 | { |
280 | 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); |
281 | |
217 | |
282 | if (flag & P_OUT_OF_MAP) |
218 | if (flag & P_OUT_OF_MAP) |
283 | return P_OUT_OF_MAP; |
219 | return P_OUT_OF_MAP; |
284 | if (flag & P_IS_ALIVE) |
220 | if (flag & P_IS_ALIVE) |
285 | return P_IS_ALIVE; |
221 | return P_IS_ALIVE; |
… | |
… | |
353 | { |
289 | { |
354 | if (!spaces) |
290 | if (!spaces) |
355 | return; |
291 | return; |
356 | |
292 | |
357 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
293 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
358 | for (object *op = ms->bot; op; op = op->above) |
294 | { |
|
|
295 | object *op = ms->bot; |
|
|
296 | while (op) |
359 | { |
297 | { |
360 | /* already multipart - don't do anything more */ |
298 | /* already multipart - don't do anything more */ |
361 | if (!op->head && !op->more && op->arch->more) |
299 | if (op->head_ () == op && !op->more && op->arch->more) |
362 | { |
300 | { |
363 | op->remove (); |
301 | op->remove (); |
364 | 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 |
365 | 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 |
366 | } |
311 | } |
|
|
312 | else |
|
|
313 | op = op->above; |
367 | } |
314 | } |
|
|
315 | } |
368 | } |
316 | } |
369 | |
317 | |
370 | /* |
318 | /* |
371 | * 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 |
372 | * file pointer. |
320 | * file pointer. |
… | |
… | |
407 | } |
355 | } |
408 | |
356 | |
409 | void |
357 | void |
410 | maptile::activate () |
358 | maptile::activate () |
411 | { |
359 | { |
412 | active = true; |
|
|
413 | |
|
|
414 | if (spaces) |
360 | if (spaces) |
415 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
416 | for (object *op = ms->bot; op; op = op->above) |
362 | for (object *op = ms->bot; op; op = op->above) |
417 | op->activate_recursive (); |
363 | op->activate_recursive (); |
418 | } |
364 | } |
419 | |
365 | |
420 | void |
366 | void |
421 | maptile::deactivate () |
367 | maptile::deactivate () |
422 | { |
368 | { |
423 | active = false; |
|
|
424 | |
|
|
425 | if (spaces) |
369 | if (spaces) |
426 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
427 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
428 | op->deactivate_recursive (); |
372 | op->deactivate_recursive (); |
429 | } |
373 | } |
… | |
… | |
439 | if (!spaces) |
383 | if (!spaces) |
440 | return false; |
384 | return false; |
441 | |
385 | |
442 | for (int i = 0; i < size (); ++i) |
386 | for (int i = 0; i < size (); ++i) |
443 | { |
387 | { |
444 | int unique = 0; |
388 | bool unique = 0; |
|
|
389 | |
445 | for (object *op = spaces [i].bot; op; op = op->above) |
390 | for (object *op = spaces [i].bot; op; op = op->above) |
446 | { |
391 | { |
447 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
392 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
448 | unique = 1; |
|
|
449 | |
393 | |
450 | if (!op->can_map_save ()) |
394 | if (expect_false (!op->can_map_save ())) |
451 | continue; |
395 | continue; |
452 | |
396 | |
453 | if (unique || op->flag [FLAG_UNIQUE]) |
397 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
454 | { |
398 | { |
455 | if (flags & IO_UNIQUES) |
399 | if (flags & IO_UNIQUES) |
456 | op->write (f); |
400 | op->write (f); |
457 | } |
401 | } |
458 | else if (flags & IO_OBJECTS) |
402 | else if (expect_true (flags & IO_OBJECTS)) |
459 | op->write (f); |
403 | op->write (f); |
460 | } |
404 | } |
461 | } |
405 | } |
462 | |
406 | |
463 | coroapi::cede_to_tick (); |
407 | coroapi::cede_to_tick (); |
464 | |
408 | |
465 | return true; |
409 | return true; |
466 | } |
|
|
467 | |
|
|
468 | bool |
|
|
469 | maptile::_load_objects (const char *path, bool skip_header) |
|
|
470 | { |
|
|
471 | object_thawer f (path); |
|
|
472 | |
|
|
473 | if (!f) |
|
|
474 | return false; |
|
|
475 | |
|
|
476 | f.next (); |
|
|
477 | |
|
|
478 | if (skip_header) |
|
|
479 | for (;;) |
|
|
480 | { |
|
|
481 | keyword kw = f.kw; |
|
|
482 | f.skip (); |
|
|
483 | if (kw == KW_end) |
|
|
484 | break; |
|
|
485 | } |
|
|
486 | |
|
|
487 | return _load_objects (f); |
|
|
488 | } |
410 | } |
489 | |
411 | |
490 | bool |
412 | bool |
491 | maptile::_save_objects (const char *path, int flags) |
413 | maptile::_save_objects (const char *path, int flags) |
492 | { |
414 | { |
… | |
… | |
667 | bool |
589 | bool |
668 | maptile::_load_header (object_thawer &thawer) |
590 | maptile::_load_header (object_thawer &thawer) |
669 | { |
591 | { |
670 | for (;;) |
592 | for (;;) |
671 | { |
593 | { |
672 | keyword kw = thawer.get_kv (); |
|
|
673 | |
|
|
674 | switch (kw) |
594 | switch (thawer.kw) |
675 | { |
595 | { |
676 | case KW_msg: |
596 | case KW_msg: |
677 | thawer.get_ml (KW_endmsg, msg); |
597 | thawer.get_ml (KW_endmsg, msg); |
678 | break; |
598 | break; |
679 | |
599 | |
… | |
… | |
711 | case KW_winddir: thawer.get (winddir); break; |
631 | case KW_winddir: thawer.get (winddir); break; |
712 | case KW_sky: thawer.get (sky); break; |
632 | case KW_sky: thawer.get (sky); break; |
713 | |
633 | |
714 | case KW_per_player: thawer.get (per_player); break; |
634 | case KW_per_player: thawer.get (per_player); break; |
715 | case KW_per_party: thawer.get (per_party); break; |
635 | case KW_per_party: thawer.get (per_party); break; |
|
|
636 | case KW_no_reset: thawer.get (no_reset); break; |
716 | |
637 | |
717 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
638 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
718 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
639 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
719 | |
640 | |
720 | // old names new names |
641 | // old names new names |
… | |
… | |
731 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
652 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
732 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
653 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
733 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
654 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
734 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
655 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
735 | |
656 | |
|
|
657 | case KW_ERROR: |
|
|
658 | set_key_text (thawer.kw_str, thawer.value); |
|
|
659 | break; |
|
|
660 | |
736 | case KW_end: |
661 | case KW_end: |
|
|
662 | thawer.next (); |
737 | return true; |
663 | return true; |
738 | |
664 | |
739 | default: |
665 | default: |
740 | if (!thawer.parse_error ("map", 0)) |
666 | if (!thawer.parse_error ("map", 0)) |
741 | return false; |
667 | return false; |
742 | break; |
668 | break; |
743 | } |
669 | } |
|
|
670 | |
|
|
671 | thawer.next (); |
744 | } |
672 | } |
745 | |
673 | |
746 | abort (); |
674 | abort (); |
747 | } |
|
|
748 | |
|
|
749 | bool |
|
|
750 | maptile::_load_header (const char *path) |
|
|
751 | { |
|
|
752 | object_thawer thawer (path); |
|
|
753 | |
|
|
754 | if (!thawer) |
|
|
755 | return false; |
|
|
756 | |
|
|
757 | return _load_header (thawer); |
|
|
758 | } |
675 | } |
759 | |
676 | |
760 | /****************************************************************************** |
677 | /****************************************************************************** |
761 | * This is the start of unique map handling code |
678 | * This is the start of unique map handling code |
762 | *****************************************************************************/ |
679 | *****************************************************************************/ |
… | |
… | |
773 | object *above = op->above; |
690 | object *above = op->above; |
774 | |
691 | |
775 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
692 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
776 | unique = 1; |
693 | unique = 1; |
777 | |
694 | |
778 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
695 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
779 | { |
696 | { |
780 | op->destroy_inv (false); |
697 | op->destroy_inv (false); |
781 | op->destroy (); |
698 | op->destroy (); |
782 | } |
699 | } |
783 | |
700 | |
… | |
… | |
797 | if (name) MAP_OUT (name); |
714 | if (name) MAP_OUT (name); |
798 | MAP_OUT (swap_time); |
715 | MAP_OUT (swap_time); |
799 | MAP_OUT (reset_time); |
716 | MAP_OUT (reset_time); |
800 | MAP_OUT (reset_timeout); |
717 | MAP_OUT (reset_timeout); |
801 | MAP_OUT (fixed_resettime); |
718 | MAP_OUT (fixed_resettime); |
|
|
719 | MAP_OUT (no_reset); |
802 | MAP_OUT (difficulty); |
720 | MAP_OUT (difficulty); |
803 | |
721 | |
804 | if (default_region) MAP_OUT2 (region, default_region->name); |
722 | if (default_region) MAP_OUT2 (region, default_region->name); |
805 | |
723 | |
806 | if (shopitems) |
724 | if (shopitems) |
… | |
… | |
860 | * Remove and free all objects in the given map. |
778 | * Remove and free all objects in the given map. |
861 | */ |
779 | */ |
862 | void |
780 | void |
863 | maptile::clear () |
781 | maptile::clear () |
864 | { |
782 | { |
865 | sfree (regions, size ()), regions = 0; |
|
|
866 | free (regionmap), regionmap = 0; |
|
|
867 | |
|
|
868 | if (spaces) |
783 | if (spaces) |
869 | { |
784 | { |
870 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
785 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
871 | while (object *op = ms->bot) |
786 | while (object *op = ms->bot) |
872 | { |
787 | { |
|
|
788 | // manually remove, as to not trigger anything |
|
|
789 | if (ms->bot = op->above) |
|
|
790 | ms->bot->below = 0; |
|
|
791 | |
|
|
792 | op->flag [FLAG_REMOVED] = true; |
|
|
793 | |
|
|
794 | object *head = op->head_ (); |
873 | if (op->head) |
795 | if (op == head) |
874 | op = op->head; |
796 | { |
875 | |
|
|
876 | op->destroy_inv (false); |
797 | op->destroy_inv (false); |
877 | op->destroy (); |
798 | op->destroy (); |
|
|
799 | } |
|
|
800 | else if (head->map != op->map) |
|
|
801 | { |
|
|
802 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
|
|
803 | head->destroy (); |
|
|
804 | } |
878 | } |
805 | } |
879 | |
806 | |
880 | sfree (spaces, size ()), spaces = 0; |
807 | sfree (spaces, size ()), spaces = 0; |
881 | } |
808 | } |
882 | |
809 | |
883 | if (buttons) |
810 | if (buttons) |
884 | free_objectlinkpt (buttons), buttons = 0; |
811 | free_objectlinkpt (buttons), buttons = 0; |
|
|
812 | |
|
|
813 | sfree (regions, size ()); regions = 0; |
|
|
814 | delete [] regionmap; regionmap = 0; |
885 | } |
815 | } |
886 | |
816 | |
887 | void |
817 | void |
888 | maptile::clear_header () |
818 | maptile::clear_header () |
889 | { |
819 | { |
… | |
… | |
919 | maptile::do_destroy () |
849 | maptile::do_destroy () |
920 | { |
850 | { |
921 | attachable::do_destroy (); |
851 | attachable::do_destroy (); |
922 | |
852 | |
923 | clear (); |
853 | clear (); |
|
|
854 | } |
|
|
855 | |
|
|
856 | /* decay and destroy perishable items in a map */ |
|
|
857 | void |
|
|
858 | maptile::do_decay_objects () |
|
|
859 | { |
|
|
860 | if (!spaces) |
|
|
861 | return; |
|
|
862 | |
|
|
863 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
864 | for (object *above, *op = ms->bot; op; op = above) |
|
|
865 | { |
|
|
866 | above = op->above; |
|
|
867 | |
|
|
868 | bool destroy = 0; |
|
|
869 | |
|
|
870 | // do not decay anything above unique floor tiles (yet :) |
|
|
871 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
872 | break; |
|
|
873 | |
|
|
874 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
875 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
876 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
877 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
878 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
879 | || op->is_alive ()) |
|
|
880 | ; // do not decay |
|
|
881 | else if (op->is_weapon ()) |
|
|
882 | { |
|
|
883 | op->stats.dam--; |
|
|
884 | if (op->stats.dam < 0) |
|
|
885 | destroy = 1; |
|
|
886 | } |
|
|
887 | else if (op->is_armor ()) |
|
|
888 | { |
|
|
889 | op->stats.ac--; |
|
|
890 | if (op->stats.ac < 0) |
|
|
891 | destroy = 1; |
|
|
892 | } |
|
|
893 | else if (op->type == FOOD) |
|
|
894 | { |
|
|
895 | op->stats.food -= rndm (5, 20); |
|
|
896 | if (op->stats.food < 0) |
|
|
897 | destroy = 1; |
|
|
898 | } |
|
|
899 | else |
|
|
900 | { |
|
|
901 | int mat = op->materials; |
|
|
902 | |
|
|
903 | if (mat & M_PAPER |
|
|
904 | || mat & M_LEATHER |
|
|
905 | || mat & M_WOOD |
|
|
906 | || mat & M_ORGANIC |
|
|
907 | || mat & M_CLOTH |
|
|
908 | || mat & M_LIQUID |
|
|
909 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
910 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
911 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
912 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
913 | || (mat & M_ICE && temp > 32)) |
|
|
914 | destroy = 1; |
|
|
915 | } |
|
|
916 | |
|
|
917 | /* adjust overall chance below */ |
|
|
918 | if (destroy && rndm (0, 1)) |
|
|
919 | op->destroy (); |
|
|
920 | } |
924 | } |
921 | } |
925 | |
922 | |
926 | /* |
923 | /* |
927 | * Updates every button on the map (by calling update_button() for them). |
924 | * Updates every button on the map (by calling update_button() for them). |
928 | */ |
925 | */ |
… | |
… | |
976 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
973 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
977 | { |
974 | { |
978 | total_exp += op->stats.exp; |
975 | total_exp += op->stats.exp; |
979 | |
976 | |
980 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
977 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
981 | total_exp += at->clone.stats.exp * 8; |
978 | total_exp += at->stats.exp * 8; |
982 | |
979 | |
983 | monster_cnt++; |
980 | monster_cnt++; |
984 | } |
981 | } |
985 | } |
982 | } |
986 | |
983 | |
… | |
… | |
1208 | vol += op->volume (); |
1205 | vol += op->volume (); |
1209 | |
1206 | |
1210 | return vol; |
1207 | return vol; |
1211 | } |
1208 | } |
1212 | |
1209 | |
1213 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1210 | bool |
1214 | * the map. It also takes care of linking back the freshly found |
1211 | maptile::tile_available (int dir, bool load) |
1215 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1216 | * the value of orig_map->tile_map[tile_num]. |
|
|
1217 | */ |
|
|
1218 | static inline maptile * |
|
|
1219 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1220 | { |
1212 | { |
1221 | maptile *mp = orig_map->tile_map [tile_num]; |
1213 | if (!tile_path[dir]) |
|
|
1214 | return 0; |
1222 | |
1215 | |
1223 | if (!mp) |
1216 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1224 | { |
1217 | return 1; |
1225 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1226 | |
1218 | |
1227 | if (!mp) |
1219 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1228 | { |
1220 | return 1; |
1229 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1230 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1231 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1232 | mp = new maptile (1, 1); |
|
|
1233 | mp->alloc (); |
|
|
1234 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1235 | } |
|
|
1236 | } |
|
|
1237 | |
1221 | |
1238 | int dest_tile = (tile_num + 2) % 4; |
|
|
1239 | |
|
|
1240 | orig_map->tile_map [tile_num] = mp; |
|
|
1241 | |
|
|
1242 | // optimisation: back-link map to origin map if euclidean |
|
|
1243 | //TODO: non-euclidean maps MUST GO |
|
|
1244 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1245 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1246 | |
|
|
1247 | return mp; |
1222 | return 0; |
1248 | } |
|
|
1249 | |
|
|
1250 | static inline void |
|
|
1251 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1252 | { |
|
|
1253 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1254 | } |
1223 | } |
1255 | |
1224 | |
1256 | /* this returns TRUE if the coordinates (x,y) are out of |
1225 | /* this returns TRUE if the coordinates (x,y) are out of |
1257 | * map m. This function also takes into account any |
1226 | * map m. This function also takes into account any |
1258 | * tiling considerations, loading adjacant maps as needed. |
1227 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1271 | if (!m) |
1240 | if (!m) |
1272 | return 0; |
1241 | return 0; |
1273 | |
1242 | |
1274 | if (x < 0) |
1243 | if (x < 0) |
1275 | { |
1244 | { |
1276 | if (!m->tile_path[3]) |
1245 | if (!m->tile_available (3)) |
1277 | return 1; |
1246 | return 1; |
1278 | |
1247 | |
1279 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1280 | find_and_link (m, 3); |
|
|
1281 | |
|
|
1282 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1248 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1283 | } |
1249 | } |
1284 | |
1250 | |
1285 | if (x >= m->width) |
1251 | if (x >= m->width) |
1286 | { |
1252 | { |
1287 | if (!m->tile_path[1]) |
1253 | if (!m->tile_available (1)) |
1288 | return 1; |
1254 | return 1; |
1289 | |
1255 | |
1290 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1291 | find_and_link (m, 1); |
|
|
1292 | |
|
|
1293 | return out_of_map (m->tile_map[1], x - m->width, y); |
1256 | return out_of_map (m->tile_map[1], x - m->width, y); |
1294 | } |
1257 | } |
1295 | |
1258 | |
1296 | if (y < 0) |
1259 | if (y < 0) |
1297 | { |
1260 | { |
1298 | if (!m->tile_path[0]) |
1261 | if (!m->tile_available (0)) |
1299 | return 1; |
1262 | return 1; |
1300 | |
1263 | |
1301 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1302 | find_and_link (m, 0); |
|
|
1303 | |
|
|
1304 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1264 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1305 | } |
1265 | } |
1306 | |
1266 | |
1307 | if (y >= m->height) |
1267 | if (y >= m->height) |
1308 | { |
1268 | { |
1309 | if (!m->tile_path[2]) |
1269 | if (!m->tile_available (2)) |
1310 | return 1; |
1270 | return 1; |
1311 | |
|
|
1312 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1313 | find_and_link (m, 2); |
|
|
1314 | |
1271 | |
1315 | return out_of_map (m->tile_map[2], x, y - m->height); |
1272 | return out_of_map (m->tile_map[2], x, y - m->height); |
1316 | } |
1273 | } |
1317 | |
1274 | |
1318 | /* Simple case - coordinates are within this local |
1275 | /* Simple case - coordinates are within this local |
… | |
… | |
1332 | maptile * |
1289 | maptile * |
1333 | maptile::xy_find (sint16 &x, sint16 &y) |
1290 | maptile::xy_find (sint16 &x, sint16 &y) |
1334 | { |
1291 | { |
1335 | if (x < 0) |
1292 | if (x < 0) |
1336 | { |
1293 | { |
1337 | if (!tile_path[3]) |
1294 | if (!tile_available (3)) |
1338 | return 0; |
1295 | return 0; |
1339 | |
1296 | |
1340 | find_and_link (this, 3); |
|
|
1341 | x += tile_map[3]->width; |
1297 | x += tile_map[3]->width; |
1342 | return tile_map[3]->xy_find (x, y); |
1298 | return tile_map[3]->xy_find (x, y); |
1343 | } |
1299 | } |
1344 | |
1300 | |
1345 | if (x >= width) |
1301 | if (x >= width) |
1346 | { |
1302 | { |
1347 | if (!tile_path[1]) |
1303 | if (!tile_available (1)) |
1348 | return 0; |
1304 | return 0; |
1349 | |
1305 | |
1350 | find_and_link (this, 1); |
|
|
1351 | x -= width; |
1306 | x -= width; |
1352 | return tile_map[1]->xy_find (x, y); |
1307 | return tile_map[1]->xy_find (x, y); |
1353 | } |
1308 | } |
1354 | |
1309 | |
1355 | if (y < 0) |
1310 | if (y < 0) |
1356 | { |
1311 | { |
1357 | if (!tile_path[0]) |
1312 | if (!tile_available (0)) |
1358 | return 0; |
1313 | return 0; |
1359 | |
1314 | |
1360 | find_and_link (this, 0); |
|
|
1361 | y += tile_map[0]->height; |
1315 | y += tile_map[0]->height; |
1362 | return tile_map[0]->xy_find (x, y); |
1316 | return tile_map[0]->xy_find (x, y); |
1363 | } |
1317 | } |
1364 | |
1318 | |
1365 | if (y >= height) |
1319 | if (y >= height) |
1366 | { |
1320 | { |
1367 | if (!tile_path[2]) |
1321 | if (!tile_available (2)) |
1368 | return 0; |
1322 | return 0; |
1369 | |
1323 | |
1370 | find_and_link (this, 2); |
|
|
1371 | y -= height; |
1324 | y -= height; |
1372 | return tile_map[2]->xy_find (x, y); |
1325 | return tile_map[2]->xy_find (x, y); |
1373 | } |
1326 | } |
1374 | |
1327 | |
1375 | /* Simple case - coordinates are within this local |
1328 | /* Simple case - coordinates are within this local |
… | |
… | |
1386 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1339 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1387 | { |
1340 | { |
1388 | if (!map1 || !map2) |
1341 | if (!map1 || !map2) |
1389 | return 0; |
1342 | return 0; |
1390 | |
1343 | |
1391 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
1344 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
1392 | //fix: compare paths instead (this is likely faster, too!) |
1345 | //fix: compare paths instead (this is likely faster, too!) |
1393 | if (map1 == map2) |
1346 | if (map1 == map2) |
1394 | { |
1347 | { |
1395 | *dx = 0; |
1348 | *dx = 0; |
1396 | *dy = 0; |
1349 | *dy = 0; |
… | |
… | |
1650 | |
1603 | |
1651 | // instead of crashing in the unlikely(?) case, try to return *something* |
1604 | // instead of crashing in the unlikely(?) case, try to return *something* |
1652 | return get_archetype ("blocked"); |
1605 | return get_archetype ("blocked"); |
1653 | } |
1606 | } |
1654 | |
1607 | |
|
|
1608 | void |
|
|
1609 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1610 | { |
|
|
1611 | if (!sound) |
|
|
1612 | return; |
|
|
1613 | |
|
|
1614 | for_all_players (pl) |
|
|
1615 | if (pl->observe->map == this) |
|
|
1616 | if (client *ns = pl->ns) |
|
|
1617 | { |
|
|
1618 | int dx = x - pl->observe->x; |
|
|
1619 | int dy = y - pl->observe->y; |
|
|
1620 | |
|
|
1621 | int distance = idistance (dx, dy); |
|
|
1622 | |
|
|
1623 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1624 | ns->play_sound (sound, dx, dy); |
|
|
1625 | } |
|
|
1626 | } |
|
|
1627 | |