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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.178 by root, Sun Nov 29 09:41:27 2009 UTC vs.
Revision 1.223 by root, Wed Dec 5 19:03:26 2018 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
		4	* Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	5	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team	6	* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	7	* Copyright (©) 1992 Frank Tore Johansen
7	*	8	*
8	* Deliantra is free software: you can redistribute it and/or modify it under	9	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the	10	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your	11	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.	12	* option) any later version.
12	*	13	*
13	* This program is distributed in the hope that it will be useful,	14	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	17	* GNU General Public License for more details.
17	*	18	*
18	* You should have received a copy of the Affero GNU General Public License	19	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see	20	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.	21	* <http://www.gnu.org/licenses/>.
21	*	22	*
22	* The authors can be reached via e-mail to <support@deliantra.net>	23	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	24	*/
24		25
25	#include <unistd.h>	26	#include <unistd.h>
26		27
27	#include "global.h"	28	#include "global.h"
28	#include "loader.h"
29	#include "path.h"	29	#include "path.h"
30		30
31	//+GPL	31	//+GPL
32		32
33	sint8 maptile::outdoor_darkness;	33	sint8 maptile::outdoor_darkness;
60	return mp->at (newx, newy).flags () \| (mp != oldmap ? P_NEW_MAP : 0);	60	return mp->at (newx, newy).flags () \| (mp != oldmap ? P_NEW_MAP : 0);
61	}	61	}
62		62
63	/*	63	/*
64	* Returns true if the given coordinate is blocked except by the	64	* Returns true if the given coordinate is blocked except by the
65	* object passed is not blocking. This is used with	65	* object passed is not blocking. This is used with
66	* multipart monsters - if we want to see if a 2x2 monster	66	* multipart monsters - if we want to see if a 2x2 monster
67	* can move 1 space to the left, we don't want its own area	67	* can move 1 space to the left, we don't want its own area
68	* to block it from moving there.	68	* to block it from moving there.
69	* Returns TRUE if the space is blocked by something other than the	69	* Returns TRUE if the space is blocked by something other than the
70	* monster.	70	* monster.
…		…
78	/* Make sure the coordinates are valid - they should be, as caller should	78	/* Make sure the coordinates are valid - they should be, as caller should
79	* have already checked this.	79	* have already checked this.
80	*/	80	*/
81	if (OUT_OF_REAL_MAP (m, sx, sy))	81	if (OUT_OF_REAL_MAP (m, sx, sy))
82	{	82	{
83	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");	83	LOG (llevError \| logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
84	return 1;	84	return 1;
85	}	85	}
86		86
87	mapspace &ms = m->at (sx, sy);	87	mapspace &ms = m->at (sx, sy);
88		88
…		…
91		91
92	/* If space is currently not blocked by anything, no need to	92	/* If space is currently not blocked by anything, no need to
93	* go further. Not true for players - all sorts of special	93	* go further. Not true for players - all sorts of special
94	* things we need to do for players.	94	* things we need to do for players.
95	*/	95	*/
96	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	96	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
97	return 0;	97	return 0;
98		98
99	/* if there isn't anything alive on this space, and this space isn't	99	/* if there isn't anything alive on this space, and this space isn't
100	* otherwise blocked, we can return now. Only if there is a living	100	* otherwise blocked, we can return now. Only if there is a living
101	* creature do we need to investigate if it is part of this creature	101	* creature do we need to investigate if it is part of this creature
…		…
111	/* We basically go through the stack of objects, and if there is	111	/* We basically go through the stack of objects, and if there is
112	* some other object that has NO_PASS or FLAG_ALIVE set, return	112	* some other object that has NO_PASS or FLAG_ALIVE set, return
113	* true. If we get through the entire stack, that must mean	113	* true. If we get through the entire stack, that must mean
114	* ob is blocking it, so return 0.	114	* ob is blocking it, so return 0.
115	*/	115	*/
116	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	116	for (object *tmp = ms.top; tmp; tmp = tmp->below)
117	{	117	{
118	if (OB_MOVE_BLOCK (ob, tmp))	118	if (OB_MOVE_BLOCK (ob, tmp))
119	{	119	{
120	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))	120	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
121	if (RESULT_INT (0))	121	if (RESULT_INT (0))
…		…
145	return 1; // unconditional block	145	return 1; // unconditional block
146		146
147	} else {	147	} else {
148	// space does not block the ob, directly, but	148	// space does not block the ob, directly, but
149	// anything alive that is not a door still	149	// anything alive that is not a door still
150	// blocks anything but wizards.	150	// blocks anything
151		151
152	if (tmp->flag [FLAG_ALIVE]	152	if (tmp->flag [FLAG_ALIVE]
153	&& tmp->head_ () != ob
154	&& tmp != ob
155	&& tmp->type != DOOR	153	&& tmp->type != DOOR
156	&& !tmp->flag [FLAG_WIZPASS])	154	&& tmp->head_ () != ob) //TODO: maybe move these check up?
157	return 1;	155	return 1;
158	}	156	}
159	}	157	}
160		158
161	return 0;	159	return 0;
162	}	160	}
163		161
164	/*	162	/*
165	* Returns qthe blocking object if the given object can't fit in the given	163	* Returns the blocking object if the given object can't fit in the given
166	* spot. This is meant for multi space objects - for single space objecs,	164	* spot. This is meant for multi space objects - for single space objecs,
167	* just calling get_map_blocked and checking that against movement type	165	* just calling get_map_blocked and checking that against movement type
168	* of object. This function goes through all the parts of the multipart	166	* of object. This function goes through all the parts of the multipart
169	* object and makes sure they can be inserted.	167	* object and makes sure they can be inserted.
170	*	168	*
…		…
314	case KW_arch:	312	case KW_arch:
315	if (object *op = object::read (f, this))	313	if (object *op = object::read (f, this))
316	{	314	{
317	// TODO: why?	315	// TODO: why?
318	if (op->inv)	316	if (op->inv)
		317	{
		318	op->carrying = 0;
319	op->update_weight ();	319	op->update_weight ();
		320	}
320		321
321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))	322	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322	{	323	{
323	// we insert manually because	324	// we insert manually because
324	// a) its way faster	325	// a) its way faster
…		…
361	}	362	}
362		363
363	void	364	void
364	maptile::activate ()	365	maptile::activate ()
365	{	366	{
366	if (spaces)	367	if (state != MAP_INACTIVE)
		368	return;
		369
367	for (mapspace *ms = spaces + size (); ms-- > spaces; )	370	for (mapspace *ms = spaces + size (); ms-- > spaces; )
368	for (object *op = ms->bot; op; op = op->above)	371	for (object *op = ms->bot; op; op = op->above)
369	op->activate_recursive ();	372	op->activate_recursive ();
		373
		374	state = MAP_ACTIVE;
		375
		376	activate_physics ();
370	}	377	}
371		378
372	void	379	void
373	maptile::deactivate ()	380	maptile::deactivate ()
374	{	381	{
375	if (spaces)	382	if (state != MAP_ACTIVE)
		383	return;
		384
376	for (mapspace *ms = spaces + size (); ms-- > spaces; )	385	for (mapspace *ms = spaces + size (); ms-- > spaces; )
377	for (object *op = ms->bot; op; op = op->above)	386	for (object *op = ms->bot; op; op = op->above)
378	op->deactivate_recursive ();	387	op->deactivate_recursive ();
		388
		389	state = MAP_INACTIVE;
379	}	390	}
380		391
381	bool	392	bool
382	maptile::_save_objects (object_freezer &f, int flags)	393	maptile::_save_objects (object_freezer &f, int flags)
383	{	394	{
…		…
395		406
396	for (object *op = spaces [i].bot; op; op = op->above)	407	for (object *op = spaces [i].bot; op; op = op->above)
397	{	408	{
398	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];	409	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
399		410
400	if (expect_false (!op->can_map_save ()))	411	if (ecb_expect_false (!op->can_map_save ()))
401	continue;	412	continue;
402		413
403	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))	414	if (ecb_expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
404	{	415	{
405	if (flags & IO_UNIQUES)	416	if (flags & IO_UNIQUES)
406	op->write (f);	417	op->write (f);
407	}	418	}
408	else if (expect_true (flags & IO_OBJECTS))	419	else if (ecb_expect_true (flags & IO_OBJECTS))
409	op->write (f);	420	op->write (f);
410	}	421	}
411	}	422	}
412		423
413	coroapi::cede_to_tick ();	424	coroapi::cede_to_tick ();
…		…
424	return false;	435	return false;
425		436
426	return freezer.save (path);	437	return freezer.save (path);
427	}	438	}
428		439
429	maptile::maptile ()	440	void
		441	maptile::init ()
430	{	442	{
431	in_memory = MAP_SWAPPED;	443	state = MAP_SWAPPED;
432		444
433	/* The maps used to pick up default x and y values from the	445	/* The maps used to pick up default x and y values from the
434	* map archetype. Mimic that behaviour.	446	* map archetype. Mimic that behaviour.
435	*/	447	*/
436	width = 16;	448	width = 16;
437	height = 16;	449	height = 16;
438	timeout = 300;	450	timeout = 300;
439	max_items = MAX_ITEM_PER_ACTION;	451	max_items = MAX_ITEM_PER_ACTION;
440	max_volume = 2000000; // 2m³	452	max_volume = 2000000; // 2m³
441	}
442
443	maptile::maptile (int w, int h)
444	{
445	in_memory = MAP_SWAPPED;
446
447	width = w;
448	height = h;
449	reset_timeout = 0;	453	reset_timeout = 0;
450	timeout = 300;
451	enter_x = 0;	454	enter_x = 0;
452	enter_y = 0;	455	enter_y = 0;
		456	}
		457
		458	maptile::maptile ()
		459	{
		460	init ();
		461	}
		462
		463	maptile::maptile (int w, int h)
		464	{
		465	init ();
		466
		467	width = w;
		468	height = h;
453		469
454	alloc ();	470	alloc ();
455	}	471	}
456		472
457	/*	473	/*
…		…
468	spaces = salloc0<mapspace> (size ());	484	spaces = salloc0<mapspace> (size ());
469	}	485	}
470		486
471	//+GPL	487	//+GPL
472		488
473	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	489	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
474	* corresponding to that string. Memory is allocated for this, it must be freed	490	* corresponding to that string. Memory is allocated for this, it must be freed
475	* at a later date.	491	* at a later date.
476	* Called by parse_map_headers below.	492	* Called by parse_map_headers below.
477	*/	493	*/
478	static shopitems *	494	static shopitems *
479	parse_shop_string (const char *input_string)	495	parse_shop_string (const char *input_string)
…		…
528	*q = '\0';	544	*q = '\0';
529		545
530	current_type = get_typedata_by_name (p);	546	current_type = get_typedata_by_name (p);
531	if (current_type)	547	if (current_type)
532	{	548	{
533	items[i].name = current_type->name;	549	items[i].name = current_type->name;
534	items[i].typenum = current_type->number;	550	items[i].typenum = current_type->number;
535	items[i].name_pl = current_type->name_pl;	551	items[i].name_pl = current_type->name_pl;
536	}	552	}
537	else	553	else
538	{ /* oh uh, something's wrong, let's free up this one, and try	554	{ /* oh uh, something's wrong, let's free up this one, and try
539	* the next entry while we're at it, better print a warning	555	* the next entry while we're at it, better print a warning
540	*/	556	*/
541	LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);	557	LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
542	}	558	}
543	}	559	}
544		560
…		…
557	* the map (or something equivilent) into output_string. */	573	* the map (or something equivilent) into output_string. */
558	static const char *	574	static const char *
559	print_shop_string (maptile *m)	575	print_shop_string (maptile *m)
560	{	576	{
561	static dynbuf_text buf; buf.clear ();	577	static dynbuf_text buf; buf.clear ();
		578	bool first = true;
562		579
563	for (int i = 0; i < m->shopitems[0].index; i++)	580	for (int i = 0; i < m->shopitems[0].index; i++)
564	{	581	{
		582	if (!first)
		583	buf << ';';
		584
		585	first = false;
		586
565	if (m->shopitems[i].typenum)	587	if (m->shopitems[i].typenum)
566	{	588	{
567	if (m->shopitems[i].strength)	589	if (m->shopitems[i].strength)
568	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	590	buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
569	else	591	else
570	buf.printf ("%s;", m->shopitems[i].name);	592	buf.printf ("%s", m->shopitems[i].name);
571	}	593	}
572	else	594	else
573	{	595	{
574	if (m->shopitems[i].strength)	596	if (m->shopitems[i].strength)
575	buf.printf ("*:%d;", m->shopitems[i].strength);	597	buf.printf ("*:%d", m->shopitems[i].strength);
576	else	598	else
577	buf.printf ("*");	599	buf.printf ("*");
578	}	600	}
579	}	601	}
580		602
…		…
603	{	625	{
604	case KW_msg:	626	case KW_msg:
605	thawer.get_ml (KW_endmsg, msg);	627	thawer.get_ml (KW_endmsg, msg);
606	break;	628	break;
607		629
608	case KW_lore: // CF+ extension	630	case KW_lore: // deliantra extension
609	thawer.get_ml (KW_endlore, maplore);	631	thawer.get_ml (KW_endlore, maplore);
610	break;	632	break;
611		633
612	case KW_maplore:	634	case KW_maplore:
613	thawer.get_ml (KW_endmaplore, maplore);	635	thawer.get_ml (KW_endmaplore, maplore);
…		…
636	case KW_per_player: thawer.get (per_player); break;	658	case KW_per_player: thawer.get (per_player); break;
637	case KW_per_party: thawer.get (per_party); break;	659	case KW_per_party: thawer.get (per_party); break;
638	case KW_no_reset: thawer.get (no_reset); break;	660	case KW_no_reset: thawer.get (no_reset); break;
639	case KW_no_drop: thawer.get (no_drop); break;	661	case KW_no_drop: thawer.get (no_drop); break;
640		662
641	case KW_region: default_region = region::find (thawer.get_str ()); break;	663	case KW_region: thawer.get (default_region); break;
642	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	664	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
643		665
644	// old names new names	666	// old names new names
645	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	667	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
646	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	668	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
650	case KW_value: case KW_swap_time: thawer.get (timeout); break;	672	case KW_value: case KW_swap_time: thawer.get (timeout); break;
651	case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;	673	case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;
652	case KW_invisible: case KW_darkness: thawer.get (darkness); break;	674	case KW_invisible: case KW_darkness: thawer.get (darkness); break;
653	case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;	675	case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;
654		676
655	case KW_tile_path_1: thawer.get (tile_path [0]); break;	677	case KW_tile_path_1: thawer.get (tile_path [TILE_NORTH]); break;
656	case KW_tile_path_2: thawer.get (tile_path [1]); break;	678	case KW_tile_path_2: thawer.get (tile_path [TILE_EAST ]); break;
657	case KW_tile_path_3: thawer.get (tile_path [2]); break;	679	case KW_tile_path_3: thawer.get (tile_path [TILE_SOUTH]); break;
658	case KW_tile_path_4: thawer.get (tile_path [3]); break;	680	case KW_tile_path_4: thawer.get (tile_path [TILE_WEST ]); break;
		681	case KW_tile_path_5: thawer.get (tile_path [TILE_UP ]); break;
		682	case KW_tile_path_6: thawer.get (tile_path [TILE_DOWN ]); break;
659		683
660	case KW_ERROR:	684	case KW_ERROR:
661	set_key_text (thawer.kw_str, thawer.value);	685	set_key_text (thawer.kw_str, thawer.value);
662	break;	686	break;
663		687
664	case KW_end:	688	case KW_end:
665	thawer.next ();	689	thawer.next ();
666	return true;	690	return true;
667		691
668	default:	692	default:
669	if (!thawer.parse_error ("map", 0))	693	if (!thawer.parse_error ("map"))
670	return false;	694	return false;
671	break;	695	break;
672	}	696	}
673		697
674	thawer.next ();	698	thawer.next ();
…		…
692	int unique = 0;	716	int unique = 0;
693	for (object *op = spaces [i].bot; op; )	717	for (object *op = spaces [i].bot; op; )
694	{	718	{
695	object *above = op->above;	719	object *above = op->above;
696		720
697	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	721	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
698	unique = 1;	722	unique = 1;
699		723
700	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	724	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] \|\| unique))
701	op->destroy ();	725	op->destroy ();
702		726
703	op = above;	727	op = above;
704	}	728	}
705	}	729	}
…		…
742	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);	766	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
743		767
744	MAP_OUT (per_player);	768	MAP_OUT (per_player);
745	MAP_OUT (per_party);	769	MAP_OUT (per_party);
746		770
747	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	771	if (tile_path [TILE_NORTH]) MAP_OUT2 (tile_path_1, tile_path [TILE_NORTH]);
748	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	772	if (tile_path [TILE_EAST ]) MAP_OUT2 (tile_path_2, tile_path [TILE_EAST ]);
749	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	773	if (tile_path [TILE_SOUTH]) MAP_OUT2 (tile_path_3, tile_path [TILE_SOUTH]);
750	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	774	if (tile_path [TILE_WEST ]) MAP_OUT2 (tile_path_4, tile_path [TILE_WEST ]);
		775	if (tile_path [TILE_UP ]) MAP_OUT2 (tile_path_5, tile_path [TILE_UP ]);
		776	if (tile_path [TILE_DOWN ]) MAP_OUT2 (tile_path_6, tile_path [TILE_DOWN ]);
