ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/map.C

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

Diff Legend

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