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.224 by root, Fri May 2 20:16:24 2008 UTC vs.
Revision 1.289 by root, Sun Oct 11 05:31:54 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_or_self ();
350		334
351	// the player itself is always on a map, so we will find him here	335	// the player itself is always on a map, so we will find him here
352	// even if our inv is in a player.	336	// even if our inv is in a player.
353	if (envest->is_on_map ())	337	if (envest->is_on_map ())
354	if (object *pl = envest->ms ().player ())	338	if (object *pl = envest->ms ().player ())
…		…
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
…		…
441	return strdup ("[NULLOBJ]");	429	return strdup ("[NULLOBJ]");
442		430
443	object_freezer freezer;	431	object_freezer freezer;
444	op->write (freezer);	432	op->write (freezer);
445	return freezer.as_string ();	433	return freezer.as_string ();
		434	}
		435
		436	char *
		437	object::as_string ()
		438	{
		439	return dump_object (this);
446	}	440	}
447		441
448	/*	442	/*
449	* get_nearest_part(multi-object, object 2) returns the part of the	443	* get_nearest_part(multi-object, object 2) returns the part of the
450	* multi-object 1 which is closest to the second object.	444	* multi-object 1 which is closest to the second object.
…		…
489	*/	483	*/
490	object *	484	object *
491	find_object_name (const char *str)	485	find_object_name (const char *str)
492	{	486	{
493	shstr_cmp str_ (str);	487	shstr_cmp str_ (str);
494	object *op;
495		488
		489	if (str_)
496	for_all_objects (op)	490	for_all_objects (op)
497	if (op->name == str_)	491	if (op->name == str_)
498	break;	492	return op;
499		493
500	return op;	494	return 0;
501	}	495	}
502		496
503	/*	497	/*
504	* Sets the owner and sets the skill and exp pointers to owner's current	498	* Sets the owner and sets the skill and exp pointers to owner's current
505	* skill and experience objects.	499	* skill and experience objects.
…		…
567	update_stats ();	561	update_stats ();
568		562
569	new_draw_info_format (NDI_UNIQUE, 0, this,	563	new_draw_info_format (NDI_UNIQUE, 0, this,
570	"You try to balance all your items at once, "	564	"You try to balance all your items at once, "
571	"but the %s is just too much for your body. "	565	"but the %s is just too much for your body. "
572	"[You need to unapply some items first.]", &ob->name);	566	"[You need to unapply some items first - use the 'body' command to see "
		567	"how many items you cna wera on a specific body part.]", &ob->name);
573	return false;	568	return false;
574	}	569	}
575		570
576	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	571	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
577	}	572	}
…		…
603	}	598	}
604		599
605	op->key_values = 0;	600	op->key_values = 0;
606	}	601	}
607		602
608	object &	603	/*
609	object::operator =(const object &src)	604	* copy_to first frees everything allocated by the dst object,
		605	* and then copies the contents of itself into the second
		606	* object, allocating what needs to be allocated. Basically, any
		607	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		608	* if the first object is freed, the pointers in the new object
		609	* will point at garbage.
		610	*/
		611	void
		612	object::copy_to (object *dst)
