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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.140 by root, Sun May 4 20:40:52 2008 UTC vs.
Revision 1.188 by root, Fri Apr 16 02:32:25 2010 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 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
28	#include "loader.h"
29
30	#include "path.h"	28	#include "path.h"
		29
		30	//+GPL
		31
		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)
34	* it will also do map translation for tiled maps, returning	36	* it will also do map translation for tiled maps, returning
35	* new values into newmap, nx, and ny. Any and all of those	37	* new values into newmap, nx, and ny. Any and all of those
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, "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.bot; tmp; tmp = tmp->above)
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 but wizards.
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	152	&& tmp->head_ () != ob
159	&& tmp != ob	153	&& tmp != ob
160	&& tmp->type != DOOR	154	&& tmp->type != DOOR)
161	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
162	return 1;	155	return 1;
163	}	156	}
164
165	}	157	}
		158
166	return 0;	159	return 0;
167	}	160	}
168		161
169	/*	162	/*
170	* Returns qthe blocking object if the given object can't fit in the given	163	* Returns qthe blocking object if the given object can't fit in the given
…		…
222	}	215	}
223		216
224	return 0;	217	return 0;
225	}	218	}
226		219
227	/* When the map is loaded, load_object does not actually insert objects	220	//-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		221
254	void	222	void
255	maptile::set_object_flag (int flag, int value)	223	maptile::set_object_flag (int flag, int value)
256	{	224	{
257	if (!spaces)	225	if (!spaces)
…		…
259		227
260	for (mapspace *ms = spaces + size (); ms-- > spaces; )	228	for (mapspace *ms = spaces + size (); ms-- > spaces; )
261	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	229	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
262	tmp->flag [flag] = value;	230	tmp->flag [flag] = value;
263	}	231	}
		232
		233	void
		234	maptile::post_load_original ()
		235	{
		236	if (!spaces)
		237	return;
		238
		239	set_object_flag (FLAG_OBJ_ORIGINAL);
		240
		241	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		242	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		243	INVOKE_OBJECT (RESET, tmp);
		244	}
		245
		246	void
		247	maptile::post_load ()
		248	{
		249	#if 0
		250	if (!spaces)
		251	return;
		252
		253	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		254	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		255	; // nop
		256	#endif
		257	}
		258
		259	//+GPL
264		260
265	/* link_multipart_objects go through all the objects on the map looking	261	/* link_multipart_objects go through all the objects on the map looking
266	* for objects whose arch says they are multipart yet according to the	262	* for objects whose arch says they are multipart yet according to the
267	* info we have, they only have the head (as would be expected when	263	* info we have, they only have the head (as would be expected when
268	* they are saved).	264	* they are saved).
…		…
296	op = op->above;	292	op = op->above;
297	}	293	}
298	}	294	}
299	}	295	}
300		296
		297	//-GPL
		298
301	/*	299	/*
302	* Loads (ands parses) the objects into a given map from the specified	300	* Loads (ands parses) the objects into a given map from the specified
303	* file pointer.	301	* file pointer.
304	*/	302	*/
305	bool	303	bool
…		…
321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))	319	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322	{	320	{
323	// we insert manually because	321	// we insert manually because
324	// a) its way faster	322	// a) its way faster
325	// b) we remove manually, too, and there are good reasons for that	323	// b) we remove manually, too, and there are good reasons for that
326	// c) its correct	324	// c) it's correct
327	mapspace &ms = at (op->x, op->y);	325	mapspace &ms = at (op->x, op->y);
328		326
329	op->flag [FLAG_REMOVED] = false;	327	op->flag [FLAG_REMOVED] = false;
330		328
331	op->above = 0;	329	op->above = 0;
332	op->below = ms.top;	330	op->below = ms.top;
333		331
334	if (ms.top)
335	ms.top->above = op;	332	*(ms.top ? &ms.top->above : &ms.bot) = op;
336	else
337	ms.bot = op;
338		333
339	ms.top = op;	334	ms.top = op;
340	ms.flags_ = 0;	335	ms.flags_ = 0;
341	}	336	}
342	else	337	else
…		…
427	return false;	422	return false;
428		423
429	return freezer.save (path);	424	return freezer.save (path);
430	}	425	}
431		426
432	maptile::maptile ()	427	void
		428	maptile::init ()
