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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.117 by root, Fri Aug 24 00:26:09 2007 UTC vs.
Revision 1.160 by root, Mon Oct 12 14:00:57 2009 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT 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 <crossfire@schmorp.de>	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 "funcpoint.h"
28
29	#include "loader.h"	28	#include "loader.h"
30
31	#include "path.h"	29	#include "path.h"
		30
		31	sint8 maptile::outdoor_darkness;
32		32
33	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	33	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34	* one function that just returns a P_.. value (see map.h)	34	* one function that just returns a P_.. value (see map.h)
35	* it will also do map translation for tiled maps, returning	35	* it will also do map translation for tiled maps, returning
36	* new values into newmap, nx, and ny. Any and all of those	36	* new values into newmap, nx, and ny. Any and all of those
166	}	166	}
167	return 0;	167	return 0;
168	}	168	}
169		169
170	/*	170	/*
171	* Returns true if the given object can't fit in the given spot.	171	* Returns qthe blocking object if the given object can't fit in the given
172	* This is meant for multi space objects - for single space objecs,	172	* spot. This is meant for multi space objects - for single space objecs,
173	* just calling get_map_blocked and checking that against movement type	173	* just calling get_map_blocked and checking that against movement type
174	* of object. This function goes through all the parts of the	174	* of object. This function goes through all the parts of the multipart
175	* multipart object and makes sure they can be inserted.	175	* object and makes sure they can be inserted.
176	*	176	*
177	* While this doesn't call out of map, the get_map_flags does.	177	* While this doesn't call out of map, the get_map_flags does.
178	*	178	*
179	* This function has been used to deprecate arch_out_of_map -	179	* This function has been used to deprecate arch_out_of_map -
180	* this function also does that check, and since in most cases,	180	* this function also does that check, and since in most cases,
…		…
191	*	191	*
192	* Note this used to be arch_blocked, but with new movement	192	* Note this used to be arch_blocked, but with new movement
193	* code, we need to have actual object to check its move_type	193	* code, we need to have actual object to check its move_type
194	* against the move_block values.	194	* against the move_block values.
195	*/	195	*/
196	int	196	bool
197	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	197	object::blocked (maptile *m, int x, int y) const
198	{	198	{
199	archetype *tmp;	199	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
200	int flag;
201	maptile *m1;
202	sint16 sx, sy;
203
204	if (!ob)
205	{
206	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
207	if (flag & P_OUT_OF_MAP)
208	return P_OUT_OF_MAP;
209
210	/* don't have object, so don't know what types would block */
211	return m1->at (sx, sy).move_block;
212	}	200	{
		201	mapxy pos (m, x + tmp->x, y + tmp->y);
213		202
214	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)	203	if (!pos.normalise ())
215	{	204	return 1;
216	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
217		205
218	if (flag & P_OUT_OF_MAP)	206	mapspace &ms = *pos;
219	return P_OUT_OF_MAP;	207
220	if (flag & P_IS_ALIVE)	208	if (ms.flags () & P_IS_ALIVE)
221	return P_IS_ALIVE;	209	return 1;
222		210
223	mapspace &ms = m1->at (sx, sy);	211	/* However, often ob doesn't have any move type
224		212	* (signifying non-moving objects)
225	/* find_first_free_spot() calls this function. However, often
226	* ob doesn't have any move type (when used to place exits)
227	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	213	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
228	*/	214	*/
229
230	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	215	if (!move_type && ms.move_block != MOVE_ALL)
231	continue;	216	continue;
232		217
233	/* Note it is intentional that we check ob - the movement type of the	218	/* Note it is intentional that we check ob - the movement type of the
234	* head of the object should correspond for the entire object.	219	* head of the object should correspond for the entire object.
235	*/	220	*/
236	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	221	if (ms.blocks (move_type))
237	return P_NO_PASS;	222	return 1;
238	}	223	}
239		224
240	return 0;	225	return 0;
241	}	226	}
242		227
…		…
260		245
261	insert_ob_in_ob (tmp, container);	246	insert_ob_in_ob (tmp, container);
262	tmp = next;	247	tmp = next;
263	}	248	}
264		249
265	/* sum_weight will go through and calculate what all the containers are	250	// go through and calculate what all the containers are carrying.
266	* carrying.	251	//TODO: remove
267	*/	252	container->update_weight ();
268	sum_weight (container);
269	}	253	}
270		254
271	void	255	void
272	maptile::set_object_flag (int flag, int value)	256	maptile::set_object_flag (int flag, int value)
273	{	257	{
…		…
275	return;	259	return;
276		260
277	for (mapspace *ms = spaces + size (); ms-- > spaces; )	261	for (mapspace *ms = spaces + size (); ms-- > spaces; )
278	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	262	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
279	tmp->flag [flag] = value;	263	tmp->flag [flag] = value;
		264	}
		265
		266	void
		267	maptile::post_load_original ()
		268	{
		269	if (!spaces)
		270	return;
		271
		272	set_object_flag (FLAG_OBJ_ORIGINAL);
		273
		274	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		275	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		276	INVOKE_OBJECT (RESET, tmp);
280	}	277	}
281		278
282	/* link_multipart_objects go through all the objects on the map looking	279	/* link_multipart_objects go through all the objects on the map looking
283	* for objects whose arch says they are multipart yet according to the	280	* for objects whose arch says they are multipart yet according to the
284	* info we have, they only have the head (as would be expected when	281	* info we have, they only have the head (as would be expected when
…		…
322	bool	319	bool
323	maptile::_load_objects (object_thawer &f)	320	maptile::_load_objects (object_thawer &f)
324	{	321	{
325	for (;;)	322	for (;;)
326	{	323	{
327	coroapi::cede_to_tick_every (100); // cede once in a while	324	coroapi::cede_to_tick (); // cede once in a while
328		325
329	switch (f.kw)	326	switch (f.kw)
330	{	327	{
331	case KW_arch:	328	case KW_arch:
332	if (object *op = object::read (f, this))	329	if (object *op = object::read (f, this))
333	{	330	{
		331	// TODO: why?
334	if (op->inv)	332	if (op->inv)
335	sum_weight (op);	333	op->update_weight ();
336		334
337	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	335	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		336	{
		337	// we insert manually because
		338	// a) its way faster
		339	// b) we remove manually, too, and there are good reasons for that
		340	// c) it's correct
		341	mapspace &ms = at (op->x, op->y);
		342
		343	op->flag [FLAG_REMOVED] = false;
		344
		345	op->above = 0;
		346	op->below = ms.top;
		347
		348	*(ms.top ? &ms.top->above : &ms.bot) = op;
		349
		350	ms.top = op;
		351	ms.flags_ = 0;
		352	}
		353	else
		354	{
		355	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		356	op->destroy ();
		357	}
338	}	358	}
339		359
340	continue;	360	continue;
341		361
342	case KW_EOF:	362	case KW_EOF:
…		…
383	if (!spaces)	403	if (!spaces)
384	return false;	404	return false;
385		405
386	for (int i = 0; i < size (); ++i)	406	for (int i = 0; i < size (); ++i)
387	{	407	{
388	int unique = 0;	408	bool unique = 0;
		409
389	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
390	{	411	{
391	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
392	unique = 1;
393		413
394	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
395	continue;	415	continue;
396		416
397	if (unique \|\| op->flag [FLAG_UNIQUE])	417	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
398	{	418	{
399	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
400	op->write (f);	420	op->write (f);
401	}	421	}
402	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
403	op->write (f);	423	op->write (f);
404	}	424	}
405	}	425	}
406		426
407	coroapi::cede_to_tick ();	427	coroapi::cede_to_tick ();
408		428
409	return true;	429	return true;
410	}
411
412	bool
413	maptile::_load_objects (const char *path, bool skip_header)
414	{
415	object_thawer f (path);
416
417	if (!f)
418	return false;
419
420	f.next ();
421
422	if (skip_header)
423	for (;;)
424	{
425	keyword kw = f.kw;
426	f.skip ();
427	if (kw == KW_end)
428	break;
429	}
430
431	return _load_objects (f);
432	}	430	}
433		431
434	bool	432	bool
435	maptile::_save_objects (const char *path, int flags)	433	maptile::_save_objects (const char *path, int flags)
436	{	434	{
…		…
611	bool	609	bool
612	maptile::_load_header (object_thawer &thawer)	610	maptile::_load_header (object_thawer &thawer)
613	{	611	{
614	for (;;)	612	for (;;)
615	{	613	{
616	thawer.next ();
617
618	switch (thawer.kw)	614	switch (thawer.kw)
619	{	615	{
620	case KW_msg:	616	case KW_msg:
621	thawer.get_ml (KW_endmsg, msg);	617	thawer.get_ml (KW_endmsg, msg);
622	break;	618	break;
…		…
656	case KW_sky: thawer.get (sky); break;	652	case KW_sky: thawer.get (sky); break;
657		653
658	case KW_per_player: thawer.get (per_player); break;	654	case KW_per_player: thawer.get (per_player); break;
659	case KW_per_party: thawer.get (per_party); break;	655	case KW_per_party: thawer.get (per_party); break;
660	case KW_no_reset: thawer.get (no_reset); break;	656	case KW_no_reset: thawer.get (no_reset); break;
		657	case KW_no_drop: thawer.get (no_drop); break;
661		658
662	case KW_region: default_region = region::find (thawer.get_str ()); break;	659	case KW_region: default_region = region::find (thawer.get_str ()); break;
663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	660	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
664		661
665	// old names new names	662	// old names new names
…		…
677	case KW_tile_path_2: thawer.get (tile_path [1]); break;	674	case KW_tile_path_2: thawer.get (tile_path [1]); break;
678	case KW_tile_path_3: thawer.get (tile_path [2]); break;	675	case KW_tile_path_3: thawer.get (tile_path [2]); break;
679	case KW_tile_path_4: thawer.get (tile_path [3]); break;	676	case KW_tile_path_4: thawer.get (tile_path [3]); break;
680		677
681	case KW_ERROR:	678	case KW_ERROR:
682	set_key (thawer.kw_str, thawer.value);	679	set_key_text (thawer.kw_str, thawer.value);
683	break;	680	break;
684		681
685	case KW_end:	682	case KW_end:
		683	thawer.next ();
686	return true;	684	return true;
687		685
688	default:	686	default:
689	if (!thawer.parse_error ("map", 0))	687	if (!thawer.parse_error ("map", 0))
690	return false;	688	return false;
691	break;	689	break;
692	}	690	}
		691
		692	thawer.next ();
693	}	693	}
694		694
695	abort ();	695	abort ();
696	}
697
698	bool
699	maptile::_load_header (const char *path)
700	{
701	object_thawer thawer (path);
702
703	if (!thawer)
704	return false;
705
706	return _load_header (thawer);
707	}	696	}
708		697
709	/******************************************************************************	698	/******************************************************************************
710	* This is the start of unique map handling code	699	* This is the start of unique map handling code
711	*****************************************************************************/	700	*****************************************************************************/
…		…
723		712
724	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	713	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
725	unique = 1;	714	unique = 1;
726		715
727	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	716	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
728	{
729	op->destroy_inv (false);
730	op->destroy ();	717	op->destroy ();
731	}
732		718
733	op = above;	719	op = above;
734	}	720	}
735	}	721	}
736	}	722	}
…		…
747	MAP_OUT (swap_time);	733	MAP_OUT (swap_time);
748	MAP_OUT (reset_time);	734	MAP_OUT (reset_time);
749	MAP_OUT (reset_timeout);	735	MAP_OUT (reset_timeout);
750	MAP_OUT (fixed_resettime);	736	MAP_OUT (fixed_resettime);
751	MAP_OUT (no_reset);	737	MAP_OUT (no_reset);
		738	MAP_OUT (no_drop);
