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

Diff Legend

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