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.31 by root, Sat Sep 16 22:24:12 2006 UTC vs.
Revision 1.54 by root, Wed Dec 27 13:13:46 2006 UTC

…		…
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	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 at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24
25	#include <global.h>	24	#include <global.h>
26	#include <funcpoint.h>	25	#include <funcpoint.h>
27		26
28	#include <loader.h>	27	#include <loader.h>
29	#ifndef WIN32 /* ---win32 exclude header */
30	# include <unistd.h>	28	#include <unistd.h>
31	#endif /* win32 */
32		29
33	#include "path.h"	30	#include "path.h"
34
35
36	extern int nrofallocobjects, nroffreeobjects;
37		31
38	/*	32	/*
39	* Returns the maptile which has a name matching the given argument.	33	* Returns the maptile which has a name matching the given argument.
40	* return NULL if no match is found.	34	* return NULL if no match is found.
41	*/	35	*/
42
43	maptile *	36	maptile *
44	has_been_loaded (const char *name)	37	has_been_loaded (const char *name)
45	{	38	{
46	maptile *map;
47
48	if (!name || !*name)	39	if (!name || !*name)
49	return 0;	40	return 0;
50	for (map = first_map; map; map = map->next)	41
		42	for_all_maps (map)
51	if (!strcmp (name, map->path))	43	if (!strcmp (name, map->path))
52	break;
53	return (map);	44	return map;
		45
		46	return 0;
54	}	47	}
55		48
56	/*	49	/*
57	* This makes a path absolute outside the world of Crossfire.	50	* This makes a path absolute outside the world of Crossfire.
58	* In other words, it prepends LIBDIR/MAPDIR/ to the given path	51	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
…		…
159	int	152	int
160	check_path (const char *name, int prepend_dir)	153	check_path (const char *name, int prepend_dir)
161	{	154	{
162	char buf[MAX_BUF];	155	char buf[MAX_BUF];
163		156
164	#ifndef WIN32
165	char *endbuf;	157	char *endbuf;
166	struct stat statbuf;	158	struct stat statbuf;
167	int mode = 0;	159	int mode = 0;
168	#endif
169		160
170	if (prepend_dir)	161	if (prepend_dir)
171	strcpy (buf, create_pathname (name));	162	strcpy (buf, create_pathname (name));
172	else	163	else
173	strcpy (buf, name);	164	strcpy (buf, name);
174	#ifdef WIN32 /* ***win32: check this sucker in windows style. */
175	return (_access (buf, 0));
176	#else
177		165
178	/* old method (strchr(buf, '\0')) seemd very odd to me -	166	/* old method (strchr(buf, '\0')) seemd very odd to me -
179	* this method should be equivalant and is clearer.	167	* this method should be equivalant and is clearer.
180	* Can not use strcat because we need to cycle through	168	* Can not use strcat because we need to cycle through
181	* all the names.	169	* all the names.
…		…
194	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||	182	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
195	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))	183	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
196	mode |= 2;	184	mode |= 2;
197		185
198	return (mode);	186	return (mode);
199	#endif
200	}	187	}
201		188
202	/*	189	/*
203	* Prints out debug-information about a map.	190	* Prints out debug-information about a map.
204	* Dumping these at llevError doesn't seem right, but is	191	* Dumping these at llevError doesn't seem right, but is
…		…
207		194
208	void	195	void
209	dump_map (const maptile *m)	196	dump_map (const maptile *m)
210	{	197	{
211	LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);	198	LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
212	LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m));	199	LOG (llevError, "Size: %dx%d Start: %d,%d\n", m->width, m->height, m->enter_x, m->enter_y);
213		200
214	if (m->msg != NULL)	201	if (m->msg != NULL)
215	LOG (llevError, "Message:\n%s", m->msg);	202	LOG (llevError, "Message:\n%s", m->msg);
216		203
217	if (m->maplore != NULL)	204	if (m->maplore != NULL)
…		…
231	*/	218	*/
232		219
233	void	220	void
234	dump_all_maps (void)	221	dump_all_maps (void)
235	{	222	{
236	maptile *m;	223	for_all_maps (m)
237
238	for (m = first_map; m != NULL; m = m->next)
239	{
240	dump_map (m);	224	dump_map (m);
241	}
242	}	225	}
243		226
244	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	227	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
245	* one function that just returns a P_.. value (see map.h)	228	* one function that just returns a P_.. value (see map.h)
246	* it will also do map translation for tiled maps, returning	229	* it will also do map translation for tiled maps, returning
…		…
250	* is needed. The case of not passing values is if we're just	233	* is needed. The case of not passing values is if we're just
251	* checking for the existence of something on those spaces, but	234	* checking for the existence of something on those spaces, but
252	* don't expect to insert/remove anything from those spaces.	235	* don't expect to insert/remove anything from those spaces.
253	*/	236	*/
254	int	237	int
255	get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny)	238	get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
256	{	239	{
257	sint16 newx, newy;	240	sint16 newx, newy;
258	int retval = 0;	241	int retval = 0;
259	maptile *mp;	242	maptile *mp;
260		243
261	if (out_of_map (oldmap, x, y))
262	return P_OUT_OF_MAP;
263	newx = x;	244	newx = x;
264	newy = y;	245	newy = y;
		246
265	mp = get_map_from_coord (oldmap, &newx, &newy);	247	mp = get_map_from_coord (oldmap, &newx, &newy);
		248
		249	if (!mp)
		250	return P_OUT_OF_MAP;
		251
266	if (mp != oldmap)	252	if (mp != oldmap)
267	retval |= P_NEW_MAP;	253	retval |= P_NEW_MAP;
268	if (newmap)
269	*newmap = mp;
270	if (nx)
271	*nx = newx;
272	if (ny)
273	*ny = newy;
274		254
275	retval |= mp->spaces[newx + mp->width * newy].flags;	255	if (newmap) *newmap = mp;
		256	if (nx) *nx = newx;
		257	if (ny) *ny = newy;
276		258
277	return retval;	259	return retval | mp->at (newx, newy).flags ();
278	}	260	}
279
280		261
281	/*	262	/*
282	* Returns true if the given coordinate is blocked except by the	263	* Returns true if the given coordinate is blocked except by the
283	* object passed is not blocking. This is used with	264	* object passed is not blocking. This is used with
284	* multipart monsters - if we want to see if a 2x2 monster	265	* multipart monsters - if we want to see if a 2x2 monster
…		…
288	* monster.	269	* monster.
289	* m, x, y are the target map/coordinates - needed for map tiling.	270	* m, x, y are the target map/coordinates - needed for map tiling.
290	* the coordinates & map passed in should have been updated for tiling	271	* the coordinates & map passed in should have been updated for tiling
291	* by the caller.	272	* by the caller.
292	*/	273	*/
293
294	int	274	int
295	blocked_link (object *ob, maptile *m, int sx, int sy)	275	blocked_link (object *ob, maptile *m, int sx, int sy)
296	{	276	{
297	object *tmp;	277	object *tmp;
298	int mflags, blocked;	278	int mflags, blocked;
…		…
307	}	287	}
308		288
309	/* Save some cycles - instead of calling get_map_flags(), just get the value	289	/* Save some cycles - instead of calling get_map_flags(), just get the value
310	* directly.	290	* directly.
311	*/	291	*/
312	mflags = m->spaces[sx + m->width * sy].flags;	292	mflags = m->at (sx, sy).flags ();
313		293
314	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	294	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);
315		295
316	/* If space is currently not blocked by anything, no need to	296	/* If space is currently not blocked by anything, no need to
317	* go further. Not true for players - all sorts of special	297	* go further. Not true for players - all sorts of special
…		…
336	/* We basically go through the stack of objects, and if there is	316	/* We basically go through the stack of objects, and if there is
337	* some other object that has NO_PASS or FLAG_ALIVE set, return	317	* some other object that has NO_PASS or FLAG_ALIVE set, return
338	* true. If we get through the entire stack, that must mean	318	* true. If we get through the entire stack, that must mean
339	* ob is blocking it, so return 0.	319	* ob is blocking it, so return 0.
340	*/	320	*/
341	for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above)	321	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)
342	{	322	{
343		323
344	/* This must be before the checks below. Code for inventory checkers. */	324	/* This must be before the checks below. Code for inventory checkers. */
345	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))	325	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
346	{	326	{
…		…
410	*	390	*
411	* Note this used to be arch_blocked, but with new movement	391	* Note this used to be arch_blocked, but with new movement
412	* code, we need to have actual object to check its move_type	392	* code, we need to have actual object to check its move_type
413	* against the move_block values.	393	* against the move_block values.
414	*/	394	*/
415
416	int	395	int
417	ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)	396	ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
418	{	397	{
419	archetype *tmp;	398	archetype *tmp;
420	int flag;	399	int flag;
…		…
426	flag = get_map_flags (m, &m1, x, y, &sx, &sy);	405	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
427	if (flag & P_OUT_OF_MAP)	406	if (flag & P_OUT_OF_MAP)
428	return P_OUT_OF_MAP;	407	return P_OUT_OF_MAP;
429		408
430	/* don't have object, so don't know what types would block */	409	/* don't have object, so don't know what types would block */
431	return (GET_MAP_MOVE_BLOCK (m1, sx, sy));	410	return m1->at (sx, sy).move_block;
432	}	411	}
433		412
434	for (tmp = ob->arch; tmp != NULL; tmp = tmp->more)	413	for (tmp = ob->arch; tmp; tmp = tmp->more)
435	{	414	{
436	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);	415	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
437		416
438	if (flag & P_OUT_OF_MAP)	417	if (flag & P_OUT_OF_MAP)
439	return P_OUT_OF_MAP;	418	return P_OUT_OF_MAP;
440	if (flag & P_IS_ALIVE)	419	if (flag & P_IS_ALIVE)
441	return P_IS_ALIVE;	420	return P_IS_ALIVE;
442		421
		422	mapspace &ms = m1->at (sx, sy);
		423
		424
443	/* find_first_free_spot() calls this function. However, often	425	/* find_first_free_spot() calls this function. However, often
444	* ob doesn't have any move type (when used to place exits)	426	* ob doesn't have any move type (when used to place exits)
445	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	427	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
446	*/	428	*/
447		429
448	if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL)	430	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)
449	continue;	431	continue;
450		432
451	/* Note it is intentional that we check ob - the movement type of the	433	/* Note it is intentional that we check ob - the movement type of the
452	* head of the object should correspond for the entire object.	434	* head of the object should correspond for the entire object.
453	*/	435	*/
454	if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy)))	436	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
455	return AB_NO_PASS;	437	return P_NO_PASS;
456
457	}	438	}
		439
