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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.22 by root, Sun Dec 3 01:11:23 2006 UTC vs.
Revision 1.119 by root, Sun Nov 8 16:14:28 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.22 by root, Sun Dec 3 01:11:23 2006 UTC vs. Revision 1.119 by root, Sun Nov 8 16:14:28 2009 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.22 by root, Sun Dec 3 01:11:23 2006 UTC vs.
Revision 1.119 by root, Sun Nov 8 16:14:28 2009 UTC