433	{	429	{
434	in_memory = MAP_SWAPPED;	430	in_memory = MAP_SWAPPED;
435		431
436	/* The maps used to pick up default x and y values from the	432	/* The maps used to pick up default x and y values from the
437	* map archetype. Mimic that behaviour.	433	* map archetype. Mimic that behaviour.
438	*/	434	*/
439	width = 16;	435	width = 16;
440	height = 16;	436	height = 16;
441	timeout = 300;	437	timeout = 300;
442	max_nrof = 1000; // 1000 items of anything	438	max_items = MAX_ITEM_PER_ACTION;
443	max_volume = 2000000; // 2m³	439	max_volume = 2000000; // 2m³
444	}
445
446	maptile::maptile (int w, int h)
447	{
448	in_memory = MAP_SWAPPED;
449
450	width = w;
451	height = h;
452	reset_timeout = 0;	440	reset_timeout = 0;
453	timeout = 300;
454	enter_x = 0;	441	enter_x = 0;
455	enter_y = 0;	442	enter_y = 0;
		443	}
		444
		445	maptile::maptile ()
		446	{
		447	init ();
		448	}
		449
		450	maptile::maptile (int w, int h)
		451	{
		452	init ();
		453
		454	width = w;
		455	height = h;
456		456
457	alloc ();	457	alloc ();
458	}	458	}
459		459
460	/*	460	/*
…		…
468	if (spaces)	468	if (spaces)
469	return;	469	return;
470		470
471	spaces = salloc0<mapspace> (size ());	471	spaces = salloc0<mapspace> (size ());
472	}	472	}
		473
		474	//+GPL
473		475
474	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	476	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
475	* corresponding to that string. Memory is allocated for this, it must be freed	477	* corresponding to that string. Memory is allocated for this, it must be freed
476	* at a later date.	478	* at a later date.
477	* Called by parse_map_headers below.	479	* Called by parse_map_headers below.
…		…
554	return items;	556	return items;
555	}	557	}
556		558
557	/* opposite of parse string, this puts the string that was originally fed in to	559	/* opposite of parse string, this puts the string that was originally fed in to
558	* the map (or something equivilent) into output_string. */	560	* the map (or something equivilent) into output_string. */
559	static void	561	static const char *
560	print_shop_string (maptile m, char output_string)	562	print_shop_string (maptile *m)
561	{	563	{
562	int i;	564	static dynbuf_text buf; buf.clear ();
563	char tmp[MAX_BUF];
564		565
565	strcpy (output_string, "");
566	for (i = 0; i < m->shopitems[0].index; i++)	566	for (int i = 0; i < m->shopitems[0].index; i++)
567	{	567	{
568	if (m->shopitems[i].typenum)	568	if (m->shopitems[i].typenum)
569	{	569	{
570	if (m->shopitems[i].strength)	570	if (m->shopitems[i].strength)
571	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	571	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
572	else	572	else
573	sprintf (tmp, "%s;", m->shopitems[i].name);	573	buf.printf ("%s;", m->shopitems[i].name);
574	}	574	}
575	else	575	else
576	{	576	{
577	if (m->shopitems[i].strength)	577	if (m->shopitems[i].strength)
578	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	578	buf.printf ("*:%d;", m->shopitems[i].strength);
579	else	579	else
580	sprintf (tmp, "*");	580	buf.printf ("*");
581	}	581	}
582
583	strcat (output_string, tmp);
584	}	582	}
		583
		584	return buf;
585	}	585	}
		586
		587	//-GPL
586		588
587	/* This loads the header information of the map. The header	589	/* This loads the header information of the map. The header
588	* contains things like difficulty, size, timeout, etc.	590	* contains things like difficulty, size, timeout, etc.
589	* this used to be stored in the map object, but with the	591	* this used to be stored in the map object, but with the
590	* addition of tiling, fields beyond that easily named in an	592	* addition of tiling, fields beyond that easily named in an
…		…
631	case KW_shopgreed: thawer.get (shopgreed); break;	633	case KW_shopgreed: thawer.get (shopgreed); break;
632	case KW_shopmin: thawer.get (shopmin); break;	634	case KW_shopmin: thawer.get (shopmin); break;
633	case KW_shopmax: thawer.get (shopmax); break;	635	case KW_shopmax: thawer.get (shopmax); break;
634	case KW_shoprace: thawer.get (shoprace); break;	636	case KW_shoprace: thawer.get (shoprace); break;
635	case KW_outdoor: thawer.get (outdoor); break;	637	case KW_outdoor: thawer.get (outdoor); break;
636	case KW_temp: thawer.get (temp); break;
637	case KW_pressure: thawer.get (pressure); break;
638	case KW_humid: thawer.get (humid); break;
639	case KW_windspeed: thawer.get (windspeed); break;
640	case KW_winddir: thawer.get (winddir); break;
641	case KW_sky: thawer.get (sky); break;
642		638
643	case KW_per_player: thawer.get (per_player); break;	639	case KW_per_player: thawer.get (per_player); break;
644	case KW_per_party: thawer.get (per_party); break;	640	case KW_per_party: thawer.get (per_party); break;
645	case KW_no_reset: thawer.get (no_reset); break;	641	case KW_no_reset: thawer.get (no_reset); break;
		642	case KW_no_drop: thawer.get (no_drop); break;
646		643
647	case KW_region: default_region = region::find (thawer.get_str ()); break;	644	case KW_region: default_region = region::find (thawer.get_str ()); break;
648	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	645	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
649		646
650	// old names new names	647	// old names new names
…		…
670	case KW_end:	667	case KW_end:
671	thawer.next ();	668	thawer.next ();
672	return true;	669	return true;
673		670
674	default:	671	default:
675	if (!thawer.parse_error ("map", 0))	672	if (!thawer.parse_error ("map"))
676	return false;	673	return false;
677	break;	674	break;
678	}	675	}
679		676
680	thawer.next ();	677	thawer.next ();
681	}	678	}
682		679
683	abort ();	680	abort ();
684	}	681	}
		682
		683	//+GPL
685		684
686	/******************************************************************************	685	/******************************************************************************
687	* This is the start of unique map handling code	686	* This is the start of unique map handling code
688	*****************************************************************************/	687	*****************************************************************************/
689		688
…		…
696	int unique = 0;	695	int unique = 0;
697	for (object *op = spaces [i].bot; op; )	696	for (object *op = spaces [i].bot; op; )
698	{	697	{
699	object *above = op->above;	698	object *above = op->above;
700		699
701	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	700	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
702	unique = 1;	701	unique = 1;
703		702
704	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	703	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] \|\| unique))
705	{
706	op->destroy_inv (false);
707	op->destroy ();	704	op->destroy ();
708	}
709		705
710	op = above;	706	op = above;
711	}	707	}
712	}	708	}
713	}	709	}
714		710
		711	//-GPL
		712
