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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.112 by root, Thu Jul 12 18:48:20 2007 UTC vs.
Revision 1.158 by root, Tue Feb 17 03:53:31 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
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	* the Free Software Foundation, either version 3 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your 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,
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 GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	22	*/
23		23
24	#include <unistd.h>	24	#include <unistd.h>
25		25
26	#include "global.h"	26	#include "global.h"
27	#include "funcpoint.h"
28
29	#include "loader.h"	27	#include "loader.h"
30
31	#include "path.h"	28	#include "path.h"
32		29
33	/*	30	sint8 maptile::outdoor_darkness;
34	* This makes a path absolute outside the world of Crossfire.
35	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
36	* and returns the pointer to a static array containing the result.
37	* it really should be called create_mapname
38	*/
39	const char *
40	create_pathname (const char *name)
41	{
42	static char buf[8192];
43	snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
44	return buf;
45	}
46
47	/*
48	* This function checks if a file with the given path exists.
49	* -1 is returned if it fails, otherwise the mode of the file
50	* is returned.
51	* It tries out all the compression suffixes listed in the uncomp[] array.
52	*
53	* If prepend_dir is set, then we call create_pathname (which prepends
54	* libdir & mapdir). Otherwise, we assume the name given is fully
55	* complete.
56	* Only the editor actually cares about the writablity of this -
57	* the rest of the code only cares that the file is readable.
58	* when the editor goes away, the call to stat should probably be
59	* replaced by an access instead (similar to the windows one, but
60	* that seems to be missing the prepend_dir processing
61	*/
62	int
63	check_path (const char *name, int prepend_dir)
64	{
65	char buf[MAX_BUF];
66
67	char *endbuf;
68	struct stat statbuf;
69	int mode = 0;
70
71	if (prepend_dir)
72	assign (buf, create_pathname (name));
73	else
74	assign (buf, name);
75
76	/* old method (strchr(buf, '\0')) seemd very odd to me -
77	* this method should be equivalant and is clearer.
78	* Can not use strcat because we need to cycle through
79	* all the names.
80	*/
81	endbuf = buf + strlen (buf);
82
83	if (stat (buf, &statbuf))
84	return -1;
85	if (!S_ISREG (statbuf.st_mode))
86	return (-1);
87
88	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) \|\|
89	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IROTH))
90	mode \|= 4;
91
92	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) \|\|
93	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IWOTH))
94	mode \|= 2;
95
96	return (mode);
97	}
98		31
99	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	32	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100	* one function that just returns a P_.. value (see map.h)	33	* one function that just returns a P_.. value (see map.h)
101	* it will also do map translation for tiled maps, returning	34	* it will also do map translation for tiled maps, returning
102	* new values into newmap, nx, and ny. Any and all of those	35	* new values into newmap, nx, and ny. Any and all of those
…		…
232	}	165	}
233	return 0;	166	return 0;
234	}	167	}
235		168
236	/*	169	/*
237	* Returns true if the given object can't fit in the given spot.	170	* Returns qthe blocking object if the given object can't fit in the given
238	* This is meant for multi space objects - for single space objecs,	171	* spot. This is meant for multi space objects - for single space objecs,
239	* just calling get_map_blocked and checking that against movement type	172	* just calling get_map_blocked and checking that against movement type
240	* of object. This function goes through all the parts of the	173	* of object. This function goes through all the parts of the multipart
241	* multipart object and makes sure they can be inserted.	174	* object and makes sure they can be inserted.
242	*	175	*
243	* While this doesn't call out of map, the get_map_flags does.	176	* While this doesn't call out of map, the get_map_flags does.
244	*	177	*
245	* This function has been used to deprecate arch_out_of_map -	178	* This function has been used to deprecate arch_out_of_map -
246	* this function also does that check, and since in most cases,	179	* this function also does that check, and since in most cases,
…		…
257	*	190	*
258	* Note this used to be arch_blocked, but with new movement	191	* Note this used to be arch_blocked, but with new movement
259	* code, we need to have actual object to check its move_type	192	* code, we need to have actual object to check its move_type
260	* against the move_block values.	193	* against the move_block values.
261	*/	194	*/
262	int	195	bool
263	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	196	object::blocked (maptile *m, int x, int y) const
264	{	197	{
265	archetype *tmp;	198	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
266	int flag;
267	maptile *m1;
268	sint16 sx, sy;
269
270	if (!ob)
271	{
272	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
273	if (flag & P_OUT_OF_MAP)
274	return P_OUT_OF_MAP;
275
276	/* don't have object, so don't know what types would block */
277	return m1->at (sx, sy).move_block;
278	}	199	{
		200	mapxy pos (m, x + tmp->x, y + tmp->y);
279		201
280	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)	202	if (!pos.normalise ())
281	{	203	return 1;
282	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
283		204
284	if (flag & P_OUT_OF_MAP)	205	mapspace &ms = *pos;
285	return P_OUT_OF_MAP;	206
286	if (flag & P_IS_ALIVE)	207	if (ms.flags () & P_IS_ALIVE)
287	return P_IS_ALIVE;	208	return 1;
288		209
289	mapspace &ms = m1->at (sx, sy);	210	/* However, often ob doesn't have any move type
290		211	* (signifying non-moving objects)
291	/* find_first_free_spot() calls this function. However, often
292	* ob doesn't have any move type (when used to place exits)
293	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	212	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
294	*/	213	*/
295
296	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	214	if (!move_type && ms.move_block != MOVE_ALL)
297	continue;	215	continue;
298		216
299	/* Note it is intentional that we check ob - the movement type of the	217	/* Note it is intentional that we check ob - the movement type of the
300	* head of the object should correspond for the entire object.	218	* head of the object should correspond for the entire object.
301	*/	219	*/
302	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	220	if (ms.blocks (move_type))
303	return P_NO_PASS;	221	return 1;
304	}	222	}
305		223
306	return 0;	224	return 0;
307	}	225	}
308		226
…		…
326		244
327	insert_ob_in_ob (tmp, container);	245	insert_ob_in_ob (tmp, container);
328	tmp = next;	246	tmp = next;
329	}	247	}
330		248
331	/* sum_weight will go through and calculate what all the containers are	249	// go through and calculate what all the containers are carrying.
332	* carrying.	250	//TODO: remove
333	*/	251	container->update_weight ();
334	sum_weight (container);
335	}	252	}
336		253
337	void	254	void
338	maptile::set_object_flag (int flag, int value)	255	maptile::set_object_flag (int flag, int value)
339	{	256	{
…		…
341	return;	258	return;
342		259
343	for (mapspace *ms = spaces + size (); ms-- > spaces; )	260	for (mapspace *ms = spaces + size (); ms-- > spaces; )
344	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	261	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
345	tmp->flag [flag] = value;	262	tmp->flag [flag] = value;
		263	}
		264
		265	void
		266	maptile::post_load_original ()
		267	{
		268	if (!spaces)
		269	return;
		270
		271	set_object_flag (FLAG_OBJ_ORIGINAL);
		272
		273	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		274	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		275	INVOKE_OBJECT (RESET, tmp);
346	}	276	}
347		277
348	/* link_multipart_objects go through all the objects on the map looking	278	/* link_multipart_objects go through all the objects on the map looking
349	* for objects whose arch says they are multipart yet according to the	279	* for objects whose arch says they are multipart yet according to the
350	* info we have, they only have the head (as would be expected when	280	* info we have, they only have the head (as would be expected when
…		…
388	bool	318	bool
389	maptile::_load_objects (object_thawer &f)	319	maptile::_load_objects (object_thawer &f)
390	{	320	{
391	for (;;)	321	for (;;)
392	{	322	{
393	coroapi::cede_to_tick_every (100); // cede once in a while	323	coroapi::cede_to_tick (); // cede once in a while
394		324
395	switch (f.kw)	325	switch (f.kw)
396	{	326	{
397	case KW_arch:	327	case KW_arch:
398	if (object *op = object::read (f, this))	328	if (object *op = object::read (f, this))
399	{	329	{
		330	// TODO: why?
400	if (op->inv)	331	if (op->inv)
401	sum_weight (op);	332	op->update_weight ();
402		333
403	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	334	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		335	{
		336	// we insert manually because
		337	// a) its way faster
		338	// b) we remove manually, too, and there are good reasons for that
		339	// c) it's correct
		340	mapspace &ms = at (op->x, op->y);
		341
		342	op->flag [FLAG_REMOVED] = false;
		343
		344	op->above = 0;
		345	op->below = ms.top;
		346
		347	*(ms.top ? &ms.top->above : &ms.bot) = op;
		348
		349	ms.top = op;
		350	ms.flags_ = 0;
		351	}
		352	else
		353	{
		354	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		355	op->destroy ();
		356	}
404	}	357	}
405		358
406	continue;	359	continue;
407		360
408	case KW_EOF:	361	case KW_EOF:
…		…
421	}	374	}
422		375
423	void	376	void
424	maptile::activate ()	377	maptile::activate ()
425	{	378	{
426	active = true;
427
428	if (spaces)	379	if (spaces)
429	for (mapspace *ms = spaces + size (); ms-- > spaces; )	380	for (mapspace *ms = spaces + size (); ms-- > spaces; )
430	for (object *op = ms->bot; op; op = op->above)	381	for (object *op = ms->bot; op; op = op->above)
431	op->activate_recursive ();	382	op->activate_recursive ();
432	}	383	}
433		384
434	void	385	void
435	maptile::deactivate ()	386	maptile::deactivate ()
436	{	387	{
437	active = false;
438
439	if (spaces)	388	if (spaces)
440	for (mapspace *ms = spaces + size (); ms-- > spaces; )	389	for (mapspace *ms = spaces + size (); ms-- > spaces; )
441	for (object *op = ms->bot; op; op = op->above)	390	for (object *op = ms->bot; op; op = op->above)
442	op->deactivate_recursive ();	391	op->deactivate_recursive ();
443	}	392	}
…		…
453	if (!spaces)	402	if (!spaces)
454	return false;	403	return false;
455		404
456	for (int i = 0; i < size (); ++i)	405	for (int i = 0; i < size (); ++i)
457	{	406	{
458	int unique = 0;	407	bool unique = 0;
		408
459	for (object *op = spaces [i].bot; op; op = op->above)	409	for (object *op = spaces [i].bot; op; op = op->above)
460	{	410	{
461	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	411	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
462	unique = 1;
463		412
464	if (!op->can_map_save ())	413	if (expect_false (!op->can_map_save ()))
465	continue;	414	continue;
466		415
467	if (unique \|\| op->flag [FLAG_UNIQUE])	416	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
468	{	417	{
469	if (flags & IO_UNIQUES)	418	if (flags & IO_UNIQUES)
470	op->write (f);	419	op->write (f);
471	}	420	}
472	else if (flags & IO_OBJECTS)	421	else if (expect_true (flags & IO_OBJECTS))
473	op->write (f);	422	op->write (f);
474	}	423	}
475	}	424	}
476		425
477	coroapi::cede_to_tick ();	426	coroapi::cede_to_tick ();
478		427
479	return true;	428	return true;
480	}
481
482	bool
483	maptile::_load_objects (const char *path, bool skip_header)
484	{
485	object_thawer f (path);
486
487	if (!f)
488	return false;
489
490	f.next ();
491
492	if (skip_header)
493	for (;;)
494	{
495	keyword kw = f.kw;
496	f.skip ();
497	if (kw == KW_end)
498	break;
499	}
500
501	return _load_objects (f);
502	}	429	}
503		430
504	bool	431	bool
505	maptile::_save_objects (const char *path, int flags)	432	maptile::_save_objects (const char *path, int flags)
506	{	433	{
…		…
681	bool	608	bool
682	maptile::_load_header (object_thawer &thawer)	609	maptile::_load_header (object_thawer &thawer)
683	{	610	{
684	for (;;)	611	for (;;)
685	{	612	{
686	thawer.next ();
687
688	switch (thawer.kw)	613	switch (thawer.kw)
689	{	614	{
690	case KW_msg:	615	case KW_msg:
691	thawer.get_ml (KW_endmsg, msg);	616	thawer.get_ml (KW_endmsg, msg);
692	break;	617	break;
…		…
726	case KW_sky: thawer.get (sky); break;	651	case KW_sky: thawer.get (sky); break;
727		652
728	case KW_per_player: thawer.get (per_player); break;	653	case KW_per_player: thawer.get (per_player); break;
729	case KW_per_party: thawer.get (per_party); break;	654	case KW_per_party: thawer.get (per_party); break;
730	case KW_no_reset: thawer.get (no_reset); break;	655	case KW_no_reset: thawer.get (no_reset); break;
		656	case KW_no_drop: thawer.get (no_drop); break;
731		657
732	case KW_region: default_region = region::find (thawer.get_str ()); break;	658	case KW_region: default_region = region::find (thawer.get_str ()); break;
733	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	659	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
734		660
735	// old names new names	661	// old names new names
…		…
747	case KW_tile_path_2: thawer.get (tile_path [1]); break;	673	case KW_tile_path_2: thawer.get (tile_path [1]); break;
748	case KW_tile_path_3: thawer.get (tile_path [2]); break;	674	case KW_tile_path_3: thawer.get (tile_path [2]); break;
749	case KW_tile_path_4: thawer.get (tile_path [3]); break;	675	case KW_tile_path_4: thawer.get (tile_path [3]); break;
750		676
751	case KW_ERROR:	677	case KW_ERROR:
752	set_key (thawer.kw_str, thawer.value);	678	set_key_text (thawer.kw_str, thawer.value);
753	break;	679	break;
754		680
755	case KW_end:	681	case KW_end:
		682	thawer.next ();
756	return true;	683	return true;
757		684
758	default:	685	default:
759	if (!thawer.parse_error ("map", 0))	686	if (!thawer.parse_error ("map", 0))
760	return false;	687	return false;
761	break;	688	break;
762	}	689	}
		690
		691	thawer.next ();
763	}	692	}
764		693
765	abort ();	694	abort ();
766	}
767
768	bool
769	maptile::_load_header (const char *path)
770	{
771	object_thawer thawer (path);
772
773	if (!thawer)
774	return false;
775
776	return _load_header (thawer);
777	}	695	}
778		696
779	/******************************************************************************	697	/******************************************************************************
780	* This is the start of unique map handling code	698	* This is the start of unique map handling code
781	*****************************************************************************/	699	*****************************************************************************/
…		…
793		711
794	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	712	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
795	unique = 1;	713	unique = 1;
796		714
797	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	715	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
798	{
799	op->destroy_inv (false);
800	op->destroy ();	716	op->destroy ();
801	}
802		717
803	op = above;	718	op = above;
804	}	719	}
805	}	720	}
806	}	721	}
…		…
817	MAP_OUT (swap_time);	732	MAP_OUT (swap_time);
818	MAP_OUT (reset_time);	733	MAP_OUT (reset_time);
819	MAP_OUT (reset_timeout);	734	MAP_OUT (reset_timeout);
820	MAP_OUT (fixed_resettime);	735	MAP_OUT (fixed_resettime);
821	MAP_OUT (no_reset);	736	MAP_OUT (no_reset);
		737	MAP_OUT (no_drop);
