server/include/map.h

/*
 * static char *rcsid_define_h =
 *   "$Id$";
 */

/*
    CrossFire, A Multiplayer game for X-windows

    Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team
    Copyright (C) 1992 Frank Tore Johansen

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

    The authors can be reached via e-mail at crossfire-devel@real-time.com
*/

/*
 * The mapstruct is allocated each time a new map is opened.
 * It contains pointers (very indirectly) to all objects on the map.
 */

#ifndef MAP_H
#define MAP_H

/* We set this size - this is to make magic map work properly on
 * tiled maps.  There is no requirement that this matches the
 * tiled maps size - it just seemed like a reasonable value.
 * Magic map code now always starts out putting the player in the
 * center of the map - this makes the most sense when dealing
 * with tiled maps.
 * We also figure out the magicmap color to use as we process the
 * spaces - this is more efficient as we already have up to date
 * map pointers.
 */
#define MAGIC_MAP_SIZE  50
#define MAGIC_MAP_HALF  MAGIC_MAP_SIZE/2


#define MAP_LAYERS              4

/* This is when the map will reset */
#define MAP_WHEN_RESET(m)       ((m)->reset_time)

#define MAP_RESET_TIMEOUT(m)    ((m)->reset_timeout)
#define MAP_DIFFICULTY(m)       ((m)->difficulty)
#define MAP_TIMEOUT(m)          ((m)->timeout)
#define MAP_SWAP_TIME(m)        ((m)->swap_time)
#define MAP_OUTDOORS(m)         ((m)->outdoor)

/* mape darkness used to enforce the MAX_DARKNESS value.
 * but IMO, if it is beyond max value, that should be fixed
 * on the map or in the code.
 */
#define MAP_DARKNESS(m)         (m)->darkness

#define MAP_WIDTH(m)            (m)->width
#define MAP_HEIGHT(m)           (m)->height
/* Convenient function - total number of spaces is used
 * in many places.
 */
#define MAP_SIZE(m)             ((m)->width * (m)->height)

#define MAP_ENTER_X(m)          (m)->enter_x
#define MAP_ENTER_Y(m)          (m)->enter_y

#define MAP_TEMP(m)             (m)->temp
#define MAP_PRESSURE(m)         (m)->pressure
#define MAP_HUMID(m)            (m)->humid
#define MAP_WINDSPEED(m)        (m)->windspeed
#define MAP_WINDDIRECTION(m)    (m)->winddir
#define MAP_SKYCOND(m)          (m)->sky
#define MAP_WORLDPARTX(m)       (m)->wpartx
#define MAP_WORLDPARTY(m)       (m)->wparty
#define MAP_NOSMOOTH(m)         (m)->nosmooth

/* options passed to ready_map_name and load_original_map */
#define MAP_FLUSH           0x1
#define MAP_PLAYER_UNIQUE   0x2
#define MAP_BLOCK           0x4
#define MAP_STYLE           0x8
#define MAP_OVERLAY         0x10

/* Values for in_memory below.  Should probably be an enumerations */
#define MAP_IN_MEMORY 1
#define MAP_SWAPPED 2
#define MAP_LOADING 3
#define MAP_SAVING 4

/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
 * really be used, as it is multi tile aware.  However, there are some cases
 * where it is known the map is not tiled or the values are known
 * consistent (eg, op->map, op->x, op->y)
 */
#define GET_MAP_FLAGS(M,X,Y)    ( (M)->spaces[(X) + (M)->width * (Y)].flags )
#define SET_MAP_FLAGS(M,X,Y,C)  ( (M)->spaces[(X) + (M)->width * (Y)].flags = C )
#define GET_MAP_LIGHT(M,X,Y)    ( (M)->spaces[(X) + (M)->width * (Y)].light )
#define SET_MAP_LIGHT(M,X,Y,L)  ( (M)->spaces[(X) + (M)->width * (Y)].light = L )