458	return 0;	440	return 0;
459	}	441	}
460		442
461	/* When the map is loaded, load_object does not actually insert objects	443	/* When the map is loaded, load_object does not actually insert objects
462	* into inventory, but just links them. What this does is go through	444	* into inventory, but just links them. What this does is go through
…		…
489	* for objects whose arch says they are multipart yet according to the	471	* for objects whose arch says they are multipart yet according to the
490	* info we have, they only have the head (as would be expected when	472	* info we have, they only have the head (as would be expected when
491	* they are saved). We do have to look for the old maps that did save	473	* they are saved). We do have to look for the old maps that did save
492	* the more sections and not re-add sections for them.	474	* the more sections and not re-add sections for them.
493	*/	475	*/
494
495	static void	476	static void
496	link_multipart_objects (maptile *m)	477	link_multipart_objects (maptile *m)
497	{	478	{
498	int x, y;	479	int x, y;
499	object *tmp, *op, *last, *above;	480	object *tmp, *op, *last, *above;
500	archetype *at;	481	archetype *at;
501		482
502	for (x = 0; x < MAP_WIDTH (m); x++)	483	for (x = 0; x < m->width; x++)
503	for (y = 0; y < MAP_HEIGHT (m); y++)	484	for (y = 0; y < m->height; y++)
504	for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above)	485	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above)
505	{	486	{
506	above = tmp->above;	487	above = tmp->above;
507		488
508	/* already multipart - don't do anything more */	489	/* already multipart - don't do anything more */
509	if (tmp->head || tmp->more)	490	if (tmp->head || tmp->more)
…		…
544	{	525	{
545	int i, j;	526	int i, j;
546	int unique;	527	int unique;
547	object *op, *prev = NULL, *last_more = NULL, *otmp;	528	object *op, *prev = NULL, *last_more = NULL, *otmp;
548		529
549	op = get_object ();	530	op = object::create ();
550	op->map = m; /* To handle buttons correctly */	531	op->map = m; /* To handle buttons correctly */
551		532
552	while ((i = load_object (fp, op, mapflags)))	533	while ((i = load_object (fp, op, mapflags)))
553	{	534	{
554	/* if the archetype for the object is null, means that we	535	/* if the archetype for the object is null, means that we
…		…
559	{	540	{
560	LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");	541	LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
561	continue;	542	continue;
562	}	543	}
563		544
564
565	switch (i)	545	switch (i)
566	{	546	{
567	case LL_NORMAL:	547	case LL_NORMAL:
568	/* if we are loading an overlay, put the floors on the bottom */	548	/* if we are loading an overlay, put the floors on the bottom */
569	if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)	549	if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
570	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);	550	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
571	else	551	else
572	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);	552	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
573		553
574	if (op->inv)	554	if (op->inv)
575	sum_weight (op);	555	sum_weight (op);
576		556
577	prev = op, last_more = op;	557	prev = op, last_more = op;
578	break;	558	break;
579		559
580	case LL_MORE:	560	case LL_MORE:
581	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);	561	insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);
582	op->head = prev, last_more->more = op, last_more = op;	562	op->head = prev, last_more->more = op, last_more = op;
583	break;	563	break;
584	}	564	}
585		565
586	if (mapflags & MAP_STYLE)	566	if (mapflags & MAP_STYLE)
587	remove_from_active_list (op);	567	remove_from_active_list (op);
588		568
589	op = get_object ();	569	op = object::create ();
590	op->map = m;	570	op->map = m;
591	}	571	}
592		572
593	for (i = 0; i < m->width; i++)	573	for (i = 0; i < m->width; i++)
594	{	574	{
595	for (j = 0; j < m->height; j++)	575	for (j = 0; j < m->height; j++)
596	{	576	{
597	unique = 0;	577	unique = 0;
598	/* check for unique items, or unique squares */	578	/* check for unique items, or unique squares */
599	for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above)	579	for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
600	{	580	{
601	if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))	581	if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
602	unique = 1;	582	unique = 1;
		583
603	if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))	584	if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
604	SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);	585	SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
605	}	586	}
606	}	587	}
607	}	588	}
608		589
609	free_object (op);	590	op->destroy ();
610	link_multipart_objects (m);	591	link_multipart_objects (m);
611	}	592	}
612		593
613	/* This saves all the objects on the map in a non destructive fashion.	594	/* This saves all the objects on the map in a non destructive fashion.
614	* Modified by MSW 2001-07-01 to do in a single pass - reduces code,	595	* Modified by MSW 2001-07-01 to do in a single pass - reduces code,
615	* and we only save the head of multi part objects - this is needed	596	* and we only save the head of multi part objects - this is needed
616	* in order to do map tiling properly.	597	* in order to do map tiling properly.
617	*/	598	*/
618	void	599	void
619	save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag)	600	save_objects (maptile *m, object_freezer &fp, object_freezer &fp2, int flag)
620	{	601	{
621	int i, j = 0, unique = 0;	602	int i, j = 0, unique = 0;
622	object *op;	603	object *op;
623		604
624	/* first pass - save one-part objects */	605	/* first pass - save one-part objects */
625	for (i = 0; i < MAP_WIDTH (m); i++)	606	for (i = 0; i < m->width; i++)
626	for (j = 0; j < MAP_HEIGHT (m); j++)	607	for (j = 0; j < m->height; j++)
627	{	608	{
628	unique = 0;	609	unique = 0;
		610
629	for (op = get_map_ob (m, i, j); op; op = op->above)	611	for (op = m->at (i, j).bot; op; op = op->above)
630	{	612	{
631	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	613	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
632	unique = 1;	614	unique = 1;
633		615
634	if (op->type == PLAYER)	616	if (!op->can_map_save ())
635	{
636	LOG (llevDebug, "Player on map that is being saved\n");
637	continue;
638	}
639
640	if (op->head || op->owner)
641	continue;	617	continue;
642		618
643	if (unique || QUERY_FLAG (op, FLAG_UNIQUE))	619	if (unique || op->flag [FLAG_UNIQUE])
644	save_object (fp2, op, 3);	620	save_object (fp2, op, 1);
645	else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID))))	621	else if (flag == 0 || (flag == 2 && (!op->flag [FLAG_OBJ_ORIGINAL] && !op->flag [FLAG_UNPAID])))
646	save_object (fp, op, 3);	622	save_object (fp, op, 1);
		623	}
		624	}
		625	}
647		626
648	} /* for this space */	627	maptile::maptile ()
649	} /* for this j */	628	{
		629	in_memory = MAP_SWAPPED;
		630
		631	/* The maps used to pick up default x and y values from the
		632	* map archetype. Mimic that behaviour.
		633	*/
		634	width = 16;
		635	height = 16;
		636	reset_timeout = 0;
		637	timeout = 300;
		638	enter_x = 0;
		639	enter_y = 0;
		640	/*set part to -1 indicating conversion to weather map not yet done */
		641	worldpartx = -1;
		642	worldparty = -1;
		643	}
		644
		645	void
		646	maptile::link ()
		647	{
		648	next = first_map;
		649	first_map = this;
		650	}
		651
		652	void
		653	maptile::unlink ()
		654	{
		655	if (first_map == this)
		656	first_map = next;
		657	else
		658	for_all_maps (m)
		659	if (m->next = this)
		660	{
		661	m->next = next;
		662	break;
		663	}
650	}	664	}
651		665
652	/*	666	/*
653	* Allocates, initialises, and returns a pointer to a maptile.	667	* Allocates, initialises, and returns a pointer to a maptile.
654	* Modified to no longer take a path option which was not being	668	* Modified to no longer take a path option which was not being
655	* used anyways. MSW 2001-07-01	669	* used anyways. MSW 2001-07-01
656	*/	670	*/
657
658	maptile *	671	maptile *
659	get_linked_map (void)	672	get_linked_map (void)
660	{	673	{
661	maptile *map = new maptile;	674	maptile *map = new maptile;
662	maptile *mp;	675	map->link ();
663
664	for (mp = first_map; mp != NULL && mp->next != NULL; mp = mp->next);
665	if (mp == NULL)
666	first_map = map;
667	else
668	mp->next = map;
669
670	map->in_memory = MAP_SWAPPED;
671	/* The maps used to pick up default x and y values from the
672	* map archetype. Mimic that behaviour.
673	*/
674	MAP_WIDTH (map) = 16;
675	MAP_HEIGHT (map) = 16;
676	MAP_RESET_TIMEOUT (map) = 0;
677	MAP_TIMEOUT (map) = 300;
678	MAP_ENTER_X (map) = 0;
679	MAP_ENTER_Y (map) = 0;
680	/*set part to -1 indicating conversion to weather map not yet done */
681	MAP_WORLDPARTX (map) = -1;
682	MAP_WORLDPARTY (map) = -1;
683	return map;	676	return map;
684	}	677	}
685		678
686	/*	679	/*
687	* Allocates the arrays contained in a maptile.	680	* Allocates the arrays contained in a maptile.
688	* This basically allocates the dynamic array of spaces for the	681	* This basically allocates the dynamic array of spaces for the
689	* map.	682	* map.
690	*/	683	*/
691
692	void	684	void
693	allocate_map (maptile *m)	685	maptile::allocate ()
694	{	686	{
695	m->in_memory = MAP_IN_MEMORY;	687	in_memory = MAP_IN_MEMORY;
		688
696	/* Log this condition and free the storage. We could I suppose	689	/* Log this condition and free the storage. We could I suppose
697	* realloc, but if the caller is presuming the data will be intact,	690	* realloc, but if the caller is presuming the data will be intact,
698	* that is their poor assumption.	691	* that is their poor assumption.
699	*/	692	*/
700	if (m->spaces)	693	if (spaces)
701	{	694	{
702	LOG (llevError, "allocate_map called with already allocated map (%s)\n", m->path);	695	LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
703	free (m->spaces);	696	sfree (spaces, size ());
704	}	697	}
705		698
706	m->spaces = (MapSpace *) calloc (1, MAP_WIDTH (m) * MAP_HEIGHT (m) * sizeof (MapSpace));	699	spaces = salloc0<mapspace> (size ());
707
708	if (m->spaces == NULL)
709	fatal (OUT_OF_MEMORY);
710	}	700	}
711		701
712	/* Create and returns a map of the specific size. Used	702	/* Create and returns a map of the specific size. Used
713	* in random map code and the editor.	703	* in random map code and the editor.
714	*/	704	*/
…		…
718	maptile *m = get_linked_map ();	708	maptile *m = get_linked_map ();
719		709
720	m->width = sizex;	710	m->width = sizex;
721	m->height = sizey;	711	m->height = sizey;
722	m->in_memory = MAP_SWAPPED;	712	m->in_memory = MAP_SWAPPED;
723	allocate_map (m);	713	m->allocate ();
		714
724	return m;	715	return m;
725	}	716	}
726		717
727	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	718	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
728	* corresponding to that string. Memory is allocated for this, it must be freed	719	* corresponding to that string. Memory is allocated for this, it must be freed
…		…
736	char *shop_string, *p, *q, *next_semicolon, *next_colon;	727	char *shop_string, *p, *q, *next_semicolon, *next_colon;
737	shopitems *items = NULL;	728	shopitems *items = NULL;
738	int i = 0, number_of_entries = 0;	729	int i = 0, number_of_entries = 0;
739	const typedata *current_type;	730	const typedata *current_type;
740		731
741	shop_string = strdup_local (input_string);	732	shop_string = strdup (input_string);
742	p = shop_string;	733	p = shop_string;
743	/* first we'll count the entries, we'll need that for allocating the array shortly */	734	/* first we'll count the entries, we'll need that for allocating the array shortly */
744	while (p)	735	while (p)
745	{	736	{
746	p = strchr (p, ';');	737	p = strchr (p, ';');
747	number_of_entries++;	738	number_of_entries++;
748	if (p)	739	if (p)
749	p++;	740	p++;
750	}	741	}
		742
751	p = shop_string;	743	p = shop_string;
752	strip_endline (p);	744	strip_endline (p);
753	items = new shopitems[number_of_entries + 1];	745	items = new shopitems[number_of_entries + 1];
754	for (i = 0; i < number_of_entries; i++)	746	for (i = 0; i < number_of_entries; i++)
755	{	747	{
756	if (!p)	748	if (!p)
757	{	749	{
758	LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");	750	LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
759	break;	751	break;
760	}	752	}
		753
761	next_semicolon = strchr (p, ';');	754	next_semicolon = strchr (p, ';');
762	next_colon = strchr (p, ':');	755	next_colon = strchr (p, ':');
763	/* if there is a stregth specified, figure out what it is, we'll need it soon. */	756	/* if there is a stregth specified, figure out what it is, we'll need it soon. */
764	if (next_colon && (!next_semicolon || next_colon < next_semicolon))	757	if (next_colon && (!next_semicolon || next_colon < next_semicolon))
765	items[i].strength = atoi (strchr (p, ':') + 1);	758	items[i].strength = atoi (strchr (p, ':') + 1);
…		…
792	* the next entry while we're at it, better print a warning	785	* the next entry while we're at it, better print a warning
793	*/	786	*/
794	LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);	787	LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
795	}	788	}
796	}	789	}
		790
797	items[i].index = number_of_entries;	791	items[i].index = number_of_entries;
798	if (next_semicolon)	792	if (next_semicolon)
799	p = ++next_semicolon;	793	p = ++next_semicolon;
800	else	794	else
801	p = NULL;	795	p = NULL;
802	}	796	}
		797
803	free (shop_string);	798	free (shop_string);
804	return items;	799	return items;
805	}	800	}
806		801
807	/* opposite of parse string, this puts the string that was originally fed in to	802	/* opposite of parse string, this puts the string that was originally fed in to
…		…
816	for (i = 0; i < m->shopitems[0].index; i++)	811	for (i = 0; i < m->shopitems[0].index; i++)
817	{	812	{
818	if (m->shopitems[i].typenum)	813	if (m->shopitems[i].typenum)
819	{	814	{
820	if (m->shopitems[i].strength)	815	if (m->shopitems[i].strength)
821	{
822	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	816	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
823	}
824	else	817	else
825	sprintf (tmp, "%s;", m->shopitems[i].name);	818	sprintf (tmp, "%s;", m->shopitems[i].name);
826	}	819	}
827	else	820	else
828	{	821	{
829	if (m->shopitems[i].strength)	822	if (m->shopitems[i].strength)
830	{
831	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	823	sprintf (tmp, "*:%d;", m->shopitems[i].strength);
832	}
833	else	824	else
834	sprintf (tmp, "*");	825	sprintf (tmp, "*");
835	}	826	}
		827
836	strcat (output_string, tmp);	828	strcat (output_string, tmp);
837	}	829	}
838	}	830	}
839		831
840	/* This loads the header information of the map. The header	832	/* This loads the header information of the map. The header
…		…
855	{	847	{
856	char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;	848	char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
857	int msgpos = 0;	849	int msgpos = 0;
858	int maplorepos = 0;	850	int maplorepos = 0;
859		851
860	while (fgets (buf, HUGE_BUF - 1, fp) != NULL)	852	while (fgets (buf, HUGE_BUF, fp) != NULL)
861	{	853	{
862	buf[HUGE_BUF - 1] = 0;	854	buf[HUGE_BUF - 1] = 0;
863	key = buf;	855	key = buf;
		856
864	while (isspace (*key))	857	while (isspace (*key))
865	key++;	858	key++;
		859
866	if (*key == 0)	860	if (*key == 0)
867	continue; /* empty line */	861	continue; /* empty line */
		862
868	value = strchr (key, ' ');	863	value = strchr (key, ' ');
		864
