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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.206 by root, Tue Apr 15 14:21:04 2008 UTC vs.
Revision 1.223 by root, Wed Apr 30 08:29:31 2008 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008 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
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying
26	variable. */
27	#include <global.h>	24	#include <global.h>
28	#include <stdio.h>	25	#include <stdio.h>
29	#include <sys/types.h>	26	#include <sys/types.h>
30	#include <sys/uio.h>	27	#include <sys/uio.h>
31	#include <object.h>	28	#include <object.h>
32	#include <funcpoint.h>
33	#include <sproto.h>	29	#include <sproto.h>
34	#include <loader.h>	30	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
…		…
205	\|\| ob1->value != ob2->value	201	\|\| ob1->value != ob2->value
206	\|\| ob1->name != ob2->name)	202	\|\| ob1->name != ob2->name)
207	return 0;	203	return 0;
208		204
209	/* Do not merge objects if nrof would overflow. First part checks	205	/* Do not merge objects if nrof would overflow. First part checks
210	* for unsigned overflow (2c), second part checks wether the result	206	* for unsigned overflow (2c), second part checks whether the result
211	* would fit into a 32 bit signed int, which is often used to hold	207	* would fit into a 32 bit signed int, which is often used to hold
212	* nrof values.	208	* nrof values.
213	*/	209	*/
214	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))	210	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
215	return 0;	211	return 0;
…		…
224	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
225		221
226	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
227	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
228		224
229	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	225	if (ob1->arch->name != ob2->arch->name
230	\|\| ob1->arch != ob2->arch
231	\|\| ob1->name != ob2->name	226	\|\| ob1->name != ob2->name
232	\|\| ob1->title != ob2->title	227	\|\| ob1->title != ob2->title
233	\|\| ob1->msg != ob2->msg	228	\|\| ob1->msg != ob2->msg
234	\|\| ob1->weight != ob2->weight	229	\|\| ob1->weight != ob2->weight
235	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
236	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
237	\|\| ob1->attacktype != ob2->attacktype	230	\|\| ob1->attacktype != ob2->attacktype
238	\|\| ob1->magic != ob2->magic	231	\|\| ob1->magic != ob2->magic
239	\|\| ob1->slaying != ob2->slaying	232	\|\| ob1->slaying != ob2->slaying
240	\|\| ob1->skill != ob2->skill	233	\|\| ob1->skill != ob2->skill
241	\|\| ob1->value != ob2->value	234	\|\| ob1->value != ob2->value
…		…
248	\|\| ob1->move_block != ob2->move_block	241	\|\| ob1->move_block != ob2->move_block
249	\|\| ob1->move_allow != ob2->move_allow	242	\|\| ob1->move_allow != ob2->move_allow
250	\|\| ob1->move_on != ob2->move_on	243	\|\| ob1->move_on != ob2->move_on
251	\|\| ob1->move_off != ob2->move_off	244	\|\| ob1->move_off != ob2->move_off
252	\|\| ob1->move_slow != ob2->move_slow	245	\|\| ob1->move_slow != ob2->move_slow
253	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)	246	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty
		247	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		248	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
		249	return 0;
		250
		251	if ((ob1->flag ^ ob2->flag)
		252	.reset (FLAG_INV_LOCKED)
		253	.reset (FLAG_CLIENT_SENT)
		254	.reset (FLAG_REMOVED)
		255	.any ())
254	return 0;	256	return 0;
255		257
256	/* This is really a spellbook check - we should in general	258	/* This is really a spellbook check - we should in general
257	* not merge objects with real inventories, as splitting them	259	* not merge objects with real inventories, as splitting them
258	* is hard.	260	* is hard.
…		…
297		299
298	if (ob1->key_values \|\| ob2->key_values)	300	if (ob1->key_values \|\| ob2->key_values)
299	{	301	{
300	/* At least one of these has key_values. */	302	/* At least one of these has key_values. */
301	if ((!ob1->key_values) != (!ob2->key_values))	303	if ((!ob1->key_values) != (!ob2->key_values))
302	/* One has fields, but the other one doesn't. */	304	return 0; /* One has fields, but the other one doesn't. */
303	return 0;	305
304	else if (!compare_ob_value_lists (ob1, ob2))	306	if (!compare_ob_value_lists (ob1, ob2))
305	return 0;	307	return 0;
306	}	308	}
307		309
308	if (ob1->self \|\| ob2->self)	310	if (ob1->self \|\| ob2->self)
309	{	311	{
…		…
315	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;	317	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
316	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;	318	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
317		319
318	if (k1 != k2)	320	if (k1 != k2)
319	return 0;	321	return 0;
		322
320	else if (k1 == 0)	323	if (k1 == 0)
321	return 1;	324	return 1;
		325
322	else if (!cfperl_can_merge (ob1, ob2))	326	if (!cfperl_can_merge (ob1, ob2))
323	return 0;	327	return 0;
324	}	328	}
325	}	329	}
326		330
327	/* Everything passes, must be OK. */	331	/* Everything passes, must be OK. */
328	return 1;	332	return 1;
329	}	333	}
330		334
		335	// find player who can see this object
		336	object *
		337	object::visible_to () const
		338	{
		339	if (client_visible () && !flag [FLAG_REMOVED])
		340	{
		341	// see if we are in a container of sorts
		342	if (env)
		343	{
		344	// the player inventory itself is always visible
		345	if (env->type == PLAYER)
		346	return env;
		347
		348	// else a player could have our env open
		349	object *envest = env->outer_env ();
		350
		351	// the player itself is always on a map, so we will find him here
		352	// even if our inv is in a player.
		353	if (envest->is_on_map ())
		354	if (object *pl = envest->ms ().player ())
		355	if (pl->container == env)
		356	return pl;
		357	}
		358	else
		359	{
		360	// maybe there is a player standing on the same mapspace
		361	// this will catch the case where "this" is a player
		362	if (object *pl = ms ().player ())
		363	if (!pl->container \|\| this == pl->container)
		364	return pl;
		365	}
		366	}
		367
		368	return 0;
		369	}
		370
		371	// adjust weight per container type ("of holding")
		372	static sint32
		373	weight_adjust (object *op, sint32 weight)
		374	{
		375	return op->type == CONTAINER
		376	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		377	: weight;
		378	}
		379
