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.35 by root, Sun Dec 10 01:16:27 2006 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 (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
6		7	*
7	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
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
10	(at your option) any later version.	11	* option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	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
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
20		21	*
21	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>
22	*/	23	*/
23		24
24
25	#include <global.h>
26	#include <funcpoint.h>
27
28	#include <loader.h>
29	#ifndef WIN32 /* ---win32 exclude header */
30	# include <unistd.h>	25	#include <unistd.h>
31	#endif /* win32 */
32		26
		27	#include "global.h"
33	#include "path.h"	28	#include "path.h"
34		29
		30	//+GPL
35		31
36	/*	32	sint8 maptile::outdoor_darkness;
37	* Returns the maptile which has a name matching the given argument.
38	* return NULL if no match is found.
39	*/
40
41	maptile *
42	has_been_loaded (const char *name)
43	{
44	maptile *map;
45
46	if (!name || !*name)
47	return 0;
48	for (map = first_map; map; map = map->next)
49	if (!strcmp (name, map->path))
50	break;
51	return (map);
52	}
53
54	/*
55	* This makes a path absolute outside the world of Crossfire.
56	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
57	* and returns the pointer to a static array containing the result.
58	* it really should be called create_mapname
59	*/
60
61	const char *
62	create_pathname (const char *name)
63	{
64	static char buf[MAX_BUF];
65
66	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
67	* someplace else in the code? msw 2-17-97
68	*/
69	if (*name == '/')
70	sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
71	else
72	sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name);
73	return (buf);
74	}
75
76	/*
77	* same as create_pathname, but for the overlay maps.
78	*/
79
80	const char *
81	create_overlay_pathname (const char *name)
82	{
83	static char buf[MAX_BUF];
84
85	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
86	* someplace else in the code? msw 2-17-97
87	*/
88	if (*name == '/')
89	sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
90	else
91	sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
92	return (buf);
93	}
94
95	/*
96	* same as create_pathname, but for the template maps.
97	*/
98
99	const char *
100	create_template_pathname (const char *name)
101	{
102	static char buf[MAX_BUF];
103
104	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
105	* someplace else in the code? msw 2-17-97
106	*/
107	if (*name == '/')
108	sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
109	else
110	sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
111	return (buf);
112	}
113
114	/*
115	* This makes absolute path to the itemfile where unique objects
116	* will be saved. Converts '/' to '@'. I think it's essier maintain
117	* files than full directory structure, but if this is problem it can
118	* be changed.
119	*/
120	static const char *
121	create_items_path (const char *s)
122	{
123	static char buf[MAX_BUF];
124	char *t;
125
126	if (*s == '/')
127	s++;
128
129	sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
130
131	for (t = buf + strlen (buf); *s; s++, t++)
132	if (*s == '/')
133	*t = '@';
134	else
135	*t = *s;
136	*t = 0;
137	return (buf);
138	}
139
140
141	/*
142	* This function checks if a file with the given path exists.
143	* -1 is returned if it fails, otherwise the mode of the file
144	* is returned.
145	* It tries out all the compression suffixes listed in the uncomp[] array.
146	*
147	* If prepend_dir is set, then we call create_pathname (which prepends
148	* libdir & mapdir). Otherwise, we assume the name given is fully
149	* complete.
150	* Only the editor actually cares about the writablity of this -
151	* the rest of the code only cares that the file is readable.
152	* when the editor goes away, the call to stat should probably be
153	* replaced by an access instead (similar to the windows one, but
154	* that seems to be missing the prepend_dir processing
155	*/
156
157	int
158	check_path (const char *name, int prepend_dir)
159	{
160	char buf[MAX_BUF];
161
162	#ifndef WIN32
163	char *endbuf;
164	struct stat statbuf;
165	int mode = 0;
166	#endif
167
168	if (prepend_dir)
169	strcpy (buf, create_pathname (name));
170	else
171	strcpy (buf, name);
172	#ifdef WIN32 /* ***win32: check this sucker in windows style. */
173	return (_access (buf, 0));
174	#else
175
176	/* old method (strchr(buf, '\0')) seemd very odd to me -
177	* this method should be equivalant and is clearer.
178	* Can not use strcat because we need to cycle through
179	* all the names.
180	*/
181	endbuf = buf + strlen (buf);
182
183	if (stat (buf, &statbuf))
184	return -1;
185	if (!S_ISREG (statbuf.st_mode))
186	return (-1);
187
188	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
189	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
190	mode |= 4;
191
192	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
193	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
194	mode |= 2;
195
196	return (mode);
197	#endif
198	}
199
200	/*
201	* Prints out debug-information about a map.
202	* Dumping these at llevError doesn't seem right, but is
203	* necessary to make sure the information is in fact logged.
204	*/
205
206	void
207	dump_map (const maptile *m)
208	{
209	LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
210	LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m));
211
212	if (m->msg != NULL)
213	LOG (llevError, "Message:\n%s", m->msg);
214
215	if (m->maplore != NULL)
216	LOG (llevError, "Lore:\n%s", m->maplore);
217
218	if (m->tmpname != NULL)
219	LOG (llevError, "Tmpname: %s\n", m->tmpname);
220
221	LOG (llevError, "Difficulty: %d\n", m->difficulty);
222	LOG (llevError, "Darkness: %d\n", m->darkness);
223	}
224
225	/*
226	* Prints out debug-information about all maps.
227	* This basically just goes through all the maps and calls
228	* dump_map on each one.
229	*/
230
231	void
232	dump_all_maps (void)
233	{
234	maptile *m;
235
236	for (m = first_map; m != NULL; m = m->next)
237	{
238	dump_map (m);
239	}
240	}
241		33
242	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	34	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
243	* one function that just returns a P_.. value (see map.h)	35	* one function that just returns a P_.. value (see map.h)
244	* it will also do map translation for tiled maps, returning	36	* it will also do map translation for tiled maps, returning
245	* 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
…		…
248	* is needed. The case of not passing values is if we're just	40	* is needed. The case of not passing values is if we're just
249	* checking for the existence of something on those spaces, but	41	* checking for the existence of something on those spaces, but
250	* don't expect to insert/remove anything from those spaces.	42	* don't expect to insert/remove anything from those spaces.
251	*/	43	*/
252	int	44	int
253	get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny)	45	get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
254	{	46	{
255	sint16 newx, newy;	47	sint16 newx = x;
256	int retval = 0;	48	sint16 newy = y;
257	maptile *mp;
258		49
259	if (out_of_map (oldmap, x, y))	50	maptile *mp = get_map_from_coord (oldmap, &newx, &newy);
		51
		52	if (!mp)
260	return P_OUT_OF_MAP;	53	return P_OUT_OF_MAP;
261	newx = x;
262	newy = y;
263	mp = get_map_from_coord (oldmap, &newx, &newy);
264	if (mp != oldmap)
265	retval |= P_NEW_MAP;
266	if (newmap)
267	*newmap = mp;
268	if (nx)
269	*nx = newx;
270	if (ny)
271	*ny = newy;
272		54
273	retval |= mp->spaces[newx + mp->width * newy].flags;	55	if (newmap) *newmap = mp;
		56	if (nx) *nx = newx;
		57	if (ny) *ny = newy;
274		58
275	return retval;	59	return mp->at (newx, newy).flags () | (mp != oldmap ? P_NEW_MAP : 0);
276	}	60	}
277		61
278	/*	62	/*
279	* Returns true if the given coordinate is blocked except by the	63	* Returns true if the given coordinate is blocked except by the
280	* object passed is not blocking. This is used with	64	* object passed is not blocking. This is used with
…		…
288	* by the caller.	72	* by the caller.
289	*/	73	*/
290	int	74	int
291	blocked_link (object *ob, maptile *m, int sx, int sy)	75	blocked_link (object *ob, maptile *m, int sx, int sy)
292	{	76	{
293	object *tmp;
294	int mflags, blocked;
295
296	/* 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
297	* have already checked this.	78	* have already checked this.
298	*/	79	*/
299	if (OUT_OF_REAL_MAP (m, sx, sy))	80	if (OUT_OF_REAL_MAP (m, sx, sy))
300	{	81	{
301	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");
302	return 1;	83	return 1;
303	}	84	}
304		85
305	/* Save some cycles - instead of calling get_map_flags(), just get the value	86	mapspace &ms = m->at (sx, sy);
306	* directly.
307	*/
308	mflags = m->spaces[sx + m->width * sy].flags;
309		87
310	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	88	int mflags = ms.flags ();
		89	int blocked = ms.move_block;
311		90
312	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
313	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
314	* things we need to do for players.	93	* things we need to do for players.
315	*/	94	*/
316	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
317	return 0;	96	return 0;
318		97
319	/* 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
320	* 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
321	* 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
322	* or another. Likewise, only if something is blocking us do we	101	* or another. Likewise, only if something is blocking us do we
323	* need to investigate if there is a special circumstance that would	102	* need to investigate if there is a special circumstance that would
324	* let the player through (inventory checkers for example)	103	* let the player through (inventory checkers for example)
325	*/	104	*/
326	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	105	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
327	return 0;	106	return 0;
328		107
329	if (ob->head != NULL)
330	ob = ob->head;	108	ob = ob->head_ ();
331		109
332	/* 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
333	* 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
334	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
335	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
336	*/	114	*/
337	for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
338	{	116	{
339		117	if (OB_MOVE_BLOCK (ob, tmp))
340	/* This must be before the checks below. Code for inventory checkers. */
341	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
342	{	118	{
343	/* If last_sp is set, the player/monster needs an object,	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
344	* so we check for it. If they don't have it, they can't	120	if (RESULT_INT (0))
345	* pass through this space.	121	return 1;
346	*/	122	else
347	if (tmp->last_sp)	123	continue;
		124
		125	if (tmp->type == CHECK_INV)
348	{	126	{
349	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))
350	return 1;	131	return 1;
351	else	132	}
352	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;
353	}	142	}
354	else	143	else
355	{	144	return 1; // unconditional block
356	/* In this case, the player must not have the object -	145
357	* if they do, they can't pass through.
358	*/
359	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
360	return 1;
361	else
362	continue;
363	}
364	} /* if check_inv */
365	else	146	} else {
366	{	147	// space does not block the ob, directly, but
367	/* Broke apart a big nasty if into several here to make	148	// anything alive that is not a door still
368	* this more readable. first check - if the space blocks	149	// blocks anything
369	* movement, can't move here.	150
370	* second - if a monster, can't move there, unles it is a	151	if (tmp->flag [FLAG_ALIVE]
371	* hidden dm	152	&& tmp->type != DOOR
372	*/	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
373	if (OB_MOVE_BLOCK (ob, tmp))
374	return 1;
375	if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
376	tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
377	return 1;	154	return 1;
378	}	155	}
379
380	}	156	}
		157
381	return 0;	158	return 0;
382	}	159	}
383		160
384
385	/*	161	/*
386	* 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
387	* This is meant for multi space objects - for single space objecs,	163	* spot. This is meant for multi space objects - for single space objecs,
388	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
389	* of object. This function goes through all the parts of the	165	* of object. This function goes through all the parts of the multipart
390	* multipart object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
391	*	167	*
392	* 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.
393	*	169	*
394	* This function has been used to deprecate arch_out_of_map -	170	* This function has been used to deprecate arch_out_of_map -
395	* this function also does that check, and since in most cases,	171	* this function also does that check, and since in most cases,
…		…
406	*	182	*
407	* Note this used to be arch_blocked, but with new movement	183	* Note this used to be arch_blocked, but with new movement
408	* 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
409	* against the move_block values.	185	* against the move_block values.
410	*/	186	*/
411		187	bool
412	int	188	object::blocked (maptile *m, int x, int y) const
413	ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
414	{	189	{
415	archetype *tmp;	190	for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
416	int flag;
417	maptile *m1;
418	sint16 sx, sy;
419
420	if (ob == NULL)
421	{
422	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
423	if (flag & P_OUT_OF_MAP)
424	return P_OUT_OF_MAP;
425
426	/* don't have object, so don't know what types would block */
427	return (GET_MAP_MOVE_BLOCK (m1, sx, sy));
428	}	191	{
		192	mapxy pos (m, x + tmp->x, y + tmp->y);
429		193
430	for (tmp = ob->arch; tmp != NULL; tmp = tmp->more)	194	if (!pos.normalise ())
431	{	195	return 1;
432	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
433		196
434	if (flag & P_OUT_OF_MAP)	197	mapspace &ms = *pos;
435	return P_OUT_OF_MAP;	198
436	if (flag & P_IS_ALIVE)	199	if (ms.flags () & P_IS_ALIVE)
437	return P_IS_ALIVE;	200	return 1;
438		201
439	/* find_first_free_spot() calls this function. However, often	202	/* However, often ob doesn't have any move type
440	* ob doesn't have any move type (when used to place exits)	203	* (signifying non-moving objects)
441	* 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.
442	*/	205	*/
443		206	if (!move_type && ms.move_block != MOVE_ALL)
444	if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL)
445	continue;	207	continue;
446		208
447	/* 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
448	* head of the object should correspond for the entire object.	210	* head of the object should correspond for the entire object.
449	*/	211	*/
450	if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy)))	212	if (ms.blocks (move_type))
451	return AB_NO_PASS;	213	return 1;
452
453	}	214	}
		215
