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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.14 by elmex, Tue Aug 29 09:27:58 2006 UTC vs.
Revision 1.104 by root, Fri Dec 26 10:36:42 2008 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_define_h =	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	* "$Id: map.h,v 1.14 2006/08/29 09:27:58 elmex Exp $";	3	*
		4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
		5	* Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
		6	* Copyright (©) 1992,2007 Frank Tore Johansen
		7	*
		8	* Deliantra 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 3 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, see <http://www.gnu.org/licenses/>.
		20	*
		21	* The authors can be reached via e-mail to <support@deliantra.net>
4	*/	22	*/
5		23
6	/*	24	/*
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.	25	* The maptile is allocated each time a new map is opened.
31	* It contains pointers (very indirectly) to all objects on the map.	26	* It contains pointers (very indirectly) to all objects on the map.
32	*/	27	*/
33		28
34	#ifndef MAP_H	29	#ifndef MAP_H
35	#define MAP_H	30	#define MAP_H
36		31
		32	#include <tr1/unordered_map>
		33
		34	#include "region.h"
37	#include "cfperl.h"	35	#include "cfperl.h"
38		36
39	/* 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
40	* tiled maps. There is no requirement that this matches the	38	* tiled maps. There is no requirement that this matches the
41	* tiled maps size - it just seemed like a reasonable value.	39	* tiled maps size - it just seemed like a reasonable value.
42	* 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
43	* center of the map - this makes the most sense when dealing	41	* center of the map - this makes the most sense when dealing
44	* with tiled maps.	42	* with tiled maps.
45	* 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
47	* map pointers.	45	* map pointers.
48	*/	46	*/
49	#define MAGIC_MAP_SIZE 50	47	#define MAGIC_MAP_SIZE 50
50	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2	48	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
51		49
52
53	#define MAP_LAYERS 4	50	#define MAP_LAYERS 3
54		51
55	/* This is when the map will reset */	52	// tile map index
56	#define MAP_WHEN_RESET(m) ((m)->reset_time)	53	enum {
		54	TILE_UP = 0,
		55	TILE_RIGHT = 1,
		56	TILE_DOWN = 2,
		57	TILE_LEFT = 3,
		58	};