#define GET_MAP_OB(M,X,Y)       ( (M)->spaces[(X) + (M)->width * (Y)].bottom )
#define GET_MAP_TOP(M,X,Y)      ( (M)->spaces[(X) + (M)->width * (Y)].top )
/* legacy */
#define get_map_ob              GET_MAP_OB

#define SET_MAP_OB(M,X,Y,tmp)   ( (M)->spaces[(X) + (M)->width * (Y)].bottom = (tmp) )
#define SET_MAP_TOP(M,X,Y,tmp)  ( (M)->spaces[(X) + (M)->width * (Y)].top = (tmp) )
#define set_map_ob SET_MAP_OB

#define SET_MAP_FACE(M,X,Y,C,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces[L] = C )
#define GET_MAP_FACE(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces[L]  )

#define SET_MAP_FACE_OBJ(M,X,Y,C,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces_obj[L] = C )
#define GET_MAP_FACE_OBJ(M,X,Y,L)   ( (M)->spaces[(X) + (M)->width * (Y)].faces_obj[L]  )

#define GET_MAP_MOVE_BLOCK(M,X,Y)   ( (M)->spaces[(X) + (M)->width * (Y)].move_block )
#define SET_MAP_MOVE_BLOCK(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_block = C )

#define GET_MAP_MOVE_SLOW(M,X,Y)    ( (M)->spaces[(X) + (M)->width * (Y)].move_slow )
#define SET_MAP_MOVE_SLOW(M,X,Y,C)  ( (M)->spaces[(X) + (M)->width * (Y)].move_slow = C )

#define GET_MAP_MOVE_ON(M,X,Y)      ( (M)->spaces[(X) + (M)->width * (Y)].move_on )
#define SET_MAP_MOVE_ON(M,X,Y,C)    ( (M)->spaces[(X) + (M)->width * (Y)].move_on = C )

#define GET_MAP_MOVE_OFF(M,X,Y)      ( (M)->spaces[(X) + (M)->width * (Y)].move_off )
#define SET_MAP_MOVE_OFF(M,X,Y,C)    ( (M)->spaces[(X) + (M)->width * (Y)].move_off = C )

/* You should really know what you are doing before using this - you
 * should almost always be using out_of_map instead, which takes into account
 * map tiling.
 */
#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 || (Y)<0 || (X)>=(M)->width || (Y)>=(M)->height)

/* These are used in the MapLook flags element.  They are not used in
 * in the object flags structure.
 */

#define P_BLOCKSVIEW    0x01
#define P_NO_MAGIC      0x02    /* Spells (some) can't pass this object */

/* AB_NO_PASS is used for arch_blocked() return value.  It needs
 * to be here to make sure the bits don't match with anything.
 * Changed name to have AB_ prefix just to make sure no one
 * is using the P_NO_PASS.  AB_.. should only be used for
 * arch_blocked and functions that examine the return value.
 */

#define AB_NO_PASS       0x04
/*#define P_PASS_THRU     0x08  *//* */
#define P_IS_ALIVE      0x10    /* something alive is on this space */
#define P_NO_CLERIC     0x20    /* no clerical spells cast here */
#define P_NEED_UPDATE   0x40    /* this space is out of date */
#define P_NO_ERROR      0x80    /* Purely temporary - if set, update_position
                                 * does not complain if the flags are different.
                                 */
/* The following two values are not stored in the MapLook flags, but instead
 * used in the get_map_flags value - that function is used to return
 * the flag value, as well as other conditions - using a more general
 * function that does more of the work can hopefully be used to replace
 * lots of duplicate checks currently in the code.
 */
#define P_OUT_OF_MAP    0x100   /* This space is outside the map */
#define P_NEW_MAP       0x200   /* Coordinates passed result in a new tiled map  */
#define P_SAFE_MAP      0x400   /* If this is set the map is a safe map,
                                 * that means, nothing harmful there will be done,
                                 * like: bombs, potion usage, alchemy, spells
                                 * this was introduced to make shops more safe
                                 * and propably other maps */

#if 0
/* These go away with new movement code - can't do such simplistic
 * checks anymore
 */
