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.7 by elmex, Mon Aug 21 02:58:22 2006 UTC vs.
Revision 1.70 by root, Thu Jan 4 20:29:45 2007 UTC

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

Diff Legend

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