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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.173 by root, Mon Nov 9 18:47:56 2009 UTC vs.
Revision 1.206 by root, Wed May 4 16:12:15 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,2009 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 it under	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the	9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.	11	* option) any later version.
23	*/	23	*/
24		24
25	#include <unistd.h>	25	#include <unistd.h>
26		26
27	#include "global.h"	27	#include "global.h"
28	#include "loader.h"
29	#include "path.h"	28	#include "path.h"
30		29
31	//+GPL	30	//+GPL
32		31
33	sint8 maptile::outdoor_darkness;	32	sint8 maptile::outdoor_darkness;
…		…
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	mapspace &ms = m->at (sx, sy);	86	mapspace &ms = m->at (sx, sy);
88		87
…		…
91		90
92	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
93	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
94	* things we need to do for players.	93	* things we need to do for players.
95	*/	94	*/
96	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
97	return 0;	96	return 0;
98		97
99	/* if there isn't anything alive on this space, and this space isn't	98	/* if there isn't anything alive on this space, and this space isn't
100	* 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
101	* 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
…		…
111	/* 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
112	* 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
113	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
114	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
115	*/	114	*/
116	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
117	{	116	{
118	if (OB_MOVE_BLOCK (ob, tmp))	117	if (OB_MOVE_BLOCK (ob, tmp))
119	{	118	{
120	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
121	if (RESULT_INT (0))	120	if (RESULT_INT (0))
…		…
145	return 1; // unconditional block	144	return 1; // unconditional block
146		145
147	} else {	146	} else {
148	// space does not block the ob, directly, but	147	// space does not block the ob, directly, but
149	// anything alive that is not a door still	148	// anything alive that is not a door still
150	// blocks anything but wizards.	149	// blocks anything
151		150
152	if (tmp->flag [FLAG_ALIVE]	151	if (tmp->flag [FLAG_ALIVE]
153	&& tmp->head_ () != ob
154	&& tmp != ob
155	&& tmp->type != DOOR	152	&& tmp->type != DOOR
156	&& !tmp->flag [FLAG_WIZPASS])	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
157	return 1;	154	return 1;
158	}	155	}
159	}	156	}
160		157
161	return 0;	158	return 0;
162	}	159	}
163		160
164	/*	161	/*
165	* 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
166	* 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,
167	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
168	* 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
169	* object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
170	*	167	*
…		…
217	}	214	}
218		215
219	return 0;	216	return 0;
220	}	217	}
221		218
222	/* When the map is loaded, load_object does not actually insert objects
223	* into inventory, but just links them. What this does is go through
224	* and insert them properly.
225	* The object 'container' is the object that contains the inventory.
226	* This is needed so that we can update the containers weight.
227	*/
228	static void
229	fix_container (object *container)
230	{
231	object tmp = container->inv, next;
232
233	container->inv = 0;
234	while (tmp)
235	{
236	next = tmp->below;
237	if (tmp->inv)
238	fix_container (tmp);
239
240	insert_ob_in_ob (tmp, container);
241	tmp = next;
242	}
243
244	// go through and calculate what all the containers are carrying.
245	//TODO: remove
246	container->update_weight ();
247	}
248
249	//-GPL	219	//-GPL
250		220
251	void	221	void
252	maptile::set_object_flag (int flag, int value)	222	maptile::set_object_flag (int flag, int value)
253	{	223	{
…		…
268	set_object_flag (FLAG_OBJ_ORIGINAL);	238	set_object_flag (FLAG_OBJ_ORIGINAL);
269		239
270	for (mapspace *ms = spaces + size (); ms-- > spaces; )	240	for (mapspace *ms = spaces + size (); ms-- > spaces; )
271	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	241	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
272	INVOKE_OBJECT (RESET, tmp);	242	INVOKE_OBJECT (RESET, tmp);
		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
273	}	256	}
274		257
275	//+GPL	258	//+GPL
276		259
277	/* 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
…		…
328	case KW_arch:	311	case KW_arch:
329	if (object *op = object::read (f, this))	312	if (object *op = object::read (f, this))
330	{	313	{
331	// TODO: why?	314	// TODO: why?
332	if (op->inv)	315	if (op->inv)
		316	{
		317	op->carrying = 0;
333	op->update_weight ();	318	op->update_weight ();
		319	}
334		320
335	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))
336	{	322	{
337	// we insert manually because	323	// we insert manually because
338	// a) its way faster	324	// a) its way faster
…		…
375	}	361	}
376		362
377	void	363	void
378	maptile::activate ()	364	maptile::activate ()
379	{	365	{
380	if (spaces)	366	if (state != MAP_INACTIVE)
		367	return;
		368
381	for (mapspace *ms = spaces + size (); ms-- > spaces; )	369	for (mapspace *ms = spaces + size (); ms-- > spaces; )
382	for (object *op = ms->bot; op; op = op->above)	370	for (object *op = ms->bot; op; op = op->above)
383	op->activate_recursive ();	371	op->activate_recursive ();
		372
		373	state = MAP_ACTIVE;
384	}	374	}
385		375
386	void	376	void
387	maptile::deactivate ()	377	maptile::deactivate ()
388	{	378	{
389	if (spaces)	379	if (state != MAP_ACTIVE)
		380	return;
		381
390	for (mapspace *ms = spaces + size (); ms-- > spaces; )	382	for (mapspace *ms = spaces + size (); ms-- > spaces; )
391	for (object *op = ms->bot; op; op = op->above)	383	for (object *op = ms->bot; op; op = op->above)
392	op->deactivate_recursive ();	384	op->deactivate_recursive ();
		385
		386	state = MAP_INACTIVE;
393	}	387	}
394		388
395	bool	389	bool
396	maptile::_save_objects (object_freezer &f, int flags)	390	maptile::_save_objects (object_freezer &f, int flags)
397	{	391	{
…		…
438	return false;	432	return false;
439		433
440	return freezer.save (path);	434	return freezer.save (path);
441	}	435	}
442		436
443	maptile::maptile ()	437	void
		438	maptile::init ()
444	{	439	{
445	in_memory = MAP_SWAPPED;	440	state = MAP_SWAPPED;
446		441
447	/* The maps used to pick up default x and y values from the	442	/* The maps used to pick up default x and y values from the
448	* map archetype. Mimic that behaviour.	443	* map archetype. Mimic that behaviour.
449	*/	444	*/
450	width = 16;	445	width = 16;
451	height = 16;	446	height = 16;
452	timeout = 300;	447	timeout = 300;
453	max_items = MAX_ITEM_PER_ACTION;	448	max_items = MAX_ITEM_PER_ACTION;
454	max_volume = 2000000; // 2m³	449	max_volume = 2000000; // 2m³
455	}
456
457	maptile::maptile (int w, int h)
458	{
459	in_memory = MAP_SWAPPED;
460
461	width = w;
462	height = h;
463	reset_timeout = 0;	450	reset_timeout = 0;
464	timeout = 300;
465	enter_x = 0;	451	enter_x = 0;
466	enter_y = 0;	452	enter_y = 0;
		453	}
		454
		455	maptile::maptile ()
		456	{
		457	init ();
		458	}
		459
		460	maptile::maptile (int w, int h)
		461	{
		462	init ();
		463
		464	width = w;
		465	height = h;
467		466
468	alloc ();	467	alloc ();
469	}	468	}
470		469
471	/*	470	/*
…		…
571	* the map (or something equivilent) into output_string. */	570	* the map (or something equivilent) into output_string. */
572	static const char *	571	static const char *
573	print_shop_string (maptile *m)	572	print_shop_string (maptile *m)
574	{	573	{
575	static dynbuf_text buf; buf.clear ();	574	static dynbuf_text buf; buf.clear ();
		575	bool first = true;
576		576
577	for (int i = 0; i < m->shopitems[0].index; i++)	577	for (int i = 0; i < m->shopitems[0].index; i++)
578	{	578	{
		579	if (!first)
		580	buf << ';';
		581
		582	first = false;
		583
579	if (m->shopitems[i].typenum)	584	if (m->shopitems[i].typenum)
580	{	585	{
581	if (m->shopitems[i].strength)	586	if (m->shopitems[i].strength)
582	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	587	buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
583	else	588	else
584	buf.printf ("%s;", m->shopitems[i].name);	589	buf.printf ("%s", m->shopitems[i].name);
585	}	590	}
586	else	591	else
587	{	592	{
588	if (m->shopitems[i].strength)	593	if (m->shopitems[i].strength)
589	buf.printf ("*:%d;", m->shopitems[i].strength);	594	buf.printf ("*:%d", m->shopitems[i].strength);
590	else	595	else
591	buf.printf ("*");	596	buf.printf ("*");
592	}	597	}
593	}	598	}
594		599
…		…
617	{	622	{
618	case KW_msg:	623	case KW_msg:
619	thawer.get_ml (KW_endmsg, msg);	624	thawer.get_ml (KW_endmsg, msg);
620	break;	625	break;
621		626
622	case KW_lore: // CF+ extension	627	case KW_lore: // deliantra extension
623	thawer.get_ml (KW_endlore, maplore);	628	thawer.get_ml (KW_endlore, maplore);
624	break;	629	break;
625		630
626	case KW_maplore:	631	case KW_maplore:
627	thawer.get_ml (KW_endmaplore, maplore);	632	thawer.get_ml (KW_endmaplore, maplore);
…		…
644	case KW_shopgreed: thawer.get (shopgreed); break;	649	case KW_shopgreed: thawer.get (shopgreed); break;
645	case KW_shopmin: thawer.get (shopmin); break;	650	case KW_shopmin: thawer.get (shopmin); break;
646	case KW_shopmax: thawer.get (shopmax); break;	651	case KW_shopmax: thawer.get (shopmax); break;
647	case KW_shoprace: thawer.get (shoprace); break;	652	case KW_shoprace: thawer.get (shoprace); break;
648	case KW_outdoor: thawer.get (outdoor); break;	653	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		654
656	case KW_per_player: thawer.get (per_player); break;	655	case KW_per_player: thawer.get (per_player); break;
657	case KW_per_party: thawer.get (per_party); break;	656	case KW_per_party: thawer.get (per_party); break;
658	case KW_no_reset: thawer.get (no_reset); break;	657	case KW_no_reset: thawer.get (no_reset); break;
659	case KW_no_drop: thawer.get (no_drop); break;	658	case KW_no_drop: thawer.get (no_drop); break;
660		659
661	case KW_region: default_region = region::find (thawer.get_str ()); break;	660	case KW_region: thawer.get (default_region); break;
662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	661	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
663		662
664	// old names new names	663	// old names new names
665	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	664	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;	665	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
674		673
675	case KW_tile_path_1: thawer.get (tile_path [0]); break;	674	case KW_tile_path_1: thawer.get (tile_path [0]); break;
676	case KW_tile_path_2: thawer.get (tile_path [1]); break;	675	case KW_tile_path_2: thawer.get (tile_path [1]); break;
677	case KW_tile_path_3: thawer.get (tile_path [2]); break;	676	case KW_tile_path_3: thawer.get (tile_path [2]); break;
678	case KW_tile_path_4: thawer.get (tile_path [3]); break;	677	case KW_tile_path_4: thawer.get (tile_path [3]); break;
		678	case KW_tile_path_5: thawer.get (tile_path [4]); break;
		679	case KW_tile_path_6: thawer.get (tile_path [5]); break;
679		680
680	case KW_ERROR:	681	case KW_ERROR:
681	set_key_text (thawer.kw_str, thawer.value);	682	set_key_text (thawer.kw_str, thawer.value);
682	break;	683	break;
683		684
684	case KW_end:	685	case KW_end:
685	thawer.next ();	686	thawer.next ();
686	return true;	687	return true;
687		688
688	default:	689	default:
689	if (!thawer.parse_error ("map", 0))	690	if (!thawer.parse_error ("map"))
690	return false;	691	return false;
691	break;	692	break;
692	}	693	}
693		694
694	thawer.next ();	695	thawer.next ();
…		…
712	int unique = 0;	713	int unique = 0;
713	for (object *op = spaces [i].bot; op; )	714	for (object *op = spaces [i].bot; op; )
714	{	715	{
715	object *above = op->above;	716	object *above = op->above;
716		717
717	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	718	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
718	unique = 1;	719	unique = 1;
719		720
720	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	721	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] \|\| unique))
721	op->destroy ();	722	op->destroy ();
722		723
723	op = above;	724	op = above;
724	}	725	}
725	}	726	}
…		…
728	//-GPL	729	//-GPL
729		730
730	bool	731	bool
731	maptile::_save_header (object_freezer &freezer)	732	maptile::_save_header (object_freezer &freezer)
732	{	733	{
733	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	734	#define MAP_OUT(k) freezer.put (KW(k), k)
734	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	735	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
735		736
736	MAP_OUT2 (arch, "map");	737	MAP_OUT2 (arch, CS(map));
737		738
738	if (name) MAP_OUT (name);	739	if (name) MAP_OUT (name);
739	MAP_OUT (swap_time);	740	MAP_OUT (swap_time);
740	MAP_OUT (reset_time);	741	MAP_OUT (reset_time);
741	MAP_OUT (reset_timeout);	742	MAP_OUT (reset_timeout);
…		…
749	MAP_OUT (shopgreed);	750	MAP_OUT (shopgreed);
750	MAP_OUT (shopmin);	751	MAP_OUT (shopmin);
751	MAP_OUT (shopmax);	752	MAP_OUT (shopmax);
752	if (shoprace) MAP_OUT (shoprace);	753	if (shoprace) MAP_OUT (shoprace);
753		754
754	MAP_OUT (darkness);
755	MAP_OUT (width);	755	MAP_OUT (width);
756	MAP_OUT (height);	756	MAP_OUT (height);
757	MAP_OUT (enter_x);	757	MAP_OUT (enter_x);
758	MAP_OUT (enter_y);	758	MAP_OUT (enter_y);
759		759	MAP_OUT (darkness);
760	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
761	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
762
763	MAP_OUT (outdoor);	760	MAP_OUT (outdoor);
764	MAP_OUT (temp);	761
765	MAP_OUT (pressure);	762	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
766	MAP_OUT (humid);	763	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
767	MAP_OUT (windspeed);
768	MAP_OUT (winddir);
769	MAP_OUT (sky);
770		764
771	MAP_OUT (per_player);	765	MAP_OUT (per_player);
772	MAP_OUT (per_party);	766	MAP_OUT (per_party);
773		767
774	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	768	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
775	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	769	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
776	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	770	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
777	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	771	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
		772	if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]);
		773	if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]);
