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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.222 by root, Wed Apr 30 05:06:36 2008 UTC vs.
Revision 1.284 by root, Sat Jun 27 08:35:03 2009 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
32	#include <bitset>	32	#include <bitset>
33		33
34	UUID UUID::cur;	34	UUID UUID::cur;
35	static uint64_t seq_next_save;	35	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
		37	uint32_t mapspace::smellcount = 10000;
37		38
38	objectvec objects;	39	objectvec objects;
39	activevec actives;	40	activevec actives;
40		41
41	short freearr_x[SIZEOFFREE] = {	42	short freearr_x[SIZEOFFREE] = {
…		…
139		140
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	141	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	142	static bool
142	compare_ob_value_lists_one (const object wants, const object has)	143	compare_ob_value_lists_one (const object wants, const object has)
143	{	144	{
144	key_value *wants_field;
145
146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	145	/* n-squared behaviour (see kv_get), but I'm hoping both
147	* objects with lists are rare, and lists stay short. If not, use a	146	* objects with lists are rare, and lists stay short. If not, use a
148	* different structure or at least keep the lists sorted...	147	* different structure or at least keep the lists sorted...
149	*/	148	*/
150		149
151	/* For each field in wants, */	150	/* For each field in wants, */
152	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	151	for (key_value *kv = wants->key_values; kv; kv = kv->next)
153	{	152	if (has->kv_get (kv->key) != kv->value)
154	key_value *has_field;	153	return false;
155
156	/* Look for a field in has with the same key. */
157	has_field = get_ob_key_link (has, wants_field->key);
158
159	if (!has_field)
160	return 0; /* No field with that name. */
161
162	/* Found the matching field. */
163	if (has_field->value != wants_field->value)
164	return 0; /* Values don't match, so this half of the comparison is false. */
165
166	/* If we get here, we found a match. Now for the next field in wants. */
167	}
168		154
169	/* If we get here, every field in wants has a matching field in has. */	155	/* If we get here, every field in wants has a matching field in has. */
170	return 1;	156	return true;
171	}	157	}
172		158
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	159	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static bool	160	static bool
175	compare_ob_value_lists (const object ob1, const object ob2)	161	compare_ob_value_lists (const object ob1, const object ob2)
176	{	162	{
177	/* However, there may be fields in has which aren't partnered in wants,	163	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison twice. :(	164	* so we need to run the comparison twice. :(
179	*/	165	*/
180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	166	return compare_ob_value_lists_one (ob1, ob2)
		167	&& compare_ob_value_lists_one (ob2, ob1);
181	}	168	}
182		169
183	/* Function examines the 2 objects given to it, and returns true if	170	/* Function examines the 2 objects given to it, and returns true if
184	* they can be merged together.	171	* they can be merged together.
185	*	172	*
…		…
200	\|\| ob1->speed != ob2->speed	187	\|\| ob1->speed != ob2->speed
201	\|\| ob1->value != ob2->value	188	\|\| ob1->value != ob2->value
202	\|\| ob1->name != ob2->name)	189	\|\| ob1->name != ob2->name)
203	return 0;	190	return 0;
204		191
205	/* Do not merge objects if nrof would overflow. First part checks	192	/* Do not merge objects if nrof would overflow, assume nrof
206	* for unsigned overflow (2c), second part checks whether the result	193	* is always 0 .. 2*31-1 /
207	* would fit into a 32 bit signed int, which is often used to hold	194	if (ob1->nrof > 0x7fffffff - ob2->nrof)
208	* nrof values.
209	*/
210	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
211	return 0;	195	return 0;
212		196
213	/* If the objects have been identified, set the BEEN_APPLIED flag.	197	/* If the objects have been identified, set the BEEN_APPLIED flag.
214	* This is to the comparison of the flags below will be OK. We	198	* This is to the comparison of the flags below will be OK. We
215	* just can't ignore the been applied or identified flags, as they	199	* just can't ignore the been applied or identified flags, as they
…		…
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	204	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		205
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	206	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	207	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		208
225	if (ob1->arch->name != ob2->arch->name	209	if (ob1->arch->archname != ob2->arch->archname
226	\|\| ob1->name != ob2->name	210	\|\| ob1->name != ob2->name
227	\|\| ob1->title != ob2->title	211	\|\| ob1->title != ob2->title
228	\|\| ob1->msg != ob2->msg	212	\|\| ob1->msg != ob2->msg
229	\|\| ob1->weight != ob2->weight	213	\|\| ob1->weight != ob2->weight
230	\|\| ob1->attacktype != ob2->attacktype	214	\|\| ob1->attacktype != ob2->attacktype
231	\|\| ob1->magic != ob2->magic	215	\|\| ob1->magic != ob2->magic
232	\|\| ob1->slaying != ob2->slaying	216	\|\| ob1->slaying != ob2->slaying
233	\|\| ob1->skill != ob2->skill	217	\|\| ob1->skill != ob2->skill
234	\|\| ob1->value != ob2->value	218	\|\| ob1->value != ob2->value
235	\|\| ob1->animation_id != ob2->animation_id	219	\|\| ob1->animation_id != ob2->animation_id
		220	\|\| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
236	\|\| ob1->client_type != ob2->client_type	221	\|\| ob1->client_type != ob2->client_type
237	\|\| ob1->materialname != ob2->materialname	222	\|\| ob1->materialname != ob2->materialname
238	\|\| ob1->lore != ob2->lore	223	\|\| ob1->lore != ob2->lore
239	\|\| ob1->subtype != ob2->subtype	224	\|\| ob1->subtype != ob2->subtype
240	\|\| ob1->move_type != ob2->move_type	225	\|\| ob1->move_type != ob2->move_type
…		…
248	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	233	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
249	return 0;	234	return 0;
250		235
251	if ((ob1->flag ^ ob2->flag)	236	if ((ob1->flag ^ ob2->flag)
252	.reset (FLAG_INV_LOCKED)	237	.reset (FLAG_INV_LOCKED)
253	.reset (FLAG_CLIENT_SENT)
254	.reset (FLAG_REMOVED)	238	.reset (FLAG_REMOVED)
255	.any ())	239	.any ())
256	return 0;	240	return 0;
257		241
258	/* This is really a spellbook check - we should in general	242	/* This is really a spellbook check - we should in general
…		…
340	{	324	{
341	// see if we are in a container of sorts	325	// see if we are in a container of sorts
342	if (env)	326	if (env)
343	{	327	{
344	// the player inventory itself is always visible	328	// the player inventory itself is always visible
345	if (env->type == PLAYER)	329	if (env->is_player ())
346	return env;	330	return env;
347		331
348	// else a player could have our env open	332	// else a player could have our env open
349	object *envest = env->outer_env ();	333	object *envest = env->outer_env ();
350		334
…		…
358	else	342	else
359	{	343	{
360	// maybe there is a player standing on the same mapspace	344	// maybe there is a player standing on the same mapspace
361	// this will catch the case where "this" is a player	345	// this will catch the case where "this" is a player
362	if (object *pl = ms ().player ())	346	if (object *pl = ms ().player ())
		347	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
363	if (!pl->container \|\| this == pl->container)	348	\|\| this == pl->container)
364	return pl;	349	return pl;
365	}	350	}
366	}	351	}
367		352
368	return 0;	353	return 0;
369	}	354	}
370		355
371	// adjust weight per container type ("of holding")	356	// adjust weight per container type ("of holding")
372	static sint32	357	static sint32
373	weight_adjust (object *op, sint32 weight)	358	weight_adjust_for (object *op, sint32 weight)
374	{	359	{
375	return op->type == CONTAINER	360	return op->type == CONTAINER
376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	361	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377	: weight;	362	: weight;
378	}	363	}
…		…
384	static void	369	static void
385	adjust_weight (object *op, sint32 weight)	370	adjust_weight (object *op, sint32 weight)
386	{	371	{
387	while (op)	372	while (op)
388	{	373	{
		374	// adjust by actual difference to account for rounding errors
		375	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
389	weight = weight_adjust (op, weight);	376	weight = weight_adjust_for (op, op->carrying)
		377	- weight_adjust_for (op, op->carrying - weight);
390		378
391	if (!weight)	379	if (!weight)
392	return;	380	return;
393		381
394	op->carrying += weight;	382	op->carrying += weight;
…		…
417	op->update_weight ();	405	op->update_weight ();
418		406
419	sum += op->total_weight ();	407	sum += op->total_weight ();
420	}	408	}
421		409
422	sum = weight_adjust (this, sum);	410	sum = weight_adjust_for (this, sum);
423		411
424	if (sum != carrying)	412	if (sum != carrying)
425	{	413	{
426	carrying = sum;	414	carrying = sum;
427		415
…		…
489	*/	477	*/
490	object *	478	object *
491	find_object_name (const char *str)	479	find_object_name (const char *str)
492	{	480	{
493	shstr_cmp str_ (str);	481	shstr_cmp str_ (str);
494	object *op;
495		482
		483	if (str_)
496	for_all_objects (op)	484	for_all_objects (op)
497	if (op->name == str_)	485	if (op->name == str_)
498	break;	486	return op;
499		487
500	return op;	488	return 0;
501	}	489	}
502		490
503	/*	491	/*
504	* Sets the owner and sets the skill and exp pointers to owner's current	492	* Sets the owner and sets the skill and exp pointers to owner's current
505	* skill and experience objects.	493	* skill and experience objects.
…		…
603	}	591	}
604		592
605	op->key_values = 0;	593	op->key_values = 0;
606	}	594	}
607		595
608	object &	596	/*
609	object::operator =(const object &src)	597	* copy_to first frees everything allocated by the dst object,
		598	* and then copies the contents of itself into the second
		599	* object, allocating what needs to be allocated. Basically, any
		600	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		601	* if the first object is freed, the pointers in the new object
		602	* will point at garbage.
		603	*/
		604	void
		605	object::copy_to (object *dst)
610	{	606	{
611	bool is_freed = flag [FLAG_FREED];	607	dst->remove ();
612	bool is_removed = flag [FLAG_REMOVED];
613
614	(object_copy )this = src;	608	(object_copy )dst = *this;
615
616	flag [FLAG_FREED] = is_freed;
617	flag [FLAG_REMOVED] = is_removed;	609	dst->flag [FLAG_REMOVED] = true;
618		610
619	/* Copy over key_values, if any. */	611	/* Copy over key_values, if any. */
620	if (src.key_values)	612	if (key_values)
621	{	613	{
622	key_value *tail = 0;	614	key_value *tail = 0;
623	key_values = 0;	615	dst->key_values = 0;
624		616
625	for (key_value *i = src.key_values; i; i = i->next)	617	for (key_value *i = key_values; i; i = i->next)
626	{	618	{
627	key_value *new_link = new key_value;	619	key_value *new_link = new key_value;
628		620
629	new_link->next = 0;	621	new_link->next = 0;
630	new_link->key = i->key;	622	new_link->key = i->key;
631	new_link->value = i->value;	623	new_link->value = i->value;
632		624
633	/* Try and be clever here, too. */	625	/* Try and be clever here, too. */
634	if (!key_values)	626	if (!dst->key_values)
635	{	627	{
636	key_values = new_link;	628	dst->key_values = new_link;
637	tail = new_link;	629	tail = new_link;
638	}	630	}
639	else	631	else
640	{	632	{
641	tail->next = new_link;	633	tail->next = new_link;
642	tail = new_link;	634	tail = new_link;
643	}	635	}
644	}	636	}
645	}	637	}
646	}
647
648	/*
649	* copy_to first frees everything allocated by the dst object,
650	* and then copies the contents of itself into the second
651	* object, allocating what needs to be allocated. Basically, any
652	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
653	* if the first object is freed, the pointers in the new object
654	* will point at garbage.
655	*/
656	void
657	object::copy_to (object *dst)
658	{
659	dst = this;
660		638
661	if (speed < 0)	639	if (speed < 0)
662	dst->speed_left -= rndm ();	640	dst->speed_left -= rndm ();
663		641
664	dst->set_speed (dst->speed);	642	dst->activate ();
665	}	643	}
666		644
667	void	645	void
668	object::instantiate ()	646	object::instantiate ()
669	{	647	{
…		…
686	object *	664	object *
687	object::clone ()	665	object::clone ()
688	{	666	{
689	object *neu = create ();	667	object *neu = create ();
690	copy_to (neu);	668	copy_to (neu);
		669	neu->map = map; // not copied by copy_to
691	return neu;	670	return neu;
692	}	671	}
693		672
694	/*	673	/*
695	* If an object with the IS_TURNABLE() flag needs to be turned due	674	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
780	else if (action == UP_OBJ_INSERT)	759	else if (action == UP_OBJ_INSERT)
781	{	760	{
782	// this is likely overkill, TODO: revisit (schmorp)	761	// this is likely overkill, TODO: revisit (schmorp)
783	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	762	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
784	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	763	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
785	\|\| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	764	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
786	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	765	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
787	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	766	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
788	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	767	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
789	\|\| (m.move_on \| op->move_on ) != m.move_on	768	\|\| (m.move_on \| op->move_on ) != m.move_on
790	\|\| (m.move_off \| op->move_off ) != m.move_off	769	\|\| (m.move_off \| op->move_off ) != m.move_off
791	\|\| (m.move_slow \| op->move_slow) != m.move_slow	770	\|\| (m.move_slow \| op->move_slow) != m.move_slow
792	/* This isn't perfect, but I don't expect a lot of objects to	771	/* This isn't perfect, but I don't expect a lot of objects to
793	* to have move_allow right now.	772	* have move_allow right now.
794	*/	773	*/
795	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	774	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
796	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	775	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
797	m.flags_ = 0;	776	m.invalidate ();
798	}	777	}
799	/* if the object is being removed, we can't make intelligent	778	/* if the object is being removed, we can't make intelligent
800	* decisions, because remove_ob can't really pass the object	779	* decisions, because remove_ob can't really pass the object
801	* that is being removed.	780	* that is being removed.
802	*/	781	*/
803	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	782	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
804	m.flags_ = 0;	783	m.invalidate ();
805	else if (action == UP_OBJ_FACE)	784	else if (action == UP_OBJ_FACE)
806	/* Nothing to do for that case */ ;	785	/* Nothing to do for that case */ ;
807	else	786	else
808	LOG (llevError, "update_object called with invalid action: %d\n", action);	787	LOG (llevError, "update_object called with invalid action: %d\n", action);
809		788
…		…
813		792
814	object::object ()	793	object::object ()
815	{	794	{
816	SET_FLAG (this, FLAG_REMOVED);	795	SET_FLAG (this, FLAG_REMOVED);
817		796
818	expmul = 1.0;	797	//expmul = 1.0; declared const for the time being
819	face = blank_face;	798	face = blank_face;
820	}	799	}
821		800
822	object::~object ()	801	object::~object ()
823	{	802	{
…		…
851	object::activate ()	830	object::activate ()
852	{	831	{
853	/* If already on active list, don't do anything */	832	/* If already on active list, don't do anything */
854	if (active)	833	if (active)
855	return;	834	return;
		835
		836	if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		837	if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError \| logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
856		838
857	if (has_active_speed ())	839	if (has_active_speed ())
858	actives.insert (this);	840	actives.insert (this);
859	}	841	}
860		842
…		…
924	* drop on that space.	906	* drop on that space.
925	*/	907	*/
926	if (!drop_to_ground	908	if (!drop_to_ground
927	\|\| !map	909	\|\| !map
928	\|\| map->in_memory != MAP_ACTIVE	910	\|\| map->in_memory != MAP_ACTIVE
929	\|\| map->nodrop	911	\|\| map->no_drop
930	\|\| ms ().move_block == MOVE_ALL)	912	\|\| ms ().move_block == MOVE_ALL)
931	{	913	{
932	while (inv)	914	while (inv)
933	{
934	inv->destroy_inv (false);
935	inv->destroy ();	915	inv->destroy ();
936	}
937	}	916	}
938	else	917	else
939	{ /* Put objects in inventory onto this space */	918	{ /* Put objects in inventory onto this space */
940	while (inv)	919	while (inv)
941	{	920	{
…		…
945	\|\| op->flag [FLAG_NO_DROP]	924	\|\| op->flag [FLAG_NO_DROP]
946	\|\| op->type == RUNE	925	\|\| op->type == RUNE
947	\|\| op->type == TRAP	926	\|\| op->type == TRAP
948	\|\| op->flag [FLAG_IS_A_TEMPLATE]	927	\|\| op->flag [FLAG_IS_A_TEMPLATE]
949	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	928	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
950	op->destroy (true);	929	op->destroy ();
951	else	930	else
952	map->insert (op, x, y);	931	map->insert (op, x, y);
953	}	932	}
954	}	933	}
955	}	934	}
…		…
959	object *op = new object;	938	object *op = new object;
960	op->link ();	939	op->link ();
961	return op;	940	return op;
962	}	941	}
963		942
		943	static struct freed_map : maptile
		944	{
		945	freed_map ()
		946	{
		947	path = "<freed objects map>";
		948	name = "/internal/freed_objects_map";
		949	width = 3;
		950	height = 3;
		951	no_drop = 1;
		952	no_reset = 1;
		953
		954	alloc ();
		955	in_memory = MAP_ACTIVE;
		956	}
		957
		958	~freed_map ()
		959	{
		960	destroy ();
		961	}
		962	} freed_map; // freed objects are moved here to avoid crashes
		963
