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.33 by root, Sun Oct 8 16:51:50 2006 UTC vs.
Revision 1.47 by root, Mon Dec 25 11:25:49 2006 UTC

… …
24 24
25#include <global.h> 25#include <global.h>
26#include <funcpoint.h> 26#include <funcpoint.h>
27 27
28#include <loader.h> 28#include <loader.h>
29#ifndef WIN32 /* ---win32 exclude header */
30# include <unistd.h> 29#include <unistd.h>
31#endif /* win32 */
32 30
33#include "path.h" 31#include "path.h"
34
35 32
36/* 33/*
37 * Returns the maptile which has a name matching the given argument. 34 * Returns the maptile which has a name matching the given argument.
38 * return NULL if no match is found. 35 * return NULL if no match is found.
39 */ 36 */
… …
157int 154int
158check_path (const char *name, int prepend_dir) 155check_path (const char *name, int prepend_dir)
159{ 156{
160 char buf[MAX_BUF]; 157 char buf[MAX_BUF];
161 158
162#ifndef WIN32
163 char *endbuf; 159 char *endbuf;
164 struct stat statbuf; 160 struct stat statbuf;
165 int mode = 0; 161 int mode = 0;
166#endif
167 162
168 if (prepend_dir) 163 if (prepend_dir)
169 strcpy (buf, create_pathname (name)); 164 strcpy (buf, create_pathname (name));
170 else 165 else
171 strcpy (buf, name); 166 strcpy (buf, name);
172#ifdef WIN32 /* ***win32: check this sucker in windows style. */
173 return (_access (buf, 0));
174#else
175 167
176 /* old method (strchr(buf, '\0')) seemd very odd to me - 168 /* old method (strchr(buf, '\0')) seemd very odd to me -
177 * this method should be equivalant and is clearer. 169 * this method should be equivalant and is clearer.
178 * Can not use strcat because we need to cycle through 170 * Can not use strcat because we need to cycle through
179 * all the names. 171 * all the names.
… …
192 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || 184 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
193 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) 185 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
194 mode |= 2; 186 mode |= 2;
195 187
196 return (mode); 188 return (mode);
197#endif
198} 189}
199 190
200/* 191/*
201 * Prints out debug-information about a map. 192 * Prints out debug-information about a map.
202 * Dumping these at llevError doesn't seem right, but is 193 * Dumping these at llevError doesn't seem right, but is
… …
231void 222void
232dump_all_maps (void) 223dump_all_maps (void)
233{ 224{
234 maptile *m; 225 maptile *m;
235 226
236 for (m = first_map; m != NULL; m = m->next) 227 for (m = first_map; m; m = m->next)
237 {
238 dump_map (m); 228 dump_map (m);
239 }
240} 229}
241 230
242/* This rolls up wall, blocks_magic, blocks_view, etc, all into 231/* This rolls up wall, blocks_magic, blocks_view, etc, all into
243 * one function that just returns a P_.. value (see map.h) 232 * one function that just returns a P_.. value (see map.h)
244 * it will also do map translation for tiled maps, returning 233 * it will also do map translation for tiled maps, returning
… …
248 * is needed. The case of not passing values is if we're just 237 * is needed. The case of not passing values is if we're just
249 * checking for the existence of something on those spaces, but 238 * checking for the existence of something on those spaces, but
250 * don't expect to insert/remove anything from those spaces. 239 * don't expect to insert/remove anything from those spaces.
251 */ 240 */
252int 241int
253get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) 242get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
254{ 243{
255 sint16 newx, newy; 244 sint16 newx, newy;
256 int retval = 0; 245 int retval = 0;
257 maptile *mp; 246 maptile *mp;
258 247
259 if (out_of_map (oldmap, x, y))
260 return P_OUT_OF_MAP;
261 newx = x; 248 newx = x;
262 newy = y; 249 newy = y;
250
263 mp = get_map_from_coord (oldmap, &newx, &newy); 251 mp = get_map_from_coord (oldmap, &newx, &newy);
252
253 if (!mp)
254 return P_OUT_OF_MAP;
255
264 if (mp != oldmap) 256 if (mp != oldmap)
265 retval |= P_NEW_MAP; 257 retval |= P_NEW_MAP;
266 if (newmap)
267 *newmap = mp;
268 if (nx)
269 *nx = newx;
270 if (ny)
271 *ny = newy;
272 258
273 retval |= mp->spaces[newx + mp->width * newy].flags; 259 if (newmap) *newmap = mp;
260 if (nx) *nx = newx;
261 if (ny) *ny = newy;
274 262
275 return retval; 263 return retval | mp->at (newx, newy).flags ();
276} 264}
277 265
278/* 266/*
279 * Returns true if the given coordinate is blocked except by the 267 * Returns true if the given coordinate is blocked except by the
280 * object passed is not blocking. This is used with 268 * object passed is not blocking. This is used with
… …
303 } 291 }
304 292
305 /* Save some cycles - instead of calling get_map_flags(), just get the value 293 /* Save some cycles - instead of calling get_map_flags(), just get the value
306 * directly. 294 * directly.
307 */ 295 */
308 mflags = m->spaces[sx + m->width * sy].flags; 296 mflags = m->at (sx, sy).flags ();
309 297
310 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 298 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);
311 299
312 /* If space is currently not blocked by anything, no need to 300 /* If space is currently not blocked by anything, no need to
313 * go further. Not true for players - all sorts of special 301 * go further. Not true for players - all sorts of special
… …
332 /* We basically go through the stack of objects, and if there is 320 /* We basically go through the stack of objects, and if there is
333 * some other object that has NO_PASS or FLAG_ALIVE set, return 321 * some other object that has NO_PASS or FLAG_ALIVE set, return
334 * true. If we get through the entire stack, that must mean 322 * true. If we get through the entire stack, that must mean
335 * ob is blocking it, so return 0. 323 * ob is blocking it, so return 0.
336 */ 324 */
337 for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above) 325 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)
338 { 326 {
339 327
340 /* This must be before the checks below. Code for inventory checkers. */ 328 /* This must be before the checks below. Code for inventory checkers. */
341 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 329 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
342 { 330 {
… …
406 * 394 *
407 * Note this used to be arch_blocked, but with new movement 395 * Note this used to be arch_blocked, but with new movement
408 * code, we need to have actual object to check its move_type 396 * code, we need to have actual object to check its move_type
409 * against the move_block values. 397 * against the move_block values.
410 */ 398 */
411
412int 399int
413ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 400ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
414{ 401{
415 archetype *tmp; 402 archetype *tmp;
416 int flag; 403 int flag;
… …
422 flag = get_map_flags (m, &m1, x, y, &sx, &sy); 409 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
423 if (flag & P_OUT_OF_MAP) 410 if (flag & P_OUT_OF_MAP)
424 return P_OUT_OF_MAP; 411 return P_OUT_OF_MAP;
425 412
426 /* don't have object, so don't know what types would block */ 413 /* don't have object, so don't know what types would block */
427 return (GET_MAP_MOVE_BLOCK (m1, sx, sy)); 414 return m1->at (sx, sy).move_block;
428 } 415 }
429 416
430 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more) 417 for (tmp = ob->arch; tmp; tmp = tmp->more)
431 { 418 {
432 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 419 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
433 420
434 if (flag & P_OUT_OF_MAP) 421 if (flag & P_OUT_OF_MAP)
435 return P_OUT_OF_MAP; 422 return P_OUT_OF_MAP;
436 if (flag & P_IS_ALIVE) 423 if (flag & P_IS_ALIVE)
437 return P_IS_ALIVE; 424 return P_IS_ALIVE;
438 425
426 mapspace &ms = m1->at (sx, sy);
427
428
439 /* find_first_free_spot() calls this function. However, often 429 /* find_first_free_spot() calls this function. However, often
440 * ob doesn't have any move type (when used to place exits) 430 * ob doesn't have any move type (when used to place exits)
441 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 431 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
442 */ 432 */
443 433
444 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL) 434 if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
445 continue; 435 continue;
446 436
447 /* Note it is intentional that we check ob - the movement type of the 437 /* Note it is intentional that we check ob - the movement type of the
448 * head of the object should correspond for the entire object. 438 * head of the object should correspond for the entire object.
449 */ 439 */
450 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) 440 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
451 return AB_NO_PASS; 441 return P_NO_PASS;
452
453 } 442 }
443
454 return 0; 444 return 0;
455} 445}
456 446
457/* When the map is loaded, load_object does not actually insert objects 447/* When the map is loaded, load_object does not actually insert objects
458 * into inventory, but just links them. What this does is go through 448 * into inventory, but just links them. What this does is go through
… …
495 object *tmp, *op, *last, *above; 485 object *tmp, *op, *last, *above;
496 archetype *at; 486 archetype *at;
497 487
498 for (x = 0; x < MAP_WIDTH (m); x++) 488 for (x = 0; x < MAP_WIDTH (m); x++)
499 for (y = 0; y < MAP_HEIGHT (m); y++) 489 for (y = 0; y < MAP_HEIGHT (m); y++)
500 for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above) 490 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above)
501 { 491 {
502 above = tmp->above; 492 above = tmp->above;
503 493
504 /* already multipart - don't do anything more */ 494 /* already multipart - don't do anything more */
505 if (tmp->head || tmp->more) 495 if (tmp->head || tmp->more)
… …
540{ 530{
541 int i, j; 531 int i, j;
542 int unique; 532 int unique;
543 object *op, *prev = NULL, *last_more = NULL, *otmp; 533 object *op, *prev = NULL, *last_more = NULL, *otmp;
544 534
545 op = get_object (); 535 op = object::create ();
546 op->map = m; /* To handle buttons correctly */ 536 op->map = m; /* To handle buttons correctly */
547 537
548 while ((i = load_object (fp, op, mapflags))) 538 while ((i = load_object (fp, op, mapflags)))
549 { 539 {
550 /* if the archetype for the object is null, means that we 540 /* if the archetype for the object is null, means that we
… …
555 { 545 {
556 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 546 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
557 continue; 547 continue;
558 } 548 }
559 549
560
561 switch (i) 550 switch (i)
562 { 551 {
563 case LL_NORMAL: 552 case LL_NORMAL:
564 /* if we are loading an overlay, put the floors on the bottom */ 553 /* if we are loading an overlay, put the floors on the bottom */
565 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) 554 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
566 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD); 555 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
567 else 556 else
568 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 557 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
569 558
570 if (op->inv) 559 if (op->inv)
571 sum_weight (op); 560 sum_weight (op);
572 561
573 prev = op, last_more = op; 562 prev = op, last_more = op;
574 break; 563 break;
575 564
576 case LL_MORE: 565 case LL_MORE:
577 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 566 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);
578 op->head = prev, last_more->more = op, last_more = op; 567 op->head = prev, last_more->more = op, last_more = op;
579 break; 568 break;
580 } 569 }
581 570
582 if (mapflags & MAP_STYLE) 571 if (mapflags & MAP_STYLE)
583 remove_from_active_list (op); 572 remove_from_active_list (op);
584 573
585 op = get_object (); 574 op = object::create ();
586 op->map = m; 575 op->map = m;
587 } 576 }
588 577
589 for (i = 0; i < m->width; i++) 578 for (i = 0; i < m->width; i++)
590 { 579 {
591 for (j = 0; j < m->height; j++) 580 for (j = 0; j < m->height; j++)
592 { 581 {
593 unique = 0; 582 unique = 0;
594 /* check for unique items, or unique squares */ 583 /* check for unique items, or unique squares */
595 for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) 584 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
596 { 585 {
597 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) 586 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
598 unique = 1; 587 unique = 1;
588
599 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) 589 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
600 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); 590 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
601 } 591 }
602 } 592 }
603 } 593 }
604 594
605 free_object (op); 595 op->destroy ();
606 link_multipart_objects (m); 596 link_multipart_objects (m);
607} 597}
608 598
609/* This saves all the objects on the map in a non destructive fashion. 599/* This saves all the objects on the map in a non destructive fashion.
610 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 600 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
… …
620 /* first pass - save one-part objects */ 610 /* first pass - save one-part objects */
621 for (i = 0; i < MAP_WIDTH (m); i++) 611 for (i = 0; i < MAP_WIDTH (m); i++)
622 for (j = 0; j < MAP_HEIGHT (m); j++) 612 for (j = 0; j < MAP_HEIGHT (m); j++)
623 { 613 {
624 unique = 0; 614 unique = 0;
625 for (op = get_map_ob (m, i, j); op; op = op->above) 615 for (op = GET_MAP_OB (m, i, j); op; op = op->above)
626 { 616 {
627 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 617 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
628 unique = 1; 618 unique = 1;
629 619
630 if (op->type == PLAYER) 620 if (op->type == PLAYER)
631 {
632 LOG (llevDebug, "Player on map that is being saved\n");
633 continue; 621 continue;
634 }
635 622
636 if (op->head || op->owner) 623 if (op->head || op->owner)
637 continue; 624 continue;
638 625
639 if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) 626 if (unique || QUERY_FLAG (op, FLAG_UNIQUE))
640 save_object (fp2, op, 3); 627 save_object (fp2, op, 3);
641 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) 628 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID))))
642 save_object (fp, op, 3); 629 save_object (fp, op, 3);
630 }
631 }
632}
643 633
644 } /* for this space */ 634maptile::maptile ()
645 } /* for this j */ 635{
636 in_memory = MAP_SWAPPED;
637 /* The maps used to pick up default x and y values from the
638 * map archetype. Mimic that behaviour.
639 */
640 MAP_WIDTH (this) = 16;
641 MAP_HEIGHT (this) = 16;
642 MAP_RESET_TIMEOUT (this) = 0;
643 MAP_TIMEOUT (this) = 300;
644 MAP_ENTER_X (this) = 0;
645 MAP_ENTER_Y (this) = 0;
646 /*set part to -1 indicating conversion to weather map not yet done */
647 MAP_WORLDPARTX (this) = -1;
648 MAP_WORLDPARTY (this) = -1;
646} 649}
647 650
648/* 651/*
649 * Allocates, initialises, and returns a pointer to a maptile. 652 * Allocates, initialises, and returns a pointer to a maptile.
650 * Modified to no longer take a path option which was not being 653 * Modified to no longer take a path option which was not being
651 * used anyways. MSW 2001-07-01 654 * used anyways. MSW 2001-07-01
652 */ 655 */
653
654maptile * 656maptile *
655get_linked_map (void) 657get_linked_map (void)
656{ 658{
657 maptile *map = new maptile; 659 maptile *mp, *map = new maptile;
658 maptile *mp;
659 660
660 for (mp = first_map; mp != NULL && mp->next != NULL; mp = mp->next); 661 for (mp = first_map; mp && mp->next; mp = mp->next);
662
661 if (mp == NULL) 663 if (mp == NULL)
662 first_map = map; 664 first_map = map;
663 else 665 else
664 mp->next = map; 666 mp->next = map;
665 667
666 map->in_memory = MAP_SWAPPED;
667 /* The maps used to pick up default x and y values from the
668 * map archetype. Mimic that behaviour.
669 */
670 MAP_WIDTH (map) = 16;
671 MAP_HEIGHT (map) = 16;
672 MAP_RESET_TIMEOUT (map) = 0;
673 MAP_TIMEOUT (map) = 300;
674 MAP_ENTER_X (map) = 0;
675 MAP_ENTER_Y (map) = 0;
676 /*set part to -1 indicating conversion to weather map not yet done */
677 MAP_WORLDPARTX (map) = -1;
678 MAP_WORLDPARTY (map) = -1;
679 return map; 668 return map;
680} 669}
681 670
682/* 671/*
683 * Allocates the arrays contained in a maptile. 672 * Allocates the arrays contained in a maptile.
684 * This basically allocates the dynamic array of spaces for the 673 * This basically allocates the dynamic array of spaces for the
685 * map. 674 * map.
686 */ 675 */
687
688void 676void
689allocate_map (maptile *m) 677maptile::allocate ()
690{ 678{
691 m->in_memory = MAP_IN_MEMORY; 679 in_memory = MAP_IN_MEMORY;
680
692 /* Log this condition and free the storage. We could I suppose 681 /* Log this condition and free the storage. We could I suppose
693 * realloc, but if the caller is presuming the data will be intact, 682 * realloc, but if the caller is presuming the data will be intact,
694 * that is their poor assumption. 683 * that is their poor assumption.
695 */ 684 */
696 if (m->spaces) 685 if (spaces)
697 { 686 {
698 LOG (llevError, "allocate_map called with already allocated map (%s)\n", m->path); 687 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
699 free (m->spaces); 688 free (spaces);
700 } 689 }
701 690
702 m->spaces = (MapSpace *) calloc (1, MAP_WIDTH (m) * MAP_HEIGHT (m) * sizeof (MapSpace)); 691 spaces = (mapspace *)
692 calloc (1, width * height * sizeof (mapspace));
703 693
704 if (m->spaces == NULL) 694 if (!spaces)
705 fatal (OUT_OF_MEMORY); 695 fatal (OUT_OF_MEMORY);
706} 696}
707 697
708/* Create and returns a map of the specific size. Used 698/* Create and returns a map of the specific size. Used
709 * in random map code and the editor. 699 * in random map code and the editor.
… …
714 maptile *m = get_linked_map (); 704 maptile *m = get_linked_map ();
715 705
716 m->width = sizex; 706 m->width = sizex;
717 m->height = sizey; 707 m->height = sizey;
718 m->in_memory = MAP_SWAPPED; 708 m->in_memory = MAP_SWAPPED;
719 allocate_map (m); 709 m->allocate ();
710
720 return m; 711 return m;
721} 712}
722 713
723/* Takes a string from a map definition and outputs a pointer to the array of shopitems 714/* Takes a string from a map definition and outputs a pointer to the array of shopitems
724 * corresponding to that string. Memory is allocated for this, it must be freed 715 * corresponding to that string. Memory is allocated for this, it must be freed
… …
732 char *shop_string, *p, *q, *next_semicolon, *next_colon; 723 char *shop_string, *p, *q, *next_semicolon, *next_colon;
733 shopitems *items = NULL; 724 shopitems *items = NULL;
734 int i = 0, number_of_entries = 0; 725 int i = 0, number_of_entries = 0;
735 const typedata *current_type; 726 const typedata *current_type;
736 727
737 shop_string = strdup_local (input_string); 728 shop_string = strdup (input_string);
738 p = shop_string; 729 p = shop_string;
739 /* first we'll count the entries, we'll need that for allocating the array shortly */ 730 /* first we'll count the entries, we'll need that for allocating the array shortly */
740 while (p) 731 while (p)
741 { 732 {
742 p = strchr (p, ';'); 733 p = strchr (p, ';');
… …
851{ 842{
852 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; 843 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
853 int msgpos = 0; 844 int msgpos = 0;
854 int maplorepos = 0; 845 int maplorepos = 0;
855 846
856 while (fgets (buf, HUGE_BUF - 1, fp) != NULL) 847 while (fgets (buf, HUGE_BUF, fp) != NULL)
857 { 848 {
858 buf[HUGE_BUF - 1] = 0; 849 buf[HUGE_BUF - 1] = 0;
859 key = buf; 850 key = buf;
851
860 while (isspace (*key)) 852 while (isspace (*key))
861 key++; 853 key++;
854
862 if (*key == 0) 855 if (*key == 0)
863 continue; /* empty line */ 856 continue; /* empty line */
857
864 value = strchr (key, ' '); 858 value = strchr (key, ' ');
859
865 if (!value) 860 if (!value)
866 { 861 {
867 end = strchr (key, '\n'); 862 if ((end = strchr (key, '\n')))
868 if (end != NULL)
869 {
870 *end = 0; 863 *end = 0;
871 }
872 } 864 }
873 else 865 else
874 { 866 {
875 *value = 0; 867 *value = 0;
876 value++; 868 value++;
877 end = strchr (value, '\n'); 869 end = strchr (value, '\n');
870
878 while (isspace (*value)) 871 while (isspace (*value))
879 { 872 {
880 value++; 873 value++;
874
881 if (*value == '\0' || value == end) 875 if (*value == '\0' || value == end)
882 { 876 {
883 /* Nothing but spaces. */ 877 /* Nothing but spaces. */
884 value = NULL; 878 value = NULL;
885 break; 879 break;
… …
908 * that use the parameter. 902 * that use the parameter.
909 */ 903 */
910 904
911 if (!strcmp (key, "msg")) 905 if (!strcmp (key, "msg"))
912 { 906 {
913 while (fgets (buf, HUGE_BUF - 1, fp) != NULL) 907 while (fgets (buf, HUGE_BUF, fp) != NULL)
914 { 908 {
915 if (!strcmp (buf, "endmsg\n")) 909 if (!strcmp (buf, "endmsg\n"))
916 break; 910 break;
917 else 911 else
918 { 912 {
… …
925 * with nothing between). There is no reason in those cases to 919 * with nothing between). There is no reason in those cases to
926 * keep the empty message. Also, msgbuf contains garbage data 920 * keep the empty message. Also, msgbuf contains garbage data
927 * when msgpos is zero, so copying it results in crashes 921 * when msgpos is zero, so copying it results in crashes
928 */ 922 */
929 if (msgpos != 0) 923 if (msgpos != 0)
930 m->msg = strdup_local (msgbuf); 924 m->msg = strdup (msgbuf);
931 } 925 }
932 else if (!strcmp (key, "maplore")) 926 else if (!strcmp (key, "maplore"))
933 { 927 {
934 while (fgets (buf, HUGE_BUF - 1, fp) != NULL) 928 while (fgets (buf, HUGE_BUF, fp) != NULL)
935 { 929 {
936 if (!strcmp (buf, "endmaplore\n")) 930 if (!strcmp (buf, "endmaplore\n"))
937 break; 931 break;
938 else 932 else
939 { 933 {
… …
941 strcpy (maplorebuf + maplorepos, buf); 935 strcpy (maplorebuf + maplorepos, buf);
942 maplorepos += strlen (buf); 936 maplorepos += strlen (buf);
943 } 937 }
944 } 938 }
945 if (maplorepos != 0) 939 if (maplorepos != 0)
946 m->maplore = strdup_local (maplorebuf); 940 m->maplore = strdup (maplorebuf);
947 } 941 }
948 else if (!strcmp (key, "end")) 942 else if (!strcmp (key, "end"))
949 { 943 {
950 break; 944 break;
951 } 945 }
… …
960 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value); 954 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
961 } 955 }
962 else if (!strcmp (key, "name")) 956 else if (!strcmp (key, "name"))
963 { 957 {
964 *end = 0; 958 *end = 0;
965 m->name = strdup_local (value); 959 m->name = strdup (value);
966 } 960 }
967 /* first strcmp value on these are old names supported 961 /* first strcmp value on these are old names supported
968 * for compatibility reasons. The new values (second) are 962 * for compatibility reasons. The new values (second) are
969 * what really should be used. 963 * what really should be used.
970 */ 964 */
971 else if (!strcmp (key, "oid")) 965 else if (!strcmp (key, "oid"))
972 {
973 fp.get (m, atoi (value)); 966 fp.get (m, atoi (value));
974 }
975 else if (!strcmp (key, "attach")) 967 else if (!strcmp (key, "attach"))
976 {
977 m->attach = value; 968 m->attach = value;
978 }
979 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x")) 969 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
980 {
981 m->enter_x = atoi (value); 970 m->enter_x = atoi (value);
982 }
983 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y")) 971 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
984 {
985 m->enter_y = atoi (value); 972 m->enter_y = atoi (value);
986 }
987 else if (!strcmp (key, "x") || !strcmp (key, "width")) 973 else if (!strcmp (key, "x") || !strcmp (key, "width"))
988 {
989 m->width = atoi (value); 974 m->width = atoi (value);
990 }
991 else if (!strcmp (key, "y") || !strcmp (key, "height")) 975 else if (!strcmp (key, "y") || !strcmp (key, "height"))
992 {
993 m->height = atoi (value); 976 m->height = atoi (value);
994 }
995 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout")) 977 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
996 {
997 m->reset_timeout = atoi (value); 978 m->reset_timeout = atoi (value);
998 }
999 else if (!strcmp (key, "value") || !strcmp (key, "swap_time")) 979 else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
1000 {
1001 m->timeout = atoi (value); 980 m->timeout = atoi (value);
1002 }
1003 else if (!strcmp (key, "level") || !strcmp (key, "difficulty")) 981 else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
1004 { 982 m->difficulty = clamp (atoi (value), 1, settings.max_level);
1005 m->difficulty = atoi (value);
1006 }
1007 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness")) 983 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
1008 {
1009 m->darkness = atoi (value); 984 m->darkness = atoi (value);
1010 }
1011 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime")) 985 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
1012 {
1013 m->fixed_resettime = atoi (value); 986 m->fixed_resettime = atoi (value);
1014 }
1015 else if (!strcmp (key, "unique")) 987 else if (!strcmp (key, "unique"))
1016 {
1017 m->unique = atoi (value); 988 m->unique = atoi (value);
1018 }
1019 else if (!strcmp (key, "template")) 989 else if (!strcmp (key, "template"))
1020 {
1021 m->templatemap = atoi (value); 990 m->templatemap = atoi (value);
1022 }
1023 else if (!strcmp (key, "region")) 991 else if (!strcmp (key, "region"))
1024 {
1025 m->region = get_region_by_name (value); 992 m->region = get_region_by_name (value);
1026 }
1027 else if (!strcmp (key, "shopitems")) 993 else if (!strcmp (key, "shopitems"))
1028 { 994 {
1029 *end = 0; 995 *end = 0;
1030 m->shopitems = parse_shop_string (value); 996 m->shopitems = parse_shop_string (value);
1031 } 997 }
1032 else if (!strcmp (key, "shopgreed")) 998 else if (!strcmp (key, "shopgreed"))
1033 {
1034 m->shopgreed = atof (value); 999 m->shopgreed = atof (value);
1035 }
1036 else if (!strcmp (key, "shopmin")) 1000 else if (!strcmp (key, "shopmin"))
1037 {
1038 m->shopmin = atol (value); 1001 m->shopmin = atol (value);
1039 }
1040 else if (!strcmp (key, "shopmax")) 1002 else if (!strcmp (key, "shopmax"))
1041 {
1042 m->shopmax = atol (value); 1003 m->shopmax = atol (value);
1043 }
1044 else if (!strcmp (key, "shoprace")) 1004 else if (!strcmp (key, "shoprace"))
1045 { 1005 {
1046 *end = 0; 1006 *end = 0;
1047 m->shoprace = strdup_local (value); 1007 m->shoprace = strdup (value);
1048 } 1008 }
1049 else if (!strcmp (key, "outdoor")) 1009 else if (!strcmp (key, "outdoor"))
1050 {
1051 m->outdoor = atoi (value); 1010 m->outdoor = atoi (value);
1052 }
1053 else if (!strcmp (key, "temp")) 1011 else if (!strcmp (key, "temp"))
1054 {
1055 m->temp = atoi (value); 1012 m->temp = atoi (value);
1056 }
1057 else if (!strcmp (key, "pressure")) 1013 else if (!strcmp (key, "pressure"))
1058 {
1059 m->pressure = atoi (value); 1014 m->pressure = atoi (value);
1060 }
1061 else if (!strcmp (key, "humid")) 1015 else if (!strcmp (key, "humid"))
1062 {
1063 m->humid = atoi (value); 1016 m->humid = atoi (value);
1064 }
1065 else if (!strcmp (key, "windspeed")) 1017 else if (!strcmp (key, "windspeed"))
1066 {
1067 m->windspeed = atoi (value); 1018 m->windspeed = atoi (value);
1068 }
1069 else if (!strcmp (key, "winddir")) 1019 else if (!strcmp (key, "winddir"))
1070 {
1071 m->winddir = atoi (value); 1020 m->winddir = atoi (value);
1072 }
1073 else if (!strcmp (key, "sky")) 1021 else if (!strcmp (key, "sky"))
1074 {
1075 m->sky = atoi (value); 1022 m->sky = atoi (value);
1076 }
1077 else if (!strcmp (key, "nosmooth")) 1023 else if (!strcmp (key, "nosmooth"))
1078 {
1079 m->nosmooth = atoi (value); 1024 m->nosmooth = atoi (value);
1080 }
1081 else if (!strncmp (key, "tile_path_", 10)) 1025 else if (!strncmp (key, "tile_path_", 10))
1082 { 1026 {
1083 int tile = atoi (key + 10); 1027 int tile = atoi (key + 10);
1084 1028
1085 if (tile < 1 || tile > 4) 1029 if (tile < 1 || tile > 4)
… …
1118 } 1062 }
1119 1063
1120 if (editor) 1064 if (editor)
1121 { 1065 {
1122 /* Use the value as in the file. */ 1066 /* Use the value as in the file. */
1123 m->tile_path[tile - 1] = strdup_local (value); 1067 m->tile_path[tile - 1] = strdup (value);
1124 } 1068 }
1125 else if (path != NULL) 1069 else if (path != NULL)
1126 { 1070 {
1127 /* Use the normalized value. */ 1071 /* Use the normalized value. */
1128 m->tile_path[tile - 1] = strdup_local (path); 1072 m->tile_path[tile - 1] = strdup (path);
1129 } 1073 }
1130 } /* end if tile direction (in)valid */ 1074 } /* end if tile direction (in)valid */
1131 } 1075 }
1132 else 1076 else
1133 {
1134 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value); 1077 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
1135 }
1136 } 1078 }
1079
1137 if (!key || strcmp (key, "end")) 1080 if (!key || strcmp (key, "end"))
1138 { 1081 {
1139 LOG (llevError, "Got premature eof on map header!\n"); 1082 LOG (llevError, "Got premature eof on map header!\n");
1140 return 1; 1083 return 1;
1141 } 1084 }
1085
1142 return 0; 1086 return 0;
1143} 1087}
1144 1088
1145/* 1089/*
1146 * Opens the file "filename" and reads information about the map 1090 * Opens the file "filename" and reads information about the map
… …
1179 strcpy (m->path, filename); 1123 strcpy (m->path, filename);
1180 if (load_map_header (thawer, m)) 1124 if (load_map_header (thawer, m))
1181 { 1125 {
1182 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags); 1126 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1183 delete_map (m); 1127 delete_map (m);
1184 return NULL; 1128 return 0;
1185 } 1129 }
1186 1130
1187 allocate_map (m); 1131 m->allocate ();
1188 1132
1189 m->in_memory = MAP_LOADING; 1133 m->in_memory = MAP_LOADING;
1190 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE)); 1134 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1191 1135
1192 m->in_memory = MAP_IN_MEMORY; 1136 m->in_memory = MAP_IN_MEMORY;
… …
1238 LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname); 1182 LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);
1239 delete_map (m); 1183 delete_map (m);
1240 m = load_original_map (m->path, 0); 1184 m = load_original_map (m->path, 0);
1241 return NULL; 1185 return NULL;
1242 } 1186 }
1187
1243 allocate_map (m); 1188 m->allocate ();
1244 1189
1245 m->in_memory = MAP_LOADING; 1190 m->in_memory = MAP_LOADING;
1246 load_objects (m, thawer, 0); 1191 load_objects (m, thawer, 0);
1247 1192
1248 m->in_memory = MAP_IN_MEMORY; 1193 m->in_memory = MAP_IN_MEMORY;
… …
1271 if (load_map_header (thawer, m)) 1216 if (load_map_header (thawer, m))
1272 { 1217 {
1273 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname); 1218 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1274 delete_map (m); 1219 delete_map (m);
1275 m = load_original_map (m->path, 0); 1220 m = load_original_map (m->path, 0);
1276 return NULL; 1221 return 0;
1277 } 1222 }
1278 /*allocate_map(m); */ 1223 /*m->allocate ();*/
1279 1224
1280 m->in_memory = MAP_LOADING; 1225 m->in_memory = MAP_LOADING;
1281 load_objects (m, thawer, MAP_OVERLAY); 1226 load_objects (m, thawer, MAP_OVERLAY);
1282 1227
1283 m->in_memory = MAP_IN_MEMORY; 1228 m->in_memory = MAP_IN_MEMORY;
… …
1297 1242
1298 for (i = 0; i < MAP_WIDTH (m); i++) 1243 for (i = 0; i < MAP_WIDTH (m); i++)
1299 for (j = 0; j < MAP_HEIGHT (m); j++) 1244 for (j = 0; j < MAP_HEIGHT (m); j++)
1300 { 1245 {
1301 unique = 0; 1246 unique = 0;
1247
1302 for (op = get_map_ob (m, i, j); op; op = next) 1248 for (op = GET_MAP_OB (m, i, j); op; op = next)
1303 { 1249 {
1304 next = op->above; 1250 next = op->above;
1251
1305 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 1252 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1306 unique = 1; 1253 unique = 1;
1254
1307 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 1255 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1308 { 1256 {
1309 clean_object (op); 1257 op->destroy_inv (false);
1310 if (QUERY_FLAG (op, FLAG_IS_LINKED)) 1258 op->destroy ();
1311 remove_button_link (op);
1312 remove_ob (op);
1313 free_object (op);
1314 } 1259 }
1315 } 1260 }
1316 } 1261 }
1317} 1262}
1318 1263
… …
1387 make_path_to_file (filename); 1332 make_path_to_file (filename);
1388 } 1333 }
1389 else 1334 else
1390 { 1335 {
1391 if (!m->tmpname) 1336 if (!m->tmpname)
1392 m->tmpname = tempnam_local (settings.tmpdir, NULL); 1337 m->tmpname = tempnam (settings.tmpdir, NULL);
1393 1338
1394 strcpy (filename, m->tmpname); 1339 strcpy (filename, m->tmpname);
1395 } 1340 }
1396 1341
1397 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); 1342 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
… …
1421 print_shop_string (m, shop); 1366 print_shop_string (m, shop);
1422 fprintf (freezer, "shopitems %s\n", shop); 1367 fprintf (freezer, "shopitems %s\n", shop);
1423 } 1368 }
1424 if (m->shopgreed) 1369 if (m->shopgreed)
1425 fprintf (freezer, "shopgreed %f\n", m->shopgreed); 1370 fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1426#ifndef WIN32
1427 if (m->shopmin) 1371 if (m->shopmin)
1428 fprintf (freezer, "shopmin %llu\n", m->shopmin); 1372 fprintf (freezer, "shopmin %llu\n", m->shopmin);
1429 if (m->shopmax) 1373 if (m->shopmax)
1430 fprintf (freezer, "shopmax %llu\n", m->shopmax); 1374 fprintf (freezer, "shopmax %llu\n", m->shopmax);
1431#else
1432 if (m->shopmin)
1433 fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1434 if (m->shopmax)
1435 fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1436#endif
1437 if (m->shoprace) 1375 if (m->shoprace)
1438 fprintf (freezer, "shoprace %s\n", m->shoprace); 1376 fprintf (freezer, "shoprace %s\n", m->shoprace);
1439 if (m->darkness) 1377 if (m->darkness)
1440 fprintf (freezer, "darkness %d\n", m->darkness); 1378 fprintf (freezer, "darkness %d\n", m->darkness);
1441 if (m->width) 1379 if (m->width)
… …
1506 freezer.save (filename); 1444 freezer.save (filename);
1507 1445
1508 return 0; 1446 return 0;
1509} 1447}
1510 1448
1511
1512/*
1513 * Remove and free all objects in the inventory of the given object.
1514 * object.c ?
1515 */
1516
1517void
1518clean_object (object *op)
1519{
1520 object *tmp, *next;
1521
1522 for (tmp = op->inv; tmp; tmp = next)
1523 {
1524 next = tmp->below;
1525 clean_object (tmp);
1526 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1527 remove_button_link (tmp);
1528 remove_ob (tmp);
1529 free_object (tmp);
1530 }
1531}
1532
1533/* 1449/*
1534 * Remove and free all objects in the given map. 1450 * Remove and free all objects in the given map.
1535 */ 1451 */
1536
1537void 1452void
1538free_all_objects (maptile *m) 1453free_all_objects (maptile *m)
1539{ 1454{
1540 int i, j; 1455 if (!m->spaces)
1541 object *op; 1456 return;
1542 1457
1543 for (i = 0; i < MAP_WIDTH (m); i++) 1458 for (int i = 0; i < MAP_WIDTH (m); i++)
1544 for (j = 0; j < MAP_HEIGHT (m); j++) 1459 for (int j = 0; j < MAP_HEIGHT (m); j++)
1545 { 1460 {
1546 object *previous_obj = NULL; 1461 mapspace &ms = m->at (i, j);
1547 1462
1548 while ((op = GET_MAP_OB (m, i, j)) != NULL) 1463 while (object *op = ms.bottom)
1549 { 1464 {
1550 if (op == previous_obj)
1551 {
1552 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1553 break;
1554 }
1555 previous_obj = op;
1556 if (op->head != NULL) 1465 if (op->head)
1557 op = op->head; 1466 op = op->head;
1558 1467
1559 /* If the map isn't in memory, free_object will remove and 1468 op->destroy_inv (false);
1560 * free objects in op's inventory. So let it do the job. 1469 op->destroy ();
1561 */
1562 if (m->in_memory == MAP_IN_MEMORY)
1563 clean_object (op);
1564 remove_ob (op);
1565 free_object (op);
1566 } 1470 }
1567 } 1471 }
1568} 1472}
1569 1473
1570/* 1474/*
1571 * Frees everything allocated by the given maptileure. 1475 * Frees everything allocated by the given maptileure.
1572 * don't free tmpname - our caller is left to do that 1476 * don't free tmpname - our caller is left to do that
1573 */ 1477 */
1574
1575void 1478void
1576free_map (maptile *m, int flag) 1479free_map (maptile *m, int flag)
1577{ 1480{
1578 int i; 1481 if (m->in_memory != MAP_IN_MEMORY)
1579
1580 if (!m->in_memory)
1581 {
1582 LOG (llevError, "Trying to free freed map.\n");
1583 return; 1482 return;
1584 } 1483
1484 m->in_memory = MAP_SAVING;
1485
1486 // TODO: use new/delete
1487#define FREE_AND_CLEAR(p) { free (p); p = NULL; }
1488
1585 if (flag && m->spaces) 1489 if (flag && m->spaces)
1586 free_all_objects (m); 1490 free_all_objects (m);
1587 if (m->name) 1491 if (m->name)
1588 FREE_AND_CLEAR (m->name); 1492 FREE_AND_CLEAR (m->name);
1589 if (m->spaces) 1493 if (m->spaces)
1590 FREE_AND_CLEAR (m->spaces); 1494 FREE_AND_CLEAR (m->spaces);
1591 if (m->msg) 1495 if (m->msg)
1592 FREE_AND_CLEAR (m->msg); 1496 FREE_AND_CLEAR (m->msg);
1593 if (m->maplore) 1497 if (m->maplore)
1594 FREE_AND_CLEAR (m->maplore); 1498 FREE_AND_CLEAR (m->maplore);
1595 if (m->shopitems) 1499
1596 delete[]m->shopitems; 1500 delete [] m->shopitems;
1597 m->shopitems = 0; 1501 m->shopitems = 0;
1502
1598 if (m->shoprace) 1503 if (m->shoprace)
1599 FREE_AND_CLEAR (m->shoprace); 1504 FREE_AND_CLEAR (m->shoprace);
1505
1600 if (m->buttons) 1506 if (m->buttons)
1601 free_objectlinkpt (m->buttons); 1507 free_objectlinkpt (m->buttons);
1508
1602 m->buttons = NULL; 1509 m->buttons = NULL;
1510
1603 for (i = 0; i < 4; i++) 1511 for (int i = 0; i < 4; i++)
1604 { 1512 {
1605 if (m->tile_path[i]) 1513 if (m->tile_path[i])
1606 FREE_AND_CLEAR (m->tile_path[i]); 1514 FREE_AND_CLEAR (m->tile_path[i]);
1515
1607 m->tile_map[i] = NULL; 1516 m->tile_map[i] = 0;
1608 } 1517 }
1518
1609 m->in_memory = MAP_SWAPPED; 1519 m->in_memory = MAP_SWAPPED;
1610}
1611 1520
1612/* 1521#undef FREE_AND_CLEAR
1613 * function: vanish maptile 1522}
1614 * m : pointer to maptile, if NULL no action 1523
1615 * this deletes all the data on the map (freeing pointers) 1524maptile::~maptile ()
1616 * and then removes this map from the global linked list of maps. 1525{
1526 free_map (this, 1);
1527 free (tmpname);
1528}
1529
1530void
1531maptile::do_destroy ()
1532{
1533 attachable::do_destroy ();
1534
1535 free_all_objects (this);
1536
1537 /* We need to look through all the maps and see if any maps
1538 * are pointing at this one for tiling information. Since
1539 * tiling can be asymetric, we just can not look to see which
1540 * maps this map tiles with and clears those.
1617 */ 1541 */
1542 //TODO: non-euclidean-tiling MUST GO
1543 for (maptile *m = first_map; m; m = m->next)
1544 for (int i = 0; i < 4; i++)
1545 if (m->tile_map[i] == this)
1546 m->tile_map[i] = 0;
1618 1547
1548 if (first_map == this)
1549 first_map = next;
1550 else
1551 for (maptile *m = first_map; m; m = m->next)
1552 if (m->next = this)
1553 {
1554 m->next = next;
1555 break;
1556 }
1557}
1558
1559//TODO: must go
1619void 1560void
1620delete_map (maptile *m) 1561delete_map (maptile *m)
1621{ 1562{
1622 maptile *tmp, *last;
1623 int i;
1624
1625 if (!m) 1563 if (m)
1626 return; 1564 m->destroy ();
1627
1628 m->clear ();
1629
1630 if (m->in_memory == MAP_IN_MEMORY)
1631 {
1632 /* change to MAP_SAVING, even though we are not,
1633 * so that remove_ob doesn't do as much work.
1634 */
1635 m->in_memory = MAP_SAVING;
1636 free_map (m, 1);
1637 }
1638 /* move this out of free_map, since tmpname can still be needed if
1639 * the map is swapped out.
1640 */
1641 if (m->tmpname)
1642 {
1643 free (m->tmpname);
1644 m->tmpname = NULL;
1645 }
1646 last = NULL;
1647 /* We need to look through all the maps and see if any maps
1648 * are pointing at this one for tiling information. Since
1649 * tiling can be assymetric, we just can not look to see which
1650 * maps this map tiles with and clears those.
1651 */
1652 for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1653 {
1654 if (tmp->next == m)
1655 last = tmp;
1656
1657 /* This should hopefully get unrolled on a decent compiler */
1658 for (i = 0; i < 4; i++)
1659 if (tmp->tile_map[i] == m)
1660 tmp->tile_map[i] = NULL;
1661 }
1662
1663 /* If last is null, then this should be the first map in the list */
1664 if (!last)
1665 {
1666 if (m == first_map)
1667 first_map = m->next;
1668 else
1669 /* m->path is a static char, so should hopefully still have
1670 * some useful data in it.
1671 */
1672 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1673 }
1674 else
1675 last->next = m->next;
1676
1677 delete m;
1678} 1565}
1679
1680
1681 1566
1682/* 1567/*
1683 * Makes sure the given map is loaded and swapped in. 1568 * Makes sure the given map is loaded and swapped in.
1684 * name is path name of the map. 1569 * name is path name of the map.
1685 * flags meaning: 1570 * flags meaning:
… …
1688 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. 1573 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1689 * dont do any more name translation on it. 1574 * dont do any more name translation on it.
1690 * 1575 *
1691 * Returns a pointer to the given map. 1576 * Returns a pointer to the given map.
1692 */ 1577 */
1693
1694maptile * 1578maptile *
1695ready_map_name (const char *name, int flags) 1579ready_map_name (const char *name, int flags)
1696{ 1580{
1697 maptile *m;
1698
1699 if (!name) 1581 if (!name)
1700 return (NULL); 1582 return 0;
1701 1583
1702 /* Have we been at this level before? */ 1584 /* Have we been at this level before? */
1703 m = has_been_loaded (name); 1585 maptile *m = has_been_loaded (name);
1704 1586
1705 /* Map is good to go, so just return it */ 1587 /* Map is good to go, so just return it */
1706 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) 1588 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1707 {
1708 return m; 1589 return m;
1709 }
1710 1590
1711 /* unique maps always get loaded from their original location, and never 1591 /* unique maps always get loaded from their original location, and never
1712 * a temp location. Likewise, if map_flush is set, or we have never loaded 1592 * a temp location. Likewise, if map_flush is set, or we have never loaded
1713 * this map, load it now. I removed the reset checking from here - 1593 * this map, load it now. I removed the reset checking from here -
1714 * it seems the probability of a player trying to enter a map that should 1594 * it seems the probability of a player trying to enter a map that should
… …
1716 * a bit cleaner (and players probably shouldn't rely on exact timing for 1596 * a bit cleaner (and players probably shouldn't rely on exact timing for
1717 * resets in any case - if they really care, they should use the 'maps command. 1597 * resets in any case - if they really care, they should use the 'maps command.
1718 */ 1598 */
1719 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m) 1599 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1720 { 1600 {
1721
1722 /* first visit or time to reset */ 1601 /* first visit or time to reset */
1723 if (m) 1602 if (m)
1724 { 1603 {
1725 clean_tmp_map (m); /* Doesn't make much difference */ 1604 clean_tmp_map (m); /* Doesn't make much difference */
1726 delete_map (m); 1605 delete_map (m);
… …
1821 return MAP_DIFFICULTY (m); 1700 return MAP_DIFFICULTY (m);
1822 } 1701 }
1823 1702
1824 for (x = 0; x < MAP_WIDTH (m); x++) 1703 for (x = 0; x < MAP_WIDTH (m); x++)
1825 for (y = 0; y < MAP_HEIGHT (m); y++) 1704 for (y = 0; y < MAP_HEIGHT (m); y++)
1826 for (op = get_map_ob (m, x, y); op != NULL; op = op->above) 1705 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1827 { 1706 {
1828 if (QUERY_FLAG (op, FLAG_MONSTER)) 1707 if (QUERY_FLAG (op, FLAG_MONSTER))
1829 { 1708 {
1830 total_exp += op->stats.exp; 1709 total_exp += op->stats.exp;
1831 monster_cnt++; 1710 monster_cnt++;
… …
1924 /* All clients need to get re-updated for the change */ 1803 /* All clients need to get re-updated for the change */
1925 update_all_map_los (m); 1804 update_all_map_los (m);
1926 return 1; 1805 return 1;
1927} 1806}
1928 1807
1929
1930/* 1808/*
1931 * This function updates various attributes about a specific space 1809 * This function updates various attributes about a specific space
1932 * on the map (what it looks like, whether it blocks magic, 1810 * on the map (what it looks like, whether it blocks magic,
1933 * has a living creatures, prevents people from passing 1811 * has a living creatures, prevents people from passing
1934 * through, etc) 1812 * through, etc)
1935 */ 1813 */
1936void 1814void
1937update_position (maptile *m, int x, int y) 1815mapspace::update_ ()
1938{ 1816{
1939 object *tmp, *last = NULL; 1817 object *tmp, *last = 0;
1940 uint8 flags = 0, oldflags, light = 0, anywhere = 0; 1818 uint8 flags = 0, light = 0, anywhere = 0;
1941 New_Face *top, *floor, *middle; 1819 New_Face *top, *floor, *middle;
1942 object *top_obj, *floor_obj, *middle_obj; 1820 object *top_obj, *floor_obj, *middle_obj;
1943 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1821 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1944 1822
1945 oldflags = GET_MAP_FLAGS (m, x, y);
1946 if (!(oldflags & P_NEED_UPDATE))
1947 {
1948 LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y);
1949 return;
1950 }
1951
1952 middle = blank_face; 1823 middle = blank_face;
1953 top = blank_face; 1824 top = blank_face;
1954 floor = blank_face; 1825 floor = blank_face;
1955 1826
1956 middle_obj = NULL; 1827 middle_obj = 0;
1957 top_obj = NULL; 1828 top_obj = 0;
1958 floor_obj = NULL; 1829 floor_obj = 0;
1959 1830
1960 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) 1831 for (tmp = bottom; tmp; last = tmp, tmp = tmp->above)
1961 { 1832 {
1962
1963 /* This could be made additive I guess (two lights better than 1833 /* This could be made additive I guess (two lights better than
1964 * one). But if so, it shouldn't be a simple additive - 2 1834 * one). But if so, it shouldn't be a simple additive - 2
1965 * light bulbs do not illuminate twice as far as once since 1835 * light bulbs do not illuminate twice as far as once since
1966 * it is a disapation factor that is squared (or is it cubed?) 1836 * it is a dissapation factor that is cubed.
1967 */ 1837 */
1968 if (tmp->glow_radius > light) 1838 if (tmp->glow_radius > light)
1969 light = tmp->glow_radius; 1839 light = tmp->glow_radius;
1970 1840
1971 /* This call is needed in order to update objects the player 1841 /* This call is needed in order to update objects the player
… …
2009 { 1879 {
2010 middle = tmp->face; 1880 middle = tmp->face;
2011 middle_obj = tmp; 1881 middle_obj = tmp;
2012 } 1882 }
2013 } 1883 }
1884
2014 if (tmp == tmp->above) 1885 if (tmp == tmp->above)
2015 { 1886 {
2016 LOG (llevError, "Error in structure of map\n"); 1887 LOG (llevError, "Error in structure of map\n");
2017 exit (-1); 1888 exit (-1);
2018 } 1889 }
2019 1890
2020 move_slow |= tmp->move_slow; 1891 move_slow |= tmp->move_slow;
2021 move_block |= tmp->move_block; 1892 move_block |= tmp->move_block;
2022 move_on |= tmp->move_on; 1893 move_on |= tmp->move_on;
2023 move_off |= tmp->move_off; 1894 move_off |= tmp->move_off;
2024 move_allow |= tmp->move_allow; 1895 move_allow |= tmp->move_allow;
2025 1896
2026 if (QUERY_FLAG (tmp, FLAG_ALIVE))
2027 flags |= P_IS_ALIVE;
2028 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC))
2029 flags |= P_NO_MAGIC;
2030 if (QUERY_FLAG (tmp, FLAG_DAMNED))
2031 flags |= P_NO_CLERIC;
2032 if (tmp->type == SAFE_GROUND)
2033 flags |= P_SAFE;
2034
2035 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) 1897 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;
2036 flags |= P_BLOCKSVIEW; 1898 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;
2037 } /* for stack of objects */ 1899 if (tmp->type == PLAYER) flags |= P_PLAYER;
2038 1900 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
2039 /* we don't want to rely on this function to have accurate flags, but 1901 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
2040 * since we're already doing the work, we calculate them here. 1902 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
2041 * if they don't match, logic is broken someplace.
2042 */
2043 if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR)))
2044 { 1903 }
2045 LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", 1904
2046 m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags); 1905 this->light = light;
2047 } 1906 this->flags_ = flags;
2048 SET_MAP_FLAGS (m, x, y, flags); 1907 this->move_block = move_block & ~move_allow;
2049 SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow); 1908 this->move_on = move_on;
2050 SET_MAP_MOVE_ON (m, x, y, move_on); 1909 this->move_off = move_off;
2051 SET_MAP_MOVE_OFF (m, x, y, move_off); 1910 this->move_slow = move_slow;
2052 SET_MAP_MOVE_SLOW (m, x, y, move_slow);
2053 1911
2054 /* At this point, we have a floor face (if there is a floor), 1912 /* At this point, we have a floor face (if there is a floor),
2055 * and the floor is set - we are not going to touch it at 1913 * and the floor is set - we are not going to touch it at
2056 * this point. 1914 * this point.
2057 * middle contains the highest visibility face. 1915 * middle contains the highest visibility face.
… …
2111 break; 1969 break;
2112 } 1970 }
2113 } 1971 }
2114 } 1972 }
2115 } 1973 }
1974
2116 if (middle == floor) 1975 if (middle == floor)
2117 middle = blank_face; 1976 middle = blank_face;
1977
2118 if (top == middle) 1978 if (top == middle)
2119 middle = blank_face; 1979 middle = blank_face;
2120 SET_MAP_FACE (m, x, y, top, 0);
2121 if (top != blank_face)
2122 SET_MAP_FACE_OBJ (m, x, y, top_obj, 0);
2123 else
2124 SET_MAP_FACE_OBJ (m, x, y, NULL, 0);
2125 SET_MAP_FACE (m, x, y, middle, 1);
2126 if (middle != blank_face)
2127 SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1);
2128 else
2129 SET_MAP_FACE_OBJ (m, x, y, NULL, 1);
2130 SET_MAP_FACE (m, x, y, floor, 2);
2131 if (floor != blank_face)
2132 SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2);
2133 else
2134 SET_MAP_FACE_OBJ (m, x, y, NULL, 2);
2135 SET_MAP_LIGHT (m, x, y, light);
2136}
2137 1980
1981 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1982 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1983 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1984}
2138 1985
2139void 1986void
2140set_map_reset_time (maptile *map) 1987set_map_reset_time (maptile *map)
2141{ 1988{
2142 int timeout; 1989 int timeout;
… …
2144 timeout = MAP_RESET_TIMEOUT (map); 1991 timeout = MAP_RESET_TIMEOUT (map);
2145 if (timeout <= 0) 1992 if (timeout <= 0)
2146 timeout = MAP_DEFAULTRESET; 1993 timeout = MAP_DEFAULTRESET;
2147 if (timeout >= MAP_MAXRESET) 1994 if (timeout >= MAP_MAXRESET)
2148 timeout = MAP_MAXRESET; 1995 timeout = MAP_MAXRESET;
2149 MAP_WHEN_RESET (map) = seconds () + timeout; 1996 MAP_WHEN_RESET (map) = time (0) + timeout;
2150} 1997}
2151 1998
2152/* this updates the orig_map->tile_map[tile_num] value after loading 1999/* this updates the orig_map->tile_map[tile_num] value after loading
2153 * the map. It also takes care of linking back the freshly loaded 2000 * the map. It also takes care of linking back the freshly loaded
2154 * maps tile_map values if it tiles back to this one. It returns 2001 * maps tile_map values if it tiles back to this one. It returns
… …
2182 * 2029 *
2183 */ 2030 */
2184int 2031int
2185out_of_map (maptile *m, int x, int y) 2032out_of_map (maptile *m, int x, int y)
2186{ 2033{
2187
2188 /* If we get passed a null map, this is obviously the 2034 /* If we get passed a null map, this is obviously the
2189 * case. This generally shouldn't happen, but if the 2035 * case. This generally shouldn't happen, but if the
2190 * map loads fail below, it could happen. 2036 * map loads fail below, it could happen.
2191 */ 2037 */
2192 if (!m) 2038 if (!m)
… …
2194 2040
2195 if (x < 0) 2041 if (x < 0)
2196 { 2042 {
2197 if (!m->tile_path[3]) 2043 if (!m->tile_path[3])
2198 return 1; 2044 return 1;
2045
2199 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2046 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2200 {
2201 load_and_link_tiled_map (m, 3); 2047 load_and_link_tiled_map (m, 3);
2202 } 2048
2203 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); 2049 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y));
2204 } 2050 }
2051
2205 if (x >= MAP_WIDTH (m)) 2052 if (x >= MAP_WIDTH (m))
2206 { 2053 {
2207 if (!m->tile_path[1]) 2054 if (!m->tile_path[1])
2208 return 1; 2055 return 1;
2056
2209 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2057 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2210 {
2211 load_and_link_tiled_map (m, 1); 2058 load_and_link_tiled_map (m, 1);
2212 } 2059
2213 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); 2060 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y));
2214 } 2061 }
2062
2215 if (y < 0) 2063 if (y < 0)
2216 { 2064 {
2217 if (!m->tile_path[0]) 2065 if (!m->tile_path[0])
2218 return 1; 2066 return 1;
2067
2219 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2068 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2220 {
2221 load_and_link_tiled_map (m, 0); 2069 load_and_link_tiled_map (m, 0);
2222 } 2070
2223 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); 2071 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0])));
2224 } 2072 }
2073
2225 if (y >= MAP_HEIGHT (m)) 2074 if (y >= MAP_HEIGHT (m))
2226 { 2075 {
2227 if (!m->tile_path[2]) 2076 if (!m->tile_path[2])
2228 return 1; 2077 return 1;
2078
2229 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2079 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2230 {
2231 load_and_link_tiled_map (m, 2); 2080 load_and_link_tiled_map (m, 2);
2232 } 2081
2233 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); 2082 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m)));
2234 } 2083 }
2235 2084
2236 /* Simple case - coordinates are within this local 2085 /* Simple case - coordinates are within this local
2237 * map. 2086 * map.
… …
2252{ 2101{
2253 2102
2254 if (*x < 0) 2103 if (*x < 0)
2255 { 2104 {
2256 if (!m->tile_path[3]) 2105 if (!m->tile_path[3])
2257 return NULL; 2106 return 0;
2258 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2107 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2259 load_and_link_tiled_map (m, 3); 2108 load_and_link_tiled_map (m, 3);
2260 2109
2261 *x += MAP_WIDTH (m->tile_map[3]); 2110 *x += MAP_WIDTH (m->tile_map[3]);
2262 return (get_map_from_coord (m->tile_map[3], x, y)); 2111 return (get_map_from_coord (m->tile_map[3], x, y));
2263 } 2112 }
2113
2264 if (*x >= MAP_WIDTH (m)) 2114 if (*x >= MAP_WIDTH (m))
2265 { 2115 {
2266 if (!m->tile_path[1]) 2116 if (!m->tile_path[1])
2267 return NULL; 2117 return 0;
2118
2268 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2119 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2269 load_and_link_tiled_map (m, 1); 2120 load_and_link_tiled_map (m, 1);
2270 2121
2271 *x -= MAP_WIDTH (m); 2122 *x -= MAP_WIDTH (m);
2272 return (get_map_from_coord (m->tile_map[1], x, y)); 2123 return (get_map_from_coord (m->tile_map[1], x, y));
2273 } 2124 }
2125
2274 if (*y < 0) 2126 if (*y < 0)
2275 { 2127 {
2276 if (!m->tile_path[0]) 2128 if (!m->tile_path[0])
2277 return NULL; 2129 return 0;
2130
2278 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2131 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2279 load_and_link_tiled_map (m, 0); 2132 load_and_link_tiled_map (m, 0);
2280 2133
2281 *y += MAP_HEIGHT (m->tile_map[0]); 2134 *y += MAP_HEIGHT (m->tile_map[0]);
2282 return (get_map_from_coord (m->tile_map[0], x, y)); 2135 return (get_map_from_coord (m->tile_map[0], x, y));
2283 } 2136 }
2137
2284 if (*y >= MAP_HEIGHT (m)) 2138 if (*y >= MAP_HEIGHT (m))
2285 { 2139 {
2286 if (!m->tile_path[2]) 2140 if (!m->tile_path[2])
2287 return NULL; 2141 return 0;
2142
2288 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2143 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2289 load_and_link_tiled_map (m, 2); 2144 load_and_link_tiled_map (m, 2);
2290 2145
2291 *y -= MAP_HEIGHT (m); 2146 *y -= MAP_HEIGHT (m);
2292 return (get_map_from_coord (m->tile_map[2], x, y)); 2147 return (get_map_from_coord (m->tile_map[2], x, y));

Diff Legend

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