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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.111 by root, Thu Jan 8 19:23:44 2009 UTC vs.
Revision 1.153 by root, Wed Nov 16 23:42:00 2016 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 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	* Deliantra 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 <support@deliantra.net>	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.
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	// tile map index	55	// tile map index - toggling the lowest bit reverses direction
53	enum {	56	enum
54	TILE_UP = 0,	57	{
55	TILE_RIGHT = 1,	58	TILE_NORTH,
		59	TILE_SOUTH,
		60	TILE_WEST,
		61	TILE_EAST,
		62	TILE_UP,
56	TILE_DOWN = 2,	63	TILE_DOWN,
57	TILE_LEFT = 3,	64	TILE_NUM
58	};	65	};
59		66
		67	#define REVERSE_TILE_DIR(dir) ((dir) ^ 1)
		68
60	/* Values for in_memory below */	69	/* Values for state below */
61	enum {	70	enum
62	MAP_ACTIVE,	71	{
63	MAP_INACTIVE, // not used atm.	72	MAP_SWAPPED, // header loaded, nothing else
64	MAP_SWAPPED,	73	MAP_INACTIVE, // in memory, linkable, but not active
65	MAP_LOADING,	74	MAP_ACTIVE, // running!
66	MAP_SAVING,
67	};	75	};
68		76
69	/* 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
70	* 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
71	* 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
…		…
85	* 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
86	* map tiling.	94	* map tiling.
87	*/	95	*/
88	#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)))
89		97
90	/* 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
91	* in the object flags structure.	99	* in the object flags structure.
92	*/	100	*/
93	#define P_BLOCKSVIEW 0x01	101	#define P_BLOCKSVIEW 0x01
94	#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 */
95	#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 */
96	#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,
97	* that means, nothing harmful can be done,	105	* that means, nothing harmful can be done,
98	* such as: bombs, potion usage, alchemy, spells	106	* such as: bombs, potion usage, alchemy, spells
99	* this was introduced to make shops safer	107	* this was introduced to make shops safer
100	* 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 */
101	#define P_IS_ALIVE 0x10 /* something alive is on this space */	111	#define P_IS_ALIVE 0x20 /* something alive is on this space */
102	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
103
104	#define P_UPTODATE 0x80 /* this space is up to date */	112	#define P_UPTODATE 0x80 // this space is up to date
105		113
106	/* 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
107	* 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
108	* 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
109	* 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
110	* lots of duplicate checks currently in the code.	118	* lots of duplicate checks currently in the code.
111	*/	119	*/
112	#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 */
113	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */	121	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
114		122
		123	// persistent flags (pflags) in mapspace
		124	enum
		125	{
		126	PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace
		127	};
		128
115	/* Instead of having numerous arrays that have information on a	129	/* Instead of having numerous arrays that have information on a
116	* particular space (was map, floor, floor2, map_ob),	130	* particular space (was map, floor, floor2, map_ob),
117	* have this structure take care of that information.	131	* have this structure take care of that information.
118	* 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
119	* to extend information about a space.	133	* to extend information about a space.
120	*/	134	*/
121	INTERFACE_CLASS (mapspace)	135	INTERFACE_CLASS (mapspace)
122	struct mapspace	136	struct mapspace
123	{	137	{
124	object *ACC (RW, bot);	138	object *ACC (RW, bot);
125	object ACC (RW, top); / lowest/highest object on this space */	139	object ACC (RW, top); / lowest/highest object on this space */
126	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */	140	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
127	uint32_t smell; // the last count a player was seen here, or 0
128	static uint32_t smellcount; // global smell counter
129	uint8 flags_; /* flags about this space (see the P_ values above) */	141	uint8 flags_; /* flags about this space (see the P_ values above) */
130	sint8 ACC (RW, light); /* How much light this space provides */	142	sint8 ACC (RW, light); /* How much light this space provides */
131	MoveType ACC (RW, move_block); /* What movement types this space blocks */	143	MoveType ACC (RW, move_block); /* What movement types this space blocks */
132	MoveType ACC (RW, move_slow); /* What movement types this space slows */	144	MoveType ACC (RW, move_slow); /* What movement types this space slows */
133	MoveType ACC (RW, move_on); /* What movement types are activated */	145	MoveType ACC (RW, move_on); /* What movement types are activated */
134	MoveType ACC (RW, 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
135		156
136	void update_ ();	157	void update_ ();
137	MTH void update ()	158	MTH void update ()
138	{	159	{
139	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))
140	update_ ();	166	update_ ();
		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);
141	}	171	}
142		172
143	MTH uint8 flags ()	173	MTH uint8 flags ()
144	{	174	{
145	update ();	175	update ();
146	return flags_;	176	return flags_;
147	}	177	}
148		178
		179	MTH void update_up ();
		180