778		774
779	freezer.put (this);	775	freezer.put (this);
780	freezer.put (KW_end);	776	freezer.put (KW(end));
781		777
782	return true;	778	return true;
783	}	779	}
784		780
785	bool	781	bool
…		…
839	msg = 0;	835	msg = 0;
840	maplore = 0;	836	maplore = 0;
841	shoprace = 0;	837	shoprace = 0;
842	delete [] shopitems, shopitems = 0;	838	delete [] shopitems, shopitems = 0;
843		839
844	for (int i = 0; i < 4; i++)	840	for (int i = 0; i < TILE_NUM; i++)
845	tile_path [i] = 0;	841	tile_path [i] = 0;
846	}	842	}
847		843
848	maptile::~maptile ()	844	maptile::~maptile ()
849	{	845	{
…		…
856	/* We need to look through all the maps and see if any maps	852	/* We need to look through all the maps and see if any maps
857	* are pointing at this one for tiling information. Since	853	* are pointing at this one for tiling information. Since
858	* tiling can be asymetric, we just can not look to see which	854	* tiling can be asymetric, we just can not look to see which
859	* maps this map tiles with and clears those.	855	* maps this map tiles with and clears those.
860	*/	856	*/
861	for (int i = 0; i < 4; i++)	857	for (int i = 0; i < TILE_NUM; i++)
862	if (tile_map[i] == m)	858	if (tile_map[i] == m)
863	tile_map[i] = 0;	859	tile_map[i] = 0;
864	}	860	}
865		861
866	void	862	void
…		…
870		866
871	clear ();	867	clear ();
872	}	868	}
873		869
874	/* decay and destroy perishable items in a map */	870	/* decay and destroy perishable items in a map */
		871	// TODO: should be done regularly, not on map load?
