[ViewVC] Diff of: cvs/deliantra/server/common/map.C

Comparing deliantra/server/common/map.C (file contents):
Revision 1.157 by root, Thu Jan 8 19:23:44 2009 UTC vs.
Revision 1.211 by root, Sat May 7 14:13:48 2011 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <unistd.h>	25	#include <unistd.h>
25		26
26	#include "global.h"	27	#include "global.h"
27	#include "loader.h"
28	#include "path.h"	28	#include "path.h"
		29
		30	//+GPL
29		31
30	sint8 maptile::outdoor_darkness;	32	sint8 maptile::outdoor_darkness;
31		33
32	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	34	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
33	* one function that just returns a P_.. value (see map.h)	35	* one function that just returns a P_.. value (see map.h)
70	* by the caller.	72	* by the caller.
71	*/	73	*/
72	int	74	int
73	blocked_link (object ob, maptile m, int sx, int sy)	75	blocked_link (object ob, maptile m, int sx, int sy)
74	{	76	{
75	object *tmp;
76	int mflags, blocked;
77
78	/* Make sure the coordinates are valid - they should be, as caller should	77	/* Make sure the coordinates are valid - they should be, as caller should
79	* have already checked this.	78	* have already checked this.
80	*/	79	*/
81	if (OUT_OF_REAL_MAP (m, sx, sy))	80	if (OUT_OF_REAL_MAP (m, sx, sy))
82	{	81	{
83	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");	82	LOG (llevError \| logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
84	return 1;	83	return 1;
85	}	84	}
86		85
87	/* Save some cycles - instead of calling get_map_flags(), just get the value	86	mapspace &ms = m->at (sx, sy);
88	* directly.
89	*/
90	mflags = m->at (sx, sy).flags ();
91		87
92	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	88	int mflags = ms.flags ();
		89	int blocked = ms.move_block;
93		90
94	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
95	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
96	* things we need to do for players.	93	* things we need to do for players.
97	*/	94	*/
98	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
99	return 0;	96	return 0;
100		97
101	/* if there isn't anytyhing alive on this space, and this space isn't	98	/* if there isn't anything alive on this space, and this space isn't
102	* otherwise blocked, we can return now. Only if there is a living	99	* otherwise blocked, we can return now. Only if there is a living
103	* creature do we need to investigate if it is part of this creature	100	* creature do we need to investigate if it is part of this creature
104	* or another. Likewise, only if something is blocking us do we	101	* or another. Likewise, only if something is blocking us do we
105	* need to investigate if there is a special circumstance that would	102	* need to investigate if there is a special circumstance that would
106	* let the player through (inventory checkers for example)	103	* let the player through (inventory checkers for example)
…		…
113	/* We basically go through the stack of objects, and if there is	110	/* We basically go through the stack of objects, and if there is
114	* some other object that has NO_PASS or FLAG_ALIVE set, return	111	* some other object that has NO_PASS or FLAG_ALIVE set, return
115	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
116	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
117	*/	114	*/
118	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
119	{	116	{
120		117	if (OB_MOVE_BLOCK (ob, tmp))
121	/* This must be before the checks below. Code for inventory checkers. */
122	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
123	{	118	{
124	/* If last_sp is set, the player/monster needs an object,	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
125	* so we check for it. If they don't have it, they can't	120	if (RESULT_INT (0))
126	* pass through this space.	121	return 1;
127	*/	122	else
128	if (tmp->last_sp)	123	continue;
		124
		125	if (tmp->type == CHECK_INV)
129	{	126	{
130	if (check_inv_recursive (ob, tmp) == NULL)	127	bool have = check_inv_recursive (ob, tmp);
		128
		129	// last_sp set means we block if we don't have.
		130	if (logical_xor (have, tmp->last_sp))
131	return 1;	131	return 1;
132	else	132	}
133	continue;	133	else if (tmp->type == T_MATCH)
		134	{
		135	// T_MATCH allows "entrance" iff the match is true
		136	// == blocks if the match fails
		137
		138	// we could have used an INVOKE_OBJECT, but decided against it, as we
		139	// assume that T_MATCH is relatively common.
		140	if (!match (tmp->slaying, ob, tmp, ob))
		141	return 1;
134	}	142	}
135	else	143	else
136	{	144	return 1; // unconditional block
137	/* In this case, the player must not have the object -	145
138	* if they do, they can't pass through.
139	*/
140	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
141	return 1;
142	else
143	continue;
144	}
145	} /* if check_inv */
146	else	146	} else {
147	{	147	// space does not block the ob, directly, but
148	/* Broke apart a big nasty if into several here to make	148	// anything alive that is not a door still
149	* this more readable. first check - if the space blocks	149	// blocks anything
150	* movement, can't move here.
151	* second - if a monster, can't move there, unless it is a
152	* hidden dm
153	*/
154	if (OB_MOVE_BLOCK (ob, tmp))
155	return 1;
156		150
157	if (tmp->flag [FLAG_ALIVE]	151	if (tmp->flag [FLAG_ALIVE]
158	&& tmp->head_ () != ob
159	&& tmp != ob
160	&& tmp->type != DOOR	152	&& tmp->type != DOOR
161	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
162	return 1;	154	return 1;
163	}	155	}
164
165	}	156	}
		157
166	return 0;	158	return 0;
167	}	159	}
168		160
169	/*	161	/*
170	* Returns qthe blocking object if the given object can't fit in the given	162	* Returns the blocking object if the given object can't fit in the given
171	* spot. This is meant for multi space objects - for single space objecs,	163	* spot. This is meant for multi space objects - for single space objecs,
172	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
173	* of object. This function goes through all the parts of the multipart	165	* of object. This function goes through all the parts of the multipart
174	* object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
175	*	167	*
…		…
222	}	214	}
223		215
224	return 0;	216	return 0;
225	}	217	}
226		218
227	/* When the map is loaded, load_object does not actually insert objects	219	//-GPL
228	* into inventory, but just links them. What this does is go through
229	* and insert them properly.
230	* The object 'container' is the object that contains the inventory.
231	* This is needed so that we can update the containers weight.
232	*/
233	void
234	fix_container (object *container)
235	{
236	object tmp = container->inv, next;
237
238	container->inv = 0;
239	while (tmp)
240	{
241	next = tmp->below;
242	if (tmp->inv)
243	fix_container (tmp);
244
245	insert_ob_in_ob (tmp, container);
246	tmp = next;
247	}
248
249	// go through and calculate what all the containers are carrying.
250	//TODO: remove
251	container->update_weight ();
252	}
253		220
254	void	221	void
255	maptile::set_object_flag (int flag, int value)	222	maptile::set_object_flag (int flag, int value)
256	{	223	{
257	if (!spaces)	224	if (!spaces)
…		…
272		239
273	for (mapspace *ms = spaces + size (); ms-- > spaces; )	240	for (mapspace *ms = spaces + size (); ms-- > spaces; )
274	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	241	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
275	INVOKE_OBJECT (RESET, tmp);	242	INVOKE_OBJECT (RESET, tmp);
276	}	243	}
		244
		245	void
		246	maptile::post_load ()
		247	{
		248	#if 0
		249	if (!spaces)
		250	return;
		251
		252	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		253	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		254	; // nop
		255	#endif
		256	}
		257
		258	//+GPL
277		259
278	/* link_multipart_objects go through all the objects on the map looking	260	/* link_multipart_objects go through all the objects on the map looking
279	* for objects whose arch says they are multipart yet according to the	261	* for objects whose arch says they are multipart yet according to the
280	* info we have, they only have the head (as would be expected when	262	* info we have, they only have the head (as would be expected when
281	* they are saved).	263	* they are saved).
…		…
309	op = op->above;	291	op = op->above;
310	}	292	}
311	}	293	}
312	}	294	}
313		295
		296	//-GPL
		297
314	/*	298	/*
315	* Loads (ands parses) the objects into a given map from the specified	299	* Loads (ands parses) the objects into a given map from the specified
316	* file pointer.	300	* file pointer.
317	*/	301	*/
318	bool	302	bool
…		…
327	case KW_arch:	311	case KW_arch:
328	if (object *op = object::read (f, this))	312	if (object *op = object::read (f, this))
329	{	313	{
330	// TODO: why?	314	// TODO: why?
331	if (op->inv)	315	if (op->inv)
		316	{
		317	op->carrying = 0;
332	op->update_weight ();	318	op->update_weight ();
		319	}
333		320
334	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))	321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
335	{	322	{
336	// we insert manually because	323	// we insert manually because
337	// a) its way faster	324	// a) its way faster
338	// b) we remove manually, too, and there are good reasons for that	325	// b) we remove manually, too, and there are good reasons for that
339	// c) its correct	326	// c) it's correct
340	mapspace &ms = at (op->x, op->y);	327	mapspace &ms = at (op->x, op->y);
341		328
342	op->flag [FLAG_REMOVED] = false;	329	op->flag [FLAG_REMOVED] = false;
343		330
344	op->above = 0;	331	op->above = 0;
345	op->below = ms.top;	332	op->below = ms.top;
346		333
347	if (ms.top)
348	ms.top->above = op;	334	*(ms.top ? &ms.top->above : &ms.bot) = op;
349	else
350	ms.bot = op;
351		335
352	ms.top = op;	336	ms.top = op;
353	ms.flags_ = 0;	337	ms.flags_ = 0;
354	}	338	}
355	else	339	else
…		…
377	}	361	}
378		362
379	void	363	void
380	maptile::activate ()	364	maptile::activate ()
381	{	365	{
382	if (spaces)	366	if (state != MAP_INACTIVE)
		367	return;
		368
383	for (mapspace *ms = spaces + size (); ms-- > spaces; )	369	for (mapspace *ms = spaces + size (); ms-- > spaces; )
384	for (object *op = ms->bot; op; op = op->above)	370	for (object *op = ms->bot; op; op = op->above)
385	op->activate_recursive ();	371	op->activate_recursive ();
		372
		373	state = MAP_ACTIVE;
		374
		375	activate_physics ();
386	}	376	}
387		377
388	void	378	void
389	maptile::deactivate ()	379	maptile::deactivate ()
390	{	380	{
391	if (spaces)	381	if (state != MAP_ACTIVE)
		382	return;
		383
392	for (mapspace *ms = spaces + size (); ms-- > spaces; )	384	for (mapspace *ms = spaces + size (); ms-- > spaces; )
393	for (object *op = ms->bot; op; op = op->above)	385	for (object *op = ms->bot; op; op = op->above)
394	op->deactivate_recursive ();	386	op->deactivate_recursive ();
		387
		388	state = MAP_INACTIVE;
395	}	389	}
396		390
397	bool	391	bool
398	maptile::_save_objects (object_freezer &f, int flags)	392	maptile::_save_objects (object_freezer &f, int flags)
399	{	393	{
…		…
440	return false;	434	return false;
441		435
442	return freezer.save (path);	436	return freezer.save (path);
443	}	437	}
444		438
445	maptile::maptile ()	439	void
		440	maptile::init ()