964	void	964	void
965	object::do_destroy ()	965	object::do_destroy ()
966	{	966	{
967	if (flag [FLAG_IS_LINKED])	967	if (flag [FLAG_IS_LINKED])
968	remove_button_link (this);	968	remove_link ();
969		969
970	if (flag [FLAG_FRIENDLY])	970	if (flag [FLAG_FRIENDLY])
971	remove_friendly_object (this);	971	remove_friendly_object (this);
972		972
973	remove ();	973	remove ();
…		…
978	unlink ();	978	unlink ();
979		979
980	flag [FLAG_FREED] = 1;	980	flag [FLAG_FREED] = 1;
981		981
982	// hack to ensure that freed objects still have a valid map	982	// hack to ensure that freed objects still have a valid map
983	{
984	static maptile *freed_map; // freed objects are moved here to avoid crashes
985
986	if (!freed_map)
987	{
988	freed_map = new maptile;
989
990	freed_map->path = "<freed objects map>";
991	freed_map->name = "/internal/freed_objects_map";
992	freed_map->width = 3;
993	freed_map->height = 3;
994	freed_map->nodrop = 1;
995
996	freed_map->alloc ();
997	freed_map->in_memory = MAP_ACTIVE;
998	}
999
1000	map = freed_map;	983	map = &freed_map;
1001	x = 1;	984	x = 1;
1002	y = 1;	985	y = 1;
1003	}
1004		986
1005	if (more)	987	if (more)
1006	{	988	{
1007	more->destroy ();	989	more->destroy ();
1008	more = 0;	990	more = 0;
…		…
1016	attacked_by = 0;	998	attacked_by = 0;
1017	current_weapon = 0;	999	current_weapon = 0;
1018	}	1000	}
1019		1001
1020	void	1002	void
1021	object::destroy (bool destroy_inventory)	1003	object::destroy ()
1022	{	1004	{
1023	if (destroyed ())	1005	if (destroyed ())
1024	return;	1006	return;
1025		1007
1026	if (!is_head () && !head->destroyed ())	1008	if (!is_head () && !head->destroyed ())
1027	{	1009	{
1028	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1029	head->destroy (destroy_inventory);	1011	head->destroy ();
		1012	return;
1030	}	1013	}
1031		1014
1032	destroy_inv (!destroy_inventory);	1015	destroy_inv (false);
1033		1016
1034	if (is_head ())	1017	if (is_head ())
1035	if (sound_destroy)	1018	if (sound_destroy)
1036	play_sound (sound_destroy);	1019	play_sound (sound_destroy);
1037	else if (flag [FLAG_MONSTER])	1020	else if (flag [FLAG_MONSTER])
…		…
1074	esrv_del_item (pl->contr, count);	1057	esrv_del_item (pl->contr, count);
1075	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1076		1059
1077	adjust_weight (env, -total_weight ());	1060	adjust_weight (env, -total_weight ());
1078		1061
1079	*(above ? &above->below : &env->inv) = below;	1062	object *pl = in_player ();
1080
1081	if (below)
1082	below->above = above;
1083		1063
1084	/* we set up values so that it could be inserted into	1064	/* we set up values so that it could be inserted into
1085	* the map, but we don't actually do that - it is up	1065	* the map, but we don't actually do that - it is up
1086	* to the caller to decide what we want to do.	1066	* to the caller to decide what we want to do.
1087	*/	1067	*/
1088	map = env->map;	1068	map = env->map;
1089	x = env->x;	1069	x = env->x;
1090	y = env->y;	1070	y = env->y;
		1071
		1072	// make sure cmov optimisation is applicable
		1073	*(above ? &above->below : &env->inv) = below;
		1074	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1075
1091	above = 0;	1076	above = 0;
1092	below = 0;	1077	below = 0;
1093	env = 0;	1078	env = 0;
1094		1079
1095	/* NO_FIX_PLAYER is set when a great many changes are being	1080	/* NO_FIX_PLAYER is set when a great many changes are being
1096	* made to players inventory. If set, avoiding the call	1081	* made to players inventory. If set, avoiding the call
1097	* to save cpu time.	1082	* to save cpu time.
1098	*/	1083	*/
1099	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1084	if (pl)
		1085	if (pl->is_player () && (glow_radius \|\| !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1086	{
1100	otmp->update_stats ();	1087	pl->update_stats ();
		1088
		1089	if (glow_radius && pl->is_on_map ())
		1090	update_all_los (pl->map, pl->x, pl->y);
		1091	}
1101	}	1092	}
1102	else if (map)	1093	else if (map)
1103	{	1094	{
1104	map->dirty = true;	1095	map->dirty = true;
1105	mapspace &ms = this->ms ();	1096	mapspace &ms = this->ms ();
1106		1097
1107	if (object *pl = ms.player ())	1098	if (object *pl = ms.player ())
1108	{	1099	{
1109	if (type == PLAYER) // this == pl(!)	1100	if (is_player ())
1110	{	1101	{
		1102	if (!flag [FLAG_WIZPASS])
		1103	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1104
1111	// leaving a spot always closes any open container on the ground	1105	// leaving a spot always closes any open container on the ground
1112	if (container && !container->env)	1106	if (container && !container->env)
1113	// this causes spurious floorbox updates, but it ensures	1107	// this causes spurious floorbox updates, but it ensures
1114	// that the CLOSE event is being sent.	1108	// that the CLOSE event is being sent.
1115	close_container ();	1109	close_container ();
…		…
1125		1119
1126	esrv_del_item (pl->contr, count);	1120	esrv_del_item (pl->contr, count);
1127	}	1121	}
1128		1122
1129	/* link the object above us */	1123	/* link the object above us */
1130	if (above)	1124	// re-link, make sure compiler can easily use cmove
1131	above->below = below;	1125	*(above ? &above->below : &ms.top) = below;
1132	else	1126	*(below ? &below->above : &ms.bot) = above;
1133	ms.top = below; /* we were top, set new top */
1134
1135	/* Relink the object below us, if there is one */
1136	if (below)
1137	below->above = above;
1138	else
1139	{
1140	/* Nothing below, which means we need to relink map object for this space
1141	* use translated coordinates in case some oddness with map tiling is
1142	* evident
1143	*/
1144	if (GET_MAP_OB (map, x, y) != this)
1145	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1146
1147	ms.bot = above; /* goes on above it. */
1148	}
1149		1127
1150	above = 0;	1128	above = 0;
1151	below = 0;	1129	below = 0;
		1130
		1131	ms.invalidate ();
1152		1132
1153	if (map->in_memory == MAP_SAVING)	1133	if (map->in_memory == MAP_SAVING)
1154	return;	1134	return;
1155		1135
1156	int check_walk_off = !flag [FLAG_NO_APPLY];	1136	int check_walk_off = !flag [FLAG_NO_APPLY];
…		…
1163	* appropriately.	1143	* appropriately.
1164	*/	1144	*/
1165	pl->close_container ();	1145	pl->close_container ();
1166		1146
1167	//TODO: the floorbox prev/next might need updating	1147	//TODO: the floorbox prev/next might need updating
1168	esrv_del_item (pl->contr, count);	1148	//esrv_del_item (pl->contr, count);
		1149	//TODO: update floorbox to preserve ordering
		1150	if (pl->contr->ns)
		1151	pl->contr->ns->floorbox_update ();
1169	}	1152	}
1170		1153
1171	for (tmp = ms.bot; tmp; tmp = tmp->above)	1154	for (tmp = ms.bot; tmp; tmp = tmp->above)
1172	{	1155	{
1173	/* No point updating the players look faces if he is the object	1156	/* No point updating the players look faces if he is the object
…		…
1186	}	1169	}
1187		1170
1188	last = tmp;	1171	last = tmp;
1189	}	1172	}
1190		1173
1191	/* last == NULL if there are no objects on this space */	1174	if (affects_los ())
1192	//TODO: this makes little sense, why only update the topmost object?
1193	if (!last)
1194	map->at (x, y).flags_ = 0;
1195	else
1196	update_object (last, UP_OBJ_REMOVE);
1197
1198	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1199	update_all_los (map, x, y);	1175	update_all_los (map, x, y);
1200	}	1176	}
1201	}	1177	}
1202		1178
1203	/*	1179	/*
…		…
1227	esrv_update_item (UPD_NROF, pl, top);	1203	esrv_update_item (UPD_NROF, pl, top);
1228		1204
1229	op->weight = 0; // cancel the addition above	1205	op->weight = 0; // cancel the addition above
1230	op->carrying = 0; // must be 0 already	1206	op->carrying = 0; // must be 0 already
1231		1207
1232	op->destroy (1);	1208	op->destroy ();
1233		1209
1234	return top;	1210	return top;
1235	}	1211	}
1236		1212
1237	return 0;	1213	return 0;
…		…
1265	* job preparing multi-part monsters.	1241	* job preparing multi-part monsters.
1266	*/	1242	*/
1267	object *	1243	object *
1268	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1244	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1269	{	1245	{
		1246	op->remove ();
		1247
1270	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1248	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1271	{	1249	{
1272	tmp->x = x + tmp->arch->x;	1250	tmp->x = x + tmp->arch->x;
1273	tmp->y = y + tmp->arch->y;	1251	tmp->y = y + tmp->arch->y;
1274	}	1252	}
…		…
1297	* just 'op' otherwise	1275	* just 'op' otherwise
1298	*/	1276	*/
1299	object *	1277	object *
1300	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1278	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1301	{	1279	{
1302	assert (!op->flag [FLAG_FREED]);
1303
1304	op->remove ();	1280	op->remove ();
		1281
		1282	if (m == &freed_map)//D TODO: remove soon
		1283	{//D
		1284	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1285	}//D
1305		1286
1306	/* Ideally, the caller figures this out. However, it complicates a lot	1287	/* Ideally, the caller figures this out. However, it complicates a lot
1307	* of areas of callers (eg, anything that uses find_free_spot would now	1288	* of areas of callers (eg, anything that uses find_free_spot would now
1308	* need extra work	1289	* need extra work
1309	*/	1290	*/
		1291	maptile *newmap = m;
1310	if (!xy_normalise (m, op->x, op->y))	1292	if (!xy_normalise (newmap, op->x, op->y))
1311	{	1293	{
1312	op->destroy (1);	1294	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1313	return 0;	1295	return 0;
1314	}	1296	}
1315		1297
1316	if (object *more = op->more)	1298	if (object *more = op->more)
1317	if (!insert_ob_in_map (more, m, originator, flag))	1299	if (!insert_ob_in_map (more, m, originator, flag))
1318	return 0;	1300	return 0;
1319		1301
1320	CLEAR_FLAG (op, FLAG_REMOVED);	1302	op->flag [FLAG_REMOVED] = false;
1321		1303	op->env = 0;
1322	op->map = m;	1304	op->map = newmap;
		1305
1323	mapspace &ms = op->ms ();	1306	mapspace &ms = op->ms ();
1324		1307
1325	/* this has to be done after we translate the coordinates.	1308	/* this has to be done after we translate the coordinates.
1326	*/	1309	*/
1327	if (op->nrof && !(flag & INS_NO_MERGE))	1310	if (op->nrof && !(flag & INS_NO_MERGE))
1328	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1311	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1329	if (object::can_merge (op, tmp))	1312	if (object::can_merge (op, tmp))
1330	{	1313	{
1331	// TODO: we atcually want to update tmp, not op,	1314	// TODO: we actually want to update tmp, not op,
1332	// but some caller surely breaks when we return tmp	1315	// but some caller surely breaks when we return tmp
1333	// from here :/	1316	// from here :/
1334	op->nrof += tmp->nrof;	1317	op->nrof += tmp->nrof;
1335	tmp->destroy (1);	1318	tmp->destroy ();
1336	}	1319	}
1337		1320
1338	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1321	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1339	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1322	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1340		1323
…		…
1347	{	1330	{
1348	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1331	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1349	abort ();	1332	abort ();
1350	}	1333	}
1351		1334
		1335	if (!originator->is_on_map ())
		1336	{
		1337	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1338	op->debug_desc (), originator->debug_desc ());
		1339	abort ();
		1340	}
		1341
1352	op->above = originator;	1342	op->above = originator;
1353	op->below = originator->below;	1343	op->below = originator->below;
1354
1355	if (op->below)
1356	op->below->above = op;
1357	else
1358	ms.bot = op;
1359
1360	/* since below originator, no need to update top */
1361	originator->below = op;	1344	originator->below = op;
		1345
		1346	*(op->below ? &op->below->above : &ms.bot) = op;
1362	}	1347	}
1363	else	1348	else
1364	{	1349	{
1365	object top, floor = NULL;	1350	object *floor = 0;
1366		1351	object *top = ms.top;
1367	top = ms.bot;
1368		1352
1369	/* If there are other objects, then */	1353	/* If there are other objects, then */
1370	if (top)	1354	if (top)
1371	{	1355	{
1372	object *last = 0;
1373
1374	/*	1356	/*
1375	* If there are multiple objects on this space, we do some trickier handling.	1357	* If there are multiple objects on this space, we do some trickier handling.
1376	* We've already dealt with merging if appropriate.	1358	* We've already dealt with merging if appropriate.
1377	* Generally, we want to put the new object on top. But if	1359	* Generally, we want to put the new object on top. But if
1378	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1360	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1381	* once we get to them. This reduces the need to traverse over all of	1363	* once we get to them. This reduces the need to traverse over all of
1382	* them when adding another one - this saves quite a bit of cpu time	1364	* them when adding another one - this saves quite a bit of cpu time
1383	* when lots of spells are cast in one area. Currently, it is presumed	1365	* when lots of spells are cast in one area. Currently, it is presumed
1384	* that flying non pickable objects are spell objects.	1366	* that flying non pickable objects are spell objects.
1385	*/	1367	*/
1386	for (top = ms.bot; top; top = top->above)	1368	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1387	{	1369	{
1388	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1370	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) \|\| QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1389	floor = top;	1371	floor = tmp;
1390		1372
1391	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1373	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1392	{	1374	{
1393	/* We insert above top, so we want this object below this */	1375	/* We insert above top, so we want this object below this */
1394	top = top->below;	1376	top = tmp->below;
1395	break;	1377	break;
1396	}	1378	}
1397		1379
1398	last = top;	1380	top = tmp;
1399	}	1381	}
1400
1401	/* Don't want top to be NULL, so set it to the last valid object */
1402	top = last;
1403		1382
1404	/* We let update_position deal with figuring out what the space	1383	/* We let update_position deal with figuring out what the space
1405	* looks like instead of lots of conditions here.	1384	* looks like instead of lots of conditions here.
1406	* makes things faster, and effectively the same result.	1385	* makes things faster, and effectively the same result.
1407	*/	1386	*/
…		…
1414	*/	1393	*/
1415	if (!(flag & INS_ON_TOP)	1394	if (!(flag & INS_ON_TOP)
1416	&& ms.flags () & P_BLOCKSVIEW	1395	&& ms.flags () & P_BLOCKSVIEW
1417	&& (op->face && !faces [op->face].visibility))	1396	&& (op->face && !faces [op->face].visibility))
1418	{	1397	{
		1398	object *last;
		1399
1419	for (last = top; last != floor; last = last->below)	1400	for (last = top; last != floor; last = last->below)
1420	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1401	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1421	break;	1402	break;
1422		1403
1423	/* Check to see if we found the object that blocks view,	1404	/* Check to see if we found the object that blocks view,
…		…
1431	} /* If objects on this space */	1412	} /* If objects on this space */
1432		1413
1433	if (flag & INS_ABOVE_FLOOR_ONLY)	1414	if (flag & INS_ABOVE_FLOOR_ONLY)
1434	top = floor;	1415	top = floor;
1435		1416
1436	/* Top is the object that our object (op) is going to get inserted above.	1417	// insert object above top, or bottom-most if top = 0
1437	*/
1438
1439	/* First object on this space */
1440	if (!top)	1418	if (!top)
1441	{	1419	{
		1420	op->below = 0;
1442	op->above = ms.bot;	1421	op->above = ms.bot;
1443
1444	if (op->above)
1445	op->above->below = op;
1446
1447	op->below = 0;
1448	ms.bot = op;	1422	ms.bot = op;
		1423
		1424	*(op->above ? &op->above->below : &ms.top) = op;
1449	}	1425	}
1450	else	1426	else
1451	{ /* get inserted into the stack above top */	1427	{
1452	op->above = top->above;	1428	op->above = top->above;
1453
1454	if (op->above)
1455	op->above->below = op;	1429	top->above = op;
1456		1430
1457	op->below = top;	1431	op->below = top;
1458	top->above = op;	1432	*(op->above ? &op->above->below : &ms.top) = op;
1459	}	1433	}
		1434	}
1460		1435
1461	if (!op->above)	1436	if (op->is_player ())
1462	ms.top = op;
1463	} /* else not INS_BELOW_ORIGINATOR */
1464
1465	if (op->type == PLAYER)
1466	{	1437	{
1467	op->contr->do_los = 1;	1438	op->contr->do_los = 1;
1468	++op->map->players;	1439	++op->map->players;
1469	op->map->touch ();	1440	op->map->touch ();
1470	}	1441	}
1471		1442
1472	op->map->dirty = true;	1443	op->map->dirty = true;
1473		1444
1474	if (object *pl = ms.player ())	1445	if (object *pl = ms.player ())
1475	//TODO: the floorbox prev/next might need updating	1446	//TODO: the floorbox prev/next might need updating
1476	esrv_send_item (pl, op);	1447	//esrv_send_item (pl, op);
		1448	//TODO: update floorbox to preserve ordering
		1449	if (pl->contr->ns)
		1450	pl->contr->ns->floorbox_update ();
1477		1451
1478	/* If this object glows, it may affect lighting conditions that are	1452	/* If this object glows, it may affect lighting conditions that are
1479	* visible to others on this map. But update_all_los is really	1453	* visible to others on this map. But update_all_los is really
1480	* an inefficient way to do this, as it means los for all players	1454	* an inefficient way to do this, as it means los for all players
1481	* on the map will get recalculated. The players could very well	1455	* on the map will get recalculated. The players could very well
1482	* be far away from this change and not affected in any way -	1456	* be far away from this change and not affected in any way -
1483	* this should get redone to only look for players within range,	1457	* this should get redone to only look for players within range,
1484	* or just updating the P_UPTODATE for spaces within this area	1458	* or just updating the P_UPTODATE for spaces within this area
1485	* of effect may be sufficient.	1459	* of effect may be sufficient.
1486	*/	1460	*/
1487	if (op->map->darkness && (op->glow_radius != 0))	1461	if (op->affects_los ())
		1462	{
		1463	op->ms ().invalidate ();
1488	update_all_los (op->map, op->x, op->y);	1464	update_all_los (op->map, op->x, op->y);
		1465	}
1489		1466
1490	/* updates flags (blocked, alive, no magic, etc) for this map space */	1467	/* updates flags (blocked, alive, no magic, etc) for this map space */
1491	update_object (op, UP_OBJ_INSERT);	1468	update_object (op, UP_OBJ_INSERT);
1492		1469
1493	INVOKE_OBJECT (INSERT, op);	1470	INVOKE_OBJECT (INSERT, op);
…		…
1521	/* this function inserts an object in the map, but if it	1498	/* this function inserts an object in the map, but if it
1522	* finds an object of its own type, it'll remove that one first.	1499	* finds an object of its own type, it'll remove that one first.
1523	* op is the object to insert it under: supplies x and the map.	1500	* op is the object to insert it under: supplies x and the map.
1524	*/	1501	*/
1525	void	1502	void
1526	replace_insert_ob_in_map (const char arch_string, object op)	1503	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1527	{	1504	{
1528	/* first search for itself and remove any old instances */	1505	/* first search for itself and remove any old instances */
1529		1506
1530	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1507	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1531	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1508	if (tmp->arch->archname == archname) /* same archetype */
1532	tmp->destroy (1);	1509	tmp->destroy ();
1533		1510
1534	object *tmp = arch_to_object (archetype::find (arch_string));	1511	object *tmp = arch_to_object (archetype::find (archname));
1535		1512
1536	tmp->x = op->x;	1513	tmp->x = op->x;
1537	tmp->y = op->y;	1514	tmp->y = op->y;
1538		1515
1539	insert_ob_in_map (tmp, op->map, op, 0);	1516	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1561	if (!nr)	1538	if (!nr)
1562	return true;	1539	return true;
1563		1540
1564	nr = min (nr, nrof);	1541	nr = min (nr, nrof);
1565		1542
		1543	if (nrof > nr)
		1544	{
1566	nrof -= nr;	1545	nrof -= nr;
1567
1568	if (nrof)
1569	{
1570	adjust_weight (env, -weight * nr); // carrying == 0	1546	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1571		1547
1572	if (object *pl = visible_to ())	1548	if (object *pl = visible_to ())
1573	esrv_update_item (UPD_NROF, pl, this);	1549	esrv_update_item (UPD_NROF, pl, this);
1574		1550
1575	return true;	1551	return true;
1576	}	1552	}
1577	else	1553	else
1578	{	1554	{
1579	destroy (1);	1555	destroy ();
1580	return false;	1556	return false;
1581	}	1557	}
1582	}	1558	}
1583		1559
1584	/*	1560	/*
…		…
1601	}	1577	}
1602	else	1578	else
1603	{	1579	{
1604	decrease (nr);	1580	decrease (nr);
1605		1581
1606	object *op = object_create_clone (this);	1582	object *op = deep_clone ();
1607	op->nrof = nr;	1583	op->nrof = nr;
1608	return op;	1584	return op;
1609	}	1585	}
1610	}	1586	}
1611		1587
…		…
1661	if (object *pl = tmp->visible_to ())	1637	if (object *pl = tmp->visible_to ())
1662	esrv_update_item (UPD_NROF, pl, tmp);	1638	esrv_update_item (UPD_NROF, pl, tmp);
1663		1639
1664	adjust_weight (this, op->total_weight ());	1640	adjust_weight (this, op->total_weight ());
1665		1641
1666	op->destroy (1);	1642	op->destroy ();
1667	op = tmp;	1643	op = tmp;
1668	goto inserted;	1644	goto inserted;
1669	}	1645	}
1670		1646
1671	op->owner = 0; // it's his/hers now. period.	1647	op->owner = 0; // it's his/hers now. period.
…		…
1689		1665
1690	adjust_weight (this, op->total_weight ());	1666	adjust_weight (this, op->total_weight ());
1691		1667
1692	inserted:	1668	inserted:
1693	/* reset the light list and los of the players on the map */	1669	/* reset the light list and los of the players on the map */
1694	if (op->glow_radius && map && map->darkness)	1670	if (op->glow_radius && is_on_map ())
		1671	{
		1672	update_stats ();
1695	update_all_los (map, x, y);	1673	update_all_los (map, x, y);
1696		1674	}
		1675	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1697	// if this is a player's inventory, update stats	1676	// if this is a player's inventory, update stats
1698	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1699	update_stats ();	1677	update_stats ();
1700		1678
1701	INVOKE_OBJECT (INSERT, this);	1679	INVOKE_OBJECT (INSERT, this);
1702		1680
1703	return op;	1681	return op;
…		…
1787	{	1765	{
1788		1766
1789	float	1767	float
1790	diff = tmp->move_slow_penalty * fabs (op->speed);	1768	diff = tmp->move_slow_penalty * fabs (op->speed);
1791		1769
1792	if (op->type == PLAYER)	1770	if (op->is_player ())
1793	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1771	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1794	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1772	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1795	diff /= 4.0;	1773	diff /= 4.0;
1796		1774
1797	op->speed_left -= diff;	1775	op->speed_left -= diff;
…		…
1832	LOG (llevError, "Present_arch called outside map.\n");	1810	LOG (llevError, "Present_arch called outside map.\n");
1833	return NULL;	1811	return NULL;
1834	}	1812	}
1835		1813
1836	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1814	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1837	if (tmp->arch == at)	1815	if (tmp->arch->archname == at->archname)
1838	return tmp;	1816	return tmp;
1839		1817
1840	return NULL;	1818	return NULL;
1841	}	1819	}
1842		1820
…		…
1906	* The first matching object is returned, or NULL if none.	1884	* The first matching object is returned, or NULL if none.
1907	*/	1885	*/
1908	object *	1886	object *
1909	present_arch_in_ob (const archetype at, const object op)	1887	present_arch_in_ob (const archetype at, const object op)
1910	{	1888	{
1911	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1889	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1912	if (tmp->arch == at)	1890	if (tmp->arch->archname == at->archname)
1913	return tmp;	1891	return tmp;
1914		1892
1915	return NULL;	1893	return NULL;
1916	}	1894	}
1917		1895
…		…
2005	* head of the object should correspond for the entire object.	1983	* head of the object should correspond for the entire object.
2006	*/	1984	*/
2007	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1985	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2008	continue;	1986	continue;
2009		1987
2010	if (ob->blocked (m, pos.x, pos.y))	1988	if (ob->blocked (pos.m, pos.x, pos.y))
2011	continue;	1989	continue;
2012		1990
2013	altern [index++] = i;	1991	altern [index++] = i;
2014	}	1992	}
2015		1993
…		…
2083	* there is capable of.	2061	* there is capable of.
2084	*/	2062	*/
2085	int	2063	int
2086	find_dir (maptile m, int x, int y, object exclude)	2064	find_dir (maptile m, int x, int y, object exclude)
2087	{	2065	{
2088	int i, max = SIZEOFFREE, mflags;	2066	int max = SIZEOFFREE, mflags;
2089
2090	sint16 nx, ny;
2091	object *tmp;
2092	maptile *mp;
2093
2094	MoveType blocked, move_type;	2067	MoveType move_type;
2095		2068
2096	if (exclude && exclude->head_ () != exclude)	2069	if (exclude && exclude->head_ () != exclude)
2097	{	2070	{
2098	exclude = exclude->head;	2071	exclude = exclude->head;
2099	move_type = exclude->move_type;	2072	move_type = exclude->move_type;
…		…
2102	{	2075	{
2103	/* If we don't have anything, presume it can use all movement types. */	2076	/* If we don't have anything, presume it can use all movement types. */
2104	move_type = MOVE_ALL;	2077	move_type = MOVE_ALL;
2105	}	2078	}
2106		2079
2107	for (i = 1; i < max; i++)	2080	for (int i = 1; i < max; i++)
2108	{	2081	{
2109	mp = m;	2082	mapxy pos (m, x, y);
2110	nx = x + freearr_x[i];	2083	pos.move (i);
2111	ny = y + freearr_y[i];
2112		2084
2113	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2085	if (!pos.normalise ())
2114
2115	if (mflags & P_OUT_OF_MAP)
2116	max = maxfree[i];	2086	max = maxfree[i];
2117	else	2087	else
2118	{	2088	{
2119	mapspace &ms = mp->at (nx, ny);	2089	mapspace &ms = *pos;
2120		2090
2121	blocked = ms.move_block;
2122
2123	if ((move_type & blocked) == move_type)	2091	if ((move_type & ms.move_block) == move_type)
2124	max = maxfree[i];	2092	max = maxfree [i];
2125	else if (mflags & P_IS_ALIVE)	2093	else if (ms.flags () & P_IS_ALIVE)
2126	{	2094	{
2127	for (tmp = ms.bot; tmp; tmp = tmp->above)	2095	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2128	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2096	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2129	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2097	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2130	break;
2131
2132	if (tmp)
2133	return freedir[i];	2098	return freedir [i];
2134	}	2099	}
2135	}	2100	}
2136	}	2101	}
2137		2102
2138	return 0;	2103	return 0;
…		…
2213	* This basically means that if direction is 15, then it could either go	2178	* This basically means that if direction is 15, then it could either go
2214	* direction 4, 14, or 16 to get back to where we are.	2179	* direction 4, 14, or 16 to get back to where we are.
2215	* Moved from spell_util.c to object.c with the other related direction	2180	* Moved from spell_util.c to object.c with the other related direction
2216	* functions.	2181	* functions.
2217	*/	2182	*/
2218	int reduction_dir[SIZEOFFREE][3] = {	2183	const int reduction_dir[SIZEOFFREE][3] = {
2219	{0, 0, 0}, /* 0 */	2184	{0, 0, 0}, /* 0 */
2220	{0, 0, 0}, /* 1 */	2185	{0, 0, 0}, /* 1 */
2221	{0, 0, 0}, /* 2 */	2186	{0, 0, 0}, /* 2 */
2222	{0, 0, 0}, /* 3 */	2187	{0, 0, 0}, /* 3 */
2223	{0, 0, 0}, /* 4 */	2188	{0, 0, 0}, /* 4 */
…		…
2319	int	2284	int
2320	can_pick (const object who, const object item)	2285	can_pick (const object who, const object item)
2321	{	2286	{
2322	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2287	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2323	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2288	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2324	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER \|\| item->weight < who->weight / 3));	2289	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2325	}	2290	}
2326		2291
2327	/*	2292	/*
2328	* create clone from object to another	2293	* create clone from object to another
2329	*/	2294	*/
2330	object *	2295	object *
2331	object_create_clone (object *asrc)	2296	object::deep_clone ()
2332	{	2297	{
2333	object dst = 0, tmp, src, prev, *item;	2298	assert (("deep_clone called on non-head object", is_head ()));
2334		2299
2335	if (!asrc)	2300	object *dst = clone ();
2336	return 0;
2337		2301
2338	src = asrc->head_ ();	2302	object *prev = dst;
2339
2340	prev = 0;
2341	for (object *part = src; part; part = part->more)	2303	for (object *part = this->more; part; part = part->more)
2342	{	2304	{
2343	tmp = part->clone ();	2305	object *tmp = part->clone ();
2344	tmp->x -= src->x;
2345	tmp->y -= src->y;
2346
2347	if (!part->head)
2348	{
2349	dst = tmp;
2350	tmp->head = 0;
2351	}
2352	else
2353	tmp->head = dst;	2306	tmp->head = dst;
2354
2355	tmp->more = 0;
2356
2357	if (prev)
2358	prev->more = tmp;	2307	prev->more = tmp;
2359
2360	prev = tmp;	2308	prev = tmp;
2361	}	2309	}
2362		2310
2363	for (item = src->inv; item; item = item->below)	2311	for (object *item = inv; item; item = item->below)
2364	insert_ob_in_ob (object_create_clone (item), dst);	2312	insert_ob_in_ob (item->deep_clone (), dst);
2365		2313
2366	return dst;	2314	return dst;
2367	}	2315	}
2368		2316
2369	/* This returns the first object in who's inventory that	2317	/* This returns the first object in who's inventory that
…		…
2378	return tmp;	2326	return tmp;
2379		2327
2380	return 0;	2328	return 0;
2381	}	2329	}
2382		2330
2383	/* If ob has a field named key, return the link from the list,	2331	shstr_tmp
2384	* otherwise return NULL.	2332	object::kv_get (shstr_tmp key) const
2385	*
2386	* key must be a passed in shared string - otherwise, this won't
2387	* do the desired thing.
2388	*/
2389	key_value *
2390	get_ob_key_link (const object ob, const char key)
2391	{	2333	{
2392	for (key_value *link = ob->key_values; link; link = link->next)	2334	for (key_value *kv = key_values; kv; kv = kv->next)
2393	if (link->key == key)	2335	if (kv->key == key)
2394	return link;
2395
2396	return 0;
2397	}
2398
2399	/*
2400	* Returns the value of op has an extra_field for key, or NULL.
2401	*
2402	* The argument doesn't need to be a shared string.
2403	*
2404	* The returned string is shared.
2405	*/
2406	const char *
2407	get_ob_key_value (const object op, const char const key)
2408	{
2409	key_value *link;
2410	shstr_cmp canonical_key (key);
2411
2412	if (!canonical_key)
2413	{
2414	/* 1. There being a field named key on any object
2415	* implies there'd be a shared string to find.
2416	* 2. Since there isn't, no object has this field.
2417	* 3. Therefore, this object doesn't have this field.
2418	*/
2419	return 0;
2420	}
2421
2422	/* This is copied from get_ob_key_link() above -
2423	* only 4 lines, and saves the function call overhead.
2424	*/
2425	for (link = op->key_values; link; link = link->next)
2426	if (link->key == canonical_key)
2427	return link->value;	2336	return kv->value;
2428		2337
2429	return 0;	2338	return shstr ();
2430	}	2339	}
2431		2340
2432	/*	2341	void
2433	* Updates the canonical_key in op to value.	2342	object::kv_set (shstr_tmp key, shstr_tmp value)
2434	*
2435	* canonical_key is a shared string (value doesn't have to be).
2436	*
2437	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2438	* keys.
2439	*
2440	* Returns TRUE on success.
2441	*/
2442	int
2443	set_ob_key_value_s (object op, const shstr & canonical_key, const char value, int add_key)
2444	{	2343	{
2445	key_value field = NULL, last = NULL;	2344	for (key_value *kv = key_values; kv; kv = kv->next)
2446		2345	if (kv->key == key)
2447	for (field = op->key_values; field != NULL; field = field->next)
2448	{
2449	if (field->key != canonical_key)
2450	{	2346	{
2451	last = field;	2347	kv->value = value;
2452	continue;	2348	return;
2453	}	2349	}
2454		2350
2455	if (value)	2351	key_value *kv = new key_value;
2456	field->value = value;	2352
2457	else	2353	kv->next = key_values;
		2354	kv->key = key;
		2355	kv->value = value;
		2356
		2357	key_values = kv;
		2358	}
		2359
		2360	void
		2361	object::kv_del (shstr_tmp key)
		2362	{
		2363	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
		2364	if ((*kvp)->key == key)
2458	{	2365	{
2459	/* Basically, if the archetype has this key set,	2366	key_value kv = kvp;
2460	* we need to store the null value so when we save	2367	kvp = (kvp)->next;
2461	* it, we save the empty value so that when we load,	2368	delete kv;
2462	* we get this value back again.	2369	return;
2463	*/
2464	if (get_ob_key_link (op->arch, canonical_key))
2465	field->value = 0;
2466	else
2467	{
2468	if (last)
2469	last->next = field->next;
2470	else
2471	op->key_values = field->next;
2472
2473	delete field;
2474	}
2475	}	2370	}
2476	return TRUE;
2477	}
2478	/* IF we get here, key doesn't exist */
2479
2480	/* No field, we'll have to add it. */
2481
2482	if (!add_key)
2483	return FALSE;
2484
2485	/* There isn't any good reason to store a null
2486	* value in the key/value list. If the archetype has
2487	* this key, then we should also have it, so shouldn't
2488	* be here. If user wants to store empty strings,
2489	* should pass in ""
2490	*/
2491	if (value == NULL)
2492	return TRUE;
2493
2494	field = new key_value;
2495
2496	field->key = canonical_key;
2497	field->value = value;
2498	/* Usual prepend-addition. */
2499	field->next = op->key_values;
2500	op->key_values = field;
2501
2502	return TRUE;
2503	}
2504
2505	/*
2506	* Updates the key in op to value.
2507	*
2508	* If add_key is FALSE, this will only update existing keys,
2509	* and not add new ones.
2510	* In general, should be little reason FALSE is ever passed in for add_key
2511	*
2512	* Returns TRUE on success.
2513	*/
2514	int
2515	set_ob_key_value (object op, const char key, const char *value, int add_key)
2516	{
2517	shstr key_ (key);
2518
2519	return set_ob_key_value_s (op, key_, value, add_key);
2520	}	2371	}
2521		2372
2522	object::depth_iterator::depth_iterator (object *container)	2373	object::depth_iterator::depth_iterator (object *container)
2523	: iterator_base (container)	2374	: iterator_base (container)
2524	{	2375	{
…		…
2574	{	2425	{
2575	char flagdesc[512];	2426	char flagdesc[512];
2576	char info2[256 * 4];	2427	char info2[256 * 4];
2577	char *p = info;	2428	char *p = info;
2578		2429
2579	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2430	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2580	count,	2431	count,
2581	uuid.c_str (),	2432	uuid.c_str (),
2582	&name,	2433	&name,
2583	title ? "\",title:\"" : "",	2434	title ? ",title:\"" : "",
2584	title ? (const char *)title : "",	2435	title ? (const char *)title : "",
		2436	title ? "\"" : "",
2585	flag_desc (flagdesc, 512), type);	2437	flag_desc (flagdesc, 512), type);
2586		2438
2587	if (!flag[FLAG_REMOVED] && env)	2439	if (!flag[FLAG_REMOVED] && env)
2588	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2440	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2589		2441
…		…
2645	container = 0;	2497	container = 0;
2646		2498
2647	// client needs item update to make it work, client bug requires this to be separate	2499	// client needs item update to make it work, client bug requires this to be separate
2648	esrv_update_item (UPD_FLAGS, this, old_container);	2500	esrv_update_item (UPD_FLAGS, this, old_container);
2649		2501
2650	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2502	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2651	play_sound (sound_find ("chest_close"));	2503	play_sound (sound_find ("chest_close"));
2652	}	2504	}
2653		2505
2654	if (new_container)	2506	if (new_container)
2655	{	2507	{
…		…
2665	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2517	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2666	new_container->insert (closer);	2518	new_container->insert (closer);
2667	}	2519	}
2668	#endif	2520	#endif
2669		2521
2670	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2522	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2671		2523
2672	// make sure the container is available, client bug requires this to be separate	2524	// make sure the container is available, client bug requires this to be separate
2673	esrv_send_item (this, new_container);	2525	esrv_send_item (this, new_container);
2674		2526
2675	new_container->flag [FLAG_APPLIED] = true;	2527	new_container->flag [FLAG_APPLIED] = true;
…		…
2683	// else if (!old_container->env && contr && contr->ns)	2535	// else if (!old_container->env && contr && contr->ns)
2684	// contr->ns->floorbox_reset ();	2536	// contr->ns->floorbox_reset ();
2685	}	2537	}
2686		2538
2687	object *	2539	object *
2688	object::force_find (const shstr name)	2540	object::force_find (shstr_tmp name)
2689	{	2541	{
2690	/* cycle through his inventory to look for the MARK we want to	2542	/* cycle through his inventory to look for the MARK we want to
2691	* place	2543	* place
2692	*/	2544	*/
2693	for (object *tmp = inv; tmp; tmp = tmp->below)	2545	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2695	return splay (tmp);	2547	return splay (tmp);
2696		2548
2697	return 0;	2549	return 0;
2698	}	2550	}
2699		2551
2700	void	2552	object *
2701	object::force_add (const shstr name, int duration)	2553	object::force_add (shstr_tmp name, int duration)
2702	{	2554	{
2703	if (object *force = force_find (name))	2555	if (object *force = force_find (name))
2704	force->destroy ();	2556	force->destroy ();
2705		2557
2706	object *force = get_archetype (FORCE_NAME);	2558	object *force = get_archetype (FORCE_NAME);
…		…
2711		2563
2712	force->set_speed (duration ? 1.f / duration : 0.f);	2564	force->set_speed (duration ? 1.f / duration : 0.f);
2713	force->flag [FLAG_IS_USED_UP] = true;	2565	force->flag [FLAG_IS_USED_UP] = true;
2714	force->flag [FLAG_APPLIED] = true;	2566	force->flag [FLAG_APPLIED] = true;
2715		2567
2716	insert (force);	2568	return insert (force);
2717	}	2569	}
2718		2570
2719	void	2571	void
2720	object::play_sound (faceidx sound)	2572	object::play_sound (faceidx sound) const
2721	{	2573	{
2722	if (!sound)	2574	if (!sound)
2723	return;	2575	return;
2724		2576
2725	if (flag [FLAG_REMOVED])	2577	if (is_on_map ())
		2578	map->play_sound (sound, x, y);
		2579	else if (object *pl = in_player ())
		2580	pl->contr->play_sound (sound);
		2581	}
		2582
		2583	void
		2584	object::say_msg (const char *msg) const
		2585	{
		2586	if (is_on_map ())
		2587	map->say_msg (msg, x, y);
		2588	else if (object *pl = in_player ())
		2589	pl->contr->play_sound (sound);
		2590	}
		2591
		2592	void
		2593	object::make_noise ()
		2594	{
		2595	// we do not model noise in the map, so instead put
		2596	// a temporary light into the noise source
		2597	// could use the map instead, but that's less reliable for our
		2598	// goal, which is to make invisibility a bit harder to exploit
		2599
		2600	// currently only works sensibly for players
		2601	if (!is_player ())
2726	return;	2602	return;
2727		2603
2728	if (env)	2604	// find old force, or create new one
2729	{	2605	object *force = force_find (shstr_noise_force);
2730	if (object *pl = in_player ())	2606
2731	pl->contr->play_sound (sound);	2607	if (force)
2732	}	2608	force->speed_left = -1.f; // patch old speed up
2733	else	2609	else
2734	map->play_sound (sound, x, y);	2610	{
2735	}	2611	force = archetype::get (shstr_noise_force);
2736		2612
		2613	force->slaying = shstr_noise_force;
		2614	force->stats.food = 1;
		2615	force->speed_left = -1.f;
		2616
		2617	force->set_speed (1.f / 4.f);
		2618	force->flag [FLAG_IS_USED_UP] = true;
		2619	force->flag [FLAG_APPLIED] = true;
		2620
		2621	insert (force);
		2622	}
		2623	}
		2624

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.222 by root, Wed Apr 30 05:06:36 2008 UTC vs. Revision 1.284 by root, Sat Jun 27 08:35:03 2009 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.222 by root, Wed Apr 30 05:06:36 2008 UTC vs.
Revision 1.284 by root, Sat Jun 27 08:35:03 2009 UTC