… | |
… | |
28 | #include <loader.h> |
28 | #include <loader.h> |
29 | #include <unistd.h> |
29 | #include <unistd.h> |
30 | |
30 | |
31 | #include "path.h" |
31 | #include "path.h" |
32 | |
32 | |
33 | |
|
|
34 | /* |
33 | /* |
35 | * Returns the maptile which has a name matching the given argument. |
34 | * Returns the maptile which has a name matching the given argument. |
36 | * return NULL if no match is found. |
35 | * return NULL if no match is found. |
37 | */ |
36 | */ |
38 | |
|
|
39 | maptile * |
37 | maptile * |
40 | has_been_loaded (const char *name) |
38 | has_been_loaded (const char *name) |
41 | { |
39 | { |
42 | maptile *map; |
40 | maptile *map; |
43 | |
41 | |
44 | if (!name || !*name) |
42 | if (!name || !*name) |
45 | return 0; |
43 | return 0; |
|
|
44 | |
46 | for (map = first_map; map; map = map->next) |
45 | for (map = first_map; map; map = map->next) |
47 | if (!strcmp (name, map->path)) |
46 | if (!strcmp (name, map->path)) |
48 | break; |
47 | break; |
|
|
48 | |
49 | return (map); |
49 | return (map); |
50 | } |
50 | } |
51 | |
51 | |
52 | /* |
52 | /* |
53 | * This makes a path absolute outside the world of Crossfire. |
53 | * This makes a path absolute outside the world of Crossfire. |
… | |
… | |
197 | |
197 | |
198 | void |
198 | void |
199 | dump_map (const maptile *m) |
199 | dump_map (const maptile *m) |
200 | { |
200 | { |
201 | LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); |
201 | LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); |
202 | LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m)); |
202 | LOG (llevError, "Size: %dx%d Start: %d,%d\n", m->width, m->height, m->enter_x, m->enter_y); |
203 | |
203 | |
204 | if (m->msg != NULL) |
204 | if (m->msg != NULL) |
205 | LOG (llevError, "Message:\n%s", m->msg); |
205 | LOG (llevError, "Message:\n%s", m->msg); |
206 | |
206 | |
207 | if (m->maplore != NULL) |
207 | if (m->maplore != NULL) |
… | |
… | |
223 | void |
223 | void |
224 | dump_all_maps (void) |
224 | dump_all_maps (void) |
225 | { |
225 | { |
226 | maptile *m; |
226 | maptile *m; |
227 | |
227 | |
228 | for (m = first_map; m != NULL; m = m->next) |
228 | for (m = first_map; m; m = m->next) |
229 | { |
|
|
230 | dump_map (m); |
229 | dump_map (m); |
231 | } |
|
|
232 | } |
230 | } |
233 | |
231 | |
234 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
232 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
235 | * one function that just returns a P_.. value (see map.h) |
233 | * one function that just returns a P_.. value (see map.h) |
236 | * it will also do map translation for tiled maps, returning |
234 | * it will also do map translation for tiled maps, returning |
… | |
… | |
240 | * is needed. The case of not passing values is if we're just |
238 | * is needed. The case of not passing values is if we're just |
241 | * checking for the existence of something on those spaces, but |
239 | * checking for the existence of something on those spaces, but |
242 | * don't expect to insert/remove anything from those spaces. |
240 | * don't expect to insert/remove anything from those spaces. |
243 | */ |
241 | */ |
244 | int |
242 | int |
245 | get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) |
243 | get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny) |
246 | { |
244 | { |
247 | sint16 newx, newy; |
245 | sint16 newx, newy; |
248 | int retval = 0; |
246 | int retval = 0; |
249 | maptile *mp; |
247 | maptile *mp; |
250 | |
248 | |
251 | if (out_of_map (oldmap, x, y)) |
|
|
252 | return P_OUT_OF_MAP; |
|
|
253 | newx = x; |
249 | newx = x; |
254 | newy = y; |
250 | newy = y; |
|
|
251 | |
255 | mp = get_map_from_coord (oldmap, &newx, &newy); |
252 | mp = get_map_from_coord (oldmap, &newx, &newy); |
|
|
253 | |
|
|
254 | if (!mp) |
|
|
255 | return P_OUT_OF_MAP; |
|
|
256 | |
256 | if (mp != oldmap) |
257 | if (mp != oldmap) |
257 | retval |= P_NEW_MAP; |
258 | retval |= P_NEW_MAP; |
258 | if (newmap) |
|
|
259 | *newmap = mp; |
|
|
260 | if (nx) |
|
|
261 | *nx = newx; |
|
|
262 | if (ny) |
|
|
263 | *ny = newy; |
|
|
264 | |
259 | |
265 | retval |= mp->spaces[newx + mp->width * newy].flags; |
260 | if (newmap) *newmap = mp; |
|
|
261 | if (nx) *nx = newx; |
|
|
262 | if (ny) *ny = newy; |
266 | |
263 | |
267 | return retval; |
264 | return retval | mp->at (newx, newy).flags (); |
268 | } |
265 | } |
269 | |
266 | |
270 | /* |
267 | /* |
271 | * Returns true if the given coordinate is blocked except by the |
268 | * Returns true if the given coordinate is blocked except by the |
272 | * object passed is not blocking. This is used with |
269 | * object passed is not blocking. This is used with |
… | |
… | |
295 | } |
292 | } |
296 | |
293 | |
297 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
294 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
298 | * directly. |
295 | * directly. |
299 | */ |
296 | */ |
300 | mflags = m->spaces[sx + m->width * sy].flags; |
297 | mflags = m->at (sx, sy).flags (); |
301 | |
298 | |
302 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
299 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
303 | |
300 | |
304 | /* If space is currently not blocked by anything, no need to |
301 | /* If space is currently not blocked by anything, no need to |
305 | * go further. Not true for players - all sorts of special |
302 | * go further. Not true for players - all sorts of special |
… | |
… | |
324 | /* We basically go through the stack of objects, and if there is |
321 | /* We basically go through the stack of objects, and if there is |
325 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
322 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
326 | * true. If we get through the entire stack, that must mean |
323 | * true. If we get through the entire stack, that must mean |
327 | * ob is blocking it, so return 0. |
324 | * ob is blocking it, so return 0. |
328 | */ |
325 | */ |
329 | for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above) |
326 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
330 | { |
327 | { |
331 | |
328 | |
332 | /* This must be before the checks below. Code for inventory checkers. */ |
329 | /* This must be before the checks below. Code for inventory checkers. */ |
333 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
330 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
334 | { |
331 | { |
… | |
… | |
398 | * |
395 | * |
399 | * Note this used to be arch_blocked, but with new movement |
396 | * Note this used to be arch_blocked, but with new movement |
400 | * code, we need to have actual object to check its move_type |
397 | * code, we need to have actual object to check its move_type |
401 | * against the move_block values. |
398 | * against the move_block values. |
402 | */ |
399 | */ |
403 | |
|
|
404 | int |
400 | int |
405 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
401 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
406 | { |
402 | { |
407 | archetype *tmp; |
403 | archetype *tmp; |
408 | int flag; |
404 | int flag; |
… | |
… | |
414 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
410 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
415 | if (flag & P_OUT_OF_MAP) |
411 | if (flag & P_OUT_OF_MAP) |
416 | return P_OUT_OF_MAP; |
412 | return P_OUT_OF_MAP; |
417 | |
413 | |
418 | /* don't have object, so don't know what types would block */ |
414 | /* don't have object, so don't know what types would block */ |
419 | return (GET_MAP_MOVE_BLOCK (m1, sx, sy)); |
415 | return m1->at (sx, sy).move_block; |
420 | } |
416 | } |
421 | |
417 | |
422 | for (tmp = ob->arch; tmp != NULL; tmp = tmp->more) |
418 | for (tmp = ob->arch; tmp; tmp = tmp->more) |
423 | { |
419 | { |
424 | flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); |
420 | flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); |
425 | |
421 | |
426 | if (flag & P_OUT_OF_MAP) |
422 | if (flag & P_OUT_OF_MAP) |
427 | return P_OUT_OF_MAP; |
423 | return P_OUT_OF_MAP; |
428 | if (flag & P_IS_ALIVE) |
424 | if (flag & P_IS_ALIVE) |
429 | return P_IS_ALIVE; |
425 | return P_IS_ALIVE; |
430 | |
426 | |
|
|
427 | mapspace &ms = m1->at (sx, sy); |
|
|
428 | |
|
|
429 | |
431 | /* find_first_free_spot() calls this function. However, often |
430 | /* find_first_free_spot() calls this function. However, often |
432 | * ob doesn't have any move type (when used to place exits) |
431 | * ob doesn't have any move type (when used to place exits) |
433 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
432 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
434 | */ |
433 | */ |
435 | |
434 | |
436 | if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL) |
435 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
437 | continue; |
436 | continue; |
438 | |
437 | |
439 | /* Note it is intentional that we check ob - the movement type of the |
438 | /* Note it is intentional that we check ob - the movement type of the |
440 | * head of the object should correspond for the entire object. |
439 | * head of the object should correspond for the entire object. |
441 | */ |
440 | */ |
442 | if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) |
441 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
443 | return AB_NO_PASS; |
442 | return P_NO_PASS; |
444 | |
|
|
445 | } |
443 | } |
|
|
444 | |
446 | return 0; |
445 | return 0; |
447 | } |
446 | } |
448 | |
447 | |
449 | /* When the map is loaded, load_object does not actually insert objects |
448 | /* When the map is loaded, load_object does not actually insert objects |
450 | * into inventory, but just links them. What this does is go through |
449 | * into inventory, but just links them. What this does is go through |
… | |
… | |
485 | { |
484 | { |
486 | int x, y; |
485 | int x, y; |
487 | object *tmp, *op, *last, *above; |
486 | object *tmp, *op, *last, *above; |
488 | archetype *at; |
487 | archetype *at; |
489 | |
488 | |
490 | for (x = 0; x < MAP_WIDTH (m); x++) |
489 | for (x = 0; x < m->width; x++) |
491 | for (y = 0; y < MAP_HEIGHT (m); y++) |
490 | for (y = 0; y < m->height; y++) |
492 | for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above) |
491 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above) |
493 | { |
492 | { |
494 | above = tmp->above; |
493 | above = tmp->above; |
495 | |
494 | |
496 | /* already multipart - don't do anything more */ |
495 | /* already multipart - don't do anything more */ |
497 | if (tmp->head || tmp->more) |
496 | if (tmp->head || tmp->more) |
… | |
… | |
547 | { |
546 | { |
548 | LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); |
547 | LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); |
549 | continue; |
548 | continue; |
550 | } |
549 | } |
551 | |
550 | |
552 | |
|
|
553 | switch (i) |
551 | switch (i) |
554 | { |
552 | { |
555 | case LL_NORMAL: |
553 | case LL_NORMAL: |
556 | /* if we are loading an overlay, put the floors on the bottom */ |
554 | /* if we are loading an overlay, put the floors on the bottom */ |
557 | if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) |
555 | if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) |
… | |
… | |
582 | { |
580 | { |
583 | for (j = 0; j < m->height; j++) |
581 | for (j = 0; j < m->height; j++) |
584 | { |
582 | { |
585 | unique = 0; |
583 | unique = 0; |
586 | /* check for unique items, or unique squares */ |
584 | /* check for unique items, or unique squares */ |
587 | for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) |
585 | for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) |
588 | { |
586 | { |
589 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
587 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
590 | unique = 1; |
588 | unique = 1; |
591 | |
589 | |
592 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
590 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
… | |
… | |
603 | * Modified by MSW 2001-07-01 to do in a single pass - reduces code, |
601 | * Modified by MSW 2001-07-01 to do in a single pass - reduces code, |
604 | * and we only save the head of multi part objects - this is needed |
602 | * and we only save the head of multi part objects - this is needed |
605 | * in order to do map tiling properly. |
603 | * in order to do map tiling properly. |
606 | */ |
604 | */ |
607 | void |
605 | void |
608 | save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag) |
606 | save_objects (maptile *m, object_freezer &fp, object_freezer &fp2, int flag) |
609 | { |
607 | { |
610 | int i, j = 0, unique = 0; |
608 | int i, j = 0, unique = 0; |
611 | object *op; |
609 | object *op; |
612 | |
610 | |
613 | /* first pass - save one-part objects */ |
611 | /* first pass - save one-part objects */ |
614 | for (i = 0; i < MAP_WIDTH (m); i++) |
612 | for (i = 0; i < m->width; i++) |
615 | for (j = 0; j < MAP_HEIGHT (m); j++) |
613 | for (j = 0; j < m->height; j++) |
616 | { |
614 | { |
617 | unique = 0; |
615 | unique = 0; |
|
|
616 | |
618 | for (op = get_map_ob (m, i, j); op; op = op->above) |
617 | for (op = m->at (i, j).bot; op; op = op->above) |
619 | { |
618 | { |
620 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
619 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
621 | unique = 1; |
620 | unique = 1; |
622 | |
621 | |
623 | if (op->type == PLAYER) |
622 | if (op->type == PLAYER) |
624 | { |
|
|
625 | LOG (llevDebug, "Player on map that is being saved\n"); |
|
|
626 | continue; |
623 | continue; |
627 | } |
|
|
628 | |
624 | |
629 | if (op->head || op->owner) |
625 | if (op->head || op->owner) |
630 | continue; |
626 | continue; |
631 | |
627 | |
632 | if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) |
628 | if (unique || op->flag [FLAG_UNIQUE]) |
633 | save_object (fp2, op, 3); |
629 | save_object (fp2, op, 1); |
634 | else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) |
630 | else if (flag == 0 || (flag == 2 && (!op->flag [FLAG_OBJ_ORIGINAL] && !op->flag [FLAG_UNPAID]))) |
635 | save_object (fp, op, 3); |
631 | save_object (fp, op, 1); |
636 | |
632 | } |
637 | } /* for this space */ |
633 | } |
638 | } /* for this j */ |
|
|
639 | } |
634 | } |
640 | |
635 | |
641 | maptile::maptile () |
636 | maptile::maptile () |
642 | { |
637 | { |
643 | in_memory = MAP_SWAPPED; |
638 | in_memory = MAP_SWAPPED; |
644 | /* The maps used to pick up default x and y values from the |
639 | /* The maps used to pick up default x and y values from the |
645 | * map archetype. Mimic that behaviour. |
640 | * map archetype. Mimic that behaviour. |
646 | */ |
641 | */ |
647 | MAP_WIDTH (this) = 16; |
642 | this->width = 16; |
648 | MAP_HEIGHT (this) = 16; |
643 | this->height = 16; |
649 | MAP_RESET_TIMEOUT (this) = 0; |
644 | this->reset_timeout = 0; |
650 | MAP_TIMEOUT (this) = 300; |
645 | this->timeout = 300; |
651 | MAP_ENTER_X (this) = 0; |
646 | this->enter_x = 0; |
652 | MAP_ENTER_Y (this) = 0; |
647 | this->enter_y = 0; |
653 | /*set part to -1 indicating conversion to weather map not yet done */ |
648 | /*set part to -1 indicating conversion to weather map not yet done */ |
654 | MAP_WORLDPARTX (this) = -1; |
649 | this->worldpartx = -1; |
655 | MAP_WORLDPARTY (this) = -1; |
650 | this->worldparty = -1; |
656 | } |
651 | } |
657 | |
652 | |
658 | /* |
653 | /* |
659 | * Allocates, initialises, and returns a pointer to a maptile. |
654 | * Allocates, initialises, and returns a pointer to a maptile. |
660 | * Modified to no longer take a path option which was not being |
655 | * Modified to no longer take a path option which was not being |
… | |
… | |
693 | { |
688 | { |
694 | LOG (llevError, "allocate_map called with already allocated map (%s)\n", path); |
689 | LOG (llevError, "allocate_map called with already allocated map (%s)\n", path); |
695 | free (spaces); |
690 | free (spaces); |
696 | } |
691 | } |
697 | |
692 | |
698 | spaces = (MapSpace *) |
693 | spaces = (mapspace *) |
699 | calloc (1, width * height * sizeof (MapSpace)); |
694 | calloc (1, width * height * sizeof (mapspace)); |
700 | |
695 | |
701 | if (!spaces) |
696 | if (!spaces) |
702 | fatal (OUT_OF_MEMORY); |
697 | fatal (OUT_OF_MEMORY); |
703 | } |
698 | } |
704 | |
699 | |
… | |
… | |
1130 | strcpy (m->path, filename); |
1125 | strcpy (m->path, filename); |
1131 | if (load_map_header (thawer, m)) |
1126 | if (load_map_header (thawer, m)) |
1132 | { |
1127 | { |
1133 | LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags); |
1128 | LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags); |
1134 | delete_map (m); |
1129 | delete_map (m); |
1135 | return NULL; |
1130 | return 0; |
1136 | } |
1131 | } |
1137 | |
1132 | |
1138 | m->allocate (); |
1133 | m->allocate (); |
1139 | |
1134 | |
1140 | m->in_memory = MAP_LOADING; |
1135 | m->in_memory = MAP_LOADING; |
1141 | load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE)); |
1136 | load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE)); |
1142 | |
1137 | |
1143 | m->in_memory = MAP_IN_MEMORY; |
1138 | m->in_memory = MAP_IN_MEMORY; |
1144 | if (!MAP_DIFFICULTY (m)) |
1139 | if (!m->difficulty) |
1145 | MAP_DIFFICULTY (m) = calculate_difficulty (m); |
1140 | m->difficulty = calculate_difficulty (m); |
1146 | set_map_reset_time (m); |
1141 | set_map_reset_time (m); |
1147 | m->instantiate (); |
1142 | m->instantiate (); |
1148 | return (m); |
1143 | return (m); |
1149 | } |
1144 | } |
1150 | |
1145 | |
… | |
… | |
1223 | if (load_map_header (thawer, m)) |
1218 | if (load_map_header (thawer, m)) |
1224 | { |
1219 | { |
1225 | LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname); |
1220 | LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname); |
1226 | delete_map (m); |
1221 | delete_map (m); |
1227 | m = load_original_map (m->path, 0); |
1222 | m = load_original_map (m->path, 0); |
1228 | return NULL; |
1223 | return 0; |
1229 | } |
1224 | } |
1230 | /*m->allocate ();*/ |
1225 | /*m->allocate ();*/ |
1231 | |
1226 | |
1232 | m->in_memory = MAP_LOADING; |
1227 | m->in_memory = MAP_LOADING; |
1233 | load_objects (m, thawer, MAP_OVERLAY); |
1228 | load_objects (m, thawer, MAP_OVERLAY); |
… | |
… | |
1245 | delete_unique_items (maptile *m) |
1240 | delete_unique_items (maptile *m) |
1246 | { |
1241 | { |
1247 | int i, j, unique; |
1242 | int i, j, unique; |
1248 | object *op, *next; |
1243 | object *op, *next; |
1249 | |
1244 | |
1250 | for (i = 0; i < MAP_WIDTH (m); i++) |
1245 | for (i = 0; i < m->width; i++) |
1251 | for (j = 0; j < MAP_HEIGHT (m); j++) |
1246 | for (j = 0; j < m->height; j++) |
1252 | { |
1247 | { |
1253 | unique = 0; |
1248 | unique = 0; |
1254 | |
1249 | |
1255 | for (op = get_map_ob (m, i, j); op; op = next) |
1250 | for (op = GET_MAP_OB (m, i, j); op; op = next) |
1256 | { |
1251 | { |
1257 | next = op->above; |
1252 | next = op->above; |
1258 | |
1253 | |
1259 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
1254 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
1260 | unique = 1; |
1255 | unique = 1; |
1261 | |
1256 | |
1262 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
1257 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
1263 | { |
1258 | { |
1264 | clean_object (op); |
1259 | op->destroy_inv (false); |
1265 | |
|
|
1266 | if (QUERY_FLAG (op, FLAG_IS_LINKED)) |
|
|
1267 | remove_button_link (op); |
|
|
1268 | |
|
|
1269 | op->destroy (); |
1260 | op->destroy (); |
1270 | } |
1261 | } |
1271 | } |
1262 | } |
1272 | } |
1263 | } |
1273 | } |
1264 | } |
… | |
… | |
1299 | return; |
1290 | return; |
1300 | |
1291 | |
1301 | m->in_memory = MAP_LOADING; |
1292 | m->in_memory = MAP_LOADING; |
1302 | if (m->tmpname == NULL) /* if we have loaded unique items from */ |
1293 | if (m->tmpname == NULL) /* if we have loaded unique items from */ |
1303 | delete_unique_items (m); /* original map before, don't duplicate them */ |
1294 | delete_unique_items (m); /* original map before, don't duplicate them */ |
|
|
1295 | |
1304 | load_objects (m, thawer, 0); |
1296 | load_objects (m, thawer, 0); |
1305 | |
1297 | |
1306 | m->in_memory = MAP_IN_MEMORY; |
1298 | m->in_memory = MAP_IN_MEMORY; |
1307 | } |
1299 | } |
1308 | |
|
|
1309 | |
1300 | |
1310 | /* |
1301 | /* |
1311 | * Saves a map to file. If flag is set, it is saved into the same |
1302 | * Saves a map to file. If flag is set, it is saved into the same |
1312 | * file it was (originally) loaded from. Otherwise a temporary |
1303 | * file it was (originally) loaded from. Otherwise a temporary |
1313 | * filename will be genarated, and the file will be stored there. |
1304 | * filename will be genarated, and the file will be stored there. |
1314 | * The temporary filename will be stored in the maptileure. |
1305 | * The temporary filename will be stored in the maptileure. |
1315 | * If the map is unique, we also save to the filename in the map |
1306 | * If the map is unique, we also save to the filename in the map |
1316 | * (this should have been updated when first loaded) |
1307 | * (this should have been updated when first loaded) |
1317 | */ |
1308 | */ |
1318 | |
|
|
1319 | int |
1309 | int |
1320 | new_save_map (maptile *m, int flag) |
1310 | new_save_map (maptile *m, int flag) |
1321 | { |
1311 | { |
1322 | char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; |
1312 | char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; |
1323 | int i; |
1313 | int i; |
… | |
… | |
1455 | freezer.save (filename); |
1445 | freezer.save (filename); |
1456 | |
1446 | |
1457 | return 0; |
1447 | return 0; |
1458 | } |
1448 | } |
1459 | |
1449 | |
1460 | |
|
|
1461 | /* |
|
|
1462 | * Remove and free all objects in the inventory of the given object. |
|
|
1463 | * object.c ? |
|
|
1464 | */ |
|
|
1465 | |
|
|
1466 | void |
|
|
1467 | clean_object (object *op) |
|
|
1468 | { |
|
|
1469 | object *tmp, *next; |
|
|
1470 | |
|
|
1471 | for (tmp = op->inv; tmp; tmp = next) |
|
|
1472 | { |
|
|
1473 | next = tmp->below; |
|
|
1474 | |
|
|
1475 | clean_object (tmp); |
|
|
1476 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
|
|
1477 | remove_button_link (tmp); |
|
|
1478 | |
|
|
1479 | tmp->destroy (); |
|
|
1480 | } |
|
|
1481 | } |
|
|
1482 | |
|
|
1483 | /* |
1450 | /* |
1484 | * Remove and free all objects in the given map. |
1451 | * Remove and free all objects in the given map. |
1485 | */ |
1452 | */ |
1486 | |
|
|
1487 | void |
1453 | void |
1488 | free_all_objects (maptile *m) |
1454 | free_all_objects (maptile *m) |
1489 | { |
1455 | { |
1490 | int i, j; |
1456 | if (!m->spaces) |
1491 | object *op; |
1457 | return; |
1492 | |
1458 | |
1493 | for (i = 0; i < MAP_WIDTH (m); i++) |
1459 | for (int i = 0; i < m->width; i++) |
1494 | for (j = 0; j < MAP_HEIGHT (m); j++) |
1460 | for (int j = 0; j < m->height; j++) |
1495 | { |
1461 | { |
1496 | object *previous_obj = NULL; |
1462 | mapspace &ms = m->at (i, j); |
1497 | |
1463 | |
1498 | while ((op = GET_MAP_OB (m, i, j)) != NULL) |
1464 | while (object *op = ms.bot) |
1499 | { |
1465 | { |
1500 | if (op == previous_obj) |
|
|
1501 | { |
|
|
1502 | LOG (llevDebug, "free_all_objects: Link error, bailing out.\n"); |
|
|
1503 | break; |
|
|
1504 | } |
|
|
1505 | |
|
|
1506 | previous_obj = op; |
|
|
1507 | |
|
|
1508 | if (op->head != NULL) |
1466 | if (op->head) |
1509 | op = op->head; |
1467 | op = op->head; |
1510 | |
1468 | |
1511 | /* If the map isn't in memory, free_object will remove and |
1469 | op->destroy_inv (false); |
1512 | * free objects in op's inventory. So let it do the job. |
|
|
1513 | */ |
|
|
1514 | if (m->in_memory == MAP_IN_MEMORY) |
|
|
1515 | clean_object (op); |
|
|
1516 | |
|
|
1517 | op->destroy (); |
1470 | op->destroy (); |
1518 | } |
1471 | } |
1519 | } |
1472 | } |
1520 | } |
1473 | } |
1521 | |
1474 | |
1522 | /* |
1475 | /* |
1523 | * Frees everything allocated by the given maptileure. |
1476 | * Frees everything allocated by the given maptileure. |
1524 | * don't free tmpname - our caller is left to do that |
1477 | * don't free tmpname - our caller is left to do that |
1525 | */ |
1478 | */ |
1526 | |
|
|
1527 | void |
1479 | void |
1528 | free_map (maptile *m, int flag) |
1480 | free_map (maptile *m, int flag) |
1529 | { |
1481 | { |
1530 | int i; |
1482 | if (!m->in_memory) //TODO: makes no sense to me? |
1531 | |
|
|
1532 | if (!m->in_memory) |
|
|
1533 | { |
|
|
1534 | LOG (llevError, "Trying to free freed map.\n"); |
|
|
1535 | return; |
1483 | return; |
1536 | } |
1484 | |
|
|
1485 | m->in_memory = MAP_SAVING; |
1537 | |
1486 | |
1538 | // TODO: use new/delete |
1487 | // TODO: use new/delete |
1539 | #define FREE_AND_CLEAR(p) { free (p); p = NULL; } |
|
|
1540 | |
1488 | |
1541 | if (flag && m->spaces) |
1489 | if (flag && m->spaces) |
1542 | free_all_objects (m); |
1490 | free_all_objects (m); |
1543 | if (m->name) |
|
|
1544 | FREE_AND_CLEAR (m->name); |
|
|
1545 | if (m->spaces) |
|
|
1546 | FREE_AND_CLEAR (m->spaces); |
|
|
1547 | if (m->msg) |
|
|
1548 | FREE_AND_CLEAR (m->msg); |
|
|
1549 | if (m->maplore) |
|
|
1550 | FREE_AND_CLEAR (m->maplore); |
|
|
1551 | |
1491 | |
1552 | delete [] m->shopitems; |
1492 | free (m->name), m->name = 0; |
1553 | m->shopitems = 0; |
1493 | free (m->spaces), m->spaces = 0; |
1554 | |
1494 | free (m->msg), m->msg = 0; |
1555 | if (m->shoprace) |
1495 | free (m->maplore), m->maplore = 0; |
1556 | FREE_AND_CLEAR (m->shoprace); |
1496 | free (m->shoprace), m->shoprace = 0; |
|
|
1497 | delete [] m->shopitems, m->shopitems = 0; |
1557 | |
1498 | |
1558 | if (m->buttons) |
1499 | if (m->buttons) |
1559 | free_objectlinkpt (m->buttons); |
1500 | free_objectlinkpt (m->buttons), m->buttons = 0; |
1560 | |
1501 | |
1561 | m->buttons = NULL; |
|
|
1562 | |
|
|
1563 | for (i = 0; i < 4; i++) |
1502 | for (int i = 0; i < 4; i++) |
1564 | { |
1503 | { |
1565 | if (m->tile_path[i]) |
1504 | if (m->tile_path[i]) |
1566 | FREE_AND_CLEAR (m->tile_path[i]); |
1505 | free (m->tile_path[i]), m->tile_path[i] = 0; |
|
|
1506 | |
1567 | m->tile_map[i] = NULL; |
1507 | m->tile_map[i] = 0; |
1568 | } |
1508 | } |
1569 | |
1509 | |
1570 | m->in_memory = MAP_SWAPPED; |
1510 | m->in_memory = MAP_SWAPPED; |
1571 | |
|
|
1572 | #undef FREE_AND_CLEAR |
|
|
1573 | |
|
|
1574 | } |
1511 | } |
1575 | |
1512 | |
1576 | /* |
1513 | maptile::~maptile () |
1577 | * function: vanish maptile |
1514 | { |
1578 | * m : pointer to maptile, if NULL no action |
1515 | free_map (this, 1); |
1579 | * this deletes all the data on the map (freeing pointers) |
1516 | free (tmpname); |
1580 | * and then removes this map from the global linked list of maps. |
1517 | } |
|
|
1518 | |
|
|
1519 | void |
|
|
1520 | maptile::do_destroy () |
|
|
1521 | { |
|
|
1522 | attachable::do_destroy (); |
|
|
1523 | |
|
|
1524 | free_all_objects (this); |
|
|
1525 | |
|
|
1526 | /* We need to look through all the maps and see if any maps |
|
|
1527 | * are pointing at this one for tiling information. Since |
|
|
1528 | * tiling can be asymetric, we just can not look to see which |
|
|
1529 | * maps this map tiles with and clears those. |
1581 | */ |
1530 | */ |
|
|
1531 | //TODO: non-euclidean-tiling MUST GO |
|
|
1532 | for (maptile *m = first_map; m; m = m->next) |
|
|
1533 | for (int i = 0; i < 4; i++) |
|
|
1534 | if (m->tile_map[i] == this) |
|
|
1535 | m->tile_map[i] = 0; |
1582 | |
1536 | |
|
|
1537 | if (first_map == this) |
|
|
1538 | first_map = next; |
|
|
1539 | else |
|
|
1540 | for (maptile *m = first_map; m; m = m->next) |
|
|
1541 | if (m->next = this) |
|
|
1542 | { |
|
|
1543 | m->next = next; |
|
|
1544 | break; |
|
|
1545 | } |
|
|
1546 | } |
|
|
1547 | |
|
|
1548 | //TODO: must go |
1583 | void |
1549 | void |
1584 | delete_map (maptile *m) |
1550 | delete_map (maptile *m) |
1585 | { |
1551 | { |
1586 | maptile *tmp, *last; |
|
|
1587 | int i; |
|
|
1588 | |
|
|
1589 | if (!m) |
1552 | if (m) |
1590 | return; |
1553 | m->destroy (); |
1591 | |
|
|
1592 | m->clear (); |
|
|
1593 | |
|
|
1594 | if (m->in_memory == MAP_IN_MEMORY) |
|
|
1595 | { |
|
|
1596 | /* change to MAP_SAVING, even though we are not, |
|
|
1597 | * so that remove_ob doesn't do as much work. |
|
|
1598 | */ |
|
|
1599 | m->in_memory = MAP_SAVING; |
|
|
1600 | free_map (m, 1); |
|
|
1601 | } |
|
|
1602 | /* move this out of free_map, since tmpname can still be needed if |
|
|
1603 | * the map is swapped out. |
|
|
1604 | */ |
|
|
1605 | if (m->tmpname) |
|
|
1606 | { |
|
|
1607 | free (m->tmpname); |
|
|
1608 | m->tmpname = NULL; |
|
|
1609 | } |
|
|
1610 | last = NULL; |
|
|
1611 | /* We need to look through all the maps and see if any maps |
|
|
1612 | * are pointing at this one for tiling information. Since |
|
|
1613 | * tiling can be assymetric, we just can not look to see which |
|
|
1614 | * maps this map tiles with and clears those. |
|
|
1615 | */ |
|
|
1616 | for (tmp = first_map; tmp != NULL; tmp = tmp->next) |
|
|
1617 | { |
|
|
1618 | if (tmp->next == m) |
|
|
1619 | last = tmp; |
|
|
1620 | |
|
|
1621 | /* This should hopefully get unrolled on a decent compiler */ |
|
|
1622 | for (i = 0; i < 4; i++) |
|
|
1623 | if (tmp->tile_map[i] == m) |
|
|
1624 | tmp->tile_map[i] = NULL; |
|
|
1625 | } |
|
|
1626 | |
|
|
1627 | /* If last is null, then this should be the first map in the list */ |
|
|
1628 | if (!last) |
|
|
1629 | { |
|
|
1630 | if (m == first_map) |
|
|
1631 | first_map = m->next; |
|
|
1632 | else |
|
|
1633 | /* m->path is a static char, so should hopefully still have |
|
|
1634 | * some useful data in it. |
|
|
1635 | */ |
|
|
1636 | LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path); |
|
|
1637 | } |
|
|
1638 | else |
|
|
1639 | last->next = m->next; |
|
|
1640 | |
|
|
1641 | delete m; |
|
|
1642 | } |
1554 | } |
1643 | |
|
|
1644 | |
|
|
1645 | |
1555 | |
1646 | /* |
1556 | /* |
1647 | * Makes sure the given map is loaded and swapped in. |
1557 | * Makes sure the given map is loaded and swapped in. |
1648 | * name is path name of the map. |
1558 | * name is path name of the map. |
1649 | * flags meaning: |
1559 | * flags meaning: |
… | |
… | |
1652 | * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. |
1562 | * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. |
1653 | * dont do any more name translation on it. |
1563 | * dont do any more name translation on it. |
1654 | * |
1564 | * |
1655 | * Returns a pointer to the given map. |
1565 | * Returns a pointer to the given map. |
1656 | */ |
1566 | */ |
1657 | |
|
|
1658 | maptile * |
1567 | maptile * |
1659 | ready_map_name (const char *name, int flags) |
1568 | ready_map_name (const char *name, int flags) |
1660 | { |
1569 | { |
1661 | maptile *m; |
|
|
1662 | |
|
|
1663 | if (!name) |
1570 | if (!name) |
1664 | return (NULL); |
1571 | return 0; |
1665 | |
1572 | |
1666 | /* Have we been at this level before? */ |
1573 | /* Have we been at this level before? */ |
1667 | m = has_been_loaded (name); |
1574 | maptile *m = has_been_loaded (name); |
1668 | |
1575 | |
1669 | /* Map is good to go, so just return it */ |
1576 | /* Map is good to go, so just return it */ |
1670 | if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) |
1577 | if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) |
1671 | { |
|
|
1672 | return m; |
1578 | return m; |
1673 | } |
|
|
1674 | |
1579 | |
1675 | /* unique maps always get loaded from their original location, and never |
1580 | /* unique maps always get loaded from their original location, and never |
1676 | * a temp location. Likewise, if map_flush is set, or we have never loaded |
1581 | * a temp location. Likewise, if map_flush is set, or we have never loaded |
1677 | * this map, load it now. I removed the reset checking from here - |
1582 | * this map, load it now. I removed the reset checking from here - |
1678 | * it seems the probability of a player trying to enter a map that should |
1583 | * it seems the probability of a player trying to enter a map that should |
… | |
… | |
1680 | * a bit cleaner (and players probably shouldn't rely on exact timing for |
1585 | * a bit cleaner (and players probably shouldn't rely on exact timing for |
1681 | * resets in any case - if they really care, they should use the 'maps command. |
1586 | * resets in any case - if they really care, they should use the 'maps command. |
1682 | */ |
1587 | */ |
1683 | if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m) |
1588 | if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m) |
1684 | { |
1589 | { |
1685 | |
|
|
1686 | /* first visit or time to reset */ |
1590 | /* first visit or time to reset */ |
1687 | if (m) |
1591 | if (m) |
1688 | { |
1592 | { |
1689 | clean_tmp_map (m); /* Doesn't make much difference */ |
1593 | clean_tmp_map (m); /* Doesn't make much difference */ |
1690 | delete_map (m); |
1594 | delete_map (m); |
… | |
… | |
1777 | int x, y, i; |
1681 | int x, y, i; |
1778 | long monster_cnt = 0; |
1682 | long monster_cnt = 0; |
1779 | double avgexp = 0; |
1683 | double avgexp = 0; |
1780 | sint64 total_exp = 0; |
1684 | sint64 total_exp = 0; |
1781 | |
1685 | |
1782 | if (MAP_DIFFICULTY (m)) |
1686 | if (m->difficulty) |
1783 | { |
1687 | { |
1784 | LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m)); |
1688 | LOG (llevDebug, "Using stored map difficulty: %d\n", m->difficulty); |
1785 | return MAP_DIFFICULTY (m); |
1689 | return m->difficulty; |
1786 | } |
1690 | } |
1787 | |
1691 | |
1788 | for (x = 0; x < MAP_WIDTH (m); x++) |
1692 | for (x = 0; x < m->width; x++) |
1789 | for (y = 0; y < MAP_HEIGHT (m); y++) |
1693 | for (y = 0; y < m->height; y++) |
1790 | for (op = get_map_ob (m, x, y); op != NULL; op = op->above) |
1694 | for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above) |
1791 | { |
1695 | { |
1792 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
1696 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
1793 | { |
1697 | { |
1794 | total_exp += op->stats.exp; |
1698 | total_exp += op->stats.exp; |
1795 | monster_cnt++; |
1699 | monster_cnt++; |
… | |
… | |
1888 | /* All clients need to get re-updated for the change */ |
1792 | /* All clients need to get re-updated for the change */ |
1889 | update_all_map_los (m); |
1793 | update_all_map_los (m); |
1890 | return 1; |
1794 | return 1; |
1891 | } |
1795 | } |
1892 | |
1796 | |
1893 | |
|
|
1894 | /* |
1797 | /* |
1895 | * This function updates various attributes about a specific space |
1798 | * This function updates various attributes about a specific space |
1896 | * on the map (what it looks like, whether it blocks magic, |
1799 | * on the map (what it looks like, whether it blocks magic, |
1897 | * has a living creatures, prevents people from passing |
1800 | * has a living creatures, prevents people from passing |
1898 | * through, etc) |
1801 | * through, etc) |
1899 | */ |
1802 | */ |
1900 | void |
1803 | void |
1901 | update_position (maptile *m, int x, int y) |
1804 | mapspace::update_ () |
1902 | { |
1805 | { |
1903 | object *tmp, *last = NULL; |
1806 | object *tmp, *last = 0; |
1904 | uint8 flags = 0, oldflags, light = 0, anywhere = 0; |
1807 | uint8 flags = 0, light = 0, anywhere = 0; |
1905 | New_Face *top, *floor, *middle; |
1808 | New_Face *top, *floor, *middle; |
1906 | object *top_obj, *floor_obj, *middle_obj; |
1809 | object *top_obj, *floor_obj, *middle_obj; |
1907 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1810 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1908 | |
1811 | |
1909 | oldflags = GET_MAP_FLAGS (m, x, y); |
|
|
1910 | if (!(oldflags & P_NEED_UPDATE)) |
|
|
1911 | { |
|
|
1912 | LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y); |
|
|
1913 | return; |
|
|
1914 | } |
|
|
1915 | |
|
|
1916 | middle = blank_face; |
1812 | middle = blank_face; |
1917 | top = blank_face; |
1813 | top = blank_face; |
1918 | floor = blank_face; |
1814 | floor = blank_face; |
1919 | |
1815 | |
1920 | middle_obj = NULL; |
1816 | middle_obj = 0; |
1921 | top_obj = NULL; |
1817 | top_obj = 0; |
1922 | floor_obj = NULL; |
1818 | floor_obj = 0; |
1923 | |
1819 | |
1924 | for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) |
1820 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1925 | { |
1821 | { |
1926 | |
|
|
1927 | /* This could be made additive I guess (two lights better than |
1822 | /* This could be made additive I guess (two lights better than |
1928 | * one). But if so, it shouldn't be a simple additive - 2 |
1823 | * one). But if so, it shouldn't be a simple additive - 2 |
1929 | * light bulbs do not illuminate twice as far as once since |
1824 | * light bulbs do not illuminate twice as far as once since |
1930 | * it is a disapation factor that is squared (or is it cubed?) |
1825 | * it is a dissapation factor that is cubed. |
1931 | */ |
1826 | */ |
1932 | if (tmp->glow_radius > light) |
1827 | if (tmp->glow_radius > light) |
1933 | light = tmp->glow_radius; |
1828 | light = tmp->glow_radius; |
1934 | |
1829 | |
1935 | /* This call is needed in order to update objects the player |
1830 | /* This call is needed in order to update objects the player |
… | |
… | |
1973 | { |
1868 | { |
1974 | middle = tmp->face; |
1869 | middle = tmp->face; |
1975 | middle_obj = tmp; |
1870 | middle_obj = tmp; |
1976 | } |
1871 | } |
1977 | } |
1872 | } |
|
|
1873 | |
1978 | if (tmp == tmp->above) |
1874 | if (tmp == tmp->above) |
1979 | { |
1875 | { |
1980 | LOG (llevError, "Error in structure of map\n"); |
1876 | LOG (llevError, "Error in structure of map\n"); |
1981 | exit (-1); |
1877 | exit (-1); |
1982 | } |
1878 | } |
1983 | |
1879 | |
1984 | move_slow |= tmp->move_slow; |
1880 | move_slow |= tmp->move_slow; |
1985 | move_block |= tmp->move_block; |
1881 | move_block |= tmp->move_block; |
1986 | move_on |= tmp->move_on; |
1882 | move_on |= tmp->move_on; |
1987 | move_off |= tmp->move_off; |
1883 | move_off |= tmp->move_off; |
1988 | move_allow |= tmp->move_allow; |
1884 | move_allow |= tmp->move_allow; |
1989 | |
1885 | |
1990 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) |
|
|
1991 | flags |= P_IS_ALIVE; |
|
|
1992 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) |
|
|
1993 | flags |= P_NO_MAGIC; |
|
|
1994 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) |
|
|
1995 | flags |= P_NO_CLERIC; |
|
|
1996 | if (tmp->type == SAFE_GROUND) |
|
|
1997 | flags |= P_SAFE; |
|
|
1998 | |
|
|
1999 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) |
1886 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; |
2000 | flags |= P_BLOCKSVIEW; |
1887 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; |
2001 | } /* for stack of objects */ |
1888 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
2002 | |
1889 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
2003 | /* we don't want to rely on this function to have accurate flags, but |
1890 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
2004 | * since we're already doing the work, we calculate them here. |
1891 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
2005 | * if they don't match, logic is broken someplace. |
|
|
2006 | */ |
|
|
2007 | if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR))) |
|
|
2008 | { |
1892 | } |
2009 | LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", |
1893 | |
2010 | m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags); |
1894 | this->light = light; |
2011 | } |
1895 | this->flags_ = flags; |
2012 | SET_MAP_FLAGS (m, x, y, flags); |
1896 | this->move_block = move_block & ~move_allow; |
2013 | SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow); |
1897 | this->move_on = move_on; |
2014 | SET_MAP_MOVE_ON (m, x, y, move_on); |
1898 | this->move_off = move_off; |
2015 | SET_MAP_MOVE_OFF (m, x, y, move_off); |
1899 | this->move_slow = move_slow; |
2016 | SET_MAP_MOVE_SLOW (m, x, y, move_slow); |
|
|
2017 | |
1900 | |
2018 | /* At this point, we have a floor face (if there is a floor), |
1901 | /* At this point, we have a floor face (if there is a floor), |
2019 | * and the floor is set - we are not going to touch it at |
1902 | * and the floor is set - we are not going to touch it at |
2020 | * this point. |
1903 | * this point. |
2021 | * middle contains the highest visibility face. |
1904 | * middle contains the highest visibility face. |
… | |
… | |
2075 | break; |
1958 | break; |
2076 | } |
1959 | } |
2077 | } |
1960 | } |
2078 | } |
1961 | } |
2079 | } |
1962 | } |
|
|
1963 | |
2080 | if (middle == floor) |
1964 | if (middle == floor) |
2081 | middle = blank_face; |
1965 | middle = blank_face; |
|
|
1966 | |
2082 | if (top == middle) |
1967 | if (top == middle) |
2083 | middle = blank_face; |
1968 | middle = blank_face; |
2084 | SET_MAP_FACE (m, x, y, top, 0); |
|
|
2085 | if (top != blank_face) |
|
|
2086 | SET_MAP_FACE_OBJ (m, x, y, top_obj, 0); |
|
|
2087 | else |
|
|
2088 | SET_MAP_FACE_OBJ (m, x, y, NULL, 0); |
|
|
2089 | SET_MAP_FACE (m, x, y, middle, 1); |
|
|
2090 | if (middle != blank_face) |
|
|
2091 | SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1); |
|
|
2092 | else |
|
|
2093 | SET_MAP_FACE_OBJ (m, x, y, NULL, 1); |
|
|
2094 | SET_MAP_FACE (m, x, y, floor, 2); |
|
|
2095 | if (floor != blank_face) |
|
|
2096 | SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2); |
|
|
2097 | else |
|
|
2098 | SET_MAP_FACE_OBJ (m, x, y, NULL, 2); |
|
|
2099 | SET_MAP_LIGHT (m, x, y, light); |
|
|
2100 | } |
|
|
2101 | |
1969 | |
|
|
1970 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
|
|
1971 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
|
|
1972 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
|
|
1973 | } |
2102 | |
1974 | |
2103 | void |
1975 | void |
2104 | set_map_reset_time (maptile *map) |
1976 | set_map_reset_time (maptile *map) |
2105 | { |
1977 | { |
2106 | int timeout; |
1978 | int timeout; |
2107 | |
1979 | |
2108 | timeout = MAP_RESET_TIMEOUT (map); |
1980 | timeout = map->reset_timeout; |
2109 | if (timeout <= 0) |
1981 | if (timeout <= 0) |
2110 | timeout = MAP_DEFAULTRESET; |
1982 | timeout = MAP_DEFAULTRESET; |
2111 | if (timeout >= MAP_MAXRESET) |
1983 | if (timeout >= MAP_MAXRESET) |
2112 | timeout = MAP_MAXRESET; |
1984 | timeout = MAP_MAXRESET; |
2113 | MAP_WHEN_RESET (map) = time (0) + timeout; |
1985 | map->reset_time = time (0) + timeout; |
2114 | } |
1986 | } |
2115 | |
1987 | |
2116 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1988 | /* this updates the orig_map->tile_map[tile_num] value after loading |
2117 | * the map. It also takes care of linking back the freshly loaded |
1989 | * the map. It also takes care of linking back the freshly loaded |
2118 | * maps tile_map values if it tiles back to this one. It returns |
1990 | * maps tile_map values if it tiles back to this one. It returns |
… | |
… | |
2146 | * |
2018 | * |
2147 | */ |
2019 | */ |
2148 | int |
2020 | int |
2149 | out_of_map (maptile *m, int x, int y) |
2021 | out_of_map (maptile *m, int x, int y) |
2150 | { |
2022 | { |
2151 | |
|
|
2152 | /* If we get passed a null map, this is obviously the |
2023 | /* If we get passed a null map, this is obviously the |
2153 | * case. This generally shouldn't happen, but if the |
2024 | * case. This generally shouldn't happen, but if the |
2154 | * map loads fail below, it could happen. |
2025 | * map loads fail below, it could happen. |
2155 | */ |
2026 | */ |
2156 | if (!m) |
2027 | if (!m) |
… | |
… | |
2158 | |
2029 | |
2159 | if (x < 0) |
2030 | if (x < 0) |
2160 | { |
2031 | { |
2161 | if (!m->tile_path[3]) |
2032 | if (!m->tile_path[3]) |
2162 | return 1; |
2033 | return 1; |
|
|
2034 | |
2163 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2035 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2164 | { |
|
|
2165 | load_and_link_tiled_map (m, 3); |
2036 | load_and_link_tiled_map (m, 3); |
2166 | } |
2037 | |
2167 | return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); |
2038 | return (out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y)); |
2168 | } |
2039 | } |
2169 | if (x >= MAP_WIDTH (m)) |
2040 | |
|
|
2041 | if (x >= m->width) |
2170 | { |
2042 | { |
2171 | if (!m->tile_path[1]) |
2043 | if (!m->tile_path[1]) |
2172 | return 1; |
2044 | return 1; |
|
|
2045 | |
2173 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2046 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2174 | { |
|
|
2175 | load_and_link_tiled_map (m, 1); |
2047 | load_and_link_tiled_map (m, 1); |
2176 | } |
2048 | |
2177 | return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); |
2049 | return (out_of_map (m->tile_map[1], x - m->width, y)); |
2178 | } |
2050 | } |
|
|
2051 | |
2179 | if (y < 0) |
2052 | if (y < 0) |
2180 | { |
2053 | { |
2181 | if (!m->tile_path[0]) |
2054 | if (!m->tile_path[0]) |
2182 | return 1; |
2055 | return 1; |
|
|
2056 | |
2183 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2057 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2184 | { |
|
|
2185 | load_and_link_tiled_map (m, 0); |
2058 | load_and_link_tiled_map (m, 0); |
2186 | } |
2059 | |
2187 | return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); |
2060 | return (out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height)); |
2188 | } |
2061 | } |
2189 | if (y >= MAP_HEIGHT (m)) |
2062 | |
|
|
2063 | if (y >= m->height) |
2190 | { |
2064 | { |
2191 | if (!m->tile_path[2]) |
2065 | if (!m->tile_path[2]) |
2192 | return 1; |
2066 | return 1; |
|
|
2067 | |
2193 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2068 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2194 | { |
|
|
2195 | load_and_link_tiled_map (m, 2); |
2069 | load_and_link_tiled_map (m, 2); |
2196 | } |
2070 | |
2197 | return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); |
2071 | return (out_of_map (m->tile_map[2], x, y - m->height)); |
2198 | } |
2072 | } |
2199 | |
2073 | |
2200 | /* Simple case - coordinates are within this local |
2074 | /* Simple case - coordinates are within this local |
2201 | * map. |
2075 | * map. |
2202 | */ |
2076 | */ |
… | |
… | |
2216 | { |
2090 | { |
2217 | |
2091 | |
2218 | if (*x < 0) |
2092 | if (*x < 0) |
2219 | { |
2093 | { |
2220 | if (!m->tile_path[3]) |
2094 | if (!m->tile_path[3]) |
2221 | return NULL; |
2095 | return 0; |
2222 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2096 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2223 | load_and_link_tiled_map (m, 3); |
2097 | load_and_link_tiled_map (m, 3); |
2224 | |
2098 | |
2225 | *x += MAP_WIDTH (m->tile_map[3]); |
2099 | *x += m->tile_map[3]->width; |
2226 | return (get_map_from_coord (m->tile_map[3], x, y)); |
2100 | return (get_map_from_coord (m->tile_map[3], x, y)); |
2227 | } |
2101 | } |
2228 | if (*x >= MAP_WIDTH (m)) |
2102 | |
|
|
2103 | if (*x >= m->width) |
2229 | { |
2104 | { |
2230 | if (!m->tile_path[1]) |
2105 | if (!m->tile_path[1]) |
2231 | return NULL; |
2106 | return 0; |
|
|
2107 | |
2232 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2108 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2233 | load_and_link_tiled_map (m, 1); |
2109 | load_and_link_tiled_map (m, 1); |
2234 | |
2110 | |
2235 | *x -= MAP_WIDTH (m); |
2111 | *x -= m->width; |
2236 | return (get_map_from_coord (m->tile_map[1], x, y)); |
2112 | return (get_map_from_coord (m->tile_map[1], x, y)); |
2237 | } |
2113 | } |
|
|
2114 | |
2238 | if (*y < 0) |
2115 | if (*y < 0) |
2239 | { |
2116 | { |
2240 | if (!m->tile_path[0]) |
2117 | if (!m->tile_path[0]) |
2241 | return NULL; |
2118 | return 0; |
|
|
2119 | |
2242 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2120 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2243 | load_and_link_tiled_map (m, 0); |
2121 | load_and_link_tiled_map (m, 0); |
2244 | |
2122 | |
2245 | *y += MAP_HEIGHT (m->tile_map[0]); |
2123 | *y += m->tile_map[0]->height; |
2246 | return (get_map_from_coord (m->tile_map[0], x, y)); |
2124 | return (get_map_from_coord (m->tile_map[0], x, y)); |
2247 | } |
2125 | } |
2248 | if (*y >= MAP_HEIGHT (m)) |
2126 | |
|
|
2127 | if (*y >= m->height) |
2249 | { |
2128 | { |
2250 | if (!m->tile_path[2]) |
2129 | if (!m->tile_path[2]) |
2251 | return NULL; |
2130 | return 0; |
|
|
2131 | |
2252 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2132 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2253 | load_and_link_tiled_map (m, 2); |
2133 | load_and_link_tiled_map (m, 2); |
2254 | |
2134 | |
2255 | *y -= MAP_HEIGHT (m); |
2135 | *y -= m->height; |
2256 | return (get_map_from_coord (m->tile_map[2], x, y)); |
2136 | return (get_map_from_coord (m->tile_map[2], x, y)); |
2257 | } |
2137 | } |
2258 | |
2138 | |
2259 | /* Simple case - coordinates are within this local |
2139 | /* Simple case - coordinates are within this local |
2260 | * map. |
2140 | * map. |
… | |
… | |
2280 | |
2160 | |
2281 | } |
2161 | } |
2282 | else if (map1->tile_map[0] == map2) |
2162 | else if (map1->tile_map[0] == map2) |
2283 | { /* up */ |
2163 | { /* up */ |
2284 | *dx = 0; |
2164 | *dx = 0; |
2285 | *dy = -MAP_HEIGHT (map2); |
2165 | *dy = -map2->height; |
2286 | } |
2166 | } |
2287 | else if (map1->tile_map[1] == map2) |
2167 | else if (map1->tile_map[1] == map2) |
2288 | { /* right */ |
2168 | { /* right */ |
2289 | *dx = MAP_WIDTH (map1); |
2169 | *dx = map1->width; |
2290 | *dy = 0; |
2170 | *dy = 0; |
2291 | } |
2171 | } |
2292 | else if (map1->tile_map[2] == map2) |
2172 | else if (map1->tile_map[2] == map2) |
2293 | { /* down */ |
2173 | { /* down */ |
2294 | *dx = 0; |
2174 | *dx = 0; |
2295 | *dy = MAP_HEIGHT (map1); |
2175 | *dy = map1->height; |
2296 | } |
2176 | } |
2297 | else if (map1->tile_map[3] == map2) |
2177 | else if (map1->tile_map[3] == map2) |
2298 | { /* left */ |
2178 | { /* left */ |
2299 | *dx = -MAP_WIDTH (map2); |
2179 | *dx = -map2->width; |
2300 | *dy = 0; |
2180 | *dy = 0; |
2301 | |
2181 | |
2302 | } |
2182 | } |
2303 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) |
2183 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) |
2304 | { /* up right */ |
2184 | { /* up right */ |
2305 | *dx = MAP_WIDTH (map1->tile_map[0]); |
2185 | *dx = map1->tile_map[0]->width; |
2306 | *dy = -MAP_HEIGHT (map1->tile_map[0]); |
2186 | *dy = -map1->tile_map[0]->height; |
2307 | } |
2187 | } |
2308 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) |
2188 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) |
2309 | { /* up left */ |
2189 | { /* up left */ |
2310 | *dx = -MAP_WIDTH (map2); |
2190 | *dx = -map2->width; |
2311 | *dy = -MAP_HEIGHT (map1->tile_map[0]); |
2191 | *dy = -map1->tile_map[0]->height; |
2312 | } |
2192 | } |
2313 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) |
2193 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) |
2314 | { /* right up */ |
2194 | { /* right up */ |
2315 | *dx = MAP_WIDTH (map1); |
2195 | *dx = map1->width; |
2316 | *dy = -MAP_HEIGHT (map2); |
2196 | *dy = -map2->height; |
2317 | } |
2197 | } |
2318 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) |
2198 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) |
2319 | { /* right down */ |
2199 | { /* right down */ |
2320 | *dx = MAP_WIDTH (map1); |
2200 | *dx = map1->width; |
2321 | *dy = MAP_HEIGHT (map1->tile_map[1]); |
2201 | *dy = map1->tile_map[1]->height; |
2322 | } |
2202 | } |
2323 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) |
2203 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) |
2324 | { /* down right */ |
2204 | { /* down right */ |
2325 | *dx = MAP_WIDTH (map1->tile_map[2]); |
2205 | *dx = map1->tile_map[2]->width; |
2326 | *dy = MAP_HEIGHT (map1); |
2206 | *dy = map1->height; |
2327 | } |
2207 | } |
2328 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) |
2208 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) |
2329 | { /* down left */ |
2209 | { /* down left */ |
2330 | *dx = -MAP_WIDTH (map2); |
2210 | *dx = -map2->width; |
2331 | *dy = MAP_HEIGHT (map1); |
2211 | *dy = map1->height; |
2332 | } |
2212 | } |
2333 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) |
2213 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) |
2334 | { /* left up */ |
2214 | { /* left up */ |
2335 | *dx = -MAP_WIDTH (map1->tile_map[3]); |
2215 | *dx = -map1->tile_map[3]->width; |
2336 | *dy = -MAP_HEIGHT (map2); |
2216 | *dy = -map2->height; |
2337 | } |
2217 | } |
2338 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) |
2218 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) |
2339 | { /* left down */ |
2219 | { /* left down */ |
2340 | *dx = -MAP_WIDTH (map1->tile_map[3]); |
2220 | *dx = -map1->tile_map[3]->width; |
2341 | *dy = MAP_HEIGHT (map1->tile_map[3]); |
2221 | *dy = map1->tile_map[3]->height; |
2342 | |
2222 | |
2343 | } |
2223 | } |
2344 | else |
2224 | else |
2345 | { /* not "adjacent" enough */ |
2225 | { /* not "adjacent" enough */ |
2346 | return 0; |
2226 | return 0; |
… | |
… | |
2471 | { |
2351 | { |
2472 | int dx, dy; |
2352 | int dx, dy; |
2473 | |
2353 | |
2474 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
2354 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
2475 | } |
2355 | } |
|
|
2356 | |
|
|
2357 | object * |
|
|
2358 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
|
|
2359 | { |
|
|
2360 | if (!op->flag [FLAG_REMOVED]) |
|
|
2361 | op->remove (); |
|
|
2362 | |
|
|
2363 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
|
|
2364 | } |
|
|
2365 | |