454	return 0;	216	return 0;
455	}	217	}
456		218
457	/* When the map is loaded, load_object does not actually insert objects	219	//-GPL
458	* into inventory, but just links them. What this does is go through
459	* and insert them properly.
460	* The object 'container' is the object that contains the inventory.
461	* This is needed so that we can update the containers weight.
462	*/
463		220
464	void	221	void
465	fix_container (object *container)	222	maptile::set_object_flag (int flag, int value)
466	{	223	{
467	object *tmp = container->inv, *next;	224	if (!spaces)
		225	return;
468		226
469	container->inv = NULL;	227	for (mapspace *ms = spaces + size (); ms-- > spaces; )
470	while (tmp != NULL)	228	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
471	{	229	tmp->flag [flag] = value;
472	next = tmp->below;
473	if (tmp->inv)
474	fix_container (tmp);
475	(void) insert_ob_in_ob (tmp, container);
476	tmp = next;
477	}
478	/* sum_weight will go through and calculate what all the containers are
479	* carrying.
480	*/
481	sum_weight (container);
482	}	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
483		259
484	/* 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
485	* 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
486	* 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
487	* they are saved). We do have to look for the old maps that did save	263	* they are saved).
488	* the more sections and not re-add sections for them.
489	*/	264	*/
490		265	void
491	static void	266	maptile::link_multipart_objects ()
492	link_multipart_objects (maptile *m)
493	{	267	{
494	int x, y;	268	if (!spaces)
495	object *tmp, *op, *last, *above;	269	return;
496	archetype *at;
497		270
498	for (x = 0; x < MAP_WIDTH (m); x++)	271	for (mapspace *ms = spaces + size (); ms-- > spaces; )
499	for (y = 0; y < MAP_HEIGHT (m); y++)	272	{
500	for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above)	273	object *op = ms->bot;
		274	while (op)
501	{	275	{
502	above = tmp->above;
503
504	/* already multipart - don't do anything more */	276	/* already multipart - don't do anything more */
505	if (tmp->head || tmp->more)	277	if (op->head_ () == op && !op->more && op->arch->more)
506	continue;
507
508	/* If there is nothing more to this object, this for loop
509	* won't do anything.
510	*/
511	for (at = tmp->arch->more, last = tmp; at != NULL; at = at->more, last = op)
512	{	278	{
513	op = arch_to_object (at);	279	op->remove ();
		280	op->expand_tail ();
514		281
515	/* update x,y coordinates */	282	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
516	op->x += tmp->x;	283	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
517	op->y += tmp->y;	284	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
518	op->head = tmp;	285	insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
519	op->map = m;	286
520	last->more = op;	287	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
521	op->name = tmp->name;	288	// so we have to reset the iteration through the mapspace
522	op->title = tmp->title;
523	/* we could link all the parts onto tmp, and then just
524	* call insert_ob_in_map once, but the effect is the same,
525	* as insert_ob_in_map will call itself with each part, and
526	* the coding is simpler to just to it here with each part.
527	*/	289	}
528	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);	290	else
529	} /* for at = tmp->arch->more */	291	op = op->above;
530	} /* for objects on this space */	292	}
		293	}
531	}	294	}
		295
		296	//-GPL
532		297
533	/*	298	/*
534	* 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
535	* file pointer.	300	* file pointer.
536	* mapflags is the same as we get with load_original_map
537	*/	301	*/
538	void	302	bool
539	load_objects (maptile *m, object_thawer & fp, int mapflags)	303	maptile::_load_objects (object_thawer &f)
540	{	304	{
541	int i, j;	305	for (;;)
542	int unique;
543	object *op, *prev = NULL, *last_more = NULL, *otmp;
544
545	op = get_object ();
546	op->map = m; /* To handle buttons correctly */
547
548	while ((i = load_object (fp, op, mapflags)))
549	{	306	{
550	/* if the archetype for the object is null, means that we	307	coroapi::cede_to_tick (); // cede once in a while
551	* got an invalid object. Don't do anything with it - the game	308
552	* or editor will not be able to do anything with it either.	309	switch (f.kw)
553	*/
554	if (op->arch == NULL)
555	{	310	{
556	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
557	continue;	346	continue;
		347
		348	case KW_EOF:
		349	return true;
		350
		351	default:
		352	if (!f.parse_error ("map file"))
		353	return false;
		354	break;
558	}	355	}
559		356
		357	f.next ();
		358	}
560		359
561	switch (i)	360	return true;
		361	}
		362
		363	void
		364	maptile::activate ()
		365	{
		366	if (spaces)
		367	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		368	for (object *op = ms->bot; op; op = op->above)
		369	op->activate_recursive ();
		370	}
		371
		372	void
		373	maptile::deactivate ()
		374	{
		375	if (spaces)
		376	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		377	for (object *op = ms->bot; op; op = op->above)
		378	op->deactivate_recursive ();
		379	}
		380
		381	bool
		382	maptile::_save_objects (object_freezer &f, int flags)
		383	{
		384	coroapi::cede_to_tick ();
		385
		386	if (flags & IO_HEADER)
		387	_save_header (f);
		388
		389	if (!spaces)
		390	return false;
		391
		392	for (int i = 0; i < size (); ++i)
		393	{
		394	bool unique = 0;
		395
		396	for (object *op = spaces [i].bot; op; op = op->above)
562	{	397	{
563	case LL_NORMAL:	398	unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
564	/* if we are loading an overlay, put the floors on the bottom */	399
565	if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)	400	if (expect_false (!op->can_map_save ()))
566	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);	401	continue;
		402
		403	if (expect_false (unique || op->flag [FLAG_UNIQUE]))
567	else	404	{
568	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);	405	if (flags & IO_UNIQUES)
569		406	op->write (f);
570	if (op->inv)	407	}
571	sum_weight (op);	408	else if (expect_true (flags & IO_OBJECTS))
572		409	op->write (f);
573	prev = op, last_more = op;
574	break;
575
576	case LL_MORE:
577	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);
578	op->head = prev, last_more->more = op, last_more = op;
579	break;
580	}	410	}
581
582	if (mapflags & MAP_STYLE)
583	remove_from_active_list (op);
584
585	op = get_object ();
586	op->map = m;
587	}
588
589	for (i = 0; i < m->width; i++)
590	{	411	}
591	for (j = 0; j < m->height; j++)
592	{
593	unique = 0;
594	/* check for unique items, or unique squares */
595	for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above)
596	{
597	if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
598	unique = 1;
599	if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
600	SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
601	}
602	}
603	}
604		412
605	free_object (op);	413	coroapi::cede_to_tick ();
606	link_multipart_objects (m);
607	}
608		414
609	/* This saves all the objects on the map in a non destructive fashion.	415	return true;
610	* Modified by MSW 2001-07-01 to do in a single pass - reduces code,	416	}
611	* and we only save the head of multi part objects - this is needed	417
612	* in order to do map tiling properly.	418	bool
		419	maptile::_save_objects (const char *path, int flags)
		420	{
		421	object_freezer freezer;
		422
		423	if (!_save_objects (freezer, flags))
		424	return false;
		425
		426	return freezer.save (path);
		427	}
		428
		429	void
		430	maptile::init ()
		431	{
		432	in_memory = MAP_SWAPPED;
		433
		434	/* The maps used to pick up default x and y values from the
		435	* map archetype. Mimic that behaviour.
613	*/	436	*/
614	void	437	width = 16;
615	save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag)	438	height = 16;
616	{	439	timeout = 300;
617	int i, j = 0, unique = 0;	440	max_items = MAX_ITEM_PER_ACTION;
618	object *op;	441	max_volume = 2000000; // 2m³
619		442	reset_timeout = 0;
620	/* first pass - save one-part objects */	443	enter_x = 0;
621	for (i = 0; i < MAP_WIDTH (m); i++)	444	enter_y = 0;
622	for (j = 0; j < MAP_HEIGHT (m); j++)
623	{
624	unique = 0;
625	for (op = get_map_ob (m, i, j); op; op = op->above)
626	{
627	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
628	unique = 1;
629
630	if (op->type == PLAYER)
631	{
632	LOG (llevDebug, "Player on map that is being saved\n");
633	continue;
634	}
635
636	if (op->head || op->owner)
637	continue;
638
639	if (unique || QUERY_FLAG (op, FLAG_UNIQUE))
640	save_object (fp2, op, 3);
641	else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID))))
642	save_object (fp, op, 3);
643
644	} /* for this space */
645	} /* for this j */
646	}	445	}
647		446
648	maptile::maptile ()	447	maptile::maptile ()
649	{	448	{
650	in_memory = MAP_SWAPPED;	449	init ();
651	/* The maps used to pick up default x and y values from the
652	* map archetype. Mimic that behaviour.
653	*/
654	MAP_WIDTH (this) = 16;
655	MAP_HEIGHT (this) = 16;
656	MAP_RESET_TIMEOUT (this) = 0;
657	MAP_TIMEOUT (this) = 300;
658	MAP_ENTER_X (this) = 0;
659	MAP_ENTER_Y (this) = 0;
660	/*set part to -1 indicating conversion to weather map not yet done */
661	MAP_WORLDPARTX (this) = -1;
662	MAP_WORLDPARTY (this) = -1;
663	}	450	}
664		451
665	/*	452	maptile::maptile (int w, int h)
666	* Allocates, initialises, and returns a pointer to a maptile.
667	* Modified to no longer take a path option which was not being
668	* used anyways. MSW 2001-07-01
669	*/
670	maptile *
671	get_linked_map (void)
672	{	453	{
673	maptile *mp, *map = new maptile;	454	init ();
674		455
675	for (mp = first_map; mp && mp->next; mp = mp->next);	456	width = w;
		457	height = h;
676		458
677	if (mp == NULL)	459	alloc ();
678	first_map = map;
679	else
680	mp->next = map;
681
682	return map;
683	}	460	}
684		461
685	/*	462	/*
686	* Allocates the arrays contained in a maptile.	463	* Allocates the arrays contained in a maptile.
687	* This basically allocates the dynamic array of spaces for the	464	* This basically allocates the dynamic array of spaces for the
688	* map.	465	* map.
689	*/	466	*/
690	void	467	void
691	maptile::allocate ()	468	maptile::alloc ()
692	{	469	{
693	in_memory = MAP_IN_MEMORY;
694
695	/* Log this condition and free the storage. We could I suppose
696	* realloc, but if the caller is presuming the data will be intact,
697	* that is their poor assumption.
698	*/
699	if (spaces)	470	if (spaces)
700	{
701	LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
702	free (spaces);
703	}
704
705	spaces = (MapSpace *)
706	calloc (1, width * height * sizeof (MapSpace));
707
708	if (!spaces)
709	fatal (OUT_OF_MEMORY);
710	}
711
712	/* Create and returns a map of the specific size. Used
713	* in random map code and the editor.
714	*/
715	maptile *
716	get_empty_map (int sizex, int sizey)
717	{
718	maptile *m = get_linked_map ();
719
720	m->width = sizex;
721	m->height = sizey;
722	m->in_memory = MAP_SWAPPED;
723	m->allocate ();
724
725	return m;	471	return;
		472
		473	spaces = salloc0<mapspace> (size ());
726	}	474	}
		475
		476	//+GPL
