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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.19 by root, Fri Sep 8 16:51:44 2006 UTC vs.
Revision 1.117 by root, Sun Nov 8 15:11:23 2009 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.19 2006/09/08 16:51:44 root 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 it under
		9	* the terms of the Affero GNU General Public License as published by the
		10	* Free Software Foundation, either version 3 of the License, or (at your
		11	* 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 Affero GNU General Public License
		19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
		21	*
		22	* The authors can be reached via e-mail to <support@deliantra.net>
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	//+GPL
		36
		37	#include "region.h"
37	#include "cfperl.h"	38	#include "cfperl.h"
38		39
39	/* We set this size - this is to make magic map work properly on	40	/* We set this size - this is to make magic map work properly on
40	* tiled maps. There is no requirement that this matches the	41	* tiled maps. There is no requirement that this matches the
41	* tiled maps size - it just seemed like a reasonable value.	42	* tiled maps size - it just seemed like a reasonable value.
42	* Magic map code now always starts out putting the player in the	43	* Magic map code now always starts out putting the player in the
43	* center of the map - this makes the most sense when dealing	44	* center of the map - this makes the most sense when dealing
44	* with tiled maps.	45	* with tiled maps.
45	* We also figure out the magicmap color to use as we process the	46	* We also figure out the magicmap color to use as we process the
47	* map pointers.	48	* map pointers.
48	*/	49	*/
49	#define MAGIC_MAP_SIZE 50	50	#define MAGIC_MAP_SIZE 50
50	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2	51	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
51		52
52
53	#define MAP_LAYERS 4	53	#define MAP_LAYERS 3
54		54
55	/* This is when the map will reset */	55	// tile map index
56	#define MAP_WHEN_RESET(m) ((m)->reset_time)	56	enum {
		57	TILE_UP = 0,
		58	TILE_RIGHT = 1,
		59	TILE_DOWN = 2,
		60	TILE_LEFT = 3,
		61	};
57		62
58	#define MAP_RESET_TIMEOUT(m) ((m)->reset_timeout)	63	/* Values for in_memory below */
59	#define MAP_DIFFICULTY(m) ((m)->difficulty)	64	enum {
60	#define MAP_TIMEOUT(m) ((m)->timeout)	65	MAP_ACTIVE,
61	#define MAP_SWAP_TIME(m) ((m)->swap_time)	66	MAP_INACTIVE, // not used atm.
62	#define MAP_OUTDOORS(m) ((m)->outdoor)	67	MAP_SWAPPED,
63		68	MAP_LOADING,
64	/* mape darkness used to enforce the MAX_DARKNESS value.	69	MAP_SAVING,
65	* but IMO, if it is beyond max value, that should be fixed	70	};
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		71
103	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	72	/* 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	73	* 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	74	* where it is known the map is not tiled or the values are known
106	* consistent (eg, op->map, op->x, op->y)	75	* consistent (eg, op->map, op->x, op->y)
107	*/	76	*/
108	#define GET_MAP_FLAGS(M,X,Y) ( (M)->spaces[(X) + (M)->width * (Y)].flags )	77	// all those macros are herewith declared legacy
109	#define SET_MAP_FLAGS(M,X,Y,C) ( (M)->spaces[(X) + (M)->width * (Y)].flags = C )	78	#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 )	79	#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 )	80	#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] )	81	#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 )	82	#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 )	83	#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 )	84	#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 )	85	#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		86
140	/* You should really know what you are doing before using this - you	87	/* 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	88	* should almost always be using out_of_map instead, which takes into account
142	* map tiling.	89	* map tiling.
143	*/	90	*/
144	#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 \|\| (Y)<0 \|\| (X)>=(M)->width \|\| (Y)>=(M)->height)	91	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
145		92
146	/* These are used in the MapLook flags element. They are not used in	93	/* These are used in the MapLook flags element. They are not used in
147	* in the object flags structure.	94	* in the object flags structure.
148	*/	95	*/
149
150	#define P_BLOCKSVIEW 0x01	96	#define P_BLOCKSVIEW 0x01
151	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */	97	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
152		98	#define P_NO_CLERIC 0x04 /* no clerical spells cast here */
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,	99	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,
163	* that means, nothing harmful there will be done,	100	* that means, nothing harmful can be done,
164	* like: bombs, potion usage, alchemy, spells	101	* such as: bombs, potion usage, alchemy, spells
165	* this was introduced to make shops more safe	102	* this was introduced to make shops safer
166	* and propably other maps */	103	* but is useful in other situations */
		104
		105	#define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */
167	#define P_IS_ALIVE 0x10 /* something alive is on this space */	106	#define P_IS_ALIVE 0x20 /* something alive is on this space */
168	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
169	#define P_NEED_UPDATE 0x40 /* this space is out of date */	107	#define P_UPTODATE 0x80 // this space is up to date
170	#define P_NO_ERROR 0x80 /* Purely temporary - if set, update_position	108
171	* does not complain if the flags are different.
172	*/
173	/* The following two values are not stored in the MapLook flags, but instead	109	/* 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	110	* 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	111	* 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	112	* function that does more of the work can hopefully be used to replace
177	* lots of duplicate checks currently in the code.	113	* lots of duplicate checks currently in the code.
178	*/	114	*/
179	#define P_OUT_OF_MAP 0x100 /* This space is outside the map */	115	#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 */	116	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
181		117
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	118	/* Instead of having numerous arrays that have information on a
192	* particular space (was map, floor, floor2, map_ob),	119	* particular space (was map, floor, floor2, map_ob),
193	* have this structure take care of that information.	120	* have this structure take care of that information.
194	* This puts it all in one place, and should also make it easier	121	* This puts it all in one place, and should also make it easier
195	* to extend information about a space.	122	* to extend information about a space.
196	*/	123	*/
197		124	INTERFACE_CLASS (mapspace)
198	struct MapSpace {	125	struct mapspace
199	object bottom; / lowest object on this space */	126	{
200	object top; / Highest object on this space */	127	object *ACC (RW, bot);
201	New_Face faces[MAP_LAYERS]; / faces for the 3 layers */	128	object ACC (RW, top); / lowest/highest object on this space */
202	object faces_obj[MAP_LAYERS]; / face objects for the 3 layers */	129	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) */	130	uint8 flags_; /* flags about this space (see the P_ values above) */
204	sint8 light; /* How much light this space provides */	131	sint8 ACC (RW, light); /* How much light this space provides */
205	MoveType move_block; /* What movement types this space blocks */	132	MoveType ACC (RW, move_block); /* What movement types this space blocks */
206	MoveType move_slow; /* What movement types this space slows */	133	MoveType ACC (RW, move_slow); /* What movement types this space slows */
207	MoveType move_on; /* What movement types are activated */	134	MoveType ACC (RW, move_on); /* What movement types are activated */
208	MoveType move_off; /* What movement types are activated */	135	MoveType ACC (RW, move_off); /* What movement types are activated */
209	};	136	uint16_t ACC (RW, nrof_); // saturates at 64k
		137	uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
		138	uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
		139	static uint32_t ACC (RW, smellcount); // global smell counter
210		140
211	/*	141	uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems
212	* this is an overlay structure of the whole world. It exists as a simple
213	* high level map, which doesn't contain the full data of the underlying map.
214	* in this map, only things such as weather are recorded. By doing so, we
215	* can keep the entire world parameters in memory, and act as a whole on
216	* them at once. We can then, in a separate loop, update the actual world
217	* with the new values we have assigned.
218	*/
219		142
220	struct weathermap_t {	143	//-GPL
221	sint16 temp; /* base temperature of this tile (F) */
222	sint16 pressure; /* barometric pressure (mb) */
223	sint8 humid; /* humitidy of this tile */
224	sint8 windspeed; /* windspeed of this tile */
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		144
235	/*	145	void update_ ();
236	* Each map is in a given region of the game world and links to a region definiton, so	146	MTH void update ()
237	* they have to appear here in the headers, before the mapdef	147	{
238	*/	148	// we take advantage of the fact that 0x80 is the sign bit
239	struct region {	149	// to generate more efficient code on many cpus
240	struct region next; / pointer to next region, NULL for the last one */	150	assert (P_UPTODATE == 0x80);
241	const char name; / Shortend name of the region as maps refer to it */
242	const char parent_name; /
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		151
		152	if (expect_false (sint8 (flags_) < 0))
		153	update_ ();
		154
		155	// must be true by now
		156	assume (sint8 (flags_) < 0);
		157	assume (flags_ & P_UPTODATE);
		158	}
		159
		160	MTH uint8 flags ()
		161	{
		162	update ();
		163	return flags_;
		164	}
		165
		166	MTH void invalidate ()
		167	{
		168	flags_ = 0;
		169	}
		170
		171	MTH object *player ()
		172	{
		173	object *op;
		174
		175	if (flags () & P_PLAYER)
		176	for (op = top; op->type != PLAYER; op = op->below)
		177	;
		178	else
		179	op = 0;
		180
		181	return op;
		182	}
		183
		184	MTH uint32 nrof ()
		185	{
		186	update ();
		187	return nrof_;
		188	}
		189
		190	// return the item volume on this mapspace in cm³
		191	MTH uint64 volume ()
		192	{
		193	update ();
		194	return volume_ * 1024;
		195	}
		196
		197	bool blocks (MoveType mt) const
		198	{
		199	return move_block && (mt & move_block) == mt;
		200	}
		201
		202	bool blocks (object *op) const
		203	{
		204	return blocks (op->move_type);
		205	}
		206	};
		207
		208	// a rectangular area of a map
		209	struct maprect
		210	{
		211	maptile *m;
		212	int x0, y0;
		213	int x1, y1;
		214	int dx, dy; // offset to go from local coordinates to original tile */
		215	};
		216
		217	//+GPL