752	MAP_OUT (difficulty);	739	MAP_OUT (difficulty);
753		740
754	if (default_region) MAP_OUT2 (region, default_region->name);	741	if (default_region) MAP_OUT2 (region, default_region->name);
755		742
756	if (shopitems)	743	if (shopitems)
…		…
810	* Remove and free all objects in the given map.	797	* Remove and free all objects in the given map.
811	*/	798	*/
812	void	799	void
813	maptile::clear ()	800	maptile::clear ()
814	{	801	{
815	sfree (regions, size ()); regions = 0;
816	delete [] regionmap; regionmap = 0;
817
818	if (spaces)	802	if (spaces)
819	{	803	{
820	for (mapspace *ms = spaces + size (); ms-- > spaces; )	804	for (mapspace *ms = spaces + size (); ms-- > spaces; )
821	while (object *op = ms->bot)	805	while (object *op = ms->bot)
822	{	806	{
		807	// manually remove, as to not trigger anything
		808	if (ms->bot = op->above)
		809	ms->bot->below = 0;
		810
		811	op->flag [FLAG_REMOVED] = true;
		812
823	op = op->head_ ();	813	object *head = op->head_ ();
824	op->destroy_inv (false);	814	if (op == head)
825	op->destroy ();	815	op->destroy ();
		816	else if (head->map != op->map)
		817	{
		818	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		819	head->destroy ();
		820	}
826	}	821	}
827		822
828	sfree (spaces, size ()), spaces = 0;	823	sfree0 (spaces, size ());
829	}	824	}
830		825
831	if (buttons)	826	if (buttons)
832	free_objectlinkpt (buttons), buttons = 0;	827	free_objectlinkpt (buttons), buttons = 0;
		828
		829	sfree0 (regions, size ());
		830	delete [] regionmap; regionmap = 0;
833	}	831	}
834		832
835	void	833	void
836	maptile::clear_header ()	834	maptile::clear_header ()
837	{	835	{
…		…
889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	887	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
890	break;	888	break;
891		889
892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	890	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
893	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)	891	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
894	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
895	\|\| QUERY_FLAG (op, FLAG_UNIQUE)	892	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
896	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)	893	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
897	\|\| QUERY_FLAG (op, FLAG_UNPAID)	894	\|\| QUERY_FLAG (op, FLAG_UNPAID)
898	\|\| op->is_alive ())	895	\|\| op->is_alive ())
899	; // do not decay	896	; // do not decay
…		…
938	op->destroy ();	935	op->destroy ();
939	}	936	}
940	}	937	}
941		938
942	/*	939	/*
943	* Updates every button on the map (by calling update_button() for them).
944	*/
945	void
946	maptile::update_buttons ()
947	{
948	for (oblinkpt *obp = buttons; obp; obp = obp->next)
949	for (objectlink *ol = obp->link; ol; ol = ol->next)
950	{
951	if (!ol->ob)
952	{
953	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
954	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
955	continue;
956	}
957
958	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
959	{
960	update_button (ol->ob);
961	break;
962	}
963	}
964	}
965
966	/*
967	* This routine is supposed to find out the difficulty of the map.	940	* This routine is supposed to find out the difficulty of the map.
968	* difficulty does not have a lot to do with character level,	941	* difficulty does not have a lot to do with character level,
969	* but does have a lot to do with treasure on the map.	942	* but does have a lot to do with treasure on the map.
970	*	943	*
971	* Difficulty can now be set by the map creature. If the value stored	944	* Difficulty can now be set by the map creator. If the value stored
972	* in the map is zero, then use this routine. Maps should really	945	* in the map is zero, then use this routine. Maps should really
973	* have a difficulty set than using this function - human calculation	946	* have a difficulty set rather than using this function - human calculation
974	* is much better than this functions guesswork.	947	* is much better than this function's guesswork.
975	*/	948	*/
976	int	949	int
977	maptile::estimate_difficulty () const	950	maptile::estimate_difficulty () const
978	{	951	{
979	long monster_cnt = 0;	952	long monster_cnt = 0;
…		…
991		964
992	if (QUERY_FLAG (op, FLAG_GENERATOR))	965	if (QUERY_FLAG (op, FLAG_GENERATOR))
993	{	966	{
994	total_exp += op->stats.exp;	967	total_exp += op->stats.exp;
995		968
996	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	969	if (archetype *at = op->other_arch)
		970	{
997	total_exp += at->stats.exp * 8;	971	total_exp += at->stats.exp * 8;
998
999	monster_cnt++;	972	monster_cnt++;
		973	}
		974
		975	for (object *inv = op->inv; inv; inv = inv->below)
		976	{
		977	total_exp += op->stats.exp * 8;
		978	monster_cnt++;
		979	}
1000	}	980	}
1001	}	981	}
1002		982
1003	avgexp = (double) total_exp / monster_cnt;	983	avgexp = (double) total_exp / monster_cnt;
1004		984
…		…
1017	* postive values make it darker, negative make it brighter	997	* postive values make it darker, negative make it brighter
1018	*/	998	*/
1019	int	999	int
1020	maptile::change_map_light (int change)	1000	maptile::change_map_light (int change)
1021	{	1001	{
1022	int new_level = darkness + change;
1023
1024	/* Nothing to do */	1002	/* Nothing to do */
1025	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1003	if (!change)
1026	return 0;	1004	return 0;
1027		1005
1028	/* inform all players on the map */	1006	/* inform all players on the map */
1029	if (change > 0)	1007	if (change > 0)
1030	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1008	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1031	else	1009	else
1032	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1010	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1033		1011
1034	/* Do extra checking. since darkness is a unsigned value,	1012	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1035	* we need to be extra careful about negative values.
1036	* In general, the checks below are only needed if change
1037	* is not +/-1
1038	*/
1039	if (new_level < 0)
1040	darkness = 0;
1041	else if (new_level >= MAX_DARKNESS)
1042	darkness = MAX_DARKNESS;
1043	else
1044	darkness = new_level;
1045		1013
1046	/* All clients need to get re-updated for the change */	1014	/* All clients need to get re-updated for the change */
1047	update_all_map_los (this);	1015	update_all_map_los (this);
		1016
1048	return 1;	1017	return 1;
1049	}	1018	}
1050		1019
1051	/*	1020	/*
1052	* This function updates various attributes about a specific space	1021	* This function updates various attributes about a specific space
…		…
1055	* through, etc)	1024	* through, etc)
1056	*/	1025	*/
1057	void	1026	void
1058	mapspace::update_ ()	1027	mapspace::update_ ()
1059	{	1028	{
1060	object tmp, last = 0;	1029	object *last = 0;
1061	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1030	uint8 flags = P_UPTODATE, anywhere = 0;
		1031	sint8 light = 0;
1062	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;
1063		1033
1064	//object *middle = 0;	1034	//object *middle = 0;
1065	//object *top = 0;	1035	//object *top = 0;
1066	//object *floor = 0;	1036	//object *floor = 0;
1067	// this seems to generate better code than using locals, above	1037	// this seems to generate better code than using locals, above
1068	object *&top = faces_obj[0] = 0;	1038	object *&top = faces_obj[0] = 0;
1069	object *&middle = faces_obj[1] = 0;	1039	object *&middle = faces_obj[1] = 0;
1070	object *&floor = faces_obj[2] = 0;	1040	object *&floor = faces_obj[2] = 0;
1071		1041
1072	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1042	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073	{	1043	{
1074	/* This could be made additive I guess (two lights better than	1044	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1075	* one). But if so, it shouldn't be a simple additive - 2
1076	* light bulbs do not illuminate twice as far as once since
1077	* it is a dissapation factor that is cubed.
1078	*/
1079	if (tmp->glow_radius > light)
1080	light = tmp->glow_radius;	1045	light += tmp->glow_radius;
1081		1046
1082	/* This call is needed in order to update objects the player	1047	/* This call is needed in order to update objects the player
1083	* is standing in that have animations (ie, grass, fire, etc).	1048	* is standing in that have animations (ie, grass, fire, etc).
1084	* However, it also causes the look window to be re-drawn	1049	* However, it also causes the look window to be re-drawn
1085	* 3 times each time the player moves, because many of the	1050	* 3 times each time the player moves, because many of the
…		…
1104	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1069	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1105	{	1070	{
1106	middle = tmp;	1071	middle = tmp;
1107	anywhere = 1;	1072	anywhere = 1;
1108	}	1073	}
		1074
1109	/* Find the highest visible face around. If equal	1075	/* Find the highest visible face around. If equal
1110	* visibilities, we still want the one nearer to the	1076	* visibilities, we still want the one nearer to the
1111	* top	1077	* top
1112	*/	1078	*/
1113	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))	1079	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
…		…
1132	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1098	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1133	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1099	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1134	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1100	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1135	}	1101	}
1136		1102
1137	this->light = light;	1103	this->light = min (light, MAX_LIGHT_RADIUS);
1138	this->flags_ = flags;	1104	this->flags_ = flags;
1139	this->move_block = move_block & ~move_allow;	1105	this->move_block = move_block & ~move_allow;
1140	this->move_on = move_on;	1106	this->move_on = move_on;
1141	this->move_off = move_off;	1107	this->move_off = move_off;
1142	this->move_slow = move_slow;	1108	this->move_slow = move_slow;
…		…
1162	* 1) top face is set, need middle to be set.	1128	* 1) top face is set, need middle to be set.
1163	* 2) middle is set, need to set top.	1129	* 2) middle is set, need to set top.
1164	* 3) neither middle or top is set - need to set both.	1130	* 3) neither middle or top is set - need to set both.
1165	*/	1131	*/
1166		1132
1167	for (tmp = last; tmp; tmp = tmp->below)	1133	for (object *tmp = last; tmp; tmp = tmp->below)
1168	{	1134	{
1169	/* Once we get to a floor, stop, since we already have a floor object */	1135	/* Once we get to a floor, stop, since we already have a floor object */
1170	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1136	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1171	break;	1137	break;
1172		1138
…		…
1224	vol += op->volume ();	1190	vol += op->volume ();
1225		1191
1226	return vol;	1192	return vol;
1227	}	1193	}
1228		1194
1229	bool	1195	maptile *
1230	maptile::tile_available (int dir, bool load)	1196	maptile::tile_available (int dir, bool load)
1231	{	1197	{
1232	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_IN_MEMORY))
1233	return 1;
1234
1235	if (!tile_path[dir])	1198	if (tile_path[dir])
1236	return 0;	1199	{
		1200	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1201	return tile_map[dir];
1237		1202
1238	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))	1203	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1239	return 1;	1204	return tile_map[dir];
		1205	}
