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

Diff Legend

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