446	{	441	{
447	in_memory = MAP_SWAPPED;	442	state = MAP_SWAPPED;
448		443
449	/* The maps used to pick up default x and y values from the	444	/* The maps used to pick up default x and y values from the
450	* map archetype. Mimic that behaviour.	445	* map archetype. Mimic that behaviour.
451	*/	446	*/
452	width = 16;	447	width = 16;
453	height = 16;	448	height = 16;
454	timeout = 300;	449	timeout = 300;
455	max_nrof = 1000; // 1000 items of anything	450	max_items = MAX_ITEM_PER_ACTION;
456	max_volume = 2000000; // 2m³	451	max_volume = 2000000; // 2m³
457	}
458
459	maptile::maptile (int w, int h)
460	{
461	in_memory = MAP_SWAPPED;
462
463	width = w;
464	height = h;
465	reset_timeout = 0;	452	reset_timeout = 0;
466	timeout = 300;
467	enter_x = 0;	453	enter_x = 0;
468	enter_y = 0;	454	enter_y = 0;
		455	}
		456
		457	maptile::maptile ()
		458	{
		459	init ();
		460	}
		461
		462	maptile::maptile (int w, int h)
		463	{
		464	init ();
		465
		466	width = w;
		467	height = h;
469		468
470	alloc ();	469	alloc ();
471	}	470	}
472		471
473	/*	472	/*
…		…
481	if (spaces)	480	if (spaces)
482	return;	481	return;
483		482
484	spaces = salloc0<mapspace> (size ());	483	spaces = salloc0<mapspace> (size ());
485	}	484	}
		485
		486	//+GPL
486		487
487	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	488	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
488	* corresponding to that string. Memory is allocated for this, it must be freed	489	* corresponding to that string. Memory is allocated for this, it must be freed
489	* at a later date.	490	* at a later date.
490	* Called by parse_map_headers below.	491	* Called by parse_map_headers below.
…		…
567	return items;	568	return items;
568	}	569	}
569		570
570	/* opposite of parse string, this puts the string that was originally fed in to	571	/* opposite of parse string, this puts the string that was originally fed in to
571	* the map (or something equivilent) into output_string. */	572	* the map (or something equivilent) into output_string. */
572	static void	573	static const char *
573	print_shop_string (maptile m, char output_string)	574	print_shop_string (maptile *m)
574	{	575	{
575	int i;	576	static dynbuf_text buf; buf.clear ();
576	char tmp[MAX_BUF];	577	bool first = true;
577		578
578	strcpy (output_string, "");
579	for (i = 0; i < m->shopitems[0].index; i++)	579	for (int i = 0; i < m->shopitems[0].index; i++)
580	{	580	{
		581	if (!first)
		582	buf << ';';
		583
		584	first = false;
		585
581	if (m->shopitems[i].typenum)	586	if (m->shopitems[i].typenum)
582	{	587	{
583	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
584	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	589	buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
585	else	590	else
586	sprintf (tmp, "%s;", m->shopitems[i].name);	591	buf.printf ("%s", m->shopitems[i].name);
587	}	592	}
588	else	593	else
589	{	594	{
590	if (m->shopitems[i].strength)	595	if (m->shopitems[i].strength)
591	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	596	buf.printf ("*:%d", m->shopitems[i].strength);
592	else	597	else
593	sprintf (tmp, "*");	598	buf.printf ("*");
594	}	599	}
595
596	strcat (output_string, tmp);
597	}	600	}
		601
		602	return buf;
598	}	603	}
		604
		605	//-GPL