727		477
728	/* 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
729	* 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
730	* at a later date.	480	* at a later date.
731	* Called by parse_map_headers below.	481	* Called by parse_map_headers below.
732	*/	482	*/
733
734	static shopitems *	483	static shopitems *
735	parse_shop_string (const char *input_string)	484	parse_shop_string (const char *input_string)
736	{	485	{
737	char *shop_string, *p, *q, *next_semicolon, *next_colon;	486	char *shop_string, *p, *q, *next_semicolon, *next_colon;
738	shopitems *items = NULL;	487	shopitems *items = NULL;
739	int i = 0, number_of_entries = 0;	488	int i = 0, number_of_entries = 0;
740	const typedata *current_type;	489	const typedata *current_type;
741		490
742	shop_string = strdup_local (input_string);	491	shop_string = strdup (input_string);
743	p = shop_string;	492	p = shop_string;
744	/* first we'll count the entries, we'll need that for allocating the array shortly */	493	/* first we'll count the entries, we'll need that for allocating the array shortly */
745	while (p)	494	while (p)
746	{	495	{
747	p = strchr (p, ';');	496	p = strchr (p, ';');
748	number_of_entries++;	497	number_of_entries++;
749	if (p)	498	if (p)
750	p++;	499	p++;
751	}	500	}
		501
752	p = shop_string;	502	p = shop_string;
753	strip_endline (p);	503	strip_endline (p);
754	items = new shopitems[number_of_entries + 1];	504	items = new shopitems[number_of_entries + 1];
755	for (i = 0; i < number_of_entries; i++)	505	for (i = 0; i < number_of_entries; i++)
756	{	506	{
757	if (!p)	507	if (!p)
758	{	508	{
759	LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");	509	LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
760	break;	510	break;
761	}	511	}
		512
762	next_semicolon = strchr (p, ';');	513	next_semicolon = strchr (p, ';');
763	next_colon = strchr (p, ':');	514	next_colon = strchr (p, ':');
764	/* if there is a stregth specified, figure out what it is, we'll need it soon. */	515	/* if there is a stregth specified, figure out what it is, we'll need it soon. */
765	if (next_colon && (!next_semicolon || next_colon < next_semicolon))	516	if (next_colon && (!next_semicolon || next_colon < next_semicolon))
766	items[i].strength = atoi (strchr (p, ':') + 1);	517	items[i].strength = atoi (strchr (p, ':') + 1);
…		…
793	* the next entry while we're at it, better print a warning	544	* the next entry while we're at it, better print a warning
794	*/	545	*/
795	LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);	546	LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
796	}	547	}
797	}	548	}
		549
798	items[i].index = number_of_entries;	550	items[i].index = number_of_entries;
799	if (next_semicolon)	551	if (next_semicolon)
800	p = ++next_semicolon;	552	p = ++next_semicolon;
801	else	553	else
802	p = NULL;	554	p = NULL;
803	}	555	}
		556
804	free (shop_string);	557	free (shop_string);
805	return items;	558	return items;
806	}	559	}
807		560
808	/* 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
809	* the map (or something equivilent) into output_string. */	562	* the map (or something equivilent) into output_string. */
810	static void	563	static const char *
811	print_shop_string (maptile *m, char *output_string)	564	print_shop_string (maptile *m)
812	{	565	{
813	int i;	566	static dynbuf_text buf; buf.clear ();
814	char tmp[MAX_BUF];	567	bool first = true;
815		568
816	strcpy (output_string, "");
817	for (i = 0; i < m->shopitems[0].index; i++)	569	for (int i = 0; i < m->shopitems[0].index; i++)
818	{	570	{
		571	if (!first)
		572	buf << ';';
		573
		574	first = false;
		575
819	if (m->shopitems[i].typenum)	576	if (m->shopitems[i].typenum)
820	{	577	{
821	if (m->shopitems[i].strength)	578	if (m->shopitems[i].strength)
822	{
823	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);
824	}
825	else	580	else
826	sprintf (tmp, "%s;", m->shopitems[i].name);	581	buf.printf ("%s", m->shopitems[i].name);
827	}	582	}
828	else	583	else
829	{	584	{
830	if (m->shopitems[i].strength)	585	if (m->shopitems[i].strength)
831	{
832	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	586	buf.printf ("*:%d", m->shopitems[i].strength);
833	}
834	else	587	else
835	sprintf (tmp, "*");	588	buf.printf ("*");
836	}	589	}
837	strcat (output_string, tmp);
838	}	590	}
		591
		592	return buf;
839	}	593	}
		594
		595	//-GPL
