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.48 by root, Mon Dec 25 14:43:22 2006 UTC vs.
Revision 1.100 by root, Tue Apr 17 10:06:32 2007 UTC

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

Diff Legend

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