715	bool	713	bool
716	maptile::_save_header (object_freezer &freezer)	714	maptile::_save_header (object_freezer &freezer)
717	{	715	{
718	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	716	#define MAP_OUT(k) freezer.put (KW(k), k)
719	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	717	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
720		718
721	MAP_OUT2 (arch, "map");	719	MAP_OUT2 (arch, CS(map));
722		720
723	if (name) MAP_OUT (name);	721	if (name) MAP_OUT (name);
724	MAP_OUT (swap_time);	722	MAP_OUT (swap_time);
725	MAP_OUT (reset_time);	723	MAP_OUT (reset_time);
726	MAP_OUT (reset_timeout);	724	MAP_OUT (reset_timeout);
727	MAP_OUT (fixed_resettime);	725	MAP_OUT (fixed_resettime);
728	MAP_OUT (no_reset);	726	MAP_OUT (no_reset);
		727	MAP_OUT (no_drop);
729	MAP_OUT (difficulty);	728	MAP_OUT (difficulty);
730
731	if (default_region) MAP_OUT2 (region, default_region->name);	729	if (default_region) MAP_OUT2 (region, default_region->name);
732		730
733	if (shopitems)	731	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
734	{
735	char shop[MAX_BUF];
736	print_shop_string (this, shop);
737	MAP_OUT2 (shopitems, shop);
738	}
739
740	MAP_OUT (shopgreed);	732	MAP_OUT (shopgreed);
741	MAP_OUT (shopmin);	733	MAP_OUT (shopmin);
742	MAP_OUT (shopmax);	734	MAP_OUT (shopmax);
743	if (shoprace) MAP_OUT (shoprace);	735	if (shoprace) MAP_OUT (shoprace);
744	MAP_OUT (darkness);	736
745	MAP_OUT (width);	737	MAP_OUT (width);
746	MAP_OUT (height);	738	MAP_OUT (height);
747	MAP_OUT (enter_x);	739	MAP_OUT (enter_x);
748	MAP_OUT (enter_y);	740	MAP_OUT (enter_y);
749		741	MAP_OUT (darkness);
750	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
751	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
752
753	MAP_OUT (outdoor);	742	MAP_OUT (outdoor);
754	MAP_OUT (temp);	743
755	MAP_OUT (pressure);	744	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
756	MAP_OUT (humid);	745	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
757	MAP_OUT (windspeed);
758	MAP_OUT (winddir);
759	MAP_OUT (sky);
760		746
761	MAP_OUT (per_player);	747	MAP_OUT (per_player);
762	MAP_OUT (per_party);	748	MAP_OUT (per_party);
763		749
764	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	750	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
765	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	751	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
766	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	752	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
767	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	753	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
768		754
769	freezer.put (this);	755	freezer.put (this);
770	freezer.put (KW_end);	756	freezer.put (KW(end));
771		757
772	return true;	758	return true;
773	}	759	}
774		760
775	bool	761	bool
…		…
780	if (!_save_header (freezer))	766	if (!_save_header (freezer))
781	return false;	767	return false;
782		768
783	return freezer.save (path);	769	return freezer.save (path);
784	}	770	}
		771
		772	//+GPL
