[ViewVC] Diff of: cvs/deliantra/server/include/map.h

Comparing deliantra/server/include/map.h (file contents):
Revision 1.1 by root, Fri Feb 3 07:12:49 2006 UTC vs.
Revision 1.73 by root, Sat Apr 14 07:23:00 2007 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_define_h =	2	* CrossFire, A Multiplayer game for X-windows
3	* "$Id: map.h,v 1.1 2006/02/03 07:12:49 root Exp $";	3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
		5	* Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team
		6	* Copyright (C) 1992 Frank Tore Johansen
		7	*
		8	* This program is free software; you can redistribute it and/or modify
		9	* it under the terms of the GNU General Public License as published by
		10	* the Free Software Foundation; either version 2 of the License, or
		11	* (at your option) any later version.
		12	*
		13	* This program is distributed in the hope that it will be useful,
		14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
		15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
		16	* GNU General Public License for more details.
		17	*
		18	* You should have received a copy of the GNU General Public License
		19	* along with this program; if not, write to the Free Software
		20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
		21	*
		22	* The authors can be reached via e-mail at crossfire@schmorp.de
4	*/	23	*/
5		24
6	/*	25	/*
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.	26	* The maptile is allocated each time a new map is opened.
31	* It contains pointers (very indirectly) to all objects on the map.	27	* It contains pointers (very indirectly) to all objects on the map.
32	*/	28	*/
33		29
34	#ifndef MAP_H	30	#ifndef MAP_H
35	#define MAP_H	31	#define MAP_H
36		32
		33	#include <tr1/unordered_map>
		34
		35	#include "cfperl.h"
		36
37	/* We set this size - this is to make magic map work properly on	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	38	* tiled maps. There is no requirement that this matches the
39	* tiled maps size - it just seemed like a reasonable value.	39	* tiled maps size - it just seemed like a reasonable value.
40	* Magic map code now always starts out putting the player in the	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	41	* center of the map - this makes the most sense when dealing
42	* with tiled maps.	42	* with tiled maps.
43	* We also figure out the magicmap color to use as we process the	43	* We also figure out the magicmap color to use as we process the
45	* map pointers.	45	* map pointers.
46	*/	46	*/
47	#define MAGIC_MAP_SIZE 50	47	#define MAGIC_MAP_SIZE 50
48	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2	48	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
49		49
50
51	#define MAP_LAYERS 4	50	#define MAP_LAYERS 3
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		51
95	/* Values for in_memory below. Should probably be an enumerations */	52	/* Values for in_memory below. Should probably be an enumerations */
96	#define MAP_IN_MEMORY 1	53	enum {
97	#define MAP_SWAPPED 2	54	MAP_IN_MEMORY,
98	#define MAP_LOADING 3	55	MAP_SWAPPED,
99	#define MAP_SAVING 4	56	MAP_LOADING,
		57	MAP_SAVING,
		58	};
100		59
101	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	60	/* 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	61	* 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	62	* where it is known the map is not tiled or the values are known
104	* consistent (eg, op->map, op->x, op->y)	63	* consistent (eg, op->map, op->x, op->y)
105	*/	64	*/
106	#define GET_MAP_FLAGS(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].flags )	65	// all those macros are herewith declared legacy
107	#define SET_MAP_FLAGS(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].flags = C )	66	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
108	#define GET_MAP_LIGHT(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].light )	67	#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
109	#define SET_MAP_LIGHT(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].light = L )	68	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
110		69	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
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] )	70	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
125
126	#define GET_MAP_MOVE_BLOCK(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_block )	71	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(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 )	72	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(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 )	73	#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(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 )	74	#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
136	#define SET_MAP_MOVE_OFF(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_off = C )
137		75
138	/* You should really know what you are doing before using this - you	76	/* 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	77	* should almost always be using out_of_map instead, which takes into account
140	* map tiling.	78	* map tiling.
141	*/	79	*/
142	#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 \|\| (Y)<0 \|\| (X)>=(M)->width \|\| (Y)>=(M)->height)	80	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
143		81
144	/* These are used in the MapLook flags element. They are not used in	82	/* These are used in the MapLook flags element. They are not used in
145	* in the object flags structure.	83	* in the object flags structure.
146	*/	84	*/
147
148	#define P_BLOCKSVIEW 0x01	85	#define P_BLOCKSVIEW 0x01
149	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */	86	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
150		87	#define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */
151	/* AB_NO_PASS is used for arch_blocked() return value. It needs	88	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,
152	* to be here to make sure the bits don't match with anything.	89	* that means, nothing harmful can be done,
153	* Changed name to have AB_ prefix just to make sure no one	90	* such as: bombs, potion usage, alchemy, spells
154	* is using the P_NO_PASS. AB_.. should only be used for	91	* this was introduced to make shops safer
155	* arch_blocked and functions that examine the return value.	92	* but is useful in other situations */
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 */	93	#define P_IS_ALIVE 0x10 /* something alive is on this space */
161	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */	94	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
		95
