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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.81 by root, Wed Aug 1 01:53:13 2007 UTC vs.
Revision 1.103 by root, Tue Dec 23 22:03:06 2008 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	* the Free Software Foundation, either version 3 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* 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,
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	22	*/
23		23
24	/*	24	/*
25	* The maptile is allocated each time a new map is opened.	25	* The maptile is allocated each time a new map is opened.
26	* It contains pointers (very indirectly) to all objects on the map.	26	* It contains pointers (very indirectly) to all objects on the map.
…		…
47	#define MAGIC_MAP_SIZE 50	47	#define MAGIC_MAP_SIZE 50
48	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2	48	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
49		49
50	#define MAP_LAYERS 3	50	#define MAP_LAYERS 3
51		51
52	/* Values for in_memory below. Should probably be an enumerations */	52	/* Values for in_memory below */
53	enum {	53	enum {
54	MAP_IN_MEMORY,	54	MAP_ACTIVE,
		55	MAP_INACTIVE, // not used atm.
55	MAP_SWAPPED,	56	MAP_SWAPPED,
56	MAP_LOADING,	57	MAP_LOADING,
57	MAP_SAVING,	58	MAP_SAVING,
58	};	59	};
59		60
…		…
62	* where it is known the map is not tiled or the values are known	63	* where it is known the map is not tiled or the values are known
63	* consistent (eg, op->map, op->x, op->y)	64	* consistent (eg, op->map, op->x, op->y)
64	*/	65	*/
65	// all those macros are herewith declared legacy	66	// all those macros are herewith declared legacy
66	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()	67	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
67	#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
68	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot	68	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
69	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top	69	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
70	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]	70	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
71	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block	71	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
72	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow	72	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
…		…
103	*/	103	*/
104	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */	104	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
105	#define P_NEW_MAP 0x20000	105	#define P_NEW_MAP 0x20000
106	/* Coordinates passed result in a new tiled map */	106	/* Coordinates passed result in a new tiled map */
107		107
108	/* P_NO_PASS is used for ob_blocked() return value. It needs
109	* to be here to make sure the bits don't match with anything.
110	*/
111	#define P_NO_PASS 0x80000
112
113	/* Instead of having numerous arrays that have information on a	108	/* Instead of having numerous arrays that have information on a
114	* particular space (was map, floor, floor2, map_ob),	109	* particular space (was map, floor, floor2, map_ob),
115	* have this structure take care of that information.	110	* have this structure take care of that information.
116	* This puts it all in one place, and should also make it easier	111	* This puts it all in one place, and should also make it easier
117	* to extend information about a space.	112	* to extend information about a space.
118	*/	113	*/
		114	INTERFACE_CLASS (mapspace)