785		773
786	/*	774	/*
787	* Remove and free all objects in the given map.	775	* Remove and free all objects in the given map.
788	*/	776	*/
789	void	777	void
…		…
800		788
801	op->flag [FLAG_REMOVED] = true;	789	op->flag [FLAG_REMOVED] = true;
802		790
803	object *head = op->head_ ();	791	object *head = op->head_ ();
804	if (op == head)	792	if (op == head)
805	{
806	op->destroy_inv (false);
807	op->destroy ();	793	op->destroy ();
808	}
809	else if (head->map != op->map)	794	else if (head->map != op->map)
810	{	795	{
811	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());	796	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
812	head->destroy ();	797	head->destroy ();
813	}	798	}
…		…
861		846
862	clear ();	847	clear ();
863	}	848	}
864		849
865	/* decay and destroy perishable items in a map */	850	/* decay and destroy perishable items in a map */
		851	// TODO: should be done regularly, not on map load?
866	void	852	void
867	maptile::do_decay_objects ()	853	maptile::do_decay_objects ()
868	{	854	{
869	if (!spaces)	855	if (!spaces)
870	return;	856	return;
…		…
872	for (mapspace *ms = spaces + size (); ms-- > spaces; )	858	for (mapspace *ms = spaces + size (); ms-- > spaces; )
873	for (object above, op = ms->bot; op; op = above)	859	for (object above, op = ms->bot; op; op = above)
874	{	860	{
875	above = op->above;	861	above = op->above;
876		862
		863	// do not decay anything above unique floor tiles (yet :)
		864	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		865	break;
		866
877	bool destroy = 0;	867	bool destroy = 0;
878		868
879	// do not decay anything above unique floor tiles (yet :)	869	if (op->flag [FLAG_IS_FLOOR]
880	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	870	\|\| op->flag [FLAG_OBJ_ORIGINAL]
881	break;	871	\|\| op->flag [FLAG_UNIQUE]
882		872	\|\| op->flag [FLAG_OVERLAY_FLOOR]
883	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	873	\|\| op->flag [FLAG_UNPAID]
884	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
885	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
886	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
887	\|\| QUERY_FLAG (op, FLAG_UNPAID)
888	\|\| op->is_alive ())	874	\|\| op->is_alive ())
889	; // do not decay	875	; // do not decay
890	else if (op->is_weapon ())	876	else if (op->is_weapon ())
891	{	877	{
892	op->stats.dam--;	878	op->stats.dam--;
…		…
917	\|\| mat & M_LIQUID	903	\|\| mat & M_LIQUID
918	\|\| (mat & M_IRON && rndm (1, 5) == 1)	904	\|\| (mat & M_IRON && rndm (1, 5) == 1)
919	\|\| (mat & M_GLASS && rndm (1, 2) == 1)	905	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
920	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)	906	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
921	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)	907	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
922	\|\| (mat & M_ICE && temp > 32))	908	//\|\| (mat & M_ICE && temp > 32)
		909	)
