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.38 by pippijn, Mon Dec 11 19:46:46 2006 UTC vs.
Revision 1.207 by root, Thu May 5 18:59:43 2011 UTC

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

Diff Legend

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