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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.83 by root, Wed Aug 15 04:57:48 2007 UTC vs.
Revision 1.152 by root, Mon Nov 12 03:14:32 2012 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,2012 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 - toggling the lowest bit reverses direction
53	enum {	56	enum
54	MAP_IN_MEMORY,	57	{
55	MAP_SWAPPED,	58	TILE_NORTH,
56	MAP_LOADING,	59	TILE_SOUTH,
57	MAP_SAVING,	60	TILE_WEST,
		61	TILE_EAST,
		62	TILE_UP,
		63	TILE_DOWN,
		64	TILE_NUM
		65	};
		66
		67	#define REVERSE_TILE_DIR(dir) ((dir) ^ 1)
		68
		69	/* Values for state below */
		70	enum
		71	{
		72	MAP_SWAPPED, // header loaded, nothing else
		73	MAP_INACTIVE, // in memory, linkable, but not active
		74	MAP_ACTIVE, // running!
58	};	75	};
59		76
60	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	77	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
61	* really be used, as it is multi tile aware. However, there are some cases	78	* really be used, as it is multi tile aware. However, there are some cases
62	* where it is known the map is not tiled or the values are known	79	* where it is known the map is not tiled or the values are known
63	* consistent (eg, op->map, op->x, op->y)	80	* consistent (eg, op->map, op->x, op->y)
64	*/	81	*/
65	// all those macros are herewith declared legacy	82	// all those macros are herewith declared legacy
66	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()	83	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
67	#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
68	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot	84	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
69	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top	85	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
70	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]	86	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
71	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block	87	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
72	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow	88	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
…		…
77	* 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
78	* map tiling.	94	* map tiling.
79	*/	95	*/
80	#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)))
81		97
82	/* 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
83	* in the object flags structure.	99	* in the object flags structure.
84	*/	100	*/
85	#define P_BLOCKSVIEW 0x01	101	#define P_BLOCKSVIEW 0x01
86	#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 */
87	#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 */
88	#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,
89	* that means, nothing harmful can be done,	105	* that means, nothing harmful can be done,
90	* such as: bombs, potion usage, alchemy, spells	106	* such as: bombs, potion usage, alchemy, spells
91	* this was introduced to make shops safer	107	* this was introduced to make shops safer
92	* 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 */
93	#define P_IS_ALIVE 0x10 /* something alive is on this space */	111	#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 */	112	#define P_UPTODATE 0x80 // this space is up to date
97		113
98	/* 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
99	* 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
100	* 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
101	* 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
102	* lots of duplicate checks currently in the code.	118	* lots of duplicate checks currently in the code.
103	*/	119	*/
104	#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 */
105	#define P_NEW_MAP 0x20000	121	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
106	/* Coordinates passed result in a new tiled map */
107		122
108	/* P_NO_PASS is used for ob_blocked() return value. It needs	123	// persistent flags (pflags) in mapspace
109	* to be here to make sure the bits don't match with anything.	124	enum
110	*/	125	{
111	#define P_NO_PASS 0x80000	126	PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace
		127	};
112		128
113	/* Instead of having numerous arrays that have information on a	129	/* Instead of having numerous arrays that have information on a
114	* particular space (was map, floor, floor2, map_ob),	130	* particular space (was map, floor, floor2, map_ob),
115	* have this structure take care of that information.	131	* have this structure take care of that information.
116	* 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
117	* to extend information about a space.	133	* to extend information about a space.
118	*/	134	*/
		135	INTERFACE_CLASS (mapspace)