264		218
265	struct shopitems : zero_initialised	219	struct shopitems : zero_initialised
266	{	220	{
267	const char name; / name of the item in question, null if it is the default item */	221	const char name; / name of the item in question, null if it is the default item */
268	const char name_pl; / plural name */	222	const char name_pl; / plural name */
269	int typenum; /* itemtype number we need to match 0 if it is the default price*/	223	int typenum; /* itemtype number we need to match 0 if it is the default price */
270	sint8 strength; /* the degree of specialisation the shop has in this item,	224	sint8 strength; /* the degree of specialisation the shop has in this item,
271	* as a percentage from -100 to 100 */	225	* as a percentage from -100 to 100 */
272	int index; /* being the size of the shopitems array.*/	226	int index; /* being the size of the shopitems array. */
		227	};
		228
		229	// map I/O, what to load/save
		230	enum {
		231	IO_HEADER = 0x01, // the "arch map" pseudo object
		232	IO_OBJECTS = 0x02, // the non-unique objects
		233	IO_UNIQUES = 0x04, // unique objects
273	};	234	};
274		235
275	/* In general, code should always use the macros	236	/* In general, code should always use the macros
276	* above (or functions in map.c) to access many of the	237	* above (or functions in map.c) to access many of the
277	* values in the map structure. Failure to do this will	238	* values in the map structure. Failure to do this will
278	* almost certainly break various features. You may think	239	* almost certainly break various features. You may think
279	* it is safe to look at width and height values directly	240	* it is safe to look at width and height values directly
280	* (or even through the macros), but doing so will completely	241	* (or even through the macros), but doing so will completely
281	* break map tiling.	242	* break map tiling.
282	*/	243	*/
283	ACC_CLASS (mapstruct)	244	INTERFACE_CLASS (maptile)
284	struct mapstruct : zero_initialised, attachable<mapstruct>	245	struct maptile : zero_initialised, attachable
285	{	246	{
286	struct mapstruct ACC (RW, next); / Next map, linked list */	247	sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
287	char ACC (RO, tmpname); / Name of temporary file */	248	struct mapspace spaces; / Array of spaces on this map */
		249	uint8 regions; / region index per mapspace, if != 0 */
		250	region_ptr regionmap; / index to region */
		251
		252	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
		253
288	char ACC (RO, name); / Name of map as given by its creator */	254	shstr ACC (RW, name); /* Name of map as given by its creator */
289	struct region ACC (RW, region); / What jurisdiction in the game world this map is ruled by	255	region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
290	* points to the struct containing all the properties of	256	* points to the struct containing all the properties of
291	* the region */	257	* the region */
292	uint32 ACC (RW, reset_time); /* when this map should reset */	258	double ACC (RW, reset_time);
293	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map	259	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
294	* should be reset	260	* should be reset
295	*/	261	*/
		262	bool ACC (RW, dirty); /* if true, something was inserted or removed */
		263	bool ACC (RW, no_reset); // must not reset this map
296	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by	264	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
297	* players entering/exiting map	265	* players entering/exiting map
298	*/	266	*/
299	bool ACC (RW, unique); /* if set, this is a per player unique map */
300	bool ACC (RW, templatemap); /* if set, this is a template map */
301	bool ACC (RW, nosmooth); /* if set the content of this map has smoothlevel=0 forced*/
302	sint32 ACC (RW, timeout); /* swapout is set to this */	267	sint32 ACC (RW, timeout); /* swapout is set to this */
303	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */	268	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
304	sint16 ACC (RW, players); /* How many plares are on this level right now */
305	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must	269	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	270	* be loaded before used. The map,omap and map_ob
307	* arrays will be allocated when the map is loaded */	271	* arrays will be allocated when the map is loaded */
		272	sint16 players; /* How many players are on this map right now */
308	uint16 ACC (RW, difficulty); /* What level the player should be to play here */	273	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
309		274
310	uint8 ACC (RW, darkness); /* indicates level of darkness of map */	275	bool ACC (RW, per_player);
311	uint16 ACC (RO, width), ACC (RO, height); /* Width and height of map. */	276	bool ACC (RW, per_party);
312	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
313	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
314	bool ACC (RW, outdoor); /* True if an outdoor map */	277	bool ACC (RW, outdoor); /* True if an outdoor map */
		278	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
		279	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
		280	static sint8 outdoor_darkness; /* the global darkness level outside */
		281
		282	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
		283	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
315	oblinkpt buttons; / Linked list of linked lists of buttons */	284	oblinkpt buttons; / Linked list of linked lists of buttons */
316	struct MapSpace spaces; / Array of spaces on this map */
317	sint16 ACC (RW, temp); /* base temperature of this tile (F) */	285	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
318	sint16 ACC (RW, pressure); /* barometric pressure (mb) */	286	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
319	sint8 ACC (RW, humid); /* humitidy of this tile */	287	sint8 ACC (RW, humid); /* humitidy of this tile */
320	sint8 ACC (RW, windspeed); /* windspeed of this tile */	288	sint8 ACC (RW, windspeed); /* windspeed of this tile */
321	sint8 ACC (RW, winddir); /* direction of wind */	289	sint8 ACC (RW, winddir); /* direction of wind */
322	sint8 ACC (RW, sky); /* sky conditions */	290	sint8 ACC (RW, sky); /* sky conditions */
323	int ACC (RW, wpartx), ACC (RW, wparty); /Highly fasten conversion between worldmap and weathermap/	291	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 */	292	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */
325	char ACC (RO, shoprace); / the preffered race of the local shopkeeper */	293	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
326	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	294	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
327	uint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	295	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
328	uint64 ACC (RW, shopmax); /* maximum price a shop will offer */	296	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
329	char ACC (RO, msg); / Message map creator may have left */	297	shstr ACC (RW, msg); /* Message map creator may have left */
330	char ACC (RO, maplore); / Map lore information */	298	shstr ACC (RW, maplore); /* Map lore information */
331	char tile_path[4]; / path to adjoining maps */	299	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
332	struct mapstruct tile_map[4]; / Next map, linked list */	300	maptile ACC (RW, tile_map[4]); / Next map, linked list */
333	char ACC (RW, path)[HUGE_BUF]; /* Filename of the map */	301	shstr ACC (RW, path); /* Filename of the map */
		302	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
		303	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
		304	int ACC (RW, max_items); // maximum number of items on a mapspace
		305
		306	//-GPL
		307
		308	// the maptile:: is neccessary here for the perl interface to work
		309	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		310	{
		311	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		312	}
		313
		314	static void adjust_daylight ();
		315
		316	MTH void activate ();
		317	MTH void deactivate ();
		318
		319	// allocates all (empty) mapspace
		320	MTH void alloc ();
		321	// deallocates the mapspaces (and destroys all objects)
		322	MTH void clear ();
		323
		324	MTH void fix_auto_apply ();
		325	MTH void do_decay_objects ();
		326	MTH void update_buttons ();
		327	MTH int change_map_light (int change);
		328	MTH int estimate_difficulty () const;
		329
		330	MTH void play_sound (faceidx sound, int x, int y) const;
		331	MTH void say_msg (const char *msg, int x, int y) const;
		332
		333	// connected links
		334	oblinkpt *find_link (shstr_tmp id);
		335	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);
		336
		337	// set the given flag on all objects in the map
		338	MTH void set_object_flag (int flag, int value = 1);
		339	MTH void post_load_original ();
		340
		341	MTH void link_multipart_objects ();
		342	MTH void clear_unique_items ();
		343
		344	MTH void clear_header ();
		345	MTH void clear_links_to (maptile *m);
		346
		347	MTH struct region *region (int x, int y) const;
		348
		349	// load the header pseudo-object
		350	bool _load_header (object_thawer &thawer);
		351	MTH bool _load_header (object_thawer thawer) { return _load_header (thawer); }
		352
		353	// load objects into the map
		354	bool _load_objects (object_thawer &thawer);
		355	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
		356
		357	// save objects into the given file (uses IO_ flags)
		358	bool _save_objects (object_freezer &freezer, int flags);
		359	MTH bool _save_objects (const char *path, int flags);
		360
		361	// save the header pseudo object _only_
		362	bool _save_header (object_freezer &freezer);
		363	MTH bool _save_header (const char *path);
		364
		365	maptile ();
		366	maptile (int w, int h);
		367	~maptile ();
		368
		369	void do_destroy ();
		370	void gather_callbacks (AV *&callbacks, event_type event) const;
		371
		372	MTH int size () const { return width * height; }
		373
		374	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
		375
		376	MTH void touch () { last_access = runtime; }
		377
		378	MTH maptile *tile_available (int dir, bool load = true);
		379
		380	// find the map that is at coordinate x\|y relative to this map
		381	// TODO: need a better way than passing by reference
		382	// TODO: make perl interface
		383	maptile *xy_find (sint16 &x, sint16 &y);
		384
		385	// like xy_find, but also loads the map
		386	maptile *xy_load (sint16 &x, sint16 &y);
		387
		388	void do_load_sync ();//PERL
		389
		390	// make sure the map is loaded
		391	MTH void load_sync ()
		392	{
		393	if (!spaces)
		394	do_load_sync ();
		395	}
		396
		397	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);
		398	bool generate_random_map (random_map_params *RP);
		399
		400	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL
		401	static maptile find_sync (const char path, maptile *original = 0);//PERL
		402	static maptile find_style_sync (const char dir, const char *file = 0);//PERL
		403	object *pick_random_object (rand_gen &gen = rndm) const;
		404
		405	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
		406
		407	// return an array of maprects corresponding
		408	// to the given rectangular area. the last rect will have
		409	// a 0 map pointer.
		410	// the array will be stored in a static memory area,
		411	// so recursion is not atm. supported
		412	maprect *split_to_tiles (int x0, int y0, int x1, int y1);