331	/*	380	/*
		381	* adjust_weight(object, weight) adds the specified weight to an object,
		382	* and also updates how much the environment(s) is/are carrying.
		383	*/
		384	static void
		385	adjust_weight (object *op, sint32 weight)
		386	{
		387	while (op)
		388	{
		389	weight = weight_adjust (op, weight);
		390
		391	if (!weight)
		392	return;
		393
		394	op->carrying += weight;
		395
		396	if (object *pl = op->visible_to ())
		397	if (pl != op) // player is handled lazily
		398	esrv_update_item (UPD_WEIGHT, pl, op);
		399
		400	op = op->env;
		401	}
		402	}
		403
		404	/*
332	* sum_weight() is a recursive function which calculates the weight	405	* this is a recursive function which calculates the weight
333	* an object is carrying. It goes through in figures out how much	406	* an object is carrying. It goes through op and figures out how much
334	* containers are carrying, and sums it up.	407	* containers are carrying, and sums it up.
335	*/	408	*/
336	long	409	void
337	sum_weight (object *op)	410	object::update_weight ()
338	{	411	{
339	long sum;	412	sint32 sum = 0;
340	object *inv;
341		413
342	for (sum = 0, inv = op->inv; inv; inv = inv->below)	414	for (object *op = inv; op; op = op->below)
343	{	415	{
344	if (inv->inv)	416	if (op->inv)
345	sum_weight (inv);	417	op->update_weight ();
346		418
347	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	419	sum += op->total_weight ();
		420	}
		421
		422	sum = weight_adjust (this, sum);
		423
		424	if (sum != carrying)
348	}	425	{
349
350	if (op->type == CONTAINER && op->stats.Str)
351	sum = (sum * (100 - op->stats.Str)) / 100;
352
353	if (op->carrying != sum)
354	op->carrying = sum;	426	carrying = sum;
355		427
356	return sum;	428	if (object *pl = visible_to ())
		429	if (pl != this) // player is handled lazily
		430	esrv_update_item (UPD_WEIGHT, pl, this);
		431	}
357	}	432	}
358		433
359	/**	434	/*
360	* Return the outermost environment object for a given object.	435	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
361	*/
362
363	object *
364	object_get_env_recursive (object *op)
365	{
366	while (op->env != NULL)
367	op = op->env;
368	return op;
369	}
370
371	/*
372	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
373	* Some error messages.
374	* The result of the dump is stored in the static global errmsg array.
375	*/	436	*/
376	char *	437	char *
377	dump_object (object *op)	438	dump_object (object *op)
378	{	439	{
379	if (!op)	440	if (!op)
…		…
393	get_nearest_part (object op, const object pl)	454	get_nearest_part (object op, const object pl)
394	{	455	{
395	object tmp, closest;	456	object tmp, closest;
396	int last_dist, i;	457	int last_dist, i;
397		458
398	if (op->more == NULL)	459	if (!op->more)
399	return op;	460	return op;
		461
400	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	462	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		463	tmp;
		464	tmp = tmp->more)
401	if ((i = distance (tmp, pl)) < last_dist)	465	if ((i = distance (tmp, pl)) < last_dist)
402	closest = tmp, last_dist = i;	466	closest = tmp, last_dist = i;
		467
403	return closest;	468	return closest;
404	}	469	}
405		470
406	/*	471	/*
407	* Returns the object which has the count-variable equal to the argument.	472	* Returns the object which has the count-variable equal to the argument.
		473	* VERRRY slow.
408	*/	474	*/
409	object *	475	object *
410	find_object (tag_t i)	476	find_object (tag_t i)
411	{	477	{
412	for_all_objects (op)	478	for_all_objects (op)
…		…
680	* UP_OBJ_FACE: only the objects face has changed.	746	* UP_OBJ_FACE: only the objects face has changed.
681	*/	747	*/
682	void	748	void
683	update_object (object *op, int action)	749	update_object (object *op, int action)
684	{	750	{
685	if (op == NULL)	751	if (!op)
686	{	752	{
687	/* this should never happen */	753	/* this should never happen */
688	LOG (llevDebug, "update_object() called for NULL object.\n");	754	LOG (llevError \| logBacktrace, "update_object() called for NULL object.\n");
689	return;	755	return;
690	}	756	}
691		757
692	if (op->env)	758	if (!op->is_on_map ())
693	{	759	{
694	/* Animation is currently handled by client, so nothing	760	/* Animation is currently handled by client, so nothing
695	* to do in this case.	761	* to do in this case.
696	*/	762	*/
697	return;	763	return;
698	}	764	}
699
700	/* If the map is saving, don't do anything as everything is
701	* going to get freed anyways.
702	*/
703	if (!op->map \|\| op->map->in_memory == MAP_SAVING)
704	return;
705		765
706	/* make sure the object is within map boundaries */	766	/* make sure the object is within map boundaries */
707	if (op->x < 0 \|\| op->x >= op->map->width \|\| op->y < 0 \|\| op->y >= op->map->height)	767	if (op->x < 0 \|\| op->x >= op->map->width \|\| op->y < 0 \|\| op->y >= op->map->height)
708	{	768	{
709	LOG (llevError, "update_object() called for object out of map!\n");	769	LOG (llevError, "update_object() called for object out of map!\n");
…		…
852	object::destroy_inv (bool drop_to_ground)	912	object::destroy_inv (bool drop_to_ground)
853	{	913	{
854	// need to check first, because the checks below might segfault	914	// need to check first, because the checks below might segfault
855	// as we might be on an invalid mapspace and crossfire code	915	// as we might be on an invalid mapspace and crossfire code
856	// is too buggy to ensure that the inventory is empty.	916	// is too buggy to ensure that the inventory is empty.
857	// corollary: if you create arrows etc. with stuff in tis inventory,	917	// corollary: if you create arrows etc. with stuff in its inventory,
858	// cf will crash below with off-map x and y	918	// cf will crash below with off-map x and y
859	if (!inv)	919	if (!inv)
860	return;	920	return;
861		921
862	/* Only if the space blocks everything do we not process -	922	/* Only if the space blocks everything do we not process -
…		…
869	\|\| map->nodrop	929	\|\| map->nodrop
870	\|\| ms ().move_block == MOVE_ALL)	930	\|\| ms ().move_block == MOVE_ALL)
871	{	931	{
872	while (inv)	932	while (inv)
873	{	933	{
874	inv->destroy_inv (drop_to_ground);	934	inv->destroy_inv (false);
875	inv->destroy ();	935	inv->destroy ();
876	}	936	}
877	}	937	}
878	else	938	else
879	{ /* Put objects in inventory onto this space */	939	{ /* Put objects in inventory onto this space */
…		…
885	\|\| op->flag [FLAG_NO_DROP]	945	\|\| op->flag [FLAG_NO_DROP]
886	\|\| op->type == RUNE	946	\|\| op->type == RUNE
887	\|\| op->type == TRAP	947	\|\| op->type == TRAP
888	\|\| op->flag [FLAG_IS_A_TEMPLATE]	948	\|\| op->flag [FLAG_IS_A_TEMPLATE]
889	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	949	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
890	op->destroy ();	950	op->destroy (true);
891	else	951	else
892	map->insert (op, x, y);	952	map->insert (op, x, y);
893	}	953	}
894	}	954	}
895	}	955	}
…		…
899	object *op = new object;	959	object *op = new object;
900	op->link ();	960	op->link ();
901	return op;	961	return op;
902	}	962	}
903		963
		964	static struct freed_map : maptile
		965	{
		966	freed_map ()
		967	{
		968	path = "<freed objects map>";
		969	name = "/internal/freed_objects_map";
		970	width = 3;
		971	height = 3;
		972	nodrop = 1;
		973
		974	alloc ();
		975	in_memory = MAP_ACTIVE;
		976	}
		977	} freed_map; // freed objects are moved here to avoid crashes
		978
904	void	979	void
905	object::do_destroy ()	980	object::do_destroy ()
906	{	981	{
907	attachable::do_destroy ();
908
909	if (flag [FLAG_IS_LINKED])	982	if (flag [FLAG_IS_LINKED])
910	remove_button_link (this);	983	remove_button_link (this);
911		984
912	if (flag [FLAG_FRIENDLY])	985	if (flag [FLAG_FRIENDLY])
913	remove_friendly_object (this);	986	remove_friendly_object (this);
914		987
915	if (!flag [FLAG_REMOVED])
916	remove ();	988	remove ();
917		989
918	destroy_inv (true);	990	attachable::do_destroy ();
919		991
920	deactivate ();	992	deactivate ();
921	unlink ();	993	unlink ();
922		994
923	flag [FLAG_FREED] = 1;	995	flag [FLAG_FREED] = 1;
924		996
925	// hack to ensure that freed objects still have a valid map	997	// hack to ensure that freed objects still have a valid map
926	{
927	static maptile *freed_map; // freed objects are moved here to avoid crashes
928
929	if (!freed_map)
930	{
931	freed_map = new maptile;
932
933	freed_map->path = "<freed objects map>";
934	freed_map->name = "/internal/freed_objects_map";
935	freed_map->width = 3;
936	freed_map->height = 3;
937	freed_map->nodrop = 1;
938
939	freed_map->alloc ();
940	freed_map->in_memory = MAP_ACTIVE;
941	}
942
943	map = freed_map;	998	map = &freed_map;
944	x = 1;	999	x = 1;
945	y = 1;	1000	y = 1;
946	}
947		1001
948	if (more)	1002	if (more)
949	{	1003	{
950	more->destroy ();	1004	more->destroy ();
951	more = 0;	1005	more = 0;
…		…
964	object::destroy (bool destroy_inventory)	1018	object::destroy (bool destroy_inventory)
965	{	1019	{
966	if (destroyed ())	1020	if (destroyed ())
967	return;	1021	return;
968		1022
		1023	if (!is_head () && !head->destroyed ())
		1024	{
		1025	LOG (llevError \| logBacktrace, "tried to destroy the tail of an object");
		1026	head->destroy (destroy_inventory);
		1027	return;
		1028	}
		1029
969	if (destroy_inventory)	1030	destroy_inv (!destroy_inventory);
970	destroy_inv (false);
971		1031
972	if (is_head ())	1032	if (is_head ())
973	if (sound_destroy)	1033	if (sound_destroy)
974	play_sound (sound_destroy);	1034	play_sound (sound_destroy);
975	else if (flag [FLAG_MONSTER])	1035	else if (flag [FLAG_MONSTER])
976	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1036	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
977		1037
978	attachable::destroy ();	1038	attachable::destroy ();
979	}
980
981	/*
982	* sub_weight() recursively (outwards) subtracts a number from the
983	* weight of an object (and what is carried by it's environment(s)).
984	*/
985	void
986	sub_weight (object *op, signed long weight)
987	{
988	while (op != NULL)
989	{
990	if (op->type == CONTAINER)
991	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
992
993	op->carrying -= weight;
994	op = op->env;
995	}
996	}	1039	}
997		1040
998	/* op->remove ():	1041	/* op->remove ():
999	* This function removes the object op from the linked list of objects	1042	* This function removes the object op from the linked list of objects
1000	* which it is currently tied to. When this function is done, the	1043	* which it is currently tied to. When this function is done, the
…		…
1006	object::do_remove ()	1049	object::do_remove ()
1007	{	1050	{
1008	object tmp, last = 0;	1051	object tmp, last = 0;
1009	object *otmp;	1052	object *otmp;
1010		1053
1011	if (QUERY_FLAG (this, FLAG_REMOVED))	1054	if (flag [FLAG_REMOVED])
1012	return;	1055	return;
1013		1056
1014	SET_FLAG (this, FLAG_REMOVED);
1015	INVOKE_OBJECT (REMOVE, this);	1057	INVOKE_OBJECT (REMOVE, this);
		1058
		1059	flag [FLAG_REMOVED] = true;
1016		1060
1017	if (more)	1061	if (more)
1018	more->remove ();	1062	more->remove ();
1019		1063
1020	/*	1064	/*
1021	* In this case, the object to be removed is in someones	1065	* In this case, the object to be removed is in someones
1022	* inventory.	1066	* inventory.
1023	*/	1067	*/
1024	if (env)	1068	if (env)
1025	{	1069	{
		1070	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1071	if (object *pl = visible_to ())
		1072	esrv_del_item (pl->contr, count);
		1073	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1074
		1075	adjust_weight (env, -total_weight ());
		1076
		1077	*(above ? &above->below : &env->inv) = below;
		1078
1026	if (nrof)	1079	if (below)
1027	sub_weight (env, weight * nrof);	1080	below->above = above;
1028	else	1081
1029	sub_weight (env, weight + carrying);	1082	/* we set up values so that it could be inserted into
		1083	* the map, but we don't actually do that - it is up
		1084	* to the caller to decide what we want to do.
		1085	*/
		1086	map = env->map;
		1087	x = env->x;
		1088	y = env->y;
		1089	above = 0;
		1090	below = 0;
		1091	env = 0;
1030		1092
1031	/* NO_FIX_PLAYER is set when a great many changes are being	1093	/* NO_FIX_PLAYER is set when a great many changes are being
1032	* made to players inventory. If set, avoiding the call	1094	* made to players inventory. If set, avoiding the call
1033	* to save cpu time.	1095	* to save cpu time.
1034	*/	1096	*/
1035	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1097	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1036	otmp->update_stats ();	1098	otmp->update_stats ();
1037
1038	if (above)
1039	above->below = below;
1040	else
1041	env->inv = below;
1042
1043	if (below)
1044	below->above = above;
1045
1046	/* we set up values so that it could be inserted into
1047	* the map, but we don't actually do that - it is up
1048	* to the caller to decide what we want to do.
1049	*/
1050	x = env->x, y = env->y;
1051	map = env->map;
1052	above = 0, below = 0;
1053	env = 0;
1054	}	1099	}
1055	else if (map)	1100	else if (map)
1056	{	1101	{
1057	if (type == PLAYER)
1058	{
1059	// leaving a spot always closes any open container on the ground
1060	if (container && !container->env)
1061	// this causes spurious floorbox updates, but it ensures
1062	// that the CLOSE event is being sent.
1063	close_container ();
1064
1065	--map->players;
1066	map->touch ();
1067	}
1068
1069	map->dirty = true;	1102	map->dirty = true;
1070	mapspace &ms = this->ms ();	1103	mapspace &ms = this->ms ();
		1104
		1105	if (object *pl = ms.player ())
		1106	{
		1107	if (type == PLAYER) // this == pl(!)
		1108	{
		1109	// leaving a spot always closes any open container on the ground
		1110	if (container && !container->env)
		1111	// this causes spurious floorbox updates, but it ensures
		1112	// that the CLOSE event is being sent.
		1113	close_container ();
		1114
		1115	--map->players;
		1116	map->touch ();
		1117	}
		1118	else if (pl->container == this)
		1119	{
		1120	// removing a container should close it
		1121	close_container ();
		1122	}
		1123
		1124	esrv_del_item (pl->contr, count);
		1125	}
1071		1126
1072	/* link the object above us */	1127	/* link the object above us */
1073	if (above)	1128	if (above)
1074	above->below = below;	1129	above->below = below;
1075	else	1130	else
…		…
1105	* removed (most likely destroyed), update the player view	1160	* removed (most likely destroyed), update the player view
1106	* appropriately.	1161	* appropriately.
1107	*/	1162	*/
1108	pl->close_container ();	1163	pl->close_container ();
1109		1164
1110	pl->contr->ns->floorbox_update ();	1165	//TODO: the floorbox prev/next might need updating
		1166	esrv_del_item (pl->contr, count);
1111	}	1167	}
1112		1168
1113	for (tmp = ms.bot; tmp; tmp = tmp->above)	1169	for (tmp = ms.bot; tmp; tmp = tmp->above)
1114	{	1170	{
1115	/* No point updating the players look faces if he is the object	1171	/* No point updating the players look faces if he is the object
…		…
1159	if (!top)	1215	if (!top)
1160	for (top = op; top && top->above; top = top->above)	1216	for (top = op; top && top->above; top = top->above)
1161	;	1217	;
1162		1218
1163	for (; top; top = top->below)	1219	for (; top; top = top->below)
1164	{
1165	if (top == op)
1166	continue;
1167
1168	if (object::can_merge (op, top))	1220	if (object::can_merge (op, top))
1169	{	1221	{
1170	top->nrof += op->nrof;	1222	top->nrof += op->nrof;
1171		1223
1172	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1224	if (object *pl = top->visible_to ())
1173	op->weight = 0; /* Don't want any adjustements now */	1225	esrv_update_item (UPD_NROF, pl, top);
		1226
		1227	op->weight = 0; // cancel the addition above
		1228	op->carrying = 0; // must be 0 already
		1229
1174	op->destroy ();	1230	op->destroy (1);
		1231
1175	return top;	1232	return top;
1176	}	1233	}
1177	}
1178		1234
1179	return 0;	1235	return 0;
1180	}	1236	}
1181		1237
1182	void	1238	void
…		…
1241	object *	1297	object *
1242	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1298	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1243	{	1299	{
1244	assert (!op->flag [FLAG_FREED]);	1300	assert (!op->flag [FLAG_FREED]);
1245		1301
1246	object top, floor = NULL;
1247
1248	op->remove ();	1302	op->remove ();
1249		1303
1250	/* Ideally, the caller figures this out. However, it complicates a lot	1304	/* Ideally, the caller figures this out. However, it complicates a lot
1251	* of areas of callers (eg, anything that uses find_free_spot would now	1305	* of areas of callers (eg, anything that uses find_free_spot would now
1252	* need extra work	1306	* need extra work
1253	*/	1307	*/
1254	if (!xy_normalise (m, op->x, op->y))	1308	if (!xy_normalise (m, op->x, op->y))
1255	{	1309	{
1256	op->destroy ();	1310	op->destroy (1);
1257	return 0;	1311	return 0;
1258	}	1312	}
1259		1313
1260	if (object *more = op->more)	1314	if (object *more = op->more)
1261	if (!insert_ob_in_map (more, m, originator, flag))	1315	if (!insert_ob_in_map (more, m, originator, flag))
…		…
1270	*/	1324	*/
1271	if (op->nrof && !(flag & INS_NO_MERGE))	1325	if (op->nrof && !(flag & INS_NO_MERGE))
1272	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1326	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1273	if (object::can_merge (op, tmp))	1327	if (object::can_merge (op, tmp))
1274	{	1328	{
		1329	// TODO: we atcually want to update tmp, not op,
		1330	// but some caller surely breaks when we return tmp
		1331	// from here :/
1275	op->nrof += tmp->nrof;	1332	op->nrof += tmp->nrof;
1276	tmp->destroy ();	1333	tmp->destroy (1);
1277	}	1334	}
1278		1335
1279	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1336	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1280	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1337	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1281		1338
…		…
1301	/* since below originator, no need to update top */	1358	/* since below originator, no need to update top */
1302	originator->below = op;	1359	originator->below = op;
1303	}	1360	}
1304	else	1361	else
1305	{	1362	{
		1363	object top, floor = NULL;
		1364
1306	top = ms.bot;	1365	top = ms.bot;
1307		1366
1308	/* If there are other objects, then */	1367	/* If there are other objects, then */
1309	if (top)	1368	if (top)
1310	{	1369	{
…		…
1409	}	1468	}
1410		1469
1411	op->map->dirty = true;	1470	op->map->dirty = true;
1412		1471
1413	if (object *pl = ms.player ())	1472	if (object *pl = ms.player ())
1414	pl->contr->ns->floorbox_update ();	1473	//TODO: the floorbox prev/next might need updating
		1474	esrv_send_item (pl, op);
1415		1475
1416	/* If this object glows, it may affect lighting conditions that are	1476	/* If this object glows, it may affect lighting conditions that are
1417	* visible to others on this map. But update_all_los is really	1477	* visible to others on this map. But update_all_los is really
1418	* an inefficient way to do this, as it means los for all players	1478	* an inefficient way to do this, as it means los for all players
1419	* on the map will get recalculated. The players could very well	1479	* on the map will get recalculated. The players could very well
…		…
1461	* op is the object to insert it under: supplies x and the map.	1521	* op is the object to insert it under: supplies x and the map.
1462	*/	1522	*/
1463	void	1523	void
1464	replace_insert_ob_in_map (const char arch_string, object op)	1524	replace_insert_ob_in_map (const char arch_string, object op)
1465	{	1525	{
1466	object tmp, tmp1;
1467
1468	/* first search for itself and remove any old instances */	1526	/* first search for itself and remove any old instances */
1469		1527
1470	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1528	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1471	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1529	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1472	tmp->destroy ();	1530	tmp->destroy (1);
1473		1531
1474	tmp1 = arch_to_object (archetype::find (arch_string));	1532	object *tmp = arch_to_object (archetype::find (arch_string));
1475		1533
1476	tmp1->x = op->x;	1534	tmp->x = op->x;
1477	tmp1->y = op->y;	1535	tmp->y = op->y;
		1536
1478	insert_ob_in_map (tmp1, op->map, op, 0);	1537	insert_ob_in_map (tmp, op->map, op, 0);
1479	}	1538	}
1480		1539
1481	object *	1540	object *
1482	object::insert_at (object where, object originator, int flags)	1541	object::insert_at (object where, object originator, int flags)
1483	{	1542	{
…		…
1486	else	1545	else
1487	return where->map->insert (this, where->x, where->y, originator, flags);	1546	return where->map->insert (this, where->x, where->y, originator, flags);
1488	}	1547	}
1489		1548
1490	/*	1549	/*
1491	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1492	* is returned contains nr objects, and the remaining parts contains
1493	* the rest (or is removed and freed if that number is 0).
1494	* On failure, NULL is returned, and the reason put into the
1495	* global static errmsg array.
1496	*/
1497	object *
1498	get_split_ob (object *orig_ob, uint32 nr)
1499	{
1500	object *newob;
1501	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1502
1503	if (orig_ob->nrof < nr)
1504	{
1505	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1506	return NULL;
1507	}
1508
1509	newob = object_create_clone (orig_ob);
1510
1511	if ((orig_ob->nrof -= nr) < 1)
1512	orig_ob->destroy (1);
1513	else if (!is_removed)
1514	{
1515	if (orig_ob->env != NULL)
1516	sub_weight (orig_ob->env, orig_ob->weight * nr);
1517	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1518	{
1519	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1520	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1521	return NULL;
1522	}
1523	}
1524
1525	newob->nrof = nr;
1526
1527	return newob;
1528	}
1529
1530	/*
1531	* decrease_ob_nr(object, number) decreases a specified number from	1550	* decrease(object, number) decreases a specified number from
1532	* the amount of an object. If the amount reaches 0, the object	1551	* the amount of an object. If the amount reaches 0, the object
1533	* is subsequently removed and freed.	1552	* is subsequently removed and freed.
1534	*	1553	*
1535	* Return value: 'op' if something is left, NULL if the amount reached 0	1554	* Return value: 'op' if something is left, NULL if the amount reached 0
1536	*/	1555	*/
		1556	bool
		1557	object::decrease (sint32 nr)
		1558	{
		1559	if (!nr)
		1560	return true;
		1561
		1562	nr = min (nr, nrof);
		1563
		1564	nrof -= nr;
		1565
		1566	if (nrof)
		1567	{
		1568	adjust_weight (env, -weight * nr); // carrying == 0
		1569
		1570	if (object *pl = visible_to ())
		1571	esrv_update_item (UPD_NROF, pl, this);
		1572
		1573	return true;
		1574	}
		1575	else
		1576	{
		1577	destroy (1);
		1578	return false;
		1579	}
		1580	}
		1581
		1582	/*
		1583	* split(ob,nr) splits up ob into two parts. The part which
		1584	* is returned contains nr objects, and the remaining parts contains
		1585	* the rest (or is removed and returned if that number is 0).
		1586	* On failure, NULL is returned.
		1587	*/
1537	object *	1588	object *
1538	decrease_ob_nr (object *op, uint32 i)	1589	object::split (sint32 nr)
1539	{	1590	{
1540	object *tmp;	1591	int have = number_of ();
1541		1592
1542	if (i == 0) /* objects with op->nrof require this check */	1593	if (have < nr)
1543	return op;	1594	return 0;
1544		1595	else if (have == nr)
1545	if (i > op->nrof)
1546	i = op->nrof;
1547
1548	if (QUERY_FLAG (op, FLAG_REMOVED))
1549	op->nrof -= i;
1550	else if (op->env)
1551	{	1596	{
1552	/* is this object in the players inventory, or sub container
1553	* therein?
1554	*/
1555	tmp = op->in_player ();
1556	/* nope. Is this a container the player has opened?
1557	* If so, set tmp to that player.
1558	* IMO, searching through all the players will mostly
1559	* likely be quicker than following op->env to the map,
1560	* and then searching the map for a player.
1561	*/
1562	if (!tmp)
1563	for_all_players (pl)
1564	if (pl->ob->container == op->env)
1565	{
1566	tmp = pl->ob;
1567	break;
1568	}
1569
1570	if (i < op->nrof)
1571	{
1572	sub_weight (op->env, op->weight * i);
1573	op->nrof -= i;
1574	if (tmp)
1575	esrv_send_item (tmp, op);
1576	}
1577	else
1578	{
1579	op->remove ();	1597	remove ();
1580	op->nrof = 0;	1598	return this;
1581	if (tmp)
1582	esrv_del_item (tmp->contr, op->count);
1583	}
1584	}	1599	}
1585	else	1600	else
1586	{	1601	{
1587	object *above = op->above;	1602	decrease (nr);
1588		1603
1589	if (i < op->nrof)	1604	object *op = object_create_clone (this);
1590	op->nrof -= i;	1605	op->nrof = nr;
1591	else
1592	{
1593	op->remove ();
1594	op->nrof = 0;
1595	}
1596
1597	/* Since we just removed op, op->above is null */
1598	for (tmp = above; tmp; tmp = tmp->above)
1599	if (tmp->type == PLAYER)
1600	{
1601	if (op->nrof)
1602	esrv_send_item (tmp, op);
1603	else
1604	esrv_del_item (tmp->contr, op->count);
1605	}
1606	}
1607
1608	if (op->nrof)
1609	return op;	1606	return op;
1610	else
1611	{
1612	op->destroy ();
1613	return 0;
1614	}
1615	}
1616
1617	/*
1618	* add_weight(object, weight) adds the specified weight to an object,
1619	* and also updates how much the environment(s) is/are carrying.
1620	*/
1621	void
1622	add_weight (object *op, signed long weight)
1623	{
1624	while (op != NULL)
1625	{
1626	if (op->type == CONTAINER)
1627	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1628
1629	op->carrying += weight;
1630	op = op->env;
1631	}	1607	}
1632	}	1608	}
1633		1609
1634	object *	1610	object *
1635	insert_ob_in_ob (object op, object where)	1611	insert_ob_in_ob (object op, object where)
…		…
1660	* be != op, if items are merged. -Tero	1636	* be != op, if items are merged. -Tero
1661	*/	1637	*/
1662	object *	1638	object *
1663	object::insert (object *op)	1639	object::insert (object *op)
1664	{	1640	{
1665	if (!QUERY_FLAG (op, FLAG_REMOVED))
1666	op->remove ();
1667
1668	if (op->more)	1641	if (op->more)
1669	{	1642	{
1670	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1643	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1671	return op;	1644	return op;
1672	}	1645	}
1673		1646
1674	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1647	op->remove ();
1675	CLEAR_FLAG (op, FLAG_REMOVED);	1648
		1649	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1676		1650
1677	if (op->nrof)	1651	if (op->nrof)
1678	{
1679	for (object *tmp = inv; tmp; tmp = tmp->below)	1652	for (object *tmp = inv; tmp; tmp = tmp->below)
1680	if (object::can_merge (tmp, op))	1653	if (object::can_merge (tmp, op))
1681	{	1654	{
1682	/* return the original object and remove inserted object	1655	/* return the original object and remove inserted object
1683	(client needs the original object) */	1656	(client needs the original object) */
1684	tmp->nrof += op->nrof;	1657	tmp->nrof += op->nrof;
1685	/* Weight handling gets pretty funky. Since we are adding to	1658
1686	* tmp->nrof, we need to increase the weight.	1659	if (object *pl = tmp->visible_to ())
1687	*/	1660	esrv_update_item (UPD_NROF, pl, tmp);
		1661
1688	add_weight (this, op->weight * op->nrof);	1662	adjust_weight (this, op->total_weight ());
1689	SET_FLAG (op, FLAG_REMOVED);	1663
1690	op->destroy (); /* free the inserted object */	1664	op->destroy (1);
1691	op = tmp;	1665	op = tmp;
1692	op->remove (); /* and fix old object's links */	1666	goto inserted;
1693	CLEAR_FLAG (op, FLAG_REMOVED);
1694	break;
1695	}	1667	}
1696		1668
1697	/* I assume combined objects have no inventory
1698	* We add the weight - this object could have just been removed
1699	* (if it was possible to merge). calling remove_ob will subtract
1700	* the weight, so we need to add it in again, since we actually do
1701	* the linking below
1702	*/
1703	add_weight (this, op->weight * op->nrof);
1704	}
1705	else
1706	add_weight (this, (op->weight + op->carrying));
1707
1708	if (object *otmp = this->in_player ())
1709	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1710	otmp->update_stats ();
1711
1712	op->owner = 0; // its his/hers now. period.	1669	op->owner = 0; // it's his/hers now. period.
1713	op->map = 0;	1670	op->map = 0;
		1671	op->x = 0;
		1672	op->y = 0;
		1673
		1674	op->above = 0;
		1675	op->below = inv;
1714	op->env = this;	1676	op->env = this;
1715	op->above = 0;
1716	op->below = 0;
1717	op->x = op->y = 0;
1718		1677
		1678	if (inv)
		1679	inv->above = op;
		1680
		1681	inv = op;
		1682
		1683	op->flag [FLAG_REMOVED] = 0;
		1684
		1685	if (object *pl = op->visible_to ())
		1686	esrv_send_item (pl, op);
		1687
		1688	adjust_weight (this, op->total_weight ());
		1689
		1690	inserted:
1719	/* reset the light list and los of the players on the map */	1691	/* reset the light list and los of the players on the map */
1720	if (op->glow_radius && map)	1692	if (op->glow_radius && map && map->darkness)
1721	{
1722	#ifdef DEBUG_LIGHTS
1723	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1724	#endif /* DEBUG_LIGHTS */
1725	if (map->darkness)
1726	update_all_los (map, x, y);	1693	update_all_los (map, x, y);
1727	}
1728		1694
1729	/* Client has no idea of ordering so lets not bother ordering it here.	1695	// if this is a player's inventory, update stats
1730	* It sure simplifies this function...	1696	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1731	*/	1697	update_stats ();
1732	if (!inv)
1733	inv = op;
1734	else
1735	{
1736	op->below = inv;
1737	op->below->above = op;
1738	inv = op;
1739	}
1740		1698
1741	INVOKE_OBJECT (INSERT, this);	1699	INVOKE_OBJECT (INSERT, this);
1742		1700
1743	return op;	1701	return op;
1744	}	1702	}
…		…
2622	&name,	2580	&name,
2623	title ? "\",title:\"" : "",	2581	title ? "\",title:\"" : "",
2624	title ? (const char *)title : "",	2582	title ? (const char *)title : "",
2625	flag_desc (flagdesc, 512), type);	2583	flag_desc (flagdesc, 512), type);
2626		2584
2627	if (!this->flag[FLAG_REMOVED] && env)	2585	if (!flag[FLAG_REMOVED] && env)
2628	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2586	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2629		2587
2630	if (map)	2588	if (map)
2631	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2589	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2632		2590
…		…
2662	object::open_container (object *new_container)	2620	object::open_container (object *new_container)
2663	{	2621	{
2664	if (container == new_container)	2622	if (container == new_container)
2665	return;	2623	return;
2666		2624
2667	if (object *old_container = container)	2625	object *old_container = container;
		2626
		2627	if (old_container)
2668	{	2628	{
2669	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2629	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2670	return;	2630	return;
2671		2631
2672	#if 0	2632	#if 0
…		…
2674	if (object *closer = old_container->inv)	2634	if (object *closer = old_container->inv)
2675	if (closer->type == CLOSE_CON)	2635	if (closer->type == CLOSE_CON)
2676	closer->destroy ();	2636	closer->destroy ();
2677	#endif	2637	#endif
2678		2638
		2639	// make sure the container is available
		2640	esrv_send_item (this, old_container);
		2641
2679	old_container->flag [FLAG_APPLIED] = 0;	2642	old_container->flag [FLAG_APPLIED] = false;
2680	container = 0;	2643	container = 0;
2681		2644
		2645	// client needs item update to make it work, client bug requires this to be separate
2682	esrv_update_item (UPD_FLAGS, this, old_container);	2646	esrv_update_item (UPD_FLAGS, this, old_container);
		2647
2683	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2648	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2684	play_sound (sound_find ("chest_close"));	2649	play_sound (sound_find ("chest_close"));
2685	}	2650	}
2686		2651
2687	if (new_container)	2652	if (new_container)
…		…
2700	}	2665	}
2701	#endif	2666	#endif
2702		2667
2703	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2668	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2704		2669
		2670	// make sure the container is available, client bug requires this to be separate
		2671	esrv_send_item (this, new_container);
		2672
2705	new_container->flag [FLAG_APPLIED] = 1;	2673	new_container->flag [FLAG_APPLIED] = true;
2706	container = new_container;	2674	container = new_container;
2707		2675
		2676	// client needs flag change
2708	esrv_update_item (UPD_FLAGS, this, new_container);	2677	esrv_update_item (UPD_FLAGS, this, new_container);
2709	esrv_send_inventory (this, new_container);	2678	esrv_send_inventory (this, new_container);
2710	play_sound (sound_find ("chest_open"));	2679	play_sound (sound_find ("chest_open"));
2711	}	2680	}
		2681	// else if (!old_container->env && contr && contr->ns)
		2682	// contr->ns->floorbox_reset ();
2712	}	2683	}
2713		2684
2714	object *	2685	object *
2715	object::force_find (const shstr name)	2686	object::force_find (const shstr name)
2716	{	2687	{
…		…
2742		2713
2743	insert (force);	2714	insert (force);
2744	}	2715	}
2745		2716
2746	void	2717	void
2747	object::play_sound (faceidx sound) const	2718	object::play_sound (faceidx sound)
2748	{	2719	{
2749	if (!sound)	2720	if (!sound)
2750	return;	2721	return;
2751		2722
2752	if (flag [FLAG_REMOVED])	2723	if (flag [FLAG_REMOVED])

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.206 by root, Tue Apr 15 14:21:04 2008 UTC vs. Revision 1.223 by root, Wed Apr 30 08:29:31 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.206 by root, Tue Apr 15 14:21:04 2008 UTC vs.
Revision 1.223 by root, Wed Apr 30 08:29:31 2008 UTC