ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.226 by root, Sat May 3 08:50:30 2008 UTC vs.
Revision 1.292 by root, Mon Oct 19 21:48:49 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 it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
…		…
32	#include <bitset>	33	#include <bitset>
33		34
34	UUID UUID::cur;	35	UUID UUID::cur;
35	static uint64_t seq_next_save;	36	static uint64_t seq_next_save;
36	static const uint64 UUID_GAP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
		38	uint32_t mapspace::smellcount = 10000;
37		39
38	objectvec objects;	40	objectvec objects;
39	activevec actives;	41	activevec actives;
40		42
41	short freearr_x[SIZEOFFREE] = {	43	short freearr_x[SIZEOFFREE] = {
…		…
139		141
140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	142	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141	static bool	143	static bool
142	compare_ob_value_lists_one (const object *wants, const object *has)	144	compare_ob_value_lists_one (const object *wants, const object *has)
143	{	145	{
144	key_value *wants_field;
145
146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	146	/* 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	147	* objects with lists are rare, and lists stay short. If not, use a
148	* different structure or at least keep the lists sorted...	148	* different structure or at least keep the lists sorted...
149	*/	149	*/
150		150
151	/* For each field in wants, */	151	/* For each field in wants, */
152	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	152	for (key_value *kv = wants->key_values; kv; kv = kv->next)
153	{	153	if (has->kv_get (kv->key) != kv->value)
154	key_value *has_field;	154	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		155
169	/* If we get here, every field in wants has a matching field in has. */	156	/* If we get here, every field in wants has a matching field in has. */
170	return 1;	157	return true;
171	}	158	}
172		159
173	/* Returns TRUE if ob1 has the same key_values as ob2. */	160	/* Returns TRUE if ob1 has the same key_values as ob2. */
174	static bool	161	static bool
175	compare_ob_value_lists (const object *ob1, const object *ob2)	162	compare_ob_value_lists (const object *ob1, const object *ob2)
176	{	163	{
177	/* However, there may be fields in has which aren't partnered in wants,	164	/* However, there may be fields in has which aren't partnered in wants,
178	* so we need to run the comparison *twice*. :(	165	* so we need to run the comparison *twice*. :(
179	*/	166	*/
180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	167	return compare_ob_value_lists_one (ob1, ob2)
		168	&& compare_ob_value_lists_one (ob2, ob1);
181	}	169	}
182		170
183	/* Function examines the 2 objects given to it, and returns true if	171	/* Function examines the 2 objects given to it, and returns true if
184	* they can be merged together.	172	* they can be merged together.
185	*	173	*
…		…
200	|| ob1->speed != ob2->speed	188	|| ob1->speed != ob2->speed
201	|| ob1->value != ob2->value	189	|| ob1->value != ob2->value
202	|| ob1->name != ob2->name)	190	|| ob1->name != ob2->name)
203	return 0;	191	return 0;
204		192
205	/* Do not merge objects if nrof would overflow. First part checks	193	/* Do not merge objects if nrof would overflow, assume nrof
206	* for unsigned overflow (2c), second part checks whether the result	194	* is always 0 .. 2**31-1 */
207	* would fit into a 32 bit signed int, which is often used to hold	195	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;	196	return 0;
212		197
213	/* If the objects have been identified, set the BEEN_APPLIED flag.	198	/* 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	199	* 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	200	* just can't ignore the been applied or identified flags, as they
…		…
220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	205	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221		206
222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	207	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	208	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224		209
225	if (ob1->arch->name != ob2->arch->name	210	if (ob1->arch->archname != ob2->arch->archname
226	|| ob1->name != ob2->name	211	|| ob1->name != ob2->name
227	|| ob1->title != ob2->title	212	|| ob1->title != ob2->title
228	|| ob1->msg != ob2->msg	213	|| ob1->msg != ob2->msg
229	|| ob1->weight != ob2->weight	214	|| ob1->weight != ob2->weight
230	|| ob1->attacktype != ob2->attacktype	215	|| ob1->attacktype != ob2->attacktype
231	|| ob1->magic != ob2->magic	216	|| ob1->magic != ob2->magic
232	|| ob1->slaying != ob2->slaying	217	|| ob1->slaying != ob2->slaying
233	|| ob1->skill != ob2->skill	218	|| ob1->skill != ob2->skill
234	|| ob1->value != ob2->value	219	|| ob1->value != ob2->value
235	|| ob1->animation_id != ob2->animation_id	220	|| ob1->animation_id != ob2->animation_id
		221	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
236	|| ob1->client_type != ob2->client_type	222	|| ob1->client_type != ob2->client_type
237	|| ob1->materialname != ob2->materialname	223	|| ob1->materialname != ob2->materialname
238	|| ob1->lore != ob2->lore	224	|| ob1->lore != ob2->lore
239	|| ob1->subtype != ob2->subtype	225	|| ob1->subtype != ob2->subtype
240	|| ob1->move_type != ob2->move_type	226	|| ob1->move_type != ob2->move_type
…		…
248	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
249	return 0;	235	return 0;
250		236
251	if ((ob1->flag ^ ob2->flag)	237	if ((ob1->flag ^ ob2->flag)
252	.reset (FLAG_INV_LOCKED)	238	.reset (FLAG_INV_LOCKED)
253	.reset (FLAG_CLIENT_SENT)
254	.reset (FLAG_REMOVED)	239	.reset (FLAG_REMOVED)
255	.any ())	240	.any ())
256	return 0;	241	return 0;
257		242
258	/* This is really a spellbook check - we should in general	243	/* This is really a spellbook check - we should in general
…		…
340	{	325	{
341	// see if we are in a container of sorts	326	// see if we are in a container of sorts
342	if (env)	327	if (env)
343	{	328	{
344	// the player inventory itself is always visible	329	// the player inventory itself is always visible
345	if (env->type == PLAYER)	330	if (env->is_player ())
346	return env;	331	return env;
347		332
348	// else a player could have our env open	333	// else a player could have our env open
349	object *envest = env->outer_env ();	334	object *envest = env->outer_env_or_self ();
350		335
351	// the player itself is always on a map, so we will find him here	336	// the player itself is always on a map, so we will find him here
352	// even if our inv is in a player.	337	// even if our inv is in a player.
353	if (envest->is_on_map ())	338	if (envest->is_on_map ())
354	if (object *pl = envest->ms ().player ())	339	if (object *pl = envest->ms ().player ())
355	if (pl->container == env)	340	if (pl->container_ () == env)
356	return pl;	341	return pl;
357	}	342	}
358	else	343	else
359	{	344	{
360	// maybe there is a player standing on the same mapspace	345	// maybe there is a player standing on the same mapspace
361	// this will catch the case where "this" is a player	346	// this will catch the case where "this" is a player
362	if (object *pl = ms ().player ())	347	if (object *pl = ms ().player ())
363	if (!pl->container || this == pl->container)	348	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		349	|| pl->container_ () == this)
364	return pl;	350	return pl;
365	}	351	}
366	}	352	}
367		353
368	return 0;	354	return 0;
369	}	355	}
370		356
371	// adjust weight per container type ("of holding")	357	// adjust weight per container type ("of holding")
372	static sint32	358	static sint32
373	weight_adjust (object *op, sint32 weight)	359	weight_adjust_for (object *op, sint32 weight)
374	{	360	{
375	return op->type == CONTAINER	361	return op->type == CONTAINER
376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	362	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377	: weight;	363	: weight;
378	}	364	}
…		…
384	static void	370	static void
385	adjust_weight (object *op, sint32 weight)	371	adjust_weight (object *op, sint32 weight)
386	{	372	{
387	while (op)	373	while (op)
388	{	374	{
		375	// adjust by actual difference to account for rounding errors
		376	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
389	weight = weight_adjust (op, weight);	377	weight = weight_adjust_for (op, op->carrying)
		378	- weight_adjust_for (op, op->carrying - weight);
390		379
391	if (!weight)	380	if (!weight)
392	return;	381	return;
393		382
394	op->carrying += weight;	383	op->carrying += weight;
…		…
417	op->update_weight ();	406	op->update_weight ();
418		407
419	sum += op->total_weight ();	408	sum += op->total_weight ();
420	}	409	}
421		410
422	sum = weight_adjust (this, sum);	411	sum = weight_adjust_for (this, sum);
423		412
424	if (sum != carrying)	413	if (sum != carrying)
425	{	414	{
426	carrying = sum;	415	carrying = sum;
427		416
…		…
441	return strdup ("[NULLOBJ]");	430	return strdup ("[NULLOBJ]");
442		431
443	object_freezer freezer;	432	object_freezer freezer;
444	op->write (freezer);	433	op->write (freezer);
445	return freezer.as_string ();	434	return freezer.as_string ();
		435	}
		436
		437	char *
		438	object::as_string ()
		439	{
		440	return dump_object (this);
446	}	441	}
447		442
448	/*	443	/*
449	* get_nearest_part(multi-object, object 2) returns the part of the	444	* get_nearest_part(multi-object, object 2) returns the part of the
450	* multi-object 1 which is closest to the second object.	445	* multi-object 1 which is closest to the second object.
…		…
489	*/	484	*/
490	object *	485	object *
491	find_object_name (const char *str)	486	find_object_name (const char *str)
492	{	487	{
493	shstr_cmp str_ (str);	488	shstr_cmp str_ (str);
494	object *op;
495		489
		490	if (str_)
496	for_all_objects (op)	491	for_all_objects (op)
497	if (op->name == str_)	492	if (op->name == str_)
498	break;	493	return op;
499		494
500	return op;	495	return 0;
501	}	496	}
502		497
503	/*	498	/*
504	* Sets the owner and sets the skill and exp pointers to owner's current	499	* Sets the owner and sets the skill and exp pointers to owner's current
505	* skill and experience objects.	500	* skill and experience objects.
…		…
567	update_stats ();	562	update_stats ();
568		563
569	new_draw_info_format (NDI_UNIQUE, 0, this,	564	new_draw_info_format (NDI_UNIQUE, 0, this,
570	"You try to balance all your items at once, "	565	"You try to balance all your items at once, "
571	"but the %s is just too much for your body. "	566	"but the %s is just too much for your body. "
572	"[You need to unapply some items first.]", &ob->name);	567	"[You need to unapply some items first - use the 'body' command to see "
		568	"how many items you cna wera on a specific body part.]", &ob->name);
573	return false;	569	return false;
574	}	570	}
575		571
576	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	572	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
577	}	573	}
…		…
603	}	599	}
604		600
605	op->key_values = 0;	601	op->key_values = 0;
606	}	602	}
607		603
608	object &	604	/*
609	object::operator =(const object &src)	605	* copy_to first frees everything allocated by the dst object,
		606	* and then copies the contents of itself into the second
		607	* object, allocating what needs to be allocated. Basically, any
		608	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		609	* if the first object is freed, the pointers in the new object
		610	* will point at garbage.
		611	*/
		612	void
		613	object::copy_to (object *dst)
610	{	614	{
611	remove ();	615	dst->remove ();
612
613	*(object_copy *)this = src;	616	*(object_copy *)dst = *this;
614
615	flag [FLAG_REMOVED] = true;	617	dst->flag [FLAG_REMOVED] = true;
616		618
617	/* Copy over key_values, if any. */	619	/* Copy over key_values, if any. */
618	if (src.key_values)	620	if (key_values)
619	{	621	{
620	key_value *tail = 0;	622	key_value *tail = 0;
621	key_values = 0;	623	dst->key_values = 0;
622		624
623	for (key_value *i = src.key_values; i; i = i->next)	625	for (key_value *i = key_values; i; i = i->next)
624	{	626	{
625	key_value *new_link = new key_value;	627	key_value *new_link = new key_value;
626		628
627	new_link->next = 0;	629	new_link->next = 0;
628	new_link->key = i->key;	630	new_link->key = i->key;
629	new_link->value = i->value;	631	new_link->value = i->value;
630		632
631	/* Try and be clever here, too. */	633	/* Try and be clever here, too. */
632	if (!key_values)	634	if (!dst->key_values)
633	{	635	{
634	key_values = new_link;	636	dst->key_values = new_link;
635	tail = new_link;	637	tail = new_link;
636	}	638	}
637	else	639	else
638	{	640	{
639	tail->next = new_link;	641	tail->next = new_link;
640	tail = new_link;	642	tail = new_link;
641	}	643	}
642	}	644	}
643	}	645	}
644	}
645
646	/*
647	* copy_to first frees everything allocated by the dst object,
648	* and then copies the contents of itself into the second
649	* object, allocating what needs to be allocated. Basically, any
650	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
651	* if the first object is freed, the pointers in the new object
652	* will point at garbage.
653	*/
654	void
655	object::copy_to (object *dst)
656	{
657	*dst = *this;
658		646
659	if (speed < 0)	647	if (speed < 0)
660	dst->speed_left -= rndm ();	648	dst->speed_left -= rndm ();
661		649
662	dst->set_speed (dst->speed);	650	dst->activate ();
663	}	651	}
664		652
665	void	653	void
666	object::instantiate ()	654	object::instantiate ()
667	{	655	{
…		…
779	else if (action == UP_OBJ_INSERT)	767	else if (action == UP_OBJ_INSERT)
780	{	768	{
781	// this is likely overkill, TODO: revisit (schmorp)	769	// this is likely overkill, TODO: revisit (schmorp)
782	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	770	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
783	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	771	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
784	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	772	|| (op->is_player () && !(m.flags_ & P_PLAYER))
785	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	773	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
786	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	774	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
787	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	775	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
788	|| (m.move_on | op->move_on ) != m.move_on	776	|| (m.move_on | op->move_on ) != m.move_on
789	|| (m.move_off | op->move_off ) != m.move_off	777	|| (m.move_off | op->move_off ) != m.move_off
790	|| (m.move_slow | op->move_slow) != m.move_slow	778	|| (m.move_slow | op->move_slow) != m.move_slow
791	/* This isn't perfect, but I don't expect a lot of objects to	779	/* This isn't perfect, but I don't expect a lot of objects to
792	* to have move_allow right now.	780	* have move_allow right now.
793	*/	781	*/
794	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	782	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
795	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	783	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
796	m.flags_ = 0;	784	m.invalidate ();
797	}	785	}
798	/* if the object is being removed, we can't make intelligent	786	/* if the object is being removed, we can't make intelligent
799	* decisions, because remove_ob can't really pass the object	787	* decisions, because remove_ob can't really pass the object
800	* that is being removed.	788	* that is being removed.
801	*/	789	*/
802	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	790	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
803	m.flags_ = 0;	791	m.invalidate ();
804	else if (action == UP_OBJ_FACE)	792	else if (action == UP_OBJ_FACE)
805	/* Nothing to do for that case */ ;	793	/* Nothing to do for that case */ ;
806	else	794	else
807	LOG (llevError, "update_object called with invalid action: %d\n", action);	795	LOG (llevError, "update_object called with invalid action: %d\n", action);
808		796
…		…
812		800
813	object::object ()	801	object::object ()
814	{	802	{
815	SET_FLAG (this, FLAG_REMOVED);	803	SET_FLAG (this, FLAG_REMOVED);
816		804
817	expmul = 1.0;	805	//expmul = 1.0; declared const for the time being
818	face = blank_face;	806	face = blank_face;
819	}	807	}
820		808
821	object::~object ()	809	object::~object ()
822	{	810	{
…		…
852	/* If already on active list, don't do anything */	840	/* If already on active list, don't do anything */
853	if (active)	841	if (active)
854	return;	842	return;
855		843
856	if (has_active_speed ())	844	if (has_active_speed ())
		845	{
		846	if (flag [FLAG_FREED])
		847	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		848
857	actives.insert (this);	849	actives.insert (this);
		850	}
858	}	851	}
859		852
860	void	853	void
861	object::activate_recursive ()	854	object::activate_recursive ()
862	{	855	{
…		…
923	* drop on that space.	916	* drop on that space.
924	*/	917	*/
925	if (!drop_to_ground	918	if (!drop_to_ground
926	|| !map	919	|| !map
927	|| map->in_memory != MAP_ACTIVE	920	|| map->in_memory != MAP_ACTIVE
928	|| map->nodrop	921	|| map->no_drop
929	|| ms ().move_block == MOVE_ALL)	922	|| ms ().move_block == MOVE_ALL)
930	{	923	{
931	while (inv)	924	while (inv)
932	{
933	inv->destroy_inv (false);
934	inv->destroy ();	925	inv->destroy ();
935	}
936	}	926	}
937	else	927	else
938	{ /* Put objects in inventory onto this space */	928	{ /* Put objects in inventory onto this space */
939	while (inv)	929	while (inv)
940	{	930	{
…		…
944	|| op->flag [FLAG_NO_DROP]	934	|| op->flag [FLAG_NO_DROP]
945	|| op->type == RUNE	935	|| op->type == RUNE
946	|| op->type == TRAP	936	|| op->type == TRAP
947	|| op->flag [FLAG_IS_A_TEMPLATE]	937	|| op->flag [FLAG_IS_A_TEMPLATE]
948	|| op->flag [FLAG_DESTROY_ON_DEATH])	938	|| op->flag [FLAG_DESTROY_ON_DEATH])
949	op->destroy (true);	939	op->destroy ();
950	else	940	else
951	map->insert (op, x, y);	941	map->insert (op, x, y);
952	}	942	}
953	}	943	}
954	}	944	}
…		…
962		952
963	static struct freed_map : maptile	953	static struct freed_map : maptile
964	{	954	{
965	freed_map ()	955	freed_map ()
966	{	956	{
967	path = "<freed objects map>";	957	path = "<freed objects map>";
968	name = "/internal/freed_objects_map";	958	name = "/internal/freed_objects_map";
969	width = 3;	959	width = 3;
970	height = 3;	960	height = 3;
971	nodrop = 1;	961	no_drop = 1;
		962	no_reset = 1;
972		963
973	alloc ();	964	alloc ();
974	in_memory = MAP_ACTIVE;	965	in_memory = MAP_ACTIVE;
975	}	966	}
		967
		968	~freed_map ()
		969	{
		970	destroy ();
		971	}
976	} freed_map; // freed objects are moved here to avoid crashes	972	} freed_map; // freed objects are moved here to avoid crashes
977		973
978	void	974	void
979	object::do_destroy ()	975	object::do_destroy ()
980	{	976	{
981	if (flag [FLAG_IS_LINKED])	977	if (flag [FLAG_IS_LINKED])
982	remove_button_link (this);	978	remove_link ();
983		979
984	if (flag [FLAG_FRIENDLY])	980	if (flag [FLAG_FRIENDLY])
985	remove_friendly_object (this);	981	remove_friendly_object (this);
986		982
987	remove ();	983	remove ();
…		…
1012	attacked_by = 0;	1008	attacked_by = 0;
1013	current_weapon = 0;	1009	current_weapon = 0;
1014	}	1010	}
1015		1011
1016	void	1012	void
1017	object::destroy (bool destroy_inventory)	1013	object::destroy ()
1018	{	1014	{
1019	if (destroyed ())	1015	if (destroyed ())
1020	return;	1016	return;
1021		1017
1022	if (!is_head () && !head->destroyed ())	1018	if (!is_head () && !head->destroyed ())
1023	{	1019	{
1024	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1020	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1025	head->destroy (destroy_inventory);	1021	head->destroy ();
1026	return;	1022	return;
1027	}	1023	}
1028		1024
1029	destroy_inv (!destroy_inventory);	1025	destroy_inv (false);
1030		1026
1031	if (is_head ())	1027	if (is_head ())
1032	if (sound_destroy)	1028	if (sound_destroy)
1033	play_sound (sound_destroy);	1029	play_sound (sound_destroy);
1034	else if (flag [FLAG_MONSTER])	1030	else if (flag [FLAG_MONSTER])
…		…
1071	esrv_del_item (pl->contr, count);	1067	esrv_del_item (pl->contr, count);
1072	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1068	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1073		1069
1074	adjust_weight (env, -total_weight ());	1070	adjust_weight (env, -total_weight ());
1075		1071
1076	*(above ? &above->below : &env->inv) = below;	1072	object *pl = in_player ();
1077
1078	if (below)
1079	below->above = above;
1080		1073
1081	/* we set up values so that it could be inserted into	1074	/* we set up values so that it could be inserted into
1082	* the map, but we don't actually do that - it is up	1075	* the map, but we don't actually do that - it is up
1083	* to the caller to decide what we want to do.	1076	* to the caller to decide what we want to do.
1084	*/	1077	*/
1085	map = env->map;	1078	map = env->map;
1086	x = env->x;	1079	x = env->x;
1087	y = env->y;	1080	y = env->y;
		1081
		1082	// make sure cmov optimisation is applicable
		1083	*(above ? &above->below : &env->inv) = below;
		1084	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1085
1088	above = 0;	1086	above = 0;
1089	below = 0;	1087	below = 0;
1090	env = 0;	1088	env = 0;
1091		1089
1092	/* NO_FIX_PLAYER is set when a great many changes are being	1090	/* NO_FIX_PLAYER is set when a great many changes are being
1093	* made to players inventory. If set, avoiding the call	1091	* made to players inventory. If set, avoiding the call
1094	* to save cpu time.	1092	* to save cpu time.
1095	*/	1093	*/
1096	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1094	if (pl)
		1095	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1096	{
1097	otmp->update_stats ();	1097	pl->update_stats ();
		1098
		1099	if (glow_radius && pl->is_on_map ())
		1100	update_all_los (pl->map, pl->x, pl->y);
		1101	}
1098	}	1102	}
1099	else if (map)	1103	else if (map)
1100	{	1104	{
1101	map->dirty = true;	1105	map->dirty = true;
1102	mapspace &ms = this->ms ();	1106	mapspace &ms = this->ms ();
1103		1107
1104	if (object *pl = ms.player ())	1108	if (object *pl = ms.player ())
1105	{	1109	{
1106	if (type == PLAYER) // this == pl(!)	1110	if (is_player ())
1107	{	1111	{
		1112	if (!flag [FLAG_WIZPASS])
		1113	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1114
1108	// leaving a spot always closes any open container on the ground	1115	// leaving a spot always closes any open container on the ground
1109	if (container && !container->env)	1116	if (container && !container->env)
1110	// this causes spurious floorbox updates, but it ensures	1117	// this causes spurious floorbox updates, but it ensures
1111	// that the CLOSE event is being sent.	1118	// that the CLOSE event is being sent.
1112	close_container ();	1119	close_container ();
1113		1120
1114	--map->players;	1121	--map->players;
1115	map->touch ();	1122	map->touch ();
1116	}	1123	}
1117	else if (pl->container == this)	1124	else if (pl->container_ () == this)
1118	{	1125	{
1119	// removing a container should close it	1126	// removing a container should close it
1120	close_container ();	1127	close_container ();
1121	}	1128	}
1122		1129
1123	esrv_del_item (pl->contr, count);	1130	esrv_del_item (pl->contr, count);
1124	}	1131	}
1125		1132
1126	/* link the object above us */	1133	/* link the object above us */
1127	if (above)	1134	// re-link, make sure compiler can easily use cmove
1128	above->below = below;	1135	*(above ? &above->below : &ms.top) = below;
1129	else	1136	*(below ? &below->above : &ms.bot) = above;
1130	ms.top = below; /* we were top, set new top */
1131
1132	/* Relink the object below us, if there is one */
1133	if (below)
1134	below->above = above;
1135	else
1136	{
1137	/* Nothing below, which means we need to relink map object for this space
1138	* use translated coordinates in case some oddness with map tiling is
1139	* evident
1140	*/
1141	if (GET_MAP_OB (map, x, y) != this)
1142	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 ());
1143
1144	ms.bot = above; /* goes on above it. */
1145	}
1146		1137
1147	above = 0;	1138	above = 0;
1148	below = 0;	1139	below = 0;
1149		1140
		1141	ms.invalidate ();
		1142
1150	if (map->in_memory == MAP_SAVING)	1143	if (map->in_memory == MAP_SAVING)
1151	return;	1144	return;
1152		1145
1153	int check_walk_off = !flag [FLAG_NO_APPLY];	1146	int check_walk_off = !flag [FLAG_NO_APPLY];
1154		1147
1155	if (object *pl = ms.player ())	1148	if (object *pl = ms.player ())
1156	{	1149	{
1157	if (pl->container == this)	1150	if (pl->container_ () == this)
1158	/* If a container that the player is currently using somehow gets	1151	/* If a container that the player is currently using somehow gets
1159	* removed (most likely destroyed), update the player view	1152	* removed (most likely destroyed), update the player view
1160	* appropriately.	1153	* appropriately.
1161	*/	1154	*/
1162	pl->close_container ();	1155	pl->close_container ();
…		…
1186	}	1179	}
1187		1180
1188	last = tmp;	1181	last = tmp;
1189	}	1182	}
1190		1183
1191	/* last == NULL if there are no objects on this space */	1184	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);	1185	update_all_los (map, x, y);
1200	}	1186	}
1201	}	1187	}
1202		1188
1203	/*	1189	/*
…		…
1227	esrv_update_item (UPD_NROF, pl, top);	1213	esrv_update_item (UPD_NROF, pl, top);
1228		1214
1229	op->weight = 0; // cancel the addition above	1215	op->weight = 0; // cancel the addition above
1230	op->carrying = 0; // must be 0 already	1216	op->carrying = 0; // must be 0 already
1231		1217
1232	op->destroy (1);	1218	op->destroy ();
1233		1219
1234	return top;	1220	return top;
1235	}	1221	}
1236		1222
1237	return 0;	1223	return 0;
…		…
1265	* job preparing multi-part monsters.	1251	* job preparing multi-part monsters.
1266	*/	1252	*/
1267	object *	1253	object *
1268	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1254	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1269	{	1255	{
		1256	op->remove ();
		1257
1270	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1258	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1271	{	1259	{
1272	tmp->x = x + tmp->arch->x;	1260	tmp->x = x + tmp->arch->x;
1273	tmp->y = y + tmp->arch->y;	1261	tmp->y = y + tmp->arch->y;
1274	}	1262	}
…		…
1297	* just 'op' otherwise	1285	* just 'op' otherwise
1298	*/	1286	*/
1299	object *	1287	object *
1300	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1288	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1301	{	1289	{
1302	assert (!op->flag [FLAG_FREED]);
1303
1304	op->remove ();	1290	op->remove ();
		1291
		1292	if (m == &freed_map)//D TODO: remove soon
		1293	{//D
		1294	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1295	}//D
1305		1296
1306	/* Ideally, the caller figures this out. However, it complicates a lot	1297	/* 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	1298	* of areas of callers (eg, anything that uses find_free_spot would now
1308	* need extra work	1299	* need extra work
1309	*/	1300	*/
		1301	maptile *newmap = m;
1310	if (!xy_normalise (m, op->x, op->y))	1302	if (!xy_normalise (newmap, op->x, op->y))
1311	{	1303	{
1312	op->destroy (1);	1304	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1313	return 0;	1305	return 0;
1314	}	1306	}
1315		1307
1316	if (object *more = op->more)	1308	if (object *more = op->more)
1317	if (!insert_ob_in_map (more, m, originator, flag))	1309	if (!insert_ob_in_map (more, m, originator, flag))
1318	return 0;	1310	return 0;
1319		1311
1320	CLEAR_FLAG (op, FLAG_REMOVED);	1312	op->flag [FLAG_REMOVED] = false;
1321		1313	op->env = 0;
1322	op->map = m;	1314	op->map = newmap;
		1315
1323	mapspace &ms = op->ms ();	1316	mapspace &ms = op->ms ();
1324		1317
1325	/* this has to be done after we translate the coordinates.	1318	/* this has to be done after we translate the coordinates.
1326	*/	1319	*/
1327	if (op->nrof && !(flag & INS_NO_MERGE))	1320	if (op->nrof && !(flag & INS_NO_MERGE))
1328	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1321	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1329	if (object::can_merge (op, tmp))	1322	if (object::can_merge (op, tmp))
1330	{	1323	{
1331	// TODO: we atcually want to update tmp, not op,	1324	// TODO: we actually want to update tmp, not op,
1332	// but some caller surely breaks when we return tmp	1325	// but some caller surely breaks when we return tmp
1333	// from here :/	1326	// from here :/
1334	op->nrof += tmp->nrof;	1327	op->nrof += tmp->nrof;
1335	tmp->destroy (1);	1328	tmp->destroy ();
1336	}	1329	}
1337		1330
1338	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1331	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1339	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1332	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1340		1333
…		…
1347	{	1340	{
1348	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1341	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1349	abort ();	1342	abort ();
1350	}	1343	}
1351		1344
		1345	if (!originator->is_on_map ())
		1346	{
		1347	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1348	op->debug_desc (), originator->debug_desc ());
		1349	abort ();
		1350	}
		1351
1352	op->above = originator;	1352	op->above = originator;
1353	op->below = originator->below;	1353	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;	1354	originator->below = op;
		1355
		1356	*(op->below ? &op->below->above : &ms.bot) = op;
1362	}	1357	}
1363	else	1358	else
1364	{	1359	{
1365	object *top, *floor = NULL;	1360	object *floor = 0;
1366		1361	object *top = ms.top;
1367	top = ms.bot;
1368		1362
1369	/* If there are other objects, then */	1363	/* If there are other objects, then */
1370	if (top)	1364	if (top)
1371	{	1365	{
1372	object *last = 0;
1373
1374	/*	1366	/*
1375	* If there are multiple objects on this space, we do some trickier handling.	1367	* If there are multiple objects on this space, we do some trickier handling.
1376	* We've already dealt with merging if appropriate.	1368	* We've already dealt with merging if appropriate.
1377	* Generally, we want to put the new object on top. But if	1369	* Generally, we want to put the new object on top. But if
1378	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1370	* 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	1373	* 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	1374	* 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	1375	* when lots of spells are cast in one area. Currently, it is presumed
1384	* that flying non pickable objects are spell objects.	1376	* that flying non pickable objects are spell objects.
1385	*/	1377	*/
1386	for (top = ms.bot; top; top = top->above)	1378	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1387	{	1379	{
1388	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1380	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1389	floor = top;	1381	floor = tmp;
1390		1382
1391	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1383	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1392	{	1384	{
1393	/* We insert above top, so we want this object below this */	1385	/* We insert above top, so we want this object below this */
1394	top = top->below;	1386	top = tmp->below;
1395	break;	1387	break;
1396	}	1388	}
1397		1389
1398	last = top;	1390	top = tmp;
1399	}	1391	}
1400
1401	/* Don't want top to be NULL, so set it to the last valid object */
1402	top = last;
1403		1392
1404	/* We let update_position deal with figuring out what the space	1393	/* We let update_position deal with figuring out what the space
1405	* looks like instead of lots of conditions here.	1394	* looks like instead of lots of conditions here.
1406	* makes things faster, and effectively the same result.	1395	* makes things faster, and effectively the same result.
1407	*/	1396	*/
…		…
1414	*/	1403	*/
1415	if (!(flag & INS_ON_TOP)	1404	if (!(flag & INS_ON_TOP)
1416	&& ms.flags () & P_BLOCKSVIEW	1405	&& ms.flags () & P_BLOCKSVIEW
1417	&& (op->face && !faces [op->face].visibility))	1406	&& (op->face && !faces [op->face].visibility))
1418	{	1407	{
		1408	object *last;
		1409
1419	for (last = top; last != floor; last = last->below)	1410	for (last = top; last != floor; last = last->below)
1420	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1411	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1421	break;	1412	break;
1422		1413
1423	/* Check to see if we found the object that blocks view,	1414	/* Check to see if we found the object that blocks view,
…		…
1431	} /* If objects on this space */	1422	} /* If objects on this space */
1432		1423
1433	if (flag & INS_ABOVE_FLOOR_ONLY)	1424	if (flag & INS_ABOVE_FLOOR_ONLY)
1434	top = floor;	1425	top = floor;
1435		1426
1436	/* Top is the object that our object (op) is going to get inserted above.	1427	// insert object above top, or bottom-most if top = 0
1437	*/
1438
1439	/* First object on this space */
1440	if (!top)	1428	if (!top)
1441	{	1429	{
		1430	op->below = 0;
1442	op->above = ms.bot;	1431	op->above = ms.bot;
1443
1444	if (op->above)
1445	op->above->below = op;
1446
1447	op->below = 0;
1448	ms.bot = op;	1432	ms.bot = op;
		1433
		1434	*(op->above ? &op->above->below : &ms.top) = op;
1449	}	1435	}
1450	else	1436	else
1451	{ /* get inserted into the stack above top */	1437	{
1452	op->above = top->above;	1438	op->above = top->above;
1453
1454	if (op->above)
1455	op->above->below = op;	1439	top->above = op;
1456		1440
1457	op->below = top;	1441	op->below = top;
1458	top->above = op;	1442	*(op->above ? &op->above->below : &ms.top) = op;
1459	}	1443	}
		1444	}
1460		1445
1461	if (!op->above)	1446	if (op->is_player ())
1462	ms.top = op;
1463	} /* else not INS_BELOW_ORIGINATOR */
1464
1465	if (op->type == PLAYER)
1466	{	1447	{
1467	op->contr->do_los = 1;	1448	op->contr->do_los = 1;
1468	++op->map->players;	1449	++op->map->players;
1469	op->map->touch ();	1450	op->map->touch ();
1470	}	1451	}
…		…
1485	* be far away from this change and not affected in any way -	1466	* be far away from this change and not affected in any way -
1486	* this should get redone to only look for players within range,	1467	* this should get redone to only look for players within range,
1487	* or just updating the P_UPTODATE for spaces within this area	1468	* or just updating the P_UPTODATE for spaces within this area
1488	* of effect may be sufficient.	1469	* of effect may be sufficient.
1489	*/	1470	*/
1490	if (op->map->darkness && (op->glow_radius != 0))	1471	if (op->affects_los ())
		1472	{
		1473	op->ms ().invalidate ();
1491	update_all_los (op->map, op->x, op->y);	1474	update_all_los (op->map, op->x, op->y);
		1475	}
1492		1476
1493	/* updates flags (blocked, alive, no magic, etc) for this map space */	1477	/* updates flags (blocked, alive, no magic, etc) for this map space */
1494	update_object (op, UP_OBJ_INSERT);	1478	update_object (op, UP_OBJ_INSERT);
1495		1479
1496	INVOKE_OBJECT (INSERT, op);	1480	INVOKE_OBJECT (INSERT, op);
…		…
1503	* blocked() and wall() work properly), and these flags are updated by	1487	* blocked() and wall() work properly), and these flags are updated by
1504	* update_object().	1488	* update_object().
1505	*/	1489	*/
1506		1490
1507	/* if this is not the head or flag has been passed, don't check walk on status */	1491	/* if this is not the head or flag has been passed, don't check walk on status */
1508	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1492	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1509	{	1493	{
1510	if (check_move_on (op, originator))	1494	if (check_move_on (op, originator))
1511	return 0;	1495	return 0;
1512		1496
1513	/* If we are a multi part object, lets work our way through the check	1497	/* If we are a multi part object, lets work our way through the check
…		…
1524	/* this function inserts an object in the map, but if it	1508	/* this function inserts an object in the map, but if it
1525	* finds an object of its own type, it'll remove that one first.	1509	* finds an object of its own type, it'll remove that one first.
1526	* op is the object to insert it under: supplies x and the map.	1510	* op is the object to insert it under: supplies x and the map.
1527	*/	1511	*/
1528	void	1512	void
1529	replace_insert_ob_in_map (const char *arch_string, object *op)	1513	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1530	{	1514	{
1531	/* first search for itself and remove any old instances */	1515	/* first search for itself and remove any old instances */
1532		1516
1533	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1517	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1534	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1518	if (tmp->arch->archname == archname) /* same archetype */
1535	tmp->destroy (1);	1519	tmp->destroy ();
1536		1520
1537	object *tmp = arch_to_object (archetype::find (arch_string));	1521	object *tmp = arch_to_object (archetype::find (archname));
1538		1522
1539	tmp->x = op->x;	1523	tmp->x = op->x;
1540	tmp->y = op->y;	1524	tmp->y = op->y;
1541		1525
1542	insert_ob_in_map (tmp, op->map, op, 0);	1526	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1564	if (!nr)	1548	if (!nr)
1565	return true;	1549	return true;
1566		1550
1567	nr = min (nr, nrof);	1551	nr = min (nr, nrof);
1568		1552
		1553	if (nrof > nr)
		1554	{
1569	nrof -= nr;	1555	nrof -= nr;
1570
1571	if (nrof)
1572	{
1573	adjust_weight (env, -weight * nr); // carrying == 0	1556	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1574		1557
1575	if (object *pl = visible_to ())	1558	if (object *pl = visible_to ())
1576	esrv_update_item (UPD_NROF, pl, this);	1559	esrv_update_item (UPD_NROF, pl, this);
1577		1560
1578	return true;	1561	return true;
1579	}	1562	}
1580	else	1563	else
1581	{	1564	{
1582	destroy (1);	1565	destroy ();
1583	return false;	1566	return false;
1584	}	1567	}
1585	}	1568	}
1586		1569
1587	/*	1570	/*
…		…
1604	}	1587	}
1605	else	1588	else
1606	{	1589	{
1607	decrease (nr);	1590	decrease (nr);
1608		1591
1609	object *op = object_create_clone (this);	1592	object *op = deep_clone ();
1610	op->nrof = nr;	1593	op->nrof = nr;
1611	return op;	1594	return op;
1612	}	1595	}
1613	}	1596	}
1614		1597
…		…
1664	if (object *pl = tmp->visible_to ())	1647	if (object *pl = tmp->visible_to ())
1665	esrv_update_item (UPD_NROF, pl, tmp);	1648	esrv_update_item (UPD_NROF, pl, tmp);
1666		1649
1667	adjust_weight (this, op->total_weight ());	1650	adjust_weight (this, op->total_weight ());
1668		1651
1669	op->destroy (1);	1652	op->destroy ();
1670	op = tmp;	1653	op = tmp;
1671	goto inserted;	1654	goto inserted;
1672	}	1655	}
1673		1656
1674	op->owner = 0; // it's his/hers now. period.	1657	op->owner = 0; // it's his/hers now. period.
…		…
1692		1675
1693	adjust_weight (this, op->total_weight ());	1676	adjust_weight (this, op->total_weight ());
1694		1677
1695	inserted:	1678	inserted:
1696	/* reset the light list and los of the players on the map */	1679	/* reset the light list and los of the players on the map */
1697	if (op->glow_radius && map && map->darkness)	1680	if (op->glow_radius && is_on_map ())
		1681	{
		1682	update_stats ();
1698	update_all_los (map, x, y);	1683	update_all_los (map, x, y);
1699		1684	}
		1685	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1700	// if this is a player's inventory, update stats	1686	// if this is a player's inventory, update stats
1701	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1702	update_stats ();	1687	update_stats ();
1703		1688
1704	INVOKE_OBJECT (INSERT, this);	1689	INVOKE_OBJECT (INSERT, this);
1705		1690
1706	return op;	1691	return op;
…		…
1727	* on top.	1712	* on top.
1728	*/	1713	*/
1729	int	1714	int
1730	check_move_on (object *op, object *originator)	1715	check_move_on (object *op, object *originator)
1731	{	1716	{
		1717	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1718	return 0;
		1719
1732	object *tmp;	1720	object *tmp;
1733	maptile *m = op->map;	1721	maptile *m = op->map;
1734	int x = op->x, y = op->y;	1722	int x = op->x, y = op->y;
1735		1723
1736	MoveType move_on, move_slow, move_block;	1724	mapspace &ms = m->at (x, y);
1737		1725
1738	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1726	ms.update ();
1739	return 0;
1740		1727
1741	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1728	MoveType move_on = ms.move_on;
1742	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1729	MoveType move_slow = ms.move_slow;
1743	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1730	MoveType move_block = ms.move_block;
1744		1731
1745	/* if nothing on this space will slow op down or be applied,	1732	/* if nothing on this space will slow op down or be applied,
1746	* no need to do checking below. have to make sure move_type	1733	* no need to do checking below. have to make sure move_type
1747	* is set, as lots of objects don't have it set - we treat that	1734	* is set, as lots of objects don't have it set - we treat that
1748	* as walking.	1735	* as walking.
…		…
1759	return 0;	1746	return 0;
1760		1747
1761	/* The objects have to be checked from top to bottom.	1748	/* The objects have to be checked from top to bottom.
1762	* Hence, we first go to the top:	1749	* Hence, we first go to the top:
1763	*/	1750	*/
1764		1751	for (object *next, *tmp = ms.top; tmp; tmp = next)
1765	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1766	{
1767	/* Trim the search when we find the first other spell effect
1768	* this helps performance so that if a space has 50 spell objects,
1769	* we don't need to check all of them.
1770	*/
1771	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1772	break;
1773	}	1752	{
		1753	next = tmp->below;
1774		1754
1775	for (; tmp; tmp = tmp->below)
1776	{
1777	if (tmp == op)	1755	if (tmp == op)
1778	continue; /* Can't apply yourself */	1756	continue; /* Can't apply yourself */
1779		1757
1780	/* Check to see if one of the movement types should be slowed down.	1758	/* Check to see if one of the movement types should be slowed down.
1781	* Second check makes sure that the movement types not being slowed	1759	* Second check makes sure that the movement types not being slowed
…		…
1786	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1764	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1787	{	1765	{
1788	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1766	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1789	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1767	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1790	{	1768	{
1791
1792	float
1793	diff = tmp->move_slow_penalty * fabs (op->speed);	1769	float diff = tmp->move_slow_penalty * fabs (op->speed);
1794		1770
1795	if (op->type == PLAYER)	1771	if (op->is_player ())
1796	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1772	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1797	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1773	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1798	diff /= 4.0;	1774	diff /= 4.0;
1799		1775
1800	op->speed_left -= diff;	1776	op->speed_left -= diff;
1801	}	1777	}
1802	}	1778	}
…		…
1835	LOG (llevError, "Present_arch called outside map.\n");	1811	LOG (llevError, "Present_arch called outside map.\n");
1836	return NULL;	1812	return NULL;
1837	}	1813	}
1838		1814
1839	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1815	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1840	if (tmp->arch == at)	1816	if (tmp->arch->archname == at->archname)
1841	return tmp;	1817	return tmp;
1842		1818
1843	return NULL;	1819	return NULL;
1844	}	1820	}
1845		1821
…		…
1909	* The first matching object is returned, or NULL if none.	1885	* The first matching object is returned, or NULL if none.
1910	*/	1886	*/
1911	object *	1887	object *
1912	present_arch_in_ob (const archetype *at, const object *op)	1888	present_arch_in_ob (const archetype *at, const object *op)
1913	{	1889	{
1914	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1890	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1915	if (tmp->arch == at)	1891	if (tmp->arch->archname == at->archname)
1916	return tmp;	1892	return tmp;
1917		1893
1918	return NULL;	1894	return NULL;
1919	}	1895	}
1920		1896
…		…
2008	* head of the object should correspond for the entire object.	1984	* head of the object should correspond for the entire object.
2009	*/	1985	*/
2010	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1986	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2011	continue;	1987	continue;
2012		1988
2013	if (ob->blocked (m, pos.x, pos.y))	1989	if (ob->blocked (pos.m, pos.x, pos.y))
2014	continue;	1990	continue;
2015		1991
2016	altern [index++] = i;	1992	altern [index++] = i;
2017	}	1993	}
2018		1994
…		…
2086	* there is capable of.	2062	* there is capable of.
2087	*/	2063	*/
2088	int	2064	int
2089	find_dir (maptile *m, int x, int y, object *exclude)	2065	find_dir (maptile *m, int x, int y, object *exclude)
2090	{	2066	{
2091	int i, max = SIZEOFFREE, mflags;	2067	int max = SIZEOFFREE, mflags;
2092
2093	sint16 nx, ny;
2094	object *tmp;
2095	maptile *mp;
2096
2097	MoveType blocked, move_type;	2068	MoveType move_type;
2098		2069
2099	if (exclude && exclude->head_ () != exclude)	2070	if (exclude && exclude->head_ () != exclude)
2100	{	2071	{
2101	exclude = exclude->head;	2072	exclude = exclude->head;
2102	move_type = exclude->move_type;	2073	move_type = exclude->move_type;
…		…
2105	{	2076	{
2106	/* If we don't have anything, presume it can use all movement types. */	2077	/* If we don't have anything, presume it can use all movement types. */
2107	move_type = MOVE_ALL;	2078	move_type = MOVE_ALL;
2108	}	2079	}
2109		2080
2110	for (i = 1; i < max; i++)	2081	for (int i = 1; i < max; i++)
2111	{	2082	{
2112	mp = m;	2083	mapxy pos (m, x, y);
2113	nx = x + freearr_x[i];	2084	pos.move (i);
2114	ny = y + freearr_y[i];
2115		2085
2116	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2086	if (!pos.normalise ())
2117
2118	if (mflags & P_OUT_OF_MAP)
2119	max = maxfree[i];	2087	max = maxfree[i];
2120	else	2088	else
2121	{	2089	{
2122	mapspace &ms = mp->at (nx, ny);	2090	mapspace &ms = *pos;
2123		2091
2124	blocked = ms.move_block;
2125
2126	if ((move_type & blocked) == move_type)	2092	if ((move_type & ms.move_block) == move_type)
2127	max = maxfree[i];	2093	max = maxfree [i];
2128	else if (mflags & P_IS_ALIVE)	2094	else if (ms.flags () & P_IS_ALIVE)
2129	{	2095	{
2130	for (tmp = ms.bot; tmp; tmp = tmp->above)	2096	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2131	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2097	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2132	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2098	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2133	break;
2134
2135	if (tmp)
2136	return freedir[i];	2099	return freedir [i];
2137	}	2100	}
2138	}	2101	}
2139	}	2102	}
2140		2103
2141	return 0;	2104	return 0;
…		…
2216	* This basically means that if direction is 15, then it could either go	2179	* This basically means that if direction is 15, then it could either go
2217	* direction 4, 14, or 16 to get back to where we are.	2180	* direction 4, 14, or 16 to get back to where we are.
2218	* Moved from spell_util.c to object.c with the other related direction	2181	* Moved from spell_util.c to object.c with the other related direction
2219	* functions.	2182	* functions.
2220	*/	2183	*/
2221	int reduction_dir[SIZEOFFREE][3] = {	2184	const int reduction_dir[SIZEOFFREE][3] = {
2222	{0, 0, 0}, /* 0 */	2185	{0, 0, 0}, /* 0 */
2223	{0, 0, 0}, /* 1 */	2186	{0, 0, 0}, /* 1 */
2224	{0, 0, 0}, /* 2 */	2187	{0, 0, 0}, /* 2 */
2225	{0, 0, 0}, /* 3 */	2188	{0, 0, 0}, /* 3 */
2226	{0, 0, 0}, /* 4 */	2189	{0, 0, 0}, /* 4 */
…		…
2322	int	2285	int
2323	can_pick (const object *who, const object *item)	2286	can_pick (const object *who, const object *item)
2324	{	2287	{
2325	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2288	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2326	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2289	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2327	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2290	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2328	}	2291	}
2329		2292
2330	/*	2293	/*
2331	* create clone from object to another	2294	* create clone from object to another
2332	*/	2295	*/
2333	object *	2296	object *
2334	object_create_clone (object *asrc)	2297	object::deep_clone ()
2335	{	2298	{
		2299	assert (("deep_clone called on non-head object", is_head ()));
		2300
2336	object *dst = 0;	2301	object *dst = clone ();
2337		2302
2338	if (!asrc)
2339	return 0;
2340
2341	object *src = asrc->head_ ();
2342
2343	object *prev = 0;	2303	object *prev = dst;
2344	for (object *part = src; part; part = part->more)	2304	for (object *part = this->more; part; part = part->more)
2345	{	2305	{
2346	object *tmp = part->clone ();	2306	object *tmp = part->clone ();
2347
2348	tmp->x -= src->x;
2349	tmp->y -= src->y;
2350
2351	if (!part->head)
2352	{
2353	dst = tmp;
2354	tmp->head = 0;
2355	}
2356	else
2357	tmp->head = dst;	2307	tmp->head = dst;
2358
2359	tmp->more = 0;
2360
2361	if (prev)
2362	prev->more = tmp;	2308	prev->more = tmp;
2363
2364	prev = tmp;	2309	prev = tmp;
2365	}	2310	}
2366		2311
2367	for (object *item = src->inv; item; item = item->below)	2312	for (object *item = inv; item; item = item->below)
2368	insert_ob_in_ob (object_create_clone (item), dst);	2313	insert_ob_in_ob (item->deep_clone (), dst);
2369		2314
2370	return dst;	2315	return dst;
2371	}	2316	}
2372		2317
2373	/* This returns the first object in who's inventory that	2318	/* This returns the first object in who's inventory that
…		…
2382	return tmp;	2327	return tmp;
2383		2328
2384	return 0;	2329	return 0;
2385	}	2330	}
2386		2331
2387	/* If ob has a field named key, return the link from the list,	2332	shstr_tmp
2388	* otherwise return NULL.	2333	object::kv_get (shstr_tmp key) const
2389	*
2390	* key must be a passed in shared string - otherwise, this won't
2391	* do the desired thing.
2392	*/
2393	key_value *
2394	get_ob_key_link (const object *ob, const char *key)
2395	{	2334	{
2396	for (key_value *link = ob->key_values; link; link = link->next)	2335	for (key_value *kv = key_values; kv; kv = kv->next)
2397	if (link->key == key)	2336	if (kv->key == key)
2398	return link;
2399
2400	return 0;
2401	}
2402
2403	/*
2404	* Returns the value of op has an extra_field for key, or NULL.
2405	*
2406	* The argument doesn't need to be a shared string.
2407	*
2408	* The returned string is shared.
2409	*/
2410	const char *
2411	get_ob_key_value (const object *op, const char *const key)
2412	{
2413	key_value *link;
2414	shstr_cmp canonical_key (key);
2415
2416	if (!canonical_key)
2417	{
2418	/* 1. There being a field named key on any object
2419	* implies there'd be a shared string to find.
2420	* 2. Since there isn't, no object has this field.
2421	* 3. Therefore, *this* object doesn't have this field.
2422	*/
2423	return 0;
2424	}
2425
2426	/* This is copied from get_ob_key_link() above -
2427	* only 4 lines, and saves the function call overhead.
2428	*/
2429	for (link = op->key_values; link; link = link->next)
2430	if (link->key == canonical_key)
2431	return link->value;	2337	return kv->value;
2432		2338
2433	return 0;	2339	return shstr ();
2434	}	2340	}
2435		2341
2436	/*	2342	void
2437	* Updates the canonical_key in op to value.	2343	object::kv_set (shstr_tmp key, shstr_tmp value)
2438	*
2439	* canonical_key is a shared string (value doesn't have to be).
2440	*
2441	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2442	* keys.
2443	*
2444	* Returns TRUE on success.
2445	*/
2446	int
2447	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2448	{	2344	{
2449	key_value *field = NULL, *last = NULL;	2345	for (key_value *kv = key_values; kv; kv = kv->next)
2450		2346	if (kv->key == key)
2451	for (field = op->key_values; field != NULL; field = field->next)
2452	{
2453	if (field->key != canonical_key)
2454	{	2347	{
2455	last = field;	2348	kv->value = value;
2456	continue;	2349	return;
2457	}	2350	}
2458		2351
2459	if (value)	2352	key_value *kv = new key_value;
2460	field->value = value;	2353
2461	else	2354	kv->next = key_values;
		2355	kv->key = key;
		2356	kv->value = value;
		2357
		2358	key_values = kv;
		2359	}
		2360
		2361	void
		2362	object::kv_del (shstr_tmp key)
		2363	{
		2364	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2365	if ((*kvp)->key == key)
2462	{	2366	{
2463	/* Basically, if the archetype has this key set,	2367	key_value *kv = *kvp;
2464	* we need to store the null value so when we save	2368	*kvp = (*kvp)->next;
2465	* it, we save the empty value so that when we load,	2369	delete kv;
2466	* we get this value back again.	2370	return;
2467	*/
2468	if (get_ob_key_link (op->arch, canonical_key))
2469	field->value = 0;
2470	else
2471	{
2472	if (last)
2473	last->next = field->next;
2474	else
2475	op->key_values = field->next;
2476
2477	delete field;
2478	}
2479	}	2371	}
2480	return TRUE;
2481	}
2482	/* IF we get here, key doesn't exist */
2483
2484	/* No field, we'll have to add it. */
2485
2486	if (!add_key)
2487	return FALSE;
2488
2489	/* There isn't any good reason to store a null
2490	* value in the key/value list. If the archetype has
2491	* this key, then we should also have it, so shouldn't
2492	* be here. If user wants to store empty strings,
2493	* should pass in ""
2494	*/
2495	if (value == NULL)
2496	return TRUE;
2497
2498	field = new key_value;
2499
2500	field->key = canonical_key;
2501	field->value = value;
2502	/* Usual prepend-addition. */
2503	field->next = op->key_values;
2504	op->key_values = field;
2505
2506	return TRUE;
2507	}
2508
2509	/*
2510	* Updates the key in op to value.
2511	*
2512	* If add_key is FALSE, this will only update existing keys,
2513	* and not add new ones.
2514	* In general, should be little reason FALSE is ever passed in for add_key
2515	*
2516	* Returns TRUE on success.
2517	*/
2518	int
2519	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2520	{
2521	shstr key_ (key);
2522
2523	return set_ob_key_value_s (op, key_, value, add_key);
2524	}	2372	}
2525		2373
2526	object::depth_iterator::depth_iterator (object *container)	2374	object::depth_iterator::depth_iterator (object *container)
2527	: iterator_base (container)	2375	: iterator_base (container)
2528	{	2376	{
…		…
2578	{	2426	{
2579	char flagdesc[512];	2427	char flagdesc[512];
2580	char info2[256 * 4];	2428	char info2[256 * 4];
2581	char *p = info;	2429	char *p = info;
2582		2430
2583	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2431	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2584	count,	2432	count,
2585	uuid.c_str (),	2433	uuid.c_str (),
2586	&name,	2434	&name,
2587	title ? "\",title:\"" : "",	2435	title ? ",title:\"" : "",
2588	title ? (const char *)title : "",	2436	title ? (const char *)title : "",
		2437	title ? "\"" : "",
2589	flag_desc (flagdesc, 512), type);	2438	flag_desc (flagdesc, 512), type);
2590		2439
2591	if (!flag[FLAG_REMOVED] && env)	2440	if (!flag[FLAG_REMOVED] && env)
2592	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2441	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2593		2442
…		…
2649	container = 0;	2498	container = 0;
2650		2499
2651	// client needs item update to make it work, client bug requires this to be separate	2500	// client needs item update to make it work, client bug requires this to be separate
2652	esrv_update_item (UPD_FLAGS, this, old_container);	2501	esrv_update_item (UPD_FLAGS, this, old_container);
2653		2502
2654	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2503	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2655	play_sound (sound_find ("chest_close"));	2504	play_sound (sound_find ("chest_close"));
2656	}	2505	}
2657		2506
2658	if (new_container)	2507	if (new_container)
2659	{	2508	{
…		…
2669	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2518	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2670	new_container->insert (closer);	2519	new_container->insert (closer);
2671	}	2520	}
2672	#endif	2521	#endif
2673		2522
2674	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2523	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2675		2524
2676	// make sure the container is available, client bug requires this to be separate	2525	// make sure the container is available, client bug requires this to be separate
2677	esrv_send_item (this, new_container);	2526	esrv_send_item (this, new_container);
2678		2527
2679	new_container->flag [FLAG_APPLIED] = true;	2528	new_container->flag [FLAG_APPLIED] = true;
…		…
2687	// else if (!old_container->env && contr && contr->ns)	2536	// else if (!old_container->env && contr && contr->ns)
2688	// contr->ns->floorbox_reset ();	2537	// contr->ns->floorbox_reset ();
2689	}	2538	}
2690		2539
2691	object *	2540	object *
2692	object::force_find (const shstr name)	2541	object::force_find (shstr_tmp name)
2693	{	2542	{
2694	/* cycle through his inventory to look for the MARK we want to	2543	/* cycle through his inventory to look for the MARK we want to
2695	* place	2544	* place
2696	*/	2545	*/
2697	for (object *tmp = inv; tmp; tmp = tmp->below)	2546	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2700		2549
2701	return 0;	2550	return 0;
2702	}	2551	}
2703		2552
2704	void	2553	void
		2554	object::force_set_timer (int duration)
		2555	{
		2556	this->duration = 1;
		2557	this->speed_left = -1.f;
		2558
		2559	this->set_speed (duration ? 1.f / duration : 0.f);
		2560	}
		2561
		2562	object *
2705	object::force_add (const shstr name, int duration)	2563	object::force_add (shstr_tmp name, int duration)
2706	{	2564	{
2707	if (object *force = force_find (name))	2565	if (object *force = force_find (name))
2708	force->destroy ();	2566	force->destroy ();
2709		2567
2710	object *force = get_archetype (FORCE_NAME);	2568	object *force = get_archetype (FORCE_NAME);
2711		2569
2712	force->slaying = name;	2570	force->slaying = name;
2713	force->stats.food = 1;
2714	force->speed_left = -1.f;
2715		2571
2716	force->set_speed (duration ? 1.f / duration : 0.f);	2572	force->force_set_timer (duration);
2717	force->flag [FLAG_IS_USED_UP] = true;	2573
2718	force->flag [FLAG_APPLIED] = true;	2574	force->flag [FLAG_APPLIED] = true;
2719		2575
2720	insert (force);	2576	return insert (force);
2721	}	2577	}
2722		2578
2723	void	2579	void
2724	object::play_sound (faceidx sound)	2580	object::play_sound (faceidx sound) const
2725	{	2581	{
2726	if (!sound)	2582	if (!sound)
2727	return;	2583	return;
2728		2584
2729	if (flag [FLAG_REMOVED])	2585	if (is_on_map ())
		2586	map->play_sound (sound, x, y);
		2587	else if (object *pl = in_player ())
		2588	pl->contr->play_sound (sound);
		2589	}
		2590
		2591	void
		2592	object::say_msg (const char *msg) const
		2593	{
		2594	if (is_on_map ())
		2595	map->say_msg (msg, x, y);
		2596	else if (object *pl = in_player ())
		2597	pl->contr->play_sound (sound);
		2598	}
		2599
		2600	void
		2601	object::make_noise ()
		2602	{
		2603	// we do not model noise in the map, so instead put
		2604	// a temporary light into the noise source
		2605	// could use the map instead, but that's less reliable for our
		2606	// goal, which is to make invisibility a bit harder to exploit
		2607
		2608	// currently only works sensibly for players
		2609	if (!is_player ())
2730	return;	2610	return;
2731		2611
2732	if (env)	2612	// find old force, or create new one
2733	{	2613	object *force = force_find (shstr_noise_force);
2734	if (object *pl = in_player ())	2614
2735	pl->contr->play_sound (sound);	2615	if (force)
2736	}	2616	force->speed_left = -1.f; // patch old speed up
2737	else	2617	else
2738	map->play_sound (sound, x, y);	2618	{
2739	}	2619	force = archetype::get (shstr_noise_force);
2740		2620
		2621	force->slaying = shstr_noise_force;
		2622	force->stats.food = 1;
		2623	force->speed_left = -1.f;
		2624
		2625	force->set_speed (1.f / 4.f);
		2626	force->flag [FLAG_IS_USED_UP] = true;
		2627	force->flag [FLAG_APPLIED] = true;
		2628
		2629	insert (force);
		2630	}
		2631	}
		2632

Diff Legend

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