57		59
58	#define MAP_RESET_TIMEOUT(m) ((m)->reset_timeout)	60	/* Values for in_memory below */
59	#define MAP_DIFFICULTY(m) ((m)->difficulty)	61	enum {
60	#define MAP_TIMEOUT(m) ((m)->timeout)	62	MAP_ACTIVE,
61	#define MAP_SWAP_TIME(m) ((m)->swap_time)	63	MAP_INACTIVE, // not used atm.
62	#define MAP_OUTDOORS(m) ((m)->outdoor)	64	MAP_SWAPPED,
63		65	MAP_LOADING,
64	/* mape darkness used to enforce the MAX_DARKNESS value.	66	MAP_SAVING,
65	* but IMO, if it is beyond max value, that should be fixed	67	};
66	* on the map or in the code.
67	*/
68	#define MAP_DARKNESS(m) (m)->darkness
69
70	#define MAP_WIDTH(m) (m)->width
71	#define MAP_HEIGHT(m) (m)->height
72	/* Convenient function - total number of spaces is used
73	* in many places.
74	*/
75	#define MAP_SIZE(m) ((m)->width * (m)->height)
76
77	#define MAP_ENTER_X(m) (m)->enter_x
78	#define MAP_ENTER_Y(m) (m)->enter_y
79
80	#define MAP_TEMP(m) (m)->temp
81	#define MAP_PRESSURE(m) (m)->pressure
82	#define MAP_HUMID(m) (m)->humid
83	#define MAP_WINDSPEED(m) (m)->windspeed
84	#define MAP_WINDDIRECTION(m) (m)->winddir
85	#define MAP_SKYCOND(m) (m)->sky
86	#define MAP_WORLDPARTX(m) (m)->wpartx
87	#define MAP_WORLDPARTY(m) (m)->wparty
88	#define MAP_NOSMOOTH(m) (m)->nosmooth
89
90	/* options passed to ready_map_name and load_original_map */
91	#define MAP_FLUSH 0x1
92	#define MAP_PLAYER_UNIQUE 0x2
93	#define MAP_BLOCK 0x4
94	#define MAP_STYLE 0x8
95	#define MAP_OVERLAY 0x10
96
97	/* Values for in_memory below. Should probably be an enumerations */
98	#define MAP_IN_MEMORY 1
99	#define MAP_SWAPPED 2
100	#define MAP_LOADING 3
101	#define MAP_SAVING 4
102		68
103	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	69	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
104	* really be used, as it is multi tile aware. However, there are some cases	70	* really be used, as it is multi tile aware. However, there are some cases
105	* where it is known the map is not tiled or the values are known	71	* where it is known the map is not tiled or the values are known
106	* consistent (eg, op->map, op->x, op->y)	72	* consistent (eg, op->map, op->x, op->y)
107	*/	73	*/
108	#define GET_MAP_FLAGS(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].flags )	74	// all those macros are herewith declared legacy
109	#define SET_MAP_FLAGS(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].flags = C )	75	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
110	#define GET_MAP_LIGHT(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].light )	76	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
111	#define SET_MAP_LIGHT(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].light = L )	77	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
112
113	#define GET_MAP_OB(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].bottom )
114	#define GET_MAP_TOP(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].top )
115	/* legacy */
116	#define get_map_ob GET_MAP_OB
117
118	#define SET_MAP_OB(M,X,Y,tmp) ( (M)->spaces[(X) + (M)->width * (Y)].bottom = (tmp) )
119	#define SET_MAP_TOP(M,X,Y,tmp) ( (M)->spaces[(X) + (M)->width * (Y)].top = (tmp) )
120	#define set_map_ob SET_MAP_OB
121
122	#define SET_MAP_FACE(M,X,Y,C,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces[L] = C )
123	#define GET_MAP_FACE(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces[L] )
124
125	#define SET_MAP_FACE_OBJ(M,X,Y,C,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces_obj[L] = C )
126	#define GET_MAP_FACE_OBJ(M,X,Y,L) ( (M)->spaces[(X) + (M)->width * (Y)].faces_obj[L] )	78	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
127
128	#define GET_MAP_MOVE_BLOCK(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_block )	79	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
129	#define SET_MAP_MOVE_BLOCK(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_block = C )
130
131	#define GET_MAP_MOVE_SLOW(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_slow )	80	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
132	#define SET_MAP_MOVE_SLOW(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_slow = C )
133
134	#define GET_MAP_MOVE_ON(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_on )	81	#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on
135	#define SET_MAP_MOVE_ON(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_on = C )
136
137	#define GET_MAP_MOVE_OFF(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].move_off )	82	#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
138	#define SET_MAP_MOVE_OFF(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].move_off = C )
139		83
140	/* You should really know what you are doing before using this - you	84	/* You should really know what you are doing before using this - you
141	* should almost always be using out_of_map instead, which takes into account	85	* should almost always be using out_of_map instead, which takes into account
142	* map tiling.	86	* map tiling.
143	*/	87	*/
144	#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 \|\| (Y)<0 \|\| (X)>=(M)->width \|\| (Y)>=(M)->height)	88	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
145		89
146	/* These are used in the MapLook flags element. They are not used in	90	/* These are used in the MapLook flags element. They are not used in
147	* in the object flags structure.	91	* in the object flags structure.
148	*/	92	*/
149
150	#define P_BLOCKSVIEW 0x01	93	#define P_BLOCKSVIEW 0x01
151	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */	94	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
152		95	#define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */
153	/* AB_NO_PASS is used for arch_blocked() return value. It needs
154	* to be here to make sure the bits don't match with anything.
155	* Changed name to have AB_ prefix just to make sure no one
156	* is using the P_NO_PASS. AB_.. should only be used for
157	* arch_blocked and functions that examine the return value.
158	*/
159
160	#define AB_NO_PASS 0x04
161	/#define P_PASS_THRU 0x08 //* */
162	#define P_SAFE 0x08 /* If this is set the map tile is a safe map,	96	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,
163	* that means, nothing harmful there will be done,	97	* that means, nothing harmful can be done,
164	* like: bombs, potion usage, alchemy, spells	98	* such as: bombs, potion usage, alchemy, spells
165	* this was introduced to make shops more safe	99	* this was introduced to make shops safer
166	* and propably other maps */	100	* but is useful in other situations */
167	#define P_IS_ALIVE 0x10 /* something alive is on this space */	101	#define P_IS_ALIVE 0x10 /* something alive is on this space */
168	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */	102	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
		103