#define P_BLOCKED       (P_NO_PASS | P_IS_ALIVE)    /* convenience macro */
#define P_WALL          P_NO_PASS   /* Just to match naming of wall function */
#endif

/* Can't use MapCell as that is used in newserver.h
 * Instead of having numerous arrays that have information on a
 * particular space (was map, floor, floor2, map_ob),
 * have this structure take care of that information.
 * This puts it all in one place, and should also make it easier
 * to extend information about a space.
 */

struct MapSpace {
    object      *bottom;        /* lowest object on this space */
    object      *top;           /* Highest object on this space */
    New_Face    *faces[MAP_LAYERS];     /* faces for the 3 layers */
    object      *faces_obj[MAP_LAYERS]; /* face objects for the 3 layers */
    uint8       flags;          /* flags about this space (see the P_ values above) */
    sint8       light;          /* How much light this space provides */
    MoveType    move_block;     /* What movement types this space blocks */
    MoveType    move_slow;      /* What movement types this space slows */
    MoveType    move_on;        /* What movement types are activated */
    MoveType    move_off;       /* What movement types are activated */
};

/*
 * this is an overlay structure of the whole world.  It exists as a simple
 * high level map, which doesn't contain the full data of the underlying map.
 * in this map, only things such as weather are recorded.  By doing so, we
 * can keep the entire world parameters in memory, and act as a whole on
 * them at once.  We can then, in a separate loop, update the actual world
 * with the new values we have assigned.
 */

struct weathermap_t {
    sint16      temp;           /* base temperature of this tile (F) */
    sint16      pressure;       /* barometric pressure (mb) */
    sint8       humid;          /* humitidy of this tile */
    sint8       windspeed;      /* windspeed of this tile */
    sint8       winddir;        /* direction of wind */
    sint8       sky;            /* sky conditions */
    sint32      avgelev;        /* average elevation */
    uint32      rainfall;       /* cumulative rainfall */
    uint8       darkness;       /* indicates level of darkness of map */
    uint8       water;          /* 0-100 percentage of water tiles */
        /*Dynamic parts*/
        sint16  realtemp;  /*  temperature at a given calculation step for this tile*/
};

/*
 * Each map is in a given region of the game world and links to a region definiton, so
 * they have to appear here in the headers, before the mapdef
 */
struct region {
    struct region *next;                /* pointer to next region, NULL for the last one */
    const char  *name;           /* Shortend name of the region as maps refer to it */
    const char  *parent_name;    /* 
                                  * So that parent and child regions can be defined in
                                  * any order, we keep hold of the parent_name during
                                  * initialisation, and the children get assigned to their
                                  * parents later. (before runtime on the server though)
                                  * nothing outside the init code should ever use this value.
                                  */
    struct region *parent;              /* 
                                  * Pointer to the region that is a parent of the current
                                  * region, if a value isn't defined in the current region
                                  * we traverse this series of pointers until it is.
                                  */
    const char  *longname;       /* Official title of the region, this might be defined
                                  * to be the same as name*/
    const char  *msg;            /* the description of the region */
    uint32      counter;         /* A generic counter for holding temporary data. */
    sint8       fallback;        /* whether, in the event of a region not existing,
                                  * this should be the one we fall back on as the default */
    char        *jailmap;        /*where a player that is arrested in this region should be imprisoned.*/
    sint16      jailx, jaily;    /* The coodinates in jailmap to which the player should be sent. */
};


struct shopitems {
    const char *name;     /* name of the item in question, null if it is the default item */
    const char *name_pl;  /* plural name */
    int typenum;    /* itemtype number we need to match 0 if it is the default price*/
    sint8 strength; /* the degree of specialisation the shop has in this item, 
                     * as a percentage from -100 to 100 */
    int index;      /* being the size of the shopitems array.*/
};

/* In general, code should always use the macros 
 * above (or functions in map.c) to access many of the 
 * values in the map structure.  Failure to do this will
 * almost certainly break various features.  You may think
 * it is safe to look at width and height values directly
 * (or even through the macros), but doing so will completely
 * break map tiling.
 */