840		596
841	/* This loads the header information of the map. The header	597	/* This loads the header information of the map. The header
842	* contains things like difficulty, size, timeout, etc.	598	* contains things like difficulty, size, timeout, etc.
843	* 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
844	* addition of tiling, fields beyond that easily named in an	600	* addition of tiling, fields beyond that easily named in an
…		…
846	* put all the stuff in the map object so that names actually make	602	* put all the stuff in the map object so that names actually make
847	* sense.	603	* sense.
848	* This could be done in lex (like the object loader), but I think	604	* This could be done in lex (like the object loader), but I think
849	* currently, there are few enough fields this is not a big deal.	605	* currently, there are few enough fields this is not a big deal.
850	* MSW 2001-07-01	606	* MSW 2001-07-01
851	* return 0 on success, 1 on failure.
852	*/	607	*/
853		608	bool
854	static int	609	maptile::_load_header (object_thawer &thawer)
855	load_map_header (object_thawer & fp, maptile *m)
856	{	610	{
857	char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;	611	for (;;)
858	int msgpos = 0;
859	int maplorepos = 0;
860
861	while (fgets (buf, HUGE_BUF, fp) != NULL)
862	{	612	{
863	buf[HUGE_BUF - 1] = 0;	613	switch (thawer.kw)
864	key = buf;
865	while (isspace (*key))
866	key++;
867	if (*key == 0)
868	continue; /* empty line */
869	value = strchr (key, ' ');
870	if (!value)
871	{	614	{
872	end = strchr (key, '\n');	615	case KW_msg:
873	if (end != NULL)	616	thawer.get_ml (KW_endmsg, msg);
874	{	617	break;
875	*end = 0;	618
		619	case KW_lore: // deliantra extension
		620	thawer.get_ml (KW_endlore, maplore);
876	}	621	break;
		622
		623	case KW_maplore:
		624	thawer.get_ml (KW_endmaplore, maplore);
		625	break;
		626
		627	case KW_arch:
		628	if (strcmp (thawer.get_str (), "map"))
		629	LOG (llevError, "%s: loading map and got a non 'arch map' line (arch %s), skipping.\n", &path, thawer.get_str ());
		630	break;
		631
		632	case KW_oid:
		633	thawer.get (this, thawer.get_sint32 ());
		634	break;
		635
		636	case KW_file_format_version: break; // nop
		637
		638	case KW_name: thawer.get (name); break;
		639	case KW_attach: thawer.get (attach); break;
		640	case KW_reset_time: thawer.get (reset_time); break;
		641	case KW_shopgreed: thawer.get (shopgreed); break;
		642	case KW_shopmin: thawer.get (shopmin); break;
		643	case KW_shopmax: thawer.get (shopmax); break;
		644	case KW_shoprace: thawer.get (shoprace); break;
		645	case KW_outdoor: thawer.get (outdoor); break;
		646
		647	case KW_per_player: thawer.get (per_player); 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;
		651
		652	case KW_region: thawer.get (default_region); break;
		653	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
		654
		655	// old names new names
		656	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
		657	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
		658	case KW_x: case KW_width: thawer.get (width); break;
		659	case KW_y: case KW_height: thawer.get (height); break;
		660	case KW_weight: case KW_reset_timeout: thawer.get (reset_timeout); break;
		661	case KW_value: case KW_swap_time: thawer.get (timeout); break;
		662	case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;
		663	case KW_invisible: case KW_darkness: thawer.get (darkness); break;
		664	case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;
		665
		666	case KW_tile_path_1: thawer.get (tile_path [0]); break;
		667	case KW_tile_path_2: thawer.get (tile_path [1]); break;
		668	case KW_tile_path_3: thawer.get (tile_path [2]); 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;
877	}	685	}
878	else
879	{
880	*value = 0;
881	value++;
882	end = strchr (value, '\n');
883	while (isspace (*value))
884	{
885	value++;
886	if (*value == '\0' || value == end)
887	{
888	/* Nothing but spaces. */
889	value = NULL;
890	break;
891	}
892	}
893	}
894		686
895	if (!end)	687	thawer.next ();
896	{
897	LOG (llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", buf);
898	return 1;
899	}
900
901	/* key is the field name, value is what it should be set
902	* to. We've already done the work to null terminate key,
903	* and strip off any leading spaces for both of these.
904	* We have not touched the newline at the end of the line -
905	* these are needed for some values. the end pointer
906	* points to the first of the newlines.
907	* value could be NULL! It would be easy enough to just point
908	* this to "" to prevent cores, but that would let more errors slide
909	* through.
910	*
911	* First check for entries that do not use the value parameter, then
912	* validate that value is given and check for the remaining entries
913	* that use the parameter.
914	*/
915
916	if (!strcmp (key, "msg"))
917	{
918	while (fgets (buf, HUGE_BUF, fp) != NULL)
919	{
920	if (!strcmp (buf, "endmsg\n"))
921	break;
922	else
923	{
924	/* slightly more efficient than strcat */
925	strcpy (msgbuf + msgpos, buf);
926	msgpos += strlen (buf);
927	}
928	}
929	/* There are lots of maps that have empty messages (eg, msg/endmsg
930	* with nothing between). There is no reason in those cases to
931	* keep the empty message. Also, msgbuf contains garbage data
932	* when msgpos is zero, so copying it results in crashes
933	*/
934	if (msgpos != 0)
935	m->msg = strdup_local (msgbuf);
936	}
937	else if (!strcmp (key, "maplore"))
938	{
939	while (fgets (buf, HUGE_BUF, fp) != NULL)
940	{
941	if (!strcmp (buf, "endmaplore\n"))
942	break;
943	else
944	{
945	/* slightly more efficient than strcat */
946	strcpy (maplorebuf + maplorepos, buf);
947	maplorepos += strlen (buf);
948	}
949	}
950	if (maplorepos != 0)
951	m->maplore = strdup_local (maplorebuf);
952	}
953	else if (!strcmp (key, "end"))
954	{
955	break;
956	}
957	else if (value == NULL)
958	{
959	LOG (llevError, "Got '%s' line without parameter in map header\n", key);
960	}
961	else if (!strcmp (key, "arch"))
962	{
963	/* This is an oddity, but not something we care about much. */
964	if (strcmp (value, "map\n"))
965	LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
966	}
967	else if (!strcmp (key, "name"))
968	{
969	*end = 0;
970	m->name = strdup_local (value);
971	}
972	/* first strcmp value on these are old names supported
973	* for compatibility reasons. The new values (second) are
974	* what really should be used.
975	*/
976	else if (!strcmp (key, "oid"))
977	{
978	fp.get (m, atoi (value));
979	}
980	else if (!strcmp (key, "attach"))
981	{
982	m->attach = value;
983	}
984	else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
985	{
986	m->enter_x = atoi (value);
987	}
988	else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
989	{
990	m->enter_y = atoi (value);
991	}
992	else if (!strcmp (key, "x") || !strcmp (key, "width"))
993	{
994	m->width = atoi (value);
995	}
996	else if (!strcmp (key, "y") || !strcmp (key, "height"))
997	{
998	m->height = atoi (value);
999	}
1000	else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
1001	{
1002	m->reset_timeout = atoi (value);
1003	}
1004	else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
1005	{
1006	m->timeout = atoi (value);
1007	}
1008	else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
1009	{
1010	m->difficulty = atoi (value);
1011	}
1012	else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
1013	{
1014	m->darkness = atoi (value);
1015	}
1016	else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
1017	{
1018	m->fixed_resettime = atoi (value);
1019	}
1020	else if (!strcmp (key, "unique"))
1021	{
1022	m->unique = atoi (value);
1023	}
1024	else if (!strcmp (key, "template"))
1025	{
1026	m->templatemap = atoi (value);
1027	}
1028	else if (!strcmp (key, "region"))
1029	{
1030	m->region = get_region_by_name (value);
1031	}
1032	else if (!strcmp (key, "shopitems"))
1033	{
1034	*end = 0;
1035	m->shopitems = parse_shop_string (value);
1036	}
1037	else if (!strcmp (key, "shopgreed"))
1038	{
1039	m->shopgreed = atof (value);
1040	}
1041	else if (!strcmp (key, "shopmin"))
1042	{
1043	m->shopmin = atol (value);
1044	}
1045	else if (!strcmp (key, "shopmax"))
1046	{
1047	m->shopmax = atol (value);
1048	}
1049	else if (!strcmp (key, "shoprace"))
1050	{
1051	*end = 0;
1052	m->shoprace = strdup_local (value);
1053	}
1054	else if (!strcmp (key, "outdoor"))
1055	{
1056	m->outdoor = atoi (value);
1057	}
1058	else if (!strcmp (key, "temp"))
1059	{
1060	m->temp = atoi (value);
1061	}
1062	else if (!strcmp (key, "pressure"))
1063	{
1064	m->pressure = atoi (value);
1065	}
1066	else if (!strcmp (key, "humid"))
1067	{
1068	m->humid = atoi (value);
1069	}
1070	else if (!strcmp (key, "windspeed"))
1071	{
1072	m->windspeed = atoi (value);
1073	}
1074	else if (!strcmp (key, "winddir"))
1075	{
1076	m->winddir = atoi (value);
1077	}
1078	else if (!strcmp (key, "sky"))
1079	{
1080	m->sky = atoi (value);
1081	}
1082	else if (!strcmp (key, "nosmooth"))
1083	{
1084	m->nosmooth = atoi (value);
1085	}
1086	else if (!strncmp (key, "tile_path_", 10))
1087	{
1088	int tile = atoi (key + 10);
1089
1090	if (tile < 1 || tile > 4)
1091	{
1092	LOG (llevError, "load_map_header: tile location %d out of bounds (%s)\n", tile, m->path);
1093	}
1094	else
1095	{
1096	char *path;
1097
1098	*end = 0;
1099
1100	if (m->tile_path[tile - 1])
1101	{
1102	LOG (llevError, "load_map_header: tile location %d duplicated (%s)\n", tile, m->path);
1103	free (m->tile_path[tile - 1]);
1104	m->tile_path[tile - 1] = NULL;
1105	}
1106
1107	if (check_path (value, 1) != -1)
1108	{
1109	/* The unadorned path works. */
1110	path = value;
1111	}
1112	else
1113	{
1114	/* Try again; it could be a relative exit. */
1115
1116	path = path_combine_and_normalize (m->path, value);
1117
1118	if (check_path (path, 1) == -1)
1119	{
1120	LOG (llevError, "get_map_header: Bad tile path %s %s\n", m->path, value);
1121	path = NULL;
1122	}
1123	}
1124
1125	if (editor)
1126	{
1127	/* Use the value as in the file. */
1128	m->tile_path[tile - 1] = strdup_local (value);
1129	}
1130	else if (path != NULL)
1131	{
1132	/* Use the normalized value. */
1133	m->tile_path[tile - 1] = strdup_local (path);
1134	}
1135	} /* end if tile direction (in)valid */
1136	}
1137	else
1138	{
1139	LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
1140	}
1141	}
1142	if (!key || strcmp (key, "end"))
1143	{	688	}
1144	LOG (llevError, "Got premature eof on map header!\n");
1145	return 1;
1146	}
1147	return 0;
1148	}
1149		689
1150	/*	690	abort ();
1151	* Opens the file "filename" and reads information about the map
1152	* from the given file, and stores it in a newly allocated
1153	* maptile. A pointer to this structure is returned, or NULL on failure.
1154	* flags correspond to those in map.h. Main ones used are
1155	* MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and
1156	* MAP_BLOCK, in which case we block on this load. This happens in all
1157	* cases, no matter if this flag is set or not.
1158	* MAP_STYLE: style map - don't add active objects, don't add to server
1159	* managed map list.
1160	*/
1161
1162	maptile *
1163	load_original_map (const char *filename, int flags)
1164	{
1165	maptile *m;
1166	char pathname[MAX_BUF];
1167
1168	if (flags & MAP_PLAYER_UNIQUE)
1169	strcpy (pathname, filename);
1170	else if (flags & MAP_OVERLAY)
1171	strcpy (pathname, create_overlay_pathname (filename));
1172	else
1173	strcpy (pathname, create_pathname (filename));
1174
1175	LOG (llevDebug, "load_original_map(%x): %s (%s)\n", flags, filename, pathname);
1176
1177	object_thawer thawer (pathname);
1178
1179	if (!thawer)
1180	return 0;
1181
1182	m = get_linked_map ();
1183
1184	strcpy (m->path, filename);
1185	if (load_map_header (thawer, m))
1186	{
1187	LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1188	delete_map (m);
1189	return NULL;
1190	}
1191
1192	m->allocate ();
1193
1194	m->in_memory = MAP_LOADING;
1195	load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1196
1197	m->in_memory = MAP_IN_MEMORY;
1198	if (!MAP_DIFFICULTY (m))
1199	MAP_DIFFICULTY (m) = calculate_difficulty (m);
1200	set_map_reset_time (m);
1201	m->instantiate ();
1202	return (m);
1203	}	691	}
1204		692
1205	/*	693	//+GPL
1206	* Loads a map, which has been loaded earlier, from file.
1207	* Return the map object we load into (this can change from the passed
1208	* option if we can't find the original map)
1209	*/
1210
1211	static maptile *
1212	load_temporary_map (maptile *m)
1213	{
1214	char buf[MAX_BUF];
1215
1216	if (!m->tmpname)
1217	{
1218	LOG (llevError, "No temporary filename for map %s\n", m->path);
1219	strcpy (buf, m->path);
1220	delete_map (m);
1221	m = load_original_map (buf, 0);
1222	if (m == NULL)
1223	return NULL;
1224	fix_auto_apply (m); /* Chests which open as default */
1225	return m;
1226	}
1227
1228	object_thawer thawer (m->tmpname);
1229
1230	if (!thawer)
1231	{
1232	strcpy (buf, m->path);
1233	delete_map (m);
1234	m = load_original_map (buf, 0);
1235	if (!m)
1236	return NULL;
1237	fix_auto_apply (m); /* Chests which open as default */
1238	return m;
1239	}
1240
1241	if (load_map_header (thawer, m))
1242	{
1243	LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);
1244	delete_map (m);
1245	m = load_original_map (m->path, 0);
1246	return NULL;
1247	}
1248
1249	m->allocate ();
1250
1251	m->in_memory = MAP_LOADING;
1252	load_objects (m, thawer, 0);
1253
1254	m->in_memory = MAP_IN_MEMORY;
1255	INVOKE_MAP (SWAPIN, m);
1256	return m;
1257	}
1258
1259	/*
1260	* Loads a map, which has been loaded earlier, from file.
1261	* Return the map object we load into (this can change from the passed
1262	* option if we can't find the original map)
1263	*/
1264
1265	maptile *
1266	load_overlay_map (const char *filename, maptile *m)
1267	{
1268	char pathname[MAX_BUF];
1269
1270	strcpy (pathname, create_overlay_pathname (filename));
1271
1272	object_thawer thawer (pathname);
1273
1274	if (!thawer)
1275	return m;
1276
1277	if (load_map_header (thawer, m))
1278	{
1279	LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1280	delete_map (m);
1281	m = load_original_map (m->path, 0);
1282	return NULL;
1283	}
1284	/*m->allocate ();*/
1285
1286	m->in_memory = MAP_LOADING;
1287	load_objects (m, thawer, MAP_OVERLAY);
1288
1289	m->in_memory = MAP_IN_MEMORY;
1290	return m;
1291	}
1292		694
1293	/******************************************************************************	695	/******************************************************************************
1294	* This is the start of unique map handling code	696	* This is the start of unique map handling code
1295	*****************************************************************************/	697	*****************************************************************************/
1296		698
1297	/* This goes through map 'm' and removed any unique items on the map. */	699	/* This goes through the maptile and removed any unique items on the map. */
1298	static void	700	void
1299	delete_unique_items (maptile *m)	701	maptile::clear_unique_items ()
1300	{	702	{
1301	int i, j, unique;	703	for (int i = 0; i < size (); ++i)
1302	object *op, *next;
1303
1304	for (i = 0; i < MAP_WIDTH (m); i++)
1305	for (j = 0; j < MAP_HEIGHT (m); j++)
1306	{	704	{
1307	unique = 0;	705	int unique = 0;
1308	for (op = get_map_ob (m, i, j); op; op = next)	706	for (object *op = spaces [i].bot; op; )
		707	{
		708	object *above = op->above;
		709
		710	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		711	unique = 1;
		712
		713	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
		714	op->destroy ();
		715
		716	op = above;
		717	}
		718	}
		719	}
		720
		721	//-GPL
		722
		723	bool
		724	maptile::_save_header (object_freezer &freezer)
		725	{
		726	#define MAP_OUT(k) freezer.put (KW(k), k)
		727	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
		728
		729	MAP_OUT2 (arch, CS(map));
		730
		731	if (name) MAP_OUT (name);
		732	MAP_OUT (swap_time);
		733	MAP_OUT (reset_time);
		734	MAP_OUT (reset_timeout);
		735	MAP_OUT (fixed_resettime);
		736	MAP_OUT (no_reset);
		737	MAP_OUT (no_drop);
		738	MAP_OUT (difficulty);
		739	if (default_region) MAP_OUT2 (region, default_region->name);
		740
		741	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
		742	MAP_OUT (shopgreed);
		743	MAP_OUT (shopmin);
		744	MAP_OUT (shopmax);
		745	if (shoprace) MAP_OUT (shoprace);
		746
		747	MAP_OUT (width);
		748	MAP_OUT (height);
		749	MAP_OUT (enter_x);
		750	MAP_OUT (enter_y);
		751	MAP_OUT (darkness);
		752	MAP_OUT (outdoor);
		753
		754	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
		755	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
		756
		757	MAP_OUT (per_player);
		758	MAP_OUT (per_party);
		759
		760	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
		761	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
		762	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
		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]);
		766
		767	freezer.put (this);
		768	freezer.put (KW(end));
		769
		770	return true;
		771	}
		772
		773	bool
		774	maptile::_save_header (const char *path)
		775	{
		776	object_freezer freezer;
		777
		778	if (!_save_header (freezer))
		779	return false;
		780
		781	return freezer.save (path);
		782	}
		783
		784	//+GPL
		785
		786	/*
		787	* Remove and free all objects in the given map.
		788	*/
		789	void
		790	maptile::clear ()
		791	{
		792	if (spaces)
		793	{
		794	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		795	while (object *op = ms->bot)
1309	{	796	{
		797	// manually remove, as to not trigger anything
1310	next = op->above;	798	if (ms->bot = op->above)
1311	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	799	ms->bot->below = 0;
1312	unique = 1;	800
1313	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))	801	op->flag [FLAG_REMOVED] = true;
		802
		803	object *head = op->head_ ();
		804	if (op == head)
		805	op->destroy ();
		806	else if (head->map != op->map)
1314	{	807	{
1315	clean_object (op);	808	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
1316	if (QUERY_FLAG (op, FLAG_IS_LINKED))	809	head->destroy ();
1317	remove_button_link (op);
1318	remove_ob (op);
1319	free_object (op);
1320	}	810	}
1321	}	811	}
		812
		813	sfree0 (spaces, size ());