875	void	872	void
876	maptile::do_decay_objects ()	873	maptile::do_decay_objects ()
877	{	874	{
878	if (!spaces)	875	if (!spaces)
879	return;	876	return;
…		…
881	for (mapspace *ms = spaces + size (); ms-- > spaces; )	878	for (mapspace *ms = spaces + size (); ms-- > spaces; )
882	for (object above, op = ms->bot; op; op = above)	879	for (object above, op = ms->bot; op; op = above)
883	{	880	{
884	above = op->above;	881	above = op->above;
885		882
		883	// do not decay anything above unique floor tiles (yet :)
		884	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		885	break;
		886
886	bool destroy = 0;	887	bool destroy = 0;
887		888
888	// do not decay anything above unique floor tiles (yet :)	889	if (op->flag [FLAG_IS_FLOOR]
889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	890	\|\| op->flag [FLAG_OBJ_ORIGINAL]
890	break;	891	\|\| op->flag [FLAG_UNIQUE]
891		892	\|\| op->flag [FLAG_OVERLAY_FLOOR]
892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	893	\|\| 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 ())	894	\|\| op->is_alive ())
898	; // do not decay	895	; // do not decay
899	else if (op->is_weapon ())	896	else if (op->is_weapon ())
900	{	897	{
901	op->stats.dam--;	898	op->stats.dam--;
…		…
926	\|\| mat & M_LIQUID	923	\|\| mat & M_LIQUID
927	\|\| (mat & M_IRON && rndm (1, 5) == 1)	924	\|\| (mat & M_IRON && rndm (1, 5) == 1)
928	\|\| (mat & M_GLASS && rndm (1, 2) == 1)	925	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
929	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)	926	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
930	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)	927	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
931	\|\| (mat & M_ICE && temp > 32))	928	//\|\| (mat & M_ICE && temp > 32)
		929	)