119	struct mapspace	136	struct mapspace
120	{	137	{
		138	object *ACC (RW, bot);
121	object bot, top; /* lowest/highest object on this space */	139	object ACC (RW, top); / lowest/highest object on this space */
122	object faces_obj[MAP_LAYERS];/ face objects for the 3 layers */	140	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
123	uint8 flags_; /* flags about this space (see the P_ values above) */	141	uint8 flags_; /* flags about this space (see the P_ values above) */
124	sint8 light; /* How much light this space provides */	142	sint8 ACC (RW, light); /* How much light this space provides */
125	MoveType move_block; /* What movement types this space blocks */	143	MoveType ACC (RW, move_block); /* What movement types this space blocks */
126	MoveType move_slow; /* What movement types this space slows */	144	MoveType ACC (RW, move_slow); /* What movement types this space slows */
127	MoveType move_on; /* What movement types are activated */	145	MoveType ACC (RW, move_on); /* What movement types are activated */
128	MoveType move_off; /* What movement types are activated */	146	MoveType ACC (RW, move_off); /* What movement types are activated */
		147	uint16_t ACC (RW, items_); // saturates at 64k
		148	uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
		149	uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
		150	static uint32_t ACC (RW, smellcount); // global smell counter
		151
		152	uint8_t pflags; // additional, persistent flags
		153	uint8_t pad [3]; // pad to 64 bytes on LP64 systems
		154
		155	//-GPL
129		156
130	void update_ ();	157	void update_ ();
131	void update ()	158	MTH void update ()
132	{	159	{
133	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))
134	update_ ();	166	update_ ();
135	}
136		167
		168	// must be true by now (gcc seems content with only the second test)
		169	assume (sint8 (flags_) < 0);
		170	assume (flags_ & P_UPTODATE);
		171	}
		172
137	uint8 flags ()	173	MTH uint8 flags ()
138	{	174	{
139	update ();	175	update ();
140	return flags_;	176	return flags_;
141	}	177	}
		178
		179	MTH void update_up ();
142		180
143	// maybe only inline quick flags_ checking?	181	MTH void invalidate ()
		182	{
		183	flags_ = 0;
		184
		185	if (pflags)
		186	update_up ();
		187	}
		188
144	object *player ()	189	MTH object *player ()
145	{	190	{
146	// search from the top, because players are usually on top	191	object *op;
147	// make usually == always and this non-amortized O(1)	192
148	// could gte rid of P_PLAYER, too, then
149	if (flags () & P_PLAYER)	193	if (flags () & P_PLAYER)
150	for (object *op = top; op; op = op->below)	194	for (op = top; op->type != PLAYER; op = op->below)
151	if (op->type == PLAYER)	195	;
152	return op;	196	else
		197	op = 0;
153		198
154	return 0;	199	return op;
		200	}
		201
		202	MTH uint32 items()
		203	{
		204	update ();
		205	return items_;
155	}	206	}
156		207
157	// return the item volume on this mapspace in cm³	208	// return the item volume on this mapspace in cm³
158	uint64 volume () const;	209	MTH volume_t volume ()
		210	{
		211	update ();
		212	return volume_ * 1024;
		213	}
		214
		215	bool blocks (MoveType mt) const
		216	{
		217	return move_block && (mt & move_block) == mt;
		218	}
		219
		220	bool blocks (object *op) const
		221	{
		222	return blocks (op->move_type);
		223	}
159	};	224	};
		225
		226	// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
		227	struct maprect
		228	{
		229	maptile *m;
		230	int x0, y0;
		231	int x1, y1;
		232	int dx, dy; // offset to go from local coordinates to original tile */
		233	};
		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
