… | |
… | |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
|
|
26 | #include <funcpoint.h> |
|
|
27 | |
|
|
28 | #include <loader.h> |
|
|
29 | #include <unistd.h> |
25 | #include <unistd.h> |
|
|
26 | |
|
|
27 | #include "global.h" |
|
|
28 | #include "funcpoint.h" |
|
|
29 | |
|
|
30 | #include "loader.h" |
30 | |
31 | |
31 | #include "path.h" |
32 | #include "path.h" |
32 | |
33 | |
33 | /* |
34 | /* |
34 | * This makes a path absolute outside the world of Crossfire. |
35 | * This makes a path absolute outside the world of Crossfire. |
… | |
… | |
67 | char *endbuf; |
68 | char *endbuf; |
68 | struct stat statbuf; |
69 | struct stat statbuf; |
69 | int mode = 0; |
70 | int mode = 0; |
70 | |
71 | |
71 | if (prepend_dir) |
72 | if (prepend_dir) |
72 | strcpy (buf, create_pathname (name)); |
73 | assign (buf, create_pathname (name)); |
73 | else |
74 | else |
74 | strcpy (buf, name); |
75 | assign (buf, name); |
75 | |
76 | |
76 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
77 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
77 | * this method should be equivalant and is clearer. |
78 | * this method should be equivalant and is clearer. |
78 | * Can not use strcat because we need to cycle through |
79 | * Can not use strcat because we need to cycle through |
79 | * all the names. |
80 | * all the names. |
… | |
… | |
396 | } |
397 | } |
397 | |
398 | |
398 | /* |
399 | /* |
399 | * Loads (ands parses) the objects into a given map from the specified |
400 | * Loads (ands parses) the objects into a given map from the specified |
400 | * file pointer. |
401 | * file pointer. |
401 | * mapflags is the same as we get with load_original_map |
|
|
402 | */ |
402 | */ |
403 | bool |
403 | bool |
404 | maptile::_load_objects (object_thawer &thawer) |
404 | maptile::_load_objects (object_thawer &f) |
405 | { |
405 | { |
406 | int unique; |
406 | for (;;) |
407 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
|
|
408 | |
|
|
409 | op = object::create (); |
|
|
410 | op->map = this; /* To handle buttons correctly */ |
|
|
411 | |
|
|
412 | while (int i = load_object (thawer, op, 0)) |
|
|
413 | { |
407 | { |
414 | /* if the archetype for the object is null, means that we |
408 | coroapi::cede_every (1000); // cede once in a while |
415 | * got an invalid object. Don't do anything with it - the game |
409 | |
416 | * or editor will not be able to do anything with it either. |
410 | switch (f.kw) |
417 | */ |
|
|
418 | if (op->arch == NULL) |
|
|
419 | { |
411 | { |
420 | LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); |
412 | case KW_arch: |
421 | continue; |
413 | if (object *op = object::read (f)) |
422 | } |
|
|
423 | |
|
|
424 | switch (i) |
|
|
425 | { |
414 | { |
426 | case LL_NORMAL: |
415 | if (op->inv) |
|
|
416 | sum_weight (op); |
|
|
417 | |
427 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
418 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
|
|
419 | } |
428 | |
420 | |
429 | if (op->inv) |
421 | continue; |
430 | sum_weight (op); |
|
|
431 | |
422 | |
432 | prev = op, last_more = op; |
|
|
433 | break; |
|
|
434 | |
|
|
435 | case LL_MORE: |
423 | case KW_EOF: |
436 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); |
424 | return true; |
437 | op->head = prev, last_more->more = op, last_more = op; |
425 | |
|
|
426 | default: |
|
|
427 | if (!f.parse_error ("map file")) |
|
|
428 | return false; |
438 | break; |
429 | break; |
439 | } |
430 | } |
440 | |
431 | |
441 | op = object::create (); |
432 | f.next (); |
442 | op->map = this; |
|
|
443 | } |
|
|
444 | |
|
|
445 | op->destroy (); |
|
|
446 | |
|
|
447 | #if 0 |
|
|
448 | for (i = 0; i < width; i++) |
|
|
449 | for (j = 0; j < height; j++) |
|
|
450 | { |
|
|
451 | unique = 0; |
|
|
452 | /* check for unique items, or unique squares */ |
|
|
453 | for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) |
|
|
454 | { |
|
|
455 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
|
|
456 | unique = 1; |
|
|
457 | |
|
|
458 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
|
|
459 | SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); |
|
|
460 | } |
|
|
461 | } |
433 | } |
462 | #endif |
|
|
463 | |
434 | |
464 | return true; |
435 | return true; |
465 | } |
436 | } |
466 | |
437 | |
467 | void |
438 | void |
… | |
… | |
485 | for (object *op = ms->bot; op; op = op->above) |
456 | for (object *op = ms->bot; op; op = op->above) |
486 | op->deactivate_recursive (); |
457 | op->deactivate_recursive (); |
487 | } |
458 | } |
488 | |
459 | |
489 | bool |
460 | bool |
490 | maptile::_save_objects (object_freezer &freezer, int flags) |
461 | maptile::_save_objects (object_freezer &f, int flags) |
491 | { |
462 | { |
492 | static int cede_count = 0; |
463 | static int cede_count = 0; |
493 | |
464 | |
494 | if (flags & IO_HEADER) |
465 | if (flags & IO_HEADER) |
495 | _save_header (freezer); |
466 | _save_header (f); |
496 | |
467 | |
497 | if (!spaces) |
468 | if (!spaces) |
498 | return false; |
469 | return false; |
499 | |
470 | |
500 | for (int i = 0; i < size (); ++i) |
471 | for (int i = 0; i < size (); ++i) |
… | |
… | |
520 | continue; |
491 | continue; |
521 | |
492 | |
522 | if (unique || op->flag [FLAG_UNIQUE]) |
493 | if (unique || op->flag [FLAG_UNIQUE]) |
523 | { |
494 | { |
524 | if (flags & IO_UNIQUES) |
495 | if (flags & IO_UNIQUES) |
525 | save_object (freezer, op, 1); |
496 | op->write (f); |
526 | } |
497 | } |
527 | else if (flags & IO_OBJECTS) |
498 | else if (flags & IO_OBJECTS) |
528 | save_object (freezer, op, 1); |
499 | op->write (f); |
529 | } |
500 | } |
530 | } |
501 | } |
531 | |
502 | |
532 | return true; |
503 | return true; |
533 | } |
504 | } |
534 | |
505 | |
535 | bool |
506 | bool |
536 | maptile::_load_objects (const char *path, bool skip_header) |
507 | maptile::_load_objects (const char *path, bool skip_header) |
537 | { |
508 | { |
538 | object_thawer thawer (path); |
509 | object_thawer f (path); |
539 | |
510 | |
540 | if (!thawer) |
511 | if (!f) |
541 | return false; |
512 | return false; |
|
|
513 | |
|
|
514 | f.next (); |
542 | |
515 | |
543 | if (skip_header) |
516 | if (skip_header) |
544 | for (;;) |
517 | for (;;) |
545 | { |
518 | { |
546 | keyword kw = thawer.get_kv (); |
519 | keyword kw = f.kw; |
547 | |
520 | f.skip (); |
548 | if (kw == KW_end) |
521 | if (kw == KW_end) |
549 | break; |
522 | break; |
550 | |
|
|
551 | thawer.skip_kv (kw); |
|
|
552 | } |
523 | } |
553 | |
524 | |
554 | return _load_objects (thawer); |
525 | return _load_objects (f); |
555 | } |
526 | } |
556 | |
527 | |
557 | bool |
528 | bool |
558 | maptile::_save_objects (const char *path, int flags) |
529 | maptile::_save_objects (const char *path, int flags) |
559 | { |
530 | { |
… | |
… | |
568 | maptile::maptile () |
539 | maptile::maptile () |
569 | { |
540 | { |
570 | in_memory = MAP_SWAPPED; |
541 | in_memory = MAP_SWAPPED; |
571 | |
542 | |
572 | /* The maps used to pick up default x and y values from the |
543 | /* The maps used to pick up default x and y values from the |
573 | * map archetype. Mimic that behaviour. |
544 | * map archetype. Mimic that behaviour. |
574 | */ |
545 | */ |
575 | width = 16; |
546 | width = 16; |
576 | height = 16; |
547 | height = 16; |
577 | reset_timeout = 0; |
|
|
578 | timeout = 300; |
548 | timeout = 300; |
579 | enter_x = 0; |
549 | max_nrof = 1000; // 1000 items of anything |
580 | enter_y = 0; |
550 | max_volume = 2000000; // 2m³ |
581 | } |
551 | } |
582 | |
552 | |
583 | maptile::maptile (int w, int h) |
553 | maptile::maptile (int w, int h) |
584 | { |
554 | { |
585 | in_memory = MAP_SWAPPED; |
555 | in_memory = MAP_SWAPPED; |
… | |
… | |
739 | { |
709 | { |
740 | keyword kw = thawer.get_kv (); |
710 | keyword kw = thawer.get_kv (); |
741 | |
711 | |
742 | switch (kw) |
712 | switch (kw) |
743 | { |
713 | { |
744 | case KW_EOF: |
|
|
745 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
|
|
746 | return false; |
|
|
747 | |
|
|
748 | case KW_end: |
|
|
749 | return true; |
|
|
750 | |
|
|
751 | default: |
|
|
752 | case KW_ERROR: |
|
|
753 | LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword); |
|
|
754 | break; |
|
|
755 | |
|
|
756 | case KW_msg: |
714 | case KW_msg: |
757 | thawer.get_ml (KW_endmsg, msg); |
715 | thawer.get_ml (KW_endmsg, msg); |
758 | break; |
716 | break; |
759 | |
717 | |
760 | case KW_lore: // CF+ extension |
718 | case KW_lore: // CF+ extension |
… | |
… | |
792 | case KW_sky: thawer.get (sky); break; |
750 | case KW_sky: thawer.get (sky); break; |
793 | |
751 | |
794 | case KW_per_player: thawer.get (per_player); break; |
752 | case KW_per_player: thawer.get (per_player); break; |
795 | case KW_per_party: thawer.get (per_party); break; |
753 | case KW_per_party: thawer.get (per_party); break; |
796 | |
754 | |
797 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
755 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
798 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
756 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
799 | |
757 | |
800 | // old names new names |
758 | // old names new names |
801 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
759 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
802 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
760 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
810 | |
768 | |
811 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
769 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
812 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
770 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
813 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
771 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
814 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
772 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
|
|
773 | |
|
|
774 | case KW_end: |
|
|
775 | return true; |
|
|
776 | |
|
|
777 | default: |
|
|
778 | if (!thawer.parse_error ("map", 0)) |
|
|
779 | return false; |
|
|
780 | break; |
815 | } |
781 | } |
816 | } |
782 | } |
817 | |
783 | |
818 | abort (); |
784 | abort (); |
819 | } |
785 | } |
… | |
… | |
871 | MAP_OUT (reset_time); |
837 | MAP_OUT (reset_time); |
872 | MAP_OUT (reset_timeout); |
838 | MAP_OUT (reset_timeout); |
873 | MAP_OUT (fixed_resettime); |
839 | MAP_OUT (fixed_resettime); |
874 | MAP_OUT (difficulty); |
840 | MAP_OUT (difficulty); |
875 | |
841 | |
876 | if (region) MAP_OUT2 (region, region->name); |
842 | if (default_region) MAP_OUT2 (region, default_region->name); |
877 | |
843 | |
878 | if (shopitems) |
844 | if (shopitems) |
879 | { |
845 | { |
880 | char shop[MAX_BUF]; |
846 | char shop[MAX_BUF]; |
881 | print_shop_string (this, shop); |
847 | print_shop_string (this, shop); |
… | |
… | |
932 | * Remove and free all objects in the given map. |
898 | * Remove and free all objects in the given map. |
933 | */ |
899 | */ |
934 | void |
900 | void |
935 | maptile::clear () |
901 | maptile::clear () |
936 | { |
902 | { |
|
|
903 | sfree (regions, size ()), regions = 0; |
|
|
904 | free (regionmap), regionmap = 0; |
|
|
905 | |
937 | if (!spaces) |
906 | if (spaces) |
938 | return; |
907 | { |
939 | |
|
|
940 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
908 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
941 | while (object *op = ms->bot) |
909 | while (object *op = ms->bot) |
942 | { |
910 | { |
943 | if (op->head) |
911 | if (op->head) |
944 | op = op->head; |
912 | op = op->head; |
945 | |
913 | |
946 | op->destroy_inv (false); |
914 | op->destroy_inv (false); |
947 | op->destroy (); |
915 | op->destroy (); |
948 | } |
916 | } |
949 | |
917 | |
950 | sfree (spaces, size ()), spaces = 0; |
918 | sfree (spaces, size ()), spaces = 0; |
|
|
919 | } |
951 | |
920 | |
952 | if (buttons) |
921 | if (buttons) |
953 | free_objectlinkpt (buttons), buttons = 0; |
922 | free_objectlinkpt (buttons), buttons = 0; |
954 | } |
923 | } |
955 | |
924 | |
… | |
… | |
1277 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1246 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1278 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1247 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1279 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1248 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1280 | } |
1249 | } |
1281 | |
1250 | |
|
|
1251 | uint64 |
|
|
1252 | mapspace::volume () const |
|
|
1253 | { |
|
|
1254 | uint64 vol = 0; |
|
|
1255 | |
|
|
1256 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1257 | vol += op->volume (); |
|
|
1258 | |
|
|
1259 | return vol; |
|
|
1260 | } |
|
|
1261 | |
1282 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1262 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1283 | * the map. It also takes care of linking back the freshly found |
1263 | * the map. It also takes care of linking back the freshly found |
1284 | * maps tile_map values if it tiles back to this one. It returns |
1264 | * maps tile_map values if it tiles back to this one. It returns |
1285 | * the value of orig_map->tile_map[tile_num]. |
1265 | * the value of orig_map->tile_map[tile_num]. |
1286 | */ |
1266 | */ |
… | |
… | |
1449 | |
1429 | |
1450 | /** |
1430 | /** |
1451 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1431 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1452 | * map1 to map2 in dx/dy. |
1432 | * map1 to map2 in dx/dy. |
1453 | */ |
1433 | */ |
1454 | static int |
1434 | int |
1455 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1435 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1456 | { |
1436 | { |
1457 | if (!map1 || !map2) |
1437 | if (!map1 || !map2) |
1458 | return 0; |
1438 | return 0; |
1459 | |
1439 | |
… | |
… | |
1571 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1551 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1572 | { |
1552 | { |
1573 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1553 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1574 | { |
1554 | { |
1575 | /* be conservative and fill in _some_ data */ |
1555 | /* be conservative and fill in _some_ data */ |
1576 | retval->distance = 100000; |
1556 | retval->distance = 10000; |
1577 | retval->distance_x = 32767; |
1557 | retval->distance_x = 10000; |
1578 | retval->distance_y = 32767; |
1558 | retval->distance_y = 10000; |
1579 | retval->direction = 0; |
1559 | retval->direction = 0; |
1580 | retval->part = 0; |
1560 | retval->part = 0; |
1581 | } |
1561 | } |
1582 | else |
1562 | else |
1583 | { |
1563 | { |
… | |
… | |
1588 | |
1568 | |
1589 | best = op1; |
1569 | best = op1; |
1590 | /* If this is multipart, find the closest part now */ |
1570 | /* If this is multipart, find the closest part now */ |
1591 | if (!(flags & 0x1) && op1->more) |
1571 | if (!(flags & 0x1) && op1->more) |
1592 | { |
1572 | { |
1593 | object *tmp; |
|
|
1594 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1573 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1595 | |
1574 | |
1596 | /* we just take the offset of the piece to head to figure |
1575 | /* we just take the offset of the piece to head to figure |
1597 | * distance instead of doing all that work above again |
1576 | * distance instead of doing all that work above again |
1598 | * since the distance fields we set above are positive in the |
1577 | * since the distance fields we set above are positive in the |
1599 | * same axis as is used for multipart objects, the simply arithmetic |
1578 | * same axis as is used for multipart objects, the simply arithmetic |
1600 | * below works. |
1579 | * below works. |
1601 | */ |
1580 | */ |
1602 | for (tmp = op1->more; tmp != NULL; tmp = tmp->more) |
1581 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1603 | { |
1582 | { |
1604 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1583 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1605 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1584 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1606 | if (tmpi < best_distance) |
1585 | if (tmpi < best_distance) |
1607 | { |
1586 | { |
… | |
… | |
1616 | retval->distance_y += op1->y - best->y; |
1595 | retval->distance_y += op1->y - best->y; |
1617 | } |
1596 | } |
1618 | } |
1597 | } |
1619 | |
1598 | |
1620 | retval->part = best; |
1599 | retval->part = best; |
1621 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1600 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1622 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1601 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1623 | } |
1602 | } |
1624 | } |
1603 | } |
1625 | |
1604 | |
1626 | /* this is basically the same as get_rangevector above, but instead of |
1605 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1631 | * flags has no meaning for this function at this time - I kept it in to |
1610 | * flags has no meaning for this function at this time - I kept it in to |
1632 | * be more consistant with the above function and also in case they are needed |
1611 | * be more consistant with the above function and also in case they are needed |
1633 | * for something in the future. Also, since no object is pasted, the best |
1612 | * for something in the future. Also, since no object is pasted, the best |
1634 | * field of the rv_vector is set to NULL. |
1613 | * field of the rv_vector is set to NULL. |
1635 | */ |
1614 | */ |
1636 | |
|
|
1637 | void |
1615 | void |
1638 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
1616 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1639 | { |
1617 | { |
1640 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1618 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1641 | { |
1619 | { |
1642 | /* be conservative and fill in _some_ data */ |
1620 | /* be conservative and fill in _some_ data */ |
1643 | retval->distance = 100000; |
1621 | retval->distance = 100000; |
… | |
… | |
1680 | op->remove (); |
1658 | op->remove (); |
1681 | |
1659 | |
1682 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1660 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1683 | } |
1661 | } |
1684 | |
1662 | |
|
|
1663 | region * |
|
|
1664 | maptile::region (int x, int y) const |
|
|
1665 | { |
|
|
1666 | if (regions |
|
|
1667 | && regionmap |
|
|
1668 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1669 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1670 | return reg; |
|
|
1671 | |
|
|
1672 | if (default_region) |
|
|
1673 | return default_region; |
|
|
1674 | |
|
|
1675 | return ::region::default_region (); |
|
|
1676 | } |
|
|
1677 | |
|
|
1678 | |