751		777
752	freezer.put (this);	778	freezer.put (this);
753	freezer.put (KW(end));	779	freezer.put (KW(end));
754		780
755	return true;	781	return true;
…		…
812	msg = 0;	838	msg = 0;
813	maplore = 0;	839	maplore = 0;
814	shoprace = 0;	840	shoprace = 0;
815	delete [] shopitems, shopitems = 0;	841	delete [] shopitems, shopitems = 0;
816		842
817	for (int i = 0; i < 4; i++)	843	for (int i = 0; i < ecb_array_length (tile_path); i++)
818	tile_path [i] = 0;	844	tile_path [i] = 0;
819	}	845	}
820		846
821	maptile::~maptile ()	847	maptile::~maptile ()
822	{	848	{
…		…
829	/* We need to look through all the maps and see if any maps	855	/* We need to look through all the maps and see if any maps
830	* are pointing at this one for tiling information. Since	856	* are pointing at this one for tiling information. Since
831	* tiling can be asymetric, we just can not look to see which	857	* tiling can be asymetric, we just can not look to see which
832	* maps this map tiles with and clears those.	858	* maps this map tiles with and clears those.
833	*/	859	*/
834	for (int i = 0; i < 4; i++)	860	for (int i = 0; i < ecb_array_length (tile_path); i++)
835	if (tile_map[i] == m)	861	if (tile_map[i] == m)
836	tile_map[i] = 0;	862	tile_map[i] = 0;
837	}	863	}
838		864
839	void	865	void
…		…
855	for (mapspace *ms = spaces + size (); ms-- > spaces; )	881	for (mapspace *ms = spaces + size (); ms-- > spaces; )
856	for (object above, op = ms->bot; op; op = above)	882	for (object above, op = ms->bot; op; op = above)
857	{	883	{
858	above = op->above;	884	above = op->above;
859		885
		886	// do not decay anything above unique floor tiles (yet :)
		887	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		888	break;
		889
860	bool destroy = 0;	890	bool destroy = 0;
861		891
862	// do not decay anything above unique floor tiles (yet :)	892	if (op->flag [FLAG_IS_FLOOR]
863	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	893	\|\| op->flag [FLAG_OBJ_ORIGINAL]
864	break;	894	\|\| op->flag [FLAG_UNIQUE]
865		895	\|\| op->flag [FLAG_OVERLAY_FLOOR]
866	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	896	\|\| op->flag [FLAG_UNPAID]
867	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
868	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
869	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
870	\|\| QUERY_FLAG (op, FLAG_UNPAID)
871	\|\| op->is_alive ())	897	\|\| op->is_alive ())
872	; // do not decay	898	; // do not decay
873	else if (op->is_weapon ())	899	else if (op->is_weapon ())
874	{	900	{
875	op->stats.dam--;	901	op->stats.dam--;
…		…
931	sint64 total_exp = 0;	957	sint64 total_exp = 0;
932		958
933	for (mapspace *ms = spaces + size (); ms-- > spaces; )	959	for (mapspace *ms = spaces + size (); ms-- > spaces; )
934	for (object *op = ms->bot; op; op = op->above)	960	for (object *op = ms->bot; op; op = op->above)
935	{	961	{
936	if (QUERY_FLAG (op, FLAG_MONSTER))	962	if (op->flag [FLAG_MONSTER])
937	{	963	{
938	total_exp += op->stats.exp;	964	total_exp += op->stats.exp;
939	monster_cnt++;	965	monster_cnt++;
940	}	966	}
941		967
942	if (QUERY_FLAG (op, FLAG_GENERATOR))	968	if (op->flag [FLAG_GENERATOR])
943	{	969	{
944	total_exp += op->stats.exp;	970	total_exp += op->stats.exp;
945		971
946	if (archetype *at = op->other_arch)	972	if (archetype *at = op->other_arch)
947	{	973	{
…		…
992	update_all_map_los (this);	1018	update_all_map_los (this);
993		1019
994	return 1;	1020	return 1;
995	}	1021	}
996		1022
997	/*	1023	/*
998	* This function updates various attributes about a specific space	1024	* This function updates various attributes about a specific space
999	* on the map (what it looks like, whether it blocks magic,	1025	* on the map (what it looks like, whether it blocks magic,
1000	* has a living creatures, prevents people from passing	1026	* has a living creatures, prevents people from passing
1001	* through, etc)	1027	* through, etc)
1002	*/	1028	*/
…		…
1033	* 3 times each time the player moves, because many of the	1059	* 3 times each time the player moves, because many of the
1034	* functions the move_player calls eventualy call this.	1060	* functions the move_player calls eventualy call this.
1035	*	1061	*
1036	* Always put the player down for drawing.	1062	* Always put the player down for drawing.
1037	*/	1063	*/
1038	if (expect_true (!tmp->invisible))	1064	if (ecb_expect_true (!tmp->invisible))
1039	{	1065	{
1040	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))	1066	if (ecb_expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1041	top = tmp;	1067	top = tmp;
1042	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))	1068	else if (ecb_expect_false (tmp->flag [FLAG_IS_FLOOR]))
1043	{	1069	{
1044	/* If we got a floor, that means middle and top were below it,	1070	/* If we got a floor, that means middle and top were below it,
1045	* so should not be visible, so we clear them.	1071	* so should not be visible, so we clear them.
1046	*/	1072	*/
1047	middle = 0;	1073	middle = 0;
…		…
1050	volume = 0;	1076	volume = 0;
1051	items = 0;	1077	items = 0;
1052	}	1078	}
1053	else	1079	else
1054	{	1080	{
1055	if (expect_true (!tmp->flag [FLAG_NO_PICK]))	1081	if (ecb_expect_true (!tmp->flag [FLAG_NO_PICK]))
1056	{	1082	{
1057	++items;	1083	++items;
1058	volume += tmp->volume ();	1084	volume += tmp->volume ();
1059	}	1085	}
1060		1086
1061	/* Flag anywhere have high priority */	1087	/* Flag anywhere have high priority */
1062	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))	1088	if (ecb_expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1063	anywhere = tmp;	1089	anywhere = tmp;
1064		1090
1065	/* Find the highest visible face around. If equal	1091	/* Find the highest visible face around. If equal
1066	* visibilities, we still want the one nearer to the	1092	* visibilities, we still want the one nearer to the
1067	* top	1093	* top
1068	*/	1094	*/
1069	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))	1095	if (ecb_expect_false (::faces [tmp->face].visibility >= middle_visibility))
1070	{	1096	{
1071	middle_visibility = ::faces [tmp->face].visibility;	1097	middle_visibility = ::faces [tmp->face].visibility;
1072	middle = tmp;	1098	middle = tmp;
1073	}	1099	}
1074	}	1100	}
…		…
1106	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31	1132	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1107		1133
1108	/* At this point, we have a floor face (if there is a floor),	1134	/* At this point, we have a floor face (if there is a floor),
1109	* and the floor is set - we are not going to touch it at	1135	* and the floor is set - we are not going to touch it at
1110	* this point.	1136	* this point.
1111	* middle contains the highest visibility face.	1137	* middle contains the highest visibility face.
1112	* top contains a player/monster face, if there is one.	1138	* top contains a player/monster face, if there is one.
1113	*	1139	*
1114	* We now need to fill in top.face and/or middle.face.	1140	* We now need to fill in top.face and/or middle.face.
1115	*/	1141	*/
1116		1142
1117	/* If the top face also happens to be high visibility, re-do our	1143	/* If the top face also happens to be high visibility, re-do our
1118	* middle face. This should not happen, as we already have the	1144	* middle face. This should not happen, as we already have the
1119	* else statement above so middle should not get set. OTOH, it	1145	* else statement above so middle should not get set. OTOH, it
1120	* may be possible for the faces to match but be different objects.	1146	* may be possible for the faces to match but be different objects.
1121	*/	1147	*/
1122	if (top == middle)	1148	if (top == middle)
1123	middle = 0;	1149	middle = 0;
1124		1150
…		…
1129	*/	1155	*/
1130		1156
1131	for (object *tmp = last; tmp; tmp = tmp->below)	1157	for (object *tmp = last; tmp; tmp = tmp->below)
1132	{	1158	{
1133	/* Once we get to a floor, stop, since we already have a floor object */	1159	/* Once we get to a floor, stop, since we already have a floor object */
1134	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1160	if (tmp->flag [FLAG_IS_FLOOR])
1135	break;	1161	break;
1136		1162
1137	/* If two top faces are already set, quit processing */	1163	/* If two top faces are already set, quit processing */
1138	if (top && middle)	1164	if (top && middle)
1139	break;	1165	break;
…		…
1153	/* top is already set - we should only get here if	1179	/* top is already set - we should only get here if
1154	* middle is not set	1180	* middle is not set
1155	*	1181	*
1156	* Set the middle face and break out, since there is nothing	1182	* Set the middle face and break out, since there is nothing
1157	* more to fill in. We don't check visiblity here, since	1183	* more to fill in. We don't check visiblity here, since
1158	*	1184	*
1159	*/	1185	*/
1160	if (tmp != top)	1186	if (tmp != top)
1161	{	1187	{
1162	middle = tmp;	1188	middle = tmp;
1163	break;	1189	break;
…		…
1170	middle = 0;	1196	middle = 0;
1171		1197
1172	if (top == middle)	1198	if (top == middle)
1173	middle = 0;	1199	middle = 0;
1174		1200
		1201	// set lower map transparent floor flag if applicable
		1202	if (floor && floor->flag [FLAG_IS_TRANSPARENT_FLOOR] && !middle && !top)
		1203	{
		1204	floor->set_anim_frame (0);
		1205
		1206	if (maptile *m = floor->map->tile_map [TILE_DOWN])
		1207	{
		1208	mapspace &ms = m->at (floor->x, floor->y);
		1209	ms.update ();
		1210
		1211	if (object *floor2 = ms.faces_obj [2])
		1212	if (!floor2->flag [FLAG_IS_TRANSPARENT_FLOOR])
		1213	{
		1214	floor->set_anim_frame (1);
		1215	top = floor;
		1216	middle = ms.faces_obj [0];
		1217	floor = floor2;
		1218	}
		1219
		1220	ms.pflags \|= PF_VIS_UP;
		1221	}
		1222	}
		1223
1175	#if 0	1224	#if 0
1176	faces_obj [0] = top;	1225	faces_obj [0] = top;
1177	faces_obj [1] = middle;	1226	faces_obj [1] = middle;
1178	faces_obj [2] = floor;	1227	faces_obj [2] = floor;
1179	#endif	1228	#endif
1180	}	1229	}
1181		1230
		1231	void
		1232	mapspace::update_up ()
		1233	{
		1234	// invalidate up
		1235	if (!(pflags & PF_VIS_UP))
		1236	return;
		1237
		1238	pflags &= ~PF_VIS_UP;
		1239
		1240	if (bot)
		1241	if (maptile *m = bot->map->tile_map [TILE_UP])
		1242	m->at (bot->x, bot->y).invalidate ();
		1243	}
		1244
1182	maptile *	1245	maptile *
1183	maptile::tile_available (int dir, bool load)	1246	maptile::tile_available (int dir, bool load)
1184	{	1247	{
		1248	// map is there and we don't need to load it OR it's loaded => return what we have
		1249	if (tile_map [dir] && (!load \|\| tile_map [dir]->linkable ()))
		1250	return tile_map [dir];
		1251
1185	if (tile_path[dir])	1252	if (tile_path [dir])
1186	{	1253	{
1187	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))	1254	// well, try to locate it then, if possible - maybe it's there already
		1255	// this is the ONLY place in the server that links maps with each other,
		1256	// so any kind of inter-map stuff has to be initiated here.
		1257	if (maptile *m = find_async (tile_path [dir], this, load))
		1258	{
		1259	bool mismatch = false;
		1260
		1261	if (dir == TILE_NORTH \|\| dir == TILE_SOUTH \|\| dir == TILE_UP \|\| dir == TILE_DOWN)
		1262	if (width != m->width)
		1263	mismatch = true;
		1264
		1265	if (dir == TILE_EAST \|\| dir == TILE_WEST \|\| dir == TILE_UP \|\| dir == TILE_DOWN)
		1266	if (height != m->height)
		1267	mismatch = true;
		1268
		1269	if (mismatch)
		1270	{
		1271	LOG (llevError, "tile dimension mismatch for direction %d from %s to %s\n",
		1272	dir, &path, &m->path);
		1273	m = 0;
		1274	}
		1275	else if (0)//D
		1276	{
		1277	// as an optimisation, link us against the other map if the other map
		1278	// has us as neighbour, which is very common, but not guaranteed.
		1279	int dir2 = REVERSE_TILE_DIR (dir);
		1280
		1281	if (m->tile_path [dir2] == path)
		1282	m->tile_map [dir2] = this;
		1283	}
		1284
		1285
1188	return tile_map[dir];	1286	return tile_map [dir] = m;
1189		1287	}
1190	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1191	return tile_map[dir];
1192	}	1288	}
1193		1289
1194	return 0;	1290	return 0;
1195	}	1291	}
1196		1292
1197	/* this returns TRUE if the coordinates (x,y) are out of	1293	/* this returns TRUE if the coordinates (x,y) are out of
1198	* map m. This function also takes into account any	1294	* map m. This function also takes into account any
1199	* tiling considerations, loading adjacant maps as needed.	1295	* tiling considerations, loading adjacant maps as needed.
1200	* This is the function should always be used when it	1296	* This is the function should always be used when it
1201	* necessary to check for valid coordinates.	1297	* necessary to check for valid coordinates.
1202	* This function will recursively call itself for the	1298	* This function will recursively call itself for the
1203	* tiled maps.	1299	* tiled maps.
1204	*/	1300	*/
1205	int	1301	int
1206	out_of_map (maptile *m, int x, int y)	1302	out_of_map (maptile *m, int x, int y)
1207	{	1303	{
…		…
1212	if (!m)	1308	if (!m)
1213	return 0;	1309	return 0;
1214		1310
1215	if (x < 0)	1311	if (x < 0)
1216	{	1312	{
1217	if (!m->tile_available (3))	1313	if (!m->tile_available (TILE_WEST))
1218	return 1;	1314	return 1;
1219		1315
1220	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1316	return out_of_map (m->tile_map [TILE_WEST], x + m->tile_map [TILE_WEST]->width, y);
1221	}	1317	}
1222		1318
1223	if (x >= m->width)	1319	if (x >= m->width)
1224	{	1320	{
1225	if (!m->tile_available (1))	1321	if (!m->tile_available (TILE_EAST))
1226	return 1;	1322	return 1;
1227		1323
1228	return out_of_map (m->tile_map[1], x - m->width, y);	1324	return out_of_map (m->tile_map [TILE_EAST], x - m->width, y);
1229	}	1325	}
1230		1326
1231	if (y < 0)	1327	if (y < 0)
1232	{	1328	{
1233	if (!m->tile_available (0))	1329	if (!m->tile_available (TILE_NORTH))
1234	return 1;	1330	return 1;
1235		1331
1236	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1332	return out_of_map (m->tile_map [TILE_NORTH], x, y + m->tile_map [TILE_NORTH]->height);
1237	}	1333	}
1238		1334
1239	if (y >= m->height)	1335	if (y >= m->height)
1240	{	1336	{
1241	if (!m->tile_available (2))	1337	if (!m->tile_available (TILE_SOUTH))
1242	return 1;	1338	return 1;
1243		1339
1244	return out_of_map (m->tile_map[2], x, y - m->height);	1340	return out_of_map (m->tile_map [TILE_SOUTH], x, y - m->height);
1245	}	1341	}
1246		1342
1247	/* Simple case - coordinates are within this local	1343	/* Simple case - coordinates are within this local
1248	* map.	1344	* map.
1249	*/	1345	*/
…		…
1251	}	1347	}
1252		1348
1253	/* This is basically the same as out_of_map above, but	1349	/* This is basically the same as out_of_map above, but
1254	* instead we return NULL if no map is valid (coordinates	1350	* instead we return NULL if no map is valid (coordinates
1255	* out of bounds and no tiled map), otherwise it returns	1351	* out of bounds and no tiled map), otherwise it returns
1256	* the map as that the coordinates are really on, and	1352	* the map as that the coordinates are really on, and
1257	* updates x and y to be the localised coordinates.	1353	* updates x and y to be the localised coordinates.
1258	* Using this is more efficient of calling out_of_map	1354	* Using this is more efficient of calling out_of_map
1259	* and then figuring out what the real map is	1355	* and then figuring out what the real map is
1260	*/	1356	*/
1261	maptile *	1357	maptile *
1262	maptile::xy_find (sint16 &x, sint16 &y)	1358	maptile::xy_find (sint16 &x, sint16 &y)
1263	{	1359	{
1264	if (x < 0)	1360	if (x < 0)
1265	{	1361	{
1266	if (!tile_available (3))	1362	if (!tile_available (TILE_WEST))
1267	return 0;	1363	return 0;
1268		1364
1269	x += tile_map[3]->width;	1365	x += tile_map [TILE_WEST]->width;
1270	return tile_map[3]->xy_find (x, y);	1366	return tile_map [TILE_WEST]->xy_find (x, y);
1271	}	1367	}
1272		1368
1273	if (x >= width)	1369	if (x >= width)
1274	{	1370	{
1275	if (!tile_available (1))	1371	if (!tile_available (TILE_EAST))
1276	return 0;	1372	return 0;
1277		1373
1278	x -= width;	1374	x -= width;
1279	return tile_map[1]->xy_find (x, y);	1375	return tile_map [TILE_EAST]->xy_find (x, y);
1280	}	1376	}
1281		1377
1282	if (y < 0)	1378	if (y < 0)
1283	{	1379	{
1284	if (!tile_available (0))	1380	if (!tile_available (TILE_NORTH))
1285	return 0;	1381	return 0;
1286		1382
1287	y += tile_map[0]->height;	1383	y += tile_map [TILE_NORTH]->height;
1288	return tile_map[0]->xy_find (x, y);	1384	return tile_map [TILE_NORTH]->xy_find (x, y);
1289	}	1385	}
1290		1386
1291	if (y >= height)	1387	if (y >= height)
1292	{	1388	{
1293	if (!tile_available (2))	1389	if (!tile_available (TILE_SOUTH))
1294	return 0;	1390	return 0;
1295		1391
1296	y -= height;	1392	y -= height;
1297	return tile_map[2]->xy_find (x, y);	1393	return tile_map [TILE_SOUTH]->xy_find (x, y);
1298	}	1394	}
1299		1395
1300	/* Simple case - coordinates are within this local	1396	/* Simple case - coordinates are within this local
1301	* map.	1397	* map.
1302	*/	1398	*/
…		…
1306	/**	1402	/**
1307	* Return whether map2 is adjacent to map1. If so, store the distance from	1403	* Return whether map2 is adjacent to map1. If so, store the distance from
1308	* map1 to map2 in dx/dy.	1404	* map1 to map2 in dx/dy.
1309	*/	1405	*/
1310	int	1406	int
1311	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1407	adjacent_map (maptile map1, maptile map2, int dx, int dy)
1312	{	1408	{
1313	if (!map1 \|\| !map2)	1409	if (!map1 \|\| !map2)
1314	return 0;	1410	return 0;
1315		1411
1316	//TODO: this doesn't actually check correctly when intermediate maps are not loaded	1412	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
…		…
1318	if (map1 == map2)	1414	if (map1 == map2)
1319	{	1415	{
1320	*dx = 0;	1416	*dx = 0;
1321	*dy = 0;	1417	*dy = 0;
1322	}	1418	}
1323	else if (map1->tile_map[0] == map2)	1419	else if (map1->tile_available (TILE_NORTH, false) == map2)
1324	{ /* up */	1420	{
1325	*dx = 0;	1421	*dx = 0;
1326	*dy = -map2->height;	1422	*dy = -map2->height;
1327	}	1423	}
1328	else if (map1->tile_map[1] == map2)	1424	else if (map1->tile_available (TILE_EAST , false) == map2)
1329	{ /* right */	1425	{
1330	*dx = map1->width;	1426	*dx = map1->width;
1331	*dy = 0;	1427	*dy = 0;
1332	}	1428	}
1333	else if (map1->tile_map[2] == map2)	1429	else if (map1->tile_available (TILE_SOUTH, false) == map2)
1334	{ /* down */	1430	{
1335	*dx = 0;	1431	*dx = 0;
1336	*dy = map1->height;	1432	*dy = map1->height;
1337	}	1433	}
1338	else if (map1->tile_map[3] == map2)	1434	else if (map1->tile_available (TILE_WEST , false) == map2)
1339	{ /* left */	1435	{
1340	*dx = -map2->width;	1436	*dx = -map2->width;
1341	*dy = 0;	1437	*dy = 0;
1342	}	1438	}
1343	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	1439	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1344	{ /* up right */	1440	{ /* up right */
1345	*dx = map1->tile_map[0]->width;	1441	*dx = +map1->tile_map[TILE_NORTH]->width;
1346	*dy = -map1->tile_map[0]->height;	1442	*dy = -map1->tile_map[TILE_NORTH]->height;
1347	}	1443	}
1348	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	1444	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1349	{ /* up left */	1445	{ /* up left */
1350	*dx = -map2->width;	1446	*dx = -map2->width;
1351	*dy = -map1->tile_map[0]->height;	1447	*dy = -map1->tile_map[TILE_NORTH]->height;
1352	}	1448	}
1353	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	1449	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1354	{ /* right up */	1450	{ /* right up */
1355	*dx = map1->width;	1451	*dx = +map1->width;
1356	*dy = -map2->height;	1452	*dy = -map2->height;
1357	}	1453	}
1358	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	1454	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1359	{ /* right down */	1455	{ /* right down */
1360	*dx = map1->width;	1456	*dx = +map1->width;
1361	*dy = map1->tile_map[1]->height;	1457	*dy = +map1->tile_map[TILE_EAST]->height;
1362	}	1458	}
1363	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	1459	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1364	{ /* down right */	1460	{ /* down right */
1365	*dx = map1->tile_map[2]->width;	1461	*dx = +map1->tile_map[TILE_SOUTH]->width;
1366	*dy = map1->height;	1462	*dy = +map1->height;
1367	}	1463	}
1368	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	1464	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1369	{ /* down left */	1465	{ /* down left */
1370	*dx = -map2->width;	1466	*dx = -map2->width;
1371	*dy = map1->height;	1467	*dy = +map1->height;
1372	}	1468	}
1373	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	1469	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1374	{ /* left up */	1470	{ /* left up */
1375	*dx = -map1->tile_map[3]->width;	1471	*dx = -map1->tile_map[TILE_WEST]->width;
1376	*dy = -map2->height;	1472	*dy = -map2->height;
1377	}	1473	}
1378	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	1474	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1379	{ /* left down */	1475	{ /* left down */
1380	*dx = -map1->tile_map[3]->width;	1476	*dx = -map1->tile_map[TILE_WEST]->width;
1381	*dy = map1->tile_map[3]->height;	1477	*dy = +map1->tile_map[TILE_WEST]->height;
1382	}	1478	}
1383	else	1479	else
1384	return 0;	1480	return 0;
1385		1481
1386	return 1;	1482	return 1;
…		…
1409	* so you just can not look the the map coordinates and get the	1505	* so you just can not look the the map coordinates and get the
1410	* righte value. distance_x/y are distance away, which	1506	* righte value. distance_x/y are distance away, which
1411	* can be negative. direction is the crossfire direction scheme	1507	* can be negative. direction is the crossfire direction scheme
1412	* that the creature should head. part is the part of the	1508	* that the creature should head. part is the part of the
1413	* monster that is closest.	1509	* monster that is closest.
1414	*	1510	*
1415	* get_rangevector looks at op1 and op2, and fills in the	1511	* get_rangevector looks at op1 and op2, and fills in the
1416	* structure for op1 to get to op2.	1512	* structure for op1 to get to op2.
1417	* We already trust that the caller has verified that the	1513	* We already trust that the caller has verified that the
1418	* two objects are at least on adjacent maps. If not,	1514	* two objects are at least on adjacent maps. If not,
1419	* results are not likely to be what is desired.	1515	* results are not likely to be what is desired.
…		…
1422	*	1518	*
1423	* currently, the only flag supported (0x1) is don't translate for	1519	* currently, the only flag supported (0x1) is don't translate for
1424	* closest body part of 'op1'	1520	* closest body part of 'op1'
1425	*/	1521	*/
1426	void	1522	void
1427	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1523	get_rangevector (object op1, object op2, rv_vector *retval, int flags)
1428	{	1524	{
1429	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1525	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1430	{	1526	{
1431	/* be conservative and fill in _some_ data */	1527	/* be conservative and fill in _some_ data */
1432	retval->distance = 10000;	1528	retval->distance = 10000;
1433	retval->distance_x = 10000;	1529	retval->distance_x = 10000;
1434	retval->distance_y = 10000;	1530	retval->distance_y = 10000;
1435	retval->direction = 0;	1531	retval->direction = 0;
1436	retval->part = 0;	1532	retval->part = 0;
1437	}	1533	}
1438	else	1534	else
1439	{	1535	{
1440	object *best;
1441
1442	retval->distance_x += op2->x - op1->x;	1536	retval->distance_x += op2->x - op1->x;
1443	retval->distance_y += op2->y - op1->y;	1537	retval->distance_y += op2->y - op1->y;
1444		1538
1445	best = op1;	1539	object *best = op1;
		1540
1446	/* If this is multipart, find the closest part now */	1541	/* If this is multipart, find the closest part now */
1447	if (!(flags & 0x1) && op1->more)	1542	if (!(flags & 1) && op1->more)
1448	{	1543	{
1449	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1544	int best_distance = idistance (retval->distance_x, retval->distance_y);
1450		1545
1451	/* 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
1452	* distance instead of doing all that work above again	1547	* distance instead of doing all that work above again
1453	* since the distance fields we set above are positive in the	1548	* since the distance fields we set above are positive in the
1454	* same axis as is used for multipart objects, the simply arithmetic	1549	* same axis as is used for multipart objects, the simply arithmetic
1455	* below works.	1550	* below works.
1456	*/	1551	*/
1457	for (object *tmp = op1->more; tmp; tmp = tmp->more)	1552	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1458	{	1553	{
1459	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1554	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1460	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1555
1461	if (tmpi < best_distance)	1556	if (tmpi < best_distance)
1462	{	1557	{
1463	best_distance = tmpi;	1558	best_distance = tmpi;
1464	best = tmp;	1559	best = tmp;
1465	}	1560	}
1466	}	1561	}
1467		1562
1468	if (best != op1)	1563	if (best != op1)
1469	{	1564	{
1470	retval->distance_x += op1->x - best->x;	1565	retval->distance_x += op1->x - best->x;
1471	retval->distance_y += op1->y - best->y;	1566	retval->distance_y += op1->y - best->y;
1472	}	1567	}
1473	}	1568	}
1474		1569
1475	retval->part = best;	1570	retval->part = best;
1476	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1571	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1477	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1572	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1478	}	1573	}
1479	}	1574	}
1480		1575
1481	/* 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
1482	* the first parameter being an object, it instead is the map	1577	* the first parameter being an object, it instead is the map
1483	* and x,y coordinates - this is used for path to player -	1578	* and x,y coordinates - this is used for path to player -
1484	* since the object is not infact moving but we are trying to traverse	1579	* since the object is not infact moving but we are trying to traverse
1485	* the path, we need this.	1580	* the path, we need this.
1486	* 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
1487	* 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
1488	* 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
1489	* field of the rv_vector is set to NULL.	1584	* field of the rv_vector is set to NULL.
1490	*/	1585	*/
1491	void	1586	void
1492	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)	1587	get_rangevector_from_mapcoord (maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1493	{	1588	{
1494	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))
1495	{	1590	{
1496	/* be conservative and fill in _some_ data */	1591	/* be conservative and fill in _some_ data */
1497	retval->distance = 100000;	1592	retval->distance = 100000;
1498	retval->distance_x = 32767;	1593	retval->distance_x = 32767;
1499	retval->distance_y = 32767;	1594	retval->distance_y = 32767;
1500	retval->direction = 0;	1595	retval->direction = 0;
1501	retval->part = 0;	1596	retval->part = 0;
1502	}	1597	}
1503	else	1598	else
1504	{	1599	{
1505	retval->distance_x += op2->x - x;	1600	retval->distance_x += op2->x - x;
1506	retval->distance_y += op2->y - y;	1601	retval->distance_y += op2->y - y;
1507		1602
1508	retval->part = 0;	1603	retval->part = 0;
1509	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1604	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1510	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1605	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1511	}	1606	}
1512	}	1607	}
1513		1608
1514	/* 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
1515	* (as related to map tiling). Note that this looks for a path from	1610	* (as related to map tiling). Note that this looks for a path from
…		…
1565	*/	1660	*/
1566	for (int i = 1000; --i;)	1661	for (int i = 1000; --i;)
1567	{	1662	{
1568	object *pick = at (gen (width), gen (height)).bot;	1663	object *pick = at (gen (width), gen (height)).bot;
1569		1664
1570	// do not prefer big monsters just because they are big.	1665	// must be head: do not prefer big monsters just because they are big.
1571	if (pick && pick->is_head ())	1666	if (pick && pick->is_head ())
1572	return pick->head_ ();	1667	return pick;
1573	}	1668	}
1574		1669
1575	// instead of crashing in the unlikely(?) case, try to return something	1670	// instead of crashing in the unlikely(?) case, try to return something
1576	return archetype::find (shstr_bug);	1671	return archetype::find (shstr_bug);
1577	}	1672	}
…		…
1611	if (distance <= MAX_SOUND_DISTANCE)	1706	if (distance <= MAX_SOUND_DISTANCE)
1612	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);	1707	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
1613	}	1708	}
1614	}	1709	}
1615		1710
		1711	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1712
