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.110 by root, Sun Jul 1 05:00:17 2007 UTC vs.
Revision 1.160 by root, Mon Oct 12 14:00:57 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <unistd.h> 25#include <unistd.h>
25 26
26#include "global.h" 27#include "global.h"
27#include "funcpoint.h"
28
29#include "loader.h" 28#include "loader.h"
30
31#include "path.h" 29#include "path.h"
32 30
33/* 31sint8 maptile::outdoor_darkness;
34 * This makes a path absolute outside the world of Crossfire.
35 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
36 * and returns the pointer to a static array containing the result.
37 * it really should be called create_mapname
38 */
39const char *
40create_pathname (const char *name)
41{
42 static char buf[8192];
43 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
44 return buf;
45}
46
47/*
48 * This function checks if a file with the given path exists.
49 * -1 is returned if it fails, otherwise the mode of the file
50 * is returned.
51 * It tries out all the compression suffixes listed in the uncomp[] array.
52 *
53 * If prepend_dir is set, then we call create_pathname (which prepends
54 * libdir & mapdir). Otherwise, we assume the name given is fully
55 * complete.
56 * Only the editor actually cares about the writablity of this -
57 * the rest of the code only cares that the file is readable.
58 * when the editor goes away, the call to stat should probably be
59 * replaced by an access instead (similar to the windows one, but
60 * that seems to be missing the prepend_dir processing
61 */
62int
63check_path (const char *name, int prepend_dir)
64{
65 char buf[MAX_BUF];
66
67 char *endbuf;
68 struct stat statbuf;
69 int mode = 0;
70
71 if (prepend_dir)
72 assign (buf, create_pathname (name));
73 else
74 assign (buf, name);
75
76 /* old method (strchr(buf, '\0')) seemd very odd to me -
77 * this method should be equivalant and is clearer.
78 * Can not use strcat because we need to cycle through
79 * all the names.
80 */
81 endbuf = buf + strlen (buf);
82
83 if (stat (buf, &statbuf))
84 return -1;
85 if (!S_ISREG (statbuf.st_mode))
86 return (-1);
87
88 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
89 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
90 mode |= 4;
91
92 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
93 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
94 mode |= 2;
95
96 return (mode);
97}
98 32
99/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
101 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
102 * 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
… …
232 } 166 }
233 return 0; 167 return 0;
234} 168}
235 169
236/* 170/*
237 * 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
238 * This is meant for multi space objects - for single space objecs, 172 * spot. This is meant for multi space objects - for single space objecs,
239 * just calling get_map_blocked and checking that against movement type 173 * just calling get_map_blocked and checking that against movement type
240 * of object. This function goes through all the parts of the 174 * of object. This function goes through all the parts of the multipart
241 * multipart object and makes sure they can be inserted. 175 * object and makes sure they can be inserted.
242 * 176 *
243 * 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.
244 * 178 *
245 * This function has been used to deprecate arch_out_of_map - 179 * This function has been used to deprecate arch_out_of_map -
246 * this function also does that check, and since in most cases, 180 * this function also does that check, and since in most cases,
… …
257 * 191 *
258 * Note this used to be arch_blocked, but with new movement 192 * Note this used to be arch_blocked, but with new movement
259 * 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
260 * against the move_block values. 194 * against the move_block values.
261 */ 195 */
262int 196bool
263ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 197object::blocked (maptile *m, int x, int y) const
264{ 198{
265 archetype *tmp; 199 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
266 int flag;
267 maptile *m1;
268 sint16 sx, sy;
269
270 if (!ob)
271 {
272 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
273 if (flag & P_OUT_OF_MAP)
274 return P_OUT_OF_MAP;
275
276 /* don't have object, so don't know what types would block */
277 return m1->at (sx, sy).move_block;
278 } 200 {
201 mapxy pos (m, x + tmp->x, y + tmp->y);
279 202
280 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) 203 if (!pos.normalise ())
281 { 204 return 1;
282 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
283 205
284 if (flag & P_OUT_OF_MAP) 206 mapspace &ms = *pos;
285 return P_OUT_OF_MAP; 207
286 if (flag & P_IS_ALIVE) 208 if (ms.flags () & P_IS_ALIVE)
287 return P_IS_ALIVE; 209 return 1;
288 210
289 mapspace &ms = m1->at (sx, sy); 211 /* However, often ob doesn't have any move type
290 212 * (signifying non-moving objects)
291 /* find_first_free_spot() calls this function. However, often
292 * ob doesn't have any move type (when used to place exits)
293 * 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.
294 */ 214 */
295
296 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 215 if (!move_type && ms.move_block != MOVE_ALL)
297 continue; 216 continue;
298 217
299 /* 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
300 * head of the object should correspond for the entire object. 219 * head of the object should correspond for the entire object.
301 */ 220 */
302 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 221 if (ms.blocks (move_type))
303 return P_NO_PASS; 222 return 1;
304 } 223 }
305 224
306 return 0; 225 return 0;
307} 226}
308 227
… …
326 245
327 insert_ob_in_ob (tmp, container); 246 insert_ob_in_ob (tmp, container);
328 tmp = next; 247 tmp = next;
329 } 248 }
330 249
331 /* sum_weight will go through and calculate what all the containers are 250 // go through and calculate what all the containers are carrying.
332 * carrying. 251 //TODO: remove
333 */ 252 container->update_weight ();
334 sum_weight (container);
335} 253}
336 254
337void 255void
338maptile::set_object_flag (int flag, int value) 256maptile::set_object_flag (int flag, int value)
339{ 257{
… …
341 return; 259 return;
342 260
343 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 261 for (mapspace *ms = spaces + size (); ms-- > spaces; )
344 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 262 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
345 tmp->flag [flag] = value; 263 tmp->flag [flag] = value;
264}
265
266void
267maptile::post_load_original ()
268{
269 if (!spaces)
270 return;
271
272 set_object_flag (FLAG_OBJ_ORIGINAL);
273
274 for (mapspace *ms = spaces + size (); ms-- > spaces; )
275 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
276 INVOKE_OBJECT (RESET, tmp);
346} 277}
347 278
348/* link_multipart_objects go through all the objects on the map looking 279/* link_multipart_objects go through all the objects on the map looking
349 * for objects whose arch says they are multipart yet according to the 280 * for objects whose arch says they are multipart yet according to the
350 * info we have, they only have the head (as would be expected when 281 * info we have, they only have the head (as would be expected when
… …
355{ 286{
356 if (!spaces) 287 if (!spaces)
357 return; 288 return;
358 289
359 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 290 for (mapspace *ms = spaces + size (); ms-- > spaces; )
360 for (object *op = ms->bot; op; op = op->above) 291 {
292 object *op = ms->bot;
293 while (op)
361 { 294 {
362 /* already multipart - don't do anything more */ 295 /* already multipart - don't do anything more */
363 if (op->head_ () == op && !op->more && op->arch->more) 296 if (op->head_ () == op && !op->more && op->arch->more)
364 { 297 {
365 op->remove (); 298 op->remove ();
366 op->expand_tail (); 299 op->expand_tail ();
300
301 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
302 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
303 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
367 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 304 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
305
306 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
307 // so we have to reset the iteration through the mapspace
368 } 308 }
309 else
310 op = op->above;
369 } 311 }
312 }
370} 313}
371 314
372/* 315/*
373 * Loads (ands parses) the objects into a given map from the specified 316 * Loads (ands parses) the objects into a given map from the specified
374 * file pointer. 317 * file pointer.
… …
376bool 319bool
377maptile::_load_objects (object_thawer &f) 320maptile::_load_objects (object_thawer &f)
378{ 321{
379 for (;;) 322 for (;;)
380 { 323 {
381 coroapi::cede_to_tick_every (100); // cede once in a while 324 coroapi::cede_to_tick (); // cede once in a while
382 325
383 switch (f.kw) 326 switch (f.kw)
384 { 327 {
385 case KW_arch: 328 case KW_arch:
386 if (object *op = object::read (f, this)) 329 if (object *op = object::read (f, this))
387 { 330 {
331 // TODO: why?
388 if (op->inv) 332 if (op->inv)
389 sum_weight (op); 333 op->update_weight ();
390 334
391 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 335 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
336 {
337 // we insert manually because
338 // a) its way faster
339 // b) we remove manually, too, and there are good reasons for that
340 // c) it's correct
341 mapspace &ms = at (op->x, op->y);
342
343 op->flag [FLAG_REMOVED] = false;
344
345 op->above = 0;
346 op->below = ms.top;
347
348 *(ms.top ? &ms.top->above : &ms.bot) = op;
349
350 ms.top = op;
351 ms.flags_ = 0;
352 }
353 else
354 {
355 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
356 op->destroy ();
357 }
392 } 358 }
393 359
394 continue; 360 continue;
395 361
396 case KW_EOF: 362 case KW_EOF:
… …
409} 375}
410 376
411void 377void
412maptile::activate () 378maptile::activate ()
413{ 379{
414 active = true;
415
416 if (spaces) 380 if (spaces)
417 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 381 for (mapspace *ms = spaces + size (); ms-- > spaces; )
418 for (object *op = ms->bot; op; op = op->above) 382 for (object *op = ms->bot; op; op = op->above)
419 op->activate_recursive (); 383 op->activate_recursive ();
420} 384}
421 385
422void 386void
423maptile::deactivate () 387maptile::deactivate ()
424{ 388{
425 active = false;
426
427 if (spaces) 389 if (spaces)
428 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 390 for (mapspace *ms = spaces + size (); ms-- > spaces; )
429 for (object *op = ms->bot; op; op = op->above) 391 for (object *op = ms->bot; op; op = op->above)
430 op->deactivate_recursive (); 392 op->deactivate_recursive ();
431} 393}
… …
441 if (!spaces) 403 if (!spaces)
442 return false; 404 return false;
443 405
444 for (int i = 0; i < size (); ++i) 406 for (int i = 0; i < size (); ++i)
445 { 407 {
446 int unique = 0; 408 bool unique = 0;
409
447 for (object *op = spaces [i].bot; op; op = op->above) 410 for (object *op = spaces [i].bot; op; op = op->above)
448 { 411 {
449 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 412 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
450 unique = 1;
451 413
452 if (!op->can_map_save ()) 414 if (expect_false (!op->can_map_save ()))
453 continue; 415 continue;
454 416
455 if (unique || op->flag [FLAG_UNIQUE]) 417 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
456 { 418 {
457 if (flags & IO_UNIQUES) 419 if (flags & IO_UNIQUES)
458 op->write (f); 420 op->write (f);
459 } 421 }
460 else if (flags & IO_OBJECTS) 422 else if (expect_true (flags & IO_OBJECTS))
461 op->write (f); 423 op->write (f);
462 } 424 }
463 } 425 }
464 426
465 coroapi::cede_to_tick (); 427 coroapi::cede_to_tick ();
466 428
467 return true; 429 return true;
468}
469
470bool
471maptile::_load_objects (const char *path, bool skip_header)
472{
473 object_thawer f (path);
474
475 if (!f)
476 return false;
477
478 f.next ();
479
480 if (skip_header)
481 for (;;)
482 {
483 keyword kw = f.kw;
484 f.skip ();
485 if (kw == KW_end)
486 break;
487 }
488
489 return _load_objects (f);
490} 430}
491 431
492bool 432bool
493maptile::_save_objects (const char *path, int flags) 433maptile::_save_objects (const char *path, int flags)
494{ 434{
… …
669bool 609bool
670maptile::_load_header (object_thawer &thawer) 610maptile::_load_header (object_thawer &thawer)
671{ 611{
672 for (;;) 612 for (;;)
673 { 613 {
674 thawer.next ();
675
676 switch (thawer.kw) 614 switch (thawer.kw)
677 { 615 {
678 case KW_msg: 616 case KW_msg:
679 thawer.get_ml (KW_endmsg, msg); 617 thawer.get_ml (KW_endmsg, msg);
680 break; 618 break;
… …
714 case KW_sky: thawer.get (sky); break; 652 case KW_sky: thawer.get (sky); break;
715 653
716 case KW_per_player: thawer.get (per_player); break; 654 case KW_per_player: thawer.get (per_player); break;
717 case KW_per_party: thawer.get (per_party); break; 655 case KW_per_party: thawer.get (per_party); break;
718 case KW_no_reset: thawer.get (no_reset); break; 656 case KW_no_reset: thawer.get (no_reset); break;
657 case KW_no_drop: thawer.get (no_drop); break;
719 658
720 case KW_region: default_region = region::find (thawer.get_str ()); break; 659 case KW_region: default_region = region::find (thawer.get_str ()); break;
721 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 660 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
722 661
723 // old names new names 662 // old names new names
… …
734 case KW_tile_path_1: thawer.get (tile_path [0]); break; 673 case KW_tile_path_1: thawer.get (tile_path [0]); break;
735 case KW_tile_path_2: thawer.get (tile_path [1]); break; 674 case KW_tile_path_2: thawer.get (tile_path [1]); break;
736 case KW_tile_path_3: thawer.get (tile_path [2]); break; 675 case KW_tile_path_3: thawer.get (tile_path [2]); break;
737 case KW_tile_path_4: thawer.get (tile_path [3]); break; 676 case KW_tile_path_4: thawer.get (tile_path [3]); break;
738 677
678 case KW_ERROR:
679 set_key_text (thawer.kw_str, thawer.value);
680 break;
681
739 case KW_end: 682 case KW_end:
683 thawer.next ();
740 return true; 684 return true;
741 685
742 default: 686 default:
743 if (!thawer.parse_error ("map", 0)) 687 if (!thawer.parse_error ("map", 0))
744 return false; 688 return false;
745 break; 689 break;
746 } 690 }
691
692 thawer.next ();
747 } 693 }
748 694
749 abort (); 695 abort ();
750}
751
752bool
753maptile::_load_header (const char *path)
754{
755 object_thawer thawer (path);
756
757 if (!thawer)
758 return false;
759
760 return _load_header (thawer);
761} 696}
762 697
763/****************************************************************************** 698/******************************************************************************
764 * This is the start of unique map handling code 699 * This is the start of unique map handling code
765 *****************************************************************************/ 700 *****************************************************************************/
… …
777 712
778 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 713 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
779 unique = 1; 714 unique = 1;
780 715
781 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 716 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
782 {
783 op->destroy_inv (false);
784 op->destroy (); 717 op->destroy ();
785 }
786 718
787 op = above; 719 op = above;
788 } 720 }
789 } 721 }
790} 722}
… …
801 MAP_OUT (swap_time); 733 MAP_OUT (swap_time);
802 MAP_OUT (reset_time); 734 MAP_OUT (reset_time);
803 MAP_OUT (reset_timeout); 735 MAP_OUT (reset_timeout);
804 MAP_OUT (fixed_resettime); 736 MAP_OUT (fixed_resettime);
805 MAP_OUT (no_reset); 737 MAP_OUT (no_reset);
738 MAP_OUT (no_drop);
806 MAP_OUT (difficulty); 739 MAP_OUT (difficulty);
807 740
808 if (default_region) MAP_OUT2 (region, default_region->name); 741 if (default_region) MAP_OUT2 (region, default_region->name);
809 742
810 if (shopitems) 743 if (shopitems)
… …
864 * Remove and free all objects in the given map. 797 * Remove and free all objects in the given map.
865 */ 798 */
866void 799void
867maptile::clear () 800maptile::clear ()
868{ 801{
869 sfree (regions, size ()), regions = 0;
870 free (regionmap), regionmap = 0;
871
872 if (spaces) 802 if (spaces)
873 { 803 {
874 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 804 for (mapspace *ms = spaces + size (); ms-- > spaces; )
875 while (object *op = ms->bot) 805 while (object *op = ms->bot)
876 { 806 {
807 // manually remove, as to not trigger anything
808 if (ms->bot = op->above)
809 ms->bot->below = 0;
810
811 op->flag [FLAG_REMOVED] = true;
812
877 op = op->head_ (); 813 object *head = op->head_ ();
878 op->destroy_inv (false); 814 if (op == head)
879 op->destroy (); 815 op->destroy ();
816 else if (head->map != op->map)
817 {
818 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
819 head->destroy ();
820 }
880 } 821 }
881 822
882 sfree (spaces, size ()), spaces = 0; 823 sfree0 (spaces, size ());
883 } 824 }
884 825
885 if (buttons) 826 if (buttons)
886 free_objectlinkpt (buttons), buttons = 0; 827 free_objectlinkpt (buttons), buttons = 0;
828
829 sfree0 (regions, size ());
830 delete [] regionmap; regionmap = 0;
887} 831}
888 832
889void 833void
890maptile::clear_header () 834maptile::clear_header ()
891{ 835{
… …
943 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 887 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
944 break; 888 break;
945 889
946 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 890 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
947 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 891 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
948 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
949 || QUERY_FLAG (op, FLAG_UNIQUE) 892 || QUERY_FLAG (op, FLAG_UNIQUE)
950 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 893 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
951 || QUERY_FLAG (op, FLAG_UNPAID) 894 || QUERY_FLAG (op, FLAG_UNPAID)
952 || op->is_alive ()) 895 || op->is_alive ())
953 ; // do not decay 896 ; // do not decay
… …
992 op->destroy (); 935 op->destroy ();
993 } 936 }
994} 937}
995 938
996/* 939/*
997 * Updates every button on the map (by calling update_button() for them).
998 */
999void
1000maptile::update_buttons ()
1001{
1002 for (oblinkpt *obp = buttons; obp; obp = obp->next)
1003 for (objectlink *ol = obp->link; ol; ol = ol->next)
1004 {
1005 if (!ol->ob)
1006 {
1007 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
1008 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
1009 continue;
1010 }
1011
1012 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
1013 {
1014 update_button (ol->ob);
1015 break;
1016 }
1017 }
1018}
1019
1020/*
1021 * This routine is supposed to find out the difficulty of the map. 940 * This routine is supposed to find out the difficulty of the map.
1022 * difficulty does not have a lot to do with character level, 941 * difficulty does not have a lot to do with character level,
1023 * but does have a lot to do with treasure on the map. 942 * but does have a lot to do with treasure on the map.
1024 * 943 *
1025 * Difficulty can now be set by the map creature. If the value stored 944 * Difficulty can now be set by the map creator. If the value stored
1026 * in the map is zero, then use this routine. Maps should really 945 * in the map is zero, then use this routine. Maps should really
1027 * have a difficulty set than using this function - human calculation 946 * have a difficulty set rather than using this function - human calculation
1028 * is much better than this functions guesswork. 947 * is much better than this function's guesswork.
1029 */ 948 */
1030int 949int
1031maptile::estimate_difficulty () const 950maptile::estimate_difficulty () const
1032{ 951{
1033 long monster_cnt = 0; 952 long monster_cnt = 0;
… …
1045 964
1046 if (QUERY_FLAG (op, FLAG_GENERATOR)) 965 if (QUERY_FLAG (op, FLAG_GENERATOR))
1047 { 966 {
1048 total_exp += op->stats.exp; 967 total_exp += op->stats.exp;
1049 968
1050 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 969 if (archetype *at = op->other_arch)
970 {
1051 total_exp += at->stats.exp * 8; 971 total_exp += at->stats.exp * 8;
1052
1053 monster_cnt++; 972 monster_cnt++;
973 }
974
975 for (object *inv = op->inv; inv; inv = inv->below)
976 {
977 total_exp += op->stats.exp * 8;
978 monster_cnt++;
979 }
1054 } 980 }
1055 } 981 }
1056 982
1057 avgexp = (double) total_exp / monster_cnt; 983 avgexp = (double) total_exp / monster_cnt;
1058 984
… …
1071 * postive values make it darker, negative make it brighter 997 * postive values make it darker, negative make it brighter
1072 */ 998 */
1073int 999int
1074maptile::change_map_light (int change) 1000maptile::change_map_light (int change)
1075{ 1001{
1076 int new_level = darkness + change;
1077
1078 /* Nothing to do */ 1002 /* Nothing to do */
1079 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1003 if (!change)
1080 return 0; 1004 return 0;
1081 1005
1082 /* inform all players on the map */ 1006 /* inform all players on the map */
1083 if (change > 0) 1007 if (change > 0)
1084 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1008 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1085 else 1009 else
1086 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1010 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1087 1011
1088 /* Do extra checking. since darkness is a unsigned value, 1012 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1089 * we need to be extra careful about negative values.
1090 * In general, the checks below are only needed if change
1091 * is not +/-1
1092 */
1093 if (new_level < 0)
1094 darkness = 0;
1095 else if (new_level >= MAX_DARKNESS)
1096 darkness = MAX_DARKNESS;
1097 else
1098 darkness = new_level;
1099 1013
1100 /* All clients need to get re-updated for the change */ 1014 /* All clients need to get re-updated for the change */
1101 update_all_map_los (this); 1015 update_all_map_los (this);
1016
1102 return 1; 1017 return 1;
1103} 1018}
1104 1019
1105/* 1020/*
1106 * This function updates various attributes about a specific space 1021 * This function updates various attributes about a specific space
… …
1109 * through, etc) 1024 * through, etc)
1110 */ 1025 */
1111void 1026void
1112mapspace::update_ () 1027mapspace::update_ ()
1113{ 1028{
1114 object *tmp, *last = 0; 1029 object *last = 0;
1115 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1030 uint8 flags = P_UPTODATE, anywhere = 0;
1031 sint8 light = 0;
1116 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1032 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1117 1033
1118 //object *middle = 0; 1034 //object *middle = 0;
1119 //object *top = 0; 1035 //object *top = 0;
1120 //object *floor = 0; 1036 //object *floor = 0;
1121 // this seems to generate better code than using locals, above 1037 // this seems to generate better code than using locals, above
1122 object *&top = faces_obj[0] = 0; 1038 object *&top = faces_obj[0] = 0;
1123 object *&middle = faces_obj[1] = 0; 1039 object *&middle = faces_obj[1] = 0;
1124 object *&floor = faces_obj[2] = 0; 1040 object *&floor = faces_obj[2] = 0;
1125 1041
1126 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1042 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1127 { 1043 {
1128 /* This could be made additive I guess (two lights better than 1044 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1129 * one). But if so, it shouldn't be a simple additive - 2
1130 * light bulbs do not illuminate twice as far as once since
1131 * it is a dissapation factor that is cubed.
1132 */
1133 if (tmp->glow_radius > light)
1134 light = tmp->glow_radius; 1045 light += tmp->glow_radius;
1135 1046
1136 /* This call is needed in order to update objects the player 1047 /* This call is needed in order to update objects the player
1137 * is standing in that have animations (ie, grass, fire, etc). 1048 * is standing in that have animations (ie, grass, fire, etc).
1138 * However, it also causes the look window to be re-drawn 1049 * However, it also causes the look window to be re-drawn
1139 * 3 times each time the player moves, because many of the 1050 * 3 times each time the player moves, because many of the
… …
1158 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1069 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1159 { 1070 {
1160 middle = tmp; 1071 middle = tmp;
1161 anywhere = 1; 1072 anywhere = 1;
1162 } 1073 }
1074
1163 /* Find the highest visible face around. If equal 1075 /* Find the highest visible face around. If equal
1164 * visibilities, we still want the one nearer to the 1076 * visibilities, we still want the one nearer to the
1165 * top 1077 * top
1166 */ 1078 */
1167 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1079 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1186 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1098 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1187 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1099 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1188 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1100 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1189 } 1101 }
1190 1102
1191 this->light = light; 1103 this->light = min (light, MAX_LIGHT_RADIUS);
1192 this->flags_ = flags; 1104 this->flags_ = flags;
1193 this->move_block = move_block & ~move_allow; 1105 this->move_block = move_block & ~move_allow;
1194 this->move_on = move_on; 1106 this->move_on = move_on;
1195 this->move_off = move_off; 1107 this->move_off = move_off;
1196 this->move_slow = move_slow; 1108 this->move_slow = move_slow;
… …
1216 * 1) top face is set, need middle to be set. 1128 * 1) top face is set, need middle to be set.
1217 * 2) middle is set, need to set top. 1129 * 2) middle is set, need to set top.
1218 * 3) neither middle or top is set - need to set both. 1130 * 3) neither middle or top is set - need to set both.
1219 */ 1131 */
1220 1132
1221 for (tmp = last; tmp; tmp = tmp->below) 1133 for (object *tmp = last; tmp; tmp = tmp->below)
1222 { 1134 {
1223 /* Once we get to a floor, stop, since we already have a floor object */ 1135 /* Once we get to a floor, stop, since we already have a floor object */
1224 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1136 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1225 break; 1137 break;
1226 1138
… …
1278 vol += op->volume (); 1190 vol += op->volume ();
1279 1191
1280 return vol; 1192 return vol;
1281} 1193}
1282 1194
1283/* this updates the orig_map->tile_map[tile_num] value after finding 1195maptile *
1284 * the map. It also takes care of linking back the freshly found 1196maptile::tile_available (int dir, bool load)
1285 * maps tile_map values if it tiles back to this one. It returns
1286 * the value of orig_map->tile_map[tile_num].
1287 */
1288static inline maptile *
1289find_and_link (maptile *orig_map, int tile_num)
1290{ 1197{
1291 maptile *mp = orig_map->tile_map [tile_num]; 1198 if (tile_path[dir])
1292
1293 if (!mp)
1294 {
1295 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1296
1297 if (!mp)
1298 {
1299 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1300 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1301 &orig_map->tile_path[tile_num], &orig_map->path);
1302 mp = new maptile (1, 1);
1303 mp->alloc ();
1304 mp->in_memory = MAP_IN_MEMORY;
1305 }
1306 } 1199 {
1200 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1201 return tile_map[dir];
1307 1202
1308 int dest_tile = (tile_num + 2) % 4; 1203 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1204 return tile_map[dir];
1205 }
1309 1206
1310 orig_map->tile_map [tile_num] = mp;
1311
1312 // optimisation: back-link map to origin map if euclidean
1313 //TODO: non-euclidean maps MUST GO
1314 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1315 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1316
1317 return mp; 1207 return 0;
1318}
1319
1320static inline void
1321load_and_link (maptile *orig_map, int tile_num)
1322{
1323 find_and_link (orig_map, tile_num)->load_sync ();
1324} 1208}
1325 1209
1326/* this returns TRUE if the coordinates (x,y) are out of 1210/* this returns TRUE if the coordinates (x,y) are out of
1327 * map m. This function also takes into account any 1211 * map m. This function also takes into account any
1328 * tiling considerations, loading adjacant maps as needed. 1212 * tiling considerations, loading adjacant maps as needed.
… …
1341 if (!m) 1225 if (!m)
1342 return 0; 1226 return 0;
1343 1227
1344 if (x < 0) 1228 if (x < 0)
1345 { 1229 {
1346 if (!m->tile_path[3]) 1230 if (!m->tile_available (3))
1347 return 1; 1231 return 1;
1348 1232
1349 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1350 find_and_link (m, 3);
1351
1352 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);
1353 } 1234 }
1354 1235
1355 if (x >= m->width) 1236 if (x >= m->width)
1356 { 1237 {
1357 if (!m->tile_path[1]) 1238 if (!m->tile_available (1))
1358 return 1; 1239 return 1;
1359 1240
1360 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1361 find_and_link (m, 1);
1362
1363 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);
1364 } 1242 }
1365 1243
1366 if (y < 0) 1244 if (y < 0)
1367 { 1245 {
1368 if (!m->tile_path[0]) 1246 if (!m->tile_available (0))
1369 return 1; 1247 return 1;
1370 1248
1371 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1372 find_and_link (m, 0);
1373
1374 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);
1375 } 1250 }
1376 1251
1377 if (y >= m->height) 1252 if (y >= m->height)
1378 { 1253 {
1379 if (!m->tile_path[2]) 1254 if (!m->tile_available (2))
1380 return 1; 1255 return 1;
1381
1382 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1383 find_and_link (m, 2);
1384 1256
1385 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);
1386 } 1258 }
1387 1259
1388 /* Simple case - coordinates are within this local 1260 /* Simple case - coordinates are within this local
… …
1402maptile * 1274maptile *
1403maptile::xy_find (sint16 &x, sint16 &y) 1275maptile::xy_find (sint16 &x, sint16 &y)
1404{ 1276{
1405 if (x < 0) 1277 if (x < 0)
1406 { 1278 {
1407 if (!tile_path[3]) 1279 if (!tile_available (3))
1408 return 0; 1280 return 0;
1409 1281
1410 find_and_link (this, 3);
1411 x += tile_map[3]->width; 1282 x += tile_map[3]->width;
1412 return tile_map[3]->xy_find (x, y); 1283 return tile_map[3]->xy_find (x, y);
1413 } 1284 }
1414 1285
1415 if (x >= width) 1286 if (x >= width)
1416 { 1287 {
1417 if (!tile_path[1]) 1288 if (!tile_available (1))
1418 return 0; 1289 return 0;
1419 1290
1420 find_and_link (this, 1);
1421 x -= width; 1291 x -= width;
1422 return tile_map[1]->xy_find (x, y); 1292 return tile_map[1]->xy_find (x, y);
1423 } 1293 }
1424 1294
1425 if (y < 0) 1295 if (y < 0)
1426 { 1296 {
1427 if (!tile_path[0]) 1297 if (!tile_available (0))
1428 return 0; 1298 return 0;
1429 1299
1430 find_and_link (this, 0);
1431 y += tile_map[0]->height; 1300 y += tile_map[0]->height;
1432 return tile_map[0]->xy_find (x, y); 1301 return tile_map[0]->xy_find (x, y);
1433 } 1302 }
1434 1303
1435 if (y >= height) 1304 if (y >= height)
1436 { 1305 {
1437 if (!tile_path[2]) 1306 if (!tile_available (2))
1438 return 0; 1307 return 0;
1439 1308
1440 find_and_link (this, 2);
1441 y -= height; 1309 y -= height;
1442 return tile_map[2]->xy_find (x, y); 1310 return tile_map[2]->xy_find (x, y);
1443 } 1311 }
1444 1312
1445 /* Simple case - coordinates are within this local 1313 /* Simple case - coordinates are within this local
… …
1456adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1324adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1457{ 1325{
1458 if (!map1 || !map2) 1326 if (!map1 || !map2)
1459 return 0; 1327 return 0;
1460 1328
1461 //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
1462 //fix: compare paths instead (this is likely faster, too!) 1330 //fix: compare paths instead (this is likely faster, too!)
1463 if (map1 == map2) 1331 if (map1 == map2)
1464 { 1332 {
1465 *dx = 0; 1333 *dx = 0;
1466 *dy = 0; 1334 *dy = 0;
… …
1648 else 1516 else
1649 { 1517 {
1650 retval->distance_x += op2->x - x; 1518 retval->distance_x += op2->x - x;
1651 retval->distance_y += op2->y - y; 1519 retval->distance_y += op2->y - y;
1652 1520
1653 retval->part = NULL; 1521 retval->part = 0;
1654 retval->distance = idistance (retval->distance_x, retval->distance_y); 1522 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1655 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1523 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1656 } 1524 }
1657} 1525}
1658 1526
1659/* Returns true of op1 and op2 are effectively on the same map 1527/* Returns true of op1 and op2 are effectively on the same map
… …
1673} 1541}
1674 1542
1675object * 1543object *
1676maptile::insert (object *op, int x, int y, object *originator, int flags) 1544maptile::insert (object *op, int x, int y, object *originator, int flags)
1677{ 1545{
1678 if (!op->flag [FLAG_REMOVED])
1679 op->remove ();
1680
1681 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1546 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1682} 1547}
1683 1548
1684region * 1549region *
1685maptile::region (int x, int y) const 1550maptile::region (int x, int y) const
… …
1695 1560
1696 return ::region::default_region (); 1561 return ::region::default_region ();
1697} 1562}
1698 1563
1699/* picks a random object from a style map. 1564/* picks a random object from a style map.
1700 * Redone by MSW so it should be faster and not use static
1701 * variables to generate tables.
1702 */ 1565 */
1703object * 1566object *
1704maptile::pick_random_object () const 1567maptile::pick_random_object (rand_gen &gen) const
1705{ 1568{
1706 /* while returning a null object will result in a crash, that 1569 /* while returning a null object will result in a crash, that
1707 * is actually preferable to an infinite loop. That is because 1570 * is actually preferable to an infinite loop. That is because
1708 * most servers will automatically restart in case of crash. 1571 * most servers will automatically restart in case of crash.
1709 * Change the logic on getting the random space - shouldn't make 1572 * Change the logic on getting the random space - shouldn't make
1710 * any difference, but this seems clearer to me. 1573 * any difference, but this seems clearer to me.
1711 */ 1574 */
1712 for (int i = 1000; --i;) 1575 for (int i = 1000; --i;)
1713 { 1576 {
1714 object *pick = at (rndm (width), rndm (height)).bot; 1577 object *pick = at (gen (width), gen (height)).bot;
1715 1578
1716 // do not prefer big monsters just because they are big. 1579 // do not prefer big monsters just because they are big.
1717 if (pick && pick->head_ () == pick) 1580 if (pick && pick->is_head ())
1718 return pick->head_ (); 1581 return pick->head_ ();
1719 } 1582 }
1720 1583
1721 // instead of crashing in the unlikely(?) case, try to return *something* 1584 // instead of crashing in the unlikely(?) case, try to return *something*
1722 return get_archetype ("blocked"); 1585 return archetype::find ("bug");
1723} 1586}
1724 1587
1588void
1589maptile::play_sound (faceidx sound, int x, int y) const
1590{
1591 if (!sound)
1592 return;
1593
1594 for_all_players_on_map (pl, this)
1595 if (client *ns = pl->ns)
1596 {
1597 int dx = x - pl->ob->x;
1598 int dy = y - pl->ob->y;
1599
1600 int distance = idistance (dx, dy);
1601
1602 if (distance <= MAX_SOUND_DISTANCE)
1603 ns->play_sound (sound, dx, dy);
1604 }
1605}
1606
1607void
1608maptile::say_msg (const char *msg, int x, int y) const
1609{
1610 for_all_players (pl)
1611 if (client *ns = pl->ns)
1612 {
1613 int dx = x - pl->ob->x;
1614 int dy = y - pl->ob->y;
1615
1616 int distance = idistance (dx, dy);
1617
1618 if (distance <= MAX_SOUND_DISTANCE)
1619 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1620 }
1621}
1622
1623static void
1624split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1625{
1626 // clip to map to the left
1627 if (x0 < 0)
1628 {
1629 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1630 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1631
1632 if (x1 < 0) // entirely to the left
1633 return;
1634
1635 x0 = 0;
1636 }
1637
1638 // clip to map to the right
1639 if (x1 > m->width)
1640 {
1641 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1642 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1643
1644 if (x0 > m->width) // entirely to the right
1645 return;
1646
1647 x1 = m->width;
1648 }
1649
1650 // clip to map above
1651 if (y0 < 0)
1652 {
1653 if (maptile *tile = m->tile_available (TILE_UP, 1))
1654 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1655
1656 if (y1 < 0) // entirely above
1657 return;
1658
1659 y0 = 0;
1660 }
1661
1662 // clip to map below
1663 if (y1 > m->height)
1664 {
1665 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1666 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1667
1668 if (y0 > m->height) // entirely below
1669 return;
1670
1671 y1 = m->height;
1672 }
1673
1674 // if we get here, the rect is within the current map
1675 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1676
1677 r->m = m;
1678 r->x0 = x0;
1679 r->y0 = y0;
1680 r->x1 = x1;
1681 r->y1 = y1;
1682 r->dx = dx;
1683 r->dy = dy;
1684}
1685
1686maprect *
1687maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1688{
1689 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1690 buf.clear ();
1691
1692 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1693
1694 // add end marker
1695 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1696 r->m = 0;
1697
1698 return (maprect *)buf.linearise ();
1699}
1700

Diff Legend

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