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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.102 by root, Thu May 17 21:32:08 2007 UTC vs.
Revision 1.152 by root, Tue Dec 23 01:51:27 2008 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program 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 2 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,
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 GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	#include <unistd.h>	24	#include <unistd.h>
26		25
27	#include "global.h"	26	#include "global.h"
28	#include "funcpoint.h"
29
30	#include "loader.h"	27	#include "loader.h"
31
32	#include "path.h"	28	#include "path.h"
33		29
34	/*	30	sint8 maptile::outdoor_darkness;
35	* This makes a path absolute outside the world of Crossfire.
36	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
37	* and returns the pointer to a static array containing the result.
38	* it really should be called create_mapname
39	*/
40	const char *
41	create_pathname (const char *name)
42	{
43	static char buf[8192];
44	snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45	return buf;
46	}
47
48	/*
49	* This function checks if a file with the given path exists.
50	* -1 is returned if it fails, otherwise the mode of the file
51	* is returned.
52	* It tries out all the compression suffixes listed in the uncomp[] array.
53	*
54	* If prepend_dir is set, then we call create_pathname (which prepends
55	* libdir & mapdir). Otherwise, we assume the name given is fully
56	* complete.
57	* Only the editor actually cares about the writablity of this -
58	* the rest of the code only cares that the file is readable.
59	* when the editor goes away, the call to stat should probably be
60	* replaced by an access instead (similar to the windows one, but
61	* that seems to be missing the prepend_dir processing
62	*/
63	int
64	check_path (const char *name, int prepend_dir)
65	{
66	char buf[MAX_BUF];
67
68	char *endbuf;
69	struct stat statbuf;
70	int mode = 0;
71
72	if (prepend_dir)
73	assign (buf, create_pathname (name));
74	else
75	assign (buf, name);
76
77	/* old method (strchr(buf, '\0')) seemd very odd to me -
78	* this method should be equivalant and is clearer.
79	* Can not use strcat because we need to cycle through
80	* all the names.
81	*/
82	endbuf = buf + strlen (buf);
83
84	if (stat (buf, &statbuf))
85	return -1;
86	if (!S_ISREG (statbuf.st_mode))
87	return (-1);
88
89	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) \|\|
90	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IROTH))
91	mode \|= 4;
92
93	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) \|\|
94	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IWOTH))
95	mode \|= 2;
96
97	return (mode);
98	}
99		31
100	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	32	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101	* one function that just returns a P_.. value (see map.h)	33	* one function that just returns a P_.. value (see map.h)
102	* it will also do map translation for tiled maps, returning	34	* it will also do map translation for tiled maps, returning
103	* 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
220	* hidden dm	152	* hidden dm
221	*/	153	*/
222	if (OB_MOVE_BLOCK (ob, tmp))	154	if (OB_MOVE_BLOCK (ob, tmp))
223	return 1;	155	return 1;
224		156
225	if (QUERY_FLAG (tmp, FLAG_ALIVE)	157	if (tmp->flag [FLAG_ALIVE]
226	&& tmp->head_ () != ob	158	&& tmp->head_ () != ob
227	&& tmp != ob	159	&& tmp != ob
228	&& tmp->type != DOOR	160	&& tmp->type != DOOR
229	&& !tmp->flag [FLAG_WIZ]	161	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
230	&& tmp->contr->hidden)
231	return 1;	162	return 1;
232	}	163	}
233		164
234	}	165	}
235	return 0;	166	return 0;
236	}	167	}
237		168
238	/*	169	/*
239	* 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
240	* This is meant for multi space objects - for single space objecs,	171	* spot. This is meant for multi space objects - for single space objecs,
241	* just calling get_map_blocked and checking that against movement type	172	* just calling get_map_blocked and checking that against movement type
242	* of object. This function goes through all the parts of the	173	* of object. This function goes through all the parts of the multipart
243	* multipart object and makes sure they can be inserted.	174	* object and makes sure they can be inserted.
244	*	175	*
245	* 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.
246	*	177	*
247	* This function has been used to deprecate arch_out_of_map -	178	* This function has been used to deprecate arch_out_of_map -
248	* this function also does that check, and since in most cases,	179	* this function also does that check, and since in most cases,
…		…
259	*	190	*
260	* Note this used to be arch_blocked, but with new movement	191	* Note this used to be arch_blocked, but with new movement
261	* 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
262	* against the move_block values.	193	* against the move_block values.
263	*/	194	*/
264	int	195	bool
265	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	196	object::blocked (maptile *m, int x, int y) const
266	{	197	{
267	archetype *tmp;	198	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
268	int flag;
269	maptile *m1;
270	sint16 sx, sy;
271
272	if (!ob)
273	{
274	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
275	if (flag & P_OUT_OF_MAP)
276	return P_OUT_OF_MAP;
277
278	/* don't have object, so don't know what types would block */
279	return m1->at (sx, sy).move_block;
280	}	199	{
		200	mapxy pos (m, x + tmp->x, y + tmp->y);
281		201
282	for (tmp = ob->arch; tmp; tmp = tmp->more)	202	if (!pos.normalise ())
283	{	203	return 1;
284	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
285		204
286	if (flag & P_OUT_OF_MAP)	205	mapspace &ms = *pos;
287	return P_OUT_OF_MAP;	206
288	if (flag & P_IS_ALIVE)	207	if (ms.flags () & P_IS_ALIVE)
289	return P_IS_ALIVE;	208	return 1;
290		209
291	mapspace &ms = m1->at (sx, sy);	210	/* However, often ob doesn't have any move type
292		211	* (signifying non-moving objects)
293	/* find_first_free_spot() calls this function. However, often
294	* ob doesn't have any move type (when used to place exits)
295	* 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.
296	*/	213	*/
297
298	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	214	if (!move_type && ms.move_block != MOVE_ALL)
299	continue;	215	continue;
300		216
301	/* 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
302	* head of the object should correspond for the entire object.	218	* head of the object should correspond for the entire object.
303	*/	219	*/
304	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	220	if (ms.blocks (move_type))
305	return P_NO_PASS;	221	return 1;
306	}	222	}
307		223
308	return 0;	224	return 0;
309	}	225	}
310		226
…		…
328		244
329	insert_ob_in_ob (tmp, container);	245	insert_ob_in_ob (tmp, container);
330	tmp = next;	246	tmp = next;
331	}	247	}
332		248
333	/* sum_weight will go through and calculate what all the containers are	249	// go through and calculate what all the containers are carrying.
334	* carrying.	250	//TODO: remove
335	*/	251	container->update_weight ();
336	sum_weight (container);
337	}	252	}
338		253
339	void	254	void
340	maptile::set_object_flag (int flag, int value)	255	maptile::set_object_flag (int flag, int value)
341	{	256	{
…		…
343	return;	258	return;
344		259
345	for (mapspace *ms = spaces + size (); ms-- > spaces; )	260	for (mapspace *ms = spaces + size (); ms-- > spaces; )
346	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	261	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
347	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);
348	}	276	}
349		277
350	/* 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
351	* 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
352	* 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
…		…
357	{	285	{
358	if (!spaces)	286	if (!spaces)
359	return;	287	return;
360		288
361	for (mapspace *ms = spaces + size (); ms-- > spaces; )	289	for (mapspace *ms = spaces + size (); ms-- > spaces; )
362	for (object *op = ms->bot; op; op = op->above)	290	{
		291	object *op = ms->bot;
		292	while (op)
363	{	293	{
364	/* already multipart - don't do anything more */	294	/* already multipart - don't do anything more */
365	if (op->head_ () == op && !op->more && op->arch->more)	295	if (op->head_ () == op && !op->more && op->arch->more)
366	{	296	{
367	op->remove ();	297	op->remove ();
368	op->expand_tail ();	298	op->expand_tail ();
		299
		300	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
		301	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
		302	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
369	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	303	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		304
		305	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		306	// so we have to reset the iteration through the mapspace
370	}	307	}
		308	else
		309	op = op->above;