160		248
161	struct shopitems : zero_initialised	249	struct shopitems : zero_initialised
162	{	250	{
163	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 */
164	const char name_pl; / plural name */	252	const char name_pl; / plural name */
…		…
204	bool ACC (RW, dirty); /* if true, something was inserted or removed */	292	bool ACC (RW, dirty); /* if true, something was inserted or removed */
205	bool ACC (RW, no_reset); // must not reset this map	293	bool ACC (RW, no_reset); // must not reset this map
206	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
207	* players entering/exiting map	295	* players entering/exiting map
208	*/	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 */
209	sint32 ACC (RW, timeout); /* swapout is set to this */	300	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 */	301	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 */	302	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 */	303	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
216		304
217	bool ACC (RW, per_player);	305	bool ACC (RW, per_player);
218	bool ACC (RW, per_party);	306	bool ACC (RW, per_party);
219	bool ACC (RW, outdoor); /* True if an outdoor map */	307	bool ACC (RW, outdoor); /* True if an outdoor map */
220	bool ACC (RW, nodrop); /* avoid dropping anything on this map */	308	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
221	uint8 ACC (RW, darkness); /* indicates level of darkness of map */	309	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
		310	static sint8 outdoor_darkness; /* the global darkness level outside */
222		311
223	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 */
224	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 */
225	oblinkpt buttons; / Linked list of linked lists of buttons */	314	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 */	315	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 */	316	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
235	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	317	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
236	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	318	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
237	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */	319	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
238	shstr ACC (RW, msg); /* Message map creator may have left */	320	shstr ACC (RW, msg); /* Message map creator may have left */
239	shstr ACC (RW, maplore); /* Map lore information */	321	shstr ACC (RW, maplore); /* Map lore information */
240	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */	322	shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
241	maptile ACC (RW, tile_map[4]); / Next map, linked list */	323	maptile ACC (RW, tile_map[TILE_NUM]); / Next map, linked list */
242	shstr ACC (RW, path); /* Filename of the map */	324	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	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 ();
		335
		336	// the maptile:: is neccessary here for the perl interface to work
		337	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		338	{
		339	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		340	}
		341
		342	static void adjust_daylight ();
245		343
246	MTH void activate ();	344	MTH void activate ();
247	MTH void deactivate ();	345	MTH void deactivate ();
248		346
249	// allocates all (empty) mapspace	347	// allocates all (empty) mapspace
250	MTH void alloc ();	348	MTH void alloc ();
251	// deallocates the mapspaces (and destroys all objects)	349	// deallocates the mapspaces (and destroys all objects)
252	MTH void clear ();	350	MTH void clear ();
253		351
		352	MTH void post_load (); // update cached values in mapspaces etc.
254	MTH void fix_auto_apply ();	353	MTH void fix_auto_apply ();
255	MTH void do_decay_objects ();	354	MTH void do_decay_objects ();
256	MTH void update_buttons ();	355	MTH void update_buttons ();
257	MTH int change_map_light (int change);	356	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;	357	MTH int estimate_difficulty () const;
261		358
262	MTH void play_sound (faceidx sound, int x, int y) const;	359	MTH void play_sound (faceidx sound, int x, int y) const;
		360	MTH void say_msg (const_utf8_string msg, int x, int y) const;
		361
		362	// connected links
		363	oblinkpt *find_link (shstr_tmp id);
		364	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);
263		365
264	// set the given flag on all objects in the map	366	// set the given flag on all objects in the map
265	MTH void set_object_flag (int flag, int value = 1);	367	MTH void set_object_flag (int flag, int value = 1);
		368	MTH void post_load_original ();
266		369
267	MTH void link_multipart_objects ();	370	MTH void link_multipart_objects ();
268	MTH void clear_unique_items ();	371	MTH void clear_unique_items ();
269		372
270	MTH void clear_header ();	373	MTH void clear_header ();
271	MTH void clear_links_to (maptile *m);	374	MTH void clear_links_to (maptile *m);
272		375
273	MTH struct region *region (int x, int y) const;	376	MTH struct region *region (int x, int y) const;
274		377
275	// loas the header pseudo-object	378	// load the header pseudo-object
276	bool _load_header (object_thawer &thawer);	379	bool _load_header (object_thawer &thawer);
277	MTH bool _load_header (const char *path);	380	MTH bool _load_header (object_thawer thawer) { return _load_header (thawer); }
278		381
279	// load objects into the map	382	// load objects into the map
280	bool _load_objects (object_thawer &thawer);	383	bool _load_objects (object_thawer &thawer);
281	MTH bool _load_objects (const char *path, bool skip_header = true);	384	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
282		385
283	// save objects into the given file (uses IO_ flags)	386	// save objects into the given file (uses IO_ flags)
284	bool _save_objects (object_freezer &freezer, int flags);	387	bool _save_objects (object_freezer &freezer, int flags);
285	MTH bool _save_objects (const char *path, int flags);	388	MTH bool _save_objects (const_octet_string path, int flags);
286		389
287	// save the header pseudo object _only_	390	// save the header pseudo object _only_
288	bool _save_header (object_freezer &freezer);	391	bool _save_header (object_freezer &freezer);
289	MTH bool _save_header (const char *path);	392	MTH bool _save_header (const_octet_string path);
290		393
291	maptile ();	394	maptile ();
292	maptile (int w, int h);	395	maptile (int w, int h);
		396	void init ();
293	~maptile ();	397	~maptile ();
294		398
295	void do_destroy ();	399	void do_destroy ();
296	void gather_callbacks (AV *&callbacks, event_type event) const;	400	void gather_callbacks (AV *&callbacks, event_type event) const;
297		401
		402	MTH bool linkable () { return state >= MAP_INACTIVE; }
		403
298	MTH int size () const { return width * height; }	404	MTH int size () const { return width * height; }
299		405
300	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);
301		407
302	MTH void touch () { last_access = runtime; }	408	MTH void touch () { last_access = runtime; }
		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.
		416	MTH maptile *tile_available (int dir, bool load = true);