162	#define P_NEED_UPDATE 0x40 /* this space is out of date */	96	#define P_UPTODATE 0x80 /* this space is up to date */
163	#define P_NO_ERROR 0x80 /* Purely temporary - if set, update_position	97
164	* does not complain if the flags are different.
165	*/
166	/* The following two values are not stored in the MapLook flags, but instead	98	/* 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	99	* 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	100	* 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	101	* function that does more of the work can hopefully be used to replace
170	* lots of duplicate checks currently in the code.	102	* lots of duplicate checks currently in the code.
171	*/	103	*/
172	#define P_OUT_OF_MAP 0x100 /* This space is outside the map */	104	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
173	#define P_NEW_MAP 0x200 /* Coordinates passed result in a new tiled map */	105	#define P_NEW_MAP 0x20000
		106	/* Coordinates passed result in a new tiled map */
174		107
175	#if 0	108	/* P_NO_PASS is used for ob_blocked() return value. It needs
176	/* These go away with new movement code - can't do such simplistic	109	* to be here to make sure the bits don't match with anything.
177	* checks anymore
178	*/	110	*/
179	#define P_BLOCKED (P_NO_PASS \| P_IS_ALIVE) /* convenience macro */	111	#define P_NO_PASS 0x80000
180	#define P_WALL P_NO_PASS /* Just to match naming of wall function */
181	#endif
182		112
183	/* Can't use MapCell as that is used in newserver.h
184	* Instead of having numerous arrays that have information on a	113	/* Instead of having numerous arrays that have information on a
185	* particular space (was map, floor, floor2, map_ob),	114	* particular space (was map, floor, floor2, map_ob),
186	* have this structure take care of that information.	115	* have this structure take care of that information.
187	* This puts it all in one place, and should also make it easier	116	* This puts it all in one place, and should also make it easier
188	* to extend information about a space.	117	* to extend information about a space.
189	*/	118	*/
190		119	struct mapspace
191	typedef struct MapSpace {	120	{
192	object bottom; / lowest object on this space */	121	object bot, top; /* lowest/highest object on this space */
193	object top; / Highest object on this space */
194	New_Face faces[MAP_LAYERS]; / faces for the 3 layers */
195	object faces_obj[MAP_LAYERS]; / face objects for the 3 layers */	122	object faces_obj[MAP_LAYERS];/ face objects for the 3 layers */
196	uint8 flags; /* flags about this space (see the P_ values above) */	123	uint8 flags_; /* flags about this space (see the P_ values above) */
197	sint8 light; /* How much light this space provides */	124	sint8 light; /* How much light this space provides */
198	MoveType move_block; /* What movement types this space blocks */	125	MoveType move_block; /* What movement types this space blocks */
199	MoveType move_slow; /* What movement types this space slows */	126	MoveType move_slow; /* What movement types this space slows */
200	MoveType move_on; /* What movement types are activated */	127	MoveType move_on; /* What movement types are activated */
201	MoveType move_off; /* What movement types are activated */	128	MoveType move_off; /* What movement types are activated */
202	} MapSpace;
203		129
204	/*	130	void update_ ();
205	* this is an overlay structure of the whole world. It exists as a simple	131	void update ()
206	* high level map, which doesn't contain the full data of the underlying map.	132	{
207	* in this map, only things such as weather are recorded. By doing so, we	133	if (!(flags_ & P_UPTODATE))
208	* can keep the entire world parameters in memory, and act as a whole on	134	update_ ();
209	* them at once. We can then, in a separate loop, update the actual world	135	}
210	* with the new values we have assigned.
211	*/
212		136
213	typedef struct wmapdef {	137	uint8 flags ()
214	sint16 temp; /* base temperature of this tile (F) */	138	{
215	sint16 pressure; /* barometric pressure (mb) */	139	update ();
216	sint8 humid; /* humitidy of this tile */	140	return flags_;
217	sint8 windspeed; /* windspeed of this tile */	141	}
218	sint8 winddir; /* direction of wind */	142
219	sint8 sky; /* sky conditions */	143	// maybe only inline quick flags_ checking?
220	sint32 avgelev; /* average elevation */	144	object *player ()
221	uint32 rainfall; /* cumulative rainfall */	145	{
222	uint8 darkness; /* indicates level of darkness of map */	146	// search from the top, because players are usually on top
223	uint8 water; /* 0-100 percentage of water tiles */	147	// make usually == always and this non-amortized O(1)
224	/Dynamic parts/	148	// could gte rid of P_PLAYER, too, then
225	sint16 realtemp; /* temperature at a given calculation step for this tile*/	149	if (flags () & P_PLAYER)
226	} weathermap_t;	150	for (object *op = top; op; op = op->below)
		151	if (op->type == PLAYER)
		152	return op;
		153
		154	return 0;
		155	}
		156
		157	// return the item volume on this mapspace in cm³
		158	uint64 volume () const;
		159	};