149	MTH void invalidate ()	181	MTH void invalidate ()
150	{	182	{
151	flags_ = 0;	183	flags_ = 0;
152	}	184
		185	if (pflags)
		186	update_up ();
153		187	}
		188
154	MTH object *player ()	189	MTH object *player ()
155	{	190	{
156	object *op;	191	object *op;
157		192
158	if (flags () & P_PLAYER)	193	if (flags () & P_PLAYER)
…		…
162	op = 0;	197	op = 0;
163		198
164	return op;	199	return op;
165	}	200	}
166		201
		202	MTH uint32 items()
		203	{
		204	update ();
		205	return items_;
		206	}
		207
167	// return the item volume on this mapspace in cm³	208	// return the item volume on this mapspace in cm³
168	MTH uint64 volume () const;	209	MTH volume_t volume ()
		210	{
		211	update ();
		212	return volume_ * 1024;
		213	}
169		214
170	bool blocks (MoveType mt) const	215	bool blocks (MoveType mt) const
171	{	216	{
172	return move_block && (mt & move_block) == mt;	217	return move_block && (mt & move_block) == mt;
173	}	218	}
…		…
176	{	221	{
177	return blocks (op->move_type);	222	return blocks (op->move_type);
178	}	223	}
179	};	224	};
180		225
181	// a rectangular area of a map	226	// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
182	struct maprect	227	struct maprect
183	{	228	{
184	maptile *m;	229	maptile *m;
185	int x0, y0;	230	int x0, y0;
186	int x1, y1;	231	int x1, y1;
187	int dx, dy; // offset to go from local coordinates to original tile */	232	int dx, dy; // offset to go from local coordinates to original tile */
188	};	233	};
		234
		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	};
		244
		245	#define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks
		246
		247	//+GPL
