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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.253 by root, Sun Aug 17 22:46:26 2008 UTC vs.
Revision 1.293 by root, Wed Oct 21 00:44:39 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] = {
…		…
186	\|\| ob1->speed != ob2->speed	188	\|\| ob1->speed != ob2->speed
187	\|\| ob1->value != ob2->value	189	\|\| ob1->value != ob2->value
188	\|\| ob1->name != ob2->name)	190	\|\| ob1->name != ob2->name)
189	return 0;	191	return 0;
190		192
191	/* Do not merge objects if nrof would overflow. First part checks	193	/* Do not merge objects if nrof would overflow, assume nrof
192	* for unsigned overflow (2c), second part checks whether the result	194	* is always 0 .. 2*31-1 /
193	* would fit into a 32 bit signed int, which is often used to hold	195	if (ob1->nrof > 0x7fffffff - ob2->nrof)
194	* nrof values.
195	*/
196	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
197	return 0;	196	return 0;
198		197
199	/* If the objects have been identified, set the BEEN_APPLIED flag.	198	/* If the objects have been identified, set the BEEN_APPLIED flag.
200	* 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
201	* 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
…		…
235	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	234	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
236	return 0;	235	return 0;
237		236
238	if ((ob1->flag ^ ob2->flag)	237	if ((ob1->flag ^ ob2->flag)
239	.reset (FLAG_INV_LOCKED)	238	.reset (FLAG_INV_LOCKED)
240	.reset (FLAG_CLIENT_SENT)
241	.reset (FLAG_REMOVED)	239	.reset (FLAG_REMOVED)
242	.any ())	240	.any ())
243	return 0;	241	return 0;
244		242
245	/* This is really a spellbook check - we should in general	243	/* This is really a spellbook check - we should in general
…		…
327	{	325	{
328	// see if we are in a container of sorts	326	// see if we are in a container of sorts
329	if (env)	327	if (env)
330	{	328	{
331	// the player inventory itself is always visible	329	// the player inventory itself is always visible
332	if (env->type == PLAYER)	330	if (env->is_player ())
333	return env;	331	return env;
334		332
335	// else a player could have our env open	333	// else a player could have our env open
336	object *envest = env->outer_env ();	334	object *envest = env->outer_env_or_self ();
337		335
338	// 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
339	// even if our inv is in a player.	337	// even if our inv is in a player.
340	if (envest->is_on_map ())	338	if (envest->is_on_map ())
341	if (object *pl = envest->ms ().player ())	339	if (object *pl = envest->ms ().player ())
342	if (pl->container == env)	340	if (pl->container_ () == env)
343	return pl;	341	return pl;
344	}	342	}
345	else	343	else
346	{	344	{
347	// maybe there is a player standing on the same mapspace	345	// maybe there is a player standing on the same mapspace
348	// this will catch the case where "this" is a player	346	// this will catch the case where "this" is a player
349	if (object *pl = ms ().player ())	347	if (object *pl = ms ().player ())
350	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)	348	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
351	\|\| this == pl->container)	349	\|\| pl->container_ () == this)
352	return pl;	350	return pl;
353	}	351	}
354	}	352	}
355		353
356	return 0;	354	return 0;
…		…
432	return strdup ("[NULLOBJ]");	430	return strdup ("[NULLOBJ]");
433		431
434	object_freezer freezer;	432	object_freezer freezer;
435	op->write (freezer);	433	op->write (freezer);
436	return freezer.as_string ();	434	return freezer.as_string ();
		435	}
		436
		437	char *
		438	object::as_string ()
		439	{
		440	return dump_object (this);
437	}	441	}
438		442
439	/*	443	/*
440	* 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
441	* multi-object 1 which is closest to the second object.	445	* multi-object 1 which is closest to the second object.
…		…
558	update_stats ();	562	update_stats ();
559		563
560	new_draw_info_format (NDI_UNIQUE, 0, this,	564	new_draw_info_format (NDI_UNIQUE, 0, this,
561	"You try to balance all your items at once, "	565	"You try to balance all your items at once, "
562	"but the %s is just too much for your body. "	566	"but the %s is just too much for your body. "
563	"[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);
564	return false;	569	return false;
565	}	570	}
566		571
567	//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);
568	}	573	}
…		…
640	}	645	}
641		646
642	if (speed < 0)	647	if (speed < 0)
643	dst->speed_left -= rndm ();	648	dst->speed_left -= rndm ();
644		649
645	dst->set_speed (dst->speed);	650	dst->activate ();
646	}	651	}
647		652
648	void	653	void
649	object::instantiate ()	654	object::instantiate ()
650	{	655	{
…		…
762	else if (action == UP_OBJ_INSERT)	767	else if (action == UP_OBJ_INSERT)
763	{	768	{
764	// this is likely overkill, TODO: revisit (schmorp)	769	// this is likely overkill, TODO: revisit (schmorp)
765	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	770	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
766	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	771	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
767	\|\| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	772	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
768	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	773	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
769	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	774	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
770	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	775	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
771	\|\| (m.move_on \| op->move_on ) != m.move_on	776	\|\| (m.move_on \| op->move_on ) != m.move_on
772	\|\| (m.move_off \| op->move_off ) != m.move_off	777	\|\| (m.move_off \| op->move_off ) != m.move_off
…		…
774	/* 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
775	* have move_allow right now.	780	* have move_allow right now.
776	*/	781	*/
777	\|\| ((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
778	\|\| 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)
779	m.flags_ = 0;	784	m.invalidate ();
780	}	785	}
781	/* if the object is being removed, we can't make intelligent	786	/* if the object is being removed, we can't make intelligent
782	* decisions, because remove_ob can't really pass the object	787	* decisions, because remove_ob can't really pass the object
783	* that is being removed.	788	* that is being removed.
784	*/	789	*/
785	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	790	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
786	m.flags_ = 0;	791	m.invalidate ();
787	else if (action == UP_OBJ_FACE)	792	else if (action == UP_OBJ_FACE)
788	/* Nothing to do for that case */ ;	793	/* Nothing to do for that case */ ;
789	else	794	else
790	LOG (llevError, "update_object called with invalid action: %d\n", action);	795	LOG (llevError, "update_object called with invalid action: %d\n", action);
791		796
…		…
795		800
796	object::object ()	801	object::object ()
797	{	802	{
798	SET_FLAG (this, FLAG_REMOVED);	803	SET_FLAG (this, FLAG_REMOVED);
799		804
800	expmul = 1.0;	805	//expmul = 1.0; declared const for the time being
801	face = blank_face;	806	face = blank_face;
802	}	807	}
803		808
804	object::~object ()	809	object::~object ()
805	{	810	{
…		…
835	/* If already on active list, don't do anything */	840	/* If already on active list, don't do anything */
836	if (active)	841	if (active)
837	return;	842	return;
838		843
839	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
840	actives.insert (this);	849	actives.insert (this);
		850	}
841	}	851	}
842		852
843	void	853	void
844	object::activate_recursive ()	854	object::activate_recursive ()
845	{	855	{
…		…
910	\|\| map->in_memory != MAP_ACTIVE	920	\|\| map->in_memory != MAP_ACTIVE
911	\|\| map->no_drop	921	\|\| map->no_drop
912	\|\| ms ().move_block == MOVE_ALL)	922	\|\| ms ().move_block == MOVE_ALL)
913	{	923	{
914	while (inv)	924	while (inv)
915	inv->destroy (true);	925	inv->destroy ();
916	}	926	}
917	else	927	else
918	{ /* Put objects in inventory onto this space */	928	{ /* Put objects in inventory onto this space */
919	while (inv)	929	while (inv)
920	{	930	{
…		…
924	\|\| op->flag [FLAG_NO_DROP]	934	\|\| op->flag [FLAG_NO_DROP]
925	\|\| op->type == RUNE	935	\|\| op->type == RUNE
926	\|\| op->type == TRAP	936	\|\| op->type == TRAP
927	\|\| op->flag [FLAG_IS_A_TEMPLATE]	937	\|\| op->flag [FLAG_IS_A_TEMPLATE]
928	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	938	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
929	op->destroy (true);	939	op->destroy ();
930	else	940	else
931	map->insert (op, x, y);	941	map->insert (op, x, y);
932	}	942	}
933	}	943	}
934	}	944	}
…		…
963		973
964	void	974	void
965	object::do_destroy ()	975	object::do_destroy ()
966	{	976	{
967	if (flag [FLAG_IS_LINKED])	977	if (flag [FLAG_IS_LINKED])
968	remove_button_link (this);	978	remove_link ();
969		979
970	if (flag [FLAG_FRIENDLY])	980	if (flag [FLAG_FRIENDLY])
971	remove_friendly_object (this);	981	remove_friendly_object (this);
972		982
973	remove ();	983	remove ();
…		…
998	attacked_by = 0;	1008	attacked_by = 0;
999	current_weapon = 0;	1009	current_weapon = 0;
1000	}	1010	}
1001		1011
1002	void	1012	void
1003	object::destroy (bool destroy_inventory)	1013	object::destroy ()
1004	{	1014	{
1005	if (destroyed ())	1015	if (destroyed ())
1006	return;	1016	return;
1007		1017
1008	if (!is_head () && !head->destroyed ())	1018	if (!is_head () && !head->destroyed ())
1009	{	1019	{
1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1020	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1011	head->destroy (destroy_inventory);	1021	head->destroy ();
1012	return;	1022	return;
1013	}	1023	}
1014		1024
1015	destroy_inv (!destroy_inventory);	1025	destroy_inv (false);
1016		1026
1017	if (is_head ())	1027	if (is_head ())
1018	if (sound_destroy)	1028	if (sound_destroy)
1019	play_sound (sound_destroy);	1029	play_sound (sound_destroy);
1020	else if (flag [FLAG_MONSTER])	1030	else if (flag [FLAG_MONSTER])
…		…
1031	* the previous environment.	1041	* the previous environment.
1032	*/	1042	*/
1033	void	1043	void
1034	object::do_remove ()	1044	object::do_remove ()
1035	{	1045	{
1036	object tmp, last = 0;
1037	object *otmp;
1038
1039	if (flag [FLAG_REMOVED])	1046	if (flag [FLAG_REMOVED])
1040	return;	1047	return;
1041		1048
1042	INVOKE_OBJECT (REMOVE, this);	1049	INVOKE_OBJECT (REMOVE, this);
1043		1050
…		…
1056	if (object *pl = visible_to ())	1063	if (object *pl = visible_to ())
1057	esrv_del_item (pl->contr, count);	1064	esrv_del_item (pl->contr, count);
1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1065	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1059		1066
1060	adjust_weight (env, -total_weight ());	1067	adjust_weight (env, -total_weight ());
		1068
		1069	object *pl = in_player ();
1061		1070
1062	/* we set up values so that it could be inserted into	1071	/* we set up values so that it could be inserted into
1063	* the map, but we don't actually do that - it is up	1072	* the map, but we don't actually do that - it is up
1064	* to the caller to decide what we want to do.	1073	* to the caller to decide what we want to do.
1065	*/	1074	*/
…		…
1077		1086
1078	/* NO_FIX_PLAYER is set when a great many changes are being	1087	/* NO_FIX_PLAYER is set when a great many changes are being
1079	* made to players inventory. If set, avoiding the call	1088	* made to players inventory. If set, avoiding the call
1080	* to save cpu time.	1089	* to save cpu time.
1081	*/	1090	*/
1082	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1091	if (pl)
		1092	if (pl->is_player () && (glow_radius \|\| !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1093	{
1083	otmp->update_stats ();	1094	pl->update_stats ();
		1095
		1096	if (glow_radius && pl->is_on_map ())
		1097	update_all_los (pl->map, pl->x, pl->y);
		1098	}
1084	}	1099	}
1085	else if (map)	1100	else if (map)
1086	{	1101	{
1087	map->dirty = true;	1102	map->dirty = true;
1088	mapspace &ms = this->ms ();	1103	mapspace &ms = this->ms ();
1089		1104
1090	if (object *pl = ms.player ())	1105	if (object *pl = ms.player ())
1091	{	1106	{
1092	if (type == PLAYER) // this == pl(!)	1107	if (is_player ())
1093	{	1108	{
		1109	if (!flag [FLAG_WIZPASS])
		1110	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1111
1094	// leaving a spot always closes any open container on the ground	1112	// leaving a spot always closes any open container on the ground
1095	if (container && !container->env)	1113	if (container && !container->env)
1096	// this causes spurious floorbox updates, but it ensures	1114	// this causes spurious floorbox updates, but it ensures
1097	// that the CLOSE event is being sent.	1115	// that the CLOSE event is being sent.
1098	close_container ();	1116	close_container ();
1099		1117
1100	--map->players;	1118	--map->players;
1101	map->touch ();	1119	map->touch ();
1102	}	1120	}
1103	else if (pl->container == this)	1121	else if (pl->container_ () == this)
1104	{	1122	{
1105	// removing a container should close it	1123	// removing a container should close it
1106	close_container ();	1124	close_container ();
1107	}	1125	}
1108		1126
…		…
1115	*(below ? &below->above : &ms.bot) = above;	1133	*(below ? &below->above : &ms.bot) = above;
1116		1134
1117	above = 0;	1135	above = 0;
1118	below = 0;	1136	below = 0;
1119		1137
1120	ms.flags_ = 0;	1138	ms.invalidate ();
1121		1139
1122	if (map->in_memory == MAP_SAVING)	1140	if (map->in_memory == MAP_SAVING)
1123	return;	1141	return;
1124		1142
1125	int check_walk_off = !flag [FLAG_NO_APPLY];	1143	int check_walk_off = !flag [FLAG_NO_APPLY];
1126		1144
1127	if (object *pl = ms.player ())	1145	if (object *pl = ms.player ())
1128	{	1146	{
1129	if (pl->container == this)	1147	if (pl->container_ () == this)
1130	/* If a container that the player is currently using somehow gets	1148	/* If a container that the player is currently using somehow gets
1131	* removed (most likely destroyed), update the player view	1149	* removed (most likely destroyed), update the player view
1132	* appropriately.	1150	* appropriately.
1133	*/	1151	*/
1134	pl->close_container ();	1152	pl->close_container ();
…		…
1138	//TODO: update floorbox to preserve ordering	1156	//TODO: update floorbox to preserve ordering
1139	if (pl->contr->ns)	1157	if (pl->contr->ns)
1140	pl->contr->ns->floorbox_update ();	1158	pl->contr->ns->floorbox_update ();
1141	}	1159	}
1142		1160
		1161	if (check_walk_off)
1143	for (tmp = ms.bot; tmp; tmp = tmp->above)	1162	for (object above, tmp = ms.bot; tmp; tmp = above)
1144	{	1163	{
		1164	above = tmp->above;
		1165
1145	/* No point updating the players look faces if he is the object	1166	/* No point updating the players look faces if he is the object
1146	* being removed.	1167	* being removed.
1147	*/	1168	*/
1148		1169
1149	/* See if object moving off should effect something */	1170	/* See if object moving off should effect something */
1150	if (check_walk_off
1151	&& ((move_type & tmp->move_off)	1171	if ((move_type & tmp->move_off)
1152	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1172	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1153	{
1154	move_apply (tmp, this, 0);	1173	move_apply (tmp, this, 0);
1155
1156	if (destroyed ())
1157	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1158	}	1174	}
1159		1175
1160	last = tmp;	1176	if (affects_los ())
1161	}
1162
1163	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1164	update_all_los (map, x, y);	1177	update_all_los (map, x, y);
1165	}	1178	}
1166	}	1179	}
1167		1180
1168	/*	1181	/*
…		…
1192	esrv_update_item (UPD_NROF, pl, top);	1205	esrv_update_item (UPD_NROF, pl, top);
1193		1206
1194	op->weight = 0; // cancel the addition above	1207	op->weight = 0; // cancel the addition above
1195	op->carrying = 0; // must be 0 already	1208	op->carrying = 0; // must be 0 already
1196		1209
1197	op->destroy (1);	1210	op->destroy ();
1198		1211
1199	return top;	1212	return top;
1200	}	1213	}
1201		1214
1202	return 0;	1215	return 0;
…		…
1264	* just 'op' otherwise	1277	* just 'op' otherwise
1265	*/	1278	*/
1266	object *	1279	object *
1267	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1280	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1268	{	1281	{
1269	if (op->is_on_map ())
1270	{
1271	LOG (llevError, "insert_ob_in_map called for object already on map");
1272	abort ();
1273	}
1274
1275	if (op->env)
1276	{
1277	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1278	op->remove ();	1282	op->remove ();
1279	}
1280		1283
1281	if (op->face && !face_info (op->face))//D TODO: remove soon	1284	if (m == &freed_map)//D TODO: remove soon
1282	{//D	1285	{//D
1283	LOG (llevError \| logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D	1286	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1284	op->face = 1;//D
1285	}//D	1287	}//D
1286		1288
1287	/* Ideally, the caller figures this out. However, it complicates a lot	1289	/* Ideally, the caller figures this out. However, it complicates a lot
1288	* of areas of callers (eg, anything that uses find_free_spot would now	1290	* of areas of callers (eg, anything that uses find_free_spot would now
1289	* need extra work	1291	* need extra work
1290	*/	1292	*/
		1293	maptile *newmap = m;
1291	if (!xy_normalise (m, op->x, op->y))	1294	if (!xy_normalise (newmap, op->x, op->y))
1292	{	1295	{
1293	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1296	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1294	return 0;	1297	return 0;
1295	}	1298	}
1296		1299
1297	if (object *more = op->more)	1300	if (object *more = op->more)
1298	if (!insert_ob_in_map (more, m, originator, flag))	1301	if (!insert_ob_in_map (more, m, originator, flag))
1299	return 0;	1302	return 0;
1300		1303
1301	CLEAR_FLAG (op, FLAG_REMOVED);	1304	op->flag [FLAG_REMOVED] = false;
1302		1305	op->env = 0;
1303	op->map = m;	1306	op->map = newmap;
		1307
1304	mapspace &ms = op->ms ();	1308	mapspace &ms = op->ms ();
1305		1309
1306	/* this has to be done after we translate the coordinates.	1310	/* this has to be done after we translate the coordinates.
1307	*/	1311	*/
1308	if (op->nrof && !(flag & INS_NO_MERGE))	1312	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1311	{	1315	{
1312	// TODO: we actually want to update tmp, not op,	1316	// TODO: we actually want to update tmp, not op,
1313	// but some caller surely breaks when we return tmp	1317	// but some caller surely breaks when we return tmp
1314	// from here :/	1318	// from here :/
1315	op->nrof += tmp->nrof;	1319	op->nrof += tmp->nrof;
1316	tmp->destroy (1);	1320	tmp->destroy ();
1317	}	1321	}
1318		1322
1319	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1323	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1320	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1324	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1321		1325
…		…
1329	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1333	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1330	abort ();	1334	abort ();
1331	}	1335	}
1332		1336
1333	if (!originator->is_on_map ())	1337	if (!originator->is_on_map ())
		1338	{
1334	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",	1339	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1335	op->debug_desc (), originator->debug_desc ());	1340	op->debug_desc (), originator->debug_desc ());
		1341	abort ();
		1342	}
1336		1343
1337	op->above = originator;	1344	op->above = originator;
1338	op->below = originator->below;	1345	op->below = originator->below;
1339	originator->below = op;	1346	originator->below = op;
1340		1347
…		…
1426	op->below = top;	1433	op->below = top;
1427	*(op->above ? &op->above->below : &ms.top) = op;	1434	*(op->above ? &op->above->below : &ms.top) = op;
1428	}	1435	}
1429	}	1436	}
1430		1437
1431	if (op->type == PLAYER)	1438	if (op->is_player ())
1432	{	1439	{
1433	op->contr->do_los = 1;	1440	op->contr->do_los = 1;
1434	++op->map->players;	1441	++op->map->players;
1435	op->map->touch ();	1442	op->map->touch ();
1436	}	1443	}
…		…
1451	* be far away from this change and not affected in any way -	1458	* be far away from this change and not affected in any way -
1452	* this should get redone to only look for players within range,	1459	* this should get redone to only look for players within range,
1453	* or just updating the P_UPTODATE for spaces within this area	1460	* or just updating the P_UPTODATE for spaces within this area
1454	* of effect may be sufficient.	1461	* of effect may be sufficient.
1455	*/	1462	*/
1456	if (op->map->darkness && (op->glow_radius != 0))	1463	if (op->affects_los ())
		1464	{
		1465	op->ms ().invalidate ();
1457	update_all_los (op->map, op->x, op->y);	1466	update_all_los (op->map, op->x, op->y);
		1467	}
1458		1468
1459	/* updates flags (blocked, alive, no magic, etc) for this map space */	1469	/* updates flags (blocked, alive, no magic, etc) for this map space */
1460	update_object (op, UP_OBJ_INSERT);	1470	update_object (op, UP_OBJ_INSERT);
1461		1471
1462	INVOKE_OBJECT (INSERT, op);	1472	INVOKE_OBJECT (INSERT, op);
…		…
1469	* blocked() and wall() work properly), and these flags are updated by	1479	* blocked() and wall() work properly), and these flags are updated by
1470	* update_object().	1480	* update_object().
1471	*/	1481	*/
1472		1482
1473	/* if this is not the head or flag has been passed, don't check walk on status */	1483	/* if this is not the head or flag has been passed, don't check walk on status */
1474	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1484	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1475	{	1485	{
1476	if (check_move_on (op, originator))	1486	if (check_move_on (op, originator))
1477	return 0;	1487	return 0;
1478		1488
1479	/* If we are a multi part object, lets work our way through the check	1489	/* If we are a multi part object, lets work our way through the check
…		…
1490	/* this function inserts an object in the map, but if it	1500	/* this function inserts an object in the map, but if it
1491	* finds an object of its own type, it'll remove that one first.	1501	* finds an object of its own type, it'll remove that one first.
1492	* op is the object to insert it under: supplies x and the map.	1502	* op is the object to insert it under: supplies x and the map.
1493	*/	1503	*/
1494	void	1504	void
1495	replace_insert_ob_in_map (const char arch_string, object op)	1505	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1496	{	1506	{
1497	/* first search for itself and remove any old instances */	1507	/* first search for itself and remove any old instances */
1498		1508
1499	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1509	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1500	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1510	if (tmp->arch->archname == archname) /* same archetype */
1501	tmp->destroy (1);	1511	tmp->destroy ();
1502		1512
1503	object *tmp = arch_to_object (archetype::find (arch_string));	1513	object *tmp = arch_to_object (archetype::find (archname));
1504		1514
1505	tmp->x = op->x;	1515	tmp->x = op->x;
1506	tmp->y = op->y;	1516	tmp->y = op->y;
1507		1517
1508	insert_ob_in_map (tmp, op->map, op, 0);	1518	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1629	if (object *pl = tmp->visible_to ())	1639	if (object *pl = tmp->visible_to ())
1630	esrv_update_item (UPD_NROF, pl, tmp);	1640	esrv_update_item (UPD_NROF, pl, tmp);
1631		1641
1632	adjust_weight (this, op->total_weight ());	1642	adjust_weight (this, op->total_weight ());
1633		1643
1634	op->destroy (1);	1644	op->destroy ();
1635	op = tmp;	1645	op = tmp;
1636	goto inserted;	1646	goto inserted;
1637	}	1647	}
1638		1648
1639	op->owner = 0; // it's his/hers now. period.	1649	op->owner = 0; // it's his/hers now. period.
…		…
1657		1667
1658	adjust_weight (this, op->total_weight ());	1668	adjust_weight (this, op->total_weight ());
1659		1669
1660	inserted:	1670	inserted:
1661	/* reset the light list and los of the players on the map */	1671	/* reset the light list and los of the players on the map */
1662	if (op->glow_radius && map && map->darkness)	1672	if (op->glow_radius && is_on_map ())
		1673	{
		1674	update_stats ();
1663	update_all_los (map, x, y);	1675	update_all_los (map, x, y);
1664		1676	}
		1677	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1665	// if this is a player's inventory, update stats	1678	// if this is a player's inventory, update stats
1666	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1667	update_stats ();	1679	update_stats ();
1668		1680
1669	INVOKE_OBJECT (INSERT, this);	1681	INVOKE_OBJECT (INSERT, this);
1670		1682
1671	return op;	1683	return op;
…		…
1692	* on top.	1704	* on top.
1693	*/	1705	*/
1694	int	1706	int
1695	check_move_on (object op, object originator)	1707	check_move_on (object op, object originator)
1696	{	1708	{
		1709	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1710	return 0;
		1711
1697	object *tmp;	1712	object *tmp;
1698	maptile *m = op->map;	1713	maptile *m = op->map;
1699	int x = op->x, y = op->y;	1714	int x = op->x, y = op->y;
1700		1715
1701	MoveType move_on, move_slow, move_block;	1716	mapspace &ms = m->at (x, y);
1702		1717
1703	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1718	ms.update ();
1704	return 0;
1705		1719
1706	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1720	MoveType move_on = ms.move_on;
1707	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1721	MoveType move_slow = ms.move_slow;
1708	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1722	MoveType move_block = ms.move_block;
1709		1723
1710	/* if nothing on this space will slow op down or be applied,	1724	/* if nothing on this space will slow op down or be applied,
1711	* no need to do checking below. have to make sure move_type	1725	* no need to do checking below. have to make sure move_type
1712	* is set, as lots of objects don't have it set - we treat that	1726	* is set, as lots of objects don't have it set - we treat that
1713	* as walking.	1727	* as walking.
…		…
1724	return 0;	1738	return 0;
1725		1739
1726	/* The objects have to be checked from top to bottom.	1740	/* The objects have to be checked from top to bottom.
1727	* Hence, we first go to the top:	1741	* Hence, we first go to the top:
1728	*/	1742	*/
1729		1743	for (object next, tmp = ms.top; tmp; tmp = next)
1730	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1731	{
1732	/* Trim the search when we find the first other spell effect
1733	* this helps performance so that if a space has 50 spell objects,
1734	* we don't need to check all of them.
1735	*/
1736	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1737	break;
1738	}	1744	{
		1745	next = tmp->below;
1739		1746
1740	for (; tmp; tmp = tmp->below)
1741	{
1742	if (tmp == op)	1747	if (tmp == op)
1743	continue; /* Can't apply yourself */	1748	continue; /* Can't apply yourself */
1744		1749
1745	/* Check to see if one of the movement types should be slowed down.	1750	/* Check to see if one of the movement types should be slowed down.
1746	* Second check makes sure that the movement types not being slowed	1751	* Second check makes sure that the movement types not being slowed
…		…
1751	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1756	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1752	{	1757	{
1753	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1758	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1754	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1759	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1755	{	1760	{
1756
1757	float
1758	diff = tmp->move_slow_penalty * fabs (op->speed);	1761	float diff = tmp->move_slow_penalty * fabs (op->speed);
1759		1762
1760	if (op->type == PLAYER)	1763	if (op->is_player ())
1761	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1764	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) \|\|
1762	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1765	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1763	diff /= 4.0;	1766	diff /= 4.0;
1764		1767
1765	op->speed_left -= diff;	1768	op->speed_left -= diff;
1766	}	1769	}
1767	}	1770	}
…		…
1973	* head of the object should correspond for the entire object.	1976	* head of the object should correspond for the entire object.
1974	*/	1977	*/
1975	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1978	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1976	continue;	1979	continue;
1977		1980
1978	if (ob->blocked (m, pos.x, pos.y))	1981	if (ob->blocked (pos.m, pos.x, pos.y))
1979	continue;	1982	continue;
1980		1983
1981	altern [index++] = i;	1984	altern [index++] = i;
1982	}	1985	}
1983		1986
…		…
2051	* there is capable of.	2054	* there is capable of.
2052	*/	2055	*/
2053	int	2056	int
2054	find_dir (maptile m, int x, int y, object exclude)	2057	find_dir (maptile m, int x, int y, object exclude)
2055	{	2058	{
2056	int i, max = SIZEOFFREE, mflags;	2059	int max = SIZEOFFREE, mflags;
2057
2058	sint16 nx, ny;
2059	object *tmp;
2060	maptile *mp;
2061
2062	MoveType blocked, move_type;	2060	MoveType move_type;
2063		2061
2064	if (exclude && exclude->head_ () != exclude)	2062	if (exclude && exclude->head_ () != exclude)
2065	{	2063	{
2066	exclude = exclude->head;	2064	exclude = exclude->head;
2067	move_type = exclude->move_type;	2065	move_type = exclude->move_type;
…		…
2070	{	2068	{
2071	/* If we don't have anything, presume it can use all movement types. */	2069	/* If we don't have anything, presume it can use all movement types. */
2072	move_type = MOVE_ALL;	2070	move_type = MOVE_ALL;
2073	}	2071	}
2074		2072
2075	for (i = 1; i < max; i++)	2073	for (int i = 1; i < max; i++)
2076	{	2074	{
2077	mp = m;	2075	mapxy pos (m, x, y);
2078	nx = x + freearr_x[i];	2076	pos.move (i);
2079	ny = y + freearr_y[i];
2080		2077
2081	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2078	if (!pos.normalise ())
2082
2083	if (mflags & P_OUT_OF_MAP)
2084	max = maxfree[i];	2079	max = maxfree[i];
2085	else	2080	else
2086	{	2081	{
2087	mapspace &ms = mp->at (nx, ny);	2082	mapspace &ms = *pos;
2088		2083
2089	blocked = ms.move_block;
2090
2091	if ((move_type & blocked) == move_type)	2084	if ((move_type & ms.move_block) == move_type)
2092	max = maxfree[i];	2085	max = maxfree [i];
2093	else if (mflags & P_IS_ALIVE)	2086	else if (ms.flags () & P_IS_ALIVE)
2094	{	2087	{
2095	for (tmp = ms.bot; tmp; tmp = tmp->above)	2088	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2096	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2089	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2097	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2090	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2098	break;
2099
2100	if (tmp)
2101	return freedir[i];	2091	return freedir [i];
2102	}	2092	}
2103	}	2093	}
2104	}	2094	}
2105		2095
2106	return 0;	2096	return 0;
…		…
2181	* This basically means that if direction is 15, then it could either go	2171	* This basically means that if direction is 15, then it could either go
2182	* direction 4, 14, or 16 to get back to where we are.	2172	* direction 4, 14, or 16 to get back to where we are.
2183	* Moved from spell_util.c to object.c with the other related direction	2173	* Moved from spell_util.c to object.c with the other related direction
2184	* functions.	2174	* functions.
2185	*/	2175	*/
2186	int reduction_dir[SIZEOFFREE][3] = {	2176	const int reduction_dir[SIZEOFFREE][3] = {
2187	{0, 0, 0}, /* 0 */	2177	{0, 0, 0}, /* 0 */
2188	{0, 0, 0}, /* 1 */	2178	{0, 0, 0}, /* 1 */
2189	{0, 0, 0}, /* 2 */	2179	{0, 0, 0}, /* 2 */
2190	{0, 0, 0}, /* 3 */	2180	{0, 0, 0}, /* 3 */
2191	{0, 0, 0}, /* 4 */	2181	{0, 0, 0}, /* 4 */
…		…
2287	int	2277	int
2288	can_pick (const object who, const object item)	2278	can_pick (const object who, const object item)
2289	{	2279	{
2290	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2280	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2291	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2281	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2292	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER \|\| item->weight < who->weight / 3));	2282	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2293	}	2283	}
2294		2284
2295	/*	2285	/*
2296	* create clone from object to another	2286	* create clone from object to another
2297	*/	2287	*/
…		…
2329	return tmp;	2319	return tmp;
2330		2320
2331	return 0;	2321	return 0;
2332	}	2322	}
2333		2323
2334	const shstr &	2324	shstr_tmp
2335	object::kv_get (const shstr &key) const	2325	object::kv_get (shstr_tmp key) const
2336	{	2326	{
2337	for (key_value *kv = key_values; kv; kv = kv->next)	2327	for (key_value *kv = key_values; kv; kv = kv->next)
2338	if (kv->key == key)	2328	if (kv->key == key)
2339	return kv->value;	2329	return kv->value;
2340		2330
2341	return shstr_null;	2331	return shstr ();
2342	}	2332	}
2343		2333
2344	void	2334	void
2345	object::kv_set (const shstr &key, const shstr &value)	2335	object::kv_set (shstr_tmp key, shstr_tmp value)
2346	{	2336	{
2347	for (key_value *kv = key_values; kv; kv = kv->next)	2337	for (key_value *kv = key_values; kv; kv = kv->next)
2348	if (kv->key == key)	2338	if (kv->key == key)
2349	{	2339	{
2350	kv->value = value;	2340	kv->value = value;
…		…
2359		2349
2360	key_values = kv;	2350	key_values = kv;
2361	}	2351	}
2362		2352
2363	void	2353	void
2364	object::kv_del (const shstr &key)	2354	object::kv_del (shstr_tmp key)
2365	{	2355	{
2366	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2356	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2367	if ((*kvp)->key == key)	2357	if ((*kvp)->key == key)
2368	{	2358	{
2369	key_value kv = kvp;	2359	key_value kv = kvp;
…		…
2500	container = 0;	2490	container = 0;
2501		2491
2502	// client needs item update to make it work, client bug requires this to be separate	2492	// client needs item update to make it work, client bug requires this to be separate
2503	esrv_update_item (UPD_FLAGS, this, old_container);	2493	esrv_update_item (UPD_FLAGS, this, old_container);
2504		2494
2505	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2495	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2506	play_sound (sound_find ("chest_close"));	2496	play_sound (sound_find ("chest_close"));
2507	}	2497	}
2508		2498
2509	if (new_container)	2499	if (new_container)
2510	{	2500	{
…		…
2520	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2510	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2521	new_container->insert (closer);	2511	new_container->insert (closer);
2522	}	2512	}
2523	#endif	2513	#endif
2524		2514
2525	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2515	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2526		2516
2527	// make sure the container is available, client bug requires this to be separate	2517	// make sure the container is available, client bug requires this to be separate
2528	esrv_send_item (this, new_container);	2518	esrv_send_item (this, new_container);
2529		2519
2530	new_container->flag [FLAG_APPLIED] = true;	2520	new_container->flag [FLAG_APPLIED] = true;
…		…
2538	// else if (!old_container->env && contr && contr->ns)	2528	// else if (!old_container->env && contr && contr->ns)
2539	// contr->ns->floorbox_reset ();	2529	// contr->ns->floorbox_reset ();
2540	}	2530	}
2541		2531
2542	object *	2532	object *
2543	object::force_find (const shstr name)	2533	object::force_find (shstr_tmp name)
2544	{	2534	{
2545	/* cycle through his inventory to look for the MARK we want to	2535	/* cycle through his inventory to look for the MARK we want to
2546	* place	2536	* place
2547	*/	2537	*/
2548	for (object *tmp = inv; tmp; tmp = tmp->below)	2538	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2551		2541
2552	return 0;	2542	return 0;
2553	}	2543	}
2554		2544
2555	void	2545	void
		2546	object::force_set_timer (int duration)
		2547	{
		2548	this->duration = 1;
		2549	this->speed_left = -1.f;
		2550
		2551	this->set_speed (duration ? 1.f / duration : 0.f);
		2552	}
		2553
		2554	object *
2556	object::force_add (const shstr name, int duration)	2555	object::force_add (shstr_tmp name, int duration)
2557	{	2556	{
2558	if (object *force = force_find (name))	2557	if (object *force = force_find (name))
2559	force->destroy ();	2558	force->destroy ();
2560		2559
2561	object *force = get_archetype (FORCE_NAME);	2560	object *force = get_archetype (FORCE_NAME);
2562		2561
2563	force->slaying = name;	2562	force->slaying = name;
2564	force->stats.food = 1;
2565	force->speed_left = -1.f;
2566		2563
2567	force->set_speed (duration ? 1.f / duration : 0.f);	2564	force->force_set_timer (duration);
2568	force->flag [FLAG_IS_USED_UP] = true;	2565
2569	force->flag [FLAG_APPLIED] = true;	2566	force->flag [FLAG_APPLIED] = true;
2570		2567
2571	insert (force);	2568	return insert (force);
2572	}	2569	}
2573		2570
2574	void	2571	void
2575	object::play_sound (faceidx sound)	2572	object::play_sound (faceidx sound) const
2576	{	2573	{
2577	if (!sound)	2574	if (!sound)
2578	return;	2575	return;
2579		2576
2580	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 ())
2581	return;	2602	return;
2582		2603
2583	if (env)	2604	// find old force, or create new one
2584	{	2605	object *force = force_find (shstr_noise_force);
2585	if (object *pl = in_player ())	2606
2586	pl->contr->play_sound (sound);	2607	if (force)
2587	}	2608	force->speed_left = -1.f; // patch old speed up
2588	else	2609	else
2589	map->play_sound (sound, x, y);	2610	{
2590	}	2611	force = archetype::get (shstr_noise_force);
2591		2612
		2613	force->slaying = shstr_noise_force;
		2614	force->stats.food = 1;
		2615	force->speed_left = -1.f;
		2616
		2617	force->set_speed (1.f / 4.f);
		2618	force->flag [FLAG_IS_USED_UP] = true;
		2619	force->flag [FLAG_APPLIED] = true;
		2620
		2621	insert (force);
		2622	}
		2623	}
		2624

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.253 by root, Sun Aug 17 22:46:26 2008 UTC vs. Revision 1.293 by root, Wed Oct 21 00:44:39 2009 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.253 by root, Sun Aug 17 22:46:26 2008 UTC vs.
Revision 1.293 by root, Wed Oct 21 00:44:39 2009 UTC