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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.97 by root, Sat Mar 17 21:13:21 2007 UTC vs.
Revision 1.129 by root, Wed Sep 12 11:10:09 2007 UTC

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 */
40const char *
41create_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 */
63int
64check_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;
232} 168}
233 169
234/* 170/*
235 * Returns true if the given object can't fit in the given spot. 171 * Returns qthe blocking object if the given object can't fit in the given
236 * This is meant for multi space objects - for single space objecs, 172 * spot. This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 173 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 174 * of object. This function goes through all the parts of the multipart
239 * multipart object and makes sure they can be inserted. 175 * object and makes sure they can be inserted.
240 * 176 *
241 * While this doesn't call out of map, the get_map_flags does. 177 * While this doesn't call out of map, the get_map_flags does.
242 * 178 *
243 * This function has been used to deprecate arch_out_of_map - 179 * This function has been used to deprecate arch_out_of_map -
244 * this function also does that check, and since in most cases, 180 * this function also does that check, and since in most cases,
… …
255 * 191 *
256 * Note this used to be arch_blocked, but with new movement 192 * Note this used to be arch_blocked, but with new movement
257 * code, we need to have actual object to check its move_type 193 * code, we need to have actual object to check its move_type
258 * against the move_block values. 194 * against the move_block values.
259 */ 195 */
260int 196bool
261ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 197object::blocked (maptile *m, int x, int y) const
262{ 198{
263 archetype *tmp; 199 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
264 int flag;
265 maptile *m1;
266 sint16 sx, sy;
267
268 if (!ob)
269 {
270 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271 if (flag & P_OUT_OF_MAP)
272 return P_OUT_OF_MAP;
273
274 /* don't have object, so don't know what types would block */
275 return m1->at (sx, sy).move_block;
276 } 200 {
201 mapxy pos (m, x + tmp->x, y + tmp->y);
277 202
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 203 if (!pos.normalise ())
279 { 204 return 1;
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281 205
282 if (flag & P_OUT_OF_MAP) 206 mapspace &ms = *pos;
283 return P_OUT_OF_MAP; 207
284 if (flag & P_IS_ALIVE) 208 if (ms.flags () & P_IS_ALIVE)
285 return P_IS_ALIVE; 209 return 1;
286 210
287 mapspace &ms = m1->at (sx, sy); 211 /* However, often ob doesn't have any move type
288 212 * (signifying non-moving objects)
289 /* find_first_free_spot() calls this function. However, often
290 * ob doesn't have any move type (when used to place exits)
291 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 213 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292 */ 214 */
293
294 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 215 if (!move_type && ms.move_block != MOVE_ALL)
295 continue; 216 continue;
296 217
297 /* Note it is intentional that we check ob - the movement type of the 218 /* Note it is intentional that we check ob - the movement type of the
298 * head of the object should correspond for the entire object. 219 * head of the object should correspond for the entire object.
299 */ 220 */
300 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 221 if (ms.blocks (move_type))
301 return P_NO_PASS; 222 return 1;
302 } 223 }
303 224
304 return 0; 225 return 0;
305} 226}
306 227
… …
344} 265}
345 266
346/* link_multipart_objects go through all the objects on the map looking 267/* 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 268 * 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 269 * 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 270 * they are saved).
350 * the more sections and not re-add sections for them.
351 */ 271 */
352void 272void
353maptile::link_multipart_objects () 273maptile::link_multipart_objects ()
354{ 274{
355 if (!spaces) 275 if (!spaces)
356 return; 276 return;
357 277
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 278 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 279 {
280 object *op = ms->bot;
281 while (op)
360 { 282 {
361 /* already multipart - don't do anything more */ 283 /* already multipart - don't do anything more */
362 if (!tmp->head && !tmp->more) 284 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 { 285 {
373 op = arch_to_object (at); 286 op->remove ();
287 op->expand_tail ();
374 288
375 /* update x,y coordinates */ 289 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
376 op->x += tmp->x; 290 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
377 op->y += tmp->y; 291 // 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); 292 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
293
294 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
295 // so we have to reset the iteration through the mapspace
390 } 296 }
297 else
298 op = op->above;
391 } 299 }
392 } 300 }
393} 301}
394 302
395/* 303/*
396 * Loads (ands parses) the objects into a given map from the specified 304 * Loads (ands parses) the objects into a given map from the specified
397 * file pointer. 305 * file pointer.
… …
399bool 307bool
400maptile::_load_objects (object_thawer &f) 308maptile::_load_objects (object_thawer &f)
401{ 309{
402 for (;;) 310 for (;;)
403 { 311 {
404 coroapi::cede_every (1000); // cede once in a while 312 coroapi::cede_to_tick_every (100); // cede once in a while
405 313
406 switch (f.kw) 314 switch (f.kw)
407 { 315 {
408 case KW_arch: 316 case KW_arch:
409 if (object *op = object::read (f, this)) 317 if (object *op = object::read (f, this))
… …
432} 340}
433 341
434void 342void
435maptile::activate () 343maptile::activate ()
436{ 344{
437 if (!spaces) 345 if (spaces)
438 return;
439
440 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 346 for (mapspace *ms = spaces + size (); ms-- > spaces; )
441 for (object *op = ms->bot; op; op = op->above) 347 for (object *op = ms->bot; op; op = op->above)
442 op->activate_recursive (); 348 op->activate_recursive ();
443} 349}
444 350
445void 351void
446maptile::deactivate () 352maptile::deactivate ()
447{ 353{
448 if (!spaces) 354 if (spaces)
449 return;
450
451 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 355 for (mapspace *ms = spaces + size (); ms-- > spaces; )
452 for (object *op = ms->bot; op; op = op->above) 356 for (object *op = ms->bot; op; op = op->above)
453 op->deactivate_recursive (); 357 op->deactivate_recursive ();
454} 358}
455 359
456bool 360bool
457maptile::_save_objects (object_freezer &f, int flags) 361maptile::_save_objects (object_freezer &f, int flags)
458{ 362{
459 coroapi::cede (); 363 coroapi::cede_to_tick ();
460 364
461 if (flags & IO_HEADER) 365 if (flags & IO_HEADER)
462 _save_header (f); 366 _save_header (f);
463 367
464 if (!spaces) 368 if (!spaces)
465 return false; 369 return false;
466 370
467 for (int i = 0; i < size (); ++i) 371 for (int i = 0; i < size (); ++i)
468 { 372 {
469#if 0 // disabled, there still seem to be races somewhere
470 static int cede_count = 0;
471
472 if (cede_count >= 500)
473 {
474 cede_count = 0;
475 coroapi::cede ();
476 }
477#endif
478
479 int unique = 0; 373 bool unique = 0;
374
480 for (object *op = spaces [i].bot; op; op = op->above) 375 for (object *op = spaces [i].bot; op; op = op->above)
481 { 376 {
482 // count per-object, but cede only when modification-safe
483 cede_count++;
484
485 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 377 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
486 unique = 1;
487 378
488 if (!op->can_map_save ()) 379 if (expect_false (!op->can_map_save ()))
489 continue; 380 continue;
490 381
491 if (unique || op->flag [FLAG_UNIQUE]) 382 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
492 { 383 {
493 if (flags & IO_UNIQUES) 384 if (flags & IO_UNIQUES)
494 op->write (f); 385 op->write (f);
495 } 386 }
496 else if (flags & IO_OBJECTS) 387 else if (expect_true (flags & IO_OBJECTS))
497 op->write (f); 388 op->write (f);
498 } 389 }
499 } 390 }
500 391
501 coroapi::cede (); 392 coroapi::cede_to_tick ();
502 393
503 return true; 394 return true;
504}
505
506bool
507maptile::_load_objects (const char *path, bool skip_header)
508{
509 object_thawer f (path);
510
511 if (!f)
512 return false;
513
514 f.next ();
515
516 if (skip_header)
517 for (;;)
518 {
519 keyword kw = f.kw;
520 f.skip ();
521 if (kw == KW_end)
522 break;
523 }
524
525 return _load_objects (f);
526} 395}
527 396
528bool 397bool
529maptile::_save_objects (const char *path, int flags) 398maptile::_save_objects (const char *path, int flags)
530{ 399{
… …
705bool 574bool
706maptile::_load_header (object_thawer &thawer) 575maptile::_load_header (object_thawer &thawer)
707{ 576{
708 for (;;) 577 for (;;)
709 { 578 {
710 keyword kw = thawer.get_kv ();
711
712 switch (kw) 579 switch (thawer.kw)
713 { 580 {
714 case KW_msg: 581 case KW_msg:
715 thawer.get_ml (KW_endmsg, msg); 582 thawer.get_ml (KW_endmsg, msg);
716 break; 583 break;
717 584
… …
749 case KW_winddir: thawer.get (winddir); break; 616 case KW_winddir: thawer.get (winddir); break;
750 case KW_sky: thawer.get (sky); break; 617 case KW_sky: thawer.get (sky); break;
751 618
752 case KW_per_player: thawer.get (per_player); break; 619 case KW_per_player: thawer.get (per_player); break;
753 case KW_per_party: thawer.get (per_party); break; 620 case KW_per_party: thawer.get (per_party); break;
621 case KW_no_reset: thawer.get (no_reset); break;
754 622
755 case KW_region: default_region = region::find (thawer.get_str ()); break; 623 case KW_region: default_region = region::find (thawer.get_str ()); break;
756 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 624 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
757 625
758 // old names new names 626 // old names new names
… …
769 case KW_tile_path_1: thawer.get (tile_path [0]); break; 637 case KW_tile_path_1: thawer.get (tile_path [0]); break;
770 case KW_tile_path_2: thawer.get (tile_path [1]); break; 638 case KW_tile_path_2: thawer.get (tile_path [1]); break;
771 case KW_tile_path_3: thawer.get (tile_path [2]); break; 639 case KW_tile_path_3: thawer.get (tile_path [2]); break;
772 case KW_tile_path_4: thawer.get (tile_path [3]); break; 640 case KW_tile_path_4: thawer.get (tile_path [3]); break;
773 641
642 case KW_ERROR:
643 set_key_text (thawer.kw_str, thawer.value);
644 break;
645
774 case KW_end: 646 case KW_end:
647 thawer.next ();
775 return true; 648 return true;
776 649
777 default: 650 default:
778 if (!thawer.parse_error ("map", 0)) 651 if (!thawer.parse_error ("map", 0))
779 return false; 652 return false;
780 break; 653 break;
781 } 654 }
655
656 thawer.next ();
782 } 657 }
783 658
784 abort (); 659 abort ();
785}
786
787bool
788maptile::_load_header (const char *path)
789{
790 object_thawer thawer (path);
791
792 if (!thawer)
793 return false;
794
795 return _load_header (thawer);
796} 660}
797 661
798/****************************************************************************** 662/******************************************************************************
799 * This is the start of unique map handling code 663 * This is the start of unique map handling code
800 *****************************************************************************/ 664 *****************************************************************************/
… …
811 object *above = op->above; 675 object *above = op->above;
812 676
813 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 677 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
814 unique = 1; 678 unique = 1;
815 679
816 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 680 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
817 { 681 {
818 op->destroy_inv (false); 682 op->destroy_inv (false);
819 op->destroy (); 683 op->destroy ();
820 } 684 }
821 685
… …
835 if (name) MAP_OUT (name); 699 if (name) MAP_OUT (name);
836 MAP_OUT (swap_time); 700 MAP_OUT (swap_time);
837 MAP_OUT (reset_time); 701 MAP_OUT (reset_time);
838 MAP_OUT (reset_timeout); 702 MAP_OUT (reset_timeout);
839 MAP_OUT (fixed_resettime); 703 MAP_OUT (fixed_resettime);
704 MAP_OUT (no_reset);
840 MAP_OUT (difficulty); 705 MAP_OUT (difficulty);
841 706
842 if (default_region) MAP_OUT2 (region, default_region->name); 707 if (default_region) MAP_OUT2 (region, default_region->name);
843 708
844 if (shopitems) 709 if (shopitems)
… …
898 * Remove and free all objects in the given map. 763 * Remove and free all objects in the given map.
899 */ 764 */
900void 765void
901maptile::clear () 766maptile::clear ()
902{ 767{
903 sfree (regions, size ()), regions = 0;
904 free (regionmap), regionmap = 0;
905
906 if (spaces) 768 if (spaces)
907 { 769 {
908 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 770 for (mapspace *ms = spaces + size (); ms-- > spaces; )
909 while (object *op = ms->bot) 771 while (object *op = ms->bot)
910 { 772 {
773 // manually remove, as to not trigger anything
774 if (ms->bot = op->above)
775 ms->bot->below = 0;
776
777 op->flag [FLAG_REMOVED] = true;
778
779 object *head = op->head_ ();
911 if (op->head) 780 if (op == head)
912 op = op->head; 781 {
913
914 op->destroy_inv (false); 782 op->destroy_inv (false);
915 op->destroy (); 783 op->destroy ();
784 }
785 else if (head->map != op->map)
786 {
787 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
788 head->destroy ();
789 }
916 } 790 }
917 791
918 sfree (spaces, size ()), spaces = 0; 792 sfree (spaces, size ()), spaces = 0;
919 } 793 }
920 794
921 if (buttons) 795 if (buttons)
922 free_objectlinkpt (buttons), buttons = 0; 796 free_objectlinkpt (buttons), buttons = 0;
797
798 sfree (regions, size ()); regions = 0;
799 delete [] regionmap; regionmap = 0;
923} 800}
924 801
925void 802void
926maptile::clear_header () 803maptile::clear_header ()
927{ 804{
… …
957maptile::do_destroy () 834maptile::do_destroy ()
958{ 835{
959 attachable::do_destroy (); 836 attachable::do_destroy ();
960 837
961 clear (); 838 clear ();
839}
840
841/* decay and destroy perishable items in a map */
842void
843maptile::do_decay_objects ()
844{
845 if (!spaces)
846 return;
847
848 for (mapspace *ms = spaces + size (); ms-- > spaces; )
849 for (object *above, *op = ms->bot; op; op = above)
850 {
851 above = op->above;
852
853 bool destroy = 0;
854
855 // do not decay anything above unique floor tiles (yet :)
856 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
857 break;
858
859 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
860 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
861 || QUERY_FLAG (op, FLAG_UNIQUE)
862 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
863 || QUERY_FLAG (op, FLAG_UNPAID)
864 || op->is_alive ())
865 ; // do not decay
866 else if (op->is_weapon ())
867 {
868 op->stats.dam--;
869 if (op->stats.dam < 0)
870 destroy = 1;
871 }
872 else if (op->is_armor ())
873 {
874 op->stats.ac--;
875 if (op->stats.ac < 0)
876 destroy = 1;
877 }
878 else if (op->type == FOOD)
879 {
880 op->stats.food -= rndm (5, 20);
881 if (op->stats.food < 0)
882 destroy = 1;
883 }
884 else
885 {
886 int mat = op->materials;
887
888 if (mat & M_PAPER
889 || mat & M_LEATHER
890 || mat & M_WOOD
891 || mat & M_ORGANIC
892 || mat & M_CLOTH
893 || mat & M_LIQUID
894 || (mat & M_IRON && rndm (1, 5) == 1)
895 || (mat & M_GLASS && rndm (1, 2) == 1)
896 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
897 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
898 || (mat & M_ICE && temp > 32))
899 destroy = 1;
900 }
901
902 /* adjust overall chance below */
903 if (destroy && rndm (0, 1))
904 op->destroy ();
905 }
962} 906}
963 907
964/* 908/*
965 * Updates every button on the map (by calling update_button() for them). 909 * Updates every button on the map (by calling update_button() for them).
966 */ 910 */
… …
1014 if (QUERY_FLAG (op, FLAG_GENERATOR)) 958 if (QUERY_FLAG (op, FLAG_GENERATOR))
1015 { 959 {
1016 total_exp += op->stats.exp; 960 total_exp += op->stats.exp;
1017 961
1018 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 962 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1019 total_exp += at->clone.stats.exp * 8; 963 total_exp += at->stats.exp * 8;
1020 964
1021 monster_cnt++; 965 monster_cnt++;
1022 } 966 }
1023 } 967 }
1024 968
… …
1246 vol += op->volume (); 1190 vol += op->volume ();
1247 1191
1248 return vol; 1192 return vol;
1249} 1193}
1250 1194
1251/* this updates the orig_map->tile_map[tile_num] value after finding 1195bool
1252 * the map. It also takes care of linking back the freshly found 1196maptile::tile_available (int dir, bool load)
1253 * maps tile_map values if it tiles back to this one. It returns
1254 * the value of orig_map->tile_map[tile_num].
1255 */
1256static inline maptile *
1257find_and_link (maptile *orig_map, int tile_num)
1258{ 1197{
1259 maptile *mp = orig_map->tile_map [tile_num]; 1198 if (!tile_path[dir])
1199 return 0;
1260 1200
1261 if (!mp) 1201 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1262 { 1202 return 1;
1263 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1264 1203
1265 if (!mp) 1204 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1266 { 1205 return 1;
1267 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1268 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1269 &orig_map->tile_path[tile_num], &orig_map->path);
1270 mp = new maptile (1, 1);
1271 mp->alloc ();
1272 mp->in_memory = MAP_IN_MEMORY;
1273 }
1274 }
1275 1206
1276 int dest_tile = (tile_num + 2) % 4;
1277
1278 orig_map->tile_map [tile_num] = mp;
1279
1280 // optimisation: back-link map to origin map if euclidean
1281 //TODO: non-euclidean maps MUST GO
1282 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1283 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1284
1285 return mp; 1207 return 0;
1286}
1287
1288static inline void
1289load_and_link (maptile *orig_map, int tile_num)
1290{
1291 find_and_link (orig_map, tile_num)->load_sync ();
1292} 1208}
1293 1209
1294/* this returns TRUE if the coordinates (x,y) are out of 1210/* this returns TRUE if the coordinates (x,y) are out of
1295 * map m. This function also takes into account any 1211 * map m. This function also takes into account any
1296 * tiling considerations, loading adjacant maps as needed. 1212 * tiling considerations, loading adjacant maps as needed.
… …
1309 if (!m) 1225 if (!m)
1310 return 0; 1226 return 0;
1311 1227
1312 if (x < 0) 1228 if (x < 0)
1313 { 1229 {
1314 if (!m->tile_path[3]) 1230 if (!m->tile_available (3))
1315 return 1; 1231 return 1;
1316 1232
1317 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1318 find_and_link (m, 3);
1319
1320 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1233 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1321 } 1234 }
1322 1235
1323 if (x >= m->width) 1236 if (x >= m->width)
1324 { 1237 {
1325 if (!m->tile_path[1]) 1238 if (!m->tile_available (1))
1326 return 1; 1239 return 1;
1327 1240
1328 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1329 find_and_link (m, 1);
1330
1331 return out_of_map (m->tile_map[1], x - m->width, y); 1241 return out_of_map (m->tile_map[1], x - m->width, y);
1332 } 1242 }
1333 1243
1334 if (y < 0) 1244 if (y < 0)
1335 { 1245 {
1336 if (!m->tile_path[0]) 1246 if (!m->tile_available (0))
1337 return 1; 1247 return 1;
1338 1248
1339 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1340 find_and_link (m, 0);
1341
1342 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1249 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1343 } 1250 }
1344 1251
1345 if (y >= m->height) 1252 if (y >= m->height)
1346 { 1253 {
1347 if (!m->tile_path[2]) 1254 if (!m->tile_available (2))
1348 return 1; 1255 return 1;
1349
1350 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1351 find_and_link (m, 2);
1352 1256
1353 return out_of_map (m->tile_map[2], x, y - m->height); 1257 return out_of_map (m->tile_map[2], x, y - m->height);
1354 } 1258 }
1355 1259
1356 /* Simple case - coordinates are within this local 1260 /* Simple case - coordinates are within this local
… …
1370maptile * 1274maptile *
1371maptile::xy_find (sint16 &x, sint16 &y) 1275maptile::xy_find (sint16 &x, sint16 &y)
1372{ 1276{
1373 if (x < 0) 1277 if (x < 0)
1374 { 1278 {
1375 if (!tile_path[3]) 1279 if (!tile_available (3))
1376 return 0; 1280 return 0;
1377 1281
1378 find_and_link (this, 3);
1379 x += tile_map[3]->width; 1282 x += tile_map[3]->width;
1380 return tile_map[3]->xy_find (x, y); 1283 return tile_map[3]->xy_find (x, y);
1381 } 1284 }
1382 1285
1383 if (x >= width) 1286 if (x >= width)
1384 { 1287 {
1385 if (!tile_path[1]) 1288 if (!tile_available (1))
1386 return 0; 1289 return 0;
1387 1290
1388 find_and_link (this, 1);
1389 x -= width; 1291 x -= width;
1390 return tile_map[1]->xy_find (x, y); 1292 return tile_map[1]->xy_find (x, y);
1391 } 1293 }
1392 1294
1393 if (y < 0) 1295 if (y < 0)
1394 { 1296 {
1395 if (!tile_path[0]) 1297 if (!tile_available (0))
1396 return 0; 1298 return 0;
1397 1299
1398 find_and_link (this, 0);
1399 y += tile_map[0]->height; 1300 y += tile_map[0]->height;
1400 return tile_map[0]->xy_find (x, y); 1301 return tile_map[0]->xy_find (x, y);
1401 } 1302 }
1402 1303
1403 if (y >= height) 1304 if (y >= height)
1404 { 1305 {
1405 if (!tile_path[2]) 1306 if (!tile_available (2))
1406 return 0; 1307 return 0;
1407 1308
1408 find_and_link (this, 2);
1409 y -= height; 1309 y -= height;
1410 return tile_map[2]->xy_find (x, y); 1310 return tile_map[2]->xy_find (x, y);
1411 } 1311 }
1412 1312
1413 /* Simple case - coordinates are within this local 1313 /* Simple case - coordinates are within this local
… …
1424adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1324adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1425{ 1325{
1426 if (!map1 || !map2) 1326 if (!map1 || !map2)
1427 return 0; 1327 return 0;
1428 1328
1429 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1329 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1430 //fix: compare paths instead (this is likely faster, too!) 1330 //fix: compare paths instead (this is likely faster, too!)
1431 if (map1 == map2) 1331 if (map1 == map2)
1432 { 1332 {
1433 *dx = 0; 1333 *dx = 0;
1434 *dy = 0; 1334 *dy = 0;
… …
1688 1588
1689 // instead of crashing in the unlikely(?) case, try to return *something* 1589 // instead of crashing in the unlikely(?) case, try to return *something*
1690 return get_archetype ("blocked"); 1590 return get_archetype ("blocked");
1691} 1591}
1692 1592
1593void
1594maptile::play_sound (faceidx sound, int x, int y) const
1595{
1596 if (!sound)
1597 return;
1598
1599 for_all_players (pl)
1600 if (pl->observe->map == this)
1601 if (client *ns = pl->ns)
1602 {
1603 int dx = x - pl->observe->x;
1604 int dy = y - pl->observe->y;
1605
1606 int distance = idistance (dx, dy);
1607
1608 if (distance <= MAX_SOUND_DISTANCE)
1609 ns->play_sound (sound, dx, dy);
1610 }
1611}
1612

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines