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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.73 by root, Sun Jan 14 18:00:33 2007 UTC vs.
Revision 1.114 by root, Thu Jul 26 00:27:07 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3		3	*
4	Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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	* Crossfire TRT 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.	20	*
21
22	The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	#include <global.h>
26	#include <funcpoint.h>
27
28	#include <loader.h>
29	#include <unistd.h>	24	#include <unistd.h>
30		25
		26	#include "global.h"
		27	#include "funcpoint.h"
		28
		29	#include "loader.h"
		30
31	#include "path.h"	31	#include "path.h"
32
33	/*
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	strcpy (buf, create_pathname (name));
73	else
74	strcpy (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		32
99	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	33	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100	* one function that just returns a P_.. value (see map.h)	34	* one function that just returns a P_.. value (see map.h)
101	* it will also do map translation for tiled maps, returning	35	* it will also do map translation for tiled maps, returning
102	* 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
173	* let the player through (inventory checkers for example)	107	* let the player through (inventory checkers for example)
174	*/	108	*/
175	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	109	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
176	return 0;	110	return 0;
177		111
178	if (ob->head != NULL)
179	ob = ob->head;	112	ob = ob->head_ ();
180		113
181	/* We basically go through the stack of objects, and if there is	114	/* We basically go through the stack of objects, and if there is
182	* some other object that has NO_PASS or FLAG_ALIVE set, return	115	* some other object that has NO_PASS or FLAG_ALIVE set, return
183	* true. If we get through the entire stack, that must mean	116	* true. If we get through the entire stack, that must mean
184	* ob is blocking it, so return 0.	117	* ob is blocking it, so return 0.
…		…
214	else	147	else
215	{	148	{
216	/* Broke apart a big nasty if into several here to make	149	/* Broke apart a big nasty if into several here to make
217	* this more readable. first check - if the space blocks	150	* this more readable. first check - if the space blocks
218	* movement, can't move here.	151	* movement, can't move here.
219	* second - if a monster, can't move there, unles it is a	152	* second - if a monster, can't move there, unless it is a
220	* hidden dm	153	* hidden dm
221	*/	154	*/
222	if (OB_MOVE_BLOCK (ob, tmp))	155	if (OB_MOVE_BLOCK (ob, tmp))
223	return 1;	156	return 1;
224	if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&	157
225	tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))	158	if (tmp->flag [FLAG_ALIVE]
		159	&& tmp->head_ () != ob
		160	&& tmp != ob
		161	&& tmp->type != DOOR
		162	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
226	return 1;	163	return 1;
227	}	164	}
228		165
229	}	166	}
230	return 0;	167	return 0;
231	}	168	}
232
233		169
234	/*	170	/*
235	* Returns true if the given object can't fit in the given spot.	171	* Returns true if the given object can't fit in the given spot.
236	* This is meant for multi space objects - for single space objecs,	172	* This is meant for multi space objects - for single space objecs,
237	* just calling get_map_blocked and checking that against movement type	173	* just calling get_map_blocked and checking that against movement type
…		…
273		209
274	/* don't have object, so don't know what types would block */	210	/* don't have object, so don't know what types would block */
275	return m1->at (sx, sy).move_block;	211	return m1->at (sx, sy).move_block;
276	}	212	}
277		213
278	for (tmp = ob->arch; tmp; tmp = tmp->more)	214	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)
279	{	215	{
280	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);	216	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
281		217
282	if (flag & P_OUT_OF_MAP)	218	if (flag & P_OUT_OF_MAP)
283	return P_OUT_OF_MAP;	219	return P_OUT_OF_MAP;
284	if (flag & P_IS_ALIVE)	220	if (flag & P_IS_ALIVE)
285	return P_IS_ALIVE;	221	return P_IS_ALIVE;
…		…
344	}	280	}
345		281
346	/* link_multipart_objects go through all the objects on the map looking	282	/* link_multipart_objects go through all the objects on the map looking
347	* for objects whose arch says they are multipart yet according to the	283	* for objects whose arch says they are multipart yet according to the
348	* info we have, they only have the head (as would be expected when	284	* info we have, they only have the head (as would be expected when
349	* they are saved). We do have to look for the old maps that did save	285	* they are saved).
350	* the more sections and not re-add sections for them.
351	*/	286	*/
352	void	287	void
353	maptile::link_multipart_objects ()	288	maptile::link_multipart_objects ()
354	{	289	{
355	if (!spaces)	290	if (!spaces)
356	return;	291	return;
357		292
358	for (mapspace *ms = spaces + size (); ms-- > spaces; )	293	for (mapspace *ms = spaces + size (); ms-- > spaces; )
359	for (object *tmp = ms->bot; tmp; )	294	{
		295	object *op = ms->bot;
		296	while (op)
360	{	297	{
361	object *above = tmp->above;
362
363	/* already multipart - don't do anything more */	298	/* already multipart - don't do anything more */
364	if (!tmp->head && !tmp->more)	299	if (op->head_ () == op && !op->more && op->arch->more)
365	{
366	/* If there is nothing more to this object, this for loop
367	* won't do anything.
368	*/
369	archetype *at;
370	object last, op;
371	for (at = tmp->arch->more, last = tmp;
372	at;
373	at = at->more, last = op)
374	{	300	{
375	op = arch_to_object (at);	301	op->remove ();
		302	op->expand_tail ();
376		303
377	/* update x,y coordinates */	304	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
378	op->x += tmp->x;	305	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
379	op->y += tmp->y;	306	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
380	op->head = tmp;
381	op->map = this;
382	last->more = op;
383	op->name = tmp->name;
384	op->title = tmp->title;
385
386	/* we could link all the parts onto tmp, and then just
387	* call insert_ob_in_map once, but the effect is the same,
388	* as insert_ob_in_map will call itself with each part, and
389	* the coding is simpler to just to it here with each part.
390	*/
391	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	307	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		308
		309	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		310	// so we have to reset the iteration through the mapspace
392	}	311	}
		312	else
		313	op = op->above;
393	}	314	}
394
395	tmp = above;
396	}	315	}
397	}	316	}
398		317
399	/*	318	/*
400	* Loads (ands parses) the objects into a given map from the specified	319	* Loads (ands parses) the objects into a given map from the specified
401	* file pointer.	320	* file pointer.
402	* mapflags is the same as we get with load_original_map
403	*/	321	*/
404	bool	322	bool
405	maptile::_load_objects (object_thawer &thawer)	323	maptile::_load_objects (object_thawer &f)
406	{	324	{
407	int unique;	325	for (;;)
408	object op, prev = NULL, last_more = NULL, otmp;
409
410	op = object::create ();
411	op->map = this; /* To handle buttons correctly */
412
413	while (int i = load_object (thawer, op, 0))
414	{	326	{
415	/* if the archetype for the object is null, means that we	327	coroapi::cede_to_tick_every (100); // cede once in a while
416	* got an invalid object. Don't do anything with it - the game	328
417	* or editor will not be able to do anything with it either.	329	switch (f.kw)
418	*/
419	if (op->arch == NULL)
420	{	330	{
421	LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");	331	case KW_arch:
422	continue;	332	if (object *op = object::read (f, this))
423	}
424
425	switch (i)
426	{	333	{
427	case LL_NORMAL:	334	if (op->inv)
		335	sum_weight (op);
		336
428	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	337	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);
		338	}
429		339
430	if (op->inv)	340	continue;
431	sum_weight (op);
432		341
433	prev = op, last_more = op;
434	break;
435
436	case LL_MORE:	342	case KW_EOF:
437	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ABOVE_FLOOR_ONLY);	343	return true;
438	op->head = prev, last_more->more = op, last_more = op;	344
		345	default:
		346	if (!f.parse_error ("map file"))
		347	return false;
439	break;	348	break;
440	}	349	}
441		350
442	op = object::create ();	351	f.next ();
443	op->map = this;
444	}
445
446	op->destroy ();
447
448	#if 0
449	for (i = 0; i < width; i++)
450	for (j = 0; j < height; j++)
451	{
452	unique = 0;
453	/* check for unique items, or unique squares */
454	for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
455	{
456	if (QUERY_FLAG (otmp, FLAG_UNIQUE) \|\| QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
457	unique = 1;
458
459	if (!(mapflags & (MAP_OVERLAY \| MAP_PLAYER_UNIQUE) \|\| unique))
460	SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
461	}
462	}	352	}
463	#endif
464		353
465	return true;	354	return true;
466	}	355	}
467		356
468	void	357	void
469	maptile::activate ()	358	maptile::activate ()
470	{	359	{
		360	active = true;
		361
471	if (!spaces)	362	if (spaces)
472	return;
473
474	for (mapspace *ms = spaces + size (); ms-- > spaces; )	363	for (mapspace *ms = spaces + size (); ms-- > spaces; )
475	for (object *op = ms->bot; op; op = op->above)	364	for (object *op = ms->bot; op; op = op->above)
476	op->activate_recursive ();	365	op->activate_recursive ();
477	}	366	}
478		367
479	void	368	void
480	maptile::deactivate ()	369	maptile::deactivate ()
481	{	370	{
		371	active = false;
		372
482	if (!spaces)	373	if (spaces)
483	return;
484
485	for (mapspace *ms = spaces + size (); ms-- > spaces; )	374	for (mapspace *ms = spaces + size (); ms-- > spaces; )
486	for (object *op = ms->bot; op; op = op->above)	375	for (object *op = ms->bot; op; op = op->above)
487	op->deactivate_recursive ();	376	op->deactivate_recursive ();
488	}	377	}
489		378
490	bool	379	bool
491	maptile::_save_objects (object_freezer &freezer, int flags)	380	maptile::_save_objects (object_freezer &f, int flags)
492	{	381	{
493	static int cede_count = 0;	382	coroapi::cede_to_tick ();
494		383
495	if (flags & IO_HEADER)	384	if (flags & IO_HEADER)
496	_save_header (freezer);	385	_save_header (f);
497		386
498	if (!spaces)	387	if (!spaces)
499	return false;	388	return false;
500		389
501	for (int i = 0; i < size (); ++i)	390	for (int i = 0; i < size (); ++i)
502	{	391	{
503	#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
504	if (cede_count >= 500)
505	{
506	cede_count = 0;
507	coroapi::cede ();
508	}
509	#endif
510
511	int unique = 0;	392	int unique = 0;
512	for (object *op = spaces [i].bot; op; op = op->above)	393	for (object *op = spaces [i].bot; op; op = op->above)
513	{	394	{
514	// count per-object, but cede only when modification-safe
515	cede_count++;
516
517	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	395	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])
518	unique = 1;	396	unique = 1;
519		397
520	if (!op->can_map_save ())	398	if (!op->can_map_save ())
521	continue;	399	continue;
522		400
523	if (unique \|\| op->flag [FLAG_UNIQUE])	401	if (unique \|\| op->flag [FLAG_UNIQUE])
524	{	402	{
525	if (flags & IO_UNIQUES)	403	if (flags & IO_UNIQUES)
526	save_object (freezer, op, 1);	404	op->write (f);
527	}	405	}
528	else if (flags & IO_OBJECTS)	406	else if (flags & IO_OBJECTS)
529	save_object (freezer, op, 1);	407	op->write (f);
530	}	408	}
531	}	409	}
		410
		411	coroapi::cede_to_tick ();
