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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.235 by root, Tue May 6 20:00:12 2008 UTC vs.
Revision 1.278 by root, Thu Jan 1 19:42:43 2009 UTC

…		…
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
…		…
206	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	204	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
207		205
208	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	206	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
209	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	207	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
210		208
211	if (ob1->arch->name != ob2->arch->name	209	if (ob1->arch->archname != ob2->arch->archname
212	\|\| ob1->name != ob2->name	210	\|\| ob1->name != ob2->name
213	\|\| ob1->title != ob2->title	211	\|\| ob1->title != ob2->title
214	\|\| ob1->msg != ob2->msg	212	\|\| ob1->msg != ob2->msg
215	\|\| ob1->weight != ob2->weight	213	\|\| ob1->weight != ob2->weight
216	\|\| ob1->attacktype != ob2->attacktype	214	\|\| ob1->attacktype != ob2->attacktype
217	\|\| ob1->magic != ob2->magic	215	\|\| ob1->magic != ob2->magic
218	\|\| ob1->slaying != ob2->slaying	216	\|\| ob1->slaying != ob2->slaying
219	\|\| ob1->skill != ob2->skill	217	\|\| ob1->skill != ob2->skill
220	\|\| ob1->value != ob2->value	218	\|\| ob1->value != ob2->value
221	\|\| 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
222	\|\| ob1->client_type != ob2->client_type	221	\|\| ob1->client_type != ob2->client_type
223	\|\| ob1->materialname != ob2->materialname	222	\|\| ob1->materialname != ob2->materialname
224	\|\| ob1->lore != ob2->lore	223	\|\| ob1->lore != ob2->lore
225	\|\| ob1->subtype != ob2->subtype	224	\|\| ob1->subtype != ob2->subtype
226	\|\| ob1->move_type != ob2->move_type	225	\|\| ob1->move_type != ob2->move_type
…		…
234	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	233	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235	return 0;	234	return 0;
236		235
237	if ((ob1->flag ^ ob2->flag)	236	if ((ob1->flag ^ ob2->flag)
238	.reset (FLAG_INV_LOCKED)	237	.reset (FLAG_INV_LOCKED)
239	.reset (FLAG_CLIENT_SENT)
240	.reset (FLAG_REMOVED)	238	.reset (FLAG_REMOVED)
241	.any ())	239	.any ())
242	return 0;	240	return 0;
243		241
244	/* This is really a spellbook check - we should in general	242	/* This is really a spellbook check - we should in general
…		…
326	{	324	{
327	// see if we are in a container of sorts	325	// see if we are in a container of sorts
328	if (env)	326	if (env)
329	{	327	{
330	// the player inventory itself is always visible	328	// the player inventory itself is always visible
331	if (env->type == PLAYER)	329	if (env->is_player ())
332	return env;	330	return env;
333		331
334	// else a player could have our env open	332	// else a player could have our env open
335	object *envest = env->outer_env ();	333	object *envest = env->outer_env ();
336		334
…		…
344	else	342	else
345	{	343	{
346	// maybe there is a player standing on the same mapspace	344	// maybe there is a player standing on the same mapspace
347	// this will catch the case where "this" is a player	345	// this will catch the case where "this" is a player
348	if (object *pl = ms ().player ())	346	if (object *pl = ms ().player ())
		347	if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
349	if (!pl->container \|\| this == pl->container)	348	\|\| this == pl->container)
350	return pl;	349	return pl;
351	}	350	}
352	}	351	}
353		352
354	return 0;	353	return 0;
…		…
478	*/	477	*/
479	object *	478	object *
480	find_object_name (const char *str)	479	find_object_name (const char *str)
481	{	480	{
482	shstr_cmp str_ (str);	481	shstr_cmp str_ (str);
483	object *op;
484		482
		483	if (str_)
485	for_all_objects (op)	484	for_all_objects (op)
486	if (op->name == str_)	485	if (op->name == str_)
487	break;	486	return op;
488		487
489	return op;	488	return 0;
490	}	489	}
491		490
492	/*	491	/*
493	* Sets the owner and sets the skill and exp pointers to owner's current	492	* Sets the owner and sets the skill and exp pointers to owner's current
494	* skill and experience objects.	493	* skill and experience objects.
…		…
638	}	637	}
639		638
640	if (speed < 0)	639	if (speed < 0)
641	dst->speed_left -= rndm ();	640	dst->speed_left -= rndm ();
642		641
643	dst->set_speed (dst->speed);	642	dst->activate ();
644	}	643	}
645		644
646	void	645	void
647	object::instantiate ()	646	object::instantiate ()
648	{	647	{
…		…
760	else if (action == UP_OBJ_INSERT)	759	else if (action == UP_OBJ_INSERT)
761	{	760	{
762	// this is likely overkill, TODO: revisit (schmorp)	761	// this is likely overkill, TODO: revisit (schmorp)
763	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	762	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
764	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	763	\|\| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
765	\|\| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	764	\|\| (op->is_player () && !(m.flags_ & P_PLAYER))
766	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	765	\|\| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
767	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	766	\|\| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
768	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	767	\|\| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
769	\|\| (m.move_on \| op->move_on ) != m.move_on	768	\|\| (m.move_on \| op->move_on ) != m.move_on
770	\|\| (m.move_off \| op->move_off ) != m.move_off	769	\|\| (m.move_off \| op->move_off ) != m.move_off
771	\|\| (m.move_slow \| op->move_slow) != m.move_slow	770	\|\| (m.move_slow \| op->move_slow) != m.move_slow
772	/* 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
773	* to have move_allow right now.	772	* have move_allow right now.
774	*/	773	*/
775	\|\| ((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
776	\|\| 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)
777	m.flags_ = 0;	776	m.invalidate ();
778	}	777	}
779	/* if the object is being removed, we can't make intelligent	778	/* if the object is being removed, we can't make intelligent
780	* decisions, because remove_ob can't really pass the object	779	* decisions, because remove_ob can't really pass the object
781	* that is being removed.	780	* that is being removed.
782	*/	781	*/
783	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	782	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
784	m.flags_ = 0;	783	m.invalidate ();
785	else if (action == UP_OBJ_FACE)	784	else if (action == UP_OBJ_FACE)
786	/* Nothing to do for that case */ ;	785	/* Nothing to do for that case */ ;
787	else	786	else
788	LOG (llevError, "update_object called with invalid action: %d\n", action);	787	LOG (llevError, "update_object called with invalid action: %d\n", action);
789		788
…		…
831	object::activate ()	830	object::activate ()
832	{	831	{
833	/* If already on active list, don't do anything */	832	/* If already on active list, don't do anything */
834	if (active)	833	if (active)
835	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
836		838
837	if (has_active_speed ())	839	if (has_active_speed ())
838	actives.insert (this);	840	actives.insert (this);
839	}	841	}
840		842
…		…
904	* drop on that space.	906	* drop on that space.
905	*/	907	*/
906	if (!drop_to_ground	908	if (!drop_to_ground
907	\|\| !map	909	\|\| !map
908	\|\| map->in_memory != MAP_ACTIVE	910	\|\| map->in_memory != MAP_ACTIVE
909	\|\| map->nodrop	911	\|\| map->no_drop
910	\|\| ms ().move_block == MOVE_ALL)	912	\|\| ms ().move_block == MOVE_ALL)
911	{	913	{
912	while (inv)	914	while (inv)
913	{
914	inv->destroy_inv (false);
915	inv->destroy ();	915	inv->destroy ();
916	}
917	}	916	}
918	else	917	else
919	{ /* Put objects in inventory onto this space */	918	{ /* Put objects in inventory onto this space */
920	while (inv)	919	while (inv)
921	{	920	{
…		…
925	\|\| op->flag [FLAG_NO_DROP]	924	\|\| op->flag [FLAG_NO_DROP]
926	\|\| op->type == RUNE	925	\|\| op->type == RUNE
927	\|\| op->type == TRAP	926	\|\| op->type == TRAP
928	\|\| op->flag [FLAG_IS_A_TEMPLATE]	927	\|\| op->flag [FLAG_IS_A_TEMPLATE]
929	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	928	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
930	op->destroy (true);	929	op->destroy ();
931	else	930	else
932	map->insert (op, x, y);	931	map->insert (op, x, y);
933	}	932	}
934	}	933	}
935	}	934	}
…		…
943		942
944	static struct freed_map : maptile	943	static struct freed_map : maptile
945	{	944	{
946	freed_map ()	945	freed_map ()
947	{	946	{
948	path = "<freed objects map>";	947	path = "<freed objects map>";
949	name = "/internal/freed_objects_map";	948	name = "/internal/freed_objects_map";
950	width = 3;	949	width = 3;
951	height = 3;	950	height = 3;
952	nodrop = 1;	951	no_drop = 1;
		952	no_reset = 1;
953		953
954	alloc ();	954	alloc ();
955	in_memory = MAP_ACTIVE;	955	in_memory = MAP_ACTIVE;
956	}	956	}
957		957
…		…
998	attacked_by = 0;	998	attacked_by = 0;
999	current_weapon = 0;	999	current_weapon = 0;
1000	}	1000	}
1001		1001
1002	void	1002	void
1003	object::destroy (bool destroy_inventory)	1003	object::destroy ()
1004	{	1004	{
1005	if (destroyed ())	1005	if (destroyed ())
1006	return;	1006	return;
1007		1007
1008	if (!is_head () && !head->destroyed ())	1008	if (!is_head () && !head->destroyed ())
1009	{	1009	{
1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");	1010	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
1011	head->destroy (destroy_inventory);	1011	head->destroy ();
1012	return;	1012	return;
1013	}	1013	}
1014		1014
1015	destroy_inv (!destroy_inventory);	1015	destroy_inv (false);
1016		1016
1017	if (is_head ())	1017	if (is_head ())
1018	if (sound_destroy)	1018	if (sound_destroy)
1019	play_sound (sound_destroy);	1019	play_sound (sound_destroy);
1020	else if (flag [FLAG_MONSTER])	1020	else if (flag [FLAG_MONSTER])
…		…
1057	esrv_del_item (pl->contr, count);	1057	esrv_del_item (pl->contr, count);
1058	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
1059		1059
1060	adjust_weight (env, -total_weight ());	1060	adjust_weight (env, -total_weight ());
1061		1061
1062	*(above ? &above->below : &env->inv) = below;	1062	object *pl = in_player ();
1063
1064	if (below)
1065	below->above = above;
1066		1063
1067	/* we set up values so that it could be inserted into	1064	/* we set up values so that it could be inserted into
1068	* 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
1069	* to the caller to decide what we want to do.	1066	* to the caller to decide what we want to do.
1070	*/	1067	*/
1071	map = env->map;	1068	map = env->map;
1072	x = env->x;	1069	x = env->x;
1073	y = env->y;	1070	y = env->y;
		1071
		1072	// make sure cmov optimisation is applicable
		1073	*(above ? &above->below : &env->inv) = below;
		1074	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1075
1074	above = 0;	1076	above = 0;
1075	below = 0;	1077	below = 0;
1076	env = 0;	1078	env = 0;
1077		1079
1078	/* 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
1079	* made to players inventory. If set, avoiding the call	1081	* made to players inventory. If set, avoiding the call
1080	* to save cpu time.	1082	* to save cpu time.
1081	*/	1083	*/
1082	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	{
1083	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	}
1084	}	1092	}
1085	else if (map)	1093	else if (map)
1086	{	1094	{
1087	map->dirty = true;	1095	map->dirty = true;
1088	mapspace &ms = this->ms ();	1096	mapspace &ms = this->ms ();
1089		1097
1090	if (object *pl = ms.player ())	1098	if (object *pl = ms.player ())
1091	{	1099	{
1092	if (type == PLAYER) // this == pl(!)	1100	if (is_player ())
1093	{	1101	{
		1102	if (!flag [FLAG_WIZPASS])
		1103	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1104
1094	// leaving a spot always closes any open container on the ground	1105	// leaving a spot always closes any open container on the ground
1095	if (container && !container->env)	1106	if (container && !container->env)
1096	// this causes spurious floorbox updates, but it ensures	1107	// this causes spurious floorbox updates, but it ensures
1097	// that the CLOSE event is being sent.	1108	// that the CLOSE event is being sent.
1098	close_container ();	1109	close_container ();
…		…
1108		1119
1109	esrv_del_item (pl->contr, count);	1120	esrv_del_item (pl->contr, count);
1110	}	1121	}
1111		1122
1112	/* link the object above us */	1123	/* link the object above us */
1113	if (above)	1124	// re-link, make sure compiler can easily use cmove
1114	above->below = below;	1125	*(above ? &above->below : &ms.top) = below;
1115	else	1126	*(below ? &below->above : &ms.bot) = above;
1116	ms.top = below; /* we were top, set new top */
1117
1118	/* Relink the object below us, if there is one */
1119	if (below)
1120	below->above = above;
1121	else
1122	ms.bot = above;
1123		1127
1124	above = 0;	1128	above = 0;
1125	below = 0;	1129	below = 0;
		1130
		1131	ms.invalidate ();
1126		1132
1127	if (map->in_memory == MAP_SAVING)	1133	if (map->in_memory == MAP_SAVING)
1128	return;	1134	return;
1129		1135
1130	int check_walk_off = !flag [FLAG_NO_APPLY];	1136	int check_walk_off = !flag [FLAG_NO_APPLY];
…		…
1163	}	1169	}
1164		1170
1165	last = tmp;	1171	last = tmp;
1166	}	1172	}
1167		1173
1168	/* last == NULL if there are no objects on this space */	1174	if (affects_los ())
1169	//TODO: this makes little sense, why only update the topmost object?
1170	if (!last)
1171	map->at (x, y).flags_ = 0;
1172	else
1173	update_object (last, UP_OBJ_REMOVE);
1174
1175	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1176	update_all_los (map, x, y);	1175	update_all_los (map, x, y);
1177	}	1176	}
1178	}	1177	}
1179		1178
1180	/*	1179	/*
…		…
1204	esrv_update_item (UPD_NROF, pl, top);	1203	esrv_update_item (UPD_NROF, pl, top);
1205		1204
1206	op->weight = 0; // cancel the addition above	1205	op->weight = 0; // cancel the addition above
1207	op->carrying = 0; // must be 0 already	1206	op->carrying = 0; // must be 0 already
1208		1207
1209	op->destroy (1);	1208	op->destroy ();
1210		1209
1211	return top;	1210	return top;
1212	}	1211	}
1213		1212
1214	return 0;	1213	return 0;
…		…
1242	* job preparing multi-part monsters.	1241	* job preparing multi-part monsters.
1243	*/	1242	*/
1244	object *	1243	object *
1245	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1244	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1246	{	1245	{
		1246	op->remove ();
		1247
1247	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1248	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1248	{	1249	{
1249	tmp->x = x + tmp->arch->x;	1250	tmp->x = x + tmp->arch->x;
1250	tmp->y = y + tmp->arch->y;	1251	tmp->y = y + tmp->arch->y;
1251	}	1252	}
…		…
1274	* just 'op' otherwise	1275	* just 'op' otherwise
1275	*/	1276	*/
1276	object *	1277	object *
1277	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)
1278	{	1279	{
1279	assert (!op->flag [FLAG_FREED]);
1280
1281	op->remove ();	1280	op->remove ();
		1281
		1282	if (m == &freed_map)//D TODO: remove soon
		1283	{//D
		1284	LOG (llevError \| logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1285	}//D
1282		1286
1283	/* Ideally, the caller figures this out. However, it complicates a lot	1287	/* Ideally, the caller figures this out. However, it complicates a lot
1284	* 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
1285	* need extra work	1289	* need extra work
1286	*/	1290	*/
		1291	maptile *newmap = m;
1287	if (!xy_normalise (m, op->x, op->y))	1292	if (!xy_normalise (newmap, op->x, op->y))
1288	{	1293	{
1289	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found	1294	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1290	return 0;	1295	return 0;
1291	}	1296	}
1292		1297
1293	if (object *more = op->more)	1298	if (object *more = op->more)
1294	if (!insert_ob_in_map (more, m, originator, flag))	1299	if (!insert_ob_in_map (more, m, originator, flag))
1295	return 0;	1300	return 0;
1296		1301
1297	CLEAR_FLAG (op, FLAG_REMOVED);	1302	CLEAR_FLAG (op, FLAG_REMOVED);
1298		1303
1299	op->map = m;	1304	op->map = newmap;
1300	mapspace &ms = op->ms ();	1305	mapspace &ms = op->ms ();
1301		1306
1302	/* this has to be done after we translate the coordinates.	1307	/* this has to be done after we translate the coordinates.
1303	*/	1308	*/
1304	if (op->nrof && !(flag & INS_NO_MERGE))	1309	if (op->nrof && !(flag & INS_NO_MERGE))
1305	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1310	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1306	if (object::can_merge (op, tmp))	1311	if (object::can_merge (op, tmp))
1307	{	1312	{
1308	// TODO: we atcually want to update tmp, not op,	1313	// TODO: we actually want to update tmp, not op,
1309	// but some caller surely breaks when we return tmp	1314	// but some caller surely breaks when we return tmp
1310	// from here :/	1315	// from here :/
1311	op->nrof += tmp->nrof;	1316	op->nrof += tmp->nrof;
1312	tmp->destroy (1);	1317	tmp->destroy ();
1313	}	1318	}
1314		1319
1315	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1320	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1316	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1321	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1317		1322
…		…
1324	{	1329	{
1325	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1330	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1326	abort ();	1331	abort ();
1327	}	1332	}
1328		1333
		1334	if (!originator->is_on_map ())
		1335	LOG (llevDebug \| logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1336	op->debug_desc (), originator->debug_desc ());
		1337
1329	op->above = originator;	1338	op->above = originator;
1330	op->below = originator->below;	1339	op->below = originator->below;
1331
1332	if (op->below)
1333	op->below->above = op;
1334	else
1335	ms.bot = op;
1336
1337	/* since below originator, no need to update top */
1338	originator->below = op;	1340	originator->below = op;
		1341
		1342	*(op->below ? &op->below->above : &ms.bot) = op;
1339	}	1343	}
1340	else	1344	else
1341	{	1345	{
1342	object top, floor = NULL;	1346	object *floor = 0;
1343		1347	object *top = ms.top;
1344	top = ms.bot;
1345		1348
1346	/* If there are other objects, then */	1349	/* If there are other objects, then */
1347	if (top)	1350	if (top)
1348	{	1351	{
1349	object *last = 0;
1350
1351	/*	1352	/*
1352	* If there are multiple objects on this space, we do some trickier handling.	1353	* If there are multiple objects on this space, we do some trickier handling.
1353	* We've already dealt with merging if appropriate.	1354	* We've already dealt with merging if appropriate.
1354	* Generally, we want to put the new object on top. But if	1355	* Generally, we want to put the new object on top. But if
1355	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1356	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1358	* once we get to them. This reduces the need to traverse over all of	1359	* once we get to them. This reduces the need to traverse over all of
1359	* them when adding another one - this saves quite a bit of cpu time	1360	* them when adding another one - this saves quite a bit of cpu time
1360	* when lots of spells are cast in one area. Currently, it is presumed	1361	* when lots of spells are cast in one area. Currently, it is presumed
1361	* that flying non pickable objects are spell objects.	1362	* that flying non pickable objects are spell objects.
1362	*/	1363	*/
1363	for (top = ms.bot; top; top = top->above)	1364	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1364	{	1365	{
1365	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1366	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) \|\| QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1366	floor = top;	1367	floor = tmp;
1367		1368
1368	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1369	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1369	{	1370	{
1370	/* We insert above top, so we want this object below this */	1371	/* We insert above top, so we want this object below this */
1371	top = top->below;	1372	top = tmp->below;
1372	break;	1373	break;
1373	}	1374	}
1374		1375
1375	last = top;	1376	top = tmp;
1376	}	1377	}
1377
1378	/* Don't want top to be NULL, so set it to the last valid object */
1379	top = last;
1380		1378
1381	/* We let update_position deal with figuring out what the space	1379	/* We let update_position deal with figuring out what the space
1382	* looks like instead of lots of conditions here.	1380	* looks like instead of lots of conditions here.
1383	* makes things faster, and effectively the same result.	1381	* makes things faster, and effectively the same result.
1384	*/	1382	*/
…		…
1391	*/	1389	*/
1392	if (!(flag & INS_ON_TOP)	1390	if (!(flag & INS_ON_TOP)
1393	&& ms.flags () & P_BLOCKSVIEW	1391	&& ms.flags () & P_BLOCKSVIEW
1394	&& (op->face && !faces [op->face].visibility))	1392	&& (op->face && !faces [op->face].visibility))
1395	{	1393	{
		1394	object *last;
		1395
1396	for (last = top; last != floor; last = last->below)	1396	for (last = top; last != floor; last = last->below)
1397	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1397	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1398	break;	1398	break;
1399		1399
1400	/* Check to see if we found the object that blocks view,	1400	/* Check to see if we found the object that blocks view,
…		…
1408	} /* If objects on this space */	1408	} /* If objects on this space */
1409		1409
1410	if (flag & INS_ABOVE_FLOOR_ONLY)	1410	if (flag & INS_ABOVE_FLOOR_ONLY)
1411	top = floor;	1411	top = floor;
1412		1412
1413	/* Top is the object that our object (op) is going to get inserted above.	1413	// insert object above top, or bottom-most if top = 0
1414	*/
1415
1416	/* First object on this space */
1417	if (!top)	1414	if (!top)
1418	{	1415	{
		1416	op->below = 0;
1419	op->above = ms.bot;	1417	op->above = ms.bot;
1420
1421	if (op->above)
1422	op->above->below = op;
1423
1424	op->below = 0;
1425	ms.bot = op;	1418	ms.bot = op;
		1419
		1420	*(op->above ? &op->above->below : &ms.top) = op;
1426	}	1421	}
1427	else	1422	else
1428	{ /* get inserted into the stack above top */	1423	{
1429	op->above = top->above;	1424	op->above = top->above;
1430
1431	if (op->above)
1432	op->above->below = op;	1425	top->above = op;
1433		1426
1434	op->below = top;	1427	op->below = top;
1435	top->above = op;	1428	*(op->above ? &op->above->below : &ms.top) = op;
1436	}	1429	}
		1430	}
1437		1431
1438	if (!op->above)	1432	if (op->is_player ())
1439	ms.top = op;
1440	} /* else not INS_BELOW_ORIGINATOR */
1441
1442	if (op->type == PLAYER)
1443	{	1433	{
1444	op->contr->do_los = 1;	1434	op->contr->do_los = 1;
1445	++op->map->players;	1435	++op->map->players;
1446	op->map->touch ();	1436	op->map->touch ();
1447	}	1437	}
…		…
1462	* be far away from this change and not affected in any way -	1452	* be far away from this change and not affected in any way -
1463	* this should get redone to only look for players within range,	1453	* this should get redone to only look for players within range,
1464	* or just updating the P_UPTODATE for spaces within this area	1454	* or just updating the P_UPTODATE for spaces within this area
1465	* of effect may be sufficient.	1455	* of effect may be sufficient.
1466	*/	1456	*/
1467	if (op->map->darkness && (op->glow_radius != 0))	1457	if (op->affects_los ())
		1458	{
		1459	op->ms ().invalidate ();
1468	update_all_los (op->map, op->x, op->y);	1460	update_all_los (op->map, op->x, op->y);
		1461	}
1469		1462
1470	/* updates flags (blocked, alive, no magic, etc) for this map space */	1463	/* updates flags (blocked, alive, no magic, etc) for this map space */
1471	update_object (op, UP_OBJ_INSERT);	1464	update_object (op, UP_OBJ_INSERT);
1472		1465
1473	INVOKE_OBJECT (INSERT, op);	1466	INVOKE_OBJECT (INSERT, op);
…		…
1501	/* this function inserts an object in the map, but if it	1494	/* this function inserts an object in the map, but if it
1502	* finds an object of its own type, it'll remove that one first.	1495	* finds an object of its own type, it'll remove that one first.
1503	* op is the object to insert it under: supplies x and the map.	1496	* op is the object to insert it under: supplies x and the map.
1504	*/	1497	*/
1505	void	1498	void
1506	replace_insert_ob_in_map (const char arch_string, object op)	1499	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1507	{	1500	{
1508	/* first search for itself and remove any old instances */	1501	/* first search for itself and remove any old instances */
1509		1502
1510	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1503	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1511	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1504	if (tmp->arch->archname == archname) /* same archetype */
1512	tmp->destroy (1);	1505	tmp->destroy ();
1513		1506
1514	object *tmp = arch_to_object (archetype::find (arch_string));	1507	object *tmp = arch_to_object (archetype::find (archname));
1515		1508
1516	tmp->x = op->x;	1509	tmp->x = op->x;
1517	tmp->y = op->y;	1510	tmp->y = op->y;
1518		1511
1519	insert_ob_in_map (tmp, op->map, op, 0);	1512	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1541	if (!nr)	1534	if (!nr)
1542	return true;	1535	return true;
1543		1536
1544	nr = min (nr, nrof);	1537	nr = min (nr, nrof);
1545		1538
		1539	if (nrof > nr)
		1540	{
1546	nrof -= nr;	1541	nrof -= nr;
1547
1548	if (nrof)
1549	{
1550	adjust_weight (env, -weight * nr); // carrying == 0	1542	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1551		1543
1552	if (object *pl = visible_to ())	1544	if (object *pl = visible_to ())
1553	esrv_update_item (UPD_NROF, pl, this);	1545	esrv_update_item (UPD_NROF, pl, this);
1554		1546
1555	return true;	1547	return true;
1556	}	1548	}
1557	else	1549	else
1558	{	1550	{
1559	destroy (1);	1551	destroy ();
1560	return false;	1552	return false;
1561	}	1553	}
1562	}	1554	}
1563		1555
1564	/*	1556	/*
…		…
1641	if (object *pl = tmp->visible_to ())	1633	if (object *pl = tmp->visible_to ())
1642	esrv_update_item (UPD_NROF, pl, tmp);	1634	esrv_update_item (UPD_NROF, pl, tmp);
1643		1635
1644	adjust_weight (this, op->total_weight ());	1636	adjust_weight (this, op->total_weight ());
1645		1637
1646	op->destroy (1);	1638	op->destroy ();
1647	op = tmp;	1639	op = tmp;
1648	goto inserted;	1640	goto inserted;
1649	}	1641	}
1650		1642
1651	op->owner = 0; // it's his/hers now. period.	1643	op->owner = 0; // it's his/hers now. period.
…		…
1669		1661
1670	adjust_weight (this, op->total_weight ());	1662	adjust_weight (this, op->total_weight ());
1671		1663
1672	inserted:	1664	inserted:
1673	/* reset the light list and los of the players on the map */	1665	/* reset the light list and los of the players on the map */
1674	if (op->glow_radius && map && map->darkness)	1666	if (op->glow_radius && is_on_map ())
		1667	{
		1668	update_stats ();
1675	update_all_los (map, x, y);	1669	update_all_los (map, x, y);
1676		1670	}
		1671	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1677	// if this is a player's inventory, update stats	1672	// if this is a player's inventory, update stats
1678	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1679	update_stats ();	1673	update_stats ();
1680		1674
1681	INVOKE_OBJECT (INSERT, this);	1675	INVOKE_OBJECT (INSERT, this);
1682		1676
1683	return op;	1677	return op;
…		…
1767	{	1761	{
1768		1762
1769	float	1763	float
1770	diff = tmp->move_slow_penalty * fabs (op->speed);	1764	diff = tmp->move_slow_penalty * fabs (op->speed);
1771		1765
1772	if (op->type == PLAYER)	1766	if (op->is_player ())
1773	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1767	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1774	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1768	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1775	diff /= 4.0;	1769	diff /= 4.0;
1776		1770
1777	op->speed_left -= diff;	1771	op->speed_left -= diff;
…		…
1985	* head of the object should correspond for the entire object.	1979	* head of the object should correspond for the entire object.
1986	*/	1980	*/
1987	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	1981	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1988	continue;	1982	continue;
1989		1983
1990	if (ob->blocked (m, pos.x, pos.y))	1984	if (ob->blocked (pos.m, pos.x, pos.y))
1991	continue;	1985	continue;
1992		1986
1993	altern [index++] = i;	1987	altern [index++] = i;
1994	}	1988	}
1995		1989
…		…
2063	* there is capable of.	2057	* there is capable of.
2064	*/	2058	*/
2065	int	2059	int
2066	find_dir (maptile m, int x, int y, object exclude)	2060	find_dir (maptile m, int x, int y, object exclude)
2067	{	2061	{
2068	int i, max = SIZEOFFREE, mflags;	2062	int max = SIZEOFFREE, mflags;
2069
2070	sint16 nx, ny;
2071	object *tmp;
2072	maptile *mp;
2073
2074	MoveType blocked, move_type;	2063	MoveType move_type;
2075		2064
2076	if (exclude && exclude->head_ () != exclude)	2065	if (exclude && exclude->head_ () != exclude)
2077	{	2066	{
2078	exclude = exclude->head;	2067	exclude = exclude->head;
2079	move_type = exclude->move_type;	2068	move_type = exclude->move_type;
…		…
2082	{	2071	{
2083	/* If we don't have anything, presume it can use all movement types. */	2072	/* If we don't have anything, presume it can use all movement types. */
2084	move_type = MOVE_ALL;	2073	move_type = MOVE_ALL;
2085	}	2074	}
2086		2075
2087	for (i = 1; i < max; i++)	2076	for (int i = 1; i < max; i++)
2088	{	2077	{
2089	mp = m;	2078	mapxy pos (m, x, y);
2090	nx = x + freearr_x[i];	2079	pos.move (i);
2091	ny = y + freearr_y[i];
2092		2080
2093	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2081	if (!pos.normalise ())
2094
2095	if (mflags & P_OUT_OF_MAP)
2096	max = maxfree[i];	2082	max = maxfree[i];
2097	else	2083	else
2098	{	2084	{
2099	mapspace &ms = mp->at (nx, ny);	2085	mapspace &ms = *pos;
2100		2086
2101	blocked = ms.move_block;
2102
2103	if ((move_type & blocked) == move_type)	2087	if ((move_type & ms.move_block) == move_type)
2104	max = maxfree[i];	2088	max = maxfree [i];
2105	else if (mflags & P_IS_ALIVE)	2089	else if (ms.flags () & P_IS_ALIVE)
2106	{	2090	{
2107	for (tmp = ms.bot; tmp; tmp = tmp->above)	2091	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2108	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2092	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->is_player ())
2109	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2093	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2110	break;
2111
2112	if (tmp)
2113	return freedir[i];	2094	return freedir [i];
2114	}	2095	}
2115	}	2096	}
2116	}	2097	}
2117		2098
2118	return 0;	2099	return 0;
…		…
2193	* This basically means that if direction is 15, then it could either go	2174	* This basically means that if direction is 15, then it could either go
2194	* direction 4, 14, or 16 to get back to where we are.	2175	* direction 4, 14, or 16 to get back to where we are.
2195	* Moved from spell_util.c to object.c with the other related direction	2176	* Moved from spell_util.c to object.c with the other related direction
2196	* functions.	2177	* functions.
2197	*/	2178	*/
2198	int reduction_dir[SIZEOFFREE][3] = {	2179	const int reduction_dir[SIZEOFFREE][3] = {
2199	{0, 0, 0}, /* 0 */	2180	{0, 0, 0}, /* 0 */
2200	{0, 0, 0}, /* 1 */	2181	{0, 0, 0}, /* 1 */
2201	{0, 0, 0}, /* 2 */	2182	{0, 0, 0}, /* 2 */
2202	{0, 0, 0}, /* 3 */	2183	{0, 0, 0}, /* 3 */
2203	{0, 0, 0}, /* 4 */	2184	{0, 0, 0}, /* 4 */
…		…
2299	int	2280	int
2300	can_pick (const object who, const object item)	2281	can_pick (const object who, const object item)
2301	{	2282	{
2302	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2283	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2303	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2284	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2304	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER \|\| item->weight < who->weight / 3));	2285	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () \|\| item->weight < who->weight / 3));
2305	}	2286	}
2306		2287
2307	/*	2288	/*
2308	* create clone from object to another	2289	* create clone from object to another
2309	*/	2290	*/
…		…
2341	return tmp;	2322	return tmp;
2342		2323
2343	return 0;	2324	return 0;
2344	}	2325	}
2345		2326
2346	const shstr &	2327	shstr_tmp
2347	object::kv_get (const shstr &key) const	2328	object::kv_get (shstr_tmp key) const
2348	{	2329	{
2349	for (key_value *kv = key_values; kv; kv = kv->next)	2330	for (key_value *kv = key_values; kv; kv = kv->next)
2350	if (kv->key == key)	2331	if (kv->key == key)
2351	return kv->value;	2332	return kv->value;
2352		2333
2353	return shstr_null;	2334	return shstr ();
2354	}	2335	}
2355		2336
2356	void	2337	void
2357	object::kv_set (const shstr &key, const shstr &value)	2338	object::kv_set (shstr_tmp key, shstr_tmp value)
2358	{	2339	{
2359	for (key_value *kv = key_values; kv; kv = kv->next)	2340	for (key_value *kv = key_values; kv; kv = kv->next)
2360	if (kv->key == key)	2341	if (kv->key == key)
2361	{	2342	{
2362	kv->value = value;	2343	kv->value = value;
…		…
2371		2352
2372	key_values = kv;	2353	key_values = kv;
2373	}	2354	}
2374		2355
2375	void	2356	void
2376	object::kv_del (const shstr &key)	2357	object::kv_del (shstr_tmp key)
2377	{	2358	{
2378	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)	2359	for (key_value *kvp = &key_values; kvp; kvp = &(*kvp)->next)
2379	if ((*kvp)->key == key)	2360	if ((*kvp)->key == key)
2380	{	2361	{
2381	key_value kv = kvp;	2362	key_value kv = kvp;
…		…
2440	{	2421	{
2441	char flagdesc[512];	2422	char flagdesc[512];
2442	char info2[256 * 4];	2423	char info2[256 * 4];
2443	char *p = info;	2424	char *p = info;
2444		2425
2445	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2426	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2446	count,	2427	count,
2447	uuid.c_str (),	2428	uuid.c_str (),
2448	&name,	2429	&name,
2449	title ? "\",title:\"" : "",	2430	title ? ",title:\"" : "",
2450	title ? (const char *)title : "",	2431	title ? (const char *)title : "",
		2432	title ? "\"" : "",
2451	flag_desc (flagdesc, 512), type);	2433	flag_desc (flagdesc, 512), type);
2452		2434
2453	if (!flag[FLAG_REMOVED] && env)	2435	if (!flag[FLAG_REMOVED] && env)
2454	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2436	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2455		2437
…		…
2549	// else if (!old_container->env && contr && contr->ns)	2531	// else if (!old_container->env && contr && contr->ns)
2550	// contr->ns->floorbox_reset ();	2532	// contr->ns->floorbox_reset ();
2551	}	2533	}
2552		2534
2553	object *	2535	object *
2554	object::force_find (const shstr name)	2536	object::force_find (shstr_tmp name)
2555	{	2537	{
2556	/* cycle through his inventory to look for the MARK we want to	2538	/* cycle through his inventory to look for the MARK we want to
2557	* place	2539	* place
2558	*/	2540	*/
2559	for (object *tmp = inv; tmp; tmp = tmp->below)	2541	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2561	return splay (tmp);	2543	return splay (tmp);
2562		2544
2563	return 0;	2545	return 0;
2564	}	2546	}
2565		2547
2566	void	2548	object *
2567	object::force_add (const shstr name, int duration)	2549	object::force_add (shstr_tmp name, int duration)
2568	{	2550	{
2569	if (object *force = force_find (name))	2551	if (object *force = force_find (name))
2570	force->destroy ();	2552	force->destroy ();
2571		2553
2572	object *force = get_archetype (FORCE_NAME);	2554	object *force = get_archetype (FORCE_NAME);
…		…
2577		2559
2578	force->set_speed (duration ? 1.f / duration : 0.f);	2560	force->set_speed (duration ? 1.f / duration : 0.f);
2579	force->flag [FLAG_IS_USED_UP] = true;	2561	force->flag [FLAG_IS_USED_UP] = true;
2580	force->flag [FLAG_APPLIED] = true;	2562	force->flag [FLAG_APPLIED] = true;
2581		2563
2582	insert (force);	2564	return insert (force);
2583	}	2565	}
2584		2566
2585	void	2567	void
2586	object::play_sound (faceidx sound)	2568	object::play_sound (faceidx sound)
2587	{	2569	{
…		…
2598	}	2580	}
2599	else	2581	else
2600	map->play_sound (sound, x, y);	2582	map->play_sound (sound, x, y);
2601	}	2583	}
2602		2584
		2585	void
		2586	object::make_noise ()
		2587	{
		2588	// we do not model noise in the map, so instead put
		2589	// a temporary light into the noise source
		2590	// could use the map instead, but that's less reliable for our
		2591	// goal, which is to make invisibility a bit harder to exploit
		2592
		2593	// currently only works sensibly for players
		2594	if (!is_player ())
		2595	return;
		2596
		2597	// find old force, or create new one
		2598	object *force = force_find (shstr_noise_force);
		2599
		2600	if (force)
		2601	force->speed_left = -1.f; // patch old speed up
		2602	else
		2603	{
		2604	force = archetype::get (shstr_noise_force);
		2605
		2606	force->slaying = shstr_noise_force;
		2607	force->stats.food = 1;
		2608	force->speed_left = -1.f;
		2609
		2610	force->set_speed (1.f / 4.f);
		2611	force->flag [FLAG_IS_USED_UP] = true;
		2612	force->flag [FLAG_APPLIED] = true;
		2613
		2614	insert (force);
		2615	}
		2616	}
		2617

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.235 by root, Tue May 6 20:00:12 2008 UTC vs. Revision 1.278 by root, Thu Jan 1 19:42:43 2009 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.235 by root, Tue May 6 20:00:12 2008 UTC vs.
Revision 1.278 by root, Thu Jan 1 19:42:43 2009 UTC