932	destroy = 1;	930	destroy = 1;
933	}	931	}
934		932
935	/* adjust overall chance below */	933	/* adjust overall chance below */
936	if (destroy && rndm (0, 1))	934	if (destroy && rndm (0, 1))
…		…
956	sint64 total_exp = 0;	954	sint64 total_exp = 0;
957		955
958	for (mapspace *ms = spaces + size (); ms-- > spaces; )	956	for (mapspace *ms = spaces + size (); ms-- > spaces; )
959	for (object *op = ms->bot; op; op = op->above)	957	for (object *op = ms->bot; op; op = op->above)
960	{	958	{
961	if (QUERY_FLAG (op, FLAG_MONSTER))	959	if (op->flag [FLAG_MONSTER])
962	{	960	{
963	total_exp += op->stats.exp;	961	total_exp += op->stats.exp;
964	monster_cnt++;	962	monster_cnt++;
965	}	963	}
966		964
967	if (QUERY_FLAG (op, FLAG_GENERATOR))	965	if (op->flag [FLAG_GENERATOR])
968	{	966	{
969	total_exp += op->stats.exp;	967	total_exp += op->stats.exp;
970		968
971	if (archetype *at = op->other_arch)	969	if (archetype *at = op->other_arch)
972	{	970	{
…		…
1033	sint8 light = 0;	1031	sint8 light = 0;
1034	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1032	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1035	uint64_t volume = 0;	1033	uint64_t volume = 0;
1036	uint32_t items = 0;	1034	uint32_t items = 0;
1037	object *anywhere = 0;	1035	object *anywhere = 0;
		1036	uint8_t middle_visibility = 0;
1038		1037
1039	//object *middle = 0;	1038	//object *middle = 0;
1040	//object *top = 0;	1039	//object *top = 0;
1041	//object *floor = 0;	1040	//object *floor = 0;
1042	// this seems to generate better code than using locals, above	1041	// this seems to generate better code than using locals, above
…		…
1059	*	1058	*
1060	* Always put the player down for drawing.	1059	* Always put the player down for drawing.
1061	*/	1060	*/
1062	if (expect_true (!tmp->invisible))	1061	if (expect_true (!tmp->invisible))
1063	{	1062	{
1064	if (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER])	1063	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1065	top = tmp;	1064	top = tmp;
		1065	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
		1066	{
		1067	/* If we got a floor, that means middle and top were below it,
		1068	* so should not be visible, so we clear them.
		1069	*/
		1070	middle = 0;
		1071	top = 0;
		1072	floor = tmp;
		1073	volume = 0;
		1074	items = 0;
		1075	}
1066	else	1076	else
1067	{	1077	{
1068	if (expect_false (tmp->flag [FLAG_IS_FLOOR]))	1078	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1069	{	1079	{
1070	/* If we got a floor, that means middle and top were below it,
1071	* so should not be visible, so we clear them.
1072	*/
1073	middle = 0;
1074	top = 0;
1075	floor = tmp;
1076	volume = 0;
1077	items = 0;	1080	++items;
		1081	volume += tmp->volume ();
1078	}	1082	}
		1083
		1084	/* Flag anywhere have high priority */
		1085	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1086	anywhere = tmp;
		1087
		1088	/* Find the highest visible face around. If equal
		1089	* visibilities, we still want the one nearer to the
		1090	* top
1079	else	1091	*/
		1092	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1080	{	1093	{
1081	if (expect_true (!tmp->flag [FLAG_NO_PICK]))	1094	middle_visibility = ::faces [tmp->face].visibility;
1082	{
1083	++items;
1084	volume += tmp->volume ();
1085	}
1086
1087	/* Flag anywhere have high priority */
1088	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1089	anywhere = tmp;
1090	/* Find the highest visible face around. If equal
1091	* visibilities, we still want the one nearer to the
1092	* top
1093	*/
1094	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility))
1095	middle = tmp;	1095	middle = tmp;
1096	}	1096	}
1097	}	1097	}
1098	}	1098	}
1099		1099
1100	move_slow \|= tmp->move_slow;	1100	move_slow \|= tmp->move_slow;
…		…
1152	*/	1152	*/
1153		1153
1154	for (object *tmp = last; tmp; tmp = tmp->below)	1154	for (object *tmp = last; tmp; tmp = tmp->below)
1155	{	1155	{
1156	/* Once we get to a floor, stop, since we already have a floor object */	1156	/* Once we get to a floor, stop, since we already have a floor object */
1157	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1157	if (tmp->flag [FLAG_IS_FLOOR])
1158	break;	1158	break;
1159		1159
1160	/* If two top faces are already set, quit processing */	1160	/* If two top faces are already set, quit processing */
1161	if (top && middle)	1161	if (top && middle)
1162	break;	1162	break;
…		…
1205	maptile *	1205	maptile *
1206	maptile::tile_available (int dir, bool load)	1206	maptile::tile_available (int dir, bool load)
1207	{	1207	{
1208	if (tile_path[dir])	1208	if (tile_path[dir])
1209	{	1209	{
		1210	// map is there and we don't need to load it OR it's loaded => return what we have
1210	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))	1211	if (tile_map[dir] && (!load \|\| tile_map[dir]->linkable ()))
1211	return tile_map[dir];	1212	return tile_map[dir];
1212		1213
		1214	// well, try to locate it then, if possible - maybe it's there already
1213	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))	1215	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1214	return tile_map[dir];	1216	return tile_map[dir];
1215	}	1217	}
1216		1218
1217	return 0;	1219	return 0;
…		…
1329	/**	1331	/**
1330	* Return whether map2 is adjacent to map1. If so, store the distance from	1332	* Return whether map2 is adjacent to map1. If so, store the distance from
1331	* map1 to map2 in dx/dy.	1333	* map1 to map2 in dx/dy.
1332	*/	1334	*/
1333	int	1335	int
1334	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1336	adjacent_map (maptile map1, maptile map2, int dx, int dy)
1335	{	1337	{
1336	if (!map1 \|\| !map2)	1338	if (!map1 \|\| !map2)
1337	return 0;	1339	return 0;
1338		1340
1339	//TODO: this doesn't actually check correctly when intermediate maps are not loaded	1341	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
…		…
1341	if (map1 == map2)	1343	if (map1 == map2)
1342	{	1344	{
1343	*dx = 0;	1345	*dx = 0;
1344	*dy = 0;	1346	*dy = 0;
1345	}	1347	}
1346	else if (map1->tile_map[0] == map2)	1348	else if (map1->tile_available (TILE_NORTH, false) == map2)
1347	{ /* up */	1349	{
1348	*dx = 0;	1350	*dx = 0;
1349	*dy = -map2->height;	1351	*dy = -map2->height;
1350	}	1352	}
1351	else if (map1->tile_map[1] == map2)	1353	else if (map1->tile_available (TILE_EAST , false) == map2)
1352	{ /* right */	1354	{
1353	*dx = map1->width;	1355	*dx = map1->width;
1354	*dy = 0;	1356	*dy = 0;
1355	}	1357	}
1356	else if (map1->tile_map[2] == map2)	1358	else if (map1->tile_available (TILE_SOUTH, false) == map2)
1357	{ /* down */	1359	{
1358	*dx = 0;	1360	*dx = 0;
1359	*dy = map1->height;	1361	*dy = map1->height;
1360	}	1362	}
1361	else if (map1->tile_map[3] == map2)	1363	else if (map1->tile_available (TILE_WEST , false) == map2)
1362	{ /* left */	1364	{
1363	*dx = -map2->width;	1365	*dx = -map2->width;
1364	*dy = 0;	1366	*dy = 0;
1365	}	1367	}
1366	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	1368	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1367	{ /* up right */	1369	{ /* up right */
1368	*dx = map1->tile_map[0]->width;	1370	*dx = +map1->tile_map[TILE_NORTH]->width;
1369	*dy = -map1->tile_map[0]->height;	1371	*dy = -map1->tile_map[TILE_NORTH]->height;
1370	}	1372	}
1371	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	1373	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1372	{ /* up left */	1374	{ /* up left */
1373	*dx = -map2->width;	1375	*dx = -map2->width;
1374	*dy = -map1->tile_map[0]->height;	1376	*dy = -map1->tile_map[TILE_NORTH]->height;
1375	}	1377	}
1376	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	1378	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1377	{ /* right up */	1379	{ /* right up */
1378	*dx = map1->width;	1380	*dx = +map1->width;
1379	*dy = -map2->height;	1381	*dy = -map2->height;
1380	}	1382	}
1381	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	1383	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1382	{ /* right down */	1384	{ /* right down */
1383	*dx = map1->width;	1385	*dx = +map1->width;
1384	*dy = map1->tile_map[1]->height;	1386	*dy = +map1->tile_map[TILE_EAST]->height;
1385	}	1387	}
1386	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	1388	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1387	{ /* down right */	1389	{ /* down right */
1388	*dx = map1->tile_map[2]->width;	1390	*dx = +map1->tile_map[TILE_SOUTH]->width;
1389	*dy = map1->height;	1391	*dy = +map1->height;
1390	}	1392	}
1391	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	1393	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1392	{ /* down left */	1394	{ /* down left */
1393	*dx = -map2->width;	1395	*dx = -map2->width;
1394	*dy = map1->height;	1396	*dy = +map1->height;
1395	}	1397	}
1396	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	1398	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1397	{ /* left up */	1399	{ /* left up */
1398	*dx = -map1->tile_map[3]->width;	1400	*dx = -map1->tile_map[TILE_WEST]->width;
1399	*dy = -map2->height;	1401	*dy = -map2->height;
1400	}	1402	}
1401	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	1403	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1402	{ /* left down */	1404	{ /* left down */
1403	*dx = -map1->tile_map[3]->width;	1405	*dx = -map1->tile_map[TILE_WEST]->width;
1404	*dy = map1->tile_map[3]->height;	1406	*dy = +map1->tile_map[TILE_WEST]->height;
1405	}	1407	}
1406	else	1408	else
1407	return 0;	1409	return 0;
1408		1410
1409	return 1;	1411	return 1;
…		…
1445	*	1447	*
1446	* currently, the only flag supported (0x1) is don't translate for	1448	* currently, the only flag supported (0x1) is don't translate for
1447	* closest body part of 'op1'	1449	* closest body part of 'op1'
1448	*/	1450	*/
1449	void	1451	void
1450	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1452	get_rangevector (object op1, object op2, rv_vector *retval, int flags)
1451	{	1453	{
1452	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1454	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1453	{	1455	{
1454	/* be conservative and fill in _some_ data */	1456	/* be conservative and fill in _some_ data */
1455	retval->distance = 10000;	1457	retval->distance = 10000;
1456	retval->distance_x = 10000;	1458	retval->distance_x = 10000;
1457	retval->distance_y = 10000;	1459	retval->distance_y = 10000;
1458	retval->direction = 0;	1460	retval->direction = 0;
1459	retval->part = 0;	1461	retval->part = 0;
1460	}	1462	}
1461	else	1463	else
1462	{	1464	{
1463	object *best;
1464
1465	retval->distance_x += op2->x - op1->x;	1465	retval->distance_x += op2->x - op1->x;
1466	retval->distance_y += op2->y - op1->y;	1466	retval->distance_y += op2->y - op1->y;
1467		1467
1468	best = op1;	1468	object *best = op1;
		1469
1469	/* If this is multipart, find the closest part now */	1470	/* If this is multipart, find the closest part now */
1470	if (!(flags & 0x1) && op1->more)	1471	if (!(flags & 1) && op1->more)
1471	{	1472	{
1472	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1473	int best_distance = idistance (retval->distance_x, retval->distance_y);
1473		1474
1474	/* we just take the offset of the piece to head to figure	1475	/* we just take the offset of the piece to head to figure
1475	* distance instead of doing all that work above again	1476	* distance instead of doing all that work above again
1476	* since the distance fields we set above are positive in the	1477	* since the distance fields we set above are positive in the
1477	* same axis as is used for multipart objects, the simply arithmetic	1478	* same axis as is used for multipart objects, the simply arithmetic
1478	* below works.	1479	* below works.
1479	*/	1480	*/
1480	for (object *tmp = op1->more; tmp; tmp = tmp->more)	1481	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1481	{	1482	{
1482	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1483	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1483	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1484
1484	if (tmpi < best_distance)	1485	if (tmpi < best_distance)
1485	{	1486	{
1486	best_distance = tmpi;	1487	best_distance = tmpi;
1487	best = tmp;	1488	best = tmp;
1488	}	1489	}
1489	}	1490	}
1490		1491
1491	if (best != op1)	1492	if (best != op1)
1492	{	1493	{
1493	retval->distance_x += op1->x - best->x;	1494	retval->distance_x += op1->x - best->x;
1494	retval->distance_y += op1->y - best->y;	1495	retval->distance_y += op1->y - best->y;
1495	}	1496	}
1496	}	1497	}
1497		1498
1498	retval->part = best;	1499	retval->part = best;
1499	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1500	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1500	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1501	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1501	}	1502	}
1502	}	1503	}
1503		1504
1504	/* this is basically the same as get_rangevector above, but instead of	1505	/* this is basically the same as get_rangevector above, but instead of
1505	* the first parameter being an object, it instead is the map	1506	* the first parameter being an object, it instead is the map
…		…
1510	* be more consistant with the above function and also in case they are needed	1511	* be more consistant with the above function and also in case they are needed
1511	* for something in the future. Also, since no object is pasted, the best	1512	* for something in the future. Also, since no object is pasted, the best
1512	* field of the rv_vector is set to NULL.	1513	* field of the rv_vector is set to NULL.
1513	*/	1514	*/
1514	void	1515	void
1515	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)	1516	get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1516	{	1517	{
1517	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1518	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1518	{	1519	{
1519	/* be conservative and fill in _some_ data */	1520	/* be conservative and fill in _some_ data */
1520	retval->distance = 100000;	1521	retval->distance = 100000;
1521	retval->distance_x = 32767;	1522	retval->distance_x = 32767;
1522	retval->distance_y = 32767;	1523	retval->distance_y = 32767;
1523	retval->direction = 0;	1524	retval->direction = 0;
1524	retval->part = 0;	1525	retval->part = 0;
1525	}	1526	}
1526	else	1527	else
1527	{	1528	{
1528	retval->distance_x += op2->x - x;	1529	retval->distance_x += op2->x - x;
1529	retval->distance_y += op2->y - y;	1530	retval->distance_y += op2->y - y;
1530		1531
1531	retval->part = 0;	1532	retval->part = 0;
1532	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1533	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1533	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1534	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1534	}	1535	}
1535	}	1536	}
1536		1537
1537	/* Returns true of op1 and op2 are effectively on the same map	1538	/* Returns true of op1 and op2 are effectively on the same map
1538	* (as related to map tiling). Note that this looks for a path from	1539	* (as related to map tiling). Note that this looks for a path from
…		…
1588	*/	1589	*/
1589	for (int i = 1000; --i;)	1590	for (int i = 1000; --i;)
1590	{	1591	{
1591	object *pick = at (gen (width), gen (height)).bot;	1592	object *pick = at (gen (width), gen (height)).bot;
1592		1593
1593	// do not prefer big monsters just because they are big.	1594	// must be head: do not prefer big monsters just because they are big.
1594	if (pick && pick->is_head ())	1595	if (pick && pick->is_head ())
1595	return pick->head_ ();	1596	return pick;
1596	}	1597	}
1597		1598
1598	// instead of crashing in the unlikely(?) case, try to return something	1599	// instead of crashing in the unlikely(?) case, try to return something
1599	return archetype::find (shstr_bug);	1600	return archetype::find (shstr_bug);
1600	}	1601	}
…		…
1634	if (distance <= MAX_SOUND_DISTANCE)	1635	if (distance <= MAX_SOUND_DISTANCE)
1635	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);	1636	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
1636	}	1637	}
1637	}	1638	}
1638		1639
		1640	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1641