1322	}	814	}
1323	}
1324		815
1325
1326	/*
1327	* Loads unique objects from file(s) into the map which is in memory
1328	* m is the map to load unique items into.
1329	*/
1330	static void
1331	load_unique_objects (maptile *m)
1332	{
1333	int count;
1334	char firstname[MAX_BUF];
1335
1336	for (count = 0; count < 10; count++)
1337	{
1338	sprintf (firstname, "%s.v%02d", create_items_path (m->path), count);
1339	if (!access (firstname, R_OK))
1340	break;
1341	}
1342	/* If we get here, we did not find any map */
1343	if (count == 10)
1344	return;
1345
1346	object_thawer thawer (firstname);
1347
1348	if (!thawer)
1349	return;
1350
1351	m->in_memory = MAP_LOADING;
1352	if (m->tmpname == NULL) /* if we have loaded unique items from */
1353	delete_unique_items (m); /* original map before, don't duplicate them */
1354	load_objects (m, thawer, 0);
1355
1356	m->in_memory = MAP_IN_MEMORY;
1357	}
1358
1359
1360	/*
1361	* Saves a map to file. If flag is set, it is saved into the same
1362	* file it was (originally) loaded from. Otherwise a temporary
1363	* filename will be genarated, and the file will be stored there.
1364	* The temporary filename will be stored in the maptileure.
1365	* If the map is unique, we also save to the filename in the map
1366	* (this should have been updated when first loaded)
1367	*/
1368
1369	int
1370	new_save_map (maptile *m, int flag)
1371	{
1372	char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1373	int i;
1374
1375	if (flag && !*m->path)
1376	{
1377	LOG (llevError, "Tried to save map without path.\n");
1378	return -1;
1379	}
1380
1381	if (flag || (m->unique) || (m->templatemap))
1382	{
1383	if (!m->unique && !m->templatemap)
1384	{ /* flag is set */
1385	if (flag == 2)
1386	strcpy (filename, create_overlay_pathname (m->path));
1387	else
1388	strcpy (filename, create_pathname (m->path));
1389	}
1390	else
1391	strcpy (filename, m->path);
1392
1393	make_path_to_file (filename);
1394	}
1395	else
1396	{
1397	if (!m->tmpname)
1398	m->tmpname = tempnam_local (settings.tmpdir, NULL);
1399
1400	strcpy (filename, m->tmpname);
1401	}
1402
1403	LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
1404	m->in_memory = MAP_SAVING;
1405
1406	object_freezer freezer;
1407
1408	/* legacy */
1409	fprintf (freezer, "arch map\n");
1410	if (m->name)
1411	fprintf (freezer, "name %s\n", m->name);
1412	if (!flag)
1413	fprintf (freezer, "swap_time %d\n", m->swap_time);
1414	if (m->reset_timeout)
1415	fprintf (freezer, "reset_timeout %d\n", m->reset_timeout);
1416	if (m->fixed_resettime)
1417	fprintf (freezer, "fixed_resettime %d\n", m->fixed_resettime);
1418	/* we unfortunately have no idea if this is a value the creator set
1419	* or a difficulty value we generated when the map was first loaded
1420	*/
1421	if (m->difficulty)
1422	fprintf (freezer, "difficulty %d\n", m->difficulty);
1423	if (m->region)
1424	fprintf (freezer, "region %s\n", m->region->name);
1425	if (m->shopitems)
1426	{
1427	print_shop_string (m, shop);
1428	fprintf (freezer, "shopitems %s\n", shop);
1429	}
1430	if (m->shopgreed)
1431	fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1432	#ifndef WIN32
1433	if (m->shopmin)
1434	fprintf (freezer, "shopmin %llu\n", m->shopmin);
1435	if (m->shopmax)
1436	fprintf (freezer, "shopmax %llu\n", m->shopmax);
1437	#else
1438	if (m->shopmin)
1439	fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1440	if (m->shopmax)
1441	fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1442	#endif
1443	if (m->shoprace)
1444	fprintf (freezer, "shoprace %s\n", m->shoprace);
1445	if (m->darkness)
1446	fprintf (freezer, "darkness %d\n", m->darkness);
1447	if (m->width)
1448	fprintf (freezer, "width %d\n", m->width);
1449	if (m->height)
1450	fprintf (freezer, "height %d\n", m->height);
1451	if (m->enter_x)
1452	fprintf (freezer, "enter_x %d\n", m->enter_x);
1453	if (m->enter_y)
1454	fprintf (freezer, "enter_y %d\n", m->enter_y);
1455	if (m->msg)
1456	fprintf (freezer, "msg\n%sendmsg\n", m->msg);
1457	if (m->maplore)
1458	fprintf (freezer, "maplore\n%sendmaplore\n", m->maplore);
1459	if (m->unique)
1460	fprintf (freezer, "unique %d\n", m->unique);
1461	if (m->templatemap)
1462	fprintf (freezer, "template %d\n", m->templatemap);
1463	if (m->outdoor)
1464	fprintf (freezer, "outdoor %d\n", m->outdoor);
1465	if (m->temp)
1466	fprintf (freezer, "temp %d\n", m->temp);
1467	if (m->pressure)
1468	fprintf (freezer, "pressure %d\n", m->pressure);
1469	if (m->humid)
1470	fprintf (freezer, "humid %d\n", m->humid);
1471	if (m->windspeed)
1472	fprintf (freezer, "windspeed %d\n", m->windspeed);
1473	if (m->winddir)
1474	fprintf (freezer, "winddir %d\n", m->winddir);
1475	if (m->sky)
1476	fprintf (freezer, "sky %d\n", m->sky);
1477	if (m->nosmooth)
1478	fprintf (freezer, "nosmooth %d\n", m->nosmooth);
1479
1480	/* Save any tiling information, except on overlays */
1481	if (flag != 2)
1482	for (i = 0; i < 4; i++)
1483	if (m->tile_path[i])
1484	fprintf (freezer, "tile_path_%d %s\n", i + 1, m->tile_path[i]);
1485
1486	freezer.put (m);
1487	fprintf (freezer, "end\n");
1488
1489	/* In the game save unique items in the different file, but
1490	* in the editor save them to the normal map file.
1491	* If unique map, save files in the proper destination (set by
1492	* player)
1493	*/
1494	if ((flag == 0 || flag == 2) && !m->unique && !m->templatemap)
1495	{
1496	object_freezer unique;
1497
1498	if (flag == 2)
1499	save_objects (m, freezer, unique, 2);
1500	else
1501	save_objects (m, freezer, unique, 0);
1502
1503	sprintf (buf, "%s.v00", create_items_path (m->path));
1504
1505	unique.save (buf);
1506	}
1507	else
1508	{ /* save same file when not playing, like in editor */
1509	save_objects (m, freezer, freezer, 0);
1510	}
1511
1512	freezer.save (filename);
1513
1514	return 0;
1515	}
1516
1517
1518	/*
1519	* Remove and free all objects in the inventory of the given object.
1520	* object.c ?
1521	*/
1522
1523	void
1524	clean_object (object *op)
1525	{
1526	object *tmp, *next;
1527
1528	for (tmp = op->inv; tmp; tmp = next)
1529	{
1530	next = tmp->below;
1531	clean_object (tmp);
1532	if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1533	remove_button_link (tmp);
1534	remove_ob (tmp);
1535	free_object (tmp);
1536	}
1537	}
1538
1539	/*
1540	* Remove and free all objects in the given map.
1541	*/
1542
1543	void
1544	free_all_objects (maptile *m)
1545	{
1546	int i, j;
1547	object *op;
1548
1549	for (i = 0; i < MAP_WIDTH (m); i++)
1550	for (j = 0; j < MAP_HEIGHT (m); j++)
1551	{
1552	object *previous_obj = NULL;
1553
1554	while ((op = GET_MAP_OB (m, i, j)) != NULL)
1555	{
1556	if (op == previous_obj)
1557	{
1558	LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1559	break;
1560	}
1561	previous_obj = op;
1562	if (op->head != NULL)
1563	op = op->head;
1564
1565	/* If the map isn't in memory, free_object will remove and
1566	* free objects in op's inventory. So let it do the job.
1567	*/
1568	if (m->in_memory == MAP_IN_MEMORY)
1569	clean_object (op);
1570	remove_ob (op);
1571	free_object (op);
1572	}
1573	}
1574	}
1575
1576	/*
1577	* Frees everything allocated by the given maptileure.
1578	* don't free tmpname - our caller is left to do that
1579	*/
1580
1581	void
1582	free_map (maptile *m, int flag)
1583	{
1584	int i;
1585
1586	if (!m->in_memory)
1587	{
1588	LOG (llevError, "Trying to free freed map.\n");
1589	return;
1590	}
1591	if (flag && m->spaces)
1592	free_all_objects (m);
1593	if (m->name)
1594	FREE_AND_CLEAR (m->name);
1595	if (m->spaces)
1596	FREE_AND_CLEAR (m->spaces);
1597	if (m->msg)
1598	FREE_AND_CLEAR (m->msg);
1599	if (m->maplore)
1600	FREE_AND_CLEAR (m->maplore);
1601	if (m->shopitems)
1602	delete[]m->shopitems;
1603	m->shopitems = 0;
1604	if (m->shoprace)
1605	FREE_AND_CLEAR (m->shoprace);
1606	if (m->buttons)	816	if (buttons)
1607	free_objectlinkpt (m->buttons);	817	free_objectlinkpt (buttons), buttons = 0;
1608	m->buttons = NULL;	818
		819	sfree0 (regions, size ());
		820	delete [] regionmap; regionmap = 0;
		821	}
		822
		823	void
		824	maptile::clear_header ()
		825	{
		826	name = 0;
		827	msg = 0;
		828	maplore = 0;
		829	shoprace = 0;
		830	delete [] shopitems, shopitems = 0;
		831
1609	for (i = 0; i < 4; i++)	832	for (int i = 0; i < TILE_NUM; i++)
1610	{	833	tile_path [i] = 0;
1611	if (m->tile_path[i])
1612	FREE_AND_CLEAR (m->tile_path[i]);
1613	m->tile_map[i] = NULL;
1614	}
1615	m->in_memory = MAP_SWAPPED;
1616	}	834	}
1617		835
1618	/*	836	maptile::~maptile ()
1619	* function: vanish maptile
1620	* m : pointer to maptile, if NULL no action
1621	* this deletes all the data on the map (freeing pointers)
1622	* and then removes this map from the global linked list of maps.
1623	*/
1624
1625	void
1626	delete_map (maptile *m)
1627	{	837	{
1628	maptile *tmp, *last;	838	assert (destroyed ());
1629	int i;	839	}
1630		840
1631	if (!m)	841	void
1632	return;	842	maptile::clear_links_to (maptile *m)
1633		843	{
1634	m->clear ();
1635
1636	if (m->in_memory == MAP_IN_MEMORY)
1637	{
1638	/* change to MAP_SAVING, even though we are not,
1639	* so that remove_ob doesn't do as much work.
1640	*/
1641	m->in_memory = MAP_SAVING;
1642	free_map (m, 1);
1643	}
1644	/* move this out of free_map, since tmpname can still be needed if
1645	* the map is swapped out.
1646	*/
1647	if (m->tmpname)
1648	{
1649	free (m->tmpname);
1650	m->tmpname = NULL;
1651	}
1652	last = NULL;
1653	/* We need to look through all the maps and see if any maps	844	/* We need to look through all the maps and see if any maps
1654	* are pointing at this one for tiling information. Since	845	* are pointing at this one for tiling information. Since
1655	* tiling can be assymetric, we just can not look to see which	846	* tiling can be asymetric, we just can not look to see which
1656	* maps this map tiles with and clears those.	847	* maps this map tiles with and clears those.
1657	*/	848	*/
1658	for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1659	{
1660	if (tmp->next == m)
1661	last = tmp;
1662
1663	/* This should hopefully get unrolled on a decent compiler */
1664	for (i = 0; i < 4; i++)	849	for (int i = 0; i < 4; i++)
1665	if (tmp->tile_map[i] == m)	850	if (tile_map[i] == m)
1666	tmp->tile_map[i] = NULL;	851	tile_map[i] = 0;
1667	}	852	}
1668		853
1669	/* If last is null, then this should be the first map in the list */	854	void
		855	maptile::do_destroy ()
		856	{
		857	attachable::do_destroy ();
		858
		859	clear ();
		860	}
		861
		862	/* decay and destroy perishable items in a map */
		863	// TODO: should be done regularly, not on map load?
		864	void
		865	maptile::do_decay_objects ()
		866	{
1670	if (!last)	867	if (!spaces)
		868	return;
		869
		870	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		871	for (object *above, *op = ms->bot; op; op = above)
1671	{	872	{
1672	if (m == first_map)	873	above = op->above;
1673	first_map = m->next;	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 ())
		889	{
		890	op->stats.dam--;
		891	if (op->stats.dam < 0)
		892	destroy = 1;
		893	}
		894	else if (op->is_armor ())
		895	{
		896	op->stats.ac--;
		897	if (op->stats.ac < 0)
		898	destroy = 1;
		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	}
1674	else	906	else
1675	/* m->path is a static char, so should hopefully still have
1676	* some useful data in it.
1677	*/
1678	LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1679	}
1680	else
1681	last->next = m->next;
1682
1683	delete m;
1684	}
1685
1686
1687
1688	/*
1689	* Makes sure the given map is loaded and swapped in.
1690	* name is path name of the map.
1691	* flags meaning:
1692	* 0x1 (MAP_FLUSH): flush the map - always load from the map directory,
1693	* and don't do unique items or the like.
1694	* 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1695	* dont do any more name translation on it.
1696	*
1697	* Returns a pointer to the given map.
1698	*/
1699
1700	maptile *
1701	ready_map_name (const char *name, int flags)
1702	{
1703	maptile *m;
1704
1705	if (!name)
1706	return (NULL);
1707
1708	/* Have we been at this level before? */
1709	m = has_been_loaded (name);
1710
1711	/* Map is good to go, so just return it */
1712	if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1713	{
1714	return m;
1715	}
1716
1717	/* unique maps always get loaded from their original location, and never
1718	* a temp location. Likewise, if map_flush is set, or we have never loaded
1719	* this map, load it now. I removed the reset checking from here -
1720	* it seems the probability of a player trying to enter a map that should
1721	* reset but hasn't yet is quite low, and removing that makes this function
1722	* a bit cleaner (and players probably shouldn't rely on exact timing for
1723	* resets in any case - if they really care, they should use the 'maps command.
1724	*/
1725	if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1726	{
1727
1728	/* first visit or time to reset */
1729	if (m)
1730	{	907	{
1731	clean_tmp_map (m); /* Doesn't make much difference */	908	int mat = op->materials;
1732	delete_map (m);	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;
1733	}	923	}
1734		924
1735	/* create and load a map */	925	/* adjust overall chance below */
1736	if (flags & MAP_PLAYER_UNIQUE)	926	if (destroy && rndm (0, 1))
1737	LOG (llevDebug, "Trying to load map %s.\n", name);	927	op->destroy ();
1738	else
1739	LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));
1740
1741	//eval_pv ("$x = Event::time", 1);//D
1742	if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))
1743	return (NULL);
1744	//eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D
1745
1746	fix_auto_apply (m); /* Chests which open as default */
1747
1748	/* If a player unique map, no extra unique object file to load.
1749	* if from the editor, likewise.
1750	*/
1751	if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)))
1752	load_unique_objects (m);
1753
1754	if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE | MAP_OVERLAY)))
1755	{
1756	m = load_overlay_map (name, m);
1757	if (m == NULL)
1758	return NULL;
1759	}	928	}
1760
1761	if (flags & MAP_PLAYER_UNIQUE)
1762	INVOKE_MAP (SWAPIN, m);
1763
1764	}
1765	else
1766	{
1767	/* If in this loop, we found a temporary map, so load it up. */
1768
1769	m = load_temporary_map (m);
1770	if (m == NULL)
1771	return NULL;
1772	load_unique_objects (m);
1773
1774	clean_tmp_map (m);
1775	m->in_memory = MAP_IN_MEMORY;
1776	/* tempnam() on sun systems (probably others) uses malloc
1777	* to allocated space for the string. Free it here.
1778	* In some cases, load_temporary_map above won't find the
1779	* temporary map, and so has reloaded a new map. If that
1780	* is the case, tmpname is now null
1781	*/
1782	if (m->tmpname)
1783	free (m->tmpname);
1784	m->tmpname = NULL;
1785	/* It's going to be saved anew anyway */
1786	}
1787
1788	/* Below here is stuff common to both first time loaded maps and
1789	* temp maps.
1790	*/
1791
1792	decay_objects (m); /* start the decay */
1793	/* In case other objects press some buttons down */
1794	update_buttons (m);
1795	if (m->outdoor)
1796	set_darkness_map (m);
1797	/* run the weather over this map */
1798	weather_effect (name);
1799	return m;
1800	}	929	}
1801
1802		930
1803	/*	931	/*
1804	* 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.
1805	* difficulty does not have a lot to do with character level,	933	* difficulty does not have a lot to do with character level,
1806	* 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.
1807	*	935	*
1808	* 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
1809	* 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
1810	* have a difficulty set than using this function - human calculation	938	* have a difficulty set rather than using this function - human calculation
1811	* is much better than this functions guesswork.	939	* is much better than this function's guesswork.
1812	*/	940	*/
1813
1814	int	941	int
1815	calculate_difficulty (maptile *m)	942	maptile::estimate_difficulty () const
1816	{	943	{
1817	object *op;
1818	archetype *at;
1819	int x, y, i;
1820	long monster_cnt = 0;	944	long monster_cnt = 0;
1821	double avgexp = 0;	945	double avgexp = 0;
1822	sint64 total_exp = 0;	946	sint64 total_exp = 0;
1823		947
1824	if (MAP_DIFFICULTY (m))	948	for (mapspace *ms = spaces + size (); ms-- > spaces; )
1825	{	949	for (object *op = ms->bot; op; op = op->above)
1826	LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m));
1827	return MAP_DIFFICULTY (m);
1828	}
1829
1830	for (x = 0; x < MAP_WIDTH (m); x++)
1831	for (y = 0; y < MAP_HEIGHT (m); y++)
1832	for (op = get_map_ob (m, x, y); op != NULL; op = op->above)
1833	{	950	{
1834	if (QUERY_FLAG (op, FLAG_MONSTER))	951	if (op->flag [FLAG_MONSTER])
1835	{	952	{
1836	total_exp += op->stats.exp;	953	total_exp += op->stats.exp;
1837	monster_cnt++;	954	monster_cnt++;
1838	}	955	}
1839		956
1840	if (QUERY_FLAG (op, FLAG_GENERATOR))	957	if (op->flag [FLAG_GENERATOR])
1841	{	958	{
1842	total_exp += op->stats.exp;	959	total_exp += op->stats.exp;
1843	at = type_to_archetype (GENERATE_TYPE (op));
1844		960
1845	if (at != NULL)	961	if (archetype *at = op->other_arch)
		962	{
1846	total_exp += at->clone.stats.exp * 8;	963	total_exp += at->stats.exp * 8;
1847
1848	monster_cnt++;	964	monster_cnt++;
1849	}	965	}
		966
		967	for (object *inv = op->inv; inv; inv = inv->below)
		968	{
		969	total_exp += op->stats.exp * 8;
		970	monster_cnt++;
		971	}
1850	}	972	}
		973	}