struct mapstruct {
    struct mapstruct *next;     /* Next map, linked list */
    char *tmpname;      /* Name of temporary file */
    char *name;         /* Name of map as given by its creator */
    struct region *region;      /* What jurisdiction in the game world this map is ruled by 
                         * points to the struct containing all the properties of 
                         * the region */
    uint32 reset_time;  /* when this map should reset */
    uint32 reset_timeout;  /* How many seconds must elapse before this map
                            * should be reset
                            */
    uint32 fixed_resettime:1;   /* if true, reset time is not affected by
                                 * players entering/exiting map
                                 */
    uint32 unique:1;    /* if set, this is a per player unique map */
    uint32 safe_map:1;  /* if set, this map doesn't allow using magic or harmful stuff in any way */
    uint32 templatemap:1;       /* if set, this is a template map */
    uint32 nosmooth:1;  /* if set the content of this map has smoothlevel=0 forced*/
    sint32 timeout;     /* swapout is set to this */
    sint32 swap_time;   /* When it reaches 0, the map will be swapped out */
    sint16 players;     /* How many plares are on this level right now */
    uint32 in_memory;   /* If not true, the map has been freed and must
                         * be loaded before used.  The map,omap and map_ob
                         * arrays will be allocated when the map is loaded */
    uint8 compressed;   /* Compression method used */
    uint16 difficulty;  /* What level the player should be to play here */

    uint8 darkness;     /* indicates level of darkness of map */
    uint16 width,height;        /* Width and height of map. */
    uint16 enter_x;     /* enter_x and enter_y are default entrance location */
    uint16 enter_y;     /* on the map if none are set in the exit */
    uint32  outdoor:1;  /* True if an outdoor map */
    oblinkpt *buttons;  /* Linked list of linked lists of buttons */
    struct MapSpace   *spaces;    /* Array of spaces on this map */
    sint16      temp;   /* base temperature of this tile (F) */
    sint16    pressure;  /* barometric pressure (mb) */
    sint8       humid;  /* humitidy of this tile */
    sint8     windspeed; /* windspeed of this tile */
    sint8     winddir;   /* direction of wind */
    sint8     sky;      /* sky conditions */
    int     wpartx,wparty; /*Highly fasten conversion between worldmap and weathermap*/
    struct shopitems   *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */
    char    *shoprace;  /* the preffered race of the local shopkeeper */
    double  shopgreed;  /* how much our shopkeeper overcharges */
    uint64  shopmin;    /* minimum price a shop will trade for */
    uint64  shopmax;    /* maximum price a shop will offer */
    char    *msg;       /* Message map creator may have left */
    char    *maplore;   /* Map lore information */
    char    *tile_path[4];  /* path to adjoining maps */
    struct mapstruct *tile_map[4];      /* Next map, linked list */
    char path[HUGE_BUF];        /* Filename of the map */
};

/* This is used by get_rangevector to determine where the other
 * creature is.  get_rangevector takes into account map tiling,
 * so you just can not look the the map coordinates and get the
 * righte value.  distance_x/y are distance away, which
 * can be negativbe.  direction is the crossfire direction scheme
 * that the creature should head.  part is the part of the
 * monster that is closest.
 * Note: distance should be always >=0. I changed it to UINT. MT
 */
struct rv_vector {
    unsigned int            distance;
    int     distance_x;
    int     distance_y;
    int     direction;
    object  *part;
};

extern void (*load_original_map_callback)(mapstruct *map);
extern void (*load_temporary_map_callback)(mapstruct *map);
extern void (*clean_temporary_map_callback)(mapstruct *map);

