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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.65 by root, Wed Feb 7 02:04:46 2007 UTC vs.
Revision 1.145 by root, Sat May 7 20:03:28 2011 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* 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
9	* 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
10	* the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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 Affero GNU General Public License
19	* 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
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail at crossfire@schmorp.de	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		24
25	/*	25	/*
26	* The maptile is allocated each time a new map is opened.	26	* The maptile is allocated each time a new map is opened.
27	* It contains pointers (very indirectly) to all objects on the map.	27	* It contains pointers (very indirectly) to all objects on the map.
30	#ifndef MAP_H	30	#ifndef MAP_H
31	#define MAP_H	31	#define MAP_H
32		32
33	#include <tr1/unordered_map>	33	#include <tr1/unordered_map>
34		34
		35	//+GPL
		36
		37	#include "region.h"
35	#include "cfperl.h"	38	#include "cfperl.h"
36		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.
…		…
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	#define MAP_LAYERS 3	53	#define MAP_LAYERS 3
51		54
52	/* Values for in_memory below. Should probably be an enumerations */	55	// tile map index - toggling the lowest bit reverses direction
53	enum {	56	enum
54	MAP_IN_MEMORY,	57	{
55	MAP_SWAPPED,	58	TILE_NORTH,
56	MAP_LOADING,	59	TILE_SOUTH,
57	MAP_SAVING,	60	TILE_EAST ,
		61	TILE_WEST,
		62	TILE_UP,
		63	TILE_DOWN,
		64	TILE_NUM
		65	};
		66
		67	#define REVERSE_TILE_DIR(dir) ((dir) ^ 1)
		68
		69	/* Values for state below */
		70	enum
		71	{
		72	MAP_SWAPPED, // header loaded, nothing else
		73	MAP_INACTIVE, // in memory, linkable, but not active
		74	MAP_ACTIVE, // running!
58	};	75	};
59		76
60	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	77	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
61	* really be used, as it is multi tile aware. However, there are some cases	78	* really be used, as it is multi tile aware. However, there are some cases
62	* where it is known the map is not tiled or the values are known	79	* where it is known the map is not tiled or the values are known
63	* consistent (eg, op->map, op->x, op->y)	80	* consistent (eg, op->map, op->x, op->y)
64	*/	81	*/
65	// all those macros are herewith declared legacy	82	// all those macros are herewith declared legacy
66	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()	83	#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	84	#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	85	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
70	#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
71	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]	86	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
72	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block	87	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
73	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow	88	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
74	#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on	89	#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on
75	#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off	90	#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
…		…
78	* should almost always be using out_of_map instead, which takes into account	93	* should almost always be using out_of_map instead, which takes into account
79	* map tiling.	94	* map tiling.
80	*/	95	*/
81	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))	96	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
82		97
83	/* These are used in the MapLook flags element. They are not used in	98	/* These are used in the mapspace flags element. They are not used in
84	* in the object flags structure.	99	* in the object flags structure.
85	*/	100	*/
86	#define P_BLOCKSVIEW 0x01	101	#define P_BLOCKSVIEW 0x01
87	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */	102	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
88	#define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */	103	#define P_NO_CLERIC 0x04 /* no clerical spells cast here */
89	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,	104	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,
90	* that means, nothing harmful can be done,	105	* that means, nothing harmful can be done,
91	* such as: bombs, potion usage, alchemy, spells	106	* such as: bombs, potion usage, alchemy, spells
92	* this was introduced to make shops safer	107	* this was introduced to make shops safer
93	* but is useful in other situations */	108	* but is useful in other situations */
		109
		110	#define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */
94	#define P_IS_ALIVE 0x10 /* something alive is on this space */	111	#define P_IS_ALIVE 0x20 /* something alive is on this space */
95	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
96
97	#define P_UPTODATE 0x80 /* this space is up to date */	112	#define P_UPTODATE 0x80 // this space is up to date
98		113
99	/* The following two values are not stored in the MapLook flags, but instead	114	/* The following two values are not stored in the MapLook flags, but instead
100	* used in the get_map_flags value - that function is used to return	115	* used in the get_map_flags value - that function is used to return
101	* the flag value, as well as other conditions - using a more general	116	* the flag value, as well as other conditions - using a more general
102	* function that does more of the work can hopefully be used to replace	117	* function that does more of the work can hopefully be used to replace
103	* lots of duplicate checks currently in the code.	118	* lots of duplicate checks currently in the code.
104	*/	119	*/
105	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */	120	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
106	#define P_NEW_MAP 0x20000	121	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
107	/* Coordinates passed result in a new tiled map */
108		122
109	/* P_NO_PASS is used for ob_blocked() return value. It needs	123	// persistent flags (pflags) in mapspace
110	* to be here to make sure the bits don't match with anything.	124	enum
111	*/	125	{
112	#define P_NO_PASS 0x80000	126	PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace
		127	};
113		128
114	/* Instead of having numerous arrays that have information on a	129	/* Instead of having numerous arrays that have information on a
115	* particular space (was map, floor, floor2, map_ob),	130	* particular space (was map, floor, floor2, map_ob),
116	* have this structure take care of that information.	131	* have this structure take care of that information.
117	* This puts it all in one place, and should also make it easier	132	* This puts it all in one place, and should also make it easier
118	* to extend information about a space.	133	* to extend information about a space.
119	*/	134	*/
		135	INTERFACE_CLASS (mapspace)