303		417
304	// 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
305	// TODO: need a better way than passing by reference	419	// TODO: need a better way than passing by reference
306	// TODO: make perl interface	420	// TODO: make perl interface
307	maptile *xy_find (sint16 &x, sint16 &y);	421	maptile *xy_find (sint16 &x, sint16 &y);
…		…
316	{	430	{
317	if (!spaces)	431	if (!spaces)
318	do_load_sync ();	432	do_load_sync ();
319	}	433	}
320		434
321	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);
322	bool generate_random_map (random_map_params *RP);	436	bool generate_random_map (random_map_params *RP);
323		437
324	static maptile find_async (const char path, maptile *original = 0);//PERL	438	static maptile find_async (const_utf8_string path, maptile original = 0, bool load = true);//PERL
325	static maptile find_sync (const char path, maptile *original = 0);//PERL	439	static maptile find_sync (const_utf8_string path, maptile original = 0);//PERL
326	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
327	MTH object *pick_random_object () const;	441	object *pick_random_object (rand_gen &gen = rndm) const;
328		442
329	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }	443	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
330	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }	444
		445	// return an array of maprects corresponding
		446	// to the given rectangular area. the last rect will have
		447	// a 0 map pointer.
		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;
331	};	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
332		461
333	/* This is used by get_rangevector to determine where the other	462	/* This is used by get_rangevector to determine where the other
334	* creature is. get_rangevector takes into account map tiling,	463	* creature is. get_rangevector takes into account map tiling,
335	* 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
336	* righte value. distance_x/y are distance away, which	465	* righte value. distance_x/y are distance away, which
…		…
346	int distance_y;	475	int distance_y;
347	int direction;	476	int direction;
348	object *part;	477	object *part;
349	};	478	};
350		479
		480	// comaptibility cruft start
351	//TODO: these should be refactored into things like xy_normalise	481	//TODO: these should be refactored into things like xy_normalise
352	// and so on.	482	// and so on.
353	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);
354	int ob_blocked (const object ob, maptile m, sint16 x, sint16 y);
355	int out_of_map (maptile *m, int x, int y);	484	int out_of_map (maptile *m, int x, int y);
356	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);	485	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
357	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);
358	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*/);
359	int on_same_map (const object op1, const object op2);	488	int on_same_map (const object op1, const object op2);
360	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);
361		490
362	// 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
363	inline bool	492	static inline bool
364	xy_normalise (maptile *&map, sint16 &x, sint16 &y)	493	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
365	{	494	{
366	// when in range, do a quick return, otherwise go the slow route	495	// when in range, do a quick return, otherwise go the slow route
367	return	496	return
368	(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))
369	\|\| !(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);
370	}	499	}
		500	// comaptibility cruft end
		501
		502	//-GPL
