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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.88 by root, Wed Sep 12 11:10:10 2007 UTC vs.
Revision 1.140 by root, Wed May 4 19:04:44 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.
28		29
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>
		34
		35	//+GPL
33		36
34	#include "region.h"	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
…		…
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
53	enum {	56	enum {
54	MAP_IN_MEMORY,	57	TILE_NORTH,
55	MAP_SWAPPED,	58	TILE_EAST,
56	MAP_LOADING,	59	TILE_SOUTH,
57	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!
58	};	71	};
59		72
60	/* 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
61	* 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
62	* 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
63	* consistent (eg, op->map, op->x, op->y)	76	* consistent (eg, op->map, op->x, op->y)
64	*/	77	*/
65	// all those macros are herewith declared legacy	78	// all those macros are herewith declared legacy
66	#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 ()
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	80	#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	81	#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]	82	#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	83	#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	84	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
…		…
82	/* 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
83	* in the object flags structure.	95	* in the object flags structure.
84	*/	96	*/
85	#define P_BLOCKSVIEW 0x01	97	#define P_BLOCKSVIEW 0x01
86	#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 */
87	#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 */
88	#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,
89	* that means, nothing harmful can be done,	101	* that means, nothing harmful can be done,
90	* such as: bombs, potion usage, alchemy, spells	102	* such as: bombs, potion usage, alchemy, spells
91	* this was introduced to make shops safer	103	* this was introduced to make shops safer
92	* 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 */
93	#define P_IS_ALIVE 0x10 /* something alive is on this space */	107	#define P_IS_ALIVE 0x20 /* something alive is on this space */
94	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
95
96	#define P_UPTODATE 0x80 /* this space is up to date */	108	#define P_UPTODATE 0x80 // this space is up to date
97		109
98	/* 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
99	* 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
100	* 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
101	* 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
102	* lots of duplicate checks currently in the code.	114	* lots of duplicate checks currently in the code.
103	*/	115	*/
104	#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 */
105	#define P_NEW_MAP 0x20000	117	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
106	/* Coordinates passed result in a new tiled map */
107		118
108	/* Instead of having numerous arrays that have information on a	119	/* Instead of having numerous arrays that have information on a
109	* particular space (was map, floor, floor2, map_ob),	120	* particular space (was map, floor, floor2, map_ob),
110	* have this structure take care of that information.	121	* have this structure take care of that information.
111	* 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
112	* to extend information about a space.	123	* to extend information about a space.
113	*/	124	*/
		125	INTERFACE_CLASS (mapspace)
114	struct mapspace	126	struct mapspace
115	{	127	{
		128	object *ACC (RW, bot);
116	object bot, top; /* lowest/highest object on this space */	129	object ACC (RW, top); / lowest/highest object on this space */
117	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 */
118	uint8 flags_; /* flags about this space (see the P_ values above) */	131	uint8 flags_; /* flags about this space (see the P_ values above) */
119	sint8 light; /* How much light this space provides */	132	sint8 ACC (RW, light); /* How much light this space provides */
120	MoveType move_block; /* What movement types this space blocks */	133	MoveType ACC (RW, move_block); /* What movement types this space blocks */
121	MoveType move_slow; /* What movement types this space slows */	134	MoveType ACC (RW, move_slow); /* What movement types this space slows */
122	MoveType move_on; /* What movement types are activated */	135	MoveType ACC (RW, move_on); /* What movement types are activated */
123	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
124		145
125	void update_ ();	146	void update_ ();
126	void update ()	147	MTH void update ()
127	{	148	{
128	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))
129	update_ ();	155	update_ ();
130	}
131		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
132	uint8 flags ()	162	MTH uint8 flags ()
133	{	163	{
134	update ();	164	update ();
135	return flags_;	165	return flags_;
136	}	166	}
		167
		168	MTH void invalidate ()
		169	{
		170	flags_ = 0;
		171	}
137		172
138	// maybe only inline quick flags_ checking?
139	object *player ()	173	MTH object *player ()
140	{	174	{
141	// search from the top, because players are usually on top	175	object *op;
142	// make usually == always and this non-amortized O(1)	176
143	// could gte rid of P_PLAYER, too, then
144	if (flags () & P_PLAYER)	177	if (flags () & P_PLAYER)
145	for (object *op = top; op; op = op->below)	178	for (op = top; op->type != PLAYER; op = op->below)
146	if (op->type == PLAYER)	179	;
147	return op;	180	else
		181	op = 0;
148		182
149	return 0;	183	return op;
		184	}
		185
		186	MTH uint32 items()
		187	{
		188	update ();
		189	return items_;
150	}	190	}
151		191
152	// return the item volume on this mapspace in cm³	192	// return the item volume on this mapspace in cm³
153	uint64 volume () const;	193	MTH uint64 volume ()
		194	{
		195	update ();
		196	return volume_ * 1024;
		197	}
154		198
155	bool blocks (MoveType mt) const	199	bool blocks (MoveType mt) const
156	{	200	{
157	return move_block && (mt & move_block) == mt;	201	return move_block && (mt & move_block) == mt;
158	}	202	}
		203
		204	bool blocks (object *op) const
		205	{
		206	return blocks (op->move_type);
		207	}
159	};	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	object *pop ();
		226	};
		227
		228	#define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks
		229
		230	//+GPL