869	if (!value)	865	if (!value)
870	{	866	{
871	end = strchr (key, '\n');	867	if ((end = strchr (key, '\n')))
872	if (end != NULL)
873	{
874	*end = 0;	868	*end = 0;
875	}
876	}	869	}
877	else	870	else
878	{	871	{
879	*value = 0;	872	*value = 0;
880	value++;	873	value++;
881	end = strchr (value, '\n');	874	end = strchr (value, '\n');
		875
882	while (isspace (*value))	876	while (isspace (*value))
883	{	877	{
884	value++;	878	value++;
		879
885	if (*value == '\0' || value == end)	880	if (*value == '\0' || value == end)
886	{	881	{
887	/* Nothing but spaces. */	882	/* Nothing but spaces. */
888	value = NULL;	883	value = NULL;
889	break;	884	break;
…		…
912	* that use the parameter.	907	* that use the parameter.
913	*/	908	*/
914		909
915	if (!strcmp (key, "msg"))	910	if (!strcmp (key, "msg"))
916	{	911	{
917	while (fgets (buf, HUGE_BUF - 1, fp) != NULL)	912	while (fgets (buf, HUGE_BUF, fp) != NULL)
918	{	913	{
919	if (!strcmp (buf, "endmsg\n"))	914	if (!strcmp (buf, "endmsg\n"))
920	break;	915	break;
921	else	916	else
922	{	917	{
…		…
929	* with nothing between). There is no reason in those cases to	924	* with nothing between). There is no reason in those cases to
930	* keep the empty message. Also, msgbuf contains garbage data	925	* keep the empty message. Also, msgbuf contains garbage data
931	* when msgpos is zero, so copying it results in crashes	926	* when msgpos is zero, so copying it results in crashes
932	*/	927	*/
933	if (msgpos != 0)	928	if (msgpos != 0)
934	m->msg = strdup_local (msgbuf);	929	m->msg = strdup (msgbuf);
935	}	930	}
936	else if (!strcmp (key, "maplore"))	931	else if (!strcmp (key, "maplore"))
937	{	932	{
938	while (fgets (buf, HUGE_BUF - 1, fp) != NULL)	933	while (fgets (buf, HUGE_BUF, fp) != NULL)
939	{	934	{
940	if (!strcmp (buf, "endmaplore\n"))	935	if (!strcmp (buf, "endmaplore\n"))
941	break;	936	break;
942	else	937	else
943	{	938	{
…		…
945	strcpy (maplorebuf + maplorepos, buf);	940	strcpy (maplorebuf + maplorepos, buf);
946	maplorepos += strlen (buf);	941	maplorepos += strlen (buf);
947	}	942	}
948	}	943	}
949	if (maplorepos != 0)	944	if (maplorepos != 0)
950	m->maplore = strdup_local (maplorebuf);	945	m->maplore = strdup (maplorebuf);
951	}	946	}
952	else if (!strcmp (key, "end"))	947	else if (!strcmp (key, "end"))
953	{	948	{
954	break;	949	break;
955	}	950	}
…		…
964	LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);	959	LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
965	}	960	}
966	else if (!strcmp (key, "name"))	961	else if (!strcmp (key, "name"))
967	{	962	{
968	*end = 0;	963	*end = 0;
969	m->name = strdup_local (value);	964	m->name = strdup (value);
970	}	965	}
971	/* first strcmp value on these are old names supported	966	/* first strcmp value on these are old names supported
972	* for compatibility reasons. The new values (second) are	967	* for compatibility reasons. The new values (second) are
973	* what really should be used.	968	* what really should be used.
974	*/	969	*/
975	else if (!strcmp (key, "oid"))	970	else if (!strcmp (key, "oid"))
976	{
977	fp.get (m, atoi (value));	971	fp.get (m, atoi (value));
978	}
979	else if (!strcmp (key, "attach"))	972	else if (!strcmp (key, "attach"))
980	{
981	m->attach = value;	973	m->attach = value;
982	}
983	else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))	974	else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
984	{
985	m->enter_x = atoi (value);	975	m->enter_x = atoi (value);
986	}
987	else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))	976	else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
988	{
989	m->enter_y = atoi (value);	977	m->enter_y = atoi (value);
990	}
991	else if (!strcmp (key, "x") || !strcmp (key, "width"))	978	else if (!strcmp (key, "x") || !strcmp (key, "width"))
992	{
993	m->width = atoi (value);	979	m->width = atoi (value);
994	}
995	else if (!strcmp (key, "y") || !strcmp (key, "height"))	980	else if (!strcmp (key, "y") || !strcmp (key, "height"))
996	{
997	m->height = atoi (value);	981	m->height = atoi (value);
998	}
999	else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))	982	else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
1000	{
1001	m->reset_timeout = atoi (value);	983	m->reset_timeout = atoi (value);
1002	}
1003	else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))	984	else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
1004	{
1005	m->timeout = atoi (value);	985	m->timeout = atoi (value);
1006	}
1007	else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))	986	else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
1008	{	987	m->difficulty = clamp (atoi (value), 1, settings.max_level);
1009	m->difficulty = atoi (value);
1010	}
1011	else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))	988	else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
1012	{
1013	m->darkness = atoi (value);	989	m->darkness = atoi (value);
1014	}
1015	else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))	990	else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
1016	{
1017	m->fixed_resettime = atoi (value);	991	m->fixed_resettime = atoi (value);
1018	}
1019	else if (!strcmp (key, "unique"))	992	else if (!strcmp (key, "unique"))
1020	{
1021	m->unique = atoi (value);	993	m->unique = atoi (value);
1022	}
1023	else if (!strcmp (key, "template"))	994	else if (!strcmp (key, "template"))
1024	{
1025	m->templatemap = atoi (value);	995	m->templatemap = atoi (value);
1026	}
1027	else if (!strcmp (key, "region"))	996	else if (!strcmp (key, "region"))
1028	{
1029	m->region = get_region_by_name (value);	997	m->region = get_region_by_name (value);
1030	}
1031	else if (!strcmp (key, "shopitems"))	998	else if (!strcmp (key, "shopitems"))
1032	{	999	{
1033	*end = 0;	1000	*end = 0;
1034	m->shopitems = parse_shop_string (value);	1001	m->shopitems = parse_shop_string (value);
1035	}	1002	}
1036	else if (!strcmp (key, "shopgreed"))	1003	else if (!strcmp (key, "shopgreed"))
1037	{
1038	m->shopgreed = atof (value);	1004	m->shopgreed = atof (value);
1039	}
1040	else if (!strcmp (key, "shopmin"))	1005	else if (!strcmp (key, "shopmin"))
1041	{
1042	m->shopmin = atol (value);	1006	m->shopmin = atol (value);
1043	}
1044	else if (!strcmp (key, "shopmax"))	1007	else if (!strcmp (key, "shopmax"))
1045	{
1046	m->shopmax = atol (value);	1008	m->shopmax = atol (value);
1047	}
1048	else if (!strcmp (key, "shoprace"))	1009	else if (!strcmp (key, "shoprace"))
1049	{	1010	{
1050	*end = 0;	1011	*end = 0;
1051	m->shoprace = strdup_local (value);	1012	m->shoprace = strdup (value);
1052	}	1013	}
1053	else if (!strcmp (key, "outdoor"))	1014	else if (!strcmp (key, "outdoor"))
1054	{
1055	m->outdoor = atoi (value);	1015	m->outdoor = atoi (value);
1056	}
1057	else if (!strcmp (key, "temp"))	1016	else if (!strcmp (key, "temp"))
1058	{
1059	m->temp = atoi (value);	1017	m->temp = atoi (value);
1060	}
1061	else if (!strcmp (key, "pressure"))	1018	else if (!strcmp (key, "pressure"))
1062	{
1063	m->pressure = atoi (value);	1019	m->pressure = atoi (value);
1064	}
1065	else if (!strcmp (key, "humid"))	1020	else if (!strcmp (key, "humid"))
1066	{
1067	m->humid = atoi (value);	1021	m->humid = atoi (value);
1068	}
1069	else if (!strcmp (key, "windspeed"))	1022	else if (!strcmp (key, "windspeed"))
1070	{
1071	m->windspeed = atoi (value);	1023	m->windspeed = atoi (value);
1072	}
1073	else if (!strcmp (key, "winddir"))	1024	else if (!strcmp (key, "winddir"))
1074	{
1075	m->winddir = atoi (value);	1025	m->winddir = atoi (value);
1076	}
1077	else if (!strcmp (key, "sky"))	1026	else if (!strcmp (key, "sky"))
1078	{
1079	m->sky = atoi (value);	1027	m->sky = atoi (value);
1080	}
1081	else if (!strcmp (key, "nosmooth"))	1028	else if (!strcmp (key, "nosmooth"))
1082	{
1083	m->nosmooth = atoi (value);	1029	m->nosmooth = atoi (value);
1084	}
1085	else if (!strncmp (key, "tile_path_", 10))	1030	else if (!strncmp (key, "tile_path_", 10))
1086	{	1031	{
1087	int tile = atoi (key + 10);	1032	int tile = atoi (key + 10);
1088		1033
1089	if (tile < 1 || tile > 4)	1034	if (tile < 1 || tile > 4)
…		…
1122	}	1067	}
1123		1068
1124	if (editor)	1069	if (editor)
1125	{	1070	{
1126	/* Use the value as in the file. */	1071	/* Use the value as in the file. */
1127	m->tile_path[tile - 1] = strdup_local (value);	1072	m->tile_path[tile - 1] = strdup (value);
1128	}	1073	}
1129	else if (path != NULL)	1074	else if (path != NULL)
1130	{	1075	{
1131	/* Use the normalized value. */	1076	/* Use the normalized value. */
1132	m->tile_path[tile - 1] = strdup_local (path);	1077	m->tile_path[tile - 1] = strdup (path);
1133	}	1078	}
1134	} /* end if tile direction (in)valid */	1079	} /* end if tile direction (in)valid */
1135	}	1080	}
1136	else	1081	else
1137	{
1138	LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);	1082	LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
1139	}
1140	}	1083	}
		1084
1141	if (!key || strcmp (key, "end"))	1085	if (!key || strcmp (key, "end"))
1142	{	1086	{
1143	LOG (llevError, "Got premature eof on map header!\n");	1087	LOG (llevError, "Got premature eof on map header!\n");
1144	return 1;	1088	return 1;
1145	}	1089	}
		1090
1146	return 0;	1091	return 0;
1147	}	1092	}
1148		1093
1149	/*	1094	/*
1150	* Opens the file "filename" and reads information about the map	1095	* Opens the file "filename" and reads information about the map
…		…
1155	* MAP_BLOCK, in which case we block on this load. This happens in all	1100	* MAP_BLOCK, in which case we block on this load. This happens in all
1156	* cases, no matter if this flag is set or not.	1101	* cases, no matter if this flag is set or not.
1157	* MAP_STYLE: style map - don't add active objects, don't add to server	1102	* MAP_STYLE: style map - don't add active objects, don't add to server
1158	* managed map list.	1103	* managed map list.
1159	*/	1104	*/
1160
1161	maptile *	1105	maptile *
1162	load_original_map (const char *filename, int flags)	1106	load_original_map (const char *filename, int flags)
1163	{	1107	{
1164	maptile *m;	1108	maptile *m;
1165	char pathname[MAX_BUF];	1109	char pathname[MAX_BUF];
…		…
1183	strcpy (m->path, filename);	1127	strcpy (m->path, filename);
1184	if (load_map_header (thawer, m))	1128	if (load_map_header (thawer, m))
1185	{	1129	{
1186	LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);	1130	LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1187	delete_map (m);	1131	delete_map (m);
1188	return NULL;	1132	return 0;
1189	}	1133	}
1190		1134
1191	allocate_map (m);	1135	m->allocate ();
1192		1136
1193	m->in_memory = MAP_LOADING;	1137	m->in_memory = MAP_LOADING;
1194	load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));	1138	load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1195		1139
1196	m->in_memory = MAP_IN_MEMORY;	1140	m->in_memory = MAP_IN_MEMORY;
1197	if (!MAP_DIFFICULTY (m))	1141	if (!m->difficulty)
1198	MAP_DIFFICULTY (m) = calculate_difficulty (m);	1142	m->difficulty = calculate_difficulty (m);
1199	set_map_reset_time (m);	1143	set_map_reset_time (m);
1200	m->instantiate ();	1144	m->instantiate ();
1201	return (m);	1145	return (m);
1202	}	1146	}
1203		1147
1204	/*	1148	/*
1205	* Loads a map, which has been loaded earlier, from file.	1149	* Loads a map, which has been loaded earlier, from file.
1206	* Return the map object we load into (this can change from the passed	1150	* Return the map object we load into (this can change from the passed
1207	* option if we can't find the original map)	1151	* option if we can't find the original map)
1208	*/	1152	*/
1209
1210	static maptile *	1153	static maptile *
1211	load_temporary_map (maptile *m)	1154	load_temporary_map (maptile *m)
1212	{	1155	{
1213	char buf[MAX_BUF];	1156	char buf[MAX_BUF];
1214		1157
…		…
1242	LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);	1185	LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);
1243	delete_map (m);	1186	delete_map (m);
1244	m = load_original_map (m->path, 0);	1187	m = load_original_map (m->path, 0);
1245	return NULL;	1188	return NULL;
1246	}	1189	}
		1190