610	{	613	{
611	remove ();	614	dst->remove ();
612
613	*(object_copy *)this = src;	615	*(object_copy *)dst = *this;
614
615	flag [FLAG_REMOVED] = true;	616	dst->flag [FLAG_REMOVED] = true;
616		617
617	/* Copy over key_values, if any. */	618	/* Copy over key_values, if any. */
618	if (src.key_values)	619	if (key_values)
619	{	620	{
620	key_value *tail = 0;	621	key_value *tail = 0;
621	key_values = 0;	622	dst->key_values = 0;
622		623
623	for (key_value *i = src.key_values; i; i = i->next)	624	for (key_value *i = key_values; i; i = i->next)
624	{	625	{
625	key_value *new_link = new key_value;	626	key_value *new_link = new key_value;
626		627
627	new_link->next = 0;	628	new_link->next = 0;
628	new_link->key = i->key;	629	new_link->key = i->key;
629	new_link->value = i->value;	630	new_link->value = i->value;
630		631
631	/* Try and be clever here, too. */	632	/* Try and be clever here, too. */
632	if (!key_values)	633	if (!dst->key_values)
633	{	634	{
634	key_values = new_link;	635	dst->key_values = new_link;
635	tail = new_link;	636	tail = new_link;
636	}	637	}
637	else	638	else
638	{	639	{
639	tail->next = new_link;	640	tail->next = new_link;
640	tail = new_link;	641	tail = new_link;
641	}	642	}
642	}	643	}
643	}	644	}
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		645
659	if (speed < 0)	646	if (speed < 0)
660	dst->speed_left -= rndm ();	647	dst->speed_left -= rndm ();
661		648
662	dst->set_speed (dst->speed);	649	dst->activate ();
663	}	650	}
664		651
665	void	652	void
666	object::instantiate ()	653	object::instantiate ()
667	{	654	{
…		…
684	object *	671	object *
685	object::clone ()	672	object::clone ()
686	{	673	{
687	object *neu = create ();	674	object *neu = create ();
688	copy_to (neu);	675	copy_to (neu);
		676	neu->map = map; // not copied by copy_to
689	return neu;	677	return neu;
690	}	678	}
691		679
692	/*	680	/*
693	* If an object with the IS_TURNABLE() flag needs to be turned due	681	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
778	else if (action == UP_OBJ_INSERT)	766	else if (action == UP_OBJ_INSERT)
779	{	767	{
780	// this is likely overkill, TODO: revisit (schmorp)	768	// this is likely overkill, TODO: revisit (schmorp)
781	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	769	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
782	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	770	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
783	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	771	|| (op->is_player () && !(m.flags_ & P_PLAYER))
784	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	772	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
785	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	773	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
786	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	774	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
787	|| (m.move_on | op->move_on ) != m.move_on	775	|| (m.move_on | op->move_on ) != m.move_on
788	|| (m.move_off | op->move_off ) != m.move_off	776	|| (m.move_off | op->move_off ) != m.move_off
789	|| (m.move_slow | op->move_slow) != m.move_slow	777	|| (m.move_slow | op->move_slow) != m.move_slow
790	/* This isn't perfect, but I don't expect a lot of objects to	778	/* This isn't perfect, but I don't expect a lot of objects to
791	* to have move_allow right now.	779	* have move_allow right now.
792	*/	780	*/
793	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	781	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
794	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	782	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
795	m.flags_ = 0;	783	m.invalidate ();
796	}	784	}
797	/* if the object is being removed, we can't make intelligent	785	/* if the object is being removed, we can't make intelligent
798	* decisions, because remove_ob can't really pass the object	786	* decisions, because remove_ob can't really pass the object
799	* that is being removed.	787	* that is being removed.
800	*/	788	*/
801	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	789	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
802	m.flags_ = 0;	790	m.invalidate ();
803	else if (action == UP_OBJ_FACE)	791	else if (action == UP_OBJ_FACE)
804	/* Nothing to do for that case */ ;	792	/* Nothing to do for that case */ ;
805	else	793	else
806	LOG (llevError, "update_object called with invalid action: %d\n", action);	794	LOG (llevError, "update_object called with invalid action: %d\n", action);
807		795
…		…
811		799
812	object::object ()	800	object::object ()
813	{	801	{
814	SET_FLAG (this, FLAG_REMOVED);	802	SET_FLAG (this, FLAG_REMOVED);
815		803
816	expmul = 1.0;	804	//expmul = 1.0; declared const for the time being
817	face = blank_face;	805	face = blank_face;
818	}	806	}
819		807
820	object::~object ()	808	object::~object ()
821	{	809	{
…		…
851	/* If already on active list, don't do anything */	839	/* If already on active list, don't do anything */
852	if (active)	840	if (active)
853	return;	841	return;
854		842
855	if (has_active_speed ())	843	if (has_active_speed ())
		844	{
		845	if (flag [FLAG_FREED])
		846	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		847
856	actives.insert (this);	848	actives.insert (this);
		849	}
857	}	850	}
858		851
859	void	852	void
860	object::activate_recursive ()	853	object::activate_recursive ()
861	{	854	{
…		…
922	* drop on that space.	915	* drop on that space.
923	*/	916	*/
924	if (!drop_to_ground	917	if (!drop_to_ground
925	|| !map	918	|| !map
926	|| map->in_memory != MAP_ACTIVE	919	|| map->in_memory != MAP_ACTIVE
927	|| map->nodrop	920	|| map->no_drop
928	|| ms ().move_block == MOVE_ALL)	921	|| ms ().move_block == MOVE_ALL)
929	{	922	{
930	while (inv)	923	while (inv)
931	{
932	inv->destroy_inv (false);
933	inv->destroy ();	924	inv->destroy ();
934	}
935	}	925	}
936	else	926	else
937	{ /* Put objects in inventory onto this space */	927	{ /* Put objects in inventory onto this space */
938	while (inv)	928	while (inv)
939	{	929	{
…		…
943	|| op->flag [FLAG_NO_DROP]	933	|| op->flag [FLAG_NO_DROP]
944	|| op->type == RUNE	934	|| op->type == RUNE
945	|| op->type == TRAP	935	|| op->type == TRAP
946	|| op->flag [FLAG_IS_A_TEMPLATE]	936	|| op->flag [FLAG_IS_A_TEMPLATE]
947	|| op->flag [FLAG_DESTROY_ON_DEATH])	937	|| op->flag [FLAG_DESTROY_ON_DEATH])
948	op->destroy (true);	938	op->destroy ();
949	else	939	else
950	map->insert (op, x, y);	940	map->insert (op, x, y);
951	}	941	}
952	}	942	}
953	}	943	}
…		…
961		951
962	static struct freed_map : maptile	952	static struct freed_map : maptile
963	{	953	{
964	freed_map ()	954	freed_map ()
965	{	955	{
966	path = "<freed objects map>";	956	path = "<freed objects map>";
967	name = "/internal/freed_objects_map";	957	name = "/internal/freed_objects_map";
968	width = 3;	958	width = 3;
969	height = 3;	959	height = 3;
970	nodrop = 1;	960	no_drop = 1;
		961	no_reset = 1;
971		962
972	alloc ();	963	alloc ();
973	in_memory = MAP_ACTIVE;	964	in_memory = MAP_ACTIVE;
974	}	965	}
		966
		967	~freed_map ()
		968	{
		969	destroy ();
		970	}
975	} freed_map; // freed objects are moved here to avoid crashes	971	} freed_map; // freed objects are moved here to avoid crashes
976		972
977	void	973	void
978	object::do_destroy ()	974	object::do_destroy ()
979	{	975	{
980	if (flag [FLAG_IS_LINKED])	976	if (flag [FLAG_IS_LINKED])
981	remove_button_link (this);	977	remove_link ();
982		978
983	if (flag [FLAG_FRIENDLY])	979	if (flag [FLAG_FRIENDLY])
984	remove_friendly_object (this);	980	remove_friendly_object (this);
985		981
986	remove ();	982	remove ();
…		…
1011	attacked_by = 0;	1007	attacked_by = 0;
1012	current_weapon = 0;	1008	current_weapon = 0;
1013	}	1009	}
1014		1010
1015	void	1011	void
1016	object::destroy (bool destroy_inventory)	1012	object::destroy ()
1017	{	1013	{
1018	if (destroyed ())	1014	if (destroyed ())
1019	return;	1015	return;
1020		1016
1021	if (!is_head () && !head->destroyed ())	1017	if (!is_head () && !head->destroyed ())
1022	{	1018	{
1023	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");	1019	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1024	head->destroy (destroy_inventory);	1020	head->destroy ();
1025	return;	1021	return;
1026	}	1022	}
1027		1023
1028	destroy_inv (!destroy_inventory);	1024	destroy_inv (false);
1029		1025
1030	if (is_head ())	1026	if (is_head ())
1031	if (sound_destroy)	1027	if (sound_destroy)
1032	play_sound (sound_destroy);	1028	play_sound (sound_destroy);
1033	else if (flag [FLAG_MONSTER])	1029	else if (flag [FLAG_MONSTER])
…		…
1070	esrv_del_item (pl->contr, count);	1066	esrv_del_item (pl->contr, count);
1071	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1067	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1072		1068
1073	adjust_weight (env, -total_weight ());	1069	adjust_weight (env, -total_weight ());
1074		1070
1075	*(above ? &above->below : &env->inv) = below;	1071	object *pl = in_player ();
1076
1077	if (below)
1078	below->above = above;
1079		1072
1080	/* we set up values so that it could be inserted into	1073	/* we set up values so that it could be inserted into
1081	* the map, but we don't actually do that - it is up	1074	* the map, but we don't actually do that - it is up
1082	* to the caller to decide what we want to do.	1075	* to the caller to decide what we want to do.
1083	*/	1076	*/
1084	map = env->map;	1077	map = env->map;
1085	x = env->x;	1078	x = env->x;
1086	y = env->y;	1079	y = env->y;
		1080
		1081	// make sure cmov optimisation is applicable
		1082	*(above ? &above->below : &env->inv) = below;
		1083	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1084
1087	above = 0;	1085	above = 0;
1088	below = 0;	1086	below = 0;
1089	env = 0;	1087	env = 0;
1090		1088
1091	/* NO_FIX_PLAYER is set when a great many changes are being	1089	/* NO_FIX_PLAYER is set when a great many changes are being
1092	* made to players inventory. If set, avoiding the call	1090	* made to players inventory. If set, avoiding the call
1093	* to save cpu time.	1091	* to save cpu time.
1094	*/	1092	*/
1095	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1093	if (pl)
		1094	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1095	{
1096	otmp->update_stats ();	1096	pl->update_stats ();
		1097
		1098	if (glow_radius && pl->is_on_map ())
		1099	update_all_los (pl->map, pl->x, pl->y);
		1100	}
1097	}	1101	}
1098	else if (map)	1102	else if (map)
1099	{	1103	{
1100	map->dirty = true;	1104	map->dirty = true;
1101	mapspace &ms = this->ms ();	1105	mapspace &ms = this->ms ();
1102		1106
1103	if (object *pl = ms.player ())	1107	if (object *pl = ms.player ())
1104	{	1108	{
1105	if (type == PLAYER) // this == pl(!)	1109	if (is_player ())
1106	{	1110	{
		1111	if (!flag [FLAG_WIZPASS])
		1112	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1113
1107	// leaving a spot always closes any open container on the ground	1114	// leaving a spot always closes any open container on the ground
1108	if (container && !container->env)	1115	if (container && !container->env)
1109	// this causes spurious floorbox updates, but it ensures	1116	// this causes spurious floorbox updates, but it ensures
1110	// that the CLOSE event is being sent.	1117	// that the CLOSE event is being sent.
1111	close_container ();	1118	close_container ();
…		…
1121		1128
1122	esrv_del_item (pl->contr, count);	1129	esrv_del_item (pl->contr, count);
1123	}	1130	}
1124		1131
1125	/* link the object above us */	1132	/* link the object above us */
1126	if (above)	1133	// re-link, make sure compiler can easily use cmove
1127	above->below = below;	1134	*(above ? &above->below : &ms.top) = below;
1128	else	1135	*(below ? &below->above : &ms.bot) = above;
1129	ms.top = below; /* we were top, set new top */
1130
1131	/* Relink the object below us, if there is one */
1132	if (below)
1133	below->above = above;
1134	else
1135	{
1136	/* Nothing below, which means we need to relink map object for this space
1137	* use translated coordinates in case some oddness with map tiling is
1138	* evident
1139	*/
1140	if (GET_MAP_OB (map, x, y) != this)
1141	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 ());
1142
1143	ms.bot = above; /* goes on above it. */
1144	}
1145		1136
1146	above = 0;	1137	above = 0;
1147	below = 0;	1138	below = 0;
		1139
		1140	ms.invalidate ();
1148		1141
1149	if (map->in_memory == MAP_SAVING)	1142	if (map->in_memory == MAP_SAVING)
1150	return;	1143	return;
1151		1144
1152	int check_walk_off = !flag [FLAG_NO_APPLY];	1145	int check_walk_off = !flag [FLAG_NO_APPLY];
…		…
1159	* appropriately.	1152	* appropriately.
1160	*/	1153	*/
1161	pl->close_container ();	1154	pl->close_container ();
1162		1155
1163	//TODO: the floorbox prev/next might need updating	1156	//TODO: the floorbox prev/next might need updating
1164	esrv_del_item (pl->contr, count);	1157	//esrv_del_item (pl->contr, count);
		1158	//TODO: update floorbox to preserve ordering
		1159	if (pl->contr->ns)
		1160	pl->contr->ns->floorbox_update ();
1165	}	1161	}
1166		1162
1167	for (tmp = ms.bot; tmp; tmp = tmp->above)	1163	for (tmp = ms.bot; tmp; tmp = tmp->above)
1168	{	1164	{
1169	/* No point updating the players look faces if he is the object	1165	/* No point updating the players look faces if he is the object
…		…
1182	}	1178	}
1183		1179
1184	last = tmp;	1180	last = tmp;
1185	}	1181	}
1186		1182
1187	/* last == NULL if there are no objects on this space */	1183	if (affects_los ())
1188	//TODO: this makes little sense, why only update the topmost object?
1189	if (!last)
1190	map->at (x, y).flags_ = 0;
1191	else
1192	update_object (last, UP_OBJ_REMOVE);
1193
1194	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1195	update_all_los (map, x, y);	1184	update_all_los (map, x, y);
1196	}	1185	}
1197	}	1186	}
1198		1187
1199	/*	1188	/*
…		…
1223	esrv_update_item (UPD_NROF, pl, top);	1212	esrv_update_item (UPD_NROF, pl, top);
1224		1213
1225	op->weight = 0; // cancel the addition above	1214	op->weight = 0; // cancel the addition above
1226	op->carrying = 0; // must be 0 already	1215	op->carrying = 0; // must be 0 already
1227		1216
1228	op->destroy (1);	1217	op->destroy ();
1229		1218
1230	return top;	1219	return top;
1231	}	1220	}
1232		1221
1233	return 0;	1222	return 0;
…		…
1261	* job preparing multi-part monsters.	1250	* job preparing multi-part monsters.
1262	*/	1251	*/
1263	object *	1252	object *
1264	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1253	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1265	{	1254	{
		1255	op->remove ();
		1256
1266	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1257	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1267	{	1258	{
1268	tmp->x = x + tmp->arch->x;	1259	tmp->x = x + tmp->arch->x;
1269	tmp->y = y + tmp->arch->y;	1260	tmp->y = y + tmp->arch->y;
1270	}	1261	}
…		…
1293	* just 'op' otherwise	1284	* just 'op' otherwise
1294	*/	1285	*/
1295	object *	1286	object *
1296	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1287	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1297	{	1288	{
1298	assert (!op->flag [FLAG_FREED]);
1299
1300	op->remove ();	1289	op->remove ();
		1290
		1291	if (m == &freed_map)//D TODO: remove soon
		1292	{//D
		1293	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1294	}//D
1301		1295
1302	/* Ideally, the caller figures this out. However, it complicates a lot	1296	/* Ideally, the caller figures this out. However, it complicates a lot
1303	* of areas of callers (eg, anything that uses find_free_spot would now	1297	* of areas of callers (eg, anything that uses find_free_spot would now
1304	* need extra work	1298	* need extra work
1305	*/	1299	*/
		1300	maptile *newmap = m;
1306	if (!xy_normalise (m, op->x, op->y))	1301	if (!xy_normalise (newmap, op->x, op->y))
1307	{	1302	{
1308	op->destroy (1);	1303	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1309	return 0;	1304	return 0;
1310	}	1305	}
1311		1306
1312	if (object *more = op->more)	1307	if (object *more = op->more)
1313	if (!insert_ob_in_map (more, m, originator, flag))	1308	if (!insert_ob_in_map (more, m, originator, flag))
1314	return 0;	1309	return 0;
1315		1310
1316	CLEAR_FLAG (op, FLAG_REMOVED);	1311	op->flag [FLAG_REMOVED] = false;
1317		1312	op->env = 0;
1318	op->map = m;	1313	op->map = newmap;
		1314
1319	mapspace &ms = op->ms ();	1315	mapspace &ms = op->ms ();
1320		1316
1321	/* this has to be done after we translate the coordinates.	1317	/* this has to be done after we translate the coordinates.
1322	*/	1318	*/
1323	if (op->nrof && !(flag & INS_NO_MERGE))	1319	if (op->nrof && !(flag & INS_NO_MERGE))
1324	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1320	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1325	if (object::can_merge (op, tmp))	1321	if (object::can_merge (op, tmp))
1326	{	1322	{
1327	// TODO: we atcually want to update tmp, not op,	1323	// TODO: we actually want to update tmp, not op,
1328	// but some caller surely breaks when we return tmp	1324	// but some caller surely breaks when we return tmp
1329	// from here :/	1325	// from here :/
1330	op->nrof += tmp->nrof;	1326	op->nrof += tmp->nrof;
1331	tmp->destroy (1);	1327	tmp->destroy ();
1332	}	1328	}
1333		1329
1334	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1330	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1335	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1331	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1336		1332
…		…
1343	{	1339	{
1344	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1340	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1345	abort ();	1341	abort ();
1346	}	1342	}
1347		1343
		1344	if (!originator->is_on_map ())
		1345	{
		1346	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1347	op->debug_desc (), originator->debug_desc ());
		1348	abort ();
		1349	}
		1350
1348	op->above = originator;	1351	op->above = originator;
1349	op->below = originator->below;	1352	op->below = originator->below;
1350
1351	if (op->below)
1352	op->below->above = op;
1353	else
1354	ms.bot = op;
1355
1356	/* since *below* originator, no need to update top */
1357	originator->below = op;	1353	originator->below = op;
		1354
		1355	*(op->below ? &op->below->above : &ms.bot) = op;
1358	}	1356	}
1359	else	1357	else
1360	{	1358	{
1361	object *top, *floor = NULL;	1359	object *floor = 0;
1362		1360	object *top = ms.top;
1363	top = ms.bot;
1364		1361
1365	/* If there are other objects, then */	1362	/* If there are other objects, then */
1366	if (top)	1363	if (top)
1367	{	1364	{
1368	object *last = 0;
1369
1370	/*	1365	/*
1371	* If there are multiple objects on this space, we do some trickier handling.	1366	* If there are multiple objects on this space, we do some trickier handling.
1372	* We've already dealt with merging if appropriate.	1367	* We've already dealt with merging if appropriate.
1373	* Generally, we want to put the new object on top. But if	1368	* Generally, we want to put the new object on top. But if
1374	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1369	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1377	* once we get to them. This reduces the need to traverse over all of	1372	* once we get to them. This reduces the need to traverse over all of
1378	* them when adding another one - this saves quite a bit of cpu time	1373	* them when adding another one - this saves quite a bit of cpu time
1379	* when lots of spells are cast in one area. Currently, it is presumed	1374	* when lots of spells are cast in one area. Currently, it is presumed
1380	* that flying non pickable objects are spell objects.	1375	* that flying non pickable objects are spell objects.
1381	*/	1376	*/
1382	for (top = ms.bot; top; top = top->above)	1377	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1383	{	1378	{
1384	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1379	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1385	floor = top;	1380	floor = tmp;
1386		1381
1387	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1382	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1388	{	1383	{
1389	/* We insert above top, so we want this object below this */	1384	/* We insert above top, so we want this object below this */
1390	top = top->below;	1385	top = tmp->below;
1391	break;	1386	break;
1392	}	1387	}
1393		1388
1394	last = top;	1389	top = tmp;
1395	}	1390	}
1396
1397	/* Don't want top to be NULL, so set it to the last valid object */
1398	top = last;
1399		1391
1400	/* We let update_position deal with figuring out what the space	1392	/* We let update_position deal with figuring out what the space
1401	* looks like instead of lots of conditions here.	1393	* looks like instead of lots of conditions here.
1402	* makes things faster, and effectively the same result.	1394	* makes things faster, and effectively the same result.
1403	*/	1395	*/
…		…
1410	*/	1402	*/
1411	if (!(flag & INS_ON_TOP)	1403	if (!(flag & INS_ON_TOP)
1412	&& ms.flags () & P_BLOCKSVIEW	1404	&& ms.flags () & P_BLOCKSVIEW
1413	&& (op->face && !faces [op->face].visibility))	1405	&& (op->face && !faces [op->face].visibility))
1414	{	1406	{
		1407	object *last;
		1408
1415	for (last = top; last != floor; last = last->below)	1409	for (last = top; last != floor; last = last->below)
1416	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1410	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1417	break;	1411	break;
1418		1412
1419	/* Check to see if we found the object that blocks view,	1413	/* Check to see if we found the object that blocks view,
…		…
1427	} /* If objects on this space */	1421	} /* If objects on this space */
1428		1422
1429	if (flag & INS_ABOVE_FLOOR_ONLY)	1423	if (flag & INS_ABOVE_FLOOR_ONLY)
1430	top = floor;	1424	top = floor;
1431		1425
1432	/* Top is the object that our object (op) is going to get inserted above.	1426	// insert object above top, or bottom-most if top = 0
1433	*/
1434
1435	/* First object on this space */
1436	if (!top)	1427	if (!top)
1437	{	1428	{
		1429	op->below = 0;
1438	op->above = ms.bot;	1430	op->above = ms.bot;
1439
1440	if (op->above)
1441	op->above->below = op;
1442
1443	op->below = 0;
1444	ms.bot = op;	1431	ms.bot = op;
		1432
		1433	*(op->above ? &op->above->below : &ms.top) = op;
1445	}	1434	}
1446	else	1435	else
1447	{ /* get inserted into the stack above top */	1436	{
1448	op->above = top->above;	1437	op->above = top->above;
1449
1450	if (op->above)
1451	op->above->below = op;	1438	top->above = op;
1452		1439
1453	op->below = top;	1440	op->below = top;
1454	top->above = op;	1441	*(op->above ? &op->above->below : &ms.top) = op;
1455	}	1442	}
		1443	}
1456		1444
1457	if (!op->above)	1445	if (op->is_player ())
1458	ms.top = op;
1459	} /* else not INS_BELOW_ORIGINATOR */
1460
1461	if (op->type == PLAYER)
1462	{	1446	{
1463	op->contr->do_los = 1;	1447	op->contr->do_los = 1;
1464	++op->map->players;	1448	++op->map->players;
1465	op->map->touch ();	1449	op->map->touch ();
1466	}	1450	}
1467		1451
1468	op->map->dirty = true;	1452	op->map->dirty = true;
1469		1453
1470	if (object *pl = ms.player ())	1454	if (object *pl = ms.player ())
1471	//TODO: the floorbox prev/next might need updating	1455	//TODO: the floorbox prev/next might need updating
1472	esrv_send_item (pl, op);	1456	//esrv_send_item (pl, op);
		1457	//TODO: update floorbox to preserve ordering
		1458	if (pl->contr->ns)
		1459	pl->contr->ns->floorbox_update ();
1473		1460
1474	/* If this object glows, it may affect lighting conditions that are	1461	/* If this object glows, it may affect lighting conditions that are
1475	* visible to others on this map. But update_all_los is really	1462	* visible to others on this map. But update_all_los is really
1476	* an inefficient way to do this, as it means los for all players	1463	* an inefficient way to do this, as it means los for all players
1477	* on the map will get recalculated. The players could very well	1464	* on the map will get recalculated. The players could very well
1478	* be far away from this change and not affected in any way -	1465	* be far away from this change and not affected in any way -
1479	* this should get redone to only look for players within range,	1466	* this should get redone to only look for players within range,
1480	* or just updating the P_UPTODATE for spaces within this area	1467	* or just updating the P_UPTODATE for spaces within this area
1481	* of effect may be sufficient.	1468	* of effect may be sufficient.
1482	*/	1469	*/
1483	if (op->map->darkness && (op->glow_radius != 0))	1470	if (op->affects_los ())
		1471	{
		1472	op->ms ().invalidate ();
1484	update_all_los (op->map, op->x, op->y);	1473	update_all_los (op->map, op->x, op->y);
		1474	}
1485		1475
1486	/* updates flags (blocked, alive, no magic, etc) for this map space */	1476	/* updates flags (blocked, alive, no magic, etc) for this map space */
1487	update_object (op, UP_OBJ_INSERT);	1477	update_object (op, UP_OBJ_INSERT);
1488		1478
1489	INVOKE_OBJECT (INSERT, op);	1479	INVOKE_OBJECT (INSERT, op);
…		…
1496	* blocked() and wall() work properly), and these flags are updated by	1486	* blocked() and wall() work properly), and these flags are updated by
1497	* update_object().	1487	* update_object().
1498	*/	1488	*/
1499		1489
1500	/* if this is not the head or flag has been passed, don't check walk on status */	1490	/* if this is not the head or flag has been passed, don't check walk on status */
1501	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1491	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1502	{	1492	{
1503	if (check_move_on (op, originator))	1493	if (check_move_on (op, originator))
1504	return 0;	1494	return 0;
1505		1495
1506	/* If we are a multi part object, lets work our way through the check	1496	/* If we are a multi part object, lets work our way through the check
…		…
1517	/* this function inserts an object in the map, but if it	1507	/* this function inserts an object in the map, but if it
1518	* finds an object of its own type, it'll remove that one first.	1508	* finds an object of its own type, it'll remove that one first.
1519	* op is the object to insert it under: supplies x and the map.	1509	* op is the object to insert it under: supplies x and the map.
1520	*/	1510	*/
1521	void	1511	void
1522	replace_insert_ob_in_map (const char *arch_string, object *op)	1512	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1523	{	1513	{
1524	/* first search for itself and remove any old instances */	1514	/* first search for itself and remove any old instances */
1525		1515
1526	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1516	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1527	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1517	if (tmp->arch->archname == archname) /* same archetype */
1528	tmp->destroy (1);	1518	tmp->destroy ();
1529		1519
1530	object *tmp = arch_to_object (archetype::find (arch_string));	1520	object *tmp = arch_to_object (archetype::find (archname));
1531		1521
1532	tmp->x = op->x;	1522	tmp->x = op->x;
1533	tmp->y = op->y;	1523	tmp->y = op->y;
1534		1524
1535	insert_ob_in_map (tmp, op->map, op, 0);	1525	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1557	if (!nr)	1547	if (!nr)
1558	return true;	1548	return true;
1559		1549
1560	nr = min (nr, nrof);	1550	nr = min (nr, nrof);
1561		1551
		1552	if (nrof > nr)
		1553	{
1562	nrof -= nr;	1554	nrof -= nr;
1563
1564	if (nrof)
1565	{
1566	adjust_weight (env, -weight * nr); // carrying == 0	1555	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1567		1556
1568	if (object *pl = visible_to ())	1557	if (object *pl = visible_to ())
1569	esrv_update_item (UPD_NROF, pl, this);	1558	esrv_update_item (UPD_NROF, pl, this);
1570		1559
1571	return true;	1560	return true;
1572	}	1561	}
1573	else	1562	else
1574	{	1563	{
1575	destroy (1);	1564	destroy ();
1576	return false;	1565	return false;
1577	}	1566	}
1578	}	1567	}
1579		1568
1580	/*	1569	/*
…		…
1597	}	1586	}
1598	else	1587	else
1599	{	1588	{
1600	decrease (nr);	1589	decrease (nr);
1601		1590
1602	object *op = object_create_clone (this);	1591	object *op = deep_clone ();
1603	op->nrof = nr;	1592	op->nrof = nr;
1604	return op;	1593	return op;
1605	}	1594	}
1606	}	1595	}
1607		1596
…		…
1657	if (object *pl = tmp->visible_to ())	1646	if (object *pl = tmp->visible_to ())
1658	esrv_update_item (UPD_NROF, pl, tmp);	1647	esrv_update_item (UPD_NROF, pl, tmp);
1659		1648
1660	adjust_weight (this, op->total_weight ());	1649	adjust_weight (this, op->total_weight ());
1661		1650
1662	op->destroy (1);	1651	op->destroy ();
1663	op = tmp;	1652	op = tmp;
1664	goto inserted;	1653	goto inserted;
1665	}	1654	}
1666		1655
1667	op->owner = 0; // it's his/hers now. period.	1656	op->owner = 0; // it's his/hers now. period.
…		…
1685		1674
1686	adjust_weight (this, op->total_weight ());	1675	adjust_weight (this, op->total_weight ());
1687		1676
1688	inserted:	1677	inserted:
1689	/* reset the light list and los of the players on the map */	1678	/* reset the light list and los of the players on the map */
1690	if (op->glow_radius && map && map->darkness)	1679	if (op->glow_radius && is_on_map ())
		1680	{
		1681	update_stats ();
1691	update_all_los (map, x, y);	1682	update_all_los (map, x, y);
1692		1683	}
		1684	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1693	// if this is a player's inventory, update stats	1685	// if this is a player's inventory, update stats
1694	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1695	update_stats ();	1686	update_stats ();
1696		1687
1697	INVOKE_OBJECT (INSERT, this);	1688	INVOKE_OBJECT (INSERT, this);
1698		1689
1699	return op;	1690	return op;
…		…
1720	* on top.	1711	* on top.
1721	*/	1712	*/
1722	int	1713	int
1723	check_move_on (object *op, object *originator)	1714	check_move_on (object *op, object *originator)
1724	{	1715	{
		1716	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1717	return 0;
		1718
1725	object *tmp;	1719	object *tmp;
1726	maptile *m = op->map;	1720	maptile *m = op->map;
1727	int x = op->x, y = op->y;	1721	int x = op->x, y = op->y;
1728		1722
1729	MoveType move_on, move_slow, move_block;	1723	mapspace &ms = m->at (x, y);
1730		1724
1731	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1725	ms.update ();
1732	return 0;
1733		1726
1734	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1727	MoveType move_on = ms.move_on;
1735	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1728	MoveType move_slow = ms.move_slow;
1736	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1729	MoveType move_block = ms.move_block;
1737		1730
1738	/* if nothing on this space will slow op down or be applied,	1731	/* if nothing on this space will slow op down or be applied,
1739	* no need to do checking below. have to make sure move_type	1732	* no need to do checking below. have to make sure move_type
1740	* is set, as lots of objects don't have it set - we treat that	1733	* is set, as lots of objects don't have it set - we treat that
1741	* as walking.	1734	* as walking.
…		…
1752	return 0;	1745	return 0;
1753		1746
1754	/* The objects have to be checked from top to bottom.	1747	/* The objects have to be checked from top to bottom.
1755	* Hence, we first go to the top:	1748	* Hence, we first go to the top:
1756	*/	1749	*/
1757		1750	for (object *next, *tmp = ms.top; tmp; tmp = next)
1758	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1759	{
1760	/* Trim the search when we find the first other spell effect
1761	* this helps performance so that if a space has 50 spell objects,
1762	* we don't need to check all of them.
1763	*/
1764	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1765	break;
1766	}	1751	{
		1752	next = tmp->below;
1767		1753
1768	for (; tmp; tmp = tmp->below)
1769	{
1770	if (tmp == op)	1754	if (tmp == op)
1771	continue; /* Can't apply yourself */	1755	continue; /* Can't apply yourself */
1772		1756
1773	/* Check to see if one of the movement types should be slowed down.	1757	/* Check to see if one of the movement types should be slowed down.
1774	* Second check makes sure that the movement types not being slowed	1758	* Second check makes sure that the movement types not being slowed
…		…
1779	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1763	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1780	{	1764	{
1781	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1765	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1782	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1766	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1783	{	1767	{
1784
1785	float
1786	diff = tmp->move_slow_penalty * fabs (op->speed);	1768	float diff = tmp->move_slow_penalty * fabs (op->speed);
1787		1769
1788	if (op->type == PLAYER)	1770	if (op->is_player ())
1789	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1771	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1790	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1772	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1791	diff /= 4.0;	1773	diff /= 4.0;
1792		1774
1793	op->speed_left -= diff;	1775	op->speed_left -= diff;
1794	}	1776	}
1795	}	1777	}
…		…
1828	LOG (llevError, "Present_arch called outside map.\n");	1810	LOG (llevError, "Present_arch called outside map.\n");
1829	return NULL;	1811	return NULL;
1830	}	1812	}
1831		1813
1832	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)
1833	if (tmp->arch == at)	1815	if (tmp->arch->archname == at->archname)
1834	return tmp;	1816	return tmp;
1835		1817
1836	return NULL;	1818	return NULL;
1837	}	1819	}
1838		1820
…		…
1902	* The first matching object is returned, or NULL if none.	1884	* The first matching object is returned, or NULL if none.
1903	*/	1885	*/
1904	object *	1886	object *
1905	present_arch_in_ob (const archetype *at, const object *op)	1887	present_arch_in_ob (const archetype *at, const object *op)
1906	{	1888	{
1907	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1889	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1908	if (tmp->arch == at)	1890	if (tmp->arch->archname == at->archname)
1909	return tmp;	1891	return tmp;
1910		1892
1911	return NULL;	1893	return NULL;
1912	}	1894	}
1913		1895
…		…
2001	* head of the object should correspond for the entire object.	1983	* head of the object should correspond for the entire object.
2002	*/	1984	*/
2003	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1985	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2004	continue;	1986	continue;
2005		1987
2006	if (ob->blocked (m, pos.x, pos.y))	1988	if (ob->blocked (pos.m, pos.x, pos.y))
2007	continue;	1989	continue;
2008		1990
2009	altern [index++] = i;	1991	altern [index++] = i;
2010	}	1992	}
2011		1993
…		…
2079	* there is capable of.	2061	* there is capable of.
2080	*/	2062	*/
2081	int	2063	int
2082	find_dir (maptile *m, int x, int y, object *exclude)	2064	find_dir (maptile *m, int x, int y, object *exclude)
2083	{	2065	{
2084	int i, max = SIZEOFFREE, mflags;	2066	int max = SIZEOFFREE, mflags;
2085
2086	sint16 nx, ny;
2087	object *tmp;
2088	maptile *mp;
2089
2090	MoveType blocked, move_type;	2067	MoveType move_type;
2091		2068
2092	if (exclude && exclude->head_ () != exclude)	2069	if (exclude && exclude->head_ () != exclude)
2093	{	2070	{
2094	exclude = exclude->head;	2071	exclude = exclude->head;
2095	move_type = exclude->move_type;	2072	move_type = exclude->move_type;
…		…
2098	{	2075	{
2099	/* 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. */
2100	move_type = MOVE_ALL;	2077	move_type = MOVE_ALL;
2101	}	2078	}
2102		2079
2103	for (i = 1; i < max; i++)	2080	for (int i = 1; i < max; i++)
2104	{	2081	{
2105	mp = m;	2082	mapxy pos (m, x, y);
2106	nx = x + freearr_x[i];	2083	pos.move (i);
2107	ny = y + freearr_y[i];
2108		2084
2109	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2085	if (!pos.normalise ())
2110
2111	if (mflags & P_OUT_OF_MAP)
2112	max = maxfree[i];	2086	max = maxfree[i];
2113	else	2087	else
2114	{	2088	{
2115	mapspace &ms = mp->at (nx, ny);	2089	mapspace &ms = *pos;
2116		2090
2117	blocked = ms.move_block;
2118
2119	if ((move_type & blocked) == move_type)	2091	if ((move_type & ms.move_block) == move_type)
2120	max = maxfree[i];	2092	max = maxfree [i];
2121	else if (mflags & P_IS_ALIVE)	2093	else if (ms.flags () & P_IS_ALIVE)
2122	{	2094	{
2123	for (tmp = ms.bot; tmp; tmp = tmp->above)	2095	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2124	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2096	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2125	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2097	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2126	break;
2127
2128	if (tmp)
2129	return freedir[i];	2098	return freedir [i];
2130	}	2099	}
2131	}	2100	}
2132	}	2101	}
2133		2102
2134	return 0;	2103	return 0;
…		…
2209	* 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
2210	* 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.
2211	* 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
2212	* functions.	2181	* functions.
2213	*/	2182	*/
2214	int reduction_dir[SIZEOFFREE][3] = {	2183	const int reduction_dir[SIZEOFFREE][3] = {
2215	{0, 0, 0}, /* 0 */	2184	{0, 0, 0}, /* 0 */
2216	{0, 0, 0}, /* 1 */	2185	{0, 0, 0}, /* 1 */
2217	{0, 0, 0}, /* 2 */	2186	{0, 0, 0}, /* 2 */
2218	{0, 0, 0}, /* 3 */	2187	{0, 0, 0}, /* 3 */
2219	{0, 0, 0}, /* 4 */	2188	{0, 0, 0}, /* 4 */
…		…
2315	int	2284	int
2316	can_pick (const object *who, const object *item)	2285	can_pick (const object *who, const object *item)
2317	{	2286	{
2318	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2287	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2319	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2288	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2320	!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));
2321	}	2290	}
2322		2291
2323	/*	2292	/*
2324	* create clone from object to another	2293	* create clone from object to another
2325	*/	2294	*/
2326	object *	2295	object *
2327	object_create_clone (object *asrc)	2296	object::deep_clone ()
2328	{	2297	{
		2298	assert (("deep_clone called on non-head object", is_head ()));
		2299
2329	object *dst = 0;	2300	object *dst = clone ();
2330		2301
2331	if (!asrc)
2332	return 0;
2333
2334	object *src = asrc->head_ ();
2335
2336	object *prev = 0;	2302	object *prev = dst;
2337	for (object *part = src; part; part = part->more)	2303	for (object *part = this->more; part; part = part->more)
2338	{	2304	{
2339	object *tmp = part->clone ();	2305	object *tmp = part->clone ();
2340
2341	tmp->x -= src->x;
2342	tmp->y -= src->y;
2343
2344	if (!part->head)
2345	{
2346	dst = tmp;
2347	tmp->head = 0;
2348	}
2349	else
2350	tmp->head = dst;	2306	tmp->head = dst;
2351
2352	tmp->more = 0;
2353
2354	if (prev)
2355	prev->more = tmp;	2307	prev->more = tmp;
2356
2357	prev = tmp;	2308	prev = tmp;
2358	}	2309	}
2359		2310
2360	for (object *item = src->inv; item; item = item->below)	2311	for (object *item = inv; item; item = item->below)
2361	insert_ob_in_ob (object_create_clone (item), dst);	2312	insert_ob_in_ob (item->deep_clone (), dst);
2362		2313
2363	return dst;	2314	return dst;
2364	}	2315	}
2365		2316
2366	/* This returns the first object in who's inventory that	2317	/* This returns the first object in who's inventory that
…		…
2375	return tmp;	2326	return tmp;
2376		2327
2377	return 0;	2328	return 0;
2378	}	2329	}
2379		2330
2380	/* If ob has a field named key, return the link from the list,	2331	shstr_tmp
2381	* otherwise return NULL.	2332	object::kv_get (shstr_tmp key) const
2382	*
2383	* key must be a passed in shared string - otherwise, this won't
2384	* do the desired thing.
2385	*/
2386	key_value *
2387	get_ob_key_link (const object *ob, const char *key)
2388	{	2333	{
2389	for (key_value *link = ob->key_values; link; link = link->next)	2334	for (key_value *kv = key_values; kv; kv = kv->next)
2390	if (link->key == key)	2335	if (kv->key == key)
2391	return link;
2392
2393	return 0;
2394	}
2395
2396	/*
2397	* Returns the value of op has an extra_field for key, or NULL.
2398	*
2399	* The argument doesn't need to be a shared string.
2400	*
2401	* The returned string is shared.
2402	*/
2403	const char *
2404	get_ob_key_value (const object *op, const char *const key)
2405	{
2406	key_value *link;
2407	shstr_cmp canonical_key (key);
2408
2409	if (!canonical_key)
2410	{
2411	/* 1. There being a field named key on any object
2412	* implies there'd be a shared string to find.
2413	* 2. Since there isn't, no object has this field.
2414	* 3. Therefore, *this* object doesn't have this field.
2415	*/
2416	return 0;
2417	}
2418
2419	/* This is copied from get_ob_key_link() above -
2420	* only 4 lines, and saves the function call overhead.
2421	*/
2422	for (link = op->key_values; link; link = link->next)
2423	if (link->key == canonical_key)
2424	return link->value;	2336	return kv->value;
2425		2337
2426	return 0;	2338	return shstr ();
2427	}	2339	}
2428		2340
2429	/*	2341	void
2430	* Updates the canonical_key in op to value.	2342	object::kv_set (shstr_tmp key, shstr_tmp value)
2431	*
2432	* canonical_key is a shared string (value doesn't have to be).
2433	*
2434	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2435	* keys.
2436	*
2437	* Returns TRUE on success.
2438	*/
2439	int
2440	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2441	{	2343	{
2442	key_value *field = NULL, *last = NULL;	2344	for (key_value *kv = key_values; kv; kv = kv->next)
2443		2345	if (kv->key == key)
2444	for (field = op->key_values; field != NULL; field = field->next)
2445	{
2446	if (field->key != canonical_key)
2447	{	2346	{
2448	last = field;	2347	kv->value = value;
2449	continue;	2348	return;
2450	}	2349	}
2451		2350
2452	if (value)	2351	key_value *kv = new key_value;
2453	field->value = value;	2352
2454	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)
2455	{	2365	{
2456	/* Basically, if the archetype has this key set,	2366	key_value *kv = *kvp;
2457	* we need to store the null value so when we save	2367	*kvp = (*kvp)->next;
2458	* it, we save the empty value so that when we load,	2368	delete kv;
2459	* we get this value back again.	2369	return;
2460	*/
2461	if (get_ob_key_link (op->arch, canonical_key))
2462	field->value = 0;
2463	else
2464	{
2465	if (last)
2466	last->next = field->next;
2467	else
2468	op->key_values = field->next;
2469
2470	delete field;
2471	}
2472	}	2370	}
2473	return TRUE;
2474	}
2475	/* IF we get here, key doesn't exist */
2476
2477	/* No field, we'll have to add it. */
2478
2479	if (!add_key)
2480	return FALSE;
2481
2482	/* There isn't any good reason to store a null
2483	* value in the key/value list. If the archetype has
2484	* this key, then we should also have it, so shouldn't
2485	* be here. If user wants to store empty strings,
2486	* should pass in ""
2487	*/
2488	if (value == NULL)
2489	return TRUE;
2490
2491	field = new key_value;
2492
2493	field->key = canonical_key;
2494	field->value = value;
2495	/* Usual prepend-addition. */
2496	field->next = op->key_values;
2497	op->key_values = field;
2498
2499	return TRUE;
2500	}
2501
2502	/*
2503	* Updates the key in op to value.
2504	*
2505	* If add_key is FALSE, this will only update existing keys,
2506	* and not add new ones.
2507	* In general, should be little reason FALSE is ever passed in for add_key
2508	*
2509	* Returns TRUE on success.
2510	*/
2511	int
2512	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2513	{
2514	shstr key_ (key);
2515
2516	return set_ob_key_value_s (op, key_, value, add_key);
2517	}	2371	}
2518		2372
2519	object::depth_iterator::depth_iterator (object *container)	2373	object::depth_iterator::depth_iterator (object *container)
2520	: iterator_base (container)	2374	: iterator_base (container)
2521	{	2375	{
…		…
2571	{	2425	{
2572	char flagdesc[512];	2426	char flagdesc[512];
2573	char info2[256 * 4];	2427	char info2[256 * 4];
2574	char *p = info;	2428	char *p = info;
2575		2429
2576	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}",
2577	count,	2431	count,
2578	uuid.c_str (),	2432	uuid.c_str (),
2579	&name,	2433	&name,
2580	title ? "\",title:\"" : "",	2434	title ? ",title:\"" : "",
2581	title ? (const char *)title : "",	2435	title ? (const char *)title : "",
		2436	title ? "\"" : "",
2582	flag_desc (flagdesc, 512), type);	2437	flag_desc (flagdesc, 512), type);
2583		2438
2584	if (!flag[FLAG_REMOVED] && env)	2439	if (!flag[FLAG_REMOVED] && env)
2585	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2440	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2586		2441
…		…
2642	container = 0;	2497	container = 0;
2643		2498
2644	// 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
2645	esrv_update_item (UPD_FLAGS, this, old_container);	2500	esrv_update_item (UPD_FLAGS, this, old_container);
2646		2501
2647	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 ());
2648	play_sound (sound_find ("chest_close"));	2503	play_sound (sound_find ("chest_close"));
2649	}	2504	}
2650		2505
2651	if (new_container)	2506	if (new_container)
2652	{	2507	{
…		…
2662	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2517	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2663	new_container->insert (closer);	2518	new_container->insert (closer);
2664	}	2519	}
2665	#endif	2520	#endif
2666		2521
2667	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 ());
2668		2523
2669	// 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
2670	esrv_send_item (this, new_container);	2525	esrv_send_item (this, new_container);
2671		2526
2672	new_container->flag [FLAG_APPLIED] = true;	2527	new_container->flag [FLAG_APPLIED] = true;
…		…
2680	// else if (!old_container->env && contr && contr->ns)	2535	// else if (!old_container->env && contr && contr->ns)
2681	// contr->ns->floorbox_reset ();	2536	// contr->ns->floorbox_reset ();
2682	}	2537	}
2683		2538
2684	object *	2539	object *
2685	object::force_find (const shstr name)	2540	object::force_find (shstr_tmp name)
2686	{	2541	{
2687	/* 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
2688	* place	2543	* place
2689	*/	2544	*/
2690	for (object *tmp = inv; tmp; tmp = tmp->below)	2545	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2692	return splay (tmp);	2547	return splay (tmp);
2693		2548
2694	return 0;	2549	return 0;
2695	}	2550	}
2696		2551
2697	void	2552	object *
2698	object::force_add (const shstr name, int duration)	2553	object::force_add (shstr_tmp name, int duration)
2699	{	2554	{
2700	if (object *force = force_find (name))	2555	if (object *force = force_find (name))
2701	force->destroy ();	2556	force->destroy ();
2702		2557
2703	object *force = get_archetype (FORCE_NAME);	2558	object *force = get_archetype (FORCE_NAME);
…		…
2708		2563
2709	force->set_speed (duration ? 1.f / duration : 0.f);	2564	force->set_speed (duration ? 1.f / duration : 0.f);
2710	force->flag [FLAG_IS_USED_UP] = true;	2565	force->flag [FLAG_IS_USED_UP] = true;
2711	force->flag [FLAG_APPLIED] = true;	2566	force->flag [FLAG_APPLIED] = true;
2712		2567
2713	insert (force);	2568	return insert (force);
2714	}	2569	}
2715		2570
2716	void	2571	void
2717	object::play_sound (faceidx sound)	2572	object::play_sound (faceidx sound) const
2718	{	2573	{
2719	if (!sound)	2574	if (!sound)
2720	return;	2575	return;
2721		2576
2722	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 ())
2723	return;	2602	return;
2724		2603
2725	if (env)	2604	// find old force, or create new one
2726	{	2605	object *force = force_find (shstr_noise_force);
2727	if (object *pl = in_player ())	2606
2728	pl->contr->play_sound (sound);	2607	if (force)
2729	}	2608	force->speed_left = -1.f; // patch old speed up
2730	else	2609	else
2731	map->play_sound (sound, x, y);	2610	{
2732	}	2611	force = archetype::get (shstr_noise_force);
2733		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