160		231
161	struct shopitems : zero_initialised	232	struct shopitems : zero_initialised
162	{	233	{
163	const char name; / name of the item in question, null if it is the default item */	234	const char name; / name of the item in question, null if it is the default item */
164	const char name_pl; / plural name */	235	const char name_pl; / plural name */
…		…
204	bool ACC (RW, dirty); /* if true, something was inserted or removed */	275	bool ACC (RW, dirty); /* if true, something was inserted or removed */
205	bool ACC (RW, no_reset); // must not reset this map	276	bool ACC (RW, no_reset); // must not reset this map
206	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by	277	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
207	* players entering/exiting map	278	* players entering/exiting map
208	*/	279	*/
		280	uint8 ACC (RW, state); /* If not true, the map has been freed and must
		281	* be loaded before used. The map,omap and map_ob
		282	* arrays will be allocated when the map is loaded */
209	sint32 ACC (RW, timeout); /* swapout is set to this */	283	sint32 ACC (RW, timeout); /* swapout is set to this */
210	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */	284	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
211	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
212	* be loaded before used. The map,omap and map_ob
213	* arrays will be allocated when the map is loaded */
214	sint16 players; /* How many players are on this map right now */	285	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 */	286	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
216		287
217	bool ACC (RW, per_player);	288	bool ACC (RW, per_player);
218	bool ACC (RW, per_party);	289	bool ACC (RW, per_party);
219	bool ACC (RW, outdoor); /* True if an outdoor map */	290	bool ACC (RW, outdoor); /* True if an outdoor map */
220	bool ACC (RW, nodrop); /* avoid dropping anything on this map */	291	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 */	292	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
		293	static sint8 outdoor_darkness; /* the global darkness level outside */
222		294
223	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */	295	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 */	296	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 */	297	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 */	298	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 */	299	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
235	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	300	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
236	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	301	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
237	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */	302	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
238	shstr ACC (RW, msg); /* Message map creator may have left */	303	shstr ACC (RW, msg); /* Message map creator may have left */
239	shstr ACC (RW, maplore); /* Map lore information */	304	shstr ACC (RW, maplore); /* Map lore information */
240	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */	305	shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
241	maptile ACC (RW, tile_map[4]); / Next map, linked list */	306	maptile ACC (RW, tile_map[TILE_NUM]); / Next map, linked list */
242	shstr ACC (RW, path); /* Filename of the map */	307	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	308	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
		309	int ACC (RW, max_items); // maximum number of items on a mapspace
		310
		311	//-GPL
		312
		313	physics_queue pq[PHYSICS_QUEUES];
		314	MTH void queue_physics (object *ob);
		315	MTH void queue_physics_at (int x, int y);
		316	MTH void post_load_physics ();
		317	MTH int run_physics (tick_t tick, int max_objects);
		318
		319	// the maptile:: is neccessary here for the perl interface to work
		320	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		321	{
		322	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		323	}
		324
		325	static void adjust_daylight ();
245		326
246	MTH void activate ();	327	MTH void activate ();
247	MTH void deactivate ();	328	MTH void deactivate ();
248		329
249	// allocates all (empty) mapspace	330	// allocates all (empty) mapspace
250	MTH void alloc ();	331	MTH void alloc ();
251	// deallocates the mapspaces (and destroys all objects)	332	// deallocates the mapspaces (and destroys all objects)
252	MTH void clear ();	333	MTH void clear ();
253		334
		335	MTH void post_load (); // update cached values in mapspaces etc.
254	MTH void fix_auto_apply ();	336	MTH void fix_auto_apply ();
255	MTH void do_decay_objects ();	337	MTH void do_decay_objects ();
256	MTH void update_buttons ();	338	MTH void update_buttons ();
257	MTH int change_map_light (int change);	339	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;	340	MTH int estimate_difficulty () const;
261		341
262	MTH void play_sound (faceidx sound, int x, int y) const;	342	MTH void play_sound (faceidx sound, int x, int y) const;
		343	MTH void say_msg (const_utf8_string msg, int x, int y) const;
		344
		345	// connected links
		346	oblinkpt *find_link (shstr_tmp id);
		347	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);
263		348
264	// set the given flag on all objects in the map	349	// set the given flag on all objects in the map
265	MTH void set_object_flag (int flag, int value = 1);	350	MTH void set_object_flag (int flag, int value = 1);
		351	MTH void post_load_original ();
266		352
267	MTH void link_multipart_objects ();	353	MTH void link_multipart_objects ();
268	MTH void clear_unique_items ();	354	MTH void clear_unique_items ();
269		355
270	MTH void clear_header ();	356	MTH void clear_header ();
…		…
280	bool _load_objects (object_thawer &thawer);	366	bool _load_objects (object_thawer &thawer);
281	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }	367	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
282		368
283	// save objects into the given file (uses IO_ flags)	369	// save objects into the given file (uses IO_ flags)
284	bool _save_objects (object_freezer &freezer, int flags);	370	bool _save_objects (object_freezer &freezer, int flags);
285	MTH bool _save_objects (const char *path, int flags);	371	MTH bool _save_objects (const_octet_string path, int flags);
286		372
287	// save the header pseudo object _only_	373	// save the header pseudo object _only_
288	bool _save_header (object_freezer &freezer);	374	bool _save_header (object_freezer &freezer);
289	MTH bool _save_header (const char *path);	375	MTH bool _save_header (const_octet_string path);
290		376
291	maptile ();	377	maptile ();
292	maptile (int w, int h);	378	maptile (int w, int h);
		379	void init ();