120	struct mapspace	136	struct mapspace
121	{	137	{
		138	object *ACC (RW, bot);
122	object bot, top; /* lowest/highest object on this space */	139	object ACC (RW, top); / lowest/highest object on this space */
123	facetile faces[MAP_LAYERS]; / faces for the 3 layers */
124	object faces_obj[MAP_LAYERS];/ face objects for the 3 layers */	140	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
125	uint8 flags_; /* flags about this space (see the P_ values above) */	141	uint8 flags_; /* flags about this space (see the P_ values above) */
126	sint8 light; /* How much light this space provides */	142	sint8 ACC (RW, light); /* How much light this space provides */
127	MoveType move_block; /* What movement types this space blocks */	143	MoveType ACC (RW, move_block); /* What movement types this space blocks */
128	MoveType move_slow; /* What movement types this space slows */	144	MoveType ACC (RW, move_slow); /* What movement types this space slows */
129	MoveType move_on; /* What movement types are activated */	145	MoveType ACC (RW, move_on); /* What movement types are activated */
130	MoveType move_off; /* What movement types are activated */	146	MoveType ACC (RW, move_off); /* What movement types are activated */
		147	uint16_t ACC (RW, items_); // saturates at 64k
		148	uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
		149	uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
		150	static uint32_t ACC (RW, smellcount); // global smell counter
		151
		152	uint8_t pflags; // additional, persistent flags
		153	uint8_t pad [3]; // pad to 64 bytes on LP64 systems
		154
		155	//-GPL
131		156
132	void update_ ();	157	void update_ ();
133	void update ()	158	MTH void update ()
134	{	159	{
135	if (!(flags_ & P_UPTODATE))	160	// we take advantage of the fact that 0x80 is the sign bit
		161	// to generate more efficient code on many cpus
		162	assert (sint8 (P_UPTODATE) < 0);
		163	assert (sint8 (-1 & ~P_UPTODATE) >= 0);
		164
		165	if (expect_false (sint8 (flags_) >= 0))
136	update_ ();	166	update_ ();
137	}
138		167
		168	// must be true by now (gcc seems content with only the second test)
		169	assume (sint8 (flags_) < 0);
		170	assume (flags_ & P_UPTODATE);
		171	}
		172
139	uint8 flags ()	173	MTH uint8 flags ()
140	{	174	{
141	update ();	175	update ();
142	return flags_;	176	return flags_;
143	}	177	}
		178
		179	MTH void update_up ();
144		180
145	// maybe only inline quick flags_ checking?	181	MTH void invalidate ()
		182	{
		183	flags_ = 0;
		184
		185	if (pflags)
		186	update_up ();
		187	}
		188
146	object *player ()	189	MTH object *player ()
147	{	190	{
148	// search from the top, because players are usually on top	191	object *op;
149	// make usually == always and this non-amortized O(1)	192
150	// could gte rid of P_PLAYER, too, then
151	if (flags () & P_PLAYER)	193	if (flags () & P_PLAYER)
152	for (object *op = top; op; op = op->below)	194	for (op = top; op->type != PLAYER; op = op->below)
153	if (op->type == PLAYER)	195	;
154	return op;	196	else
		197	op = 0;
155		198
156	return 0;	199	return op;
157	}	200	}
158		201
		202	MTH uint32 items()
		203	{
		204	update ();
		205	return items_;
		206	}
		207
159	// return the item volume on this mapspace in kg/m³	208	// return the item volume on this mapspace in cm³
160	uint64 volume ();	209	MTH uint64 volume ()
161	};	210	{
		211	update ();
		212	return volume_ * 1024;
		213	}
162		214
163	/*	215	bool blocks (MoveType mt) const
164	* Each map is in a given region of the game world and links to a region definiton, so	216	{
165	* they have to appear here in the headers, before the mapdef	217	return move_block && (mt & move_block) == mt;
166	*/	218	}
167	INTERFACE_CLASS (region)
168	struct region : zero_initialised
169	{
170	shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */
171	region ACC (RW, parent); /
172	* Pointer to the region that is a parent of the current
173	* region, if a value isn't defined in the current region
174	* we traverse this series of pointers until it is.
175	*/
176	shstr ACC (RW, longname); /* Official title of the region, this might be defined
177	* to be the same as name*/
178	shstr ACC (RW, msg); /* the description of the region */
179	shstr ACC (RW, jailmap); /where a player that is arrested in this region should be imprisoned. /
180	int ACC (RW, index);
181	uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */
182	sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */
183	bool ACC (RW, fallback); /* whether, in the event of a region not existing,
184	* this should be the one we fall back on as the default */
185		219
186	static region *default_region ();	220	bool blocks (object *op) const
187	static region find (const char name);	221	{
188	static region find_fuzzy (const char name);	222	return blocks (op->move_type);
		223	}
189	};	224	};
190		225
191	typedef object_vector<region, &region::index> regionvec;	226	// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
		227	struct maprect
		228	{
		229	maptile *m;
		230	int x0, y0;
		231	int x1, y1;
		232	int dx, dy; // offset to go from local coordinates to original tile */
		233	};
192		234
193	extern regionvec regions;	235	// (refcounted) list of objects on this map that need physics processing
		236	struct physics_queue
		237	: unordered_vector<object *>
		238	{
		239	int i; // already processed
		240	physics_queue ();
		241	~physics_queue ();
		242	object *pop ();
		243	};
