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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.252 by root, Mon Aug 11 23:23:41 2008 UTC vs.
Revision 1.283 by root, Sat Feb 21 06:25:46 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] = {
…		…
186	\|\| ob1->speed != ob2->speed	187	\|\| ob1->speed != ob2->speed
187	\|\| ob1->value != ob2->value	188	\|\| ob1->value != ob2->value
188	\|\| ob1->name != ob2->name)	189	\|\| ob1->name != ob2->name)
189	return 0;	190	return 0;
190		191
191	/* Do not merge objects if nrof would overflow. First part checks	192	/* Do not merge objects if nrof would overflow, assume nrof
192	* for unsigned overflow (2c), second part checks whether the result	193	* is always 0 .. 2*31-1 /
193	* would fit into a 32 bit signed int, which is often used to hold	194	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;	195	return 0;
198		196
199	/* If the objects have been identified, set the BEEN_APPLIED flag.	197	/* 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	198	* 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	199	* just can't ignore the been applied or identified flags, as they
…		…
235	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	233	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
236	return 0;	234	return 0;
237		235
238	if ((ob1->flag ^ ob2->flag)	236	if ((ob1->flag ^ ob2->flag)
239	.reset (FLAG_INV_LOCKED)	237	.reset (FLAG_INV_LOCKED)
240	.reset (FLAG_CLIENT_SENT)
241	.reset (FLAG_REMOVED)	238	.reset (FLAG_REMOVED)
242	.any ())	239	.any ())
243	return 0;	240	return 0;
244		241
245	/* This is really a spellbook check - we should in general	242	/* This is really a spellbook check - we should in general
…		…
327	{	324	{
328	// see if we are in a container of sorts	325	// see if we are in a container of sorts
329	if (env)	326	if (env)
330	{	327	{
331	// the player inventory itself is always visible	328	// the player inventory itself is always visible
332	if (env->type == PLAYER)	329	if (env->is_player ())
333	return env;	330	return env;
334		331
335	// else a player could have our env open	332	// else a player could have our env open
336	object *envest = env->outer_env ();	333	object *envest = env->outer_env ();
337		334
…		…
640	}	637	}
641		638
642	if (speed < 0)	639	if (speed < 0)
643	dst->speed_left -= rndm ();	640	dst->speed_left -= rndm ();
644		641
645	dst->set_speed (dst->speed);	642	dst->activate ();
646	}	643	}
647		644
648	void	645	void
649	object::instantiate ()	646	object::instantiate ()
650	{	647	{
…		…
762	else if (action == UP_OBJ_INSERT)	759	else if (action == UP_OBJ_INSERT)
763	{	760	{
764	// this is likely overkill, TODO: revisit (schmorp)	761	// this is likely overkill, TODO: revisit (schmorp)
765	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	762	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
766	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	763	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
		764	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
767	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	765	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
768	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	766	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
769	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	767	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
770	\|\| (m.move_on \| op->move_on ) != m.move_on	768	\|\| (m.move_on \| op->move_on ) != m.move_on
771	\|\| (m.move_off \| op->move_off ) != m.move_off	769	\|\| (m.move_off \| op->move_off ) != m.move_off
…		…
773	/* This isn't perfect, but I don't expect a lot of objects to	771	/* This isn't perfect, but I don't expect a lot of objects to
774	* have move_allow right now.	772	* have move_allow right now.
775	*/	773	*/
776	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	774	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
777	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	775	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
778	m.flags_ = 0;	776	m.invalidate ();
779	}	777	}
780	/* if the object is being removed, we can't make intelligent	778	/* if the object is being removed, we can't make intelligent
781	* decisions, because remove_ob can't really pass the object	779	* decisions, because remove_ob can't really pass the object
782	* that is being removed.	780	* that is being removed.
783	*/	781	*/
784	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	782	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
785	m.flags_ = 0;	783	m.invalidate ();
786	else if (action == UP_OBJ_FACE)	784	else if (action == UP_OBJ_FACE)
787	/* Nothing to do for that case */ ;	785	/* Nothing to do for that case */ ;
788	else	786	else
789	LOG (llevError, "update_object called with invalid action: %d\n", action);	787	LOG (llevError, "update_object called with invalid action: %d\n", action);
790		788
…		…
832	object::activate ()	830	object::activate ()
833	{	831	{
834	/* If already on active list, don't do anything */	832	/* If already on active list, don't do anything */
835	if (active)	833	if (active)
836	return;	834	return;
		835
		836	if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError \| logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		837	if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError \| logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
837		838
838	if (has_active_speed ())	839	if (has_active_speed ())
839	actives.insert (this);	840	actives.insert (this);
840	}	841	}
841		842
…		…
909	\|\| map->in_memory != MAP_ACTIVE	910	\|\| map->in_memory != MAP_ACTIVE
910	\|\| map->no_drop	911	\|\| map->no_drop
911	\|\| ms ().move_block == MOVE_ALL)	912	\|\| ms ().move_block == MOVE_ALL)
912	{	913	{
913	while (inv)	914	while (inv)
914	inv->destroy (true);	915	inv->destroy ();
915	}	916	}
916	else	917	else
917	{ /* Put objects in inventory onto this space */	918	{ /* Put objects in inventory onto this space */
918	while (inv)	919	while (inv)
919	{	920	{
…		…
923	\|\| op->flag [FLAG_NO_DROP]	924	\|\| op->flag [FLAG_NO_DROP]
924	\|\| op->type == RUNE	925	\|\| op->type == RUNE
925	\|\| op->type == TRAP	926	\|\| op->type == TRAP
926	\|\| op->flag [FLAG_IS_A_TEMPLATE]	927	\|\| op->flag [FLAG_IS_A_TEMPLATE]
927	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	928	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
928	op->destroy (true);	929	op->destroy ();
929	else	930	else
930	map->insert (op, x, y);	931	map->insert (op, x, y);
931	}	932	}
932	}	933	}
933	}	934	}
…		…
962		963
963	void	964	void
964	object::do_destroy ()	965	object::do_destroy ()
965	{	966	{
966	if (flag [FLAG_IS_LINKED])	967	if (flag [FLAG_IS_LINKED])
967	remove_button_link (this);	968	remove_link ();
968		969
969	if (flag [FLAG_FRIENDLY])	970	if (flag [FLAG_FRIENDLY])
970	remove_friendly_object (this);	971	remove_friendly_object (this);
971		972
972	remove ();	973	remove ();
…		…
997	attacked_by = 0;	998	attacked_by = 0;
998	current_weapon = 0;	999	current_weapon = 0;
999	}	1000	}
1000		1001
1001	void	1002	void
1002	object::destroy (bool destroy_inventory)	1003	object::destroy ()
1003	{	1004	{
1004	if (destroyed ())	1005	if (destroyed ())
1005	return;	1006	return;
1006		1007
1007	if (!is_head () && !head->destroyed ())	1008	if (!is_head () && !head->destroyed ())
1008	{	1009	{
1009	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1010	head->destroy (destroy_inventory);	1011	head->destroy ();
1011	return;	1012	return;
1012	}	1013	}
1013		1014
1014	destroy_inv (!destroy_inventory);	1015	destroy_inv (false);
1015		1016
1016	if (is_head ())	1017	if (is_head ())
1017	if (sound_destroy)	1018	if (sound_destroy)
1018	play_sound (sound_destroy);	1019	play_sound (sound_destroy);
1019	else if (flag [FLAG_MONSTER])	1020	else if (flag [FLAG_MONSTER])
…		…
1055	if (object *pl = visible_to ())	1056	if (object *pl = visible_to ())
1056	esrv_del_item (pl->contr, count);	1057	esrv_del_item (pl->contr, count);
1057	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed	1058	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1058		1059
1059	adjust_weight (env, -total_weight ());	1060	adjust_weight (env, -total_weight ());
		1061
		1062	object *pl = in_player ();
1060		1063
1061	/* we set up values so that it could be inserted into	1064	/* we set up values so that it could be inserted into
1062	* the map, but we don't actually do that - it is up	1065	* the map, but we don't actually do that - it is up
1063	* to the caller to decide what we want to do.	1066	* to the caller to decide what we want to do.
1064	*/	1067	*/
…		…
1076		1079
1077	/* NO_FIX_PLAYER is set when a great many changes are being	1080	/* NO_FIX_PLAYER is set when a great many changes are being
1078	* made to players inventory. If set, avoiding the call	1081	* made to players inventory. If set, avoiding the call
1079	* to save cpu time.	1082	* to save cpu time.
1080	*/	1083	*/
1081	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1084	if (pl)
		1085	if (pl->is_player () && (glow_radius \|\| !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1086	{
1082	otmp->update_stats ();	1087	pl->update_stats ();
		1088
		1089	if (glow_radius && pl->is_on_map ())
		1090	update_all_los (pl->map, pl->x, pl->y);
		1091	}
1083	}	1092	}
1084	else if (map)	1093	else if (map)
1085	{	1094	{
1086	map->dirty = true;	1095	map->dirty = true;
1087	mapspace &ms = this->ms ();	1096	mapspace &ms = this->ms ();
1088		1097
1089	if (object *pl = ms.player ())	1098	if (object *pl = ms.player ())
1090	{	1099	{
1091	if (type == PLAYER) // this == pl(!)	1100	if (is_player ())
1092	{	1101	{
		1102	if (!flag [FLAG_WIZPASS])
		1103	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1104
1093	// leaving a spot always closes any open container on the ground	1105	// leaving a spot always closes any open container on the ground
1094	if (container && !container->env)	1106	if (container && !container->env)
1095	// this causes spurious floorbox updates, but it ensures	1107	// this causes spurious floorbox updates, but it ensures
1096	// that the CLOSE event is being sent.	1108	// that the CLOSE event is being sent.
1097	close_container ();	1109	close_container ();
…		…
1114	*(below ? &below->above : &ms.bot) = above;	1126	*(below ? &below->above : &ms.bot) = above;
1115		1127
1116	above = 0;	1128	above = 0;
1117	below = 0;	1129	below = 0;
1118		1130
		1131	ms.invalidate ();
		1132
1119	if (map->in_memory == MAP_SAVING)	1133	if (map->in_memory == MAP_SAVING)
1120	return;	1134	return;
1121		1135
1122	int check_walk_off = !flag [FLAG_NO_APPLY];	1136	int check_walk_off = !flag [FLAG_NO_APPLY];
1123		1137
…		…
1155	}	1169	}
1156		1170
1157	last = tmp;	1171	last = tmp;
1158	}	1172	}
1159		1173
1160	/* last == NULL if there are no objects on this space */	1174	if (affects_los ())
1161	//TODO: this makes little sense, why only update the topmost object?
1162	if (!last)
1163	map->at (x, y).flags_ = 0;
1164	else
1165	update_object (last, UP_OBJ_REMOVE);
1166
1167	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1168	update_all_los (map, x, y);	1175	update_all_los (map, x, y);
1169	}	1176	}
1170	}	1177	}
1171		1178
1172	/*	1179	/*
…		…
1196	esrv_update_item (UPD_NROF, pl, top);	1203	esrv_update_item (UPD_NROF, pl, top);
1197		1204
1198	op->weight = 0; // cancel the addition above	1205	op->weight = 0; // cancel the addition above
1199	op->carrying = 0; // must be 0 already	1206	op->carrying = 0; // must be 0 already
1200		1207
1201	op->destroy (1);	1208	op->destroy ();
1202		1209
1203	return top;	1210	return top;
1204	}	1211	}
1205		1212
1206	return 0;	1213	return 0;
…		…
1268	* just 'op' otherwise	1275	* just 'op' otherwise
1269	*/	1276	*/
1270	object *	1277	object *
1271	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1278	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1272	{	1279	{
1273	if (op->is_on_map ())
1274	{
1275	LOG (llevError, "insert_ob_in_map called for object already on map");
1276	abort ();
1277	}
1278
1279	if (op->env)
1280	{
1281	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1282	op->remove ();	1280	op->remove ();
1283	}
1284		1281
1285	if (op->face && !face_info (op->face))//D TODO: remove soon	1282	if (m == &freed_map)//D TODO: remove soon
1286	{//D	1283	{//D
1287	LOG (llevError \| logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D	1284	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1288	op->face = 1;//D
1289	}//D	1285	}//D
1290		1286
1291	/* Ideally, the caller figures this out. However, it complicates a lot	1287	/* Ideally, the caller figures this out. However, it complicates a lot
1292	* of areas of callers (eg, anything that uses find_free_spot would now	1288	* of areas of callers (eg, anything that uses find_free_spot would now
1293	* need extra work	1289	* need extra work
1294	*/	1290	*/
		1291	maptile *newmap = m;
1295	if (!xy_normalise (m, op->x, op->y))	1292	if (!xy_normalise (newmap, op->x, op->y))
1296	{	1293	{
1297	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1294	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1298	return 0;	1295	return 0;
1299	}	1296	}
1300		1297
1301	if (object *more = op->more)	1298	if (object *more = op->more)
1302	if (!insert_ob_in_map (more, m, originator, flag))	1299	if (!insert_ob_in_map (more, m, originator, flag))
1303	return 0;	1300	return 0;
1304		1301
1305	CLEAR_FLAG (op, FLAG_REMOVED);	1302	op->flag [FLAG_REMOVED] = false;
1306		1303	op->env = 0;
1307	op->map = m;	1304	op->map = newmap;
		1305
1308	mapspace &ms = op->ms ();	1306	mapspace &ms = op->ms ();
1309		1307
1310	/* this has to be done after we translate the coordinates.	1308	/* this has to be done after we translate the coordinates.
1311	*/	1309	*/
1312	if (op->nrof && !(flag & INS_NO_MERGE))	1310	if (op->nrof && !(flag & INS_NO_MERGE))
…		…
1315	{	1313	{
1316	// TODO: we actually want to update tmp, not op,	1314	// TODO: we actually want to update tmp, not op,
1317	// but some caller surely breaks when we return tmp	1315	// but some caller surely breaks when we return tmp
1318	// from here :/	1316	// from here :/
1319	op->nrof += tmp->nrof;	1317	op->nrof += tmp->nrof;
1320	tmp->destroy (1);	1318	tmp->destroy ();
1321	}	1319	}
1322		1320
1323	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1321	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1324	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1322	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1325		1323
…		…
1333	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1331	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1334	abort ();	1332	abort ();
1335	}	1333	}
1336		1334
1337	if (!originator->is_on_map ())	1335	if (!originator->is_on_map ())
		1336	{
1338	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",	1337	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1339	op->debug_desc (), originator->debug_desc ());	1338	op->debug_desc (), originator->debug_desc ());
		1339	abort ();
		1340	}
1340		1341
1341	op->above = originator;	1342	op->above = originator;
1342	op->below = originator->below;	1343	op->below = originator->below;
1343	originator->below = op;	1344	originator->below = op;
1344		1345
…		…
1430	op->below = top;	1431	op->below = top;
1431	*(op->above ? &op->above->below : &ms.top) = op;	1432	*(op->above ? &op->above->below : &ms.top) = op;
1432	}	1433	}
1433	}	1434	}
1434		1435
1435	if (op->type == PLAYER)	1436	if (op->is_player ())
1436	{	1437	{
1437	op->contr->do_los = 1;	1438	op->contr->do_los = 1;
1438	++op->map->players;	1439	++op->map->players;
1439	op->map->touch ();	1440	op->map->touch ();
1440	}	1441	}
…		…
1455	* be far away from this change and not affected in any way -	1456	* be far away from this change and not affected in any way -
1456	* this should get redone to only look for players within range,	1457	* this should get redone to only look for players within range,
1457	* or just updating the P_UPTODATE for spaces within this area	1458	* or just updating the P_UPTODATE for spaces within this area
1458	* of effect may be sufficient.	1459	* of effect may be sufficient.
1459	*/	1460	*/
1460	if (op->map->darkness && (op->glow_radius != 0))	1461	if (op->affects_los ())
		1462	{
		1463	op->ms ().invalidate ();
1461	update_all_los (op->map, op->x, op->y);	1464	update_all_los (op->map, op->x, op->y);
		1465	}
