ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.79 by root, Sat Jan 20 22:09:51 2007 UTC vs.
Revision 1.85 by root, Wed Feb 7 23:50:01 2007 UTC

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.
568maptile::maptile () 569maptile::maptile ()
569{ 570{
570 in_memory = MAP_SWAPPED; 571 in_memory = MAP_SWAPPED;
571 572
572 /* The maps used to pick up default x and y values from the 573 /* The maps used to pick up default x and y values from the
573 * map archetype. Mimic that behaviour. 574 * map archetype. Mimic that behaviour.
574 */ 575 */
575 width = 16; 576 width = 16;
576 height = 16; 577 height = 16;
577 reset_timeout = 0;
578 timeout = 300; 578 timeout = 300;
579 enter_x = 0; 579 max_nrof = 1000; // 1000 items of anything
580 enter_y = 0; 580 max_volume = 2000000; // 2m³
581} 581}
582 582
583maptile::maptile (int w, int h) 583maptile::maptile (int w, int h)
584{ 584{
585 in_memory = MAP_SWAPPED; 585 in_memory = MAP_SWAPPED;
739 { 739 {
740 keyword kw = thawer.get_kv (); 740 keyword kw = thawer.get_kv ();
741 741
742 switch (kw) 742 switch (kw)
743 { 743 {
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: 744 case KW_msg:
757 thawer.get_ml (KW_endmsg, msg); 745 thawer.get_ml (KW_endmsg, msg);
758 break; 746 break;
759 747
760 case KW_lore: // CF+ extension 748 case KW_lore: // CF+ extension
792 case KW_sky: thawer.get (sky); break; 780 case KW_sky: thawer.get (sky); break;
793 781
794 case KW_per_player: thawer.get (per_player); break; 782 case KW_per_player: thawer.get (per_player); break;
795 case KW_per_party: thawer.get (per_party); break; 783 case KW_per_party: thawer.get (per_party); break;
796 784
797 case KW_region: get_region_by_name (thawer.get_str ()); break; 785 case KW_region: default_region = region::find (thawer.get_str ()); break;
798 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 786 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
799 787
800 // old names new names 788 // old names new names
801 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 789 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; 790 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
810 798
811 case KW_tile_path_1: thawer.get (tile_path [0]); break; 799 case KW_tile_path_1: thawer.get (tile_path [0]); break;
812 case KW_tile_path_2: thawer.get (tile_path [1]); break; 800 case KW_tile_path_2: thawer.get (tile_path [1]); break;
813 case KW_tile_path_3: thawer.get (tile_path [2]); break; 801 case KW_tile_path_3: thawer.get (tile_path [2]); break;
814 case KW_tile_path_4: thawer.get (tile_path [3]); break; 802 case KW_tile_path_4: thawer.get (tile_path [3]); break;
803
804 case KW_end:
805 return true;
806
807 default:
808 if (!thawer.parse_error (kw, "map", 0))
809 return false;
810 break;
815 } 811 }
816 } 812 }
817 813
818 abort (); 814 abort ();
819} 815}
871 MAP_OUT (reset_time); 867 MAP_OUT (reset_time);
872 MAP_OUT (reset_timeout); 868 MAP_OUT (reset_timeout);
873 MAP_OUT (fixed_resettime); 869 MAP_OUT (fixed_resettime);
874 MAP_OUT (difficulty); 870 MAP_OUT (difficulty);
875 871
876 if (region) MAP_OUT2 (region, region->name); 872 if (default_region) MAP_OUT2 (region, default_region->name);
877 873
878 if (shopitems) 874 if (shopitems)
879 { 875 {
880 char shop[MAX_BUF]; 876 char shop[MAX_BUF];
881 print_shop_string (this, shop); 877 print_shop_string (this, shop);
932 * Remove and free all objects in the given map. 928 * Remove and free all objects in the given map.
933 */ 929 */
934void 930void
935maptile::clear () 931maptile::clear ()
936{ 932{
933 sfree (regions, size ()), regions = 0;
934 free (regionmap), regionmap = 0;
935
937 if (!spaces) 936 if (spaces)
938 return; 937 {
939
940 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 938 for (mapspace *ms = spaces + size (); ms-- > spaces; )
941 while (object *op = ms->bot) 939 while (object *op = ms->bot)
942 { 940 {
943 if (op->head) 941 if (op->head)
944 op = op->head; 942 op = op->head;
945 943
946 op->destroy_inv (false); 944 op->destroy_inv (false);
947 op->destroy (); 945 op->destroy ();
948 } 946 }
949 947
950 sfree (spaces, size ()), spaces = 0; 948 sfree (spaces, size ()), spaces = 0;
949 }
951 950
952 if (buttons) 951 if (buttons)
953 free_objectlinkpt (buttons), buttons = 0; 952 free_objectlinkpt (buttons), buttons = 0;
954} 953}
955 954
1277 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1276 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; 1277 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; 1278 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1280} 1279}
1281 1280
1281uint64
1282mapspace::volume () const
1283{
1284 uint64 vol = 0;
1285
1286 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1287 vol += op->volume ();
1288
1289 return vol;
1290}
1291
1282/* this updates the orig_map->tile_map[tile_num] value after finding 1292/* 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 1293 * 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 1294 * maps tile_map values if it tiles back to this one. It returns
1285 * the value of orig_map->tile_map[tile_num]. 1295 * the value of orig_map->tile_map[tile_num].
1286 */ 1296 */
1449 1459
1450/** 1460/**
1451 * Return whether map2 is adjacent to map1. If so, store the distance from 1461 * Return whether map2 is adjacent to map1. If so, store the distance from
1452 * map1 to map2 in dx/dy. 1462 * map1 to map2 in dx/dy.
1453 */ 1463 */
1454static int 1464int
1455adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1465adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1456{ 1466{
1457 if (!map1 || !map2) 1467 if (!map1 || !map2)
1458 return 0; 1468 return 0;
1459 1469
1631 * flags has no meaning for this function at this time - I kept it in to 1641 * 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 1642 * 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 1643 * for something in the future. Also, since no object is pasted, the best
1634 * field of the rv_vector is set to NULL. 1644 * field of the rv_vector is set to NULL.
1635 */ 1645 */
1636
1637void 1646void
1638get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1647get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1639{ 1648{
1640 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1649 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1641 { 1650 {
1642 /* be conservative and fill in _some_ data */ 1651 /* be conservative and fill in _some_ data */
1643 retval->distance = 100000; 1652 retval->distance = 100000;
1680 op->remove (); 1689 op->remove ();
1681 1690
1682 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1691 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1683} 1692}
1684 1693
1694region *
1695maptile::region (int x, int y) const
1696{
1697 if (regions
1698 && regionmap
1699 && !OUT_OF_REAL_MAP (this, x, y))
1700 if (struct region *reg = regionmap [regions [y * width + x]])
1701 return reg;
1702
1703 if (default_region)
1704 return default_region;
1705
1706 return ::region::default_region ();
1707}
1708
1709

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines