[ViewVC] Diff of: cvs/deliantra/server/common/map.C

Comparing deliantra/server/common/map.C (file contents):
Revision 1.99 by root, Mon Apr 16 06:23:39 2007 UTC vs.
Revision 1.213 by root, Sat May 7 20:03:27 2011 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* This program 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 2 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, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		24
25	#include <unistd.h>	25	#include <unistd.h>
26		26
27	#include "global.h"	27	#include "global.h"
28	#include "funcpoint.h"
29
30	#include "loader.h"
31
32	#include "path.h"	28	#include "path.h"
33		29
34	/*	30	//+GPL
35	* This makes a path absolute outside the world of Crossfire.
36	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
37	* and returns the pointer to a static array containing the result.
38	* it really should be called create_mapname
39	*/
40	const char *
41	create_pathname (const char *name)
42	{
43	static char buf[8192];
44	snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45	return buf;
46	}
47		31
48	/*	32	sint8 maptile::outdoor_darkness;
49	* This function checks if a file with the given path exists.
50	* -1 is returned if it fails, otherwise the mode of the file
51	* is returned.
52	* It tries out all the compression suffixes listed in the uncomp[] array.
53	*
54	* If prepend_dir is set, then we call create_pathname (which prepends
55	* libdir & mapdir). Otherwise, we assume the name given is fully
56	* complete.
57	* Only the editor actually cares about the writablity of this -
58	* the rest of the code only cares that the file is readable.
59	* when the editor goes away, the call to stat should probably be
60	* replaced by an access instead (similar to the windows one, but
61	* that seems to be missing the prepend_dir processing
62	*/
63	int
64	check_path (const char *name, int prepend_dir)
65	{
66	char buf[MAX_BUF];
67
68	char *endbuf;
69	struct stat statbuf;
70	int mode = 0;
71
72	if (prepend_dir)
73	assign (buf, create_pathname (name));
74	else
75	assign (buf, name);
76
77	/* old method (strchr(buf, '\0')) seemd very odd to me -
78	* this method should be equivalant and is clearer.
79	* Can not use strcat because we need to cycle through
80	* all the names.
81	*/
82	endbuf = buf + strlen (buf);
83
84	if (stat (buf, &statbuf))
85	return -1;
86	if (!S_ISREG (statbuf.st_mode))
87	return (-1);
88
89	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) \|\|
90	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IROTH))
91	mode \|= 4;
92
93	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) \|\|
94	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IWOTH))
95	mode \|= 2;
96
97	return (mode);
98	}
99		33
100	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	34	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101	* one function that just returns a P_.. value (see map.h)	35	* one function that just returns a P_.. value (see map.h)
102	* it will also do map translation for tiled maps, returning	36	* it will also do map translation for tiled maps, returning
103	* new values into newmap, nx, and ny. Any and all of those	37	* new values into newmap, nx, and ny. Any and all of those
138	* by the caller.	72	* by the caller.
139	*/	73	*/
140	int	74	int
141	blocked_link (object ob, maptile m, int sx, int sy)	75	blocked_link (object ob, maptile m, int sx, int sy)
142	{	76	{
143	object *tmp;
144	int mflags, blocked;
145
146	/* Make sure the coordinates are valid - they should be, as caller should	77	/* Make sure the coordinates are valid - they should be, as caller should
147	* have already checked this.	78	* have already checked this.
148	*/	79	*/
149	if (OUT_OF_REAL_MAP (m, sx, sy))	80	if (OUT_OF_REAL_MAP (m, sx, sy))
150	{	81	{
151	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");	82	LOG (llevError \| logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
152	return 1;	83	return 1;
153	}	84	}
154		85
155	/* Save some cycles - instead of calling get_map_flags(), just get the value	86	mapspace &ms = m->at (sx, sy);
156	* directly.
157	*/
158	mflags = m->at (sx, sy).flags ();
159		87
160	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	88	int mflags = ms.flags ();
		89	int blocked = ms.move_block;
161		90
162	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
163	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
164	* things we need to do for players.	93	* things we need to do for players.
165	*/	94	*/
166	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
167	return 0;	96	return 0;
168		97
169	/* if there isn't anytyhing alive on this space, and this space isn't	98	/* if there isn't anything alive on this space, and this space isn't
170	* otherwise blocked, we can return now. Only if there is a living	99	* otherwise blocked, we can return now. Only if there is a living
171	* creature do we need to investigate if it is part of this creature	100	* creature do we need to investigate if it is part of this creature
172	* or another. Likewise, only if something is blocking us do we	101	* or another. Likewise, only if something is blocking us do we
173	* need to investigate if there is a special circumstance that would	102	* need to investigate if there is a special circumstance that would
174	* let the player through (inventory checkers for example)	103	* let the player through (inventory checkers for example)
175	*/	104	*/
176	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	105	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
177	return 0;	106	return 0;
178		107
179	if (ob->head != NULL)
180	ob = ob->head;	108	ob = ob->head_ ();
181		109
182	/* We basically go through the stack of objects, and if there is	110	/* We basically go through the stack of objects, and if there is
183	* some other object that has NO_PASS or FLAG_ALIVE set, return	111	* some other object that has NO_PASS or FLAG_ALIVE set, return
184	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
185	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
186	*/	114	*/
187	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
188	{	116	{
189		117	if (OB_MOVE_BLOCK (ob, tmp))
190	/* This must be before the checks below. Code for inventory checkers. */
191	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
192	{	118	{
193	/* If last_sp is set, the player/monster needs an object,	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
194	* so we check for it. If they don't have it, they can't	120	if (RESULT_INT (0))
195	* pass through this space.	121	return 1;
196	*/	122	else
197	if (tmp->last_sp)	123	continue;
		124
		125	if (tmp->type == CHECK_INV)
198	{	126	{
199	if (check_inv_recursive (ob, tmp) == NULL)	127	bool have = check_inv_recursive (ob, tmp);
		128
		129	// last_sp set means we block if we don't have.
		130	if (logical_xor (have, tmp->last_sp))
200	return 1;	131	return 1;
201	else	132	}
202	continue;	133	else if (tmp->type == T_MATCH)
		134	{
		135	// T_MATCH allows "entrance" iff the match is true
		136	// == blocks if the match fails
		137
		138	// we could have used an INVOKE_OBJECT, but decided against it, as we
		139	// assume that T_MATCH is relatively common.
		140	if (!match (tmp->slaying, ob, tmp, ob))
		141	return 1;
203	}	142	}
204	else	143	else
205	{	144	return 1; // unconditional block
206	/* In this case, the player must not have the object -	145
207	* if they do, they can't pass through.
208	*/
209	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
210	return 1;
211	else
212	continue;
213	}
214	} /* if check_inv */
215	else	146	} else {
216	{	147	// space does not block the ob, directly, but
217	/* Broke apart a big nasty if into several here to make	148	// anything alive that is not a door still
218	* this more readable. first check - if the space blocks	149	// blocks anything
219	* movement, can't move here.	150
220	* second - if a monster, can't move there, unles it is a	151	if (tmp->flag [FLAG_ALIVE]
221	* hidden dm	152	&& tmp->type != DOOR
222	*/	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
223	if (OB_MOVE_BLOCK (ob, tmp))
224	return 1;
225	if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
226	tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
227	return 1;	154	return 1;
228	}	155	}
229
230	}	156	}
		157
231	return 0;	158	return 0;
232	}	159	}
233		160
234	/*	161	/*
235	* Returns true if the given object can't fit in the given spot.	162	* Returns the blocking object if the given object can't fit in the given
236	* This is meant for multi space objects - for single space objecs,	163	* spot. This is meant for multi space objects - for single space objecs,
237	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
238	* of object. This function goes through all the parts of the	165	* of object. This function goes through all the parts of the multipart
239	* multipart object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
240	*	167	*
241	* While this doesn't call out of map, the get_map_flags does.	168	* While this doesn't call out of map, the get_map_flags does.
242	*	169	*
243	* This function has been used to deprecate arch_out_of_map -	170	* This function has been used to deprecate arch_out_of_map -
244	* this function also does that check, and since in most cases,	171	* this function also does that check, and since in most cases,
…		…
255	*	182	*
256	* Note this used to be arch_blocked, but with new movement	183	* Note this used to be arch_blocked, but with new movement
257	* code, we need to have actual object to check its move_type	184	* code, we need to have actual object to check its move_type
258	* against the move_block values.	185	* against the move_block values.
259	*/	186	*/
260	int	187	bool
261	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	188	object::blocked (maptile *m, int x, int y) const
262	{	189	{
263	archetype *tmp;	190	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
264	int flag;
265	maptile *m1;
266	sint16 sx, sy;
267
268	if (!ob)
269	{
270	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271	if (flag & P_OUT_OF_MAP)
272	return P_OUT_OF_MAP;
273
274	/* don't have object, so don't know what types would block */
275	return m1->at (sx, sy).move_block;
276	}	191	{
		192	mapxy pos (m, x + tmp->x, y + tmp->y);
277		193
278	for (tmp = ob->arch; tmp; tmp = tmp->more)	194	if (!pos.normalise ())
279	{	195	return 1;
280	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281		196
282	if (flag & P_OUT_OF_MAP)	197	mapspace &ms = *pos;
283	return P_OUT_OF_MAP;	198
284	if (flag & P_IS_ALIVE)	199	if (ms.flags () & P_IS_ALIVE)
285	return P_IS_ALIVE;	200	return 1;
286		201
287	mapspace &ms = m1->at (sx, sy);	202	/* However, often ob doesn't have any move type
288		203	* (signifying non-moving objects)
289	/* find_first_free_spot() calls this function. However, often
290	* ob doesn't have any move type (when used to place exits)
291	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	204	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292	*/	205	*/
293
294	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	206	if (!move_type && ms.move_block != MOVE_ALL)
295	continue;	207	continue;
296		208
297	/* Note it is intentional that we check ob - the movement type of the	209	/* Note it is intentional that we check ob - the movement type of the
298	* head of the object should correspond for the entire object.	210	* head of the object should correspond for the entire object.
299	*/	211	*/
300	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	212	if (ms.blocks (move_type))
301	return P_NO_PASS;	213	return 1;
302	}	214	}
303		215
304	return 0;	216	return 0;
305	}	217	}
306		218
307	/* When the map is loaded, load_object does not actually insert objects	219	//-GPL
308	* into inventory, but just links them. What this does is go through
309	* and insert them properly.
310	* The object 'container' is the object that contains the inventory.
311	* This is needed so that we can update the containers weight.
312	*/
313	void
314	fix_container (object *container)
315	{
316	object tmp = container->inv, next;
317
318	container->inv = 0;
319	while (tmp)
320	{
321	next = tmp->below;
322	if (tmp->inv)
323	fix_container (tmp);
324
325	insert_ob_in_ob (tmp, container);
326	tmp = next;
327	}
328
329	/* sum_weight will go through and calculate what all the containers are
330	* carrying.
331	*/
332	sum_weight (container);
333	}
334		220
335	void	221	void
336	maptile::set_object_flag (int flag, int value)	222	maptile::set_object_flag (int flag, int value)
337	{	223	{
338	if (!spaces)	224	if (!spaces)
…		…
340		226
341	for (mapspace *ms = spaces + size (); ms-- > spaces; )	227	for (mapspace *ms = spaces + size (); ms-- > spaces; )
342	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	228	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343	tmp->flag [flag] = value;	229	tmp->flag [flag] = value;
344	}	230	}
		231
		232	void
		233	maptile::post_load_original ()
		234	{
		235	if (!spaces)
		236	return;
		237
		238	set_object_flag (FLAG_OBJ_ORIGINAL);
		239
		240	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		241	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		242	INVOKE_OBJECT (RESET, tmp);
		243	}
		244
		245	void
		246	maptile::post_load ()
		247	{
		248	#if 0
		249	if (!spaces)
		250	return;
		251
		252	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		253	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		254	; // nop
		255	#endif
		256	}
		257
		258	//+GPL
345		259
346	/* link_multipart_objects go through all the objects on the map looking	260	/* link_multipart_objects go through all the objects on the map looking
347	* for objects whose arch says they are multipart yet according to the	261	* for objects whose arch says they are multipart yet according to the
348	* info we have, they only have the head (as would be expected when	262	* info we have, they only have the head (as would be expected when
349	* they are saved).	263	* they are saved).
…		…
353	{	267	{
354	if (!spaces)	268	if (!spaces)
355	return;	269	return;
356		270
357	for (mapspace *ms = spaces + size (); ms-- > spaces; )	271	for (mapspace *ms = spaces + size (); ms-- > spaces; )
358	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	272	{
		273	object *op = ms->bot;
		274	while (op)
359	{	275	{
360	/* already multipart - don't do anything more */	276	/* already multipart - don't do anything more */
361	if (!tmp->head && !tmp->more)	277	if (op->head_ () == op && !op->more && op->arch->more)
362	{
363	/* If there is nothing more to this object, this for loop
364	* won't do anything.
365	*/
366	archetype *at;
367	object last, op;
368	for (at = tmp->arch->more, last = tmp;
369	at;
370	at = at->more, last = op)
371	{	278	{
372	op = arch_to_object (at);	279	op->remove ();
		280	op->expand_tail ();
373		281
374	/* update x,y coordinates */	282	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
375	op->x += tmp->x;	283	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
376	op->y += tmp->y;	284	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
377	op->head = tmp;
378	op->map = this;
379	last->more = op;
380	op->name = tmp->name;
381	op->title = tmp->title;
382
383	/* we could link all the parts onto tmp, and then just
384	* call insert_ob_in_map once, but the effect is the same,
385	* as insert_ob_in_map will call itself with each part, and
386	* the coding is simpler to just to it here with each part.
387	*/
388	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	285	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		286
		287	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		288	// so we have to reset the iteration through the mapspace
389	}	289	}
		290	else
		291	op = op->above;
390	}	292	}
391	}	293	}
392	}	294	}
		295
		296	//-GPL
393		297
394	/*	298	/*
395	* Loads (ands parses) the objects into a given map from the specified	299	* Loads (ands parses) the objects into a given map from the specified
396	* file pointer.	300	* file pointer.
397	*/	301	*/
398	bool	302	bool
399	maptile::_load_objects (object_thawer &f)	303	maptile::_load_objects (object_thawer &f)
400	{	304	{
401	for (;;)	305	for (;;)
402	{	306	{
403	coroapi::cede_every (1000); // cede once in a while	307	coroapi::cede_to_tick (); // cede once in a while
404		308
405	switch (f.kw)	309	switch (f.kw)
406	{	310	{
407	case KW_arch:	311	case KW_arch:
408	if (object *op = object::read (f, this))	312	if (object *op = object::read (f, this))
409	{	313	{
		314	// TODO: why?
410	if (op->inv)	315	if (op->inv)
		316	{
		317	op->carrying = 0;
411	sum_weight (op);	318	op->update_weight ();
		319	}
412		320
413	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		322	{
		323	// we insert manually because
		324	// a) its way faster
		325	// b) we remove manually, too, and there are good reasons for that
		326	// c) it's correct
		327	mapspace &ms = at (op->x, op->y);
		328
		329	op->flag [FLAG_REMOVED] = false;
		330
		331	op->above = 0;
		332	op->below = ms.top;
		333
		334	*(ms.top ? &ms.top->above : &ms.bot) = op;
		335
		336	ms.top = op;
		337	ms.flags_ = 0;
		338	}
		339	else
		340	{
		341	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		342	op->destroy ();
		343	}
414	}	344	}
415		345
416	continue;	346	continue;
417		347
418	case KW_EOF:	348	case KW_EOF:
…		…
431	}	361	}
432		362
433	void	363	void
434	maptile::activate ()	364	maptile::activate ()
435	{	365	{
436	if (!spaces)	366	if (state != MAP_INACTIVE)
437	return;	367	return;
438		368
439	for (mapspace *ms = spaces + size (); ms-- > spaces; )	369	for (mapspace *ms = spaces + size (); ms-- > spaces; )
440	for (object *op = ms->bot; op; op = op->above)	370	for (object *op = ms->bot; op; op = op->above)
441	op->activate_recursive ();	371	op->activate_recursive ();
		372
		373	state = MAP_ACTIVE;
		374
		375	activate_physics ();
442	}	376	}
443		377
444	void	378	void
445	maptile::deactivate ()	379	maptile::deactivate ()
446	{	380	{
447	if (!spaces)	381	if (state != MAP_ACTIVE)
448	return;	382	return;
449		383
450	for (mapspace *ms = spaces + size (); ms-- > spaces; )	384	for (mapspace *ms = spaces + size (); ms-- > spaces; )
451	for (object *op = ms->bot; op; op = op->above)	385	for (object *op = ms->bot; op; op = op->above)
452	op->deactivate_recursive ();	386	op->deactivate_recursive ();
		387
		388	state = MAP_INACTIVE;
453	}	389	}
454		390
455	bool	391	bool
456	maptile::_save_objects (object_freezer &f, int flags)	392	maptile::_save_objects (object_freezer &f, int flags)
457	{	393	{
458	coroapi::cede ();	394	coroapi::cede_to_tick ();
459		395
460	if (flags & IO_HEADER)	396	if (flags & IO_HEADER)
461	_save_header (f);	397	_save_header (f);
462		398
463	if (!spaces)	399	if (!spaces)
464	return false;	400	return false;
465		401
466	for (int i = 0; i < size (); ++i)	402	for (int i = 0; i < size (); ++i)
467	{	403	{
468	int unique = 0;	404	bool unique = 0;
		405
469	for (object *op = spaces [i].bot; op; op = op->above)	406	for (object *op = spaces [i].bot; op; op = op->above)
470	{	407	{
471	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	408	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
472	unique = 1;
473		409
474	if (!op->can_map_save ())	410	if (expect_false (!op->can_map_save ()))
475	continue;	411	continue;
476		412
477	if (unique \|\| op->flag [FLAG_UNIQUE])	413	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
478	{	414	{
479	if (flags & IO_UNIQUES)	415	if (flags & IO_UNIQUES)
480	op->write (f);	416	op->write (f);
481	}	417	}
482	else if (flags & IO_OBJECTS)	418	else if (expect_true (flags & IO_OBJECTS))
483	op->write (f);	419	op->write (f);
484	}	420	}
485	}	421	}
486		422
487	coroapi::cede ();	423	coroapi::cede_to_tick ();
488		424
489	return true;	425	return true;
490	}
491
492	bool
493	maptile::_load_objects (const char *path, bool skip_header)
494	{
495	object_thawer f (path);
496
497	if (!f)
498	return false;
499
500	f.next ();
501
502	if (skip_header)
503	for (;;)
504	{
505	keyword kw = f.kw;
506	f.skip ();
507	if (kw == KW_end)
508	break;
509	}
510
511	return _load_objects (f);
512	}	426	}
513		427
514	bool	428	bool
515	maptile::_save_objects (const char *path, int flags)	429	maptile::_save_objects (const char *path, int flags)
516	{	430	{
…		…
520	return false;	434	return false;
521		435
522	return freezer.save (path);	436	return freezer.save (path);
523	}	437	}
524		438
525	maptile::maptile ()	439	void
		440	maptile::init ()
526	{	441	{
527	in_memory = MAP_SWAPPED;	442	state = MAP_SWAPPED;
528		443
529	/* The maps used to pick up default x and y values from the	444	/* The maps used to pick up default x and y values from the
530	* map archetype. Mimic that behaviour.	445	* map archetype. Mimic that behaviour.
531	*/	446	*/
532	width = 16;	447	width = 16;
533	height = 16;	448	height = 16;
534	timeout = 300;	449	timeout = 300;
535	max_nrof = 1000; // 1000 items of anything	450	max_items = MAX_ITEM_PER_ACTION;
536	max_volume = 2000000; // 2m³	451	max_volume = 2000000; // 2m³
537	}
538
539	maptile::maptile (int w, int h)
540	{
541	in_memory = MAP_SWAPPED;
542
543	width = w;
544	height = h;
545	reset_timeout = 0;	452	reset_timeout = 0;
546	timeout = 300;
547	enter_x = 0;	453	enter_x = 0;
548	enter_y = 0;	454	enter_y = 0;
		455	}
		456
		457	maptile::maptile ()
		458	{
		459	init ();
		460	}
		461
		462	maptile::maptile (int w, int h)
		463	{
		464	init ();
		465
		466	width = w;
		467	height = h;
549		468
550	alloc ();	469	alloc ();
551	}	470	}
552		471
553	/*	472	/*
…		…
561	if (spaces)	480	if (spaces)
562	return;	481	return;
563		482
564	spaces = salloc0<mapspace> (size ());	483	spaces = salloc0<mapspace> (size ());
565	}	484	}
		485
		486	//+GPL
566		487
567	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	488	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
568	* corresponding to that string. Memory is allocated for this, it must be freed	489	* corresponding to that string. Memory is allocated for this, it must be freed
569	* at a later date.	490	* at a later date.
570	* Called by parse_map_headers below.	491	* Called by parse_map_headers below.
…		…
647	return items;	568	return items;
648	}	569	}
649		570
650	/* opposite of parse string, this puts the string that was originally fed in to	571	/* opposite of parse string, this puts the string that was originally fed in to
651	* the map (or something equivilent) into output_string. */	572	* the map (or something equivilent) into output_string. */
652	static void	573	static const char *
653	print_shop_string (maptile m, char output_string)	574	print_shop_string (maptile *m)
654	{	575	{
655	int i;	576	static dynbuf_text buf; buf.clear ();
656	char tmp[MAX_BUF];	577	bool first = true;
657		578
658	strcpy (output_string, "");
659	for (i = 0; i < m->shopitems[0].index; i++)	579	for (int i = 0; i < m->shopitems[0].index; i++)
660	{	580	{
		581	if (!first)
		582	buf << ';';
		583
		584	first = false;
		585
661	if (m->shopitems[i].typenum)	586	if (m->shopitems[i].typenum)
662	{	587	{
663	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
664	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	589	buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
665	else	590	else
666	sprintf (tmp, "%s;", m->shopitems[i].name);	591	buf.printf ("%s", m->shopitems[i].name);
667	}	592	}
668	else	593	else
669	{	594	{
670	if (m->shopitems[i].strength)	595	if (m->shopitems[i].strength)
671	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	596	buf.printf ("*:%d", m->shopitems[i].strength);
672	else	597	else
673	sprintf (tmp, "*");	598	buf.printf ("*");
674	}	599	}
675
676	strcat (output_string, tmp);
677	}	600	}
		601
		602	return buf;
678	}	603	}
		604
		605	//-GPL
679		606
680	/* This loads the header information of the map. The header	607	/* This loads the header information of the map. The header
681	* contains things like difficulty, size, timeout, etc.	608	* contains things like difficulty, size, timeout, etc.
682	* this used to be stored in the map object, but with the	609	* this used to be stored in the map object, but with the
683	* addition of tiling, fields beyond that easily named in an	610	* addition of tiling, fields beyond that easily named in an
…		…
691	bool	618	bool
692	maptile::_load_header (object_thawer &thawer)	619	maptile::_load_header (object_thawer &thawer)
693	{	620	{
694	for (;;)	621	for (;;)
695	{	622	{
696	keyword kw = thawer.get_kv ();
697
698	switch (kw)	623	switch (thawer.kw)
699	{	624	{
700	case KW_msg:	625	case KW_msg:
701	thawer.get_ml (KW_endmsg, msg);	626	thawer.get_ml (KW_endmsg, msg);
702	break;	627	break;
703		628
704	case KW_lore: // CF+ extension	629	case KW_lore: // deliantra extension
705	thawer.get_ml (KW_endlore, maplore);	630	thawer.get_ml (KW_endlore, maplore);
706	break;	631	break;
707		632
708	case KW_maplore:	633	case KW_maplore:
709	thawer.get_ml (KW_endmaplore, maplore);	634	thawer.get_ml (KW_endmaplore, maplore);
…		…
726	case KW_shopgreed: thawer.get (shopgreed); break;	651	case KW_shopgreed: thawer.get (shopgreed); break;
727	case KW_shopmin: thawer.get (shopmin); break;	652	case KW_shopmin: thawer.get (shopmin); break;
728	case KW_shopmax: thawer.get (shopmax); break;	653	case KW_shopmax: thawer.get (shopmax); break;
729	case KW_shoprace: thawer.get (shoprace); break;	654	case KW_shoprace: thawer.get (shoprace); break;
730	case KW_outdoor: thawer.get (outdoor); break;	655	case KW_outdoor: thawer.get (outdoor); break;
731	case KW_temp: thawer.get (temp); break;
732	case KW_pressure: thawer.get (pressure); break;
733	case KW_humid: thawer.get (humid); break;
734	case KW_windspeed: thawer.get (windspeed); break;
735	case KW_winddir: thawer.get (winddir); break;
736	case KW_sky: thawer.get (sky); break;
737		656
738	case KW_per_player: thawer.get (per_player); break;	657	case KW_per_player: thawer.get (per_player); break;
739	case KW_per_party: thawer.get (per_party); break;	658	case KW_per_party: thawer.get (per_party); break;
		659	case KW_no_reset: thawer.get (no_reset); break;
		660	case KW_no_drop: thawer.get (no_drop); break;
740		661
741	case KW_region: default_region = region::find (thawer.get_str ()); break;	662	case KW_region: thawer.get (default_region); break;
742	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
743		664
744	// old names new names	665	// old names new names
745	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	666	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
746	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	667	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
750	case KW_value: case KW_swap_time: thawer.get (timeout); break;	671	case KW_value: case KW_swap_time: thawer.get (timeout); break;
751	case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;	672	case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;
752	case KW_invisible: case KW_darkness: thawer.get (darkness); break;	673	case KW_invisible: case KW_darkness: thawer.get (darkness); break;
753	case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;	674	case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;
754		675
755	case KW_tile_path_1: thawer.get (tile_path [0]); break;	676	case KW_tile_path_1: thawer.get (tile_path [TILE_NORTH]); break;
756	case KW_tile_path_2: thawer.get (tile_path [1]); break;	677	case KW_tile_path_2: thawer.get (tile_path [TILE_EAST ]); break;
757	case KW_tile_path_3: thawer.get (tile_path [2]); break;	678	case KW_tile_path_3: thawer.get (tile_path [TILE_SOUTH]); break;
758	case KW_tile_path_4: thawer.get (tile_path [3]); break;	679	case KW_tile_path_4: thawer.get (tile_path [TILE_WEST ]); break;
		680	case KW_tile_path_5: thawer.get (tile_path [TILE_UP ]); break;
		681	case KW_tile_path_6: thawer.get (tile_path [TILE_DOWN ]); break;
		682
		683	case KW_ERROR:
		684	set_key_text (thawer.kw_str, thawer.value);
		685	break;
759		686
760	case KW_end:	687	case KW_end:
		688	thawer.next ();
761	return true;	689	return true;
762		690
763	default:	691	default:
764	if (!thawer.parse_error ("map", 0))	692	if (!thawer.parse_error ("map"))
765	return false;	693	return false;
766	break;	694	break;
767	}	695	}
		696
		697	thawer.next ();
768	}	698	}
769		699
770	abort ();	700	abort ();
771	}	701	}
772		702
773	bool	703	//+GPL
774	maptile::_load_header (const char *path)
775	{
776	object_thawer thawer (path);
777
778	if (!thawer)
779	return false;
780
781	return _load_header (thawer);
782	}
783		704
784	/******************************************************************************	705	/******************************************************************************
785	* This is the start of unique map handling code	706	* This is the start of unique map handling code
786	*****************************************************************************/	707	*****************************************************************************/
787		708
…		…
794	int unique = 0;	715	int unique = 0;
795	for (object *op = spaces [i].bot; op; )	716	for (object *op = spaces [i].bot; op; )
796	{	717	{
797	object *above = op->above;	718	object *above = op->above;
798		719
799	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	720	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
800	unique = 1;	721	unique = 1;
801		722
802	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	723	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] \|\| unique))
803	{
804	op->destroy_inv (false);
805	op->destroy ();	724	op->destroy ();
806	}
807		725
808	op = above;	726	op = above;
809	}	727	}
810	}	728	}
811	}	729	}
812		730
		731	//-GPL
		732
813	bool	733	bool
814	maptile::_save_header (object_freezer &freezer)	734	maptile::_save_header (object_freezer &freezer)
815	{	735	{
816	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	736	#define MAP_OUT(k) freezer.put (KW(k), k)
817	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	737	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
818		738
819	MAP_OUT2 (arch, "map");	739	MAP_OUT2 (arch, CS(map));
820		740
821	if (name) MAP_OUT (name);	741	if (name) MAP_OUT (name);
822	MAP_OUT (swap_time);	742	MAP_OUT (swap_time);
823	MAP_OUT (reset_time);	743	MAP_OUT (reset_time);
824	MAP_OUT (reset_timeout);	744	MAP_OUT (reset_timeout);
825	MAP_OUT (fixed_resettime);	745	MAP_OUT (fixed_resettime);
		746	MAP_OUT (no_reset);
		747	MAP_OUT (no_drop);
826	MAP_OUT (difficulty);	748	MAP_OUT (difficulty);
827
828	if (default_region) MAP_OUT2 (region, default_region->name);	749	if (default_region) MAP_OUT2 (region, default_region->name);
829		750
830	if (shopitems)	751	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
831	{
832	char shop[MAX_BUF];
833	print_shop_string (this, shop);
834	MAP_OUT2 (shopitems, shop);
835	}
836
837	MAP_OUT (shopgreed);	752	MAP_OUT (shopgreed);
838	MAP_OUT (shopmin);	753	MAP_OUT (shopmin);
839	MAP_OUT (shopmax);	754	MAP_OUT (shopmax);
840	if (shoprace) MAP_OUT (shoprace);	755	if (shoprace) MAP_OUT (shoprace);
841	MAP_OUT (darkness);	756
842	MAP_OUT (width);	757	MAP_OUT (width);
843	MAP_OUT (height);	758	MAP_OUT (height);
844	MAP_OUT (enter_x);	759	MAP_OUT (enter_x);
845	MAP_OUT (enter_y);	760	MAP_OUT (enter_y);
846		761	MAP_OUT (darkness);
847	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
848	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
849
850	MAP_OUT (outdoor);	762	MAP_OUT (outdoor);
851	MAP_OUT (temp);	763
852	MAP_OUT (pressure);	764	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
853	MAP_OUT (humid);	765	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
854	MAP_OUT (windspeed);
855	MAP_OUT (winddir);
856	MAP_OUT (sky);
857		766
858	MAP_OUT (per_player);	767	MAP_OUT (per_player);
859	MAP_OUT (per_party);	768	MAP_OUT (per_party);
860		769
861	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	770	if (tile_path [TILE_NORTH]) MAP_OUT2 (tile_path_1, tile_path [TILE_NORTH]);
862	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	771	if (tile_path [TILE_EAST ]) MAP_OUT2 (tile_path_2, tile_path [TILE_EAST ]);
863	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	772	if (tile_path [TILE_SOUTH]) MAP_OUT2 (tile_path_3, tile_path [TILE_SOUTH]);
864	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	773	if (tile_path [TILE_WEST ]) MAP_OUT2 (tile_path_4, tile_path [TILE_WEST ]);
		774	if (tile_path [TILE_UP ]) MAP_OUT2 (tile_path_5, tile_path [TILE_UP ]);
		775	if (tile_path [TILE_DOWN ]) MAP_OUT2 (tile_path_6, tile_path [TILE_DOWN ]);
865		776
866	freezer.put (this);	777	freezer.put (this);
867	freezer.put (KW_end);	778	freezer.put (KW(end));
868		779
869	return true;	780	return true;
870	}	781	}
871		782
872	bool	783	bool
…		…
878	return false;	789	return false;
879		790
880	return freezer.save (path);	791	return freezer.save (path);
881	}	792	}
882		793
		794	//+GPL
		795
883	/*	796	/*
884	* Remove and free all objects in the given map.	797	* Remove and free all objects in the given map.
885	*/	798	*/
886	void	799	void
887	maptile::clear ()	800	maptile::clear ()
888	{	801	{
889	sfree (regions, size ()), regions = 0;
890	free (regionmap), regionmap = 0;
891
892	if (spaces)	802	if (spaces)
893	{	803	{
894	for (mapspace *ms = spaces + size (); ms-- > spaces; )	804	for (mapspace *ms = spaces + size (); ms-- > spaces; )
895	while (object *op = ms->bot)	805	while (object *op = ms->bot)
896	{	806	{
		807	// manually remove, as to not trigger anything
		808	if (ms->bot = op->above)
		809	ms->bot->below = 0;
		810
		811	op->flag [FLAG_REMOVED] = true;
		812
		813	object *head = op->head_ ();
897	if (op->head)	814	if (op == head)
898	op = op->head;
899
900	op->destroy_inv (false);
901	op->destroy ();	815	op->destroy ();
		816	else if (head->map != op->map)
		817	{
		818	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		819	head->destroy ();
		820	}
902	}	821	}
903		822
904	sfree (spaces, size ()), spaces = 0;	823	sfree0 (spaces, size ());
905	}	824	}
906		825
907	if (buttons)	826	if (buttons)
908	free_objectlinkpt (buttons), buttons = 0;	827	free_objectlinkpt (buttons), buttons = 0;
		828
		829	sfree0 (regions, size ());
		830	delete [] regionmap; regionmap = 0;
909	}	831	}
910		832
911	void	833	void
912	maptile::clear_header ()	834	maptile::clear_header ()
913	{	835	{
…		…
915	msg = 0;	837	msg = 0;
916	maplore = 0;	838	maplore = 0;
917	shoprace = 0;	839	shoprace = 0;
918	delete [] shopitems, shopitems = 0;	840	delete [] shopitems, shopitems = 0;
919		841
920	for (int i = 0; i < 4; i++)	842	for (int i = 0; i < array_length (tile_path); i++)
921	tile_path [i] = 0;	843	tile_path [i] = 0;
922	}	844	}
923		845
924	maptile::~maptile ()	846	maptile::~maptile ()
925	{	847	{
…		…
932	/* We need to look through all the maps and see if any maps	854	/* We need to look through all the maps and see if any maps
933	* are pointing at this one for tiling information. Since	855	* are pointing at this one for tiling information. Since
934	* tiling can be asymetric, we just can not look to see which	856	* tiling can be asymetric, we just can not look to see which
935	* maps this map tiles with and clears those.	857	* maps this map tiles with and clears those.
936	*/	858	*/
937	for (int i = 0; i < 4; i++)	859	for (int i = 0; i < array_length (tile_path); i++)
938	if (tile_map[i] == m)	860	if (tile_map[i] == m)
939	tile_map[i] = 0;	861	tile_map[i] = 0;
940	}	862	}
941		863
942	void	864	void
…		…
945	attachable::do_destroy ();	867	attachable::do_destroy ();
946		868
947	clear ();	869	clear ();
948	}	870	}
949		871
950	/*	872	/* decay and destroy perishable items in a map */
951	* Updates every button on the map (by calling update_button() for them).	873	// TODO: should be done regularly, not on map load?
952	*/
953	void	874	void
954	maptile::update_buttons ()	875	maptile::do_decay_objects ()
955	{	876	{
956	for (oblinkpt *obp = buttons; obp; obp = obp->next)	877	if (!spaces)
957	for (objectlink *ol = obp->link; ol; ol = ol->next)	878	return;
		879
		880	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		881	for (object above, op = ms->bot; op; op = above)
958	{	882	{
959	if (!ol->ob)	883	above = op->above;
		884
		885	// do not decay anything above unique floor tiles (yet :)
		886	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		887	break;
		888
		889	bool destroy = 0;
		890
		891	if (op->flag [FLAG_IS_FLOOR]
		892	\|\| op->flag [FLAG_OBJ_ORIGINAL]
		893	\|\| op->flag [FLAG_UNIQUE]
		894	\|\| op->flag [FLAG_OVERLAY_FLOOR]
		895	\|\| op->flag [FLAG_UNPAID]
		896	\|\| op->is_alive ())
		897	; // do not decay
		898	else if (op->is_weapon ())
960	{	899	{
961	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	900	op->stats.dam--;
962	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	901	if (op->stats.dam < 0)
963	continue;	902	destroy = 1;
964	}	903	}
965		904	else if (op->is_armor ())
966	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
967	{	905	{
968	update_button (ol->ob);	906	op->stats.ac--;
969	break;	907	if (op->stats.ac < 0)
		908	destroy = 1;
970	}	909	}
		910	else if (op->type == FOOD)
		911	{
		912	op->stats.food -= rndm (5, 20);
		913	if (op->stats.food < 0)
		914	destroy = 1;
		915	}
		916	else
		917	{
		918	int mat = op->materials;
		919
		920	if (mat & M_PAPER
		921	\|\| mat & M_LEATHER
		922	\|\| mat & M_WOOD
		923	\|\| mat & M_ORGANIC
		924	\|\| mat & M_CLOTH
		925	\|\| mat & M_LIQUID
		926	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		927	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		928	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		929	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		930	//\|\| (mat & M_ICE && temp > 32)
		931	)
		932	destroy = 1;
		933	}
		934
		935	/* adjust overall chance below */
		936	if (destroy && rndm (0, 1))
		937	op->destroy ();
971	}	938	}
972	}	939	}
973		940
974	/*	941	/*
975	* This routine is supposed to find out the difficulty of the map.	942	* This routine is supposed to find out the difficulty of the map.
976	* difficulty does not have a lot to do with character level,	943	* difficulty does not have a lot to do with character level,
977	* but does have a lot to do with treasure on the map.	944	* but does have a lot to do with treasure on the map.
978	*	945	*
979	* Difficulty can now be set by the map creature. If the value stored	946	* Difficulty can now be set by the map creator. If the value stored
980	* in the map is zero, then use this routine. Maps should really	947	* in the map is zero, then use this routine. Maps should really
981	* have a difficulty set than using this function - human calculation	948	* have a difficulty set rather than using this function - human calculation
982	* is much better than this functions guesswork.	949	* is much better than this function's guesswork.
983	*/	950	*/
984	int	951	int
985	maptile::estimate_difficulty () const	952	maptile::estimate_difficulty () const
986	{	953	{
987	long monster_cnt = 0;	954	long monster_cnt = 0;
…		…
989	sint64 total_exp = 0;	956	sint64 total_exp = 0;
990		957
991	for (mapspace *ms = spaces + size (); ms-- > spaces; )	958	for (mapspace *ms = spaces + size (); ms-- > spaces; )
992	for (object *op = ms->bot; op; op = op->above)	959	for (object *op = ms->bot; op; op = op->above)
993	{	960	{
994	if (QUERY_FLAG (op, FLAG_MONSTER))	961	if (op->flag [FLAG_MONSTER])
995	{	962	{
996	total_exp += op->stats.exp;	963	total_exp += op->stats.exp;
997	monster_cnt++;	964	monster_cnt++;
998	}	965	}
999		966
1000	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (op->flag [FLAG_GENERATOR])
1001	{	968	{
1002	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
1003		970
1004	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	971	if (archetype *at = op->other_arch)
		972	{
1005	total_exp += at->clone.stats.exp * 8;	973	total_exp += at->stats.exp * 8;
1006
1007	monster_cnt++;	974	monster_cnt++;
		975	}
		976
		977	for (object *inv = op->inv; inv; inv = inv->below)
		978	{
		979	total_exp += op->stats.exp * 8;
		980	monster_cnt++;
		981	}
1008	}	982	}
1009	}	983	}
1010		984
1011	avgexp = (double) total_exp / monster_cnt;	985	avgexp = (double) total_exp / monster_cnt;
1012		986
…		…
1025	* postive values make it darker, negative make it brighter	999	* postive values make it darker, negative make it brighter
1026	*/	1000	*/
1027	int	1001	int
1028	maptile::change_map_light (int change)	1002	maptile::change_map_light (int change)
1029	{	1003	{
1030	int new_level = darkness + change;
1031
1032	/* Nothing to do */	1004	/* Nothing to do */
1033	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1005	if (!change)
1034	return 0;	1006	return 0;
1035		1007
1036	/* inform all players on the map */	1008	/* inform all players on the map */
1037	if (change > 0)	1009	if (change > 0)
1038	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1010	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1039	else	1011	else
1040	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1012	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1041		1013
1042	/* Do extra checking. since darkness is a unsigned value,	1014	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1043	* we need to be extra careful about negative values.
1044	* In general, the checks below are only needed if change
1045	* is not +/-1
1046	*/
1047	if (new_level < 0)
1048	darkness = 0;
1049	else if (new_level >= MAX_DARKNESS)
1050	darkness = MAX_DARKNESS;
1051	else
1052	darkness = new_level;
1053		1015
1054	/* All clients need to get re-updated for the change */	1016	/* All clients need to get re-updated for the change */
1055	update_all_map_los (this);	1017	update_all_map_los (this);
		1018
1056	return 1;	1019	return 1;
1057	}	1020	}
1058		1021
1059	/*	1022	/*
1060	* This function updates various attributes about a specific space	1023	* This function updates various attributes about a specific space
…		…
1063	* through, etc)	1026	* through, etc)
1064	*/	1027	*/
1065	void	1028	void
1066	mapspace::update_ ()	1029	mapspace::update_ ()
1067	{	1030	{
1068	object tmp, last = 0;	1031	object *last = 0;
1069	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1032	uint8 flags = P_UPTODATE;
		1033	sint8 light = 0;
1070	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1034	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1035	uint64_t volume = 0;
		1036	uint32_t items = 0;
		1037	object *anywhere = 0;
		1038	uint8_t middle_visibility = 0;
1071		1039
1072	//object *middle = 0;	1040	//object *middle = 0;
1073	//object *top = 0;	1041	//object *top = 0;
1074	//object *floor = 0;	1042	//object *floor = 0;
1075	// this seems to generate better code than using locals, above	1043	// this seems to generate better code than using locals, above
1076	object *&top = faces_obj[0] = 0;	1044	object *&top = faces_obj[0] = 0;
1077	object *&middle = faces_obj[1] = 0;	1045	object *&middle = faces_obj[1] = 0;
1078	object *&floor = faces_obj[2] = 0;	1046	object *&floor = faces_obj[2] = 0;
1079		1047
		1048	object::flags_t allflags; // all flags of all objects or'ed together
		1049
1080	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1081	{	1051	{
1082	/* This could be made additive I guess (two lights better than	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1083	* one). But if so, it shouldn't be a simple additive - 2
1084	* light bulbs do not illuminate twice as far as once since
1085	* it is a dissapation factor that is cubed.
1086	*/
1087	if (tmp->glow_radius > light)
1088	light = tmp->glow_radius;	1053	light += tmp->glow_radius;
1089		1054
1090	/* This call is needed in order to update objects the player	1055	/* This call is needed in order to update objects the player
1091	* is standing in that have animations (ie, grass, fire, etc).	1056	* is standing in that have animations (ie, grass, fire, etc).
1092	* However, it also causes the look window to be re-drawn	1057	* However, it also causes the look window to be re-drawn
1093	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1094	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1095	*	1060	*
1096	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1097	*/	1062	*/
1098	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1099	{	1064	{
1100	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1101	top = tmp;	1066	top = tmp;
1102	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1067	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1103	{	1068	{
1104	/* If we got a floor, that means middle and top were below it,	1069	/* If we got a floor, that means middle and top were below it,
1105	* so should not be visible, so we clear them.	1070	* so should not be visible, so we clear them.
1106	*/	1071	*/
1107	middle = 0;	1072	middle = 0;
1108	top = 0;	1073	top = 0;
1109	floor = tmp;	1074	floor = tmp;
		1075	volume = 0;
		1076	items = 0;
1110	}	1077	}
1111	/* Flag anywhere have high priority */	1078	else
1112	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1113	{	1079	{
		1080	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1081	{
		1082	++items;
		1083	volume += tmp->volume ();
		1084	}
		1085
		1086	/* Flag anywhere have high priority */
		1087	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1088	anywhere = tmp;
		1089
		1090	/* Find the highest visible face around. If equal
		1091	* visibilities, we still want the one nearer to the
		1092	* top
		1093	*/
		1094	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
		1095	{
		1096	middle_visibility = ::faces [tmp->face].visibility;
1114	middle = tmp;	1097	middle = tmp;
1115	anywhere = 1;	1098	}
1116	}	1099	}
1117	/* Find the highest visible face around. If equal
1118	* visibilities, we still want the one nearer to the
1119	* top
1120	*/
1121	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1122	middle = tmp;
1123	}
1124
1125	if (tmp == tmp->above)
1126	{
1127	LOG (llevError, "Error in structure of map\n");
1128	exit (-1);
1129	}	1100	}
1130		1101
1131	move_slow \|= tmp->move_slow;	1102	move_slow \|= tmp->move_slow;
1132	move_block \|= tmp->move_block;	1103	move_block \|= tmp->move_block;
1133	move_on \|= tmp->move_on;	1104	move_on \|= tmp->move_on;
1134	move_off \|= tmp->move_off;	1105	move_off \|= tmp->move_off;
1135	move_allow \|= tmp->move_allow;	1106	move_allow \|= tmp->move_allow;
1136		1107
1137	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1108	allflags \|= tmp->flag;
1138	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1109
1139	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1110	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1140	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1111	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1141	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1142	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1143	}	1112	}
1144		1113
1145	this->light = light;	1114	// FLAG_SEE_ANYWHERE takes precedence
		1115	if (anywhere)
		1116	middle = anywhere;
		1117
		1118	// ORing all flags together and checking them here is much faster
		1119	if (allflags [FLAG_BLOCKSVIEW]) flags \|= P_BLOCKSVIEW;
		1120	if (allflags [FLAG_NO_MAGIC] ) flags \|= P_NO_MAGIC;
		1121	if (allflags [FLAG_ALIVE] ) flags \|= P_IS_ALIVE;
		1122	if (allflags [FLAG_DAMNED] ) flags \|= P_NO_CLERIC;
		1123
		1124	this->light = min (light, MAX_LIGHT_RADIUS);
1146	this->flags_ = flags;	1125	this->flags_ = flags;
1147	this->move_block = move_block & ~move_allow;	1126	this->move_block = move_block & ~move_allow;
1148	this->move_on = move_on;	1127	this->move_on = move_on;
1149	this->move_off = move_off;	1128	this->move_off = move_off;
1150	this->move_slow = move_slow;	1129	this->move_slow = move_slow;
		1130	this->volume_ = (volume + 1023) / 1024;
		1131	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1151		1132
1152	/* At this point, we have a floor face (if there is a floor),	1133	/* At this point, we have a floor face (if there is a floor),
1153	* and the floor is set - we are not going to touch it at	1134	* and the floor is set - we are not going to touch it at
1154	* this point.	1135	* this point.
1155	* middle contains the highest visibility face.	1136	* middle contains the highest visibility face.
…		…
1170	* 1) top face is set, need middle to be set.	1151	* 1) top face is set, need middle to be set.
1171	* 2) middle is set, need to set top.	1152	* 2) middle is set, need to set top.
1172	* 3) neither middle or top is set - need to set both.	1153	* 3) neither middle or top is set - need to set both.
1173	*/	1154	*/
1174		1155
1175	for (tmp = last; tmp; tmp = tmp->below)	1156	for (object *tmp = last; tmp; tmp = tmp->below)
1176	{	1157	{
1177	/* Once we get to a floor, stop, since we already have a floor object */	1158	/* Once we get to a floor, stop, since we already have a floor object */
1178	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1159	if (tmp->flag [FLAG_IS_FLOOR])
1179	break;	1160	break;
1180		1161
1181	/* If two top faces are already set, quit processing */	1162	/* If two top faces are already set, quit processing */
1182	if (top && middle)	1163	if (top && middle)
1183	break;	1164	break;
…		…
1214	middle = 0;	1195	middle = 0;
1215		1196
1216	if (top == middle)	1197	if (top == middle)
1217	middle = 0;	1198	middle = 0;
1218		1199
		1200	// set lower map transparent floor flag if applicable
		1201	if (floor && floor->flag [FLAG_IS_TRANSPARENT_FLOOR] && !middle && !top)
		1202	{
		1203	floor->set_anim_frame (0);
		1204
		1205	if (maptile *m = floor->map->tile_map [TILE_DOWN])
		1206	{
		1207	mapspace &ms = m->at (floor->x, floor->y);
		1208	ms.update ();
		1209
		1210	if (object *floor2 = ms.faces_obj [2])
		1211	if (!floor2->flag [FLAG_IS_TRANSPARENT_FLOOR])
		1212	{
		1213	floor->set_anim_frame (1);
		1214	top = floor;
		1215	middle = ms.faces_obj [0];
		1216	floor = floor2;
		1217	}
		1218
		1219	ms.pflags \|= PF_VIS_UP;
		1220	}
		1221	}
		1222
1219	#if 0	1223	#if 0
1220	faces_obj [0] = top;	1224	faces_obj [0] = top;
1221	faces_obj [1] = middle;	1225	faces_obj [1] = middle;
1222	faces_obj [2] = floor;	1226	faces_obj [2] = floor;
1223	#endif	1227	#endif
1224	}	1228	}
1225		1229
1226	uint64	1230	void
1227	mapspace::volume () const	1231	mapspace::update_up ()
1228	{	1232	{
1229	uint64 vol = 0;	1233	// invalidate up
1230		1234	if (!(pflags & PF_VIS_UP))
1231	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1232	vol += op->volume ();
1233
1234	return vol;	1235	return;
1235	}
1236		1236
1237	/* this updates the orig_map->tile_map[tile_num] value after finding	1237	pflags &= ~PF_VIS_UP;
1238	* the map. It also takes care of linking back the freshly found
1239	* maps tile_map values if it tiles back to this one. It returns
1240	* the value of orig_map->tile_map[tile_num].
1241	*/
1242	static inline maptile *
1243	find_and_link (maptile *orig_map, int tile_num)
1244	{
1245	maptile *mp = orig_map->tile_map [tile_num];
1246		1238
1247	if (!mp)	1239	if (bot)
1248	{	1240	if (maptile *m = bot->map->tile_map [TILE_UP])
1249	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);	1241	m->at (bot->x, bot->y).invalidate ();
		1242	}
1250		1243
1251	if (!mp)	1244	maptile *
		1245	maptile::tile_available (int dir, bool load)
		1246	{
		1247	// map is there and we don't need to load it OR it's loaded => return what we have
		1248	if (tile_map [dir] && (!load \|\| tile_map [dir]->linkable ()))
		1249	return tile_map [dir];
		1250
		1251	if (tile_path [dir])
		1252	{
		1253	// well, try to locate it then, if possible - maybe it's there already
		1254	if (maptile *m = find_async (tile_path [dir], this, load))
1252	{	1255	{
1253	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine	1256	bool match = true;
1254	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",	1257
1255	&orig_map->tile_path[tile_num], &orig_map->path);	1258	if (dir == TILE_NORTH \|\| dir == TILE_SOUTH \|\| dir == TILE_UP \|\| dir == TILE_DOWN)
1256	mp = new maptile (1, 1);	1259	if (width != m->width)
1257	mp->alloc ();	1260	match = false;
1258	mp->in_memory = MAP_IN_MEMORY;	1261
		1262	if (dir == TILE_EAST \|\| dir == TILE_WEST \|\| dir == TILE_UP \|\| dir == TILE_DOWN)
		1263	if (height != m->height)
		1264	match = false;
		1265
		1266	if (!match)
		1267	{
		1268	LOG (llevError, "tile dimension mismatch for direction %d from %s to %s\n",
		1269	dir, &path, &m->path);
		1270	m = 0;
		1271	}
		1272
		1273	// this could be optimised endlessly
		1274	//m->activate_physics ();
		1275
		1276	return tile_map [dir] = m;
1259	}	1277	}
1260	}	1278	}
1261		1279
1262	int dest_tile = (tile_num + 2) % 4;
1263
1264	orig_map->tile_map [tile_num] = mp;
1265
1266	// optimisation: back-link map to origin map if euclidean
1267	//TODO: non-euclidean maps MUST GO
1268	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1269	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1270
1271	return mp;	1280	return 0;
1272	}
1273
1274	static inline void
1275	load_and_link (maptile *orig_map, int tile_num)
1276	{
1277	find_and_link (orig_map, tile_num)->load_sync ();
1278	}	1281	}
1279		1282
1280	/* this returns TRUE if the coordinates (x,y) are out of	1283	/* this returns TRUE if the coordinates (x,y) are out of
1281	* map m. This function also takes into account any	1284	* map m. This function also takes into account any
1282	* tiling considerations, loading adjacant maps as needed.	1285	* tiling considerations, loading adjacant maps as needed.
…		…
1295	if (!m)	1298	if (!m)
1296	return 0;	1299	return 0;
1297		1300
1298	if (x < 0)	1301	if (x < 0)
1299	{	1302	{
1300	if (!m->tile_path[3])	1303	if (!m->tile_available (TILE_WEST))
1301	return 1;	1304	return 1;
1302		1305
1303	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1304	find_and_link (m, 3);
1305
1306	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1306	return out_of_map (m->tile_map [TILE_WEST], x + m->tile_map [TILE_WEST]->width, y);
1307	}	1307	}
1308		1308
1309	if (x >= m->width)	1309	if (x >= m->width)
1310	{	1310	{
1311	if (!m->tile_path[1])	1311	if (!m->tile_available (TILE_EAST))
1312	return 1;	1312	return 1;
1313		1313
1314	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1315	find_and_link (m, 1);
1316
1317	return out_of_map (m->tile_map[1], x - m->width, y);	1314	return out_of_map (m->tile_map [TILE_EAST], x - m->width, y);
1318	}	1315	}
1319		1316
1320	if (y < 0)	1317	if (y < 0)
1321	{	1318	{
1322	if (!m->tile_path[0])	1319	if (!m->tile_available (TILE_NORTH))
1323	return 1;	1320	return 1;
1324		1321
1325	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1326	find_and_link (m, 0);
1327
1328	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1322	return out_of_map (m->tile_map [TILE_NORTH], x, y + m->tile_map [TILE_NORTH]->height);
1329	}	1323	}
1330		1324
1331	if (y >= m->height)	1325	if (y >= m->height)
1332	{	1326	{
1333	if (!m->tile_path[2])	1327	if (!m->tile_available (TILE_SOUTH))
1334	return 1;	1328	return 1;
1335		1329
1336	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1337	find_and_link (m, 2);
1338
1339	return out_of_map (m->tile_map[2], x, y - m->height);	1330	return out_of_map (m->tile_map [TILE_SOUTH], x, y - m->height);
1340	}	1331	}
1341		1332
1342	/* Simple case - coordinates are within this local	1333	/* Simple case - coordinates are within this local
1343	* map.	1334	* map.
1344	*/	1335	*/
…		…
1356	maptile *	1347	maptile *
1357	maptile::xy_find (sint16 &x, sint16 &y)	1348	maptile::xy_find (sint16 &x, sint16 &y)
1358	{	1349	{
1359	if (x < 0)	1350	if (x < 0)
1360	{	1351	{
1361	if (!tile_path[3])	1352	if (!tile_available (TILE_WEST))
1362	return 0;	1353	return 0;
1363		1354
1364	find_and_link (this, 3);
1365	x += tile_map[3]->width;	1355	x += tile_map [TILE_WEST]->width;
1366	return tile_map[3]->xy_find (x, y);	1356	return tile_map [TILE_WEST]->xy_find (x, y);
1367	}	1357	}
1368		1358
1369	if (x >= width)	1359	if (x >= width)
1370	{	1360	{
1371	if (!tile_path[1])	1361	if (!tile_available (TILE_EAST))
1372	return 0;	1362	return 0;
1373		1363
1374	find_and_link (this, 1);
1375	x -= width;	1364	x -= width;
1376	return tile_map[1]->xy_find (x, y);	1365	return tile_map [TILE_EAST]->xy_find (x, y);
1377	}	1366	}
1378		1367
1379	if (y < 0)	1368	if (y < 0)
1380	{	1369	{
1381	if (!tile_path[0])	1370	if (!tile_available (TILE_NORTH))
1382	return 0;	1371	return 0;
1383		1372
1384	find_and_link (this, 0);
1385	y += tile_map[0]->height;	1373	y += tile_map [TILE_NORTH]->height;
1386	return tile_map[0]->xy_find (x, y);	1374	return tile_map [TILE_NORTH]->xy_find (x, y);
1387	}	1375	}
1388		1376
1389	if (y >= height)	1377	if (y >= height)
1390	{	1378	{
1391	if (!tile_path[2])	1379	if (!tile_available (TILE_SOUTH))
1392	return 0;	1380	return 0;
1393		1381
1394	find_and_link (this, 2);
1395	y -= height;	1382	y -= height;
1396	return tile_map[2]->xy_find (x, y);	1383	return tile_map [TILE_SOUTH]->xy_find (x, y);
1397	}	1384	}
1398		1385
1399	/* Simple case - coordinates are within this local	1386	/* Simple case - coordinates are within this local
1400	* map.	1387	* map.
1401	*/	1388	*/
…		…
1405	/**	1392	/**
1406	* Return whether map2 is adjacent to map1. If so, store the distance from	1393	* Return whether map2 is adjacent to map1. If so, store the distance from
1407	* map1 to map2 in dx/dy.	1394	* map1 to map2 in dx/dy.
1408	*/	1395	*/
1409	int	1396	int
1410	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1397	adjacent_map (maptile map1, maptile map2, int dx, int dy)
1411	{	1398	{
1412	if (!map1 \|\| !map2)	1399	if (!map1 \|\| !map2)
1413	return 0;	1400	return 0;
1414		1401
1415	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1402	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1416	//fix: compare paths instead (this is likely faster, too!)	1403	//fix: compare paths instead (this is likely faster, too!)
1417	if (map1 == map2)	1404	if (map1 == map2)
1418	{	1405	{
1419	*dx = 0;	1406	*dx = 0;
1420	*dy = 0;	1407	*dy = 0;
1421	}	1408	}
1422	else if (map1->tile_map[0] == map2)	1409	else if (map1->tile_available (TILE_NORTH, false) == map2)
1423	{ /* up */	1410	{
1424	*dx = 0;	1411	*dx = 0;
1425	*dy = -map2->height;	1412	*dy = -map2->height;
1426	}	1413	}
1427	else if (map1->tile_map[1] == map2)	1414	else if (map1->tile_available (TILE_EAST , false) == map2)
1428	{ /* right */	1415	{
1429	*dx = map1->width;	1416	*dx = map1->width;
1430	*dy = 0;	1417	*dy = 0;
1431	}	1418	}
1432	else if (map1->tile_map[2] == map2)	1419	else if (map1->tile_available (TILE_SOUTH, false) == map2)
1433	{ /* down */	1420	{
1434	*dx = 0;	1421	*dx = 0;
1435	*dy = map1->height;	1422	*dy = map1->height;
1436	}	1423	}
1437	else if (map1->tile_map[3] == map2)	1424	else if (map1->tile_available (TILE_WEST , false) == map2)
1438	{ /* left */	1425	{
1439	*dx = -map2->width;	1426	*dx = -map2->width;
1440	*dy = 0;	1427	*dy = 0;
1441	}	1428	}
1442	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	1429	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1443	{ /* up right */	1430	{ /* up right */
1444	*dx = map1->tile_map[0]->width;	1431	*dx = +map1->tile_map[TILE_NORTH]->width;
1445	*dy = -map1->tile_map[0]->height;	1432	*dy = -map1->tile_map[TILE_NORTH]->height;
1446	}	1433	}
1447	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	1434	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1448	{ /* up left */	1435	{ /* up left */
1449	*dx = -map2->width;	1436	*dx = -map2->width;
1450	*dy = -map1->tile_map[0]->height;	1437	*dy = -map1->tile_map[TILE_NORTH]->height;
1451	}	1438	}
1452	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	1439	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1453	{ /* right up */	1440	{ /* right up */
1454	*dx = map1->width;	1441	*dx = +map1->width;
1455	*dy = -map2->height;	1442	*dy = -map2->height;
1456	}	1443	}
1457	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	1444	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1458	{ /* right down */	1445	{ /* right down */
1459	*dx = map1->width;	1446	*dx = +map1->width;
1460	*dy = map1->tile_map[1]->height;	1447	*dy = +map1->tile_map[TILE_EAST]->height;
1461	}	1448	}
1462	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	1449	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1463	{ /* down right */	1450	{ /* down right */
1464	*dx = map1->tile_map[2]->width;	1451	*dx = +map1->tile_map[TILE_SOUTH]->width;
1465	*dy = map1->height;	1452	*dy = +map1->height;
1466	}	1453	}
1467	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	1454	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1468	{ /* down left */	1455	{ /* down left */
1469	*dx = -map2->width;	1456	*dx = -map2->width;
1470	*dy = map1->height;	1457	*dy = +map1->height;
1471	}	1458	}
1472	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	1459	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1473	{ /* left up */	1460	{ /* left up */
1474	*dx = -map1->tile_map[3]->width;	1461	*dx = -map1->tile_map[TILE_WEST]->width;
1475	*dy = -map2->height;	1462	*dy = -map2->height;
1476	}	1463	}
1477	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	1464	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1478	{ /* left down */	1465	{ /* left down */
1479	*dx = -map1->tile_map[3]->width;	1466	*dx = -map1->tile_map[TILE_WEST]->width;
1480	*dy = map1->tile_map[3]->height;	1467	*dy = +map1->tile_map[TILE_WEST]->height;
1481	}	1468	}
1482	else	1469	else
1483	return 0;	1470	return 0;
1484		1471
1485	return 1;	1472	return 1;
…		…
1521	*	1508	*
1522	* currently, the only flag supported (0x1) is don't translate for	1509	* currently, the only flag supported (0x1) is don't translate for
1523	* closest body part of 'op1'	1510	* closest body part of 'op1'
1524	*/	1511	*/
1525	void	1512	void
1526	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1513	get_rangevector (object op1, object op2, rv_vector *retval, int flags)
1527	{	1514	{
1528	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1515	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1529	{	1516	{
1530	/* be conservative and fill in _some_ data */	1517	/* be conservative and fill in _some_ data */
1531	retval->distance = 10000;	1518	retval->distance = 10000;
1532	retval->distance_x = 10000;	1519	retval->distance_x = 10000;
1533	retval->distance_y = 10000;	1520	retval->distance_y = 10000;
1534	retval->direction = 0;	1521	retval->direction = 0;
1535	retval->part = 0;	1522	retval->part = 0;
1536	}	1523	}
1537	else	1524	else
1538	{	1525	{
1539	object *best;
1540
1541	retval->distance_x += op2->x - op1->x;	1526	retval->distance_x += op2->x - op1->x;
1542	retval->distance_y += op2->y - op1->y;	1527	retval->distance_y += op2->y - op1->y;
1543		1528
1544	best = op1;	1529	object *best = op1;
		1530
1545	/* If this is multipart, find the closest part now */	1531	/* If this is multipart, find the closest part now */
1546	if (!(flags & 0x1) && op1->more)	1532	if (!(flags & 1) && op1->more)
1547	{	1533	{
1548	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1534	int best_distance = idistance (retval->distance_x, retval->distance_y);
1549		1535
1550	/* we just take the offset of the piece to head to figure	1536	/* we just take the offset of the piece to head to figure
1551	* distance instead of doing all that work above again	1537	* distance instead of doing all that work above again
1552	* since the distance fields we set above are positive in the	1538	* since the distance fields we set above are positive in the
1553	* same axis as is used for multipart objects, the simply arithmetic	1539	* same axis as is used for multipart objects, the simply arithmetic
1554	* below works.	1540	* below works.
1555	*/	1541	*/
1556	for (object *tmp = op1->more; tmp; tmp = tmp->more)	1542	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1557	{	1543	{
1558	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1544	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1559	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1545
1560	if (tmpi < best_distance)	1546	if (tmpi < best_distance)
1561	{	1547	{
1562	best_distance = tmpi;	1548	best_distance = tmpi;
1563	best = tmp;	1549	best = tmp;
1564	}	1550	}
1565	}	1551	}
1566		1552
1567	if (best != op1)	1553	if (best != op1)
1568	{	1554	{
1569	retval->distance_x += op1->x - best->x;	1555	retval->distance_x += op1->x - best->x;
1570	retval->distance_y += op1->y - best->y;	1556	retval->distance_y += op1->y - best->y;
1571	}	1557	}
1572	}	1558	}
1573		1559
1574	retval->part = best;	1560	retval->part = best;
1575	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1561	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1576	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1562	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1577	}	1563	}
1578	}	1564	}
1579		1565
1580	/* this is basically the same as get_rangevector above, but instead of	1566	/* this is basically the same as get_rangevector above, but instead of
1581	* the first parameter being an object, it instead is the map	1567	* the first parameter being an object, it instead is the map
…		…
1586	* be more consistant with the above function and also in case they are needed	1572	* be more consistant with the above function and also in case they are needed
1587	* for something in the future. Also, since no object is pasted, the best	1573	* for something in the future. Also, since no object is pasted, the best
1588	* field of the rv_vector is set to NULL.	1574	* field of the rv_vector is set to NULL.
1589	*/	1575	*/
1590	void	1576	void
1591	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)	1577	get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1592	{	1578	{
1593	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1579	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1594	{	1580	{
1595	/* be conservative and fill in _some_ data */	1581	/* be conservative and fill in _some_ data */
1596	retval->distance = 100000;	1582	retval->distance = 100000;
1597	retval->distance_x = 32767;	1583	retval->distance_x = 32767;
1598	retval->distance_y = 32767;	1584	retval->distance_y = 32767;
1599	retval->direction = 0;	1585	retval->direction = 0;
1600	retval->part = 0;	1586	retval->part = 0;
1601	}	1587	}
1602	else	1588	else
1603	{	1589	{
1604	retval->distance_x += op2->x - x;	1590	retval->distance_x += op2->x - x;
1605	retval->distance_y += op2->y - y;	1591	retval->distance_y += op2->y - y;
1606		1592
1607	retval->part = NULL;	1593	retval->part = 0;
1608	retval->distance = idistance (retval->distance_x, retval->distance_y);	1594	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1609	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1595	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1610	}	1596	}
1611	}	1597	}
1612		1598
1613	/* Returns true of op1 and op2 are effectively on the same map	1599	/* Returns true of op1 and op2 are effectively on the same map
1614	* (as related to map tiling). Note that this looks for a path from	1600	* (as related to map tiling). Note that this looks for a path from
…		…
1624	int dx, dy;	1610	int dx, dy;
1625		1611
1626	return adjacent_map (op1->map, op2->map, &dx, &dy);	1612	return adjacent_map (op1->map, op2->map, &dx, &dy);
1627	}	1613	}
1628		1614
		1615	//-GPL
		1616
1629	object *	1617	object *
1630	maptile::insert (object op, int x, int y, object originator, int flags)	1618	maptile::insert (object op, int x, int y, object originator, int flags)
1631	{	1619	{
1632	if (!op->flag [FLAG_REMOVED])
1633	op->remove ();
1634
1635	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1620	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1636	}	1621	}
1637		1622
1638	region *	1623	region *
1639	maptile::region (int x, int y) const	1624	maptile::region (int x, int y) const
…		…
1648	return default_region;	1633	return default_region;
1649		1634
1650	return ::region::default_region ();	1635	return ::region::default_region ();
1651	}	1636	}
1652		1637
		1638	//+GPL
		1639
1653	/* picks a random object from a style map.	1640	/* picks a random object from a style map.
1654	* Redone by MSW so it should be faster and not use static
1655	* variables to generate tables.
1656	*/	1641	*/
1657	object *	1642	object *
1658	maptile::pick_random_object () const	1643	maptile::pick_random_object (rand_gen &gen) const
1659	{	1644	{
1660	/* while returning a null object will result in a crash, that	1645	/* while returning a null object will result in a crash, that
1661	* is actually preferable to an infinite loop. That is because	1646	* is actually preferable to an infinite loop. That is because
1662	* most servers will automatically restart in case of crash.	1647	* most servers will automatically restart in case of crash.
1663	* Change the logic on getting the random space - shouldn't make	1648	* Change the logic on getting the random space - shouldn't make
1664	* any difference, but this seems clearer to me.	1649	* any difference, but this seems clearer to me.
1665	*/	1650	*/
1666	for (int i = 1000; --i;)	1651	for (int i = 1000; --i;)
1667	{	1652	{
1668	object *pick = at (rndm (width), rndm (height)).bot;	1653	object *pick = at (gen (width), gen (height)).bot;
1669		1654
1670	// do not prefer big monsters just because they are big.	1655	// must be head: do not prefer big monsters just because they are big.
1671	if (pick && pick->head_ () == pick)	1656	if (pick && pick->is_head ())
1672	return pick->head_ ();	1657	return pick;
1673	}	1658	}
1674		1659
1675	// instead of crashing in the unlikely(?) case, try to return something	1660	// instead of crashing in the unlikely(?) case, try to return something
1676	return get_archetype ("blocked");	1661	return archetype::find (shstr_bug);
1677	}	1662	}
1678		1663
		1664	//-GPL
		1665
		1666	void
		1667	maptile::play_sound (faceidx sound, int x, int y) const
		1668	{
		1669	if (!sound)
		1670	return;
		1671
		1672	for_all_players_on_map (pl, this)
		1673	if (client *ns = pl->ns)
		1674	{
		1675	int dx = x - pl->ob->x;
		1676	int dy = y - pl->ob->y;
		1677
		1678	int distance = idistance (dx, dy);
		1679
		1680	if (distance <= MAX_SOUND_DISTANCE)
		1681	ns->play_sound (sound, dx, dy);
		1682	}
		1683	}
		1684
		1685	void
		1686	maptile::say_msg (const char *msg, int x, int y) const
		1687	{
		1688	for_all_players (pl)
		1689	if (client *ns = pl->ns)
		1690	{
		1691	int dx = x - pl->ob->x;
		1692	int dy = y - pl->ob->y;
		1693
		1694	int distance = idistance (dx, dy);
		1695
		1696	if (distance <= MAX_SOUND_DISTANCE)
		1697	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1698	}
		1699	}
		1700
		1701	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1702
		1703	static void
		1704	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1705	{
		1706	// clip to map to the left
		1707	if (x0 < 0)
		1708	{
		1709	if (maptile *tile = m->tile_available (TILE_WEST, 1))
		1710	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1711
		1712	if (x1 < 0) // entirely to the left
		1713	return;
		1714
		1715	x0 = 0;
		1716	}
		1717
		1718	// clip to map to the right
		1719	if (x1 > m->width)
		1720	{
		1721	if (maptile *tile = m->tile_available (TILE_EAST, 1))
		1722	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1723
		1724	if (x0 > m->width) // entirely to the right
		1725	return;
		1726
		1727	x1 = m->width;
		1728	}
		1729
		1730	// clip to map above
		1731	if (y0 < 0)
		1732	{
		1733	if (maptile *tile = m->tile_available (TILE_NORTH, 1))
		1734	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1735
		1736	if (y1 < 0) // entirely above
		1737	return;
		1738
		1739	y0 = 0;
		1740	}
		1741
		1742	// clip to map below
		1743	if (y1 > m->height)
		1744	{
		1745	if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
		1746	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1747
		1748	if (y0 > m->height) // entirely below
		1749	return;
		1750
		1751	y1 = m->height;
		1752	}
		1753
		1754	// if we get here, the rect is within the current map
		1755	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1756
		1757	r->m = m;
		1758	r->x0 = x0;
		1759	r->y0 = y0;
		1760	r->x1 = x1;
		1761	r->y1 = y1;
		1762	r->dx = dx;
		1763	r->dy = dy;
		1764	}
		1765
		1766	maprect *
		1767	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
		1768	{
		1769	buf.clear ();
		1770
		1771	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1772
		1773	// add end marker
		1774	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1775	r->m = 0;
		1776
		1777	return (maprect *)buf.linearise ();
		1778	}
		1779

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.99 by root, Mon Apr 16 06:23:39 2007 UTC vs. Revision 1.213 by root, Sat May 7 20:03:27 2011 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.99 by root, Mon Apr 16 06:23:39 2007 UTC vs.
Revision 1.213 by root, Sat May 7 20:03:27 2011 UTC