599		606
600	/* This loads the header information of the map. The header	607	/* This loads the header information of the map. The header
601	* contains things like difficulty, size, timeout, etc.	608	* contains things like difficulty, size, timeout, etc.
602	* this used to be stored in the map object, but with the	609	* this used to be stored in the map object, but with the
603	* addition of tiling, fields beyond that easily named in an	610	* addition of tiling, fields beyond that easily named in an
…		…
617	{	624	{
618	case KW_msg:	625	case KW_msg:
619	thawer.get_ml (KW_endmsg, msg);	626	thawer.get_ml (KW_endmsg, msg);
620	break;	627	break;
621		628
622	case KW_lore: // CF+ extension	629	case KW_lore: // deliantra extension
623	thawer.get_ml (KW_endlore, maplore);	630	thawer.get_ml (KW_endlore, maplore);
624	break;	631	break;
625		632
626	case KW_maplore:	633	case KW_maplore:
627	thawer.get_ml (KW_endmaplore, maplore);	634	thawer.get_ml (KW_endmaplore, maplore);
…		…
644	case KW_shopgreed: thawer.get (shopgreed); break;	651	case KW_shopgreed: thawer.get (shopgreed); break;
645	case KW_shopmin: thawer.get (shopmin); break;	652	case KW_shopmin: thawer.get (shopmin); break;
646	case KW_shopmax: thawer.get (shopmax); break;	653	case KW_shopmax: thawer.get (shopmax); break;
647	case KW_shoprace: thawer.get (shoprace); break;	654	case KW_shoprace: thawer.get (shoprace); break;
648	case KW_outdoor: thawer.get (outdoor); break;	655	case KW_outdoor: thawer.get (outdoor); break;
649	case KW_temp: thawer.get (temp); break;
650	case KW_pressure: thawer.get (pressure); break;
651	case KW_humid: thawer.get (humid); break;
652	case KW_windspeed: thawer.get (windspeed); break;
653	case KW_winddir: thawer.get (winddir); break;
654	case KW_sky: thawer.get (sky); break;
655		656
656	case KW_per_player: thawer.get (per_player); break;	657	case KW_per_player: thawer.get (per_player); break;
657	case KW_per_party: thawer.get (per_party); break;	658	case KW_per_party: thawer.get (per_party); break;
658	case KW_no_reset: thawer.get (no_reset); break;	659	case KW_no_reset: thawer.get (no_reset); break;
659	case KW_no_drop: thawer.get (no_drop); break;	660	case KW_no_drop: thawer.get (no_drop); break;
660		661
661	case KW_region: default_region = region::find (thawer.get_str ()); break;	662	case KW_region: thawer.get (default_region); break;
662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
663		664
664	// old names new names	665	// old names new names
665	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	666	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
666	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	667	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
674		675
675	case KW_tile_path_1: thawer.get (tile_path [0]); break;	676	case KW_tile_path_1: thawer.get (tile_path [0]); break;
676	case KW_tile_path_2: thawer.get (tile_path [1]); break;	677	case KW_tile_path_2: thawer.get (tile_path [1]); break;
677	case KW_tile_path_3: thawer.get (tile_path [2]); break;	678	case KW_tile_path_3: thawer.get (tile_path [2]); break;
678	case KW_tile_path_4: thawer.get (tile_path [3]); break;	679	case KW_tile_path_4: thawer.get (tile_path [3]); break;
		680	case KW_tile_path_5: thawer.get (tile_path [4]); break;
		681	case KW_tile_path_6: thawer.get (tile_path [5]); break;
679		682
680	case KW_ERROR:	683	case KW_ERROR:
681	set_key_text (thawer.kw_str, thawer.value);	684	set_key_text (thawer.kw_str, thawer.value);
682	break;	685	break;
683		686
684	case KW_end:	687	case KW_end:
685	thawer.next ();	688	thawer.next ();
686	return true;	689	return true;
687		690
688	default:	691	default:
689	if (!thawer.parse_error ("map", 0))	692	if (!thawer.parse_error ("map"))
690	return false;	693	return false;
691	break;	694	break;
692	}	695	}
693		696
694	thawer.next ();	697	thawer.next ();
695	}	698	}
696		699
697	abort ();	700	abort ();
698	}	701	}
		702
		703	//+GPL
699		704
700	/******************************************************************************	705	/******************************************************************************
701	* This is the start of unique map handling code	706	* This is the start of unique map handling code
702	*****************************************************************************/	707	*****************************************************************************/
703		708
…		…
710	int unique = 0;	715	int unique = 0;
711	for (object *op = spaces [i].bot; op; )	716	for (object *op = spaces [i].bot; op; )
712	{	717	{
713	object *above = op->above;	718	object *above = op->above;
714		719
715	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	720	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
716	unique = 1;	721	unique = 1;
717		722
718	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	723	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] \|\| unique))
719	op->destroy ();	724	op->destroy ();
720		725
721	op = above;	726	op = above;
722	}	727	}
723	}	728	}
724	}	729	}
725		730
		731	//-GPL
		732
726	bool	733	bool
727	maptile::_save_header (object_freezer &freezer)	734	maptile::_save_header (object_freezer &freezer)
728	{	735	{
729	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	736	#define MAP_OUT(k) freezer.put (KW(k), k)
730	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	737	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
731		738
732	MAP_OUT2 (arch, "map");	739	MAP_OUT2 (arch, CS(map));
733		740
734	if (name) MAP_OUT (name);	741	if (name) MAP_OUT (name);
735	MAP_OUT (swap_time);	742	MAP_OUT (swap_time);
736	MAP_OUT (reset_time);	743	MAP_OUT (reset_time);
737	MAP_OUT (reset_timeout);	744	MAP_OUT (reset_timeout);
738	MAP_OUT (fixed_resettime);	745	MAP_OUT (fixed_resettime);
739	MAP_OUT (no_reset);	746	MAP_OUT (no_reset);
740	MAP_OUT (no_drop);	747	MAP_OUT (no_drop);
741	MAP_OUT (difficulty);	748	MAP_OUT (difficulty);
742
743	if (default_region) MAP_OUT2 (region, default_region->name);	749	if (default_region) MAP_OUT2 (region, default_region->name);
744		750
745	if (shopitems)	751	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
746	{
747	char shop[MAX_BUF];
748	print_shop_string (this, shop);
749	MAP_OUT2 (shopitems, shop);
750	}
751
752	MAP_OUT (shopgreed);	752	MAP_OUT (shopgreed);
753	MAP_OUT (shopmin);	753	MAP_OUT (shopmin);
754	MAP_OUT (shopmax);	754	MAP_OUT (shopmax);
755	if (shoprace) MAP_OUT (shoprace);	755	if (shoprace) MAP_OUT (shoprace);
756	MAP_OUT (darkness);	756
757	MAP_OUT (width);	757	MAP_OUT (width);
758	MAP_OUT (height);	758	MAP_OUT (height);
759	MAP_OUT (enter_x);	759	MAP_OUT (enter_x);
760	MAP_OUT (enter_y);	760	MAP_OUT (enter_y);
761		761	MAP_OUT (darkness);
762	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
763	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
764
765	MAP_OUT (outdoor);	762	MAP_OUT (outdoor);
766	MAP_OUT (temp);	763
767	MAP_OUT (pressure);	764	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
768	MAP_OUT (humid);	765	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
769	MAP_OUT (windspeed);
770	MAP_OUT (winddir);
771	MAP_OUT (sky);
772		766
773	MAP_OUT (per_player);	767	MAP_OUT (per_player);
774	MAP_OUT (per_party);	768	MAP_OUT (per_party);
775		769
776	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	770	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
777	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	771	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
778	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	772	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
779	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	773	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
		774	if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]);
		775	if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]);
780		776
781	freezer.put (this);	777	freezer.put (this);
782	freezer.put (KW_end);	778	freezer.put (KW(end));
783		779
784	return true;	780	return true;
785	}	781	}
786		782
787	bool	783	bool
…		…
792	if (!_save_header (freezer))	788	if (!_save_header (freezer))
793	return false;	789	return false;
794		790
795	return freezer.save (path);	791	return freezer.save (path);
796	}	792	}
		793
		794	//+GPL
797		795
798	/*	796	/*
799	* Remove and free all objects in the given map.	797	* Remove and free all objects in the given map.
800	*/	798	*/
801	void	799	void
…		…
839	msg = 0;	837	msg = 0;
840	maplore = 0;	838	maplore = 0;
841	shoprace = 0;	839	shoprace = 0;
842	delete [] shopitems, shopitems = 0;	840	delete [] shopitems, shopitems = 0;
843		841
844	for (int i = 0; i < 4; i++)	842	for (int i = 0; i < array_length (tile_path); i++)
845	tile_path [i] = 0;	843	tile_path [i] = 0;
846	}	844	}
847		845
848	maptile::~maptile ()	846	maptile::~maptile ()
849	{	847	{
…		…
856	/* We need to look through all the maps and see if any maps	854	/* We need to look through all the maps and see if any maps
857	* are pointing at this one for tiling information. Since	855	* are pointing at this one for tiling information. Since
858	* tiling can be asymetric, we just can not look to see which	856	* tiling can be asymetric, we just can not look to see which
859	* maps this map tiles with and clears those.	857	* maps this map tiles with and clears those.
860	*/	858	*/
861	for (int i = 0; i < 4; i++)	859	for (int i = 0; i < array_length (tile_path); i++)
862	if (tile_map[i] == m)	860	if (tile_map[i] == m)
863	tile_map[i] = 0;	861	tile_map[i] = 0;
864	}	862	}
865		863
866	void	864	void
…		…
870		868
871	clear ();	869	clear ();
872	}	870	}
873		871
874	/* decay and destroy perishable items in a map */	872	/* decay and destroy perishable items in a map */
		873	// TODO: should be done regularly, not on map load?
875	void	874	void
876	maptile::do_decay_objects ()	875	maptile::do_decay_objects ()
877	{	876	{
878	if (!spaces)	877	if (!spaces)
879	return;	878	return;
…		…
881	for (mapspace *ms = spaces + size (); ms-- > spaces; )	880	for (mapspace *ms = spaces + size (); ms-- > spaces; )
882	for (object above, op = ms->bot; op; op = above)	881	for (object above, op = ms->bot; op; op = above)
883	{	882	{
884	above = op->above;	883	above = op->above;
885		884
		885	// do not decay anything above unique floor tiles (yet :)
		886	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		887	break;
		888
886	bool destroy = 0;	889	bool destroy = 0;
887		890
888	// do not decay anything above unique floor tiles (yet :)	891	if (op->flag [FLAG_IS_FLOOR]
889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	892	\|\| op->flag [FLAG_OBJ_ORIGINAL]
890	break;	893	\|\| op->flag [FLAG_UNIQUE]
891		894	\|\| op->flag [FLAG_OVERLAY_FLOOR]
892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	895	\|\| op->flag [FLAG_UNPAID]
893	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
894	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
895	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
896	\|\| QUERY_FLAG (op, FLAG_UNPAID)
897	\|\| op->is_alive ())	896	\|\| op->is_alive ())
898	; // do not decay	897	; // do not decay
899	else if (op->is_weapon ())	898	else if (op->is_weapon ())
900	{	899	{
901	op->stats.dam--;	900	op->stats.dam--;
…		…
926	\|\| mat & M_LIQUID	925	\|\| mat & M_LIQUID
927	\|\| (mat & M_IRON && rndm (1, 5) == 1)	926	\|\| (mat & M_IRON && rndm (1, 5) == 1)
928	\|\| (mat & M_GLASS && rndm (1, 2) == 1)	927	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
929	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)	928	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
930	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)	929	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
931	\|\| (mat & M_ICE && temp > 32))	930	//\|\| (mat & M_ICE && temp > 32)
		931	)