189		248
190	struct shopitems : zero_initialised	249	struct shopitems : zero_initialised
191	{	250	{
192	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 */
193	const char name_pl; / plural name */	252	const char name_pl; / plural name */
…		…
233	bool ACC (RW, dirty); /* if true, something was inserted or removed */	292	bool ACC (RW, dirty); /* if true, something was inserted or removed */
234	bool ACC (RW, no_reset); // must not reset this map	293	bool ACC (RW, no_reset); // must not reset this map
235	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
236	* players entering/exiting map	295	* players entering/exiting map
237	*/	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 */
238	sint32 ACC (RW, timeout); /* swapout is set to this */	300	sint32 ACC (RW, timeout); /* swapout is set to this */
239	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 */
240	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
241	* be loaded before used. The map,omap and map_ob
242	* arrays will be allocated when the map is loaded */
243	sint16 players; /* How many players are on this map right now */	302	sint16 players; /* How many players are on this map right now */
244	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 */
245		304
246	bool ACC (RW, per_player);	305	bool ACC (RW, per_player);
247	bool ACC (RW, per_party);	306	bool ACC (RW, per_party);
…		…
251	static sint8 outdoor_darkness; /* the global darkness level outside */	310	static sint8 outdoor_darkness; /* the global darkness level outside */
252		311
253	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 */
254	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 */
255	oblinkpt buttons; / Linked list of linked lists of buttons */	314	oblinkpt buttons; / Linked list of linked lists of buttons */
256	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
257	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
258	sint8 ACC (RW, humid); /* humitidy of this tile */
259	sint8 ACC (RW, windspeed); /* windspeed of this tile */
260	sint8 ACC (RW, winddir); /* direction of wind */
261	sint8 ACC (RW, sky); /* sky conditions */
262	int ACC (RW, worldpartx), ACC (RW, worldparty); /Highly fasten conversion between worldmap and weathermap /
263	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 */
264	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */	316	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
265	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	317	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
266	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	318	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
267	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */	319	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
268	shstr ACC (RW, msg); /* Message map creator may have left */	320	shstr ACC (RW, msg); /* Message map creator may have left */
269	shstr ACC (RW, maplore); /* Map lore information */	321	shstr ACC (RW, maplore); /* Map lore information */
270	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */	322	shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
271	maptile ACC (RW, tile_map[4]); / Next map, linked list */	323	maptile ACC (RW, tile_map[TILE_NUM]); / Next map, linked list */
272	shstr ACC (RW, path); /* Filename of the map */	324	shstr ACC (RW, path); /* Filename of the map */
273	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
274	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace	325	volume_t 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 int run_physics (tick_t tick, int max_objects);
		334	MTH void activate_physics ();
275		335
276	// the maptile:: is neccessary here for the perl interface to work	336	// the maptile:: is neccessary here for the perl interface to work
277	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const	337	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
278	{	338	{
279	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);	339	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
…		…
287	// allocates all (empty) mapspace	347	// allocates all (empty) mapspace
288	MTH void alloc ();	348	MTH void alloc ();
289	// deallocates the mapspaces (and destroys all objects)	349	// deallocates the mapspaces (and destroys all objects)
290	MTH void clear ();	350	MTH void clear ();
291		351
		352	MTH void post_load (); // update cached values in mapspaces etc.
292	MTH void fix_auto_apply ();	353	MTH void fix_auto_apply ();
293	MTH void do_decay_objects ();	354	MTH void do_decay_objects ();
294	MTH void update_buttons ();	355	MTH void update_buttons ();
295	MTH int change_map_light (int change);	356	MTH int change_map_light (int change);
296	MTH int estimate_difficulty () const;	357	MTH int estimate_difficulty () const;
297		358
298	MTH void play_sound (faceidx sound, int x, int y) const;	359	MTH void play_sound (faceidx sound, int x, int y) const;
299	MTH void say_msg (const char *msg, int x, int y) const;	360	MTH void say_msg (const_utf8_string msg, int x, int y) const;
300		361
301	// connected links	362	// connected links
302	oblinkpt *find_link (shstr_tmp id);	363	oblinkpt *find_link (shstr_tmp id);
303	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);	364	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);
304		365
…		…
322	bool _load_objects (object_thawer &thawer);	383	bool _load_objects (object_thawer &thawer);
323	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }	384	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
324		385
325	// save objects into the given file (uses IO_ flags)	386	// save objects into the given file (uses IO_ flags)
326	bool _save_objects (object_freezer &freezer, int flags);	387	bool _save_objects (object_freezer &freezer, int flags);
327	MTH bool _save_objects (const char *path, int flags);	388	MTH bool _save_objects (const_octet_string path, int flags);
328		389
329	// save the header pseudo object _only_	390	// save the header pseudo object _only_
330	bool _save_header (object_freezer &freezer);	391	bool _save_header (object_freezer &freezer);
331	MTH bool _save_header (const char *path);	392	MTH bool _save_header (const_octet_string path);
332		393
333	maptile ();	394	maptile ();
334	maptile (int w, int h);	395	maptile (int w, int h);
		396	void init ();
