… | |
… | |
27 | |
27 | |
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 | |
|
|
33 | |
32 | |
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 | */ |
… | |
… | |
223 | void |
222 | void |
224 | dump_all_maps (void) |
223 | dump_all_maps (void) |
225 | { |
224 | { |
226 | maptile *m; |
225 | maptile *m; |
227 | |
226 | |
228 | for (m = first_map; m != NULL; m = m->next) |
227 | for (m = first_map; m; m = m->next) |
229 | { |
|
|
230 | dump_map (m); |
228 | dump_map (m); |
231 | } |
|
|
232 | } |
229 | } |
233 | |
230 | |
234 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
231 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
235 | * one function that just returns a P_.. value (see map.h) |
232 | * one function that just returns a P_.. value (see map.h) |
236 | * it will also do map translation for tiled maps, returning |
233 | * it will also do map translation for tiled maps, returning |
… | |
… | |
240 | * is needed. The case of not passing values is if we're just |
237 | * is needed. The case of not passing values is if we're just |
241 | * checking for the existence of something on those spaces, but |
238 | * checking for the existence of something on those spaces, but |
242 | * don't expect to insert/remove anything from those spaces. |
239 | * don't expect to insert/remove anything from those spaces. |
243 | */ |
240 | */ |
244 | int |
241 | int |
245 | get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) |
242 | get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny) |
246 | { |
243 | { |
247 | sint16 newx, newy; |
244 | sint16 newx, newy; |
248 | int retval = 0; |
245 | int retval = 0; |
249 | maptile *mp; |
246 | maptile *mp; |
250 | |
247 | |
251 | if (out_of_map (oldmap, x, y)) |
|
|
252 | return P_OUT_OF_MAP; |
|
|
253 | newx = x; |
248 | newx = x; |
254 | newy = y; |
249 | newy = y; |
|
|
250 | |
255 | mp = get_map_from_coord (oldmap, &newx, &newy); |
251 | mp = get_map_from_coord (oldmap, &newx, &newy); |
|
|
252 | |
|
|
253 | if (!mp) |
|
|
254 | return P_OUT_OF_MAP; |
|
|
255 | |
256 | if (mp != oldmap) |
256 | if (mp != oldmap) |
257 | retval |= P_NEW_MAP; |
257 | retval |= P_NEW_MAP; |
258 | if (newmap) |
|
|
259 | *newmap = mp; |
|
|
260 | if (nx) |
|
|
261 | *nx = newx; |
|
|
262 | if (ny) |
|
|
263 | *ny = newy; |
|
|
264 | |
258 | |
265 | retval |= mp->spaces[newx + mp->width * newy].flags; |
259 | if (newmap) *newmap = mp; |
|
|
260 | if (nx) *nx = newx; |
|
|
261 | if (ny) *ny = newy; |
266 | |
262 | |
267 | return retval; |
263 | return retval | mp->at (newx, newy).flags (); |
268 | } |
264 | } |
269 | |
265 | |
270 | /* |
266 | /* |
271 | * Returns true if the given coordinate is blocked except by the |
267 | * Returns true if the given coordinate is blocked except by the |
272 | * object passed is not blocking. This is used with |
268 | * object passed is not blocking. This is used with |
… | |
… | |
295 | } |
291 | } |
296 | |
292 | |
297 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
293 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
298 | * directly. |
294 | * directly. |
299 | */ |
295 | */ |
300 | mflags = m->spaces[sx + m->width * sy].flags; |
296 | mflags = m->at (sx, sy).flags (); |
301 | |
297 | |
302 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
298 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
303 | |
299 | |
304 | /* If space is currently not blocked by anything, no need to |
300 | /* If space is currently not blocked by anything, no need to |
305 | * go further. Not true for players - all sorts of special |
301 | * go further. Not true for players - all sorts of special |
… | |
… | |
324 | /* We basically go through the stack of objects, and if there is |
320 | /* We basically go through the stack of objects, and if there is |
325 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
321 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
326 | * true. If we get through the entire stack, that must mean |
322 | * true. If we get through the entire stack, that must mean |
327 | * ob is blocking it, so return 0. |
323 | * ob is blocking it, so return 0. |
328 | */ |
324 | */ |
329 | for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above) |
325 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
330 | { |
326 | { |
331 | |
327 | |
332 | /* This must be before the checks below. Code for inventory checkers. */ |
328 | /* This must be before the checks below. Code for inventory checkers. */ |
333 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
329 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
334 | { |
330 | { |
… | |
… | |
398 | * |
394 | * |
399 | * Note this used to be arch_blocked, but with new movement |
395 | * Note this used to be arch_blocked, but with new movement |
400 | * code, we need to have actual object to check its move_type |
396 | * code, we need to have actual object to check its move_type |
401 | * against the move_block values. |
397 | * against the move_block values. |
402 | */ |
398 | */ |
403 | |
|
|
404 | int |
399 | int |
405 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
400 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
406 | { |
401 | { |
407 | archetype *tmp; |
402 | archetype *tmp; |
408 | int flag; |
403 | int flag; |
… | |
… | |
438 | |
433 | |
439 | /* 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 |
440 | * head of the object should correspond for the entire object. |
435 | * head of the object should correspond for the entire object. |
441 | */ |
436 | */ |
442 | if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) |
437 | if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) |
443 | return AB_NO_PASS; |
438 | return P_NO_PASS; |
444 | |
|
|
445 | } |
439 | } |
|
|
440 | |
446 | return 0; |
441 | return 0; |
447 | } |
442 | } |
448 | |
443 | |
449 | /* 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 |
450 | * 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 |
… | |
… | |
487 | object *tmp, *op, *last, *above; |
482 | object *tmp, *op, *last, *above; |
488 | archetype *at; |
483 | archetype *at; |
489 | |
484 | |
490 | for (x = 0; x < MAP_WIDTH (m); x++) |
485 | for (x = 0; x < MAP_WIDTH (m); x++) |
491 | for (y = 0; y < MAP_HEIGHT (m); y++) |
486 | for (y = 0; y < MAP_HEIGHT (m); y++) |
492 | for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above) |
487 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above) |
493 | { |
488 | { |
494 | above = tmp->above; |
489 | above = tmp->above; |
495 | |
490 | |
496 | /* already multipart - don't do anything more */ |
491 | /* already multipart - don't do anything more */ |
497 | if (tmp->head || tmp->more) |
492 | if (tmp->head || tmp->more) |
… | |
… | |
582 | { |
577 | { |
583 | for (j = 0; j < m->height; j++) |
578 | for (j = 0; j < m->height; j++) |
584 | { |
579 | { |
585 | unique = 0; |
580 | unique = 0; |
586 | /* check for unique items, or unique squares */ |
581 | /* check for unique items, or unique squares */ |
587 | for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) |
582 | for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) |
588 | { |
583 | { |
589 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
584 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
590 | unique = 1; |
585 | unique = 1; |
591 | |
586 | |
592 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
587 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
… | |
… | |
613 | /* first pass - save one-part objects */ |
608 | /* first pass - save one-part objects */ |
614 | for (i = 0; i < MAP_WIDTH (m); i++) |
609 | for (i = 0; i < MAP_WIDTH (m); i++) |
615 | for (j = 0; j < MAP_HEIGHT (m); j++) |
610 | for (j = 0; j < MAP_HEIGHT (m); j++) |
616 | { |
611 | { |
617 | unique = 0; |
612 | unique = 0; |
618 | for (op = get_map_ob (m, i, j); op; op = op->above) |
613 | for (op = GET_MAP_OB (m, i, j); op; op = op->above) |
619 | { |
614 | { |
620 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
615 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
621 | unique = 1; |
616 | unique = 1; |
622 | |
617 | |
623 | if (op->type == PLAYER) |
618 | if (op->type == PLAYER) |
624 | { |
|
|
625 | LOG (llevDebug, "Player on map that is being saved\n"); |
|
|
626 | continue; |
619 | continue; |
627 | } |
|
|
628 | |
620 | |
629 | if (op->head || op->owner) |
621 | if (op->head || op->owner) |
630 | continue; |
622 | continue; |
631 | |
623 | |
632 | if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) |
624 | if (unique || QUERY_FLAG (op, FLAG_UNIQUE)) |
633 | save_object (fp2, op, 3); |
625 | save_object (fp2, op, 3); |
634 | else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) |
626 | else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID)))) |
635 | save_object (fp, op, 3); |
627 | save_object (fp, op, 3); |
636 | |
628 | } |
637 | } /* for this space */ |
629 | } |
638 | } /* for this j */ |
|
|
639 | } |
630 | } |
640 | |
631 | |
641 | maptile::maptile () |
632 | maptile::maptile () |
642 | { |
633 | { |
643 | in_memory = MAP_SWAPPED; |
634 | in_memory = MAP_SWAPPED; |
… | |
… | |
693 | { |
684 | { |
694 | LOG (llevError, "allocate_map called with already allocated map (%s)\n", path); |
685 | LOG (llevError, "allocate_map called with already allocated map (%s)\n", path); |
695 | free (spaces); |
686 | free (spaces); |
696 | } |
687 | } |
697 | |
688 | |
698 | spaces = (MapSpace *) |
689 | spaces = (mapspace *) |
699 | calloc (1, width * height * sizeof (MapSpace)); |
690 | calloc (1, width * height * sizeof (mapspace)); |
700 | |
691 | |
701 | if (!spaces) |
692 | if (!spaces) |
702 | fatal (OUT_OF_MEMORY); |
693 | fatal (OUT_OF_MEMORY); |
703 | } |
694 | } |
704 | |
695 | |
… | |
… | |
730 | char *shop_string, *p, *q, *next_semicolon, *next_colon; |
721 | char *shop_string, *p, *q, *next_semicolon, *next_colon; |
731 | shopitems *items = NULL; |
722 | shopitems *items = NULL; |
732 | int i = 0, number_of_entries = 0; |
723 | int i = 0, number_of_entries = 0; |
733 | const typedata *current_type; |
724 | const typedata *current_type; |
734 | |
725 | |
735 | shop_string = strdup_local (input_string); |
726 | shop_string = strdup (input_string); |
736 | p = shop_string; |
727 | p = shop_string; |
737 | /* first we'll count the entries, we'll need that for allocating the array shortly */ |
728 | /* first we'll count the entries, we'll need that for allocating the array shortly */ |
738 | while (p) |
729 | while (p) |
739 | { |
730 | { |
740 | p = strchr (p, ';'); |
731 | p = strchr (p, ';'); |
… | |
… | |
926 | * with nothing between). There is no reason in those cases to |
917 | * with nothing between). There is no reason in those cases to |
927 | * keep the empty message. Also, msgbuf contains garbage data |
918 | * keep the empty message. Also, msgbuf contains garbage data |
928 | * when msgpos is zero, so copying it results in crashes |
919 | * when msgpos is zero, so copying it results in crashes |
929 | */ |
920 | */ |
930 | if (msgpos != 0) |
921 | if (msgpos != 0) |
931 | m->msg = strdup_local (msgbuf); |
922 | m->msg = strdup (msgbuf); |
932 | } |
923 | } |
933 | else if (!strcmp (key, "maplore")) |
924 | else if (!strcmp (key, "maplore")) |
934 | { |
925 | { |
935 | while (fgets (buf, HUGE_BUF, fp) != NULL) |
926 | while (fgets (buf, HUGE_BUF, fp) != NULL) |
936 | { |
927 | { |
… | |
… | |
942 | strcpy (maplorebuf + maplorepos, buf); |
933 | strcpy (maplorebuf + maplorepos, buf); |
943 | maplorepos += strlen (buf); |
934 | maplorepos += strlen (buf); |
944 | } |
935 | } |
945 | } |
936 | } |
946 | if (maplorepos != 0) |
937 | if (maplorepos != 0) |
947 | m->maplore = strdup_local (maplorebuf); |
938 | m->maplore = strdup (maplorebuf); |
948 | } |
939 | } |
949 | else if (!strcmp (key, "end")) |
940 | else if (!strcmp (key, "end")) |
950 | { |
941 | { |
951 | break; |
942 | break; |
952 | } |
943 | } |
… | |
… | |
961 | LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value); |
952 | LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value); |
962 | } |
953 | } |
963 | else if (!strcmp (key, "name")) |
954 | else if (!strcmp (key, "name")) |
964 | { |
955 | { |
965 | *end = 0; |
956 | *end = 0; |
966 | m->name = strdup_local (value); |
957 | m->name = strdup (value); |
967 | } |
958 | } |
968 | /* first strcmp value on these are old names supported |
959 | /* first strcmp value on these are old names supported |
969 | * for compatibility reasons. The new values (second) are |
960 | * for compatibility reasons. The new values (second) are |
970 | * what really should be used. |
961 | * what really should be used. |
971 | */ |
962 | */ |
… | |
… | |
1009 | else if (!strcmp (key, "shopmax")) |
1000 | else if (!strcmp (key, "shopmax")) |
1010 | m->shopmax = atol (value); |
1001 | m->shopmax = atol (value); |
1011 | else if (!strcmp (key, "shoprace")) |
1002 | else if (!strcmp (key, "shoprace")) |
1012 | { |
1003 | { |
1013 | *end = 0; |
1004 | *end = 0; |
1014 | m->shoprace = strdup_local (value); |
1005 | m->shoprace = strdup (value); |
1015 | } |
1006 | } |
1016 | else if (!strcmp (key, "outdoor")) |
1007 | else if (!strcmp (key, "outdoor")) |
1017 | m->outdoor = atoi (value); |
1008 | m->outdoor = atoi (value); |
1018 | else if (!strcmp (key, "temp")) |
1009 | else if (!strcmp (key, "temp")) |
1019 | m->temp = atoi (value); |
1010 | m->temp = atoi (value); |
… | |
… | |
1069 | } |
1060 | } |
1070 | |
1061 | |
1071 | if (editor) |
1062 | if (editor) |
1072 | { |
1063 | { |
1073 | /* Use the value as in the file. */ |
1064 | /* Use the value as in the file. */ |
1074 | m->tile_path[tile - 1] = strdup_local (value); |
1065 | m->tile_path[tile - 1] = strdup (value); |
1075 | } |
1066 | } |
1076 | else if (path != NULL) |
1067 | else if (path != NULL) |
1077 | { |
1068 | { |
1078 | /* Use the normalized value. */ |
1069 | /* Use the normalized value. */ |
1079 | m->tile_path[tile - 1] = strdup_local (path); |
1070 | m->tile_path[tile - 1] = strdup (path); |
1080 | } |
1071 | } |
1081 | } /* end if tile direction (in)valid */ |
1072 | } /* end if tile direction (in)valid */ |
1082 | } |
1073 | } |
1083 | else |
1074 | else |
1084 | LOG (llevError, "Got unknown value in map header: %s %s\n", key, value); |
1075 | LOG (llevError, "Got unknown value in map header: %s %s\n", key, value); |
… | |
… | |
1250 | for (i = 0; i < MAP_WIDTH (m); i++) |
1241 | for (i = 0; i < MAP_WIDTH (m); i++) |
1251 | for (j = 0; j < MAP_HEIGHT (m); j++) |
1242 | for (j = 0; j < MAP_HEIGHT (m); j++) |
1252 | { |
1243 | { |
1253 | unique = 0; |
1244 | unique = 0; |
1254 | |
1245 | |
1255 | for (op = get_map_ob (m, i, j); op; op = next) |
1246 | for (op = GET_MAP_OB (m, i, j); op; op = next) |
1256 | { |
1247 | { |
1257 | next = op->above; |
1248 | next = op->above; |
1258 | |
1249 | |
1259 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
1250 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
1260 | unique = 1; |
1251 | unique = 1; |
… | |
… | |
1343 | make_path_to_file (filename); |
1334 | make_path_to_file (filename); |
1344 | } |
1335 | } |
1345 | else |
1336 | else |
1346 | { |
1337 | { |
1347 | if (!m->tmpname) |
1338 | if (!m->tmpname) |
1348 | m->tmpname = tempnam_local (settings.tmpdir, NULL); |
1339 | m->tmpname = tempnam (settings.tmpdir, NULL); |
1349 | |
1340 | |
1350 | strcpy (filename, m->tmpname); |
1341 | strcpy (filename, m->tmpname); |
1351 | } |
1342 | } |
1352 | |
1343 | |
1353 | LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); |
1344 | LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); |
… | |
… | |
1532 | if (!m->in_memory) |
1523 | if (!m->in_memory) |
1533 | { |
1524 | { |
1534 | LOG (llevError, "Trying to free freed map.\n"); |
1525 | LOG (llevError, "Trying to free freed map.\n"); |
1535 | return; |
1526 | return; |
1536 | } |
1527 | } |
|
|
1528 | |
|
|
1529 | // TODO: use new/delete |
|
|
1530 | #define FREE_AND_CLEAR(p) { free (p); p = NULL; } |
|
|
1531 | |
1537 | if (flag && m->spaces) |
1532 | if (flag && m->spaces) |
1538 | free_all_objects (m); |
1533 | free_all_objects (m); |
1539 | if (m->name) |
1534 | if (m->name) |
1540 | FREE_AND_CLEAR (m->name); |
1535 | FREE_AND_CLEAR (m->name); |
1541 | if (m->spaces) |
1536 | if (m->spaces) |
1542 | FREE_AND_CLEAR (m->spaces); |
1537 | FREE_AND_CLEAR (m->spaces); |
1543 | if (m->msg) |
1538 | if (m->msg) |
1544 | FREE_AND_CLEAR (m->msg); |
1539 | FREE_AND_CLEAR (m->msg); |
1545 | if (m->maplore) |
1540 | if (m->maplore) |
1546 | FREE_AND_CLEAR (m->maplore); |
1541 | FREE_AND_CLEAR (m->maplore); |
1547 | if (m->shopitems) |
1542 | |
1548 | delete[]m->shopitems; |
1543 | delete [] m->shopitems; |
1549 | m->shopitems = 0; |
1544 | m->shopitems = 0; |
|
|
1545 | |
1550 | if (m->shoprace) |
1546 | if (m->shoprace) |
1551 | FREE_AND_CLEAR (m->shoprace); |
1547 | FREE_AND_CLEAR (m->shoprace); |
|
|
1548 | |
1552 | if (m->buttons) |
1549 | if (m->buttons) |
1553 | free_objectlinkpt (m->buttons); |
1550 | free_objectlinkpt (m->buttons); |
|
|
1551 | |
1554 | m->buttons = NULL; |
1552 | m->buttons = NULL; |
|
|
1553 | |
1555 | for (i = 0; i < 4; i++) |
1554 | for (i = 0; i < 4; i++) |
1556 | { |
1555 | { |
1557 | if (m->tile_path[i]) |
1556 | if (m->tile_path[i]) |
1558 | FREE_AND_CLEAR (m->tile_path[i]); |
1557 | FREE_AND_CLEAR (m->tile_path[i]); |
1559 | m->tile_map[i] = NULL; |
1558 | m->tile_map[i] = NULL; |
1560 | } |
1559 | } |
|
|
1560 | |
1561 | m->in_memory = MAP_SWAPPED; |
1561 | m->in_memory = MAP_SWAPPED; |
|
|
1562 | |
|
|
1563 | #undef FREE_AND_CLEAR |
|
|
1564 | |
1562 | } |
1565 | } |
1563 | |
1566 | |
1564 | /* |
1567 | /* |
1565 | * function: vanish maptile |
1568 | * function: vanish maptile |
1566 | * m : pointer to maptile, if NULL no action |
1569 | * m : pointer to maptile, if NULL no action |
… | |
… | |
1626 | else |
1629 | else |
1627 | last->next = m->next; |
1630 | last->next = m->next; |
1628 | |
1631 | |
1629 | delete m; |
1632 | delete m; |
1630 | } |
1633 | } |
1631 | |
|
|
1632 | |
|
|
1633 | |
1634 | |
1634 | /* |
1635 | /* |
1635 | * Makes sure the given map is loaded and swapped in. |
1636 | * Makes sure the given map is loaded and swapped in. |
1636 | * name is path name of the map. |
1637 | * name is path name of the map. |
1637 | * flags meaning: |
1638 | * flags meaning: |
… | |
… | |
1640 | * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. |
1641 | * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. |
1641 | * dont do any more name translation on it. |
1642 | * dont do any more name translation on it. |
1642 | * |
1643 | * |
1643 | * Returns a pointer to the given map. |
1644 | * Returns a pointer to the given map. |
1644 | */ |
1645 | */ |
1645 | |
|
|
1646 | maptile * |
1646 | maptile * |
1647 | ready_map_name (const char *name, int flags) |
1647 | ready_map_name (const char *name, int flags) |
1648 | { |
1648 | { |
1649 | maptile *m; |
1649 | maptile *m; |
1650 | |
1650 | |
… | |
… | |
1773 | return MAP_DIFFICULTY (m); |
1773 | return MAP_DIFFICULTY (m); |
1774 | } |
1774 | } |
1775 | |
1775 | |
1776 | for (x = 0; x < MAP_WIDTH (m); x++) |
1776 | for (x = 0; x < MAP_WIDTH (m); x++) |
1777 | for (y = 0; y < MAP_HEIGHT (m); y++) |
1777 | for (y = 0; y < MAP_HEIGHT (m); y++) |
1778 | for (op = get_map_ob (m, x, y); op != NULL; op = op->above) |
1778 | for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above) |
1779 | { |
1779 | { |
1780 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
1780 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
1781 | { |
1781 | { |
1782 | total_exp += op->stats.exp; |
1782 | total_exp += op->stats.exp; |
1783 | monster_cnt++; |
1783 | monster_cnt++; |
… | |
… | |
1876 | /* All clients need to get re-updated for the change */ |
1876 | /* All clients need to get re-updated for the change */ |
1877 | update_all_map_los (m); |
1877 | update_all_map_los (m); |
1878 | return 1; |
1878 | return 1; |
1879 | } |
1879 | } |
1880 | |
1880 | |
1881 | |
|
|
1882 | /* |
1881 | /* |
1883 | * This function updates various attributes about a specific space |
1882 | * This function updates various attributes about a specific space |
1884 | * on the map (what it looks like, whether it blocks magic, |
1883 | * on the map (what it looks like, whether it blocks magic, |
1885 | * has a living creatures, prevents people from passing |
1884 | * has a living creatures, prevents people from passing |
1886 | * through, etc) |
1885 | * through, etc) |
1887 | */ |
1886 | */ |
1888 | void |
1887 | void |
1889 | update_position (maptile *m, int x, int y) |
1888 | mapspace::update_ () |
1890 | { |
1889 | { |
1891 | object *tmp, *last = NULL; |
1890 | object *tmp, *last = 0; |
1892 | uint8 flags = 0, oldflags, light = 0, anywhere = 0; |
1891 | uint8 flags = 0, light = 0, anywhere = 0; |
1893 | New_Face *top, *floor, *middle; |
1892 | New_Face *top, *floor, *middle; |
1894 | object *top_obj, *floor_obj, *middle_obj; |
1893 | object *top_obj, *floor_obj, *middle_obj; |
1895 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1894 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1896 | |
1895 | |
1897 | oldflags = GET_MAP_FLAGS (m, x, y); |
|
|
1898 | if (!(oldflags & P_NEED_UPDATE)) |
|
|
1899 | { |
|
|
1900 | LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y); |
|
|
1901 | return; |
|
|
1902 | } |
|
|
1903 | |
|
|
1904 | middle = blank_face; |
1896 | middle = blank_face; |
1905 | top = blank_face; |
1897 | top = blank_face; |
1906 | floor = blank_face; |
1898 | floor = blank_face; |
1907 | |
1899 | |
1908 | middle_obj = NULL; |
1900 | middle_obj = 0; |
1909 | top_obj = NULL; |
1901 | top_obj = 0; |
1910 | floor_obj = NULL; |
1902 | floor_obj = 0; |
1911 | |
1903 | |
1912 | for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) |
1904 | for (tmp = bottom; tmp; last = tmp, tmp = tmp->above) |
1913 | { |
1905 | { |
1914 | |
|
|
1915 | /* This could be made additive I guess (two lights better than |
1906 | /* This could be made additive I guess (two lights better than |
1916 | * one). But if so, it shouldn't be a simple additive - 2 |
1907 | * one). But if so, it shouldn't be a simple additive - 2 |
1917 | * light bulbs do not illuminate twice as far as once since |
1908 | * light bulbs do not illuminate twice as far as once since |
1918 | * it is a disapation factor that is squared (or is it cubed?) |
1909 | * it is a dissapation factor that is cubed. |
1919 | */ |
1910 | */ |
1920 | if (tmp->glow_radius > light) |
1911 | if (tmp->glow_radius > light) |
1921 | light = tmp->glow_radius; |
1912 | light = tmp->glow_radius; |
1922 | |
1913 | |
1923 | /* This call is needed in order to update objects the player |
1914 | /* This call is needed in order to update objects the player |
… | |
… | |
1961 | { |
1952 | { |
1962 | middle = tmp->face; |
1953 | middle = tmp->face; |
1963 | middle_obj = tmp; |
1954 | middle_obj = tmp; |
1964 | } |
1955 | } |
1965 | } |
1956 | } |
|
|
1957 | |
1966 | if (tmp == tmp->above) |
1958 | if (tmp == tmp->above) |
1967 | { |
1959 | { |
1968 | LOG (llevError, "Error in structure of map\n"); |
1960 | LOG (llevError, "Error in structure of map\n"); |
1969 | exit (-1); |
1961 | exit (-1); |
1970 | } |
1962 | } |
1971 | |
1963 | |
1972 | move_slow |= tmp->move_slow; |
1964 | move_slow |= tmp->move_slow; |
1973 | move_block |= tmp->move_block; |
1965 | move_block |= tmp->move_block; |
1974 | move_on |= tmp->move_on; |
1966 | move_on |= tmp->move_on; |
1975 | move_off |= tmp->move_off; |
1967 | move_off |= tmp->move_off; |
1976 | move_allow |= tmp->move_allow; |
1968 | move_allow |= tmp->move_allow; |
1977 | |
1969 | |
1978 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) |
|
|
1979 | flags |= P_IS_ALIVE; |
|
|
1980 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) |
|
|
1981 | flags |= P_NO_MAGIC; |
|
|
1982 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) |
|
|
1983 | flags |= P_NO_CLERIC; |
|
|
1984 | if (tmp->type == SAFE_GROUND) |
|
|
1985 | flags |= P_SAFE; |
|
|
1986 | |
|
|
1987 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) |
1970 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; |
1988 | flags |= P_BLOCKSVIEW; |
1971 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; |
1989 | } /* for stack of objects */ |
1972 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1990 | |
1973 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1991 | /* we don't want to rely on this function to have accurate flags, but |
1974 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1992 | * since we're already doing the work, we calculate them here. |
1975 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1993 | * if they don't match, logic is broken someplace. |
|
|
1994 | */ |
|
|
1995 | if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR))) |
|
|
1996 | { |
1976 | } |
1997 | LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", |
1977 | |
1998 | m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags); |
1978 | this->light = light; |
1999 | } |
1979 | this->flags_ = flags; |
2000 | SET_MAP_FLAGS (m, x, y, flags); |
1980 | this->move_block = move_block & ~move_allow; |
2001 | SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow); |
1981 | this->move_on = move_on; |
2002 | SET_MAP_MOVE_ON (m, x, y, move_on); |
1982 | this->move_off = move_off; |
2003 | SET_MAP_MOVE_OFF (m, x, y, move_off); |
1983 | this->move_slow = move_slow; |
2004 | SET_MAP_MOVE_SLOW (m, x, y, move_slow); |
|
|
2005 | |
1984 | |
2006 | /* At this point, we have a floor face (if there is a floor), |
1985 | /* At this point, we have a floor face (if there is a floor), |
2007 | * and the floor is set - we are not going to touch it at |
1986 | * and the floor is set - we are not going to touch it at |
2008 | * this point. |
1987 | * this point. |
2009 | * middle contains the highest visibility face. |
1988 | * middle contains the highest visibility face. |
… | |
… | |
2063 | break; |
2042 | break; |
2064 | } |
2043 | } |
2065 | } |
2044 | } |
2066 | } |
2045 | } |
2067 | } |
2046 | } |
|
|
2047 | |
2068 | if (middle == floor) |
2048 | if (middle == floor) |
2069 | middle = blank_face; |
2049 | middle = blank_face; |
|
|
2050 | |
2070 | if (top == middle) |
2051 | if (top == middle) |
2071 | middle = blank_face; |
2052 | middle = blank_face; |
2072 | SET_MAP_FACE (m, x, y, top, 0); |
|
|
2073 | if (top != blank_face) |
|
|
2074 | SET_MAP_FACE_OBJ (m, x, y, top_obj, 0); |
|
|
2075 | else |
|
|
2076 | SET_MAP_FACE_OBJ (m, x, y, NULL, 0); |
|
|
2077 | SET_MAP_FACE (m, x, y, middle, 1); |
|
|
2078 | if (middle != blank_face) |
|
|
2079 | SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1); |
|
|
2080 | else |
|
|
2081 | SET_MAP_FACE_OBJ (m, x, y, NULL, 1); |
|
|
2082 | SET_MAP_FACE (m, x, y, floor, 2); |
|
|
2083 | if (floor != blank_face) |
|
|
2084 | SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2); |
|
|
2085 | else |
|
|
2086 | SET_MAP_FACE_OBJ (m, x, y, NULL, 2); |
|
|
2087 | SET_MAP_LIGHT (m, x, y, light); |
|
|
2088 | } |
|
|
2089 | |
2053 | |
|
|
2054 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
|
|
2055 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
|
|
2056 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
|
|
2057 | } |
2090 | |
2058 | |
2091 | void |
2059 | void |
2092 | set_map_reset_time (maptile *map) |
2060 | set_map_reset_time (maptile *map) |
2093 | { |
2061 | { |
2094 | int timeout; |
2062 | int timeout; |
… | |
… | |
2096 | timeout = MAP_RESET_TIMEOUT (map); |
2064 | timeout = MAP_RESET_TIMEOUT (map); |
2097 | if (timeout <= 0) |
2065 | if (timeout <= 0) |
2098 | timeout = MAP_DEFAULTRESET; |
2066 | timeout = MAP_DEFAULTRESET; |
2099 | if (timeout >= MAP_MAXRESET) |
2067 | if (timeout >= MAP_MAXRESET) |
2100 | timeout = MAP_MAXRESET; |
2068 | timeout = MAP_MAXRESET; |
2101 | MAP_WHEN_RESET (map) = seconds () + timeout; |
2069 | MAP_WHEN_RESET (map) = time (0) + timeout; |
2102 | } |
2070 | } |
2103 | |
2071 | |
2104 | /* this updates the orig_map->tile_map[tile_num] value after loading |
2072 | /* this updates the orig_map->tile_map[tile_num] value after loading |
2105 | * the map. It also takes care of linking back the freshly loaded |
2073 | * the map. It also takes care of linking back the freshly loaded |
2106 | * maps tile_map values if it tiles back to this one. It returns |
2074 | * maps tile_map values if it tiles back to this one. It returns |
… | |
… | |
2134 | * |
2102 | * |
2135 | */ |
2103 | */ |
2136 | int |
2104 | int |
2137 | out_of_map (maptile *m, int x, int y) |
2105 | out_of_map (maptile *m, int x, int y) |
2138 | { |
2106 | { |
2139 | |
|
|
2140 | /* If we get passed a null map, this is obviously the |
2107 | /* If we get passed a null map, this is obviously the |
2141 | * case. This generally shouldn't happen, but if the |
2108 | * case. This generally shouldn't happen, but if the |
2142 | * map loads fail below, it could happen. |
2109 | * map loads fail below, it could happen. |
2143 | */ |
2110 | */ |
2144 | if (!m) |
2111 | if (!m) |
… | |
… | |
2146 | |
2113 | |
2147 | if (x < 0) |
2114 | if (x < 0) |
2148 | { |
2115 | { |
2149 | if (!m->tile_path[3]) |
2116 | if (!m->tile_path[3]) |
2150 | return 1; |
2117 | return 1; |
|
|
2118 | |
2151 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2119 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2152 | { |
|
|
2153 | load_and_link_tiled_map (m, 3); |
2120 | load_and_link_tiled_map (m, 3); |
2154 | } |
2121 | |
2155 | return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); |
2122 | return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y)); |
2156 | } |
2123 | } |
|
|
2124 | |
2157 | if (x >= MAP_WIDTH (m)) |
2125 | if (x >= MAP_WIDTH (m)) |
2158 | { |
2126 | { |
2159 | if (!m->tile_path[1]) |
2127 | if (!m->tile_path[1]) |
2160 | return 1; |
2128 | return 1; |
|
|
2129 | |
2161 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2130 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2162 | { |
|
|
2163 | load_and_link_tiled_map (m, 1); |
2131 | load_and_link_tiled_map (m, 1); |
2164 | } |
2132 | |
2165 | return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); |
2133 | return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); |
2166 | } |
2134 | } |
|
|
2135 | |
2167 | if (y < 0) |
2136 | if (y < 0) |
2168 | { |
2137 | { |
2169 | if (!m->tile_path[0]) |
2138 | if (!m->tile_path[0]) |
2170 | return 1; |
2139 | return 1; |
|
|
2140 | |
2171 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2141 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2172 | { |
|
|
2173 | load_and_link_tiled_map (m, 0); |
2142 | load_and_link_tiled_map (m, 0); |
2174 | } |
2143 | |
2175 | return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); |
2144 | return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0]))); |
2176 | } |
2145 | } |
|
|
2146 | |
2177 | if (y >= MAP_HEIGHT (m)) |
2147 | if (y >= MAP_HEIGHT (m)) |
2178 | { |
2148 | { |
2179 | if (!m->tile_path[2]) |
2149 | if (!m->tile_path[2]) |
2180 | return 1; |
2150 | return 1; |
|
|
2151 | |
2181 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2152 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2182 | { |
|
|
2183 | load_and_link_tiled_map (m, 2); |
2153 | load_and_link_tiled_map (m, 2); |
2184 | } |
2154 | |
2185 | return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); |
2155 | return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m))); |
2186 | } |
2156 | } |
2187 | |
2157 | |
2188 | /* Simple case - coordinates are within this local |
2158 | /* Simple case - coordinates are within this local |
2189 | * map. |
2159 | * map. |
… | |
… | |
2204 | { |
2174 | { |
2205 | |
2175 | |
2206 | if (*x < 0) |
2176 | if (*x < 0) |
2207 | { |
2177 | { |
2208 | if (!m->tile_path[3]) |
2178 | if (!m->tile_path[3]) |
2209 | return NULL; |
2179 | return 0; |
2210 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2180 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
2211 | load_and_link_tiled_map (m, 3); |
2181 | load_and_link_tiled_map (m, 3); |
2212 | |
2182 | |
2213 | *x += MAP_WIDTH (m->tile_map[3]); |
2183 | *x += MAP_WIDTH (m->tile_map[3]); |
2214 | return (get_map_from_coord (m->tile_map[3], x, y)); |
2184 | return (get_map_from_coord (m->tile_map[3], x, y)); |
2215 | } |
2185 | } |
|
|
2186 | |
2216 | if (*x >= MAP_WIDTH (m)) |
2187 | if (*x >= MAP_WIDTH (m)) |
2217 | { |
2188 | { |
2218 | if (!m->tile_path[1]) |
2189 | if (!m->tile_path[1]) |
2219 | return NULL; |
2190 | return 0; |
|
|
2191 | |
2220 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2192 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
2221 | load_and_link_tiled_map (m, 1); |
2193 | load_and_link_tiled_map (m, 1); |
2222 | |
2194 | |
2223 | *x -= MAP_WIDTH (m); |
2195 | *x -= MAP_WIDTH (m); |
2224 | return (get_map_from_coord (m->tile_map[1], x, y)); |
2196 | return (get_map_from_coord (m->tile_map[1], x, y)); |
2225 | } |
2197 | } |
|
|
2198 | |
2226 | if (*y < 0) |
2199 | if (*y < 0) |
2227 | { |
2200 | { |
2228 | if (!m->tile_path[0]) |
2201 | if (!m->tile_path[0]) |
2229 | return NULL; |
2202 | return 0; |
|
|
2203 | |
2230 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2204 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
2231 | load_and_link_tiled_map (m, 0); |
2205 | load_and_link_tiled_map (m, 0); |
2232 | |
2206 | |
2233 | *y += MAP_HEIGHT (m->tile_map[0]); |
2207 | *y += MAP_HEIGHT (m->tile_map[0]); |
2234 | return (get_map_from_coord (m->tile_map[0], x, y)); |
2208 | return (get_map_from_coord (m->tile_map[0], x, y)); |
2235 | } |
2209 | } |
|
|
2210 | |
2236 | if (*y >= MAP_HEIGHT (m)) |
2211 | if (*y >= MAP_HEIGHT (m)) |
2237 | { |
2212 | { |
2238 | if (!m->tile_path[2]) |
2213 | if (!m->tile_path[2]) |
2239 | return NULL; |
2214 | return 0; |
|
|
2215 | |
2240 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2216 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
2241 | load_and_link_tiled_map (m, 2); |
2217 | load_and_link_tiled_map (m, 2); |
2242 | |
2218 | |
2243 | *y -= MAP_HEIGHT (m); |
2219 | *y -= MAP_HEIGHT (m); |
2244 | return (get_map_from_coord (m->tile_map[2], x, y)); |
2220 | return (get_map_from_coord (m->tile_map[2], x, y)); |