ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/map.C

Comparing deliantra/server/common/map.C (file contents):
Revision 1.48 by root, Mon Dec 25 14:43:22 2006 UTC vs.
Revision 1.127 by root, Fri Sep 7 18:03:31 2007 UTC

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

Diff Legend

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