822	MAP_OUT (difficulty);	738	MAP_OUT (difficulty);
823		739
824	if (default_region) MAP_OUT2 (region, default_region->name);	740	if (default_region) MAP_OUT2 (region, default_region->name);
825		741
826	if (shopitems)	742	if (shopitems)
…		…
880	* Remove and free all objects in the given map.	796	* Remove and free all objects in the given map.
881	*/	797	*/
882	void	798	void
883	maptile::clear ()	799	maptile::clear ()
884	{	800	{
885	sfree (regions, size ()), regions = 0;
886	free (regionmap), regionmap = 0;
887
888	if (spaces)	801	if (spaces)
889	{	802	{
890	for (mapspace *ms = spaces + size (); ms-- > spaces; )	803	for (mapspace *ms = spaces + size (); ms-- > spaces; )
891	while (object *op = ms->bot)	804	while (object *op = ms->bot)
892	{	805	{
		806	// manually remove, as to not trigger anything
		807	if (ms->bot = op->above)
		808	ms->bot->below = 0;
		809
		810	op->flag [FLAG_REMOVED] = true;
		811
893	op = op->head_ ();	812	object *head = op->head_ ();
894	op->destroy_inv (false);	813	if (op == head)
895	op->destroy ();	814	op->destroy ();
		815	else if (head->map != op->map)
		816	{
		817	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		818	head->destroy ();
		819	}
896	}	820	}
897		821
898	sfree (spaces, size ()), spaces = 0;	822	sfree0 (spaces, size ());
899	}	823	}
900		824
901	if (buttons)	825	if (buttons)
902	free_objectlinkpt (buttons), buttons = 0;	826	free_objectlinkpt (buttons), buttons = 0;
		827
		828	sfree0 (regions, size ());
		829	delete [] regionmap; regionmap = 0;
903	}	830	}
904		831
905	void	832	void
906	maptile::clear_header ()	833	maptile::clear_header ()
907	{	834	{
…		…
959	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	886	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
960	break;	887	break;
961		888
962	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	889	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
963	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)	890	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
964	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
965	\|\| QUERY_FLAG (op, FLAG_UNIQUE)	891	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
966	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)	892	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
967	\|\| QUERY_FLAG (op, FLAG_UNPAID)	893	\|\| QUERY_FLAG (op, FLAG_UNPAID)
968	\|\| op->is_alive ())	894	\|\| op->is_alive ())
969	; // do not decay	895	; // do not decay
…		…
1008	op->destroy ();	934	op->destroy ();
1009	}	935	}
1010	}	936	}
1011		937
1012	/*	938	/*
1013	* Updates every button on the map (by calling update_button() for them).
1014	*/
1015	void
1016	maptile::update_buttons ()
1017	{
1018	for (oblinkpt *obp = buttons; obp; obp = obp->next)
1019	for (objectlink *ol = obp->link; ol; ol = ol->next)
1020	{
1021	if (!ol->ob)
1022	{
1023	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
1024	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
1025	continue;
1026	}
1027
1028	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
1029	{
1030	update_button (ol->ob);
1031	break;
1032	}
1033	}
1034	}
1035
1036	/*
1037	* This routine is supposed to find out the difficulty of the map.	939	* This routine is supposed to find out the difficulty of the map.
1038	* difficulty does not have a lot to do with character level,	940	* difficulty does not have a lot to do with character level,
1039	* but does have a lot to do with treasure on the map.	941	* but does have a lot to do with treasure on the map.
1040	*	942	*
1041	* Difficulty can now be set by the map creature. If the value stored	943	* Difficulty can now be set by the map creator. If the value stored
1042	* in the map is zero, then use this routine. Maps should really	944	* in the map is zero, then use this routine. Maps should really
1043	* have a difficulty set than using this function - human calculation	945	* have a difficulty set rather than using this function - human calculation
1044	* is much better than this functions guesswork.	946	* is much better than this function's guesswork.
1045	*/	947	*/
1046	int	948	int
1047	maptile::estimate_difficulty () const	949	maptile::estimate_difficulty () const
1048	{	950	{
1049	long monster_cnt = 0;	951	long monster_cnt = 0;
…		…
1061		963
1062	if (QUERY_FLAG (op, FLAG_GENERATOR))	964	if (QUERY_FLAG (op, FLAG_GENERATOR))
1063	{	965	{
1064	total_exp += op->stats.exp;	966	total_exp += op->stats.exp;
1065		967
1066	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	968	if (archetype *at = op->other_arch)
		969	{
1067	total_exp += at->stats.exp * 8;	970	total_exp += at->stats.exp * 8;
1068
1069	monster_cnt++;	971	monster_cnt++;
		972	}
		973
		974	for (object *inv = op->inv; inv; inv = inv->below)
		975	{
		976	total_exp += op->stats.exp * 8;
		977	monster_cnt++;
		978	}
1070	}	979	}
1071	}	980	}
1072		981
1073	avgexp = (double) total_exp / monster_cnt;	982	avgexp = (double) total_exp / monster_cnt;
1074		983
…		…
1087	* postive values make it darker, negative make it brighter	996	* postive values make it darker, negative make it brighter
1088	*/	997	*/
1089	int	998	int
1090	maptile::change_map_light (int change)	999	maptile::change_map_light (int change)
1091	{	1000	{
1092	int new_level = darkness + change;
1093
1094	/* Nothing to do */	1001	/* Nothing to do */
1095	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1002	if (!change)
1096	return 0;	1003	return 0;
1097		1004
1098	/* inform all players on the map */	1005	/* inform all players on the map */
1099	if (change > 0)	1006	if (change > 0)
1100	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1007	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1101	else	1008	else
1102	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1009	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1103		1010
1104	/* Do extra checking. since darkness is a unsigned value,	1011	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1105	* we need to be extra careful about negative values.
1106	* In general, the checks below are only needed if change
1107	* is not +/-1
1108	*/
1109	if (new_level < 0)
1110	darkness = 0;
1111	else if (new_level >= MAX_DARKNESS)
1112	darkness = MAX_DARKNESS;
1113	else
1114	darkness = new_level;
1115		1012
1116	/* All clients need to get re-updated for the change */	1013	/* All clients need to get re-updated for the change */
1117	update_all_map_los (this);	1014	update_all_map_los (this);
		1015
1118	return 1;	1016	return 1;
1119	}	1017	}
1120		1018
1121	/*	1019	/*
1122	* This function updates various attributes about a specific space	1020	* This function updates various attributes about a specific space
…		…
1125	* through, etc)	1023	* through, etc)
1126	*/	1024	*/
1127	void	1025	void
1128	mapspace::update_ ()	1026	mapspace::update_ ()
1129	{	1027	{
1130	object tmp, last = 0;	1028	object *last = 0;
1131	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1029	uint8 flags = P_UPTODATE, anywhere = 0;
		1030	sint8 light = 0;
1132	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1031	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1133		1032
1134	//object *middle = 0;	1033	//object *middle = 0;
1135	//object *top = 0;	1034	//object *top = 0;
1136	//object *floor = 0;	1035	//object *floor = 0;
1137	// this seems to generate better code than using locals, above	1036	// this seems to generate better code than using locals, above
1138	object *&top = faces_obj[0] = 0;	1037	object *&top = faces_obj[0] = 0;
1139	object *&middle = faces_obj[1] = 0;	1038	object *&middle = faces_obj[1] = 0;
1140	object *&floor = faces_obj[2] = 0;	1039	object *&floor = faces_obj[2] = 0;
1141		1040
1142	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1041	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1143	{	1042	{
1144	/* This could be made additive I guess (two lights better than	1043	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1145	* one). But if so, it shouldn't be a simple additive - 2
1146	* light bulbs do not illuminate twice as far as once since
1147	* it is a dissapation factor that is cubed.
1148	*/
1149	if (tmp->glow_radius > light)
1150	light = tmp->glow_radius;	1044	light += tmp->glow_radius;
1151		1045
1152	/* This call is needed in order to update objects the player	1046	/* This call is needed in order to update objects the player
1153	* is standing in that have animations (ie, grass, fire, etc).	1047	* is standing in that have animations (ie, grass, fire, etc).
1154	* However, it also causes the look window to be re-drawn	1048	* However, it also causes the look window to be re-drawn
1155	* 3 times each time the player moves, because many of the	1049	* 3 times each time the player moves, because many of the
…		…
1174	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1068	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1175	{	1069	{
1176	middle = tmp;	1070	middle = tmp;
1177	anywhere = 1;	1071	anywhere = 1;
1178	}	1072	}
		1073
1179	/* Find the highest visible face around. If equal	1074	/* Find the highest visible face around. If equal
1180	* visibilities, we still want the one nearer to the	1075	* visibilities, we still want the one nearer to the
1181	* top	1076	* top
1182	*/	1077	*/
1183	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))	1078	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
…		…
1202	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1097	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1203	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1098	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1204	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1099	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1205	}	1100	}
1206		1101
1207	this->light = light;	1102	this->light = min (light, MAX_LIGHT_RADIUS);
1208	this->flags_ = flags;	1103	this->flags_ = flags;
1209	this->move_block = move_block & ~move_allow;	1104	this->move_block = move_block & ~move_allow;
1210	this->move_on = move_on;	1105	this->move_on = move_on;
1211	this->move_off = move_off;	1106	this->move_off = move_off;
1212	this->move_slow = move_slow;	1107	this->move_slow = move_slow;
…		…
1232	* 1) top face is set, need middle to be set.	1127	* 1) top face is set, need middle to be set.
1233	* 2) middle is set, need to set top.	1128	* 2) middle is set, need to set top.
1234	* 3) neither middle or top is set - need to set both.	1129	* 3) neither middle or top is set - need to set both.
1235	*/	1130	*/
1236		1131
1237	for (tmp = last; tmp; tmp = tmp->below)	1132	for (object *tmp = last; tmp; tmp = tmp->below)
1238	{	1133	{
1239	/* Once we get to a floor, stop, since we already have a floor object */	1134	/* Once we get to a floor, stop, since we already have a floor object */
1240	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1135	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1241	break;	1136	break;
1242		1137
…		…
1294	vol += op->volume ();	1189	vol += op->volume ();
1295		1190
1296	return vol;	1191	return vol;
1297	}	1192	}
1298		1193
1299	/* this updates the orig_map->tile_map[tile_num] value after finding	1194	maptile *
1300	* the map. It also takes care of linking back the freshly found	1195	maptile::tile_available (int dir, bool load)
1301	* maps tile_map values if it tiles back to this one. It returns
1302	* the value of orig_map->tile_map[tile_num].
1303	*/
1304	static inline maptile *
1305	find_and_link (maptile *orig_map, int tile_num)
1306	{	1196	{
1307	maptile *mp = orig_map->tile_map [tile_num];	1197	if (tile_path[dir])
1308
1309	if (!mp)
1310	{
1311	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1312
1313	if (!mp)
1314	{
1315	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1316	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1317	&orig_map->tile_path[tile_num], &orig_map->path);
1318	mp = new maptile (1, 1);
1319	mp->alloc ();
1320	mp->in_memory = MAP_IN_MEMORY;
1321	}
1322	}	1198	{
		1199	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1200	return tile_map[dir];
1323		1201
1324	int dest_tile = (tile_num + 2) % 4;	1202	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1203	return tile_map[dir];
		1204	}
1325		1205
1326	orig_map->tile_map [tile_num] = mp;
1327
1328	// optimisation: back-link map to origin map if euclidean
1329	//TODO: non-euclidean maps MUST GO
1330	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1331	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1332
1333	return mp;	1206	return 0;
1334	}
1335
1336	static inline void
1337	load_and_link (maptile *orig_map, int tile_num)
1338	{
1339	find_and_link (orig_map, tile_num)->load_sync ();
1340	}	1207	}
1341		1208
1342	/* this returns TRUE if the coordinates (x,y) are out of	1209	/* this returns TRUE if the coordinates (x,y) are out of
1343	* map m. This function also takes into account any	1210	* map m. This function also takes into account any
1344	* tiling considerations, loading adjacant maps as needed.	1211	* tiling considerations, loading adjacant maps as needed.
…		…
1357	if (!m)	1224	if (!m)
1358	return 0;	1225	return 0;
1359		1226
1360	if (x < 0)	1227	if (x < 0)
1361	{	1228	{
1362	if (!m->tile_path[3])	1229	if (!m->tile_available (3))
1363	return 1;	1230	return 1;
1364		1231
1365	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1366	find_and_link (m, 3);
1367
1368	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1232	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1369	}	1233	}
1370		1234
1371	if (x >= m->width)	1235	if (x >= m->width)
1372	{	1236	{
1373	if (!m->tile_path[1])	1237	if (!m->tile_available (1))
1374	return 1;	1238	return 1;
1375		1239
1376	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1377	find_and_link (m, 1);
1378
1379	return out_of_map (m->tile_map[1], x - m->width, y);	1240	return out_of_map (m->tile_map[1], x - m->width, y);
1380	}	1241	}
1381		1242
1382	if (y < 0)	1243	if (y < 0)
1383	{	1244	{
1384	if (!m->tile_path[0])	1245	if (!m->tile_available (0))
1385	return 1;	1246	return 1;
1386		1247
1387	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1388	find_and_link (m, 0);
1389
1390	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1248	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1391	}	1249	}
1392		1250
1393	if (y >= m->height)	1251	if (y >= m->height)
1394	{	1252	{
1395	if (!m->tile_path[2])	1253	if (!m->tile_available (2))
1396	return 1;	1254	return 1;
1397
1398	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1399	find_and_link (m, 2);
1400		1255
1401	return out_of_map (m->tile_map[2], x, y - m->height);	1256	return out_of_map (m->tile_map[2], x, y - m->height);
1402	}	1257	}
1403		1258
1404	/* Simple case - coordinates are within this local	1259	/* Simple case - coordinates are within this local
…		…
1418	maptile *	1273	maptile *
1419	maptile::xy_find (sint16 &x, sint16 &y)	1274	maptile::xy_find (sint16 &x, sint16 &y)
1420	{	1275	{
1421	if (x < 0)	1276	if (x < 0)
1422	{	1277	{
1423	if (!tile_path[3])	1278	if (!tile_available (3))
1424	return 0;	1279	return 0;
1425		1280
1426	find_and_link (this, 3);
1427	x += tile_map[3]->width;	1281	x += tile_map[3]->width;
1428	return tile_map[3]->xy_find (x, y);	1282	return tile_map[3]->xy_find (x, y);
1429	}	1283	}
1430		1284
1431	if (x >= width)	1285	if (x >= width)
1432	{	1286	{
1433	if (!tile_path[1])	1287	if (!tile_available (1))
1434	return 0;	1288	return 0;
1435		1289
1436	find_and_link (this, 1);
1437	x -= width;	1290	x -= width;
1438	return tile_map[1]->xy_find (x, y);	1291	return tile_map[1]->xy_find (x, y);
1439	}	1292	}
1440		1293
1441	if (y < 0)	1294	if (y < 0)
1442	{	1295	{
1443	if (!tile_path[0])	1296	if (!tile_available (0))
1444	return 0;	1297	return 0;
1445		1298
1446	find_and_link (this, 0);
1447	y += tile_map[0]->height;	1299	y += tile_map[0]->height;
1448	return tile_map[0]->xy_find (x, y);	1300	return tile_map[0]->xy_find (x, y);
1449	}	1301	}
1450		1302
1451	if (y >= height)	1303	if (y >= height)
1452	{	1304	{
1453	if (!tile_path[2])	1305	if (!tile_available (2))
1454	return 0;	1306	return 0;
1455		1307
1456	find_and_link (this, 2);
1457	y -= height;	1308	y -= height;
1458	return tile_map[2]->xy_find (x, y);	1309	return tile_map[2]->xy_find (x, y);
1459	}	1310	}
1460		1311
1461	/* Simple case - coordinates are within this local	1312	/* Simple case - coordinates are within this local
…		…
1472	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1323	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1473	{	1324	{
1474	if (!map1 \|\| !map2)	1325	if (!map1 \|\| !map2)
1475	return 0;	1326	return 0;
1476		1327
1477	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1328	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1478	//fix: compare paths instead (this is likely faster, too!)	1329	//fix: compare paths instead (this is likely faster, too!)
1479	if (map1 == map2)	1330	if (map1 == map2)
1480	{	1331	{
1481	*dx = 0;	1332	*dx = 0;
1482	*dy = 0;	1333	*dy = 0;
…		…
1689	}	1540	}
1690		1541
1691	object *	1542	object *
1692	maptile::insert (object op, int x, int y, object originator, int flags)	1543	maptile::insert (object op, int x, int y, object originator, int flags)
1693	{	1544	{
1694	if (!op->flag [FLAG_REMOVED])
1695	op->remove ();
1696
1697	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1545	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1698	}	1546	}
1699		1547
1700	region *	1548	region *
1701	maptile::region (int x, int y) const	1549	maptile::region (int x, int y) const
…		…
1711		1559
1712	return ::region::default_region ();	1560	return ::region::default_region ();
1713	}	1561	}
1714		1562
1715	/* picks a random object from a style map.	1563	/* picks a random object from a style map.
1716	* Redone by MSW so it should be faster and not use static
1717	* variables to generate tables.
1718	*/	1564	*/
1719	object *	1565	object *
1720	maptile::pick_random_object () const	1566	maptile::pick_random_object (rand_gen &gen) const
1721	{	1567	{
1722	/* while returning a null object will result in a crash, that	1568	/* while returning a null object will result in a crash, that
1723	* is actually preferable to an infinite loop. That is because	1569	* is actually preferable to an infinite loop. That is because
1724	* most servers will automatically restart in case of crash.	1570	* most servers will automatically restart in case of crash.
1725	* Change the logic on getting the random space - shouldn't make	1571	* Change the logic on getting the random space - shouldn't make
1726	* any difference, but this seems clearer to me.	1572	* any difference, but this seems clearer to me.
1727	*/	1573	*/
1728	for (int i = 1000; --i;)	1574	for (int i = 1000; --i;)
1729	{	1575	{
1730	object *pick = at (rndm (width), rndm (height)).bot;	1576	object *pick = at (gen (width), gen (height)).bot;
1731		1577
1732	// do not prefer big monsters just because they are big.	1578	// do not prefer big monsters just because they are big.
1733	if (pick && pick->head_ () == pick)	1579	if (pick && pick->is_head ())
1734	return pick->head_ ();	1580	return pick->head_ ();
1735	}	1581	}
1736		1582
1737	// instead of crashing in the unlikely(?) case, try to return something	1583	// instead of crashing in the unlikely(?) case, try to return something
1738	return get_archetype ("blocked");	1584	return archetype::find ("bug");
1739	}	1585	}
1740		1586
		1587	void
		1588	maptile::play_sound (faceidx sound, int x, int y) const
		1589	{
		1590	if (!sound)
		1591	return;
		1592
		1593	for_all_players_on_map (pl, this)
		1594	if (client *ns = pl->ns)
		1595	{
		1596	int dx = x - pl->ob->x;
		1597	int dy = y - pl->ob->y;
		1598
		1599	int distance = idistance (dx, dy);
		1600
		1601	if (distance <= MAX_SOUND_DISTANCE)
		1602	ns->play_sound (sound, dx, dy);
		1603	}
		1604	}
		1605
		1606	void
		1607	maptile::say_msg (const char *msg, int x, int y) const
		1608	{
		1609	for_all_players (pl)
		1610	if (client *ns = pl->ns)
		1611	{
		1612	int dx = x - pl->ob->x;
		1613	int dy = y - pl->ob->y;
		1614
		1615	int distance = idistance (dx, dy);
		1616
		1617	if (distance <= MAX_SOUND_DISTANCE)
		1618	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1619	}
		1620	}
		1621
		1622	static void
		1623	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1624	{
		1625	// clip to map to the left
		1626	if (x0 < 0)
		1627	{
		1628	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1629	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1630
		1631	if (x1 < 0) // entirely to the left
		1632	return;
		1633
		1634	x0 = 0;
		1635	}
		1636
		1637	// clip to map to the right
		1638	if (x1 > m->width)
		1639	{
		1640	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1641	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1642
		1643	if (x0 > m->width) // entirely to the right
		1644	return;
		1645
		1646	x1 = m->width;
		1647	}
		1648
		1649	// clip to map above
		1650	if (y0 < 0)
		1651	{
		1652	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1653	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1654
		1655	if (y1 < 0) // entirely above
		1656	return;
		1657
		1658	y0 = 0;
		1659	}
		1660
		1661	// clip to map below
		1662	if (y1 > m->height)
		1663	{
		1664	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1665	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1666
		1667	if (y0 > m->height) // entirely below
		1668	return;
		1669
		1670	y1 = m->height;
		1671	}
		1672
		1673	// if we get here, the rect is within the current map
		1674	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1675
		1676	r->m = m;
		1677	r->x0 = x0;
		1678	r->y0 = y0;
		1679	r->x1 = x1;
		1680	r->y1 = y1;
		1681	r->dx = dx;
		1682	r->dy = dy;
		1683	}
		1684
		1685	maprect *
		1686	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1687	{
		1688	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1689	buf.clear ();
		1690
		1691	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1692
		1693	// add end marker
		1694	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1695	r->m = 0;
		1696
		1697	return (maprect *)buf.linearise ();
		1698	}
		1699

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.112 by root, Thu Jul 12 18:48:20 2007 UTC vs. Revision 1.158 by root, Tue Feb 17 03:53:31 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.112 by root, Thu Jul 12 18:48:20 2007 UTC vs.
Revision 1.158 by root, Tue Feb 17 03:53:31 2009 UTC