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

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

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.1.1.2 by elmex, Wed Feb 22 18:01:58 2006 UTC vs. Revision 1.144 by root, Sat May 7 17:12:28 2011 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.1.1.2 by elmex, Wed Feb 22 18:01:58 2006 UTC vs.
Revision 1.144 by root, Sat May 7 17:12:28 2011 UTC