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; |
… | |
… | |
344 | } |
280 | } |
345 | |
281 | |
346 | /* link_multipart_objects go through all the objects on the map looking |
282 | /* link_multipart_objects go through all the objects on the map looking |
347 | * for objects whose arch says they are multipart yet according to the |
283 | * for objects whose arch says they are multipart yet according to the |
348 | * info we have, they only have the head (as would be expected when |
284 | * info we have, they only have the head (as would be expected when |
349 | * they are saved). We do have to look for the old maps that did save |
285 | * they are saved). |
350 | * the more sections and not re-add sections for them. |
|
|
351 | */ |
286 | */ |
352 | void |
287 | void |
353 | maptile::link_multipart_objects () |
288 | maptile::link_multipart_objects () |
354 | { |
289 | { |
355 | if (!spaces) |
290 | if (!spaces) |
356 | return; |
291 | return; |
357 | |
292 | |
358 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
293 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
359 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
294 | { |
|
|
295 | object *op = ms->bot; |
|
|
296 | while (op) |
360 | { |
297 | { |
361 | /* already multipart - don't do anything more */ |
298 | /* already multipart - don't do anything more */ |
362 | if (!tmp->head && !tmp->more) |
299 | if (op->head_ () == op && !op->more && op->arch->more) |
363 | { |
|
|
364 | /* If there is nothing more to this object, this for loop |
|
|
365 | * won't do anything. |
|
|
366 | */ |
|
|
367 | archetype *at; |
|
|
368 | object *last, *op; |
|
|
369 | for (at = tmp->arch->more, last = tmp; |
|
|
370 | at; |
|
|
371 | at = at->more, last = op) |
|
|
372 | { |
300 | { |
373 | op = arch_to_object (at); |
301 | op->remove (); |
|
|
302 | op->expand_tail (); |
374 | |
303 | |
375 | /* update x,y coordinates */ |
304 | // FIXME: INS_ON_TOP is just a workaround for the pentagram vs. |
376 | op->x += tmp->x; |
305 | // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters |
377 | op->y += tmp->y; |
306 | // below the pentagrams... hopefully INS_ON_TOP doesn't break anything |
378 | op->head = tmp; |
|
|
379 | op->map = this; |
|
|
380 | last->more = op; |
|
|
381 | op->name = tmp->name; |
|
|
382 | op->title = tmp->title; |
|
|
383 | |
|
|
384 | /* we could link all the parts onto tmp, and then just |
|
|
385 | * call insert_ob_in_map once, but the effect is the same, |
|
|
386 | * as insert_ob_in_map will call itself with each part, and |
|
|
387 | * the coding is simpler to just to it here with each part. |
|
|
388 | */ |
|
|
389 | insert_ob_in_map (op, op->map, tmp, 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 |
390 | } |
311 | } |
|
|
312 | else |
|
|
313 | op = op->above; |
391 | } |
314 | } |
392 | } |
315 | } |
393 | } |
316 | } |
394 | |
317 | |
395 | /* |
318 | /* |
396 | * 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 |
397 | * file pointer. |
320 | * file pointer. |
… | |
… | |
399 | bool |
322 | bool |
400 | maptile::_load_objects (object_thawer &f) |
323 | maptile::_load_objects (object_thawer &f) |
401 | { |
324 | { |
402 | for (;;) |
325 | for (;;) |
403 | { |
326 | { |
404 | coroapi::cede_every (1000); // cede once in a while |
327 | coroapi::cede_to_tick_every (100); // cede once in a while |
405 | |
328 | |
406 | switch (f.kw) |
329 | switch (f.kw) |
407 | { |
330 | { |
408 | case KW_arch: |
331 | case KW_arch: |
409 | if (object *op = object::read (f, this)) |
332 | if (object *op = object::read (f, this)) |
… | |
… | |
432 | } |
355 | } |
433 | |
356 | |
434 | void |
357 | void |
435 | maptile::activate () |
358 | maptile::activate () |
436 | { |
359 | { |
437 | if (!spaces) |
360 | if (spaces) |
438 | return; |
|
|
439 | |
|
|
440 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
441 | for (object *op = ms->bot; op; op = op->above) |
362 | for (object *op = ms->bot; op; op = op->above) |
442 | op->activate_recursive (); |
363 | op->activate_recursive (); |
443 | } |
364 | } |
444 | |
365 | |
445 | void |
366 | void |
446 | maptile::deactivate () |
367 | maptile::deactivate () |
447 | { |
368 | { |
448 | if (!spaces) |
369 | if (spaces) |
449 | return; |
|
|
450 | |
|
|
451 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
452 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
453 | op->deactivate_recursive (); |
372 | op->deactivate_recursive (); |
454 | } |
373 | } |
455 | |
374 | |
456 | bool |
375 | bool |
457 | maptile::_save_objects (object_freezer &f, int flags) |
376 | maptile::_save_objects (object_freezer &f, int flags) |
458 | { |
377 | { |
459 | static int cede_count = 0; |
378 | coroapi::cede_to_tick (); |
460 | |
379 | |
461 | if (flags & IO_HEADER) |
380 | if (flags & IO_HEADER) |
462 | _save_header (f); |
381 | _save_header (f); |
463 | |
382 | |
464 | if (!spaces) |
383 | if (!spaces) |
465 | return false; |
384 | return false; |
466 | |
385 | |
467 | for (int i = 0; i < size (); ++i) |
386 | for (int i = 0; i < size (); ++i) |
468 | { |
387 | { |
469 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
|
|
470 | if (cede_count >= 500) |
|
|
471 | { |
|
|
472 | cede_count = 0; |
|
|
473 | coroapi::cede (); |
|
|
474 | } |
|
|
475 | #endif |
|
|
476 | |
|
|
477 | int unique = 0; |
388 | int unique = 0; |
478 | for (object *op = spaces [i].bot; op; op = op->above) |
389 | for (object *op = spaces [i].bot; op; op = op->above) |
479 | { |
390 | { |
480 | // count per-object, but cede only when modification-safe |
|
|
481 | cede_count++; |
|
|
482 | |
|
|
483 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
391 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
484 | unique = 1; |
392 | unique = 1; |
485 | |
393 | |
486 | if (!op->can_map_save ()) |
394 | if (!op->can_map_save ()) |
487 | continue; |
395 | continue; |
… | |
… | |
493 | } |
401 | } |
494 | else if (flags & IO_OBJECTS) |
402 | else if (flags & IO_OBJECTS) |
495 | op->write (f); |
403 | op->write (f); |
496 | } |
404 | } |
497 | } |
405 | } |
|
|
406 | |
|
|
407 | coroapi::cede_to_tick (); |
498 | |
408 | |
499 | return true; |
409 | return true; |
500 | } |
410 | } |
501 | |
411 | |
502 | bool |
412 | bool |
… | |
… | |
701 | bool |
611 | bool |
702 | maptile::_load_header (object_thawer &thawer) |
612 | maptile::_load_header (object_thawer &thawer) |
703 | { |
613 | { |
704 | for (;;) |
614 | for (;;) |
705 | { |
615 | { |
706 | keyword kw = thawer.get_kv (); |
616 | thawer.next (); |
707 | |
617 | |
708 | switch (kw) |
618 | switch (thawer.kw) |
709 | { |
619 | { |
710 | case KW_msg: |
620 | case KW_msg: |
711 | thawer.get_ml (KW_endmsg, msg); |
621 | thawer.get_ml (KW_endmsg, msg); |
712 | break; |
622 | break; |
713 | |
623 | |
… | |
… | |
745 | case KW_winddir: thawer.get (winddir); break; |
655 | case KW_winddir: thawer.get (winddir); break; |
746 | case KW_sky: thawer.get (sky); break; |
656 | case KW_sky: thawer.get (sky); break; |
747 | |
657 | |
748 | case KW_per_player: thawer.get (per_player); break; |
658 | case KW_per_player: thawer.get (per_player); break; |
749 | 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; |
750 | |
661 | |
751 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
662 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
752 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
663 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
753 | |
664 | |
754 | // old names new names |
665 | // old names new names |
… | |
… | |
765 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
676 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
766 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
677 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
767 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
678 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
768 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
679 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
769 | |
680 | |
|
|
681 | case KW_ERROR: |
|
|
682 | set_key (thawer.kw_str, thawer.value); |
|
|
683 | break; |
|
|
684 | |
770 | case KW_end: |
685 | case KW_end: |
771 | return true; |
686 | return true; |
772 | |
687 | |
773 | default: |
688 | default: |
774 | if (!thawer.parse_error ("map", 0)) |
689 | if (!thawer.parse_error ("map", 0)) |
… | |
… | |
807 | object *above = op->above; |
722 | object *above = op->above; |
808 | |
723 | |
809 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
724 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
810 | unique = 1; |
725 | unique = 1; |
811 | |
726 | |
812 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
727 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
813 | { |
728 | { |
814 | op->destroy_inv (false); |
729 | op->destroy_inv (false); |
815 | op->destroy (); |
730 | op->destroy (); |
816 | } |
731 | } |
817 | |
732 | |
… | |
… | |
831 | if (name) MAP_OUT (name); |
746 | if (name) MAP_OUT (name); |
832 | MAP_OUT (swap_time); |
747 | MAP_OUT (swap_time); |
833 | MAP_OUT (reset_time); |
748 | MAP_OUT (reset_time); |
834 | MAP_OUT (reset_timeout); |
749 | MAP_OUT (reset_timeout); |
835 | MAP_OUT (fixed_resettime); |
750 | MAP_OUT (fixed_resettime); |
|
|
751 | MAP_OUT (no_reset); |
836 | MAP_OUT (difficulty); |
752 | MAP_OUT (difficulty); |
837 | |
753 | |
838 | if (default_region) MAP_OUT2 (region, default_region->name); |
754 | if (default_region) MAP_OUT2 (region, default_region->name); |
839 | |
755 | |
840 | if (shopitems) |
756 | if (shopitems) |
… | |
… | |
894 | * Remove and free all objects in the given map. |
810 | * Remove and free all objects in the given map. |
895 | */ |
811 | */ |
896 | void |
812 | void |
897 | maptile::clear () |
813 | maptile::clear () |
898 | { |
814 | { |
899 | sfree (regions, size ()), regions = 0; |
815 | sfree (regions, size ()); regions = 0; |
900 | free (regionmap), regionmap = 0; |
816 | delete [] regionmap; regionmap = 0; |
901 | |
817 | |
902 | if (spaces) |
818 | if (spaces) |
903 | { |
819 | { |
904 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
820 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
905 | while (object *op = ms->bot) |
821 | while (object *op = ms->bot) |
906 | { |
822 | { |
907 | if (op->head) |
|
|
908 | op = op->head; |
823 | op = op->head_ (); |
909 | |
|
|
910 | op->destroy_inv (false); |
824 | op->destroy_inv (false); |
911 | op->destroy (); |
825 | op->destroy (); |
912 | } |
826 | } |
913 | |
827 | |
914 | sfree (spaces, size ()), spaces = 0; |
828 | sfree (spaces, size ()), spaces = 0; |
… | |
… | |
953 | maptile::do_destroy () |
867 | maptile::do_destroy () |
954 | { |
868 | { |
955 | attachable::do_destroy (); |
869 | attachable::do_destroy (); |
956 | |
870 | |
957 | 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 | } |
958 | } |
940 | } |
959 | |
941 | |
960 | /* |
942 | /* |
961 | * 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). |
962 | */ |
944 | */ |
… | |
… | |
1010 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
992 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
1011 | { |
993 | { |
1012 | total_exp += op->stats.exp; |
994 | total_exp += op->stats.exp; |
1013 | |
995 | |
1014 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
996 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
1015 | total_exp += at->clone.stats.exp * 8; |
997 | total_exp += at->stats.exp * 8; |
1016 | |
998 | |
1017 | monster_cnt++; |
999 | monster_cnt++; |
1018 | } |
1000 | } |
1019 | } |
1001 | } |
1020 | |
1002 | |
… | |
… | |
1075 | void |
1057 | void |
1076 | mapspace::update_ () |
1058 | mapspace::update_ () |
1077 | { |
1059 | { |
1078 | object *tmp, *last = 0; |
1060 | object *tmp, *last = 0; |
1079 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1061 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1080 | facetile *top, *floor, *middle; |
|
|
1081 | object *top_obj, *floor_obj, *middle_obj; |
|
|
1082 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1062 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1083 | |
1063 | |
1084 | middle = blank_face; |
1064 | //object *middle = 0; |
1085 | top = blank_face; |
1065 | //object *top = 0; |
1086 | floor = blank_face; |
1066 | //object *floor = 0; |
1087 | |
1067 | // this seems to generate better code than using locals, above |
1088 | middle_obj = 0; |
1068 | object *&top = faces_obj[0] = 0; |
1089 | top_obj = 0; |
1069 | object *&middle = faces_obj[1] = 0; |
1090 | floor_obj = 0; |
1070 | object *&floor = faces_obj[2] = 0; |
1091 | |
1071 | |
1092 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1072 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1093 | { |
1073 | { |
1094 | /* This could be made additive I guess (two lights better than |
1074 | /* This could be made additive I guess (two lights better than |
1095 | * one). But if so, it shouldn't be a simple additive - 2 |
1075 | * one). But if so, it shouldn't be a simple additive - 2 |
… | |
… | |
1108 | * Always put the player down for drawing. |
1088 | * Always put the player down for drawing. |
1109 | */ |
1089 | */ |
1110 | if (!tmp->invisible) |
1090 | if (!tmp->invisible) |
1111 | { |
1091 | { |
1112 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1092 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1113 | { |
|
|
1114 | top = tmp->face; |
|
|
1115 | top_obj = tmp; |
1093 | top = tmp; |
1116 | } |
|
|
1117 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1094 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1118 | { |
1095 | { |
1119 | /* If we got a floor, that means middle and top were below it, |
1096 | /* If we got a floor, that means middle and top were below it, |
1120 | * so should not be visible, so we clear them. |
1097 | * so should not be visible, so we clear them. |
1121 | */ |
1098 | */ |
1122 | middle = blank_face; |
1099 | middle = 0; |
1123 | top = blank_face; |
1100 | top = 0; |
1124 | floor = tmp->face; |
|
|
1125 | floor_obj = tmp; |
1101 | floor = tmp; |
1126 | } |
1102 | } |
1127 | /* Flag anywhere have high priority */ |
1103 | /* Flag anywhere have high priority */ |
1128 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1104 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1129 | { |
1105 | { |
1130 | middle = tmp->face; |
|
|
1131 | |
|
|
1132 | middle_obj = tmp; |
1106 | middle = tmp; |
1133 | anywhere = 1; |
1107 | anywhere = 1; |
1134 | } |
1108 | } |
1135 | /* Find the highest visible face around. If equal |
1109 | /* Find the highest visible face around. If equal |
1136 | * visibilities, we still want the one nearer to the |
1110 | * visibilities, we still want the one nearer to the |
1137 | * top |
1111 | * top |
1138 | */ |
1112 | */ |
1139 | else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) |
1113 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
1140 | { |
|
|
1141 | middle = tmp->face; |
|
|
1142 | middle_obj = tmp; |
1114 | middle = tmp; |
1143 | } |
|
|
1144 | } |
1115 | } |
1145 | |
1116 | |
1146 | if (tmp == tmp->above) |
1117 | if (tmp == tmp->above) |
1147 | { |
1118 | { |
1148 | LOG (llevError, "Error in structure of map\n"); |
1119 | LOG (llevError, "Error in structure of map\n"); |
… | |
… | |
1183 | * middle face. This should not happen, as we already have the |
1154 | * middle face. This should not happen, as we already have the |
1184 | * else statement above so middle should not get set. OTOH, it |
1155 | * else statement above so middle should not get set. OTOH, it |
1185 | * may be possible for the faces to match but be different objects. |
1156 | * may be possible for the faces to match but be different objects. |
1186 | */ |
1157 | */ |
1187 | if (top == middle) |
1158 | if (top == middle) |
1188 | middle = blank_face; |
1159 | middle = 0; |
1189 | |
1160 | |
1190 | /* There are three posibilities at this point: |
1161 | /* There are three posibilities at this point: |
1191 | * 1) top face is set, need middle to be set. |
1162 | * 1) top face is set, need middle to be set. |
1192 | * 2) middle is set, need to set top. |
1163 | * 2) middle is set, need to set top. |
1193 | * 3) neither middle or top is set - need to set both. |
1164 | * 3) neither middle or top is set - need to set both. |
… | |
… | |
1198 | /* Once we get to a floor, stop, since we already have a floor object */ |
1169 | /* Once we get to a floor, stop, since we already have a floor object */ |
1199 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1170 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1200 | break; |
1171 | break; |
1201 | |
1172 | |
1202 | /* If two top faces are already set, quit processing */ |
1173 | /* If two top faces are already set, quit processing */ |
1203 | if ((top != blank_face) && (middle != blank_face)) |
1174 | if (top && middle) |
1204 | break; |
1175 | break; |
1205 | |
1176 | |
1206 | /* Only show visible faces */ |
1177 | /* Only show visible faces */ |
1207 | if (!tmp->invisible) |
1178 | if (!tmp->invisible) |
1208 | { |
1179 | { |
1209 | /* Fill in top if needed */ |
1180 | /* Fill in top if needed */ |
1210 | if (top == blank_face) |
1181 | if (!top) |
1211 | { |
1182 | { |
1212 | top = tmp->face; |
|
|
1213 | top_obj = tmp; |
1183 | top = tmp; |
1214 | if (top == middle) |
1184 | if (top == middle) |
1215 | middle = blank_face; |
1185 | middle = 0; |
1216 | } |
1186 | } |
1217 | else |
1187 | else |
1218 | { |
1188 | { |
1219 | /* top is already set - we should only get here if |
1189 | /* top is already set - we should only get here if |
1220 | * middle is not set |
1190 | * middle is not set |
1221 | * |
1191 | * |
1222 | * Set the middle face and break out, since there is nothing |
1192 | * Set the middle face and break out, since there is nothing |
1223 | * more to fill in. We don't check visiblity here, since |
1193 | * more to fill in. We don't check visiblity here, since |
1224 | * |
1194 | * |
1225 | */ |
1195 | */ |
1226 | if (tmp->face != top) |
1196 | if (tmp != top) |
1227 | { |
1197 | { |
1228 | middle = tmp->face; |
|
|
1229 | middle_obj = tmp; |
1198 | middle = tmp; |
1230 | break; |
1199 | break; |
1231 | } |
1200 | } |
1232 | } |
1201 | } |
1233 | } |
1202 | } |
1234 | } |
1203 | } |
1235 | |
1204 | |
1236 | if (middle == floor) |
1205 | if (middle == floor) |
1237 | middle = blank_face; |
1206 | middle = 0; |
1238 | |
1207 | |
1239 | if (top == middle) |
1208 | if (top == middle) |
1240 | middle = blank_face; |
1209 | middle = 0; |
1241 | |
1210 | |
1242 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1211 | #if 0 |
1243 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1212 | faces_obj [0] = top; |
1244 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1213 | faces_obj [1] = middle; |
|
|
1214 | faces_obj [2] = floor; |
|
|
1215 | #endif |
1245 | } |
1216 | } |
1246 | |
1217 | |
1247 | uint64 |
1218 | uint64 |
1248 | mapspace::volume () const |
1219 | mapspace::volume () const |
1249 | { |
1220 | { |
… | |
… | |
1253 | vol += op->volume (); |
1224 | vol += op->volume (); |
1254 | |
1225 | |
1255 | return vol; |
1226 | return vol; |
1256 | } |
1227 | } |
1257 | |
1228 | |
1258 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1229 | bool |
1259 | * the map. It also takes care of linking back the freshly found |
1230 | maptile::tile_available (int dir, bool load) |
1260 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1261 | * the value of orig_map->tile_map[tile_num]. |
|
|
1262 | */ |
|
|
1263 | static inline maptile * |
|
|
1264 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1265 | { |
1231 | { |
1266 | maptile *mp = orig_map->tile_map [tile_num]; |
1232 | if (!tile_path[dir]) |
|
|
1233 | return 0; |
1267 | |
1234 | |
1268 | if (!mp) |
1235 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1269 | { |
1236 | return 1; |
1270 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1271 | |
1237 | |
1272 | if (!mp) |
1238 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1273 | { |
1239 | return 1; |
1274 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1275 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1276 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1277 | mp = new maptile (1, 1); |
|
|
1278 | mp->alloc (); |
|
|
1279 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1280 | } |
|
|
1281 | } |
|
|
1282 | |
1240 | |
1283 | int dest_tile = (tile_num + 2) % 4; |
|
|
1284 | |
|
|
1285 | orig_map->tile_map [tile_num] = mp; |
|
|
1286 | |
|
|
1287 | // optimisation: back-link map to origin map if euclidean |
|
|
1288 | //TODO: non-euclidean maps MUST GO |
|
|
1289 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1290 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1291 | |
|
|
1292 | return mp; |
1241 | return 0; |
1293 | } |
|
|
1294 | |
|
|
1295 | static inline void |
|
|
1296 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1297 | { |
|
|
1298 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1299 | } |
1242 | } |
1300 | |
1243 | |
1301 | /* this returns TRUE if the coordinates (x,y) are out of |
1244 | /* this returns TRUE if the coordinates (x,y) are out of |
1302 | * map m. This function also takes into account any |
1245 | * map m. This function also takes into account any |
1303 | * tiling considerations, loading adjacant maps as needed. |
1246 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1316 | if (!m) |
1259 | if (!m) |
1317 | return 0; |
1260 | return 0; |
1318 | |
1261 | |
1319 | if (x < 0) |
1262 | if (x < 0) |
1320 | { |
1263 | { |
1321 | if (!m->tile_path[3]) |
1264 | if (!m->tile_available (3, 0)) |
1322 | return 1; |
1265 | return 1; |
1323 | |
1266 | |
1324 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1325 | find_and_link (m, 3); |
|
|
1326 | |
|
|
1327 | 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); |
1328 | } |
1268 | } |
1329 | |
1269 | |
1330 | if (x >= m->width) |
1270 | if (x >= m->width) |
1331 | { |
1271 | { |
1332 | if (!m->tile_path[1]) |
1272 | if (!m->tile_available (1, 0)) |
1333 | return 1; |
1273 | return 1; |
1334 | |
1274 | |
1335 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1336 | find_and_link (m, 1); |
|
|
1337 | |
|
|
1338 | 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); |
1339 | } |
1276 | } |
1340 | |
1277 | |
1341 | if (y < 0) |
1278 | if (y < 0) |
1342 | { |
1279 | { |
1343 | if (!m->tile_path[0]) |
1280 | if (!m->tile_available (0, 0)) |
1344 | return 1; |
1281 | return 1; |
1345 | |
1282 | |
1346 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1347 | find_and_link (m, 0); |
|
|
1348 | |
|
|
1349 | 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); |
1350 | } |
1284 | } |
1351 | |
1285 | |
1352 | if (y >= m->height) |
1286 | if (y >= m->height) |
1353 | { |
1287 | { |
1354 | if (!m->tile_path[2]) |
1288 | if (!m->tile_available (2, 0)) |
1355 | return 1; |
1289 | return 1; |
1356 | |
|
|
1357 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1358 | find_and_link (m, 2); |
|
|
1359 | |
1290 | |
1360 | 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); |
1361 | } |
1292 | } |
1362 | |
1293 | |
1363 | /* Simple case - coordinates are within this local |
1294 | /* Simple case - coordinates are within this local |
… | |
… | |
1377 | maptile * |
1308 | maptile * |
1378 | maptile::xy_find (sint16 &x, sint16 &y) |
1309 | maptile::xy_find (sint16 &x, sint16 &y) |
1379 | { |
1310 | { |
1380 | if (x < 0) |
1311 | if (x < 0) |
1381 | { |
1312 | { |
1382 | if (!tile_path[3]) |
1313 | if (!tile_available (3, 1)) |
1383 | return 0; |
1314 | return 0; |
1384 | |
1315 | |
1385 | find_and_link (this, 3); |
|
|
1386 | x += tile_map[3]->width; |
1316 | x += tile_map[3]->width; |
1387 | return tile_map[3]->xy_find (x, y); |
1317 | return tile_map[3]->xy_find (x, y); |
1388 | } |
1318 | } |
1389 | |
1319 | |
1390 | if (x >= width) |
1320 | if (x >= width) |
1391 | { |
1321 | { |
1392 | if (!tile_path[1]) |
1322 | if (!tile_available (1, 1)) |
1393 | return 0; |
1323 | return 0; |
1394 | |
1324 | |
1395 | find_and_link (this, 1); |
|
|
1396 | x -= width; |
1325 | x -= width; |
1397 | return tile_map[1]->xy_find (x, y); |
1326 | return tile_map[1]->xy_find (x, y); |
1398 | } |
1327 | } |
1399 | |
1328 | |
1400 | if (y < 0) |
1329 | if (y < 0) |
1401 | { |
1330 | { |
1402 | if (!tile_path[0]) |
1331 | if (!tile_available (0, 1)) |
1403 | return 0; |
1332 | return 0; |
1404 | |
1333 | |
1405 | find_and_link (this, 0); |
|
|
1406 | y += tile_map[0]->height; |
1334 | y += tile_map[0]->height; |
1407 | return tile_map[0]->xy_find (x, y); |
1335 | return tile_map[0]->xy_find (x, y); |
1408 | } |
1336 | } |
1409 | |
1337 | |
1410 | if (y >= height) |
1338 | if (y >= height) |
1411 | { |
1339 | { |
1412 | if (!tile_path[2]) |
1340 | if (!tile_available (2, 1)) |
1413 | return 0; |
1341 | return 0; |
1414 | |
1342 | |
1415 | find_and_link (this, 2); |
|
|
1416 | y -= height; |
1343 | y -= height; |
1417 | return tile_map[2]->xy_find (x, y); |
1344 | return tile_map[2]->xy_find (x, y); |
1418 | } |
1345 | } |
1419 | |
1346 | |
1420 | /* Simple case - coordinates are within this local |
1347 | /* Simple case - coordinates are within this local |
… | |
… | |
1669 | return default_region; |
1596 | return default_region; |
1670 | |
1597 | |
1671 | return ::region::default_region (); |
1598 | return ::region::default_region (); |
1672 | } |
1599 | } |
1673 | |
1600 | |
|
|
1601 | /* picks a random object from a style map. |
|
|
1602 | * Redone by MSW so it should be faster and not use static |
|
|
1603 | * variables to generate tables. |
|
|
1604 | */ |
|
|
1605 | object * |
|
|
1606 | maptile::pick_random_object () const |
|
|
1607 | { |
|
|
1608 | /* while returning a null object will result in a crash, that |
|
|
1609 | * is actually preferable to an infinite loop. That is because |
|
|
1610 | * most servers will automatically restart in case of crash. |
|
|
1611 | * Change the logic on getting the random space - shouldn't make |
|
|
1612 | * any difference, but this seems clearer to me. |
|
|
1613 | */ |
|
|
1614 | for (int i = 1000; --i;) |
|
|
1615 | { |
|
|
1616 | object *pick = at (rndm (width), rndm (height)).bot; |
1674 | |
1617 | |
|
|
1618 | // do not prefer big monsters just because they are big. |
|
|
1619 | if (pick && pick->head_ () == pick) |
|
|
1620 | return pick->head_ (); |
|
|
1621 | } |
|
|
1622 | |
|
|
1623 | // instead of crashing in the unlikely(?) case, try to return *something* |
|
|
1624 | return get_archetype ("blocked"); |
|
|
1625 | } |
|
|
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 | |