194		244
195	#define for_all_regions(var) \	245	#define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks
196	for (int _i = 0; _i < regions.size (); ++_i) \	246
197	declvar (region *, var, regions [_i])	247	//+GPL
198		248
199	struct shopitems : zero_initialised	249	struct shopitems : zero_initialised
200	{	250	{
201	const char name; / name of the item in question, null if it is the default item */	251	const char name; / name of the item in question, null if it is the default item */
202	const char name_pl; / plural name */	252	const char name_pl; / plural name */
…		…
225	struct maptile : zero_initialised, attachable	275	struct maptile : zero_initialised, attachable
226	{	276	{
227	sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */	277	sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
228	struct mapspace spaces; / Array of spaces on this map */	278	struct mapspace spaces; / Array of spaces on this map */
229	uint8 regions; / region index per mapspace, if != 0 */	279	uint8 regions; / region index per mapspace, if != 0 */
230	struct region *regionmap; / index to region */	280	region_ptr regionmap; / index to region */
231		281
232	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */	282	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
233		283
234	shstr ACC (RW, name); /* Name of map as given by its creator */	284	shstr ACC (RW, name); /* Name of map as given by its creator */
235	struct region ACC (RW, default_region); / What jurisdiction in the game world this map is ruled by	285	region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
236	* points to the struct containing all the properties of	286	* points to the struct containing all the properties of
237	* the region */	287	* the region */
238	double ACC (RW, reset_time);	288	double ACC (RW, reset_time);
239	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map	289	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
240	* should be reset	290	* should be reset
241	*/	291	*/
242	bool ACC (RW, dirty); /* if true, something was inserted or removed */	292	bool ACC (RW, dirty); /* if true, something was inserted or removed */
		293	bool ACC (RW, no_reset); // must not reset this map
243	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by	294	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
244	* players entering/exiting map	295	* players entering/exiting map
245	*/	296	*/
		297	uint8 ACC (RW, state); /* If not true, the map has been freed and must
		298	* be loaded before used. The map,omap and map_ob
		299	* arrays will be allocated when the map is loaded */
246	sint32 ACC (RW, timeout); /* swapout is set to this */	300	sint32 ACC (RW, timeout); /* swapout is set to this */
247	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */	301	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
248	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
249	* be loaded before used. The map,omap and map_ob
250	* arrays will be allocated when the map is loaded */
251	sint16 players; /* How many players are on this map right now */	302	sint16 players; /* How many players are on this map right now */
252	uint16 ACC (RW, difficulty); /* What level the player should be to play here */	303	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
253		304
254	bool ACC (RW, per_player);	305	bool ACC (RW, per_player);
255	bool ACC (RW, per_party);	306	bool ACC (RW, per_party);
256	bool ACC (RW, outdoor); /* True if an outdoor map */	307	bool ACC (RW, outdoor); /* True if an outdoor map */
257	bool ACC (RW, nodrop); /* avoid dropping anything on this map */	308	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
258	uint8 ACC (RW, darkness); /* indicates level of darkness of map */	309	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
		310	static sint8 outdoor_darkness; /* the global darkness level outside */
259		311
260	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */	312	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
261	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */	313	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
262	oblinkpt buttons; / Linked list of linked lists of buttons */	314	oblinkpt buttons; / Linked list of linked lists of buttons */
263	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
264	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
265	sint8 ACC (RW, humid); /* humitidy of this tile */
266	sint8 ACC (RW, windspeed); /* windspeed of this tile */
267	sint8 ACC (RW, winddir); /* direction of wind */
268	sint8 ACC (RW, sky); /* sky conditions */
269	int ACC (RW, worldpartx), ACC (RW, worldparty); /Highly fasten conversion between worldmap and weathermap /
270	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */	315	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */
271	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */	316	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
272	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	317	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
273	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	318	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
274	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */	319	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
275	shstr ACC (RW, msg); /* Message map creator may have left */	320	shstr ACC (RW, msg); /* Message map creator may have left */
276	shstr ACC (RW, maplore); /* Map lore information */	321	shstr ACC (RW, maplore); /* Map lore information */
277	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */	322	shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
278	maptile ACC (RW, tile_map[4]); / Next map, linked list */	323	maptile ACC (RW, tile_map[TILE_NUM]); / Next map, linked list */
279	shstr ACC (RW, path); /* Filename of the map */	324	shstr ACC (RW, path); /* Filename of the map */
		325	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
		326	int ACC (RW, max_items); // maximum number of items on a mapspace
		327
		328	//-GPL
		329
		330	physics_queue pq[PHYSICS_QUEUES];
		331	MTH void queue_physics (object *ob, int after = 0);
		332	MTH void queue_physics_at (int x, int y);
		333	MTH void post_load_physics ();
		334	MTH int run_physics (tick_t tick, int max_objects);
		335
		336	// the maptile:: is neccessary here for the perl interface to work
		337	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		338	{
		339	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		340	}
		341
		342	static void adjust_daylight ();
280		343
281	MTH void activate ();	344	MTH void activate ();
		345	MTH void activate_physics ();
282	MTH void deactivate ();	346	MTH void deactivate ();
283		347
284	// allocates all (empty) mapspace	348	// allocates all (empty) mapspace
285	MTH void alloc ();	349	MTH void alloc ();
286	// deallocates the mapspaces (and destroys all objects)	350	// deallocates the mapspaces (and destroys all objects)
287	MTH void clear ();	351	MTH void clear ();
288		352
		353	MTH void post_load (); // update cached values in mapspaces etc.
289	MTH void fix_auto_apply ();	354	MTH void fix_auto_apply ();
290	MTH void decay_objects ();	355	MTH void do_decay_objects ();
291	MTH void update_buttons ();	356	MTH void update_buttons ();
292	MTH int change_map_light (int change);	357	MTH int change_map_light (int change);
293	static void change_all_map_light (int change); //PERL
294	MTH void set_darkness_map ();
295	MTH int estimate_difficulty () const;	358	MTH int estimate_difficulty () const;
		359
		360	MTH void play_sound (faceidx sound, int x, int y) const;
		361	MTH void say_msg (const_utf8_string msg, int x, int y) const;
		362
		363	// connected links
		364	oblinkpt *find_link (shstr_tmp id);
		365	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);
296		366
297	// set the given flag on all objects in the map	367	// set the given flag on all objects in the map
298	MTH void set_object_flag (int flag, int value = 1);	368	MTH void set_object_flag (int flag, int value = 1);
		369	MTH void post_load_original ();
299		370
300	MTH void link_multipart_objects ();	371	MTH void link_multipart_objects ();
301	MTH void clear_unique_items ();	372	MTH void clear_unique_items ();
302		373
303	MTH void clear_header ();	374	MTH void clear_header ();
304	MTH void clear_links_to (maptile *m);	375	MTH void clear_links_to (maptile *m);
305		376
306	MTH struct region *region (int x, int y) const;	377	MTH struct region *region (int x, int y) const;
307		378
308	// loas the header pseudo-object	379	// load the header pseudo-object
309	bool _load_header (object_thawer &thawer);	380	bool _load_header (object_thawer &thawer);
310	MTH bool _load_header (const char *path);	381	MTH bool _load_header (object_thawer thawer) { return _load_header (thawer); }
311		382
312	// load objects into the map	383	// load objects into the map
313	bool _load_objects (object_thawer &thawer);	384	bool _load_objects (object_thawer &thawer);
314	MTH bool _load_objects (const char *path, bool skip_header = true);	385	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
315		386
316	// save objects into the given file (uses IO_ flags)	387	// save objects into the given file (uses IO_ flags)
317	bool _save_objects (object_freezer &freezer, int flags);	388	bool _save_objects (object_freezer &freezer, int flags);
318	MTH bool _save_objects (const char *path, int flags);	389	MTH bool _save_objects (const_octet_string path, int flags);
319		390
320	// save the header pseudo object _only_	391	// save the header pseudo object _only_
321	bool _save_header (object_freezer &freezer);	392	bool _save_header (object_freezer &freezer);
322	MTH bool _save_header (const char *path);	393	MTH bool _save_header (const_octet_string path);
323		394
324	maptile ();	395	maptile ();
325	maptile (int w, int h);	396	maptile (int w, int h);
		397	void init ();
326	~maptile ();	398	~maptile ();
327		399
328	void do_destroy ();	400	void do_destroy ();
329	void gather_callbacks (AV *&callbacks, event_type event) const;	401	void gather_callbacks (AV *&callbacks, event_type event) const;
330		402
		403	MTH bool linkable () { return state >= MAP_INACTIVE; }
		404
331	MTH int size () const { return width * height; }	405	MTH int size () const { return width * height; }
332		406
333	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);	407	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
334		408
335	MTH void touch () { last_access = runtime; }	409	MTH void touch () { last_access = runtime; }
		410
		411	MTH maptile *tile_available (int dir, bool load = true);
336		412
337	// find the map that is at coordinate x\|y relative to this map	413	// find the map that is at coordinate x\|y relative to this map
338	// TODO: need a better way than passing by reference	414	// TODO: need a better way than passing by reference
339	// TODO: make perl interface	415	// TODO: make perl interface
340	maptile *xy_find (sint16 &x, sint16 &y);	416	maptile *xy_find (sint16 &x, sint16 &y);
…		…
349	{	425	{
350	if (!spaces)	426	if (!spaces)
351	do_load_sync ();	427	do_load_sync ();
352	}	428	}
353		429
354	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);	430	void make_map_floor (char *layout, const char floorstyle, random_map_params *RP);
355	bool generate_random_map (random_map_params *RP);	431	bool generate_random_map (random_map_params *RP);
356		432
		433	static maptile find_async (const_utf8_string path, maptile original = 0, bool load = true);//PERL
357	static maptile find_sync (const char path, maptile *original = 0);//PERL	434	static maptile find_sync (const_utf8_string path, maptile original = 0);//PERL
358	// async prefetch	435	static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
359	static maptile find_async (const char path, maptile *original = 0);//PERL	436	object *pick_random_object (rand_gen &gen = rndm) const;
360		437
361	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }	438	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
362	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }	439
		440	// return an array of maprects corresponding
		441	// to the given rectangular area. the last rect will have
		442	// a 0 map pointer.
		443	maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
		444
		445	MTH bool is_in_shop (int x, int y) const;