371	}	310	}
		311	}
372	}	312	}
373		313
374	/*	314	/*
375	* Loads (ands parses) the objects into a given map from the specified	315	* Loads (ands parses) the objects into a given map from the specified
376	* file pointer.	316	* file pointer.
…		…
378	bool	318	bool
379	maptile::_load_objects (object_thawer &f)	319	maptile::_load_objects (object_thawer &f)
380	{	320	{
381	for (;;)	321	for (;;)
382	{	322	{
383	coroapi::cede_to_tick_every (100); // cede once in a while	323	coroapi::cede_to_tick (); // cede once in a while
384		324
385	switch (f.kw)	325	switch (f.kw)
386	{	326	{
387	case KW_arch:	327	case KW_arch:
388	if (object *op = object::read (f, this))	328	if (object *op = object::read (f, this))
389	{	329	{
		330	// TODO: why?
390	if (op->inv)	331	if (op->inv)
391	sum_weight (op);	332	op->update_weight ();
392		333
393	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) its 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	if (ms.top)
		348	ms.top->above = op;
		349	else
		350	ms.bot = op;
		351
		352	ms.top = op;
		353	ms.flags_ = 0;
		354	}
		355	else
		356	{
		357	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		358	op->destroy ();
		359	}
394	}	360	}
395		361
396	continue;	362	continue;
397		363
398	case KW_EOF:	364	case KW_EOF:
…		…
411	}	377	}
412		378
413	void	379	void
414	maptile::activate ()	380	maptile::activate ()
415	{	381	{
416	active = true;
417
418	if (spaces)	382	if (spaces)
419	for (mapspace *ms = spaces + size (); ms-- > spaces; )	383	for (mapspace *ms = spaces + size (); ms-- > spaces; )
420	for (object *op = ms->bot; op; op = op->above)	384	for (object *op = ms->bot; op; op = op->above)
421	op->activate_recursive ();	385	op->activate_recursive ();
422	}	386	}
423		387
424	void	388	void
425	maptile::deactivate ()	389	maptile::deactivate ()
426	{	390	{
427	active = false;
428
429	if (spaces)	391	if (spaces)
430	for (mapspace *ms = spaces + size (); ms-- > spaces; )	392	for (mapspace *ms = spaces + size (); ms-- > spaces; )
431	for (object *op = ms->bot; op; op = op->above)	393	for (object *op = ms->bot; op; op = op->above)
432	op->deactivate_recursive ();	394	op->deactivate_recursive ();
433	}	395	}
…		…
443	if (!spaces)	405	if (!spaces)
444	return false;	406	return false;
445		407
446	for (int i = 0; i < size (); ++i)	408	for (int i = 0; i < size (); ++i)
447	{	409	{
448	int unique = 0;	410	bool unique = 0;
		411
449	for (object *op = spaces [i].bot; op; op = op->above)	412	for (object *op = spaces [i].bot; op; op = op->above)
450	{	413	{
451	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	414	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
452	unique = 1;
453		415
454	if (!op->can_map_save ())	416	if (expect_false (!op->can_map_save ()))
455	continue;	417	continue;
456		418
457	if (unique \|\| op->flag [FLAG_UNIQUE])	419	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
458	{	420	{
459	if (flags & IO_UNIQUES)	421	if (flags & IO_UNIQUES)
460	op->write (f);	422	op->write (f);
461	}	423	}
462	else if (flags & IO_OBJECTS)	424	else if (expect_true (flags & IO_OBJECTS))
463	op->write (f);	425	op->write (f);
464	}	426	}
465	}	427	}
466		428
467	coroapi::cede_to_tick ();	429	coroapi::cede_to_tick ();
468		430
469	return true;	431	return true;
470	}
471
472	bool
473	maptile::_load_objects (const char *path, bool skip_header)
474	{
475	object_thawer f (path);
476
477	if (!f)
478	return false;
479
480	f.next ();
481
482	if (skip_header)
483	for (;;)
484	{
485	keyword kw = f.kw;
486	f.skip ();
487	if (kw == KW_end)
488	break;
489	}
490
491	return _load_objects (f);
492	}	432	}
493		433
494	bool	434	bool
495	maptile::_save_objects (const char *path, int flags)	435	maptile::_save_objects (const char *path, int flags)
496	{	436	{
…		…
671	bool	611	bool
672	maptile::_load_header (object_thawer &thawer)	612	maptile::_load_header (object_thawer &thawer)
673	{	613	{
674	for (;;)	614	for (;;)
675	{	615	{
676	keyword kw = thawer.get_kv ();
677
678	switch (kw)	616	switch (thawer.kw)
679	{	617	{
680	case KW_msg:	618	case KW_msg:
681	thawer.get_ml (KW_endmsg, msg);	619	thawer.get_ml (KW_endmsg, msg);
682	break;	620	break;
683		621
…		…
715	case KW_winddir: thawer.get (winddir); break;	653	case KW_winddir: thawer.get (winddir); break;
716	case KW_sky: thawer.get (sky); break;	654	case KW_sky: thawer.get (sky); break;
717		655
718	case KW_per_player: thawer.get (per_player); break;	656	case KW_per_player: thawer.get (per_player); break;
719	case KW_per_party: thawer.get (per_party); break;	657	case KW_per_party: thawer.get (per_party); break;
		658	case KW_no_reset: thawer.get (no_reset); break;
		659	case KW_no_drop: thawer.get (no_drop); break;
720		660
721	case KW_region: default_region = region::find (thawer.get_str ()); break;	661	case KW_region: default_region = region::find (thawer.get_str ()); break;
722	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
723		663
724	// old names new names	664	// old names new names
…		…
735	case KW_tile_path_1: thawer.get (tile_path [0]); break;	675	case KW_tile_path_1: thawer.get (tile_path [0]); break;
736	case KW_tile_path_2: thawer.get (tile_path [1]); break;	676	case KW_tile_path_2: thawer.get (tile_path [1]); break;
737	case KW_tile_path_3: thawer.get (tile_path [2]); break;	677	case KW_tile_path_3: thawer.get (tile_path [2]); break;
738	case KW_tile_path_4: thawer.get (tile_path [3]); break;	678	case KW_tile_path_4: thawer.get (tile_path [3]); break;
739		679
		680	case KW_ERROR:
		681	set_key_text (thawer.kw_str, thawer.value);
		682	break;
		683
740	case KW_end:	684	case KW_end:
		685	thawer.next ();
741	return true;	686	return true;
742		687
743	default:	688	default:
744	if (!thawer.parse_error ("map", 0))	689	if (!thawer.parse_error ("map", 0))
745	return false;	690	return false;
746	break;	691	break;
747	}	692	}
		693
		694	thawer.next ();
748	}	695	}
749		696
750	abort ();	697	abort ();
751	}
752
753	bool
754	maptile::_load_header (const char *path)
755	{
756	object_thawer thawer (path);
757
758	if (!thawer)
759	return false;
760
761	return _load_header (thawer);
762	}	698	}
763		699
764	/******************************************************************************	700	/******************************************************************************
765	* This is the start of unique map handling code	701	* This is the start of unique map handling code
766	*****************************************************************************/	702	*****************************************************************************/
…		…
778		714
779	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	715	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
780	unique = 1;	716	unique = 1;
781		717
782	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	718	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
783	{
784	op->destroy_inv (false);
785	op->destroy ();	719	op->destroy ();
786	}
787		720
788	op = above;	721	op = above;
789	}	722	}
790	}	723	}
791	}	724	}
…		…
801	if (name) MAP_OUT (name);	734	if (name) MAP_OUT (name);
802	MAP_OUT (swap_time);	735	MAP_OUT (swap_time);
803	MAP_OUT (reset_time);	736	MAP_OUT (reset_time);
804	MAP_OUT (reset_timeout);	737	MAP_OUT (reset_timeout);
805	MAP_OUT (fixed_resettime);	738	MAP_OUT (fixed_resettime);
		739	MAP_OUT (no_reset);
		740	MAP_OUT (no_drop);