227		160
228	/*	161	/*
229	* Each map is in a given region of the game world and links to a region definiton, so	162	* Each map is in a given region of the game world and links to a region definiton, so
230	* they have to appear here in the headers, before the mapdef	163	* they have to appear here in the headers, before the mapdef
231	*/	164	*/
232	typedef struct regiondef {	165	INTERFACE_CLASS (region)
233	struct regiondef next; / pointer to next region, NULL for the last one */	166	struct region : zero_initialised
234	const char name; / Shortend name of the region as maps refer to it */	167	{
235	const char parent_name; /	168	shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */
236	* So that parent and child regions can be defined in	169	shstr ACC (RW, match); // a perl regex that matches map paths
237	* any order, we keep hold of the parent_name during	170	region ACC (RW, parent); /
238	* initialisation, and the children get assigned to their	171	* Pointer to the region that is a parent of the current
239	* parents later. (before runtime on the server though)
240	* nothing outside the init code should ever use this value.
241	*/
242	struct regiondef parent;/
243	* Pointer to the region that is a parent of the current
244	* region, if a value isn't defined in the current region	172	* region, if a value isn't defined in the current region
245	* we traverse this series of pointers until it is.	173	* we traverse this series of pointers until it is.
246	*/	174	*/
247	const char longname; / Official title of the region, this might be defined	175	shstr ACC (RW, longname); /* Official title of the region, this might be defined
248	* to be the same as name*/	176	* to be the same as name*/
249	const char msg; / the description of the region */	177	shstr ACC (RW, msg); /* the description of the region */
		178	shstr ACC (RW, jailmap); /where a player that is arrested in this region should be imprisoned. /
		179	int ACC (RW, index);
250	uint32 counter; /* A generic counter for holding temporary data. */	180	uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
		181	sint16 ACC (RW, jailx), ACC (RW, jaily);/* The coodinates in jailmap to which the player should be sent. */
251	sint8 fallback; /* whether, in the event of a region not existing,	182	bool ACC (RW, fallback); /* whether, in the event of a region not existing,
252	* this should be the one we fall back on as the default */	183	* this should be the one we fall back on as the default */
253	} region;
254		184
		185	static region *default_region ();
		186	static region find (const char name);
		187	static region find_fuzzy (const char name);
		188	static region *read (object_thawer &f);
		189	};
