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.14 by root, Wed Aug 30 06:06:26 2006 UTC vs.
Revision 1.110 by root, Sun Jul 1 05:00:17 2007 UTC

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

Diff Legend

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