1247	allocate_map (m);	1191	m->allocate ();
1248		1192
1249	m->in_memory = MAP_LOADING;	1193	m->in_memory = MAP_LOADING;
1250	load_objects (m, thawer, 0);	1194	load_objects (m, thawer, 0);
1251		1195
1252	m->in_memory = MAP_IN_MEMORY;	1196	m->in_memory = MAP_IN_MEMORY;
…		…
1257	/*	1201	/*
1258	* Loads a map, which has been loaded earlier, from file.	1202	* Loads a map, which has been loaded earlier, from file.
1259	* Return the map object we load into (this can change from the passed	1203	* Return the map object we load into (this can change from the passed
1260	* option if we can't find the original map)	1204	* option if we can't find the original map)
1261	*/	1205	*/
1262
1263	maptile *	1206	maptile *
1264	load_overlay_map (const char *filename, maptile *m)	1207	load_overlay_map (const char *filename, maptile *m)
1265	{	1208	{
1266	char pathname[MAX_BUF];	1209	char pathname[MAX_BUF];
1267		1210
…		…
1275	if (load_map_header (thawer, m))	1218	if (load_map_header (thawer, m))
1276	{	1219	{
1277	LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);	1220	LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1278	delete_map (m);	1221	delete_map (m);
1279	m = load_original_map (m->path, 0);	1222	m = load_original_map (m->path, 0);
1280	return NULL;	1223	return 0;
1281	}	1224	}
1282	/*allocate_map(m); */	1225	/*m->allocate ();*/
1283		1226
1284	m->in_memory = MAP_LOADING;	1227	m->in_memory = MAP_LOADING;
1285	load_objects (m, thawer, MAP_OVERLAY);	1228	load_objects (m, thawer, MAP_OVERLAY);
1286		1229
1287	m->in_memory = MAP_IN_MEMORY;	1230	m->in_memory = MAP_IN_MEMORY;
…		…
1297	delete_unique_items (maptile *m)	1240	delete_unique_items (maptile *m)
1298	{	1241	{
1299	int i, j, unique;	1242	int i, j, unique;
1300	object *op, *next;	1243	object *op, *next;
1301		1244
1302	for (i = 0; i < MAP_WIDTH (m); i++)	1245	for (i = 0; i < m->width; i++)
1303	for (j = 0; j < MAP_HEIGHT (m); j++)	1246	for (j = 0; j < m->height; j++)
1304	{	1247	{
1305	unique = 0;	1248	unique = 0;
		1249
1306	for (op = get_map_ob (m, i, j); op; op = next)	1250	for (op = GET_MAP_OB (m, i, j); op; op = next)
1307	{	1251	{
1308	next = op->above;	1252	next = op->above;
		1253
1309	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	1254	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1310	unique = 1;	1255	unique = 1;
		1256
1311	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))	1257	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1312	{	1258	{
1313	clean_object (op);	1259	op->destroy_inv (false);
1314	if (QUERY_FLAG (op, FLAG_IS_LINKED))	1260	op->destroy ();
1315	remove_button_link (op);
1316	remove_ob (op);
1317	free_object (op);
1318	}	1261	}
1319	}	1262	}
1320	}	1263	}
1321	}	1264	}
1322		1265
1323
1324	/*	1266	/*
1325	* Loads unique objects from file(s) into the map which is in memory	1267	* Loads unique objects from file(s) into the map which is in memory
1326	* m is the map to load unique items into.	1268	* m is the map to load unique items into.
1327	*/	1269	*/
1328	static void	1270	static void
…		…
1347	return;	1289	return;
1348		1290
1349	m->in_memory = MAP_LOADING;	1291	m->in_memory = MAP_LOADING;
1350	if (m->tmpname == NULL) /* if we have loaded unique items from */	1292	if (m->tmpname == NULL) /* if we have loaded unique items from */
1351	delete_unique_items (m); /* original map before, don't duplicate them */	1293	delete_unique_items (m); /* original map before, don't duplicate them */
		1294
1352	load_objects (m, thawer, 0);	1295	load_objects (m, thawer, 0);
1353		1296
1354	m->in_memory = MAP_IN_MEMORY;	1297	m->in_memory = MAP_IN_MEMORY;
1355	}	1298	}
1356
1357		1299
1358	/*	1300	/*
1359	* Saves a map to file. If flag is set, it is saved into the same	1301	* Saves a map to file. If flag is set, it is saved into the same
1360	* file it was (originally) loaded from. Otherwise a temporary	1302	* file it was (originally) loaded from. Otherwise a temporary
1361	* filename will be genarated, and the file will be stored there.	1303	* filename will be genarated, and the file will be stored there.
1362	* The temporary filename will be stored in the maptileure.	1304	* The temporary filename will be stored in the maptileure.
1363	* If the map is unique, we also save to the filename in the map	1305	* If the map is unique, we also save to the filename in the map
1364	* (this should have been updated when first loaded)	1306	* (this should have been updated when first loaded)
1365	*/	1307	*/
1366
1367	int	1308	int
1368	new_save_map (maptile *m, int flag)	1309	new_save_map (maptile *m, int flag)
1369	{	1310	{
1370	char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];	1311	char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1371	int i;	1312	int i;
…		…
1391	make_path_to_file (filename);	1332	make_path_to_file (filename);
1392	}	1333	}
1393	else	1334	else
1394	{	1335	{
1395	if (!m->tmpname)	1336	if (!m->tmpname)
1396	m->tmpname = tempnam_local (settings.tmpdir, NULL);	1337	m->tmpname = tempnam (settings.tmpdir, NULL);
1397		1338
1398	strcpy (filename, m->tmpname);	1339	strcpy (filename, m->tmpname);
1399	}	1340	}
1400		1341
1401	LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);	1342	LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
…		…
1425	print_shop_string (m, shop);	1366	print_shop_string (m, shop);
1426	fprintf (freezer, "shopitems %s\n", shop);	1367	fprintf (freezer, "shopitems %s\n", shop);
1427	}	1368	}
1428	if (m->shopgreed)	1369	if (m->shopgreed)
1429	fprintf (freezer, "shopgreed %f\n", m->shopgreed);	1370	fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1430	#ifndef WIN32
1431	if (m->shopmin)	1371	if (m->shopmin)
1432	fprintf (freezer, "shopmin %llu\n", m->shopmin);	1372	fprintf (freezer, "shopmin %llu\n", m->shopmin);
1433	if (m->shopmax)	1373	if (m->shopmax)
1434	fprintf (freezer, "shopmax %llu\n", m->shopmax);	1374	fprintf (freezer, "shopmax %llu\n", m->shopmax);
1435	#else
1436	if (m->shopmin)
1437	fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1438	if (m->shopmax)
1439	fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1440	#endif
1441	if (m->shoprace)	1375	if (m->shoprace)
1442	fprintf (freezer, "shoprace %s\n", m->shoprace);	1376	fprintf (freezer, "shoprace %s\n", m->shoprace);
1443	if (m->darkness)	1377	if (m->darkness)
1444	fprintf (freezer, "darkness %d\n", m->darkness);	1378	fprintf (freezer, "darkness %d\n", m->darkness);
1445	if (m->width)	1379	if (m->width)
…		…
1510	freezer.save (filename);	1444	freezer.save (filename);
1511		1445
1512	return 0;	1446	return 0;
1513	}	1447	}
1514		1448
1515
1516	/*
1517	* Remove and free all objects in the inventory of the given object.
1518	* object.c ?
1519	*/
1520
1521	void
1522	clean_object (object *op)
1523	{
1524	object *tmp, *next;
1525
1526	for (tmp = op->inv; tmp; tmp = next)
1527	{
1528	next = tmp->below;
1529	clean_object (tmp);
1530	if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1531	remove_button_link (tmp);
1532	remove_ob (tmp);
1533	free_object (tmp);
1534	}
1535	}
1536
1537	/*	1449	/*
1538	* Remove and free all objects in the given map.	1450	* Remove and free all objects in the given map.
1539	*/	1451	*/
1540
1541	void	1452	void
1542	free_all_objects (maptile *m)	1453	free_all_objects (maptile *m)
1543	{	1454	{
1544	int i, j;	1455	if (!m->spaces)
1545	object *op;	1456	return;
1546		1457
1547	for (i = 0; i < MAP_WIDTH (m); i++)	1458	for (int i = 0; i < m->width; i++)
1548	for (j = 0; j < MAP_HEIGHT (m); j++)	1459	for (int j = 0; j < m->height; j++)
1549	{	1460	{
1550	object *previous_obj = NULL;	1461	mapspace &ms = m->at (i, j);
1551		1462
1552	while ((op = GET_MAP_OB (m, i, j)) != NULL)	1463	while (object *op = ms.bot)
1553	{	1464	{
1554	if (op == previous_obj)
1555	{
1556	LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1557	break;
1558	}
1559	previous_obj = op;
1560	if (op->head != NULL)	1465	if (op->head)
1561	op = op->head;	1466	op = op->head;
1562		1467
1563	/* If the map isn't in memory, free_object will remove and	1468	op->destroy_inv (false);
1564	* free objects in op's inventory. So let it do the job.	1469	op->destroy ();
1565	*/
1566	if (m->in_memory == MAP_IN_MEMORY)
1567	clean_object (op);
1568	remove_ob (op);
1569	free_object (op);
1570	}	1470	}
1571	}	1471	}
1572	}	1472	}
1573		1473
1574	/*	1474	/*
1575	* Frees everything allocated by the given maptileure.	1475	* Frees everything allocated by the given maptileure.
1576	* don't free tmpname - our caller is left to do that	1476	* don't free tmpname - our caller is left to do that
1577	*/	1477	*/
1578
1579	void	1478	void
1580	free_map (maptile *m, int flag)	1479	free_map (maptile *m, int flag)
1581	{	1480	{
1582	int i;	1481	if (!m->in_memory) //TODO: makes no sense to me?
1583
1584	if (!m->in_memory)
1585	{
1586	LOG (llevError, "Trying to free freed map.\n");
1587	return;	1482	return;
1588	}	1483
		1484	m->in_memory = MAP_SAVING;
		1485
		1486	// TODO: use new/delete
		1487
1589	if (flag && m->spaces)	1488	if (flag && m->spaces)
1590	free_all_objects (m);	1489	free_all_objects (m);
1591	if (m->name)	1490
1592	FREE_AND_CLEAR (m->name);	1491	sfree (m->spaces, m->size ()), m->spaces = 0;
1593	if (m->spaces)	1492
1594	FREE_AND_CLEAR (m->spaces);	1493	free (m->name), m->name = 0;
1595	if (m->msg)	1494	free (m->msg), m->msg = 0;
1596	FREE_AND_CLEAR (m->msg);	1495	free (m->maplore), m->maplore = 0;
1597	if (m->maplore)	1496	free (m->shoprace), m->shoprace = 0;
1598	FREE_AND_CLEAR (m->maplore);	1497	delete [] m->shopitems, m->shopitems = 0;
1599	if (m->shopitems)	1498
1600	delete[]m->shopitems;
1601	m->shopitems = 0;
1602	if (m->shoprace)
1603	FREE_AND_CLEAR (m->shoprace);
1604	if (m->buttons)	1499	if (m->buttons)
1605	free_objectlinkpt (m->buttons);	1500	free_objectlinkpt (m->buttons), m->buttons = 0;
1606	m->buttons = NULL;	1501
1607	for (i = 0; i < 4; i++)	1502	for (int i = 0; i < 4; i++)
1608	{	1503	free (m->tile_path[i]), m->tile_path[i] = 0;
1609	if (m->tile_path[i])	1504
1610	FREE_AND_CLEAR (m->tile_path[i]);
1611	m->tile_map[i] = NULL;
1612	}
1613	m->in_memory = MAP_SWAPPED;	1505	m->in_memory = MAP_SWAPPED;
1614	}	1506	}
1615		1507
1616	/*	1508	maptile::~maptile ()
1617	* function: vanish maptile	1509	{
1618	* m : pointer to maptile, if NULL no action	1510	assert (destroyed ());
1619	* this deletes all the data on the map (freeing pointers)	1511	}
1620	* and then removes this map from the global linked list of maps.	1512
		1513	void
		1514	maptile::do_destroy ()
		1515	{
		1516	attachable::do_destroy ();
		1517
		1518	unlink ();
		1519
		1520	free_map (this, 1);
		1521	free (tmpname), tmpname = 0;
		1522
		1523	/* We need to look through all the maps and see if any maps
		1524	* are pointing at this one for tiling information. Since
		1525	* tiling can be asymetric, we just can not look to see which
		1526	* maps this map tiles with and clears those.
1621	*/	1527	*/
		1528	//TODO: non-euclidean-tiling MUST GO
		1529	for_all_maps (m)
		1530	for (int i = 0; i < 4; i++)
		1531	if (m->tile_map[i] == this)
		1532	m->tile_map[i] = 0;
		1533	}
