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.43 by root, Thu Dec 14 22:45:40 2006 UTC vs.
Revision 1.104 by root, Fri May 18 00:09:16 2007 UTC

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

Diff Legend

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