806	MAP_OUT (difficulty);	741	MAP_OUT (difficulty);
807		742
808	if (default_region) MAP_OUT2 (region, default_region->name);	743	if (default_region) MAP_OUT2 (region, default_region->name);
809		744
810	if (shopitems)	745	if (shopitems)
…		…
864	* Remove and free all objects in the given map.	799	* Remove and free all objects in the given map.
865	*/	800	*/
866	void	801	void
867	maptile::clear ()	802	maptile::clear ()
868	{	803	{
869	sfree (regions, size ()), regions = 0;
870	free (regionmap), regionmap = 0;
871
872	if (spaces)	804	if (spaces)
873	{	805	{
874	for (mapspace *ms = spaces + size (); ms-- > spaces; )	806	for (mapspace *ms = spaces + size (); ms-- > spaces; )
875	while (object *op = ms->bot->head_ ())	807	while (object *op = ms->bot)
876	{	808	{
877	op->destroy_inv (false);	809	// manually remove, as to not trigger anything
		810	if (ms->bot = op->above)
		811	ms->bot->below = 0;
		812
		813	op->flag [FLAG_REMOVED] = true;
		814
		815	object *head = op->head_ ();
		816	if (op == head)
878	op->destroy ();	817	op->destroy ();
		818	else if (head->map != op->map)
		819	{
		820	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		821	head->destroy ();
		822	}
879	}	823	}
880		824
881	sfree (spaces, size ()), spaces = 0;	825	sfree0 (spaces, size ());
882	}	826	}
883		827
884	if (buttons)	828	if (buttons)
885	free_objectlinkpt (buttons), buttons = 0;	829	free_objectlinkpt (buttons), buttons = 0;
		830
		831	sfree0 (regions, size ());
		832	delete [] regionmap; regionmap = 0;
886	}	833	}
887		834
888	void	835	void
889	maptile::clear_header ()	836	maptile::clear_header ()
890	{	837	{
…		…
920	maptile::do_destroy ()	867	maptile::do_destroy ()
921	{	868	{
922	attachable::do_destroy ();	869	attachable::do_destroy ();
923		870
924	clear ();	871	clear ();
		872	}
		873
		874	/* decay and destroy perishable items in a map */
		875	void
		876	maptile::do_decay_objects ()
		877	{
		878	if (!spaces)
		879	return;
		880
		881	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		882	for (object above, op = ms->bot; op; op = above)
		883	{
		884	above = op->above;
		885
		886	bool destroy = 0;
		887
		888	// do not decay anything above unique floor tiles (yet :)
		889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		890	break;
		891
		892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		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 ())
		898	; // do not decay
		899	else if (op->is_weapon ())
		900	{
		901	op->stats.dam--;
		902	if (op->stats.dam < 0)
		903	destroy = 1;
		904	}
		905	else if (op->is_armor ())
		906	{
		907	op->stats.ac--;
		908	if (op->stats.ac < 0)
		909	destroy = 1;
		910	}
		911	else if (op->type == FOOD)
		912	{
		913	op->stats.food -= rndm (5, 20);
		914	if (op->stats.food < 0)
		915	destroy = 1;
		916	}
		917	else
		918	{
		919	int mat = op->materials;
		920
		921	if (mat & M_PAPER
		922	\|\| mat & M_LEATHER
		923	\|\| mat & M_WOOD
		924	\|\| mat & M_ORGANIC
		925	\|\| mat & M_CLOTH
		926	\|\| mat & M_LIQUID
		927	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		928	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		929	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		930	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		931	\|\| (mat & M_ICE && temp > 32))
		932	destroy = 1;
		933	}
		934
		935	/* adjust overall chance below */
		936	if (destroy && rndm (0, 1))
		937	op->destroy ();
		938	}
925	}	939	}
926		940
927	/*	941	/*
928	* Updates every button on the map (by calling update_button() for them).	942	* Updates every button on the map (by calling update_button() for them).
929	*/	943	*/
…		…
976		990
977	if (QUERY_FLAG (op, FLAG_GENERATOR))	991	if (QUERY_FLAG (op, FLAG_GENERATOR))
978	{	992	{
979	total_exp += op->stats.exp;	993	total_exp += op->stats.exp;
980		994
981	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	995	if (archetype *at = op->other_arch)
		996	{
982	total_exp += at->clone.stats.exp * 8;	997	total_exp += at->stats.exp * 8;
983
984	monster_cnt++;	998	monster_cnt++;
		999	}
		1000
		1001	for (object *inv = op->inv; inv; inv = inv->below)
		1002	{
		1003	total_exp += op->stats.exp * 8;
		1004	monster_cnt++;
		1005	}
985	}	1006	}
986	}	1007	}
987		1008
988	avgexp = (double) total_exp / monster_cnt;	1009	avgexp = (double) total_exp / monster_cnt;
989		1010
…		…
1028	else	1049	else
1029	darkness = new_level;	1050	darkness = new_level;
1030		1051
1031	/* All clients need to get re-updated for the change */	1052	/* All clients need to get re-updated for the change */
1032	update_all_map_los (this);	1053	update_all_map_los (this);
		1054