1622		1534
		1535	//TODO: must go
1623	void	1536	void
1624	delete_map (maptile *m)	1537	delete_map (maptile *m)
1625	{	1538	{
1626	maptile *tmp, *last;
1627	int i;
1628
1629	if (!m)	1539	if (m)
1630	return;	1540	m->destroy ();
1631
1632	m->clear ();
1633
1634	if (m->in_memory == MAP_IN_MEMORY)
1635	{
1636	/* change to MAP_SAVING, even though we are not,
1637	* so that remove_ob doesn't do as much work.
1638	*/
1639	m->in_memory = MAP_SAVING;
1640	free_map (m, 1);
1641	}
1642	/* move this out of free_map, since tmpname can still be needed if
1643	* the map is swapped out.
1644	*/
1645	if (m->tmpname)
1646	{
1647	free (m->tmpname);
1648	m->tmpname = NULL;
1649	}
1650	last = NULL;
1651	/* We need to look through all the maps and see if any maps
1652	* are pointing at this one for tiling information. Since
1653	* tiling can be assymetric, we just can not look to see which
1654	* maps this map tiles with and clears those.
1655	*/
1656	for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1657	{
1658	if (tmp->next == m)
1659	last = tmp;
1660
1661	/* This should hopefully get unrolled on a decent compiler */
1662	for (i = 0; i < 4; i++)
1663	if (tmp->tile_map[i] == m)
1664	tmp->tile_map[i] = NULL;
1665	}
1666
1667	/* If last is null, then this should be the first map in the list */
1668	if (!last)
1669	{
1670	if (m == first_map)
1671	first_map = m->next;
1672	else
1673	/* m->path is a static char, so should hopefully still have
1674	* some useful data in it.
1675	*/
1676	LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1677	}
1678	else
1679	last->next = m->next;
1680
1681	delete m;
1682	}	1541	}
1683
1684
1685		1542
1686	/*	1543	/*
1687	* Makes sure the given map is loaded and swapped in.	1544	* Makes sure the given map is loaded and swapped in.
1688	* name is path name of the map.	1545	* name is path name of the map.
1689	* flags meaning:	1546	* flags meaning:
…		…
1692	* 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.	1549	* 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1693	* dont do any more name translation on it.	1550	* dont do any more name translation on it.
1694	*	1551	*
1695	* Returns a pointer to the given map.	1552	* Returns a pointer to the given map.
1696	*/	1553	*/
1697
1698	maptile *	1554	maptile *
1699	ready_map_name (const char *name, int flags)	1555	ready_map_name (const char *name, int flags)
1700	{	1556	{
1701	maptile *m;
1702
1703	if (!name)	1557	if (!name)
1704	return (NULL);	1558	return 0;
1705		1559
1706	/* Have we been at this level before? */	1560	/* Have we been at this level before? */
1707	m = has_been_loaded (name);	1561	maptile *m = has_been_loaded (name);
1708		1562
1709	/* Map is good to go, so just return it */	1563	/* Map is good to go, so just return it */
1710	if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))	1564	if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1711	{
1712	return m;	1565	return m;
1713	}
1714		1566
1715	/* unique maps always get loaded from their original location, and never	1567	/* unique maps always get loaded from their original location, and never
1716	* a temp location. Likewise, if map_flush is set, or we have never loaded	1568	* a temp location. Likewise, if map_flush is set, or we have never loaded
1717	* this map, load it now. I removed the reset checking from here -	1569	* this map, load it now. I removed the reset checking from here -
1718	* it seems the probability of a player trying to enter a map that should	1570	* it seems the probability of a player trying to enter a map that should
…		…
1720	* a bit cleaner (and players probably shouldn't rely on exact timing for	1572	* a bit cleaner (and players probably shouldn't rely on exact timing for
1721	* resets in any case - if they really care, they should use the 'maps command.	1573	* resets in any case - if they really care, they should use the 'maps command.
1722	*/	1574	*/
1723	if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)	1575	if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1724	{	1576	{
1725
1726	/* first visit or time to reset */	1577	/* first visit or time to reset */
1727	if (m)	1578	if (m)
1728	{	1579	{
1729	clean_tmp_map (m); /* Doesn't make much difference */	1580	clean_tmp_map (m); /* Doesn't make much difference */
1730	delete_map (m);	1581	delete_map (m);
…		…
1734	if (flags & MAP_PLAYER_UNIQUE)	1585	if (flags & MAP_PLAYER_UNIQUE)
1735	LOG (llevDebug, "Trying to load map %s.\n", name);	1586	LOG (llevDebug, "Trying to load map %s.\n", name);
1736	else	1587	else
1737	LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));	1588	LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));
1738		1589
1739	//eval_pv ("$x = Event::time", 1);//D
1740	if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))	1590	if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))
1741	return (NULL);	1591	return (NULL);
1742	//eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D
1743		1592
1744	fix_auto_apply (m); /* Chests which open as default */	1593	fix_auto_apply (m); /* Chests which open as default */
1745		1594
1746	/* If a player unique map, no extra unique object file to load.	1595	/* If a player unique map, no extra unique object file to load.
1747	* if from the editor, likewise.	1596	* if from the editor, likewise.
…		…
1817	int x, y, i;	1666	int x, y, i;
1818	long monster_cnt = 0;	1667	long monster_cnt = 0;
1819	double avgexp = 0;	1668	double avgexp = 0;
1820	sint64 total_exp = 0;	1669	sint64 total_exp = 0;
1821		1670
1822	if (MAP_DIFFICULTY (m))	1671	if (m->difficulty)
1823	{	1672	{
1824	LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m));	1673	LOG (llevDebug, "Using stored map difficulty: %d\n", m->difficulty);
1825	return MAP_DIFFICULTY (m);	1674	return m->difficulty;
1826	}	1675	}
1827		1676
1828	for (x = 0; x < MAP_WIDTH (m); x++)	1677	for (x = 0; x < m->width; x++)
1829	for (y = 0; y < MAP_HEIGHT (m); y++)	1678	for (y = 0; y < m->height; y++)
1830	for (op = get_map_ob (m, x, y); op != NULL; op = op->above)	1679	for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1831	{	1680	{
1832	if (QUERY_FLAG (op, FLAG_MONSTER))	1681	if (QUERY_FLAG (op, FLAG_MONSTER))
1833	{	1682	{
1834	total_exp += op->stats.exp;	1683	total_exp += op->stats.exp;
1835	monster_cnt++;	1684	monster_cnt++;
…		…
1883	if (first_map->in_memory == MAP_SAVING)	1732	if (first_map->in_memory == MAP_SAVING)
1884	first_map->in_memory = MAP_IN_MEMORY;	1733	first_map->in_memory = MAP_IN_MEMORY;
1885	delete_map (first_map);	1734	delete_map (first_map);
1886	real_maps++;	1735	real_maps++;
1887	}	1736	}
		1737
1888	LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);	1738	LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1889	}	1739	}
1890		1740
1891	/* change_map_light() - used to change map light level (darkness)	1741	/* change_map_light() - used to change map light level (darkness)
1892	* up or down. Returns true if successful. It should now be	1742	* up or down. Returns true if successful. It should now be
…		…
1928	/* All clients need to get re-updated for the change */	1778	/* All clients need to get re-updated for the change */
1929	update_all_map_los (m);	1779	update_all_map_los (m);
1930	return 1;	1780	return 1;
1931	}	1781	}
1932		1782
1933
1934	/*	1783	/*
1935	* This function updates various attributes about a specific space	1784	* This function updates various attributes about a specific space
1936	* on the map (what it looks like, whether it blocks magic,	1785	* on the map (what it looks like, whether it blocks magic,
1937	* has a living creatures, prevents people from passing	1786	* has a living creatures, prevents people from passing
1938	* through, etc)	1787	* through, etc)
1939	*/	1788	*/
1940	void	1789	void
1941	update_position (maptile *m, int x, int y)	1790	mapspace::update_ ()
1942	{	1791	{
1943	object *tmp, *last = NULL;	1792	object *tmp, *last = 0;
1944	uint8 flags = 0, oldflags, light = 0, anywhere = 0;	1793	uint8 flags = 0, light = 0, anywhere = 0;
1945	New_Face *top, *floor, *middle;	1794	New_Face *top, *floor, *middle;
1946	object *top_obj, *floor_obj, *middle_obj;	1795	object *top_obj, *floor_obj, *middle_obj;
1947	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1796	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1948		1797
1949	oldflags = GET_MAP_FLAGS (m, x, y);
1950	if (!(oldflags & P_NEED_UPDATE))
1951	{
1952	LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y);
1953	return;
1954	}
1955
1956	middle = blank_face;	1798	middle = blank_face;
1957	top = blank_face;	1799	top = blank_face;
1958	floor = blank_face;	1800	floor = blank_face;
1959		1801
1960	middle_obj = NULL;	1802	middle_obj = 0;
1961	top_obj = NULL;	1803	top_obj = 0;
1962	floor_obj = NULL;	1804	floor_obj = 0;
1963		1805
1964	for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above)	1806	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1965	{	1807	{
1966
1967	/* This could be made additive I guess (two lights better than	1808	/* This could be made additive I guess (two lights better than
1968	* one). But if so, it shouldn't be a simple additive - 2	1809	* one). But if so, it shouldn't be a simple additive - 2
1969	* light bulbs do not illuminate twice as far as once since	1810	* light bulbs do not illuminate twice as far as once since
1970	* it is a disapation factor that is squared (or is it cubed?)	1811	* it is a dissapation factor that is cubed.
1971	*/	1812	*/
1972	if (tmp->glow_radius > light)	1813	if (tmp->glow_radius > light)
1973	light = tmp->glow_radius;	1814	light = tmp->glow_radius;
1974		1815
1975	/* This call is needed in order to update objects the player	1816	/* This call is needed in order to update objects the player
…		…
2013	{	1854	{
2014	middle = tmp->face;	1855	middle = tmp->face;
2015	middle_obj = tmp;	1856	middle_obj = tmp;
2016	}	1857	}
2017	}	1858	}
		1859
2018	if (tmp == tmp->above)	1860	if (tmp == tmp->above)
2019	{	1861	{
2020	LOG (llevError, "Error in structure of map\n");	1862	LOG (llevError, "Error in structure of map\n");
2021	exit (-1);	1863	exit (-1);
2022	}	1864	}
2023		1865
2024	move_slow |= tmp->move_slow;	1866	move_slow |= tmp->move_slow;
2025	move_block |= tmp->move_block;	1867	move_block |= tmp->move_block;
2026	move_on |= tmp->move_on;	1868	move_on |= tmp->move_on;
2027	move_off |= tmp->move_off;	1869	move_off |= tmp->move_off;
2028	move_allow |= tmp->move_allow;	1870	move_allow |= tmp->move_allow;
2029		1871
2030	if (QUERY_FLAG (tmp, FLAG_ALIVE))
2031	flags |= P_IS_ALIVE;
2032	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC))
2033	flags |= P_NO_MAGIC;
2034	if (QUERY_FLAG (tmp, FLAG_DAMNED))
2035	flags |= P_NO_CLERIC;
2036	if (tmp->type == SAFE_GROUND)
2037	flags |= P_SAFE;
2038
2039	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW))	1872	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;
2040	flags |= P_BLOCKSVIEW;	1873	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;
2041	} /* for stack of objects */	1874	if (tmp->type == PLAYER) flags |= P_PLAYER;
2042		1875	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
2043	/* we don't want to rely on this function to have accurate flags, but	1876	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
2044	* since we're already doing the work, we calculate them here.	1877	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
2045	* if they don't match, logic is broken someplace.
2046	*/
2047	if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR)))
2048	{	1878	}
2049	LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n",	1879
2050	m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags);	1880	this->light = light;
2051	}	1881	this->flags_ = flags;
2052	SET_MAP_FLAGS (m, x, y, flags);	1882	this->move_block = move_block & ~move_allow;
2053	SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow);	1883	this->move_on = move_on;
2054	SET_MAP_MOVE_ON (m, x, y, move_on);	1884	this->move_off = move_off;
2055	SET_MAP_MOVE_OFF (m, x, y, move_off);	1885	this->move_slow = move_slow;
2056	SET_MAP_MOVE_SLOW (m, x, y, move_slow);
2057		1886
2058	/* At this point, we have a floor face (if there is a floor),	1887	/* At this point, we have a floor face (if there is a floor),
2059	* and the floor is set - we are not going to touch it at	1888	* and the floor is set - we are not going to touch it at
2060	* this point.	1889	* this point.
2061	* middle contains the highest visibility face.	1890	* middle contains the highest visibility face.
…		…
2115	break;	1944	break;
2116	}	1945	}
2117	}	1946	}
2118	}	1947	}
2119	}	1948	}
		1949
2120	if (middle == floor)	1950	if (middle == floor)
2121	middle = blank_face;	1951	middle = blank_face;
		1952
2122	if (top == middle)	1953	if (top == middle)
2123	middle = blank_face;	1954	middle = blank_face;
2124	SET_MAP_FACE (m, x, y, top, 0);
2125	if (top != blank_face)
2126	SET_MAP_FACE_OBJ (m, x, y, top_obj, 0);
2127	else
2128	SET_MAP_FACE_OBJ (m, x, y, NULL, 0);
2129	SET_MAP_FACE (m, x, y, middle, 1);
2130	if (middle != blank_face)
2131	SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1);
2132	else
2133	SET_MAP_FACE_OBJ (m, x, y, NULL, 1);
2134	SET_MAP_FACE (m, x, y, floor, 2);
2135	if (floor != blank_face)
2136	SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2);
2137	else
2138	SET_MAP_FACE_OBJ (m, x, y, NULL, 2);
2139	SET_MAP_LIGHT (m, x, y, light);
2140	}
2141		1955
		1956	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
		1957	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
		1958	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
		1959	}
2142		1960
2143	void	1961	void
2144	set_map_reset_time (maptile *map)	1962	set_map_reset_time (maptile *map)
2145	{	1963	{
2146	int timeout;	1964	int timeout;
2147		1965
2148	timeout = MAP_RESET_TIMEOUT (map);	1966	timeout = map->reset_timeout;
2149	if (timeout <= 0)	1967	if (timeout <= 0)
2150	timeout = MAP_DEFAULTRESET;	1968	timeout = MAP_DEFAULTRESET;
2151	if (timeout >= MAP_MAXRESET)	1969	if (timeout >= MAP_MAXRESET)
2152	timeout = MAP_MAXRESET;	1970	timeout = MAP_MAXRESET;
2153	MAP_WHEN_RESET (map) = seconds () + timeout;	1971	map->reset_time = time (0) + timeout;
2154	}	1972	}
2155		1973
2156	/* this updates the orig_map->tile_map[tile_num] value after loading	1974	/* this updates the orig_map->tile_map[tile_num] value after loading
2157	* the map. It also takes care of linking back the freshly loaded	1975	* the map. It also takes care of linking back the freshly loaded
2158	* maps tile_map values if it tiles back to this one. It returns	1976	* maps tile_map values if it tiles back to this one. It returns
…		…
2186	*	2004	*
2187	*/	2005	*/
2188	int	2006	int
2189	out_of_map (maptile *m, int x, int y)	2007	out_of_map (maptile *m, int x, int y)
2190	{	2008	{
2191
2192	/* If we get passed a null map, this is obviously the	2009	/* If we get passed a null map, this is obviously the
2193	* case. This generally shouldn't happen, but if the	2010	* case. This generally shouldn't happen, but if the
2194	* map loads fail below, it could happen.	2011	* map loads fail below, it could happen.
2195	*/	2012	*/
2196	if (!m)	2013	if (!m)
…		…
2198		2015
2199	if (x < 0)	2016	if (x < 0)
2200	{	2017	{
2201	if (!m->tile_path[3])	2018	if (!m->tile_path[3])
2202	return 1;	2019	return 1;
		2020
2203	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)	2021	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2204	{
2205	load_and_link_tiled_map (m, 3);	2022	load_and_link_tiled_map (m, 3);
2206	}	2023
2207	return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y));	2024	return (out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y));
2208	}	2025	}
2209	if (x >= MAP_WIDTH (m))	2026
		2027	if (x >= m->width)