363	};	446	};
		447
		448	inline bool
		449	object::is_in_shop () const
		450	{
		451	return is_on_map ()
		452	&& map->is_in_shop (x, y);
		453	}
		454
		455	//+GPL
364		456
365	/* This is used by get_rangevector to determine where the other	457	/* This is used by get_rangevector to determine where the other
366	* creature is. get_rangevector takes into account map tiling,	458	* creature is. get_rangevector takes into account map tiling,
367	* so you just can not look the the map coordinates and get the	459	* so you just can not look the the map coordinates and get the
368	* righte value. distance_x/y are distance away, which	460	* righte value. distance_x/y are distance away, which
…		…
378	int distance_y;	470	int distance_y;
379	int direction;	471	int direction;
380	object *part;	472	object *part;
381	};	473	};
382		474
		475	// comaptibility cruft start
383	//TODO: these should be refactored into things like xy_normalise	476	//TODO: these should be refactored into things like xy_normalise
384	// and so on.	477	// and so on.
385	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);	478	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
386	int ob_blocked (const object ob, maptile m, sint16 x, sint16 y);
387	int out_of_map (maptile *m, int x, int y);	479	int out_of_map (maptile *m, int x, int y);
388	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);	480	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
389	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);	481	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
390	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);	482	void get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector retval, int flags = 0 /unused*/);
391	int on_same_map (const object op1, const object op2);	483	int on_same_map (const object op1, const object op2);
392	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);	484	int adjacent_map (maptile map1, maptile map2, int dx, int dy);
393		485
394	// adjust map, x and y for tiled maps and return true if the position is valid at all	486	// adjust map, x and y for tiled maps and return true if the position is valid at all
395	inline bool	487	static inline bool
396	xy_normalise (maptile *&map, sint16 &x, sint16 &y)	488	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
397	{	489	{
398	// when in range, do a quick return, otherwise go the slow route	490	// when in range, do a quick return, otherwise go the slow route
399	return	491	return
400	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))	492	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
401	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);	493	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
402	}	494	}
		495	// comaptibility cruft end
		496
		497	//-GPL