532		412
533	return true;	413	return true;
534	}	414	}
535		415
536	bool	416	bool
537	maptile::_load_objects (const char *path, bool skip_header)	417	maptile::_load_objects (const char *path, bool skip_header)
538	{	418	{
539	object_thawer thawer (path);	419	object_thawer f (path);
540		420
541	if (!thawer)	421	if (!f)
542	return false;	422	return false;
		423
		424	f.next ();
543		425
544	if (skip_header)	426	if (skip_header)
545	for (;;)	427	for (;;)
546	{	428	{
547	keyword kw = thawer.get_kv ();	429	keyword kw = f.kw;
548		430	f.skip ();
549	if (kw == KW_end)	431	if (kw == KW_end)
550	break;	432	break;
551
552	thawer.skip_kv (kw);
553	}	433	}
554		434
555	return _load_objects (thawer);	435	return _load_objects (f);
556	}	436	}
557		437
558	bool	438	bool
559	maptile::_save_objects (const char *path, int flags)	439	maptile::_save_objects (const char *path, int flags)
560	{	440	{
…		…
569	maptile::maptile ()	449	maptile::maptile ()
570	{	450	{
571	in_memory = MAP_SWAPPED;	451	in_memory = MAP_SWAPPED;
572		452
573	/* The maps used to pick up default x and y values from the	453	/* The maps used to pick up default x and y values from the
574	* map archetype. Mimic that behaviour.	454	* map archetype. Mimic that behaviour.
575	*/	455	*/
576	width = 16;	456	width = 16;
577	height = 16;	457	height = 16;
578	reset_timeout = 0;
579	timeout = 300;	458	timeout = 300;
580	enter_x = 0;	459	max_nrof = 1000; // 1000 items of anything
581	enter_y = 0;	460	max_volume = 2000000; // 2m³
582	}	461	}
583		462
584	maptile::maptile (int w, int h)	463	maptile::maptile (int w, int h)
585	{	464	{
586	in_memory = MAP_SWAPPED;	465	in_memory = MAP_SWAPPED;
…		…
736	bool	615	bool
737	maptile::_load_header (object_thawer &thawer)	616	maptile::_load_header (object_thawer &thawer)
738	{	617	{
739	for (;;)	618	for (;;)
740	{	619	{
741	keyword kw = thawer.get_kv ();	620	thawer.next ();
742		621
743	switch (kw)	622	switch (thawer.kw)
744	{	623	{
745	case KW_EOF:
746	LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
747	return false;
748
749	case KW_end:
750	return true;
751
752	default:
753	case KW_ERROR:
754	LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
755	break;
756
757	case KW_msg:	624	case KW_msg:
758	thawer.get_ml (KW_endmsg, msg);	625	thawer.get_ml (KW_endmsg, msg);
759	break;	626	break;
760		627
761	case KW_lore: // CF+ extension	628	case KW_lore: // CF+ extension
…		…
792	case KW_winddir: thawer.get (winddir); break;	659	case KW_winddir: thawer.get (winddir); break;
793	case KW_sky: thawer.get (sky); break;	660	case KW_sky: thawer.get (sky); break;
794		661
795	case KW_per_player: thawer.get (per_player); break;	662	case KW_per_player: thawer.get (per_player); break;
796	case KW_per_party: thawer.get (per_party); break;	663	case KW_per_party: thawer.get (per_party); break;
		664	case KW_no_reset: thawer.get (no_reset); break;
797		665
798	case KW_region: get_region_by_name (thawer.get_str ()); break;	666	case KW_region: default_region = region::find (thawer.get_str ()); break;
799	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	667	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
800		668
801	// old names new names	669	// old names new names
802	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	670	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
803	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	671	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
811		679
812	case KW_tile_path_1: thawer.get (tile_path [0]); break;	680	case KW_tile_path_1: thawer.get (tile_path [0]); break;
813	case KW_tile_path_2: thawer.get (tile_path [1]); break;	681	case KW_tile_path_2: thawer.get (tile_path [1]); break;
814	case KW_tile_path_3: thawer.get (tile_path [2]); break;	682	case KW_tile_path_3: thawer.get (tile_path [2]); break;
815	case KW_tile_path_4: thawer.get (tile_path [3]); break;	683	case KW_tile_path_4: thawer.get (tile_path [3]); break;
		684
		685	case KW_ERROR:
		686	set_key (thawer.kw_str, thawer.value);
		687	break;
		688
		689	case KW_end:
		690	return true;
		691
		692	default:
		693	if (!thawer.parse_error ("map", 0))
		694	return false;
		695	break;
816	}	696	}
817	}	697	}
818		698
819	abort ();	699	abort ();
820	}	700	}
…		…
846	object *above = op->above;	726	object *above = op->above;
847		727
848	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	728	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
849	unique = 1;	729	unique = 1;
850		730
851	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	731	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
852	{	732	{
853	op->destroy_inv (false);	733	op->destroy_inv (false);
854	op->destroy ();	734	op->destroy ();
855	}	735	}
856		736
…		…
870	if (name) MAP_OUT (name);	750	if (name) MAP_OUT (name);
871	MAP_OUT (swap_time);	751	MAP_OUT (swap_time);
872	MAP_OUT (reset_time);	752	MAP_OUT (reset_time);
873	MAP_OUT (reset_timeout);	753	MAP_OUT (reset_timeout);
874	MAP_OUT (fixed_resettime);	754	MAP_OUT (fixed_resettime);
		755	MAP_OUT (no_reset);
875	MAP_OUT (difficulty);	756	MAP_OUT (difficulty);
876		757
877	if (region) MAP_OUT2 (region, region->name);	758	if (default_region) MAP_OUT2 (region, default_region->name);
878		759
879	if (shopitems)	760	if (shopitems)
880	{	761	{
881	char shop[MAX_BUF];	762	char shop[MAX_BUF];
882	print_shop_string (this, shop);	763	print_shop_string (this, shop);
…		…
933	* Remove and free all objects in the given map.	814	* Remove and free all objects in the given map.
934	*/	815	*/
935	void	816	void
936	maptile::clear ()	817	maptile::clear ()
937	{	818	{
		819	sfree (regions, size ()); regions = 0;
		820	delete [] regionmap; regionmap = 0;
		821
938	if (!spaces)	822	if (spaces)
939	return;	823	{
940
941	for (mapspace *ms = spaces + size (); ms-- > spaces; )	824	for (mapspace *ms = spaces + size (); ms-- > spaces; )
942	while (object *op = ms->bot)	825	while (object *op = ms->bot)
943	{	826	{
944	if (op->head)
945	op = op->head;	827	op = op->head_ ();
946
947	op->destroy_inv (false);	828	op->destroy_inv (false);
948	op->destroy ();	829	op->destroy ();
949	}	830	}
950		831
951	sfree (spaces, size ()), spaces = 0;	832	sfree (spaces, size ()), spaces = 0;
		833	}
952		834
953	if (buttons)	835	if (buttons)
954	free_objectlinkpt (buttons), buttons = 0;	836	free_objectlinkpt (buttons), buttons = 0;
955	}	837	}
956		838
…		…
989	maptile::do_destroy ()	871	maptile::do_destroy ()
990	{	872	{
991	attachable::do_destroy ();	873	attachable::do_destroy ();
992		874
993	clear ();	875	clear ();
		876	}
		877
		878	/* decay and destroy perishable items in a map */
		879	void
		880	maptile::do_decay_objects ()
		881	{
		882	if (!spaces)
		883	return;
		884
		885	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		886	for (object above, op = ms->bot; op; op = above)
		887	{
		888	above = op->above;
		889
		890	bool destroy = 0;
		891
		892	// do not decay anything above unique floor tiles (yet :)
		893	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		894	break;
		895
		896	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		897	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		898	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
		899	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		900	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		901	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		902	\|\| op->is_alive ())
		903	; // do not decay
		904	else if (op->is_weapon ())
		905	{
		906	op->stats.dam--;
		907	if (op->stats.dam < 0)
		908	destroy = 1;
		909	}
		910	else if (op->is_armor ())
		911	{
		912	op->stats.ac--;
		913	if (op->stats.ac < 0)
		914	destroy = 1;
		915	}
		916	else if (op->type == FOOD)
		917	{
		918	op->stats.food -= rndm (5, 20);
		919	if (op->stats.food < 0)
		920	destroy = 1;
		921	}
		922	else
		923	{
		924	int mat = op->materials;
		925
		926	if (mat & M_PAPER
		927	\|\| mat & M_LEATHER
		928	\|\| mat & M_WOOD
		929	\|\| mat & M_ORGANIC
		930	\|\| mat & M_CLOTH
		931	\|\| mat & M_LIQUID
		932	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		933	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		934	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		935	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		936	\|\| (mat & M_ICE && temp > 32))
		937	destroy = 1;
		938	}
		939
		940	/* adjust overall chance below */
		941	if (destroy && rndm (0, 1))
		942	op->destroy ();
		943	}
994	}	944	}
995		945
996	/*	946	/*
997	* Updates every button on the map (by calling update_button() for them).	947	* Updates every button on the map (by calling update_button() for them).
998	*/	948	*/
…		…
1046	if (QUERY_FLAG (op, FLAG_GENERATOR))	996	if (QUERY_FLAG (op, FLAG_GENERATOR))
1047	{	997	{
1048	total_exp += op->stats.exp;	998	total_exp += op->stats.exp;
1049		999
1050	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	1000	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1051	total_exp += at->clone.stats.exp * 8;	1001	total_exp += at->stats.exp * 8;
1052		1002
1053	monster_cnt++;	1003	monster_cnt++;
1054	}	1004	}
1055	}	1005	}
1056		1006
…		…
1110	*/	1060	*/
1111	void	1061	void
1112	mapspace::update_ ()	1062	mapspace::update_ ()
1113	{	1063	{
1114	object tmp, last = 0;	1064	object tmp, last = 0;
1115	uint8 flags = 0, light = 0, anywhere = 0;	1065	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1116	New_Face top, floor, *middle;
1117	object top_obj, floor_obj, *middle_obj;
1118	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1066	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1119		1067
1120	middle = blank_face;	1068	//object *middle = 0;
1121	top = blank_face;	1069	//object *top = 0;
1122	floor = blank_face;	1070	//object *floor = 0;
1123		1071	// this seems to generate better code than using locals, above
1124	middle_obj = 0;	1072	object *&top = faces_obj[0] = 0;
1125	top_obj = 0;	1073	object *&middle = faces_obj[1] = 0;
1126	floor_obj = 0;	1074	object *&floor = faces_obj[2] = 0;
1127		1075
1128	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1076	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1129	{	1077	{
1130	/* This could be made additive I guess (two lights better than	1078	/* This could be made additive I guess (two lights better than
1131	* one). But if so, it shouldn't be a simple additive - 2	1079	* one). But if so, it shouldn't be a simple additive - 2
…		…
1144	* Always put the player down for drawing.	1092	* Always put the player down for drawing.
1145	*/	1093	*/
1146	if (!tmp->invisible)	1094	if (!tmp->invisible)
1147	{	1095	{
1148	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1096	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))
1149	{
1150	top = tmp->face;
1151	top_obj = tmp;	1097	top = tmp;
1152	}
1153	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1098	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1154	{	1099	{
1155	/* If we got a floor, that means middle and top were below it,	1100	/* If we got a floor, that means middle and top were below it,
1156	* so should not be visible, so we clear them.	1101	* so should not be visible, so we clear them.
1157	*/	1102	*/
1158	middle = blank_face;	1103	middle = 0;
1159	top = blank_face;	1104	top = 0;
1160	floor = tmp->face;
1161	floor_obj = tmp;	1105	floor = tmp;
1162	}	1106	}
1163	/* Flag anywhere have high priority */	1107	/* Flag anywhere have high priority */
1164	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1108	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1165	{	1109	{
1166	middle = tmp->face;
1167
1168	middle_obj = tmp;	1110	middle = tmp;
1169	anywhere = 1;	1111	anywhere = 1;
1170	}	1112	}
1171	/* Find the highest visible face around. If equal	1113	/* Find the highest visible face around. If equal
1172	* visibilities, we still want the one nearer to the	1114	* visibilities, we still want the one nearer to the
1173	* top	1115	* top
1174	*/	1116	*/
1175	else if (middle == blank_face \|\| (tmp->face->visibility > middle->visibility && !anywhere))	1117	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1176	{
1177	middle = tmp->face;
1178	middle_obj = tmp;	1118	middle = tmp;
1179	}
1180	}	1119	}
1181		1120
1182	if (tmp == tmp->above)	1121	if (tmp == tmp->above)
1183	{	1122	{
1184	LOG (llevError, "Error in structure of map\n");	1123	LOG (llevError, "Error in structure of map\n");
…		…
1219	* middle face. This should not happen, as we already have the	1158	* middle face. This should not happen, as we already have the
1220	* else statement above so middle should not get set. OTOH, it	1159	* else statement above so middle should not get set. OTOH, it
1221	* may be possible for the faces to match but be different objects.	1160	* may be possible for the faces to match but be different objects.
1222	*/	1161	*/
1223	if (top == middle)	1162	if (top == middle)
1224	middle = blank_face;	1163	middle = 0;
1225		1164
1226	/* There are three posibilities at this point:	1165	/* There are three posibilities at this point:
1227	* 1) top face is set, need middle to be set.	1166	* 1) top face is set, need middle to be set.
1228	* 2) middle is set, need to set top.	1167	* 2) middle is set, need to set top.
1229	* 3) neither middle or top is set - need to set both.	1168	* 3) neither middle or top is set - need to set both.
…		…
1234	/* 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 */
1235	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1174	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1236	break;	1175	break;
1237		1176
1238	/* If two top faces are already set, quit processing */	1177	/* If two top faces are already set, quit processing */
1239	if ((top != blank_face) && (middle != blank_face))	1178	if (top && middle)
1240	break;	1179	break;
1241		1180
1242	/* Only show visible faces */	1181	/* Only show visible faces */
1243	if (!tmp->invisible)	1182	if (!tmp->invisible)
1244	{	1183	{
1245	/* Fill in top if needed */	1184	/* Fill in top if needed */
1246	if (top == blank_face)	1185	if (!top)
1247	{	1186	{
1248	top = tmp->face;
1249	top_obj = tmp;	1187	top = tmp;
1250	if (top == middle)	1188	if (top == middle)
1251	middle = blank_face;	1189	middle = 0;
1252	}	1190	}
1253	else	1191	else
1254	{	1192	{
1255	/* top is already set - we should only get here if	1193	/* top is already set - we should only get here if
1256	* middle is not set	1194	* middle is not set
1257	*	1195	*
1258	* Set the middle face and break out, since there is nothing	1196	* Set the middle face and break out, since there is nothing
1259	* more to fill in. We don't check visiblity here, since	1197	* more to fill in. We don't check visiblity here, since
1260	*	1198	*
1261	*/	1199	*/
1262	if (tmp->face != top)	1200	if (tmp != top)
1263	{	1201	{
1264	middle = tmp->face;
1265	middle_obj = tmp;	1202	middle = tmp;
1266	break;	1203	break;
1267	}	1204	}
1268	}	1205	}
1269	}	1206	}
1270	}	1207	}
1271		1208
1272	if (middle == floor)	1209	if (middle == floor)
1273	middle = blank_face;	1210	middle = 0;
1274		1211
1275	if (top == middle)	1212	if (top == middle)
1276	middle = blank_face;	1213	middle = 0;
1277		1214
1278	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1215	#if 0
1279	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1216	faces_obj [0] = top;
1280	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;	1217	faces_obj [1] = middle;
		1218	faces_obj [2] = floor;
		1219	#endif
		1220	}
		1221
		1222	uint64
		1223	mapspace::volume () const
		1224	{
		1225	uint64 vol = 0;
		1226
		1227	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
		1228	vol += op->volume ();
		1229
		1230	return vol;
1281	}	1231	}
1282		1232
1283	/* this updates the orig_map->tile_map[tile_num] value after finding	1233	/* this updates the orig_map->tile_map[tile_num] value after finding
1284	* the map. It also takes care of linking back the freshly found	1234	* the map. It also takes care of linking back the freshly found
1285	* maps tile_map values if it tiles back to this one. It returns	1235	* maps tile_map values if it tiles back to this one. It returns
…		…
1450		1400
1451	/**	1401	/**
1452	* Return whether map2 is adjacent to map1. If so, store the distance from	1402	* Return whether map2 is adjacent to map1. If so, store the distance from
1453	* map1 to map2 in dx/dy.	1403	* map1 to map2 in dx/dy.
1454	*/	1404	*/
1455	static int	1405	int
1456	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1406	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1457	{	1407	{
1458	if (!map1 \|\| !map2)	1408	if (!map1 \|\| !map2)
1459	return 0;	1409	return 0;
1460		1410
…		…
1551	/* From map.c	1501	/* From map.c
1552	* This is used by get_player to determine where the other	1502	* This is used by get_player to determine where the other
1553	* creature is. get_rangevector takes into account map tiling,	1503	* creature is. get_rangevector takes into account map tiling,
1554	* so you just can not look the the map coordinates and get the	1504	* so you just can not look the the map coordinates and get the
1555	* righte value. distance_x/y are distance away, which	1505	* righte value. distance_x/y are distance away, which
1556	* can be negativbe. direction is the crossfire direction scheme	1506	* can be negative. direction is the crossfire direction scheme
1557	* that the creature should head. part is the part of the	1507	* that the creature should head. part is the part of the
1558	* monster that is closest.	1508	* monster that is closest.
1559	*	1509	*
1560	* get_rangevector looks at op1 and op2, and fills in the	1510	* get_rangevector looks at op1 and op2, and fills in the
1561	* structure for op1 to get to op2.	1511	* structure for op1 to get to op2.
…		…
1572	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1522	get_rangevector (object op1, object op2, rv_vector * retval, int flags)
1573	{	1523	{
1574	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1524	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1575	{	1525	{
1576	/* be conservative and fill in _some_ data */	1526	/* be conservative and fill in _some_ data */
1577	retval->distance = 100000;	1527	retval->distance = 10000;
1578	retval->distance_x = 32767;	1528	retval->distance_x = 10000;
1579	retval->distance_y = 32767;	1529	retval->distance_y = 10000;
1580	retval->direction = 0;	1530	retval->direction = 0;
1581	retval->part = 0;	1531	retval->part = 0;
1582	}	1532	}
1583	else	1533	else
1584	{	1534	{
…		…
1589		1539
1590	best = op1;	1540	best = op1;
1591	/* If this is multipart, find the closest part now */	1541	/* If this is multipart, find the closest part now */
1592	if (!(flags & 0x1) && op1->more)	1542	if (!(flags & 0x1) && op1->more)
1593	{	1543	{
1594	object *tmp;
1595	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1544	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1596		1545
1597	/* we just take the offset of the piece to head to figure	1546	/* we just take the offset of the piece to head to figure
1598	* distance instead of doing all that work above again	1547	* distance instead of doing all that work above again
1599	* since the distance fields we set above are positive in the	1548	* since the distance fields we set above are positive in the
1600	* same axis as is used for multipart objects, the simply arithmetic	1549	* same axis as is used for multipart objects, the simply arithmetic
1601	* below works.	1550	* below works.
1602	*/	1551	*/
1603	for (tmp = op1->more; tmp != NULL; tmp = tmp->more)	1552	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1604	{	1553	{
1605	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1554	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1606	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1555	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1607	if (tmpi < best_distance)	1556	if (tmpi < best_distance)
1608	{	1557	{
1609	best_distance = tmpi;	1558	best_distance = tmpi;
1610	best = tmp;	1559	best = tmp;
1611	}	1560	}
1612	}	1561	}
		1562
1613	if (best != op1)	1563	if (best != op1)
1614	{	1564	{
1615	retval->distance_x += op1->x - best->x;	1565	retval->distance_x += op1->x - best->x;
1616	retval->distance_y += op1->y - best->y;	1566	retval->distance_y += op1->y - best->y;
1617	}	1567	}
1618	}	1568	}
		1569
1619	retval->part = best;	1570	retval->part = best;
1620	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1571	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1621	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1572	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1622	}	1573	}
1623	}	1574	}
1624		1575
1625	/* this is basically the same as get_rangevector above, but instead of	1576	/* this is basically the same as get_rangevector above, but instead of
…		…
1630	* flags has no meaning for this function at this time - I kept it in to	1581	* flags has no meaning for this function at this time - I kept it in to
1631	* be more consistant with the above function and also in case they are needed	1582	* be more consistant with the above function and also in case they are needed
1632	* for something in the future. Also, since no object is pasted, the best	1583	* for something in the future. Also, since no object is pasted, the best
1633	* field of the rv_vector is set to NULL.	1584	* field of the rv_vector is set to NULL.
1634	*/	1585	*/
1635
1636	void	1586	void
1637	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector * retval, int flags)	1587	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1638	{	1588	{
1639	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1589	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1640	{	1590	{
1641	/* be conservative and fill in _some_ data */	1591	/* be conservative and fill in _some_ data */
1642	retval->distance = 100000;	1592	retval->distance = 100000;
…		…
1649	{	1599	{
1650	retval->distance_x += op2->x - x;	1600	retval->distance_x += op2->x - x;
1651	retval->distance_y += op2->y - y;	1601	retval->distance_y += op2->y - y;
1652		1602
1653	retval->part = NULL;	1603	retval->part = NULL;
1654	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1604	retval->distance = idistance (retval->distance_x, retval->distance_y);
1655	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1605	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1656	}	1606	}
1657	}	1607	}
1658		1608
1659	/* Returns true of op1 and op2 are effectively on the same map	1609	/* Returns true of op1 and op2 are effectively on the same map
…		…
1679	op->remove ();	1629	op->remove ();
1680		1630
1681	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1631	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1682	}	1632	}
1683		1633
		1634	region *
		1635	maptile::region (int x, int y) const
		1636	{
		1637	if (regions
		1638	&& regionmap
		1639	&& !OUT_OF_REAL_MAP (this, x, y))
		1640	if (struct region reg = regionmap [regions [y width + x]])
		1641	return reg;
		1642
		1643	if (default_region)
		1644	return default_region;
		1645
		1646	return ::region::default_region ();
		1647	}
		1648
		1649	/* picks a random object from a style map.
		1650	* Redone by MSW so it should be faster and not use static
		1651	* variables to generate tables.
		1652	*/
		1653	object *
		1654	maptile::pick_random_object () const
		1655	{
		1656	/* while returning a null object will result in a crash, that
		1657	* is actually preferable to an infinite loop. That is because
		1658	* most servers will automatically restart in case of crash.
		1659	* Change the logic on getting the random space - shouldn't make
		1660	* any difference, but this seems clearer to me.
		1661	*/
		1662	for (int i = 1000; --i;)
		1663	{
		1664	object *pick = at (rndm (width), rndm (height)).bot;
		1665
		1666	// do not prefer big monsters just because they are big.
		1667	if (pick && pick->head_ () == pick)
		1668	return pick->head_ ();
		1669	}
		1670
		1671	// instead of crashing in the unlikely(?) case, try to return something
		1672	return get_archetype ("blocked");
		1673	}
		1674
		1675	/**
		1676	* Maximum distance a player may hear a sound from.
		1677	* This is only used for new client/server sound. If the sound source
		1678	* on the map is farther away than this, we don't sent it to the client.
		1679	*/
		1680	#define MAX_SOUND_DISTANCE 10
		1681
		1682	void
		1683	maptile::play_sound (faceidx sound, int x, int y) const
		1684	{
		1685	if (!sound)
		1686	return;
		1687
		1688	for_all_players (pl)
		1689	if (pl->ob->map == this)
		1690	if (client *ns = pl->ns)
		1691	{
		1692	int dx = x - pl->ob->x;
		1693	int dy = y - pl->ob->y;
		1694
		1695	int distance = idistance (dx, dy);
		1696
		1697	if (distance <= MAX_SOUND_DISTANCE)
		1698	ns->play_sound (sound, dx, dy);
		1699	}
		1700	}
		1701

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.73 by root, Sun Jan 14 18:00:33 2007 UTC vs. Revision 1.114 by root, Thu Jul 26 00:27:07 2007 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.73 by root, Sun Jan 14 18:00:33 2007 UTC vs.
Revision 1.114 by root, Thu Jul 26 00:27:07 2007 UTC