2210	{	2028	{
2211	if (!m->tile_path[1])	2029	if (!m->tile_path[1])
2212	return 1;	2030	return 1;
		2031
2213	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)	2032	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2214	{
2215	load_and_link_tiled_map (m, 1);	2033	load_and_link_tiled_map (m, 1);
2216	}	2034
2217	return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y));	2035	return (out_of_map (m->tile_map[1], x - m->width, y));
2218	}	2036	}
		2037
2219	if (y < 0)	2038	if (y < 0)
2220	{	2039	{
2221	if (!m->tile_path[0])	2040	if (!m->tile_path[0])
2222	return 1;	2041	return 1;
		2042
2223	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)	2043	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2224	{
2225	load_and_link_tiled_map (m, 0);	2044	load_and_link_tiled_map (m, 0);
2226	}	2045
2227	return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0])));	2046	return (out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height));
2228	}	2047	}
2229	if (y >= MAP_HEIGHT (m))	2048
		2049	if (y >= m->height)
2230	{	2050	{
2231	if (!m->tile_path[2])	2051	if (!m->tile_path[2])
2232	return 1;	2052	return 1;
		2053
2233	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)	2054	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2234	{
2235	load_and_link_tiled_map (m, 2);	2055	load_and_link_tiled_map (m, 2);
2236	}	2056
2237	return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m)));	2057	return (out_of_map (m->tile_map[2], x, y - m->height));
2238	}	2058	}
2239		2059
2240	/* Simple case - coordinates are within this local	2060	/* Simple case - coordinates are within this local
2241	* map.	2061	* map.
2242	*/	2062	*/
…		…
2256	{	2076	{
2257		2077
2258	if (*x < 0)	2078	if (*x < 0)
2259	{	2079	{
2260	if (!m->tile_path[3])	2080	if (!m->tile_path[3])
2261	return NULL;	2081	return 0;
2262	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)	2082	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2263	load_and_link_tiled_map (m, 3);	2083	load_and_link_tiled_map (m, 3);
2264		2084
2265	*x += MAP_WIDTH (m->tile_map[3]);	2085	*x += m->tile_map[3]->width;
2266	return (get_map_from_coord (m->tile_map[3], x, y));	2086	return (get_map_from_coord (m->tile_map[3], x, y));
2267	}	2087	}
2268	if (*x >= MAP_WIDTH (m))	2088
		2089	if (*x >= m->width)
2269	{	2090	{
2270	if (!m->tile_path[1])	2091	if (!m->tile_path[1])
2271	return NULL;	2092	return 0;
		2093
2272	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)	2094	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2273	load_and_link_tiled_map (m, 1);	2095	load_and_link_tiled_map (m, 1);
2274		2096
2275	*x -= MAP_WIDTH (m);	2097	*x -= m->width;
2276	return (get_map_from_coord (m->tile_map[1], x, y));	2098	return (get_map_from_coord (m->tile_map[1], x, y));
2277	}	2099	}
		2100