1616	static void	1713	static void
1617	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)	1714	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1618	{	1715	{
1619	// clip to map to the left	1716	// clip to map to the left
1620	if (x0 < 0)	1717	if (x0 < 0)
1621	{	1718	{
1622	if (maptile *tile = m->tile_available (TILE_LEFT, 1))	1719	if (maptile *tile = m->tile_available (TILE_WEST, 1))
1623	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);	1720	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1624		1721
1625	if (x1 < 0) // entirely to the left	1722	if (x1 < 0) // entirely to the left
1626	return;	1723	return;
1627		1724
…		…
1629	}	1726	}
1630		1727
1631	// clip to map to the right	1728	// clip to map to the right
1632	if (x1 > m->width)	1729	if (x1 > m->width)
1633	{	1730	{
1634	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))	1731	if (maptile *tile = m->tile_available (TILE_EAST, 1))
1635	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);	1732	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1636		1733
1637	if (x0 > m->width) // entirely to the right	1734	if (x0 >= m->width) // entirely to the right
1638	return;	1735	return;
1639		1736
1640	x1 = m->width;	1737	x1 = m->width;
1641	}	1738	}
1642		1739
1643	// clip to map above	1740	// clip to map to the north
1644	if (y0 < 0)	1741	if (y0 < 0)
1645	{	1742	{
1646	if (maptile *tile = m->tile_available (TILE_UP, 1))	1743	if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1647	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);	1744	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1648		1745
1649	if (y1 < 0) // entirely above	1746	if (y1 < 0) // entirely to the north
1650	return;	1747	return;
1651		1748
1652	y0 = 0;	1749	y0 = 0;
1653	}	1750	}
1654		1751
1655	// clip to map below	1752	// clip to map to the south
1656	if (y1 > m->height)	1753	if (y1 > m->height)
1657	{	1754	{
1658	if (maptile *tile = m->tile_available (TILE_DOWN, 1))	1755	if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1659	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);	1756	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1660		1757
1661	if (y0 > m->height) // entirely below	1758	if (y0 >= m->height) // entirely to the south
1662	return;	1759	return;
1663		1760
1664	y1 = m->height;	1761	y1 = m->height;
1665	}	1762	}
1666		1763
…		…
1675	r->dx = dx;	1772	r->dx = dx;
1676	r->dy = dy;	1773	r->dy = dy;
1677	}	1774	}
1678		1775
1679	maprect *	1776	maprect *
1680	maptile::split_to_tiles (int x0, int y0, int x1, int y1)	1777	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1681	{	1778	{
1682	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1683	buf.clear ();	1779	buf.clear ();
1684		1780
1685	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);	1781	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1686		1782
1687	// add end marker	1783	// add end marker

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.178 by root, Sun Nov 29 09:41:27 2009 UTC vs. Revision 1.223 by root, Wed Dec 5 19:03:26 2018 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.178 by root, Sun Nov 29 09:41:27 2009 UTC vs.
Revision 1.223 by root, Wed Dec 5 19:03:26 2018 UTC