1462		1466
1463	/* updates flags (blocked, alive, no magic, etc) for this map space */	1467	/* updates flags (blocked, alive, no magic, etc) for this map space */
1464	update_object (op, UP_OBJ_INSERT);	1468	update_object (op, UP_OBJ_INSERT);
1465		1469
1466	INVOKE_OBJECT (INSERT, op);	1470	INVOKE_OBJECT (INSERT, op);
…		…
1494	/* this function inserts an object in the map, but if it	1498	/* this function inserts an object in the map, but if it
1495	* finds an object of its own type, it'll remove that one first.	1499	* finds an object of its own type, it'll remove that one first.
1496	* op is the object to insert it under: supplies x and the map.	1500	* op is the object to insert it under: supplies x and the map.
1497	*/	1501	*/
1498	void	1502	void
1499	replace_insert_ob_in_map (const char arch_string, object op)	1503	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1500	{	1504	{
1501	/* first search for itself and remove any old instances */	1505	/* first search for itself and remove any old instances */
1502		1506
1503	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1507	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1504	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1508	if (tmp->arch->archname == archname) /* same archetype */
1505	tmp->destroy (1);	1509	tmp->destroy ();
1506		1510
1507	object *tmp = arch_to_object (archetype::find (arch_string));	1511	object *tmp = arch_to_object (archetype::find (archname));
1508		1512
1509	tmp->x = op->x;	1513	tmp->x = op->x;
1510	tmp->y = op->y;	1514	tmp->y = op->y;
1511		1515
1512	insert_ob_in_map (tmp, op->map, op, 0);	1516	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1633	if (object *pl = tmp->visible_to ())	1637	if (object *pl = tmp->visible_to ())
1634	esrv_update_item (UPD_NROF, pl, tmp);	1638	esrv_update_item (UPD_NROF, pl, tmp);
1635		1639
1636	adjust_weight (this, op->total_weight ());	1640	adjust_weight (this, op->total_weight ());
1637		1641
1638	op->destroy (1);	1642	op->destroy ();
1639	op = tmp;	1643	op = tmp;
1640	goto inserted;	1644	goto inserted;
1641	}	1645	}
1642		1646
1643	op->owner = 0; // it's his/hers now. period.	1647	op->owner = 0; // it's his/hers now. period.
…		…
1661		1665
1662	adjust_weight (this, op->total_weight ());	1666	adjust_weight (this, op->total_weight ());
1663		1667
1664	inserted:	1668	inserted:
1665	/* reset the light list and los of the players on the map */	1669	/* reset the light list and los of the players on the map */
1666	if (op->glow_radius && map && map->darkness)	1670	if (op->glow_radius && is_on_map ())
		1671	{
		1672	update_stats ();
1667	update_all_los (map, x, y);	1673	update_all_los (map, x, y);
1668		1674	}
		1675	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1669	// if this is a player's inventory, update stats	1676	// if this is a player's inventory, update stats