293	~maptile ();	380	~maptile ();
294		381
295	void do_destroy ();	382	void do_destroy ();
296	void gather_callbacks (AV *&callbacks, event_type event) const;	383	void gather_callbacks (AV *&callbacks, event_type event) const;
297		384
		385	MTH bool linkable () { return state >= MAP_INACTIVE; }
		386
298	MTH int size () const { return width * height; }	387	MTH int size () const { return width * height; }
299		388
300	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);	389	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
301		390
302	MTH void touch () { last_access = runtime; }	391	MTH void touch () { last_access = runtime; }
303		392
304	MTH bool tile_available (int dir, bool load = true);	393	MTH maptile *tile_available (int dir, bool load = true);
305		394
306	// find the map that is at coordinate x\|y relative to this map	395	// find the map that is at coordinate x\|y relative to this map
307	// TODO: need a better way than passing by reference	396	// TODO: need a better way than passing by reference
308	// TODO: make perl interface	397	// TODO: make perl interface
309	maptile *xy_find (sint16 &x, sint16 &y);	398	maptile *xy_find (sint16 &x, sint16 &y);
…		…
318	{	407	{
319	if (!spaces)	408	if (!spaces)
320	do_load_sync ();	409	do_load_sync ();
321	}	410	}
322		411
323	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);	412	void make_map_floor (char *layout, const char floorstyle, random_map_params *RP);
324	bool generate_random_map (random_map_params *RP);	413	bool generate_random_map (random_map_params *RP);
325		414
326	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL	415	static maptile find_async (const_utf8_string path, maptile original = 0, bool load = true);//PERL
327	static maptile find_sync (const char path, maptile *original = 0);//PERL	416	static maptile find_sync (const_utf8_string path, maptile original = 0);//PERL
328	static maptile find_style_sync (const char dir, const char *file = 0);//PERL	417	static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
329	MTH object *pick_random_object () const;	418	object *pick_random_object (rand_gen &gen = rndm) const;
330		419
331	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }	420	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
332	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }	421
		422	// return an array of maprects corresponding
		423	// to the given rectangular area. the last rect will have
		424	// a 0 map pointer.
		425	maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
		426
		427	MTH bool is_in_shop (int x, int y) const;
333	};	428	};
		429
		430	inline bool
		431	object::is_in_shop () const
		432	{
		433	return is_on_map ()
		434	&& map->is_in_shop (x, y);
		435	}
		436
		437	//+GPL
334		438
335	/* This is used by get_rangevector to determine where the other	439	/* This is used by get_rangevector to determine where the other
336	* creature is. get_rangevector takes into account map tiling,	440	* creature is. get_rangevector takes into account map tiling,
337	* so you just can not look the the map coordinates and get the	441	* so you just can not look the the map coordinates and get the
338	* righte value. distance_x/y are distance away, which	442	* righte value. distance_x/y are distance away, which
…		…
355	// and so on.	459	// and so on.
356	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);	460	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
357	int out_of_map (maptile *m, int x, int y);	461	int out_of_map (maptile *m, int x, int y);
358	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);	462	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
359	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);	463	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
360	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);	464	void get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector retval, int flags = 0 /unused*/);
361	int on_same_map (const object op1, const object op2);	465	int on_same_map (const object op1, const object op2);
362	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);	466	int adjacent_map (maptile map1, maptile map2, int dx, int dy);
363		467
364	// adjust map, x and y for tiled maps and return true if the position is valid at all	468	// adjust map, x and y for tiled maps and return true if the position is valid at all
365	static inline bool	469	static inline bool
366	xy_normalise (maptile *&map, sint16 &x, sint16 &y)	470	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
367	{	471	{
…		…
370	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))	474	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
371	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);	475	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
372	}	476	}
373	// comaptibility cruft end	477	// comaptibility cruft end
374		478
		479	//-GPL
		480