334	};	413	};
		414
		415	//+GPL
335		416
336	/* This is used by get_rangevector to determine where the other	417	/* This is used by get_rangevector to determine where the other
337	* creature is. get_rangevector takes into account map tiling,	418	* creature is. get_rangevector takes into account map tiling,
338	* so you just can not look the the map coordinates and get the	419	* so you just can not look the the map coordinates and get the
339	* righte value. distance_x/y are distance away, which	420	* righte value. distance_x/y are distance away, which
340	* can be negativbe. direction is the crossfire direction scheme	421	* can be negative. direction is the crossfire direction scheme
341	* that the creature should head. part is the part of the	422	* that the creature should head. part is the part of the
342	* monster that is closest.	423	* monster that is closest.
343	* Note: distance should be always >=0. I changed it to UINT. MT	424	* Note: distance should be always >=0. I changed it to UINT. MT
344	*/	425	*/
345	struct rv_vector {	426	struct rv_vector
		427	{
346	unsigned int distance;	428	unsigned int distance;
347	int distance_x;	429	int distance_x;
348	int distance_y;	430	int distance_y;
349	int direction;	431	int direction;
350	object *part;	432	object *part;
351	};	433	};
		434
		435	// comaptibility cruft start
		436	//TODO: these should be refactored into things like xy_normalise
		437	// and so on.
		438	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
		439	int out_of_map (maptile *m, int x, int y);
		440	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
		441	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
		442	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector retval, int flags = 0 /unused*/);
		443	int on_same_map (const object op1, const object op2);
		444	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);
		445
		446	// adjust map, x and y for tiled maps and return true if the position is valid at all
		447	static inline bool
		448	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
		449	{
		450	// when in range, do a quick return, otherwise go the slow route
		451	return
		452	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
		453	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
		454	}
		455	// comaptibility cruft end
		456
		457	//-GPL
		458
		459	inline mapspace &
		460	object::ms () const
		461	{
		462	return map->at (x, y);
		463	}
		464
		465	struct mapxy {
		466	maptile *m;
		467	sint16 x, y;
		468
		469	mapxy (maptile *m, sint16 x, sint16 y)
		470	: m(m), x(x), y(y)
		471	{ }
		472
		473	mapxy (object *op)
		474	: m(op->map), x(op->x), y(op->y)
		475	{ }
		476
		477	mapxy &move (int dx, int dy)
		478	{
		479	x += dx;
		480	y += dy;
		481
		482	return *this;
		483	}
		484
		485	mapxy &move (int dir)
		486	{
		487	return move (freearr_x [dir], freearr_y [dir]);
		488	}
		489
		490	operator void () const { return (void )m; }
		491	mapxy &operator =(const object *op)
		492	{
		493	m = op->map;
		494	x = op->x;
		495	y = op->y;
		496
		497	return *this;
		498	}
		499
		500	mapspace *operator ->() const { return &m->at (x, y); }
		501	mapspace &operator * () const { return m->at (x, y); }
		502
		503	bool normalise ()
		504	{
		505	return xy_normalise (m, x, y);
		506	}
		507
		508	mapspace &ms () const
		509	{
		510	return m->at (x, y);
		511	}
		512
		513	object insert (object op, object *originator = 0, int flags = 0) const
		514	{
		515	return m->insert (op, x, y, originator, flags);
		516	}
		517	};
		518
		519	inline const mapxy &
		520	object::operator =(const mapxy &pos)
		521	{
		522	map = pos.m;
		523	x = pos.x;
		524	y = pos.y;
		525
		526	return pos;
		527	}
		528
		529	// iterate over a rectangular area relative to op
		530	// can be used as a single statement, but both iterate macros
		531	// invocations must not be followed by a ";"
		532	// see common/los.C for usage example
		533	// the walk will be ordered, outer loop x, inner loop y
		534	// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
		535	// "continue" will skip to the next space
		536	#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
		537	for (int dx = (dx0); dx <= (dx1); ++dx) \
		538	{ \
		539	sint16 nx, ny; \
		540	maptile *m = 0; \
		541	\
		542	for (int dy = (dy0); dy <= (dy1); ++dy) \
		543	{ \
		544	/* check to see if we can simply go one down quickly, */ \
		545	/* if not, do it the slow way */ \
		546	if (!m \|\| ++ny >= m->height) \
		547	{ \
		548	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		549	\
		550	if (!xy_normalise (m, nx, ny)) \
		551	m = 0; \
		552	}
		553
		554	#define ordered_mapwalk_end \
		555	} \
		556	}
		557
		558	// loop over every space in the given maprect,
		559	// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
		560	// the iterator code must be a single statement following this macro call, similar to "if"
		561	// "continue" will skip to the next space
		562	#define rect_mapwalk(rect,dx0,dy0) \
		563	statementvar (maptile *, m, (rect)->m) \
		564	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
		565	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
		566	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
		567	statementvar (int, dy, ny + (rect)->dy - (dy0))
		568
		569	// same as ordered_mapwalk, but the walk will not follow any particular
		570	// order (unorded), but is likely faster.
		571	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
		572	// "continue" will skip to the next space
		573	#define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \
		574	for (maprect *r_e_c_t = (map)->split_to_tiles ( \
		575	(ox) + (dx0) , (oy) + (dy0) , \
		576	(ox) + (dx1) + 1, (oy) + (dy1) + 1); \
		577	r_e_c_t->m; \
		578	++r_e_c_t) \
		579	rect_mapwalk (r_e_c_t, (ox), (oy))
		580
		581	#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \
		582	unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1)
352		583
353	#endif	584	#endif
354		585

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.19 by root, Fri Sep 8 16:51:44 2006 UTC vs. Revision 1.117 by root, Sun Nov 8 15:11:23 2009 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.19 by root, Fri Sep 8 16:51:44 2006 UTC vs.
Revision 1.117 by root, Sun Nov 8 15:11:23 2009 UTC