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.37 by pippijn, Mon Dec 11 14:28:12 2006 UTC vs.
Revision 1.53 by root, Wed Dec 27 09:28:01 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 */
40
41maptile * 37maptile *
42has_been_loaded (const char *name) 38has_been_loaded (const char *name)
43{ 39{
44 maptile *map;
45
46 if (!name || !*name) 40 if (!name || !*name)
47 return 0; 41 return 0;
48 for (map = first_map; map; map = map->next) 42
43 for_all_maps (map)
49 if (!strcmp (name, map->path)) 44 if (!strcmp (name, map->path))
50 break;
51 return (map); 45 return map;
46
47 return 0;
52} 48}
53 49
54/* 50/*
55 * This makes a path absolute outside the world of Crossfire. 51 * This makes a path absolute outside the world of Crossfire.
56 * In other words, it prepends LIBDIR/MAPDIR/ to the given path 52 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
… …
157int 153int
158check_path (const char *name, int prepend_dir) 154check_path (const char *name, int prepend_dir)
159{ 155{
160 char buf[MAX_BUF]; 156 char buf[MAX_BUF];
161 157
162#ifndef WIN32
163 char *endbuf; 158 char *endbuf;
164 struct stat statbuf; 159 struct stat statbuf;
165 int mode = 0; 160 int mode = 0;
166#endif
167 161
168 if (prepend_dir) 162 if (prepend_dir)
169 strcpy (buf, create_pathname (name)); 163 strcpy (buf, create_pathname (name));
170 else 164 else
171 strcpy (buf, name); 165 strcpy (buf, name);
172#ifdef WIN32 /* ***win32: check this sucker in windows style. */
173 return (_access (buf, 0));
174#else
175 166
176 /* old method (strchr(buf, '\0')) seemd very odd to me - 167 /* old method (strchr(buf, '\0')) seemd very odd to me -
177 * this method should be equivalant and is clearer. 168 * this method should be equivalant and is clearer.
178 * Can not use strcat because we need to cycle through 169 * Can not use strcat because we need to cycle through
179 * all the names. 170 * all the names.
… …
192 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || 183 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)) 184 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
194 mode |= 2; 185 mode |= 2;
195 186
196 return (mode); 187 return (mode);
197#endif
198} 188}
199 189
200/* 190/*
201 * Prints out debug-information about a map. 191 * Prints out debug-information about a map.
202 * Dumping these at llevError doesn't seem right, but is 192 * Dumping these at llevError doesn't seem right, but is
… …
205 195
206void 196void
207dump_map (const maptile *m) 197dump_map (const maptile *m)
208{ 198{
209 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); 199 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
210 LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m)); 200 LOG (llevError, "Size: %dx%d Start: %d,%d\n", m->width, m->height, m->enter_x, m->enter_y);
211 201
212 if (m->msg != NULL) 202 if (m->msg != NULL)
213 LOG (llevError, "Message:\n%s", m->msg); 203 LOG (llevError, "Message:\n%s", m->msg);
214 204
215 if (m->maplore != NULL) 205 if (m->maplore != NULL)
… …
229 */ 219 */
230 220
231void 221void
232dump_all_maps (void) 222dump_all_maps (void)
233{ 223{
234 maptile *m; 224 for_all_maps (m)
235
236 for (m = first_map; m != NULL; m = m->next)
237 {
238 dump_map (m); 225 dump_map (m);
239 }
240} 226}
241 227
242/* This rolls up wall, blocks_magic, blocks_view, etc, all into 228/* This rolls up wall, blocks_magic, blocks_view, etc, all into
243 * one function that just returns a P_.. value (see map.h) 229 * one function that just returns a P_.. value (see map.h)
244 * it will also do map translation for tiled maps, returning 230 * it will also do map translation for tiled maps, returning
… …
248 * is needed. The case of not passing values is if we're just 234 * is needed. The case of not passing values is if we're just
249 * checking for the existence of something on those spaces, but 235 * checking for the existence of something on those spaces, but
250 * don't expect to insert/remove anything from those spaces. 236 * don't expect to insert/remove anything from those spaces.
251 */ 237 */
252int 238int
253get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) 239get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
254{ 240{
255 sint16 newx, newy; 241 sint16 newx, newy;
256 int retval = 0; 242 int retval = 0;
257 maptile *mp; 243 maptile *mp;
258 244
259 if (out_of_map (oldmap, x, y))
260 return P_OUT_OF_MAP;
261 newx = x; 245 newx = x;
262 newy = y; 246 newy = y;
247
263 mp = get_map_from_coord (oldmap, &newx, &newy); 248 mp = get_map_from_coord (oldmap, &newx, &newy);
249
250 if (!mp)
251 return P_OUT_OF_MAP;
252
264 if (mp != oldmap) 253 if (mp != oldmap)
265 retval |= P_NEW_MAP; 254 retval |= P_NEW_MAP;
266 if (newmap)
267 *newmap = mp;
268 if (nx)
269 *nx = newx;
270 if (ny)
271 *ny = newy;
272 255
273 retval |= mp->spaces[newx + mp->width * newy].flags; 256 if (newmap) *newmap = mp;
257 if (nx) *nx = newx;
258 if (ny) *ny = newy;
274 259
275 return retval; 260 return retval | mp->at (newx, newy).flags ();
276} 261}
277 262
278/* 263/*
279 * Returns true if the given coordinate is blocked except by the 264 * Returns true if the given coordinate is blocked except by the
280 * object passed is not blocking. This is used with 265 * object passed is not blocking. This is used with
… …
303 } 288 }
304 289
305 /* Save some cycles - instead of calling get_map_flags(), just get the value 290 /* Save some cycles - instead of calling get_map_flags(), just get the value
306 * directly. 291 * directly.
307 */ 292 */
308 mflags = m->spaces[sx + m->width * sy].flags; 293 mflags = m->at (sx, sy).flags ();
309 294
310 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 295 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);
311 296
312 /* If space is currently not blocked by anything, no need to 297 /* If space is currently not blocked by anything, no need to
313 * go further. Not true for players - all sorts of special 298 * go further. Not true for players - all sorts of special
… …
332 /* We basically go through the stack of objects, and if there is 317 /* 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 318 * some other object that has NO_PASS or FLAG_ALIVE set, return
334 * true. If we get through the entire stack, that must mean 319 * true. If we get through the entire stack, that must mean
335 * ob is blocking it, so return 0. 320 * ob is blocking it, so return 0.
336 */ 321 */
337 for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above) 322 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)
338 { 323 {
339 324
340 /* This must be before the checks below. Code for inventory checkers. */ 325 /* This must be before the checks below. Code for inventory checkers. */
341 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 326 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
342 { 327 {
… …
406 * 391 *
407 * Note this used to be arch_blocked, but with new movement 392 * Note this used to be arch_blocked, but with new movement
408 * code, we need to have actual object to check its move_type 393 * code, we need to have actual object to check its move_type
409 * against the move_block values. 394 * against the move_block values.
410 */ 395 */
411
412int 396int
413ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 397ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
414{ 398{
415 archetype *tmp; 399 archetype *tmp;
416 int flag; 400 int flag;
… …
422 flag = get_map_flags (m, &m1, x, y, &sx, &sy); 406 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
423 if (flag & P_OUT_OF_MAP) 407 if (flag & P_OUT_OF_MAP)
424 return P_OUT_OF_MAP; 408 return P_OUT_OF_MAP;
425 409
426 /* don't have object, so don't know what types would block */ 410 /* don't have object, so don't know what types would block */
427 return (GET_MAP_MOVE_BLOCK (m1, sx, sy)); 411 return m1->at (sx, sy).move_block;
428 } 412 }
429 413
430 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more) 414 for (tmp = ob->arch; tmp; tmp = tmp->more)
431 { 415 {
432 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 416 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
433 417
434 if (flag & P_OUT_OF_MAP) 418 if (flag & P_OUT_OF_MAP)
435 return P_OUT_OF_MAP; 419 return P_OUT_OF_MAP;
436 if (flag & P_IS_ALIVE) 420 if (flag & P_IS_ALIVE)
437 return P_IS_ALIVE; 421 return P_IS_ALIVE;
438 422
423 mapspace &ms = m1->at (sx, sy);
424
425
439 /* find_first_free_spot() calls this function. However, often 426 /* find_first_free_spot() calls this function. However, often
440 * ob doesn't have any move type (when used to place exits) 427 * 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. 428 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
442 */ 429 */
443 430
444 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL) 431 if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
445 continue; 432 continue;
446 433
447 /* Note it is intentional that we check ob - the movement type of the 434 /* Note it is intentional that we check ob - the movement type of the
448 * head of the object should correspond for the entire object. 435 * head of the object should correspond for the entire object.
449 */ 436 */
450 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) 437 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
451 return AB_NO_PASS; 438 return P_NO_PASS;
452
453 } 439 }
440
454 return 0; 441 return 0;
455} 442}
456 443
457/* When the map is loaded, load_object does not actually insert objects 444/* 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 445 * into inventory, but just links them. What this does is go through
… …
485 * for objects whose arch says they are multipart yet according to the 472 * for objects whose arch says they are multipart yet according to the
486 * info we have, they only have the head (as would be expected when 473 * info we have, they only have the head (as would be expected when
487 * they are saved). We do have to look for the old maps that did save 474 * they are saved). We do have to look for the old maps that did save
488 * the more sections and not re-add sections for them. 475 * the more sections and not re-add sections for them.
489 */ 476 */
490
491static void 477static void
492link_multipart_objects (maptile *m) 478link_multipart_objects (maptile *m)
493{ 479{
494 int x, y; 480 int x, y;
495 object *tmp, *op, *last, *above; 481 object *tmp, *op, *last, *above;
496 archetype *at; 482 archetype *at;
497 483
498 for (x = 0; x < MAP_WIDTH (m); x++) 484 for (x = 0; x < m->width; x++)
499 for (y = 0; y < MAP_HEIGHT (m); y++) 485 for (y = 0; y < m->height; y++)
500 for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above) 486 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above)
501 { 487 {
502 above = tmp->above; 488 above = tmp->above;
503 489
504 /* already multipart - don't do anything more */ 490 /* already multipart - don't do anything more */
505 if (tmp->head || tmp->more) 491 if (tmp->head || tmp->more)
… …
540{ 526{
541 int i, j; 527 int i, j;
542 int unique; 528 int unique;
543 object *op, *prev = NULL, *last_more = NULL, *otmp; 529 object *op, *prev = NULL, *last_more = NULL, *otmp;
544 530
545 op = get_object (); 531 op = object::create ();
546 op->map = m; /* To handle buttons correctly */ 532 op->map = m; /* To handle buttons correctly */
547 533
548 while ((i = load_object (fp, op, mapflags))) 534 while ((i = load_object (fp, op, mapflags)))
549 { 535 {
550 /* if the archetype for the object is null, means that we 536 /* if the archetype for the object is null, means that we
… …
555 { 541 {
556 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 542 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
557 continue; 543 continue;
558 } 544 }
559 545
560
561 switch (i) 546 switch (i)
562 { 547 {
563 case LL_NORMAL: 548 case LL_NORMAL:
564 /* if we are loading an overlay, put the floors on the bottom */ 549 /* 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) 550 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); 551 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
567 else 552 else
568 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 553 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
569 554
570 if (op->inv) 555 if (op->inv)
571 sum_weight (op); 556 sum_weight (op);
572 557
573 prev = op, last_more = op; 558 prev = op, last_more = op;
574 break; 559 break;
575 560
576 case LL_MORE: 561 case LL_MORE:
577 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 562 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; 563 op->head = prev, last_more->more = op, last_more = op;
579 break; 564 break;
580 } 565 }
581 566
582 if (mapflags & MAP_STYLE) 567 if (mapflags & MAP_STYLE)
583 remove_from_active_list (op); 568 remove_from_active_list (op);
584 569
585 op = get_object (); 570 op = object::create ();
586 op->map = m; 571 op->map = m;
587 } 572 }
588 573
589 for (i = 0; i < m->width; i++) 574 for (i = 0; i < m->width; i++)
590 { 575 {
591 for (j = 0; j < m->height; j++) 576 for (j = 0; j < m->height; j++)
592 { 577 {
593 unique = 0; 578 unique = 0;
594 /* check for unique items, or unique squares */ 579 /* check for unique items, or unique squares */
595 for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) 580 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
596 { 581 {
597 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) 582 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
598 unique = 1; 583 unique = 1;
584
599 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) 585 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
600 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); 586 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
601 } 587 }
602 } 588 }
603 } 589 }
604 590
605 free_object (op); 591 op->destroy ();
606 link_multipart_objects (m); 592 link_multipart_objects (m);
607} 593}
608 594
609/* This saves all the objects on the map in a non destructive fashion. 595/* 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, 596 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
611 * and we only save the head of multi part objects - this is needed 597 * and we only save the head of multi part objects - this is needed
612 * in order to do map tiling properly. 598 * in order to do map tiling properly.
613 */ 599 */
614void 600void
615save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag) 601save_objects (maptile *m, object_freezer &fp, object_freezer &fp2, int flag)
616{ 602{
617 int i, j = 0, unique = 0; 603 int i, j = 0, unique = 0;
618 object *op; 604 object *op;
619 605
620 /* first pass - save one-part objects */ 606 /* first pass - save one-part objects */
621 for (i = 0; i < MAP_WIDTH (m); i++) 607 for (i = 0; i < m->width; i++)
622 for (j = 0; j < MAP_HEIGHT (m); j++) 608 for (j = 0; j < m->height; j++)
623 { 609 {
624 unique = 0; 610 unique = 0;
611
625 for (op = get_map_ob (m, i, j); op; op = op->above) 612 for (op = m->at (i, j).bot; op; op = op->above)
626 { 613 {
627 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 614 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
628 unique = 1; 615 unique = 1;
629 616
630 if (op->type == PLAYER) 617 if (op->type == PLAYER)
631 {
632 LOG (llevDebug, "Player on map that is being saved\n");
633 continue; 618 continue;
634 }
635 619
636 if (op->head || op->owner) 620 if (op->head || op->owner)
637 continue; 621 continue;
638 622
639 if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) 623 if (unique || op->flag [FLAG_UNIQUE])
640 save_object (fp2, op, 3); 624 save_object (fp2, op, 1);
641 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) 625 else if (flag == 0 || (flag == 2 && (!op->flag [FLAG_OBJ_ORIGINAL] && !op->flag [FLAG_UNPAID])))
642 save_object (fp, op, 3); 626 save_object (fp, op, 1);
643 627 }
644 } /* for this space */ 628 }
645 } /* for this j */
646} 629}
647 630
648maptile::maptile () 631maptile::maptile ()
649{ 632{
650 in_memory = MAP_SWAPPED; 633 in_memory = MAP_SWAPPED;
651 /* The maps used to pick up default x and y values from the 634 /* The maps used to pick up default x and y values from the
652 * map archetype. Mimic that behaviour. 635 * map archetype. Mimic that behaviour.
653 */ 636 */
654 MAP_WIDTH (this) = 16; 637 width = 16;
655 MAP_HEIGHT (this) = 16; 638 height = 16;
656 MAP_RESET_TIMEOUT (this) = 0; 639 reset_timeout = 0;
657 MAP_TIMEOUT (this) = 300; 640 timeout = 300;
658 MAP_ENTER_X (this) = 0; 641 enter_x = 0;
659 MAP_ENTER_Y (this) = 0; 642 enter_y = 0;
660 /*set part to -1 indicating conversion to weather map not yet done */ 643 /*set part to -1 indicating conversion to weather map not yet done */
661 MAP_WORLDPARTX (this) = -1; 644 worldpartx = -1;
662 MAP_WORLDPARTY (this) = -1; 645 worldparty = -1;
663} 646}
664 647
665/* 648/*
666 * Allocates, initialises, and returns a pointer to a maptile. 649 * Allocates, initialises, and returns a pointer to a maptile.
667 * Modified to no longer take a path option which was not being 650 * Modified to no longer take a path option which was not being
668 * used anyways. MSW 2001-07-01 651 * used anyways. MSW 2001-07-01
669 */ 652 */
670maptile * 653maptile *
671get_linked_map (void) 654get_linked_map (void)
672{ 655{
673 maptile *mp, *map = new maptile; 656 maptile *map = new maptile;
674 657
675 for (mp = first_map; mp && mp->next; mp = mp->next); 658 map->next = first_map;
676
677 if (mp == NULL)
678 first_map = map; 659 first_map = map;
679 else
680 mp->next = map;
681 660
682 return map; 661 return map;
683} 662}
684 663
685/* 664/*
… …
697 * that is their poor assumption. 676 * that is their poor assumption.
698 */ 677 */
699 if (spaces) 678 if (spaces)
700 { 679 {
701 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path); 680 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
702 free (spaces); 681 sfree (spaces, size ());
703 } 682 }
704 683
705 spaces = (MapSpace *) 684 spaces = salloc0<mapspace> (size ());
706 calloc (1, width * height * sizeof (MapSpace));
707
708 if (!spaces)
709 fatal (OUT_OF_MEMORY);
710} 685}
711 686
712/* Create and returns a map of the specific size. Used 687/* Create and returns a map of the specific size. Used
713 * in random map code and the editor. 688 * in random map code and the editor.
714 */ 689 */
… …
737 char *shop_string, *p, *q, *next_semicolon, *next_colon; 712 char *shop_string, *p, *q, *next_semicolon, *next_colon;
738 shopitems *items = NULL; 713 shopitems *items = NULL;
739 int i = 0, number_of_entries = 0; 714 int i = 0, number_of_entries = 0;
740 const typedata *current_type; 715 const typedata *current_type;
741 716
742 shop_string = strdup_local (input_string); 717 shop_string = strdup (input_string);
743 p = shop_string; 718 p = shop_string;
744 /* first we'll count the entries, we'll need that for allocating the array shortly */ 719 /* first we'll count the entries, we'll need that for allocating the array shortly */
745 while (p) 720 while (p)
746 { 721 {
747 p = strchr (p, ';'); 722 p = strchr (p, ';');
… …
933 * with nothing between). There is no reason in those cases to 908 * with nothing between). There is no reason in those cases to
934 * keep the empty message. Also, msgbuf contains garbage data 909 * keep the empty message. Also, msgbuf contains garbage data
935 * when msgpos is zero, so copying it results in crashes 910 * when msgpos is zero, so copying it results in crashes
936 */ 911 */
937 if (msgpos != 0) 912 if (msgpos != 0)
938 m->msg = strdup_local (msgbuf); 913 m->msg = strdup (msgbuf);
939 } 914 }
940 else if (!strcmp (key, "maplore")) 915 else if (!strcmp (key, "maplore"))
941 { 916 {
942 while (fgets (buf, HUGE_BUF, fp) != NULL) 917 while (fgets (buf, HUGE_BUF, fp) != NULL)
943 { 918 {
… …
949 strcpy (maplorebuf + maplorepos, buf); 924 strcpy (maplorebuf + maplorepos, buf);
950 maplorepos += strlen (buf); 925 maplorepos += strlen (buf);
951 } 926 }
952 } 927 }
953 if (maplorepos != 0) 928 if (maplorepos != 0)
954 m->maplore = strdup_local (maplorebuf); 929 m->maplore = strdup (maplorebuf);
955 } 930 }
956 else if (!strcmp (key, "end")) 931 else if (!strcmp (key, "end"))
957 { 932 {
958 break; 933 break;
959 } 934 }
… …
968 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value); 943 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
969 } 944 }
970 else if (!strcmp (key, "name")) 945 else if (!strcmp (key, "name"))
971 { 946 {
972 *end = 0; 947 *end = 0;
973 m->name = strdup_local (value); 948 m->name = strdup (value);
974 } 949 }
975 /* first strcmp value on these are old names supported 950 /* first strcmp value on these are old names supported
976 * for compatibility reasons. The new values (second) are 951 * for compatibility reasons. The new values (second) are
977 * what really should be used. 952 * what really should be used.
978 */ 953 */
979 else if (!strcmp (key, "oid")) 954 else if (!strcmp (key, "oid"))
980 {
981 fp.get (m, atoi (value)); 955 fp.get (m, atoi (value));
982 }
983 else if (!strcmp (key, "attach")) 956 else if (!strcmp (key, "attach"))
984 {
985 m->attach = value; 957 m->attach = value;
986 }
987 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x")) 958 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
988 {
989 m->enter_x = atoi (value); 959 m->enter_x = atoi (value);
990 }
991 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y")) 960 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
992 {
993 m->enter_y = atoi (value); 961 m->enter_y = atoi (value);
994 }
995 else if (!strcmp (key, "x") || !strcmp (key, "width")) 962 else if (!strcmp (key, "x") || !strcmp (key, "width"))
996 {
997 m->width = atoi (value); 963 m->width = atoi (value);
998 }
999 else if (!strcmp (key, "y") || !strcmp (key, "height")) 964 else if (!strcmp (key, "y") || !strcmp (key, "height"))
1000 {
1001 m->height = atoi (value); 965 m->height = atoi (value);
1002 }
1003 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout")) 966 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
1004 {
1005 m->reset_timeout = atoi (value); 967 m->reset_timeout = atoi (value);
1006 }
1007 else if (!strcmp (key, "value") || !strcmp (key, "swap_time")) 968 else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
1008 {
1009 m->timeout = atoi (value); 969 m->timeout = atoi (value);
1010 }
1011 else if (!strcmp (key, "level") || !strcmp (key, "difficulty")) 970 else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
1012 { 971 m->difficulty = clamp (atoi (value), 1, settings.max_level);
1013 m->difficulty = atoi (value);
1014 }
1015 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness")) 972 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
1016 {
1017 m->darkness = atoi (value); 973 m->darkness = atoi (value);
1018 }
1019 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime")) 974 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
1020 {
1021 m->fixed_resettime = atoi (value); 975 m->fixed_resettime = atoi (value);
1022 }
1023 else if (!strcmp (key, "unique")) 976 else if (!strcmp (key, "unique"))
1024 {
1025 m->unique = atoi (value); 977 m->unique = atoi (value);
1026 }
1027 else if (!strcmp (key, "template")) 978 else if (!strcmp (key, "template"))
1028 {
1029 m->templatemap = atoi (value); 979 m->templatemap = atoi (value);
1030 }
1031 else if (!strcmp (key, "region")) 980 else if (!strcmp (key, "region"))
1032 {
1033 m->region = get_region_by_name (value); 981 m->region = get_region_by_name (value);
1034 }
1035 else if (!strcmp (key, "shopitems")) 982 else if (!strcmp (key, "shopitems"))
1036 { 983 {
1037 *end = 0; 984 *end = 0;
1038 m->shopitems = parse_shop_string (value); 985 m->shopitems = parse_shop_string (value);
1039 } 986 }
1040 else if (!strcmp (key, "shopgreed")) 987 else if (!strcmp (key, "shopgreed"))
1041 {
1042 m->shopgreed = atof (value); 988 m->shopgreed = atof (value);
1043 }
1044 else if (!strcmp (key, "shopmin")) 989 else if (!strcmp (key, "shopmin"))
1045 {
1046 m->shopmin = atol (value); 990 m->shopmin = atol (value);
1047 }
1048 else if (!strcmp (key, "shopmax")) 991 else if (!strcmp (key, "shopmax"))
1049 {
1050 m->shopmax = atol (value); 992 m->shopmax = atol (value);
1051 }
1052 else if (!strcmp (key, "shoprace")) 993 else if (!strcmp (key, "shoprace"))
1053 { 994 {
1054 *end = 0; 995 *end = 0;
1055 m->shoprace = strdup_local (value); 996 m->shoprace = strdup (value);
1056 } 997 }
1057 else if (!strcmp (key, "outdoor")) 998 else if (!strcmp (key, "outdoor"))
1058 {
1059 m->outdoor = atoi (value); 999 m->outdoor = atoi (value);
1060 }
1061 else if (!strcmp (key, "temp")) 1000 else if (!strcmp (key, "temp"))
1062 {
1063 m->temp = atoi (value); 1001 m->temp = atoi (value);
1064 }
1065 else if (!strcmp (key, "pressure")) 1002 else if (!strcmp (key, "pressure"))
1066 {
1067 m->pressure = atoi (value); 1003 m->pressure = atoi (value);
1068 }
1069 else if (!strcmp (key, "humid")) 1004 else if (!strcmp (key, "humid"))
1070 {
1071 m->humid = atoi (value); 1005 m->humid = atoi (value);
1072 }
1073 else if (!strcmp (key, "windspeed")) 1006 else if (!strcmp (key, "windspeed"))
1074 {
1075 m->windspeed = atoi (value); 1007 m->windspeed = atoi (value);
1076 }
1077 else if (!strcmp (key, "winddir")) 1008 else if (!strcmp (key, "winddir"))
1078 {
1079 m->winddir = atoi (value); 1009 m->winddir = atoi (value);
1080 }
1081 else if (!strcmp (key, "sky")) 1010 else if (!strcmp (key, "sky"))
1082 {
1083 m->sky = atoi (value); 1011 m->sky = atoi (value);
1084 }
1085 else if (!strcmp (key, "nosmooth")) 1012 else if (!strcmp (key, "nosmooth"))
1086 {
1087 m->nosmooth = atoi (value); 1013 m->nosmooth = atoi (value);
1088 }
1089 else if (!strncmp (key, "tile_path_", 10)) 1014 else if (!strncmp (key, "tile_path_", 10))
1090 { 1015 {
1091 int tile = atoi (key + 10); 1016 int tile = atoi (key + 10);
1092 1017
1093 if (tile < 1 || tile > 4) 1018 if (tile < 1 || tile > 4)
… …
1126 } 1051 }
1127 1052
1128 if (editor) 1053 if (editor)
1129 { 1054 {
1130 /* Use the value as in the file. */ 1055 /* Use the value as in the file. */
1131 m->tile_path[tile - 1] = strdup_local (value); 1056 m->tile_path[tile - 1] = strdup (value);
1132 } 1057 }
1133 else if (path != NULL) 1058 else if (path != NULL)
1134 { 1059 {
1135 /* Use the normalized value. */ 1060 /* Use the normalized value. */
1136 m->tile_path[tile - 1] = strdup_local (path); 1061 m->tile_path[tile - 1] = strdup (path);
1137 } 1062 }
1138 } /* end if tile direction (in)valid */ 1063 } /* end if tile direction (in)valid */
1139 } 1064 }
1140 else 1065 else
1141 {
1142 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value); 1066 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
1143 }
1144 } 1067 }
1068
1145 if (!key || strcmp (key, "end")) 1069 if (!key || strcmp (key, "end"))
1146 { 1070 {
1147 LOG (llevError, "Got premature eof on map header!\n"); 1071 LOG (llevError, "Got premature eof on map header!\n");
1148 return 1; 1072 return 1;
1149 } 1073 }
1074
1150 return 0; 1075 return 0;
1151} 1076}
1152 1077
1153/* 1078/*
1154 * Opens the file "filename" and reads information about the map 1079 * Opens the file "filename" and reads information about the map
… …
1187 strcpy (m->path, filename); 1112 strcpy (m->path, filename);
1188 if (load_map_header (thawer, m)) 1113 if (load_map_header (thawer, m))
1189 { 1114 {
1190 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags); 1115 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1191 delete_map (m); 1116 delete_map (m);
1192 return NULL; 1117 return 0;
1193 } 1118 }
1194 1119
1195 m->allocate (); 1120 m->allocate ();
1196 1121
1197 m->in_memory = MAP_LOADING; 1122 m->in_memory = MAP_LOADING;
1198 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE)); 1123 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1199 1124
1200 m->in_memory = MAP_IN_MEMORY; 1125 m->in_memory = MAP_IN_MEMORY;
1201 if (!MAP_DIFFICULTY (m)) 1126 if (!m->difficulty)
1202 MAP_DIFFICULTY (m) = calculate_difficulty (m); 1127 m->difficulty = calculate_difficulty (m);
1203 set_map_reset_time (m); 1128 set_map_reset_time (m);
1204 m->instantiate (); 1129 m->instantiate ();
1205 return (m); 1130 return (m);
1206} 1131}
1207 1132
… …
1280 if (load_map_header (thawer, m)) 1205 if (load_map_header (thawer, m))
1281 { 1206 {
1282 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname); 1207 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1283 delete_map (m); 1208 delete_map (m);
1284 m = load_original_map (m->path, 0); 1209 m = load_original_map (m->path, 0);
1285 return NULL; 1210 return 0;
1286 } 1211 }
1287 /*m->allocate ();*/ 1212 /*m->allocate ();*/
1288 1213
1289 m->in_memory = MAP_LOADING; 1214 m->in_memory = MAP_LOADING;
1290 load_objects (m, thawer, MAP_OVERLAY); 1215 load_objects (m, thawer, MAP_OVERLAY);
… …
1302delete_unique_items (maptile *m) 1227delete_unique_items (maptile *m)
1303{ 1228{
1304 int i, j, unique; 1229 int i, j, unique;
1305 object *op, *next; 1230 object *op, *next;
1306 1231
1307 for (i = 0; i < MAP_WIDTH (m); i++) 1232 for (i = 0; i < m->width; i++)
1308 for (j = 0; j < MAP_HEIGHT (m); j++) 1233 for (j = 0; j < m->height; j++)
1309 { 1234 {
1310 unique = 0; 1235 unique = 0;
1236
1311 for (op = get_map_ob (m, i, j); op; op = next) 1237 for (op = GET_MAP_OB (m, i, j); op; op = next)
1312 { 1238 {
1313 next = op->above; 1239 next = op->above;
1240
1314 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 1241 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1315 unique = 1; 1242 unique = 1;
1243
1316 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 1244 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1317 { 1245 {
1318 clean_object (op); 1246 op->destroy_inv (false);
1319 if (QUERY_FLAG (op, FLAG_IS_LINKED)) 1247 op->destroy ();
1320 remove_button_link (op);
1321 remove_ob (op);
1322 free_object (op);
1323 } 1248 }
1324 } 1249 }
1325 } 1250 }
1326} 1251}
1327 1252
1328
1329/* 1253/*
1330 * Loads unique objects from file(s) into the map which is in memory 1254 * Loads unique objects from file(s) into the map which is in memory
1331 * m is the map to load unique items into. 1255 * m is the map to load unique items into.
1332 */ 1256 */
1333static void 1257static void
… …
1352 return; 1276 return;
1353 1277
1354 m->in_memory = MAP_LOADING; 1278 m->in_memory = MAP_LOADING;
1355 if (m->tmpname == NULL) /* if we have loaded unique items from */ 1279 if (m->tmpname == NULL) /* if we have loaded unique items from */
1356 delete_unique_items (m); /* original map before, don't duplicate them */ 1280 delete_unique_items (m); /* original map before, don't duplicate them */
1281
1357 load_objects (m, thawer, 0); 1282 load_objects (m, thawer, 0);
1358 1283
1359 m->in_memory = MAP_IN_MEMORY; 1284 m->in_memory = MAP_IN_MEMORY;
1360} 1285}
1361
1362 1286
1363/* 1287/*
1364 * Saves a map to file. If flag is set, it is saved into the same 1288 * Saves a map to file. If flag is set, it is saved into the same
1365 * file it was (originally) loaded from. Otherwise a temporary 1289 * file it was (originally) loaded from. Otherwise a temporary
1366 * filename will be genarated, and the file will be stored there. 1290 * filename will be genarated, and the file will be stored there.
1367 * The temporary filename will be stored in the maptileure. 1291 * The temporary filename will be stored in the maptileure.
1368 * If the map is unique, we also save to the filename in the map 1292 * If the map is unique, we also save to the filename in the map
1369 * (this should have been updated when first loaded) 1293 * (this should have been updated when first loaded)
1370 */ 1294 */
1371
1372int 1295int
1373new_save_map (maptile *m, int flag) 1296new_save_map (maptile *m, int flag)
1374{ 1297{
1375 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; 1298 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1376 int i; 1299 int i;
… …
1396 make_path_to_file (filename); 1319 make_path_to_file (filename);
1397 } 1320 }
1398 else 1321 else
1399 { 1322 {
1400 if (!m->tmpname) 1323 if (!m->tmpname)
1401 m->tmpname = tempnam_local (settings.tmpdir, NULL); 1324 m->tmpname = tempnam (settings.tmpdir, NULL);
1402 1325
1403 strcpy (filename, m->tmpname); 1326 strcpy (filename, m->tmpname);
1404 } 1327 }
1405 1328
1406 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); 1329 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
… …
1430 print_shop_string (m, shop); 1353 print_shop_string (m, shop);
1431 fprintf (freezer, "shopitems %s\n", shop); 1354 fprintf (freezer, "shopitems %s\n", shop);
1432 } 1355 }
1433 if (m->shopgreed) 1356 if (m->shopgreed)
1434 fprintf (freezer, "shopgreed %f\n", m->shopgreed); 1357 fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1435#ifndef WIN32
1436 if (m->shopmin) 1358 if (m->shopmin)
1437 fprintf (freezer, "shopmin %llu\n", m->shopmin); 1359 fprintf (freezer, "shopmin %llu\n", m->shopmin);
1438 if (m->shopmax) 1360 if (m->shopmax)
1439 fprintf (freezer, "shopmax %llu\n", m->shopmax); 1361 fprintf (freezer, "shopmax %llu\n", m->shopmax);
1440#else
1441 if (m->shopmin)
1442 fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1443 if (m->shopmax)
1444 fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1445#endif
1446 if (m->shoprace) 1362 if (m->shoprace)
1447 fprintf (freezer, "shoprace %s\n", m->shoprace); 1363 fprintf (freezer, "shoprace %s\n", m->shoprace);
1448 if (m->darkness) 1364 if (m->darkness)
1449 fprintf (freezer, "darkness %d\n", m->darkness); 1365 fprintf (freezer, "darkness %d\n", m->darkness);
1450 if (m->width) 1366 if (m->width)
… …
1515 freezer.save (filename); 1431 freezer.save (filename);
1516 1432
1517 return 0; 1433 return 0;
1518} 1434}
1519 1435
1520
1521/*
1522 * Remove and free all objects in the inventory of the given object.
1523 * object.c ?
1524 */
1525
1526void
1527clean_object (object *op)
1528{
1529 object *tmp, *next;
1530
1531 for (tmp = op->inv; tmp; tmp = next)
1532 {
1533 next = tmp->below;
1534 clean_object (tmp);
1535 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1536 remove_button_link (tmp);
1537 remove_ob (tmp);
1538 free_object (tmp);
1539 }
1540}
1541
1542/* 1436/*
1543 * Remove and free all objects in the given map. 1437 * Remove and free all objects in the given map.
1544 */ 1438 */
1545
1546void 1439void
1547free_all_objects (maptile *m) 1440free_all_objects (maptile *m)
1548{ 1441{
1549 int i, j; 1442 if (!m->spaces)
1550 object *op; 1443 return;
1551 1444
1552 for (i = 0; i < MAP_WIDTH (m); i++) 1445 for (int i = 0; i < m->width; i++)
1553 for (j = 0; j < MAP_HEIGHT (m); j++) 1446 for (int j = 0; j < m->height; j++)
1554 { 1447 {
1555 object *previous_obj = NULL; 1448 mapspace &ms = m->at (i, j);
1556 1449
1557 while ((op = GET_MAP_OB (m, i, j)) != NULL) 1450 while (object *op = ms.bot)
1558 { 1451 {
1559 if (op == previous_obj)
1560 {
1561 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1562 break;
1563 }
1564 previous_obj = op;
1565 if (op->head != NULL) 1452 if (op->head)
1566 op = op->head; 1453 op = op->head;
1567 1454
1568 /* If the map isn't in memory, free_object will remove and 1455 op->destroy_inv (false);
1569 * free objects in op's inventory. So let it do the job. 1456 op->destroy ();
1570 */
1571 if (m->in_memory == MAP_IN_MEMORY)
1572 clean_object (op);
1573 remove_ob (op);
1574 free_object (op);
1575 } 1457 }
1576 } 1458 }
1577} 1459}
1578 1460
1579/* 1461/*
1580 * Frees everything allocated by the given maptileure. 1462 * Frees everything allocated by the given maptileure.
1581 * don't free tmpname - our caller is left to do that 1463 * don't free tmpname - our caller is left to do that
1582 */ 1464 */
1583
1584void 1465void
1585free_map (maptile *m, int flag) 1466free_map (maptile *m, int flag)
1586{ 1467{
1587 int i; 1468 if (!m->in_memory) //TODO: makes no sense to me?
1588
1589 if (!m->in_memory)
1590 {
1591 LOG (llevError, "Trying to free freed map.\n");
1592 return; 1469 return;
1593 } 1470
1471 m->in_memory = MAP_SAVING;
1472
1473 // TODO: use new/delete
1474
1594 if (flag && m->spaces) 1475 if (flag && m->spaces)
1595 free_all_objects (m); 1476 free_all_objects (m);
1596 if (m->name) 1477
1597 FREE_AND_CLEAR (m->name); 1478 sfree (m->spaces, m->size ()), m->spaces = 0;
1598 if (m->spaces) 1479
1599 FREE_AND_CLEAR (m->spaces); 1480 free (m->name), m->name = 0;
1600 if (m->msg) 1481 free (m->msg), m->msg = 0;
1601 FREE_AND_CLEAR (m->msg); 1482 free (m->maplore), m->maplore = 0;
1602 if (m->maplore) 1483 free (m->shoprace), m->shoprace = 0;
1603 FREE_AND_CLEAR (m->maplore); 1484 delete [] m->shopitems, m->shopitems = 0;
1604 if (m->shopitems) 1485
1605 delete[]m->shopitems;
1606 m->shopitems = 0;
1607 if (m->shoprace)
1608 FREE_AND_CLEAR (m->shoprace);
1609 if (m->buttons) 1486 if (m->buttons)
1610 free_objectlinkpt (m->buttons); 1487 free_objectlinkpt (m->buttons), m->buttons = 0;
1611 m->buttons = NULL; 1488
1612 for (i = 0; i < 4; i++) 1489 for (int i = 0; i < 4; i++)
1613 { 1490 free (m->tile_path[i]), m->tile_path[i] = 0;
1614 if (m->tile_path[i]) 1491
1615 FREE_AND_CLEAR (m->tile_path[i]);
1616 m->tile_map[i] = NULL;
1617 }
1618 m->in_memory = MAP_SWAPPED; 1492 m->in_memory = MAP_SWAPPED;
1619} 1493}
1620 1494
1621/* 1495maptile::~maptile ()
1622 * function: vanish maptile 1496{
1623 * m : pointer to maptile, if NULL no action 1497 assert (destroyed ());
1624 * this deletes all the data on the map (freeing pointers) 1498}
1625 * and then removes this map from the global linked list of maps. 1499
1500void
1501maptile::do_destroy ()
1502{
1503 attachable::do_destroy ();
1504
1505 free_map (this, 1);
1506 free (tmpname), tmpname = 0;
1507
1508 /* We need to look through all the maps and see if any maps
1509 * are pointing at this one for tiling information. Since
1510 * tiling can be asymetric, we just can not look to see which
1511 * maps this map tiles with and clears those.
1626 */ 1512 */
1513 //TODO: non-euclidean-tiling MUST GO
1514 for_all_maps (m)
1515 for (int i = 0; i < 4; i++)
1516 if (m->tile_map[i] == this)
1517 m->tile_map[i] = 0;
1627 1518
1519 if (first_map == this)
1520 first_map = next;
1521 else
1522 for_all_maps (m)
1523 if (m->next = this)
1524 {
1525 m->next = next;
1526 break;
1527 }
1528}
1529
1530//TODO: must go
1628void 1531void
1629delete_map (maptile *m) 1532delete_map (maptile *m)
1630{ 1533{
1631 maptile *tmp, *last;
1632 int i;
1633
1634 if (!m) 1534 if (m)
1635 return; 1535 m->destroy ();
1636
1637 m->clear ();
1638
1639 if (m->in_memory == MAP_IN_MEMORY)
1640 {
1641 /* change to MAP_SAVING, even though we are not,
1642 * so that remove_ob doesn't do as much work.
1643 */
1644 m->in_memory = MAP_SAVING;
1645 free_map (m, 1);
1646 }
1647 /* move this out of free_map, since tmpname can still be needed if
1648 * the map is swapped out.
1649 */
1650 if (m->tmpname)
1651 {
1652 free (m->tmpname);
1653 m->tmpname = NULL;
1654 }
1655 last = NULL;
1656 /* We need to look through all the maps and see if any maps
1657 * are pointing at this one for tiling information. Since
1658 * tiling can be assymetric, we just can not look to see which
1659 * maps this map tiles with and clears those.
1660 */
1661 for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1662 {
1663 if (tmp->next == m)
1664 last = tmp;
1665
1666 /* This should hopefully get unrolled on a decent compiler */
1667 for (i = 0; i < 4; i++)
1668 if (tmp->tile_map[i] == m)
1669 tmp->tile_map[i] = NULL;
1670 }
1671
1672 /* If last is null, then this should be the first map in the list */
1673 if (!last)
1674 {
1675 if (m == first_map)
1676 first_map = m->next;
1677 else
1678 /* m->path is a static char, so should hopefully still have
1679 * some useful data in it.
1680 */
1681 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1682 }
1683 else
1684 last->next = m->next;
1685
1686 delete m;
1687} 1536}
1688
1689
1690 1537
1691/* 1538/*
1692 * Makes sure the given map is loaded and swapped in. 1539 * Makes sure the given map is loaded and swapped in.
1693 * name is path name of the map. 1540 * name is path name of the map.
1694 * flags meaning: 1541 * flags meaning:
… …
1697 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. 1544 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1698 * dont do any more name translation on it. 1545 * dont do any more name translation on it.
1699 * 1546 *
1700 * Returns a pointer to the given map. 1547 * Returns a pointer to the given map.
1701 */ 1548 */
1702
1703maptile * 1549maptile *
1704ready_map_name (const char *name, int flags) 1550ready_map_name (const char *name, int flags)
1705{ 1551{
1706 maptile *m;
1707
1708 if (!name) 1552 if (!name)
1709 return (NULL); 1553 return 0;
1710 1554
1711 /* Have we been at this level before? */ 1555 /* Have we been at this level before? */
1712 m = has_been_loaded (name); 1556 maptile *m = has_been_loaded (name);
1713 1557
1714 /* Map is good to go, so just return it */ 1558 /* Map is good to go, so just return it */
1715 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) 1559 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1716 {
1717 return m; 1560 return m;
1718 }
1719 1561
1720 /* unique maps always get loaded from their original location, and never 1562 /* unique maps always get loaded from their original location, and never
1721 * a temp location. Likewise, if map_flush is set, or we have never loaded 1563 * a temp location. Likewise, if map_flush is set, or we have never loaded
1722 * this map, load it now. I removed the reset checking from here - 1564 * this map, load it now. I removed the reset checking from here -
1723 * it seems the probability of a player trying to enter a map that should 1565 * it seems the probability of a player trying to enter a map that should
… …
1725 * a bit cleaner (and players probably shouldn't rely on exact timing for 1567 * a bit cleaner (and players probably shouldn't rely on exact timing for
1726 * resets in any case - if they really care, they should use the 'maps command. 1568 * resets in any case - if they really care, they should use the 'maps command.
1727 */ 1569 */
1728 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m) 1570 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1729 { 1571 {
1730
1731 /* first visit or time to reset */ 1572 /* first visit or time to reset */
1732 if (m) 1573 if (m)
1733 { 1574 {
1734 clean_tmp_map (m); /* Doesn't make much difference */ 1575 clean_tmp_map (m); /* Doesn't make much difference */
1735 delete_map (m); 1576 delete_map (m);
… …
1822 int x, y, i; 1663 int x, y, i;
1823 long monster_cnt = 0; 1664 long monster_cnt = 0;
1824 double avgexp = 0; 1665 double avgexp = 0;
1825 sint64 total_exp = 0; 1666 sint64 total_exp = 0;
1826 1667
1827 if (MAP_DIFFICULTY (m)) 1668 if (m->difficulty)
1828 { 1669 {
1829 LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m)); 1670 LOG (llevDebug, "Using stored map difficulty: %d\n", m->difficulty);
1830 return MAP_DIFFICULTY (m); 1671 return m->difficulty;
1831 } 1672 }
1832 1673
1833 for (x = 0; x < MAP_WIDTH (m); x++) 1674 for (x = 0; x < m->width; x++)
1834 for (y = 0; y < MAP_HEIGHT (m); y++) 1675 for (y = 0; y < m->height; y++)
1835 for (op = get_map_ob (m, x, y); op != NULL; op = op->above) 1676 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1836 { 1677 {
1837 if (QUERY_FLAG (op, FLAG_MONSTER)) 1678 if (QUERY_FLAG (op, FLAG_MONSTER))
1838 { 1679 {
1839 total_exp += op->stats.exp; 1680 total_exp += op->stats.exp;
1840 monster_cnt++; 1681 monster_cnt++;
… …
1888 if (first_map->in_memory == MAP_SAVING) 1729 if (first_map->in_memory == MAP_SAVING)
1889 first_map->in_memory = MAP_IN_MEMORY; 1730 first_map->in_memory = MAP_IN_MEMORY;
1890 delete_map (first_map); 1731 delete_map (first_map);
1891 real_maps++; 1732 real_maps++;
1892 } 1733 }
1734
1893 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps); 1735 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1894} 1736}
1895 1737
1896/* change_map_light() - used to change map light level (darkness) 1738/* change_map_light() - used to change map light level (darkness)
1897 * up or down. Returns true if successful. It should now be 1739 * up or down. Returns true if successful. It should now be
… …
1933 /* All clients need to get re-updated for the change */ 1775 /* All clients need to get re-updated for the change */
1934 update_all_map_los (m); 1776 update_all_map_los (m);
1935 return 1; 1777 return 1;
1936} 1778}
1937 1779
1938
1939/* 1780/*
1940 * This function updates various attributes about a specific space 1781 * This function updates various attributes about a specific space
1941 * on the map (what it looks like, whether it blocks magic, 1782 * on the map (what it looks like, whether it blocks magic,
1942 * has a living creatures, prevents people from passing 1783 * has a living creatures, prevents people from passing
1943 * through, etc) 1784 * through, etc)
1944 */ 1785 */
1945void 1786void
1946update_position (maptile *m, int x, int y) 1787mapspace::update_ ()
1947{ 1788{
1948 object *tmp, *last = NULL; 1789 object *tmp, *last = 0;
1949 uint8 flags = 0, oldflags, light = 0, anywhere = 0; 1790 uint8 flags = 0, light = 0, anywhere = 0;
1950 New_Face *top, *floor, *middle; 1791 New_Face *top, *floor, *middle;
1951 object *top_obj, *floor_obj, *middle_obj; 1792 object *top_obj, *floor_obj, *middle_obj;
1952 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1793 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1953 1794
1954 oldflags = GET_MAP_FLAGS (m, x, y);
1955 if (!(oldflags & P_NEED_UPDATE))
1956 {
1957 LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y);
1958 return;
1959 }
1960
1961 middle = blank_face; 1795 middle = blank_face;
1962 top = blank_face; 1796 top = blank_face;
1963 floor = blank_face; 1797 floor = blank_face;
1964 1798
1965 middle_obj = NULL; 1799 middle_obj = 0;
1966 top_obj = NULL; 1800 top_obj = 0;
1967 floor_obj = NULL; 1801 floor_obj = 0;
1968 1802
1969 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) 1803 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1970 { 1804 {
1971
1972 /* This could be made additive I guess (two lights better than 1805 /* This could be made additive I guess (two lights better than
1973 * one). But if so, it shouldn't be a simple additive - 2 1806 * one). But if so, it shouldn't be a simple additive - 2
1974 * light bulbs do not illuminate twice as far as once since 1807 * light bulbs do not illuminate twice as far as once since
1975 * it is a disapation factor that is squared (or is it cubed?) 1808 * it is a dissapation factor that is cubed.
1976 */ 1809 */
1977 if (tmp->glow_radius > light) 1810 if (tmp->glow_radius > light)
1978 light = tmp->glow_radius; 1811 light = tmp->glow_radius;
1979 1812
1980 /* This call is needed in order to update objects the player 1813 /* This call is needed in order to update objects the player
… …
2018 { 1851 {
2019 middle = tmp->face; 1852 middle = tmp->face;
2020 middle_obj = tmp; 1853 middle_obj = tmp;
2021 } 1854 }
2022 } 1855 }
1856
2023 if (tmp == tmp->above) 1857 if (tmp == tmp->above)
2024 { 1858 {
2025 LOG (llevError, "Error in structure of map\n"); 1859 LOG (llevError, "Error in structure of map\n");
2026 exit (-1); 1860 exit (-1);
2027 } 1861 }
2028 1862
2029 move_slow |= tmp->move_slow; 1863 move_slow |= tmp->move_slow;
2030 move_block |= tmp->move_block; 1864 move_block |= tmp->move_block;
2031 move_on |= tmp->move_on; 1865 move_on |= tmp->move_on;
2032 move_off |= tmp->move_off; 1866 move_off |= tmp->move_off;
2033 move_allow |= tmp->move_allow; 1867 move_allow |= tmp->move_allow;
2034 1868
2035 if (QUERY_FLAG (tmp, FLAG_ALIVE))
2036 flags |= P_IS_ALIVE;
2037 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC))
2038 flags |= P_NO_MAGIC;
2039 if (QUERY_FLAG (tmp, FLAG_DAMNED))
2040 flags |= P_NO_CLERIC;
2041 if (tmp->type == SAFE_GROUND)
2042 flags |= P_SAFE;
2043
2044 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) 1869 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;
2045 flags |= P_BLOCKSVIEW; 1870 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;
2046 } /* for stack of objects */ 1871 if (tmp->type == PLAYER) flags |= P_PLAYER;
2047 1872 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
2048 /* we don't want to rely on this function to have accurate flags, but 1873 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
2049 * since we're already doing the work, we calculate them here. 1874 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
2050 * if they don't match, logic is broken someplace.
2051 */
2052 if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR)))
2053 { 1875 }
2054 LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", 1876
2055 m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags); 1877 this->light = light;
2056 } 1878 this->flags_ = flags;
2057 SET_MAP_FLAGS (m, x, y, flags); 1879 this->move_block = move_block & ~move_allow;
2058 SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow); 1880 this->move_on = move_on;
2059 SET_MAP_MOVE_ON (m, x, y, move_on); 1881 this->move_off = move_off;
2060 SET_MAP_MOVE_OFF (m, x, y, move_off); 1882 this->move_slow = move_slow;
2061 SET_MAP_MOVE_SLOW (m, x, y, move_slow);
2062 1883
2063 /* At this point, we have a floor face (if there is a floor), 1884 /* At this point, we have a floor face (if there is a floor),
2064 * and the floor is set - we are not going to touch it at 1885 * and the floor is set - we are not going to touch it at
2065 * this point. 1886 * this point.
2066 * middle contains the highest visibility face. 1887 * middle contains the highest visibility face.
… …
2120 break; 1941 break;
2121 } 1942 }
2122 } 1943 }
2123 } 1944 }
2124 } 1945 }
1946
2125 if (middle == floor) 1947 if (middle == floor)
2126 middle = blank_face; 1948 middle = blank_face;
1949
2127 if (top == middle) 1950 if (top == middle)
2128 middle = blank_face; 1951 middle = blank_face;
2129 SET_MAP_FACE (m, x, y, top, 0);
2130 if (top != blank_face)
2131 SET_MAP_FACE_OBJ (m, x, y, top_obj, 0);
2132 else
2133 SET_MAP_FACE_OBJ (m, x, y, NULL, 0);
2134 SET_MAP_FACE (m, x, y, middle, 1);
2135 if (middle != blank_face)
2136 SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1);
2137 else
2138 SET_MAP_FACE_OBJ (m, x, y, NULL, 1);
2139 SET_MAP_FACE (m, x, y, floor, 2);
2140 if (floor != blank_face)
2141 SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2);
2142 else
2143 SET_MAP_FACE_OBJ (m, x, y, NULL, 2);
2144 SET_MAP_LIGHT (m, x, y, light);
2145}
2146 1952
1953 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1954 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1955 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1956}
2147 1957
2148void 1958void
2149set_map_reset_time (maptile *map) 1959set_map_reset_time (maptile *map)
2150{ 1960{
2151 int timeout; 1961 int timeout;
2152 1962
2153 timeout = MAP_RESET_TIMEOUT (map); 1963 timeout = map->reset_timeout;
2154 if (timeout <= 0) 1964 if (timeout <= 0)
2155 timeout = MAP_DEFAULTRESET; 1965 timeout = MAP_DEFAULTRESET;
2156 if (timeout >= MAP_MAXRESET) 1966 if (timeout >= MAP_MAXRESET)
2157 timeout = MAP_MAXRESET; 1967 timeout = MAP_MAXRESET;
2158 MAP_WHEN_RESET (map) = seconds () + timeout; 1968 map->reset_time = time (0) + timeout;
2159} 1969}
2160 1970
2161/* this updates the orig_map->tile_map[tile_num] value after loading 1971/* this updates the orig_map->tile_map[tile_num] value after loading
2162 * the map. It also takes care of linking back the freshly loaded 1972 * the map. It also takes care of linking back the freshly loaded
2163 * maps tile_map values if it tiles back to this one. It returns 1973 * maps tile_map values if it tiles back to this one. It returns
… …
2191 * 2001 *
2192 */ 2002 */
2193int 2003int
2194out_of_map (maptile *m, int x, int y) 2004out_of_map (maptile *m, int x, int y)
2195{ 2005{
2196
2197 /* If we get passed a null map, this is obviously the 2006 /* If we get passed a null map, this is obviously the
2198 * case. This generally shouldn't happen, but if the 2007 * case. This generally shouldn't happen, but if the
2199 * map loads fail below, it could happen. 2008 * map loads fail below, it could happen.
2200 */ 2009 */
2201 if (!m) 2010 if (!m)
… …
2203 2012
2204 if (x < 0) 2013 if (x < 0)
2205 { 2014 {
2206 if (!m->tile_path[3]) 2015 if (!m->tile_path[3])
2207 return 1; 2016 return 1;
2017
2208 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2018 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2209 {
2210 load_and_link_tiled_map (m, 3); 2019 load_and_link_tiled_map (m, 3);
2211 } 2020
2212 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); 2021 return (out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y));
2213 } 2022 }
2214 if (x >= MAP_WIDTH (m)) 2023
2024 if (x >= m->width)
2215 { 2025 {
2216 if (!m->tile_path[1]) 2026 if (!m->tile_path[1])
2217 return 1; 2027 return 1;
2028
2218 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2029 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2219 {
2220 load_and_link_tiled_map (m, 1); 2030 load_and_link_tiled_map (m, 1);
2221 } 2031
2222 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); 2032 return (out_of_map (m->tile_map[1], x - m->width, y));
2223 } 2033 }
2034
2224 if (y < 0) 2035 if (y < 0)
2225 { 2036 {
2226 if (!m->tile_path[0]) 2037 if (!m->tile_path[0])
2227 return 1; 2038 return 1;
2039
2228 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2040 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2229 {
2230 load_and_link_tiled_map (m, 0); 2041 load_and_link_tiled_map (m, 0);
2231 } 2042
2232 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); 2043 return (out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height));
2233 } 2044 }
2234 if (y >= MAP_HEIGHT (m)) 2045
2046 if (y >= m->height)
2235 { 2047 {
2236 if (!m->tile_path[2]) 2048 if (!m->tile_path[2])
2237 return 1; 2049 return 1;
2050
2238 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2051 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2239 {
2240 load_and_link_tiled_map (m, 2); 2052 load_and_link_tiled_map (m, 2);
2241 } 2053
2242 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); 2054 return (out_of_map (m->tile_map[2], x, y - m->height));
2243 } 2055 }
2244 2056
2245 /* Simple case - coordinates are within this local 2057 /* Simple case - coordinates are within this local
2246 * map. 2058 * map.
2247 */ 2059 */
… …
2261{ 2073{
2262 2074
2263 if (*x < 0) 2075 if (*x < 0)
2264 { 2076 {
2265 if (!m->tile_path[3]) 2077 if (!m->tile_path[3])
2266 return NULL; 2078 return 0;
2267 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2079 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2268 load_and_link_tiled_map (m, 3); 2080 load_and_link_tiled_map (m, 3);
2269 2081
2270 *x += MAP_WIDTH (m->tile_map[3]); 2082 *x += m->tile_map[3]->width;
2271 return (get_map_from_coord (m->tile_map[3], x, y)); 2083 return (get_map_from_coord (m->tile_map[3], x, y));
2272 } 2084 }
2273 if (*x >= MAP_WIDTH (m)) 2085
2086 if (*x >= m->width)
2274 { 2087 {
2275 if (!m->tile_path[1]) 2088 if (!m->tile_path[1])
2276 return NULL; 2089 return 0;
2090
2277 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2091 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2278 load_and_link_tiled_map (m, 1); 2092 load_and_link_tiled_map (m, 1);
2279 2093
2280 *x -= MAP_WIDTH (m); 2094 *x -= m->width;
2281 return (get_map_from_coord (m->tile_map[1], x, y)); 2095 return (get_map_from_coord (m->tile_map[1], x, y));
2282 } 2096 }
2097
2283 if (*y < 0) 2098 if (*y < 0)
2284 { 2099 {
2285 if (!m->tile_path[0]) 2100 if (!m->tile_path[0])
2286 return NULL; 2101 return 0;
2102
2287 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2103 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2288 load_and_link_tiled_map (m, 0); 2104 load_and_link_tiled_map (m, 0);
2289 2105
2290 *y += MAP_HEIGHT (m->tile_map[0]); 2106 *y += m->tile_map[0]->height;
2291 return (get_map_from_coord (m->tile_map[0], x, y)); 2107 return (get_map_from_coord (m->tile_map[0], x, y));
2292 } 2108 }
2293 if (*y >= MAP_HEIGHT (m)) 2109
2110 if (*y >= m->height)
2294 { 2111 {
2295 if (!m->tile_path[2]) 2112 if (!m->tile_path[2])
2296 return NULL; 2113 return 0;
2114
2297 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2115 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2298 load_and_link_tiled_map (m, 2); 2116 load_and_link_tiled_map (m, 2);
2299 2117
2300 *y -= MAP_HEIGHT (m); 2118 *y -= m->height;
2301 return (get_map_from_coord (m->tile_map[2], x, y)); 2119 return (get_map_from_coord (m->tile_map[2], x, y));
2302 } 2120 }
2303 2121
2304 /* Simple case - coordinates are within this local 2122 /* Simple case - coordinates are within this local
2305 * map. 2123 * map.
… …
2325 2143
2326 } 2144 }
2327 else if (map1->tile_map[0] == map2) 2145 else if (map1->tile_map[0] == map2)
2328 { /* up */ 2146 { /* up */
2329 *dx = 0; 2147 *dx = 0;
2330 *dy = -MAP_HEIGHT (map2); 2148 *dy = -map2->height;
2331 } 2149 }
2332 else if (map1->tile_map[1] == map2) 2150 else if (map1->tile_map[1] == map2)
2333 { /* right */ 2151 { /* right */
2334 *dx = MAP_WIDTH (map1); 2152 *dx = map1->width;
2335 *dy = 0; 2153 *dy = 0;
2336 } 2154 }
2337 else if (map1->tile_map[2] == map2) 2155 else if (map1->tile_map[2] == map2)
2338 { /* down */ 2156 { /* down */
2339 *dx = 0; 2157 *dx = 0;
2340 *dy = MAP_HEIGHT (map1); 2158 *dy = map1->height;
2341 } 2159 }
2342 else if (map1->tile_map[3] == map2) 2160 else if (map1->tile_map[3] == map2)
2343 { /* left */ 2161 { /* left */
2344 *dx = -MAP_WIDTH (map2); 2162 *dx = -map2->width;
2345 *dy = 0; 2163 *dy = 0;
2346 2164
2347 } 2165 }
2348 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 2166 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)
2349 { /* up right */ 2167 { /* up right */
2350 *dx = MAP_WIDTH (map1->tile_map[0]); 2168 *dx = map1->tile_map[0]->width;
2351 *dy = -MAP_HEIGHT (map1->tile_map[0]); 2169 *dy = -map1->tile_map[0]->height;
2352 } 2170 }
2353 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 2171 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)
2354 { /* up left */ 2172 { /* up left */
2355 *dx = -MAP_WIDTH (map2); 2173 *dx = -map2->width;
2356 *dy = -MAP_HEIGHT (map1->tile_map[0]); 2174 *dy = -map1->tile_map[0]->height;
2357 } 2175 }
2358 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 2176 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)
2359 { /* right up */ 2177 { /* right up */
2360 *dx = MAP_WIDTH (map1); 2178 *dx = map1->width;
2361 *dy = -MAP_HEIGHT (map2); 2179 *dy = -map2->height;
2362 } 2180 }
2363 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 2181 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)
2364 { /* right down */ 2182 { /* right down */
2365 *dx = MAP_WIDTH (map1); 2183 *dx = map1->width;
2366 *dy = MAP_HEIGHT (map1->tile_map[1]); 2184 *dy = map1->tile_map[1]->height;
2367 } 2185 }
2368 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 2186 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)
2369 { /* down right */ 2187 { /* down right */
2370 *dx = MAP_WIDTH (map1->tile_map[2]); 2188 *dx = map1->tile_map[2]->width;
2371 *dy = MAP_HEIGHT (map1); 2189 *dy = map1->height;
2372 } 2190 }
2373 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 2191 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)
2374 { /* down left */ 2192 { /* down left */
2375 *dx = -MAP_WIDTH (map2); 2193 *dx = -map2->width;
2376 *dy = MAP_HEIGHT (map1); 2194 *dy = map1->height;
2377 } 2195 }
2378 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 2196 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)
2379 { /* left up */ 2197 { /* left up */
2380 *dx = -MAP_WIDTH (map1->tile_map[3]); 2198 *dx = -map1->tile_map[3]->width;
2381 *dy = -MAP_HEIGHT (map2); 2199 *dy = -map2->height;
2382 } 2200 }
2383 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 2201 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)
2384 { /* left down */ 2202 { /* left down */
2385 *dx = -MAP_WIDTH (map1->tile_map[3]); 2203 *dx = -map1->tile_map[3]->width;
2386 *dy = MAP_HEIGHT (map1->tile_map[3]); 2204 *dy = map1->tile_map[3]->height;
2387 2205
2388 } 2206 }
2389 else 2207 else
2390 { /* not "adjacent" enough */ 2208 { /* not "adjacent" enough */
2391 return 0; 2209 return 0;
… …
2516{ 2334{
2517 int dx, dy; 2335 int dx, dy;
2518 2336
2519 return adjacent_map (op1->map, op2->map, &dx, &dy); 2337 return adjacent_map (op1->map, op2->map, &dx, &dy);
2520} 2338}
2339
2340object *
2341maptile::insert (object *op, int x, int y, object *originator, int flags)
2342{
2343 if (!op->flag [FLAG_REMOVED])
2344 op->remove ();
2345
2346 return insert_ob_in_map_at (op, this, originator, flags, x, y);
2347}
2348

Diff Legend

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