119	struct mapspace	115	struct mapspace
120	{	116	{
		117	object *ACC (RW, bot);
121	object bot, top; /* lowest/highest object on this space */	118	object ACC (RW, top); / lowest/highest object on this space */
122	object faces_obj[MAP_LAYERS];/ face objects for the 3 layers */	119	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
123	uint8 flags_; /* flags about this space (see the P_ values above) */	120	uint8 flags_; /* flags about this space (see the P_ values above) */
124	sint8 light; /* How much light this space provides */	121	sint8 ACC (RW, light); /* How much light this space provides */
125	MoveType move_block; /* What movement types this space blocks */	122	MoveType ACC (RW, move_block); /* What movement types this space blocks */
126	MoveType move_slow; /* What movement types this space slows */	123	MoveType ACC (RW, move_slow); /* What movement types this space slows */
127	MoveType move_on; /* What movement types are activated */	124	MoveType ACC (RW, move_on); /* What movement types are activated */
128	MoveType move_off; /* What movement types are activated */	125	MoveType ACC (RW, move_off); /* What movement types are activated */
129		126
130	void update_ ();	127	void update_ ();
131	void update ()	128	MTH void update ()
132	{	129	{
133	if (!(flags_ & P_UPTODATE))	130	if (!(flags_ & P_UPTODATE))
134	update_ ();	131	update_ ();
135	}	132	}
136		133
137	uint8 flags ()	134	MTH uint8 flags ()
138	{	135	{
139	update ();	136	update ();
140	return flags_;	137	return flags_;
141	}	138	}
		139
		140	MTH void invalidate ()
		141	{
		142	flags_ = 0;
		143	}
142		144
143	// maybe only inline quick flags_ checking?
144	object *player ()	145	MTH object *player ()
145	{	146	{
146	// search from the top, because players are usually on top	147	object *op;
147	// make usually == always and this non-amortized O(1)	148
148	// could gte rid of P_PLAYER, too, then
149	if (flags () & P_PLAYER)	149	if (flags () & P_PLAYER)
150	for (object *op = top; op; op = op->below)	150	for (op = top; op->type != PLAYER; op = op->below)
151	if (op->type == PLAYER)	151	;
152	return op;	152	else
		153	op = 0;
153		154
154	return 0;	155	return op;
155	}	156	}
156		157
157	// return the item volume on this mapspace in cm³	158	// return the item volume on this mapspace in cm³
158	uint64 volume () const;	159	MTH uint64 volume () const;
		160
		161	bool blocks (MoveType mt) const
		162	{
		163	return move_block && (mt & move_block) == mt;
		164	}
		165
		166	bool blocks (object *op) const
		167	{
		168	return blocks (op->move_type);
		169	}
159	};	170	};
160		171
161	struct shopitems : zero_initialised	172	struct shopitems : zero_initialised
162	{	173	{
163	const char name; / name of the item in question, null if it is the default item */	174	const char name; / name of the item in question, null if it is the default item */
…		…
212	* be loaded before used. The map,omap and map_ob	223	* be loaded before used. The map,omap and map_ob
213	* arrays will be allocated when the map is loaded */	224	* arrays will be allocated when the map is loaded */
214	sint16 players; /* How many players are on this map right now */	225	sint16 players; /* How many players are on this map right now */
215	uint16 ACC (RW, difficulty); /* What level the player should be to play here */	226	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
216		227
217	bool ACC (RW, active); // wether this map is active or not
218	bool ACC (RW, per_player);	228	bool ACC (RW, per_player);
219	bool ACC (RW, per_party);	229	bool ACC (RW, per_party);
220	bool ACC (RW, outdoor); /* True if an outdoor map */	230	bool ACC (RW, outdoor); /* True if an outdoor map */
221	bool ACC (RW, nodrop); /* avoid dropping anything on this map */	231	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
222	uint8 ACC (RW, darkness); /* indicates level of darkness of map */	232	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
		233	static sint8 outdoor_darkness; /* the global darkness level outside */
223		234
224	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */	235	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
225	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */	236	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
226	oblinkpt buttons; / Linked list of linked lists of buttons */	237	oblinkpt buttons; / Linked list of linked lists of buttons */
227	sint16 ACC (RW, temp); /* base temperature of this tile (F) */	238	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
…		…
242	maptile ACC (RW, tile_map[4]); / Next map, linked list */	253	maptile ACC (RW, tile_map[4]); / Next map, linked list */
243	shstr ACC (RW, path); /* Filename of the map */	254	shstr ACC (RW, path); /* Filename of the map */
244	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace	255	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
245	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace	256	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
246		257
		258	// the maptile:: is neccessary here for the perl interface to work
		259	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		260	{
		261	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		262	}
		263
		264	static void adjust_daylight ();
		265
247	MTH void activate ();	266	MTH void activate ();
248	MTH void deactivate ();	267	MTH void deactivate ();
249		268
250	// allocates all (empty) mapspace	269	// allocates all (empty) mapspace
251	MTH void alloc ();	270	MTH void alloc ();
…		…
254		273
255	MTH void fix_auto_apply ();	274	MTH void fix_auto_apply ();
256	MTH void do_decay_objects ();	275	MTH void do_decay_objects ();
257	MTH void update_buttons ();	276	MTH void update_buttons ();
258	MTH int change_map_light (int change);	277	MTH int change_map_light (int change);
259	static void change_all_map_light (int change); //PERL
260	MTH void set_darkness_map ();
261	MTH int estimate_difficulty () const;	278	MTH int estimate_difficulty () const;
262		279
263	MTH void play_sound (faceidx sound, int x, int y) const;	280	MTH void play_sound (faceidx sound, int x, int y) const;
264		281
265	// set the given flag on all objects in the map	282	// set the given flag on all objects in the map
266	MTH void set_object_flag (int flag, int value = 1);	283	MTH void set_object_flag (int flag, int value = 1);
		284	MTH void post_load_original ();
267		285
268	MTH void link_multipart_objects ();	286	MTH void link_multipart_objects ();
269	MTH void clear_unique_items ();	287	MTH void clear_unique_items ();
270		288
271	MTH void clear_header ();	289	MTH void clear_header ();
272	MTH void clear_links_to (maptile *m);	290	MTH void clear_links_to (maptile *m);
273		291
274	MTH struct region *region (int x, int y) const;	292	MTH struct region *region (int x, int y) const;
275		293
276	// loas the header pseudo-object	294	// load the header pseudo-object
277	bool _load_header (object_thawer &thawer);	295	bool _load_header (object_thawer &thawer);
278	MTH bool _load_header (const char *path);	296	MTH bool _load_header (object_thawer thawer) { return _load_header (thawer); }
279		297
280	// load objects into the map	298	// load objects into the map
281	bool _load_objects (object_thawer &thawer);	299	bool _load_objects (object_thawer &thawer);
282	MTH bool _load_objects (const char *path, bool skip_header = true);	300	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
283		301
284	// save objects into the given file (uses IO_ flags)	302	// save objects into the given file (uses IO_ flags)
285	bool _save_objects (object_freezer &freezer, int flags);	303	bool _save_objects (object_freezer &freezer, int flags);
286	MTH bool _save_objects (const char *path, int flags);	304	MTH bool _save_objects (const char *path, int flags);
287		305
…		…
299	MTH int size () const { return width * height; }	317	MTH int size () const { return width * height; }
300		318
301	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);	319	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
302		320
303	MTH void touch () { last_access = runtime; }	321	MTH void touch () { last_access = runtime; }
		322
		323	MTH bool tile_available (int dir, bool load = true);
304		324
305	// find the map that is at coordinate x\|y relative to this map	325	// find the map that is at coordinate x\|y relative to this map
306	// TODO: need a better way than passing by reference	326	// TODO: need a better way than passing by reference
307	// TODO: make perl interface	327	// TODO: make perl interface
308	maptile *xy_find (sint16 &x, sint16 &y);	328	maptile *xy_find (sint16 &x, sint16 &y);
…		…
320	}	340	}
321		341
322	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);	342	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);
323	bool generate_random_map (random_map_params *RP);	343	bool generate_random_map (random_map_params *RP);
324		344
325	static maptile find_async (const char path, maptile *original = 0);//PERL	345	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL
326	static maptile find_sync (const char path, maptile *original = 0);//PERL	346	static maptile find_sync (const char path, maptile *original = 0);//PERL
327	static maptile find_style_sync (const char dir, const char *file = 0);//PERL	347	static maptile find_style_sync (const char dir, const char *file = 0);//PERL
328	MTH object *pick_random_object () const;	348	object *pick_random_object (rand_gen &gen = rndm) const;
329		349
330	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }	350	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
331	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
332	};	351	};
333		352
334	/* This is used by get_rangevector to determine where the other	353	/* This is used by get_rangevector to determine where the other
335	* creature is. get_rangevector takes into account map tiling,	354	* creature is. get_rangevector takes into account map tiling,
336	* so you just can not look the the map coordinates and get the	355	* so you just can not look the the map coordinates and get the
…		…
347	int distance_y;	366	int distance_y;
348	int direction;	367	int direction;
349	object *part;	368	object *part;
350	};	369	};
351		370
		371	// comaptibility cruft start
352	//TODO: these should be refactored into things like xy_normalise	372	//TODO: these should be refactored into things like xy_normalise
353	// and so on.	373	// and so on.
354	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);	374	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
355	int ob_blocked (const object ob, maptile m, sint16 x, sint16 y);
356	int out_of_map (maptile *m, int x, int y);	375	int out_of_map (maptile *m, int x, int y);
357	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);	376	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
358	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);	377	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
359	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);	378	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);
360	int on_same_map (const object op1, const object op2);	379	int on_same_map (const object op1, const object op2);
361	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);	380	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);
362		381
363	// adjust map, x and y for tiled maps and return true if the position is valid at all	382	// adjust map, x and y for tiled maps and return true if the position is valid at all
364	inline bool	383	static inline bool
365	xy_normalise (maptile *&map, sint16 &x, sint16 &y)	384	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
366	{	385	{
367	// when in range, do a quick return, otherwise go the slow route	386	// when in range, do a quick return, otherwise go the slow route
368	return	387	return
369	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))	388	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
370	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);	389	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
371	}	390	}
		391	// comaptibility cruft end
372		392
373	inline mapspace &	393	inline mapspace &
374	object::ms () const	394	object::ms () const
375	{	395	{
376	return map->at (x, y);	396	return map->at (x, y);
377	}	397	}
378		398
379	inline void	399	struct mapxy {
380	object::play_sound (faceidx sound) const	400	maptile *m;
		401	sint16 x, y;
		402
		403	mapxy (maptile *m, sint16 x, sint16 y)
		404	: m(m), x(x), y(y)
		405	{ }
		406
		407	mapxy (object *op)
		408	: m(op->map), x(op->x), y(op->y)
		409	{ }
		410
		411	mapxy &move (int dx, int dy)
		412	{
		413	x += dx;
		414	y += dy;
		415
		416	return *this;
		417	}
		418
		419	mapxy &move (int dir)
		420	{
		421	return move (freearr_x [dir], freearr_y [dir]);
		422	}
		423
		424	operator void () const { return (void )m; }
		425	mapxy &operator =(const object *op)
		426	{
		427	m = op->map;
		428	x = op->x;
		429	y = op->y;
		430
		431	return *this;
		432	}
		433
		434	mapspace *operator ->() const { return &m->at (x, y); }
		435	mapspace &operator * () const { return m->at (x, y); }
		436
		437	bool normalise ()
		438	{
		439	return xy_normalise (m, x, y);
		440	}
		441
		442	mapspace &ms () const
		443	{
		444	return m->at (x, y);
		445	}
		446
		447	object insert (object op, object *originator = 0, int flags = 0) const
		448	{
		449	return m->insert (op, x, y, originator, flags);
		450	}
		451	};
		452
		453	inline const mapxy &
		454	object::operator =(const mapxy &pos)
381	{	455	{
382	if (map && sound)	456	map = pos.m;
383	map->play_sound (sound, x, y);	457	x = pos.x;
		458	y = pos.y;
		459
		460	return pos;
384	}	461	}
385		462
		463	// iterate over a rectangular area relative to op
		464	// can be used as a single statement, but both iterate macros
		465	// invocations must not be followed by a ";"
		466	// see common/los.C for usage example
		467	#define rectangular_mapspace_iterate_begin(op,dx0,dx1,dy0,dy1) \
		468	for (int dx = (dx0); dx <= (dx1); dx++) \
		469	{ \
		470	sint16 nx, ny; \
		471	maptile *m = 0; \
		472	\
		473	for (int dy = (dy0); dy <= (dy1); dy++) \
		474	{ \
		475	/* check to see if we can simply go one down quickly, */ \
		476	/* if not, due it the slow way */ \
		477	if (!m \|\| ++ny >= m->height) \
		478	{ \
		479	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		480	\
		481	if (xy_normalise (m, nx, ny)) \
		482	m->touch (); \
		483	else \
		484	m = 0; \
		485	}
		486
		487	#define rectangular_mapspace_iterate_end \
		488	} \
		489	}
		490
386	#endif	491	#endif
387		492

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.81 by root, Wed Aug 1 01:53:13 2007 UTC vs. Revision 1.103 by root, Tue Dec 23 22:03:06 2008 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.81 by root, Wed Aug 1 01:53:13 2007 UTC vs.
Revision 1.103 by root, Tue Dec 23 22:03:06 2008 UTC