375	inline mapspace &	481	inline mapspace &
376	object::ms () const	482	object::ms () const
377	{	483	{
378	return map->at (x, y);	484	return map->at (x, y);
379	}	485	}
…		…
388		494
389	mapxy (object *op)	495	mapxy (object *op)
390	: m(op->map), x(op->x), y(op->y)	496	: m(op->map), x(op->x), y(op->y)
391	{ }	497	{ }
392		498
		499	mapxy &move (int dx, int dy)
		500	{
		501	x += dx;
		502	y += dy;
		503
		504	return *this;
		505	}
		506
393	mapxy &move (int dir)	507	mapxy &move (int dir)
394	{	508	{
395	x += freearr_x [dir];	509	return move (freearr_x [dir], freearr_y [dir]);
396	y += freearr_y [dir];
397
398	return *this;
399	}	510	}
400		511
401	operator void () const { return (void )m; }	512	operator void () const { return (void )m; }
402	mapxy &operator =(const object *op)	513	mapxy &operator =(const object *op)
403	{	514	{
…		…
414	bool normalise ()	525	bool normalise ()
415	{	526	{
416	return xy_normalise (m, x, y);	527	return xy_normalise (m, x, y);
417	}	528	}
418		529
		530	mapspace &ms () const
		531	{
		532	return m->at (x, y);
		533	}
		534
419	object insert (object op, object *originator = 0, int flags = 0) const	535	object insert (object op, object *originator = 0, int flags = 0) const
420	{	536	{
421	m->insert (op, x, y, originator, flags);	537	return m->insert (op, x, y, originator, flags);
422	}	538	}
423	};	539	};
424		540
425	inline const mapxy &	541	inline const mapxy &
426	object::operator =(const mapxy &pos)	542	object::operator =(const mapxy &pos)
…		…
430	y = pos.y;	546	y = pos.y;
431		547
432	return pos;	548	return pos;
433	}	549	}
434		550
		551	// iterate over a rectangular area relative to op
		552	// can be used as a single statement, but both iterate macros
		553	// invocations must not be followed by a ";"
		554	// see common/los.C for usage example
		555	// the walk will be ordered, outer loop x, inner loop y
		556	// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
		557	// "continue" will skip to the next space
		558	#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
		559	for (int dx = (dx0); dx <= (dx1); ++dx) \
		560	{ \
		561	sint16 nx, ny; \
		562	maptile *m = 0; \
		563	\
		564	for (int dy = (dy0); dy <= (dy1); ++dy) \
		565	{ \
		566	/* check to see if we can simply go one down quickly, */ \
		567	/* if not, do it the slow way */ \
		568	if (!m \|\| ++ny >= m->height) \
		569	{ \
		570	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		571	\
		572	if (!xy_normalise (m, nx, ny)) \
		573	m = 0; \
		574	}
		575
		576	#define ordered_mapwalk_end \
		577	} \
		578	}
		579
		580	extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
		581
		582	// loop over every space in the given maprect,
		583	// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
		584	// the iterator code must be a single statement following this macro call, similar to "if"
		585	// "continue" will skip to the next space
		586	#define rect_mapwalk(rect,dx0,dy0) \
		587	statementvar (maptile *, m, (rect)->m) \
		588	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
		589	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
		590	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
		591	statementvar (int, dy, ny + (rect)->dy - (dy0))
		592
		593	// same as ordered_mapwalk, but the walk will not follow any particular
		594	// order (unorded), but is likely faster.
		595	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
		596	// "continue" will skip to the next space
		597	#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
		598	for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
		599	(ox) + (dx0) , (oy) + (dy0) , \
		600	(ox) + (dx1) + 1, (oy) + (dy1) + 1); \
		601	r_e_c_t->m; \
		602	++r_e_c_t) \
		603	rect_mapwalk (r_e_c_t, (ox), (oy))
		604
		605	#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
		606	unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
		607
435	#endif	608	#endif
436		609

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.88 by root, Wed Sep 12 11:10:10 2007 UTC vs. Revision 1.140 by root, Wed May 4 19:04:44 2011 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.88 by root, Wed Sep 12 11:10:10 2007 UTC vs.
Revision 1.140 by root, Wed May 4 19:04:44 2011 UTC