2278	if (*y < 0)	2101	if (*y < 0)
2279	{	2102	{
2280	if (!m->tile_path[0])	2103	if (!m->tile_path[0])
2281	return NULL;	2104	return 0;
		2105
2282	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)	2106	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2283	load_and_link_tiled_map (m, 0);	2107	load_and_link_tiled_map (m, 0);
2284		2108
2285	*y += MAP_HEIGHT (m->tile_map[0]);	2109	*y += m->tile_map[0]->height;
2286	return (get_map_from_coord (m->tile_map[0], x, y));	2110	return (get_map_from_coord (m->tile_map[0], x, y));
2287	}	2111	}
2288	if (*y >= MAP_HEIGHT (m))	2112
		2113	if (*y >= m->height)
2289	{	2114	{
2290	if (!m->tile_path[2])	2115	if (!m->tile_path[2])
2291	return NULL;	2116	return 0;
		2117
2292	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)	2118	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2293	load_and_link_tiled_map (m, 2);	2119	load_and_link_tiled_map (m, 2);
2294		2120
2295	*y -= MAP_HEIGHT (m);	2121	*y -= m->height;
2296	return (get_map_from_coord (m->tile_map[2], x, y));	2122	return (get_map_from_coord (m->tile_map[2], x, y));
2297	}	2123	}
2298		2124
2299	/* Simple case - coordinates are within this local	2125	/* Simple case - coordinates are within this local
2300	* map.	2126	* map.
…		…
2320		2146
2321	}	2147	}
2322	else if (map1->tile_map[0] == map2)	2148	else if (map1->tile_map[0] == map2)
2323	{ /* up */	2149	{ /* up */
2324	*dx = 0;	2150	*dx = 0;
2325	*dy = -MAP_HEIGHT (map2);	2151	*dy = -map2->height;
2326	}	2152	}
2327	else if (map1->tile_map[1] == map2)	2153	else if (map1->tile_map[1] == map2)
2328	{ /* right */	2154	{ /* right */
2329	*dx = MAP_WIDTH (map1);	2155	*dx = map1->width;
2330	*dy = 0;	2156	*dy = 0;
2331	}	2157	}
2332	else if (map1->tile_map[2] == map2)	2158	else if (map1->tile_map[2] == map2)
2333	{ /* down */	2159	{ /* down */
2334	*dx = 0;	2160	*dx = 0;
2335	*dy = MAP_HEIGHT (map1);	2161	*dy = map1->height;
2336	}	2162	}
2337	else if (map1->tile_map[3] == map2)	2163	else if (map1->tile_map[3] == map2)
2338	{ /* left */	2164	{ /* left */
2339	*dx = -MAP_WIDTH (map2);	2165	*dx = -map2->width;
2340	*dy = 0;	2166	*dy = 0;
2341		2167
2342	}	2168	}
2343	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	2169	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)
2344	{ /* up right */	2170	{ /* up right */
2345	*dx = MAP_WIDTH (map1->tile_map[0]);	2171	*dx = map1->tile_map[0]->width;
2346	*dy = -MAP_HEIGHT (map1->tile_map[0]);	2172	*dy = -map1->tile_map[0]->height;
2347	}	2173	}
2348	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	2174	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)
2349	{ /* up left */	2175	{ /* up left */
2350	*dx = -MAP_WIDTH (map2);	2176	*dx = -map2->width;
2351	*dy = -MAP_HEIGHT (map1->tile_map[0]);	2177	*dy = -map1->tile_map[0]->height;
2352	}	2178	}
2353	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	2179	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)
2354	{ /* right up */	2180	{ /* right up */
2355	*dx = MAP_WIDTH (map1);	2181	*dx = map1->width;
2356	*dy = -MAP_HEIGHT (map2);	2182	*dy = -map2->height;
2357	}	2183	}
2358	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	2184	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)
2359	{ /* right down */	2185	{ /* right down */
2360	*dx = MAP_WIDTH (map1);	2186	*dx = map1->width;
2361	*dy = MAP_HEIGHT (map1->tile_map[1]);	2187	*dy = map1->tile_map[1]->height;
2362	}	2188	}
2363	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	2189	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)
2364	{ /* down right */	2190	{ /* down right */
2365	*dx = MAP_WIDTH (map1->tile_map[2]);	2191	*dx = map1->tile_map[2]->width;
2366	*dy = MAP_HEIGHT (map1);	2192	*dy = map1->height;
2367	}	2193	}
2368	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	2194	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)
2369	{ /* down left */	2195	{ /* down left */
2370	*dx = -MAP_WIDTH (map2);	2196	*dx = -map2->width;
2371	*dy = MAP_HEIGHT (map1);	2197	*dy = map1->height;
2372	}	2198	}
2373	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	2199	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)
2374	{ /* left up */	2200	{ /* left up */
2375	*dx = -MAP_WIDTH (map1->tile_map[3]);	2201	*dx = -map1->tile_map[3]->width;
2376	*dy = -MAP_HEIGHT (map2);	2202	*dy = -map2->height;
2377	}	2203	}
2378	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	2204	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)
2379	{ /* left down */	2205	{ /* left down */
2380	*dx = -MAP_WIDTH (map1->tile_map[3]);	2206	*dx = -map1->tile_map[3]->width;
2381	*dy = MAP_HEIGHT (map1->tile_map[3]);	2207	*dy = map1->tile_map[3]->height;
2382		2208
2383	}	2209	}
2384	else	2210	else
2385	{ /* not "adjacent" enough */	2211	{ /* not "adjacent" enough */
2386	return 0;	2212	return 0;
…		…
2511	{	2337	{
2512	int dx, dy;	2338	int dx, dy;
2513		2339
2514	return adjacent_map (op1->map, op2->map, &dx, &dy);	2340	return adjacent_map (op1->map, op2->map, &dx, &dy);
2515	}	2341	}
		2342
		2343	object *
		2344	maptile::insert (object *op, int x, int y, object *originator, int flags)
		2345	{
		2346	if (!op->flag [FLAG_REMOVED])
		2347	op->remove ();
		2348
		2349	return insert_ob_in_map_at (op, this, originator, flags, x, y);
		2350	}
		2351

Diff Legend

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