1639	static void	1642	static void
1640	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)	1643	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1641	{	1644	{
1642	// clip to map to the left	1645	// clip to map to the left
1643	if (x0 < 0)	1646	if (x0 < 0)
1644	{	1647	{
1645	if (maptile *tile = m->tile_available (TILE_LEFT, 1))	1648	if (maptile *tile = m->tile_available (TILE_WEST, 1))
1646	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);	1649	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1647		1650
1648	if (x1 < 0) // entirely to the left	1651	if (x1 < 0) // entirely to the left
1649	return;	1652	return;
1650		1653
…		…
1652	}	1655	}
1653		1656
1654	// clip to map to the right	1657	// clip to map to the right
1655	if (x1 > m->width)	1658	if (x1 > m->width)
1656	{	1659	{
1657	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))	1660	if (maptile *tile = m->tile_available (TILE_EAST, 1))
1658	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);	1661	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1659		1662
1660	if (x0 > m->width) // entirely to the right	1663	if (x0 > m->width) // entirely to the right
1661	return;	1664	return;
1662		1665
…		…
1664	}	1667	}
1665		1668
1666	// clip to map above	1669	// clip to map above
1667	if (y0 < 0)	1670	if (y0 < 0)
1668	{	1671	{
1669	if (maptile *tile = m->tile_available (TILE_UP, 1))	1672	if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1670	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);	1673	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1671		1674
1672	if (y1 < 0) // entirely above	1675	if (y1 < 0) // entirely above
1673	return;	1676	return;
1674		1677
…		…
1676	}	1679	}
1677		1680
1678	// clip to map below	1681	// clip to map below
1679	if (y1 > m->height)	1682	if (y1 > m->height)
1680	{	1683	{
1681	if (maptile *tile = m->tile_available (TILE_DOWN, 1))	1684	if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1682	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);	1685	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1683		1686
1684	if (y0 > m->height) // entirely below	1687	if (y0 > m->height) // entirely below
1685	return;	1688	return;
1686		1689
…		…
1698	r->dx = dx;	1701	r->dx = dx;
1699	r->dy = dy;	1702	r->dy = dy;
1700	}	1703	}
1701		1704
1702	maprect *	1705	maprect *
1703	maptile::split_to_tiles (int x0, int y0, int x1, int y1)	1706	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1704	{	1707	{
1705	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1706	buf.clear ();	1708	buf.clear ();
1707		1709
1708	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);	1710	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1709		1711
1710	// add end marker	1712	// add end marker

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.173 by root, Mon Nov 9 18:47:56 2009 UTC vs. Revision 1.206 by root, Wed May 4 16:12:15 2011 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.173 by root, Mon Nov 9 18:47:56 2009 UTC vs.
Revision 1.206 by root, Wed May 4 16:12:15 2011 UTC