403		498
404	inline mapspace &	499	inline mapspace &
405	object::ms () const	500	object::ms () const
406	{	501	{
407	return map->at (x, y);	502	return map->at (x, y);
408	}	503	}
409		504
		505	struct mapxy {
		506	maptile *m;
		507	sint16 x, y;
		508
		509	mapxy (maptile *m, sint16 x, sint16 y)
		510	: m(m), x(x), y(y)
		511	{ }
		512
		513	mapxy (object *op)
		514	: m(op->map), x(op->x), y(op->y)
		515	{ }
		516
		517	mapxy &move (int dx, int dy)
		518	{
		519	x += dx;
		520	y += dy;
		521
		522	return *this;
		523	}
		524
		525	mapxy &move (int dir)
		526	{
		527	return move (freearr_x [dir], freearr_y [dir]);
		528	}
		529
		530	operator void () const { return (void )m; }
		531	mapxy &operator =(const object *op)
		532	{
		533	m = op->map;
		534	x = op->x;
		535	y = op->y;
		536
		537	return *this;
		538	}
		539
		540	mapspace *operator ->() const { return &m->at (x, y); }
		541	mapspace &operator * () const { return m->at (x, y); }
		542
		543	bool normalise ()
		544	{
		545	return xy_normalise (m, x, y);
		546	}
		547
		548	mapspace &ms () const
		549	{
		550	return m->at (x, y);
		551	}
		552
		553	object insert (object op, object *originator = 0, int flags = 0) const
		554	{
		555	return m->insert (op, x, y, originator, flags);
		556	}
		557	};
		558
		559	inline const mapxy &
		560	object::operator =(const mapxy &pos)
		561	{
		562	map = pos.m;
		563	x = pos.x;
		564	y = pos.y;
		565
		566	return pos;
		567	}
		568
		569	// iterate over a rectangular area relative to op
		570	// can be used as a single statement, but both iterate macros
		571	// invocations must not be followed by a ";"
		572	// see common/los.C for usage example
		573	// the walk will be ordered, outer loop x, inner loop y
		574	// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
		575	// "continue" will skip to the next space
		576	#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
		577	for (int dx = (dx0); dx <= (dx1); ++dx) \
		578	{ \
		579	sint16 nx, ny; \
		580	maptile *m = 0; \
		581	\
		582	for (int dy = (dy0); dy <= (dy1); ++dy) \
		583	{ \
		584	/* check to see if we can simply go one down quickly, */ \
		585	/* if not, do it the slow way */ \
		586	if (!m \|\| ++ny >= m->height) \
		587	{ \
		588	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		589	\
		590	if (!xy_normalise (m, nx, ny)) \
		591	m = 0; \
		592	}
		593
		594	#define ordered_mapwalk_end \
		595	} \
		596	}
		597
		598	extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
		599
		600	// loop over every space in the given maprect,
		601	// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
		602	// the iterator code must be a single statement following this macro call, similar to "if"
		603	// "continue" will skip to the next space
		604	#define rect_mapwalk(rect,dx0,dy0) \
		605	statementvar (maptile *, m, (rect)->m) \
		606	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
		607	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
		608	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
		609	statementvar (int, dy, ny + (rect)->dy - (dy0))
		610
		611	// same as ordered_mapwalk, but the walk will not follow any particular
		612	// order (unorded), but is likely faster.
		613	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
		614	// "continue" will skip to the next space
		615	#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
		616	for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
		617	(ox) + (dx0) , (oy) + (dy0) , \
		618	(ox) + (dx1) + 1, (oy) + (dy1) + 1); \
		619	r_e_c_t->m; \
		620	++r_e_c_t) \
		621	rect_mapwalk (r_e_c_t, (ox), (oy))
		622
		623	#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
		624	unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
		625
410	#endif	626	#endif
411		627

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.65 by root, Wed Feb 7 02:04:46 2007 UTC vs. Revision 1.145 by root, Sat May 7 20:03:28 2011 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.65 by root, Wed Feb 7 02:04:46 2007 UTC vs.
Revision 1.145 by root, Sat May 7 20:03:28 2011 UTC