1851		974
1852	avgexp = (double) total_exp / monster_cnt;	975	avgexp = (double) total_exp / monster_cnt;
1853		976
1854	for (i = 1; i <= settings.max_level; i++)	977	for (int i = 1; i <= settings.max_level; i++)
1855	{
1856	if ((level_exp (i, 1) - level_exp (i - 1, 1)) > (100 * avgexp))	978	if ((level_exp (i, 1) - level_exp (i - 1, 1)) > (100 * avgexp))
1857	{
1858	/* LOG(llevDebug, "Calculated difficulty for map: %s: %d\n", m->name, i); */
1859	return i;	979	return i;
1860	}
1861	}
1862		980
1863	return 1;	981	return 1;
1864	}
1865
1866	void
1867	clean_tmp_map (maptile *m)
1868	{
1869	if (m->tmpname == NULL)
1870	return;
1871	INVOKE_MAP (CLEAN, m);
1872	(void) unlink (m->tmpname);
1873	}
1874
1875	void
1876	free_all_maps (void)
1877	{
1878	int real_maps = 0;
1879
1880	while (first_map)
1881	{
1882	/* I think some of the callers above before it gets here set this to be
1883	* saving, but we still want to free this data
1884	*/
1885	if (first_map->in_memory == MAP_SAVING)
1886	first_map->in_memory = MAP_IN_MEMORY;
1887	delete_map (first_map);
1888	real_maps++;
1889	}
1890	LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1891	}	982	}
1892		983
1893	/* change_map_light() - used to change map light level (darkness)	984	/* change_map_light() - used to change map light level (darkness)
1894	* up or down. Returns true if successful. It should now be	985	* up or down. Returns true if successful. It should now be
1895	* possible to change a value by more than 1.	986	* possible to change a value by more than 1.
1896	* Move this from los.c to map.c since this is more related	987	* Move this from los.c to map.c since this is more related
1897	* to maps than los.	988	* to maps than los.
1898	* postive values make it darker, negative make it brighter	989	* postive values make it darker, negative make it brighter
1899	*/	990	*/
1900
1901	int	991	int
1902	change_map_light (maptile *m, int change)	992	maptile::change_map_light (int change)
1903	{	993	{
1904	int new_level = m->darkness + change;
1905
1906	/* Nothing to do */	994	/* Nothing to do */
1907	if (!change || (new_level <= 0 && m->darkness == 0) || (new_level >= MAX_DARKNESS && m->darkness >= MAX_DARKNESS))	995	if (!change)
1908	{
1909	return 0;	996	return 0;
1910	}
1911		997
1912	/* inform all players on the map */	998	/* inform all players on the map */
1913	if (change > 0)	999	if (change > 0)
1914	new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes darker.");	1000	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1915	else	1001	else
1916	new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes brighter.");	1002	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1917		1003
1918	/* Do extra checking. since m->darkness is a unsigned value,	1004	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1919	* we need to be extra careful about negative values.
1920	* In general, the checks below are only needed if change
1921	* is not +/-1
1922	*/
1923	if (new_level < 0)
1924	m->darkness = 0;
1925	else if (new_level >= MAX_DARKNESS)
1926	m->darkness = MAX_DARKNESS;
1927	else
1928	m->darkness = new_level;
1929		1005
1930	/* All clients need to get re-updated for the change */	1006	/* All clients need to get re-updated for the change */
1931	update_all_map_los (m);	1007	update_all_map_los (this);
		1008
1932	return 1;	1009	return 1;
1933	}	1010	}
1934
1935		1011
1936	/*	1012	/*
1937	* This function updates various attributes about a specific space	1013	* This function updates various attributes about a specific space
1938	* on the map (what it looks like, whether it blocks magic,	1014	* on the map (what it looks like, whether it blocks magic,
1939	* has a living creatures, prevents people from passing	1015	* has a living creatures, prevents people from passing
1940	* through, etc)	1016	* through, etc)
1941	*/	1017	*/
1942	void	1018	void
1943	update_position (maptile *m, int x, int y)	1019	mapspace::update_ ()
1944	{	1020	{
1945	object *tmp, *last = NULL;	1021	object *last = 0;
1946	uint8 flags = 0, oldflags, light = 0, anywhere = 0;	1022	uint8 flags = P_UPTODATE;
1947	New_Face *top, *floor, *middle;	1023	sint8 light = 0;
1948	object *top_obj, *floor_obj, *middle_obj;
1949	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;
1950		1029
1951	oldflags = GET_MAP_FLAGS (m, x, y);	1030	//object *middle = 0;
1952	if (!(oldflags & P_NEED_UPDATE))	1031	//object *top = 0;
1953	{	1032	//object *floor = 0;
1954	LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y);	1033	// this seems to generate better code than using locals, above
1955	return;	1034	object *&top = faces_obj[0] = 0;
		1035	object *&middle = faces_obj[1] = 0;
		1036	object *&floor = faces_obj[2] = 0;
		1037
		1038	object::flags_t allflags; // all flags of all objects or'ed together
		1039
		1040	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1956	}	1041	{
1957		1042	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1958	middle = blank_face;
1959	top = blank_face;
1960	floor = blank_face;
1961
1962	middle_obj = NULL;
1963	top_obj = NULL;
1964	floor_obj = NULL;
1965
1966	for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above)
1967	{
1968
1969	/* This could be made additive I guess (two lights better than
1970	* one). But if so, it shouldn't be a simple additive - 2
1971	* light bulbs do not illuminate twice as far as once since
1972	* it is a disapation factor that is squared (or is it cubed?)
1973	*/
1974	if (tmp->glow_radius > light)
1975	light = tmp->glow_radius;	1043	light += tmp->glow_radius;
1976		1044
1977	/* This call is needed in order to update objects the player	1045	/* This call is needed in order to update objects the player
1978	* is standing in that have animations (ie, grass, fire, etc).	1046	* is standing in that have animations (ie, grass, fire, etc).
1979	* However, it also causes the look window to be re-drawn	1047	* However, it also causes the look window to be re-drawn
1980	* 3 times each time the player moves, because many of the	1048	* 3 times each time the player moves, because many of the
1981	* functions the move_player calls eventualy call this.	1049	* functions the move_player calls eventualy call this.
1982	*	1050	*
1983	* Always put the player down for drawing.	1051	* Always put the player down for drawing.
1984	*/	1052	*/
1985	if (!tmp->invisible)	1053	if (expect_true (!tmp->invisible))
1986	{	1054	{
1987	if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))	1055	if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1988	{
1989	top = tmp->face;
1990	top_obj = tmp;	1056	top = tmp;
1991	}	1057	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1992	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1993	{	1058	{
1994	/* 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,
1995	* so should not be visible, so we clear them.	1060	* so should not be visible, so we clear them.
1996	*/	1061	*/
1997	middle = blank_face;	1062	middle = 0;
1998	top = blank_face;	1063	top = 0;
1999	floor = tmp->face;
2000	floor_obj = tmp;	1064	floor = tmp;
		1065	volume = 0;
		1066	items = 0;
2001	}	1067	}
2002	/* Flag anywhere have high priority */	1068	else
2003	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
2004	{	1069	{
2005	middle = tmp->face;	1070	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1071	{
		1072	++items;
		1073	volume += tmp->volume ();
		1074	}
2006		1075
2007	middle_obj = tmp;	1076	/* Flag anywhere have high priority */
		1077	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
2008	anywhere = 1;	1078	anywhere = tmp;
2009	}	1079
2010	/* Find the highest visible face around. If equal	1080	/* Find the highest visible face around. If equal
2011	* visibilities, we still want the one nearer to the	1081	* visibilities, we still want the one nearer to the
2012	* top	1082	* top
2013	*/	1083	*/
2014	else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))	1084	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
2015	{	1085	{
2016	middle = tmp->face;	1086	middle_visibility = ::faces [tmp->face].visibility;
2017	middle_obj = tmp;	1087	middle = tmp;
		1088	}
2018	}	1089	}
2019	}	1090	}
2020	if (tmp == tmp->above)
2021	{
2022	LOG (llevError, "Error in structure of map\n");
2023	exit (-1);
2024	}
2025		1091
2026	move_slow |= tmp->move_slow;	1092	move_slow |= tmp->move_slow;
2027	move_block |= tmp->move_block;	1093	move_block |= tmp->move_block;
2028	move_on |= tmp->move_on;	1094	move_on |= tmp->move_on;
2029	move_off |= tmp->move_off;	1095	move_off |= tmp->move_off;
2030	move_allow |= tmp->move_allow;	1096	move_allow |= tmp->move_allow;
2031		1097
2032	if (QUERY_FLAG (tmp, FLAG_ALIVE))	1098	allflags |= tmp->flag;
2033	flags |= P_IS_ALIVE;	1099
2034	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC))	1100	if (tmp->type == PLAYER) flags |= P_PLAYER;
2035	flags |= P_NO_MAGIC;
2036	if (QUERY_FLAG (tmp, FLAG_DAMNED))
2037	flags |= P_NO_CLERIC;
2038	if (tmp->type == SAFE_GROUND)	1101	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
2039	flags |= P_SAFE;
2040
2041	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW))
2042	flags |= P_BLOCKSVIEW;
2043	} /* for stack of objects */
2044
2045	/* we don't want to rely on this function to have accurate flags, but
2046	* since we're already doing the work, we calculate them here.
2047	* if they don't match, logic is broken someplace.
2048	*/
2049	if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR)))
2050	{	1102	}
2051	LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n",	1103
2052	m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags);	1104	// FLAG_SEE_ANYWHERE takes precedence
2053	}	1105	if (anywhere)
2054	SET_MAP_FLAGS (m, x, y, flags);	1106	middle = anywhere;
2055	SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow);	1107
2056	SET_MAP_MOVE_ON (m, x, y, move_on);	1108	// ORing all flags together and checking them here is much faster
2057	SET_MAP_MOVE_OFF (m, x, y, move_off);	1109	if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
2058	SET_MAP_MOVE_SLOW (m, x, y, move_slow);	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);
		1115	this->flags_ = flags;
		1116	this->move_block = move_block & ~move_allow;
		1117	this->move_on = move_on;
		1118	this->move_off = move_off;
		1119	this->move_slow = move_slow;
		1120	this->volume_ = (volume + 1023) / 1024;
		1121	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
