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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.16 by root, Thu Aug 31 09:19:34 2006 UTC vs.
Revision 1.62 by root, Mon Jan 29 15:04:21 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.16 by root, Thu Aug 31 09:19:34 2006 UTC vs. Revision 1.62 by root, Mon Jan 29 15:04:21 2007 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.16 by root, Thu Aug 31 09:19:34 2006 UTC vs.
Revision 1.62 by root, Mon Jan 29 15:04:21 2007 UTC