335	~maptile ();	397	~maptile ();
336		398
337	void do_destroy ();	399	void do_destroy ();
338	void gather_callbacks (AV *&callbacks, event_type event) const;	400	void gather_callbacks (AV *&callbacks, event_type event) const;
339		401
		402	MTH bool linkable () { return state >= MAP_INACTIVE; }
		403
340	MTH int size () const { return width * height; }	404	MTH int size () const { return width * height; }
341		405
342	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);	406	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
343		407
344	MTH void touch () { last_access = runtime; }	408	MTH void touch () { last_access = runtime; }
345		409
		410	// returns the map at given direction. if the map isn't linked yet,
		411	// it will either return false (if load is false), or otherwise try to link
		412	// it - if linking fails because the map is not loaded yet, it will
		413	// start loading the map and return 0.
		414	// thus, if you get 0, the map exists and load is true, then some later
		415	// call (some tick or so later...) will eventually succeed.
346	MTH maptile *tile_available (int dir, bool load = true);	416	MTH maptile *tile_available (int dir, bool load = true);
347		417
348	// find the map that is at coordinate x\|y relative to this map	418	// find the map that is at coordinate x\|y relative to this map
349	// TODO: need a better way than passing by reference	419	// TODO: need a better way than passing by reference
350	// TODO: make perl interface	420	// TODO: make perl interface
…		…
360	{	430	{
361	if (!spaces)	431	if (!spaces)
362	do_load_sync ();	432	do_load_sync ();
363	}	433	}
364		434
365	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);	435	void make_map_floor (char *layout, const char floorstyle, random_map_params *RP);
366	bool generate_random_map (random_map_params *RP);	436	bool generate_random_map (random_map_params *RP);
367		437
368	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL	438	static maptile find_async (const_utf8_string path, maptile original = 0, bool load = true);//PERL
369	static maptile find_sync (const char path, maptile *original = 0);//PERL	439	static maptile find_sync (const_utf8_string path, maptile original = 0);//PERL
370	static maptile find_style_sync (const char dir, const char *file = 0);//PERL	440	static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
371	object *pick_random_object (rand_gen &gen = rndm) const;	441	object *pick_random_object (rand_gen &gen = rndm) const;
372		442
373	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }	443	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
374		444
375	// return an array of maprects corresponding	445	// return an array of maprects corresponding
376	// to the given rectangular area. the last rect will have	446	// to the given rectangular area. the last rect will have
377	// a 0 map pointer.	447	// a 0 map pointer.
378	// the array will be stored in a static memory area,
379	// so recursion is not atm. supported
380	maprect *split_to_tiles (int x0, int y0, int x1, int y1);	448	maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
		449
		450	MTH bool is_in_shop (int x, int y) const;
381	};	451	};
		452
		453	inline bool
		454	object::is_in_shop () const
		455	{
		456	return is_on_map ()
		457	&& map->is_in_shop (x, y);
		458	}
		459
		460	//+GPL
382		461
383	/* This is used by get_rangevector to determine where the other	462	/* This is used by get_rangevector to determine where the other
384	* creature is. get_rangevector takes into account map tiling,	463	* creature is. get_rangevector takes into account map tiling,
385	* so you just can not look the the map coordinates and get the	464	* so you just can not look the the map coordinates and get the
386	* righte value. distance_x/y are distance away, which	465	* righte value. distance_x/y are distance away, which
…		…
403	// and so on.	482	// and so on.
404	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);	483	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
405	int out_of_map (maptile *m, int x, int y);	484	int out_of_map (maptile *m, int x, int y);
406	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);	485	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
407	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);	486	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
408	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);	487	void get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector retval, int flags = 0 /unused*/);
409	int on_same_map (const object op1, const object op2);	488	int on_same_map (const object op1, const object op2);
410	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);	489	int adjacent_map (maptile map1, maptile map2, int dx, int dy);
411		490
412	// adjust map, x and y for tiled maps and return true if the position is valid at all	491	// adjust map, x and y for tiled maps and return true if the position is valid at all
413	static inline bool	492	static inline bool
414	xy_normalise (maptile *&map, sint16 &x, sint16 &y)	493	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
415	{	494	{
…		…
417	return	496	return
418	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))	497	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
419	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);	498	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
420	}	499	}
421	// comaptibility cruft end	500	// comaptibility cruft end
		501
		502	//-GPL