1670	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1671	update_stats ();	1677	update_stats ();
1672		1678
1673	INVOKE_OBJECT (INSERT, this);	1679	INVOKE_OBJECT (INSERT, this);
1674		1680
1675	return op;	1681	return op;
…		…
1759	{	1765	{
1760		1766
1761	float	1767	float
1762	diff = tmp->move_slow_penalty * fabs (op->speed);	1768	diff = tmp->move_slow_penalty * fabs (op->speed);
1763		1769
1764	if (op->type == PLAYER)	1770	if (op->is_player ())
1765	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1771	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1766	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1772	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1767	diff /= 4.0;	1773	diff /= 4.0;
1768		1774
1769	op->speed_left -= diff;	1775	op->speed_left -= diff;
…		…
1977	* head of the object should correspond for the entire object.	1983	* head of the object should correspond for the entire object.
1978	*/	1984	*/
1979	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1985	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1980	continue;	1986	continue;
1981		1987
1982	if (ob->blocked (m, pos.x, pos.y))	1988	if (ob->blocked (pos.m, pos.x, pos.y))
1983	continue;	1989	continue;
1984		1990
1985	altern [index++] = i;	1991	altern [index++] = i;
1986	}	1992	}
1987		1993
…		…
2055	* there is capable of.	2061	* there is capable of.
2056	*/	2062	*/
2057	int	2063	int
2058	find_dir (maptile m, int x, int y, object exclude)	2064	find_dir (maptile m, int x, int y, object exclude)
2059	{	2065	{
2060	int i, max = SIZEOFFREE, mflags;	2066	int max = SIZEOFFREE, mflags;
2061
2062	sint16 nx, ny;
2063	object *tmp;
2064	maptile *mp;
2065
2066	MoveType blocked, move_type;	2067	MoveType move_type;
2067		2068
2068	if (exclude && exclude->head_ () != exclude)	2069	if (exclude && exclude->head_ () != exclude)
2069	{	2070	{
2070	exclude = exclude->head;	2071	exclude = exclude->head;
2071	move_type = exclude->move_type;	2072	move_type = exclude->move_type;
…		…
2074	{	2075	{
2075	/* 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. */
2076	move_type = MOVE_ALL;	2077	move_type = MOVE_ALL;
2077	}	2078	}
2078		2079
2079	for (i = 1; i < max; i++)	2080	for (int i = 1; i < max; i++)
2080	{	2081	{
2081	mp = m;	2082	mapxy pos (m, x, y);
2082	nx = x + freearr_x[i];	2083	pos.move (i);
2083	ny = y + freearr_y[i];
2084		2084
2085	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2085	if (!pos.normalise ())
2086
2087	if (mflags & P_OUT_OF_MAP)
2088	max = maxfree[i];	2086	max = maxfree[i];
2089	else	2087	else
2090	{	2088	{
2091	mapspace &ms = mp->at (nx, ny);	2089	mapspace &ms = *pos;
2092		2090
2093	blocked = ms.move_block;
2094
2095	if ((move_type & blocked) == move_type)	2091	if ((move_type & ms.move_block) == move_type)
2096	max = maxfree[i];	2092	max = maxfree [i];
2097	else if (mflags & P_IS_ALIVE)	2093	else if (ms.flags () & P_IS_ALIVE)
2098	{	2094	{
2099	for (tmp = ms.bot; tmp; tmp = tmp->above)	2095	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2100	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2096	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2101	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2097	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2102	break;
2103
2104	if (tmp)
2105	return freedir[i];	2098	return freedir [i];
2106	}	2099	}
2107	}	2100	}
2108	}	2101	}
2109		2102
2110	return 0;	2103	return 0;
…		…
2185	* 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
2186	* 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.
2187	* 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
2188	* functions.	2181	* functions.
2189	*/	2182	*/
2190	int reduction_dir[SIZEOFFREE][3] = {	2183	const int reduction_dir[SIZEOFFREE][3] = {
2191	{0, 0, 0}, /* 0 */	2184	{0, 0, 0}, /* 0 */
2192	{0, 0, 0}, /* 1 */	2185	{0, 0, 0}, /* 1 */
2193	{0, 0, 0}, /* 2 */	2186	{0, 0, 0}, /* 2 */
2194	{0, 0, 0}, /* 3 */	2187	{0, 0, 0}, /* 3 */
2195	{0, 0, 0}, /* 4 */	2188	{0, 0, 0}, /* 4 */
…		…
2291	int	2284	int
2292	can_pick (const object who, const object item)	2285	can_pick (const object who, const object item)
2293	{	2286	{
2294	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2287	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2295	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2288	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2296	!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));
2297	}	2290	}
2298		2291
2299	/*	2292	/*
2300	* create clone from object to another	2293	* create clone from object to another
2301	*/	2294	*/
…		…
2333	return tmp;	2326	return tmp;
2334		2327
2335	return 0;	2328	return 0;
2336	}	2329	}
2337		2330
2338	const shstr &	2331	shstr_tmp
2339	object::kv_get (const shstr &key) const	2332	object::kv_get (shstr_tmp key) const
2340	{	2333	{
2341	for (key_value *kv = key_values; kv; kv = kv->next)	2334	for (key_value *kv = key_values; kv; kv = kv->next)
2342	if (kv->key == key)	2335	if (kv->key == key)
2343	return kv->value;	2336	return kv->value;
2344		2337
2345	return shstr_null;	2338	return shstr ();
2346	}	2339	}
2347		2340
2348	void	2341	void
2349	object::kv_set (const shstr &key, const shstr &value)	2342	object::kv_set (shstr_tmp key, shstr_tmp value)
2350	{	2343	{
2351	for (key_value *kv = key_values; kv; kv = kv->next)	2344	for (key_value *kv = key_values; kv; kv = kv->next)
2352	if (kv->key == key)	2345	if (kv->key == key)
2353	{	2346	{
2354	kv->value = value;	2347	kv->value = value;
…		…
2363		2356
2364	key_values = kv;	2357	key_values = kv;
2365	}	2358	}
2366		2359
2367	void	2360	void
2368	object::kv_del (const shstr &key)	2361	object::kv_del (shstr_tmp key)
2369	{	2362	{
2370	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2363	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2371	if ((*kvp)->key == key)	2364	if ((*kvp)->key == key)
2372	{	2365	{
2373	key_value kv = kvp;	2366	key_value kv = kvp;
…		…
2504	container = 0;	2497	container = 0;
2505		2498
2506	// 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
2507	esrv_update_item (UPD_FLAGS, this, old_container);	2500	esrv_update_item (UPD_FLAGS, this, old_container);
2508		2501
2509	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 ());
2510	play_sound (sound_find ("chest_close"));	2503	play_sound (sound_find ("chest_close"));
2511	}	2504	}
2512		2505
2513	if (new_container)	2506	if (new_container)
2514	{	2507	{
…		…
2524	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2517	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2525	new_container->insert (closer);	2518	new_container->insert (closer);
2526	}	2519	}
2527	#endif	2520	#endif
2528		2521
2529	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 ());
2530		2523
2531	// 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
2532	esrv_send_item (this, new_container);	2525	esrv_send_item (this, new_container);
2533		2526
2534	new_container->flag [FLAG_APPLIED] = true;	2527	new_container->flag [FLAG_APPLIED] = true;
…		…
2542	// else if (!old_container->env && contr && contr->ns)	2535	// else if (!old_container->env && contr && contr->ns)
2543	// contr->ns->floorbox_reset ();	2536	// contr->ns->floorbox_reset ();
2544	}	2537	}
2545		2538
2546	object *	2539	object *
2547	object::force_find (const shstr name)	2540	object::force_find (shstr_tmp name)
2548	{	2541	{
2549	/* 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
2550	* place	2543	* place
2551	*/	2544	*/
2552	for (object *tmp = inv; tmp; tmp = tmp->below)	2545	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2554	return splay (tmp);	2547	return splay (tmp);
2555		2548
2556	return 0;	2549	return 0;
2557	}	2550	}
2558		2551
2559	void	2552	object *
2560	object::force_add (const shstr name, int duration)	2553	object::force_add (shstr_tmp name, int duration)
2561	{	2554	{
2562	if (object *force = force_find (name))	2555	if (object *force = force_find (name))
2563	force->destroy ();	2556	force->destroy ();
2564		2557
2565	object *force = get_archetype (FORCE_NAME);	2558	object *force = get_archetype (FORCE_NAME);
…		…
2570		2563
2571	force->set_speed (duration ? 1.f / duration : 0.f);	2564	force->set_speed (duration ? 1.f / duration : 0.f);
2572	force->flag [FLAG_IS_USED_UP] = true;	2565	force->flag [FLAG_IS_USED_UP] = true;
2573	force->flag [FLAG_APPLIED] = true;	2566	force->flag [FLAG_APPLIED] = true;
2574		2567
2575	insert (force);	2568	return insert (force);
2576	}	2569	}
2577		2570
2578	void	2571	void
2579	object::play_sound (faceidx sound)	2572	object::play_sound (faceidx sound) const
2580	{	2573	{
2581	if (!sound)	2574	if (!sound)
2582	return;	2575	return;
2583		2576
2584	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 ())
2585	return;	2602	return;
2586		2603
2587	if (env)	2604	// find old force, or create new one
2588	{	2605	object *force = force_find (shstr_noise_force);
2589	if (object *pl = in_player ())	2606
2590	pl->contr->play_sound (sound);	2607	if (force)
2591	}	2608	force->speed_left = -1.f; // patch old speed up
2592	else	2609	else
2593	map->play_sound (sound, x, y);	2610	{
2594	}	2611	force = archetype::get (shstr_noise_force);
2595		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.252 by root, Mon Aug 11 23:23:41 2008 UTC vs. Revision 1.283 by root, Sat Feb 21 06:25:46 2009 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.252 by root, Mon Aug 11 23:23:41 2008 UTC vs.
Revision 1.283 by root, Sat Feb 21 06:25:46 2009 UTC