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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.98 by root, Sun Aug 17 22:46:26 2008 UTC vs.
Revision 1.157 by root, Sat Nov 17 23:40:01 2018 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	5	* 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	6	* Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	7	* Copyright (©) 1992 Frank Tore Johansen
7	*	8	*
8	* Deliantra is free software: you can redistribute it and/or modify	9	* 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	10	* 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	11	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	12	* option) any later version.
12	*	13	*
13	* This program is distributed in the hope that it will be useful,	14	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	17	* GNU General Public License for more details.
17	*	18	*
18	* You should have received a copy of the GNU General Public License	19	* 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/>.	20	* and the GNU General Public License along with this program. If not, see
		21	* <http://www.gnu.org/licenses/>.
20	*	22	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	23	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	24	*/
23		25
24	/*	26	/*
25	* The maptile is allocated each time a new map is opened.	27	* The maptile is allocated each time a new map is opened.
28		30
29	#ifndef MAP_H	31	#ifndef MAP_H
30	#define MAP_H	32	#define MAP_H
31		33
32	#include <tr1/unordered_map>	34	#include <tr1/unordered_map>
		35
		36	//+GPL
33		37
34	#include "region.h"	38	#include "region.h"
35	#include "cfperl.h"	39	#include "cfperl.h"
36		40
37	/* We set this size - this is to make magic map work properly on	41	/* We set this size - this is to make magic map work properly on
…		…
45	* map pointers.	49	* map pointers.
46	*/	50	*/
47	#define MAGIC_MAP_SIZE 50	51	#define MAGIC_MAP_SIZE 50
48	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2	52	#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
49		53
50	#define MAP_LAYERS 3	54	#define MAP_LAYERS 3
51		55
52	/* Values for in_memory below */	56	// tile map index - toggling the lowest bit reverses direction
53	enum {	57	enum
54	MAP_ACTIVE,	58	{
55	MAP_INACTIVE, // not used atm.	59	TILE_NORTH,
56	MAP_SWAPPED,	60	TILE_SOUTH,
57	MAP_LOADING,	61	TILE_WEST,
58	MAP_SAVING,	62	TILE_EAST,
		63	TILE_UP,
		64	TILE_DOWN,
		65	TILE_NUM
		66	};
		67
		68	#define REVERSE_TILE_DIR(dir) ((dir) ^ 1)
		69
		70	/* Values for state below */
		71	enum
		72	{
		73	MAP_SWAPPED, // header loaded, nothing else
		74	MAP_INACTIVE, // in memory, linkable, but not active
		75	MAP_ACTIVE, // running!
59	};	76	};
60		77
61	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	78	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
62	* really be used, as it is multi tile aware. However, there are some cases	79	* really be used, as it is multi tile aware. However, there are some cases
63	* where it is known the map is not tiled or the values are known	80	* where it is known the map is not tiled or the values are known
64	* consistent (eg, op->map, op->x, op->y)	81	* consistent (eg, op->map, op->x, op->y)
65	*/	82	*/
66	// all those macros are herewith declared legacy	83	// all those macros are herewith declared legacy
67	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()	84	#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
68	#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
69	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot	85	#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
70	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top	86	#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
71	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]	87	#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
72	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block	88	#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
73	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow	89	#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
…		…
78	* should almost always be using out_of_map instead, which takes into account	94	* should almost always be using out_of_map instead, which takes into account
79	* map tiling.	95	* map tiling.
80	*/	96	*/
81	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))	97	#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
82		98
83	/* These are used in the MapLook flags element. They are not used in	99	/* These are used in the mapspace flags element. They are not used in
84	* in the object flags structure.	100	* in the object flags structure.
85	*/	101	*/
86	#define P_BLOCKSVIEW 0x01	102	#define P_BLOCKSVIEW 0x01
87	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */	103	#define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */
88	#define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */	104	#define P_NO_CLERIC 0x04 /* no clerical spells cast here */
89	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,	105	#define P_SAFE 0x08 /* If this is set the map tile is a safe space,
90	* that means, nothing harmful can be done,	106	* that means, nothing harmful can be done,
91	* such as: bombs, potion usage, alchemy, spells	107	* such as: bombs, potion usage, alchemy, spells
92	* this was introduced to make shops safer	108	* this was introduced to make shops safer
93	* but is useful in other situations */	109	* but is useful in other situations */
		110
		111	#define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */
94	#define P_IS_ALIVE 0x10 /* something alive is on this space */	112	#define P_IS_ALIVE 0x20 /* something alive is on this space */
95	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
96
97	#define P_UPTODATE 0x80 /* this space is up to date */	113	#define P_UPTODATE 0x80 // this space is up to date
98		114
99	/* The following two values are not stored in the MapLook flags, but instead	115	/* The following two values are not stored in the MapLook flags, but instead
100	* used in the get_map_flags value - that function is used to return	116	* used in the get_map_flags value - that function is used to return
101	* the flag value, as well as other conditions - using a more general	117	* the flag value, as well as other conditions - using a more general
102	* function that does more of the work can hopefully be used to replace	118	* function that does more of the work can hopefully be used to replace
103	* lots of duplicate checks currently in the code.	119	* lots of duplicate checks currently in the code.
104	*/	120	*/
105	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */	121	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
106	#define P_NEW_MAP 0x20000	122	#define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */
107	/* Coordinates passed result in a new tiled map */	123
		124	// persistent flags (pflags) in mapspace
		125	enum
		126	{
		127	PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace
		128	};
108		129
109	/* Instead of having numerous arrays that have information on a	130	/* Instead of having numerous arrays that have information on a
110	* particular space (was map, floor, floor2, map_ob),	131	* particular space (was map, floor, floor2, map_ob),
111	* have this structure take care of that information.	132	* have this structure take care of that information.
112	* This puts it all in one place, and should also make it easier	133	* This puts it all in one place, and should also make it easier
…		…
114	*/	135	*/
115	INTERFACE_CLASS (mapspace)	136	INTERFACE_CLASS (mapspace)
116	struct mapspace	137	struct mapspace
117	{	138	{
118	object *ACC (RW, bot);	139	object *ACC (RW, bot);
119	object ACC (RW, top); / lowest/highest object on this space */	140	object ACC (RW, top); / lowest/highest object on this space */
120	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */	141	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
121	uint8 flags_; /* flags about this space (see the P_ values above) */	142	uint8 flags_; /* flags about this space (see the P_ values above) */
122	sint8 ACC (RW, light); /* How much light this space provides */	143	sint8 ACC (RW, light); /* How much light this space provides */
123	MoveType ACC (RW, move_block); /* What movement types this space blocks */	144	MoveType ACC (RW, move_block); /* What movement types this space blocks */
124	MoveType ACC (RW, move_slow); /* What movement types this space slows */	145	MoveType ACC (RW, move_slow); /* What movement types this space slows */
125	MoveType ACC (RW, move_on); /* What movement types are activated */	146	MoveType ACC (RW, move_on); /* What movement types are activated */
126	MoveType ACC (RW, move_off); /* What movement types are activated */	147	MoveType ACC (RW, move_off); /* What movement types are activated */
		148	uint16_t ACC (RW, items_); // saturates at 64k
		149	uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024)
		150	uint32_t ACC (RW, smell); // the last count a player was seen here, or 0
		151	static uint32_t ACC (RW, smellcount); // global smell counter
		152
		153	uint8_t pflags; // additional, persistent flags
		154	uint8_t pad [3]; // pad to 64 bytes on LP64 systems
		155
		156	//-GPL
127		157
128	void update_ ();	158	void update_ ();
129	MTH void update ()	159	MTH void update ()
130	{	160	{
131	if (!(flags_ & P_UPTODATE))	161	// we take advantage of the fact that 0x80 is the sign bit
		162	// to generate more efficient code on many cpus
		163	//assert (sint8 (P_UPTODATE) < 0);
		164	//assert (sint8 (-1 & ~P_UPTODATE) >= 0);
		165
		166	if (expect_false (sint8 (flags_) >= 0))
132	update_ ();	167	update_ ();
		168
		169	// must be true by now (gcc seems content with only the second test)
		170	ecb_assume (sint8 (flags_) < 0);
		171	ecb_assume (flags_ & P_UPTODATE);
133	}	172	}
134		173
135	MTH uint8 flags ()	174	MTH uint8 flags ()
136	{	175	{
137	update ();	176	update ();
138	return flags_;	177	return flags_;
139	}	178	}
		179
		180	MTH void update_up ();
140		181
		182	MTH void invalidate ()
		183	{
		184	flags_ = 0;
		185
		186	if (pflags)
		187	update_up ();
		188	}
		189
141	MTH object *player ()	190	MTH object *player ()
142	{	191	{
143	object *op;	192	object *op;
144		193
145	if (flags () & P_PLAYER)	194	if (flags () & P_PLAYER)
…		…
149	op = 0;	198	op = 0;
150		199
151	return op;	200	return op;
152	}	201	}
153		202
		203	MTH uint32 items()
		204	{
		205	update ();
		206	return items_;
		207	}
		208
154	// return the item volume on this mapspace in cm³	209	// return the item volume on this mapspace in cm³
155	MTH uint64 volume () const;	210	MTH volume_t volume ()
		211	{
		212	update ();
		213	return volume_ * 1024;
		214	}
156		215
157	bool blocks (MoveType mt) const	216	bool blocks (MoveType mt) const
158	{	217	{
159	return move_block && (mt & move_block) == mt;	218	return move_block && (mt & move_block) == mt;
160	}	219	}
…		…
162	bool blocks (object *op) const	221	bool blocks (object *op) const
163	{	222	{
164	return blocks (op->move_type);	223	return blocks (op->move_type);
165	}	224	}
166	};	225	};
		226
		227	// a rectangular area of a map, used my split_to_tiles/unordered_mapwalk
		228	struct maprect
		229	{
		230	maptile *m;
		231	int x0, y0;
		232	int x1, y1;
		233	int dx, dy; // offset to go from local coordinates to original tile */
		234	};
		235
		236	// (refcounted) list of objects on this map that need physics processing
		237	struct physics_queue
		238	: unordered_vector<object *>
		239	{
		240	int i; // already processed
		241	physics_queue ();
		242	~physics_queue ();
		243	object *pop ();
		244	};
		245
		246	#define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks
		247
		248	//+GPL
167		249
168	struct shopitems : zero_initialised	250	struct shopitems : zero_initialised
169	{	251	{
170	const char name; / name of the item in question, null if it is the default item */	252	const char name; / name of the item in question, null if it is the default item */
171	const char name_pl; / plural name */	253	const char name_pl; / plural name */
172	int typenum; /* itemtype number we need to match 0 if it is the default price */	254	int typenum; /* itemtype number we need to match 0 if it is the default price */
173	sint8 strength; /* the degree of specialisation the shop has in this item,	255	sint8 strength; /* the degree of specialisation the shop has in this item,
174	* as a percentage from -100 to 100 */	256	* as a percentage from -100 to 100 */
175	int index; /* being the size of the shopitems array. */	257	int index; /* being the size of the shopitems array. */
176	};	258	};
177		259
178	// map I/O, what to load/save	260	// map I/O, what to load/save
…		…
180	IO_HEADER = 0x01, // the "arch map" pseudo object	262	IO_HEADER = 0x01, // the "arch map" pseudo object
181	IO_OBJECTS = 0x02, // the non-unique objects	263	IO_OBJECTS = 0x02, // the non-unique objects
182	IO_UNIQUES = 0x04, // unique objects	264	IO_UNIQUES = 0x04, // unique objects
183	};	265	};
184		266
185	/* In general, code should always use the macros	267	/* In general, code should always use the macros
186	* above (or functions in map.c) to access many of the	268	* above (or functions in map.c) to access many of the
187	* values in the map structure. Failure to do this will	269	* values in the map structure. Failure to do this will
188	* almost certainly break various features. You may think	270	* almost certainly break various features. You may think
189	* it is safe to look at width and height values directly	271	* it is safe to look at width and height values directly
190	* (or even through the macros), but doing so will completely	272	* (or even through the macros), but doing so will completely
191	* break map tiling.	273	* break map tiling.
…		…
199	region_ptr regionmap; / index to region */	281	region_ptr regionmap; / index to region */
200		282
201	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */	283	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
202		284
203	shstr ACC (RW, name); /* Name of map as given by its creator */	285	shstr ACC (RW, name); /* Name of map as given by its creator */
204	region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by	286	region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
205	* points to the struct containing all the properties of	287	* points to the struct containing all the properties of
206	* the region */	288	* the region */
207	double ACC (RW, reset_time);	289	double ACC (RW, reset_time);
208	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map	290	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
209	* should be reset	291	* should be reset
210	*/	292	*/
211	bool ACC (RW, dirty); /* if true, something was inserted or removed */	293	bool ACC (RW, dirty); /* if true, something was inserted or removed */
212	bool ACC (RW, no_reset); // must not reset this map	294	bool ACC (RW, no_reset); // must not reset this map
213	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by	295	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
214	* players entering/exiting map	296	* players entering/exiting map
215	*/	297	*/
		298	uint8 ACC (RW, state); /* If not true, the map has been freed and must
		299	* be loaded before used. The map,omap and map_ob
		300	* arrays will be allocated when the map is loaded */
216	sint32 ACC (RW, timeout); /* swapout is set to this */	301	sint32 ACC (RW, timeout); /* swapout is set to this */
217	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */	302	sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
218	uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
219	* be loaded before used. The map,omap and map_ob
220	* arrays will be allocated when the map is loaded */
221	sint16 players; /* How many players are on this map right now */	303	sint16 players; /* How many players are on this map right now */
222	uint16 ACC (RW, difficulty); /* What level the player should be to play here */	304	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
223		305
224	bool ACC (RW, per_player);	306	bool ACC (RW, per_player);
225	bool ACC (RW, per_party);	307	bool ACC (RW, per_party);
226	bool ACC (RW, outdoor); /* True if an outdoor map */	308	bool ACC (RW, outdoor); /* True if an outdoor map */
227	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */	309	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
228	uint8 ACC (RW, darkness); /* indicates level of darkness of map */	310	sint8 ACC (RW, darkness); /* indicates level of darkness of map */
		311	static sint8 outdoor_darkness; /* the global darkness level outside */
229		312
230	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */	313	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
231	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */	314	uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
232	oblinkpt buttons; / Linked list of linked lists of buttons */	315	oblinkpt buttons; / Linked list of linked lists of buttons */
233	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
234	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
235	sint8 ACC (RW, humid); /* humitidy of this tile */
236	sint8 ACC (RW, windspeed); /* windspeed of this tile */
237	sint8 ACC (RW, winddir); /* direction of wind */
238	sint8 ACC (RW, sky); /* sky conditions */
239	int ACC (RW, worldpartx), ACC (RW, worldparty); /Highly fasten conversion between worldmap and weathermap /
240	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */	316	struct shopitems shopitems; / a semi-colon seperated list of item-types the map's shop will trade in */
241	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */	317	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
242	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	318	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
243	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	319	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
244	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */	320	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
245	shstr ACC (RW, msg); /* Message map creator may have left */	321	shstr ACC (RW, msg); /* Message map creator may have left */
246	shstr ACC (RW, maplore); /* Map lore information */	322	shstr ACC (RW, maplore); /* Map lore information */
247	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */	323	shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */
248	maptile ACC (RW, tile_map[4]); / Next map, linked list */	324	maptile ACC (RW, tile_map[TILE_NUM]); / Next map, linked list */
249	shstr ACC (RW, path); /* Filename of the map */	325	shstr ACC (RW, path); /* Filename of the map */
250	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
251	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace	326	volume_t ACC (RW, max_volume); // maximum volume for all items on a mapspace
		327	int ACC (RW, max_items); // maximum number of items on a mapspace
		328
		329	//-GPL
		330
		331	physics_queue pq[PHYSICS_QUEUES];
		332	MTH void queue_physics (object *ob, int after = 0);
		333	MTH void queue_physics_at (int x, int y);
		334	MTH int run_physics (tick_t tick, int max_objects);
		335	MTH void activate_physics ();
		336
		337	// the maptile:: is neccessary here for the perl interface to work
		338	MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const
		339	{
		340	return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS);
		341	}
		342
		343	static void adjust_daylight ();
252		344
253	MTH void activate ();	345	MTH void activate ();
254	MTH void deactivate ();	346	MTH void deactivate ();
255		347
256	// allocates all (empty) mapspace	348	// allocates all (empty) mapspace
257	MTH void alloc ();	349	MTH void alloc ();
258	// deallocates the mapspaces (and destroys all objects)	350	// deallocates the mapspaces (and destroys all objects)
259	MTH void clear ();	351	MTH void clear ();
260		352
		353	MTH void post_load (); // update cached values in mapspaces etc.
261	MTH void fix_auto_apply ();	354	MTH void fix_auto_apply ();
262	MTH void do_decay_objects ();	355	MTH void do_decay_objects ();
263	MTH void update_buttons ();	356	MTH void update_buttons ();
264	MTH int change_map_light (int change);	357	MTH int change_map_light (int change);
265	static void change_all_map_light (int change); //PERL
266	MTH void set_darkness_map ();
267	MTH int estimate_difficulty () const;	358	MTH int estimate_difficulty () const;
268		359
269	MTH void play_sound (faceidx sound, int x, int y) const;	360	MTH void play_sound (faceidx sound, int x, int y) const;
		361	MTH void say_msg (const_utf8_string msg, int x, int y) const;
		362
		363	// connected links
		364	oblinkpt *find_link (shstr_tmp id);
		365	MTH void trigger (shstr_tmp id, int state = 1, object activator = 0, object originator = 0);
270		366
271	// set the given flag on all objects in the map	367	// set the given flag on all objects in the map
272	MTH void set_object_flag (int flag, int value = 1);	368	MTH void set_object_flag (int flag, int value = 1);
273	MTH void post_load_original ();	369	MTH void post_load_original ();
274		370
…		…
288	bool _load_objects (object_thawer &thawer);	384	bool _load_objects (object_thawer &thawer);
289	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }	385	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
290		386
291	// save objects into the given file (uses IO_ flags)	387	// save objects into the given file (uses IO_ flags)
292	bool _save_objects (object_freezer &freezer, int flags);	388	bool _save_objects (object_freezer &freezer, int flags);
293	MTH bool _save_objects (const char *path, int flags);	389	MTH bool _save_objects (const_octet_string path, int flags);
294		390
295	// save the header pseudo object _only_	391	// save the header pseudo object _only_
296	bool _save_header (object_freezer &freezer);	392	bool _save_header (object_freezer &freezer);
297	MTH bool _save_header (const char *path);	393	MTH bool _save_header (const_octet_string path);
298		394
299	maptile ();	395	maptile ();
300	maptile (int w, int h);	396	maptile (int w, int h);
		397	void init ();
301	~maptile ();	398	~maptile ();
302		399
303	void do_destroy ();	400	void do_destroy ();
304	void gather_callbacks (AV *&callbacks, event_type event) const;	401	void gather_callbacks (AV *&callbacks, event_type event) const;
305		402
		403	MTH bool linkable () { return state >= MAP_INACTIVE; }
		404
306	MTH int size () const { return width * height; }	405	MTH int size () const { return width * height; }
307		406
308	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);	407	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
309		408
310	MTH void touch () { last_access = runtime; }	409	MTH void touch () { last_access = runtime; }
311		410
		411	// returns the map at given direction. if the map isn't linked yet,
		412	// it will either return false (if load is false), or otherwise try to link
		413	// it - if linking fails because the map is not loaded yet, it will
		414	// start loading the map and return 0.
		415	// thus, if you get 0, the map exists and load is true, then some later
		416	// call (some tick or so later...) will eventually succeed.
312	MTH bool tile_available (int dir, bool load = true);	417	MTH maptile *tile_available (int dir, bool load = true);
313		418
314	// find the map that is at coordinate x\|y relative to this map	419	// find the map that is at coordinate x\|y relative to this map
315	// TODO: need a better way than passing by reference	420	// TODO: need a better way than passing by reference
316	// TODO: make perl interface	421	// TODO: make perl interface
317	maptile *xy_find (sint16 &x, sint16 &y);	422	maptile *xy_find (sint16 &x, sint16 &y);
…		…
326	{	431	{
327	if (!spaces)	432	if (!spaces)
328	do_load_sync ();	433	do_load_sync ();
329	}	434	}
330		435
331	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);	436	void make_map_floor (char *layout, const char floorstyle, random_map_params *RP);
332	bool generate_random_map (random_map_params *RP);	437	bool generate_random_map (random_map_params *RP);
333		438
334	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL	439	static maptile find_async (const_utf8_string path, maptile original = 0, bool load = true);//PERL
335	static maptile find_sync (const char path, maptile *original = 0);//PERL	440	static maptile find_sync (const_utf8_string path, maptile original = 0);//PERL
336	static maptile find_style_sync (const char dir, const char *file = 0);//PERL	441	static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL
337	object *pick_random_object (rand_gen &gen = rndm) const;	442	object *pick_random_object (rand_gen &gen = rndm) const;
338		443
339	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }	444	mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
340	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }	445
		446	// return an array of maprects corresponding
		447	// to the given rectangular area. the last rect will have
		448	// a 0 map pointer.
		449	maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1);
		450
		451	MTH bool is_in_shop (int x, int y) const;
341	};	452	};
		453
		454	inline bool
		455	object::is_in_shop () const
		456	{
		457	return is_on_map ()
		458	&& map->is_in_shop (x, y);
		459	}
		460
		461	//+GPL
342		462
343	/* This is used by get_rangevector to determine where the other	463	/* This is used by get_rangevector to determine where the other
344	* creature is. get_rangevector takes into account map tiling,	464	* creature is. get_rangevector takes into account map tiling,
345	* so you just can not look the the map coordinates and get the	465	* so you just can not look the the map coordinates and get the
346	* righte value. distance_x/y are distance away, which	466	* righte value. distance_x/y are distance away, which
…		…
363	// and so on.	483	// and so on.
364	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);	484	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
365	int out_of_map (maptile *m, int x, int y);	485	int out_of_map (maptile *m, int x, int y);
366	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);	486	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
367	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);	487	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
368	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);	488	void get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector retval, int flags = 0 /unused*/);
369	int on_same_map (const object op1, const object op2);	489	int on_same_map (const object op1, const object op2);
370	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);	490	int adjacent_map (maptile map1, maptile map2, int dx, int dy);
371		491
372	// adjust map, x and y for tiled maps and return true if the position is valid at all	492	// adjust map, x and y for tiled maps and return true if the position is valid at all
373	static inline bool	493	static inline bool
374	xy_normalise (maptile *&map, sint16 &x, sint16 &y)	494	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
375	{	495	{
…		…
378	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))	498	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
379	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);	499	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
380	}	500	}
381	// comaptibility cruft end	501	// comaptibility cruft end
382		502
		503	//-GPL
		504