923	destroy = 1;	910	destroy = 1;
924	}	911	}
925		912
926	/* adjust overall chance below */	913	/* adjust overall chance below */
927	if (destroy && rndm (0, 1))	914	if (destroy && rndm (0, 1))
928	op->destroy ();	915	op->destroy ();
929	}
930	}
931
932	/*
933	* Updates every button on the map (by calling update_button() for them).
934	*/
935	void
936	maptile::update_buttons ()
937	{
938	for (oblinkpt *obp = buttons; obp; obp = obp->next)
939	for (objectlink *ol = obp->link; ol; ol = ol->next)
940	{
941	if (!ol->ob)
942	{
943	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
944	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
945	continue;
946	}
947
948	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
949	{
950	update_button (ol->ob);
951	break;
952	}
953	}	916	}
954	}	917	}
955		918
956	/*	919	/*
957	* This routine is supposed to find out the difficulty of the map.	920	* This routine is supposed to find out the difficulty of the map.
958	* difficulty does not have a lot to do with character level,	921	* difficulty does not have a lot to do with character level,
959	* but does have a lot to do with treasure on the map.	922	* but does have a lot to do with treasure on the map.
960	*	923	*
961	* Difficulty can now be set by the map creature. If the value stored	924	* Difficulty can now be set by the map creator. If the value stored
962	* in the map is zero, then use this routine. Maps should really	925	* in the map is zero, then use this routine. Maps should really
963	* have a difficulty set than using this function - human calculation	926	* have a difficulty set rather than using this function - human calculation
964	* is much better than this functions guesswork.	927	* is much better than this function's guesswork.
965	*/	928	*/
966	int	929	int
967	maptile::estimate_difficulty () const	930	maptile::estimate_difficulty () const
968	{	931	{
969	long monster_cnt = 0;	932	long monster_cnt = 0;
…		…
971	sint64 total_exp = 0;	934	sint64 total_exp = 0;
972		935
973	for (mapspace *ms = spaces + size (); ms-- > spaces; )	936	for (mapspace *ms = spaces + size (); ms-- > spaces; )
974	for (object *op = ms->bot; op; op = op->above)	937	for (object *op = ms->bot; op; op = op->above)
975	{	938	{
976	if (QUERY_FLAG (op, FLAG_MONSTER))	939	if (op->flag [FLAG_MONSTER])
977	{	940	{
978	total_exp += op->stats.exp;	941	total_exp += op->stats.exp;
979	monster_cnt++;	942	monster_cnt++;
980	}	943	}
981		944
982	if (QUERY_FLAG (op, FLAG_GENERATOR))	945	if (op->flag [FLAG_GENERATOR])
983	{	946	{
984	total_exp += op->stats.exp;	947	total_exp += op->stats.exp;
985		948
986	if (archetype *at = op->other_arch)	949	if (archetype *at = op->other_arch)
987	{	950	{
…		…
1014	* postive values make it darker, negative make it brighter	977	* postive values make it darker, negative make it brighter
1015	*/	978	*/
1016	int	979	int
1017	maptile::change_map_light (int change)	980	maptile::change_map_light (int change)
1018	{	981	{
1019	int new_level = darkness + change;
1020
1021	/* Nothing to do */	982	/* Nothing to do */
1022	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	983	if (!change)
1023	return 0;	984	return 0;
1024		985
1025	/* inform all players on the map */	986	/* inform all players on the map */
1026	if (change > 0)	987	if (change > 0)
1027	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	988	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1028	else	989	else
1029	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	990	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1030		991
1031	/* Do extra checking. since darkness is a unsigned value,	992	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1032	* we need to be extra careful about negative values.
1033	* In general, the checks below are only needed if change
1034	* is not +/-1
1035	*/
1036	if (new_level < 0)
1037	darkness = 0;
1038	else if (new_level >= MAX_DARKNESS)
1039	darkness = MAX_DARKNESS;
1040	else
1041	darkness = new_level;
1042		993
1043	/* All clients need to get re-updated for the change */	994	/* All clients need to get re-updated for the change */
1044	update_all_map_los (this);	995	update_all_map_los (this);
		996
1045	return 1;	997	return 1;
1046	}	998	}
1047		999
1048	/*	1000	/*
1049	* This function updates various attributes about a specific space	1001	* This function updates various attributes about a specific space
…		…
1052	* through, etc)	1004	* through, etc)
1053	*/	1005	*/
1054	void	1006	void
1055	mapspace::update_ ()	1007	mapspace::update_ ()
1056	{	1008	{
1057	object tmp, last = 0;	1009	object *last = 0;
1058	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1010	uint8 flags = P_UPTODATE;
		1011	sint8 light = 0;
1059	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1012	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1013	uint64_t volume = 0;
		1014	uint32_t items = 0;
		1015	object *anywhere = 0;
		1016	uint8_t middle_visibility = 0;
1060		1017
1061	//object *middle = 0;	1018	//object *middle = 0;
1062	//object *top = 0;	1019	//object *top = 0;
1063	//object *floor = 0;	1020	//object *floor = 0;
1064	// this seems to generate better code than using locals, above	1021	// this seems to generate better code than using locals, above
1065	object *&top = faces_obj[0] = 0;	1022	object *&top = faces_obj[0] = 0;
1066	object *&middle = faces_obj[1] = 0;	1023	object *&middle = faces_obj[1] = 0;
1067	object *&floor = faces_obj[2] = 0;	1024	object *&floor = faces_obj[2] = 0;
1068		1025
		1026	object::flags_t allflags; // all flags of all objects or'ed together
		1027
1069	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1028	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1070	{	1029	{
1071	/* This could be made additive I guess (two lights better than	1030	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1072	* one). But if so, it shouldn't be a simple additive - 2
1073	* light bulbs do not illuminate twice as far as once since
1074	* it is a dissapation factor that is cubed.
1075	*/
1076	light = max (light, tmp->glow_radius);	1031	light += tmp->glow_radius;
1077		1032
1078	/* This call is needed in order to update objects the player	1033	/* This call is needed in order to update objects the player
1079	* is standing in that have animations (ie, grass, fire, etc).	1034	* is standing in that have animations (ie, grass, fire, etc).
1080	* However, it also causes the look window to be re-drawn	1035	* However, it also causes the look window to be re-drawn
1081	* 3 times each time the player moves, because many of the	1036	* 3 times each time the player moves, because many of the
1082	* functions the move_player calls eventualy call this.	1037	* functions the move_player calls eventualy call this.
1083	*	1038	*
1084	* Always put the player down for drawing.	1039	* Always put the player down for drawing.
1085	*/	1040	*/
1086	if (!tmp->invisible)	1041	if (expect_true (!tmp->invisible))
1087	{	1042	{
1088	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1043	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1089	top = tmp;	1044	top = tmp;
1090	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1045	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1091	{	1046	{
1092	/* If we got a floor, that means middle and top were below it,	1047	/* If we got a floor, that means middle and top were below it,
1093	* so should not be visible, so we clear them.	1048	* so should not be visible, so we clear them.
1094	*/	1049	*/
1095	middle = 0;	1050	middle = 0;
1096	top = 0;	1051	top = 0;
1097	floor = tmp;	1052	floor = tmp;
		1053	volume = 0;
		1054	items = 0;
1098	}	1055	}
1099	/* Flag anywhere have high priority */	1056	else
1100	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1101	{	1057	{
		1058	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1059	{
		1060	++items;
		1061	volume += tmp->volume ();
		1062	}
		1063
		1064	/* Flag anywhere have high priority */
		1065	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1066	anywhere = tmp;
		1067
		1068	/* Find the highest visible face around. If equal
		1069	* visibilities, we still want the one nearer to the
		1070	* top
		1071	*/
		1072	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
		1073	{
		1074	middle_visibility = ::faces [tmp->face].visibility;
1102	middle = tmp;	1075	middle = tmp;
1103	anywhere = 1;	1076	}
1104	}	1077	}
1105	/* Find the highest visible face around. If equal
1106	* visibilities, we still want the one nearer to the
1107	* top
1108	*/
1109	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1110	middle = tmp;
1111	}
1112
1113	if (tmp == tmp->above)
1114	{
1115	LOG (llevError, "Error in structure of map\n");
1116	exit (-1);
1117	}	1078	}
1118		1079
1119	move_slow \|= tmp->move_slow;	1080	move_slow \|= tmp->move_slow;
1120	move_block \|= tmp->move_block;	1081	move_block \|= tmp->move_block;
1121	move_on \|= tmp->move_on;	1082	move_on \|= tmp->move_on;
1122	move_off \|= tmp->move_off;	1083	move_off \|= tmp->move_off;
1123	move_allow \|= tmp->move_allow;	1084	move_allow \|= tmp->move_allow;
1124		1085
1125	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1086	allflags \|= tmp->flag;
1126	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1087
1127	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1088	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1128	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1089	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1129	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1130	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1131	}	1090	}
1132		1091
1133	this->light = light;	1092	// FLAG_SEE_ANYWHERE takes precedence
		1093	if (anywhere)
		1094	middle = anywhere;
		1095
		1096	// ORing all flags together and checking them here is much faster
		1097	if (allflags [FLAG_BLOCKSVIEW]) flags \|= P_BLOCKSVIEW;
		1098	if (allflags [FLAG_NO_MAGIC] ) flags \|= P_NO_MAGIC;
		1099	if (allflags [FLAG_ALIVE] ) flags \|= P_IS_ALIVE;
		1100	if (allflags [FLAG_DAMNED] ) flags \|= P_NO_CLERIC;
		1101
		1102	this->light = min (light, MAX_LIGHT_RADIUS);
1134	this->flags_ = flags;	1103	this->flags_ = flags;
1135	this->move_block = move_block & ~move_allow;	1104	this->move_block = move_block & ~move_allow;
1136	this->move_on = move_on;	1105	this->move_on = move_on;
1137	this->move_off = move_off;	1106	this->move_off = move_off;
1138	this->move_slow = move_slow;	1107	this->move_slow = move_slow;
		1108	this->volume_ = (volume + 1023) / 1024;
		1109	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1139		1110
1140	/* At this point, we have a floor face (if there is a floor),	1111	/* At this point, we have a floor face (if there is a floor),
1141	* and the floor is set - we are not going to touch it at	1112	* and the floor is set - we are not going to touch it at
1142	* this point.	1113	* this point.
1143	* middle contains the highest visibility face.	1114	* middle contains the highest visibility face.
…		…
1158	* 1) top face is set, need middle to be set.	1129	* 1) top face is set, need middle to be set.
1159	* 2) middle is set, need to set top.	1130	* 2) middle is set, need to set top.
1160	* 3) neither middle or top is set - need to set both.	1131	* 3) neither middle or top is set - need to set both.
1161	*/	1132	*/
1162		1133
1163	for (tmp = last; tmp; tmp = tmp->below)	1134	for (object *tmp = last; tmp; tmp = tmp->below)
1164	{	1135	{
1165	/* Once we get to a floor, stop, since we already have a floor object */	1136	/* Once we get to a floor, stop, since we already have a floor object */
1166	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1137	if (tmp->flag [FLAG_IS_FLOOR])
1167	break;	1138	break;
1168		1139
1169	/* If two top faces are already set, quit processing */	1140	/* If two top faces are already set, quit processing */
1170	if (top && middle)	1141	if (top && middle)
1171	break;	1142	break;
…		…
1209	faces_obj [1] = middle;	1180	faces_obj [1] = middle;
1210	faces_obj [2] = floor;	1181	faces_obj [2] = floor;
1211	#endif	1182	#endif
1212	}	1183	}
1213		1184
1214	uint64	1185	maptile *
1215	mapspace::volume () const
1216	{
1217	uint64 vol = 0;
1218
1219	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1220	vol += op->volume ();
1221
1222	return vol;
1223	}
1224
1225	bool
1226	maptile::tile_available (int dir, bool load)	1186	maptile::tile_available (int dir, bool load)
1227	{	1187	{
1228	if (!tile_path[dir])	1188	if (tile_path[dir])
1229	return 0;	1189	{
1230
1231	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))	1190	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
1232	return 1;	1191	return tile_map[dir];
1233		1192
1234	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))	1193	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1235	return 1;	1194	return tile_map[dir];
		1195	}
1236		1196
1237	return 0;	1197	return 0;
1238	}	1198	}
1239		1199
1240	/* this returns TRUE if the coordinates (x,y) are out of	1200	/* this returns TRUE if the coordinates (x,y) are out of
…		…
1465	*	1425	*
1466	* currently, the only flag supported (0x1) is don't translate for	1426	* currently, the only flag supported (0x1) is don't translate for
1467	* closest body part of 'op1'	1427	* closest body part of 'op1'
1468	*/	1428	*/
1469	void	1429	void
1470	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1430	get_rangevector (object op1, object op2, rv_vector *retval, int flags)
1471	{	1431	{
1472	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1432	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1473	{	1433	{
1474	/* be conservative and fill in _some_ data */	1434	/* be conservative and fill in _some_ data */
1475	retval->distance = 10000;	1435	retval->distance = 10000;
…		…
1478	retval->direction = 0;	1438	retval->direction = 0;
1479	retval->part = 0;	1439	retval->part = 0;
1480	}	1440	}
1481	else	1441	else
1482	{	1442	{
1483	object *best;
1484
1485	retval->distance_x += op2->x - op1->x;	1443	retval->distance_x += op2->x - op1->x;
1486	retval->distance_y += op2->y - op1->y;	1444	retval->distance_y += op2->y - op1->y;
1487		1445
1488	best = op1;	1446	object *best = op1;
		1447
1489	/* If this is multipart, find the closest part now */	1448	/* If this is multipart, find the closest part now */
1490	if (!(flags & 0x1) && op1->more)	1449	if (!(flags & 1) && op1->more)
1491	{	1450	{
1492	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1451	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1493		1452
1494	/* we just take the offset of the piece to head to figure	1453	/* we just take the offset of the piece to head to figure
1495	* distance instead of doing all that work above again	1454	* distance instead of doing all that work above again
…		…
1546	else	1505	else
1547	{	1506	{
1548	retval->distance_x += op2->x - x;	1507	retval->distance_x += op2->x - x;
1549	retval->distance_y += op2->y - y;	1508	retval->distance_y += op2->y - y;
1550		1509
1551	retval->part = NULL;	1510	retval->part = 0;
1552	retval->distance = idistance (retval->distance_x, retval->distance_y);	1511	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1553	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1512	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1554	}	1513	}
1555	}	1514	}
1556		1515
1557	/* Returns true of op1 and op2 are effectively on the same map	1516	/* Returns true of op1 and op2 are effectively on the same map
…		…
1568	int dx, dy;	1527	int dx, dy;
1569		1528
1570	return adjacent_map (op1->map, op2->map, &dx, &dy);	1529	return adjacent_map (op1->map, op2->map, &dx, &dy);
1571	}	1530	}
1572		1531
		1532	//-GPL
		1533
1573	object *	1534	object *
1574	maptile::insert (object op, int x, int y, object originator, int flags)	1535	maptile::insert (object op, int x, int y, object originator, int flags)
1575	{	1536	{
1576	if (!op->flag [FLAG_REMOVED])
1577	op->remove ();
1578
1579	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1537	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1580	}	1538	}
1581		1539
1582	region *	1540	region *
1583	maptile::region (int x, int y) const	1541	maptile::region (int x, int y) const
…		…
1591	if (default_region)	1549	if (default_region)
1592	return default_region;	1550	return default_region;
1593		1551
1594	return ::region::default_region ();	1552	return ::region::default_region ();
1595	}	1553	}
		1554
		1555	//+GPL
1596		1556
1597	/* picks a random object from a style map.	1557	/* picks a random object from a style map.
1598	*/	1558	*/
1599	object *	1559	object *
1600	maptile::pick_random_object (rand_gen &gen) const	1560	maptile::pick_random_object (rand_gen &gen) const
…		…
1607	*/	1567	*/
1608	for (int i = 1000; --i;)	1568	for (int i = 1000; --i;)
1609	{	1569	{
1610	object *pick = at (gen (width), gen (height)).bot;	1570	object *pick = at (gen (width), gen (height)).bot;
1611		1571
1612	// do not prefer big monsters just because they are big.	1572	// must be head: do not prefer big monsters just because they are big.
1613	if (pick && pick->is_head ())	1573	if (pick && pick->is_head ())
1614	return pick->head_ ();	1574	return pick;
1615	}	1575	}
1616		1576
1617	// instead of crashing in the unlikely(?) case, try to return something	1577	// instead of crashing in the unlikely(?) case, try to return something
1618	return archetype::find ("bug");	1578	return archetype::find (shstr_bug);
1619	}	1579	}
		1580
		1581	//-GPL
1620		1582
1621	void	1583	void
1622	maptile::play_sound (faceidx sound, int x, int y) const	1584	maptile::play_sound (faceidx sound, int x, int y) const
1623	{	1585	{
1624	if (!sound)	1586	if (!sound)
1625	return;	1587	return;
1626		1588
		1589	for_all_players_on_map (pl, this)
		1590	if (client *ns = pl->ns)
		1591	{
		1592	int dx = x - pl->ob->x;
		1593	int dy = y - pl->ob->y;
		1594
		1595	int distance = idistance (dx, dy);
		1596
		1597	if (distance <= MAX_SOUND_DISTANCE)
		1598	ns->play_sound (sound, dx, dy);
		1599	}
		1600	}
		1601
		1602	void
		1603	maptile::say_msg (const char *msg, int x, int y) const
		1604	{
1627	for_all_players (pl)	1605	for_all_players (pl)
1628	if (pl->ob->map == this)
1629	if (client *ns = pl->ns)	1606	if (client *ns = pl->ns)
1630	{	1607	{
1631	int dx = x - pl->ob->x;	1608	int dx = x - pl->ob->x;
1632	int dy = y - pl->ob->y;	1609	int dy = y - pl->ob->y;
1633		1610
1634	int distance = idistance (dx, dy);	1611	int distance = idistance (dx, dy);
1635		1612
1636	if (distance <= MAX_SOUND_DISTANCE)	1613	if (distance <= MAX_SOUND_DISTANCE)
1637	ns->play_sound (sound, dx, dy);	1614	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
1638	}	1615	}
1639	}	1616	}
1640		1617
		1618	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1619
		1620	static void
		1621	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1622	{
		1623	// clip to map to the left
		1624	if (x0 < 0)
		1625	{
		1626	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1627	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1628
		1629	if (x1 < 0) // entirely to the left
		1630	return;
		1631
		1632	x0 = 0;
		1633	}
		1634
		1635	// clip to map to the right
		1636	if (x1 > m->width)
		1637	{
		1638	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1639	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1640
		1641	if (x0 > m->width) // entirely to the right
		1642	return;
		1643
		1644	x1 = m->width;
		1645	}
		1646
		1647	// clip to map above
		1648	if (y0 < 0)
		1649	{
		1650	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1651	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1652
		1653	if (y1 < 0) // entirely above
		1654	return;
		1655
		1656	y0 = 0;
		1657	}
		1658
		1659	// clip to map below
		1660	if (y1 > m->height)
		1661	{
		1662	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1663	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1664
		1665	if (y0 > m->height) // entirely below
		1666	return;
		1667
		1668	y1 = m->height;
		1669	}
		1670
		1671	// if we get here, the rect is within the current map
		1672	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1673
		1674	r->m = m;
		1675	r->x0 = x0;
		1676	r->y0 = y0;
		1677	r->x1 = x1;
		1678	r->y1 = y1;
		1679	r->dx = dx;
		1680	r->dy = dy;
		1681	}
		1682
		1683	maprect *
		1684	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
		1685	{
		1686	buf.clear ();
		1687
		1688	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1689
		1690	// add end marker
		1691	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1692	r->m = 0;
		1693
		1694	return (maprect *)buf.linearise ();
		1695	}
		1696

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.140 by root, Sun May 4 20:40:52 2008 UTC vs. Revision 1.188 by root, Fri Apr 16 02:32:25 2010 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.140 by root, Sun May 4 20:40:52 2008 UTC vs.
Revision 1.188 by root, Fri Apr 16 02:32:25 2010 UTC