#endif
Revision:	1.7
Committed:	Tue Aug 15 15:00:20 2006 UTC (17 years, 9 months ago) by elmex
Content type:	text/plain
Branch:	MAIN
Changes since 1.6:	+6 -0 lines
Log Message:	added a safe_map flag which prevents bad effects on maps that should be safe, like some shops and for example the trade shop in scorn.
#	User	Rev	Content
1	root	1.1	/*
2			* static char *rcsid_define_h =
3	root	1.2	* "$Id$";
4	root	1.1	*/
5
6			/*
7			CrossFire, A Multiplayer game for X-windows
8
9			Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team
10			Copyright (C) 1992 Frank Tore Johansen
11
12			This program is free software; you can redistribute it and/or modify
13			it under the terms of the GNU General Public License as published by
14			the Free Software Foundation; either version 2 of the License, or
15			(at your option) any later version.
16
17			This program is distributed in the hope that it will be useful,
18			but WITHOUT ANY WARRANTY; without even the implied warranty of
19			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20			GNU General Public License for more details.
21
22			You should have received a copy of the GNU General Public License
23			along with this program; if not, write to the Free Software
24			Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25
26			The authors can be reached via e-mail at crossfire-devel@real-time.com
27			*/
28
29			/*
30			* The mapstruct is allocated each time a new map is opened.
31			* It contains pointers (very indirectly) to all objects on the map.
32			*/
33
34			#ifndef MAP_H
35			#define MAP_H
36
37			/* We set this size - this is to make magic map work properly on
38			* tiled maps. There is no requirement that this matches the
39			* tiled maps size - it just seemed like a reasonable value.
40			* Magic map code now always starts out putting the player in the
41			* center of the map - this makes the most sense when dealing
42			* with tiled maps.
43			* We also figure out the magicmap color to use as we process the
44			* spaces - this is more efficient as we already have up to date
45			* map pointers.
46			*/
47			#define MAGIC_MAP_SIZE 50
48			#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
49
50
51			#define MAP_LAYERS 4
52
53			/* This is when the map will reset */
54			#define MAP_WHEN_RESET(m) ((m)->reset_time)
55
56			#define MAP_RESET_TIMEOUT(m) ((m)->reset_timeout)
57			#define MAP_DIFFICULTY(m) ((m)->difficulty)
58			#define MAP_TIMEOUT(m) ((m)->timeout)
59			#define MAP_SWAP_TIME(m) ((m)->swap_time)
60			#define MAP_OUTDOORS(m) ((m)->outdoor)
61
62			/* mape darkness used to enforce the MAX_DARKNESS value.
63			* but IMO, if it is beyond max value, that should be fixed
64			* on the map or in the code.
65			*/
66			#define MAP_DARKNESS(m) (m)->darkness
67
68			#define MAP_WIDTH(m) (m)->width
69			#define MAP_HEIGHT(m) (m)->height
70			/* Convenient function - total number of spaces is used
71			* in many places.
72			*/
73			#define MAP_SIZE(m) ((m)->width * (m)->height)
74
75			#define MAP_ENTER_X(m) (m)->enter_x
76			#define MAP_ENTER_Y(m) (m)->enter_y
77
78			#define MAP_TEMP(m) (m)->temp
79			#define MAP_PRESSURE(m) (m)->pressure
80			#define MAP_HUMID(m) (m)->humid
81			#define MAP_WINDSPEED(m) (m)->windspeed
82			#define MAP_WINDDIRECTION(m) (m)->winddir
83			#define MAP_SKYCOND(m) (m)->sky
84			#define MAP_WORLDPARTX(m) (m)->wpartx
85			#define MAP_WORLDPARTY(m) (m)->wparty
86			#define MAP_NOSMOOTH(m) (m)->nosmooth
87
88			/* options passed to ready_map_name and load_original_map */
89			#define MAP_FLUSH 0x1
90			#define MAP_PLAYER_UNIQUE 0x2
91			#define MAP_BLOCK 0x4
92			#define MAP_STYLE 0x8
93			#define MAP_OVERLAY 0x10
94
95			/* Values for in_memory below. Should probably be an enumerations */
96			#define MAP_IN_MEMORY 1
97			#define MAP_SWAPPED 2
98			#define MAP_LOADING 3
99			#define MAP_SAVING 4
100
101			/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
102			* really be used, as it is multi tile aware. However, there are some cases
103			* where it is known the map is not tiled or the values are known
104			* consistent (eg, op->map, op->x, op->y)
105			*/
106			#define GET_MAP_FLAGS(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].flags )
107			#define SET_MAP_FLAGS(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].flags = C )
108			#define GET_MAP_LIGHT(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].light )
109			#define SET_MAP_LIGHT(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].light = L )
110
111			#define GET_MAP_OB(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].bottom )
112			#define GET_MAP_TOP(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].top )
113			/* legacy */
114			#define get_map_ob GET_MAP_OB
115
116			#define SET_MAP_OB(M,X,Y,tmp) ( (M)->spaces[(X) + (M)->width * (Y)].bottom = (tmp) )
117			#define SET_MAP_TOP(M,X,Y,tmp) ( (M)->spaces[(X) + (M)->width * (Y)].top = (tmp) )
118			#define set_map_ob SET_MAP_OB
119
120			#define SET_MAP_FACE(M,X,Y,C,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces[L] = C )
121			#define GET_MAP_FACE(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces[L] )
122
123			#define SET_MAP_FACE_OBJ(M,X,Y,C,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces_obj[L] = C )
124			#define GET_MAP_FACE_OBJ(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces_obj[L] )
125
126			#define GET_MAP_MOVE_BLOCK(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_block )
127			#define SET_MAP_MOVE_BLOCK(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_block = C )
128
129			#define GET_MAP_MOVE_SLOW(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_slow )
130			#define SET_MAP_MOVE_SLOW(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_slow = C )
131
132			#define GET_MAP_MOVE_ON(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_on )
133			#define SET_MAP_MOVE_ON(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_on = C )
134
135			#define GET_MAP_MOVE_OFF(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_off )
136			#define SET_MAP_MOVE_OFF(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_off = C )
137
138			/* You should really know what you are doing before using this - you
139			* should almost always be using out_of_map instead, which takes into account
140			* map tiling.
141			*/
142			#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 \|\| (Y)<0 \|\| (X)>=(M)->width \|\| (Y)>=(M)->height)
143
144			/* These are used in the MapLook flags element. They are not used in
145			* in the object flags structure.
146			*/
147
148			#define P_BLOCKSVIEW 0x01
149			#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
150
151			/* AB_NO_PASS is used for arch_blocked() return value. It needs
152			* to be here to make sure the bits don't match with anything.
153			* Changed name to have AB_ prefix just to make sure no one
154			* is using the P_NO_PASS. AB_.. should only be used for
155			* arch_blocked and functions that examine the return value.
156			*/
157
158			#define AB_NO_PASS 0x04
159			/#define P_PASS_THRU 0x08 //* */
160			#define P_IS_ALIVE 0x10 /* something alive is on this space */
161			#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
162			#define P_NEED_UPDATE 0x40 /* this space is out of date */
163			#define P_NO_ERROR 0x80 /* Purely temporary - if set, update_position
164			* does not complain if the flags are different.
165			*/
166			/* The following two values are not stored in the MapLook flags, but instead
167			* used in the get_map_flags value - that function is used to return
168			* the flag value, as well as other conditions - using a more general
169			* function that does more of the work can hopefully be used to replace
170			* lots of duplicate checks currently in the code.
171			*/
172			#define P_OUT_OF_MAP 0x100 /* This space is outside the map */
173			#define P_NEW_MAP 0x200 /* Coordinates passed result in a new tiled map */
174	elmex	1.7	#define P_SAFE_MAP 0x400 /* If this is set the map is a safe map,
175			* that means, nothing harmful there will be done,
176			* like: bombs, potion usage, alchemy, spells
177			* this was introduced to make shops more safe
178			* and propably other maps */
179	root	1.1
180			#if 0
181			/* These go away with new movement code - can't do such simplistic
182			* checks anymore
183			*/
184			#define P_BLOCKED (P_NO_PASS \| P_IS_ALIVE) /* convenience macro */
185			#define P_WALL P_NO_PASS /* Just to match naming of wall function */
186			#endif
187
188			/* Can't use MapCell as that is used in newserver.h
189			* Instead of having numerous arrays that have information on a
190			* particular space (was map, floor, floor2, map_ob),
191			* have this structure take care of that information.
192			* This puts it all in one place, and should also make it easier
193			* to extend information about a space.
194			*/
195
196	elmex	1.6	struct MapSpace {
197	root	1.1	object bottom; / lowest object on this space */
198			object top; / Highest object on this space */
199			New_Face faces[MAP_LAYERS]; / faces for the 3 layers */
200			object faces_obj[MAP_LAYERS]; / face objects for the 3 layers */
201			uint8 flags; /* flags about this space (see the P_ values above) */
202			sint8 light; /* How much light this space provides */
203			MoveType move_block; /* What movement types this space blocks */
204			MoveType move_slow; /* What movement types this space slows */
205			MoveType move_on; /* What movement types are activated */
206			MoveType move_off; /* What movement types are activated */
207	elmex	1.6	};
208	root	1.1
209			/*
210			* this is an overlay structure of the whole world. It exists as a simple
211			* high level map, which doesn't contain the full data of the underlying map.
212			* in this map, only things such as weather are recorded. By doing so, we
213			* can keep the entire world parameters in memory, and act as a whole on
214			* them at once. We can then, in a separate loop, update the actual world
215			* with the new values we have assigned.
216			*/
217
218	elmex	1.6	struct weathermap_t {
219	root	1.1	sint16 temp; /* base temperature of this tile (F) */
220			sint16 pressure; /* barometric pressure (mb) */
221			sint8 humid; /* humitidy of this tile */
222			sint8 windspeed; /* windspeed of this tile */
223			sint8 winddir; /* direction of wind */
224			sint8 sky; /* sky conditions */
225			sint32 avgelev; /* average elevation */
226			uint32 rainfall; /* cumulative rainfall */
227			uint8 darkness; /* indicates level of darkness of map */
228			uint8 water; /* 0-100 percentage of water tiles */
229			/Dynamic parts/
230			sint16 realtemp; /* temperature at a given calculation step for this tile*/
231	elmex	1.6	};
232	root	1.1
233			/*
234			* Each map is in a given region of the game world and links to a region definiton, so
235			* they have to appear here in the headers, before the mapdef
236			*/
237	elmex	1.6	struct region {
238			struct region next; / pointer to next region, NULL for the last one */
239	root	1.1	const char name; / Shortend name of the region as maps refer to it */
240			const char parent_name; /
241			* So that parent and child regions can be defined in
242			* any order, we keep hold of the parent_name during
243			* initialisation, and the children get assigned to their
244			* parents later. (before runtime on the server though)
245			* nothing outside the init code should ever use this value.
246			*/
247	elmex	1.6	struct region parent; /
248	root	1.1	* Pointer to the region that is a parent of the current
249			* region, if a value isn't defined in the current region
250			* we traverse this series of pointers until it is.
251			*/
252			const char longname; / Official title of the region, this might be defined
253			* to be the same as name*/
254			const char msg; / the description of the region */
255			uint32 counter; /* A generic counter for holding temporary data. */
256			sint8 fallback; /* whether, in the event of a region not existing,
257			* this should be the one we fall back on as the default */
258	elmex	1.3	char jailmap; /where a player that is arrested in this region should be imprisoned.*/
259			sint16 jailx, jaily; /* The coodinates in jailmap to which the player should be sent. */
260	elmex	1.6	};
261	root	1.1
262
263	elmex	1.6	struct shopitems {
264	root	1.1	const char name; / name of the item in question, null if it is the default item */
265			const char name_pl; / plural name */
266			int typenum; /* itemtype number we need to match 0 if it is the default price*/
267			sint8 strength; /* the degree of specialisation the shop has in this item,
268			* as a percentage from -100 to 100 */
269			int index; /* being the size of the shopitems array.*/
270	elmex	1.6	};
271	root	1.1
272			/* In general, code should always use the macros
273			* above (or functions in map.c) to access many of the
274			* values in the map structure. Failure to do this will
275			* almost certainly break various features. You may think
276			* it is safe to look at width and height values directly
277			* (or even through the macros), but doing so will completely
278			* break map tiling.
279			*/
280	elmex	1.6	struct mapstruct {
281			struct mapstruct next; / Next map, linked list */
282	root	1.1	char tmpname; / Name of temporary file */
283			char name; / Name of map as given by its creator */
284	elmex	1.6	struct region region; / What jurisdiction in the game world this map is ruled by
285	root	1.1	* points to the struct containing all the properties of
286			* the region */
287			uint32 reset_time; /* when this map should reset */
288			uint32 reset_timeout; /* How many seconds must elapse before this map
289			* should be reset
290			*/
291			uint32 fixed_resettime:1; /* if true, reset time is not affected by
292			* players entering/exiting map
293			*/
294			uint32 unique:1; /* if set, this is a per player unique map */
295	elmex	1.7	uint32 safe_map:1; /* if set, this map doesn't allow using magic or harmful stuff in any way */
296	elmex	1.6	uint32 templatemap:1; /* if set, this is a template map */
297	root	1.1	uint32 nosmooth:1; /* if set the content of this map has smoothlevel=0 forced*/
298			sint32 timeout; /* swapout is set to this */
299			sint32 swap_time; /* When it reaches 0, the map will be swapped out */
300			sint16 players; /* How many plares are on this level right now */
301			uint32 in_memory; /* If not true, the map has been freed and must
302			* be loaded before used. The map,omap and map_ob
303			* arrays will be allocated when the map is loaded */
304			uint8 compressed; /* Compression method used */
305			uint16 difficulty; /* What level the player should be to play here */
306
307			uint8 darkness; /* indicates level of darkness of map */
308			uint16 width,height; /* Width and height of map. */
309			uint16 enter_x; /* enter_x and enter_y are default entrance location */
310			uint16 enter_y; /* on the map if none are set in the exit */
311			uint32 outdoor:1; /* True if an outdoor map */
312			oblinkpt buttons; / Linked list of linked lists of buttons */
313	elmex	1.6	struct MapSpace spaces; / Array of spaces on this map */
314	root	1.1	sint16 temp; /* base temperature of this tile (F) */
315			sint16 pressure; /* barometric pressure (mb) */
316			sint8 humid; /* humitidy of this tile */
317			sint8 windspeed; /* windspeed of this tile */
318			sint8 winddir; /* direction of wind */
319			sint8 sky; /* sky conditions */
320			int wpartx,wparty; /Highly fasten conversion between worldmap and weathermap/
321	elmex	1.6	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */
322	root	1.1	char shoprace; / the preffered race of the local shopkeeper */
323			double shopgreed; /* how much our shopkeeper overcharges */
324			uint64 shopmin; /* minimum price a shop will trade for */
325			uint64 shopmax; /* maximum price a shop will offer */
326			char msg; / Message map creator may have left */
327	elmex	1.3	char maplore; / Map lore information */
328	root	1.1	char tile_path[4]; / path to adjoining maps */
329	elmex	1.6	struct mapstruct tile_map[4]; / Next map, linked list */
330	root	1.2	char path[HUGE_BUF]; /* Filename of the map */
331	elmex	1.6	};
332	root	1.1
333			/* This is used by get_rangevector to determine where the other
334			* creature is. get_rangevector takes into account map tiling,
335			* so you just can not look the the map coordinates and get the
336			* righte value. distance_x/y are distance away, which
337			* can be negativbe. direction is the crossfire direction scheme
338			* that the creature should head. part is the part of the
339			* monster that is closest.
340			* Note: distance should be always >=0. I changed it to UINT. MT
341			*/
342	elmex	1.6	struct rv_vector {
343	root	1.1	unsigned int distance;
344			int distance_x;
345			int distance_y;
346			int direction;
347			object *part;
348	elmex	1.6	};
349	root	1.1
350	root	1.4	extern void (load_original_map_callback)(mapstruct map);
351			extern void (load_temporary_map_callback)(mapstruct map);
352	root	1.5	extern void (clean_temporary_map_callback)(mapstruct map);
353	root	1.4
354	root	1.1	#endif