383	inline mapspace &	505	inline mapspace &
384	object::ms () const	506	object::ms () const
385	{	507	{
386	return map->at (x, y);	508	return map->at (x, y);
387	}	509	}
…		…
406	return *this;	528	return *this;
407	}	529	}
408		530
409	mapxy &move (int dir)	531	mapxy &move (int dir)
410	{	532	{
411	return move (freearr_x [dir], freearr_y [dir]);	533	return move (DIRX (dir), DIRY (dir));
412	}	534	}
413		535
414	operator void () const { return (void )m; }	536	operator void () const { return (void )m; }
415	mapxy &operator =(const object *op)	537	mapxy &operator =(const object *op)
416	{	538	{
…		…
448	y = pos.y;	570	y = pos.y;
449		571
450	return pos;	572	return pos;
451	}	573	}
452		574
		575	// iterate over a rectangular area relative to op
		576	// can be used as a single statement, but both iterate macros
		577	// invocations must not be followed by a ";"
		578	// see common/los.C for usage example
		579	// the walk will be ordered, outer loop x, inner loop y
		580	// m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op
		581	// "continue" will skip to the next space
		582	#define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \
		583	for (int dx = (dx0); dx <= (dx1); ++dx) \
		584	{ \
		585	sint16 nx, ny; \
		586	maptile *m = 0; \
		587	\
		588	for (int dy = (dy0); dy <= (dy1); ++dy) \
		589	{ \
		590	/* check to see if we can simply go one down quickly, */ \
		591	/* if not, do it the slow way */ \
		592	if (!m \|\| ++ny >= m->height) \
		593	{ \
		594	nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \
		595	\
		596	if (!xy_normalise (m, nx, ny)) \
		597	m = 0; \
		598	}
		599
		600	#define ordered_mapwalk_end \
		601	} \
		602	}
		603
		604	extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations
		605
		606	// special "grave" map used to store all removed objects
		607	// till they can be destroyed - saves a lot of checks in the rest
		608	// of the code
		609	struct freed_map
		610	: maptile
		611	{
		612	freed_map ()
		613	: maptile (3, 3)
		614	{
		615	path = "<freed objects map>";
		616	name = "/internal/freed_objects_map";
		617	no_drop = 1;
		618	no_reset = 1;
		619
		620	state = MAP_ACTIVE;
		621	}
		622
		623	~freed_map ()
		624	{
		625	destroy ();
		626	}
		627	};
		628
		629	// initialised in common/shstr.C, due to shstr usage we need defined
		630	// initialisation order!
		631	extern struct freed_map freed_map; // freed objects are moved here to avoid crashes
		632
		633	// loop over every space in the given maprect,
		634	// setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0
		635	// the iterator code must be a single statement following this macro call, similar to "if"
		636	// "continue" will skip to the next space
		637	#define rect_mapwalk(rect,dx0,dy0) \
		638	statementvar (maptile *, m, (rect)->m) \
		639	for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \
		640	for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \
		641	statementvar (int, dx, nx + (rect)->dx - (dx0)) \
		642	statementvar (int, dy, ny + (rect)->dy - (dy0))
		643
		644	// same as ordered_mapwalk, but the walk will not follow any particular
		645	// order (unorded), but is likely faster.
		646	// m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op
		647	// "continue" will skip to the next space
		648	#define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \
		649	for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \
		650	(ox) + (dx0) , (oy) + (dy0) , \
		651	(ox) + (dx1) + 1, (oy) + (dy1) + 1); \
		652	r_e_c_t->m; \
		653	++r_e_c_t) \
		654	rect_mapwalk (r_e_c_t, (ox), (oy))
		655
		656	#define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \
		657	unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1)
		658
453	#endif	659	#endif
454		660

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.98 by root, Sun Aug 17 22:46:26 2008 UTC vs. Revision 1.157 by root, Sat Nov 17 23:40:01 2018 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.98 by root, Sun Aug 17 22:46:26 2008 UTC vs.
Revision 1.157 by root, Sat Nov 17 23:40:01 2018 UTC