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.50 by root, Mon Dec 25 15:28:35 2006 UTC vs.
Revision 1.123 by root, Thu Aug 30 07:28:24 2007 UTC

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

Diff Legend

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