932	destroy = 1;	932	destroy = 1;
933	}	933	}
934		934
935	/* adjust overall chance below */	935	/* adjust overall chance below */
936	if (destroy && rndm (0, 1))	936	if (destroy && rndm (0, 1))
…		…
956	sint64 total_exp = 0;	956	sint64 total_exp = 0;
957		957
958	for (mapspace *ms = spaces + size (); ms-- > spaces; )	958	for (mapspace *ms = spaces + size (); ms-- > spaces; )
959	for (object *op = ms->bot; op; op = op->above)	959	for (object *op = ms->bot; op; op = op->above)
960	{	960	{
961	if (QUERY_FLAG (op, FLAG_MONSTER))	961	if (op->flag [FLAG_MONSTER])
962	{	962	{
963	total_exp += op->stats.exp;	963	total_exp += op->stats.exp;
964	monster_cnt++;	964	monster_cnt++;
965	}	965	}
966		966
967	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (op->flag [FLAG_GENERATOR])
968	{	968	{
969	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
970		970
971	if (archetype *at = op->other_arch)	971	if (archetype *at = op->other_arch)
972	{	972	{
…		…
1027	*/	1027	*/
1028	void	1028	void
1029	mapspace::update_ ()	1029	mapspace::update_ ()
1030	{	1030	{
1031	object *last = 0;	1031	object *last = 0;
1032	uint8 flags = P_UPTODATE, anywhere = 0;	1032	uint8 flags = P_UPTODATE;
1033	sint8 light = 0;	1033	sint8 light = 0;
1034	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1034	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1035	uint64_t volume = 0;
		1036	uint32_t items = 0;
		1037	object *anywhere = 0;
		1038	uint8_t middle_visibility = 0;
1035		1039
1036	//object *middle = 0;	1040	//object *middle = 0;
1037	//object *top = 0;	1041	//object *top = 0;
1038	//object *floor = 0;	1042	//object *floor = 0;
1039	// this seems to generate better code than using locals, above	1043	// this seems to generate better code than using locals, above
1040	object *&top = faces_obj[0] = 0;	1044	object *&top = faces_obj[0] = 0;
1041	object *&middle = faces_obj[1] = 0;	1045	object *&middle = faces_obj[1] = 0;
1042	object *&floor = faces_obj[2] = 0;	1046	object *&floor = faces_obj[2] = 0;
		1047
		1048	object::flags_t allflags; // all flags of all objects or'ed together
1043		1049
1044	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1045	{	1051	{
1046	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1047	light += tmp->glow_radius;	1053	light += tmp->glow_radius;
…		…
1052	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1053	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1054	*	1060	*
1055	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1056	*/	1062	*/
1057	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1058	{	1064	{
1059	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1060	top = tmp;	1066	top = tmp;
1061	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1067	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1062	{	1068	{
1063	/* If we got a floor, that means middle and top were below it,	1069	/* If we got a floor, that means middle and top were below it,
1064	* so should not be visible, so we clear them.	1070	* so should not be visible, so we clear them.
1065	*/	1071	*/
1066	middle = 0;	1072	middle = 0;
1067	top = 0;	1073	top = 0;
1068	floor = tmp;	1074	floor = tmp;
		1075	volume = 0;
		1076	items = 0;
1069	}	1077	}
1070	/* Flag anywhere have high priority */	1078	else
1071	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1072	{	1079	{
		1080	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1081	{
		1082	++items;
		1083	volume += tmp->volume ();
		1084	}
		1085
		1086	/* Flag anywhere have high priority */
		1087	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1088	anywhere = tmp;
		1089
		1090	/* Find the highest visible face around. If equal
		1091	* visibilities, we still want the one nearer to the
		1092	* top
		1093	*/
		1094	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
		1095	{
		1096	middle_visibility = ::faces [tmp->face].visibility;
1073	middle = tmp;	1097	middle = tmp;
1074	anywhere = 1;	1098	}
1075	}	1099	}
1076
1077	/* Find the highest visible face around. If equal
1078	* visibilities, we still want the one nearer to the
1079	* top
1080	*/
1081	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1082	middle = tmp;
1083	}
1084
1085	if (tmp == tmp->above)
1086	{
1087	LOG (llevError, "Error in structure of map\n");
1088	exit (-1);
1089	}	1100	}
1090		1101
1091	move_slow \|= tmp->move_slow;	1102	move_slow \|= tmp->move_slow;
1092	move_block \|= tmp->move_block;	1103	move_block \|= tmp->move_block;
1093	move_on \|= tmp->move_on;	1104	move_on \|= tmp->move_on;
1094	move_off \|= tmp->move_off;	1105	move_off \|= tmp->move_off;
1095	move_allow \|= tmp->move_allow;	1106	move_allow \|= tmp->move_allow;
1096		1107
1097	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1108	allflags \|= tmp->flag;
1098	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1109
1099	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1110	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1100	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1111	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1101	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1102	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1103	}	1112	}
		1113
		1114	// FLAG_SEE_ANYWHERE takes precedence
		1115	if (anywhere)
		1116	middle = anywhere;
		1117
		1118	// ORing all flags together and checking them here is much faster
		1119	if (allflags [FLAG_BLOCKSVIEW]) flags \|= P_BLOCKSVIEW;
		1120	if (allflags [FLAG_NO_MAGIC] ) flags \|= P_NO_MAGIC;
		1121	if (allflags [FLAG_ALIVE] ) flags \|= P_IS_ALIVE;
		1122	if (allflags [FLAG_DAMNED] ) flags \|= P_NO_CLERIC;
1104		1123
1105	this->light = min (light, MAX_LIGHT_RADIUS);	1124	this->light = min (light, MAX_LIGHT_RADIUS);
1106	this->flags_ = flags;	1125	this->flags_ = flags;
1107	this->move_block = move_block & ~move_allow;	1126	this->move_block = move_block & ~move_allow;
1108	this->move_on = move_on;	1127	this->move_on = move_on;
1109	this->move_off = move_off;	1128	this->move_off = move_off;
1110	this->move_slow = move_slow;	1129	this->move_slow = move_slow;
		1130	this->volume_ = (volume + 1023) / 1024;
		1131	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1111		1132
1112	/* At this point, we have a floor face (if there is a floor),	1133	/* At this point, we have a floor face (if there is a floor),
1113	* and the floor is set - we are not going to touch it at	1134	* and the floor is set - we are not going to touch it at
1114	* this point.	1135	* this point.
1115	* middle contains the highest visibility face.	1136	* middle contains the highest visibility face.
…		…
1133	*/	1154	*/
1134		1155
1135	for (object *tmp = last; tmp; tmp = tmp->below)	1156	for (object *tmp = last; tmp; tmp = tmp->below)
1136	{	1157	{
1137	/* Once we get to a floor, stop, since we already have a floor object */	1158	/* Once we get to a floor, stop, since we already have a floor object */
1138	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1159	if (tmp->flag [FLAG_IS_FLOOR])
1139	break;	1160	break;
1140		1161
1141	/* If two top faces are already set, quit processing */	1162	/* If two top faces are already set, quit processing */
1142	if (top && middle)	1163	if (top && middle)
1143	break;	1164	break;
…		…
1174	middle = 0;	1195	middle = 0;
1175		1196
1176	if (top == middle)	1197	if (top == middle)
1177	middle = 0;	1198	middle = 0;
1178		1199
		1200	// dire hack to handle "transparent" floors - currently only open_space
		1201	if (floor && floor->arch->archname == shstr_quad_open_space)
		1202	{
		1203	floor->set_anim_frame (0);
		1204
		1205	if (maptile *m = floor->map->tile_map [TILE_DOWN])
		1206	{
		1207	// mirror the floor - very unreliable because usually outdated,
		1208	// but somewhta works because floors do not change often :/
		1209	mapspace &ms = m->at (floor->x, floor->y);
		1210	ms.update ();
		1211
		1212	if (object *floor2 = ms.faces_obj [2])
		1213	if (floor2->arch->archname != shstr_quad_open_space && !middle)
		1214	{
		1215	floor->set_anim_frame (1);
		1216	middle = floor;
		1217	floor = floor2;
		1218	}
		1219	}
		1220	}
		1221
1179	#if 0	1222	#if 0
1180	faces_obj [0] = top;	1223	faces_obj [0] = top;
1181	faces_obj [1] = middle;	1224	faces_obj [1] = middle;
1182	faces_obj [2] = floor;	1225	faces_obj [2] = floor;
1183	#endif	1226	#endif
1184	}	1227	}
1185		1228
1186	uint64
1187	mapspace::volume () const
1188	{
1189	uint64 vol = 0;
1190
1191	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1192	vol += op->volume ();
1193
1194	return vol;
1195	}
1196
1197	maptile *	1229	maptile *
1198	maptile::tile_available (int dir, bool load)	1230	maptile::tile_available (int dir, bool load)
1199	{	1231	{
1200	if (tile_path[dir])	1232	if (tile_path[dir])
1201	{	1233	{
		1234	// map is there and we don't need to load it OR it's loaded => return what we have
1202	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))	1235	if (tile_map[dir] && (!load \|\| tile_map[dir]->linkable ()))
1203	return tile_map[dir];	1236	return tile_map[dir];
1204		1237
		1238	// well, try to locate it then, if possible - maybe it's there already
1205	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))	1239	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1206	return tile_map[dir];	1240	return tile_map[dir];
1207	}	1241	}
1208		1242
1209	return 0;	1243	return 0;
…		…
1321	/**	1355	/**
1322	* Return whether map2 is adjacent to map1. If so, store the distance from	1356	* Return whether map2 is adjacent to map1. If so, store the distance from
1323	* map1 to map2 in dx/dy.	1357	* map1 to map2 in dx/dy.
1324	*/	1358	*/
1325	int	1359	int
1326	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1360	adjacent_map (maptile map1, maptile map2, int dx, int dy)
1327	{	1361	{
1328	if (!map1 \|\| !map2)	1362	if (!map1 \|\| !map2)
1329	return 0;	1363	return 0;
1330		1364
1331	//TODO: this doesn't actually check correctly when intermediate maps are not loaded	1365	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
…		…
1333	if (map1 == map2)	1367	if (map1 == map2)
1334	{	1368	{
1335	*dx = 0;	1369	*dx = 0;
1336	*dy = 0;	1370	*dy = 0;
1337	}	1371	}
1338	else if (map1->tile_map[0] == map2)	1372	else if (map1->tile_available (TILE_NORTH, false) == map2)
1339	{ /* up */	1373	{
1340	*dx = 0;	1374	*dx = 0;
1341	*dy = -map2->height;	1375	*dy = -map2->height;
1342	}	1376	}
1343	else if (map1->tile_map[1] == map2)	1377	else if (map1->tile_available (TILE_EAST , false) == map2)
1344	{ /* right */	1378	{
1345	*dx = map1->width;	1379	*dx = map1->width;
1346	*dy = 0;	1380	*dy = 0;
1347	}	1381	}
1348	else if (map1->tile_map[2] == map2)	1382	else if (map1->tile_available (TILE_SOUTH, false) == map2)
1349	{ /* down */	1383	{
1350	*dx = 0;	1384	*dx = 0;
1351	*dy = map1->height;	1385	*dy = map1->height;
1352	}	1386	}
1353	else if (map1->tile_map[3] == map2)	1387	else if (map1->tile_available (TILE_WEST , false) == map2)
1354	{ /* left */	1388	{
1355	*dx = -map2->width;	1389	*dx = -map2->width;
1356	*dy = 0;	1390	*dy = 0;
1357	}	1391	}
1358	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	1392	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1359	{ /* up right */	1393	{ /* up right */
1360	*dx = map1->tile_map[0]->width;	1394	*dx = +map1->tile_map[TILE_NORTH]->width;
1361	*dy = -map1->tile_map[0]->height;	1395	*dy = -map1->tile_map[TILE_NORTH]->height;
1362	}	1396	}
1363	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	1397	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1364	{ /* up left */	1398	{ /* up left */
1365	*dx = -map2->width;	1399	*dx = -map2->width;
1366	*dy = -map1->tile_map[0]->height;	1400	*dy = -map1->tile_map[TILE_NORTH]->height;
1367	}	1401	}
1368	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	1402	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1369	{ /* right up */	1403	{ /* right up */
1370	*dx = map1->width;	1404	*dx = +map1->width;
1371	*dy = -map2->height;	1405	*dy = -map2->height;
1372	}	1406	}
1373	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	1407	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1374	{ /* right down */	1408	{ /* right down */
1375	*dx = map1->width;	1409	*dx = +map1->width;
1376	*dy = map1->tile_map[1]->height;	1410	*dy = +map1->tile_map[TILE_EAST]->height;
1377	}	1411	}
1378	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	1412	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1379	{ /* down right */	1413	{ /* down right */
1380	*dx = map1->tile_map[2]->width;	1414	*dx = +map1->tile_map[TILE_SOUTH]->width;
1381	*dy = map1->height;	1415	*dy = +map1->height;
1382	}	1416	}
1383	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	1417	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1384	{ /* down left */	1418	{ /* down left */
1385	*dx = -map2->width;	1419	*dx = -map2->width;
1386	*dy = map1->height;	1420	*dy = +map1->height;
1387	}	1421	}
1388	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	1422	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1389	{ /* left up */	1423	{ /* left up */
1390	*dx = -map1->tile_map[3]->width;	1424	*dx = -map1->tile_map[TILE_WEST]->width;
1391	*dy = -map2->height;	1425	*dy = -map2->height;
1392	}	1426	}
1393	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	1427	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1394	{ /* left down */	1428	{ /* left down */
1395	*dx = -map1->tile_map[3]->width;	1429	*dx = -map1->tile_map[TILE_WEST]->width;
1396	*dy = map1->tile_map[3]->height;	1430	*dy = +map1->tile_map[TILE_WEST]->height;
1397	}	1431	}
1398	else	1432	else
1399	return 0;	1433	return 0;
1400		1434
1401	return 1;	1435	return 1;
…		…
1437	*	1471	*
1438	* currently, the only flag supported (0x1) is don't translate for	1472	* currently, the only flag supported (0x1) is don't translate for
1439	* closest body part of 'op1'	1473	* closest body part of 'op1'
1440	*/	1474	*/
1441	void	1475	void
1442	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1476	get_rangevector (object op1, object op2, rv_vector *retval, int flags)
1443	{	1477	{
1444	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1478	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1445	{	1479	{
1446	/* be conservative and fill in _some_ data */	1480	/* be conservative and fill in _some_ data */
1447	retval->distance = 10000;	1481	retval->distance = 10000;
1448	retval->distance_x = 10000;	1482	retval->distance_x = 10000;
1449	retval->distance_y = 10000;	1483	retval->distance_y = 10000;
1450	retval->direction = 0;	1484	retval->direction = 0;
1451	retval->part = 0;	1485	retval->part = 0;
1452	}	1486	}
1453	else	1487	else
1454	{	1488	{
1455	object *best;
1456
1457	retval->distance_x += op2->x - op1->x;	1489	retval->distance_x += op2->x - op1->x;
1458	retval->distance_y += op2->y - op1->y;	1490	retval->distance_y += op2->y - op1->y;
1459		1491
1460	best = op1;	1492	object *best = op1;
		1493
1461	/* If this is multipart, find the closest part now */	1494	/* If this is multipart, find the closest part now */
1462	if (!(flags & 0x1) && op1->more)	1495	if (!(flags & 1) && op1->more)
1463	{	1496	{
1464	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1497	int best_distance = idistance (retval->distance_x, retval->distance_y);
1465		1498
1466	/* we just take the offset of the piece to head to figure	1499	/* we just take the offset of the piece to head to figure
1467	* distance instead of doing all that work above again	1500	* distance instead of doing all that work above again
1468	* since the distance fields we set above are positive in the	1501	* since the distance fields we set above are positive in the
1469	* same axis as is used for multipart objects, the simply arithmetic	1502	* same axis as is used for multipart objects, the simply arithmetic
1470	* below works.	1503	* below works.
1471	*/	1504	*/
1472	for (object *tmp = op1->more; tmp; tmp = tmp->more)	1505	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1473	{	1506	{
1474	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1507	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1475	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1508
1476	if (tmpi < best_distance)	1509	if (tmpi < best_distance)
1477	{	1510	{
1478	best_distance = tmpi;	1511	best_distance = tmpi;
1479	best = tmp;	1512	best = tmp;
1480	}	1513	}
1481	}	1514	}
1482		1515
1483	if (best != op1)	1516	if (best != op1)
1484	{	1517	{
1485	retval->distance_x += op1->x - best->x;	1518	retval->distance_x += op1->x - best->x;
1486	retval->distance_y += op1->y - best->y;	1519	retval->distance_y += op1->y - best->y;
1487	}	1520	}
1488	}	1521	}
1489		1522
1490	retval->part = best;	1523	retval->part = best;
1491	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1524	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1492	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1525	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1493	}	1526	}
1494	}	1527	}
1495		1528
1496	/* this is basically the same as get_rangevector above, but instead of	1529	/* this is basically the same as get_rangevector above, but instead of
1497	* the first parameter being an object, it instead is the map	1530	* the first parameter being an object, it instead is the map
…		…
1502	* be more consistant with the above function and also in case they are needed	1535	* be more consistant with the above function and also in case they are needed
1503	* for something in the future. Also, since no object is pasted, the best	1536	* for something in the future. Also, since no object is pasted, the best
1504	* field of the rv_vector is set to NULL.	1537	* field of the rv_vector is set to NULL.
1505	*/	1538	*/
1506	void	1539	void
1507	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)	1540	get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1508	{	1541	{
1509	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1542	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1510	{	1543	{
1511	/* be conservative and fill in _some_ data */	1544	/* be conservative and fill in _some_ data */
1512	retval->distance = 100000;	1545	retval->distance = 100000;
1513	retval->distance_x = 32767;	1546	retval->distance_x = 32767;
1514	retval->distance_y = 32767;	1547	retval->distance_y = 32767;
1515	retval->direction = 0;	1548	retval->direction = 0;
1516	retval->part = 0;	1549	retval->part = 0;
1517	}	1550	}
1518	else	1551	else
1519	{	1552	{
1520	retval->distance_x += op2->x - x;	1553	retval->distance_x += op2->x - x;
1521	retval->distance_y += op2->y - y;	1554	retval->distance_y += op2->y - y;
1522		1555
1523	retval->part = NULL;	1556	retval->part = 0;
1524	retval->distance = idistance (retval->distance_x, retval->distance_y);	1557	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1525	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1558	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1526	}	1559	}
1527	}	1560	}
1528		1561
1529	/* Returns true of op1 and op2 are effectively on the same map	1562	/* Returns true of op1 and op2 are effectively on the same map
1530	* (as related to map tiling). Note that this looks for a path from	1563	* (as related to map tiling). Note that this looks for a path from
…		…
1540	int dx, dy;	1573	int dx, dy;
1541		1574
1542	return adjacent_map (op1->map, op2->map, &dx, &dy);	1575	return adjacent_map (op1->map, op2->map, &dx, &dy);
1543	}	1576	}
1544		1577
		1578	//-GPL
		1579
1545	object *	1580	object *
1546	maptile::insert (object op, int x, int y, object originator, int flags)	1581	maptile::insert (object op, int x, int y, object originator, int flags)
1547	{	1582	{
1548	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1583	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1549	}	1584	}
…		…
1560	if (default_region)	1595	if (default_region)
1561	return default_region;	1596	return default_region;
1562		1597
1563	return ::region::default_region ();	1598	return ::region::default_region ();
1564	}	1599	}
		1600
		1601	//+GPL
1565		1602
1566	/* picks a random object from a style map.	1603	/* picks a random object from a style map.
1567	*/	1604	*/
1568	object *	1605	object *
1569	maptile::pick_random_object (rand_gen &gen) const	1606	maptile::pick_random_object (rand_gen &gen) const
…		…
1576	*/	1613	*/
1577	for (int i = 1000; --i;)	1614	for (int i = 1000; --i;)
1578	{	1615	{
1579	object *pick = at (gen (width), gen (height)).bot;	1616	object *pick = at (gen (width), gen (height)).bot;
1580		1617
1581	// do not prefer big monsters just because they are big.	1618	// must be head: do not prefer big monsters just because they are big.
1582	if (pick && pick->is_head ())	1619	if (pick && pick->is_head ())
1583	return pick->head_ ();	1620	return pick;
1584	}	1621	}
1585		1622
1586	// instead of crashing in the unlikely(?) case, try to return something	1623	// instead of crashing in the unlikely(?) case, try to return something
1587	return archetype::find ("bug");	1624	return archetype::find (shstr_bug);
1588	}	1625	}
		1626
		1627	//-GPL
1589		1628
1590	void	1629	void
1591	maptile::play_sound (faceidx sound, int x, int y) const	1630	maptile::play_sound (faceidx sound, int x, int y) const
1592	{	1631	{
1593	if (!sound)	1632	if (!sound)
…		…
1620	if (distance <= MAX_SOUND_DISTANCE)	1659	if (distance <= MAX_SOUND_DISTANCE)
1621	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);	1660	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
1622	}	1661	}
1623	}	1662	}
1624		1663
		1664	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1665
1625	static void	1666	static void
1626	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)	1667	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1627	{	1668	{
1628	// clip to map to the left	1669	// clip to map to the left
1629	if (x0 < 0)	1670	if (x0 < 0)
1630	{	1671	{
1631	if (maptile *tile = m->tile_available (TILE_LEFT, 1))	1672	if (maptile *tile = m->tile_available (TILE_WEST, 1))
1632	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);	1673	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1633		1674
1634	if (x1 < 0) // entirely to the left	1675	if (x1 < 0) // entirely to the left
1635	return;	1676	return;
1636		1677
…		…
1638	}	1679	}
1639		1680
1640	// clip to map to the right	1681	// clip to map to the right
1641	if (x1 > m->width)	1682	if (x1 > m->width)
1642	{	1683	{
1643	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))	1684	if (maptile *tile = m->tile_available (TILE_EAST, 1))
1644	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);	1685	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1645		1686
1646	if (x0 > m->width) // entirely to the right	1687	if (x0 > m->width) // entirely to the right
1647	return;	1688	return;
1648		1689
…		…
1650	}	1691	}
1651		1692
1652	// clip to map above	1693	// clip to map above
1653	if (y0 < 0)	1694	if (y0 < 0)
1654	{	1695	{
1655	if (maptile *tile = m->tile_available (TILE_UP, 1))	1696	if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1656	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);	1697	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1657		1698
1658	if (y1 < 0) // entirely above	1699	if (y1 < 0) // entirely above
1659	return;	1700	return;
1660		1701
…		…
1662	}	1703	}
1663		1704
1664	// clip to map below	1705	// clip to map below
1665	if (y1 > m->height)	1706	if (y1 > m->height)
1666	{	1707	{
1667	if (maptile *tile = m->tile_available (TILE_DOWN, 1))	1708	if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1668	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);	1709	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1669		1710
1670	if (y0 > m->height) // entirely below	1711	if (y0 > m->height) // entirely below
1671	return;	1712	return;
1672		1713
…		…
1684	r->dx = dx;	1725	r->dx = dx;
1685	r->dy = dy;	1726	r->dy = dy;
1686	}	1727	}
1687		1728
1688	maprect *	1729	maprect *
1689	maptile::split_to_tiles (int x0, int y0, int x1, int y1)	1730	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1690	{	1731	{
1691	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1692	buf.clear ();	1732	buf.clear ();
1693		1733
1694	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);	1734	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1695		1735
1696	// add end marker	1736	// add end marker

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.157 by root, Thu Jan 8 19:23:44 2009 UTC vs. Revision 1.211 by root, Sat May 7 14:13:48 2011 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.157 by root, Thu Jan 8 19:23:44 2009 UTC vs.
Revision 1.211 by root, Sat May 7 14:13:48 2011 UTC