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.43 by root, Thu Dec 14 22:45:40 2006 UTC vs.
Revision 1.55 by root, Wed Dec 27 18:09:48 2006 UTC

… …
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 20
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22*/
23 23
24
25#include <global.h> 24#include <global.h>
26#include <funcpoint.h> 25#include <funcpoint.h>
27 26
28#include <loader.h> 27#include <loader.h>
29#include <unistd.h> 28#include <unistd.h>
30 29
31#include "path.h" 30#include "path.h"
32
33 31
34/* 32/*
35 * Returns the maptile which has a name matching the given argument. 33 * Returns the maptile which has a name matching the given argument.
36 * return NULL if no match is found. 34 * return NULL if no match is found.
37 */ 35 */
38
39maptile * 36maptile *
40has_been_loaded (const char *name) 37has_been_loaded (const char *name)
41{ 38{
42 maptile *map;
43
44 if (!name || !*name) 39 if (!name || !*name)
45 return 0; 40 return 0;
46 for (map = first_map; map; map = map->next) 41
42 for_all_maps (map)
47 if (!strcmp (name, map->path)) 43 if (!strcmp (name, map->path))
48 break;
49 return (map); 44 return map;
45
46 return 0;
50} 47}
51 48
52/* 49/*
53 * This makes a path absolute outside the world of Crossfire. 50 * This makes a path absolute outside the world of Crossfire.
54 * In other words, it prepends LIBDIR/MAPDIR/ to the given path 51 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
… …
197 194
198void 195void
199dump_map (const maptile *m) 196dump_map (const maptile *m)
200{ 197{
201 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); 198 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
202 LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m)); 199 LOG (llevError, "Size: %dx%d Start: %d,%d\n", m->width, m->height, m->enter_x, m->enter_y);
203 200
204 if (m->msg != NULL) 201 if (m->msg != NULL)
205 LOG (llevError, "Message:\n%s", m->msg); 202 LOG (llevError, "Message:\n%s", m->msg);
206 203
207 if (m->maplore != NULL) 204 if (m->maplore != NULL)
… …
221 */ 218 */
222 219
223void 220void
224dump_all_maps (void) 221dump_all_maps (void)
225{ 222{
226 maptile *m; 223 for_all_maps (m)
227
228 for (m = first_map; m != NULL; m = m->next)
229 {
230 dump_map (m); 224 dump_map (m);
231 }
232} 225}
233 226
234/* This rolls up wall, blocks_magic, blocks_view, etc, all into 227/* This rolls up wall, blocks_magic, blocks_view, etc, all into
235 * one function that just returns a P_.. value (see map.h) 228 * one function that just returns a P_.. value (see map.h)
236 * it will also do map translation for tiled maps, returning 229 * it will also do map translation for tiled maps, returning
… …
240 * is needed. The case of not passing values is if we're just 233 * is needed. The case of not passing values is if we're just
241 * checking for the existence of something on those spaces, but 234 * checking for the existence of something on those spaces, but
242 * don't expect to insert/remove anything from those spaces. 235 * don't expect to insert/remove anything from those spaces.
243 */ 236 */
244int 237int
245get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) 238get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
246{ 239{
247 sint16 newx, newy; 240 sint16 newx, newy;
248 int retval = 0; 241 int retval = 0;
249 maptile *mp; 242 maptile *mp;
250 243
251 if (out_of_map (oldmap, x, y))
252 return P_OUT_OF_MAP;
253 newx = x; 244 newx = x;
254 newy = y; 245 newy = y;
246
255 mp = get_map_from_coord (oldmap, &newx, &newy); 247 mp = get_map_from_coord (oldmap, &newx, &newy);
248
249 if (!mp)
250 return P_OUT_OF_MAP;
251
256 if (mp != oldmap) 252 if (mp != oldmap)
257 retval |= P_NEW_MAP; 253 retval |= P_NEW_MAP;
258 if (newmap)
259 *newmap = mp;
260 if (nx)
261 *nx = newx;
262 if (ny)
263 *ny = newy;
264 254
265 retval |= mp->spaces[newx + mp->width * newy].flags; 255 if (newmap) *newmap = mp;
256 if (nx) *nx = newx;
257 if (ny) *ny = newy;
266 258
267 return retval; 259 return retval | mp->at (newx, newy).flags ();
268} 260}
269 261
270/* 262/*
271 * Returns true if the given coordinate is blocked except by the 263 * Returns true if the given coordinate is blocked except by the
272 * object passed is not blocking. This is used with 264 * object passed is not blocking. This is used with
… …
295 } 287 }
296 288
297 /* Save some cycles - instead of calling get_map_flags(), just get the value 289 /* Save some cycles - instead of calling get_map_flags(), just get the value
298 * directly. 290 * directly.
299 */ 291 */
300 mflags = m->spaces[sx + m->width * sy].flags; 292 mflags = m->at (sx, sy).flags ();
301 293
302 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 294 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);
303 295
304 /* If space is currently not blocked by anything, no need to 296 /* If space is currently not blocked by anything, no need to
305 * go further. Not true for players - all sorts of special 297 * go further. Not true for players - all sorts of special
… …
324 /* We basically go through the stack of objects, and if there is 316 /* We basically go through the stack of objects, and if there is
325 * some other object that has NO_PASS or FLAG_ALIVE set, return 317 * some other object that has NO_PASS or FLAG_ALIVE set, return
326 * true. If we get through the entire stack, that must mean 318 * true. If we get through the entire stack, that must mean
327 * ob is blocking it, so return 0. 319 * ob is blocking it, so return 0.
328 */ 320 */
329 for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above) 321 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)
330 { 322 {
331 323
332 /* This must be before the checks below. Code for inventory checkers. */ 324 /* This must be before the checks below. Code for inventory checkers. */
333 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 325 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
334 { 326 {
… …
398 * 390 *
399 * Note this used to be arch_blocked, but with new movement 391 * Note this used to be arch_blocked, but with new movement
400 * code, we need to have actual object to check its move_type 392 * code, we need to have actual object to check its move_type
401 * against the move_block values. 393 * against the move_block values.
402 */ 394 */
403
404int 395int
405ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 396ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
406{ 397{
407 archetype *tmp; 398 archetype *tmp;
408 int flag; 399 int flag;
… …
414 flag = get_map_flags (m, &m1, x, y, &sx, &sy); 405 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
415 if (flag & P_OUT_OF_MAP) 406 if (flag & P_OUT_OF_MAP)
416 return P_OUT_OF_MAP; 407 return P_OUT_OF_MAP;
417 408
418 /* don't have object, so don't know what types would block */ 409 /* don't have object, so don't know what types would block */
419 return (GET_MAP_MOVE_BLOCK (m1, sx, sy)); 410 return m1->at (sx, sy).move_block;
420 } 411 }
421 412
422 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more) 413 for (tmp = ob->arch; tmp; tmp = tmp->more)
423 { 414 {
424 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 415 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
425 416
426 if (flag & P_OUT_OF_MAP) 417 if (flag & P_OUT_OF_MAP)
427 return P_OUT_OF_MAP; 418 return P_OUT_OF_MAP;
428 if (flag & P_IS_ALIVE) 419 if (flag & P_IS_ALIVE)
429 return P_IS_ALIVE; 420 return P_IS_ALIVE;
430 421
422 mapspace &ms = m1->at (sx, sy);
423
424
431 /* find_first_free_spot() calls this function. However, often 425 /* find_first_free_spot() calls this function. However, often
432 * ob doesn't have any move type (when used to place exits) 426 * ob doesn't have any move type (when used to place exits)
433 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 427 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
434 */ 428 */
435 429
436 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL) 430 if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
437 continue; 431 continue;
438 432
439 /* Note it is intentional that we check ob - the movement type of the 433 /* Note it is intentional that we check ob - the movement type of the
440 * head of the object should correspond for the entire object. 434 * head of the object should correspond for the entire object.
441 */ 435 */
442 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) 436 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
443 return AB_NO_PASS; 437 return P_NO_PASS;
444
445 } 438 }
439
446 return 0; 440 return 0;
447} 441}
448 442
449/* When the map is loaded, load_object does not actually insert objects 443/* When the map is loaded, load_object does not actually insert objects
450 * into inventory, but just links them. What this does is go through 444 * into inventory, but just links them. What this does is go through
… …
477 * for objects whose arch says they are multipart yet according to the 471 * for objects whose arch says they are multipart yet according to the
478 * info we have, they only have the head (as would be expected when 472 * info we have, they only have the head (as would be expected when
479 * they are saved). We do have to look for the old maps that did save 473 * they are saved). We do have to look for the old maps that did save
480 * the more sections and not re-add sections for them. 474 * the more sections and not re-add sections for them.
481 */ 475 */
482
483static void 476static void
484link_multipart_objects (maptile *m) 477link_multipart_objects (maptile *m)
485{ 478{
486 int x, y; 479 int x, y;
487 object *tmp, *op, *last, *above; 480 object *tmp, *op, *last, *above;
488 archetype *at; 481 archetype *at;
489 482
490 for (x = 0; x < MAP_WIDTH (m); x++) 483 for (x = 0; x < m->width; x++)
491 for (y = 0; y < MAP_HEIGHT (m); y++) 484 for (y = 0; y < m->height; y++)
492 for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above) 485 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above)
493 { 486 {
494 above = tmp->above; 487 above = tmp->above;
495 488
496 /* already multipart - don't do anything more */ 489 /* already multipart - don't do anything more */
497 if (tmp->head || tmp->more) 490 if (tmp->head || tmp->more)
… …
547 { 540 {
548 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 541 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
549 continue; 542 continue;
550 } 543 }
551 544
552
553 switch (i) 545 switch (i)
554 { 546 {
555 case LL_NORMAL: 547 case LL_NORMAL:
556 /* if we are loading an overlay, put the floors on the bottom */ 548 /* if we are loading an overlay, put the floors on the bottom */
557 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) 549 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
… …
582 { 574 {
583 for (j = 0; j < m->height; j++) 575 for (j = 0; j < m->height; j++)
584 { 576 {
585 unique = 0; 577 unique = 0;
586 /* check for unique items, or unique squares */ 578 /* check for unique items, or unique squares */
587 for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) 579 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
588 { 580 {
589 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) 581 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
590 unique = 1; 582 unique = 1;
591 583
592 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) 584 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
… …
603 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 595 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
604 * and we only save the head of multi part objects - this is needed 596 * and we only save the head of multi part objects - this is needed
605 * in order to do map tiling properly. 597 * in order to do map tiling properly.
606 */ 598 */
607void 599void
608save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag) 600save_objects (maptile *m, object_freezer &fp, object_freezer &fp2, int flag)
609{ 601{
610 int i, j = 0, unique = 0; 602 int i, j = 0, unique = 0;
611 object *op; 603 object *op;
612 604
613 /* first pass - save one-part objects */ 605 /* first pass - save one-part objects */
614 for (i = 0; i < MAP_WIDTH (m); i++) 606 for (i = 0; i < m->width; i++)
615 for (j = 0; j < MAP_HEIGHT (m); j++) 607 for (j = 0; j < m->height; j++)
616 { 608 {
617 unique = 0; 609 unique = 0;
610
618 for (op = get_map_ob (m, i, j); op; op = op->above) 611 for (op = m->at (i, j).bot; op; op = op->above)
619 { 612 {
620 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 613 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
621 unique = 1; 614 unique = 1;
622 615
623 if (op->type == PLAYER) 616 if (!op->can_map_save ())
624 {
625 LOG (llevDebug, "Player on map that is being saved\n");
626 continue;
627 }
628
629 if (op->head || op->owner)
630 continue; 617 continue;
631 618
632 if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) 619 if (unique || op->flag [FLAG_UNIQUE])
633 save_object (fp2, op, 3); 620 save_object (fp2, op, 1);
634 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) 621 else if (flag == 0 || (flag == 2 && (!op->flag [FLAG_OBJ_ORIGINAL] && !op->flag [FLAG_UNPAID])))
635 save_object (fp, op, 3); 622 save_object (fp, op, 1);
636 623 }
637 } /* for this space */ 624 }
638 } /* for this j */
639} 625}
640 626
641maptile::maptile () 627maptile::maptile ()
642{ 628{
643 in_memory = MAP_SWAPPED; 629 in_memory = MAP_SWAPPED;
630
644 /* The maps used to pick up default x and y values from the 631 /* The maps used to pick up default x and y values from the
645 * map archetype. Mimic that behaviour. 632 * map archetype. Mimic that behaviour.
646 */ 633 */
647 MAP_WIDTH (this) = 16; 634 width = 16;
648 MAP_HEIGHT (this) = 16; 635 height = 16;
649 MAP_RESET_TIMEOUT (this) = 0; 636 reset_timeout = 0;
650 MAP_TIMEOUT (this) = 300; 637 timeout = 300;
651 MAP_ENTER_X (this) = 0; 638 enter_x = 0;
652 MAP_ENTER_Y (this) = 0; 639 enter_y = 0;
653 /*set part to -1 indicating conversion to weather map not yet done */ 640 /*set part to -1 indicating conversion to weather map not yet done */
654 MAP_WORLDPARTX (this) = -1; 641 worldpartx = -1;
655 MAP_WORLDPARTY (this) = -1; 642 worldparty = -1;
643}
644
645void
646maptile::link ()
647{
648 next = first_map;
649 first_map = this;
650}
651
652void
653maptile::unlink ()
654{
655 if (first_map == this)
656 first_map = next;
657 else
658 {
659 for_all_maps (m)
660 if (m->next = this)
661 {
662 m->next = next;
663 return;
664 }
665
666 LOG (llevError, "maptile::unlink() map not on list: %s\n", path);
667 }
656} 668}
657 669
658/* 670/*
659 * Allocates, initialises, and returns a pointer to a maptile. 671 * Allocates, initialises, and returns a pointer to a maptile.
660 * Modified to no longer take a path option which was not being 672 * Modified to no longer take a path option which was not being
661 * used anyways. MSW 2001-07-01 673 * used anyways. MSW 2001-07-01
662 */ 674 */
663maptile * 675maptile *
664get_linked_map (void) 676get_linked_map (void)
665{ 677{
666 maptile *mp, *map = new maptile; 678 maptile *map = new maptile;
667 679 map->link ();
668 for (mp = first_map; mp && mp->next; mp = mp->next);
669
670 if (mp == NULL)
671 first_map = map;
672 else
673 mp->next = map;
674
675 return map; 680 return map;
676} 681}
677 682
678/* 683/*
679 * Allocates the arrays contained in a maptile. 684 * Allocates the arrays contained in a maptile.
… …
690 * that is their poor assumption. 695 * that is their poor assumption.
691 */ 696 */
692 if (spaces) 697 if (spaces)
693 { 698 {
694 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path); 699 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
695 free (spaces); 700 sfree (spaces, size ());
696 } 701 }
697 702
698 spaces = (MapSpace *) 703 spaces = salloc0<mapspace> (size ());
699 calloc (1, width * height * sizeof (MapSpace));
700
701 if (!spaces)
702 fatal (OUT_OF_MEMORY);
703} 704}
704 705
705/* Create and returns a map of the specific size. Used 706/* Create and returns a map of the specific size. Used
706 * in random map code and the editor. 707 * in random map code and the editor.
707 */ 708 */
708maptile * 709maptile *
709get_empty_map (int sizex, int sizey) 710get_empty_map (int sizex, int sizey)
710{ 711{
711 maptile *m = get_linked_map (); 712 maptile *m = get_linked_map ();
712 713
713 m->width = sizex; 714 m->width = sizex;
714 m->height = sizey; 715 m->height = sizey;
715 m->in_memory = MAP_SWAPPED; 716 m->in_memory = MAP_SWAPPED;
717
716 m->allocate (); 718 m->allocate ();
717 719
718 return m; 720 return m;
719} 721}
720 722
721/* Takes a string from a map definition and outputs a pointer to the array of shopitems 723/* Takes a string from a map definition and outputs a pointer to the array of shopitems
722 * corresponding to that string. Memory is allocated for this, it must be freed 724 * corresponding to that string. Memory is allocated for this, it must be freed
723 * at a later date. 725 * at a later date.
724 * Called by parse_map_headers below. 726 * Called by parse_map_headers below.
725 */ 727 */
726
727static shopitems * 728static shopitems *
728parse_shop_string (const char *input_string) 729parse_shop_string (const char *input_string)
729{ 730{
730 char *shop_string, *p, *q, *next_semicolon, *next_colon; 731 char *shop_string, *p, *q, *next_semicolon, *next_colon;
731 shopitems *items = NULL; 732 shopitems *items = NULL;
… …
740 p = strchr (p, ';'); 741 p = strchr (p, ';');
741 number_of_entries++; 742 number_of_entries++;
742 if (p) 743 if (p)
743 p++; 744 p++;
744 } 745 }
746
745 p = shop_string; 747 p = shop_string;
746 strip_endline (p); 748 strip_endline (p);
747 items = new shopitems[number_of_entries + 1]; 749 items = new shopitems[number_of_entries + 1];
748 for (i = 0; i < number_of_entries; i++) 750 for (i = 0; i < number_of_entries; i++)
749 { 751 {
750 if (!p) 752 if (!p)
751 { 753 {
752 LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n"); 754 LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
753 break; 755 break;
754 } 756 }
757
755 next_semicolon = strchr (p, ';'); 758 next_semicolon = strchr (p, ';');
756 next_colon = strchr (p, ':'); 759 next_colon = strchr (p, ':');
757 /* if there is a stregth specified, figure out what it is, we'll need it soon. */ 760 /* if there is a stregth specified, figure out what it is, we'll need it soon. */
758 if (next_colon && (!next_semicolon || next_colon < next_semicolon)) 761 if (next_colon && (!next_semicolon || next_colon < next_semicolon))
759 items[i].strength = atoi (strchr (p, ':') + 1); 762 items[i].strength = atoi (strchr (p, ':') + 1);
… …
786 * the next entry while we're at it, better print a warning 789 * the next entry while we're at it, better print a warning
787 */ 790 */
788 LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string); 791 LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
789 } 792 }
790 } 793 }
794
791 items[i].index = number_of_entries; 795 items[i].index = number_of_entries;
792 if (next_semicolon) 796 if (next_semicolon)
793 p = ++next_semicolon; 797 p = ++next_semicolon;
794 else 798 else
795 p = NULL; 799 p = NULL;
796 } 800 }
801
797 free (shop_string); 802 free (shop_string);
798 return items; 803 return items;
799} 804}
800 805
801/* opposite of parse string, this puts the string that was originally fed in to 806/* opposite of parse string, this puts the string that was originally fed in to
… …
810 for (i = 0; i < m->shopitems[0].index; i++) 815 for (i = 0; i < m->shopitems[0].index; i++)
811 { 816 {
812 if (m->shopitems[i].typenum) 817 if (m->shopitems[i].typenum)
813 { 818 {
814 if (m->shopitems[i].strength) 819 if (m->shopitems[i].strength)
815 {
816 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 820 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
817 }
818 else 821 else
819 sprintf (tmp, "%s;", m->shopitems[i].name); 822 sprintf (tmp, "%s;", m->shopitems[i].name);
820 } 823 }
821 else 824 else
822 { 825 {
823 if (m->shopitems[i].strength) 826 if (m->shopitems[i].strength)
824 {
825 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 827 sprintf (tmp, "*:%d;", m->shopitems[i].strength);
826 }
827 else 828 else
828 sprintf (tmp, "*"); 829 sprintf (tmp, "*");
829 } 830 }
831
830 strcat (output_string, tmp); 832 strcat (output_string, tmp);
831 } 833 }
832} 834}
833 835
834/* This loads the header information of the map. The header 836/* This loads the header information of the map. The header
… …
1102 * MAP_BLOCK, in which case we block on this load. This happens in all 1104 * MAP_BLOCK, in which case we block on this load. This happens in all
1103 * cases, no matter if this flag is set or not. 1105 * cases, no matter if this flag is set or not.
1104 * MAP_STYLE: style map - don't add active objects, don't add to server 1106 * MAP_STYLE: style map - don't add active objects, don't add to server
1105 * managed map list. 1107 * managed map list.
1106 */ 1108 */
1107
1108maptile * 1109maptile *
1109load_original_map (const char *filename, int flags) 1110load_original_map (const char *filename, int flags)
1110{ 1111{
1111 maptile *m; 1112 maptile *m;
1112 char pathname[MAX_BUF]; 1113 char pathname[MAX_BUF];
… …
1130 strcpy (m->path, filename); 1131 strcpy (m->path, filename);
1131 if (load_map_header (thawer, m)) 1132 if (load_map_header (thawer, m))
1132 { 1133 {
1133 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags); 1134 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1134 delete_map (m); 1135 delete_map (m);
1135 return NULL; 1136 return 0;
1136 } 1137 }
1137 1138
1138 m->allocate (); 1139 m->allocate ();
1139 1140
1140 m->in_memory = MAP_LOADING; 1141 m->in_memory = MAP_LOADING;
1141 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE)); 1142 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1142 1143
1143 m->in_memory = MAP_IN_MEMORY; 1144 m->in_memory = MAP_IN_MEMORY;
1144 if (!MAP_DIFFICULTY (m)) 1145 if (!m->difficulty)
1145 MAP_DIFFICULTY (m) = calculate_difficulty (m); 1146 m->difficulty = calculate_difficulty (m);
1146 set_map_reset_time (m); 1147 set_map_reset_time (m);
1147 m->instantiate (); 1148 m->instantiate ();
1148 return (m); 1149 return (m);
1149} 1150}
1150 1151
1151/* 1152/*
1152 * Loads a map, which has been loaded earlier, from file. 1153 * Loads a map, which has been loaded earlier, from file.
1153 * Return the map object we load into (this can change from the passed 1154 * Return the map object we load into (this can change from the passed
1154 * option if we can't find the original map) 1155 * option if we can't find the original map)
1155 */ 1156 */
1156
1157static maptile * 1157static maptile *
1158load_temporary_map (maptile *m) 1158load_temporary_map (maptile *m)
1159{ 1159{
1160 char buf[MAX_BUF]; 1160 char buf[MAX_BUF];
1161 1161
… …
1205/* 1205/*
1206 * Loads a map, which has been loaded earlier, from file. 1206 * Loads a map, which has been loaded earlier, from file.
1207 * Return the map object we load into (this can change from the passed 1207 * Return the map object we load into (this can change from the passed
1208 * option if we can't find the original map) 1208 * option if we can't find the original map)
1209 */ 1209 */
1210
1211maptile * 1210maptile *
1212load_overlay_map (const char *filename, maptile *m) 1211load_overlay_map (const char *filename, maptile *m)
1213{ 1212{
1214 char pathname[MAX_BUF]; 1213 char pathname[MAX_BUF];
1215 1214
… …
1223 if (load_map_header (thawer, m)) 1222 if (load_map_header (thawer, m))
1224 { 1223 {
1225 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname); 1224 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1226 delete_map (m); 1225 delete_map (m);
1227 m = load_original_map (m->path, 0); 1226 m = load_original_map (m->path, 0);
1228 return NULL; 1227 return 0;
1229 } 1228 }
1230 /*m->allocate ();*/ 1229 /*m->allocate ();*/
1231 1230
1232 m->in_memory = MAP_LOADING; 1231 m->in_memory = MAP_LOADING;
1233 load_objects (m, thawer, MAP_OVERLAY); 1232 load_objects (m, thawer, MAP_OVERLAY);
… …
1245delete_unique_items (maptile *m) 1244delete_unique_items (maptile *m)
1246{ 1245{
1247 int i, j, unique; 1246 int i, j, unique;
1248 object *op, *next; 1247 object *op, *next;
1249 1248
1250 for (i = 0; i < MAP_WIDTH (m); i++) 1249 for (i = 0; i < m->width; i++)
1251 for (j = 0; j < MAP_HEIGHT (m); j++) 1250 for (j = 0; j < m->height; j++)
1252 { 1251 {
1253 unique = 0; 1252 unique = 0;
1254 1253
1255 for (op = get_map_ob (m, i, j); op; op = next) 1254 for (op = GET_MAP_OB (m, i, j); op; op = next)
1256 { 1255 {
1257 next = op->above; 1256 next = op->above;
1258 1257
1259 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 1258 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1260 unique = 1; 1259 unique = 1;
1261 1260
1262 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 1261 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1263 { 1262 {
1264 clean_object (op); 1263 op->destroy_inv (false);
1265
1266 if (QUERY_FLAG (op, FLAG_IS_LINKED))
1267 remove_button_link (op);
1268
1269 op->destroy (); 1264 op->destroy ();
1270 } 1265 }
1271 } 1266 }
1272 } 1267 }
1273} 1268}
1274 1269
1275
1276/* 1270/*
1277 * Loads unique objects from file(s) into the map which is in memory 1271 * Loads unique objects from file(s) into the map which is in memory
1278 * m is the map to load unique items into. 1272 * m is the map to load unique items into.
1279 */ 1273 */
1280static void 1274static void
… …
1299 return; 1293 return;
1300 1294
1301 m->in_memory = MAP_LOADING; 1295 m->in_memory = MAP_LOADING;
1302 if (m->tmpname == NULL) /* if we have loaded unique items from */ 1296 if (m->tmpname == NULL) /* if we have loaded unique items from */
1303 delete_unique_items (m); /* original map before, don't duplicate them */ 1297 delete_unique_items (m); /* original map before, don't duplicate them */
1298
1304 load_objects (m, thawer, 0); 1299 load_objects (m, thawer, 0);
1305 1300
1306 m->in_memory = MAP_IN_MEMORY; 1301 m->in_memory = MAP_IN_MEMORY;
1307} 1302}
1308
1309 1303
1310/* 1304/*
1311 * Saves a map to file. If flag is set, it is saved into the same 1305 * Saves a map to file. If flag is set, it is saved into the same
1312 * file it was (originally) loaded from. Otherwise a temporary 1306 * file it was (originally) loaded from. Otherwise a temporary
1313 * filename will be genarated, and the file will be stored there. 1307 * filename will be genarated, and the file will be stored there.
1314 * The temporary filename will be stored in the maptileure. 1308 * The temporary filename will be stored in the maptileure.
1315 * If the map is unique, we also save to the filename in the map 1309 * If the map is unique, we also save to the filename in the map
1316 * (this should have been updated when first loaded) 1310 * (this should have been updated when first loaded)
1317 */ 1311 */
1318
1319int 1312int
1320new_save_map (maptile *m, int flag) 1313new_save_map (maptile *m, int flag)
1321{ 1314{
1322 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; 1315 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1323 int i; 1316 int i;
… …
1455 freezer.save (filename); 1448 freezer.save (filename);
1456 1449
1457 return 0; 1450 return 0;
1458} 1451}
1459 1452
1460
1461/*
1462 * Remove and free all objects in the inventory of the given object.
1463 * object.c ?
1464 */
1465
1466void
1467clean_object (object *op)
1468{
1469 object *tmp, *next;
1470
1471 for (tmp = op->inv; tmp; tmp = next)
1472 {
1473 next = tmp->below;
1474
1475 clean_object (tmp);
1476 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1477 remove_button_link (tmp);
1478
1479 tmp->destroy ();
1480 }
1481}
1482
1483/* 1453/*
1484 * Remove and free all objects in the given map. 1454 * Remove and free all objects in the given map.
1485 */ 1455 */
1486
1487void 1456void
1488free_all_objects (maptile *m) 1457free_all_objects (maptile *m)
1489{ 1458{
1490 int i, j; 1459 if (!m->spaces)
1491 object *op; 1460 return;
1492 1461
1493 for (i = 0; i < MAP_WIDTH (m); i++) 1462 for (int i = 0; i < m->width; i++)
1494 for (j = 0; j < MAP_HEIGHT (m); j++) 1463 for (int j = 0; j < m->height; j++)
1495 { 1464 {
1496 object *previous_obj = NULL; 1465 mapspace &ms = m->at (i, j);
1497 1466
1498 while ((op = GET_MAP_OB (m, i, j)) != NULL) 1467 while (object *op = ms.bot)
1499 { 1468 {
1500 if (op == previous_obj)
1501 {
1502 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1503 break;
1504 }
1505
1506 previous_obj = op;
1507
1508 if (op->head != NULL) 1469 if (op->head)
1509 op = op->head; 1470 op = op->head;
1510 1471
1511 /* If the map isn't in memory, free_object will remove and 1472 op->destroy_inv (false);
1512 * free objects in op's inventory. So let it do the job.
1513 */
1514 if (m->in_memory == MAP_IN_MEMORY)
1515 clean_object (op);
1516
1517 op->destroy (); 1473 op->destroy ();
1518 } 1474 }
1519 } 1475 }
1520} 1476}
1521 1477
1522/* 1478/*
1523 * Frees everything allocated by the given maptileure. 1479 * Frees everything allocated by the given maptileure.
1524 * don't free tmpname - our caller is left to do that 1480 * don't free tmpname - our caller is left to do that
1525 */ 1481 */
1526
1527void 1482void
1528free_map (maptile *m, int flag) 1483free_map (maptile *m, int flag)
1529{ 1484{
1530 int i; 1485 if (!m->in_memory) //TODO: makes no sense to me?
1531
1532 if (!m->in_memory)
1533 {
1534 LOG (llevError, "Trying to free freed map.\n");
1535 return; 1486 return;
1536 } 1487
1488 m->in_memory = MAP_SAVING;
1537 1489
1538 // TODO: use new/delete 1490 // TODO: use new/delete
1539#define FREE_AND_CLEAR(p) { free (p); p = NULL; }
1540 1491
1541 if (flag && m->spaces) 1492 if (flag && m->spaces)
1542 free_all_objects (m); 1493 free_all_objects (m);
1543 if (m->name)
1544 FREE_AND_CLEAR (m->name);
1545 if (m->spaces)
1546 FREE_AND_CLEAR (m->spaces);
1547 if (m->msg)
1548 FREE_AND_CLEAR (m->msg);
1549 if (m->maplore)
1550 FREE_AND_CLEAR (m->maplore);
1551 1494
1552 delete [] m->shopitems; 1495 sfree (m->spaces, m->size ()), m->spaces = 0;
1553 m->shopitems = 0;
1554 1496
1555 if (m->shoprace) 1497 free (m->name), m->name = 0;
1556 FREE_AND_CLEAR (m->shoprace); 1498 free (m->msg), m->msg = 0;
1499 free (m->maplore), m->maplore = 0;
1500 free (m->shoprace), m->shoprace = 0;
1501 delete [] m->shopitems, m->shopitems = 0;
1557 1502
1558 if (m->buttons) 1503 if (m->buttons)
1559 free_objectlinkpt (m->buttons); 1504 free_objectlinkpt (m->buttons), m->buttons = 0;
1560 1505
1561 m->buttons = NULL;
1562
1563 for (i = 0; i < 4; i++) 1506 for (int i = 0; i < 4; i++)
1564 { 1507 free (m->tile_path[i]), m->tile_path[i] = 0;
1565 if (m->tile_path[i])
1566 FREE_AND_CLEAR (m->tile_path[i]);
1567 m->tile_map[i] = NULL;
1568 }
1569 1508
1570 m->in_memory = MAP_SWAPPED; 1509 m->in_memory = MAP_SWAPPED;
1571
1572#undef FREE_AND_CLEAR
1573
1574} 1510}
1575 1511
1576/* 1512maptile::~maptile ()
1577 * function: vanish maptile 1513{
1578 * m : pointer to maptile, if NULL no action 1514 assert (destroyed ());
1579 * this deletes all the data on the map (freeing pointers) 1515}
1580 * and then removes this map from the global linked list of maps. 1516
1517void
1518maptile::do_destroy ()
1519{
1520 attachable::do_destroy ();
1521
1522 unlink ();
1523
1524 free_map (this, 1);
1525 free (tmpname), tmpname = 0;
1526
1527 /* We need to look through all the maps and see if any maps
1528 * are pointing at this one for tiling information. Since
1529 * tiling can be asymetric, we just can not look to see which
1530 * maps this map tiles with and clears those.
1581 */ 1531 */
1532 //TODO: non-euclidean-tiling MUST GO
1533 for_all_maps (m)
1534 for (int i = 0; i < 4; i++)
1535 if (m->tile_map[i] == this)
1536 m->tile_map[i] = 0;
1537}
1582 1538
1539//TODO: must go
1583void 1540void
1584delete_map (maptile *m) 1541delete_map (maptile *m)
1585{ 1542{
1586 maptile *tmp, *last;
1587 int i;
1588
1589 if (!m) 1543 if (m)
1590 return; 1544 m->destroy ();
1591
1592 m->clear ();
1593
1594 if (m->in_memory == MAP_IN_MEMORY)
1595 {
1596 /* change to MAP_SAVING, even though we are not,
1597 * so that remove_ob doesn't do as much work.
1598 */
1599 m->in_memory = MAP_SAVING;
1600 free_map (m, 1);
1601 }
1602 /* move this out of free_map, since tmpname can still be needed if
1603 * the map is swapped out.
1604 */
1605 if (m->tmpname)
1606 {
1607 free (m->tmpname);
1608 m->tmpname = NULL;
1609 }
1610 last = NULL;
1611 /* We need to look through all the maps and see if any maps
1612 * are pointing at this one for tiling information. Since
1613 * tiling can be assymetric, we just can not look to see which
1614 * maps this map tiles with and clears those.
1615 */
1616 for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1617 {
1618 if (tmp->next == m)
1619 last = tmp;
1620
1621 /* This should hopefully get unrolled on a decent compiler */
1622 for (i = 0; i < 4; i++)
1623 if (tmp->tile_map[i] == m)
1624 tmp->tile_map[i] = NULL;
1625 }
1626
1627 /* If last is null, then this should be the first map in the list */
1628 if (!last)
1629 {
1630 if (m == first_map)
1631 first_map = m->next;
1632 else
1633 /* m->path is a static char, so should hopefully still have
1634 * some useful data in it.
1635 */
1636 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1637 }
1638 else
1639 last->next = m->next;
1640
1641 delete m;
1642} 1545}
1643
1644
1645 1546
1646/* 1547/*
1647 * Makes sure the given map is loaded and swapped in. 1548 * Makes sure the given map is loaded and swapped in.
1648 * name is path name of the map. 1549 * name is path name of the map.
1649 * flags meaning: 1550 * flags meaning:
… …
1652 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. 1553 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1653 * dont do any more name translation on it. 1554 * dont do any more name translation on it.
1654 * 1555 *
1655 * Returns a pointer to the given map. 1556 * Returns a pointer to the given map.
1656 */ 1557 */
1657
1658maptile * 1558maptile *
1659ready_map_name (const char *name, int flags) 1559ready_map_name (const char *name, int flags)
1660{ 1560{
1661 maptile *m;
1662
1663 if (!name) 1561 if (!name)
1664 return (NULL); 1562 return 0;
1665 1563
1666 /* Have we been at this level before? */ 1564 /* Have we been at this level before? */
1667 m = has_been_loaded (name); 1565 maptile *m = has_been_loaded (name);
1668 1566
1669 /* Map is good to go, so just return it */ 1567 /* Map is good to go, so just return it */
1670 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) 1568 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1671 {
1672 return m; 1569 return m;
1673 }
1674 1570
1675 /* unique maps always get loaded from their original location, and never 1571 /* unique maps always get loaded from their original location, and never
1676 * a temp location. Likewise, if map_flush is set, or we have never loaded 1572 * a temp location. Likewise, if map_flush is set, or we have never loaded
1677 * this map, load it now. I removed the reset checking from here - 1573 * this map, load it now. I removed the reset checking from here -
1678 * it seems the probability of a player trying to enter a map that should 1574 * it seems the probability of a player trying to enter a map that should
… …
1680 * a bit cleaner (and players probably shouldn't rely on exact timing for 1576 * a bit cleaner (and players probably shouldn't rely on exact timing for
1681 * resets in any case - if they really care, they should use the 'maps command. 1577 * resets in any case - if they really care, they should use the 'maps command.
1682 */ 1578 */
1683 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m) 1579 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1684 { 1580 {
1685
1686 /* first visit or time to reset */ 1581 /* first visit or time to reset */
1687 if (m) 1582 if (m)
1688 { 1583 {
1689 clean_tmp_map (m); /* Doesn't make much difference */ 1584 clean_tmp_map (m); /* Doesn't make much difference */
1690 delete_map (m); 1585 delete_map (m);
… …
1694 if (flags & MAP_PLAYER_UNIQUE) 1589 if (flags & MAP_PLAYER_UNIQUE)
1695 LOG (llevDebug, "Trying to load map %s.\n", name); 1590 LOG (llevDebug, "Trying to load map %s.\n", name);
1696 else 1591 else
1697 LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name)); 1592 LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));
1698 1593
1699 //eval_pv ("$x = Event::time", 1);//D
1700 if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE)))) 1594 if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))
1701 return (NULL); 1595 return (NULL);
1702 //eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D
1703 1596
1704 fix_auto_apply (m); /* Chests which open as default */ 1597 fix_auto_apply (m); /* Chests which open as default */
1705 1598
1706 /* If a player unique map, no extra unique object file to load. 1599 /* If a player unique map, no extra unique object file to load.
1707 * if from the editor, likewise. 1600 * if from the editor, likewise.
… …
1777 int x, y, i; 1670 int x, y, i;
1778 long monster_cnt = 0; 1671 long monster_cnt = 0;
1779 double avgexp = 0; 1672 double avgexp = 0;
1780 sint64 total_exp = 0; 1673 sint64 total_exp = 0;
1781 1674
1782 if (MAP_DIFFICULTY (m)) 1675 if (m->difficulty)
1783 { 1676 {
1784 LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m)); 1677 LOG (llevDebug, "Using stored map difficulty: %d\n", m->difficulty);
1785 return MAP_DIFFICULTY (m); 1678 return m->difficulty;
1786 } 1679 }
1787 1680
1788 for (x = 0; x < MAP_WIDTH (m); x++) 1681 for (x = 0; x < m->width; x++)
1789 for (y = 0; y < MAP_HEIGHT (m); y++) 1682 for (y = 0; y < m->height; y++)
1790 for (op = get_map_ob (m, x, y); op != NULL; op = op->above) 1683 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1791 { 1684 {
1792 if (QUERY_FLAG (op, FLAG_MONSTER)) 1685 if (QUERY_FLAG (op, FLAG_MONSTER))
1793 { 1686 {
1794 total_exp += op->stats.exp; 1687 total_exp += op->stats.exp;
1795 monster_cnt++; 1688 monster_cnt++;
… …
1843 if (first_map->in_memory == MAP_SAVING) 1736 if (first_map->in_memory == MAP_SAVING)
1844 first_map->in_memory = MAP_IN_MEMORY; 1737 first_map->in_memory = MAP_IN_MEMORY;
1845 delete_map (first_map); 1738 delete_map (first_map);
1846 real_maps++; 1739 real_maps++;
1847 } 1740 }
1741
1848 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps); 1742 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1849} 1743}
1850 1744
1851/* change_map_light() - used to change map light level (darkness) 1745/* change_map_light() - used to change map light level (darkness)
1852 * up or down. Returns true if successful. It should now be 1746 * up or down. Returns true if successful. It should now be
… …
1888 /* All clients need to get re-updated for the change */ 1782 /* All clients need to get re-updated for the change */
1889 update_all_map_los (m); 1783 update_all_map_los (m);
1890 return 1; 1784 return 1;
1891} 1785}
1892 1786
1893
1894/* 1787/*
1895 * This function updates various attributes about a specific space 1788 * This function updates various attributes about a specific space
1896 * on the map (what it looks like, whether it blocks magic, 1789 * on the map (what it looks like, whether it blocks magic,
1897 * has a living creatures, prevents people from passing 1790 * has a living creatures, prevents people from passing
1898 * through, etc) 1791 * through, etc)
1899 */ 1792 */
1900void 1793void
1901update_position (maptile *m, int x, int y) 1794mapspace::update_ ()
1902{ 1795{
1903 object *tmp, *last = NULL; 1796 object *tmp, *last = 0;
1904 uint8 flags = 0, oldflags, light = 0, anywhere = 0; 1797 uint8 flags = 0, light = 0, anywhere = 0;
1905 New_Face *top, *floor, *middle; 1798 New_Face *top, *floor, *middle;
1906 object *top_obj, *floor_obj, *middle_obj; 1799 object *top_obj, *floor_obj, *middle_obj;
1907 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1800 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1908 1801
1909 oldflags = GET_MAP_FLAGS (m, x, y);
1910 if (!(oldflags & P_NEED_UPDATE))
1911 {
1912 LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y);
1913 return;
1914 }
1915
1916 middle = blank_face; 1802 middle = blank_face;
1917 top = blank_face; 1803 top = blank_face;
1918 floor = blank_face; 1804 floor = blank_face;
1919 1805
1920 middle_obj = NULL; 1806 middle_obj = 0;
1921 top_obj = NULL; 1807 top_obj = 0;
1922 floor_obj = NULL; 1808 floor_obj = 0;
1923 1809
1924 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) 1810 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1925 { 1811 {
1926
1927 /* This could be made additive I guess (two lights better than 1812 /* This could be made additive I guess (two lights better than
1928 * one). But if so, it shouldn't be a simple additive - 2 1813 * one). But if so, it shouldn't be a simple additive - 2
1929 * light bulbs do not illuminate twice as far as once since 1814 * light bulbs do not illuminate twice as far as once since
1930 * it is a disapation factor that is squared (or is it cubed?) 1815 * it is a dissapation factor that is cubed.
1931 */ 1816 */
1932 if (tmp->glow_radius > light) 1817 if (tmp->glow_radius > light)
1933 light = tmp->glow_radius; 1818 light = tmp->glow_radius;
1934 1819
1935 /* This call is needed in order to update objects the player 1820 /* This call is needed in order to update objects the player
… …
1973 { 1858 {
1974 middle = tmp->face; 1859 middle = tmp->face;
1975 middle_obj = tmp; 1860 middle_obj = tmp;
1976 } 1861 }
1977 } 1862 }
1863
1978 if (tmp == tmp->above) 1864 if (tmp == tmp->above)
1979 { 1865 {
1980 LOG (llevError, "Error in structure of map\n"); 1866 LOG (llevError, "Error in structure of map\n");
1981 exit (-1); 1867 exit (-1);
1982 } 1868 }
1983 1869
1984 move_slow |= tmp->move_slow; 1870 move_slow |= tmp->move_slow;
1985 move_block |= tmp->move_block; 1871 move_block |= tmp->move_block;
1986 move_on |= tmp->move_on; 1872 move_on |= tmp->move_on;
1987 move_off |= tmp->move_off; 1873 move_off |= tmp->move_off;
1988 move_allow |= tmp->move_allow; 1874 move_allow |= tmp->move_allow;
1989 1875
1990 if (QUERY_FLAG (tmp, FLAG_ALIVE))
1991 flags |= P_IS_ALIVE;
1992 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC))
1993 flags |= P_NO_MAGIC;
1994 if (QUERY_FLAG (tmp, FLAG_DAMNED))
1995 flags |= P_NO_CLERIC;
1996 if (tmp->type == SAFE_GROUND)
1997 flags |= P_SAFE;
1998
1999 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) 1876 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;
2000 flags |= P_BLOCKSVIEW; 1877 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;
2001 } /* for stack of objects */ 1878 if (tmp->type == PLAYER) flags |= P_PLAYER;
2002 1879 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
2003 /* we don't want to rely on this function to have accurate flags, but 1880 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
2004 * since we're already doing the work, we calculate them here. 1881 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
2005 * if they don't match, logic is broken someplace.
2006 */
2007 if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR)))
2008 { 1882 }
2009 LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", 1883
2010 m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags); 1884 this->light = light;
2011 } 1885 this->flags_ = flags;
2012 SET_MAP_FLAGS (m, x, y, flags); 1886 this->move_block = move_block & ~move_allow;
2013 SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow); 1887 this->move_on = move_on;
2014 SET_MAP_MOVE_ON (m, x, y, move_on); 1888 this->move_off = move_off;
2015 SET_MAP_MOVE_OFF (m, x, y, move_off); 1889 this->move_slow = move_slow;
2016 SET_MAP_MOVE_SLOW (m, x, y, move_slow);
2017 1890
2018 /* At this point, we have a floor face (if there is a floor), 1891 /* At this point, we have a floor face (if there is a floor),
2019 * and the floor is set - we are not going to touch it at 1892 * and the floor is set - we are not going to touch it at
2020 * this point. 1893 * this point.
2021 * middle contains the highest visibility face. 1894 * middle contains the highest visibility face.
… …
2075 break; 1948 break;
2076 } 1949 }
2077 } 1950 }
2078 } 1951 }
2079 } 1952 }
1953
2080 if (middle == floor) 1954 if (middle == floor)
2081 middle = blank_face; 1955 middle = blank_face;
1956
2082 if (top == middle) 1957 if (top == middle)
2083 middle = blank_face; 1958 middle = blank_face;
2084 SET_MAP_FACE (m, x, y, top, 0);
2085 if (top != blank_face)
2086 SET_MAP_FACE_OBJ (m, x, y, top_obj, 0);
2087 else
2088 SET_MAP_FACE_OBJ (m, x, y, NULL, 0);
2089 SET_MAP_FACE (m, x, y, middle, 1);
2090 if (middle != blank_face)
2091 SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1);
2092 else
2093 SET_MAP_FACE_OBJ (m, x, y, NULL, 1);
2094 SET_MAP_FACE (m, x, y, floor, 2);
2095 if (floor != blank_face)
2096 SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2);
2097 else
2098 SET_MAP_FACE_OBJ (m, x, y, NULL, 2);
2099 SET_MAP_LIGHT (m, x, y, light);
2100}
2101 1959
1960 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1961 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1962 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1963}
2102 1964
2103void 1965void
2104set_map_reset_time (maptile *map) 1966set_map_reset_time (maptile *map)
2105{ 1967{
2106 int timeout; 1968 int timeout = map->reset_timeout;
2107 1969
2108 timeout = MAP_RESET_TIMEOUT (map);
2109 if (timeout <= 0) 1970 if (timeout <= 0)
2110 timeout = MAP_DEFAULTRESET; 1971 timeout = MAP_DEFAULTRESET;
2111 if (timeout >= MAP_MAXRESET) 1972 if (timeout >= MAP_MAXRESET)
2112 timeout = MAP_MAXRESET; 1973 timeout = MAP_MAXRESET;
2113 MAP_WHEN_RESET (map) = time (0) + timeout; 1974
1975 map->reset_time = time (0) + timeout;
2114} 1976}
2115 1977
2116/* this updates the orig_map->tile_map[tile_num] value after loading 1978/* this updates the orig_map->tile_map[tile_num] value after loading
2117 * the map. It also takes care of linking back the freshly loaded 1979 * the map. It also takes care of linking back the freshly loaded
2118 * maps tile_map values if it tiles back to this one. It returns 1980 * maps tile_map values if it tiles back to this one. It returns
… …
2146 * 2008 *
2147 */ 2009 */
2148int 2010int
2149out_of_map (maptile *m, int x, int y) 2011out_of_map (maptile *m, int x, int y)
2150{ 2012{
2151
2152 /* If we get passed a null map, this is obviously the 2013 /* If we get passed a null map, this is obviously the
2153 * case. This generally shouldn't happen, but if the 2014 * case. This generally shouldn't happen, but if the
2154 * map loads fail below, it could happen. 2015 * map loads fail below, it could happen.
2155 */ 2016 */
2156 if (!m) 2017 if (!m)
… …
2158 2019
2159 if (x < 0) 2020 if (x < 0)
2160 { 2021 {
2161 if (!m->tile_path[3]) 2022 if (!m->tile_path[3])
2162 return 1; 2023 return 1;
2024
2163 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2025 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2164 {
2165 load_and_link_tiled_map (m, 3); 2026 load_and_link_tiled_map (m, 3);
2166 } 2027
2167 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); 2028 return (out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y));
2168 } 2029 }
2169 if (x >= MAP_WIDTH (m)) 2030
2031 if (x >= m->width)
2170 { 2032 {
2171 if (!m->tile_path[1]) 2033 if (!m->tile_path[1])
2172 return 1; 2034 return 1;
2035
2173 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2036 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2174 {
2175 load_and_link_tiled_map (m, 1); 2037 load_and_link_tiled_map (m, 1);
2176 } 2038
2177 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); 2039 return (out_of_map (m->tile_map[1], x - m->width, y));
2178 } 2040 }
2041
2179 if (y < 0) 2042 if (y < 0)
2180 { 2043 {
2181 if (!m->tile_path[0]) 2044 if (!m->tile_path[0])
2182 return 1; 2045 return 1;
2046
2183 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2047 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2184 {
2185 load_and_link_tiled_map (m, 0); 2048 load_and_link_tiled_map (m, 0);
2186 } 2049
2187 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); 2050 return (out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height));
2188 } 2051 }
2189 if (y >= MAP_HEIGHT (m)) 2052
2053 if (y >= m->height)
2190 { 2054 {
2191 if (!m->tile_path[2]) 2055 if (!m->tile_path[2])
2192 return 1; 2056 return 1;
2057
2193 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2058 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2194 {
2195 load_and_link_tiled_map (m, 2); 2059 load_and_link_tiled_map (m, 2);
2196 } 2060
2197 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); 2061 return (out_of_map (m->tile_map[2], x, y - m->height));
2198 } 2062 }
2199 2063
2200 /* Simple case - coordinates are within this local 2064 /* Simple case - coordinates are within this local
2201 * map. 2065 * map.
2202 */ 2066 */
… …
2216{ 2080{
2217 2081
2218 if (*x < 0) 2082 if (*x < 0)
2219 { 2083 {
2220 if (!m->tile_path[3]) 2084 if (!m->tile_path[3])
2221 return NULL; 2085 return 0;
2222 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2086 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2223 load_and_link_tiled_map (m, 3); 2087 load_and_link_tiled_map (m, 3);
2224 2088
2225 *x += MAP_WIDTH (m->tile_map[3]); 2089 *x += m->tile_map[3]->width;
2226 return (get_map_from_coord (m->tile_map[3], x, y)); 2090 return (get_map_from_coord (m->tile_map[3], x, y));
2227 } 2091 }
2228 if (*x >= MAP_WIDTH (m)) 2092
2093 if (*x >= m->width)
2229 { 2094 {
2230 if (!m->tile_path[1]) 2095 if (!m->tile_path[1])
2231 return NULL; 2096 return 0;
2097
2232 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2098 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2233 load_and_link_tiled_map (m, 1); 2099 load_and_link_tiled_map (m, 1);
2234 2100
2235 *x -= MAP_WIDTH (m); 2101 *x -= m->width;
2236 return (get_map_from_coord (m->tile_map[1], x, y)); 2102 return (get_map_from_coord (m->tile_map[1], x, y));
2237 } 2103 }
2104
2238 if (*y < 0) 2105 if (*y < 0)
2239 { 2106 {
2240 if (!m->tile_path[0]) 2107 if (!m->tile_path[0])
2241 return NULL; 2108 return 0;
2109
2242 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2110 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2243 load_and_link_tiled_map (m, 0); 2111 load_and_link_tiled_map (m, 0);
2244 2112
2245 *y += MAP_HEIGHT (m->tile_map[0]); 2113 *y += m->tile_map[0]->height;
2246 return (get_map_from_coord (m->tile_map[0], x, y)); 2114 return (get_map_from_coord (m->tile_map[0], x, y));
2247 } 2115 }
2248 if (*y >= MAP_HEIGHT (m)) 2116
2117 if (*y >= m->height)
2249 { 2118 {
2250 if (!m->tile_path[2]) 2119 if (!m->tile_path[2])
2251 return NULL; 2120 return 0;
2121
2252 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2122 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2253 load_and_link_tiled_map (m, 2); 2123 load_and_link_tiled_map (m, 2);
2254 2124
2255 *y -= MAP_HEIGHT (m); 2125 *y -= m->height;
2256 return (get_map_from_coord (m->tile_map[2], x, y)); 2126 return (get_map_from_coord (m->tile_map[2], x, y));
2257 } 2127 }
2258 2128
2259 /* Simple case - coordinates are within this local 2129 /* Simple case - coordinates are within this local
2260 * map. 2130 * map.
… …
2280 2150
2281 } 2151 }
2282 else if (map1->tile_map[0] == map2) 2152 else if (map1->tile_map[0] == map2)
2283 { /* up */ 2153 { /* up */
2284 *dx = 0; 2154 *dx = 0;
2285 *dy = -MAP_HEIGHT (map2); 2155 *dy = -map2->height;
2286 } 2156 }
2287 else if (map1->tile_map[1] == map2) 2157 else if (map1->tile_map[1] == map2)
2288 { /* right */ 2158 { /* right */
2289 *dx = MAP_WIDTH (map1); 2159 *dx = map1->width;
2290 *dy = 0; 2160 *dy = 0;
2291 } 2161 }
2292 else if (map1->tile_map[2] == map2) 2162 else if (map1->tile_map[2] == map2)
2293 { /* down */ 2163 { /* down */
2294 *dx = 0; 2164 *dx = 0;
2295 *dy = MAP_HEIGHT (map1); 2165 *dy = map1->height;
2296 } 2166 }
2297 else if (map1->tile_map[3] == map2) 2167 else if (map1->tile_map[3] == map2)
2298 { /* left */ 2168 { /* left */
2299 *dx = -MAP_WIDTH (map2); 2169 *dx = -map2->width;
2300 *dy = 0; 2170 *dy = 0;
2301 2171
2302 } 2172 }
2303 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 2173 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)
2304 { /* up right */ 2174 { /* up right */
2305 *dx = MAP_WIDTH (map1->tile_map[0]); 2175 *dx = map1->tile_map[0]->width;
2306 *dy = -MAP_HEIGHT (map1->tile_map[0]); 2176 *dy = -map1->tile_map[0]->height;
2307 } 2177 }
2308 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 2178 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)
2309 { /* up left */ 2179 { /* up left */
2310 *dx = -MAP_WIDTH (map2); 2180 *dx = -map2->width;
2311 *dy = -MAP_HEIGHT (map1->tile_map[0]); 2181 *dy = -map1->tile_map[0]->height;
2312 } 2182 }
2313 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 2183 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)
2314 { /* right up */ 2184 { /* right up */
2315 *dx = MAP_WIDTH (map1); 2185 *dx = map1->width;
2316 *dy = -MAP_HEIGHT (map2); 2186 *dy = -map2->height;
2317 } 2187 }
2318 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 2188 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)
2319 { /* right down */ 2189 { /* right down */
2320 *dx = MAP_WIDTH (map1); 2190 *dx = map1->width;
2321 *dy = MAP_HEIGHT (map1->tile_map[1]); 2191 *dy = map1->tile_map[1]->height;
2322 } 2192 }
2323 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 2193 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)
2324 { /* down right */ 2194 { /* down right */
2325 *dx = MAP_WIDTH (map1->tile_map[2]); 2195 *dx = map1->tile_map[2]->width;
2326 *dy = MAP_HEIGHT (map1); 2196 *dy = map1->height;
2327 } 2197 }
2328 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 2198 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)
2329 { /* down left */ 2199 { /* down left */
2330 *dx = -MAP_WIDTH (map2); 2200 *dx = -map2->width;
2331 *dy = MAP_HEIGHT (map1); 2201 *dy = map1->height;
2332 } 2202 }
2333 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 2203 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)
2334 { /* left up */ 2204 { /* left up */
2335 *dx = -MAP_WIDTH (map1->tile_map[3]); 2205 *dx = -map1->tile_map[3]->width;
2336 *dy = -MAP_HEIGHT (map2); 2206 *dy = -map2->height;
2337 } 2207 }
2338 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 2208 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)
2339 { /* left down */ 2209 { /* left down */
2340 *dx = -MAP_WIDTH (map1->tile_map[3]); 2210 *dx = -map1->tile_map[3]->width;
2341 *dy = MAP_HEIGHT (map1->tile_map[3]); 2211 *dy = map1->tile_map[3]->height;
2342 2212
2343 } 2213 }
2344 else 2214 else
2345 { /* not "adjacent" enough */ 2215 { /* not "adjacent" enough */
2346 return 0; 2216 return 0;
… …
2471{ 2341{
2472 int dx, dy; 2342 int dx, dy;
2473 2343
2474 return adjacent_map (op1->map, op2->map, &dx, &dy); 2344 return adjacent_map (op1->map, op2->map, &dx, &dy);
2475} 2345}
2346
2347object *
2348maptile::insert (object *op, int x, int y, object *originator, int flags)
2349{
2350 if (!op->flag [FLAG_REMOVED])
2351 op->remove ();
2352
2353 return insert_ob_in_map_at (op, this, originator, flags, x, y);
2354}
2355

Diff Legend

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