1033	return 1;	1055	return 1;
1034	}	1056	}
1035		1057
1036	/*	1058	/*
1037	* This function updates various attributes about a specific space	1059	* This function updates various attributes about a specific space
…		…
1040	* through, etc)	1062	* through, etc)
1041	*/	1063	*/
1042	void	1064	void
1043	mapspace::update_ ()	1065	mapspace::update_ ()
1044	{	1066	{
1045	object tmp, last = 0;	1067	object *last = 0;
1046	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1068	uint8 flags = P_UPTODATE, anywhere = 0;
		1069	sint8 light = 0;
1047	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1070	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1048		1071
1049	//object *middle = 0;	1072	//object *middle = 0;
1050	//object *top = 0;	1073	//object *top = 0;
1051	//object *floor = 0;	1074	//object *floor = 0;
1052	// this seems to generate better code than using locals, above	1075	// this seems to generate better code than using locals, above
1053	object *&top = faces_obj[0] = 0;	1076	object *&top = faces_obj[0] = 0;
1054	object *&middle = faces_obj[1] = 0;	1077	object *&middle = faces_obj[1] = 0;
1055	object *&floor = faces_obj[2] = 0;	1078	object *&floor = faces_obj[2] = 0;
1056		1079
1057	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1080	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1058	{	1081	{
1059	/* This could be made additive I guess (two lights better than	1082	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1060	* one). But if so, it shouldn't be a simple additive - 2
1061	* light bulbs do not illuminate twice as far as once since
1062	* it is a dissapation factor that is cubed.
1063	*/
1064	if (tmp->glow_radius > light)
1065	light = tmp->glow_radius;	1083	light += tmp->glow_radius;
1066		1084
1067	/* This call is needed in order to update objects the player	1085	/* This call is needed in order to update objects the player
1068	* is standing in that have animations (ie, grass, fire, etc).	1086	* is standing in that have animations (ie, grass, fire, etc).
1069	* However, it also causes the look window to be re-drawn	1087	* However, it also causes the look window to be re-drawn
1070	* 3 times each time the player moves, because many of the	1088	* 3 times each time the player moves, because many of the
…		…
1089	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1107	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1090	{	1108	{
1091	middle = tmp;	1109	middle = tmp;
1092	anywhere = 1;	1110	anywhere = 1;
1093	}	1111	}
		1112
1094	/* Find the highest visible face around. If equal	1113	/* Find the highest visible face around. If equal
1095	* visibilities, we still want the one nearer to the	1114	* visibilities, we still want the one nearer to the
1096	* top	1115	* top
1097	*/	1116	*/
1098	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))	1117	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
…		…
1117	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1136	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1118	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1137	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1119	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1138	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1120	}	1139	}
1121		1140
1122	this->light = light;	1141	this->light = min (light, MAX_LIGHT_RADIUS);
1123	this->flags_ = flags;	1142	this->flags_ = flags;
1124	this->move_block = move_block & ~move_allow;	1143	this->move_block = move_block & ~move_allow;
1125	this->move_on = move_on;	1144	this->move_on = move_on;
1126	this->move_off = move_off;	1145	this->move_off = move_off;
1127	this->move_slow = move_slow;	1146	this->move_slow = move_slow;
…		…
1147	* 1) top face is set, need middle to be set.	1166	* 1) top face is set, need middle to be set.
1148	* 2) middle is set, need to set top.	1167	* 2) middle is set, need to set top.
1149	* 3) neither middle or top is set - need to set both.	1168	* 3) neither middle or top is set - need to set both.
1150	*/	1169	*/
1151		1170
1152	for (tmp = last; tmp; tmp = tmp->below)	1171	for (object *tmp = last; tmp; tmp = tmp->below)
1153	{	1172	{
1154	/* Once we get to a floor, stop, since we already have a floor object */	1173	/* Once we get to a floor, stop, since we already have a floor object */
1155	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1174	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1156	break;	1175	break;
1157		1176
…		…
1209	vol += op->volume ();	1228	vol += op->volume ();
1210		1229
1211	return vol;	1230	return vol;
1212	}	1231	}
1213		1232
1214	/* this updates the orig_map->tile_map[tile_num] value after finding	1233	bool
1215	* the map. It also takes care of linking back the freshly found	1234	maptile::tile_available (int dir, bool load)
1216	* maps tile_map values if it tiles back to this one. It returns
1217	* the value of orig_map->tile_map[tile_num].
1218	*/
1219	static inline maptile *
1220	find_and_link (maptile *orig_map, int tile_num)
1221	{	1235	{
1222	maptile *mp = orig_map->tile_map [tile_num];	1236	if (!tile_path[dir])
		1237	return 0;
1223		1238
1224	if (!mp)	1239	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
1225	{	1240	return 1;
1226	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1227		1241
1228	if (!mp)	1242	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1229	{	1243	return 1;
1230	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1231	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1232	&orig_map->tile_path[tile_num], &orig_map->path);
1233	mp = new maptile (1, 1);
1234	mp->alloc ();
1235	mp->in_memory = MAP_IN_MEMORY;
1236	}
1237	}
1238		1244
1239	int dest_tile = (tile_num + 2) % 4;
1240
1241	orig_map->tile_map [tile_num] = mp;
1242
1243	// optimisation: back-link map to origin map if euclidean
1244	//TODO: non-euclidean maps MUST GO
1245	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1246	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1247
1248	return mp;	1245	return 0;
1249	}
1250
1251	static inline void
1252	load_and_link (maptile *orig_map, int tile_num)
1253	{
1254	find_and_link (orig_map, tile_num)->load_sync ();
1255	}	1246	}
1256		1247
1257	/* this returns TRUE if the coordinates (x,y) are out of	1248	/* this returns TRUE if the coordinates (x,y) are out of
1258	* map m. This function also takes into account any	1249	* map m. This function also takes into account any
1259	* tiling considerations, loading adjacant maps as needed.	1250	* tiling considerations, loading adjacant maps as needed.
…		…
1272	if (!m)	1263	if (!m)
1273	return 0;	1264	return 0;
1274		1265
1275	if (x < 0)	1266	if (x < 0)
1276	{	1267	{
1277	if (!m->tile_path[3])	1268	if (!m->tile_available (3))
1278	return 1;	1269	return 1;
1279		1270
1280	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1281	find_and_link (m, 3);
1282
1283	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1271	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1284	}	1272	}
1285		1273
1286	if (x >= m->width)	1274	if (x >= m->width)
1287	{	1275	{
1288	if (!m->tile_path[1])	1276	if (!m->tile_available (1))
1289	return 1;	1277	return 1;
1290		1278
1291	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1292	find_and_link (m, 1);
1293
1294	return out_of_map (m->tile_map[1], x - m->width, y);	1279	return out_of_map (m->tile_map[1], x - m->width, y);
1295	}	1280	}
1296		1281
1297	if (y < 0)	1282	if (y < 0)
1298	{	1283	{
1299	if (!m->tile_path[0])	1284	if (!m->tile_available (0))
1300	return 1;	1285	return 1;
1301		1286
1302	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1303	find_and_link (m, 0);
1304
1305	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1287	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1306	}	1288	}
1307		1289
1308	if (y >= m->height)	1290	if (y >= m->height)
1309	{	1291	{
1310	if (!m->tile_path[2])	1292	if (!m->tile_available (2))
1311	return 1;	1293	return 1;
1312
1313	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1314	find_and_link (m, 2);
1315		1294
1316	return out_of_map (m->tile_map[2], x, y - m->height);	1295	return out_of_map (m->tile_map[2], x, y - m->height);
1317	}	1296	}
1318		1297
1319	/* Simple case - coordinates are within this local	1298	/* Simple case - coordinates are within this local
…		…
1333	maptile *	1312	maptile *
1334	maptile::xy_find (sint16 &x, sint16 &y)	1313	maptile::xy_find (sint16 &x, sint16 &y)
1335	{	1314	{
1336	if (x < 0)	1315	if (x < 0)
1337	{	1316	{
1338	if (!tile_path[3])	1317	if (!tile_available (3))
1339	return 0;	1318	return 0;
1340		1319
1341	find_and_link (this, 3);
1342	x += tile_map[3]->width;	1320	x += tile_map[3]->width;
1343	return tile_map[3]->xy_find (x, y);	1321	return tile_map[3]->xy_find (x, y);
1344	}	1322	}
1345		1323
1346	if (x >= width)	1324	if (x >= width)
1347	{	1325	{
1348	if (!tile_path[1])	1326	if (!tile_available (1))
1349	return 0;	1327	return 0;
1350		1328
1351	find_and_link (this, 1);
1352	x -= width;	1329	x -= width;
1353	return tile_map[1]->xy_find (x, y);	1330	return tile_map[1]->xy_find (x, y);
1354	}	1331	}
1355		1332
1356	if (y < 0)	1333	if (y < 0)
1357	{	1334	{
1358	if (!tile_path[0])	1335	if (!tile_available (0))
1359	return 0;	1336	return 0;
1360		1337
1361	find_and_link (this, 0);
1362	y += tile_map[0]->height;	1338	y += tile_map[0]->height;
1363	return tile_map[0]->xy_find (x, y);	1339	return tile_map[0]->xy_find (x, y);
1364	}	1340	}
1365		1341
1366	if (y >= height)	1342	if (y >= height)
1367	{	1343	{
1368	if (!tile_path[2])	1344	if (!tile_available (2))
1369	return 0;	1345	return 0;
1370		1346
1371	find_and_link (this, 2);
1372	y -= height;	1347	y -= height;
1373	return tile_map[2]->xy_find (x, y);	1348	return tile_map[2]->xy_find (x, y);
1374	}	1349	}
1375		1350
1376	/* Simple case - coordinates are within this local	1351	/* Simple case - coordinates are within this local
…		…
1387	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1362	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1388	{	1363	{
1389	if (!map1 \|\| !map2)	1364	if (!map1 \|\| !map2)
1390	return 0;	1365	return 0;
1391		1366
1392	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1367	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1393	//fix: compare paths instead (this is likely faster, too!)	1368	//fix: compare paths instead (this is likely faster, too!)
1394	if (map1 == map2)	1369	if (map1 == map2)
1395	{	1370	{
1396	*dx = 0;	1371	*dx = 0;
1397	*dy = 0;	1372	*dy = 0;
…		…
1604	}	1579	}
1605		1580
1606	object *	1581	object *
1607	maptile::insert (object op, int x, int y, object originator, int flags)	1582	maptile::insert (object op, int x, int y, object originator, int flags)
1608	{	1583	{
1609	if (!op->flag [FLAG_REMOVED])
1610	op->remove ();
1611
1612	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1584	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1613	}	1585	}
1614		1586
1615	region *	1587	region *
1616	maptile::region (int x, int y) const	1588	maptile::region (int x, int y) const
…		…
1626		1598
1627	return ::region::default_region ();	1599	return ::region::default_region ();
1628	}	1600	}
1629		1601
1630	/* picks a random object from a style map.	1602	/* picks a random object from a style map.
1631	* Redone by MSW so it should be faster and not use static
1632	* variables to generate tables.
1633	*/	1603	*/
1634	object *	1604	object *
1635	maptile::pick_random_object () const	1605	maptile::pick_random_object (rand_gen &gen) const
1636	{	1606	{
1637	/* while returning a null object will result in a crash, that	1607	/* while returning a null object will result in a crash, that
1638	* is actually preferable to an infinite loop. That is because	1608	* is actually preferable to an infinite loop. That is because
1639	* most servers will automatically restart in case of crash.	1609	* most servers will automatically restart in case of crash.
1640	* Change the logic on getting the random space - shouldn't make	1610	* Change the logic on getting the random space - shouldn't make
1641	* any difference, but this seems clearer to me.	1611	* any difference, but this seems clearer to me.
1642	*/	1612	*/
1643	for (int i = 1000; --i;)	1613	for (int i = 1000; --i;)
1644	{	1614	{
1645	object *pick = at (rndm (width), rndm (height)).bot;	1615	object *pick = at (gen (width), gen (height)).bot;
1646		1616
1647	// do not prefer big monsters just because they are big.	1617	// do not prefer big monsters just because they are big.
1648	if (pick && pick->head_ () == pick)	1618	if (pick && pick->is_head ())
1649	return pick->head_ ();	1619	return pick->head_ ();
1650	}	1620	}
1651		1621
1652	// instead of crashing in the unlikely(?) case, try to return something	1622	// instead of crashing in the unlikely(?) case, try to return something
1653	return get_archetype ("blocked");	1623	return archetype::find ("bug");
1654	}	1624	}
1655		1625
		1626	void
		1627	maptile::play_sound (faceidx sound, int x, int y) const
		1628	{
		1629	if (!sound)
		1630	return;
		1631
		1632	for_all_players_on_map (pl, this)
		1633	if (client *ns = pl->ns)
		1634	{
		1635	int dx = x - pl->ob->x;
		1636	int dy = y - pl->ob->y;
		1637
		1638	int distance = idistance (dx, dy);
		1639
		1640	if (distance <= MAX_SOUND_DISTANCE)
		1641	ns->play_sound (sound, dx, dy);
		1642	}
		1643	}
		1644

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.102 by root, Thu May 17 21:32:08 2007 UTC vs. Revision 1.152 by root, Tue Dec 23 01:51:27 2008 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.102 by root, Thu May 17 21:32:08 2007 UTC vs.
Revision 1.152 by root, Tue Dec 23 01:51:27 2008 UTC