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.54 by root, Wed Dec 27 13:13:46 2006 UTC vs.
Revision 1.212 by root, Sat May 7 17:12:27 2011 UTC

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

Diff Legend

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