1240		1206
1241	return 0;	1207	return 0;
1242	}	1208	}
1243		1209
1244	/* this returns TRUE if the coordinates (x,y) are out of	1210	/* this returns TRUE if the coordinates (x,y) are out of
…		…
1259	if (!m)	1225	if (!m)
1260	return 0;	1226	return 0;
1261		1227
1262	if (x < 0)	1228	if (x < 0)
1263	{	1229	{
1264	if (!m->tile_available (3, 0))	1230	if (!m->tile_available (3))
1265	return 1;	1231	return 1;
1266		1232
1267	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1233	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1268	}	1234	}
1269		1235
1270	if (x >= m->width)	1236	if (x >= m->width)
1271	{	1237	{
1272	if (!m->tile_available (1, 0))	1238	if (!m->tile_available (1))
1273	return 1;	1239	return 1;
1274		1240
1275	return out_of_map (m->tile_map[1], x - m->width, y);	1241	return out_of_map (m->tile_map[1], x - m->width, y);
1276	}	1242	}
1277		1243
1278	if (y < 0)	1244	if (y < 0)
1279	{	1245	{
1280	if (!m->tile_available (0, 0))	1246	if (!m->tile_available (0))
1281	return 1;	1247	return 1;
1282		1248
1283	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1249	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1284	}	1250	}
1285		1251
1286	if (y >= m->height)	1252	if (y >= m->height)
1287	{	1253	{
1288	if (!m->tile_available (2, 0))	1254	if (!m->tile_available (2))
1289	return 1;	1255	return 1;
1290		1256
1291	return out_of_map (m->tile_map[2], x, y - m->height);	1257	return out_of_map (m->tile_map[2], x, y - m->height);
1292	}	1258	}
1293		1259
…		…
1308	maptile *	1274	maptile *
1309	maptile::xy_find (sint16 &x, sint16 &y)	1275	maptile::xy_find (sint16 &x, sint16 &y)
1310	{	1276	{
1311	if (x < 0)	1277	if (x < 0)
1312	{	1278	{
1313	if (!tile_available (3, 1))	1279	if (!tile_available (3))
1314	return 0;	1280	return 0;
1315		1281
1316	x += tile_map[3]->width;	1282	x += tile_map[3]->width;
1317	return tile_map[3]->xy_find (x, y);	1283	return tile_map[3]->xy_find (x, y);
1318	}	1284	}
1319		1285
1320	if (x >= width)	1286	if (x >= width)
1321	{	1287	{
1322	if (!tile_available (1, 1))	1288	if (!tile_available (1))
1323	return 0;	1289	return 0;
1324		1290
1325	x -= width;	1291	x -= width;
1326	return tile_map[1]->xy_find (x, y);	1292	return tile_map[1]->xy_find (x, y);
1327	}	1293	}
1328		1294
1329	if (y < 0)	1295	if (y < 0)
1330	{	1296	{
1331	if (!tile_available (0, 1))	1297	if (!tile_available (0))
1332	return 0;	1298	return 0;
1333		1299
1334	y += tile_map[0]->height;	1300	y += tile_map[0]->height;
1335	return tile_map[0]->xy_find (x, y);	1301	return tile_map[0]->xy_find (x, y);
1336	}	1302	}
1337		1303
1338	if (y >= height)	1304	if (y >= height)
1339	{	1305	{
1340	if (!tile_available (2, 1))	1306	if (!tile_available (2))
1341	return 0;	1307	return 0;
1342		1308
1343	y -= height;	1309	y -= height;
1344	return tile_map[2]->xy_find (x, y);	1310	return tile_map[2]->xy_find (x, y);
1345	}	1311	}
…		…
1358	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1324	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1359	{	1325	{
1360	if (!map1 \|\| !map2)	1326	if (!map1 \|\| !map2)
1361	return 0;	1327	return 0;
1362		1328
1363	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1329	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1364	//fix: compare paths instead (this is likely faster, too!)	1330	//fix: compare paths instead (this is likely faster, too!)
1365	if (map1 == map2)	1331	if (map1 == map2)
1366	{	1332	{
1367	*dx = 0;	1333	*dx = 0;
1368	*dy = 0;	1334	*dy = 0;
…		…
1550	else	1516	else
1551	{	1517	{
1552	retval->distance_x += op2->x - x;	1518	retval->distance_x += op2->x - x;
1553	retval->distance_y += op2->y - y;	1519	retval->distance_y += op2->y - y;
1554		1520
1555	retval->part = NULL;	1521	retval->part = 0;
1556	retval->distance = idistance (retval->distance_x, retval->distance_y);	1522	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1557	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1523	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1558	}	1524	}
1559	}	1525	}
1560		1526
1561	/* Returns true of op1 and op2 are effectively on the same map	1527	/* Returns true of op1 and op2 are effectively on the same map
…		…
1575	}	1541	}
1576		1542
1577	object *	1543	object *
1578	maptile::insert (object op, int x, int y, object originator, int flags)	1544	maptile::insert (object op, int x, int y, object originator, int flags)
1579	{	1545	{
1580	if (!op->flag [FLAG_REMOVED])
1581	op->remove ();
1582
1583	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1546	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1584	}	1547	}
1585		1548
1586	region *	1549	region *
1587	maptile::region (int x, int y) const	1550	maptile::region (int x, int y) const
…		…
1597		1560
1598	return ::region::default_region ();	1561	return ::region::default_region ();
1599	}	1562	}
1600		1563
1601	/* picks a random object from a style map.	1564	/* picks a random object from a style map.
1602	* Redone by MSW so it should be faster and not use static
1603	* variables to generate tables.
1604	*/	1565	*/
1605	object *	1566	object *
1606	maptile::pick_random_object () const	1567	maptile::pick_random_object (rand_gen &gen) const
1607	{	1568	{
1608	/* while returning a null object will result in a crash, that	1569	/* while returning a null object will result in a crash, that
1609	* is actually preferable to an infinite loop. That is because	1570	* is actually preferable to an infinite loop. That is because
1610	* most servers will automatically restart in case of crash.	1571	* most servers will automatically restart in case of crash.
1611	* Change the logic on getting the random space - shouldn't make	1572	* Change the logic on getting the random space - shouldn't make
1612	* any difference, but this seems clearer to me.	1573	* any difference, but this seems clearer to me.
1613	*/	1574	*/
1614	for (int i = 1000; --i;)	1575	for (int i = 1000; --i;)
1615	{	1576	{
1616	object *pick = at (rndm (width), rndm (height)).bot;	1577	object *pick = at (gen (width), gen (height)).bot;
1617		1578
1618	// do not prefer big monsters just because they are big.	1579	// do not prefer big monsters just because they are big.
1619	if (pick && pick->head_ () == pick)	1580	if (pick && pick->is_head ())
1620	return pick->head_ ();	1581	return pick->head_ ();
1621	}	1582	}
1622		1583
1623	// instead of crashing in the unlikely(?) case, try to return something	1584	// instead of crashing in the unlikely(?) case, try to return something
1624	return get_archetype ("blocked");	1585	return archetype::find ("bug");
1625	}	1586	}
1626		1587
1627	void	1588	void
1628	maptile::play_sound (faceidx sound, int x, int y) const	1589	maptile::play_sound (faceidx sound, int x, int y) const
1629	{	1590	{
1630	if (!sound)	1591	if (!sound)
1631	return;	1592	return;
1632		1593
		1594	for_all_players_on_map (pl, this)
		1595	if (client *ns = pl->ns)
		1596	{
		1597	int dx = x - pl->ob->x;
		1598	int dy = y - pl->ob->y;
		1599
		1600	int distance = idistance (dx, dy);
		1601
		1602	if (distance <= MAX_SOUND_DISTANCE)
		1603	ns->play_sound (sound, dx, dy);
		1604	}
		1605	}
		1606
		1607	void
		1608	maptile::say_msg (const char *msg, int x, int y) const
		1609	{
1633	for_all_players (pl)	1610	for_all_players (pl)
1634	if (pl->ob->map == this)
1635	if (client *ns = pl->ns)	1611	if (client *ns = pl->ns)
1636	{	1612	{
1637	int dx = x - pl->ob->x;	1613	int dx = x - pl->ob->x;
1638	int dy = y - pl->ob->y;	1614	int dy = y - pl->ob->y;
1639		1615
1640	int distance = idistance (dx, dy);	1616	int distance = idistance (dx, dy);
1641		1617
1642	if (distance <= MAX_SOUND_DISTANCE)	1618	if (distance <= MAX_SOUND_DISTANCE)
1643	ns->play_sound (sound, dx, dy);	1619	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
1644	}	1620	}
1645	}	1621	}
1646		1622
		1623	static void
		1624	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1625	{
		1626	// clip to map to the left
		1627	if (x0 < 0)
		1628	{
		1629	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1630	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1631
		1632	if (x1 < 0) // entirely to the left
		1633	return;
		1634
		1635	x0 = 0;
		1636	}
		1637
		1638	// clip to map to the right
		1639	if (x1 > m->width)
		1640	{
		1641	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1642	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1643
		1644	if (x0 > m->width) // entirely to the right
		1645	return;
		1646
		1647	x1 = m->width;
		1648	}
		1649
		1650	// clip to map above
		1651	if (y0 < 0)
		1652	{
		1653	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1654	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1655
		1656	if (y1 < 0) // entirely above
		1657	return;
		1658
		1659	y0 = 0;
		1660	}
		1661
		1662	// clip to map below
		1663	if (y1 > m->height)
		1664	{
		1665	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1666	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1667
		1668	if (y0 > m->height) // entirely below
		1669	return;
		1670
		1671	y1 = m->height;
		1672	}
		1673
		1674	// if we get here, the rect is within the current map
		1675	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1676
		1677	r->m = m;
		1678	r->x0 = x0;
		1679	r->y0 = y0;
		1680	r->x1 = x1;
		1681	r->y1 = y1;
		1682	r->dx = dx;
		1683	r->dy = dy;
		1684	}
		1685
		1686	maprect *
		1687	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1688	{
		1689	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1690	buf.clear ();
		1691
		1692	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1693
		1694	// add end marker
		1695	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1696	r->m = 0;
		1697
		1698	return (maprect *)buf.linearise ();
		1699	}
		1700

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.117 by root, Fri Aug 24 00:26:09 2007 UTC vs. Revision 1.160 by root, Mon Oct 12 14:00:57 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.117 by root, Fri Aug 24 00:26:09 2007 UTC vs.
Revision 1.160 by root, Mon Oct 12 14:00:57 2009 UTC