169	#define P_NEED_UPDATE 0x40 /* this space is out of date */	104	#define P_UPTODATE 0x80 /* this space is up to date */
170	#define P_NO_ERROR 0x80 /* Purely temporary - if set, update_position	105
171	* does not complain if the flags are different.
172	*/
173	/* The following two values are not stored in the MapLook flags, but instead	106	/* The following two values are not stored in the MapLook flags, but instead
174	* used in the get_map_flags value - that function is used to return	107	* used in the get_map_flags value - that function is used to return
175	* the flag value, as well as other conditions - using a more general	108	* the flag value, as well as other conditions - using a more general
176	* function that does more of the work can hopefully be used to replace	109	* function that does more of the work can hopefully be used to replace
177	* lots of duplicate checks currently in the code.	110	* lots of duplicate checks currently in the code.
178	*/	111	*/
179	#define P_OUT_OF_MAP 0x100 /* This space is outside the map */	112	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
180	#define P_NEW_MAP 0x200 /* Coordinates passed result in a new tiled map */	113	#define P_NEW_MAP 0x20000
		114	/* Coordinates passed result in a new tiled map */
181		115
182	#if 0
183	/* These go away with new movement code - can't do such simplistic
184	* checks anymore
185	*/
186	#define P_BLOCKED (P_NO_PASS \| P_IS_ALIVE) /* convenience macro */
187	#define P_WALL P_NO_PASS /* Just to match naming of wall function */
188	#endif
189
190	/* Can't use MapCell as that is used in newserver.h
191	* Instead of having numerous arrays that have information on a	116	/* Instead of having numerous arrays that have information on a
192	* particular space (was map, floor, floor2, map_ob),	117	* particular space (was map, floor, floor2, map_ob),
193	* have this structure take care of that information.	118	* have this structure take care of that information.
194	* This puts it all in one place, and should also make it easier	119	* This puts it all in one place, and should also make it easier
195	* to extend information about a space.	120	* to extend information about a space.
196	*/	121	*/
197		122	INTERFACE_CLASS (mapspace)
198	struct MapSpace {	123	struct mapspace
199	object bottom; / lowest object on this space */	124	{
200	object top; / Highest object on this space */	125	object *ACC (RW, bot);
201	New_Face faces[MAP_LAYERS]; / faces for the 3 layers */	126	object ACC (RW, top); / lowest/highest object on this space */
202	object faces_obj[MAP_LAYERS]; / face objects for the 3 layers */	127	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
203	uint8 flags; /* flags about this space (see the P_ values above) */	128	uint8 flags_; /* flags about this space (see the P_ values above) */
204	sint8 light; /* How much light this space provides */	129	sint8 ACC (RW, light); /* How much light this space provides */
205	MoveType move_block; /* What movement types this space blocks */	130	MoveType ACC (RW, move_block); /* What movement types this space blocks */
206	MoveType move_slow; /* What movement types this space slows */	131	MoveType ACC (RW, move_slow); /* What movement types this space slows */
207	MoveType move_on; /* What movement types are activated */	132	MoveType ACC (RW, move_on); /* What movement types are activated */
208	MoveType move_off; /* What movement types are activated */	133	MoveType ACC (RW, move_off); /* What movement types are activated */
209	};
210		134
211	/*	135	void update_ ();
212	* this is an overlay structure of the whole world. It exists as a simple	136	MTH void update ()
213	* high level map, which doesn't contain the full data of the underlying map.	137	{
214	* in this map, only things such as weather are recorded. By doing so, we	138	if (!(flags_ & P_UPTODATE))
215	* can keep the entire world parameters in memory, and act as a whole on	139	update_ ();
216	* them at once. We can then, in a separate loop, update the actual world	140	}
217	* with the new values we have assigned.
218	*/
219		141
220	struct weathermap_t {	142	MTH uint8 flags ()
221	sint16 temp; /* base temperature of this tile (F) */	143	{
222	sint16 pressure; /* barometric pressure (mb) */	144	update ();
223	sint8 humid; /* humitidy of this tile */	145	return flags_;
224	sint8 windspeed; /* windspeed of this tile */	146	}
225	sint8 winddir; /* direction of wind */
226	sint8 sky; /* sky conditions */
227	sint32 avgelev; /* average elevation */
228	uint32 rainfall; /* cumulative rainfall */
229	uint8 darkness; /* indicates level of darkness of map */
230	uint8 water; /* 0-100 percentage of water tiles */
231	/Dynamic parts/
232	sint16 realtemp; /* temperature at a given calculation step for this tile*/
233	};
234		147
235	/*	148	MTH void invalidate ()
236	* Each map is in a given region of the game world and links to a region definiton, so	149	{
237	* they have to appear here in the headers, before the mapdef	150	flags_ = 0;
238	*/	151	}
239	struct region {	152
240	struct region next; / pointer to next region, NULL for the last one */	153	MTH object *player ()
241	const char name; / Shortend name of the region as maps refer to it */	154	{
242	const char parent_name; /	155	object *op;
243	* So that parent and child regions can be defined in
244	* any order, we keep hold of the parent_name during
245	* initialisation, and the children get assigned to their
246	* parents later. (before runtime on the server though)
247	* nothing outside the init code should ever use this value.
248	*/
249	struct region parent; /
250	* Pointer to the region that is a parent of the current
251	* region, if a value isn't defined in the current region
252	* we traverse this series of pointers until it is.
253	*/
254	const char longname; / Official title of the region, this might be defined
255	* to be the same as name*/
256	const char msg; / the description of the region */
257	uint32 counter; /* A generic counter for holding temporary data. */
258	sint8 fallback; /* whether, in the event of a region not existing,
259	* this should be the one we fall back on as the default */
260	char jailmap; /where a player that is arrested in this region should be imprisoned.*/
261	sint16 jailx, jaily; /* The coodinates in jailmap to which the player should be sent. */
262	};
263		156
		157	if (flags () & P_PLAYER)
		158	for (op = top; op->type != PLAYER; op = op->below)
		159	;
		160	else
		161	op = 0;
264		162
265	struct shopitems {	163	return op;
		164	}
		165
		166	// return the item volume on this mapspace in cm³
		167	MTH uint64 volume () const;
		168
		169	bool blocks (MoveType mt) const
		170	{
		171	return move_block && (mt & move_block) == mt;
		172	}
		173
		174	bool blocks (object *op) const
		175	{
		176	return blocks (op->move_type);
		177	}
		178	};
		179
		180	// a rectangular area of a map
		181	struct maprect
		182	{
		183	maptile *m;
		184	int x0, y0;
		185	int x1, y1;
		186	int dx, dy; // offset to go from local coordinates to original tile */
		187	};
		188
		189	struct shopitems : zero_initialised
		190	{
266	const char name; / name of the item in question, null if it is the default item */	191	const char name; / name of the item in question, null if it is the default item */
267	const char name_pl; / plural name */	192	const char name_pl; / plural name */
268	int typenum; /* itemtype number we need to match 0 if it is the default price*/	193	int typenum; /* itemtype number we need to match 0 if it is the default price */
269	sint8 strength; /* the degree of specialisation the shop has in this item,	194	sint8 strength; /* the degree of specialisation the shop has in this item,
270	* as a percentage from -100 to 100 */	195	* as a percentage from -100 to 100 */
271	int index; /* being the size of the shopitems array.*/	196	int index; /* being the size of the shopitems array. */
		197	};
		198
		199	// map I/O, what to load/save
		200	enum {
		201	IO_HEADER = 0x01, // the "arch map" pseudo object
		202	IO_OBJECTS = 0x02, // the non-unique objects
		203	IO_UNIQUES = 0x04, // unique objects
272	};	204	};
273		205
274	/* In general, code should always use the macros	206	/* In general, code should always use the macros
275	* above (or functions in map.c) to access many of the	207	* above (or functions in map.c) to access many of the
276	* values in the map structure. Failure to do this will	208	* values in the map structure. Failure to do this will
277	* almost certainly break various features. You may think	209	* almost certainly break various features. You may think
278	* it is safe to look at width and height values directly	210	* it is safe to look at width and height values directly
279	* (or even through the macros), but doing so will completely	211	* (or even through the macros), but doing so will completely
280	* break map tiling.	212	* break map tiling.
281	*/	213	*/
282	struct mapstruct : attachable<mapstruct> {	214	INTERFACE_CLASS (maptile)
283	static data_type get_dt () { return DT_MAP; }	215	struct maptile : zero_initialised, attachable
		216	{
		217	sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
		218	struct mapspace spaces; / Array of spaces on this map */
		219	uint8 regions; / region index per mapspace, if != 0 */
		220	region_ptr regionmap; / index to region */
284		221
285	struct mapstruct next; / Next map, linked list */	222	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
286	char tmpname; / Name of temporary file */	223
287	char name; / Name of map as given by its creator */	224	shstr ACC (RW, name); /* Name of map as given by its creator */
288	struct region region; / What jurisdiction in the game world this map is ruled by	225	region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
289	* points to the struct containing all the properties of	226	* points to the struct containing all the properties of
290	* the region */	227	* the region */
291	uint32 reset_time; /* when this map should reset */	228	double ACC (RW, reset_time);
292	uint32 reset_timeout; /* How many seconds must elapse before this map	229	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
293	* should be reset	230	* should be reset
294	*/	231	*/
		232	bool ACC (RW, dirty); /* if true, something was inserted or removed */
		233	bool ACC (RW, no_reset); // must not reset this map
295	uint32 fixed_resettime:1; /* if true, reset time is not affected by	234	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
296	* players entering/exiting map	235	* players entering/exiting map
297	*/	236	*/
298	uint32 unique:1; /* if set, this is a per player unique map */
299	uint32 safe_map:1; /* if set, this map doesn't allow using magic or harmful stuff in any way */
300	uint32 templatemap:1; /* if set, this is a template map */
301	uint32 nosmooth:1; /* if set the content of this map has smoothlevel=0 forced*/
302	sint32 timeout; /* swapout is set to this */	237	sint32 ACC (RW, timeout); /* swapout is set to this */
303	sint32 swap_time; /* When it reaches 0, the map will be swapped out */	238	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
304	sint16 players; /* How many plares are on this level right now */
305	uint32 in_memory; /* If not true, the map has been freed and must	239	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
306	* be loaded before used. The map,omap and map_ob	240	* be loaded before used. The map,omap and map_ob
307	* arrays will be allocated when the map is loaded */	241	* arrays will be allocated when the map is loaded */
		242	sint16 players; /* How many players are on this map right now */
308	uint16 difficulty; /* What level the player should be to play here */	243	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
309		244
		245	bool ACC (RW, per_player);
		246	bool ACC (RW, per_party);
		247	bool ACC (RW, outdoor); /* True if an outdoor map */
		248	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
310	uint8 darkness; /* indicates level of darkness of map */	249	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
311	uint16 width,height; /* Width and height of map. */	250	static sint8 outdoor_darkness; /* the global darkness level outside */
		251
312	uint16 enter_x; /* enter_x and enter_y are default entrance location */	252	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
313	uint16 enter_y; /* on the map if none are set in the exit */	253	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
314	uint32 outdoor:1; /* True if an outdoor map */
315	oblinkpt buttons; / Linked list of linked lists of buttons */	254	oblinkpt buttons; / Linked list of linked lists of buttons */
316	struct MapSpace spaces; / Array of spaces on this map */
317	sint16 temp; /* base temperature of this tile (F) */	255	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
318	sint16 pressure; /* barometric pressure (mb) */	256	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
319	sint8 humid; /* humitidy of this tile */	257	sint8 ACC (RW, humid); /* humitidy of this tile */
320	sint8 windspeed; /* windspeed of this tile */	258	sint8 ACC (RW, windspeed); /* windspeed of this tile */
321	sint8 winddir; /* direction of wind */	259	sint8 ACC (RW, winddir); /* direction of wind */
322	sint8 sky; /* sky conditions */	260	sint8 ACC (RW, sky); /* sky conditions */
323	int wpartx,wparty; /Highly fasten conversion between worldmap and weathermap/	261	int ACC (RW, worldpartx), ACC (RW, worldparty); /Highly fasten conversion between worldmap and weathermap /
324	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */	262	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */
325	char shoprace; / the preffered race of the local shopkeeper */	263	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
326	double shopgreed; /* how much our shopkeeper overcharges */	264	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
327	uint64 shopmin; /* minimum price a shop will trade for */	265	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
328	uint64 shopmax; /* maximum price a shop will offer */	266	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
329	char msg; / Message map creator may have left */	267	shstr ACC (RW, msg); /* Message map creator may have left */
330	char maplore; / Map lore information */	268	shstr ACC (RW, maplore); /* Map lore information */
331	char tile_path[4]; / path to adjoining maps */	269	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
332	struct mapstruct tile_map[4]; / Next map, linked list */	270	maptile ACC (RW, tile_map[4]); / Next map, linked list */
333	char path[HUGE_BUF]; /* Filename of the map */	271	shstr ACC (RW, path); /* Filename of the map */
		272	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
		273	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
		274
		275	// the maptile:: is neccessary here for the perl interface to work
		276	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		277	{
		278	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		279	}
		280
		281	static void adjust_daylight ();
		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 do_decay_objects ();
		293	MTH void update_buttons ();
		294	MTH int change_map_light (int change);
		295	MTH int estimate_difficulty () const;
		296
		297	MTH void play_sound (faceidx sound, int x, int y) 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	MTH void post_load_original ();
		302
		303	MTH void link_multipart_objects ();
		304	MTH void clear_unique_items ();
		305
		306	MTH void clear_header ();
		307	MTH void clear_links_to (maptile *m);
		308
		309	MTH struct region *region (int x, int y) const;
		310
		311	// load the header pseudo-object
		312	bool _load_header (object_thawer &thawer);
		313	MTH bool _load_header (object_thawer thawer) { return _load_header (thawer); }
		314
		315	// load objects into the map
		316	bool _load_objects (object_thawer &thawer);
		317	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
		318
		319	// save objects into the given file (uses IO_ flags)
		320	bool _save_objects (object_freezer &freezer, int flags);
		321	MTH bool _save_objects (const char *path, int flags);
		322
		323	// save the header pseudo object _only_
		324	bool _save_header (object_freezer &freezer);
		325	MTH bool _save_header (const char *path);
		326
		327	maptile ();
		328	maptile (int w, int h);
		329	~maptile ();
		330
		331	void do_destroy ();
		332	void gather_callbacks (AV *&callbacks, event_type event) const;
		333
		334	MTH int size () const { return width * height; }
		335
		336	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
		337
		338	MTH void touch () { last_access = runtime; }
		339
		340	MTH maptile *tile_available (int dir, bool load = true);
		341
		342	// find the map that is at coordinate x\|y relative to this map
		343	// TODO: need a better way than passing by reference
		344	// TODO: make perl interface
		345	maptile *xy_find (sint16 &x, sint16 &y);
		346
		347	// like xy_find, but also loads the map
		348	maptile *xy_load (sint16 &x, sint16 &y);
		349
		350	void do_load_sync ();//PERL
		351
		352	// make sure the map is loaded
		353	MTH void load_sync ()
		354	{
		355	if (!spaces)
		356	do_load_sync ();
		357	}
		358
		359	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);
		360	bool generate_random_map (random_map_params *RP);
		361
		362	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL
		363	static maptile find_sync (const char path, maptile *original = 0);//PERL
		364	static maptile find_style_sync (const char dir, const char *file = 0);//PERL
		365	object *pick_random_object (rand_gen &gen = rndm) const;
		366
		367	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
		368
		369	// return an array of maprects corresponding
		370	// to the given rectangular area. the last rect will have
		371	// a 0 map pointer.
		372	// the array will be stored in a static memory area,
		373	// so recursion is not atm. supported
		374	maprect *split_to_tiles (int x0, int y0, int x1, int y1);
334	};	375	};
335		376
336	/* This is used by get_rangevector to determine where the other	377	/* This is used by get_rangevector to determine where the other
337	* creature is. get_rangevector takes into account map tiling,	378	* creature is. get_rangevector takes into account map tiling,
338	* so you just can not look the the map coordinates and get the	379	* so you just can not look the the map coordinates and get the
339	* righte value. distance_x/y are distance away, which	380	* righte value. distance_x/y are distance away, which
340	* can be negativbe. direction is the crossfire direction scheme	381	* can be negative. direction is the crossfire direction scheme
341	* that the creature should head. part is the part of the	382	* that the creature should head. part is the part of the
342	* monster that is closest.	383	* monster that is closest.
343	* Note: distance should be always >=0. I changed it to UINT. MT	384	* Note: distance should be always >=0. I changed it to UINT. MT
344	*/	385	*/
345	struct rv_vector {	386	struct rv_vector
		387	{
346	unsigned int distance;	388	unsigned int distance;
347	int distance_x;	389	int distance_x;
348	int distance_y;	390	int distance_y;
349	int direction;	391	int direction;
350	object *part;	392	object *part;
351	};	393	};
		394
		395	// comaptibility cruft start
		396	//TODO: these should be refactored into things like xy_normalise
		397	// and so on.
		398	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
		399	int out_of_map (maptile *m, int x, int y);
		400	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
		401	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
		402	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);
		403	int on_same_map (const object op1, const object op2);
		404	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);
		405
		406	// adjust map, x and y for tiled maps and return true if the position is valid at all
		407	static inline bool
		408	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
		409	{
		410	// when in range, do a quick return, otherwise go the slow route
		411	return
		412	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
		413	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
		414	}
		415	// comaptibility cruft end
		416
		417	inline mapspace &
		418	object::ms () const
		419	{
		420	return map->at (x, y);
		421	}
		422
		423	struct mapxy {
		424	maptile *m;
		425	sint16 x, y;
		426
		427	mapxy (maptile *m, sint16 x, sint16 y)
		428	: m(m), x(x), y(y)
		429	{ }
		430
		431	mapxy (object *op)
		432	: m(op->map), x(op->x), y(op->y)
		433	{ }
		434
		435	mapxy &move (int dx, int dy)
		436	{
		437	x += dx;
		438	y += dy;
		439
		440	return *this;
		441	}
		442
		443	mapxy &move (int dir)
		444	{
		445	return move (freearr_x [dir], freearr_y [dir]);
		446	}
		447
		448	operator void () const { return (void )m; }
		449	mapxy &operator =(const object *op)
		450	{
		451	m = op->map;
		452	x = op->x;
		453	y = op->y;
		454
		455	return *this;
		456	}
		457
		458	mapspace *operator ->() const { return &m->at (x, y); }
		459	mapspace &operator * () const { return m->at (x, y); }
		460
		461	bool normalise ()
		462	{
		463	return xy_normalise (m, x, y);
		464	}
		465
		466	mapspace &ms () const
		467	{
		468	return m->at (x, y);
		469	}
		470
		471	object insert (object op, object *originator = 0, int flags = 0) const
		472	{
		473	return m->insert (op, x, y, originator, flags);
		474	}
		475	};
		476
		477	inline const mapxy &
		478	object::operator =(const mapxy &pos)
		479	{
		480	map = pos.m;
		481	x = pos.x;
		482	y = pos.y;
		483
		484	return pos;
		485	}
		486
		487	// iterate over a rectangular area relative to op
		488	// can be used as a single statement, but both iterate macros
		489	// invocations must not be followed by a ";"
		490	// see common/los.C for usage example
		491	// the walk will be ordered, outer loop x, inner loop y
		492	// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
		493	#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
		494	for (int dx = (dx0); dx <= (dx1); ++dx) \
		495	{ \
		496	sint16 nx, ny; \
		497	maptile *m = 0; \
		498	\
		499	for (int dy = (dy0); dy <= (dy1); ++dy) \
		500	{ \
		501	/* check to see if we can simply go one down quickly, */ \
		502	/* if not, do it the slow way */ \
		503	if (!m \|\| ++ny >= m->height) \
		504	{ \
		505	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		506	\
		507	if (xy_normalise (m, nx, ny)) \
		508	m->touch (); \
		509	else \
		510	m = 0; \
		511	}
		512
		513	#define ordered_mapwalk_end \
		514	} \
		515	}
		516
		517	// loop over every space in the given maprect,
		518	// setting m, nx, ny to the map and -coordinate and dx, dy to the offste relative to dx0,dy0
		519	// the iterator code must be a single statement following this macro call, similar to "if"
		520	#define rect_mapwalk(rect,dx0,dy0) \
		521	statementvar (maptile *, m, (rect)->m) \
		522	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
		523	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
		524	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
		525	statementvar (int, dy, ny + (rect)->dy - (dy0))
		526
		527	// same as above, but the walk will not follow any particular
		528	// order (unorded), but is likely faster.
		529	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
		530	#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \
		531	for (maprect *r_e_c_t = (op)->map->split_to_tiles ( \
		532	(op)->x + (dx0) , (op)->y + (dy0) , \
		533	(op)->x + (dx1) + 1, (op)->y + (dy1) + 1); \
		534	r_e_c_t->m; \
		535	++r_e_c_t) \
		536	rect_mapwalk (r_e_c_t, (op)->x, (op)->y)
352		537
353	#endif	538	#endif
		539

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.14 by elmex, Tue Aug 29 09:27:58 2006 UTC vs. Revision 1.104 by root, Fri Dec 26 10:36:42 2008 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.14 by elmex, Tue Aug 29 09:27:58 2006 UTC vs.
Revision 1.104 by root, Fri Dec 26 10:36:42 2008 UTC