255		190
256	typedef struct shopitem {	191	typedef object_vector<region, &region::index> regionvec;
		192
		193	extern regionvec regions;
		194
		195	#define for_all_regions(var) \
		196	for (unsigned _i = 0; _i < regions.size (); ++_i) \
		197	declvar (region *, var, regions [_i])
		198
		199	struct shopitems : zero_initialised
		200	{
257	const char name; / name of the item in question, null if it is the default item */	201	const char name; / name of the item in question, null if it is the default item */
258	const char name_pl; / plural name */	202	const char name_pl; / plural name */
259	int typenum; /* itemtype number we need to match 0 if it is the default price*/	203	int typenum; /* itemtype number we need to match 0 if it is the default price */
260	sint8 strength; /* the degree of specialisation the shop has in this item,	204	sint8 strength; /* the degree of specialisation the shop has in this item,
261	* as a percentage from -100 to 100 */	205	* as a percentage from -100 to 100 */
262	int index; /* being the size of the shopitems array.*/	206	int index; /* being the size of the shopitems array. */
263	} shopitems;	207	};
		208
		209	// map I/O, what to load/save
		210	enum {
		211	IO_HEADER = 0x01, // the "arch map" pseudo object
		212	IO_OBJECTS = 0x02, // the non-unique objects
		213	IO_UNIQUES = 0x04, // unique objects
		214	};
