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.41 by root, Tue Dec 12 22:37:05 2006 UTC vs.
Revision 1.191 by root, Sun Apr 18 05:57:03 2010 UTC

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

Diff Legend

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