371		503
372	inline mapspace &	504	inline mapspace &
373	object::ms () const	505	object::ms () const
374	{	506	{
375	return map->at (x, y);	507	return map->at (x, y);
376	}	508	}
377		509
		510	struct mapxy {
		511	maptile *m;
		512	sint16 x, y;
		513
		514	mapxy (maptile *m, sint16 x, sint16 y)
		515	: m(m), x(x), y(y)
		516	{ }
		517
		518	mapxy (object *op)
		519	: m(op->map), x(op->x), y(op->y)
		520	{ }
		521
		522	mapxy &move (int dx, int dy)
		523	{
		524	x += dx;
		525	y += dy;
		526
		527	return *this;
		528	}
		529
		530	mapxy &move (int dir)
		531	{
		532	return move (freearr_x [dir], freearr_y [dir]);
		533	}
		534
		535	operator void () const { return (void )m; }
		536	mapxy &operator =(const object *op)
		537	{
		538	m = op->map;
		539	x = op->x;
		540	y = op->y;
		541
		542	return *this;
		543	}
		544
		545	mapspace *operator ->() const { return &m->at (x, y); }
		546	mapspace &operator * () const { return m->at (x, y); }
		547
		548	bool normalise ()
		549	{
		550	return xy_normalise (m, x, y);
		551	}
		552
		553	mapspace &ms () const
		554	{
		555	return m->at (x, y);
		556	}
		557
		558	object insert (object op, object *originator = 0, int flags = 0) const
		559	{
		560	return m->insert (op, x, y, originator, flags);
		561	}
		562	};
		563
		564	inline const mapxy &
		565	object::operator =(const mapxy &pos)
		566	{
		567	map = pos.m;
		568	x = pos.x;
		569	y = pos.y;
		570
		571	return pos;
		572	}
		573
		574	// iterate over a rectangular area relative to op
		575	// can be used as a single statement, but both iterate macros
		576	// invocations must not be followed by a ";"
		577	// see common/los.C for usage example
		578	// the walk will be ordered, outer loop x, inner loop y
		579	// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
		580	// "continue" will skip to the next space
		581	#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
		582	for (int dx = (dx0); dx <= (dx1); ++dx) \
		583	{ \
		584	sint16 nx, ny; \
		585	maptile *m = 0; \
		586	\
		587	for (int dy = (dy0); dy <= (dy1); ++dy) \
		588	{ \
		589	/* check to see if we can simply go one down quickly, */ \
		590	/* if not, do it the slow way */ \
		591	if (!m \|\| ++ny >= m->height) \
		592	{ \
		593	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		594	\
		595	if (!xy_normalise (m, nx, ny)) \
		596	m = 0; \
		597	}
		598
		599	#define ordered_mapwalk_end \
		600	} \
		601	}
		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
		632	// loop over every space in the given maprect,
		633	// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
		634	// the iterator code must be a single statement following this macro call, similar to "if"
		635	// "continue" will skip to the next space
		636	#define rect_mapwalk(rect,dx0,dy0) \
		637	statementvar (maptile *, m, (rect)->m) \
		638	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
		639	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
		640	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
		641	statementvar (int, dy, ny + (rect)->dy - (dy0))
		642
		643	// same as ordered_mapwalk, but the walk will not follow any particular
		644	// order (unorded), but is likely faster.
		645	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
		646	// "continue" will skip to the next space
		647	#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
		648	for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
		649	(ox) + (dx0) , (oy) + (dy0) , \
		650	(ox) + (dx1) + 1, (oy) + (dy1) + 1); \
		651	r_e_c_t->m; \
		652	++r_e_c_t) \
		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)
		657
378	#endif	658	#endif
379		659

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.83 by root, Wed Aug 15 04:57:48 2007 UTC vs. Revision 1.152 by root, Mon Nov 12 03:14:32 2012 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.83 by root, Wed Aug 15 04:57:48 2007 UTC vs.
Revision 1.152 by root, Mon Nov 12 03:14:32 2012 UTC