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.6 by elmex, Mon Aug 21 02:55:10 2006 UTC vs.
Revision 1.140 by root, Sun May 4 20:40:52 2008 UTC

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

Diff Legend

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