2059		1122
2060	/* 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),
2061	* 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
2062	* this point.	1125	* this point.
2063	* middle contains the highest visibility face.	1126	* middle contains the highest visibility face.
…		…
2070	* middle face. This should not happen, as we already have the	1133	* middle face. This should not happen, as we already have the
2071	* else statement above so middle should not get set. OTOH, it	1134	* else statement above so middle should not get set. OTOH, it
2072	* 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.
2073	*/	1136	*/
2074	if (top == middle)	1137	if (top == middle)
2075	middle = blank_face;	1138	middle = 0;
2076		1139
2077	/* There are three posibilities at this point:	1140	/* There are three posibilities at this point:
2078	* 1) top face is set, need middle to be set.	1141	* 1) top face is set, need middle to be set.
2079	* 2) middle is set, need to set top.	1142	* 2) middle is set, need to set top.
2080	* 3) neither middle or top is set - need to set both.	1143	* 3) neither middle or top is set - need to set both.
2081	*/	1144	*/
2082		1145
2083	for (tmp = last; tmp; tmp = tmp->below)	1146	for (object *tmp = last; tmp; tmp = tmp->below)
2084	{	1147	{
2085	/* 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 */
2086	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1149	if (tmp->flag [FLAG_IS_FLOOR])
2087	break;	1150	break;
2088		1151
2089	/* If two top faces are already set, quit processing */	1152	/* If two top faces are already set, quit processing */
2090	if ((top != blank_face) && (middle != blank_face))	1153	if (top && middle)
2091	break;	1154	break;
2092		1155
2093	/* Only show visible faces, unless its the editor - show all */	1156	/* Only show visible faces */
2094	if (!tmp->invisible || editor)	1157	if (!tmp->invisible)
2095	{	1158	{
2096	/* Fill in top if needed */	1159	/* Fill in top if needed */
2097	if (top == blank_face)	1160	if (!top)
2098	{	1161	{
2099	top = tmp->face;
2100	top_obj = tmp;	1162	top = tmp;
2101	if (top == middle)	1163	if (top == middle)
2102	middle = blank_face;	1164	middle = 0;
2103	}	1165	}
2104	else	1166	else
2105	{	1167	{
2106	/* top is already set - we should only get here if	1168	/* top is already set - we should only get here if
2107	* middle is not set	1169	* middle is not set
2108	*	1170	*
2109	* Set the middle face and break out, since there is nothing	1171	* Set the middle face and break out, since there is nothing
2110	* more to fill in. We don't check visiblity here, since	1172	* more to fill in. We don't check visiblity here, since
2111	*	1173	*
2112	*/	1174	*/
2113	if (tmp->face != top)	1175	if (tmp != top)
2114	{	1176	{
2115	middle = tmp->face;
2116	middle_obj = tmp;	1177	middle = tmp;
2117	break;	1178	break;
2118	}	1179	}
2119	}	1180	}
2120	}	1181	}
2121	}	1182	}
		1183
2122	if (middle == floor)	1184	if (middle == floor)
2123	middle = blank_face;	1185	middle = 0;
		1186
2124	if (top == middle)	1187	if (top == middle)
2125	middle = blank_face;	1188	middle = 0;
2126	SET_MAP_FACE (m, x, y, top, 0);
2127	if (top != blank_face)
2128	SET_MAP_FACE_OBJ (m, x, y, top_obj, 0);
2129	else
2130	SET_MAP_FACE_OBJ (m, x, y, NULL, 0);
2131	SET_MAP_FACE (m, x, y, middle, 1);
2132	if (middle != blank_face)
2133	SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1);
2134	else
2135	SET_MAP_FACE_OBJ (m, x, y, NULL, 1);
2136	SET_MAP_FACE (m, x, y, floor, 2);
2137	if (floor != blank_face)
2138	SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2);
2139	else
2140	SET_MAP_FACE_OBJ (m, x, y, NULL, 2);
2141	SET_MAP_LIGHT (m, x, y, light);
2142	}
2143		1189
2144		1190	#if 0
2145	void	1191	faces_obj [0] = top;
2146	set_map_reset_time (maptile *map)	1192	faces_obj [1] = middle;
2147	{	1193	faces_obj [2] = floor;
2148	int timeout;	1194	#endif
2149
2150	timeout = MAP_RESET_TIMEOUT (map);
2151	if (timeout <= 0)
2152	timeout = MAP_DEFAULTRESET;
2153	if (timeout >= MAP_MAXRESET)
2154	timeout = MAP_MAXRESET;
2155	MAP_WHEN_RESET (map) = seconds () + timeout;
2156	}	1195	}
2157		1196
2158	/* this updates the orig_map->tile_map[tile_num] value after loading	1197	maptile *
2159	* the map. It also takes care of linking back the freshly loaded	1198	maptile::tile_available (int dir, bool load)
2160	* maps tile_map values if it tiles back to this one. It returns
2161	* the value of orig_map->tile_map[tile_num]. It really only does this
2162	* so that it is easier for calling functions to verify success.
2163	*/
2164
2165	static maptile *
2166	load_and_link_tiled_map (maptile *orig_map, int tile_num)
2167	{	1199	{
2168	int dest_tile = (tile_num + 2) % 4;	1200	if (tile_path[dir])
2169	char *path = path_combine_and_normalize (orig_map->path, orig_map->tile_path[tile_num]);	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];
2170		1205
2171	orig_map->tile_map[tile_num] = ready_map_name (path, 0);	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	}
2172		1210
2173	/* need to do a strcmp here as the orig_map->path is not a shared string */	1211	return 0;
2174	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && !strcmp (orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
2175	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
2176
2177	return orig_map->tile_map[tile_num];
2178	}	1212	}
2179		1213
2180	/* this returns TRUE if the coordinates (x,y) are out of	1214	/* this returns TRUE if the coordinates (x,y) are out of
2181	* map m. This function also takes into account any	1215	* map m. This function also takes into account any
2182	* tiling considerations, loading adjacant maps as needed.	1216	* tiling considerations, loading adjacant maps as needed.
2183	* This is the function should always be used when it	1217	* This is the function should always be used when it
2184	* necessary to check for valid coordinates.	1218	* necessary to check for valid coordinates.
2185	* This function will recursively call itself for the	1219	* This function will recursively call itself for the
2186	* tiled maps.	1220	* tiled maps.
2187	*
2188	*
2189	*/	1221	*/
2190	int	1222	int
2191	out_of_map (maptile *m, int x, int y)	1223	out_of_map (maptile *m, int x, int y)
2192	{	1224	{
2193
2194	/* If we get passed a null map, this is obviously the	1225	/* If we get passed a null map, this is obviously the
2195	* case. This generally shouldn't happen, but if the	1226	* case. This generally shouldn't happen, but if the
2196	* map loads fail below, it could happen.	1227	* map loads fail below, it could happen.
2197	*/	1228	*/
2198	if (!m)	1229	if (!m)
2199	return 0;	1230	return 0;
2200		1231
2201	if (x < 0)	1232	if (x < 0)
2202	{	1233	{
2203	if (!m->tile_path[3])	1234	if (!m->tile_available (3))
2204	return 1;	1235	return 1;
2205	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)	1236
2206	{
2207	load_and_link_tiled_map (m, 3);
2208	}
2209	return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y));	1237	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
2210	}
2211	if (x >= MAP_WIDTH (m))
2212	{	1238	}
2213	if (!m->tile_path[1])	1239
		1240	if (x >= m->width)
		1241	{
		1242	if (!m->tile_available (1))
2214	return 1;	1243	return 1;
2215	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)	1244
2216	{
2217	load_and_link_tiled_map (m, 1);
2218	}
2219	return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y));	1245	return out_of_map (m->tile_map[1], x - m->width, y);
2220	}	1246	}
		1247
