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.46 by root, Wed Dec 20 11:36:38 2006 UTC vs.
Revision 1.110 by root, Sun Jul 1 05:00:17 2007 UTC

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

Diff Legend

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