264		215
265	/* In general, code should always use the macros	216	/* In general, code should always use the macros
266	* above (or functions in map.c) to access many of the	217	* above (or functions in map.c) to access many of the
267	* values in the map structure. Failure to do this will	218	* values in the map structure. Failure to do this will
268	* almost certainly break various features. You may think	219	* almost certainly break various features. You may think
269	* it is safe to look at width and height values directly	220	* it is safe to look at width and height values directly
270	* (or even through the macros), but doing so will completely	221	* (or even through the macros), but doing so will completely
271	* break map tiling.	222	* break map tiling.
272	*/	223	*/
273	typedef struct mapdef {	224	INTERFACE_CLASS (maptile)
274	struct mapdef next; / Next map, linked list */	225	struct maptile : zero_initialised, attachable
275	char path[HUGE_BUF]; /* Filename of the map */	226	{
276	char tmpname; / Name of temporary file */	227	sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
		228	struct mapspace spaces; / Array of spaces on this map */
		229	uint8 regions; / region index per mapspace, if != 0 */
		230	struct region *regionmap; / index to region */
		231
		232	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
		233
277	char name; / Name of map as given by its creator */	234	shstr ACC (RW, name); /* Name of map as given by its creator */
278	region region; / What jurisdiction in the game world this map is ruled by	235	struct region ACC (RW, default_region); / What jurisdiction in the game world this map is ruled by
279	* points to the struct containing all the properties of	236	* points to the struct containing all the properties of
280	* the region */	237	* the region */
281	uint32 reset_time; /* when this map should reset */	238	double ACC (RW, reset_time);
282	uint32 reset_timeout; /* How many seconds must elapse before this map	239	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
283	* should be reset	240	* should be reset
284	*/	241	*/
		242	bool ACC (RW, dirty); /* if true, something was inserted or removed */
285	uint32 fixed_resettime:1; /* if true, reset time is not affected by	243	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
286	* players entering/exiting map	244	* players entering/exiting map
287	*/	245	*/
288	uint32 unique:1; /* if set, this is a per player unique map */
289	uint32 template:1; /* if set, this is a template map */
290	uint32 nosmooth:1; /* if set the content of this map has smoothlevel=0 forced*/
291	sint32 timeout; /* swapout is set to this */	246	sint32 ACC (RW, timeout); /* swapout is set to this */
292	sint32 swap_time; /* When it reaches 0, the map will be swapped out */	247	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
293	sint16 players; /* How many plares are on this level right now */
294	uint32 in_memory; /* If not true, the map has been freed and must	248	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
295	* be loaded before used. The map,omap and map_ob	249	* be loaded before used. The map,omap and map_ob
296	* arrays will be allocated when the map is loaded */	250	* arrays will be allocated when the map is loaded */
297	uint8 compressed; /* Compression method used */	251	sint16 players; /* How many players are on this map right now */
298	uint16 difficulty; /* What level the player should be to play here */	252	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
299		253
		254	bool ACC (RW, per_player);
		255	bool ACC (RW, per_party);
		256	bool ACC (RW, outdoor); /* True if an outdoor map */
		257	bool ACC (RW, nodrop); /* avoid dropping anything on this map */
300	uint8 darkness; /* indicates level of darkness of map */	258	uint8 ACC (RW, darkness); /* indicates level of darkness of map */
301	uint16 width,height; /* Width and height of map. */	259
302	uint16 enter_x; /* enter_x and enter_y are default entrance location */	260	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
303	uint16 enter_y; /* on the map if none are set in the exit */	261	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
304	uint32 outdoor:1; /* True if an outdoor map */
305	oblinkpt buttons; / Linked list of linked lists of buttons */	262	oblinkpt buttons; / Linked list of linked lists of buttons */
306	MapSpace spaces; / Array of spaces on this map */
307	sint16 temp; /* base temperature of this tile (F) */	263	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
308	sint16 pressure; /* barometric pressure (mb) */	264	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
309	sint8 humid; /* humitidy of this tile */	265	sint8 ACC (RW, humid); /* humitidy of this tile */
310	sint8 windspeed; /* windspeed of this tile */	266	sint8 ACC (RW, windspeed); /* windspeed of this tile */
311	sint8 winddir; /* direction of wind */	267	sint8 ACC (RW, winddir); /* direction of wind */
312	sint8 sky; /* sky conditions */	268	sint8 ACC (RW, sky); /* sky conditions */
313	int wpartx,wparty; /Highly fasten conversion between worldmap and weathermap/	269	int ACC (RW, worldpartx), ACC (RW, worldparty); /Highly fasten conversion between worldmap and weathermap /
314	shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */	270	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */
315	char shoprace; / the preffered race of the local shopkeeper */	271	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
316	double shopgreed; /* how much our shopkeeper overcharges */	272	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
317	uint64 shopmin; /* minimum price a shop will trade for */	273	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
318	uint64 shopmax; /* maximum price a shop will offer */	274	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
319	char msg; / Message map creator may have left */	275	shstr ACC (RW, msg); /* Message map creator may have left */
		276	shstr ACC (RW, maplore); /* Map lore information */
320	char tile_path[4]; / path to adjoining maps */	277	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
321	struct mapdef tile_map[4]; / Next map, linked list */	278	maptile ACC (RW, tile_map[4]); / Next map, linked list */
322	} mapstruct;	279	shstr ACC (RW, path); /* Filename of the map */
		280	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
		281	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
		282
		283	MTH void activate ();
		284	MTH void deactivate ();
		285
		286	// allocates all (empty) mapspace
		287	MTH void alloc ();
		288	// deallocates the mapspaces (and destroys all objects)
		289	MTH void clear ();
		290
		291	MTH void fix_auto_apply ();
		292	MTH void decay_objects ();
		293	MTH void update_buttons ();
		294	MTH int change_map_light (int change);
		295	static void change_all_map_light (int change); //PERL
		296	MTH void set_darkness_map ();
		297	MTH int estimate_difficulty () const;
		298
		299	// set the given flag on all objects in the map
		300	MTH void set_object_flag (int flag, int value = 1);
		301
		302	MTH void link_multipart_objects ();
		303	MTH void clear_unique_items ();
		304
		305	MTH void clear_header ();
		306	MTH void clear_links_to (maptile *m);
		307
		308	MTH struct region *region (int x, int y) const;
		309
		310	// loas the header pseudo-object
		311	bool _load_header (object_thawer &thawer);
		312	MTH bool _load_header (const char *path);
		313
		314	// load objects into the map
		315	bool _load_objects (object_thawer &thawer);
		316	MTH bool _load_objects (const char *path, bool skip_header = true);
		317
		318	// save objects into the given file (uses IO_ flags)
		319	bool _save_objects (object_freezer &freezer, int flags);
		320	MTH bool _save_objects (const char *path, int flags);
		321
		322	// save the header pseudo object _only_
		323	bool _save_header (object_freezer &freezer);
		324	MTH bool _save_header (const char *path);
		325
		326	maptile ();
		327	maptile (int w, int h);
		328	~maptile ();
		329
		330	void do_destroy ();
		331	void gather_callbacks (AV *&callbacks, event_type event) const;
		332
		333	MTH int size () const { return width * height; }
		334
		335	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
		336
		337	MTH void touch () { last_access = runtime; }
		338
		339	// find the map that is at coordinate x\|y relative to this map
		340	// TODO: need a better way than passing by reference
		341	// TODO: make perl interface
		342	maptile *xy_find (sint16 &x, sint16 &y);
		343
		344	// like xy_find, but also loads the map
		345	maptile *xy_load (sint16 &x, sint16 &y);
		346
		347	void do_load_sync ();//PERL
		348
		349	// make sure the map is loaded
		350	MTH void load_sync ()
		351	{
		352	if (!spaces)
		353	do_load_sync ();
		354	}
		355
		356	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);
		357	bool generate_random_map (random_map_params *RP);
		358
		359	static maptile find_async (const char path, maptile *original = 0);//PERL
		360	static maptile find_sync (const char path, maptile *original = 0);//PERL
		361	static maptile find_style_sync (const char dir, const char *file = 0);//PERL
		362	MTH object *pick_random_object () const;
		363
		364	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
		365	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
		366	};