2221	if (y < 0)	1248	if (y < 0)
2222	{	1249	{
2223	if (!m->tile_path[0])	1250	if (!m->tile_available (0))
2224	return 1;	1251	return 1;
2225	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)	1252
2226	{
2227	load_and_link_tiled_map (m, 0);
2228	}
2229	return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0])));	1253	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
2230	}
2231	if (y >= MAP_HEIGHT (m))
2232	{	1254	}
2233	if (!m->tile_path[2])	1255
		1256	if (y >= m->height)
		1257	{
		1258	if (!m->tile_available (2))
2234	return 1;	1259	return 1;
2235	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)	1260
2236	{
2237	load_and_link_tiled_map (m, 2);
2238	}
2239	return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m)));	1261	return out_of_map (m->tile_map[2], x, y - m->height);
2240	}	1262	}
2241		1263
2242	/* Simple case - coordinates are within this local	1264	/* Simple case - coordinates are within this local
2243	* map.	1265	* map.
2244	*/	1266	*/
…		…
2247		1269
2248	/* This is basically the same as out_of_map above, but	1270	/* This is basically the same as out_of_map above, but
2249	* instead we return NULL if no map is valid (coordinates	1271	* instead we return NULL if no map is valid (coordinates
2250	* out of bounds and no tiled map), otherwise it returns	1272	* out of bounds and no tiled map), otherwise it returns
2251	* the map as that the coordinates are really on, and	1273	* the map as that the coordinates are really on, and
2252	* updates x and y to be the localized coordinates.	1274	* updates x and y to be the localised coordinates.
2253	* Using this is more efficient of calling out_of_map	1275	* Using this is more efficient of calling out_of_map
2254	* and then figuring out what the real map is	1276	* and then figuring out what the real map is
2255	*/	1277	*/
2256	maptile *	1278	maptile *
2257	get_map_from_coord (maptile *m, sint16 * x, sint16 * y)	1279	maptile::xy_find (sint16 &x, sint16 &y)
2258	{	1280	{
2259
2260	if (*x < 0)	1281	if (x < 0)
2261	{	1282	{
2262	if (!m->tile_path[3])	1283	if (!tile_available (3))
2263	return NULL;	1284	return 0;
2264	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2265	load_and_link_tiled_map (m, 3);
2266		1285
2267	*x += MAP_WIDTH (m->tile_map[3]);	1286	x += tile_map[3]->width;
2268	return (get_map_from_coord (m->tile_map[3], x, y));	1287	return tile_map[3]->xy_find (x, y);
2269	}
2270	if (*x >= MAP_WIDTH (m))
2271	{	1288	}
2272	if (!m->tile_path[1])	1289
		1290	if (x >= width)
		1291	{
		1292	if (!tile_available (1))
2273	return NULL;	1293	return 0;
2274	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2275	load_and_link_tiled_map (m, 1);
2276		1294
2277	*x -= MAP_WIDTH (m);	1295	x -= width;
2278	return (get_map_from_coord (m->tile_map[1], x, y));	1296	return tile_map[1]->xy_find (x, y);
2279	}	1297	}
		1298
2280	if (*y < 0)	1299	if (y < 0)
2281	{	1300	{
2282	if (!m->tile_path[0])	1301	if (!tile_available (0))
2283	return NULL;	1302	return 0;
2284	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2285	load_and_link_tiled_map (m, 0);
2286		1303
2287	*y += MAP_HEIGHT (m->tile_map[0]);	1304	y += tile_map[0]->height;
2288	return (get_map_from_coord (m->tile_map[0], x, y));	1305	return tile_map[0]->xy_find (x, y);
2289	}
2290	if (*y >= MAP_HEIGHT (m))
2291	{	1306	}
2292	if (!m->tile_path[2])	1307
		1308	if (y >= height)
		1309	{
		1310	if (!tile_available (2))
2293	return NULL;	1311	return 0;
2294	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2295	load_and_link_tiled_map (m, 2);
2296		1312
2297	*y -= MAP_HEIGHT (m);	1313	y -= height;
2298	return (get_map_from_coord (m->tile_map[2], x, y));	1314	return tile_map[2]->xy_find (x, y);
2299	}	1315	}
2300		1316
2301	/* Simple case - coordinates are within this local	1317	/* Simple case - coordinates are within this local
2302	* map.	1318	* map.
2303	*/	1319	*/
2304
2305	return m;	1320	return this;
2306	}	1321	}
2307		1322
2308	/**	1323	/**
2309	* 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
2310	* map1 to map2 in dx/dy.	1325	* map1 to map2 in dx/dy.
2311	*/	1326	*/
2312	static int	1327	int
2313	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)	1328	adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
2314	{	1329	{
2315	if (!map1 || !map2)	1330	if (!map1 || !map2)
2316	return 0;	1331	return 0;
2317		1332
		1333	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
		1334	//fix: compare paths instead (this is likely faster, too!)
2318	if (map1 == map2)	1335	if (map1 == map2)
2319	{	1336	{
2320	*dx = 0;	1337	*dx = 0;
2321	*dy = 0;	1338	*dy = 0;
2322		1339	}
		1340	else if (map1->tile_available (TILE_NORTH, false) == map2)
2323	}	1341	{
2324	else if (map1->tile_map[0] == map2)
2325	{ /* up */
2326	*dx = 0;	1342	*dx = 0;
2327	*dy = -MAP_HEIGHT (map2);	1343	*dy = -map2->height;
		1344	}
		1345	else if (map1->tile_available (TILE_EAST , false) == map2)
2328	}	1346	{
2329	else if (map1->tile_map[1] == map2)	1347	*dx = map1->width;
2330	{ /* right */
2331	*dx = MAP_WIDTH (map1);
2332	*dy = 0;	1348	*dy = 0;
2333	}	1349	}
2334	else if (map1->tile_map[2] == map2)	1350	else if (map1->tile_available (TILE_SOUTH, false) == map2)
2335	{ /* down */	1351	{
2336	*dx = 0;	1352	*dx = 0;
2337	*dy = MAP_HEIGHT (map1);	1353	*dy = map1->height;
		1354	}
		1355	else if (map1->tile_available (TILE_WEST , false) == map2)
2338	}	1356	{
2339	else if (map1->tile_map[3] == map2)	1357	*dx = -map2->width;
2340	{ /* left */
2341	*dx = -MAP_WIDTH (map2);
2342	*dy = 0;	1358	*dy = 0;
2343
2344	}	1359	}
2345	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)
2346	{ /* up right */	1361	{ /* up right */
2347	*dx = MAP_WIDTH (map1->tile_map[0]);	1362	*dx = +map1->tile_map[TILE_NORTH]->width;
2348	*dy = -MAP_HEIGHT (map1->tile_map[0]);	1363	*dy = -map1->tile_map[TILE_NORTH]->height;
2349	}	1364	}
2350	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)
2351	{ /* up left */	1366	{ /* up left */
2352	*dx = -MAP_WIDTH (map2);	1367	*dx = -map2->width;
2353	*dy = -MAP_HEIGHT (map1->tile_map[0]);	1368	*dy = -map1->tile_map[TILE_NORTH]->height;
2354	}	1369	}
2355	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)
2356	{ /* right up */	1371	{ /* right up */
2357	*dx = MAP_WIDTH (map1);	1372	*dx = +map1->width;
2358	*dy = -MAP_HEIGHT (map2);	1373	*dy = -map2->height;
2359	}	1374	}
2360	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)
2361	{ /* right down */	1376	{ /* right down */
2362	*dx = MAP_WIDTH (map1);	1377	*dx = +map1->width;
2363	*dy = MAP_HEIGHT (map1->tile_map[1]);	1378	*dy = +map1->tile_map[TILE_EAST]->height;
2364	}	1379	}
2365	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)
2366	{ /* down right */	1381	{ /* down right */
2367	*dx = MAP_WIDTH (map1->tile_map[2]);	1382	*dx = +map1->tile_map[TILE_SOUTH]->width;
2368	*dy = MAP_HEIGHT (map1);	1383	*dy = +map1->height;
2369	}	1384	}
2370	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)
2371	{ /* down left */	1386	{ /* down left */
2372	*dx = -MAP_WIDTH (map2);	1387	*dx = -map2->width;
2373	*dy = MAP_HEIGHT (map1);	1388	*dy = +map1->height;
2374	}	1389	}
2375	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)
2376	{ /* left up */	1391	{ /* left up */
2377	*dx = -MAP_WIDTH (map1->tile_map[3]);	1392	*dx = -map1->tile_map[TILE_WEST]->width;
2378	*dy = -MAP_HEIGHT (map2);	1393	*dy = -map2->height;
2379	}	1394	}
2380	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)
2381	{ /* left down */	1396	{ /* left down */
2382	*dx = -MAP_WIDTH (map1->tile_map[3]);	1397	*dx = -map1->tile_map[TILE_WEST]->width;
2383	*dy = MAP_HEIGHT (map1->tile_map[3]);	1398	*dy = +map1->tile_map[TILE_WEST]->height;
2384
2385	}	1399	}
2386	else	1400	else
2387	{ /* not "adjacent" enough */
2388	return 0;	1401	return 0;
2389	}
2390		1402
2391	return 1;	1403	return 1;
		1404	}
		1405
		1406	maptile *
		1407	maptile::xy_load (sint16 &x, sint16 &y)
		1408	{
		1409	maptile *map = xy_find (x, y);
		1410
		1411	if (map)
		1412	map->load_sync ();
		1413
		1414	return map;
		1415	}
		1416
		1417	maptile *
		1418	get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
		1419	{
		1420	return m->xy_load (*x, *y);
2392	}	1421	}
2393		1422
2394	/* From map.c	1423	/* From map.c
2395	* This is used by get_player to determine where the other	1424	* This is used by get_player to determine where the other
2396	* creature is. get_rangevector takes into account map tiling,	1425	* creature is. get_rangevector takes into account map tiling,
2397	* 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
2398	* righte value. distance_x/y are distance away, which	1427	* righte value. distance_x/y are distance away, which
2399	* can be negativbe. direction is the crossfire direction scheme	1428	* can be negative. direction is the crossfire direction scheme
2400	* that the creature should head. part is the part of the	1429	* that the creature should head. part is the part of the
2401	* monster that is closest.	1430	* monster that is closest.
2402	*	1431	*
2403	* get_rangevector looks at op1 and op2, and fills in the	1432	* get_rangevector looks at op1 and op2, and fills in the
2404	* structure for op1 to get to op2.	1433	* structure for op1 to get to op2.
…		…
2409	* be unexpected	1438	* be unexpected
2410	*	1439	*
2411	* currently, the only flag supported (0x1) is don't translate for	1440	* currently, the only flag supported (0x1) is don't translate for
2412	* closest body part of 'op1'	1441	* closest body part of 'op1'
2413	*/	1442	*/
2414
2415	void	1443	void
2416	get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)	1444	get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
2417	{	1445	{
2418	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))
2419	{	1447	{
2420	/* be conservative and fill in _some_ data */	1448	/* be conservative and fill in _some_ data */
2421	retval->distance = 100000;	1449	retval->distance = 10000;
2422	retval->distance_x = 32767;	1450	retval->distance_x = 10000;
2423	retval->distance_y = 32767;	1451	retval->distance_y = 10000;
2424	retval->direction = 0;	1452	retval->direction = 0;
2425	retval->part = 0;	1453	retval->part = 0;
2426	}	1454	}
2427	else	1455	else
2428	{	1456	{
2429	object *best;
2430
2431	retval->distance_x += op2->x - op1->x;	1457	retval->distance_x += op2->x - op1->x;
2432	retval->distance_y += op2->y - op1->y;	1458	retval->distance_y += op2->y - op1->y;
2433		1459
2434	best = op1;	1460	object *best = op1;
		1461
2435	/* If this is multipart, find the closest part now */	1462	/* If this is multipart, find the closest part now */
2436	if (!(flags & 0x1) && op1->more)	1463	if (!(flags & 1) && op1->more)
2437	{	1464	{
2438	object *tmp;	1465	int best_distance = idistance (retval->distance_x, retval->distance_y);
2439	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
2440		1466
2441	/* 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
2442	* distance instead of doing all that work above again	1468	* distance instead of doing all that work above again
2443	* since the distance fields we set above are positive in the	1469	* since the distance fields we set above are positive in the
2444	* same axis as is used for multipart objects, the simply arithmetic	1470	* same axis as is used for multipart objects, the simply arithmetic
2445	* below works.	1471	* below works.
2446	*/	1472	*/
2447	for (tmp = op1->more; tmp != NULL; tmp = tmp->more)	1473	for (object *tmp = op1->more; tmp; tmp = tmp->more)
2448	{	1474	{
2449	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);
2450	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1476
2451	if (tmpi < best_distance)	1477	if (tmpi < best_distance)
2452	{	1478	{
2453	best_distance = tmpi;	1479	best_distance = tmpi;
2454	best = tmp;	1480	best = tmp;
2455	}	1481	}
2456	}	1482	}
		1483
2457	if (best != op1)	1484	if (best != op1)
2458	{	1485	{
2459	retval->distance_x += op1->x - best->x;	1486	retval->distance_x += op1->x - best->x;
2460	retval->distance_y += op1->y - best->y;	1487	retval->distance_y += op1->y - best->y;
2461	}	1488	}
2462	}	1489	}
		1490
2463	retval->part = best;	1491	retval->part = best;
2464	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));
2465	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1493	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
2466	}	1494	}
2467	}	1495	}
2468		1496
2469	/* 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
2470	* the first parameter being an object, it instead is the map	1498	* the first parameter being an object, it instead is the map
…		…
2474	* 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
2475	* 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
2476	* 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
2477	* field of the rv_vector is set to NULL.	1505	* field of the rv_vector is set to NULL.
2478	*/	1506	*/
2479
2480	void	1507	void
2481	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)
2482	{	1509	{
2483	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))
2484	{	1511	{
2485	/* be conservative and fill in _some_ data */	1512	/* be conservative and fill in _some_ data */
2486	retval->distance = 100000;	1513	retval->distance = 100000;
2487	retval->distance_x = 32767;	1514	retval->distance_x = 32767;
2488	retval->distance_y = 32767;	1515	retval->distance_y = 32767;
2489	retval->direction = 0;	1516	retval->direction = 0;
2490	retval->part = 0;	1517	retval->part = 0;
2491	}	1518	}
2492	else	1519	else
2493	{	1520	{
2494	retval->distance_x += op2->x - x;	1521	retval->distance_x += op2->x - x;
2495	retval->distance_y += op2->y - y;	1522	retval->distance_y += op2->y - y;
2496		1523
2497	retval->part = NULL;	1524	retval->part = 0;
2498	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));
2499	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1526	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
2500	}	1527	}
2501	}	1528	}
2502		1529
2503	/* 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
2504	* (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
2505	* op1 to op2, so if the tiled maps are assymetric and op2 has a path	1532	* op1 to op2, so if the tiled maps are asymetric and op2 has a path
2506	* to op1, this will still return false.	1533	* to op1, this will still return false.
2507	* Note we only look one map out to keep the processing simple	1534	* Note we only look one map out to keep the processing simple
2508	* and efficient. This could probably be a macro.	1535	* and efficient. This could probably be a macro.
2509	* MSW 2001-08-05	1536	* MSW 2001-08-05
2510	*/	1537	*/
…		…
2513	{	1540	{
2514	int dx, dy;	1541	int dx, dy;
2515		1542
2516	return adjacent_map (op1->map, op2->map, &dx, &dy);	1543	return adjacent_map (op1->map, op2->map, &dx, &dy);
2517	}	1544	}
		1545
		1546	//-GPL
		1547
		1548	object *
		1549	maptile::insert (object *op, int x, int y, object *originator, int flags)
		1550	{
		1551	return insert_ob_in_map_at (op, this, originator, flags, x, y);
		1552	}
		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