422		503
423	inline mapspace &	504	inline mapspace &
424	object::ms () const	505	object::ms () const
425	{	506	{
426	return map->at (x, y);	507	return map->at (x, y);
…		…
517		598
518	#define ordered_mapwalk_end \	599	#define ordered_mapwalk_end \
519	} \	600	} \
520	}	601	}
521		602
		603	extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
		604
		605	// special "grave" map used to store all removed objects
		606	// till they can be destroyed - saves a lot of checks in the rest
		607	// of the code
		608	struct freed_map
		609	: maptile
		610	{
		611	freed_map ()
		612	: maptile (3, 3)
		613	{
		614	path = "<freed objects map>";
		615	name = "/internal/freed_objects_map";
		616	no_drop = 1;
		617	no_reset = 1;
		618
		619	state = MAP_ACTIVE;
		620	}
		621
		622	~freed_map ()
		623	{
		624	destroy ();
		625	}
		626	};
		627
		628	// initialised in common/shstr.C, due to shstr usage we need defined
		629	// initialisation order!
		630	extern struct freed_map freed_map; // freed objects are moved here to avoid crashes
		631
522	// loop over every space in the given maprect,	632	// loop over every space in the given maprect,
523	// setting m, nx, ny to the map and -coordinate and dx, dy to the offste relative to dx0,dy0	633	// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
524	// the iterator code must be a single statement following this macro call, similar to "if"	634	// the iterator code must be a single statement following this macro call, similar to "if"
525	// "continue" will skip to the next space	635	// "continue" will skip to the next space
526	#define rect_mapwalk(rect,dx0,dy0) \	636	#define rect_mapwalk(rect,dx0,dy0) \
527	statementvar (maptile *, m, (rect)->m) \	637	statementvar (maptile *, m, (rect)->m) \
528	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \	638	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
529	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \	639	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
530	statementvar (int, dx, nx + (rect)->dx - (dx0)) \	640	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
531	statementvar (int, dy, ny + (rect)->dy - (dy0))	641	statementvar (int, dy, ny + (rect)->dy - (dy0))
532		642
533	// same as above, but the walk will not follow any particular	643	// same as ordered_mapwalk, but the walk will not follow any particular
534	// order (unorded), but is likely faster.	644	// order (unorded), but is likely faster.
535	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op	645	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
536	// "continue" will skip to the next space	646	// "continue" will skip to the next space
537	#define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \	647	#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
538	for (maprect *r_e_c_t = (op)->map->split_to_tiles ( \	648	for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
539	(op)->x + (dx0) , (op)->y + (dy0) , \	649	(ox) + (dx0) , (oy) + (dy0) , \
540	(op)->x + (dx1) + 1, (op)->y + (dy1) + 1); \	650	(ox) + (dx1) + 1, (oy) + (dy1) + 1); \
541	r_e_c_t->m; \	651	r_e_c_t->m; \
542	++r_e_c_t) \	652	++r_e_c_t) \
543	rect_mapwalk (r_e_c_t, (op)->x, (op)->y)	653	rect_mapwalk (r_e_c_t, (ox), (oy))
		654
		655	#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
		656	unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
544		657
545	#endif	658	#endif
546		659

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.111 by root, Thu Jan 8 19:23:44 2009 UTC vs. Revision 1.153 by root, Wed Nov 16 23:42:00 2016 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.111 by root, Thu Jan 8 19:23:44 2009 UTC vs.
Revision 1.153 by root, Wed Nov 16 23:42:00 2016 UTC