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

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

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.78 by root, Sun Jul 1 05:00:18 2007 UTC vs. Revision 1.143 by root, Sat May 7 10:50:35 2011 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.78 by root, Sun Jul 1 05:00:18 2007 UTC vs.
Revision 1.143 by root, Sat May 7 10:50:35 2011 UTC