323		367
324	/* This is used by get_rangevector to determine where the other	368	/* This is used by get_rangevector to determine where the other
325	* creature is. get_rangevector takes into account map tiling,	369	* creature is. get_rangevector takes into account map tiling,
326	* so you just can not look the the map coordinates and get the	370	* so you just can not look the the map coordinates and get the
327	* righte value. distance_x/y are distance away, which	371	* righte value. distance_x/y are distance away, which
328	* can be negativbe. direction is the crossfire direction scheme	372	* can be negative. direction is the crossfire direction scheme
329	* that the creature should head. part is the part of the	373	* that the creature should head. part is the part of the
330	* monster that is closest.	374	* monster that is closest.
331	* Note: distance should be always >=0. I changed it to UINT. MT	375	* Note: distance should be always >=0. I changed it to UINT. MT
332	*/	376	*/
333	typedef struct rv_vector {	377	struct rv_vector
		378	{
334	unsigned int distance;	379	unsigned int distance;
335	int distance_x;	380	int distance_x;
336	int distance_y;	381	int distance_y;
337	int direction;	382	int direction;
338	object *part;	383	object *part;
339	} rv_vector;	384	};
		385
		386	//TODO: these should be refactored into things like xy_normalise
		387	// and so on.
		388	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
		389	int ob_blocked (const object ob, maptile m, sint16 x, sint16 y);
		390	int out_of_map (maptile *m, int x, int y);
		391	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
		392	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
		393	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);
		394	int on_same_map (const object op1, const object op2);
		395	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);
		396
		397	// adjust map, x and y for tiled maps and return true if the position is valid at all
		398	inline bool
		399	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
		400	{
		401	// when in range, do a quick return, otherwise go the slow route
		402	return
		403	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
		404	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
		405	}
		406
		407	inline mapspace &
		408	object::ms () const
		409	{
		410	return map->at (x, y);
		411	}
340		412
341	#endif	413	#endif
		414

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing deliantra/server/include/map.h (file contents): Revision 1.1 by root, Fri Feb 3 07:12:49 2006 UTC vs. Revision 1.73 by root, Sat Apr 14 07:23:00 2007 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.1 by root, Fri Feb 3 07:12:49 2006 UTC vs.
Revision 1.73 by root, Sat Apr 14 07:23:00 2007 UTC